@synnaxlabs/pluto 0.21.9 → 0.23.0

package/dist/external-B-zN2e5z.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"external-B-zN2e5z.cjs","sources":["../../node_modules/.pnpm/fuse.js@7.0.0/node_modules/fuse.js/dist/fuse.mjs","../../node_modules/.pnpm/proxy-compare@2.3.0/node_modules/proxy-compare/dist/index.modern.js","../../node_modules/.pnpm/proxy-memoize@1.2.0/node_modules/proxy-memoize/dist/index.modern.js","../src/memo/proxyMemo.ts","../src/hooks/useFilter.ts","../src/list/Filter.tsx"],"sourcesContent":["/**\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","const e=Symbol(),t=Symbol(),r=Symbol();let n=(e,t)=>new Proxy(e,t);const o=Object.getPrototypeOf,s=new WeakMap,c=e=>e&&(s.has(e)?s.get(e):o(e)===Object.prototype||o(e)===Array.prototype),l=e=>\"object\"==typeof e&&null!==e,a=new WeakMap,f=e=>e[r]||e,i=(s,l,p)=>{if(!c(s))return s;const y=f(s),u=(e=>Object.isFrozen(e)||Object.values(Object.getOwnPropertyDescriptors(e)).some(e=>!e.writable))(y);let g=p&&p.get(y);return g&&g[1].f===u||(g=((n,o)=>{const s={f:o};let c=!1;const l=(t,r)=>{if(!c){let o=s.a.get(n);o||(o=new Set,s.a.set(n,o)),r&&o.has(e)||o.add(t)}},a={get:(e,t)=>t===r?n:(l(t),i(e[t],s.a,s.c)),has:(e,r)=>r===t?(c=!0,s.a.delete(n),!0):(l(r),r in e),getOwnPropertyDescriptor:(e,t)=>(l(t,!0),Object.getOwnPropertyDescriptor(e,t)),ownKeys:t=>(l(e),Reflect.ownKeys(t))};return o&&(a.set=a.deleteProperty=()=>!1),[a,s]})(y,u),g[1].p=n(u?(e=>{let t=a.get(e);if(!t){if(Array.isArray(e))t=Array.from(e);else{const r=Object.getOwnPropertyDescriptors(e);Object.values(r).forEach(e=>{e.configurable=!0}),t=Object.create(o(e),r)}a.set(e,t)}return t})(y):y,g[0]),p&&p.set(y,g)),g[1].a=l,g[1].c=p,g[1].p},p=(e,t)=>{const r=Reflect.ownKeys(e),n=Reflect.ownKeys(t);return r.length!==n.length||r.some((e,t)=>e!==n[t])},y=(t,r,n,o)=>{if(Object.is(t,r))return!1;if(!l(t)||!l(r))return!0;const s=n.get(f(t));if(!s)return!0;if(o){const e=o.get(t);if(e&&e.n===r)return e.g;o.set(t,{n:r,g:!1})}let c=null;for(const l of s){const s=l===e?p(t,r):y(t[l],r[l],n,o);if(!0!==s&&!1!==s||(c=s),c)break}return null===c&&(c=!0),o&&o.set(t,{n:r,g:c}),c},u=e=>!!c(e)&&t in e,g=e=>c(e)&&e[r]||null,b=(e,t=!0)=>{s.set(e,t)},O=(e,t)=>{const r=[],n=new WeakSet,o=(e,s)=>{if(n.has(e))return;l(e)&&n.add(e);const c=l(e)&&t.get(f(e));c?c.forEach(t=>{o(e[t],s?[...s,t]:[t])}):s&&r.push(s)};return o(e),r},w=e=>{n=e};export{O as affectedToPathList,i as createProxy,g as getUntracked,y as isChanged,b as markToTrack,w as replaceNewProxy,u as trackMemo};\n//# sourceMappingURL=index.modern.mjs.map\n","import{getUntracked as e,isChanged as t,createProxy as r,trackMemo as o}from\"proxy-compare\";export{getUntracked as getUntrackedObject,replaceNewProxy}from\"proxy-compare\";const n=e=>\"object\"==typeof e&&null!==e,a=(t,r)=>{if(!n(t))return t;const c=e(t);return null!==c?(o(t),c):(r.has(t)||(r.add(t),Object.entries(t).forEach(([e,o])=>{const n=a(o,r);Object.is(n,o)||(t[e]=n)})),t)},c=(t,r,o)=>{if(!n(t)||!n(r))return;const a=o.get(e(r)||r);a&&a.forEach(e=>{c(t[e],r[e],o)})},s=(o,n)=>{var s;let p=0;const f=null!=(s=null==n?void 0:n.size)?s:1,l=[],u=new WeakMap,i=new WeakMap;return n=>{const s=e(n)||n,k=u.get(s);if(k)return c(n,k.o,k.a),k.r;for(let e=0;e<f;e+=1){const r=l[(p+e)%f];if(!r)break;if(!t(r.o,n,r.a,new WeakMap))return u.set(s,r),c(n,r.o,r.a),r.r}const d=new WeakMap,w=r(n,d,i),b=a(o(w),new Set);c(n,n,d);const m={o:n,r:b,a:d};return p=(p-1+f)%f,l[p]=m,u.set(s,m),b}};export{s as default};\n//# sourceMappingURL=index.modern.mjs.map\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { runtime } from \"@synnaxlabs/x\";\nimport memoize from \"proxy-memoize\";\n\nexport const proxyMemo: typeof memoize = (fn, opts) => {\n  if (runtime.RUNTIME === \"browser\") return memoize(fn, opts);\n  return fn;\n};\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport {\n  type ArrayTransform,\n  type Keyed,\n  type Key,\n  type TermSearcher,\n} from \"@synnaxlabs/x\";\nimport Fuse, { type IFuseOptions } from \"fuse.js\";\n\nimport { proxyMemo } from \"@/memo\";\n\n/** Props for the {@link createFilterTransform} function. */\nexport interface CreateFilterTransformProps<K extends Key, E extends Keyed<K>> {\n  term: string;\n  searcher?: TermSearcher<string, K, E> | ((data: E[]) => TermSearcher<string, K, E>);\n}\n\nconst defaultOpts: IFuseOptions<unknown> = {\n  threshold: 0.3,\n};\n\nexport const fuseFilter =\n  (opts?: IFuseOptions<unknown>) =>\n  <K extends Key, E extends Keyed<K>>(data: E[]): TermSearcher<string, K, E> => {\n    const fuse = new Fuse(data, {\n      keys: Object.keys(data[0]),\n      ...defaultOpts,\n      ...opts,\n    });\n    return {\n      type: \"fuse\",\n      page: (page: number, perPage: number) =>\n        data.slice(page * perPage, (page + 1) * perPage),\n      search: (term: string) => fuse.search(term).map(({ item }) => item),\n      retrieve: (keys: K[]) => data.filter((item) => keys.includes(item.key)),\n    };\n  };\n\nconst defaultFilter = fuseFilter();\n\n/**\n * @returns a transform that can be used to filter an array of objects in memory\n * based on a search query.\n *\n * Can be used in conjunction with `useTransform` to add search functionality\n * alongside other transforms.\n *\n * Uses fuse.js under the hood.\n *\n * @param query - The query to search for.\n * @param opts - The options to pass to the Fuse.js search. See the Fuse.js\n * documentation for more information on these options.\n */\nexport const createFilterTransform = <K extends Key, E extends Keyed<K>>({\n  term,\n  searcher = defaultFilter<K, E>,\n}: CreateFilterTransformProps<K, E>): ArrayTransform<E> =>\n  proxyMemo(({ data }) => {\n    if (typeof searcher === \"function\") {\n      if (term.length === 0 || data?.length === 0) return { data, transformed: false };\n      return { data: searcher(data).search(term), transformed: true };\n    }\n    return { data: searcher.search(term), transformed: true };\n  });\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement, useCallback } from \"react\";\n\nimport { type Key, type Keyed } from \"@synnaxlabs/x\";\n\nimport { createFilterTransform } from \"@/hooks\";\nimport { useDebouncedCallback } from \"@/hooks/useDebouncedCallback\";\nimport { Input } from \"@/input\";\nimport { type OptionalControl } from \"@/input/types\";\nimport { useDataUtilContext } from \"@/list/Data\";\nimport { state } from \"@/state\";\nimport { type RenderProp } from \"@/util/renderProp\";\n\nexport interface UseFilterProps extends OptionalControl<string> {\n  debounce?: number;\n  transformBefore?: (term: string) => string;\n}\n\nexport interface FilterProps extends UseFilterProps {\n  children?: RenderProp<Input.Control<string>>;\n}\n\nexport const useFilter = <K extends Key = Key, E extends Keyed<K> = Keyed<K>>({\n  debounce = 250,\n  value,\n  onChange,\n  transformBefore,\n}: UseFilterProps): Input.Control<string> => {\n  const [internalValue, setInternalValue] = state.usePurePassthrough<string>({\n    onChange,\n    value,\n    initial: \"\",\n  });\n  const { setTransform, deleteTransform } = useDataUtilContext<K, E>();\n\n  const debounced = useDebouncedCallback(setTransform, debounce, []);\n\n  const handleChange = useCallback(\n    (term: string) => {\n      setInternalValue(term);\n      if (term.length === 0) deleteTransform(\"filter\");\n      else {\n        if (transformBefore != null) term = transformBefore(term);\n        debounced(\"filter\", createFilterTransform({ term }));\n      }\n    },\n    [setInternalValue, transformBefore],\n  );\n\n  return { value: internalValue, onChange: handleChange };\n};\n\n/**\n * Implements in-browser filtration for a list.\n *\n * @param props - The props for the List.Search component.\n * @param props.children - A custom input render prop for the search functionality. This\n * must implement the InputControl<string> interface.\n * @param opts - Custom options for the search functionality. See the {@link fuse.IFuseOptions}\n * interface for more details.\n */\nexport const Filter = <K extends Key = Key, E extends Keyed<K> = Keyed<K>>({\n  children = (props) => <Input.Text {...props} />,\n  ...props\n}: FilterProps): ReactElement | null => children(useFilter<K, E>(props));\n\nexport interface Searcher<K extends Key = Key, E extends Keyed<K> = Keyed<K>> {\n  search: (term: string) => E[];\n}\n"],"names":["obj","path","i","a","norm","n","value","score","pattern","result","item","searchers","query","e","t","s","c","l","p","y","u","g","o","r","f","runtime","memoize","state.usePurePassthrough","useDataUtilContext","useDebouncedCallback","useCallback","props","jsx","Input.Text"],"mappings":";;;;;;;;AASA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,UACV,OAAO,KAAK,MAAM,mBAClB,MAAM,QAAQ,KAAK;AACzB;AAGA,MAAM,WAAW,IAAI;AACrB,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACR;AACD,MAAI,SAAS,QAAQ;AACrB,SAAO,UAAU,OAAO,IAAI,SAAS,CAAC,WAAW,OAAO;AAC1D;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,aAAa,KAAK;AAChD;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,UAAU,OAAO;AACxB,SACE,UAAU,QACV,UAAU,SACT,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAE7C;AAEA,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,UAAU;AAC1B;AAGA,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,KAAK,KAAK,UAAU;AACtC;AAEA,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU,UAAa,UAAU;AAC1C;AAEA,SAAS,QAAQ,OAAO;AACtB,SAAO,CAAC,MAAM,KAAI,EAAG;AACvB;AAIA,SAAS,OAAO,OAAO;AACrB,SAAO,SAAS,OACZ,UAAU,SACR,uBACA,kBACF,OAAO,UAAU,SAAS,KAAK,KAAK;AAC1C;AAEA,MAAM,8BAA8B;AAEpC,MAAM,uBAAuB;AAE7B,MAAM,uCAAuC,CAAC,QAC5C,yBAAyB,GAAG;AAE9B,MAAM,2BAA2B,CAAC,QAChC,iCAAiC,GAAG;AAEtC,MAAM,uBAAuB,CAAC,SAAS,WAAW,IAAI;AAEtD,MAAM,2BAA2B,CAAC,QAChC,6BAA6B,GAAG;AAElC,MAAM,SAAS,OAAO,UAAU;AAEhC,MAAM,SAAS;AAAA,EACb,YAAY,MAAM;AAChB,SAAK,QAAQ;AACb,SAAK,UAAU;AAEf,QAAI,cAAc;AAElB,SAAK,QAAQ,CAAC,QAAQ;AACpB,UAAI,MAAM,UAAU,GAAG;AAEvB,WAAK,MAAM,KAAK,GAAG;AACnB,WAAK,QAAQ,IAAI,EAAE,IAAI;AAEvB,qBAAe,IAAI;AAAA,IACzB,CAAK;AAGD,SAAK,MAAM,QAAQ,CAAC,QAAQ;AAC1B,UAAI,UAAU;AAAA,IACpB,CAAK;AAAA,EACF;AAAA,EACD,IAAI,OAAO;AACT,WAAO,KAAK,QAAQ,KAAK;AAAA,EAC1B;AAAA,EACD,OAAO;AACL,WAAO,KAAK;AAAA,EACb;AAAA,EACD,SAAS;AACP,WAAO,KAAK,UAAU,KAAK,KAAK;AAAA,EACjC;AACH;AAEA,SAAS,UAAU,KAAK;AACtB,MAAI,OAAO;AACX,MAAI,KAAK;AACT,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,SAAS,GAAG,KAAK,QAAQ,GAAG,GAAG;AACjC,UAAM;AACN,WAAO,cAAc,GAAG;AACxB,SAAK,YAAY,GAAG;AAAA,EACxB,OAAS;AACL,QAAI,CAAC,OAAO,KAAK,KAAK,MAAM,GAAG;AAC7B,YAAM,IAAI,MAAM,qBAAqB,MAAM,CAAC;AAAA,IAC7C;AAED,UAAM,OAAO,IAAI;AACjB,UAAM;AAEN,QAAI,OAAO,KAAK,KAAK,QAAQ,GAAG;AAC9B,eAAS,IAAI;AAEb,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,yBAAyB,IAAI,CAAC;AAAA,MAC/C;AAAA,IACF;AAED,WAAO,cAAc,IAAI;AACzB,SAAK,YAAY,IAAI;AACrB,YAAQ,IAAI;AAAA,EACb;AAED,SAAO,EAAE,MAAM,IAAI,QAAQ,KAAK,MAAO;AACzC;AAEA,SAAS,cAAc,KAAK;AAC1B,SAAO,QAAQ,GAAG,IAAI,MAAM,IAAI,MAAM,GAAG;AAC3C;AAEA,SAAS,YAAY,KAAK;AACxB,SAAO,QAAQ,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI;AACxC;AAEA,SAAS,IAAI,KAAK,MAAM;AACtB,MAAI,OAAO,CAAA;AACX,MAAI,MAAM;AAEV,QAAM,UAAU,CAACA,MAAKC,OAAM,UAAU;AACpC,QAAI,CAAC,UAAUD,IAAG,GAAG;AACnB;AAAA,IACD;AACD,QAAI,CAACC,MAAK,KAAK,GAAG;AAEhB,WAAK,KAAKD,IAAG;AAAA,IACnB,OAAW;AACL,UAAI,MAAMC,MAAK,KAAK;AAEpB,YAAM,QAAQD,KAAI,GAAG;AAErB,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACD;AAID,UACE,UAAUC,MAAK,SAAS,MACvB,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,KAAK,IACtD;AACA,aAAK,KAAK,SAAS,KAAK,CAAC;AAAA,MACjC,WAAiB,QAAQ,KAAK,GAAG;AACzB,cAAM;AAEN,iBAASC,KAAI,GAAG,MAAM,MAAM,QAAQA,KAAI,KAAKA,MAAK,GAAG;AACnD,kBAAQ,MAAMA,EAAC,GAAGD,OAAM,QAAQ,CAAC;AAAA,QAClC;AAAA,MACT,WAAiBA,MAAK,QAAQ;AAEtB,gBAAQ,OAAOA,OAAM,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACF;AAAA,EACL;AAGE,UAAQ,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC;AAEvD,SAAO,MAAM,OAAO,KAAK,CAAC;AAC5B;AAEA,MAAM,eAAe;AAAA;AAAA;AAAA;AAAA,EAInB,gBAAgB;AAAA;AAAA;AAAA,EAGhB,gBAAgB;AAAA;AAAA,EAEhB,oBAAoB;AACtB;AAEA,MAAM,eAAe;AAAA;AAAA;AAAA,EAGnB,iBAAiB;AAAA;AAAA,EAEjB,cAAc;AAAA;AAAA,EAEd,MAAM,CAAE;AAAA;AAAA,EAER,YAAY;AAAA;AAAA,EAEZ,QAAQ,CAACE,IAAG,MACVA,GAAE,UAAU,EAAE,QAASA,GAAE,MAAM,EAAE,MAAM,KAAK,IAAKA,GAAE,QAAQ,EAAE,QAAQ,KAAK;AAC9E;AAEA,MAAM,eAAe;AAAA;AAAA,EAEnB,UAAU;AAAA;AAAA;AAAA,EAGV,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMX,UAAU;AACZ;AAEA,MAAM,kBAAkB;AAAA;AAAA,EAEtB,mBAAmB;AAAA;AAAA;AAAA,EAGnB,OAAO;AAAA;AAAA;AAAA;AAAA,EAIP,gBAAgB;AAAA;AAAA;AAAA;AAAA,EAIhB,iBAAiB;AAAA;AAAA,EAEjB,iBAAiB;AACnB;AAEA,IAAI,SAAS;AAAA,EACX,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAEA,MAAM,QAAQ;AAId,SAAS,KAAK,SAAS,GAAG,WAAW,GAAG;AACtC,QAAM,QAAQ,oBAAI;AAClB,QAAM,IAAI,KAAK,IAAI,IAAI,QAAQ;AAE/B,SAAO;AAAA,IACL,IAAI,OAAO;AACT,YAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AAErC,UAAI,MAAM,IAAI,SAAS,GAAG;AACxB,eAAO,MAAM,IAAI,SAAS;AAAA,MAC3B;AAGD,YAAMC,QAAO,IAAI,KAAK,IAAI,WAAW,MAAM,MAAM;AAGjD,YAAMC,KAAI,WAAW,KAAK,MAAMD,QAAO,CAAC,IAAI,CAAC;AAE7C,YAAM,IAAI,WAAWC,EAAC;AAEtB,aAAOA;AAAA,IACR;AAAA,IACD,QAAQ;AACN,YAAM,MAAK;AAAA,IACZ;AAAA,EACF;AACH;AAEA,MAAM,UAAU;AAAA,EACd,YAAY;AAAA,IACV,QAAQ,OAAO;AAAA,IACf,kBAAkB,OAAO;AAAA,EAC1B,IAAG,IAAI;AACN,SAAK,OAAO,KAAK,iBAAiB,CAAC;AACnC,SAAK,QAAQ;AACb,SAAK,YAAY;AAEjB,SAAK,gBAAe;AAAA,EACrB;AAAA,EACD,WAAW,OAAO,IAAI;AACpB,SAAK,OAAO;AAAA,EACb;AAAA,EACD,gBAAgB,UAAU,IAAI;AAC5B,SAAK,UAAU;AAAA,EAChB;AAAA,EACD,QAAQ,OAAO,IAAI;AACjB,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,QAAQ,CAAC,KAAK,QAAQ;AACzB,WAAK,SAAS,IAAI,EAAE,IAAI;AAAA,IAC9B,CAAK;AAAA,EACF;AAAA,EACD,SAAS;AACP,QAAI,KAAK,aAAa,CAAC,KAAK,KAAK,QAAQ;AACvC;AAAA,IACD;AAED,SAAK,YAAY;AAGjB,QAAI,SAAS,KAAK,KAAK,CAAC,CAAC,GAAG;AAC1B,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MACrC,CAAO;AAAA,IACP,OAAW;AAEL,WAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,aAAK,WAAW,KAAK,QAAQ;AAAA,MACrC,CAAO;AAAA,IACF;AAED,SAAK,KAAK;EACX;AAAA;AAAA,EAED,IAAI,KAAK;AACP,UAAM,MAAM,KAAK;AAEjB,QAAI,SAAS,GAAG,GAAG;AACjB,WAAK,WAAW,KAAK,GAAG;AAAA,IAC9B,OAAW;AACL,WAAK,WAAW,KAAK,GAAG;AAAA,IACzB;AAAA,EACF;AAAA;AAAA,EAED,SAAS,KAAK;AACZ,SAAK,QAAQ,OAAO,KAAK,CAAC;AAG1B,aAASH,KAAI,KAAK,MAAM,KAAK,KAAM,GAAEA,KAAI,KAAKA,MAAK,GAAG;AACpD,WAAK,QAAQA,EAAC,EAAE,KAAK;AAAA,IACtB;AAAA,EACF;AAAA,EACD,uBAAuB,MAAM,OAAO;AAClC,WAAO,KAAK,KAAK,SAAS,KAAK,CAAC;AAAA,EACjC;AAAA,EACD,OAAO;AACL,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA,EACD,WAAW,KAAK,UAAU;AACxB,QAAI,CAAC,UAAU,GAAG,KAAK,QAAQ,GAAG,GAAG;AACnC;AAAA,IACD;AAED,QAAI,SAAS;AAAA,MACX,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,KAAK,KAAK,IAAI,GAAG;AAAA,IAC1B;AAEI,SAAK,QAAQ,KAAK,MAAM;AAAA,EACzB;AAAA,EACD,WAAW,KAAK,UAAU;AACxB,QAAI,SAAS,EAAE,GAAG,UAAU,GAAG,CAAE,EAAA;AAGjC,SAAK,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,UAAI,QAAQ,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI;AAEjE,UAAI,CAAC,UAAU,KAAK,GAAG;AACrB;AAAA,MACD;AAED,UAAI,QAAQ,KAAK,GAAG;AAClB,YAAI,aAAa,CAAA;AACjB,cAAM,QAAQ,CAAC,EAAE,gBAAgB,IAAI,MAAK,CAAE;AAE5C,eAAO,MAAM,QAAQ;AACnB,gBAAM,EAAE,gBAAgB,OAAAI,OAAO,IAAG,MAAM,IAAG;AAE3C,cAAI,CAAC,UAAUA,MAAK,GAAG;AACrB;AAAA,UACD;AAED,cAAI,SAASA,MAAK,KAAK,CAAC,QAAQA,MAAK,GAAG;AACtC,gBAAI,YAAY;AAAA,cACd,GAAGA;AAAA,cACH,GAAG;AAAA,cACH,GAAG,KAAK,KAAK,IAAIA,MAAK;AAAA,YACpC;AAEY,uBAAW,KAAK,SAAS;AAAA,UACrC,WAAqB,QAAQA,MAAK,GAAG;AACzB,YAAAA,OAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,oBAAM,KAAK;AAAA,gBACT,gBAAgB;AAAA,gBAChB,OAAO;AAAA,cACvB,CAAe;AAAA,YACf,CAAa;AAAA,UACb;AAAiB;AAAA,QACR;AACD,eAAO,EAAE,QAAQ,IAAI;AAAA,MAC7B,WAAiB,SAAS,KAAK,KAAK,CAAC,QAAQ,KAAK,GAAG;AAC7C,YAAI,YAAY;AAAA,UACd,GAAG;AAAA,UACH,GAAG,KAAK,KAAK,IAAI,KAAK;AAAA,QAChC;AAEQ,eAAO,EAAE,QAAQ,IAAI;AAAA,MACtB;AAAA,IACP,CAAK;AAED,SAAK,QAAQ,KAAK,MAAM;AAAA,EACzB;AAAA,EACD,SAAS;AACP,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,IACf;AAAA,EACF;AACH;AAEA,SAAS,YACP,MACA,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAe,IAAK,CAAE,GACvE;AACA,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAiB,CAAA;AACxD,UAAQ,QAAQ,KAAK,IAAI,SAAS,CAAC;AACnC,UAAQ,WAAW,IAAI;AACvB,UAAQ,OAAM;AACd,SAAO;AACT;AAEA,SAAS,WACP,MACA,EAAE,QAAQ,OAAO,OAAO,kBAAkB,OAAO,gBAAe,IAAK,CAAE,GACvE;AACA,QAAM,EAAE,MAAM,QAAS,IAAG;AAC1B,QAAM,UAAU,IAAI,UAAU,EAAE,OAAO,gBAAiB,CAAA;AACxD,UAAQ,QAAQ,IAAI;AACpB,UAAQ,gBAAgB,OAAO;AAC/B,SAAO;AACT;AAEA,SAAS,eACP,SACA;AAAA,EACE,SAAS;AAAA,EACT,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,WAAW,OAAO;AAAA,EAClB,iBAAiB,OAAO;AAC5B,IAAM,CAAE,GACN;AACA,QAAM,WAAW,SAAS,QAAQ;AAElC,MAAI,gBAAgB;AAClB,WAAO;AAAA,EACR;AAED,QAAM,YAAY,KAAK,IAAI,mBAAmB,eAAe;AAE7D,MAAI,CAAC,UAAU;AAEb,WAAO,YAAY,IAAM;AAAA,EAC1B;AAED,SAAO,WAAW,YAAY;AAChC;AAEA,SAAS,qBACP,YAAY,CAAE,GACd,qBAAqB,OAAO,oBAC5B;AACA,MAAI,UAAU,CAAA;AACd,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,MAAIJ,KAAI;AAER,WAAS,MAAM,UAAU,QAAQA,KAAI,KAAKA,MAAK,GAAG;AAChD,QAAI,QAAQ,UAAUA,EAAC;AACvB,QAAI,SAAS,UAAU,IAAI;AACzB,cAAQA;AAAA,IACT,WAAU,CAAC,SAAS,UAAU,IAAI;AACjC,YAAMA,KAAI;AACV,UAAI,MAAM,QAAQ,KAAK,oBAAoB;AACzC,gBAAQ,KAAK,CAAC,OAAO,GAAG,CAAC;AAAA,MAC1B;AACD,cAAQ;AAAA,IACT;AAAA,EACF;AAGD,MAAI,UAAUA,KAAI,CAAC,KAAKA,KAAI,SAAS,oBAAoB;AACvD,YAAQ,KAAK,CAAC,OAAOA,KAAI,CAAC,CAAC;AAAA,EAC5B;AAED,SAAO;AACT;AAGA,MAAM,WAAW;AAEjB,SAAS,OACP,MACA,SACA,iBACA;AAAA,EACE,WAAW,OAAO;AAAA,EAClB,WAAW,OAAO;AAAA,EAClB,YAAY,OAAO;AAAA,EACnB,iBAAiB,OAAO;AAAA,EACxB,qBAAqB,OAAO;AAAA,EAC5B,iBAAiB,OAAO;AAAA,EACxB,iBAAiB,OAAO;AAC5B,IAAM,CAAE,GACN;AACA,MAAI,QAAQ,SAAS,UAAU;AAC7B,UAAM,IAAI,MAAM,yBAAyB,QAAQ,CAAC;AAAA,EACnD;AAED,QAAM,aAAa,QAAQ;AAE3B,QAAM,UAAU,KAAK;AAErB,QAAM,mBAAmB,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,OAAO,CAAC;AAEhE,MAAI,mBAAmB;AAEvB,MAAI,eAAe;AAInB,QAAM,iBAAiB,qBAAqB,KAAK;AAEjD,QAAM,YAAY,iBAAiB,MAAM,OAAO,IAAI,CAAA;AAEpD,MAAI;AAGJ,UAAQ,QAAQ,KAAK,QAAQ,SAAS,YAAY,KAAK,IAAI;AACzD,QAAI,QAAQ,eAAe,SAAS;AAAA,MAClC,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACN,CAAK;AAED,uBAAmB,KAAK,IAAI,OAAO,gBAAgB;AACnD,mBAAe,QAAQ;AAEvB,QAAI,gBAAgB;AAClB,UAAIA,KAAI;AACR,aAAOA,KAAI,YAAY;AACrB,kBAAU,QAAQA,EAAC,IAAI;AACvB,QAAAA,MAAK;AAAA,MACN;AAAA,IACF;AAAA,EACF;AAGD,iBAAe;AAEf,MAAI,aAAa,CAAA;AACjB,MAAI,aAAa;AACjB,MAAI,SAAS,aAAa;AAE1B,QAAM,OAAO,KAAM,aAAa;AAEhC,WAASA,KAAI,GAAGA,KAAI,YAAYA,MAAK,GAAG;AAItC,QAAI,SAAS;AACb,QAAI,SAAS;AAEb,WAAO,SAAS,QAAQ;AACtB,YAAMK,SAAQ,eAAe,SAAS;AAAA,QACpC,QAAQL;AAAA,QACR,iBAAiB,mBAAmB;AAAA,QACpC;AAAA,QACA;AAAA,QACA;AAAA,MACR,CAAO;AAED,UAAIK,UAAS,kBAAkB;AAC7B,iBAAS;AAAA,MACjB,OAAa;AACL,iBAAS;AAAA,MACV;AAED,eAAS,KAAK,OAAO,SAAS,UAAU,IAAI,MAAM;AAAA,IACnD;AAGD,aAAS;AAET,QAAI,QAAQ,KAAK,IAAI,GAAG,mBAAmB,SAAS,CAAC;AACrD,QAAI,SAAS,iBACT,UACA,KAAK,IAAI,mBAAmB,QAAQ,OAAO,IAAI;AAGnD,QAAI,SAAS,MAAM,SAAS,CAAC;AAE7B,WAAO,SAAS,CAAC,KAAK,KAAKL,MAAK;AAEhC,aAAS,IAAI,QAAQ,KAAK,OAAO,KAAK,GAAG;AACvC,UAAI,kBAAkB,IAAI;AAC1B,UAAI,YAAY,gBAAgB,KAAK,OAAO,eAAe,CAAC;AAE5D,UAAI,gBAAgB;AAElB,kBAAU,eAAe,IAAI,CAAC,CAAC,CAAC;AAAA,MACjC;AAGD,aAAO,CAAC,KAAM,OAAO,IAAI,CAAC,KAAK,IAAK,KAAK;AAGzC,UAAIA,IAAG;AACL,eAAO,CAAC,MACJ,WAAW,IAAI,CAAC,IAAI,WAAW,CAAC,MAAM,IAAK,IAAI,WAAW,IAAI,CAAC;AAAA,MACpE;AAED,UAAI,OAAO,CAAC,IAAI,MAAM;AACpB,qBAAa,eAAe,SAAS;AAAA,UACnC,QAAQA;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACV,CAAS;AAID,YAAI,cAAc,kBAAkB;AAElC,6BAAmB;AACnB,yBAAe;AAGf,cAAI,gBAAgB,kBAAkB;AACpC;AAAA,UACD;AAGD,kBAAQ,KAAK,IAAI,GAAG,IAAI,mBAAmB,YAAY;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AAGD,UAAM,QAAQ,eAAe,SAAS;AAAA,MACpC,QAAQA,KAAI;AAAA,MACZ,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,IACN,CAAK;AAED,QAAI,QAAQ,kBAAkB;AAC5B;AAAA,IACD;AAED,iBAAa;AAAA,EACd;AAED,QAAM,SAAS;AAAA,IACb,SAAS,gBAAgB;AAAA;AAAA,IAEzB,OAAO,KAAK,IAAI,MAAO,UAAU;AAAA,EACrC;AAEE,MAAI,gBAAgB;AAClB,UAAM,UAAU,qBAAqB,WAAW,kBAAkB;AAClE,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO,UAAU;AAAA,IAClB,WAAU,gBAAgB;AACzB,aAAO,UAAU;AAAA,IAClB;AAAA,EACF;AAED,SAAO;AACT;AAEA,SAAS,sBAAsB,SAAS;AACtC,MAAI,OAAO,CAAA;AAEX,WAASA,KAAI,GAAG,MAAM,QAAQ,QAAQA,KAAI,KAAKA,MAAK,GAAG;AACrD,UAAM,OAAO,QAAQ,OAAOA,EAAC;AAC7B,SAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAM,KAAM,MAAMA,KAAI;AAAA,EACnD;AAED,SAAO;AACT;AAEA,MAAM,YAAY;AAAA,EAChB,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,iBAAiB,OAAO;AAAA,EAC9B,IAAQ,CAAE,GACN;AACA,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,SAAK,UAAU,kBAAkB,UAAU,QAAQ,YAAW;AAE9D,SAAK,SAAS;AAEd,QAAI,CAAC,KAAK,QAAQ,QAAQ;AACxB;AAAA,IACD;AAED,UAAM,WAAW,CAACM,UAAS,eAAe;AACxC,WAAK,OAAO,KAAK;AAAA,QACf,SAAAA;AAAA,QACA,UAAU,sBAAsBA,QAAO;AAAA,QACvC;AAAA,MACR,CAAO;AAAA,IACP;AAEI,UAAM,MAAM,KAAK,QAAQ;AAEzB,QAAI,MAAM,UAAU;AAClB,UAAIN,KAAI;AACR,YAAM,YAAY,MAAM;AACxB,YAAM,MAAM,MAAM;AAElB,aAAOA,KAAI,KAAK;AACd,iBAAS,KAAK,QAAQ,OAAOA,IAAG,QAAQ,GAAGA,EAAC;AAC5C,QAAAA,MAAK;AAAA,MACN;AAED,UAAI,WAAW;AACb,cAAM,aAAa,MAAM;AACzB,iBAAS,KAAK,QAAQ,OAAO,UAAU,GAAG,UAAU;AAAA,MACrD;AAAA,IACP,OAAW;AACL,eAAS,KAAK,SAAS,CAAC;AAAA,IACzB;AAAA,EACF;AAAA,EAED,SAAS,MAAM;AACb,UAAM,EAAE,iBAAiB,mBAAmB,KAAK;AAEjD,QAAI,CAAC,iBAAiB;AACpB,aAAO,KAAK;IACb;AAGD,QAAI,KAAK,YAAY,MAAM;AACzB,UAAIO,UAAS;AAAA,QACX,SAAS;AAAA,QACT,OAAO;AAAA,MACf;AAEM,UAAI,gBAAgB;AAClB,QAAAA,QAAO,UAAU,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;AAAA,MACvC;AAED,aAAOA;AAAA,IACR;AAGD,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ,KAAK;AAET,QAAI,aAAa,CAAA;AACjB,QAAI,aAAa;AACjB,QAAI,aAAa;AAEjB,SAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,iBAAiB;AACzD,YAAM,EAAE,SAAS,OAAO,QAAO,IAAK,OAAO,MAAM,SAAS,UAAU;AAAA,QAClE,UAAU,WAAW;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACR,CAAO;AAED,UAAI,SAAS;AACX,qBAAa;AAAA,MACd;AAED,oBAAc;AAEd,UAAI,WAAW,SAAS;AACtB,qBAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,MACxC;AAAA,IACP,CAAK;AAED,QAAI,SAAS;AAAA,MACX,SAAS;AAAA,MACT,OAAO,aAAa,aAAa,KAAK,OAAO,SAAS;AAAA,IAC5D;AAEI,QAAI,cAAc,gBAAgB;AAChC,aAAO,UAAU;AAAA,IAClB;AAED,WAAO;AAAA,EACR;AACH;AAEA,MAAM,UAAU;AAAA,EACd,YAAY,SAAS;AACnB,SAAK,UAAU;AAAA,EAChB;AAAA,EACD,OAAO,aAAa,SAAS;AAC3B,WAAO,SAAS,SAAS,KAAK,UAAU;AAAA,EACzC;AAAA,EACD,OAAO,cAAc,SAAS;AAC5B,WAAO,SAAS,SAAS,KAAK,WAAW;AAAA,EAC1C;AAAA,EACD,SAAiB;AAAA,EAAE;AACrB;AAEA,SAAS,SAAS,SAAS,KAAK;AAC9B,QAAM,UAAU,QAAQ,MAAM,GAAG;AACjC,SAAO,UAAU,QAAQ,CAAC,IAAI;AAChC;AAIA,MAAM,mBAAmB,UAAU;AAAA,EACjC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,UAAU,SAAS,KAAK;AAE9B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACrC;AAAA,EACF;AACH;AAIA,MAAM,0BAA0B,UAAU;AAAA,EACxC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,QAAQ,KAAK,QAAQ,KAAK,OAAO;AACvC,UAAM,UAAU,UAAU;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AACH;AAIA,MAAM,yBAAyB,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,WAAW,KAAK,OAAO;AAE5C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,QAAQ,SAAS,CAAC;AAAA,IACrC;AAAA,EACF;AACH;AAIA,MAAM,gCAAgC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,WAAW,KAAK,OAAO;AAE7C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AACH;AAIA,MAAM,yBAAyB,UAAU;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,UAAU,KAAK,SAAS,KAAK,OAAO;AAE1C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,KAAK,SAAS,KAAK,QAAQ,QAAQ,KAAK,SAAS,CAAC;AAAA,IAC7D;AAAA,EACF;AACH;AAIA,MAAM,gCAAgC,UAAU;AAAA,EAC9C,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,UAAM,UAAU,CAAC,KAAK,SAAS,KAAK,OAAO;AAC3C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB,SAAS,CAAC,GAAG,KAAK,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AACH;AAEA,MAAM,mBAAmB,UAAU;AAAA,EACjC,YACE,SACA;AAAA,IACE,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,kBAAkB,OAAO;AAAA,IACzB,iBAAiB,OAAO;AAAA,EAC9B,IAAQ,CAAE,GACN;AACA,UAAM,OAAO;AACb,SAAK,eAAe,IAAI,YAAY,SAAS;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,CAAK;AAAA,EACF;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,WAAO,KAAK,aAAa,SAAS,IAAI;AAAA,EACvC;AACH;AAIA,MAAM,qBAAqB,UAAU;AAAA,EACnC,YAAY,SAAS;AACnB,UAAM,OAAO;AAAA,EACd;AAAA,EACD,WAAW,OAAO;AAChB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,aAAa;AACtB,WAAO;AAAA,EACR;AAAA,EACD,WAAW,cAAc;AACvB,WAAO;AAAA,EACR;AAAA,EACD,OAAO,MAAM;AACX,QAAI,WAAW;AACf,QAAI;AAEJ,UAAM,UAAU,CAAA;AAChB,UAAM,aAAa,KAAK,QAAQ;AAGhC,YAAQ,QAAQ,KAAK,QAAQ,KAAK,SAAS,QAAQ,KAAK,IAAI;AAC1D,iBAAW,QAAQ;AACnB,cAAQ,KAAK,CAAC,OAAO,WAAW,CAAC,CAAC;AAAA,IACnC;AAED,UAAM,UAAU,CAAC,CAAC,QAAQ;AAE1B,WAAO;AAAA,MACL;AAAA,MACA,OAAO,UAAU,IAAI;AAAA,MACrB;AAAA,IACD;AAAA,EACF;AACH;AAGA,MAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,eAAe,UAAU;AAG/B,MAAM,WAAW;AACjB,MAAM,WAAW;AAKjB,SAAS,WAAW,SAAS,UAAU,IAAI;AACzC,SAAO,QAAQ,MAAM,QAAQ,EAAE,IAAI,CAAC,SAAS;AAC3C,QAAI,QAAQ,KACT,KAAM,EACN,MAAM,QAAQ,EACd,OAAO,CAACC,UAASA,SAAQ,CAAC,CAACA,MAAK,KAAI,CAAE;AAEzC,QAAI,UAAU,CAAA;AACd,aAASR,KAAI,GAAG,MAAM,MAAM,QAAQA,KAAI,KAAKA,MAAK,GAAG;AACnD,YAAM,YAAY,MAAMA,EAAC;AAGzB,UAAI,QAAQ;AACZ,UAAI,MAAM;AACV,aAAO,CAAC,SAAS,EAAE,MAAM,cAAc;AACrC,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,aAAa,SAAS;AAC3C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC,kBAAQ;AAAA,QACT;AAAA,MACF;AAED,UAAI,OAAO;AACT;AAAA,MACD;AAGD,YAAM;AACN,aAAO,EAAE,MAAM,cAAc;AAC3B,cAAM,WAAW,UAAU,GAAG;AAC9B,YAAI,QAAQ,SAAS,cAAc,SAAS;AAC5C,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI,SAAS,OAAO,OAAO,CAAC;AACzC;AAAA,QACD;AAAA,MACF;AAAA,IACF;AAED,WAAO;AAAA,EACX,CAAG;AACH;AAIA,MAAM,gBAAgB,oBAAI,IAAI,CAAC,WAAW,MAAM,aAAa,IAAI,CAAC;AA8BlE,MAAM,eAAe;AAAA,EACnB,YACE,SACA;AAAA,IACE,kBAAkB,OAAO;AAAA,IACzB,iBAAiB,OAAO;AAAA,IACxB,qBAAqB,OAAO;AAAA,IAC5B,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,EACxB,IAAQ,CAAE,GACN;AACA,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,SAAK,UAAU,kBAAkB,UAAU,QAAQ,YAAW;AAC9D,SAAK,QAAQ,WAAW,KAAK,SAAS,KAAK,OAAO;AAAA,EACnD;AAAA,EAED,OAAO,UAAU,GAAG,SAAS;AAC3B,WAAO,QAAQ;AAAA,EAChB;AAAA,EAED,SAAS,MAAM;AACb,UAAM,QAAQ,KAAK;AAEnB,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO;AAAA,MACR;AAAA,IACF;AAED,UAAM,EAAE,gBAAgB,oBAAoB,KAAK;AAEjD,WAAO,kBAAkB,OAAO,KAAK,YAAW;AAEhD,QAAI,aAAa;AACjB,QAAI,aAAa,CAAA;AACjB,QAAI,aAAa;AAGjB,aAASA,KAAI,GAAG,OAAO,MAAM,QAAQA,KAAI,MAAMA,MAAK,GAAG;AACrD,YAAMS,aAAY,MAAMT,EAAC;AAGzB,iBAAW,SAAS;AACpB,mBAAa;AAGb,eAAS,IAAI,GAAG,OAAOS,WAAU,QAAQ,IAAI,MAAM,KAAK,GAAG;AACzD,cAAM,WAAWA,WAAU,CAAC;AAC5B,cAAM,EAAE,SAAS,SAAS,MAAO,IAAG,SAAS,OAAO,IAAI;AAExD,YAAI,SAAS;AACX,wBAAc;AACd,wBAAc;AACd,cAAI,gBAAgB;AAClB,kBAAM,OAAO,SAAS,YAAY;AAClC,gBAAI,cAAc,IAAI,IAAI,GAAG;AAC3B,2BAAa,CAAC,GAAG,YAAY,GAAG,OAAO;AAAA,YACrD,OAAmB;AACL,yBAAW,KAAK,OAAO;AAAA,YACxB;AAAA,UACF;AAAA,QACX,OAAe;AACL,uBAAa;AACb,uBAAa;AACb,qBAAW,SAAS;AACpB;AAAA,QACD;AAAA,MACF;AAGD,UAAI,YAAY;AACd,YAAI,SAAS;AAAA,UACX,SAAS;AAAA,UACT,OAAO,aAAa;AAAA,QAC9B;AAEQ,YAAI,gBAAgB;AAClB,iBAAO,UAAU;AAAA,QAClB;AAED,eAAO;AAAA,MACR;AAAA,IACF;AAGD,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,IACR;AAAA,EACF;AACH;AAEA,MAAM,sBAAsB,CAAA;AAE5B,SAAS,YAAY,MAAM;AACzB,sBAAoB,KAAK,GAAG,IAAI;AAClC;AAEA,SAAS,eAAe,SAAS,SAAS;AACxC,WAAST,KAAI,GAAG,MAAM,oBAAoB,QAAQA,KAAI,KAAKA,MAAK,GAAG;AACjE,QAAI,gBAAgB,oBAAoBA,EAAC;AACzC,QAAI,cAAc,UAAU,SAAS,OAAO,GAAG;AAC7C,aAAO,IAAI,cAAc,SAAS,OAAO;AAAA,IAC1C;AAAA,EACF;AAED,SAAO,IAAI,YAAY,SAAS,OAAO;AACzC;AAEA,MAAM,kBAAkB;AAAA,EACtB,KAAK;AAAA,EACL,IAAI;AACN;AAEA,MAAM,UAAU;AAAA,EACd,MAAM;AAAA,EACN,SAAS;AACX;AAEA,MAAM,eAAe,CAAC,UACpB,CAAC,EAAE,MAAM,gBAAgB,GAAG,KAAK,MAAM,gBAAgB,EAAE;AAE3D,MAAM,SAAS,CAAC,UAAU,CAAC,CAAC,MAAM,QAAQ,IAAI;AAE9C,MAAM,SAAS,CAAC,UACd,CAAC,QAAQ,KAAK,KAAK,SAAS,KAAK,KAAK,CAAC,aAAa,KAAK;AAE3D,MAAM,oBAAoB,CAAC,WAAW;AAAA,EACpC,CAAC,gBAAgB,GAAG,GAAG,OAAO,KAAK,KAAK,EAAE,IAAI,CAAC,SAAS;AAAA,IACtD,CAAC,GAAG,GAAG,MAAM,GAAG;AAAA,EACpB,EAAI;AACJ;AAIA,SAAS,MAAM,OAAO,SAAS,EAAE,OAAO,KAAM,IAAG,IAAI;AACnD,QAAM,OAAO,CAACU,WAAU;AACtB,QAAI,OAAO,OAAO,KAAKA,MAAK;AAE5B,UAAM,cAAc,OAAOA,MAAK;AAEhC,QAAI,CAAC,eAAe,KAAK,SAAS,KAAK,CAAC,aAAaA,MAAK,GAAG;AAC3D,aAAO,KAAK,kBAAkBA,MAAK,CAAC;AAAA,IACrC;AAED,QAAI,OAAOA,MAAK,GAAG;AACjB,YAAM,MAAM,cAAcA,OAAM,QAAQ,IAAI,IAAI,KAAK,CAAC;AAEtD,YAAM,UAAU,cAAcA,OAAM,QAAQ,OAAO,IAAIA,OAAM,GAAG;AAEhE,UAAI,CAAC,SAAS,OAAO,GAAG;AACtB,cAAM,IAAI,MAAM,qCAAqC,GAAG,CAAC;AAAA,MAC1D;AAED,YAAM,MAAM;AAAA,QACV,OAAO,YAAY,GAAG;AAAA,QACtB;AAAA,MACR;AAEM,UAAI,MAAM;AACR,YAAI,WAAW,eAAe,SAAS,OAAO;AAAA,MAC/C;AAED,aAAO;AAAA,IACR;AAED,QAAI,OAAO;AAAA,MACT,UAAU,CAAE;AAAA,MACZ,UAAU,KAAK,CAAC;AAAA,IACtB;AAEI,SAAK,QAAQ,CAAC,QAAQ;AACpB,YAAM,QAAQA,OAAM,GAAG;AAEvB,UAAI,QAAQ,KAAK,GAAG;AAClB,cAAM,QAAQ,CAAC,SAAS;AACtB,eAAK,SAAS,KAAK,KAAK,IAAI,CAAC;AAAA,QACvC,CAAS;AAAA,MACF;AAAA,IACP,CAAK;AAED,WAAO;AAAA,EACX;AAEE,MAAI,CAAC,aAAa,KAAK,GAAG;AACxB,YAAQ,kBAAkB,KAAK;AAAA,EAChC;AAED,SAAO,KAAK,KAAK;AACnB;AAGA,SAAS,aACP,SACA,EAAE,kBAAkB,OAAO,gBAAiB,GAC5C;AACA,UAAQ,QAAQ,CAAC,WAAW;AAC1B,QAAI,aAAa;AAEjB,WAAO,QAAQ,QAAQ,CAAC,EAAE,KAAK,MAAAR,OAAM,YAAY;AAC/C,YAAM,SAAS,MAAM,IAAI,SAAS;AAElC,oBAAc,KAAK;AAAA,QACjB,UAAU,KAAK,SAAS,OAAO,UAAU;AAAA,SACxC,UAAU,MAAM,kBAAkB,IAAIA;AAAA,MAC/C;AAAA,IACA,CAAK;AAED,WAAO,QAAQ;AAAA,EACnB,CAAG;AACH;AAEA,SAAS,iBAAiB,QAAQ,MAAM;AACtC,QAAM,UAAU,OAAO;AACvB,OAAK,UAAU;AAEf,MAAI,CAAC,UAAU,OAAO,GAAG;AACvB;AAAA,EACD;AAED,UAAQ,QAAQ,CAAC,UAAU;AACzB,QAAI,CAAC,UAAU,MAAM,OAAO,KAAK,CAAC,MAAM,QAAQ,QAAQ;AACtD;AAAA,IACD;AAED,UAAM,EAAE,SAAS,MAAO,IAAG;AAE3B,QAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,IACN;AAEI,QAAI,MAAM,KAAK;AACb,UAAI,MAAM,MAAM,IAAI;AAAA,IACrB;AAED,QAAI,MAAM,MAAM,IAAI;AAClB,UAAI,WAAW,MAAM;AAAA,IACtB;AAED,SAAK,QAAQ,KAAK,GAAG;AAAA,EACzB,CAAG;AACH;AAEA,SAAS,eAAe,QAAQ,MAAM;AACpC,OAAK,QAAQ,OAAO;AACtB;AAEA,SAAS,OACP,SACA,MACA;AAAA,EACE,iBAAiB,OAAO;AAAA,EACxB,eAAe,OAAO;AAC1B,IAAM,CAAE,GACN;AACA,QAAM,eAAe,CAAA;AAErB,MAAI;AAAgB,iBAAa,KAAK,gBAAgB;AACtD,MAAI;AAAc,iBAAa,KAAK,cAAc;AAElD,SAAO,QAAQ,IAAI,CAAC,WAAW;AAC7B,UAAM,EAAE,IAAK,IAAG;AAEhB,UAAM,OAAO;AAAA,MACX,MAAM,KAAK,GAAG;AAAA,MACd,UAAU;AAAA,IAChB;AAEI,QAAI,aAAa,QAAQ;AACvB,mBAAa,QAAQ,CAAC,gBAAgB;AACpC,oBAAY,QAAQ,IAAI;AAAA,MAChC,CAAO;AAAA,IACF;AAED,WAAO;AAAA,EACX,CAAG;AACH;AAEA,MAAM,KAAK;AAAA,EACT,YAAY,MAAM,UAAU,CAAA,GAAI,OAAO;AACrC,SAAK,UAAU,EAAE,GAAG,QAAQ,GAAG,QAAO;AAEtC,QACE,KAAK,QAAQ,qBACb,OACA;AACA,YAAM,IAAI,MAAM,2BAA2B;AAAA,IAC5C;AAED,SAAK,YAAY,IAAI,SAAS,KAAK,QAAQ,IAAI;AAE/C,SAAK,cAAc,MAAM,KAAK;AAAA,EAC/B;AAAA,EAED,cAAc,MAAM,OAAO;AACzB,SAAK,QAAQ;AAEb,QAAI,SAAS,EAAE,iBAAiB,YAAY;AAC1C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACrC;AAED,SAAK,WACH,SACA,YAAY,KAAK,QAAQ,MAAM,KAAK,OAAO;AAAA,MACzC,OAAO,KAAK,QAAQ;AAAA,MACpB,iBAAiB,KAAK,QAAQ;AAAA,IACtC,CAAO;AAAA,EACJ;AAAA,EAED,IAAI,KAAK;AACP,QAAI,CAAC,UAAU,GAAG,GAAG;AACnB;AAAA,IACD;AAED,SAAK,MAAM,KAAK,GAAG;AACnB,SAAK,SAAS,IAAI,GAAG;AAAA,EACtB;AAAA,EAED,OAAO,YAAY,MAAoB,OAAO;AAC5C,UAAM,UAAU,CAAA;AAEhB,aAASF,KAAI,GAAG,MAAM,KAAK,MAAM,QAAQA,KAAI,KAAKA,MAAK,GAAG;AACxD,YAAM,MAAM,KAAK,MAAMA,EAAC;AACxB,UAAI,UAAU,KAAKA,EAAC,GAAG;AACrB,aAAK,SAASA,EAAC;AACf,QAAAA,MAAK;AACL,eAAO;AAEP,gBAAQ,KAAK,GAAG;AAAA,MACjB;AAAA,IACF;AAED,WAAO;AAAA,EACR;AAAA,EAED,SAAS,KAAK;AACZ,SAAK,MAAM,OAAO,KAAK,CAAC;AACxB,SAAK,SAAS,SAAS,GAAG;AAAA,EAC3B;AAAA,EAED,WAAW;AACT,WAAO,KAAK;AAAA,EACb;AAAA,EAED,OAAO,OAAO,EAAE,QAAQ,GAAE,IAAK,CAAA,GAAI;AACjC,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,IAAQ,KAAK;AAET,QAAI,UAAU,SAAS,KAAK,IACxB,SAAS,KAAK,MAAM,CAAC,CAAC,IACpB,KAAK,kBAAkB,KAAK,IAC5B,KAAK,kBAAkB,KAAK,IAC9B,KAAK,eAAe,KAAK;AAE7B,iBAAa,SAAS,EAAE,gBAAe,CAAE;AAEzC,QAAI,YAAY;AACd,cAAQ,KAAK,MAAM;AAAA,IACpB;AAED,QAAI,SAAS,KAAK,KAAK,QAAQ,IAAI;AACjC,gBAAU,QAAQ,MAAM,GAAG,KAAK;AAAA,IACjC;AAED,WAAO,OAAO,SAAS,KAAK,OAAO;AAAA,MACjC;AAAA,MACA;AAAA,IACN,CAAK;AAAA,EACF;AAAA,EAED,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,QAAO,IAAK,KAAK;AACzB,UAAM,UAAU,CAAA;AAGhB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGE,YAAW;AAChD,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACD;AAED,YAAM,EAAE,SAAS,OAAO,QAAS,IAAG,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA,SAAS,CAAC,EAAE,OAAO,OAAO,MAAM,MAAAA,OAAM,SAAS;AAAA,QACzD,CAAS;AAAA,MACF;AAAA,IACP,CAAK;AAED,WAAO;AAAA,EACR;AAAA,EAED,eAAe,OAAO;AAEpB,UAAM,aAAa,MAAM,OAAO,KAAK,OAAO;AAE5C,UAAM,WAAW,CAAC,MAAM,MAAM,QAAQ;AACpC,UAAI,CAAC,KAAK,UAAU;AAClB,cAAM,EAAE,OAAO,SAAU,IAAG;AAE5B,cAAM,UAAU,KAAK,aAAa;AAAA,UAChC,KAAK,KAAK,UAAU,IAAI,KAAK;AAAA,UAC7B,OAAO,KAAK,SAAS,uBAAuB,MAAM,KAAK;AAAA,UACvD;AAAA,QACV,CAAS;AAED,YAAI,WAAW,QAAQ,QAAQ;AAC7B,iBAAO;AAAA,YACL;AAAA,cACE;AAAA,cACA;AAAA,cACA;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,eAAO,CAAE;AAAA,MACV;AAED,YAAM,MAAM,CAAA;AACZ,eAASF,KAAI,GAAG,MAAM,KAAK,SAAS,QAAQA,KAAI,KAAKA,MAAK,GAAG;AAC3D,cAAM,QAAQ,KAAK,SAASA,EAAC;AAC7B,cAAM,SAAS,SAAS,OAAO,MAAM,GAAG;AACxC,YAAI,OAAO,QAAQ;AACjB,cAAI,KAAK,GAAG,MAAM;AAAA,QACnB,WAAU,KAAK,aAAa,gBAAgB,KAAK;AAChD,iBAAO,CAAE;AAAA,QACV;AAAA,MACF;AACD,aAAO;AAAA,IACb;AAEI,UAAM,UAAU,KAAK,SAAS;AAC9B,UAAM,YAAY,CAAA;AAClB,UAAM,UAAU,CAAA;AAEhB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,UAAU;AACvC,UAAI,UAAU,IAAI,GAAG;AACnB,YAAI,aAAa,SAAS,YAAY,MAAM,GAAG;AAE/C,YAAI,WAAW,QAAQ;AAErB,cAAI,CAAC,UAAU,GAAG,GAAG;AACnB,sBAAU,GAAG,IAAI,EAAE,KAAK,MAAM,SAAS,CAAA;AACvC,oBAAQ,KAAK,UAAU,GAAG,CAAC;AAAA,UAC5B;AACD,qBAAW,QAAQ,CAAC,EAAE,cAAc;AAClC,sBAAU,GAAG,EAAE,QAAQ,KAAK,GAAG,OAAO;AAAA,UAClD,CAAW;AAAA,QACF;AAAA,MACF;AAAA,IACP,CAAK;AAED,WAAO;AAAA,EACR;AAAA,EAED,kBAAkB,OAAO;AACvB,UAAM,WAAW,eAAe,OAAO,KAAK,OAAO;AACnD,UAAM,EAAE,MAAM,YAAY,KAAK;AAC/B,UAAM,UAAU,CAAA;AAGhB,YAAQ,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,UAAU;AACvC,UAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,MACD;AAED,UAAI,UAAU,CAAA;AAGd,WAAK,QAAQ,CAAC,KAAK,aAAa;AAC9B,gBAAQ;AAAA,UACN,GAAG,KAAK,aAAa;AAAA,YACnB;AAAA,YACA,OAAO,KAAK,QAAQ;AAAA,YACpB;AAAA,UACZ,CAAW;AAAA,QACX;AAAA,MACA,CAAO;AAED,UAAI,QAAQ,QAAQ;AAClB,gBAAQ,KAAK;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,QACV,CAAS;AAAA,MACF;AAAA,IACP,CAAK;AAED,WAAO;AAAA,EACR;AAAA,EACD,aAAa,EAAE,KAAK,OAAO,SAAQ,GAAI;AACrC,QAAI,CAAC,UAAU,KAAK,GAAG;AACrB,aAAO,CAAE;AAAA,IACV;AAED,QAAI,UAAU,CAAA;AAEd,QAAI,QAAQ,KAAK,GAAG;AAClB,YAAM,QAAQ,CAAC,EAAE,GAAG,MAAM,GAAG,KAAK,GAAGE,YAAW;AAC9C,YAAI,CAAC,UAAU,IAAI,GAAG;AACpB;AAAA,QACD;AAED,cAAM,EAAE,SAAS,OAAO,QAAS,IAAG,SAAS,SAAS,IAAI;AAE1D,YAAI,SAAS;AACX,kBAAQ,KAAK;AAAA,YACX;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,MAAAA;AAAA,YACA;AAAA,UACZ,CAAW;AAAA,QACF;AAAA,MACT,CAAO;AAAA,IACP,OAAW;AACL,YAAM,EAAE,GAAG,MAAM,GAAGA,MAAI,IAAK;AAE7B,YAAM,EAAE,SAAS,OAAO,QAAS,IAAG,SAAS,SAAS,IAAI;AAE1D,UAAI,SAAS;AACX,gBAAQ,KAAK,EAAE,OAAO,KAAK,OAAO,MAAM,MAAAA,OAAM,QAAO,CAAE;AAAA,MACxD;AAAA,IACF;AAED,WAAO;AAAA,EACR;AACH;AAEA,KAAK,UAAU;AACf,KAAK,cAAc;AACnB,KAAK,aAAa;AAClB,KAAK,SAAS;AAEd;AACE,OAAK,aAAa;AACpB;AAEA;AACE,WAAS,cAAc;AACzB;AC/uDA,MAAM,IAAE,OAAM,GAAG,IAAE,OAAM,GAAG,IAAE,OAAM;AAAG,IAAIC,MAAE,CAACQ,IAAEC,OAAI,IAAI,MAAMD,IAAEC,EAAC;AAAO,MAAC,IAAE,OAAO,gBAAeC,MAAE,oBAAI,WAAQC,MAAE,CAAAH,OAAGA,OAAIE,IAAE,IAAIF,EAAC,IAAEE,IAAE,IAAIF,EAAC,IAAE,EAAEA,EAAC,MAAI,OAAO,aAAW,EAAEA,EAAC,MAAI,MAAM,YAAW,IAAE,CAAAA,OAAG,YAAU,OAAOA,MAAG,SAAOA,IAAEV,MAAE,oBAAI,WAAQ,IAAE,CAAAU,OAAGA,GAAE,CAAC,KAAGA,IAAE,IAAE,CAACE,IAAEE,IAAEC,OAAI;AAAC,MAAG,CAACF,IAAED,EAAC;AAAE,WAAOA;AAAE,QAAMI,KAAE,EAAEJ,EAAC,GAAEK,MAAG,CAAAP,OAAG,OAAO,SAASA,EAAC,KAAG,OAAO,OAAO,OAAO,0BAA0BA,EAAC,CAAC,EAAE,KAAK,CAAAA,OAAG,CAACA,GAAE,QAAQ,GAAGM,EAAC;AAAE,MAAIE,KAAEH,MAAGA,GAAE,IAAIC,EAAC;AAAE,SAAOE,MAAGA,GAAE,CAAC,EAAE,MAAID,OAAIC,MAAG,CAAChB,IAAEiB,OAAI;AAAC,UAAMP,KAAE,EAAC,GAAEO,GAAC;AAAE,QAAIN,KAAE;AAAG,UAAMC,KAAE,CAACH,IAAES,OAAI;AAAC,UAAG,CAACP,IAAE;AAAC,YAAIM,KAAEP,GAAE,EAAE,IAAIV,EAAC;AAAE,QAAAiB,OAAIA,KAAE,oBAAI,OAAIP,GAAE,EAAE,IAAIV,IAAEiB,EAAC,IAAGC,MAAGD,GAAE,IAAI,CAAC,KAAGA,GAAE,IAAIR,EAAC;AAAA,MAAC;AAAA,IAAC,GAAEX,KAAE,EAAC,KAAI,CAACU,IAAEC,OAAIA,OAAI,IAAET,MAAGY,GAAEH,EAAC,GAAE,EAAED,GAAEC,EAAC,GAAEC,GAAE,GAAEA,GAAE,CAAC,IAAG,KAAI,CAACF,IAAEU,OAAIA,OAAI,KAAGP,KAAE,MAAGD,GAAE,EAAE,OAAOV,EAAC,GAAE,SAAKY,GAAEM,EAAC,GAAEA,MAAKV,KAAG,0BAAyB,CAACA,IAAEC,QAAKG,GAAEH,IAAE,IAAE,GAAE,OAAO,yBAAyBD,IAAEC,EAAC,IAAG,SAAQ,CAAAA,QAAIG,GAAE,CAAC,GAAE,QAAQ,QAAQH,EAAC,GAAE;AAAE,WAAOQ,OAAInB,GAAE,MAAIA,GAAE,iBAAe,MAAI,QAAI,CAACA,IAAEY,EAAC;AAAA,EAAC,GAAGI,IAAEC,EAAC,GAAEC,GAAE,CAAC,EAAE,IAAEhB,IAAEe,MAAG,CAAAP,OAAG;AAAC,QAAIC,KAAEX,IAAE,IAAIU,EAAC;AAAE,QAAG,CAACC,IAAE;AAAC,UAAG,MAAM,QAAQD,EAAC;AAAE,QAAAC,KAAE,MAAM,KAAKD,EAAC;AAAA,WAAM;AAAC,cAAMU,KAAE,OAAO,0BAA0BV,EAAC;AAAE,eAAO,OAAOU,EAAC,EAAE,QAAQ,CAAAV,OAAG;AAAC,UAAAA,GAAE,eAAa;AAAA,QAAE,CAAC,GAAEC,KAAE,OAAO,OAAO,EAAED,EAAC,GAAEU,EAAC;AAAA,MAAC;AAACpB,UAAE,IAAIU,IAAEC,EAAC;AAAA,IAAC;AAAC,WAAOA;AAAA,EAAC,GAAGK,EAAC,IAAEA,IAAEE,GAAE,CAAC,CAAC,GAAEH,MAAGA,GAAE,IAAIC,IAAEE,EAAC,IAAGA,GAAE,CAAC,EAAE,IAAEJ,IAAEI,GAAE,CAAC,EAAE,IAAEH,IAAEG,GAAE,CAAC,EAAE;AAAC,GAAE,IAAE,CAACR,IAAEC,OAAI;AAAC,QAAMS,KAAE,QAAQ,QAAQV,EAAC,GAAER,KAAE,QAAQ,QAAQS,EAAC;AAAE,SAAOS,GAAE,WAASlB,GAAE,UAAQkB,GAAE,KAAK,CAACV,IAAEC,OAAID,OAAIR,GAAES,EAAC,CAAC;AAAC,GAAE,IAAE,CAACA,IAAES,IAAElB,IAAEiB,OAAI;AAAC,MAAG,OAAO,GAAGR,IAAES,EAAC;AAAE,WAAM;AAAG,MAAG,CAAC,EAAET,EAAC,KAAG,CAAC,EAAES,EAAC;AAAE,WAAM;AAAG,QAAMR,KAAEV,GAAE,IAAI,EAAES,EAAC,CAAC;AAAE,MAAG,CAACC;AAAE,WAAM;AAAG,MAAGO,IAAE;AAAC,UAAMT,KAAES,GAAE,IAAIR,EAAC;AAAE,QAAGD,MAAGA,GAAE,MAAIU;AAAE,aAAOV,GAAE;AAAE,IAAAS,GAAE,IAAIR,IAAE,EAAC,GAAES,IAAE,GAAE,MAAE,CAAC;AAAA,EAAC;AAAC,MAAIP,KAAE;AAAK,aAAUC,MAAKF,IAAE;AAAC,UAAMA,KAAEE,OAAI,IAAE,EAAEH,IAAES,EAAC,IAAE,EAAET,GAAEG,EAAC,GAAEM,GAAEN,EAAC,GAAEZ,IAAEiB,EAAC;AAAE,QAAG,SAAKP,MAAG,UAAKA,OAAIC,KAAED,KAAGC;AAAE;AAAA,EAAK;AAAC,SAAO,SAAOA,OAAIA,KAAE,OAAIM,MAAGA,GAAE,IAAIR,IAAE,EAAC,GAAES,IAAE,GAAEP,GAAC,CAAC,GAAEA;AAAC,GAAE,IAAE,CAAAH,OAAG,CAAC,CAACG,IAAEH,EAAC,KAAG,KAAKA,IAAE,IAAE,CAAAA,OAAGG,IAAEH,EAAC,KAAGA,GAAE,CAAC,KAAG;ACAt3C,MAAM,IAAE,CAAAA,OAAG,YAAU,OAAOA,MAAG,SAAOA,IAAE,IAAE,CAACC,IAAES,OAAI;AAAC,MAAG,CAAC,EAAET,EAAC;AAAE,WAAOA;AAAE,QAAME,KAAEH,EAAEC,EAAC;AAAE,SAAO,SAAOE,MAAGM,EAAER,EAAC,GAAEE,OAAIO,GAAE,IAAIT,EAAC,MAAIS,GAAE,IAAIT,EAAC,GAAE,OAAO,QAAQA,EAAC,EAAE,QAAQ,CAAC,CAACD,IAAES,EAAC,MAAI;AAAC,UAAMjB,KAAE,EAAEiB,IAAEC,EAAC;AAAE,WAAO,GAAGlB,IAAEiB,EAAC,MAAIR,GAAED,EAAC,IAAER;AAAA,EAAE,CAAC,IAAGS;AAAE,GAAE,IAAE,CAACA,IAAES,IAAED,OAAI;AAAC,MAAG,CAAC,EAAER,EAAC,KAAG,CAAC,EAAES,EAAC;AAAE;AAAO,QAAMpB,KAAEmB,GAAE,IAAIT,EAAEU,EAAC,KAAGA,EAAC;AAAE,EAAApB,MAAGA,GAAE,QAAQ,CAAAU,OAAG;AAAC,MAAEC,GAAED,EAAC,GAAEU,GAAEV,EAAC,GAAES,EAAC;AAAA,EAAC,CAAC;AAAC,GAAE,IAAE,CAACA,IAAEjB,OAAI;AAAC,MAAIU;AAAE,MAAIG,KAAE;AAAE,QAAMM,KAAE,SAAOT,KAAE,QAAMV,KAAE,SAAOA,GAAE,QAAMU,KAAE,GAAEE,KAAE,CAAA,GAAGG,KAAE,oBAAI,WAAQlB,MAAE,oBAAI;AAAQ,SAAO,CAAAG,OAAG;AAAC,UAAMU,KAAEF,EAAER,EAAC,KAAGA,IAAE,IAAEe,GAAE,IAAIL,EAAC;AAAE,QAAG;AAAE,aAAO,EAAEV,IAAE,EAAE,GAAE,EAAE,CAAC,GAAE,EAAE;AAAE,aAAQQ,KAAE,GAAEA,KAAEW,IAAEX,MAAG,GAAE;AAAC,YAAMU,KAAEN,IAAGC,KAAEL,MAAGW,EAAC;AAAE,UAAG,CAACD;AAAE;AAAM,UAAG,CAACT,EAAES,GAAE,GAAElB,IAAEkB,GAAE,GAAE,oBAAI,SAAO;AAAE,eAAOH,GAAE,IAAIL,IAAEQ,EAAC,GAAE,EAAElB,IAAEkB,GAAE,GAAEA,GAAE,CAAC,GAAEA,GAAE;AAAA,IAAC;AAAC,UAAM,IAAE,oBAAI,WAAQ,IAAEA,EAAElB,IAAE,GAAEH,GAAC,GAAE,IAAE,EAAEoB,GAAE,CAAC,GAAE,oBAAI,KAAG;AAAE,MAAEjB,IAAEA,IAAE,CAAC;AAAE,UAAM,IAAE,EAAC,GAAEA,IAAE,GAAE,GAAE,GAAE,EAAC;AAAE,WAAOa,MAAGA,KAAE,IAAEM,MAAGA,IAAEP,GAAEC,EAAC,IAAE,GAAEE,GAAE,IAAIL,IAAE,CAAC,GAAE;AAAA,EAAC;AAAC;ACYh2B,MAAA,YAA4B,CAAC,IAAI,SAAS;AACrD,MAAIU,WAAAA,IAAQ,YAAY;AAAkB,WAAAC,EAAQ,IAAI,IAAI;AACnD,SAAA;AACT;ACUA,MAAM,cAAqC;AAAA,EACzC,WAAW;AACb;AAEO,MAAM,aACX,CAAC,SACD,CAAoC,SAA0C;AACtE,QAAA,OAAO,IAAI,KAAK,MAAM;AAAA,IAC1B,MAAM,OAAO,KAAK,KAAK,CAAC,CAAC;AAAA,IACzB,GAAG;AAAA,IACH,GAAG;AAAA,EAAA,CACJ;AACM,SAAA;AAAA,IACL,MAAM;AAAA,IACN,MAAM,CAAC,MAAc,YACnB,KAAK,MAAM,OAAO,UAAU,OAAO,KAAK,OAAO;AAAA,IACjD,QAAQ,CAAC,SAAiB,KAAK,OAAO,IAAI,EAAE,IAAI,CAAC,EAAE,KAAK,MAAM,IAAI;AAAA,IAClE,UAAU,CAAC,SAAc,KAAK,OAAO,CAAC,SAAS,KAAK,SAAS,KAAK,GAAG,CAAC;AAAA,EAAA;AAE1E;AAEF,MAAM,gBAAgB,WAAW;AAe1B,MAAM,wBAAwB,CAAoC;AAAA,EACvE;AAAA,EACA,WAAW;AACb,MACE,UAAU,CAAC,EAAE,WAAW;AAClB,MAAA,OAAO,aAAa,YAAY;AAClC,QAAI,KAAK,WAAW,MAAK,6BAAM,YAAW;AAAU,aAAA,EAAE,MAAM,aAAa;AAClE,WAAA,EAAE,MAAM,SAAS,IAAI,EAAE,OAAO,IAAI,GAAG,aAAa;EAC3D;AACA,SAAO,EAAE,MAAM,SAAS,OAAO,IAAI,GAAG,aAAa;AACrD,CAAC;ACzCI,MAAM,YAAY,CAAqD;AAAA,EAC5E,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EACA;AACF,MAA6C;AAC3C,QAAM,CAAC,eAAe,gBAAgB,IAAIC,8BAAiC;AAAA,IACzE;AAAA,IACA;AAAA,IACA,SAAS;AAAA,EAAA,CACV;AACD,QAAM,EAAE,cAAc,gBAAgB,IAAIC,OAAyB,mBAAA;AAEnE,QAAM,YAAYC,OAAA,qBAAqB,cAAc,UAAU,CAAE,CAAA;AAEjE,QAAM,eAAeC,MAAA;AAAA,IACnB,CAAC,SAAiB;AAChB,uBAAiB,IAAI;AACrB,UAAI,KAAK,WAAW;AAAG,wBAAgB,QAAQ;AAAA,WAC1C;AACH,YAAI,mBAAmB;AAAM,iBAAO,gBAAgB,IAAI;AACxD,kBAAU,UAAU,sBAAsB,EAAE,KAAA,CAAM,CAAC;AAAA,MACrD;AAAA,IACF;AAAA,IACA,CAAC,kBAAkB,eAAe;AAAA,EAAA;AAGpC,SAAO,EAAE,OAAO,eAAe,UAAU,aAAa;AACxD;AAWO,MAAM,SAAS,CAAqD;AAAA,EACzE,WAAW,CAACC,WAAUC,2BAAAA,kBAAAA,IAACC,OAAAA,QAAA,EAAY,GAAGF,QAAO;AAAA,EAC7C,GAAG;AACL,MAAwC,SAAS,UAAgB,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0,1,2]}

package/dist/external-BM82B8W2.js

@@ -1,122 +0,0 @@
-import { V as useContext, e as Text$1, X as use, Q as Symbols, p as m0, Y as ALPHANUMERIC_KEYS, Z as ALPHANUMERIC_KEYS_SET, _ as KEYS, $ as MOUSE_KEYS, a0 as Provider, a1 as compareModeConfigs, a2 as determineMode, a3 as diff, a4 as eventKey, a5 as filter, a6 as flattenConfig, a7 as keyZ, a8 as keyboardKey, a9 as match, aa as mouseKey, ab as mouseKeyZ, ac as purge, ad as purgeMouse, ae as triggerZ, af as useFlattenedMemoConfig, ag as useHeld, y as useHeldRef } from "./Toggle-bT5RpwfA.js";
-import { j as jsxRuntimeExports } from "./jsx-runtime-mMz73N64.js";
-import { useState, useEffect, useRef, useCallback } from "react";
-import "./aggregator-B8fg7W2s.js";
-import { q, T as To } from "./css-DKKmdhSr.js";
-import { S as Space } from "./Center-BK9Rcaa0.js";
-import { K as Keyboard } from "./Keyboard-D31SwhYT.js";
-const Status = (props) => {
-  const { listen } = useContext();
-  const [trigger, setTrigger] = useState([]);
-  useEffect(
-    () => listen(({ next: [trigger2] }) => setTrigger(trigger2 ?? [])),
-    [listen, setTrigger]
-  );
-  return /* @__PURE__ */ jsxRuntimeExports.jsx(Text$1, { ...props, children: trigger.join(" ") });
-};
-const useDrag = ({
-  onDrag,
-  triggers = [["MouseLeft"], ["MouseRight"]],
-  bound,
-  loose = false
-}) => {
-  const triggerRef = useRef(null);
-  const startLoc = useRef(q.ZERO);
-  const onMove = useCallback(
-    (e) => {
-      const cursor = q.construct(e);
-      if (triggerRef.current === null)
-        return;
-      const { triggers: triggers2 } = triggerRef.current;
-      onDrag({
-        box: To.construct(startLoc.current, cursor),
-        cursor,
-        triggers: triggers2,
-        stage: "during"
-      });
-    },
-    [onDrag]
-  );
-  const handleTrigger = useCallback(
-    (event) => {
-      const { stage, cursor } = event;
-      if (stage === "start") {
-        onDrag({ box: To.construct(cursor), ...event });
-        window.addEventListener("mousemove", onMove);
-        triggerRef.current = event;
-        startLoc.current = cursor;
-      } else if (stage === "end" && triggerRef.current != null) {
-        onDrag({ box: To.construct(startLoc.current, cursor), ...event });
-        window.removeEventListener("mousemove", onMove);
-        triggerRef.current = null;
-        startLoc.current = q.ZERO;
-      }
-    },
-    [onDrag]
-  );
-  use({ triggers, callback: handleTrigger, region: bound, loose });
-};
-const CUSTOM_TEXT = {
-  Control: () => /* @__PURE__ */ jsxRuntimeExports.jsx(Symbols.Meta, {}, "control"),
-  Alt: () => /* @__PURE__ */ jsxRuntimeExports.jsx(Symbols.Alt, {}, "alt"),
-  Shift: () => /* @__PURE__ */ jsxRuntimeExports.jsx(m0.Keyboard.Shift, {}, "shift"),
-  MouseLeft: "Left Click",
-  MouseRight: "Right Click",
-  MouseMiddle: "Middle Click",
-  Enter: () => /* @__PURE__ */ jsxRuntimeExports.jsx(m0.Keyboard.Return, {}, "enter")
-};
-const getCustomText = (trigger) => {
-  const t = CUSTOM_TEXT[trigger];
-  if (t != null)
-    return typeof t === "function" ? t() : t;
-  return trigger;
-};
-const toSymbols = (trigger) => trigger.map((t) => getCustomText(t));
-const Text = ({
-  className,
-  style,
-  trigger,
-  ...props
-}) => {
-  return /* @__PURE__ */ jsxRuntimeExports.jsx(Space, { className, style, direction: "x", children: trigger.map((t) => (
-    // @ts-expect-error - issues with generic element types
-    /* @__PURE__ */ jsxRuntimeExports.jsx(Keyboard, { ...props, children: getCustomText(t) }, t)
-  )) });
-};
-const external = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  ALPHANUMERIC_KEYS,
-  ALPHANUMERIC_KEYS_SET,
-  KEYS,
-  MOUSE_KEYS,
-  Provider,
-  Status,
-  Text,
-  compareModeConfigs,
-  determineMode,
-  diff,
-  eventKey,
-  filter,
-  flattenConfig,
-  keyZ,
-  keyboardKey,
-  match,
-  mouseKey,
-  mouseKeyZ,
-  purge,
-  purgeMouse,
-  toSymbols,
-  triggerZ,
-  use,
-  useContext,
-  useDrag,
-  useFlattenedMemoConfig,
-  useHeld,
-  useHeldRef
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  Text as T,
-  external as e,
-  useDrag as u
-};
-//# sourceMappingURL=external-BM82B8W2.js.map

package/dist/external-BM82B8W2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"external-BM82B8W2.js","sources":["../src/triggers/Status.tsx","../src/triggers/useDrag.ts","../src/triggers/Text.tsx"],"sourcesContent":["// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement, useEffect, useState } from \"react\";\n\nimport { Text } from \"@/text\";\nimport { useContext } from \"@/triggers/Provider\";\nimport { type Trigger } from \"@/triggers/triggers\";\n\nexport interface StatusProps extends Text.TextProps {}\n\nexport const Status = (props: StatusProps): ReactElement => {\n  const { listen } = useContext();\n  const [trigger, setTrigger] = useState<Trigger>([]);\n\n  useEffect(\n    () => listen(({ next: [trigger] }) => setTrigger(trigger ?? [])),\n    [listen, setTrigger],\n  );\n\n  return <Text.Text {...props}>{trigger.join(\" \")}</Text.Text>;\n};\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type RefObject, useCallback, useRef } from \"react\";\n\nimport { box, xy } from \"@synnaxlabs/x\";\n\nimport { use, type UseEvent } from \"@/triggers/hooks\";\nimport { type Stage, type Trigger } from \"@/triggers/triggers\";\n\nexport interface DragEvent {\n  stage: Stage;\n  box: box.Box;\n  cursor: xy.XY;\n  triggers: Trigger[];\n}\n\nexport type DragCallback = (props: DragEvent) => void;\n\nexport interface UseDragProps {\n  bound: RefObject<HTMLElement>;\n  triggers?: Trigger[];\n  onDrag: DragCallback;\n  loose?: boolean;\n}\n\nexport const useDrag = ({\n  onDrag,\n  triggers = [[\"MouseLeft\"], [\"MouseRight\"]],\n  bound,\n  loose = false,\n}: UseDragProps): void => {\n  const triggerRef = useRef<UseEvent | null>(null);\n  const startLoc = useRef<xy.XY>(xy.ZERO);\n  const onMove = useCallback(\n    (e: xy.Client & { buttons: number }) => {\n      const cursor = xy.construct(e);\n      if (triggerRef.current === null) return;\n      const { triggers } = triggerRef.current;\n      onDrag({\n        box: box.construct(startLoc.current, cursor),\n        cursor,\n        triggers,\n        stage: \"during\",\n      });\n    },\n    [onDrag],\n  );\n  const handleTrigger = useCallback(\n    (event: UseEvent): void => {\n      const { stage, cursor } = event;\n      if (stage === \"start\") {\n        onDrag({ box: box.construct(cursor), ...event });\n        window.addEventListener(\"mousemove\", onMove);\n        triggerRef.current = event;\n        startLoc.current = cursor;\n      } else if (stage === \"end\" && triggerRef.current != null) {\n        onDrag({ box: box.construct(startLoc.current, cursor), ...event });\n        window.removeEventListener(\"mousemove\", onMove);\n        triggerRef.current = null;\n        startLoc.current = xy.ZERO;\n      }\n    },\n    [onDrag],\n  );\n  use({ triggers, callback: handleTrigger, region: bound, loose });\n};\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement } from \"react\";\n\nimport { Icon } from \"@synnaxlabs/media\";\n\nimport { Align } from \"@/align\";\nimport { Text as Core } from \"@/text\";\nimport { type Key, type Trigger } from \"@/triggers/triggers\";\nimport { RenderProp } from \"@/util/renderProp\";\n\nexport type TextProps<L extends Core.Level> = Core.KeyboardProps<L> & {\n  trigger: Trigger;\n};\n\nconst CUSTOM_TEXT: Partial<Record<Key, (() => ReactElement) | string>> = {\n  Control: () => <Core.Symbols.Meta key=\"control\" />,\n  Alt: () => <Core.Symbols.Alt key=\"alt\" />,\n  Shift: () => <Icon.Keyboard.Shift key=\"shift\" />,\n  MouseLeft: \"Left Click\",\n  MouseRight: \"Right Click\",\n  MouseMiddle: \"Middle Click\",\n  Enter: () => <Icon.Keyboard.Return key=\"enter\" />,\n};\n\nconst getCustomText = (trigger: Key): ReactElement | string => {\n  const t = CUSTOM_TEXT[trigger];\n  if (t != null) return typeof t === \"function\" ? t() : t;\n  return trigger;\n};\n\nexport const toSymbols = (trigger: Trigger): (ReactElement | string)[] =>\n  trigger.map((t) => getCustomText(t));\n\nexport const Text = <L extends Core.Level>({\n  className,\n  style,\n  trigger,\n  ...props\n}: TextProps<L>): ReactElement => {\n  return (\n    <Align.Space className={className} style={style} direction=\"x\">\n      {trigger.map((t) => (\n        // @ts-expect-error - issues with generic element types\n        <Core.Keyboard<L> key={t} {...props}>\n          {getCustomText(t)}\n        </Core.Keyboard>\n      ))}\n    </Align.Space>\n  );\n};\n"],"names":["trigger","jsx","Text.Text","xy","triggers","box","Core.Symbols","Icon","Align.Space","Core.Keyboard"],"mappings":";;;;;;;AAiBa,MAAA,SAAS,CAAC,UAAqC;AACpD,QAAA,EAAE,WAAW;AACnB,QAAM,CAAC,SAAS,UAAU,IAAI,SAAkB,CAAE,CAAA;AAElD;AAAA,IACE,MAAM,OAAO,CAAC,EAAE,MAAM,CAACA,QAAO,EAAA,MAAQ,WAAWA,YAAW,CAAA,CAAE,CAAC;AAAA,IAC/D,CAAC,QAAQ,UAAU;AAAA,EAAA;AAGd,SAAAC,kCAAA,IAACC,QAAA,EAAW,GAAG,OAAQ,UAAA,QAAQ,KAAK,GAAG,EAAE,CAAA;AAClD;ACKO,MAAM,UAAU,CAAC;AAAA,EACtB;AAAA,EACA,WAAW,CAAC,CAAC,WAAW,GAAG,CAAC,YAAY,CAAC;AAAA,EACzC;AAAA,EACA,QAAQ;AACV,MAA0B;AAClB,QAAA,aAAa,OAAwB,IAAI;AACzC,QAAA,WAAW,OAAcC,EAAG,IAAI;AACtC,QAAM,SAAS;AAAA,IACb,CAAC,MAAuC;AAChC,YAAA,SAASA,EAAG,UAAU,CAAC;AAC7B,UAAI,WAAW,YAAY;AAAM;AACjC,YAAM,EAAE,UAAAC,cAAa,WAAW;AACzB,aAAA;AAAA,QACL,KAAKC,GAAI,UAAU,SAAS,SAAS,MAAM;AAAA,QAC3C;AAAA,QACA,UAAAD;AAAAA,QACA,OAAO;AAAA,MAAA,CACR;AAAA,IACH;AAAA,IACA,CAAC,MAAM;AAAA,EAAA;AAET,QAAM,gBAAgB;AAAA,IACpB,CAAC,UAA0B;AACnB,YAAA,EAAE,OAAO,OAAW,IAAA;AAC1B,UAAI,UAAU,SAAS;AACd,eAAA,EAAE,KAAKC,GAAI,UAAU,MAAM,GAAG,GAAG,OAAO;AACxC,eAAA,iBAAiB,aAAa,MAAM;AAC3C,mBAAW,UAAU;AACrB,iBAAS,UAAU;AAAA,MACV,WAAA,UAAU,SAAS,WAAW,WAAW,MAAM;AACjD,eAAA,EAAE,KAAKA,GAAI,UAAU,SAAS,SAAS,MAAM,GAAG,GAAG,MAAA,CAAO;AAC1D,eAAA,oBAAoB,aAAa,MAAM;AAC9C,mBAAW,UAAU;AACrB,iBAAS,UAAUF,EAAG;AAAA,MACxB;AAAA,IACF;AAAA,IACA,CAAC,MAAM;AAAA,EAAA;AAET,MAAI,EAAE,UAAU,UAAU,eAAe,QAAQ,OAAO,OAAO;AACjE;AClDA,MAAM,cAAmE;AAAA,EACvE,SAAS,MAAMF,kCAAAA,IAACK,QAAa,MAAb,CAAA,GAAsB,SAAU;AAAA,EAChD,KAAK,MAAML,kCAAAA,IAACK,QAAa,KAAb,CAAA,GAAqB,KAAM;AAAA,EACvC,OAAO,MAAML,kCAAAA,IAACM,GAAK,SAAS,OAAd,IAAwB,OAAQ;AAAA,EAC9C,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,OAAO,MAAMN,kCAAAA,IAACM,GAAK,SAAS,QAAd,IAAyB,OAAQ;AACjD;AAEA,MAAM,gBAAgB,CAAC,YAAwC;AACvD,QAAA,IAAI,YAAY,OAAO;AAC7B,MAAI,KAAK;AAAM,WAAO,OAAO,MAAM,aAAa,EAAA,IAAM;AAC/C,SAAA;AACT;AAEa,MAAA,YAAY,CAAC,YACxB,QAAQ,IAAI,CAAC,MAAM,cAAc,CAAC,CAAC;AAE9B,MAAM,OAAO,CAAuB;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA,GAAG;AACL,MAAkC;AAE9B,SAAAN,sCAACO,OAAA,EAAY,WAAsB,OAAc,WAAU,KACxD,UAAQ,QAAA,IAAI,CAAC;AAAA;AAAA,IAEZP,sCAACQ,UAAA,EAA0B,GAAG,OAC3B,UAAA,cAAc,CAAC,EAAA,GADK,CAEvB;AAAA,GACD,EACH,CAAA;AAEJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/external-BYqTC99W.js

@@ -1,23 +0,0 @@
-import { P as Provider, S as Switch, t as toCSSVars, u as use, a as useContext, b as useProvider, c as useTypography } from "./Toggle-bT5RpwfA.js";
-import { S as SYNNAX_DARK, a as SYNNAX_LIGHT, b as SYNNAX_THEMES, t as themeZ } from "./aggregator-B8fg7W2s.js";
-const external = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  Provider,
-  SYNNAX_DARK,
-  SYNNAX_LIGHT,
-  SYNNAX_THEMES,
-  Switch,
-  get Theming() {
-    return external;
-  },
-  themeZ,
-  toCSSVars,
-  use,
-  useContext,
-  useProvider,
-  useTypography
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  external as e
-};
-//# sourceMappingURL=external-BYqTC99W.js.map

package/dist/external-BYqTC99W.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"external-BYqTC99W.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;"}

package/dist/external-BfZYUV3z.js

@@ -1,157 +0,0 @@
-import { e as Text, ah as Text$1, ai as Date, aj as DragButton, ak as Numeric, al as Switch, am as TextArea, an as Time, ao as combineDateAndTimeValue, ap as useDate, aq as useTime } from "./Toggle-bT5RpwfA.js";
-import { j as jsxRuntimeExports } from "./jsx-runtime-mMz73N64.js";
-import { C as CSS, d as f } from "./css-DKKmdhSr.js";
-import { m, w } from "./aggregator-B8fg7W2s.js";
-import { useState } from "react";
-import { S as Space } from "./Center-BK9Rcaa0.js";
-const HelpText = ({
-  className,
-  variant = "error",
-  ...props
-}) => /* @__PURE__ */ jsxRuntimeExports.jsx(
-  Text,
-  {
-    className: CSS(
-      CSS.B("input-help-text"),
-      CSS.BM("input-help-text", variant),
-      className
-    ),
-    level: "small",
-    ...props
-  }
-);
-const Label = ({
-  className,
-  required = false,
-  children,
-  ...props
-}) => {
-  return /* @__PURE__ */ jsxRuntimeExports.jsxs("label", { className: CSS(CSS.B("input-label"), className), ...props, children: [
-    children,
-    " ",
-    required && /* @__PURE__ */ jsxRuntimeExports.jsx("span", { className: CSS.B("required-indicator"), children: "*" })
-  ] });
-};
-const maybeDefaultAlignment = (align, dir = "x") => {
-  if (align != null)
-    return align;
-  return f.construct(dir) === "y" ? "stretch" : "center";
-};
-const Item = ({
-  label,
-  showLabel = true,
-  helpText,
-  direction: direction2 = "y",
-  className,
-  children,
-  required,
-  align,
-  size = "small",
-  padHelpText = false,
-  helpTextVariant,
-  showHelpText = true,
-  ...props
-}) => {
-  let inputAndHelp;
-  if (showHelpText === false && showLabel === false)
-    return /* @__PURE__ */ jsxRuntimeExports.jsx(jsxRuntimeExports.Fragment, { children });
-  if (direction2 === "x")
-    inputAndHelp = /* @__PURE__ */ jsxRuntimeExports.jsxs(Space, { direction: "y", size: "small", children: [
-      children,
-      (padHelpText || helpText != null && helpText.length > 0) && /* @__PURE__ */ jsxRuntimeExports.jsx(HelpText, { variant: helpTextVariant, children: helpText })
-    ] });
-  else
-    inputAndHelp = /* @__PURE__ */ jsxRuntimeExports.jsxs(Space, { direction: "y", size: 1 / 3, children: [
-      children,
-      (padHelpText || helpText != null && helpText.length > 0) && /* @__PURE__ */ jsxRuntimeExports.jsx(HelpText, { variant: helpTextVariant, children: helpText })
-    ] });
-  return /* @__PURE__ */ jsxRuntimeExports.jsxs(
-    Space,
-    {
-      className: CSS(CSS.B("input-item"), className),
-      direction: direction2,
-      size,
-      align: maybeDefaultAlignment(align, direction2),
-      ...props,
-      children: [
-        showLabel && /* @__PURE__ */ jsxRuntimeExports.jsx(Label, { required, children: label }),
-        inputAndHelp
-      ]
-    }
-  );
-};
-const DateTime = ({
-  value,
-  onChange,
-  onBlur,
-  ...props
-}) => {
-  const ts = new m(value, "UTC");
-  const [internalValue, setInternalValue] = useState(
-    ts.fString("ISO", "local").slice(0, -1)
-  );
-  const [valueIsValid, setValueIsValid] = useState(true);
-  const handleChange = (next) => {
-    let nextStr = next.toString();
-    setInternalValue(nextStr);
-    let ts2 = new m(next, "UTC");
-    if (nextStr.length < 23)
-      nextStr += ".000";
-    ts2 = ts2.add(
-      BigInt(
-        m.now().date().getTimezoneOffset() - ts2.date().getTimezoneOffset()
-      ) * w.MINUTE.valueOf()
-    );
-    let ok = false;
-    try {
-      const str = ts2.fString("ISO", "local");
-      ok = str.slice(0, -1) === nextStr;
-    } catch (_) {
-      console.error("e");
-    }
-    if (!ok) {
-      setValueIsValid(false);
-      return;
-    }
-    onChange(Number(ts2.valueOf()));
-    setValueIsValid(true);
-  };
-  const handleBlur = (e) => {
-    setValueIsValid(true);
-    setInternalValue(new m(value, "UTC").fString("ISO", "local").slice(0, -1));
-    onBlur == null ? void 0 : onBlur(e);
-  };
-  return /* @__PURE__ */ jsxRuntimeExports.jsx(
-    Text$1,
-    {
-      type: "datetime-local",
-      onBlur: handleBlur,
-      required: false,
-      value: valueIsValid ? new m(value, "UTC").fString("ISO", "local").slice(0, -1) : internalValue,
-      onChange: handleChange,
-      ...props
-    }
-  );
-};
-const external = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  Date,
-  DateTime,
-  DragButton,
-  HelpText,
-  Item,
-  Label,
-  Numeric,
-  Switch,
-  Text: Text$1,
-  TextArea,
-  Time,
-  combineDateAndTimeValue,
-  useDate,
-  useTime
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  Item as I,
-  external as e
-};
-//# sourceMappingURL=external-BfZYUV3z.js.map

package/dist/external-BfZYUV3z.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"external-BfZYUV3z.js","sources":["../src/input/HelpText.tsx","../src/input/Label.tsx","../src/input/Item.tsx","../src/input/DateTime.tsx"],"sourcesContent":["// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement } from \"react\";\n\nimport { CSS } from \"@/css\";\nimport { type Status } from \"@/status\";\nimport { Text } from \"@/text\";\n\nimport \"@/input/HelpText.css\";\n\n/** Props for the {@link HelpText} component. */\nexport interface HelpTextProps extends Omit<Text.TextProps<\"small\">, \"level\" | \"ref\"> {\n  variant?: Status.Variant;\n}\n\n/**\n * Help text for an input component. We generally recommend using Input.Item with a\n * 'helpText' prop instead of this component. This component is useful for low-level\n * control over the help text element.\n *\n * @param props - Props for the help text component. Unlisted props are passed to the\n * underlying text element.\n * @param props.variant - The variant of the help text.\n * \"success\" | \"error\" | \"warning\" | \"info\" | \"loading\" | \"disabled\n * @default \"info\"\n */\nexport const HelpText = ({\n  className,\n  variant = \"error\",\n  ...props\n}: HelpTextProps): ReactElement => (\n  <Text.Text<\"small\">\n    className={CSS(\n      CSS.B(\"input-help-text\"),\n      CSS.BM(\"input-help-text\", variant),\n      className,\n    )}\n    level=\"small\"\n    {...props}\n  />\n);\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type DetailedHTMLProps, type HTMLAttributes, type ReactElement } from \"react\";\n\nimport { CSS } from \"@/css\";\n\nimport \"@/input/Label.css\";\n\n/** Props for the {@link Label} component. */\nexport interface LabelProps\n  extends DetailedHTMLProps<HTMLAttributes<HTMLLabelElement>, HTMLLabelElement> {\n  required?: boolean;\n}\n\n/**\n * A thin, styled wrapper for an input label. We generally recommend using Input.Item\n * with a 'label' prop instead of this component. This component is useful for\n * low-level control over the label element.\n *\n * @param props - Props for the label component. Unlisted props are passed to the\n * underlying label element.\n * @param props.required - Indicate whether the label is associated with a required\n * input.\n */\nexport const Label = ({\n  className,\n  required = false,\n  children,\n  ...props\n}: LabelProps): ReactElement => {\n  return (\n    <label className={CSS(CSS.B(\"input-label\"), className)} {...props}>\n      {children} {required && <span className={CSS.B(\"required-indicator\")}>*</span>}\n    </label>\n  );\n};\n","// Copyright 2023 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement } from \"react\";\n\nimport { direction } from \"@synnaxlabs/x\";\n\nimport { Align } from \"@/align\";\nimport { CSS } from \"@/css\";\nimport { HelpText } from \"@/input/HelpText\";\nimport { Label } from \"@/input/Label\";\n\nimport \"@/input/Item.css\";\nimport { status } from \"@/status/aether\";\n\nexport interface ItemProps extends Align.SpaceProps {\n  label?: string;\n  required?: boolean;\n  showLabel?: boolean;\n  helpText?: string;\n  padHelpText?: boolean;\n  helpTextVariant?: status.Variant;\n  showHelpText?: boolean;\n}\n\nconst maybeDefaultAlignment = (\n  align?: Align.Alignment,\n  dir: direction.Crude = \"x\",\n): Align.Alignment => {\n  if (align != null) return align;\n  return direction.construct(dir) === \"y\" ? \"stretch\" : \"center\";\n};\n\nexport const Item = ({\n  label,\n  showLabel = true,\n  helpText,\n  direction = \"y\",\n  className,\n  children,\n  required,\n  align,\n  size = \"small\",\n  padHelpText = false,\n  helpTextVariant,\n  showHelpText = true,\n  ...props\n}: ItemProps): ReactElement => {\n  let inputAndHelp: ReactElement;\n  if (showHelpText === false && showLabel === false) return <>{children}</>;\n  if (direction === \"x\")\n    inputAndHelp = (\n      <Align.Space direction=\"y\" size=\"small\">\n        {children}\n        {(padHelpText || (helpText != null && helpText.length > 0)) && (\n          <HelpText variant={helpTextVariant}>{helpText}</HelpText>\n        )}\n      </Align.Space>\n    );\n  else\n    inputAndHelp = (\n      <Align.Space direction=\"y\" size={1 / 3}>\n        {children}\n        {(padHelpText || (helpText != null && helpText.length > 0)) && (\n          <HelpText variant={helpTextVariant}>{helpText}</HelpText>\n        )}\n      </Align.Space>\n    );\n\n  return (\n    <Align.Space\n      className={CSS(CSS.B(\"input-item\"), className)}\n      direction={direction}\n      size={size}\n      align={maybeDefaultAlignment(align, direction)}\n      {...props}\n    >\n      {showLabel && <Label required={required}>{label}</Label>}\n      {inputAndHelp}\n    </Align.Space>\n  );\n};\n","// Copyright 2024 Synnax Labs, Inc.\n//\n// Use of this software is governed by the Business Source License included in the file\n// licenses/BSL.txt.\n//\n// As of the Change Date specified in that file, in accordance with the Business Source\n// License, use of this software will be governed by the Apache License, Version 2.0,\n// included in the file licenses/APL.txt.\n\nimport { type ReactElement, useState } from \"react\";\n\nimport { TimeSpan, TimeStamp } from \"@synnaxlabs/x\";\n\nimport { Text } from \"@/input/Text\";\nimport { type BaseProps } from \"@/input/types\";\n\nexport interface DateTimeProps extends BaseProps<number> {}\n\nexport const DateTime = ({\n  value,\n  onChange,\n  onBlur,\n  ...props\n}: DateTimeProps): ReactElement => {\n  const ts = new TimeStamp(value, \"UTC\");\n  const [internalValue, setInternalValue] = useState(\n    ts.fString(\"ISO\", \"local\").slice(0, -1),\n  );\n  const [valueIsValid, setValueIsValid] = useState(true);\n\n  const handleChange = (next: string | number): void => {\n    let nextStr = next.toString();\n    setInternalValue(nextStr);\n\n    let ts = new TimeStamp(next, \"UTC\");\n    if (nextStr.length < 23) nextStr += \".000\";\n\n    ts = ts.add(\n      BigInt(\n        TimeStamp.now().date().getTimezoneOffset() - ts.date().getTimezoneOffset(),\n      ) * TimeSpan.MINUTE.valueOf(),\n    );\n    let ok = false;\n    try {\n      const str = ts.fString(\"ISO\", \"local\");\n      ok = str.slice(0, -1) === nextStr;\n    } catch (_) {\n      console.error(\"e\");\n    }\n    if (!ok) {\n      setValueIsValid(false);\n      return;\n    }\n    onChange(Number(ts.valueOf()));\n    setValueIsValid(true);\n  };\n\n  const handleBlur: React.FocusEventHandler<HTMLInputElement> = (e) => {\n    setValueIsValid(true);\n    setInternalValue(new TimeStamp(value, \"UTC\").fString(\"ISO\", \"local\").slice(0, -1));\n    onBlur?.(e);\n  };\n\n  return (\n    <Text\n      type=\"datetime-local\"\n      onBlur={handleBlur}\n      required={false}\n      value={\n        valueIsValid\n          ? new TimeStamp(value, \"UTC\").fString(\"ISO\", \"local\").slice(0, -1)\n          : internalValue\n      }\n      onChange={handleChange}\n      {...props}\n    />\n  );\n};\n"],"names":["jsx","Text.Text","jsxs","direction","Align.Space","TimeStamp","ts","TimeSpan","Text"],"mappings":";;;;;;AAiCO,MAAM,WAAW,CAAC;AAAA,EACvB;AAAA,EACA,UAAU;AAAA,EACV,GAAG;AACL,MACEA,kCAAA;AAAA,EAACC;AAAAA,EAAA;AAAA,IACC,WAAW;AAAA,MACT,IAAI,EAAE,iBAAiB;AAAA,MACvB,IAAI,GAAG,mBAAmB,OAAO;AAAA,MACjC;AAAA,IACF;AAAA,IACA,OAAM;AAAA,IACL,GAAG;AAAA,EAAA;AACN;ACfK,MAAM,QAAQ,CAAC;AAAA,EACpB;AAAA,EACA,WAAW;AAAA,EACX;AAAA,EACA,GAAG;AACL,MAAgC;AAE5B,SAAAC,kCAAA,KAAC,SAAM,EAAA,WAAW,IAAI,IAAI,EAAE,aAAa,GAAG,SAAS,GAAI,GAAG,OACzD,UAAA;AAAA,IAAA;AAAA,IAAS;AAAA,IAAE,kDAAa,QAAK,EAAA,WAAW,IAAI,EAAE,oBAAoB,GAAG,UAAC,KAAA;AAAA,EACzE,EAAA,CAAA;AAEJ;ACXA,MAAM,wBAAwB,CAC5B,OACA,MAAuB,QACH;AACpB,MAAI,SAAS;AAAa,WAAA;AAC1B,SAAOC,EAAU,UAAU,GAAG,MAAM,MAAM,YAAY;AACxD;AAEO,MAAM,OAAO,CAAC;AAAA,EACnB;AAAA,EACA,YAAY;AAAA,EACZ;AAAA,EACA,WAAAA,aAAY;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,OAAO;AAAA,EACP,cAAc;AAAA,EACd;AAAA,EACA,eAAe;AAAA,EACf,GAAG;AACL,MAA+B;AACzB,MAAA;AACA,MAAA,iBAAiB,SAAS,cAAc;AAAO,+EAAU,SAAS,CAAA;AACtE,MAAIA,eAAc;AAChB,0DACGC,OAAA,EAAY,WAAU,KAAI,MAAK,SAC7B,UAAA;AAAA,MAAA;AAAA,OACC,eAAgB,YAAY,QAAQ,SAAS,SAAS,MACrDJ,sCAAA,UAAA,EAAS,SAAS,iBAAkB,UAAS,SAAA,CAAA;AAAA,IAElD,EAAA,CAAA;AAAA;AAIA,mBAAAE,kCAAAA,KAACE,OAAA,EAAY,WAAU,KAAI,MAAM,IAAI,GAClC,UAAA;AAAA,MAAA;AAAA,OACC,eAAgB,YAAY,QAAQ,SAAS,SAAS,MACrDJ,sCAAA,UAAA,EAAS,SAAS,iBAAkB,UAAS,SAAA,CAAA;AAAA,IAElD,EAAA,CAAA;AAIF,SAAAE,kCAAA;AAAA,IAACE;AAAAA,IAAA;AAAA,MACC,WAAW,IAAI,IAAI,EAAE,YAAY,GAAG,SAAS;AAAA,MAC7C,WAAWD;AAAAA,MACX;AAAA,MACA,OAAO,sBAAsB,OAAOA,UAAS;AAAA,MAC5C,GAAG;AAAA,MAEH,UAAA;AAAA,QAAa,aAAAH,kCAAA,IAAC,OAAM,EAAA,UAAqB,UAAM,OAAA;AAAA,QAC/C;AAAA,MAAA;AAAA,IAAA;AAAA,EAAA;AAGP;ACrEO,MAAM,WAAW,CAAC;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA,GAAG;AACL,MAAmC;AACjC,QAAM,KAAK,IAAIK,EAAU,OAAO,KAAK;AAC/B,QAAA,CAAC,eAAe,gBAAgB,IAAI;AAAA,IACxC,GAAG,QAAQ,OAAO,OAAO,EAAE,MAAM,GAAG,EAAE;AAAA,EAAA;AAExC,QAAM,CAAC,cAAc,eAAe,IAAI,SAAS,IAAI;AAE/C,QAAA,eAAe,CAAC,SAAgC;AAChD,QAAA,UAAU,KAAK;AACnB,qBAAiB,OAAO;AAExB,QAAIC,MAAK,IAAID,EAAU,MAAM,KAAK;AAClC,QAAI,QAAQ,SAAS;AAAe,iBAAA;AAEpCC,UAAKA,IAAG;AAAA,MACN;AAAA,QACED,EAAU,IAAI,EAAE,KAAK,EAAE,sBAAsBC,IAAG,KAAK,EAAE,kBAAkB;AAAA,MAAA,IACvEC,EAAS,OAAO,QAAQ;AAAA,IAAA;AAE9B,QAAI,KAAK;AACL,QAAA;AACF,YAAM,MAAMD,IAAG,QAAQ,OAAO,OAAO;AACrC,WAAK,IAAI,MAAM,GAAG,EAAE,MAAM;AAAA,aACnB,GAAG;AACV,cAAQ,MAAM,GAAG;AAAA,IACnB;AACA,QAAI,CAAC,IAAI;AACP,sBAAgB,KAAK;AACrB;AAAA,IACF;AACA,aAAS,OAAOA,IAAG,QAAQ,CAAC,CAAC;AAC7B,oBAAgB,IAAI;AAAA,EAAA;AAGhB,QAAA,aAAwD,CAAC,MAAM;AACnE,oBAAgB,IAAI;AACpB,qBAAiB,IAAID,EAAU,OAAO,KAAK,EAAE,QAAQ,OAAO,OAAO,EAAE,MAAM,GAAG,EAAE,CAAC;AACjF,qCAAS;AAAA,EAAC;AAIV,SAAAL,kCAAA;AAAA,IAACQ;AAAAA,IAAA;AAAA,MACC,MAAK;AAAA,MACL,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,OACE,eACI,IAAIH,EAAU,OAAO,KAAK,EAAE,QAAQ,OAAO,OAAO,EAAE,MAAM,GAAG,EAAE,IAC/D;AAAA,MAEN,UAAU;AAAA,MACT,GAAG;AAAA,IAAA;AAAA,EAAA;AAGV;;;;;;;;;;;;;;;;;;"}

package/dist/external-BpqCp_M1.js

@@ -1,15 +0,0 @@
-import { A as ALIGNMENTS, C as Center, a as CoreCenter, J as JUSTIFICATIONS, P as Pack, S as Space, s as shouldReverse } from "./Center-BK9Rcaa0.js";
-const external = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  ALIGNMENTS,
-  Center,
-  CoreCenter,
-  JUSTIFICATIONS,
-  Pack,
-  Space,
-  shouldReverse
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  external as e
-};
-//# sourceMappingURL=external-BpqCp_M1.js.map

package/dist/external-BpqCp_M1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"external-BpqCp_M1.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;"}