@launchdarkly/o11y 1.2.0 → 1.3.1

package/dist/assets/highlight-client-worker-DsbKMpxq.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"highlight-client-worker-DsbKMpxq.js","sources":["../../../../node_modules/graphql-request/build/esm/defaultJsonSerializer.js","../../../../node_modules/graphql-request/build/esm/helpers.js","../../../../node_modules/graphql-request/build/esm/parseArgs.js","../../../../node_modules/graphql/jsutils/devAssert.mjs","../../../../node_modules/graphql/jsutils/isObjectLike.mjs","../../../../node_modules/graphql/jsutils/invariant.mjs","../../../../node_modules/graphql/language/location.mjs","../../../../node_modules/graphql/language/printLocation.mjs","../../../../node_modules/graphql/error/GraphQLError.mjs","../../../../node_modules/graphql/error/syntaxError.mjs","../../../../node_modules/graphql/language/ast.mjs","../../../../node_modules/graphql/language/directiveLocation.mjs","../../../../node_modules/graphql/language/kinds.mjs","../../../../node_modules/graphql/language/characterClasses.mjs","../../../../node_modules/graphql/language/blockString.mjs","../../../../node_modules/graphql/language/tokenKind.mjs","../../../../node_modules/graphql/language/lexer.mjs","../../../../node_modules/graphql/jsutils/inspect.mjs","../../../../node_modules/graphql/jsutils/instanceOf.mjs","../../../../node_modules/graphql/language/source.mjs","../../../../node_modules/graphql/language/parser.mjs","../../../../node_modules/graphql/language/printString.mjs","../../../../node_modules/graphql/language/visitor.mjs","../../../../node_modules/graphql/language/printer.mjs","../../../../node_modules/graphql-request/build/esm/resolveRequestDocument.js","../../../../node_modules/graphql-request/build/esm/types.js","../../../../node_modules/cross-fetch/dist/browser-ponyfill.js","../../../../node_modules/graphql-request/build/esm/index.js","../../../../node_modules/json-stringify-safe/stringify.js","../src/client/constants/sessions.ts","../../../../node_modules/tslib/tslib.es6.mjs","../../../../node_modules/graphql-tag/lib/index.js","../src/client/graph/generated/operations.ts","../../../../node_modules/fflate/esm/browser.js","../src/client/utils/payload.ts","../src/client/logger.ts","../src/client/graph/generated/schemas.ts","../src/client/utils/graph.ts","../src/client/workers/constants.ts","../src/client/workers/types.ts","../src/client/workers/highlight-client-worker.ts"],"sourcesContent":["export const defaultJsonSerializer = JSON;\n//# sourceMappingURL=defaultJsonSerializer.js.map","export const uppercase = (str) => str.toUpperCase();\n/**\n * Convert Headers instance into regular object\n */\nexport const HeadersInstanceToPlainObject = (headers) => {\n    const o = {};\n    headers.forEach((v, k) => {\n        o[k] = v;\n    });\n    return o;\n};\n//# sourceMappingURL=helpers.js.map","export const parseRequestArgs = (documentOrOptions, variables, requestHeaders) => {\n    return documentOrOptions.document\n        ? documentOrOptions\n        : {\n            document: documentOrOptions,\n            variables: variables,\n            requestHeaders: requestHeaders,\n            signal: undefined,\n        };\n};\nexport const parseRawRequestArgs = (queryOrOptions, variables, requestHeaders) => {\n    return queryOrOptions.query\n        ? queryOrOptions\n        : {\n            query: queryOrOptions,\n            variables: variables,\n            requestHeaders: requestHeaders,\n            signal: undefined,\n        };\n};\nexport const parseBatchRequestArgs = (documentsOrOptions, requestHeaders) => {\n    return documentsOrOptions.documents\n        ? documentsOrOptions\n        : {\n            documents: documentsOrOptions,\n            requestHeaders: requestHeaders,\n            signal: undefined,\n        };\n};\nexport const parseRequestExtendedArgs = (urlOrOptions, document, ...variablesAndRequestHeaders) => {\n    const [variables, requestHeaders] = variablesAndRequestHeaders;\n    return urlOrOptions.document\n        ? urlOrOptions\n        : {\n            url: urlOrOptions,\n            document: document,\n            variables,\n            requestHeaders,\n            signal: undefined,\n        };\n};\nexport const parseRawRequestExtendedArgs = (urlOrOptions, query, ...variablesAndRequestHeaders) => {\n    const [variables, requestHeaders] = variablesAndRequestHeaders;\n    return urlOrOptions.query\n        ? urlOrOptions\n        : {\n            url: urlOrOptions,\n            query: query,\n            variables,\n            requestHeaders,\n            signal: undefined,\n        };\n};\n//# sourceMappingURL=parseArgs.js.map","export function devAssert(condition, message) {\n  const booleanCondition = Boolean(condition);\n\n  if (!booleanCondition) {\n    throw new Error(message);\n  }\n}\n","/**\n * Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n */\nexport function isObjectLike(value) {\n  return typeof value == 'object' && value !== null;\n}\n","export function invariant(condition, message) {\n  const booleanCondition = Boolean(condition);\n\n  if (!booleanCondition) {\n    throw new Error(\n      message != null ? message : 'Unexpected invariant triggered.',\n    );\n  }\n}\n","import { invariant } from '../jsutils/invariant.mjs';\nconst LineRegExp = /\\r\\n|[\\n\\r]/g;\n/**\n * Represents a location in a Source.\n */\n\n/**\n * Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n */\nexport function getLocation(source, position) {\n  let lastLineStart = 0;\n  let line = 1;\n\n  for (const match of source.body.matchAll(LineRegExp)) {\n    typeof match.index === 'number' || invariant(false);\n\n    if (match.index >= position) {\n      break;\n    }\n\n    lastLineStart = match.index + match[0].length;\n    line += 1;\n  }\n\n  return {\n    line,\n    column: position + 1 - lastLineStart,\n  };\n}\n","import { getLocation } from './location.mjs';\n\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\nexport function printLocation(location) {\n  return printSourceLocation(\n    location.source,\n    getLocation(location.source, location.start),\n  );\n}\n/**\n * Render a helpful description of the location in the GraphQL Source document.\n */\n\nexport function printSourceLocation(source, sourceLocation) {\n  const firstLineColumnOffset = source.locationOffset.column - 1;\n  const body = ''.padStart(firstLineColumnOffset) + source.body;\n  const lineIndex = sourceLocation.line - 1;\n  const lineOffset = source.locationOffset.line - 1;\n  const lineNum = sourceLocation.line + lineOffset;\n  const columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n  const columnNum = sourceLocation.column + columnOffset;\n  const locationStr = `${source.name}:${lineNum}:${columnNum}\\n`;\n  const lines = body.split(/\\r\\n|[\\n\\r]/g);\n  const locationLine = lines[lineIndex]; // Special case for minified documents\n\n  if (locationLine.length > 120) {\n    const subLineIndex = Math.floor(columnNum / 80);\n    const subLineColumnNum = columnNum % 80;\n    const subLines = [];\n\n    for (let i = 0; i < locationLine.length; i += 80) {\n      subLines.push(locationLine.slice(i, i + 80));\n    }\n\n    return (\n      locationStr +\n      printPrefixedLines([\n        [`${lineNum} |`, subLines[0]],\n        ...subLines.slice(1, subLineIndex + 1).map((subLine) => ['|', subLine]),\n        ['|', '^'.padStart(subLineColumnNum)],\n        ['|', subLines[subLineIndex + 1]],\n      ])\n    );\n  }\n\n  return (\n    locationStr +\n    printPrefixedLines([\n      // Lines specified like this: [\"prefix\", \"string\"],\n      [`${lineNum - 1} |`, lines[lineIndex - 1]],\n      [`${lineNum} |`, locationLine],\n      ['|', '^'.padStart(columnNum)],\n      [`${lineNum + 1} |`, lines[lineIndex + 1]],\n    ])\n  );\n}\n\nfunction printPrefixedLines(lines) {\n  const existingLines = lines.filter(([_, line]) => line !== undefined);\n  const padLen = Math.max(...existingLines.map(([prefix]) => prefix.length));\n  return existingLines\n    .map(([prefix, line]) => prefix.padStart(padLen) + (line ? ' ' + line : ''))\n    .join('\\n');\n}\n","import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n  printLocation,\n  printSourceLocation,\n} from '../language/printLocation.mjs';\n\nfunction toNormalizedOptions(args) {\n  const firstArg = args[0];\n\n  if (firstArg == null || 'kind' in firstArg || 'length' in firstArg) {\n    return {\n      nodes: firstArg,\n      source: args[1],\n      positions: args[2],\n      path: args[3],\n      originalError: args[4],\n      extensions: args[5],\n    };\n  }\n\n  return firstArg;\n}\n/**\n * A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n */\n\nexport class GraphQLError extends Error {\n  /**\n   * An array of `{ line, column }` locations within the source GraphQL document\n   * which correspond to this error.\n   *\n   * Errors during validation often contain multiple locations, for example to\n   * point out two things with the same name. Errors during execution include a\n   * single location, the field which produced the error.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array describing the JSON-path into the execution response which\n   * corresponds to this error. Only included for errors during execution.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array of GraphQL AST Nodes corresponding to this error.\n   */\n\n  /**\n   * The source GraphQL document for the first location of this error.\n   *\n   * Note that if this Error represents more than one node, the source may not\n   * represent nodes after the first node.\n   */\n\n  /**\n   * An array of character offsets within the source GraphQL document\n   * which correspond to this error.\n   */\n\n  /**\n   * The original error thrown from a field resolver during execution.\n   */\n\n  /**\n   * Extension fields to add to the formatted error.\n   */\n\n  /**\n   * @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.\n   */\n  constructor(message, ...rawArgs) {\n    var _this$nodes, _nodeLocations$, _ref;\n\n    const { nodes, source, positions, path, originalError, extensions } =\n      toNormalizedOptions(rawArgs);\n    super(message);\n    this.name = 'GraphQLError';\n    this.path = path !== null && path !== void 0 ? path : undefined;\n    this.originalError =\n      originalError !== null && originalError !== void 0\n        ? originalError\n        : undefined; // Compute list of blame nodes.\n\n    this.nodes = undefinedIfEmpty(\n      Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n    );\n    const nodeLocations = undefinedIfEmpty(\n      (_this$nodes = this.nodes) === null || _this$nodes === void 0\n        ? void 0\n        : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n    ); // Compute locations in the source for the given nodes/positions.\n\n    this.source =\n      source !== null && source !== void 0\n        ? source\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : (_nodeLocations$ = nodeLocations[0]) === null ||\n          _nodeLocations$ === void 0\n        ? void 0\n        : _nodeLocations$.source;\n    this.positions =\n      positions !== null && positions !== void 0\n        ? positions\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => loc.start);\n    this.locations =\n      positions && source\n        ? positions.map((pos) => getLocation(source, pos))\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n    const originalExtensions = isObjectLike(\n      originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions,\n    )\n      ? originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions\n      : undefined;\n    this.extensions =\n      (_ref =\n        extensions !== null && extensions !== void 0\n          ? extensions\n          : originalExtensions) !== null && _ref !== void 0\n        ? _ref\n        : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n    // Keep the rest as non-enumerable.\n\n    Object.defineProperties(this, {\n      message: {\n        writable: true,\n        enumerable: true,\n      },\n      name: {\n        enumerable: false,\n      },\n      nodes: {\n        enumerable: false,\n      },\n      source: {\n        enumerable: false,\n      },\n      positions: {\n        enumerable: false,\n      },\n      originalError: {\n        enumerable: false,\n      },\n    }); // Include (non-enumerable) stack trace.\n\n    /* c8 ignore start */\n    // FIXME: https://github.com/graphql/graphql-js/issues/2317\n\n    if (\n      originalError !== null &&\n      originalError !== void 0 &&\n      originalError.stack\n    ) {\n      Object.defineProperty(this, 'stack', {\n        value: originalError.stack,\n        writable: true,\n        configurable: true,\n      });\n    } else if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, GraphQLError);\n    } else {\n      Object.defineProperty(this, 'stack', {\n        value: Error().stack,\n        writable: true,\n        configurable: true,\n      });\n    }\n    /* c8 ignore stop */\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLError';\n  }\n\n  toString() {\n    let output = this.message;\n\n    if (this.nodes) {\n      for (const node of this.nodes) {\n        if (node.loc) {\n          output += '\\n\\n' + printLocation(node.loc);\n        }\n      }\n    } else if (this.source && this.locations) {\n      for (const location of this.locations) {\n        output += '\\n\\n' + printSourceLocation(this.source, location);\n      }\n    }\n\n    return output;\n  }\n\n  toJSON() {\n    const formattedError = {\n      message: this.message,\n    };\n\n    if (this.locations != null) {\n      formattedError.locations = this.locations;\n    }\n\n    if (this.path != null) {\n      formattedError.path = this.path;\n    }\n\n    if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n      formattedError.extensions = this.extensions;\n    }\n\n    return formattedError;\n  }\n}\n\nfunction undefinedIfEmpty(array) {\n  return array === undefined || array.length === 0 ? undefined : array;\n}\n/**\n * See: https://spec.graphql.org/draft/#sec-Errors\n */\n\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n *\n * @deprecated Please use `error.toString` instead. Will be removed in v17\n */\nexport function printError(error) {\n  return error.toString();\n}\n/**\n * Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n *\n * @deprecated Please use `error.toJSON` instead. Will be removed in v17\n */\n\nexport function formatError(error) {\n  return error.toJSON();\n}\n","import { GraphQLError } from './GraphQLError.mjs';\n/**\n * Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n */\n\nexport function syntaxError(source, position, description) {\n  return new GraphQLError(`Syntax Error: ${description}`, {\n    source,\n    positions: [position],\n  });\n}\n","/**\n * Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n */\nexport class Location {\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The Token at which this Node begins.\n   */\n\n  /**\n   * The Token at which this Node ends.\n   */\n\n  /**\n   * The Source document the AST represents.\n   */\n  constructor(startToken, endToken, source) {\n    this.start = startToken.start;\n    this.end = endToken.end;\n    this.startToken = startToken;\n    this.endToken = endToken;\n    this.source = source;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Location';\n  }\n\n  toJSON() {\n    return {\n      start: this.start,\n      end: this.end,\n    };\n  }\n}\n/**\n * Represents a range of characters represented by a lexical token\n * within a Source.\n */\n\nexport class Token {\n  /**\n   * The kind of Token.\n   */\n\n  /**\n   * The character offset at which this Node begins.\n   */\n\n  /**\n   * The character offset at which this Node ends.\n   */\n\n  /**\n   * The 1-indexed line number on which this Token appears.\n   */\n\n  /**\n   * The 1-indexed column number at which this Token begins.\n   */\n\n  /**\n   * For non-punctuation tokens, represents the interpreted value of the token.\n   *\n   * Note: is undefined for punctuation tokens, but typed as string for\n   * convenience in the parser.\n   */\n\n  /**\n   * Tokens exist as nodes in a double-linked-list amongst all tokens\n   * including ignored tokens. <SOF> is always the first node and <EOF>\n   * the last.\n   */\n  constructor(kind, start, end, line, column, value) {\n    this.kind = kind;\n    this.start = start;\n    this.end = end;\n    this.line = line;\n    this.column = column; // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\n    this.value = value;\n    this.prev = null;\n    this.next = null;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Token';\n  }\n\n  toJSON() {\n    return {\n      kind: this.kind,\n      value: this.value,\n      line: this.line,\n      column: this.column,\n    };\n  }\n}\n/**\n * The list of all possible AST node types.\n */\n\n/**\n * @internal\n */\nexport const QueryDocumentKeys = {\n  Name: [],\n  Document: ['definitions'],\n  OperationDefinition: [\n    'name',\n    'variableDefinitions',\n    'directives',\n    'selectionSet',\n  ],\n  VariableDefinition: ['variable', 'type', 'defaultValue', 'directives'],\n  Variable: ['name'],\n  SelectionSet: ['selections'],\n  Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n  Argument: ['name', 'value'],\n  FragmentSpread: ['name', 'directives'],\n  InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n  FragmentDefinition: [\n    'name', // Note: fragment variable definitions are deprecated and will removed in v17.0.0\n    'variableDefinitions',\n    'typeCondition',\n    'directives',\n    'selectionSet',\n  ],\n  IntValue: [],\n  FloatValue: [],\n  StringValue: [],\n  BooleanValue: [],\n  NullValue: [],\n  EnumValue: [],\n  ListValue: ['values'],\n  ObjectValue: ['fields'],\n  ObjectField: ['name', 'value'],\n  Directive: ['name', 'arguments'],\n  NamedType: ['name'],\n  ListType: ['type'],\n  NonNullType: ['type'],\n  SchemaDefinition: ['description', 'directives', 'operationTypes'],\n  OperationTypeDefinition: ['type'],\n  ScalarTypeDefinition: ['description', 'name', 'directives'],\n  ObjectTypeDefinition: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\n  FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n  InputValueDefinition: [\n    'description',\n    'name',\n    'type',\n    'defaultValue',\n    'directives',\n  ],\n  InterfaceTypeDefinition: [\n    'description',\n    'name',\n    'interfaces',\n    'directives',\n    'fields',\n  ],\n  UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n  EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n  EnumValueDefinition: ['description', 'name', 'directives'],\n  InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n  DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n  SchemaExtension: ['directives', 'operationTypes'],\n  ScalarTypeExtension: ['name', 'directives'],\n  ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n  UnionTypeExtension: ['name', 'directives', 'types'],\n  EnumTypeExtension: ['name', 'directives', 'values'],\n  InputObjectTypeExtension: ['name', 'directives', 'fields'],\n};\nconst kindValues = new Set(Object.keys(QueryDocumentKeys));\n/**\n * @internal\n */\n\nexport function isNode(maybeNode) {\n  const maybeKind =\n    maybeNode === null || maybeNode === void 0 ? void 0 : maybeNode.kind;\n  return typeof maybeKind === 'string' && kindValues.has(maybeKind);\n}\n/** Name */\n\nvar OperationTypeNode;\n\n(function (OperationTypeNode) {\n  OperationTypeNode['QUERY'] = 'query';\n  OperationTypeNode['MUTATION'] = 'mutation';\n  OperationTypeNode['SUBSCRIPTION'] = 'subscription';\n})(OperationTypeNode || (OperationTypeNode = {}));\n\nexport { OperationTypeNode };\n","/**\n * The set of allowed directive location values.\n */\nvar DirectiveLocation;\n\n(function (DirectiveLocation) {\n  DirectiveLocation['QUERY'] = 'QUERY';\n  DirectiveLocation['MUTATION'] = 'MUTATION';\n  DirectiveLocation['SUBSCRIPTION'] = 'SUBSCRIPTION';\n  DirectiveLocation['FIELD'] = 'FIELD';\n  DirectiveLocation['FRAGMENT_DEFINITION'] = 'FRAGMENT_DEFINITION';\n  DirectiveLocation['FRAGMENT_SPREAD'] = 'FRAGMENT_SPREAD';\n  DirectiveLocation['INLINE_FRAGMENT'] = 'INLINE_FRAGMENT';\n  DirectiveLocation['VARIABLE_DEFINITION'] = 'VARIABLE_DEFINITION';\n  DirectiveLocation['SCHEMA'] = 'SCHEMA';\n  DirectiveLocation['SCALAR'] = 'SCALAR';\n  DirectiveLocation['OBJECT'] = 'OBJECT';\n  DirectiveLocation['FIELD_DEFINITION'] = 'FIELD_DEFINITION';\n  DirectiveLocation['ARGUMENT_DEFINITION'] = 'ARGUMENT_DEFINITION';\n  DirectiveLocation['INTERFACE'] = 'INTERFACE';\n  DirectiveLocation['UNION'] = 'UNION';\n  DirectiveLocation['ENUM'] = 'ENUM';\n  DirectiveLocation['ENUM_VALUE'] = 'ENUM_VALUE';\n  DirectiveLocation['INPUT_OBJECT'] = 'INPUT_OBJECT';\n  DirectiveLocation['INPUT_FIELD_DEFINITION'] = 'INPUT_FIELD_DEFINITION';\n})(DirectiveLocation || (DirectiveLocation = {}));\n\nexport { DirectiveLocation };\n/**\n * The enum type representing the directive location values.\n *\n * @deprecated Please use `DirectiveLocation`. Will be remove in v17.\n */\n","/**\n * The set of allowed kind values for AST nodes.\n */\nvar Kind;\n\n(function (Kind) {\n  Kind['NAME'] = 'Name';\n  Kind['DOCUMENT'] = 'Document';\n  Kind['OPERATION_DEFINITION'] = 'OperationDefinition';\n  Kind['VARIABLE_DEFINITION'] = 'VariableDefinition';\n  Kind['SELECTION_SET'] = 'SelectionSet';\n  Kind['FIELD'] = 'Field';\n  Kind['ARGUMENT'] = 'Argument';\n  Kind['FRAGMENT_SPREAD'] = 'FragmentSpread';\n  Kind['INLINE_FRAGMENT'] = 'InlineFragment';\n  Kind['FRAGMENT_DEFINITION'] = 'FragmentDefinition';\n  Kind['VARIABLE'] = 'Variable';\n  Kind['INT'] = 'IntValue';\n  Kind['FLOAT'] = 'FloatValue';\n  Kind['STRING'] = 'StringValue';\n  Kind['BOOLEAN'] = 'BooleanValue';\n  Kind['NULL'] = 'NullValue';\n  Kind['ENUM'] = 'EnumValue';\n  Kind['LIST'] = 'ListValue';\n  Kind['OBJECT'] = 'ObjectValue';\n  Kind['OBJECT_FIELD'] = 'ObjectField';\n  Kind['DIRECTIVE'] = 'Directive';\n  Kind['NAMED_TYPE'] = 'NamedType';\n  Kind['LIST_TYPE'] = 'ListType';\n  Kind['NON_NULL_TYPE'] = 'NonNullType';\n  Kind['SCHEMA_DEFINITION'] = 'SchemaDefinition';\n  Kind['OPERATION_TYPE_DEFINITION'] = 'OperationTypeDefinition';\n  Kind['SCALAR_TYPE_DEFINITION'] = 'ScalarTypeDefinition';\n  Kind['OBJECT_TYPE_DEFINITION'] = 'ObjectTypeDefinition';\n  Kind['FIELD_DEFINITION'] = 'FieldDefinition';\n  Kind['INPUT_VALUE_DEFINITION'] = 'InputValueDefinition';\n  Kind['INTERFACE_TYPE_DEFINITION'] = 'InterfaceTypeDefinition';\n  Kind['UNION_TYPE_DEFINITION'] = 'UnionTypeDefinition';\n  Kind['ENUM_TYPE_DEFINITION'] = 'EnumTypeDefinition';\n  Kind['ENUM_VALUE_DEFINITION'] = 'EnumValueDefinition';\n  Kind['INPUT_OBJECT_TYPE_DEFINITION'] = 'InputObjectTypeDefinition';\n  Kind['DIRECTIVE_DEFINITION'] = 'DirectiveDefinition';\n  Kind['SCHEMA_EXTENSION'] = 'SchemaExtension';\n  Kind['SCALAR_TYPE_EXTENSION'] = 'ScalarTypeExtension';\n  Kind['OBJECT_TYPE_EXTENSION'] = 'ObjectTypeExtension';\n  Kind['INTERFACE_TYPE_EXTENSION'] = 'InterfaceTypeExtension';\n  Kind['UNION_TYPE_EXTENSION'] = 'UnionTypeExtension';\n  Kind['ENUM_TYPE_EXTENSION'] = 'EnumTypeExtension';\n  Kind['INPUT_OBJECT_TYPE_EXTENSION'] = 'InputObjectTypeExtension';\n})(Kind || (Kind = {}));\n\nexport { Kind };\n/**\n * The enum type representing the possible kind values of AST nodes.\n *\n * @deprecated Please use `Kind`. Will be remove in v17.\n */\n","/**\n * ```\n * WhiteSpace ::\n *   - \"Horizontal Tab (U+0009)\"\n *   - \"Space (U+0020)\"\n * ```\n * @internal\n */\nexport function isWhiteSpace(code) {\n  return code === 0x0009 || code === 0x0020;\n}\n/**\n * ```\n * Digit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * ```\n * @internal\n */\n\nexport function isDigit(code) {\n  return code >= 0x0030 && code <= 0x0039;\n}\n/**\n * ```\n * Letter :: one of\n *   - `A` `B` `C` `D` `E` `F` `G` `H` `I` `J` `K` `L` `M`\n *   - `N` `O` `P` `Q` `R` `S` `T` `U` `V` `W` `X` `Y` `Z`\n *   - `a` `b` `c` `d` `e` `f` `g` `h` `i` `j` `k` `l` `m`\n *   - `n` `o` `p` `q` `r` `s` `t` `u` `v` `w` `x` `y` `z`\n * ```\n * @internal\n */\n\nexport function isLetter(code) {\n  return (\n    (code >= 0x0061 && code <= 0x007a) || // A-Z\n    (code >= 0x0041 && code <= 0x005a) // a-z\n  );\n}\n/**\n * ```\n * NameStart ::\n *   - Letter\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameStart(code) {\n  return isLetter(code) || code === 0x005f;\n}\n/**\n * ```\n * NameContinue ::\n *   - Letter\n *   - Digit\n *   - `_`\n * ```\n * @internal\n */\n\nexport function isNameContinue(code) {\n  return isLetter(code) || isDigit(code) || code === 0x005f;\n}\n","import { isWhiteSpace } from './characterClasses.mjs';\n/**\n * Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n *\n * This implements the GraphQL spec's BlockStringValue() static algorithm.\n *\n * @internal\n */\n\nexport function dedentBlockStringLines(lines) {\n  var _firstNonEmptyLine2;\n\n  let commonIndent = Number.MAX_SAFE_INTEGER;\n  let firstNonEmptyLine = null;\n  let lastNonEmptyLine = -1;\n\n  for (let i = 0; i < lines.length; ++i) {\n    var _firstNonEmptyLine;\n\n    const line = lines[i];\n    const indent = leadingWhitespace(line);\n\n    if (indent === line.length) {\n      continue; // skip empty lines\n    }\n\n    firstNonEmptyLine =\n      (_firstNonEmptyLine = firstNonEmptyLine) !== null &&\n      _firstNonEmptyLine !== void 0\n        ? _firstNonEmptyLine\n        : i;\n    lastNonEmptyLine = i;\n\n    if (i !== 0 && indent < commonIndent) {\n      commonIndent = indent;\n    }\n  }\n\n  return lines // Remove common indentation from all lines but first.\n    .map((line, i) => (i === 0 ? line : line.slice(commonIndent))) // Remove leading and trailing blank lines.\n    .slice(\n      (_firstNonEmptyLine2 = firstNonEmptyLine) !== null &&\n        _firstNonEmptyLine2 !== void 0\n        ? _firstNonEmptyLine2\n        : 0,\n      lastNonEmptyLine + 1,\n    );\n}\n\nfunction leadingWhitespace(str) {\n  let i = 0;\n\n  while (i < str.length && isWhiteSpace(str.charCodeAt(i))) {\n    ++i;\n  }\n\n  return i;\n}\n/**\n * @internal\n */\n\nexport function isPrintableAsBlockString(value) {\n  if (value === '') {\n    return true; // empty string is printable\n  }\n\n  let isEmptyLine = true;\n  let hasIndent = false;\n  let hasCommonIndent = true;\n  let seenNonEmptyLine = false;\n\n  for (let i = 0; i < value.length; ++i) {\n    switch (value.codePointAt(i)) {\n      case 0x0000:\n      case 0x0001:\n      case 0x0002:\n      case 0x0003:\n      case 0x0004:\n      case 0x0005:\n      case 0x0006:\n      case 0x0007:\n      case 0x0008:\n      case 0x000b:\n      case 0x000c:\n      case 0x000e:\n      case 0x000f:\n        return false;\n      // Has non-printable characters\n\n      case 0x000d:\n        //  \\r\n        return false;\n      // Has \\r or \\r\\n which will be replaced as \\n\n\n      case 10:\n        //  \\n\n        if (isEmptyLine && !seenNonEmptyLine) {\n          return false; // Has leading new line\n        }\n\n        seenNonEmptyLine = true;\n        isEmptyLine = true;\n        hasIndent = false;\n        break;\n\n      case 9: //   \\t\n\n      case 32:\n        //  <space>\n        hasIndent || (hasIndent = isEmptyLine);\n        break;\n\n      default:\n        hasCommonIndent && (hasCommonIndent = hasIndent);\n        isEmptyLine = false;\n    }\n  }\n\n  if (isEmptyLine) {\n    return false; // Has trailing empty lines\n  }\n\n  if (hasCommonIndent && seenNonEmptyLine) {\n    return false; // Has internal indent\n  }\n\n  return true;\n}\n/**\n * Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n *\n * @internal\n */\n\nexport function printBlockString(value, options) {\n  const escapedValue = value.replace(/\"\"\"/g, '\\\\\"\"\"'); // Expand a block string's raw value into independent lines.\n\n  const lines = escapedValue.split(/\\r\\n|[\\n\\r]/g);\n  const isSingleLine = lines.length === 1; // If common indentation is found we can fix some of those cases by adding leading new line\n\n  const forceLeadingNewLine =\n    lines.length > 1 &&\n    lines\n      .slice(1)\n      .every((line) => line.length === 0 || isWhiteSpace(line.charCodeAt(0))); // Trailing triple quotes just looks confusing but doesn't force trailing new line\n\n  const hasTrailingTripleQuotes = escapedValue.endsWith('\\\\\"\"\"'); // Trailing quote (single or double) or slash forces trailing new line\n\n  const hasTrailingQuote = value.endsWith('\"') && !hasTrailingTripleQuotes;\n  const hasTrailingSlash = value.endsWith('\\\\');\n  const forceTrailingNewline = hasTrailingQuote || hasTrailingSlash;\n  const printAsMultipleLines =\n    !(options !== null && options !== void 0 && options.minimize) && // add leading and trailing new lines only if it improves readability\n    (!isSingleLine ||\n      value.length > 70 ||\n      forceTrailingNewline ||\n      forceLeadingNewLine ||\n      hasTrailingTripleQuotes);\n  let result = ''; // Format a multi-line block quote to account for leading space.\n\n  const skipLeadingNewLine = isSingleLine && isWhiteSpace(value.charCodeAt(0));\n\n  if ((printAsMultipleLines && !skipLeadingNewLine) || forceLeadingNewLine) {\n    result += '\\n';\n  }\n\n  result += escapedValue;\n\n  if (printAsMultipleLines || forceTrailingNewline) {\n    result += '\\n';\n  }\n\n  return '\"\"\"' + result + '\"\"\"';\n}\n","/**\n * An exported enum describing the different kinds of tokens that the\n * lexer emits.\n */\nvar TokenKind;\n\n(function (TokenKind) {\n  TokenKind['SOF'] = '<SOF>';\n  TokenKind['EOF'] = '<EOF>';\n  TokenKind['BANG'] = '!';\n  TokenKind['DOLLAR'] = '$';\n  TokenKind['AMP'] = '&';\n  TokenKind['PAREN_L'] = '(';\n  TokenKind['PAREN_R'] = ')';\n  TokenKind['SPREAD'] = '...';\n  TokenKind['COLON'] = ':';\n  TokenKind['EQUALS'] = '=';\n  TokenKind['AT'] = '@';\n  TokenKind['BRACKET_L'] = '[';\n  TokenKind['BRACKET_R'] = ']';\n  TokenKind['BRACE_L'] = '{';\n  TokenKind['PIPE'] = '|';\n  TokenKind['BRACE_R'] = '}';\n  TokenKind['NAME'] = 'Name';\n  TokenKind['INT'] = 'Int';\n  TokenKind['FLOAT'] = 'Float';\n  TokenKind['STRING'] = 'String';\n  TokenKind['BLOCK_STRING'] = 'BlockString';\n  TokenKind['COMMENT'] = 'Comment';\n})(TokenKind || (TokenKind = {}));\n\nexport { TokenKind };\n/**\n * The enum type representing the token kinds values.\n *\n * @deprecated Please use `TokenKind`. Will be remove in v17.\n */\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Token } from './ast.mjs';\nimport { dedentBlockStringLines } from './blockString.mjs';\nimport { isDigit, isNameContinue, isNameStart } from './characterClasses.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/**\n * Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n */\n\nexport class Lexer {\n  /**\n   * The previously focused non-ignored token.\n   */\n\n  /**\n   * The currently focused non-ignored token.\n   */\n\n  /**\n   * The (1-indexed) line containing the current token.\n   */\n\n  /**\n   * The character offset at which the current line begins.\n   */\n  constructor(source) {\n    const startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0);\n    this.source = source;\n    this.lastToken = startOfFileToken;\n    this.token = startOfFileToken;\n    this.line = 1;\n    this.lineStart = 0;\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Lexer';\n  }\n  /**\n   * Advances the token stream to the next non-ignored token.\n   */\n\n  advance() {\n    this.lastToken = this.token;\n    const token = (this.token = this.lookahead());\n    return token;\n  }\n  /**\n   * Looks ahead and returns the next non-ignored token, but does not change\n   * the state of Lexer.\n   */\n\n  lookahead() {\n    let token = this.token;\n\n    if (token.kind !== TokenKind.EOF) {\n      do {\n        if (token.next) {\n          token = token.next;\n        } else {\n          // Read the next token and form a link in the token linked-list.\n          const nextToken = readNextToken(this, token.end); // @ts-expect-error next is only mutable during parsing.\n\n          token.next = nextToken; // @ts-expect-error prev is only mutable during parsing.\n\n          nextToken.prev = token;\n          token = nextToken;\n        }\n      } while (token.kind === TokenKind.COMMENT);\n    }\n\n    return token;\n  }\n}\n/**\n * @internal\n */\n\nexport function isPunctuatorTokenKind(kind) {\n  return (\n    kind === TokenKind.BANG ||\n    kind === TokenKind.DOLLAR ||\n    kind === TokenKind.AMP ||\n    kind === TokenKind.PAREN_L ||\n    kind === TokenKind.PAREN_R ||\n    kind === TokenKind.SPREAD ||\n    kind === TokenKind.COLON ||\n    kind === TokenKind.EQUALS ||\n    kind === TokenKind.AT ||\n    kind === TokenKind.BRACKET_L ||\n    kind === TokenKind.BRACKET_R ||\n    kind === TokenKind.BRACE_L ||\n    kind === TokenKind.PIPE ||\n    kind === TokenKind.BRACE_R\n  );\n}\n/**\n * A Unicode scalar value is any Unicode code point except surrogate code\n * points. In other words, the inclusive ranges of values 0x0000 to 0xD7FF and\n * 0xE000 to 0x10FFFF.\n *\n * SourceCharacter ::\n *   - \"Any Unicode scalar value\"\n */\n\nfunction isUnicodeScalarValue(code) {\n  return (\n    (code >= 0x0000 && code <= 0xd7ff) || (code >= 0xe000 && code <= 0x10ffff)\n  );\n}\n/**\n * The GraphQL specification defines source text as a sequence of unicode scalar\n * values (which Unicode defines to exclude surrogate code points). However\n * JavaScript defines strings as a sequence of UTF-16 code units which may\n * include surrogates. A surrogate pair is a valid source character as it\n * encodes a supplementary code point (above U+FFFF), but unpaired surrogate\n * code points are not valid source characters.\n */\n\nfunction isSupplementaryCodePoint(body, location) {\n  return (\n    isLeadingSurrogate(body.charCodeAt(location)) &&\n    isTrailingSurrogate(body.charCodeAt(location + 1))\n  );\n}\n\nfunction isLeadingSurrogate(code) {\n  return code >= 0xd800 && code <= 0xdbff;\n}\n\nfunction isTrailingSurrogate(code) {\n  return code >= 0xdc00 && code <= 0xdfff;\n}\n/**\n * Prints the code point (or end of file reference) at a given location in a\n * source for use in error messages.\n *\n * Printable ASCII is printed quoted, while other points are printed in Unicode\n * code point form (ie. U+1234).\n */\n\nfunction printCodePointAt(lexer, location) {\n  const code = lexer.source.body.codePointAt(location);\n\n  if (code === undefined) {\n    return TokenKind.EOF;\n  } else if (code >= 0x0020 && code <= 0x007e) {\n    // Printable ASCII\n    const char = String.fromCodePoint(code);\n    return char === '\"' ? \"'\\\"'\" : `\"${char}\"`;\n  } // Unicode code point\n\n  return 'U+' + code.toString(16).toUpperCase().padStart(4, '0');\n}\n/**\n * Create a token with line and column location information.\n */\n\nfunction createToken(lexer, kind, start, end, value) {\n  const line = lexer.line;\n  const col = 1 + start - lexer.lineStart;\n  return new Token(kind, start, end, line, col, value);\n}\n/**\n * Gets the next token from the source starting at the given position.\n *\n * This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n */\n\nfunction readNextToken(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // SourceCharacter\n\n    switch (code) {\n      // Ignored ::\n      //   - UnicodeBOM\n      //   - WhiteSpace\n      //   - LineTerminator\n      //   - Comment\n      //   - Comma\n      //\n      // UnicodeBOM :: \"Byte Order Mark (U+FEFF)\"\n      //\n      // WhiteSpace ::\n      //   - \"Horizontal Tab (U+0009)\"\n      //   - \"Space (U+0020)\"\n      //\n      // Comma :: ,\n      case 0xfeff: // <BOM>\n\n      case 0x0009: // \\t\n\n      case 0x0020: // <space>\n\n      case 0x002c:\n        // ,\n        ++position;\n        continue;\n      // LineTerminator ::\n      //   - \"New Line (U+000A)\"\n      //   - \"Carriage Return (U+000D)\" [lookahead != \"New Line (U+000A)\"]\n      //   - \"Carriage Return (U+000D)\" \"New Line (U+000A)\"\n\n      case 0x000a:\n        // \\n\n        ++position;\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n\n      case 0x000d:\n        // \\r\n        if (body.charCodeAt(position + 1) === 0x000a) {\n          position += 2;\n        } else {\n          ++position;\n        }\n\n        ++lexer.line;\n        lexer.lineStart = position;\n        continue;\n      // Comment\n\n      case 0x0023:\n        // #\n        return readComment(lexer, position);\n      // Token ::\n      //   - Punctuator\n      //   - Name\n      //   - IntValue\n      //   - FloatValue\n      //   - StringValue\n      //\n      // Punctuator :: one of ! $ & ( ) ... : = @ [ ] { | }\n\n      case 0x0021:\n        // !\n        return createToken(lexer, TokenKind.BANG, position, position + 1);\n\n      case 0x0024:\n        // $\n        return createToken(lexer, TokenKind.DOLLAR, position, position + 1);\n\n      case 0x0026:\n        // &\n        return createToken(lexer, TokenKind.AMP, position, position + 1);\n\n      case 0x0028:\n        // (\n        return createToken(lexer, TokenKind.PAREN_L, position, position + 1);\n\n      case 0x0029:\n        // )\n        return createToken(lexer, TokenKind.PAREN_R, position, position + 1);\n\n      case 0x002e:\n        // .\n        if (\n          body.charCodeAt(position + 1) === 0x002e &&\n          body.charCodeAt(position + 2) === 0x002e\n        ) {\n          return createToken(lexer, TokenKind.SPREAD, position, position + 3);\n        }\n\n        break;\n\n      case 0x003a:\n        // :\n        return createToken(lexer, TokenKind.COLON, position, position + 1);\n\n      case 0x003d:\n        // =\n        return createToken(lexer, TokenKind.EQUALS, position, position + 1);\n\n      case 0x0040:\n        // @\n        return createToken(lexer, TokenKind.AT, position, position + 1);\n\n      case 0x005b:\n        // [\n        return createToken(lexer, TokenKind.BRACKET_L, position, position + 1);\n\n      case 0x005d:\n        // ]\n        return createToken(lexer, TokenKind.BRACKET_R, position, position + 1);\n\n      case 0x007b:\n        // {\n        return createToken(lexer, TokenKind.BRACE_L, position, position + 1);\n\n      case 0x007c:\n        // |\n        return createToken(lexer, TokenKind.PIPE, position, position + 1);\n\n      case 0x007d:\n        // }\n        return createToken(lexer, TokenKind.BRACE_R, position, position + 1);\n      // StringValue\n\n      case 0x0022:\n        // \"\n        if (\n          body.charCodeAt(position + 1) === 0x0022 &&\n          body.charCodeAt(position + 2) === 0x0022\n        ) {\n          return readBlockString(lexer, position);\n        }\n\n        return readString(lexer, position);\n    } // IntValue | FloatValue (Digit | -)\n\n    if (isDigit(code) || code === 0x002d) {\n      return readNumber(lexer, position, code);\n    } // Name\n\n    if (isNameStart(code)) {\n      return readName(lexer, position);\n    }\n\n    throw syntaxError(\n      lexer.source,\n      position,\n      code === 0x0027\n        ? 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?'\n        : isUnicodeScalarValue(code) || isSupplementaryCodePoint(body, position)\n        ? `Unexpected character: ${printCodePointAt(lexer, position)}.`\n        : `Invalid character: ${printCodePointAt(lexer, position)}.`,\n    );\n  }\n\n  return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);\n}\n/**\n * Reads a comment token from the source file.\n *\n * ```\n * Comment :: # CommentChar* [lookahead != CommentChar]\n *\n * CommentChar :: SourceCharacter but not LineTerminator\n * ```\n */\n\nfunction readComment(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.COMMENT,\n    start,\n    position,\n    body.slice(start + 1, position),\n  );\n}\n/**\n * Reads a number token from the source file, either a FloatValue or an IntValue\n * depending on whether a FractionalPart or ExponentPart is encountered.\n *\n * ```\n * IntValue :: IntegerPart [lookahead != {Digit, `.`, NameStart}]\n *\n * IntegerPart ::\n *   - NegativeSign? 0\n *   - NegativeSign? NonZeroDigit Digit*\n *\n * NegativeSign :: -\n *\n * NonZeroDigit :: Digit but not `0`\n *\n * FloatValue ::\n *   - IntegerPart FractionalPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart FractionalPart [lookahead != {Digit, `.`, NameStart}]\n *   - IntegerPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n *\n * FractionalPart :: . Digit+\n *\n * ExponentPart :: ExponentIndicator Sign? Digit+\n *\n * ExponentIndicator :: one of `e` `E`\n *\n * Sign :: one of + -\n * ```\n */\n\nfunction readNumber(lexer, start, firstCode) {\n  const body = lexer.source.body;\n  let position = start;\n  let code = firstCode;\n  let isFloat = false; // NegativeSign (-)\n\n  if (code === 0x002d) {\n    code = body.charCodeAt(++position);\n  } // Zero (0)\n\n  if (code === 0x0030) {\n    code = body.charCodeAt(++position);\n\n    if (isDigit(code)) {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid number, unexpected digit after 0: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  } else {\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Full stop (.)\n\n  if (code === 0x002e) {\n    isFloat = true;\n    code = body.charCodeAt(++position);\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // E e\n\n  if (code === 0x0045 || code === 0x0065) {\n    isFloat = true;\n    code = body.charCodeAt(++position); // + -\n\n    if (code === 0x002b || code === 0x002d) {\n      code = body.charCodeAt(++position);\n    }\n\n    position = readDigits(lexer, position, code);\n    code = body.charCodeAt(position);\n  } // Numbers cannot be followed by . or NameStart\n\n  if (code === 0x002e || isNameStart(code)) {\n    throw syntaxError(\n      lexer.source,\n      position,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        position,\n      )}.`,\n    );\n  }\n\n  return createToken(\n    lexer,\n    isFloat ? TokenKind.FLOAT : TokenKind.INT,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n/**\n * Returns the new position in the source after reading one or more digits.\n */\n\nfunction readDigits(lexer, start, firstCode) {\n  if (!isDigit(firstCode)) {\n    throw syntaxError(\n      lexer.source,\n      start,\n      `Invalid number, expected digit but got: ${printCodePointAt(\n        lexer,\n        start,\n      )}.`,\n    );\n  }\n\n  const body = lexer.source.body;\n  let position = start + 1; // +1 to skip first firstCode\n\n  while (isDigit(body.charCodeAt(position))) {\n    ++position;\n  }\n\n  return position;\n}\n/**\n * Reads a single-quote string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"` [lookahead != `\"`]\n *   - `\"` StringCharacter+ `\"`\n *\n * StringCharacter ::\n *   - SourceCharacter but not `\"` or `\\` or LineTerminator\n *   - `\\u` EscapedUnicode\n *   - `\\` EscapedCharacter\n *\n * EscapedUnicode ::\n *   - `{` HexDigit+ `}`\n *   - HexDigit HexDigit HexDigit HexDigit\n *\n * EscapedCharacter :: one of `\"` `\\` `/` `b` `f` `n` `r` `t`\n * ```\n */\n\nfunction readString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n  let chunkStart = position;\n  let value = '';\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Quote (\")\n\n    if (code === 0x0022) {\n      value += body.slice(chunkStart, position);\n      return createToken(lexer, TokenKind.STRING, start, position + 1, value);\n    } // Escape Sequence (\\)\n\n    if (code === 0x005c) {\n      value += body.slice(chunkStart, position);\n      const escape =\n        body.charCodeAt(position + 1) === 0x0075 // u\n          ? body.charCodeAt(position + 2) === 0x007b // {\n            ? readEscapedUnicodeVariableWidth(lexer, position)\n            : readEscapedUnicodeFixedWidth(lexer, position)\n          : readEscapedCharacter(lexer, position);\n      value += escape.value;\n      position += escape.size;\n      chunkStart = position;\n      continue;\n    } // LineTerminator (\\n | \\r)\n\n    if (code === 0x000a || code === 0x000d) {\n      break;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n} // The string value and lexed size of an escape sequence.\n\nfunction readEscapedUnicodeVariableWidth(lexer, position) {\n  const body = lexer.source.body;\n  let point = 0;\n  let size = 3; // Cannot be larger than 12 chars (\\u{00000000}).\n\n  while (size < 12) {\n    const code = body.charCodeAt(position + size++); // Closing Brace (})\n\n    if (code === 0x007d) {\n      // Must be at least 5 chars (\\u{0}) and encode a Unicode scalar value.\n      if (size < 5 || !isUnicodeScalarValue(point)) {\n        break;\n      }\n\n      return {\n        value: String.fromCodePoint(point),\n        size,\n      };\n    } // Append this hex digit to the code point.\n\n    point = (point << 4) | readHexDigit(code);\n\n    if (point < 0) {\n      break;\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(\n      position,\n      position + size,\n    )}\".`,\n  );\n}\n\nfunction readEscapedUnicodeFixedWidth(lexer, position) {\n  const body = lexer.source.body;\n  const code = read16BitHexCode(body, position + 2);\n\n  if (isUnicodeScalarValue(code)) {\n    return {\n      value: String.fromCodePoint(code),\n      size: 6,\n    };\n  } // GraphQL allows JSON-style surrogate pair escape sequences, but only when\n  // a valid pair is formed.\n\n  if (isLeadingSurrogate(code)) {\n    // \\u\n    if (\n      body.charCodeAt(position + 6) === 0x005c &&\n      body.charCodeAt(position + 7) === 0x0075\n    ) {\n      const trailingCode = read16BitHexCode(body, position + 8);\n\n      if (isTrailingSurrogate(trailingCode)) {\n        // JavaScript defines strings as a sequence of UTF-16 code units and\n        // encodes Unicode code points above U+FFFF using a surrogate pair of\n        // code units. Since this is a surrogate pair escape sequence, just\n        // include both codes into the JavaScript string value. Had JavaScript\n        // not been internally based on UTF-16, then this surrogate pair would\n        // be decoded to retrieve the supplementary code point.\n        return {\n          value: String.fromCodePoint(code, trailingCode),\n          size: 12,\n        };\n      }\n    }\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid Unicode escape sequence: \"${body.slice(position, position + 6)}\".`,\n  );\n}\n/**\n * Reads four hexadecimal characters and returns the positive integer that 16bit\n * hexadecimal string represents. For example, \"000f\" will return 15, and \"dead\"\n * will return 57005.\n *\n * Returns a negative number if any char was not a valid hexadecimal digit.\n */\n\nfunction read16BitHexCode(body, position) {\n  // readHexDigit() returns -1 on error. ORing a negative value with any other\n  // value always produces a negative value.\n  return (\n    (readHexDigit(body.charCodeAt(position)) << 12) |\n    (readHexDigit(body.charCodeAt(position + 1)) << 8) |\n    (readHexDigit(body.charCodeAt(position + 2)) << 4) |\n    readHexDigit(body.charCodeAt(position + 3))\n  );\n}\n/**\n * Reads a hexadecimal character and returns its positive integer value (0-15).\n *\n * '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n *\n * Returns -1 if the provided character code was not a valid hexadecimal digit.\n *\n * HexDigit :: one of\n *   - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n *   - `A` `B` `C` `D` `E` `F`\n *   - `a` `b` `c` `d` `e` `f`\n */\n\nfunction readHexDigit(code) {\n  return code >= 0x0030 && code <= 0x0039 // 0-9\n    ? code - 0x0030\n    : code >= 0x0041 && code <= 0x0046 // A-F\n    ? code - 0x0037\n    : code >= 0x0061 && code <= 0x0066 // a-f\n    ? code - 0x0057\n    : -1;\n}\n/**\n * | Escaped Character | Code Point | Character Name               |\n * | ----------------- | ---------- | ---------------------------- |\n * | `\"`               | U+0022     | double quote                 |\n * | `\\`               | U+005C     | reverse solidus (back slash) |\n * | `/`               | U+002F     | solidus (forward slash)      |\n * | `b`               | U+0008     | backspace                    |\n * | `f`               | U+000C     | form feed                    |\n * | `n`               | U+000A     | line feed (new line)         |\n * | `r`               | U+000D     | carriage return              |\n * | `t`               | U+0009     | horizontal tab               |\n */\n\nfunction readEscapedCharacter(lexer, position) {\n  const body = lexer.source.body;\n  const code = body.charCodeAt(position + 1);\n\n  switch (code) {\n    case 0x0022:\n      // \"\n      return {\n        value: '\\u0022',\n        size: 2,\n      };\n\n    case 0x005c:\n      // \\\n      return {\n        value: '\\u005c',\n        size: 2,\n      };\n\n    case 0x002f:\n      // /\n      return {\n        value: '\\u002f',\n        size: 2,\n      };\n\n    case 0x0062:\n      // b\n      return {\n        value: '\\u0008',\n        size: 2,\n      };\n\n    case 0x0066:\n      // f\n      return {\n        value: '\\u000c',\n        size: 2,\n      };\n\n    case 0x006e:\n      // n\n      return {\n        value: '\\u000a',\n        size: 2,\n      };\n\n    case 0x0072:\n      // r\n      return {\n        value: '\\u000d',\n        size: 2,\n      };\n\n    case 0x0074:\n      // t\n      return {\n        value: '\\u0009',\n        size: 2,\n      };\n  }\n\n  throw syntaxError(\n    lexer.source,\n    position,\n    `Invalid character escape sequence: \"${body.slice(\n      position,\n      position + 2,\n    )}\".`,\n  );\n}\n/**\n * Reads a block string token from the source file.\n *\n * ```\n * StringValue ::\n *   - `\"\"\"` BlockStringCharacter* `\"\"\"`\n *\n * BlockStringCharacter ::\n *   - SourceCharacter but not `\"\"\"` or `\\\"\"\"`\n *   - `\\\"\"\"`\n * ```\n */\n\nfunction readBlockString(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let lineStart = lexer.lineStart;\n  let position = start + 3;\n  let chunkStart = position;\n  let currentLine = '';\n  const blockLines = [];\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n    if (\n      code === 0x0022 &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022\n    ) {\n      currentLine += body.slice(chunkStart, position);\n      blockLines.push(currentLine);\n      const token = createToken(\n        lexer,\n        TokenKind.BLOCK_STRING,\n        start,\n        position + 3, // Return a string of the lines joined with U+000A.\n        dedentBlockStringLines(blockLines).join('\\n'),\n      );\n      lexer.line += blockLines.length - 1;\n      lexer.lineStart = lineStart;\n      return token;\n    } // Escaped Triple-Quote (\\\"\"\")\n\n    if (\n      code === 0x005c &&\n      body.charCodeAt(position + 1) === 0x0022 &&\n      body.charCodeAt(position + 2) === 0x0022 &&\n      body.charCodeAt(position + 3) === 0x0022\n    ) {\n      currentLine += body.slice(chunkStart, position);\n      chunkStart = position + 1; // skip only slash\n\n      position += 4;\n      continue;\n    } // LineTerminator\n\n    if (code === 0x000a || code === 0x000d) {\n      currentLine += body.slice(chunkStart, position);\n      blockLines.push(currentLine);\n\n      if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n        position += 2;\n      } else {\n        ++position;\n      }\n\n      currentLine = '';\n      chunkStart = position;\n      lineStart = position;\n      continue;\n    } // SourceCharacter\n\n    if (isUnicodeScalarValue(code)) {\n      ++position;\n    } else if (isSupplementaryCodePoint(body, position)) {\n      position += 2;\n    } else {\n      throw syntaxError(\n        lexer.source,\n        position,\n        `Invalid character within String: ${printCodePointAt(\n          lexer,\n          position,\n        )}.`,\n      );\n    }\n  }\n\n  throw syntaxError(lexer.source, position, 'Unterminated string.');\n}\n/**\n * Reads an alphanumeric + underscore name from the source.\n *\n * ```\n * Name ::\n *   - NameStart NameContinue* [lookahead != NameContinue]\n * ```\n */\n\nfunction readName(lexer, start) {\n  const body = lexer.source.body;\n  const bodyLength = body.length;\n  let position = start + 1;\n\n  while (position < bodyLength) {\n    const code = body.charCodeAt(position);\n\n    if (isNameContinue(code)) {\n      ++position;\n    } else {\n      break;\n    }\n  }\n\n  return createToken(\n    lexer,\n    TokenKind.NAME,\n    start,\n    position,\n    body.slice(start, position),\n  );\n}\n","const MAX_ARRAY_LENGTH = 10;\nconst MAX_RECURSIVE_DEPTH = 2;\n/**\n * Used to print values in error messages.\n */\n\nexport function inspect(value) {\n  return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n  switch (typeof value) {\n    case 'string':\n      return JSON.stringify(value);\n\n    case 'function':\n      return value.name ? `[function ${value.name}]` : '[function]';\n\n    case 'object':\n      return formatObjectValue(value, seenValues);\n\n    default:\n      return String(value);\n  }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n  if (value === null) {\n    return 'null';\n  }\n\n  if (previouslySeenValues.includes(value)) {\n    return '[Circular]';\n  }\n\n  const seenValues = [...previouslySeenValues, value];\n\n  if (isJSONable(value)) {\n    const jsonValue = value.toJSON(); // check for infinite recursion\n\n    if (jsonValue !== value) {\n      return typeof jsonValue === 'string'\n        ? jsonValue\n        : formatValue(jsonValue, seenValues);\n    }\n  } else if (Array.isArray(value)) {\n    return formatArray(value, seenValues);\n  }\n\n  return formatObject(value, seenValues);\n}\n\nfunction isJSONable(value) {\n  return typeof value.toJSON === 'function';\n}\n\nfunction formatObject(object, seenValues) {\n  const entries = Object.entries(object);\n\n  if (entries.length === 0) {\n    return '{}';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[' + getObjectTag(object) + ']';\n  }\n\n  const properties = entries.map(\n    ([key, value]) => key + ': ' + formatValue(value, seenValues),\n  );\n  return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n  if (array.length === 0) {\n    return '[]';\n  }\n\n  if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n    return '[Array]';\n  }\n\n  const len = Math.min(MAX_ARRAY_LENGTH, array.length);\n  const remaining = array.length - len;\n  const items = [];\n\n  for (let i = 0; i < len; ++i) {\n    items.push(formatValue(array[i], seenValues));\n  }\n\n  if (remaining === 1) {\n    items.push('... 1 more item');\n  } else if (remaining > 1) {\n    items.push(`... ${remaining} more items`);\n  }\n\n  return '[' + items.join(', ') + ']';\n}\n\nfunction getObjectTag(object) {\n  const tag = Object.prototype.toString\n    .call(object)\n    .replace(/^\\[object /, '')\n    .replace(/]$/, '');\n\n  if (tag === 'Object' && typeof object.constructor === 'function') {\n    const name = object.constructor.name;\n\n    if (typeof name === 'string' && name !== '') {\n      return name;\n    }\n  }\n\n  return tag;\n}\n","import { inspect } from './inspect.mjs';\n/* c8 ignore next 3 */\n\nconst isProduction =\n  globalThis.process && // eslint-disable-next-line no-undef\n  process.env.NODE_ENV === 'production';\n/**\n * A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n * See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n * See: https://webpack.js.org/guides/production/\n */\n\nexport const instanceOf =\n  /* c8 ignore next 6 */\n  // FIXME: https://github.com/graphql/graphql-js/issues/2317\n  isProduction\n    ? function instanceOf(value, constructor) {\n        return value instanceof constructor;\n      }\n    : function instanceOf(value, constructor) {\n        if (value instanceof constructor) {\n          return true;\n        }\n\n        if (typeof value === 'object' && value !== null) {\n          var _value$constructor;\n\n          // Prefer Symbol.toStringTag since it is immune to minification.\n          const className = constructor.prototype[Symbol.toStringTag];\n          const valueClassName = // We still need to support constructor's name to detect conflicts with older versions of this library.\n            Symbol.toStringTag in value // @ts-expect-error TS bug see, https://github.com/microsoft/TypeScript/issues/38009\n              ? value[Symbol.toStringTag]\n              : (_value$constructor = value.constructor) === null ||\n                _value$constructor === void 0\n              ? void 0\n              : _value$constructor.name;\n\n          if (className === valueClassName) {\n            const stringifiedValue = inspect(value);\n            throw new Error(`Cannot use ${className} \"${stringifiedValue}\" from another module or realm.\n\nEnsure that there is only one instance of \"graphql\" in the node_modules\ndirectory. If different versions of \"graphql\" are the dependencies of other\nrelied on modules, use \"resolutions\" to ensure only one version is installed.\n\nhttps://yarnpkg.com/en/docs/selective-version-resolutions\n\nDuplicate \"graphql\" modules cannot be used at the same time since different\nversions may have different capabilities and behavior. The data from one\nversion used in the function from another could produce confusing and\nspurious results.`);\n          }\n        }\n\n        return false;\n      };\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\n\n/**\n * A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n */\nexport class Source {\n  constructor(\n    body,\n    name = 'GraphQL request',\n    locationOffset = {\n      line: 1,\n      column: 1,\n    },\n  ) {\n    typeof body === 'string' ||\n      devAssert(false, `Body must be a string. Received: ${inspect(body)}.`);\n    this.body = body;\n    this.name = name;\n    this.locationOffset = locationOffset;\n    this.locationOffset.line > 0 ||\n      devAssert(\n        false,\n        'line in locationOffset is 1-indexed and must be positive.',\n      );\n    this.locationOffset.column > 0 ||\n      devAssert(\n        false,\n        'column in locationOffset is 1-indexed and must be positive.',\n      );\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'Source';\n  }\n}\n/**\n * Test if the given value is a Source object.\n *\n * @internal\n */\n\nexport function isSource(source) {\n  return instanceOf(source, Source);\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Location, OperationTypeNode } from './ast.mjs';\nimport { DirectiveLocation } from './directiveLocation.mjs';\nimport { Kind } from './kinds.mjs';\nimport { isPunctuatorTokenKind, Lexer } from './lexer.mjs';\nimport { isSource, Source } from './source.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/**\n * Configuration options to control parser behavior\n */\n\n/**\n * Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n */\nexport function parse(source, options) {\n  const parser = new Parser(source, options);\n  const document = parser.parseDocument();\n  Object.defineProperty(document, 'tokenCount', {\n    enumerable: false,\n    value: parser.tokenCount,\n  });\n  return document;\n}\n/**\n * Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: valueFromAST().\n */\n\nexport function parseValue(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseValueLiteral(false);\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Similar to parseValue(), but raises a parse error if it encounters a\n * variable. The return type will be a constant value.\n */\n\nexport function parseConstValue(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const value = parser.parseConstValueLiteral();\n  parser.expectToken(TokenKind.EOF);\n  return value;\n}\n/**\n * Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n *\n * This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n *\n * Consider providing the results to the utility function: typeFromAST().\n */\n\nexport function parseType(source, options) {\n  const parser = new Parser(source, options);\n  parser.expectToken(TokenKind.SOF);\n  const type = parser.parseTypeReference();\n  parser.expectToken(TokenKind.EOF);\n  return type;\n}\n/**\n * This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n *\n * It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n *\n * @internal\n */\n\nexport class Parser {\n  constructor(source, options = {}) {\n    const sourceObj = isSource(source) ? source : new Source(source);\n    this._lexer = new Lexer(sourceObj);\n    this._options = options;\n    this._tokenCounter = 0;\n  }\n\n  get tokenCount() {\n    return this._tokenCounter;\n  }\n  /**\n   * Converts a name lex token into a name parse node.\n   */\n\n  parseName() {\n    const token = this.expectToken(TokenKind.NAME);\n    return this.node(token, {\n      kind: Kind.NAME,\n      value: token.value,\n    });\n  } // Implements the parsing rules in the Document section.\n\n  /**\n   * Document : Definition+\n   */\n\n  parseDocument() {\n    return this.node(this._lexer.token, {\n      kind: Kind.DOCUMENT,\n      definitions: this.many(\n        TokenKind.SOF,\n        this.parseDefinition,\n        TokenKind.EOF,\n      ),\n    });\n  }\n  /**\n   * Definition :\n   *   - ExecutableDefinition\n   *   - TypeSystemDefinition\n   *   - TypeSystemExtension\n   *\n   * ExecutableDefinition :\n   *   - OperationDefinition\n   *   - FragmentDefinition\n   *\n   * TypeSystemDefinition :\n   *   - SchemaDefinition\n   *   - TypeDefinition\n   *   - DirectiveDefinition\n   *\n   * TypeDefinition :\n   *   - ScalarTypeDefinition\n   *   - ObjectTypeDefinition\n   *   - InterfaceTypeDefinition\n   *   - UnionTypeDefinition\n   *   - EnumTypeDefinition\n   *   - InputObjectTypeDefinition\n   */\n\n  parseDefinition() {\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.parseOperationDefinition();\n    } // Many definitions begin with a description and require a lookahead.\n\n    const hasDescription = this.peekDescription();\n    const keywordToken = hasDescription\n      ? this._lexer.lookahead()\n      : this._lexer.token;\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaDefinition();\n\n        case 'scalar':\n          return this.parseScalarTypeDefinition();\n\n        case 'type':\n          return this.parseObjectTypeDefinition();\n\n        case 'interface':\n          return this.parseInterfaceTypeDefinition();\n\n        case 'union':\n          return this.parseUnionTypeDefinition();\n\n        case 'enum':\n          return this.parseEnumTypeDefinition();\n\n        case 'input':\n          return this.parseInputObjectTypeDefinition();\n\n        case 'directive':\n          return this.parseDirectiveDefinition();\n      }\n\n      if (hasDescription) {\n        throw syntaxError(\n          this._lexer.source,\n          this._lexer.token.start,\n          'Unexpected description, descriptions are supported only on type definitions.',\n        );\n      }\n\n      switch (keywordToken.value) {\n        case 'query':\n        case 'mutation':\n        case 'subscription':\n          return this.parseOperationDefinition();\n\n        case 'fragment':\n          return this.parseFragmentDefinition();\n\n        case 'extend':\n          return this.parseTypeSystemExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  } // Implements the parsing rules in the Operations section.\n\n  /**\n   * OperationDefinition :\n   *  - SelectionSet\n   *  - OperationType Name? VariableDefinitions? Directives? SelectionSet\n   */\n\n  parseOperationDefinition() {\n    const start = this._lexer.token;\n\n    if (this.peek(TokenKind.BRACE_L)) {\n      return this.node(start, {\n        kind: Kind.OPERATION_DEFINITION,\n        operation: OperationTypeNode.QUERY,\n        name: undefined,\n        variableDefinitions: [],\n        directives: [],\n        selectionSet: this.parseSelectionSet(),\n      });\n    }\n\n    const operation = this.parseOperationType();\n    let name;\n\n    if (this.peek(TokenKind.NAME)) {\n      name = this.parseName();\n    }\n\n    return this.node(start, {\n      kind: Kind.OPERATION_DEFINITION,\n      operation,\n      name,\n      variableDefinitions: this.parseVariableDefinitions(),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * OperationType : one of query mutation subscription\n   */\n\n  parseOperationType() {\n    const operationToken = this.expectToken(TokenKind.NAME);\n\n    switch (operationToken.value) {\n      case 'query':\n        return OperationTypeNode.QUERY;\n\n      case 'mutation':\n        return OperationTypeNode.MUTATION;\n\n      case 'subscription':\n        return OperationTypeNode.SUBSCRIPTION;\n    }\n\n    throw this.unexpected(operationToken);\n  }\n  /**\n   * VariableDefinitions : ( VariableDefinition+ )\n   */\n\n  parseVariableDefinitions() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseVariableDefinition,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n   */\n\n  parseVariableDefinition() {\n    return this.node(this._lexer.token, {\n      kind: Kind.VARIABLE_DEFINITION,\n      variable: this.parseVariable(),\n      type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n      defaultValue: this.expectOptionalToken(TokenKind.EQUALS)\n        ? this.parseConstValueLiteral()\n        : undefined,\n      directives: this.parseConstDirectives(),\n    });\n  }\n  /**\n   * Variable : $ Name\n   */\n\n  parseVariable() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.DOLLAR);\n    return this.node(start, {\n      kind: Kind.VARIABLE,\n      name: this.parseName(),\n    });\n  }\n  /**\n   * ```\n   * SelectionSet : { Selection+ }\n   * ```\n   */\n\n  parseSelectionSet() {\n    return this.node(this._lexer.token, {\n      kind: Kind.SELECTION_SET,\n      selections: this.many(\n        TokenKind.BRACE_L,\n        this.parseSelection,\n        TokenKind.BRACE_R,\n      ),\n    });\n  }\n  /**\n   * Selection :\n   *   - Field\n   *   - FragmentSpread\n   *   - InlineFragment\n   */\n\n  parseSelection() {\n    return this.peek(TokenKind.SPREAD)\n      ? this.parseFragment()\n      : this.parseField();\n  }\n  /**\n   * Field : Alias? Name Arguments? Directives? SelectionSet?\n   *\n   * Alias : Name :\n   */\n\n  parseField() {\n    const start = this._lexer.token;\n    const nameOrAlias = this.parseName();\n    let alias;\n    let name;\n\n    if (this.expectOptionalToken(TokenKind.COLON)) {\n      alias = nameOrAlias;\n      name = this.parseName();\n    } else {\n      name = nameOrAlias;\n    }\n\n    return this.node(start, {\n      kind: Kind.FIELD,\n      alias,\n      name,\n      arguments: this.parseArguments(false),\n      directives: this.parseDirectives(false),\n      selectionSet: this.peek(TokenKind.BRACE_L)\n        ? this.parseSelectionSet()\n        : undefined,\n    });\n  }\n  /**\n   * Arguments[Const] : ( Argument[?Const]+ )\n   */\n\n  parseArguments(isConst) {\n    const item = isConst ? this.parseConstArgument : this.parseArgument;\n    return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n  }\n  /**\n   * Argument[Const] : Name : Value[?Const]\n   */\n\n  parseArgument(isConst = false) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.ARGUMENT,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  }\n\n  parseConstArgument() {\n    return this.parseArgument(true);\n  } // Implements the parsing rules in the Fragments section.\n\n  /**\n   * Corresponds to both FragmentSpread and InlineFragment in the spec.\n   *\n   * FragmentSpread : ... FragmentName Directives?\n   *\n   * InlineFragment : ... TypeCondition? Directives? SelectionSet\n   */\n\n  parseFragment() {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.SPREAD);\n    const hasTypeCondition = this.expectOptionalKeyword('on');\n\n    if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n      return this.node(start, {\n        kind: Kind.FRAGMENT_SPREAD,\n        name: this.parseFragmentName(),\n        directives: this.parseDirectives(false),\n      });\n    }\n\n    return this.node(start, {\n      kind: Kind.INLINE_FRAGMENT,\n      typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * FragmentDefinition :\n   *   - fragment FragmentName on TypeCondition Directives? SelectionSet\n   *\n   * TypeCondition : NamedType\n   */\n\n  parseFragmentDefinition() {\n    const start = this._lexer.token;\n    this.expectKeyword('fragment'); // Legacy support for defining variables within fragments changes\n    // the grammar of FragmentDefinition:\n    //   - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n    if (this._options.allowLegacyFragmentVariables === true) {\n      return this.node(start, {\n        kind: Kind.FRAGMENT_DEFINITION,\n        name: this.parseFragmentName(),\n        variableDefinitions: this.parseVariableDefinitions(),\n        typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n        directives: this.parseDirectives(false),\n        selectionSet: this.parseSelectionSet(),\n      });\n    }\n\n    return this.node(start, {\n      kind: Kind.FRAGMENT_DEFINITION,\n      name: this.parseFragmentName(),\n      typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n      directives: this.parseDirectives(false),\n      selectionSet: this.parseSelectionSet(),\n    });\n  }\n  /**\n   * FragmentName : Name but not `on`\n   */\n\n  parseFragmentName() {\n    if (this._lexer.token.value === 'on') {\n      throw this.unexpected();\n    }\n\n    return this.parseName();\n  } // Implements the parsing rules in the Values section.\n\n  /**\n   * Value[Const] :\n   *   - [~Const] Variable\n   *   - IntValue\n   *   - FloatValue\n   *   - StringValue\n   *   - BooleanValue\n   *   - NullValue\n   *   - EnumValue\n   *   - ListValue[?Const]\n   *   - ObjectValue[?Const]\n   *\n   * BooleanValue : one of `true` `false`\n   *\n   * NullValue : `null`\n   *\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n\n  parseValueLiteral(isConst) {\n    const token = this._lexer.token;\n\n    switch (token.kind) {\n      case TokenKind.BRACKET_L:\n        return this.parseList(isConst);\n\n      case TokenKind.BRACE_L:\n        return this.parseObject(isConst);\n\n      case TokenKind.INT:\n        this.advanceLexer();\n        return this.node(token, {\n          kind: Kind.INT,\n          value: token.value,\n        });\n\n      case TokenKind.FLOAT:\n        this.advanceLexer();\n        return this.node(token, {\n          kind: Kind.FLOAT,\n          value: token.value,\n        });\n\n      case TokenKind.STRING:\n      case TokenKind.BLOCK_STRING:\n        return this.parseStringLiteral();\n\n      case TokenKind.NAME:\n        this.advanceLexer();\n\n        switch (token.value) {\n          case 'true':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: true,\n            });\n\n          case 'false':\n            return this.node(token, {\n              kind: Kind.BOOLEAN,\n              value: false,\n            });\n\n          case 'null':\n            return this.node(token, {\n              kind: Kind.NULL,\n            });\n\n          default:\n            return this.node(token, {\n              kind: Kind.ENUM,\n              value: token.value,\n            });\n        }\n\n      case TokenKind.DOLLAR:\n        if (isConst) {\n          this.expectToken(TokenKind.DOLLAR);\n\n          if (this._lexer.token.kind === TokenKind.NAME) {\n            const varName = this._lexer.token.value;\n            throw syntaxError(\n              this._lexer.source,\n              token.start,\n              `Unexpected variable \"$${varName}\" in constant value.`,\n            );\n          } else {\n            throw this.unexpected(token);\n          }\n        }\n\n        return this.parseVariable();\n\n      default:\n        throw this.unexpected();\n    }\n  }\n\n  parseConstValueLiteral() {\n    return this.parseValueLiteral(true);\n  }\n\n  parseStringLiteral() {\n    const token = this._lexer.token;\n    this.advanceLexer();\n    return this.node(token, {\n      kind: Kind.STRING,\n      value: token.value,\n      block: token.kind === TokenKind.BLOCK_STRING,\n    });\n  }\n  /**\n   * ListValue[Const] :\n   *   - [ ]\n   *   - [ Value[?Const]+ ]\n   */\n\n  parseList(isConst) {\n    const item = () => this.parseValueLiteral(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.LIST,\n      values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n    });\n  }\n  /**\n   * ```\n   * ObjectValue[Const] :\n   *   - { }\n   *   - { ObjectField[?Const]+ }\n   * ```\n   */\n\n  parseObject(isConst) {\n    const item = () => this.parseObjectField(isConst);\n\n    return this.node(this._lexer.token, {\n      kind: Kind.OBJECT,\n      fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n    });\n  }\n  /**\n   * ObjectField[Const] : Name : Value[?Const]\n   */\n\n  parseObjectField(isConst) {\n    const start = this._lexer.token;\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    return this.node(start, {\n      kind: Kind.OBJECT_FIELD,\n      name,\n      value: this.parseValueLiteral(isConst),\n    });\n  } // Implements the parsing rules in the Directives section.\n\n  /**\n   * Directives[Const] : Directive[?Const]+\n   */\n\n  parseDirectives(isConst) {\n    const directives = [];\n\n    while (this.peek(TokenKind.AT)) {\n      directives.push(this.parseDirective(isConst));\n    }\n\n    return directives;\n  }\n\n  parseConstDirectives() {\n    return this.parseDirectives(true);\n  }\n  /**\n   * ```\n   * Directive[Const] : @ Name Arguments[?Const]?\n   * ```\n   */\n\n  parseDirective(isConst) {\n    const start = this._lexer.token;\n    this.expectToken(TokenKind.AT);\n    return this.node(start, {\n      kind: Kind.DIRECTIVE,\n      name: this.parseName(),\n      arguments: this.parseArguments(isConst),\n    });\n  } // Implements the parsing rules in the Types section.\n\n  /**\n   * Type :\n   *   - NamedType\n   *   - ListType\n   *   - NonNullType\n   */\n\n  parseTypeReference() {\n    const start = this._lexer.token;\n    let type;\n\n    if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n      const innerType = this.parseTypeReference();\n      this.expectToken(TokenKind.BRACKET_R);\n      type = this.node(start, {\n        kind: Kind.LIST_TYPE,\n        type: innerType,\n      });\n    } else {\n      type = this.parseNamedType();\n    }\n\n    if (this.expectOptionalToken(TokenKind.BANG)) {\n      return this.node(start, {\n        kind: Kind.NON_NULL_TYPE,\n        type,\n      });\n    }\n\n    return type;\n  }\n  /**\n   * NamedType : Name\n   */\n\n  parseNamedType() {\n    return this.node(this._lexer.token, {\n      kind: Kind.NAMED_TYPE,\n      name: this.parseName(),\n    });\n  } // Implements the parsing rules in the Type Definition section.\n\n  peekDescription() {\n    return this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING);\n  }\n  /**\n   * Description : StringValue\n   */\n\n  parseDescription() {\n    if (this.peekDescription()) {\n      return this.parseStringLiteral();\n    }\n  }\n  /**\n   * ```\n   * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n   * ```\n   */\n\n  parseSchemaDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.many(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n    return this.node(start, {\n      kind: Kind.SCHEMA_DEFINITION,\n      description,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * OperationTypeDefinition : OperationType : NamedType\n   */\n\n  parseOperationTypeDefinition() {\n    const start = this._lexer.token;\n    const operation = this.parseOperationType();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseNamedType();\n    return this.node(start, {\n      kind: Kind.OPERATION_TYPE_DEFINITION,\n      operation,\n      type,\n    });\n  }\n  /**\n   * ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n   */\n\n  parseScalarTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * ObjectTypeDefinition :\n   *   Description?\n   *   type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n   */\n\n  parseObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ImplementsInterfaces :\n   *   - implements `&`? NamedType\n   *   - ImplementsInterfaces & NamedType\n   */\n\n  parseImplementsInterfaces() {\n    return this.expectOptionalKeyword('implements')\n      ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)\n      : [];\n  }\n  /**\n   * ```\n   * FieldsDefinition : { FieldDefinition+ }\n   * ```\n   */\n\n  parseFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseFieldDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * FieldDefinition :\n   *   - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n   */\n\n  parseFieldDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.FIELD_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      type,\n      directives,\n    });\n  }\n  /**\n   * ArgumentsDefinition : ( InputValueDefinition+ )\n   */\n\n  parseArgumentDefs() {\n    return this.optionalMany(\n      TokenKind.PAREN_L,\n      this.parseInputValueDef,\n      TokenKind.PAREN_R,\n    );\n  }\n  /**\n   * InputValueDefinition :\n   *   - Description? Name : Type DefaultValue? Directives[Const]?\n   */\n\n  parseInputValueDef() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseName();\n    this.expectToken(TokenKind.COLON);\n    const type = this.parseTypeReference();\n    let defaultValue;\n\n    if (this.expectOptionalToken(TokenKind.EQUALS)) {\n      defaultValue = this.parseConstValueLiteral();\n    }\n\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.INPUT_VALUE_DEFINITION,\n      description,\n      name,\n      type,\n      defaultValue,\n      directives,\n    });\n  }\n  /**\n   * InterfaceTypeDefinition :\n   *   - Description? interface Name Directives[Const]? FieldsDefinition?\n   */\n\n  parseInterfaceTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_DEFINITION,\n      description,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeDefinition :\n   *   - Description? union Name Directives[Const]? UnionMemberTypes?\n   */\n\n  parseUnionTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * UnionMemberTypes :\n   *   - = `|`? NamedType\n   *   - UnionMemberTypes | NamedType\n   */\n\n  parseUnionMemberTypes() {\n    return this.expectOptionalToken(TokenKind.EQUALS)\n      ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)\n      : [];\n  }\n  /**\n   * EnumTypeDefinition :\n   *   - Description? enum Name Directives[Const]? EnumValuesDefinition?\n   */\n\n  parseEnumTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * ```\n   * EnumValuesDefinition : { EnumValueDefinition+ }\n   * ```\n   */\n\n  parseEnumValuesDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseEnumValueDefinition,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * EnumValueDefinition : Description? EnumValue Directives[Const]?\n   */\n\n  parseEnumValueDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    const name = this.parseEnumValueName();\n    const directives = this.parseConstDirectives();\n    return this.node(start, {\n      kind: Kind.ENUM_VALUE_DEFINITION,\n      description,\n      name,\n      directives,\n    });\n  }\n  /**\n   * EnumValue : Name but not `true`, `false` or `null`\n   */\n\n  parseEnumValueName() {\n    if (\n      this._lexer.token.value === 'true' ||\n      this._lexer.token.value === 'false' ||\n      this._lexer.token.value === 'null'\n    ) {\n      throw syntaxError(\n        this._lexer.source,\n        this._lexer.token.start,\n        `${getTokenDesc(\n          this._lexer.token,\n        )} is reserved and cannot be used for an enum value.`,\n      );\n    }\n\n    return this.parseName();\n  }\n  /**\n   * InputObjectTypeDefinition :\n   *   - Description? input Name Directives[Const]? InputFieldsDefinition?\n   */\n\n  parseInputObjectTypeDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n      description,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * InputFieldsDefinition : { InputValueDefinition+ }\n   * ```\n   */\n\n  parseInputFieldsDefinition() {\n    return this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseInputValueDef,\n      TokenKind.BRACE_R,\n    );\n  }\n  /**\n   * TypeSystemExtension :\n   *   - SchemaExtension\n   *   - TypeExtension\n   *\n   * TypeExtension :\n   *   - ScalarTypeExtension\n   *   - ObjectTypeExtension\n   *   - InterfaceTypeExtension\n   *   - UnionTypeExtension\n   *   - EnumTypeExtension\n   *   - InputObjectTypeDefinition\n   */\n\n  parseTypeSystemExtension() {\n    const keywordToken = this._lexer.lookahead();\n\n    if (keywordToken.kind === TokenKind.NAME) {\n      switch (keywordToken.value) {\n        case 'schema':\n          return this.parseSchemaExtension();\n\n        case 'scalar':\n          return this.parseScalarTypeExtension();\n\n        case 'type':\n          return this.parseObjectTypeExtension();\n\n        case 'interface':\n          return this.parseInterfaceTypeExtension();\n\n        case 'union':\n          return this.parseUnionTypeExtension();\n\n        case 'enum':\n          return this.parseEnumTypeExtension();\n\n        case 'input':\n          return this.parseInputObjectTypeExtension();\n      }\n    }\n\n    throw this.unexpected(keywordToken);\n  }\n  /**\n   * ```\n   * SchemaExtension :\n   *  - extend schema Directives[Const]? { OperationTypeDefinition+ }\n   *  - extend schema Directives[Const]\n   * ```\n   */\n\n  parseSchemaExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('schema');\n    const directives = this.parseConstDirectives();\n    const operationTypes = this.optionalMany(\n      TokenKind.BRACE_L,\n      this.parseOperationTypeDefinition,\n      TokenKind.BRACE_R,\n    );\n\n    if (directives.length === 0 && operationTypes.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCHEMA_EXTENSION,\n      directives,\n      operationTypes,\n    });\n  }\n  /**\n   * ScalarTypeExtension :\n   *   - extend scalar Name Directives[Const]\n   */\n\n  parseScalarTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('scalar');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n\n    if (directives.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.SCALAR_TYPE_EXTENSION,\n      name,\n      directives,\n    });\n  }\n  /**\n   * ObjectTypeExtension :\n   *  - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend type Name ImplementsInterfaces? Directives[Const]\n   *  - extend type Name ImplementsInterfaces\n   */\n\n  parseObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('type');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.OBJECT_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * InterfaceTypeExtension :\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n   *  - extend interface Name ImplementsInterfaces? Directives[Const]\n   *  - extend interface Name ImplementsInterfaces\n   */\n\n  parseInterfaceTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('interface');\n    const name = this.parseName();\n    const interfaces = this.parseImplementsInterfaces();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseFieldsDefinition();\n\n    if (\n      interfaces.length === 0 &&\n      directives.length === 0 &&\n      fields.length === 0\n    ) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INTERFACE_TYPE_EXTENSION,\n      name,\n      interfaces,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * UnionTypeExtension :\n   *   - extend union Name Directives[Const]? UnionMemberTypes\n   *   - extend union Name Directives[Const]\n   */\n\n  parseUnionTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('union');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const types = this.parseUnionMemberTypes();\n\n    if (directives.length === 0 && types.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.UNION_TYPE_EXTENSION,\n      name,\n      directives,\n      types,\n    });\n  }\n  /**\n   * EnumTypeExtension :\n   *   - extend enum Name Directives[Const]? EnumValuesDefinition\n   *   - extend enum Name Directives[Const]\n   */\n\n  parseEnumTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('enum');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const values = this.parseEnumValuesDefinition();\n\n    if (directives.length === 0 && values.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.ENUM_TYPE_EXTENSION,\n      name,\n      directives,\n      values,\n    });\n  }\n  /**\n   * InputObjectTypeExtension :\n   *   - extend input Name Directives[Const]? InputFieldsDefinition\n   *   - extend input Name Directives[Const]\n   */\n\n  parseInputObjectTypeExtension() {\n    const start = this._lexer.token;\n    this.expectKeyword('extend');\n    this.expectKeyword('input');\n    const name = this.parseName();\n    const directives = this.parseConstDirectives();\n    const fields = this.parseInputFieldsDefinition();\n\n    if (directives.length === 0 && fields.length === 0) {\n      throw this.unexpected();\n    }\n\n    return this.node(start, {\n      kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n      name,\n      directives,\n      fields,\n    });\n  }\n  /**\n   * ```\n   * DirectiveDefinition :\n   *   - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n   * ```\n   */\n\n  parseDirectiveDefinition() {\n    const start = this._lexer.token;\n    const description = this.parseDescription();\n    this.expectKeyword('directive');\n    this.expectToken(TokenKind.AT);\n    const name = this.parseName();\n    const args = this.parseArgumentDefs();\n    const repeatable = this.expectOptionalKeyword('repeatable');\n    this.expectKeyword('on');\n    const locations = this.parseDirectiveLocations();\n    return this.node(start, {\n      kind: Kind.DIRECTIVE_DEFINITION,\n      description,\n      name,\n      arguments: args,\n      repeatable,\n      locations,\n    });\n  }\n  /**\n   * DirectiveLocations :\n   *   - `|`? DirectiveLocation\n   *   - DirectiveLocations | DirectiveLocation\n   */\n\n  parseDirectiveLocations() {\n    return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n  }\n  /*\n   * DirectiveLocation :\n   *   - ExecutableDirectiveLocation\n   *   - TypeSystemDirectiveLocation\n   *\n   * ExecutableDirectiveLocation : one of\n   *   `QUERY`\n   *   `MUTATION`\n   *   `SUBSCRIPTION`\n   *   `FIELD`\n   *   `FRAGMENT_DEFINITION`\n   *   `FRAGMENT_SPREAD`\n   *   `INLINE_FRAGMENT`\n   *\n   * TypeSystemDirectiveLocation : one of\n   *   `SCHEMA`\n   *   `SCALAR`\n   *   `OBJECT`\n   *   `FIELD_DEFINITION`\n   *   `ARGUMENT_DEFINITION`\n   *   `INTERFACE`\n   *   `UNION`\n   *   `ENUM`\n   *   `ENUM_VALUE`\n   *   `INPUT_OBJECT`\n   *   `INPUT_FIELD_DEFINITION`\n   */\n\n  parseDirectiveLocation() {\n    const start = this._lexer.token;\n    const name = this.parseName();\n\n    if (Object.prototype.hasOwnProperty.call(DirectiveLocation, name.value)) {\n      return name;\n    }\n\n    throw this.unexpected(start);\n  } // Core parsing utility functions\n\n  /**\n   * Returns a node that, if configured to do so, sets a \"loc\" field as a\n   * location object, used to identify the place in the source that created a\n   * given parsed object.\n   */\n\n  node(startToken, node) {\n    if (this._options.noLocation !== true) {\n      node.loc = new Location(\n        startToken,\n        this._lexer.lastToken,\n        this._lexer.source,\n      );\n    }\n\n    return node;\n  }\n  /**\n   * Determines if the next token is of a given kind\n   */\n\n  peek(kind) {\n    return this._lexer.token.kind === kind;\n  }\n  /**\n   * If the next token is of the given kind, return that token after advancing the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n\n  expectToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this.advanceLexer();\n      return token;\n    }\n\n    throw syntaxError(\n      this._lexer.source,\n      token.start,\n      `Expected ${getTokenKindDesc(kind)}, found ${getTokenDesc(token)}.`,\n    );\n  }\n  /**\n   * If the next token is of the given kind, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n\n  expectOptionalToken(kind) {\n    const token = this._lexer.token;\n\n    if (token.kind === kind) {\n      this.advanceLexer();\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * If the next token is a given keyword, advance the lexer.\n   * Otherwise, do not change the parser state and throw an error.\n   */\n\n  expectKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this.advanceLexer();\n    } else {\n      throw syntaxError(\n        this._lexer.source,\n        token.start,\n        `Expected \"${value}\", found ${getTokenDesc(token)}.`,\n      );\n    }\n  }\n  /**\n   * If the next token is a given keyword, return \"true\" after advancing the lexer.\n   * Otherwise, do not change the parser state and return \"false\".\n   */\n\n  expectOptionalKeyword(value) {\n    const token = this._lexer.token;\n\n    if (token.kind === TokenKind.NAME && token.value === value) {\n      this.advanceLexer();\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * Helper function for creating an error when an unexpected lexed token is encountered.\n   */\n\n  unexpected(atToken) {\n    const token =\n      atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n    return syntaxError(\n      this._lexer.source,\n      token.start,\n      `Unexpected ${getTokenDesc(token)}.`,\n    );\n  }\n  /**\n   * Returns a possibly empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  any(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const nodes = [];\n\n    while (!this.expectOptionalToken(closeKind)) {\n      nodes.push(parseFn.call(this));\n    }\n\n    return nodes;\n  }\n  /**\n   * Returns a list of parse nodes, determined by the parseFn.\n   * It can be empty only if open token is missing otherwise it will always return non-empty list\n   * that begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  optionalMany(openKind, parseFn, closeKind) {\n    if (this.expectOptionalToken(openKind)) {\n      const nodes = [];\n\n      do {\n        nodes.push(parseFn.call(this));\n      } while (!this.expectOptionalToken(closeKind));\n\n      return nodes;\n    }\n\n    return [];\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n   * Advances the parser to the next lex token after the closing token.\n   */\n\n  many(openKind, parseFn, closeKind) {\n    this.expectToken(openKind);\n    const nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (!this.expectOptionalToken(closeKind));\n\n    return nodes;\n  }\n  /**\n   * Returns a non-empty list of parse nodes, determined by the parseFn.\n   * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n   * Advances the parser to the next lex token after last item in the list.\n   */\n\n  delimitedMany(delimiterKind, parseFn) {\n    this.expectOptionalToken(delimiterKind);\n    const nodes = [];\n\n    do {\n      nodes.push(parseFn.call(this));\n    } while (this.expectOptionalToken(delimiterKind));\n\n    return nodes;\n  }\n\n  advanceLexer() {\n    const { maxTokens } = this._options;\n\n    const token = this._lexer.advance();\n\n    if (token.kind !== TokenKind.EOF) {\n      ++this._tokenCounter;\n\n      if (maxTokens !== undefined && this._tokenCounter > maxTokens) {\n        throw syntaxError(\n          this._lexer.source,\n          token.start,\n          `Document contains more that ${maxTokens} tokens. Parsing aborted.`,\n        );\n      }\n    }\n  }\n}\n/**\n * A helper function to describe a token as a string for debugging.\n */\n\nfunction getTokenDesc(token) {\n  const value = token.value;\n  return getTokenKindDesc(token.kind) + (value != null ? ` \"${value}\"` : '');\n}\n/**\n * A helper function to describe a token kind as a string for debugging.\n */\n\nfunction getTokenKindDesc(kind) {\n  return isPunctuatorTokenKind(kind) ? `\"${kind}\"` : kind;\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 = wrap('(', join(node.variableDefinitions, ', '), ')');\n      const prefix = 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 }) =>\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, typeCondition, variableDefinitions, directives, selectionSet }, // Note: fragment variable definitions are experimental and may be changed\n    ) =>\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};\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 { parse, print } from 'graphql';\n/**\n * helpers\n */\nconst extractOperationName = (document) => {\n    let operationName = undefined;\n    const operationDefinitions = document.definitions.filter((definition) => definition.kind === `OperationDefinition`);\n    if (operationDefinitions.length === 1) {\n        operationName = operationDefinitions[0]?.name?.value;\n    }\n    return operationName;\n};\nexport const resolveRequestDocument = (document) => {\n    if (typeof document === `string`) {\n        let operationName = undefined;\n        try {\n            const parsedDocument = parse(document);\n            operationName = extractOperationName(parsedDocument);\n        }\n        catch (err) {\n            // Failed parsing the document, the operationName will be undefined\n        }\n        return { query: document, operationName };\n    }\n    const operationName = extractOperationName(document);\n    return { query: print(document), operationName };\n};\n//# sourceMappingURL=resolveRequestDocument.js.map","export class ClientError extends Error {\n    constructor(response, request) {\n        const message = `${ClientError.extractMessage(response)}: ${JSON.stringify({\n            response,\n            request,\n        })}`;\n        super(message);\n        Object.setPrototypeOf(this, ClientError.prototype);\n        this.response = response;\n        this.request = request;\n        // this is needed as Safari doesn't support .captureStackTrace\n        if (typeof Error.captureStackTrace === `function`) {\n            Error.captureStackTrace(this, ClientError);\n        }\n    }\n    static extractMessage(response) {\n        return response.errors?.[0]?.message ?? `GraphQL Error (Code: ${response.status})`;\n    }\n}\n//# sourceMappingURL=types.js.map","var global = typeof self !== 'undefined' ? self : this;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\nvar irrelevant = (function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n})({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\n","import { defaultJsonSerializer } from './defaultJsonSerializer.js';\nimport { HeadersInstanceToPlainObject, uppercase } from './helpers.js';\nimport { parseBatchRequestArgs, parseRawRequestArgs, parseRawRequestExtendedArgs, parseRequestArgs, parseRequestExtendedArgs, } from './parseArgs.js';\nimport { resolveRequestDocument } from './resolveRequestDocument.js';\nimport { ClientError, } from './types.js';\nimport crossFetch, * as CrossFetch from 'cross-fetch';\n/**\n * Convert the given headers configuration into a plain object.\n */\nconst resolveHeaders = (headers) => {\n    let oHeaders = {};\n    if (headers) {\n        if ((typeof Headers !== `undefined` && headers instanceof Headers) ||\n            (CrossFetch && CrossFetch.Headers && headers instanceof CrossFetch.Headers)) {\n            oHeaders = HeadersInstanceToPlainObject(headers);\n        }\n        else if (Array.isArray(headers)) {\n            headers.forEach(([name, value]) => {\n                if (name && value !== undefined) {\n                    oHeaders[name] = value;\n                }\n            });\n        }\n        else {\n            oHeaders = headers;\n        }\n    }\n    return oHeaders;\n};\n/**\n * Clean a GraphQL document to send it via a GET query\n */\nconst cleanQuery = (str) => str.replace(/([\\s,]|#[^\\n\\r]+)+/g, ` `).trim();\n/**\n * Create query string for GraphQL request\n */\nconst buildRequestConfig = (params) => {\n    if (!Array.isArray(params.query)) {\n        const params_ = params;\n        const search = [`query=${encodeURIComponent(cleanQuery(params_.query))}`];\n        if (params.variables) {\n            search.push(`variables=${encodeURIComponent(params_.jsonSerializer.stringify(params_.variables))}`);\n        }\n        if (params_.operationName) {\n            search.push(`operationName=${encodeURIComponent(params_.operationName)}`);\n        }\n        return search.join(`&`);\n    }\n    if (typeof params.variables !== `undefined` && !Array.isArray(params.variables)) {\n        throw new Error(`Cannot create query with given variable type, array expected`);\n    }\n    // Batch support\n    const params_ = params;\n    const payload = params.query.reduce((acc, currentQuery, index) => {\n        acc.push({\n            query: cleanQuery(currentQuery),\n            variables: params_.variables ? params_.jsonSerializer.stringify(params_.variables[index]) : undefined,\n        });\n        return acc;\n    }, []);\n    return `query=${encodeURIComponent(params_.jsonSerializer.stringify(payload))}`;\n};\nconst createHttpMethodFetcher = (method) => async (params) => {\n    const { url, query, variables, operationName, fetch, fetchOptions, middleware } = params;\n    const headers = { ...params.headers };\n    let queryParams = ``;\n    let body = undefined;\n    if (method === `POST`) {\n        body = createRequestBody(query, variables, operationName, fetchOptions.jsonSerializer);\n        if (typeof body === `string`) {\n            // @ts-expect-error todo\n            headers[`Content-Type`] = `application/json`;\n        }\n    }\n    else {\n        // @ts-expect-error todo needs ADT for TS to understand the different states\n        queryParams = buildRequestConfig({\n            query,\n            variables,\n            operationName,\n            jsonSerializer: fetchOptions.jsonSerializer ?? defaultJsonSerializer,\n        });\n    }\n    const init = {\n        method,\n        headers,\n        body,\n        ...fetchOptions,\n    };\n    let urlResolved = url;\n    let initResolved = init;\n    if (middleware) {\n        const result = await Promise.resolve(middleware({ ...init, url, operationName, variables }));\n        const { url: urlNew, ...initNew } = result;\n        urlResolved = urlNew;\n        initResolved = initNew;\n    }\n    if (queryParams) {\n        urlResolved = `${urlResolved}?${queryParams}`;\n    }\n    return await fetch(urlResolved, initResolved);\n};\n/**\n * GraphQL Client.\n */\nclass GraphQLClient {\n    constructor(url, requestConfig = {}) {\n        this.url = url;\n        this.requestConfig = requestConfig;\n        /**\n         * Send a GraphQL query to the server.\n         */\n        this.rawRequest = async (...args) => {\n            const [queryOrOptions, variables, requestHeaders] = args;\n            const rawRequestOptions = parseRawRequestArgs(queryOrOptions, variables, requestHeaders);\n            const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n            const { url } = this;\n            if (rawRequestOptions.signal !== undefined) {\n                fetchOptions.signal = rawRequestOptions.signal;\n            }\n            const { operationName } = resolveRequestDocument(rawRequestOptions.query);\n            return makeRequest({\n                url,\n                query: rawRequestOptions.query,\n                variables: rawRequestOptions.variables,\n                headers: {\n                    ...resolveHeaders(callOrIdentity(headers)),\n                    ...resolveHeaders(rawRequestOptions.requestHeaders),\n                },\n                operationName,\n                fetch,\n                method,\n                fetchOptions,\n                middleware: requestMiddleware,\n            })\n                .then((response) => {\n                if (responseMiddleware) {\n                    responseMiddleware(response);\n                }\n                return response;\n            })\n                .catch((error) => {\n                if (responseMiddleware) {\n                    responseMiddleware(error);\n                }\n                throw error;\n            });\n        };\n    }\n    async request(documentOrOptions, ...variablesAndRequestHeaders) {\n        const [variables, requestHeaders] = variablesAndRequestHeaders;\n        const requestOptions = parseRequestArgs(documentOrOptions, variables, requestHeaders);\n        const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n        const { url } = this;\n        if (requestOptions.signal !== undefined) {\n            fetchOptions.signal = requestOptions.signal;\n        }\n        const { query, operationName } = resolveRequestDocument(requestOptions.document);\n        return makeRequest({\n            url,\n            query,\n            variables: requestOptions.variables,\n            headers: {\n                ...resolveHeaders(callOrIdentity(headers)),\n                ...resolveHeaders(requestOptions.requestHeaders),\n            },\n            operationName,\n            fetch,\n            method,\n            fetchOptions,\n            middleware: requestMiddleware,\n        })\n            .then((response) => {\n            if (responseMiddleware) {\n                responseMiddleware(response);\n            }\n            return response.data;\n        })\n            .catch((error) => {\n            if (responseMiddleware) {\n                responseMiddleware(error);\n            }\n            throw error;\n        });\n    }\n    // prettier-ignore\n    batchRequests(documentsOrOptions, requestHeaders) {\n        const batchRequestOptions = parseBatchRequestArgs(documentsOrOptions, requestHeaders);\n        const { headers, ...fetchOptions } = this.requestConfig;\n        if (batchRequestOptions.signal !== undefined) {\n            fetchOptions.signal = batchRequestOptions.signal;\n        }\n        const queries = batchRequestOptions.documents.map(({ document }) => resolveRequestDocument(document).query);\n        const variables = batchRequestOptions.documents.map(({ variables }) => variables);\n        return makeRequest({\n            url: this.url,\n            query: queries,\n            // @ts-expect-error TODO reconcile batch variables into system.\n            variables,\n            headers: {\n                ...resolveHeaders(callOrIdentity(headers)),\n                ...resolveHeaders(batchRequestOptions.requestHeaders),\n            },\n            operationName: undefined,\n            fetch: this.requestConfig.fetch ?? crossFetch,\n            method: this.requestConfig.method || `POST`,\n            fetchOptions,\n            middleware: this.requestConfig.requestMiddleware,\n        })\n            .then((response) => {\n            if (this.requestConfig.responseMiddleware) {\n                this.requestConfig.responseMiddleware(response);\n            }\n            return response.data;\n        })\n            .catch((error) => {\n            if (this.requestConfig.responseMiddleware) {\n                this.requestConfig.responseMiddleware(error);\n            }\n            throw error;\n        });\n    }\n    setHeaders(headers) {\n        this.requestConfig.headers = headers;\n        return this;\n    }\n    /**\n     * Attach a header to the client. All subsequent requests will have this header.\n     */\n    setHeader(key, value) {\n        const { headers } = this.requestConfig;\n        if (headers) {\n            // todo what if headers is in nested array form... ?\n            //@ts-expect-error todo\n            headers[key] = value;\n        }\n        else {\n            this.requestConfig.headers = { [key]: value };\n        }\n        return this;\n    }\n    /**\n     * Change the client endpoint. All subsequent requests will send to this endpoint.\n     */\n    setEndpoint(value) {\n        this.url = value;\n        return this;\n    }\n}\nconst makeRequest = async (params) => {\n    const { query, variables, fetchOptions } = params;\n    const fetcher = createHttpMethodFetcher(uppercase(params.method ?? `post`));\n    const isBatchingQuery = Array.isArray(params.query);\n    const response = await fetcher(params);\n    const result = await getResult(response, fetchOptions.jsonSerializer ?? defaultJsonSerializer);\n    const successfullyReceivedData = Array.isArray(result)\n        ? !result.some(({ data }) => !data)\n        : Boolean(result.data);\n    const successfullyPassedErrorPolicy = Array.isArray(result) ||\n        !result.errors ||\n        (Array.isArray(result.errors) && !result.errors.length) ||\n        fetchOptions.errorPolicy === `all` ||\n        fetchOptions.errorPolicy === `ignore`;\n    if (response.ok && successfullyPassedErrorPolicy && successfullyReceivedData) {\n        // @ts-expect-error TODO fixme\n        const { errors: _, ...rest } = Array.isArray(result) ? result : result;\n        const data = fetchOptions.errorPolicy === `ignore` ? rest : result;\n        const dataEnvelope = isBatchingQuery ? { data } : data;\n        // @ts-expect-error TODO\n        return {\n            ...dataEnvelope,\n            headers: response.headers,\n            status: response.status,\n        };\n    }\n    else {\n        const errorResult = typeof result === `string`\n            ? {\n                error: result,\n            }\n            : result;\n        throw new ClientError(\n        // @ts-expect-error TODO\n        { ...errorResult, status: response.status, headers: response.headers }, { query, variables });\n    }\n};\n/**\n * Send a GraphQL Query to the GraphQL server for execution.\n */\nconst rawRequest = async (...args) => {\n    const [urlOrOptions, query, ...variablesAndRequestHeaders] = args;\n    const requestOptions = parseRawRequestExtendedArgs(urlOrOptions, query, ...variablesAndRequestHeaders);\n    const client = new GraphQLClient(requestOptions.url);\n    return client.rawRequest({\n        ...requestOptions,\n    });\n};\n// prettier-ignore\n// eslint-disable-next-line\nasync function request(urlOrOptions, document, ...variablesAndRequestHeaders) {\n    const requestOptions = parseRequestExtendedArgs(urlOrOptions, document, ...variablesAndRequestHeaders);\n    const client = new GraphQLClient(requestOptions.url);\n    return client.request({\n        ...requestOptions,\n    });\n}\n/**\n * Send a batch of GraphQL Document to the GraphQL server for execution.\n *\n * @example\n *\n * ```ts\n * // You can pass a raw string\n *\n * await batchRequests('https://foo.bar/graphql', [\n * {\n *  query: `\n *   {\n *     query {\n *       users\n *     }\n *   }`\n * },\n * {\n *   query: `\n *   {\n *     query {\n *       users\n *     }\n *   }`\n * }])\n *\n * // You can also pass a GraphQL DocumentNode as query. Convenient if you\n * // are using graphql-tag package.\n *\n * import gql from 'graphql-tag'\n *\n * await batchRequests('https://foo.bar/graphql', [{ query: gql`...` }])\n * ```\n */\nconst batchRequests = async (...args) => {\n    const params = parseBatchRequestsArgsExtended(args);\n    const client = new GraphQLClient(params.url);\n    return client.batchRequests(params);\n};\nconst parseBatchRequestsArgsExtended = (args) => {\n    if (args.length === 1) {\n        return args[0];\n    }\n    else {\n        return {\n            url: args[0],\n            documents: args[1],\n            requestHeaders: args[2],\n            signal: undefined,\n        };\n    }\n};\nconst createRequestBody = (query, variables, operationName, jsonSerializer) => {\n    const jsonSerializer_ = jsonSerializer ?? defaultJsonSerializer;\n    if (!Array.isArray(query)) {\n        return jsonSerializer_.stringify({ query, variables, operationName });\n    }\n    if (typeof variables !== `undefined` && !Array.isArray(variables)) {\n        throw new Error(`Cannot create request body with given variable type, array expected`);\n    }\n    // Batch support\n    const payload = query.reduce((acc, currentQuery, index) => {\n        acc.push({ query: currentQuery, variables: variables ? variables[index] : undefined });\n        return acc;\n    }, []);\n    return jsonSerializer_.stringify(payload);\n};\nconst getResult = async (response, jsonSerializer) => {\n    let contentType;\n    response.headers.forEach((value, key) => {\n        if (key.toLowerCase() === `content-type`) {\n            contentType = value;\n        }\n    });\n    if (contentType &&\n        (contentType.toLowerCase().startsWith(`application/json`) ||\n            contentType.toLowerCase().startsWith(`application/graphql+json`) ||\n            contentType.toLowerCase().startsWith(`application/graphql-response+json`))) {\n        return jsonSerializer.parse(await response.text());\n    }\n    else {\n        return response.text();\n    }\n};\nconst callOrIdentity = (value) => {\n    return typeof value === `function` ? value() : value;\n};\n/**\n * Convenience passthrough template tag to get the benefits of tooling for the gql template tag. This does not actually parse the input into a GraphQL DocumentNode like graphql-tag package does. It just returns the string with any variables given interpolated. Can save you a bit of performance and having to install another package.\n *\n * @example\n * ```\n * import { gql } from 'graphql-request'\n *\n * await request('https://foo.bar/graphql', gql`...`)\n * ```\n *\n * @remarks\n *\n * Several tools in the Node GraphQL ecosystem are hardcoded to specially treat any template tag named \"gql\". For example see this prettier issue: https://github.com/prettier/prettier/issues/4360. Using this template tag has no runtime effect beyond variable interpolation.\n */\nexport const gql = (chunks, ...variables) => {\n    return chunks.reduce((acc, chunk, index) => `${acc}${chunk}${index in variables ? String(variables[index]) : ``}`, ``);\n};\nexport { GraphQLWebSocketClient } from './graphql-ws.js';\nexport { resolveRequestDocument } from './resolveRequestDocument.js';\nexport { batchRequests, ClientError, GraphQLClient, rawRequest, request, };\nexport default request;\n//# sourceMappingURL=index.js.map","exports = module.exports = stringify\nexports.getSerialize = serializer\n\nfunction stringify(obj, replacer, spaces, cycleReplacer) {\n  return JSON.stringify(obj, serializer(replacer, cycleReplacer), spaces)\n}\n\nfunction serializer(replacer, cycleReplacer) {\n  var stack = [], keys = []\n\n  if (cycleReplacer == null) cycleReplacer = function(key, value) {\n    if (stack[0] === value) return \"[Circular ~]\"\n    return \"[Circular ~.\" + keys.slice(0, stack.indexOf(value)).join(\".\") + \"]\"\n  }\n\n  return function(key, value) {\n    if (stack.length > 0) {\n      var thisPos = stack.indexOf(this)\n      ~thisPos ? stack.splice(thisPos + 1) : stack.push(this)\n      ~thisPos ? keys.splice(thisPos, Infinity, key) : keys.push(key)\n      if (~stack.indexOf(value)) value = cycleReplacer.call(this, key, value)\n    }\n    else stack.push(value)\n\n    return replacer == null ? value : replacer.call(this, key, value)\n  }\n}\n","/**\n *  The amount of time to wait until sending the first payload.\n */\nexport const FIRST_SEND_FREQUENCY = 1000\n/**\n * The amount of time between sending the client-side payload to Highlight backend client.\n * In milliseconds.\n */\nexport const SEND_FREQUENCY = 1000 * 2\n\n/**\n * Maximum length of a session\n */\nexport const MAX_SESSION_LENGTH = 4 * 60 * 60 * 1000\n\n/**\n * The amount of time allowed after the last push before creating a new session.\n * In milliseconds.\n */\nexport const SESSION_PUSH_THRESHOLD = 15 * 60 * 1000\n\n/*\n * Don't take another full snapshot unless it's been at least\n * 4 minutes AND the cumulative payload size since the last\n * snapshot is > 10MB.\n */\nexport const SNAPSHOT_SETTINGS = {\n\tnormal: {\n\t\tbytes: 10e6,\n\t\ttime: 4 * 60 * 1000,\n\t},\n\tcanvas: {\n\t\tbytes: 16e6,\n\t\ttime: 5000,\n\t},\n} as const\n\n// Debounce duplicate visibility events\nexport const VISIBILITY_DEBOUNCE_MS = 100\n\n// Max allowed time to upload to public graph before triggering recording kill switch\nexport const UPLOAD_TIMEOUT = 1000 * 15\n\nexport const HIGHLIGHT_URL = 'app.highlight.io'\nexport const LAUNCHDARKLY_URL = 'https://app.launchdarkly.com'\nexport const LAUNCHDARKLY_ENV_APPS = {\n\t'observability.ld-stg.launchdarkly.com': 'ld-stg.launchdarkly.com',\n\t'observability.app.launchdarkly.com': 'app.launchdarkly.com',\n\t'observability.app.ld.catamorphic.com': 'app.ld.catamorphic.com',\n} as const\nexport const LAUNCHDARKLY_PATH_PREFIX = '/projects/default'\nexport const LAUNCHDARKLY_BACKEND_REGEX = /pub\\.(?<domain>.+)/\n","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n  return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n  ownKeys = Object.getOwnPropertyNames || function (o) {\n    var ar = [];\n    for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n    return ar;\n  };\n  return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  var r, s = 0;\n  function next() {\n    while (r = env.stack.pop()) {\n      try {\n        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n        if (r.dispose) {\n          var result = r.dispose.call(r.value);\n          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n        }\n        else s |= 1;\n      }\n      catch (e) {\n        fail(e);\n      }\n    }\n    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n  if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n      return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n          return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n      });\n  }\n  return path;\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __esDecorate,\n  __runInitializers,\n  __propKey,\n  __setFunctionName,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n  __rewriteRelativeImportExtension,\n};\n","import { __assign } from \"tslib\";\nimport { parse } from 'graphql';\nvar docCache = new Map();\nvar fragmentSourceMap = new Map();\nvar printFragmentWarnings = true;\nvar experimentalFragmentVariables = false;\nfunction normalize(string) {\n    return string.replace(/[\\s,]+/g, ' ').trim();\n}\nfunction cacheKeyFromLoc(loc) {\n    return normalize(loc.source.body.substring(loc.start, loc.end));\n}\nfunction processFragments(ast) {\n    var seenKeys = new Set();\n    var definitions = [];\n    ast.definitions.forEach(function (fragmentDefinition) {\n        if (fragmentDefinition.kind === 'FragmentDefinition') {\n            var fragmentName = fragmentDefinition.name.value;\n            var sourceKey = cacheKeyFromLoc(fragmentDefinition.loc);\n            var sourceKeySet = fragmentSourceMap.get(fragmentName);\n            if (sourceKeySet && !sourceKeySet.has(sourceKey)) {\n                if (printFragmentWarnings) {\n                    console.warn(\"Warning: fragment with name \" + fragmentName + \" already exists.\\n\"\n                        + \"graphql-tag enforces all fragment names across your application to be unique; read more about\\n\"\n                        + \"this in the docs: http://dev.apollodata.com/core/fragments.html#unique-names\");\n                }\n            }\n            else if (!sourceKeySet) {\n                fragmentSourceMap.set(fragmentName, sourceKeySet = new Set);\n            }\n            sourceKeySet.add(sourceKey);\n            if (!seenKeys.has(sourceKey)) {\n                seenKeys.add(sourceKey);\n                definitions.push(fragmentDefinition);\n            }\n        }\n        else {\n            definitions.push(fragmentDefinition);\n        }\n    });\n    return __assign(__assign({}, ast), { definitions: definitions });\n}\nfunction stripLoc(doc) {\n    var workSet = new Set(doc.definitions);\n    workSet.forEach(function (node) {\n        if (node.loc)\n            delete node.loc;\n        Object.keys(node).forEach(function (key) {\n            var value = node[key];\n            if (value && typeof value === 'object') {\n                workSet.add(value);\n            }\n        });\n    });\n    var loc = doc.loc;\n    if (loc) {\n        delete loc.startToken;\n        delete loc.endToken;\n    }\n    return doc;\n}\nfunction parseDocument(source) {\n    var cacheKey = normalize(source);\n    if (!docCache.has(cacheKey)) {\n        var parsed = parse(source, {\n            experimentalFragmentVariables: experimentalFragmentVariables,\n            allowLegacyFragmentVariables: experimentalFragmentVariables\n        });\n        if (!parsed || parsed.kind !== 'Document') {\n            throw new Error('Not a valid GraphQL document.');\n        }\n        docCache.set(cacheKey, stripLoc(processFragments(parsed)));\n    }\n    return docCache.get(cacheKey);\n}\nexport function gql(literals) {\n    var args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        args[_i - 1] = arguments[_i];\n    }\n    if (typeof literals === 'string') {\n        literals = [literals];\n    }\n    var result = literals[0];\n    args.forEach(function (arg, i) {\n        if (arg && arg.kind === 'Document') {\n            result += arg.loc.source.body;\n        }\n        else {\n            result += arg;\n        }\n        result += literals[i + 1];\n    });\n    return parseDocument(result);\n}\nexport function resetCaches() {\n    docCache.clear();\n    fragmentSourceMap.clear();\n}\nexport function disableFragmentWarnings() {\n    printFragmentWarnings = false;\n}\nexport function enableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = true;\n}\nexport function disableExperimentalFragmentVariables() {\n    experimentalFragmentVariables = false;\n}\nvar extras = {\n    gql: gql,\n    resetCaches: resetCaches,\n    disableFragmentWarnings: disableFragmentWarnings,\n    enableExperimentalFragmentVariables: enableExperimentalFragmentVariables,\n    disableExperimentalFragmentVariables: disableExperimentalFragmentVariables\n};\n(function (gql_1) {\n    gql_1.gql = extras.gql, gql_1.resetCaches = extras.resetCaches, gql_1.disableFragmentWarnings = extras.disableFragmentWarnings, gql_1.enableExperimentalFragmentVariables = extras.enableExperimentalFragmentVariables, gql_1.disableExperimentalFragmentVariables = extras.disableExperimentalFragmentVariables;\n})(gql || (gql = {}));\ngql[\"default\"] = gql;\nexport default gql;\n//# sourceMappingURL=index.js.map","import { GraphQLClient } from 'graphql-request'\nimport { GraphQLClientRequestHeaders } from 'graphql-request/build/cjs/types'\nimport gql from 'graphql-tag'\nexport type Maybe<T> = T | null\nexport type InputMaybe<T> = Maybe<T>\nexport type Exact<T extends { [key: string]: unknown }> = {\n\t[K in keyof T]: T[K]\n}\nexport type MakeOptional<T, K extends keyof T> = Omit<T, K> & {\n\t[SubKey in K]?: Maybe<T[SubKey]>\n}\nexport type MakeMaybe<T, K extends keyof T> = Omit<T, K> & {\n\t[SubKey in K]: Maybe<T[SubKey]>\n}\nexport type MakeEmpty<\n\tT extends { [key: string]: unknown },\n\tK extends keyof T,\n> = { [_ in K]?: never }\nexport type Incremental<T> =\n\t| T\n\t| {\n\t\t\t[P in keyof T]?: P extends ' $fragmentName' | '__typename'\n\t\t\t\t? T[P]\n\t\t\t\t: never\n\t  }\n/** All built-in and custom scalars, mapped to their actual values */\nexport type Scalars = {\n\tID: { input: string; output: string }\n\tString: { input: string; output: string }\n\tBoolean: { input: boolean; output: boolean }\n\tInt: { input: number; output: number }\n\tFloat: { input: number; output: number }\n\tAny: { input: any; output: any }\n\tInt64: { input: any; output: any }\n\tInt64ID: { input: any; output: any }\n\tTimestamp: { input: any; output: any }\n}\n\n/** An attribute match configuration which can match an attribute key and value. */\nexport type AttributeMatchConfig = {\n\t__typename?: 'AttributeMatchConfig'\n\tattribute: MatchConfig\n\tkey: MatchConfig\n}\n\nexport type BackendErrorObjectInput = {\n\tenvironment: Scalars['String']['input']\n\tevent: Scalars['String']['input']\n\tid?: InputMaybe<Scalars['String']['input']>\n\tlog_cursor?: InputMaybe<Scalars['String']['input']>\n\tpayload?: InputMaybe<Scalars['String']['input']>\n\trequest_id?: InputMaybe<Scalars['String']['input']>\n\tservice: ServiceInput\n\tsession_secure_id?: InputMaybe<Scalars['String']['input']>\n\tsource: Scalars['String']['input']\n\tspan_id?: InputMaybe<Scalars['String']['input']>\n\tstackTrace: Scalars['String']['input']\n\ttimestamp: Scalars['Timestamp']['input']\n\ttrace_id?: InputMaybe<Scalars['String']['input']>\n\ttype: Scalars['String']['input']\n\turl: Scalars['String']['input']\n}\n\nexport type ErrorObjectInput = {\n\tcolumnNumber: Scalars['Int']['input']\n\tevent: Scalars['String']['input']\n\tid?: InputMaybe<Scalars['String']['input']>\n\tlineNumber: Scalars['Int']['input']\n\tpayload?: InputMaybe<Scalars['String']['input']>\n\tsource: Scalars['String']['input']\n\tstackTrace: Array<InputMaybe<StackFrameInput>>\n\ttimestamp: Scalars['Timestamp']['input']\n\ttype: Scalars['String']['input']\n\turl: Scalars['String']['input']\n}\n\nexport type InitializeSessionResponse = {\n\t__typename?: 'InitializeSessionResponse'\n\tproject_id: Scalars['ID']['output']\n\tsampling?: Maybe<SamplingConfig>\n\tsecure_id: Scalars['String']['output']\n}\n\n/**\n * A match based log sampling configuration. A log matches if each specified matching configuration matches.\n * If no matching configuration is specified, then all spans will match.\n * The sampling ratio will be applied to all matching spans.\n */\nexport type LogSamplingConfig = {\n\t__typename?: 'LogSamplingConfig'\n\t/**\n\t * A list of attribute match configs.\n\t * In order to match each attribute listed must match. This is an implicit AND operation.\n\t */\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\t/** Matches against the log message. */\n\tmessage?: Maybe<MatchConfig>\n\t/**\n\t * The ratio of logs to sample. Expressed in the form 1/n. So if the ratio is 10, then 1 out of\n\t * every 10 logs will be sampled. Setting the ratio to 0 will disable sampling for the log.\n\t */\n\tsamplingRatio: Scalars['Int']['output']\n\t/** Matches against the severity of the log. */\n\tseverityText?: Maybe<MatchConfig>\n}\n\n/**\n * A match configuration. Each field of this type represents a different type of match\n * configuration. One and only 1 field should be populated.\n *\n * This is effectively a sum type/discriminated union, but isn't implemented as such to avoid\n * this bug: https://github.com/99designs/gqlgen/issues/2741\n */\nexport type MatchConfig = {\n\t__typename?: 'MatchConfig'\n\t/** A match configuration which does an exact match against any value. */\n\tmatchValue?: Maybe<Scalars['Any']['output']>\n\t/**\n\t * A match configuration which matches against a regular expression.\n\t * Can only match string attributes.\n\t */\n\tregexValue?: Maybe<Scalars['String']['output']>\n}\n\nexport type MetricInput = {\n\tcategory?: InputMaybe<Scalars['String']['input']>\n\tgroup?: InputMaybe<Scalars['String']['input']>\n\tname: Scalars['String']['input']\n\tparent_span_id?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id: Scalars['String']['input']\n\tspan_id?: InputMaybe<Scalars['String']['input']>\n\ttags?: InputMaybe<Array<MetricTag>>\n\ttimestamp: Scalars['Timestamp']['input']\n\ttrace_id?: InputMaybe<Scalars['String']['input']>\n\tvalue: Scalars['Float']['input']\n}\n\nexport type MetricTag = {\n\tname: Scalars['String']['input']\n\tvalue: Scalars['String']['input']\n}\n\nexport type Mutation = {\n\t__typename?: 'Mutation'\n\taddSessionFeedback: Scalars['String']['output']\n\taddSessionProperties: Scalars['String']['output']\n\tidentifySession: Scalars['String']['output']\n\tinitializeSession: InitializeSessionResponse\n\tmarkBackendSetup?: Maybe<Scalars['Any']['output']>\n\tpushBackendPayload?: Maybe<Scalars['Any']['output']>\n\tpushMetrics: Scalars['Int']['output']\n\tpushPayload: Scalars['Int']['output']\n\tpushPayloadCompressed?: Maybe<Scalars['Any']['output']>\n\tpushSessionEvents?: Maybe<Scalars['Any']['output']>\n}\n\nexport type MutationAddSessionFeedbackArgs = {\n\tsession_secure_id: Scalars['String']['input']\n\ttimestamp: Scalars['Timestamp']['input']\n\tuser_email?: InputMaybe<Scalars['String']['input']>\n\tuser_name?: InputMaybe<Scalars['String']['input']>\n\tverbatim: Scalars['String']['input']\n}\n\nexport type MutationAddSessionPropertiesArgs = {\n\tproperties_object?: InputMaybe<Scalars['Any']['input']>\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationIdentifySessionArgs = {\n\tsession_secure_id: Scalars['String']['input']\n\tuser_identifier: Scalars['String']['input']\n\tuser_object?: InputMaybe<Scalars['Any']['input']>\n}\n\nexport type MutationInitializeSessionArgs = {\n\tappVersion?: InputMaybe<Scalars['String']['input']>\n\tclientConfig: Scalars['String']['input']\n\tclientVersion: Scalars['String']['input']\n\tclient_id: Scalars['String']['input']\n\tdisable_session_recording?: InputMaybe<Scalars['Boolean']['input']>\n\tenable_recording_network_contents: Scalars['Boolean']['input']\n\tenable_strict_privacy: Scalars['Boolean']['input']\n\tenvironment: Scalars['String']['input']\n\tfingerprint: Scalars['String']['input']\n\tfirstloadVersion: Scalars['String']['input']\n\tnetwork_recording_domains?: InputMaybe<Array<Scalars['String']['input']>>\n\torganization_verbose_id: Scalars['String']['input']\n\tprivacy_setting?: InputMaybe<Scalars['String']['input']>\n\tserviceName?: InputMaybe<Scalars['String']['input']>\n\tsession_key?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationMarkBackendSetupArgs = {\n\tproject_id?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id?: InputMaybe<Scalars['String']['input']>\n\ttype?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushBackendPayloadArgs = {\n\terrors: Array<InputMaybe<BackendErrorObjectInput>>\n\tproject_id?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushMetricsArgs = {\n\tmetrics: Array<InputMaybe<MetricInput>>\n}\n\nexport type MutationPushPayloadArgs = {\n\terrors: Array<InputMaybe<ErrorObjectInput>>\n\tevents: ReplayEventsInput\n\thas_session_unloaded?: InputMaybe<Scalars['Boolean']['input']>\n\thighlight_logs?: InputMaybe<Scalars['String']['input']>\n\tis_beacon?: InputMaybe<Scalars['Boolean']['input']>\n\tmessages: Scalars['String']['input']\n\tpayload_id?: InputMaybe<Scalars['ID']['input']>\n\tresources: Scalars['String']['input']\n\tsession_secure_id: Scalars['String']['input']\n\tweb_socket_events?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushPayloadCompressedArgs = {\n\tdata: Scalars['String']['input']\n\tpayload_id: Scalars['ID']['input']\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationPushSessionEventsArgs = {\n\tdata: Scalars['String']['input']\n\tpayload_id: Scalars['Int64ID']['input']\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport enum PublicGraphError {\n\tBillingQuotaExceeded = 'BillingQuotaExceeded',\n}\n\nexport type Query = {\n\t__typename?: 'Query'\n\tignore?: Maybe<Scalars['Any']['output']>\n\tsampling: SamplingConfig\n}\n\nexport type QueryIgnoreArgs = {\n\tid: Scalars['ID']['input']\n}\n\nexport type QuerySamplingArgs = {\n\torganization_verbose_id: Scalars['String']['input']\n}\n\nexport type ReplayEventInput = {\n\t_sid: Scalars['Float']['input']\n\tdata: Scalars['Any']['input']\n\ttimestamp: Scalars['Float']['input']\n\ttype: Scalars['Int']['input']\n}\n\nexport type ReplayEventsInput = {\n\tevents: Array<InputMaybe<ReplayEventInput>>\n}\n\nexport type SamplingConfig = {\n\t__typename?: 'SamplingConfig'\n\tlogs?: Maybe<Array<LogSamplingConfig>>\n\tspans?: Maybe<Array<SpanSamplingConfig>>\n}\n\nexport type ServiceInput = {\n\tname: Scalars['String']['input']\n\tversion: Scalars['String']['input']\n}\n\nexport type Session = {\n\t__typename?: 'Session'\n\tid?: Maybe<Scalars['Int64ID']['output']>\n\torganization_id: Scalars['ID']['output']\n\tproject_id: Scalars['ID']['output']\n\tsecure_id: Scalars['String']['output']\n}\n\n/** An event matcher configuration which matches span events within a span. */\nexport type SpanEventMatchConfig = {\n\t__typename?: 'SpanEventMatchConfig'\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\tname?: Maybe<MatchConfig>\n}\n\n/**\n * A match based span sampling configuration. A span matches if each specified matching configuration\n * matches.\n * If no matching configuration is specified, then all spans will match.\n * The sampling ratio will be applied to all matching spans.\n */\nexport type SpanSamplingConfig = {\n\t__typename?: 'SpanSamplingConfig'\n\t/**\n\t * A list of attribute match configs.\n\t * In order to match each attribute listed must match. This is an implicit AND operation.\n\t */\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\t/** A list of span event match configs. */\n\tevents?: Maybe<Array<SpanEventMatchConfig>>\n\tname?: Maybe<MatchConfig>\n\t/**\n\t * The ratio of spans to sample. Expressed in the form 1/n. So if the ratio is 10, then 1 out of\n\t * every 10 spans will be sampled. Setting the ratio to 0 will disable sampling for the span.\n\t */\n\tsamplingRatio: Scalars['Int']['output']\n}\n\nexport type StackFrameInput = {\n\targs?: InputMaybe<Array<InputMaybe<Scalars['Any']['input']>>>\n\tcolumnNumber?: InputMaybe<Scalars['Int']['input']>\n\tfileName?: InputMaybe<Scalars['String']['input']>\n\tfunctionName?: InputMaybe<Scalars['String']['input']>\n\tisEval?: InputMaybe<Scalars['Boolean']['input']>\n\tisNative?: InputMaybe<Scalars['Boolean']['input']>\n\tlineNumber?: InputMaybe<Scalars['Int']['input']>\n\tsource?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type PushPayloadMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tpayload_id: Scalars['ID']['input']\n\tevents: ReplayEventsInput\n\tmessages: Scalars['String']['input']\n\tresources: Scalars['String']['input']\n\tweb_socket_events: Scalars['String']['input']\n\terrors: Array<InputMaybe<ErrorObjectInput>> | InputMaybe<ErrorObjectInput>\n\tis_beacon?: InputMaybe<Scalars['Boolean']['input']>\n\thas_session_unloaded?: InputMaybe<Scalars['Boolean']['input']>\n\thighlight_logs?: InputMaybe<Scalars['String']['input']>\n}>\n\nexport type PushPayloadMutation = {\n\t__typename?: 'Mutation'\n\tpushPayload: number\n}\n\nexport type PushSessionEventsMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tpayload_id: Scalars['Int64ID']['input']\n\tdata: Scalars['String']['input']\n}>\n\nexport type PushSessionEventsMutation = {\n\t__typename?: 'Mutation'\n\tpushSessionEvents?: any | null\n}\n\nexport type IdentifySessionMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tuser_identifier: Scalars['String']['input']\n\tuser_object?: InputMaybe<Scalars['Any']['input']>\n}>\n\nexport type IdentifySessionMutation = {\n\t__typename?: 'Mutation'\n\tidentifySession: string\n}\n\nexport type AddSessionPropertiesMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tproperties_object?: InputMaybe<Scalars['Any']['input']>\n}>\n\nexport type AddSessionPropertiesMutation = {\n\t__typename?: 'Mutation'\n\taddSessionProperties: string\n}\n\nexport type PushMetricsMutationVariables = Exact<{\n\tmetrics: Array<InputMaybe<MetricInput>> | InputMaybe<MetricInput>\n}>\n\nexport type PushMetricsMutation = {\n\t__typename?: 'Mutation'\n\tpushMetrics: number\n}\n\nexport type AddSessionFeedbackMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tuser_name?: InputMaybe<Scalars['String']['input']>\n\tuser_email?: InputMaybe<Scalars['String']['input']>\n\tverbatim: Scalars['String']['input']\n\ttimestamp: Scalars['Timestamp']['input']\n}>\n\nexport type AddSessionFeedbackMutation = {\n\t__typename?: 'Mutation'\n\taddSessionFeedback: string\n}\n\nexport type MatchPartsFragment = {\n\t__typename?: 'MatchConfig'\n\tregexValue?: string | null\n\tmatchValue?: any | null\n}\n\nexport type InitializeSessionMutationVariables = Exact<{\n\tsession_secure_id: Scalars['String']['input']\n\tsession_key?: InputMaybe<Scalars['String']['input']>\n\torganization_verbose_id: Scalars['String']['input']\n\tenable_strict_privacy: Scalars['Boolean']['input']\n\tprivacy_setting: Scalars['String']['input']\n\tenable_recording_network_contents: Scalars['Boolean']['input']\n\tclientVersion: Scalars['String']['input']\n\tfirstloadVersion: Scalars['String']['input']\n\tclientConfig: Scalars['String']['input']\n\tenvironment: Scalars['String']['input']\n\tid: Scalars['String']['input']\n\tappVersion?: InputMaybe<Scalars['String']['input']>\n\tserviceName: Scalars['String']['input']\n\tclient_id: Scalars['String']['input']\n\tnetwork_recording_domains?: InputMaybe<\n\t\tArray<Scalars['String']['input']> | Scalars['String']['input']\n\t>\n\tdisable_session_recording?: InputMaybe<Scalars['Boolean']['input']>\n}>\n\nexport type InitializeSessionMutation = {\n\t__typename?: 'Mutation'\n\tinitializeSession: {\n\t\t__typename?: 'InitializeSessionResponse'\n\t\tsecure_id: string\n\t\tproject_id: string\n\t\tsampling?: {\n\t\t\t__typename?: 'SamplingConfig'\n\t\t\tspans?: Array<{\n\t\t\t\t__typename?: 'SpanSamplingConfig'\n\t\t\t\tsamplingRatio: number\n\t\t\t\tname?: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t} | null\n\t\t\t\tattributes?: Array<{\n\t\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\t\tkey: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t\tattribute: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t}> | null\n\t\t\t\tevents?: Array<{\n\t\t\t\t\t__typename?: 'SpanEventMatchConfig'\n\t\t\t\t\tname?: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t} | null\n\t\t\t\t\tattributes?: Array<{\n\t\t\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\t\t\tkey: {\n\t\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t\t}\n\t\t\t\t\t\tattribute: {\n\t\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t\t}\n\t\t\t\t\t}> | null\n\t\t\t\t}> | null\n\t\t\t}> | null\n\t\t\tlogs?: Array<{\n\t\t\t\t__typename?: 'LogSamplingConfig'\n\t\t\t\tsamplingRatio: number\n\t\t\t\tmessage?: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t} | null\n\t\t\t\tseverityText?: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t} | null\n\t\t\t\tattributes?: Array<{\n\t\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\t\tkey: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t\tattribute: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t}> | null\n\t\t\t}> | null\n\t\t} | null\n\t}\n}\n\nexport type IgnoreQueryVariables = Exact<{\n\tid: Scalars['ID']['input']\n}>\n\nexport type IgnoreQuery = { __typename?: 'Query'; ignore?: any | null }\n\nexport type GetSamplingConfigQueryVariables = Exact<{\n\torganization_verbose_id: Scalars['String']['input']\n}>\n\nexport type GetSamplingConfigQuery = {\n\t__typename?: 'Query'\n\tsampling: {\n\t\t__typename?: 'SamplingConfig'\n\t\tspans?: Array<{\n\t\t\t__typename?: 'SpanSamplingConfig'\n\t\t\tsamplingRatio: number\n\t\t\tname?: {\n\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\tregexValue?: string | null\n\t\t\t\tmatchValue?: any | null\n\t\t\t} | null\n\t\t\tattributes?: Array<{\n\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\tkey: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t}\n\t\t\t\tattribute: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t}\n\t\t\t}> | null\n\t\t\tevents?: Array<{\n\t\t\t\t__typename?: 'SpanEventMatchConfig'\n\t\t\t\tname?: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t} | null\n\t\t\t\tattributes?: Array<{\n\t\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\t\tkey: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t\tattribute: {\n\t\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t\t}\n\t\t\t\t}> | null\n\t\t\t}> | null\n\t\t}> | null\n\t\tlogs?: Array<{\n\t\t\t__typename?: 'LogSamplingConfig'\n\t\t\tsamplingRatio: number\n\t\t\tmessage?: {\n\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\tregexValue?: string | null\n\t\t\t\tmatchValue?: any | null\n\t\t\t} | null\n\t\t\tseverityText?: {\n\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\tregexValue?: string | null\n\t\t\t\tmatchValue?: any | null\n\t\t\t} | null\n\t\t\tattributes?: Array<{\n\t\t\t\t__typename?: 'AttributeMatchConfig'\n\t\t\t\tkey: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t}\n\t\t\t\tattribute: {\n\t\t\t\t\t__typename?: 'MatchConfig'\n\t\t\t\t\tregexValue?: string | null\n\t\t\t\t\tmatchValue?: any | null\n\t\t\t\t}\n\t\t\t}> | null\n\t\t}> | null\n\t}\n}\n\nexport const MatchPartsFragmentDoc = gql`\n\tfragment MatchParts on MatchConfig {\n\t\tregexValue\n\t\tmatchValue\n\t}\n`\nexport const PushPayloadDocument = gql`\n\tmutation PushPayload(\n\t\t$session_secure_id: String!\n\t\t$payload_id: ID!\n\t\t$events: ReplayEventsInput!\n\t\t$messages: String!\n\t\t$resources: String!\n\t\t$web_socket_events: String!\n\t\t$errors: [ErrorObjectInput]!\n\t\t$is_beacon: Boolean\n\t\t$has_session_unloaded: Boolean\n\t\t$highlight_logs: String\n\t) {\n\t\tpushPayload(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tpayload_id: $payload_id\n\t\t\tevents: $events\n\t\t\tmessages: $messages\n\t\t\tresources: $resources\n\t\t\tweb_socket_events: $web_socket_events\n\t\t\terrors: $errors\n\t\t\tis_beacon: $is_beacon\n\t\t\thas_session_unloaded: $has_session_unloaded\n\t\t\thighlight_logs: $highlight_logs\n\t\t)\n\t}\n`\nexport const PushSessionEventsDocument = gql`\n\tmutation PushSessionEvents(\n\t\t$session_secure_id: String!\n\t\t$payload_id: Int64ID!\n\t\t$data: String!\n\t) {\n\t\tpushSessionEvents(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tpayload_id: $payload_id\n\t\t\tdata: $data\n\t\t)\n\t}\n`\nexport const IdentifySessionDocument = gql`\n\tmutation identifySession(\n\t\t$session_secure_id: String!\n\t\t$user_identifier: String!\n\t\t$user_object: Any\n\t) {\n\t\tidentifySession(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tuser_identifier: $user_identifier\n\t\t\tuser_object: $user_object\n\t\t)\n\t}\n`\nexport const AddSessionPropertiesDocument = gql`\n\tmutation addSessionProperties(\n\t\t$session_secure_id: String!\n\t\t$properties_object: Any\n\t) {\n\t\taddSessionProperties(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tproperties_object: $properties_object\n\t\t)\n\t}\n`\nexport const PushMetricsDocument = gql`\n\tmutation pushMetrics($metrics: [MetricInput]!) {\n\t\tpushMetrics(metrics: $metrics)\n\t}\n`\nexport const AddSessionFeedbackDocument = gql`\n\tmutation addSessionFeedback(\n\t\t$session_secure_id: String!\n\t\t$user_name: String\n\t\t$user_email: String\n\t\t$verbatim: String!\n\t\t$timestamp: Timestamp!\n\t) {\n\t\taddSessionFeedback(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tuser_name: $user_name\n\t\t\tuser_email: $user_email\n\t\t\tverbatim: $verbatim\n\t\t\ttimestamp: $timestamp\n\t\t)\n\t}\n`\nexport const InitializeSessionDocument = gql`\n\tmutation initializeSession(\n\t\t$session_secure_id: String!\n\t\t$session_key: String\n\t\t$organization_verbose_id: String!\n\t\t$enable_strict_privacy: Boolean!\n\t\t$privacy_setting: String!\n\t\t$enable_recording_network_contents: Boolean!\n\t\t$clientVersion: String!\n\t\t$firstloadVersion: String!\n\t\t$clientConfig: String!\n\t\t$environment: String!\n\t\t$id: String!\n\t\t$appVersion: String\n\t\t$serviceName: String!\n\t\t$client_id: String!\n\t\t$network_recording_domains: [String!]\n\t\t$disable_session_recording: Boolean\n\t) {\n\t\tinitializeSession(\n\t\t\tsession_secure_id: $session_secure_id\n\t\t\tsession_key: $session_key\n\t\t\torganization_verbose_id: $organization_verbose_id\n\t\t\tenable_strict_privacy: $enable_strict_privacy\n\t\t\tenable_recording_network_contents: $enable_recording_network_contents\n\t\t\tclientVersion: $clientVersion\n\t\t\tfirstloadVersion: $firstloadVersion\n\t\t\tclientConfig: $clientConfig\n\t\t\tenvironment: $environment\n\t\t\tappVersion: $appVersion\n\t\t\tserviceName: $serviceName\n\t\t\tfingerprint: $id\n\t\t\tclient_id: $client_id\n\t\t\tnetwork_recording_domains: $network_recording_domains\n\t\t\tdisable_session_recording: $disable_session_recording\n\t\t\tprivacy_setting: $privacy_setting\n\t\t) {\n\t\t\tsecure_id\n\t\t\tproject_id\n\t\t\tsampling {\n\t\t\t\tspans {\n\t\t\t\t\tname {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tattributes {\n\t\t\t\t\t\tkey {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t\tattribute {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tevents {\n\t\t\t\t\t\tname {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t\tattributes {\n\t\t\t\t\t\t\tkey {\n\t\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tattribute {\n\t\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tsamplingRatio\n\t\t\t\t}\n\t\t\t\tlogs {\n\t\t\t\t\tmessage {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tseverityText {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tattributes {\n\t\t\t\t\t\tkey {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t\tattribute {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tsamplingRatio\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t${MatchPartsFragmentDoc}\n`\nexport const IgnoreDocument = gql`\n\tquery Ignore($id: ID!) {\n\t\tignore(id: $id)\n\t}\n`\nexport const GetSamplingConfigDocument = gql`\n\tquery GetSamplingConfig($organization_verbose_id: String!) {\n\t\tsampling(organization_verbose_id: $organization_verbose_id) {\n\t\t\tspans {\n\t\t\t\tname {\n\t\t\t\t\t...MatchParts\n\t\t\t\t}\n\t\t\t\tattributes {\n\t\t\t\t\tkey {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tattribute {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tevents {\n\t\t\t\t\tname {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tattributes {\n\t\t\t\t\t\tkey {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t\tattribute {\n\t\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsamplingRatio\n\t\t\t}\n\t\t\tlogs {\n\t\t\t\tmessage {\n\t\t\t\t\t...MatchParts\n\t\t\t\t}\n\t\t\t\tseverityText {\n\t\t\t\t\t...MatchParts\n\t\t\t\t}\n\t\t\t\tattributes {\n\t\t\t\t\tkey {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t\tattribute {\n\t\t\t\t\t\t...MatchParts\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsamplingRatio\n\t\t\t}\n\t\t}\n\t}\n\t${MatchPartsFragmentDoc}\n`\n\nexport type SdkFunctionWrapper = <T>(\n\taction: (requestHeaders?: Record<string, string>) => Promise<T>,\n\toperationName: string,\n\toperationType?: string,\n\tvariables?: any,\n) => Promise<T>\n\nconst defaultWrapper: SdkFunctionWrapper = (\n\taction,\n\t_operationName,\n\t_operationType,\n\tvariables,\n) => action()\n\nexport function getSdk(\n\tclient: GraphQLClient,\n\twithWrapper: SdkFunctionWrapper = defaultWrapper,\n) {\n\treturn {\n\t\tPushPayload(\n\t\t\tvariables: PushPayloadMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<PushPayloadMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<PushPayloadMutation>(\n\t\t\t\t\t\tPushPayloadDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'PushPayload',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tPushSessionEvents(\n\t\t\tvariables: PushSessionEventsMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<PushSessionEventsMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<PushSessionEventsMutation>(\n\t\t\t\t\t\tPushSessionEventsDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'PushSessionEvents',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tidentifySession(\n\t\t\tvariables: IdentifySessionMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<IdentifySessionMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<IdentifySessionMutation>(\n\t\t\t\t\t\tIdentifySessionDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'identifySession',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\taddSessionProperties(\n\t\t\tvariables: AddSessionPropertiesMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<AddSessionPropertiesMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<AddSessionPropertiesMutation>(\n\t\t\t\t\t\tAddSessionPropertiesDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'addSessionProperties',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tpushMetrics(\n\t\t\tvariables: PushMetricsMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<PushMetricsMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<PushMetricsMutation>(\n\t\t\t\t\t\tPushMetricsDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'pushMetrics',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\taddSessionFeedback(\n\t\t\tvariables: AddSessionFeedbackMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<AddSessionFeedbackMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<AddSessionFeedbackMutation>(\n\t\t\t\t\t\tAddSessionFeedbackDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'addSessionFeedback',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tinitializeSession(\n\t\t\tvariables: InitializeSessionMutationVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<InitializeSessionMutation> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<InitializeSessionMutation>(\n\t\t\t\t\t\tInitializeSessionDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'initializeSession',\n\t\t\t\t'mutation',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tIgnore(\n\t\t\tvariables: IgnoreQueryVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<IgnoreQuery> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<IgnoreQuery>(IgnoreDocument, variables, {\n\t\t\t\t\t\t...requestHeaders,\n\t\t\t\t\t\t...wrappedRequestHeaders,\n\t\t\t\t\t}),\n\t\t\t\t'Ignore',\n\t\t\t\t'query',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t\tGetSamplingConfig(\n\t\t\tvariables: GetSamplingConfigQueryVariables,\n\t\t\trequestHeaders?: GraphQLClientRequestHeaders,\n\t\t): Promise<GetSamplingConfigQuery> {\n\t\t\treturn withWrapper(\n\t\t\t\t(wrappedRequestHeaders) =>\n\t\t\t\t\tclient.request<GetSamplingConfigQuery>(\n\t\t\t\t\t\tGetSamplingConfigDocument,\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\t{ ...requestHeaders, ...wrappedRequestHeaders },\n\t\t\t\t\t),\n\t\t\t\t'GetSamplingConfig',\n\t\t\t\t'query',\n\t\t\t\tvariables,\n\t\t\t)\n\t\t},\n\t}\n}\nexport type Sdk = ReturnType<typeof getSdk>\n","// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n        c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n    ], { type: 'text/javascript' }))));\n    w.onmessage = function (e) {\n        var d = e.data, ed = d.$e$;\n        if (ed) {\n            var err = new Error(ed[0]);\n            err['code'] = ed[1];\n            err.stack = ed[2];\n            cb(err, null);\n        }\n        else\n            cb(null, d);\n    };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    ,\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (resize)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (resize)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (resize)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; ++bt)\n                    buf[bt] = buf[bt - dt];\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) {\n        if (ev.data.length) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush();\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.queuedSize = 0;\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        strm.queuedSize += d.length;\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function () { w.postMessage([]); };\n    }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     */\n    Deflate.prototype.flush = function () {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6, 1);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7, 0);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     */\n    Gzip.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8, 1);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l && !final) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            this.push(new u8(0), final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     */\n    Zlib.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10, 1);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11, 0);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o)\n                        : new this.Z(this.o);\n                this.i();\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\n    };\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        this.queuedSize += chunk.length;\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (val instanceof u8)\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl, bs = b4(d, b + 20);\n    var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n    for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n        ;\n    return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this.ondata(err, dat, final);\n                    _this.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (data, final) {\n        this.ondata(null, data, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (data, final) {\n        try {\n            this.i.push(data, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (data, final) {\n        if (this.i.terminate)\n            data = slc(data, 0);\n        this.i.push(data, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var _a;\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var sc_1 = b4(buf, i + 18), su_1 = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        if (sc_1 == 4294967295) {\n                            _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n                        }\n                        else if (dd)\n                            sc_1 = -1;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this.k[0] == chks_3 && _this.c)\n                                        _this.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = o == 4294967295 || c == 65535;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import { compressSync, strToU8 } from 'fflate'\nimport { PushPayloadMutationVariables } from '../graph/generated/operations'\n\nexport async function payloadToBase64(payload: PushPayloadMutationVariables) {\n\tconst buf = strToU8(JSON.stringify(payload))\n\tconst compressed = compressSync(buf)\n\t// use a FileReader to generate a base64 data URI:\n\tconst base64url = await new Promise<string>((r) => {\n\t\tconst reader = new FileReader()\n\t\treader.onload = () => r(reader.result as string)\n\t\treader.readAsDataURL(new Blob([new Uint8Array(compressed)]))\n\t})\n\t// remove data:application/octet-stream;base64, prefix\n\treturn {\n\t\tcompressedBase64: base64url.slice(base64url.indexOf(',') + 1),\n\t\tcompressedSize: compressed.length,\n\t\tbufferLength: buf.length,\n\t}\n}\n","export class Logger {\n\tdebug: boolean | undefined\n\tname: string | undefined\n\n\tconstructor(debug?: boolean, name?: string) {\n\t\tthis.debug = debug\n\t\tthis.name = name\n\t}\n\n\tlog(...data: any[]) {\n\t\tif (this.debug) {\n\t\t\tlet prefix = `[${Date.now()}]`\n\t\t\tif (this.name) {\n\t\t\t\tprefix += ` - ${this.name}`\n\t\t\t}\n\t\t\tconsole.log.apply(console, [prefix, ...data])\n\t\t}\n\t}\n\n\twarn(...data: any[]) {\n\t\tlet prefix = `[${Date.now()}]`\n\t\tif (this.name) {\n\t\t\tprefix += ` - ${this.name}`\n\t\t}\n\t\tconsole.warn.apply(console, [prefix, ...data])\n\t}\n}\n","export type Maybe<T> = T | null\nexport type InputMaybe<T> = Maybe<T>\nexport type Exact<T extends { [key: string]: unknown }> = {\n\t[K in keyof T]: T[K]\n}\nexport type MakeOptional<T, K extends keyof T> = Omit<T, K> & {\n\t[SubKey in K]?: Maybe<T[SubKey]>\n}\nexport type MakeMaybe<T, K extends keyof T> = Omit<T, K> & {\n\t[SubKey in K]: Maybe<T[SubKey]>\n}\nexport type MakeEmpty<\n\tT extends { [key: string]: unknown },\n\tK extends keyof T,\n> = { [_ in K]?: never }\nexport type Incremental<T> =\n\t| T\n\t| {\n\t\t\t[P in keyof T]?: P extends ' $fragmentName' | '__typename'\n\t\t\t\t? T[P]\n\t\t\t\t: never\n\t  }\n/** All built-in and custom scalars, mapped to their actual values */\nexport type Scalars = {\n\tID: { input: string; output: string }\n\tString: { input: string; output: string }\n\tBoolean: { input: boolean; output: boolean }\n\tInt: { input: number; output: number }\n\tFloat: { input: number; output: number }\n\tAny: { input: any; output: any }\n\tInt64: { input: any; output: any }\n\tInt64ID: { input: any; output: any }\n\tTimestamp: { input: any; output: any }\n}\n\n/** An attribute match configuration which can match an attribute key and value. */\nexport type AttributeMatchConfig = {\n\t__typename?: 'AttributeMatchConfig'\n\tattribute: MatchConfig\n\tkey: MatchConfig\n}\n\nexport type BackendErrorObjectInput = {\n\tenvironment: Scalars['String']['input']\n\tevent: Scalars['String']['input']\n\tid?: InputMaybe<Scalars['String']['input']>\n\tlog_cursor?: InputMaybe<Scalars['String']['input']>\n\tpayload?: InputMaybe<Scalars['String']['input']>\n\trequest_id?: InputMaybe<Scalars['String']['input']>\n\tservice: ServiceInput\n\tsession_secure_id?: InputMaybe<Scalars['String']['input']>\n\tsource: Scalars['String']['input']\n\tspan_id?: InputMaybe<Scalars['String']['input']>\n\tstackTrace: Scalars['String']['input']\n\ttimestamp: Scalars['Timestamp']['input']\n\ttrace_id?: InputMaybe<Scalars['String']['input']>\n\ttype: Scalars['String']['input']\n\turl: Scalars['String']['input']\n}\n\nexport type ErrorObjectInput = {\n\tcolumnNumber: Scalars['Int']['input']\n\tevent: Scalars['String']['input']\n\tid?: InputMaybe<Scalars['String']['input']>\n\tlineNumber: Scalars['Int']['input']\n\tpayload?: InputMaybe<Scalars['String']['input']>\n\tsource: Scalars['String']['input']\n\tstackTrace: Array<InputMaybe<StackFrameInput>>\n\ttimestamp: Scalars['Timestamp']['input']\n\ttype: Scalars['String']['input']\n\turl: Scalars['String']['input']\n}\n\nexport type InitializeSessionResponse = {\n\t__typename?: 'InitializeSessionResponse'\n\tproject_id: Scalars['ID']['output']\n\tsampling?: Maybe<SamplingConfig>\n\tsecure_id: Scalars['String']['output']\n}\n\n/**\n * A match based log sampling configuration. A log matches if each specified matching configuration matches.\n * If no matching configuration is specified, then all spans will match.\n * The sampling ratio will be applied to all matching spans.\n */\nexport type LogSamplingConfig = {\n\t__typename?: 'LogSamplingConfig'\n\t/**\n\t * A list of attribute match configs.\n\t * In order to match each attribute listed must match. This is an implicit AND operation.\n\t */\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\t/** Matches against the log message. */\n\tmessage?: Maybe<MatchConfig>\n\t/**\n\t * The ratio of logs to sample. Expressed in the form 1/n. So if the ratio is 10, then 1 out of\n\t * every 10 logs will be sampled. Setting the ratio to 0 will disable sampling for the log.\n\t */\n\tsamplingRatio: Scalars['Int']['output']\n\t/** Matches against the severity of the log. */\n\tseverityText?: Maybe<MatchConfig>\n}\n\n/**\n * A match configuration. Each field of this type represents a different type of match\n * configuration. One and only 1 field should be populated.\n *\n * This is effectively a sum type/discriminated union, but isn't implemented as such to avoid\n * this bug: https://github.com/99designs/gqlgen/issues/2741\n */\nexport type MatchConfig = {\n\t__typename?: 'MatchConfig'\n\t/** A match configuration which does an exact match against any value. */\n\tmatchValue?: Maybe<Scalars['Any']['output']>\n\t/**\n\t * A match configuration which matches against a regular expression.\n\t * Can only match string attributes.\n\t */\n\tregexValue?: Maybe<Scalars['String']['output']>\n}\n\nexport type MetricInput = {\n\tcategory?: InputMaybe<Scalars['String']['input']>\n\tgroup?: InputMaybe<Scalars['String']['input']>\n\tname: Scalars['String']['input']\n\tparent_span_id?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id: Scalars['String']['input']\n\tspan_id?: InputMaybe<Scalars['String']['input']>\n\ttags?: InputMaybe<Array<MetricTag>>\n\ttimestamp: Scalars['Timestamp']['input']\n\ttrace_id?: InputMaybe<Scalars['String']['input']>\n\tvalue: Scalars['Float']['input']\n}\n\nexport type MetricTag = {\n\tname: Scalars['String']['input']\n\tvalue: Scalars['String']['input']\n}\n\nexport type Mutation = {\n\t__typename?: 'Mutation'\n\taddSessionFeedback: Scalars['String']['output']\n\taddSessionProperties: Scalars['String']['output']\n\tidentifySession: Scalars['String']['output']\n\tinitializeSession: InitializeSessionResponse\n\tmarkBackendSetup?: Maybe<Scalars['Any']['output']>\n\tpushBackendPayload?: Maybe<Scalars['Any']['output']>\n\tpushMetrics: Scalars['Int']['output']\n\tpushPayload: Scalars['Int']['output']\n\tpushPayloadCompressed?: Maybe<Scalars['Any']['output']>\n\tpushSessionEvents?: Maybe<Scalars['Any']['output']>\n}\n\nexport type MutationAddSessionFeedbackArgs = {\n\tsession_secure_id: Scalars['String']['input']\n\ttimestamp: Scalars['Timestamp']['input']\n\tuser_email?: InputMaybe<Scalars['String']['input']>\n\tuser_name?: InputMaybe<Scalars['String']['input']>\n\tverbatim: Scalars['String']['input']\n}\n\nexport type MutationAddSessionPropertiesArgs = {\n\tproperties_object?: InputMaybe<Scalars['Any']['input']>\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationIdentifySessionArgs = {\n\tsession_secure_id: Scalars['String']['input']\n\tuser_identifier: Scalars['String']['input']\n\tuser_object?: InputMaybe<Scalars['Any']['input']>\n}\n\nexport type MutationInitializeSessionArgs = {\n\tappVersion?: InputMaybe<Scalars['String']['input']>\n\tclientConfig: Scalars['String']['input']\n\tclientVersion: Scalars['String']['input']\n\tclient_id: Scalars['String']['input']\n\tdisable_session_recording?: InputMaybe<Scalars['Boolean']['input']>\n\tenable_recording_network_contents: Scalars['Boolean']['input']\n\tenable_strict_privacy: Scalars['Boolean']['input']\n\tenvironment: Scalars['String']['input']\n\tfingerprint: Scalars['String']['input']\n\tfirstloadVersion: Scalars['String']['input']\n\tnetwork_recording_domains?: InputMaybe<Array<Scalars['String']['input']>>\n\torganization_verbose_id: Scalars['String']['input']\n\tprivacy_setting?: InputMaybe<Scalars['String']['input']>\n\tserviceName?: InputMaybe<Scalars['String']['input']>\n\tsession_key?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationMarkBackendSetupArgs = {\n\tproject_id?: InputMaybe<Scalars['String']['input']>\n\tsession_secure_id?: InputMaybe<Scalars['String']['input']>\n\ttype?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushBackendPayloadArgs = {\n\terrors: Array<InputMaybe<BackendErrorObjectInput>>\n\tproject_id?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushMetricsArgs = {\n\tmetrics: Array<InputMaybe<MetricInput>>\n}\n\nexport type MutationPushPayloadArgs = {\n\terrors: Array<InputMaybe<ErrorObjectInput>>\n\tevents: ReplayEventsInput\n\thas_session_unloaded?: InputMaybe<Scalars['Boolean']['input']>\n\thighlight_logs?: InputMaybe<Scalars['String']['input']>\n\tis_beacon?: InputMaybe<Scalars['Boolean']['input']>\n\tmessages: Scalars['String']['input']\n\tpayload_id?: InputMaybe<Scalars['ID']['input']>\n\tresources: Scalars['String']['input']\n\tsession_secure_id: Scalars['String']['input']\n\tweb_socket_events?: InputMaybe<Scalars['String']['input']>\n}\n\nexport type MutationPushPayloadCompressedArgs = {\n\tdata: Scalars['String']['input']\n\tpayload_id: Scalars['ID']['input']\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport type MutationPushSessionEventsArgs = {\n\tdata: Scalars['String']['input']\n\tpayload_id: Scalars['Int64ID']['input']\n\tsession_secure_id: Scalars['String']['input']\n}\n\nexport enum PublicGraphError {\n\tBillingQuotaExceeded = 'BillingQuotaExceeded',\n}\n\nexport type Query = {\n\t__typename?: 'Query'\n\tignore?: Maybe<Scalars['Any']['output']>\n\tsampling: SamplingConfig\n}\n\nexport type QueryIgnoreArgs = {\n\tid: Scalars['ID']['input']\n}\n\nexport type QuerySamplingArgs = {\n\torganization_verbose_id: Scalars['String']['input']\n}\n\nexport type ReplayEventInput = {\n\t_sid: Scalars['Float']['input']\n\tdata: Scalars['Any']['input']\n\ttimestamp: Scalars['Float']['input']\n\ttype: Scalars['Int']['input']\n}\n\nexport type ReplayEventsInput = {\n\tevents: Array<InputMaybe<ReplayEventInput>>\n}\n\nexport type SamplingConfig = {\n\t__typename?: 'SamplingConfig'\n\tlogs?: Maybe<Array<LogSamplingConfig>>\n\tspans?: Maybe<Array<SpanSamplingConfig>>\n}\n\nexport type ServiceInput = {\n\tname: Scalars['String']['input']\n\tversion: Scalars['String']['input']\n}\n\nexport type Session = {\n\t__typename?: 'Session'\n\tid?: Maybe<Scalars['Int64ID']['output']>\n\torganization_id: Scalars['ID']['output']\n\tproject_id: Scalars['ID']['output']\n\tsecure_id: Scalars['String']['output']\n}\n\n/** An event matcher configuration which matches span events within a span. */\nexport type SpanEventMatchConfig = {\n\t__typename?: 'SpanEventMatchConfig'\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\tname?: Maybe<MatchConfig>\n}\n\n/**\n * A match based span sampling configuration. A span matches if each specified matching configuration\n * matches.\n * If no matching configuration is specified, then all spans will match.\n * The sampling ratio will be applied to all matching spans.\n */\nexport type SpanSamplingConfig = {\n\t__typename?: 'SpanSamplingConfig'\n\t/**\n\t * A list of attribute match configs.\n\t * In order to match each attribute listed must match. This is an implicit AND operation.\n\t */\n\tattributes?: Maybe<Array<AttributeMatchConfig>>\n\t/** A list of span event match configs. */\n\tevents?: Maybe<Array<SpanEventMatchConfig>>\n\tname?: Maybe<MatchConfig>\n\t/**\n\t * The ratio of spans to sample. Expressed in the form 1/n. So if the ratio is 10, then 1 out of\n\t * every 10 spans will be sampled. Setting the ratio to 0 will disable sampling for the span.\n\t */\n\tsamplingRatio: Scalars['Int']['output']\n}\n\nexport type StackFrameInput = {\n\targs?: InputMaybe<Array<InputMaybe<Scalars['Any']['input']>>>\n\tcolumnNumber?: InputMaybe<Scalars['Int']['input']>\n\tfileName?: InputMaybe<Scalars['String']['input']>\n\tfunctionName?: InputMaybe<Scalars['String']['input']>\n\tisEval?: InputMaybe<Scalars['Boolean']['input']>\n\tisNative?: InputMaybe<Scalars['Boolean']['input']>\n\tlineNumber?: InputMaybe<Scalars['Int']['input']>\n\tsource?: InputMaybe<Scalars['String']['input']>\n}\n","import { ClientError } from 'graphql-request'\nimport { PublicGraphError } from '../graph/generated/schemas'\n\nexport const MAX_PUBLIC_GRAPH_RETRY_ATTEMPTS = 3\n\n// Initial backoff for retrying graphql requests.\nexport const BASE_DELAY_MS = 1000\nexport const BACKOFF_DELAY_MS = 500\n\n// Do not retry if any of these public graph errors are thrown\nconst NON_RETRYABLE_ERRORS = [PublicGraphError.BillingQuotaExceeded.toString()]\n\n// A `ClientError` is retryable if none of the response errors is non-retryable\nconst isErrorRetryable = (error: ClientError): boolean => {\n\tconst match = error.response.errors?.find((e) =>\n\t\tNON_RETRYABLE_ERRORS.includes(e.message),\n\t)\n\treturn match === undefined\n}\n\nexport const getGraphQLRequestWrapper = () => {\n\tconst graphQLRequestWrapper = async <T>(\n\t\trequestFn: () => Promise<T>,\n\t\toperationName: string,\n\t\toperationType?: string,\n\t\tvariables?: any,\n\t\tretries: number = 0,\n\t): Promise<T> => {\n\t\ttry {\n\t\t\treturn await requestFn()\n\t\t} catch (error: any) {\n\t\t\tif (error instanceof ClientError && !isErrorRetryable(error)) {\n\t\t\t\tthrow error\n\t\t\t}\n\n\t\t\tif (retries < MAX_PUBLIC_GRAPH_RETRY_ATTEMPTS) {\n\t\t\t\tawait new Promise((resolve) =>\n\t\t\t\t\tsetTimeout(\n\t\t\t\t\t\tresolve,\n\t\t\t\t\t\tBASE_DELAY_MS + BACKOFF_DELAY_MS * Math.pow(2, retries),\n\t\t\t\t\t),\n\t\t\t\t)\n\t\t\t\treturn await graphQLRequestWrapper(\n\t\t\t\t\trequestFn,\n\t\t\t\t\toperationName,\n\t\t\t\t\toperationType,\n\t\t\t\t\tvariables,\n\t\t\t\t\tretries + 1,\n\t\t\t\t)\n\t\t\t}\n\t\t\tconsole.error(\n\t\t\t\t`highlight.io: data request failed after ${retries} retries`,\n\t\t\t)\n\t\t\tthrow error\n\t\t}\n\t}\n\treturn graphQLRequestWrapper\n}\n","export const MAX_PUBLIC_GRAPH_RETRY_ATTEMPTS = 5\nexport const PROPERTY_MAX_LENGTH = 2000\nexport const NON_SERIALIZABLE_PROPS = ['number', 'string', 'boolean']\n","import { eventWithTime } from '@highlight-run/rrweb-types'\nimport { MetricCategory } from '../types/client'\nimport { ConsoleMessage, ErrorMessage, Source } from '../types/shared-types'\n\nexport type PropertyType = {\n\ttype?: 'track' | 'session'\n\tsource?: Source\n}\n\nexport enum MessageType {\n\tInitialize,\n\tReset,\n\tAsyncEvents,\n\tIdentify,\n\tProperties,\n\tMetrics,\n\tFeedback,\n\tCustomEvent,\n\tStop,\n\tGetStatus,\n}\n\nexport type InitializeMessage = {\n\ttype: MessageType.Initialize\n\tbackend: string\n\tsessionSecureID: string\n\tdebug: boolean\n\trecordingStartTime: number\n}\n\nexport type ResetMessage = {\n\ttype: MessageType.Reset\n}\n\nexport type GetStatusMessage = {\n\ttype: MessageType.GetStatus\n}\n\nexport type StatusResponse = {\n\ttype: MessageType.GetStatus\n\tpendingCount: number\n\tinitialized: boolean\n}\n\nexport type AsyncEventsMessage = {\n\ttype: MessageType.AsyncEvents\n\tid: number\n\thasSessionUnloaded: boolean\n\thighlightLogs: string\n\tevents: eventWithTime[]\n\tmessages: ConsoleMessage[]\n\terrors: ErrorMessage[]\n\tresourcesString: string\n\twebSocketEventsString: string\n}\n\nexport type AsyncEventsResponse = {\n\ttype: MessageType.AsyncEvents\n\tid: number\n\teventsSize: number\n\tcompressedSize: number\n}\n\nexport type IdentifyMessage = {\n\ttype: MessageType.Identify\n\tuserIdentifier: string\n\tuserObject: any\n\tsource?: Source\n}\n\nexport type PropertiesMessage = {\n\ttype: MessageType.Properties\n\tpropertiesObject: any\n\tpropertyType?: PropertyType\n}\n\nexport type MetricsMessage = {\n\ttype: MessageType.Metrics\n\tmetrics: {\n\t\tname: string\n\t\tvalue: number\n\t\tcategory: MetricCategory\n\t\tgroup: string\n\t\ttimestamp: Date\n\t\ttags: { name: string; value: string }[]\n\t}[]\n}\n\nexport type FeedbackMessage = {\n\ttype: MessageType.Feedback\n\tverbatim: string\n\ttimestamp: string\n\tuserName?: string\n\tuserEmail?: string\n}\n\nexport type CustomEventResponse = {\n\ttype: MessageType.CustomEvent\n\ttag: string\n\tpayload: any\n}\n\nexport type StopEventResponse = {\n\ttype: MessageType.Stop\n\trequestStart: number\n\tasyncEventsResponse: AsyncEventsResponse\n}\n\nexport type HighlightClientWorkerParams = {\n\tmessage:\n\t\t| InitializeMessage\n\t\t| ResetMessage\n\t\t| GetStatusMessage\n\t\t| AsyncEventsMessage\n\t\t| IdentifyMessage\n\t\t| PropertiesMessage\n\t\t| MetricsMessage\n\t\t| FeedbackMessage\n}\n\nexport type HighlightClientWorkerResponse = {\n\tresponse?:\n\t\t| AsyncEventsResponse\n\t\t| CustomEventResponse\n\t\t| StopEventResponse\n\t\t| StatusResponse\n}\n","import { GraphQLClient } from 'graphql-request'\nimport stringify from 'json-stringify-safe'\nimport { UPLOAD_TIMEOUT } from '../constants/sessions'\nimport {\n\tgetSdk,\n\tPushPayloadMutationVariables,\n\tSdk,\n} from '../graph/generated/operations'\nimport { payloadToBase64 } from '../utils/payload'\nimport { ReplayEventsInput } from '../graph/generated/schemas'\nimport { Logger } from '../logger'\nimport { MetricCategory } from '../types/client'\nimport { getGraphQLRequestWrapper } from '../utils/graph'\nimport {\n\tMAX_PUBLIC_GRAPH_RETRY_ATTEMPTS,\n\tNON_SERIALIZABLE_PROPS,\n\tPROPERTY_MAX_LENGTH,\n} from './constants'\nimport {\n\tAsyncEventsMessage,\n\tAsyncEventsResponse,\n\tFeedbackMessage,\n\tHighlightClientWorkerParams,\n\tHighlightClientWorkerResponse,\n\tIdentifyMessage,\n\tMessageType,\n\tMetricsMessage,\n\tPropertiesMessage,\n} from './types'\n\nexport interface HighlightClientRequestWorker {\n\tpostMessage: (message: HighlightClientWorkerParams) => void\n\tonmessage: (message: MessageEvent<HighlightClientWorkerResponse>) => void\n}\n\ninterface HighlightClientResponseWorker {\n\tonmessage:\n\t\t| null\n\t\t| ((message: MessageEvent<HighlightClientWorkerParams>) => void)\n\n\tpostMessage(e: HighlightClientWorkerResponse): void\n}\n\n// `as any` because: https://github.com/Microsoft/TypeScript/issues/20595\nconst worker: HighlightClientResponseWorker = self as any\n\nfunction stringifyProperties(\n\tproperties_object: any,\n\ttype: 'session' | 'track' | 'user',\n) {\n\tconst stringifiedObj: any = {}\n\tconst invalidTypes: any[] = []\n\tconst tooLong: any[] = []\n\tfor (const [key, value] of Object.entries(properties_object)) {\n\t\tif (value === undefined || value === null) {\n\t\t\tcontinue\n\t\t}\n\n\t\tif (!NON_SERIALIZABLE_PROPS.includes(typeof value)) {\n\t\t\tinvalidTypes.push({ [key]: value })\n\t\t}\n\t\tlet asString: string\n\t\tif (typeof value === 'string') {\n\t\t\tasString = value\n\t\t} else {\n\t\t\tasString = stringify(value)\n\t\t}\n\t\tif (asString.length > PROPERTY_MAX_LENGTH) {\n\t\t\ttooLong.push({ [key]: value })\n\t\t\tasString = asString.substring(0, PROPERTY_MAX_LENGTH)\n\t\t}\n\n\t\tstringifiedObj[key] = asString\n\t}\n\n\t// Skipping logging for 'session' type because they're generated by Highlight\n\t// (e.g. visited-url > 2000 characters)\n\tif (type !== 'session') {\n\t\tif (invalidTypes.length > 0) {\n\t\t\tconsole.warn(\n\t\t\t\t`Highlight was passed one or more ${type} properties not of type string, number, or boolean.`,\n\t\t\t\tinvalidTypes,\n\t\t\t)\n\t\t}\n\n\t\tif (tooLong.length > 0) {\n\t\t\tconsole.warn(\n\t\t\t\t`Highlight was passed one or more ${type} properties exceeding 2000 characters, which will be truncated.`,\n\t\t\t\ttooLong,\n\t\t\t)\n\t\t}\n\t}\n\n\treturn stringifiedObj\n}\n\n{\n\tlet graphqlSDK: Sdk\n\tlet backend: string\n\tlet sessionSecureID: string\n\tlet numberOfFailedRequests: number = 0\n\tlet numberOfFailedPushPayloads: number = 0\n\tlet debug: boolean = false\n\tlet recordingStartTime: number = 0\n\tlet logger = new Logger(false, '[worker]')\n\tconst metricsPayload: {\n\t\tname: string\n\t\tvalue: number\n\t\tsession_secure_id: string\n\t\tcategory: MetricCategory\n\t\tgroup: string\n\t\ttimestamp: string\n\t\ttags: { name: string; value: string }[]\n\t}[] = []\n\tconst pendingMessages: HighlightClientWorkerParams['message'][] = []\n\n\tconst shouldSendRequest = (): boolean => {\n\t\treturn (\n\t\t\trecordingStartTime !== 0 &&\n\t\t\tnumberOfFailedRequests < MAX_PUBLIC_GRAPH_RETRY_ATTEMPTS &&\n\t\t\t!!sessionSecureID?.length\n\t\t)\n\t}\n\n\tconst addCustomEvent = <T>(tag: string, payload: T) => {\n\t\tworker.postMessage({\n\t\t\tresponse: {\n\t\t\t\ttype: MessageType.CustomEvent,\n\t\t\t\ttag: tag,\n\t\t\t\tpayload: payload,\n\t\t\t},\n\t\t})\n\t}\n\n\tconst processAsyncEventsMessage = async (msg: AsyncEventsMessage) => {\n\t\tconst {\n\t\t\tid,\n\t\t\tevents,\n\t\t\tmessages,\n\t\t\terrors,\n\t\t\tresourcesString,\n\t\t\twebSocketEventsString,\n\t\t\thasSessionUnloaded,\n\t\t\thighlightLogs,\n\t\t} = msg\n\n\t\tconst messagesString = stringify({ messages: messages })\n\t\tlet payload: PushPayloadMutationVariables = {\n\t\t\tsession_secure_id: sessionSecureID,\n\t\t\tpayload_id: id.toString(),\n\t\t\tevents: { events } as ReplayEventsInput,\n\t\t\tmessages: messagesString,\n\t\t\tresources: resourcesString,\n\t\t\tweb_socket_events: webSocketEventsString,\n\t\t\terrors,\n\t\t\tis_beacon: false,\n\t\t\thas_session_unloaded: hasSessionUnloaded,\n\t\t}\n\t\tif (highlightLogs) {\n\t\t\tpayload.highlight_logs = highlightLogs\n\t\t}\n\n\t\tconst { compressedBase64, bufferLength, compressedSize } =\n\t\t\tawait payloadToBase64(payload)\n\n\t\tconst response: AsyncEventsResponse = {\n\t\t\ttype: MessageType.AsyncEvents,\n\t\t\tid,\n\t\t\teventsSize: bufferLength,\n\t\t\tcompressedSize: compressedBase64.length,\n\t\t}\n\n\t\tlogger.log(\n\t\t\t`Pushing payload: ${JSON.stringify(\n\t\t\t\t{\n\t\t\t\t\tsessionSecureID,\n\t\t\t\t\tid,\n\t\t\t\t\tfirstSID: Math.min(\n\t\t\t\t\t\t...(payload.events.events\n\t\t\t\t\t\t\t.map((e) => e?._sid)\n\t\t\t\t\t\t\t.filter((sid) => !!sid) as number[]),\n\t\t\t\t\t),\n\t\t\t\t\teventsLength: payload.events.events.length,\n\t\t\t\t\tmessagesLength: messages.length,\n\t\t\t\t\tresourcesLength: resourcesString.length,\n\t\t\t\t\twebSocketLength: webSocketEventsString.length,\n\t\t\t\t\terrorsLength: errors.length,\n\t\t\t\t\tbufLength: bufferLength,\n\t\t\t\t\tcompressedLength: compressedSize,\n\t\t\t\t\tcompressedBase64Length: compressedBase64.length,\n\t\t\t\t},\n\t\t\t\tundefined,\n\t\t\t\t2,\n\t\t\t)}`,\n\t\t)\n\n\t\tconst pushPayload = graphqlSDK.PushSessionEvents({\n\t\t\tsession_secure_id: sessionSecureID,\n\t\t\tpayload_id: id.toString(),\n\t\t\tdata: compressedBase64,\n\t\t})\n\n\t\tlet pushMetrics: Promise<any> = Promise.resolve()\n\t\tif (metricsPayload.length) {\n\t\t\tpushMetrics = graphqlSDK.pushMetrics({\n\t\t\t\tmetrics: metricsPayload,\n\t\t\t})\n\t\t\t// clear batched payload before yielding for network request\n\t\t\tmetricsPayload.splice(0)\n\t\t}\n\n\t\tlet requestStart: number = performance.now()\n\t\tconst int = setInterval(() => {\n\t\t\tif (\n\t\t\t\trequestStart &&\n\t\t\t\tperformance.now() - requestStart > UPLOAD_TIMEOUT\n\t\t\t) {\n\t\t\t\tconsole.warn(\n\t\t\t\t\t`Uploading pushPayload took too long, failure number #${numberOfFailedPushPayloads}.`,\n\t\t\t\t)\n\t\t\t\tnumberOfFailedPushPayloads += 1\n\t\t\t\tclearInterval(int)\n\n\t\t\t\tif (\n\t\t\t\t\tnumberOfFailedPushPayloads >=\n\t\t\t\t\tMAX_PUBLIC_GRAPH_RETRY_ATTEMPTS\n\t\t\t\t) {\n\t\t\t\t\tconsole.warn(\n\t\t\t\t\t\t`Uploading pushPayload took too long, stopping recording to avoid OOM.`,\n\t\t\t\t\t)\n\n\t\t\t\t\tworker.postMessage({\n\t\t\t\t\t\tresponse: {\n\t\t\t\t\t\t\ttype: MessageType.Stop,\n\t\t\t\t\t\t\trequestStart,\n\t\t\t\t\t\t\tasyncEventsResponse: response,\n\t\t\t\t\t\t},\n\t\t\t\t\t})\n\n\t\t\t\t\tprocessPropertiesMessage({\n\t\t\t\t\t\ttype: MessageType.Properties,\n\t\t\t\t\t\tpropertiesObject: {\n\t\t\t\t\t\t\tstopReason: 'Push Payload Timeout',\n\t\t\t\t\t\t},\n\t\t\t\t\t\tpropertyType: { type: 'track' },\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t}, 100)\n\t\ttry {\n\t\t\tawait Promise.all([pushPayload, pushMetrics])\n\t\t\tif (\n\t\t\t\tnumberOfFailedPushPayloads &&\n\t\t\t\tperformance.now() - requestStart <= UPLOAD_TIMEOUT\n\t\t\t) {\n\t\t\t\tconsole.warn(\n\t\t\t\t\t`pushPayload succeeded after #${numberOfFailedPushPayloads} failures, resetting stop switch.`,\n\t\t\t\t)\n\t\t\t\tnumberOfFailedPushPayloads = 0\n\t\t\t}\n\t\t} finally {\n\t\t\trequestStart = 0\n\t\t\tclearInterval(int)\n\t\t}\n\n\t\tworker.postMessage({\n\t\t\tresponse,\n\t\t})\n\t}\n\n\tconst processIdentifyMessage = async (msg: IdentifyMessage) => {\n\t\tconst { userObject, userIdentifier, source } = msg\n\t\tif (source === 'segment') {\n\t\t\taddCustomEvent(\n\t\t\t\t'Segment Identify',\n\t\t\t\tstringify({ userIdentifier, ...userObject }),\n\t\t\t)\n\t\t} else {\n\t\t\taddCustomEvent(\n\t\t\t\t'Identify',\n\t\t\t\tstringify({ userIdentifier, ...userObject }),\n\t\t\t)\n\t\t}\n\t\tawait graphqlSDK.identifySession({\n\t\t\tsession_secure_id: sessionSecureID,\n\t\t\tuser_identifier: userIdentifier,\n\t\t\tuser_object: stringifyProperties(userObject, 'user'),\n\t\t})\n\t\tconst sourceString = source === 'segment' ? source : 'default'\n\t\tlogger.log(\n\t\t\t`Identify (${userIdentifier}, source: ${sourceString}) w/ obj: ${stringify(\n\t\t\t\tuserObject,\n\t\t\t)} @ ${backend}`,\n\t\t)\n\t}\n\n\tconst processPropertiesMessage = async (msg: PropertiesMessage) => {\n\t\tconst { propertiesObject, propertyType } = msg\n\t\tlet eventType: string\n\t\tif (propertyType?.type === 'session') {\n\t\t\teventType = 'Session'\n\t\t\t// Session properties are custom properties that the Highlight snippet adds (visited-url, referrer, etc.)\n\t\t\t// These should be searchable but not part of `Track` timeline indicators\n\t\t\tawait graphqlSDK.addSessionProperties({\n\t\t\t\tsession_secure_id: sessionSecureID,\n\t\t\t\tproperties_object: stringifyProperties(\n\t\t\t\t\tpropertiesObject,\n\t\t\t\t\t'session',\n\t\t\t\t),\n\t\t\t})\n\t\t} else {\n\t\t\t// Track properties are properties that users define; rn, either through segment or manually.\n\t\t\tif (propertyType?.source === 'segment') {\n\t\t\t\teventType = 'Segment'\n\t\t\t} else {\n\t\t\t\teventType = 'Track'\n\t\t\t}\n\t\t}\n\t\tif (eventType !== 'Session') {\n\t\t\taddCustomEvent<string>(eventType, stringify(propertiesObject))\n\t\t}\n\t\tlogger.log(\n\t\t\t`Adding ${eventType} Properties to session (${sessionSecureID}) w/ obj: ${JSON.stringify(\n\t\t\t\tpropertiesObject,\n\t\t\t)} @ ${backend}`,\n\t\t)\n\t}\n\n\tconst processMetricsMessage = async (msg: MetricsMessage) => {\n\t\tmetricsPayload.push(\n\t\t\t...msg.metrics.map((m) => ({\n\t\t\t\tname: m.name,\n\t\t\t\tvalue: m.value,\n\t\t\t\tsession_secure_id: sessionSecureID,\n\t\t\t\tcategory: m.category,\n\t\t\t\tgroup: m.group,\n\t\t\t\ttimestamp: m.timestamp.toISOString(),\n\t\t\t\ttags: m.tags,\n\t\t\t})),\n\t\t)\n\t}\n\n\tconst processFeedbackMessage = async (msg: FeedbackMessage) => {\n\t\tconst { timestamp, verbatim, userEmail, userName } = msg\n\t\tawait graphqlSDK.addSessionFeedback({\n\t\t\tsession_secure_id: sessionSecureID,\n\t\t\ttimestamp,\n\t\t\tverbatim,\n\t\t\tuser_email: userEmail,\n\t\t\tuser_name: userName,\n\t\t})\n\t}\n\n\tconst processMessage = async (\n\t\tmsg: HighlightClientWorkerParams['message'],\n\t) => {\n\t\tif (msg.type === MessageType.AsyncEvents) {\n\t\t\tawait processAsyncEventsMessage(msg as AsyncEventsMessage)\n\t\t} else if (msg.type === MessageType.Identify) {\n\t\t\tawait processIdentifyMessage(msg as IdentifyMessage)\n\t\t} else if (msg.type === MessageType.Properties) {\n\t\t\tawait processPropertiesMessage(msg as PropertiesMessage)\n\t\t} else if (msg.type === MessageType.Metrics) {\n\t\t\tawait processMetricsMessage(msg as MetricsMessage)\n\t\t} else if (msg.type === MessageType.Feedback) {\n\t\t\tawait processFeedbackMessage(msg as FeedbackMessage)\n\t\t}\n\t}\n\n\tconst drainPendingMessages = async () => {\n\t\twhile (pendingMessages.length > 0 && shouldSendRequest()) {\n\t\t\tconst msg = pendingMessages.shift()!\n\t\t\ttry {\n\t\t\t\tawait processMessage(msg)\n\t\t\t\tnumberOfFailedRequests = 0\n\t\t\t} catch (e) {\n\t\t\t\tif (debug) {\n\t\t\t\t\tconsole.error(e)\n\t\t\t\t}\n\t\t\t\tnumberOfFailedRequests += 1\n\t\t\t}\n\t\t}\n\t}\n\n\tworker.onmessage = async function (e) {\n\t\tif (e.data.message.type === MessageType.Initialize) {\n\t\t\tbackend = e.data.message.backend\n\t\t\tsessionSecureID = e.data.message.sessionSecureID\n\t\t\tdebug = e.data.message.debug\n\t\t\trecordingStartTime = e.data.message.recordingStartTime\n\t\t\tlogger.debug = debug\n\t\t\tgraphqlSDK = getSdk(\n\t\t\t\tnew GraphQLClient(backend, {\n\t\t\t\t\theaders: {},\n\t\t\t\t}),\n\t\t\t\tgetGraphQLRequestWrapper(),\n\t\t\t)\n\n\t\t\tawait drainPendingMessages()\n\t\t\treturn\n\t\t}\n\n\t\t// Handle Reset before shouldSendRequest - always execute immediately\n\t\t// This clears any pending data from a previous session on forceNew/sessionKey change\n\t\tif (e.data.message.type === MessageType.Reset) {\n\t\t\tpendingMessages.length = 0\n\t\t\tmetricsPayload.length = 0\n\t\t\tnumberOfFailedRequests = 0\n\t\t\tnumberOfFailedPushPayloads = 0\n\t\t\t// Reset sessionSecureID and recordingStartTime so that messages arriving\n\t\t\t// between Reset and new Initialize are queued rather than processed with\n\t\t\t// the old session SecureID\n\t\t\tsessionSecureID = ''\n\t\t\trecordingStartTime = 0\n\t\t\treturn\n\t\t}\n\n\t\t// returns current worker state for testing/debugging\n\t\tif (e.data.message.type === MessageType.GetStatus) {\n\t\t\tworker.postMessage({\n\t\t\t\tresponse: {\n\t\t\t\t\ttype: MessageType.GetStatus,\n\t\t\t\t\tpendingCount: pendingMessages.length,\n\t\t\t\t\tinitialized: shouldSendRequest(),\n\t\t\t\t},\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\tif (!shouldSendRequest()) {\n\t\t\tpendingMessages.push(e.data.message)\n\t\t\treturn\n\t\t}\n\n\t\ttry {\n\t\t\tawait processMessage(e.data.message)\n\t\t\tnumberOfFailedRequests = 0\n\t\t\tawait drainPendingMessages()\n\t\t} catch (e) {\n\t\t\tif (debug) {\n\t\t\t\tconsole.error(e)\n\t\t\t}\n\t\t\tnumberOfFailedRequests += 1\n\t\t}\n\t}\n}\n"],"names":["defaultJsonSerializer","uppercase","str","HeadersInstanceToPlainObject","headers","o","v","k","parseRequestArgs","documentOrOptions","variables","requestHeaders","parseRawRequestArgs","queryOrOptions","parseBatchRequestArgs","documentsOrOptions","devAssert","condition","message","isObjectLike","value","invariant","LineRegExp","getLocation","source","position","lastLineStart","line","match","printLocation","location","printSourceLocation","sourceLocation","firstLineColumnOffset","body","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","lines","locationLine","subLineIndex","subLineColumnNum","subLines","i","printPrefixedLines","subLine","existingLines","_","padLen","prefix","toNormalizedOptions","args","firstArg","GraphQLError","rawArgs","_this$nodes","_nodeLocations$","_ref","nodes","positions","path","originalError","extensions","undefinedIfEmpty","nodeLocations","node","loc","pos","originalExtensions","output","formattedError","array","syntaxError","description","Location","startToken","endToken","Token","kind","start","end","column","QueryDocumentKeys","kindValues","isNode","maybeNode","maybeKind","OperationTypeNode","DirectiveLocation","Kind","isWhiteSpace","code","isDigit","isLetter","isNameStart","isNameContinue","dedentBlockStringLines","_firstNonEmptyLine2","commonIndent","firstNonEmptyLine","lastNonEmptyLine","_firstNonEmptyLine","indent","leadingWhitespace","printBlockString","options","escapedValue","isSingleLine","forceLeadingNewLine","hasTrailingTripleQuotes","hasTrailingQuote","hasTrailingSlash","forceTrailingNewline","printAsMultipleLines","result","skipLeadingNewLine","TokenKind","Lexer","startOfFileToken","token","nextToken","readNextToken","isPunctuatorTokenKind","isUnicodeScalarValue","isSupplementaryCodePoint","isLeadingSurrogate","isTrailingSurrogate","printCodePointAt","lexer","char","createToken","col","bodyLength","readComment","readBlockString","readString","readNumber","readName","firstCode","isFloat","readDigits","chunkStart","escape","readEscapedUnicodeVariableWidth","readEscapedUnicodeFixedWidth","readEscapedCharacter","point","size","readHexDigit","read16BitHexCode","trailingCode","lineStart","currentLine","blockLines","MAX_ARRAY_LENGTH","MAX_RECURSIVE_DEPTH","inspect","formatValue","seenValues","formatObjectValue","previouslySeenValues","isJSONable","jsonValue","formatArray","formatObject","object","entries","getObjectTag","key","len","remaining","items","tag","name","instanceOf","constructor","_value$constructor","className","valueClassName","stringifiedValue","Source","locationOffset","isSource","parse","parser","Parser","document","sourceObj","hasDescription","keywordToken","operation","operationToken","nameOrAlias","alias","isConst","item","hasTypeCondition","varName","directives","type","innerType","operationTypes","interfaces","fields","defaultValue","types","values","getTokenDesc","repeatable","locations","getTokenKindDesc","atToken","openKind","parseFn","closeKind","delimiterKind","maxTokens","printString","escapedRegExp","escapedReplacer","escapeSequences","BREAK","visit","root","visitor","visitorKeys","enterLeaveMap","getEnterLeaveForKind","stack","inArray","keys","index","edits","parent","ancestors","isLeaving","isEdited","editOffset","editKey","editValue","arrayKey","__spreadValues","_enterLeaveMap$get","_enterLeaveMap$get2","visitFn","_node$kind","kindVisitor","print","ast","printDocASTReducer","MAX_LINE_LENGTH","join","varDefs","wrap","variable","selections","block","selectionSet","argsLine","typeCondition","variableDefinitions","isBlockString","hasMultilineItems","maybeArray","separator","_maybeArray$filter$jo","x","maybeString","_maybeArray$some","extractOperationName","operationName","operationDefinitions","definition","_b","_a","resolveRequestDocument","parsedDocument","err","ClientError","response","request","_c","global","this","__self__","F","self","exports","support","e","isDataView","obj","viewClasses","isArrayBufferView","normalizeName","normalizeValue","iteratorFor","iterator","Headers","header","oldValue","callback","thisArg","consumed","fileReaderReady","reader","resolve","reject","readBlobAsArrayBuffer","blob","promise","readBlobAsText","readArrayBufferAsText","buf","view","chars","bufferClone","Body","rejected","decode","methods","normalizeMethod","method","upcased","Request","input","form","bytes","split","parseHeaders","rawHeaders","preProcessedHeaders","parts","Response","bodyInit","redirectStatuses","url","status","error","fetch","init","xhr","abortXhr","ctx","module","resolveHeaders","oHeaders","CrossFetch","CrossFetch.Headers","cleanQuery","buildRequestConfig","params","params_","search","payload","acc","currentQuery","createHttpMethodFetcher","__async","query","fetchOptions","middleware","queryParams","createRequestBody","urlResolved","initResolved","__spreadProps","urlNew","initNew","__objRest","GraphQLClient","requestConfig","rawRequestOptions","crossFetch","requestMiddleware","responseMiddleware","makeRequest","callOrIdentity","variablesAndRequestHeaders","requestOptions","batchRequestOptions","queries","fetcher","isBatchingQuery","getResult","successfullyReceivedData","data","successfullyPassedErrorPolicy","rest","errorResult","jsonSerializer","jsonSerializer_","contentType","stringify","serializer","replacer","spaces","cycleReplacer","thisPos","UPLOAD_TIMEOUT","__assign","s","n","p","docCache","fragmentSourceMap","printFragmentWarnings","experimentalFragmentVariables","normalize","string","cacheKeyFromLoc","processFragments","seenKeys","definitions","fragmentDefinition","fragmentName","sourceKey","sourceKeySet","stripLoc","doc","workSet","parseDocument","cacheKey","parsed","gql","literals","_i","arg","resetCaches","disableFragmentWarnings","enableExperimentalFragmentVariables","disableExperimentalFragmentVariables","extras","gql_1","MatchPartsFragmentDoc","PushPayloadDocument","PushSessionEventsDocument","IdentifySessionDocument","AddSessionPropertiesDocument","PushMetricsDocument","AddSessionFeedbackDocument","InitializeSessionDocument","IgnoreDocument","GetSamplingConfigDocument","defaultWrapper","action","_operationName","_operationType","getSdk","client","withWrapper","wrappedRequestHeaders","u8","u16","i32","fleb","fdeb","clim","freb","eb","b","j","fl","revfl","revfd","rev","hMap","cd","mb","r","l","le","co","rvb","sv","r_1","m","flt","fdt","flm","fdm","shft","slc","wbits","d","wbits16","hTree","t","t2","et","a","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","out","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","flen","ftlen","dtlen","lm","ll","dm","dl","llm","lcts","it","clct","sym","dst","deo","dflt","lvl","plvl","pre","post","st","lst","opt","msk_1","prev","head","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","pti","lin","din","crct","crc","cr","dopt","dict","newDat","wbytes","gzh","fn","gzhl","gzipSync","opts","te","td","tds","strToU8","latin1","ar","ai","payloadToBase64","compressed","compressSync","base64url","Logger","debug","__publicField","PublicGraphError","MAX_PUBLIC_GRAPH_RETRY_ATTEMPTS","BASE_DELAY_MS","BACKOFF_DELAY_MS","NON_RETRYABLE_ERRORS","isErrorRetryable","getGraphQLRequestWrapper","graphQLRequestWrapper","requestFn","operationType","retries","PROPERTY_MAX_LENGTH","NON_SERIALIZABLE_PROPS","MessageType","worker","stringifyProperties","properties_object","stringifiedObj","invalidTypes","tooLong","asString","graphqlSDK","backend","sessionSecureID","numberOfFailedRequests","numberOfFailedPushPayloads","recordingStartTime","logger","metricsPayload","pendingMessages","shouldSendRequest","addCustomEvent","processAsyncEventsMessage","msg","id","events","messages","errors","resourcesString","webSocketEventsString","hasSessionUnloaded","highlightLogs","messagesString","compressedBase64","bufferLength","compressedSize","sid","pushPayload","pushMetrics","requestStart","int","processPropertiesMessage","processIdentifyMessage","userObject","userIdentifier","sourceString","propertiesObject","propertyType","eventType","processMetricsMessage","processFeedbackMessage","timestamp","verbatim","userEmail","userName","processMessage","drainPendingMessages"],"mappings":"g6BAAO,MAAMA,EAAwB,KCAxBC,EAAaC,GAAQA,EAAI,YAAW,EAIpCC,EAAgCC,GAAY,CACrD,MAAMC,EAAI,CAAA,EACV,OAAAD,EAAQ,QAAQ,CAACE,EAAGC,IAAM,CACtBF,EAAEE,CAAC,EAAID,CACX,CAAC,EACMD,CACX,ECVaG,GAAmB,CAACC,EAAmBC,EAAWC,IACpDF,EAAkB,SACnBA,EACA,CACE,SAAUA,EACV,UAAWC,EACX,eAAgBC,EAChB,OAAQ,MACpB,EAEaC,GAAsB,CAACC,EAAgBH,EAAWC,IACpDE,EAAe,MAChBA,EACA,CACE,MAAOA,EACP,UAAWH,EACX,eAAgBC,EAChB,OAAQ,MACpB,EAEaG,GAAwB,CAACC,EAAoBJ,IAC/CI,EAAmB,UACpBA,EACA,CACE,UAAWA,EACX,eAAgBJ,EAChB,OAAQ,MACpB,EC3BO,SAASK,GAAUC,EAAWC,EAAS,CAG5C,GAAI,CAFqB,EAAQD,EAG/B,MAAM,IAAI,MAAMC,CAAO,CAE3B,CCFO,SAASC,GAAaC,EAAO,CAClC,OAAO,OAAOA,GAAS,UAAYA,IAAU,IAC/C,CCNO,SAASC,GAAUJ,EAAWC,EAAS,CAG5C,GAAI,CAFqB,EAAQD,EAG/B,MAAM,IAAI,MACoB,iCAClC,CAEA,CCPA,MAAMK,GAAa,eASZ,SAASC,GAAYC,EAAQC,EAAU,CAC5C,IAAIC,EAAgB,EAChBC,EAAO,EAEX,UAAWC,KAASJ,EAAO,KAAK,SAASF,EAAU,EAAG,CAGpD,GAFA,OAAOM,EAAM,OAAU,UAAYP,GAAU,EAAK,EAE9CO,EAAM,OAASH,EACjB,MAGFC,EAAgBE,EAAM,MAAQA,EAAM,CAAC,EAAE,OACvCD,GAAQ,CACV,CAEA,MAAO,CACL,KAAAA,EACA,OAAQF,EAAW,EAAIC,CAC3B,CACA,CCxBO,SAASG,GAAcC,EAAU,CACtC,OAAOC,GACLD,EAAS,OACTP,GAAYO,EAAS,OAAQA,EAAS,KAAK,CAC/C,CACA,CAKO,SAASC,GAAoBP,EAAQQ,EAAgB,CAC1D,MAAMC,EAAwBT,EAAO,eAAe,OAAS,EACvDU,EAAO,GAAG,SAASD,CAAqB,EAAIT,EAAO,KACnDW,EAAYH,EAAe,KAAO,EAClCI,EAAaZ,EAAO,eAAe,KAAO,EAC1Ca,EAAUL,EAAe,KAAOI,EAChCE,EAAeN,EAAe,OAAS,EAAIC,EAAwB,EACnEM,EAAYP,EAAe,OAASM,EACpCE,EAAc,GAAGhB,EAAO,IAAI,IAAIa,CAAO,IAAIE,CAAS;AAAA,EACpDE,EAAQP,EAAK,MAAM,cAAc,EACjCQ,EAAeD,EAAMN,CAAS,EAEpC,GAAIO,EAAa,OAAS,IAAK,CAC7B,MAAMC,EAAe,KAAK,MAAMJ,EAAY,EAAE,EACxCK,EAAmBL,EAAY,GAC/BM,EAAW,CAAA,EAEjB,QAASC,EAAI,EAAGA,EAAIJ,EAAa,OAAQI,GAAK,GAC5CD,EAAS,KAAKH,EAAa,MAAMI,EAAGA,EAAI,EAAE,CAAC,EAG7C,OACEN,EACAO,GAAmB,CACjB,CAAC,GAAGV,CAAO,KAAMQ,EAAS,CAAC,CAAC,EAC5B,GAAGA,EAAS,MAAM,EAAGF,EAAe,CAAC,EAAE,IAAKK,GAAY,CAAC,IAAKA,CAAO,CAAC,EACtE,CAAC,IAAK,IAAI,SAASJ,CAAgB,CAAC,EACpC,CAAC,IAAKC,EAASF,EAAe,CAAC,CAAC,CACxC,CAAO,CAEL,CAEA,OACEH,EACAO,GAAmB,CAEjB,CAAC,GAAGV,EAAU,CAAC,KAAMI,EAAMN,EAAY,CAAC,CAAC,EACzC,CAAC,GAAGE,CAAO,KAAMK,CAAY,EAC7B,CAAC,IAAK,IAAI,SAASH,CAAS,CAAC,EAC7B,CAAC,GAAGF,EAAU,CAAC,KAAMI,EAAMN,EAAY,CAAC,CAAC,CAC/C,CAAK,CAEL,CAEA,SAASY,GAAmBN,EAAO,CACjC,MAAMQ,EAAgBR,EAAM,OAAO,CAAC,CAACS,EAAGvB,CAAI,IAAMA,IAAS,MAAS,EAC9DwB,EAAS,KAAK,IAAI,GAAGF,EAAc,IAAI,CAAC,CAACG,CAAM,IAAMA,EAAO,MAAM,CAAC,EACzE,OAAOH,EACJ,IAAI,CAAC,CAACG,EAAQzB,CAAI,IAAMyB,EAAO,SAASD,CAAM,GAAKxB,EAAO,IAAMA,EAAO,GAAG,EAC1E,KAAK;AAAA,CAAI,CACd,CC1DA,SAAS0B,GAAoBC,EAAM,CACjC,MAAMC,EAAWD,EAAK,CAAC,EAEvB,OAAIC,GAAY,MAAQ,SAAUA,GAAY,WAAYA,EACjD,CACL,MAAOA,EACP,OAAQD,EAAK,CAAC,EACd,UAAWA,EAAK,CAAC,EACjB,KAAMA,EAAK,CAAC,EACZ,cAAeA,EAAK,CAAC,EACrB,WAAYA,EAAK,CAAC,CACxB,EAGSC,CACT,CAQO,MAAMC,WAAqB,KAAM,CA8CtC,YAAYtC,KAAYuC,EAAS,CAC/B,IAAIC,EAAaC,EAAiBC,EAElC,KAAM,CAAE,MAAAC,EAAO,OAAArC,EAAQ,UAAAsC,EAAW,KAAAC,EAAM,cAAAC,EAAe,WAAAC,CAAU,EAC/DZ,GAAoBI,CAAO,EAC7B,MAAMvC,CAAO,EACb,KAAK,KAAO,eACZ,KAAK,KAAO6C,GAAS,KAA0BA,EAAO,OACtD,KAAK,cACHC,GAAkB,KACdA,EACA,OAEN,KAAK,MAAQE,GACX,MAAM,QAAQL,CAAK,EAAIA,EAAQA,EAAQ,CAACA,CAAK,EAAI,MACvD,EACI,MAAMM,EAAgBD,IACnBR,EAAc,KAAK,SAAW,MAAQA,IAAgB,OACnD,OACAA,EAAY,IAAKU,GAASA,EAAK,GAAG,EAAE,OAAQC,GAAQA,GAAO,IAAI,CACzE,EAEI,KAAK,OACH7C,GAAW,KACPA,EACA2C,GAAkB,OAEjBR,EAAkBQ,EAAc,CAAC,KAAO,MACzCR,IAAoB,OAFpB,OAIAA,EAAgB,OACtB,KAAK,UACHG,GAAc,KACVA,EACAK,GAAkB,KAClB,OACAA,EAAc,IAAKE,GAAQA,EAAI,KAAK,EAC1C,KAAK,UACHP,GAAatC,EACTsC,EAAU,IAAKQ,GAAQ/C,GAAYC,EAAQ8C,CAAG,CAAC,EAC/CH,GAAkB,KAClB,OACAA,EAAc,IAAKE,GAAQ9C,GAAY8C,EAAI,OAAQA,EAAI,KAAK,CAAC,EACnE,MAAME,EAAqBpD,GACzB6C,GAAkB,KACd,OACAA,EAAc,UACxB,EACQA,GAAkB,KAChB,OACAA,EAAc,WAChB,OACJ,KAAK,YACFJ,EACCK,GAAe,KACXA,EACAM,KAAwB,MAAQX,IAAS,OAC3CA,EACA,OAAO,OAAO,IAAI,EAGxB,OAAO,iBAAiB,KAAM,CAC5B,QAAS,CACP,SAAU,GACV,WAAY,EACpB,EACM,KAAM,CACJ,WAAY,EACpB,EACM,MAAO,CACL,WAAY,EACpB,EACM,OAAQ,CACN,WAAY,EACpB,EACM,UAAW,CACT,WAAY,EACpB,EACM,cAAe,CACb,WAAY,EACpB,CACA,CAAK,EAMCI,GAAkB,MAElBA,EAAc,MAEd,OAAO,eAAe,KAAM,QAAS,CACnC,MAAOA,EAAc,MACrB,SAAU,GACV,aAAc,EACtB,CAAO,EACQ,MAAM,kBACf,MAAM,kBAAkB,KAAMR,EAAY,EAE1C,OAAO,eAAe,KAAM,QAAS,CACnC,MAAO,MAAK,EAAG,MACf,SAAU,GACV,aAAc,EACtB,CAAO,CAGL,CAEA,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,cACT,CAEA,UAAW,CACT,IAAIgB,EAAS,KAAK,QAElB,GAAI,KAAK,MACP,UAAWJ,KAAQ,KAAK,MAClBA,EAAK,MACPI,GAAU;AAAA;AAAA,EAAS3C,GAAcuC,EAAK,GAAG,WAGpC,KAAK,QAAU,KAAK,UAC7B,UAAWtC,KAAY,KAAK,UAC1B0C,GAAU;AAAA;AAAA,EAASzC,GAAoB,KAAK,OAAQD,CAAQ,EAIhE,OAAO0C,CACT,CAEA,QAAS,CACP,MAAMC,EAAiB,CACrB,QAAS,KAAK,OACpB,EAEI,OAAI,KAAK,WAAa,OACpBA,EAAe,UAAY,KAAK,WAG9B,KAAK,MAAQ,OACfA,EAAe,KAAO,KAAK,MAGzB,KAAK,YAAc,MAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,OAAS,IACnEA,EAAe,WAAa,KAAK,YAG5BA,CACT,CACF,CAEA,SAASP,GAAiBQ,EAAO,CAC/B,OAAOA,IAAU,QAAaA,EAAM,SAAW,EAAI,OAAYA,CACjE,CC/NO,SAASC,EAAYnD,EAAQC,EAAUmD,EAAa,CACzD,OAAO,IAAIpB,GAAa,iBAAiBoB,CAAW,GAAI,CACtD,OAAApD,EACA,UAAW,CAACC,CAAQ,CACxB,CAAG,CACH,CCPO,MAAMoD,EAAS,CAoBpB,YAAYC,EAAYC,EAAUvD,EAAQ,CACxC,KAAK,MAAQsD,EAAW,MACxB,KAAK,IAAMC,EAAS,IACpB,KAAK,WAAaD,EAClB,KAAK,SAAWC,EAChB,KAAK,OAASvD,CAChB,CAEA,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,UACT,CAEA,QAAS,CACP,MAAO,CACL,MAAO,KAAK,MACZ,IAAK,KAAK,GAChB,CACE,CACF,CAMO,MAAMwD,EAAM,CAiCjB,YAAYC,EAAMC,EAAOC,EAAKxD,EAAMyD,EAAQhE,EAAO,CACjD,KAAK,KAAO6D,EACZ,KAAK,MAAQC,EACb,KAAK,IAAMC,EACX,KAAK,KAAOxD,EACZ,KAAK,OAASyD,EAEd,KAAK,MAAQhE,EACb,KAAK,KAAO,KACZ,KAAK,KAAO,IACd,CAEA,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,OACT,CAEA,QAAS,CACP,MAAO,CACL,KAAM,KAAK,KACX,MAAO,KAAK,MACZ,KAAM,KAAK,KACX,OAAQ,KAAK,MACnB,CACE,CACF,CAQO,MAAMiE,GAAoB,CAC/B,KAAM,CAAA,EACN,SAAU,CAAC,aAAa,EACxB,oBAAqB,CACnB,OACA,sBACA,aACA,cACJ,EACE,mBAAoB,CAAC,WAAY,OAAQ,eAAgB,YAAY,EACrE,SAAU,CAAC,MAAM,EACjB,aAAc,CAAC,YAAY,EAC3B,MAAO,CAAC,QAAS,OAAQ,YAAa,aAAc,cAAc,EAClE,SAAU,CAAC,OAAQ,OAAO,EAC1B,eAAgB,CAAC,OAAQ,YAAY,EACrC,eAAgB,CAAC,gBAAiB,aAAc,cAAc,EAC9D,mBAAoB,CAClB,OACA,sBACA,gBACA,aACA,cACJ,EACE,SAAU,CAAA,EACV,WAAY,CAAA,EACZ,YAAa,CAAA,EACb,aAAc,CAAA,EACd,UAAW,CAAA,EACX,UAAW,CAAA,EACX,UAAW,CAAC,QAAQ,EACpB,YAAa,CAAC,QAAQ,EACtB,YAAa,CAAC,OAAQ,OAAO,EAC7B,UAAW,CAAC,OAAQ,WAAW,EAC/B,UAAW,CAAC,MAAM,EAClB,SAAU,CAAC,MAAM,EACjB,YAAa,CAAC,MAAM,EACpB,iBAAkB,CAAC,cAAe,aAAc,gBAAgB,EAChE,wBAAyB,CAAC,MAAM,EAChC,qBAAsB,CAAC,cAAe,OAAQ,YAAY,EAC1D,qBAAsB,CACpB,cACA,OACA,aACA,aACA,QACJ,EACE,gBAAiB,CAAC,cAAe,OAAQ,YAAa,OAAQ,YAAY,EAC1E,qBAAsB,CACpB,cACA,OACA,OACA,eACA,YACJ,EACE,wBAAyB,CACvB,cACA,OACA,aACA,aACA,QACJ,EACE,oBAAqB,CAAC,cAAe,OAAQ,aAAc,OAAO,EAClE,mBAAoB,CAAC,cAAe,OAAQ,aAAc,QAAQ,EAClE,oBAAqB,CAAC,cAAe,OAAQ,YAAY,EACzD,0BAA2B,CAAC,cAAe,OAAQ,aAAc,QAAQ,EACzE,oBAAqB,CAAC,cAAe,OAAQ,YAAa,WAAW,EACrE,gBAAiB,CAAC,aAAc,gBAAgB,EAChD,oBAAqB,CAAC,OAAQ,YAAY,EAC1C,oBAAqB,CAAC,OAAQ,aAAc,aAAc,QAAQ,EAClE,uBAAwB,CAAC,OAAQ,aAAc,aAAc,QAAQ,EACrE,mBAAoB,CAAC,OAAQ,aAAc,OAAO,EAClD,kBAAmB,CAAC,OAAQ,aAAc,QAAQ,EAClD,yBAA0B,CAAC,OAAQ,aAAc,QAAQ,CAC3D,EACMC,GAAa,IAAI,IAAI,OAAO,KAAKD,EAAiB,CAAC,EAKlD,SAASE,GAAOC,EAAW,CAChC,MAAMC,EACJD,GAAc,KAA+B,OAASA,EAAU,KAClE,OAAO,OAAOC,GAAc,UAAYH,GAAW,IAAIG,CAAS,CAClE,CAGA,IAAIC,IAEH,SAAUA,EAAmB,CAC5BA,EAAkB,MAAW,QAC7BA,EAAkB,SAAc,WAChCA,EAAkB,aAAkB,cACtC,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EC1MhD,IAAIC,IAEH,SAAUA,EAAmB,CAC5BA,EAAkB,MAAW,QAC7BA,EAAkB,SAAc,WAChCA,EAAkB,aAAkB,eACpCA,EAAkB,MAAW,QAC7BA,EAAkB,oBAAyB,sBAC3CA,EAAkB,gBAAqB,kBACvCA,EAAkB,gBAAqB,kBACvCA,EAAkB,oBAAyB,sBAC3CA,EAAkB,OAAY,SAC9BA,EAAkB,OAAY,SAC9BA,EAAkB,OAAY,SAC9BA,EAAkB,iBAAsB,mBACxCA,EAAkB,oBAAyB,sBAC3CA,EAAkB,UAAe,YACjCA,EAAkB,MAAW,QAC7BA,EAAkB,KAAU,OAC5BA,EAAkB,WAAgB,aAClCA,EAAkB,aAAkB,eACpCA,EAAkB,uBAA4B,wBAChD,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,ECtBhD,IAAIC,GAEH,SAAUA,EAAM,CACfA,EAAK,KAAU,OACfA,EAAK,SAAc,WACnBA,EAAK,qBAA0B,sBAC/BA,EAAK,oBAAyB,qBAC9BA,EAAK,cAAmB,eACxBA,EAAK,MAAW,QAChBA,EAAK,SAAc,WACnBA,EAAK,gBAAqB,iBAC1BA,EAAK,gBAAqB,iBAC1BA,EAAK,oBAAyB,qBAC9BA,EAAK,SAAc,WACnBA,EAAK,IAAS,WACdA,EAAK,MAAW,aAChBA,EAAK,OAAY,cACjBA,EAAK,QAAa,eAClBA,EAAK,KAAU,YACfA,EAAK,KAAU,YACfA,EAAK,KAAU,YACfA,EAAK,OAAY,cACjBA,EAAK,aAAkB,cACvBA,EAAK,UAAe,YACpBA,EAAK,WAAgB,YACrBA,EAAK,UAAe,WACpBA,EAAK,cAAmB,cACxBA,EAAK,kBAAuB,mBAC5BA,EAAK,0BAA+B,0BACpCA,EAAK,uBAA4B,uBACjCA,EAAK,uBAA4B,uBACjCA,EAAK,iBAAsB,kBAC3BA,EAAK,uBAA4B,uBACjCA,EAAK,0BAA+B,0BACpCA,EAAK,sBAA2B,sBAChCA,EAAK,qBAA0B,qBAC/BA,EAAK,sBAA2B,sBAChCA,EAAK,6BAAkC,4BACvCA,EAAK,qBAA0B,sBAC/BA,EAAK,iBAAsB,kBAC3BA,EAAK,sBAA2B,sBAChCA,EAAK,sBAA2B,sBAChCA,EAAK,yBAA8B,yBACnCA,EAAK,qBAA0B,qBAC/BA,EAAK,oBAAyB,oBAC9BA,EAAK,4BAAiC,0BACxC,GAAGA,IAASA,EAAO,CAAA,EAAG,ECzCf,SAASC,GAAaC,EAAM,CACjC,OAAOA,IAAS,GAAUA,IAAS,EACrC,CASO,SAASC,GAAQD,EAAM,CAC5B,OAAOA,GAAQ,IAAUA,GAAQ,EACnC,CAYO,SAASE,GAASF,EAAM,CAC7B,OACGA,GAAQ,IAAUA,GAAQ,KAC1BA,GAAQ,IAAUA,GAAQ,EAE/B,CAUO,SAASG,GAAYH,EAAM,CAChC,OAAOE,GAASF,CAAI,GAAKA,IAAS,EACpC,CAWO,SAASI,GAAeJ,EAAM,CACnC,OAAOE,GAASF,CAAI,GAAKC,GAAQD,CAAI,GAAKA,IAAS,EACrD,CCrDO,SAASK,GAAuB1D,EAAO,CAC5C,IAAI2D,EAEJ,IAAIC,EAAe,OAAO,iBACtBC,EAAoB,KACpBC,EAAmB,GAEvB,QAASzD,EAAI,EAAGA,EAAIL,EAAM,OAAQ,EAAEK,EAAG,CACrC,IAAI0D,EAEJ,MAAM7E,EAAOc,EAAMK,CAAC,EACd2D,EAASC,GAAkB/E,CAAI,EAEjC8E,IAAW9E,EAAK,SAIpB2E,GACGE,EAAqBF,KAAuB,MAC7CE,IAAuB,OACnBA,EACA1D,EACNyD,EAAmBzD,EAEfA,IAAM,GAAK2D,EAASJ,IACtBA,EAAeI,GAEnB,CAEA,OAAOhE,EACJ,IAAI,CAACd,EAAMmB,IAAOA,IAAM,EAAInB,EAAOA,EAAK,MAAM0E,CAAY,CAAE,EAC5D,OACED,EAAsBE,KAAuB,MAC5CF,IAAwB,OACtBA,EACA,EACJG,EAAmB,CACzB,CACA,CAEA,SAASG,GAAkBxG,EAAK,CAC9B,IAAI4C,EAAI,EAER,KAAOA,EAAI5C,EAAI,QAAU2F,GAAa3F,EAAI,WAAW4C,CAAC,CAAC,GACrD,EAAEA,EAGJ,OAAOA,CACT,CAgFO,SAAS6D,GAAiBvF,EAAOwF,EAAS,CAC/C,MAAMC,EAAezF,EAAM,QAAQ,OAAQ,OAAO,EAE5CqB,EAAQoE,EAAa,MAAM,cAAc,EACzCC,EAAerE,EAAM,SAAW,EAEhCsE,EACJtE,EAAM,OAAS,GACfA,EACG,MAAM,CAAC,EACP,MAAOd,GAASA,EAAK,SAAW,GAAKkE,GAAalE,EAAK,WAAW,CAAC,CAAC,CAAC,EAEpEqF,EAA0BH,EAAa,SAAS,OAAO,EAEvDI,EAAmB7F,EAAM,SAAS,GAAG,GAAK,CAAC4F,EAC3CE,EAAmB9F,EAAM,SAAS,IAAI,EACtC+F,EAAuBF,GAAoBC,EAC3CE,EAEH,CAACN,GACA1F,EAAM,OAAS,IACf+F,GACAJ,GACAC,EACJ,IAAIK,EAAS,GAEb,MAAMC,EAAqBR,GAAgBjB,GAAazE,EAAM,WAAW,CAAC,CAAC,EAE3E,OAAKgG,GAAwB,CAACE,GAAuBP,KACnDM,GAAU;AAAA,GAGZA,GAAUR,GAENO,GAAwBD,KAC1BE,GAAU;AAAA,GAGL,MAAQA,EAAS,KAC1B,CC7KA,IAAIE,GAEH,SAAUA,EAAW,CACpBA,EAAU,IAAS,QACnBA,EAAU,IAAS,QACnBA,EAAU,KAAU,IACpBA,EAAU,OAAY,IACtBA,EAAU,IAAS,IACnBA,EAAU,QAAa,IACvBA,EAAU,QAAa,IACvBA,EAAU,OAAY,MACtBA,EAAU,MAAW,IACrBA,EAAU,OAAY,IACtBA,EAAU,GAAQ,IAClBA,EAAU,UAAe,IACzBA,EAAU,UAAe,IACzBA,EAAU,QAAa,IACvBA,EAAU,KAAU,IACpBA,EAAU,QAAa,IACvBA,EAAU,KAAU,OACpBA,EAAU,IAAS,MACnBA,EAAU,MAAW,QACrBA,EAAU,OAAY,SACtBA,EAAU,aAAkB,cAC5BA,EAAU,QAAa,SACzB,GAAGA,IAAcA,EAAY,CAAA,EAAG,ECfzB,MAAMC,EAAM,CAgBjB,YAAYhG,EAAQ,CAClB,MAAMiG,EAAmB,IAAIzC,GAAMuC,EAAU,IAAK,EAAG,EAAG,EAAG,CAAC,EAC5D,KAAK,OAAS/F,EACd,KAAK,UAAYiG,EACjB,KAAK,MAAQA,EACb,KAAK,KAAO,EACZ,KAAK,UAAY,CACnB,CAEA,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,OACT,CAKA,SAAU,CACR,YAAK,UAAY,KAAK,MACP,KAAK,MAAQ,KAAK,UAAS,CAE5C,CAMA,WAAY,CACV,IAAIC,EAAQ,KAAK,MAEjB,GAAIA,EAAM,OAASH,EAAU,IAC3B,EACE,IAAIG,EAAM,KACRA,EAAQA,EAAM,SACT,CAEL,MAAMC,EAAYC,GAAc,KAAMF,EAAM,GAAG,EAE/CA,EAAM,KAAOC,EAEbA,EAAU,KAAOD,EACjBA,EAAQC,CACV,OACOD,EAAM,OAASH,EAAU,SAGpC,OAAOG,CACT,CACF,CAKO,SAASG,GAAsB5C,EAAM,CAC1C,OACEA,IAASsC,EAAU,MACnBtC,IAASsC,EAAU,QACnBtC,IAASsC,EAAU,KACnBtC,IAASsC,EAAU,SACnBtC,IAASsC,EAAU,SACnBtC,IAASsC,EAAU,QACnBtC,IAASsC,EAAU,OACnBtC,IAASsC,EAAU,QACnBtC,IAASsC,EAAU,IACnBtC,IAASsC,EAAU,WACnBtC,IAASsC,EAAU,WACnBtC,IAASsC,EAAU,SACnBtC,IAASsC,EAAU,MACnBtC,IAASsC,EAAU,OAEvB,CAUA,SAASO,GAAqBhC,EAAM,CAClC,OACGA,GAAQ,GAAUA,GAAQ,OAAYA,GAAQ,OAAUA,GAAQ,OAErE,CAUA,SAASiC,GAAyB7F,EAAMJ,EAAU,CAChD,OACEkG,GAAmB9F,EAAK,WAAWJ,CAAQ,CAAC,GAC5CmG,GAAoB/F,EAAK,WAAWJ,EAAW,CAAC,CAAC,CAErD,CAEA,SAASkG,GAAmBlC,EAAM,CAChC,OAAOA,GAAQ,OAAUA,GAAQ,KACnC,CAEA,SAASmC,GAAoBnC,EAAM,CACjC,OAAOA,GAAQ,OAAUA,GAAQ,KACnC,CASA,SAASoC,GAAiBC,EAAOrG,EAAU,CACzC,MAAMgE,EAAOqC,EAAM,OAAO,KAAK,YAAYrG,CAAQ,EAEnD,GAAIgE,IAAS,OACX,OAAOyB,EAAU,IACZ,GAAIzB,GAAQ,IAAUA,GAAQ,IAAQ,CAE3C,MAAMsC,EAAO,OAAO,cAActC,CAAI,EACtC,OAAOsC,IAAS,IAAM,MAAS,IAAIA,CAAI,GACzC,CAEA,MAAO,KAAOtC,EAAK,SAAS,EAAE,EAAE,cAAc,SAAS,EAAG,GAAG,CAC/D,CAKA,SAASuC,EAAYF,EAAOlD,EAAMC,EAAOC,EAAK/D,EAAO,CACnD,MAAMO,EAAOwG,EAAM,KACbG,EAAM,EAAIpD,EAAQiD,EAAM,UAC9B,OAAO,IAAInD,GAAMC,EAAMC,EAAOC,EAAKxD,EAAM2G,EAAKlH,CAAK,CACrD,CASA,SAASwG,GAAcO,EAAOjD,EAAO,CACnC,MAAMhD,EAAOiG,EAAM,OAAO,KACpBI,EAAarG,EAAK,OACxB,IAAIT,EAAWyD,EAEf,KAAOzD,EAAW8G,GAAY,CAC5B,MAAMzC,EAAO5D,EAAK,WAAWT,CAAQ,EAErC,OAAQqE,EAAI,CAeV,IAAK,OAEL,IAAK,GAEL,IAAK,IAEL,IAAK,IAEH,EAAErE,EACF,SAMF,IAAK,IAEH,EAAEA,EACF,EAAE0G,EAAM,KACRA,EAAM,UAAY1G,EAClB,SAEF,IAAK,IAECS,EAAK,WAAWT,EAAW,CAAC,IAAM,GACpCA,GAAY,EAEZ,EAAEA,EAGJ,EAAE0G,EAAM,KACRA,EAAM,UAAY1G,EAClB,SAGF,IAAK,IAEH,OAAO+G,GAAYL,EAAO1G,CAAQ,EAUpC,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,KAAM9F,EAAUA,EAAW,CAAC,EAElE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,OAAQ9F,EAAUA,EAAW,CAAC,EAEpE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,IAAK9F,EAAUA,EAAW,CAAC,EAEjE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,QAAS9F,EAAUA,EAAW,CAAC,EAErE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,QAAS9F,EAAUA,EAAW,CAAC,EAErE,IAAK,IAEH,GACES,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,GAElC,OAAO4G,EAAYF,EAAOZ,EAAU,OAAQ9F,EAAUA,EAAW,CAAC,EAGpE,MAEF,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,MAAO9F,EAAUA,EAAW,CAAC,EAEnE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,OAAQ9F,EAAUA,EAAW,CAAC,EAEpE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,GAAI9F,EAAUA,EAAW,CAAC,EAEhE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,UAAW9F,EAAUA,EAAW,CAAC,EAEvE,IAAK,IAEH,OAAO4G,EAAYF,EAAOZ,EAAU,UAAW9F,EAAUA,EAAW,CAAC,EAEvE,IAAK,KAEH,OAAO4G,EAAYF,EAAOZ,EAAU,QAAS9F,EAAUA,EAAW,CAAC,EAErE,IAAK,KAEH,OAAO4G,EAAYF,EAAOZ,EAAU,KAAM9F,EAAUA,EAAW,CAAC,EAElE,IAAK,KAEH,OAAO4G,EAAYF,EAAOZ,EAAU,QAAS9F,EAAUA,EAAW,CAAC,EAGrE,IAAK,IAEH,OACES,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,GAE3BgH,GAAgBN,EAAO1G,CAAQ,EAGjCiH,GAAWP,EAAO1G,CAAQ,CACzC,CAEI,GAAIsE,GAAQD,CAAI,GAAKA,IAAS,GAC5B,OAAO6C,GAAWR,EAAO1G,EAAUqE,CAAI,EAGzC,GAAIG,GAAYH,CAAI,EAClB,OAAO8C,GAAST,EAAO1G,CAAQ,EAGjC,MAAMkD,EACJwD,EAAM,OACN1G,EACAqE,IAAS,GACL,iFACAgC,GAAqBhC,CAAI,GAAKiC,GAAyB7F,EAAMT,CAAQ,EACrE,yBAAyByG,GAAiBC,EAAO1G,CAAQ,CAAC,IAC1D,sBAAsByG,GAAiBC,EAAO1G,CAAQ,CAAC,GACjE,CACE,CAEA,OAAO4G,EAAYF,EAAOZ,EAAU,IAAKgB,EAAYA,CAAU,CACjE,CAWA,SAASC,GAAYL,EAAOjD,EAAO,CACjC,MAAMhD,EAAOiG,EAAM,OAAO,KACpBI,EAAarG,EAAK,OACxB,IAAIT,EAAWyD,EAAQ,EAEvB,KAAOzD,EAAW8G,GAAY,CAC5B,MAAMzC,EAAO5D,EAAK,WAAWT,CAAQ,EAErC,GAAIqE,IAAS,IAAUA,IAAS,GAC9B,MAGF,GAAIgC,GAAqBhC,CAAI,EAC3B,EAAErE,UACOsG,GAAyB7F,EAAMT,CAAQ,EAChDA,GAAY,MAEZ,MAEJ,CAEA,OAAO4G,EACLF,EACAZ,EAAU,QACVrC,EACAzD,EACAS,EAAK,MAAMgD,EAAQ,EAAGzD,CAAQ,CAClC,CACA,CA+BA,SAASkH,GAAWR,EAAOjD,EAAO2D,EAAW,CAC3C,MAAM3G,EAAOiG,EAAM,OAAO,KAC1B,IAAI1G,EAAWyD,EACXY,EAAO+C,EACPC,EAAU,GAMd,GAJIhD,IAAS,KACXA,EAAO5D,EAAK,WAAW,EAAET,CAAQ,GAG/BqE,IAAS,IAGX,GAFAA,EAAO5D,EAAK,WAAW,EAAET,CAAQ,EAE7BsE,GAAQD,CAAI,EACd,MAAMnB,EACJwD,EAAM,OACN1G,EACA,6CAA6CyG,GAC3CC,EACA1G,CACV,CAAS,GACT,OAGIA,EAAWsH,GAAWZ,EAAO1G,EAAUqE,CAAI,EAC3CA,EAAO5D,EAAK,WAAWT,CAAQ,EAsBjC,GAnBIqE,IAAS,KACXgD,EAAU,GACVhD,EAAO5D,EAAK,WAAW,EAAET,CAAQ,EACjCA,EAAWsH,GAAWZ,EAAO1G,EAAUqE,CAAI,EAC3CA,EAAO5D,EAAK,WAAWT,CAAQ,IAG7BqE,IAAS,IAAUA,IAAS,OAC9BgD,EAAU,GACVhD,EAAO5D,EAAK,WAAW,EAAET,CAAQ,GAE7BqE,IAAS,IAAUA,IAAS,MAC9BA,EAAO5D,EAAK,WAAW,EAAET,CAAQ,GAGnCA,EAAWsH,GAAWZ,EAAO1G,EAAUqE,CAAI,EAC3CA,EAAO5D,EAAK,WAAWT,CAAQ,GAG7BqE,IAAS,IAAUG,GAAYH,CAAI,EACrC,MAAMnB,EACJwD,EAAM,OACN1G,EACA,2CAA2CyG,GACzCC,EACA1G,CACR,CAAO,GACP,EAGE,OAAO4G,EACLF,EACAW,EAAUvB,EAAU,MAAQA,EAAU,IACtCrC,EACAzD,EACAS,EAAK,MAAMgD,EAAOzD,CAAQ,CAC9B,CACA,CAKA,SAASsH,GAAWZ,EAAOjD,EAAO2D,EAAW,CAC3C,GAAI,CAAC9C,GAAQ8C,CAAS,EACpB,MAAMlE,EACJwD,EAAM,OACNjD,EACA,2CAA2CgD,GACzCC,EACAjD,CACR,CAAO,GACP,EAGE,MAAMhD,EAAOiG,EAAM,OAAO,KAC1B,IAAI1G,EAAWyD,EAAQ,EAEvB,KAAOa,GAAQ7D,EAAK,WAAWT,CAAQ,CAAC,GACtC,EAAEA,EAGJ,OAAOA,CACT,CAsBA,SAASiH,GAAWP,EAAOjD,EAAO,CAChC,MAAMhD,EAAOiG,EAAM,OAAO,KACpBI,EAAarG,EAAK,OACxB,IAAIT,EAAWyD,EAAQ,EACnB8D,EAAavH,EACbL,EAAQ,GAEZ,KAAOK,EAAW8G,GAAY,CAC5B,MAAMzC,EAAO5D,EAAK,WAAWT,CAAQ,EAErC,GAAIqE,IAAS,GACX,OAAA1E,GAASc,EAAK,MAAM8G,EAAYvH,CAAQ,EACjC4G,EAAYF,EAAOZ,EAAU,OAAQrC,EAAOzD,EAAW,EAAGL,CAAK,EAGxE,GAAI0E,IAAS,GAAQ,CACnB1E,GAASc,EAAK,MAAM8G,EAAYvH,CAAQ,EACxC,MAAMwH,EACJ/G,EAAK,WAAWT,EAAW,CAAC,IAAM,IAC9BS,EAAK,WAAWT,EAAW,CAAC,IAAM,IAChCyH,GAAgCf,EAAO1G,CAAQ,EAC/C0H,GAA6BhB,EAAO1G,CAAQ,EAC9C2H,GAAqBjB,EAAO1G,CAAQ,EAC1CL,GAAS6H,EAAO,MAChBxH,GAAYwH,EAAO,KACnBD,EAAavH,EACb,QACF,CAEA,GAAIqE,IAAS,IAAUA,IAAS,GAC9B,MAGF,GAAIgC,GAAqBhC,CAAI,EAC3B,EAAErE,UACOsG,GAAyB7F,EAAMT,CAAQ,EAChDA,GAAY,MAEZ,OAAMkD,EACJwD,EAAM,OACN1G,EACA,oCAAoCyG,GAClCC,EACA1G,CACV,CAAS,GACT,CAEE,CAEA,MAAMkD,EAAYwD,EAAM,OAAQ1G,EAAU,sBAAsB,CAClE,CAEA,SAASyH,GAAgCf,EAAO1G,EAAU,CACxD,MAAMS,EAAOiG,EAAM,OAAO,KAC1B,IAAIkB,EAAQ,EACRC,EAAO,EAEX,KAAOA,EAAO,IAAI,CAChB,MAAMxD,EAAO5D,EAAK,WAAWT,EAAW6H,GAAM,EAE9C,GAAIxD,IAAS,IAAQ,CAEnB,GAAIwD,EAAO,GAAK,CAACxB,GAAqBuB,CAAK,EACzC,MAGF,MAAO,CACL,MAAO,OAAO,cAAcA,CAAK,EACjC,KAAAC,CACR,CACI,CAIA,GAFAD,EAASA,GAAS,EAAKE,GAAazD,CAAI,EAEpCuD,EAAQ,EACV,KAEJ,CAEA,MAAM1E,EACJwD,EAAM,OACN1G,EACA,qCAAqCS,EAAK,MACxCT,EACAA,EAAW6H,CACjB,CAAK,IACL,CACA,CAEA,SAASH,GAA6BhB,EAAO1G,EAAU,CACrD,MAAMS,EAAOiG,EAAM,OAAO,KACpBrC,EAAO0D,GAAiBtH,EAAMT,EAAW,CAAC,EAEhD,GAAIqG,GAAqBhC,CAAI,EAC3B,MAAO,CACL,MAAO,OAAO,cAAcA,CAAI,EAChC,KAAM,CACZ,EAIE,GAAIkC,GAAmBlC,CAAI,GAGvB5D,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClC,CACA,MAAMgI,EAAeD,GAAiBtH,EAAMT,EAAW,CAAC,EAExD,GAAIwG,GAAoBwB,CAAY,EAOlC,MAAO,CACL,MAAO,OAAO,cAAc3D,EAAM2D,CAAY,EAC9C,KAAM,EAChB,CAEI,CAGF,MAAM9E,EACJwD,EAAM,OACN1G,EACA,qCAAqCS,EAAK,MAAMT,EAAUA,EAAW,CAAC,CAAC,IAC3E,CACA,CASA,SAAS+H,GAAiBtH,EAAMT,EAAU,CAGxC,OACG8H,GAAarH,EAAK,WAAWT,CAAQ,CAAC,GAAK,GAC3C8H,GAAarH,EAAK,WAAWT,EAAW,CAAC,CAAC,GAAK,EAC/C8H,GAAarH,EAAK,WAAWT,EAAW,CAAC,CAAC,GAAK,EAChD8H,GAAarH,EAAK,WAAWT,EAAW,CAAC,CAAC,CAE9C,CAgBA,SAAS8H,GAAazD,EAAM,CAC1B,OAAOA,GAAQ,IAAUA,GAAQ,GAC7BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,GAC1BA,EAAO,GACPA,GAAQ,IAAUA,GAAQ,IAC1BA,EAAO,GACP,EACN,CAcA,SAASsD,GAAqBjB,EAAO1G,EAAU,CAC7C,MAAMS,EAAOiG,EAAM,OAAO,KAG1B,OAFajG,EAAK,WAAWT,EAAW,CAAC,EAE7B,CACV,IAAK,IAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,EAEI,IAAK,IAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO;AAAA,EACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,KACP,KAAM,CACd,EAEI,IAAK,KAEH,MAAO,CACL,MAAO,IACP,KAAM,CACd,CACA,CAEE,MAAMkD,EACJwD,EAAM,OACN1G,EACA,uCAAuCS,EAAK,MAC1CT,EACAA,EAAW,CACjB,CAAK,IACL,CACA,CAcA,SAASgH,GAAgBN,EAAOjD,EAAO,CACrC,MAAMhD,EAAOiG,EAAM,OAAO,KACpBI,EAAarG,EAAK,OACxB,IAAIwH,EAAYvB,EAAM,UAClB1G,EAAWyD,EAAQ,EACnB8D,EAAavH,EACbkI,EAAc,GAClB,MAAMC,EAAa,CAAA,EAEnB,KAAOnI,EAAW8G,GAAY,CAC5B,MAAMzC,EAAO5D,EAAK,WAAWT,CAAQ,EAErC,GACEqE,IAAS,IACT5D,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,GAClC,CACAkI,GAAezH,EAAK,MAAM8G,EAAYvH,CAAQ,EAC9CmI,EAAW,KAAKD,CAAW,EAC3B,MAAMjC,EAAQW,EACZF,EACAZ,EAAU,aACVrC,EACAzD,EAAW,EACX0E,GAAuByD,CAAU,EAAE,KAAK;AAAA,CAAI,CACpD,EACM,OAAAzB,EAAM,MAAQyB,EAAW,OAAS,EAClCzB,EAAM,UAAYuB,EACXhC,CACT,CAEA,GACE5B,IAAS,IACT5D,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,IAClCS,EAAK,WAAWT,EAAW,CAAC,IAAM,GAClC,CACAkI,GAAezH,EAAK,MAAM8G,EAAYvH,CAAQ,EAC9CuH,EAAavH,EAAW,EAExBA,GAAY,EACZ,QACF,CAEA,GAAIqE,IAAS,IAAUA,IAAS,GAAQ,CACtC6D,GAAezH,EAAK,MAAM8G,EAAYvH,CAAQ,EAC9CmI,EAAW,KAAKD,CAAW,EAEvB7D,IAAS,IAAU5D,EAAK,WAAWT,EAAW,CAAC,IAAM,GACvDA,GAAY,EAEZ,EAAEA,EAGJkI,EAAc,GACdX,EAAavH,EACbiI,EAAYjI,EACZ,QACF,CAEA,GAAIqG,GAAqBhC,CAAI,EAC3B,EAAErE,UACOsG,GAAyB7F,EAAMT,CAAQ,EAChDA,GAAY,MAEZ,OAAMkD,EACJwD,EAAM,OACN1G,EACA,oCAAoCyG,GAClCC,EACA1G,CACV,CAAS,GACT,CAEE,CAEA,MAAMkD,EAAYwD,EAAM,OAAQ1G,EAAU,sBAAsB,CAClE,CAUA,SAASmH,GAAST,EAAOjD,EAAO,CAC9B,MAAMhD,EAAOiG,EAAM,OAAO,KACpBI,EAAarG,EAAK,OACxB,IAAIT,EAAWyD,EAAQ,EAEvB,KAAOzD,EAAW8G,GAAY,CAC5B,MAAMzC,EAAO5D,EAAK,WAAWT,CAAQ,EAErC,GAAIyE,GAAeJ,CAAI,EACrB,EAAErE,MAEF,MAEJ,CAEA,OAAO4G,EACLF,EACAZ,EAAU,KACVrC,EACAzD,EACAS,EAAK,MAAMgD,EAAOzD,CAAQ,CAC9B,CACA,CCr4BA,MAAMoI,GAAmB,GACnBC,GAAsB,EAKrB,SAASC,GAAQ3I,EAAO,CAC7B,OAAO4I,GAAY5I,EAAO,EAAE,CAC9B,CAEA,SAAS4I,GAAY5I,EAAO6I,EAAY,CACtC,OAAQ,OAAO7I,EAAK,CAClB,IAAK,SACH,OAAO,KAAK,UAAUA,CAAK,EAE7B,IAAK,WACH,OAAOA,EAAM,KAAO,aAAaA,EAAM,IAAI,IAAM,aAEnD,IAAK,SACH,OAAO8I,GAAkB9I,EAAO6I,CAAU,EAE5C,QACE,OAAO,OAAO7I,CAAK,CACzB,CACA,CAEA,SAAS8I,GAAkB9I,EAAO+I,EAAsB,CACtD,GAAI/I,IAAU,KACZ,MAAO,OAGT,GAAI+I,EAAqB,SAAS/I,CAAK,EACrC,MAAO,aAGT,MAAM6I,EAAa,CAAC,GAAGE,EAAsB/I,CAAK,EAElD,GAAIgJ,GAAWhJ,CAAK,EAAG,CACrB,MAAMiJ,EAAYjJ,EAAM,SAExB,GAAIiJ,IAAcjJ,EAChB,OAAO,OAAOiJ,GAAc,SACxBA,EACAL,GAAYK,EAAWJ,CAAU,CAEzC,SAAW,MAAM,QAAQ7I,CAAK,EAC5B,OAAOkJ,GAAYlJ,EAAO6I,CAAU,EAGtC,OAAOM,GAAanJ,EAAO6I,CAAU,CACvC,CAEA,SAASG,GAAWhJ,EAAO,CACzB,OAAO,OAAOA,EAAM,QAAW,UACjC,CAEA,SAASmJ,GAAaC,EAAQP,EAAY,CACxC,MAAMQ,EAAU,OAAO,QAAQD,CAAM,EAErC,OAAIC,EAAQ,SAAW,EACd,KAGLR,EAAW,OAASH,GACf,IAAMY,GAAaF,CAAM,EAAI,IAM/B,KAHYC,EAAQ,IACzB,CAAC,CAACE,EAAKvJ,CAAK,IAAMuJ,EAAM,KAAOX,GAAY5I,EAAO6I,CAAU,CAChE,EAC2B,KAAK,IAAI,EAAI,IACxC,CAEA,SAASK,GAAY5F,EAAOuF,EAAY,CACtC,GAAIvF,EAAM,SAAW,EACnB,MAAO,KAGT,GAAIuF,EAAW,OAASH,GACtB,MAAO,UAGT,MAAMc,EAAM,KAAK,IAAIf,GAAkBnF,EAAM,MAAM,EAC7CmG,EAAYnG,EAAM,OAASkG,EAC3BE,EAAQ,CAAA,EAEd,QAAShI,EAAI,EAAGA,EAAI8H,EAAK,EAAE9H,EACzBgI,EAAM,KAAKd,GAAYtF,EAAM5B,CAAC,EAAGmH,CAAU,CAAC,EAG9C,OAAIY,IAAc,EAChBC,EAAM,KAAK,iBAAiB,EACnBD,EAAY,GACrBC,EAAM,KAAK,OAAOD,CAAS,aAAa,EAGnC,IAAMC,EAAM,KAAK,IAAI,EAAI,GAClC,CAEA,SAASJ,GAAaF,EAAQ,CAC5B,MAAMO,EAAM,OAAO,UAAU,SAC1B,KAAKP,CAAM,EACX,QAAQ,aAAc,EAAE,EACxB,QAAQ,KAAM,EAAE,EAEnB,GAAIO,IAAQ,UAAY,OAAOP,EAAO,aAAgB,WAAY,CAChE,MAAMQ,EAAOR,EAAO,YAAY,KAEhC,GAAI,OAAOQ,GAAS,UAAYA,IAAS,GACvC,OAAOA,CAEX,CAEA,OAAOD,CACT,CCrGO,MAAME,GATX,WAAW,SACX,QAAQ,IAAI,WAAa,aAYrB,SAAoB7J,EAAO8J,EAAa,CACtC,OAAO9J,aAAiB8J,CAC1B,EACA,SAAoB9J,EAAO8J,EAAa,CACtC,GAAI9J,aAAiB8J,EACnB,MAAO,GAGT,GAAI,OAAO9J,GAAU,UAAYA,IAAU,KAAM,CAC/C,IAAI+J,EAGJ,MAAMC,EAAYF,EAAY,UAAU,OAAO,WAAW,EACpDG,EACJ,OAAO,eAAejK,EAClBA,EAAM,OAAO,WAAW,GACvB+J,EAAqB/J,EAAM,eAAiB,MAC7C+J,IAAuB,OACvB,OACAA,EAAmB,KAEzB,GAAIC,IAAcC,EAAgB,CAChC,MAAMC,EAAmBvB,GAAQ3I,CAAK,EACtC,MAAM,IAAI,MAAM,cAAcgK,CAAS,KAAKE,CAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAWtD,CACR,CACF,CAEA,MAAO,EACT,EC7CC,MAAMC,EAAO,CAClB,YACErJ,EACA8I,EAAO,kBACPQ,EAAiB,CACf,KAAM,EACN,OAAQ,CACd,EACI,CACA,OAAOtJ,GAAS,UACdlB,GAAU,GAAO,oCAAoC+I,GAAQ7H,CAAI,CAAC,GAAG,EACvE,KAAK,KAAOA,EACZ,KAAK,KAAO8I,EACZ,KAAK,eAAiBQ,EACtB,KAAK,eAAe,KAAO,GACzBxK,GACE,GACA,2DACR,EACI,KAAK,eAAe,OAAS,GAC3BA,GACE,GACA,6DACR,CACE,CAEA,IAAK,OAAO,WAAW,GAAI,CACzB,MAAO,QACT,CACF,CAOO,SAASyK,GAASjK,EAAQ,CAC/B,OAAOyJ,GAAWzJ,EAAQ+J,EAAM,CAClC,CClCO,SAASG,GAAMlK,EAAQoF,EAAS,CACrC,MAAM+E,EAAS,IAAIC,GAAOpK,EAAQoF,CAAO,EACnCiF,EAAWF,EAAO,cAAa,EACrC,cAAO,eAAeE,EAAU,aAAc,CAC5C,WAAY,GACZ,MAAOF,EAAO,UAClB,CAAG,EACME,CACT,CA6DO,MAAMD,EAAO,CAClB,YAAYpK,EAAQoF,EAAU,GAAI,CAChC,MAAMkF,EAAYL,GAASjK,CAAM,EAAIA,EAAS,IAAI+J,GAAO/J,CAAM,EAC/D,KAAK,OAAS,IAAIgG,GAAMsE,CAAS,EACjC,KAAK,SAAWlF,EAChB,KAAK,cAAgB,CACvB,CAEA,IAAI,YAAa,CACf,OAAO,KAAK,aACd,CAKA,WAAY,CACV,MAAMc,EAAQ,KAAK,YAAYH,EAAU,IAAI,EAC7C,OAAO,KAAK,KAAKG,EAAO,CACtB,KAAM9B,EAAK,KACX,MAAO8B,EAAM,KACnB,CAAK,CACH,CAMA,eAAgB,CACd,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAM9B,EAAK,SACX,YAAa,KAAK,KAChB2B,EAAU,IACV,KAAK,gBACLA,EAAU,GAClB,CACA,CAAK,CACH,CAyBA,iBAAkB,CAChB,GAAI,KAAK,KAAKA,EAAU,OAAO,EAC7B,OAAO,KAAK,yBAAwB,EAGtC,MAAMwE,EAAiB,KAAK,gBAAe,EACrCC,EAAeD,EACjB,KAAK,OAAO,UAAS,EACrB,KAAK,OAAO,MAEhB,GAAIC,EAAa,OAASzE,EAAU,KAAM,CACxC,OAAQyE,EAAa,MAAK,CACxB,IAAK,SACH,OAAO,KAAK,sBAAqB,EAEnC,IAAK,SACH,OAAO,KAAK,0BAAyB,EAEvC,IAAK,OACH,OAAO,KAAK,0BAAyB,EAEvC,IAAK,YACH,OAAO,KAAK,6BAA4B,EAE1C,IAAK,QACH,OAAO,KAAK,yBAAwB,EAEtC,IAAK,OACH,OAAO,KAAK,wBAAuB,EAErC,IAAK,QACH,OAAO,KAAK,+BAA8B,EAE5C,IAAK,YACH,OAAO,KAAK,yBAAwB,CAC9C,CAEM,GAAID,EACF,MAAMpH,EACJ,KAAK,OAAO,OACZ,KAAK,OAAO,MAAM,MAClB,8EACV,EAGM,OAAQqH,EAAa,MAAK,CACxB,IAAK,QACL,IAAK,WACL,IAAK,eACH,OAAO,KAAK,yBAAwB,EAEtC,IAAK,WACH,OAAO,KAAK,wBAAuB,EAErC,IAAK,SACH,OAAO,KAAK,yBAAwB,CAC9C,CACI,CAEA,MAAM,KAAK,WAAWA,CAAY,CACpC,CAQA,0BAA2B,CACzB,MAAM9G,EAAQ,KAAK,OAAO,MAE1B,GAAI,KAAK,KAAKqC,EAAU,OAAO,EAC7B,OAAO,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,qBACX,UAAWF,GAAkB,MAC7B,KAAM,OACN,oBAAqB,CAAA,EACrB,WAAY,CAAA,EACZ,aAAc,KAAK,kBAAiB,CAC5C,CAAO,EAGH,MAAMuG,EAAY,KAAK,mBAAkB,EACzC,IAAIjB,EAEJ,OAAI,KAAK,KAAKzD,EAAU,IAAI,IAC1ByD,EAAO,KAAK,UAAS,GAGhB,KAAK,KAAK9F,EAAO,CACtB,KAAMU,EAAK,qBACX,UAAAqG,EACA,KAAAjB,EACA,oBAAqB,KAAK,yBAAwB,EAClD,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAiB,CAC1C,CAAK,CACH,CAKA,oBAAqB,CACnB,MAAMkB,EAAiB,KAAK,YAAY3E,EAAU,IAAI,EAEtD,OAAQ2E,EAAe,MAAK,CAC1B,IAAK,QACH,OAAOxG,GAAkB,MAE3B,IAAK,WACH,OAAOA,GAAkB,SAE3B,IAAK,eACH,OAAOA,GAAkB,YACjC,CAEI,MAAM,KAAK,WAAWwG,CAAc,CACtC,CAKA,0BAA2B,CACzB,OAAO,KAAK,aACV3E,EAAU,QACV,KAAK,wBACLA,EAAU,OAChB,CACE,CAKA,yBAA0B,CACxB,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAM3B,EAAK,oBACX,SAAU,KAAK,cAAa,EAC5B,MAAO,KAAK,YAAY2B,EAAU,KAAK,EAAG,KAAK,sBAC/C,aAAc,KAAK,oBAAoBA,EAAU,MAAM,EACnD,KAAK,uBAAsB,EAC3B,OACJ,WAAY,KAAK,qBAAoB,CAC3C,CAAK,CACH,CAKA,eAAgB,CACd,MAAMrC,EAAQ,KAAK,OAAO,MAC1B,YAAK,YAAYqC,EAAU,MAAM,EAC1B,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,SACX,KAAM,KAAK,UAAS,CAC1B,CAAK,CACH,CAOA,mBAAoB,CAClB,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMA,EAAK,cACX,WAAY,KAAK,KACf2B,EAAU,QACV,KAAK,eACLA,EAAU,OAClB,CACA,CAAK,CACH,CAQA,gBAAiB,CACf,OAAO,KAAK,KAAKA,EAAU,MAAM,EAC7B,KAAK,cAAa,EAClB,KAAK,WAAU,CACrB,CAOA,YAAa,CACX,MAAMrC,EAAQ,KAAK,OAAO,MACpBiH,EAAc,KAAK,UAAS,EAClC,IAAIC,EACApB,EAEJ,OAAI,KAAK,oBAAoBzD,EAAU,KAAK,GAC1C6E,EAAQD,EACRnB,EAAO,KAAK,UAAS,GAErBA,EAAOmB,EAGF,KAAK,KAAKjH,EAAO,CACtB,KAAMU,EAAK,MACX,MAAAwG,EACA,KAAApB,EACA,UAAW,KAAK,eAAe,EAAK,EACpC,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,KAAKzD,EAAU,OAAO,EACrC,KAAK,kBAAiB,EACtB,MACV,CAAK,CACH,CAKA,eAAe8E,EAAS,CACtB,MAAMC,EAAOD,EAAU,KAAK,mBAAqB,KAAK,cACtD,OAAO,KAAK,aAAa9E,EAAU,QAAS+E,EAAM/E,EAAU,OAAO,CACrE,CAKA,cAAc8E,EAAU,GAAO,CAC7B,MAAMnH,EAAQ,KAAK,OAAO,MACpB8F,EAAO,KAAK,UAAS,EAC3B,YAAK,YAAYzD,EAAU,KAAK,EACzB,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,SACX,KAAAoF,EACA,MAAO,KAAK,kBAAkBqB,CAAO,CAC3C,CAAK,CACH,CAEA,oBAAqB,CACnB,OAAO,KAAK,cAAc,EAAI,CAChC,CAUA,eAAgB,CACd,MAAMnH,EAAQ,KAAK,OAAO,MAC1B,KAAK,YAAYqC,EAAU,MAAM,EACjC,MAAMgF,EAAmB,KAAK,sBAAsB,IAAI,EAExD,MAAI,CAACA,GAAoB,KAAK,KAAKhF,EAAU,IAAI,EACxC,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,gBACX,KAAM,KAAK,kBAAiB,EAC5B,WAAY,KAAK,gBAAgB,EAAK,CAC9C,CAAO,EAGI,KAAK,KAAKV,EAAO,CACtB,KAAMU,EAAK,gBACX,cAAe2G,EAAmB,KAAK,eAAc,EAAK,OAC1D,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAiB,CAC1C,CAAK,CACH,CAQA,yBAA0B,CACxB,MAAMrH,EAAQ,KAAK,OAAO,MAK1B,OAJA,KAAK,cAAc,UAAU,EAIzB,KAAK,SAAS,+BAAiC,GAC1C,KAAK,KAAKA,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAM,KAAK,kBAAiB,EAC5B,oBAAqB,KAAK,yBAAwB,EAClD,eAAgB,KAAK,cAAc,IAAI,EAAG,KAAK,kBAC/C,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAiB,CAC5C,CAAO,EAGI,KAAK,KAAKV,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAM,KAAK,kBAAiB,EAC5B,eAAgB,KAAK,cAAc,IAAI,EAAG,KAAK,kBAC/C,WAAY,KAAK,gBAAgB,EAAK,EACtC,aAAc,KAAK,kBAAiB,CAC1C,CAAK,CACH,CAKA,mBAAoB,CAClB,GAAI,KAAK,OAAO,MAAM,QAAU,KAC9B,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,UAAS,CACvB,CAqBA,kBAAkByG,EAAS,CACzB,MAAM3E,EAAQ,KAAK,OAAO,MAE1B,OAAQA,EAAM,KAAI,CAChB,KAAKH,EAAU,UACb,OAAO,KAAK,UAAU8E,CAAO,EAE/B,KAAK9E,EAAU,QACb,OAAO,KAAK,YAAY8E,CAAO,EAEjC,KAAK9E,EAAU,IACb,YAAK,aAAY,EACV,KAAK,KAAKG,EAAO,CACtB,KAAM9B,EAAK,IACX,MAAO8B,EAAM,KACvB,CAAS,EAEH,KAAKH,EAAU,MACb,YAAK,aAAY,EACV,KAAK,KAAKG,EAAO,CACtB,KAAM9B,EAAK,MACX,MAAO8B,EAAM,KACvB,CAAS,EAEH,KAAKH,EAAU,OACf,KAAKA,EAAU,aACb,OAAO,KAAK,mBAAkB,EAEhC,KAAKA,EAAU,KAGb,OAFA,KAAK,aAAY,EAETG,EAAM,MAAK,CACjB,IAAK,OACH,OAAO,KAAK,KAAKA,EAAO,CACtB,KAAM9B,EAAK,QACX,MAAO,EACrB,CAAa,EAEH,IAAK,QACH,OAAO,KAAK,KAAK8B,EAAO,CACtB,KAAM9B,EAAK,QACX,MAAO,EACrB,CAAa,EAEH,IAAK,OACH,OAAO,KAAK,KAAK8B,EAAO,CACtB,KAAM9B,EAAK,IACzB,CAAa,EAEH,QACE,OAAO,KAAK,KAAK8B,EAAO,CACtB,KAAM9B,EAAK,KACX,MAAO8B,EAAM,KAC3B,CAAa,CACb,CAEM,KAAKH,EAAU,OACb,GAAI8E,EAGF,GAFA,KAAK,YAAY9E,EAAU,MAAM,EAE7B,KAAK,OAAO,MAAM,OAASA,EAAU,KAAM,CAC7C,MAAMiF,EAAU,KAAK,OAAO,MAAM,MAClC,MAAM7H,EACJ,KAAK,OAAO,OACZ+C,EAAM,MACN,yBAAyB8E,CAAO,sBAC9C,CACU,KACE,OAAM,KAAK,WAAW9E,CAAK,EAI/B,OAAO,KAAK,cAAa,EAE3B,QACE,MAAM,KAAK,WAAU,CAC7B,CACE,CAEA,wBAAyB,CACvB,OAAO,KAAK,kBAAkB,EAAI,CACpC,CAEA,oBAAqB,CACnB,MAAMA,EAAQ,KAAK,OAAO,MAC1B,YAAK,aAAY,EACV,KAAK,KAAKA,EAAO,CACtB,KAAM9B,EAAK,OACX,MAAO8B,EAAM,MACb,MAAOA,EAAM,OAASH,EAAU,YACtC,CAAK,CACH,CAOA,UAAU8E,EAAS,CACjB,MAAMC,EAAO,IAAM,KAAK,kBAAkBD,CAAO,EAEjD,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMzG,EAAK,KACX,OAAQ,KAAK,IAAI2B,EAAU,UAAW+E,EAAM/E,EAAU,SAAS,CACrE,CAAK,CACH,CASA,YAAY8E,EAAS,CACnB,MAAMC,EAAO,IAAM,KAAK,iBAAiBD,CAAO,EAEhD,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAMzG,EAAK,OACX,OAAQ,KAAK,IAAI2B,EAAU,QAAS+E,EAAM/E,EAAU,OAAO,CACjE,CAAK,CACH,CAKA,iBAAiB8E,EAAS,CACxB,MAAMnH,EAAQ,KAAK,OAAO,MACpB8F,EAAO,KAAK,UAAS,EAC3B,YAAK,YAAYzD,EAAU,KAAK,EACzB,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,aACX,KAAAoF,EACA,MAAO,KAAK,kBAAkBqB,CAAO,CAC3C,CAAK,CACH,CAMA,gBAAgBA,EAAS,CACvB,MAAMI,EAAa,CAAA,EAEnB,KAAO,KAAK,KAAKlF,EAAU,EAAE,GAC3BkF,EAAW,KAAK,KAAK,eAAeJ,CAAO,CAAC,EAG9C,OAAOI,CACT,CAEA,sBAAuB,CACrB,OAAO,KAAK,gBAAgB,EAAI,CAClC,CAOA,eAAeJ,EAAS,CACtB,MAAMnH,EAAQ,KAAK,OAAO,MAC1B,YAAK,YAAYqC,EAAU,EAAE,EACtB,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,UACX,KAAM,KAAK,UAAS,EACpB,UAAW,KAAK,eAAeyG,CAAO,CAC5C,CAAK,CACH,CASA,oBAAqB,CACnB,MAAMnH,EAAQ,KAAK,OAAO,MAC1B,IAAIwH,EAEJ,GAAI,KAAK,oBAAoBnF,EAAU,SAAS,EAAG,CACjD,MAAMoF,EAAY,KAAK,mBAAkB,EACzC,KAAK,YAAYpF,EAAU,SAAS,EACpCmF,EAAO,KAAK,KAAKxH,EAAO,CACtB,KAAMU,EAAK,UACX,KAAM+G,CACd,CAAO,CACH,MACED,EAAO,KAAK,eAAc,EAG5B,OAAI,KAAK,oBAAoBnF,EAAU,IAAI,EAClC,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,cACX,KAAA8G,CACR,CAAO,EAGIA,CACT,CAKA,gBAAiB,CACf,OAAO,KAAK,KAAK,KAAK,OAAO,MAAO,CAClC,KAAM9G,EAAK,WACX,KAAM,KAAK,UAAS,CAC1B,CAAK,CACH,CAEA,iBAAkB,CAChB,OAAO,KAAK,KAAK2B,EAAU,MAAM,GAAK,KAAK,KAAKA,EAAU,YAAY,CACxE,CAKA,kBAAmB,CACjB,GAAI,KAAK,kBACP,OAAO,KAAK,mBAAkB,CAElC,CAOA,uBAAwB,CACtB,MAAMrC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,QAAQ,EAC3B,MAAM6H,EAAa,KAAK,qBAAoB,EACtCG,EAAiB,KAAK,KAC1BrF,EAAU,QACV,KAAK,6BACLA,EAAU,OAChB,EACI,OAAO,KAAK,KAAKrC,EAAO,CACtB,KAAMU,EAAK,kBACX,YAAAhB,EACA,WAAA6H,EACA,eAAAG,CACN,CAAK,CACH,CAKA,8BAA+B,CAC7B,MAAM1H,EAAQ,KAAK,OAAO,MACpB+G,EAAY,KAAK,mBAAkB,EACzC,KAAK,YAAY1E,EAAU,KAAK,EAChC,MAAMmF,EAAO,KAAK,eAAc,EAChC,OAAO,KAAK,KAAKxH,EAAO,CACtB,KAAMU,EAAK,0BACX,UAAAqG,EACA,KAAAS,CACN,CAAK,CACH,CAKA,2BAA4B,CAC1B,MAAMxH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,QAAQ,EAC3B,MAAMoG,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EAC5C,OAAO,KAAK,KAAKvH,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAoG,EACA,WAAAyB,CACN,CAAK,CACH,CAOA,2BAA4B,CAC1B,MAAMvH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,MAAM,EACzB,MAAMoG,EAAO,KAAK,UAAS,EACrB6B,EAAa,KAAK,0BAAyB,EAC3CJ,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,sBAAqB,EACzC,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAoG,EACA,WAAA6B,EACA,WAAAJ,EACA,OAAAK,CACN,CAAK,CACH,CAOA,2BAA4B,CAC1B,OAAO,KAAK,sBAAsB,YAAY,EAC1C,KAAK,cAAcvF,EAAU,IAAK,KAAK,cAAc,EACrD,CAAA,CACN,CAOA,uBAAwB,CACtB,OAAO,KAAK,aACVA,EAAU,QACV,KAAK,qBACLA,EAAU,OAChB,CACE,CAMA,sBAAuB,CACrB,MAAMrC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACnCoG,EAAO,KAAK,UAAS,EACrB1H,EAAO,KAAK,kBAAiB,EACnC,KAAK,YAAYiE,EAAU,KAAK,EAChC,MAAMmF,EAAO,KAAK,mBAAkB,EAC9BD,EAAa,KAAK,qBAAoB,EAC5C,OAAO,KAAK,KAAKvH,EAAO,CACtB,KAAMU,EAAK,iBACX,YAAAhB,EACA,KAAAoG,EACA,UAAW1H,EACX,KAAAoJ,EACA,WAAAD,CACN,CAAK,CACH,CAKA,mBAAoB,CAClB,OAAO,KAAK,aACVlF,EAAU,QACV,KAAK,mBACLA,EAAU,OAChB,CACE,CAMA,oBAAqB,CACnB,MAAMrC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACnCoG,EAAO,KAAK,UAAS,EAC3B,KAAK,YAAYzD,EAAU,KAAK,EAChC,MAAMmF,EAAO,KAAK,mBAAkB,EACpC,IAAIK,EAEA,KAAK,oBAAoBxF,EAAU,MAAM,IAC3CwF,EAAe,KAAK,uBAAsB,GAG5C,MAAMN,EAAa,KAAK,qBAAoB,EAC5C,OAAO,KAAK,KAAKvH,EAAO,CACtB,KAAMU,EAAK,uBACX,YAAAhB,EACA,KAAAoG,EACA,KAAA0B,EACA,aAAAK,EACA,WAAAN,CACN,CAAK,CACH,CAMA,8BAA+B,CAC7B,MAAMvH,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,WAAW,EAC9B,MAAMoG,EAAO,KAAK,UAAS,EACrB6B,EAAa,KAAK,0BAAyB,EAC3CJ,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,sBAAqB,EACzC,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,0BACX,YAAAhB,EACA,KAAAoG,EACA,WAAA6B,EACA,WAAAJ,EACA,OAAAK,CACN,CAAK,CACH,CAMA,0BAA2B,CACzB,MAAM5H,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,OAAO,EAC1B,MAAMoG,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCO,EAAQ,KAAK,sBAAqB,EACxC,OAAO,KAAK,KAAK9H,EAAO,CACtB,KAAMU,EAAK,sBACX,YAAAhB,EACA,KAAAoG,EACA,WAAAyB,EACA,MAAAO,CACN,CAAK,CACH,CAOA,uBAAwB,CACtB,OAAO,KAAK,oBAAoBzF,EAAU,MAAM,EAC5C,KAAK,cAAcA,EAAU,KAAM,KAAK,cAAc,EACtD,CAAA,CACN,CAMA,yBAA0B,CACxB,MAAMrC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,MAAM,EACzB,MAAMoG,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCQ,EAAS,KAAK,0BAAyB,EAC7C,OAAO,KAAK,KAAK/H,EAAO,CACtB,KAAMU,EAAK,qBACX,YAAAhB,EACA,KAAAoG,EACA,WAAAyB,EACA,OAAAQ,CACN,CAAK,CACH,CAOA,2BAA4B,CAC1B,OAAO,KAAK,aACV1F,EAAU,QACV,KAAK,yBACLA,EAAU,OAChB,CACE,CAKA,0BAA2B,CACzB,MAAMrC,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACnCoG,EAAO,KAAK,mBAAkB,EAC9ByB,EAAa,KAAK,qBAAoB,EAC5C,OAAO,KAAK,KAAKvH,EAAO,CACtB,KAAMU,EAAK,sBACX,YAAAhB,EACA,KAAAoG,EACA,WAAAyB,CACN,CAAK,CACH,CAKA,oBAAqB,CACnB,GACE,KAAK,OAAO,MAAM,QAAU,QAC5B,KAAK,OAAO,MAAM,QAAU,SAC5B,KAAK,OAAO,MAAM,QAAU,OAE5B,MAAM9H,EACJ,KAAK,OAAO,OACZ,KAAK,OAAO,MAAM,MAClB,GAAGuI,GACD,KAAK,OAAO,KACtB,CAAS,oDACT,EAGI,OAAO,KAAK,UAAS,CACvB,CAMA,gCAAiC,CAC/B,MAAMhI,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,OAAO,EAC1B,MAAMoG,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,2BAA0B,EAC9C,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,6BACX,YAAAhB,EACA,KAAAoG,EACA,WAAAyB,EACA,OAAAK,CACN,CAAK,CACH,CAOA,4BAA6B,CAC3B,OAAO,KAAK,aACVvF,EAAU,QACV,KAAK,mBACLA,EAAU,OAChB,CACE,CAeA,0BAA2B,CACzB,MAAMyE,EAAe,KAAK,OAAO,UAAS,EAE1C,GAAIA,EAAa,OAASzE,EAAU,KAClC,OAAQyE,EAAa,MAAK,CACxB,IAAK,SACH,OAAO,KAAK,qBAAoB,EAElC,IAAK,SACH,OAAO,KAAK,yBAAwB,EAEtC,IAAK,OACH,OAAO,KAAK,yBAAwB,EAEtC,IAAK,YACH,OAAO,KAAK,4BAA2B,EAEzC,IAAK,QACH,OAAO,KAAK,wBAAuB,EAErC,IAAK,OACH,OAAO,KAAK,uBAAsB,EAEpC,IAAK,QACH,OAAO,KAAK,8BAA6B,CACnD,CAGI,MAAM,KAAK,WAAWA,CAAY,CACpC,CASA,sBAAuB,CACrB,MAAM9G,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,QAAQ,EAC3B,MAAMuH,EAAa,KAAK,qBAAoB,EACtCG,EAAiB,KAAK,aAC1BrF,EAAU,QACV,KAAK,6BACLA,EAAU,OAChB,EAEI,GAAIkF,EAAW,SAAW,GAAKG,EAAe,SAAW,EACvD,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK1H,EAAO,CACtB,KAAMU,EAAK,iBACX,WAAA6G,EACA,eAAAG,CACN,CAAK,CACH,CAMA,0BAA2B,CACzB,MAAM1H,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,QAAQ,EAC3B,MAAM8F,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EAE5C,GAAIA,EAAW,SAAW,EACxB,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAKvH,EAAO,CACtB,KAAMU,EAAK,sBACX,KAAAoF,EACA,WAAAyB,CACN,CAAK,CACH,CAQA,0BAA2B,CACzB,MAAMvH,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,MAAM,EACzB,MAAM8F,EAAO,KAAK,UAAS,EACrB6B,EAAa,KAAK,0BAAyB,EAC3CJ,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,sBAAqB,EAEzC,GACED,EAAW,SAAW,GACtBJ,EAAW,SAAW,GACtBK,EAAO,SAAW,EAElB,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,sBACX,KAAAoF,EACA,WAAA6B,EACA,WAAAJ,EACA,OAAAK,CACN,CAAK,CACH,CAQA,6BAA8B,CAC5B,MAAM5H,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,WAAW,EAC9B,MAAM8F,EAAO,KAAK,UAAS,EACrB6B,EAAa,KAAK,0BAAyB,EAC3CJ,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,sBAAqB,EAEzC,GACED,EAAW,SAAW,GACtBJ,EAAW,SAAW,GACtBK,EAAO,SAAW,EAElB,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,yBACX,KAAAoF,EACA,WAAA6B,EACA,WAAAJ,EACA,OAAAK,CACN,CAAK,CACH,CAOA,yBAA0B,CACxB,MAAM5H,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,OAAO,EAC1B,MAAM8F,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCO,EAAQ,KAAK,sBAAqB,EAExC,GAAIP,EAAW,SAAW,GAAKO,EAAM,SAAW,EAC9C,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK9H,EAAO,CACtB,KAAMU,EAAK,qBACX,KAAAoF,EACA,WAAAyB,EACA,MAAAO,CACN,CAAK,CACH,CAOA,wBAAyB,CACvB,MAAM9H,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,MAAM,EACzB,MAAM8F,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCQ,EAAS,KAAK,0BAAyB,EAE7C,GAAIR,EAAW,SAAW,GAAKQ,EAAO,SAAW,EAC/C,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK/H,EAAO,CACtB,KAAMU,EAAK,oBACX,KAAAoF,EACA,WAAAyB,EACA,OAAAQ,CACN,CAAK,CACH,CAOA,+BAAgC,CAC9B,MAAM/H,EAAQ,KAAK,OAAO,MAC1B,KAAK,cAAc,QAAQ,EAC3B,KAAK,cAAc,OAAO,EAC1B,MAAM8F,EAAO,KAAK,UAAS,EACrByB,EAAa,KAAK,qBAAoB,EACtCK,EAAS,KAAK,2BAA0B,EAE9C,GAAIL,EAAW,SAAW,GAAKK,EAAO,SAAW,EAC/C,MAAM,KAAK,WAAU,EAGvB,OAAO,KAAK,KAAK5H,EAAO,CACtB,KAAMU,EAAK,4BACX,KAAAoF,EACA,WAAAyB,EACA,OAAAK,CACN,CAAK,CACH,CAQA,0BAA2B,CACzB,MAAM5H,EAAQ,KAAK,OAAO,MACpBN,EAAc,KAAK,iBAAgB,EACzC,KAAK,cAAc,WAAW,EAC9B,KAAK,YAAY2C,EAAU,EAAE,EAC7B,MAAMyD,EAAO,KAAK,UAAS,EACrB1H,EAAO,KAAK,kBAAiB,EAC7B6J,EAAa,KAAK,sBAAsB,YAAY,EAC1D,KAAK,cAAc,IAAI,EACvB,MAAMC,EAAY,KAAK,wBAAuB,EAC9C,OAAO,KAAK,KAAKlI,EAAO,CACtB,KAAMU,EAAK,qBACX,YAAAhB,EACA,KAAAoG,EACA,UAAW1H,EACX,WAAA6J,EACA,UAAAC,CACN,CAAK,CACH,CAOA,yBAA0B,CACxB,OAAO,KAAK,cAAc7F,EAAU,KAAM,KAAK,sBAAsB,CACvE,CA6BA,wBAAyB,CACvB,MAAMrC,EAAQ,KAAK,OAAO,MACpB8F,EAAO,KAAK,UAAS,EAE3B,GAAI,OAAO,UAAU,eAAe,KAAKrF,GAAmBqF,EAAK,KAAK,EACpE,OAAOA,EAGT,MAAM,KAAK,WAAW9F,CAAK,CAC7B,CAQA,KAAKJ,EAAYV,EAAM,CACrB,OAAI,KAAK,SAAS,aAAe,KAC/BA,EAAK,IAAM,IAAIS,GACbC,EACA,KAAK,OAAO,UACZ,KAAK,OAAO,MACpB,GAGWV,CACT,CAKA,KAAKa,EAAM,CACT,OAAO,KAAK,OAAO,MAAM,OAASA,CACpC,CAMA,YAAYA,EAAM,CAChB,MAAMyC,EAAQ,KAAK,OAAO,MAE1B,GAAIA,EAAM,OAASzC,EACjB,YAAK,aAAY,EACVyC,EAGT,MAAM/C,EACJ,KAAK,OAAO,OACZ+C,EAAM,MACN,YAAY2F,GAAiBpI,CAAI,CAAC,WAAWiI,GAAaxF,CAAK,CAAC,GACtE,CACE,CAMA,oBAAoBzC,EAAM,CAGxB,OAFc,KAAK,OAAO,MAEhB,OAASA,GACjB,KAAK,aAAY,EACV,IAGF,EACT,CAMA,cAAc7D,EAAO,CACnB,MAAMsG,EAAQ,KAAK,OAAO,MAE1B,GAAIA,EAAM,OAASH,EAAU,MAAQG,EAAM,QAAUtG,EACnD,KAAK,aAAY,MAEjB,OAAMuD,EACJ,KAAK,OAAO,OACZ+C,EAAM,MACN,aAAatG,CAAK,YAAY8L,GAAaxF,CAAK,CAAC,GACzD,CAEE,CAMA,sBAAsBtG,EAAO,CAC3B,MAAMsG,EAAQ,KAAK,OAAO,MAE1B,OAAIA,EAAM,OAASH,EAAU,MAAQG,EAAM,QAAUtG,GACnD,KAAK,aAAY,EACV,IAGF,EACT,CAKA,WAAWkM,EAAS,CAClB,MAAM5F,EACJ4F,GAAY,KAA6BA,EAAU,KAAK,OAAO,MACjE,OAAO3I,EACL,KAAK,OAAO,OACZ+C,EAAM,MACN,cAAcwF,GAAaxF,CAAK,CAAC,GACvC,CACE,CAOA,IAAI6F,EAAUC,EAASC,EAAW,CAChC,KAAK,YAAYF,CAAQ,EACzB,MAAM1J,EAAQ,CAAA,EAEd,KAAO,CAAC,KAAK,oBAAoB4J,CAAS,GACxC5J,EAAM,KAAK2J,EAAQ,KAAK,IAAI,CAAC,EAG/B,OAAO3J,CACT,CAQA,aAAa0J,EAAUC,EAASC,EAAW,CACzC,GAAI,KAAK,oBAAoBF,CAAQ,EAAG,CACtC,MAAM1J,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAK2J,EAAQ,KAAK,IAAI,CAAC,QACtB,CAAC,KAAK,oBAAoBC,CAAS,GAE5C,OAAO5J,CACT,CAEA,MAAO,CAAA,CACT,CAOA,KAAK0J,EAAUC,EAASC,EAAW,CACjC,KAAK,YAAYF,CAAQ,EACzB,MAAM1J,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAK2J,EAAQ,KAAK,IAAI,CAAC,QACtB,CAAC,KAAK,oBAAoBC,CAAS,GAE5C,OAAO5J,CACT,CAOA,cAAc6J,EAAeF,EAAS,CACpC,KAAK,oBAAoBE,CAAa,EACtC,MAAM7J,EAAQ,CAAA,EAEd,GACEA,EAAM,KAAK2J,EAAQ,KAAK,IAAI,CAAC,QACtB,KAAK,oBAAoBE,CAAa,GAE/C,OAAO7J,CACT,CAEA,cAAe,CACb,KAAM,CAAE,UAAA8J,GAAc,KAAK,SAErBjG,EAAQ,KAAK,OAAO,QAAO,EAEjC,GAAIA,EAAM,OAASH,EAAU,MAC3B,EAAE,KAAK,cAEHoG,IAAc,QAAa,KAAK,cAAgBA,GAClD,MAAMhJ,EACJ,KAAK,OAAO,OACZ+C,EAAM,MACN,+BAA+BiG,CAAS,2BAClD,CAGE,CACF,CAKA,SAAST,GAAaxF,EAAO,CAC3B,MAAMtG,EAAQsG,EAAM,MACpB,OAAO2F,GAAiB3F,EAAM,IAAI,GAAKtG,GAAS,KAAO,KAAKA,CAAK,IAAM,GACzE,CAKA,SAASiM,GAAiBpI,EAAM,CAC9B,OAAO4C,GAAsB5C,CAAI,EAAI,IAAIA,CAAI,IAAMA,CACrD,CCx/CO,SAAS2I,GAAY1N,EAAK,CAC/B,MAAO,IAAIA,EAAI,QAAQ2N,GAAeC,EAAe,CAAC,GACxD,CAEA,MAAMD,GAAgB,gCAEtB,SAASC,GAAgB5N,EAAK,CAC5B,OAAO6N,GAAgB7N,EAAI,WAAW,CAAC,CAAC,CAC1C,CAEA,MAAM6N,GAAkB,CACtB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,MACA,MACA,MACA,UACA,MACA,MACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,GACA,GACA,MACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,OACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,SACF,ECtKaC,GAAQ,OAAO,OAAO,EAAE,EAgF9B,SAASC,GAAMC,EAAMC,EAASC,EAAc/I,GAAmB,CACpE,MAAMgJ,EAAgB,IAAI,IAE1B,UAAWpJ,KAAQ,OAAO,OAAOW,CAAI,EACnCyI,EAAc,IAAIpJ,EAAMqJ,GAAqBH,EAASlJ,CAAI,CAAC,EAI7D,IAAIsJ,EACAC,EAAU,MAAM,QAAQN,CAAI,EAC5BO,EAAO,CAACP,CAAI,EACZQ,EAAQ,GACRC,EAAQ,CAAA,EACRvK,EAAO8J,EACPvD,EACAiE,EACJ,MAAM7K,EAAO,CAAA,EACP8K,EAAY,CAAA,EAGlB,EAAG,CACDH,IACA,MAAMI,EAAYJ,IAAUD,EAAK,OAC3BM,EAAWD,GAAaH,EAAM,SAAW,EAE/C,GAAIG,EAAW,CAKb,GAJAnE,EAAMkE,EAAU,SAAW,EAAI,OAAY9K,EAAKA,EAAK,OAAS,CAAC,EAC/DK,EAAOwK,EACPA,EAASC,EAAU,IAAG,EAElBE,EACF,GAAIP,EAAS,CACXpK,EAAOA,EAAK,MAAK,EACjB,IAAI4K,EAAa,EAEjB,SAAW,CAACC,EAASC,CAAS,IAAKP,EAAO,CACxC,MAAMQ,EAAWF,EAAUD,EAEvBE,IAAc,MAChB9K,EAAK,OAAO+K,EAAU,CAAC,EACvBH,KAEA5K,EAAK+K,CAAQ,EAAID,CAErB,CACF,KAAO,CACL9K,EAAOgL,EAAA,GAAKhL,GAEZ,SAAW,CAAC6K,EAASC,CAAS,IAAKP,EACjCvK,EAAK6K,CAAO,EAAIC,CAEpB,CAGFR,EAAQH,EAAM,MACdE,EAAOF,EAAM,KACbI,EAAQJ,EAAM,MACdC,EAAUD,EAAM,QAChBA,EAAQA,EAAM,IAChB,SAAWK,EAAQ,CAIjB,GAHAjE,EAAM6D,EAAUE,EAAQD,EAAKC,CAAK,EAClCtK,EAAOwK,EAAOjE,CAAG,EAEbvG,GAAS,KACX,SAGFL,EAAK,KAAK4G,CAAG,CACf,CAEA,IAAItD,EAEJ,GAAI,CAAC,MAAM,QAAQjD,CAAI,EAAG,CACxB,IAAIiL,EAAoBC,EAExB/J,GAAOnB,CAAI,GAAKpD,GAAU,GAAO,qBAAqB+I,GAAQ3F,CAAI,CAAC,GAAG,EACtE,MAAMmL,EAAUT,GACXO,EAAqBhB,EAAc,IAAIjK,EAAK,IAAI,KAAO,MACxDiL,IAAuB,OACrB,OACAA,EAAmB,OACpBC,EAAsBjB,EAAc,IAAIjK,EAAK,IAAI,KAAO,MACzDkL,IAAwB,OACxB,OACAA,EAAoB,MAMxB,GALAjI,EACEkI,GAAY,KACR,OACAA,EAAQ,KAAKpB,EAAS/J,EAAMuG,EAAKiE,EAAQ7K,EAAM8K,CAAS,EAE1DxH,IAAW2G,GACb,MAGF,GAAI3G,IAAW,IACb,GAAI,CAACyH,EAAW,CACd/K,EAAK,IAAG,EACR,QACF,UACSsD,IAAW,SACpBsH,EAAM,KAAK,CAAChE,EAAKtD,CAAM,CAAC,EAEpB,CAACyH,GACH,GAAIvJ,GAAO8B,CAAM,EACfjD,EAAOiD,MACF,CACLtD,EAAK,IAAG,EACR,QACF,CAGN,CAMA,GAJIsD,IAAW,QAAa0H,GAC1BJ,EAAM,KAAK,CAAChE,EAAKvG,CAAI,CAAC,EAGpB0K,EACF/K,EAAK,IAAG,MACH,CACL,IAAIyL,EAEJjB,EAAQ,CACN,QAAAC,EACA,MAAAE,EACA,KAAAD,EACA,MAAAE,EACA,KAAMJ,CACd,EACMC,EAAU,MAAM,QAAQpK,CAAI,EAC5BqK,EAAOD,EACHpK,GACCoL,EAAapB,EAAYhK,EAAK,IAAI,KAAO,MAC1CoL,IAAe,OACfA,EACA,CAAA,EACJd,EAAQ,GACRC,EAAQ,CAAA,EAEJC,GACFC,EAAU,KAAKD,CAAM,EAGvBA,EAASxK,CACX,CACF,OAASmK,IAAU,QAEnB,OAAII,EAAM,SAAW,EAEZA,EAAMA,EAAM,OAAS,CAAC,EAAE,CAAC,EAG3BT,CACT,CAoFO,SAASI,GAAqBH,EAASlJ,EAAM,CAClD,MAAMwK,EAActB,EAAQlJ,CAAI,EAEhC,OAAI,OAAOwK,GAAgB,SAElBA,EACE,OAAOA,GAAgB,WAEzB,CACL,MAAOA,EACP,MAAO,MACb,EAGS,CACL,MAAOtB,EAAQ,MACf,MAAOA,EAAQ,KACnB,CACA,CChVO,SAASuB,GAAMC,EAAK,CACzB,OAAO1B,GAAM0B,EAAKC,EAAkB,CACtC,CACA,MAAMC,GAAkB,GAClBD,GAAqB,CACzB,KAAM,CACJ,MAAQxL,GAASA,EAAK,KAC1B,EACE,SAAU,CACR,MAAQA,GAAS,IAAMA,EAAK,IAChC,EAEE,SAAU,CACR,MAAQA,GAAS0L,EAAK1L,EAAK,YAAa;AAAA;AAAA,CAAM,CAClD,EACE,oBAAqB,CACnB,MAAMA,EAAM,CACV,MAAM2L,EAAUC,EAAK,IAAKF,EAAK1L,EAAK,oBAAqB,IAAI,EAAG,GAAG,EAC7DhB,EAAS0M,EACb,CACE1L,EAAK,UACL0L,EAAK,CAAC1L,EAAK,KAAM2L,CAAO,CAAC,EACzBD,EAAK1L,EAAK,WAAY,GAAG,CACnC,EACQ,GACR,EAGM,OAAQhB,IAAW,QAAU,GAAKA,EAAS,KAAOgB,EAAK,YACzD,CACJ,EACE,mBAAoB,CAClB,MAAO,CAAC,CAAE,SAAA6L,EAAU,KAAAvD,EAAM,aAAAK,EAAc,WAAAN,CAAU,IAChDwD,EACA,KACAvD,EACAsD,EAAK,MAAOjD,CAAY,EACxBiD,EAAK,IAAKF,EAAKrD,EAAY,GAAG,CAAC,CACrC,EACE,aAAc,CACZ,MAAO,CAAC,CAAE,WAAAyD,KAAiBC,GAAMD,CAAU,CAC/C,EACE,MAAO,CACL,MAAM,CAAE,MAAA9D,EAAO,KAAApB,EAAM,UAAW1H,EAAM,WAAAmJ,EAAY,aAAA2D,GAAgB,CAChE,MAAMhN,EAAS4M,EAAK,GAAI5D,EAAO,IAAI,EAAIpB,EACvC,IAAIqF,EAAWjN,EAAS4M,EAAK,IAAKF,EAAKxM,EAAM,IAAI,EAAG,GAAG,EAEvD,OAAI+M,EAAS,OAASR,KACpBQ,EAAWjN,EAAS4M,EAAK;AAAA,EAAOvJ,GAAOqJ,EAAKxM,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,GAG1DwM,EAAK,CAACO,EAAUP,EAAKrD,EAAY,GAAG,EAAG2D,CAAY,EAAG,GAAG,CAClE,CACJ,EACE,SAAU,CACR,MAAO,CAAC,CAAE,KAAApF,EAAM,MAAA5J,CAAK,IAAO4J,EAAO,KAAO5J,CAC9C,EAEE,eAAgB,CACd,MAAO,CAAC,CAAE,KAAA4J,EAAM,WAAAyB,CAAU,IACxB,MAAQzB,EAAOgF,EAAK,IAAKF,EAAKrD,EAAY,GAAG,CAAC,CACpD,EACE,eAAgB,CACd,MAAO,CAAC,CAAE,cAAA6D,EAAe,WAAA7D,EAAY,aAAA2D,CAAY,IAC/CN,EACE,CACE,MACAE,EAAK,MAAOM,CAAa,EACzBR,EAAKrD,EAAY,GAAG,EACpB2D,CACV,EACQ,GACR,CACA,EACE,mBAAoB,CAClB,MAAO,CACL,CAAE,KAAApF,EAAM,cAAAsF,EAAe,oBAAAC,EAAqB,WAAA9D,EAAY,aAAA2D,CAAY,IAGpE,YAAYpF,CAAI,GAAGgF,EAAK,IAAKF,EAAKS,EAAqB,IAAI,EAAG,GAAG,CAAC,OAC5DD,CAAa,IAAIN,EAAK,GAAIF,EAAKrD,EAAY,GAAG,EAAG,GAAG,CAAC,GAC3D2D,CACN,EAEE,SAAU,CACR,MAAO,CAAC,CAAE,MAAAhP,CAAK,IAAOA,CAC1B,EACE,WAAY,CACV,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAOA,CAC1B,EACE,YAAa,CACX,MAAO,CAAC,CAAE,MAAAA,EAAO,MAAOoP,CAAa,IACnCA,EAAgB7J,GAAiBvF,CAAK,EAAIwM,GAAYxM,CAAK,CACjE,EACE,aAAc,CACZ,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAQA,EAAQ,OAAS,OAC5C,EACE,UAAW,CACT,MAAO,IAAM,MACjB,EACE,UAAW,CACT,MAAO,CAAC,CAAE,MAAAA,CAAK,IAAOA,CAC1B,EACE,UAAW,CACT,MAAO,CAAC,CAAE,OAAA6L,KAAa,IAAM6C,EAAK7C,EAAQ,IAAI,EAAI,GACtD,EACE,YAAa,CACX,MAAO,CAAC,CAAE,OAAAH,KAAa,IAAMgD,EAAKhD,EAAQ,IAAI,EAAI,GACtD,EACE,YAAa,CACX,MAAO,CAAC,CAAE,KAAA9B,EAAM,MAAA5J,CAAK,IAAO4J,EAAO,KAAO5J,CAC9C,EAEE,UAAW,CACT,MAAO,CAAC,CAAE,KAAA4J,EAAM,UAAW1H,CAAI,IAC7B,IAAM0H,EAAOgF,EAAK,IAAKF,EAAKxM,EAAM,IAAI,EAAG,GAAG,CAClD,EAEE,UAAW,CACT,MAAO,CAAC,CAAE,KAAA0H,CAAI,IAAOA,CACzB,EACE,SAAU,CACR,MAAO,CAAC,CAAE,KAAA0B,CAAI,IAAO,IAAMA,EAAO,GACtC,EACE,YAAa,CACX,MAAO,CAAC,CAAE,KAAAA,CAAI,IAAOA,EAAO,GAChC,EAEE,iBAAkB,CAChB,MAAO,CAAC,CAAE,YAAA9H,EAAa,WAAA6H,EAAY,eAAAG,CAAc,IAC/CoD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EAAK,CAAC,SAAUA,EAAKrD,EAAY,GAAG,EAAG0D,GAAMvD,CAAc,CAAC,EAAG,GAAG,CACxE,EACE,wBAAyB,CACvB,MAAO,CAAC,CAAE,UAAAX,EAAW,KAAAS,CAAI,IAAOT,EAAY,KAAOS,CACvD,EACE,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAA9H,EAAa,KAAAoG,EAAM,WAAAyB,CAAU,IACrCuD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EAAK,CAAC,SAAU9E,EAAM8E,EAAKrD,EAAY,GAAG,CAAC,EAAG,GAAG,CACvD,EACE,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAA7H,EAAa,KAAAoG,EAAM,WAAA6B,EAAY,WAAAJ,EAAY,OAAAK,CAAM,IACzDkD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EACE,CACE,OACA9E,EACAgF,EAAK,cAAeF,EAAKjD,EAAY,KAAK,CAAC,EAC3CiD,EAAKrD,EAAY,GAAG,EACpB0D,GAAMrD,CAAM,CACtB,EACQ,GACR,CACA,EACE,gBAAiB,CACf,MAAO,CAAC,CAAE,YAAAlI,EAAa,KAAAoG,EAAM,UAAW1H,EAAM,KAAAoJ,EAAM,WAAAD,CAAU,IAC5DuD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BoG,GACCyF,GAAkBnN,CAAI,EACnB0M,EAAK;AAAA,EAAOvJ,GAAOqJ,EAAKxM,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,EAC3C0M,EAAK,IAAKF,EAAKxM,EAAM,IAAI,EAAG,GAAG,GACnC,KACAoJ,EACAsD,EAAK,IAAKF,EAAKrD,EAAY,GAAG,CAAC,CACrC,EACE,qBAAsB,CACpB,MAAO,CAAC,CAAE,YAAA7H,EAAa,KAAAoG,EAAM,KAAA0B,EAAM,aAAAK,EAAc,WAAAN,CAAU,IACzDuD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EACE,CAAC9E,EAAO,KAAO0B,EAAMsD,EAAK,KAAMjD,CAAY,EAAG+C,EAAKrD,EAAY,GAAG,CAAC,EACpE,GACR,CACA,EACE,wBAAyB,CACvB,MAAO,CAAC,CAAE,YAAA7H,EAAa,KAAAoG,EAAM,WAAA6B,EAAY,WAAAJ,EAAY,OAAAK,CAAM,IACzDkD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EACE,CACE,YACA9E,EACAgF,EAAK,cAAeF,EAAKjD,EAAY,KAAK,CAAC,EAC3CiD,EAAKrD,EAAY,GAAG,EACpB0D,GAAMrD,CAAM,CACtB,EACQ,GACR,CACA,EACE,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAAlI,EAAa,KAAAoG,EAAM,WAAAyB,EAAY,MAAAO,CAAK,IAC5CgD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EACE,CAAC,QAAS9E,EAAM8E,EAAKrD,EAAY,GAAG,EAAGuD,EAAK,KAAMF,EAAK9C,EAAO,KAAK,CAAC,CAAC,EACrE,GACR,CACA,EACE,mBAAoB,CAClB,MAAO,CAAC,CAAE,YAAApI,EAAa,KAAAoG,EAAM,WAAAyB,EAAY,OAAAQ,CAAM,IAC7C+C,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EAAK,CAAC,OAAQ9E,EAAM8E,EAAKrD,EAAY,GAAG,EAAG0D,GAAMlD,CAAM,CAAC,EAAG,GAAG,CACpE,EACE,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAArI,EAAa,KAAAoG,EAAM,WAAAyB,CAAU,IACrCuD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAAIkL,EAAK,CAAC9E,EAAM8E,EAAKrD,EAAY,GAAG,CAAC,EAAG,GAAG,CAC3E,EACE,0BAA2B,CACzB,MAAO,CAAC,CAAE,YAAA7H,EAAa,KAAAoG,EAAM,WAAAyB,EAAY,OAAAK,CAAM,IAC7CkD,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1BkL,EAAK,CAAC,QAAS9E,EAAM8E,EAAKrD,EAAY,GAAG,EAAG0D,GAAMrD,CAAM,CAAC,EAAG,GAAG,CACrE,EACE,oBAAqB,CACnB,MAAO,CAAC,CAAE,YAAAlI,EAAa,KAAAoG,EAAM,UAAW1H,EAAM,WAAA6J,EAAY,UAAAC,CAAS,IACjE4C,EAAK,GAAIpL,EAAa;AAAA,CAAI,EAC1B,cACAoG,GACCyF,GAAkBnN,CAAI,EACnB0M,EAAK;AAAA,EAAOvJ,GAAOqJ,EAAKxM,EAAM;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,EAC3C0M,EAAK,IAAKF,EAAKxM,EAAM,IAAI,EAAG,GAAG,IAClC6J,EAAa,cAAgB,IAC9B,OACA2C,EAAK1C,EAAW,KAAK,CAC3B,EACE,gBAAiB,CACf,MAAO,CAAC,CAAE,WAAAX,EAAY,eAAAG,CAAc,IAClCkD,EACE,CAAC,gBAAiBA,EAAKrD,EAAY,GAAG,EAAG0D,GAAMvD,CAAc,CAAC,EAC9D,GACR,CACA,EACE,oBAAqB,CACnB,MAAO,CAAC,CAAE,KAAA5B,EAAM,WAAAyB,CAAU,IACxBqD,EAAK,CAAC,gBAAiB9E,EAAM8E,EAAKrD,EAAY,GAAG,CAAC,EAAG,GAAG,CAC9D,EACE,oBAAqB,CACnB,MAAO,CAAC,CAAE,KAAAzB,EAAM,WAAA6B,EAAY,WAAAJ,EAAY,OAAAK,CAAM,IAC5CgD,EACE,CACE,cACA9E,EACAgF,EAAK,cAAeF,EAAKjD,EAAY,KAAK,CAAC,EAC3CiD,EAAKrD,EAAY,GAAG,EACpB0D,GAAMrD,CAAM,CACtB,EACQ,GACR,CACA,EACE,uBAAwB,CACtB,MAAO,CAAC,CAAE,KAAA9B,EAAM,WAAA6B,EAAY,WAAAJ,EAAY,OAAAK,CAAM,IAC5CgD,EACE,CACE,mBACA9E,EACAgF,EAAK,cAAeF,EAAKjD,EAAY,KAAK,CAAC,EAC3CiD,EAAKrD,EAAY,GAAG,EACpB0D,GAAMrD,CAAM,CACtB,EACQ,GACR,CACA,EACE,mBAAoB,CAClB,MAAO,CAAC,CAAE,KAAA9B,EAAM,WAAAyB,EAAY,MAAAO,CAAK,IAC/B8C,EACE,CACE,eACA9E,EACA8E,EAAKrD,EAAY,GAAG,EACpBuD,EAAK,KAAMF,EAAK9C,EAAO,KAAK,CAAC,CACvC,EACQ,GACR,CACA,EACE,kBAAmB,CACjB,MAAO,CAAC,CAAE,KAAAhC,EAAM,WAAAyB,EAAY,OAAAQ,CAAM,IAChC6C,EAAK,CAAC,cAAe9E,EAAM8E,EAAKrD,EAAY,GAAG,EAAG0D,GAAMlD,CAAM,CAAC,EAAG,GAAG,CAC3E,EACE,yBAA0B,CACxB,MAAO,CAAC,CAAE,KAAAjC,EAAM,WAAAyB,EAAY,OAAAK,CAAM,IAChCgD,EAAK,CAAC,eAAgB9E,EAAM8E,EAAKrD,EAAY,GAAG,EAAG0D,GAAMrD,CAAM,CAAC,EAAG,GAAG,CAC5E,CACA,EAMA,SAASgD,EAAKY,EAAYC,EAAY,GAAI,CACxC,IAAIC,EAEJ,OAAQA,EACNF,GAAe,KACX,OACAA,EAAW,OAAQG,GAAMA,CAAC,EAAE,KAAKF,CAAS,KAAO,MACrDC,IAA0B,OACxBA,EACA,EACN,CAKA,SAAST,GAAMzL,EAAO,CACpB,OAAOsL,EAAK;AAAA,EAAOvJ,GAAOqJ,EAAKpL,EAAO;AAAA,CAAI,CAAC,EAAG;AAAA,EAAK,CACrD,CAKA,SAASsL,EAAK9K,EAAO4L,EAAa3L,EAAM,GAAI,CAC1C,OAAO2L,GAAe,MAAQA,IAAgB,GAC1C5L,EAAQ4L,EAAc3L,EACtB,EACN,CAEA,SAASsB,GAAOvG,EAAK,CACnB,OAAO8P,EAAK,KAAM9P,EAAI,QAAQ,MAAO;AAAA,GAAM,CAAC,CAC9C,CAEA,SAASuQ,GAAkBC,EAAY,CACrC,IAAIK,EAKJ,OAAQA,EACNL,GAAe,KACX,OACAA,EAAW,KAAMxQ,GAAQA,EAAI,SAAS;AAAA,CAAI,CAAC,KAAO,MACtD6Q,IAAqB,OACnBA,EACA,EACN,CC9UA,MAAMC,GAAwBnF,GAAa,SACvC,IAAIoF,EACJ,MAAMC,EAAuBrF,EAAS,YAAY,OAAQsF,GAAeA,EAAW,OAAS,qBAAqB,EAClH,OAAID,EAAqB,SAAW,IAChCD,GAAgBG,GAAAC,EAAAH,EAAqB,CAAC,IAAtB,YAAAG,EAAyB,OAAzB,YAAAD,EAA+B,OAE5CH,CACX,EACaK,GAA0BzF,GAAa,CAChD,GAAI,OAAOA,GAAa,SAAU,CAC9B,IAAIoF,EACJ,GAAI,CACA,MAAMM,EAAiB7F,GAAMG,CAAQ,EACrCoF,EAAgBD,GAAqBO,CAAc,CACvD,OACOC,EAAK,CAEZ,CACA,MAAO,CAAE,MAAO3F,EAAU,cAAAoF,CAAa,CAC3C,CACA,MAAMA,EAAgBD,GAAqBnF,CAAQ,EACnD,MAAO,CAAE,MAAO6D,GAAM7D,CAAQ,EAAG,cAAAoF,CAAa,CAClD,EC1BO,MAAMQ,WAAoB,KAAM,CACnC,YAAYC,EAAUC,EAAS,CAC3B,MAAMzQ,EAAU,GAAGuQ,GAAY,eAAeC,CAAQ,CAAC,KAAK,KAAK,UAAU,CACvE,SAAAA,EACA,QAAAC,CACZ,CAAS,CAAC,GACF,MAAMzQ,CAAO,EACb,OAAO,eAAe,KAAMuQ,GAAY,SAAS,EACjD,KAAK,SAAWC,EAChB,KAAK,QAAUC,EAEX,OAAO,MAAM,mBAAsB,YACnC,MAAM,kBAAkB,KAAMF,EAAW,CAEjD,CACA,OAAO,eAAeC,EAAU,WAC5B,OAAOE,GAAAR,GAAAC,EAAAK,EAAS,SAAT,YAAAL,EAAkB,KAAlB,YAAAD,EAAsB,UAAtB,KAAAQ,EAAiC,wBAAwBF,EAAS,MAAM,GACnF,CACJ,+RClBA,IAAIG,EAAS,OAAO,MAAS,YAAc,KAAOC,GAC9CC,EAAY,UAAY,CAC5B,SAASC,GAAI,CACb,KAAK,MAAQ,GACb,KAAK,aAAeH,EAAO,YAC3B,CACA,OAAAG,EAAE,UAAYH,EACP,IAAIG,CACX,EAAC,GACA,SAASC,EAAM,EAEE,SAAUC,EAAS,CAEnC,IAAIC,EAAU,CACZ,aAAc,oBAAqBF,EACnC,SAAU,WAAYA,GAAQ,aAAc,OAC5C,KACE,eAAgBA,GAChB,SAAUA,GACT,UAAW,CACV,GAAI,CACF,WAAI,KACG,EACjB,OAAiBG,EAAG,CACV,MAAO,EACjB,CACA,EAAO,EACH,SAAU,aAAcH,EACxB,YAAa,gBAAiBA,CAClC,EAEE,SAASI,EAAWC,EAAK,CACvB,OAAOA,GAAO,SAAS,UAAU,cAAcA,CAAG,CACtD,CAEE,GAAIH,EAAQ,YACV,IAAII,EAAc,CAChB,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,uBACN,EAEQC,EACF,YAAY,QACZ,SAASF,EAAK,CACZ,OAAOA,GAAOC,EAAY,QAAQ,OAAO,UAAU,SAAS,KAAKD,CAAG,CAAC,EAAI,EACjF,EAGE,SAASG,EAAczH,EAAM,CAI3B,GAHI,OAAOA,GAAS,WAClBA,EAAO,OAAOA,CAAI,GAEhB,4BAA4B,KAAKA,CAAI,EACvC,MAAM,IAAI,UAAU,wCAAwC,EAE9D,OAAOA,EAAK,YAAW,CAC3B,CAEE,SAAS0H,EAAetR,EAAO,CAC7B,OAAI,OAAOA,GAAU,WACnBA,EAAQ,OAAOA,CAAK,GAEfA,CACX,CAGE,SAASuR,EAAY7H,EAAO,CAC1B,IAAI8H,EAAW,CACb,KAAM,UAAW,CACf,IAAIxR,EAAQ0J,EAAM,MAAK,EACvB,MAAO,CAAC,KAAM1J,IAAU,OAAW,MAAOA,CAAK,CACvD,CACA,EAEI,OAAI+Q,EAAQ,WACVS,EAAS,OAAO,QAAQ,EAAI,UAAW,CACrC,OAAOA,CACf,GAGWA,CACX,CAEE,SAASC,EAAQzS,EAAS,CACxB,KAAK,IAAM,CAAA,EAEPA,aAAmByS,EACrBzS,EAAQ,QAAQ,SAASgB,EAAO4J,EAAM,CACpC,KAAK,OAAOA,EAAM5J,CAAK,CAC/B,EAAS,IAAI,EACE,MAAM,QAAQhB,CAAO,EAC9BA,EAAQ,QAAQ,SAAS0S,EAAQ,CAC/B,KAAK,OAAOA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,CACxC,EAAS,IAAI,EACE1S,GACT,OAAO,oBAAoBA,CAAO,EAAE,QAAQ,SAAS4K,EAAM,CACzD,KAAK,OAAOA,EAAM5K,EAAQ4K,CAAI,CAAC,CACvC,EAAS,IAAI,CAEb,CAEE6H,EAAQ,UAAU,OAAS,SAAS7H,EAAM5J,EAAO,CAC/C4J,EAAOyH,EAAczH,CAAI,EACzB5J,EAAQsR,EAAetR,CAAK,EAC5B,IAAI2R,EAAW,KAAK,IAAI/H,CAAI,EAC5B,KAAK,IAAIA,CAAI,EAAI+H,EAAWA,EAAW,KAAO3R,EAAQA,CAC1D,EAEEyR,EAAQ,UAAU,OAAY,SAAS7H,EAAM,CAC3C,OAAO,KAAK,IAAIyH,EAAczH,CAAI,CAAC,CACvC,EAEE6H,EAAQ,UAAU,IAAM,SAAS7H,EAAM,CACrC,OAAAA,EAAOyH,EAAczH,CAAI,EAClB,KAAK,IAAIA,CAAI,EAAI,KAAK,IAAIA,CAAI,EAAI,IAC7C,EAEE6H,EAAQ,UAAU,IAAM,SAAS7H,EAAM,CACrC,OAAO,KAAK,IAAI,eAAeyH,EAAczH,CAAI,CAAC,CACtD,EAEE6H,EAAQ,UAAU,IAAM,SAAS7H,EAAM5J,EAAO,CAC5C,KAAK,IAAIqR,EAAczH,CAAI,CAAC,EAAI0H,EAAetR,CAAK,CACxD,EAEEyR,EAAQ,UAAU,QAAU,SAASG,EAAUC,EAAS,CACtD,QAASjI,KAAQ,KAAK,IAChB,KAAK,IAAI,eAAeA,CAAI,GAC9BgI,EAAS,KAAKC,EAAS,KAAK,IAAIjI,CAAI,EAAGA,EAAM,IAAI,CAGzD,EAEE6H,EAAQ,UAAU,KAAO,UAAW,CAClC,IAAI/H,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS1J,EAAO4J,EAAM,CACjCF,EAAM,KAAKE,CAAI,CACrB,CAAK,EACM2H,EAAY7H,CAAK,CAC5B,EAEE+H,EAAQ,UAAU,OAAS,UAAW,CACpC,IAAI/H,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS1J,EAAO,CAC3B0J,EAAM,KAAK1J,CAAK,CACtB,CAAK,EACMuR,EAAY7H,CAAK,CAC5B,EAEE+H,EAAQ,UAAU,QAAU,UAAW,CACrC,IAAI/H,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS1J,EAAO4J,EAAM,CACjCF,EAAM,KAAK,CAACE,EAAM5J,CAAK,CAAC,CAC9B,CAAK,EACMuR,EAAY7H,CAAK,CAC5B,EAEMqH,EAAQ,WACVU,EAAQ,UAAU,OAAO,QAAQ,EAAIA,EAAQ,UAAU,SAGzD,SAASK,EAAShR,EAAM,CACtB,GAAIA,EAAK,SACP,OAAO,QAAQ,OAAO,IAAI,UAAU,cAAc,CAAC,EAErDA,EAAK,SAAW,EACpB,CAEE,SAASiR,EAAgBC,EAAQ,CAC/B,OAAO,IAAI,QAAQ,SAASC,EAASC,EAAQ,CAC3CF,EAAO,OAAS,UAAW,CACzBC,EAAQD,EAAO,MAAM,CAC7B,EACMA,EAAO,QAAU,UAAW,CAC1BE,EAAOF,EAAO,KAAK,CAC3B,CACA,CAAK,CACL,CAEE,SAASG,EAAsBC,EAAM,CACnC,IAAIJ,EAAS,IAAI,WACbK,EAAUN,EAAgBC,CAAM,EACpC,OAAAA,EAAO,kBAAkBI,CAAI,EACtBC,CACX,CAEE,SAASC,EAAeF,EAAM,CAC5B,IAAIJ,EAAS,IAAI,WACbK,EAAUN,EAAgBC,CAAM,EACpC,OAAAA,EAAO,WAAWI,CAAI,EACfC,CACX,CAEE,SAASE,EAAsBC,EAAK,CAIlC,QAHIC,EAAO,IAAI,WAAWD,CAAG,EACzBE,EAAQ,IAAI,MAAMD,EAAK,MAAM,EAExB/Q,EAAI,EAAGA,EAAI+Q,EAAK,OAAQ/Q,IAC/BgR,EAAMhR,CAAC,EAAI,OAAO,aAAa+Q,EAAK/Q,CAAC,CAAC,EAExC,OAAOgR,EAAM,KAAK,EAAE,CACxB,CAEE,SAASC,EAAYH,EAAK,CACxB,GAAIA,EAAI,MACN,OAAOA,EAAI,MAAM,CAAC,EAElB,IAAIC,EAAO,IAAI,WAAWD,EAAI,UAAU,EACxC,OAAAC,EAAK,IAAI,IAAI,WAAWD,CAAG,CAAC,EACrBC,EAAK,MAElB,CAEE,SAASG,GAAO,CACd,YAAK,SAAW,GAEhB,KAAK,UAAY,SAAS9R,EAAM,CAC9B,KAAK,UAAYA,EACZA,EAEM,OAAOA,GAAS,SACzB,KAAK,UAAYA,EACRiQ,EAAQ,MAAQ,KAAK,UAAU,cAAcjQ,CAAI,EAC1D,KAAK,UAAYA,EACRiQ,EAAQ,UAAY,SAAS,UAAU,cAAcjQ,CAAI,EAClE,KAAK,cAAgBA,EACZiQ,EAAQ,cAAgB,gBAAgB,UAAU,cAAcjQ,CAAI,EAC7E,KAAK,UAAYA,EAAK,SAAQ,EACrBiQ,EAAQ,aAAeA,EAAQ,MAAQE,EAAWnQ,CAAI,GAC/D,KAAK,iBAAmB6R,EAAY7R,EAAK,MAAM,EAE/C,KAAK,UAAY,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,GACxCiQ,EAAQ,cAAgB,YAAY,UAAU,cAAcjQ,CAAI,GAAKsQ,EAAkBtQ,CAAI,GACpG,KAAK,iBAAmB6R,EAAY7R,CAAI,EAExC,KAAK,UAAYA,EAAO,OAAO,UAAU,SAAS,KAAKA,CAAI,EAhB3D,KAAK,UAAY,GAmBd,KAAK,QAAQ,IAAI,cAAc,IAC9B,OAAOA,GAAS,SAClB,KAAK,QAAQ,IAAI,eAAgB,0BAA0B,EAClD,KAAK,WAAa,KAAK,UAAU,KAC1C,KAAK,QAAQ,IAAI,eAAgB,KAAK,UAAU,IAAI,EAC3CiQ,EAAQ,cAAgB,gBAAgB,UAAU,cAAcjQ,CAAI,GAC7E,KAAK,QAAQ,IAAI,eAAgB,iDAAiD,EAG5F,EAEQiQ,EAAQ,OACV,KAAK,KAAO,UAAW,CACrB,IAAI8B,EAAWf,EAAS,IAAI,EAC5B,GAAIe,EACF,OAAOA,EAGT,GAAI,KAAK,UACP,OAAO,QAAQ,QAAQ,KAAK,SAAS,EAChC,GAAI,KAAK,iBACd,OAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,CAAC,EACnD,GAAI,KAAK,cACd,MAAM,IAAI,MAAM,sCAAsC,EAEtD,OAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC,CAE3D,EAEM,KAAK,YAAc,UAAW,CAC5B,OAAI,KAAK,iBACAf,EAAS,IAAI,GAAK,QAAQ,QAAQ,KAAK,gBAAgB,EAEvD,KAAK,OAAO,KAAKK,CAAqB,CAEvD,GAGI,KAAK,KAAO,UAAW,CACrB,IAAIU,EAAWf,EAAS,IAAI,EAC5B,GAAIe,EACF,OAAOA,EAGT,GAAI,KAAK,UACP,OAAOP,EAAe,KAAK,SAAS,EAC/B,GAAI,KAAK,iBACd,OAAO,QAAQ,QAAQC,EAAsB,KAAK,gBAAgB,CAAC,EAC9D,GAAI,KAAK,cACd,MAAM,IAAI,MAAM,sCAAsC,EAEtD,OAAO,QAAQ,QAAQ,KAAK,SAAS,CAE7C,EAEQxB,EAAQ,WACV,KAAK,SAAW,UAAW,CACzB,OAAO,KAAK,OAAO,KAAK+B,CAAM,CACtC,GAGI,KAAK,KAAO,UAAW,CACrB,OAAO,KAAK,KAAI,EAAG,KAAK,KAAK,KAAK,CACxC,EAEW,IACX,CAGE,IAAIC,EAAU,CAAC,SAAU,MAAO,OAAQ,UAAW,OAAQ,KAAK,EAEhE,SAASC,EAAgBC,EAAQ,CAC/B,IAAIC,EAAUD,EAAO,YAAW,EAChC,OAAOF,EAAQ,QAAQG,CAAO,EAAI,GAAKA,EAAUD,CACrD,CAEE,SAASE,EAAQC,EAAO5N,EAAS,CAC/BA,EAAUA,GAAW,CAAA,EACrB,IAAI1E,EAAO0E,EAAQ,KAEnB,GAAI4N,aAAiBD,EAAS,CAC5B,GAAIC,EAAM,SACR,MAAM,IAAI,UAAU,cAAc,EAEpC,KAAK,IAAMA,EAAM,IACjB,KAAK,YAAcA,EAAM,YACpB5N,EAAQ,UACX,KAAK,QAAU,IAAIiM,EAAQ2B,EAAM,OAAO,GAE1C,KAAK,OAASA,EAAM,OACpB,KAAK,KAAOA,EAAM,KAClB,KAAK,OAASA,EAAM,OAChB,CAACtS,GAAQsS,EAAM,WAAa,OAC9BtS,EAAOsS,EAAM,UACbA,EAAM,SAAW,GAEzB,MACM,KAAK,IAAM,OAAOA,CAAK,EAYzB,GATA,KAAK,YAAc5N,EAAQ,aAAe,KAAK,aAAe,eAC1DA,EAAQ,SAAW,CAAC,KAAK,WAC3B,KAAK,QAAU,IAAIiM,EAAQjM,EAAQ,OAAO,GAE5C,KAAK,OAASwN,EAAgBxN,EAAQ,QAAU,KAAK,QAAU,KAAK,EACpE,KAAK,KAAOA,EAAQ,MAAQ,KAAK,MAAQ,KACzC,KAAK,OAASA,EAAQ,QAAU,KAAK,OACrC,KAAK,SAAW,MAEX,KAAK,SAAW,OAAS,KAAK,SAAW,SAAW1E,EACvD,MAAM,IAAI,UAAU,2CAA2C,EAEjE,KAAK,UAAUA,CAAI,CACvB,CAEEqS,EAAQ,UAAU,MAAQ,UAAW,CACnC,OAAO,IAAIA,EAAQ,KAAM,CAAC,KAAM,KAAK,SAAS,CAAC,CACnD,EAEE,SAASL,EAAOhS,EAAM,CACpB,IAAIuS,EAAO,IAAI,SACf,OAAAvS,EACG,KAAI,EACJ,MAAM,GAAG,EACT,QAAQ,SAASwS,EAAO,CACvB,GAAIA,EAAO,CACT,IAAIC,EAAQD,EAAM,MAAM,GAAG,EACvB1J,EAAO2J,EAAM,MAAK,EAAG,QAAQ,MAAO,GAAG,EACvCvT,EAAQuT,EAAM,KAAK,GAAG,EAAE,QAAQ,MAAO,GAAG,EAC9CF,EAAK,OAAO,mBAAmBzJ,CAAI,EAAG,mBAAmB5J,CAAK,CAAC,CACzE,CACA,CAAO,EACIqT,CACX,CAEE,SAASG,EAAaC,EAAY,CAChC,IAAIzU,EAAU,IAAIyS,EAGdiC,EAAsBD,EAAW,QAAQ,eAAgB,GAAG,EAChE,OAAAC,EAAoB,MAAM,OAAO,EAAE,QAAQ,SAASnT,EAAM,CACxD,IAAIoT,EAAQpT,EAAK,MAAM,GAAG,EACtBgJ,EAAMoK,EAAM,MAAK,EAAG,KAAI,EAC5B,GAAIpK,EAAK,CACP,IAAIvJ,EAAQ2T,EAAM,KAAK,GAAG,EAAE,KAAI,EAChC3U,EAAQ,OAAOuK,EAAKvJ,CAAK,CACjC,CACA,CAAK,EACMhB,CACX,CAEE4T,EAAK,KAAKO,EAAQ,SAAS,EAE3B,SAASS,EAASC,EAAUrO,EAAS,CAC9BA,IACHA,EAAU,CAAA,GAGZ,KAAK,KAAO,UACZ,KAAK,OAASA,EAAQ,SAAW,OAAY,IAAMA,EAAQ,OAC3D,KAAK,GAAK,KAAK,QAAU,KAAO,KAAK,OAAS,IAC9C,KAAK,WAAa,eAAgBA,EAAUA,EAAQ,WAAa,KACjE,KAAK,QAAU,IAAIiM,EAAQjM,EAAQ,OAAO,EAC1C,KAAK,IAAMA,EAAQ,KAAO,GAC1B,KAAK,UAAUqO,CAAQ,CAC3B,CAEEjB,EAAK,KAAKgB,EAAS,SAAS,EAE5BA,EAAS,UAAU,MAAQ,UAAW,CACpC,OAAO,IAAIA,EAAS,KAAK,UAAW,CAClC,OAAQ,KAAK,OACb,WAAY,KAAK,WACjB,QAAS,IAAInC,EAAQ,KAAK,OAAO,EACjC,IAAK,KAAK,GAChB,CAAK,CACL,EAEEmC,EAAS,MAAQ,UAAW,CAC1B,IAAItD,EAAW,IAAIsD,EAAS,KAAM,CAAC,OAAQ,EAAG,WAAY,EAAE,CAAC,EAC7D,OAAAtD,EAAS,KAAO,QACTA,CACX,EAEE,IAAIwD,EAAmB,CAAC,IAAK,IAAK,IAAK,IAAK,GAAG,EAE/CF,EAAS,SAAW,SAASG,EAAKC,EAAQ,CACxC,GAAIF,EAAiB,QAAQE,CAAM,IAAM,GACvC,MAAM,IAAI,WAAW,qBAAqB,EAG5C,OAAO,IAAIJ,EAAS,KAAM,CAAC,OAAQI,EAAQ,QAAS,CAAC,SAAUD,CAAG,CAAC,CAAC,CACxE,EAEEjD,EAAQ,aAAeD,EAAK,aAC5B,GAAI,CACF,IAAIC,EAAQ,YAChB,OAAWV,EAAK,CACZU,EAAQ,aAAe,SAAShR,EAAS8J,EAAM,CAC7C,KAAK,QAAU9J,EACf,KAAK,KAAO8J,EACZ,IAAIqK,EAAQ,MAAMnU,CAAO,EACzB,KAAK,MAAQmU,EAAM,KACzB,EACInD,EAAQ,aAAa,UAAY,OAAO,OAAO,MAAM,SAAS,EAC9DA,EAAQ,aAAa,UAAU,YAAcA,EAAQ,YACzD,CAEE,SAASoD,EAAMd,EAAOe,EAAM,CAC1B,OAAO,IAAI,QAAQ,SAASlC,EAASC,EAAQ,CAC3C,IAAI3B,EAAU,IAAI4C,EAAQC,EAAOe,CAAI,EAErC,GAAI5D,EAAQ,QAAUA,EAAQ,OAAO,QACnC,OAAO2B,EAAO,IAAIpB,EAAQ,aAAa,UAAW,YAAY,CAAC,EAGjE,IAAIsD,EAAM,IAAI,eAEd,SAASC,GAAW,CAClBD,EAAI,MAAK,CACjB,CAEMA,EAAI,OAAS,UAAW,CACtB,IAAI5O,EAAU,CACZ,OAAQ4O,EAAI,OACZ,WAAYA,EAAI,WAChB,QAASZ,EAAaY,EAAI,sBAAqB,GAAM,EAAE,CACjE,EACQ5O,EAAQ,IAAM,gBAAiB4O,EAAMA,EAAI,YAAc5O,EAAQ,QAAQ,IAAI,eAAe,EAC1F,IAAI1E,EAAO,aAAcsT,EAAMA,EAAI,SAAWA,EAAI,aAClDnC,EAAQ,IAAI2B,EAAS9S,EAAM0E,CAAO,CAAC,CAC3C,EAEM4O,EAAI,QAAU,UAAW,CACvBlC,EAAO,IAAI,UAAU,wBAAwB,CAAC,CACtD,EAEMkC,EAAI,UAAY,UAAW,CACzBlC,EAAO,IAAI,UAAU,wBAAwB,CAAC,CACtD,EAEMkC,EAAI,QAAU,UAAW,CACvBlC,EAAO,IAAIpB,EAAQ,aAAa,UAAW,YAAY,CAAC,CAChE,EAEMsD,EAAI,KAAK7D,EAAQ,OAAQA,EAAQ,IAAK,EAAI,EAEtCA,EAAQ,cAAgB,UAC1B6D,EAAI,gBAAkB,GACb7D,EAAQ,cAAgB,SACjC6D,EAAI,gBAAkB,IAGpB,iBAAkBA,GAAOrD,EAAQ,OACnCqD,EAAI,aAAe,QAGrB7D,EAAQ,QAAQ,QAAQ,SAASvQ,EAAO4J,EAAM,CAC5CwK,EAAI,iBAAiBxK,EAAM5J,CAAK,CACxC,CAAO,EAEGuQ,EAAQ,SACVA,EAAQ,OAAO,iBAAiB,QAAS8D,CAAQ,EAEjDD,EAAI,mBAAqB,UAAW,CAE9BA,EAAI,aAAe,GACrB7D,EAAQ,OAAO,oBAAoB,QAAS8D,CAAQ,CAEhE,GAGMD,EAAI,KAAK,OAAO7D,EAAQ,WAAc,YAAc,KAAOA,EAAQ,SAAS,CAClF,CAAK,CACL,CAEE,OAAA2D,EAAM,SAAW,GAEZrD,EAAK,QACRA,EAAK,MAAQqD,EACbrD,EAAK,QAAUY,EACfZ,EAAK,QAAUsC,EACftC,EAAK,SAAW+C,GAGlB9C,EAAQ,QAAUW,EAClBX,EAAQ,QAAUqC,EAClBrC,EAAQ,SAAW8C,EACnB9C,EAAQ,MAAQoD,EAEhB,OAAO,eAAepD,EAAS,aAAc,CAAE,MAAO,GAAM,EAErDA,CAET,GAAG,CAAA,CAAE,CACL,GAAGH,CAAQ,EACXA,EAAS,MAAM,SAAW,GAE1B,OAAOA,EAAS,MAAM,SAGtB,IAAI2D,EAAM3D,EACVG,EAAUwD,EAAI,MACdxD,EAAA,QAAkBwD,EAAI,MACtBxD,EAAA,MAAgBwD,EAAI,MACpBxD,EAAA,QAAkBwD,EAAI,QACtBxD,EAAA,QAAkBwD,EAAI,QACtBxD,EAAA,SAAmBwD,EAAI,SACvBC,EAAA,QAAiBzD,6FChiBjB,MAAM0D,GAAkBxV,GAAY,CAChC,IAAIyV,EAAW,CAAA,EACf,OAAIzV,IACK,OAAO,SAAY,aAAeA,aAAmB,SACrD0V,IAAcC,GAAAA,SAAsB3V,aAAmB2V,GAAAA,QACxDF,EAAW1V,EAA6BC,CAAO,EAE1C,MAAM,QAAQA,CAAO,EAC1BA,EAAQ,QAAQ,CAAC,CAAC4K,EAAM5J,CAAK,IAAM,CAC3B4J,GAAQ5J,IAAU,SAClByU,EAAS7K,CAAI,EAAI5J,EAEzB,CAAC,EAGDyU,EAAWzV,GAGZyV,CACX,EAIMG,GAAc9V,GAAQA,EAAI,QAAQ,sBAAuB,GAAG,EAAE,KAAI,EAIlE+V,GAAsBC,GAAW,CACnC,GAAI,CAAC,MAAM,QAAQA,EAAO,KAAK,EAAG,CAC9B,MAAMC,EAAUD,EACVE,EAAS,CAAC,SAAS,mBAAmBJ,GAAWG,EAAQ,KAAK,CAAC,CAAC,EAAE,EACxE,OAAID,EAAO,WACPE,EAAO,KAAK,aAAa,mBAAmBD,EAAQ,eAAe,UAAUA,EAAQ,SAAS,CAAC,CAAC,EAAE,EAElGA,EAAQ,eACRC,EAAO,KAAK,iBAAiB,mBAAmBD,EAAQ,aAAa,CAAC,EAAE,EAErEC,EAAO,KAAK,GAAG,CAC1B,CACA,GAAI,OAAOF,EAAO,WAAc,aAAe,CAAC,MAAM,QAAQA,EAAO,SAAS,EAC1E,MAAM,IAAI,MAAM,8DAA8D,EAGlF,MAAMC,EAAUD,EACVG,EAAUH,EAAO,MAAM,OAAO,CAACI,EAAKC,EAAc7H,KACpD4H,EAAI,KAAK,CACL,MAAON,GAAWO,CAAY,EAC9B,UAAWJ,EAAQ,UAAYA,EAAQ,eAAe,UAAUA,EAAQ,UAAUzH,CAAK,CAAC,EAAI,MACxG,CAAS,EACM4H,GACR,CAAA,CAAE,EACL,MAAO,SAAS,mBAAmBH,EAAQ,eAAe,UAAUE,CAAO,CAAC,CAAC,EACjF,EACMG,GAA2BnC,GAAkB6B,GAAWO,EAAA,4BAC1D,KAAM,CAAE,IAAAtB,EAAK,MAAAuB,EAAO,UAAAhW,EAAW,cAAAuQ,EAAe,MAAAqE,EAAO,aAAAqB,EAAc,WAAAC,CAAU,EAAKV,EAC5E9V,EAAUgP,EAAA,GAAK8G,EAAO,SAC5B,IAAIW,EAAc,GACd3U,EACAmS,IAAW,QACXnS,EAAO4U,GAAkBJ,EAAOhW,EAAWuQ,EAAe0F,EAAa,cAAc,EACjF,OAAOzU,GAAS,WAEhB9B,EAAQ,cAAc,EAAI,qBAK9ByW,EAAcZ,GAAmB,CAC7B,MAAAS,EACA,UAAAhW,EACA,cAAAuQ,EACA,gBAAgBI,EAAAsF,EAAa,iBAAb,KAAAtF,EAA+BrR,CAC3D,CAAS,EAEL,MAAMuV,EAAOnG,EAAA,CACT,OAAAiF,EACA,QAAAjU,EACA,KAAA8B,GACGyU,GAEP,IAAII,EAAc5B,EACd6B,EAAezB,EACnB,GAAIqB,EAAY,CAEZ,MAAoCxF,EADrB,MAAM,QAAQ,QAAQwF,EAAWK,GAAA7H,EAAA,GAAKmG,GAAL,CAAW,IAAAJ,EAAK,cAAAlE,EAAe,UAAAvQ,CAAS,EAAE,CAAC,EACnF,KAAKwW,GAAuB9F,EAAZ+F,EAAAC,GAAYhG,EAAZ,CAAhB,QACR2F,EAAcG,EACdF,EAAeG,CACnB,CACA,OAAIN,IACAE,EAAc,GAAGA,CAAW,IAAIF,CAAW,IAExC,MAAMvB,EAAMyB,EAAaC,CAAY,CAChD,GAIA,MAAMK,EAAc,CAChB,YAAYlC,EAAKmC,EAAgB,GAAI,CACjC,KAAK,IAAMnC,EACX,KAAK,cAAgBmC,EAIrB,KAAK,WAAa,IAAUhU,IAASmT,EAAA,sBACjC,KAAM,CAAC5V,EAAgBH,EAAWC,CAAc,EAAI2C,EAC9CiU,EAAoB3W,GAAoBC,EAAgBH,EAAWC,CAAc,EAC0B0Q,EAAA,KAAK,cAA9G,SAAAjR,EAAS,MAAAkV,EAAQkC,GAAY,OAAAnD,EAAS,OAAQ,kBAAAoD,EAAmB,mBAAAC,GAAwCrG,EAAjBsF,EAAAS,GAAiB/F,EAAjB,CAAxF,UAAS,QAAoB,SAAiB,oBAAmB,uBACnE,CAAE,IAAA8D,CAAG,EAAK,KACZoC,EAAkB,SAAW,SAC7BZ,EAAa,OAASY,EAAkB,QAE5C,KAAM,CAAE,cAAAtG,CAAa,EAAKK,GAAuBiG,EAAkB,KAAK,EACxE,OAAOI,GAAY,CACf,IAAAxC,EACA,MAAOoC,EAAkB,MACzB,UAAWA,EAAkB,UAC7B,QAASnI,IAAA,GACFwG,GAAegC,GAAexX,CAAO,CAAC,GACtCwV,GAAe2B,EAAkB,cAAc,GAEtD,cAAAtG,EACA,MAAAqE,EACA,OAAAjB,EACA,aAAAsC,EACA,WAAYc,CAC5B,CAAa,EACI,KAAM/F,IACHgG,GACAA,EAAmBhG,CAAQ,EAExBA,EACV,EACI,MAAO2D,GAAU,CAClB,MAAIqC,GACAA,EAAmBrC,CAAK,EAEtBA,CACV,CAAC,CACL,EACJ,CACM,QAAQ5U,KAAsBoX,EAA4B,QAAApB,EAAA,sBAC5D,KAAM,CAAC/V,EAAWC,CAAc,EAAIkX,EAC9BC,EAAiBtX,GAAiBC,EAAmBC,EAAWC,CAAc,EAC6B0Q,EAAA,KAAK,cAA9G,SAAAjR,EAAS,MAAAkV,EAAQkC,GAAY,OAAAnD,EAAS,OAAQ,kBAAAoD,EAAmB,mBAAAC,GAAwCrG,EAAjBsF,EAAAS,GAAiB/F,EAAjB,CAAxF,UAAS,QAAoB,SAAiB,oBAAmB,uBACnE,CAAE,IAAA8D,CAAG,EAAK,KACZ2C,EAAe,SAAW,SAC1BnB,EAAa,OAASmB,EAAe,QAEzC,KAAM,CAAE,MAAApB,EAAO,cAAAzF,CAAa,EAAKK,GAAuBwG,EAAe,QAAQ,EAC/E,OAAOH,GAAY,CACf,IAAAxC,EACA,MAAAuB,EACA,UAAWoB,EAAe,UAC1B,QAAS1I,IAAA,GACFwG,GAAegC,GAAexX,CAAO,CAAC,GACtCwV,GAAekC,EAAe,cAAc,GAEnD,cAAA7G,EACA,MAAAqE,EACA,OAAAjB,EACA,aAAAsC,EACA,WAAYc,CACxB,CAAS,EACI,KAAM/F,IACHgG,GACAA,EAAmBhG,CAAQ,EAExBA,EAAS,KACnB,EACI,MAAO2D,GAAU,CAClB,MAAIqC,GACAA,EAAmBrC,CAAK,EAEtBA,CACV,CAAC,CACL,GAEA,cAActU,EAAoBJ,EAAgB,OAC9C,MAAMoX,EAAsBjX,GAAsBC,EAAoBJ,CAAc,EAC/C0Q,EAAA,KAAK,cAAlC,SAAAjR,GAA6BiR,EAAjBsF,EAAAS,GAAiB/F,EAAjB,CAAZ,YACJ0G,EAAoB,SAAW,SAC/BpB,EAAa,OAASoB,EAAoB,QAE9C,MAAMC,EAAUD,EAAoB,UAAU,IAAI,CAAC,CAAE,SAAAlM,CAAQ,IAAOyF,GAAuBzF,CAAQ,EAAE,KAAK,EACpGnL,EAAYqX,EAAoB,UAAU,IAAI,CAAC,CAAE,UAAArX,CAAS,IAAOA,CAAS,EAChF,OAAOiX,GAAY,CACf,IAAK,KAAK,IACV,MAAOK,EAEP,UAAAtX,EACA,QAAS0O,IAAA,GACFwG,GAAegC,GAAexX,CAAO,CAAC,GACtCwV,GAAemC,EAAoB,cAAc,GAExD,cAAe,OACf,OAAO3G,EAAA,KAAK,cAAc,QAAnB,KAAAA,EAA4BoG,GACnC,OAAQ,KAAK,cAAc,QAAU,OACrC,aAAAb,EACA,WAAY,KAAK,cAAc,iBAC3C,CAAS,EACI,KAAMjF,IACH,KAAK,cAAc,oBACnB,KAAK,cAAc,mBAAmBA,CAAQ,EAE3CA,EAAS,KACnB,EACI,MAAO2D,GAAU,CAClB,MAAI,KAAK,cAAc,oBACnB,KAAK,cAAc,mBAAmBA,CAAK,EAEzCA,CACV,CAAC,CACL,CACA,WAAWjV,EAAS,CAChB,YAAK,cAAc,QAAUA,EACtB,IACX,CAIA,UAAUuK,EAAKvJ,EAAO,CAClB,KAAM,CAAE,QAAAhB,GAAY,KAAK,cACzB,OAAIA,EAGAA,EAAQuK,CAAG,EAAIvJ,EAGf,KAAK,cAAc,QAAU,CAAE,CAACuJ,CAAG,EAAGvJ,CAAK,EAExC,IACX,CAIA,YAAYA,EAAO,CACf,YAAK,IAAMA,EACJ,IACX,CACJ,CACA,MAAMuW,GAAqBzB,GAAWO,EAAA,8BAClC,KAAM,CAAE,MAAAC,EAAO,UAAAhW,EAAW,aAAAiW,CAAY,EAAKT,EACrC+B,EAAUzB,GAAwBvW,GAAUoR,EAAA6E,EAAO,SAAP,KAAA7E,EAAiB,MAAM,CAAC,EACpE6G,EAAkB,MAAM,QAAQhC,EAAO,KAAK,EAC5CxE,EAAW,MAAMuG,EAAQ/B,CAAM,EAC/B7O,EAAS,MAAM8Q,GAAUzG,GAAUN,EAAAuF,EAAa,iBAAb,KAAAvF,EAA+BpR,CAAqB,EACvFoY,EAA2B,MAAM,QAAQ/Q,CAAM,EAC/C,CAACA,EAAO,KAAK,CAAC,CAAE,KAAAgR,CAAI,IAAO,CAACA,CAAI,EAChC,EAAQhR,EAAO,KACfiR,EAAgC,MAAM,QAAQjR,CAAM,GACtD,CAACA,EAAO,QACP,MAAM,QAAQA,EAAO,MAAM,GAAK,CAACA,EAAO,OAAO,QAChDsP,EAAa,cAAgB,OAC7BA,EAAa,cAAgB,SACjC,GAAIjF,EAAS,IAAM4G,GAAiCF,EAA0B,CAE1E,MAA+BxG,GAAA,MAAM,QAAQvK,CAAM,EAAIA,GAA/C,QAAQnE,GAAe0O,EAAT2G,EAAAnB,GAASxF,EAAT,CAAd,WACFyG,EAAO1B,EAAa,cAAgB,SAAW4B,EAAOlR,EAG5D,OAAO4P,GAAA7H,EAAA,GAFc8I,EAAkB,CAAE,KAAAG,CAAI,EAAKA,GAE3C,CAEH,QAAS3G,EAAS,QAClB,OAAQA,EAAS,MAC7B,EACI,KACK,CACD,MAAM8G,EAAc,OAAOnR,GAAW,SAChC,CACE,MAAOA,CACvB,EACcA,EACN,MAAM,IAAIoK,GAEVwF,GAAA7H,EAAA,GAAKoJ,GAAL,CAAkB,OAAQ9G,EAAS,OAAQ,QAASA,EAAS,OAAO,GAAI,CAAE,MAAAgF,EAAO,UAAAhW,CAAS,CAAE,CAChG,CACJ,GAyEMoW,GAAoB,CAACJ,EAAOhW,EAAWuQ,EAAewH,IAAmB,CAC3E,MAAMC,EAAkBD,GAAA,KAAAA,EAAkBzY,EAC1C,GAAI,CAAC,MAAM,QAAQ0W,CAAK,EACpB,OAAOgC,EAAgB,UAAU,CAAE,MAAAhC,EAAO,UAAAhW,EAAW,cAAAuQ,CAAa,CAAE,EAExE,GAAI,OAAOvQ,GAAc,aAAe,CAAC,MAAM,QAAQA,CAAS,EAC5D,MAAM,IAAI,MAAM,qEAAqE,EAGzF,MAAM2V,EAAUK,EAAM,OAAO,CAACJ,EAAKC,EAAc7H,KAC7C4H,EAAI,KAAK,CAAE,MAAOC,EAAc,UAAW7V,EAAYA,EAAUgO,CAAK,EAAI,OAAW,EAC9E4H,GACR,CAAA,CAAE,EACL,OAAOoC,EAAgB,UAAUrC,CAAO,CAC5C,EACM8B,GAAY,CAAOzG,EAAU+G,IAAmBhC,EAAA,sBAClD,IAAIkC,EAMJ,OALAjH,EAAS,QAAQ,QAAQ,CAACtQ,EAAOuJ,IAAQ,CACjCA,EAAI,gBAAkB,iBACtBgO,EAAcvX,EAEtB,CAAC,EACGuX,IACCA,EAAY,YAAW,EAAG,WAAW,kBAAkB,GACpDA,EAAY,YAAW,EAAG,WAAW,0BAA0B,GAC/DA,EAAY,YAAW,EAAG,WAAW,mCAAmC,GACrEF,EAAe,MAAM,MAAM/G,EAAS,KAAI,CAAE,EAG1CA,EAAS,KAAI,CAE5B,GACMkG,GAAkBxW,GACb,OAAOA,GAAU,WAAaA,EAAK,EAAKA,qCCvYnD8Q,EAAUyD,UAAiBiD,EAC3B1G,EAAA,aAAuB2G,EAEvB,SAASD,EAAUtG,EAAKwG,EAAUC,EAAQC,EAAe,CACvD,OAAO,KAAK,UAAU1G,EAAKuG,EAAWC,EAAUE,CAAa,EAAGD,CAAM,CACxE,CAEA,SAASF,EAAWC,EAAUE,EAAe,CAC3C,IAAIzK,EAAQ,CAAA,EAAIE,EAAO,CAAA,EAEvB,OAAIuK,GAAiB,OAAMA,EAAgB,SAASrO,EAAKvJ,EAAO,CAC9D,OAAImN,EAAM,CAAC,IAAMnN,EAAc,eACxB,eAAiBqN,EAAK,MAAM,EAAGF,EAAM,QAAQnN,CAAK,CAAC,EAAE,KAAK,GAAG,EAAI,GAC5E,GAES,SAASuJ,EAAKvJ,EAAO,CAC1B,GAAImN,EAAM,OAAS,EAAG,CACpB,IAAI0K,EAAU1K,EAAM,QAAQ,IAAI,EAChC,CAAC0K,EAAU1K,EAAM,OAAO0K,EAAU,CAAC,EAAI1K,EAAM,KAAK,IAAI,EACtD,CAAC0K,EAAUxK,EAAK,OAAOwK,EAAS,IAAUtO,CAAG,EAAI8D,EAAK,KAAK9D,CAAG,EAC1D,CAAC4D,EAAM,QAAQnN,CAAK,IAAGA,EAAQ4X,EAAc,KAAK,KAAMrO,EAAKvJ,CAAK,EAC5E,MACSmN,EAAM,KAAKnN,CAAK,EAErB,OAAO0X,GAAY,KAAO1X,EAAQ0X,EAAS,KAAK,KAAMnO,EAAKvJ,CAAK,CACpE,CACA,+CCeO,MAAM8X,GAAiB,IAAO,GCV9B,IAAIC,GAAW,UAAW,CAC/B,OAAAA,GAAW,OAAO,QAAU,SAAkB,EAAG,CAC7C,QAASC,EAAG,EAAI,EAAGC,EAAI,UAAU,OAAQ,EAAIA,EAAG,IAAK,CACjDD,EAAI,UAAU,CAAC,EACf,QAASE,KAAKF,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGE,CAAC,IAAG,EAAEA,CAAC,EAAIF,EAAEE,CAAC,EAC/E,CACA,OAAO,CACX,EACOH,GAAS,MAAM,KAAM,SAAS,CACvC,EA+RuB,OAAO,iBAAoB,YAAa,gBCrU/D,IAAII,GAAW,IAAI,IACfC,GAAoB,IAAI,IACxBC,GAAwB,GACxBC,GAAgC,GACpC,SAASC,GAAUC,EAAQ,CACvB,OAAOA,EAAO,QAAQ,UAAW,GAAG,EAAE,KAAI,CAC9C,CACA,SAASC,GAAgBxV,EAAK,CAC1B,OAAOsV,GAAUtV,EAAI,OAAO,KAAK,UAAUA,EAAI,MAAOA,EAAI,GAAG,CAAC,CAClE,CACA,SAASyV,GAAiBnK,EAAK,CAC3B,IAAIoK,EAAW,IAAI,IACfC,EAAc,CAAA,EAClB,OAAArK,EAAI,YAAY,QAAQ,SAAUsK,EAAoB,CAClD,GAAIA,EAAmB,OAAS,qBAAsB,CAClD,IAAIC,EAAeD,EAAmB,KAAK,MACvCE,EAAYN,GAAgBI,EAAmB,GAAG,EAClDG,EAAeZ,GAAkB,IAAIU,CAAY,EACjDE,GAAgB,CAACA,EAAa,IAAID,CAAS,EACvCV,IACA,QAAQ,KAAK,+BAAiCS,EAAe;AAAA;AAAA,6EAEuB,EAGlFE,GACNZ,GAAkB,IAAIU,EAAcE,EAAe,IAAI,GAAG,EAE9DA,EAAa,IAAID,CAAS,EACrBJ,EAAS,IAAII,CAAS,IACvBJ,EAAS,IAAII,CAAS,EACtBH,EAAY,KAAKC,CAAkB,EAE3C,MAEID,EAAY,KAAKC,CAAkB,CAE3C,CAAC,EACMd,GAASA,GAAS,CAAA,EAAIxJ,CAAG,EAAG,CAAE,YAAaqK,EAAa,CACnE,CACA,SAASK,GAASC,EAAK,CACnB,IAAIC,EAAU,IAAI,IAAID,EAAI,WAAW,EACrCC,EAAQ,QAAQ,SAAUnW,EAAM,CACxBA,EAAK,KACL,OAAOA,EAAK,IAChB,OAAO,KAAKA,CAAI,EAAE,QAAQ,SAAUuG,EAAK,CACrC,IAAIvJ,EAAQgD,EAAKuG,CAAG,EAChBvJ,GAAS,OAAOA,GAAU,UAC1BmZ,EAAQ,IAAInZ,CAAK,CAEzB,CAAC,CACL,CAAC,EACD,IAAIiD,EAAMiW,EAAI,IACd,OAAIjW,IACA,OAAOA,EAAI,WACX,OAAOA,EAAI,UAERiW,CACX,CACA,SAASE,GAAchZ,EAAQ,CAC3B,IAAIiZ,EAAWd,GAAUnY,CAAM,EAC/B,GAAI,CAAC+X,GAAS,IAAIkB,CAAQ,EAAG,CACzB,IAAIC,EAAShP,GAAMlK,EAAQ,CACvB,8BAA+BkY,GAC/B,6BAA8BA,EAC1C,CAAS,EACD,GAAI,CAACgB,GAAUA,EAAO,OAAS,WAC3B,MAAM,IAAI,MAAM,+BAA+B,EAEnDnB,GAAS,IAAIkB,EAAUJ,GAASP,GAAiBY,CAAM,CAAC,CAAC,CAC7D,CACA,OAAOnB,GAAS,IAAIkB,CAAQ,CAChC,CACO,SAASE,EAAIC,EAAU,CAE1B,QADItX,EAAO,CAAA,EACFuX,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCvX,EAAKuX,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE3B,OAAOD,GAAa,WACpBA,EAAW,CAACA,CAAQ,GAExB,IAAIvT,EAASuT,EAAS,CAAC,EACvB,OAAAtX,EAAK,QAAQ,SAAUwX,EAAKhY,EAAG,CACvBgY,GAAOA,EAAI,OAAS,WACpBzT,GAAUyT,EAAI,IAAI,OAAO,KAGzBzT,GAAUyT,EAEdzT,GAAUuT,EAAS9X,EAAI,CAAC,CAC5B,CAAC,EACM0X,GAAcnT,CAAM,CAC/B,CACO,SAAS0T,IAAc,CAC1BxB,GAAS,MAAK,EACdC,GAAkB,MAAK,CAC3B,CACO,SAASwB,IAA0B,CACtCvB,GAAwB,EAC5B,CACO,SAASwB,IAAsC,CAClDvB,GAAgC,EACpC,CACO,SAASwB,IAAuC,CACnDxB,GAAgC,EACpC,CACA,IAAIyB,GAAS,CACT,IAAKR,EACL,YAAaI,GACb,wBAAyBC,GACzB,oCAAqCC,GACrC,qCAAsCC,EAC1C,GACC,SAAUE,EAAO,CACdA,EAAM,IAAMD,GAAO,IAAKC,EAAM,YAAcD,GAAO,YAAaC,EAAM,wBAA0BD,GAAO,wBAAyBC,EAAM,oCAAsCD,GAAO,oCAAqCC,EAAM,qCAAuCD,GAAO,oCAChR,GAAGR,IAAQA,EAAM,CAAA,EAAG,EACpBA,EAAI,QAAaA,ECydV,MAAMU,GAAwBV;AAAA;AAAA;AAAA;AAAA;AAAA,EAMxBW,GAAsBX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BtBY,GAA4BZ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAa5Ba,GAA0Bb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAa1Bc,GAA+Bd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAW/Be,GAAsBf;AAAA;AAAA;AAAA;AAAA,EAKtBgB,GAA6BhB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiB7BiB,GAA4BjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAuFtCU,EAAqB;AAAA,EAEXQ,GAAiBlB;AAAA;AAAA;AAAA;AAAA,EAKjBmB,GAA4BnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAiDtCU,EAAqB;AAAA,EAUlBU,GAAqC,CAC1CC,EACAC,EACAC,EACAxb,IACIsb,EAAA,EAEE,SAASG,GACfC,EACAC,EAAkCN,GACjC,CACD,MAAO,CACN,YACCrb,EACAC,EAC+B,CAC/B,OAAO0b,EACLC,GACAF,EAAO,QACNd,GACA5a,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,cACA,WACA5b,CAAA,CAEF,EACA,kBACCA,EACAC,EACqC,CACrC,OAAO0b,EACLC,GACAF,EAAO,QACNb,GACA7a,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,oBACA,WACA5b,CAAA,CAEF,EACA,gBACCA,EACAC,EACmC,CACnC,OAAO0b,EACLC,GACAF,EAAO,QACNZ,GACA9a,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,kBACA,WACA5b,CAAA,CAEF,EACA,qBACCA,EACAC,EACwC,CACxC,OAAO0b,EACLC,GACAF,EAAO,QACNX,GACA/a,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,uBACA,WACA5b,CAAA,CAEF,EACA,YACCA,EACAC,EAC+B,CAC/B,OAAO0b,EACLC,GACAF,EAAO,QACNV,GACAhb,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,cACA,WACA5b,CAAA,CAEF,EACA,mBACCA,EACAC,EACsC,CACtC,OAAO0b,EACLC,GACAF,EAAO,QACNT,GACAjb,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,qBACA,WACA5b,CAAA,CAEF,EACA,kBACCA,EACAC,EACqC,CACrC,OAAO0b,EACLC,GACAF,EAAO,QACNR,GACAlb,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,oBACA,WACA5b,CAAA,CAEF,EACA,OACCA,EACAC,EACuB,CACvB,OAAO0b,EACLC,GACAF,EAAO,QAAqBP,GAAgBnb,EAAW0O,IAAA,GACnDzO,GACA2b,EACH,EACF,SACA,QACA5b,CAAA,CAEF,EACA,kBACCA,EACAC,EACkC,CAClC,OAAO0b,EACLC,GACAF,EAAO,QACNN,GACApb,EACA0O,IAAA,GAAKzO,GAAmB2b,EAAsB,EAEhD,oBACA,QACA5b,CAAA,CAEF,CAAA,CAEF,CCl8BA,IAAI6b,GAAK,WAAYC,GAAM,YAAaC,GAAM,WAE1CC,GAAO,IAAIH,GAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,CAAC,CAAC,EAE5II,GAAO,IAAIJ,GAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,CAAC,CAAC,EAEnIK,GAAO,IAAIL,GAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAC,EAEhFM,GAAO,SAAUC,EAAI5X,EAAO,CAE5B,QADI6X,EAAI,IAAIP,GAAI,EAAE,EACT,EAAI,EAAG,EAAI,GAAI,EAAE,EACtBO,EAAE,CAAC,EAAI7X,GAAS,GAAK4X,EAAG,EAAI,CAAC,EAIjC,QADI,EAAI,IAAIL,GAAIM,EAAE,EAAE,CAAC,EACZ,EAAI,EAAG,EAAI,GAAI,EAAE,EACtB,QAASC,EAAID,EAAE,CAAC,EAAGC,EAAID,EAAE,EAAI,CAAC,EAAG,EAAEC,EAC/B,EAAEA,CAAC,EAAMA,EAAID,EAAE,CAAC,GAAM,EAAK,EAGnC,MAAO,CAAE,EAAGA,EAAG,CAAI,CACvB,EACI1L,GAAKwL,GAAKH,GAAM,CAAC,EAAGO,GAAK5L,GAAG,EAAG6L,GAAQ7L,GAAG,EAE9C4L,GAAG,EAAE,EAAI,IAAKC,GAAM,GAAG,EAAI,GAI3B,QAHI9L,GAAKyL,GAAKF,GAAM,CAAC,EAAcQ,GAAQ/L,GAAG,EAE1CgM,GAAM,IAAIZ,GAAI,KAAK,EACd1Z,EAAI,EAAGA,EAAI,MAAO,EAAEA,EAAG,CAE5B,IAAI+N,IAAM/N,EAAI,QAAW,GAAOA,EAAI,QAAW,EAC/C+N,IAAMA,GAAI,QAAW,GAAOA,GAAI,QAAW,EAC3CA,IAAMA,GAAI,QAAW,GAAOA,GAAI,OAAW,EAC3CuM,GAAIta,CAAC,IAAO+N,GAAI,QAAW,GAAOA,GAAI,MAAW,IAAO,CAC5D,CAuDA,QAnDIwM,GAAQ,SAAUC,EAAIC,EAAIC,EAAG,CAO7B,QANIpE,EAAIkE,EAAG,OAEPxa,EAAI,EAEJ2a,EAAI,IAAIjB,GAAIe,CAAE,EAEXza,EAAIsW,EAAG,EAAEtW,EACRwa,EAAGxa,CAAC,GACJ,EAAE2a,EAAEH,EAAGxa,CAAC,EAAI,CAAC,EAGrB,IAAI4a,EAAK,IAAIlB,GAAIe,CAAE,EACnB,IAAKza,EAAI,EAAGA,EAAIya,EAAI,EAAEza,EAClB4a,EAAG5a,CAAC,EAAK4a,EAAG5a,EAAI,CAAC,EAAI2a,EAAE3a,EAAI,CAAC,GAAM,EAEtC,IAAI6a,EACJ,GAAIH,EAAG,CAEHG,EAAK,IAAInB,GAAI,GAAKe,CAAE,EAEpB,IAAIK,EAAM,GAAKL,EACf,IAAKza,EAAI,EAAGA,EAAIsW,EAAG,EAAEtW,EAEjB,GAAIwa,EAAGxa,CAAC,EAQJ,QANI+a,EAAM/a,GAAK,EAAKwa,EAAGxa,CAAC,EAEpBgb,EAAMP,EAAKD,EAAGxa,CAAC,EAEfxC,EAAIod,EAAGJ,EAAGxa,CAAC,EAAI,CAAC,KAAOgb,EAElBC,EAAIzd,GAAM,GAAKwd,GAAO,EAAIxd,GAAKyd,EAAG,EAAEzd,EAEzCqd,EAAGP,GAAI9c,CAAC,GAAKsd,CAAG,EAAIC,CAIpC,KAGI,KADAF,EAAK,IAAInB,GAAIpD,CAAC,EACTtW,EAAI,EAAGA,EAAIsW,EAAG,EAAEtW,EACbwa,EAAGxa,CAAC,IACJ6a,EAAG7a,CAAC,EAAIsa,GAAIM,EAAGJ,EAAGxa,CAAC,EAAI,CAAC,GAAG,GAAM,GAAKwa,EAAGxa,CAAC,GAItD,OAAO6a,CACX,EAEIK,GAAM,IAAIzB,GAAG,GAAG,EACXzZ,EAAI,EAAGA,EAAI,IAAK,EAAEA,EACvBkb,GAAIlb,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBkb,GAAIlb,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBkb,GAAIlb,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBkb,GAAIlb,CAAC,EAAI,EAGb,QADImb,GAAM,IAAI1B,GAAG,EAAE,EACVzZ,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtBmb,GAAInb,CAAC,EAAI,EAEV,IAACob,GAAoBb,GAAKW,GAAK,EAAG,CAAC,EAElCG,GAAoBd,GAAKY,GAAK,EAAG,CAAC,EAqBlCG,GAAO,SAAU9E,EAAG,CAAE,OAASA,EAAI,GAAK,EAAK,CAAG,EAGhD+E,GAAM,SAAU/d,EAAG8Y,EAAGhH,EAAG,CAGzB,OAAIA,GAAK,MAAQA,EAAI9R,EAAE,UACnB8R,EAAI9R,EAAE,QAEH,IAAIic,GAAGjc,EAAE,SAAS8Y,EAAGhH,CAAC,CAAC,CAClC,EAuOIkM,GAAQ,SAAUC,EAAGjF,EAAGhZ,EAAG,CAC3BA,IAAMgZ,EAAI,EACV,IAAIjZ,EAAKiZ,EAAI,EAAK,EAClBiF,EAAEle,CAAC,GAAKC,EACRie,EAAEle,EAAI,CAAC,GAAKC,GAAK,CACrB,EAEIke,GAAU,SAAUD,EAAGjF,EAAGhZ,EAAG,CAC7BA,IAAMgZ,EAAI,EACV,IAAIjZ,EAAKiZ,EAAI,EAAK,EAClBiF,EAAEle,CAAC,GAAKC,EACRie,EAAEle,EAAI,CAAC,GAAKC,GAAK,EACjBie,EAAEle,EAAI,CAAC,GAAKC,GAAK,EACrB,EAEIme,GAAQ,SAAUF,EAAGhB,EAAI,CAGzB,QADImB,EAAI,CAAA,EACC,EAAI,EAAG,EAAIH,EAAE,OAAQ,EAAE,EACxBA,EAAE,CAAC,GACHG,EAAE,KAAK,CAAE,EAAG,EAAG,EAAGH,EAAE,CAAC,EAAG,EAEhC,IAAInF,EAAIsF,EAAE,OACNC,EAAKD,EAAE,MAAK,EAChB,GAAI,CAACtF,EACD,MAAO,CAAE,EAAGwF,GAAI,EAAG,CAAC,EACxB,GAAIxF,GAAK,EAAG,CACR,IAAI9Y,EAAI,IAAIic,GAAGmC,EAAE,CAAC,EAAE,EAAI,CAAC,EACzB,OAAApe,EAAEoe,EAAE,CAAC,EAAE,CAAC,EAAI,EACL,CAAE,EAAGpe,EAAG,EAAG,CAAC,CACvB,CACAoe,EAAE,KAAK,SAAUG,EAAG9B,EAAG,CAAE,OAAO8B,EAAE,EAAI9B,EAAE,CAAG,CAAC,EAG5C2B,EAAE,KAAK,CAAE,EAAG,GAAI,EAAG,MAAO,EAC1B,IAAIjB,EAAIiB,EAAE,CAAC,EAAGlB,EAAIkB,EAAE,CAAC,EAAGI,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAO7C,IANAN,EAAE,CAAC,EAAI,CAAE,EAAG,GAAI,EAAGjB,EAAE,EAAID,EAAE,EAAG,EAAGC,EAAG,EAAGD,CAAC,EAMjCuB,GAAM3F,EAAI,GACbqE,EAAIiB,EAAEA,EAAEI,CAAE,EAAE,EAAIJ,EAAEM,CAAE,EAAE,EAAIF,IAAOE,GAAI,EACrCxB,EAAIkB,EAAEI,GAAMC,GAAML,EAAEI,CAAE,EAAE,EAAIJ,EAAEM,CAAE,EAAE,EAAIF,IAAOE,GAAI,EACjDN,EAAEK,GAAI,EAAI,CAAE,EAAG,GAAI,EAAGtB,EAAE,EAAID,EAAE,EAAG,EAAGC,EAAG,EAAGD,CAAC,EAG/C,QADIyB,EAASN,EAAG,CAAC,EAAE,EACV,EAAI,EAAG,EAAIvF,EAAG,EAAE,EACjBuF,EAAG,CAAC,EAAE,EAAIM,IACVA,EAASN,EAAG,CAAC,EAAE,GAGvB,IAAIO,EAAK,IAAI1C,GAAIyC,EAAS,CAAC,EAEvBE,EAAMC,GAAGV,EAAEK,EAAK,CAAC,EAAGG,EAAI,CAAC,EAC7B,GAAIC,EAAM5B,EAAI,CAIV,IAAI,EAAI,EAAG8B,EAAK,EAEZC,EAAMH,EAAM5B,EAAIgC,EAAM,GAAKD,EAE/B,IADAX,EAAG,KAAK,SAAUE,EAAG9B,EAAG,CAAE,OAAOmC,EAAGnC,EAAE,CAAC,EAAImC,EAAGL,EAAE,CAAC,GAAKA,EAAE,EAAI9B,EAAE,CAAG,CAAC,EAC3D,EAAI3D,EAAG,EAAE,EAAG,CACf,IAAIoG,EAAOb,EAAG,CAAC,EAAE,EACjB,GAAIO,EAAGM,CAAI,EAAIjC,EACX8B,GAAME,GAAO,GAAMJ,EAAMD,EAAGM,CAAI,GAChCN,EAAGM,CAAI,EAAIjC,MAGX,MACR,CAEA,IADA8B,IAAOC,EACAD,EAAK,GAAG,CACX,IAAII,EAAOd,EAAG,CAAC,EAAE,EACbO,EAAGO,CAAI,EAAIlC,EACX8B,GAAM,GAAM9B,EAAK2B,EAAGO,CAAI,IAAM,EAE9B,EAAE,CACV,CACA,KAAO,GAAK,GAAKJ,EAAI,EAAE,EAAG,CACtB,IAAIK,EAAOf,EAAG,CAAC,EAAE,EACbO,EAAGQ,CAAI,GAAKnC,IACZ,EAAE2B,EAAGQ,CAAI,EACT,EAAEL,EAEV,CACAF,EAAM5B,CACV,CACA,MAAO,CAAE,EAAG,IAAIhB,GAAG2C,CAAE,EAAG,EAAGC,CAAG,CAClC,EAEIC,GAAK,SAAU/F,EAAGoE,EAAGc,EAAG,CACxB,OAAOlF,EAAE,GAAK,GACR,KAAK,IAAI+F,GAAG/F,EAAE,EAAGoE,EAAGc,EAAI,CAAC,EAAGa,GAAG/F,EAAE,EAAGoE,EAAGc,EAAI,CAAC,CAAC,EAC5Cd,EAAEpE,EAAE,CAAC,EAAIkF,CACpB,EAEIoB,GAAK,SAAUC,EAAG,CAGlB,QAFIxG,EAAIwG,EAAE,OAEHxG,GAAK,CAACwG,EAAE,EAAExG,CAAC,GACd,CAKJ,QAJIyG,EAAK,IAAIrD,GAAI,EAAEpD,CAAC,EAEhB0G,EAAM,EAAGC,EAAMH,EAAE,CAAC,EAAGI,EAAM,EAC3BC,EAAI,SAAU3f,EAAG,CAAEuf,EAAGC,GAAK,EAAIxf,CAAG,EAC7BwC,EAAI,EAAGA,GAAKsW,EAAG,EAAEtW,EACtB,GAAI8c,EAAE9c,CAAC,GAAKid,GAAOjd,GAAKsW,EACpB,EAAE4G,MACD,CACD,GAAI,CAACD,GAAOC,EAAM,EAAG,CACjB,KAAOA,EAAM,IAAKA,GAAO,IACrBC,EAAE,KAAK,EACPD,EAAM,IACNC,EAAED,EAAM,GAAOA,EAAM,IAAO,EAAK,MAAUA,EAAM,GAAM,EAAK,KAAK,EACjEA,EAAM,EAEd,SACSA,EAAM,EAAG,CAEd,IADAC,EAAEF,CAAG,EAAG,EAAEC,EACHA,EAAM,EAAGA,GAAO,EACnBC,EAAE,IAAI,EACND,EAAM,IACNC,EAAID,EAAM,GAAM,EAAK,IAAI,EAAGA,EAAM,EAC1C,CACA,KAAOA,KACHC,EAAEF,CAAG,EACTC,EAAM,EACND,EAAMH,EAAE9c,CAAC,CACb,CAEJ,MAAO,CAAE,EAAG+c,EAAG,SAAS,EAAGC,CAAG,EAAG,EAAG1G,CAAC,CACzC,EAEI8G,GAAO,SAAUC,EAAIN,EAAI,CAEzB,QADIpC,EAAI,EACC,EAAI,EAAG,EAAIoC,EAAG,OAAQ,EAAE,EAC7BpC,GAAK0C,EAAG,CAAC,EAAIN,EAAG,CAAC,EACrB,OAAOpC,CACX,EAGI2C,GAAQ,SAAUC,EAAK/b,EAAKgc,EAAK,CAEjC,IAAIlH,EAAIkH,EAAI,OACRjgB,EAAI+d,GAAK9Z,EAAM,CAAC,EACpB+b,EAAIhgB,CAAC,EAAI+Y,EAAI,IACbiH,EAAIhgB,EAAI,CAAC,EAAI+Y,GAAK,EAClBiH,EAAIhgB,EAAI,CAAC,EAAIggB,EAAIhgB,CAAC,EAAI,IACtBggB,EAAIhgB,EAAI,CAAC,EAAIggB,EAAIhgB,EAAI,CAAC,EAAI,IAC1B,QAASyC,EAAI,EAAGA,EAAIsW,EAAG,EAAEtW,EACrBud,EAAIhgB,EAAIyC,EAAI,CAAC,EAAIwd,EAAIxd,CAAC,EAC1B,OAAQzC,EAAI,EAAI+Y,GAAK,CACzB,EAEImH,GAAO,SAAUD,EAAKD,EAAKG,EAAOC,EAAMC,EAAIC,EAAI7D,EAAI8D,EAAIC,EAAIC,EAAIxH,EAAG,CACnEgF,GAAM+B,EAAK/G,IAAKkH,CAAK,EACrB,EAAEE,EAAG,GAAG,EAMR,QALIrP,EAAKoN,GAAMiC,EAAI,EAAE,EAAGK,EAAM1P,EAAG,EAAG2P,EAAM3P,EAAG,EACzCD,EAAKqN,GAAMkC,EAAI,EAAE,EAAGM,EAAM7P,EAAG,EAAG8P,EAAM9P,EAAG,EACzCQ,EAAK+N,GAAGoB,CAAG,EAAGI,EAAOvP,EAAG,EAAGwP,EAAMxP,EAAG,EACpCyP,EAAK1B,GAAGsB,CAAG,EAAGK,EAAOD,EAAG,EAAGE,EAAMF,EAAG,EACpCG,EAAS,IAAIhF,GAAI,EAAE,EACd1Z,EAAI,EAAGA,EAAIqe,EAAK,OAAQ,EAAEre,EAC/B,EAAE0e,EAAOL,EAAKre,CAAC,EAAI,EAAE,EACzB,QAASA,EAAI,EAAGA,EAAIwe,EAAK,OAAQ,EAAExe,EAC/B,EAAE0e,EAAOF,EAAKxe,CAAC,EAAI,EAAE,EAGzB,QAFI2e,EAAKhD,GAAM+C,EAAQ,CAAC,EAAGE,EAAMD,EAAG,EAAGE,EAAOF,EAAG,EAC7CG,EAAO,GACJA,EAAO,GAAK,CAACF,EAAI9E,GAAKgF,EAAO,CAAC,CAAC,EAAG,EAAEA,EACvC,CACJ,IAAIC,EAAQf,EAAK,GAAM,EACnBgB,EAAQ5B,GAAKQ,EAAI1C,EAAG,EAAIkC,GAAKS,EAAI1C,EAAG,EAAInB,EACxCiF,EAAQ7B,GAAKQ,EAAIK,CAAG,EAAIb,GAAKS,EAAIM,CAAG,EAAInE,EAAK,GAAK,EAAI8E,EAAO1B,GAAKsB,EAAQE,CAAG,EAAI,EAAIF,EAAO,EAAE,EAAI,EAAIA,EAAO,EAAE,EAAI,EAAIA,EAAO,EAAE,EACpI,GAAIX,GAAM,GAAKgB,GAAQC,GAASD,GAAQE,EACpC,OAAO3B,GAAMC,EAAK/G,EAAGgH,EAAI,SAASO,EAAIA,EAAKC,CAAE,CAAC,EAClD,IAAIkB,EAAIC,EAAIC,EAAIC,EAEhB,GADA7D,GAAM+B,EAAK/G,EAAG,GAAKyI,EAAQD,EAAM,EAAGxI,GAAK,EACrCyI,EAAQD,EAAO,CACfE,EAAK3E,GAAK0D,EAAKC,EAAK,CAAC,EAAGiB,EAAKlB,EAAKmB,EAAK7E,GAAK4D,EAAKC,EAAK,CAAC,EAAGiB,EAAKlB,EAC/D,IAAImB,EAAM/E,GAAKqE,EAAKC,EAAM,CAAC,EAC3BrD,GAAM+B,EAAK/G,EAAG8H,EAAM,GAAG,EACvB9C,GAAM+B,EAAK/G,EAAI,EAAGiI,EAAM,CAAC,EACzBjD,GAAM+B,EAAK/G,EAAI,GAAIsI,EAAO,CAAC,EAC3BtI,GAAK,GACL,QAASxW,EAAI,EAAGA,EAAI8e,EAAM,EAAE9e,EACxBwb,GAAM+B,EAAK/G,EAAI,EAAIxW,EAAG4e,EAAI9E,GAAK9Z,CAAC,CAAC,CAAC,EACtCwW,GAAK,EAAIsI,EAET,QADIS,EAAO,CAAClB,EAAMG,CAAI,EACbgB,EAAK,EAAGA,EAAK,EAAG,EAAEA,EAEvB,QADIC,GAAOF,EAAKC,CAAE,EACTxf,EAAI,EAAGA,EAAIyf,GAAK,OAAQ,EAAEzf,EAAG,CAClC,IAAI8H,GAAM2X,GAAKzf,CAAC,EAAI,GACpBwb,GAAM+B,EAAK/G,EAAG8I,EAAIxX,EAAG,CAAC,EAAG0O,GAAKoI,EAAI9W,EAAG,EACjCA,GAAM,KACN0T,GAAM+B,EAAK/G,EAAIiJ,GAAKzf,CAAC,GAAK,EAAK,GAAG,EAAGwW,GAAKiJ,GAAKzf,CAAC,GAAK,GAC7D,CAER,MAEIkf,EAAK9D,GAAK+D,EAAKjE,GAAKkE,EAAK/D,GAAKgE,EAAKlE,GAEvC,QAASnb,EAAI,EAAGA,EAAI8d,EAAI,EAAE9d,EAAG,CACzB,IAAI0f,EAAM/B,EAAK3d,CAAC,EAChB,GAAI0f,EAAM,IAAK,CACX,IAAI5X,GAAO4X,GAAO,GAAM,GACxBhE,GAAQ6B,EAAK/G,EAAG0I,EAAGpX,GAAM,GAAG,CAAC,EAAG0O,GAAK2I,EAAGrX,GAAM,GAAG,EAC7CA,GAAM,IACN0T,GAAM+B,EAAK/G,EAAIkJ,GAAO,GAAM,EAAE,EAAGlJ,GAAKoD,GAAK9R,EAAG,GAClD,IAAI6X,GAAMD,EAAM,GAChBhE,GAAQ6B,EAAK/G,EAAG4I,EAAGO,EAAG,CAAC,EAAGnJ,GAAK6I,EAAGM,EAAG,EACjCA,GAAM,IACNjE,GAAQ6B,EAAK/G,EAAIkJ,GAAO,EAAK,IAAI,EAAGlJ,GAAKqD,GAAK8F,EAAG,EACzD,MAEIjE,GAAQ6B,EAAK/G,EAAG0I,EAAGQ,CAAG,CAAC,EAAGlJ,GAAK2I,EAAGO,CAAG,CAE7C,CACA,OAAAhE,GAAQ6B,EAAK/G,EAAG0I,EAAG,GAAG,CAAC,EAChB1I,EAAI2I,EAAG,GAAG,CACrB,EAEIS,GAAoB,IAAIjG,GAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,OAAO,CAAC,EAEvGmC,GAAmB,IAAIrC,GAAG,CAAC,EAE3BoG,GAAO,SAAUrC,EAAKsC,EAAKC,EAAMC,EAAKC,EAAMC,EAAI,CAChD,IAAI5J,EAAI4J,EAAG,GAAK1C,EAAI,OAChBjgB,EAAI,IAAIkc,GAAGuG,EAAM1J,EAAI,GAAK,EAAI,KAAK,KAAKA,EAAI,GAAI,GAAK2J,CAAI,EAEzD9C,EAAI5f,EAAE,SAASyiB,EAAKziB,EAAE,OAAS0iB,CAAI,EACnCE,EAAMD,EAAG,EACT1e,GAAO0e,EAAG,GAAK,GAAK,EACxB,GAAIJ,EAAK,CACDte,IACA2b,EAAE,CAAC,EAAI+C,EAAG,GAAK,GAenB,QAdIE,EAAMR,GAAIE,EAAM,CAAC,EACjBvJ,EAAI6J,GAAO,GAAItD,EAAIsD,EAAM,KACzBC,GAAS,GAAKN,GAAQ,EAEtBO,EAAOJ,EAAG,GAAK,IAAIxG,GAAI,KAAK,EAAG6G,EAAOL,EAAG,GAAK,IAAIxG,GAAI2G,EAAQ,CAAC,EAC/DG,EAAQ,KAAK,KAAKT,EAAO,CAAC,EAAGU,EAAQ,EAAID,EACzCE,EAAM,SAAU1gB,GAAG,CAAE,OAAQwd,EAAIxd,EAAC,EAAKwd,EAAIxd,GAAI,CAAC,GAAKwgB,EAAUhD,EAAIxd,GAAI,CAAC,GAAKygB,GAAUJ,CAAO,EAG9F1C,EAAO,IAAIhE,GAAI,IAAK,EAEpBiE,EAAK,IAAIlE,GAAI,GAAG,EAAGmE,EAAK,IAAInE,GAAI,EAAE,EAElCiH,EAAO,EAAG3G,EAAK,EAAGha,EAAIkgB,EAAG,GAAK,EAAGpC,EAAK,EAAG8C,EAAKV,EAAG,GAAK,EAAGnC,EAAK,EAC3D/d,EAAI,EAAIsW,EAAG,EAAEtW,EAAG,CAEnB,IAAI6gB,EAAKH,EAAI1gB,CAAC,EAEV8gB,EAAO9gB,EAAI,MAAO+gB,EAAQR,EAAKM,CAAE,EAKrC,GAJAP,EAAKQ,CAAI,EAAIC,EACbR,EAAKM,CAAE,EAAIC,EAGPF,GAAM5gB,EAAG,CAET,IAAIghB,EAAM1K,EAAItW,EACd,IAAK2gB,EAAO,KAAQ7C,EAAK,SAAWkD,EAAM,KAAO,CAACb,GAAM,CACpD3e,EAAMic,GAAKD,EAAKL,EAAG,EAAGQ,EAAMC,EAAIC,EAAI7D,EAAI8D,EAAIC,EAAI/d,EAAI+d,EAAIvc,CAAG,EAC3Dsc,EAAK6C,EAAO3G,EAAK,EAAG+D,EAAK/d,EACzB,QAASka,EAAI,EAAGA,EAAI,IAAK,EAAEA,EACvB0D,EAAG1D,CAAC,EAAI,EACZ,QAASA,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB2D,EAAG3D,CAAC,EAAI,CAChB,CAEA,IAAIS,EAAI,EAAGc,EAAI,EAAGwF,EAAOnE,EAAGoE,EAAMJ,EAAOC,EAAQ,MACjD,GAAIC,EAAM,GAAKH,GAAMH,EAAI1gB,EAAIkhB,CAAG,EAM5B,QALIC,EAAO,KAAK,IAAI5K,EAAGyK,CAAG,EAAI,EAC1BI,GAAO,KAAK,IAAI,MAAOphB,CAAC,EAGxBqhB,GAAK,KAAK,IAAI,IAAKL,CAAG,EACnBE,GAAOE,IAAQ,EAAEH,GAAQH,GAAQC,GAAO,CAC3C,GAAIvD,EAAIxd,EAAI2a,CAAC,GAAK6C,EAAIxd,EAAI2a,EAAIuG,CAAG,EAAG,CAEhC,QADII,EAAK,EACFA,EAAKD,IAAM7D,EAAIxd,EAAIshB,CAAE,GAAK9D,EAAIxd,EAAIshB,EAAKJ,CAAG,EAAG,EAAEI,EAClD,CACJ,GAAIA,EAAK3G,EAAG,CAGR,GAFAA,EAAI2G,EAAI7F,EAAIyF,EAERI,EAAKH,EACL,MAMJ,QAFII,GAAM,KAAK,IAAIL,EAAKI,EAAK,CAAC,EAC1BE,GAAK,EACAtH,EAAI,EAAGA,EAAIqH,GAAK,EAAErH,EAAG,CAC1B,IAAIuH,GAAKzhB,EAAIkhB,EAAMhH,EAAI,MACnBwH,GAAMpB,EAAKmB,EAAE,EACbjH,GAAKiH,GAAKC,GAAM,MAChBlH,GAAKgH,KACLA,GAAKhH,GAAIuG,EAAQU,GACzB,CACJ,CACJ,CAEAX,EAAOC,EAAOA,EAAQT,EAAKQ,CAAI,EAC/BI,GAAOJ,EAAOC,EAAQ,KAC1B,CAGJ,GAAItF,EAAG,CAGHkC,EAAKG,GAAI,EAAI,UAAa1D,GAAMO,CAAC,GAAK,GAAMN,GAAMoB,CAAC,EACnD,IAAIkG,GAAMvH,GAAMO,CAAC,EAAI,GAAIiH,GAAMvH,GAAMoB,CAAC,EAAI,GAC1CzB,GAAMJ,GAAK+H,EAAG,EAAI9H,GAAK+H,EAAG,EAC1B,EAAEhE,EAAG,IAAM+D,EAAG,EACd,EAAE9D,EAAG+D,EAAG,EACRhB,EAAK5gB,EAAI2a,EACT,EAAEgG,CACN,MAEIhD,EAAKG,GAAI,EAAIN,EAAIxd,CAAC,EAClB,EAAE4d,EAAGJ,EAAIxd,CAAC,CAAC,CAEnB,CACJ,CACA,IAAKA,EAAI,KAAK,IAAIA,EAAG4gB,CAAE,EAAG5gB,EAAIsW,EAAG,EAAEtW,EAC/B2d,EAAKG,GAAI,EAAIN,EAAIxd,CAAC,EAClB,EAAE4d,EAAGJ,EAAIxd,CAAC,CAAC,EAEfwB,EAAMic,GAAKD,EAAKL,EAAGgD,EAAKxC,EAAMC,EAAIC,EAAI7D,EAAI8D,EAAIC,EAAI/d,EAAI+d,EAAIvc,CAAG,EACxD2e,IACDD,EAAG,EAAK1e,EAAM,EAAK2b,EAAG3b,EAAM,EAAK,CAAC,GAAK,EAEvCA,GAAO,EACP0e,EAAG,EAAIK,EAAML,EAAG,EAAII,EAAMJ,EAAG,EAAIlgB,EAAGkgB,EAAG,EAAIU,EAEnD,KACK,CACD,QAAS5gB,EAAIkgB,EAAG,GAAK,EAAGlgB,EAAIsW,EAAI6J,EAAKngB,GAAK,MAAO,CAE7C,IAAIsP,GAAItP,EAAI,MACRsP,IAAKgH,IAEL6G,EAAG3b,EAAM,EAAK,CAAC,EAAI2e,EACnB7Q,GAAIgH,GAER9U,EAAM8b,GAAMH,EAAG3b,EAAM,EAAGgc,EAAI,SAASxd,EAAGsP,EAAC,CAAC,CAC9C,CACA4Q,EAAG,EAAI5J,CACX,CACA,OAAOiF,GAAIhe,EAAG,EAAGyiB,EAAM1E,GAAK9Z,CAAG,EAAIye,CAAI,CAC3C,EAEI4B,GAAsB,UAAY,CAElC,QADIjG,EAAI,IAAI,WAAW,GAAG,EACjB5b,EAAI,EAAGA,EAAI,IAAK,EAAEA,EAAG,CAE1B,QADI8c,EAAI9c,EAAGvC,EAAI,EACR,EAAEA,GACLqf,GAAMA,EAAI,GAAM,YAAeA,IAAM,EACzClB,EAAE5b,CAAC,EAAI8c,CACX,CACA,OAAOlB,CACX,EAAC,EAEGkG,GAAM,UAAY,CAClB,IAAIhF,EAAI,GACR,MAAO,CACH,EAAG,SAAUrB,EAAG,CAGZ,QADIsG,EAAKjF,EACA,EAAI,EAAG,EAAIrB,EAAE,OAAQ,EAAE,EAC5BsG,EAAKF,GAAME,EAAK,IAAOtG,EAAE,CAAC,CAAC,EAAKsG,IAAO,EAC3CjF,EAAIiF,CACR,EACA,EAAG,UAAY,CAAE,MAAO,CAACjF,CAAG,CACpC,CACA,EAyBIkF,GAAO,SAAUxE,EAAK4C,EAAKJ,EAAKC,EAAMC,EAAI,CAC1C,GAAI,CAACA,IACDA,EAAK,CAAE,EAAG,CAAC,EACPE,EAAI,YAAY,CAChB,IAAI6B,EAAO7B,EAAI,WAAW,SAAS,MAAM,EACrC8B,EAAS,IAAIzI,GAAGwI,EAAK,OAASzE,EAAI,MAAM,EAC5C0E,EAAO,IAAID,CAAI,EACfC,EAAO,IAAI1E,EAAKyE,EAAK,MAAM,EAC3BzE,EAAM0E,EACNhC,EAAG,EAAI+B,EAAK,MAChB,CAEJ,OAAOpC,GAAKrC,EAAK4C,EAAI,OAAS,KAAO,EAAIA,EAAI,MAAOA,EAAI,KAAO,KAAQF,EAAG,EAAI,KAAK,KAAK,KAAK,IAAI,EAAG,KAAK,IAAI,GAAI,KAAK,IAAI1C,EAAI,MAAM,CAAC,CAAC,EAAI,GAAG,EAAI,GAAO,GAAK4C,EAAI,IAAMJ,EAAKC,EAAMC,CAAE,CACxL,EAmJIiC,GAAS,SAAU1G,EAAGxB,EAAGzc,EAAG,CAC5B,KAAOA,EAAG,EAAEyc,EACRwB,EAAExB,CAAC,EAAIzc,EAAGA,KAAO,CACzB,EAEI4kB,GAAM,SAAUtF,EAAGvf,EAAG,CACtB,IAAI8kB,EAAK9kB,EAAE,SAIX,GAHAuf,EAAE,CAAC,EAAI,GAAIA,EAAE,CAAC,EAAI,IAAKA,EAAE,CAAC,EAAI,EAAGA,EAAE,CAAC,EAAIvf,EAAE,MAAQ,EAAI,EAAIA,EAAE,OAAS,EAAI,EAAI,EAAGuf,EAAE,CAAC,EAAI,EACnFvf,EAAE,OAAS,GACX4kB,GAAOrF,EAAG,EAAG,KAAK,MAAM,IAAI,KAAKvf,EAAE,OAAS,KAAK,IAAG,CAAE,EAAI,GAAI,CAAC,EAC/D8kB,EAAI,CACJvF,EAAE,CAAC,EAAI,EACP,QAAS,EAAI,EAAG,GAAKuF,EAAG,OAAQ,EAAE,EAC9BvF,EAAE,EAAI,EAAE,EAAIuF,EAAG,WAAW,CAAC,CACnC,CACJ,EAoBIC,GAAO,SAAU/kB,EAAG,CAAE,MAAO,KAAMA,EAAE,SAAWA,EAAE,SAAS,OAAS,EAAI,EAAI,EA+RzE,SAASglB,GAAShN,EAAMiN,EAAM,CAC5BA,IACDA,EAAO,CAAA,GACX,IAAI1F,EAAIgF,GAAG,EAAInH,EAAIpF,EAAK,OACxBuH,EAAE,EAAEvH,CAAI,EACR,IAAIkG,EAAIuG,GAAKzM,EAAMiN,EAAMF,GAAKE,CAAI,EAAG,CAAC,EAAG,EAAI/G,EAAE,OAC/C,OAAO2G,GAAI3G,EAAG+G,CAAI,EAAGL,GAAO1G,EAAG,EAAI,EAAGqB,EAAE,EAAC,CAAE,EAAGqF,GAAO1G,EAAG,EAAI,EAAGd,CAAC,EAAGc,CACvE,CAuWA,IAAIgH,GAAK,OAAO,aAAe,aAA6B,IAAI,YAE5DC,GAAK,OAAO,aAAe,aAA6B,IAAI,YAE5DC,GAAM,EACV,GAAI,CACAD,GAAG,OAAO5G,GAAI,CAAE,OAAQ,EAAI,CAAE,EAC9B6G,GAAM,CACV,OACO,EAAG,CAAE,CAwGL,SAASC,GAAQxlB,EAAKylB,EAAQ,CACrC,IAAA7iB,EAMI,GAAIyiB,GACA,OAAOA,GAAG,OAAOrlB,CAAG,EAKxB,QAJIud,EAAIvd,EAAI,OACR0lB,EAAK,IAAIrJ,GAAGrc,EAAI,QAAUA,EAAI,QAAU,EAAE,EAC1C2lB,EAAK,EACL5F,EAAI,SAAU3f,EAAG,CAAEslB,EAAGC,GAAI,EAAIvlB,CAAG,EAC5BwC,EAAI,EAAGA,EAAI2a,EAAG,EAAE3a,EAAG,CACxB,GAAI+iB,EAAK,EAAID,EAAG,OAAQ,CACpB,IAAIvM,EAAI,IAAIkD,GAAGsJ,EAAK,GAAMpI,EAAI3a,GAAM,EAAE,EACtCuW,EAAE,IAAIuM,CAAE,EACRA,EAAKvM,CACT,CACA,IAAIuG,EAAI1f,EAAI,WAAW4C,CAAC,EACpB8c,EAAI,KAAO+F,EACX1F,EAAEL,CAAC,EACEA,EAAI,MACTK,EAAE,IAAOL,GAAK,CAAE,EAAGK,EAAE,IAAOL,EAAI,EAAG,GAC9BA,EAAI,OAASA,EAAI,OACtBA,EAAI,OAASA,EAAI,SAAe1f,EAAI,WAAW,EAAE4C,CAAC,EAAI,KAClDmd,EAAE,IAAOL,GAAK,EAAG,EAAGK,EAAE,IAAQL,GAAK,GAAM,EAAG,EAAGK,EAAE,IAAQL,GAAK,EAAK,EAAG,EAAGK,EAAE,IAAOL,EAAI,EAAG,IAE7FK,EAAE,IAAOL,GAAK,EAAG,EAAGK,EAAE,IAAQL,GAAK,EAAK,EAAG,EAAGK,EAAE,IAAOL,EAAI,EAAG,EACtE,CACA,OAAOvB,GAAIuH,EAAI,EAAGC,CAAE,CACxB,CC5vDA,SAAsBC,GAAgBzP,EAAuC,QAAAI,EAAA,sBAC5E,MAAM7C,EAAM8R,GAAQ,KAAK,UAAUrP,CAAO,CAAC,EACrC0P,EAAaC,GAAapS,CAAG,EAE7BqS,EAAY,MAAM,IAAI,QAAiB,GAAM,CAClD,MAAM7S,EAAS,IAAI,WACnBA,EAAO,OAAS,IAAM,EAAEA,EAAO,MAAgB,EAC/CA,EAAO,cAAc,IAAI,KAAK,CAAC,IAAI,WAAW2S,CAAU,CAAC,CAAC,CAAC,CAC5D,CAAC,EAED,MAAO,CACN,iBAAkBE,EAAU,MAAMA,EAAU,QAAQ,GAAG,EAAI,CAAC,EAC5D,eAAgBF,EAAW,OAC3B,aAAcnS,EAAI,MAAA,CAEpB,GClBO,MAAMsS,EAAO,CAInB,YAAYC,EAAiBnb,EAAe,CAH5Cob,GAAA,cACAA,GAAA,aAGC,KAAK,MAAQD,EACb,KAAK,KAAOnb,CACb,CAEA,OAAOqN,EAAa,CACnB,GAAI,KAAK,MAAO,CACf,IAAIjV,EAAS,IAAI,KAAK,IAAA,CAAK,IACvB,KAAK,OACRA,GAAU,MAAM,KAAK,IAAI,IAE1B,QAAQ,IAAI,MAAM,QAAS,CAACA,EAAQ,GAAGiV,CAAI,CAAC,CAC7C,CACD,CAEA,QAAQA,EAAa,CACpB,IAAIjV,EAAS,IAAI,KAAK,IAAA,CAAK,IACvB,KAAK,OACRA,GAAU,MAAM,KAAK,IAAI,IAE1B,QAAQ,KAAK,MAAM,QAAS,CAACA,EAAQ,GAAGiV,CAAI,CAAC,CAC9C,CACD,CC6MO,IAAKgO,IAAAA,IACXA,EAAA,qBAAuB,uBADZA,IAAAA,IAAA,CAAA,CAAA,ECpOL,MAAMC,GAAkC,EAGlCC,GAAgB,IAChBC,GAAmB,IAG1BC,GAAuB,CAACJ,GAAiB,qBAAqB,UAAU,EAGxEK,GAAoBrR,GAAgC,OAIzD,QAHchE,EAAAgE,EAAM,SAAS,SAAf,YAAAhE,EAAuB,KAAMe,GAC1CqU,GAAqB,SAASrU,EAAE,OAAO,MAEvB,MAClB,EAEauU,GAA2B,IAAM,CAC7C,MAAMC,EAAwB,CAC7BC,EACA5V,EACA6V,EACApmB,EACAqmB,EAAkB,IACFtQ,EAAA,sBAChB,GAAI,CACH,OAAO,MAAMoQ,EAAA,CACd,OAASxR,EAAY,CACpB,GAAIA,aAAiB5D,IAAe,CAACiV,GAAiBrR,CAAK,EAC1D,MAAMA,EAGP,GAAI0R,EAAUT,GACb,aAAM,IAAI,QAASjT,GAClB,WACCA,EACAkT,GAAgBC,GAAmB,KAAK,IAAI,EAAGO,CAAO,CAAA,CACvD,EAEM,MAAMH,EACZC,EACA5V,EACA6V,EACApmB,EACAqmB,EAAU,CAAA,EAGZ,cAAQ,MACP,2CAA2CA,CAAO,UAAA,EAE7C1R,CACP,CACD,GACA,OAAOuR,CACR,ECzDaN,GAAkC,EAClCU,GAAsB,IACtBC,GAAyB,CAAC,SAAU,SAAU,SAAS,ECO7D,IAAKC,GAAAA,IACXA,EAAAA,EAAA,WAAA,CAAA,EAAA,aACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,aACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YAVWA,IAAAA,GAAA,CAAA,CAAA,ECmCZ,MAAMC,GAAwC,KAE9C,SAASC,GACRC,EACA3a,EACC,CACD,MAAM4a,EAAsB,CAAA,EACtBC,EAAsB,CAAA,EACtBC,EAAiB,CAAA,EACvB,SAAW,CAAC7c,EAAKvJ,CAAK,IAAK,OAAO,QAAQimB,CAAiB,EAAG,CAC7D,GAA2BjmB,GAAU,KACpC,SAGI6lB,GAAuB,SAAS,OAAO7lB,CAAK,GAChDmmB,EAAa,KAAK,CAAE,CAAC5c,CAAG,EAAGvJ,EAAO,EAEnC,IAAIqmB,EACA,OAAOrmB,GAAU,SACpBqmB,EAAWrmB,EAEXqmB,EAAW7O,GAAUxX,CAAK,EAEvBqmB,EAAS,OAAST,KACrBQ,EAAQ,KAAK,CAAE,CAAC7c,CAAG,EAAGvJ,EAAO,EAC7BqmB,EAAWA,EAAS,UAAU,EAAGT,EAAmB,GAGrDM,EAAe3c,CAAG,EAAI8c,CACvB,CAIA,OAAI/a,IAAS,YACR6a,EAAa,OAAS,GACzB,QAAQ,KACP,oCAAoC7a,CAAI,sDACxC6a,CAAA,EAIEC,EAAQ,OAAS,GACpB,QAAQ,KACP,oCAAoC9a,CAAI,kEACxC8a,CAAA,GAKIF,CACR,CAEA,CACC,IAAII,EACAC,EACAC,EACAC,EAAiC,EACjCC,EAAqC,EACrC3B,EAAiB,GACjB4B,EAA6B,EAC7BC,EAAS,IAAI9B,GAAO,GAAO,UAAU,EACzC,MAAM+B,EAQA,CAAA,EACAC,EAA4D,CAAA,EAE5DC,EAAoB,IAExBJ,IAAuB,GACvBF,EAAyBvB,IACzB,CAAC,EAACsB,GAAA,MAAAA,EAAiB,QAIfQ,EAAiB,CAAIrd,EAAasL,IAAe,CACtD8Q,GAAO,YAAY,CAClB,SAAU,CACT,KAAMD,EAAY,YAClB,IAAAnc,EACA,QAAAsL,CAAA,CACD,CACA,CACF,EAEMgS,EAAmCC,GAA4B7R,EAAA,sBACpE,KAAM,CACL,GAAA8R,EACA,OAAAC,EACA,SAAAC,EACA,OAAAC,EACA,gBAAAC,EACA,sBAAAC,EACA,mBAAAC,EACA,cAAAC,CAAA,EACGR,EAEES,EAAiBnQ,GAAU,CAAE,SAAA6P,EAAoB,EACvD,IAAIpS,EAAwC,CAC3C,kBAAmBuR,EACnB,WAAYW,EAAG,SAAA,EACf,OAAQ,CAAE,OAAAC,CAAA,EACV,SAAUO,EACV,UAAWJ,EACX,kBAAmBC,EACnB,OAAAF,EACA,UAAW,GACX,qBAAsBG,CAAA,EAEnBC,IACHzS,EAAQ,eAAiByS,GAG1B,KAAM,CAAE,iBAAAE,EAAkB,aAAAC,EAAc,eAAAC,GACvC,MAAMpD,GAAgBzP,CAAO,EAExB3E,EAAgC,CACrC,KAAMwV,EAAY,YAClB,GAAAqB,EACA,WAAYU,EACZ,eAAgBD,EAAiB,MAAA,EAGlChB,EAAO,IACN,oBAAoB,KAAK,UACxB,CACC,gBAAAJ,EACA,GAAAW,EACA,SAAU,KAAK,IACd,GAAIlS,EAAQ,OAAO,OACjB,IAAKjE,GAAMA,GAAA,YAAAA,EAAG,IAAI,EAClB,OAAQ+W,GAAQ,CAAC,CAACA,CAAG,CAAA,EAExB,aAAc9S,EAAQ,OAAO,OAAO,OACpC,eAAgBoS,EAAS,OACzB,gBAAiBE,EAAgB,OACjC,gBAAiBC,EAAsB,OACvC,aAAcF,EAAO,OACrB,UAAWO,EACX,iBAAkBC,EAClB,uBAAwBF,EAAiB,MAAA,EAE1C,OACA,CAAA,CACA,EAAA,EAGF,MAAMI,EAAc1B,EAAW,kBAAkB,CAChD,kBAAmBE,EACnB,WAAYW,EAAG,SAAA,EACf,KAAMS,CAAA,CACN,EAED,IAAIK,EAA4B,QAAQ,QAAA,EACpCpB,EAAe,SAClBoB,EAAc3B,EAAW,YAAY,CACpC,QAASO,CAAA,CACT,EAEDA,EAAe,OAAO,CAAC,GAGxB,IAAIqB,EAAuB,YAAY,IAAA,EACvC,MAAMC,EAAM,YAAY,IAAM,CAE5BD,GACA,YAAY,IAAA,EAAQA,EAAepQ,KAEnC,QAAQ,KACP,wDAAwD4O,CAA0B,GAAA,EAEnFA,GAA8B,EAC9B,cAAcyB,CAAG,EAGhBzB,GACAxB,KAEA,QAAQ,KACP,uEAAA,EAGDa,GAAO,YAAY,CAClB,SAAU,CACT,KAAMD,EAAY,KAClB,aAAAoC,EACA,oBAAqB5X,CAAA,CACtB,CACA,EAED8X,EAAyB,CACxB,KAAMtC,EAAY,WAClB,iBAAkB,CACjB,WAAY,sBAAA,EAEb,aAAc,CAAE,KAAM,OAAA,CAAQ,CAC9B,GAGJ,EAAG,GAAG,EACN,GAAI,CACH,MAAM,QAAQ,IAAI,CAACkC,EAAaC,CAAW,CAAC,EAE3CvB,GACA,YAAY,IAAA,EAAQwB,GAAgBpQ,KAEpC,QAAQ,KACP,gCAAgC4O,CAA0B,mCAAA,EAE3DA,EAA6B,EAE/B,QAAA,CACCwB,EAAe,EACf,cAAcC,CAAG,CAClB,CAEApC,GAAO,YAAY,CAClB,SAAAzV,CAAA,CACA,CACF,GAEM+X,EAAgCnB,GAAyB7R,EAAA,sBAC9D,KAAM,CAAE,WAAAiT,EAAY,eAAAC,EAAgB,OAAAnoB,CAAA,EAAW8mB,EAC3C9mB,IAAW,UACd4mB,EACC,mBACAxP,GAAUxJ,EAAA,CAAE,eAAAua,GAAmBD,EAAY,CAAA,EAG5CtB,EACC,WACAxP,GAAUxJ,EAAA,CAAE,eAAAua,GAAmBD,EAAY,CAAA,EAG7C,MAAMhC,EAAW,gBAAgB,CAChC,kBAAmBE,EACnB,gBAAiB+B,EACjB,YAAavC,GAAoBsC,EAAY,MAAM,CAAA,CACnD,EACD,MAAME,EAAepoB,IAAW,UAAYA,EAAS,UACrDwmB,EAAO,IACN,aAAa2B,CAAc,aAAaC,CAAY,aAAahR,GAChE8Q,CAAA,CACA,MAAM/B,CAAO,EAAA,CAEhB,GAEM6B,EAAkClB,GAA2B7R,EAAA,sBAClE,KAAM,CAAE,iBAAAoT,EAAkB,aAAAC,CAAA,EAAiBxB,EAC3C,IAAIyB,GACAD,GAAA,YAAAA,EAAc,QAAS,WAC1BC,EAAY,UAGZ,MAAMrC,EAAW,qBAAqB,CACrC,kBAAmBE,EACnB,kBAAmBR,GAClByC,EACA,SAAA,CACD,CACA,IAGGC,GAAA,YAAAA,EAAc,UAAW,UAC5BC,EAAY,UAEZA,EAAY,QAGVA,IAAc,WACjB3B,EAAuB2B,EAAWnR,GAAUiR,CAAgB,CAAC,EAE9D7B,EAAO,IACN,UAAU+B,CAAS,2BAA2BnC,CAAe,aAAa,KAAK,UAC9EiC,CAAA,CACA,MAAMlC,CAAO,EAAA,CAEhB,GAEMqC,EAA+B1B,GAAwB7R,EAAA,sBAC5DwR,EAAe,KACd,GAAGK,EAAI,QAAQ,IAAKvK,IAAO,CAC1B,KAAMA,EAAE,KACR,MAAOA,EAAE,MACT,kBAAmB6J,EACnB,SAAU7J,EAAE,SACZ,MAAOA,EAAE,MACT,UAAWA,EAAE,UAAU,YAAA,EACvB,KAAMA,EAAE,IAAA,EACP,CAAA,CAEJ,GAEMkM,EAAgC3B,GAAyB7R,EAAA,sBAC9D,KAAM,CAAE,UAAAyT,EAAW,SAAAC,EAAU,UAAAC,EAAW,SAAAC,GAAa/B,EACrD,MAAMZ,EAAW,mBAAmB,CACnC,kBAAmBE,EACnB,UAAAsC,EACA,SAAAC,EACA,WAAYC,EACZ,UAAWC,CAAA,CACX,CACF,GAEMC,EACLhC,GACI7R,EAAA,sBACA6R,EAAI,OAASpB,EAAY,YAC5B,MAAMmB,EAA0BC,CAAyB,EAC/CA,EAAI,OAASpB,EAAY,SACnC,MAAMuC,EAAuBnB,CAAsB,EACzCA,EAAI,OAASpB,EAAY,WACnC,MAAMsC,EAAyBlB,CAAwB,EAC7CA,EAAI,OAASpB,EAAY,QACnC,MAAM8C,EAAsB1B,CAAqB,EACvCA,EAAI,OAASpB,EAAY,WACnC,MAAM+C,EAAuB3B,CAAsB,EAErD,GAEMiC,EAAuB,IAAY9T,EAAA,sBACxC,KAAOyR,EAAgB,OAAS,GAAKC,EAAA,GAAqB,CACzD,MAAMG,EAAMJ,EAAgB,MAAA,EAC5B,GAAI,CACH,MAAMoC,EAAehC,CAAG,EACxBT,EAAyB,CAC1B,OAASzV,EAAG,CACP+T,GACH,QAAQ,MAAM/T,CAAC,EAEhByV,GAA0B,CAC3B,CACD,CACD,GAEAV,GAAO,UAAY,SAAgB/U,EAAG,QAAAqE,EAAA,sBACrC,GAAIrE,EAAE,KAAK,QAAQ,OAAS8U,EAAY,WAAY,CACnDS,EAAUvV,EAAE,KAAK,QAAQ,QACzBwV,EAAkBxV,EAAE,KAAK,QAAQ,gBACjC+T,EAAQ/T,EAAE,KAAK,QAAQ,MACvB2V,EAAqB3V,EAAE,KAAK,QAAQ,mBACpC4V,EAAO,MAAQ7B,EACfuB,EAAavL,GACZ,IAAI9E,GAAcsQ,EAAS,CAC1B,QAAS,CAAA,CAAC,CACV,EACDhB,GAAA,CAAyB,EAG1B,MAAM4D,EAAA,EACN,MACD,CAIA,GAAInY,EAAE,KAAK,QAAQ,OAAS8U,EAAY,MAAO,CAC9CgB,EAAgB,OAAS,EACzBD,EAAe,OAAS,EACxBJ,EAAyB,EACzBC,EAA6B,EAI7BF,EAAkB,GAClBG,EAAqB,EACrB,MACD,CAGA,GAAI3V,EAAE,KAAK,QAAQ,OAAS8U,EAAY,UAAW,CAClDC,GAAO,YAAY,CAClB,SAAU,CACT,KAAMD,EAAY,UAClB,aAAcgB,EAAgB,OAC9B,YAAaC,EAAA,CAAkB,CAChC,CACA,EACD,MACD,CAEA,GAAI,CAACA,IAAqB,CACzBD,EAAgB,KAAK9V,EAAE,KAAK,OAAO,EACnC,MACD,CAEA,GAAI,CACH,MAAMkY,EAAelY,EAAE,KAAK,OAAO,EACnCyV,EAAyB,EACzB,MAAM0C,EAAA,CACP,OAASnY,EAAG,CACP+T,GACH,QAAQ,MAAM/T,CAAC,EAEhByV,GAA0B,CAC3B,CACD,GACD","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,30,31,33]}