@powerhousedao/powerhouse-vetra-packages 6.1.0-dev.2 → 6.1.0-dev.21

package/dist/browser/{documents-Bpu0aSLb.js.map → documents-D4ek7Ubv.js.map}

@@ -1 +1 @@
-{"version":3,"file":"documents-Bpu0aSLb.js","names":["type","typedef","schema","z.object","z.string","z.number","stringSchema","config","scalar","NUMERIC_VALUE_REGEX","type","typedef","schema","z.object","z.string","stringSchema","config","scalar","type","typedef","schema","z.object","z.string","stringSchema","config","scalar","type","typedef","schema","z.object","z.string","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.iso.datetime","stringSchema","datetimeValidation","config","scalar","type","typedef","schema","z.iso.datetime","stringSchema","config","scalar","type","typedef","schema","z.email","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","z.url","stringSchema","config","scalar","AmountTokens.scalar","EthereumAddress.scalar","AmountPercentage.scalar","EmailAddress.scalar","DateScalar.scalar","DateTime.scalar","URLScalar.scalar","AmountMoney.scalar","OLabel.scalar","Currency.scalar","PHID.scalar","OID.scalar","AmountFiat.scalar","AmountCurrency.scalar","AmountCrypto.scalar","Amount.scalar","File.scalar","AmountTokens.typedef","EthereumAddress.typedef","AmountPercentage.typedef","EmailAddress.typedef","DateScalar.typedef","DateTime.typedef","URLScalar.typedef","AmountMoney.typedef","OLabel.typedef","Currency.typedef","PHID.typedef","OID.typedef","AmountFiat.typedef","AmountCurrency.typedef","AmountCrypto.typedef","Amount.typedef","File.typedef","AmountTokens.type","EthereumAddress.type","EmailAddress.type","AmountPercentage.type","DateScalar.type","DateTime.type","URLScalar.type","AmountMoney.type","OLabel.type","Currency.type","PHID.type","OID.type","AmountFiat.type","AmountCurrency.type","AmountCrypto.type","Amount.type","File.type","AmountTokens.stringSchema","EthereumAddress.stringSchema","EmailAddress.stringSchema","AmountPercentage.stringSchema","DateScalar.stringSchema","DateTime.stringSchema","URLScalar.stringSchema","AmountMoney.stringSchema","OLabel.stringSchema","Currency.stringSchema","PHID.stringSchema","OID.stringSchema","AmountFiat.stringSchema","AmountCurrency.stringSchema","AmountCrypto.stringSchema","Amount.stringSchema","File.stringSchema"],"sources":["../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/didYouMean.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/identityFunc.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/keyMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/keyValMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/mapValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/naturalCompare.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/suggestionList.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/toObjMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printString.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/visitor.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printer.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/valueFromASTUntyped.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/assertName.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/definition.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/typeComparators.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/scalars.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/directives.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/isIterableObject.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/astFromValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/introspection.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/schema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/validate.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/typeFromAST.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/TypeInfo.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/predicates.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ExecutableDefinitionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/FieldsOnCorrectTypeRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/FragmentsOnCompositeTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownArgumentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownDirectivesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownFragmentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownTypeNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/LoneAnonymousOperationRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/LoneSchemaDefinitionRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/MaxIntrospectionDepthRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoFragmentCyclesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUndefinedVariablesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUnusedFragmentsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUnusedVariablesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/sortValueNode.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/OverlappingFieldsCanBeMergedRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/PossibleFragmentSpreadsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/PossibleTypeExtensionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ProvidedRequiredArgumentsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ScalarLeafsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/printPathArray.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/Path.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/coerceInputValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/valueFromAST.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/execution/values.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/execution/collectFields.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/SingleFieldSubscriptionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/groupBy.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueArgumentDefinitionNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueArgumentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueDirectiveNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueDirectivesPerLocationRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueEnumValueNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueFieldDefinitionNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueFragmentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueInputFieldNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueOperationNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueOperationTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueTypeNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueVariableNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ValuesOfCorrectTypeRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/VariablesAreInputTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/VariablesInAllowedPositionRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/specifiedRules.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/ValidationContext.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/validate.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/extendSchema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/buildASTSchema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/printSchema.mjs","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Amount.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountCrypto.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountCurrency.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountFiat.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountMoney.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountPercentage.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountTokens.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Currency.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Date.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/DateTime.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/EmailAddress.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/EthereumAddress.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/OID.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/OLabel.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/PHID.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/URL.js","../../../../node_modules/.pnpm/graphql-upload@17.0.0_@types+express@4.17.25_graphql@16.12.0/node_modules/graphql-upload/Upload.mjs","../../../../node_modules/.pnpm/graphql-upload@17.0.0_@types+express@4.17.25_graphql@16.12.0/node_modules/graphql-upload/GraphQLUpload.mjs","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/File.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/scalars.js","../../editors/document-model-editor/constants/documents.ts"],"sourcesContent":["const MAX_SUGGESTIONS = 5;\n/**\n * Given [ A, B, C ] return ' Did you mean A, B, or C?'.\n */\n\nexport function didYouMean(firstArg, secondArg) {\n  const [subMessage, suggestionsArg] = secondArg\n    ? [firstArg, secondArg]\n    : [undefined, firstArg];\n  let message = ' Did you mean ';\n\n  if (subMessage) {\n    message += subMessage + ' ';\n  }\n\n  const suggestions = suggestionsArg.map((x) => `\"${x}\"`);\n\n  switch (suggestions.length) {\n    case 0:\n      return '';\n\n    case 1:\n      return message + suggestions[0] + '?';\n\n    case 2:\n      return message + suggestions[0] + ' or ' + suggestions[1] + '?';\n  }\n\n  const selected = suggestions.slice(0, MAX_SUGGESTIONS);\n  const lastItem = selected.pop();\n  return message + selected.join(', ') + ', or ' + lastItem + '?';\n}\n","/**\n * Returns the first argument it receives.\n */\nexport function identityFunc(x) {\n  return x;\n}\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * for each value in the array.\n *\n * This provides a convenient lookup for the array items if the key function\n * produces unique results.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * const entriesByName = keyMap(\n *   phoneBook,\n *   entry => entry.name\n * )\n *\n * // {\n * //   Jon: { name: 'Jon', num: '555-1234' },\n * //   Jenny: { name: 'Jenny', num: '867-5309' }\n * // }\n *\n * const jennyEntry = entriesByName['Jenny']\n *\n * // { name: 'Jenny', num: '857-6309' }\n * ```\n */\nexport function keyMap(list, keyFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = item;\n  }\n\n  return result;\n}\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * and a function to produce the values from each item in the array.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * // { Jon: '555-1234', Jenny: '867-5309' }\n * const phonesByName = keyValMap(\n *   phoneBook,\n *   entry => entry.name,\n *   entry => entry.num\n * )\n * ```\n */\nexport function keyValMap(list, keyFn, valFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = valFn(item);\n  }\n\n  return result;\n}\n","/**\n * Creates an object map with the same keys as `map` and values generated by\n * running each value of `map` thru `fn`.\n */\nexport function mapValue(map, fn) {\n  const result = Object.create(null);\n\n  for (const key of Object.keys(map)) {\n    result[key] = fn(map[key], key);\n  }\n\n  return result;\n}\n","/**\n * Returns a number indicating whether a reference string comes before, or after,\n * or is the same as the given string in natural sort order.\n *\n * See: https://en.wikipedia.org/wiki/Natural_sort_order\n *\n */\nexport function naturalCompare(aStr, bStr) {\n  let aIndex = 0;\n  let bIndex = 0;\n\n  while (aIndex < aStr.length && bIndex < bStr.length) {\n    let aChar = aStr.charCodeAt(aIndex);\n    let bChar = bStr.charCodeAt(bIndex);\n\n    if (isDigit(aChar) && isDigit(bChar)) {\n      let aNum = 0;\n\n      do {\n        ++aIndex;\n        aNum = aNum * 10 + aChar - DIGIT_0;\n        aChar = aStr.charCodeAt(aIndex);\n      } while (isDigit(aChar) && aNum > 0);\n\n      let bNum = 0;\n\n      do {\n        ++bIndex;\n        bNum = bNum * 10 + bChar - DIGIT_0;\n        bChar = bStr.charCodeAt(bIndex);\n      } while (isDigit(bChar) && bNum > 0);\n\n      if (aNum < bNum) {\n        return -1;\n      }\n\n      if (aNum > bNum) {\n        return 1;\n      }\n    } else {\n      if (aChar < bChar) {\n        return -1;\n      }\n\n      if (aChar > bChar) {\n        return 1;\n      }\n\n      ++aIndex;\n      ++bIndex;\n    }\n  }\n\n  return aStr.length - bStr.length;\n}\nconst DIGIT_0 = 48;\nconst DIGIT_9 = 57;\n\nfunction isDigit(code) {\n  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;\n}\n","import { naturalCompare } from './naturalCompare.mjs';\n/**\n * Given an invalid input string and a list of valid options, returns a filtered\n * list of valid options sorted based on their similarity with the input.\n */\n\nexport function suggestionList(input, options) {\n  const optionsByDistance = Object.create(null);\n  const lexicalDistance = new LexicalDistance(input);\n  const threshold = Math.floor(input.length * 0.4) + 1;\n\n  for (const option of options) {\n    const distance = lexicalDistance.measure(option, threshold);\n\n    if (distance !== undefined) {\n      optionsByDistance[option] = distance;\n    }\n  }\n\n  return Object.keys(optionsByDistance).sort((a, b) => {\n    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];\n    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);\n  });\n}\n/**\n * Computes the lexical distance between strings A and B.\n *\n * The \"distance\" between two strings is given by counting the minimum number\n * of edits needed to transform string A into string B. An edit can be an\n * insertion, deletion, or substitution of a single character, or a swap of two\n * adjacent characters.\n *\n * Includes a custom alteration from Damerau-Levenshtein to treat case changes\n * as a single edit which helps identify mis-cased values with an edit distance\n * of 1.\n *\n * This distance can be useful for detecting typos in input or sorting\n */\n\nclass LexicalDistance {\n  constructor(input) {\n    this._input = input;\n    this._inputLowerCase = input.toLowerCase();\n    this._inputArray = stringToArray(this._inputLowerCase);\n    this._rows = [\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n    ];\n  }\n\n  measure(option, threshold) {\n    if (this._input === option) {\n      return 0;\n    }\n\n    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit\n\n    if (this._inputLowerCase === optionLowerCase) {\n      return 1;\n    }\n\n    let a = stringToArray(optionLowerCase);\n    let b = this._inputArray;\n\n    if (a.length < b.length) {\n      const tmp = a;\n      a = b;\n      b = tmp;\n    }\n\n    const aLength = a.length;\n    const bLength = b.length;\n\n    if (aLength - bLength > threshold) {\n      return undefined;\n    }\n\n    const rows = this._rows;\n\n    for (let j = 0; j <= bLength; j++) {\n      rows[0][j] = j;\n    }\n\n    for (let i = 1; i <= aLength; i++) {\n      const upRow = rows[(i - 1) % 3];\n      const currentRow = rows[i % 3];\n      let smallestCell = (currentRow[0] = i);\n\n      for (let j = 1; j <= bLength; j++) {\n        const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n        let currentCell = Math.min(\n          upRow[j] + 1, // delete\n          currentRow[j - 1] + 1, // insert\n          upRow[j - 1] + cost, // substitute\n        );\n\n        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n          // transposition\n          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];\n          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);\n        }\n\n        if (currentCell < smallestCell) {\n          smallestCell = currentCell;\n        }\n\n        currentRow[j] = currentCell;\n      } // Early exit, since distance can't go smaller than smallest element of the previous row.\n\n      if (smallestCell > threshold) {\n        return undefined;\n      }\n    }\n\n    const distance = rows[aLength % 3][bLength];\n    return distance <= threshold ? distance : undefined;\n  }\n}\n\nfunction stringToArray(str) {\n  const strLength = str.length;\n  const array = new Array(strLength);\n\n  for (let i = 0; i < strLength; ++i) {\n    array[i] = str.charCodeAt(i);\n  }\n\n  return array;\n}\n","export function toObjMap(obj) {\n  if (obj == null) {\n    return Object.create(null);\n  }\n\n  if (Object.getPrototypeOf(obj) === null) {\n    return obj;\n  }\n\n  const map = Object.create(null);\n\n  for (const [key, value] of Object.entries(obj)) {\n    map[key] = value;\n  }\n\n  return map;\n}\n","/**\n * Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n */\nexport function printString(str) {\n  return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n  return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n  '\\\\u0000',\n  '\\\\u0001',\n  '\\\\u0002',\n  '\\\\u0003',\n  '\\\\u0004',\n  '\\\\u0005',\n  '\\\\u0006',\n  '\\\\u0007',\n  '\\\\b',\n  '\\\\t',\n  '\\\\n',\n  '\\\\u000B',\n  '\\\\f',\n  '\\\\r',\n  '\\\\u000E',\n  '\\\\u000F',\n  '\\\\u0010',\n  '\\\\u0011',\n  '\\\\u0012',\n  '\\\\u0013',\n  '\\\\u0014',\n  '\\\\u0015',\n  '\\\\u0016',\n  '\\\\u0017',\n  '\\\\u0018',\n  '\\\\u0019',\n  '\\\\u001A',\n  '\\\\u001B',\n  '\\\\u001C',\n  '\\\\u001D',\n  '\\\\u001E',\n  '\\\\u001F',\n  '',\n  '',\n  '\\\\\"',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 2F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 3F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 4F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\\\\\',\n  '',\n  '',\n  '', // 5F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 6F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\u007F',\n  '\\\\u0080',\n  '\\\\u0081',\n  '\\\\u0082',\n  '\\\\u0083',\n  '\\\\u0084',\n  '\\\\u0085',\n  '\\\\u0086',\n  '\\\\u0087',\n  '\\\\u0088',\n  '\\\\u0089',\n  '\\\\u008A',\n  '\\\\u008B',\n  '\\\\u008C',\n  '\\\\u008D',\n  '\\\\u008E',\n  '\\\\u008F',\n  '\\\\u0090',\n  '\\\\u0091',\n  '\\\\u0092',\n  '\\\\u0093',\n  '\\\\u0094',\n  '\\\\u0095',\n  '\\\\u0096',\n  '\\\\u0097',\n  '\\\\u0098',\n  '\\\\u0099',\n  '\\\\u009A',\n  '\\\\u009B',\n  '\\\\u009C',\n  '\\\\u009D',\n  '\\\\u009E',\n  '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = { ...node };\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.mjs';\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n  return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n  Name: {\n    leave: (node) => node.value,\n  },\n  Variable: {\n    leave: (node) => '$' + node.name,\n  },\n  // Document\n  Document: {\n    leave: (node) => join(node.definitions, '\\n\\n'),\n  },\n  OperationDefinition: {\n    leave(node) {\n      const varDefs = hasMultilineItems(node.variableDefinitions)\n        ? wrap('(\\n', join(node.variableDefinitions, '\\n'), '\\n)')\n        : wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix =\n        wrap('', node.description, '\\n') +\n        join(\n          [\n            node.operation,\n            join([node.name, varDefs]),\n            join(node.directives, ' '),\n          ],\n          ' ',\n        ); // Anonymous queries with no directives or variable definitions can use\n      // the query short form.\n\n      return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n    },\n  },\n  VariableDefinition: {\n    leave: ({ variable, type, defaultValue, directives, description }) =>\n      wrap('', description, '\\n') +\n      variable +\n      ': ' +\n      type +\n      wrap(' = ', defaultValue) +\n      wrap(' ', join(directives, ' ')),\n  },\n  SelectionSet: {\n    leave: ({ selections }) => block(selections),\n  },\n  Field: {\n    leave({ alias, name, arguments: args, directives, selectionSet }) {\n      const prefix = wrap('', alias, ': ') + name;\n      let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n      if (argsLine.length > MAX_LINE_LENGTH) {\n        argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n      }\n\n      return join([argsLine, join(directives, ' '), selectionSet], ' ');\n    },\n  },\n  Argument: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Fragments\n  FragmentSpread: {\n    leave: ({ name, directives }) =>\n      '...' + name + wrap(' ', join(directives, ' ')),\n  },\n  InlineFragment: {\n    leave: ({ typeCondition, directives, selectionSet }) =>\n      join(\n        [\n          '...',\n          wrap('on ', typeCondition),\n          join(directives, ' '),\n          selectionSet,\n        ],\n        ' ',\n      ),\n  },\n  FragmentDefinition: {\n    leave: ({\n      name,\n      typeCondition,\n      variableDefinitions,\n      directives,\n      selectionSet,\n      description,\n    }) =>\n      wrap('', description, '\\n') + // Note: fragment variable definitions are experimental and may be changed\n      // or removed in the future.\n      `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n      `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n      selectionSet,\n  },\n  // Value\n  IntValue: {\n    leave: ({ value }) => value,\n  },\n  FloatValue: {\n    leave: ({ value }) => value,\n  },\n  StringValue: {\n    leave: ({ value, block: isBlockString }) =>\n      isBlockString ? printBlockString(value) : printString(value),\n  },\n  BooleanValue: {\n    leave: ({ value }) => (value ? 'true' : 'false'),\n  },\n  NullValue: {\n    leave: () => 'null',\n  },\n  EnumValue: {\n    leave: ({ value }) => value,\n  },\n  ListValue: {\n    leave: ({ values }) => '[' + join(values, ', ') + ']',\n  },\n  ObjectValue: {\n    leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n  },\n  ObjectField: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Directive\n  Directive: {\n    leave: ({ name, arguments: args }) =>\n      '@' + name + wrap('(', join(args, ', '), ')'),\n  },\n  // Type\n  NamedType: {\n    leave: ({ name }) => name,\n  },\n  ListType: {\n    leave: ({ type }) => '[' + type + ']',\n  },\n  NonNullType: {\n    leave: ({ type }) => type + '!',\n  },\n  // Type System Definitions\n  SchemaDefinition: {\n    leave: ({ description, directives, operationTypes }) =>\n      wrap('', description, '\\n') +\n      join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n  },\n  OperationTypeDefinition: {\n    leave: ({ operation, type }) => operation + ': ' + type,\n  },\n  ScalarTypeDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') +\n      join(['scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  FieldDefinition: {\n    leave: ({ description, name, arguments: args, type, directives }) =>\n      wrap('', description, '\\n') +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      ': ' +\n      type +\n      wrap(' ', join(directives, ' ')),\n  },\n  InputValueDefinition: {\n    leave: ({ description, name, type, defaultValue, directives }) =>\n      wrap('', description, '\\n') +\n      join(\n        [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n        ' ',\n      ),\n  },\n  InterfaceTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeDefinition: {\n    leave: ({ description, name, directives, types }) =>\n      wrap('', description, '\\n') +\n      join(\n        ['union', name, join(directives, ' '), wrap('= ', join(types, ' | '))],\n        ' ',\n      ),\n  },\n  EnumTypeDefinition: {\n    leave: ({ description, name, directives, values }) =>\n      wrap('', description, '\\n') +\n      join(['enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  EnumValueDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n  },\n  InputObjectTypeDefinition: {\n    leave: ({ description, name, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(['input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  DirectiveDefinition: {\n    leave: ({ description, name, arguments: args, repeatable, locations }) =>\n      wrap('', description, '\\n') +\n      'directive @' +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      (repeatable ? ' repeatable' : '') +\n      ' on ' +\n      join(locations, ' | '),\n  },\n  SchemaExtension: {\n    leave: ({ directives, operationTypes }) =>\n      join(\n        ['extend schema', join(directives, ' '), block(operationTypes)],\n        ' ',\n      ),\n  },\n  ScalarTypeExtension: {\n    leave: ({ name, directives }) =>\n      join(['extend scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  InterfaceTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeExtension: {\n    leave: ({ name, directives, types }) =>\n      join(\n        [\n          'extend union',\n          name,\n          join(directives, ' '),\n          wrap('= ', join(types, ' | ')),\n        ],\n        ' ',\n      ),\n  },\n  EnumTypeExtension: {\n    leave: ({ name, directives, values }) =>\n      join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  InputObjectTypeExtension: {\n    leave: ({ name, directives, fields }) =>\n      join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  // Schema Coordinates\n  TypeCoordinate: {\n    leave: ({ name }) => name,\n  },\n  MemberCoordinate: {\n    leave: ({ name, memberName }) => join([name, wrap('.', memberName)]),\n  },\n  ArgumentCoordinate: {\n    leave: ({ name, fieldName, argumentName }) =>\n      join([name, wrap('.', fieldName), wrap('(', argumentName, ':)')]),\n  },\n  DirectiveCoordinate: {\n    leave: ({ name }) => join(['@', name]),\n  },\n  DirectiveArgumentCoordinate: {\n    leave: ({ name, argumentName }) =>\n      join(['@', name, wrap('(', argumentName, ':)')]),\n  },\n};\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\nfunction join(maybeArray, separator = '') {\n  var _maybeArray$filter$jo;\n\n  return (_maybeArray$filter$jo =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.filter((x) => x).join(separator)) !== null &&\n    _maybeArray$filter$jo !== void 0\n    ? _maybeArray$filter$jo\n    : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an indented `{ }` block.\n */\n\nfunction block(array) {\n  return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\nfunction wrap(start, maybeString, end = '') {\n  return maybeString != null && maybeString !== ''\n    ? start + maybeString + end\n    : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n  var _maybeArray$some;\n\n  // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n  return (_maybeArray$some =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n    _maybeArray$some !== void 0\n    ? _maybeArray$some\n    : false;\n}\n","import { keyValMap } from '../jsutils/keyValMap.mjs';\nimport { Kind } from '../language/kinds.mjs';\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * Unlike `valueFromAST()`, no type is provided. The resulting JavaScript value\n * will reflect the provided GraphQL value AST.\n *\n * | GraphQL Value        | JavaScript Value |\n * | -------------------- | ---------------- |\n * | Input Object         | Object           |\n * | List                 | Array            |\n * | Boolean              | Boolean          |\n * | String / Enum        | String           |\n * | Int / Float          | Number           |\n * | Null                 | null             |\n *\n */\n\nexport function valueFromASTUntyped(valueNode, variables) {\n  switch (valueNode.kind) {\n    case Kind.NULL:\n      return null;\n\n    case Kind.INT:\n      return parseInt(valueNode.value, 10);\n\n    case Kind.FLOAT:\n      return parseFloat(valueNode.value);\n\n    case Kind.STRING:\n    case Kind.ENUM:\n    case Kind.BOOLEAN:\n      return valueNode.value;\n\n    case Kind.LIST:\n      return valueNode.values.map((node) =>\n        valueFromASTUntyped(node, variables),\n      );\n\n    case Kind.OBJECT:\n      return keyValMap(\n        valueNode.fields,\n        (field) => field.name.value,\n        (field) => valueFromASTUntyped(field.value, variables),\n      );\n\n    case Kind.VARIABLE:\n      return variables === null || variables === void 0\n        ? void 0\n        : variables[valueNode.name.value];\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { isNameContinue, isNameStart } from '../language/characterClasses.mjs';\n/**\n * Upholds the spec rules about naming.\n */\n\nexport function assertName(name) {\n  name != null || devAssert(false, 'Must provide name.');\n  typeof name === 'string' || devAssert(false, 'Expected name to be a string.');\n\n  if (name.length === 0) {\n    throw new GraphQLError('Expected name to be a non-empty string.');\n  }\n\n  for (let i = 1; i < name.length; ++i) {\n    if (!isNameContinue(name.charCodeAt(i))) {\n      throw new GraphQLError(\n        `Names must only contain [_a-zA-Z0-9] but \"${name}\" does not.`,\n      );\n    }\n  }\n\n  if (!isNameStart(name.charCodeAt(0))) {\n    throw new GraphQLError(\n      `Names must start with [_a-zA-Z] but \"${name}\" does not.`,\n    );\n  }\n\n  return name;\n}\n/**\n * Upholds the spec rules about naming enum values.\n *\n * @internal\n */\n\nexport function assertEnumValueName(name) {\n  if (name === 'true' || name === 'false' || name === 'null') {\n    throw new GraphQLError(`Enum values cannot be named: ${name}`);\n  }\n\n  return assertName(name);\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { didYouMean } from '../jsutils/didYouMean.mjs';\nimport { identityFunc } from '../jsutils/identityFunc.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { keyValMap } from '../jsutils/keyValMap.mjs';\nimport { mapValue } from '../jsutils/mapValue.mjs';\nimport { suggestionList } from '../jsutils/suggestionList.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { valueFromASTUntyped } from '../utilities/valueFromASTUntyped.mjs';\nimport { assertEnumValueName, assertName } from './assertName.mjs';\nexport function isType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type) ||\n    isListType(type) ||\n    isNonNullType(type)\n  );\n}\nexport function assertType(type) {\n  if (!isType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL type.`);\n  }\n\n  return type;\n}\n/**\n * There are predicates for each kind of GraphQL type.\n */\n\nexport function isScalarType(type) {\n  return instanceOf(type, GraphQLScalarType);\n}\nexport function assertScalarType(type) {\n  if (!isScalarType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Scalar type.`);\n  }\n\n  return type;\n}\nexport function isObjectType(type) {\n  return instanceOf(type, GraphQLObjectType);\n}\nexport function assertObjectType(type) {\n  if (!isObjectType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Object type.`);\n  }\n\n  return type;\n}\nexport function isInterfaceType(type) {\n  return instanceOf(type, GraphQLInterfaceType);\n}\nexport function assertInterfaceType(type) {\n  if (!isInterfaceType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL Interface type.`,\n    );\n  }\n\n  return type;\n}\nexport function isUnionType(type) {\n  return instanceOf(type, GraphQLUnionType);\n}\nexport function assertUnionType(type) {\n  if (!isUnionType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Union type.`);\n  }\n\n  return type;\n}\nexport function isEnumType(type) {\n  return instanceOf(type, GraphQLEnumType);\n}\nexport function assertEnumType(type) {\n  if (!isEnumType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Enum type.`);\n  }\n\n  return type;\n}\nexport function isInputObjectType(type) {\n  return instanceOf(type, GraphQLInputObjectType);\n}\nexport function assertInputObjectType(type) {\n  if (!isInputObjectType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL Input Object type.`,\n    );\n  }\n\n  return type;\n}\nexport function isListType(type) {\n  return instanceOf(type, GraphQLList);\n}\nexport function assertListType(type) {\n  if (!isListType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL List type.`);\n  }\n\n  return type;\n}\nexport function isNonNullType(type) {\n  return instanceOf(type, GraphQLNonNull);\n}\nexport function assertNonNullType(type) {\n  if (!isNonNullType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Non-Null type.`);\n  }\n\n  return type;\n}\n/**\n * These types may be used as input types for arguments and directives.\n */\n\nexport function isInputType(type) {\n  return (\n    isScalarType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type) ||\n    (isWrappingType(type) && isInputType(type.ofType))\n  );\n}\nexport function assertInputType(type) {\n  if (!isInputType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL input type.`);\n  }\n\n  return type;\n}\n/**\n * These types may be used as output types as the result of fields.\n */\n\nexport function isOutputType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    (isWrappingType(type) && isOutputType(type.ofType))\n  );\n}\nexport function assertOutputType(type) {\n  if (!isOutputType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL output type.`);\n  }\n\n  return type;\n}\n/**\n * These types may describe types which may be leaf values.\n */\n\nexport function isLeafType(type) {\n  return isScalarType(type) || isEnumType(type);\n}\nexport function assertLeafType(type) {\n  if (!isLeafType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL leaf type.`);\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isCompositeType(type) {\n  return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\n}\nexport function assertCompositeType(type) {\n  if (!isCompositeType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL composite type.`,\n    );\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isAbstractType(type) {\n  return isInterfaceType(type) || isUnionType(type);\n}\nexport function assertAbstractType(type) {\n  if (!isAbstractType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL abstract type.`);\n  }\n\n  return type;\n}\n/**\n * List Type Wrapper\n *\n * A list is a wrapping type which points to another type.\n * Lists are often created within the context of defining the fields of\n * an object type.\n *\n * Example:\n *\n * ```ts\n * const PersonType = new GraphQLObjectType({\n *   name: 'Person',\n *   fields: () => ({\n *     parents: { type: new GraphQLList(PersonType) },\n *     children: { type: new GraphQLList(PersonType) },\n *   })\n * })\n * ```\n */\n\nexport class GraphQLList {\n  constructor(ofType) {\n    isType(ofType) ||\n      devAssert(false, `Expected ${inspect(ofType)} to be a GraphQL type.`);\n    this.ofType = ofType;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLList';\n  }\n\n  toString() {\n    return '[' + String(this.ofType) + ']';\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n/**\n * Non-Null Type Wrapper\n *\n * A non-null is a wrapping type which points to another type.\n * Non-null types enforce that their values are never null and can ensure\n * an error is raised if this ever occurs during a request. It is useful for\n * fields which you can make a strong guarantee on non-nullability, for example\n * usually the id field of a database row will never be null.\n *\n * Example:\n *\n * ```ts\n * const RowType = new GraphQLObjectType({\n *   name: 'Row',\n *   fields: () => ({\n *     id: { type: new GraphQLNonNull(GraphQLString) },\n *   })\n * })\n * ```\n * Note: the enforcement of non-nullability occurs within the executor.\n */\n\nexport class GraphQLNonNull {\n  constructor(ofType) {\n    isNullableType(ofType) ||\n      devAssert(\n        false,\n        `Expected ${inspect(ofType)} to be a GraphQL nullable type.`,\n      );\n    this.ofType = ofType;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLNonNull';\n  }\n\n  toString() {\n    return String(this.ofType) + '!';\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n/**\n * These types wrap and modify other types\n */\n\nexport function isWrappingType(type) {\n  return isListType(type) || isNonNullType(type);\n}\nexport function assertWrappingType(type) {\n  if (!isWrappingType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL wrapping type.`);\n  }\n\n  return type;\n}\n/**\n * These types can all accept null as a value.\n */\n\nexport function isNullableType(type) {\n  return isType(type) && !isNonNullType(type);\n}\nexport function assertNullableType(type) {\n  if (!isNullableType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL nullable type.`);\n  }\n\n  return type;\n}\nexport function getNullableType(type) {\n  if (type) {\n    return isNonNullType(type) ? type.ofType : type;\n  }\n}\n/**\n * These named types do not include modifiers like List or NonNull.\n */\n\nexport function isNamedType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type)\n  );\n}\nexport function assertNamedType(type) {\n  if (!isNamedType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL named type.`);\n  }\n\n  return type;\n}\nexport function getNamedType(type) {\n  if (type) {\n    let unwrappedType = type;\n\n    while (isWrappingType(unwrappedType)) {\n      unwrappedType = unwrappedType.ofType;\n    }\n\n    return unwrappedType;\n  }\n}\n/**\n * Used while defining GraphQL types to allow for circular references in\n * otherwise immutable type definitions.\n */\n\nexport function resolveReadonlyArrayThunk(thunk) {\n  return typeof thunk === 'function' ? thunk() : thunk;\n}\nexport function resolveObjMapThunk(thunk) {\n  return typeof thunk === 'function' ? thunk() : thunk;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Scalar Type Definition\n *\n * The leaf values of any request and input values to arguments are\n * Scalars (or Enums) and are defined with a name and a series of functions\n * used to parse input from ast or variables and to ensure validity.\n *\n * If a type's serialize function returns `null` or does not return a value\n * (i.e. it returns `undefined`) then an error will be raised and a `null`\n * value will be returned in the response. It is always better to validate\n *\n * Example:\n *\n * ```ts\n * const OddType = new GraphQLScalarType({\n *   name: 'Odd',\n *   serialize(value) {\n *     if (!Number.isFinite(value)) {\n *       throw new Error(\n *         `Scalar \"Odd\" cannot represent \"${value}\" since it is not a finite number.`,\n *       );\n *     }\n *\n *     if (value % 2 === 0) {\n *       throw new Error(`Scalar \"Odd\" cannot represent \"${value}\" since it is even.`);\n *     }\n *     return value;\n *   }\n * });\n * ```\n */\nexport class GraphQLScalarType {\n  constructor(config) {\n    var _config$parseValue,\n      _config$serialize,\n      _config$parseLiteral,\n      _config$extensionASTN;\n\n    const parseValue =\n      (_config$parseValue = config.parseValue) !== null &&\n      _config$parseValue !== void 0\n        ? _config$parseValue\n        : identityFunc;\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.specifiedByURL = config.specifiedByURL;\n    this.serialize =\n      (_config$serialize = config.serialize) !== null &&\n      _config$serialize !== void 0\n        ? _config$serialize\n        : identityFunc;\n    this.parseValue = parseValue;\n    this.parseLiteral =\n      (_config$parseLiteral = config.parseLiteral) !== null &&\n      _config$parseLiteral !== void 0\n        ? _config$parseLiteral\n        : (node, variables) => parseValue(valueFromASTUntyped(node, variables));\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN = config.extensionASTNodes) !== null &&\n      _config$extensionASTN !== void 0\n        ? _config$extensionASTN\n        : [];\n    config.specifiedByURL == null ||\n      typeof config.specifiedByURL === 'string' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"specifiedByURL\" as a string, ` +\n          `but got: ${inspect(config.specifiedByURL)}.`,\n      );\n    config.serialize == null ||\n      typeof config.serialize === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"serialize\" function. If this custom Scalar is also used as an input type, ensure \"parseValue\" and \"parseLiteral\" functions are also provided.`,\n      );\n\n    if (config.parseLiteral) {\n      (typeof config.parseValue === 'function' &&\n        typeof config.parseLiteral === 'function') ||\n        devAssert(\n          false,\n          `${this.name} must provide both \"parseValue\" and \"parseLiteral\" functions.`,\n        );\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLScalarType';\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      specifiedByURL: this.specifiedByURL,\n      serialize: this.serialize,\n      parseValue: this.parseValue,\n      parseLiteral: this.parseLiteral,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Object Type Definition\n *\n * Almost all of the GraphQL types you define will be object types. Object types\n * have a name, but most importantly describe their fields.\n *\n * Example:\n *\n * ```ts\n * const AddressType = new GraphQLObjectType({\n *   name: 'Address',\n *   fields: {\n *     street: { type: GraphQLString },\n *     number: { type: GraphQLInt },\n *     formatted: {\n *       type: GraphQLString,\n *       resolve(obj) {\n *         return obj.number + ' ' + obj.street\n *       }\n *     }\n *   }\n * });\n * ```\n *\n * When two types need to refer to each other, or a type needs to refer to\n * itself in a field, you can use a function expression (aka a closure or a\n * thunk) to supply the fields lazily.\n *\n * Example:\n *\n * ```ts\n * const PersonType = new GraphQLObjectType({\n *   name: 'Person',\n *   fields: () => ({\n *     name: { type: GraphQLString },\n *     bestFriend: { type: PersonType },\n *   })\n * });\n * ```\n */\nexport class GraphQLObjectType {\n  constructor(config) {\n    var _config$extensionASTN2;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.isTypeOf = config.isTypeOf;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN2 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN2 !== void 0\n        ? _config$extensionASTN2\n        : [];\n\n    this._fields = () => defineFieldMap(config);\n\n    this._interfaces = () => defineInterfaces(config);\n\n    config.isTypeOf == null ||\n      typeof config.isTypeOf === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"isTypeOf\" as a function, ` +\n          `but got: ${inspect(config.isTypeOf)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLObjectType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      isTypeOf: this.isTypeOf,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineInterfaces(config) {\n  var _config$interfaces;\n\n  const interfaces = resolveReadonlyArrayThunk(\n    (_config$interfaces = config.interfaces) !== null &&\n      _config$interfaces !== void 0\n      ? _config$interfaces\n      : [],\n  );\n  Array.isArray(interfaces) ||\n    devAssert(\n      false,\n      `${config.name} interfaces must be an Array or a function which returns an Array.`,\n    );\n  return interfaces;\n}\n\nfunction defineFieldMap(config) {\n  const fieldMap = resolveObjMapThunk(config.fields);\n  isPlainObj(fieldMap) ||\n    devAssert(\n      false,\n      `${config.name} fields must be an object with field names as keys or a function which returns such an object.`,\n    );\n  return mapValue(fieldMap, (fieldConfig, fieldName) => {\n    var _fieldConfig$args;\n\n    isPlainObj(fieldConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field config must be an object.`,\n      );\n    fieldConfig.resolve == null ||\n      typeof fieldConfig.resolve === 'function' ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field resolver must be a function if ` +\n          `provided, but got: ${inspect(fieldConfig.resolve)}.`,\n      );\n    const argsConfig =\n      (_fieldConfig$args = fieldConfig.args) !== null &&\n      _fieldConfig$args !== void 0\n        ? _fieldConfig$args\n        : {};\n    isPlainObj(argsConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} args must be an object with argument names as keys.`,\n      );\n    return {\n      name: assertName(fieldName),\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      args: defineArguments(argsConfig),\n      resolve: fieldConfig.resolve,\n      subscribe: fieldConfig.subscribe,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode,\n    };\n  });\n}\n\nexport function defineArguments(config) {\n  return Object.entries(config).map(([argName, argConfig]) => ({\n    name: assertName(argName),\n    description: argConfig.description,\n    type: argConfig.type,\n    defaultValue: argConfig.defaultValue,\n    deprecationReason: argConfig.deprecationReason,\n    extensions: toObjMap(argConfig.extensions),\n    astNode: argConfig.astNode,\n  }));\n}\n\nfunction isPlainObj(obj) {\n  return isObjectLike(obj) && !Array.isArray(obj);\n}\n\nfunction fieldsToFieldsConfig(fields) {\n  return mapValue(fields, (field) => ({\n    description: field.description,\n    type: field.type,\n    args: argsToArgsConfig(field.args),\n    resolve: field.resolve,\n    subscribe: field.subscribe,\n    deprecationReason: field.deprecationReason,\n    extensions: field.extensions,\n    astNode: field.astNode,\n  }));\n}\n/**\n * @internal\n */\n\nexport function argsToArgsConfig(args) {\n  return keyValMap(\n    args,\n    (arg) => arg.name,\n    (arg) => ({\n      description: arg.description,\n      type: arg.type,\n      defaultValue: arg.defaultValue,\n      deprecationReason: arg.deprecationReason,\n      extensions: arg.extensions,\n      astNode: arg.astNode,\n    }),\n  );\n}\nexport function isRequiredArgument(arg) {\n  return isNonNullType(arg.type) && arg.defaultValue === undefined;\n}\n\n/**\n * Interface Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Interface type\n * is used to describe what types are possible, what fields are in common across\n * all types, as well as a function to determine which type is actually used\n * when the field is resolved.\n *\n * Example:\n *\n * ```ts\n * const EntityType = new GraphQLInterfaceType({\n *   name: 'Entity',\n *   fields: {\n *     name: { type: GraphQLString }\n *   }\n * });\n * ```\n */\nexport class GraphQLInterfaceType {\n  constructor(config) {\n    var _config$extensionASTN3;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN3 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN3 !== void 0\n        ? _config$extensionASTN3\n        : [];\n    this._fields = defineFieldMap.bind(undefined, config);\n    this._interfaces = defineInterfaces.bind(undefined, config);\n    config.resolveType == null ||\n      typeof config.resolveType === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"resolveType\" as a function, ` +\n          `but got: ${inspect(config.resolveType)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLInterfaceType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Union Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Union type\n * is used to describe what types are possible as well as providing a function\n * to determine which type is actually used when the field is resolved.\n *\n * Example:\n *\n * ```ts\n * const PetType = new GraphQLUnionType({\n *   name: 'Pet',\n *   types: [ DogType, CatType ],\n *   resolveType(value) {\n *     if (value instanceof Dog) {\n *       return DogType;\n *     }\n *     if (value instanceof Cat) {\n *       return CatType;\n *     }\n *   }\n * });\n * ```\n */\nexport class GraphQLUnionType {\n  constructor(config) {\n    var _config$extensionASTN4;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN4 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN4 !== void 0\n        ? _config$extensionASTN4\n        : [];\n    this._types = defineTypes.bind(undefined, config);\n    config.resolveType == null ||\n      typeof config.resolveType === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"resolveType\" as a function, ` +\n          `but got: ${inspect(config.resolveType)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLUnionType';\n  }\n\n  getTypes() {\n    if (typeof this._types === 'function') {\n      this._types = this._types();\n    }\n\n    return this._types;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      types: this.getTypes(),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineTypes(config) {\n  const types = resolveReadonlyArrayThunk(config.types);\n  Array.isArray(types) ||\n    devAssert(\n      false,\n      `Must provide Array of types or a function which returns such an array for Union ${config.name}.`,\n    );\n  return types;\n}\n\n/**\n * Enum Type Definition\n *\n * Some leaf values of requests and input values are Enums. GraphQL serializes\n * Enum values as strings, however internally Enums can be represented by any\n * kind of type, often integers.\n *\n * Example:\n *\n * ```ts\n * const RGBType = new GraphQLEnumType({\n *   name: 'RGB',\n *   values: {\n *     RED: { value: 0 },\n *     GREEN: { value: 1 },\n *     BLUE: { value: 2 }\n *   }\n * });\n * ```\n *\n * Note: If a value is not provided in a definition, the name of the enum value\n * will be used as its internal value.\n */\nexport class GraphQLEnumType {\n  /* <T> */\n  constructor(config) {\n    var _config$extensionASTN5;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN5 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN5 !== void 0\n        ? _config$extensionASTN5\n        : [];\n    this._values =\n      typeof config.values === 'function'\n        ? config.values\n        : defineEnumValues(this.name, config.values);\n    this._valueLookup = null;\n    this._nameLookup = null;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLEnumType';\n  }\n\n  getValues() {\n    if (typeof this._values === 'function') {\n      this._values = defineEnumValues(this.name, this._values());\n    }\n\n    return this._values;\n  }\n\n  getValue(name) {\n    if (this._nameLookup === null) {\n      this._nameLookup = keyMap(this.getValues(), (value) => value.name);\n    }\n\n    return this._nameLookup[name];\n  }\n\n  serialize(outputValue) {\n    if (this._valueLookup === null) {\n      this._valueLookup = new Map(\n        this.getValues().map((enumValue) => [enumValue.value, enumValue]),\n      );\n    }\n\n    const enumValue = this._valueLookup.get(outputValue);\n\n    if (enumValue === undefined) {\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent value: ${inspect(outputValue)}`,\n      );\n    }\n\n    return enumValue.name;\n  }\n\n  parseValue(inputValue) /* T */\n  {\n    if (typeof inputValue !== 'string') {\n      const valueStr = inspect(inputValue);\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent non-string value: ${valueStr}.` +\n          didYouMeanEnumValue(this, valueStr),\n      );\n    }\n\n    const enumValue = this.getValue(inputValue);\n\n    if (enumValue == null) {\n      throw new GraphQLError(\n        `Value \"${inputValue}\" does not exist in \"${this.name}\" enum.` +\n          didYouMeanEnumValue(this, inputValue),\n      );\n    }\n\n    return enumValue.value;\n  }\n\n  parseLiteral(valueNode, _variables) /* T */\n  {\n    // Note: variables will be resolved to a value before calling this function.\n    if (valueNode.kind !== Kind.ENUM) {\n      const valueStr = print(valueNode);\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent non-enum value: ${valueStr}.` +\n          didYouMeanEnumValue(this, valueStr),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const enumValue = this.getValue(valueNode.value);\n\n    if (enumValue == null) {\n      const valueStr = print(valueNode);\n      throw new GraphQLError(\n        `Value \"${valueStr}\" does not exist in \"${this.name}\" enum.` +\n          didYouMeanEnumValue(this, valueStr),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return enumValue.value;\n  }\n\n  toConfig() {\n    const values = keyValMap(\n      this.getValues(),\n      (value) => value.name,\n      (value) => ({\n        description: value.description,\n        value: value.value,\n        deprecationReason: value.deprecationReason,\n        extensions: value.extensions,\n        astNode: value.astNode,\n      }),\n    );\n    return {\n      name: this.name,\n      description: this.description,\n      values,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction didYouMeanEnumValue(enumType, unknownValueStr) {\n  const allNames = enumType.getValues().map((value) => value.name);\n  const suggestedValues = suggestionList(unknownValueStr, allNames);\n  return didYouMean('the enum value', suggestedValues);\n}\n\nfunction defineEnumValues(typeName, valueMap) {\n  isPlainObj(valueMap) ||\n    devAssert(\n      false,\n      `${typeName} values must be an object with value names as keys.`,\n    );\n  return Object.entries(valueMap).map(([valueName, valueConfig]) => {\n    isPlainObj(valueConfig) ||\n      devAssert(\n        false,\n        `${typeName}.${valueName} must refer to an object with a \"value\" key ` +\n          `representing an internal value but got: ${inspect(valueConfig)}.`,\n      );\n    return {\n      name: assertEnumValueName(valueName),\n      description: valueConfig.description,\n      value: valueConfig.value !== undefined ? valueConfig.value : valueName,\n      deprecationReason: valueConfig.deprecationReason,\n      extensions: toObjMap(valueConfig.extensions),\n      astNode: valueConfig.astNode,\n    };\n  });\n}\n\n/**\n * Input Object Type Definition\n *\n * An input object defines a structured collection of fields which may be\n * supplied to a field argument.\n *\n * Using `NonNull` will ensure that a value must be provided by the query\n *\n * Example:\n *\n * ```ts\n * const GeoPoint = new GraphQLInputObjectType({\n *   name: 'GeoPoint',\n *   fields: {\n *     lat: { type: new GraphQLNonNull(GraphQLFloat) },\n *     lon: { type: new GraphQLNonNull(GraphQLFloat) },\n *     alt: { type: GraphQLFloat, defaultValue: 0 },\n *   }\n * });\n * ```\n */\nexport class GraphQLInputObjectType {\n  constructor(config) {\n    var _config$extensionASTN6, _config$isOneOf;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN6 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN6 !== void 0\n        ? _config$extensionASTN6\n        : [];\n    this.isOneOf =\n      (_config$isOneOf = config.isOneOf) !== null && _config$isOneOf !== void 0\n        ? _config$isOneOf\n        : false;\n    this._fields = defineInputFieldMap.bind(undefined, config);\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLInputObjectType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  toConfig() {\n    const fields = mapValue(this.getFields(), (field) => ({\n      description: field.description,\n      type: field.type,\n      defaultValue: field.defaultValue,\n      deprecationReason: field.deprecationReason,\n      extensions: field.extensions,\n      astNode: field.astNode,\n    }));\n    return {\n      name: this.name,\n      description: this.description,\n      fields,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n      isOneOf: this.isOneOf,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineInputFieldMap(config) {\n  const fieldMap = resolveObjMapThunk(config.fields);\n  isPlainObj(fieldMap) ||\n    devAssert(\n      false,\n      `${config.name} fields must be an object with field names as keys or a function which returns such an object.`,\n    );\n  return mapValue(fieldMap, (fieldConfig, fieldName) => {\n    !('resolve' in fieldConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field has a resolve property, but Input Types cannot define resolvers.`,\n      );\n    return {\n      name: assertName(fieldName),\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      defaultValue: fieldConfig.defaultValue,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode,\n    };\n  });\n}\n\nexport function isRequiredInputField(field) {\n  return isNonNullType(field.type) && field.defaultValue === undefined;\n}\n","import {\n  isAbstractType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n} from '../type/definition.mjs';\n\n/**\n * Provided two types, return true if the types are equal (invariant).\n */\nexport function isEqualType(typeA, typeB) {\n  // Equivalent types are equal.\n  if (typeA === typeB) {\n    return true;\n  } // If either type is non-null, the other must also be non-null.\n\n  if (isNonNullType(typeA) && isNonNullType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // If either type is a list, the other must also be a list.\n\n  if (isListType(typeA) && isListType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // Otherwise the types are not equal.\n\n  return false;\n}\n/**\n * Provided a type and a super type, return true if the first type is either\n * equal or a subset of the second super type (covariant).\n */\n\nexport function isTypeSubTypeOf(schema, maybeSubType, superType) {\n  // Equivalent type is a valid subtype\n  if (maybeSubType === superType) {\n    return true;\n  } // If superType is non-null, maybeSubType must also be non-null.\n\n  if (isNonNullType(superType)) {\n    if (isNonNullType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isNonNullType(maybeSubType)) {\n    // If superType is nullable, maybeSubType may be non-null or nullable.\n    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);\n  } // If superType type is a list, maybeSubType type must also be a list.\n\n  if (isListType(superType)) {\n    if (isListType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isListType(maybeSubType)) {\n    // If superType is not a list, maybeSubType must also be not a list.\n    return false;\n  } // If superType type is an abstract type, check if it is super type of maybeSubType.\n  // Otherwise, the child type is not a valid subtype of the parent type.\n\n  return (\n    isAbstractType(superType) &&\n    (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) &&\n    schema.isSubType(superType, maybeSubType)\n  );\n}\n/**\n * Provided two composite types, determine if they \"overlap\". Two composite\n * types overlap when the Sets of possible concrete types for each intersect.\n *\n * This is often used to determine if a fragment of a given type could possibly\n * be visited in a context of another type.\n *\n * This function is commutative.\n */\n\nexport function doTypesOverlap(schema, typeA, typeB) {\n  // Equivalent types overlap\n  if (typeA === typeB) {\n    return true;\n  }\n\n  if (isAbstractType(typeA)) {\n    if (isAbstractType(typeB)) {\n      // If both types are abstract, then determine if there is any intersection\n      // between possible concrete types of each.\n      return schema\n        .getPossibleTypes(typeA)\n        .some((type) => schema.isSubType(typeB, type));\n    } // Determine if the latter type is a possible concrete type of the former.\n\n    return schema.isSubType(typeA, typeB);\n  }\n\n  if (isAbstractType(typeB)) {\n    // Determine if the former type is a possible concrete type of the latter.\n    return schema.isSubType(typeB, typeA);\n  } // Otherwise the types do not overlap.\n\n  return false;\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { GraphQLScalarType } from './definition.mjs';\n/**\n * Maximum possible Int value as per GraphQL Spec (32-bit signed integer).\n * n.b. This differs from JavaScript's numbers that are IEEE 754 doubles safe up-to 2^53 - 1\n * */\n\nexport const GRAPHQL_MAX_INT = 2147483647;\n/**\n * Minimum possible Int value as per GraphQL Spec (32-bit signed integer).\n * n.b. This differs from JavaScript's numbers that are IEEE 754 doubles safe starting at -(2^53 - 1)\n * */\n\nexport const GRAPHQL_MIN_INT = -2147483648;\nexport const GraphQLInt = new GraphQLScalarType({\n  name: 'Int',\n  description:\n    'The `Int` scalar type represents non-fractional signed whole numeric values. Int can represent values between -(2^31) and 2^31 - 1.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 1 : 0;\n    }\n\n    let num = coercedValue;\n\n    if (typeof coercedValue === 'string' && coercedValue !== '') {\n      num = Number(coercedValue);\n    }\n\n    if (typeof num !== 'number' || !Number.isInteger(num)) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${inspect(coercedValue)}`,\n      );\n    }\n\n    if (num > GRAPHQL_MAX_INT || num < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        'Int cannot represent non 32-bit signed integer value: ' +\n          inspect(coercedValue),\n      );\n    }\n\n    return num;\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'number' || !Number.isInteger(inputValue)) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${inspect(inputValue)}`,\n      );\n    }\n\n    if (inputValue > GRAPHQL_MAX_INT || inputValue < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        `Int cannot represent non 32-bit signed integer value: ${inputValue}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const num = parseInt(valueNode.value, 10);\n\n    if (num > GRAPHQL_MAX_INT || num < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        `Int cannot represent non 32-bit signed integer value: ${valueNode.value}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return num;\n  },\n});\nexport const GraphQLFloat = new GraphQLScalarType({\n  name: 'Float',\n  description:\n    'The `Float` scalar type represents signed double-precision fractional values as specified by [IEEE 754](https://en.wikipedia.org/wiki/IEEE_floating_point).',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 1 : 0;\n    }\n\n    let num = coercedValue;\n\n    if (typeof coercedValue === 'string' && coercedValue !== '') {\n      num = Number(coercedValue);\n    }\n\n    if (typeof num !== 'number' || !Number.isFinite(num)) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${inspect(coercedValue)}`,\n      );\n    }\n\n    return num;\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'number' || !Number.isFinite(inputValue)) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.FLOAT && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${print(valueNode)}`,\n        valueNode,\n      );\n    }\n\n    return parseFloat(valueNode.value);\n  },\n});\nexport const GraphQLString = new GraphQLScalarType({\n  name: 'String',\n  description:\n    'The `String` scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue); // Serialize string, boolean and number values to a string, but do not\n    // attempt to coerce object, function, symbol, or other types as strings.\n\n    if (typeof coercedValue === 'string') {\n      return coercedValue;\n    }\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 'true' : 'false';\n    }\n\n    if (typeof coercedValue === 'number' && Number.isFinite(coercedValue)) {\n      return coercedValue.toString();\n    }\n\n    throw new GraphQLError(\n      `String cannot represent value: ${inspect(outputValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'string') {\n      throw new GraphQLError(\n        `String cannot represent a non string value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING) {\n      throw new GraphQLError(\n        `String cannot represent a non string value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const GraphQLBoolean = new GraphQLScalarType({\n  name: 'Boolean',\n  description: 'The `Boolean` scalar type represents `true` or `false`.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue;\n    }\n\n    if (Number.isFinite(coercedValue)) {\n      return coercedValue !== 0;\n    }\n\n    throw new GraphQLError(\n      `Boolean cannot represent a non boolean value: ${inspect(coercedValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'boolean') {\n      throw new GraphQLError(\n        `Boolean cannot represent a non boolean value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.BOOLEAN) {\n      throw new GraphQLError(\n        `Boolean cannot represent a non boolean value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const GraphQLID = new GraphQLScalarType({\n  name: 'ID',\n  description:\n    'The `ID` scalar type represents a unique identifier, often used to refetch an object or as key for a cache. The ID type appears in a JSON response as a String; however, it is not intended to be human-readable. When expected as an input type, any string (such as `\"4\"`) or integer (such as `4`) input value will be accepted as an ID.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'string') {\n      return coercedValue;\n    }\n\n    if (Number.isInteger(coercedValue)) {\n      return String(coercedValue);\n    }\n\n    throw new GraphQLError(\n      `ID cannot represent value: ${inspect(outputValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue === 'string') {\n      return inputValue;\n    }\n\n    if (typeof inputValue === 'number' && Number.isInteger(inputValue)) {\n      return inputValue.toString();\n    }\n\n    throw new GraphQLError(`ID cannot represent value: ${inspect(inputValue)}`);\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        'ID cannot represent a non-string and non-integer value: ' +\n          print(valueNode),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const specifiedScalarTypes = Object.freeze([\n  GraphQLString,\n  GraphQLInt,\n  GraphQLFloat,\n  GraphQLBoolean,\n  GraphQLID,\n]);\nexport function isSpecifiedScalarType(type) {\n  return specifiedScalarTypes.some(({ name }) => type.name === name);\n} // Support serializing objects with custom valueOf() or toJSON() functions -\n// a common way to represent a complex value which can be represented as\n// a string (ex: MongoDB id objects).\n\nfunction serializeObject(outputValue) {\n  if (isObjectLike(outputValue)) {\n    if (typeof outputValue.valueOf === 'function') {\n      const valueOfResult = outputValue.valueOf();\n\n      if (!isObjectLike(valueOfResult)) {\n        return valueOfResult;\n      }\n    }\n\n    if (typeof outputValue.toJSON === 'function') {\n      return outputValue.toJSON();\n    }\n  }\n\n  return outputValue;\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { DirectiveLocation } from '../language/directiveLocation.mjs';\nimport { assertName } from './assertName.mjs';\nimport {\n  argsToArgsConfig,\n  defineArguments,\n  GraphQLNonNull,\n} from './definition.mjs';\nimport { GraphQLBoolean, GraphQLString } from './scalars.mjs';\n/**\n * Test if the given value is a GraphQL directive.\n */\n\nexport function isDirective(directive) {\n  return instanceOf(directive, GraphQLDirective);\n}\nexport function assertDirective(directive) {\n  if (!isDirective(directive)) {\n    throw new Error(\n      `Expected ${inspect(directive)} to be a GraphQL directive.`,\n    );\n  }\n\n  return directive;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Directives are used by the GraphQL runtime as a way of modifying execution\n * behavior. Type system creators will usually not create these directly.\n */\nexport class GraphQLDirective {\n  constructor(config) {\n    var _config$isRepeatable, _config$args;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.locations = config.locations;\n    this.isRepeatable =\n      (_config$isRepeatable = config.isRepeatable) !== null &&\n      _config$isRepeatable !== void 0\n        ? _config$isRepeatable\n        : false;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    Array.isArray(config.locations) ||\n      devAssert(false, `@${config.name} locations must be an Array.`);\n    const args =\n      (_config$args = config.args) !== null && _config$args !== void 0\n        ? _config$args\n        : {};\n    (isObjectLike(args) && !Array.isArray(args)) ||\n      devAssert(\n        false,\n        `@${config.name} args must be an object with argument names as keys.`,\n      );\n    this.args = defineArguments(args);\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLDirective';\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      locations: this.locations,\n      args: argsToArgsConfig(this.args),\n      isRepeatable: this.isRepeatable,\n      extensions: this.extensions,\n      astNode: this.astNode,\n    };\n  }\n\n  toString() {\n    return '@' + this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Used to conditionally include fields or fragments.\n */\nexport const GraphQLIncludeDirective = new GraphQLDirective({\n  name: 'include',\n  description:\n    'Directs the executor to include this field or fragment only when the `if` argument is true.',\n  locations: [\n    DirectiveLocation.FIELD,\n    DirectiveLocation.FRAGMENT_SPREAD,\n    DirectiveLocation.INLINE_FRAGMENT,\n  ],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Included when true.',\n    },\n  },\n});\n/**\n * Used to conditionally skip (exclude) fields or fragments.\n */\n\nexport const GraphQLSkipDirective = new GraphQLDirective({\n  name: 'skip',\n  description:\n    'Directs the executor to skip this field or fragment when the `if` argument is true.',\n  locations: [\n    DirectiveLocation.FIELD,\n    DirectiveLocation.FRAGMENT_SPREAD,\n    DirectiveLocation.INLINE_FRAGMENT,\n  ],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Skipped when true.',\n    },\n  },\n});\n/**\n * Constant string used for default reason for a deprecation.\n */\n\nexport const DEFAULT_DEPRECATION_REASON = 'No longer supported';\n/**\n * Used to declare element of a GraphQL schema as deprecated.\n */\n\nexport const GraphQLDeprecatedDirective = new GraphQLDirective({\n  name: 'deprecated',\n  description: 'Marks an element of a GraphQL schema as no longer supported.',\n  locations: [\n    DirectiveLocation.FIELD_DEFINITION,\n    DirectiveLocation.ARGUMENT_DEFINITION,\n    DirectiveLocation.INPUT_FIELD_DEFINITION,\n    DirectiveLocation.ENUM_VALUE,\n  ],\n  args: {\n    reason: {\n      type: GraphQLString,\n      description:\n        'Explains why this element was deprecated, usually also including a suggestion for how to access supported similar data. Formatted using the Markdown syntax, as specified by [CommonMark](https://commonmark.org/).',\n      defaultValue: DEFAULT_DEPRECATION_REASON,\n    },\n  },\n});\n/**\n * Used to provide a URL for specifying the behavior of custom scalar definitions.\n */\n\nexport const GraphQLSpecifiedByDirective = new GraphQLDirective({\n  name: 'specifiedBy',\n  description: 'Exposes a URL that specifies the behavior of this scalar.',\n  locations: [DirectiveLocation.SCALAR],\n  args: {\n    url: {\n      type: new GraphQLNonNull(GraphQLString),\n      description: 'The URL that specifies the behavior of this scalar.',\n    },\n  },\n});\n/**\n * Used to indicate an Input Object is a OneOf Input Object.\n */\n\nexport const GraphQLOneOfDirective = new GraphQLDirective({\n  name: 'oneOf',\n  description:\n    'Indicates exactly one field must be supplied and this field must not be `null`.',\n  locations: [DirectiveLocation.INPUT_OBJECT],\n  args: {},\n});\n/**\n * The full list of specified directives.\n */\n\nexport const specifiedDirectives = Object.freeze([\n  GraphQLIncludeDirective,\n  GraphQLSkipDirective,\n  GraphQLDeprecatedDirective,\n  GraphQLSpecifiedByDirective,\n  GraphQLOneOfDirective,\n]);\nexport function isSpecifiedDirective(directive) {\n  return specifiedDirectives.some(({ name }) => name === directive.name);\n}\n","/**\n * Returns true if the provided object is an Object (i.e. not a string literal)\n * and implements the Iterator protocol.\n *\n * This may be used in place of [Array.isArray()][isArray] to determine if\n * an object should be iterated-over e.g. Array, Map, Set, Int8Array,\n * TypedArray, etc. but excludes string literals.\n *\n * @example\n * ```ts\n * isIterableObject([ 1, 2, 3 ]) // true\n * isIterableObject(new Map()) // true\n * isIterableObject('ABC') // false\n * isIterableObject({ key: 'value' }) // false\n * isIterableObject({ length: 1, 0: 'Alpha' }) // false\n * ```\n */\nexport function isIterableObject(maybeIterable) {\n  return (\n    typeof maybeIterable === 'object' &&\n    typeof (maybeIterable === null || maybeIterable === void 0\n      ? void 0\n      : maybeIterable[Symbol.iterator]) === 'function'\n  );\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isIterableObject } from '../jsutils/isIterableObject.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\nimport { GraphQLID } from '../type/scalars.mjs';\n/**\n * Produces a GraphQL Value AST given a JavaScript object.\n * Function will match JavaScript/JSON values to GraphQL AST schema format\n * by using suggested GraphQLInputType. For example:\n *\n *     astFromValue(\"value\", GraphQLString)\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * JavaScript values.\n *\n * | JSON Value    | GraphQL Value        |\n * | ------------- | -------------------- |\n * | Object        | Input Object         |\n * | Array         | List                 |\n * | Boolean       | Boolean              |\n * | String        | String / Enum Value  |\n * | Number        | Int / Float          |\n * | Unknown       | Enum Value           |\n * | null          | NullValue            |\n *\n */\n\nexport function astFromValue(value, type) {\n  if (isNonNullType(type)) {\n    const astValue = astFromValue(value, type.ofType);\n\n    if (\n      (astValue === null || astValue === void 0 ? void 0 : astValue.kind) ===\n      Kind.NULL\n    ) {\n      return null;\n    }\n\n    return astValue;\n  } // only explicit null, not undefined, NaN\n\n  if (value === null) {\n    return {\n      kind: Kind.NULL,\n    };\n  } // undefined\n\n  if (value === undefined) {\n    return null;\n  } // Convert JavaScript array to GraphQL list. If the GraphQLType is a list, but\n  // the value is not an array, convert the value using the list's item type.\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (isIterableObject(value)) {\n      const valuesNodes = [];\n\n      for (const item of value) {\n        const itemNode = astFromValue(item, itemType);\n\n        if (itemNode != null) {\n          valuesNodes.push(itemNode);\n        }\n      }\n\n      return {\n        kind: Kind.LIST,\n        values: valuesNodes,\n      };\n    }\n\n    return astFromValue(value, itemType);\n  } // Populate the fields of the input object by creating ASTs from each value\n  // in the JavaScript object according to the fields in the input type.\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(value)) {\n      return null;\n    }\n\n    const fieldNodes = [];\n\n    for (const field of Object.values(type.getFields())) {\n      const fieldValue = astFromValue(value[field.name], field.type);\n\n      if (fieldValue) {\n        fieldNodes.push({\n          kind: Kind.OBJECT_FIELD,\n          name: {\n            kind: Kind.NAME,\n            value: field.name,\n          },\n          value: fieldValue,\n        });\n      }\n    }\n\n    return {\n      kind: Kind.OBJECT,\n      fields: fieldNodes,\n    };\n  }\n\n  if (isLeafType(type)) {\n    // Since value is an internally represented value, it must be serialized\n    // to an externally represented value before converting into an AST.\n    const serialized = type.serialize(value);\n\n    if (serialized == null) {\n      return null;\n    } // Others serialize based on their corresponding JavaScript scalar types.\n\n    if (typeof serialized === 'boolean') {\n      return {\n        kind: Kind.BOOLEAN,\n        value: serialized,\n      };\n    } // JavaScript numbers can be Int or Float values.\n\n    if (typeof serialized === 'number' && Number.isFinite(serialized)) {\n      const stringNum = String(serialized);\n      return integerStringRegExp.test(stringNum)\n        ? {\n            kind: Kind.INT,\n            value: stringNum,\n          }\n        : {\n            kind: Kind.FLOAT,\n            value: stringNum,\n          };\n    }\n\n    if (typeof serialized === 'string') {\n      // Enum types use Enum literals.\n      if (isEnumType(type)) {\n        return {\n          kind: Kind.ENUM,\n          value: serialized,\n        };\n      } // ID types can use Int literals.\n\n      if (type === GraphQLID && integerStringRegExp.test(serialized)) {\n        return {\n          kind: Kind.INT,\n          value: serialized,\n        };\n      }\n\n      return {\n        kind: Kind.STRING,\n        value: serialized,\n      };\n    }\n\n    throw new TypeError(`Cannot convert value to AST: ${inspect(serialized)}.`);\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n}\n/**\n * IntValue:\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit ( Digit+ )?\n */\n\nconst integerStringRegExp = /^-?(?:0|[1-9][0-9]*)$/;\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { DirectiveLocation } from '../language/directiveLocation.mjs';\nimport { print } from '../language/printer.mjs';\nimport { astFromValue } from '../utilities/astFromValue.mjs';\nimport {\n  GraphQLEnumType,\n  GraphQLList,\n  GraphQLNonNull,\n  GraphQLObjectType,\n  isAbstractType,\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from './definition.mjs';\nimport { GraphQLBoolean, GraphQLString } from './scalars.mjs';\nexport const __Schema = new GraphQLObjectType({\n  name: '__Schema',\n  description:\n    'A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.',\n  fields: () => ({\n    description: {\n      type: GraphQLString,\n      resolve: (schema) => schema.description,\n    },\n    types: {\n      description: 'A list of all types supported by this server.',\n      type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__Type))),\n\n      resolve(schema) {\n        return Object.values(schema.getTypeMap());\n      },\n    },\n    queryType: {\n      description: 'The type that query operations will be rooted at.',\n      type: new GraphQLNonNull(__Type),\n      resolve: (schema) => schema.getQueryType(),\n    },\n    mutationType: {\n      description:\n        'If this server supports mutation, the type that mutation operations will be rooted at.',\n      type: __Type,\n      resolve: (schema) => schema.getMutationType(),\n    },\n    subscriptionType: {\n      description:\n        'If this server support subscription, the type that subscription operations will be rooted at.',\n      type: __Type,\n      resolve: (schema) => schema.getSubscriptionType(),\n    },\n    directives: {\n      description: 'A list of all directives supported by this server.',\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__Directive)),\n      ),\n      resolve: (schema) => schema.getDirectives(),\n    },\n  }),\n});\nexport const __Directive = new GraphQLObjectType({\n  name: '__Directive',\n  description:\n    \"A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\\n\\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.\",\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (directive) => directive.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (directive) => directive.description,\n    },\n    isRepeatable: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (directive) => directive.isRepeatable,\n    },\n    locations: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__DirectiveLocation)),\n      ),\n      resolve: (directive) => directive.locations,\n    },\n    args: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__InputValue)),\n      ),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(field, { includeDeprecated }) {\n        return includeDeprecated\n          ? field.args\n          : field.args.filter((arg) => arg.deprecationReason == null);\n      },\n    },\n  }),\n});\nexport const __DirectiveLocation = new GraphQLEnumType({\n  name: '__DirectiveLocation',\n  description:\n    'A Directive can be adjacent to many parts of the GraphQL language, a __DirectiveLocation describes one such possible adjacencies.',\n  values: {\n    QUERY: {\n      value: DirectiveLocation.QUERY,\n      description: 'Location adjacent to a query operation.',\n    },\n    MUTATION: {\n      value: DirectiveLocation.MUTATION,\n      description: 'Location adjacent to a mutation operation.',\n    },\n    SUBSCRIPTION: {\n      value: DirectiveLocation.SUBSCRIPTION,\n      description: 'Location adjacent to a subscription operation.',\n    },\n    FIELD: {\n      value: DirectiveLocation.FIELD,\n      description: 'Location adjacent to a field.',\n    },\n    FRAGMENT_DEFINITION: {\n      value: DirectiveLocation.FRAGMENT_DEFINITION,\n      description: 'Location adjacent to a fragment definition.',\n    },\n    FRAGMENT_SPREAD: {\n      value: DirectiveLocation.FRAGMENT_SPREAD,\n      description: 'Location adjacent to a fragment spread.',\n    },\n    INLINE_FRAGMENT: {\n      value: DirectiveLocation.INLINE_FRAGMENT,\n      description: 'Location adjacent to an inline fragment.',\n    },\n    VARIABLE_DEFINITION: {\n      value: DirectiveLocation.VARIABLE_DEFINITION,\n      description: 'Location adjacent to a variable definition.',\n    },\n    SCHEMA: {\n      value: DirectiveLocation.SCHEMA,\n      description: 'Location adjacent to a schema definition.',\n    },\n    SCALAR: {\n      value: DirectiveLocation.SCALAR,\n      description: 'Location adjacent to a scalar definition.',\n    },\n    OBJECT: {\n      value: DirectiveLocation.OBJECT,\n      description: 'Location adjacent to an object type definition.',\n    },\n    FIELD_DEFINITION: {\n      value: DirectiveLocation.FIELD_DEFINITION,\n      description: 'Location adjacent to a field definition.',\n    },\n    ARGUMENT_DEFINITION: {\n      value: DirectiveLocation.ARGUMENT_DEFINITION,\n      description: 'Location adjacent to an argument definition.',\n    },\n    INTERFACE: {\n      value: DirectiveLocation.INTERFACE,\n      description: 'Location adjacent to an interface definition.',\n    },\n    UNION: {\n      value: DirectiveLocation.UNION,\n      description: 'Location adjacent to a union definition.',\n    },\n    ENUM: {\n      value: DirectiveLocation.ENUM,\n      description: 'Location adjacent to an enum definition.',\n    },\n    ENUM_VALUE: {\n      value: DirectiveLocation.ENUM_VALUE,\n      description: 'Location adjacent to an enum value definition.',\n    },\n    INPUT_OBJECT: {\n      value: DirectiveLocation.INPUT_OBJECT,\n      description: 'Location adjacent to an input object type definition.',\n    },\n    INPUT_FIELD_DEFINITION: {\n      value: DirectiveLocation.INPUT_FIELD_DEFINITION,\n      description: 'Location adjacent to an input object field definition.',\n    },\n  },\n});\nexport const __Type = new GraphQLObjectType({\n  name: '__Type',\n  description:\n    'The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\\n\\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name, description and optional `specifiedByURL`, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.',\n  fields: () => ({\n    kind: {\n      type: new GraphQLNonNull(__TypeKind),\n\n      resolve(type) {\n        if (isScalarType(type)) {\n          return TypeKind.SCALAR;\n        }\n\n        if (isObjectType(type)) {\n          return TypeKind.OBJECT;\n        }\n\n        if (isInterfaceType(type)) {\n          return TypeKind.INTERFACE;\n        }\n\n        if (isUnionType(type)) {\n          return TypeKind.UNION;\n        }\n\n        if (isEnumType(type)) {\n          return TypeKind.ENUM;\n        }\n\n        if (isInputObjectType(type)) {\n          return TypeKind.INPUT_OBJECT;\n        }\n\n        if (isListType(type)) {\n          return TypeKind.LIST;\n        }\n\n        if (isNonNullType(type)) {\n          return TypeKind.NON_NULL;\n        }\n        /* c8 ignore next 3 */\n        // Not reachable, all possible types have been considered)\n\n        false || invariant(false, `Unexpected type: \"${inspect(type)}\".`);\n      },\n    },\n    name: {\n      type: GraphQLString,\n      resolve: (type) => ('name' in type ? type.name : undefined),\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (\n        type, // FIXME: add test case\n      ) =>\n        /* c8 ignore next */\n        'description' in type ? type.description : undefined,\n    },\n    specifiedByURL: {\n      type: GraphQLString,\n      resolve: (obj) =>\n        'specifiedByURL' in obj ? obj.specifiedByURL : undefined,\n    },\n    fields: {\n      type: new GraphQLList(new GraphQLNonNull(__Field)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isObjectType(type) || isInterfaceType(type)) {\n          const fields = Object.values(type.getFields());\n          return includeDeprecated\n            ? fields\n            : fields.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    interfaces: {\n      type: new GraphQLList(new GraphQLNonNull(__Type)),\n\n      resolve(type) {\n        if (isObjectType(type) || isInterfaceType(type)) {\n          return type.getInterfaces();\n        }\n      },\n    },\n    possibleTypes: {\n      type: new GraphQLList(new GraphQLNonNull(__Type)),\n\n      resolve(type, _args, _context, { schema }) {\n        if (isAbstractType(type)) {\n          return schema.getPossibleTypes(type);\n        }\n      },\n    },\n    enumValues: {\n      type: new GraphQLList(new GraphQLNonNull(__EnumValue)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isEnumType(type)) {\n          const values = type.getValues();\n          return includeDeprecated\n            ? values\n            : values.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    inputFields: {\n      type: new GraphQLList(new GraphQLNonNull(__InputValue)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isInputObjectType(type)) {\n          const values = Object.values(type.getFields());\n          return includeDeprecated\n            ? values\n            : values.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    ofType: {\n      type: __Type,\n      resolve: (type) => ('ofType' in type ? type.ofType : undefined),\n    },\n    isOneOf: {\n      type: GraphQLBoolean,\n      resolve: (type) => {\n        if (isInputObjectType(type)) {\n          return type.isOneOf;\n        }\n      },\n    },\n  }),\n});\nexport const __Field = new GraphQLObjectType({\n  name: '__Field',\n  description:\n    'Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (field) => field.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (field) => field.description,\n    },\n    args: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__InputValue)),\n      ),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(field, { includeDeprecated }) {\n        return includeDeprecated\n          ? field.args\n          : field.args.filter((arg) => arg.deprecationReason == null);\n      },\n    },\n    type: {\n      type: new GraphQLNonNull(__Type),\n      resolve: (field) => field.type,\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (field) => field.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (field) => field.deprecationReason,\n    },\n  }),\n});\nexport const __InputValue = new GraphQLObjectType({\n  name: '__InputValue',\n  description:\n    'Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (inputValue) => inputValue.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (inputValue) => inputValue.description,\n    },\n    type: {\n      type: new GraphQLNonNull(__Type),\n      resolve: (inputValue) => inputValue.type,\n    },\n    defaultValue: {\n      type: GraphQLString,\n      description:\n        'A GraphQL-formatted string representing the default value for this input value.',\n\n      resolve(inputValue) {\n        const { type, defaultValue } = inputValue;\n        const valueAST = astFromValue(defaultValue, type);\n        return valueAST ? print(valueAST) : null;\n      },\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (field) => field.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (obj) => obj.deprecationReason,\n    },\n  }),\n});\nexport const __EnumValue = new GraphQLObjectType({\n  name: '__EnumValue',\n  description:\n    'One possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (enumValue) => enumValue.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (enumValue) => enumValue.description,\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (enumValue) => enumValue.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (enumValue) => enumValue.deprecationReason,\n    },\n  }),\n});\nvar TypeKind;\n\n(function (TypeKind) {\n  TypeKind['SCALAR'] = 'SCALAR';\n  TypeKind['OBJECT'] = 'OBJECT';\n  TypeKind['INTERFACE'] = 'INTERFACE';\n  TypeKind['UNION'] = 'UNION';\n  TypeKind['ENUM'] = 'ENUM';\n  TypeKind['INPUT_OBJECT'] = 'INPUT_OBJECT';\n  TypeKind['LIST'] = 'LIST';\n  TypeKind['NON_NULL'] = 'NON_NULL';\n})(TypeKind || (TypeKind = {}));\n\nexport { TypeKind };\nexport const __TypeKind = new GraphQLEnumType({\n  name: '__TypeKind',\n  description: 'An enum describing what kind of type a given `__Type` is.',\n  values: {\n    SCALAR: {\n      value: TypeKind.SCALAR,\n      description: 'Indicates this type is a scalar.',\n    },\n    OBJECT: {\n      value: TypeKind.OBJECT,\n      description:\n        'Indicates this type is an object. `fields` and `interfaces` are valid fields.',\n    },\n    INTERFACE: {\n      value: TypeKind.INTERFACE,\n      description:\n        'Indicates this type is an interface. `fields`, `interfaces`, and `possibleTypes` are valid fields.',\n    },\n    UNION: {\n      value: TypeKind.UNION,\n      description:\n        'Indicates this type is a union. `possibleTypes` is a valid field.',\n    },\n    ENUM: {\n      value: TypeKind.ENUM,\n      description:\n        'Indicates this type is an enum. `enumValues` is a valid field.',\n    },\n    INPUT_OBJECT: {\n      value: TypeKind.INPUT_OBJECT,\n      description:\n        'Indicates this type is an input object. `inputFields` is a valid field.',\n    },\n    LIST: {\n      value: TypeKind.LIST,\n      description: 'Indicates this type is a list. `ofType` is a valid field.',\n    },\n    NON_NULL: {\n      value: TypeKind.NON_NULL,\n      description:\n        'Indicates this type is a non-null. `ofType` is a valid field.',\n    },\n  },\n});\n/**\n * Note that these are GraphQLField and not GraphQLFieldConfig,\n * so the format for args is different.\n */\n\nexport const SchemaMetaFieldDef = {\n  name: '__schema',\n  type: new GraphQLNonNull(__Schema),\n  description: 'Access the current type schema of this server.',\n  args: [],\n  resolve: (_source, _args, _context, { schema }) => schema,\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const TypeMetaFieldDef = {\n  name: '__type',\n  type: __Type,\n  description: 'Request the type information of a single type.',\n  args: [\n    {\n      name: 'name',\n      description: undefined,\n      type: new GraphQLNonNull(GraphQLString),\n      defaultValue: undefined,\n      deprecationReason: undefined,\n      extensions: Object.create(null),\n      astNode: undefined,\n    },\n  ],\n  resolve: (_source, { name }, _context, { schema }) => schema.getType(name),\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const TypeNameMetaFieldDef = {\n  name: '__typename',\n  type: new GraphQLNonNull(GraphQLString),\n  description: 'The name of the current Object type at runtime.',\n  args: [],\n  resolve: (_source, _args, _context, { parentType }) => parentType.name,\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const introspectionTypes = Object.freeze([\n  __Schema,\n  __Directive,\n  __DirectiveLocation,\n  __Type,\n  __Field,\n  __InputValue,\n  __EnumValue,\n  __TypeKind,\n]);\nexport function isIntrospectionType(type) {\n  return introspectionTypes.some(({ name }) => type.name === name);\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { OperationTypeNode } from '../language/ast.mjs';\nimport {\n  getNamedType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isUnionType,\n} from './definition.mjs';\nimport { isDirective, specifiedDirectives } from './directives.mjs';\nimport { __Schema } from './introspection.mjs';\n/**\n * Test if the given value is a GraphQL schema.\n */\n\nexport function isSchema(schema) {\n  return instanceOf(schema, GraphQLSchema);\n}\nexport function assertSchema(schema) {\n  if (!isSchema(schema)) {\n    throw new Error(`Expected ${inspect(schema)} to be a GraphQL schema.`);\n  }\n\n  return schema;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Schema Definition\n *\n * A Schema is created by supplying the root types of each type of operation,\n * query and mutation (optional). A schema definition is then supplied to the\n * validator and executor.\n *\n * Example:\n *\n * ```ts\n * const MyAppSchema = new GraphQLSchema({\n *   query: MyAppQueryRootType,\n *   mutation: MyAppMutationRootType,\n * })\n * ```\n *\n * Note: When the schema is constructed, by default only the types that are\n * reachable by traversing the root types are included, other types must be\n * explicitly referenced.\n *\n * Example:\n *\n * ```ts\n * const characterInterface = new GraphQLInterfaceType({\n *   name: 'Character',\n *   ...\n * });\n *\n * const humanType = new GraphQLObjectType({\n *   name: 'Human',\n *   interfaces: [characterInterface],\n *   ...\n * });\n *\n * const droidType = new GraphQLObjectType({\n *   name: 'Droid',\n *   interfaces: [characterInterface],\n *   ...\n * });\n *\n * const schema = new GraphQLSchema({\n *   query: new GraphQLObjectType({\n *     name: 'Query',\n *     fields: {\n *       hero: { type: characterInterface, ... },\n *     }\n *   }),\n *   ...\n *   // Since this schema references only the `Character` interface it's\n *   // necessary to explicitly list the types that implement it if\n *   // you want them to be included in the final schema.\n *   types: [humanType, droidType],\n * })\n * ```\n *\n * Note: If an array of `directives` are provided to GraphQLSchema, that will be\n * the exact list of directives represented and allowed. If `directives` is not\n * provided then a default set of the specified directives (e.g. `@include` and\n * `@skip`) will be used. If you wish to provide *additional* directives to these\n * specified directives, you must explicitly declare them. Example:\n *\n * ```ts\n * const MyAppSchema = new GraphQLSchema({\n *   ...\n *   directives: specifiedDirectives.concat([ myCustomDirective ]),\n * })\n * ```\n */\nexport class GraphQLSchema {\n  // Used as a cache for validateSchema().\n  constructor(config) {\n    var _config$extensionASTN, _config$directives;\n\n    // If this schema was built from a source known to be valid, then it may be\n    // marked with assumeValid to avoid an additional type system validation.\n    this.__validationErrors = config.assumeValid === true ? [] : undefined; // Check for common mistakes during construction to produce early errors.\n\n    isObjectLike(config) ||\n      devAssert(false, 'Must provide configuration object.');\n    !config.types ||\n      Array.isArray(config.types) ||\n      devAssert(\n        false,\n        `\"types\" must be Array if provided but got: ${inspect(config.types)}.`,\n      );\n    !config.directives ||\n      Array.isArray(config.directives) ||\n      devAssert(\n        false,\n        '\"directives\" must be Array if provided but got: ' +\n          `${inspect(config.directives)}.`,\n      );\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN = config.extensionASTNodes) !== null &&\n      _config$extensionASTN !== void 0\n        ? _config$extensionASTN\n        : [];\n    this._queryType = config.query;\n    this._mutationType = config.mutation;\n    this._subscriptionType = config.subscription; // Provide specified directives (e.g. @include and @skip) by default.\n\n    this._directives =\n      (_config$directives = config.directives) !== null &&\n      _config$directives !== void 0\n        ? _config$directives\n        : specifiedDirectives; // To preserve order of user-provided types, we add first to add them to\n    // the set of \"collected\" types, so `collectReferencedTypes` ignore them.\n\n    const allReferencedTypes = new Set(config.types);\n\n    if (config.types != null) {\n      for (const type of config.types) {\n        // When we ready to process this type, we remove it from \"collected\" types\n        // and then add it together with all dependent types in the correct position.\n        allReferencedTypes.delete(type);\n        collectReferencedTypes(type, allReferencedTypes);\n      }\n    }\n\n    if (this._queryType != null) {\n      collectReferencedTypes(this._queryType, allReferencedTypes);\n    }\n\n    if (this._mutationType != null) {\n      collectReferencedTypes(this._mutationType, allReferencedTypes);\n    }\n\n    if (this._subscriptionType != null) {\n      collectReferencedTypes(this._subscriptionType, allReferencedTypes);\n    }\n\n    for (const directive of this._directives) {\n      // Directives are not validated until validateSchema() is called.\n      if (isDirective(directive)) {\n        for (const arg of directive.args) {\n          collectReferencedTypes(arg.type, allReferencedTypes);\n        }\n      }\n    }\n\n    collectReferencedTypes(__Schema, allReferencedTypes); // Storing the resulting map for reference by the schema.\n\n    this._typeMap = Object.create(null);\n    this._subTypeMap = Object.create(null); // Keep track of all implementations by interface name.\n\n    this._implementationsMap = Object.create(null);\n\n    for (const namedType of allReferencedTypes) {\n      if (namedType == null) {\n        continue;\n      }\n\n      const typeName = namedType.name;\n      typeName ||\n        devAssert(\n          false,\n          'One of the provided types for building the Schema is missing a name.',\n        );\n\n      if (this._typeMap[typeName] !== undefined) {\n        throw new Error(\n          `Schema must contain uniquely named types but contains multiple types named \"${typeName}\".`,\n        );\n      }\n\n      this._typeMap[typeName] = namedType;\n\n      if (isInterfaceType(namedType)) {\n        // Store implementations by interface.\n        for (const iface of namedType.getInterfaces()) {\n          if (isInterfaceType(iface)) {\n            let implementations = this._implementationsMap[iface.name];\n\n            if (implementations === undefined) {\n              implementations = this._implementationsMap[iface.name] = {\n                objects: [],\n                interfaces: [],\n              };\n            }\n\n            implementations.interfaces.push(namedType);\n          }\n        }\n      } else if (isObjectType(namedType)) {\n        // Store implementations by objects.\n        for (const iface of namedType.getInterfaces()) {\n          if (isInterfaceType(iface)) {\n            let implementations = this._implementationsMap[iface.name];\n\n            if (implementations === undefined) {\n              implementations = this._implementationsMap[iface.name] = {\n                objects: [],\n                interfaces: [],\n              };\n            }\n\n            implementations.objects.push(namedType);\n          }\n        }\n      }\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLSchema';\n  }\n\n  getQueryType() {\n    return this._queryType;\n  }\n\n  getMutationType() {\n    return this._mutationType;\n  }\n\n  getSubscriptionType() {\n    return this._subscriptionType;\n  }\n\n  getRootType(operation) {\n    switch (operation) {\n      case OperationTypeNode.QUERY:\n        return this.getQueryType();\n\n      case OperationTypeNode.MUTATION:\n        return this.getMutationType();\n\n      case OperationTypeNode.SUBSCRIPTION:\n        return this.getSubscriptionType();\n    }\n  }\n\n  getTypeMap() {\n    return this._typeMap;\n  }\n\n  getType(name) {\n    return this.getTypeMap()[name];\n  }\n\n  getPossibleTypes(abstractType) {\n    return isUnionType(abstractType)\n      ? abstractType.getTypes()\n      : this.getImplementations(abstractType).objects;\n  }\n\n  getImplementations(interfaceType) {\n    const implementations = this._implementationsMap[interfaceType.name];\n    return implementations !== null && implementations !== void 0\n      ? implementations\n      : {\n          objects: [],\n          interfaces: [],\n        };\n  }\n\n  isSubType(abstractType, maybeSubType) {\n    let map = this._subTypeMap[abstractType.name];\n\n    if (map === undefined) {\n      map = Object.create(null);\n\n      if (isUnionType(abstractType)) {\n        for (const type of abstractType.getTypes()) {\n          map[type.name] = true;\n        }\n      } else {\n        const implementations = this.getImplementations(abstractType);\n\n        for (const type of implementations.objects) {\n          map[type.name] = true;\n        }\n\n        for (const type of implementations.interfaces) {\n          map[type.name] = true;\n        }\n      }\n\n      this._subTypeMap[abstractType.name] = map;\n    }\n\n    return map[maybeSubType.name] !== undefined;\n  }\n\n  getDirectives() {\n    return this._directives;\n  }\n\n  getDirective(name) {\n    return this.getDirectives().find((directive) => directive.name === name);\n  }\n\n  toConfig() {\n    return {\n      description: this.description,\n      query: this.getQueryType(),\n      mutation: this.getMutationType(),\n      subscription: this.getSubscriptionType(),\n      types: Object.values(this.getTypeMap()),\n      directives: this.getDirectives(),\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n      assumeValid: this.__validationErrors !== undefined,\n    };\n  }\n}\n\nfunction collectReferencedTypes(type, typeSet) {\n  const namedType = getNamedType(type);\n\n  if (!typeSet.has(namedType)) {\n    typeSet.add(namedType);\n\n    if (isUnionType(namedType)) {\n      for (const memberType of namedType.getTypes()) {\n        collectReferencedTypes(memberType, typeSet);\n      }\n    } else if (isObjectType(namedType) || isInterfaceType(namedType)) {\n      for (const interfaceType of namedType.getInterfaces()) {\n        collectReferencedTypes(interfaceType, typeSet);\n      }\n\n      for (const field of Object.values(namedType.getFields())) {\n        collectReferencedTypes(field.type, typeSet);\n\n        for (const arg of field.args) {\n          collectReferencedTypes(arg.type, typeSet);\n        }\n      }\n    } else if (isInputObjectType(namedType)) {\n      for (const field of Object.values(namedType.getFields())) {\n        collectReferencedTypes(field.type, typeSet);\n      }\n    }\n  }\n\n  return typeSet;\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { OperationTypeNode } from '../language/ast.mjs';\nimport { isEqualType, isTypeSubTypeOf } from '../utilities/typeComparators.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInputType,\n  isInterfaceType,\n  isNamedType,\n  isNonNullType,\n  isObjectType,\n  isOutputType,\n  isRequiredArgument,\n  isRequiredInputField,\n  isUnionType,\n} from './definition.mjs';\nimport { GraphQLDeprecatedDirective, isDirective } from './directives.mjs';\nimport { isIntrospectionType } from './introspection.mjs';\nimport { assertSchema } from './schema.mjs';\n/**\n * Implements the \"Type Validation\" sub-sections of the specification's\n * \"Type System\" section.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the Schema is valid.\n */\n\nexport function validateSchema(schema) {\n  // First check to ensure the provided value is in fact a GraphQLSchema.\n  assertSchema(schema); // If this Schema has already been validated, return the previous results.\n\n  if (schema.__validationErrors) {\n    return schema.__validationErrors;\n  } // Validate the schema, producing a list of errors.\n\n  const context = new SchemaValidationContext(schema);\n  validateRootTypes(context);\n  validateDirectives(context);\n  validateTypes(context); // Persist the results of validation before returning to ensure validation\n  // does not run multiple times for this schema.\n\n  const errors = context.getErrors();\n  schema.__validationErrors = errors;\n  return errors;\n}\n/**\n * Utility function which asserts a schema is valid by throwing an error if\n * it is invalid.\n */\n\nexport function assertValidSchema(schema) {\n  const errors = validateSchema(schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n\nclass SchemaValidationContext {\n  constructor(schema) {\n    this._errors = [];\n    this.schema = schema;\n  }\n\n  reportError(message, nodes) {\n    const _nodes = Array.isArray(nodes) ? nodes.filter(Boolean) : nodes;\n\n    this._errors.push(\n      new GraphQLError(message, {\n        nodes: _nodes,\n      }),\n    );\n  }\n\n  getErrors() {\n    return this._errors;\n  }\n}\n\nfunction validateRootTypes(context) {\n  const schema = context.schema;\n  const queryType = schema.getQueryType();\n\n  if (!queryType) {\n    context.reportError('Query root type must be provided.', schema.astNode);\n  } else if (!isObjectType(queryType)) {\n    var _getOperationTypeNode;\n\n    context.reportError(\n      `Query root type must be Object type, it cannot be ${inspect(\n        queryType,\n      )}.`,\n      (_getOperationTypeNode = getOperationTypeNode(\n        schema,\n        OperationTypeNode.QUERY,\n      )) !== null && _getOperationTypeNode !== void 0\n        ? _getOperationTypeNode\n        : queryType.astNode,\n    );\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType && !isObjectType(mutationType)) {\n    var _getOperationTypeNode2;\n\n    context.reportError(\n      'Mutation root type must be Object type if provided, it cannot be ' +\n        `${inspect(mutationType)}.`,\n      (_getOperationTypeNode2 = getOperationTypeNode(\n        schema,\n        OperationTypeNode.MUTATION,\n      )) !== null && _getOperationTypeNode2 !== void 0\n        ? _getOperationTypeNode2\n        : mutationType.astNode,\n    );\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && !isObjectType(subscriptionType)) {\n    var _getOperationTypeNode3;\n\n    context.reportError(\n      'Subscription root type must be Object type if provided, it cannot be ' +\n        `${inspect(subscriptionType)}.`,\n      (_getOperationTypeNode3 = getOperationTypeNode(\n        schema,\n        OperationTypeNode.SUBSCRIPTION,\n      )) !== null && _getOperationTypeNode3 !== void 0\n        ? _getOperationTypeNode3\n        : subscriptionType.astNode,\n    );\n  }\n}\n\nfunction getOperationTypeNode(schema, operation) {\n  var _flatMap$find;\n\n  return (_flatMap$find = [schema.astNode, ...schema.extensionASTNodes]\n    .flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (schemaNode) => {\n        var _schemaNode$operation;\n\n        return (\n          /* c8 ignore next */\n          (_schemaNode$operation =\n            schemaNode === null || schemaNode === void 0\n              ? void 0\n              : schemaNode.operationTypes) !== null &&\n            _schemaNode$operation !== void 0\n            ? _schemaNode$operation\n            : []\n        );\n      },\n    )\n    .find((operationNode) => operationNode.operation === operation)) === null ||\n    _flatMap$find === void 0\n    ? void 0\n    : _flatMap$find.type;\n}\n\nfunction validateDirectives(context) {\n  for (const directive of context.schema.getDirectives()) {\n    // Ensure all directives are in fact GraphQL directives.\n    if (!isDirective(directive)) {\n      context.reportError(\n        `Expected directive but got: ${inspect(directive)}.`,\n        directive === null || directive === void 0 ? void 0 : directive.astNode,\n      );\n      continue;\n    } // Ensure they are named correctly.\n\n    validateName(context, directive);\n\n    if (directive.locations.length === 0) {\n      context.reportError(\n        `Directive @${directive.name} must include 1 or more locations.`,\n        directive.astNode,\n      );\n    } // Ensure the arguments are valid.\n\n    for (const arg of directive.args) {\n      // Ensure they are named correctly.\n      validateName(context, arg); // Ensure the type is an input type.\n\n      if (!isInputType(arg.type)) {\n        context.reportError(\n          `The type of @${directive.name}(${arg.name}:) must be Input Type ` +\n            `but got: ${inspect(arg.type)}.`,\n          arg.astNode,\n        );\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode;\n\n        context.reportError(\n          `Required argument @${directive.name}(${arg.name}:) cannot be deprecated.`,\n          [\n            getDeprecatedDirectiveNode(arg.astNode),\n            (_arg$astNode = arg.astNode) === null || _arg$astNode === void 0\n              ? void 0\n              : _arg$astNode.type,\n          ],\n        );\n      }\n    }\n  }\n}\n\nfunction validateName(context, node) {\n  // Ensure names are valid, however introspection types opt out.\n  if (node.name.startsWith('__')) {\n    context.reportError(\n      `Name \"${node.name}\" must not begin with \"__\", which is reserved by GraphQL introspection.`,\n      node.astNode,\n    );\n  }\n}\n\nfunction validateTypes(context) {\n  const validateInputObjectCircularRefs =\n    createInputObjectCircularRefsValidator(context);\n  const typeMap = context.schema.getTypeMap();\n\n  for (const type of Object.values(typeMap)) {\n    // Ensure all provided types are in fact GraphQL type.\n    if (!isNamedType(type)) {\n      context.reportError(\n        `Expected GraphQL named type but got: ${inspect(type)}.`,\n        type.astNode,\n      );\n      continue;\n    } // Ensure it is named correctly (excluding introspection types).\n\n    if (!isIntrospectionType(type)) {\n      validateName(context, type);\n    }\n\n    if (isObjectType(type)) {\n      // Ensure fields are valid\n      validateFields(context, type); // Ensure objects implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isInterfaceType(type)) {\n      // Ensure fields are valid.\n      validateFields(context, type); // Ensure interfaces implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isUnionType(type)) {\n      // Ensure Unions include valid member types.\n      validateUnionMembers(context, type);\n    } else if (isEnumType(type)) {\n      // Ensure Enums have valid values.\n      validateEnumValues(context, type);\n    } else if (isInputObjectType(type)) {\n      // Ensure Input Object fields are valid.\n      validateInputFields(context, type); // Ensure Input Objects do not contain non-nullable circular references\n\n      validateInputObjectCircularRefs(type);\n    }\n  }\n}\n\nfunction validateFields(context, type) {\n  const fields = Object.values(type.getFields()); // Objects and Interfaces both must define one or more fields.\n\n  if (fields.length === 0) {\n    context.reportError(`Type ${type.name} must define one or more fields.`, [\n      type.astNode,\n      ...type.extensionASTNodes,\n    ]);\n  }\n\n  for (const field of fields) {\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an output type\n\n    if (!isOutputType(field.type)) {\n      var _field$astNode;\n\n      context.reportError(\n        `The type of ${type.name}.${field.name} must be Output Type ` +\n          `but got: ${inspect(field.type)}.`,\n        (_field$astNode = field.astNode) === null || _field$astNode === void 0\n          ? void 0\n          : _field$astNode.type,\n      );\n    } // Ensure the arguments are valid\n\n    for (const arg of field.args) {\n      const argName = arg.name; // Ensure they are named correctly.\n\n      validateName(context, arg); // Ensure the type is an input type\n\n      if (!isInputType(arg.type)) {\n        var _arg$astNode2;\n\n        context.reportError(\n          `The type of ${type.name}.${field.name}(${argName}:) must be Input ` +\n            `Type but got: ${inspect(arg.type)}.`,\n          (_arg$astNode2 = arg.astNode) === null || _arg$astNode2 === void 0\n            ? void 0\n            : _arg$astNode2.type,\n        );\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode3;\n\n        context.reportError(\n          `Required argument ${type.name}.${field.name}(${argName}:) cannot be deprecated.`,\n          [\n            getDeprecatedDirectiveNode(arg.astNode),\n            (_arg$astNode3 = arg.astNode) === null || _arg$astNode3 === void 0\n              ? void 0\n              : _arg$astNode3.type,\n          ],\n        );\n      }\n    }\n  }\n}\n\nfunction validateInterfaces(context, type) {\n  const ifaceTypeNames = Object.create(null);\n\n  for (const iface of type.getInterfaces()) {\n    if (!isInterfaceType(iface)) {\n      context.reportError(\n        `Type ${inspect(type)} must only implement Interface types, ` +\n          `it cannot implement ${inspect(iface)}.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    if (type === iface) {\n      context.reportError(\n        `Type ${type.name} cannot implement itself because it would create a circular reference.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    if (ifaceTypeNames[iface.name]) {\n      context.reportError(\n        `Type ${type.name} can only implement ${iface.name} once.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    ifaceTypeNames[iface.name] = true;\n    validateTypeImplementsAncestors(context, type, iface);\n    validateTypeImplementsInterface(context, type, iface);\n  }\n}\n\nfunction validateTypeImplementsInterface(context, type, iface) {\n  const typeFieldMap = type.getFields(); // Assert each interface field is implemented.\n\n  for (const ifaceField of Object.values(iface.getFields())) {\n    const fieldName = ifaceField.name;\n    const typeField = typeFieldMap[fieldName]; // Assert interface field exists on type.\n\n    if (!typeField) {\n      context.reportError(\n        `Interface field ${iface.name}.${fieldName} expected but ${type.name} does not provide it.`,\n        [ifaceField.astNode, type.astNode, ...type.extensionASTNodes],\n      );\n      continue;\n    } // Assert interface field type is satisfied by type field type, by being\n    // a valid subtype. (covariant)\n\n    if (!isTypeSubTypeOf(context.schema, typeField.type, ifaceField.type)) {\n      var _ifaceField$astNode, _typeField$astNode;\n\n      context.reportError(\n        `Interface field ${iface.name}.${fieldName} expects type ` +\n          `${inspect(ifaceField.type)} but ${type.name}.${fieldName} ` +\n          `is type ${inspect(typeField.type)}.`,\n        [\n          (_ifaceField$astNode = ifaceField.astNode) === null ||\n          _ifaceField$astNode === void 0\n            ? void 0\n            : _ifaceField$astNode.type,\n          (_typeField$astNode = typeField.astNode) === null ||\n          _typeField$astNode === void 0\n            ? void 0\n            : _typeField$astNode.type,\n        ],\n      );\n    } // Assert each interface field arg is implemented.\n\n    for (const ifaceArg of ifaceField.args) {\n      const argName = ifaceArg.name;\n      const typeArg = typeField.args.find((arg) => arg.name === argName); // Assert interface field arg exists on object field.\n\n      if (!typeArg) {\n        context.reportError(\n          `Interface field argument ${iface.name}.${fieldName}(${argName}:) expected but ${type.name}.${fieldName} does not provide it.`,\n          [ifaceArg.astNode, typeField.astNode],\n        );\n        continue;\n      } // Assert interface field arg type matches object field arg type.\n      // (invariant)\n      // TODO: change to contravariant?\n\n      if (!isEqualType(ifaceArg.type, typeArg.type)) {\n        var _ifaceArg$astNode, _typeArg$astNode;\n\n        context.reportError(\n          `Interface field argument ${iface.name}.${fieldName}(${argName}:) ` +\n            `expects type ${inspect(ifaceArg.type)} but ` +\n            `${type.name}.${fieldName}(${argName}:) is type ` +\n            `${inspect(typeArg.type)}.`,\n          [\n            (_ifaceArg$astNode = ifaceArg.astNode) === null ||\n            _ifaceArg$astNode === void 0\n              ? void 0\n              : _ifaceArg$astNode.type,\n            (_typeArg$astNode = typeArg.astNode) === null ||\n            _typeArg$astNode === void 0\n              ? void 0\n              : _typeArg$astNode.type,\n          ],\n        );\n      } // TODO: validate default values?\n    } // Assert additional arguments must not be required.\n\n    for (const typeArg of typeField.args) {\n      const argName = typeArg.name;\n      const ifaceArg = ifaceField.args.find((arg) => arg.name === argName);\n\n      if (!ifaceArg && isRequiredArgument(typeArg)) {\n        context.reportError(\n          `Object field ${type.name}.${fieldName} includes required argument ${argName} that is missing from the Interface field ${iface.name}.${fieldName}.`,\n          [typeArg.astNode, ifaceField.astNode],\n        );\n      }\n    }\n  }\n}\n\nfunction validateTypeImplementsAncestors(context, type, iface) {\n  const ifaceInterfaces = type.getInterfaces();\n\n  for (const transitive of iface.getInterfaces()) {\n    if (!ifaceInterfaces.includes(transitive)) {\n      context.reportError(\n        transitive === type\n          ? `Type ${type.name} cannot implement ${iface.name} because it would create a circular reference.`\n          : `Type ${type.name} must implement ${transitive.name} because it is implemented by ${iface.name}.`,\n        [\n          ...getAllImplementsInterfaceNodes(iface, transitive),\n          ...getAllImplementsInterfaceNodes(type, iface),\n        ],\n      );\n    }\n  }\n}\n\nfunction validateUnionMembers(context, union) {\n  const memberTypes = union.getTypes();\n\n  if (memberTypes.length === 0) {\n    context.reportError(\n      `Union type ${union.name} must define one or more member types.`,\n      [union.astNode, ...union.extensionASTNodes],\n    );\n  }\n\n  const includedTypeNames = Object.create(null);\n\n  for (const memberType of memberTypes) {\n    if (includedTypeNames[memberType.name]) {\n      context.reportError(\n        `Union type ${union.name} can only include type ${memberType.name} once.`,\n        getUnionMemberTypeNodes(union, memberType.name),\n      );\n      continue;\n    }\n\n    includedTypeNames[memberType.name] = true;\n\n    if (!isObjectType(memberType)) {\n      context.reportError(\n        `Union type ${union.name} can only include Object types, ` +\n          `it cannot include ${inspect(memberType)}.`,\n        getUnionMemberTypeNodes(union, String(memberType)),\n      );\n    }\n  }\n}\n\nfunction validateEnumValues(context, enumType) {\n  const enumValues = enumType.getValues();\n\n  if (enumValues.length === 0) {\n    context.reportError(\n      `Enum type ${enumType.name} must define one or more values.`,\n      [enumType.astNode, ...enumType.extensionASTNodes],\n    );\n  }\n\n  for (const enumValue of enumValues) {\n    // Ensure valid name.\n    validateName(context, enumValue);\n  }\n}\n\nfunction validateInputFields(context, inputObj) {\n  const fields = Object.values(inputObj.getFields());\n\n  if (fields.length === 0) {\n    context.reportError(\n      `Input Object type ${inputObj.name} must define one or more fields.`,\n      [inputObj.astNode, ...inputObj.extensionASTNodes],\n    );\n  } // Ensure the arguments are valid\n\n  for (const field of fields) {\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an input type\n\n    if (!isInputType(field.type)) {\n      var _field$astNode2;\n\n      context.reportError(\n        `The type of ${inputObj.name}.${field.name} must be Input Type ` +\n          `but got: ${inspect(field.type)}.`,\n        (_field$astNode2 = field.astNode) === null || _field$astNode2 === void 0\n          ? void 0\n          : _field$astNode2.type,\n      );\n    }\n\n    if (isRequiredInputField(field) && field.deprecationReason != null) {\n      var _field$astNode3;\n\n      context.reportError(\n        `Required input field ${inputObj.name}.${field.name} cannot be deprecated.`,\n        [\n          getDeprecatedDirectiveNode(field.astNode),\n          (_field$astNode3 = field.astNode) === null ||\n          _field$astNode3 === void 0\n            ? void 0\n            : _field$astNode3.type,\n        ],\n      );\n    }\n\n    if (inputObj.isOneOf) {\n      validateOneOfInputObjectField(inputObj, field, context);\n    }\n  }\n}\n\nfunction validateOneOfInputObjectField(type, field, context) {\n  if (isNonNullType(field.type)) {\n    var _field$astNode4;\n\n    context.reportError(\n      `OneOf input field ${type.name}.${field.name} must be nullable.`,\n      (_field$astNode4 = field.astNode) === null || _field$astNode4 === void 0\n        ? void 0\n        : _field$astNode4.type,\n    );\n  }\n\n  if (field.defaultValue !== undefined) {\n    context.reportError(\n      `OneOf input field ${type.name}.${field.name} cannot have a default value.`,\n      field.astNode,\n    );\n  }\n}\n\nfunction createInputObjectCircularRefsValidator(context) {\n  // Modified copy of algorithm from 'src/validation/rules/NoFragmentCycles.js'.\n  // Tracks already visited types to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  const visitedTypes = Object.create(null); // Array of types nodes used to produce meaningful errors\n\n  const fieldPath = []; // Position in the type path\n\n  const fieldPathIndexByTypeName = Object.create(null);\n  return detectCycleRecursive; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(inputObj) {\n    if (visitedTypes[inputObj.name]) {\n      return;\n    }\n\n    visitedTypes[inputObj.name] = true;\n    fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n    const fields = Object.values(inputObj.getFields());\n\n    for (const field of fields) {\n      if (isNonNullType(field.type) && isInputObjectType(field.type.ofType)) {\n        const fieldType = field.type.ofType;\n        const cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n        fieldPath.push(field);\n\n        if (cycleIndex === undefined) {\n          detectCycleRecursive(fieldType);\n        } else {\n          const cyclePath = fieldPath.slice(cycleIndex);\n          const pathStr = cyclePath.map((fieldObj) => fieldObj.name).join('.');\n          context.reportError(\n            `Cannot reference Input Object \"${fieldType.name}\" within itself through a series of non-null fields: \"${pathStr}\".`,\n            cyclePath.map((fieldObj) => fieldObj.astNode),\n          );\n        }\n\n        fieldPath.pop();\n      }\n    }\n\n    fieldPathIndexByTypeName[inputObj.name] = undefined;\n  }\n}\n\nfunction getAllImplementsInterfaceNodes(type, iface) {\n  const { astNode, extensionASTNodes } = type;\n  const nodes =\n    astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  return nodes\n    .flatMap((typeNode) => {\n      var _typeNode$interfaces;\n\n      return (\n        /* c8 ignore next */\n        (_typeNode$interfaces = typeNode.interfaces) !== null &&\n          _typeNode$interfaces !== void 0\n          ? _typeNode$interfaces\n          : []\n      );\n    })\n    .filter((ifaceNode) => ifaceNode.name.value === iface.name);\n}\n\nfunction getUnionMemberTypeNodes(union, typeName) {\n  const { astNode, extensionASTNodes } = union;\n  const nodes =\n    astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  return nodes\n    .flatMap((unionNode) => {\n      var _unionNode$types;\n\n      return (\n        /* c8 ignore next */\n        (_unionNode$types = unionNode.types) !== null &&\n          _unionNode$types !== void 0\n          ? _unionNode$types\n          : []\n      );\n    })\n    .filter((typeNode) => typeNode.name.value === typeName);\n}\n\nfunction getDeprecatedDirectiveNode(definitionNode) {\n  var _definitionNode$direc;\n\n  return definitionNode === null || definitionNode === void 0\n    ? void 0\n    : (_definitionNode$direc = definitionNode.directives) === null ||\n      _definitionNode$direc === void 0\n    ? void 0\n    : _definitionNode$direc.find(\n        (node) => node.name.value === GraphQLDeprecatedDirective.name,\n      );\n}\n","import { Kind } from '../language/kinds.mjs';\nimport { GraphQLList, GraphQLNonNull } from '../type/definition.mjs';\nexport function typeFromAST(schema, typeNode) {\n  switch (typeNode.kind) {\n    case Kind.LIST_TYPE: {\n      const innerType = typeFromAST(schema, typeNode.type);\n      return innerType && new GraphQLList(innerType);\n    }\n\n    case Kind.NON_NULL_TYPE: {\n      const innerType = typeFromAST(schema, typeNode.type);\n      return innerType && new GraphQLNonNull(innerType);\n    }\n\n    case Kind.NAMED_TYPE:\n      return schema.getType(typeNode.name.value);\n  }\n}\n","import { isNode } from '../language/ast.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { getEnterLeaveForKind } from '../language/visitor.mjs';\nimport {\n  getNamedType,\n  getNullableType,\n  isCompositeType,\n  isEnumType,\n  isInputObjectType,\n  isInputType,\n  isInterfaceType,\n  isListType,\n  isObjectType,\n  isOutputType,\n} from '../type/definition.mjs';\nimport {\n  SchemaMetaFieldDef,\n  TypeMetaFieldDef,\n  TypeNameMetaFieldDef,\n} from '../type/introspection.mjs';\nimport { typeFromAST } from './typeFromAST.mjs';\n/**\n * TypeInfo is a utility class which, given a GraphQL schema, can keep track\n * of the current field and type definitions at any point in a GraphQL document\n * AST during a recursive descent by calling `enter(node)` and `leave(node)`.\n */\n\nexport class TypeInfo {\n  constructor(\n    schema,\n    /**\n     * Initial type may be provided in rare cases to facilitate traversals\n     *  beginning somewhere other than documents.\n     */\n    initialType,\n    /** @deprecated will be removed in 17.0.0 */\n    getFieldDefFn,\n  ) {\n    this._schema = schema;\n    this._typeStack = [];\n    this._parentTypeStack = [];\n    this._inputTypeStack = [];\n    this._fieldDefStack = [];\n    this._defaultValueStack = [];\n    this._directive = null;\n    this._argument = null;\n    this._enumValue = null;\n    this._getFieldDef =\n      getFieldDefFn !== null && getFieldDefFn !== void 0\n        ? getFieldDefFn\n        : getFieldDef;\n\n    if (initialType) {\n      if (isInputType(initialType)) {\n        this._inputTypeStack.push(initialType);\n      }\n\n      if (isCompositeType(initialType)) {\n        this._parentTypeStack.push(initialType);\n      }\n\n      if (isOutputType(initialType)) {\n        this._typeStack.push(initialType);\n      }\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'TypeInfo';\n  }\n\n  getType() {\n    if (this._typeStack.length > 0) {\n      return this._typeStack[this._typeStack.length - 1];\n    }\n  }\n\n  getParentType() {\n    if (this._parentTypeStack.length > 0) {\n      return this._parentTypeStack[this._parentTypeStack.length - 1];\n    }\n  }\n\n  getInputType() {\n    if (this._inputTypeStack.length > 0) {\n      return this._inputTypeStack[this._inputTypeStack.length - 1];\n    }\n  }\n\n  getParentInputType() {\n    if (this._inputTypeStack.length > 1) {\n      return this._inputTypeStack[this._inputTypeStack.length - 2];\n    }\n  }\n\n  getFieldDef() {\n    if (this._fieldDefStack.length > 0) {\n      return this._fieldDefStack[this._fieldDefStack.length - 1];\n    }\n  }\n\n  getDefaultValue() {\n    if (this._defaultValueStack.length > 0) {\n      return this._defaultValueStack[this._defaultValueStack.length - 1];\n    }\n  }\n\n  getDirective() {\n    return this._directive;\n  }\n\n  getArgument() {\n    return this._argument;\n  }\n\n  getEnumValue() {\n    return this._enumValue;\n  }\n\n  enter(node) {\n    const schema = this._schema; // Note: many of the types below are explicitly typed as \"unknown\" to drop\n    // any assumptions of a valid schema to ensure runtime types are properly\n    // checked before continuing since TypeInfo is used as part of validation\n    // which occurs before guarantees of schema and document validity.\n\n    switch (node.kind) {\n      case Kind.SELECTION_SET: {\n        const namedType = getNamedType(this.getType());\n\n        this._parentTypeStack.push(\n          isCompositeType(namedType) ? namedType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.FIELD: {\n        const parentType = this.getParentType();\n        let fieldDef;\n        let fieldType;\n\n        if (parentType) {\n          fieldDef = this._getFieldDef(schema, parentType, node);\n\n          if (fieldDef) {\n            fieldType = fieldDef.type;\n          }\n        }\n\n        this._fieldDefStack.push(fieldDef);\n\n        this._typeStack.push(isOutputType(fieldType) ? fieldType : undefined);\n\n        break;\n      }\n\n      case Kind.DIRECTIVE:\n        this._directive = schema.getDirective(node.name.value);\n        break;\n\n      case Kind.OPERATION_DEFINITION: {\n        const rootType = schema.getRootType(node.operation);\n\n        this._typeStack.push(isObjectType(rootType) ? rootType : undefined);\n\n        break;\n      }\n\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION: {\n        const typeConditionAST = node.typeCondition;\n        const outputType = typeConditionAST\n          ? typeFromAST(schema, typeConditionAST)\n          : getNamedType(this.getType());\n\n        this._typeStack.push(isOutputType(outputType) ? outputType : undefined);\n\n        break;\n      }\n\n      case Kind.VARIABLE_DEFINITION: {\n        const inputType = typeFromAST(schema, node.type);\n\n        this._inputTypeStack.push(\n          isInputType(inputType) ? inputType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.ARGUMENT: {\n        var _this$getDirective;\n\n        let argDef;\n        let argType;\n        const fieldOrDirective =\n          (_this$getDirective = this.getDirective()) !== null &&\n          _this$getDirective !== void 0\n            ? _this$getDirective\n            : this.getFieldDef();\n\n        if (fieldOrDirective) {\n          argDef = fieldOrDirective.args.find(\n            (arg) => arg.name === node.name.value,\n          );\n\n          if (argDef) {\n            argType = argDef.type;\n          }\n        }\n\n        this._argument = argDef;\n\n        this._defaultValueStack.push(argDef ? argDef.defaultValue : undefined);\n\n        this._inputTypeStack.push(isInputType(argType) ? argType : undefined);\n\n        break;\n      }\n\n      case Kind.LIST: {\n        const listType = getNullableType(this.getInputType());\n        const itemType = isListType(listType) ? listType.ofType : listType; // List positions never have a default value.\n\n        this._defaultValueStack.push(undefined);\n\n        this._inputTypeStack.push(isInputType(itemType) ? itemType : undefined);\n\n        break;\n      }\n\n      case Kind.OBJECT_FIELD: {\n        const objectType = getNamedType(this.getInputType());\n        let inputFieldType;\n        let inputField;\n\n        if (isInputObjectType(objectType)) {\n          inputField = objectType.getFields()[node.name.value];\n\n          if (inputField) {\n            inputFieldType = inputField.type;\n          }\n        }\n\n        this._defaultValueStack.push(\n          inputField ? inputField.defaultValue : undefined,\n        );\n\n        this._inputTypeStack.push(\n          isInputType(inputFieldType) ? inputFieldType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.ENUM: {\n        const enumType = getNamedType(this.getInputType());\n        let enumValue;\n\n        if (isEnumType(enumType)) {\n          enumValue = enumType.getValue(node.value);\n        }\n\n        this._enumValue = enumValue;\n        break;\n      }\n\n      default: // Ignore other nodes\n    }\n  }\n\n  leave(node) {\n    switch (node.kind) {\n      case Kind.SELECTION_SET:\n        this._parentTypeStack.pop();\n\n        break;\n\n      case Kind.FIELD:\n        this._fieldDefStack.pop();\n\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.DIRECTIVE:\n        this._directive = null;\n        break;\n\n      case Kind.OPERATION_DEFINITION:\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION:\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.VARIABLE_DEFINITION:\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ARGUMENT:\n        this._argument = null;\n\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.LIST:\n      case Kind.OBJECT_FIELD:\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ENUM:\n        this._enumValue = null;\n        break;\n\n      default: // Ignore other nodes\n    }\n  }\n}\n\n/**\n * Not exactly the same as the executor's definition of getFieldDef, in this\n * statically evaluated environment we do not always have an Object type,\n * and need to handle Interface and Union types.\n */\nfunction getFieldDef(schema, parentType, fieldNode) {\n  const name = fieldNode.name.value;\n\n  if (\n    name === SchemaMetaFieldDef.name &&\n    schema.getQueryType() === parentType\n  ) {\n    return SchemaMetaFieldDef;\n  }\n\n  if (name === TypeMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return TypeMetaFieldDef;\n  }\n\n  if (name === TypeNameMetaFieldDef.name && isCompositeType(parentType)) {\n    return TypeNameMetaFieldDef;\n  }\n\n  if (isObjectType(parentType) || isInterfaceType(parentType)) {\n    return parentType.getFields()[name];\n  }\n}\n/**\n * Creates a new visitor instance which maintains a provided TypeInfo instance\n * along with visiting visitor.\n */\n\nexport function visitWithTypeInfo(typeInfo, visitor) {\n  return {\n    enter(...args) {\n      const node = args[0];\n      typeInfo.enter(node);\n      const fn = getEnterLeaveForKind(visitor, node.kind).enter;\n\n      if (fn) {\n        const result = fn.apply(visitor, args);\n\n        if (result !== undefined) {\n          typeInfo.leave(node);\n\n          if (isNode(result)) {\n            typeInfo.enter(result);\n          }\n        }\n\n        return result;\n      }\n    },\n\n    leave(...args) {\n      const node = args[0];\n      const fn = getEnterLeaveForKind(visitor, node.kind).leave;\n      let result;\n\n      if (fn) {\n        result = fn.apply(visitor, args);\n      }\n\n      typeInfo.leave(node);\n      return result;\n    },\n  };\n}\n","import { Kind } from './kinds.mjs';\nexport function isDefinitionNode(node) {\n  return (\n    isExecutableDefinitionNode(node) ||\n    isTypeSystemDefinitionNode(node) ||\n    isTypeSystemExtensionNode(node)\n  );\n}\nexport function isExecutableDefinitionNode(node) {\n  return (\n    node.kind === Kind.OPERATION_DEFINITION ||\n    node.kind === Kind.FRAGMENT_DEFINITION\n  );\n}\nexport function isSelectionNode(node) {\n  return (\n    node.kind === Kind.FIELD ||\n    node.kind === Kind.FRAGMENT_SPREAD ||\n    node.kind === Kind.INLINE_FRAGMENT\n  );\n}\nexport function isValueNode(node) {\n  return (\n    node.kind === Kind.VARIABLE ||\n    node.kind === Kind.INT ||\n    node.kind === Kind.FLOAT ||\n    node.kind === Kind.STRING ||\n    node.kind === Kind.BOOLEAN ||\n    node.kind === Kind.NULL ||\n    node.kind === Kind.ENUM ||\n    node.kind === Kind.LIST ||\n    node.kind === Kind.OBJECT\n  );\n}\nexport function isConstValueNode(node) {\n  return (\n    isValueNode(node) &&\n    (node.kind === Kind.LIST\n      ? node.values.some(isConstValueNode)\n      : node.kind === Kind.OBJECT\n      ? node.fields.some((field) => isConstValueNode(field.value))\n      : node.kind !== Kind.VARIABLE)\n  );\n}\nexport function isTypeNode(node) {\n  return (\n    node.kind === Kind.NAMED_TYPE ||\n    node.kind === Kind.LIST_TYPE ||\n    node.kind === Kind.NON_NULL_TYPE\n  );\n}\nexport function isTypeSystemDefinitionNode(node) {\n  return (\n    node.kind === Kind.SCHEMA_DEFINITION ||\n    isTypeDefinitionNode(node) ||\n    node.kind === Kind.DIRECTIVE_DEFINITION\n  );\n}\nexport function isTypeDefinitionNode(node) {\n  return (\n    node.kind === Kind.SCALAR_TYPE_DEFINITION ||\n    node.kind === Kind.OBJECT_TYPE_DEFINITION ||\n    node.kind === Kind.INTERFACE_TYPE_DEFINITION ||\n    node.kind === Kind.UNION_TYPE_DEFINITION ||\n    node.kind === Kind.ENUM_TYPE_DEFINITION ||\n    node.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION\n  );\n}\nexport function isTypeSystemExtensionNode(node) {\n  return node.kind === Kind.SCHEMA_EXTENSION || isTypeExtensionNode(node);\n}\nexport function isTypeExtensionNode(node) {\n  return (\n    node.kind === Kind.SCALAR_TYPE_EXTENSION ||\n    node.kind === Kind.OBJECT_TYPE_EXTENSION ||\n    node.kind === Kind.INTERFACE_TYPE_EXTENSION ||\n    node.kind === Kind.UNION_TYPE_EXTENSION ||\n    node.kind === Kind.ENUM_TYPE_EXTENSION ||\n    node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION\n  );\n}\nexport function isSchemaCoordinateNode(node) {\n  return (\n    node.kind === Kind.TYPE_COORDINATE ||\n    node.kind === Kind.MEMBER_COORDINATE ||\n    node.kind === Kind.ARGUMENT_COORDINATE ||\n    node.kind === Kind.DIRECTIVE_COORDINATE ||\n    node.kind === Kind.DIRECTIVE_ARGUMENT_COORDINATE\n  );\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { isExecutableDefinitionNode } from '../../language/predicates.mjs';\n\n/**\n * Executable definitions\n *\n * A GraphQL document is only valid for execution if all definitions are either\n * operation or fragment definitions.\n *\n * See https://spec.graphql.org/draft/#sec-Executable-Definitions\n */\nexport function ExecutableDefinitionsRule(context) {\n  return {\n    Document(node) {\n      for (const definition of node.definitions) {\n        if (!isExecutableDefinitionNode(definition)) {\n          const defName =\n            definition.kind === Kind.SCHEMA_DEFINITION ||\n            definition.kind === Kind.SCHEMA_EXTENSION\n              ? 'schema'\n              : '\"' + definition.name.value + '\"';\n          context.reportError(\n            new GraphQLError(`The ${defName} definition is not executable.`, {\n              nodes: definition,\n            }),\n          );\n        }\n      }\n\n      return false;\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { naturalCompare } from '../../jsutils/naturalCompare.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isAbstractType,\n  isInterfaceType,\n  isObjectType,\n} from '../../type/definition.mjs';\n\n/**\n * Fields on correct type\n *\n * A GraphQL document is only valid if all fields selected are defined by the\n * parent type, or are an allowed meta field such as __typename.\n *\n * See https://spec.graphql.org/draft/#sec-Field-Selections\n */\nexport function FieldsOnCorrectTypeRule(context) {\n  return {\n    Field(node) {\n      const type = context.getParentType();\n\n      if (type) {\n        const fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          // This field doesn't exist, lets look for suggestions.\n          const schema = context.getSchema();\n          const fieldName = node.name.value; // First determine if there are any suggested types to condition on.\n\n          let suggestion = didYouMean(\n            'to use an inline fragment on',\n            getSuggestedTypeNames(schema, type, fieldName),\n          ); // If there are no suggested types, then perhaps this was a typo?\n\n          if (suggestion === '') {\n            suggestion = didYouMean(getSuggestedFieldNames(type, fieldName));\n          } // Report an error, including helpful suggestions.\n\n          context.reportError(\n            new GraphQLError(\n              `Cannot query field \"${fieldName}\" on type \"${type.name}\".` +\n                suggestion,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n/**\n * Go through all of the implementations of type, as well as the interfaces that\n * they implement. If any of those types include the provided field, suggest them,\n * sorted by how often the type is referenced.\n */\n\nfunction getSuggestedTypeNames(schema, type, fieldName) {\n  if (!isAbstractType(type)) {\n    // Must be an Object type, which does not have possible fields.\n    return [];\n  }\n\n  const suggestedTypes = new Set();\n  const usageCount = Object.create(null);\n\n  for (const possibleType of schema.getPossibleTypes(type)) {\n    if (!possibleType.getFields()[fieldName]) {\n      continue;\n    } // This object type defines this field.\n\n    suggestedTypes.add(possibleType);\n    usageCount[possibleType.name] = 1;\n\n    for (const possibleInterface of possibleType.getInterfaces()) {\n      var _usageCount$possibleI;\n\n      if (!possibleInterface.getFields()[fieldName]) {\n        continue;\n      } // This interface type defines this field.\n\n      suggestedTypes.add(possibleInterface);\n      usageCount[possibleInterface.name] =\n        ((_usageCount$possibleI = usageCount[possibleInterface.name]) !==\n          null && _usageCount$possibleI !== void 0\n          ? _usageCount$possibleI\n          : 0) + 1;\n    }\n  }\n\n  return [...suggestedTypes]\n    .sort((typeA, typeB) => {\n      // Suggest both interface and object types based on how common they are.\n      const usageCountDiff = usageCount[typeB.name] - usageCount[typeA.name];\n\n      if (usageCountDiff !== 0) {\n        return usageCountDiff;\n      } // Suggest super types first followed by subtypes\n\n      if (isInterfaceType(typeA) && schema.isSubType(typeA, typeB)) {\n        return -1;\n      }\n\n      if (isInterfaceType(typeB) && schema.isSubType(typeB, typeA)) {\n        return 1;\n      }\n\n      return naturalCompare(typeA.name, typeB.name);\n    })\n    .map((x) => x.name);\n}\n/**\n * For the field name provided, determine if there are any similar field names\n * that may be the result of a typo.\n */\n\nfunction getSuggestedFieldNames(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type)) {\n    const possibleFieldNames = Object.keys(type.getFields());\n    return suggestionList(fieldName, possibleFieldNames);\n  } // Otherwise, must be a Union type, which does not define fields.\n\n  return [];\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isCompositeType } from '../../type/definition.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Fragments on composite type\n *\n * Fragments use a type condition to determine if they apply, since fragments\n * can only be spread into a composite type (object, interface, or union), the\n * type condition must also be a composite type.\n *\n * See https://spec.graphql.org/draft/#sec-Fragments-On-Composite-Types\n */\nexport function FragmentsOnCompositeTypesRule(context) {\n  return {\n    InlineFragment(node) {\n      const typeCondition = node.typeCondition;\n\n      if (typeCondition) {\n        const type = typeFromAST(context.getSchema(), typeCondition);\n\n        if (type && !isCompositeType(type)) {\n          const typeStr = print(typeCondition);\n          context.reportError(\n            new GraphQLError(\n              `Fragment cannot condition on non composite type \"${typeStr}\".`,\n              {\n                nodes: typeCondition,\n              },\n            ),\n          );\n        }\n      }\n    },\n\n    FragmentDefinition(node) {\n      const type = typeFromAST(context.getSchema(), node.typeCondition);\n\n      if (type && !isCompositeType(type)) {\n        const typeStr = print(node.typeCondition);\n        context.reportError(\n          new GraphQLError(\n            `Fragment \"${node.name.value}\" cannot condition on non composite type \"${typeStr}\".`,\n            {\n              nodes: node.typeCondition,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Known argument names\n *\n * A GraphQL field is only valid if all supplied arguments are defined by\n * that field.\n *\n * See https://spec.graphql.org/draft/#sec-Argument-Names\n * See https://spec.graphql.org/draft/#sec-Directives-Are-In-Valid-Locations\n */\nexport function KnownArgumentNamesRule(context) {\n  return {\n    // eslint-disable-next-line new-cap\n    ...KnownArgumentNamesOnDirectivesRule(context),\n\n    Argument(argNode) {\n      const argDef = context.getArgument();\n      const fieldDef = context.getFieldDef();\n      const parentType = context.getParentType();\n\n      if (!argDef && fieldDef && parentType) {\n        const argName = argNode.name.value;\n        const knownArgsNames = fieldDef.args.map((arg) => arg.name);\n        const suggestions = suggestionList(argName, knownArgsNames);\n        context.reportError(\n          new GraphQLError(\n            `Unknown argument \"${argName}\" on field \"${parentType.name}.${fieldDef.name}\".` +\n              didYouMean(suggestions),\n            {\n              nodes: argNode,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n/**\n * @internal\n */\n\nexport function KnownArgumentNamesOnDirectivesRule(context) {\n  const directiveArgs = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    directiveArgs[directive.name] = directive.args.map((arg) => arg.name);\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argsNodes =\n        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0\n          ? _def$arguments\n          : [];\n      directiveArgs[def.name.value] = argsNodes.map((arg) => arg.name.value);\n    }\n  }\n\n  return {\n    Directive(directiveNode) {\n      const directiveName = directiveNode.name.value;\n      const knownArgs = directiveArgs[directiveName];\n\n      if (directiveNode.arguments && knownArgs) {\n        for (const argNode of directiveNode.arguments) {\n          const argName = argNode.name.value;\n\n          if (!knownArgs.includes(argName)) {\n            const suggestions = suggestionList(argName, knownArgs);\n            context.reportError(\n              new GraphQLError(\n                `Unknown argument \"${argName}\" on directive \"@${directiveName}\".` +\n                  didYouMean(suggestions),\n                {\n                  nodes: argNode,\n                },\n              ),\n            );\n          }\n        }\n      }\n\n      return false;\n    },\n  };\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { invariant } from '../../jsutils/invariant.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { OperationTypeNode } from '../../language/ast.mjs';\nimport { DirectiveLocation } from '../../language/directiveLocation.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Known directives\n *\n * A GraphQL document is only valid if all `@directives` are known by the\n * schema and legally positioned.\n *\n * See https://spec.graphql.org/draft/#sec-Directives-Are-Defined\n */\nexport function KnownDirectivesRule(context) {\n  const locationsMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    locationsMap[directive.name] = directive.locations;\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      locationsMap[def.name.value] = def.locations.map((name) => name.value);\n    }\n  }\n\n  return {\n    Directive(node, _key, _parent, _path, ancestors) {\n      const name = node.name.value;\n      const locations = locationsMap[name];\n\n      if (!locations) {\n        context.reportError(\n          new GraphQLError(`Unknown directive \"@${name}\".`, {\n            nodes: node,\n          }),\n        );\n        return;\n      }\n\n      const candidateLocation = getDirectiveLocationForASTPath(ancestors);\n\n      if (candidateLocation && !locations.includes(candidateLocation)) {\n        context.reportError(\n          new GraphQLError(\n            `Directive \"@${name}\" may not be used on ${candidateLocation}.`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\nfunction getDirectiveLocationForASTPath(ancestors) {\n  const appliedTo = ancestors[ancestors.length - 1];\n  'kind' in appliedTo || invariant(false);\n\n  switch (appliedTo.kind) {\n    case Kind.OPERATION_DEFINITION:\n      return getDirectiveLocationForOperation(appliedTo.operation);\n\n    case Kind.FIELD:\n      return DirectiveLocation.FIELD;\n\n    case Kind.FRAGMENT_SPREAD:\n      return DirectiveLocation.FRAGMENT_SPREAD;\n\n    case Kind.INLINE_FRAGMENT:\n      return DirectiveLocation.INLINE_FRAGMENT;\n\n    case Kind.FRAGMENT_DEFINITION:\n      return DirectiveLocation.FRAGMENT_DEFINITION;\n\n    case Kind.VARIABLE_DEFINITION:\n      return DirectiveLocation.VARIABLE_DEFINITION;\n\n    case Kind.SCHEMA_DEFINITION:\n    case Kind.SCHEMA_EXTENSION:\n      return DirectiveLocation.SCHEMA;\n\n    case Kind.SCALAR_TYPE_DEFINITION:\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return DirectiveLocation.SCALAR;\n\n    case Kind.OBJECT_TYPE_DEFINITION:\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.OBJECT;\n\n    case Kind.FIELD_DEFINITION:\n      return DirectiveLocation.FIELD_DEFINITION;\n\n    case Kind.INTERFACE_TYPE_DEFINITION:\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return DirectiveLocation.INTERFACE;\n\n    case Kind.UNION_TYPE_DEFINITION:\n    case Kind.UNION_TYPE_EXTENSION:\n      return DirectiveLocation.UNION;\n\n    case Kind.ENUM_TYPE_DEFINITION:\n    case Kind.ENUM_TYPE_EXTENSION:\n      return DirectiveLocation.ENUM;\n\n    case Kind.ENUM_VALUE_DEFINITION:\n      return DirectiveLocation.ENUM_VALUE;\n\n    case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.INPUT_OBJECT;\n\n    case Kind.INPUT_VALUE_DEFINITION: {\n      const parentNode = ancestors[ancestors.length - 3];\n      'kind' in parentNode || invariant(false);\n      return parentNode.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION\n        ? DirectiveLocation.INPUT_FIELD_DEFINITION\n        : DirectiveLocation.ARGUMENT_DEFINITION;\n    }\n    // Not reachable, all possible types have been considered.\n\n    /* c8 ignore next */\n\n    default:\n      false || invariant(false, 'Unexpected kind: ' + inspect(appliedTo.kind));\n  }\n}\n\nfunction getDirectiveLocationForOperation(operation) {\n  switch (operation) {\n    case OperationTypeNode.QUERY:\n      return DirectiveLocation.QUERY;\n\n    case OperationTypeNode.MUTATION:\n      return DirectiveLocation.MUTATION;\n\n    case OperationTypeNode.SUBSCRIPTION:\n      return DirectiveLocation.SUBSCRIPTION;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Known fragment names\n *\n * A GraphQL document is only valid if all `...Fragment` fragment spreads refer\n * to fragments defined in the same document.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-spread-target-defined\n */\nexport function KnownFragmentNamesRule(context) {\n  return {\n    FragmentSpread(node) {\n      const fragmentName = node.name.value;\n      const fragment = context.getFragment(fragmentName);\n\n      if (!fragment) {\n        context.reportError(\n          new GraphQLError(`Unknown fragment \"${fragmentName}\".`, {\n            nodes: node.name,\n          }),\n        );\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeSystemDefinitionNode,\n  isTypeSystemExtensionNode,\n} from '../../language/predicates.mjs';\nimport { introspectionTypes } from '../../type/introspection.mjs';\nimport { specifiedScalarTypes } from '../../type/scalars.mjs';\n\n/**\n * Known type names\n *\n * A GraphQL document is only valid if referenced types (specifically\n * variable definitions and fragment conditions) are defined by the type schema.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-Spread-Type-Existence\n */\nexport function KnownTypeNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypesMap = schema ? schema.getTypeMap() : Object.create(null);\n  const definedTypes = Object.create(null);\n\n  for (const def of context.getDocument().definitions) {\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = true;\n    }\n  }\n\n  const typeNames = [\n    ...Object.keys(existingTypesMap),\n    ...Object.keys(definedTypes),\n  ];\n  return {\n    NamedType(node, _1, parent, _2, ancestors) {\n      const typeName = node.name.value;\n\n      if (!existingTypesMap[typeName] && !definedTypes[typeName]) {\n        var _ancestors$;\n\n        const definitionNode =\n          (_ancestors$ = ancestors[2]) !== null && _ancestors$ !== void 0\n            ? _ancestors$\n            : parent;\n        const isSDL = definitionNode != null && isSDLNode(definitionNode);\n\n        if (isSDL && standardTypeNames.includes(typeName)) {\n          return;\n        }\n\n        const suggestedTypes = suggestionList(\n          typeName,\n          isSDL ? standardTypeNames.concat(typeNames) : typeNames,\n        );\n        context.reportError(\n          new GraphQLError(\n            `Unknown type \"${typeName}\".` + didYouMean(suggestedTypes),\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\nconst standardTypeNames = [...specifiedScalarTypes, ...introspectionTypes].map(\n  (type) => type.name,\n);\n\nfunction isSDLNode(value) {\n  return (\n    'kind' in value &&\n    (isTypeSystemDefinitionNode(value) || isTypeSystemExtensionNode(value))\n  );\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\n\n/**\n * Lone anonymous operation\n *\n * A GraphQL document is only valid if when it contains an anonymous operation\n * (the query short-hand) that it contains only that one operation definition.\n *\n * See https://spec.graphql.org/draft/#sec-Lone-Anonymous-Operation\n */\nexport function LoneAnonymousOperationRule(context) {\n  let operationCount = 0;\n  return {\n    Document(node) {\n      operationCount = node.definitions.filter(\n        (definition) => definition.kind === Kind.OPERATION_DEFINITION,\n      ).length;\n    },\n\n    OperationDefinition(node) {\n      if (!node.name && operationCount > 1) {\n        context.reportError(\n          new GraphQLError(\n            'This anonymous operation must be the only defined operation.',\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Lone Schema definition\n *\n * A GraphQL document is only valid if it contains only one schema definition.\n */\nexport function LoneSchemaDefinitionRule(context) {\n  var _ref, _ref2, _oldSchema$astNode;\n\n  const oldSchema = context.getSchema();\n  const alreadyDefined =\n    (_ref =\n      (_ref2 =\n        (_oldSchema$astNode =\n          oldSchema === null || oldSchema === void 0\n            ? void 0\n            : oldSchema.astNode) !== null && _oldSchema$astNode !== void 0\n          ? _oldSchema$astNode\n          : oldSchema === null || oldSchema === void 0\n          ? void 0\n          : oldSchema.getQueryType()) !== null && _ref2 !== void 0\n        ? _ref2\n        : oldSchema === null || oldSchema === void 0\n        ? void 0\n        : oldSchema.getMutationType()) !== null && _ref !== void 0\n      ? _ref\n      : oldSchema === null || oldSchema === void 0\n      ? void 0\n      : oldSchema.getSubscriptionType();\n  let schemaDefinitionsCount = 0;\n  return {\n    SchemaDefinition(node) {\n      if (alreadyDefined) {\n        context.reportError(\n          new GraphQLError(\n            'Cannot define a new schema within a schema extension.',\n            {\n              nodes: node,\n            },\n          ),\n        );\n        return;\n      }\n\n      if (schemaDefinitionsCount > 0) {\n        context.reportError(\n          new GraphQLError('Must provide only one schema definition.', {\n            nodes: node,\n          }),\n        );\n      }\n\n      ++schemaDefinitionsCount;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nconst MAX_LISTS_DEPTH = 3;\nexport function MaxIntrospectionDepthRule(context) {\n  /**\n   * Counts the depth of list fields in \"__Type\" recursively and\n   * returns `true` if the limit has been reached.\n   */\n  function checkDepth(node, visitedFragments = Object.create(null), depth = 0) {\n    if (node.kind === Kind.FRAGMENT_SPREAD) {\n      const fragmentName = node.name.value;\n\n      if (visitedFragments[fragmentName] === true) {\n        // Fragment cycles are handled by `NoFragmentCyclesRule`.\n        return false;\n      }\n\n      const fragment = context.getFragment(fragmentName);\n\n      if (!fragment) {\n        // Missing fragments checks are handled by `KnownFragmentNamesRule`.\n        return false;\n      } // Rather than following an immutable programming pattern which has\n      // significant memory and garbage collection overhead, we've opted to\n      // take a mutable approach for efficiency's sake. Importantly visiting a\n      // fragment twice is fine, so long as you don't do one visit inside the\n      // other.\n\n      try {\n        visitedFragments[fragmentName] = true;\n        return checkDepth(fragment, visitedFragments, depth);\n      } finally {\n        visitedFragments[fragmentName] = undefined;\n      }\n    }\n\n    if (\n      node.kind === Kind.FIELD && // check all introspection lists\n      (node.name.value === 'fields' ||\n        node.name.value === 'interfaces' ||\n        node.name.value === 'possibleTypes' ||\n        node.name.value === 'inputFields')\n    ) {\n      // eslint-disable-next-line no-param-reassign\n      depth++;\n\n      if (depth >= MAX_LISTS_DEPTH) {\n        return true;\n      }\n    } // handles fields and inline fragments\n\n    if ('selectionSet' in node && node.selectionSet) {\n      for (const child of node.selectionSet.selections) {\n        if (checkDepth(child, visitedFragments, depth)) {\n          return true;\n        }\n      }\n    }\n\n    return false;\n  }\n\n  return {\n    Field(node) {\n      if (node.name.value === '__schema' || node.name.value === '__type') {\n        if (checkDepth(node)) {\n          context.reportError(\n            new GraphQLError('Maximum introspection depth exceeded', {\n              nodes: [node],\n            }),\n          );\n          return false;\n        }\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No fragment cycles\n *\n * The graph of fragment spreads must not form any cycles including spreading itself.\n * Otherwise an operation could infinitely spread or infinitely execute on cycles in the underlying data.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-spreads-must-not-form-cycles\n */\nexport function NoFragmentCyclesRule(context) {\n  // Tracks already visited fragments to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  const visitedFrags = Object.create(null); // Array of AST nodes used to produce meaningful errors\n\n  const spreadPath = []; // Position in the spread path\n\n  const spreadPathIndexByName = Object.create(null);\n  return {\n    OperationDefinition: () => false,\n\n    FragmentDefinition(node) {\n      detectCycleRecursive(node);\n      return false;\n    },\n  }; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(fragment) {\n    if (visitedFrags[fragment.name.value]) {\n      return;\n    }\n\n    const fragmentName = fragment.name.value;\n    visitedFrags[fragmentName] = true;\n    const spreadNodes = context.getFragmentSpreads(fragment.selectionSet);\n\n    if (spreadNodes.length === 0) {\n      return;\n    }\n\n    spreadPathIndexByName[fragmentName] = spreadPath.length;\n\n    for (const spreadNode of spreadNodes) {\n      const spreadName = spreadNode.name.value;\n      const cycleIndex = spreadPathIndexByName[spreadName];\n      spreadPath.push(spreadNode);\n\n      if (cycleIndex === undefined) {\n        const spreadFragment = context.getFragment(spreadName);\n\n        if (spreadFragment) {\n          detectCycleRecursive(spreadFragment);\n        }\n      } else {\n        const cyclePath = spreadPath.slice(cycleIndex);\n        const viaPath = cyclePath\n          .slice(0, -1)\n          .map((s) => '\"' + s.name.value + '\"')\n          .join(', ');\n        context.reportError(\n          new GraphQLError(\n            `Cannot spread fragment \"${spreadName}\" within itself` +\n              (viaPath !== '' ? ` via ${viaPath}.` : '.'),\n            {\n              nodes: cyclePath,\n            },\n          ),\n        );\n      }\n\n      spreadPath.pop();\n    }\n\n    spreadPathIndexByName[fragmentName] = undefined;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No undefined variables\n *\n * A GraphQL operation is only valid if all variables encountered, both directly\n * and via fragment spreads, are defined by that operation.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variable-Uses-Defined\n */\nexport function NoUndefinedVariablesRule(context) {\n  let variableNameDefined = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter() {\n        variableNameDefined = Object.create(null);\n      },\n\n      leave(operation) {\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node } of usages) {\n          const varName = node.name.value;\n\n          if (variableNameDefined[varName] !== true) {\n            context.reportError(\n              new GraphQLError(\n                operation.name\n                  ? `Variable \"$${varName}\" is not defined by operation \"${operation.name.value}\".`\n                  : `Variable \"$${varName}\" is not defined.`,\n                {\n                  nodes: [node, operation],\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n\n    VariableDefinition(node) {\n      variableNameDefined[node.variable.name.value] = true;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No unused fragments\n *\n * A GraphQL document is only valid if all fragment definitions are spread\n * within operations, or spread within other fragments spread within operations.\n *\n * See https://spec.graphql.org/draft/#sec-Fragments-Must-Be-Used\n */\nexport function NoUnusedFragmentsRule(context) {\n  const operationDefs = [];\n  const fragmentDefs = [];\n  return {\n    OperationDefinition(node) {\n      operationDefs.push(node);\n      return false;\n    },\n\n    FragmentDefinition(node) {\n      fragmentDefs.push(node);\n      return false;\n    },\n\n    Document: {\n      leave() {\n        const fragmentNameUsed = Object.create(null);\n\n        for (const operation of operationDefs) {\n          for (const fragment of context.getRecursivelyReferencedFragments(\n            operation,\n          )) {\n            fragmentNameUsed[fragment.name.value] = true;\n          }\n        }\n\n        for (const fragmentDef of fragmentDefs) {\n          const fragName = fragmentDef.name.value;\n\n          if (fragmentNameUsed[fragName] !== true) {\n            context.reportError(\n              new GraphQLError(`Fragment \"${fragName}\" is never used.`, {\n                nodes: fragmentDef,\n              }),\n            );\n          }\n        }\n      },\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No unused variables\n *\n * A GraphQL operation is only valid if all variables defined by an operation\n * are used, either directly or within a spread fragment.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variables-Used\n */\nexport function NoUnusedVariablesRule(context) {\n  let variableDefs = [];\n  return {\n    OperationDefinition: {\n      enter() {\n        variableDefs = [];\n      },\n\n      leave(operation) {\n        const variableNameUsed = Object.create(null);\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node } of usages) {\n          variableNameUsed[node.name.value] = true;\n        }\n\n        for (const variableDef of variableDefs) {\n          const variableName = variableDef.variable.name.value;\n\n          if (variableNameUsed[variableName] !== true) {\n            context.reportError(\n              new GraphQLError(\n                operation.name\n                  ? `Variable \"$${variableName}\" is never used in operation \"${operation.name.value}\".`\n                  : `Variable \"$${variableName}\" is never used.`,\n                {\n                  nodes: variableDef,\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n\n    VariableDefinition(def) {\n      variableDefs.push(def);\n    },\n  };\n}\n","import { naturalCompare } from '../jsutils/naturalCompare.mjs';\nimport { Kind } from '../language/kinds.mjs';\n/**\n * Sort ValueNode.\n *\n * This function returns a sorted copy of the given ValueNode.\n *\n * @internal\n */\n\nexport function sortValueNode(valueNode) {\n  switch (valueNode.kind) {\n    case Kind.OBJECT:\n      return { ...valueNode, fields: sortFields(valueNode.fields) };\n\n    case Kind.LIST:\n      return { ...valueNode, values: valueNode.values.map(sortValueNode) };\n\n    case Kind.INT:\n    case Kind.FLOAT:\n    case Kind.STRING:\n    case Kind.BOOLEAN:\n    case Kind.NULL:\n    case Kind.ENUM:\n    case Kind.VARIABLE:\n      return valueNode;\n  }\n}\n\nfunction sortFields(fields) {\n  return fields\n    .map((fieldNode) => ({\n      ...fieldNode,\n      value: sortValueNode(fieldNode.value),\n    }))\n    .sort((fieldA, fieldB) =>\n      naturalCompare(fieldA.name.value, fieldB.name.value),\n    );\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport {\n  getNamedType,\n  isInterfaceType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n} from '../../type/definition.mjs';\nimport { sortValueNode } from '../../utilities/sortValueNode.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\nfunction reasonMessage(reason) {\n  if (Array.isArray(reason)) {\n    return reason\n      .map(\n        ([responseName, subReason]) =>\n          `subfields \"${responseName}\" conflict because ` +\n          reasonMessage(subReason),\n      )\n      .join(' and ');\n  }\n\n  return reason;\n}\n/**\n * Overlapping fields can be merged\n *\n * A selection set is only valid if all fields (including spreading any\n * fragments) either correspond to distinct response names or can be merged\n * without ambiguity.\n *\n * See https://spec.graphql.org/draft/#sec-Field-Selection-Merging\n */\n\nexport function OverlappingFieldsCanBeMergedRule(context) {\n  // A memoization for when fields and a fragment or two fragments are compared\n  // \"between\" each other for conflicts. Comparisons made be made many times,\n  // so memoizing this can dramatically improve the performance of this validator.\n  const comparedFieldsAndFragmentPairs = new OrderedPairSet();\n  const comparedFragmentPairs = new PairSet(); // A cache for the \"field map\" and list of fragment names found in any given\n  // selection set. Selection sets may be asked for this information multiple\n  // times, so this improves the performance of this validator.\n\n  const cachedFieldsAndFragmentNames = new Map();\n  return {\n    SelectionSet(selectionSet) {\n      const conflicts = findConflictsWithinSelectionSet(\n        context,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        context.getParentType(),\n        selectionSet,\n      );\n\n      for (const [[responseName, reason], fields1, fields2] of conflicts) {\n        const reasonMsg = reasonMessage(reason);\n        context.reportError(\n          new GraphQLError(\n            `Fields \"${responseName}\" conflict because ${reasonMsg}. Use different aliases on the fields to fetch both if this was intentional.`,\n            {\n              nodes: fields1.concat(fields2),\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\n/**\n * Algorithm:\n *\n * Conflicts occur when two fields exist in a query which will produce the same\n * response name, but represent differing values, thus creating a conflict.\n * The algorithm below finds all conflicts via making a series of comparisons\n * between fields. In order to compare as few fields as possible, this makes\n * a series of comparisons \"within\" sets of fields and \"between\" sets of fields.\n *\n * Given any selection set, a collection produces both a set of fields by\n * also including all inline fragments, as well as a list of fragments\n * referenced by fragment spreads.\n *\n * A) Each selection set represented in the document first compares \"within\" its\n * collected set of fields, finding any conflicts between every pair of\n * overlapping fields.\n * Note: This is the *only time* that a the fields \"within\" a set are compared\n * to each other. After this only fields \"between\" sets are compared.\n *\n * B) Also, if any fragment is referenced in a selection set, then a\n * comparison is made \"between\" the original set of fields and the\n * referenced fragment.\n *\n * C) Also, if multiple fragments are referenced, then comparisons\n * are made \"between\" each referenced fragment.\n *\n * D) When comparing \"between\" a set of fields and a referenced fragment, first\n * a comparison is made between each field in the original set of fields and\n * each field in the the referenced set of fields.\n *\n * E) Also, if any fragment is referenced in the referenced selection set,\n * then a comparison is made \"between\" the original set of fields and the\n * referenced fragment (recursively referring to step D).\n *\n * F) When comparing \"between\" two fragments, first a comparison is made between\n * each field in the first referenced set of fields and each field in the the\n * second referenced set of fields.\n *\n * G) Also, any fragments referenced by the first must be compared to the\n * second, and any fragments referenced by the second must be compared to the\n * first (recursively referring to step F).\n *\n * H) When comparing two fields, if both have selection sets, then a comparison\n * is made \"between\" both selection sets, first comparing the set of fields in\n * the first selection set with the set of fields in the second.\n *\n * I) Also, if any fragment is referenced in either selection set, then a\n * comparison is made \"between\" the other set of fields and the\n * referenced fragment.\n *\n * J) Also, if two fragments are referenced in both selection sets, then a\n * comparison is made \"between\" the two fragments.\n *\n */\n// Find all conflicts found \"within\" a selection set, including those found\n// via spreading in fragments. Called when visiting each SelectionSet in the\n// GraphQL Document.\nfunction findConflictsWithinSelectionSet(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentType,\n  selectionSet,\n) {\n  const conflicts = [];\n  const [fieldMap, fragmentNames] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType,\n    selectionSet,\n  ); // (A) Find find all conflicts \"within\" the fields of this selection set.\n  // Note: this is the *only place* `collectConflictsWithin` is called.\n\n  collectConflictsWithin(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    fieldMap,\n  );\n\n  if (fragmentNames.length !== 0) {\n    // (B) Then collect conflicts between these fields and those represented by\n    // each spread fragment name found.\n    for (let i = 0; i < fragmentNames.length; i++) {\n      collectConflictsBetweenFieldsAndFragment(\n        context,\n        conflicts,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        false,\n        fieldMap,\n        fragmentNames[i],\n      ); // (C) Then compare this fragment with all other fragments found in this\n      // selection set to collect conflicts between fragments spread together.\n      // This compares each item in the list of fragment names to every other\n      // item in that same list (except for itself).\n\n      for (let j = i + 1; j < fragmentNames.length; j++) {\n        collectConflictsBetweenFragments(\n          context,\n          conflicts,\n          cachedFieldsAndFragmentNames,\n          comparedFieldsAndFragmentPairs,\n          comparedFragmentPairs,\n          false,\n          fragmentNames[i],\n          fragmentNames[j],\n        );\n      }\n    }\n  }\n\n  return conflicts;\n} // Collect all conflicts found between a set of fields and a fragment reference\n// including via spreading in any nested fragments.\n\nfunction collectConflictsBetweenFieldsAndFragment(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  fieldMap,\n  fragmentName,\n) {\n  // Memoize so the fields and fragments are not compared for conflicts more\n  // than once.\n  if (\n    comparedFieldsAndFragmentPairs.has(\n      fieldMap,\n      fragmentName,\n      areMutuallyExclusive,\n    )\n  ) {\n    return;\n  }\n\n  comparedFieldsAndFragmentPairs.add(\n    fieldMap,\n    fragmentName,\n    areMutuallyExclusive,\n  );\n  const fragment = context.getFragment(fragmentName);\n\n  if (!fragment) {\n    return;\n  }\n\n  const [fieldMap2, referencedFragmentNames] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment,\n    ); // Do not compare a fragment's fieldMap to itself.\n\n  if (fieldMap === fieldMap2) {\n    return;\n  } // (D) First collect any conflicts between the provided collection of fields\n  // and the collection of fields represented by the given fragment.\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap,\n    fieldMap2,\n  ); // (E) Then collect any conflicts between the provided collection of fields\n  // and any fragment names found in the given fragment.\n\n  for (const referencedFragmentName of referencedFragmentNames) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap,\n      referencedFragmentName,\n    );\n  }\n} // Collect all conflicts found between two fragments, including via spreading in\n// any nested fragments.\n\nfunction collectConflictsBetweenFragments(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  fragmentName1,\n  fragmentName2,\n) {\n  // No need to compare a fragment to itself.\n  if (fragmentName1 === fragmentName2) {\n    return;\n  } // Memoize so two fragments are not compared for conflicts more than once.\n\n  if (\n    comparedFragmentPairs.has(\n      fragmentName1,\n      fragmentName2,\n      areMutuallyExclusive,\n    )\n  ) {\n    return;\n  }\n\n  comparedFragmentPairs.add(fragmentName1, fragmentName2, areMutuallyExclusive);\n  const fragment1 = context.getFragment(fragmentName1);\n  const fragment2 = context.getFragment(fragmentName2);\n\n  if (!fragment1 || !fragment2) {\n    return;\n  }\n\n  const [fieldMap1, referencedFragmentNames1] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment1,\n    );\n  const [fieldMap2, referencedFragmentNames2] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment2,\n    ); // (F) First, collect all conflicts between these two collections of fields\n  // (not including any nested fragments).\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap1,\n    fieldMap2,\n  ); // (G) Then collect conflicts between the first fragment and any nested\n  // fragments spread in the second fragment.\n\n  for (const referencedFragmentName2 of referencedFragmentNames2) {\n    collectConflictsBetweenFragments(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fragmentName1,\n      referencedFragmentName2,\n    );\n  } // (G) Then collect conflicts between the second fragment and any nested\n  // fragments spread in the first fragment.\n\n  for (const referencedFragmentName1 of referencedFragmentNames1) {\n    collectConflictsBetweenFragments(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      referencedFragmentName1,\n      fragmentName2,\n    );\n  }\n} // Find all conflicts found between two selection sets, including those found\n// via spreading in fragments. Called when determining if conflicts exist\n// between the sub-fields of two overlapping fields.\n\nfunction findConflictsBetweenSubSelectionSets(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  parentType1,\n  selectionSet1,\n  parentType2,\n  selectionSet2,\n) {\n  const conflicts = [];\n  const [fieldMap1, fragmentNames1] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType1,\n    selectionSet1,\n  );\n  const [fieldMap2, fragmentNames2] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType2,\n    selectionSet2,\n  ); // (H) First, collect all conflicts between these two collections of field.\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap1,\n    fieldMap2,\n  ); // (I) Then collect conflicts between the first collection of fields and\n  // those referenced by each fragment name associated with the second.\n\n  for (const fragmentName2 of fragmentNames2) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap1,\n      fragmentName2,\n    );\n  } // (I) Then collect conflicts between the second collection of fields and\n  // those referenced by each fragment name associated with the first.\n\n  for (const fragmentName1 of fragmentNames1) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap2,\n      fragmentName1,\n    );\n  } // (J) Also collect conflicts between any fragment names by the first and\n  // fragment names by the second. This compares each item in the first set of\n  // names to each item in the second set of names.\n\n  for (const fragmentName1 of fragmentNames1) {\n    for (const fragmentName2 of fragmentNames2) {\n      collectConflictsBetweenFragments(\n        context,\n        conflicts,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        areMutuallyExclusive,\n        fragmentName1,\n        fragmentName2,\n      );\n    }\n  }\n\n  return conflicts;\n} // Collect all Conflicts \"within\" one collection of fields.\n\nfunction collectConflictsWithin(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  fieldMap,\n) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For every response name, if there are multiple fields, they\n  // must be compared to find a potential conflict.\n  for (const [responseName, fields] of Object.entries(fieldMap)) {\n    // This compares every field in the list to every other field in this list\n    // (except to itself). If the list only has one item, nothing needs to\n    // be compared.\n    if (fields.length > 1) {\n      for (let i = 0; i < fields.length; i++) {\n        for (let j = i + 1; j < fields.length; j++) {\n          const conflict = findConflict(\n            context,\n            cachedFieldsAndFragmentNames,\n            comparedFieldsAndFragmentPairs,\n            comparedFragmentPairs,\n            false, // within one collection is never mutually exclusive\n            responseName,\n            fields[i],\n            fields[j],\n          );\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Collect all Conflicts between two collections of fields. This is similar to,\n// but different from the `collectConflictsWithin` function above. This check\n// assumes that `collectConflictsWithin` has already been called on each\n// provided collection of fields. This is true because this validator traverses\n// each individual selection set.\n\nfunction collectConflictsBetween(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentFieldsAreMutuallyExclusive,\n  fieldMap1,\n  fieldMap2,\n) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For any response name which appears in both provided field\n  // maps, each field from the first field map must be compared to every field\n  // in the second field map to find potential conflicts.\n  for (const [responseName, fields1] of Object.entries(fieldMap1)) {\n    const fields2 = fieldMap2[responseName];\n\n    if (fields2) {\n      for (const field1 of fields1) {\n        for (const field2 of fields2) {\n          const conflict = findConflict(\n            context,\n            cachedFieldsAndFragmentNames,\n            comparedFieldsAndFragmentPairs,\n            comparedFragmentPairs,\n            parentFieldsAreMutuallyExclusive,\n            responseName,\n            field1,\n            field2,\n          );\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Determines if there is a conflict between two particular fields, including\n// comparing their sub-fields.\n\nfunction findConflict(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentFieldsAreMutuallyExclusive,\n  responseName,\n  field1,\n  field2,\n) {\n  const [parentType1, node1, def1] = field1;\n  const [parentType2, node2, def2] = field2; // If it is known that two fields could not possibly apply at the same\n  // time, due to the parent types, then it is safe to permit them to diverge\n  // in aliased field or arguments used as they will not present any ambiguity\n  // by differing.\n  // It is known that two parent types could never overlap if they are\n  // different Object types. Interface or Union types might overlap - if not\n  // in the current state of the schema, then perhaps in some future version,\n  // thus may not safely diverge.\n\n  const areMutuallyExclusive =\n    parentFieldsAreMutuallyExclusive ||\n    (parentType1 !== parentType2 &&\n      isObjectType(parentType1) &&\n      isObjectType(parentType2));\n\n  if (!areMutuallyExclusive) {\n    // Two aliases must refer to the same field.\n    const name1 = node1.name.value;\n    const name2 = node2.name.value;\n\n    if (name1 !== name2) {\n      return [\n        [responseName, `\"${name1}\" and \"${name2}\" are different fields`],\n        [node1],\n        [node2],\n      ];\n    } // Two field calls must have the same arguments.\n\n    if (!sameArguments(node1, node2)) {\n      return [\n        [responseName, 'they have differing arguments'],\n        [node1],\n        [node2],\n      ];\n    }\n  } // The return type for each field.\n\n  const type1 = def1 === null || def1 === void 0 ? void 0 : def1.type;\n  const type2 = def2 === null || def2 === void 0 ? void 0 : def2.type;\n\n  if (type1 && type2 && doTypesConflict(type1, type2)) {\n    return [\n      [\n        responseName,\n        `they return conflicting types \"${inspect(type1)}\" and \"${inspect(\n          type2,\n        )}\"`,\n      ],\n      [node1],\n      [node2],\n    ];\n  } // Collect and compare sub-fields. Use the same \"visited fragment names\" list\n  // for both collections so fields in a fragment reference are never\n  // compared to themselves.\n\n  const selectionSet1 = node1.selectionSet;\n  const selectionSet2 = node2.selectionSet;\n\n  if (selectionSet1 && selectionSet2) {\n    const conflicts = findConflictsBetweenSubSelectionSets(\n      context,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      getNamedType(type1),\n      selectionSet1,\n      getNamedType(type2),\n      selectionSet2,\n    );\n    return subfieldConflicts(conflicts, responseName, node1, node2);\n  }\n}\n\nfunction sameArguments(node1, node2) {\n  const args1 = node1.arguments;\n  const args2 = node2.arguments;\n\n  if (args1 === undefined || args1.length === 0) {\n    return args2 === undefined || args2.length === 0;\n  }\n\n  if (args2 === undefined || args2.length === 0) {\n    return false;\n  }\n  /* c8 ignore next */\n\n  if (args1.length !== args2.length) {\n    /* c8 ignore next */\n    return false;\n    /* c8 ignore next */\n  }\n\n  const values2 = new Map(args2.map(({ name, value }) => [name.value, value]));\n  return args1.every((arg1) => {\n    const value1 = arg1.value;\n    const value2 = values2.get(arg1.name.value);\n\n    if (value2 === undefined) {\n      return false;\n    }\n\n    return stringifyValue(value1) === stringifyValue(value2);\n  });\n}\n\nfunction stringifyValue(value) {\n  return print(sortValueNode(value));\n} // Two types conflict if both types could not apply to a value simultaneously.\n// Composite types are ignored as their individual field types will be compared\n// later recursively. However List and Non-Null types must match.\n\nfunction doTypesConflict(type1, type2) {\n  if (isListType(type1)) {\n    return isListType(type2)\n      ? doTypesConflict(type1.ofType, type2.ofType)\n      : true;\n  }\n\n  if (isListType(type2)) {\n    return true;\n  }\n\n  if (isNonNullType(type1)) {\n    return isNonNullType(type2)\n      ? doTypesConflict(type1.ofType, type2.ofType)\n      : true;\n  }\n\n  if (isNonNullType(type2)) {\n    return true;\n  }\n\n  if (isLeafType(type1) || isLeafType(type2)) {\n    return type1 !== type2;\n  }\n\n  return false;\n} // Given a selection set, return the collection of fields (a mapping of response\n// name to field nodes and definitions) as well as a list of fragment names\n// referenced via fragment spreads.\n\nfunction getFieldsAndFragmentNames(\n  context,\n  cachedFieldsAndFragmentNames,\n  parentType,\n  selectionSet,\n) {\n  const cached = cachedFieldsAndFragmentNames.get(selectionSet);\n\n  if (cached) {\n    return cached;\n  }\n\n  const nodeAndDefs = Object.create(null);\n  const fragmentNames = Object.create(null);\n\n  _collectFieldsAndFragmentNames(\n    context,\n    parentType,\n    selectionSet,\n    nodeAndDefs,\n    fragmentNames,\n  );\n\n  const result = [nodeAndDefs, Object.keys(fragmentNames)];\n  cachedFieldsAndFragmentNames.set(selectionSet, result);\n  return result;\n} // Given a reference to a fragment, return the represented collection of fields\n// as well as a list of nested fragment names referenced via fragment spreads.\n\nfunction getReferencedFieldsAndFragmentNames(\n  context,\n  cachedFieldsAndFragmentNames,\n  fragment,\n) {\n  // Short-circuit building a type from the node if possible.\n  const cached = cachedFieldsAndFragmentNames.get(fragment.selectionSet);\n\n  if (cached) {\n    return cached;\n  }\n\n  const fragmentType = typeFromAST(context.getSchema(), fragment.typeCondition);\n  return getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    fragmentType,\n    fragment.selectionSet,\n  );\n}\n\nfunction _collectFieldsAndFragmentNames(\n  context,\n  parentType,\n  selectionSet,\n  nodeAndDefs,\n  fragmentNames,\n) {\n  for (const selection of selectionSet.selections) {\n    switch (selection.kind) {\n      case Kind.FIELD: {\n        const fieldName = selection.name.value;\n        let fieldDef;\n\n        if (isObjectType(parentType) || isInterfaceType(parentType)) {\n          fieldDef = parentType.getFields()[fieldName];\n        }\n\n        const responseName = selection.alias\n          ? selection.alias.value\n          : fieldName;\n\n        if (!nodeAndDefs[responseName]) {\n          nodeAndDefs[responseName] = [];\n        }\n\n        nodeAndDefs[responseName].push([parentType, selection, fieldDef]);\n        break;\n      }\n\n      case Kind.FRAGMENT_SPREAD:\n        fragmentNames[selection.name.value] = true;\n        break;\n\n      case Kind.INLINE_FRAGMENT: {\n        const typeCondition = selection.typeCondition;\n        const inlineFragmentType = typeCondition\n          ? typeFromAST(context.getSchema(), typeCondition)\n          : parentType;\n\n        _collectFieldsAndFragmentNames(\n          context,\n          inlineFragmentType,\n          selection.selectionSet,\n          nodeAndDefs,\n          fragmentNames,\n        );\n\n        break;\n      }\n    }\n  }\n} // Given a series of Conflicts which occurred between two sub-fields, generate\n// a single Conflict.\n\nfunction subfieldConflicts(conflicts, responseName, node1, node2) {\n  if (conflicts.length > 0) {\n    return [\n      [responseName, conflicts.map(([reason]) => reason)],\n      [node1, ...conflicts.map(([, fields1]) => fields1).flat()],\n      [node2, ...conflicts.map(([, , fields2]) => fields2).flat()],\n    ];\n  }\n}\n/**\n * A way to keep track of pairs of things where the ordering of the pair\n * matters.\n *\n * Provides a third argument for has/set to allow flagging the pair as\n * weakly or strongly present within the collection.\n */\n\nclass OrderedPairSet {\n  constructor() {\n    this._data = new Map();\n  }\n\n  has(a, b, weaklyPresent) {\n    var _this$_data$get;\n\n    const result =\n      (_this$_data$get = this._data.get(a)) === null ||\n      _this$_data$get === void 0\n        ? void 0\n        : _this$_data$get.get(b);\n\n    if (result === undefined) {\n      return false;\n    }\n\n    return weaklyPresent ? true : weaklyPresent === result;\n  }\n\n  add(a, b, weaklyPresent) {\n    const map = this._data.get(a);\n\n    if (map === undefined) {\n      this._data.set(a, new Map([[b, weaklyPresent]]));\n    } else {\n      map.set(b, weaklyPresent);\n    }\n  }\n}\n/**\n * A way to keep track of pairs of similar things when the ordering of the pair\n * does not matter.\n */\n\nclass PairSet {\n  constructor() {\n    this._orderedPairSet = new OrderedPairSet();\n  }\n\n  has(a, b, weaklyPresent) {\n    return a < b\n      ? this._orderedPairSet.has(a, b, weaklyPresent)\n      : this._orderedPairSet.has(b, a, weaklyPresent);\n  }\n\n  add(a, b, weaklyPresent) {\n    if (a < b) {\n      this._orderedPairSet.add(a, b, weaklyPresent);\n    } else {\n      this._orderedPairSet.add(b, a, weaklyPresent);\n    }\n  }\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { isCompositeType } from '../../type/definition.mjs';\nimport { doTypesOverlap } from '../../utilities/typeComparators.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Possible fragment spread\n *\n * A fragment spread is only valid if the type condition could ever possibly\n * be true: if there is a non-empty intersection of the possible parent types,\n * and possible types which pass the type condition.\n */\nexport function PossibleFragmentSpreadsRule(context) {\n  return {\n    InlineFragment(node) {\n      const fragType = context.getType();\n      const parentType = context.getParentType();\n\n      if (\n        isCompositeType(fragType) &&\n        isCompositeType(parentType) &&\n        !doTypesOverlap(context.getSchema(), fragType, parentType)\n      ) {\n        const parentTypeStr = inspect(parentType);\n        const fragTypeStr = inspect(fragType);\n        context.reportError(\n          new GraphQLError(\n            `Fragment cannot be spread here as objects of type \"${parentTypeStr}\" can never be of type \"${fragTypeStr}\".`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    FragmentSpread(node) {\n      const fragName = node.name.value;\n      const fragType = getFragmentType(context, fragName);\n      const parentType = context.getParentType();\n\n      if (\n        fragType &&\n        parentType &&\n        !doTypesOverlap(context.getSchema(), fragType, parentType)\n      ) {\n        const parentTypeStr = inspect(parentType);\n        const fragTypeStr = inspect(fragType);\n        context.reportError(\n          new GraphQLError(\n            `Fragment \"${fragName}\" cannot be spread here as objects of type \"${parentTypeStr}\" can never be of type \"${fragTypeStr}\".`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\nfunction getFragmentType(context, name) {\n  const frag = context.getFragment(name);\n\n  if (frag) {\n    const type = typeFromAST(context.getSchema(), frag.typeCondition);\n\n    if (isCompositeType(type)) {\n      return type;\n    }\n  }\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { inspect } from '../../jsutils/inspect.mjs';\nimport { invariant } from '../../jsutils/invariant.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { isTypeDefinitionNode } from '../../language/predicates.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../../type/definition.mjs';\n\n/**\n * Possible type extension\n *\n * A type extension is only valid if the type is defined and has the same kind.\n */\nexport function PossibleTypeExtensionsRule(context) {\n  const schema = context.getSchema();\n  const definedTypes = Object.create(null);\n\n  for (const def of context.getDocument().definitions) {\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = def;\n    }\n  }\n\n  return {\n    ScalarTypeExtension: checkExtension,\n    ObjectTypeExtension: checkExtension,\n    InterfaceTypeExtension: checkExtension,\n    UnionTypeExtension: checkExtension,\n    EnumTypeExtension: checkExtension,\n    InputObjectTypeExtension: checkExtension,\n  };\n\n  function checkExtension(node) {\n    const typeName = node.name.value;\n    const defNode = definedTypes[typeName];\n    const existingType =\n      schema === null || schema === void 0 ? void 0 : schema.getType(typeName);\n    let expectedKind;\n\n    if (defNode) {\n      expectedKind = defKindToExtKind[defNode.kind];\n    } else if (existingType) {\n      expectedKind = typeToExtKind(existingType);\n    }\n\n    if (expectedKind) {\n      if (expectedKind !== node.kind) {\n        const kindStr = extensionKindToTypeName(node.kind);\n        context.reportError(\n          new GraphQLError(`Cannot extend non-${kindStr} type \"${typeName}\".`, {\n            nodes: defNode ? [defNode, node] : node,\n          }),\n        );\n      }\n    } else {\n      const allTypeNames = Object.keys({\n        ...definedTypes,\n        ...(schema === null || schema === void 0\n          ? void 0\n          : schema.getTypeMap()),\n      });\n      const suggestedTypes = suggestionList(typeName, allTypeNames);\n      context.reportError(\n        new GraphQLError(\n          `Cannot extend type \"${typeName}\" because it is not defined.` +\n            didYouMean(suggestedTypes),\n          {\n            nodes: node.name,\n          },\n        ),\n      );\n    }\n  }\n}\nconst defKindToExtKind = {\n  [Kind.SCALAR_TYPE_DEFINITION]: Kind.SCALAR_TYPE_EXTENSION,\n  [Kind.OBJECT_TYPE_DEFINITION]: Kind.OBJECT_TYPE_EXTENSION,\n  [Kind.INTERFACE_TYPE_DEFINITION]: Kind.INTERFACE_TYPE_EXTENSION,\n  [Kind.UNION_TYPE_DEFINITION]: Kind.UNION_TYPE_EXTENSION,\n  [Kind.ENUM_TYPE_DEFINITION]: Kind.ENUM_TYPE_EXTENSION,\n  [Kind.INPUT_OBJECT_TYPE_DEFINITION]: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n};\n\nfunction typeToExtKind(type) {\n  if (isScalarType(type)) {\n    return Kind.SCALAR_TYPE_EXTENSION;\n  }\n\n  if (isObjectType(type)) {\n    return Kind.OBJECT_TYPE_EXTENSION;\n  }\n\n  if (isInterfaceType(type)) {\n    return Kind.INTERFACE_TYPE_EXTENSION;\n  }\n\n  if (isUnionType(type)) {\n    return Kind.UNION_TYPE_EXTENSION;\n  }\n\n  if (isEnumType(type)) {\n    return Kind.ENUM_TYPE_EXTENSION;\n  }\n\n  if (isInputObjectType(type)) {\n    return Kind.INPUT_OBJECT_TYPE_EXTENSION;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable. All possible types have been considered\n\n  false || invariant(false, 'Unexpected type: ' + inspect(type));\n}\n\nfunction extensionKindToTypeName(kind) {\n  switch (kind) {\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return 'scalar';\n\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return 'object';\n\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return 'interface';\n\n    case Kind.UNION_TYPE_EXTENSION:\n      return 'union';\n\n    case Kind.ENUM_TYPE_EXTENSION:\n      return 'enum';\n\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return 'input object';\n    // Not reachable. All possible types have been considered\n\n    /* c8 ignore next */\n\n    default:\n      false || invariant(false, 'Unexpected kind: ' + inspect(kind));\n  }\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { keyMap } from '../../jsutils/keyMap.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isRequiredArgument, isType } from '../../type/definition.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Provided required arguments\n *\n * A field or directive is only valid if all required (non-null without a\n * default value) field arguments have been provided.\n */\nexport function ProvidedRequiredArgumentsRule(context) {\n  return {\n    // eslint-disable-next-line new-cap\n    ...ProvidedRequiredArgumentsOnDirectivesRule(context),\n    Field: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave(fieldNode) {\n        var _fieldNode$arguments;\n\n        const fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          return false;\n        }\n\n        const providedArgs = new Set( // FIXME: https://github.com/graphql/graphql-js/issues/2203\n          /* c8 ignore next */\n          (_fieldNode$arguments = fieldNode.arguments) === null ||\n          _fieldNode$arguments === void 0\n            ? void 0\n            : _fieldNode$arguments.map((arg) => arg.name.value),\n        );\n\n        for (const argDef of fieldDef.args) {\n          if (!providedArgs.has(argDef.name) && isRequiredArgument(argDef)) {\n            const argTypeStr = inspect(argDef.type);\n            context.reportError(\n              new GraphQLError(\n                `Field \"${fieldDef.name}\" argument \"${argDef.name}\" of type \"${argTypeStr}\" is required, but it was not provided.`,\n                {\n                  nodes: fieldNode,\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n  };\n}\n/**\n * @internal\n */\n\nexport function ProvidedRequiredArgumentsOnDirectivesRule(context) {\n  var _schema$getDirectives;\n\n  const requiredArgsMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives =\n    (_schema$getDirectives =\n      schema === null || schema === void 0\n        ? void 0\n        : schema.getDirectives()) !== null && _schema$getDirectives !== void 0\n      ? _schema$getDirectives\n      : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    requiredArgsMap[directive.name] = keyMap(\n      directive.args.filter(isRequiredArgument),\n      (arg) => arg.name,\n    );\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argNodes =\n        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0\n          ? _def$arguments\n          : [];\n      requiredArgsMap[def.name.value] = keyMap(\n        argNodes.filter(isRequiredArgumentNode),\n        (arg) => arg.name.value,\n      );\n    }\n  }\n\n  return {\n    Directive: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave(directiveNode) {\n        const directiveName = directiveNode.name.value;\n        const requiredArgs = requiredArgsMap[directiveName];\n\n        if (requiredArgs) {\n          var _directiveNode$argume;\n\n          // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n          /* c8 ignore next */\n          const argNodes =\n            (_directiveNode$argume = directiveNode.arguments) !== null &&\n            _directiveNode$argume !== void 0\n              ? _directiveNode$argume\n              : [];\n          const argNodeMap = new Set(argNodes.map((arg) => arg.name.value));\n\n          for (const [argName, argDef] of Object.entries(requiredArgs)) {\n            if (!argNodeMap.has(argName)) {\n              const argType = isType(argDef.type)\n                ? inspect(argDef.type)\n                : print(argDef.type);\n              context.reportError(\n                new GraphQLError(\n                  `Directive \"@${directiveName}\" argument \"${argName}\" of type \"${argType}\" is required, but it was not provided.`,\n                  {\n                    nodes: directiveNode,\n                  },\n                ),\n              );\n            }\n          }\n        }\n      },\n    },\n  };\n}\n\nfunction isRequiredArgumentNode(arg) {\n  return arg.type.kind === Kind.NON_NULL_TYPE && arg.defaultValue == null;\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { getNamedType, isLeafType } from '../../type/definition.mjs';\n\n/**\n * Scalar leafs\n *\n * A GraphQL document is valid only if all leaf fields (fields without\n * sub selections) are of scalar or enum types.\n */\nexport function ScalarLeafsRule(context) {\n  return {\n    Field(node) {\n      const type = context.getType();\n      const selectionSet = node.selectionSet;\n\n      if (type) {\n        if (isLeafType(getNamedType(type))) {\n          if (selectionSet) {\n            const fieldName = node.name.value;\n            const typeStr = inspect(type);\n            context.reportError(\n              new GraphQLError(\n                `Field \"${fieldName}\" must not have a selection since type \"${typeStr}\" has no subfields.`,\n                {\n                  nodes: selectionSet,\n                },\n              ),\n            );\n          }\n        } else if (!selectionSet) {\n          const fieldName = node.name.value;\n          const typeStr = inspect(type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${fieldName}\" of type \"${typeStr}\" must have a selection of subfields. Did you mean \"${fieldName} { ... }\"?`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        } else if (selectionSet.selections.length === 0) {\n          const fieldName = node.name.value;\n          const typeStr = inspect(type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${fieldName}\" of type \"${typeStr}\" must have at least one field selected.`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n","/**\n * Build a string describing the path.\n */\nexport function printPathArray(path) {\n  return path\n    .map((key) =>\n      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,\n    )\n    .join('');\n}\n","/**\n * Given a Path and a key, return a new Path containing the new key.\n */\nexport function addPath(prev, key, typename) {\n  return {\n    prev,\n    key,\n    typename,\n  };\n}\n/**\n * Given a Path, return an Array of the path keys.\n */\n\nexport function pathToArray(path) {\n  const flattened = [];\n  let curr = path;\n\n  while (curr) {\n    flattened.push(curr.key);\n    curr = curr.prev;\n  }\n\n  return flattened.reverse();\n}\n","import { didYouMean } from '../jsutils/didYouMean.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isIterableObject } from '../jsutils/isIterableObject.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { addPath, pathToArray } from '../jsutils/Path.mjs';\nimport { printPathArray } from '../jsutils/printPathArray.mjs';\nimport { suggestionList } from '../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport {\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\n\n/**\n * Coerces a JavaScript value given a GraphQL Input Type.\n */\nexport function coerceInputValue(inputValue, type, onError = defaultOnError) {\n  return coerceInputValueImpl(inputValue, type, onError, undefined);\n}\n\nfunction defaultOnError(path, invalidValue, error) {\n  let errorPrefix = 'Invalid value ' + inspect(invalidValue);\n\n  if (path.length > 0) {\n    errorPrefix += ` at \"value${printPathArray(path)}\"`;\n  }\n\n  error.message = errorPrefix + ': ' + error.message;\n  throw error;\n}\n\nfunction coerceInputValueImpl(inputValue, type, onError, path) {\n  if (isNonNullType(type)) {\n    if (inputValue != null) {\n      return coerceInputValueImpl(inputValue, type.ofType, onError, path);\n    }\n\n    onError(\n      pathToArray(path),\n      inputValue,\n      new GraphQLError(\n        `Expected non-nullable type \"${inspect(type)}\" not to be null.`,\n      ),\n    );\n    return;\n  }\n\n  if (inputValue == null) {\n    // Explicitly return the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (isIterableObject(inputValue)) {\n      return Array.from(inputValue, (itemValue, index) => {\n        const itemPath = addPath(path, index, undefined);\n        return coerceInputValueImpl(itemValue, itemType, onError, itemPath);\n      });\n    } // Lists accept a non-list value as a list of one.\n\n    return [coerceInputValueImpl(inputValue, itemType, onError, path)];\n  }\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(inputValue) || Array.isArray(inputValue)) {\n      onError(\n        pathToArray(path),\n        inputValue,\n        new GraphQLError(`Expected type \"${type.name}\" to be an object.`),\n      );\n      return;\n    }\n\n    const coercedValue = {};\n    const fieldDefs = type.getFields();\n\n    for (const field of Object.values(fieldDefs)) {\n      const fieldValue = inputValue[field.name];\n\n      if (fieldValue === undefined) {\n        if (field.defaultValue !== undefined) {\n          coercedValue[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          const typeStr = inspect(field.type);\n          onError(\n            pathToArray(path),\n            inputValue,\n            new GraphQLError(\n              `Field \"${field.name}\" of required type \"${typeStr}\" was not provided.`,\n            ),\n          );\n        }\n\n        continue;\n      }\n\n      coercedValue[field.name] = coerceInputValueImpl(\n        fieldValue,\n        field.type,\n        onError,\n        addPath(path, field.name, type.name),\n      );\n    } // Ensure every provided field is defined.\n\n    for (const fieldName of Object.keys(inputValue)) {\n      if (!fieldDefs[fieldName]) {\n        const suggestions = suggestionList(\n          fieldName,\n          Object.keys(type.getFields()),\n        );\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(\n            `Field \"${fieldName}\" is not defined by type \"${type.name}\".` +\n              didYouMean(suggestions),\n          ),\n        );\n      }\n    }\n\n    if (type.isOneOf) {\n      const keys = Object.keys(coercedValue);\n\n      if (keys.length !== 1) {\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(\n            `Exactly one key must be specified for OneOf type \"${type.name}\".`,\n          ),\n        );\n      }\n\n      const key = keys[0];\n      const value = coercedValue[key];\n\n      if (value === null) {\n        onError(\n          pathToArray(path).concat(key),\n          value,\n          new GraphQLError(`Field \"${key}\" must be non-null.`),\n        );\n      }\n    }\n\n    return coercedValue;\n  }\n\n  if (isLeafType(type)) {\n    let parseResult; // Scalars and Enums determine if a input value is valid via parseValue(),\n    // which can throw to indicate failure. If it throws, maintain a reference\n    // to the original error.\n\n    try {\n      parseResult = type.parseValue(inputValue);\n    } catch (error) {\n      if (error instanceof GraphQLError) {\n        onError(pathToArray(path), inputValue, error);\n      } else {\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(`Expected type \"${type.name}\". ` + error.message, {\n            originalError: error,\n          }),\n        );\n      }\n\n      return;\n    }\n\n    if (parseResult === undefined) {\n      onError(\n        pathToArray(path),\n        inputValue,\n        new GraphQLError(`Expected type \"${type.name}\".`),\n      );\n    }\n\n    return parseResult;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * GraphQL Value literals.\n *\n * Returns `undefined` when the value could not be validly coerced according to\n * the provided type.\n *\n * | GraphQL Value        | JSON Value    |\n * | -------------------- | ------------- |\n * | Input Object         | Object        |\n * | List                 | Array         |\n * | Boolean              | Boolean       |\n * | String               | String        |\n * | Int / Float          | Number        |\n * | Enum Value           | Unknown       |\n * | NullValue            | null          |\n *\n */\n\nexport function valueFromAST(valueNode, type, variables) {\n  if (!valueNode) {\n    // When there is no node, then there is also no value.\n    // Importantly, this is different from returning the value null.\n    return;\n  }\n\n  if (valueNode.kind === Kind.VARIABLE) {\n    const variableName = valueNode.name.value;\n\n    if (variables == null || variables[variableName] === undefined) {\n      // No valid return value.\n      return;\n    }\n\n    const variableValue = variables[variableName];\n\n    if (variableValue === null && isNonNullType(type)) {\n      return; // Invalid: intentionally return no value.\n    } // Note: This does no further checking that this variable is correct.\n    // This assumes that this query has been validated and the variable\n    // usage here is of the correct type.\n\n    return variableValue;\n  }\n\n  if (isNonNullType(type)) {\n    if (valueNode.kind === Kind.NULL) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return valueFromAST(valueNode, type.ofType, variables);\n  }\n\n  if (valueNode.kind === Kind.NULL) {\n    // This is explicitly returning the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (valueNode.kind === Kind.LIST) {\n      const coercedValues = [];\n\n      for (const itemNode of valueNode.values) {\n        if (isMissingVariable(itemNode, variables)) {\n          // If an array contains a missing variable, it is either coerced to\n          // null or if the item type is non-null, it considered invalid.\n          if (isNonNullType(itemType)) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(null);\n        } else {\n          const itemValue = valueFromAST(itemNode, itemType, variables);\n\n          if (itemValue === undefined) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(itemValue);\n        }\n      }\n\n      return coercedValues;\n    }\n\n    const coercedValue = valueFromAST(valueNode, itemType, variables);\n\n    if (coercedValue === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return [coercedValue];\n  }\n\n  if (isInputObjectType(type)) {\n    if (valueNode.kind !== Kind.OBJECT) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    const coercedObj = Object.create(null);\n    const fieldNodes = keyMap(valueNode.fields, (field) => field.name.value);\n\n    for (const field of Object.values(type.getFields())) {\n      const fieldNode = fieldNodes[field.name];\n\n      if (!fieldNode || isMissingVariable(fieldNode.value, variables)) {\n        if (field.defaultValue !== undefined) {\n          coercedObj[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          return; // Invalid: intentionally return no value.\n        }\n\n        continue;\n      }\n\n      const fieldValue = valueFromAST(fieldNode.value, field.type, variables);\n\n      if (fieldValue === undefined) {\n        return; // Invalid: intentionally return no value.\n      }\n\n      coercedObj[field.name] = fieldValue;\n    }\n\n    if (type.isOneOf) {\n      const keys = Object.keys(coercedObj);\n\n      if (keys.length !== 1) {\n        return; // Invalid: not exactly one key, intentionally return no value.\n      }\n\n      if (coercedObj[keys[0]] === null) {\n        return; // Invalid: value not non-null, intentionally return no value.\n      }\n    }\n\n    return coercedObj;\n  }\n\n  if (isLeafType(type)) {\n    // Scalars and Enums fulfill parsing a literal value via parseLiteral().\n    // Invalid values represent a failure to parse correctly, in which case\n    // no value is returned.\n    let result;\n\n    try {\n      result = type.parseLiteral(valueNode, variables);\n    } catch (_error) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    if (result === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return result;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible input types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n} // Returns true if the provided valueNode is a variable which is not defined\n// in the set of variables.\n\nfunction isMissingVariable(valueNode, variables) {\n  return (\n    valueNode.kind === Kind.VARIABLE &&\n    (variables == null || variables[valueNode.name.value] === undefined)\n  );\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { printPathArray } from '../jsutils/printPathArray.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { isInputType, isNonNullType } from '../type/definition.mjs';\nimport { coerceInputValue } from '../utilities/coerceInputValue.mjs';\nimport { typeFromAST } from '../utilities/typeFromAST.mjs';\nimport { valueFromAST } from '../utilities/valueFromAST.mjs';\n\n/**\n * Prepares an object map of variableValues of the correct type based on the\n * provided variable definitions and arbitrary input. If the input cannot be\n * parsed to match the variable definitions, a GraphQLError will be thrown.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\nexport function getVariableValues(schema, varDefNodes, inputs, options) {\n  const errors = [];\n  const maxErrors =\n    options === null || options === void 0 ? void 0 : options.maxErrors;\n\n  try {\n    const coerced = coerceVariableValues(\n      schema,\n      varDefNodes,\n      inputs,\n      (error) => {\n        if (maxErrors != null && errors.length >= maxErrors) {\n          throw new GraphQLError(\n            'Too many errors processing variables, error limit reached. Execution aborted.',\n          );\n        }\n\n        errors.push(error);\n      },\n    );\n\n    if (errors.length === 0) {\n      return {\n        coerced,\n      };\n    }\n  } catch (error) {\n    errors.push(error);\n  }\n\n  return {\n    errors,\n  };\n}\n\nfunction coerceVariableValues(schema, varDefNodes, inputs, onError) {\n  const coercedValues = {};\n\n  for (const varDefNode of varDefNodes) {\n    const varName = varDefNode.variable.name.value;\n    const varType = typeFromAST(schema, varDefNode.type);\n\n    if (!isInputType(varType)) {\n      // Must use input types for variables. This should be caught during\n      // validation, however is checked again here for safety.\n      const varTypeStr = print(varDefNode.type);\n      onError(\n        new GraphQLError(\n          `Variable \"$${varName}\" expected value of type \"${varTypeStr}\" which cannot be used as an input type.`,\n          {\n            nodes: varDefNode.type,\n          },\n        ),\n      );\n      continue;\n    }\n\n    if (!hasOwnProperty(inputs, varName)) {\n      if (varDefNode.defaultValue) {\n        coercedValues[varName] = valueFromAST(varDefNode.defaultValue, varType);\n      } else if (isNonNullType(varType)) {\n        const varTypeStr = inspect(varType);\n        onError(\n          new GraphQLError(\n            `Variable \"$${varName}\" of required type \"${varTypeStr}\" was not provided.`,\n            {\n              nodes: varDefNode,\n            },\n          ),\n        );\n      }\n\n      continue;\n    }\n\n    const value = inputs[varName];\n\n    if (value === null && isNonNullType(varType)) {\n      const varTypeStr = inspect(varType);\n      onError(\n        new GraphQLError(\n          `Variable \"$${varName}\" of non-null type \"${varTypeStr}\" must not be null.`,\n          {\n            nodes: varDefNode,\n          },\n        ),\n      );\n      continue;\n    }\n\n    coercedValues[varName] = coerceInputValue(\n      value,\n      varType,\n      (path, invalidValue, error) => {\n        let prefix =\n          `Variable \"$${varName}\" got invalid value ` + inspect(invalidValue);\n\n        if (path.length > 0) {\n          prefix += ` at \"${varName}${printPathArray(path)}\"`;\n        }\n\n        onError(\n          new GraphQLError(prefix + '; ' + error.message, {\n            nodes: varDefNode,\n            originalError: error,\n          }),\n        );\n      },\n    );\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a list of argument\n * definitions and list of argument AST nodes.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\n\nexport function getArgumentValues(def, node, variableValues) {\n  var _node$arguments;\n\n  const coercedValues = {}; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n\n  const argumentNodes =\n    (_node$arguments = node.arguments) !== null && _node$arguments !== void 0\n      ? _node$arguments\n      : [];\n  const argNodeMap = keyMap(argumentNodes, (arg) => arg.name.value);\n\n  for (const argDef of def.args) {\n    const name = argDef.name;\n    const argType = argDef.type;\n    const argumentNode = argNodeMap[name];\n\n    if (!argumentNode) {\n      if (argDef.defaultValue !== undefined) {\n        coercedValues[name] = argDef.defaultValue;\n      } else if (isNonNullType(argType)) {\n        throw new GraphQLError(\n          `Argument \"${name}\" of required type \"${inspect(argType)}\" ` +\n            'was not provided.',\n          {\n            nodes: node,\n          },\n        );\n      }\n\n      continue;\n    }\n\n    const valueNode = argumentNode.value;\n    let isNull = valueNode.kind === Kind.NULL;\n\n    if (valueNode.kind === Kind.VARIABLE) {\n      const variableName = valueNode.name.value;\n\n      if (\n        variableValues == null ||\n        !hasOwnProperty(variableValues, variableName)\n      ) {\n        if (argDef.defaultValue !== undefined) {\n          coercedValues[name] = argDef.defaultValue;\n        } else if (isNonNullType(argType)) {\n          throw new GraphQLError(\n            `Argument \"${name}\" of required type \"${inspect(argType)}\" ` +\n              `was provided the variable \"$${variableName}\" which was not provided a runtime value.`,\n            {\n              nodes: valueNode,\n            },\n          );\n        }\n\n        continue;\n      }\n\n      isNull = variableValues[variableName] == null;\n    }\n\n    if (isNull && isNonNullType(argType)) {\n      throw new GraphQLError(\n        `Argument \"${name}\" of non-null type \"${inspect(argType)}\" ` +\n          'must not be null.',\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const coercedValue = valueFromAST(valueNode, argType, variableValues);\n\n    if (coercedValue === undefined) {\n      // Note: ValuesOfCorrectTypeRule validation should catch this before\n      // execution. This is a runtime check to ensure execution does not\n      // continue with an invalid argument value.\n      throw new GraphQLError(\n        `Argument \"${name}\" has invalid value ${print(valueNode)}.`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    coercedValues[name] = coercedValue;\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a directive definition\n * and a AST node which may contain directives. Optionally also accepts a map\n * of variable values.\n *\n * If the directive does not exist on the node, returns undefined.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\n\nexport function getDirectiveValues(directiveDef, node, variableValues) {\n  var _node$directives;\n\n  const directiveNode =\n    (_node$directives = node.directives) === null || _node$directives === void 0\n      ? void 0\n      : _node$directives.find(\n          (directive) => directive.name.value === directiveDef.name,\n        );\n\n  if (directiveNode) {\n    return getArgumentValues(directiveDef, directiveNode, variableValues);\n  }\n}\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n","import { Kind } from '../language/kinds.mjs';\nimport { isAbstractType } from '../type/definition.mjs';\nimport {\n  GraphQLIncludeDirective,\n  GraphQLSkipDirective,\n} from '../type/directives.mjs';\nimport { typeFromAST } from '../utilities/typeFromAST.mjs';\nimport { getDirectiveValues } from './values.mjs';\n/**\n * Given a selectionSet, collects all of the fields and returns them.\n *\n * CollectFields requires the \"runtime type\" of an object. For a field that\n * returns an Interface or Union type, the \"runtime type\" will be the actual\n * object type returned by that field.\n *\n * @internal\n */\n\nexport function collectFields(\n  schema,\n  fragments,\n  variableValues,\n  runtimeType,\n  selectionSet,\n) {\n  const fields = new Map();\n  collectFieldsImpl(\n    schema,\n    fragments,\n    variableValues,\n    runtimeType,\n    selectionSet,\n    fields,\n    new Set(),\n  );\n  return fields;\n}\n/**\n * Given an array of field nodes, collects all of the subfields of the passed\n * in fields, and returns them at the end.\n *\n * CollectSubFields requires the \"return type\" of an object. For a field that\n * returns an Interface or Union type, the \"return type\" will be the actual\n * object type returned by that field.\n *\n * @internal\n */\n\nexport function collectSubfields(\n  schema,\n  fragments,\n  variableValues,\n  returnType,\n  fieldNodes,\n) {\n  const subFieldNodes = new Map();\n  const visitedFragmentNames = new Set();\n\n  for (const node of fieldNodes) {\n    if (node.selectionSet) {\n      collectFieldsImpl(\n        schema,\n        fragments,\n        variableValues,\n        returnType,\n        node.selectionSet,\n        subFieldNodes,\n        visitedFragmentNames,\n      );\n    }\n  }\n\n  return subFieldNodes;\n}\n\nfunction collectFieldsImpl(\n  schema,\n  fragments,\n  variableValues,\n  runtimeType,\n  selectionSet,\n  fields,\n  visitedFragmentNames,\n) {\n  for (const selection of selectionSet.selections) {\n    switch (selection.kind) {\n      case Kind.FIELD: {\n        if (!shouldIncludeNode(variableValues, selection)) {\n          continue;\n        }\n\n        const name = getFieldEntryKey(selection);\n        const fieldList = fields.get(name);\n\n        if (fieldList !== undefined) {\n          fieldList.push(selection);\n        } else {\n          fields.set(name, [selection]);\n        }\n\n        break;\n      }\n\n      case Kind.INLINE_FRAGMENT: {\n        if (\n          !shouldIncludeNode(variableValues, selection) ||\n          !doesFragmentConditionMatch(schema, selection, runtimeType)\n        ) {\n          continue;\n        }\n\n        collectFieldsImpl(\n          schema,\n          fragments,\n          variableValues,\n          runtimeType,\n          selection.selectionSet,\n          fields,\n          visitedFragmentNames,\n        );\n        break;\n      }\n\n      case Kind.FRAGMENT_SPREAD: {\n        const fragName = selection.name.value;\n\n        if (\n          visitedFragmentNames.has(fragName) ||\n          !shouldIncludeNode(variableValues, selection)\n        ) {\n          continue;\n        }\n\n        visitedFragmentNames.add(fragName);\n        const fragment = fragments[fragName];\n\n        if (\n          !fragment ||\n          !doesFragmentConditionMatch(schema, fragment, runtimeType)\n        ) {\n          continue;\n        }\n\n        collectFieldsImpl(\n          schema,\n          fragments,\n          variableValues,\n          runtimeType,\n          fragment.selectionSet,\n          fields,\n          visitedFragmentNames,\n        );\n        break;\n      }\n    }\n  }\n}\n/**\n * Determines if a field should be included based on the `@include` and `@skip`\n * directives, where `@skip` has higher precedence than `@include`.\n */\n\nfunction shouldIncludeNode(variableValues, node) {\n  const skip = getDirectiveValues(GraphQLSkipDirective, node, variableValues);\n\n  if ((skip === null || skip === void 0 ? void 0 : skip.if) === true) {\n    return false;\n  }\n\n  const include = getDirectiveValues(\n    GraphQLIncludeDirective,\n    node,\n    variableValues,\n  );\n\n  if (\n    (include === null || include === void 0 ? void 0 : include.if) === false\n  ) {\n    return false;\n  }\n\n  return true;\n}\n/**\n * Determines if a fragment is applicable to the given type.\n */\n\nfunction doesFragmentConditionMatch(schema, fragment, type) {\n  const typeConditionNode = fragment.typeCondition;\n\n  if (!typeConditionNode) {\n    return true;\n  }\n\n  const conditionalType = typeFromAST(schema, typeConditionNode);\n\n  if (conditionalType === type) {\n    return true;\n  }\n\n  if (isAbstractType(conditionalType)) {\n    return schema.isSubType(conditionalType, type);\n  }\n\n  return false;\n}\n/**\n * Implements the logic to compute the key of a given field's entry\n */\n\nfunction getFieldEntryKey(node) {\n  return node.alias ? node.alias.value : node.name.value;\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { collectFields } from '../../execution/collectFields.mjs';\n\n/**\n * Subscriptions must only include a non-introspection field.\n *\n * A GraphQL subscription is valid only if it contains a single root field and\n * that root field is not an introspection field.\n *\n * See https://spec.graphql.org/draft/#sec-Single-root-field\n */\nexport function SingleFieldSubscriptionsRule(context) {\n  return {\n    OperationDefinition(node) {\n      if (node.operation === 'subscription') {\n        const schema = context.getSchema();\n        const subscriptionType = schema.getSubscriptionType();\n\n        if (subscriptionType) {\n          const operationName = node.name ? node.name.value : null;\n          const variableValues = Object.create(null);\n          const document = context.getDocument();\n          const fragments = Object.create(null);\n\n          for (const definition of document.definitions) {\n            if (definition.kind === Kind.FRAGMENT_DEFINITION) {\n              fragments[definition.name.value] = definition;\n            }\n          }\n\n          const fields = collectFields(\n            schema,\n            fragments,\n            variableValues,\n            subscriptionType,\n            node.selectionSet,\n          );\n\n          if (fields.size > 1) {\n            const fieldSelectionLists = [...fields.values()];\n            const extraFieldSelectionLists = fieldSelectionLists.slice(1);\n            const extraFieldSelections = extraFieldSelectionLists.flat();\n            context.reportError(\n              new GraphQLError(\n                operationName != null\n                  ? `Subscription \"${operationName}\" must select only one top level field.`\n                  : 'Anonymous Subscription must select only one top level field.',\n                {\n                  nodes: extraFieldSelections,\n                },\n              ),\n            );\n          }\n\n          for (const fieldNodes of fields.values()) {\n            const field = fieldNodes[0];\n            const fieldName = field.name.value;\n\n            if (fieldName.startsWith('__')) {\n              context.reportError(\n                new GraphQLError(\n                  operationName != null\n                    ? `Subscription \"${operationName}\" must not select an introspection top level field.`\n                    : 'Anonymous Subscription must not select an introspection top level field.',\n                  {\n                    nodes: fieldNodes,\n                  },\n                ),\n              );\n            }\n          }\n        }\n      }\n    },\n  };\n}\n","/**\n * Groups array items into a Map, given a function to produce grouping key.\n */\nexport function groupBy(list, keyFn) {\n  const result = new Map();\n\n  for (const item of list) {\n    const key = keyFn(item);\n    const group = result.get(key);\n\n    if (group === undefined) {\n      result.set(key, [item]);\n    } else {\n      group.push(item);\n    }\n  }\n\n  return result;\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique argument definition names\n *\n * A GraphQL Object or Interface type is only valid if all its fields have uniquely named arguments.\n * A GraphQL Directive is only valid if all its arguments are uniquely named.\n */\nexport function UniqueArgumentDefinitionNamesRule(context) {\n  return {\n    DirectiveDefinition(directiveNode) {\n      var _directiveNode$argume;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argumentNodes =\n        (_directiveNode$argume = directiveNode.arguments) !== null &&\n        _directiveNode$argume !== void 0\n          ? _directiveNode$argume\n          : [];\n      return checkArgUniqueness(`@${directiveNode.name.value}`, argumentNodes);\n    },\n\n    InterfaceTypeDefinition: checkArgUniquenessPerField,\n    InterfaceTypeExtension: checkArgUniquenessPerField,\n    ObjectTypeDefinition: checkArgUniquenessPerField,\n    ObjectTypeExtension: checkArgUniquenessPerField,\n  };\n\n  function checkArgUniquenessPerField(typeNode) {\n    var _typeNode$fields;\n\n    const typeName = typeNode.name.value; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const fieldNodes =\n      (_typeNode$fields = typeNode.fields) !== null &&\n      _typeNode$fields !== void 0\n        ? _typeNode$fields\n        : [];\n\n    for (const fieldDef of fieldNodes) {\n      var _fieldDef$arguments;\n\n      const fieldName = fieldDef.name.value; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n\n      const argumentNodes =\n        (_fieldDef$arguments = fieldDef.arguments) !== null &&\n        _fieldDef$arguments !== void 0\n          ? _fieldDef$arguments\n          : [];\n      checkArgUniqueness(`${typeName}.${fieldName}`, argumentNodes);\n    }\n\n    return false;\n  }\n\n  function checkArgUniqueness(parentName, argumentNodes) {\n    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);\n\n    for (const [argName, argNodes] of seenArgs) {\n      if (argNodes.length > 1) {\n        context.reportError(\n          new GraphQLError(\n            `Argument \"${parentName}(${argName}:)\" can only be defined once.`,\n            {\n              nodes: argNodes.map((node) => node.name),\n            },\n          ),\n        );\n      }\n    }\n\n    return false;\n  }\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique argument names\n *\n * A GraphQL field or directive is only valid if all supplied arguments are\n * uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Argument-Names\n */\nexport function UniqueArgumentNamesRule(context) {\n  return {\n    Field: checkArgUniqueness,\n    Directive: checkArgUniqueness,\n  };\n\n  function checkArgUniqueness(parentNode) {\n    var _parentNode$arguments;\n\n    // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n    const argumentNodes =\n      (_parentNode$arguments = parentNode.arguments) !== null &&\n      _parentNode$arguments !== void 0\n        ? _parentNode$arguments\n        : [];\n    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);\n\n    for (const [argName, argNodes] of seenArgs) {\n      if (argNodes.length > 1) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one argument named \"${argName}\".`,\n            {\n              nodes: argNodes.map((node) => node.name),\n            },\n          ),\n        );\n      }\n    }\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique directive names\n *\n * A GraphQL document is only valid if all defined directives have unique names.\n */\nexport function UniqueDirectiveNamesRule(context) {\n  const knownDirectiveNames = Object.create(null);\n  const schema = context.getSchema();\n  return {\n    DirectiveDefinition(node) {\n      const directiveName = node.name.value;\n\n      if (\n        schema !== null &&\n        schema !== void 0 &&\n        schema.getDirective(directiveName)\n      ) {\n        context.reportError(\n          new GraphQLError(\n            `Directive \"@${directiveName}\" already exists in the schema. It cannot be redefined.`,\n            {\n              nodes: node.name,\n            },\n          ),\n        );\n        return;\n      }\n\n      if (knownDirectiveNames[directiveName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one directive named \"@${directiveName}\".`,\n            {\n              nodes: [knownDirectiveNames[directiveName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownDirectiveNames[directiveName] = node.name;\n      }\n\n      return false;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeExtensionNode,\n} from '../../language/predicates.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Unique directive names per location\n *\n * A GraphQL document is only valid if all non-repeatable directives at\n * a given location are uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Directives-Are-Unique-Per-Location\n */\nexport function UniqueDirectivesPerLocationRule(context) {\n  const uniqueDirectiveMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    uniqueDirectiveMap[directive.name] = !directive.isRepeatable;\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      uniqueDirectiveMap[def.name.value] = !def.repeatable;\n    }\n  }\n\n  const schemaDirectives = Object.create(null);\n  const typeDirectivesMap = Object.create(null);\n  return {\n    // Many different AST nodes may contain directives. Rather than listing\n    // them all, just listen for entering any node, and check to see if it\n    // defines any directives.\n    enter(node) {\n      if (!('directives' in node) || !node.directives) {\n        return;\n      }\n\n      let seenDirectives;\n\n      if (\n        node.kind === Kind.SCHEMA_DEFINITION ||\n        node.kind === Kind.SCHEMA_EXTENSION\n      ) {\n        seenDirectives = schemaDirectives;\n      } else if (isTypeDefinitionNode(node) || isTypeExtensionNode(node)) {\n        const typeName = node.name.value;\n        seenDirectives = typeDirectivesMap[typeName];\n\n        if (seenDirectives === undefined) {\n          typeDirectivesMap[typeName] = seenDirectives = Object.create(null);\n        }\n      } else {\n        seenDirectives = Object.create(null);\n      }\n\n      for (const directive of node.directives) {\n        const directiveName = directive.name.value;\n\n        if (uniqueDirectiveMap[directiveName]) {\n          if (seenDirectives[directiveName]) {\n            context.reportError(\n              new GraphQLError(\n                `The directive \"@${directiveName}\" can only be used once at this location.`,\n                {\n                  nodes: [seenDirectives[directiveName], directive],\n                },\n              ),\n            );\n          } else {\n            seenDirectives[directiveName] = directive;\n          }\n        }\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { isEnumType } from '../../type/definition.mjs';\n\n/**\n * Unique enum value names\n *\n * A GraphQL enum type is only valid if all its values are uniquely named.\n */\nexport function UniqueEnumValueNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  const knownValueNames = Object.create(null);\n  return {\n    EnumTypeDefinition: checkValueUniqueness,\n    EnumTypeExtension: checkValueUniqueness,\n  };\n\n  function checkValueUniqueness(node) {\n    var _node$values;\n\n    const typeName = node.name.value;\n\n    if (!knownValueNames[typeName]) {\n      knownValueNames[typeName] = Object.create(null);\n    } // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const valueNodes =\n      (_node$values = node.values) !== null && _node$values !== void 0\n        ? _node$values\n        : [];\n    const valueNames = knownValueNames[typeName];\n\n    for (const valueDef of valueNodes) {\n      const valueName = valueDef.name.value;\n      const existingType = existingTypeMap[typeName];\n\n      if (isEnumType(existingType) && existingType.getValue(valueName)) {\n        context.reportError(\n          new GraphQLError(\n            `Enum value \"${typeName}.${valueName}\" already exists in the schema. It cannot also be defined in this type extension.`,\n            {\n              nodes: valueDef.name,\n            },\n          ),\n        );\n      } else if (valueNames[valueName]) {\n        context.reportError(\n          new GraphQLError(\n            `Enum value \"${typeName}.${valueName}\" can only be defined once.`,\n            {\n              nodes: [valueNames[valueName], valueDef.name],\n            },\n          ),\n        );\n      } else {\n        valueNames[valueName] = valueDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n} from '../../type/definition.mjs';\n\n/**\n * Unique field definition names\n *\n * A GraphQL complex type is only valid if all its fields are uniquely named.\n */\nexport function UniqueFieldDefinitionNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  const knownFieldNames = Object.create(null);\n  return {\n    InputObjectTypeDefinition: checkFieldUniqueness,\n    InputObjectTypeExtension: checkFieldUniqueness,\n    InterfaceTypeDefinition: checkFieldUniqueness,\n    InterfaceTypeExtension: checkFieldUniqueness,\n    ObjectTypeDefinition: checkFieldUniqueness,\n    ObjectTypeExtension: checkFieldUniqueness,\n  };\n\n  function checkFieldUniqueness(node) {\n    var _node$fields;\n\n    const typeName = node.name.value;\n\n    if (!knownFieldNames[typeName]) {\n      knownFieldNames[typeName] = Object.create(null);\n    } // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const fieldNodes =\n      (_node$fields = node.fields) !== null && _node$fields !== void 0\n        ? _node$fields\n        : [];\n    const fieldNames = knownFieldNames[typeName];\n\n    for (const fieldDef of fieldNodes) {\n      const fieldName = fieldDef.name.value;\n\n      if (hasField(existingTypeMap[typeName], fieldName)) {\n        context.reportError(\n          new GraphQLError(\n            `Field \"${typeName}.${fieldName}\" already exists in the schema. It cannot also be defined in this type extension.`,\n            {\n              nodes: fieldDef.name,\n            },\n          ),\n        );\n      } else if (fieldNames[fieldName]) {\n        context.reportError(\n          new GraphQLError(\n            `Field \"${typeName}.${fieldName}\" can only be defined once.`,\n            {\n              nodes: [fieldNames[fieldName], fieldDef.name],\n            },\n          ),\n        );\n      } else {\n        fieldNames[fieldName] = fieldDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n\nfunction hasField(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type) || isInputObjectType(type)) {\n    return type.getFields()[fieldName] != null;\n  }\n\n  return false;\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique fragment names\n *\n * A GraphQL document is only valid if all defined fragments have unique names.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-Name-Uniqueness\n */\nexport function UniqueFragmentNamesRule(context) {\n  const knownFragmentNames = Object.create(null);\n  return {\n    OperationDefinition: () => false,\n\n    FragmentDefinition(node) {\n      const fragmentName = node.name.value;\n\n      if (knownFragmentNames[fragmentName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one fragment named \"${fragmentName}\".`,\n            {\n              nodes: [knownFragmentNames[fragmentName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownFragmentNames[fragmentName] = node.name;\n      }\n\n      return false;\n    },\n  };\n}\n","import { invariant } from '../../jsutils/invariant.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique input field names\n *\n * A GraphQL input object value is only valid if all supplied fields are\n * uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Input-Object-Field-Uniqueness\n */\nexport function UniqueInputFieldNamesRule(context) {\n  const knownNameStack = [];\n  let knownNames = Object.create(null);\n  return {\n    ObjectValue: {\n      enter() {\n        knownNameStack.push(knownNames);\n        knownNames = Object.create(null);\n      },\n\n      leave() {\n        const prevKnownNames = knownNameStack.pop();\n        prevKnownNames || invariant(false);\n        knownNames = prevKnownNames;\n      },\n    },\n\n    ObjectField(node) {\n      const fieldName = node.name.value;\n\n      if (knownNames[fieldName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one input field named \"${fieldName}\".`,\n            {\n              nodes: [knownNames[fieldName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownNames[fieldName] = node.name;\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique operation names\n *\n * A GraphQL document is only valid if all defined operations have unique names.\n *\n * See https://spec.graphql.org/draft/#sec-Operation-Name-Uniqueness\n */\nexport function UniqueOperationNamesRule(context) {\n  const knownOperationNames = Object.create(null);\n  return {\n    OperationDefinition(node) {\n      const operationName = node.name;\n\n      if (operationName) {\n        if (knownOperationNames[operationName.value]) {\n          context.reportError(\n            new GraphQLError(\n              `There can be only one operation named \"${operationName.value}\".`,\n              {\n                nodes: [\n                  knownOperationNames[operationName.value],\n                  operationName,\n                ],\n              },\n            ),\n          );\n        } else {\n          knownOperationNames[operationName.value] = operationName;\n        }\n      }\n\n      return false;\n    },\n\n    FragmentDefinition: () => false,\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique operation types\n *\n * A GraphQL document is only valid if it has only one type per operation.\n */\nexport function UniqueOperationTypesRule(context) {\n  const schema = context.getSchema();\n  const definedOperationTypes = Object.create(null);\n  const existingOperationTypes = schema\n    ? {\n        query: schema.getQueryType(),\n        mutation: schema.getMutationType(),\n        subscription: schema.getSubscriptionType(),\n      }\n    : {};\n  return {\n    SchemaDefinition: checkOperationTypes,\n    SchemaExtension: checkOperationTypes,\n  };\n\n  function checkOperationTypes(node) {\n    var _node$operationTypes;\n\n    // See: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n    const operationTypesNodes =\n      (_node$operationTypes = node.operationTypes) !== null &&\n      _node$operationTypes !== void 0\n        ? _node$operationTypes\n        : [];\n\n    for (const operationType of operationTypesNodes) {\n      const operation = operationType.operation;\n      const alreadyDefinedOperationType = definedOperationTypes[operation];\n\n      if (existingOperationTypes[operation]) {\n        context.reportError(\n          new GraphQLError(\n            `Type for ${operation} already defined in the schema. It cannot be redefined.`,\n            {\n              nodes: operationType,\n            },\n          ),\n        );\n      } else if (alreadyDefinedOperationType) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one ${operation} type in schema.`,\n            {\n              nodes: [alreadyDefinedOperationType, operationType],\n            },\n          ),\n        );\n      } else {\n        definedOperationTypes[operation] = operationType;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique type names\n *\n * A GraphQL document is only valid if all defined types have unique names.\n */\nexport function UniqueTypeNamesRule(context) {\n  const knownTypeNames = Object.create(null);\n  const schema = context.getSchema();\n  return {\n    ScalarTypeDefinition: checkTypeName,\n    ObjectTypeDefinition: checkTypeName,\n    InterfaceTypeDefinition: checkTypeName,\n    UnionTypeDefinition: checkTypeName,\n    EnumTypeDefinition: checkTypeName,\n    InputObjectTypeDefinition: checkTypeName,\n  };\n\n  function checkTypeName(node) {\n    const typeName = node.name.value;\n\n    if (schema !== null && schema !== void 0 && schema.getType(typeName)) {\n      context.reportError(\n        new GraphQLError(\n          `Type \"${typeName}\" already exists in the schema. It cannot also be defined in this type definition.`,\n          {\n            nodes: node.name,\n          },\n        ),\n      );\n      return;\n    }\n\n    if (knownTypeNames[typeName]) {\n      context.reportError(\n        new GraphQLError(`There can be only one type named \"${typeName}\".`, {\n          nodes: [knownTypeNames[typeName], node.name],\n        }),\n      );\n    } else {\n      knownTypeNames[typeName] = node.name;\n    }\n\n    return false;\n  }\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique variable names\n *\n * A GraphQL operation is only valid if all its variables are uniquely named.\n */\nexport function UniqueVariableNamesRule(context) {\n  return {\n    OperationDefinition(operationNode) {\n      var _operationNode$variab;\n\n      // See: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const variableDefinitions =\n        (_operationNode$variab = operationNode.variableDefinitions) !== null &&\n        _operationNode$variab !== void 0\n          ? _operationNode$variab\n          : [];\n      const seenVariableDefinitions = groupBy(\n        variableDefinitions,\n        (node) => node.variable.name.value,\n      );\n\n      for (const [variableName, variableNodes] of seenVariableDefinitions) {\n        if (variableNodes.length > 1) {\n          context.reportError(\n            new GraphQLError(\n              `There can be only one variable named \"$${variableName}\".`,\n              {\n                nodes: variableNodes.map((node) => node.variable.name),\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { inspect } from '../../jsutils/inspect.mjs';\nimport { keyMap } from '../../jsutils/keyMap.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport {\n  getNamedType,\n  getNullableType,\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n  isRequiredInputField,\n} from '../../type/definition.mjs';\n\n/**\n * Value literals of correct type\n *\n * A GraphQL document is only valid if all value literals are of the type\n * expected at their position.\n *\n * See https://spec.graphql.org/draft/#sec-Values-of-Correct-Type\n */\nexport function ValuesOfCorrectTypeRule(context) {\n  let variableDefinitions = {};\n  return {\n    OperationDefinition: {\n      enter() {\n        variableDefinitions = {};\n      },\n    },\n\n    VariableDefinition(definition) {\n      variableDefinitions[definition.variable.name.value] = definition;\n    },\n\n    ListValue(node) {\n      // Note: TypeInfo will traverse into a list's item type, so look to the\n      // parent input type to check if it is a list.\n      const type = getNullableType(context.getParentInputType());\n\n      if (!isListType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      }\n    },\n\n    ObjectValue(node) {\n      const type = getNamedType(context.getInputType());\n\n      if (!isInputObjectType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      } // Ensure every required field exists.\n\n      const fieldNodeMap = keyMap(node.fields, (field) => field.name.value);\n\n      for (const fieldDef of Object.values(type.getFields())) {\n        const fieldNode = fieldNodeMap[fieldDef.name];\n\n        if (!fieldNode && isRequiredInputField(fieldDef)) {\n          const typeStr = inspect(fieldDef.type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${type.name}.${fieldDef.name}\" of required type \"${typeStr}\" was not provided.`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n\n      if (type.isOneOf) {\n        validateOneOfInputObject(context, node, type, fieldNodeMap);\n      }\n    },\n\n    ObjectField(node) {\n      const parentType = getNamedType(context.getParentInputType());\n      const fieldType = context.getInputType();\n\n      if (!fieldType && isInputObjectType(parentType)) {\n        const suggestions = suggestionList(\n          node.name.value,\n          Object.keys(parentType.getFields()),\n        );\n        context.reportError(\n          new GraphQLError(\n            `Field \"${node.name.value}\" is not defined by type \"${parentType.name}\".` +\n              didYouMean(suggestions),\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    NullValue(node) {\n      const type = context.getInputType();\n\n      if (isNonNullType(type)) {\n        context.reportError(\n          new GraphQLError(\n            `Expected value of type \"${inspect(type)}\", found ${print(node)}.`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    EnumValue: (node) => isValidValueNode(context, node),\n    IntValue: (node) => isValidValueNode(context, node),\n    FloatValue: (node) => isValidValueNode(context, node),\n    StringValue: (node) => isValidValueNode(context, node),\n    BooleanValue: (node) => isValidValueNode(context, node),\n  };\n}\n/**\n * Any value literal may be a valid representation of a Scalar, depending on\n * that scalar type.\n */\n\nfunction isValidValueNode(context, node) {\n  // Report any error at the full type expected by the location.\n  const locationType = context.getInputType();\n\n  if (!locationType) {\n    return;\n  }\n\n  const type = getNamedType(locationType);\n\n  if (!isLeafType(type)) {\n    const typeStr = inspect(locationType);\n    context.reportError(\n      new GraphQLError(\n        `Expected value of type \"${typeStr}\", found ${print(node)}.`,\n        {\n          nodes: node,\n        },\n      ),\n    );\n    return;\n  } // Scalars and Enums determine if a literal value is valid via parseLiteral(),\n  // which may throw or return an invalid value to indicate failure.\n\n  try {\n    const parseResult = type.parseLiteral(\n      node,\n      undefined,\n      /* variables */\n    );\n\n    if (parseResult === undefined) {\n      const typeStr = inspect(locationType);\n      context.reportError(\n        new GraphQLError(\n          `Expected value of type \"${typeStr}\", found ${print(node)}.`,\n          {\n            nodes: node,\n          },\n        ),\n      );\n    }\n  } catch (error) {\n    const typeStr = inspect(locationType);\n\n    if (error instanceof GraphQLError) {\n      context.reportError(error);\n    } else {\n      context.reportError(\n        new GraphQLError(\n          `Expected value of type \"${typeStr}\", found ${print(node)}; ` +\n            error.message,\n          {\n            nodes: node,\n            originalError: error,\n          },\n        ),\n      );\n    }\n  }\n}\n\nfunction validateOneOfInputObject(context, node, type, fieldNodeMap) {\n  var _fieldNodeMap$keys$;\n\n  const keys = Object.keys(fieldNodeMap);\n  const isNotExactlyOneField = keys.length !== 1;\n\n  if (isNotExactlyOneField) {\n    context.reportError(\n      new GraphQLError(\n        `OneOf Input Object \"${type.name}\" must specify exactly one key.`,\n        {\n          nodes: [node],\n        },\n      ),\n    );\n    return;\n  }\n\n  const value =\n    (_fieldNodeMap$keys$ = fieldNodeMap[keys[0]]) === null ||\n    _fieldNodeMap$keys$ === void 0\n      ? void 0\n      : _fieldNodeMap$keys$.value;\n  const isNullLiteral = !value || value.kind === Kind.NULL;\n\n  if (isNullLiteral) {\n    context.reportError(\n      new GraphQLError(`Field \"${type.name}.${keys[0]}\" must be non-null.`, {\n        nodes: [node],\n      }),\n    );\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isInputType } from '../../type/definition.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Variables are input types\n *\n * A GraphQL operation is only valid if all the variables it defines are of\n * input types (scalar, enum, or input object).\n *\n * See https://spec.graphql.org/draft/#sec-Variables-Are-Input-Types\n */\nexport function VariablesAreInputTypesRule(context) {\n  return {\n    VariableDefinition(node) {\n      const type = typeFromAST(context.getSchema(), node.type);\n\n      if (type !== undefined && !isInputType(type)) {\n        const variableName = node.variable.name.value;\n        const typeName = print(node.type);\n        context.reportError(\n          new GraphQLError(\n            `Variable \"$${variableName}\" cannot be non-input type \"${typeName}\".`,\n            {\n              nodes: node.type,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport {\n  isInputObjectType,\n  isNonNullType,\n  isNullableType,\n} from '../../type/definition.mjs';\nimport { isTypeSubTypeOf } from '../../utilities/typeComparators.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Variables in allowed position\n *\n * Variable usages must be compatible with the arguments they are passed to.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variable-Usages-are-Allowed\n */\nexport function VariablesInAllowedPositionRule(context) {\n  let varDefMap = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter() {\n        varDefMap = Object.create(null);\n      },\n\n      leave(operation) {\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node, type, defaultValue, parentType } of usages) {\n          const varName = node.name.value;\n          const varDef = varDefMap[varName];\n\n          if (varDef && type) {\n            // A var type is allowed if it is the same or more strict (e.g. is\n            // a subtype of) than the expected type. It can be more strict if\n            // the variable type is non-null when the expected type is nullable.\n            // If both are list types, the variable item type can be more strict\n            // than the expected item type (contravariant).\n            const schema = context.getSchema();\n            const varType = typeFromAST(schema, varDef.type);\n\n            if (\n              varType &&\n              !allowedVariableUsage(\n                schema,\n                varType,\n                varDef.defaultValue,\n                type,\n                defaultValue,\n              )\n            ) {\n              const varTypeStr = inspect(varType);\n              const typeStr = inspect(type);\n              context.reportError(\n                new GraphQLError(\n                  `Variable \"$${varName}\" of type \"${varTypeStr}\" used in position expecting type \"${typeStr}\".`,\n                  {\n                    nodes: [varDef, node],\n                  },\n                ),\n              );\n            }\n\n            if (\n              isInputObjectType(parentType) &&\n              parentType.isOneOf &&\n              isNullableType(varType)\n            ) {\n              context.reportError(\n                new GraphQLError(\n                  `Variable \"$${varName}\" is of type \"${varType}\" but must be non-nullable to be used for OneOf Input Object \"${parentType}\".`,\n                  {\n                    nodes: [varDef, node],\n                  },\n                ),\n              );\n            }\n          }\n        }\n      },\n    },\n\n    VariableDefinition(node) {\n      varDefMap[node.variable.name.value] = node;\n    },\n  };\n}\n/**\n * Returns true if the variable is allowed in the location it was found,\n * which includes considering if default values exist for either the variable\n * or the location at which it is located.\n */\n\nfunction allowedVariableUsage(\n  schema,\n  varType,\n  varDefaultValue,\n  locationType,\n  locationDefaultValue,\n) {\n  if (isNonNullType(locationType) && !isNonNullType(varType)) {\n    const hasNonNullVariableDefaultValue =\n      varDefaultValue != null && varDefaultValue.kind !== Kind.NULL;\n    const hasLocationDefaultValue = locationDefaultValue !== undefined;\n\n    if (!hasNonNullVariableDefaultValue && !hasLocationDefaultValue) {\n      return false;\n    }\n\n    const nullableLocationType = locationType.ofType;\n    return isTypeSubTypeOf(schema, varType, nullableLocationType);\n  }\n\n  return isTypeSubTypeOf(schema, varType, locationType);\n}\n","// Spec Section: \"Executable Definitions\"\nimport { ExecutableDefinitionsRule } from './rules/ExecutableDefinitionsRule.mjs'; // Spec Section: \"Field Selections on Objects, Interfaces, and Unions Types\"\n\nimport { FieldsOnCorrectTypeRule } from './rules/FieldsOnCorrectTypeRule.mjs'; // Spec Section: \"Fragments on Composite Types\"\n\nimport { FragmentsOnCompositeTypesRule } from './rules/FragmentsOnCompositeTypesRule.mjs'; // Spec Section: \"Argument Names\"\n\nimport {\n  KnownArgumentNamesOnDirectivesRule,\n  KnownArgumentNamesRule,\n} from './rules/KnownArgumentNamesRule.mjs'; // Spec Section: \"Directives Are Defined\"\n\nimport { KnownDirectivesRule } from './rules/KnownDirectivesRule.mjs'; // Spec Section: \"Fragment spread target defined\"\n\nimport { KnownFragmentNamesRule } from './rules/KnownFragmentNamesRule.mjs'; // Spec Section: \"Fragment Spread Type Existence\"\n\nimport { KnownTypeNamesRule } from './rules/KnownTypeNamesRule.mjs'; // Spec Section: \"Lone Anonymous Operation\"\n\nimport { LoneAnonymousOperationRule } from './rules/LoneAnonymousOperationRule.mjs'; // SDL-specific validation rules\n\nimport { LoneSchemaDefinitionRule } from './rules/LoneSchemaDefinitionRule.mjs'; // TODO: Spec Section\n\nimport { MaxIntrospectionDepthRule } from './rules/MaxIntrospectionDepthRule.mjs'; // Spec Section: \"Fragments must not form cycles\"\n\nimport { NoFragmentCyclesRule } from './rules/NoFragmentCyclesRule.mjs'; // Spec Section: \"All Variable Used Defined\"\n\nimport { NoUndefinedVariablesRule } from './rules/NoUndefinedVariablesRule.mjs'; // Spec Section: \"Fragments must be used\"\n\nimport { NoUnusedFragmentsRule } from './rules/NoUnusedFragmentsRule.mjs'; // Spec Section: \"All Variables Used\"\n\nimport { NoUnusedVariablesRule } from './rules/NoUnusedVariablesRule.mjs'; // Spec Section: \"Field Selection Merging\"\n\nimport { OverlappingFieldsCanBeMergedRule } from './rules/OverlappingFieldsCanBeMergedRule.mjs'; // Spec Section: \"Fragment spread is possible\"\n\nimport { PossibleFragmentSpreadsRule } from './rules/PossibleFragmentSpreadsRule.mjs';\nimport { PossibleTypeExtensionsRule } from './rules/PossibleTypeExtensionsRule.mjs'; // Spec Section: \"Argument Optionality\"\n\nimport {\n  ProvidedRequiredArgumentsOnDirectivesRule,\n  ProvidedRequiredArgumentsRule,\n} from './rules/ProvidedRequiredArgumentsRule.mjs'; // Spec Section: \"Leaf Field Selections\"\n\nimport { ScalarLeafsRule } from './rules/ScalarLeafsRule.mjs'; // Spec Section: \"Subscriptions with Single Root Field\"\n\nimport { SingleFieldSubscriptionsRule } from './rules/SingleFieldSubscriptionsRule.mjs';\nimport { UniqueArgumentDefinitionNamesRule } from './rules/UniqueArgumentDefinitionNamesRule.mjs'; // Spec Section: \"Argument Uniqueness\"\n\nimport { UniqueArgumentNamesRule } from './rules/UniqueArgumentNamesRule.mjs';\nimport { UniqueDirectiveNamesRule } from './rules/UniqueDirectiveNamesRule.mjs'; // Spec Section: \"Directives Are Unique Per Location\"\n\nimport { UniqueDirectivesPerLocationRule } from './rules/UniqueDirectivesPerLocationRule.mjs';\nimport { UniqueEnumValueNamesRule } from './rules/UniqueEnumValueNamesRule.mjs';\nimport { UniqueFieldDefinitionNamesRule } from './rules/UniqueFieldDefinitionNamesRule.mjs'; // Spec Section: \"Fragment Name Uniqueness\"\n\nimport { UniqueFragmentNamesRule } from './rules/UniqueFragmentNamesRule.mjs'; // Spec Section: \"Input Object Field Uniqueness\"\n\nimport { UniqueInputFieldNamesRule } from './rules/UniqueInputFieldNamesRule.mjs'; // Spec Section: \"Operation Name Uniqueness\"\n\nimport { UniqueOperationNamesRule } from './rules/UniqueOperationNamesRule.mjs';\nimport { UniqueOperationTypesRule } from './rules/UniqueOperationTypesRule.mjs';\nimport { UniqueTypeNamesRule } from './rules/UniqueTypeNamesRule.mjs'; // Spec Section: \"Variable Uniqueness\"\n\nimport { UniqueVariableNamesRule } from './rules/UniqueVariableNamesRule.mjs'; // Spec Section: \"Value Type Correctness\"\n\nimport { ValuesOfCorrectTypeRule } from './rules/ValuesOfCorrectTypeRule.mjs'; // Spec Section: \"Variables are Input Types\"\n\nimport { VariablesAreInputTypesRule } from './rules/VariablesAreInputTypesRule.mjs'; // Spec Section: \"All Variable Usages Are Allowed\"\n\nimport { VariablesInAllowedPositionRule } from './rules/VariablesInAllowedPositionRule.mjs';\n\n/**\n * Technically these aren't part of the spec but they are strongly encouraged\n * validation rules.\n */\nexport const recommendedRules = Object.freeze([MaxIntrospectionDepthRule]);\n/**\n * This set includes all validation rules defined by the GraphQL spec.\n *\n * The order of the rules in this list has been adjusted to lead to the\n * most clear output when encountering multiple validation errors.\n */\n\nexport const specifiedRules = Object.freeze([\n  ExecutableDefinitionsRule,\n  UniqueOperationNamesRule,\n  LoneAnonymousOperationRule,\n  SingleFieldSubscriptionsRule,\n  KnownTypeNamesRule,\n  FragmentsOnCompositeTypesRule,\n  VariablesAreInputTypesRule,\n  ScalarLeafsRule,\n  FieldsOnCorrectTypeRule,\n  UniqueFragmentNamesRule,\n  KnownFragmentNamesRule,\n  NoUnusedFragmentsRule,\n  PossibleFragmentSpreadsRule,\n  NoFragmentCyclesRule,\n  UniqueVariableNamesRule,\n  NoUndefinedVariablesRule,\n  NoUnusedVariablesRule,\n  KnownDirectivesRule,\n  UniqueDirectivesPerLocationRule,\n  KnownArgumentNamesRule,\n  UniqueArgumentNamesRule,\n  ValuesOfCorrectTypeRule,\n  ProvidedRequiredArgumentsRule,\n  VariablesInAllowedPositionRule,\n  OverlappingFieldsCanBeMergedRule,\n  UniqueInputFieldNamesRule,\n  ...recommendedRules,\n]);\n/**\n * @internal\n */\n\nexport const specifiedSDLRules = Object.freeze([\n  LoneSchemaDefinitionRule,\n  UniqueOperationTypesRule,\n  UniqueTypeNamesRule,\n  UniqueEnumValueNamesRule,\n  UniqueFieldDefinitionNamesRule,\n  UniqueArgumentDefinitionNamesRule,\n  UniqueDirectiveNamesRule,\n  KnownTypeNamesRule,\n  KnownDirectivesRule,\n  UniqueDirectivesPerLocationRule,\n  PossibleTypeExtensionsRule,\n  KnownArgumentNamesOnDirectivesRule,\n  UniqueArgumentNamesRule,\n  UniqueInputFieldNamesRule,\n  ProvidedRequiredArgumentsOnDirectivesRule,\n]);\n","import { Kind } from '../language/kinds.mjs';\nimport { visit } from '../language/visitor.mjs';\nimport { TypeInfo, visitWithTypeInfo } from '../utilities/TypeInfo.mjs';\n\n/**\n * An instance of this class is passed as the \"this\" context to all validators,\n * allowing access to commonly useful contextual information from within a\n * validation rule.\n */\nexport class ASTValidationContext {\n  constructor(ast, onError) {\n    this._ast = ast;\n    this._fragments = undefined;\n    this._fragmentSpreads = new Map();\n    this._recursivelyReferencedFragments = new Map();\n    this._onError = onError;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'ASTValidationContext';\n  }\n\n  reportError(error) {\n    this._onError(error);\n  }\n\n  getDocument() {\n    return this._ast;\n  }\n\n  getFragment(name) {\n    let fragments;\n\n    if (this._fragments) {\n      fragments = this._fragments;\n    } else {\n      fragments = Object.create(null);\n\n      for (const defNode of this.getDocument().definitions) {\n        if (defNode.kind === Kind.FRAGMENT_DEFINITION) {\n          fragments[defNode.name.value] = defNode;\n        }\n      }\n\n      this._fragments = fragments;\n    }\n\n    return fragments[name];\n  }\n\n  getFragmentSpreads(node) {\n    let spreads = this._fragmentSpreads.get(node);\n\n    if (!spreads) {\n      spreads = [];\n      const setsToVisit = [node];\n      let set;\n\n      while ((set = setsToVisit.pop())) {\n        for (const selection of set.selections) {\n          if (selection.kind === Kind.FRAGMENT_SPREAD) {\n            spreads.push(selection);\n          } else if (selection.selectionSet) {\n            setsToVisit.push(selection.selectionSet);\n          }\n        }\n      }\n\n      this._fragmentSpreads.set(node, spreads);\n    }\n\n    return spreads;\n  }\n\n  getRecursivelyReferencedFragments(operation) {\n    let fragments = this._recursivelyReferencedFragments.get(operation);\n\n    if (!fragments) {\n      fragments = [];\n      const collectedNames = Object.create(null);\n      const nodesToVisit = [operation.selectionSet];\n      let node;\n\n      while ((node = nodesToVisit.pop())) {\n        for (const spread of this.getFragmentSpreads(node)) {\n          const fragName = spread.name.value;\n\n          if (collectedNames[fragName] !== true) {\n            collectedNames[fragName] = true;\n            const fragment = this.getFragment(fragName);\n\n            if (fragment) {\n              fragments.push(fragment);\n              nodesToVisit.push(fragment.selectionSet);\n            }\n          }\n        }\n      }\n\n      this._recursivelyReferencedFragments.set(operation, fragments);\n    }\n\n    return fragments;\n  }\n}\nexport class SDLValidationContext extends ASTValidationContext {\n  constructor(ast, schema, onError) {\n    super(ast, onError);\n    this._schema = schema;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'SDLValidationContext';\n  }\n\n  getSchema() {\n    return this._schema;\n  }\n}\nexport class ValidationContext extends ASTValidationContext {\n  constructor(schema, ast, typeInfo, onError) {\n    super(ast, onError);\n    this._schema = schema;\n    this._typeInfo = typeInfo;\n    this._variableUsages = new Map();\n    this._recursiveVariableUsages = new Map();\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'ValidationContext';\n  }\n\n  getSchema() {\n    return this._schema;\n  }\n\n  getVariableUsages(node) {\n    let usages = this._variableUsages.get(node);\n\n    if (!usages) {\n      const newUsages = [];\n      const typeInfo = new TypeInfo(this._schema);\n      visit(\n        node,\n        visitWithTypeInfo(typeInfo, {\n          VariableDefinition: () => false,\n\n          Variable(variable) {\n            newUsages.push({\n              node: variable,\n              type: typeInfo.getInputType(),\n              defaultValue: typeInfo.getDefaultValue(),\n              parentType: typeInfo.getParentInputType(),\n            });\n          },\n        }),\n      );\n      usages = newUsages;\n\n      this._variableUsages.set(node, usages);\n    }\n\n    return usages;\n  }\n\n  getRecursiveVariableUsages(operation) {\n    let usages = this._recursiveVariableUsages.get(operation);\n\n    if (!usages) {\n      usages = this.getVariableUsages(operation);\n\n      for (const frag of this.getRecursivelyReferencedFragments(operation)) {\n        usages = usages.concat(this.getVariableUsages(frag));\n      }\n\n      this._recursiveVariableUsages.set(operation, usages);\n    }\n\n    return usages;\n  }\n\n  getType() {\n    return this._typeInfo.getType();\n  }\n\n  getParentType() {\n    return this._typeInfo.getParentType();\n  }\n\n  getInputType() {\n    return this._typeInfo.getInputType();\n  }\n\n  getParentInputType() {\n    return this._typeInfo.getParentInputType();\n  }\n\n  getFieldDef() {\n    return this._typeInfo.getFieldDef();\n  }\n\n  getDirective() {\n    return this._typeInfo.getDirective();\n  }\n\n  getArgument() {\n    return this._typeInfo.getArgument();\n  }\n\n  getEnumValue() {\n    return this._typeInfo.getEnumValue();\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { visit, visitInParallel } from '../language/visitor.mjs';\nimport { assertValidSchema } from '../type/validate.mjs';\nimport { TypeInfo, visitWithTypeInfo } from '../utilities/TypeInfo.mjs';\nimport { specifiedRules, specifiedSDLRules } from './specifiedRules.mjs';\nimport {\n  SDLValidationContext,\n  ValidationContext,\n} from './ValidationContext.mjs';\n/**\n * Implements the \"Validation\" section of the spec.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the document is valid.\n *\n * A list of specific validation rules may be provided. If not provided, the\n * default list of rules defined by the GraphQL specification will be used.\n *\n * Each validation rules is a function which returns a visitor\n * (see the language/visitor API). Visitor methods are expected to return\n * GraphQLErrors, or Arrays of GraphQLErrors when invalid.\n *\n * Validate will stop validation after a `maxErrors` limit has been reached.\n * Attackers can send pathologically invalid queries to induce a DoS attack,\n * so by default `maxErrors` set to 100 errors.\n *\n * Optionally a custom TypeInfo instance may be provided. If not provided, one\n * will be created from the provided schema.\n */\n\nexport function validate(\n  schema,\n  documentAST,\n  rules = specifiedRules,\n  options,\n  /** @deprecated will be removed in 17.0.0 */\n  typeInfo = new TypeInfo(schema),\n) {\n  var _options$maxErrors;\n\n  const maxErrors =\n    (_options$maxErrors =\n      options === null || options === void 0 ? void 0 : options.maxErrors) !==\n      null && _options$maxErrors !== void 0\n      ? _options$maxErrors\n      : 100;\n  documentAST || devAssert(false, 'Must provide document.'); // If the schema used for validation is invalid, throw an error.\n\n  assertValidSchema(schema);\n  const abortObj = Object.freeze({});\n  const errors = [];\n  const context = new ValidationContext(\n    schema,\n    documentAST,\n    typeInfo,\n    (error) => {\n      if (errors.length >= maxErrors) {\n        errors.push(\n          new GraphQLError(\n            'Too many validation errors, error limit reached. Validation aborted.',\n          ),\n        ); // eslint-disable-next-line @typescript-eslint/no-throw-literal\n\n        throw abortObj;\n      }\n\n      errors.push(error);\n    },\n  ); // This uses a specialized visitor which runs multiple visitors in parallel,\n  // while maintaining the visitor skip and break API.\n\n  const visitor = visitInParallel(rules.map((rule) => rule(context))); // Visit the whole document with each instance of all provided rules.\n\n  try {\n    visit(documentAST, visitWithTypeInfo(typeInfo, visitor));\n  } catch (e) {\n    if (e !== abortObj) {\n      throw e;\n    }\n  }\n\n  return errors;\n}\n/**\n * @internal\n */\n\nexport function validateSDL(\n  documentAST,\n  schemaToExtend,\n  rules = specifiedSDLRules,\n) {\n  const errors = [];\n  const context = new SDLValidationContext(\n    documentAST,\n    schemaToExtend,\n    (error) => {\n      errors.push(error);\n    },\n  );\n  const visitors = rules.map((rule) => rule(context));\n  visit(documentAST, visitInParallel(visitors));\n  return errors;\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDL(documentAST) {\n  const errors = validateSDL(documentAST);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDLExtension(documentAST, schema) {\n  const errors = validateSDL(documentAST, schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { mapValue } from '../jsutils/mapValue.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeExtensionNode,\n} from '../language/predicates.mjs';\nimport {\n  GraphQLEnumType,\n  GraphQLInputObjectType,\n  GraphQLInterfaceType,\n  GraphQLList,\n  GraphQLNonNull,\n  GraphQLObjectType,\n  GraphQLScalarType,\n  GraphQLUnionType,\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../type/definition.mjs';\nimport {\n  GraphQLDeprecatedDirective,\n  GraphQLDirective,\n  GraphQLOneOfDirective,\n  GraphQLSpecifiedByDirective,\n} from '../type/directives.mjs';\nimport {\n  introspectionTypes,\n  isIntrospectionType,\n} from '../type/introspection.mjs';\nimport {\n  isSpecifiedScalarType,\n  specifiedScalarTypes,\n} from '../type/scalars.mjs';\nimport { assertSchema, GraphQLSchema } from '../type/schema.mjs';\nimport { assertValidSDLExtension } from '../validation/validate.mjs';\nimport { getDirectiveValues } from '../execution/values.mjs';\nimport { valueFromAST } from './valueFromAST.mjs';\n\n/**\n * Produces a new schema given an existing schema and a document which may\n * contain GraphQL type extensions and definitions. The original schema will\n * remain unaltered.\n *\n * Because a schema represents a graph of references, a schema cannot be\n * extended without effectively making an entire copy. We do not know until it's\n * too late if subgraphs remain unchanged.\n *\n * This algorithm copies the provided schema, applying extensions while\n * producing the copy. The original schema remains unaltered.\n */\nexport function extendSchema(schema, documentAST, options) {\n  assertSchema(schema);\n  (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||\n    devAssert(false, 'Must provide valid Document AST.');\n\n  if (\n    (options === null || options === void 0 ? void 0 : options.assumeValid) !==\n      true &&\n    (options === null || options === void 0\n      ? void 0\n      : options.assumeValidSDL) !== true\n  ) {\n    assertValidSDLExtension(documentAST, schema);\n  }\n\n  const schemaConfig = schema.toConfig();\n  const extendedConfig = extendSchemaImpl(schemaConfig, documentAST, options);\n  return schemaConfig === extendedConfig\n    ? schema\n    : new GraphQLSchema(extendedConfig);\n}\n/**\n * @internal\n */\n\nexport function extendSchemaImpl(schemaConfig, documentAST, options) {\n  var _schemaDef, _schemaDef$descriptio, _schemaDef2, _options$assumeValid;\n\n  // Collect the type definitions and extensions found in the document.\n  const typeDefs = [];\n  const typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n  // have the same name. For example, a type named \"skip\".\n\n  const directiveDefs = [];\n  let schemaDef; // Schema extensions are collected which may add additional operation types.\n\n  const schemaExtensions = [];\n\n  for (const def of documentAST.definitions) {\n    if (def.kind === Kind.SCHEMA_DEFINITION) {\n      schemaDef = def;\n    } else if (def.kind === Kind.SCHEMA_EXTENSION) {\n      schemaExtensions.push(def);\n    } else if (isTypeDefinitionNode(def)) {\n      typeDefs.push(def);\n    } else if (isTypeExtensionNode(def)) {\n      const extendedTypeName = def.name.value;\n      const existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n      typeExtensionsMap[extendedTypeName] = existingTypeExtensions\n        ? existingTypeExtensions.concat([def])\n        : [def];\n    } else if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      directiveDefs.push(def);\n    }\n  } // If this document contains no new types, extensions, or directives then\n  // return the same unmodified GraphQLSchema instance.\n\n  if (\n    Object.keys(typeExtensionsMap).length === 0 &&\n    typeDefs.length === 0 &&\n    directiveDefs.length === 0 &&\n    schemaExtensions.length === 0 &&\n    schemaDef == null\n  ) {\n    return schemaConfig;\n  }\n\n  const typeMap = Object.create(null);\n\n  for (const existingType of schemaConfig.types) {\n    typeMap[existingType.name] = extendNamedType(existingType);\n  }\n\n  for (const typeNode of typeDefs) {\n    var _stdTypeMap$name;\n\n    const name = typeNode.name.value;\n    typeMap[name] =\n      (_stdTypeMap$name = stdTypeMap[name]) !== null &&\n      _stdTypeMap$name !== void 0\n        ? _stdTypeMap$name\n        : buildType(typeNode);\n  }\n\n  const operationTypes = {\n    // Get the extended root operation types.\n    query: schemaConfig.query && replaceNamedType(schemaConfig.query),\n    mutation: schemaConfig.mutation && replaceNamedType(schemaConfig.mutation),\n    subscription:\n      schemaConfig.subscription && replaceNamedType(schemaConfig.subscription),\n    // Then, incorporate schema definition and all schema extensions.\n    ...(schemaDef && getOperationTypes([schemaDef])),\n    ...getOperationTypes(schemaExtensions),\n  }; // Then produce and return a Schema config with these types.\n\n  return {\n    description:\n      (_schemaDef = schemaDef) === null || _schemaDef === void 0\n        ? void 0\n        : (_schemaDef$descriptio = _schemaDef.description) === null ||\n          _schemaDef$descriptio === void 0\n        ? void 0\n        : _schemaDef$descriptio.value,\n    ...operationTypes,\n    types: Object.values(typeMap),\n    directives: [\n      ...schemaConfig.directives.map(replaceDirective),\n      ...directiveDefs.map(buildDirective),\n    ],\n    extensions: Object.create(null),\n    astNode:\n      (_schemaDef2 = schemaDef) !== null && _schemaDef2 !== void 0\n        ? _schemaDef2\n        : schemaConfig.astNode,\n    extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExtensions),\n    assumeValid:\n      (_options$assumeValid =\n        options === null || options === void 0\n          ? void 0\n          : options.assumeValid) !== null && _options$assumeValid !== void 0\n        ? _options$assumeValid\n        : false,\n  }; // Below are functions used for producing this schema that have closed over\n  // this scope and have access to the schema, cache, and newly defined types.\n\n  function replaceType(type) {\n    if (isListType(type)) {\n      // @ts-expect-error\n      return new GraphQLList(replaceType(type.ofType));\n    }\n\n    if (isNonNullType(type)) {\n      // @ts-expect-error\n      return new GraphQLNonNull(replaceType(type.ofType));\n    } // @ts-expect-error FIXME\n\n    return replaceNamedType(type);\n  }\n\n  function replaceNamedType(type) {\n    // Note: While this could make early assertions to get the correctly\n    // typed values, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    return typeMap[type.name];\n  }\n\n  function replaceDirective(directive) {\n    const config = directive.toConfig();\n    return new GraphQLDirective({\n      ...config,\n      args: mapValue(config.args, extendArg),\n    });\n  }\n\n  function extendNamedType(type) {\n    if (isIntrospectionType(type) || isSpecifiedScalarType(type)) {\n      // Builtin types are not extended.\n      return type;\n    }\n\n    if (isScalarType(type)) {\n      return extendScalarType(type);\n    }\n\n    if (isObjectType(type)) {\n      return extendObjectType(type);\n    }\n\n    if (isInterfaceType(type)) {\n      return extendInterfaceType(type);\n    }\n\n    if (isUnionType(type)) {\n      return extendUnionType(type);\n    }\n\n    if (isEnumType(type)) {\n      return extendEnumType(type);\n    }\n\n    if (isInputObjectType(type)) {\n      return extendInputObjectType(type);\n    }\n    /* c8 ignore next 3 */\n    // Not reachable, all possible type definition nodes have been considered.\n\n    false || invariant(false, 'Unexpected type: ' + inspect(type));\n  }\n\n  function extendInputObjectType(type) {\n    var _typeExtensionsMap$co;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co !== void 0\n        ? _typeExtensionsMap$co\n        : [];\n    return new GraphQLInputObjectType({\n      ...config,\n      fields: () => ({\n        ...mapValue(config.fields, (field) => ({\n          ...field,\n          type: replaceType(field.type),\n        })),\n        ...buildInputFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendEnumType(type) {\n    var _typeExtensionsMap$ty;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$ty = typeExtensionsMap[type.name]) !== null &&\n      _typeExtensionsMap$ty !== void 0\n        ? _typeExtensionsMap$ty\n        : [];\n    return new GraphQLEnumType({\n      ...config,\n      values: { ...config.values, ...buildEnumValueMap(extensions) },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendScalarType(type) {\n    var _typeExtensionsMap$co2;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co2 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co2 !== void 0\n        ? _typeExtensionsMap$co2\n        : [];\n    let specifiedByURL = config.specifiedByURL;\n\n    for (const extensionNode of extensions) {\n      var _getSpecifiedByURL;\n\n      specifiedByURL =\n        (_getSpecifiedByURL = getSpecifiedByURL(extensionNode)) !== null &&\n        _getSpecifiedByURL !== void 0\n          ? _getSpecifiedByURL\n          : specifiedByURL;\n    }\n\n    return new GraphQLScalarType({\n      ...config,\n      specifiedByURL,\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendObjectType(type) {\n    var _typeExtensionsMap$co3;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co3 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co3 !== void 0\n        ? _typeExtensionsMap$co3\n        : [];\n    return new GraphQLObjectType({\n      ...config,\n      interfaces: () => [\n        ...type.getInterfaces().map(replaceNamedType),\n        ...buildInterfaces(extensions),\n      ],\n      fields: () => ({\n        ...mapValue(config.fields, extendField),\n        ...buildFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendInterfaceType(type) {\n    var _typeExtensionsMap$co4;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co4 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co4 !== void 0\n        ? _typeExtensionsMap$co4\n        : [];\n    return new GraphQLInterfaceType({\n      ...config,\n      interfaces: () => [\n        ...type.getInterfaces().map(replaceNamedType),\n        ...buildInterfaces(extensions),\n      ],\n      fields: () => ({\n        ...mapValue(config.fields, extendField),\n        ...buildFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendUnionType(type) {\n    var _typeExtensionsMap$co5;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co5 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co5 !== void 0\n        ? _typeExtensionsMap$co5\n        : [];\n    return new GraphQLUnionType({\n      ...config,\n      types: () => [\n        ...type.getTypes().map(replaceNamedType),\n        ...buildUnionTypes(extensions),\n      ],\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendField(field) {\n    return {\n      ...field,\n      type: replaceType(field.type),\n      args: field.args && mapValue(field.args, extendArg),\n    };\n  }\n\n  function extendArg(arg) {\n    return { ...arg, type: replaceType(arg.type) };\n  }\n\n  function getOperationTypes(nodes) {\n    const opTypes = {};\n\n    for (const node of nodes) {\n      var _node$operationTypes;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const operationTypesNodes =\n        /* c8 ignore next */\n        (_node$operationTypes = node.operationTypes) !== null &&\n        _node$operationTypes !== void 0\n          ? _node$operationTypes\n          : [];\n\n      for (const operationType of operationTypesNodes) {\n        // Note: While this could make early assertions to get the correctly\n        // typed values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable results.\n        // @ts-expect-error\n        opTypes[operationType.operation] = getNamedType(operationType.type);\n      }\n    }\n\n    return opTypes;\n  }\n\n  function getNamedType(node) {\n    var _stdTypeMap$name2;\n\n    const name = node.name.value;\n    const type =\n      (_stdTypeMap$name2 = stdTypeMap[name]) !== null &&\n      _stdTypeMap$name2 !== void 0\n        ? _stdTypeMap$name2\n        : typeMap[name];\n\n    if (type === undefined) {\n      throw new Error(`Unknown type: \"${name}\".`);\n    }\n\n    return type;\n  }\n\n  function getWrappedType(node) {\n    if (node.kind === Kind.LIST_TYPE) {\n      return new GraphQLList(getWrappedType(node.type));\n    }\n\n    if (node.kind === Kind.NON_NULL_TYPE) {\n      return new GraphQLNonNull(getWrappedType(node.type));\n    }\n\n    return getNamedType(node);\n  }\n\n  function buildDirective(node) {\n    var _node$description;\n\n    return new GraphQLDirective({\n      name: node.name.value,\n      description:\n        (_node$description = node.description) === null ||\n        _node$description === void 0\n          ? void 0\n          : _node$description.value,\n      // @ts-expect-error\n      locations: node.locations.map(({ value }) => value),\n      isRepeatable: node.repeatable,\n      args: buildArgumentMap(node.arguments),\n      astNode: node,\n    });\n  }\n\n  function buildFieldMap(nodes) {\n    const fieldConfigMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$fields;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const nodeFields =\n        /* c8 ignore next */\n        (_node$fields = node.fields) !== null && _node$fields !== void 0\n          ? _node$fields\n          : [];\n\n      for (const field of nodeFields) {\n        var _field$description;\n\n        fieldConfigMap[field.name.value] = {\n          // Note: While this could make assertions to get the correctly typed\n          // value, that would throw immediately while type system validation\n          // with validateSchema() will produce more actionable results.\n          type: getWrappedType(field.type),\n          description:\n            (_field$description = field.description) === null ||\n            _field$description === void 0\n              ? void 0\n              : _field$description.value,\n          args: buildArgumentMap(field.arguments),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field,\n        };\n      }\n    }\n\n    return fieldConfigMap;\n  }\n\n  function buildArgumentMap(args) {\n    // FIXME: https://github.com/graphql/graphql-js/issues/2203\n    const argsNodes =\n      /* c8 ignore next */\n      args !== null && args !== void 0 ? args : [];\n    const argConfigMap = Object.create(null);\n\n    for (const arg of argsNodes) {\n      var _arg$description;\n\n      // Note: While this could make assertions to get the correctly typed\n      // value, that would throw immediately while type system validation\n      // with validateSchema() will produce more actionable results.\n      const type = getWrappedType(arg.type);\n      argConfigMap[arg.name.value] = {\n        type,\n        description:\n          (_arg$description = arg.description) === null ||\n          _arg$description === void 0\n            ? void 0\n            : _arg$description.value,\n        defaultValue: valueFromAST(arg.defaultValue, type),\n        deprecationReason: getDeprecationReason(arg),\n        astNode: arg,\n      };\n    }\n\n    return argConfigMap;\n  }\n\n  function buildInputFieldMap(nodes) {\n    const inputFieldMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$fields2;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const fieldsNodes =\n        /* c8 ignore next */\n        (_node$fields2 = node.fields) !== null && _node$fields2 !== void 0\n          ? _node$fields2\n          : [];\n\n      for (const field of fieldsNodes) {\n        var _field$description2;\n\n        // Note: While this could make assertions to get the correctly typed\n        // value, that would throw immediately while type system validation\n        // with validateSchema() will produce more actionable results.\n        const type = getWrappedType(field.type);\n        inputFieldMap[field.name.value] = {\n          type,\n          description:\n            (_field$description2 = field.description) === null ||\n            _field$description2 === void 0\n              ? void 0\n              : _field$description2.value,\n          defaultValue: valueFromAST(field.defaultValue, type),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field,\n        };\n      }\n    }\n\n    return inputFieldMap;\n  }\n\n  function buildEnumValueMap(nodes) {\n    const enumValueMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$values;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const valuesNodes =\n        /* c8 ignore next */\n        (_node$values = node.values) !== null && _node$values !== void 0\n          ? _node$values\n          : [];\n\n      for (const value of valuesNodes) {\n        var _value$description;\n\n        enumValueMap[value.name.value] = {\n          description:\n            (_value$description = value.description) === null ||\n            _value$description === void 0\n              ? void 0\n              : _value$description.value,\n          deprecationReason: getDeprecationReason(value),\n          astNode: value,\n        };\n      }\n    }\n\n    return enumValueMap;\n  }\n\n  function buildInterfaces(nodes) {\n    // Note: While this could make assertions to get the correctly typed\n    // values below, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    // @ts-expect-error\n    return nodes.flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (node) => {\n        var _node$interfaces$map, _node$interfaces;\n\n        return (\n          /* c8 ignore next */\n          (_node$interfaces$map =\n            (_node$interfaces = node.interfaces) === null ||\n            _node$interfaces === void 0\n              ? void 0\n              : _node$interfaces.map(getNamedType)) !== null &&\n            _node$interfaces$map !== void 0\n            ? _node$interfaces$map\n            : []\n        );\n      },\n    );\n  }\n\n  function buildUnionTypes(nodes) {\n    // Note: While this could make assertions to get the correctly typed\n    // values below, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    // @ts-expect-error\n    return nodes.flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (node) => {\n        var _node$types$map, _node$types;\n\n        return (\n          /* c8 ignore next */\n          (_node$types$map =\n            (_node$types = node.types) === null || _node$types === void 0\n              ? void 0\n              : _node$types.map(getNamedType)) !== null &&\n            _node$types$map !== void 0\n            ? _node$types$map\n            : []\n        );\n      },\n    );\n  }\n\n  function buildType(astNode) {\n    var _typeExtensionsMap$na;\n\n    const name = astNode.name.value;\n    const extensionASTNodes =\n      (_typeExtensionsMap$na = typeExtensionsMap[name]) !== null &&\n      _typeExtensionsMap$na !== void 0\n        ? _typeExtensionsMap$na\n        : [];\n\n    switch (astNode.kind) {\n      case Kind.OBJECT_TYPE_DEFINITION: {\n        var _astNode$description;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLObjectType({\n          name,\n          description:\n            (_astNode$description = astNode.description) === null ||\n            _astNode$description === void 0\n              ? void 0\n              : _astNode$description.value,\n          interfaces: () => buildInterfaces(allNodes),\n          fields: () => buildFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.INTERFACE_TYPE_DEFINITION: {\n        var _astNode$description2;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLInterfaceType({\n          name,\n          description:\n            (_astNode$description2 = astNode.description) === null ||\n            _astNode$description2 === void 0\n              ? void 0\n              : _astNode$description2.value,\n          interfaces: () => buildInterfaces(allNodes),\n          fields: () => buildFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.ENUM_TYPE_DEFINITION: {\n        var _astNode$description3;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLEnumType({\n          name,\n          description:\n            (_astNode$description3 = astNode.description) === null ||\n            _astNode$description3 === void 0\n              ? void 0\n              : _astNode$description3.value,\n          values: buildEnumValueMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.UNION_TYPE_DEFINITION: {\n        var _astNode$description4;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLUnionType({\n          name,\n          description:\n            (_astNode$description4 = astNode.description) === null ||\n            _astNode$description4 === void 0\n              ? void 0\n              : _astNode$description4.value,\n          types: () => buildUnionTypes(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.SCALAR_TYPE_DEFINITION: {\n        var _astNode$description5;\n\n        return new GraphQLScalarType({\n          name,\n          description:\n            (_astNode$description5 = astNode.description) === null ||\n            _astNode$description5 === void 0\n              ? void 0\n              : _astNode$description5.value,\n          specifiedByURL: getSpecifiedByURL(astNode),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.INPUT_OBJECT_TYPE_DEFINITION: {\n        var _astNode$description6;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLInputObjectType({\n          name,\n          description:\n            (_astNode$description6 = astNode.description) === null ||\n            _astNode$description6 === void 0\n              ? void 0\n              : _astNode$description6.value,\n          fields: () => buildInputFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n          isOneOf: isOneOf(astNode),\n        });\n      }\n    }\n  }\n}\nconst stdTypeMap = keyMap(\n  [...specifiedScalarTypes, ...introspectionTypes],\n  (type) => type.name,\n);\n/**\n * Given a field or enum value node, returns the string value for the\n * deprecation reason.\n */\n\nfunction getDeprecationReason(node) {\n  const deprecated = getDirectiveValues(GraphQLDeprecatedDirective, node); // @ts-expect-error validated by `getDirectiveValues`\n\n  return deprecated === null || deprecated === void 0\n    ? void 0\n    : deprecated.reason;\n}\n/**\n * Given a scalar node, returns the string value for the specifiedByURL.\n */\n\nfunction getSpecifiedByURL(node) {\n  const specifiedBy = getDirectiveValues(GraphQLSpecifiedByDirective, node); // @ts-expect-error validated by `getDirectiveValues`\n\n  return specifiedBy === null || specifiedBy === void 0\n    ? void 0\n    : specifiedBy.url;\n}\n/**\n * Given an input object node, returns if the node should be OneOf.\n */\n\nfunction isOneOf(node) {\n  return Boolean(getDirectiveValues(GraphQLOneOfDirective, node));\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { parse } from '../language/parser.mjs';\nimport { specifiedDirectives } from '../type/directives.mjs';\nimport { GraphQLSchema } from '../type/schema.mjs';\nimport { assertValidSDL } from '../validation/validate.mjs';\nimport { extendSchemaImpl } from './extendSchema.mjs';\n\n/**\n * This takes the ast of a schema document produced by the parse function in\n * src/language/parser.js.\n *\n * If no schema definition is provided, then it will look for types named Query,\n * Mutation and Subscription.\n *\n * Given that AST it constructs a GraphQLSchema. The resulting schema\n * has no resolve methods, so execution will use default resolvers.\n */\nexport function buildASTSchema(documentAST, options) {\n  (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||\n    devAssert(false, 'Must provide valid Document AST.');\n\n  if (\n    (options === null || options === void 0 ? void 0 : options.assumeValid) !==\n      true &&\n    (options === null || options === void 0\n      ? void 0\n      : options.assumeValidSDL) !== true\n  ) {\n    assertValidSDL(documentAST);\n  }\n\n  const emptySchemaConfig = {\n    description: undefined,\n    types: [],\n    directives: [],\n    extensions: Object.create(null),\n    extensionASTNodes: [],\n    assumeValid: false,\n  };\n  const config = extendSchemaImpl(emptySchemaConfig, documentAST, options);\n\n  if (config.astNode == null) {\n    for (const type of config.types) {\n      switch (type.name) {\n        // Note: While this could make early assertions to get the correctly\n        // typed values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable results.\n        case 'Query':\n          // @ts-expect-error validated in `validateSchema`\n          config.query = type;\n          break;\n\n        case 'Mutation':\n          // @ts-expect-error validated in `validateSchema`\n          config.mutation = type;\n          break;\n\n        case 'Subscription':\n          // @ts-expect-error validated in `validateSchema`\n          config.subscription = type;\n          break;\n      }\n    }\n  }\n\n  const directives = [\n    ...config.directives, // If specified directives were not explicitly declared, add them.\n    ...specifiedDirectives.filter((stdDirective) =>\n      config.directives.every(\n        (directive) => directive.name !== stdDirective.name,\n      ),\n    ),\n  ];\n  return new GraphQLSchema({ ...config, directives });\n}\n/**\n * A helper function to build a GraphQLSchema directly from a source\n * document.\n */\n\nexport function buildSchema(source, options) {\n  const document = parse(source, {\n    noLocation:\n      options === null || options === void 0 ? void 0 : options.noLocation,\n    allowLegacyFragmentVariables:\n      options === null || options === void 0\n        ? void 0\n        : options.allowLegacyFragmentVariables,\n  });\n  return buildASTSchema(document, {\n    assumeValidSDL:\n      options === null || options === void 0 ? void 0 : options.assumeValidSDL,\n    assumeValid:\n      options === null || options === void 0 ? void 0 : options.assumeValid,\n  });\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isPrintableAsBlockString } from '../language/blockString.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../type/definition.mjs';\nimport {\n  DEFAULT_DEPRECATION_REASON,\n  isSpecifiedDirective,\n} from '../type/directives.mjs';\nimport { isIntrospectionType } from '../type/introspection.mjs';\nimport { isSpecifiedScalarType } from '../type/scalars.mjs';\nimport { astFromValue } from './astFromValue.mjs';\nexport function printSchema(schema) {\n  return printFilteredSchema(\n    schema,\n    (n) => !isSpecifiedDirective(n),\n    isDefinedType,\n  );\n}\nexport function printIntrospectionSchema(schema) {\n  return printFilteredSchema(schema, isSpecifiedDirective, isIntrospectionType);\n}\n\nfunction isDefinedType(type) {\n  return !isSpecifiedScalarType(type) && !isIntrospectionType(type);\n}\n\nfunction printFilteredSchema(schema, directiveFilter, typeFilter) {\n  const directives = schema.getDirectives().filter(directiveFilter);\n  const types = Object.values(schema.getTypeMap()).filter(typeFilter);\n  return [\n    printSchemaDefinition(schema),\n    ...directives.map((directive) => printDirective(directive)),\n    ...types.map((type) => printType(type)),\n  ]\n    .filter(Boolean)\n    .join('\\n\\n');\n}\n\nfunction printSchemaDefinition(schema) {\n  if (schema.description == null && isSchemaOfCommonNames(schema)) {\n    return;\n  }\n\n  const operationTypes = [];\n  const queryType = schema.getQueryType();\n\n  if (queryType) {\n    operationTypes.push(`  query: ${queryType.name}`);\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType) {\n    operationTypes.push(`  mutation: ${mutationType.name}`);\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType) {\n    operationTypes.push(`  subscription: ${subscriptionType.name}`);\n  }\n\n  return printDescription(schema) + `schema {\\n${operationTypes.join('\\n')}\\n}`;\n}\n/**\n * GraphQL schema define root types for each type of operation. These types are\n * the same as any other type and can be named in any manner, however there is\n * a common naming convention:\n *\n * ```graphql\n *   schema {\n *     query: Query\n *     mutation: Mutation\n *     subscription: Subscription\n *   }\n * ```\n *\n * When using this naming convention, the schema description can be omitted.\n */\n\nfunction isSchemaOfCommonNames(schema) {\n  const queryType = schema.getQueryType();\n\n  if (queryType && queryType.name !== 'Query') {\n    return false;\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType && mutationType.name !== 'Mutation') {\n    return false;\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && subscriptionType.name !== 'Subscription') {\n    return false;\n  }\n\n  return true;\n}\n\nexport function printType(type) {\n  if (isScalarType(type)) {\n    return printScalar(type);\n  }\n\n  if (isObjectType(type)) {\n    return printObject(type);\n  }\n\n  if (isInterfaceType(type)) {\n    return printInterface(type);\n  }\n\n  if (isUnionType(type)) {\n    return printUnion(type);\n  }\n\n  if (isEnumType(type)) {\n    return printEnum(type);\n  }\n\n  if (isInputObjectType(type)) {\n    return printInputObject(type);\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected type: ' + inspect(type));\n}\n\nfunction printScalar(type) {\n  return (\n    printDescription(type) + `scalar ${type.name}` + printSpecifiedByURL(type)\n  );\n}\n\nfunction printImplementedInterfaces(type) {\n  const interfaces = type.getInterfaces();\n  return interfaces.length\n    ? ' implements ' + interfaces.map((i) => i.name).join(' & ')\n    : '';\n}\n\nfunction printObject(type) {\n  return (\n    printDescription(type) +\n    `type ${type.name}` +\n    printImplementedInterfaces(type) +\n    printFields(type)\n  );\n}\n\nfunction printInterface(type) {\n  return (\n    printDescription(type) +\n    `interface ${type.name}` +\n    printImplementedInterfaces(type) +\n    printFields(type)\n  );\n}\n\nfunction printUnion(type) {\n  const types = type.getTypes();\n  const possibleTypes = types.length ? ' = ' + types.join(' | ') : '';\n  return printDescription(type) + 'union ' + type.name + possibleTypes;\n}\n\nfunction printEnum(type) {\n  const values = type\n    .getValues()\n    .map(\n      (value, i) =>\n        printDescription(value, '  ', !i) +\n        '  ' +\n        value.name +\n        printDeprecated(value.deprecationReason),\n    );\n  return printDescription(type) + `enum ${type.name}` + printBlock(values);\n}\n\nfunction printInputObject(type) {\n  const fields = Object.values(type.getFields()).map(\n    (f, i) => printDescription(f, '  ', !i) + '  ' + printInputValue(f),\n  );\n  return (\n    printDescription(type) +\n    `input ${type.name}` +\n    (type.isOneOf ? ' @oneOf' : '') +\n    printBlock(fields)\n  );\n}\n\nfunction printFields(type) {\n  const fields = Object.values(type.getFields()).map(\n    (f, i) =>\n      printDescription(f, '  ', !i) +\n      '  ' +\n      f.name +\n      printArgs(f.args, '  ') +\n      ': ' +\n      String(f.type) +\n      printDeprecated(f.deprecationReason),\n  );\n  return printBlock(fields);\n}\n\nfunction printBlock(items) {\n  return items.length !== 0 ? ' {\\n' + items.join('\\n') + '\\n}' : '';\n}\n\nfunction printArgs(args, indentation = '') {\n  if (args.length === 0) {\n    return '';\n  } // If every arg does not have a description, print them on one line.\n\n  if (args.every((arg) => !arg.description)) {\n    return '(' + args.map(printInputValue).join(', ') + ')';\n  }\n\n  return (\n    '(\\n' +\n    args\n      .map(\n        (arg, i) =>\n          printDescription(arg, '  ' + indentation, !i) +\n          '  ' +\n          indentation +\n          printInputValue(arg),\n      )\n      .join('\\n') +\n    '\\n' +\n    indentation +\n    ')'\n  );\n}\n\nfunction printInputValue(arg) {\n  const defaultAST = astFromValue(arg.defaultValue, arg.type);\n  let argDecl = arg.name + ': ' + String(arg.type);\n\n  if (defaultAST) {\n    argDecl += ` = ${print(defaultAST)}`;\n  }\n\n  return argDecl + printDeprecated(arg.deprecationReason);\n}\n\nfunction printDirective(directive) {\n  return (\n    printDescription(directive) +\n    'directive @' +\n    directive.name +\n    printArgs(directive.args) +\n    (directive.isRepeatable ? ' repeatable' : '') +\n    ' on ' +\n    directive.locations.join(' | ')\n  );\n}\n\nfunction printDeprecated(reason) {\n  if (reason == null) {\n    return '';\n  }\n\n  if (reason !== DEFAULT_DEPRECATION_REASON) {\n    const astValue = print({\n      kind: Kind.STRING,\n      value: reason,\n    });\n    return ` @deprecated(reason: ${astValue})`;\n  }\n\n  return ' @deprecated';\n}\n\nfunction printSpecifiedByURL(scalar) {\n  if (scalar.specifiedByURL == null) {\n    return '';\n  }\n\n  const astValue = print({\n    kind: Kind.STRING,\n    value: scalar.specifiedByURL,\n  });\n  return ` @specifiedBy(url: ${astValue})`;\n}\n\nfunction printDescription(def, indentation = '', firstInBlock = true) {\n  const { description } = def;\n\n  if (description == null) {\n    return '';\n  }\n\n  const blockString = print({\n    kind: Kind.STRING,\n    value: description,\n    block: isPrintableAsBlockString(description),\n  });\n  const prefix =\n    indentation && !firstInBlock ? '\\n' + indentation : indentation;\n  return prefix + blockString.replace(/\\n/g, '\\n' + indentation) + '\\n';\n}\n","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = '{ unit?: string, value?: number }';\nexport const typedef = 'scalar Amount';\nexport const schema = z.object({\n    unit: z.string().optional(),\n    value: z.number().finite(),\n});\nexport const stringSchema = 'z.object({ unit: z.string().optional(), value: z.number().finite() })';\nconst amountValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountValidation,\n    parseValue: amountValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (unitField && unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('value must be a valid float value', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField?.value?.value,\n            value: parseFloat(valueField.value.value),\n        };\n        return amountValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Amount.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const NUMERIC_VALUE_REGEX = /^\\d+(\\.\\d+)?$/;\nexport const type = '{ unit: string, value: string }';\nexport const typedef = 'scalar Amount_Crypto';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.string(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.string() })';\nconst amountCryptoValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Crypto value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Crypto',\n    description: 'A custom scalar that represents a cryptocurrency amount with its currency type',\n    serialize: amountCryptoValidation,\n    parseValue: amountCryptoValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('value must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!NUMERIC_VALUE_REGEX.test(valueField.value.value)) {\n            throw new GraphQLError('value must be a valid numeric string (e.g., \"123\" or \"123.45\")', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: valueField.value.value,\n        };\n        return amountCryptoValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountCrypto.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const NUMERIC_VALUE_REGEX = /^\\d+(\\.\\d+)?$/;\nexport const type = '{ unit: string, value: string }';\nexport const typedef = 'scalar Amount_Currency';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.string(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.string()})';\nconst amountCurrencyValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Currency value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Currency',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountCurrencyValidation,\n    parseValue: amountCurrencyValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('value must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!NUMERIC_VALUE_REGEX.test(valueField.value.value)) {\n            throw new GraphQLError('value must be a valid numeric string (e.g., \"123\" or \"123.45\")', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: valueField.value.value,\n        };\n        return amountCurrencyValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountCurrency.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = '{ unit: string, value: number }';\nexport const typedef = 'scalar Amount_Fiat';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.number().finite(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.number().finite() })';\nconst amountFiatValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Fiat value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Fiat',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountFiatValidation,\n    parseValue: amountFiatValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('value must be a valid float value', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: parseFloat(valueField.value.value),\n        };\n        return amountFiatValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountFiat.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number'; // TS type in string form, update this accordingly\nexport const typedef = 'scalar Amount_Money';\nexport const schema = z.number(); // Update this code accordingly\nexport const stringSchema = 'z.number()'; // Update this code accordingly\nconst amountMoneyValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Money',\n    description: 'A custom scalar that represents a monetary amount in a currency',\n    serialize: amountMoneyValidation,\n    parseValue: amountMoneyValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('Value is not a float type', {\n                nodes: value,\n            });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountMoneyValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountMoney.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number'; // TS type in string form, update this accordingly\nexport const typedef = 'scalar Amount_Percentage';\nexport const schema = z.number(); // Update this code accordingly\nexport const stringSchema = 'z.number()'; // Update this code accordingly\nconst amountPercentageValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Percentage',\n    description: '',\n    serialize: amountPercentageValidation,\n    parseValue: amountPercentageValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountPercentageValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountPercentage.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number';\nexport const typedef = 'scalar Amount_Tokens';\nexport const schema = z.number();\nexport const stringSchema = 'z.number()';\nconst amountTokensValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Tokens',\n    description: 'A custom scalar that represents an amount of tokens',\n    serialize: amountTokensValidation,\n    parseValue: amountTokensValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountTokensValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountTokens.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar Currency';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst currencyValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Currency',\n    description: 'A custom scalar that represents a Currency Code string',\n    serialize: currencyValidation,\n    parseValue: currencyValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return currencyValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Currency.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar Date';\nexport const schema = z.iso.datetime();\nexport const stringSchema = 'z.iso.datetime()';\nconst datetimeValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Date',\n    description: 'A custom scalar that represents a datetime in ISO 8601 format (Time: 00:00:00)',\n    serialize: datetimeValidation,\n    parseValue: datetimeValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return datetimeValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Date.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar DateTime';\nexport const schema = z.iso.datetime();\nexport const stringSchema = 'z.iso.datetime()';\nconst datetimeValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'DateTime',\n    description: 'A custom scalar that represents a datetime in ISO 8601 format',\n    serialize: datetimeValidation,\n    parseValue: datetimeValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return datetimeValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=DateTime.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string'; // TS type in string form\nexport const typedef = 'scalar EmailAddress';\nexport const schema = z.email();\nexport const stringSchema = 'z.email()';\nconst emailValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'EmailAddress',\n    description: 'A field whose value conforms to the standard internet email address format as specified in RFC822: https://www.w3.org/Protocols/rfc822/.',\n    serialize: emailValidation,\n    parseValue: emailValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Can only validate strings as email addresses but got a: ${value.kind}`, { nodes: value });\n        }\n        return emailValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=EmailAddress.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar EthereumAddress';\nexport const schema = z.string().regex(/^0x[a-fA-F0-9]{40}$/, {\n    message: 'Invalid Ethereum address format',\n});\nexport const stringSchema = \"z.string().regex(/^0x[a-fA-F0-9]{40}$/, { message: 'Invalid Ethereum address format' })\";\nconst addressValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'EthereumAddress',\n    description: 'A custom scalar representing an Ethereum address, validated as a 42-character hexadecimal string prefixed with \"0x\"',\n    serialize: addressValidation,\n    parseValue: addressValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        return addressValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=EthereumAddress.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar OID';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst oIdValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'OID',\n    description: 'A custom scalar that represents a OID string',\n    serialize: oIdValidation,\n    parseValue: oIdValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return oIdValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=OID.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar OLabel';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst oLabelValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'OLabel',\n    description: 'A custom scalar that represents a OLabel string',\n    serialize: oLabelValidation,\n    parseValue: oLabelValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return oLabelValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=OLabel.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar PHID';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst phidlValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'PHID',\n    description: 'A custom scalar that represents a PowerhouseID string',\n    serialize: phidlValidation,\n    parseValue: phidlValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return phidlValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=PHID.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar URL';\nexport const schema = z.url();\nexport const stringSchema = 'z.url()';\nconst urlValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'URL',\n    description: 'A custom scalar that represents a URL string',\n    serialize: urlValidation,\n    parseValue: urlValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return urlValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=URL.js.map","// @ts-check\n\n/**\n * @import GraphQLUpload from \"./GraphQLUpload.mjs\"\n * @import processRequest, { FileUpload } from \"./processRequest.mjs\"\n */\n\n/**\n * A file expected to be uploaded as it was declared in the `map` field of a\n * [GraphQL multipart request](https://github.com/jaydenseric/graphql-multipart-request-spec).\n * The {@linkcode processRequest} function places references to an instance of\n * this class wherever the file is expected in the GraphQL operation. The scalar\n * {@linkcode GraphQLUpload} derives it’s value from {@linkcode Upload.promise}.\n */\nexport default class Upload {\n  constructor() {\n    /**\n     * Promise that resolves file upload details. This should only be utilized\n     * by {@linkcode GraphQLUpload}.\n     * @type {Promise<FileUpload>}\n     */\n    this.promise = new Promise((resolve, reject) => {\n      /**\n       * Resolves the upload promise with the file upload details. This should\n       * only be utilized by {@linkcode processRequest}.\n       * @param {FileUpload} file File upload details.\n       */\n      this.resolve = (file) => {\n        /**\n         * The file upload details, available when the\n         * {@linkcode Upload.promise} resolves. This should only be utilized by\n         * {@linkcode processRequest}.\n         * @type {FileUpload | undefined}\n         */\n        this.file = file;\n\n        resolve(file);\n      };\n\n      /**\n       * Rejects the upload promise with an error. This should only be\n       * utilized by {@linkcode processRequest}.\n       * @param {Error} error Error instance.\n       */\n      this.reject = reject;\n    });\n\n    // Prevent errors crashing Node.js, see:\n    // https://github.com/nodejs/node/issues/20392\n    this.promise.catch(() => {});\n  }\n}\n","// @ts-check\n\nimport { GraphQLError, GraphQLScalarType } from \"graphql\";\n\nimport Upload from \"./Upload.mjs\";\n\n/** @typedef {import(\"./processRequest.mjs\").FileUpload} FileUpload */\n\n/**\n * A GraphQL scalar `Upload` that can be used in a\n * [`GraphQLSchema`](https://graphql.org/graphql-js/type/#graphqlschema). It’s\n * value in resolvers is a promise that resolves\n * {@link FileUpload file upload details} for processing and storage.\n * @example\n * A schema built using the function\n * [`makeExecutableSchema`](https://www.graphql-tools.com/docs/api/modules/schema_src#makeexecutableschema)\n * from [`@graphql-tools/schema`](https://npm.im/@graphql-tools/schema):\n *\n * ```js\n * import { makeExecutableSchema } from \"@graphql-tools/schema/makeExecutableSchema\";\n * import GraphQLUpload from \"graphql-upload/GraphQLUpload.mjs\";\n *\n * const schema = makeExecutableSchema({\n *   typeDefs: `\n *     scalar Upload\n *   `,\n *   resolvers: {\n *     Upload: GraphQLUpload,\n *   },\n * });\n * ```\n * @example\n * A manually constructed schema with an image upload mutation:\n *\n * ```js\n * import { GraphQLBoolean, GraphQLObjectType, GraphQLSchema } from \"graphql\";\n * import GraphQLUpload from \"graphql-upload/GraphQLUpload.mjs\";\n *\n * const schema = new GraphQLSchema({\n *   mutation: new GraphQLObjectType({\n *     name: \"Mutation\",\n *     fields: {\n *       uploadImage: {\n *         description: \"Uploads an image.\",\n *         type: GraphQLBoolean,\n *         args: {\n *           image: {\n *             description: \"Image file.\",\n *             type: GraphQLUpload,\n *           },\n *         },\n *         async resolve(parent, { image }) {\n *           const { filename, mimetype, createReadStream } = await image;\n *           const stream = createReadStream();\n *           // Promisify the stream and store the file, then…\n *           return true;\n *         },\n *       },\n *     },\n *   }),\n * });\n * ```\n * @example\n * In a [TypeScript](https://typescriptlang.org) module, how to import the type\n * for the {@link FileUpload file upload details} that the\n * {@linkcode GraphQLUpload} scalar resolver value promise resolves:\n *\n * ```ts\n * import type { FileUpload } from \"graphql-upload/processRequest.mjs\";\n * ```\n */\nconst GraphQLUpload = new GraphQLScalarType({\n  name: \"Upload\",\n  description: \"The `Upload` scalar type represents a file upload.\",\n  parseValue(value) {\n    if (value instanceof Upload) return value.promise;\n    throw new GraphQLError(\"Upload value invalid.\");\n  },\n  parseLiteral(node) {\n    throw new GraphQLError(\"Upload literal unsupported.\", { nodes: node });\n  },\n  serialize() {\n    throw new GraphQLError(\"Upload serialization unsupported.\");\n  },\n});\n\nexport default GraphQLUpload;\n","import GraphQLUpload from 'graphql-upload/GraphQLUpload.mjs';\nexport const type = 'File';\nexport const typedef = 'scalar Upload';\nexport const config = {\n    name: 'Upload',\n    description: 'A custom scalar that represents a file upload',\n};\n// This export is required to satisfy the `validationSchema` generator\nexport const stringSchema = 'z.any()';\nexport const scalar = GraphQLUpload;\n//# sourceMappingURL=File.js.map","// namespace imports -- DO NOT REMOVE OR EDIT THIS COMMENT\nimport * as Amount from './Amount.js';\nimport * as AmountCrypto from './AmountCrypto.js';\nimport * as AmountCurrency from './AmountCurrency.js';\nimport * as AmountFiat from './AmountFiat.js';\nimport * as AmountMoney from './AmountMoney.js';\nimport * as AmountPercentage from './AmountPercentage.js';\nimport * as AmountTokens from './AmountTokens.js';\nimport * as Currency from './Currency.js';\nimport * as DateScalar from './Date.js';\nimport * as DateTime from './DateTime.js';\nimport * as EmailAddress from './EmailAddress.js';\nimport * as EthereumAddress from './EthereumAddress.js';\nimport * as OID from './OID.js';\nimport * as OLabel from './OLabel.js';\nimport * as PHID from './PHID.js';\nimport * as URLScalar from './URL.js';\nimport * as File from './File.js';\nexport { Amount, AmountCrypto, AmountCurrency, AmountFiat, AmountMoney, AmountPercentage, \n// export object -- DO NOT REMOVE OR EDIT THIS COMMENT\nAmountTokens, Currency, DateScalar, DateTime, EmailAddress, EthereumAddress, File, OID, OLabel, PHID, URLScalar, };\nexport const customScalars = {\n    // @ts-expect-error - it works this way\n    Amount,\n    // @ts-expect-error - it works this way\n    AmountCrypto,\n    // @ts-expect-error - it works this way\n    AmountCurrency,\n    // @ts-expect-error - it works this way\n    AmountFiat,\n    AmountMoney,\n    AmountPercentage,\n    AmountTokens,\n    Currency,\n    DateScalar,\n    DateTime,\n    EmailAddress,\n    EthereumAddress,\n    // @ts-expect-error - it works this way\n    File,\n    OID,\n    OLabel,\n    PHID,\n    URLScalar,\n};\nexport const resolvers = {\n    // export resolvers -- DO NOT REMOVE OR EDIT THIS COMMENT\n    AmountTokens: AmountTokens.scalar,\n    EthereumAddress: EthereumAddress.scalar,\n    AmountPercentage: AmountPercentage.scalar,\n    EmailAddress: EmailAddress.scalar,\n    Date: DateScalar.scalar,\n    DateTime: DateTime.scalar,\n    URL: URLScalar.scalar,\n    AmountMoney: AmountMoney.scalar,\n    OLabel: OLabel.scalar,\n    Currency: Currency.scalar,\n    PHID: PHID.scalar,\n    OID: OID.scalar,\n    AmountFiat: AmountFiat.scalar,\n    AmountCurrency: AmountCurrency.scalar,\n    AmountCrypto: AmountCrypto.scalar,\n    Amount: Amount.scalar,\n    Upload: File.scalar,\n};\nexport const typeDefs = [\n    // export typedefs -- DO NOT REMOVE OR EDIT THIS COMMENT\n    AmountTokens.typedef,\n    EthereumAddress.typedef,\n    AmountPercentage.typedef,\n    EmailAddress.typedef,\n    DateScalar.typedef,\n    DateTime.typedef,\n    URLScalar.typedef,\n    AmountMoney.typedef,\n    OLabel.typedef,\n    Currency.typedef,\n    PHID.typedef,\n    OID.typedef,\n    AmountFiat.typedef,\n    AmountCurrency.typedef,\n    AmountCrypto.typedef,\n    Amount.typedef,\n    File.typedef,\n];\nexport const generatorTypeDefs = {\n    // export generator typedefs -- DO NOT REMOVE OR EDIT THIS COMMENT\n    [AmountTokens.config.name]: AmountTokens.type,\n    [EthereumAddress.config.name]: EthereumAddress.type,\n    [EmailAddress.config.name]: EmailAddress.type,\n    [AmountPercentage.config.name]: AmountPercentage.type,\n    [DateScalar.config.name]: DateScalar.type,\n    [DateTime.config.name]: DateTime.type,\n    [URLScalar.config.name]: URLScalar.type,\n    [AmountMoney.config.name]: AmountMoney.type,\n    [OLabel.config.name]: OLabel.type,\n    [Currency.config.name]: Currency.type,\n    [PHID.config.name]: PHID.type,\n    [OID.config.name]: OID.type,\n    [AmountFiat.config.name]: AmountFiat.type,\n    [AmountCurrency.config.name]: AmountCurrency.type,\n    [AmountCrypto.config.name]: AmountCrypto.type,\n    [Amount.config.name]: Amount.type,\n    [File.config.name]: File.type,\n};\nexport const validationSchema = {\n    // export validation schema -- DO NOT REMOVE OR EDIT THIS COMMENT\n    [AmountTokens.config.name]: AmountTokens.stringSchema,\n    [EthereumAddress.config.name]: EthereumAddress.stringSchema,\n    [EmailAddress.config.name]: EmailAddress.stringSchema,\n    [AmountPercentage.config.name]: AmountPercentage.stringSchema,\n    [DateScalar.config.name]: DateScalar.stringSchema,\n    [DateTime.config.name]: DateTime.stringSchema,\n    [URLScalar.config.name]: URLScalar.stringSchema,\n    [AmountMoney.config.name]: AmountMoney.stringSchema,\n    [OLabel.config.name]: OLabel.stringSchema,\n    [Currency.config.name]: Currency.stringSchema,\n    [PHID.config.name]: PHID.stringSchema,\n    [OID.config.name]: OID.stringSchema,\n    [AmountFiat.config.name]: AmountFiat.stringSchema,\n    [AmountCurrency.config.name]: AmountCurrency.stringSchema,\n    [AmountCrypto.config.name]: AmountCrypto.stringSchema,\n    [Amount.config.name]: Amount.stringSchema,\n    [File.config.name]: File.stringSchema,\n};\n//# sourceMappingURL=scalars.js.map","import { typeDefs } from \"@powerhousedao/document-engineering/graphql\";\nimport { buildSchema, printSchema } from \"graphql\";\n\nexport const hiddenQueryTypeDefDoc = `type Query {\n  _hidden: String\n}\n`;\n\nexport const typeDefsDoc = typeDefs.join(\"\\n\");\n\nexport const initialSchemaDoc = `${hiddenQueryTypeDefDoc}\\n${typeDefsDoc}`;\n\nexport const initialSchema = buildSchema(initialSchemaDoc);\nexport const initialSchemaStr = printSchema(initialSchema);\n\nexport const specialDocIds = {\n  hiddenQueryTypeDef: \"hidden-query-type-defs\",\n  standardLib: \"standard-lib\",\n  global: \"global\",\n  local: \"local\",\n} as const;\n\nexport const updateTimeout = 5000;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93],"mappings":";;;AAAA,MAAM,kBAAkB;;;;AAKxB,SAAgB,WAAW,UAAU,WAAW;CAC9C,MAAM,CAAC,YAAY,kBAAkB,YACjC,CAAC,UAAU,UAAU,GACrB,CAAC,KAAA,GAAW,SAAS;CACzB,IAAI,UAAU;AAEd,KAAI,WACF,YAAW,aAAa;CAG1B,MAAM,cAAc,eAAe,KAAK,MAAM,IAAI,EAAE,GAAG;AAEvD,SAAQ,YAAY,QAApB;EACE,KAAK,EACH,QAAO;EAET,KAAK,EACH,QAAO,UAAU,YAAY,KAAK;EAEpC,KAAK,EACH,QAAO,UAAU,YAAY,KAAK,SAAS,YAAY,KAAK;;CAGhE,MAAM,WAAW,YAAY,MAAM,GAAG,gBAAgB;CACtD,MAAM,WAAW,SAAS,KAAK;AAC/B,QAAO,UAAU,SAAS,KAAK,KAAK,GAAG,UAAU,WAAW;;;;;;;AC3B9D,SAAgB,aAAa,GAAG;AAC9B,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACuBT,SAAgB,OAAO,MAAM,OAAO;CAClC,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,QAAQ,KACjB,QAAO,MAAM,KAAK,IAAI;AAGxB,QAAO;;;;;;;;;;;;;;;;;;;;;ACjBT,SAAgB,UAAU,MAAM,OAAO,OAAO;CAC5C,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,QAAQ,KACjB,QAAO,MAAM,KAAK,IAAI,MAAM,KAAK;AAGnC,QAAO;;;;;;;;ACpBT,SAAgB,SAAS,KAAK,IAAI;CAChC,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,OAAO,OAAO,KAAK,IAAI,CAChC,QAAO,OAAO,GAAG,IAAI,MAAM,IAAI;AAGjC,QAAO;;;;;;;;;;;ACJT,SAAgB,eAAe,MAAM,MAAM;CACzC,IAAI,SAAS;CACb,IAAI,SAAS;AAEb,QAAO,SAAS,KAAK,UAAU,SAAS,KAAK,QAAQ;EACnD,IAAI,QAAQ,KAAK,WAAW,OAAO;EACnC,IAAI,QAAQ,KAAK,WAAW,OAAO;AAEnC,MAAI,QAAQ,MAAM,IAAI,QAAQ,MAAM,EAAE;GACpC,IAAI,OAAO;AAEX,MAAG;AACD,MAAE;AACF,WAAO,OAAO,KAAK,QAAQ;AAC3B,YAAQ,KAAK,WAAW,OAAO;YACxB,QAAQ,MAAM,IAAI,OAAO;GAElC,IAAI,OAAO;AAEX,MAAG;AACD,MAAE;AACF,WAAO,OAAO,KAAK,QAAQ;AAC3B,YAAQ,KAAK,WAAW,OAAO;YACxB,QAAQ,MAAM,IAAI,OAAO;AAElC,OAAI,OAAO,KACT,QAAO;AAGT,OAAI,OAAO,KACT,QAAO;SAEJ;AACL,OAAI,QAAQ,MACV,QAAO;AAGT,OAAI,QAAQ,MACV,QAAO;AAGT,KAAE;AACF,KAAE;;;AAIN,QAAO,KAAK,SAAS,KAAK;;AAE5B,MAAM,UAAU;AAChB,MAAM,UAAU;AAEhB,SAAS,QAAQ,MAAM;AACrB,QAAO,CAAC,MAAM,KAAK,IAAI,WAAW,QAAQ,QAAQ;;;;;;;;ACrDpD,SAAgB,eAAe,OAAO,SAAS;CAC7C,MAAM,oBAAoB,OAAO,OAAO,KAAK;CAC7C,MAAM,kBAAkB,IAAI,gBAAgB,MAAM;CAClD,MAAM,YAAY,KAAK,MAAM,MAAM,SAAS,GAAI,GAAG;AAEnD,MAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,WAAW,gBAAgB,QAAQ,QAAQ,UAAU;AAE3D,MAAI,aAAa,KAAA,EACf,mBAAkB,UAAU;;AAIhC,QAAO,OAAO,KAAK,kBAAkB,CAAC,MAAM,GAAG,MAAM;EACnD,MAAM,eAAe,kBAAkB,KAAK,kBAAkB;AAC9D,SAAO,iBAAiB,IAAI,eAAe,eAAe,GAAG,EAAE;GAC/D;;;;;;;;;;;;;;;;AAiBJ,IAAM,kBAAN,MAAsB;CACpB,YAAY,OAAO;AACjB,OAAK,SAAS;AACd,OAAK,kBAAkB,MAAM,aAAa;AAC1C,OAAK,cAAc,cAAc,KAAK,gBAAgB;AACtD,OAAK,QAAQ;GACX,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACnC,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACnC,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACpC;;CAGH,QAAQ,QAAQ,WAAW;AACzB,MAAI,KAAK,WAAW,OAClB,QAAO;EAGT,MAAM,kBAAkB,OAAO,aAAa;AAE5C,MAAI,KAAK,oBAAoB,gBAC3B,QAAO;EAGT,IAAI,IAAI,cAAc,gBAAgB;EACtC,IAAI,IAAI,KAAK;AAEb,MAAI,EAAE,SAAS,EAAE,QAAQ;GACvB,MAAM,MAAM;AACZ,OAAI;AACJ,OAAI;;EAGN,MAAM,UAAU,EAAE;EAClB,MAAM,UAAU,EAAE;AAElB,MAAI,UAAU,UAAU,UACtB;EAGF,MAAM,OAAO,KAAK;AAElB,OAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAC5B,MAAK,GAAG,KAAK;AAGf,OAAK,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;GACjC,MAAM,QAAQ,MAAM,IAAI,KAAK;GAC7B,MAAM,aAAa,KAAK,IAAI;GAC5B,IAAI,eAAgB,WAAW,KAAK;AAEpC,QAAK,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;IACjC,MAAM,OAAO,EAAE,IAAI,OAAO,EAAE,IAAI,KAAK,IAAI;IACzC,IAAI,cAAc,KAAK,IACrB,MAAM,KAAK,GACX,WAAW,IAAI,KAAK,GACpB,MAAM,IAAI,KAAK,KAChB;AAED,QAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,IAAI;KAEpE,MAAM,qBAAqB,MAAM,IAAI,KAAK,GAAG,IAAI;AACjD,mBAAc,KAAK,IAAI,aAAa,qBAAqB,EAAE;;AAG7D,QAAI,cAAc,aAChB,gBAAe;AAGjB,eAAW,KAAK;;AAGlB,OAAI,eAAe,UACjB;;EAIJ,MAAM,WAAW,KAAK,UAAU,GAAG;AACnC,SAAO,YAAY,YAAY,WAAW,KAAA;;;AAI9C,SAAS,cAAc,KAAK;CAC1B,MAAM,YAAY,IAAI;CACtB,MAAM,QAAQ,IAAI,MAAM,UAAU;AAElC,MAAK,IAAI,IAAI,GAAG,IAAI,WAAW,EAAE,EAC/B,OAAM,KAAK,IAAI,WAAW,EAAE;AAG9B,QAAO;;;;AChIT,SAAgB,SAAS,KAAK;AAC5B,KAAI,OAAO,KACT,QAAO,OAAO,OAAO,KAAK;AAG5B,KAAI,OAAO,eAAe,IAAI,KAAK,KACjC,QAAO;CAGT,MAAM,MAAM,OAAO,OAAO,KAAK;AAE/B,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,CAC5C,KAAI,OAAO;AAGb,QAAO;;;;;;;;ACXT,SAAgB,YAAY,KAAK;AAC/B,QAAO,IAAI,IAAI,QAAQ,eAAe,gBAAgB,CAAC;;AAGzD,MAAM,gBAAgB;AAEtB,SAAS,gBAAgB,KAAK;AAC5B,QAAO,gBAAgB,IAAI,WAAW,EAAE;;AAG1C,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;;;;;;;ACtKD,MAAa,QAAQ,OAAO,OAAO,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFtC,SAAgB,MAAM,MAAM,SAAS,cAAc,mBAAmB;CACpE,MAAM,gCAAgB,IAAI,KAAK;AAE/B,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,CACpC,eAAc,IAAI,MAAM,qBAAqB,SAAS,KAAK,CAAC;CAI9D,IAAI,QAAQ,KAAA;CACZ,IAAI,UAAU,MAAM,QAAQ,KAAK;CACjC,IAAI,OAAO,CAAC,KAAK;CACjB,IAAI,QAAQ;CACZ,IAAI,QAAQ,EAAE;CACd,IAAI,OAAO;CACX,IAAI,MAAM,KAAA;CACV,IAAI,SAAS,KAAA;CACb,MAAM,OAAO,EAAE;CACf,MAAM,YAAY,EAAE;AAGpB,IAAG;AACD;EACA,MAAM,YAAY,UAAU,KAAK;EACjC,MAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,MAAI,WAAW;AACb,SAAM,UAAU,WAAW,IAAI,KAAA,IAAY,KAAK,KAAK,SAAS;AAC9D,UAAO;AACP,YAAS,UAAU,KAAK;AAExB,OAAI,SACF,KAAI,SAAS;AACX,WAAO,KAAK,OAAO;IACnB,IAAI,aAAa;AAEjB,SAAK,MAAM,CAAC,SAAS,cAAc,OAAO;KACxC,MAAM,WAAW,UAAU;AAE3B,SAAI,cAAc,MAAM;AACtB,WAAK,OAAO,UAAU,EAAE;AACxB;WAEA,MAAK,YAAY;;UAGhB;AACL,WAAO,EAAE,GAAG,MAAM;AAElB,SAAK,MAAM,CAAC,SAAS,cAAc,MACjC,MAAK,WAAW;;AAKtB,WAAQ,MAAM;AACd,UAAO,MAAM;AACb,WAAQ,MAAM;AACd,aAAU,MAAM;AAChB,WAAQ,MAAM;aACL,QAAQ;AACjB,SAAM,UAAU,QAAQ,KAAK;AAC7B,UAAO,OAAO;AAEd,OAAI,SAAS,QAAQ,SAAS,KAAA,EAC5B;AAGF,QAAK,KAAK,IAAI;;EAGhB,IAAI;AAEJ,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAE;GACxB,IAAI,oBAAoB;AAExB,UAAO,KAAK,IAAI,UAAU,OAAO,qBAAqB,QAAQ,KAAK,CAAC,GAAG;GACvE,MAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,KAAK,MAAM,QACxD,uBAAuB,KAAK,IAC1B,KAAK,IACL,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,KAAK,MAAM,QACzD,wBAAwB,KAAK,IAC7B,KAAK,IACL,oBAAoB;AACxB,YACE,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,UAAU;AAE/D,OAAI,WAAW,MACb;AAGF,OAAI,WAAW;QACT,CAAC,WAAW;AACd,UAAK,KAAK;AACV;;cAEO,WAAW,KAAA,GAAW;AAC/B,UAAM,KAAK,CAAC,KAAK,OAAO,CAAC;AAEzB,QAAI,CAAC,UACH,KAAI,OAAO,OAAO,CAChB,QAAO;SACF;AACL,UAAK,KAAK;AACV;;;;AAMR,MAAI,WAAW,KAAA,KAAa,SAC1B,OAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AAGzB,MAAI,UACF,MAAK,KAAK;OACL;GACL,IAAI;AAEJ,WAAQ;IACN;IACA;IACA;IACA;IACA,MAAM;IACP;AACD,aAAU,MAAM,QAAQ,KAAK;AAC7B,UAAO,UACH,QACC,aAAa,YAAY,KAAK,WAAW,QAC1C,eAAe,KAAK,IACpB,aACA,EAAE;AACN,WAAQ;AACR,WAAQ,EAAE;AAEV,OAAI,OACF,WAAU,KAAK,OAAO;AAGxB,YAAS;;UAEJ,UAAU,KAAA;AAEnB,KAAI,MAAM,WAAW,EAEnB,QAAO,MAAM,MAAM,SAAS,GAAG;AAGjC,QAAO;;;;;;;;AAST,SAAgB,gBAAgB,UAAU;CACxC,MAAM,WAAW,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAK;CACtD,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,EAAE;EACtC,IAAI,aAAa;EACjB,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;EAC5D,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;AAE5D,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;GACxC,MAAM,EAAE,OAAO,UAAU,qBAAqB,SAAS,IAAI,KAAK;AAChE,kBAAe,aAAa,SAAS,QAAQ,SAAS;AACtD,aAAU,KAAK;AACf,aAAU,KAAK;;AAGjB,MAAI,CAAC,WACH;AAkDF,gBAAc,QA/CW;GACvB,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,MACpB,UAAS,KAAK;cACL,WAAW,KAAA,EACpB,QAAO;;;GAMf,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,KAAA,KAAa,WAAW,MAC5C,QAAO;eAEA,SAAS,OAAO,KACzB,UAAS,KAAK;;GAIrB;;AAIH,QAAO;;;;;AAMT,SAAgB,qBAAqB,SAAS,MAAM;CAClD,MAAM,cAAc,QAAQ;AAE5B,KAAI,OAAO,gBAAgB,SAEzB,QAAO;UACE,OAAO,gBAAgB,WAEhC,QAAO;EACL,OAAO;EACP,OAAO,KAAA;EACR;AAGH,QAAO;EACL,OAAO,QAAQ;EACf,OAAO,QAAQ;EAChB;;;;;;;;AC/UH,SAAgB,MAAM,KAAK;AACzB,QAAO,MAAM,KAAK,mBAAmB;;AAEvC,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;CACzB,MAAM,EACJ,QAAQ,SAAS,KAAK,OACvB;CACD,UAAU,EACR,QAAQ,SAAS,MAAM,KAAK,MAC7B;CAED,UAAU,EACR,QAAQ,SAAS,KAAK,KAAK,aAAa,OAAO,EAChD;CACD,qBAAqB,EACnB,MAAM,MAAM;EACV,MAAM,UAAU,kBAAkB,KAAK,oBAAoB,GACvD,KAAK,OAAO,KAAK,KAAK,qBAAqB,KAAK,EAAE,MAAM,GACxD,KAAK,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI;EACxD,MAAM,SACJ,KAAK,IAAI,KAAK,aAAa,KAAK,GAChC,KACE;GACE,KAAK;GACL,KAAK,CAAC,KAAK,MAAM,QAAQ,CAAC;GAC1B,KAAK,KAAK,YAAY,IAAI;GAC3B,EACD,IACD;AAGH,UAAQ,WAAW,UAAU,KAAK,SAAS,OAAO,KAAK;IAE1D;CACD,oBAAoB,EAClB,QAAQ,EAAE,UAAU,MAAM,cAAc,YAAY,kBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,WACA,OACA,OACA,KAAK,OAAO,aAAa,GACzB,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,cAAc,EACZ,QAAQ,EAAE,iBAAiB,MAAM,WAAW,EAC7C;CACD,OAAO,EACL,MAAM,EAAE,OAAO,MAAM,WAAW,MAAM,YAAY,gBAAgB;EAChE,MAAM,SAAS,KAAK,IAAI,OAAO,KAAK,GAAG;EACvC,IAAI,WAAW,SAAS,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI;AAExD,MAAI,SAAS,SAAS,gBACpB,YAAW,SAAS,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM;AAGlE,SAAO,KAAK;GAAC;GAAU,KAAK,YAAY,IAAI;GAAE;GAAa,EAAE,IAAI;IAEpE;CACD,UAAU,EACR,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,gBAAgB,EACd,QAAQ,EAAE,MAAM,iBACd,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EAClD;CACD,gBAAgB,EACd,QAAQ,EAAE,eAAe,YAAY,mBACnC,KACE;EACE;EACA,KAAK,OAAO,cAAc;EAC1B,KAAK,YAAY,IAAI;EACrB;EACD,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EACN,MACA,eACA,qBACA,YACA,cACA,kBAEA,KAAK,IAAI,aAAa,KAAK,GAE3B,YAAY,OAAO,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI,CAAC,MAC7D,cAAc,GAAG,KAAK,IAAI,KAAK,YAAY,IAAI,EAAE,IAAI,KAC3D,cACH;CAED,UAAU,EACR,QAAQ,EAAE,YAAY,OACvB;CACD,YAAY,EACV,QAAQ,EAAE,YAAY,OACvB;CACD,aAAa,EACX,QAAQ,EAAE,OAAO,OAAO,oBACtB,gBAAgB,iBAAiB,MAAM,GAAG,YAAY,MAAM,EAC/D;CACD,cAAc,EACZ,QAAQ,EAAE,YAAa,QAAQ,SAAS,SACzC;CACD,WAAW,EACT,aAAa,QACd;CACD,WAAW,EACT,QAAQ,EAAE,YAAY,OACvB;CACD,WAAW,EACT,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,WAAW,EACT,QAAQ,EAAE,MAAM,WAAW,WACzB,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,EAChD;CAED,WAAW,EACT,QAAQ,EAAE,WAAW,MACtB;CACD,UAAU,EACR,QAAQ,EAAE,WAAW,MAAM,OAAO,KACnC;CACD,aAAa,EACX,QAAQ,EAAE,WAAW,OAAO,KAC7B;CAED,kBAAkB,EAChB,QAAQ,EAAE,aAAa,YAAY,qBACjC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAAE,IAAI,EACtE;CACD,yBAAyB,EACvB,QAAQ,EAAE,WAAW,WAAW,YAAY,OAAO,MACpD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EACrD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,iBAAiB,EACf,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,MAAM,iBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,IACpC,OACA,OACA,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,MAAM,cAAc,iBAC/C,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC,OAAO,OAAO;EAAM,KAAK,MAAM,aAAa;EAAE,KAAK,YAAY,IAAI;EAAC,EACrE,IACD,EACJ;CACD,yBAAyB,EACvB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,YAAY,YACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAAC,EACtE,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAQ;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAClE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,YAAY,IAAI,CAAC,EAAE,IAAI,EACzE;CACD,2BAA2B,EACzB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACnE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,YAAY,gBACxD,KAAK,IAAI,aAAa,KAAK,GAC3B,gBACA,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,KACnC,aAAa,gBAAgB,MAC9B,SACA,KAAK,WAAW,MAAM,EACzB;CACD,iBAAiB,EACf,QAAQ,EAAE,YAAY,qBACpB,KACE;EAAC;EAAiB,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAC/D,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,iBACd,KAAK;EAAC;EAAiB;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EAC5D;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,wBAAwB,EACtB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,YAAY,YAC1B,KACE;EACE;EACA;EACA,KAAK,YAAY,IAAI;EACrB,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAC/B,EACD,IACD,EACJ;CACD,mBAAmB,EACjB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAe;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACzE;CACD,0BAA0B,EACxB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAgB;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAC1E;CAED,gBAAgB,EACd,QAAQ,EAAE,WAAW,MACtB;CACD,kBAAkB,EAChB,QAAQ,EAAE,MAAM,iBAAiB,KAAK,CAAC,MAAM,KAAK,KAAK,WAAW,CAAC,CAAC,EACrE;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,WAAW,mBACzB,KAAK;EAAC;EAAM,KAAK,KAAK,UAAU;EAAE,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACpE;CACD,qBAAqB,EACnB,QAAQ,EAAE,WAAW,KAAK,CAAC,KAAK,KAAK,CAAC,EACvC;CACD,6BAA6B,EAC3B,QAAQ,EAAE,MAAM,mBACd,KAAK;EAAC;EAAK;EAAM,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACnD;CACF;;;;;AAMD,SAAS,KAAK,YAAY,YAAY,IAAI;CACxC,IAAI;AAEJ,SAAQ,wBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,QAAQ,MAAM,EAAE,CAAC,KAAK,UAAU,MAAM,QACrD,0BAA0B,KAAK,IAC7B,wBACA;;;;;AAMN,SAAS,MAAM,OAAO;AACpB,QAAO,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK,CAAC,EAAE,MAAM;;;;;AAMtD,SAAS,KAAK,OAAO,aAAa,MAAM,IAAI;AAC1C,QAAO,eAAe,QAAQ,gBAAgB,KAC1C,QAAQ,cAAc,MACtB;;AAGN,SAAS,OAAO,KAAK;AACnB,QAAO,KAAK,MAAM,IAAI,QAAQ,OAAO,OAAO,CAAC;;AAG/C,SAAS,kBAAkB,YAAY;CACrC,IAAI;;AAKJ,SAAQ,mBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,MAAM,QAAQ,IAAI,SAAS,KAAK,CAAC,MAAM,QACtD,qBAAqB,KAAK,IACxB,mBACA;;;;;;;;;;;;;;;;;;;;AC3VN,SAAgB,oBAAoB,WAAW,WAAW;AACxD,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,KACR,QAAO;EAET,KAAK,KAAK,IACR,QAAO,SAAS,UAAU,OAAO,GAAG;EAEtC,KAAK,KAAK,MACR,QAAO,WAAW,UAAU,MAAM;EAEpC,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK,QACR,QAAO,UAAU;EAEnB,KAAK,KAAK,KACR,QAAO,UAAU,OAAO,KAAK,SAC3B,oBAAoB,MAAM,UAAU,CACrC;EAEH,KAAK,KAAK,OACR,QAAO,UACL,UAAU,SACT,UAAU,MAAM,KAAK,QACrB,UAAU,oBAAoB,MAAM,OAAO,UAAU,CACvD;EAEH,KAAK,KAAK,SACR,QAAO,cAAc,QAAQ,cAAc,KAAK,IAC5C,KAAK,IACL,UAAU,UAAU,KAAK;;;;;;;;AC3CnC,SAAgB,WAAW,MAAM;AAC/B,SAAgB,UAAU,OAAO,qBAAqB;AACtD,QAAO,SAAS,YAAY,UAAU,OAAO,gCAAgC;AAE7E,KAAI,KAAK,WAAW,EAClB,OAAM,IAAI,aAAa,0CAA0C;AAGnE,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EACjC,KAAI,CAAC,eAAe,KAAK,WAAW,EAAE,CAAC,CACrC,OAAM,IAAI,aACR,6CAA6C,KAAK,aACnD;AAIL,KAAI,CAAC,YAAY,KAAK,WAAW,EAAE,CAAC,CAClC,OAAM,IAAI,aACR,wCAAwC,KAAK,aAC9C;AAGH,QAAO;;;;;;;AAQT,SAAgB,oBAAoB,MAAM;AACxC,KAAI,SAAS,UAAU,SAAS,WAAW,SAAS,OAClD,OAAM,IAAI,aAAa,gCAAgC,OAAO;AAGhE,QAAO,WAAW,KAAK;;;;AC1BzB,SAAgB,OAAO,MAAM;AAC3B,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IAChB,kBAAkB,KAAK,IACvB,WAAW,KAAK,IAChB,cAAc,KAAK;;;;;AAcvB,SAAgB,aAAa,MAAM;AACjC,QAAO,WAAW,MAAM,kBAAkB;;AAS5C,SAAgB,aAAa,MAAM;AACjC,QAAO,WAAW,MAAM,kBAAkB;;AAS5C,SAAgB,gBAAgB,MAAM;AACpC,QAAO,WAAW,MAAM,qBAAqB;;AAW/C,SAAgB,YAAY,MAAM;AAChC,QAAO,WAAW,MAAM,iBAAiB;;AAS3C,SAAgB,WAAW,MAAM;AAC/B,QAAO,WAAW,MAAM,gBAAgB;;AAS1C,SAAgB,kBAAkB,MAAM;AACtC,QAAO,WAAW,MAAM,uBAAuB;;AAWjD,SAAgB,WAAW,MAAM;AAC/B,QAAO,WAAW,MAAM,YAAY;;AAStC,SAAgB,cAAc,MAAM;AAClC,QAAO,WAAW,MAAM,eAAe;;;;;AAazC,SAAgB,YAAY,MAAM;AAChC,QACE,aAAa,KAAK,IAClB,WAAW,KAAK,IAChB,kBAAkB,KAAK,IACtB,eAAe,KAAK,IAAI,YAAY,KAAK,OAAO;;;;;AAcrD,SAAgB,aAAa,MAAM;AACjC,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IACf,eAAe,KAAK,IAAI,aAAa,KAAK,OAAO;;;;;AActD,SAAgB,WAAW,MAAM;AAC/B,QAAO,aAAa,KAAK,IAAI,WAAW,KAAK;;;;;AAa/C,SAAgB,gBAAgB,MAAM;AACpC,QAAO,aAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,YAAY,KAAK;;;;;AAezE,SAAgB,eAAe,MAAM;AACnC,QAAO,gBAAgB,KAAK,IAAI,YAAY,KAAK;;AAEnD,SAAgB,mBAAmB,MAAM;AACvC,KAAI,CAAC,eAAe,KAAK,CACvB,OAAM,IAAI,MAAM,YAAY,QAAQ,KAAK,CAAC,iCAAiC;AAG7E,QAAO;;;;;;;;;;;;;;;;;;;;;AAsBT,IAAa,cAAb,MAAyB;CACvB,YAAY,QAAQ;AAClB,SAAO,OAAO,IACZ,UAAU,OAAO,YAAY,QAAQ,OAAO,CAAC,wBAAwB;AACvE,OAAK,SAAS;;CAGhB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO,MAAM,OAAO,KAAK,OAAO,GAAG;;CAGrC,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;AAyB1B,IAAa,iBAAb,MAA4B;CAC1B,YAAY,QAAQ;AAClB,iBAAe,OAAO,IACpB,UACE,OACA,YAAY,QAAQ,OAAO,CAAC,iCAC7B;AACH,OAAK,SAAS;;CAGhB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO,OAAO,KAAK,OAAO,GAAG;;CAG/B,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;AAO1B,SAAgB,eAAe,MAAM;AACnC,QAAO,WAAW,KAAK,IAAI,cAAc,KAAK;;;;;AAahD,SAAgB,eAAe,MAAM;AACnC,QAAO,OAAO,KAAK,IAAI,CAAC,cAAc,KAAK;;AAS7C,SAAgB,gBAAgB,MAAM;AACpC,KAAI,KACF,QAAO,cAAc,KAAK,GAAG,KAAK,SAAS;;;;;AAO/C,SAAgB,YAAY,MAAM;AAChC,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IAChB,kBAAkB,KAAK;;AAU3B,SAAgB,aAAa,MAAM;AACjC,KAAI,MAAM;EACR,IAAI,gBAAgB;AAEpB,SAAO,eAAe,cAAc,CAClC,iBAAgB,cAAc;AAGhC,SAAO;;;;;;;AAQX,SAAgB,0BAA0B,OAAO;AAC/C,QAAO,OAAO,UAAU,aAAa,OAAO,GAAG;;AAEjD,SAAgB,mBAAmB,OAAO;AACxC,QAAO,OAAO,UAAU,aAAa,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CjD,IAAa,oBAAb,MAA+B;CAC7B,YAAY,QAAQ;EAClB,IAAI,oBACF,mBACA,sBACA;EAEF,MAAM,cACH,qBAAqB,OAAO,gBAAgB,QAC7C,uBAAuB,KAAK,IACxB,qBACA;AACN,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,iBAAiB,OAAO;AAC7B,OAAK,aACF,oBAAoB,OAAO,eAAe,QAC3C,sBAAsB,KAAK,IACvB,oBACA;AACN,OAAK,aAAa;AAClB,OAAK,gBACF,uBAAuB,OAAO,kBAAkB,QACjD,yBAAyB,KAAK,IAC1B,wBACC,MAAM,cAAc,WAAW,oBAAoB,MAAM,UAAU,CAAC;AAC3E,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,wBAAwB,OAAO,uBAAuB,QACvD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,kBAAkB,QACvB,OAAO,OAAO,mBAAmB,YACjC,UACE,OACA,GAAG,KAAK,KAAK,uDACC,QAAQ,OAAO,eAAe,CAAC,GAC9C;AACH,SAAO,aAAa,QAClB,OAAO,OAAO,cAAc,cAC5B,UACE,OACA,GAAG,KAAK,KAAK,8JACd;AAEH,MAAI,OAAO,aACR,QAAO,OAAO,eAAe,cAC5B,OAAO,OAAO,iBAAiB,cAC/B,UACE,OACA,GAAG,KAAK,KAAK,+DACd;;CAIP,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,gBAAgB,KAAK;GACrB,WAAW,KAAK;GAChB,YAAY,KAAK;GACjB,cAAc,KAAK;GACnB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4C1B,IAAa,oBAAb,MAA+B;CAC7B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,WAAW,OAAO;AACvB,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AAER,OAAK,gBAAgB,eAAe,OAAO;AAE3C,OAAK,oBAAoB,iBAAiB,OAAO;AAEjD,SAAO,YAAY,QACjB,OAAO,OAAO,aAAa,cAC3B,UACE,OACA,GAAG,KAAK,KAAK,mDACC,QAAQ,OAAO,SAAS,CAAC,GACxC;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,gBAAgB;AACd,MAAI,OAAO,KAAK,gBAAgB,WAC9B,MAAK,cAAc,KAAK,aAAa;AAGvC,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,YAAY,KAAK,eAAe;GAChC,QAAQ,qBAAqB,KAAK,WAAW,CAAC;GAC9C,UAAU,KAAK;GACf,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,iBAAiB,QAAQ;CAChC,IAAI;CAEJ,MAAM,aAAa,2BAChB,qBAAqB,OAAO,gBAAgB,QAC3C,uBAAuB,KAAK,IAC1B,qBACA,EAAE,CACP;AACD,OAAM,QAAQ,WAAW,IACvB,UACE,OACA,GAAG,OAAO,KAAK,oEAChB;AACH,QAAO;;AAGT,SAAS,eAAe,QAAQ;CAC9B,MAAM,WAAW,mBAAmB,OAAO,OAAO;AAClD,YAAW,SAAS,IAClB,UACE,OACA,GAAG,OAAO,KAAK,gGAChB;AACH,QAAO,SAAS,WAAW,aAAa,cAAc;EACpD,IAAI;AAEJ,aAAW,YAAY,IACrB,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,kCAC7B;AACH,cAAY,WAAW,QACrB,OAAO,YAAY,YAAY,cAC/B,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,2DACJ,QAAQ,YAAY,QAAQ,CAAC,GACtD;EACH,MAAM,cACH,oBAAoB,YAAY,UAAU,QAC3C,sBAAsB,KAAK,IACvB,oBACA,EAAE;AACR,aAAW,WAAW,IACpB,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,sDAC7B;AACH,SAAO;GACL,MAAM,WAAW,UAAU;GAC3B,aAAa,YAAY;GACzB,MAAM,YAAY;GAClB,MAAM,gBAAgB,WAAW;GACjC,SAAS,YAAY;GACrB,WAAW,YAAY;GACvB,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;AAGJ,SAAgB,gBAAgB,QAAQ;AACtC,QAAO,OAAO,QAAQ,OAAO,CAAC,KAAK,CAAC,SAAS,gBAAgB;EAC3D,MAAM,WAAW,QAAQ;EACzB,aAAa,UAAU;EACvB,MAAM,UAAU;EAChB,cAAc,UAAU;EACxB,mBAAmB,UAAU;EAC7B,YAAY,SAAS,UAAU,WAAW;EAC1C,SAAS,UAAU;EACpB,EAAE;;AAGL,SAAS,WAAW,KAAK;AACvB,QAAO,aAAa,IAAI,IAAI,CAAC,MAAM,QAAQ,IAAI;;AAGjD,SAAS,qBAAqB,QAAQ;AACpC,QAAO,SAAS,SAAS,WAAW;EAClC,aAAa,MAAM;EACnB,MAAM,MAAM;EACZ,MAAM,iBAAiB,MAAM,KAAK;EAClC,SAAS,MAAM;EACf,WAAW,MAAM;EACjB,mBAAmB,MAAM;EACzB,YAAY,MAAM;EAClB,SAAS,MAAM;EAChB,EAAE;;;;;AAML,SAAgB,iBAAiB,MAAM;AACrC,QAAO,UACL,OACC,QAAQ,IAAI,OACZ,SAAS;EACR,aAAa,IAAI;EACjB,MAAM,IAAI;EACV,cAAc,IAAI;EAClB,mBAAmB,IAAI;EACvB,YAAY,IAAI;EAChB,SAAS,IAAI;EACd,EACF;;AAEH,SAAgB,mBAAmB,KAAK;AACtC,QAAO,cAAc,IAAI,KAAK,IAAI,IAAI,iBAAiB,KAAA;;;;;;;;;;;;;;;;;;;;;AAsBzD,IAAa,uBAAb,MAAkC;CAChC,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,UAAU,eAAe,KAAK,KAAA,GAAW,OAAO;AACrD,OAAK,cAAc,iBAAiB,KAAK,KAAA,GAAW,OAAO;AAC3D,SAAO,eAAe,QACpB,OAAO,OAAO,gBAAgB,cAC9B,UACE,OACA,GAAG,KAAK,KAAK,sDACC,QAAQ,OAAO,YAAY,CAAC,GAC3C;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,gBAAgB;AACd,MAAI,OAAO,KAAK,gBAAgB,WAC9B,MAAK,cAAc,KAAK,aAAa;AAGvC,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,YAAY,KAAK,eAAe;GAChC,QAAQ,qBAAqB,KAAK,WAAW,CAAC;GAC9C,aAAa,KAAK;GAClB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4B1B,IAAa,mBAAb,MAA8B;CAC5B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,SAAS,YAAY,KAAK,KAAA,GAAW,OAAO;AACjD,SAAO,eAAe,QACpB,OAAO,OAAO,gBAAgB,cAC9B,UACE,OACA,GAAG,KAAK,KAAK,sDACC,QAAQ,OAAO,YAAY,CAAC,GAC3C;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,MAAI,OAAO,KAAK,WAAW,WACzB,MAAK,SAAS,KAAK,QAAQ;AAG7B,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,OAAO,KAAK,UAAU;GACtB,aAAa,KAAK;GAClB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,YAAY,QAAQ;CAC3B,MAAM,QAAQ,0BAA0B,OAAO,MAAM;AACrD,OAAM,QAAQ,MAAM,IAClB,UACE,OACA,mFAAmF,OAAO,KAAK,GAChG;AACH,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;AA0BT,IAAa,kBAAb,MAA6B;CAE3B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,UACH,OAAO,OAAO,WAAW,aACrB,OAAO,SACP,iBAAiB,KAAK,MAAM,OAAO,OAAO;AAChD,OAAK,eAAe;AACpB,OAAK,cAAc;;CAGrB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,iBAAiB,KAAK,MAAM,KAAK,SAAS,CAAC;AAG5D,SAAO,KAAK;;CAGd,SAAS,MAAM;AACb,MAAI,KAAK,gBAAgB,KACvB,MAAK,cAAc,OAAO,KAAK,WAAW,GAAG,UAAU,MAAM,KAAK;AAGpE,SAAO,KAAK,YAAY;;CAG1B,UAAU,aAAa;AACrB,MAAI,KAAK,iBAAiB,KACxB,MAAK,eAAe,IAAI,IACtB,KAAK,WAAW,CAAC,KAAK,cAAc,CAAC,UAAU,OAAO,UAAU,CAAC,CAClE;EAGH,MAAM,YAAY,KAAK,aAAa,IAAI,YAAY;AAEpD,MAAI,cAAc,KAAA,EAChB,OAAM,IAAI,aACR,SAAS,KAAK,KAAK,4BAA4B,QAAQ,YAAY,GACpE;AAGH,SAAO,UAAU;;CAGnB,WAAW,YACX;AACE,MAAI,OAAO,eAAe,UAAU;GAClC,MAAM,WAAW,QAAQ,WAAW;AACpC,SAAM,IAAI,aACR,SAAS,KAAK,KAAK,uCAAuC,SAAS,KACjE,oBAAoB,MAAM,SAAS,CACtC;;EAGH,MAAM,YAAY,KAAK,SAAS,WAAW;AAE3C,MAAI,aAAa,KACf,OAAM,IAAI,aACR,UAAU,WAAW,uBAAuB,KAAK,KAAK,WACpD,oBAAoB,MAAM,WAAW,CACxC;AAGH,SAAO,UAAU;;CAGnB,aAAa,WAAW,YACxB;AAEE,MAAI,UAAU,SAAS,KAAK,MAAM;GAChC,MAAM,WAAW,MAAM,UAAU;AACjC,SAAM,IAAI,aACR,SAAS,KAAK,KAAK,qCAAqC,SAAS,KAC/D,oBAAoB,MAAM,SAAS,EACrC,EACE,OAAO,WACR,CACF;;EAGH,MAAM,YAAY,KAAK,SAAS,UAAU,MAAM;AAEhD,MAAI,aAAa,MAAM;GACrB,MAAM,WAAW,MAAM,UAAU;AACjC,SAAM,IAAI,aACR,UAAU,SAAS,uBAAuB,KAAK,KAAK,WAClD,oBAAoB,MAAM,SAAS,EACrC,EACE,OAAO,WACR,CACF;;AAGH,SAAO,UAAU;;CAGnB,WAAW;EACT,MAAM,SAAS,UACb,KAAK,WAAW,GACf,UAAU,MAAM,OAChB,WAAW;GACV,aAAa,MAAM;GACnB,OAAO,MAAM;GACb,mBAAmB,MAAM;GACzB,YAAY,MAAM;GAClB,SAAS,MAAM;GAChB,EACF;AACD,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB;GACA,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,oBAAoB,UAAU,iBAAiB;AAGtD,QAAO,WAAW,kBADM,eAAe,iBADtB,SAAS,WAAW,CAAC,KAAK,UAAU,MAAM,KAAK,CACC,CACb;;AAGtD,SAAS,iBAAiB,UAAU,UAAU;AAC5C,YAAW,SAAS,IAClB,UACE,OACA,GAAG,SAAS,qDACb;AACH,QAAO,OAAO,QAAQ,SAAS,CAAC,KAAK,CAAC,WAAW,iBAAiB;AAChE,aAAW,YAAY,IACrB,UACE,OACA,GAAG,SAAS,GAAG,UAAU,sFACoB,QAAQ,YAAY,CAAC,GACnE;AACH,SAAO;GACL,MAAM,oBAAoB,UAAU;GACpC,aAAa,YAAY;GACzB,OAAO,YAAY,UAAU,KAAA,IAAY,YAAY,QAAQ;GAC7D,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;;;;;;;;;;;;;;;;;;;;;;AAwBJ,IAAa,yBAAb,MAAoC;CAClC,YAAY,QAAQ;EAClB,IAAI,wBAAwB;AAE5B,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,WACF,kBAAkB,OAAO,aAAa,QAAQ,oBAAoB,KAAK,IACpE,kBACA;AACN,OAAK,UAAU,oBAAoB,KAAK,KAAA,GAAW,OAAO;;CAG5D,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,WAAW;EACT,MAAM,SAAS,SAAS,KAAK,WAAW,GAAG,WAAW;GACpD,aAAa,MAAM;GACnB,MAAM,MAAM;GACZ,cAAc,MAAM;GACpB,mBAAmB,MAAM;GACzB,YAAY,MAAM;GAClB,SAAS,MAAM;GAChB,EAAE;AACH,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB;GACA,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACxB,SAAS,KAAK;GACf;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,oBAAoB,QAAQ;CACnC,MAAM,WAAW,mBAAmB,OAAO,OAAO;AAClD,YAAW,SAAS,IAClB,UACE,OACA,GAAG,OAAO,KAAK,gGAChB;AACH,QAAO,SAAS,WAAW,aAAa,cAAc;AACpD,IAAE,aAAa,gBACb,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,yEAC7B;AACH,SAAO;GACL,MAAM,WAAW,UAAU;GAC3B,aAAa,YAAY;GACzB,MAAM,YAAY;GAClB,cAAc,YAAY;GAC1B,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;AAGJ,SAAgB,qBAAqB,OAAO;AAC1C,QAAO,cAAc,MAAM,KAAK,IAAI,MAAM,iBAAiB,KAAA;;;;;;;AChqC7D,SAAgB,YAAY,OAAO,OAAO;AAExC,KAAI,UAAU,MACZ,QAAO;AAGT,KAAI,cAAc,MAAM,IAAI,cAAc,MAAM,CAC9C,QAAO,YAAY,MAAM,QAAQ,MAAM,OAAO;AAGhD,KAAI,WAAW,MAAM,IAAI,WAAW,MAAM,CACxC,QAAO,YAAY,MAAM,QAAQ,MAAM,OAAO;AAGhD,QAAO;;;;;;AAOT,SAAgB,gBAAgB,QAAQ,cAAc,WAAW;AAE/D,KAAI,iBAAiB,UACnB,QAAO;AAGT,KAAI,cAAc,UAAU,EAAE;AAC5B,MAAI,cAAc,aAAa,CAC7B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU,OAAO;AAGvE,SAAO;;AAGT,KAAI,cAAc,aAAa,CAE7B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU;AAGhE,KAAI,WAAW,UAAU,EAAE;AACzB,MAAI,WAAW,aAAa,CAC1B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU,OAAO;AAGvE,SAAO;;AAGT,KAAI,WAAW,aAAa,CAE1B,QAAO;AAIT,QACE,eAAe,UAAU,KACxB,gBAAgB,aAAa,IAAI,aAAa,aAAa,KAC5D,OAAO,UAAU,WAAW,aAAa;;;;;;;;;;;AAa7C,SAAgB,eAAe,QAAQ,OAAO,OAAO;AAEnD,KAAI,UAAU,MACZ,QAAO;AAGT,KAAI,eAAe,MAAM,EAAE;AACzB,MAAI,eAAe,MAAM,CAGvB,QAAO,OACJ,iBAAiB,MAAM,CACvB,MAAM,SAAS,OAAO,UAAU,OAAO,KAAK,CAAC;AAGlD,SAAO,OAAO,UAAU,OAAO,MAAM;;AAGvC,KAAI,eAAe,MAAM,CAEvB,QAAO,OAAO,UAAU,OAAO,MAAM;AAGvC,QAAO;;ACtFT,MAAa,aAAa,IAAI,kBAAkB;CAC9C,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,IAAI;EAG5B,IAAI,MAAM;AAEV,MAAI,OAAO,iBAAiB,YAAY,iBAAiB,GACvD,OAAM,OAAO,aAAa;AAG5B,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,UAAU,IAAI,CACnD,OAAM,IAAI,aACR,2CAA2C,QAAQ,aAAa,GACjE;AAGH,MAAI,MAAA,cAAyB,MAAA,YAC3B,OAAM,IAAI,aACR,2DACE,QAAQ,aAAa,CACxB;AAGH,SAAO;;CAGT,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,YAAY,CAAC,OAAO,UAAU,WAAW,CACjE,OAAM,IAAI,aACR,2CAA2C,QAAQ,WAAW,GAC/D;AAGH,MAAI,aAAA,cAAgC,aAAA,YAClC,OAAM,IAAI,aACR,yDAAyD,aAC1D;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,IAC1B,OAAM,IAAI,aACR,2CAA2C,MAAM,UAAU,IAC3D,EACE,OAAO,WACR,CACF;EAGH,MAAM,MAAM,SAAS,UAAU,OAAO,GAAG;AAEzC,MAAI,MAAA,cAAyB,MAAA,YAC3B,OAAM,IAAI,aACR,yDAAyD,UAAU,SACnE,EACE,OAAO,WACR,CACF;AAGH,SAAO;;CAEV,CAAC;AACF,MAAa,eAAe,IAAI,kBAAkB;CAChD,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,IAAI;EAG5B,IAAI,MAAM;AAEV,MAAI,OAAO,iBAAiB,YAAY,iBAAiB,GACvD,OAAM,OAAO,aAAa;AAG5B,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,IAAI,CAClD,OAAM,IAAI,aACR,6CAA6C,QAAQ,aAAa,GACnE;AAGH,SAAO;;CAGT,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,WAAW,CAChE,OAAM,IAAI,aACR,6CAA6C,QAAQ,WAAW,GACjE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,SAAS,UAAU,SAAS,KAAK,IAC3D,OAAM,IAAI,aACR,6CAA6C,MAAM,UAAU,IAC7D,UACD;AAGH,SAAO,WAAW,UAAU,MAAM;;CAErC,CAAC;AACF,MAAa,gBAAgB,IAAI,kBAAkB;CACjD,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAGjD,MAAI,OAAO,iBAAiB,SAC1B,QAAO;AAGT,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,SAAS;AAGjC,MAAI,OAAO,iBAAiB,YAAY,OAAO,SAAS,aAAa,CACnE,QAAO,aAAa,UAAU;AAGhC,QAAM,IAAI,aACR,kCAAkC,QAAQ,YAAY,GACvD;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,SACxB,OAAM,IAAI,aACR,+CAA+C,QAAQ,WAAW,GACnE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,OAC1B,OAAM,IAAI,aACR,+CAA+C,MAAM,UAAU,IAC/D,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,iBAAiB,IAAI,kBAAkB;CAClD,MAAM;CACN,aAAa;CAEb,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO;AAGT,MAAI,OAAO,SAAS,aAAa,CAC/B,QAAO,iBAAiB;AAG1B,QAAM,IAAI,aACR,iDAAiD,QAAQ,aAAa,GACvE;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,UACxB,OAAM,IAAI,aACR,iDAAiD,QAAQ,WAAW,GACrE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,QAC1B,OAAM,IAAI,aACR,iDAAiD,MAAM,UAAU,IACjE,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,YAAY,IAAI,kBAAkB;CAC7C,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,SAC1B,QAAO;AAGT,MAAI,OAAO,UAAU,aAAa,CAChC,QAAO,OAAO,aAAa;AAG7B,QAAM,IAAI,aACR,8BAA8B,QAAQ,YAAY,GACnD;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,SACxB,QAAO;AAGT,MAAI,OAAO,eAAe,YAAY,OAAO,UAAU,WAAW,CAChE,QAAO,WAAW,UAAU;AAG9B,QAAM,IAAI,aAAa,8BAA8B,QAAQ,WAAW,GAAG;;CAG7E,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,UAAU,UAAU,SAAS,KAAK,IAC5D,OAAM,IAAI,aACR,6DACE,MAAM,UAAU,EAClB,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,uBAAuB,OAAO,OAAO;CAChD;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,sBAAsB,MAAM;AAC1C,QAAO,qBAAqB,MAAM,EAAE,WAAW,KAAK,SAAS,KAAK;;AAKpE,SAAS,gBAAgB,aAAa;AACpC,KAAI,aAAa,YAAY,EAAE;AAC7B,MAAI,OAAO,YAAY,YAAY,YAAY;GAC7C,MAAM,gBAAgB,YAAY,SAAS;AAE3C,OAAI,CAAC,aAAa,cAAc,CAC9B,QAAO;;AAIX,MAAI,OAAO,YAAY,WAAW,WAChC,QAAO,YAAY,QAAQ;;AAI/B,QAAO;;;;;;;AClST,SAAgB,YAAY,WAAW;AACrC,QAAO,WAAW,WAAW,iBAAiB;;;;;;;;;;;;;;;AAyBhD,IAAa,mBAAb,MAA8B;CAC5B,YAAY,QAAQ;EAClB,IAAI,sBAAsB;AAE1B,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,YAAY,OAAO;AACxB,OAAK,gBACF,uBAAuB,OAAO,kBAAkB,QACjD,yBAAyB,KAAK,IAC1B,uBACA;AACN,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,QAAM,QAAQ,OAAO,UAAU,IAC7B,UAAU,OAAO,IAAI,OAAO,KAAK,8BAA8B;EACjE,MAAM,QACH,eAAe,OAAO,UAAU,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AACP,eAAa,KAAK,IAAI,CAAC,MAAM,QAAQ,KAAK,IACzC,UACE,OACA,IAAI,OAAO,KAAK,sDACjB;AACH,OAAK,OAAO,gBAAgB,KAAK;;CAGnC,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,WAAW,KAAK;GAChB,MAAM,iBAAiB,KAAK,KAAK;GACjC,cAAc,KAAK;GACnB,YAAY,KAAK;GACjB,SAAS,KAAK;GACf;;CAGH,WAAW;AACT,SAAO,MAAM,KAAK;;CAGpB,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;AAO1B,MAAa,0BAA0B,IAAI,iBAAiB;CAC1D,MAAM;CACN,aACE;CACF,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,IAAI;EACF,MAAM,IAAI,eAAe,eAAe;EACxC,aAAa;EACd,EACF;CACF,CAAC;;;;AAKF,MAAa,uBAAuB,IAAI,iBAAiB;CACvD,MAAM;CACN,aACE;CACF,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,IAAI;EACF,MAAM,IAAI,eAAe,eAAe;EACxC,aAAa;EACd,EACF;CACF,CAAC;;;;AAUF,MAAa,6BAA6B,IAAI,iBAAiB;CAC7D,MAAM;CACN,aAAa;CACb,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,QAAQ;EACN,MAAM;EACN,aACE;EACF,cAnBoC;EAoBrC,EACF;CACF,CAAC;;;;AAKF,MAAa,8BAA8B,IAAI,iBAAiB;CAC9D,MAAM;CACN,aAAa;CACb,WAAW,CAAC,kBAAkB,OAAO;CACrC,MAAM,EACJ,KAAK;EACH,MAAM,IAAI,eAAe,cAAc;EACvC,aAAa;EACd,EACF;CACF,CAAC;;;;AAKF,MAAa,wBAAwB,IAAI,iBAAiB;CACxD,MAAM;CACN,aACE;CACF,WAAW,CAAC,kBAAkB,aAAa;CAC3C,MAAM,EAAE;CACT,CAAC;;;;AAKF,MAAa,sBAAsB,OAAO,OAAO;CAC/C;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,qBAAqB,WAAW;AAC9C,QAAO,oBAAoB,MAAM,EAAE,WAAW,SAAS,UAAU,KAAK;;;;;;;;;;;;;;;;;;;;;ACvLxE,SAAgB,iBAAiB,eAAe;AAC9C,QACE,OAAO,kBAAkB,YACzB,QAAQ,kBAAkB,QAAQ,kBAAkB,KAAK,IACrD,KAAK,IACL,cAAc,OAAO,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;ACa5C,SAAgB,aAAa,OAAO,MAAM;AACxC,KAAI,cAAc,KAAK,EAAE;EACvB,MAAM,WAAW,aAAa,OAAO,KAAK,OAAO;AAEjD,OACG,aAAa,QAAQ,aAAa,KAAK,IAAI,KAAK,IAAI,SAAS,UAC9D,KAAK,KAEL,QAAO;AAGT,SAAO;;AAGT,KAAI,UAAU,KACZ,QAAO,EACL,MAAM,KAAK,MACZ;AAGH,KAAI,UAAU,KAAA,EACZ,QAAO;AAIT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,iBAAiB,MAAM,EAAE;GAC3B,MAAM,cAAc,EAAE;AAEtB,QAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,WAAW,aAAa,MAAM,SAAS;AAE7C,QAAI,YAAY,KACd,aAAY,KAAK,SAAS;;AAI9B,UAAO;IACL,MAAM,KAAK;IACX,QAAQ;IACT;;AAGH,SAAO,aAAa,OAAO,SAAS;;AAItC,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,CAAC,aAAa,MAAM,CACtB,QAAO;EAGT,MAAM,aAAa,EAAE;AAErB,OAAK,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,EAAE;GACnD,MAAM,aAAa,aAAa,MAAM,MAAM,OAAO,MAAM,KAAK;AAE9D,OAAI,WACF,YAAW,KAAK;IACd,MAAM,KAAK;IACX,MAAM;KACJ,MAAM,KAAK;KACX,OAAO,MAAM;KACd;IACD,OAAO;IACR,CAAC;;AAIN,SAAO;GACL,MAAM,KAAK;GACX,QAAQ;GACT;;AAGH,KAAI,WAAW,KAAK,EAAE;EAGpB,MAAM,aAAa,KAAK,UAAU,MAAM;AAExC,MAAI,cAAc,KAChB,QAAO;AAGT,MAAI,OAAO,eAAe,UACxB,QAAO;GACL,MAAM,KAAK;GACX,OAAO;GACR;AAGH,MAAI,OAAO,eAAe,YAAY,OAAO,SAAS,WAAW,EAAE;GACjE,MAAM,YAAY,OAAO,WAAW;AACpC,UAAO,oBAAoB,KAAK,UAAU,GACtC;IACE,MAAM,KAAK;IACX,OAAO;IACR,GACD;IACE,MAAM,KAAK;IACX,OAAO;IACR;;AAGP,MAAI,OAAO,eAAe,UAAU;AAElC,OAAI,WAAW,KAAK,CAClB,QAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;AAGH,OAAI,SAAS,aAAa,oBAAoB,KAAK,WAAW,CAC5D,QAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;AAGH,UAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;;AAGH,QAAM,IAAI,UAAU,gCAAgC,QAAQ,WAAW,CAAC,GAAG;;;AAKpE,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;;;;;;AAQtE,MAAM,sBAAsB;;;AC3J5B,MAAa,WAAW,IAAI,kBAAkB;CAC5C,MAAM;CACN,aACE;CACF,eAAe;EACb,aAAa;GACX,MAAM;GACN,UAAU,WAAW,OAAO;GAC7B;EACD,OAAO;GACL,aAAa;GACb,MAAM,IAAI,eAAe,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC,CAAC;GAErE,QAAQ,QAAQ;AACd,WAAO,OAAO,OAAO,OAAO,YAAY,CAAC;;GAE5C;EACD,WAAW;GACT,aAAa;GACb,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,WAAW,OAAO,cAAc;GAC3C;EACD,cAAc;GACZ,aACE;GACF,MAAM;GACN,UAAU,WAAW,OAAO,iBAAiB;GAC9C;EACD,kBAAkB;GAChB,aACE;GACF,MAAM;GACN,UAAU,WAAW,OAAO,qBAAqB;GAClD;EACD,YAAY;GACV,aAAa;GACb,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,YAAY,CAAC,CACjD;GACD,UAAU,WAAW,OAAO,eAAe;GAC5C;EACF;CACF,CAAC;AACF,MAAa,cAAc,IAAI,kBAAkB;CAC/C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,cAAc,UAAU;GACnC;EACD,aAAa;GACX,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,cAAc,UAAU;GACnC;EACD,WAAW;GACT,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,oBAAoB,CAAC,CACzD;GACD,UAAU,cAAc,UAAU;GACnC;EACD,MAAM;GACJ,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC,CAClD;GACD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,OAAO,EAAE,qBAAqB;AACpC,WAAO,oBACH,MAAM,OACN,MAAM,KAAK,QAAQ,QAAQ,IAAI,qBAAqB,KAAK;;GAEhE;EACF;CACF,CAAC;AACF,MAAa,sBAAsB,IAAI,gBAAgB;CACrD,MAAM;CACN,aACE;CACF,QAAQ;EACN,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,UAAU;GACR,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,cAAc;GACZ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,iBAAiB;GACf,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,iBAAiB;GACf,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,kBAAkB;GAChB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,WAAW;GACT,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,MAAM;GACJ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,YAAY;GACV,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,cAAc;GACZ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,wBAAwB;GACtB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACF;CACF,CAAC;AACF,MAAa,SAAS,IAAI,kBAAkB;CAC1C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,WAAW;GAEpC,QAAQ,MAAM;AACZ,QAAI,aAAa,KAAK,CACpB,QAAO,SAAS;AAGlB,QAAI,aAAa,KAAK,CACpB,QAAO,SAAS;AAGlB,QAAI,gBAAgB,KAAK,CACvB,QAAO,SAAS;AAGlB,QAAI,YAAY,KAAK,CACnB,QAAO,SAAS;AAGlB,QAAI,WAAW,KAAK,CAClB,QAAO,SAAS;AAGlB,QAAI,kBAAkB,KAAK,CACzB,QAAO,SAAS;AAGlB,QAAI,WAAW,KAAK,CAClB,QAAO,SAAS;AAGlB,QAAI,cAAc,KAAK,CACrB,QAAO,SAAS;;AAKT,cAAU,OAAO,qBAAqB,QAAQ,KAAK,CAAC,IAAI;;GAEpE;EACD,MAAM;GACJ,MAAM;GACN,UAAU,SAAU,UAAU,OAAO,KAAK,OAAO,KAAA;GAClD;EACD,aAAa;GACX,MAAM;GACN,UACE,SAGA,iBAAiB,OAAO,KAAK,cAAc,KAAA;GAC9C;EACD,gBAAgB;GACd,MAAM;GACN,UAAU,QACR,oBAAoB,MAAM,IAAI,iBAAiB,KAAA;GAClD;EACD,QAAQ;GACN,MAAM,IAAI,YAAY,IAAI,eAAe,QAAQ,CAAC;GAClD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,EAAE;KAC/C,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAC9C,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,YAAY;GACV,MAAM,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC;GAEjD,QAAQ,MAAM;AACZ,QAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,CAC7C,QAAO,KAAK,eAAe;;GAGhC;EACD,eAAe;GACb,MAAM,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC;GAEjD,QAAQ,MAAM,OAAO,UAAU,EAAE,UAAU;AACzC,QAAI,eAAe,KAAK,CACtB,QAAO,OAAO,iBAAiB,KAAK;;GAGzC;EACD,YAAY;GACV,MAAM,IAAI,YAAY,IAAI,eAAe,YAAY,CAAC;GACtD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,WAAW,KAAK,EAAE;KACpB,MAAM,SAAS,KAAK,WAAW;AAC/B,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,aAAa;GACX,MAAM,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC;GACvD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,kBAAkB,KAAK,EAAE;KAC3B,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAC9C,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,QAAQ;GACN,MAAM;GACN,UAAU,SAAU,YAAY,OAAO,KAAK,SAAS,KAAA;GACtD;EACD,SAAS;GACP,MAAM;GACN,UAAU,SAAS;AACjB,QAAI,kBAAkB,KAAK,CACzB,QAAO,KAAK;;GAGjB;EACF;CACF,CAAC;AACF,MAAa,UAAU,IAAI,kBAAkB;CAC3C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,UAAU,MAAM;GAC3B;EACD,aAAa;GACX,MAAM;GACN,UAAU,UAAU,MAAM;GAC3B;EACD,MAAM;GACJ,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC,CAClD;GACD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,OAAO,EAAE,qBAAqB;AACpC,WAAO,oBACH,MAAM,OACN,MAAM,KAAK,QAAQ,QAAQ,IAAI,qBAAqB,KAAK;;GAEhE;EACD,MAAM;GACJ,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,UAAU,MAAM;GAC3B;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,UAAU,MAAM,qBAAqB;GAChD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,UAAU,MAAM;GAC3B;EACF;CACF,CAAC;AACF,MAAa,eAAe,IAAI,kBAAkB;CAChD,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,eAAe,WAAW;GACrC;EACD,aAAa;GACX,MAAM;GACN,UAAU,eAAe,WAAW;GACrC;EACD,MAAM;GACJ,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,eAAe,WAAW;GACrC;EACD,cAAc;GACZ,MAAM;GACN,aACE;GAEF,QAAQ,YAAY;IAClB,MAAM,EAAE,MAAM,iBAAiB;IAC/B,MAAM,WAAW,aAAa,cAAc,KAAK;AACjD,WAAO,WAAW,MAAM,SAAS,GAAG;;GAEvC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,UAAU,MAAM,qBAAqB;GAChD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,QAAQ,IAAI;GACvB;EACF;CACF,CAAC;AACF,MAAa,cAAc,IAAI,kBAAkB;CAC/C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,cAAc,UAAU;GACnC;EACD,aAAa;GACX,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,cAAc,UAAU,qBAAqB;GACxD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACF;CACF,CAAC;AACF,IAAI;CAEH,SAAU,UAAU;AACnB,UAAS,YAAY;AACrB,UAAS,YAAY;AACrB,UAAS,eAAe;AACxB,UAAS,WAAW;AACpB,UAAS,UAAU;AACnB,UAAS,kBAAkB;AAC3B,UAAS,UAAU;AACnB,UAAS,cAAc;GACtB,aAAa,WAAW,EAAE,EAAE;AAG/B,MAAa,aAAa,IAAI,gBAAgB;CAC5C,MAAM;CACN,aAAa;CACb,QAAQ;EACN,QAAQ;GACN,OAAO,SAAS;GAChB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,SAAS;GAChB,aACE;GACH;EACD,WAAW;GACT,OAAO,SAAS;GAChB,aACE;GACH;EACD,OAAO;GACL,OAAO,SAAS;GAChB,aACE;GACH;EACD,MAAM;GACJ,OAAO,SAAS;GAChB,aACE;GACH;EACD,cAAc;GACZ,OAAO,SAAS;GAChB,aACE;GACH;EACD,MAAM;GACJ,OAAO,SAAS;GAChB,aAAa;GACd;EACD,UAAU;GACR,OAAO,SAAS;GAChB,aACE;GACH;EACF;CACF,CAAC;;;;;AAMF,MAAa,qBAAqB;CAChC,MAAM;CACN,MAAM,IAAI,eAAe,SAAS;CAClC,aAAa;CACb,MAAM,EAAE;CACR,UAAU,SAAS,OAAO,UAAU,EAAE,aAAa;CACnD,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,mBAAmB;CAC9B,MAAM;CACN,MAAM;CACN,aAAa;CACb,MAAM,CACJ;EACE,MAAM;EACN,aAAa,KAAA;EACb,MAAM,IAAI,eAAe,cAAc;EACvC,cAAc,KAAA;EACd,mBAAmB,KAAA;EACnB,YAAY,OAAO,OAAO,KAAK;EAC/B,SAAS,KAAA;EACV,CACF;CACD,UAAU,SAAS,EAAE,QAAQ,UAAU,EAAE,aAAa,OAAO,QAAQ,KAAK;CAC1E,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,uBAAuB;CAClC,MAAM;CACN,MAAM,IAAI,eAAe,cAAc;CACvC,aAAa;CACb,MAAM,EAAE;CACR,UAAU,SAAS,OAAO,UAAU,EAAE,iBAAiB,WAAW;CAClE,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,qBAAqB,OAAO,OAAO;CAC9C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,oBAAoB,MAAM;AACxC,QAAO,mBAAmB,MAAM,EAAE,WAAW,KAAK,SAAS,KAAK;;;;;;;AC1hBlE,SAAgB,SAAS,QAAQ;AAC/B,QAAO,WAAW,QAAQ,cAAc;;AAE1C,SAAgB,aAAa,QAAQ;AACnC,KAAI,CAAC,SAAS,OAAO,CACnB,OAAM,IAAI,MAAM,YAAY,QAAQ,OAAO,CAAC,0BAA0B;AAGxE,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFT,IAAa,gBAAb,MAA2B;CAEzB,YAAY,QAAQ;EAClB,IAAI,uBAAuB;AAI3B,OAAK,qBAAqB,OAAO,gBAAgB,OAAO,EAAE,GAAG,KAAA;AAE7D,eAAa,OAAO,IAClB,UAAU,OAAO,qCAAqC;AACxD,GAAC,OAAO,SACN,MAAM,QAAQ,OAAO,MAAM,IAC3B,UACE,OACA,8CAA8C,QAAQ,OAAO,MAAM,CAAC,GACrE;AACH,GAAC,OAAO,cACN,MAAM,QAAQ,OAAO,WAAW,IAChC,UACE,OACA,mDACK,QAAQ,OAAO,WAAW,CAAC,GACjC;AACH,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,wBAAwB,OAAO,uBAAuB,QACvD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,OAAK,aAAa,OAAO;AACzB,OAAK,gBAAgB,OAAO;AAC5B,OAAK,oBAAoB,OAAO;AAEhC,OAAK,eACF,qBAAqB,OAAO,gBAAgB,QAC7C,uBAAuB,KAAK,IACxB,qBACA;EAGN,MAAM,qBAAqB,IAAI,IAAI,OAAO,MAAM;AAEhD,MAAI,OAAO,SAAS,KAClB,MAAK,MAAM,QAAQ,OAAO,OAAO;AAG/B,sBAAmB,OAAO,KAAK;AAC/B,0BAAuB,MAAM,mBAAmB;;AAIpD,MAAI,KAAK,cAAc,KACrB,wBAAuB,KAAK,YAAY,mBAAmB;AAG7D,MAAI,KAAK,iBAAiB,KACxB,wBAAuB,KAAK,eAAe,mBAAmB;AAGhE,MAAI,KAAK,qBAAqB,KAC5B,wBAAuB,KAAK,mBAAmB,mBAAmB;AAGpE,OAAK,MAAM,aAAa,KAAK,YAE3B,KAAI,YAAY,UAAU,CACxB,MAAK,MAAM,OAAO,UAAU,KAC1B,wBAAuB,IAAI,MAAM,mBAAmB;AAK1D,yBAAuB,UAAU,mBAAmB;AAEpD,OAAK,WAAW,OAAO,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO,OAAO,KAAK;AAEtC,OAAK,sBAAsB,OAAO,OAAO,KAAK;AAE9C,OAAK,MAAM,aAAa,oBAAoB;AAC1C,OAAI,aAAa,KACf;GAGF,MAAM,WAAW,UAAU;AAC3B,eACE,UACE,OACA,uEACD;AAEH,OAAI,KAAK,SAAS,cAAc,KAAA,EAC9B,OAAM,IAAI,MACR,+EAA+E,SAAS,IACzF;AAGH,QAAK,SAAS,YAAY;AAE1B,OAAI,gBAAgB,UAAU;SAEvB,MAAM,SAAS,UAAU,eAAe,CAC3C,KAAI,gBAAgB,MAAM,EAAE;KAC1B,IAAI,kBAAkB,KAAK,oBAAoB,MAAM;AAErD,SAAI,oBAAoB,KAAA,EACtB,mBAAkB,KAAK,oBAAoB,MAAM,QAAQ;MACvD,SAAS,EAAE;MACX,YAAY,EAAE;MACf;AAGH,qBAAgB,WAAW,KAAK,UAAU;;cAGrC,aAAa,UAAU;SAE3B,MAAM,SAAS,UAAU,eAAe,CAC3C,KAAI,gBAAgB,MAAM,EAAE;KAC1B,IAAI,kBAAkB,KAAK,oBAAoB,MAAM;AAErD,SAAI,oBAAoB,KAAA,EACtB,mBAAkB,KAAK,oBAAoB,MAAM,QAAQ;MACvD,SAAS,EAAE;MACX,YAAY,EAAE;MACf;AAGH,qBAAgB,QAAQ,KAAK,UAAU;;;;;CAOjD,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,eAAe;AACb,SAAO,KAAK;;CAGd,kBAAkB;AAChB,SAAO,KAAK;;CAGd,sBAAsB;AACpB,SAAO,KAAK;;CAGd,YAAY,WAAW;AACrB,UAAQ,WAAR;GACE,KAAK,kBAAkB,MACrB,QAAO,KAAK,cAAc;GAE5B,KAAK,kBAAkB,SACrB,QAAO,KAAK,iBAAiB;GAE/B,KAAK,kBAAkB,aACrB,QAAO,KAAK,qBAAqB;;;CAIvC,aAAa;AACX,SAAO,KAAK;;CAGd,QAAQ,MAAM;AACZ,SAAO,KAAK,YAAY,CAAC;;CAG3B,iBAAiB,cAAc;AAC7B,SAAO,YAAY,aAAa,GAC5B,aAAa,UAAU,GACvB,KAAK,mBAAmB,aAAa,CAAC;;CAG5C,mBAAmB,eAAe;EAChC,MAAM,kBAAkB,KAAK,oBAAoB,cAAc;AAC/D,SAAO,oBAAoB,QAAQ,oBAAoB,KAAK,IACxD,kBACA;GACE,SAAS,EAAE;GACX,YAAY,EAAE;GACf;;CAGP,UAAU,cAAc,cAAc;EACpC,IAAI,MAAM,KAAK,YAAY,aAAa;AAExC,MAAI,QAAQ,KAAA,GAAW;AACrB,SAAM,OAAO,OAAO,KAAK;AAEzB,OAAI,YAAY,aAAa,CAC3B,MAAK,MAAM,QAAQ,aAAa,UAAU,CACxC,KAAI,KAAK,QAAQ;QAEd;IACL,MAAM,kBAAkB,KAAK,mBAAmB,aAAa;AAE7D,SAAK,MAAM,QAAQ,gBAAgB,QACjC,KAAI,KAAK,QAAQ;AAGnB,SAAK,MAAM,QAAQ,gBAAgB,WACjC,KAAI,KAAK,QAAQ;;AAIrB,QAAK,YAAY,aAAa,QAAQ;;AAGxC,SAAO,IAAI,aAAa,UAAU,KAAA;;CAGpC,gBAAgB;AACd,SAAO,KAAK;;CAGd,aAAa,MAAM;AACjB,SAAO,KAAK,eAAe,CAAC,MAAM,cAAc,UAAU,SAAS,KAAK;;CAG1E,WAAW;AACT,SAAO;GACL,aAAa,KAAK;GAClB,OAAO,KAAK,cAAc;GAC1B,UAAU,KAAK,iBAAiB;GAChC,cAAc,KAAK,qBAAqB;GACxC,OAAO,OAAO,OAAO,KAAK,YAAY,CAAC;GACvC,YAAY,KAAK,eAAe;GAChC,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACxB,aAAa,KAAK,uBAAuB,KAAA;GAC1C;;;AAIL,SAAS,uBAAuB,MAAM,SAAS;CAC7C,MAAM,YAAY,aAAa,KAAK;AAEpC,KAAI,CAAC,QAAQ,IAAI,UAAU,EAAE;AAC3B,UAAQ,IAAI,UAAU;AAEtB,MAAI,YAAY,UAAU,CACxB,MAAK,MAAM,cAAc,UAAU,UAAU,CAC3C,wBAAuB,YAAY,QAAQ;WAEpC,aAAa,UAAU,IAAI,gBAAgB,UAAU,EAAE;AAChE,QAAK,MAAM,iBAAiB,UAAU,eAAe,CACnD,wBAAuB,eAAe,QAAQ;AAGhD,QAAK,MAAM,SAAS,OAAO,OAAO,UAAU,WAAW,CAAC,EAAE;AACxD,2BAAuB,MAAM,MAAM,QAAQ;AAE3C,SAAK,MAAM,OAAO,MAAM,KACtB,wBAAuB,IAAI,MAAM,QAAQ;;aAGpC,kBAAkB,UAAU,CACrC,MAAK,MAAM,SAAS,OAAO,OAAO,UAAU,WAAW,CAAC,CACtD,wBAAuB,MAAM,MAAM,QAAQ;;AAKjD,QAAO;;;;;;;;;;;AC/VT,SAAgB,eAAe,QAAQ;AAErC,cAAa,OAAO;AAEpB,KAAI,OAAO,mBACT,QAAO,OAAO;CAGhB,MAAM,UAAU,IAAI,wBAAwB,OAAO;AACnD,mBAAkB,QAAQ;AAC1B,oBAAmB,QAAQ;AAC3B,eAAc,QAAQ;CAGtB,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO,qBAAqB;AAC5B,QAAO;;;;;;AAOT,SAAgB,kBAAkB,QAAQ;CACxC,MAAM,SAAS,eAAe,OAAO;AAErC,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,MAAM,OAAO,KAAK,UAAU,MAAM,QAAQ,CAAC,KAAK,OAAO,CAAC;;AAItE,IAAM,0BAAN,MAA8B;CAC5B,YAAY,QAAQ;AAClB,OAAK,UAAU,EAAE;AACjB,OAAK,SAAS;;CAGhB,YAAY,SAAS,OAAO;EAC1B,MAAM,SAAS,MAAM,QAAQ,MAAM,GAAG,MAAM,OAAO,QAAQ,GAAG;AAE9D,OAAK,QAAQ,KACX,IAAI,aAAa,SAAS,EACxB,OAAO,QACR,CAAC,CACH;;CAGH,YAAY;AACV,SAAO,KAAK;;;AAIhB,SAAS,kBAAkB,SAAS;CAClC,MAAM,SAAS,QAAQ;CACvB,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,CAAC,UACH,SAAQ,YAAY,qCAAqC,OAAO,QAAQ;UAC/D,CAAC,aAAa,UAAU,EAAE;EACnC,IAAI;AAEJ,UAAQ,YACN,qDAAqD,QACnD,UACD,CAAC,KACD,wBAAwB,qBACvB,QACA,kBAAkB,MACnB,MAAM,QAAQ,0BAA0B,KAAK,IAC1C,wBACA,UAAU,QACf;;CAGH,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,gBAAgB,CAAC,aAAa,aAAa,EAAE;EAC/C,IAAI;AAEJ,UAAQ,YACN,oEACK,QAAQ,aAAa,CAAC,KAC1B,yBAAyB,qBACxB,QACA,kBAAkB,SACnB,MAAM,QAAQ,2BAA2B,KAAK,IAC3C,yBACA,aAAa,QAClB;;CAGH,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,oBAAoB,CAAC,aAAa,iBAAiB,EAAE;EACvD,IAAI;AAEJ,UAAQ,YACN,wEACK,QAAQ,iBAAiB,CAAC,KAC9B,yBAAyB,qBACxB,QACA,kBAAkB,aACnB,MAAM,QAAQ,2BAA2B,KAAK,IAC3C,yBACA,iBAAiB,QACtB;;;AAIL,SAAS,qBAAqB,QAAQ,WAAW;CAC/C,IAAI;AAEJ,SAAQ,gBAAgB,CAAC,OAAO,SAAS,GAAG,OAAO,kBAAkB,CAClE,SAEE,eAAe;EACd,IAAI;AAEJ,UAEG,wBACC,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,oBAAoB,QACnC,0BAA0B,KAAK,IAC7B,wBACA,EAAE;GAGX,CACA,MAAM,kBAAkB,cAAc,cAAc,UAAU,MAAM,QACrE,kBAAkB,KAAK,IACrB,KAAK,IACL,cAAc;;AAGpB,SAAS,mBAAmB,SAAS;AACnC,MAAK,MAAM,aAAa,QAAQ,OAAO,eAAe,EAAE;AAEtD,MAAI,CAAC,YAAY,UAAU,EAAE;AAC3B,WAAQ,YACN,+BAA+B,QAAQ,UAAU,CAAC,IAClD,cAAc,QAAQ,cAAc,KAAK,IAAI,KAAK,IAAI,UAAU,QACjE;AACD;;AAGF,eAAa,SAAS,UAAU;AAEhC,MAAI,UAAU,UAAU,WAAW,EACjC,SAAQ,YACN,cAAc,UAAU,KAAK,qCAC7B,UAAU,QACX;AAGH,OAAK,MAAM,OAAO,UAAU,MAAM;AAEhC,gBAAa,SAAS,IAAI;AAE1B,OAAI,CAAC,YAAY,IAAI,KAAK,CACxB,SAAQ,YACN,gBAAgB,UAAU,KAAK,GAAG,IAAI,KAAK,iCAC7B,QAAQ,IAAI,KAAK,CAAC,IAChC,IAAI,QACL;AAGH,OAAI,mBAAmB,IAAI,IAAI,IAAI,qBAAqB,MAAM;IAC5D,IAAI;AAEJ,YAAQ,YACN,sBAAsB,UAAU,KAAK,GAAG,IAAI,KAAK,2BACjD,CACE,2BAA2B,IAAI,QAAQ,GACtC,eAAe,IAAI,aAAa,QAAQ,iBAAiB,KAAK,IAC3D,KAAK,IACL,aAAa,KAClB,CACF;;;;;AAMT,SAAS,aAAa,SAAS,MAAM;AAEnC,KAAI,KAAK,KAAK,WAAW,KAAK,CAC5B,SAAQ,YACN,SAAS,KAAK,KAAK,0EACnB,KAAK,QACN;;AAIL,SAAS,cAAc,SAAS;CAC9B,MAAM,kCACJ,uCAAuC,QAAQ;CACjD,MAAM,UAAU,QAAQ,OAAO,YAAY;AAE3C,MAAK,MAAM,QAAQ,OAAO,OAAO,QAAQ,EAAE;AAEzC,MAAI,CAAC,YAAY,KAAK,EAAE;AACtB,WAAQ,YACN,wCAAwC,QAAQ,KAAK,CAAC,IACtD,KAAK,QACN;AACD;;AAGF,MAAI,CAAC,oBAAoB,KAAK,CAC5B,cAAa,SAAS,KAAK;AAG7B,MAAI,aAAa,KAAK,EAAE;AAEtB,kBAAe,SAAS,KAAK;AAE7B,sBAAmB,SAAS,KAAK;aACxB,gBAAgB,KAAK,EAAE;AAEhC,kBAAe,SAAS,KAAK;AAE7B,sBAAmB,SAAS,KAAK;aACxB,YAAY,KAAK,CAE1B,sBAAqB,SAAS,KAAK;WAC1B,WAAW,KAAK,CAEzB,oBAAmB,SAAS,KAAK;WACxB,kBAAkB,KAAK,EAAE;AAElC,uBAAoB,SAAS,KAAK;AAElC,mCAAgC,KAAK;;;;AAK3C,SAAS,eAAe,SAAS,MAAM;CACrC,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAE9C,KAAI,OAAO,WAAW,EACpB,SAAQ,YAAY,QAAQ,KAAK,KAAK,mCAAmC,CACvE,KAAK,SACL,GAAG,KAAK,kBACT,CAAC;AAGJ,MAAK,MAAM,SAAS,QAAQ;AAE1B,eAAa,SAAS,MAAM;AAE5B,MAAI,CAAC,aAAa,MAAM,KAAK,EAAE;GAC7B,IAAI;AAEJ,WAAQ,YACN,eAAe,KAAK,KAAK,GAAG,MAAM,KAAK,gCACzB,QAAQ,MAAM,KAAK,CAAC,KACjC,iBAAiB,MAAM,aAAa,QAAQ,mBAAmB,KAAK,IACjE,KAAK,IACL,eAAe,KACpB;;AAGH,OAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,MAAM,UAAU,IAAI;AAEpB,gBAAa,SAAS,IAAI;AAE1B,OAAI,CAAC,YAAY,IAAI,KAAK,EAAE;IAC1B,IAAI;AAEJ,YAAQ,YACN,eAAe,KAAK,KAAK,GAAG,MAAM,KAAK,GAAG,QAAQ,iCAC/B,QAAQ,IAAI,KAAK,CAAC,KACpC,gBAAgB,IAAI,aAAa,QAAQ,kBAAkB,KAAK,IAC7D,KAAK,IACL,cAAc,KACnB;;AAGH,OAAI,mBAAmB,IAAI,IAAI,IAAI,qBAAqB,MAAM;IAC5D,IAAI;AAEJ,YAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,GAAG,QAAQ,2BACxD,CACE,2BAA2B,IAAI,QAAQ,GACtC,gBAAgB,IAAI,aAAa,QAAQ,kBAAkB,KAAK,IAC7D,KAAK,IACL,cAAc,KACnB,CACF;;;;;AAMT,SAAS,mBAAmB,SAAS,MAAM;CACzC,MAAM,iBAAiB,OAAO,OAAO,KAAK;AAE1C,MAAK,MAAM,SAAS,KAAK,eAAe,EAAE;AACxC,MAAI,CAAC,gBAAgB,MAAM,EAAE;AAC3B,WAAQ,YACN,QAAQ,QAAQ,KAAK,CAAC,4DACG,QAAQ,MAAM,CAAC,IACxC,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,MAAI,SAAS,OAAO;AAClB,WAAQ,YACN,QAAQ,KAAK,KAAK,yEAClB,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,MAAI,eAAe,MAAM,OAAO;AAC9B,WAAQ,YACN,QAAQ,KAAK,KAAK,sBAAsB,MAAM,KAAK,SACnD,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,iBAAe,MAAM,QAAQ;AAC7B,kCAAgC,SAAS,MAAM,MAAM;AACrD,kCAAgC,SAAS,MAAM,MAAM;;;AAIzD,SAAS,gCAAgC,SAAS,MAAM,OAAO;CAC7D,MAAM,eAAe,KAAK,WAAW;AAErC,MAAK,MAAM,cAAc,OAAO,OAAO,MAAM,WAAW,CAAC,EAAE;EACzD,MAAM,YAAY,WAAW;EAC7B,MAAM,YAAY,aAAa;AAE/B,MAAI,CAAC,WAAW;AACd,WAAQ,YACN,mBAAmB,MAAM,KAAK,GAAG,UAAU,gBAAgB,KAAK,KAAK,wBACrE;IAAC,WAAW;IAAS,KAAK;IAAS,GAAG,KAAK;IAAkB,CAC9D;AACD;;AAIF,MAAI,CAAC,gBAAgB,QAAQ,QAAQ,UAAU,MAAM,WAAW,KAAK,EAAE;GACrE,IAAI,qBAAqB;AAEzB,WAAQ,YACN,mBAAmB,MAAM,KAAK,GAAG,UAAU,gBACtC,QAAQ,WAAW,KAAK,CAAC,OAAO,KAAK,KAAK,GAAG,UAAU,WAC/C,QAAQ,UAAU,KAAK,CAAC,IACrC,EACG,sBAAsB,WAAW,aAAa,QAC/C,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB,OACvB,qBAAqB,UAAU,aAAa,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB,KACxB,CACF;;AAGH,OAAK,MAAM,YAAY,WAAW,MAAM;GACtC,MAAM,UAAU,SAAS;GACzB,MAAM,UAAU,UAAU,KAAK,MAAM,QAAQ,IAAI,SAAS,QAAQ;AAElE,OAAI,CAAC,SAAS;AACZ,YAAQ,YACN,4BAA4B,MAAM,KAAK,GAAG,UAAU,GAAG,QAAQ,kBAAkB,KAAK,KAAK,GAAG,UAAU,wBACxG,CAAC,SAAS,SAAS,UAAU,QAAQ,CACtC;AACD;;AAKF,OAAI,CAAC,YAAY,SAAS,MAAM,QAAQ,KAAK,EAAE;IAC7C,IAAI,mBAAmB;AAEvB,YAAQ,YACN,4BAA4B,MAAM,KAAK,GAAG,UAAU,GAAG,QAAQ,kBAC7C,QAAQ,SAAS,KAAK,CAAC,OACpC,KAAK,KAAK,GAAG,UAAU,GAAG,QAAQ,aAClC,QAAQ,QAAQ,KAAK,CAAC,IAC3B,EACG,oBAAoB,SAAS,aAAa,QAC3C,sBAAsB,KAAK,IACvB,KAAK,IACL,kBAAkB,OACrB,mBAAmB,QAAQ,aAAa,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB,KACtB,CACF;;;AAIL,OAAK,MAAM,WAAW,UAAU,MAAM;GACpC,MAAM,UAAU,QAAQ;AAGxB,OAAI,CAFa,WAAW,KAAK,MAAM,QAAQ,IAAI,SAAS,QAAQ,IAEnD,mBAAmB,QAAQ,CAC1C,SAAQ,YACN,gBAAgB,KAAK,KAAK,GAAG,UAAU,8BAA8B,QAAQ,4CAA4C,MAAM,KAAK,GAAG,UAAU,IACjJ,CAAC,QAAQ,SAAS,WAAW,QAAQ,CACtC;;;;AAMT,SAAS,gCAAgC,SAAS,MAAM,OAAO;CAC7D,MAAM,kBAAkB,KAAK,eAAe;AAE5C,MAAK,MAAM,cAAc,MAAM,eAAe,CAC5C,KAAI,CAAC,gBAAgB,SAAS,WAAW,CACvC,SAAQ,YACN,eAAe,OACX,QAAQ,KAAK,KAAK,oBAAoB,MAAM,KAAK,kDACjD,QAAQ,KAAK,KAAK,kBAAkB,WAAW,KAAK,gCAAgC,MAAM,KAAK,IACnG,CACE,GAAG,+BAA+B,OAAO,WAAW,EACpD,GAAG,+BAA+B,MAAM,MAAM,CAC/C,CACF;;AAKP,SAAS,qBAAqB,SAAS,OAAO;CAC5C,MAAM,cAAc,MAAM,UAAU;AAEpC,KAAI,YAAY,WAAW,EACzB,SAAQ,YACN,cAAc,MAAM,KAAK,yCACzB,CAAC,MAAM,SAAS,GAAG,MAAM,kBAAkB,CAC5C;CAGH,MAAM,oBAAoB,OAAO,OAAO,KAAK;AAE7C,MAAK,MAAM,cAAc,aAAa;AACpC,MAAI,kBAAkB,WAAW,OAAO;AACtC,WAAQ,YACN,cAAc,MAAM,KAAK,yBAAyB,WAAW,KAAK,SAClE,wBAAwB,OAAO,WAAW,KAAK,CAChD;AACD;;AAGF,oBAAkB,WAAW,QAAQ;AAErC,MAAI,CAAC,aAAa,WAAW,CAC3B,SAAQ,YACN,cAAc,MAAM,KAAK,oDACF,QAAQ,WAAW,CAAC,IAC3C,wBAAwB,OAAO,OAAO,WAAW,CAAC,CACnD;;;AAKP,SAAS,mBAAmB,SAAS,UAAU;CAC7C,MAAM,aAAa,SAAS,WAAW;AAEvC,KAAI,WAAW,WAAW,EACxB,SAAQ,YACN,aAAa,SAAS,KAAK,mCAC3B,CAAC,SAAS,SAAS,GAAG,SAAS,kBAAkB,CAClD;AAGH,MAAK,MAAM,aAAa,WAEtB,cAAa,SAAS,UAAU;;AAIpC,SAAS,oBAAoB,SAAS,UAAU;CAC9C,MAAM,SAAS,OAAO,OAAO,SAAS,WAAW,CAAC;AAElD,KAAI,OAAO,WAAW,EACpB,SAAQ,YACN,qBAAqB,SAAS,KAAK,mCACnC,CAAC,SAAS,SAAS,GAAG,SAAS,kBAAkB,CAClD;AAGH,MAAK,MAAM,SAAS,QAAQ;AAE1B,eAAa,SAAS,MAAM;AAE5B,MAAI,CAAC,YAAY,MAAM,KAAK,EAAE;GAC5B,IAAI;AAEJ,WAAQ,YACN,eAAe,SAAS,KAAK,GAAG,MAAM,KAAK,+BAC7B,QAAQ,MAAM,KAAK,CAAC,KACjC,kBAAkB,MAAM,aAAa,QAAQ,oBAAoB,KAAK,IACnE,KAAK,IACL,gBAAgB,KACrB;;AAGH,MAAI,qBAAqB,MAAM,IAAI,MAAM,qBAAqB,MAAM;GAClE,IAAI;AAEJ,WAAQ,YACN,wBAAwB,SAAS,KAAK,GAAG,MAAM,KAAK,yBACpD,CACE,2BAA2B,MAAM,QAAQ,GACxC,kBAAkB,MAAM,aAAa,QACtC,oBAAoB,KAAK,IACrB,KAAK,IACL,gBAAgB,KACrB,CACF;;AAGH,MAAI,SAAS,QACX,+BAA8B,UAAU,OAAO,QAAQ;;;AAK7D,SAAS,8BAA8B,MAAM,OAAO,SAAS;AAC3D,KAAI,cAAc,MAAM,KAAK,EAAE;EAC7B,IAAI;AAEJ,UAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,sBAC5C,kBAAkB,MAAM,aAAa,QAAQ,oBAAoB,KAAK,IACnE,KAAK,IACL,gBAAgB,KACrB;;AAGH,KAAI,MAAM,iBAAiB,KAAA,EACzB,SAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,gCAC7C,MAAM,QACP;;AAIL,SAAS,uCAAuC,SAAS;CAIvD,MAAM,eAAe,OAAO,OAAO,KAAK;CAExC,MAAM,YAAY,EAAE;CAEpB,MAAM,2BAA2B,OAAO,OAAO,KAAK;AACpD,QAAO;CAIP,SAAS,qBAAqB,UAAU;AACtC,MAAI,aAAa,SAAS,MACxB;AAGF,eAAa,SAAS,QAAQ;AAC9B,2BAAyB,SAAS,QAAQ,UAAU;EACpD,MAAM,SAAS,OAAO,OAAO,SAAS,WAAW,CAAC;AAElD,OAAK,MAAM,SAAS,OAClB,KAAI,cAAc,MAAM,KAAK,IAAI,kBAAkB,MAAM,KAAK,OAAO,EAAE;GACrE,MAAM,YAAY,MAAM,KAAK;GAC7B,MAAM,aAAa,yBAAyB,UAAU;AACtD,aAAU,KAAK,MAAM;AAErB,OAAI,eAAe,KAAA,EACjB,sBAAqB,UAAU;QAC1B;IACL,MAAM,YAAY,UAAU,MAAM,WAAW;IAC7C,MAAM,UAAU,UAAU,KAAK,aAAa,SAAS,KAAK,CAAC,KAAK,IAAI;AACpE,YAAQ,YACN,kCAAkC,UAAU,KAAK,wDAAwD,QAAQ,KACjH,UAAU,KAAK,aAAa,SAAS,QAAQ,CAC9C;;AAGH,aAAU,KAAK;;AAInB,2BAAyB,SAAS,QAAQ,KAAA;;;AAI9C,SAAS,+BAA+B,MAAM,OAAO;CACnD,MAAM,EAAE,SAAS,sBAAsB;AAIvC,SAFE,WAAW,OAAO,CAAC,SAAS,GAAG,kBAAkB,GAAG,mBAGnD,SAAS,aAAa;EACrB,IAAI;AAEJ,UAEG,uBAAuB,SAAS,gBAAgB,QAC/C,yBAAyB,KAAK,IAC5B,uBACA,EAAE;GAER,CACD,QAAQ,cAAc,UAAU,KAAK,UAAU,MAAM,KAAK;;AAG/D,SAAS,wBAAwB,OAAO,UAAU;CAChD,MAAM,EAAE,SAAS,sBAAsB;AAIvC,SAFE,WAAW,OAAO,CAAC,SAAS,GAAG,kBAAkB,GAAG,mBAGnD,SAAS,cAAc;EACtB,IAAI;AAEJ,UAEG,mBAAmB,UAAU,WAAW,QACvC,qBAAqB,KAAK,IACxB,mBACA,EAAE;GAER,CACD,QAAQ,aAAa,SAAS,KAAK,UAAU,SAAS;;AAG3D,SAAS,2BAA2B,gBAAgB;CAClD,IAAI;AAEJ,QAAO,mBAAmB,QAAQ,mBAAmB,KAAK,IACtD,KAAK,KACJ,wBAAwB,eAAe,gBAAgB,QACxD,0BAA0B,KAAK,IAC/B,KAAK,IACL,sBAAsB,MACnB,SAAS,KAAK,KAAK,UAAU,2BAA2B,KAC1D;;;;ACrqBP,SAAgB,YAAY,QAAQ,UAAU;AAC5C,SAAQ,SAAS,MAAjB;EACE,KAAK,KAAK,WAAW;GACnB,MAAM,YAAY,YAAY,QAAQ,SAAS,KAAK;AACpD,UAAO,aAAa,IAAI,YAAY,UAAU;;EAGhD,KAAK,KAAK,eAAe;GACvB,MAAM,YAAY,YAAY,QAAQ,SAAS,KAAK;AACpD,UAAO,aAAa,IAAI,eAAe,UAAU;;EAGnD,KAAK,KAAK,WACR,QAAO,OAAO,QAAQ,SAAS,KAAK,MAAM;;;;;;;;;;ACYhD,IAAa,WAAb,MAAsB;CACpB,YACE,QAKA,aAEA,eACA;AACA,OAAK,UAAU;AACf,OAAK,aAAa,EAAE;AACpB,OAAK,mBAAmB,EAAE;AAC1B,OAAK,kBAAkB,EAAE;AACzB,OAAK,iBAAiB,EAAE;AACxB,OAAK,qBAAqB,EAAE;AAC5B,OAAK,aAAa;AAClB,OAAK,YAAY;AACjB,OAAK,aAAa;AAClB,OAAK,eACH,kBAAkB,QAAQ,kBAAkB,KAAK,IAC7C,gBACA;AAEN,MAAI,aAAa;AACf,OAAI,YAAY,YAAY,CAC1B,MAAK,gBAAgB,KAAK,YAAY;AAGxC,OAAI,gBAAgB,YAAY,CAC9B,MAAK,iBAAiB,KAAK,YAAY;AAGzC,OAAI,aAAa,YAAY,CAC3B,MAAK,WAAW,KAAK,YAAY;;;CAKvC,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,UAAU;AACR,MAAI,KAAK,WAAW,SAAS,EAC3B,QAAO,KAAK,WAAW,KAAK,WAAW,SAAS;;CAIpD,gBAAgB;AACd,MAAI,KAAK,iBAAiB,SAAS,EACjC,QAAO,KAAK,iBAAiB,KAAK,iBAAiB,SAAS;;CAIhE,eAAe;AACb,MAAI,KAAK,gBAAgB,SAAS,EAChC,QAAO,KAAK,gBAAgB,KAAK,gBAAgB,SAAS;;CAI9D,qBAAqB;AACnB,MAAI,KAAK,gBAAgB,SAAS,EAChC,QAAO,KAAK,gBAAgB,KAAK,gBAAgB,SAAS;;CAI9D,cAAc;AACZ,MAAI,KAAK,eAAe,SAAS,EAC/B,QAAO,KAAK,eAAe,KAAK,eAAe,SAAS;;CAI5D,kBAAkB;AAChB,MAAI,KAAK,mBAAmB,SAAS,EACnC,QAAO,KAAK,mBAAmB,KAAK,mBAAmB,SAAS;;CAIpE,eAAe;AACb,SAAO,KAAK;;CAGd,cAAc;AACZ,SAAO,KAAK;;CAGd,eAAe;AACb,SAAO,KAAK;;CAGd,MAAM,MAAM;EACV,MAAM,SAAS,KAAK;AAKpB,UAAQ,KAAK,MAAb;GACE,KAAK,KAAK,eAAe;IACvB,MAAM,YAAY,aAAa,KAAK,SAAS,CAAC;AAE9C,SAAK,iBAAiB,KACpB,gBAAgB,UAAU,GAAG,YAAY,KAAA,EAC1C;AAED;;GAGF,KAAK,KAAK,OAAO;IACf,MAAM,aAAa,KAAK,eAAe;IACvC,IAAI;IACJ,IAAI;AAEJ,QAAI,YAAY;AACd,gBAAW,KAAK,aAAa,QAAQ,YAAY,KAAK;AAEtD,SAAI,SACF,aAAY,SAAS;;AAIzB,SAAK,eAAe,KAAK,SAAS;AAElC,SAAK,WAAW,KAAK,aAAa,UAAU,GAAG,YAAY,KAAA,EAAU;AAErE;;GAGF,KAAK,KAAK;AACR,SAAK,aAAa,OAAO,aAAa,KAAK,KAAK,MAAM;AACtD;GAEF,KAAK,KAAK,sBAAsB;IAC9B,MAAM,WAAW,OAAO,YAAY,KAAK,UAAU;AAEnD,SAAK,WAAW,KAAK,aAAa,SAAS,GAAG,WAAW,KAAA,EAAU;AAEnE;;GAGF,KAAK,KAAK;GACV,KAAK,KAAK,qBAAqB;IAC7B,MAAM,mBAAmB,KAAK;IAC9B,MAAM,aAAa,mBACf,YAAY,QAAQ,iBAAiB,GACrC,aAAa,KAAK,SAAS,CAAC;AAEhC,SAAK,WAAW,KAAK,aAAa,WAAW,GAAG,aAAa,KAAA,EAAU;AAEvE;;GAGF,KAAK,KAAK,qBAAqB;IAC7B,MAAM,YAAY,YAAY,QAAQ,KAAK,KAAK;AAEhD,SAAK,gBAAgB,KACnB,YAAY,UAAU,GAAG,YAAY,KAAA,EACtC;AAED;;GAGF,KAAK,KAAK,UAAU;IAClB,IAAI;IAEJ,IAAI;IACJ,IAAI;IACJ,MAAM,oBACH,qBAAqB,KAAK,cAAc,MAAM,QAC/C,uBAAuB,KAAK,IACxB,qBACA,KAAK,aAAa;AAExB,QAAI,kBAAkB;AACpB,cAAS,iBAAiB,KAAK,MAC5B,QAAQ,IAAI,SAAS,KAAK,KAAK,MACjC;AAED,SAAI,OACF,WAAU,OAAO;;AAIrB,SAAK,YAAY;AAEjB,SAAK,mBAAmB,KAAK,SAAS,OAAO,eAAe,KAAA,EAAU;AAEtE,SAAK,gBAAgB,KAAK,YAAY,QAAQ,GAAG,UAAU,KAAA,EAAU;AAErE;;GAGF,KAAK,KAAK,MAAM;IACd,MAAM,WAAW,gBAAgB,KAAK,cAAc,CAAC;IACrD,MAAM,WAAW,WAAW,SAAS,GAAG,SAAS,SAAS;AAE1D,SAAK,mBAAmB,KAAK,KAAA,EAAU;AAEvC,SAAK,gBAAgB,KAAK,YAAY,SAAS,GAAG,WAAW,KAAA,EAAU;AAEvE;;GAGF,KAAK,KAAK,cAAc;IACtB,MAAM,aAAa,aAAa,KAAK,cAAc,CAAC;IACpD,IAAI;IACJ,IAAI;AAEJ,QAAI,kBAAkB,WAAW,EAAE;AACjC,kBAAa,WAAW,WAAW,CAAC,KAAK,KAAK;AAE9C,SAAI,WACF,kBAAiB,WAAW;;AAIhC,SAAK,mBAAmB,KACtB,aAAa,WAAW,eAAe,KAAA,EACxC;AAED,SAAK,gBAAgB,KACnB,YAAY,eAAe,GAAG,iBAAiB,KAAA,EAChD;AAED;;GAGF,KAAK,KAAK,MAAM;IACd,MAAM,WAAW,aAAa,KAAK,cAAc,CAAC;IAClD,IAAI;AAEJ,QAAI,WAAW,SAAS,CACtB,aAAY,SAAS,SAAS,KAAK,MAAM;AAG3C,SAAK,aAAa;AAClB;;GAGF;;;CAIJ,MAAM,MAAM;AACV,UAAQ,KAAK,MAAb;GACE,KAAK,KAAK;AACR,SAAK,iBAAiB,KAAK;AAE3B;GAEF,KAAK,KAAK;AACR,SAAK,eAAe,KAAK;AAEzB,SAAK,WAAW,KAAK;AAErB;GAEF,KAAK,KAAK;AACR,SAAK,aAAa;AAClB;GAEF,KAAK,KAAK;GACV,KAAK,KAAK;GACV,KAAK,KAAK;AACR,SAAK,WAAW,KAAK;AAErB;GAEF,KAAK,KAAK;AACR,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;AACR,SAAK,YAAY;AAEjB,SAAK,mBAAmB,KAAK;AAE7B,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;GACV,KAAK,KAAK;AACR,SAAK,mBAAmB,KAAK;AAE7B,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;AACR,SAAK,aAAa;AAClB;GAEF;;;;;;;;;AAUN,SAAS,YAAY,QAAQ,YAAY,WAAW;CAClD,MAAM,OAAO,UAAU,KAAK;AAE5B,KACE,SAAS,mBAAmB,QAC5B,OAAO,cAAc,KAAK,WAE1B,QAAO;AAGT,KAAI,SAAS,iBAAiB,QAAQ,OAAO,cAAc,KAAK,WAC9D,QAAO;AAGT,KAAI,SAAS,qBAAqB,QAAQ,gBAAgB,WAAW,CACnE,QAAO;AAGT,KAAI,aAAa,WAAW,IAAI,gBAAgB,WAAW,CACzD,QAAO,WAAW,WAAW,CAAC;;;;;;AAQlC,SAAgB,kBAAkB,UAAU,SAAS;AACnD,QAAO;EACL,MAAM,GAAG,MAAM;GACb,MAAM,OAAO,KAAK;AAClB,YAAS,MAAM,KAAK;GACpB,MAAM,KAAK,qBAAqB,SAAS,KAAK,KAAK,CAAC;AAEpD,OAAI,IAAI;IACN,MAAM,SAAS,GAAG,MAAM,SAAS,KAAK;AAEtC,QAAI,WAAW,KAAA,GAAW;AACxB,cAAS,MAAM,KAAK;AAEpB,SAAI,OAAO,OAAO,CAChB,UAAS,MAAM,OAAO;;AAI1B,WAAO;;;EAIX,MAAM,GAAG,MAAM;GACb,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,qBAAqB,SAAS,KAAK,KAAK,CAAC;GACpD,IAAI;AAEJ,OAAI,GACF,UAAS,GAAG,MAAM,SAAS,KAAK;AAGlC,YAAS,MAAM,KAAK;AACpB,UAAO;;EAEV;;;;ACjYH,SAAgB,2BAA2B,MAAM;AAC/C,QACE,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK;;AAwCvB,SAAgB,2BAA2B,MAAM;AAC/C,QACE,KAAK,SAAS,KAAK,qBACnB,qBAAqB,KAAK,IAC1B,KAAK,SAAS,KAAK;;AAGvB,SAAgB,qBAAqB,MAAM;AACzC,QACE,KAAK,SAAS,KAAK,0BACnB,KAAK,SAAS,KAAK,0BACnB,KAAK,SAAS,KAAK,6BACnB,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK;;AAGvB,SAAgB,0BAA0B,MAAM;AAC9C,QAAO,KAAK,SAAS,KAAK,oBAAoB,oBAAoB,KAAK;;AAEzE,SAAgB,oBAAoB,MAAM;AACxC,QACE,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,4BACnB,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK,uBACnB,KAAK,SAAS,KAAK;;;;;;;;;;;;AClEvB,SAAgB,0BAA0B,SAAS;AACjD,QAAO,EACL,SAAS,MAAM;AACb,OAAK,MAAM,cAAc,KAAK,YAC5B,KAAI,CAAC,2BAA2B,WAAW,EAAE;GAC3C,MAAM,UACJ,WAAW,SAAS,KAAK,qBACzB,WAAW,SAAS,KAAK,mBACrB,WACA,OAAM,WAAW,KAAK,QAAQ;AACpC,WAAQ,YACN,IAAI,aAAa,OAAO,QAAQ,iCAAiC,EAC/D,OAAO,YACR,CAAC,CACH;;AAIL,SAAO;IAEV;;;;;;;;;;;;ACdH,SAAgB,wBAAwB,SAAS;AAC/C,QAAO,EACL,MAAM,MAAM;EACV,MAAM,OAAO,QAAQ,eAAe;AAEpC,MAAI;OAGE,CAFa,QAAQ,aAAa,EAEvB;IAEb,MAAM,SAAS,QAAQ,WAAW;IAClC,MAAM,YAAY,KAAK,KAAK;IAE5B,IAAI,aAAa,WACf,gCACA,sBAAsB,QAAQ,MAAM,UAAU,CAC/C;AAED,QAAI,eAAe,GACjB,cAAa,WAAW,uBAAuB,MAAM,UAAU,CAAC;AAGlE,YAAQ,YACN,IAAI,aACF,uBAAuB,UAAU,aAAa,KAAK,KAAK,MACtD,YACF,EACE,OAAO,MACR,CACF,CACF;;;IAIR;;;;;;;AAQH,SAAS,sBAAsB,QAAQ,MAAM,WAAW;AACtD,KAAI,CAAC,eAAe,KAAK,CAEvB,QAAO,EAAE;CAGX,MAAM,iCAAiB,IAAI,KAAK;CAChC,MAAM,aAAa,OAAO,OAAO,KAAK;AAEtC,MAAK,MAAM,gBAAgB,OAAO,iBAAiB,KAAK,EAAE;AACxD,MAAI,CAAC,aAAa,WAAW,CAAC,WAC5B;AAGF,iBAAe,IAAI,aAAa;AAChC,aAAW,aAAa,QAAQ;AAEhC,OAAK,MAAM,qBAAqB,aAAa,eAAe,EAAE;GAC5D,IAAI;AAEJ,OAAI,CAAC,kBAAkB,WAAW,CAAC,WACjC;AAGF,kBAAe,IAAI,kBAAkB;AACrC,cAAW,kBAAkB,UACzB,wBAAwB,WAAW,kBAAkB,WACrD,QAAQ,0BAA0B,KAAK,IACrC,wBACA,KAAK;;;AAIf,QAAO,CAAC,GAAG,eAAe,CACvB,MAAM,OAAO,UAAU;EAEtB,MAAM,iBAAiB,WAAW,MAAM,QAAQ,WAAW,MAAM;AAEjE,MAAI,mBAAmB,EACrB,QAAO;AAGT,MAAI,gBAAgB,MAAM,IAAI,OAAO,UAAU,OAAO,MAAM,CAC1D,QAAO;AAGT,MAAI,gBAAgB,MAAM,IAAI,OAAO,UAAU,OAAO,MAAM,CAC1D,QAAO;AAGT,SAAO,eAAe,MAAM,MAAM,MAAM,KAAK;GAC7C,CACD,KAAK,MAAM,EAAE,KAAK;;;;;;AAOvB,SAAS,uBAAuB,MAAM,WAAW;AAC/C,KAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,CAE7C,QAAO,eAAe,WADK,OAAO,KAAK,KAAK,WAAW,CAAC,CACJ;AAGtD,QAAO,EAAE;;;;;;;;;;;;;AC/GX,SAAgB,8BAA8B,SAAS;AACrD,QAAO;EACL,eAAe,MAAM;GACnB,MAAM,gBAAgB,KAAK;AAE3B,OAAI,eAAe;IACjB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,cAAc;AAE5D,QAAI,QAAQ,CAAC,gBAAgB,KAAK,EAAE;KAClC,MAAM,UAAU,MAAM,cAAc;AACpC,aAAQ,YACN,IAAI,aACF,oDAAoD,QAAQ,KAC5D,EACE,OAAO,eACR,CACF,CACF;;;;EAKP,mBAAmB,MAAM;GACvB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,cAAc;AAEjE,OAAI,QAAQ,CAAC,gBAAgB,KAAK,EAAE;IAClC,MAAM,UAAU,MAAM,KAAK,cAAc;AACzC,YAAQ,YACN,IAAI,aACF,aAAa,KAAK,KAAK,MAAM,4CAA4C,QAAQ,KACjF,EACE,OAAO,KAAK,eACb,CACF,CACF;;;EAGN;;;;;;;;;;;;;ACpCH,SAAgB,uBAAuB,SAAS;AAC9C,QAAO;EAEL,GAAG,mCAAmC,QAAQ;EAE9C,SAAS,SAAS;GAChB,MAAM,SAAS,QAAQ,aAAa;GACpC,MAAM,WAAW,QAAQ,aAAa;GACtC,MAAM,aAAa,QAAQ,eAAe;AAE1C,OAAI,CAAC,UAAU,YAAY,YAAY;IACrC,MAAM,UAAU,QAAQ,KAAK;IAE7B,MAAM,cAAc,eAAe,SADZ,SAAS,KAAK,KAAK,QAAQ,IAAI,KAAK,CACA;AAC3D,YAAQ,YACN,IAAI,aACF,qBAAqB,QAAQ,cAAc,WAAW,KAAK,GAAG,SAAS,KAAK,MAC1E,WAAW,YAAY,EACzB,EACE,OAAO,SACR,CACF,CACF;;;EAGN;;;;;AAMH,SAAgB,mCAAmC,SAAS;CAC1D,MAAM,gBAAgB,OAAO,OAAO,KAAK;CACzC,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,eAAc,UAAU,QAAQ,UAAU,KAAK,KAAK,QAAQ,IAAI,KAAK;CAGvE,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,sBAAsB;EAC1C,IAAI;;EAKJ,MAAM,aACH,iBAAiB,IAAI,eAAe,QAAQ,mBAAmB,KAAK,IACjE,iBACA,EAAE;AACR,gBAAc,IAAI,KAAK,SAAS,UAAU,KAAK,QAAQ,IAAI,KAAK,MAAM;;AAI1E,QAAO,EACL,UAAU,eAAe;EACvB,MAAM,gBAAgB,cAAc,KAAK;EACzC,MAAM,YAAY,cAAc;AAEhC,MAAI,cAAc,aAAa,UAC7B,MAAK,MAAM,WAAW,cAAc,WAAW;GAC7C,MAAM,UAAU,QAAQ,KAAK;AAE7B,OAAI,CAAC,UAAU,SAAS,QAAQ,EAAE;IAChC,MAAM,cAAc,eAAe,SAAS,UAAU;AACtD,YAAQ,YACN,IAAI,aACF,qBAAqB,QAAQ,mBAAmB,cAAc,MAC5D,WAAW,YAAY,EACzB,EACE,OAAO,SACR,CACF,CACF;;;AAKP,SAAO;IAEV;;;;;;;;;;;;ACpFH,SAAgB,oBAAoB,SAAS;CAC3C,MAAM,eAAe,OAAO,OAAO,KAAK;CACxC,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,cAAa,UAAU,QAAQ,UAAU;CAG3C,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,qBACpB,cAAa,IAAI,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,KAAK,MAAM;AAI1E,QAAO,EACL,UAAU,MAAM,MAAM,SAAS,OAAO,WAAW;EAC/C,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,YAAY,aAAa;AAE/B,MAAI,CAAC,WAAW;AACd,WAAQ,YACN,IAAI,aAAa,uBAAuB,KAAK,KAAK,EAChD,OAAO,MACR,CAAC,CACH;AACD;;EAGF,MAAM,oBAAoB,+BAA+B,UAAU;AAEnE,MAAI,qBAAqB,CAAC,UAAU,SAAS,kBAAkB,CAC7D,SAAQ,YACN,IAAI,aACF,eAAe,KAAK,uBAAuB,kBAAkB,IAC7D,EACE,OAAO,MACR,CACF,CACF;IAGN;;AAGH,SAAS,+BAA+B,WAAW;CACjD,MAAM,YAAY,UAAU,UAAU,SAAS;AAC/C,WAAU,aAAa,UAAU,MAAM;AAEvC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,qBACR,QAAO,iCAAiC,UAAU,UAAU;EAE9D,KAAK,KAAK,MACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,gBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,gBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,iBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,iBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,yBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,qBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,4BACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,wBAAwB;GAChC,MAAM,aAAa,UAAU,UAAU,SAAS;AAChD,aAAU,cAAc,UAAU,MAAM;AACxC,UAAO,WAAW,SAAS,KAAK,+BAC5B,kBAAkB,yBAClB,kBAAkB;;EAMxB,QACW,WAAU,OAAO,sBAAsB,QAAQ,UAAU,KAAK,CAAC;;;AAI9E,SAAS,iCAAiC,WAAW;AACnD,SAAQ,WAAR;EACE,KAAK,kBAAkB,MACrB,QAAO,kBAAkB;EAE3B,KAAK,kBAAkB,SACrB,QAAO,kBAAkB;EAE3B,KAAK,kBAAkB,aACrB,QAAO,kBAAkB;;;;;;;;;;;;;ACzI/B,SAAgB,uBAAuB,SAAS;AAC9C,QAAO,EACL,eAAe,MAAM;EACnB,MAAM,eAAe,KAAK,KAAK;AAG/B,MAAI,CAFa,QAAQ,YAAY,aAAa,CAGhD,SAAQ,YACN,IAAI,aAAa,qBAAqB,aAAa,KAAK,EACtD,OAAO,KAAK,MACb,CAAC,CACH;IAGN;;;;;;;;;;;;ACLH,SAAgB,mBAAmB,SAAS;CAC1C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,mBAAmB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC3E,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,MAAK,MAAM,OAAO,QAAQ,aAAa,CAAC,YACtC,KAAI,qBAAqB,IAAI,CAC3B,cAAa,IAAI,KAAK,SAAS;CAInC,MAAM,YAAY,CAChB,GAAG,OAAO,KAAK,iBAAiB,EAChC,GAAG,OAAO,KAAK,aAAa,CAC7B;AACD,QAAO,EACL,UAAU,MAAM,IAAI,QAAQ,IAAI,WAAW;EACzC,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,iBAAiB,aAAa,CAAC,aAAa,WAAW;GAC1D,IAAI;GAEJ,MAAM,kBACH,cAAc,UAAU,QAAQ,QAAQ,gBAAgB,KAAK,IAC1D,cACA;GACN,MAAM,QAAQ,kBAAkB,QAAQ,UAAU,eAAe;AAEjE,OAAI,SAAS,kBAAkB,SAAS,SAAS,CAC/C;GAGF,MAAM,iBAAiB,eACrB,UACA,QAAQ,kBAAkB,OAAO,UAAU,GAAG,UAC/C;AACD,WAAQ,YACN,IAAI,aACF,iBAAiB,SAAS,MAAM,WAAW,eAAe,EAC1D,EACE,OAAO,MACR,CACF,CACF;;IAGN;;AAEH,MAAM,oBAAoB,CAAC,GAAG,sBAAsB,GAAG,mBAAmB,CAAC,KACxE,SAAS,KAAK,KAChB;AAED,SAAS,UAAU,OAAO;AACxB,QACE,UAAU,UACT,2BAA2B,MAAM,IAAI,0BAA0B,MAAM;;;;;;;;;;;;AC/D1E,SAAgB,2BAA2B,SAAS;CAClD,IAAI,iBAAiB;AACrB,QAAO;EACL,SAAS,MAAM;AACb,oBAAiB,KAAK,YAAY,QAC/B,eAAe,WAAW,SAAS,KAAK,qBAC1C,CAAC;;EAGJ,oBAAoB,MAAM;AACxB,OAAI,CAAC,KAAK,QAAQ,iBAAiB,EACjC,SAAQ,YACN,IAAI,aACF,gEACA,EACE,OAAO,MACR,CACF,CACF;;EAGN;;;;;;;;;ACzBH,SAAgB,yBAAyB,SAAS;CAChD,IAAI,MAAM,OAAO;CAEjB,MAAM,YAAY,QAAQ,WAAW;CACrC,MAAM,kBACH,QACE,SACE,qBACC,cAAc,QAAQ,cAAc,KAAK,IACrC,KAAK,IACL,UAAU,aAAa,QAAQ,uBAAuB,KAAK,IAC7D,qBACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,cAAc,MAAM,QAAQ,UAAU,KAAK,IACvD,QACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,iBAAiB,MAAM,QAAQ,SAAS,KAAK,IACzD,OACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,qBAAqB;CACrC,IAAI,yBAAyB;AAC7B,QAAO,EACL,iBAAiB,MAAM;AACrB,MAAI,gBAAgB;AAClB,WAAQ,YACN,IAAI,aACF,yDACA,EACE,OAAO,MACR,CACF,CACF;AACD;;AAGF,MAAI,yBAAyB,EAC3B,SAAQ,YACN,IAAI,aAAa,4CAA4C,EAC3D,OAAO,MACR,CAAC,CACH;AAGH,IAAE;IAEL;;;;ACrDH,MAAM,kBAAkB;AACxB,SAAgB,0BAA0B,SAAS;;;;;CAKjD,SAAS,WAAW,MAAM,mBAAmB,OAAO,OAAO,KAAK,EAAE,QAAQ,GAAG;AAC3E,MAAI,KAAK,SAAS,KAAK,iBAAiB;GACtC,MAAM,eAAe,KAAK,KAAK;AAE/B,OAAI,iBAAiB,kBAAkB,KAErC,QAAO;GAGT,MAAM,WAAW,QAAQ,YAAY,aAAa;AAElD,OAAI,CAAC,SAEH,QAAO;AAOT,OAAI;AACF,qBAAiB,gBAAgB;AACjC,WAAO,WAAW,UAAU,kBAAkB,MAAM;aAC5C;AACR,qBAAiB,gBAAgB,KAAA;;;AAIrC,MACE,KAAK,SAAS,KAAK,UAClB,KAAK,KAAK,UAAU,YACnB,KAAK,KAAK,UAAU,gBACpB,KAAK,KAAK,UAAU,mBACpB,KAAK,KAAK,UAAU,gBACtB;AAEA;AAEA,OAAI,SAAS,gBACX,QAAO;;AAIX,MAAI,kBAAkB,QAAQ,KAAK;QAC5B,MAAM,SAAS,KAAK,aAAa,WACpC,KAAI,WAAW,OAAO,kBAAkB,MAAM,CAC5C,QAAO;;AAKb,SAAO;;AAGT,QAAO,EACL,MAAM,MAAM;AACV,MAAI,KAAK,KAAK,UAAU,cAAc,KAAK,KAAK,UAAU;OACpD,WAAW,KAAK,EAAE;AACpB,YAAQ,YACN,IAAI,aAAa,wCAAwC,EACvD,OAAO,CAAC,KAAK,EACd,CAAC,CACH;AACD,WAAO;;;IAId;;;;;;;;;;;;ACjEH,SAAgB,qBAAqB,SAAS;CAG5C,MAAM,eAAe,OAAO,OAAO,KAAK;CAExC,MAAM,aAAa,EAAE;CAErB,MAAM,wBAAwB,OAAO,OAAO,KAAK;AACjD,QAAO;EACL,2BAA2B;EAE3B,mBAAmB,MAAM;AACvB,wBAAqB,KAAK;AAC1B,UAAO;;EAEV;CAID,SAAS,qBAAqB,UAAU;AACtC,MAAI,aAAa,SAAS,KAAK,OAC7B;EAGF,MAAM,eAAe,SAAS,KAAK;AACnC,eAAa,gBAAgB;EAC7B,MAAM,cAAc,QAAQ,mBAAmB,SAAS,aAAa;AAErE,MAAI,YAAY,WAAW,EACzB;AAGF,wBAAsB,gBAAgB,WAAW;AAEjD,OAAK,MAAM,cAAc,aAAa;GACpC,MAAM,aAAa,WAAW,KAAK;GACnC,MAAM,aAAa,sBAAsB;AACzC,cAAW,KAAK,WAAW;AAE3B,OAAI,eAAe,KAAA,GAAW;IAC5B,MAAM,iBAAiB,QAAQ,YAAY,WAAW;AAEtD,QAAI,eACF,sBAAqB,eAAe;UAEjC;IACL,MAAM,YAAY,WAAW,MAAM,WAAW;IAC9C,MAAM,UAAU,UACb,MAAM,GAAG,GAAG,CACZ,KAAK,MAAM,OAAM,EAAE,KAAK,QAAQ,KAAI,CACpC,KAAK,KAAK;AACb,YAAQ,YACN,IAAI,aACF,2BAA2B,WAAW,oBACnC,YAAY,KAAK,QAAQ,QAAQ,KAAK,MACzC,EACE,OAAO,WACR,CACF,CACF;;AAGH,cAAW,KAAK;;AAGlB,wBAAsB,gBAAgB,KAAA;;;;;;;;;;;;;ACjE1C,SAAgB,yBAAyB,SAAS;CAChD,IAAI,sBAAsB,OAAO,OAAO,KAAK;AAC7C,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,0BAAsB,OAAO,OAAO,KAAK;;GAG3C,MAAM,WAAW;IACf,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,UAAU,QAAQ;KAC7B,MAAM,UAAU,KAAK,KAAK;AAE1B,SAAI,oBAAoB,aAAa,KACnC,SAAQ,YACN,IAAI,aACF,UAAU,OACN,cAAc,QAAQ,iCAAiC,UAAU,KAAK,MAAM,MAC5E,cAAc,QAAQ,oBAC1B,EACE,OAAO,CAAC,MAAM,UAAU,EACzB,CACF,CACF;;;GAIR;EAED,mBAAmB,MAAM;AACvB,uBAAoB,KAAK,SAAS,KAAK,SAAS;;EAEnD;;;;;;;;;;;;ACjCH,SAAgB,sBAAsB,SAAS;CAC7C,MAAM,gBAAgB,EAAE;CACxB,MAAM,eAAe,EAAE;AACvB,QAAO;EACL,oBAAoB,MAAM;AACxB,iBAAc,KAAK,KAAK;AACxB,UAAO;;EAGT,mBAAmB,MAAM;AACvB,gBAAa,KAAK,KAAK;AACvB,UAAO;;EAGT,UAAU,EACR,QAAQ;GACN,MAAM,mBAAmB,OAAO,OAAO,KAAK;AAE5C,QAAK,MAAM,aAAa,cACtB,MAAK,MAAM,YAAY,QAAQ,kCAC7B,UACD,CACC,kBAAiB,SAAS,KAAK,SAAS;AAI5C,QAAK,MAAM,eAAe,cAAc;IACtC,MAAM,WAAW,YAAY,KAAK;AAElC,QAAI,iBAAiB,cAAc,KACjC,SAAQ,YACN,IAAI,aAAa,aAAa,SAAS,mBAAmB,EACxD,OAAO,aACR,CAAC,CACH;;KAIR;EACF;;;;;;;;;;;;ACvCH,SAAgB,sBAAsB,SAAS;CAC7C,IAAI,eAAe,EAAE;AACrB,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,mBAAe,EAAE;;GAGnB,MAAM,WAAW;IACf,MAAM,mBAAmB,OAAO,OAAO,KAAK;IAC5C,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,UAAU,OACrB,kBAAiB,KAAK,KAAK,SAAS;AAGtC,SAAK,MAAM,eAAe,cAAc;KACtC,MAAM,eAAe,YAAY,SAAS,KAAK;AAE/C,SAAI,iBAAiB,kBAAkB,KACrC,SAAQ,YACN,IAAI,aACF,UAAU,OACN,cAAc,aAAa,gCAAgC,UAAU,KAAK,MAAM,MAChF,cAAc,aAAa,mBAC/B,EACE,OAAO,aACR,CACF,CACF;;;GAIR;EAED,mBAAmB,KAAK;AACtB,gBAAa,KAAK,IAAI;;EAEzB;;;;;;;;;;;ACtCH,SAAgB,cAAc,WAAW;AACvC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OACR,QAAO;GAAE,GAAG;GAAW,QAAQ,WAAW,UAAU,OAAO;GAAE;EAE/D,KAAK,KAAK,KACR,QAAO;GAAE,GAAG;GAAW,QAAQ,UAAU,OAAO,IAAI,cAAc;GAAE;EAEtE,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK,SACR,QAAO;;;AAIb,SAAS,WAAW,QAAQ;AAC1B,QAAO,OACJ,KAAK,eAAe;EACnB,GAAG;EACH,OAAO,cAAc,UAAU,MAAM;EACtC,EAAE,CACF,MAAM,QAAQ,WACb,eAAe,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,CACrD;;;;ACtBL,SAAS,cAAc,QAAQ;AAC7B,KAAI,MAAM,QAAQ,OAAO,CACvB,QAAO,OACJ,KACE,CAAC,cAAc,eACd,cAAc,aAAa,uBAC3B,cAAc,UAAU,CAC3B,CACA,KAAK,QAAQ;AAGlB,QAAO;;;;;;;;;;;AAYT,SAAgB,iCAAiC,SAAS;CAIxD,MAAM,iCAAiC,IAAI,gBAAgB;CAC3D,MAAM,wBAAwB,IAAI,SAAS;CAI3C,MAAM,+CAA+B,IAAI,KAAK;AAC9C,QAAO,EACL,aAAa,cAAc;EACzB,MAAM,YAAY,gCAChB,SACA,8BACA,gCACA,uBACA,QAAQ,eAAe,EACvB,aACD;AAED,OAAK,MAAM,CAAC,CAAC,cAAc,SAAS,SAAS,YAAY,WAAW;GAClE,MAAM,YAAY,cAAc,OAAO;AACvC,WAAQ,YACN,IAAI,aACF,WAAW,aAAa,qBAAqB,UAAU,+EACvD,EACE,OAAO,QAAQ,OAAO,QAAQ,EAC/B,CACF,CACF;;IAGN;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DH,SAAS,gCACP,SACA,8BACA,gCACA,uBACA,YACA,cACA;CACA,MAAM,YAAY,EAAE;CACpB,MAAM,CAAC,UAAU,iBAAiB,0BAChC,SACA,8BACA,YACA,aACD;AAGD,wBACE,SACA,WACA,8BACA,gCACA,uBACA,SACD;AAED,KAAI,cAAc,WAAW,EAG3B,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,2CACE,SACA,WACA,8BACA,gCACA,uBACA,OACA,UACA,cAAc,GACf;AAKD,OAAK,IAAI,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,IAC5C,kCACE,SACA,WACA,8BACA,gCACA,uBACA,OACA,cAAc,IACd,cAAc,GACf;;AAKP,QAAO;;AAIT,SAAS,yCACP,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,cACA;AAGA,KACE,+BAA+B,IAC7B,UACA,cACA,qBACD,CAED;AAGF,gCAA+B,IAC7B,UACA,cACA,qBACD;CACD,MAAM,WAAW,QAAQ,YAAY,aAAa;AAElD,KAAI,CAAC,SACH;CAGF,MAAM,CAAC,WAAW,2BAChB,oCACE,SACA,8BACA,SACD;AAEH,KAAI,aAAa,UACf;AAIF,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,UACD;AAGD,MAAK,MAAM,0BAA0B,wBACnC,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,uBACD;;AAKL,SAAS,iCACP,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,eACA;AAEA,KAAI,kBAAkB,cACpB;AAGF,KACE,sBAAsB,IACpB,eACA,eACA,qBACD,CAED;AAGF,uBAAsB,IAAI,eAAe,eAAe,qBAAqB;CAC7E,MAAM,YAAY,QAAQ,YAAY,cAAc;CACpD,MAAM,YAAY,QAAQ,YAAY,cAAc;AAEpD,KAAI,CAAC,aAAa,CAAC,UACjB;CAGF,MAAM,CAAC,WAAW,4BAChB,oCACE,SACA,8BACA,UACD;CACH,MAAM,CAAC,WAAW,4BAChB,oCACE,SACA,8BACA,UACD;AAGH,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,UACD;AAGD,MAAK,MAAM,2BAA2B,yBACpC,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,wBACD;AAIH,MAAK,MAAM,2BAA2B,yBACpC,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,yBACA,cACD;;AAML,SAAS,qCACP,SACA,8BACA,gCACA,uBACA,sBACA,aACA,eACA,aACA,eACA;CACA,MAAM,YAAY,EAAE;CACpB,MAAM,CAAC,WAAW,kBAAkB,0BAClC,SACA,8BACA,aACA,cACD;CACD,MAAM,CAAC,WAAW,kBAAkB,0BAClC,SACA,8BACA,aACA,cACD;AAED,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,UACD;AAGD,MAAK,MAAM,iBAAiB,eAC1B,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,cACD;AAIH,MAAK,MAAM,iBAAiB,eAC1B,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,cACD;AAKH,MAAK,MAAM,iBAAiB,eAC1B,MAAK,MAAM,iBAAiB,eAC1B,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,cACD;AAIL,QAAO;;AAGT,SAAS,uBACP,SACA,WACA,8BACA,gCACA,uBACA,UACA;AAKA,MAAK,MAAM,CAAC,cAAc,WAAW,OAAO,QAAQ,SAAS,CAI3D,KAAI,OAAO,SAAS,EAClB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IACjC,MAAK,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EAC1C,MAAM,WAAW,aACf,SACA,8BACA,gCACA,uBACA,OACA,cACA,OAAO,IACP,OAAO,GACR;AAED,MAAI,SACF,WAAU,KAAK,SAAS;;;AAYpC,SAAS,wBACP,SACA,WACA,8BACA,gCACA,uBACA,kCACA,WACA,WACA;AAMA,MAAK,MAAM,CAAC,cAAc,YAAY,OAAO,QAAQ,UAAU,EAAE;EAC/D,MAAM,UAAU,UAAU;AAE1B,MAAI,QACF,MAAK,MAAM,UAAU,QACnB,MAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,WAAW,aACf,SACA,8BACA,gCACA,uBACA,kCACA,cACA,QACA,OACD;AAED,OAAI,SACF,WAAU,KAAK,SAAS;;;;AASpC,SAAS,aACP,SACA,8BACA,gCACA,uBACA,kCACA,cACA,QACA,QACA;CACA,MAAM,CAAC,aAAa,OAAO,QAAQ;CACnC,MAAM,CAAC,aAAa,OAAO,QAAQ;CASnC,MAAM,uBACJ,oCACC,gBAAgB,eACf,aAAa,YAAY,IACzB,aAAa,YAAY;AAE7B,KAAI,CAAC,sBAAsB;EAEzB,MAAM,QAAQ,MAAM,KAAK;EACzB,MAAM,QAAQ,MAAM,KAAK;AAEzB,MAAI,UAAU,MACZ,QAAO;GACL,CAAC,cAAc,IAAI,MAAM,SAAS,MAAM,wBAAwB;GAChE,CAAC,MAAM;GACP,CAAC,MAAM;GACR;AAGH,MAAI,CAAC,cAAc,OAAO,MAAM,CAC9B,QAAO;GACL,CAAC,cAAc,gCAAgC;GAC/C,CAAC,MAAM;GACP,CAAC,MAAM;GACR;;CAIL,MAAM,QAAQ,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK;CAC/D,MAAM,QAAQ,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK;AAE/D,KAAI,SAAS,SAAS,gBAAgB,OAAO,MAAM,CACjD,QAAO;EACL,CACE,cACA,kCAAkC,QAAQ,MAAM,CAAC,SAAS,QACxD,MACD,CAAC,GACH;EACD,CAAC,MAAM;EACP,CAAC,MAAM;EACR;CAKH,MAAM,gBAAgB,MAAM;CAC5B,MAAM,gBAAgB,MAAM;AAE5B,KAAI,iBAAiB,cAYnB,QAAO,kBAXW,qCAChB,SACA,8BACA,gCACA,uBACA,sBACA,aAAa,MAAM,EACnB,eACA,aAAa,MAAM,EACnB,cACD,EACmC,cAAc,OAAO,MAAM;;AAInE,SAAS,cAAc,OAAO,OAAO;CACnC,MAAM,QAAQ,MAAM;CACpB,MAAM,QAAQ,MAAM;AAEpB,KAAI,UAAU,KAAA,KAAa,MAAM,WAAW,EAC1C,QAAO,UAAU,KAAA,KAAa,MAAM,WAAW;AAGjD,KAAI,UAAU,KAAA,KAAa,MAAM,WAAW,EAC1C,QAAO;;AAIT,KAAI,MAAM,WAAW,MAAM;;AAEzB,QAAO;CAIT,MAAM,UAAU,IAAI,IAAI,MAAM,KAAK,EAAE,MAAM,YAAY,CAAC,KAAK,OAAO,MAAM,CAAC,CAAC;AAC5E,QAAO,MAAM,OAAO,SAAS;EAC3B,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK,MAAM;AAE3C,MAAI,WAAW,KAAA,EACb,QAAO;AAGT,SAAO,eAAe,OAAO,KAAK,eAAe,OAAO;GACxD;;AAGJ,SAAS,eAAe,OAAO;AAC7B,QAAO,MAAM,cAAc,MAAM,CAAC;;AAKpC,SAAS,gBAAgB,OAAO,OAAO;AACrC,KAAI,WAAW,MAAM,CACnB,QAAO,WAAW,MAAM,GACpB,gBAAgB,MAAM,QAAQ,MAAM,OAAO,GAC3C;AAGN,KAAI,WAAW,MAAM,CACnB,QAAO;AAGT,KAAI,cAAc,MAAM,CACtB,QAAO,cAAc,MAAM,GACvB,gBAAgB,MAAM,QAAQ,MAAM,OAAO,GAC3C;AAGN,KAAI,cAAc,MAAM,CACtB,QAAO;AAGT,KAAI,WAAW,MAAM,IAAI,WAAW,MAAM,CACxC,QAAO,UAAU;AAGnB,QAAO;;AAKT,SAAS,0BACP,SACA,8BACA,YACA,cACA;CACA,MAAM,SAAS,6BAA6B,IAAI,aAAa;AAE7D,KAAI,OACF,QAAO;CAGT,MAAM,cAAc,OAAO,OAAO,KAAK;CACvC,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,gCACE,SACA,YACA,cACA,aACA,cACD;CAED,MAAM,SAAS,CAAC,aAAa,OAAO,KAAK,cAAc,CAAC;AACxD,8BAA6B,IAAI,cAAc,OAAO;AACtD,QAAO;;AAIT,SAAS,oCACP,SACA,8BACA,UACA;CAEA,MAAM,SAAS,6BAA6B,IAAI,SAAS,aAAa;AAEtE,KAAI,OACF,QAAO;AAIT,QAAO,0BACL,SACA,8BAHmB,YAAY,QAAQ,WAAW,EAAE,SAAS,cAAc,EAK3E,SAAS,aACV;;AAGH,SAAS,+BACP,SACA,YACA,cACA,aACA,eACA;AACA,MAAK,MAAM,aAAa,aAAa,WACnC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OAAO;GACf,MAAM,YAAY,UAAU,KAAK;GACjC,IAAI;AAEJ,OAAI,aAAa,WAAW,IAAI,gBAAgB,WAAW,CACzD,YAAW,WAAW,WAAW,CAAC;GAGpC,MAAM,eAAe,UAAU,QAC3B,UAAU,MAAM,QAChB;AAEJ,OAAI,CAAC,YAAY,cACf,aAAY,gBAAgB,EAAE;AAGhC,eAAY,cAAc,KAAK;IAAC;IAAY;IAAW;IAAS,CAAC;AACjE;;EAGF,KAAK,KAAK;AACR,iBAAc,UAAU,KAAK,SAAS;AACtC;EAEF,KAAK,KAAK,iBAAiB;GACzB,MAAM,gBAAgB,UAAU;AAKhC,kCACE,SALyB,gBACvB,YAAY,QAAQ,WAAW,EAAE,cAAc,GAC/C,YAKF,UAAU,cACV,aACA,cACD;AAED;;;;AAOR,SAAS,kBAAkB,WAAW,cAAc,OAAO,OAAO;AAChE,KAAI,UAAU,SAAS,EACrB,QAAO;EACL,CAAC,cAAc,UAAU,KAAK,CAAC,YAAY,OAAO,CAAC;EACnD,CAAC,OAAO,GAAG,UAAU,KAAK,GAAG,aAAa,QAAQ,CAAC,MAAM,CAAC;EAC1D,CAAC,OAAO,GAAG,UAAU,KAAK,KAAK,aAAa,QAAQ,CAAC,MAAM,CAAC;EAC7D;;;;;;;;;AAWL,IAAM,iBAAN,MAAqB;CACnB,cAAc;AACZ,OAAK,wBAAQ,IAAI,KAAK;;CAGxB,IAAI,GAAG,GAAG,eAAe;EACvB,IAAI;EAEJ,MAAM,UACH,kBAAkB,KAAK,MAAM,IAAI,EAAE,MAAM,QAC1C,oBAAoB,KAAK,IACrB,KAAK,IACL,gBAAgB,IAAI,EAAE;AAE5B,MAAI,WAAW,KAAA,EACb,QAAO;AAGT,SAAO,gBAAgB,OAAO,kBAAkB;;CAGlD,IAAI,GAAG,GAAG,eAAe;EACvB,MAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAE7B,MAAI,QAAQ,KAAA,EACV,MAAK,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;MAEhD,KAAI,IAAI,GAAG,cAAc;;;;;;;AAS/B,IAAM,UAAN,MAAc;CACZ,cAAc;AACZ,OAAK,kBAAkB,IAAI,gBAAgB;;CAG7C,IAAI,GAAG,GAAG,eAAe;AACvB,SAAO,IAAI,IACP,KAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc,GAC7C,KAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;;CAGnD,IAAI,GAAG,GAAG,eAAe;AACvB,MAAI,IAAI,EACN,MAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;MAE7C,MAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;;;;;;;;;;;;ACp0BnD,SAAgB,4BAA4B,SAAS;AACnD,QAAO;EACL,eAAe,MAAM;GACnB,MAAM,WAAW,QAAQ,SAAS;GAClC,MAAM,aAAa,QAAQ,eAAe;AAE1C,OACE,gBAAgB,SAAS,IACzB,gBAAgB,WAAW,IAC3B,CAAC,eAAe,QAAQ,WAAW,EAAE,UAAU,WAAW,EAC1D;IACA,MAAM,gBAAgB,QAAQ,WAAW;IACzC,MAAM,cAAc,QAAQ,SAAS;AACrC,YAAQ,YACN,IAAI,aACF,sDAAsD,cAAc,0BAA0B,YAAY,KAC1G,EACE,OAAO,MACR,CACF,CACF;;;EAIL,eAAe,MAAM;GACnB,MAAM,WAAW,KAAK,KAAK;GAC3B,MAAM,WAAW,gBAAgB,SAAS,SAAS;GACnD,MAAM,aAAa,QAAQ,eAAe;AAE1C,OACE,YACA,cACA,CAAC,eAAe,QAAQ,WAAW,EAAE,UAAU,WAAW,EAC1D;IACA,MAAM,gBAAgB,QAAQ,WAAW;IACzC,MAAM,cAAc,QAAQ,SAAS;AACrC,YAAQ,YACN,IAAI,aACF,aAAa,SAAS,8CAA8C,cAAc,0BAA0B,YAAY,KACxH,EACE,OAAO,MACR,CACF,CACF;;;EAGN;;AAGH,SAAS,gBAAgB,SAAS,MAAM;CACtC,MAAM,OAAO,QAAQ,YAAY,KAAK;AAEtC,KAAI,MAAM;EACR,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,cAAc;AAEjE,MAAI,gBAAgB,KAAK,CACvB,QAAO;;;;;;;;;;AChDb,SAAgB,2BAA2B,SAAS;CAClD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,MAAK,MAAM,OAAO,QAAQ,aAAa,CAAC,YACtC,KAAI,qBAAqB,IAAI,CAC3B,cAAa,IAAI,KAAK,SAAS;AAInC,QAAO;EACL,qBAAqB;EACrB,qBAAqB;EACrB,wBAAwB;EACxB,oBAAoB;EACpB,mBAAmB;EACnB,0BAA0B;EAC3B;CAED,SAAS,eAAe,MAAM;EAC5B,MAAM,WAAW,KAAK,KAAK;EAC3B,MAAM,UAAU,aAAa;EAC7B,MAAM,eACJ,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,QAAQ,SAAS;EAC1E,IAAI;AAEJ,MAAI,QACF,gBAAe,iBAAiB,QAAQ;WAC/B,aACT,gBAAe,cAAc,aAAa;AAG5C,MAAI;OACE,iBAAiB,KAAK,MAAM;IAC9B,MAAM,UAAU,wBAAwB,KAAK,KAAK;AAClD,YAAQ,YACN,IAAI,aAAa,qBAAqB,QAAQ,SAAS,SAAS,KAAK,EACnE,OAAO,UAAU,CAAC,SAAS,KAAK,GAAG,MACpC,CAAC,CACH;;SAEE;GAOL,MAAM,iBAAiB,eAAe,UANjB,OAAO,KAAK;IAC/B,GAAG;IACH,GAAI,WAAW,QAAQ,WAAW,KAAK,IACnC,KAAK,IACL,OAAO,YAAY;IACxB,CAAC,CAC2D;AAC7D,WAAQ,YACN,IAAI,aACF,uBAAuB,SAAS,gCAC9B,WAAW,eAAe,EAC5B,EACE,OAAO,KAAK,MACb,CACF,CACF;;;;AAIP,MAAM,mBAAmB;EACtB,KAAK,yBAAyB,KAAK;EACnC,KAAK,yBAAyB,KAAK;EACnC,KAAK,4BAA4B,KAAK;EACtC,KAAK,wBAAwB,KAAK;EAClC,KAAK,uBAAuB,KAAK;EACjC,KAAK,+BAA+B,KAAK;CAC3C;AAED,SAAS,cAAc,MAAM;AAC3B,KAAI,aAAa,KAAK,CACpB,QAAO,KAAK;AAGd,KAAI,aAAa,KAAK,CACpB,QAAO,KAAK;AAGd,KAAI,gBAAgB,KAAK,CACvB,QAAO,KAAK;AAGd,KAAI,YAAY,KAAK,CACnB,QAAO,KAAK;AAGd,KAAI,WAAW,KAAK,CAClB,QAAO,KAAK;AAGd,KAAI,kBAAkB,KAAK,CACzB,QAAO,KAAK;;AAKL,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;AAGhE,SAAS,wBAAwB,MAAM;AACrC,SAAQ,MAAR;EACE,KAAK,KAAK,sBACR,QAAO;EAET,KAAK,KAAK,sBACR,QAAO;EAET,KAAK,KAAK,yBACR,QAAO;EAET,KAAK,KAAK,qBACR,QAAO;EAET,KAAK,KAAK,oBACR,QAAO;EAET,KAAK,KAAK,4BACR,QAAO;EAKT,QACW,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;;;;;;;;;;ACnIpE,SAAgB,8BAA8B,SAAS;AACrD,QAAO;EAEL,GAAG,0CAA0C,QAAQ;EACrD,OAAO,EAEL,MAAM,WAAW;GACf,IAAI;GAEJ,MAAM,WAAW,QAAQ,aAAa;AAEtC,OAAI,CAAC,SACH,QAAO;GAGT,MAAM,eAAe,IAAI;;KAEtB,uBAAuB,UAAU,eAAe,QACjD,yBAAyB,KAAK,IAC1B,KAAK,IACL,qBAAqB,KAAK,QAAQ,IAAI,KAAK,MAAM;IACtD;AAED,QAAK,MAAM,UAAU,SAAS,KAC5B,KAAI,CAAC,aAAa,IAAI,OAAO,KAAK,IAAI,mBAAmB,OAAO,EAAE;IAChE,MAAM,aAAa,QAAQ,OAAO,KAAK;AACvC,YAAQ,YACN,IAAI,aACF,UAAU,SAAS,KAAK,cAAc,OAAO,KAAK,aAAa,WAAW,0CAC1E,EACE,OAAO,WACR,CACF,CACF;;KAIR;EACF;;;;;AAMH,SAAgB,0CAA0C,SAAS;CACjE,IAAI;CAEJ,MAAM,kBAAkB,OAAO,OAAO,KAAK;CAC3C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,qBACH,wBACC,WAAW,QAAQ,WAAW,KAAK,IAC/B,KAAK,IACL,OAAO,eAAe,MAAM,QAAQ,0BAA0B,KAAK,IACrE,wBACA;AAEN,MAAK,MAAM,aAAa,kBACtB,iBAAgB,UAAU,QAAQ,OAChC,UAAU,KAAK,OAAO,mBAAmB,GACxC,QAAQ,IAAI,KACd;CAGH,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,sBAAsB;EAC1C,IAAI;;EAKJ,MAAM,YACH,iBAAiB,IAAI,eAAe,QAAQ,mBAAmB,KAAK,IACjE,iBACA,EAAE;AACR,kBAAgB,IAAI,KAAK,SAAS,OAChC,SAAS,OAAO,uBAAuB,GACtC,QAAQ,IAAI,KAAK,MACnB;;AAIL,QAAO,EACL,WAAW,EAET,MAAM,eAAe;EACnB,MAAM,gBAAgB,cAAc,KAAK;EACzC,MAAM,eAAe,gBAAgB;AAErC,MAAI,cAAc;GAChB,IAAI;;GAKJ,MAAM,YACH,wBAAwB,cAAc,eAAe,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;GACR,MAAM,aAAa,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,MAAM,CAAC;AAEjE,QAAK,MAAM,CAAC,SAAS,WAAW,OAAO,QAAQ,aAAa,CAC1D,KAAI,CAAC,WAAW,IAAI,QAAQ,EAAE;IAC5B,MAAM,UAAU,OAAO,OAAO,KAAK,GAC/B,QAAQ,OAAO,KAAK,GACpB,MAAM,OAAO,KAAK;AACtB,YAAQ,YACN,IAAI,aACF,eAAe,cAAc,cAAc,QAAQ,aAAa,QAAQ,0CACxE,EACE,OAAO,eACR,CACF,CACF;;;IAKV,EACF;;AAGH,SAAS,uBAAuB,KAAK;AACnC,QAAO,IAAI,KAAK,SAAS,KAAK,iBAAiB,IAAI,gBAAgB;;;;;;;;;;AClIrE,SAAgB,gBAAgB,SAAS;AACvC,QAAO,EACL,MAAM,MAAM;EACV,MAAM,OAAO,QAAQ,SAAS;EAC9B,MAAM,eAAe,KAAK;AAE1B,MAAI;OACE,WAAW,aAAa,KAAK,CAAC;QAC5B,cAAc;KAChB,MAAM,YAAY,KAAK,KAAK;KAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,aAAQ,YACN,IAAI,aACF,UAAU,UAAU,0CAA0C,QAAQ,sBACtE,EACE,OAAO,cACR,CACF,CACF;;cAEM,CAAC,cAAc;IACxB,MAAM,YAAY,KAAK,KAAK;IAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,YACN,IAAI,aACF,UAAU,UAAU,aAAa,QAAQ,sDAAsD,UAAU,aACzG,EACE,OAAO,MACR,CACF,CACF;cACQ,aAAa,WAAW,WAAW,GAAG;IAC/C,MAAM,YAAY,KAAK,KAAK;IAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,YACN,IAAI,aACF,UAAU,UAAU,aAAa,QAAQ,2CACzC,EACE,OAAO,MACR,CACF,CACF;;;IAIR;;;;;;;ACpDH,SAAgB,eAAe,MAAM;AACnC,QAAO,KACJ,KAAK,QACJ,OAAO,QAAQ,WAAW,MAAM,IAAI,UAAU,GAAG,MAAM,MAAM,IAC9D,CACA,KAAK,GAAG;;;;;;;ACLb,SAAgB,QAAQ,MAAM,KAAK,UAAU;AAC3C,QAAO;EACL;EACA;EACA;EACD;;;;;AAMH,SAAgB,YAAY,MAAM;CAChC,MAAM,YAAY,EAAE;CACpB,IAAI,OAAO;AAEX,QAAO,MAAM;AACX,YAAU,KAAK,KAAK,IAAI;AACxB,SAAO,KAAK;;AAGd,QAAO,UAAU,SAAS;;;;;;;ACJ5B,SAAgB,iBAAiB,YAAY,MAAM,UAAU,gBAAgB;AAC3E,QAAO,qBAAqB,YAAY,MAAM,SAAS,KAAA,EAAU;;AAGnE,SAAS,eAAe,MAAM,cAAc,OAAO;CACjD,IAAI,cAAc,mBAAmB,QAAQ,aAAa;AAE1D,KAAI,KAAK,SAAS,EAChB,gBAAe,aAAa,eAAe,KAAK,CAAC;AAGnD,OAAM,UAAU,cAAc,OAAO,MAAM;AAC3C,OAAM;;AAGR,SAAS,qBAAqB,YAAY,MAAM,SAAS,MAAM;AAC7D,KAAI,cAAc,KAAK,EAAE;AACvB,MAAI,cAAc,KAChB,QAAO,qBAAqB,YAAY,KAAK,QAAQ,SAAS,KAAK;AAGrE,UACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,+BAA+B,QAAQ,KAAK,CAAC,mBAC9C,CACF;AACD;;AAGF,KAAI,cAAc,KAEhB,QAAO;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,iBAAiB,WAAW,CAC9B,QAAO,MAAM,KAAK,aAAa,WAAW,UAAU;AAElD,UAAO,qBAAqB,WAAW,UAAU,SADhC,QAAQ,MAAM,OAAO,KAAA,EAAU,CACmB;IACnE;AAGJ,SAAO,CAAC,qBAAqB,YAAY,UAAU,SAAS,KAAK,CAAC;;AAGpE,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,CAAC,aAAa,WAAW,IAAI,MAAM,QAAQ,WAAW,EAAE;AAC1D,WACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,oBAAoB,CAClE;AACD;;EAGF,MAAM,eAAe,EAAE;EACvB,MAAM,YAAY,KAAK,WAAW;AAElC,OAAK,MAAM,SAAS,OAAO,OAAO,UAAU,EAAE;GAC5C,MAAM,aAAa,WAAW,MAAM;AAEpC,OAAI,eAAe,KAAA,GAAW;AAC5B,QAAI,MAAM,iBAAiB,KAAA,EACzB,cAAa,MAAM,QAAQ,MAAM;aACxB,cAAc,MAAM,KAAK,EAAE;KACpC,MAAM,UAAU,QAAQ,MAAM,KAAK;AACnC,aACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,UAAU,MAAM,KAAK,sBAAsB,QAAQ,qBACpD,CACF;;AAGH;;AAGF,gBAAa,MAAM,QAAQ,qBACzB,YACA,MAAM,MACN,SACA,QAAQ,MAAM,MAAM,MAAM,KAAK,KAAK,CACrC;;AAGH,OAAK,MAAM,aAAa,OAAO,KAAK,WAAW,CAC7C,KAAI,CAAC,UAAU,YAAY;GACzB,MAAM,cAAc,eAClB,WACA,OAAO,KAAK,KAAK,WAAW,CAAC,CAC9B;AACD,WACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,UAAU,UAAU,4BAA4B,KAAK,KAAK,MACxD,WAAW,YAAY,CAC1B,CACF;;AAIL,MAAI,KAAK,SAAS;GAChB,MAAM,OAAO,OAAO,KAAK,aAAa;AAEtC,OAAI,KAAK,WAAW,EAClB,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,qDAAqD,KAAK,KAAK,IAChE,CACF;GAGH,MAAM,MAAM,KAAK;GACjB,MAAM,QAAQ,aAAa;AAE3B,OAAI,UAAU,KACZ,SACE,YAAY,KAAK,CAAC,OAAO,IAAI,EAC7B,OACA,IAAI,aAAa,UAAU,IAAI,qBAAqB,CACrD;;AAIL,SAAO;;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,IAAI;AAIJ,MAAI;AACF,iBAAc,KAAK,WAAW,WAAW;WAClC,OAAO;AACd,OAAI,iBAAiB,aACnB,SAAQ,YAAY,KAAK,EAAE,YAAY,MAAM;OAE7C,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,OAAO,MAAM,SAAS,EACjE,eAAe,OAChB,CAAC,CACH;AAGH;;AAGF,MAAI,gBAAgB,KAAA,EAClB,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,IAAI,CAClD;AAGH,SAAO;;;AAKA,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;;;;;AC/JtE,SAAgB,aAAa,WAAW,MAAM,WAAW;AACvD,KAAI,CAAC,UAGH;AAGF,KAAI,UAAU,SAAS,KAAK,UAAU;EACpC,MAAM,eAAe,UAAU,KAAK;AAEpC,MAAI,aAAa,QAAQ,UAAU,kBAAkB,KAAA,EAEnD;EAGF,MAAM,gBAAgB,UAAU;AAEhC,MAAI,kBAAkB,QAAQ,cAAc,KAAK,CAC/C;AAKF,SAAO;;AAGT,KAAI,cAAc,KAAK,EAAE;AACvB,MAAI,UAAU,SAAS,KAAK,KAC1B;AAGF,SAAO,aAAa,WAAW,KAAK,QAAQ,UAAU;;AAGxD,KAAI,UAAU,SAAS,KAAK,KAE1B,QAAO;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,UAAU,SAAS,KAAK,MAAM;GAChC,MAAM,gBAAgB,EAAE;AAExB,QAAK,MAAM,YAAY,UAAU,OAC/B,KAAI,kBAAkB,UAAU,UAAU,EAAE;AAG1C,QAAI,cAAc,SAAS,CACzB;AAGF,kBAAc,KAAK,KAAK;UACnB;IACL,MAAM,YAAY,aAAa,UAAU,UAAU,UAAU;AAE7D,QAAI,cAAc,KAAA,EAChB;AAGF,kBAAc,KAAK,UAAU;;AAIjC,UAAO;;EAGT,MAAM,eAAe,aAAa,WAAW,UAAU,UAAU;AAEjE,MAAI,iBAAiB,KAAA,EACnB;AAGF,SAAO,CAAC,aAAa;;AAGvB,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,UAAU,SAAS,KAAK,OAC1B;EAGF,MAAM,aAAa,OAAO,OAAO,KAAK;EACtC,MAAM,aAAa,OAAO,UAAU,SAAS,UAAU,MAAM,KAAK,MAAM;AAExE,OAAK,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,EAAE;GACnD,MAAM,YAAY,WAAW,MAAM;AAEnC,OAAI,CAAC,aAAa,kBAAkB,UAAU,OAAO,UAAU,EAAE;AAC/D,QAAI,MAAM,iBAAiB,KAAA,EACzB,YAAW,MAAM,QAAQ,MAAM;aACtB,cAAc,MAAM,KAAK,CAClC;AAGF;;GAGF,MAAM,aAAa,aAAa,UAAU,OAAO,MAAM,MAAM,UAAU;AAEvE,OAAI,eAAe,KAAA,EACjB;AAGF,cAAW,MAAM,QAAQ;;AAG3B,MAAI,KAAK,SAAS;GAChB,MAAM,OAAO,OAAO,KAAK,WAAW;AAEpC,OAAI,KAAK,WAAW,EAClB;AAGF,OAAI,WAAW,KAAK,QAAQ,KAC1B;;AAIJ,SAAO;;AAGT,KAAI,WAAW,KAAK,EAAE;EAIpB,IAAI;AAEJ,MAAI;AACF,YAAS,KAAK,aAAa,WAAW,UAAU;WACzC,QAAQ;AACf;;AAGF,MAAI,WAAW,KAAA,EACb;AAGF,SAAO;;;AAKA,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;AAItE,SAAS,kBAAkB,WAAW,WAAW;AAC/C,QACE,UAAU,SAAS,KAAK,aACvB,aAAa,QAAQ,UAAU,UAAU,KAAK,WAAW,KAAA;;;;;;;;;;;;;ACjK9D,SAAgB,kBAAkB,QAAQ,aAAa,QAAQ,SAAS;CACtE,MAAM,SAAS,EAAE;CACjB,MAAM,YACJ,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;AAE5D,KAAI;EACF,MAAM,UAAU,qBACd,QACA,aACA,SACC,UAAU;AACT,OAAI,aAAa,QAAQ,OAAO,UAAU,UACxC,OAAM,IAAI,aACR,gFACD;AAGH,UAAO,KAAK,MAAM;IAErB;AAED,MAAI,OAAO,WAAW,EACpB,QAAO,EACL,SACD;UAEI,OAAO;AACd,SAAO,KAAK,MAAM;;AAGpB,QAAO,EACL,QACD;;AAGH,SAAS,qBAAqB,QAAQ,aAAa,QAAQ,SAAS;CAClE,MAAM,gBAAgB,EAAE;AAExB,MAAK,MAAM,cAAc,aAAa;EACpC,MAAM,UAAU,WAAW,SAAS,KAAK;EACzC,MAAM,UAAU,YAAY,QAAQ,WAAW,KAAK;AAEpD,MAAI,CAAC,YAAY,QAAQ,EAAE;AAIzB,WACE,IAAI,aACF,cAAc,QAAQ,4BAHP,MAAM,WAAW,KAAK,CAGwB,2CAC7D,EACE,OAAO,WAAW,MACnB,CACF,CACF;AACD;;AAGF,MAAI,CAAC,eAAe,QAAQ,QAAQ,EAAE;AACpC,OAAI,WAAW,aACb,eAAc,WAAW,aAAa,WAAW,cAAc,QAAQ;YAC9D,cAAc,QAAQ,CAE/B,SACE,IAAI,aACF,cAAc,QAAQ,sBAHP,QAAQ,QAAQ,CAGwB,sBACvD,EACE,OAAO,YACR,CACF,CACF;AAGH;;EAGF,MAAM,QAAQ,OAAO;AAErB,MAAI,UAAU,QAAQ,cAAc,QAAQ,EAAE;AAE5C,WACE,IAAI,aACF,cAAc,QAAQ,sBAHP,QAAQ,QAAQ,CAGwB,sBACvD,EACE,OAAO,YACR,CACF,CACF;AACD;;AAGF,gBAAc,WAAW,iBACvB,OACA,UACC,MAAM,cAAc,UAAU;GAC7B,IAAI,SACF,cAAc,QAAQ,wBAAwB,QAAQ,aAAa;AAErE,OAAI,KAAK,SAAS,EAChB,WAAU,QAAQ,UAAU,eAAe,KAAK,CAAC;AAGnD,WACE,IAAI,aAAa,SAAS,OAAO,MAAM,SAAS;IAC9C,OAAO;IACP,eAAe;IAChB,CAAC,CACH;IAEJ;;AAGH,QAAO;;;;;;;;;;AAWT,SAAgB,kBAAkB,KAAK,MAAM,gBAAgB;CAC3D,IAAI;CAEJ,MAAM,gBAAgB,EAAE;CAQxB,MAAM,aAAa,QAHhB,kBAAkB,KAAK,eAAe,QAAQ,oBAAoB,KAAK,IACpE,kBACA,EAAE,GACkC,QAAQ,IAAI,KAAK,MAAM;AAEjE,MAAK,MAAM,UAAU,IAAI,MAAM;EAC7B,MAAM,OAAO,OAAO;EACpB,MAAM,UAAU,OAAO;EACvB,MAAM,eAAe,WAAW;AAEhC,MAAI,CAAC,cAAc;AACjB,OAAI,OAAO,iBAAiB,KAAA,EAC1B,eAAc,QAAQ,OAAO;YACpB,cAAc,QAAQ,CAC/B,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,sBAEzD,EACE,OAAO,MACR,CACF;AAGH;;EAGF,MAAM,YAAY,aAAa;EAC/B,IAAI,SAAS,UAAU,SAAS,KAAK;AAErC,MAAI,UAAU,SAAS,KAAK,UAAU;GACpC,MAAM,eAAe,UAAU,KAAK;AAEpC,OACE,kBAAkB,QAClB,CAAC,eAAe,gBAAgB,aAAa,EAC7C;AACA,QAAI,OAAO,iBAAiB,KAAA,EAC1B,eAAc,QAAQ,OAAO;aACpB,cAAc,QAAQ,CAC/B,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,gCACxB,aAAa,4CAC9C,EACE,OAAO,WACR,CACF;AAGH;;AAGF,YAAS,eAAe,iBAAiB;;AAG3C,MAAI,UAAU,cAAc,QAAQ,CAClC,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,sBAEzD,EACE,OAAO,WACR,CACF;EAGH,MAAM,eAAe,aAAa,WAAW,SAAS,eAAe;AAErE,MAAI,iBAAiB,KAAA,EAInB,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,MAAM,UAAU,CAAC,IACzD,EACE,OAAO,WACR,CACF;AAGH,gBAAc,QAAQ;;AAGxB,QAAO;;;;;;;;;;;;;AAcT,SAAgB,mBAAmB,cAAc,MAAM,gBAAgB;CACrE,IAAI;CAEJ,MAAM,iBACH,mBAAmB,KAAK,gBAAgB,QAAQ,qBAAqB,KAAK,IACvE,KAAK,IACL,iBAAiB,MACd,cAAc,UAAU,KAAK,UAAU,aAAa,KACtD;AAEP,KAAI,cACF,QAAO,kBAAkB,cAAc,eAAe,eAAe;;AAIzE,SAAS,eAAe,KAAK,MAAM;AACjC,QAAO,OAAO,UAAU,eAAe,KAAK,KAAK,KAAK;;;;;;;;;;;;;ACnPxD,SAAgB,cACd,QACA,WACA,gBACA,aACA,cACA;CACA,MAAM,yBAAS,IAAI,KAAK;AACxB,mBACE,QACA,WACA,gBACA,aACA,cACA,wBACA,IAAI,KAAK,CACV;AACD,QAAO;;AAwCT,SAAS,kBACP,QACA,WACA,gBACA,aACA,cACA,QACA,sBACA;AACA,MAAK,MAAM,aAAa,aAAa,WACnC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OAAO;AACf,OAAI,CAAC,kBAAkB,gBAAgB,UAAU,CAC/C;GAGF,MAAM,OAAO,iBAAiB,UAAU;GACxC,MAAM,YAAY,OAAO,IAAI,KAAK;AAElC,OAAI,cAAc,KAAA,EAChB,WAAU,KAAK,UAAU;OAEzB,QAAO,IAAI,MAAM,CAAC,UAAU,CAAC;AAG/B;;EAGF,KAAK,KAAK;AACR,OACE,CAAC,kBAAkB,gBAAgB,UAAU,IAC7C,CAAC,2BAA2B,QAAQ,WAAW,YAAY,CAE3D;AAGF,qBACE,QACA,WACA,gBACA,aACA,UAAU,cACV,QACA,qBACD;AACD;EAGF,KAAK,KAAK,iBAAiB;GACzB,MAAM,WAAW,UAAU,KAAK;AAEhC,OACE,qBAAqB,IAAI,SAAS,IAClC,CAAC,kBAAkB,gBAAgB,UAAU,CAE7C;AAGF,wBAAqB,IAAI,SAAS;GAClC,MAAM,WAAW,UAAU;AAE3B,OACE,CAAC,YACD,CAAC,2BAA2B,QAAQ,UAAU,YAAY,CAE1D;AAGF,qBACE,QACA,WACA,gBACA,aACA,SAAS,cACT,QACA,qBACD;AACD;;;;;;;;AAUR,SAAS,kBAAkB,gBAAgB,MAAM;CAC/C,MAAM,OAAO,mBAAmB,sBAAsB,MAAM,eAAe;AAE3E,MAAK,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,KAC5D,QAAO;CAGT,MAAM,UAAU,mBACd,yBACA,MACA,eACD;AAED,MACG,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,QAAQ,MAEnE,QAAO;AAGT,QAAO;;;;;AAMT,SAAS,2BAA2B,QAAQ,UAAU,MAAM;CAC1D,MAAM,oBAAoB,SAAS;AAEnC,KAAI,CAAC,kBACH,QAAO;CAGT,MAAM,kBAAkB,YAAY,QAAQ,kBAAkB;AAE9D,KAAI,oBAAoB,KACtB,QAAO;AAGT,KAAI,eAAe,gBAAgB,CACjC,QAAO,OAAO,UAAU,iBAAiB,KAAK;AAGhD,QAAO;;;;;AAMT,SAAS,iBAAiB,MAAM;AAC9B,QAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,KAAK;;;;;;;;;;;;ACvMnD,SAAgB,6BAA6B,SAAS;AACpD,QAAO,EACL,oBAAoB,MAAM;AACxB,MAAI,KAAK,cAAc,gBAAgB;GACrC,MAAM,SAAS,QAAQ,WAAW;GAClC,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,OAAI,kBAAkB;IACpB,MAAM,gBAAgB,KAAK,OAAO,KAAK,KAAK,QAAQ;IACpD,MAAM,iBAAiB,OAAO,OAAO,KAAK;IAC1C,MAAM,WAAW,QAAQ,aAAa;IACtC,MAAM,YAAY,OAAO,OAAO,KAAK;AAErC,SAAK,MAAM,cAAc,SAAS,YAChC,KAAI,WAAW,SAAS,KAAK,oBAC3B,WAAU,WAAW,KAAK,SAAS;IAIvC,MAAM,SAAS,cACb,QACA,WACA,gBACA,kBACA,KAAK,aACN;AAED,QAAI,OAAO,OAAO,GAAG;KAGnB,MAAM,uBAFsB,CAAC,GAAG,OAAO,QAAQ,CAAC,CACK,MAAM,EAAE,CACP,MAAM;AAC5D,aAAQ,YACN,IAAI,aACF,iBAAiB,OACb,iBAAiB,cAAc,2CAC/B,gEACJ,EACE,OAAO,sBACR,CACF,CACF;;AAGH,SAAK,MAAM,cAAc,OAAO,QAAQ,CAItC,KAHc,WAAW,GACD,KAAK,MAEf,WAAW,KAAK,CAC5B,SAAQ,YACN,IAAI,aACF,iBAAiB,OACb,iBAAiB,cAAc,uDAC/B,4EACJ,EACE,OAAO,YACR,CACF,CACF;;;IAMZ;;;;;;;ACxEH,SAAgB,QAAQ,MAAM,OAAO;CACnC,MAAM,yBAAS,IAAI,KAAK;AAExB,MAAK,MAAM,QAAQ,MAAM;EACvB,MAAM,MAAM,MAAM,KAAK;EACvB,MAAM,QAAQ,OAAO,IAAI,IAAI;AAE7B,MAAI,UAAU,KAAA,EACZ,QAAO,IAAI,KAAK,CAAC,KAAK,CAAC;MAEvB,OAAM,KAAK,KAAK;;AAIpB,QAAO;;;;;;;;;;ACRT,SAAgB,kCAAkC,SAAS;AACzD,QAAO;EACL,oBAAoB,eAAe;GACjC,IAAI;;GAKJ,MAAM,iBACH,wBAAwB,cAAc,eAAe,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,UAAO,mBAAmB,IAAI,cAAc,KAAK,SAAS,cAAc;;EAG1E,yBAAyB;EACzB,wBAAwB;EACxB,sBAAsB;EACtB,qBAAqB;EACtB;CAED,SAAS,2BAA2B,UAAU;EAC5C,IAAI;EAEJ,MAAM,WAAW,SAAS,KAAK;;EAI/B,MAAM,cACH,mBAAmB,SAAS,YAAY,QACzC,qBAAqB,KAAK,IACtB,mBACA,EAAE;AAER,OAAK,MAAM,YAAY,YAAY;GACjC,IAAI;GAEJ,MAAM,YAAY,SAAS,KAAK;;GAIhC,MAAM,iBACH,sBAAsB,SAAS,eAAe,QAC/C,wBAAwB,KAAK,IACzB,sBACA,EAAE;AACR,sBAAmB,GAAG,SAAS,GAAG,aAAa,cAAc;;AAG/D,SAAO;;CAGT,SAAS,mBAAmB,YAAY,eAAe;EACrD,MAAM,WAAW,QAAQ,gBAAgB,QAAQ,IAAI,KAAK,MAAM;AAEhE,OAAK,MAAM,CAAC,SAAS,aAAa,SAChC,KAAI,SAAS,SAAS,EACpB,SAAQ,YACN,IAAI,aACF,aAAa,WAAW,GAAG,QAAQ,gCACnC,EACE,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK,EACzC,CACF,CACF;AAIL,SAAO;;;;;;;;;;;;;ACnEX,SAAgB,wBAAwB,SAAS;AAC/C,QAAO;EACL,OAAO;EACP,WAAW;EACZ;CAED,SAAS,mBAAmB,YAAY;EACtC,IAAI;EAUJ,MAAM,WAAW,SAJd,wBAAwB,WAAW,eAAe,QACnD,0BAA0B,KAAK,IAC3B,wBACA,EAAE,GACiC,QAAQ,IAAI,KAAK,MAAM;AAEhE,OAAK,MAAM,CAAC,SAAS,aAAa,SAChC,KAAI,SAAS,SAAS,EACpB,SAAQ,YACN,IAAI,aACF,yCAAyC,QAAQ,KACjD,EACE,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK,EACzC,CACF,CACF;;;;;;;;;;AChCT,SAAgB,yBAAyB,SAAS;CAChD,MAAM,sBAAsB,OAAO,OAAO,KAAK;CAC/C,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO,EACL,oBAAoB,MAAM;EACxB,MAAM,gBAAgB,KAAK,KAAK;AAEhC,MACE,WAAW,QACX,WAAW,KAAK,KAChB,OAAO,aAAa,cAAc,EAClC;AACA,WAAQ,YACN,IAAI,aACF,eAAe,cAAc,0DAC7B,EACE,OAAO,KAAK,MACb,CACF,CACF;AACD;;AAGF,MAAI,oBAAoB,eACtB,SAAQ,YACN,IAAI,aACF,2CAA2C,cAAc,KACzD,EACE,OAAO,CAAC,oBAAoB,gBAAgB,KAAK,KAAK,EACvD,CACF,CACF;MAED,qBAAoB,iBAAiB,KAAK;AAG5C,SAAO;IAEV;;;;;;;;;;;;AC7BH,SAAgB,gCAAgC,SAAS;CACvD,MAAM,qBAAqB,OAAO,OAAO,KAAK;CAC9C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,oBAAmB,UAAU,QAAQ,CAAC,UAAU;CAGlD,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,qBACpB,oBAAmB,IAAI,KAAK,SAAS,CAAC,IAAI;CAI9C,MAAM,mBAAmB,OAAO,OAAO,KAAK;CAC5C,MAAM,oBAAoB,OAAO,OAAO,KAAK;AAC7C,QAAO,EAIL,MAAM,MAAM;AACV,MAAI,EAAE,gBAAgB,SAAS,CAAC,KAAK,WACnC;EAGF,IAAI;AAEJ,MACE,KAAK,SAAS,KAAK,qBACnB,KAAK,SAAS,KAAK,iBAEnB,kBAAiB;WACR,qBAAqB,KAAK,IAAI,oBAAoB,KAAK,EAAE;GAClE,MAAM,WAAW,KAAK,KAAK;AAC3B,oBAAiB,kBAAkB;AAEnC,OAAI,mBAAmB,KAAA,EACrB,mBAAkB,YAAY,iBAAiB,OAAO,OAAO,KAAK;QAGpE,kBAAiB,OAAO,OAAO,KAAK;AAGtC,OAAK,MAAM,aAAa,KAAK,YAAY;GACvC,MAAM,gBAAgB,UAAU,KAAK;AAErC,OAAI,mBAAmB,eACrB,KAAI,eAAe,eACjB,SAAQ,YACN,IAAI,aACF,mBAAmB,cAAc,4CACjC,EACE,OAAO,CAAC,eAAe,gBAAgB,UAAU,EAClD,CACF,CACF;OAED,gBAAe,iBAAiB;;IAKzC;;;;;;;;;AC3EH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,kBAAkB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC1E,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAC3C,QAAO;EACL,oBAAoB;EACpB,mBAAmB;EACpB;CAED,SAAS,qBAAqB,MAAM;EAClC,IAAI;EAEJ,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,gBAAgB,UACnB,iBAAgB,YAAY,OAAO,OAAO,KAAK;;EAKjD,MAAM,cACH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;EACR,MAAM,aAAa,gBAAgB;AAEnC,OAAK,MAAM,YAAY,YAAY;GACjC,MAAM,YAAY,SAAS,KAAK;GAChC,MAAM,eAAe,gBAAgB;AAErC,OAAI,WAAW,aAAa,IAAI,aAAa,SAAS,UAAU,CAC9D,SAAQ,YACN,IAAI,aACF,eAAe,SAAS,GAAG,UAAU,oFACrC,EACE,OAAO,SAAS,MACjB,CACF,CACF;YACQ,WAAW,WACpB,SAAQ,YACN,IAAI,aACF,eAAe,SAAS,GAAG,UAAU,8BACrC,EACE,OAAO,CAAC,WAAW,YAAY,SAAS,KAAK,EAC9C,CACF,CACF;OAED,YAAW,aAAa,SAAS;;AAIrC,SAAO;;;;;;;;;;ACjDX,SAAgB,+BAA+B,SAAS;CACtD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,kBAAkB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC1E,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAC3C,QAAO;EACL,2BAA2B;EAC3B,0BAA0B;EAC1B,yBAAyB;EACzB,wBAAwB;EACxB,sBAAsB;EACtB,qBAAqB;EACtB;CAED,SAAS,qBAAqB,MAAM;EAClC,IAAI;EAEJ,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,gBAAgB,UACnB,iBAAgB,YAAY,OAAO,OAAO,KAAK;;EAKjD,MAAM,cACH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;EACR,MAAM,aAAa,gBAAgB;AAEnC,OAAK,MAAM,YAAY,YAAY;GACjC,MAAM,YAAY,SAAS,KAAK;AAEhC,OAAI,SAAS,gBAAgB,WAAW,UAAU,CAChD,SAAQ,YACN,IAAI,aACF,UAAU,SAAS,GAAG,UAAU,oFAChC,EACE,OAAO,SAAS,MACjB,CACF,CACF;YACQ,WAAW,WACpB,SAAQ,YACN,IAAI,aACF,UAAU,SAAS,GAAG,UAAU,8BAChC,EACE,OAAO,CAAC,WAAW,YAAY,SAAS,KAAK,EAC9C,CACF,CACF;OAED,YAAW,aAAa,SAAS;;AAIrC,SAAO;;;AAIX,SAAS,SAAS,MAAM,WAAW;AACjC,KAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,kBAAkB,KAAK,CACxE,QAAO,KAAK,WAAW,CAAC,cAAc;AAGxC,QAAO;;;;;;;;;;;ACpET,SAAgB,wBAAwB,SAAS;CAC/C,MAAM,qBAAqB,OAAO,OAAO,KAAK;AAC9C,QAAO;EACL,2BAA2B;EAE3B,mBAAmB,MAAM;GACvB,MAAM,eAAe,KAAK,KAAK;AAE/B,OAAI,mBAAmB,cACrB,SAAQ,YACN,IAAI,aACF,yCAAyC,aAAa,KACtD,EACE,OAAO,CAAC,mBAAmB,eAAe,KAAK,KAAK,EACrD,CACF,CACF;OAED,oBAAmB,gBAAgB,KAAK;AAG1C,UAAO;;EAEV;;;;;;;;;;;;ACrBH,SAAgB,0BAA0B,SAAS;CACjD,MAAM,iBAAiB,EAAE;CACzB,IAAI,aAAa,OAAO,OAAO,KAAK;AACpC,QAAO;EACL,aAAa;GACX,QAAQ;AACN,mBAAe,KAAK,WAAW;AAC/B,iBAAa,OAAO,OAAO,KAAK;;GAGlC,QAAQ;IACN,MAAM,iBAAiB,eAAe,KAAK;AAC3C,sBAAkB,UAAU,MAAM;AAClC,iBAAa;;GAEhB;EAED,YAAY,MAAM;GAChB,MAAM,YAAY,KAAK,KAAK;AAE5B,OAAI,WAAW,WACb,SAAQ,YACN,IAAI,aACF,4CAA4C,UAAU,KACtD,EACE,OAAO,CAAC,WAAW,YAAY,KAAK,KAAK,EAC1C,CACF,CACF;OAED,YAAW,aAAa,KAAK;;EAGlC;;;;;;;;;;;ACnCH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,sBAAsB,OAAO,OAAO,KAAK;AAC/C,QAAO;EACL,oBAAoB,MAAM;GACxB,MAAM,gBAAgB,KAAK;AAE3B,OAAI,cACF,KAAI,oBAAoB,cAAc,OACpC,SAAQ,YACN,IAAI,aACF,0CAA0C,cAAc,MAAM,KAC9D,EACE,OAAO,CACL,oBAAoB,cAAc,QAClC,cACD,EACF,CACF,CACF;OAED,qBAAoB,cAAc,SAAS;AAI/C,UAAO;;EAGT,0BAA0B;EAC3B;;;;;;;;;AC9BH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,wBAAwB,OAAO,OAAO,KAAK;CACjD,MAAM,yBAAyB,SAC3B;EACE,OAAO,OAAO,cAAc;EAC5B,UAAU,OAAO,iBAAiB;EAClC,cAAc,OAAO,qBAAqB;EAC3C,GACD,EAAE;AACN,QAAO;EACL,kBAAkB;EAClB,iBAAiB;EAClB;CAED,SAAS,oBAAoB,MAAM;EACjC,IAAI;;EAKJ,MAAM,uBACH,uBAAuB,KAAK,oBAAoB,QACjD,yBAAyB,KAAK,IAC1B,uBACA,EAAE;AAER,OAAK,MAAM,iBAAiB,qBAAqB;GAC/C,MAAM,YAAY,cAAc;GAChC,MAAM,8BAA8B,sBAAsB;AAE1D,OAAI,uBAAuB,WACzB,SAAQ,YACN,IAAI,aACF,YAAY,UAAU,0DACtB,EACE,OAAO,eACR,CACF,CACF;YACQ,4BACT,SAAQ,YACN,IAAI,aACF,yBAAyB,UAAU,mBACnC,EACE,OAAO,CAAC,6BAA6B,cAAc,EACpD,CACF,CACF;OAED,uBAAsB,aAAa;;AAIvC,SAAO;;;;;;;;;;ACtDX,SAAgB,oBAAoB,SAAS;CAC3C,MAAM,iBAAiB,OAAO,OAAO,KAAK;CAC1C,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO;EACL,sBAAsB;EACtB,sBAAsB;EACtB,yBAAyB;EACzB,qBAAqB;EACrB,oBAAoB;EACpB,2BAA2B;EAC5B;CAED,SAAS,cAAc,MAAM;EAC3B,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,WAAW,QAAQ,WAAW,KAAK,KAAK,OAAO,QAAQ,SAAS,EAAE;AACpE,WAAQ,YACN,IAAI,aACF,SAAS,SAAS,qFAClB,EACE,OAAO,KAAK,MACb,CACF,CACF;AACD;;AAGF,MAAI,eAAe,UACjB,SAAQ,YACN,IAAI,aAAa,qCAAqC,SAAS,KAAK,EAClE,OAAO,CAAC,eAAe,WAAW,KAAK,KAAK,EAC7C,CAAC,CACH;MAED,gBAAe,YAAY,KAAK;AAGlC,SAAO;;;;;;;;;;ACpCX,SAAgB,wBAAwB,SAAS;AAC/C,QAAO,EACL,oBAAoB,eAAe;EACjC,IAAI;EAUJ,MAAM,0BAA0B,SAJ7B,wBAAwB,cAAc,yBAAyB,QAChE,0BAA0B,KAAK,IAC3B,wBACA,EAAE,GAGL,SAAS,KAAK,SAAS,KAAK,MAC9B;AAED,OAAK,MAAM,CAAC,cAAc,kBAAkB,wBAC1C,KAAI,cAAc,SAAS,EACzB,SAAQ,YACN,IAAI,aACF,0CAA0C,aAAa,KACvD,EACE,OAAO,cAAc,KAAK,SAAS,KAAK,SAAS,KAAK,EACvD,CACF,CACF;IAIR;;;;;;;;;;;;ACdH,SAAgB,wBAAwB,SAAS;CAC/C,IAAI,sBAAsB,EAAE;AAC5B,QAAO;EACL,qBAAqB,EACnB,QAAQ;AACN,yBAAsB,EAAE;KAE3B;EAED,mBAAmB,YAAY;AAC7B,uBAAoB,WAAW,SAAS,KAAK,SAAS;;EAGxD,UAAU,MAAM;AAKd,OAAI,CAAC,WAFQ,gBAAgB,QAAQ,oBAAoB,CAAC,CAErC,EAAE;AACrB,qBAAiB,SAAS,KAAK;AAC/B,WAAO;;;EAIX,YAAY,MAAM;GAChB,MAAM,OAAO,aAAa,QAAQ,cAAc,CAAC;AAEjD,OAAI,CAAC,kBAAkB,KAAK,EAAE;AAC5B,qBAAiB,SAAS,KAAK;AAC/B,WAAO;;GAGT,MAAM,eAAe,OAAO,KAAK,SAAS,UAAU,MAAM,KAAK,MAAM;AAErE,QAAK,MAAM,YAAY,OAAO,OAAO,KAAK,WAAW,CAAC,CAGpD,KAAI,CAFc,aAAa,SAAS,SAEtB,qBAAqB,SAAS,EAAE;IAChD,MAAM,UAAU,QAAQ,SAAS,KAAK;AACtC,YAAQ,YACN,IAAI,aACF,UAAU,KAAK,KAAK,GAAG,SAAS,KAAK,sBAAsB,QAAQ,sBACnE,EACE,OAAO,MACR,CACF,CACF;;AAIL,OAAI,KAAK,QACP,0BAAyB,SAAS,MAAM,MAAM,aAAa;;EAI/D,YAAY,MAAM;GAChB,MAAM,aAAa,aAAa,QAAQ,oBAAoB,CAAC;AAG7D,OAAI,CAFc,QAAQ,cAAc,IAEtB,kBAAkB,WAAW,EAAE;IAC/C,MAAM,cAAc,eAClB,KAAK,KAAK,OACV,OAAO,KAAK,WAAW,WAAW,CAAC,CACpC;AACD,YAAQ,YACN,IAAI,aACF,UAAU,KAAK,KAAK,MAAM,4BAA4B,WAAW,KAAK,MACpE,WAAW,YAAY,EACzB,EACE,OAAO,MACR,CACF,CACF;;;EAIL,UAAU,MAAM;GACd,MAAM,OAAO,QAAQ,cAAc;AAEnC,OAAI,cAAc,KAAK,CACrB,SAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,KAAK,CAAC,WAAW,MAAM,KAAK,CAAC,IAChE,EACE,OAAO,MACR,CACF,CACF;;EAIL,YAAY,SAAS,iBAAiB,SAAS,KAAK;EACpD,WAAW,SAAS,iBAAiB,SAAS,KAAK;EACnD,aAAa,SAAS,iBAAiB,SAAS,KAAK;EACrD,cAAc,SAAS,iBAAiB,SAAS,KAAK;EACtD,eAAe,SAAS,iBAAiB,SAAS,KAAK;EACxD;;;;;;AAOH,SAAS,iBAAiB,SAAS,MAAM;CAEvC,MAAM,eAAe,QAAQ,cAAc;AAE3C,KAAI,CAAC,aACH;CAGF,MAAM,OAAO,aAAa,aAAa;AAEvC,KAAI,CAAC,WAAW,KAAK,EAAE;EACrB,MAAM,UAAU,QAAQ,aAAa;AACrC,UAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,IAC1D,EACE,OAAO,MACR,CACF,CACF;AACD;;AAIF,KAAI;AAOF,MANoB,KAAK,aACvB,MACA,KAAA,EAED,KAEmB,KAAA,GAAW;GAC7B,MAAM,UAAU,QAAQ,aAAa;AACrC,WAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,IAC1D,EACE,OAAO,MACR,CACF,CACF;;UAEI,OAAO;EACd,MAAM,UAAU,QAAQ,aAAa;AAErC,MAAI,iBAAiB,aACnB,SAAQ,YAAY,MAAM;MAE1B,SAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,MACxD,MAAM,SACR;GACE,OAAO;GACP,eAAe;GAChB,CACF,CACF;;;AAKP,SAAS,yBAAyB,SAAS,MAAM,MAAM,cAAc;CACnE,IAAI;CAEJ,MAAM,OAAO,OAAO,KAAK,aAAa;AAGtC,KAF6B,KAAK,WAAW,GAEnB;AACxB,UAAQ,YACN,IAAI,aACF,uBAAuB,KAAK,KAAK,kCACjC,EACE,OAAO,CAAC,KAAK,EACd,CACF,CACF;AACD;;CAGF,MAAM,SACH,sBAAsB,aAAa,KAAK,SAAS,QAClD,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB;AAG1B,KAFsB,CAAC,SAAS,MAAM,SAAS,KAAK,KAGlD,SAAQ,YACN,IAAI,aAAa,UAAU,KAAK,KAAK,GAAG,KAAK,GAAG,sBAAsB,EACpE,OAAO,CAAC,KAAK,EACd,CAAC,CACH;;;;;;;;;;;;AC/ML,SAAgB,2BAA2B,SAAS;AAClD,QAAO,EACL,mBAAmB,MAAM;EACvB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,KAAK;AAExD,MAAI,SAAS,KAAA,KAAa,CAAC,YAAY,KAAK,EAAE;GAC5C,MAAM,eAAe,KAAK,SAAS,KAAK;GACxC,MAAM,WAAW,MAAM,KAAK,KAAK;AACjC,WAAQ,YACN,IAAI,aACF,cAAc,aAAa,8BAA8B,SAAS,KAClE,EACE,OAAO,KAAK,MACb,CACF,CACF;;IAGN;;;;;;;;;;;ACbH,SAAgB,+BAA+B,SAAS;CACtD,IAAI,YAAY,OAAO,OAAO,KAAK;AACnC,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,gBAAY,OAAO,OAAO,KAAK;;GAGjC,MAAM,WAAW;IACf,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,MAAM,MAAM,cAAc,gBAAgB,QAAQ;KAC7D,MAAM,UAAU,KAAK,KAAK;KAC1B,MAAM,SAAS,UAAU;AAEzB,SAAI,UAAU,MAAM;MAMlB,MAAM,SAAS,QAAQ,WAAW;MAClC,MAAM,UAAU,YAAY,QAAQ,OAAO,KAAK;AAEhD,UACE,WACA,CAAC,qBACC,QACA,SACA,OAAO,cACP,MACA,aACD,EACD;OACA,MAAM,aAAa,QAAQ,QAAQ;OACnC,MAAM,UAAU,QAAQ,KAAK;AAC7B,eAAQ,YACN,IAAI,aACF,cAAc,QAAQ,aAAa,WAAW,qCAAqC,QAAQ,KAC3F,EACE,OAAO,CAAC,QAAQ,KAAK,EACtB,CACF,CACF;;AAGH,UACE,kBAAkB,WAAW,IAC7B,WAAW,WACX,eAAe,QAAQ,CAEvB,SAAQ,YACN,IAAI,aACF,cAAc,QAAQ,gBAAgB,QAAQ,gEAAgE,WAAW,KACzH,EACE,OAAO,CAAC,QAAQ,KAAK,EACtB,CACF,CACF;;;;GAKV;EAED,mBAAmB,MAAM;AACvB,aAAU,KAAK,SAAS,KAAK,SAAS;;EAEzC;;;;;;;AAQH,SAAS,qBACP,QACA,SACA,iBACA,cACA,sBACA;AACA,KAAI,cAAc,aAAa,IAAI,CAAC,cAAc,QAAQ,EAAE;AAK1D,MAAI,EAHF,mBAAmB,QAAQ,gBAAgB,SAAS,KAAK,SAGpB,EAFP,yBAAyB,KAAA,GAGvD,QAAO;EAGT,MAAM,uBAAuB,aAAa;AAC1C,SAAO,gBAAgB,QAAQ,SAAS,qBAAqB;;AAG/D,QAAO,gBAAgB,QAAQ,SAAS,aAAa;;;;;;;;ACxCvD,MAAa,mBAAmB,OAAO,OAAO,CAAC,0BAA0B,CAAC;;;;;;;AAQ1E,MAAa,iBAAiB,OAAO,OAAO;CAC1C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,GAAG;CACJ,CAAC;;;;AAKF,MAAa,oBAAoB,OAAO,OAAO;CAC7C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;;;;;;;;AC1HF,IAAa,uBAAb,MAAkC;CAChC,YAAY,KAAK,SAAS;AACxB,OAAK,OAAO;AACZ,OAAK,aAAa,KAAA;AAClB,OAAK,mCAAmB,IAAI,KAAK;AACjC,OAAK,kDAAkC,IAAI,KAAK;AAChD,OAAK,WAAW;;CAGlB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY,OAAO;AACjB,OAAK,SAAS,MAAM;;CAGtB,cAAc;AACZ,SAAO,KAAK;;CAGd,YAAY,MAAM;EAChB,IAAI;AAEJ,MAAI,KAAK,WACP,aAAY,KAAK;OACZ;AACL,eAAY,OAAO,OAAO,KAAK;AAE/B,QAAK,MAAM,WAAW,KAAK,aAAa,CAAC,YACvC,KAAI,QAAQ,SAAS,KAAK,oBACxB,WAAU,QAAQ,KAAK,SAAS;AAIpC,QAAK,aAAa;;AAGpB,SAAO,UAAU;;CAGnB,mBAAmB,MAAM;EACvB,IAAI,UAAU,KAAK,iBAAiB,IAAI,KAAK;AAE7C,MAAI,CAAC,SAAS;AACZ,aAAU,EAAE;GACZ,MAAM,cAAc,CAAC,KAAK;GAC1B,IAAI;AAEJ,UAAQ,MAAM,YAAY,KAAK,CAC7B,MAAK,MAAM,aAAa,IAAI,WAC1B,KAAI,UAAU,SAAS,KAAK,gBAC1B,SAAQ,KAAK,UAAU;YACd,UAAU,aACnB,aAAY,KAAK,UAAU,aAAa;AAK9C,QAAK,iBAAiB,IAAI,MAAM,QAAQ;;AAG1C,SAAO;;CAGT,kCAAkC,WAAW;EAC3C,IAAI,YAAY,KAAK,gCAAgC,IAAI,UAAU;AAEnE,MAAI,CAAC,WAAW;AACd,eAAY,EAAE;GACd,MAAM,iBAAiB,OAAO,OAAO,KAAK;GAC1C,MAAM,eAAe,CAAC,UAAU,aAAa;GAC7C,IAAI;AAEJ,UAAQ,OAAO,aAAa,KAAK,CAC/B,MAAK,MAAM,UAAU,KAAK,mBAAmB,KAAK,EAAE;IAClD,MAAM,WAAW,OAAO,KAAK;AAE7B,QAAI,eAAe,cAAc,MAAM;AACrC,oBAAe,YAAY;KAC3B,MAAM,WAAW,KAAK,YAAY,SAAS;AAE3C,SAAI,UAAU;AACZ,gBAAU,KAAK,SAAS;AACxB,mBAAa,KAAK,SAAS,aAAa;;;;AAMhD,QAAK,gCAAgC,IAAI,WAAW,UAAU;;AAGhE,SAAO;;;AAGX,IAAa,uBAAb,cAA0C,qBAAqB;CAC7D,YAAY,KAAK,QAAQ,SAAS;AAChC,QAAM,KAAK,QAAQ;AACnB,OAAK,UAAU;;CAGjB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,SAAO,KAAK;;;AAGhB,IAAa,oBAAb,cAAuC,qBAAqB;CAC1D,YAAY,QAAQ,KAAK,UAAU,SAAS;AAC1C,QAAM,KAAK,QAAQ;AACnB,OAAK,UAAU;AACf,OAAK,YAAY;AACjB,OAAK,kCAAkB,IAAI,KAAK;AAChC,OAAK,2CAA2B,IAAI,KAAK;;CAG3C,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,SAAO,KAAK;;CAGd,kBAAkB,MAAM;EACtB,IAAI,SAAS,KAAK,gBAAgB,IAAI,KAAK;AAE3C,MAAI,CAAC,QAAQ;GACX,MAAM,YAAY,EAAE;GACpB,MAAM,WAAW,IAAI,SAAS,KAAK,QAAQ;AAC3C,SACE,MACA,kBAAkB,UAAU;IAC1B,0BAA0B;IAE1B,SAAS,UAAU;AACjB,eAAU,KAAK;MACb,MAAM;MACN,MAAM,SAAS,cAAc;MAC7B,cAAc,SAAS,iBAAiB;MACxC,YAAY,SAAS,oBAAoB;MAC1C,CAAC;;IAEL,CAAC,CACH;AACD,YAAS;AAET,QAAK,gBAAgB,IAAI,MAAM,OAAO;;AAGxC,SAAO;;CAGT,2BAA2B,WAAW;EACpC,IAAI,SAAS,KAAK,yBAAyB,IAAI,UAAU;AAEzD,MAAI,CAAC,QAAQ;AACX,YAAS,KAAK,kBAAkB,UAAU;AAE1C,QAAK,MAAM,QAAQ,KAAK,kCAAkC,UAAU,CAClE,UAAS,OAAO,OAAO,KAAK,kBAAkB,KAAK,CAAC;AAGtD,QAAK,yBAAyB,IAAI,WAAW,OAAO;;AAGtD,SAAO;;CAGT,UAAU;AACR,SAAO,KAAK,UAAU,SAAS;;CAGjC,gBAAgB;AACd,SAAO,KAAK,UAAU,eAAe;;CAGvC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;CAGtC,qBAAqB;AACnB,SAAO,KAAK,UAAU,oBAAoB;;CAG5C,cAAc;AACZ,SAAO,KAAK,UAAU,aAAa;;CAGrC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;CAGtC,cAAc;AACZ,SAAO,KAAK,UAAU,aAAa;;CAGrC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;ACnLxC,SAAgB,SACd,QACA,aACA,QAAQ,gBACR,SAEA,WAAW,IAAI,SAAS,OAAO,EAC/B;CACA,IAAI;CAEJ,MAAM,aACH,qBACC,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,eAC1D,QAAQ,uBAAuB,KAAK,IAClC,qBACA;AACN,gBAAe,UAAU,OAAO,yBAAyB;AAEzD,mBAAkB,OAAO;CACzB,MAAM,WAAW,OAAO,OAAO,EAAE,CAAC;CAClC,MAAM,SAAS,EAAE;CACjB,MAAM,UAAU,IAAI,kBAClB,QACA,aACA,WACC,UAAU;AACT,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAO,KACL,IAAI,aACF,uEACD,CACF;AAED,SAAM;;AAGR,SAAO,KAAK,MAAM;GAErB;CAGD,MAAM,UAAU,gBAAgB,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC,CAAC;AAEnE,KAAI;AACF,QAAM,aAAa,kBAAkB,UAAU,QAAQ,CAAC;UACjD,GAAG;AACV,MAAI,MAAM,SACR,OAAM;;AAIV,QAAO;;;;;AAMT,SAAgB,YACd,aACA,gBACA,QAAQ,mBACR;CACA,MAAM,SAAS,EAAE;CACjB,MAAM,UAAU,IAAI,qBAClB,aACA,iBACC,UAAU;AACT,SAAO,KAAK,MAAM;GAErB;AAED,OAAM,aAAa,gBADF,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC,CACP,CAAC;AAC7C,QAAO;;;;;;;;AAST,SAAgB,eAAe,aAAa;CAC1C,MAAM,SAAS,YAAY,YAAY;AAEvC,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,MAAM,OAAO,KAAK,UAAU,MAAM,QAAQ,CAAC,KAAK,OAAO,CAAC;;;;;;;AChCtE,SAAgB,iBAAiB,cAAc,aAAa,SAAS;CACnE,IAAI,YAAY,uBAAuB,aAAa;CAGpD,MAAM,WAAW,EAAE;CACnB,MAAM,oBAAoB,OAAO,OAAO,KAAK;CAG7C,MAAM,gBAAgB,EAAE;CACxB,IAAI;CAEJ,MAAM,mBAAmB,EAAE;AAE3B,MAAK,MAAM,OAAO,YAAY,YAC5B,KAAI,IAAI,SAAS,KAAK,kBACpB,aAAY;UACH,IAAI,SAAS,KAAK,iBAC3B,kBAAiB,KAAK,IAAI;UACjB,qBAAqB,IAAI,CAClC,UAAS,KAAK,IAAI;UACT,oBAAoB,IAAI,EAAE;EACnC,MAAM,mBAAmB,IAAI,KAAK;EAClC,MAAM,yBAAyB,kBAAkB;AACjD,oBAAkB,oBAAoB,yBAClC,uBAAuB,OAAO,CAAC,IAAI,CAAC,GACpC,CAAC,IAAI;YACA,IAAI,SAAS,KAAK,qBAC3B,eAAc,KAAK,IAAI;AAK3B,KACE,OAAO,KAAK,kBAAkB,CAAC,WAAW,KAC1C,SAAS,WAAW,KACpB,cAAc,WAAW,KACzB,iBAAiB,WAAW,KAC5B,aAAa,KAEb,QAAO;CAGT,MAAM,UAAU,OAAO,OAAO,KAAK;AAEnC,MAAK,MAAM,gBAAgB,aAAa,MACtC,SAAQ,aAAa,QAAQ,gBAAgB,aAAa;AAG5D,MAAK,MAAM,YAAY,UAAU;EAC/B,IAAI;EAEJ,MAAM,OAAO,SAAS,KAAK;AAC3B,UAAQ,SACL,mBAAmB,WAAW,WAAW,QAC1C,qBAAqB,KAAK,IACtB,mBACA,UAAU,SAAS;;CAG3B,MAAM,iBAAiB;EAErB,OAAO,aAAa,SAAS,iBAAiB,aAAa,MAAM;EACjE,UAAU,aAAa,YAAY,iBAAiB,aAAa,SAAS;EAC1E,cACE,aAAa,gBAAgB,iBAAiB,aAAa,aAAa;EAE1E,GAAI,aAAa,kBAAkB,CAAC,UAAU,CAAC;EAC/C,GAAG,kBAAkB,iBAAiB;EACvC;AAED,QAAO;EACL,cACG,aAAa,eAAe,QAAQ,eAAe,KAAK,IACrD,KAAK,KACJ,wBAAwB,WAAW,iBAAiB,QACrD,0BAA0B,KAAK,IAC/B,KAAK,IACL,sBAAsB;EAC5B,GAAG;EACH,OAAO,OAAO,OAAO,QAAQ;EAC7B,YAAY,CACV,GAAG,aAAa,WAAW,IAAI,iBAAiB,EAChD,GAAG,cAAc,IAAI,eAAe,CACrC;EACD,YAAY,OAAO,OAAO,KAAK;EAC/B,UACG,cAAc,eAAe,QAAQ,gBAAgB,KAAK,IACvD,cACA,aAAa;EACnB,mBAAmB,aAAa,kBAAkB,OAAO,iBAAiB;EAC1E,cACG,uBACC,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ,iBAAiB,QAAQ,yBAAyB,KAAK,IACjE,uBACA;EACP;CAGD,SAAS,YAAY,MAAM;AACzB,MAAI,WAAW,KAAK,CAElB,QAAO,IAAI,YAAY,YAAY,KAAK,OAAO,CAAC;AAGlD,MAAI,cAAc,KAAK,CAErB,QAAO,IAAI,eAAe,YAAY,KAAK,OAAO,CAAC;AAGrD,SAAO,iBAAiB,KAAK;;CAG/B,SAAS,iBAAiB,MAAM;AAI9B,SAAO,QAAQ,KAAK;;CAGtB,SAAS,iBAAiB,WAAW;EACnC,MAAM,SAAS,UAAU,UAAU;AACnC,SAAO,IAAI,iBAAiB;GAC1B,GAAG;GACH,MAAM,SAAS,OAAO,MAAM,UAAU;GACvC,CAAC;;CAGJ,SAAS,gBAAgB,MAAM;AAC7B,MAAI,oBAAoB,KAAK,IAAI,sBAAsB,KAAK,CAE1D,QAAO;AAGT,MAAI,aAAa,KAAK,CACpB,QAAO,iBAAiB,KAAK;AAG/B,MAAI,aAAa,KAAK,CACpB,QAAO,iBAAiB,KAAK;AAG/B,MAAI,gBAAgB,KAAK,CACvB,QAAO,oBAAoB,KAAK;AAGlC,MAAI,YAAY,KAAK,CACnB,QAAO,gBAAgB,KAAK;AAG9B,MAAI,WAAW,KAAK,CAClB,QAAO,eAAe,KAAK;AAG7B,MAAI,kBAAkB,KAAK,CACzB,QAAO,sBAAsB,KAAK;;AAK3B,YAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;CAGhE,SAAS,sBAAsB,MAAM;EACnC,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,wBAAwB,kBAAkB,OAAO,WAAW,QAC7D,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,IAAI,uBAAuB;GAChC,GAAG;GACH,eAAe;IACb,GAAG,SAAS,OAAO,SAAS,WAAW;KACrC,GAAG;KACH,MAAM,YAAY,MAAM,KAAK;KAC9B,EAAE;IACH,GAAG,mBAAmB,WAAW;IAClC;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,eAAe,MAAM;EAC5B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,wBAAwB,kBAAkB,KAAK,WAAW,QAC3D,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,IAAI,gBAAgB;GACzB,GAAG;GACH,QAAQ;IAAE,GAAG,OAAO;IAAQ,GAAG,kBAAkB,WAAW;IAAE;GAC9D,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,iBAAiB,MAAM;EAC9B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;EACR,IAAI,iBAAiB,OAAO;AAE5B,OAAK,MAAM,iBAAiB,YAAY;GACtC,IAAI;AAEJ,qBACG,qBAAqB,kBAAkB,cAAc,MAAM,QAC5D,uBAAuB,KAAK,IACxB,qBACA;;AAGR,SAAO,IAAI,kBAAkB;GAC3B,GAAG;GACH;GACA,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,iBAAiB,MAAM;EAC9B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,kBAAkB;GAC3B,GAAG;GACH,kBAAkB,CAChB,GAAG,KAAK,eAAe,CAAC,IAAI,iBAAiB,EAC7C,GAAG,gBAAgB,WAAW,CAC/B;GACD,eAAe;IACb,GAAG,SAAS,OAAO,QAAQ,YAAY;IACvC,GAAG,cAAc,WAAW;IAC7B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,oBAAoB,MAAM;EACjC,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,qBAAqB;GAC9B,GAAG;GACH,kBAAkB,CAChB,GAAG,KAAK,eAAe,CAAC,IAAI,iBAAiB,EAC7C,GAAG,gBAAgB,WAAW,CAC/B;GACD,eAAe;IACb,GAAG,SAAS,OAAO,QAAQ,YAAY;IACvC,GAAG,cAAc,WAAW;IAC7B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,gBAAgB,MAAM;EAC7B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,iBAAiB;GAC1B,GAAG;GACH,aAAa,CACX,GAAG,KAAK,UAAU,CAAC,IAAI,iBAAiB,EACxC,GAAG,gBAAgB,WAAW,CAC/B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,YAAY,OAAO;AAC1B,SAAO;GACL,GAAG;GACH,MAAM,YAAY,MAAM,KAAK;GAC7B,MAAM,MAAM,QAAQ,SAAS,MAAM,MAAM,UAAU;GACpD;;CAGH,SAAS,UAAU,KAAK;AACtB,SAAO;GAAE,GAAG;GAAK,MAAM,YAAY,IAAI,KAAK;GAAE;;CAGhD,SAAS,kBAAkB,OAAO;EAChC,MAAM,UAAU,EAAE;AAElB,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,uBAEH,uBAAuB,KAAK,oBAAoB,QACjD,yBAAyB,KAAK,IAC1B,uBACA,EAAE;AAER,QAAK,MAAM,iBAAiB,oBAK1B,SAAQ,cAAc,aAAa,aAAa,cAAc,KAAK;;AAIvE,SAAO;;CAGT,SAAS,aAAa,MAAM;EAC1B,IAAI;EAEJ,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,QACH,oBAAoB,WAAW,WAAW,QAC3C,sBAAsB,KAAK,IACvB,oBACA,QAAQ;AAEd,MAAI,SAAS,KAAA,EACX,OAAM,IAAI,MAAM,kBAAkB,KAAK,IAAI;AAG7C,SAAO;;CAGT,SAAS,eAAe,MAAM;AAC5B,MAAI,KAAK,SAAS,KAAK,UACrB,QAAO,IAAI,YAAY,eAAe,KAAK,KAAK,CAAC;AAGnD,MAAI,KAAK,SAAS,KAAK,cACrB,QAAO,IAAI,eAAe,eAAe,KAAK,KAAK,CAAC;AAGtD,SAAO,aAAa,KAAK;;CAG3B,SAAS,eAAe,MAAM;EAC5B,IAAI;AAEJ,SAAO,IAAI,iBAAiB;GAC1B,MAAM,KAAK,KAAK;GAChB,cACG,oBAAoB,KAAK,iBAAiB,QAC3C,sBAAsB,KAAK,IACvB,KAAK,IACL,kBAAkB;GAExB,WAAW,KAAK,UAAU,KAAK,EAAE,YAAY,MAAM;GACnD,cAAc,KAAK;GACnB,MAAM,iBAAiB,KAAK,UAAU;GACtC,SAAS;GACV,CAAC;;CAGJ,SAAS,cAAc,OAAO;EAC5B,MAAM,iBAAiB,OAAO,OAAO,KAAK;AAE1C,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,cAEH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AAER,QAAK,MAAM,SAAS,YAAY;IAC9B,IAAI;AAEJ,mBAAe,MAAM,KAAK,SAAS;KAIjC,MAAM,eAAe,MAAM,KAAK;KAChC,cACG,qBAAqB,MAAM,iBAAiB,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB;KACzB,MAAM,iBAAiB,MAAM,UAAU;KACvC,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,iBAAiB,MAAM;EAE9B,MAAM,YAEJ,SAAS,QAAQ,SAAS,KAAK,IAAI,OAAO,EAAE;EAC9C,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,OAAK,MAAM,OAAO,WAAW;GAC3B,IAAI;GAKJ,MAAM,OAAO,eAAe,IAAI,KAAK;AACrC,gBAAa,IAAI,KAAK,SAAS;IAC7B;IACA,cACG,mBAAmB,IAAI,iBAAiB,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB;IACvB,cAAc,aAAa,IAAI,cAAc,KAAK;IAClD,mBAAmB,qBAAqB,IAAI;IAC5C,SAAS;IACV;;AAGH,SAAO;;CAGT,SAAS,mBAAmB,OAAO;EACjC,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,eAEH,gBAAgB,KAAK,YAAY,QAAQ,kBAAkB,KAAK,IAC7D,gBACA,EAAE;AAER,QAAK,MAAM,SAAS,aAAa;IAC/B,IAAI;IAKJ,MAAM,OAAO,eAAe,MAAM,KAAK;AACvC,kBAAc,MAAM,KAAK,SAAS;KAChC;KACA,cACG,sBAAsB,MAAM,iBAAiB,QAC9C,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB;KAC1B,cAAc,aAAa,MAAM,cAAc,KAAK;KACpD,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,kBAAkB,OAAO;EAChC,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,eAEH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AAER,QAAK,MAAM,SAAS,aAAa;IAC/B,IAAI;AAEJ,iBAAa,MAAM,KAAK,SAAS;KAC/B,cACG,qBAAqB,MAAM,iBAAiB,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB;KACzB,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,gBAAgB,OAAO;AAK9B,SAAO,MAAM,SAEV,SAAS;GACR,IAAI,sBAAsB;AAE1B,WAEG,wBACE,mBAAmB,KAAK,gBAAgB,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB,IAAI,aAAa,MAAM,QAC5C,yBAAyB,KAAK,IAC5B,uBACA,EAAE;IAGX;;CAGH,SAAS,gBAAgB,OAAO;AAK9B,SAAO,MAAM,SAEV,SAAS;GACR,IAAI,iBAAiB;AAErB,WAEG,mBACE,cAAc,KAAK,WAAW,QAAQ,gBAAgB,KAAK,IACxD,KAAK,IACL,YAAY,IAAI,aAAa,MAAM,QACvC,oBAAoB,KAAK,IACvB,kBACA,EAAE;IAGX;;CAGH,SAAS,UAAU,SAAS;EAC1B,IAAI;EAEJ,MAAM,OAAO,QAAQ,KAAK;EAC1B,MAAM,qBACH,wBAAwB,kBAAkB,WAAW,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AAER,UAAQ,QAAQ,MAAhB;GACE,KAAK,KAAK,wBAAwB;IAChC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,kBAAkB;KAC3B;KACA,cACG,uBAAuB,QAAQ,iBAAiB,QACjD,yBAAyB,KAAK,IAC1B,KAAK,IACL,qBAAqB;KAC3B,kBAAkB,gBAAgB,SAAS;KAC3C,cAAc,cAAc,SAAS;KACrC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,2BAA2B;IACnC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,qBAAqB;KAC9B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,kBAAkB,gBAAgB,SAAS;KAC3C,cAAc,cAAc,SAAS;KACrC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,sBAAsB;IAC9B,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,gBAAgB;KACzB;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,QAAQ,kBAAkB,SAAS;KACnC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,uBAAuB;IAC/B,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,iBAAiB;KAC1B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,aAAa,gBAAgB,SAAS;KACtC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK;IACR,IAAI;AAEJ,WAAO,IAAI,kBAAkB;KAC3B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,gBAAgB,kBAAkB,QAAQ;KAC1C;KACA;KACD,CAAC;GAGJ,KAAK,KAAK,8BAA8B;IACtC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,uBAAuB;KAChC;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,cAAc,mBAAmB,SAAS;KAC1C;KACA;KACA,SAAS,QAAQ,QAAQ;KAC1B,CAAC;;;;;AAKV,MAAM,aAAa,OACjB,CAAC,GAAG,sBAAsB,GAAG,mBAAmB,GAC/C,SAAS,KAAK,KAChB;;;;;AAMD,SAAS,qBAAqB,MAAM;CAClC,MAAM,aAAa,mBAAmB,4BAA4B,KAAK;AAEvE,QAAO,eAAe,QAAQ,eAAe,KAAK,IAC9C,KAAK,IACL,WAAW;;;;;AAMjB,SAAS,kBAAkB,MAAM;CAC/B,MAAM,cAAc,mBAAmB,6BAA6B,KAAK;AAEzE,QAAO,gBAAgB,QAAQ,gBAAgB,KAAK,IAChD,KAAK,IACL,YAAY;;;;;AAMlB,SAAS,QAAQ,MAAM;AACrB,QAAO,QAAQ,mBAAmB,uBAAuB,KAAK,CAAC;;;;;;;;;;;;;;AC1wBjE,SAAgB,eAAe,aAAa,SAAS;AAClD,gBAAe,QAAQ,YAAY,SAAS,KAAK,YAChD,UAAU,OAAO,mCAAmC;AAEtD,MACG,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,iBACzD,SACD,YAAY,QAAQ,YAAY,KAAK,IAClC,KAAK,IACL,QAAQ,oBAAoB,KAEhC,gBAAe,YAAY;CAW7B,MAAM,SAAS,iBARW;EACxB,aAAa,KAAA;EACb,OAAO,EAAE;EACT,YAAY,EAAE;EACd,YAAY,OAAO,OAAO,KAAK;EAC/B,mBAAmB,EAAE;EACrB,aAAa;EACd,EACkD,aAAa,QAAQ;AAExE,KAAI,OAAO,WAAW,KACpB,MAAK,MAAM,QAAQ,OAAO,MACxB,SAAQ,KAAK,MAAb;EAIE,KAAK;AAEH,UAAO,QAAQ;AACf;EAEF,KAAK;AAEH,UAAO,WAAW;AAClB;EAEF,KAAK;AAEH,UAAO,eAAe;AACtB;;CAKR,MAAM,aAAa,CACjB,GAAG,OAAO,YACV,GAAG,oBAAoB,QAAQ,iBAC7B,OAAO,WAAW,OACf,cAAc,UAAU,SAAS,aAAa,KAChD,CACF,CACF;AACD,QAAO,IAAI,cAAc;EAAE,GAAG;EAAQ;EAAY,CAAC;;;;;;AAOrD,SAAgB,YAAY,QAAQ,SAAS;AAS3C,QAAO,eARU,MAAM,QAAQ;EAC7B,YACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC5D,8BACE,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ;EACf,CAAC,EAC8B;EAC9B,gBACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC5D,aACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC7D,CAAC;;;;AC3EJ,SAAgB,YAAY,QAAQ;AAClC,QAAO,oBACL,SACC,MAAM,CAAC,qBAAqB,EAAE,EAC/B,cACD;;AAMH,SAAS,cAAc,MAAM;AAC3B,QAAO,CAAC,sBAAsB,KAAK,IAAI,CAAC,oBAAoB,KAAK;;AAGnE,SAAS,oBAAoB,QAAQ,iBAAiB,YAAY;CAChE,MAAM,aAAa,OAAO,eAAe,CAAC,OAAO,gBAAgB;CACjE,MAAM,QAAQ,OAAO,OAAO,OAAO,YAAY,CAAC,CAAC,OAAO,WAAW;AACnE,QAAO;EACL,sBAAsB,OAAO;EAC7B,GAAG,WAAW,KAAK,cAAc,eAAe,UAAU,CAAC;EAC3D,GAAG,MAAM,KAAK,SAAS,UAAU,KAAK,CAAC;EACxC,CACE,OAAO,QAAQ,CACf,KAAK,OAAO;;AAGjB,SAAS,sBAAsB,QAAQ;AACrC,KAAI,OAAO,eAAe,QAAQ,sBAAsB,OAAO,CAC7D;CAGF,MAAM,iBAAiB,EAAE;CACzB,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,UACF,gBAAe,KAAK,YAAY,UAAU,OAAO;CAGnD,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,aACF,gBAAe,KAAK,eAAe,aAAa,OAAO;CAGzD,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,iBACF,gBAAe,KAAK,mBAAmB,iBAAiB,OAAO;AAGjE,QAAO,iBAAiB,OAAO,GAAG,aAAa,eAAe,KAAK,KAAK,CAAC;;;;;;;;;;;;;;;;;AAkB3E,SAAS,sBAAsB,QAAQ;CACrC,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,aAAa,UAAU,SAAS,QAClC,QAAO;CAGT,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,gBAAgB,aAAa,SAAS,WACxC,QAAO;CAGT,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,oBAAoB,iBAAiB,SAAS,eAChD,QAAO;AAGT,QAAO;;AAGT,SAAgB,UAAU,MAAM;AAC9B,KAAI,aAAa,KAAK,CACpB,QAAO,YAAY,KAAK;AAG1B,KAAI,aAAa,KAAK,CACpB,QAAO,YAAY,KAAK;AAG1B,KAAI,gBAAgB,KAAK,CACvB,QAAO,eAAe,KAAK;AAG7B,KAAI,YAAY,KAAK,CACnB,QAAO,WAAW,KAAK;AAGzB,KAAI,WAAW,KAAK,CAClB,QAAO,UAAU,KAAK;AAGxB,KAAI,kBAAkB,KAAK,CACzB,QAAO,iBAAiB,KAAK;;AAKtB,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;AAGhE,SAAS,YAAY,MAAM;AACzB,QACE,iBAAiB,KAAK,GAAG,UAAU,KAAK,SAAS,oBAAoB,KAAK;;AAI9E,SAAS,2BAA2B,MAAM;CACxC,MAAM,aAAa,KAAK,eAAe;AACvC,QAAO,WAAW,SACd,iBAAiB,WAAW,KAAK,MAAM,EAAE,KAAK,CAAC,KAAK,MAAM,GAC1D;;AAGN,SAAS,YAAY,MAAM;AACzB,QACE,iBAAiB,KAAK,GACtB,QAAQ,KAAK,SACb,2BAA2B,KAAK,GAChC,YAAY,KAAK;;AAIrB,SAAS,eAAe,MAAM;AAC5B,QACE,iBAAiB,KAAK,GACtB,aAAa,KAAK,SAClB,2BAA2B,KAAK,GAChC,YAAY,KAAK;;AAIrB,SAAS,WAAW,MAAM;CACxB,MAAM,QAAQ,KAAK,UAAU;CAC7B,MAAM,gBAAgB,MAAM,SAAS,QAAQ,MAAM,KAAK,MAAM,GAAG;AACjE,QAAO,iBAAiB,KAAK,GAAG,WAAW,KAAK,OAAO;;AAGzD,SAAS,UAAU,MAAM;CACvB,MAAM,SAAS,KACZ,WAAW,CACX,KACE,OAAO,MACN,iBAAiB,OAAO,MAAM,CAAC,EAAE,GACjC,OACA,MAAM,OACN,gBAAgB,MAAM,kBAAkB,CAC3C;AACH,QAAO,iBAAiB,KAAK,GAAG,QAAQ,KAAK,SAAS,WAAW,OAAO;;AAG1E,SAAS,iBAAiB,MAAM;CAC9B,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,KAC5C,GAAG,MAAM,iBAAiB,GAAG,MAAM,CAAC,EAAE,GAAG,OAAO,gBAAgB,EAAE,CACpE;AACD,QACE,iBAAiB,KAAK,GACtB,SAAS,KAAK,UACb,KAAK,UAAU,YAAY,MAC5B,WAAW,OAAO;;AAItB,SAAS,YAAY,MAAM;AAWzB,QAAO,WAVQ,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,KAC5C,GAAG,MACF,iBAAiB,GAAG,MAAM,CAAC,EAAE,GAC7B,OACA,EAAE,OACF,UAAU,EAAE,MAAM,KAAK,GACvB,OACA,OAAO,EAAE,KAAK,GACd,gBAAgB,EAAE,kBAAkB,CACvC,CACwB;;AAG3B,SAAS,WAAW,OAAO;AACzB,QAAO,MAAM,WAAW,IAAI,SAAS,MAAM,KAAK,KAAK,GAAG,QAAQ;;AAGlE,SAAS,UAAU,MAAM,cAAc,IAAI;AACzC,KAAI,KAAK,WAAW,EAClB,QAAO;AAGT,KAAI,KAAK,OAAO,QAAQ,CAAC,IAAI,YAAY,CACvC,QAAO,MAAM,KAAK,IAAI,gBAAgB,CAAC,KAAK,KAAK,GAAG;AAGtD,QACE,QACA,KACG,KACE,KAAK,MACJ,iBAAiB,KAAK,OAAO,aAAa,CAAC,EAAE,GAC7C,OACA,cACA,gBAAgB,IAAI,CACvB,CACA,KAAK,KAAK,GACb,OACA,cACA;;AAIJ,SAAS,gBAAgB,KAAK;CAC5B,MAAM,aAAa,aAAa,IAAI,cAAc,IAAI,KAAK;CAC3D,IAAI,UAAU,IAAI,OAAO,OAAO,OAAO,IAAI,KAAK;AAEhD,KAAI,WACF,YAAW,MAAM,MAAM,WAAW;AAGpC,QAAO,UAAU,gBAAgB,IAAI,kBAAkB;;AAGzD,SAAS,eAAe,WAAW;AACjC,QACE,iBAAiB,UAAU,GAC3B,gBACA,UAAU,OACV,UAAU,UAAU,KAAK,IACxB,UAAU,eAAe,gBAAgB,MAC1C,SACA,UAAU,UAAU,KAAK,MAAM;;AAInC,SAAS,gBAAgB,QAAQ;AAC/B,KAAI,UAAU,KACZ,QAAO;AAGT,KAAI,WAAA,sBAKF,QAAO,wBAJU,MAAM;EACrB,MAAM,KAAK;EACX,OAAO;EACR,CAAC,CACsC;AAG1C,QAAO;;AAGT,SAAS,oBAAoB,QAAQ;AACnC,KAAI,OAAO,kBAAkB,KAC3B,QAAO;AAOT,QAAO,sBAJU,MAAM;EACrB,MAAM,KAAK;EACX,OAAO,OAAO;EACf,CAAC,CACoC;;AAGxC,SAAS,iBAAiB,KAAK,cAAc,IAAI,eAAe,MAAM;CACpE,MAAM,EAAE,gBAAgB;AAExB,KAAI,eAAe,KACjB,QAAO;CAGT,MAAM,cAAc,MAAM;EACxB,MAAM,KAAK;EACX,OAAO;EACP,OAAO,yBAAyB,YAAY;EAC7C,CAAC;AAGF,SADE,eAAe,CAAC,eAAe,OAAO,cAAc,eACtC,YAAY,QAAQ,OAAO,OAAO,YAAY,GAAG;;;;;;;;;;;;ACtTnE,MAAaA,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU,CAAC,UAAU;CAC3B,OAAOC,QAAU,CAAC,QAAQ;CAC7B,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,oBAAoB,UAAU;AAChC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,yBAAyB,KAAK,UAAU,MAAM,GAAG;CAE5E,MAAM,SAASJ,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaK,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,aAAa,UAAU,MAAM,SAAS,KAAK,OAC3C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,MAC9C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAMN,SAAO,iBAJO;GACV,MAAM,WAAW,OAAO;GACxB,OAAO,WAAW,WAAW,MAAM,MAAM;GAC5C,CAC6B;;CAErC;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;;AC5CnD,MAAaE,wBAAsB;AACnC,MAAaC,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOA,QAAU;CACpB,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,0BAA0B,UAAU;AACtC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,gCAAgC,KAAK,UAAU,MAAM,GAAG;CAEnF,MAAM,SAASH,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,OAC9C,OAAM,IAAI,aAAa,sCAAsC,EACzD,OAAO,KACV,CAAC;AAEN,MAAI,CAACP,sBAAoB,KAAK,WAAW,MAAM,MAAM,CACjD,OAAM,IAAI,aAAa,sEAAkE,EACrF,OAAO,KACV,CAAC;AAMN,SAAO,uBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,MAAM;GAC3B,CACmC;;CAE3C;AACD,MAAaQ,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;;AClDnD,MAAa,sBAAsB;AACnC,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOA,QAAU;CACpB,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,4BAA4B,UAAU;AACxC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,kCAAkC,KAAK,UAAU,MAAM,GAAG;CAErF,MAAM,SAASH,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,OAC9C,OAAM,IAAI,aAAa,sCAAsC,EACzD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,oBAAoB,KAAK,WAAW,MAAM,MAAM,CACjD,OAAM,IAAI,aAAa,sEAAkE,EACrF,OAAO,KACV,CAAC;AAMN,SAAO,yBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,MAAM;GAC3B,CACqC;;CAE7C;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AClDnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOC,QAAU,CAAC,QAAQ;CAC7B,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,wBAAwB,UAAU;AACpC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,8BAA8B,KAAK,UAAU,MAAM,GAAG;CAEjF,MAAM,SAASJ,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaK,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,MAC9C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAMN,SAAO,qBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,WAAW,MAAM,MAAM;GAC5C,CACiC;;CAEzC;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC5CnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,yBAAyB,UAAU;AACrC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,6BAA6B,EAChD,OAAO,OACV,CAAC;AAGN,SAAO,sBADa,WAAW,MAAM,MAAM,CACF;;CAEhD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC/BnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,8BAA8B,UAAU;AAC1C,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAGlE,SAAO,2BADa,WAAW,MAAM,MAAM,CACG;;CAErD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC7BnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,0BAA0B,UAAU;AACtC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAGlE,SAAO,uBADa,WAAW,MAAM,MAAM,CACD;;CAEjD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC7BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,sBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,mBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,UAAgB;AACtC,MAAaC,iBAAe;AAC5B,MAAMC,wBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAASH,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAWD;CACX,YAAYA;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAOA,qBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaE,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,UAAgB;AACtC,MAAaC,iBAAe;AAC5B,MAAM,sBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAO,mBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,OAAS;AAC/B,MAAaC,iBAAe;AAC5B,MAAM,mBAAmB,UAAU;AAC/B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,2DAA2D,MAAM,QAAQ,EAAE,OAAO,OAAO,CAAC;AAErH,SAAO,gBAAgB,MAAM,MAAM;;CAE1C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU,CAAC,MAAM,uBAAuB,EAC1D,SAAS,mCACZ,CAAC;AACF,MAAaC,iBAAe;AAC5B,MAAM,qBAAqB,UAAU;AACjC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAElE,SAAO,kBAAkB,MAAM,MAAM;;CAE5C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,iBAAiB,UAAU;AAC7B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,cAAc,MAAM,MAAM;;CAExC;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,oBAAoB,UAAU;AAChC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,iBAAiB,MAAM,MAAM;;CAE3C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,mBAAmB,UAAU;AAC/B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,gBAAgB,MAAM,MAAM;;CAE1C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAa,SAASC,KAAO;AAC7B,MAAaC,iBAAe;AAC5B,MAAM,iBAAiB,UAAU;AAC7B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAAS,OAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaC,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAO,cAAc,MAAM,MAAM;;CAExC;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;;;;ACbnD,IAAqB,SAArB,MAA4B;CAC1B,cAAc;;;;;;AAMZ,OAAK,UAAU,IAAI,SAAS,SAAS,WAAW;;;;;;AAM9C,QAAK,WAAW,SAAS;;;;;;;AAOvB,SAAK,OAAO;AAEZ,YAAQ,KAAK;;;;;;;AAQf,QAAK,SAAS;IACd;AAIF,OAAK,QAAQ,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACsBhC,MAAM,gBAAgB,IAAI,kBAAkB;CAC1C,MAAM;CACN,aAAa;CACb,WAAW,OAAO;AAChB,MAAI,iBAAiB,OAAQ,QAAO,MAAM;AAC1C,QAAM,IAAI,aAAa,wBAAwB;;CAEjD,aAAa,MAAM;AACjB,QAAM,IAAI,aAAa,+BAA+B,EAAE,OAAO,MAAM,CAAC;;CAExE,YAAY;AACV,QAAM,IAAI,aAAa,oCAAoC;;CAE9D,CAAC;;;;;;;;;;ACnFF,MAAa,OAAO;AACpB,MAAa,UAAU;AACvB,MAAa,SAAS;CAClB,MAAM;CACN,aAAa;CAChB;AAED,MAAa,eAAe;AAC5B,MAAa,SAAS;;;ACYtB,MAAa,gBAAgB;CAEzB,QAAA;CAEA,cAAA;CAEA,gBAAA;CAEA,YAAA;CACA,aAAA;CACA,kBAAA;CACA,cAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,cAAA;CACA,iBAAA;CAEA,MAAA;CACA,KAAA;CACA,QAAA;CACA,MAAA;CACA,WAAA;CACH;AAqBD,MAAa,WAAW;CAEpBmB;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACH;UAGwB,eACG,eACH,gBACI,eACN,eACF,eACC,gBACE,eACL,eACE,eACJ,eACD,gBACO,gBACI,gBACF,gBACN,aACF;UAIQ,eACG,eACH,gBACI,eACN,eACF,eACC,gBACE,eACL,eACE,eACJ,eACD,gBACO,gBACI,gBACF,gBACN,aACF;;;ACxHjB,MAAa,wBAAwB;;;;AAKrC,MAAa,cAAc,SAAS,KAAK,KAAK;AAK9C,MAAa,mBAAmB,YADH,YAFG,GAAG,sBAAsB,IAAI,cAEH,CACA;AAS1D,MAAa,gBAAgB"}
+{"version":3,"file":"documents-D4ek7Ubv.js","names":["type","typedef","schema","z.object","z.string","z.number","stringSchema","config","scalar","NUMERIC_VALUE_REGEX","type","typedef","schema","z.object","z.string","stringSchema","config","scalar","type","typedef","schema","z.object","z.string","stringSchema","config","scalar","type","typedef","schema","z.object","z.string","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.number","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.iso.datetime","stringSchema","datetimeValidation","config","scalar","type","typedef","schema","z.iso.datetime","stringSchema","config","scalar","type","typedef","schema","z.email","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","schema","z.string","stringSchema","config","scalar","type","typedef","z.url","stringSchema","config","scalar","AmountTokens.scalar","EthereumAddress.scalar","AmountPercentage.scalar","EmailAddress.scalar","DateScalar.scalar","DateTime.scalar","URLScalar.scalar","AmountMoney.scalar","OLabel.scalar","Currency.scalar","PHID.scalar","OID.scalar","AmountFiat.scalar","AmountCurrency.scalar","AmountCrypto.scalar","Amount.scalar","File.scalar","AmountTokens.typedef","EthereumAddress.typedef","AmountPercentage.typedef","EmailAddress.typedef","DateScalar.typedef","DateTime.typedef","URLScalar.typedef","AmountMoney.typedef","OLabel.typedef","Currency.typedef","PHID.typedef","OID.typedef","AmountFiat.typedef","AmountCurrency.typedef","AmountCrypto.typedef","Amount.typedef","File.typedef","AmountTokens.type","EthereumAddress.type","EmailAddress.type","AmountPercentage.type","DateScalar.type","DateTime.type","URLScalar.type","AmountMoney.type","OLabel.type","Currency.type","PHID.type","OID.type","AmountFiat.type","AmountCurrency.type","AmountCrypto.type","Amount.type","File.type","AmountTokens.stringSchema","EthereumAddress.stringSchema","EmailAddress.stringSchema","AmountPercentage.stringSchema","DateScalar.stringSchema","DateTime.stringSchema","URLScalar.stringSchema","AmountMoney.stringSchema","OLabel.stringSchema","Currency.stringSchema","PHID.stringSchema","OID.stringSchema","AmountFiat.stringSchema","AmountCurrency.stringSchema","AmountCrypto.stringSchema","Amount.stringSchema","File.stringSchema"],"sources":["../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/didYouMean.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/identityFunc.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/keyMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/keyValMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/mapValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/naturalCompare.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/suggestionList.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/toObjMap.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printString.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/visitor.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printer.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/valueFromASTUntyped.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/assertName.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/definition.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/typeComparators.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/scalars.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/directives.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/isIterableObject.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/astFromValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/introspection.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/schema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/type/validate.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/typeFromAST.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/TypeInfo.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/predicates.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ExecutableDefinitionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/FieldsOnCorrectTypeRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/FragmentsOnCompositeTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownArgumentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownDirectivesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownFragmentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/KnownTypeNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/LoneAnonymousOperationRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/LoneSchemaDefinitionRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/MaxIntrospectionDepthRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoFragmentCyclesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUndefinedVariablesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUnusedFragmentsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/NoUnusedVariablesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/sortValueNode.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/OverlappingFieldsCanBeMergedRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/PossibleFragmentSpreadsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/PossibleTypeExtensionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ProvidedRequiredArgumentsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ScalarLeafsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/printPathArray.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/Path.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/coerceInputValue.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/valueFromAST.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/execution/values.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/execution/collectFields.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/SingleFieldSubscriptionsRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/groupBy.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueArgumentDefinitionNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueArgumentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueDirectiveNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueDirectivesPerLocationRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueEnumValueNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueFieldDefinitionNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueFragmentNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueInputFieldNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueOperationNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueOperationTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueTypeNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/UniqueVariableNamesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/ValuesOfCorrectTypeRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/VariablesAreInputTypesRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/rules/VariablesInAllowedPositionRule.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/specifiedRules.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/ValidationContext.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/validation/validate.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/extendSchema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/buildASTSchema.mjs","../../../../node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/utilities/printSchema.mjs","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Amount.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountCrypto.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountCurrency.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountFiat.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountMoney.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountPercentage.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/AmountTokens.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Currency.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/Date.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/DateTime.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/EmailAddress.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/EthereumAddress.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/OID.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/OLabel.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/PHID.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/URL.js","../../../../node_modules/.pnpm/graphql-upload@17.0.0_@types+express@4.17.25_graphql@16.12.0/node_modules/graphql-upload/Upload.mjs","../../../../node_modules/.pnpm/graphql-upload@17.0.0_@types+express@4.17.25_graphql@16.12.0/node_modules/graphql-upload/GraphQLUpload.mjs","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/File.js","../../../../node_modules/.pnpm/@powerhousedao+document-engineering@1.40.5_@types+express@4.17.25_@types+react-dom@19.2_75e28b6ec666f63b132a491ff3a6fdf7/node_modules/@powerhousedao/document-engineering/dist/src/scalars/graphql/scalars.js","../../editors/document-model-editor/constants/documents.ts"],"sourcesContent":["const MAX_SUGGESTIONS = 5;\n/**\n * Given [ A, B, C ] return ' Did you mean A, B, or C?'.\n */\n\nexport function didYouMean(firstArg, secondArg) {\n  const [subMessage, suggestionsArg] = secondArg\n    ? [firstArg, secondArg]\n    : [undefined, firstArg];\n  let message = ' Did you mean ';\n\n  if (subMessage) {\n    message += subMessage + ' ';\n  }\n\n  const suggestions = suggestionsArg.map((x) => `\"${x}\"`);\n\n  switch (suggestions.length) {\n    case 0:\n      return '';\n\n    case 1:\n      return message + suggestions[0] + '?';\n\n    case 2:\n      return message + suggestions[0] + ' or ' + suggestions[1] + '?';\n  }\n\n  const selected = suggestions.slice(0, MAX_SUGGESTIONS);\n  const lastItem = selected.pop();\n  return message + selected.join(', ') + ', or ' + lastItem + '?';\n}\n","/**\n * Returns the first argument it receives.\n */\nexport function identityFunc(x) {\n  return x;\n}\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * for each value in the array.\n *\n * This provides a convenient lookup for the array items if the key function\n * produces unique results.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * const entriesByName = keyMap(\n *   phoneBook,\n *   entry => entry.name\n * )\n *\n * // {\n * //   Jon: { name: 'Jon', num: '555-1234' },\n * //   Jenny: { name: 'Jenny', num: '867-5309' }\n * // }\n *\n * const jennyEntry = entriesByName['Jenny']\n *\n * // { name: 'Jenny', num: '857-6309' }\n * ```\n */\nexport function keyMap(list, keyFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = item;\n  }\n\n  return result;\n}\n","/**\n * Creates a keyed JS object from an array, given a function to produce the keys\n * and a function to produce the values from each item in the array.\n * ```ts\n * const phoneBook = [\n *   { name: 'Jon', num: '555-1234' },\n *   { name: 'Jenny', num: '867-5309' }\n * ]\n *\n * // { Jon: '555-1234', Jenny: '867-5309' }\n * const phonesByName = keyValMap(\n *   phoneBook,\n *   entry => entry.name,\n *   entry => entry.num\n * )\n * ```\n */\nexport function keyValMap(list, keyFn, valFn) {\n  const result = Object.create(null);\n\n  for (const item of list) {\n    result[keyFn(item)] = valFn(item);\n  }\n\n  return result;\n}\n","/**\n * Creates an object map with the same keys as `map` and values generated by\n * running each value of `map` thru `fn`.\n */\nexport function mapValue(map, fn) {\n  const result = Object.create(null);\n\n  for (const key of Object.keys(map)) {\n    result[key] = fn(map[key], key);\n  }\n\n  return result;\n}\n","/**\n * Returns a number indicating whether a reference string comes before, or after,\n * or is the same as the given string in natural sort order.\n *\n * See: https://en.wikipedia.org/wiki/Natural_sort_order\n *\n */\nexport function naturalCompare(aStr, bStr) {\n  let aIndex = 0;\n  let bIndex = 0;\n\n  while (aIndex < aStr.length && bIndex < bStr.length) {\n    let aChar = aStr.charCodeAt(aIndex);\n    let bChar = bStr.charCodeAt(bIndex);\n\n    if (isDigit(aChar) && isDigit(bChar)) {\n      let aNum = 0;\n\n      do {\n        ++aIndex;\n        aNum = aNum * 10 + aChar - DIGIT_0;\n        aChar = aStr.charCodeAt(aIndex);\n      } while (isDigit(aChar) && aNum > 0);\n\n      let bNum = 0;\n\n      do {\n        ++bIndex;\n        bNum = bNum * 10 + bChar - DIGIT_0;\n        bChar = bStr.charCodeAt(bIndex);\n      } while (isDigit(bChar) && bNum > 0);\n\n      if (aNum < bNum) {\n        return -1;\n      }\n\n      if (aNum > bNum) {\n        return 1;\n      }\n    } else {\n      if (aChar < bChar) {\n        return -1;\n      }\n\n      if (aChar > bChar) {\n        return 1;\n      }\n\n      ++aIndex;\n      ++bIndex;\n    }\n  }\n\n  return aStr.length - bStr.length;\n}\nconst DIGIT_0 = 48;\nconst DIGIT_9 = 57;\n\nfunction isDigit(code) {\n  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;\n}\n","import { naturalCompare } from './naturalCompare.mjs';\n/**\n * Given an invalid input string and a list of valid options, returns a filtered\n * list of valid options sorted based on their similarity with the input.\n */\n\nexport function suggestionList(input, options) {\n  const optionsByDistance = Object.create(null);\n  const lexicalDistance = new LexicalDistance(input);\n  const threshold = Math.floor(input.length * 0.4) + 1;\n\n  for (const option of options) {\n    const distance = lexicalDistance.measure(option, threshold);\n\n    if (distance !== undefined) {\n      optionsByDistance[option] = distance;\n    }\n  }\n\n  return Object.keys(optionsByDistance).sort((a, b) => {\n    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];\n    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);\n  });\n}\n/**\n * Computes the lexical distance between strings A and B.\n *\n * The \"distance\" between two strings is given by counting the minimum number\n * of edits needed to transform string A into string B. An edit can be an\n * insertion, deletion, or substitution of a single character, or a swap of two\n * adjacent characters.\n *\n * Includes a custom alteration from Damerau-Levenshtein to treat case changes\n * as a single edit which helps identify mis-cased values with an edit distance\n * of 1.\n *\n * This distance can be useful for detecting typos in input or sorting\n */\n\nclass LexicalDistance {\n  constructor(input) {\n    this._input = input;\n    this._inputLowerCase = input.toLowerCase();\n    this._inputArray = stringToArray(this._inputLowerCase);\n    this._rows = [\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n      new Array(input.length + 1).fill(0),\n    ];\n  }\n\n  measure(option, threshold) {\n    if (this._input === option) {\n      return 0;\n    }\n\n    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit\n\n    if (this._inputLowerCase === optionLowerCase) {\n      return 1;\n    }\n\n    let a = stringToArray(optionLowerCase);\n    let b = this._inputArray;\n\n    if (a.length < b.length) {\n      const tmp = a;\n      a = b;\n      b = tmp;\n    }\n\n    const aLength = a.length;\n    const bLength = b.length;\n\n    if (aLength - bLength > threshold) {\n      return undefined;\n    }\n\n    const rows = this._rows;\n\n    for (let j = 0; j <= bLength; j++) {\n      rows[0][j] = j;\n    }\n\n    for (let i = 1; i <= aLength; i++) {\n      const upRow = rows[(i - 1) % 3];\n      const currentRow = rows[i % 3];\n      let smallestCell = (currentRow[0] = i);\n\n      for (let j = 1; j <= bLength; j++) {\n        const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n        let currentCell = Math.min(\n          upRow[j] + 1, // delete\n          currentRow[j - 1] + 1, // insert\n          upRow[j - 1] + cost, // substitute\n        );\n\n        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n          // transposition\n          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];\n          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);\n        }\n\n        if (currentCell < smallestCell) {\n          smallestCell = currentCell;\n        }\n\n        currentRow[j] = currentCell;\n      } // Early exit, since distance can't go smaller than smallest element of the previous row.\n\n      if (smallestCell > threshold) {\n        return undefined;\n      }\n    }\n\n    const distance = rows[aLength % 3][bLength];\n    return distance <= threshold ? distance : undefined;\n  }\n}\n\nfunction stringToArray(str) {\n  const strLength = str.length;\n  const array = new Array(strLength);\n\n  for (let i = 0; i < strLength; ++i) {\n    array[i] = str.charCodeAt(i);\n  }\n\n  return array;\n}\n","export function toObjMap(obj) {\n  if (obj == null) {\n    return Object.create(null);\n  }\n\n  if (Object.getPrototypeOf(obj) === null) {\n    return obj;\n  }\n\n  const map = Object.create(null);\n\n  for (const [key, value] of Object.entries(obj)) {\n    map[key] = value;\n  }\n\n  return map;\n}\n","/**\n * Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n */\nexport function printString(str) {\n  return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n  return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n  '\\\\u0000',\n  '\\\\u0001',\n  '\\\\u0002',\n  '\\\\u0003',\n  '\\\\u0004',\n  '\\\\u0005',\n  '\\\\u0006',\n  '\\\\u0007',\n  '\\\\b',\n  '\\\\t',\n  '\\\\n',\n  '\\\\u000B',\n  '\\\\f',\n  '\\\\r',\n  '\\\\u000E',\n  '\\\\u000F',\n  '\\\\u0010',\n  '\\\\u0011',\n  '\\\\u0012',\n  '\\\\u0013',\n  '\\\\u0014',\n  '\\\\u0015',\n  '\\\\u0016',\n  '\\\\u0017',\n  '\\\\u0018',\n  '\\\\u0019',\n  '\\\\u001A',\n  '\\\\u001B',\n  '\\\\u001C',\n  '\\\\u001D',\n  '\\\\u001E',\n  '\\\\u001F',\n  '',\n  '',\n  '\\\\\"',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 2F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 3F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 4F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\\\\\',\n  '',\n  '',\n  '', // 5F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '', // 6F\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '',\n  '\\\\u007F',\n  '\\\\u0080',\n  '\\\\u0081',\n  '\\\\u0082',\n  '\\\\u0083',\n  '\\\\u0084',\n  '\\\\u0085',\n  '\\\\u0086',\n  '\\\\u0087',\n  '\\\\u0088',\n  '\\\\u0089',\n  '\\\\u008A',\n  '\\\\u008B',\n  '\\\\u008C',\n  '\\\\u008D',\n  '\\\\u008E',\n  '\\\\u008F',\n  '\\\\u0090',\n  '\\\\u0091',\n  '\\\\u0092',\n  '\\\\u0093',\n  '\\\\u0094',\n  '\\\\u0095',\n  '\\\\u0096',\n  '\\\\u0097',\n  '\\\\u0098',\n  '\\\\u0099',\n  '\\\\u009A',\n  '\\\\u009B',\n  '\\\\u009C',\n  '\\\\u009D',\n  '\\\\u009E',\n  '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/**\n * A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n */\n\nexport const BREAK = Object.freeze({});\n/**\n * visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n *\n * By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n *\n * When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n *\n * ```ts\n * const editedAST = visit(ast, {\n *   enter(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: skip visiting this node\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   },\n *   leave(node, key, parent, path, ancestors) {\n *     // @return\n *     //   undefined: no action\n *     //   false: no action\n *     //   visitor.BREAK: stop visiting altogether\n *     //   null: delete this node\n *     //   any value: replace this node with the returned value\n *   }\n * });\n * ```\n *\n * Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n *\n * 1) Named visitors triggered when entering a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind(node) {\n *     // enter the \"Kind\" node\n *   }\n * })\n * ```\n *\n * 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n *\n * ```ts\n * visit(ast, {\n *   Kind: {\n *     enter(node) {\n *       // enter the \"Kind\" node\n *     }\n *     leave(node) {\n *       // leave the \"Kind\" node\n *     }\n *   }\n * })\n * ```\n *\n * 3) Generic visitors that trigger upon entering and leaving any node.\n *\n * ```ts\n * visit(ast, {\n *   enter(node) {\n *     // enter any node\n *   },\n *   leave(node) {\n *     // leave any node\n *   }\n * })\n * ```\n */\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n  const enterLeaveMap = new Map();\n\n  for (const kind of Object.values(Kind)) {\n    enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n  }\n  /* eslint-disable no-undef-init */\n\n  let stack = undefined;\n  let inArray = Array.isArray(root);\n  let keys = [root];\n  let index = -1;\n  let edits = [];\n  let node = root;\n  let key = undefined;\n  let parent = undefined;\n  const path = [];\n  const ancestors = [];\n  /* eslint-enable no-undef-init */\n\n  do {\n    index++;\n    const isLeaving = index === keys.length;\n    const isEdited = isLeaving && edits.length !== 0;\n\n    if (isLeaving) {\n      key = ancestors.length === 0 ? undefined : path[path.length - 1];\n      node = parent;\n      parent = ancestors.pop();\n\n      if (isEdited) {\n        if (inArray) {\n          node = node.slice();\n          let editOffset = 0;\n\n          for (const [editKey, editValue] of edits) {\n            const arrayKey = editKey - editOffset;\n\n            if (editValue === null) {\n              node.splice(arrayKey, 1);\n              editOffset++;\n            } else {\n              node[arrayKey] = editValue;\n            }\n          }\n        } else {\n          node = { ...node };\n\n          for (const [editKey, editValue] of edits) {\n            node[editKey] = editValue;\n          }\n        }\n      }\n\n      index = stack.index;\n      keys = stack.keys;\n      edits = stack.edits;\n      inArray = stack.inArray;\n      stack = stack.prev;\n    } else if (parent) {\n      key = inArray ? index : keys[index];\n      node = parent[key];\n\n      if (node === null || node === undefined) {\n        continue;\n      }\n\n      path.push(key);\n    }\n\n    let result;\n\n    if (!Array.isArray(node)) {\n      var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n      isNode(node) || devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n      const visitFn = isLeaving\n        ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get === void 0\n          ? void 0\n          : _enterLeaveMap$get.leave\n        : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||\n          _enterLeaveMap$get2 === void 0\n        ? void 0\n        : _enterLeaveMap$get2.enter;\n      result =\n        visitFn === null || visitFn === void 0\n          ? void 0\n          : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n      if (result === BREAK) {\n        break;\n      }\n\n      if (result === false) {\n        if (!isLeaving) {\n          path.pop();\n          continue;\n        }\n      } else if (result !== undefined) {\n        edits.push([key, result]);\n\n        if (!isLeaving) {\n          if (isNode(result)) {\n            node = result;\n          } else {\n            path.pop();\n            continue;\n          }\n        }\n      }\n    }\n\n    if (result === undefined && isEdited) {\n      edits.push([key, node]);\n    }\n\n    if (isLeaving) {\n      path.pop();\n    } else {\n      var _node$kind;\n\n      stack = {\n        inArray,\n        index,\n        keys,\n        edits,\n        prev: stack,\n      };\n      inArray = Array.isArray(node);\n      keys = inArray\n        ? node\n        : (_node$kind = visitorKeys[node.kind]) !== null &&\n          _node$kind !== void 0\n        ? _node$kind\n        : [];\n      index = -1;\n      edits = [];\n\n      if (parent) {\n        ancestors.push(parent);\n      }\n\n      parent = node;\n    }\n  } while (stack !== undefined);\n\n  if (edits.length !== 0) {\n    // New root\n    return edits[edits.length - 1][1];\n  }\n\n  return root;\n}\n/**\n * Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n *\n * If a prior visitor edits a node, no following visitors will see that node.\n */\n\nexport function visitInParallel(visitors) {\n  const skipping = new Array(visitors.length).fill(null);\n  const mergedVisitor = Object.create(null);\n\n  for (const kind of Object.values(Kind)) {\n    let hasVisitor = false;\n    const enterList = new Array(visitors.length).fill(undefined);\n    const leaveList = new Array(visitors.length).fill(undefined);\n\n    for (let i = 0; i < visitors.length; ++i) {\n      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n      hasVisitor || (hasVisitor = enter != null || leave != null);\n      enterList[i] = enter;\n      leaveList[i] = leave;\n    }\n\n    if (!hasVisitor) {\n      continue;\n    }\n\n    const mergedEnterLeave = {\n      enter(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _enterList$i;\n\n            const result =\n              (_enterList$i = enterList[i]) === null || _enterList$i === void 0\n                ? void 0\n                : _enterList$i.apply(visitors[i], args);\n\n            if (result === false) {\n              skipping[i] = node;\n            } else if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined) {\n              return result;\n            }\n          }\n        }\n      },\n\n      leave(...args) {\n        const node = args[0];\n\n        for (let i = 0; i < visitors.length; i++) {\n          if (skipping[i] === null) {\n            var _leaveList$i;\n\n            const result =\n              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0\n                ? void 0\n                : _leaveList$i.apply(visitors[i], args);\n\n            if (result === BREAK) {\n              skipping[i] = BREAK;\n            } else if (result !== undefined && result !== false) {\n              return result;\n            }\n          } else if (skipping[i] === node) {\n            skipping[i] = null;\n          }\n        }\n      },\n    };\n    mergedVisitor[kind] = mergedEnterLeave;\n  }\n\n  return mergedVisitor;\n}\n/**\n * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n */\n\nexport function getEnterLeaveForKind(visitor, kind) {\n  const kindVisitor = visitor[kind];\n\n  if (typeof kindVisitor === 'object') {\n    // { Kind: { enter() {}, leave() {} } }\n    return kindVisitor;\n  } else if (typeof kindVisitor === 'function') {\n    // { Kind() {} }\n    return {\n      enter: kindVisitor,\n      leave: undefined,\n    };\n  } // { enter() {}, leave() {} }\n\n  return {\n    enter: visitor.enter,\n    leave: visitor.leave,\n  };\n}\n/**\n * Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n *\n * @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n */\n\n/* c8 ignore next 8 */\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n  const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n  return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.mjs';\n/**\n * Converts an AST into a string, using one set of reasonable\n * formatting rules.\n */\n\nexport function print(ast) {\n  return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n  Name: {\n    leave: (node) => node.value,\n  },\n  Variable: {\n    leave: (node) => '$' + node.name,\n  },\n  // Document\n  Document: {\n    leave: (node) => join(node.definitions, '\\n\\n'),\n  },\n  OperationDefinition: {\n    leave(node) {\n      const varDefs = hasMultilineItems(node.variableDefinitions)\n        ? wrap('(\\n', join(node.variableDefinitions, '\\n'), '\\n)')\n        : wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix =\n        wrap('', node.description, '\\n') +\n        join(\n          [\n            node.operation,\n            join([node.name, varDefs]),\n            join(node.directives, ' '),\n          ],\n          ' ',\n        ); // Anonymous queries with no directives or variable definitions can use\n      // the query short form.\n\n      return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n    },\n  },\n  VariableDefinition: {\n    leave: ({ variable, type, defaultValue, directives, description }) =>\n      wrap('', description, '\\n') +\n      variable +\n      ': ' +\n      type +\n      wrap(' = ', defaultValue) +\n      wrap(' ', join(directives, ' ')),\n  },\n  SelectionSet: {\n    leave: ({ selections }) => block(selections),\n  },\n  Field: {\n    leave({ alias, name, arguments: args, directives, selectionSet }) {\n      const prefix = wrap('', alias, ': ') + name;\n      let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n      if (argsLine.length > MAX_LINE_LENGTH) {\n        argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n      }\n\n      return join([argsLine, join(directives, ' '), selectionSet], ' ');\n    },\n  },\n  Argument: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Fragments\n  FragmentSpread: {\n    leave: ({ name, directives }) =>\n      '...' + name + wrap(' ', join(directives, ' ')),\n  },\n  InlineFragment: {\n    leave: ({ typeCondition, directives, selectionSet }) =>\n      join(\n        [\n          '...',\n          wrap('on ', typeCondition),\n          join(directives, ' '),\n          selectionSet,\n        ],\n        ' ',\n      ),\n  },\n  FragmentDefinition: {\n    leave: ({\n      name,\n      typeCondition,\n      variableDefinitions,\n      directives,\n      selectionSet,\n      description,\n    }) =>\n      wrap('', description, '\\n') + // Note: fragment variable definitions are experimental and may be changed\n      // or removed in the future.\n      `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n      `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n      selectionSet,\n  },\n  // Value\n  IntValue: {\n    leave: ({ value }) => value,\n  },\n  FloatValue: {\n    leave: ({ value }) => value,\n  },\n  StringValue: {\n    leave: ({ value, block: isBlockString }) =>\n      isBlockString ? printBlockString(value) : printString(value),\n  },\n  BooleanValue: {\n    leave: ({ value }) => (value ? 'true' : 'false'),\n  },\n  NullValue: {\n    leave: () => 'null',\n  },\n  EnumValue: {\n    leave: ({ value }) => value,\n  },\n  ListValue: {\n    leave: ({ values }) => '[' + join(values, ', ') + ']',\n  },\n  ObjectValue: {\n    leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n  },\n  ObjectField: {\n    leave: ({ name, value }) => name + ': ' + value,\n  },\n  // Directive\n  Directive: {\n    leave: ({ name, arguments: args }) =>\n      '@' + name + wrap('(', join(args, ', '), ')'),\n  },\n  // Type\n  NamedType: {\n    leave: ({ name }) => name,\n  },\n  ListType: {\n    leave: ({ type }) => '[' + type + ']',\n  },\n  NonNullType: {\n    leave: ({ type }) => type + '!',\n  },\n  // Type System Definitions\n  SchemaDefinition: {\n    leave: ({ description, directives, operationTypes }) =>\n      wrap('', description, '\\n') +\n      join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n  },\n  OperationTypeDefinition: {\n    leave: ({ operation, type }) => operation + ': ' + type,\n  },\n  ScalarTypeDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') +\n      join(['scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  FieldDefinition: {\n    leave: ({ description, name, arguments: args, type, directives }) =>\n      wrap('', description, '\\n') +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      ': ' +\n      type +\n      wrap(' ', join(directives, ' ')),\n  },\n  InputValueDefinition: {\n    leave: ({ description, name, type, defaultValue, directives }) =>\n      wrap('', description, '\\n') +\n      join(\n        [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n        ' ',\n      ),\n  },\n  InterfaceTypeDefinition: {\n    leave: ({ description, name, interfaces, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(\n        [\n          'interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeDefinition: {\n    leave: ({ description, name, directives, types }) =>\n      wrap('', description, '\\n') +\n      join(\n        ['union', name, join(directives, ' '), wrap('= ', join(types, ' | '))],\n        ' ',\n      ),\n  },\n  EnumTypeDefinition: {\n    leave: ({ description, name, directives, values }) =>\n      wrap('', description, '\\n') +\n      join(['enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  EnumValueDefinition: {\n    leave: ({ description, name, directives }) =>\n      wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n  },\n  InputObjectTypeDefinition: {\n    leave: ({ description, name, directives, fields }) =>\n      wrap('', description, '\\n') +\n      join(['input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  DirectiveDefinition: {\n    leave: ({ description, name, arguments: args, repeatable, locations }) =>\n      wrap('', description, '\\n') +\n      'directive @' +\n      name +\n      (hasMultilineItems(args)\n        ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n        : wrap('(', join(args, ', '), ')')) +\n      (repeatable ? ' repeatable' : '') +\n      ' on ' +\n      join(locations, ' | '),\n  },\n  SchemaExtension: {\n    leave: ({ directives, operationTypes }) =>\n      join(\n        ['extend schema', join(directives, ' '), block(operationTypes)],\n        ' ',\n      ),\n  },\n  ScalarTypeExtension: {\n    leave: ({ name, directives }) =>\n      join(['extend scalar', name, join(directives, ' ')], ' '),\n  },\n  ObjectTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend type',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  InterfaceTypeExtension: {\n    leave: ({ name, interfaces, directives, fields }) =>\n      join(\n        [\n          'extend interface',\n          name,\n          wrap('implements ', join(interfaces, ' & ')),\n          join(directives, ' '),\n          block(fields),\n        ],\n        ' ',\n      ),\n  },\n  UnionTypeExtension: {\n    leave: ({ name, directives, types }) =>\n      join(\n        [\n          'extend union',\n          name,\n          join(directives, ' '),\n          wrap('= ', join(types, ' | ')),\n        ],\n        ' ',\n      ),\n  },\n  EnumTypeExtension: {\n    leave: ({ name, directives, values }) =>\n      join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n  },\n  InputObjectTypeExtension: {\n    leave: ({ name, directives, fields }) =>\n      join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n  },\n  // Schema Coordinates\n  TypeCoordinate: {\n    leave: ({ name }) => name,\n  },\n  MemberCoordinate: {\n    leave: ({ name, memberName }) => join([name, wrap('.', memberName)]),\n  },\n  ArgumentCoordinate: {\n    leave: ({ name, fieldName, argumentName }) =>\n      join([name, wrap('.', fieldName), wrap('(', argumentName, ':)')]),\n  },\n  DirectiveCoordinate: {\n    leave: ({ name }) => join(['@', name]),\n  },\n  DirectiveArgumentCoordinate: {\n    leave: ({ name, argumentName }) =>\n      join(['@', name, wrap('(', argumentName, ':)')]),\n  },\n};\n/**\n * Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n */\n\nfunction join(maybeArray, separator = '') {\n  var _maybeArray$filter$jo;\n\n  return (_maybeArray$filter$jo =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.filter((x) => x).join(separator)) !== null &&\n    _maybeArray$filter$jo !== void 0\n    ? _maybeArray$filter$jo\n    : '';\n}\n/**\n * Given array, print each item on its own line, wrapped in an indented `{ }` block.\n */\n\nfunction block(array) {\n  return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/**\n * If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n */\n\nfunction wrap(start, maybeString, end = '') {\n  return maybeString != null && maybeString !== ''\n    ? start + maybeString + end\n    : '';\n}\n\nfunction indent(str) {\n  return wrap('  ', str.replace(/\\n/g, '\\n  '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n  var _maybeArray$some;\n\n  // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n  return (_maybeArray$some =\n    maybeArray === null || maybeArray === void 0\n      ? void 0\n      : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n    _maybeArray$some !== void 0\n    ? _maybeArray$some\n    : false;\n}\n","import { keyValMap } from '../jsutils/keyValMap.mjs';\nimport { Kind } from '../language/kinds.mjs';\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * Unlike `valueFromAST()`, no type is provided. The resulting JavaScript value\n * will reflect the provided GraphQL value AST.\n *\n * | GraphQL Value        | JavaScript Value |\n * | -------------------- | ---------------- |\n * | Input Object         | Object           |\n * | List                 | Array            |\n * | Boolean              | Boolean          |\n * | String / Enum        | String           |\n * | Int / Float          | Number           |\n * | Null                 | null             |\n *\n */\n\nexport function valueFromASTUntyped(valueNode, variables) {\n  switch (valueNode.kind) {\n    case Kind.NULL:\n      return null;\n\n    case Kind.INT:\n      return parseInt(valueNode.value, 10);\n\n    case Kind.FLOAT:\n      return parseFloat(valueNode.value);\n\n    case Kind.STRING:\n    case Kind.ENUM:\n    case Kind.BOOLEAN:\n      return valueNode.value;\n\n    case Kind.LIST:\n      return valueNode.values.map((node) =>\n        valueFromASTUntyped(node, variables),\n      );\n\n    case Kind.OBJECT:\n      return keyValMap(\n        valueNode.fields,\n        (field) => field.name.value,\n        (field) => valueFromASTUntyped(field.value, variables),\n      );\n\n    case Kind.VARIABLE:\n      return variables === null || variables === void 0\n        ? void 0\n        : variables[valueNode.name.value];\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { isNameContinue, isNameStart } from '../language/characterClasses.mjs';\n/**\n * Upholds the spec rules about naming.\n */\n\nexport function assertName(name) {\n  name != null || devAssert(false, 'Must provide name.');\n  typeof name === 'string' || devAssert(false, 'Expected name to be a string.');\n\n  if (name.length === 0) {\n    throw new GraphQLError('Expected name to be a non-empty string.');\n  }\n\n  for (let i = 1; i < name.length; ++i) {\n    if (!isNameContinue(name.charCodeAt(i))) {\n      throw new GraphQLError(\n        `Names must only contain [_a-zA-Z0-9] but \"${name}\" does not.`,\n      );\n    }\n  }\n\n  if (!isNameStart(name.charCodeAt(0))) {\n    throw new GraphQLError(\n      `Names must start with [_a-zA-Z] but \"${name}\" does not.`,\n    );\n  }\n\n  return name;\n}\n/**\n * Upholds the spec rules about naming enum values.\n *\n * @internal\n */\n\nexport function assertEnumValueName(name) {\n  if (name === 'true' || name === 'false' || name === 'null') {\n    throw new GraphQLError(`Enum values cannot be named: ${name}`);\n  }\n\n  return assertName(name);\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { didYouMean } from '../jsutils/didYouMean.mjs';\nimport { identityFunc } from '../jsutils/identityFunc.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { keyValMap } from '../jsutils/keyValMap.mjs';\nimport { mapValue } from '../jsutils/mapValue.mjs';\nimport { suggestionList } from '../jsutils/suggestionList.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { valueFromASTUntyped } from '../utilities/valueFromASTUntyped.mjs';\nimport { assertEnumValueName, assertName } from './assertName.mjs';\nexport function isType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type) ||\n    isListType(type) ||\n    isNonNullType(type)\n  );\n}\nexport function assertType(type) {\n  if (!isType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL type.`);\n  }\n\n  return type;\n}\n/**\n * There are predicates for each kind of GraphQL type.\n */\n\nexport function isScalarType(type) {\n  return instanceOf(type, GraphQLScalarType);\n}\nexport function assertScalarType(type) {\n  if (!isScalarType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Scalar type.`);\n  }\n\n  return type;\n}\nexport function isObjectType(type) {\n  return instanceOf(type, GraphQLObjectType);\n}\nexport function assertObjectType(type) {\n  if (!isObjectType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Object type.`);\n  }\n\n  return type;\n}\nexport function isInterfaceType(type) {\n  return instanceOf(type, GraphQLInterfaceType);\n}\nexport function assertInterfaceType(type) {\n  if (!isInterfaceType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL Interface type.`,\n    );\n  }\n\n  return type;\n}\nexport function isUnionType(type) {\n  return instanceOf(type, GraphQLUnionType);\n}\nexport function assertUnionType(type) {\n  if (!isUnionType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Union type.`);\n  }\n\n  return type;\n}\nexport function isEnumType(type) {\n  return instanceOf(type, GraphQLEnumType);\n}\nexport function assertEnumType(type) {\n  if (!isEnumType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Enum type.`);\n  }\n\n  return type;\n}\nexport function isInputObjectType(type) {\n  return instanceOf(type, GraphQLInputObjectType);\n}\nexport function assertInputObjectType(type) {\n  if (!isInputObjectType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL Input Object type.`,\n    );\n  }\n\n  return type;\n}\nexport function isListType(type) {\n  return instanceOf(type, GraphQLList);\n}\nexport function assertListType(type) {\n  if (!isListType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL List type.`);\n  }\n\n  return type;\n}\nexport function isNonNullType(type) {\n  return instanceOf(type, GraphQLNonNull);\n}\nexport function assertNonNullType(type) {\n  if (!isNonNullType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL Non-Null type.`);\n  }\n\n  return type;\n}\n/**\n * These types may be used as input types for arguments and directives.\n */\n\nexport function isInputType(type) {\n  return (\n    isScalarType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type) ||\n    (isWrappingType(type) && isInputType(type.ofType))\n  );\n}\nexport function assertInputType(type) {\n  if (!isInputType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL input type.`);\n  }\n\n  return type;\n}\n/**\n * These types may be used as output types as the result of fields.\n */\n\nexport function isOutputType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    (isWrappingType(type) && isOutputType(type.ofType))\n  );\n}\nexport function assertOutputType(type) {\n  if (!isOutputType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL output type.`);\n  }\n\n  return type;\n}\n/**\n * These types may describe types which may be leaf values.\n */\n\nexport function isLeafType(type) {\n  return isScalarType(type) || isEnumType(type);\n}\nexport function assertLeafType(type) {\n  if (!isLeafType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL leaf type.`);\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isCompositeType(type) {\n  return isObjectType(type) || isInterfaceType(type) || isUnionType(type);\n}\nexport function assertCompositeType(type) {\n  if (!isCompositeType(type)) {\n    throw new Error(\n      `Expected ${inspect(type)} to be a GraphQL composite type.`,\n    );\n  }\n\n  return type;\n}\n/**\n * These types may describe the parent context of a selection set.\n */\n\nexport function isAbstractType(type) {\n  return isInterfaceType(type) || isUnionType(type);\n}\nexport function assertAbstractType(type) {\n  if (!isAbstractType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL abstract type.`);\n  }\n\n  return type;\n}\n/**\n * List Type Wrapper\n *\n * A list is a wrapping type which points to another type.\n * Lists are often created within the context of defining the fields of\n * an object type.\n *\n * Example:\n *\n * ```ts\n * const PersonType = new GraphQLObjectType({\n *   name: 'Person',\n *   fields: () => ({\n *     parents: { type: new GraphQLList(PersonType) },\n *     children: { type: new GraphQLList(PersonType) },\n *   })\n * })\n * ```\n */\n\nexport class GraphQLList {\n  constructor(ofType) {\n    isType(ofType) ||\n      devAssert(false, `Expected ${inspect(ofType)} to be a GraphQL type.`);\n    this.ofType = ofType;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLList';\n  }\n\n  toString() {\n    return '[' + String(this.ofType) + ']';\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n/**\n * Non-Null Type Wrapper\n *\n * A non-null is a wrapping type which points to another type.\n * Non-null types enforce that their values are never null and can ensure\n * an error is raised if this ever occurs during a request. It is useful for\n * fields which you can make a strong guarantee on non-nullability, for example\n * usually the id field of a database row will never be null.\n *\n * Example:\n *\n * ```ts\n * const RowType = new GraphQLObjectType({\n *   name: 'Row',\n *   fields: () => ({\n *     id: { type: new GraphQLNonNull(GraphQLString) },\n *   })\n * })\n * ```\n * Note: the enforcement of non-nullability occurs within the executor.\n */\n\nexport class GraphQLNonNull {\n  constructor(ofType) {\n    isNullableType(ofType) ||\n      devAssert(\n        false,\n        `Expected ${inspect(ofType)} to be a GraphQL nullable type.`,\n      );\n    this.ofType = ofType;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLNonNull';\n  }\n\n  toString() {\n    return String(this.ofType) + '!';\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n/**\n * These types wrap and modify other types\n */\n\nexport function isWrappingType(type) {\n  return isListType(type) || isNonNullType(type);\n}\nexport function assertWrappingType(type) {\n  if (!isWrappingType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL wrapping type.`);\n  }\n\n  return type;\n}\n/**\n * These types can all accept null as a value.\n */\n\nexport function isNullableType(type) {\n  return isType(type) && !isNonNullType(type);\n}\nexport function assertNullableType(type) {\n  if (!isNullableType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL nullable type.`);\n  }\n\n  return type;\n}\nexport function getNullableType(type) {\n  if (type) {\n    return isNonNullType(type) ? type.ofType : type;\n  }\n}\n/**\n * These named types do not include modifiers like List or NonNull.\n */\n\nexport function isNamedType(type) {\n  return (\n    isScalarType(type) ||\n    isObjectType(type) ||\n    isInterfaceType(type) ||\n    isUnionType(type) ||\n    isEnumType(type) ||\n    isInputObjectType(type)\n  );\n}\nexport function assertNamedType(type) {\n  if (!isNamedType(type)) {\n    throw new Error(`Expected ${inspect(type)} to be a GraphQL named type.`);\n  }\n\n  return type;\n}\nexport function getNamedType(type) {\n  if (type) {\n    let unwrappedType = type;\n\n    while (isWrappingType(unwrappedType)) {\n      unwrappedType = unwrappedType.ofType;\n    }\n\n    return unwrappedType;\n  }\n}\n/**\n * Used while defining GraphQL types to allow for circular references in\n * otherwise immutable type definitions.\n */\n\nexport function resolveReadonlyArrayThunk(thunk) {\n  return typeof thunk === 'function' ? thunk() : thunk;\n}\nexport function resolveObjMapThunk(thunk) {\n  return typeof thunk === 'function' ? thunk() : thunk;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Scalar Type Definition\n *\n * The leaf values of any request and input values to arguments are\n * Scalars (or Enums) and are defined with a name and a series of functions\n * used to parse input from ast or variables and to ensure validity.\n *\n * If a type's serialize function returns `null` or does not return a value\n * (i.e. it returns `undefined`) then an error will be raised and a `null`\n * value will be returned in the response. It is always better to validate\n *\n * Example:\n *\n * ```ts\n * const OddType = new GraphQLScalarType({\n *   name: 'Odd',\n *   serialize(value) {\n *     if (!Number.isFinite(value)) {\n *       throw new Error(\n *         `Scalar \"Odd\" cannot represent \"${value}\" since it is not a finite number.`,\n *       );\n *     }\n *\n *     if (value % 2 === 0) {\n *       throw new Error(`Scalar \"Odd\" cannot represent \"${value}\" since it is even.`);\n *     }\n *     return value;\n *   }\n * });\n * ```\n */\nexport class GraphQLScalarType {\n  constructor(config) {\n    var _config$parseValue,\n      _config$serialize,\n      _config$parseLiteral,\n      _config$extensionASTN;\n\n    const parseValue =\n      (_config$parseValue = config.parseValue) !== null &&\n      _config$parseValue !== void 0\n        ? _config$parseValue\n        : identityFunc;\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.specifiedByURL = config.specifiedByURL;\n    this.serialize =\n      (_config$serialize = config.serialize) !== null &&\n      _config$serialize !== void 0\n        ? _config$serialize\n        : identityFunc;\n    this.parseValue = parseValue;\n    this.parseLiteral =\n      (_config$parseLiteral = config.parseLiteral) !== null &&\n      _config$parseLiteral !== void 0\n        ? _config$parseLiteral\n        : (node, variables) => parseValue(valueFromASTUntyped(node, variables));\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN = config.extensionASTNodes) !== null &&\n      _config$extensionASTN !== void 0\n        ? _config$extensionASTN\n        : [];\n    config.specifiedByURL == null ||\n      typeof config.specifiedByURL === 'string' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"specifiedByURL\" as a string, ` +\n          `but got: ${inspect(config.specifiedByURL)}.`,\n      );\n    config.serialize == null ||\n      typeof config.serialize === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"serialize\" function. If this custom Scalar is also used as an input type, ensure \"parseValue\" and \"parseLiteral\" functions are also provided.`,\n      );\n\n    if (config.parseLiteral) {\n      (typeof config.parseValue === 'function' &&\n        typeof config.parseLiteral === 'function') ||\n        devAssert(\n          false,\n          `${this.name} must provide both \"parseValue\" and \"parseLiteral\" functions.`,\n        );\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLScalarType';\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      specifiedByURL: this.specifiedByURL,\n      serialize: this.serialize,\n      parseValue: this.parseValue,\n      parseLiteral: this.parseLiteral,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Object Type Definition\n *\n * Almost all of the GraphQL types you define will be object types. Object types\n * have a name, but most importantly describe their fields.\n *\n * Example:\n *\n * ```ts\n * const AddressType = new GraphQLObjectType({\n *   name: 'Address',\n *   fields: {\n *     street: { type: GraphQLString },\n *     number: { type: GraphQLInt },\n *     formatted: {\n *       type: GraphQLString,\n *       resolve(obj) {\n *         return obj.number + ' ' + obj.street\n *       }\n *     }\n *   }\n * });\n * ```\n *\n * When two types need to refer to each other, or a type needs to refer to\n * itself in a field, you can use a function expression (aka a closure or a\n * thunk) to supply the fields lazily.\n *\n * Example:\n *\n * ```ts\n * const PersonType = new GraphQLObjectType({\n *   name: 'Person',\n *   fields: () => ({\n *     name: { type: GraphQLString },\n *     bestFriend: { type: PersonType },\n *   })\n * });\n * ```\n */\nexport class GraphQLObjectType {\n  constructor(config) {\n    var _config$extensionASTN2;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.isTypeOf = config.isTypeOf;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN2 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN2 !== void 0\n        ? _config$extensionASTN2\n        : [];\n\n    this._fields = () => defineFieldMap(config);\n\n    this._interfaces = () => defineInterfaces(config);\n\n    config.isTypeOf == null ||\n      typeof config.isTypeOf === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"isTypeOf\" as a function, ` +\n          `but got: ${inspect(config.isTypeOf)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLObjectType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      isTypeOf: this.isTypeOf,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineInterfaces(config) {\n  var _config$interfaces;\n\n  const interfaces = resolveReadonlyArrayThunk(\n    (_config$interfaces = config.interfaces) !== null &&\n      _config$interfaces !== void 0\n      ? _config$interfaces\n      : [],\n  );\n  Array.isArray(interfaces) ||\n    devAssert(\n      false,\n      `${config.name} interfaces must be an Array or a function which returns an Array.`,\n    );\n  return interfaces;\n}\n\nfunction defineFieldMap(config) {\n  const fieldMap = resolveObjMapThunk(config.fields);\n  isPlainObj(fieldMap) ||\n    devAssert(\n      false,\n      `${config.name} fields must be an object with field names as keys or a function which returns such an object.`,\n    );\n  return mapValue(fieldMap, (fieldConfig, fieldName) => {\n    var _fieldConfig$args;\n\n    isPlainObj(fieldConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field config must be an object.`,\n      );\n    fieldConfig.resolve == null ||\n      typeof fieldConfig.resolve === 'function' ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field resolver must be a function if ` +\n          `provided, but got: ${inspect(fieldConfig.resolve)}.`,\n      );\n    const argsConfig =\n      (_fieldConfig$args = fieldConfig.args) !== null &&\n      _fieldConfig$args !== void 0\n        ? _fieldConfig$args\n        : {};\n    isPlainObj(argsConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} args must be an object with argument names as keys.`,\n      );\n    return {\n      name: assertName(fieldName),\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      args: defineArguments(argsConfig),\n      resolve: fieldConfig.resolve,\n      subscribe: fieldConfig.subscribe,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode,\n    };\n  });\n}\n\nexport function defineArguments(config) {\n  return Object.entries(config).map(([argName, argConfig]) => ({\n    name: assertName(argName),\n    description: argConfig.description,\n    type: argConfig.type,\n    defaultValue: argConfig.defaultValue,\n    deprecationReason: argConfig.deprecationReason,\n    extensions: toObjMap(argConfig.extensions),\n    astNode: argConfig.astNode,\n  }));\n}\n\nfunction isPlainObj(obj) {\n  return isObjectLike(obj) && !Array.isArray(obj);\n}\n\nfunction fieldsToFieldsConfig(fields) {\n  return mapValue(fields, (field) => ({\n    description: field.description,\n    type: field.type,\n    args: argsToArgsConfig(field.args),\n    resolve: field.resolve,\n    subscribe: field.subscribe,\n    deprecationReason: field.deprecationReason,\n    extensions: field.extensions,\n    astNode: field.astNode,\n  }));\n}\n/**\n * @internal\n */\n\nexport function argsToArgsConfig(args) {\n  return keyValMap(\n    args,\n    (arg) => arg.name,\n    (arg) => ({\n      description: arg.description,\n      type: arg.type,\n      defaultValue: arg.defaultValue,\n      deprecationReason: arg.deprecationReason,\n      extensions: arg.extensions,\n      astNode: arg.astNode,\n    }),\n  );\n}\nexport function isRequiredArgument(arg) {\n  return isNonNullType(arg.type) && arg.defaultValue === undefined;\n}\n\n/**\n * Interface Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Interface type\n * is used to describe what types are possible, what fields are in common across\n * all types, as well as a function to determine which type is actually used\n * when the field is resolved.\n *\n * Example:\n *\n * ```ts\n * const EntityType = new GraphQLInterfaceType({\n *   name: 'Entity',\n *   fields: {\n *     name: { type: GraphQLString }\n *   }\n * });\n * ```\n */\nexport class GraphQLInterfaceType {\n  constructor(config) {\n    var _config$extensionASTN3;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN3 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN3 !== void 0\n        ? _config$extensionASTN3\n        : [];\n    this._fields = defineFieldMap.bind(undefined, config);\n    this._interfaces = defineInterfaces.bind(undefined, config);\n    config.resolveType == null ||\n      typeof config.resolveType === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"resolveType\" as a function, ` +\n          `but got: ${inspect(config.resolveType)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLInterfaceType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  getInterfaces() {\n    if (typeof this._interfaces === 'function') {\n      this._interfaces = this._interfaces();\n    }\n\n    return this._interfaces;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      interfaces: this.getInterfaces(),\n      fields: fieldsToFieldsConfig(this.getFields()),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Union Type Definition\n *\n * When a field can return one of a heterogeneous set of types, a Union type\n * is used to describe what types are possible as well as providing a function\n * to determine which type is actually used when the field is resolved.\n *\n * Example:\n *\n * ```ts\n * const PetType = new GraphQLUnionType({\n *   name: 'Pet',\n *   types: [ DogType, CatType ],\n *   resolveType(value) {\n *     if (value instanceof Dog) {\n *       return DogType;\n *     }\n *     if (value instanceof Cat) {\n *       return CatType;\n *     }\n *   }\n * });\n * ```\n */\nexport class GraphQLUnionType {\n  constructor(config) {\n    var _config$extensionASTN4;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.resolveType = config.resolveType;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN4 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN4 !== void 0\n        ? _config$extensionASTN4\n        : [];\n    this._types = defineTypes.bind(undefined, config);\n    config.resolveType == null ||\n      typeof config.resolveType === 'function' ||\n      devAssert(\n        false,\n        `${this.name} must provide \"resolveType\" as a function, ` +\n          `but got: ${inspect(config.resolveType)}.`,\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLUnionType';\n  }\n\n  getTypes() {\n    if (typeof this._types === 'function') {\n      this._types = this._types();\n    }\n\n    return this._types;\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      types: this.getTypes(),\n      resolveType: this.resolveType,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineTypes(config) {\n  const types = resolveReadonlyArrayThunk(config.types);\n  Array.isArray(types) ||\n    devAssert(\n      false,\n      `Must provide Array of types or a function which returns such an array for Union ${config.name}.`,\n    );\n  return types;\n}\n\n/**\n * Enum Type Definition\n *\n * Some leaf values of requests and input values are Enums. GraphQL serializes\n * Enum values as strings, however internally Enums can be represented by any\n * kind of type, often integers.\n *\n * Example:\n *\n * ```ts\n * const RGBType = new GraphQLEnumType({\n *   name: 'RGB',\n *   values: {\n *     RED: { value: 0 },\n *     GREEN: { value: 1 },\n *     BLUE: { value: 2 }\n *   }\n * });\n * ```\n *\n * Note: If a value is not provided in a definition, the name of the enum value\n * will be used as its internal value.\n */\nexport class GraphQLEnumType {\n  /* <T> */\n  constructor(config) {\n    var _config$extensionASTN5;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN5 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN5 !== void 0\n        ? _config$extensionASTN5\n        : [];\n    this._values =\n      typeof config.values === 'function'\n        ? config.values\n        : defineEnumValues(this.name, config.values);\n    this._valueLookup = null;\n    this._nameLookup = null;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLEnumType';\n  }\n\n  getValues() {\n    if (typeof this._values === 'function') {\n      this._values = defineEnumValues(this.name, this._values());\n    }\n\n    return this._values;\n  }\n\n  getValue(name) {\n    if (this._nameLookup === null) {\n      this._nameLookup = keyMap(this.getValues(), (value) => value.name);\n    }\n\n    return this._nameLookup[name];\n  }\n\n  serialize(outputValue) {\n    if (this._valueLookup === null) {\n      this._valueLookup = new Map(\n        this.getValues().map((enumValue) => [enumValue.value, enumValue]),\n      );\n    }\n\n    const enumValue = this._valueLookup.get(outputValue);\n\n    if (enumValue === undefined) {\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent value: ${inspect(outputValue)}`,\n      );\n    }\n\n    return enumValue.name;\n  }\n\n  parseValue(inputValue) /* T */\n  {\n    if (typeof inputValue !== 'string') {\n      const valueStr = inspect(inputValue);\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent non-string value: ${valueStr}.` +\n          didYouMeanEnumValue(this, valueStr),\n      );\n    }\n\n    const enumValue = this.getValue(inputValue);\n\n    if (enumValue == null) {\n      throw new GraphQLError(\n        `Value \"${inputValue}\" does not exist in \"${this.name}\" enum.` +\n          didYouMeanEnumValue(this, inputValue),\n      );\n    }\n\n    return enumValue.value;\n  }\n\n  parseLiteral(valueNode, _variables) /* T */\n  {\n    // Note: variables will be resolved to a value before calling this function.\n    if (valueNode.kind !== Kind.ENUM) {\n      const valueStr = print(valueNode);\n      throw new GraphQLError(\n        `Enum \"${this.name}\" cannot represent non-enum value: ${valueStr}.` +\n          didYouMeanEnumValue(this, valueStr),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const enumValue = this.getValue(valueNode.value);\n\n    if (enumValue == null) {\n      const valueStr = print(valueNode);\n      throw new GraphQLError(\n        `Value \"${valueStr}\" does not exist in \"${this.name}\" enum.` +\n          didYouMeanEnumValue(this, valueStr),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return enumValue.value;\n  }\n\n  toConfig() {\n    const values = keyValMap(\n      this.getValues(),\n      (value) => value.name,\n      (value) => ({\n        description: value.description,\n        value: value.value,\n        deprecationReason: value.deprecationReason,\n        extensions: value.extensions,\n        astNode: value.astNode,\n      }),\n    );\n    return {\n      name: this.name,\n      description: this.description,\n      values,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction didYouMeanEnumValue(enumType, unknownValueStr) {\n  const allNames = enumType.getValues().map((value) => value.name);\n  const suggestedValues = suggestionList(unknownValueStr, allNames);\n  return didYouMean('the enum value', suggestedValues);\n}\n\nfunction defineEnumValues(typeName, valueMap) {\n  isPlainObj(valueMap) ||\n    devAssert(\n      false,\n      `${typeName} values must be an object with value names as keys.`,\n    );\n  return Object.entries(valueMap).map(([valueName, valueConfig]) => {\n    isPlainObj(valueConfig) ||\n      devAssert(\n        false,\n        `${typeName}.${valueName} must refer to an object with a \"value\" key ` +\n          `representing an internal value but got: ${inspect(valueConfig)}.`,\n      );\n    return {\n      name: assertEnumValueName(valueName),\n      description: valueConfig.description,\n      value: valueConfig.value !== undefined ? valueConfig.value : valueName,\n      deprecationReason: valueConfig.deprecationReason,\n      extensions: toObjMap(valueConfig.extensions),\n      astNode: valueConfig.astNode,\n    };\n  });\n}\n\n/**\n * Input Object Type Definition\n *\n * An input object defines a structured collection of fields which may be\n * supplied to a field argument.\n *\n * Using `NonNull` will ensure that a value must be provided by the query\n *\n * Example:\n *\n * ```ts\n * const GeoPoint = new GraphQLInputObjectType({\n *   name: 'GeoPoint',\n *   fields: {\n *     lat: { type: new GraphQLNonNull(GraphQLFloat) },\n *     lon: { type: new GraphQLNonNull(GraphQLFloat) },\n *     alt: { type: GraphQLFloat, defaultValue: 0 },\n *   }\n * });\n * ```\n */\nexport class GraphQLInputObjectType {\n  constructor(config) {\n    var _config$extensionASTN6, _config$isOneOf;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN6 = config.extensionASTNodes) !== null &&\n      _config$extensionASTN6 !== void 0\n        ? _config$extensionASTN6\n        : [];\n    this.isOneOf =\n      (_config$isOneOf = config.isOneOf) !== null && _config$isOneOf !== void 0\n        ? _config$isOneOf\n        : false;\n    this._fields = defineInputFieldMap.bind(undefined, config);\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLInputObjectType';\n  }\n\n  getFields() {\n    if (typeof this._fields === 'function') {\n      this._fields = this._fields();\n    }\n\n    return this._fields;\n  }\n\n  toConfig() {\n    const fields = mapValue(this.getFields(), (field) => ({\n      description: field.description,\n      type: field.type,\n      defaultValue: field.defaultValue,\n      deprecationReason: field.deprecationReason,\n      extensions: field.extensions,\n      astNode: field.astNode,\n    }));\n    return {\n      name: this.name,\n      description: this.description,\n      fields,\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n      isOneOf: this.isOneOf,\n    };\n  }\n\n  toString() {\n    return this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\nfunction defineInputFieldMap(config) {\n  const fieldMap = resolveObjMapThunk(config.fields);\n  isPlainObj(fieldMap) ||\n    devAssert(\n      false,\n      `${config.name} fields must be an object with field names as keys or a function which returns such an object.`,\n    );\n  return mapValue(fieldMap, (fieldConfig, fieldName) => {\n    !('resolve' in fieldConfig) ||\n      devAssert(\n        false,\n        `${config.name}.${fieldName} field has a resolve property, but Input Types cannot define resolvers.`,\n      );\n    return {\n      name: assertName(fieldName),\n      description: fieldConfig.description,\n      type: fieldConfig.type,\n      defaultValue: fieldConfig.defaultValue,\n      deprecationReason: fieldConfig.deprecationReason,\n      extensions: toObjMap(fieldConfig.extensions),\n      astNode: fieldConfig.astNode,\n    };\n  });\n}\n\nexport function isRequiredInputField(field) {\n  return isNonNullType(field.type) && field.defaultValue === undefined;\n}\n","import {\n  isAbstractType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n} from '../type/definition.mjs';\n\n/**\n * Provided two types, return true if the types are equal (invariant).\n */\nexport function isEqualType(typeA, typeB) {\n  // Equivalent types are equal.\n  if (typeA === typeB) {\n    return true;\n  } // If either type is non-null, the other must also be non-null.\n\n  if (isNonNullType(typeA) && isNonNullType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // If either type is a list, the other must also be a list.\n\n  if (isListType(typeA) && isListType(typeB)) {\n    return isEqualType(typeA.ofType, typeB.ofType);\n  } // Otherwise the types are not equal.\n\n  return false;\n}\n/**\n * Provided a type and a super type, return true if the first type is either\n * equal or a subset of the second super type (covariant).\n */\n\nexport function isTypeSubTypeOf(schema, maybeSubType, superType) {\n  // Equivalent type is a valid subtype\n  if (maybeSubType === superType) {\n    return true;\n  } // If superType is non-null, maybeSubType must also be non-null.\n\n  if (isNonNullType(superType)) {\n    if (isNonNullType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isNonNullType(maybeSubType)) {\n    // If superType is nullable, maybeSubType may be non-null or nullable.\n    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);\n  } // If superType type is a list, maybeSubType type must also be a list.\n\n  if (isListType(superType)) {\n    if (isListType(maybeSubType)) {\n      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);\n    }\n\n    return false;\n  }\n\n  if (isListType(maybeSubType)) {\n    // If superType is not a list, maybeSubType must also be not a list.\n    return false;\n  } // If superType type is an abstract type, check if it is super type of maybeSubType.\n  // Otherwise, the child type is not a valid subtype of the parent type.\n\n  return (\n    isAbstractType(superType) &&\n    (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) &&\n    schema.isSubType(superType, maybeSubType)\n  );\n}\n/**\n * Provided two composite types, determine if they \"overlap\". Two composite\n * types overlap when the Sets of possible concrete types for each intersect.\n *\n * This is often used to determine if a fragment of a given type could possibly\n * be visited in a context of another type.\n *\n * This function is commutative.\n */\n\nexport function doTypesOverlap(schema, typeA, typeB) {\n  // Equivalent types overlap\n  if (typeA === typeB) {\n    return true;\n  }\n\n  if (isAbstractType(typeA)) {\n    if (isAbstractType(typeB)) {\n      // If both types are abstract, then determine if there is any intersection\n      // between possible concrete types of each.\n      return schema\n        .getPossibleTypes(typeA)\n        .some((type) => schema.isSubType(typeB, type));\n    } // Determine if the latter type is a possible concrete type of the former.\n\n    return schema.isSubType(typeA, typeB);\n  }\n\n  if (isAbstractType(typeB)) {\n    // Determine if the former type is a possible concrete type of the latter.\n    return schema.isSubType(typeB, typeA);\n  } // Otherwise the types do not overlap.\n\n  return false;\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { GraphQLScalarType } from './definition.mjs';\n/**\n * Maximum possible Int value as per GraphQL Spec (32-bit signed integer).\n * n.b. This differs from JavaScript's numbers that are IEEE 754 doubles safe up-to 2^53 - 1\n * */\n\nexport const GRAPHQL_MAX_INT = 2147483647;\n/**\n * Minimum possible Int value as per GraphQL Spec (32-bit signed integer).\n * n.b. This differs from JavaScript's numbers that are IEEE 754 doubles safe starting at -(2^53 - 1)\n * */\n\nexport const GRAPHQL_MIN_INT = -2147483648;\nexport const GraphQLInt = new GraphQLScalarType({\n  name: 'Int',\n  description:\n    'The `Int` scalar type represents non-fractional signed whole numeric values. Int can represent values between -(2^31) and 2^31 - 1.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 1 : 0;\n    }\n\n    let num = coercedValue;\n\n    if (typeof coercedValue === 'string' && coercedValue !== '') {\n      num = Number(coercedValue);\n    }\n\n    if (typeof num !== 'number' || !Number.isInteger(num)) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${inspect(coercedValue)}`,\n      );\n    }\n\n    if (num > GRAPHQL_MAX_INT || num < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        'Int cannot represent non 32-bit signed integer value: ' +\n          inspect(coercedValue),\n      );\n    }\n\n    return num;\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'number' || !Number.isInteger(inputValue)) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${inspect(inputValue)}`,\n      );\n    }\n\n    if (inputValue > GRAPHQL_MAX_INT || inputValue < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        `Int cannot represent non 32-bit signed integer value: ${inputValue}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        `Int cannot represent non-integer value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const num = parseInt(valueNode.value, 10);\n\n    if (num > GRAPHQL_MAX_INT || num < GRAPHQL_MIN_INT) {\n      throw new GraphQLError(\n        `Int cannot represent non 32-bit signed integer value: ${valueNode.value}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return num;\n  },\n});\nexport const GraphQLFloat = new GraphQLScalarType({\n  name: 'Float',\n  description:\n    'The `Float` scalar type represents signed double-precision fractional values as specified by [IEEE 754](https://en.wikipedia.org/wiki/IEEE_floating_point).',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 1 : 0;\n    }\n\n    let num = coercedValue;\n\n    if (typeof coercedValue === 'string' && coercedValue !== '') {\n      num = Number(coercedValue);\n    }\n\n    if (typeof num !== 'number' || !Number.isFinite(num)) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${inspect(coercedValue)}`,\n      );\n    }\n\n    return num;\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'number' || !Number.isFinite(inputValue)) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.FLOAT && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        `Float cannot represent non numeric value: ${print(valueNode)}`,\n        valueNode,\n      );\n    }\n\n    return parseFloat(valueNode.value);\n  },\n});\nexport const GraphQLString = new GraphQLScalarType({\n  name: 'String',\n  description:\n    'The `String` scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue); // Serialize string, boolean and number values to a string, but do not\n    // attempt to coerce object, function, symbol, or other types as strings.\n\n    if (typeof coercedValue === 'string') {\n      return coercedValue;\n    }\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue ? 'true' : 'false';\n    }\n\n    if (typeof coercedValue === 'number' && Number.isFinite(coercedValue)) {\n      return coercedValue.toString();\n    }\n\n    throw new GraphQLError(\n      `String cannot represent value: ${inspect(outputValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'string') {\n      throw new GraphQLError(\n        `String cannot represent a non string value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING) {\n      throw new GraphQLError(\n        `String cannot represent a non string value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const GraphQLBoolean = new GraphQLScalarType({\n  name: 'Boolean',\n  description: 'The `Boolean` scalar type represents `true` or `false`.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'boolean') {\n      return coercedValue;\n    }\n\n    if (Number.isFinite(coercedValue)) {\n      return coercedValue !== 0;\n    }\n\n    throw new GraphQLError(\n      `Boolean cannot represent a non boolean value: ${inspect(coercedValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue !== 'boolean') {\n      throw new GraphQLError(\n        `Boolean cannot represent a non boolean value: ${inspect(inputValue)}`,\n      );\n    }\n\n    return inputValue;\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.BOOLEAN) {\n      throw new GraphQLError(\n        `Boolean cannot represent a non boolean value: ${print(valueNode)}`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const GraphQLID = new GraphQLScalarType({\n  name: 'ID',\n  description:\n    'The `ID` scalar type represents a unique identifier, often used to refetch an object or as key for a cache. The ID type appears in a JSON response as a String; however, it is not intended to be human-readable. When expected as an input type, any string (such as `\"4\"`) or integer (such as `4`) input value will be accepted as an ID.',\n\n  serialize(outputValue) {\n    const coercedValue = serializeObject(outputValue);\n\n    if (typeof coercedValue === 'string') {\n      return coercedValue;\n    }\n\n    if (Number.isInteger(coercedValue)) {\n      return String(coercedValue);\n    }\n\n    throw new GraphQLError(\n      `ID cannot represent value: ${inspect(outputValue)}`,\n    );\n  },\n\n  parseValue(inputValue) {\n    if (typeof inputValue === 'string') {\n      return inputValue;\n    }\n\n    if (typeof inputValue === 'number' && Number.isInteger(inputValue)) {\n      return inputValue.toString();\n    }\n\n    throw new GraphQLError(`ID cannot represent value: ${inspect(inputValue)}`);\n  },\n\n  parseLiteral(valueNode) {\n    if (valueNode.kind !== Kind.STRING && valueNode.kind !== Kind.INT) {\n      throw new GraphQLError(\n        'ID cannot represent a non-string and non-integer value: ' +\n          print(valueNode),\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    return valueNode.value;\n  },\n});\nexport const specifiedScalarTypes = Object.freeze([\n  GraphQLString,\n  GraphQLInt,\n  GraphQLFloat,\n  GraphQLBoolean,\n  GraphQLID,\n]);\nexport function isSpecifiedScalarType(type) {\n  return specifiedScalarTypes.some(({ name }) => type.name === name);\n} // Support serializing objects with custom valueOf() or toJSON() functions -\n// a common way to represent a complex value which can be represented as\n// a string (ex: MongoDB id objects).\n\nfunction serializeObject(outputValue) {\n  if (isObjectLike(outputValue)) {\n    if (typeof outputValue.valueOf === 'function') {\n      const valueOfResult = outputValue.valueOf();\n\n      if (!isObjectLike(valueOfResult)) {\n        return valueOfResult;\n      }\n    }\n\n    if (typeof outputValue.toJSON === 'function') {\n      return outputValue.toJSON();\n    }\n  }\n\n  return outputValue;\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { DirectiveLocation } from '../language/directiveLocation.mjs';\nimport { assertName } from './assertName.mjs';\nimport {\n  argsToArgsConfig,\n  defineArguments,\n  GraphQLNonNull,\n} from './definition.mjs';\nimport { GraphQLBoolean, GraphQLString } from './scalars.mjs';\n/**\n * Test if the given value is a GraphQL directive.\n */\n\nexport function isDirective(directive) {\n  return instanceOf(directive, GraphQLDirective);\n}\nexport function assertDirective(directive) {\n  if (!isDirective(directive)) {\n    throw new Error(\n      `Expected ${inspect(directive)} to be a GraphQL directive.`,\n    );\n  }\n\n  return directive;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Directives are used by the GraphQL runtime as a way of modifying execution\n * behavior. Type system creators will usually not create these directly.\n */\nexport class GraphQLDirective {\n  constructor(config) {\n    var _config$isRepeatable, _config$args;\n\n    this.name = assertName(config.name);\n    this.description = config.description;\n    this.locations = config.locations;\n    this.isRepeatable =\n      (_config$isRepeatable = config.isRepeatable) !== null &&\n      _config$isRepeatable !== void 0\n        ? _config$isRepeatable\n        : false;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    Array.isArray(config.locations) ||\n      devAssert(false, `@${config.name} locations must be an Array.`);\n    const args =\n      (_config$args = config.args) !== null && _config$args !== void 0\n        ? _config$args\n        : {};\n    (isObjectLike(args) && !Array.isArray(args)) ||\n      devAssert(\n        false,\n        `@${config.name} args must be an object with argument names as keys.`,\n      );\n    this.args = defineArguments(args);\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLDirective';\n  }\n\n  toConfig() {\n    return {\n      name: this.name,\n      description: this.description,\n      locations: this.locations,\n      args: argsToArgsConfig(this.args),\n      isRepeatable: this.isRepeatable,\n      extensions: this.extensions,\n      astNode: this.astNode,\n    };\n  }\n\n  toString() {\n    return '@' + this.name;\n  }\n\n  toJSON() {\n    return this.toString();\n  }\n}\n\n/**\n * Used to conditionally include fields or fragments.\n */\nexport const GraphQLIncludeDirective = new GraphQLDirective({\n  name: 'include',\n  description:\n    'Directs the executor to include this field or fragment only when the `if` argument is true.',\n  locations: [\n    DirectiveLocation.FIELD,\n    DirectiveLocation.FRAGMENT_SPREAD,\n    DirectiveLocation.INLINE_FRAGMENT,\n  ],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Included when true.',\n    },\n  },\n});\n/**\n * Used to conditionally skip (exclude) fields or fragments.\n */\n\nexport const GraphQLSkipDirective = new GraphQLDirective({\n  name: 'skip',\n  description:\n    'Directs the executor to skip this field or fragment when the `if` argument is true.',\n  locations: [\n    DirectiveLocation.FIELD,\n    DirectiveLocation.FRAGMENT_SPREAD,\n    DirectiveLocation.INLINE_FRAGMENT,\n  ],\n  args: {\n    if: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      description: 'Skipped when true.',\n    },\n  },\n});\n/**\n * Constant string used for default reason for a deprecation.\n */\n\nexport const DEFAULT_DEPRECATION_REASON = 'No longer supported';\n/**\n * Used to declare element of a GraphQL schema as deprecated.\n */\n\nexport const GraphQLDeprecatedDirective = new GraphQLDirective({\n  name: 'deprecated',\n  description: 'Marks an element of a GraphQL schema as no longer supported.',\n  locations: [\n    DirectiveLocation.FIELD_DEFINITION,\n    DirectiveLocation.ARGUMENT_DEFINITION,\n    DirectiveLocation.INPUT_FIELD_DEFINITION,\n    DirectiveLocation.ENUM_VALUE,\n  ],\n  args: {\n    reason: {\n      type: GraphQLString,\n      description:\n        'Explains why this element was deprecated, usually also including a suggestion for how to access supported similar data. Formatted using the Markdown syntax, as specified by [CommonMark](https://commonmark.org/).',\n      defaultValue: DEFAULT_DEPRECATION_REASON,\n    },\n  },\n});\n/**\n * Used to provide a URL for specifying the behavior of custom scalar definitions.\n */\n\nexport const GraphQLSpecifiedByDirective = new GraphQLDirective({\n  name: 'specifiedBy',\n  description: 'Exposes a URL that specifies the behavior of this scalar.',\n  locations: [DirectiveLocation.SCALAR],\n  args: {\n    url: {\n      type: new GraphQLNonNull(GraphQLString),\n      description: 'The URL that specifies the behavior of this scalar.',\n    },\n  },\n});\n/**\n * Used to indicate an Input Object is a OneOf Input Object.\n */\n\nexport const GraphQLOneOfDirective = new GraphQLDirective({\n  name: 'oneOf',\n  description:\n    'Indicates exactly one field must be supplied and this field must not be `null`.',\n  locations: [DirectiveLocation.INPUT_OBJECT],\n  args: {},\n});\n/**\n * The full list of specified directives.\n */\n\nexport const specifiedDirectives = Object.freeze([\n  GraphQLIncludeDirective,\n  GraphQLSkipDirective,\n  GraphQLDeprecatedDirective,\n  GraphQLSpecifiedByDirective,\n  GraphQLOneOfDirective,\n]);\nexport function isSpecifiedDirective(directive) {\n  return specifiedDirectives.some(({ name }) => name === directive.name);\n}\n","/**\n * Returns true if the provided object is an Object (i.e. not a string literal)\n * and implements the Iterator protocol.\n *\n * This may be used in place of [Array.isArray()][isArray] to determine if\n * an object should be iterated-over e.g. Array, Map, Set, Int8Array,\n * TypedArray, etc. but excludes string literals.\n *\n * @example\n * ```ts\n * isIterableObject([ 1, 2, 3 ]) // true\n * isIterableObject(new Map()) // true\n * isIterableObject('ABC') // false\n * isIterableObject({ key: 'value' }) // false\n * isIterableObject({ length: 1, 0: 'Alpha' }) // false\n * ```\n */\nexport function isIterableObject(maybeIterable) {\n  return (\n    typeof maybeIterable === 'object' &&\n    typeof (maybeIterable === null || maybeIterable === void 0\n      ? void 0\n      : maybeIterable[Symbol.iterator]) === 'function'\n  );\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isIterableObject } from '../jsutils/isIterableObject.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\nimport { GraphQLID } from '../type/scalars.mjs';\n/**\n * Produces a GraphQL Value AST given a JavaScript object.\n * Function will match JavaScript/JSON values to GraphQL AST schema format\n * by using suggested GraphQLInputType. For example:\n *\n *     astFromValue(\"value\", GraphQLString)\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * JavaScript values.\n *\n * | JSON Value    | GraphQL Value        |\n * | ------------- | -------------------- |\n * | Object        | Input Object         |\n * | Array         | List                 |\n * | Boolean       | Boolean              |\n * | String        | String / Enum Value  |\n * | Number        | Int / Float          |\n * | Unknown       | Enum Value           |\n * | null          | NullValue            |\n *\n */\n\nexport function astFromValue(value, type) {\n  if (isNonNullType(type)) {\n    const astValue = astFromValue(value, type.ofType);\n\n    if (\n      (astValue === null || astValue === void 0 ? void 0 : astValue.kind) ===\n      Kind.NULL\n    ) {\n      return null;\n    }\n\n    return astValue;\n  } // only explicit null, not undefined, NaN\n\n  if (value === null) {\n    return {\n      kind: Kind.NULL,\n    };\n  } // undefined\n\n  if (value === undefined) {\n    return null;\n  } // Convert JavaScript array to GraphQL list. If the GraphQLType is a list, but\n  // the value is not an array, convert the value using the list's item type.\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (isIterableObject(value)) {\n      const valuesNodes = [];\n\n      for (const item of value) {\n        const itemNode = astFromValue(item, itemType);\n\n        if (itemNode != null) {\n          valuesNodes.push(itemNode);\n        }\n      }\n\n      return {\n        kind: Kind.LIST,\n        values: valuesNodes,\n      };\n    }\n\n    return astFromValue(value, itemType);\n  } // Populate the fields of the input object by creating ASTs from each value\n  // in the JavaScript object according to the fields in the input type.\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(value)) {\n      return null;\n    }\n\n    const fieldNodes = [];\n\n    for (const field of Object.values(type.getFields())) {\n      const fieldValue = astFromValue(value[field.name], field.type);\n\n      if (fieldValue) {\n        fieldNodes.push({\n          kind: Kind.OBJECT_FIELD,\n          name: {\n            kind: Kind.NAME,\n            value: field.name,\n          },\n          value: fieldValue,\n        });\n      }\n    }\n\n    return {\n      kind: Kind.OBJECT,\n      fields: fieldNodes,\n    };\n  }\n\n  if (isLeafType(type)) {\n    // Since value is an internally represented value, it must be serialized\n    // to an externally represented value before converting into an AST.\n    const serialized = type.serialize(value);\n\n    if (serialized == null) {\n      return null;\n    } // Others serialize based on their corresponding JavaScript scalar types.\n\n    if (typeof serialized === 'boolean') {\n      return {\n        kind: Kind.BOOLEAN,\n        value: serialized,\n      };\n    } // JavaScript numbers can be Int or Float values.\n\n    if (typeof serialized === 'number' && Number.isFinite(serialized)) {\n      const stringNum = String(serialized);\n      return integerStringRegExp.test(stringNum)\n        ? {\n            kind: Kind.INT,\n            value: stringNum,\n          }\n        : {\n            kind: Kind.FLOAT,\n            value: stringNum,\n          };\n    }\n\n    if (typeof serialized === 'string') {\n      // Enum types use Enum literals.\n      if (isEnumType(type)) {\n        return {\n          kind: Kind.ENUM,\n          value: serialized,\n        };\n      } // ID types can use Int literals.\n\n      if (type === GraphQLID && integerStringRegExp.test(serialized)) {\n        return {\n          kind: Kind.INT,\n          value: serialized,\n        };\n      }\n\n      return {\n        kind: Kind.STRING,\n        value: serialized,\n      };\n    }\n\n    throw new TypeError(`Cannot convert value to AST: ${inspect(serialized)}.`);\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n}\n/**\n * IntValue:\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit ( Digit+ )?\n */\n\nconst integerStringRegExp = /^-?(?:0|[1-9][0-9]*)$/;\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { DirectiveLocation } from '../language/directiveLocation.mjs';\nimport { print } from '../language/printer.mjs';\nimport { astFromValue } from '../utilities/astFromValue.mjs';\nimport {\n  GraphQLEnumType,\n  GraphQLList,\n  GraphQLNonNull,\n  GraphQLObjectType,\n  isAbstractType,\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from './definition.mjs';\nimport { GraphQLBoolean, GraphQLString } from './scalars.mjs';\nexport const __Schema = new GraphQLObjectType({\n  name: '__Schema',\n  description:\n    'A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.',\n  fields: () => ({\n    description: {\n      type: GraphQLString,\n      resolve: (schema) => schema.description,\n    },\n    types: {\n      description: 'A list of all types supported by this server.',\n      type: new GraphQLNonNull(new GraphQLList(new GraphQLNonNull(__Type))),\n\n      resolve(schema) {\n        return Object.values(schema.getTypeMap());\n      },\n    },\n    queryType: {\n      description: 'The type that query operations will be rooted at.',\n      type: new GraphQLNonNull(__Type),\n      resolve: (schema) => schema.getQueryType(),\n    },\n    mutationType: {\n      description:\n        'If this server supports mutation, the type that mutation operations will be rooted at.',\n      type: __Type,\n      resolve: (schema) => schema.getMutationType(),\n    },\n    subscriptionType: {\n      description:\n        'If this server support subscription, the type that subscription operations will be rooted at.',\n      type: __Type,\n      resolve: (schema) => schema.getSubscriptionType(),\n    },\n    directives: {\n      description: 'A list of all directives supported by this server.',\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__Directive)),\n      ),\n      resolve: (schema) => schema.getDirectives(),\n    },\n  }),\n});\nexport const __Directive = new GraphQLObjectType({\n  name: '__Directive',\n  description:\n    \"A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\\n\\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.\",\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (directive) => directive.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (directive) => directive.description,\n    },\n    isRepeatable: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (directive) => directive.isRepeatable,\n    },\n    locations: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__DirectiveLocation)),\n      ),\n      resolve: (directive) => directive.locations,\n    },\n    args: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__InputValue)),\n      ),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(field, { includeDeprecated }) {\n        return includeDeprecated\n          ? field.args\n          : field.args.filter((arg) => arg.deprecationReason == null);\n      },\n    },\n  }),\n});\nexport const __DirectiveLocation = new GraphQLEnumType({\n  name: '__DirectiveLocation',\n  description:\n    'A Directive can be adjacent to many parts of the GraphQL language, a __DirectiveLocation describes one such possible adjacencies.',\n  values: {\n    QUERY: {\n      value: DirectiveLocation.QUERY,\n      description: 'Location adjacent to a query operation.',\n    },\n    MUTATION: {\n      value: DirectiveLocation.MUTATION,\n      description: 'Location adjacent to a mutation operation.',\n    },\n    SUBSCRIPTION: {\n      value: DirectiveLocation.SUBSCRIPTION,\n      description: 'Location adjacent to a subscription operation.',\n    },\n    FIELD: {\n      value: DirectiveLocation.FIELD,\n      description: 'Location adjacent to a field.',\n    },\n    FRAGMENT_DEFINITION: {\n      value: DirectiveLocation.FRAGMENT_DEFINITION,\n      description: 'Location adjacent to a fragment definition.',\n    },\n    FRAGMENT_SPREAD: {\n      value: DirectiveLocation.FRAGMENT_SPREAD,\n      description: 'Location adjacent to a fragment spread.',\n    },\n    INLINE_FRAGMENT: {\n      value: DirectiveLocation.INLINE_FRAGMENT,\n      description: 'Location adjacent to an inline fragment.',\n    },\n    VARIABLE_DEFINITION: {\n      value: DirectiveLocation.VARIABLE_DEFINITION,\n      description: 'Location adjacent to a variable definition.',\n    },\n    SCHEMA: {\n      value: DirectiveLocation.SCHEMA,\n      description: 'Location adjacent to a schema definition.',\n    },\n    SCALAR: {\n      value: DirectiveLocation.SCALAR,\n      description: 'Location adjacent to a scalar definition.',\n    },\n    OBJECT: {\n      value: DirectiveLocation.OBJECT,\n      description: 'Location adjacent to an object type definition.',\n    },\n    FIELD_DEFINITION: {\n      value: DirectiveLocation.FIELD_DEFINITION,\n      description: 'Location adjacent to a field definition.',\n    },\n    ARGUMENT_DEFINITION: {\n      value: DirectiveLocation.ARGUMENT_DEFINITION,\n      description: 'Location adjacent to an argument definition.',\n    },\n    INTERFACE: {\n      value: DirectiveLocation.INTERFACE,\n      description: 'Location adjacent to an interface definition.',\n    },\n    UNION: {\n      value: DirectiveLocation.UNION,\n      description: 'Location adjacent to a union definition.',\n    },\n    ENUM: {\n      value: DirectiveLocation.ENUM,\n      description: 'Location adjacent to an enum definition.',\n    },\n    ENUM_VALUE: {\n      value: DirectiveLocation.ENUM_VALUE,\n      description: 'Location adjacent to an enum value definition.',\n    },\n    INPUT_OBJECT: {\n      value: DirectiveLocation.INPUT_OBJECT,\n      description: 'Location adjacent to an input object type definition.',\n    },\n    INPUT_FIELD_DEFINITION: {\n      value: DirectiveLocation.INPUT_FIELD_DEFINITION,\n      description: 'Location adjacent to an input object field definition.',\n    },\n  },\n});\nexport const __Type = new GraphQLObjectType({\n  name: '__Type',\n  description:\n    'The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\\n\\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name, description and optional `specifiedByURL`, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.',\n  fields: () => ({\n    kind: {\n      type: new GraphQLNonNull(__TypeKind),\n\n      resolve(type) {\n        if (isScalarType(type)) {\n          return TypeKind.SCALAR;\n        }\n\n        if (isObjectType(type)) {\n          return TypeKind.OBJECT;\n        }\n\n        if (isInterfaceType(type)) {\n          return TypeKind.INTERFACE;\n        }\n\n        if (isUnionType(type)) {\n          return TypeKind.UNION;\n        }\n\n        if (isEnumType(type)) {\n          return TypeKind.ENUM;\n        }\n\n        if (isInputObjectType(type)) {\n          return TypeKind.INPUT_OBJECT;\n        }\n\n        if (isListType(type)) {\n          return TypeKind.LIST;\n        }\n\n        if (isNonNullType(type)) {\n          return TypeKind.NON_NULL;\n        }\n        /* c8 ignore next 3 */\n        // Not reachable, all possible types have been considered)\n\n        false || invariant(false, `Unexpected type: \"${inspect(type)}\".`);\n      },\n    },\n    name: {\n      type: GraphQLString,\n      resolve: (type) => ('name' in type ? type.name : undefined),\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (\n        type, // FIXME: add test case\n      ) =>\n        /* c8 ignore next */\n        'description' in type ? type.description : undefined,\n    },\n    specifiedByURL: {\n      type: GraphQLString,\n      resolve: (obj) =>\n        'specifiedByURL' in obj ? obj.specifiedByURL : undefined,\n    },\n    fields: {\n      type: new GraphQLList(new GraphQLNonNull(__Field)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isObjectType(type) || isInterfaceType(type)) {\n          const fields = Object.values(type.getFields());\n          return includeDeprecated\n            ? fields\n            : fields.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    interfaces: {\n      type: new GraphQLList(new GraphQLNonNull(__Type)),\n\n      resolve(type) {\n        if (isObjectType(type) || isInterfaceType(type)) {\n          return type.getInterfaces();\n        }\n      },\n    },\n    possibleTypes: {\n      type: new GraphQLList(new GraphQLNonNull(__Type)),\n\n      resolve(type, _args, _context, { schema }) {\n        if (isAbstractType(type)) {\n          return schema.getPossibleTypes(type);\n        }\n      },\n    },\n    enumValues: {\n      type: new GraphQLList(new GraphQLNonNull(__EnumValue)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isEnumType(type)) {\n          const values = type.getValues();\n          return includeDeprecated\n            ? values\n            : values.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    inputFields: {\n      type: new GraphQLList(new GraphQLNonNull(__InputValue)),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(type, { includeDeprecated }) {\n        if (isInputObjectType(type)) {\n          const values = Object.values(type.getFields());\n          return includeDeprecated\n            ? values\n            : values.filter((field) => field.deprecationReason == null);\n        }\n      },\n    },\n    ofType: {\n      type: __Type,\n      resolve: (type) => ('ofType' in type ? type.ofType : undefined),\n    },\n    isOneOf: {\n      type: GraphQLBoolean,\n      resolve: (type) => {\n        if (isInputObjectType(type)) {\n          return type.isOneOf;\n        }\n      },\n    },\n  }),\n});\nexport const __Field = new GraphQLObjectType({\n  name: '__Field',\n  description:\n    'Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (field) => field.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (field) => field.description,\n    },\n    args: {\n      type: new GraphQLNonNull(\n        new GraphQLList(new GraphQLNonNull(__InputValue)),\n      ),\n      args: {\n        includeDeprecated: {\n          type: GraphQLBoolean,\n          defaultValue: false,\n        },\n      },\n\n      resolve(field, { includeDeprecated }) {\n        return includeDeprecated\n          ? field.args\n          : field.args.filter((arg) => arg.deprecationReason == null);\n      },\n    },\n    type: {\n      type: new GraphQLNonNull(__Type),\n      resolve: (field) => field.type,\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (field) => field.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (field) => field.deprecationReason,\n    },\n  }),\n});\nexport const __InputValue = new GraphQLObjectType({\n  name: '__InputValue',\n  description:\n    'Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (inputValue) => inputValue.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (inputValue) => inputValue.description,\n    },\n    type: {\n      type: new GraphQLNonNull(__Type),\n      resolve: (inputValue) => inputValue.type,\n    },\n    defaultValue: {\n      type: GraphQLString,\n      description:\n        'A GraphQL-formatted string representing the default value for this input value.',\n\n      resolve(inputValue) {\n        const { type, defaultValue } = inputValue;\n        const valueAST = astFromValue(defaultValue, type);\n        return valueAST ? print(valueAST) : null;\n      },\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (field) => field.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (obj) => obj.deprecationReason,\n    },\n  }),\n});\nexport const __EnumValue = new GraphQLObjectType({\n  name: '__EnumValue',\n  description:\n    'One possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.',\n  fields: () => ({\n    name: {\n      type: new GraphQLNonNull(GraphQLString),\n      resolve: (enumValue) => enumValue.name,\n    },\n    description: {\n      type: GraphQLString,\n      resolve: (enumValue) => enumValue.description,\n    },\n    isDeprecated: {\n      type: new GraphQLNonNull(GraphQLBoolean),\n      resolve: (enumValue) => enumValue.deprecationReason != null,\n    },\n    deprecationReason: {\n      type: GraphQLString,\n      resolve: (enumValue) => enumValue.deprecationReason,\n    },\n  }),\n});\nvar TypeKind;\n\n(function (TypeKind) {\n  TypeKind['SCALAR'] = 'SCALAR';\n  TypeKind['OBJECT'] = 'OBJECT';\n  TypeKind['INTERFACE'] = 'INTERFACE';\n  TypeKind['UNION'] = 'UNION';\n  TypeKind['ENUM'] = 'ENUM';\n  TypeKind['INPUT_OBJECT'] = 'INPUT_OBJECT';\n  TypeKind['LIST'] = 'LIST';\n  TypeKind['NON_NULL'] = 'NON_NULL';\n})(TypeKind || (TypeKind = {}));\n\nexport { TypeKind };\nexport const __TypeKind = new GraphQLEnumType({\n  name: '__TypeKind',\n  description: 'An enum describing what kind of type a given `__Type` is.',\n  values: {\n    SCALAR: {\n      value: TypeKind.SCALAR,\n      description: 'Indicates this type is a scalar.',\n    },\n    OBJECT: {\n      value: TypeKind.OBJECT,\n      description:\n        'Indicates this type is an object. `fields` and `interfaces` are valid fields.',\n    },\n    INTERFACE: {\n      value: TypeKind.INTERFACE,\n      description:\n        'Indicates this type is an interface. `fields`, `interfaces`, and `possibleTypes` are valid fields.',\n    },\n    UNION: {\n      value: TypeKind.UNION,\n      description:\n        'Indicates this type is a union. `possibleTypes` is a valid field.',\n    },\n    ENUM: {\n      value: TypeKind.ENUM,\n      description:\n        'Indicates this type is an enum. `enumValues` is a valid field.',\n    },\n    INPUT_OBJECT: {\n      value: TypeKind.INPUT_OBJECT,\n      description:\n        'Indicates this type is an input object. `inputFields` is a valid field.',\n    },\n    LIST: {\n      value: TypeKind.LIST,\n      description: 'Indicates this type is a list. `ofType` is a valid field.',\n    },\n    NON_NULL: {\n      value: TypeKind.NON_NULL,\n      description:\n        'Indicates this type is a non-null. `ofType` is a valid field.',\n    },\n  },\n});\n/**\n * Note that these are GraphQLField and not GraphQLFieldConfig,\n * so the format for args is different.\n */\n\nexport const SchemaMetaFieldDef = {\n  name: '__schema',\n  type: new GraphQLNonNull(__Schema),\n  description: 'Access the current type schema of this server.',\n  args: [],\n  resolve: (_source, _args, _context, { schema }) => schema,\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const TypeMetaFieldDef = {\n  name: '__type',\n  type: __Type,\n  description: 'Request the type information of a single type.',\n  args: [\n    {\n      name: 'name',\n      description: undefined,\n      type: new GraphQLNonNull(GraphQLString),\n      defaultValue: undefined,\n      deprecationReason: undefined,\n      extensions: Object.create(null),\n      astNode: undefined,\n    },\n  ],\n  resolve: (_source, { name }, _context, { schema }) => schema.getType(name),\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const TypeNameMetaFieldDef = {\n  name: '__typename',\n  type: new GraphQLNonNull(GraphQLString),\n  description: 'The name of the current Object type at runtime.',\n  args: [],\n  resolve: (_source, _args, _context, { parentType }) => parentType.name,\n  deprecationReason: undefined,\n  extensions: Object.create(null),\n  astNode: undefined,\n};\nexport const introspectionTypes = Object.freeze([\n  __Schema,\n  __Directive,\n  __DirectiveLocation,\n  __Type,\n  __Field,\n  __InputValue,\n  __EnumValue,\n  __TypeKind,\n]);\nexport function isIntrospectionType(type) {\n  return introspectionTypes.some(({ name }) => type.name === name);\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { toObjMap } from '../jsutils/toObjMap.mjs';\nimport { OperationTypeNode } from '../language/ast.mjs';\nimport {\n  getNamedType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isUnionType,\n} from './definition.mjs';\nimport { isDirective, specifiedDirectives } from './directives.mjs';\nimport { __Schema } from './introspection.mjs';\n/**\n * Test if the given value is a GraphQL schema.\n */\n\nexport function isSchema(schema) {\n  return instanceOf(schema, GraphQLSchema);\n}\nexport function assertSchema(schema) {\n  if (!isSchema(schema)) {\n    throw new Error(`Expected ${inspect(schema)} to be a GraphQL schema.`);\n  }\n\n  return schema;\n}\n/**\n * Custom extensions\n *\n * @remarks\n * Use a unique identifier name for your extension, for example the name of\n * your library or project. Do not use a shortened identifier as this increases\n * the risk of conflicts. We recommend you add at most one extension field,\n * an object which can contain all the values you need.\n */\n\n/**\n * Schema Definition\n *\n * A Schema is created by supplying the root types of each type of operation,\n * query and mutation (optional). A schema definition is then supplied to the\n * validator and executor.\n *\n * Example:\n *\n * ```ts\n * const MyAppSchema = new GraphQLSchema({\n *   query: MyAppQueryRootType,\n *   mutation: MyAppMutationRootType,\n * })\n * ```\n *\n * Note: When the schema is constructed, by default only the types that are\n * reachable by traversing the root types are included, other types must be\n * explicitly referenced.\n *\n * Example:\n *\n * ```ts\n * const characterInterface = new GraphQLInterfaceType({\n *   name: 'Character',\n *   ...\n * });\n *\n * const humanType = new GraphQLObjectType({\n *   name: 'Human',\n *   interfaces: [characterInterface],\n *   ...\n * });\n *\n * const droidType = new GraphQLObjectType({\n *   name: 'Droid',\n *   interfaces: [characterInterface],\n *   ...\n * });\n *\n * const schema = new GraphQLSchema({\n *   query: new GraphQLObjectType({\n *     name: 'Query',\n *     fields: {\n *       hero: { type: characterInterface, ... },\n *     }\n *   }),\n *   ...\n *   // Since this schema references only the `Character` interface it's\n *   // necessary to explicitly list the types that implement it if\n *   // you want them to be included in the final schema.\n *   types: [humanType, droidType],\n * })\n * ```\n *\n * Note: If an array of `directives` are provided to GraphQLSchema, that will be\n * the exact list of directives represented and allowed. If `directives` is not\n * provided then a default set of the specified directives (e.g. `@include` and\n * `@skip`) will be used. If you wish to provide *additional* directives to these\n * specified directives, you must explicitly declare them. Example:\n *\n * ```ts\n * const MyAppSchema = new GraphQLSchema({\n *   ...\n *   directives: specifiedDirectives.concat([ myCustomDirective ]),\n * })\n * ```\n */\nexport class GraphQLSchema {\n  // Used as a cache for validateSchema().\n  constructor(config) {\n    var _config$extensionASTN, _config$directives;\n\n    // If this schema was built from a source known to be valid, then it may be\n    // marked with assumeValid to avoid an additional type system validation.\n    this.__validationErrors = config.assumeValid === true ? [] : undefined; // Check for common mistakes during construction to produce early errors.\n\n    isObjectLike(config) ||\n      devAssert(false, 'Must provide configuration object.');\n    !config.types ||\n      Array.isArray(config.types) ||\n      devAssert(\n        false,\n        `\"types\" must be Array if provided but got: ${inspect(config.types)}.`,\n      );\n    !config.directives ||\n      Array.isArray(config.directives) ||\n      devAssert(\n        false,\n        '\"directives\" must be Array if provided but got: ' +\n          `${inspect(config.directives)}.`,\n      );\n    this.description = config.description;\n    this.extensions = toObjMap(config.extensions);\n    this.astNode = config.astNode;\n    this.extensionASTNodes =\n      (_config$extensionASTN = config.extensionASTNodes) !== null &&\n      _config$extensionASTN !== void 0\n        ? _config$extensionASTN\n        : [];\n    this._queryType = config.query;\n    this._mutationType = config.mutation;\n    this._subscriptionType = config.subscription; // Provide specified directives (e.g. @include and @skip) by default.\n\n    this._directives =\n      (_config$directives = config.directives) !== null &&\n      _config$directives !== void 0\n        ? _config$directives\n        : specifiedDirectives; // To preserve order of user-provided types, we add first to add them to\n    // the set of \"collected\" types, so `collectReferencedTypes` ignore them.\n\n    const allReferencedTypes = new Set(config.types);\n\n    if (config.types != null) {\n      for (const type of config.types) {\n        // When we ready to process this type, we remove it from \"collected\" types\n        // and then add it together with all dependent types in the correct position.\n        allReferencedTypes.delete(type);\n        collectReferencedTypes(type, allReferencedTypes);\n      }\n    }\n\n    if (this._queryType != null) {\n      collectReferencedTypes(this._queryType, allReferencedTypes);\n    }\n\n    if (this._mutationType != null) {\n      collectReferencedTypes(this._mutationType, allReferencedTypes);\n    }\n\n    if (this._subscriptionType != null) {\n      collectReferencedTypes(this._subscriptionType, allReferencedTypes);\n    }\n\n    for (const directive of this._directives) {\n      // Directives are not validated until validateSchema() is called.\n      if (isDirective(directive)) {\n        for (const arg of directive.args) {\n          collectReferencedTypes(arg.type, allReferencedTypes);\n        }\n      }\n    }\n\n    collectReferencedTypes(__Schema, allReferencedTypes); // Storing the resulting map for reference by the schema.\n\n    this._typeMap = Object.create(null);\n    this._subTypeMap = Object.create(null); // Keep track of all implementations by interface name.\n\n    this._implementationsMap = Object.create(null);\n\n    for (const namedType of allReferencedTypes) {\n      if (namedType == null) {\n        continue;\n      }\n\n      const typeName = namedType.name;\n      typeName ||\n        devAssert(\n          false,\n          'One of the provided types for building the Schema is missing a name.',\n        );\n\n      if (this._typeMap[typeName] !== undefined) {\n        throw new Error(\n          `Schema must contain uniquely named types but contains multiple types named \"${typeName}\".`,\n        );\n      }\n\n      this._typeMap[typeName] = namedType;\n\n      if (isInterfaceType(namedType)) {\n        // Store implementations by interface.\n        for (const iface of namedType.getInterfaces()) {\n          if (isInterfaceType(iface)) {\n            let implementations = this._implementationsMap[iface.name];\n\n            if (implementations === undefined) {\n              implementations = this._implementationsMap[iface.name] = {\n                objects: [],\n                interfaces: [],\n              };\n            }\n\n            implementations.interfaces.push(namedType);\n          }\n        }\n      } else if (isObjectType(namedType)) {\n        // Store implementations by objects.\n        for (const iface of namedType.getInterfaces()) {\n          if (isInterfaceType(iface)) {\n            let implementations = this._implementationsMap[iface.name];\n\n            if (implementations === undefined) {\n              implementations = this._implementationsMap[iface.name] = {\n                objects: [],\n                interfaces: [],\n              };\n            }\n\n            implementations.objects.push(namedType);\n          }\n        }\n      }\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLSchema';\n  }\n\n  getQueryType() {\n    return this._queryType;\n  }\n\n  getMutationType() {\n    return this._mutationType;\n  }\n\n  getSubscriptionType() {\n    return this._subscriptionType;\n  }\n\n  getRootType(operation) {\n    switch (operation) {\n      case OperationTypeNode.QUERY:\n        return this.getQueryType();\n\n      case OperationTypeNode.MUTATION:\n        return this.getMutationType();\n\n      case OperationTypeNode.SUBSCRIPTION:\n        return this.getSubscriptionType();\n    }\n  }\n\n  getTypeMap() {\n    return this._typeMap;\n  }\n\n  getType(name) {\n    return this.getTypeMap()[name];\n  }\n\n  getPossibleTypes(abstractType) {\n    return isUnionType(abstractType)\n      ? abstractType.getTypes()\n      : this.getImplementations(abstractType).objects;\n  }\n\n  getImplementations(interfaceType) {\n    const implementations = this._implementationsMap[interfaceType.name];\n    return implementations !== null && implementations !== void 0\n      ? implementations\n      : {\n          objects: [],\n          interfaces: [],\n        };\n  }\n\n  isSubType(abstractType, maybeSubType) {\n    let map = this._subTypeMap[abstractType.name];\n\n    if (map === undefined) {\n      map = Object.create(null);\n\n      if (isUnionType(abstractType)) {\n        for (const type of abstractType.getTypes()) {\n          map[type.name] = true;\n        }\n      } else {\n        const implementations = this.getImplementations(abstractType);\n\n        for (const type of implementations.objects) {\n          map[type.name] = true;\n        }\n\n        for (const type of implementations.interfaces) {\n          map[type.name] = true;\n        }\n      }\n\n      this._subTypeMap[abstractType.name] = map;\n    }\n\n    return map[maybeSubType.name] !== undefined;\n  }\n\n  getDirectives() {\n    return this._directives;\n  }\n\n  getDirective(name) {\n    return this.getDirectives().find((directive) => directive.name === name);\n  }\n\n  toConfig() {\n    return {\n      description: this.description,\n      query: this.getQueryType(),\n      mutation: this.getMutationType(),\n      subscription: this.getSubscriptionType(),\n      types: Object.values(this.getTypeMap()),\n      directives: this.getDirectives(),\n      extensions: this.extensions,\n      astNode: this.astNode,\n      extensionASTNodes: this.extensionASTNodes,\n      assumeValid: this.__validationErrors !== undefined,\n    };\n  }\n}\n\nfunction collectReferencedTypes(type, typeSet) {\n  const namedType = getNamedType(type);\n\n  if (!typeSet.has(namedType)) {\n    typeSet.add(namedType);\n\n    if (isUnionType(namedType)) {\n      for (const memberType of namedType.getTypes()) {\n        collectReferencedTypes(memberType, typeSet);\n      }\n    } else if (isObjectType(namedType) || isInterfaceType(namedType)) {\n      for (const interfaceType of namedType.getInterfaces()) {\n        collectReferencedTypes(interfaceType, typeSet);\n      }\n\n      for (const field of Object.values(namedType.getFields())) {\n        collectReferencedTypes(field.type, typeSet);\n\n        for (const arg of field.args) {\n          collectReferencedTypes(arg.type, typeSet);\n        }\n      }\n    } else if (isInputObjectType(namedType)) {\n      for (const field of Object.values(namedType.getFields())) {\n        collectReferencedTypes(field.type, typeSet);\n      }\n    }\n  }\n\n  return typeSet;\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { OperationTypeNode } from '../language/ast.mjs';\nimport { isEqualType, isTypeSubTypeOf } from '../utilities/typeComparators.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInputType,\n  isInterfaceType,\n  isNamedType,\n  isNonNullType,\n  isObjectType,\n  isOutputType,\n  isRequiredArgument,\n  isRequiredInputField,\n  isUnionType,\n} from './definition.mjs';\nimport { GraphQLDeprecatedDirective, isDirective } from './directives.mjs';\nimport { isIntrospectionType } from './introspection.mjs';\nimport { assertSchema } from './schema.mjs';\n/**\n * Implements the \"Type Validation\" sub-sections of the specification's\n * \"Type System\" section.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the Schema is valid.\n */\n\nexport function validateSchema(schema) {\n  // First check to ensure the provided value is in fact a GraphQLSchema.\n  assertSchema(schema); // If this Schema has already been validated, return the previous results.\n\n  if (schema.__validationErrors) {\n    return schema.__validationErrors;\n  } // Validate the schema, producing a list of errors.\n\n  const context = new SchemaValidationContext(schema);\n  validateRootTypes(context);\n  validateDirectives(context);\n  validateTypes(context); // Persist the results of validation before returning to ensure validation\n  // does not run multiple times for this schema.\n\n  const errors = context.getErrors();\n  schema.__validationErrors = errors;\n  return errors;\n}\n/**\n * Utility function which asserts a schema is valid by throwing an error if\n * it is invalid.\n */\n\nexport function assertValidSchema(schema) {\n  const errors = validateSchema(schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n\nclass SchemaValidationContext {\n  constructor(schema) {\n    this._errors = [];\n    this.schema = schema;\n  }\n\n  reportError(message, nodes) {\n    const _nodes = Array.isArray(nodes) ? nodes.filter(Boolean) : nodes;\n\n    this._errors.push(\n      new GraphQLError(message, {\n        nodes: _nodes,\n      }),\n    );\n  }\n\n  getErrors() {\n    return this._errors;\n  }\n}\n\nfunction validateRootTypes(context) {\n  const schema = context.schema;\n  const queryType = schema.getQueryType();\n\n  if (!queryType) {\n    context.reportError('Query root type must be provided.', schema.astNode);\n  } else if (!isObjectType(queryType)) {\n    var _getOperationTypeNode;\n\n    context.reportError(\n      `Query root type must be Object type, it cannot be ${inspect(\n        queryType,\n      )}.`,\n      (_getOperationTypeNode = getOperationTypeNode(\n        schema,\n        OperationTypeNode.QUERY,\n      )) !== null && _getOperationTypeNode !== void 0\n        ? _getOperationTypeNode\n        : queryType.astNode,\n    );\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType && !isObjectType(mutationType)) {\n    var _getOperationTypeNode2;\n\n    context.reportError(\n      'Mutation root type must be Object type if provided, it cannot be ' +\n        `${inspect(mutationType)}.`,\n      (_getOperationTypeNode2 = getOperationTypeNode(\n        schema,\n        OperationTypeNode.MUTATION,\n      )) !== null && _getOperationTypeNode2 !== void 0\n        ? _getOperationTypeNode2\n        : mutationType.astNode,\n    );\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && !isObjectType(subscriptionType)) {\n    var _getOperationTypeNode3;\n\n    context.reportError(\n      'Subscription root type must be Object type if provided, it cannot be ' +\n        `${inspect(subscriptionType)}.`,\n      (_getOperationTypeNode3 = getOperationTypeNode(\n        schema,\n        OperationTypeNode.SUBSCRIPTION,\n      )) !== null && _getOperationTypeNode3 !== void 0\n        ? _getOperationTypeNode3\n        : subscriptionType.astNode,\n    );\n  }\n}\n\nfunction getOperationTypeNode(schema, operation) {\n  var _flatMap$find;\n\n  return (_flatMap$find = [schema.astNode, ...schema.extensionASTNodes]\n    .flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (schemaNode) => {\n        var _schemaNode$operation;\n\n        return (\n          /* c8 ignore next */\n          (_schemaNode$operation =\n            schemaNode === null || schemaNode === void 0\n              ? void 0\n              : schemaNode.operationTypes) !== null &&\n            _schemaNode$operation !== void 0\n            ? _schemaNode$operation\n            : []\n        );\n      },\n    )\n    .find((operationNode) => operationNode.operation === operation)) === null ||\n    _flatMap$find === void 0\n    ? void 0\n    : _flatMap$find.type;\n}\n\nfunction validateDirectives(context) {\n  for (const directive of context.schema.getDirectives()) {\n    // Ensure all directives are in fact GraphQL directives.\n    if (!isDirective(directive)) {\n      context.reportError(\n        `Expected directive but got: ${inspect(directive)}.`,\n        directive === null || directive === void 0 ? void 0 : directive.astNode,\n      );\n      continue;\n    } // Ensure they are named correctly.\n\n    validateName(context, directive);\n\n    if (directive.locations.length === 0) {\n      context.reportError(\n        `Directive @${directive.name} must include 1 or more locations.`,\n        directive.astNode,\n      );\n    } // Ensure the arguments are valid.\n\n    for (const arg of directive.args) {\n      // Ensure they are named correctly.\n      validateName(context, arg); // Ensure the type is an input type.\n\n      if (!isInputType(arg.type)) {\n        context.reportError(\n          `The type of @${directive.name}(${arg.name}:) must be Input Type ` +\n            `but got: ${inspect(arg.type)}.`,\n          arg.astNode,\n        );\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode;\n\n        context.reportError(\n          `Required argument @${directive.name}(${arg.name}:) cannot be deprecated.`,\n          [\n            getDeprecatedDirectiveNode(arg.astNode),\n            (_arg$astNode = arg.astNode) === null || _arg$astNode === void 0\n              ? void 0\n              : _arg$astNode.type,\n          ],\n        );\n      }\n    }\n  }\n}\n\nfunction validateName(context, node) {\n  // Ensure names are valid, however introspection types opt out.\n  if (node.name.startsWith('__')) {\n    context.reportError(\n      `Name \"${node.name}\" must not begin with \"__\", which is reserved by GraphQL introspection.`,\n      node.astNode,\n    );\n  }\n}\n\nfunction validateTypes(context) {\n  const validateInputObjectCircularRefs =\n    createInputObjectCircularRefsValidator(context);\n  const typeMap = context.schema.getTypeMap();\n\n  for (const type of Object.values(typeMap)) {\n    // Ensure all provided types are in fact GraphQL type.\n    if (!isNamedType(type)) {\n      context.reportError(\n        `Expected GraphQL named type but got: ${inspect(type)}.`,\n        type.astNode,\n      );\n      continue;\n    } // Ensure it is named correctly (excluding introspection types).\n\n    if (!isIntrospectionType(type)) {\n      validateName(context, type);\n    }\n\n    if (isObjectType(type)) {\n      // Ensure fields are valid\n      validateFields(context, type); // Ensure objects implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isInterfaceType(type)) {\n      // Ensure fields are valid.\n      validateFields(context, type); // Ensure interfaces implement the interfaces they claim to.\n\n      validateInterfaces(context, type);\n    } else if (isUnionType(type)) {\n      // Ensure Unions include valid member types.\n      validateUnionMembers(context, type);\n    } else if (isEnumType(type)) {\n      // Ensure Enums have valid values.\n      validateEnumValues(context, type);\n    } else if (isInputObjectType(type)) {\n      // Ensure Input Object fields are valid.\n      validateInputFields(context, type); // Ensure Input Objects do not contain non-nullable circular references\n\n      validateInputObjectCircularRefs(type);\n    }\n  }\n}\n\nfunction validateFields(context, type) {\n  const fields = Object.values(type.getFields()); // Objects and Interfaces both must define one or more fields.\n\n  if (fields.length === 0) {\n    context.reportError(`Type ${type.name} must define one or more fields.`, [\n      type.astNode,\n      ...type.extensionASTNodes,\n    ]);\n  }\n\n  for (const field of fields) {\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an output type\n\n    if (!isOutputType(field.type)) {\n      var _field$astNode;\n\n      context.reportError(\n        `The type of ${type.name}.${field.name} must be Output Type ` +\n          `but got: ${inspect(field.type)}.`,\n        (_field$astNode = field.astNode) === null || _field$astNode === void 0\n          ? void 0\n          : _field$astNode.type,\n      );\n    } // Ensure the arguments are valid\n\n    for (const arg of field.args) {\n      const argName = arg.name; // Ensure they are named correctly.\n\n      validateName(context, arg); // Ensure the type is an input type\n\n      if (!isInputType(arg.type)) {\n        var _arg$astNode2;\n\n        context.reportError(\n          `The type of ${type.name}.${field.name}(${argName}:) must be Input ` +\n            `Type but got: ${inspect(arg.type)}.`,\n          (_arg$astNode2 = arg.astNode) === null || _arg$astNode2 === void 0\n            ? void 0\n            : _arg$astNode2.type,\n        );\n      }\n\n      if (isRequiredArgument(arg) && arg.deprecationReason != null) {\n        var _arg$astNode3;\n\n        context.reportError(\n          `Required argument ${type.name}.${field.name}(${argName}:) cannot be deprecated.`,\n          [\n            getDeprecatedDirectiveNode(arg.astNode),\n            (_arg$astNode3 = arg.astNode) === null || _arg$astNode3 === void 0\n              ? void 0\n              : _arg$astNode3.type,\n          ],\n        );\n      }\n    }\n  }\n}\n\nfunction validateInterfaces(context, type) {\n  const ifaceTypeNames = Object.create(null);\n\n  for (const iface of type.getInterfaces()) {\n    if (!isInterfaceType(iface)) {\n      context.reportError(\n        `Type ${inspect(type)} must only implement Interface types, ` +\n          `it cannot implement ${inspect(iface)}.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    if (type === iface) {\n      context.reportError(\n        `Type ${type.name} cannot implement itself because it would create a circular reference.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    if (ifaceTypeNames[iface.name]) {\n      context.reportError(\n        `Type ${type.name} can only implement ${iface.name} once.`,\n        getAllImplementsInterfaceNodes(type, iface),\n      );\n      continue;\n    }\n\n    ifaceTypeNames[iface.name] = true;\n    validateTypeImplementsAncestors(context, type, iface);\n    validateTypeImplementsInterface(context, type, iface);\n  }\n}\n\nfunction validateTypeImplementsInterface(context, type, iface) {\n  const typeFieldMap = type.getFields(); // Assert each interface field is implemented.\n\n  for (const ifaceField of Object.values(iface.getFields())) {\n    const fieldName = ifaceField.name;\n    const typeField = typeFieldMap[fieldName]; // Assert interface field exists on type.\n\n    if (!typeField) {\n      context.reportError(\n        `Interface field ${iface.name}.${fieldName} expected but ${type.name} does not provide it.`,\n        [ifaceField.astNode, type.astNode, ...type.extensionASTNodes],\n      );\n      continue;\n    } // Assert interface field type is satisfied by type field type, by being\n    // a valid subtype. (covariant)\n\n    if (!isTypeSubTypeOf(context.schema, typeField.type, ifaceField.type)) {\n      var _ifaceField$astNode, _typeField$astNode;\n\n      context.reportError(\n        `Interface field ${iface.name}.${fieldName} expects type ` +\n          `${inspect(ifaceField.type)} but ${type.name}.${fieldName} ` +\n          `is type ${inspect(typeField.type)}.`,\n        [\n          (_ifaceField$astNode = ifaceField.astNode) === null ||\n          _ifaceField$astNode === void 0\n            ? void 0\n            : _ifaceField$astNode.type,\n          (_typeField$astNode = typeField.astNode) === null ||\n          _typeField$astNode === void 0\n            ? void 0\n            : _typeField$astNode.type,\n        ],\n      );\n    } // Assert each interface field arg is implemented.\n\n    for (const ifaceArg of ifaceField.args) {\n      const argName = ifaceArg.name;\n      const typeArg = typeField.args.find((arg) => arg.name === argName); // Assert interface field arg exists on object field.\n\n      if (!typeArg) {\n        context.reportError(\n          `Interface field argument ${iface.name}.${fieldName}(${argName}:) expected but ${type.name}.${fieldName} does not provide it.`,\n          [ifaceArg.astNode, typeField.astNode],\n        );\n        continue;\n      } // Assert interface field arg type matches object field arg type.\n      // (invariant)\n      // TODO: change to contravariant?\n\n      if (!isEqualType(ifaceArg.type, typeArg.type)) {\n        var _ifaceArg$astNode, _typeArg$astNode;\n\n        context.reportError(\n          `Interface field argument ${iface.name}.${fieldName}(${argName}:) ` +\n            `expects type ${inspect(ifaceArg.type)} but ` +\n            `${type.name}.${fieldName}(${argName}:) is type ` +\n            `${inspect(typeArg.type)}.`,\n          [\n            (_ifaceArg$astNode = ifaceArg.astNode) === null ||\n            _ifaceArg$astNode === void 0\n              ? void 0\n              : _ifaceArg$astNode.type,\n            (_typeArg$astNode = typeArg.astNode) === null ||\n            _typeArg$astNode === void 0\n              ? void 0\n              : _typeArg$astNode.type,\n          ],\n        );\n      } // TODO: validate default values?\n    } // Assert additional arguments must not be required.\n\n    for (const typeArg of typeField.args) {\n      const argName = typeArg.name;\n      const ifaceArg = ifaceField.args.find((arg) => arg.name === argName);\n\n      if (!ifaceArg && isRequiredArgument(typeArg)) {\n        context.reportError(\n          `Object field ${type.name}.${fieldName} includes required argument ${argName} that is missing from the Interface field ${iface.name}.${fieldName}.`,\n          [typeArg.astNode, ifaceField.astNode],\n        );\n      }\n    }\n  }\n}\n\nfunction validateTypeImplementsAncestors(context, type, iface) {\n  const ifaceInterfaces = type.getInterfaces();\n\n  for (const transitive of iface.getInterfaces()) {\n    if (!ifaceInterfaces.includes(transitive)) {\n      context.reportError(\n        transitive === type\n          ? `Type ${type.name} cannot implement ${iface.name} because it would create a circular reference.`\n          : `Type ${type.name} must implement ${transitive.name} because it is implemented by ${iface.name}.`,\n        [\n          ...getAllImplementsInterfaceNodes(iface, transitive),\n          ...getAllImplementsInterfaceNodes(type, iface),\n        ],\n      );\n    }\n  }\n}\n\nfunction validateUnionMembers(context, union) {\n  const memberTypes = union.getTypes();\n\n  if (memberTypes.length === 0) {\n    context.reportError(\n      `Union type ${union.name} must define one or more member types.`,\n      [union.astNode, ...union.extensionASTNodes],\n    );\n  }\n\n  const includedTypeNames = Object.create(null);\n\n  for (const memberType of memberTypes) {\n    if (includedTypeNames[memberType.name]) {\n      context.reportError(\n        `Union type ${union.name} can only include type ${memberType.name} once.`,\n        getUnionMemberTypeNodes(union, memberType.name),\n      );\n      continue;\n    }\n\n    includedTypeNames[memberType.name] = true;\n\n    if (!isObjectType(memberType)) {\n      context.reportError(\n        `Union type ${union.name} can only include Object types, ` +\n          `it cannot include ${inspect(memberType)}.`,\n        getUnionMemberTypeNodes(union, String(memberType)),\n      );\n    }\n  }\n}\n\nfunction validateEnumValues(context, enumType) {\n  const enumValues = enumType.getValues();\n\n  if (enumValues.length === 0) {\n    context.reportError(\n      `Enum type ${enumType.name} must define one or more values.`,\n      [enumType.astNode, ...enumType.extensionASTNodes],\n    );\n  }\n\n  for (const enumValue of enumValues) {\n    // Ensure valid name.\n    validateName(context, enumValue);\n  }\n}\n\nfunction validateInputFields(context, inputObj) {\n  const fields = Object.values(inputObj.getFields());\n\n  if (fields.length === 0) {\n    context.reportError(\n      `Input Object type ${inputObj.name} must define one or more fields.`,\n      [inputObj.astNode, ...inputObj.extensionASTNodes],\n    );\n  } // Ensure the arguments are valid\n\n  for (const field of fields) {\n    // Ensure they are named correctly.\n    validateName(context, field); // Ensure the type is an input type\n\n    if (!isInputType(field.type)) {\n      var _field$astNode2;\n\n      context.reportError(\n        `The type of ${inputObj.name}.${field.name} must be Input Type ` +\n          `but got: ${inspect(field.type)}.`,\n        (_field$astNode2 = field.astNode) === null || _field$astNode2 === void 0\n          ? void 0\n          : _field$astNode2.type,\n      );\n    }\n\n    if (isRequiredInputField(field) && field.deprecationReason != null) {\n      var _field$astNode3;\n\n      context.reportError(\n        `Required input field ${inputObj.name}.${field.name} cannot be deprecated.`,\n        [\n          getDeprecatedDirectiveNode(field.astNode),\n          (_field$astNode3 = field.astNode) === null ||\n          _field$astNode3 === void 0\n            ? void 0\n            : _field$astNode3.type,\n        ],\n      );\n    }\n\n    if (inputObj.isOneOf) {\n      validateOneOfInputObjectField(inputObj, field, context);\n    }\n  }\n}\n\nfunction validateOneOfInputObjectField(type, field, context) {\n  if (isNonNullType(field.type)) {\n    var _field$astNode4;\n\n    context.reportError(\n      `OneOf input field ${type.name}.${field.name} must be nullable.`,\n      (_field$astNode4 = field.astNode) === null || _field$astNode4 === void 0\n        ? void 0\n        : _field$astNode4.type,\n    );\n  }\n\n  if (field.defaultValue !== undefined) {\n    context.reportError(\n      `OneOf input field ${type.name}.${field.name} cannot have a default value.`,\n      field.astNode,\n    );\n  }\n}\n\nfunction createInputObjectCircularRefsValidator(context) {\n  // Modified copy of algorithm from 'src/validation/rules/NoFragmentCycles.js'.\n  // Tracks already visited types to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  const visitedTypes = Object.create(null); // Array of types nodes used to produce meaningful errors\n\n  const fieldPath = []; // Position in the type path\n\n  const fieldPathIndexByTypeName = Object.create(null);\n  return detectCycleRecursive; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(inputObj) {\n    if (visitedTypes[inputObj.name]) {\n      return;\n    }\n\n    visitedTypes[inputObj.name] = true;\n    fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;\n    const fields = Object.values(inputObj.getFields());\n\n    for (const field of fields) {\n      if (isNonNullType(field.type) && isInputObjectType(field.type.ofType)) {\n        const fieldType = field.type.ofType;\n        const cycleIndex = fieldPathIndexByTypeName[fieldType.name];\n        fieldPath.push(field);\n\n        if (cycleIndex === undefined) {\n          detectCycleRecursive(fieldType);\n        } else {\n          const cyclePath = fieldPath.slice(cycleIndex);\n          const pathStr = cyclePath.map((fieldObj) => fieldObj.name).join('.');\n          context.reportError(\n            `Cannot reference Input Object \"${fieldType.name}\" within itself through a series of non-null fields: \"${pathStr}\".`,\n            cyclePath.map((fieldObj) => fieldObj.astNode),\n          );\n        }\n\n        fieldPath.pop();\n      }\n    }\n\n    fieldPathIndexByTypeName[inputObj.name] = undefined;\n  }\n}\n\nfunction getAllImplementsInterfaceNodes(type, iface) {\n  const { astNode, extensionASTNodes } = type;\n  const nodes =\n    astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  return nodes\n    .flatMap((typeNode) => {\n      var _typeNode$interfaces;\n\n      return (\n        /* c8 ignore next */\n        (_typeNode$interfaces = typeNode.interfaces) !== null &&\n          _typeNode$interfaces !== void 0\n          ? _typeNode$interfaces\n          : []\n      );\n    })\n    .filter((ifaceNode) => ifaceNode.name.value === iface.name);\n}\n\nfunction getUnionMemberTypeNodes(union, typeName) {\n  const { astNode, extensionASTNodes } = union;\n  const nodes =\n    astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  return nodes\n    .flatMap((unionNode) => {\n      var _unionNode$types;\n\n      return (\n        /* c8 ignore next */\n        (_unionNode$types = unionNode.types) !== null &&\n          _unionNode$types !== void 0\n          ? _unionNode$types\n          : []\n      );\n    })\n    .filter((typeNode) => typeNode.name.value === typeName);\n}\n\nfunction getDeprecatedDirectiveNode(definitionNode) {\n  var _definitionNode$direc;\n\n  return definitionNode === null || definitionNode === void 0\n    ? void 0\n    : (_definitionNode$direc = definitionNode.directives) === null ||\n      _definitionNode$direc === void 0\n    ? void 0\n    : _definitionNode$direc.find(\n        (node) => node.name.value === GraphQLDeprecatedDirective.name,\n      );\n}\n","import { Kind } from '../language/kinds.mjs';\nimport { GraphQLList, GraphQLNonNull } from '../type/definition.mjs';\nexport function typeFromAST(schema, typeNode) {\n  switch (typeNode.kind) {\n    case Kind.LIST_TYPE: {\n      const innerType = typeFromAST(schema, typeNode.type);\n      return innerType && new GraphQLList(innerType);\n    }\n\n    case Kind.NON_NULL_TYPE: {\n      const innerType = typeFromAST(schema, typeNode.type);\n      return innerType && new GraphQLNonNull(innerType);\n    }\n\n    case Kind.NAMED_TYPE:\n      return schema.getType(typeNode.name.value);\n  }\n}\n","import { isNode } from '../language/ast.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { getEnterLeaveForKind } from '../language/visitor.mjs';\nimport {\n  getNamedType,\n  getNullableType,\n  isCompositeType,\n  isEnumType,\n  isInputObjectType,\n  isInputType,\n  isInterfaceType,\n  isListType,\n  isObjectType,\n  isOutputType,\n} from '../type/definition.mjs';\nimport {\n  SchemaMetaFieldDef,\n  TypeMetaFieldDef,\n  TypeNameMetaFieldDef,\n} from '../type/introspection.mjs';\nimport { typeFromAST } from './typeFromAST.mjs';\n/**\n * TypeInfo is a utility class which, given a GraphQL schema, can keep track\n * of the current field and type definitions at any point in a GraphQL document\n * AST during a recursive descent by calling `enter(node)` and `leave(node)`.\n */\n\nexport class TypeInfo {\n  constructor(\n    schema,\n    /**\n     * Initial type may be provided in rare cases to facilitate traversals\n     *  beginning somewhere other than documents.\n     */\n    initialType,\n    /** @deprecated will be removed in 17.0.0 */\n    getFieldDefFn,\n  ) {\n    this._schema = schema;\n    this._typeStack = [];\n    this._parentTypeStack = [];\n    this._inputTypeStack = [];\n    this._fieldDefStack = [];\n    this._defaultValueStack = [];\n    this._directive = null;\n    this._argument = null;\n    this._enumValue = null;\n    this._getFieldDef =\n      getFieldDefFn !== null && getFieldDefFn !== void 0\n        ? getFieldDefFn\n        : getFieldDef;\n\n    if (initialType) {\n      if (isInputType(initialType)) {\n        this._inputTypeStack.push(initialType);\n      }\n\n      if (isCompositeType(initialType)) {\n        this._parentTypeStack.push(initialType);\n      }\n\n      if (isOutputType(initialType)) {\n        this._typeStack.push(initialType);\n      }\n    }\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'TypeInfo';\n  }\n\n  getType() {\n    if (this._typeStack.length > 0) {\n      return this._typeStack[this._typeStack.length - 1];\n    }\n  }\n\n  getParentType() {\n    if (this._parentTypeStack.length > 0) {\n      return this._parentTypeStack[this._parentTypeStack.length - 1];\n    }\n  }\n\n  getInputType() {\n    if (this._inputTypeStack.length > 0) {\n      return this._inputTypeStack[this._inputTypeStack.length - 1];\n    }\n  }\n\n  getParentInputType() {\n    if (this._inputTypeStack.length > 1) {\n      return this._inputTypeStack[this._inputTypeStack.length - 2];\n    }\n  }\n\n  getFieldDef() {\n    if (this._fieldDefStack.length > 0) {\n      return this._fieldDefStack[this._fieldDefStack.length - 1];\n    }\n  }\n\n  getDefaultValue() {\n    if (this._defaultValueStack.length > 0) {\n      return this._defaultValueStack[this._defaultValueStack.length - 1];\n    }\n  }\n\n  getDirective() {\n    return this._directive;\n  }\n\n  getArgument() {\n    return this._argument;\n  }\n\n  getEnumValue() {\n    return this._enumValue;\n  }\n\n  enter(node) {\n    const schema = this._schema; // Note: many of the types below are explicitly typed as \"unknown\" to drop\n    // any assumptions of a valid schema to ensure runtime types are properly\n    // checked before continuing since TypeInfo is used as part of validation\n    // which occurs before guarantees of schema and document validity.\n\n    switch (node.kind) {\n      case Kind.SELECTION_SET: {\n        const namedType = getNamedType(this.getType());\n\n        this._parentTypeStack.push(\n          isCompositeType(namedType) ? namedType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.FIELD: {\n        const parentType = this.getParentType();\n        let fieldDef;\n        let fieldType;\n\n        if (parentType) {\n          fieldDef = this._getFieldDef(schema, parentType, node);\n\n          if (fieldDef) {\n            fieldType = fieldDef.type;\n          }\n        }\n\n        this._fieldDefStack.push(fieldDef);\n\n        this._typeStack.push(isOutputType(fieldType) ? fieldType : undefined);\n\n        break;\n      }\n\n      case Kind.DIRECTIVE:\n        this._directive = schema.getDirective(node.name.value);\n        break;\n\n      case Kind.OPERATION_DEFINITION: {\n        const rootType = schema.getRootType(node.operation);\n\n        this._typeStack.push(isObjectType(rootType) ? rootType : undefined);\n\n        break;\n      }\n\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION: {\n        const typeConditionAST = node.typeCondition;\n        const outputType = typeConditionAST\n          ? typeFromAST(schema, typeConditionAST)\n          : getNamedType(this.getType());\n\n        this._typeStack.push(isOutputType(outputType) ? outputType : undefined);\n\n        break;\n      }\n\n      case Kind.VARIABLE_DEFINITION: {\n        const inputType = typeFromAST(schema, node.type);\n\n        this._inputTypeStack.push(\n          isInputType(inputType) ? inputType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.ARGUMENT: {\n        var _this$getDirective;\n\n        let argDef;\n        let argType;\n        const fieldOrDirective =\n          (_this$getDirective = this.getDirective()) !== null &&\n          _this$getDirective !== void 0\n            ? _this$getDirective\n            : this.getFieldDef();\n\n        if (fieldOrDirective) {\n          argDef = fieldOrDirective.args.find(\n            (arg) => arg.name === node.name.value,\n          );\n\n          if (argDef) {\n            argType = argDef.type;\n          }\n        }\n\n        this._argument = argDef;\n\n        this._defaultValueStack.push(argDef ? argDef.defaultValue : undefined);\n\n        this._inputTypeStack.push(isInputType(argType) ? argType : undefined);\n\n        break;\n      }\n\n      case Kind.LIST: {\n        const listType = getNullableType(this.getInputType());\n        const itemType = isListType(listType) ? listType.ofType : listType; // List positions never have a default value.\n\n        this._defaultValueStack.push(undefined);\n\n        this._inputTypeStack.push(isInputType(itemType) ? itemType : undefined);\n\n        break;\n      }\n\n      case Kind.OBJECT_FIELD: {\n        const objectType = getNamedType(this.getInputType());\n        let inputFieldType;\n        let inputField;\n\n        if (isInputObjectType(objectType)) {\n          inputField = objectType.getFields()[node.name.value];\n\n          if (inputField) {\n            inputFieldType = inputField.type;\n          }\n        }\n\n        this._defaultValueStack.push(\n          inputField ? inputField.defaultValue : undefined,\n        );\n\n        this._inputTypeStack.push(\n          isInputType(inputFieldType) ? inputFieldType : undefined,\n        );\n\n        break;\n      }\n\n      case Kind.ENUM: {\n        const enumType = getNamedType(this.getInputType());\n        let enumValue;\n\n        if (isEnumType(enumType)) {\n          enumValue = enumType.getValue(node.value);\n        }\n\n        this._enumValue = enumValue;\n        break;\n      }\n\n      default: // Ignore other nodes\n    }\n  }\n\n  leave(node) {\n    switch (node.kind) {\n      case Kind.SELECTION_SET:\n        this._parentTypeStack.pop();\n\n        break;\n\n      case Kind.FIELD:\n        this._fieldDefStack.pop();\n\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.DIRECTIVE:\n        this._directive = null;\n        break;\n\n      case Kind.OPERATION_DEFINITION:\n      case Kind.INLINE_FRAGMENT:\n      case Kind.FRAGMENT_DEFINITION:\n        this._typeStack.pop();\n\n        break;\n\n      case Kind.VARIABLE_DEFINITION:\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ARGUMENT:\n        this._argument = null;\n\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.LIST:\n      case Kind.OBJECT_FIELD:\n        this._defaultValueStack.pop();\n\n        this._inputTypeStack.pop();\n\n        break;\n\n      case Kind.ENUM:\n        this._enumValue = null;\n        break;\n\n      default: // Ignore other nodes\n    }\n  }\n}\n\n/**\n * Not exactly the same as the executor's definition of getFieldDef, in this\n * statically evaluated environment we do not always have an Object type,\n * and need to handle Interface and Union types.\n */\nfunction getFieldDef(schema, parentType, fieldNode) {\n  const name = fieldNode.name.value;\n\n  if (\n    name === SchemaMetaFieldDef.name &&\n    schema.getQueryType() === parentType\n  ) {\n    return SchemaMetaFieldDef;\n  }\n\n  if (name === TypeMetaFieldDef.name && schema.getQueryType() === parentType) {\n    return TypeMetaFieldDef;\n  }\n\n  if (name === TypeNameMetaFieldDef.name && isCompositeType(parentType)) {\n    return TypeNameMetaFieldDef;\n  }\n\n  if (isObjectType(parentType) || isInterfaceType(parentType)) {\n    return parentType.getFields()[name];\n  }\n}\n/**\n * Creates a new visitor instance which maintains a provided TypeInfo instance\n * along with visiting visitor.\n */\n\nexport function visitWithTypeInfo(typeInfo, visitor) {\n  return {\n    enter(...args) {\n      const node = args[0];\n      typeInfo.enter(node);\n      const fn = getEnterLeaveForKind(visitor, node.kind).enter;\n\n      if (fn) {\n        const result = fn.apply(visitor, args);\n\n        if (result !== undefined) {\n          typeInfo.leave(node);\n\n          if (isNode(result)) {\n            typeInfo.enter(result);\n          }\n        }\n\n        return result;\n      }\n    },\n\n    leave(...args) {\n      const node = args[0];\n      const fn = getEnterLeaveForKind(visitor, node.kind).leave;\n      let result;\n\n      if (fn) {\n        result = fn.apply(visitor, args);\n      }\n\n      typeInfo.leave(node);\n      return result;\n    },\n  };\n}\n","import { Kind } from './kinds.mjs';\nexport function isDefinitionNode(node) {\n  return (\n    isExecutableDefinitionNode(node) ||\n    isTypeSystemDefinitionNode(node) ||\n    isTypeSystemExtensionNode(node)\n  );\n}\nexport function isExecutableDefinitionNode(node) {\n  return (\n    node.kind === Kind.OPERATION_DEFINITION ||\n    node.kind === Kind.FRAGMENT_DEFINITION\n  );\n}\nexport function isSelectionNode(node) {\n  return (\n    node.kind === Kind.FIELD ||\n    node.kind === Kind.FRAGMENT_SPREAD ||\n    node.kind === Kind.INLINE_FRAGMENT\n  );\n}\nexport function isValueNode(node) {\n  return (\n    node.kind === Kind.VARIABLE ||\n    node.kind === Kind.INT ||\n    node.kind === Kind.FLOAT ||\n    node.kind === Kind.STRING ||\n    node.kind === Kind.BOOLEAN ||\n    node.kind === Kind.NULL ||\n    node.kind === Kind.ENUM ||\n    node.kind === Kind.LIST ||\n    node.kind === Kind.OBJECT\n  );\n}\nexport function isConstValueNode(node) {\n  return (\n    isValueNode(node) &&\n    (node.kind === Kind.LIST\n      ? node.values.some(isConstValueNode)\n      : node.kind === Kind.OBJECT\n      ? node.fields.some((field) => isConstValueNode(field.value))\n      : node.kind !== Kind.VARIABLE)\n  );\n}\nexport function isTypeNode(node) {\n  return (\n    node.kind === Kind.NAMED_TYPE ||\n    node.kind === Kind.LIST_TYPE ||\n    node.kind === Kind.NON_NULL_TYPE\n  );\n}\nexport function isTypeSystemDefinitionNode(node) {\n  return (\n    node.kind === Kind.SCHEMA_DEFINITION ||\n    isTypeDefinitionNode(node) ||\n    node.kind === Kind.DIRECTIVE_DEFINITION\n  );\n}\nexport function isTypeDefinitionNode(node) {\n  return (\n    node.kind === Kind.SCALAR_TYPE_DEFINITION ||\n    node.kind === Kind.OBJECT_TYPE_DEFINITION ||\n    node.kind === Kind.INTERFACE_TYPE_DEFINITION ||\n    node.kind === Kind.UNION_TYPE_DEFINITION ||\n    node.kind === Kind.ENUM_TYPE_DEFINITION ||\n    node.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION\n  );\n}\nexport function isTypeSystemExtensionNode(node) {\n  return node.kind === Kind.SCHEMA_EXTENSION || isTypeExtensionNode(node);\n}\nexport function isTypeExtensionNode(node) {\n  return (\n    node.kind === Kind.SCALAR_TYPE_EXTENSION ||\n    node.kind === Kind.OBJECT_TYPE_EXTENSION ||\n    node.kind === Kind.INTERFACE_TYPE_EXTENSION ||\n    node.kind === Kind.UNION_TYPE_EXTENSION ||\n    node.kind === Kind.ENUM_TYPE_EXTENSION ||\n    node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION\n  );\n}\nexport function isSchemaCoordinateNode(node) {\n  return (\n    node.kind === Kind.TYPE_COORDINATE ||\n    node.kind === Kind.MEMBER_COORDINATE ||\n    node.kind === Kind.ARGUMENT_COORDINATE ||\n    node.kind === Kind.DIRECTIVE_COORDINATE ||\n    node.kind === Kind.DIRECTIVE_ARGUMENT_COORDINATE\n  );\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { isExecutableDefinitionNode } from '../../language/predicates.mjs';\n\n/**\n * Executable definitions\n *\n * A GraphQL document is only valid for execution if all definitions are either\n * operation or fragment definitions.\n *\n * See https://spec.graphql.org/draft/#sec-Executable-Definitions\n */\nexport function ExecutableDefinitionsRule(context) {\n  return {\n    Document(node) {\n      for (const definition of node.definitions) {\n        if (!isExecutableDefinitionNode(definition)) {\n          const defName =\n            definition.kind === Kind.SCHEMA_DEFINITION ||\n            definition.kind === Kind.SCHEMA_EXTENSION\n              ? 'schema'\n              : '\"' + definition.name.value + '\"';\n          context.reportError(\n            new GraphQLError(`The ${defName} definition is not executable.`, {\n              nodes: definition,\n            }),\n          );\n        }\n      }\n\n      return false;\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { naturalCompare } from '../../jsutils/naturalCompare.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isAbstractType,\n  isInterfaceType,\n  isObjectType,\n} from '../../type/definition.mjs';\n\n/**\n * Fields on correct type\n *\n * A GraphQL document is only valid if all fields selected are defined by the\n * parent type, or are an allowed meta field such as __typename.\n *\n * See https://spec.graphql.org/draft/#sec-Field-Selections\n */\nexport function FieldsOnCorrectTypeRule(context) {\n  return {\n    Field(node) {\n      const type = context.getParentType();\n\n      if (type) {\n        const fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          // This field doesn't exist, lets look for suggestions.\n          const schema = context.getSchema();\n          const fieldName = node.name.value; // First determine if there are any suggested types to condition on.\n\n          let suggestion = didYouMean(\n            'to use an inline fragment on',\n            getSuggestedTypeNames(schema, type, fieldName),\n          ); // If there are no suggested types, then perhaps this was a typo?\n\n          if (suggestion === '') {\n            suggestion = didYouMean(getSuggestedFieldNames(type, fieldName));\n          } // Report an error, including helpful suggestions.\n\n          context.reportError(\n            new GraphQLError(\n              `Cannot query field \"${fieldName}\" on type \"${type.name}\".` +\n                suggestion,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n/**\n * Go through all of the implementations of type, as well as the interfaces that\n * they implement. If any of those types include the provided field, suggest them,\n * sorted by how often the type is referenced.\n */\n\nfunction getSuggestedTypeNames(schema, type, fieldName) {\n  if (!isAbstractType(type)) {\n    // Must be an Object type, which does not have possible fields.\n    return [];\n  }\n\n  const suggestedTypes = new Set();\n  const usageCount = Object.create(null);\n\n  for (const possibleType of schema.getPossibleTypes(type)) {\n    if (!possibleType.getFields()[fieldName]) {\n      continue;\n    } // This object type defines this field.\n\n    suggestedTypes.add(possibleType);\n    usageCount[possibleType.name] = 1;\n\n    for (const possibleInterface of possibleType.getInterfaces()) {\n      var _usageCount$possibleI;\n\n      if (!possibleInterface.getFields()[fieldName]) {\n        continue;\n      } // This interface type defines this field.\n\n      suggestedTypes.add(possibleInterface);\n      usageCount[possibleInterface.name] =\n        ((_usageCount$possibleI = usageCount[possibleInterface.name]) !==\n          null && _usageCount$possibleI !== void 0\n          ? _usageCount$possibleI\n          : 0) + 1;\n    }\n  }\n\n  return [...suggestedTypes]\n    .sort((typeA, typeB) => {\n      // Suggest both interface and object types based on how common they are.\n      const usageCountDiff = usageCount[typeB.name] - usageCount[typeA.name];\n\n      if (usageCountDiff !== 0) {\n        return usageCountDiff;\n      } // Suggest super types first followed by subtypes\n\n      if (isInterfaceType(typeA) && schema.isSubType(typeA, typeB)) {\n        return -1;\n      }\n\n      if (isInterfaceType(typeB) && schema.isSubType(typeB, typeA)) {\n        return 1;\n      }\n\n      return naturalCompare(typeA.name, typeB.name);\n    })\n    .map((x) => x.name);\n}\n/**\n * For the field name provided, determine if there are any similar field names\n * that may be the result of a typo.\n */\n\nfunction getSuggestedFieldNames(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type)) {\n    const possibleFieldNames = Object.keys(type.getFields());\n    return suggestionList(fieldName, possibleFieldNames);\n  } // Otherwise, must be a Union type, which does not define fields.\n\n  return [];\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isCompositeType } from '../../type/definition.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Fragments on composite type\n *\n * Fragments use a type condition to determine if they apply, since fragments\n * can only be spread into a composite type (object, interface, or union), the\n * type condition must also be a composite type.\n *\n * See https://spec.graphql.org/draft/#sec-Fragments-On-Composite-Types\n */\nexport function FragmentsOnCompositeTypesRule(context) {\n  return {\n    InlineFragment(node) {\n      const typeCondition = node.typeCondition;\n\n      if (typeCondition) {\n        const type = typeFromAST(context.getSchema(), typeCondition);\n\n        if (type && !isCompositeType(type)) {\n          const typeStr = print(typeCondition);\n          context.reportError(\n            new GraphQLError(\n              `Fragment cannot condition on non composite type \"${typeStr}\".`,\n              {\n                nodes: typeCondition,\n              },\n            ),\n          );\n        }\n      }\n    },\n\n    FragmentDefinition(node) {\n      const type = typeFromAST(context.getSchema(), node.typeCondition);\n\n      if (type && !isCompositeType(type)) {\n        const typeStr = print(node.typeCondition);\n        context.reportError(\n          new GraphQLError(\n            `Fragment \"${node.name.value}\" cannot condition on non composite type \"${typeStr}\".`,\n            {\n              nodes: node.typeCondition,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Known argument names\n *\n * A GraphQL field is only valid if all supplied arguments are defined by\n * that field.\n *\n * See https://spec.graphql.org/draft/#sec-Argument-Names\n * See https://spec.graphql.org/draft/#sec-Directives-Are-In-Valid-Locations\n */\nexport function KnownArgumentNamesRule(context) {\n  return {\n    // eslint-disable-next-line new-cap\n    ...KnownArgumentNamesOnDirectivesRule(context),\n\n    Argument(argNode) {\n      const argDef = context.getArgument();\n      const fieldDef = context.getFieldDef();\n      const parentType = context.getParentType();\n\n      if (!argDef && fieldDef && parentType) {\n        const argName = argNode.name.value;\n        const knownArgsNames = fieldDef.args.map((arg) => arg.name);\n        const suggestions = suggestionList(argName, knownArgsNames);\n        context.reportError(\n          new GraphQLError(\n            `Unknown argument \"${argName}\" on field \"${parentType.name}.${fieldDef.name}\".` +\n              didYouMean(suggestions),\n            {\n              nodes: argNode,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n/**\n * @internal\n */\n\nexport function KnownArgumentNamesOnDirectivesRule(context) {\n  const directiveArgs = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    directiveArgs[directive.name] = directive.args.map((arg) => arg.name);\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argsNodes =\n        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0\n          ? _def$arguments\n          : [];\n      directiveArgs[def.name.value] = argsNodes.map((arg) => arg.name.value);\n    }\n  }\n\n  return {\n    Directive(directiveNode) {\n      const directiveName = directiveNode.name.value;\n      const knownArgs = directiveArgs[directiveName];\n\n      if (directiveNode.arguments && knownArgs) {\n        for (const argNode of directiveNode.arguments) {\n          const argName = argNode.name.value;\n\n          if (!knownArgs.includes(argName)) {\n            const suggestions = suggestionList(argName, knownArgs);\n            context.reportError(\n              new GraphQLError(\n                `Unknown argument \"${argName}\" on directive \"@${directiveName}\".` +\n                  didYouMean(suggestions),\n                {\n                  nodes: argNode,\n                },\n              ),\n            );\n          }\n        }\n      }\n\n      return false;\n    },\n  };\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { invariant } from '../../jsutils/invariant.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { OperationTypeNode } from '../../language/ast.mjs';\nimport { DirectiveLocation } from '../../language/directiveLocation.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Known directives\n *\n * A GraphQL document is only valid if all `@directives` are known by the\n * schema and legally positioned.\n *\n * See https://spec.graphql.org/draft/#sec-Directives-Are-Defined\n */\nexport function KnownDirectivesRule(context) {\n  const locationsMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    locationsMap[directive.name] = directive.locations;\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      locationsMap[def.name.value] = def.locations.map((name) => name.value);\n    }\n  }\n\n  return {\n    Directive(node, _key, _parent, _path, ancestors) {\n      const name = node.name.value;\n      const locations = locationsMap[name];\n\n      if (!locations) {\n        context.reportError(\n          new GraphQLError(`Unknown directive \"@${name}\".`, {\n            nodes: node,\n          }),\n        );\n        return;\n      }\n\n      const candidateLocation = getDirectiveLocationForASTPath(ancestors);\n\n      if (candidateLocation && !locations.includes(candidateLocation)) {\n        context.reportError(\n          new GraphQLError(\n            `Directive \"@${name}\" may not be used on ${candidateLocation}.`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\nfunction getDirectiveLocationForASTPath(ancestors) {\n  const appliedTo = ancestors[ancestors.length - 1];\n  'kind' in appliedTo || invariant(false);\n\n  switch (appliedTo.kind) {\n    case Kind.OPERATION_DEFINITION:\n      return getDirectiveLocationForOperation(appliedTo.operation);\n\n    case Kind.FIELD:\n      return DirectiveLocation.FIELD;\n\n    case Kind.FRAGMENT_SPREAD:\n      return DirectiveLocation.FRAGMENT_SPREAD;\n\n    case Kind.INLINE_FRAGMENT:\n      return DirectiveLocation.INLINE_FRAGMENT;\n\n    case Kind.FRAGMENT_DEFINITION:\n      return DirectiveLocation.FRAGMENT_DEFINITION;\n\n    case Kind.VARIABLE_DEFINITION:\n      return DirectiveLocation.VARIABLE_DEFINITION;\n\n    case Kind.SCHEMA_DEFINITION:\n    case Kind.SCHEMA_EXTENSION:\n      return DirectiveLocation.SCHEMA;\n\n    case Kind.SCALAR_TYPE_DEFINITION:\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return DirectiveLocation.SCALAR;\n\n    case Kind.OBJECT_TYPE_DEFINITION:\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.OBJECT;\n\n    case Kind.FIELD_DEFINITION:\n      return DirectiveLocation.FIELD_DEFINITION;\n\n    case Kind.INTERFACE_TYPE_DEFINITION:\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return DirectiveLocation.INTERFACE;\n\n    case Kind.UNION_TYPE_DEFINITION:\n    case Kind.UNION_TYPE_EXTENSION:\n      return DirectiveLocation.UNION;\n\n    case Kind.ENUM_TYPE_DEFINITION:\n    case Kind.ENUM_TYPE_EXTENSION:\n      return DirectiveLocation.ENUM;\n\n    case Kind.ENUM_VALUE_DEFINITION:\n      return DirectiveLocation.ENUM_VALUE;\n\n    case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return DirectiveLocation.INPUT_OBJECT;\n\n    case Kind.INPUT_VALUE_DEFINITION: {\n      const parentNode = ancestors[ancestors.length - 3];\n      'kind' in parentNode || invariant(false);\n      return parentNode.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION\n        ? DirectiveLocation.INPUT_FIELD_DEFINITION\n        : DirectiveLocation.ARGUMENT_DEFINITION;\n    }\n    // Not reachable, all possible types have been considered.\n\n    /* c8 ignore next */\n\n    default:\n      false || invariant(false, 'Unexpected kind: ' + inspect(appliedTo.kind));\n  }\n}\n\nfunction getDirectiveLocationForOperation(operation) {\n  switch (operation) {\n    case OperationTypeNode.QUERY:\n      return DirectiveLocation.QUERY;\n\n    case OperationTypeNode.MUTATION:\n      return DirectiveLocation.MUTATION;\n\n    case OperationTypeNode.SUBSCRIPTION:\n      return DirectiveLocation.SUBSCRIPTION;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Known fragment names\n *\n * A GraphQL document is only valid if all `...Fragment` fragment spreads refer\n * to fragments defined in the same document.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-spread-target-defined\n */\nexport function KnownFragmentNamesRule(context) {\n  return {\n    FragmentSpread(node) {\n      const fragmentName = node.name.value;\n      const fragment = context.getFragment(fragmentName);\n\n      if (!fragment) {\n        context.reportError(\n          new GraphQLError(`Unknown fragment \"${fragmentName}\".`, {\n            nodes: node.name,\n          }),\n        );\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeSystemDefinitionNode,\n  isTypeSystemExtensionNode,\n} from '../../language/predicates.mjs';\nimport { introspectionTypes } from '../../type/introspection.mjs';\nimport { specifiedScalarTypes } from '../../type/scalars.mjs';\n\n/**\n * Known type names\n *\n * A GraphQL document is only valid if referenced types (specifically\n * variable definitions and fragment conditions) are defined by the type schema.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-Spread-Type-Existence\n */\nexport function KnownTypeNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypesMap = schema ? schema.getTypeMap() : Object.create(null);\n  const definedTypes = Object.create(null);\n\n  for (const def of context.getDocument().definitions) {\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = true;\n    }\n  }\n\n  const typeNames = [\n    ...Object.keys(existingTypesMap),\n    ...Object.keys(definedTypes),\n  ];\n  return {\n    NamedType(node, _1, parent, _2, ancestors) {\n      const typeName = node.name.value;\n\n      if (!existingTypesMap[typeName] && !definedTypes[typeName]) {\n        var _ancestors$;\n\n        const definitionNode =\n          (_ancestors$ = ancestors[2]) !== null && _ancestors$ !== void 0\n            ? _ancestors$\n            : parent;\n        const isSDL = definitionNode != null && isSDLNode(definitionNode);\n\n        if (isSDL && standardTypeNames.includes(typeName)) {\n          return;\n        }\n\n        const suggestedTypes = suggestionList(\n          typeName,\n          isSDL ? standardTypeNames.concat(typeNames) : typeNames,\n        );\n        context.reportError(\n          new GraphQLError(\n            `Unknown type \"${typeName}\".` + didYouMean(suggestedTypes),\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\nconst standardTypeNames = [...specifiedScalarTypes, ...introspectionTypes].map(\n  (type) => type.name,\n);\n\nfunction isSDLNode(value) {\n  return (\n    'kind' in value &&\n    (isTypeSystemDefinitionNode(value) || isTypeSystemExtensionNode(value))\n  );\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\n\n/**\n * Lone anonymous operation\n *\n * A GraphQL document is only valid if when it contains an anonymous operation\n * (the query short-hand) that it contains only that one operation definition.\n *\n * See https://spec.graphql.org/draft/#sec-Lone-Anonymous-Operation\n */\nexport function LoneAnonymousOperationRule(context) {\n  let operationCount = 0;\n  return {\n    Document(node) {\n      operationCount = node.definitions.filter(\n        (definition) => definition.kind === Kind.OPERATION_DEFINITION,\n      ).length;\n    },\n\n    OperationDefinition(node) {\n      if (!node.name && operationCount > 1) {\n        context.reportError(\n          new GraphQLError(\n            'This anonymous operation must be the only defined operation.',\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Lone Schema definition\n *\n * A GraphQL document is only valid if it contains only one schema definition.\n */\nexport function LoneSchemaDefinitionRule(context) {\n  var _ref, _ref2, _oldSchema$astNode;\n\n  const oldSchema = context.getSchema();\n  const alreadyDefined =\n    (_ref =\n      (_ref2 =\n        (_oldSchema$astNode =\n          oldSchema === null || oldSchema === void 0\n            ? void 0\n            : oldSchema.astNode) !== null && _oldSchema$astNode !== void 0\n          ? _oldSchema$astNode\n          : oldSchema === null || oldSchema === void 0\n          ? void 0\n          : oldSchema.getQueryType()) !== null && _ref2 !== void 0\n        ? _ref2\n        : oldSchema === null || oldSchema === void 0\n        ? void 0\n        : oldSchema.getMutationType()) !== null && _ref !== void 0\n      ? _ref\n      : oldSchema === null || oldSchema === void 0\n      ? void 0\n      : oldSchema.getSubscriptionType();\n  let schemaDefinitionsCount = 0;\n  return {\n    SchemaDefinition(node) {\n      if (alreadyDefined) {\n        context.reportError(\n          new GraphQLError(\n            'Cannot define a new schema within a schema extension.',\n            {\n              nodes: node,\n            },\n          ),\n        );\n        return;\n      }\n\n      if (schemaDefinitionsCount > 0) {\n        context.reportError(\n          new GraphQLError('Must provide only one schema definition.', {\n            nodes: node,\n          }),\n        );\n      }\n\n      ++schemaDefinitionsCount;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nconst MAX_LISTS_DEPTH = 3;\nexport function MaxIntrospectionDepthRule(context) {\n  /**\n   * Counts the depth of list fields in \"__Type\" recursively and\n   * returns `true` if the limit has been reached.\n   */\n  function checkDepth(node, visitedFragments = Object.create(null), depth = 0) {\n    if (node.kind === Kind.FRAGMENT_SPREAD) {\n      const fragmentName = node.name.value;\n\n      if (visitedFragments[fragmentName] === true) {\n        // Fragment cycles are handled by `NoFragmentCyclesRule`.\n        return false;\n      }\n\n      const fragment = context.getFragment(fragmentName);\n\n      if (!fragment) {\n        // Missing fragments checks are handled by `KnownFragmentNamesRule`.\n        return false;\n      } // Rather than following an immutable programming pattern which has\n      // significant memory and garbage collection overhead, we've opted to\n      // take a mutable approach for efficiency's sake. Importantly visiting a\n      // fragment twice is fine, so long as you don't do one visit inside the\n      // other.\n\n      try {\n        visitedFragments[fragmentName] = true;\n        return checkDepth(fragment, visitedFragments, depth);\n      } finally {\n        visitedFragments[fragmentName] = undefined;\n      }\n    }\n\n    if (\n      node.kind === Kind.FIELD && // check all introspection lists\n      (node.name.value === 'fields' ||\n        node.name.value === 'interfaces' ||\n        node.name.value === 'possibleTypes' ||\n        node.name.value === 'inputFields')\n    ) {\n      // eslint-disable-next-line no-param-reassign\n      depth++;\n\n      if (depth >= MAX_LISTS_DEPTH) {\n        return true;\n      }\n    } // handles fields and inline fragments\n\n    if ('selectionSet' in node && node.selectionSet) {\n      for (const child of node.selectionSet.selections) {\n        if (checkDepth(child, visitedFragments, depth)) {\n          return true;\n        }\n      }\n    }\n\n    return false;\n  }\n\n  return {\n    Field(node) {\n      if (node.name.value === '__schema' || node.name.value === '__type') {\n        if (checkDepth(node)) {\n          context.reportError(\n            new GraphQLError('Maximum introspection depth exceeded', {\n              nodes: [node],\n            }),\n          );\n          return false;\n        }\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No fragment cycles\n *\n * The graph of fragment spreads must not form any cycles including spreading itself.\n * Otherwise an operation could infinitely spread or infinitely execute on cycles in the underlying data.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-spreads-must-not-form-cycles\n */\nexport function NoFragmentCyclesRule(context) {\n  // Tracks already visited fragments to maintain O(N) and to ensure that cycles\n  // are not redundantly reported.\n  const visitedFrags = Object.create(null); // Array of AST nodes used to produce meaningful errors\n\n  const spreadPath = []; // Position in the spread path\n\n  const spreadPathIndexByName = Object.create(null);\n  return {\n    OperationDefinition: () => false,\n\n    FragmentDefinition(node) {\n      detectCycleRecursive(node);\n      return false;\n    },\n  }; // This does a straight-forward DFS to find cycles.\n  // It does not terminate when a cycle was found but continues to explore\n  // the graph to find all possible cycles.\n\n  function detectCycleRecursive(fragment) {\n    if (visitedFrags[fragment.name.value]) {\n      return;\n    }\n\n    const fragmentName = fragment.name.value;\n    visitedFrags[fragmentName] = true;\n    const spreadNodes = context.getFragmentSpreads(fragment.selectionSet);\n\n    if (spreadNodes.length === 0) {\n      return;\n    }\n\n    spreadPathIndexByName[fragmentName] = spreadPath.length;\n\n    for (const spreadNode of spreadNodes) {\n      const spreadName = spreadNode.name.value;\n      const cycleIndex = spreadPathIndexByName[spreadName];\n      spreadPath.push(spreadNode);\n\n      if (cycleIndex === undefined) {\n        const spreadFragment = context.getFragment(spreadName);\n\n        if (spreadFragment) {\n          detectCycleRecursive(spreadFragment);\n        }\n      } else {\n        const cyclePath = spreadPath.slice(cycleIndex);\n        const viaPath = cyclePath\n          .slice(0, -1)\n          .map((s) => '\"' + s.name.value + '\"')\n          .join(', ');\n        context.reportError(\n          new GraphQLError(\n            `Cannot spread fragment \"${spreadName}\" within itself` +\n              (viaPath !== '' ? ` via ${viaPath}.` : '.'),\n            {\n              nodes: cyclePath,\n            },\n          ),\n        );\n      }\n\n      spreadPath.pop();\n    }\n\n    spreadPathIndexByName[fragmentName] = undefined;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No undefined variables\n *\n * A GraphQL operation is only valid if all variables encountered, both directly\n * and via fragment spreads, are defined by that operation.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variable-Uses-Defined\n */\nexport function NoUndefinedVariablesRule(context) {\n  let variableNameDefined = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter() {\n        variableNameDefined = Object.create(null);\n      },\n\n      leave(operation) {\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node } of usages) {\n          const varName = node.name.value;\n\n          if (variableNameDefined[varName] !== true) {\n            context.reportError(\n              new GraphQLError(\n                operation.name\n                  ? `Variable \"$${varName}\" is not defined by operation \"${operation.name.value}\".`\n                  : `Variable \"$${varName}\" is not defined.`,\n                {\n                  nodes: [node, operation],\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n\n    VariableDefinition(node) {\n      variableNameDefined[node.variable.name.value] = true;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No unused fragments\n *\n * A GraphQL document is only valid if all fragment definitions are spread\n * within operations, or spread within other fragments spread within operations.\n *\n * See https://spec.graphql.org/draft/#sec-Fragments-Must-Be-Used\n */\nexport function NoUnusedFragmentsRule(context) {\n  const operationDefs = [];\n  const fragmentDefs = [];\n  return {\n    OperationDefinition(node) {\n      operationDefs.push(node);\n      return false;\n    },\n\n    FragmentDefinition(node) {\n      fragmentDefs.push(node);\n      return false;\n    },\n\n    Document: {\n      leave() {\n        const fragmentNameUsed = Object.create(null);\n\n        for (const operation of operationDefs) {\n          for (const fragment of context.getRecursivelyReferencedFragments(\n            operation,\n          )) {\n            fragmentNameUsed[fragment.name.value] = true;\n          }\n        }\n\n        for (const fragmentDef of fragmentDefs) {\n          const fragName = fragmentDef.name.value;\n\n          if (fragmentNameUsed[fragName] !== true) {\n            context.reportError(\n              new GraphQLError(`Fragment \"${fragName}\" is never used.`, {\n                nodes: fragmentDef,\n              }),\n            );\n          }\n        }\n      },\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * No unused variables\n *\n * A GraphQL operation is only valid if all variables defined by an operation\n * are used, either directly or within a spread fragment.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variables-Used\n */\nexport function NoUnusedVariablesRule(context) {\n  let variableDefs = [];\n  return {\n    OperationDefinition: {\n      enter() {\n        variableDefs = [];\n      },\n\n      leave(operation) {\n        const variableNameUsed = Object.create(null);\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node } of usages) {\n          variableNameUsed[node.name.value] = true;\n        }\n\n        for (const variableDef of variableDefs) {\n          const variableName = variableDef.variable.name.value;\n\n          if (variableNameUsed[variableName] !== true) {\n            context.reportError(\n              new GraphQLError(\n                operation.name\n                  ? `Variable \"$${variableName}\" is never used in operation \"${operation.name.value}\".`\n                  : `Variable \"$${variableName}\" is never used.`,\n                {\n                  nodes: variableDef,\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n\n    VariableDefinition(def) {\n      variableDefs.push(def);\n    },\n  };\n}\n","import { naturalCompare } from '../jsutils/naturalCompare.mjs';\nimport { Kind } from '../language/kinds.mjs';\n/**\n * Sort ValueNode.\n *\n * This function returns a sorted copy of the given ValueNode.\n *\n * @internal\n */\n\nexport function sortValueNode(valueNode) {\n  switch (valueNode.kind) {\n    case Kind.OBJECT:\n      return { ...valueNode, fields: sortFields(valueNode.fields) };\n\n    case Kind.LIST:\n      return { ...valueNode, values: valueNode.values.map(sortValueNode) };\n\n    case Kind.INT:\n    case Kind.FLOAT:\n    case Kind.STRING:\n    case Kind.BOOLEAN:\n    case Kind.NULL:\n    case Kind.ENUM:\n    case Kind.VARIABLE:\n      return valueNode;\n  }\n}\n\nfunction sortFields(fields) {\n  return fields\n    .map((fieldNode) => ({\n      ...fieldNode,\n      value: sortValueNode(fieldNode.value),\n    }))\n    .sort((fieldA, fieldB) =>\n      naturalCompare(fieldA.name.value, fieldB.name.value),\n    );\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport {\n  getNamedType,\n  isInterfaceType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n} from '../../type/definition.mjs';\nimport { sortValueNode } from '../../utilities/sortValueNode.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\nfunction reasonMessage(reason) {\n  if (Array.isArray(reason)) {\n    return reason\n      .map(\n        ([responseName, subReason]) =>\n          `subfields \"${responseName}\" conflict because ` +\n          reasonMessage(subReason),\n      )\n      .join(' and ');\n  }\n\n  return reason;\n}\n/**\n * Overlapping fields can be merged\n *\n * A selection set is only valid if all fields (including spreading any\n * fragments) either correspond to distinct response names or can be merged\n * without ambiguity.\n *\n * See https://spec.graphql.org/draft/#sec-Field-Selection-Merging\n */\n\nexport function OverlappingFieldsCanBeMergedRule(context) {\n  // A memoization for when fields and a fragment or two fragments are compared\n  // \"between\" each other for conflicts. Comparisons made be made many times,\n  // so memoizing this can dramatically improve the performance of this validator.\n  const comparedFieldsAndFragmentPairs = new OrderedPairSet();\n  const comparedFragmentPairs = new PairSet(); // A cache for the \"field map\" and list of fragment names found in any given\n  // selection set. Selection sets may be asked for this information multiple\n  // times, so this improves the performance of this validator.\n\n  const cachedFieldsAndFragmentNames = new Map();\n  return {\n    SelectionSet(selectionSet) {\n      const conflicts = findConflictsWithinSelectionSet(\n        context,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        context.getParentType(),\n        selectionSet,\n      );\n\n      for (const [[responseName, reason], fields1, fields2] of conflicts) {\n        const reasonMsg = reasonMessage(reason);\n        context.reportError(\n          new GraphQLError(\n            `Fields \"${responseName}\" conflict because ${reasonMsg}. Use different aliases on the fields to fetch both if this was intentional.`,\n            {\n              nodes: fields1.concat(fields2),\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\n/**\n * Algorithm:\n *\n * Conflicts occur when two fields exist in a query which will produce the same\n * response name, but represent differing values, thus creating a conflict.\n * The algorithm below finds all conflicts via making a series of comparisons\n * between fields. In order to compare as few fields as possible, this makes\n * a series of comparisons \"within\" sets of fields and \"between\" sets of fields.\n *\n * Given any selection set, a collection produces both a set of fields by\n * also including all inline fragments, as well as a list of fragments\n * referenced by fragment spreads.\n *\n * A) Each selection set represented in the document first compares \"within\" its\n * collected set of fields, finding any conflicts between every pair of\n * overlapping fields.\n * Note: This is the *only time* that a the fields \"within\" a set are compared\n * to each other. After this only fields \"between\" sets are compared.\n *\n * B) Also, if any fragment is referenced in a selection set, then a\n * comparison is made \"between\" the original set of fields and the\n * referenced fragment.\n *\n * C) Also, if multiple fragments are referenced, then comparisons\n * are made \"between\" each referenced fragment.\n *\n * D) When comparing \"between\" a set of fields and a referenced fragment, first\n * a comparison is made between each field in the original set of fields and\n * each field in the the referenced set of fields.\n *\n * E) Also, if any fragment is referenced in the referenced selection set,\n * then a comparison is made \"between\" the original set of fields and the\n * referenced fragment (recursively referring to step D).\n *\n * F) When comparing \"between\" two fragments, first a comparison is made between\n * each field in the first referenced set of fields and each field in the the\n * second referenced set of fields.\n *\n * G) Also, any fragments referenced by the first must be compared to the\n * second, and any fragments referenced by the second must be compared to the\n * first (recursively referring to step F).\n *\n * H) When comparing two fields, if both have selection sets, then a comparison\n * is made \"between\" both selection sets, first comparing the set of fields in\n * the first selection set with the set of fields in the second.\n *\n * I) Also, if any fragment is referenced in either selection set, then a\n * comparison is made \"between\" the other set of fields and the\n * referenced fragment.\n *\n * J) Also, if two fragments are referenced in both selection sets, then a\n * comparison is made \"between\" the two fragments.\n *\n */\n// Find all conflicts found \"within\" a selection set, including those found\n// via spreading in fragments. Called when visiting each SelectionSet in the\n// GraphQL Document.\nfunction findConflictsWithinSelectionSet(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentType,\n  selectionSet,\n) {\n  const conflicts = [];\n  const [fieldMap, fragmentNames] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType,\n    selectionSet,\n  ); // (A) Find find all conflicts \"within\" the fields of this selection set.\n  // Note: this is the *only place* `collectConflictsWithin` is called.\n\n  collectConflictsWithin(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    fieldMap,\n  );\n\n  if (fragmentNames.length !== 0) {\n    // (B) Then collect conflicts between these fields and those represented by\n    // each spread fragment name found.\n    for (let i = 0; i < fragmentNames.length; i++) {\n      collectConflictsBetweenFieldsAndFragment(\n        context,\n        conflicts,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        false,\n        fieldMap,\n        fragmentNames[i],\n      ); // (C) Then compare this fragment with all other fragments found in this\n      // selection set to collect conflicts between fragments spread together.\n      // This compares each item in the list of fragment names to every other\n      // item in that same list (except for itself).\n\n      for (let j = i + 1; j < fragmentNames.length; j++) {\n        collectConflictsBetweenFragments(\n          context,\n          conflicts,\n          cachedFieldsAndFragmentNames,\n          comparedFieldsAndFragmentPairs,\n          comparedFragmentPairs,\n          false,\n          fragmentNames[i],\n          fragmentNames[j],\n        );\n      }\n    }\n  }\n\n  return conflicts;\n} // Collect all conflicts found between a set of fields and a fragment reference\n// including via spreading in any nested fragments.\n\nfunction collectConflictsBetweenFieldsAndFragment(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  fieldMap,\n  fragmentName,\n) {\n  // Memoize so the fields and fragments are not compared for conflicts more\n  // than once.\n  if (\n    comparedFieldsAndFragmentPairs.has(\n      fieldMap,\n      fragmentName,\n      areMutuallyExclusive,\n    )\n  ) {\n    return;\n  }\n\n  comparedFieldsAndFragmentPairs.add(\n    fieldMap,\n    fragmentName,\n    areMutuallyExclusive,\n  );\n  const fragment = context.getFragment(fragmentName);\n\n  if (!fragment) {\n    return;\n  }\n\n  const [fieldMap2, referencedFragmentNames] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment,\n    ); // Do not compare a fragment's fieldMap to itself.\n\n  if (fieldMap === fieldMap2) {\n    return;\n  } // (D) First collect any conflicts between the provided collection of fields\n  // and the collection of fields represented by the given fragment.\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap,\n    fieldMap2,\n  ); // (E) Then collect any conflicts between the provided collection of fields\n  // and any fragment names found in the given fragment.\n\n  for (const referencedFragmentName of referencedFragmentNames) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap,\n      referencedFragmentName,\n    );\n  }\n} // Collect all conflicts found between two fragments, including via spreading in\n// any nested fragments.\n\nfunction collectConflictsBetweenFragments(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  fragmentName1,\n  fragmentName2,\n) {\n  // No need to compare a fragment to itself.\n  if (fragmentName1 === fragmentName2) {\n    return;\n  } // Memoize so two fragments are not compared for conflicts more than once.\n\n  if (\n    comparedFragmentPairs.has(\n      fragmentName1,\n      fragmentName2,\n      areMutuallyExclusive,\n    )\n  ) {\n    return;\n  }\n\n  comparedFragmentPairs.add(fragmentName1, fragmentName2, areMutuallyExclusive);\n  const fragment1 = context.getFragment(fragmentName1);\n  const fragment2 = context.getFragment(fragmentName2);\n\n  if (!fragment1 || !fragment2) {\n    return;\n  }\n\n  const [fieldMap1, referencedFragmentNames1] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment1,\n    );\n  const [fieldMap2, referencedFragmentNames2] =\n    getReferencedFieldsAndFragmentNames(\n      context,\n      cachedFieldsAndFragmentNames,\n      fragment2,\n    ); // (F) First, collect all conflicts between these two collections of fields\n  // (not including any nested fragments).\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap1,\n    fieldMap2,\n  ); // (G) Then collect conflicts between the first fragment and any nested\n  // fragments spread in the second fragment.\n\n  for (const referencedFragmentName2 of referencedFragmentNames2) {\n    collectConflictsBetweenFragments(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fragmentName1,\n      referencedFragmentName2,\n    );\n  } // (G) Then collect conflicts between the second fragment and any nested\n  // fragments spread in the first fragment.\n\n  for (const referencedFragmentName1 of referencedFragmentNames1) {\n    collectConflictsBetweenFragments(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      referencedFragmentName1,\n      fragmentName2,\n    );\n  }\n} // Find all conflicts found between two selection sets, including those found\n// via spreading in fragments. Called when determining if conflicts exist\n// between the sub-fields of two overlapping fields.\n\nfunction findConflictsBetweenSubSelectionSets(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  areMutuallyExclusive,\n  parentType1,\n  selectionSet1,\n  parentType2,\n  selectionSet2,\n) {\n  const conflicts = [];\n  const [fieldMap1, fragmentNames1] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType1,\n    selectionSet1,\n  );\n  const [fieldMap2, fragmentNames2] = getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    parentType2,\n    selectionSet2,\n  ); // (H) First, collect all conflicts between these two collections of field.\n\n  collectConflictsBetween(\n    context,\n    conflicts,\n    cachedFieldsAndFragmentNames,\n    comparedFieldsAndFragmentPairs,\n    comparedFragmentPairs,\n    areMutuallyExclusive,\n    fieldMap1,\n    fieldMap2,\n  ); // (I) Then collect conflicts between the first collection of fields and\n  // those referenced by each fragment name associated with the second.\n\n  for (const fragmentName2 of fragmentNames2) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap1,\n      fragmentName2,\n    );\n  } // (I) Then collect conflicts between the second collection of fields and\n  // those referenced by each fragment name associated with the first.\n\n  for (const fragmentName1 of fragmentNames1) {\n    collectConflictsBetweenFieldsAndFragment(\n      context,\n      conflicts,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      fieldMap2,\n      fragmentName1,\n    );\n  } // (J) Also collect conflicts between any fragment names by the first and\n  // fragment names by the second. This compares each item in the first set of\n  // names to each item in the second set of names.\n\n  for (const fragmentName1 of fragmentNames1) {\n    for (const fragmentName2 of fragmentNames2) {\n      collectConflictsBetweenFragments(\n        context,\n        conflicts,\n        cachedFieldsAndFragmentNames,\n        comparedFieldsAndFragmentPairs,\n        comparedFragmentPairs,\n        areMutuallyExclusive,\n        fragmentName1,\n        fragmentName2,\n      );\n    }\n  }\n\n  return conflicts;\n} // Collect all Conflicts \"within\" one collection of fields.\n\nfunction collectConflictsWithin(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  fieldMap,\n) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For every response name, if there are multiple fields, they\n  // must be compared to find a potential conflict.\n  for (const [responseName, fields] of Object.entries(fieldMap)) {\n    // This compares every field in the list to every other field in this list\n    // (except to itself). If the list only has one item, nothing needs to\n    // be compared.\n    if (fields.length > 1) {\n      for (let i = 0; i < fields.length; i++) {\n        for (let j = i + 1; j < fields.length; j++) {\n          const conflict = findConflict(\n            context,\n            cachedFieldsAndFragmentNames,\n            comparedFieldsAndFragmentPairs,\n            comparedFragmentPairs,\n            false, // within one collection is never mutually exclusive\n            responseName,\n            fields[i],\n            fields[j],\n          );\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Collect all Conflicts between two collections of fields. This is similar to,\n// but different from the `collectConflictsWithin` function above. This check\n// assumes that `collectConflictsWithin` has already been called on each\n// provided collection of fields. This is true because this validator traverses\n// each individual selection set.\n\nfunction collectConflictsBetween(\n  context,\n  conflicts,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentFieldsAreMutuallyExclusive,\n  fieldMap1,\n  fieldMap2,\n) {\n  // A field map is a keyed collection, where each key represents a response\n  // name and the value at that key is a list of all fields which provide that\n  // response name. For any response name which appears in both provided field\n  // maps, each field from the first field map must be compared to every field\n  // in the second field map to find potential conflicts.\n  for (const [responseName, fields1] of Object.entries(fieldMap1)) {\n    const fields2 = fieldMap2[responseName];\n\n    if (fields2) {\n      for (const field1 of fields1) {\n        for (const field2 of fields2) {\n          const conflict = findConflict(\n            context,\n            cachedFieldsAndFragmentNames,\n            comparedFieldsAndFragmentPairs,\n            comparedFragmentPairs,\n            parentFieldsAreMutuallyExclusive,\n            responseName,\n            field1,\n            field2,\n          );\n\n          if (conflict) {\n            conflicts.push(conflict);\n          }\n        }\n      }\n    }\n  }\n} // Determines if there is a conflict between two particular fields, including\n// comparing their sub-fields.\n\nfunction findConflict(\n  context,\n  cachedFieldsAndFragmentNames,\n  comparedFieldsAndFragmentPairs,\n  comparedFragmentPairs,\n  parentFieldsAreMutuallyExclusive,\n  responseName,\n  field1,\n  field2,\n) {\n  const [parentType1, node1, def1] = field1;\n  const [parentType2, node2, def2] = field2; // If it is known that two fields could not possibly apply at the same\n  // time, due to the parent types, then it is safe to permit them to diverge\n  // in aliased field or arguments used as they will not present any ambiguity\n  // by differing.\n  // It is known that two parent types could never overlap if they are\n  // different Object types. Interface or Union types might overlap - if not\n  // in the current state of the schema, then perhaps in some future version,\n  // thus may not safely diverge.\n\n  const areMutuallyExclusive =\n    parentFieldsAreMutuallyExclusive ||\n    (parentType1 !== parentType2 &&\n      isObjectType(parentType1) &&\n      isObjectType(parentType2));\n\n  if (!areMutuallyExclusive) {\n    // Two aliases must refer to the same field.\n    const name1 = node1.name.value;\n    const name2 = node2.name.value;\n\n    if (name1 !== name2) {\n      return [\n        [responseName, `\"${name1}\" and \"${name2}\" are different fields`],\n        [node1],\n        [node2],\n      ];\n    } // Two field calls must have the same arguments.\n\n    if (!sameArguments(node1, node2)) {\n      return [\n        [responseName, 'they have differing arguments'],\n        [node1],\n        [node2],\n      ];\n    }\n  } // The return type for each field.\n\n  const type1 = def1 === null || def1 === void 0 ? void 0 : def1.type;\n  const type2 = def2 === null || def2 === void 0 ? void 0 : def2.type;\n\n  if (type1 && type2 && doTypesConflict(type1, type2)) {\n    return [\n      [\n        responseName,\n        `they return conflicting types \"${inspect(type1)}\" and \"${inspect(\n          type2,\n        )}\"`,\n      ],\n      [node1],\n      [node2],\n    ];\n  } // Collect and compare sub-fields. Use the same \"visited fragment names\" list\n  // for both collections so fields in a fragment reference are never\n  // compared to themselves.\n\n  const selectionSet1 = node1.selectionSet;\n  const selectionSet2 = node2.selectionSet;\n\n  if (selectionSet1 && selectionSet2) {\n    const conflicts = findConflictsBetweenSubSelectionSets(\n      context,\n      cachedFieldsAndFragmentNames,\n      comparedFieldsAndFragmentPairs,\n      comparedFragmentPairs,\n      areMutuallyExclusive,\n      getNamedType(type1),\n      selectionSet1,\n      getNamedType(type2),\n      selectionSet2,\n    );\n    return subfieldConflicts(conflicts, responseName, node1, node2);\n  }\n}\n\nfunction sameArguments(node1, node2) {\n  const args1 = node1.arguments;\n  const args2 = node2.arguments;\n\n  if (args1 === undefined || args1.length === 0) {\n    return args2 === undefined || args2.length === 0;\n  }\n\n  if (args2 === undefined || args2.length === 0) {\n    return false;\n  }\n  /* c8 ignore next */\n\n  if (args1.length !== args2.length) {\n    /* c8 ignore next */\n    return false;\n    /* c8 ignore next */\n  }\n\n  const values2 = new Map(args2.map(({ name, value }) => [name.value, value]));\n  return args1.every((arg1) => {\n    const value1 = arg1.value;\n    const value2 = values2.get(arg1.name.value);\n\n    if (value2 === undefined) {\n      return false;\n    }\n\n    return stringifyValue(value1) === stringifyValue(value2);\n  });\n}\n\nfunction stringifyValue(value) {\n  return print(sortValueNode(value));\n} // Two types conflict if both types could not apply to a value simultaneously.\n// Composite types are ignored as their individual field types will be compared\n// later recursively. However List and Non-Null types must match.\n\nfunction doTypesConflict(type1, type2) {\n  if (isListType(type1)) {\n    return isListType(type2)\n      ? doTypesConflict(type1.ofType, type2.ofType)\n      : true;\n  }\n\n  if (isListType(type2)) {\n    return true;\n  }\n\n  if (isNonNullType(type1)) {\n    return isNonNullType(type2)\n      ? doTypesConflict(type1.ofType, type2.ofType)\n      : true;\n  }\n\n  if (isNonNullType(type2)) {\n    return true;\n  }\n\n  if (isLeafType(type1) || isLeafType(type2)) {\n    return type1 !== type2;\n  }\n\n  return false;\n} // Given a selection set, return the collection of fields (a mapping of response\n// name to field nodes and definitions) as well as a list of fragment names\n// referenced via fragment spreads.\n\nfunction getFieldsAndFragmentNames(\n  context,\n  cachedFieldsAndFragmentNames,\n  parentType,\n  selectionSet,\n) {\n  const cached = cachedFieldsAndFragmentNames.get(selectionSet);\n\n  if (cached) {\n    return cached;\n  }\n\n  const nodeAndDefs = Object.create(null);\n  const fragmentNames = Object.create(null);\n\n  _collectFieldsAndFragmentNames(\n    context,\n    parentType,\n    selectionSet,\n    nodeAndDefs,\n    fragmentNames,\n  );\n\n  const result = [nodeAndDefs, Object.keys(fragmentNames)];\n  cachedFieldsAndFragmentNames.set(selectionSet, result);\n  return result;\n} // Given a reference to a fragment, return the represented collection of fields\n// as well as a list of nested fragment names referenced via fragment spreads.\n\nfunction getReferencedFieldsAndFragmentNames(\n  context,\n  cachedFieldsAndFragmentNames,\n  fragment,\n) {\n  // Short-circuit building a type from the node if possible.\n  const cached = cachedFieldsAndFragmentNames.get(fragment.selectionSet);\n\n  if (cached) {\n    return cached;\n  }\n\n  const fragmentType = typeFromAST(context.getSchema(), fragment.typeCondition);\n  return getFieldsAndFragmentNames(\n    context,\n    cachedFieldsAndFragmentNames,\n    fragmentType,\n    fragment.selectionSet,\n  );\n}\n\nfunction _collectFieldsAndFragmentNames(\n  context,\n  parentType,\n  selectionSet,\n  nodeAndDefs,\n  fragmentNames,\n) {\n  for (const selection of selectionSet.selections) {\n    switch (selection.kind) {\n      case Kind.FIELD: {\n        const fieldName = selection.name.value;\n        let fieldDef;\n\n        if (isObjectType(parentType) || isInterfaceType(parentType)) {\n          fieldDef = parentType.getFields()[fieldName];\n        }\n\n        const responseName = selection.alias\n          ? selection.alias.value\n          : fieldName;\n\n        if (!nodeAndDefs[responseName]) {\n          nodeAndDefs[responseName] = [];\n        }\n\n        nodeAndDefs[responseName].push([parentType, selection, fieldDef]);\n        break;\n      }\n\n      case Kind.FRAGMENT_SPREAD:\n        fragmentNames[selection.name.value] = true;\n        break;\n\n      case Kind.INLINE_FRAGMENT: {\n        const typeCondition = selection.typeCondition;\n        const inlineFragmentType = typeCondition\n          ? typeFromAST(context.getSchema(), typeCondition)\n          : parentType;\n\n        _collectFieldsAndFragmentNames(\n          context,\n          inlineFragmentType,\n          selection.selectionSet,\n          nodeAndDefs,\n          fragmentNames,\n        );\n\n        break;\n      }\n    }\n  }\n} // Given a series of Conflicts which occurred between two sub-fields, generate\n// a single Conflict.\n\nfunction subfieldConflicts(conflicts, responseName, node1, node2) {\n  if (conflicts.length > 0) {\n    return [\n      [responseName, conflicts.map(([reason]) => reason)],\n      [node1, ...conflicts.map(([, fields1]) => fields1).flat()],\n      [node2, ...conflicts.map(([, , fields2]) => fields2).flat()],\n    ];\n  }\n}\n/**\n * A way to keep track of pairs of things where the ordering of the pair\n * matters.\n *\n * Provides a third argument for has/set to allow flagging the pair as\n * weakly or strongly present within the collection.\n */\n\nclass OrderedPairSet {\n  constructor() {\n    this._data = new Map();\n  }\n\n  has(a, b, weaklyPresent) {\n    var _this$_data$get;\n\n    const result =\n      (_this$_data$get = this._data.get(a)) === null ||\n      _this$_data$get === void 0\n        ? void 0\n        : _this$_data$get.get(b);\n\n    if (result === undefined) {\n      return false;\n    }\n\n    return weaklyPresent ? true : weaklyPresent === result;\n  }\n\n  add(a, b, weaklyPresent) {\n    const map = this._data.get(a);\n\n    if (map === undefined) {\n      this._data.set(a, new Map([[b, weaklyPresent]]));\n    } else {\n      map.set(b, weaklyPresent);\n    }\n  }\n}\n/**\n * A way to keep track of pairs of similar things when the ordering of the pair\n * does not matter.\n */\n\nclass PairSet {\n  constructor() {\n    this._orderedPairSet = new OrderedPairSet();\n  }\n\n  has(a, b, weaklyPresent) {\n    return a < b\n      ? this._orderedPairSet.has(a, b, weaklyPresent)\n      : this._orderedPairSet.has(b, a, weaklyPresent);\n  }\n\n  add(a, b, weaklyPresent) {\n    if (a < b) {\n      this._orderedPairSet.add(a, b, weaklyPresent);\n    } else {\n      this._orderedPairSet.add(b, a, weaklyPresent);\n    }\n  }\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { isCompositeType } from '../../type/definition.mjs';\nimport { doTypesOverlap } from '../../utilities/typeComparators.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Possible fragment spread\n *\n * A fragment spread is only valid if the type condition could ever possibly\n * be true: if there is a non-empty intersection of the possible parent types,\n * and possible types which pass the type condition.\n */\nexport function PossibleFragmentSpreadsRule(context) {\n  return {\n    InlineFragment(node) {\n      const fragType = context.getType();\n      const parentType = context.getParentType();\n\n      if (\n        isCompositeType(fragType) &&\n        isCompositeType(parentType) &&\n        !doTypesOverlap(context.getSchema(), fragType, parentType)\n      ) {\n        const parentTypeStr = inspect(parentType);\n        const fragTypeStr = inspect(fragType);\n        context.reportError(\n          new GraphQLError(\n            `Fragment cannot be spread here as objects of type \"${parentTypeStr}\" can never be of type \"${fragTypeStr}\".`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    FragmentSpread(node) {\n      const fragName = node.name.value;\n      const fragType = getFragmentType(context, fragName);\n      const parentType = context.getParentType();\n\n      if (\n        fragType &&\n        parentType &&\n        !doTypesOverlap(context.getSchema(), fragType, parentType)\n      ) {\n        const parentTypeStr = inspect(parentType);\n        const fragTypeStr = inspect(fragType);\n        context.reportError(\n          new GraphQLError(\n            `Fragment \"${fragName}\" cannot be spread here as objects of type \"${parentTypeStr}\" can never be of type \"${fragTypeStr}\".`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n\nfunction getFragmentType(context, name) {\n  const frag = context.getFragment(name);\n\n  if (frag) {\n    const type = typeFromAST(context.getSchema(), frag.typeCondition);\n\n    if (isCompositeType(type)) {\n      return type;\n    }\n  }\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { inspect } from '../../jsutils/inspect.mjs';\nimport { invariant } from '../../jsutils/invariant.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { isTypeDefinitionNode } from '../../language/predicates.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../../type/definition.mjs';\n\n/**\n * Possible type extension\n *\n * A type extension is only valid if the type is defined and has the same kind.\n */\nexport function PossibleTypeExtensionsRule(context) {\n  const schema = context.getSchema();\n  const definedTypes = Object.create(null);\n\n  for (const def of context.getDocument().definitions) {\n    if (isTypeDefinitionNode(def)) {\n      definedTypes[def.name.value] = def;\n    }\n  }\n\n  return {\n    ScalarTypeExtension: checkExtension,\n    ObjectTypeExtension: checkExtension,\n    InterfaceTypeExtension: checkExtension,\n    UnionTypeExtension: checkExtension,\n    EnumTypeExtension: checkExtension,\n    InputObjectTypeExtension: checkExtension,\n  };\n\n  function checkExtension(node) {\n    const typeName = node.name.value;\n    const defNode = definedTypes[typeName];\n    const existingType =\n      schema === null || schema === void 0 ? void 0 : schema.getType(typeName);\n    let expectedKind;\n\n    if (defNode) {\n      expectedKind = defKindToExtKind[defNode.kind];\n    } else if (existingType) {\n      expectedKind = typeToExtKind(existingType);\n    }\n\n    if (expectedKind) {\n      if (expectedKind !== node.kind) {\n        const kindStr = extensionKindToTypeName(node.kind);\n        context.reportError(\n          new GraphQLError(`Cannot extend non-${kindStr} type \"${typeName}\".`, {\n            nodes: defNode ? [defNode, node] : node,\n          }),\n        );\n      }\n    } else {\n      const allTypeNames = Object.keys({\n        ...definedTypes,\n        ...(schema === null || schema === void 0\n          ? void 0\n          : schema.getTypeMap()),\n      });\n      const suggestedTypes = suggestionList(typeName, allTypeNames);\n      context.reportError(\n        new GraphQLError(\n          `Cannot extend type \"${typeName}\" because it is not defined.` +\n            didYouMean(suggestedTypes),\n          {\n            nodes: node.name,\n          },\n        ),\n      );\n    }\n  }\n}\nconst defKindToExtKind = {\n  [Kind.SCALAR_TYPE_DEFINITION]: Kind.SCALAR_TYPE_EXTENSION,\n  [Kind.OBJECT_TYPE_DEFINITION]: Kind.OBJECT_TYPE_EXTENSION,\n  [Kind.INTERFACE_TYPE_DEFINITION]: Kind.INTERFACE_TYPE_EXTENSION,\n  [Kind.UNION_TYPE_DEFINITION]: Kind.UNION_TYPE_EXTENSION,\n  [Kind.ENUM_TYPE_DEFINITION]: Kind.ENUM_TYPE_EXTENSION,\n  [Kind.INPUT_OBJECT_TYPE_DEFINITION]: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n};\n\nfunction typeToExtKind(type) {\n  if (isScalarType(type)) {\n    return Kind.SCALAR_TYPE_EXTENSION;\n  }\n\n  if (isObjectType(type)) {\n    return Kind.OBJECT_TYPE_EXTENSION;\n  }\n\n  if (isInterfaceType(type)) {\n    return Kind.INTERFACE_TYPE_EXTENSION;\n  }\n\n  if (isUnionType(type)) {\n    return Kind.UNION_TYPE_EXTENSION;\n  }\n\n  if (isEnumType(type)) {\n    return Kind.ENUM_TYPE_EXTENSION;\n  }\n\n  if (isInputObjectType(type)) {\n    return Kind.INPUT_OBJECT_TYPE_EXTENSION;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable. All possible types have been considered\n\n  false || invariant(false, 'Unexpected type: ' + inspect(type));\n}\n\nfunction extensionKindToTypeName(kind) {\n  switch (kind) {\n    case Kind.SCALAR_TYPE_EXTENSION:\n      return 'scalar';\n\n    case Kind.OBJECT_TYPE_EXTENSION:\n      return 'object';\n\n    case Kind.INTERFACE_TYPE_EXTENSION:\n      return 'interface';\n\n    case Kind.UNION_TYPE_EXTENSION:\n      return 'union';\n\n    case Kind.ENUM_TYPE_EXTENSION:\n      return 'enum';\n\n    case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n      return 'input object';\n    // Not reachable. All possible types have been considered\n\n    /* c8 ignore next */\n\n    default:\n      false || invariant(false, 'Unexpected kind: ' + inspect(kind));\n  }\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { keyMap } from '../../jsutils/keyMap.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isRequiredArgument, isType } from '../../type/definition.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Provided required arguments\n *\n * A field or directive is only valid if all required (non-null without a\n * default value) field arguments have been provided.\n */\nexport function ProvidedRequiredArgumentsRule(context) {\n  return {\n    // eslint-disable-next-line new-cap\n    ...ProvidedRequiredArgumentsOnDirectivesRule(context),\n    Field: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave(fieldNode) {\n        var _fieldNode$arguments;\n\n        const fieldDef = context.getFieldDef();\n\n        if (!fieldDef) {\n          return false;\n        }\n\n        const providedArgs = new Set( // FIXME: https://github.com/graphql/graphql-js/issues/2203\n          /* c8 ignore next */\n          (_fieldNode$arguments = fieldNode.arguments) === null ||\n          _fieldNode$arguments === void 0\n            ? void 0\n            : _fieldNode$arguments.map((arg) => arg.name.value),\n        );\n\n        for (const argDef of fieldDef.args) {\n          if (!providedArgs.has(argDef.name) && isRequiredArgument(argDef)) {\n            const argTypeStr = inspect(argDef.type);\n            context.reportError(\n              new GraphQLError(\n                `Field \"${fieldDef.name}\" argument \"${argDef.name}\" of type \"${argTypeStr}\" is required, but it was not provided.`,\n                {\n                  nodes: fieldNode,\n                },\n              ),\n            );\n          }\n        }\n      },\n    },\n  };\n}\n/**\n * @internal\n */\n\nexport function ProvidedRequiredArgumentsOnDirectivesRule(context) {\n  var _schema$getDirectives;\n\n  const requiredArgsMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives =\n    (_schema$getDirectives =\n      schema === null || schema === void 0\n        ? void 0\n        : schema.getDirectives()) !== null && _schema$getDirectives !== void 0\n      ? _schema$getDirectives\n      : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    requiredArgsMap[directive.name] = keyMap(\n      directive.args.filter(isRequiredArgument),\n      (arg) => arg.name,\n    );\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      var _def$arguments;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argNodes =\n        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0\n          ? _def$arguments\n          : [];\n      requiredArgsMap[def.name.value] = keyMap(\n        argNodes.filter(isRequiredArgumentNode),\n        (arg) => arg.name.value,\n      );\n    }\n  }\n\n  return {\n    Directive: {\n      // Validate on leave to allow for deeper errors to appear first.\n      leave(directiveNode) {\n        const directiveName = directiveNode.name.value;\n        const requiredArgs = requiredArgsMap[directiveName];\n\n        if (requiredArgs) {\n          var _directiveNode$argume;\n\n          // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n          /* c8 ignore next */\n          const argNodes =\n            (_directiveNode$argume = directiveNode.arguments) !== null &&\n            _directiveNode$argume !== void 0\n              ? _directiveNode$argume\n              : [];\n          const argNodeMap = new Set(argNodes.map((arg) => arg.name.value));\n\n          for (const [argName, argDef] of Object.entries(requiredArgs)) {\n            if (!argNodeMap.has(argName)) {\n              const argType = isType(argDef.type)\n                ? inspect(argDef.type)\n                : print(argDef.type);\n              context.reportError(\n                new GraphQLError(\n                  `Directive \"@${directiveName}\" argument \"${argName}\" of type \"${argType}\" is required, but it was not provided.`,\n                  {\n                    nodes: directiveNode,\n                  },\n                ),\n              );\n            }\n          }\n        }\n      },\n    },\n  };\n}\n\nfunction isRequiredArgumentNode(arg) {\n  return arg.type.kind === Kind.NON_NULL_TYPE && arg.defaultValue == null;\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { getNamedType, isLeafType } from '../../type/definition.mjs';\n\n/**\n * Scalar leafs\n *\n * A GraphQL document is valid only if all leaf fields (fields without\n * sub selections) are of scalar or enum types.\n */\nexport function ScalarLeafsRule(context) {\n  return {\n    Field(node) {\n      const type = context.getType();\n      const selectionSet = node.selectionSet;\n\n      if (type) {\n        if (isLeafType(getNamedType(type))) {\n          if (selectionSet) {\n            const fieldName = node.name.value;\n            const typeStr = inspect(type);\n            context.reportError(\n              new GraphQLError(\n                `Field \"${fieldName}\" must not have a selection since type \"${typeStr}\" has no subfields.`,\n                {\n                  nodes: selectionSet,\n                },\n              ),\n            );\n          }\n        } else if (!selectionSet) {\n          const fieldName = node.name.value;\n          const typeStr = inspect(type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${fieldName}\" of type \"${typeStr}\" must have a selection of subfields. Did you mean \"${fieldName} { ... }\"?`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        } else if (selectionSet.selections.length === 0) {\n          const fieldName = node.name.value;\n          const typeStr = inspect(type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${fieldName}\" of type \"${typeStr}\" must have at least one field selected.`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n","/**\n * Build a string describing the path.\n */\nexport function printPathArray(path) {\n  return path\n    .map((key) =>\n      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,\n    )\n    .join('');\n}\n","/**\n * Given a Path and a key, return a new Path containing the new key.\n */\nexport function addPath(prev, key, typename) {\n  return {\n    prev,\n    key,\n    typename,\n  };\n}\n/**\n * Given a Path, return an Array of the path keys.\n */\n\nexport function pathToArray(path) {\n  const flattened = [];\n  let curr = path;\n\n  while (curr) {\n    flattened.push(curr.key);\n    curr = curr.prev;\n  }\n\n  return flattened.reverse();\n}\n","import { didYouMean } from '../jsutils/didYouMean.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isIterableObject } from '../jsutils/isIterableObject.mjs';\nimport { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { addPath, pathToArray } from '../jsutils/Path.mjs';\nimport { printPathArray } from '../jsutils/printPathArray.mjs';\nimport { suggestionList } from '../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport {\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\n\n/**\n * Coerces a JavaScript value given a GraphQL Input Type.\n */\nexport function coerceInputValue(inputValue, type, onError = defaultOnError) {\n  return coerceInputValueImpl(inputValue, type, onError, undefined);\n}\n\nfunction defaultOnError(path, invalidValue, error) {\n  let errorPrefix = 'Invalid value ' + inspect(invalidValue);\n\n  if (path.length > 0) {\n    errorPrefix += ` at \"value${printPathArray(path)}\"`;\n  }\n\n  error.message = errorPrefix + ': ' + error.message;\n  throw error;\n}\n\nfunction coerceInputValueImpl(inputValue, type, onError, path) {\n  if (isNonNullType(type)) {\n    if (inputValue != null) {\n      return coerceInputValueImpl(inputValue, type.ofType, onError, path);\n    }\n\n    onError(\n      pathToArray(path),\n      inputValue,\n      new GraphQLError(\n        `Expected non-nullable type \"${inspect(type)}\" not to be null.`,\n      ),\n    );\n    return;\n  }\n\n  if (inputValue == null) {\n    // Explicitly return the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (isIterableObject(inputValue)) {\n      return Array.from(inputValue, (itemValue, index) => {\n        const itemPath = addPath(path, index, undefined);\n        return coerceInputValueImpl(itemValue, itemType, onError, itemPath);\n      });\n    } // Lists accept a non-list value as a list of one.\n\n    return [coerceInputValueImpl(inputValue, itemType, onError, path)];\n  }\n\n  if (isInputObjectType(type)) {\n    if (!isObjectLike(inputValue) || Array.isArray(inputValue)) {\n      onError(\n        pathToArray(path),\n        inputValue,\n        new GraphQLError(`Expected type \"${type.name}\" to be an object.`),\n      );\n      return;\n    }\n\n    const coercedValue = {};\n    const fieldDefs = type.getFields();\n\n    for (const field of Object.values(fieldDefs)) {\n      const fieldValue = inputValue[field.name];\n\n      if (fieldValue === undefined) {\n        if (field.defaultValue !== undefined) {\n          coercedValue[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          const typeStr = inspect(field.type);\n          onError(\n            pathToArray(path),\n            inputValue,\n            new GraphQLError(\n              `Field \"${field.name}\" of required type \"${typeStr}\" was not provided.`,\n            ),\n          );\n        }\n\n        continue;\n      }\n\n      coercedValue[field.name] = coerceInputValueImpl(\n        fieldValue,\n        field.type,\n        onError,\n        addPath(path, field.name, type.name),\n      );\n    } // Ensure every provided field is defined.\n\n    for (const fieldName of Object.keys(inputValue)) {\n      if (!fieldDefs[fieldName]) {\n        const suggestions = suggestionList(\n          fieldName,\n          Object.keys(type.getFields()),\n        );\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(\n            `Field \"${fieldName}\" is not defined by type \"${type.name}\".` +\n              didYouMean(suggestions),\n          ),\n        );\n      }\n    }\n\n    if (type.isOneOf) {\n      const keys = Object.keys(coercedValue);\n\n      if (keys.length !== 1) {\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(\n            `Exactly one key must be specified for OneOf type \"${type.name}\".`,\n          ),\n        );\n      }\n\n      const key = keys[0];\n      const value = coercedValue[key];\n\n      if (value === null) {\n        onError(\n          pathToArray(path).concat(key),\n          value,\n          new GraphQLError(`Field \"${key}\" must be non-null.`),\n        );\n      }\n    }\n\n    return coercedValue;\n  }\n\n  if (isLeafType(type)) {\n    let parseResult; // Scalars and Enums determine if a input value is valid via parseValue(),\n    // which can throw to indicate failure. If it throws, maintain a reference\n    // to the original error.\n\n    try {\n      parseResult = type.parseValue(inputValue);\n    } catch (error) {\n      if (error instanceof GraphQLError) {\n        onError(pathToArray(path), inputValue, error);\n      } else {\n        onError(\n          pathToArray(path),\n          inputValue,\n          new GraphQLError(`Expected type \"${type.name}\". ` + error.message, {\n            originalError: error,\n          }),\n        );\n      }\n\n      return;\n    }\n\n    if (parseResult === undefined) {\n      onError(\n        pathToArray(path),\n        inputValue,\n        new GraphQLError(`Expected type \"${type.name}\".`),\n      );\n    }\n\n    return parseResult;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n} from '../type/definition.mjs';\n/**\n * Produces a JavaScript value given a GraphQL Value AST.\n *\n * A GraphQL type must be provided, which will be used to interpret different\n * GraphQL Value literals.\n *\n * Returns `undefined` when the value could not be validly coerced according to\n * the provided type.\n *\n * | GraphQL Value        | JSON Value    |\n * | -------------------- | ------------- |\n * | Input Object         | Object        |\n * | List                 | Array         |\n * | Boolean              | Boolean       |\n * | String               | String        |\n * | Int / Float          | Number        |\n * | Enum Value           | Unknown       |\n * | NullValue            | null          |\n *\n */\n\nexport function valueFromAST(valueNode, type, variables) {\n  if (!valueNode) {\n    // When there is no node, then there is also no value.\n    // Importantly, this is different from returning the value null.\n    return;\n  }\n\n  if (valueNode.kind === Kind.VARIABLE) {\n    const variableName = valueNode.name.value;\n\n    if (variables == null || variables[variableName] === undefined) {\n      // No valid return value.\n      return;\n    }\n\n    const variableValue = variables[variableName];\n\n    if (variableValue === null && isNonNullType(type)) {\n      return; // Invalid: intentionally return no value.\n    } // Note: This does no further checking that this variable is correct.\n    // This assumes that this query has been validated and the variable\n    // usage here is of the correct type.\n\n    return variableValue;\n  }\n\n  if (isNonNullType(type)) {\n    if (valueNode.kind === Kind.NULL) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return valueFromAST(valueNode, type.ofType, variables);\n  }\n\n  if (valueNode.kind === Kind.NULL) {\n    // This is explicitly returning the value null.\n    return null;\n  }\n\n  if (isListType(type)) {\n    const itemType = type.ofType;\n\n    if (valueNode.kind === Kind.LIST) {\n      const coercedValues = [];\n\n      for (const itemNode of valueNode.values) {\n        if (isMissingVariable(itemNode, variables)) {\n          // If an array contains a missing variable, it is either coerced to\n          // null or if the item type is non-null, it considered invalid.\n          if (isNonNullType(itemType)) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(null);\n        } else {\n          const itemValue = valueFromAST(itemNode, itemType, variables);\n\n          if (itemValue === undefined) {\n            return; // Invalid: intentionally return no value.\n          }\n\n          coercedValues.push(itemValue);\n        }\n      }\n\n      return coercedValues;\n    }\n\n    const coercedValue = valueFromAST(valueNode, itemType, variables);\n\n    if (coercedValue === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return [coercedValue];\n  }\n\n  if (isInputObjectType(type)) {\n    if (valueNode.kind !== Kind.OBJECT) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    const coercedObj = Object.create(null);\n    const fieldNodes = keyMap(valueNode.fields, (field) => field.name.value);\n\n    for (const field of Object.values(type.getFields())) {\n      const fieldNode = fieldNodes[field.name];\n\n      if (!fieldNode || isMissingVariable(fieldNode.value, variables)) {\n        if (field.defaultValue !== undefined) {\n          coercedObj[field.name] = field.defaultValue;\n        } else if (isNonNullType(field.type)) {\n          return; // Invalid: intentionally return no value.\n        }\n\n        continue;\n      }\n\n      const fieldValue = valueFromAST(fieldNode.value, field.type, variables);\n\n      if (fieldValue === undefined) {\n        return; // Invalid: intentionally return no value.\n      }\n\n      coercedObj[field.name] = fieldValue;\n    }\n\n    if (type.isOneOf) {\n      const keys = Object.keys(coercedObj);\n\n      if (keys.length !== 1) {\n        return; // Invalid: not exactly one key, intentionally return no value.\n      }\n\n      if (coercedObj[keys[0]] === null) {\n        return; // Invalid: value not non-null, intentionally return no value.\n      }\n    }\n\n    return coercedObj;\n  }\n\n  if (isLeafType(type)) {\n    // Scalars and Enums fulfill parsing a literal value via parseLiteral().\n    // Invalid values represent a failure to parse correctly, in which case\n    // no value is returned.\n    let result;\n\n    try {\n      result = type.parseLiteral(valueNode, variables);\n    } catch (_error) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    if (result === undefined) {\n      return; // Invalid: intentionally return no value.\n    }\n\n    return result;\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible input types have been considered.\n\n  false || invariant(false, 'Unexpected input type: ' + inspect(type));\n} // Returns true if the provided valueNode is a variable which is not defined\n// in the set of variables.\n\nfunction isMissingVariable(valueNode, variables) {\n  return (\n    valueNode.kind === Kind.VARIABLE &&\n    (variables == null || variables[valueNode.name.value] === undefined)\n  );\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { printPathArray } from '../jsutils/printPathArray.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport { isInputType, isNonNullType } from '../type/definition.mjs';\nimport { coerceInputValue } from '../utilities/coerceInputValue.mjs';\nimport { typeFromAST } from '../utilities/typeFromAST.mjs';\nimport { valueFromAST } from '../utilities/valueFromAST.mjs';\n\n/**\n * Prepares an object map of variableValues of the correct type based on the\n * provided variable definitions and arbitrary input. If the input cannot be\n * parsed to match the variable definitions, a GraphQLError will be thrown.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\nexport function getVariableValues(schema, varDefNodes, inputs, options) {\n  const errors = [];\n  const maxErrors =\n    options === null || options === void 0 ? void 0 : options.maxErrors;\n\n  try {\n    const coerced = coerceVariableValues(\n      schema,\n      varDefNodes,\n      inputs,\n      (error) => {\n        if (maxErrors != null && errors.length >= maxErrors) {\n          throw new GraphQLError(\n            'Too many errors processing variables, error limit reached. Execution aborted.',\n          );\n        }\n\n        errors.push(error);\n      },\n    );\n\n    if (errors.length === 0) {\n      return {\n        coerced,\n      };\n    }\n  } catch (error) {\n    errors.push(error);\n  }\n\n  return {\n    errors,\n  };\n}\n\nfunction coerceVariableValues(schema, varDefNodes, inputs, onError) {\n  const coercedValues = {};\n\n  for (const varDefNode of varDefNodes) {\n    const varName = varDefNode.variable.name.value;\n    const varType = typeFromAST(schema, varDefNode.type);\n\n    if (!isInputType(varType)) {\n      // Must use input types for variables. This should be caught during\n      // validation, however is checked again here for safety.\n      const varTypeStr = print(varDefNode.type);\n      onError(\n        new GraphQLError(\n          `Variable \"$${varName}\" expected value of type \"${varTypeStr}\" which cannot be used as an input type.`,\n          {\n            nodes: varDefNode.type,\n          },\n        ),\n      );\n      continue;\n    }\n\n    if (!hasOwnProperty(inputs, varName)) {\n      if (varDefNode.defaultValue) {\n        coercedValues[varName] = valueFromAST(varDefNode.defaultValue, varType);\n      } else if (isNonNullType(varType)) {\n        const varTypeStr = inspect(varType);\n        onError(\n          new GraphQLError(\n            `Variable \"$${varName}\" of required type \"${varTypeStr}\" was not provided.`,\n            {\n              nodes: varDefNode,\n            },\n          ),\n        );\n      }\n\n      continue;\n    }\n\n    const value = inputs[varName];\n\n    if (value === null && isNonNullType(varType)) {\n      const varTypeStr = inspect(varType);\n      onError(\n        new GraphQLError(\n          `Variable \"$${varName}\" of non-null type \"${varTypeStr}\" must not be null.`,\n          {\n            nodes: varDefNode,\n          },\n        ),\n      );\n      continue;\n    }\n\n    coercedValues[varName] = coerceInputValue(\n      value,\n      varType,\n      (path, invalidValue, error) => {\n        let prefix =\n          `Variable \"$${varName}\" got invalid value ` + inspect(invalidValue);\n\n        if (path.length > 0) {\n          prefix += ` at \"${varName}${printPathArray(path)}\"`;\n        }\n\n        onError(\n          new GraphQLError(prefix + '; ' + error.message, {\n            nodes: varDefNode,\n            originalError: error,\n          }),\n        );\n      },\n    );\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a list of argument\n * definitions and list of argument AST nodes.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\n\nexport function getArgumentValues(def, node, variableValues) {\n  var _node$arguments;\n\n  const coercedValues = {}; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n  /* c8 ignore next */\n\n  const argumentNodes =\n    (_node$arguments = node.arguments) !== null && _node$arguments !== void 0\n      ? _node$arguments\n      : [];\n  const argNodeMap = keyMap(argumentNodes, (arg) => arg.name.value);\n\n  for (const argDef of def.args) {\n    const name = argDef.name;\n    const argType = argDef.type;\n    const argumentNode = argNodeMap[name];\n\n    if (!argumentNode) {\n      if (argDef.defaultValue !== undefined) {\n        coercedValues[name] = argDef.defaultValue;\n      } else if (isNonNullType(argType)) {\n        throw new GraphQLError(\n          `Argument \"${name}\" of required type \"${inspect(argType)}\" ` +\n            'was not provided.',\n          {\n            nodes: node,\n          },\n        );\n      }\n\n      continue;\n    }\n\n    const valueNode = argumentNode.value;\n    let isNull = valueNode.kind === Kind.NULL;\n\n    if (valueNode.kind === Kind.VARIABLE) {\n      const variableName = valueNode.name.value;\n\n      if (\n        variableValues == null ||\n        !hasOwnProperty(variableValues, variableName)\n      ) {\n        if (argDef.defaultValue !== undefined) {\n          coercedValues[name] = argDef.defaultValue;\n        } else if (isNonNullType(argType)) {\n          throw new GraphQLError(\n            `Argument \"${name}\" of required type \"${inspect(argType)}\" ` +\n              `was provided the variable \"$${variableName}\" which was not provided a runtime value.`,\n            {\n              nodes: valueNode,\n            },\n          );\n        }\n\n        continue;\n      }\n\n      isNull = variableValues[variableName] == null;\n    }\n\n    if (isNull && isNonNullType(argType)) {\n      throw new GraphQLError(\n        `Argument \"${name}\" of non-null type \"${inspect(argType)}\" ` +\n          'must not be null.',\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    const coercedValue = valueFromAST(valueNode, argType, variableValues);\n\n    if (coercedValue === undefined) {\n      // Note: ValuesOfCorrectTypeRule validation should catch this before\n      // execution. This is a runtime check to ensure execution does not\n      // continue with an invalid argument value.\n      throw new GraphQLError(\n        `Argument \"${name}\" has invalid value ${print(valueNode)}.`,\n        {\n          nodes: valueNode,\n        },\n      );\n    }\n\n    coercedValues[name] = coercedValue;\n  }\n\n  return coercedValues;\n}\n/**\n * Prepares an object map of argument values given a directive definition\n * and a AST node which may contain directives. Optionally also accepts a map\n * of variable values.\n *\n * If the directive does not exist on the node, returns undefined.\n *\n * Note: The returned value is a plain Object with a prototype, since it is\n * exposed to user code. Care should be taken to not pull values from the\n * Object prototype.\n */\n\nexport function getDirectiveValues(directiveDef, node, variableValues) {\n  var _node$directives;\n\n  const directiveNode =\n    (_node$directives = node.directives) === null || _node$directives === void 0\n      ? void 0\n      : _node$directives.find(\n          (directive) => directive.name.value === directiveDef.name,\n        );\n\n  if (directiveNode) {\n    return getArgumentValues(directiveDef, directiveNode, variableValues);\n  }\n}\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n","import { Kind } from '../language/kinds.mjs';\nimport { isAbstractType } from '../type/definition.mjs';\nimport {\n  GraphQLIncludeDirective,\n  GraphQLSkipDirective,\n} from '../type/directives.mjs';\nimport { typeFromAST } from '../utilities/typeFromAST.mjs';\nimport { getDirectiveValues } from './values.mjs';\n/**\n * Given a selectionSet, collects all of the fields and returns them.\n *\n * CollectFields requires the \"runtime type\" of an object. For a field that\n * returns an Interface or Union type, the \"runtime type\" will be the actual\n * object type returned by that field.\n *\n * @internal\n */\n\nexport function collectFields(\n  schema,\n  fragments,\n  variableValues,\n  runtimeType,\n  selectionSet,\n) {\n  const fields = new Map();\n  collectFieldsImpl(\n    schema,\n    fragments,\n    variableValues,\n    runtimeType,\n    selectionSet,\n    fields,\n    new Set(),\n  );\n  return fields;\n}\n/**\n * Given an array of field nodes, collects all of the subfields of the passed\n * in fields, and returns them at the end.\n *\n * CollectSubFields requires the \"return type\" of an object. For a field that\n * returns an Interface or Union type, the \"return type\" will be the actual\n * object type returned by that field.\n *\n * @internal\n */\n\nexport function collectSubfields(\n  schema,\n  fragments,\n  variableValues,\n  returnType,\n  fieldNodes,\n) {\n  const subFieldNodes = new Map();\n  const visitedFragmentNames = new Set();\n\n  for (const node of fieldNodes) {\n    if (node.selectionSet) {\n      collectFieldsImpl(\n        schema,\n        fragments,\n        variableValues,\n        returnType,\n        node.selectionSet,\n        subFieldNodes,\n        visitedFragmentNames,\n      );\n    }\n  }\n\n  return subFieldNodes;\n}\n\nfunction collectFieldsImpl(\n  schema,\n  fragments,\n  variableValues,\n  runtimeType,\n  selectionSet,\n  fields,\n  visitedFragmentNames,\n) {\n  for (const selection of selectionSet.selections) {\n    switch (selection.kind) {\n      case Kind.FIELD: {\n        if (!shouldIncludeNode(variableValues, selection)) {\n          continue;\n        }\n\n        const name = getFieldEntryKey(selection);\n        const fieldList = fields.get(name);\n\n        if (fieldList !== undefined) {\n          fieldList.push(selection);\n        } else {\n          fields.set(name, [selection]);\n        }\n\n        break;\n      }\n\n      case Kind.INLINE_FRAGMENT: {\n        if (\n          !shouldIncludeNode(variableValues, selection) ||\n          !doesFragmentConditionMatch(schema, selection, runtimeType)\n        ) {\n          continue;\n        }\n\n        collectFieldsImpl(\n          schema,\n          fragments,\n          variableValues,\n          runtimeType,\n          selection.selectionSet,\n          fields,\n          visitedFragmentNames,\n        );\n        break;\n      }\n\n      case Kind.FRAGMENT_SPREAD: {\n        const fragName = selection.name.value;\n\n        if (\n          visitedFragmentNames.has(fragName) ||\n          !shouldIncludeNode(variableValues, selection)\n        ) {\n          continue;\n        }\n\n        visitedFragmentNames.add(fragName);\n        const fragment = fragments[fragName];\n\n        if (\n          !fragment ||\n          !doesFragmentConditionMatch(schema, fragment, runtimeType)\n        ) {\n          continue;\n        }\n\n        collectFieldsImpl(\n          schema,\n          fragments,\n          variableValues,\n          runtimeType,\n          fragment.selectionSet,\n          fields,\n          visitedFragmentNames,\n        );\n        break;\n      }\n    }\n  }\n}\n/**\n * Determines if a field should be included based on the `@include` and `@skip`\n * directives, where `@skip` has higher precedence than `@include`.\n */\n\nfunction shouldIncludeNode(variableValues, node) {\n  const skip = getDirectiveValues(GraphQLSkipDirective, node, variableValues);\n\n  if ((skip === null || skip === void 0 ? void 0 : skip.if) === true) {\n    return false;\n  }\n\n  const include = getDirectiveValues(\n    GraphQLIncludeDirective,\n    node,\n    variableValues,\n  );\n\n  if (\n    (include === null || include === void 0 ? void 0 : include.if) === false\n  ) {\n    return false;\n  }\n\n  return true;\n}\n/**\n * Determines if a fragment is applicable to the given type.\n */\n\nfunction doesFragmentConditionMatch(schema, fragment, type) {\n  const typeConditionNode = fragment.typeCondition;\n\n  if (!typeConditionNode) {\n    return true;\n  }\n\n  const conditionalType = typeFromAST(schema, typeConditionNode);\n\n  if (conditionalType === type) {\n    return true;\n  }\n\n  if (isAbstractType(conditionalType)) {\n    return schema.isSubType(conditionalType, type);\n  }\n\n  return false;\n}\n/**\n * Implements the logic to compute the key of a given field's entry\n */\n\nfunction getFieldEntryKey(node) {\n  return node.alias ? node.alias.value : node.name.value;\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { collectFields } from '../../execution/collectFields.mjs';\n\n/**\n * Subscriptions must only include a non-introspection field.\n *\n * A GraphQL subscription is valid only if it contains a single root field and\n * that root field is not an introspection field.\n *\n * See https://spec.graphql.org/draft/#sec-Single-root-field\n */\nexport function SingleFieldSubscriptionsRule(context) {\n  return {\n    OperationDefinition(node) {\n      if (node.operation === 'subscription') {\n        const schema = context.getSchema();\n        const subscriptionType = schema.getSubscriptionType();\n\n        if (subscriptionType) {\n          const operationName = node.name ? node.name.value : null;\n          const variableValues = Object.create(null);\n          const document = context.getDocument();\n          const fragments = Object.create(null);\n\n          for (const definition of document.definitions) {\n            if (definition.kind === Kind.FRAGMENT_DEFINITION) {\n              fragments[definition.name.value] = definition;\n            }\n          }\n\n          const fields = collectFields(\n            schema,\n            fragments,\n            variableValues,\n            subscriptionType,\n            node.selectionSet,\n          );\n\n          if (fields.size > 1) {\n            const fieldSelectionLists = [...fields.values()];\n            const extraFieldSelectionLists = fieldSelectionLists.slice(1);\n            const extraFieldSelections = extraFieldSelectionLists.flat();\n            context.reportError(\n              new GraphQLError(\n                operationName != null\n                  ? `Subscription \"${operationName}\" must select only one top level field.`\n                  : 'Anonymous Subscription must select only one top level field.',\n                {\n                  nodes: extraFieldSelections,\n                },\n              ),\n            );\n          }\n\n          for (const fieldNodes of fields.values()) {\n            const field = fieldNodes[0];\n            const fieldName = field.name.value;\n\n            if (fieldName.startsWith('__')) {\n              context.reportError(\n                new GraphQLError(\n                  operationName != null\n                    ? `Subscription \"${operationName}\" must not select an introspection top level field.`\n                    : 'Anonymous Subscription must not select an introspection top level field.',\n                  {\n                    nodes: fieldNodes,\n                  },\n                ),\n              );\n            }\n          }\n        }\n      }\n    },\n  };\n}\n","/**\n * Groups array items into a Map, given a function to produce grouping key.\n */\nexport function groupBy(list, keyFn) {\n  const result = new Map();\n\n  for (const item of list) {\n    const key = keyFn(item);\n    const group = result.get(key);\n\n    if (group === undefined) {\n      result.set(key, [item]);\n    } else {\n      group.push(item);\n    }\n  }\n\n  return result;\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique argument definition names\n *\n * A GraphQL Object or Interface type is only valid if all its fields have uniquely named arguments.\n * A GraphQL Directive is only valid if all its arguments are uniquely named.\n */\nexport function UniqueArgumentDefinitionNamesRule(context) {\n  return {\n    DirectiveDefinition(directiveNode) {\n      var _directiveNode$argume;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const argumentNodes =\n        (_directiveNode$argume = directiveNode.arguments) !== null &&\n        _directiveNode$argume !== void 0\n          ? _directiveNode$argume\n          : [];\n      return checkArgUniqueness(`@${directiveNode.name.value}`, argumentNodes);\n    },\n\n    InterfaceTypeDefinition: checkArgUniquenessPerField,\n    InterfaceTypeExtension: checkArgUniquenessPerField,\n    ObjectTypeDefinition: checkArgUniquenessPerField,\n    ObjectTypeExtension: checkArgUniquenessPerField,\n  };\n\n  function checkArgUniquenessPerField(typeNode) {\n    var _typeNode$fields;\n\n    const typeName = typeNode.name.value; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const fieldNodes =\n      (_typeNode$fields = typeNode.fields) !== null &&\n      _typeNode$fields !== void 0\n        ? _typeNode$fields\n        : [];\n\n    for (const fieldDef of fieldNodes) {\n      var _fieldDef$arguments;\n\n      const fieldName = fieldDef.name.value; // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n\n      const argumentNodes =\n        (_fieldDef$arguments = fieldDef.arguments) !== null &&\n        _fieldDef$arguments !== void 0\n          ? _fieldDef$arguments\n          : [];\n      checkArgUniqueness(`${typeName}.${fieldName}`, argumentNodes);\n    }\n\n    return false;\n  }\n\n  function checkArgUniqueness(parentName, argumentNodes) {\n    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);\n\n    for (const [argName, argNodes] of seenArgs) {\n      if (argNodes.length > 1) {\n        context.reportError(\n          new GraphQLError(\n            `Argument \"${parentName}(${argName}:)\" can only be defined once.`,\n            {\n              nodes: argNodes.map((node) => node.name),\n            },\n          ),\n        );\n      }\n    }\n\n    return false;\n  }\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique argument names\n *\n * A GraphQL field or directive is only valid if all supplied arguments are\n * uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Argument-Names\n */\nexport function UniqueArgumentNamesRule(context) {\n  return {\n    Field: checkArgUniqueness,\n    Directive: checkArgUniqueness,\n  };\n\n  function checkArgUniqueness(parentNode) {\n    var _parentNode$arguments;\n\n    // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n    const argumentNodes =\n      (_parentNode$arguments = parentNode.arguments) !== null &&\n      _parentNode$arguments !== void 0\n        ? _parentNode$arguments\n        : [];\n    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);\n\n    for (const [argName, argNodes] of seenArgs) {\n      if (argNodes.length > 1) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one argument named \"${argName}\".`,\n            {\n              nodes: argNodes.map((node) => node.name),\n            },\n          ),\n        );\n      }\n    }\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique directive names\n *\n * A GraphQL document is only valid if all defined directives have unique names.\n */\nexport function UniqueDirectiveNamesRule(context) {\n  const knownDirectiveNames = Object.create(null);\n  const schema = context.getSchema();\n  return {\n    DirectiveDefinition(node) {\n      const directiveName = node.name.value;\n\n      if (\n        schema !== null &&\n        schema !== void 0 &&\n        schema.getDirective(directiveName)\n      ) {\n        context.reportError(\n          new GraphQLError(\n            `Directive \"@${directiveName}\" already exists in the schema. It cannot be redefined.`,\n            {\n              nodes: node.name,\n            },\n          ),\n        );\n        return;\n      }\n\n      if (knownDirectiveNames[directiveName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one directive named \"@${directiveName}\".`,\n            {\n              nodes: [knownDirectiveNames[directiveName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownDirectiveNames[directiveName] = node.name;\n      }\n\n      return false;\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeExtensionNode,\n} from '../../language/predicates.mjs';\nimport { specifiedDirectives } from '../../type/directives.mjs';\n\n/**\n * Unique directive names per location\n *\n * A GraphQL document is only valid if all non-repeatable directives at\n * a given location are uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Directives-Are-Unique-Per-Location\n */\nexport function UniqueDirectivesPerLocationRule(context) {\n  const uniqueDirectiveMap = Object.create(null);\n  const schema = context.getSchema();\n  const definedDirectives = schema\n    ? schema.getDirectives()\n    : specifiedDirectives;\n\n  for (const directive of definedDirectives) {\n    uniqueDirectiveMap[directive.name] = !directive.isRepeatable;\n  }\n\n  const astDefinitions = context.getDocument().definitions;\n\n  for (const def of astDefinitions) {\n    if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      uniqueDirectiveMap[def.name.value] = !def.repeatable;\n    }\n  }\n\n  const schemaDirectives = Object.create(null);\n  const typeDirectivesMap = Object.create(null);\n  return {\n    // Many different AST nodes may contain directives. Rather than listing\n    // them all, just listen for entering any node, and check to see if it\n    // defines any directives.\n    enter(node) {\n      if (!('directives' in node) || !node.directives) {\n        return;\n      }\n\n      let seenDirectives;\n\n      if (\n        node.kind === Kind.SCHEMA_DEFINITION ||\n        node.kind === Kind.SCHEMA_EXTENSION\n      ) {\n        seenDirectives = schemaDirectives;\n      } else if (isTypeDefinitionNode(node) || isTypeExtensionNode(node)) {\n        const typeName = node.name.value;\n        seenDirectives = typeDirectivesMap[typeName];\n\n        if (seenDirectives === undefined) {\n          typeDirectivesMap[typeName] = seenDirectives = Object.create(null);\n        }\n      } else {\n        seenDirectives = Object.create(null);\n      }\n\n      for (const directive of node.directives) {\n        const directiveName = directive.name.value;\n\n        if (uniqueDirectiveMap[directiveName]) {\n          if (seenDirectives[directiveName]) {\n            context.reportError(\n              new GraphQLError(\n                `The directive \"@${directiveName}\" can only be used once at this location.`,\n                {\n                  nodes: [seenDirectives[directiveName], directive],\n                },\n              ),\n            );\n          } else {\n            seenDirectives[directiveName] = directive;\n          }\n        }\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { isEnumType } from '../../type/definition.mjs';\n\n/**\n * Unique enum value names\n *\n * A GraphQL enum type is only valid if all its values are uniquely named.\n */\nexport function UniqueEnumValueNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  const knownValueNames = Object.create(null);\n  return {\n    EnumTypeDefinition: checkValueUniqueness,\n    EnumTypeExtension: checkValueUniqueness,\n  };\n\n  function checkValueUniqueness(node) {\n    var _node$values;\n\n    const typeName = node.name.value;\n\n    if (!knownValueNames[typeName]) {\n      knownValueNames[typeName] = Object.create(null);\n    } // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const valueNodes =\n      (_node$values = node.values) !== null && _node$values !== void 0\n        ? _node$values\n        : [];\n    const valueNames = knownValueNames[typeName];\n\n    for (const valueDef of valueNodes) {\n      const valueName = valueDef.name.value;\n      const existingType = existingTypeMap[typeName];\n\n      if (isEnumType(existingType) && existingType.getValue(valueName)) {\n        context.reportError(\n          new GraphQLError(\n            `Enum value \"${typeName}.${valueName}\" already exists in the schema. It cannot also be defined in this type extension.`,\n            {\n              nodes: valueDef.name,\n            },\n          ),\n        );\n      } else if (valueNames[valueName]) {\n        context.reportError(\n          new GraphQLError(\n            `Enum value \"${typeName}.${valueName}\" can only be defined once.`,\n            {\n              nodes: [valueNames[valueName], valueDef.name],\n            },\n          ),\n        );\n      } else {\n        valueNames[valueName] = valueDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport {\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n} from '../../type/definition.mjs';\n\n/**\n * Unique field definition names\n *\n * A GraphQL complex type is only valid if all its fields are uniquely named.\n */\nexport function UniqueFieldDefinitionNamesRule(context) {\n  const schema = context.getSchema();\n  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);\n  const knownFieldNames = Object.create(null);\n  return {\n    InputObjectTypeDefinition: checkFieldUniqueness,\n    InputObjectTypeExtension: checkFieldUniqueness,\n    InterfaceTypeDefinition: checkFieldUniqueness,\n    InterfaceTypeExtension: checkFieldUniqueness,\n    ObjectTypeDefinition: checkFieldUniqueness,\n    ObjectTypeExtension: checkFieldUniqueness,\n  };\n\n  function checkFieldUniqueness(node) {\n    var _node$fields;\n\n    const typeName = node.name.value;\n\n    if (!knownFieldNames[typeName]) {\n      knownFieldNames[typeName] = Object.create(null);\n    } // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n\n    const fieldNodes =\n      (_node$fields = node.fields) !== null && _node$fields !== void 0\n        ? _node$fields\n        : [];\n    const fieldNames = knownFieldNames[typeName];\n\n    for (const fieldDef of fieldNodes) {\n      const fieldName = fieldDef.name.value;\n\n      if (hasField(existingTypeMap[typeName], fieldName)) {\n        context.reportError(\n          new GraphQLError(\n            `Field \"${typeName}.${fieldName}\" already exists in the schema. It cannot also be defined in this type extension.`,\n            {\n              nodes: fieldDef.name,\n            },\n          ),\n        );\n      } else if (fieldNames[fieldName]) {\n        context.reportError(\n          new GraphQLError(\n            `Field \"${typeName}.${fieldName}\" can only be defined once.`,\n            {\n              nodes: [fieldNames[fieldName], fieldDef.name],\n            },\n          ),\n        );\n      } else {\n        fieldNames[fieldName] = fieldDef.name;\n      }\n    }\n\n    return false;\n  }\n}\n\nfunction hasField(type, fieldName) {\n  if (isObjectType(type) || isInterfaceType(type) || isInputObjectType(type)) {\n    return type.getFields()[fieldName] != null;\n  }\n\n  return false;\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique fragment names\n *\n * A GraphQL document is only valid if all defined fragments have unique names.\n *\n * See https://spec.graphql.org/draft/#sec-Fragment-Name-Uniqueness\n */\nexport function UniqueFragmentNamesRule(context) {\n  const knownFragmentNames = Object.create(null);\n  return {\n    OperationDefinition: () => false,\n\n    FragmentDefinition(node) {\n      const fragmentName = node.name.value;\n\n      if (knownFragmentNames[fragmentName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one fragment named \"${fragmentName}\".`,\n            {\n              nodes: [knownFragmentNames[fragmentName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownFragmentNames[fragmentName] = node.name;\n      }\n\n      return false;\n    },\n  };\n}\n","import { invariant } from '../../jsutils/invariant.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique input field names\n *\n * A GraphQL input object value is only valid if all supplied fields are\n * uniquely named.\n *\n * See https://spec.graphql.org/draft/#sec-Input-Object-Field-Uniqueness\n */\nexport function UniqueInputFieldNamesRule(context) {\n  const knownNameStack = [];\n  let knownNames = Object.create(null);\n  return {\n    ObjectValue: {\n      enter() {\n        knownNameStack.push(knownNames);\n        knownNames = Object.create(null);\n      },\n\n      leave() {\n        const prevKnownNames = knownNameStack.pop();\n        prevKnownNames || invariant(false);\n        knownNames = prevKnownNames;\n      },\n    },\n\n    ObjectField(node) {\n      const fieldName = node.name.value;\n\n      if (knownNames[fieldName]) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one input field named \"${fieldName}\".`,\n            {\n              nodes: [knownNames[fieldName], node.name],\n            },\n          ),\n        );\n      } else {\n        knownNames[fieldName] = node.name;\n      }\n    },\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique operation names\n *\n * A GraphQL document is only valid if all defined operations have unique names.\n *\n * See https://spec.graphql.org/draft/#sec-Operation-Name-Uniqueness\n */\nexport function UniqueOperationNamesRule(context) {\n  const knownOperationNames = Object.create(null);\n  return {\n    OperationDefinition(node) {\n      const operationName = node.name;\n\n      if (operationName) {\n        if (knownOperationNames[operationName.value]) {\n          context.reportError(\n            new GraphQLError(\n              `There can be only one operation named \"${operationName.value}\".`,\n              {\n                nodes: [\n                  knownOperationNames[operationName.value],\n                  operationName,\n                ],\n              },\n            ),\n          );\n        } else {\n          knownOperationNames[operationName.value] = operationName;\n        }\n      }\n\n      return false;\n    },\n\n    FragmentDefinition: () => false,\n  };\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique operation types\n *\n * A GraphQL document is only valid if it has only one type per operation.\n */\nexport function UniqueOperationTypesRule(context) {\n  const schema = context.getSchema();\n  const definedOperationTypes = Object.create(null);\n  const existingOperationTypes = schema\n    ? {\n        query: schema.getQueryType(),\n        mutation: schema.getMutationType(),\n        subscription: schema.getSubscriptionType(),\n      }\n    : {};\n  return {\n    SchemaDefinition: checkOperationTypes,\n    SchemaExtension: checkOperationTypes,\n  };\n\n  function checkOperationTypes(node) {\n    var _node$operationTypes;\n\n    // See: https://github.com/graphql/graphql-js/issues/2203\n\n    /* c8 ignore next */\n    const operationTypesNodes =\n      (_node$operationTypes = node.operationTypes) !== null &&\n      _node$operationTypes !== void 0\n        ? _node$operationTypes\n        : [];\n\n    for (const operationType of operationTypesNodes) {\n      const operation = operationType.operation;\n      const alreadyDefinedOperationType = definedOperationTypes[operation];\n\n      if (existingOperationTypes[operation]) {\n        context.reportError(\n          new GraphQLError(\n            `Type for ${operation} already defined in the schema. It cannot be redefined.`,\n            {\n              nodes: operationType,\n            },\n          ),\n        );\n      } else if (alreadyDefinedOperationType) {\n        context.reportError(\n          new GraphQLError(\n            `There can be only one ${operation} type in schema.`,\n            {\n              nodes: [alreadyDefinedOperationType, operationType],\n            },\n          ),\n        );\n      } else {\n        definedOperationTypes[operation] = operationType;\n      }\n    }\n\n    return false;\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique type names\n *\n * A GraphQL document is only valid if all defined types have unique names.\n */\nexport function UniqueTypeNamesRule(context) {\n  const knownTypeNames = Object.create(null);\n  const schema = context.getSchema();\n  return {\n    ScalarTypeDefinition: checkTypeName,\n    ObjectTypeDefinition: checkTypeName,\n    InterfaceTypeDefinition: checkTypeName,\n    UnionTypeDefinition: checkTypeName,\n    EnumTypeDefinition: checkTypeName,\n    InputObjectTypeDefinition: checkTypeName,\n  };\n\n  function checkTypeName(node) {\n    const typeName = node.name.value;\n\n    if (schema !== null && schema !== void 0 && schema.getType(typeName)) {\n      context.reportError(\n        new GraphQLError(\n          `Type \"${typeName}\" already exists in the schema. It cannot also be defined in this type definition.`,\n          {\n            nodes: node.name,\n          },\n        ),\n      );\n      return;\n    }\n\n    if (knownTypeNames[typeName]) {\n      context.reportError(\n        new GraphQLError(`There can be only one type named \"${typeName}\".`, {\n          nodes: [knownTypeNames[typeName], node.name],\n        }),\n      );\n    } else {\n      knownTypeNames[typeName] = node.name;\n    }\n\n    return false;\n  }\n}\n","import { groupBy } from '../../jsutils/groupBy.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\n\n/**\n * Unique variable names\n *\n * A GraphQL operation is only valid if all its variables are uniquely named.\n */\nexport function UniqueVariableNamesRule(context) {\n  return {\n    OperationDefinition(operationNode) {\n      var _operationNode$variab;\n\n      // See: https://github.com/graphql/graphql-js/issues/2203\n\n      /* c8 ignore next */\n      const variableDefinitions =\n        (_operationNode$variab = operationNode.variableDefinitions) !== null &&\n        _operationNode$variab !== void 0\n          ? _operationNode$variab\n          : [];\n      const seenVariableDefinitions = groupBy(\n        variableDefinitions,\n        (node) => node.variable.name.value,\n      );\n\n      for (const [variableName, variableNodes] of seenVariableDefinitions) {\n        if (variableNodes.length > 1) {\n          context.reportError(\n            new GraphQLError(\n              `There can be only one variable named \"$${variableName}\".`,\n              {\n                nodes: variableNodes.map((node) => node.variable.name),\n              },\n            ),\n          );\n        }\n      }\n    },\n  };\n}\n","import { didYouMean } from '../../jsutils/didYouMean.mjs';\nimport { inspect } from '../../jsutils/inspect.mjs';\nimport { keyMap } from '../../jsutils/keyMap.mjs';\nimport { suggestionList } from '../../jsutils/suggestionList.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport { print } from '../../language/printer.mjs';\nimport {\n  getNamedType,\n  getNullableType,\n  isInputObjectType,\n  isLeafType,\n  isListType,\n  isNonNullType,\n  isRequiredInputField,\n} from '../../type/definition.mjs';\n\n/**\n * Value literals of correct type\n *\n * A GraphQL document is only valid if all value literals are of the type\n * expected at their position.\n *\n * See https://spec.graphql.org/draft/#sec-Values-of-Correct-Type\n */\nexport function ValuesOfCorrectTypeRule(context) {\n  let variableDefinitions = {};\n  return {\n    OperationDefinition: {\n      enter() {\n        variableDefinitions = {};\n      },\n    },\n\n    VariableDefinition(definition) {\n      variableDefinitions[definition.variable.name.value] = definition;\n    },\n\n    ListValue(node) {\n      // Note: TypeInfo will traverse into a list's item type, so look to the\n      // parent input type to check if it is a list.\n      const type = getNullableType(context.getParentInputType());\n\n      if (!isListType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      }\n    },\n\n    ObjectValue(node) {\n      const type = getNamedType(context.getInputType());\n\n      if (!isInputObjectType(type)) {\n        isValidValueNode(context, node);\n        return false; // Don't traverse further.\n      } // Ensure every required field exists.\n\n      const fieldNodeMap = keyMap(node.fields, (field) => field.name.value);\n\n      for (const fieldDef of Object.values(type.getFields())) {\n        const fieldNode = fieldNodeMap[fieldDef.name];\n\n        if (!fieldNode && isRequiredInputField(fieldDef)) {\n          const typeStr = inspect(fieldDef.type);\n          context.reportError(\n            new GraphQLError(\n              `Field \"${type.name}.${fieldDef.name}\" of required type \"${typeStr}\" was not provided.`,\n              {\n                nodes: node,\n              },\n            ),\n          );\n        }\n      }\n\n      if (type.isOneOf) {\n        validateOneOfInputObject(context, node, type, fieldNodeMap);\n      }\n    },\n\n    ObjectField(node) {\n      const parentType = getNamedType(context.getParentInputType());\n      const fieldType = context.getInputType();\n\n      if (!fieldType && isInputObjectType(parentType)) {\n        const suggestions = suggestionList(\n          node.name.value,\n          Object.keys(parentType.getFields()),\n        );\n        context.reportError(\n          new GraphQLError(\n            `Field \"${node.name.value}\" is not defined by type \"${parentType.name}\".` +\n              didYouMean(suggestions),\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    NullValue(node) {\n      const type = context.getInputType();\n\n      if (isNonNullType(type)) {\n        context.reportError(\n          new GraphQLError(\n            `Expected value of type \"${inspect(type)}\", found ${print(node)}.`,\n            {\n              nodes: node,\n            },\n          ),\n        );\n      }\n    },\n\n    EnumValue: (node) => isValidValueNode(context, node),\n    IntValue: (node) => isValidValueNode(context, node),\n    FloatValue: (node) => isValidValueNode(context, node),\n    StringValue: (node) => isValidValueNode(context, node),\n    BooleanValue: (node) => isValidValueNode(context, node),\n  };\n}\n/**\n * Any value literal may be a valid representation of a Scalar, depending on\n * that scalar type.\n */\n\nfunction isValidValueNode(context, node) {\n  // Report any error at the full type expected by the location.\n  const locationType = context.getInputType();\n\n  if (!locationType) {\n    return;\n  }\n\n  const type = getNamedType(locationType);\n\n  if (!isLeafType(type)) {\n    const typeStr = inspect(locationType);\n    context.reportError(\n      new GraphQLError(\n        `Expected value of type \"${typeStr}\", found ${print(node)}.`,\n        {\n          nodes: node,\n        },\n      ),\n    );\n    return;\n  } // Scalars and Enums determine if a literal value is valid via parseLiteral(),\n  // which may throw or return an invalid value to indicate failure.\n\n  try {\n    const parseResult = type.parseLiteral(\n      node,\n      undefined,\n      /* variables */\n    );\n\n    if (parseResult === undefined) {\n      const typeStr = inspect(locationType);\n      context.reportError(\n        new GraphQLError(\n          `Expected value of type \"${typeStr}\", found ${print(node)}.`,\n          {\n            nodes: node,\n          },\n        ),\n      );\n    }\n  } catch (error) {\n    const typeStr = inspect(locationType);\n\n    if (error instanceof GraphQLError) {\n      context.reportError(error);\n    } else {\n      context.reportError(\n        new GraphQLError(\n          `Expected value of type \"${typeStr}\", found ${print(node)}; ` +\n            error.message,\n          {\n            nodes: node,\n            originalError: error,\n          },\n        ),\n      );\n    }\n  }\n}\n\nfunction validateOneOfInputObject(context, node, type, fieldNodeMap) {\n  var _fieldNodeMap$keys$;\n\n  const keys = Object.keys(fieldNodeMap);\n  const isNotExactlyOneField = keys.length !== 1;\n\n  if (isNotExactlyOneField) {\n    context.reportError(\n      new GraphQLError(\n        `OneOf Input Object \"${type.name}\" must specify exactly one key.`,\n        {\n          nodes: [node],\n        },\n      ),\n    );\n    return;\n  }\n\n  const value =\n    (_fieldNodeMap$keys$ = fieldNodeMap[keys[0]]) === null ||\n    _fieldNodeMap$keys$ === void 0\n      ? void 0\n      : _fieldNodeMap$keys$.value;\n  const isNullLiteral = !value || value.kind === Kind.NULL;\n\n  if (isNullLiteral) {\n    context.reportError(\n      new GraphQLError(`Field \"${type.name}.${keys[0]}\" must be non-null.`, {\n        nodes: [node],\n      }),\n    );\n  }\n}\n","import { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { print } from '../../language/printer.mjs';\nimport { isInputType } from '../../type/definition.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Variables are input types\n *\n * A GraphQL operation is only valid if all the variables it defines are of\n * input types (scalar, enum, or input object).\n *\n * See https://spec.graphql.org/draft/#sec-Variables-Are-Input-Types\n */\nexport function VariablesAreInputTypesRule(context) {\n  return {\n    VariableDefinition(node) {\n      const type = typeFromAST(context.getSchema(), node.type);\n\n      if (type !== undefined && !isInputType(type)) {\n        const variableName = node.variable.name.value;\n        const typeName = print(node.type);\n        context.reportError(\n          new GraphQLError(\n            `Variable \"$${variableName}\" cannot be non-input type \"${typeName}\".`,\n            {\n              nodes: node.type,\n            },\n          ),\n        );\n      }\n    },\n  };\n}\n","import { inspect } from '../../jsutils/inspect.mjs';\nimport { GraphQLError } from '../../error/GraphQLError.mjs';\nimport { Kind } from '../../language/kinds.mjs';\nimport {\n  isInputObjectType,\n  isNonNullType,\n  isNullableType,\n} from '../../type/definition.mjs';\nimport { isTypeSubTypeOf } from '../../utilities/typeComparators.mjs';\nimport { typeFromAST } from '../../utilities/typeFromAST.mjs';\n\n/**\n * Variables in allowed position\n *\n * Variable usages must be compatible with the arguments they are passed to.\n *\n * See https://spec.graphql.org/draft/#sec-All-Variable-Usages-are-Allowed\n */\nexport function VariablesInAllowedPositionRule(context) {\n  let varDefMap = Object.create(null);\n  return {\n    OperationDefinition: {\n      enter() {\n        varDefMap = Object.create(null);\n      },\n\n      leave(operation) {\n        const usages = context.getRecursiveVariableUsages(operation);\n\n        for (const { node, type, defaultValue, parentType } of usages) {\n          const varName = node.name.value;\n          const varDef = varDefMap[varName];\n\n          if (varDef && type) {\n            // A var type is allowed if it is the same or more strict (e.g. is\n            // a subtype of) than the expected type. It can be more strict if\n            // the variable type is non-null when the expected type is nullable.\n            // If both are list types, the variable item type can be more strict\n            // than the expected item type (contravariant).\n            const schema = context.getSchema();\n            const varType = typeFromAST(schema, varDef.type);\n\n            if (\n              varType &&\n              !allowedVariableUsage(\n                schema,\n                varType,\n                varDef.defaultValue,\n                type,\n                defaultValue,\n              )\n            ) {\n              const varTypeStr = inspect(varType);\n              const typeStr = inspect(type);\n              context.reportError(\n                new GraphQLError(\n                  `Variable \"$${varName}\" of type \"${varTypeStr}\" used in position expecting type \"${typeStr}\".`,\n                  {\n                    nodes: [varDef, node],\n                  },\n                ),\n              );\n            }\n\n            if (\n              isInputObjectType(parentType) &&\n              parentType.isOneOf &&\n              isNullableType(varType)\n            ) {\n              context.reportError(\n                new GraphQLError(\n                  `Variable \"$${varName}\" is of type \"${varType}\" but must be non-nullable to be used for OneOf Input Object \"${parentType}\".`,\n                  {\n                    nodes: [varDef, node],\n                  },\n                ),\n              );\n            }\n          }\n        }\n      },\n    },\n\n    VariableDefinition(node) {\n      varDefMap[node.variable.name.value] = node;\n    },\n  };\n}\n/**\n * Returns true if the variable is allowed in the location it was found,\n * which includes considering if default values exist for either the variable\n * or the location at which it is located.\n */\n\nfunction allowedVariableUsage(\n  schema,\n  varType,\n  varDefaultValue,\n  locationType,\n  locationDefaultValue,\n) {\n  if (isNonNullType(locationType) && !isNonNullType(varType)) {\n    const hasNonNullVariableDefaultValue =\n      varDefaultValue != null && varDefaultValue.kind !== Kind.NULL;\n    const hasLocationDefaultValue = locationDefaultValue !== undefined;\n\n    if (!hasNonNullVariableDefaultValue && !hasLocationDefaultValue) {\n      return false;\n    }\n\n    const nullableLocationType = locationType.ofType;\n    return isTypeSubTypeOf(schema, varType, nullableLocationType);\n  }\n\n  return isTypeSubTypeOf(schema, varType, locationType);\n}\n","// Spec Section: \"Executable Definitions\"\nimport { ExecutableDefinitionsRule } from './rules/ExecutableDefinitionsRule.mjs'; // Spec Section: \"Field Selections on Objects, Interfaces, and Unions Types\"\n\nimport { FieldsOnCorrectTypeRule } from './rules/FieldsOnCorrectTypeRule.mjs'; // Spec Section: \"Fragments on Composite Types\"\n\nimport { FragmentsOnCompositeTypesRule } from './rules/FragmentsOnCompositeTypesRule.mjs'; // Spec Section: \"Argument Names\"\n\nimport {\n  KnownArgumentNamesOnDirectivesRule,\n  KnownArgumentNamesRule,\n} from './rules/KnownArgumentNamesRule.mjs'; // Spec Section: \"Directives Are Defined\"\n\nimport { KnownDirectivesRule } from './rules/KnownDirectivesRule.mjs'; // Spec Section: \"Fragment spread target defined\"\n\nimport { KnownFragmentNamesRule } from './rules/KnownFragmentNamesRule.mjs'; // Spec Section: \"Fragment Spread Type Existence\"\n\nimport { KnownTypeNamesRule } from './rules/KnownTypeNamesRule.mjs'; // Spec Section: \"Lone Anonymous Operation\"\n\nimport { LoneAnonymousOperationRule } from './rules/LoneAnonymousOperationRule.mjs'; // SDL-specific validation rules\n\nimport { LoneSchemaDefinitionRule } from './rules/LoneSchemaDefinitionRule.mjs'; // TODO: Spec Section\n\nimport { MaxIntrospectionDepthRule } from './rules/MaxIntrospectionDepthRule.mjs'; // Spec Section: \"Fragments must not form cycles\"\n\nimport { NoFragmentCyclesRule } from './rules/NoFragmentCyclesRule.mjs'; // Spec Section: \"All Variable Used Defined\"\n\nimport { NoUndefinedVariablesRule } from './rules/NoUndefinedVariablesRule.mjs'; // Spec Section: \"Fragments must be used\"\n\nimport { NoUnusedFragmentsRule } from './rules/NoUnusedFragmentsRule.mjs'; // Spec Section: \"All Variables Used\"\n\nimport { NoUnusedVariablesRule } from './rules/NoUnusedVariablesRule.mjs'; // Spec Section: \"Field Selection Merging\"\n\nimport { OverlappingFieldsCanBeMergedRule } from './rules/OverlappingFieldsCanBeMergedRule.mjs'; // Spec Section: \"Fragment spread is possible\"\n\nimport { PossibleFragmentSpreadsRule } from './rules/PossibleFragmentSpreadsRule.mjs';\nimport { PossibleTypeExtensionsRule } from './rules/PossibleTypeExtensionsRule.mjs'; // Spec Section: \"Argument Optionality\"\n\nimport {\n  ProvidedRequiredArgumentsOnDirectivesRule,\n  ProvidedRequiredArgumentsRule,\n} from './rules/ProvidedRequiredArgumentsRule.mjs'; // Spec Section: \"Leaf Field Selections\"\n\nimport { ScalarLeafsRule } from './rules/ScalarLeafsRule.mjs'; // Spec Section: \"Subscriptions with Single Root Field\"\n\nimport { SingleFieldSubscriptionsRule } from './rules/SingleFieldSubscriptionsRule.mjs';\nimport { UniqueArgumentDefinitionNamesRule } from './rules/UniqueArgumentDefinitionNamesRule.mjs'; // Spec Section: \"Argument Uniqueness\"\n\nimport { UniqueArgumentNamesRule } from './rules/UniqueArgumentNamesRule.mjs';\nimport { UniqueDirectiveNamesRule } from './rules/UniqueDirectiveNamesRule.mjs'; // Spec Section: \"Directives Are Unique Per Location\"\n\nimport { UniqueDirectivesPerLocationRule } from './rules/UniqueDirectivesPerLocationRule.mjs';\nimport { UniqueEnumValueNamesRule } from './rules/UniqueEnumValueNamesRule.mjs';\nimport { UniqueFieldDefinitionNamesRule } from './rules/UniqueFieldDefinitionNamesRule.mjs'; // Spec Section: \"Fragment Name Uniqueness\"\n\nimport { UniqueFragmentNamesRule } from './rules/UniqueFragmentNamesRule.mjs'; // Spec Section: \"Input Object Field Uniqueness\"\n\nimport { UniqueInputFieldNamesRule } from './rules/UniqueInputFieldNamesRule.mjs'; // Spec Section: \"Operation Name Uniqueness\"\n\nimport { UniqueOperationNamesRule } from './rules/UniqueOperationNamesRule.mjs';\nimport { UniqueOperationTypesRule } from './rules/UniqueOperationTypesRule.mjs';\nimport { UniqueTypeNamesRule } from './rules/UniqueTypeNamesRule.mjs'; // Spec Section: \"Variable Uniqueness\"\n\nimport { UniqueVariableNamesRule } from './rules/UniqueVariableNamesRule.mjs'; // Spec Section: \"Value Type Correctness\"\n\nimport { ValuesOfCorrectTypeRule } from './rules/ValuesOfCorrectTypeRule.mjs'; // Spec Section: \"Variables are Input Types\"\n\nimport { VariablesAreInputTypesRule } from './rules/VariablesAreInputTypesRule.mjs'; // Spec Section: \"All Variable Usages Are Allowed\"\n\nimport { VariablesInAllowedPositionRule } from './rules/VariablesInAllowedPositionRule.mjs';\n\n/**\n * Technically these aren't part of the spec but they are strongly encouraged\n * validation rules.\n */\nexport const recommendedRules = Object.freeze([MaxIntrospectionDepthRule]);\n/**\n * This set includes all validation rules defined by the GraphQL spec.\n *\n * The order of the rules in this list has been adjusted to lead to the\n * most clear output when encountering multiple validation errors.\n */\n\nexport const specifiedRules = Object.freeze([\n  ExecutableDefinitionsRule,\n  UniqueOperationNamesRule,\n  LoneAnonymousOperationRule,\n  SingleFieldSubscriptionsRule,\n  KnownTypeNamesRule,\n  FragmentsOnCompositeTypesRule,\n  VariablesAreInputTypesRule,\n  ScalarLeafsRule,\n  FieldsOnCorrectTypeRule,\n  UniqueFragmentNamesRule,\n  KnownFragmentNamesRule,\n  NoUnusedFragmentsRule,\n  PossibleFragmentSpreadsRule,\n  NoFragmentCyclesRule,\n  UniqueVariableNamesRule,\n  NoUndefinedVariablesRule,\n  NoUnusedVariablesRule,\n  KnownDirectivesRule,\n  UniqueDirectivesPerLocationRule,\n  KnownArgumentNamesRule,\n  UniqueArgumentNamesRule,\n  ValuesOfCorrectTypeRule,\n  ProvidedRequiredArgumentsRule,\n  VariablesInAllowedPositionRule,\n  OverlappingFieldsCanBeMergedRule,\n  UniqueInputFieldNamesRule,\n  ...recommendedRules,\n]);\n/**\n * @internal\n */\n\nexport const specifiedSDLRules = Object.freeze([\n  LoneSchemaDefinitionRule,\n  UniqueOperationTypesRule,\n  UniqueTypeNamesRule,\n  UniqueEnumValueNamesRule,\n  UniqueFieldDefinitionNamesRule,\n  UniqueArgumentDefinitionNamesRule,\n  UniqueDirectiveNamesRule,\n  KnownTypeNamesRule,\n  KnownDirectivesRule,\n  UniqueDirectivesPerLocationRule,\n  PossibleTypeExtensionsRule,\n  KnownArgumentNamesOnDirectivesRule,\n  UniqueArgumentNamesRule,\n  UniqueInputFieldNamesRule,\n  ProvidedRequiredArgumentsOnDirectivesRule,\n]);\n","import { Kind } from '../language/kinds.mjs';\nimport { visit } from '../language/visitor.mjs';\nimport { TypeInfo, visitWithTypeInfo } from '../utilities/TypeInfo.mjs';\n\n/**\n * An instance of this class is passed as the \"this\" context to all validators,\n * allowing access to commonly useful contextual information from within a\n * validation rule.\n */\nexport class ASTValidationContext {\n  constructor(ast, onError) {\n    this._ast = ast;\n    this._fragments = undefined;\n    this._fragmentSpreads = new Map();\n    this._recursivelyReferencedFragments = new Map();\n    this._onError = onError;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'ASTValidationContext';\n  }\n\n  reportError(error) {\n    this._onError(error);\n  }\n\n  getDocument() {\n    return this._ast;\n  }\n\n  getFragment(name) {\n    let fragments;\n\n    if (this._fragments) {\n      fragments = this._fragments;\n    } else {\n      fragments = Object.create(null);\n\n      for (const defNode of this.getDocument().definitions) {\n        if (defNode.kind === Kind.FRAGMENT_DEFINITION) {\n          fragments[defNode.name.value] = defNode;\n        }\n      }\n\n      this._fragments = fragments;\n    }\n\n    return fragments[name];\n  }\n\n  getFragmentSpreads(node) {\n    let spreads = this._fragmentSpreads.get(node);\n\n    if (!spreads) {\n      spreads = [];\n      const setsToVisit = [node];\n      let set;\n\n      while ((set = setsToVisit.pop())) {\n        for (const selection of set.selections) {\n          if (selection.kind === Kind.FRAGMENT_SPREAD) {\n            spreads.push(selection);\n          } else if (selection.selectionSet) {\n            setsToVisit.push(selection.selectionSet);\n          }\n        }\n      }\n\n      this._fragmentSpreads.set(node, spreads);\n    }\n\n    return spreads;\n  }\n\n  getRecursivelyReferencedFragments(operation) {\n    let fragments = this._recursivelyReferencedFragments.get(operation);\n\n    if (!fragments) {\n      fragments = [];\n      const collectedNames = Object.create(null);\n      const nodesToVisit = [operation.selectionSet];\n      let node;\n\n      while ((node = nodesToVisit.pop())) {\n        for (const spread of this.getFragmentSpreads(node)) {\n          const fragName = spread.name.value;\n\n          if (collectedNames[fragName] !== true) {\n            collectedNames[fragName] = true;\n            const fragment = this.getFragment(fragName);\n\n            if (fragment) {\n              fragments.push(fragment);\n              nodesToVisit.push(fragment.selectionSet);\n            }\n          }\n        }\n      }\n\n      this._recursivelyReferencedFragments.set(operation, fragments);\n    }\n\n    return fragments;\n  }\n}\nexport class SDLValidationContext extends ASTValidationContext {\n  constructor(ast, schema, onError) {\n    super(ast, onError);\n    this._schema = schema;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'SDLValidationContext';\n  }\n\n  getSchema() {\n    return this._schema;\n  }\n}\nexport class ValidationContext extends ASTValidationContext {\n  constructor(schema, ast, typeInfo, onError) {\n    super(ast, onError);\n    this._schema = schema;\n    this._typeInfo = typeInfo;\n    this._variableUsages = new Map();\n    this._recursiveVariableUsages = new Map();\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'ValidationContext';\n  }\n\n  getSchema() {\n    return this._schema;\n  }\n\n  getVariableUsages(node) {\n    let usages = this._variableUsages.get(node);\n\n    if (!usages) {\n      const newUsages = [];\n      const typeInfo = new TypeInfo(this._schema);\n      visit(\n        node,\n        visitWithTypeInfo(typeInfo, {\n          VariableDefinition: () => false,\n\n          Variable(variable) {\n            newUsages.push({\n              node: variable,\n              type: typeInfo.getInputType(),\n              defaultValue: typeInfo.getDefaultValue(),\n              parentType: typeInfo.getParentInputType(),\n            });\n          },\n        }),\n      );\n      usages = newUsages;\n\n      this._variableUsages.set(node, usages);\n    }\n\n    return usages;\n  }\n\n  getRecursiveVariableUsages(operation) {\n    let usages = this._recursiveVariableUsages.get(operation);\n\n    if (!usages) {\n      usages = this.getVariableUsages(operation);\n\n      for (const frag of this.getRecursivelyReferencedFragments(operation)) {\n        usages = usages.concat(this.getVariableUsages(frag));\n      }\n\n      this._recursiveVariableUsages.set(operation, usages);\n    }\n\n    return usages;\n  }\n\n  getType() {\n    return this._typeInfo.getType();\n  }\n\n  getParentType() {\n    return this._typeInfo.getParentType();\n  }\n\n  getInputType() {\n    return this._typeInfo.getInputType();\n  }\n\n  getParentInputType() {\n    return this._typeInfo.getParentInputType();\n  }\n\n  getFieldDef() {\n    return this._typeInfo.getFieldDef();\n  }\n\n  getDirective() {\n    return this._typeInfo.getDirective();\n  }\n\n  getArgument() {\n    return this._typeInfo.getArgument();\n  }\n\n  getEnumValue() {\n    return this._typeInfo.getEnumValue();\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { GraphQLError } from '../error/GraphQLError.mjs';\nimport { visit, visitInParallel } from '../language/visitor.mjs';\nimport { assertValidSchema } from '../type/validate.mjs';\nimport { TypeInfo, visitWithTypeInfo } from '../utilities/TypeInfo.mjs';\nimport { specifiedRules, specifiedSDLRules } from './specifiedRules.mjs';\nimport {\n  SDLValidationContext,\n  ValidationContext,\n} from './ValidationContext.mjs';\n/**\n * Implements the \"Validation\" section of the spec.\n *\n * Validation runs synchronously, returning an array of encountered errors, or\n * an empty array if no errors were encountered and the document is valid.\n *\n * A list of specific validation rules may be provided. If not provided, the\n * default list of rules defined by the GraphQL specification will be used.\n *\n * Each validation rules is a function which returns a visitor\n * (see the language/visitor API). Visitor methods are expected to return\n * GraphQLErrors, or Arrays of GraphQLErrors when invalid.\n *\n * Validate will stop validation after a `maxErrors` limit has been reached.\n * Attackers can send pathologically invalid queries to induce a DoS attack,\n * so by default `maxErrors` set to 100 errors.\n *\n * Optionally a custom TypeInfo instance may be provided. If not provided, one\n * will be created from the provided schema.\n */\n\nexport function validate(\n  schema,\n  documentAST,\n  rules = specifiedRules,\n  options,\n  /** @deprecated will be removed in 17.0.0 */\n  typeInfo = new TypeInfo(schema),\n) {\n  var _options$maxErrors;\n\n  const maxErrors =\n    (_options$maxErrors =\n      options === null || options === void 0 ? void 0 : options.maxErrors) !==\n      null && _options$maxErrors !== void 0\n      ? _options$maxErrors\n      : 100;\n  documentAST || devAssert(false, 'Must provide document.'); // If the schema used for validation is invalid, throw an error.\n\n  assertValidSchema(schema);\n  const abortObj = Object.freeze({});\n  const errors = [];\n  const context = new ValidationContext(\n    schema,\n    documentAST,\n    typeInfo,\n    (error) => {\n      if (errors.length >= maxErrors) {\n        errors.push(\n          new GraphQLError(\n            'Too many validation errors, error limit reached. Validation aborted.',\n          ),\n        ); // eslint-disable-next-line @typescript-eslint/no-throw-literal\n\n        throw abortObj;\n      }\n\n      errors.push(error);\n    },\n  ); // This uses a specialized visitor which runs multiple visitors in parallel,\n  // while maintaining the visitor skip and break API.\n\n  const visitor = visitInParallel(rules.map((rule) => rule(context))); // Visit the whole document with each instance of all provided rules.\n\n  try {\n    visit(documentAST, visitWithTypeInfo(typeInfo, visitor));\n  } catch (e) {\n    if (e !== abortObj) {\n      throw e;\n    }\n  }\n\n  return errors;\n}\n/**\n * @internal\n */\n\nexport function validateSDL(\n  documentAST,\n  schemaToExtend,\n  rules = specifiedSDLRules,\n) {\n  const errors = [];\n  const context = new SDLValidationContext(\n    documentAST,\n    schemaToExtend,\n    (error) => {\n      errors.push(error);\n    },\n  );\n  const visitors = rules.map((rule) => rule(context));\n  visit(documentAST, visitInParallel(visitors));\n  return errors;\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDL(documentAST) {\n  const errors = validateSDL(documentAST);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n/**\n * Utility function which asserts a SDL document is valid by throwing an error\n * if it is invalid.\n *\n * @internal\n */\n\nexport function assertValidSDLExtension(documentAST, schema) {\n  const errors = validateSDL(documentAST, schema);\n\n  if (errors.length !== 0) {\n    throw new Error(errors.map((error) => error.message).join('\\n\\n'));\n  }\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { keyMap } from '../jsutils/keyMap.mjs';\nimport { mapValue } from '../jsutils/mapValue.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport {\n  isTypeDefinitionNode,\n  isTypeExtensionNode,\n} from '../language/predicates.mjs';\nimport {\n  GraphQLEnumType,\n  GraphQLInputObjectType,\n  GraphQLInterfaceType,\n  GraphQLList,\n  GraphQLNonNull,\n  GraphQLObjectType,\n  GraphQLScalarType,\n  GraphQLUnionType,\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isListType,\n  isNonNullType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../type/definition.mjs';\nimport {\n  GraphQLDeprecatedDirective,\n  GraphQLDirective,\n  GraphQLOneOfDirective,\n  GraphQLSpecifiedByDirective,\n} from '../type/directives.mjs';\nimport {\n  introspectionTypes,\n  isIntrospectionType,\n} from '../type/introspection.mjs';\nimport {\n  isSpecifiedScalarType,\n  specifiedScalarTypes,\n} from '../type/scalars.mjs';\nimport { assertSchema, GraphQLSchema } from '../type/schema.mjs';\nimport { assertValidSDLExtension } from '../validation/validate.mjs';\nimport { getDirectiveValues } from '../execution/values.mjs';\nimport { valueFromAST } from './valueFromAST.mjs';\n\n/**\n * Produces a new schema given an existing schema and a document which may\n * contain GraphQL type extensions and definitions. The original schema will\n * remain unaltered.\n *\n * Because a schema represents a graph of references, a schema cannot be\n * extended without effectively making an entire copy. We do not know until it's\n * too late if subgraphs remain unchanged.\n *\n * This algorithm copies the provided schema, applying extensions while\n * producing the copy. The original schema remains unaltered.\n */\nexport function extendSchema(schema, documentAST, options) {\n  assertSchema(schema);\n  (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||\n    devAssert(false, 'Must provide valid Document AST.');\n\n  if (\n    (options === null || options === void 0 ? void 0 : options.assumeValid) !==\n      true &&\n    (options === null || options === void 0\n      ? void 0\n      : options.assumeValidSDL) !== true\n  ) {\n    assertValidSDLExtension(documentAST, schema);\n  }\n\n  const schemaConfig = schema.toConfig();\n  const extendedConfig = extendSchemaImpl(schemaConfig, documentAST, options);\n  return schemaConfig === extendedConfig\n    ? schema\n    : new GraphQLSchema(extendedConfig);\n}\n/**\n * @internal\n */\n\nexport function extendSchemaImpl(schemaConfig, documentAST, options) {\n  var _schemaDef, _schemaDef$descriptio, _schemaDef2, _options$assumeValid;\n\n  // Collect the type definitions and extensions found in the document.\n  const typeDefs = [];\n  const typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n  // have the same name. For example, a type named \"skip\".\n\n  const directiveDefs = [];\n  let schemaDef; // Schema extensions are collected which may add additional operation types.\n\n  const schemaExtensions = [];\n\n  for (const def of documentAST.definitions) {\n    if (def.kind === Kind.SCHEMA_DEFINITION) {\n      schemaDef = def;\n    } else if (def.kind === Kind.SCHEMA_EXTENSION) {\n      schemaExtensions.push(def);\n    } else if (isTypeDefinitionNode(def)) {\n      typeDefs.push(def);\n    } else if (isTypeExtensionNode(def)) {\n      const extendedTypeName = def.name.value;\n      const existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n      typeExtensionsMap[extendedTypeName] = existingTypeExtensions\n        ? existingTypeExtensions.concat([def])\n        : [def];\n    } else if (def.kind === Kind.DIRECTIVE_DEFINITION) {\n      directiveDefs.push(def);\n    }\n  } // If this document contains no new types, extensions, or directives then\n  // return the same unmodified GraphQLSchema instance.\n\n  if (\n    Object.keys(typeExtensionsMap).length === 0 &&\n    typeDefs.length === 0 &&\n    directiveDefs.length === 0 &&\n    schemaExtensions.length === 0 &&\n    schemaDef == null\n  ) {\n    return schemaConfig;\n  }\n\n  const typeMap = Object.create(null);\n\n  for (const existingType of schemaConfig.types) {\n    typeMap[existingType.name] = extendNamedType(existingType);\n  }\n\n  for (const typeNode of typeDefs) {\n    var _stdTypeMap$name;\n\n    const name = typeNode.name.value;\n    typeMap[name] =\n      (_stdTypeMap$name = stdTypeMap[name]) !== null &&\n      _stdTypeMap$name !== void 0\n        ? _stdTypeMap$name\n        : buildType(typeNode);\n  }\n\n  const operationTypes = {\n    // Get the extended root operation types.\n    query: schemaConfig.query && replaceNamedType(schemaConfig.query),\n    mutation: schemaConfig.mutation && replaceNamedType(schemaConfig.mutation),\n    subscription:\n      schemaConfig.subscription && replaceNamedType(schemaConfig.subscription),\n    // Then, incorporate schema definition and all schema extensions.\n    ...(schemaDef && getOperationTypes([schemaDef])),\n    ...getOperationTypes(schemaExtensions),\n  }; // Then produce and return a Schema config with these types.\n\n  return {\n    description:\n      (_schemaDef = schemaDef) === null || _schemaDef === void 0\n        ? void 0\n        : (_schemaDef$descriptio = _schemaDef.description) === null ||\n          _schemaDef$descriptio === void 0\n        ? void 0\n        : _schemaDef$descriptio.value,\n    ...operationTypes,\n    types: Object.values(typeMap),\n    directives: [\n      ...schemaConfig.directives.map(replaceDirective),\n      ...directiveDefs.map(buildDirective),\n    ],\n    extensions: Object.create(null),\n    astNode:\n      (_schemaDef2 = schemaDef) !== null && _schemaDef2 !== void 0\n        ? _schemaDef2\n        : schemaConfig.astNode,\n    extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExtensions),\n    assumeValid:\n      (_options$assumeValid =\n        options === null || options === void 0\n          ? void 0\n          : options.assumeValid) !== null && _options$assumeValid !== void 0\n        ? _options$assumeValid\n        : false,\n  }; // Below are functions used for producing this schema that have closed over\n  // this scope and have access to the schema, cache, and newly defined types.\n\n  function replaceType(type) {\n    if (isListType(type)) {\n      // @ts-expect-error\n      return new GraphQLList(replaceType(type.ofType));\n    }\n\n    if (isNonNullType(type)) {\n      // @ts-expect-error\n      return new GraphQLNonNull(replaceType(type.ofType));\n    } // @ts-expect-error FIXME\n\n    return replaceNamedType(type);\n  }\n\n  function replaceNamedType(type) {\n    // Note: While this could make early assertions to get the correctly\n    // typed values, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    return typeMap[type.name];\n  }\n\n  function replaceDirective(directive) {\n    const config = directive.toConfig();\n    return new GraphQLDirective({\n      ...config,\n      args: mapValue(config.args, extendArg),\n    });\n  }\n\n  function extendNamedType(type) {\n    if (isIntrospectionType(type) || isSpecifiedScalarType(type)) {\n      // Builtin types are not extended.\n      return type;\n    }\n\n    if (isScalarType(type)) {\n      return extendScalarType(type);\n    }\n\n    if (isObjectType(type)) {\n      return extendObjectType(type);\n    }\n\n    if (isInterfaceType(type)) {\n      return extendInterfaceType(type);\n    }\n\n    if (isUnionType(type)) {\n      return extendUnionType(type);\n    }\n\n    if (isEnumType(type)) {\n      return extendEnumType(type);\n    }\n\n    if (isInputObjectType(type)) {\n      return extendInputObjectType(type);\n    }\n    /* c8 ignore next 3 */\n    // Not reachable, all possible type definition nodes have been considered.\n\n    false || invariant(false, 'Unexpected type: ' + inspect(type));\n  }\n\n  function extendInputObjectType(type) {\n    var _typeExtensionsMap$co;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co !== void 0\n        ? _typeExtensionsMap$co\n        : [];\n    return new GraphQLInputObjectType({\n      ...config,\n      fields: () => ({\n        ...mapValue(config.fields, (field) => ({\n          ...field,\n          type: replaceType(field.type),\n        })),\n        ...buildInputFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendEnumType(type) {\n    var _typeExtensionsMap$ty;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$ty = typeExtensionsMap[type.name]) !== null &&\n      _typeExtensionsMap$ty !== void 0\n        ? _typeExtensionsMap$ty\n        : [];\n    return new GraphQLEnumType({\n      ...config,\n      values: { ...config.values, ...buildEnumValueMap(extensions) },\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendScalarType(type) {\n    var _typeExtensionsMap$co2;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co2 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co2 !== void 0\n        ? _typeExtensionsMap$co2\n        : [];\n    let specifiedByURL = config.specifiedByURL;\n\n    for (const extensionNode of extensions) {\n      var _getSpecifiedByURL;\n\n      specifiedByURL =\n        (_getSpecifiedByURL = getSpecifiedByURL(extensionNode)) !== null &&\n        _getSpecifiedByURL !== void 0\n          ? _getSpecifiedByURL\n          : specifiedByURL;\n    }\n\n    return new GraphQLScalarType({\n      ...config,\n      specifiedByURL,\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendObjectType(type) {\n    var _typeExtensionsMap$co3;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co3 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co3 !== void 0\n        ? _typeExtensionsMap$co3\n        : [];\n    return new GraphQLObjectType({\n      ...config,\n      interfaces: () => [\n        ...type.getInterfaces().map(replaceNamedType),\n        ...buildInterfaces(extensions),\n      ],\n      fields: () => ({\n        ...mapValue(config.fields, extendField),\n        ...buildFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendInterfaceType(type) {\n    var _typeExtensionsMap$co4;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co4 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co4 !== void 0\n        ? _typeExtensionsMap$co4\n        : [];\n    return new GraphQLInterfaceType({\n      ...config,\n      interfaces: () => [\n        ...type.getInterfaces().map(replaceNamedType),\n        ...buildInterfaces(extensions),\n      ],\n      fields: () => ({\n        ...mapValue(config.fields, extendField),\n        ...buildFieldMap(extensions),\n      }),\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendUnionType(type) {\n    var _typeExtensionsMap$co5;\n\n    const config = type.toConfig();\n    const extensions =\n      (_typeExtensionsMap$co5 = typeExtensionsMap[config.name]) !== null &&\n      _typeExtensionsMap$co5 !== void 0\n        ? _typeExtensionsMap$co5\n        : [];\n    return new GraphQLUnionType({\n      ...config,\n      types: () => [\n        ...type.getTypes().map(replaceNamedType),\n        ...buildUnionTypes(extensions),\n      ],\n      extensionASTNodes: config.extensionASTNodes.concat(extensions),\n    });\n  }\n\n  function extendField(field) {\n    return {\n      ...field,\n      type: replaceType(field.type),\n      args: field.args && mapValue(field.args, extendArg),\n    };\n  }\n\n  function extendArg(arg) {\n    return { ...arg, type: replaceType(arg.type) };\n  }\n\n  function getOperationTypes(nodes) {\n    const opTypes = {};\n\n    for (const node of nodes) {\n      var _node$operationTypes;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const operationTypesNodes =\n        /* c8 ignore next */\n        (_node$operationTypes = node.operationTypes) !== null &&\n        _node$operationTypes !== void 0\n          ? _node$operationTypes\n          : [];\n\n      for (const operationType of operationTypesNodes) {\n        // Note: While this could make early assertions to get the correctly\n        // typed values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable results.\n        // @ts-expect-error\n        opTypes[operationType.operation] = getNamedType(operationType.type);\n      }\n    }\n\n    return opTypes;\n  }\n\n  function getNamedType(node) {\n    var _stdTypeMap$name2;\n\n    const name = node.name.value;\n    const type =\n      (_stdTypeMap$name2 = stdTypeMap[name]) !== null &&\n      _stdTypeMap$name2 !== void 0\n        ? _stdTypeMap$name2\n        : typeMap[name];\n\n    if (type === undefined) {\n      throw new Error(`Unknown type: \"${name}\".`);\n    }\n\n    return type;\n  }\n\n  function getWrappedType(node) {\n    if (node.kind === Kind.LIST_TYPE) {\n      return new GraphQLList(getWrappedType(node.type));\n    }\n\n    if (node.kind === Kind.NON_NULL_TYPE) {\n      return new GraphQLNonNull(getWrappedType(node.type));\n    }\n\n    return getNamedType(node);\n  }\n\n  function buildDirective(node) {\n    var _node$description;\n\n    return new GraphQLDirective({\n      name: node.name.value,\n      description:\n        (_node$description = node.description) === null ||\n        _node$description === void 0\n          ? void 0\n          : _node$description.value,\n      // @ts-expect-error\n      locations: node.locations.map(({ value }) => value),\n      isRepeatable: node.repeatable,\n      args: buildArgumentMap(node.arguments),\n      astNode: node,\n    });\n  }\n\n  function buildFieldMap(nodes) {\n    const fieldConfigMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$fields;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const nodeFields =\n        /* c8 ignore next */\n        (_node$fields = node.fields) !== null && _node$fields !== void 0\n          ? _node$fields\n          : [];\n\n      for (const field of nodeFields) {\n        var _field$description;\n\n        fieldConfigMap[field.name.value] = {\n          // Note: While this could make assertions to get the correctly typed\n          // value, that would throw immediately while type system validation\n          // with validateSchema() will produce more actionable results.\n          type: getWrappedType(field.type),\n          description:\n            (_field$description = field.description) === null ||\n            _field$description === void 0\n              ? void 0\n              : _field$description.value,\n          args: buildArgumentMap(field.arguments),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field,\n        };\n      }\n    }\n\n    return fieldConfigMap;\n  }\n\n  function buildArgumentMap(args) {\n    // FIXME: https://github.com/graphql/graphql-js/issues/2203\n    const argsNodes =\n      /* c8 ignore next */\n      args !== null && args !== void 0 ? args : [];\n    const argConfigMap = Object.create(null);\n\n    for (const arg of argsNodes) {\n      var _arg$description;\n\n      // Note: While this could make assertions to get the correctly typed\n      // value, that would throw immediately while type system validation\n      // with validateSchema() will produce more actionable results.\n      const type = getWrappedType(arg.type);\n      argConfigMap[arg.name.value] = {\n        type,\n        description:\n          (_arg$description = arg.description) === null ||\n          _arg$description === void 0\n            ? void 0\n            : _arg$description.value,\n        defaultValue: valueFromAST(arg.defaultValue, type),\n        deprecationReason: getDeprecationReason(arg),\n        astNode: arg,\n      };\n    }\n\n    return argConfigMap;\n  }\n\n  function buildInputFieldMap(nodes) {\n    const inputFieldMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$fields2;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const fieldsNodes =\n        /* c8 ignore next */\n        (_node$fields2 = node.fields) !== null && _node$fields2 !== void 0\n          ? _node$fields2\n          : [];\n\n      for (const field of fieldsNodes) {\n        var _field$description2;\n\n        // Note: While this could make assertions to get the correctly typed\n        // value, that would throw immediately while type system validation\n        // with validateSchema() will produce more actionable results.\n        const type = getWrappedType(field.type);\n        inputFieldMap[field.name.value] = {\n          type,\n          description:\n            (_field$description2 = field.description) === null ||\n            _field$description2 === void 0\n              ? void 0\n              : _field$description2.value,\n          defaultValue: valueFromAST(field.defaultValue, type),\n          deprecationReason: getDeprecationReason(field),\n          astNode: field,\n        };\n      }\n    }\n\n    return inputFieldMap;\n  }\n\n  function buildEnumValueMap(nodes) {\n    const enumValueMap = Object.create(null);\n\n    for (const node of nodes) {\n      var _node$values;\n\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      const valuesNodes =\n        /* c8 ignore next */\n        (_node$values = node.values) !== null && _node$values !== void 0\n          ? _node$values\n          : [];\n\n      for (const value of valuesNodes) {\n        var _value$description;\n\n        enumValueMap[value.name.value] = {\n          description:\n            (_value$description = value.description) === null ||\n            _value$description === void 0\n              ? void 0\n              : _value$description.value,\n          deprecationReason: getDeprecationReason(value),\n          astNode: value,\n        };\n      }\n    }\n\n    return enumValueMap;\n  }\n\n  function buildInterfaces(nodes) {\n    // Note: While this could make assertions to get the correctly typed\n    // values below, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    // @ts-expect-error\n    return nodes.flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (node) => {\n        var _node$interfaces$map, _node$interfaces;\n\n        return (\n          /* c8 ignore next */\n          (_node$interfaces$map =\n            (_node$interfaces = node.interfaces) === null ||\n            _node$interfaces === void 0\n              ? void 0\n              : _node$interfaces.map(getNamedType)) !== null &&\n            _node$interfaces$map !== void 0\n            ? _node$interfaces$map\n            : []\n        );\n      },\n    );\n  }\n\n  function buildUnionTypes(nodes) {\n    // Note: While this could make assertions to get the correctly typed\n    // values below, that would throw immediately while type system\n    // validation with validateSchema() will produce more actionable results.\n    // @ts-expect-error\n    return nodes.flatMap(\n      // FIXME: https://github.com/graphql/graphql-js/issues/2203\n      (node) => {\n        var _node$types$map, _node$types;\n\n        return (\n          /* c8 ignore next */\n          (_node$types$map =\n            (_node$types = node.types) === null || _node$types === void 0\n              ? void 0\n              : _node$types.map(getNamedType)) !== null &&\n            _node$types$map !== void 0\n            ? _node$types$map\n            : []\n        );\n      },\n    );\n  }\n\n  function buildType(astNode) {\n    var _typeExtensionsMap$na;\n\n    const name = astNode.name.value;\n    const extensionASTNodes =\n      (_typeExtensionsMap$na = typeExtensionsMap[name]) !== null &&\n      _typeExtensionsMap$na !== void 0\n        ? _typeExtensionsMap$na\n        : [];\n\n    switch (astNode.kind) {\n      case Kind.OBJECT_TYPE_DEFINITION: {\n        var _astNode$description;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLObjectType({\n          name,\n          description:\n            (_astNode$description = astNode.description) === null ||\n            _astNode$description === void 0\n              ? void 0\n              : _astNode$description.value,\n          interfaces: () => buildInterfaces(allNodes),\n          fields: () => buildFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.INTERFACE_TYPE_DEFINITION: {\n        var _astNode$description2;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLInterfaceType({\n          name,\n          description:\n            (_astNode$description2 = astNode.description) === null ||\n            _astNode$description2 === void 0\n              ? void 0\n              : _astNode$description2.value,\n          interfaces: () => buildInterfaces(allNodes),\n          fields: () => buildFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.ENUM_TYPE_DEFINITION: {\n        var _astNode$description3;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLEnumType({\n          name,\n          description:\n            (_astNode$description3 = astNode.description) === null ||\n            _astNode$description3 === void 0\n              ? void 0\n              : _astNode$description3.value,\n          values: buildEnumValueMap(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.UNION_TYPE_DEFINITION: {\n        var _astNode$description4;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLUnionType({\n          name,\n          description:\n            (_astNode$description4 = astNode.description) === null ||\n            _astNode$description4 === void 0\n              ? void 0\n              : _astNode$description4.value,\n          types: () => buildUnionTypes(allNodes),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.SCALAR_TYPE_DEFINITION: {\n        var _astNode$description5;\n\n        return new GraphQLScalarType({\n          name,\n          description:\n            (_astNode$description5 = astNode.description) === null ||\n            _astNode$description5 === void 0\n              ? void 0\n              : _astNode$description5.value,\n          specifiedByURL: getSpecifiedByURL(astNode),\n          astNode,\n          extensionASTNodes,\n        });\n      }\n\n      case Kind.INPUT_OBJECT_TYPE_DEFINITION: {\n        var _astNode$description6;\n\n        const allNodes = [astNode, ...extensionASTNodes];\n        return new GraphQLInputObjectType({\n          name,\n          description:\n            (_astNode$description6 = astNode.description) === null ||\n            _astNode$description6 === void 0\n              ? void 0\n              : _astNode$description6.value,\n          fields: () => buildInputFieldMap(allNodes),\n          astNode,\n          extensionASTNodes,\n          isOneOf: isOneOf(astNode),\n        });\n      }\n    }\n  }\n}\nconst stdTypeMap = keyMap(\n  [...specifiedScalarTypes, ...introspectionTypes],\n  (type) => type.name,\n);\n/**\n * Given a field or enum value node, returns the string value for the\n * deprecation reason.\n */\n\nfunction getDeprecationReason(node) {\n  const deprecated = getDirectiveValues(GraphQLDeprecatedDirective, node); // @ts-expect-error validated by `getDirectiveValues`\n\n  return deprecated === null || deprecated === void 0\n    ? void 0\n    : deprecated.reason;\n}\n/**\n * Given a scalar node, returns the string value for the specifiedByURL.\n */\n\nfunction getSpecifiedByURL(node) {\n  const specifiedBy = getDirectiveValues(GraphQLSpecifiedByDirective, node); // @ts-expect-error validated by `getDirectiveValues`\n\n  return specifiedBy === null || specifiedBy === void 0\n    ? void 0\n    : specifiedBy.url;\n}\n/**\n * Given an input object node, returns if the node should be OneOf.\n */\n\nfunction isOneOf(node) {\n  return Boolean(getDirectiveValues(GraphQLOneOfDirective, node));\n}\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { parse } from '../language/parser.mjs';\nimport { specifiedDirectives } from '../type/directives.mjs';\nimport { GraphQLSchema } from '../type/schema.mjs';\nimport { assertValidSDL } from '../validation/validate.mjs';\nimport { extendSchemaImpl } from './extendSchema.mjs';\n\n/**\n * This takes the ast of a schema document produced by the parse function in\n * src/language/parser.js.\n *\n * If no schema definition is provided, then it will look for types named Query,\n * Mutation and Subscription.\n *\n * Given that AST it constructs a GraphQLSchema. The resulting schema\n * has no resolve methods, so execution will use default resolvers.\n */\nexport function buildASTSchema(documentAST, options) {\n  (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||\n    devAssert(false, 'Must provide valid Document AST.');\n\n  if (\n    (options === null || options === void 0 ? void 0 : options.assumeValid) !==\n      true &&\n    (options === null || options === void 0\n      ? void 0\n      : options.assumeValidSDL) !== true\n  ) {\n    assertValidSDL(documentAST);\n  }\n\n  const emptySchemaConfig = {\n    description: undefined,\n    types: [],\n    directives: [],\n    extensions: Object.create(null),\n    extensionASTNodes: [],\n    assumeValid: false,\n  };\n  const config = extendSchemaImpl(emptySchemaConfig, documentAST, options);\n\n  if (config.astNode == null) {\n    for (const type of config.types) {\n      switch (type.name) {\n        // Note: While this could make early assertions to get the correctly\n        // typed values below, that would throw immediately while type system\n        // validation with validateSchema() will produce more actionable results.\n        case 'Query':\n          // @ts-expect-error validated in `validateSchema`\n          config.query = type;\n          break;\n\n        case 'Mutation':\n          // @ts-expect-error validated in `validateSchema`\n          config.mutation = type;\n          break;\n\n        case 'Subscription':\n          // @ts-expect-error validated in `validateSchema`\n          config.subscription = type;\n          break;\n      }\n    }\n  }\n\n  const directives = [\n    ...config.directives, // If specified directives were not explicitly declared, add them.\n    ...specifiedDirectives.filter((stdDirective) =>\n      config.directives.every(\n        (directive) => directive.name !== stdDirective.name,\n      ),\n    ),\n  ];\n  return new GraphQLSchema({ ...config, directives });\n}\n/**\n * A helper function to build a GraphQLSchema directly from a source\n * document.\n */\n\nexport function buildSchema(source, options) {\n  const document = parse(source, {\n    noLocation:\n      options === null || options === void 0 ? void 0 : options.noLocation,\n    allowLegacyFragmentVariables:\n      options === null || options === void 0\n        ? void 0\n        : options.allowLegacyFragmentVariables,\n  });\n  return buildASTSchema(document, {\n    assumeValidSDL:\n      options === null || options === void 0 ? void 0 : options.assumeValidSDL,\n    assumeValid:\n      options === null || options === void 0 ? void 0 : options.assumeValid,\n  });\n}\n","import { inspect } from '../jsutils/inspect.mjs';\nimport { invariant } from '../jsutils/invariant.mjs';\nimport { isPrintableAsBlockString } from '../language/blockString.mjs';\nimport { Kind } from '../language/kinds.mjs';\nimport { print } from '../language/printer.mjs';\nimport {\n  isEnumType,\n  isInputObjectType,\n  isInterfaceType,\n  isObjectType,\n  isScalarType,\n  isUnionType,\n} from '../type/definition.mjs';\nimport {\n  DEFAULT_DEPRECATION_REASON,\n  isSpecifiedDirective,\n} from '../type/directives.mjs';\nimport { isIntrospectionType } from '../type/introspection.mjs';\nimport { isSpecifiedScalarType } from '../type/scalars.mjs';\nimport { astFromValue } from './astFromValue.mjs';\nexport function printSchema(schema) {\n  return printFilteredSchema(\n    schema,\n    (n) => !isSpecifiedDirective(n),\n    isDefinedType,\n  );\n}\nexport function printIntrospectionSchema(schema) {\n  return printFilteredSchema(schema, isSpecifiedDirective, isIntrospectionType);\n}\n\nfunction isDefinedType(type) {\n  return !isSpecifiedScalarType(type) && !isIntrospectionType(type);\n}\n\nfunction printFilteredSchema(schema, directiveFilter, typeFilter) {\n  const directives = schema.getDirectives().filter(directiveFilter);\n  const types = Object.values(schema.getTypeMap()).filter(typeFilter);\n  return [\n    printSchemaDefinition(schema),\n    ...directives.map((directive) => printDirective(directive)),\n    ...types.map((type) => printType(type)),\n  ]\n    .filter(Boolean)\n    .join('\\n\\n');\n}\n\nfunction printSchemaDefinition(schema) {\n  if (schema.description == null && isSchemaOfCommonNames(schema)) {\n    return;\n  }\n\n  const operationTypes = [];\n  const queryType = schema.getQueryType();\n\n  if (queryType) {\n    operationTypes.push(`  query: ${queryType.name}`);\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType) {\n    operationTypes.push(`  mutation: ${mutationType.name}`);\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType) {\n    operationTypes.push(`  subscription: ${subscriptionType.name}`);\n  }\n\n  return printDescription(schema) + `schema {\\n${operationTypes.join('\\n')}\\n}`;\n}\n/**\n * GraphQL schema define root types for each type of operation. These types are\n * the same as any other type and can be named in any manner, however there is\n * a common naming convention:\n *\n * ```graphql\n *   schema {\n *     query: Query\n *     mutation: Mutation\n *     subscription: Subscription\n *   }\n * ```\n *\n * When using this naming convention, the schema description can be omitted.\n */\n\nfunction isSchemaOfCommonNames(schema) {\n  const queryType = schema.getQueryType();\n\n  if (queryType && queryType.name !== 'Query') {\n    return false;\n  }\n\n  const mutationType = schema.getMutationType();\n\n  if (mutationType && mutationType.name !== 'Mutation') {\n    return false;\n  }\n\n  const subscriptionType = schema.getSubscriptionType();\n\n  if (subscriptionType && subscriptionType.name !== 'Subscription') {\n    return false;\n  }\n\n  return true;\n}\n\nexport function printType(type) {\n  if (isScalarType(type)) {\n    return printScalar(type);\n  }\n\n  if (isObjectType(type)) {\n    return printObject(type);\n  }\n\n  if (isInterfaceType(type)) {\n    return printInterface(type);\n  }\n\n  if (isUnionType(type)) {\n    return printUnion(type);\n  }\n\n  if (isEnumType(type)) {\n    return printEnum(type);\n  }\n\n  if (isInputObjectType(type)) {\n    return printInputObject(type);\n  }\n  /* c8 ignore next 3 */\n  // Not reachable, all possible types have been considered.\n\n  false || invariant(false, 'Unexpected type: ' + inspect(type));\n}\n\nfunction printScalar(type) {\n  return (\n    printDescription(type) + `scalar ${type.name}` + printSpecifiedByURL(type)\n  );\n}\n\nfunction printImplementedInterfaces(type) {\n  const interfaces = type.getInterfaces();\n  return interfaces.length\n    ? ' implements ' + interfaces.map((i) => i.name).join(' & ')\n    : '';\n}\n\nfunction printObject(type) {\n  return (\n    printDescription(type) +\n    `type ${type.name}` +\n    printImplementedInterfaces(type) +\n    printFields(type)\n  );\n}\n\nfunction printInterface(type) {\n  return (\n    printDescription(type) +\n    `interface ${type.name}` +\n    printImplementedInterfaces(type) +\n    printFields(type)\n  );\n}\n\nfunction printUnion(type) {\n  const types = type.getTypes();\n  const possibleTypes = types.length ? ' = ' + types.join(' | ') : '';\n  return printDescription(type) + 'union ' + type.name + possibleTypes;\n}\n\nfunction printEnum(type) {\n  const values = type\n    .getValues()\n    .map(\n      (value, i) =>\n        printDescription(value, '  ', !i) +\n        '  ' +\n        value.name +\n        printDeprecated(value.deprecationReason),\n    );\n  return printDescription(type) + `enum ${type.name}` + printBlock(values);\n}\n\nfunction printInputObject(type) {\n  const fields = Object.values(type.getFields()).map(\n    (f, i) => printDescription(f, '  ', !i) + '  ' + printInputValue(f),\n  );\n  return (\n    printDescription(type) +\n    `input ${type.name}` +\n    (type.isOneOf ? ' @oneOf' : '') +\n    printBlock(fields)\n  );\n}\n\nfunction printFields(type) {\n  const fields = Object.values(type.getFields()).map(\n    (f, i) =>\n      printDescription(f, '  ', !i) +\n      '  ' +\n      f.name +\n      printArgs(f.args, '  ') +\n      ': ' +\n      String(f.type) +\n      printDeprecated(f.deprecationReason),\n  );\n  return printBlock(fields);\n}\n\nfunction printBlock(items) {\n  return items.length !== 0 ? ' {\\n' + items.join('\\n') + '\\n}' : '';\n}\n\nfunction printArgs(args, indentation = '') {\n  if (args.length === 0) {\n    return '';\n  } // If every arg does not have a description, print them on one line.\n\n  if (args.every((arg) => !arg.description)) {\n    return '(' + args.map(printInputValue).join(', ') + ')';\n  }\n\n  return (\n    '(\\n' +\n    args\n      .map(\n        (arg, i) =>\n          printDescription(arg, '  ' + indentation, !i) +\n          '  ' +\n          indentation +\n          printInputValue(arg),\n      )\n      .join('\\n') +\n    '\\n' +\n    indentation +\n    ')'\n  );\n}\n\nfunction printInputValue(arg) {\n  const defaultAST = astFromValue(arg.defaultValue, arg.type);\n  let argDecl = arg.name + ': ' + String(arg.type);\n\n  if (defaultAST) {\n    argDecl += ` = ${print(defaultAST)}`;\n  }\n\n  return argDecl + printDeprecated(arg.deprecationReason);\n}\n\nfunction printDirective(directive) {\n  return (\n    printDescription(directive) +\n    'directive @' +\n    directive.name +\n    printArgs(directive.args) +\n    (directive.isRepeatable ? ' repeatable' : '') +\n    ' on ' +\n    directive.locations.join(' | ')\n  );\n}\n\nfunction printDeprecated(reason) {\n  if (reason == null) {\n    return '';\n  }\n\n  if (reason !== DEFAULT_DEPRECATION_REASON) {\n    const astValue = print({\n      kind: Kind.STRING,\n      value: reason,\n    });\n    return ` @deprecated(reason: ${astValue})`;\n  }\n\n  return ' @deprecated';\n}\n\nfunction printSpecifiedByURL(scalar) {\n  if (scalar.specifiedByURL == null) {\n    return '';\n  }\n\n  const astValue = print({\n    kind: Kind.STRING,\n    value: scalar.specifiedByURL,\n  });\n  return ` @specifiedBy(url: ${astValue})`;\n}\n\nfunction printDescription(def, indentation = '', firstInBlock = true) {\n  const { description } = def;\n\n  if (description == null) {\n    return '';\n  }\n\n  const blockString = print({\n    kind: Kind.STRING,\n    value: description,\n    block: isPrintableAsBlockString(description),\n  });\n  const prefix =\n    indentation && !firstInBlock ? '\\n' + indentation : indentation;\n  return prefix + blockString.replace(/\\n/g, '\\n' + indentation) + '\\n';\n}\n","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = '{ unit?: string, value?: number }';\nexport const typedef = 'scalar Amount';\nexport const schema = z.object({\n    unit: z.string().optional(),\n    value: z.number().finite(),\n});\nexport const stringSchema = 'z.object({ unit: z.string().optional(), value: z.number().finite() })';\nconst amountValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountValidation,\n    parseValue: amountValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (unitField && unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('value must be a valid float value', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField?.value?.value,\n            value: parseFloat(valueField.value.value),\n        };\n        return amountValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Amount.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const NUMERIC_VALUE_REGEX = /^\\d+(\\.\\d+)?$/;\nexport const type = '{ unit: string, value: string }';\nexport const typedef = 'scalar Amount_Crypto';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.string(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.string() })';\nconst amountCryptoValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Crypto value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Crypto',\n    description: 'A custom scalar that represents a cryptocurrency amount with its currency type',\n    serialize: amountCryptoValidation,\n    parseValue: amountCryptoValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('value must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!NUMERIC_VALUE_REGEX.test(valueField.value.value)) {\n            throw new GraphQLError('value must be a valid numeric string (e.g., \"123\" or \"123.45\")', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: valueField.value.value,\n        };\n        return amountCryptoValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountCrypto.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const NUMERIC_VALUE_REGEX = /^\\d+(\\.\\d+)?$/;\nexport const type = '{ unit: string, value: string }';\nexport const typedef = 'scalar Amount_Currency';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.string(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.string()})';\nconst amountCurrencyValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Currency value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Currency',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountCurrencyValidation,\n    parseValue: amountCurrencyValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('value must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!NUMERIC_VALUE_REGEX.test(valueField.value.value)) {\n            throw new GraphQLError('value must be a valid numeric string (e.g., \"123\" or \"123.45\")', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: valueField.value.value,\n        };\n        return amountCurrencyValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountCurrency.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = '{ unit: string, value: number }';\nexport const typedef = 'scalar Amount_Fiat';\nexport const schema = z.object({\n    unit: z.string(),\n    value: z.number().finite(),\n});\nexport const stringSchema = 'z.object({ unit: z.string(), value: z.number().finite() })';\nconst amountFiatValidation = (value) => {\n    if (typeof value !== 'object' || !value) {\n        throw new GraphQLError(`Invalid Amount Fiat value: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Fiat',\n    description: 'A custom scalar that represents a currency amount with its currency type',\n    serialize: amountFiatValidation,\n    parseValue: amountFiatValidation,\n    parseLiteral: (ast) => {\n        if (ast.kind !== Kind.OBJECT) {\n            throw new GraphQLError('Value must be an object', { nodes: ast });\n        }\n        const unitField = ast.fields.find((f) => f.name.value === 'unit');\n        const valueField = ast.fields.find((f) => f.name.value === 'value');\n        if (!unitField || unitField.value.kind !== Kind.STRING) {\n            throw new GraphQLError('unit must be a valid string value', {\n                nodes: ast,\n            });\n        }\n        if (!valueField || valueField.value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('value must be a valid float value', {\n                nodes: ast,\n            });\n        }\n        const value = {\n            unit: unitField.value.value,\n            value: parseFloat(valueField.value.value),\n        };\n        return amountFiatValidation(value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountFiat.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number'; // TS type in string form, update this accordingly\nexport const typedef = 'scalar Amount_Money';\nexport const schema = z.number(); // Update this code accordingly\nexport const stringSchema = 'z.number()'; // Update this code accordingly\nconst amountMoneyValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Money',\n    description: 'A custom scalar that represents a monetary amount in a currency',\n    serialize: amountMoneyValidation,\n    parseValue: amountMoneyValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('Value is not a float type', {\n                nodes: value,\n            });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountMoneyValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountMoney.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number'; // TS type in string form, update this accordingly\nexport const typedef = 'scalar Amount_Percentage';\nexport const schema = z.number(); // Update this code accordingly\nexport const stringSchema = 'z.number()'; // Update this code accordingly\nconst amountPercentageValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Percentage',\n    description: '',\n    serialize: amountPercentageValidation,\n    parseValue: amountPercentageValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountPercentageValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountPercentage.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'number';\nexport const typedef = 'scalar Amount_Tokens';\nexport const schema = z.number();\nexport const stringSchema = 'z.number()';\nconst amountTokensValidation = (value) => {\n    if (typeof value !== 'number') {\n        throw new GraphQLError(`Value is not number: ${JSON.stringify(value)}`);\n    }\n    if (!Number.isFinite(value)) {\n        throw new GraphQLError(`Value is not a finite number: ${value}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Amount_Tokens',\n    description: 'A custom scalar that represents an amount of tokens',\n    serialize: amountTokensValidation,\n    parseValue: amountTokensValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.FLOAT) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        const parsedValue = parseFloat(value.value);\n        return amountTokensValidation(parsedValue);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=AmountTokens.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar Currency';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst currencyValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Currency',\n    description: 'A custom scalar that represents a Currency Code string',\n    serialize: currencyValidation,\n    parseValue: currencyValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return currencyValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Currency.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar Date';\nexport const schema = z.iso.datetime();\nexport const stringSchema = 'z.iso.datetime()';\nconst datetimeValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'Date',\n    description: 'A custom scalar that represents a datetime in ISO 8601 format (Time: 00:00:00)',\n    serialize: datetimeValidation,\n    parseValue: datetimeValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return datetimeValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=Date.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar DateTime';\nexport const schema = z.iso.datetime();\nexport const stringSchema = 'z.iso.datetime()';\nconst datetimeValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'DateTime',\n    description: 'A custom scalar that represents a datetime in ISO 8601 format',\n    serialize: datetimeValidation,\n    parseValue: datetimeValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return datetimeValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=DateTime.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string'; // TS type in string form\nexport const typedef = 'scalar EmailAddress';\nexport const schema = z.email();\nexport const stringSchema = 'z.email()';\nconst emailValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'EmailAddress',\n    description: 'A field whose value conforms to the standard internet email address format as specified in RFC822: https://www.w3.org/Protocols/rfc822/.',\n    serialize: emailValidation,\n    parseValue: emailValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Can only validate strings as email addresses but got a: ${value.kind}`, { nodes: value });\n        }\n        return emailValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=EmailAddress.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar EthereumAddress';\nexport const schema = z.string().regex(/^0x[a-fA-F0-9]{40}$/, {\n    message: 'Invalid Ethereum address format',\n});\nexport const stringSchema = \"z.string().regex(/^0x[a-fA-F0-9]{40}$/, { message: 'Invalid Ethereum address format' })\";\nconst addressValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'EthereumAddress',\n    description: 'A custom scalar representing an Ethereum address, validated as a 42-character hexadecimal string prefixed with \"0x\"',\n    serialize: addressValidation,\n    parseValue: addressValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('some error message', { nodes: value });\n        }\n        return addressValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=EthereumAddress.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar OID';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst oIdValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'OID',\n    description: 'A custom scalar that represents a OID string',\n    serialize: oIdValidation,\n    parseValue: oIdValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return oIdValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=OID.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar OLabel';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst oLabelValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'OLabel',\n    description: 'A custom scalar that represents a OLabel string',\n    serialize: oLabelValidation,\n    parseValue: oLabelValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return oLabelValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=OLabel.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar PHID';\nexport const schema = z.string();\nexport const stringSchema = 'z.string()';\nconst phidlValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'PHID',\n    description: 'A custom scalar that represents a PowerhouseID string',\n    serialize: phidlValidation,\n    parseValue: phidlValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError(`Value is not a valid string: ${value.kind}`, {\n                nodes: value,\n            });\n        }\n        return phidlValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=PHID.js.map","import { GraphQLError, GraphQLScalarType, Kind } from 'graphql';\nimport { z } from 'zod';\nexport const type = 'string';\nexport const typedef = 'scalar URL';\nexport const schema = z.url();\nexport const stringSchema = 'z.url()';\nconst urlValidation = (value) => {\n    if (typeof value !== 'string') {\n        throw new GraphQLError(`Value is not iso string: ${JSON.stringify(value)}`);\n    }\n    const result = schema.safeParse(value);\n    if (result.success)\n        return result.data;\n    throw new GraphQLError(result.error.message);\n};\nexport const config = {\n    name: 'URL',\n    description: 'A custom scalar that represents a URL string',\n    serialize: urlValidation,\n    parseValue: urlValidation,\n    parseLiteral: (value) => {\n        if (value.kind !== Kind.STRING) {\n            throw new GraphQLError('Value is not an string', { nodes: value });\n        }\n        return urlValidation(value.value);\n    },\n};\nexport const scalar = new GraphQLScalarType(config);\n//# sourceMappingURL=URL.js.map","// @ts-check\n\n/**\n * @import GraphQLUpload from \"./GraphQLUpload.mjs\"\n * @import processRequest, { FileUpload } from \"./processRequest.mjs\"\n */\n\n/**\n * A file expected to be uploaded as it was declared in the `map` field of a\n * [GraphQL multipart request](https://github.com/jaydenseric/graphql-multipart-request-spec).\n * The {@linkcode processRequest} function places references to an instance of\n * this class wherever the file is expected in the GraphQL operation. The scalar\n * {@linkcode GraphQLUpload} derives it’s value from {@linkcode Upload.promise}.\n */\nexport default class Upload {\n  constructor() {\n    /**\n     * Promise that resolves file upload details. This should only be utilized\n     * by {@linkcode GraphQLUpload}.\n     * @type {Promise<FileUpload>}\n     */\n    this.promise = new Promise((resolve, reject) => {\n      /**\n       * Resolves the upload promise with the file upload details. This should\n       * only be utilized by {@linkcode processRequest}.\n       * @param {FileUpload} file File upload details.\n       */\n      this.resolve = (file) => {\n        /**\n         * The file upload details, available when the\n         * {@linkcode Upload.promise} resolves. This should only be utilized by\n         * {@linkcode processRequest}.\n         * @type {FileUpload | undefined}\n         */\n        this.file = file;\n\n        resolve(file);\n      };\n\n      /**\n       * Rejects the upload promise with an error. This should only be\n       * utilized by {@linkcode processRequest}.\n       * @param {Error} error Error instance.\n       */\n      this.reject = reject;\n    });\n\n    // Prevent errors crashing Node.js, see:\n    // https://github.com/nodejs/node/issues/20392\n    this.promise.catch(() => {});\n  }\n}\n","// @ts-check\n\nimport { GraphQLError, GraphQLScalarType } from \"graphql\";\n\nimport Upload from \"./Upload.mjs\";\n\n/** @typedef {import(\"./processRequest.mjs\").FileUpload} FileUpload */\n\n/**\n * A GraphQL scalar `Upload` that can be used in a\n * [`GraphQLSchema`](https://graphql.org/graphql-js/type/#graphqlschema). It’s\n * value in resolvers is a promise that resolves\n * {@link FileUpload file upload details} for processing and storage.\n * @example\n * A schema built using the function\n * [`makeExecutableSchema`](https://www.graphql-tools.com/docs/api/modules/schema_src#makeexecutableschema)\n * from [`@graphql-tools/schema`](https://npm.im/@graphql-tools/schema):\n *\n * ```js\n * import { makeExecutableSchema } from \"@graphql-tools/schema/makeExecutableSchema\";\n * import GraphQLUpload from \"graphql-upload/GraphQLUpload.mjs\";\n *\n * const schema = makeExecutableSchema({\n *   typeDefs: `\n *     scalar Upload\n *   `,\n *   resolvers: {\n *     Upload: GraphQLUpload,\n *   },\n * });\n * ```\n * @example\n * A manually constructed schema with an image upload mutation:\n *\n * ```js\n * import { GraphQLBoolean, GraphQLObjectType, GraphQLSchema } from \"graphql\";\n * import GraphQLUpload from \"graphql-upload/GraphQLUpload.mjs\";\n *\n * const schema = new GraphQLSchema({\n *   mutation: new GraphQLObjectType({\n *     name: \"Mutation\",\n *     fields: {\n *       uploadImage: {\n *         description: \"Uploads an image.\",\n *         type: GraphQLBoolean,\n *         args: {\n *           image: {\n *             description: \"Image file.\",\n *             type: GraphQLUpload,\n *           },\n *         },\n *         async resolve(parent, { image }) {\n *           const { filename, mimetype, createReadStream } = await image;\n *           const stream = createReadStream();\n *           // Promisify the stream and store the file, then…\n *           return true;\n *         },\n *       },\n *     },\n *   }),\n * });\n * ```\n * @example\n * In a [TypeScript](https://typescriptlang.org) module, how to import the type\n * for the {@link FileUpload file upload details} that the\n * {@linkcode GraphQLUpload} scalar resolver value promise resolves:\n *\n * ```ts\n * import type { FileUpload } from \"graphql-upload/processRequest.mjs\";\n * ```\n */\nconst GraphQLUpload = new GraphQLScalarType({\n  name: \"Upload\",\n  description: \"The `Upload` scalar type represents a file upload.\",\n  parseValue(value) {\n    if (value instanceof Upload) return value.promise;\n    throw new GraphQLError(\"Upload value invalid.\");\n  },\n  parseLiteral(node) {\n    throw new GraphQLError(\"Upload literal unsupported.\", { nodes: node });\n  },\n  serialize() {\n    throw new GraphQLError(\"Upload serialization unsupported.\");\n  },\n});\n\nexport default GraphQLUpload;\n","import GraphQLUpload from 'graphql-upload/GraphQLUpload.mjs';\nexport const type = 'File';\nexport const typedef = 'scalar Upload';\nexport const config = {\n    name: 'Upload',\n    description: 'A custom scalar that represents a file upload',\n};\n// This export is required to satisfy the `validationSchema` generator\nexport const stringSchema = 'z.any()';\nexport const scalar = GraphQLUpload;\n//# sourceMappingURL=File.js.map","// namespace imports -- DO NOT REMOVE OR EDIT THIS COMMENT\nimport * as Amount from './Amount.js';\nimport * as AmountCrypto from './AmountCrypto.js';\nimport * as AmountCurrency from './AmountCurrency.js';\nimport * as AmountFiat from './AmountFiat.js';\nimport * as AmountMoney from './AmountMoney.js';\nimport * as AmountPercentage from './AmountPercentage.js';\nimport * as AmountTokens from './AmountTokens.js';\nimport * as Currency from './Currency.js';\nimport * as DateScalar from './Date.js';\nimport * as DateTime from './DateTime.js';\nimport * as EmailAddress from './EmailAddress.js';\nimport * as EthereumAddress from './EthereumAddress.js';\nimport * as OID from './OID.js';\nimport * as OLabel from './OLabel.js';\nimport * as PHID from './PHID.js';\nimport * as URLScalar from './URL.js';\nimport * as File from './File.js';\nexport { Amount, AmountCrypto, AmountCurrency, AmountFiat, AmountMoney, AmountPercentage, \n// export object -- DO NOT REMOVE OR EDIT THIS COMMENT\nAmountTokens, Currency, DateScalar, DateTime, EmailAddress, EthereumAddress, File, OID, OLabel, PHID, URLScalar, };\nexport const customScalars = {\n    // @ts-expect-error - it works this way\n    Amount,\n    // @ts-expect-error - it works this way\n    AmountCrypto,\n    // @ts-expect-error - it works this way\n    AmountCurrency,\n    // @ts-expect-error - it works this way\n    AmountFiat,\n    AmountMoney,\n    AmountPercentage,\n    AmountTokens,\n    Currency,\n    DateScalar,\n    DateTime,\n    EmailAddress,\n    EthereumAddress,\n    // @ts-expect-error - it works this way\n    File,\n    OID,\n    OLabel,\n    PHID,\n    URLScalar,\n};\nexport const resolvers = {\n    // export resolvers -- DO NOT REMOVE OR EDIT THIS COMMENT\n    AmountTokens: AmountTokens.scalar,\n    EthereumAddress: EthereumAddress.scalar,\n    AmountPercentage: AmountPercentage.scalar,\n    EmailAddress: EmailAddress.scalar,\n    Date: DateScalar.scalar,\n    DateTime: DateTime.scalar,\n    URL: URLScalar.scalar,\n    AmountMoney: AmountMoney.scalar,\n    OLabel: OLabel.scalar,\n    Currency: Currency.scalar,\n    PHID: PHID.scalar,\n    OID: OID.scalar,\n    AmountFiat: AmountFiat.scalar,\n    AmountCurrency: AmountCurrency.scalar,\n    AmountCrypto: AmountCrypto.scalar,\n    Amount: Amount.scalar,\n    Upload: File.scalar,\n};\nexport const typeDefs = [\n    // export typedefs -- DO NOT REMOVE OR EDIT THIS COMMENT\n    AmountTokens.typedef,\n    EthereumAddress.typedef,\n    AmountPercentage.typedef,\n    EmailAddress.typedef,\n    DateScalar.typedef,\n    DateTime.typedef,\n    URLScalar.typedef,\n    AmountMoney.typedef,\n    OLabel.typedef,\n    Currency.typedef,\n    PHID.typedef,\n    OID.typedef,\n    AmountFiat.typedef,\n    AmountCurrency.typedef,\n    AmountCrypto.typedef,\n    Amount.typedef,\n    File.typedef,\n];\nexport const generatorTypeDefs = {\n    // export generator typedefs -- DO NOT REMOVE OR EDIT THIS COMMENT\n    [AmountTokens.config.name]: AmountTokens.type,\n    [EthereumAddress.config.name]: EthereumAddress.type,\n    [EmailAddress.config.name]: EmailAddress.type,\n    [AmountPercentage.config.name]: AmountPercentage.type,\n    [DateScalar.config.name]: DateScalar.type,\n    [DateTime.config.name]: DateTime.type,\n    [URLScalar.config.name]: URLScalar.type,\n    [AmountMoney.config.name]: AmountMoney.type,\n    [OLabel.config.name]: OLabel.type,\n    [Currency.config.name]: Currency.type,\n    [PHID.config.name]: PHID.type,\n    [OID.config.name]: OID.type,\n    [AmountFiat.config.name]: AmountFiat.type,\n    [AmountCurrency.config.name]: AmountCurrency.type,\n    [AmountCrypto.config.name]: AmountCrypto.type,\n    [Amount.config.name]: Amount.type,\n    [File.config.name]: File.type,\n};\nexport const validationSchema = {\n    // export validation schema -- DO NOT REMOVE OR EDIT THIS COMMENT\n    [AmountTokens.config.name]: AmountTokens.stringSchema,\n    [EthereumAddress.config.name]: EthereumAddress.stringSchema,\n    [EmailAddress.config.name]: EmailAddress.stringSchema,\n    [AmountPercentage.config.name]: AmountPercentage.stringSchema,\n    [DateScalar.config.name]: DateScalar.stringSchema,\n    [DateTime.config.name]: DateTime.stringSchema,\n    [URLScalar.config.name]: URLScalar.stringSchema,\n    [AmountMoney.config.name]: AmountMoney.stringSchema,\n    [OLabel.config.name]: OLabel.stringSchema,\n    [Currency.config.name]: Currency.stringSchema,\n    [PHID.config.name]: PHID.stringSchema,\n    [OID.config.name]: OID.stringSchema,\n    [AmountFiat.config.name]: AmountFiat.stringSchema,\n    [AmountCurrency.config.name]: AmountCurrency.stringSchema,\n    [AmountCrypto.config.name]: AmountCrypto.stringSchema,\n    [Amount.config.name]: Amount.stringSchema,\n    [File.config.name]: File.stringSchema,\n};\n//# sourceMappingURL=scalars.js.map","import { typeDefs } from \"@powerhousedao/document-engineering/graphql\";\nimport { buildSchema, printSchema } from \"graphql\";\n\nexport const hiddenQueryTypeDefDoc = `type Query {\n  _hidden: String\n}\n`;\n\nexport const typeDefsDoc = typeDefs.join(\"\\n\");\n\nexport const initialSchemaDoc = `${hiddenQueryTypeDefDoc}\\n${typeDefsDoc}`;\n\nexport const initialSchema = buildSchema(initialSchemaDoc);\nexport const initialSchemaStr = printSchema(initialSchema);\n\nexport const specialDocIds = {\n  hiddenQueryTypeDef: \"hidden-query-type-defs\",\n  standardLib: \"standard-lib\",\n  global: \"global\",\n  local: \"local\",\n} as const;\n\nexport const updateTimeout = 5000;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93],"mappings":";;;AAAA,MAAM,kBAAkB;;;;AAKxB,SAAgB,WAAW,UAAU,WAAW;CAC9C,MAAM,CAAC,YAAY,kBAAkB,YACjC,CAAC,UAAU,UAAU,GACrB,CAAC,KAAA,GAAW,SAAS;CACzB,IAAI,UAAU;AAEd,KAAI,WACF,YAAW,aAAa;CAG1B,MAAM,cAAc,eAAe,KAAK,MAAM,IAAI,EAAE,GAAG;AAEvD,SAAQ,YAAY,QAApB;EACE,KAAK,EACH,QAAO;EAET,KAAK,EACH,QAAO,UAAU,YAAY,KAAK;EAEpC,KAAK,EACH,QAAO,UAAU,YAAY,KAAK,SAAS,YAAY,KAAK;;CAGhE,MAAM,WAAW,YAAY,MAAM,GAAG,gBAAgB;CACtD,MAAM,WAAW,SAAS,KAAK;AAC/B,QAAO,UAAU,SAAS,KAAK,KAAK,GAAG,UAAU,WAAW;;;;;;;AC3B9D,SAAgB,aAAa,GAAG;AAC9B,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACuBT,SAAgB,OAAO,MAAM,OAAO;CAClC,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,QAAQ,KACjB,QAAO,MAAM,KAAK,IAAI;AAGxB,QAAO;;;;;;;;;;;;;;;;;;;;;ACjBT,SAAgB,UAAU,MAAM,OAAO,OAAO;CAC5C,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,QAAQ,KACjB,QAAO,MAAM,KAAK,IAAI,MAAM,KAAK;AAGnC,QAAO;;;;;;;;ACpBT,SAAgB,SAAS,KAAK,IAAI;CAChC,MAAM,SAAS,OAAO,OAAO,KAAK;AAElC,MAAK,MAAM,OAAO,OAAO,KAAK,IAAI,CAChC,QAAO,OAAO,GAAG,IAAI,MAAM,IAAI;AAGjC,QAAO;;;;;;;;;;;ACJT,SAAgB,eAAe,MAAM,MAAM;CACzC,IAAI,SAAS;CACb,IAAI,SAAS;AAEb,QAAO,SAAS,KAAK,UAAU,SAAS,KAAK,QAAQ;EACnD,IAAI,QAAQ,KAAK,WAAW,OAAO;EACnC,IAAI,QAAQ,KAAK,WAAW,OAAO;AAEnC,MAAI,QAAQ,MAAM,IAAI,QAAQ,MAAM,EAAE;GACpC,IAAI,OAAO;AAEX,MAAG;AACD,MAAE;AACF,WAAO,OAAO,KAAK,QAAQ;AAC3B,YAAQ,KAAK,WAAW,OAAO;YACxB,QAAQ,MAAM,IAAI,OAAO;GAElC,IAAI,OAAO;AAEX,MAAG;AACD,MAAE;AACF,WAAO,OAAO,KAAK,QAAQ;AAC3B,YAAQ,KAAK,WAAW,OAAO;YACxB,QAAQ,MAAM,IAAI,OAAO;AAElC,OAAI,OAAO,KACT,QAAO;AAGT,OAAI,OAAO,KACT,QAAO;SAEJ;AACL,OAAI,QAAQ,MACV,QAAO;AAGT,OAAI,QAAQ,MACV,QAAO;AAGT,KAAE;AACF,KAAE;;;AAIN,QAAO,KAAK,SAAS,KAAK;;AAE5B,MAAM,UAAU;AAChB,MAAM,UAAU;AAEhB,SAAS,QAAQ,MAAM;AACrB,QAAO,CAAC,MAAM,KAAK,IAAI,WAAW,QAAQ,QAAQ;;;;;;;;ACrDpD,SAAgB,eAAe,OAAO,SAAS;CAC7C,MAAM,oBAAoB,OAAO,OAAO,KAAK;CAC7C,MAAM,kBAAkB,IAAI,gBAAgB,MAAM;CAClD,MAAM,YAAY,KAAK,MAAM,MAAM,SAAS,GAAI,GAAG;AAEnD,MAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,WAAW,gBAAgB,QAAQ,QAAQ,UAAU;AAE3D,MAAI,aAAa,KAAA,EACf,mBAAkB,UAAU;;AAIhC,QAAO,OAAO,KAAK,kBAAkB,CAAC,MAAM,GAAG,MAAM;EACnD,MAAM,eAAe,kBAAkB,KAAK,kBAAkB;AAC9D,SAAO,iBAAiB,IAAI,eAAe,eAAe,GAAG,EAAE;GAC/D;;;;;;;;;;;;;;;;AAiBJ,IAAM,kBAAN,MAAsB;CACpB,YAAY,OAAO;AACjB,OAAK,SAAS;AACd,OAAK,kBAAkB,MAAM,aAAa;AAC1C,OAAK,cAAc,cAAc,KAAK,gBAAgB;AACtD,OAAK,QAAQ;GACX,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACnC,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACnC,IAAI,MAAM,MAAM,SAAS,EAAE,CAAC,KAAK,EAAE;GACpC;;CAGH,QAAQ,QAAQ,WAAW;AACzB,MAAI,KAAK,WAAW,OAClB,QAAO;EAGT,MAAM,kBAAkB,OAAO,aAAa;AAE5C,MAAI,KAAK,oBAAoB,gBAC3B,QAAO;EAGT,IAAI,IAAI,cAAc,gBAAgB;EACtC,IAAI,IAAI,KAAK;AAEb,MAAI,EAAE,SAAS,EAAE,QAAQ;GACvB,MAAM,MAAM;AACZ,OAAI;AACJ,OAAI;;EAGN,MAAM,UAAU,EAAE;EAClB,MAAM,UAAU,EAAE;AAElB,MAAI,UAAU,UAAU,UACtB;EAGF,MAAM,OAAO,KAAK;AAElB,OAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAC5B,MAAK,GAAG,KAAK;AAGf,OAAK,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;GACjC,MAAM,QAAQ,MAAM,IAAI,KAAK;GAC7B,MAAM,aAAa,KAAK,IAAI;GAC5B,IAAI,eAAgB,WAAW,KAAK;AAEpC,QAAK,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;IACjC,MAAM,OAAO,EAAE,IAAI,OAAO,EAAE,IAAI,KAAK,IAAI;IACzC,IAAI,cAAc,KAAK,IACrB,MAAM,KAAK,GACX,WAAW,IAAI,KAAK,GACpB,MAAM,IAAI,KAAK,KAChB;AAED,QAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,IAAI;KAEpE,MAAM,qBAAqB,MAAM,IAAI,KAAK,GAAG,IAAI;AACjD,mBAAc,KAAK,IAAI,aAAa,qBAAqB,EAAE;;AAG7D,QAAI,cAAc,aAChB,gBAAe;AAGjB,eAAW,KAAK;;AAGlB,OAAI,eAAe,UACjB;;EAIJ,MAAM,WAAW,KAAK,UAAU,GAAG;AACnC,SAAO,YAAY,YAAY,WAAW,KAAA;;;AAI9C,SAAS,cAAc,KAAK;CAC1B,MAAM,YAAY,IAAI;CACtB,MAAM,QAAQ,IAAI,MAAM,UAAU;AAElC,MAAK,IAAI,IAAI,GAAG,IAAI,WAAW,EAAE,EAC/B,OAAM,KAAK,IAAI,WAAW,EAAE;AAG9B,QAAO;;;;AChIT,SAAgB,SAAS,KAAK;AAC5B,KAAI,OAAO,KACT,QAAO,OAAO,OAAO,KAAK;AAG5B,KAAI,OAAO,eAAe,IAAI,KAAK,KACjC,QAAO;CAGT,MAAM,MAAM,OAAO,OAAO,KAAK;AAE/B,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,CAC5C,KAAI,OAAO;AAGb,QAAO;;;;;;;;ACXT,SAAgB,YAAY,KAAK;AAC/B,QAAO,IAAI,IAAI,QAAQ,eAAe,gBAAgB,CAAC;;AAGzD,MAAM,gBAAgB;AAEtB,SAAS,gBAAgB,KAAK;AAC5B,QAAO,gBAAgB,IAAI,WAAW,EAAE;;AAG1C,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD;;;;;;;ACtKD,MAAa,QAAQ,OAAO,OAAO,EAAE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFtC,SAAgB,MAAM,MAAM,SAAS,cAAc,mBAAmB;CACpE,MAAM,gCAAgB,IAAI,KAAK;AAE/B,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,CACpC,eAAc,IAAI,MAAM,qBAAqB,SAAS,KAAK,CAAC;CAI9D,IAAI,QAAQ,KAAA;CACZ,IAAI,UAAU,MAAM,QAAQ,KAAK;CACjC,IAAI,OAAO,CAAC,KAAK;CACjB,IAAI,QAAQ;CACZ,IAAI,QAAQ,EAAE;CACd,IAAI,OAAO;CACX,IAAI,MAAM,KAAA;CACV,IAAI,SAAS,KAAA;CACb,MAAM,OAAO,EAAE;CACf,MAAM,YAAY,EAAE;AAGpB,IAAG;AACD;EACA,MAAM,YAAY,UAAU,KAAK;EACjC,MAAM,WAAW,aAAa,MAAM,WAAW;AAE/C,MAAI,WAAW;AACb,SAAM,UAAU,WAAW,IAAI,KAAA,IAAY,KAAK,KAAK,SAAS;AAC9D,UAAO;AACP,YAAS,UAAU,KAAK;AAExB,OAAI,SACF,KAAI,SAAS;AACX,WAAO,KAAK,OAAO;IACnB,IAAI,aAAa;AAEjB,SAAK,MAAM,CAAC,SAAS,cAAc,OAAO;KACxC,MAAM,WAAW,UAAU;AAE3B,SAAI,cAAc,MAAM;AACtB,WAAK,OAAO,UAAU,EAAE;AACxB;WAEA,MAAK,YAAY;;UAGhB;AACL,WAAO,EAAE,GAAG,MAAM;AAElB,SAAK,MAAM,CAAC,SAAS,cAAc,MACjC,MAAK,WAAW;;AAKtB,WAAQ,MAAM;AACd,UAAO,MAAM;AACb,WAAQ,MAAM;AACd,aAAU,MAAM;AAChB,WAAQ,MAAM;aACL,QAAQ;AACjB,SAAM,UAAU,QAAQ,KAAK;AAC7B,UAAO,OAAO;AAEd,OAAI,SAAS,QAAQ,SAAS,KAAA,EAC5B;AAGF,QAAK,KAAK,IAAI;;EAGhB,IAAI;AAEJ,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAE;GACxB,IAAI,oBAAoB;AAExB,UAAO,KAAK,IAAI,UAAU,OAAO,qBAAqB,QAAQ,KAAK,CAAC,GAAG;GACvE,MAAM,UAAU,aACX,qBAAqB,cAAc,IAAI,KAAK,KAAK,MAAM,QACxD,uBAAuB,KAAK,IAC1B,KAAK,IACL,mBAAmB,SACpB,sBAAsB,cAAc,IAAI,KAAK,KAAK,MAAM,QACzD,wBAAwB,KAAK,IAC7B,KAAK,IACL,oBAAoB;AACxB,YACE,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ,KAAK,SAAS,MAAM,KAAK,QAAQ,MAAM,UAAU;AAE/D,OAAI,WAAW,MACb;AAGF,OAAI,WAAW;QACT,CAAC,WAAW;AACd,UAAK,KAAK;AACV;;cAEO,WAAW,KAAA,GAAW;AAC/B,UAAM,KAAK,CAAC,KAAK,OAAO,CAAC;AAEzB,QAAI,CAAC,UACH,KAAI,OAAO,OAAO,CAChB,QAAO;SACF;AACL,UAAK,KAAK;AACV;;;;AAMR,MAAI,WAAW,KAAA,KAAa,SAC1B,OAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AAGzB,MAAI,UACF,MAAK,KAAK;OACL;GACL,IAAI;AAEJ,WAAQ;IACN;IACA;IACA;IACA;IACA,MAAM;IACP;AACD,aAAU,MAAM,QAAQ,KAAK;AAC7B,UAAO,UACH,QACC,aAAa,YAAY,KAAK,WAAW,QAC1C,eAAe,KAAK,IACpB,aACA,EAAE;AACN,WAAQ;AACR,WAAQ,EAAE;AAEV,OAAI,OACF,WAAU,KAAK,OAAO;AAGxB,YAAS;;UAEJ,UAAU,KAAA;AAEnB,KAAI,MAAM,WAAW,EAEnB,QAAO,MAAM,MAAM,SAAS,GAAG;AAGjC,QAAO;;;;;;;;AAST,SAAgB,gBAAgB,UAAU;CACxC,MAAM,WAAW,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAK;CACtD,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,MAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,EAAE;EACtC,IAAI,aAAa;EACjB,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;EAC5D,MAAM,YAAY,IAAI,MAAM,SAAS,OAAO,CAAC,KAAK,KAAA,EAAU;AAE5D,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;GACxC,MAAM,EAAE,OAAO,UAAU,qBAAqB,SAAS,IAAI,KAAK;AAChE,kBAAe,aAAa,SAAS,QAAQ,SAAS;AACtD,aAAU,KAAK;AACf,aAAU,KAAK;;AAGjB,MAAI,CAAC,WACH;AAkDF,gBAAc,QA/CW;GACvB,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,MACpB,UAAS,KAAK;cACL,WAAW,KAAA,EACpB,QAAO;;;GAMf,MAAM,GAAG,MAAM;IACb,MAAM,OAAO,KAAK;AAElB,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,KAAI,SAAS,OAAO,MAAM;KACxB,IAAI;KAEJ,MAAM,UACH,eAAe,UAAU,QAAQ,QAAQ,iBAAiB,KAAK,IAC5D,KAAK,IACL,aAAa,MAAM,SAAS,IAAI,KAAK;AAE3C,SAAI,WAAW,MACb,UAAS,KAAK;cACL,WAAW,KAAA,KAAa,WAAW,MAC5C,QAAO;eAEA,SAAS,OAAO,KACzB,UAAS,KAAK;;GAIrB;;AAIH,QAAO;;;;;AAMT,SAAgB,qBAAqB,SAAS,MAAM;CAClD,MAAM,cAAc,QAAQ;AAE5B,KAAI,OAAO,gBAAgB,SAEzB,QAAO;UACE,OAAO,gBAAgB,WAEhC,QAAO;EACL,OAAO;EACP,OAAO,KAAA;EACR;AAGH,QAAO;EACL,OAAO,QAAQ;EACf,OAAO,QAAQ;EAChB;;;;;;;;AC/UH,SAAgB,MAAM,KAAK;AACzB,QAAO,MAAM,KAAK,mBAAmB;;AAEvC,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;CACzB,MAAM,EACJ,QAAQ,SAAS,KAAK,OACvB;CACD,UAAU,EACR,QAAQ,SAAS,MAAM,KAAK,MAC7B;CAED,UAAU,EACR,QAAQ,SAAS,KAAK,KAAK,aAAa,OAAO,EAChD;CACD,qBAAqB,EACnB,MAAM,MAAM;EACV,MAAM,UAAU,kBAAkB,KAAK,oBAAoB,GACvD,KAAK,OAAO,KAAK,KAAK,qBAAqB,KAAK,EAAE,MAAM,GACxD,KAAK,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI;EACxD,MAAM,SACJ,KAAK,IAAI,KAAK,aAAa,KAAK,GAChC,KACE;GACE,KAAK;GACL,KAAK,CAAC,KAAK,MAAM,QAAQ,CAAC;GAC1B,KAAK,KAAK,YAAY,IAAI;GAC3B,EACD,IACD;AAGH,UAAQ,WAAW,UAAU,KAAK,SAAS,OAAO,KAAK;IAE1D;CACD,oBAAoB,EAClB,QAAQ,EAAE,UAAU,MAAM,cAAc,YAAY,kBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,WACA,OACA,OACA,KAAK,OAAO,aAAa,GACzB,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,cAAc,EACZ,QAAQ,EAAE,iBAAiB,MAAM,WAAW,EAC7C;CACD,OAAO,EACL,MAAM,EAAE,OAAO,MAAM,WAAW,MAAM,YAAY,gBAAgB;EAChE,MAAM,SAAS,KAAK,IAAI,OAAO,KAAK,GAAG;EACvC,IAAI,WAAW,SAAS,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI;AAExD,MAAI,SAAS,SAAS,gBACpB,YAAW,SAAS,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM;AAGlE,SAAO,KAAK;GAAC;GAAU,KAAK,YAAY,IAAI;GAAE;GAAa,EAAE,IAAI;IAEpE;CACD,UAAU,EACR,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,gBAAgB,EACd,QAAQ,EAAE,MAAM,iBACd,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EAClD;CACD,gBAAgB,EACd,QAAQ,EAAE,eAAe,YAAY,mBACnC,KACE;EACE;EACA,KAAK,OAAO,cAAc;EAC1B,KAAK,YAAY,IAAI;EACrB;EACD,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EACN,MACA,eACA,qBACA,YACA,cACA,kBAEA,KAAK,IAAI,aAAa,KAAK,GAE3B,YAAY,OAAO,KAAK,KAAK,KAAK,qBAAqB,KAAK,EAAE,IAAI,CAAC,MAC7D,cAAc,GAAG,KAAK,IAAI,KAAK,YAAY,IAAI,EAAE,IAAI,KAC3D,cACH;CAED,UAAU,EACR,QAAQ,EAAE,YAAY,OACvB;CACD,YAAY,EACV,QAAQ,EAAE,YAAY,OACvB;CACD,aAAa,EACX,QAAQ,EAAE,OAAO,OAAO,oBACtB,gBAAgB,iBAAiB,MAAM,GAAG,YAAY,MAAM,EAC/D;CACD,cAAc,EACZ,QAAQ,EAAE,YAAa,QAAQ,SAAS,SACzC;CACD,WAAW,EACT,aAAa,QACd;CACD,WAAW,EACT,QAAQ,EAAE,YAAY,OACvB;CACD,WAAW,EACT,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,aAAa,MAAM,KAAK,QAAQ,KAAK,GAAG,KACnD;CACD,aAAa,EACX,QAAQ,EAAE,MAAM,YAAY,OAAO,OAAO,OAC3C;CAED,WAAW,EACT,QAAQ,EAAE,MAAM,WAAW,WACzB,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,EAChD;CAED,WAAW,EACT,QAAQ,EAAE,WAAW,MACtB;CACD,UAAU,EACR,QAAQ,EAAE,WAAW,MAAM,OAAO,KACnC;CACD,aAAa,EACX,QAAQ,EAAE,WAAW,OAAO,KAC7B;CAED,kBAAkB,EAChB,QAAQ,EAAE,aAAa,YAAY,qBACjC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAAE,IAAI,EACtE;CACD,yBAAyB,EACvB,QAAQ,EAAE,WAAW,WAAW,YAAY,OAAO,MACpD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAU;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EACrD;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,iBAAiB,EACf,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,MAAM,iBAClD,KAAK,IAAI,aAAa,KAAK,GAC3B,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,IACpC,OACA,OACA,KAAK,KAAK,KAAK,YAAY,IAAI,CAAC,EACnC;CACD,sBAAsB,EACpB,QAAQ,EAAE,aAAa,MAAM,MAAM,cAAc,iBAC/C,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC,OAAO,OAAO;EAAM,KAAK,MAAM,aAAa;EAAE,KAAK,YAAY,IAAI;EAAC,EACrE,IACD,EACJ;CACD,yBAAyB,EACvB,QAAQ,EAAE,aAAa,MAAM,YAAY,YAAY,aACnD,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,YAAY,YACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KACE;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAAC,EACtE,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAQ;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAClE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,iBAC3B,KAAK,IAAI,aAAa,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,YAAY,IAAI,CAAC,EAAE,IAAI,EACzE;CACD,2BAA2B,EACzB,QAAQ,EAAE,aAAa,MAAM,YAAY,aACvC,KAAK,IAAI,aAAa,KAAK,GAC3B,KAAK;EAAC;EAAS;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACnE;CACD,qBAAqB,EACnB,QAAQ,EAAE,aAAa,MAAM,WAAW,MAAM,YAAY,gBACxD,KAAK,IAAI,aAAa,KAAK,GAC3B,gBACA,QACC,kBAAkB,KAAK,GACpB,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,MAAM,GAC5C,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,IAAI,KACnC,aAAa,gBAAgB,MAC9B,SACA,KAAK,WAAW,MAAM,EACzB;CACD,iBAAiB,EACf,QAAQ,EAAE,YAAY,qBACpB,KACE;EAAC;EAAiB,KAAK,YAAY,IAAI;EAAE,MAAM,eAAe;EAAC,EAC/D,IACD,EACJ;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,iBACd,KAAK;EAAC;EAAiB;EAAM,KAAK,YAAY,IAAI;EAAC,EAAE,IAAI,EAC5D;CACD,qBAAqB,EACnB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,wBAAwB,EACtB,QAAQ,EAAE,MAAM,YAAY,YAAY,aACtC,KACE;EACE;EACA;EACA,KAAK,eAAe,KAAK,YAAY,MAAM,CAAC;EAC5C,KAAK,YAAY,IAAI;EACrB,MAAM,OAAO;EACd,EACD,IACD,EACJ;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,YAAY,YAC1B,KACE;EACE;EACA;EACA,KAAK,YAAY,IAAI;EACrB,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;EAC/B,EACD,IACD,EACJ;CACD,mBAAmB,EACjB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAe;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EACzE;CACD,0BAA0B,EACxB,QAAQ,EAAE,MAAM,YAAY,aAC1B,KAAK;EAAC;EAAgB;EAAM,KAAK,YAAY,IAAI;EAAE,MAAM,OAAO;EAAC,EAAE,IAAI,EAC1E;CAED,gBAAgB,EACd,QAAQ,EAAE,WAAW,MACtB;CACD,kBAAkB,EAChB,QAAQ,EAAE,MAAM,iBAAiB,KAAK,CAAC,MAAM,KAAK,KAAK,WAAW,CAAC,CAAC,EACrE;CACD,oBAAoB,EAClB,QAAQ,EAAE,MAAM,WAAW,mBACzB,KAAK;EAAC;EAAM,KAAK,KAAK,UAAU;EAAE,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACpE;CACD,qBAAqB,EACnB,QAAQ,EAAE,WAAW,KAAK,CAAC,KAAK,KAAK,CAAC,EACvC;CACD,6BAA6B,EAC3B,QAAQ,EAAE,MAAM,mBACd,KAAK;EAAC;EAAK;EAAM,KAAK,KAAK,cAAc,KAAK;EAAC,CAAC,EACnD;CACF;;;;;AAMD,SAAS,KAAK,YAAY,YAAY,IAAI;CACxC,IAAI;AAEJ,SAAQ,wBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,QAAQ,MAAM,EAAE,CAAC,KAAK,UAAU,MAAM,QACrD,0BAA0B,KAAK,IAC7B,wBACA;;;;;AAMN,SAAS,MAAM,OAAO;AACpB,QAAO,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK,CAAC,EAAE,MAAM;;;;;AAMtD,SAAS,KAAK,OAAO,aAAa,MAAM,IAAI;AAC1C,QAAO,eAAe,QAAQ,gBAAgB,KAC1C,QAAQ,cAAc,MACtB;;AAGN,SAAS,OAAO,KAAK;AACnB,QAAO,KAAK,MAAM,IAAI,QAAQ,OAAO,OAAO,CAAC;;AAG/C,SAAS,kBAAkB,YAAY;CACrC,IAAI;;AAKJ,SAAQ,mBACN,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,MAAM,QAAQ,IAAI,SAAS,KAAK,CAAC,MAAM,QACtD,qBAAqB,KAAK,IACxB,mBACA;;;;;;;;;;;;;;;;;;;;AC3VN,SAAgB,oBAAoB,WAAW,WAAW;AACxD,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,KACR,QAAO;EAET,KAAK,KAAK,IACR,QAAO,SAAS,UAAU,OAAO,GAAG;EAEtC,KAAK,KAAK,MACR,QAAO,WAAW,UAAU,MAAM;EAEpC,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK,QACR,QAAO,UAAU;EAEnB,KAAK,KAAK,KACR,QAAO,UAAU,OAAO,KAAK,SAC3B,oBAAoB,MAAM,UAAU,CACrC;EAEH,KAAK,KAAK,OACR,QAAO,UACL,UAAU,SACT,UAAU,MAAM,KAAK,QACrB,UAAU,oBAAoB,MAAM,OAAO,UAAU,CACvD;EAEH,KAAK,KAAK,SACR,QAAO,cAAc,QAAQ,cAAc,KAAK,IAC5C,KAAK,IACL,UAAU,UAAU,KAAK;;;;;;;;AC3CnC,SAAgB,WAAW,MAAM;AAC/B,SAAgB,UAAU,OAAO,qBAAqB;AACtD,QAAO,SAAS,YAAY,UAAU,OAAO,gCAAgC;AAE7E,KAAI,KAAK,WAAW,EAClB,OAAM,IAAI,aAAa,0CAA0C;AAGnE,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EACjC,KAAI,CAAC,eAAe,KAAK,WAAW,EAAE,CAAC,CACrC,OAAM,IAAI,aACR,6CAA6C,KAAK,aACnD;AAIL,KAAI,CAAC,YAAY,KAAK,WAAW,EAAE,CAAC,CAClC,OAAM,IAAI,aACR,wCAAwC,KAAK,aAC9C;AAGH,QAAO;;;;;;;AAQT,SAAgB,oBAAoB,MAAM;AACxC,KAAI,SAAS,UAAU,SAAS,WAAW,SAAS,OAClD,OAAM,IAAI,aAAa,gCAAgC,OAAO;AAGhE,QAAO,WAAW,KAAK;;;;AC1BzB,SAAgB,OAAO,MAAM;AAC3B,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IAChB,kBAAkB,KAAK,IACvB,WAAW,KAAK,IAChB,cAAc,KAAK;;;;;AAcvB,SAAgB,aAAa,MAAM;AACjC,QAAO,WAAW,MAAM,kBAAkB;;AAS5C,SAAgB,aAAa,MAAM;AACjC,QAAO,WAAW,MAAM,kBAAkB;;AAS5C,SAAgB,gBAAgB,MAAM;AACpC,QAAO,WAAW,MAAM,qBAAqB;;AAW/C,SAAgB,YAAY,MAAM;AAChC,QAAO,WAAW,MAAM,iBAAiB;;AAS3C,SAAgB,WAAW,MAAM;AAC/B,QAAO,WAAW,MAAM,gBAAgB;;AAS1C,SAAgB,kBAAkB,MAAM;AACtC,QAAO,WAAW,MAAM,uBAAuB;;AAWjD,SAAgB,WAAW,MAAM;AAC/B,QAAO,WAAW,MAAM,YAAY;;AAStC,SAAgB,cAAc,MAAM;AAClC,QAAO,WAAW,MAAM,eAAe;;;;;AAazC,SAAgB,YAAY,MAAM;AAChC,QACE,aAAa,KAAK,IAClB,WAAW,KAAK,IAChB,kBAAkB,KAAK,IACtB,eAAe,KAAK,IAAI,YAAY,KAAK,OAAO;;;;;AAcrD,SAAgB,aAAa,MAAM;AACjC,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IACf,eAAe,KAAK,IAAI,aAAa,KAAK,OAAO;;;;;AActD,SAAgB,WAAW,MAAM;AAC/B,QAAO,aAAa,KAAK,IAAI,WAAW,KAAK;;;;;AAa/C,SAAgB,gBAAgB,MAAM;AACpC,QAAO,aAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,YAAY,KAAK;;;;;AAezE,SAAgB,eAAe,MAAM;AACnC,QAAO,gBAAgB,KAAK,IAAI,YAAY,KAAK;;AAEnD,SAAgB,mBAAmB,MAAM;AACvC,KAAI,CAAC,eAAe,KAAK,CACvB,OAAM,IAAI,MAAM,YAAY,QAAQ,KAAK,CAAC,iCAAiC;AAG7E,QAAO;;;;;;;;;;;;;;;;;;;;;AAsBT,IAAa,cAAb,MAAyB;CACvB,YAAY,QAAQ;AAClB,SAAO,OAAO,IACZ,UAAU,OAAO,YAAY,QAAQ,OAAO,CAAC,wBAAwB;AACvE,OAAK,SAAS;;CAGhB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO,MAAM,OAAO,KAAK,OAAO,GAAG;;CAGrC,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;AAyB1B,IAAa,iBAAb,MAA4B;CAC1B,YAAY,QAAQ;AAClB,iBAAe,OAAO,IACpB,UACE,OACA,YAAY,QAAQ,OAAO,CAAC,iCAC7B;AACH,OAAK,SAAS;;CAGhB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO,OAAO,KAAK,OAAO,GAAG;;CAG/B,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;AAO1B,SAAgB,eAAe,MAAM;AACnC,QAAO,WAAW,KAAK,IAAI,cAAc,KAAK;;;;;AAahD,SAAgB,eAAe,MAAM;AACnC,QAAO,OAAO,KAAK,IAAI,CAAC,cAAc,KAAK;;AAS7C,SAAgB,gBAAgB,MAAM;AACpC,KAAI,KACF,QAAO,cAAc,KAAK,GAAG,KAAK,SAAS;;;;;AAO/C,SAAgB,YAAY,MAAM;AAChC,QACE,aAAa,KAAK,IAClB,aAAa,KAAK,IAClB,gBAAgB,KAAK,IACrB,YAAY,KAAK,IACjB,WAAW,KAAK,IAChB,kBAAkB,KAAK;;AAU3B,SAAgB,aAAa,MAAM;AACjC,KAAI,MAAM;EACR,IAAI,gBAAgB;AAEpB,SAAO,eAAe,cAAc,CAClC,iBAAgB,cAAc;AAGhC,SAAO;;;;;;;AAQX,SAAgB,0BAA0B,OAAO;AAC/C,QAAO,OAAO,UAAU,aAAa,OAAO,GAAG;;AAEjD,SAAgB,mBAAmB,OAAO;AACxC,QAAO,OAAO,UAAU,aAAa,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CjD,IAAa,oBAAb,MAA+B;CAC7B,YAAY,QAAQ;EAClB,IAAI,oBACF,mBACA,sBACA;EAEF,MAAM,cACH,qBAAqB,OAAO,gBAAgB,QAC7C,uBAAuB,KAAK,IACxB,qBACA;AACN,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,iBAAiB,OAAO;AAC7B,OAAK,aACF,oBAAoB,OAAO,eAAe,QAC3C,sBAAsB,KAAK,IACvB,oBACA;AACN,OAAK,aAAa;AAClB,OAAK,gBACF,uBAAuB,OAAO,kBAAkB,QACjD,yBAAyB,KAAK,IAC1B,wBACC,MAAM,cAAc,WAAW,oBAAoB,MAAM,UAAU,CAAC;AAC3E,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,wBAAwB,OAAO,uBAAuB,QACvD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,kBAAkB,QACvB,OAAO,OAAO,mBAAmB,YACjC,UACE,OACA,GAAG,KAAK,KAAK,uDACC,QAAQ,OAAO,eAAe,CAAC,GAC9C;AACH,SAAO,aAAa,QAClB,OAAO,OAAO,cAAc,cAC5B,UACE,OACA,GAAG,KAAK,KAAK,8JACd;AAEH,MAAI,OAAO,aACR,QAAO,OAAO,eAAe,cAC5B,OAAO,OAAO,iBAAiB,cAC/B,UACE,OACA,GAAG,KAAK,KAAK,+DACd;;CAIP,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,gBAAgB,KAAK;GACrB,WAAW,KAAK;GAChB,YAAY,KAAK;GACjB,cAAc,KAAK;GACnB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4C1B,IAAa,oBAAb,MAA+B;CAC7B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,WAAW,OAAO;AACvB,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AAER,OAAK,gBAAgB,eAAe,OAAO;AAE3C,OAAK,oBAAoB,iBAAiB,OAAO;AAEjD,SAAO,YAAY,QACjB,OAAO,OAAO,aAAa,cAC3B,UACE,OACA,GAAG,KAAK,KAAK,mDACC,QAAQ,OAAO,SAAS,CAAC,GACxC;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,gBAAgB;AACd,MAAI,OAAO,KAAK,gBAAgB,WAC9B,MAAK,cAAc,KAAK,aAAa;AAGvC,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,YAAY,KAAK,eAAe;GAChC,QAAQ,qBAAqB,KAAK,WAAW,CAAC;GAC9C,UAAU,KAAK;GACf,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,iBAAiB,QAAQ;CAChC,IAAI;CAEJ,MAAM,aAAa,2BAChB,qBAAqB,OAAO,gBAAgB,QAC3C,uBAAuB,KAAK,IAC1B,qBACA,EAAE,CACP;AACD,OAAM,QAAQ,WAAW,IACvB,UACE,OACA,GAAG,OAAO,KAAK,oEAChB;AACH,QAAO;;AAGT,SAAS,eAAe,QAAQ;CAC9B,MAAM,WAAW,mBAAmB,OAAO,OAAO;AAClD,YAAW,SAAS,IAClB,UACE,OACA,GAAG,OAAO,KAAK,gGAChB;AACH,QAAO,SAAS,WAAW,aAAa,cAAc;EACpD,IAAI;AAEJ,aAAW,YAAY,IACrB,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,kCAC7B;AACH,cAAY,WAAW,QACrB,OAAO,YAAY,YAAY,cAC/B,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,2DACJ,QAAQ,YAAY,QAAQ,CAAC,GACtD;EACH,MAAM,cACH,oBAAoB,YAAY,UAAU,QAC3C,sBAAsB,KAAK,IACvB,oBACA,EAAE;AACR,aAAW,WAAW,IACpB,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,sDAC7B;AACH,SAAO;GACL,MAAM,WAAW,UAAU;GAC3B,aAAa,YAAY;GACzB,MAAM,YAAY;GAClB,MAAM,gBAAgB,WAAW;GACjC,SAAS,YAAY;GACrB,WAAW,YAAY;GACvB,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;AAGJ,SAAgB,gBAAgB,QAAQ;AACtC,QAAO,OAAO,QAAQ,OAAO,CAAC,KAAK,CAAC,SAAS,gBAAgB;EAC3D,MAAM,WAAW,QAAQ;EACzB,aAAa,UAAU;EACvB,MAAM,UAAU;EAChB,cAAc,UAAU;EACxB,mBAAmB,UAAU;EAC7B,YAAY,SAAS,UAAU,WAAW;EAC1C,SAAS,UAAU;EACpB,EAAE;;AAGL,SAAS,WAAW,KAAK;AACvB,QAAO,aAAa,IAAI,IAAI,CAAC,MAAM,QAAQ,IAAI;;AAGjD,SAAS,qBAAqB,QAAQ;AACpC,QAAO,SAAS,SAAS,WAAW;EAClC,aAAa,MAAM;EACnB,MAAM,MAAM;EACZ,MAAM,iBAAiB,MAAM,KAAK;EAClC,SAAS,MAAM;EACf,WAAW,MAAM;EACjB,mBAAmB,MAAM;EACzB,YAAY,MAAM;EAClB,SAAS,MAAM;EAChB,EAAE;;;;;AAML,SAAgB,iBAAiB,MAAM;AACrC,QAAO,UACL,OACC,QAAQ,IAAI,OACZ,SAAS;EACR,aAAa,IAAI;EACjB,MAAM,IAAI;EACV,cAAc,IAAI;EAClB,mBAAmB,IAAI;EACvB,YAAY,IAAI;EAChB,SAAS,IAAI;EACd,EACF;;AAEH,SAAgB,mBAAmB,KAAK;AACtC,QAAO,cAAc,IAAI,KAAK,IAAI,IAAI,iBAAiB,KAAA;;;;;;;;;;;;;;;;;;;;;AAsBzD,IAAa,uBAAb,MAAkC;CAChC,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,UAAU,eAAe,KAAK,KAAA,GAAW,OAAO;AACrD,OAAK,cAAc,iBAAiB,KAAK,KAAA,GAAW,OAAO;AAC3D,SAAO,eAAe,QACpB,OAAO,OAAO,gBAAgB,cAC9B,UACE,OACA,GAAG,KAAK,KAAK,sDACC,QAAQ,OAAO,YAAY,CAAC,GAC3C;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,gBAAgB;AACd,MAAI,OAAO,KAAK,gBAAgB,WAC9B,MAAK,cAAc,KAAK,aAAa;AAGvC,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,YAAY,KAAK,eAAe;GAChC,QAAQ,qBAAqB,KAAK,WAAW,CAAC;GAC9C,aAAa,KAAK;GAClB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4B1B,IAAa,mBAAb,MAA8B;CAC5B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,SAAS,YAAY,KAAK,KAAA,GAAW,OAAO;AACjD,SAAO,eAAe,QACpB,OAAO,OAAO,gBAAgB,cAC9B,UACE,OACA,GAAG,KAAK,KAAK,sDACC,QAAQ,OAAO,YAAY,CAAC,GAC3C;;CAGL,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,MAAI,OAAO,KAAK,WAAW,WACzB,MAAK,SAAS,KAAK,QAAQ;AAG7B,SAAO,KAAK;;CAGd,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,OAAO,KAAK,UAAU;GACtB,aAAa,KAAK;GAClB,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,YAAY,QAAQ;CAC3B,MAAM,QAAQ,0BAA0B,OAAO,MAAM;AACrD,OAAM,QAAQ,MAAM,IAClB,UACE,OACA,mFAAmF,OAAO,KAAK,GAChG;AACH,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;AA0BT,IAAa,kBAAb,MAA6B;CAE3B,YAAY,QAAQ;EAClB,IAAI;AAEJ,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,UACH,OAAO,OAAO,WAAW,aACrB,OAAO,SACP,iBAAiB,KAAK,MAAM,OAAO,OAAO;AAChD,OAAK,eAAe;AACpB,OAAK,cAAc;;CAGrB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,iBAAiB,KAAK,MAAM,KAAK,SAAS,CAAC;AAG5D,SAAO,KAAK;;CAGd,SAAS,MAAM;AACb,MAAI,KAAK,gBAAgB,KACvB,MAAK,cAAc,OAAO,KAAK,WAAW,GAAG,UAAU,MAAM,KAAK;AAGpE,SAAO,KAAK,YAAY;;CAG1B,UAAU,aAAa;AACrB,MAAI,KAAK,iBAAiB,KACxB,MAAK,eAAe,IAAI,IACtB,KAAK,WAAW,CAAC,KAAK,cAAc,CAAC,UAAU,OAAO,UAAU,CAAC,CAClE;EAGH,MAAM,YAAY,KAAK,aAAa,IAAI,YAAY;AAEpD,MAAI,cAAc,KAAA,EAChB,OAAM,IAAI,aACR,SAAS,KAAK,KAAK,4BAA4B,QAAQ,YAAY,GACpE;AAGH,SAAO,UAAU;;CAGnB,WAAW,YACX;AACE,MAAI,OAAO,eAAe,UAAU;GAClC,MAAM,WAAW,QAAQ,WAAW;AACpC,SAAM,IAAI,aACR,SAAS,KAAK,KAAK,uCAAuC,SAAS,KACjE,oBAAoB,MAAM,SAAS,CACtC;;EAGH,MAAM,YAAY,KAAK,SAAS,WAAW;AAE3C,MAAI,aAAa,KACf,OAAM,IAAI,aACR,UAAU,WAAW,uBAAuB,KAAK,KAAK,WACpD,oBAAoB,MAAM,WAAW,CACxC;AAGH,SAAO,UAAU;;CAGnB,aAAa,WAAW,YACxB;AAEE,MAAI,UAAU,SAAS,KAAK,MAAM;GAChC,MAAM,WAAW,MAAM,UAAU;AACjC,SAAM,IAAI,aACR,SAAS,KAAK,KAAK,qCAAqC,SAAS,KAC/D,oBAAoB,MAAM,SAAS,EACrC,EACE,OAAO,WACR,CACF;;EAGH,MAAM,YAAY,KAAK,SAAS,UAAU,MAAM;AAEhD,MAAI,aAAa,MAAM;GACrB,MAAM,WAAW,MAAM,UAAU;AACjC,SAAM,IAAI,aACR,UAAU,SAAS,uBAAuB,KAAK,KAAK,WAClD,oBAAoB,MAAM,SAAS,EACrC,EACE,OAAO,WACR,CACF;;AAGH,SAAO,UAAU;;CAGnB,WAAW;EACT,MAAM,SAAS,UACb,KAAK,WAAW,GACf,UAAU,MAAM,OAChB,WAAW;GACV,aAAa,MAAM;GACnB,OAAO,MAAM;GACb,mBAAmB,MAAM;GACzB,YAAY,MAAM;GAClB,SAAS,MAAM;GAChB,EACF;AACD,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB;GACA,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACzB;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,oBAAoB,UAAU,iBAAiB;AAGtD,QAAO,WAAW,kBADM,eAAe,iBADtB,SAAS,WAAW,CAAC,KAAK,UAAU,MAAM,KAAK,CACC,CACb;;AAGtD,SAAS,iBAAiB,UAAU,UAAU;AAC5C,YAAW,SAAS,IAClB,UACE,OACA,GAAG,SAAS,qDACb;AACH,QAAO,OAAO,QAAQ,SAAS,CAAC,KAAK,CAAC,WAAW,iBAAiB;AAChE,aAAW,YAAY,IACrB,UACE,OACA,GAAG,SAAS,GAAG,UAAU,sFACoB,QAAQ,YAAY,CAAC,GACnE;AACH,SAAO;GACL,MAAM,oBAAoB,UAAU;GACpC,aAAa,YAAY;GACzB,OAAO,YAAY,UAAU,KAAA,IAAY,YAAY,QAAQ;GAC7D,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;;;;;;;;;;;;;;;;;;;;;;AAwBJ,IAAa,yBAAb,MAAoC;CAClC,YAAY,QAAQ;EAClB,IAAI,wBAAwB;AAE5B,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,yBAAyB,OAAO,uBAAuB,QACxD,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,OAAK,WACF,kBAAkB,OAAO,aAAa,QAAQ,oBAAoB,KAAK,IACpE,kBACA;AACN,OAAK,UAAU,oBAAoB,KAAK,KAAA,GAAW,OAAO;;CAG5D,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,MAAI,OAAO,KAAK,YAAY,WAC1B,MAAK,UAAU,KAAK,SAAS;AAG/B,SAAO,KAAK;;CAGd,WAAW;EACT,MAAM,SAAS,SAAS,KAAK,WAAW,GAAG,WAAW;GACpD,aAAa,MAAM;GACnB,MAAM,MAAM;GACZ,cAAc,MAAM;GACpB,mBAAmB,MAAM;GACzB,YAAY,MAAM;GAClB,SAAS,MAAM;GAChB,EAAE;AACH,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB;GACA,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACxB,SAAS,KAAK;GACf;;CAGH,WAAW;AACT,SAAO,KAAK;;CAGd,SAAS;AACP,SAAO,KAAK,UAAU;;;AAI1B,SAAS,oBAAoB,QAAQ;CACnC,MAAM,WAAW,mBAAmB,OAAO,OAAO;AAClD,YAAW,SAAS,IAClB,UACE,OACA,GAAG,OAAO,KAAK,gGAChB;AACH,QAAO,SAAS,WAAW,aAAa,cAAc;AACpD,IAAE,aAAa,gBACb,UACE,OACA,GAAG,OAAO,KAAK,GAAG,UAAU,yEAC7B;AACH,SAAO;GACL,MAAM,WAAW,UAAU;GAC3B,aAAa,YAAY;GACzB,MAAM,YAAY;GAClB,cAAc,YAAY;GAC1B,mBAAmB,YAAY;GAC/B,YAAY,SAAS,YAAY,WAAW;GAC5C,SAAS,YAAY;GACtB;GACD;;AAGJ,SAAgB,qBAAqB,OAAO;AAC1C,QAAO,cAAc,MAAM,KAAK,IAAI,MAAM,iBAAiB,KAAA;;;;;;;AChqC7D,SAAgB,YAAY,OAAO,OAAO;AAExC,KAAI,UAAU,MACZ,QAAO;AAGT,KAAI,cAAc,MAAM,IAAI,cAAc,MAAM,CAC9C,QAAO,YAAY,MAAM,QAAQ,MAAM,OAAO;AAGhD,KAAI,WAAW,MAAM,IAAI,WAAW,MAAM,CACxC,QAAO,YAAY,MAAM,QAAQ,MAAM,OAAO;AAGhD,QAAO;;;;;;AAOT,SAAgB,gBAAgB,QAAQ,cAAc,WAAW;AAE/D,KAAI,iBAAiB,UACnB,QAAO;AAGT,KAAI,cAAc,UAAU,EAAE;AAC5B,MAAI,cAAc,aAAa,CAC7B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU,OAAO;AAGvE,SAAO;;AAGT,KAAI,cAAc,aAAa,CAE7B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU;AAGhE,KAAI,WAAW,UAAU,EAAE;AACzB,MAAI,WAAW,aAAa,CAC1B,QAAO,gBAAgB,QAAQ,aAAa,QAAQ,UAAU,OAAO;AAGvE,SAAO;;AAGT,KAAI,WAAW,aAAa,CAE1B,QAAO;AAIT,QACE,eAAe,UAAU,KACxB,gBAAgB,aAAa,IAAI,aAAa,aAAa,KAC5D,OAAO,UAAU,WAAW,aAAa;;;;;;;;;;;AAa7C,SAAgB,eAAe,QAAQ,OAAO,OAAO;AAEnD,KAAI,UAAU,MACZ,QAAO;AAGT,KAAI,eAAe,MAAM,EAAE;AACzB,MAAI,eAAe,MAAM,CAGvB,QAAO,OACJ,iBAAiB,MAAM,CACvB,MAAM,SAAS,OAAO,UAAU,OAAO,KAAK,CAAC;AAGlD,SAAO,OAAO,UAAU,OAAO,MAAM;;AAGvC,KAAI,eAAe,MAAM,CAEvB,QAAO,OAAO,UAAU,OAAO,MAAM;AAGvC,QAAO;;ACtFT,MAAa,aAAa,IAAI,kBAAkB;CAC9C,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,IAAI;EAG5B,IAAI,MAAM;AAEV,MAAI,OAAO,iBAAiB,YAAY,iBAAiB,GACvD,OAAM,OAAO,aAAa;AAG5B,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,UAAU,IAAI,CACnD,OAAM,IAAI,aACR,2CAA2C,QAAQ,aAAa,GACjE;AAGH,MAAI,MAAA,cAAyB,MAAA,YAC3B,OAAM,IAAI,aACR,2DACE,QAAQ,aAAa,CACxB;AAGH,SAAO;;CAGT,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,YAAY,CAAC,OAAO,UAAU,WAAW,CACjE,OAAM,IAAI,aACR,2CAA2C,QAAQ,WAAW,GAC/D;AAGH,MAAI,aAAA,cAAgC,aAAA,YAClC,OAAM,IAAI,aACR,yDAAyD,aAC1D;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,IAC1B,OAAM,IAAI,aACR,2CAA2C,MAAM,UAAU,IAC3D,EACE,OAAO,WACR,CACF;EAGH,MAAM,MAAM,SAAS,UAAU,OAAO,GAAG;AAEzC,MAAI,MAAA,cAAyB,MAAA,YAC3B,OAAM,IAAI,aACR,yDAAyD,UAAU,SACnE,EACE,OAAO,WACR,CACF;AAGH,SAAO;;CAEV,CAAC;AACF,MAAa,eAAe,IAAI,kBAAkB;CAChD,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,IAAI;EAG5B,IAAI,MAAM;AAEV,MAAI,OAAO,iBAAiB,YAAY,iBAAiB,GACvD,OAAM,OAAO,aAAa;AAG5B,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,IAAI,CAClD,OAAM,IAAI,aACR,6CAA6C,QAAQ,aAAa,GACnE;AAGH,SAAO;;CAGT,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,WAAW,CAChE,OAAM,IAAI,aACR,6CAA6C,QAAQ,WAAW,GACjE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,SAAS,UAAU,SAAS,KAAK,IAC3D,OAAM,IAAI,aACR,6CAA6C,MAAM,UAAU,IAC7D,UACD;AAGH,SAAO,WAAW,UAAU,MAAM;;CAErC,CAAC;AACF,MAAa,gBAAgB,IAAI,kBAAkB;CACjD,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAGjD,MAAI,OAAO,iBAAiB,SAC1B,QAAO;AAGT,MAAI,OAAO,iBAAiB,UAC1B,QAAO,eAAe,SAAS;AAGjC,MAAI,OAAO,iBAAiB,YAAY,OAAO,SAAS,aAAa,CACnE,QAAO,aAAa,UAAU;AAGhC,QAAM,IAAI,aACR,kCAAkC,QAAQ,YAAY,GACvD;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,SACxB,OAAM,IAAI,aACR,+CAA+C,QAAQ,WAAW,GACnE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,OAC1B,OAAM,IAAI,aACR,+CAA+C,MAAM,UAAU,IAC/D,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,iBAAiB,IAAI,kBAAkB;CAClD,MAAM;CACN,aAAa;CAEb,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,UAC1B,QAAO;AAGT,MAAI,OAAO,SAAS,aAAa,CAC/B,QAAO,iBAAiB;AAG1B,QAAM,IAAI,aACR,iDAAiD,QAAQ,aAAa,GACvE;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,UACxB,OAAM,IAAI,aACR,iDAAiD,QAAQ,WAAW,GACrE;AAGH,SAAO;;CAGT,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,QAC1B,OAAM,IAAI,aACR,iDAAiD,MAAM,UAAU,IACjE,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,YAAY,IAAI,kBAAkB;CAC7C,MAAM;CACN,aACE;CAEF,UAAU,aAAa;EACrB,MAAM,eAAe,gBAAgB,YAAY;AAEjD,MAAI,OAAO,iBAAiB,SAC1B,QAAO;AAGT,MAAI,OAAO,UAAU,aAAa,CAChC,QAAO,OAAO,aAAa;AAG7B,QAAM,IAAI,aACR,8BAA8B,QAAQ,YAAY,GACnD;;CAGH,WAAW,YAAY;AACrB,MAAI,OAAO,eAAe,SACxB,QAAO;AAGT,MAAI,OAAO,eAAe,YAAY,OAAO,UAAU,WAAW,CAChE,QAAO,WAAW,UAAU;AAG9B,QAAM,IAAI,aAAa,8BAA8B,QAAQ,WAAW,GAAG;;CAG7E,aAAa,WAAW;AACtB,MAAI,UAAU,SAAS,KAAK,UAAU,UAAU,SAAS,KAAK,IAC5D,OAAM,IAAI,aACR,6DACE,MAAM,UAAU,EAClB,EACE,OAAO,WACR,CACF;AAGH,SAAO,UAAU;;CAEpB,CAAC;AACF,MAAa,uBAAuB,OAAO,OAAO;CAChD;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,sBAAsB,MAAM;AAC1C,QAAO,qBAAqB,MAAM,EAAE,WAAW,KAAK,SAAS,KAAK;;AAKpE,SAAS,gBAAgB,aAAa;AACpC,KAAI,aAAa,YAAY,EAAE;AAC7B,MAAI,OAAO,YAAY,YAAY,YAAY;GAC7C,MAAM,gBAAgB,YAAY,SAAS;AAE3C,OAAI,CAAC,aAAa,cAAc,CAC9B,QAAO;;AAIX,MAAI,OAAO,YAAY,WAAW,WAChC,QAAO,YAAY,QAAQ;;AAI/B,QAAO;;;;;;;AClST,SAAgB,YAAY,WAAW;AACrC,QAAO,WAAW,WAAW,iBAAiB;;;;;;;;;;;;;;;AAyBhD,IAAa,mBAAb,MAA8B;CAC5B,YAAY,QAAQ;EAClB,IAAI,sBAAsB;AAE1B,OAAK,OAAO,WAAW,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO;AAC1B,OAAK,YAAY,OAAO;AACxB,OAAK,gBACF,uBAAuB,OAAO,kBAAkB,QACjD,yBAAyB,KAAK,IAC1B,uBACA;AACN,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,QAAM,QAAQ,OAAO,UAAU,IAC7B,UAAU,OAAO,IAAI,OAAO,KAAK,8BAA8B;EACjE,MAAM,QACH,eAAe,OAAO,UAAU,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AACP,eAAa,KAAK,IAAI,CAAC,MAAM,QAAQ,KAAK,IACzC,UACE,OACA,IAAI,OAAO,KAAK,sDACjB;AACH,OAAK,OAAO,gBAAgB,KAAK;;CAGnC,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,WAAW;AACT,SAAO;GACL,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,WAAW,KAAK;GAChB,MAAM,iBAAiB,KAAK,KAAK;GACjC,cAAc,KAAK;GACnB,YAAY,KAAK;GACjB,SAAS,KAAK;GACf;;CAGH,WAAW;AACT,SAAO,MAAM,KAAK;;CAGpB,SAAS;AACP,SAAO,KAAK,UAAU;;;;;;AAO1B,MAAa,0BAA0B,IAAI,iBAAiB;CAC1D,MAAM;CACN,aACE;CACF,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,IAAI;EACF,MAAM,IAAI,eAAe,eAAe;EACxC,aAAa;EACd,EACF;CACF,CAAC;;;;AAKF,MAAa,uBAAuB,IAAI,iBAAiB;CACvD,MAAM;CACN,aACE;CACF,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,IAAI;EACF,MAAM,IAAI,eAAe,eAAe;EACxC,aAAa;EACd,EACF;CACF,CAAC;;;;AAUF,MAAa,6BAA6B,IAAI,iBAAiB;CAC7D,MAAM;CACN,aAAa;CACb,WAAW;EACT,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EAClB,kBAAkB;EACnB;CACD,MAAM,EACJ,QAAQ;EACN,MAAM;EACN,aACE;EACF,cAnBoC;EAoBrC,EACF;CACF,CAAC;;;;AAKF,MAAa,8BAA8B,IAAI,iBAAiB;CAC9D,MAAM;CACN,aAAa;CACb,WAAW,CAAC,kBAAkB,OAAO;CACrC,MAAM,EACJ,KAAK;EACH,MAAM,IAAI,eAAe,cAAc;EACvC,aAAa;EACd,EACF;CACF,CAAC;;;;AAKF,MAAa,wBAAwB,IAAI,iBAAiB;CACxD,MAAM;CACN,aACE;CACF,WAAW,CAAC,kBAAkB,aAAa;CAC3C,MAAM,EAAE;CACT,CAAC;;;;AAKF,MAAa,sBAAsB,OAAO,OAAO;CAC/C;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,qBAAqB,WAAW;AAC9C,QAAO,oBAAoB,MAAM,EAAE,WAAW,SAAS,UAAU,KAAK;;;;;;;;;;;;;;;;;;;;;ACvLxE,SAAgB,iBAAiB,eAAe;AAC9C,QACE,OAAO,kBAAkB,YACzB,QAAQ,kBAAkB,QAAQ,kBAAkB,KAAK,IACrD,KAAK,IACL,cAAc,OAAO,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;ACa5C,SAAgB,aAAa,OAAO,MAAM;AACxC,KAAI,cAAc,KAAK,EAAE;EACvB,MAAM,WAAW,aAAa,OAAO,KAAK,OAAO;AAEjD,OACG,aAAa,QAAQ,aAAa,KAAK,IAAI,KAAK,IAAI,SAAS,UAC9D,KAAK,KAEL,QAAO;AAGT,SAAO;;AAGT,KAAI,UAAU,KACZ,QAAO,EACL,MAAM,KAAK,MACZ;AAGH,KAAI,UAAU,KAAA,EACZ,QAAO;AAIT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,iBAAiB,MAAM,EAAE;GAC3B,MAAM,cAAc,EAAE;AAEtB,QAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,WAAW,aAAa,MAAM,SAAS;AAE7C,QAAI,YAAY,KACd,aAAY,KAAK,SAAS;;AAI9B,UAAO;IACL,MAAM,KAAK;IACX,QAAQ;IACT;;AAGH,SAAO,aAAa,OAAO,SAAS;;AAItC,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,CAAC,aAAa,MAAM,CACtB,QAAO;EAGT,MAAM,aAAa,EAAE;AAErB,OAAK,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,EAAE;GACnD,MAAM,aAAa,aAAa,MAAM,MAAM,OAAO,MAAM,KAAK;AAE9D,OAAI,WACF,YAAW,KAAK;IACd,MAAM,KAAK;IACX,MAAM;KACJ,MAAM,KAAK;KACX,OAAO,MAAM;KACd;IACD,OAAO;IACR,CAAC;;AAIN,SAAO;GACL,MAAM,KAAK;GACX,QAAQ;GACT;;AAGH,KAAI,WAAW,KAAK,EAAE;EAGpB,MAAM,aAAa,KAAK,UAAU,MAAM;AAExC,MAAI,cAAc,KAChB,QAAO;AAGT,MAAI,OAAO,eAAe,UACxB,QAAO;GACL,MAAM,KAAK;GACX,OAAO;GACR;AAGH,MAAI,OAAO,eAAe,YAAY,OAAO,SAAS,WAAW,EAAE;GACjE,MAAM,YAAY,OAAO,WAAW;AACpC,UAAO,oBAAoB,KAAK,UAAU,GACtC;IACE,MAAM,KAAK;IACX,OAAO;IACR,GACD;IACE,MAAM,KAAK;IACX,OAAO;IACR;;AAGP,MAAI,OAAO,eAAe,UAAU;AAElC,OAAI,WAAW,KAAK,CAClB,QAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;AAGH,OAAI,SAAS,aAAa,oBAAoB,KAAK,WAAW,CAC5D,QAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;AAGH,UAAO;IACL,MAAM,KAAK;IACX,OAAO;IACR;;AAGH,QAAM,IAAI,UAAU,gCAAgC,QAAQ,WAAW,CAAC,GAAG;;;AAKpE,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;;;;;;AAQtE,MAAM,sBAAsB;;;AC3J5B,MAAa,WAAW,IAAI,kBAAkB;CAC5C,MAAM;CACN,aACE;CACF,eAAe;EACb,aAAa;GACX,MAAM;GACN,UAAU,WAAW,OAAO;GAC7B;EACD,OAAO;GACL,aAAa;GACb,MAAM,IAAI,eAAe,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC,CAAC;GAErE,QAAQ,QAAQ;AACd,WAAO,OAAO,OAAO,OAAO,YAAY,CAAC;;GAE5C;EACD,WAAW;GACT,aAAa;GACb,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,WAAW,OAAO,cAAc;GAC3C;EACD,cAAc;GACZ,aACE;GACF,MAAM;GACN,UAAU,WAAW,OAAO,iBAAiB;GAC9C;EACD,kBAAkB;GAChB,aACE;GACF,MAAM;GACN,UAAU,WAAW,OAAO,qBAAqB;GAClD;EACD,YAAY;GACV,aAAa;GACb,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,YAAY,CAAC,CACjD;GACD,UAAU,WAAW,OAAO,eAAe;GAC5C;EACF;CACF,CAAC;AACF,MAAa,cAAc,IAAI,kBAAkB;CAC/C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,cAAc,UAAU;GACnC;EACD,aAAa;GACX,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,cAAc,UAAU;GACnC;EACD,WAAW;GACT,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,oBAAoB,CAAC,CACzD;GACD,UAAU,cAAc,UAAU;GACnC;EACD,MAAM;GACJ,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC,CAClD;GACD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,OAAO,EAAE,qBAAqB;AACpC,WAAO,oBACH,MAAM,OACN,MAAM,KAAK,QAAQ,QAAQ,IAAI,qBAAqB,KAAK;;GAEhE;EACF;CACF,CAAC;AACF,MAAa,sBAAsB,IAAI,gBAAgB;CACrD,MAAM;CACN,aACE;CACF,QAAQ;EACN,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,UAAU;GACR,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,cAAc;GACZ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,iBAAiB;GACf,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,iBAAiB;GACf,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,kBAAkB;GAChB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,qBAAqB;GACnB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,WAAW;GACT,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,OAAO;GACL,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,MAAM;GACJ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,YAAY;GACV,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,cAAc;GACZ,OAAO,kBAAkB;GACzB,aAAa;GACd;EACD,wBAAwB;GACtB,OAAO,kBAAkB;GACzB,aAAa;GACd;EACF;CACF,CAAC;AACF,MAAa,SAAS,IAAI,kBAAkB;CAC1C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,WAAW;GAEpC,QAAQ,MAAM;AACZ,QAAI,aAAa,KAAK,CACpB,QAAO,SAAS;AAGlB,QAAI,aAAa,KAAK,CACpB,QAAO,SAAS;AAGlB,QAAI,gBAAgB,KAAK,CACvB,QAAO,SAAS;AAGlB,QAAI,YAAY,KAAK,CACnB,QAAO,SAAS;AAGlB,QAAI,WAAW,KAAK,CAClB,QAAO,SAAS;AAGlB,QAAI,kBAAkB,KAAK,CACzB,QAAO,SAAS;AAGlB,QAAI,WAAW,KAAK,CAClB,QAAO,SAAS;AAGlB,QAAI,cAAc,KAAK,CACrB,QAAO,SAAS;;AAKT,cAAU,OAAO,qBAAqB,QAAQ,KAAK,CAAC,IAAI;;GAEpE;EACD,MAAM;GACJ,MAAM;GACN,UAAU,SAAU,UAAU,OAAO,KAAK,OAAO,KAAA;GAClD;EACD,aAAa;GACX,MAAM;GACN,UACE,SAGA,iBAAiB,OAAO,KAAK,cAAc,KAAA;GAC9C;EACD,gBAAgB;GACd,MAAM;GACN,UAAU,QACR,oBAAoB,MAAM,IAAI,iBAAiB,KAAA;GAClD;EACD,QAAQ;GACN,MAAM,IAAI,YAAY,IAAI,eAAe,QAAQ,CAAC;GAClD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,EAAE;KAC/C,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAC9C,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,YAAY;GACV,MAAM,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC;GAEjD,QAAQ,MAAM;AACZ,QAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,CAC7C,QAAO,KAAK,eAAe;;GAGhC;EACD,eAAe;GACb,MAAM,IAAI,YAAY,IAAI,eAAe,OAAO,CAAC;GAEjD,QAAQ,MAAM,OAAO,UAAU,EAAE,UAAU;AACzC,QAAI,eAAe,KAAK,CACtB,QAAO,OAAO,iBAAiB,KAAK;;GAGzC;EACD,YAAY;GACV,MAAM,IAAI,YAAY,IAAI,eAAe,YAAY,CAAC;GACtD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,WAAW,KAAK,EAAE;KACpB,MAAM,SAAS,KAAK,WAAW;AAC/B,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,aAAa;GACX,MAAM,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC;GACvD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,MAAM,EAAE,qBAAqB;AACnC,QAAI,kBAAkB,KAAK,EAAE;KAC3B,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAC9C,YAAO,oBACH,SACA,OAAO,QAAQ,UAAU,MAAM,qBAAqB,KAAK;;;GAGlE;EACD,QAAQ;GACN,MAAM;GACN,UAAU,SAAU,YAAY,OAAO,KAAK,SAAS,KAAA;GACtD;EACD,SAAS;GACP,MAAM;GACN,UAAU,SAAS;AACjB,QAAI,kBAAkB,KAAK,CACzB,QAAO,KAAK;;GAGjB;EACF;CACF,CAAC;AACF,MAAa,UAAU,IAAI,kBAAkB;CAC3C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,UAAU,MAAM;GAC3B;EACD,aAAa;GACX,MAAM;GACN,UAAU,UAAU,MAAM;GAC3B;EACD,MAAM;GACJ,MAAM,IAAI,eACR,IAAI,YAAY,IAAI,eAAe,aAAa,CAAC,CAClD;GACD,MAAM,EACJ,mBAAmB;IACjB,MAAM;IACN,cAAc;IACf,EACF;GAED,QAAQ,OAAO,EAAE,qBAAqB;AACpC,WAAO,oBACH,MAAM,OACN,MAAM,KAAK,QAAQ,QAAQ,IAAI,qBAAqB,KAAK;;GAEhE;EACD,MAAM;GACJ,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,UAAU,MAAM;GAC3B;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,UAAU,MAAM,qBAAqB;GAChD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,UAAU,MAAM;GAC3B;EACF;CACF,CAAC;AACF,MAAa,eAAe,IAAI,kBAAkB;CAChD,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,eAAe,WAAW;GACrC;EACD,aAAa;GACX,MAAM;GACN,UAAU,eAAe,WAAW;GACrC;EACD,MAAM;GACJ,MAAM,IAAI,eAAe,OAAO;GAChC,UAAU,eAAe,WAAW;GACrC;EACD,cAAc;GACZ,MAAM;GACN,aACE;GAEF,QAAQ,YAAY;IAClB,MAAM,EAAE,MAAM,iBAAiB;IAC/B,MAAM,WAAW,aAAa,cAAc,KAAK;AACjD,WAAO,WAAW,MAAM,SAAS,GAAG;;GAEvC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,UAAU,MAAM,qBAAqB;GAChD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,QAAQ,IAAI;GACvB;EACF;CACF,CAAC;AACF,MAAa,cAAc,IAAI,kBAAkB;CAC/C,MAAM;CACN,aACE;CACF,eAAe;EACb,MAAM;GACJ,MAAM,IAAI,eAAe,cAAc;GACvC,UAAU,cAAc,UAAU;GACnC;EACD,aAAa;GACX,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACD,cAAc;GACZ,MAAM,IAAI,eAAe,eAAe;GACxC,UAAU,cAAc,UAAU,qBAAqB;GACxD;EACD,mBAAmB;GACjB,MAAM;GACN,UAAU,cAAc,UAAU;GACnC;EACF;CACF,CAAC;AACF,IAAI;CAEH,SAAU,UAAU;AACnB,UAAS,YAAY;AACrB,UAAS,YAAY;AACrB,UAAS,eAAe;AACxB,UAAS,WAAW;AACpB,UAAS,UAAU;AACnB,UAAS,kBAAkB;AAC3B,UAAS,UAAU;AACnB,UAAS,cAAc;GACtB,aAAa,WAAW,EAAE,EAAE;AAG/B,MAAa,aAAa,IAAI,gBAAgB;CAC5C,MAAM;CACN,aAAa;CACb,QAAQ;EACN,QAAQ;GACN,OAAO,SAAS;GAChB,aAAa;GACd;EACD,QAAQ;GACN,OAAO,SAAS;GAChB,aACE;GACH;EACD,WAAW;GACT,OAAO,SAAS;GAChB,aACE;GACH;EACD,OAAO;GACL,OAAO,SAAS;GAChB,aACE;GACH;EACD,MAAM;GACJ,OAAO,SAAS;GAChB,aACE;GACH;EACD,cAAc;GACZ,OAAO,SAAS;GAChB,aACE;GACH;EACD,MAAM;GACJ,OAAO,SAAS;GAChB,aAAa;GACd;EACD,UAAU;GACR,OAAO,SAAS;GAChB,aACE;GACH;EACF;CACF,CAAC;;;;;AAMF,MAAa,qBAAqB;CAChC,MAAM;CACN,MAAM,IAAI,eAAe,SAAS;CAClC,aAAa;CACb,MAAM,EAAE;CACR,UAAU,SAAS,OAAO,UAAU,EAAE,aAAa;CACnD,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,mBAAmB;CAC9B,MAAM;CACN,MAAM;CACN,aAAa;CACb,MAAM,CACJ;EACE,MAAM;EACN,aAAa,KAAA;EACb,MAAM,IAAI,eAAe,cAAc;EACvC,cAAc,KAAA;EACd,mBAAmB,KAAA;EACnB,YAAY,OAAO,OAAO,KAAK;EAC/B,SAAS,KAAA;EACV,CACF;CACD,UAAU,SAAS,EAAE,QAAQ,UAAU,EAAE,aAAa,OAAO,QAAQ,KAAK;CAC1E,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,uBAAuB;CAClC,MAAM;CACN,MAAM,IAAI,eAAe,cAAc;CACvC,aAAa;CACb,MAAM,EAAE;CACR,UAAU,SAAS,OAAO,UAAU,EAAE,iBAAiB,WAAW;CAClE,mBAAmB,KAAA;CACnB,YAAY,OAAO,OAAO,KAAK;CAC/B,SAAS,KAAA;CACV;AACD,MAAa,qBAAqB,OAAO,OAAO;CAC9C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;AACF,SAAgB,oBAAoB,MAAM;AACxC,QAAO,mBAAmB,MAAM,EAAE,WAAW,KAAK,SAAS,KAAK;;;;;;;AC1hBlE,SAAgB,SAAS,QAAQ;AAC/B,QAAO,WAAW,QAAQ,cAAc;;AAE1C,SAAgB,aAAa,QAAQ;AACnC,KAAI,CAAC,SAAS,OAAO,CACnB,OAAM,IAAI,MAAM,YAAY,QAAQ,OAAO,CAAC,0BAA0B;AAGxE,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgFT,IAAa,gBAAb,MAA2B;CAEzB,YAAY,QAAQ;EAClB,IAAI,uBAAuB;AAI3B,OAAK,qBAAqB,OAAO,gBAAgB,OAAO,EAAE,GAAG,KAAA;AAE7D,eAAa,OAAO,IAClB,UAAU,OAAO,qCAAqC;AACxD,GAAC,OAAO,SACN,MAAM,QAAQ,OAAO,MAAM,IAC3B,UACE,OACA,8CAA8C,QAAQ,OAAO,MAAM,CAAC,GACrE;AACH,GAAC,OAAO,cACN,MAAM,QAAQ,OAAO,WAAW,IAChC,UACE,OACA,mDACK,QAAQ,OAAO,WAAW,CAAC,GACjC;AACH,OAAK,cAAc,OAAO;AAC1B,OAAK,aAAa,SAAS,OAAO,WAAW;AAC7C,OAAK,UAAU,OAAO;AACtB,OAAK,qBACF,wBAAwB,OAAO,uBAAuB,QACvD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,OAAK,aAAa,OAAO;AACzB,OAAK,gBAAgB,OAAO;AAC5B,OAAK,oBAAoB,OAAO;AAEhC,OAAK,eACF,qBAAqB,OAAO,gBAAgB,QAC7C,uBAAuB,KAAK,IACxB,qBACA;EAGN,MAAM,qBAAqB,IAAI,IAAI,OAAO,MAAM;AAEhD,MAAI,OAAO,SAAS,KAClB,MAAK,MAAM,QAAQ,OAAO,OAAO;AAG/B,sBAAmB,OAAO,KAAK;AAC/B,0BAAuB,MAAM,mBAAmB;;AAIpD,MAAI,KAAK,cAAc,KACrB,wBAAuB,KAAK,YAAY,mBAAmB;AAG7D,MAAI,KAAK,iBAAiB,KACxB,wBAAuB,KAAK,eAAe,mBAAmB;AAGhE,MAAI,KAAK,qBAAqB,KAC5B,wBAAuB,KAAK,mBAAmB,mBAAmB;AAGpE,OAAK,MAAM,aAAa,KAAK,YAE3B,KAAI,YAAY,UAAU,CACxB,MAAK,MAAM,OAAO,UAAU,KAC1B,wBAAuB,IAAI,MAAM,mBAAmB;AAK1D,yBAAuB,UAAU,mBAAmB;AAEpD,OAAK,WAAW,OAAO,OAAO,KAAK;AACnC,OAAK,cAAc,OAAO,OAAO,KAAK;AAEtC,OAAK,sBAAsB,OAAO,OAAO,KAAK;AAE9C,OAAK,MAAM,aAAa,oBAAoB;AAC1C,OAAI,aAAa,KACf;GAGF,MAAM,WAAW,UAAU;AAC3B,eACE,UACE,OACA,uEACD;AAEH,OAAI,KAAK,SAAS,cAAc,KAAA,EAC9B,OAAM,IAAI,MACR,+EAA+E,SAAS,IACzF;AAGH,QAAK,SAAS,YAAY;AAE1B,OAAI,gBAAgB,UAAU;SAEvB,MAAM,SAAS,UAAU,eAAe,CAC3C,KAAI,gBAAgB,MAAM,EAAE;KAC1B,IAAI,kBAAkB,KAAK,oBAAoB,MAAM;AAErD,SAAI,oBAAoB,KAAA,EACtB,mBAAkB,KAAK,oBAAoB,MAAM,QAAQ;MACvD,SAAS,EAAE;MACX,YAAY,EAAE;MACf;AAGH,qBAAgB,WAAW,KAAK,UAAU;;cAGrC,aAAa,UAAU;SAE3B,MAAM,SAAS,UAAU,eAAe,CAC3C,KAAI,gBAAgB,MAAM,EAAE;KAC1B,IAAI,kBAAkB,KAAK,oBAAoB,MAAM;AAErD,SAAI,oBAAoB,KAAA,EACtB,mBAAkB,KAAK,oBAAoB,MAAM,QAAQ;MACvD,SAAS,EAAE;MACX,YAAY,EAAE;MACf;AAGH,qBAAgB,QAAQ,KAAK,UAAU;;;;;CAOjD,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,eAAe;AACb,SAAO,KAAK;;CAGd,kBAAkB;AAChB,SAAO,KAAK;;CAGd,sBAAsB;AACpB,SAAO,KAAK;;CAGd,YAAY,WAAW;AACrB,UAAQ,WAAR;GACE,KAAK,kBAAkB,MACrB,QAAO,KAAK,cAAc;GAE5B,KAAK,kBAAkB,SACrB,QAAO,KAAK,iBAAiB;GAE/B,KAAK,kBAAkB,aACrB,QAAO,KAAK,qBAAqB;;;CAIvC,aAAa;AACX,SAAO,KAAK;;CAGd,QAAQ,MAAM;AACZ,SAAO,KAAK,YAAY,CAAC;;CAG3B,iBAAiB,cAAc;AAC7B,SAAO,YAAY,aAAa,GAC5B,aAAa,UAAU,GACvB,KAAK,mBAAmB,aAAa,CAAC;;CAG5C,mBAAmB,eAAe;EAChC,MAAM,kBAAkB,KAAK,oBAAoB,cAAc;AAC/D,SAAO,oBAAoB,QAAQ,oBAAoB,KAAK,IACxD,kBACA;GACE,SAAS,EAAE;GACX,YAAY,EAAE;GACf;;CAGP,UAAU,cAAc,cAAc;EACpC,IAAI,MAAM,KAAK,YAAY,aAAa;AAExC,MAAI,QAAQ,KAAA,GAAW;AACrB,SAAM,OAAO,OAAO,KAAK;AAEzB,OAAI,YAAY,aAAa,CAC3B,MAAK,MAAM,QAAQ,aAAa,UAAU,CACxC,KAAI,KAAK,QAAQ;QAEd;IACL,MAAM,kBAAkB,KAAK,mBAAmB,aAAa;AAE7D,SAAK,MAAM,QAAQ,gBAAgB,QACjC,KAAI,KAAK,QAAQ;AAGnB,SAAK,MAAM,QAAQ,gBAAgB,WACjC,KAAI,KAAK,QAAQ;;AAIrB,QAAK,YAAY,aAAa,QAAQ;;AAGxC,SAAO,IAAI,aAAa,UAAU,KAAA;;CAGpC,gBAAgB;AACd,SAAO,KAAK;;CAGd,aAAa,MAAM;AACjB,SAAO,KAAK,eAAe,CAAC,MAAM,cAAc,UAAU,SAAS,KAAK;;CAG1E,WAAW;AACT,SAAO;GACL,aAAa,KAAK;GAClB,OAAO,KAAK,cAAc;GAC1B,UAAU,KAAK,iBAAiB;GAChC,cAAc,KAAK,qBAAqB;GACxC,OAAO,OAAO,OAAO,KAAK,YAAY,CAAC;GACvC,YAAY,KAAK,eAAe;GAChC,YAAY,KAAK;GACjB,SAAS,KAAK;GACd,mBAAmB,KAAK;GACxB,aAAa,KAAK,uBAAuB,KAAA;GAC1C;;;AAIL,SAAS,uBAAuB,MAAM,SAAS;CAC7C,MAAM,YAAY,aAAa,KAAK;AAEpC,KAAI,CAAC,QAAQ,IAAI,UAAU,EAAE;AAC3B,UAAQ,IAAI,UAAU;AAEtB,MAAI,YAAY,UAAU,CACxB,MAAK,MAAM,cAAc,UAAU,UAAU,CAC3C,wBAAuB,YAAY,QAAQ;WAEpC,aAAa,UAAU,IAAI,gBAAgB,UAAU,EAAE;AAChE,QAAK,MAAM,iBAAiB,UAAU,eAAe,CACnD,wBAAuB,eAAe,QAAQ;AAGhD,QAAK,MAAM,SAAS,OAAO,OAAO,UAAU,WAAW,CAAC,EAAE;AACxD,2BAAuB,MAAM,MAAM,QAAQ;AAE3C,SAAK,MAAM,OAAO,MAAM,KACtB,wBAAuB,IAAI,MAAM,QAAQ;;aAGpC,kBAAkB,UAAU,CACrC,MAAK,MAAM,SAAS,OAAO,OAAO,UAAU,WAAW,CAAC,CACtD,wBAAuB,MAAM,MAAM,QAAQ;;AAKjD,QAAO;;;;;;;;;;;AC/VT,SAAgB,eAAe,QAAQ;AAErC,cAAa,OAAO;AAEpB,KAAI,OAAO,mBACT,QAAO,OAAO;CAGhB,MAAM,UAAU,IAAI,wBAAwB,OAAO;AACnD,mBAAkB,QAAQ;AAC1B,oBAAmB,QAAQ;AAC3B,eAAc,QAAQ;CAGtB,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO,qBAAqB;AAC5B,QAAO;;;;;;AAOT,SAAgB,kBAAkB,QAAQ;CACxC,MAAM,SAAS,eAAe,OAAO;AAErC,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,MAAM,OAAO,KAAK,UAAU,MAAM,QAAQ,CAAC,KAAK,OAAO,CAAC;;AAItE,IAAM,0BAAN,MAA8B;CAC5B,YAAY,QAAQ;AAClB,OAAK,UAAU,EAAE;AACjB,OAAK,SAAS;;CAGhB,YAAY,SAAS,OAAO;EAC1B,MAAM,SAAS,MAAM,QAAQ,MAAM,GAAG,MAAM,OAAO,QAAQ,GAAG;AAE9D,OAAK,QAAQ,KACX,IAAI,aAAa,SAAS,EACxB,OAAO,QACR,CAAC,CACH;;CAGH,YAAY;AACV,SAAO,KAAK;;;AAIhB,SAAS,kBAAkB,SAAS;CAClC,MAAM,SAAS,QAAQ;CACvB,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,CAAC,UACH,SAAQ,YAAY,qCAAqC,OAAO,QAAQ;UAC/D,CAAC,aAAa,UAAU,EAAE;EACnC,IAAI;AAEJ,UAAQ,YACN,qDAAqD,QACnD,UACD,CAAC,KACD,wBAAwB,qBACvB,QACA,kBAAkB,MACnB,MAAM,QAAQ,0BAA0B,KAAK,IAC1C,wBACA,UAAU,QACf;;CAGH,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,gBAAgB,CAAC,aAAa,aAAa,EAAE;EAC/C,IAAI;AAEJ,UAAQ,YACN,oEACK,QAAQ,aAAa,CAAC,KAC1B,yBAAyB,qBACxB,QACA,kBAAkB,SACnB,MAAM,QAAQ,2BAA2B,KAAK,IAC3C,yBACA,aAAa,QAClB;;CAGH,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,oBAAoB,CAAC,aAAa,iBAAiB,EAAE;EACvD,IAAI;AAEJ,UAAQ,YACN,wEACK,QAAQ,iBAAiB,CAAC,KAC9B,yBAAyB,qBACxB,QACA,kBAAkB,aACnB,MAAM,QAAQ,2BAA2B,KAAK,IAC3C,yBACA,iBAAiB,QACtB;;;AAIL,SAAS,qBAAqB,QAAQ,WAAW;CAC/C,IAAI;AAEJ,SAAQ,gBAAgB,CAAC,OAAO,SAAS,GAAG,OAAO,kBAAkB,CAClE,SAEE,eAAe;EACd,IAAI;AAEJ,UAEG,wBACC,eAAe,QAAQ,eAAe,KAAK,IACvC,KAAK,IACL,WAAW,oBAAoB,QACnC,0BAA0B,KAAK,IAC7B,wBACA,EAAE;GAGX,CACA,MAAM,kBAAkB,cAAc,cAAc,UAAU,MAAM,QACrE,kBAAkB,KAAK,IACrB,KAAK,IACL,cAAc;;AAGpB,SAAS,mBAAmB,SAAS;AACnC,MAAK,MAAM,aAAa,QAAQ,OAAO,eAAe,EAAE;AAEtD,MAAI,CAAC,YAAY,UAAU,EAAE;AAC3B,WAAQ,YACN,+BAA+B,QAAQ,UAAU,CAAC,IAClD,cAAc,QAAQ,cAAc,KAAK,IAAI,KAAK,IAAI,UAAU,QACjE;AACD;;AAGF,eAAa,SAAS,UAAU;AAEhC,MAAI,UAAU,UAAU,WAAW,EACjC,SAAQ,YACN,cAAc,UAAU,KAAK,qCAC7B,UAAU,QACX;AAGH,OAAK,MAAM,OAAO,UAAU,MAAM;AAEhC,gBAAa,SAAS,IAAI;AAE1B,OAAI,CAAC,YAAY,IAAI,KAAK,CACxB,SAAQ,YACN,gBAAgB,UAAU,KAAK,GAAG,IAAI,KAAK,iCAC7B,QAAQ,IAAI,KAAK,CAAC,IAChC,IAAI,QACL;AAGH,OAAI,mBAAmB,IAAI,IAAI,IAAI,qBAAqB,MAAM;IAC5D,IAAI;AAEJ,YAAQ,YACN,sBAAsB,UAAU,KAAK,GAAG,IAAI,KAAK,2BACjD,CACE,2BAA2B,IAAI,QAAQ,GACtC,eAAe,IAAI,aAAa,QAAQ,iBAAiB,KAAK,IAC3D,KAAK,IACL,aAAa,KAClB,CACF;;;;;AAMT,SAAS,aAAa,SAAS,MAAM;AAEnC,KAAI,KAAK,KAAK,WAAW,KAAK,CAC5B,SAAQ,YACN,SAAS,KAAK,KAAK,0EACnB,KAAK,QACN;;AAIL,SAAS,cAAc,SAAS;CAC9B,MAAM,kCACJ,uCAAuC,QAAQ;CACjD,MAAM,UAAU,QAAQ,OAAO,YAAY;AAE3C,MAAK,MAAM,QAAQ,OAAO,OAAO,QAAQ,EAAE;AAEzC,MAAI,CAAC,YAAY,KAAK,EAAE;AACtB,WAAQ,YACN,wCAAwC,QAAQ,KAAK,CAAC,IACtD,KAAK,QACN;AACD;;AAGF,MAAI,CAAC,oBAAoB,KAAK,CAC5B,cAAa,SAAS,KAAK;AAG7B,MAAI,aAAa,KAAK,EAAE;AAEtB,kBAAe,SAAS,KAAK;AAE7B,sBAAmB,SAAS,KAAK;aACxB,gBAAgB,KAAK,EAAE;AAEhC,kBAAe,SAAS,KAAK;AAE7B,sBAAmB,SAAS,KAAK;aACxB,YAAY,KAAK,CAE1B,sBAAqB,SAAS,KAAK;WAC1B,WAAW,KAAK,CAEzB,oBAAmB,SAAS,KAAK;WACxB,kBAAkB,KAAK,EAAE;AAElC,uBAAoB,SAAS,KAAK;AAElC,mCAAgC,KAAK;;;;AAK3C,SAAS,eAAe,SAAS,MAAM;CACrC,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC;AAE9C,KAAI,OAAO,WAAW,EACpB,SAAQ,YAAY,QAAQ,KAAK,KAAK,mCAAmC,CACvE,KAAK,SACL,GAAG,KAAK,kBACT,CAAC;AAGJ,MAAK,MAAM,SAAS,QAAQ;AAE1B,eAAa,SAAS,MAAM;AAE5B,MAAI,CAAC,aAAa,MAAM,KAAK,EAAE;GAC7B,IAAI;AAEJ,WAAQ,YACN,eAAe,KAAK,KAAK,GAAG,MAAM,KAAK,gCACzB,QAAQ,MAAM,KAAK,CAAC,KACjC,iBAAiB,MAAM,aAAa,QAAQ,mBAAmB,KAAK,IACjE,KAAK,IACL,eAAe,KACpB;;AAGH,OAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,MAAM,UAAU,IAAI;AAEpB,gBAAa,SAAS,IAAI;AAE1B,OAAI,CAAC,YAAY,IAAI,KAAK,EAAE;IAC1B,IAAI;AAEJ,YAAQ,YACN,eAAe,KAAK,KAAK,GAAG,MAAM,KAAK,GAAG,QAAQ,iCAC/B,QAAQ,IAAI,KAAK,CAAC,KACpC,gBAAgB,IAAI,aAAa,QAAQ,kBAAkB,KAAK,IAC7D,KAAK,IACL,cAAc,KACnB;;AAGH,OAAI,mBAAmB,IAAI,IAAI,IAAI,qBAAqB,MAAM;IAC5D,IAAI;AAEJ,YAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,GAAG,QAAQ,2BACxD,CACE,2BAA2B,IAAI,QAAQ,GACtC,gBAAgB,IAAI,aAAa,QAAQ,kBAAkB,KAAK,IAC7D,KAAK,IACL,cAAc,KACnB,CACF;;;;;AAMT,SAAS,mBAAmB,SAAS,MAAM;CACzC,MAAM,iBAAiB,OAAO,OAAO,KAAK;AAE1C,MAAK,MAAM,SAAS,KAAK,eAAe,EAAE;AACxC,MAAI,CAAC,gBAAgB,MAAM,EAAE;AAC3B,WAAQ,YACN,QAAQ,QAAQ,KAAK,CAAC,4DACG,QAAQ,MAAM,CAAC,IACxC,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,MAAI,SAAS,OAAO;AAClB,WAAQ,YACN,QAAQ,KAAK,KAAK,yEAClB,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,MAAI,eAAe,MAAM,OAAO;AAC9B,WAAQ,YACN,QAAQ,KAAK,KAAK,sBAAsB,MAAM,KAAK,SACnD,+BAA+B,MAAM,MAAM,CAC5C;AACD;;AAGF,iBAAe,MAAM,QAAQ;AAC7B,kCAAgC,SAAS,MAAM,MAAM;AACrD,kCAAgC,SAAS,MAAM,MAAM;;;AAIzD,SAAS,gCAAgC,SAAS,MAAM,OAAO;CAC7D,MAAM,eAAe,KAAK,WAAW;AAErC,MAAK,MAAM,cAAc,OAAO,OAAO,MAAM,WAAW,CAAC,EAAE;EACzD,MAAM,YAAY,WAAW;EAC7B,MAAM,YAAY,aAAa;AAE/B,MAAI,CAAC,WAAW;AACd,WAAQ,YACN,mBAAmB,MAAM,KAAK,GAAG,UAAU,gBAAgB,KAAK,KAAK,wBACrE;IAAC,WAAW;IAAS,KAAK;IAAS,GAAG,KAAK;IAAkB,CAC9D;AACD;;AAIF,MAAI,CAAC,gBAAgB,QAAQ,QAAQ,UAAU,MAAM,WAAW,KAAK,EAAE;GACrE,IAAI,qBAAqB;AAEzB,WAAQ,YACN,mBAAmB,MAAM,KAAK,GAAG,UAAU,gBACtC,QAAQ,WAAW,KAAK,CAAC,OAAO,KAAK,KAAK,GAAG,UAAU,WAC/C,QAAQ,UAAU,KAAK,CAAC,IACrC,EACG,sBAAsB,WAAW,aAAa,QAC/C,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB,OACvB,qBAAqB,UAAU,aAAa,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB,KACxB,CACF;;AAGH,OAAK,MAAM,YAAY,WAAW,MAAM;GACtC,MAAM,UAAU,SAAS;GACzB,MAAM,UAAU,UAAU,KAAK,MAAM,QAAQ,IAAI,SAAS,QAAQ;AAElE,OAAI,CAAC,SAAS;AACZ,YAAQ,YACN,4BAA4B,MAAM,KAAK,GAAG,UAAU,GAAG,QAAQ,kBAAkB,KAAK,KAAK,GAAG,UAAU,wBACxG,CAAC,SAAS,SAAS,UAAU,QAAQ,CACtC;AACD;;AAKF,OAAI,CAAC,YAAY,SAAS,MAAM,QAAQ,KAAK,EAAE;IAC7C,IAAI,mBAAmB;AAEvB,YAAQ,YACN,4BAA4B,MAAM,KAAK,GAAG,UAAU,GAAG,QAAQ,kBAC7C,QAAQ,SAAS,KAAK,CAAC,OACpC,KAAK,KAAK,GAAG,UAAU,GAAG,QAAQ,aAClC,QAAQ,QAAQ,KAAK,CAAC,IAC3B,EACG,oBAAoB,SAAS,aAAa,QAC3C,sBAAsB,KAAK,IACvB,KAAK,IACL,kBAAkB,OACrB,mBAAmB,QAAQ,aAAa,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB,KACtB,CACF;;;AAIL,OAAK,MAAM,WAAW,UAAU,MAAM;GACpC,MAAM,UAAU,QAAQ;AAGxB,OAAI,CAFa,WAAW,KAAK,MAAM,QAAQ,IAAI,SAAS,QAAQ,IAEnD,mBAAmB,QAAQ,CAC1C,SAAQ,YACN,gBAAgB,KAAK,KAAK,GAAG,UAAU,8BAA8B,QAAQ,4CAA4C,MAAM,KAAK,GAAG,UAAU,IACjJ,CAAC,QAAQ,SAAS,WAAW,QAAQ,CACtC;;;;AAMT,SAAS,gCAAgC,SAAS,MAAM,OAAO;CAC7D,MAAM,kBAAkB,KAAK,eAAe;AAE5C,MAAK,MAAM,cAAc,MAAM,eAAe,CAC5C,KAAI,CAAC,gBAAgB,SAAS,WAAW,CACvC,SAAQ,YACN,eAAe,OACX,QAAQ,KAAK,KAAK,oBAAoB,MAAM,KAAK,kDACjD,QAAQ,KAAK,KAAK,kBAAkB,WAAW,KAAK,gCAAgC,MAAM,KAAK,IACnG,CACE,GAAG,+BAA+B,OAAO,WAAW,EACpD,GAAG,+BAA+B,MAAM,MAAM,CAC/C,CACF;;AAKP,SAAS,qBAAqB,SAAS,OAAO;CAC5C,MAAM,cAAc,MAAM,UAAU;AAEpC,KAAI,YAAY,WAAW,EACzB,SAAQ,YACN,cAAc,MAAM,KAAK,yCACzB,CAAC,MAAM,SAAS,GAAG,MAAM,kBAAkB,CAC5C;CAGH,MAAM,oBAAoB,OAAO,OAAO,KAAK;AAE7C,MAAK,MAAM,cAAc,aAAa;AACpC,MAAI,kBAAkB,WAAW,OAAO;AACtC,WAAQ,YACN,cAAc,MAAM,KAAK,yBAAyB,WAAW,KAAK,SAClE,wBAAwB,OAAO,WAAW,KAAK,CAChD;AACD;;AAGF,oBAAkB,WAAW,QAAQ;AAErC,MAAI,CAAC,aAAa,WAAW,CAC3B,SAAQ,YACN,cAAc,MAAM,KAAK,oDACF,QAAQ,WAAW,CAAC,IAC3C,wBAAwB,OAAO,OAAO,WAAW,CAAC,CACnD;;;AAKP,SAAS,mBAAmB,SAAS,UAAU;CAC7C,MAAM,aAAa,SAAS,WAAW;AAEvC,KAAI,WAAW,WAAW,EACxB,SAAQ,YACN,aAAa,SAAS,KAAK,mCAC3B,CAAC,SAAS,SAAS,GAAG,SAAS,kBAAkB,CAClD;AAGH,MAAK,MAAM,aAAa,WAEtB,cAAa,SAAS,UAAU;;AAIpC,SAAS,oBAAoB,SAAS,UAAU;CAC9C,MAAM,SAAS,OAAO,OAAO,SAAS,WAAW,CAAC;AAElD,KAAI,OAAO,WAAW,EACpB,SAAQ,YACN,qBAAqB,SAAS,KAAK,mCACnC,CAAC,SAAS,SAAS,GAAG,SAAS,kBAAkB,CAClD;AAGH,MAAK,MAAM,SAAS,QAAQ;AAE1B,eAAa,SAAS,MAAM;AAE5B,MAAI,CAAC,YAAY,MAAM,KAAK,EAAE;GAC5B,IAAI;AAEJ,WAAQ,YACN,eAAe,SAAS,KAAK,GAAG,MAAM,KAAK,+BAC7B,QAAQ,MAAM,KAAK,CAAC,KACjC,kBAAkB,MAAM,aAAa,QAAQ,oBAAoB,KAAK,IACnE,KAAK,IACL,gBAAgB,KACrB;;AAGH,MAAI,qBAAqB,MAAM,IAAI,MAAM,qBAAqB,MAAM;GAClE,IAAI;AAEJ,WAAQ,YACN,wBAAwB,SAAS,KAAK,GAAG,MAAM,KAAK,yBACpD,CACE,2BAA2B,MAAM,QAAQ,GACxC,kBAAkB,MAAM,aAAa,QACtC,oBAAoB,KAAK,IACrB,KAAK,IACL,gBAAgB,KACrB,CACF;;AAGH,MAAI,SAAS,QACX,+BAA8B,UAAU,OAAO,QAAQ;;;AAK7D,SAAS,8BAA8B,MAAM,OAAO,SAAS;AAC3D,KAAI,cAAc,MAAM,KAAK,EAAE;EAC7B,IAAI;AAEJ,UAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,sBAC5C,kBAAkB,MAAM,aAAa,QAAQ,oBAAoB,KAAK,IACnE,KAAK,IACL,gBAAgB,KACrB;;AAGH,KAAI,MAAM,iBAAiB,KAAA,EACzB,SAAQ,YACN,qBAAqB,KAAK,KAAK,GAAG,MAAM,KAAK,gCAC7C,MAAM,QACP;;AAIL,SAAS,uCAAuC,SAAS;CAIvD,MAAM,eAAe,OAAO,OAAO,KAAK;CAExC,MAAM,YAAY,EAAE;CAEpB,MAAM,2BAA2B,OAAO,OAAO,KAAK;AACpD,QAAO;CAIP,SAAS,qBAAqB,UAAU;AACtC,MAAI,aAAa,SAAS,MACxB;AAGF,eAAa,SAAS,QAAQ;AAC9B,2BAAyB,SAAS,QAAQ,UAAU;EACpD,MAAM,SAAS,OAAO,OAAO,SAAS,WAAW,CAAC;AAElD,OAAK,MAAM,SAAS,OAClB,KAAI,cAAc,MAAM,KAAK,IAAI,kBAAkB,MAAM,KAAK,OAAO,EAAE;GACrE,MAAM,YAAY,MAAM,KAAK;GAC7B,MAAM,aAAa,yBAAyB,UAAU;AACtD,aAAU,KAAK,MAAM;AAErB,OAAI,eAAe,KAAA,EACjB,sBAAqB,UAAU;QAC1B;IACL,MAAM,YAAY,UAAU,MAAM,WAAW;IAC7C,MAAM,UAAU,UAAU,KAAK,aAAa,SAAS,KAAK,CAAC,KAAK,IAAI;AACpE,YAAQ,YACN,kCAAkC,UAAU,KAAK,wDAAwD,QAAQ,KACjH,UAAU,KAAK,aAAa,SAAS,QAAQ,CAC9C;;AAGH,aAAU,KAAK;;AAInB,2BAAyB,SAAS,QAAQ,KAAA;;;AAI9C,SAAS,+BAA+B,MAAM,OAAO;CACnD,MAAM,EAAE,SAAS,sBAAsB;AAIvC,SAFE,WAAW,OAAO,CAAC,SAAS,GAAG,kBAAkB,GAAG,mBAGnD,SAAS,aAAa;EACrB,IAAI;AAEJ,UAEG,uBAAuB,SAAS,gBAAgB,QAC/C,yBAAyB,KAAK,IAC5B,uBACA,EAAE;GAER,CACD,QAAQ,cAAc,UAAU,KAAK,UAAU,MAAM,KAAK;;AAG/D,SAAS,wBAAwB,OAAO,UAAU;CAChD,MAAM,EAAE,SAAS,sBAAsB;AAIvC,SAFE,WAAW,OAAO,CAAC,SAAS,GAAG,kBAAkB,GAAG,mBAGnD,SAAS,cAAc;EACtB,IAAI;AAEJ,UAEG,mBAAmB,UAAU,WAAW,QACvC,qBAAqB,KAAK,IACxB,mBACA,EAAE;GAER,CACD,QAAQ,aAAa,SAAS,KAAK,UAAU,SAAS;;AAG3D,SAAS,2BAA2B,gBAAgB;CAClD,IAAI;AAEJ,QAAO,mBAAmB,QAAQ,mBAAmB,KAAK,IACtD,KAAK,KACJ,wBAAwB,eAAe,gBAAgB,QACxD,0BAA0B,KAAK,IAC/B,KAAK,IACL,sBAAsB,MACnB,SAAS,KAAK,KAAK,UAAU,2BAA2B,KAC1D;;;;ACrqBP,SAAgB,YAAY,QAAQ,UAAU;AAC5C,SAAQ,SAAS,MAAjB;EACE,KAAK,KAAK,WAAW;GACnB,MAAM,YAAY,YAAY,QAAQ,SAAS,KAAK;AACpD,UAAO,aAAa,IAAI,YAAY,UAAU;;EAGhD,KAAK,KAAK,eAAe;GACvB,MAAM,YAAY,YAAY,QAAQ,SAAS,KAAK;AACpD,UAAO,aAAa,IAAI,eAAe,UAAU;;EAGnD,KAAK,KAAK,WACR,QAAO,OAAO,QAAQ,SAAS,KAAK,MAAM;;;;;;;;;;ACYhD,IAAa,WAAb,MAAsB;CACpB,YACE,QAKA,aAEA,eACA;AACA,OAAK,UAAU;AACf,OAAK,aAAa,EAAE;AACpB,OAAK,mBAAmB,EAAE;AAC1B,OAAK,kBAAkB,EAAE;AACzB,OAAK,iBAAiB,EAAE;AACxB,OAAK,qBAAqB,EAAE;AAC5B,OAAK,aAAa;AAClB,OAAK,YAAY;AACjB,OAAK,aAAa;AAClB,OAAK,eACH,kBAAkB,QAAQ,kBAAkB,KAAK,IAC7C,gBACA;AAEN,MAAI,aAAa;AACf,OAAI,YAAY,YAAY,CAC1B,MAAK,gBAAgB,KAAK,YAAY;AAGxC,OAAI,gBAAgB,YAAY,CAC9B,MAAK,iBAAiB,KAAK,YAAY;AAGzC,OAAI,aAAa,YAAY,CAC3B,MAAK,WAAW,KAAK,YAAY;;;CAKvC,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,UAAU;AACR,MAAI,KAAK,WAAW,SAAS,EAC3B,QAAO,KAAK,WAAW,KAAK,WAAW,SAAS;;CAIpD,gBAAgB;AACd,MAAI,KAAK,iBAAiB,SAAS,EACjC,QAAO,KAAK,iBAAiB,KAAK,iBAAiB,SAAS;;CAIhE,eAAe;AACb,MAAI,KAAK,gBAAgB,SAAS,EAChC,QAAO,KAAK,gBAAgB,KAAK,gBAAgB,SAAS;;CAI9D,qBAAqB;AACnB,MAAI,KAAK,gBAAgB,SAAS,EAChC,QAAO,KAAK,gBAAgB,KAAK,gBAAgB,SAAS;;CAI9D,cAAc;AACZ,MAAI,KAAK,eAAe,SAAS,EAC/B,QAAO,KAAK,eAAe,KAAK,eAAe,SAAS;;CAI5D,kBAAkB;AAChB,MAAI,KAAK,mBAAmB,SAAS,EACnC,QAAO,KAAK,mBAAmB,KAAK,mBAAmB,SAAS;;CAIpE,eAAe;AACb,SAAO,KAAK;;CAGd,cAAc;AACZ,SAAO,KAAK;;CAGd,eAAe;AACb,SAAO,KAAK;;CAGd,MAAM,MAAM;EACV,MAAM,SAAS,KAAK;AAKpB,UAAQ,KAAK,MAAb;GACE,KAAK,KAAK,eAAe;IACvB,MAAM,YAAY,aAAa,KAAK,SAAS,CAAC;AAE9C,SAAK,iBAAiB,KACpB,gBAAgB,UAAU,GAAG,YAAY,KAAA,EAC1C;AAED;;GAGF,KAAK,KAAK,OAAO;IACf,MAAM,aAAa,KAAK,eAAe;IACvC,IAAI;IACJ,IAAI;AAEJ,QAAI,YAAY;AACd,gBAAW,KAAK,aAAa,QAAQ,YAAY,KAAK;AAEtD,SAAI,SACF,aAAY,SAAS;;AAIzB,SAAK,eAAe,KAAK,SAAS;AAElC,SAAK,WAAW,KAAK,aAAa,UAAU,GAAG,YAAY,KAAA,EAAU;AAErE;;GAGF,KAAK,KAAK;AACR,SAAK,aAAa,OAAO,aAAa,KAAK,KAAK,MAAM;AACtD;GAEF,KAAK,KAAK,sBAAsB;IAC9B,MAAM,WAAW,OAAO,YAAY,KAAK,UAAU;AAEnD,SAAK,WAAW,KAAK,aAAa,SAAS,GAAG,WAAW,KAAA,EAAU;AAEnE;;GAGF,KAAK,KAAK;GACV,KAAK,KAAK,qBAAqB;IAC7B,MAAM,mBAAmB,KAAK;IAC9B,MAAM,aAAa,mBACf,YAAY,QAAQ,iBAAiB,GACrC,aAAa,KAAK,SAAS,CAAC;AAEhC,SAAK,WAAW,KAAK,aAAa,WAAW,GAAG,aAAa,KAAA,EAAU;AAEvE;;GAGF,KAAK,KAAK,qBAAqB;IAC7B,MAAM,YAAY,YAAY,QAAQ,KAAK,KAAK;AAEhD,SAAK,gBAAgB,KACnB,YAAY,UAAU,GAAG,YAAY,KAAA,EACtC;AAED;;GAGF,KAAK,KAAK,UAAU;IAClB,IAAI;IAEJ,IAAI;IACJ,IAAI;IACJ,MAAM,oBACH,qBAAqB,KAAK,cAAc,MAAM,QAC/C,uBAAuB,KAAK,IACxB,qBACA,KAAK,aAAa;AAExB,QAAI,kBAAkB;AACpB,cAAS,iBAAiB,KAAK,MAC5B,QAAQ,IAAI,SAAS,KAAK,KAAK,MACjC;AAED,SAAI,OACF,WAAU,OAAO;;AAIrB,SAAK,YAAY;AAEjB,SAAK,mBAAmB,KAAK,SAAS,OAAO,eAAe,KAAA,EAAU;AAEtE,SAAK,gBAAgB,KAAK,YAAY,QAAQ,GAAG,UAAU,KAAA,EAAU;AAErE;;GAGF,KAAK,KAAK,MAAM;IACd,MAAM,WAAW,gBAAgB,KAAK,cAAc,CAAC;IACrD,MAAM,WAAW,WAAW,SAAS,GAAG,SAAS,SAAS;AAE1D,SAAK,mBAAmB,KAAK,KAAA,EAAU;AAEvC,SAAK,gBAAgB,KAAK,YAAY,SAAS,GAAG,WAAW,KAAA,EAAU;AAEvE;;GAGF,KAAK,KAAK,cAAc;IACtB,MAAM,aAAa,aAAa,KAAK,cAAc,CAAC;IACpD,IAAI;IACJ,IAAI;AAEJ,QAAI,kBAAkB,WAAW,EAAE;AACjC,kBAAa,WAAW,WAAW,CAAC,KAAK,KAAK;AAE9C,SAAI,WACF,kBAAiB,WAAW;;AAIhC,SAAK,mBAAmB,KACtB,aAAa,WAAW,eAAe,KAAA,EACxC;AAED,SAAK,gBAAgB,KACnB,YAAY,eAAe,GAAG,iBAAiB,KAAA,EAChD;AAED;;GAGF,KAAK,KAAK,MAAM;IACd,MAAM,WAAW,aAAa,KAAK,cAAc,CAAC;IAClD,IAAI;AAEJ,QAAI,WAAW,SAAS,CACtB,aAAY,SAAS,SAAS,KAAK,MAAM;AAG3C,SAAK,aAAa;AAClB;;GAGF;;;CAIJ,MAAM,MAAM;AACV,UAAQ,KAAK,MAAb;GACE,KAAK,KAAK;AACR,SAAK,iBAAiB,KAAK;AAE3B;GAEF,KAAK,KAAK;AACR,SAAK,eAAe,KAAK;AAEzB,SAAK,WAAW,KAAK;AAErB;GAEF,KAAK,KAAK;AACR,SAAK,aAAa;AAClB;GAEF,KAAK,KAAK;GACV,KAAK,KAAK;GACV,KAAK,KAAK;AACR,SAAK,WAAW,KAAK;AAErB;GAEF,KAAK,KAAK;AACR,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;AACR,SAAK,YAAY;AAEjB,SAAK,mBAAmB,KAAK;AAE7B,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;GACV,KAAK,KAAK;AACR,SAAK,mBAAmB,KAAK;AAE7B,SAAK,gBAAgB,KAAK;AAE1B;GAEF,KAAK,KAAK;AACR,SAAK,aAAa;AAClB;GAEF;;;;;;;;;AAUN,SAAS,YAAY,QAAQ,YAAY,WAAW;CAClD,MAAM,OAAO,UAAU,KAAK;AAE5B,KACE,SAAS,mBAAmB,QAC5B,OAAO,cAAc,KAAK,WAE1B,QAAO;AAGT,KAAI,SAAS,iBAAiB,QAAQ,OAAO,cAAc,KAAK,WAC9D,QAAO;AAGT,KAAI,SAAS,qBAAqB,QAAQ,gBAAgB,WAAW,CACnE,QAAO;AAGT,KAAI,aAAa,WAAW,IAAI,gBAAgB,WAAW,CACzD,QAAO,WAAW,WAAW,CAAC;;;;;;AAQlC,SAAgB,kBAAkB,UAAU,SAAS;AACnD,QAAO;EACL,MAAM,GAAG,MAAM;GACb,MAAM,OAAO,KAAK;AAClB,YAAS,MAAM,KAAK;GACpB,MAAM,KAAK,qBAAqB,SAAS,KAAK,KAAK,CAAC;AAEpD,OAAI,IAAI;IACN,MAAM,SAAS,GAAG,MAAM,SAAS,KAAK;AAEtC,QAAI,WAAW,KAAA,GAAW;AACxB,cAAS,MAAM,KAAK;AAEpB,SAAI,OAAO,OAAO,CAChB,UAAS,MAAM,OAAO;;AAI1B,WAAO;;;EAIX,MAAM,GAAG,MAAM;GACb,MAAM,OAAO,KAAK;GAClB,MAAM,KAAK,qBAAqB,SAAS,KAAK,KAAK,CAAC;GACpD,IAAI;AAEJ,OAAI,GACF,UAAS,GAAG,MAAM,SAAS,KAAK;AAGlC,YAAS,MAAM,KAAK;AACpB,UAAO;;EAEV;;;;ACjYH,SAAgB,2BAA2B,MAAM;AAC/C,QACE,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK;;AAwCvB,SAAgB,2BAA2B,MAAM;AAC/C,QACE,KAAK,SAAS,KAAK,qBACnB,qBAAqB,KAAK,IAC1B,KAAK,SAAS,KAAK;;AAGvB,SAAgB,qBAAqB,MAAM;AACzC,QACE,KAAK,SAAS,KAAK,0BACnB,KAAK,SAAS,KAAK,0BACnB,KAAK,SAAS,KAAK,6BACnB,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK;;AAGvB,SAAgB,0BAA0B,MAAM;AAC9C,QAAO,KAAK,SAAS,KAAK,oBAAoB,oBAAoB,KAAK;;AAEzE,SAAgB,oBAAoB,MAAM;AACxC,QACE,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,yBACnB,KAAK,SAAS,KAAK,4BACnB,KAAK,SAAS,KAAK,wBACnB,KAAK,SAAS,KAAK,uBACnB,KAAK,SAAS,KAAK;;;;;;;;;;;;AClEvB,SAAgB,0BAA0B,SAAS;AACjD,QAAO,EACL,SAAS,MAAM;AACb,OAAK,MAAM,cAAc,KAAK,YAC5B,KAAI,CAAC,2BAA2B,WAAW,EAAE;GAC3C,MAAM,UACJ,WAAW,SAAS,KAAK,qBACzB,WAAW,SAAS,KAAK,mBACrB,WACA,OAAM,WAAW,KAAK,QAAQ;AACpC,WAAQ,YACN,IAAI,aAAa,OAAO,QAAQ,iCAAiC,EAC/D,OAAO,YACR,CAAC,CACH;;AAIL,SAAO;IAEV;;;;;;;;;;;;ACdH,SAAgB,wBAAwB,SAAS;AAC/C,QAAO,EACL,MAAM,MAAM;EACV,MAAM,OAAO,QAAQ,eAAe;AAEpC,MAAI;OAGE,CAFa,QAAQ,aAAa,EAEvB;IAEb,MAAM,SAAS,QAAQ,WAAW;IAClC,MAAM,YAAY,KAAK,KAAK;IAE5B,IAAI,aAAa,WACf,gCACA,sBAAsB,QAAQ,MAAM,UAAU,CAC/C;AAED,QAAI,eAAe,GACjB,cAAa,WAAW,uBAAuB,MAAM,UAAU,CAAC;AAGlE,YAAQ,YACN,IAAI,aACF,uBAAuB,UAAU,aAAa,KAAK,KAAK,MACtD,YACF,EACE,OAAO,MACR,CACF,CACF;;;IAIR;;;;;;;AAQH,SAAS,sBAAsB,QAAQ,MAAM,WAAW;AACtD,KAAI,CAAC,eAAe,KAAK,CAEvB,QAAO,EAAE;CAGX,MAAM,iCAAiB,IAAI,KAAK;CAChC,MAAM,aAAa,OAAO,OAAO,KAAK;AAEtC,MAAK,MAAM,gBAAgB,OAAO,iBAAiB,KAAK,EAAE;AACxD,MAAI,CAAC,aAAa,WAAW,CAAC,WAC5B;AAGF,iBAAe,IAAI,aAAa;AAChC,aAAW,aAAa,QAAQ;AAEhC,OAAK,MAAM,qBAAqB,aAAa,eAAe,EAAE;GAC5D,IAAI;AAEJ,OAAI,CAAC,kBAAkB,WAAW,CAAC,WACjC;AAGF,kBAAe,IAAI,kBAAkB;AACrC,cAAW,kBAAkB,UACzB,wBAAwB,WAAW,kBAAkB,WACrD,QAAQ,0BAA0B,KAAK,IACrC,wBACA,KAAK;;;AAIf,QAAO,CAAC,GAAG,eAAe,CACvB,MAAM,OAAO,UAAU;EAEtB,MAAM,iBAAiB,WAAW,MAAM,QAAQ,WAAW,MAAM;AAEjE,MAAI,mBAAmB,EACrB,QAAO;AAGT,MAAI,gBAAgB,MAAM,IAAI,OAAO,UAAU,OAAO,MAAM,CAC1D,QAAO;AAGT,MAAI,gBAAgB,MAAM,IAAI,OAAO,UAAU,OAAO,MAAM,CAC1D,QAAO;AAGT,SAAO,eAAe,MAAM,MAAM,MAAM,KAAK;GAC7C,CACD,KAAK,MAAM,EAAE,KAAK;;;;;;AAOvB,SAAS,uBAAuB,MAAM,WAAW;AAC/C,KAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,CAE7C,QAAO,eAAe,WADK,OAAO,KAAK,KAAK,WAAW,CAAC,CACJ;AAGtD,QAAO,EAAE;;;;;;;;;;;;;AC/GX,SAAgB,8BAA8B,SAAS;AACrD,QAAO;EACL,eAAe,MAAM;GACnB,MAAM,gBAAgB,KAAK;AAE3B,OAAI,eAAe;IACjB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,cAAc;AAE5D,QAAI,QAAQ,CAAC,gBAAgB,KAAK,EAAE;KAClC,MAAM,UAAU,MAAM,cAAc;AACpC,aAAQ,YACN,IAAI,aACF,oDAAoD,QAAQ,KAC5D,EACE,OAAO,eACR,CACF,CACF;;;;EAKP,mBAAmB,MAAM;GACvB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,cAAc;AAEjE,OAAI,QAAQ,CAAC,gBAAgB,KAAK,EAAE;IAClC,MAAM,UAAU,MAAM,KAAK,cAAc;AACzC,YAAQ,YACN,IAAI,aACF,aAAa,KAAK,KAAK,MAAM,4CAA4C,QAAQ,KACjF,EACE,OAAO,KAAK,eACb,CACF,CACF;;;EAGN;;;;;;;;;;;;;ACpCH,SAAgB,uBAAuB,SAAS;AAC9C,QAAO;EAEL,GAAG,mCAAmC,QAAQ;EAE9C,SAAS,SAAS;GAChB,MAAM,SAAS,QAAQ,aAAa;GACpC,MAAM,WAAW,QAAQ,aAAa;GACtC,MAAM,aAAa,QAAQ,eAAe;AAE1C,OAAI,CAAC,UAAU,YAAY,YAAY;IACrC,MAAM,UAAU,QAAQ,KAAK;IAE7B,MAAM,cAAc,eAAe,SADZ,SAAS,KAAK,KAAK,QAAQ,IAAI,KAAK,CACA;AAC3D,YAAQ,YACN,IAAI,aACF,qBAAqB,QAAQ,cAAc,WAAW,KAAK,GAAG,SAAS,KAAK,MAC1E,WAAW,YAAY,EACzB,EACE,OAAO,SACR,CACF,CACF;;;EAGN;;;;;AAMH,SAAgB,mCAAmC,SAAS;CAC1D,MAAM,gBAAgB,OAAO,OAAO,KAAK;CACzC,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,eAAc,UAAU,QAAQ,UAAU,KAAK,KAAK,QAAQ,IAAI,KAAK;CAGvE,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,sBAAsB;EAC1C,IAAI;;EAKJ,MAAM,aACH,iBAAiB,IAAI,eAAe,QAAQ,mBAAmB,KAAK,IACjE,iBACA,EAAE;AACR,gBAAc,IAAI,KAAK,SAAS,UAAU,KAAK,QAAQ,IAAI,KAAK,MAAM;;AAI1E,QAAO,EACL,UAAU,eAAe;EACvB,MAAM,gBAAgB,cAAc,KAAK;EACzC,MAAM,YAAY,cAAc;AAEhC,MAAI,cAAc,aAAa,UAC7B,MAAK,MAAM,WAAW,cAAc,WAAW;GAC7C,MAAM,UAAU,QAAQ,KAAK;AAE7B,OAAI,CAAC,UAAU,SAAS,QAAQ,EAAE;IAChC,MAAM,cAAc,eAAe,SAAS,UAAU;AACtD,YAAQ,YACN,IAAI,aACF,qBAAqB,QAAQ,mBAAmB,cAAc,MAC5D,WAAW,YAAY,EACzB,EACE,OAAO,SACR,CACF,CACF;;;AAKP,SAAO;IAEV;;;;;;;;;;;;ACpFH,SAAgB,oBAAoB,SAAS;CAC3C,MAAM,eAAe,OAAO,OAAO,KAAK;CACxC,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,cAAa,UAAU,QAAQ,UAAU;CAG3C,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,qBACpB,cAAa,IAAI,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,KAAK,MAAM;AAI1E,QAAO,EACL,UAAU,MAAM,MAAM,SAAS,OAAO,WAAW;EAC/C,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,YAAY,aAAa;AAE/B,MAAI,CAAC,WAAW;AACd,WAAQ,YACN,IAAI,aAAa,uBAAuB,KAAK,KAAK,EAChD,OAAO,MACR,CAAC,CACH;AACD;;EAGF,MAAM,oBAAoB,+BAA+B,UAAU;AAEnE,MAAI,qBAAqB,CAAC,UAAU,SAAS,kBAAkB,CAC7D,SAAQ,YACN,IAAI,aACF,eAAe,KAAK,uBAAuB,kBAAkB,IAC7D,EACE,OAAO,MACR,CACF,CACF;IAGN;;AAGH,SAAS,+BAA+B,WAAW;CACjD,MAAM,YAAY,UAAU,UAAU,SAAS;AAC/C,WAAU,aAAa,UAAU,MAAM;AAEvC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,qBACR,QAAO,iCAAiC,UAAU,UAAU;EAE9D,KAAK,KAAK,MACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,gBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,gBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,iBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,iBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,yBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,qBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,oBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,sBACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK;EACV,KAAK,KAAK,4BACR,QAAO,kBAAkB;EAE3B,KAAK,KAAK,wBAAwB;GAChC,MAAM,aAAa,UAAU,UAAU,SAAS;AAChD,aAAU,cAAc,UAAU,MAAM;AACxC,UAAO,WAAW,SAAS,KAAK,+BAC5B,kBAAkB,yBAClB,kBAAkB;;EAMxB,QACW,WAAU,OAAO,sBAAsB,QAAQ,UAAU,KAAK,CAAC;;;AAI9E,SAAS,iCAAiC,WAAW;AACnD,SAAQ,WAAR;EACE,KAAK,kBAAkB,MACrB,QAAO,kBAAkB;EAE3B,KAAK,kBAAkB,SACrB,QAAO,kBAAkB;EAE3B,KAAK,kBAAkB,aACrB,QAAO,kBAAkB;;;;;;;;;;;;;ACzI/B,SAAgB,uBAAuB,SAAS;AAC9C,QAAO,EACL,eAAe,MAAM;EACnB,MAAM,eAAe,KAAK,KAAK;AAG/B,MAAI,CAFa,QAAQ,YAAY,aAAa,CAGhD,SAAQ,YACN,IAAI,aAAa,qBAAqB,aAAa,KAAK,EACtD,OAAO,KAAK,MACb,CAAC,CACH;IAGN;;;;;;;;;;;;ACLH,SAAgB,mBAAmB,SAAS;CAC1C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,mBAAmB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC3E,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,MAAK,MAAM,OAAO,QAAQ,aAAa,CAAC,YACtC,KAAI,qBAAqB,IAAI,CAC3B,cAAa,IAAI,KAAK,SAAS;CAInC,MAAM,YAAY,CAChB,GAAG,OAAO,KAAK,iBAAiB,EAChC,GAAG,OAAO,KAAK,aAAa,CAC7B;AACD,QAAO,EACL,UAAU,MAAM,IAAI,QAAQ,IAAI,WAAW;EACzC,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,iBAAiB,aAAa,CAAC,aAAa,WAAW;GAC1D,IAAI;GAEJ,MAAM,kBACH,cAAc,UAAU,QAAQ,QAAQ,gBAAgB,KAAK,IAC1D,cACA;GACN,MAAM,QAAQ,kBAAkB,QAAQ,UAAU,eAAe;AAEjE,OAAI,SAAS,kBAAkB,SAAS,SAAS,CAC/C;GAGF,MAAM,iBAAiB,eACrB,UACA,QAAQ,kBAAkB,OAAO,UAAU,GAAG,UAC/C;AACD,WAAQ,YACN,IAAI,aACF,iBAAiB,SAAS,MAAM,WAAW,eAAe,EAC1D,EACE,OAAO,MACR,CACF,CACF;;IAGN;;AAEH,MAAM,oBAAoB,CAAC,GAAG,sBAAsB,GAAG,mBAAmB,CAAC,KACxE,SAAS,KAAK,KAChB;AAED,SAAS,UAAU,OAAO;AACxB,QACE,UAAU,UACT,2BAA2B,MAAM,IAAI,0BAA0B,MAAM;;;;;;;;;;;;AC/D1E,SAAgB,2BAA2B,SAAS;CAClD,IAAI,iBAAiB;AACrB,QAAO;EACL,SAAS,MAAM;AACb,oBAAiB,KAAK,YAAY,QAC/B,eAAe,WAAW,SAAS,KAAK,qBAC1C,CAAC;;EAGJ,oBAAoB,MAAM;AACxB,OAAI,CAAC,KAAK,QAAQ,iBAAiB,EACjC,SAAQ,YACN,IAAI,aACF,gEACA,EACE,OAAO,MACR,CACF,CACF;;EAGN;;;;;;;;;ACzBH,SAAgB,yBAAyB,SAAS;CAChD,IAAI,MAAM,OAAO;CAEjB,MAAM,YAAY,QAAQ,WAAW;CACrC,MAAM,kBACH,QACE,SACE,qBACC,cAAc,QAAQ,cAAc,KAAK,IACrC,KAAK,IACL,UAAU,aAAa,QAAQ,uBAAuB,KAAK,IAC7D,qBACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,cAAc,MAAM,QAAQ,UAAU,KAAK,IACvD,QACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,iBAAiB,MAAM,QAAQ,SAAS,KAAK,IACzD,OACA,cAAc,QAAQ,cAAc,KAAK,IACzC,KAAK,IACL,UAAU,qBAAqB;CACrC,IAAI,yBAAyB;AAC7B,QAAO,EACL,iBAAiB,MAAM;AACrB,MAAI,gBAAgB;AAClB,WAAQ,YACN,IAAI,aACF,yDACA,EACE,OAAO,MACR,CACF,CACF;AACD;;AAGF,MAAI,yBAAyB,EAC3B,SAAQ,YACN,IAAI,aAAa,4CAA4C,EAC3D,OAAO,MACR,CAAC,CACH;AAGH,IAAE;IAEL;;;;ACrDH,MAAM,kBAAkB;AACxB,SAAgB,0BAA0B,SAAS;;;;;CAKjD,SAAS,WAAW,MAAM,mBAAmB,OAAO,OAAO,KAAK,EAAE,QAAQ,GAAG;AAC3E,MAAI,KAAK,SAAS,KAAK,iBAAiB;GACtC,MAAM,eAAe,KAAK,KAAK;AAE/B,OAAI,iBAAiB,kBAAkB,KAErC,QAAO;GAGT,MAAM,WAAW,QAAQ,YAAY,aAAa;AAElD,OAAI,CAAC,SAEH,QAAO;AAOT,OAAI;AACF,qBAAiB,gBAAgB;AACjC,WAAO,WAAW,UAAU,kBAAkB,MAAM;aAC5C;AACR,qBAAiB,gBAAgB,KAAA;;;AAIrC,MACE,KAAK,SAAS,KAAK,UAClB,KAAK,KAAK,UAAU,YACnB,KAAK,KAAK,UAAU,gBACpB,KAAK,KAAK,UAAU,mBACpB,KAAK,KAAK,UAAU,gBACtB;AAEA;AAEA,OAAI,SAAS,gBACX,QAAO;;AAIX,MAAI,kBAAkB,QAAQ,KAAK;QAC5B,MAAM,SAAS,KAAK,aAAa,WACpC,KAAI,WAAW,OAAO,kBAAkB,MAAM,CAC5C,QAAO;;AAKb,SAAO;;AAGT,QAAO,EACL,MAAM,MAAM;AACV,MAAI,KAAK,KAAK,UAAU,cAAc,KAAK,KAAK,UAAU;OACpD,WAAW,KAAK,EAAE;AACpB,YAAQ,YACN,IAAI,aAAa,wCAAwC,EACvD,OAAO,CAAC,KAAK,EACd,CAAC,CACH;AACD,WAAO;;;IAId;;;;;;;;;;;;ACjEH,SAAgB,qBAAqB,SAAS;CAG5C,MAAM,eAAe,OAAO,OAAO,KAAK;CAExC,MAAM,aAAa,EAAE;CAErB,MAAM,wBAAwB,OAAO,OAAO,KAAK;AACjD,QAAO;EACL,2BAA2B;EAE3B,mBAAmB,MAAM;AACvB,wBAAqB,KAAK;AAC1B,UAAO;;EAEV;CAID,SAAS,qBAAqB,UAAU;AACtC,MAAI,aAAa,SAAS,KAAK,OAC7B;EAGF,MAAM,eAAe,SAAS,KAAK;AACnC,eAAa,gBAAgB;EAC7B,MAAM,cAAc,QAAQ,mBAAmB,SAAS,aAAa;AAErE,MAAI,YAAY,WAAW,EACzB;AAGF,wBAAsB,gBAAgB,WAAW;AAEjD,OAAK,MAAM,cAAc,aAAa;GACpC,MAAM,aAAa,WAAW,KAAK;GACnC,MAAM,aAAa,sBAAsB;AACzC,cAAW,KAAK,WAAW;AAE3B,OAAI,eAAe,KAAA,GAAW;IAC5B,MAAM,iBAAiB,QAAQ,YAAY,WAAW;AAEtD,QAAI,eACF,sBAAqB,eAAe;UAEjC;IACL,MAAM,YAAY,WAAW,MAAM,WAAW;IAC9C,MAAM,UAAU,UACb,MAAM,GAAG,GAAG,CACZ,KAAK,MAAM,OAAM,EAAE,KAAK,QAAQ,KAAI,CACpC,KAAK,KAAK;AACb,YAAQ,YACN,IAAI,aACF,2BAA2B,WAAW,oBACnC,YAAY,KAAK,QAAQ,QAAQ,KAAK,MACzC,EACE,OAAO,WACR,CACF,CACF;;AAGH,cAAW,KAAK;;AAGlB,wBAAsB,gBAAgB,KAAA;;;;;;;;;;;;;ACjE1C,SAAgB,yBAAyB,SAAS;CAChD,IAAI,sBAAsB,OAAO,OAAO,KAAK;AAC7C,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,0BAAsB,OAAO,OAAO,KAAK;;GAG3C,MAAM,WAAW;IACf,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,UAAU,QAAQ;KAC7B,MAAM,UAAU,KAAK,KAAK;AAE1B,SAAI,oBAAoB,aAAa,KACnC,SAAQ,YACN,IAAI,aACF,UAAU,OACN,cAAc,QAAQ,iCAAiC,UAAU,KAAK,MAAM,MAC5E,cAAc,QAAQ,oBAC1B,EACE,OAAO,CAAC,MAAM,UAAU,EACzB,CACF,CACF;;;GAIR;EAED,mBAAmB,MAAM;AACvB,uBAAoB,KAAK,SAAS,KAAK,SAAS;;EAEnD;;;;;;;;;;;;ACjCH,SAAgB,sBAAsB,SAAS;CAC7C,MAAM,gBAAgB,EAAE;CACxB,MAAM,eAAe,EAAE;AACvB,QAAO;EACL,oBAAoB,MAAM;AACxB,iBAAc,KAAK,KAAK;AACxB,UAAO;;EAGT,mBAAmB,MAAM;AACvB,gBAAa,KAAK,KAAK;AACvB,UAAO;;EAGT,UAAU,EACR,QAAQ;GACN,MAAM,mBAAmB,OAAO,OAAO,KAAK;AAE5C,QAAK,MAAM,aAAa,cACtB,MAAK,MAAM,YAAY,QAAQ,kCAC7B,UACD,CACC,kBAAiB,SAAS,KAAK,SAAS;AAI5C,QAAK,MAAM,eAAe,cAAc;IACtC,MAAM,WAAW,YAAY,KAAK;AAElC,QAAI,iBAAiB,cAAc,KACjC,SAAQ,YACN,IAAI,aAAa,aAAa,SAAS,mBAAmB,EACxD,OAAO,aACR,CAAC,CACH;;KAIR;EACF;;;;;;;;;;;;ACvCH,SAAgB,sBAAsB,SAAS;CAC7C,IAAI,eAAe,EAAE;AACrB,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,mBAAe,EAAE;;GAGnB,MAAM,WAAW;IACf,MAAM,mBAAmB,OAAO,OAAO,KAAK;IAC5C,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,UAAU,OACrB,kBAAiB,KAAK,KAAK,SAAS;AAGtC,SAAK,MAAM,eAAe,cAAc;KACtC,MAAM,eAAe,YAAY,SAAS,KAAK;AAE/C,SAAI,iBAAiB,kBAAkB,KACrC,SAAQ,YACN,IAAI,aACF,UAAU,OACN,cAAc,aAAa,gCAAgC,UAAU,KAAK,MAAM,MAChF,cAAc,aAAa,mBAC/B,EACE,OAAO,aACR,CACF,CACF;;;GAIR;EAED,mBAAmB,KAAK;AACtB,gBAAa,KAAK,IAAI;;EAEzB;;;;;;;;;;;ACtCH,SAAgB,cAAc,WAAW;AACvC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OACR,QAAO;GAAE,GAAG;GAAW,QAAQ,WAAW,UAAU,OAAO;GAAE;EAE/D,KAAK,KAAK,KACR,QAAO;GAAE,GAAG;GAAW,QAAQ,UAAU,OAAO,IAAI,cAAc;GAAE;EAEtE,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK,SACR,QAAO;;;AAIb,SAAS,WAAW,QAAQ;AAC1B,QAAO,OACJ,KAAK,eAAe;EACnB,GAAG;EACH,OAAO,cAAc,UAAU,MAAM;EACtC,EAAE,CACF,MAAM,QAAQ,WACb,eAAe,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,CACrD;;;;ACtBL,SAAS,cAAc,QAAQ;AAC7B,KAAI,MAAM,QAAQ,OAAO,CACvB,QAAO,OACJ,KACE,CAAC,cAAc,eACd,cAAc,aAAa,uBAC3B,cAAc,UAAU,CAC3B,CACA,KAAK,QAAQ;AAGlB,QAAO;;;;;;;;;;;AAYT,SAAgB,iCAAiC,SAAS;CAIxD,MAAM,iCAAiC,IAAI,gBAAgB;CAC3D,MAAM,wBAAwB,IAAI,SAAS;CAI3C,MAAM,+CAA+B,IAAI,KAAK;AAC9C,QAAO,EACL,aAAa,cAAc;EACzB,MAAM,YAAY,gCAChB,SACA,8BACA,gCACA,uBACA,QAAQ,eAAe,EACvB,aACD;AAED,OAAK,MAAM,CAAC,CAAC,cAAc,SAAS,SAAS,YAAY,WAAW;GAClE,MAAM,YAAY,cAAc,OAAO;AACvC,WAAQ,YACN,IAAI,aACF,WAAW,aAAa,qBAAqB,UAAU,+EACvD,EACE,OAAO,QAAQ,OAAO,QAAQ,EAC/B,CACF,CACF;;IAGN;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DH,SAAS,gCACP,SACA,8BACA,gCACA,uBACA,YACA,cACA;CACA,MAAM,YAAY,EAAE;CACpB,MAAM,CAAC,UAAU,iBAAiB,0BAChC,SACA,8BACA,YACA,aACD;AAGD,wBACE,SACA,WACA,8BACA,gCACA,uBACA,SACD;AAED,KAAI,cAAc,WAAW,EAG3B,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,2CACE,SACA,WACA,8BACA,gCACA,uBACA,OACA,UACA,cAAc,GACf;AAKD,OAAK,IAAI,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,IAC5C,kCACE,SACA,WACA,8BACA,gCACA,uBACA,OACA,cAAc,IACd,cAAc,GACf;;AAKP,QAAO;;AAIT,SAAS,yCACP,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,cACA;AAGA,KACE,+BAA+B,IAC7B,UACA,cACA,qBACD,CAED;AAGF,gCAA+B,IAC7B,UACA,cACA,qBACD;CACD,MAAM,WAAW,QAAQ,YAAY,aAAa;AAElD,KAAI,CAAC,SACH;CAGF,MAAM,CAAC,WAAW,2BAChB,oCACE,SACA,8BACA,SACD;AAEH,KAAI,aAAa,UACf;AAIF,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,UACD;AAGD,MAAK,MAAM,0BAA0B,wBACnC,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,UACA,uBACD;;AAKL,SAAS,iCACP,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,eACA;AAEA,KAAI,kBAAkB,cACpB;AAGF,KACE,sBAAsB,IACpB,eACA,eACA,qBACD,CAED;AAGF,uBAAsB,IAAI,eAAe,eAAe,qBAAqB;CAC7E,MAAM,YAAY,QAAQ,YAAY,cAAc;CACpD,MAAM,YAAY,QAAQ,YAAY,cAAc;AAEpD,KAAI,CAAC,aAAa,CAAC,UACjB;CAGF,MAAM,CAAC,WAAW,4BAChB,oCACE,SACA,8BACA,UACD;CACH,MAAM,CAAC,WAAW,4BAChB,oCACE,SACA,8BACA,UACD;AAGH,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,UACD;AAGD,MAAK,MAAM,2BAA2B,yBACpC,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,wBACD;AAIH,MAAK,MAAM,2BAA2B,yBACpC,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,yBACA,cACD;;AAML,SAAS,qCACP,SACA,8BACA,gCACA,uBACA,sBACA,aACA,eACA,aACA,eACA;CACA,MAAM,YAAY,EAAE;CACpB,MAAM,CAAC,WAAW,kBAAkB,0BAClC,SACA,8BACA,aACA,cACD;CACD,MAAM,CAAC,WAAW,kBAAkB,0BAClC,SACA,8BACA,aACA,cACD;AAED,yBACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,UACD;AAGD,MAAK,MAAM,iBAAiB,eAC1B,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,cACD;AAIH,MAAK,MAAM,iBAAiB,eAC1B,0CACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,WACA,cACD;AAKH,MAAK,MAAM,iBAAiB,eAC1B,MAAK,MAAM,iBAAiB,eAC1B,kCACE,SACA,WACA,8BACA,gCACA,uBACA,sBACA,eACA,cACD;AAIL,QAAO;;AAGT,SAAS,uBACP,SACA,WACA,8BACA,gCACA,uBACA,UACA;AAKA,MAAK,MAAM,CAAC,cAAc,WAAW,OAAO,QAAQ,SAAS,CAI3D,KAAI,OAAO,SAAS,EAClB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IACjC,MAAK,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EAC1C,MAAM,WAAW,aACf,SACA,8BACA,gCACA,uBACA,OACA,cACA,OAAO,IACP,OAAO,GACR;AAED,MAAI,SACF,WAAU,KAAK,SAAS;;;AAYpC,SAAS,wBACP,SACA,WACA,8BACA,gCACA,uBACA,kCACA,WACA,WACA;AAMA,MAAK,MAAM,CAAC,cAAc,YAAY,OAAO,QAAQ,UAAU,EAAE;EAC/D,MAAM,UAAU,UAAU;AAE1B,MAAI,QACF,MAAK,MAAM,UAAU,QACnB,MAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,WAAW,aACf,SACA,8BACA,gCACA,uBACA,kCACA,cACA,QACA,OACD;AAED,OAAI,SACF,WAAU,KAAK,SAAS;;;;AASpC,SAAS,aACP,SACA,8BACA,gCACA,uBACA,kCACA,cACA,QACA,QACA;CACA,MAAM,CAAC,aAAa,OAAO,QAAQ;CACnC,MAAM,CAAC,aAAa,OAAO,QAAQ;CASnC,MAAM,uBACJ,oCACC,gBAAgB,eACf,aAAa,YAAY,IACzB,aAAa,YAAY;AAE7B,KAAI,CAAC,sBAAsB;EAEzB,MAAM,QAAQ,MAAM,KAAK;EACzB,MAAM,QAAQ,MAAM,KAAK;AAEzB,MAAI,UAAU,MACZ,QAAO;GACL,CAAC,cAAc,IAAI,MAAM,SAAS,MAAM,wBAAwB;GAChE,CAAC,MAAM;GACP,CAAC,MAAM;GACR;AAGH,MAAI,CAAC,cAAc,OAAO,MAAM,CAC9B,QAAO;GACL,CAAC,cAAc,gCAAgC;GAC/C,CAAC,MAAM;GACP,CAAC,MAAM;GACR;;CAIL,MAAM,QAAQ,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK;CAC/D,MAAM,QAAQ,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK;AAE/D,KAAI,SAAS,SAAS,gBAAgB,OAAO,MAAM,CACjD,QAAO;EACL,CACE,cACA,kCAAkC,QAAQ,MAAM,CAAC,SAAS,QACxD,MACD,CAAC,GACH;EACD,CAAC,MAAM;EACP,CAAC,MAAM;EACR;CAKH,MAAM,gBAAgB,MAAM;CAC5B,MAAM,gBAAgB,MAAM;AAE5B,KAAI,iBAAiB,cAYnB,QAAO,kBAXW,qCAChB,SACA,8BACA,gCACA,uBACA,sBACA,aAAa,MAAM,EACnB,eACA,aAAa,MAAM,EACnB,cACD,EACmC,cAAc,OAAO,MAAM;;AAInE,SAAS,cAAc,OAAO,OAAO;CACnC,MAAM,QAAQ,MAAM;CACpB,MAAM,QAAQ,MAAM;AAEpB,KAAI,UAAU,KAAA,KAAa,MAAM,WAAW,EAC1C,QAAO,UAAU,KAAA,KAAa,MAAM,WAAW;AAGjD,KAAI,UAAU,KAAA,KAAa,MAAM,WAAW,EAC1C,QAAO;;AAIT,KAAI,MAAM,WAAW,MAAM;;AAEzB,QAAO;CAIT,MAAM,UAAU,IAAI,IAAI,MAAM,KAAK,EAAE,MAAM,YAAY,CAAC,KAAK,OAAO,MAAM,CAAC,CAAC;AAC5E,QAAO,MAAM,OAAO,SAAS;EAC3B,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK,MAAM;AAE3C,MAAI,WAAW,KAAA,EACb,QAAO;AAGT,SAAO,eAAe,OAAO,KAAK,eAAe,OAAO;GACxD;;AAGJ,SAAS,eAAe,OAAO;AAC7B,QAAO,MAAM,cAAc,MAAM,CAAC;;AAKpC,SAAS,gBAAgB,OAAO,OAAO;AACrC,KAAI,WAAW,MAAM,CACnB,QAAO,WAAW,MAAM,GACpB,gBAAgB,MAAM,QAAQ,MAAM,OAAO,GAC3C;AAGN,KAAI,WAAW,MAAM,CACnB,QAAO;AAGT,KAAI,cAAc,MAAM,CACtB,QAAO,cAAc,MAAM,GACvB,gBAAgB,MAAM,QAAQ,MAAM,OAAO,GAC3C;AAGN,KAAI,cAAc,MAAM,CACtB,QAAO;AAGT,KAAI,WAAW,MAAM,IAAI,WAAW,MAAM,CACxC,QAAO,UAAU;AAGnB,QAAO;;AAKT,SAAS,0BACP,SACA,8BACA,YACA,cACA;CACA,MAAM,SAAS,6BAA6B,IAAI,aAAa;AAE7D,KAAI,OACF,QAAO;CAGT,MAAM,cAAc,OAAO,OAAO,KAAK;CACvC,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,gCACE,SACA,YACA,cACA,aACA,cACD;CAED,MAAM,SAAS,CAAC,aAAa,OAAO,KAAK,cAAc,CAAC;AACxD,8BAA6B,IAAI,cAAc,OAAO;AACtD,QAAO;;AAIT,SAAS,oCACP,SACA,8BACA,UACA;CAEA,MAAM,SAAS,6BAA6B,IAAI,SAAS,aAAa;AAEtE,KAAI,OACF,QAAO;AAIT,QAAO,0BACL,SACA,8BAHmB,YAAY,QAAQ,WAAW,EAAE,SAAS,cAAc,EAK3E,SAAS,aACV;;AAGH,SAAS,+BACP,SACA,YACA,cACA,aACA,eACA;AACA,MAAK,MAAM,aAAa,aAAa,WACnC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OAAO;GACf,MAAM,YAAY,UAAU,KAAK;GACjC,IAAI;AAEJ,OAAI,aAAa,WAAW,IAAI,gBAAgB,WAAW,CACzD,YAAW,WAAW,WAAW,CAAC;GAGpC,MAAM,eAAe,UAAU,QAC3B,UAAU,MAAM,QAChB;AAEJ,OAAI,CAAC,YAAY,cACf,aAAY,gBAAgB,EAAE;AAGhC,eAAY,cAAc,KAAK;IAAC;IAAY;IAAW;IAAS,CAAC;AACjE;;EAGF,KAAK,KAAK;AACR,iBAAc,UAAU,KAAK,SAAS;AACtC;EAEF,KAAK,KAAK,iBAAiB;GACzB,MAAM,gBAAgB,UAAU;AAKhC,kCACE,SALyB,gBACvB,YAAY,QAAQ,WAAW,EAAE,cAAc,GAC/C,YAKF,UAAU,cACV,aACA,cACD;AAED;;;;AAOR,SAAS,kBAAkB,WAAW,cAAc,OAAO,OAAO;AAChE,KAAI,UAAU,SAAS,EACrB,QAAO;EACL,CAAC,cAAc,UAAU,KAAK,CAAC,YAAY,OAAO,CAAC;EACnD,CAAC,OAAO,GAAG,UAAU,KAAK,GAAG,aAAa,QAAQ,CAAC,MAAM,CAAC;EAC1D,CAAC,OAAO,GAAG,UAAU,KAAK,KAAK,aAAa,QAAQ,CAAC,MAAM,CAAC;EAC7D;;;;;;;;;AAWL,IAAM,iBAAN,MAAqB;CACnB,cAAc;AACZ,OAAK,wBAAQ,IAAI,KAAK;;CAGxB,IAAI,GAAG,GAAG,eAAe;EACvB,IAAI;EAEJ,MAAM,UACH,kBAAkB,KAAK,MAAM,IAAI,EAAE,MAAM,QAC1C,oBAAoB,KAAK,IACrB,KAAK,IACL,gBAAgB,IAAI,EAAE;AAE5B,MAAI,WAAW,KAAA,EACb,QAAO;AAGT,SAAO,gBAAgB,OAAO,kBAAkB;;CAGlD,IAAI,GAAG,GAAG,eAAe;EACvB,MAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAE7B,MAAI,QAAQ,KAAA,EACV,MAAK,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;MAEhD,KAAI,IAAI,GAAG,cAAc;;;;;;;AAS/B,IAAM,UAAN,MAAc;CACZ,cAAc;AACZ,OAAK,kBAAkB,IAAI,gBAAgB;;CAG7C,IAAI,GAAG,GAAG,eAAe;AACvB,SAAO,IAAI,IACP,KAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc,GAC7C,KAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;;CAGnD,IAAI,GAAG,GAAG,eAAe;AACvB,MAAI,IAAI,EACN,MAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;MAE7C,MAAK,gBAAgB,IAAI,GAAG,GAAG,cAAc;;;;;;;;;;;;ACp0BnD,SAAgB,4BAA4B,SAAS;AACnD,QAAO;EACL,eAAe,MAAM;GACnB,MAAM,WAAW,QAAQ,SAAS;GAClC,MAAM,aAAa,QAAQ,eAAe;AAE1C,OACE,gBAAgB,SAAS,IACzB,gBAAgB,WAAW,IAC3B,CAAC,eAAe,QAAQ,WAAW,EAAE,UAAU,WAAW,EAC1D;IACA,MAAM,gBAAgB,QAAQ,WAAW;IACzC,MAAM,cAAc,QAAQ,SAAS;AACrC,YAAQ,YACN,IAAI,aACF,sDAAsD,cAAc,0BAA0B,YAAY,KAC1G,EACE,OAAO,MACR,CACF,CACF;;;EAIL,eAAe,MAAM;GACnB,MAAM,WAAW,KAAK,KAAK;GAC3B,MAAM,WAAW,gBAAgB,SAAS,SAAS;GACnD,MAAM,aAAa,QAAQ,eAAe;AAE1C,OACE,YACA,cACA,CAAC,eAAe,QAAQ,WAAW,EAAE,UAAU,WAAW,EAC1D;IACA,MAAM,gBAAgB,QAAQ,WAAW;IACzC,MAAM,cAAc,QAAQ,SAAS;AACrC,YAAQ,YACN,IAAI,aACF,aAAa,SAAS,8CAA8C,cAAc,0BAA0B,YAAY,KACxH,EACE,OAAO,MACR,CACF,CACF;;;EAGN;;AAGH,SAAS,gBAAgB,SAAS,MAAM;CACtC,MAAM,OAAO,QAAQ,YAAY,KAAK;AAEtC,KAAI,MAAM;EACR,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,cAAc;AAEjE,MAAI,gBAAgB,KAAK,CACvB,QAAO;;;;;;;;;;AChDb,SAAgB,2BAA2B,SAAS;CAClD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,MAAK,MAAM,OAAO,QAAQ,aAAa,CAAC,YACtC,KAAI,qBAAqB,IAAI,CAC3B,cAAa,IAAI,KAAK,SAAS;AAInC,QAAO;EACL,qBAAqB;EACrB,qBAAqB;EACrB,wBAAwB;EACxB,oBAAoB;EACpB,mBAAmB;EACnB,0BAA0B;EAC3B;CAED,SAAS,eAAe,MAAM;EAC5B,MAAM,WAAW,KAAK,KAAK;EAC3B,MAAM,UAAU,aAAa;EAC7B,MAAM,eACJ,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,QAAQ,SAAS;EAC1E,IAAI;AAEJ,MAAI,QACF,gBAAe,iBAAiB,QAAQ;WAC/B,aACT,gBAAe,cAAc,aAAa;AAG5C,MAAI;OACE,iBAAiB,KAAK,MAAM;IAC9B,MAAM,UAAU,wBAAwB,KAAK,KAAK;AAClD,YAAQ,YACN,IAAI,aAAa,qBAAqB,QAAQ,SAAS,SAAS,KAAK,EACnE,OAAO,UAAU,CAAC,SAAS,KAAK,GAAG,MACpC,CAAC,CACH;;SAEE;GAOL,MAAM,iBAAiB,eAAe,UANjB,OAAO,KAAK;IAC/B,GAAG;IACH,GAAI,WAAW,QAAQ,WAAW,KAAK,IACnC,KAAK,IACL,OAAO,YAAY;IACxB,CAAC,CAC2D;AAC7D,WAAQ,YACN,IAAI,aACF,uBAAuB,SAAS,gCAC9B,WAAW,eAAe,EAC5B,EACE,OAAO,KAAK,MACb,CACF,CACF;;;;AAIP,MAAM,mBAAmB;EACtB,KAAK,yBAAyB,KAAK;EACnC,KAAK,yBAAyB,KAAK;EACnC,KAAK,4BAA4B,KAAK;EACtC,KAAK,wBAAwB,KAAK;EAClC,KAAK,uBAAuB,KAAK;EACjC,KAAK,+BAA+B,KAAK;CAC3C;AAED,SAAS,cAAc,MAAM;AAC3B,KAAI,aAAa,KAAK,CACpB,QAAO,KAAK;AAGd,KAAI,aAAa,KAAK,CACpB,QAAO,KAAK;AAGd,KAAI,gBAAgB,KAAK,CACvB,QAAO,KAAK;AAGd,KAAI,YAAY,KAAK,CACnB,QAAO,KAAK;AAGd,KAAI,WAAW,KAAK,CAClB,QAAO,KAAK;AAGd,KAAI,kBAAkB,KAAK,CACzB,QAAO,KAAK;;AAKL,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;AAGhE,SAAS,wBAAwB,MAAM;AACrC,SAAQ,MAAR;EACE,KAAK,KAAK,sBACR,QAAO;EAET,KAAK,KAAK,sBACR,QAAO;EAET,KAAK,KAAK,yBACR,QAAO;EAET,KAAK,KAAK,qBACR,QAAO;EAET,KAAK,KAAK,oBACR,QAAO;EAET,KAAK,KAAK,4BACR,QAAO;EAKT,QACW,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;;;;;;;;;;ACnIpE,SAAgB,8BAA8B,SAAS;AACrD,QAAO;EAEL,GAAG,0CAA0C,QAAQ;EACrD,OAAO,EAEL,MAAM,WAAW;GACf,IAAI;GAEJ,MAAM,WAAW,QAAQ,aAAa;AAEtC,OAAI,CAAC,SACH,QAAO;GAGT,MAAM,eAAe,IAAI;;KAEtB,uBAAuB,UAAU,eAAe,QACjD,yBAAyB,KAAK,IAC1B,KAAK,IACL,qBAAqB,KAAK,QAAQ,IAAI,KAAK,MAAM;IACtD;AAED,QAAK,MAAM,UAAU,SAAS,KAC5B,KAAI,CAAC,aAAa,IAAI,OAAO,KAAK,IAAI,mBAAmB,OAAO,EAAE;IAChE,MAAM,aAAa,QAAQ,OAAO,KAAK;AACvC,YAAQ,YACN,IAAI,aACF,UAAU,SAAS,KAAK,cAAc,OAAO,KAAK,aAAa,WAAW,0CAC1E,EACE,OAAO,WACR,CACF,CACF;;KAIR;EACF;;;;;AAMH,SAAgB,0CAA0C,SAAS;CACjE,IAAI;CAEJ,MAAM,kBAAkB,OAAO,OAAO,KAAK;CAC3C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,qBACH,wBACC,WAAW,QAAQ,WAAW,KAAK,IAC/B,KAAK,IACL,OAAO,eAAe,MAAM,QAAQ,0BAA0B,KAAK,IACrE,wBACA;AAEN,MAAK,MAAM,aAAa,kBACtB,iBAAgB,UAAU,QAAQ,OAChC,UAAU,KAAK,OAAO,mBAAmB,GACxC,QAAQ,IAAI,KACd;CAGH,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,sBAAsB;EAC1C,IAAI;;EAKJ,MAAM,YACH,iBAAiB,IAAI,eAAe,QAAQ,mBAAmB,KAAK,IACjE,iBACA,EAAE;AACR,kBAAgB,IAAI,KAAK,SAAS,OAChC,SAAS,OAAO,uBAAuB,GACtC,QAAQ,IAAI,KAAK,MACnB;;AAIL,QAAO,EACL,WAAW,EAET,MAAM,eAAe;EACnB,MAAM,gBAAgB,cAAc,KAAK;EACzC,MAAM,eAAe,gBAAgB;AAErC,MAAI,cAAc;GAChB,IAAI;;GAKJ,MAAM,YACH,wBAAwB,cAAc,eAAe,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;GACR,MAAM,aAAa,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,KAAK,MAAM,CAAC;AAEjE,QAAK,MAAM,CAAC,SAAS,WAAW,OAAO,QAAQ,aAAa,CAC1D,KAAI,CAAC,WAAW,IAAI,QAAQ,EAAE;IAC5B,MAAM,UAAU,OAAO,OAAO,KAAK,GAC/B,QAAQ,OAAO,KAAK,GACpB,MAAM,OAAO,KAAK;AACtB,YAAQ,YACN,IAAI,aACF,eAAe,cAAc,cAAc,QAAQ,aAAa,QAAQ,0CACxE,EACE,OAAO,eACR,CACF,CACF;;;IAKV,EACF;;AAGH,SAAS,uBAAuB,KAAK;AACnC,QAAO,IAAI,KAAK,SAAS,KAAK,iBAAiB,IAAI,gBAAgB;;;;;;;;;;AClIrE,SAAgB,gBAAgB,SAAS;AACvC,QAAO,EACL,MAAM,MAAM;EACV,MAAM,OAAO,QAAQ,SAAS;EAC9B,MAAM,eAAe,KAAK;AAE1B,MAAI;OACE,WAAW,aAAa,KAAK,CAAC;QAC5B,cAAc;KAChB,MAAM,YAAY,KAAK,KAAK;KAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,aAAQ,YACN,IAAI,aACF,UAAU,UAAU,0CAA0C,QAAQ,sBACtE,EACE,OAAO,cACR,CACF,CACF;;cAEM,CAAC,cAAc;IACxB,MAAM,YAAY,KAAK,KAAK;IAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,YACN,IAAI,aACF,UAAU,UAAU,aAAa,QAAQ,sDAAsD,UAAU,aACzG,EACE,OAAO,MACR,CACF,CACF;cACQ,aAAa,WAAW,WAAW,GAAG;IAC/C,MAAM,YAAY,KAAK,KAAK;IAC5B,MAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,YACN,IAAI,aACF,UAAU,UAAU,aAAa,QAAQ,2CACzC,EACE,OAAO,MACR,CACF,CACF;;;IAIR;;;;;;;ACpDH,SAAgB,eAAe,MAAM;AACnC,QAAO,KACJ,KAAK,QACJ,OAAO,QAAQ,WAAW,MAAM,IAAI,UAAU,GAAG,MAAM,MAAM,IAC9D,CACA,KAAK,GAAG;;;;;;;ACLb,SAAgB,QAAQ,MAAM,KAAK,UAAU;AAC3C,QAAO;EACL;EACA;EACA;EACD;;;;;AAMH,SAAgB,YAAY,MAAM;CAChC,MAAM,YAAY,EAAE;CACpB,IAAI,OAAO;AAEX,QAAO,MAAM;AACX,YAAU,KAAK,KAAK,IAAI;AACxB,SAAO,KAAK;;AAGd,QAAO,UAAU,SAAS;;;;;;;ACJ5B,SAAgB,iBAAiB,YAAY,MAAM,UAAU,gBAAgB;AAC3E,QAAO,qBAAqB,YAAY,MAAM,SAAS,KAAA,EAAU;;AAGnE,SAAS,eAAe,MAAM,cAAc,OAAO;CACjD,IAAI,cAAc,mBAAmB,QAAQ,aAAa;AAE1D,KAAI,KAAK,SAAS,EAChB,gBAAe,aAAa,eAAe,KAAK,CAAC;AAGnD,OAAM,UAAU,cAAc,OAAO,MAAM;AAC3C,OAAM;;AAGR,SAAS,qBAAqB,YAAY,MAAM,SAAS,MAAM;AAC7D,KAAI,cAAc,KAAK,EAAE;AACvB,MAAI,cAAc,KAChB,QAAO,qBAAqB,YAAY,KAAK,QAAQ,SAAS,KAAK;AAGrE,UACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,+BAA+B,QAAQ,KAAK,CAAC,mBAC9C,CACF;AACD;;AAGF,KAAI,cAAc,KAEhB,QAAO;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,iBAAiB,WAAW,CAC9B,QAAO,MAAM,KAAK,aAAa,WAAW,UAAU;AAElD,UAAO,qBAAqB,WAAW,UAAU,SADhC,QAAQ,MAAM,OAAO,KAAA,EAAU,CACmB;IACnE;AAGJ,SAAO,CAAC,qBAAqB,YAAY,UAAU,SAAS,KAAK,CAAC;;AAGpE,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,CAAC,aAAa,WAAW,IAAI,MAAM,QAAQ,WAAW,EAAE;AAC1D,WACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,oBAAoB,CAClE;AACD;;EAGF,MAAM,eAAe,EAAE;EACvB,MAAM,YAAY,KAAK,WAAW;AAElC,OAAK,MAAM,SAAS,OAAO,OAAO,UAAU,EAAE;GAC5C,MAAM,aAAa,WAAW,MAAM;AAEpC,OAAI,eAAe,KAAA,GAAW;AAC5B,QAAI,MAAM,iBAAiB,KAAA,EACzB,cAAa,MAAM,QAAQ,MAAM;aACxB,cAAc,MAAM,KAAK,EAAE;KACpC,MAAM,UAAU,QAAQ,MAAM,KAAK;AACnC,aACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,UAAU,MAAM,KAAK,sBAAsB,QAAQ,qBACpD,CACF;;AAGH;;AAGF,gBAAa,MAAM,QAAQ,qBACzB,YACA,MAAM,MACN,SACA,QAAQ,MAAM,MAAM,MAAM,KAAK,KAAK,CACrC;;AAGH,OAAK,MAAM,aAAa,OAAO,KAAK,WAAW,CAC7C,KAAI,CAAC,UAAU,YAAY;GACzB,MAAM,cAAc,eAClB,WACA,OAAO,KAAK,KAAK,WAAW,CAAC,CAC9B;AACD,WACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,UAAU,UAAU,4BAA4B,KAAK,KAAK,MACxD,WAAW,YAAY,CAC1B,CACF;;AAIL,MAAI,KAAK,SAAS;GAChB,MAAM,OAAO,OAAO,KAAK,aAAa;AAEtC,OAAI,KAAK,WAAW,EAClB,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aACF,qDAAqD,KAAK,KAAK,IAChE,CACF;GAGH,MAAM,MAAM,KAAK;GACjB,MAAM,QAAQ,aAAa;AAE3B,OAAI,UAAU,KACZ,SACE,YAAY,KAAK,CAAC,OAAO,IAAI,EAC7B,OACA,IAAI,aAAa,UAAU,IAAI,qBAAqB,CACrD;;AAIL,SAAO;;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,IAAI;AAIJ,MAAI;AACF,iBAAc,KAAK,WAAW,WAAW;WAClC,OAAO;AACd,OAAI,iBAAiB,aACnB,SAAQ,YAAY,KAAK,EAAE,YAAY,MAAM;OAE7C,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,OAAO,MAAM,SAAS,EACjE,eAAe,OAChB,CAAC,CACH;AAGH;;AAGF,MAAI,gBAAgB,KAAA,EAClB,SACE,YAAY,KAAK,EACjB,YACA,IAAI,aAAa,kBAAkB,KAAK,KAAK,IAAI,CAClD;AAGH,SAAO;;;AAKA,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;;;;;AC/JtE,SAAgB,aAAa,WAAW,MAAM,WAAW;AACvD,KAAI,CAAC,UAGH;AAGF,KAAI,UAAU,SAAS,KAAK,UAAU;EACpC,MAAM,eAAe,UAAU,KAAK;AAEpC,MAAI,aAAa,QAAQ,UAAU,kBAAkB,KAAA,EAEnD;EAGF,MAAM,gBAAgB,UAAU;AAEhC,MAAI,kBAAkB,QAAQ,cAAc,KAAK,CAC/C;AAKF,SAAO;;AAGT,KAAI,cAAc,KAAK,EAAE;AACvB,MAAI,UAAU,SAAS,KAAK,KAC1B;AAGF,SAAO,aAAa,WAAW,KAAK,QAAQ,UAAU;;AAGxD,KAAI,UAAU,SAAS,KAAK,KAE1B,QAAO;AAGT,KAAI,WAAW,KAAK,EAAE;EACpB,MAAM,WAAW,KAAK;AAEtB,MAAI,UAAU,SAAS,KAAK,MAAM;GAChC,MAAM,gBAAgB,EAAE;AAExB,QAAK,MAAM,YAAY,UAAU,OAC/B,KAAI,kBAAkB,UAAU,UAAU,EAAE;AAG1C,QAAI,cAAc,SAAS,CACzB;AAGF,kBAAc,KAAK,KAAK;UACnB;IACL,MAAM,YAAY,aAAa,UAAU,UAAU,UAAU;AAE7D,QAAI,cAAc,KAAA,EAChB;AAGF,kBAAc,KAAK,UAAU;;AAIjC,UAAO;;EAGT,MAAM,eAAe,aAAa,WAAW,UAAU,UAAU;AAEjE,MAAI,iBAAiB,KAAA,EACnB;AAGF,SAAO,CAAC,aAAa;;AAGvB,KAAI,kBAAkB,KAAK,EAAE;AAC3B,MAAI,UAAU,SAAS,KAAK,OAC1B;EAGF,MAAM,aAAa,OAAO,OAAO,KAAK;EACtC,MAAM,aAAa,OAAO,UAAU,SAAS,UAAU,MAAM,KAAK,MAAM;AAExE,OAAK,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,EAAE;GACnD,MAAM,YAAY,WAAW,MAAM;AAEnC,OAAI,CAAC,aAAa,kBAAkB,UAAU,OAAO,UAAU,EAAE;AAC/D,QAAI,MAAM,iBAAiB,KAAA,EACzB,YAAW,MAAM,QAAQ,MAAM;aACtB,cAAc,MAAM,KAAK,CAClC;AAGF;;GAGF,MAAM,aAAa,aAAa,UAAU,OAAO,MAAM,MAAM,UAAU;AAEvE,OAAI,eAAe,KAAA,EACjB;AAGF,cAAW,MAAM,QAAQ;;AAG3B,MAAI,KAAK,SAAS;GAChB,MAAM,OAAO,OAAO,KAAK,WAAW;AAEpC,OAAI,KAAK,WAAW,EAClB;AAGF,OAAI,WAAW,KAAK,QAAQ,KAC1B;;AAIJ,SAAO;;AAGT,KAAI,WAAW,KAAK,EAAE;EAIpB,IAAI;AAEJ,MAAI;AACF,YAAS,KAAK,aAAa,WAAW,UAAU;WACzC,QAAQ;AACf;;AAGF,MAAI,WAAW,KAAA,EACb;AAGF,SAAO;;;AAKA,WAAU,OAAO,4BAA4B,QAAQ,KAAK,CAAC;;AAItE,SAAS,kBAAkB,WAAW,WAAW;AAC/C,QACE,UAAU,SAAS,KAAK,aACvB,aAAa,QAAQ,UAAU,UAAU,KAAK,WAAW,KAAA;;;;;;;;;;;;;ACjK9D,SAAgB,kBAAkB,QAAQ,aAAa,QAAQ,SAAS;CACtE,MAAM,SAAS,EAAE;CACjB,MAAM,YACJ,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;AAE5D,KAAI;EACF,MAAM,UAAU,qBACd,QACA,aACA,SACC,UAAU;AACT,OAAI,aAAa,QAAQ,OAAO,UAAU,UACxC,OAAM,IAAI,aACR,gFACD;AAGH,UAAO,KAAK,MAAM;IAErB;AAED,MAAI,OAAO,WAAW,EACpB,QAAO,EACL,SACD;UAEI,OAAO;AACd,SAAO,KAAK,MAAM;;AAGpB,QAAO,EACL,QACD;;AAGH,SAAS,qBAAqB,QAAQ,aAAa,QAAQ,SAAS;CAClE,MAAM,gBAAgB,EAAE;AAExB,MAAK,MAAM,cAAc,aAAa;EACpC,MAAM,UAAU,WAAW,SAAS,KAAK;EACzC,MAAM,UAAU,YAAY,QAAQ,WAAW,KAAK;AAEpD,MAAI,CAAC,YAAY,QAAQ,EAAE;AAIzB,WACE,IAAI,aACF,cAAc,QAAQ,4BAHP,MAAM,WAAW,KAAK,CAGwB,2CAC7D,EACE,OAAO,WAAW,MACnB,CACF,CACF;AACD;;AAGF,MAAI,CAAC,eAAe,QAAQ,QAAQ,EAAE;AACpC,OAAI,WAAW,aACb,eAAc,WAAW,aAAa,WAAW,cAAc,QAAQ;YAC9D,cAAc,QAAQ,CAE/B,SACE,IAAI,aACF,cAAc,QAAQ,sBAHP,QAAQ,QAAQ,CAGwB,sBACvD,EACE,OAAO,YACR,CACF,CACF;AAGH;;EAGF,MAAM,QAAQ,OAAO;AAErB,MAAI,UAAU,QAAQ,cAAc,QAAQ,EAAE;AAE5C,WACE,IAAI,aACF,cAAc,QAAQ,sBAHP,QAAQ,QAAQ,CAGwB,sBACvD,EACE,OAAO,YACR,CACF,CACF;AACD;;AAGF,gBAAc,WAAW,iBACvB,OACA,UACC,MAAM,cAAc,UAAU;GAC7B,IAAI,SACF,cAAc,QAAQ,wBAAwB,QAAQ,aAAa;AAErE,OAAI,KAAK,SAAS,EAChB,WAAU,QAAQ,UAAU,eAAe,KAAK,CAAC;AAGnD,WACE,IAAI,aAAa,SAAS,OAAO,MAAM,SAAS;IAC9C,OAAO;IACP,eAAe;IAChB,CAAC,CACH;IAEJ;;AAGH,QAAO;;;;;;;;;;AAWT,SAAgB,kBAAkB,KAAK,MAAM,gBAAgB;CAC3D,IAAI;CAEJ,MAAM,gBAAgB,EAAE;CAQxB,MAAM,aAAa,QAHhB,kBAAkB,KAAK,eAAe,QAAQ,oBAAoB,KAAK,IACpE,kBACA,EAAE,GACkC,QAAQ,IAAI,KAAK,MAAM;AAEjE,MAAK,MAAM,UAAU,IAAI,MAAM;EAC7B,MAAM,OAAO,OAAO;EACpB,MAAM,UAAU,OAAO;EACvB,MAAM,eAAe,WAAW;AAEhC,MAAI,CAAC,cAAc;AACjB,OAAI,OAAO,iBAAiB,KAAA,EAC1B,eAAc,QAAQ,OAAO;YACpB,cAAc,QAAQ,CAC/B,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,sBAEzD,EACE,OAAO,MACR,CACF;AAGH;;EAGF,MAAM,YAAY,aAAa;EAC/B,IAAI,SAAS,UAAU,SAAS,KAAK;AAErC,MAAI,UAAU,SAAS,KAAK,UAAU;GACpC,MAAM,eAAe,UAAU,KAAK;AAEpC,OACE,kBAAkB,QAClB,CAAC,eAAe,gBAAgB,aAAa,EAC7C;AACA,QAAI,OAAO,iBAAiB,KAAA,EAC1B,eAAc,QAAQ,OAAO;aACpB,cAAc,QAAQ,CAC/B,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,gCACxB,aAAa,4CAC9C,EACE,OAAO,WACR,CACF;AAGH;;AAGF,YAAS,eAAe,iBAAiB;;AAG3C,MAAI,UAAU,cAAc,QAAQ,CAClC,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,QAAQ,QAAQ,CAAC,sBAEzD,EACE,OAAO,WACR,CACF;EAGH,MAAM,eAAe,aAAa,WAAW,SAAS,eAAe;AAErE,MAAI,iBAAiB,KAAA,EAInB,OAAM,IAAI,aACR,aAAa,KAAK,sBAAsB,MAAM,UAAU,CAAC,IACzD,EACE,OAAO,WACR,CACF;AAGH,gBAAc,QAAQ;;AAGxB,QAAO;;;;;;;;;;;;;AAcT,SAAgB,mBAAmB,cAAc,MAAM,gBAAgB;CACrE,IAAI;CAEJ,MAAM,iBACH,mBAAmB,KAAK,gBAAgB,QAAQ,qBAAqB,KAAK,IACvE,KAAK,IACL,iBAAiB,MACd,cAAc,UAAU,KAAK,UAAU,aAAa,KACtD;AAEP,KAAI,cACF,QAAO,kBAAkB,cAAc,eAAe,eAAe;;AAIzE,SAAS,eAAe,KAAK,MAAM;AACjC,QAAO,OAAO,UAAU,eAAe,KAAK,KAAK,KAAK;;;;;;;;;;;;;ACnPxD,SAAgB,cACd,QACA,WACA,gBACA,aACA,cACA;CACA,MAAM,yBAAS,IAAI,KAAK;AACxB,mBACE,QACA,WACA,gBACA,aACA,cACA,wBACA,IAAI,KAAK,CACV;AACD,QAAO;;AAwCT,SAAS,kBACP,QACA,WACA,gBACA,aACA,cACA,QACA,sBACA;AACA,MAAK,MAAM,aAAa,aAAa,WACnC,SAAQ,UAAU,MAAlB;EACE,KAAK,KAAK,OAAO;AACf,OAAI,CAAC,kBAAkB,gBAAgB,UAAU,CAC/C;GAGF,MAAM,OAAO,iBAAiB,UAAU;GACxC,MAAM,YAAY,OAAO,IAAI,KAAK;AAElC,OAAI,cAAc,KAAA,EAChB,WAAU,KAAK,UAAU;OAEzB,QAAO,IAAI,MAAM,CAAC,UAAU,CAAC;AAG/B;;EAGF,KAAK,KAAK;AACR,OACE,CAAC,kBAAkB,gBAAgB,UAAU,IAC7C,CAAC,2BAA2B,QAAQ,WAAW,YAAY,CAE3D;AAGF,qBACE,QACA,WACA,gBACA,aACA,UAAU,cACV,QACA,qBACD;AACD;EAGF,KAAK,KAAK,iBAAiB;GACzB,MAAM,WAAW,UAAU,KAAK;AAEhC,OACE,qBAAqB,IAAI,SAAS,IAClC,CAAC,kBAAkB,gBAAgB,UAAU,CAE7C;AAGF,wBAAqB,IAAI,SAAS;GAClC,MAAM,WAAW,UAAU;AAE3B,OACE,CAAC,YACD,CAAC,2BAA2B,QAAQ,UAAU,YAAY,CAE1D;AAGF,qBACE,QACA,WACA,gBACA,aACA,SAAS,cACT,QACA,qBACD;AACD;;;;;;;;AAUR,SAAS,kBAAkB,gBAAgB,MAAM;CAC/C,MAAM,OAAO,mBAAmB,sBAAsB,MAAM,eAAe;AAE3E,MAAK,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,KAC5D,QAAO;CAGT,MAAM,UAAU,mBACd,yBACA,MACA,eACD;AAED,MACG,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,QAAQ,MAEnE,QAAO;AAGT,QAAO;;;;;AAMT,SAAS,2BAA2B,QAAQ,UAAU,MAAM;CAC1D,MAAM,oBAAoB,SAAS;AAEnC,KAAI,CAAC,kBACH,QAAO;CAGT,MAAM,kBAAkB,YAAY,QAAQ,kBAAkB;AAE9D,KAAI,oBAAoB,KACtB,QAAO;AAGT,KAAI,eAAe,gBAAgB,CACjC,QAAO,OAAO,UAAU,iBAAiB,KAAK;AAGhD,QAAO;;;;;AAMT,SAAS,iBAAiB,MAAM;AAC9B,QAAO,KAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,KAAK;;;;;;;;;;;;ACvMnD,SAAgB,6BAA6B,SAAS;AACpD,QAAO,EACL,oBAAoB,MAAM;AACxB,MAAI,KAAK,cAAc,gBAAgB;GACrC,MAAM,SAAS,QAAQ,WAAW;GAClC,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,OAAI,kBAAkB;IACpB,MAAM,gBAAgB,KAAK,OAAO,KAAK,KAAK,QAAQ;IACpD,MAAM,iBAAiB,OAAO,OAAO,KAAK;IAC1C,MAAM,WAAW,QAAQ,aAAa;IACtC,MAAM,YAAY,OAAO,OAAO,KAAK;AAErC,SAAK,MAAM,cAAc,SAAS,YAChC,KAAI,WAAW,SAAS,KAAK,oBAC3B,WAAU,WAAW,KAAK,SAAS;IAIvC,MAAM,SAAS,cACb,QACA,WACA,gBACA,kBACA,KAAK,aACN;AAED,QAAI,OAAO,OAAO,GAAG;KAGnB,MAAM,uBAFsB,CAAC,GAAG,OAAO,QAAQ,CAAC,CACK,MAAM,EAAE,CACP,MAAM;AAC5D,aAAQ,YACN,IAAI,aACF,iBAAiB,OACb,iBAAiB,cAAc,2CAC/B,gEACJ,EACE,OAAO,sBACR,CACF,CACF;;AAGH,SAAK,MAAM,cAAc,OAAO,QAAQ,CAItC,KAHc,WAAW,GACD,KAAK,MAEf,WAAW,KAAK,CAC5B,SAAQ,YACN,IAAI,aACF,iBAAiB,OACb,iBAAiB,cAAc,uDAC/B,4EACJ,EACE,OAAO,YACR,CACF,CACF;;;IAMZ;;;;;;;ACxEH,SAAgB,QAAQ,MAAM,OAAO;CACnC,MAAM,yBAAS,IAAI,KAAK;AAExB,MAAK,MAAM,QAAQ,MAAM;EACvB,MAAM,MAAM,MAAM,KAAK;EACvB,MAAM,QAAQ,OAAO,IAAI,IAAI;AAE7B,MAAI,UAAU,KAAA,EACZ,QAAO,IAAI,KAAK,CAAC,KAAK,CAAC;MAEvB,OAAM,KAAK,KAAK;;AAIpB,QAAO;;;;;;;;;;ACRT,SAAgB,kCAAkC,SAAS;AACzD,QAAO;EACL,oBAAoB,eAAe;GACjC,IAAI;;GAKJ,MAAM,iBACH,wBAAwB,cAAc,eAAe,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,UAAO,mBAAmB,IAAI,cAAc,KAAK,SAAS,cAAc;;EAG1E,yBAAyB;EACzB,wBAAwB;EACxB,sBAAsB;EACtB,qBAAqB;EACtB;CAED,SAAS,2BAA2B,UAAU;EAC5C,IAAI;EAEJ,MAAM,WAAW,SAAS,KAAK;;EAI/B,MAAM,cACH,mBAAmB,SAAS,YAAY,QACzC,qBAAqB,KAAK,IACtB,mBACA,EAAE;AAER,OAAK,MAAM,YAAY,YAAY;GACjC,IAAI;GAEJ,MAAM,YAAY,SAAS,KAAK;;GAIhC,MAAM,iBACH,sBAAsB,SAAS,eAAe,QAC/C,wBAAwB,KAAK,IACzB,sBACA,EAAE;AACR,sBAAmB,GAAG,SAAS,GAAG,aAAa,cAAc;;AAG/D,SAAO;;CAGT,SAAS,mBAAmB,YAAY,eAAe;EACrD,MAAM,WAAW,QAAQ,gBAAgB,QAAQ,IAAI,KAAK,MAAM;AAEhE,OAAK,MAAM,CAAC,SAAS,aAAa,SAChC,KAAI,SAAS,SAAS,EACpB,SAAQ,YACN,IAAI,aACF,aAAa,WAAW,GAAG,QAAQ,gCACnC,EACE,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK,EACzC,CACF,CACF;AAIL,SAAO;;;;;;;;;;;;;ACnEX,SAAgB,wBAAwB,SAAS;AAC/C,QAAO;EACL,OAAO;EACP,WAAW;EACZ;CAED,SAAS,mBAAmB,YAAY;EACtC,IAAI;EAUJ,MAAM,WAAW,SAJd,wBAAwB,WAAW,eAAe,QACnD,0BAA0B,KAAK,IAC3B,wBACA,EAAE,GACiC,QAAQ,IAAI,KAAK,MAAM;AAEhE,OAAK,MAAM,CAAC,SAAS,aAAa,SAChC,KAAI,SAAS,SAAS,EACpB,SAAQ,YACN,IAAI,aACF,yCAAyC,QAAQ,KACjD,EACE,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK,EACzC,CACF,CACF;;;;;;;;;;AChCT,SAAgB,yBAAyB,SAAS;CAChD,MAAM,sBAAsB,OAAO,OAAO,KAAK;CAC/C,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO,EACL,oBAAoB,MAAM;EACxB,MAAM,gBAAgB,KAAK,KAAK;AAEhC,MACE,WAAW,QACX,WAAW,KAAK,KAChB,OAAO,aAAa,cAAc,EAClC;AACA,WAAQ,YACN,IAAI,aACF,eAAe,cAAc,0DAC7B,EACE,OAAO,KAAK,MACb,CACF,CACF;AACD;;AAGF,MAAI,oBAAoB,eACtB,SAAQ,YACN,IAAI,aACF,2CAA2C,cAAc,KACzD,EACE,OAAO,CAAC,oBAAoB,gBAAgB,KAAK,KAAK,EACvD,CACF,CACF;MAED,qBAAoB,iBAAiB,KAAK;AAG5C,SAAO;IAEV;;;;;;;;;;;;AC7BH,SAAgB,gCAAgC,SAAS;CACvD,MAAM,qBAAqB,OAAO,OAAO,KAAK;CAC9C,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,oBAAoB,SACtB,OAAO,eAAe,GACtB;AAEJ,MAAK,MAAM,aAAa,kBACtB,oBAAmB,UAAU,QAAQ,CAAC,UAAU;CAGlD,MAAM,iBAAiB,QAAQ,aAAa,CAAC;AAE7C,MAAK,MAAM,OAAO,eAChB,KAAI,IAAI,SAAS,KAAK,qBACpB,oBAAmB,IAAI,KAAK,SAAS,CAAC,IAAI;CAI9C,MAAM,mBAAmB,OAAO,OAAO,KAAK;CAC5C,MAAM,oBAAoB,OAAO,OAAO,KAAK;AAC7C,QAAO,EAIL,MAAM,MAAM;AACV,MAAI,EAAE,gBAAgB,SAAS,CAAC,KAAK,WACnC;EAGF,IAAI;AAEJ,MACE,KAAK,SAAS,KAAK,qBACnB,KAAK,SAAS,KAAK,iBAEnB,kBAAiB;WACR,qBAAqB,KAAK,IAAI,oBAAoB,KAAK,EAAE;GAClE,MAAM,WAAW,KAAK,KAAK;AAC3B,oBAAiB,kBAAkB;AAEnC,OAAI,mBAAmB,KAAA,EACrB,mBAAkB,YAAY,iBAAiB,OAAO,OAAO,KAAK;QAGpE,kBAAiB,OAAO,OAAO,KAAK;AAGtC,OAAK,MAAM,aAAa,KAAK,YAAY;GACvC,MAAM,gBAAgB,UAAU,KAAK;AAErC,OAAI,mBAAmB,eACrB,KAAI,eAAe,eACjB,SAAQ,YACN,IAAI,aACF,mBAAmB,cAAc,4CACjC,EACE,OAAO,CAAC,eAAe,gBAAgB,UAAU,EAClD,CACF,CACF;OAED,gBAAe,iBAAiB;;IAKzC;;;;;;;;;AC3EH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,kBAAkB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC1E,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAC3C,QAAO;EACL,oBAAoB;EACpB,mBAAmB;EACpB;CAED,SAAS,qBAAqB,MAAM;EAClC,IAAI;EAEJ,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,gBAAgB,UACnB,iBAAgB,YAAY,OAAO,OAAO,KAAK;;EAKjD,MAAM,cACH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;EACR,MAAM,aAAa,gBAAgB;AAEnC,OAAK,MAAM,YAAY,YAAY;GACjC,MAAM,YAAY,SAAS,KAAK;GAChC,MAAM,eAAe,gBAAgB;AAErC,OAAI,WAAW,aAAa,IAAI,aAAa,SAAS,UAAU,CAC9D,SAAQ,YACN,IAAI,aACF,eAAe,SAAS,GAAG,UAAU,oFACrC,EACE,OAAO,SAAS,MACjB,CACF,CACF;YACQ,WAAW,WACpB,SAAQ,YACN,IAAI,aACF,eAAe,SAAS,GAAG,UAAU,8BACrC,EACE,OAAO,CAAC,WAAW,YAAY,SAAS,KAAK,EAC9C,CACF,CACF;OAED,YAAW,aAAa,SAAS;;AAIrC,SAAO;;;;;;;;;;ACjDX,SAAgB,+BAA+B,SAAS;CACtD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,kBAAkB,SAAS,OAAO,YAAY,GAAG,OAAO,OAAO,KAAK;CAC1E,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAC3C,QAAO;EACL,2BAA2B;EAC3B,0BAA0B;EAC1B,yBAAyB;EACzB,wBAAwB;EACxB,sBAAsB;EACtB,qBAAqB;EACtB;CAED,SAAS,qBAAqB,MAAM;EAClC,IAAI;EAEJ,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,CAAC,gBAAgB,UACnB,iBAAgB,YAAY,OAAO,OAAO,KAAK;;EAKjD,MAAM,cACH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;EACR,MAAM,aAAa,gBAAgB;AAEnC,OAAK,MAAM,YAAY,YAAY;GACjC,MAAM,YAAY,SAAS,KAAK;AAEhC,OAAI,SAAS,gBAAgB,WAAW,UAAU,CAChD,SAAQ,YACN,IAAI,aACF,UAAU,SAAS,GAAG,UAAU,oFAChC,EACE,OAAO,SAAS,MACjB,CACF,CACF;YACQ,WAAW,WACpB,SAAQ,YACN,IAAI,aACF,UAAU,SAAS,GAAG,UAAU,8BAChC,EACE,OAAO,CAAC,WAAW,YAAY,SAAS,KAAK,EAC9C,CACF,CACF;OAED,YAAW,aAAa,SAAS;;AAIrC,SAAO;;;AAIX,SAAS,SAAS,MAAM,WAAW;AACjC,KAAI,aAAa,KAAK,IAAI,gBAAgB,KAAK,IAAI,kBAAkB,KAAK,CACxE,QAAO,KAAK,WAAW,CAAC,cAAc;AAGxC,QAAO;;;;;;;;;;;ACpET,SAAgB,wBAAwB,SAAS;CAC/C,MAAM,qBAAqB,OAAO,OAAO,KAAK;AAC9C,QAAO;EACL,2BAA2B;EAE3B,mBAAmB,MAAM;GACvB,MAAM,eAAe,KAAK,KAAK;AAE/B,OAAI,mBAAmB,cACrB,SAAQ,YACN,IAAI,aACF,yCAAyC,aAAa,KACtD,EACE,OAAO,CAAC,mBAAmB,eAAe,KAAK,KAAK,EACrD,CACF,CACF;OAED,oBAAmB,gBAAgB,KAAK;AAG1C,UAAO;;EAEV;;;;;;;;;;;;ACrBH,SAAgB,0BAA0B,SAAS;CACjD,MAAM,iBAAiB,EAAE;CACzB,IAAI,aAAa,OAAO,OAAO,KAAK;AACpC,QAAO;EACL,aAAa;GACX,QAAQ;AACN,mBAAe,KAAK,WAAW;AAC/B,iBAAa,OAAO,OAAO,KAAK;;GAGlC,QAAQ;IACN,MAAM,iBAAiB,eAAe,KAAK;AAC3C,sBAAkB,UAAU,MAAM;AAClC,iBAAa;;GAEhB;EAED,YAAY,MAAM;GAChB,MAAM,YAAY,KAAK,KAAK;AAE5B,OAAI,WAAW,WACb,SAAQ,YACN,IAAI,aACF,4CAA4C,UAAU,KACtD,EACE,OAAO,CAAC,WAAW,YAAY,KAAK,KAAK,EAC1C,CACF,CACF;OAED,YAAW,aAAa,KAAK;;EAGlC;;;;;;;;;;;ACnCH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,sBAAsB,OAAO,OAAO,KAAK;AAC/C,QAAO;EACL,oBAAoB,MAAM;GACxB,MAAM,gBAAgB,KAAK;AAE3B,OAAI,cACF,KAAI,oBAAoB,cAAc,OACpC,SAAQ,YACN,IAAI,aACF,0CAA0C,cAAc,MAAM,KAC9D,EACE,OAAO,CACL,oBAAoB,cAAc,QAClC,cACD,EACF,CACF,CACF;OAED,qBAAoB,cAAc,SAAS;AAI/C,UAAO;;EAGT,0BAA0B;EAC3B;;;;;;;;;AC9BH,SAAgB,yBAAyB,SAAS;CAChD,MAAM,SAAS,QAAQ,WAAW;CAClC,MAAM,wBAAwB,OAAO,OAAO,KAAK;CACjD,MAAM,yBAAyB,SAC3B;EACE,OAAO,OAAO,cAAc;EAC5B,UAAU,OAAO,iBAAiB;EAClC,cAAc,OAAO,qBAAqB;EAC3C,GACD,EAAE;AACN,QAAO;EACL,kBAAkB;EAClB,iBAAiB;EAClB;CAED,SAAS,oBAAoB,MAAM;EACjC,IAAI;;EAKJ,MAAM,uBACH,uBAAuB,KAAK,oBAAoB,QACjD,yBAAyB,KAAK,IAC1B,uBACA,EAAE;AAER,OAAK,MAAM,iBAAiB,qBAAqB;GAC/C,MAAM,YAAY,cAAc;GAChC,MAAM,8BAA8B,sBAAsB;AAE1D,OAAI,uBAAuB,WACzB,SAAQ,YACN,IAAI,aACF,YAAY,UAAU,0DACtB,EACE,OAAO,eACR,CACF,CACF;YACQ,4BACT,SAAQ,YACN,IAAI,aACF,yBAAyB,UAAU,mBACnC,EACE,OAAO,CAAC,6BAA6B,cAAc,EACpD,CACF,CACF;OAED,uBAAsB,aAAa;;AAIvC,SAAO;;;;;;;;;;ACtDX,SAAgB,oBAAoB,SAAS;CAC3C,MAAM,iBAAiB,OAAO,OAAO,KAAK;CAC1C,MAAM,SAAS,QAAQ,WAAW;AAClC,QAAO;EACL,sBAAsB;EACtB,sBAAsB;EACtB,yBAAyB;EACzB,qBAAqB;EACrB,oBAAoB;EACpB,2BAA2B;EAC5B;CAED,SAAS,cAAc,MAAM;EAC3B,MAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,WAAW,QAAQ,WAAW,KAAK,KAAK,OAAO,QAAQ,SAAS,EAAE;AACpE,WAAQ,YACN,IAAI,aACF,SAAS,SAAS,qFAClB,EACE,OAAO,KAAK,MACb,CACF,CACF;AACD;;AAGF,MAAI,eAAe,UACjB,SAAQ,YACN,IAAI,aAAa,qCAAqC,SAAS,KAAK,EAClE,OAAO,CAAC,eAAe,WAAW,KAAK,KAAK,EAC7C,CAAC,CACH;MAED,gBAAe,YAAY,KAAK;AAGlC,SAAO;;;;;;;;;;ACpCX,SAAgB,wBAAwB,SAAS;AAC/C,QAAO,EACL,oBAAoB,eAAe;EACjC,IAAI;EAUJ,MAAM,0BAA0B,SAJ7B,wBAAwB,cAAc,yBAAyB,QAChE,0BAA0B,KAAK,IAC3B,wBACA,EAAE,GAGL,SAAS,KAAK,SAAS,KAAK,MAC9B;AAED,OAAK,MAAM,CAAC,cAAc,kBAAkB,wBAC1C,KAAI,cAAc,SAAS,EACzB,SAAQ,YACN,IAAI,aACF,0CAA0C,aAAa,KACvD,EACE,OAAO,cAAc,KAAK,SAAS,KAAK,SAAS,KAAK,EACvD,CACF,CACF;IAIR;;;;;;;;;;;;ACdH,SAAgB,wBAAwB,SAAS;CAC/C,IAAI,sBAAsB,EAAE;AAC5B,QAAO;EACL,qBAAqB,EACnB,QAAQ;AACN,yBAAsB,EAAE;KAE3B;EAED,mBAAmB,YAAY;AAC7B,uBAAoB,WAAW,SAAS,KAAK,SAAS;;EAGxD,UAAU,MAAM;AAKd,OAAI,CAAC,WAFQ,gBAAgB,QAAQ,oBAAoB,CAAC,CAErC,EAAE;AACrB,qBAAiB,SAAS,KAAK;AAC/B,WAAO;;;EAIX,YAAY,MAAM;GAChB,MAAM,OAAO,aAAa,QAAQ,cAAc,CAAC;AAEjD,OAAI,CAAC,kBAAkB,KAAK,EAAE;AAC5B,qBAAiB,SAAS,KAAK;AAC/B,WAAO;;GAGT,MAAM,eAAe,OAAO,KAAK,SAAS,UAAU,MAAM,KAAK,MAAM;AAErE,QAAK,MAAM,YAAY,OAAO,OAAO,KAAK,WAAW,CAAC,CAGpD,KAAI,CAFc,aAAa,SAAS,SAEtB,qBAAqB,SAAS,EAAE;IAChD,MAAM,UAAU,QAAQ,SAAS,KAAK;AACtC,YAAQ,YACN,IAAI,aACF,UAAU,KAAK,KAAK,GAAG,SAAS,KAAK,sBAAsB,QAAQ,sBACnE,EACE,OAAO,MACR,CACF,CACF;;AAIL,OAAI,KAAK,QACP,0BAAyB,SAAS,MAAM,MAAM,aAAa;;EAI/D,YAAY,MAAM;GAChB,MAAM,aAAa,aAAa,QAAQ,oBAAoB,CAAC;AAG7D,OAAI,CAFc,QAAQ,cAAc,IAEtB,kBAAkB,WAAW,EAAE;IAC/C,MAAM,cAAc,eAClB,KAAK,KAAK,OACV,OAAO,KAAK,WAAW,WAAW,CAAC,CACpC;AACD,YAAQ,YACN,IAAI,aACF,UAAU,KAAK,KAAK,MAAM,4BAA4B,WAAW,KAAK,MACpE,WAAW,YAAY,EACzB,EACE,OAAO,MACR,CACF,CACF;;;EAIL,UAAU,MAAM;GACd,MAAM,OAAO,QAAQ,cAAc;AAEnC,OAAI,cAAc,KAAK,CACrB,SAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,KAAK,CAAC,WAAW,MAAM,KAAK,CAAC,IAChE,EACE,OAAO,MACR,CACF,CACF;;EAIL,YAAY,SAAS,iBAAiB,SAAS,KAAK;EACpD,WAAW,SAAS,iBAAiB,SAAS,KAAK;EACnD,aAAa,SAAS,iBAAiB,SAAS,KAAK;EACrD,cAAc,SAAS,iBAAiB,SAAS,KAAK;EACtD,eAAe,SAAS,iBAAiB,SAAS,KAAK;EACxD;;;;;;AAOH,SAAS,iBAAiB,SAAS,MAAM;CAEvC,MAAM,eAAe,QAAQ,cAAc;AAE3C,KAAI,CAAC,aACH;CAGF,MAAM,OAAO,aAAa,aAAa;AAEvC,KAAI,CAAC,WAAW,KAAK,EAAE;EACrB,MAAM,UAAU,QAAQ,aAAa;AACrC,UAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,IAC1D,EACE,OAAO,MACR,CACF,CACF;AACD;;AAIF,KAAI;AAOF,MANoB,KAAK,aACvB,MACA,KAAA,EAED,KAEmB,KAAA,GAAW;GAC7B,MAAM,UAAU,QAAQ,aAAa;AACrC,WAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,IAC1D,EACE,OAAO,MACR,CACF,CACF;;UAEI,OAAO;EACd,MAAM,UAAU,QAAQ,aAAa;AAErC,MAAI,iBAAiB,aACnB,SAAQ,YAAY,MAAM;MAE1B,SAAQ,YACN,IAAI,aACF,2BAA2B,QAAQ,WAAW,MAAM,KAAK,CAAC,MACxD,MAAM,SACR;GACE,OAAO;GACP,eAAe;GAChB,CACF,CACF;;;AAKP,SAAS,yBAAyB,SAAS,MAAM,MAAM,cAAc;CACnE,IAAI;CAEJ,MAAM,OAAO,OAAO,KAAK,aAAa;AAGtC,KAF6B,KAAK,WAAW,GAEnB;AACxB,UAAQ,YACN,IAAI,aACF,uBAAuB,KAAK,KAAK,kCACjC,EACE,OAAO,CAAC,KAAK,EACd,CACF,CACF;AACD;;CAGF,MAAM,SACH,sBAAsB,aAAa,KAAK,SAAS,QAClD,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB;AAG1B,KAFsB,CAAC,SAAS,MAAM,SAAS,KAAK,KAGlD,SAAQ,YACN,IAAI,aAAa,UAAU,KAAK,KAAK,GAAG,KAAK,GAAG,sBAAsB,EACpE,OAAO,CAAC,KAAK,EACd,CAAC,CACH;;;;;;;;;;;;AC/ML,SAAgB,2BAA2B,SAAS;AAClD,QAAO,EACL,mBAAmB,MAAM;EACvB,MAAM,OAAO,YAAY,QAAQ,WAAW,EAAE,KAAK,KAAK;AAExD,MAAI,SAAS,KAAA,KAAa,CAAC,YAAY,KAAK,EAAE;GAC5C,MAAM,eAAe,KAAK,SAAS,KAAK;GACxC,MAAM,WAAW,MAAM,KAAK,KAAK;AACjC,WAAQ,YACN,IAAI,aACF,cAAc,aAAa,8BAA8B,SAAS,KAClE,EACE,OAAO,KAAK,MACb,CACF,CACF;;IAGN;;;;;;;;;;;ACbH,SAAgB,+BAA+B,SAAS;CACtD,IAAI,YAAY,OAAO,OAAO,KAAK;AACnC,QAAO;EACL,qBAAqB;GACnB,QAAQ;AACN,gBAAY,OAAO,OAAO,KAAK;;GAGjC,MAAM,WAAW;IACf,MAAM,SAAS,QAAQ,2BAA2B,UAAU;AAE5D,SAAK,MAAM,EAAE,MAAM,MAAM,cAAc,gBAAgB,QAAQ;KAC7D,MAAM,UAAU,KAAK,KAAK;KAC1B,MAAM,SAAS,UAAU;AAEzB,SAAI,UAAU,MAAM;MAMlB,MAAM,SAAS,QAAQ,WAAW;MAClC,MAAM,UAAU,YAAY,QAAQ,OAAO,KAAK;AAEhD,UACE,WACA,CAAC,qBACC,QACA,SACA,OAAO,cACP,MACA,aACD,EACD;OACA,MAAM,aAAa,QAAQ,QAAQ;OACnC,MAAM,UAAU,QAAQ,KAAK;AAC7B,eAAQ,YACN,IAAI,aACF,cAAc,QAAQ,aAAa,WAAW,qCAAqC,QAAQ,KAC3F,EACE,OAAO,CAAC,QAAQ,KAAK,EACtB,CACF,CACF;;AAGH,UACE,kBAAkB,WAAW,IAC7B,WAAW,WACX,eAAe,QAAQ,CAEvB,SAAQ,YACN,IAAI,aACF,cAAc,QAAQ,gBAAgB,QAAQ,gEAAgE,WAAW,KACzH,EACE,OAAO,CAAC,QAAQ,KAAK,EACtB,CACF,CACF;;;;GAKV;EAED,mBAAmB,MAAM;AACvB,aAAU,KAAK,SAAS,KAAK,SAAS;;EAEzC;;;;;;;AAQH,SAAS,qBACP,QACA,SACA,iBACA,cACA,sBACA;AACA,KAAI,cAAc,aAAa,IAAI,CAAC,cAAc,QAAQ,EAAE;AAK1D,MAAI,EAHF,mBAAmB,QAAQ,gBAAgB,SAAS,KAAK,SAGpB,EAFP,yBAAyB,KAAA,GAGvD,QAAO;EAGT,MAAM,uBAAuB,aAAa;AAC1C,SAAO,gBAAgB,QAAQ,SAAS,qBAAqB;;AAG/D,QAAO,gBAAgB,QAAQ,SAAS,aAAa;;;;;;;;ACxCvD,MAAa,mBAAmB,OAAO,OAAO,CAAC,0BAA0B,CAAC;;;;;;;AAQ1E,MAAa,iBAAiB,OAAO,OAAO;CAC1C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,GAAG;CACJ,CAAC;;;;AAKF,MAAa,oBAAoB,OAAO,OAAO;CAC7C;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;;;;;;;;AC1HF,IAAa,uBAAb,MAAkC;CAChC,YAAY,KAAK,SAAS;AACxB,OAAK,OAAO;AACZ,OAAK,aAAa,KAAA;AAClB,OAAK,mCAAmB,IAAI,KAAK;AACjC,OAAK,kDAAkC,IAAI,KAAK;AAChD,OAAK,WAAW;;CAGlB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY,OAAO;AACjB,OAAK,SAAS,MAAM;;CAGtB,cAAc;AACZ,SAAO,KAAK;;CAGd,YAAY,MAAM;EAChB,IAAI;AAEJ,MAAI,KAAK,WACP,aAAY,KAAK;OACZ;AACL,eAAY,OAAO,OAAO,KAAK;AAE/B,QAAK,MAAM,WAAW,KAAK,aAAa,CAAC,YACvC,KAAI,QAAQ,SAAS,KAAK,oBACxB,WAAU,QAAQ,KAAK,SAAS;AAIpC,QAAK,aAAa;;AAGpB,SAAO,UAAU;;CAGnB,mBAAmB,MAAM;EACvB,IAAI,UAAU,KAAK,iBAAiB,IAAI,KAAK;AAE7C,MAAI,CAAC,SAAS;AACZ,aAAU,EAAE;GACZ,MAAM,cAAc,CAAC,KAAK;GAC1B,IAAI;AAEJ,UAAQ,MAAM,YAAY,KAAK,CAC7B,MAAK,MAAM,aAAa,IAAI,WAC1B,KAAI,UAAU,SAAS,KAAK,gBAC1B,SAAQ,KAAK,UAAU;YACd,UAAU,aACnB,aAAY,KAAK,UAAU,aAAa;AAK9C,QAAK,iBAAiB,IAAI,MAAM,QAAQ;;AAG1C,SAAO;;CAGT,kCAAkC,WAAW;EAC3C,IAAI,YAAY,KAAK,gCAAgC,IAAI,UAAU;AAEnE,MAAI,CAAC,WAAW;AACd,eAAY,EAAE;GACd,MAAM,iBAAiB,OAAO,OAAO,KAAK;GAC1C,MAAM,eAAe,CAAC,UAAU,aAAa;GAC7C,IAAI;AAEJ,UAAQ,OAAO,aAAa,KAAK,CAC/B,MAAK,MAAM,UAAU,KAAK,mBAAmB,KAAK,EAAE;IAClD,MAAM,WAAW,OAAO,KAAK;AAE7B,QAAI,eAAe,cAAc,MAAM;AACrC,oBAAe,YAAY;KAC3B,MAAM,WAAW,KAAK,YAAY,SAAS;AAE3C,SAAI,UAAU;AACZ,gBAAU,KAAK,SAAS;AACxB,mBAAa,KAAK,SAAS,aAAa;;;;AAMhD,QAAK,gCAAgC,IAAI,WAAW,UAAU;;AAGhE,SAAO;;;AAGX,IAAa,uBAAb,cAA0C,qBAAqB;CAC7D,YAAY,KAAK,QAAQ,SAAS;AAChC,QAAM,KAAK,QAAQ;AACnB,OAAK,UAAU;;CAGjB,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,SAAO,KAAK;;;AAGhB,IAAa,oBAAb,cAAuC,qBAAqB;CAC1D,YAAY,QAAQ,KAAK,UAAU,SAAS;AAC1C,QAAM,KAAK,QAAQ;AACnB,OAAK,UAAU;AACf,OAAK,YAAY;AACjB,OAAK,kCAAkB,IAAI,KAAK;AAChC,OAAK,2CAA2B,IAAI,KAAK;;CAG3C,KAAK,OAAO,eAAe;AACzB,SAAO;;CAGT,YAAY;AACV,SAAO,KAAK;;CAGd,kBAAkB,MAAM;EACtB,IAAI,SAAS,KAAK,gBAAgB,IAAI,KAAK;AAE3C,MAAI,CAAC,QAAQ;GACX,MAAM,YAAY,EAAE;GACpB,MAAM,WAAW,IAAI,SAAS,KAAK,QAAQ;AAC3C,SACE,MACA,kBAAkB,UAAU;IAC1B,0BAA0B;IAE1B,SAAS,UAAU;AACjB,eAAU,KAAK;MACb,MAAM;MACN,MAAM,SAAS,cAAc;MAC7B,cAAc,SAAS,iBAAiB;MACxC,YAAY,SAAS,oBAAoB;MAC1C,CAAC;;IAEL,CAAC,CACH;AACD,YAAS;AAET,QAAK,gBAAgB,IAAI,MAAM,OAAO;;AAGxC,SAAO;;CAGT,2BAA2B,WAAW;EACpC,IAAI,SAAS,KAAK,yBAAyB,IAAI,UAAU;AAEzD,MAAI,CAAC,QAAQ;AACX,YAAS,KAAK,kBAAkB,UAAU;AAE1C,QAAK,MAAM,QAAQ,KAAK,kCAAkC,UAAU,CAClE,UAAS,OAAO,OAAO,KAAK,kBAAkB,KAAK,CAAC;AAGtD,QAAK,yBAAyB,IAAI,WAAW,OAAO;;AAGtD,SAAO;;CAGT,UAAU;AACR,SAAO,KAAK,UAAU,SAAS;;CAGjC,gBAAgB;AACd,SAAO,KAAK,UAAU,eAAe;;CAGvC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;CAGtC,qBAAqB;AACnB,SAAO,KAAK,UAAU,oBAAoB;;CAG5C,cAAc;AACZ,SAAO,KAAK,UAAU,aAAa;;CAGrC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;CAGtC,cAAc;AACZ,SAAO,KAAK,UAAU,aAAa;;CAGrC,eAAe;AACb,SAAO,KAAK,UAAU,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;ACnLxC,SAAgB,SACd,QACA,aACA,QAAQ,gBACR,SAEA,WAAW,IAAI,SAAS,OAAO,EAC/B;CACA,IAAI;CAEJ,MAAM,aACH,qBACC,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,eAC1D,QAAQ,uBAAuB,KAAK,IAClC,qBACA;AACN,gBAAe,UAAU,OAAO,yBAAyB;AAEzD,mBAAkB,OAAO;CACzB,MAAM,WAAW,OAAO,OAAO,EAAE,CAAC;CAClC,MAAM,SAAS,EAAE;CACjB,MAAM,UAAU,IAAI,kBAClB,QACA,aACA,WACC,UAAU;AACT,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAO,KACL,IAAI,aACF,uEACD,CACF;AAED,SAAM;;AAGR,SAAO,KAAK,MAAM;GAErB;CAGD,MAAM,UAAU,gBAAgB,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC,CAAC;AAEnE,KAAI;AACF,QAAM,aAAa,kBAAkB,UAAU,QAAQ,CAAC;UACjD,GAAG;AACV,MAAI,MAAM,SACR,OAAM;;AAIV,QAAO;;;;;AAMT,SAAgB,YACd,aACA,gBACA,QAAQ,mBACR;CACA,MAAM,SAAS,EAAE;CACjB,MAAM,UAAU,IAAI,qBAClB,aACA,iBACC,UAAU;AACT,SAAO,KAAK,MAAM;GAErB;AAED,OAAM,aAAa,gBADF,MAAM,KAAK,SAAS,KAAK,QAAQ,CAAC,CACP,CAAC;AAC7C,QAAO;;;;;;;;AAST,SAAgB,eAAe,aAAa;CAC1C,MAAM,SAAS,YAAY,YAAY;AAEvC,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,MAAM,OAAO,KAAK,UAAU,MAAM,QAAQ,CAAC,KAAK,OAAO,CAAC;;;;;;;AChCtE,SAAgB,iBAAiB,cAAc,aAAa,SAAS;CACnE,IAAI,YAAY,uBAAuB,aAAa;CAGpD,MAAM,WAAW,EAAE;CACnB,MAAM,oBAAoB,OAAO,OAAO,KAAK;CAG7C,MAAM,gBAAgB,EAAE;CACxB,IAAI;CAEJ,MAAM,mBAAmB,EAAE;AAE3B,MAAK,MAAM,OAAO,YAAY,YAC5B,KAAI,IAAI,SAAS,KAAK,kBACpB,aAAY;UACH,IAAI,SAAS,KAAK,iBAC3B,kBAAiB,KAAK,IAAI;UACjB,qBAAqB,IAAI,CAClC,UAAS,KAAK,IAAI;UACT,oBAAoB,IAAI,EAAE;EACnC,MAAM,mBAAmB,IAAI,KAAK;EAClC,MAAM,yBAAyB,kBAAkB;AACjD,oBAAkB,oBAAoB,yBAClC,uBAAuB,OAAO,CAAC,IAAI,CAAC,GACpC,CAAC,IAAI;YACA,IAAI,SAAS,KAAK,qBAC3B,eAAc,KAAK,IAAI;AAK3B,KACE,OAAO,KAAK,kBAAkB,CAAC,WAAW,KAC1C,SAAS,WAAW,KACpB,cAAc,WAAW,KACzB,iBAAiB,WAAW,KAC5B,aAAa,KAEb,QAAO;CAGT,MAAM,UAAU,OAAO,OAAO,KAAK;AAEnC,MAAK,MAAM,gBAAgB,aAAa,MACtC,SAAQ,aAAa,QAAQ,gBAAgB,aAAa;AAG5D,MAAK,MAAM,YAAY,UAAU;EAC/B,IAAI;EAEJ,MAAM,OAAO,SAAS,KAAK;AAC3B,UAAQ,SACL,mBAAmB,WAAW,WAAW,QAC1C,qBAAqB,KAAK,IACtB,mBACA,UAAU,SAAS;;CAG3B,MAAM,iBAAiB;EAErB,OAAO,aAAa,SAAS,iBAAiB,aAAa,MAAM;EACjE,UAAU,aAAa,YAAY,iBAAiB,aAAa,SAAS;EAC1E,cACE,aAAa,gBAAgB,iBAAiB,aAAa,aAAa;EAE1E,GAAI,aAAa,kBAAkB,CAAC,UAAU,CAAC;EAC/C,GAAG,kBAAkB,iBAAiB;EACvC;AAED,QAAO;EACL,cACG,aAAa,eAAe,QAAQ,eAAe,KAAK,IACrD,KAAK,KACJ,wBAAwB,WAAW,iBAAiB,QACrD,0BAA0B,KAAK,IAC/B,KAAK,IACL,sBAAsB;EAC5B,GAAG;EACH,OAAO,OAAO,OAAO,QAAQ;EAC7B,YAAY,CACV,GAAG,aAAa,WAAW,IAAI,iBAAiB,EAChD,GAAG,cAAc,IAAI,eAAe,CACrC;EACD,YAAY,OAAO,OAAO,KAAK;EAC/B,UACG,cAAc,eAAe,QAAQ,gBAAgB,KAAK,IACvD,cACA,aAAa;EACnB,mBAAmB,aAAa,kBAAkB,OAAO,iBAAiB;EAC1E,cACG,uBACC,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ,iBAAiB,QAAQ,yBAAyB,KAAK,IACjE,uBACA;EACP;CAGD,SAAS,YAAY,MAAM;AACzB,MAAI,WAAW,KAAK,CAElB,QAAO,IAAI,YAAY,YAAY,KAAK,OAAO,CAAC;AAGlD,MAAI,cAAc,KAAK,CAErB,QAAO,IAAI,eAAe,YAAY,KAAK,OAAO,CAAC;AAGrD,SAAO,iBAAiB,KAAK;;CAG/B,SAAS,iBAAiB,MAAM;AAI9B,SAAO,QAAQ,KAAK;;CAGtB,SAAS,iBAAiB,WAAW;EACnC,MAAM,SAAS,UAAU,UAAU;AACnC,SAAO,IAAI,iBAAiB;GAC1B,GAAG;GACH,MAAM,SAAS,OAAO,MAAM,UAAU;GACvC,CAAC;;CAGJ,SAAS,gBAAgB,MAAM;AAC7B,MAAI,oBAAoB,KAAK,IAAI,sBAAsB,KAAK,CAE1D,QAAO;AAGT,MAAI,aAAa,KAAK,CACpB,QAAO,iBAAiB,KAAK;AAG/B,MAAI,aAAa,KAAK,CACpB,QAAO,iBAAiB,KAAK;AAG/B,MAAI,gBAAgB,KAAK,CACvB,QAAO,oBAAoB,KAAK;AAGlC,MAAI,YAAY,KAAK,CACnB,QAAO,gBAAgB,KAAK;AAG9B,MAAI,WAAW,KAAK,CAClB,QAAO,eAAe,KAAK;AAG7B,MAAI,kBAAkB,KAAK,CACzB,QAAO,sBAAsB,KAAK;;AAK3B,YAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;CAGhE,SAAS,sBAAsB,MAAM;EACnC,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,wBAAwB,kBAAkB,OAAO,WAAW,QAC7D,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,IAAI,uBAAuB;GAChC,GAAG;GACH,eAAe;IACb,GAAG,SAAS,OAAO,SAAS,WAAW;KACrC,GAAG;KACH,MAAM,YAAY,MAAM,KAAK;KAC9B,EAAE;IACH,GAAG,mBAAmB,WAAW;IAClC;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,eAAe,MAAM;EAC5B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,wBAAwB,kBAAkB,KAAK,WAAW,QAC3D,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AACR,SAAO,IAAI,gBAAgB;GACzB,GAAG;GACH,QAAQ;IAAE,GAAG,OAAO;IAAQ,GAAG,kBAAkB,WAAW;IAAE;GAC9D,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,iBAAiB,MAAM;EAC9B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;EACR,IAAI,iBAAiB,OAAO;AAE5B,OAAK,MAAM,iBAAiB,YAAY;GACtC,IAAI;AAEJ,qBACG,qBAAqB,kBAAkB,cAAc,MAAM,QAC5D,uBAAuB,KAAK,IACxB,qBACA;;AAGR,SAAO,IAAI,kBAAkB;GAC3B,GAAG;GACH;GACA,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,iBAAiB,MAAM;EAC9B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,kBAAkB;GAC3B,GAAG;GACH,kBAAkB,CAChB,GAAG,KAAK,eAAe,CAAC,IAAI,iBAAiB,EAC7C,GAAG,gBAAgB,WAAW,CAC/B;GACD,eAAe;IACb,GAAG,SAAS,OAAO,QAAQ,YAAY;IACvC,GAAG,cAAc,WAAW;IAC7B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,oBAAoB,MAAM;EACjC,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,qBAAqB;GAC9B,GAAG;GACH,kBAAkB,CAChB,GAAG,KAAK,eAAe,CAAC,IAAI,iBAAiB,EAC7C,GAAG,gBAAgB,WAAW,CAC/B;GACD,eAAe;IACb,GAAG,SAAS,OAAO,QAAQ,YAAY;IACvC,GAAG,cAAc,WAAW;IAC7B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,gBAAgB,MAAM;EAC7B,IAAI;EAEJ,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,cACH,yBAAyB,kBAAkB,OAAO,WAAW,QAC9D,2BAA2B,KAAK,IAC5B,yBACA,EAAE;AACR,SAAO,IAAI,iBAAiB;GAC1B,GAAG;GACH,aAAa,CACX,GAAG,KAAK,UAAU,CAAC,IAAI,iBAAiB,EACxC,GAAG,gBAAgB,WAAW,CAC/B;GACD,mBAAmB,OAAO,kBAAkB,OAAO,WAAW;GAC/D,CAAC;;CAGJ,SAAS,YAAY,OAAO;AAC1B,SAAO;GACL,GAAG;GACH,MAAM,YAAY,MAAM,KAAK;GAC7B,MAAM,MAAM,QAAQ,SAAS,MAAM,MAAM,UAAU;GACpD;;CAGH,SAAS,UAAU,KAAK;AACtB,SAAO;GAAE,GAAG;GAAK,MAAM,YAAY,IAAI,KAAK;GAAE;;CAGhD,SAAS,kBAAkB,OAAO;EAChC,MAAM,UAAU,EAAE;AAElB,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,uBAEH,uBAAuB,KAAK,oBAAoB,QACjD,yBAAyB,KAAK,IAC1B,uBACA,EAAE;AAER,QAAK,MAAM,iBAAiB,oBAK1B,SAAQ,cAAc,aAAa,aAAa,cAAc,KAAK;;AAIvE,SAAO;;CAGT,SAAS,aAAa,MAAM;EAC1B,IAAI;EAEJ,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,QACH,oBAAoB,WAAW,WAAW,QAC3C,sBAAsB,KAAK,IACvB,oBACA,QAAQ;AAEd,MAAI,SAAS,KAAA,EACX,OAAM,IAAI,MAAM,kBAAkB,KAAK,IAAI;AAG7C,SAAO;;CAGT,SAAS,eAAe,MAAM;AAC5B,MAAI,KAAK,SAAS,KAAK,UACrB,QAAO,IAAI,YAAY,eAAe,KAAK,KAAK,CAAC;AAGnD,MAAI,KAAK,SAAS,KAAK,cACrB,QAAO,IAAI,eAAe,eAAe,KAAK,KAAK,CAAC;AAGtD,SAAO,aAAa,KAAK;;CAG3B,SAAS,eAAe,MAAM;EAC5B,IAAI;AAEJ,SAAO,IAAI,iBAAiB;GAC1B,MAAM,KAAK,KAAK;GAChB,cACG,oBAAoB,KAAK,iBAAiB,QAC3C,sBAAsB,KAAK,IACvB,KAAK,IACL,kBAAkB;GAExB,WAAW,KAAK,UAAU,KAAK,EAAE,YAAY,MAAM;GACnD,cAAc,KAAK;GACnB,MAAM,iBAAiB,KAAK,UAAU;GACtC,SAAS;GACV,CAAC;;CAGJ,SAAS,cAAc,OAAO;EAC5B,MAAM,iBAAiB,OAAO,OAAO,KAAK;AAE1C,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,cAEH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AAER,QAAK,MAAM,SAAS,YAAY;IAC9B,IAAI;AAEJ,mBAAe,MAAM,KAAK,SAAS;KAIjC,MAAM,eAAe,MAAM,KAAK;KAChC,cACG,qBAAqB,MAAM,iBAAiB,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB;KACzB,MAAM,iBAAiB,MAAM,UAAU;KACvC,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,iBAAiB,MAAM;EAE9B,MAAM,YAEJ,SAAS,QAAQ,SAAS,KAAK,IAAI,OAAO,EAAE;EAC9C,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,OAAK,MAAM,OAAO,WAAW;GAC3B,IAAI;GAKJ,MAAM,OAAO,eAAe,IAAI,KAAK;AACrC,gBAAa,IAAI,KAAK,SAAS;IAC7B;IACA,cACG,mBAAmB,IAAI,iBAAiB,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB;IACvB,cAAc,aAAa,IAAI,cAAc,KAAK;IAClD,mBAAmB,qBAAqB,IAAI;IAC5C,SAAS;IACV;;AAGH,SAAO;;CAGT,SAAS,mBAAmB,OAAO;EACjC,MAAM,gBAAgB,OAAO,OAAO,KAAK;AAEzC,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,eAEH,gBAAgB,KAAK,YAAY,QAAQ,kBAAkB,KAAK,IAC7D,gBACA,EAAE;AAER,QAAK,MAAM,SAAS,aAAa;IAC/B,IAAI;IAKJ,MAAM,OAAO,eAAe,MAAM,KAAK;AACvC,kBAAc,MAAM,KAAK,SAAS;KAChC;KACA,cACG,sBAAsB,MAAM,iBAAiB,QAC9C,wBAAwB,KAAK,IACzB,KAAK,IACL,oBAAoB;KAC1B,cAAc,aAAa,MAAM,cAAc,KAAK;KACpD,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,kBAAkB,OAAO;EAChC,MAAM,eAAe,OAAO,OAAO,KAAK;AAExC,OAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GAGJ,MAAM,eAEH,eAAe,KAAK,YAAY,QAAQ,iBAAiB,KAAK,IAC3D,eACA,EAAE;AAER,QAAK,MAAM,SAAS,aAAa;IAC/B,IAAI;AAEJ,iBAAa,MAAM,KAAK,SAAS;KAC/B,cACG,qBAAqB,MAAM,iBAAiB,QAC7C,uBAAuB,KAAK,IACxB,KAAK,IACL,mBAAmB;KACzB,mBAAmB,qBAAqB,MAAM;KAC9C,SAAS;KACV;;;AAIL,SAAO;;CAGT,SAAS,gBAAgB,OAAO;AAK9B,SAAO,MAAM,SAEV,SAAS;GACR,IAAI,sBAAsB;AAE1B,WAEG,wBACE,mBAAmB,KAAK,gBAAgB,QACzC,qBAAqB,KAAK,IACtB,KAAK,IACL,iBAAiB,IAAI,aAAa,MAAM,QAC5C,yBAAyB,KAAK,IAC5B,uBACA,EAAE;IAGX;;CAGH,SAAS,gBAAgB,OAAO;AAK9B,SAAO,MAAM,SAEV,SAAS;GACR,IAAI,iBAAiB;AAErB,WAEG,mBACE,cAAc,KAAK,WAAW,QAAQ,gBAAgB,KAAK,IACxD,KAAK,IACL,YAAY,IAAI,aAAa,MAAM,QACvC,oBAAoB,KAAK,IACvB,kBACA,EAAE;IAGX;;CAGH,SAAS,UAAU,SAAS;EAC1B,IAAI;EAEJ,MAAM,OAAO,QAAQ,KAAK;EAC1B,MAAM,qBACH,wBAAwB,kBAAkB,WAAW,QACtD,0BAA0B,KAAK,IAC3B,wBACA,EAAE;AAER,UAAQ,QAAQ,MAAhB;GACE,KAAK,KAAK,wBAAwB;IAChC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,kBAAkB;KAC3B;KACA,cACG,uBAAuB,QAAQ,iBAAiB,QACjD,yBAAyB,KAAK,IAC1B,KAAK,IACL,qBAAqB;KAC3B,kBAAkB,gBAAgB,SAAS;KAC3C,cAAc,cAAc,SAAS;KACrC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,2BAA2B;IACnC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,qBAAqB;KAC9B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,kBAAkB,gBAAgB,SAAS;KAC3C,cAAc,cAAc,SAAS;KACrC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,sBAAsB;IAC9B,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,gBAAgB;KACzB;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,QAAQ,kBAAkB,SAAS;KACnC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK,uBAAuB;IAC/B,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,iBAAiB;KAC1B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,aAAa,gBAAgB,SAAS;KACtC;KACA;KACD,CAAC;;GAGJ,KAAK,KAAK;IACR,IAAI;AAEJ,WAAO,IAAI,kBAAkB;KAC3B;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,gBAAgB,kBAAkB,QAAQ;KAC1C;KACA;KACD,CAAC;GAGJ,KAAK,KAAK,8BAA8B;IACtC,IAAI;IAEJ,MAAM,WAAW,CAAC,SAAS,GAAG,kBAAkB;AAChD,WAAO,IAAI,uBAAuB;KAChC;KACA,cACG,wBAAwB,QAAQ,iBAAiB,QAClD,0BAA0B,KAAK,IAC3B,KAAK,IACL,sBAAsB;KAC5B,cAAc,mBAAmB,SAAS;KAC1C;KACA;KACA,SAAS,QAAQ,QAAQ;KAC1B,CAAC;;;;;AAKV,MAAM,aAAa,OACjB,CAAC,GAAG,sBAAsB,GAAG,mBAAmB,GAC/C,SAAS,KAAK,KAChB;;;;;AAMD,SAAS,qBAAqB,MAAM;CAClC,MAAM,aAAa,mBAAmB,4BAA4B,KAAK;AAEvE,QAAO,eAAe,QAAQ,eAAe,KAAK,IAC9C,KAAK,IACL,WAAW;;;;;AAMjB,SAAS,kBAAkB,MAAM;CAC/B,MAAM,cAAc,mBAAmB,6BAA6B,KAAK;AAEzE,QAAO,gBAAgB,QAAQ,gBAAgB,KAAK,IAChD,KAAK,IACL,YAAY;;;;;AAMlB,SAAS,QAAQ,MAAM;AACrB,QAAO,QAAQ,mBAAmB,uBAAuB,KAAK,CAAC;;;;;;;;;;;;;;AC1wBjE,SAAgB,eAAe,aAAa,SAAS;AAClD,gBAAe,QAAQ,YAAY,SAAS,KAAK,YAChD,UAAU,OAAO,mCAAmC;AAEtD,MACG,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,iBACzD,SACD,YAAY,QAAQ,YAAY,KAAK,IAClC,KAAK,IACL,QAAQ,oBAAoB,KAEhC,gBAAe,YAAY;CAW7B,MAAM,SAAS,iBARW;EACxB,aAAa,KAAA;EACb,OAAO,EAAE;EACT,YAAY,EAAE;EACd,YAAY,OAAO,OAAO,KAAK;EAC/B,mBAAmB,EAAE;EACrB,aAAa;EACd,EACkD,aAAa,QAAQ;AAExE,KAAI,OAAO,WAAW,KACpB,MAAK,MAAM,QAAQ,OAAO,MACxB,SAAQ,KAAK,MAAb;EAIE,KAAK;AAEH,UAAO,QAAQ;AACf;EAEF,KAAK;AAEH,UAAO,WAAW;AAClB;EAEF,KAAK;AAEH,UAAO,eAAe;AACtB;;CAKR,MAAM,aAAa,CACjB,GAAG,OAAO,YACV,GAAG,oBAAoB,QAAQ,iBAC7B,OAAO,WAAW,OACf,cAAc,UAAU,SAAS,aAAa,KAChD,CACF,CACF;AACD,QAAO,IAAI,cAAc;EAAE,GAAG;EAAQ;EAAY,CAAC;;;;;;AAOrD,SAAgB,YAAY,QAAQ,SAAS;AAS3C,QAAO,eARU,MAAM,QAAQ;EAC7B,YACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC5D,8BACE,YAAY,QAAQ,YAAY,KAAK,IACjC,KAAK,IACL,QAAQ;EACf,CAAC,EAC8B;EAC9B,gBACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC5D,aACE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ;EAC7D,CAAC;;;;AC3EJ,SAAgB,YAAY,QAAQ;AAClC,QAAO,oBACL,SACC,MAAM,CAAC,qBAAqB,EAAE,EAC/B,cACD;;AAMH,SAAS,cAAc,MAAM;AAC3B,QAAO,CAAC,sBAAsB,KAAK,IAAI,CAAC,oBAAoB,KAAK;;AAGnE,SAAS,oBAAoB,QAAQ,iBAAiB,YAAY;CAChE,MAAM,aAAa,OAAO,eAAe,CAAC,OAAO,gBAAgB;CACjE,MAAM,QAAQ,OAAO,OAAO,OAAO,YAAY,CAAC,CAAC,OAAO,WAAW;AACnE,QAAO;EACL,sBAAsB,OAAO;EAC7B,GAAG,WAAW,KAAK,cAAc,eAAe,UAAU,CAAC;EAC3D,GAAG,MAAM,KAAK,SAAS,UAAU,KAAK,CAAC;EACxC,CACE,OAAO,QAAQ,CACf,KAAK,OAAO;;AAGjB,SAAS,sBAAsB,QAAQ;AACrC,KAAI,OAAO,eAAe,QAAQ,sBAAsB,OAAO,CAC7D;CAGF,MAAM,iBAAiB,EAAE;CACzB,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,UACF,gBAAe,KAAK,YAAY,UAAU,OAAO;CAGnD,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,aACF,gBAAe,KAAK,eAAe,aAAa,OAAO;CAGzD,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,iBACF,gBAAe,KAAK,mBAAmB,iBAAiB,OAAO;AAGjE,QAAO,iBAAiB,OAAO,GAAG,aAAa,eAAe,KAAK,KAAK,CAAC;;;;;;;;;;;;;;;;;AAkB3E,SAAS,sBAAsB,QAAQ;CACrC,MAAM,YAAY,OAAO,cAAc;AAEvC,KAAI,aAAa,UAAU,SAAS,QAClC,QAAO;CAGT,MAAM,eAAe,OAAO,iBAAiB;AAE7C,KAAI,gBAAgB,aAAa,SAAS,WACxC,QAAO;CAGT,MAAM,mBAAmB,OAAO,qBAAqB;AAErD,KAAI,oBAAoB,iBAAiB,SAAS,eAChD,QAAO;AAGT,QAAO;;AAGT,SAAgB,UAAU,MAAM;AAC9B,KAAI,aAAa,KAAK,CACpB,QAAO,YAAY,KAAK;AAG1B,KAAI,aAAa,KAAK,CACpB,QAAO,YAAY,KAAK;AAG1B,KAAI,gBAAgB,KAAK,CACvB,QAAO,eAAe,KAAK;AAG7B,KAAI,YAAY,KAAK,CACnB,QAAO,WAAW,KAAK;AAGzB,KAAI,WAAW,KAAK,CAClB,QAAO,UAAU,KAAK;AAGxB,KAAI,kBAAkB,KAAK,CACzB,QAAO,iBAAiB,KAAK;;AAKtB,WAAU,OAAO,sBAAsB,QAAQ,KAAK,CAAC;;AAGhE,SAAS,YAAY,MAAM;AACzB,QACE,iBAAiB,KAAK,GAAG,UAAU,KAAK,SAAS,oBAAoB,KAAK;;AAI9E,SAAS,2BAA2B,MAAM;CACxC,MAAM,aAAa,KAAK,eAAe;AACvC,QAAO,WAAW,SACd,iBAAiB,WAAW,KAAK,MAAM,EAAE,KAAK,CAAC,KAAK,MAAM,GAC1D;;AAGN,SAAS,YAAY,MAAM;AACzB,QACE,iBAAiB,KAAK,GACtB,QAAQ,KAAK,SACb,2BAA2B,KAAK,GAChC,YAAY,KAAK;;AAIrB,SAAS,eAAe,MAAM;AAC5B,QACE,iBAAiB,KAAK,GACtB,aAAa,KAAK,SAClB,2BAA2B,KAAK,GAChC,YAAY,KAAK;;AAIrB,SAAS,WAAW,MAAM;CACxB,MAAM,QAAQ,KAAK,UAAU;CAC7B,MAAM,gBAAgB,MAAM,SAAS,QAAQ,MAAM,KAAK,MAAM,GAAG;AACjE,QAAO,iBAAiB,KAAK,GAAG,WAAW,KAAK,OAAO;;AAGzD,SAAS,UAAU,MAAM;CACvB,MAAM,SAAS,KACZ,WAAW,CACX,KACE,OAAO,MACN,iBAAiB,OAAO,MAAM,CAAC,EAAE,GACjC,OACA,MAAM,OACN,gBAAgB,MAAM,kBAAkB,CAC3C;AACH,QAAO,iBAAiB,KAAK,GAAG,QAAQ,KAAK,SAAS,WAAW,OAAO;;AAG1E,SAAS,iBAAiB,MAAM;CAC9B,MAAM,SAAS,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,KAC5C,GAAG,MAAM,iBAAiB,GAAG,MAAM,CAAC,EAAE,GAAG,OAAO,gBAAgB,EAAE,CACpE;AACD,QACE,iBAAiB,KAAK,GACtB,SAAS,KAAK,UACb,KAAK,UAAU,YAAY,MAC5B,WAAW,OAAO;;AAItB,SAAS,YAAY,MAAM;AAWzB,QAAO,WAVQ,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,KAC5C,GAAG,MACF,iBAAiB,GAAG,MAAM,CAAC,EAAE,GAC7B,OACA,EAAE,OACF,UAAU,EAAE,MAAM,KAAK,GACvB,OACA,OAAO,EAAE,KAAK,GACd,gBAAgB,EAAE,kBAAkB,CACvC,CACwB;;AAG3B,SAAS,WAAW,OAAO;AACzB,QAAO,MAAM,WAAW,IAAI,SAAS,MAAM,KAAK,KAAK,GAAG,QAAQ;;AAGlE,SAAS,UAAU,MAAM,cAAc,IAAI;AACzC,KAAI,KAAK,WAAW,EAClB,QAAO;AAGT,KAAI,KAAK,OAAO,QAAQ,CAAC,IAAI,YAAY,CACvC,QAAO,MAAM,KAAK,IAAI,gBAAgB,CAAC,KAAK,KAAK,GAAG;AAGtD,QACE,QACA,KACG,KACE,KAAK,MACJ,iBAAiB,KAAK,OAAO,aAAa,CAAC,EAAE,GAC7C,OACA,cACA,gBAAgB,IAAI,CACvB,CACA,KAAK,KAAK,GACb,OACA,cACA;;AAIJ,SAAS,gBAAgB,KAAK;CAC5B,MAAM,aAAa,aAAa,IAAI,cAAc,IAAI,KAAK;CAC3D,IAAI,UAAU,IAAI,OAAO,OAAO,OAAO,IAAI,KAAK;AAEhD,KAAI,WACF,YAAW,MAAM,MAAM,WAAW;AAGpC,QAAO,UAAU,gBAAgB,IAAI,kBAAkB;;AAGzD,SAAS,eAAe,WAAW;AACjC,QACE,iBAAiB,UAAU,GAC3B,gBACA,UAAU,OACV,UAAU,UAAU,KAAK,IACxB,UAAU,eAAe,gBAAgB,MAC1C,SACA,UAAU,UAAU,KAAK,MAAM;;AAInC,SAAS,gBAAgB,QAAQ;AAC/B,KAAI,UAAU,KACZ,QAAO;AAGT,KAAI,WAAA,sBAKF,QAAO,wBAJU,MAAM;EACrB,MAAM,KAAK;EACX,OAAO;EACR,CAAC,CACsC;AAG1C,QAAO;;AAGT,SAAS,oBAAoB,QAAQ;AACnC,KAAI,OAAO,kBAAkB,KAC3B,QAAO;AAOT,QAAO,sBAJU,MAAM;EACrB,MAAM,KAAK;EACX,OAAO,OAAO;EACf,CAAC,CACoC;;AAGxC,SAAS,iBAAiB,KAAK,cAAc,IAAI,eAAe,MAAM;CACpE,MAAM,EAAE,gBAAgB;AAExB,KAAI,eAAe,KACjB,QAAO;CAGT,MAAM,cAAc,MAAM;EACxB,MAAM,KAAK;EACX,OAAO;EACP,OAAO,yBAAyB,YAAY;EAC7C,CAAC;AAGF,SADE,eAAe,CAAC,eAAe,OAAO,cAAc,eACtC,YAAY,QAAQ,OAAO,OAAO,YAAY,GAAG;;;;;;;;;;;;ACtTnE,MAAaA,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU,CAAC,UAAU;CAC3B,OAAOC,QAAU,CAAC,QAAQ;CAC7B,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,oBAAoB,UAAU;AAChC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,yBAAyB,KAAK,UAAU,MAAM,GAAG;CAE5E,MAAM,SAASJ,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaK,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,aAAa,UAAU,MAAM,SAAS,KAAK,OAC3C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,MAC9C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAMN,SAAO,iBAJO;GACV,MAAM,WAAW,OAAO;GACxB,OAAO,WAAW,WAAW,MAAM,MAAM;GAC5C,CAC6B;;CAErC;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;;AC5CnD,MAAaE,wBAAsB;AACnC,MAAaC,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOA,QAAU;CACpB,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,0BAA0B,UAAU;AACtC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,gCAAgC,KAAK,UAAU,MAAM,GAAG;CAEnF,MAAM,SAASH,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,OAC9C,OAAM,IAAI,aAAa,sCAAsC,EACzD,OAAO,KACV,CAAC;AAEN,MAAI,CAACP,sBAAoB,KAAK,WAAW,MAAM,MAAM,CACjD,OAAM,IAAI,aAAa,sEAAkE,EACrF,OAAO,KACV,CAAC;AAMN,SAAO,uBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,MAAM;GAC3B,CACmC;;CAE3C;AACD,MAAaQ,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;;AClDnD,MAAa,sBAAsB;AACnC,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOA,QAAU;CACpB,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,4BAA4B,UAAU;AACxC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,kCAAkC,KAAK,UAAU,MAAM,GAAG;CAErF,MAAM,SAASH,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,OAC9C,OAAM,IAAI,aAAa,sCAAsC,EACzD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,oBAAoB,KAAK,WAAW,MAAM,MAAM,CACjD,OAAM,IAAI,aAAa,sEAAkE,EACrF,OAAO,KACV,CAAC;AAMN,SAAO,yBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,MAAM;GAC3B,CACqC;;CAE7C;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AClDnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,OAAS;CAC3B,MAAMC,QAAU;CAChB,OAAOC,QAAU,CAAC,QAAQ;CAC7B,CAAC;AACF,MAAaC,kBAAe;AAC5B,MAAM,wBAAwB,UAAU;AACpC,KAAI,OAAO,UAAU,YAAY,CAAC,MAC9B,OAAM,IAAI,aAAa,8BAA8B,KAAK,UAAU,MAAM,GAAG;CAEjF,MAAM,SAASJ,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaK,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,QAAQ;AACnB,MAAI,IAAI,SAAS,KAAK,OAClB,OAAM,IAAI,aAAa,2BAA2B,EAAE,OAAO,KAAK,CAAC;EAErE,MAAM,YAAY,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,OAAO;EACjE,MAAM,aAAa,IAAI,OAAO,MAAM,MAAM,EAAE,KAAK,UAAU,QAAQ;AACnE,MAAI,CAAC,aAAa,UAAU,MAAM,SAAS,KAAK,OAC5C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAEN,MAAI,CAAC,cAAc,WAAW,MAAM,SAAS,KAAK,MAC9C,OAAM,IAAI,aAAa,qCAAqC,EACxD,OAAO,KACV,CAAC;AAMN,SAAO,qBAJO;GACV,MAAM,UAAU,MAAM;GACtB,OAAO,WAAW,WAAW,MAAM,MAAM;GAC5C,CACiC;;CAEzC;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC5CnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,yBAAyB,UAAU;AACrC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,6BAA6B,EAChD,OAAO,OACV,CAAC;AAGN,SAAO,sBADa,WAAW,MAAM,MAAM,CACF;;CAEhD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC/BnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,YAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,8BAA8B,UAAU;AAC1C,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,UAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAGlE,SAAO,2BADa,WAAW,MAAM,MAAM,CACG;;CAErD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC7BnD,MAAaE,UAAO;AACpB,MAAaC,aAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,kBAAe;AAC5B,MAAM,0BAA0B,UAAU;AACtC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;AAE3E,KAAI,CAAC,OAAO,SAAS,MAAM,CACvB,OAAM,IAAI,aAAa,iCAAiC,QAAQ;CAEpE,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,YAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,MACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAGlE,SAAO,uBADa,WAAW,MAAM,MAAM,CACD;;CAEjD;AACD,MAAaC,YAAS,IAAI,kBAAkBD,UAAO;;;;;;;;;;;AC7BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,sBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,mBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,UAAgB;AACtC,MAAaC,iBAAe;AAC5B,MAAMC,wBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAASH,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaI,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAWD;CACX,YAAYA;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAOA,qBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaE,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,UAAgB;AACtC,MAAaC,iBAAe;AAC5B,MAAM,sBAAsB,UAAU;AAClC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAO,mBAAmB,MAAM,MAAM;;CAE7C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,OAAS;AAC/B,MAAaC,iBAAe;AAC5B,MAAM,mBAAmB,UAAU;AAC/B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,2DAA2D,MAAM,QAAQ,EAAE,OAAO,OAAO,CAAC;AAErH,SAAO,gBAAgB,MAAM,MAAM;;CAE1C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;ACzBnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU,CAAC,MAAM,uBAAuB,EAC1D,SAAS,mCACZ,CAAC;AACF,MAAaC,iBAAe;AAC5B,MAAM,qBAAqB,UAAU;AACjC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,sBAAsB,EAAE,OAAO,OAAO,CAAC;AAElE,SAAO,kBAAkB,MAAM,MAAM;;CAE5C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,iBAAiB,UAAU;AAC7B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,cAAc,MAAM,MAAM;;CAExC;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,oBAAoB,UAAU;AAChC,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,iBAAiB,MAAM,MAAM;;CAE3C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAaC,WAASC,QAAU;AAChC,MAAaC,iBAAe;AAC5B,MAAM,mBAAmB,UAAU;AAC/B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,wBAAwB,KAAK,UAAU,MAAM,GAAG;CAE3E,MAAM,SAASF,SAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaG,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,gCAAgC,MAAM,QAAQ,EACjE,OAAO,OACV,CAAC;AAEN,SAAO,gBAAgB,MAAM,MAAM;;CAE1C;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;AC3BnD,MAAaE,SAAO;AACpB,MAAaC,YAAU;AACvB,MAAa,SAASC,KAAO;AAC7B,MAAaC,iBAAe;AAC5B,MAAM,iBAAiB,UAAU;AAC7B,KAAI,OAAO,UAAU,SACjB,OAAM,IAAI,aAAa,4BAA4B,KAAK,UAAU,MAAM,GAAG;CAE/E,MAAM,SAAS,OAAO,UAAU,MAAM;AACtC,KAAI,OAAO,QACP,QAAO,OAAO;AAClB,OAAM,IAAI,aAAa,OAAO,MAAM,QAAQ;;AAEhD,MAAaC,WAAS;CAClB,MAAM;CACN,aAAa;CACb,WAAW;CACX,YAAY;CACZ,eAAe,UAAU;AACrB,MAAI,MAAM,SAAS,KAAK,OACpB,OAAM,IAAI,aAAa,0BAA0B,EAAE,OAAO,OAAO,CAAC;AAEtE,SAAO,cAAc,MAAM,MAAM;;CAExC;AACD,MAAaC,WAAS,IAAI,kBAAkBD,SAAO;;;;;;;;;;;;;;ACbnD,IAAqB,SAArB,MAA4B;CAC1B,cAAc;;;;;;AAMZ,OAAK,UAAU,IAAI,SAAS,SAAS,WAAW;;;;;;AAM9C,QAAK,WAAW,SAAS;;;;;;;AAOvB,SAAK,OAAO;AAEZ,YAAQ,KAAK;;;;;;;AAQf,QAAK,SAAS;IACd;AAIF,OAAK,QAAQ,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACsBhC,MAAM,gBAAgB,IAAI,kBAAkB;CAC1C,MAAM;CACN,aAAa;CACb,WAAW,OAAO;AAChB,MAAI,iBAAiB,OAAQ,QAAO,MAAM;AAC1C,QAAM,IAAI,aAAa,wBAAwB;;CAEjD,aAAa,MAAM;AACjB,QAAM,IAAI,aAAa,+BAA+B,EAAE,OAAO,MAAM,CAAC;;CAExE,YAAY;AACV,QAAM,IAAI,aAAa,oCAAoC;;CAE9D,CAAC;;;;;;;;;;ACnFF,MAAa,OAAO;AACpB,MAAa,UAAU;AACvB,MAAa,SAAS;CAClB,MAAM;CACN,aAAa;CAChB;AAED,MAAa,eAAe;AAC5B,MAAa,SAAS;;;ACYtB,MAAa,gBAAgB;CAEzB,QAAA;CAEA,cAAA;CAEA,gBAAA;CAEA,YAAA;CACA,aAAA;CACA,kBAAA;CACA,cAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,cAAA;CACA,iBAAA;CAEA,MAAA;CACA,KAAA;CACA,QAAA;CACA,MAAA;CACA,WAAA;CACH;AAqBD,MAAa,WAAW;CAEpBmB;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACAC;CACH;UAGwB,eACG,eACH,gBACI,eACN,eACF,eACC,gBACE,eACL,eACE,eACJ,eACD,gBACO,gBACI,gBACF,gBACN,aACF;UAIQ,eACG,eACH,gBACI,eACN,eACF,eACC,gBACE,eACL,eACE,eACJ,eACD,gBACO,gBACI,gBACF,gBACN,aACF;;;ACxHjB,MAAa,wBAAwB;;;;AAKrC,MAAa,cAAc,SAAS,KAAK,KAAK;AAK9C,MAAa,mBAAmB,YADH,YAFG,GAAG,sBAAsB,IAAI,cAEH,CACA;AAS1D,MAAa,gBAAgB"}