@powerhousedao/powerhouse-vetra-packages 6.2.0-dev.3 → 6.2.0-dev.4

package/dist/node/document-drive-BK2-EDni.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-drive-BK2-EDni.mjs","names":["stringify","cjsModule","stringify","isDefinedNonNullAny","definedNonNullAnySchema","z.any","z.enum","z.string","z.union","z.object","z.lazy","z.number","z.unknown","z.literal","z.array","z.boolean","stringify","isStateOfType","assertIsStateOfType","isDocumentOfType","assertIsDocumentOfType","#tags","#tagString","#level","#includeStack","z.any","z.enum","z.object","z.string","z.literal","z.boolean","z.array","z.union","createState$1"],"sources":["../../../../node_modules/.pnpm/safe-stable-stringify@2.5.0/node_modules/safe-stable-stringify/index.js","../../../../node_modules/.pnpm/safe-stable-stringify@2.5.0/node_modules/safe-stable-stringify/esm/wrapper.js","../../../../node_modules/.pnpm/sha1-uint8array@0.10.7/node_modules/sha1-uint8array/dist/sha1-uint8array.mjs","../../../shared/dist/utils-DKOFCM0Q.js","../../../../node_modules/.pnpm/fflate@0.8.2/node_modules/fflate/esm/index.mjs","../../../../node_modules/.pnpm/mutative@1.3.0/node_modules/mutative/dist/mutative.esm.mjs","../../../shared/dist/document-model/index.js","../../../document-model/dist/index.js","../../../shared/dist/document-drive/index.js"],"sourcesContent":["'use strict'\n\nconst { hasOwnProperty } = Object.prototype\n\nconst stringify = configure()\n\n// @ts-expect-error\nstringify.configure = configure\n// @ts-expect-error\nstringify.stringify = stringify\n\n// @ts-expect-error\nstringify.default = stringify\n\n// @ts-expect-error used for named export\nexports.stringify = stringify\n// @ts-expect-error used for named export\nexports.configure = configure\n\nmodule.exports = stringify\n\n// eslint-disable-next-line no-control-regex\nconst strEscapeSequencesRegExp = /[\\u0000-\\u001f\\u0022\\u005c\\ud800-\\udfff]/\n\n// Escape C0 control characters, double quotes, the backslash and every code\n// unit with a numeric value in the inclusive range 0xD800 to 0xDFFF.\nfunction strEscape (str) {\n  // Some magic numbers that worked out fine while benchmarking with v8 8.0\n  if (str.length < 5000 && !strEscapeSequencesRegExp.test(str)) {\n    return `\"${str}\"`\n  }\n  return JSON.stringify(str)\n}\n\nfunction sort (array, comparator) {\n  // Insertion sort is very efficient for small input sizes, but it has a bad\n  // worst case complexity. Thus, use native array sort for bigger values.\n  if (array.length > 2e2 || comparator) {\n    return array.sort(comparator)\n  }\n  for (let i = 1; i < array.length; i++) {\n    const currentValue = array[i]\n    let position = i\n    while (position !== 0 && array[position - 1] > currentValue) {\n      array[position] = array[position - 1]\n      position--\n    }\n    array[position] = currentValue\n  }\n  return array\n}\n\nconst typedArrayPrototypeGetSymbolToStringTag =\n  Object.getOwnPropertyDescriptor(\n    Object.getPrototypeOf(\n      Object.getPrototypeOf(\n        new Int8Array()\n      )\n    ),\n    Symbol.toStringTag\n  ).get\n\nfunction isTypedArrayWithEntries (value) {\n  return typedArrayPrototypeGetSymbolToStringTag.call(value) !== undefined && value.length !== 0\n}\n\nfunction stringifyTypedArray (array, separator, maximumBreadth) {\n  if (array.length < maximumBreadth) {\n    maximumBreadth = array.length\n  }\n  const whitespace = separator === ',' ? '' : ' '\n  let res = `\"0\":${whitespace}${array[0]}`\n  for (let i = 1; i < maximumBreadth; i++) {\n    res += `${separator}\"${i}\":${whitespace}${array[i]}`\n  }\n  return res\n}\n\nfunction getCircularValueOption (options) {\n  if (hasOwnProperty.call(options, 'circularValue')) {\n    const circularValue = options.circularValue\n    if (typeof circularValue === 'string') {\n      return `\"${circularValue}\"`\n    }\n    if (circularValue == null) {\n      return circularValue\n    }\n    if (circularValue === Error || circularValue === TypeError) {\n      return {\n        toString () {\n          throw new TypeError('Converting circular structure to JSON')\n        }\n      }\n    }\n    throw new TypeError('The \"circularValue\" argument must be of type string or the value null or undefined')\n  }\n  return '\"[Circular]\"'\n}\n\nfunction getDeterministicOption (options) {\n  let value\n  if (hasOwnProperty.call(options, 'deterministic')) {\n    value = options.deterministic\n    if (typeof value !== 'boolean' && typeof value !== 'function') {\n      throw new TypeError('The \"deterministic\" argument must be of type boolean or comparator function')\n    }\n  }\n  return value === undefined ? true : value\n}\n\nfunction getBooleanOption (options, key) {\n  let value\n  if (hasOwnProperty.call(options, key)) {\n    value = options[key]\n    if (typeof value !== 'boolean') {\n      throw new TypeError(`The \"${key}\" argument must be of type boolean`)\n    }\n  }\n  return value === undefined ? true : value\n}\n\nfunction getPositiveIntegerOption (options, key) {\n  let value\n  if (hasOwnProperty.call(options, key)) {\n    value = options[key]\n    if (typeof value !== 'number') {\n      throw new TypeError(`The \"${key}\" argument must be of type number`)\n    }\n    if (!Number.isInteger(value)) {\n      throw new TypeError(`The \"${key}\" argument must be an integer`)\n    }\n    if (value < 1) {\n      throw new RangeError(`The \"${key}\" argument must be >= 1`)\n    }\n  }\n  return value === undefined ? Infinity : value\n}\n\nfunction getItemCount (number) {\n  if (number === 1) {\n    return '1 item'\n  }\n  return `${number} items`\n}\n\nfunction getUniqueReplacerSet (replacerArray) {\n  const replacerSet = new Set()\n  for (const value of replacerArray) {\n    if (typeof value === 'string' || typeof value === 'number') {\n      replacerSet.add(String(value))\n    }\n  }\n  return replacerSet\n}\n\nfunction getStrictOption (options) {\n  if (hasOwnProperty.call(options, 'strict')) {\n    const value = options.strict\n    if (typeof value !== 'boolean') {\n      throw new TypeError('The \"strict\" argument must be of type boolean')\n    }\n    if (value) {\n      return (value) => {\n        let message = `Object can not safely be stringified. Received type ${typeof value}`\n        if (typeof value !== 'function') message += ` (${value.toString()})`\n        throw new Error(message)\n      }\n    }\n  }\n}\n\nfunction configure (options) {\n  options = { ...options }\n  const fail = getStrictOption(options)\n  if (fail) {\n    if (options.bigint === undefined) {\n      options.bigint = false\n    }\n    if (!('circularValue' in options)) {\n      options.circularValue = Error\n    }\n  }\n  const circularValue = getCircularValueOption(options)\n  const bigint = getBooleanOption(options, 'bigint')\n  const deterministic = getDeterministicOption(options)\n  const comparator = typeof deterministic === 'function' ? deterministic : undefined\n  const maximumDepth = getPositiveIntegerOption(options, 'maximumDepth')\n  const maximumBreadth = getPositiveIntegerOption(options, 'maximumBreadth')\n\n  function stringifyFnReplacer (key, parent, stack, replacer, spacer, indentation) {\n    let value = parent[key]\n\n    if (typeof value === 'object' && value !== null && typeof value.toJSON === 'function') {\n      value = value.toJSON(key)\n    }\n    value = replacer.call(parent, key, value)\n\n    switch (typeof value) {\n      case 'string':\n        return strEscape(value)\n      case 'object': {\n        if (value === null) {\n          return 'null'\n        }\n        if (stack.indexOf(value) !== -1) {\n          return circularValue\n        }\n\n        let res = ''\n        let join = ','\n        const originalIndentation = indentation\n\n        if (Array.isArray(value)) {\n          if (value.length === 0) {\n            return '[]'\n          }\n          if (maximumDepth < stack.length + 1) {\n            return '\"[Array]\"'\n          }\n          stack.push(value)\n          if (spacer !== '') {\n            indentation += spacer\n            res += `\\n${indentation}`\n            join = `,\\n${indentation}`\n          }\n          const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n          let i = 0\n          for (; i < maximumValuesToStringify - 1; i++) {\n            const tmp = stringifyFnReplacer(String(i), value, stack, replacer, spacer, indentation)\n            res += tmp !== undefined ? tmp : 'null'\n            res += join\n          }\n          const tmp = stringifyFnReplacer(String(i), value, stack, replacer, spacer, indentation)\n          res += tmp !== undefined ? tmp : 'null'\n          if (value.length - 1 > maximumBreadth) {\n            const removedKeys = value.length - maximumBreadth - 1\n            res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n          }\n          if (spacer !== '') {\n            res += `\\n${originalIndentation}`\n          }\n          stack.pop()\n          return `[${res}]`\n        }\n\n        let keys = Object.keys(value)\n        const keyLength = keys.length\n        if (keyLength === 0) {\n          return '{}'\n        }\n        if (maximumDepth < stack.length + 1) {\n          return '\"[Object]\"'\n        }\n        let whitespace = ''\n        let separator = ''\n        if (spacer !== '') {\n          indentation += spacer\n          join = `,\\n${indentation}`\n          whitespace = ' '\n        }\n        const maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n        if (deterministic && !isTypedArrayWithEntries(value)) {\n          keys = sort(keys, comparator)\n        }\n        stack.push(value)\n        for (let i = 0; i < maximumPropertiesToStringify; i++) {\n          const key = keys[i]\n          const tmp = stringifyFnReplacer(key, value, stack, replacer, spacer, indentation)\n          if (tmp !== undefined) {\n            res += `${separator}${strEscape(key)}:${whitespace}${tmp}`\n            separator = join\n          }\n        }\n        if (keyLength > maximumBreadth) {\n          const removedKeys = keyLength - maximumBreadth\n          res += `${separator}\"...\":${whitespace}\"${getItemCount(removedKeys)} not stringified\"`\n          separator = join\n        }\n        if (spacer !== '' && separator.length > 1) {\n          res = `\\n${indentation}${res}\\n${originalIndentation}`\n        }\n        stack.pop()\n        return `{${res}}`\n      }\n      case 'number':\n        return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n      case 'boolean':\n        return value === true ? 'true' : 'false'\n      case 'undefined':\n        return undefined\n      case 'bigint':\n        if (bigint) {\n          return String(value)\n        }\n        // fallthrough\n      default:\n        return fail ? fail(value) : undefined\n    }\n  }\n\n  function stringifyArrayReplacer (key, value, stack, replacer, spacer, indentation) {\n    if (typeof value === 'object' && value !== null && typeof value.toJSON === 'function') {\n      value = value.toJSON(key)\n    }\n\n    switch (typeof value) {\n      case 'string':\n        return strEscape(value)\n      case 'object': {\n        if (value === null) {\n          return 'null'\n        }\n        if (stack.indexOf(value) !== -1) {\n          return circularValue\n        }\n\n        const originalIndentation = indentation\n        let res = ''\n        let join = ','\n\n        if (Array.isArray(value)) {\n          if (value.length === 0) {\n            return '[]'\n          }\n          if (maximumDepth < stack.length + 1) {\n            return '\"[Array]\"'\n          }\n          stack.push(value)\n          if (spacer !== '') {\n            indentation += spacer\n            res += `\\n${indentation}`\n            join = `,\\n${indentation}`\n          }\n          const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n          let i = 0\n          for (; i < maximumValuesToStringify - 1; i++) {\n            const tmp = stringifyArrayReplacer(String(i), value[i], stack, replacer, spacer, indentation)\n            res += tmp !== undefined ? tmp : 'null'\n            res += join\n          }\n          const tmp = stringifyArrayReplacer(String(i), value[i], stack, replacer, spacer, indentation)\n          res += tmp !== undefined ? tmp : 'null'\n          if (value.length - 1 > maximumBreadth) {\n            const removedKeys = value.length - maximumBreadth - 1\n            res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n          }\n          if (spacer !== '') {\n            res += `\\n${originalIndentation}`\n          }\n          stack.pop()\n          return `[${res}]`\n        }\n        stack.push(value)\n        let whitespace = ''\n        if (spacer !== '') {\n          indentation += spacer\n          join = `,\\n${indentation}`\n          whitespace = ' '\n        }\n        let separator = ''\n        for (const key of replacer) {\n          const tmp = stringifyArrayReplacer(key, value[key], stack, replacer, spacer, indentation)\n          if (tmp !== undefined) {\n            res += `${separator}${strEscape(key)}:${whitespace}${tmp}`\n            separator = join\n          }\n        }\n        if (spacer !== '' && separator.length > 1) {\n          res = `\\n${indentation}${res}\\n${originalIndentation}`\n        }\n        stack.pop()\n        return `{${res}}`\n      }\n      case 'number':\n        return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n      case 'boolean':\n        return value === true ? 'true' : 'false'\n      case 'undefined':\n        return undefined\n      case 'bigint':\n        if (bigint) {\n          return String(value)\n        }\n        // fallthrough\n      default:\n        return fail ? fail(value) : undefined\n    }\n  }\n\n  function stringifyIndent (key, value, stack, spacer, indentation) {\n    switch (typeof value) {\n      case 'string':\n        return strEscape(value)\n      case 'object': {\n        if (value === null) {\n          return 'null'\n        }\n        if (typeof value.toJSON === 'function') {\n          value = value.toJSON(key)\n          // Prevent calling `toJSON` again.\n          if (typeof value !== 'object') {\n            return stringifyIndent(key, value, stack, spacer, indentation)\n          }\n          if (value === null) {\n            return 'null'\n          }\n        }\n        if (stack.indexOf(value) !== -1) {\n          return circularValue\n        }\n        const originalIndentation = indentation\n\n        if (Array.isArray(value)) {\n          if (value.length === 0) {\n            return '[]'\n          }\n          if (maximumDepth < stack.length + 1) {\n            return '\"[Array]\"'\n          }\n          stack.push(value)\n          indentation += spacer\n          let res = `\\n${indentation}`\n          const join = `,\\n${indentation}`\n          const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n          let i = 0\n          for (; i < maximumValuesToStringify - 1; i++) {\n            const tmp = stringifyIndent(String(i), value[i], stack, spacer, indentation)\n            res += tmp !== undefined ? tmp : 'null'\n            res += join\n          }\n          const tmp = stringifyIndent(String(i), value[i], stack, spacer, indentation)\n          res += tmp !== undefined ? tmp : 'null'\n          if (value.length - 1 > maximumBreadth) {\n            const removedKeys = value.length - maximumBreadth - 1\n            res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n          }\n          res += `\\n${originalIndentation}`\n          stack.pop()\n          return `[${res}]`\n        }\n\n        let keys = Object.keys(value)\n        const keyLength = keys.length\n        if (keyLength === 0) {\n          return '{}'\n        }\n        if (maximumDepth < stack.length + 1) {\n          return '\"[Object]\"'\n        }\n        indentation += spacer\n        const join = `,\\n${indentation}`\n        let res = ''\n        let separator = ''\n        let maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n        if (isTypedArrayWithEntries(value)) {\n          res += stringifyTypedArray(value, join, maximumBreadth)\n          keys = keys.slice(value.length)\n          maximumPropertiesToStringify -= value.length\n          separator = join\n        }\n        if (deterministic) {\n          keys = sort(keys, comparator)\n        }\n        stack.push(value)\n        for (let i = 0; i < maximumPropertiesToStringify; i++) {\n          const key = keys[i]\n          const tmp = stringifyIndent(key, value[key], stack, spacer, indentation)\n          if (tmp !== undefined) {\n            res += `${separator}${strEscape(key)}: ${tmp}`\n            separator = join\n          }\n        }\n        if (keyLength > maximumBreadth) {\n          const removedKeys = keyLength - maximumBreadth\n          res += `${separator}\"...\": \"${getItemCount(removedKeys)} not stringified\"`\n          separator = join\n        }\n        if (separator !== '') {\n          res = `\\n${indentation}${res}\\n${originalIndentation}`\n        }\n        stack.pop()\n        return `{${res}}`\n      }\n      case 'number':\n        return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n      case 'boolean':\n        return value === true ? 'true' : 'false'\n      case 'undefined':\n        return undefined\n      case 'bigint':\n        if (bigint) {\n          return String(value)\n        }\n        // fallthrough\n      default:\n        return fail ? fail(value) : undefined\n    }\n  }\n\n  function stringifySimple (key, value, stack) {\n    switch (typeof value) {\n      case 'string':\n        return strEscape(value)\n      case 'object': {\n        if (value === null) {\n          return 'null'\n        }\n        if (typeof value.toJSON === 'function') {\n          value = value.toJSON(key)\n          // Prevent calling `toJSON` again\n          if (typeof value !== 'object') {\n            return stringifySimple(key, value, stack)\n          }\n          if (value === null) {\n            return 'null'\n          }\n        }\n        if (stack.indexOf(value) !== -1) {\n          return circularValue\n        }\n\n        let res = ''\n\n        const hasLength = value.length !== undefined\n        if (hasLength && Array.isArray(value)) {\n          if (value.length === 0) {\n            return '[]'\n          }\n          if (maximumDepth < stack.length + 1) {\n            return '\"[Array]\"'\n          }\n          stack.push(value)\n          const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n          let i = 0\n          for (; i < maximumValuesToStringify - 1; i++) {\n            const tmp = stringifySimple(String(i), value[i], stack)\n            res += tmp !== undefined ? tmp : 'null'\n            res += ','\n          }\n          const tmp = stringifySimple(String(i), value[i], stack)\n          res += tmp !== undefined ? tmp : 'null'\n          if (value.length - 1 > maximumBreadth) {\n            const removedKeys = value.length - maximumBreadth - 1\n            res += `,\"... ${getItemCount(removedKeys)} not stringified\"`\n          }\n          stack.pop()\n          return `[${res}]`\n        }\n\n        let keys = Object.keys(value)\n        const keyLength = keys.length\n        if (keyLength === 0) {\n          return '{}'\n        }\n        if (maximumDepth < stack.length + 1) {\n          return '\"[Object]\"'\n        }\n        let separator = ''\n        let maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n        if (hasLength && isTypedArrayWithEntries(value)) {\n          res += stringifyTypedArray(value, ',', maximumBreadth)\n          keys = keys.slice(value.length)\n          maximumPropertiesToStringify -= value.length\n          separator = ','\n        }\n        if (deterministic) {\n          keys = sort(keys, comparator)\n        }\n        stack.push(value)\n        for (let i = 0; i < maximumPropertiesToStringify; i++) {\n          const key = keys[i]\n          const tmp = stringifySimple(key, value[key], stack)\n          if (tmp !== undefined) {\n            res += `${separator}${strEscape(key)}:${tmp}`\n            separator = ','\n          }\n        }\n        if (keyLength > maximumBreadth) {\n          const removedKeys = keyLength - maximumBreadth\n          res += `${separator}\"...\":\"${getItemCount(removedKeys)} not stringified\"`\n        }\n        stack.pop()\n        return `{${res}}`\n      }\n      case 'number':\n        return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n      case 'boolean':\n        return value === true ? 'true' : 'false'\n      case 'undefined':\n        return undefined\n      case 'bigint':\n        if (bigint) {\n          return String(value)\n        }\n        // fallthrough\n      default:\n        return fail ? fail(value) : undefined\n    }\n  }\n\n  function stringify (value, replacer, space) {\n    if (arguments.length > 1) {\n      let spacer = ''\n      if (typeof space === 'number') {\n        spacer = ' '.repeat(Math.min(space, 10))\n      } else if (typeof space === 'string') {\n        spacer = space.slice(0, 10)\n      }\n      if (replacer != null) {\n        if (typeof replacer === 'function') {\n          return stringifyFnReplacer('', { '': value }, [], replacer, spacer, '')\n        }\n        if (Array.isArray(replacer)) {\n          return stringifyArrayReplacer('', value, [], getUniqueReplacerSet(replacer), spacer, '')\n        }\n      }\n      if (spacer.length !== 0) {\n        return stringifyIndent('', value, [], spacer, '')\n      }\n    }\n    return stringifySimple('', value, [])\n  }\n\n  return stringify\n}\n","import cjsModule from '../index.js'\n\nexport const configure = cjsModule.configure\n\nexport const stringify = cjsModule\nexport default cjsModule\n","/**\n * sha1-uint8array.ts\n */\nconst K = [\n    0x5a827999 | 0,\n    0x6ed9eba1 | 0,\n    0x8f1bbcdc | 0,\n    0xca62c1d6 | 0,\n];\nconst algorithms = {\n    sha1: 1,\n};\nexport function createHash(algorithm) {\n    if (algorithm && !algorithms[algorithm] && !algorithms[algorithm.toLowerCase()]) {\n        throw new Error(\"Digest method not supported\");\n    }\n    return new Hash();\n}\nclass Hash {\n    constructor() {\n        this.A = 0x67452301 | 0;\n        this.B = 0xefcdab89 | 0;\n        this.C = 0x98badcfe | 0;\n        this.D = 0x10325476 | 0;\n        this.E = 0xc3d2e1f0 | 0;\n        this._size = 0;\n        this._sp = 0; // surrogate pair\n        if (!sharedBuffer || sharedOffset >= 8000 /* N.allocTotal */) {\n            sharedBuffer = new ArrayBuffer(8000 /* N.allocTotal */);\n            sharedOffset = 0;\n        }\n        this._byte = new Uint8Array(sharedBuffer, sharedOffset, 80 /* N.allocBytes */);\n        this._word = new Int32Array(sharedBuffer, sharedOffset, 20 /* N.allocWords */);\n        sharedOffset += 80 /* N.allocBytes */;\n    }\n    update(data) {\n        // data: string\n        if (\"string\" === typeof data) {\n            return this._utf8(data);\n        }\n        // data: undefined\n        if (data == null) {\n            throw new TypeError(\"Invalid type: \" + typeof data);\n        }\n        const byteOffset = data.byteOffset;\n        const length = data.byteLength;\n        let blocks = (length / 64 /* N.inputBytes */) | 0;\n        let offset = 0;\n        // longer than 1 block\n        if (blocks && !(byteOffset & 3) && !(this._size % 64 /* N.inputBytes */)) {\n            const block = new Int32Array(data.buffer, byteOffset, blocks * 16 /* N.inputWords */);\n            while (blocks--) {\n                this._int32(block, offset >> 2);\n                offset += 64 /* N.inputBytes */;\n            }\n            this._size += offset;\n        }\n        // data: TypedArray | DataView\n        const BYTES_PER_ELEMENT = data.BYTES_PER_ELEMENT;\n        if (BYTES_PER_ELEMENT !== 1 && data.buffer) {\n            const rest = new Uint8Array(data.buffer, byteOffset + offset, length - offset);\n            return this._uint8(rest);\n        }\n        // no more bytes\n        if (offset === length)\n            return this;\n        // data: Uint8Array | Int8Array\n        return this._uint8(data, offset);\n    }\n    _uint8(data, offset) {\n        const { _byte, _word } = this;\n        const length = data.length;\n        offset = offset | 0;\n        while (offset < length) {\n            const start = this._size % 64 /* N.inputBytes */;\n            let index = start;\n            while (offset < length && index < 64 /* N.inputBytes */) {\n                _byte[index++] = data[offset++];\n            }\n            if (index >= 64 /* N.inputBytes */) {\n                this._int32(_word);\n            }\n            this._size += index - start;\n        }\n        return this;\n    }\n    _utf8(text) {\n        const { _byte, _word } = this;\n        const length = text.length;\n        let surrogate = this._sp;\n        for (let offset = 0; offset < length;) {\n            const start = this._size % 64 /* N.inputBytes */;\n            let index = start;\n            while (offset < length && index < 64 /* N.inputBytes */) {\n                let code = text.charCodeAt(offset++) | 0;\n                if (code < 0x80) {\n                    // ASCII characters\n                    _byte[index++] = code;\n                }\n                else if (code < 0x800) {\n                    // 2 bytes\n                    _byte[index++] = 0xC0 | (code >>> 6);\n                    _byte[index++] = 0x80 | (code & 0x3F);\n                }\n                else if (code < 0xD800 || code > 0xDFFF) {\n                    // 3 bytes\n                    _byte[index++] = 0xE0 | (code >>> 12);\n                    _byte[index++] = 0x80 | ((code >>> 6) & 0x3F);\n                    _byte[index++] = 0x80 | (code & 0x3F);\n                }\n                else if (surrogate) {\n                    // 4 bytes - surrogate pair\n                    code = ((surrogate & 0x3FF) << 10) + (code & 0x3FF) + 0x10000;\n                    _byte[index++] = 0xF0 | (code >>> 18);\n                    _byte[index++] = 0x80 | ((code >>> 12) & 0x3F);\n                    _byte[index++] = 0x80 | ((code >>> 6) & 0x3F);\n                    _byte[index++] = 0x80 | (code & 0x3F);\n                    surrogate = 0;\n                }\n                else {\n                    surrogate = code;\n                }\n            }\n            if (index >= 64 /* N.inputBytes */) {\n                this._int32(_word);\n                _word[0] = _word[16 /* N.inputWords */];\n            }\n            this._size += index - start;\n        }\n        this._sp = surrogate;\n        return this;\n    }\n    _int32(data, offset) {\n        let { A, B, C, D, E } = this;\n        let i = 0;\n        offset = offset | 0;\n        while (i < 16 /* N.inputWords */) {\n            W[i++] = swap32(data[offset++]);\n        }\n        for (i = 16 /* N.inputWords */; i < 80 /* N.workWords */; i++) {\n            W[i] = rotate1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]);\n        }\n        for (i = 0; i < 80 /* N.workWords */; i++) {\n            const S = (i / 20) | 0;\n            const T = (rotate5(A) + ft(S, B, C, D) + E + W[i] + K[S]) | 0;\n            E = D;\n            D = C;\n            C = rotate30(B);\n            B = A;\n            A = T;\n        }\n        this.A = (A + this.A) | 0;\n        this.B = (B + this.B) | 0;\n        this.C = (C + this.C) | 0;\n        this.D = (D + this.D) | 0;\n        this.E = (E + this.E) | 0;\n    }\n    digest(encoding) {\n        const { _byte, _word } = this;\n        let i = (this._size % 64 /* N.inputBytes */) | 0;\n        _byte[i++] = 0x80;\n        // pad 0 for current word\n        while (i & 3) {\n            _byte[i++] = 0;\n        }\n        i >>= 2;\n        if (i > 14 /* N.highIndex */) {\n            while (i < 16 /* N.inputWords */) {\n                _word[i++] = 0;\n            }\n            i = 0;\n            this._int32(_word);\n        }\n        // pad 0 for rest words\n        while (i < 16 /* N.inputWords */) {\n            _word[i++] = 0;\n        }\n        // input size\n        const bits64 = this._size * 8;\n        const low32 = (bits64 & 0xffffffff) >>> 0;\n        const high32 = (bits64 - low32) / 0x100000000;\n        if (high32)\n            _word[14 /* N.highIndex */] = swap32(high32);\n        if (low32)\n            _word[15 /* N.lowIndex */] = swap32(low32);\n        this._int32(_word);\n        return (encoding === \"hex\") ? this._hex() : this._bin();\n    }\n    _hex() {\n        const { A, B, C, D, E } = this;\n        return hex32(A) + hex32(B) + hex32(C) + hex32(D) + hex32(E);\n    }\n    _bin() {\n        const { A, B, C, D, E, _byte, _word } = this;\n        _word[0] = swap32(A);\n        _word[1] = swap32(B);\n        _word[2] = swap32(C);\n        _word[3] = swap32(D);\n        _word[4] = swap32(E);\n        return _byte.slice(0, 20);\n    }\n}\nconst W = new Int32Array(80 /* N.workWords */);\nlet sharedBuffer;\nlet sharedOffset = 0;\nconst hex32 = num => (num + 0x100000000).toString(16).substr(-8);\nconst swapLE = (c => (((c << 24) & 0xff000000) | ((c << 8) & 0xff0000) | ((c >> 8) & 0xff00) | ((c >> 24) & 0xff)));\nconst swapBE = (c => c);\nconst swap32 = isBE() ? swapBE : swapLE;\nconst rotate1 = num => (num << 1) | (num >>> 31);\nconst rotate5 = num => (num << 5) | (num >>> 27);\nconst rotate30 = num => (num << 30) | (num >>> 2);\nfunction ft(s, b, c, d) {\n    if (s === 0)\n        return (b & c) | ((~b) & d);\n    if (s === 2)\n        return (b & c) | (b & d) | (c & d);\n    return b ^ c ^ d;\n}\nfunction isBE() {\n    const buf = new Uint8Array(new Uint16Array([0xFEFF]).buffer); // BOM\n    return (buf[0] === 0xFE);\n}\n","import { stringify } from \"safe-stable-stringify\";\nimport { createHash } from \"sha1-uint8array\";\n//#region document-model/crypto.ts\nconst hashBrowser = (data, algorithm = \"sha1\", encoding = \"base64\", _params) => {\n\tif (![\"sha1\"].includes(algorithm)) throw new Error(`Hashing algorithm not supported: \"${algorithm}\". Available: sha1`);\n\tif (![\"base64\", \"hex\"].includes(encoding)) throw new Error(`Hash encoding not supported: \"${encoding}\". Available: base64, hex`);\n\tconst hash = hashUIntArray(data, algorithm);\n\tif (encoding === \"hex\") return uint8ArrayToHex(hash);\n\treturn uint8ArrayToBase64(hash);\n};\nfunction uint8ArrayToBase64(uint8Array) {\n\tlet binaryString = \"\";\n\tfor (let i = 0; i < uint8Array.length; i++) binaryString += String.fromCharCode(uint8Array[i]);\n\treturn btoa(binaryString);\n}\nfunction uint8ArrayToHex(uint8Array) {\n\treturn Array.from(uint8Array).map((byte) => byte.toString(16).padStart(2, \"0\")).join(\"\");\n}\nfunction hashUIntArray(data, algorithm = \"sha1\") {\n\tif (![\"sha1\"].includes(algorithm)) throw new Error(\"Hashing algorithm not supported: Available: sha1\");\n\treturn createHash(\"sha1\").update(data).digest();\n}\nfunction getUnixTimestamp(date) {\n\treturn (new Date(date).getTime() / 1e3).toFixed(0);\n}\nfunction buildOperationSignatureParams({ documentId, signer, action, previousStateHash }) {\n\tconst { scope, type } = action;\n\treturn [\n\t\tgetUnixTimestamp(/* @__PURE__ */ new Date()),\n\t\tsigner.app.key,\n\t\thashBrowser([\n\t\t\tdocumentId,\n\t\t\tscope,\n\t\t\ttype,\n\t\t\tstringify(action.input)\n\t\t].join(\"\")),\n\t\tpreviousStateHash\n\t];\n}\nconst textEncode = new TextEncoder();\nfunction buildOperationSignatureMessage(params) {\n\tconst message = params.join(\"\");\n\tconst prefix = \"\u0019Signed Operation:\\n\" + message.length.toString();\n\treturn textEncode.encode(prefix + message);\n}\nfunction ab2hex(ab) {\n\tconst view = ArrayBuffer.isView(ab) ? ab : new Uint8Array(ab);\n\treturn Array.prototype.map.call(view, (x) => (\"00\" + x.toString(16)).slice(-2)).join(\"\");\n}\nfunction hex2ab(hex) {\n\treturn new Uint8Array(hex.match(/[\\da-f]{2}/gi)?.map(function(h) {\n\t\treturn parseInt(h, 16);\n\t}) ?? []);\n}\n//#endregion\n//#region document-model/utils.ts\nfunction generateId(method) {\n\tif (method && method.toString() !== \"UUIDv4\") throw new Error(`Id generation method not supported: \"${method.toString()}\"`);\n\treturn globalThis.crypto.randomUUID();\n}\n/**\n* Derives a deterministic operation ID from stable properties.\n*/\nfunction deriveOperationId(documentId, scope, branch, actionId) {\n\treturn hashBrowser(`${documentId}:${scope}:${branch}:${actionId}`, \"sha1\", \"hex\").slice(0, 32);\n}\n//#endregion\nexport { buildOperationSignatureParams as a, hex2ab as c, buildOperationSignatureMessage as i, generateId as n, getUnixTimestamp as o, ab2hex as r, hashBrowser as s, deriveOperationId as t };\n\n//# sourceMappingURL=utils-DKOFCM0Q.js.map","import { createRequire } from 'module';\nvar require = createRequire('/');\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*).\n// Mediocre shim\nvar Worker;\nvar workerAdd = \";var __w=require('worker_threads');__w.parentPort.on('message',function(m){onmessage({data:m})}),postMessage=function(m,t){__w.parentPort.postMessage(m,t)},close=process.exit;self=global\";\ntry {\n    Worker = require('worker_threads').Worker;\n}\ncatch (e) {\n}\nvar wk = Worker ? function (c, _, msg, transfer, cb) {\n    var done = false;\n    var w = new Worker(c + workerAdd, { eval: true })\n        .on('error', function (e) { return cb(e, null); })\n        .on('message', function (m) { return cb(null, m); })\n        .on('exit', function (c) {\n        if (c && !done)\n            cb(new Error('exited with code ' + c), null);\n    });\n    w.postMessage(msg, transfer);\n    w.terminate = function () {\n        done = true;\n        return Worker.prototype.terminate.call(w);\n    };\n    return w;\n} : function (_, __, ___, ____, cb) {\n    setImmediate(function () { return cb(new Error('async operations unsupported - update to Node 12+ (or Node 10-11 with the --experimental-worker CLI flag)'), null); });\n    var NOP = function () { };\n    return {\n        terminate: NOP,\n        postMessage: NOP\n    };\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","const Operation = {\n    Remove: 'remove',\n    Replace: 'replace',\n    Add: 'add',\n};\n\n// Don't use `Symbol()` just for 3rd party access the draft\nconst PROXY_DRAFT = Symbol.for('__MUTATIVE_PROXY_DRAFT__');\nconst RAW_RETURN_SYMBOL = Symbol('__MUTATIVE_RAW_RETURN_SYMBOL__');\nconst iteratorSymbol = Symbol.iterator;\nconst dataTypes = {\n    mutable: 'mutable',\n    immutable: 'immutable',\n};\n\nconst internal = {};\n\nfunction has(target, key) {\n    return target instanceof Map\n        ? target.has(key)\n        : Object.prototype.hasOwnProperty.call(target, key);\n}\nfunction getDescriptor(target, key) {\n    if (key in target) {\n        let prototype = Reflect.getPrototypeOf(target);\n        while (prototype) {\n            const descriptor = Reflect.getOwnPropertyDescriptor(prototype, key);\n            if (descriptor)\n                return descriptor;\n            prototype = Reflect.getPrototypeOf(prototype);\n        }\n    }\n    return;\n}\nfunction isBaseSetInstance(obj) {\n    return Object.getPrototypeOf(obj) === Set.prototype;\n}\nfunction isBaseMapInstance(obj) {\n    return Object.getPrototypeOf(obj) === Map.prototype;\n}\n\nfunction latest(proxyDraft) {\n    var _a;\n    return (_a = proxyDraft.copy) !== null && _a !== void 0 ? _a : proxyDraft.original;\n}\n/**\n * Check if the value is a draft\n */\nfunction isDraft(target) {\n    return !!getProxyDraft(target);\n}\nfunction getProxyDraft(value) {\n    if (typeof value !== 'object')\n        return null;\n    return value === null || value === void 0 ? void 0 : value[PROXY_DRAFT];\n}\nfunction getValue(value) {\n    var _a;\n    const proxyDraft = getProxyDraft(value);\n    return proxyDraft ? ((_a = proxyDraft.copy) !== null && _a !== void 0 ? _a : proxyDraft.original) : value;\n}\n/**\n * Check if a value is draftable\n */\nfunction isDraftable(value, options) {\n    if (!value || typeof value !== 'object')\n        return false;\n    let markResult;\n    return (Object.getPrototypeOf(value) === Object.prototype ||\n        Array.isArray(value) ||\n        value instanceof Map ||\n        value instanceof Set ||\n        (!!(options === null || options === void 0 ? void 0 : options.mark) &&\n            ((markResult = options.mark(value, dataTypes)) === dataTypes.immutable ||\n                typeof markResult === 'function')));\n}\nfunction getPath(target, path = []) {\n    if (Object.hasOwnProperty.call(target, 'key')) {\n        // check if the parent is a draft and the original value is not equal to the current value\n        const parentCopy = target.parent.copy;\n        const proxyDraft = getProxyDraft(get(parentCopy, target.key));\n        if (proxyDraft !== null && (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== target.original) {\n            return null;\n        }\n        const isSet = target.parent.type === 3 /* DraftType.Set */;\n        const key = isSet\n            ? Array.from(target.parent.setMap.keys()).indexOf(target.key)\n            : target.key;\n        // check if the key is still in the next state parent\n        if (!((isSet && parentCopy.size > key) || has(parentCopy, key)))\n            return null;\n        path.push(key);\n    }\n    if (target.parent) {\n        return getPath(target.parent, path);\n    }\n    // `target` is root draft.\n    path.reverse();\n    try {\n        // check if the path is valid\n        resolvePath(target.copy, path);\n    }\n    catch (e) {\n        return null;\n    }\n    return path;\n}\nfunction getType(target) {\n    if (Array.isArray(target))\n        return 1 /* DraftType.Array */;\n    if (target instanceof Map)\n        return 2 /* DraftType.Map */;\n    if (target instanceof Set)\n        return 3 /* DraftType.Set */;\n    return 0 /* DraftType.Object */;\n}\nfunction get(target, key) {\n    return getType(target) === 2 /* DraftType.Map */ ? target.get(key) : target[key];\n}\nfunction set(target, key, value) {\n    const type = getType(target);\n    if (type === 2 /* DraftType.Map */) {\n        target.set(key, value);\n    }\n    else {\n        target[key] = value;\n    }\n}\nfunction peek(target, key) {\n    const state = getProxyDraft(target);\n    const source = state ? latest(state) : target;\n    return source[key];\n}\nfunction isEqual(x, y) {\n    if (x === y) {\n        return x !== 0 || 1 / x === 1 / y;\n    }\n    else {\n        return x !== x && y !== y;\n    }\n}\nfunction revokeProxy(proxyDraft) {\n    if (!proxyDraft)\n        return;\n    while (proxyDraft.finalities.revoke.length > 0) {\n        const revoke = proxyDraft.finalities.revoke.pop();\n        revoke();\n    }\n}\n// handle JSON Pointer path with spec https://www.rfc-editor.org/rfc/rfc6901\nfunction escapePath(path, pathAsArray) {\n    return pathAsArray\n        ? path\n        : ['']\n            .concat(path)\n            .map((_item) => {\n            const item = `${_item}`;\n            if (item.indexOf('/') === -1 && item.indexOf('~') === -1)\n                return item;\n            return item.replace(/~/g, '~0').replace(/\\//g, '~1');\n        })\n            .join('/');\n}\nfunction unescapePath(path) {\n    if (Array.isArray(path))\n        return path;\n    return path\n        .split('/')\n        .map((_item) => _item.replace(/~1/g, '/').replace(/~0/g, '~'))\n        .slice(1);\n}\nfunction resolvePath(base, path) {\n    for (let index = 0; index < path.length - 1; index += 1) {\n        const key = path[index];\n        // use `index` in Set draft\n        base = get(getType(base) === 3 /* DraftType.Set */ ? Array.from(base) : base, key);\n        if (typeof base !== 'object') {\n            throw new Error(`Cannot resolve patch at '${path.join('/')}'.`);\n        }\n    }\n    return base;\n}\n\nfunction strictCopy(target) {\n    const copy = Object.create(Object.getPrototypeOf(target));\n    Reflect.ownKeys(target).forEach((key) => {\n        let desc = Reflect.getOwnPropertyDescriptor(target, key);\n        if (desc.enumerable && desc.configurable && desc.writable) {\n            copy[key] = target[key];\n            return;\n        }\n        // for freeze\n        if (!desc.writable) {\n            desc.writable = true;\n            desc.configurable = true;\n        }\n        if (desc.get || desc.set)\n            desc = {\n                configurable: true,\n                writable: true,\n                enumerable: desc.enumerable,\n                value: target[key],\n            };\n        Reflect.defineProperty(copy, key, desc);\n    });\n    return copy;\n}\nconst propIsEnum = Object.prototype.propertyIsEnumerable;\nfunction shallowCopy(original, options) {\n    let markResult;\n    if (Array.isArray(original)) {\n        return Array.prototype.concat.call(original);\n    }\n    else if (original instanceof Set) {\n        if (!isBaseSetInstance(original)) {\n            const SubClass = Object.getPrototypeOf(original).constructor;\n            return new SubClass(original.values());\n        }\n        return Set.prototype.difference\n            ? Set.prototype.difference.call(original, new Set())\n            : new Set(original.values());\n    }\n    else if (original instanceof Map) {\n        if (!isBaseMapInstance(original)) {\n            const SubClass = Object.getPrototypeOf(original).constructor;\n            return new SubClass(original);\n        }\n        return new Map(original);\n    }\n    else if ((options === null || options === void 0 ? void 0 : options.mark) &&\n        ((markResult = options.mark(original, dataTypes)),\n            markResult !== undefined) &&\n        markResult !== dataTypes.mutable) {\n        if (markResult === dataTypes.immutable) {\n            return strictCopy(original);\n        }\n        else if (typeof markResult === 'function') {\n            if ((options.enablePatches || options.enableAutoFreeze)) {\n                throw new Error(`You can't use mark and patches or auto freeze together.`);\n            }\n            return markResult();\n        }\n        throw new Error(`Unsupported mark result: ${markResult}`);\n    }\n    else if (typeof original === 'object' &&\n        Object.getPrototypeOf(original) === Object.prototype) {\n        // For best performance with shallow copies,\n        // don't use `Object.create(Object.getPrototypeOf(obj), Object.getOwnPropertyDescriptors(obj));` by default.\n        const copy = {};\n        Object.keys(original).forEach((key) => {\n            copy[key] = original[key];\n        });\n        Object.getOwnPropertySymbols(original).forEach((key) => {\n            if (propIsEnum.call(original, key)) {\n                copy[key] = original[key];\n            }\n        });\n        return copy;\n    }\n    else {\n        throw new Error(`Please check mark() to ensure that it is a stable marker draftable function.`);\n    }\n}\nfunction ensureShallowCopy(target) {\n    if (target.copy)\n        return;\n    target.copy = shallowCopy(target.original, target.options);\n}\nfunction deepClone(target) {\n    if (!isDraftable(target))\n        return getValue(target);\n    if (Array.isArray(target))\n        return target.map(deepClone);\n    if (target instanceof Map) {\n        const iterable = Array.from(target.entries()).map(([k, v]) => [\n            k,\n            deepClone(v),\n        ]);\n        if (!isBaseMapInstance(target)) {\n            const SubClass = Object.getPrototypeOf(target).constructor;\n            return new SubClass(iterable);\n        }\n        return new Map(iterable);\n    }\n    if (target instanceof Set) {\n        const iterable = Array.from(target).map(deepClone);\n        if (!isBaseSetInstance(target)) {\n            const SubClass = Object.getPrototypeOf(target).constructor;\n            return new SubClass(iterable);\n        }\n        return new Set(iterable);\n    }\n    const copy = Object.create(Object.getPrototypeOf(target));\n    for (const key in target)\n        copy[key] = deepClone(target[key]);\n    return copy;\n}\nfunction cloneIfNeeded(target) {\n    return isDraft(target) ? deepClone(target) : target;\n}\n\nfunction markChanged(proxyDraft) {\n    var _a;\n    proxyDraft.assignedMap = (_a = proxyDraft.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n    if (!proxyDraft.operated) {\n        proxyDraft.operated = true;\n        if (proxyDraft.parent) {\n            markChanged(proxyDraft.parent);\n        }\n    }\n}\n\nfunction throwFrozenError() {\n    throw new Error('Cannot modify frozen object');\n}\nfunction deepFreeze(target, subKey, updatedValues, stack, keys) {\n    {\n        updatedValues = updatedValues !== null && updatedValues !== void 0 ? updatedValues : new WeakMap();\n        stack = stack !== null && stack !== void 0 ? stack : [];\n        keys = keys !== null && keys !== void 0 ? keys : [];\n        const value = updatedValues.has(target)\n            ? updatedValues.get(target)\n            : target;\n        if (stack.length > 0) {\n            const index = stack.indexOf(value);\n            if (value && typeof value === 'object' && index !== -1) {\n                if (stack[0] === value) {\n                    throw new Error(`Forbids circular reference`);\n                }\n                throw new Error(`Forbids circular reference: ~/${keys\n                    .slice(0, index)\n                    .map((key, index) => {\n                    if (typeof key === 'symbol')\n                        return `[${key.toString()}]`;\n                    const parent = stack[index];\n                    if (typeof key === 'object' &&\n                        (parent instanceof Map || parent instanceof Set))\n                        return Array.from(parent.keys()).indexOf(key);\n                    return key;\n                })\n                    .join('/')}`);\n            }\n            stack.push(value);\n            keys.push(subKey);\n        }\n        else {\n            stack.push(value);\n        }\n    }\n    if (Object.isFrozen(target) || isDraft(target)) {\n        {\n            stack.pop();\n            keys.pop();\n        }\n        return;\n    }\n    const type = getType(target);\n    switch (type) {\n        case 2 /* DraftType.Map */:\n            for (const [key, value] of target) {\n                deepFreeze(key, key, updatedValues, stack, keys);\n                deepFreeze(value, key, updatedValues, stack, keys);\n            }\n            target.set = target.clear = target.delete = throwFrozenError;\n            break;\n        case 3 /* DraftType.Set */:\n            for (const value of target) {\n                deepFreeze(value, value, updatedValues, stack, keys);\n            }\n            target.add = target.clear = target.delete = throwFrozenError;\n            break;\n        case 1 /* DraftType.Array */:\n            Object.freeze(target);\n            let index = 0;\n            for (const value of target) {\n                deepFreeze(value, index, updatedValues, stack, keys);\n                index += 1;\n            }\n            break;\n        default:\n            Object.freeze(target);\n            // ignore non-enumerable or symbol properties\n            Object.keys(target).forEach((name) => {\n                const value = target[name];\n                deepFreeze(value, name, updatedValues, stack, keys);\n            });\n    }\n    {\n        stack.pop();\n        keys.pop();\n    }\n}\n\nfunction forEach(target, iter) {\n    const type = getType(target);\n    if (type === 0 /* DraftType.Object */) {\n        Reflect.ownKeys(target).forEach((key) => {\n            iter(key, target[key], target);\n        });\n    }\n    else if (type === 1 /* DraftType.Array */) {\n        let index = 0;\n        for (const entry of target) {\n            iter(index, entry, target);\n            index += 1;\n        }\n    }\n    else {\n        target.forEach((entry, index) => iter(index, entry, target));\n    }\n}\n\nfunction handleValue(target, handledSet, options) {\n    if (isDraft(target) ||\n        !isDraftable(target, options) ||\n        handledSet.has(target) ||\n        Object.isFrozen(target))\n        return;\n    const isSet = target instanceof Set;\n    const setMap = isSet ? new Map() : undefined;\n    handledSet.add(target);\n    forEach(target, (key, value) => {\n        var _a;\n        if (isDraft(value)) {\n            const proxyDraft = getProxyDraft(value);\n            ensureShallowCopy(proxyDraft);\n            // A draft where a child node has been changed, or assigned a value\n            const updatedValue = ((_a = proxyDraft.assignedMap) === null || _a === void 0 ? void 0 : _a.size) || proxyDraft.operated\n                ? proxyDraft.copy\n                : proxyDraft.original;\n            // final update value\n            set(isSet ? setMap : target, key, updatedValue);\n        }\n        else {\n            handleValue(value, handledSet, options);\n        }\n    });\n    if (setMap) {\n        const set = target;\n        const values = Array.from(set);\n        set.clear();\n        values.forEach((value) => {\n            set.add(setMap.has(value) ? setMap.get(value) : value);\n        });\n    }\n}\nfunction finalizeAssigned(proxyDraft, key) {\n    // handle the draftable assigned values， and the value is not a draft\n    const copy = proxyDraft.type === 3 /* DraftType.Set */ ? proxyDraft.setMap : proxyDraft.copy;\n    if (proxyDraft.finalities.revoke.length > 1 &&\n        proxyDraft.assignedMap.get(key) &&\n        copy) {\n        handleValue(get(copy, key), proxyDraft.finalities.handledSet, proxyDraft.options);\n    }\n}\nfunction finalizeSetValue(target) {\n    if (target.type === 3 /* DraftType.Set */ && target.copy) {\n        target.copy.clear();\n        target.setMap.forEach((value) => {\n            target.copy.add(getValue(value));\n        });\n    }\n}\nfunction finalizePatches(target, generatePatches, patches, inversePatches) {\n    const shouldFinalize = target.operated &&\n        target.assignedMap &&\n        target.assignedMap.size > 0 &&\n        !target.finalized;\n    if (shouldFinalize) {\n        if (patches && inversePatches) {\n            const basePath = getPath(target);\n            if (basePath) {\n                generatePatches(target, basePath, patches, inversePatches);\n            }\n        }\n        target.finalized = true;\n    }\n}\nfunction markFinalization(target, key, value, generatePatches) {\n    const proxyDraft = getProxyDraft(value);\n    if (proxyDraft) {\n        // !case: assign the draft value\n        if (!proxyDraft.callbacks) {\n            proxyDraft.callbacks = [];\n        }\n        proxyDraft.callbacks.push((patches, inversePatches) => {\n            var _a;\n            const copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            if (isEqual(get(copy, key), value)) {\n                let updatedValue = proxyDraft.original;\n                if (proxyDraft.copy) {\n                    updatedValue = proxyDraft.copy;\n                }\n                finalizeSetValue(target);\n                finalizePatches(target, generatePatches, patches, inversePatches);\n                if (target.options.enableAutoFreeze) {\n                    target.options.updatedValues =\n                        (_a = target.options.updatedValues) !== null && _a !== void 0 ? _a : new WeakMap();\n                    target.options.updatedValues.set(updatedValue, proxyDraft.original);\n                }\n                // final update value\n                set(copy, key, updatedValue);\n            }\n        });\n        if (target.options.enableAutoFreeze) {\n            // !case: assign the draft value in cross draft tree\n            if (proxyDraft.finalities !== target.finalities) {\n                target.options.enableAutoFreeze = false;\n            }\n        }\n    }\n    if (isDraftable(value, target.options)) {\n        // !case: assign the non-draft value\n        target.finalities.draft.push(() => {\n            const copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            if (isEqual(get(copy, key), value)) {\n                finalizeAssigned(target, key);\n            }\n        });\n    }\n}\n\nfunction generateArrayPatches(proxyState, basePath, patches, inversePatches, pathAsArray) {\n    let { original, assignedMap, options } = proxyState;\n    let copy = proxyState.copy;\n    if (copy.length < original.length) {\n        [original, copy] = [copy, original];\n        [patches, inversePatches] = [inversePatches, patches];\n    }\n    for (let index = 0; index < original.length; index += 1) {\n        if (assignedMap.get(index.toString()) && copy[index] !== original[index]) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Replace,\n                path,\n                // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n                value: cloneIfNeeded(copy[index]),\n            });\n            inversePatches.push({\n                op: Operation.Replace,\n                path,\n                // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n                value: cloneIfNeeded(original[index]),\n            });\n        }\n    }\n    for (let index = original.length; index < copy.length; index += 1) {\n        const _path = basePath.concat([index]);\n        const path = escapePath(_path, pathAsArray);\n        patches.push({\n            op: Operation.Add,\n            path,\n            // If it is a draft, it needs to be deep cloned, and it may also be non-draft.\n            value: cloneIfNeeded(copy[index]),\n        });\n    }\n    if (original.length < copy.length) {\n        // https://www.rfc-editor.org/rfc/rfc6902#appendix-A.4\n        // For performance, here we only generate an operation that replaces the length of the array,\n        // which is inconsistent with JSON Patch specification\n        const { arrayLengthAssignment = true } = options.enablePatches;\n        if (arrayLengthAssignment) {\n            const _path = basePath.concat(['length']);\n            const path = escapePath(_path, pathAsArray);\n            inversePatches.push({\n                op: Operation.Replace,\n                path,\n                value: original.length,\n            });\n        }\n        else {\n            for (let index = copy.length; original.length < index; index -= 1) {\n                const _path = basePath.concat([index - 1]);\n                const path = escapePath(_path, pathAsArray);\n                inversePatches.push({\n                    op: Operation.Remove,\n                    path,\n                });\n            }\n        }\n    }\n}\nfunction generatePatchesFromAssigned({ original, copy, assignedMap }, basePath, patches, inversePatches, pathAsArray) {\n    assignedMap.forEach((assignedValue, key) => {\n        const originalValue = get(original, key);\n        const value = cloneIfNeeded(get(copy, key));\n        const op = !assignedValue\n            ? Operation.Remove\n            : has(original, key)\n                ? Operation.Replace\n                : Operation.Add;\n        if (isEqual(originalValue, value) && op === Operation.Replace)\n            return;\n        const _path = basePath.concat(key);\n        const path = escapePath(_path, pathAsArray);\n        patches.push(op === Operation.Remove ? { op, path } : { op, path, value });\n        inversePatches.push(op === Operation.Add\n            ? { op: Operation.Remove, path }\n            : op === Operation.Remove\n                ? { op: Operation.Add, path, value: originalValue }\n                : { op: Operation.Replace, path, value: originalValue });\n    });\n}\nfunction generateSetPatches({ original, copy }, basePath, patches, inversePatches, pathAsArray) {\n    let index = 0;\n    original.forEach((value) => {\n        if (!copy.has(value)) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Remove,\n                path,\n                value,\n            });\n            inversePatches.unshift({\n                op: Operation.Add,\n                path,\n                value,\n            });\n        }\n        index += 1;\n    });\n    index = 0;\n    copy.forEach((value) => {\n        if (!original.has(value)) {\n            const _path = basePath.concat([index]);\n            const path = escapePath(_path, pathAsArray);\n            patches.push({\n                op: Operation.Add,\n                path,\n                value,\n            });\n            inversePatches.unshift({\n                op: Operation.Remove,\n                path,\n                value,\n            });\n        }\n        index += 1;\n    });\n}\nfunction generatePatches(proxyState, basePath, patches, inversePatches) {\n    const { pathAsArray = true } = proxyState.options.enablePatches;\n    switch (proxyState.type) {\n        case 0 /* DraftType.Object */:\n        case 2 /* DraftType.Map */:\n            return generatePatchesFromAssigned(proxyState, basePath, patches, inversePatches, pathAsArray);\n        case 1 /* DraftType.Array */:\n            return generateArrayPatches(proxyState, basePath, patches, inversePatches, pathAsArray);\n        case 3 /* DraftType.Set */:\n            return generateSetPatches(proxyState, basePath, patches, inversePatches, pathAsArray);\n    }\n}\n\nlet readable = false;\nconst checkReadable = (value, options, ignoreCheckDraftable = false) => {\n    if (typeof value === 'object' &&\n        value !== null &&\n        (!isDraftable(value, options) || ignoreCheckDraftable) &&\n        !readable) {\n        throw new Error(`Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.`);\n    }\n};\n/**\n * `unsafe(callback)` to access mutable data directly in strict mode.\n *\n * ## Example\n *\n * ```ts\n * import { create, unsafe } from '../index';\n *\n * class Foobar {\n *   bar = 1;\n * }\n *\n * const baseState = { foobar: new Foobar() };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *    unsafe(() => {\n *      draft.foobar.bar = 2;\n *    });\n *   },\n *   {\n *     strict: true,\n *   }\n * );\n *\n * expect(state).toBe(baseState);\n * expect(state.foobar).toBe(baseState.foobar);\n * expect(state.foobar.bar).toBe(2);\n * ```\n */\nfunction unsafe(callback) {\n    readable = true;\n    let result;\n    try {\n        result = callback();\n    }\n    finally {\n        readable = false;\n    }\n    return result;\n}\n\nconst mapHandler = {\n    get size() {\n        const current = latest(getProxyDraft(this));\n        return current.size;\n    },\n    has(key) {\n        return latest(getProxyDraft(this)).has(key);\n    },\n    set(key, value) {\n        const target = getProxyDraft(this);\n        const source = latest(target);\n        if (!source.has(key) || !isEqual(source.get(key), value)) {\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(key, true);\n            target.copy.set(key, value);\n            markFinalization(target, key, value, generatePatches);\n        }\n        return this;\n    },\n    delete(key) {\n        if (!this.has(key)) {\n            return false;\n        }\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        if (target.original.has(key)) {\n            target.assignedMap.set(key, false);\n        }\n        else {\n            target.assignedMap.delete(key);\n        }\n        target.copy.delete(key);\n        return true;\n    },\n    clear() {\n        const target = getProxyDraft(this);\n        if (!this.size)\n            return;\n        ensureShallowCopy(target);\n        markChanged(target);\n        target.assignedMap = new Map();\n        for (const [key] of target.original) {\n            target.assignedMap.set(key, false);\n        }\n        target.copy.clear();\n    },\n    forEach(callback, thisArg) {\n        const target = getProxyDraft(this);\n        latest(target).forEach((_value, _key) => {\n            callback.call(thisArg, this.get(_key), _key, this);\n        });\n    },\n    get(key) {\n        var _a, _b;\n        const target = getProxyDraft(this);\n        const value = latest(target).get(key);\n        const mutable = ((_b = (_a = target.options).mark) === null || _b === void 0 ? void 0 : _b.call(_a, value, dataTypes)) === dataTypes.mutable;\n        if (target.options.strict) {\n            checkReadable(value, target.options, mutable);\n        }\n        if (mutable) {\n            return value;\n        }\n        if (target.finalized || !isDraftable(value, target.options)) {\n            return value;\n        }\n        // drafted or reassigned\n        if (value !== target.original.get(key)) {\n            return value;\n        }\n        const draft = internal.createDraft({\n            original: value,\n            parentDraft: target,\n            key,\n            finalities: target.finalities,\n            options: target.options,\n        });\n        ensureShallowCopy(target);\n        target.copy.set(key, draft);\n        return draft;\n    },\n    keys() {\n        return latest(getProxyDraft(this)).keys();\n    },\n    values() {\n        const iterator = this.keys();\n        return {\n            [iteratorSymbol]: () => this.values(),\n            next: () => {\n                const result = iterator.next();\n                if (result.done)\n                    return result;\n                const value = this.get(result.value);\n                return {\n                    done: false,\n                    value,\n                };\n            },\n        };\n    },\n    entries() {\n        const iterator = this.keys();\n        return {\n            [iteratorSymbol]: () => this.entries(),\n            next: () => {\n                const result = iterator.next();\n                if (result.done)\n                    return result;\n                const value = this.get(result.value);\n                return {\n                    done: false,\n                    value: [result.value, value],\n                };\n            },\n        };\n    },\n    [iteratorSymbol]() {\n        return this.entries();\n    },\n};\nconst mapHandlerKeys = Reflect.ownKeys(mapHandler);\n\nconst getNextIterator = (target, iterator, { isValuesIterator }) => () => {\n    var _a, _b;\n    const result = iterator.next();\n    if (result.done)\n        return result;\n    const key = result.value;\n    let value = target.setMap.get(key);\n    const currentDraft = getProxyDraft(value);\n    const mutable = ((_b = (_a = target.options).mark) === null || _b === void 0 ? void 0 : _b.call(_a, value, dataTypes)) === dataTypes.mutable;\n    if (target.options.strict) {\n        checkReadable(key, target.options, mutable);\n    }\n    if (!mutable &&\n        !currentDraft &&\n        isDraftable(key, target.options) &&\n        !target.finalized &&\n        target.original.has(key)) {\n        // draft a draftable original set item\n        const proxy = internal.createDraft({\n            original: key,\n            parentDraft: target,\n            key,\n            finalities: target.finalities,\n            options: target.options,\n        });\n        target.setMap.set(key, proxy);\n        value = proxy;\n    }\n    else if (currentDraft) {\n        // drafted\n        value = currentDraft.proxy;\n    }\n    return {\n        done: false,\n        value: isValuesIterator ? value : [value, value],\n    };\n};\nconst setHandler = {\n    get size() {\n        const target = getProxyDraft(this);\n        return target.setMap.size;\n    },\n    has(value) {\n        const target = getProxyDraft(this);\n        // reassigned or non-draftable values\n        if (target.setMap.has(value))\n            return true;\n        ensureShallowCopy(target);\n        const valueProxyDraft = getProxyDraft(value);\n        // drafted\n        if (valueProxyDraft && target.setMap.has(valueProxyDraft.original))\n            return true;\n        return false;\n    },\n    add(value) {\n        const target = getProxyDraft(this);\n        if (!this.has(value)) {\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(value, true);\n            target.setMap.set(value, value);\n            markFinalization(target, value, value, generatePatches);\n        }\n        return this;\n    },\n    delete(value) {\n        if (!this.has(value)) {\n            return false;\n        }\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        const valueProxyDraft = getProxyDraft(value);\n        if (valueProxyDraft && target.setMap.has(valueProxyDraft.original)) {\n            // delete drafted\n            target.assignedMap.set(valueProxyDraft.original, false);\n            return target.setMap.delete(valueProxyDraft.original);\n        }\n        if (!valueProxyDraft && target.setMap.has(value)) {\n            // non-draftable values\n            target.assignedMap.set(value, false);\n        }\n        else {\n            // reassigned\n            target.assignedMap.delete(value);\n        }\n        // delete reassigned or non-draftable values\n        return target.setMap.delete(value);\n    },\n    clear() {\n        if (!this.size)\n            return;\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        markChanged(target);\n        for (const value of target.original) {\n            target.assignedMap.set(value, false);\n        }\n        target.setMap.clear();\n    },\n    values() {\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        const iterator = target.setMap.keys();\n        return {\n            [Symbol.iterator]: () => this.values(),\n            next: getNextIterator(target, iterator, { isValuesIterator: true }),\n        };\n    },\n    entries() {\n        const target = getProxyDraft(this);\n        ensureShallowCopy(target);\n        const iterator = target.setMap.keys();\n        return {\n            [Symbol.iterator]: () => this.entries(),\n            next: getNextIterator(target, iterator, {\n                isValuesIterator: false,\n            }),\n        };\n    },\n    keys() {\n        return this.values();\n    },\n    [iteratorSymbol]() {\n        return this.values();\n    },\n    forEach(callback, thisArg) {\n        const iterator = this.values();\n        let result = iterator.next();\n        while (!result.done) {\n            callback.call(thisArg, result.value, result.value, this);\n            result = iterator.next();\n        }\n    },\n};\nif (Set.prototype.difference) {\n    // for compatibility with new Set methods\n    // https://github.com/tc39/proposal-set-methods\n    // And `https://github.com/tc39/proposal-set-methods/blob/main/details.md#symbolspecies` has some details about the `@@species` symbol.\n    // So we can't use SubSet instance constructor to get the constructor of the SubSet instance.\n    Object.assign(setHandler, {\n        intersection(other) {\n            return Set.prototype.intersection.call(new Set(this.values()), other);\n        },\n        union(other) {\n            return Set.prototype.union.call(new Set(this.values()), other);\n        },\n        difference(other) {\n            return Set.prototype.difference.call(new Set(this.values()), other);\n        },\n        symmetricDifference(other) {\n            return Set.prototype.symmetricDifference.call(new Set(this.values()), other);\n        },\n        isSubsetOf(other) {\n            return Set.prototype.isSubsetOf.call(new Set(this.values()), other);\n        },\n        isSupersetOf(other) {\n            return Set.prototype.isSupersetOf.call(new Set(this.values()), other);\n        },\n        isDisjointFrom(other) {\n            return Set.prototype.isDisjointFrom.call(new Set(this.values()), other);\n        },\n    });\n}\nconst setHandlerKeys = Reflect.ownKeys(setHandler);\n\nconst proxyHandler = {\n    get(target, key, receiver) {\n        var _a, _b;\n        const copy = (_a = target.copy) === null || _a === void 0 ? void 0 : _a[key];\n        // Improve draft reading performance by caching the draft copy.\n        if (copy && target.finalities.draftsCache.has(copy)) {\n            return copy;\n        }\n        if (key === PROXY_DRAFT)\n            return target;\n        let markResult;\n        if (target.options.mark) {\n            // handle `Uncaught TypeError: Method get Map.prototype.size called on incompatible receiver #<Map>`\n            // or `Uncaught TypeError: Method get Set.prototype.size called on incompatible receiver #<Set>`\n            const value = key === 'size' &&\n                (target.original instanceof Map || target.original instanceof Set)\n                ? Reflect.get(target.original, key)\n                : Reflect.get(target.original, key, receiver);\n            markResult = target.options.mark(value, dataTypes);\n            if (markResult === dataTypes.mutable) {\n                if (target.options.strict) {\n                    checkReadable(value, target.options, true);\n                }\n                return value;\n            }\n        }\n        const source = latest(target);\n        if (source instanceof Map && mapHandlerKeys.includes(key)) {\n            if (key === 'size') {\n                return Object.getOwnPropertyDescriptor(mapHandler, 'size').get.call(target.proxy);\n            }\n            const handle = mapHandler[key];\n            return handle.bind(target.proxy);\n        }\n        if (source instanceof Set && setHandlerKeys.includes(key)) {\n            if (key === 'size') {\n                return Object.getOwnPropertyDescriptor(setHandler, 'size').get.call(target.proxy);\n            }\n            const handle = setHandler[key];\n            return handle.bind(target.proxy);\n        }\n        if (!has(source, key)) {\n            const desc = getDescriptor(source, key);\n            return desc\n                ? `value` in desc\n                    ? desc.value\n                    : // !case: support for getter\n                        (_b = desc.get) === null || _b === void 0 ? void 0 : _b.call(target.proxy)\n                : undefined;\n        }\n        const value = source[key];\n        if (target.options.strict) {\n            checkReadable(value, target.options);\n        }\n        if (target.finalized || !isDraftable(value, target.options)) {\n            return value;\n        }\n        // Ensure that the assigned values are not drafted\n        if (value === peek(target.original, key)) {\n            ensureShallowCopy(target);\n            target.copy[key] = createDraft({\n                original: target.original[key],\n                parentDraft: target,\n                key: target.type === 1 /* DraftType.Array */ ? Number(key) : key,\n                finalities: target.finalities,\n                options: target.options,\n            });\n            // !case: support for custom shallow copy function\n            if (typeof markResult === 'function') {\n                const subProxyDraft = getProxyDraft(target.copy[key]);\n                ensureShallowCopy(subProxyDraft);\n                // Trigger a custom shallow copy to update to a new copy\n                markChanged(subProxyDraft);\n                return subProxyDraft.copy;\n            }\n            return target.copy[key];\n        }\n        if (isDraft(value)) {\n            target.finalities.draftsCache.add(value);\n        }\n        return value;\n    },\n    set(target, key, value) {\n        var _a;\n        if (target.type === 3 /* DraftType.Set */ || target.type === 2 /* DraftType.Map */) {\n            throw new Error(`Map/Set draft does not support any property assignment.`);\n        }\n        let _key;\n        if (target.type === 1 /* DraftType.Array */ &&\n            key !== 'length' &&\n            !(Number.isInteger((_key = Number(key))) &&\n                _key >= 0 &&\n                (key === 0 || _key === 0 || String(_key) === String(key)))) {\n            throw new Error(`Only supports setting array indices and the 'length' property.`);\n        }\n        const desc = getDescriptor(latest(target), key);\n        if (desc === null || desc === void 0 ? void 0 : desc.set) {\n            // !case: cover the case of setter\n            desc.set.call(target.proxy, value);\n            return true;\n        }\n        const current = peek(latest(target), key);\n        const currentProxyDraft = getProxyDraft(current);\n        if (currentProxyDraft && isEqual(currentProxyDraft.original, value)) {\n            // !case: ignore the case of assigning the original draftable value to a draft\n            target.copy[key] = value;\n            target.assignedMap = (_a = target.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n            target.assignedMap.set(key, false);\n            return true;\n        }\n        // !case: handle new props with value 'undefined'\n        if (isEqual(value, current) &&\n            (value !== undefined || has(target.original, key)))\n            return true;\n        ensureShallowCopy(target);\n        markChanged(target);\n        if (has(target.original, key) && isEqual(value, target.original[key])) {\n            // !case: handle the case of assigning the original non-draftable value to a draft\n            target.assignedMap.delete(key);\n        }\n        else {\n            target.assignedMap.set(key, true);\n        }\n        target.copy[key] = value;\n        markFinalization(target, key, value, generatePatches);\n        return true;\n    },\n    has(target, key) {\n        return key in latest(target);\n    },\n    ownKeys(target) {\n        return Reflect.ownKeys(latest(target));\n    },\n    getOwnPropertyDescriptor(target, key) {\n        const source = latest(target);\n        const descriptor = Reflect.getOwnPropertyDescriptor(source, key);\n        if (!descriptor)\n            return descriptor;\n        return {\n            writable: true,\n            configurable: target.type !== 1 /* DraftType.Array */ || key !== 'length',\n            enumerable: descriptor.enumerable,\n            value: source[key],\n        };\n    },\n    getPrototypeOf(target) {\n        return Reflect.getPrototypeOf(target.original);\n    },\n    setPrototypeOf() {\n        throw new Error(`Cannot call 'setPrototypeOf()' on drafts`);\n    },\n    defineProperty() {\n        throw new Error(`Cannot call 'defineProperty()' on drafts`);\n    },\n    deleteProperty(target, key) {\n        var _a;\n        if (target.type === 1 /* DraftType.Array */) {\n            return proxyHandler.set.call(this, target, key, undefined, target.proxy);\n        }\n        if (peek(target.original, key) !== undefined || key in target.original) {\n            // !case: delete an existing key\n            ensureShallowCopy(target);\n            markChanged(target);\n            target.assignedMap.set(key, false);\n        }\n        else {\n            target.assignedMap = (_a = target.assignedMap) !== null && _a !== void 0 ? _a : new Map();\n            // The original non-existent key has been deleted\n            target.assignedMap.delete(key);\n        }\n        if (target.copy)\n            delete target.copy[key];\n        return true;\n    },\n};\nfunction createDraft(createDraftOptions) {\n    const { original, parentDraft, key, finalities, options } = createDraftOptions;\n    const type = getType(original);\n    const proxyDraft = {\n        type,\n        finalized: false,\n        parent: parentDraft,\n        original,\n        copy: null,\n        proxy: null,\n        finalities,\n        options,\n        // Mapping of draft Set items to their corresponding draft values.\n        setMap: type === 3 /* DraftType.Set */\n            ? new Map(original.entries())\n            : undefined,\n    };\n    // !case: undefined as a draft map key\n    if (key || 'key' in createDraftOptions) {\n        proxyDraft.key = key;\n    }\n    const { proxy, revoke } = Proxy.revocable(type === 1 /* DraftType.Array */ ? Object.assign([], proxyDraft) : proxyDraft, proxyHandler);\n    finalities.revoke.push(revoke);\n    proxyDraft.proxy = proxy;\n    if (parentDraft) {\n        const target = parentDraft;\n        target.finalities.draft.push((patches, inversePatches) => {\n            var _a, _b;\n            const oldProxyDraft = getProxyDraft(proxy);\n            // if target is a Set draft, `setMap` is the real Set copies proxy mapping.\n            let copy = target.type === 3 /* DraftType.Set */ ? target.setMap : target.copy;\n            const draft = get(copy, key);\n            const proxyDraft = getProxyDraft(draft);\n            if (proxyDraft) {\n                // assign the updated value to the copy object\n                let updatedValue = proxyDraft.original;\n                if (proxyDraft.operated) {\n                    updatedValue = getValue(draft);\n                }\n                finalizeSetValue(proxyDraft);\n                finalizePatches(proxyDraft, generatePatches, patches, inversePatches);\n                if (target.options.enableAutoFreeze) {\n                    target.options.updatedValues =\n                        (_a = target.options.updatedValues) !== null && _a !== void 0 ? _a : new WeakMap();\n                    target.options.updatedValues.set(updatedValue, proxyDraft.original);\n                }\n                // final update value\n                set(copy, key, updatedValue);\n            }\n            // !case: handle the deleted key\n            (_b = oldProxyDraft.callbacks) === null || _b === void 0 ? void 0 : _b.forEach((callback) => {\n                callback(patches, inversePatches);\n            });\n        });\n    }\n    else {\n        // !case: handle the root draft\n        const target = getProxyDraft(proxy);\n        target.finalities.draft.push((patches, inversePatches) => {\n            finalizeSetValue(target);\n            finalizePatches(target, generatePatches, patches, inversePatches);\n        });\n    }\n    return proxy;\n}\ninternal.createDraft = createDraft;\nfunction finalizeDraft(result, returnedValue, patches, inversePatches, enableAutoFreeze) {\n    var _a;\n    const proxyDraft = getProxyDraft(result);\n    const original = (_a = proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== null && _a !== void 0 ? _a : result;\n    const hasReturnedValue = !!returnedValue.length;\n    if (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.operated) {\n        while (proxyDraft.finalities.draft.length > 0) {\n            const finalize = proxyDraft.finalities.draft.pop();\n            finalize(patches, inversePatches);\n        }\n    }\n    const state = hasReturnedValue\n        ? returnedValue[0]\n        : proxyDraft\n            ? proxyDraft.operated\n                ? proxyDraft.copy\n                : proxyDraft.original\n            : result;\n    if (proxyDraft)\n        revokeProxy(proxyDraft);\n    if (enableAutoFreeze) {\n        deepFreeze(state, state, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options.updatedValues);\n    }\n    return [\n        state,\n        patches && hasReturnedValue\n            ? [{ op: Operation.Replace, path: [], value: returnedValue[0] }]\n            : patches,\n        inversePatches && hasReturnedValue\n            ? [{ op: Operation.Replace, path: [], value: original }]\n            : inversePatches,\n    ];\n}\n\nfunction draftify(baseState, options) {\n    var _a;\n    const finalities = {\n        draft: [],\n        revoke: [],\n        handledSet: new WeakSet(),\n        draftsCache: new WeakSet(),\n    };\n    let patches;\n    let inversePatches;\n    if (options.enablePatches) {\n        patches = [];\n        inversePatches = [];\n    }\n    const isMutable = ((_a = options.mark) === null || _a === void 0 ? void 0 : _a.call(options, baseState, dataTypes)) === dataTypes.mutable ||\n        !isDraftable(baseState, options);\n    const draft = isMutable\n        ? baseState\n        : createDraft({\n            original: baseState,\n            parentDraft: null,\n            finalities,\n            options,\n        });\n    return [\n        draft,\n        (returnedValue = []) => {\n            const [finalizedState, finalizedPatches, finalizedInversePatches] = finalizeDraft(draft, returnedValue, patches, inversePatches, options.enableAutoFreeze);\n            return (options.enablePatches\n                ? [finalizedState, finalizedPatches, finalizedInversePatches]\n                : finalizedState);\n        },\n    ];\n}\n\nfunction handleReturnValue(options) {\n    const { rootDraft, value, useRawReturn = false, isRoot = true } = options;\n    forEach(value, (key, item, source) => {\n        const proxyDraft = getProxyDraft(item);\n        // just handle the draft which is created by the same rootDraft\n        if (proxyDraft &&\n            rootDraft &&\n            proxyDraft.finalities === rootDraft.finalities) {\n            options.isContainDraft = true;\n            const currentValue = proxyDraft.original;\n            // final update value, but just handle return value\n            if (source instanceof Set) {\n                const arr = Array.from(source);\n                source.clear();\n                arr.forEach((_item) => source.add(key === _item ? currentValue : _item));\n            }\n            else {\n                set(source, key, currentValue);\n            }\n        }\n        else if (typeof item === 'object' && item !== null) {\n            options.value = item;\n            options.isRoot = false;\n            handleReturnValue(options);\n        }\n    });\n    if (isRoot) {\n        if (!options.isContainDraft)\n            console.warn(`The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance.`);\n        if (useRawReturn) {\n            console.warn(`The return value contains drafts, please don't use 'rawReturn()' to wrap the return value.`);\n        }\n    }\n}\nfunction getCurrent(target) {\n    var _a;\n    const proxyDraft = getProxyDraft(target);\n    if (!isDraftable(target, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options))\n        return target;\n    const type = getType(target);\n    if (proxyDraft && !proxyDraft.operated)\n        return proxyDraft.original;\n    let currentValue;\n    function ensureShallowCopy() {\n        currentValue =\n            type === 2 /* DraftType.Map */\n                ? !isBaseMapInstance(target)\n                    ? new (Object.getPrototypeOf(target).constructor)(target)\n                    : new Map(target)\n                : type === 3 /* DraftType.Set */\n                    ? Array.from(proxyDraft.setMap.values())\n                    : shallowCopy(target, proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.options);\n    }\n    if (proxyDraft) {\n        // It's a proxy draft, let's create a shallow copy eagerly\n        proxyDraft.finalized = true;\n        try {\n            ensureShallowCopy();\n        }\n        finally {\n            proxyDraft.finalized = false;\n        }\n    }\n    else {\n        // It's not a proxy draft, let's use the target directly and let's see\n        // lazily if we need to create a shallow copy\n        currentValue = target;\n    }\n    forEach(currentValue, (key, value) => {\n        if (proxyDraft && isEqual(get(proxyDraft.original, key), value))\n            return;\n        const newValue = getCurrent(value);\n        if (newValue !== value) {\n            if (currentValue === target)\n                ensureShallowCopy();\n            set(currentValue, key, newValue);\n        }\n    });\n    if (type === 3 /* DraftType.Set */) {\n        const value = (_a = proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.original) !== null && _a !== void 0 ? _a : currentValue;\n        return !isBaseSetInstance(value)\n            ? new (Object.getPrototypeOf(value).constructor)(currentValue)\n            : new Set(currentValue);\n    }\n    return currentValue;\n}\nfunction current(target) {\n    if (!isDraft(target)) {\n        throw new Error(`current() is only used for Draft, parameter: ${target}`);\n    }\n    return getCurrent(target);\n}\n\n/**\n * `makeCreator(options)` to make a creator function.\n *\n * ## Example\n *\n * ```ts\n * import { makeCreator } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const create = makeCreator({ enableAutoFreeze: true });\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n * );\n *\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(state).not.toBe(baseState);\n * expect(state.foo).not.toBe(baseState.foo);\n * expect(state.arr).toBe(baseState.arr);\n * expect(Object.isFrozen(state)).toBeTruthy();\n * ```\n */\nconst makeCreator = (arg) => {\n    if (arg !== undefined &&\n        Object.prototype.toString.call(arg) !== '[object Object]') {\n        throw new Error(`Invalid options: ${String(arg)}, 'options' should be an object.`);\n    }\n    return function create(arg0, arg1, arg2) {\n        var _a, _b, _c;\n        if (typeof arg0 === 'function' && typeof arg1 !== 'function') {\n            return function (base, ...args) {\n                return create(base, (draft) => arg0.call(this, draft, ...args), arg1);\n            };\n        }\n        const base = arg0;\n        const mutate = arg1;\n        let options = arg2;\n        if (typeof arg1 !== 'function') {\n            options = arg1;\n        }\n        if (options !== undefined &&\n            Object.prototype.toString.call(options) !== '[object Object]') {\n            throw new Error(`Invalid options: ${options}, 'options' should be an object.`);\n        }\n        options = Object.assign(Object.assign({}, arg), options);\n        const state = isDraft(base) ? current(base) : base;\n        const mark = Array.isArray(options.mark)\n            ? ((value, types) => {\n                for (const mark of options.mark) {\n                    if (typeof mark !== 'function') {\n                        throw new Error(`Invalid mark: ${mark}, 'mark' should be a function.`);\n                    }\n                    const result = mark(value, types);\n                    if (result) {\n                        return result;\n                    }\n                }\n                return;\n            })\n            : options.mark;\n        const enablePatches = (_a = options.enablePatches) !== null && _a !== void 0 ? _a : false;\n        const strict = (_b = options.strict) !== null && _b !== void 0 ? _b : false;\n        const enableAutoFreeze = (_c = options.enableAutoFreeze) !== null && _c !== void 0 ? _c : false;\n        const _options = {\n            enableAutoFreeze,\n            mark,\n            strict,\n            enablePatches,\n        };\n        if (!isDraftable(state, _options) &&\n            typeof state === 'object' &&\n            state !== null) {\n            throw new Error(`Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.`);\n        }\n        const [draft, finalize] = draftify(state, _options);\n        if (typeof arg1 !== 'function') {\n            if (!isDraftable(state, _options)) {\n                throw new Error(`Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.`);\n            }\n            return [draft, finalize];\n        }\n        let result;\n        try {\n            result = mutate(draft);\n        }\n        catch (error) {\n            revokeProxy(getProxyDraft(draft));\n            throw error;\n        }\n        const returnValue = (value) => {\n            const proxyDraft = getProxyDraft(draft);\n            if (!isDraft(value)) {\n                if (value !== undefined &&\n                    !isEqual(value, draft) &&\n                    (proxyDraft === null || proxyDraft === void 0 ? void 0 : proxyDraft.operated)) {\n                    throw new Error(`Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.`);\n                }\n                const rawReturnValue = value === null || value === void 0 ? void 0 : value[RAW_RETURN_SYMBOL];\n                if (rawReturnValue) {\n                    const _value = rawReturnValue[0];\n                    if (_options.strict && typeof value === 'object' && value !== null) {\n                        handleReturnValue({\n                            rootDraft: proxyDraft,\n                            value,\n                            useRawReturn: true,\n                        });\n                    }\n                    return finalize([_value]);\n                }\n                if (value !== undefined) {\n                    if (typeof value === 'object' && value !== null) {\n                        handleReturnValue({ rootDraft: proxyDraft, value });\n                    }\n                    return finalize([value]);\n                }\n            }\n            if (value === draft || value === undefined) {\n                return finalize([]);\n            }\n            const returnedProxyDraft = getProxyDraft(value);\n            if (_options === returnedProxyDraft.options) {\n                if (returnedProxyDraft.operated) {\n                    throw new Error(`Cannot return a modified child draft.`);\n                }\n                return finalize([current(value)]);\n            }\n            return finalize([value]);\n        };\n        if (result instanceof Promise) {\n            return result.then(returnValue, (error) => {\n                revokeProxy(getProxyDraft(draft));\n                throw error;\n            });\n        }\n        return returnValue(result);\n    };\n};\n\n/**\n * `create(baseState, callback, options)` to create the next state\n *\n * ## Example\n *\n * ```ts\n * import { create } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n * );\n *\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(state).not.toBe(baseState);\n * expect(state.foo).not.toBe(baseState.foo);\n * expect(state.arr).toBe(baseState.arr);\n * ```\n */\nconst create = makeCreator();\n\n/**\n * `apply(state, patches)` to apply patches to state\n *\n * ## Example\n *\n * ```ts\n * import { create, apply } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const [state, patches] = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *   },\n *   { enablePatches: true }\n * );\n * expect(state).toEqual({ foo: { bar: 'str2' }, arr: [] });\n * expect(patches).toEqual([{ op: 'replace', path: ['foo', 'bar'], value: 'str2' }]);\n * expect(state).toEqual(apply(baseState, patches));\n * ```\n */\nfunction apply(state, patches, applyOptions) {\n    let i;\n    for (i = patches.length - 1; i >= 0; i -= 1) {\n        const { value, op, path } = patches[i];\n        if ((!path.length && op === Operation.Replace) ||\n            (path === '' && op === Operation.Add)) {\n            state = value;\n            break;\n        }\n    }\n    if (i > -1) {\n        patches = patches.slice(i + 1);\n    }\n    const mutate = (draft) => {\n        patches.forEach((patch) => {\n            const { path: _path, op } = patch;\n            const path = unescapePath(_path);\n            let base = draft;\n            for (let index = 0; index < path.length - 1; index += 1) {\n                const parentType = getType(base);\n                let key = path[index];\n                if (typeof key !== 'string' && typeof key !== 'number') {\n                    key = String(key);\n                }\n                if (((parentType === 0 /* DraftType.Object */ ||\n                    parentType === 1 /* DraftType.Array */) &&\n                    (key === '__proto__' || key === 'constructor')) ||\n                    (typeof base === 'function' && key === 'prototype')) {\n                    throw new Error(`Patching reserved attributes like __proto__ and constructor is not allowed.`);\n                }\n                // use `index` in Set draft\n                base = get(parentType === 3 /* DraftType.Set */ ? Array.from(base) : base, key);\n                if (typeof base !== 'object') {\n                    throw new Error(`Cannot apply patch at '${path.join('/')}'.`);\n                }\n            }\n            const type = getType(base);\n            // ensure the original patch is not modified.\n            const value = deepClone(patch.value);\n            const key = path[path.length - 1];\n            switch (op) {\n                case Operation.Replace:\n                    switch (type) {\n                        case 2 /* DraftType.Map */:\n                            return base.set(key, value);\n                        case 3 /* DraftType.Set */:\n                            throw new Error(`Cannot apply replace patch to set.`);\n                        default:\n                            return (base[key] = value);\n                    }\n                case Operation.Add:\n                    switch (type) {\n                        case 1 /* DraftType.Array */:\n                            // If the \"-\" character is used to\n                            // index the end of the array (see [RFC6901](https://datatracker.ietf.org/doc/html/rfc6902)),\n                            // this has the effect of appending the value to the array.\n                            return key === '-'\n                                ? base.push(value)\n                                : base.splice(key, 0, value);\n                        case 2 /* DraftType.Map */:\n                            return base.set(key, value);\n                        case 3 /* DraftType.Set */:\n                            return base.add(value);\n                        default:\n                            return (base[key] = value);\n                    }\n                case Operation.Remove:\n                    switch (type) {\n                        case 1 /* DraftType.Array */:\n                            return base.splice(key, 1);\n                        case 2 /* DraftType.Map */:\n                            return base.delete(key);\n                        case 3 /* DraftType.Set */:\n                            return base.delete(patch.value);\n                        default:\n                            return delete base[key];\n                    }\n                default:\n                    throw new Error(`Unsupported patch operation: ${op}.`);\n            }\n        });\n    };\n    if (applyOptions === null || applyOptions === void 0 ? void 0 : applyOptions.mutable) {\n        {\n            if (Object.keys(applyOptions).filter((key) => key !== 'mutable').length) {\n                console.warn('The \"mutable\" option is not allowed to be used with other options.');\n            }\n        }\n        mutate(state);\n        return undefined;\n    }\n    if (isDraft(state)) {\n        if (applyOptions !== undefined) {\n            throw new Error(`Cannot apply patches with options to a draft.`);\n        }\n        mutate(state);\n        return state;\n    }\n    return create(state, mutate, Object.assign(Object.assign({}, applyOptions), { enablePatches: false }));\n}\n\n/**\n * `original(draft)` to get original state in the draft mutation function.\n *\n * ## Example\n *\n * ```ts\n * import { create, original } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     draft.foo.bar = 'str2';\n *     expect(original(draft.foo)).toEqual({ bar: 'str' });\n *   }\n * );\n * ```\n */\nfunction original(target) {\n    const proxyDraft = getProxyDraft(target);\n    if (!proxyDraft) {\n        throw new Error(`original() is only used for a draft, parameter: ${target}`);\n    }\n    return proxyDraft.original;\n}\n\n/**\n * Use rawReturn() to wrap the return value to skip the draft check and thus improve performance.\n *\n * ## Example\n *\n * ```ts\n * import { create, rawReturn } from '../index';\n *\n * const baseState = { foo: { bar: 'str' }, arr: [] };\n * const state = create(\n *   baseState,\n *   (draft) => {\n *     return rawReturn(baseState);\n *   },\n * );\n * expect(state).toBe(baseState);\n * ```\n */\nfunction rawReturn(value) {\n    if (arguments.length === 0) {\n        throw new Error('rawReturn() must be called with a value.');\n    }\n    if (arguments.length > 1) {\n        throw new Error('rawReturn() must be called with one argument.');\n    }\n    if (value !== undefined &&\n        (typeof value !== 'object' || value === null)) {\n        console.warn('rawReturn() must be called with an object(including plain object, arrays, Set, Map, etc.) or `undefined`, other types do not need to be returned via rawReturn().');\n    }\n    return {\n        [RAW_RETURN_SYMBOL]: [value],\n    };\n}\n\nconst constructorString = Object.prototype.constructor.toString();\n/**\n * Check if the value is a simple object(No prototype chain object or iframe same-origin object),\n * support case: https://github.com/unadlib/mutative/issues/17\n */\nconst isSimpleObject = (value) => {\n    if (!value || typeof value !== 'object')\n        return false;\n    const prototype = Object.getPrototypeOf(value);\n    if (prototype === null) {\n        return true;\n    }\n    const constructor = Object.hasOwnProperty.call(prototype, 'constructor') &&\n        prototype.constructor;\n    if (constructor === Object)\n        return true;\n    return (typeof constructor === 'function' &&\n        Function.toString.call(constructor) === constructorString);\n};\nconst markSimpleObject = (value) => {\n    if (isSimpleObject(value)) {\n        return dataTypes.immutable;\n    }\n    return;\n};\n\n/**\n * Cast a value to an Draft type value.\n */\nfunction castDraft(value) {\n    return value;\n}\n/**\n * Cast a value to an Immutable type value.\n */\nfunction castImmutable(value) {\n    return value;\n}\n/**\n * Cast a value to an Mutable type value.\n */\nfunction castMutable(draft) {\n    return draft;\n}\n\nexport { apply, castDraft, castImmutable, castMutable, create, current, isDraft, isDraftable, makeCreator, markSimpleObject, original, rawReturn, unsafe };\n//# sourceMappingURL=mutative.esm.mjs.map\n","import { a as buildOperationSignatureParams, c as hex2ab, i as buildOperationSignatureMessage, n as generateId, o as getUnixTimestamp, r as ab2hex, s as hashBrowser, t as deriveOperationId } from \"../utils-DKOFCM0Q.js\";\nimport { generateMock } from \"./mock.js\";\nimport { ZodError, z } from \"zod\";\nimport { stringify } from \"safe-stable-stringify\";\nimport { strFromU8, strToU8, unzip, zip } from \"fflate\";\nimport { castDraft, create, unsafe } from \"mutative\";\nimport { constantCase, pascalCase } from \"change-case\";\n//#region document-model/errors.ts\nconst FileSystemError = /* @__PURE__ */ new Error(\"File system not available.\");\nvar InvalidActionInputError = class extends Error {\n\tdata;\n\tconstructor(data) {\n\t\tsuper();\n\t\tthis.name = \"InvalidActionInputError\";\n\t\tthis.data = data;\n\t\tthis.message = this.message || `Invalid action input: ${JSON.stringify(data, null, 2)}`;\n\t}\n};\nvar InvalidActionInputZodError = class extends InvalidActionInputError {\n\tissues;\n\tconstructor(issues) {\n\t\tsuper(issues);\n\t\tthis.issues = issues;\n\t\tthis.name = \"InvalidActionInputZodError\";\n\t}\n};\nvar HashMismatchError = class extends Error {\n\t_scope;\n\t_document;\n\t_operation;\n\tconstructor(scope, document, operation) {\n\t\tsuper();\n\t\tthis.name = \"HashMismatchError\";\n\t\tthis._document = document;\n\t\tthis._scope = scope;\n\t\tthis._operation = operation;\n\t\tthis.message = JSON.stringify({\n\t\t\terror: `Hash mismatch on document ${document.header.id}, scope ${scope}, index ${operation.index}`,\n\t\t\tdocument,\n\t\t\toperation\n\t\t}, null, 1);\n\t}\n\tget document() {\n\t\treturn this._document;\n\t}\n\tget scope() {\n\t\treturn this._scope;\n\t}\n\tget operation() {\n\t\treturn this._operation;\n\t}\n};\n//#endregion\n//#region document-model/schemas.ts\nconst isDefinedNonNullAny = (v) => v !== void 0 && v !== null;\nconst definedNonNullAnySchema = z.any().refine((v) => isDefinedNonNullAny(v));\nconst Load_StateSchema = z.enum([\"LOAD_STATE\"]);\nconst PruneSchema = z.enum([\"PRUNE\"]);\nconst RedoSchema = z.enum([\"REDO\"]);\nconst Set_NameSchema = z.enum([\"SET_NAME\"]);\nconst Set_PreferredEditorSchema = z.enum([\"SET_PREFERRED_EDITOR\"]);\nconst UndoSchema = z.enum([\"UNDO\"]);\nfunction OperationScopeSchema() {\n\treturn z.string();\n}\nfunction DocumentActionSchema() {\n\treturn z.union([\n\t\tLoadStateActionSchema(),\n\t\tPruneActionSchema(),\n\t\tRedoActionSchema(),\n\t\tSetNameActionSchema(),\n\t\tSetPreferredEditorActionSchema(),\n\t\tUndoActionSchema()\n\t]);\n}\nfunction LoadStateActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string(),\n\t\tinput: z.lazy(() => LoadStateActionInputSchema()),\n\t\ttype: Load_StateSchema,\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction LoadStateActionInputSchema() {\n\treturn z.object({\n\t\toperations: z.number(),\n\t\tstate: z.lazy(() => LoadStateActionStateInputSchema())\n\t});\n}\nfunction LoadStateActionStateInputSchema() {\n\treturn z.object({\n\t\tdata: z.unknown().nullish(),\n\t\tname: z.string()\n\t});\n}\nfunction PruneActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string(),\n\t\tinput: z.lazy(() => PruneActionInputSchema()),\n\t\ttype: PruneSchema,\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction PruneActionInputSchema() {\n\treturn z.object({\n\t\tend: z.number().nullish(),\n\t\tstart: z.number().nullish()\n\t});\n}\nfunction RedoActionInputSchema() {\n\treturn z.object({ count: z.number() });\n}\nfunction RedoActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string().datetime(),\n\t\tinput: RedoActionInputSchema(),\n\t\ttype: RedoSchema,\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction SetNameActionInputSchema() {\n\treturn z.object({ name: z.string() });\n}\nfunction SetNameActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string().datetime(),\n\t\tinput: SetNameActionInputSchema(),\n\t\ttype: Set_NameSchema,\n\t\tscope: z.literal(\"global\")\n\t});\n}\nfunction SetPreferredEditorActionInputSchema() {\n\treturn z.object({ preferredEditor: z.string().nullable() });\n}\nfunction SetPreferredEditorActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string().datetime(),\n\t\tinput: SetPreferredEditorActionInputSchema(),\n\t\ttype: Set_PreferredEditorSchema,\n\t\tscope: z.literal(\"header\")\n\t});\n}\nfunction UndoActionInputSchema() {\n\treturn z.object({ count: z.number() });\n}\nfunction UndoActionSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttimestampUtcMs: z.string().datetime(),\n\t\tinput: UndoActionInputSchema(),\n\t\ttype: UndoSchema,\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction AddChangeLogItemInputSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"AddChangeLogItemInput\").optional(),\n\t\tcontent: z.string(),\n\t\tid: z.string(),\n\t\tinsertBefore: z.string().nullable()\n\t});\n}\nfunction AddModuleInputSchema() {\n\treturn z.object({\n\t\tdescription: z.string().nullish(),\n\t\tid: z.string(),\n\t\tname: z.string()\n\t});\n}\nfunction AddOperationErrorInputSchema() {\n\treturn z.object({\n\t\terrorCode: z.string().nullish(),\n\t\terrorDescription: z.string().nullish(),\n\t\terrorName: z.string().nullish(),\n\t\terrorTemplate: z.string().nullish(),\n\t\tid: z.string(),\n\t\toperationId: z.string()\n\t});\n}\nfunction AddOperationExampleInputSchema() {\n\treturn z.object({\n\t\texample: z.string(),\n\t\tid: z.string(),\n\t\toperationId: z.string()\n\t});\n}\nfunction AddOperationInputSchema() {\n\treturn z.object({\n\t\tdescription: z.string().nullish(),\n\t\tid: z.string(),\n\t\tmoduleId: z.string(),\n\t\tname: z.string(),\n\t\treducer: z.string().nullish(),\n\t\tschema: z.string().nullish(),\n\t\ttemplate: z.string().nullish(),\n\t\tscope: OperationScopeSchema().nullish()\n\t});\n}\nfunction AddStateExampleInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\texample: z.string(),\n\t\tid: z.string(),\n\t\tinsertBefore: z.string().nullish()\n\t});\n}\nfunction AuthorSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"Author\").optional(),\n\t\tname: z.string(),\n\t\twebsite: z.string().nullable()\n\t});\n}\nfunction CodeExampleSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"CodeExample\").optional(),\n\t\tid: z.string(),\n\t\tvalue: z.string()\n\t});\n}\nfunction DeleteChangeLogItemInputSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"DeleteChangeLogItemInput\").optional(),\n\t\tid: z.string()\n\t});\n}\nfunction DeleteModuleInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction DeleteOperationErrorInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction DeleteOperationExampleInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction DeleteOperationInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction DeleteStateExampleInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\tid: z.string()\n\t});\n}\nfunction DocumentModelInputSchema() {\n\treturn z.union([\n\t\tAddChangeLogItemInputSchema(),\n\t\tAddModuleInputSchema(),\n\t\tAddOperationErrorInputSchema(),\n\t\tAddOperationExampleInputSchema(),\n\t\tAddOperationInputSchema(),\n\t\tAddStateExampleInputSchema(),\n\t\tDeleteChangeLogItemInputSchema(),\n\t\tDeleteModuleInputSchema(),\n\t\tDeleteOperationErrorInputSchema(),\n\t\tDeleteOperationExampleInputSchema(),\n\t\tDeleteOperationInputSchema(),\n\t\tDeleteStateExampleInputSchema(),\n\t\tMoveOperationInputSchema(),\n\t\tReorderChangeLogItemsInputSchema(),\n\t\tReorderModuleOperationsInputSchema(),\n\t\tReorderModulesInputSchema(),\n\t\tReorderOperationErrorsInputSchema(),\n\t\tReorderOperationExamplesInputSchema(),\n\t\tReorderStateExamplesInputSchema(),\n\t\tSetAuthorNameInputSchema(),\n\t\tSetAuthorWebsiteInputSchema(),\n\t\tSetInitialStateInputSchema(),\n\t\tSetModelDescriptionInputSchema(),\n\t\tSetModelExtensionInputSchema(),\n\t\tSetModelIdInputSchema(),\n\t\tSetModelNameInputSchema(),\n\t\tSetModuleDescriptionInputSchema(),\n\t\tSetModuleNameInputSchema(),\n\t\tSetOperationDescriptionInputSchema(),\n\t\tSetOperationErrorCodeInputSchema(),\n\t\tSetOperationErrorDescriptionInputSchema(),\n\t\tSetOperationErrorNameInputSchema(),\n\t\tSetOperationErrorTemplateInputSchema(),\n\t\tSetOperationNameInputSchema(),\n\t\tSetOperationReducerInputSchema(),\n\t\tSetOperationSchemaInputSchema(),\n\t\tSetOperationTemplateInputSchema(),\n\t\tSetStateSchemaInputSchema(),\n\t\tUpdateChangeLogItemInputSchema(),\n\t\tUpdateOperationExampleInputSchema(),\n\t\tUpdateStateExampleInputSchema()\n\t]);\n}\nfunction DocumentModelGlobalStateSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"DocumentModelGlobalState\").optional(),\n\t\tid: z.string(),\n\t\tname: z.string(),\n\t\tauthor: AuthorSchema(),\n\t\textension: z.string(),\n\t\tdescription: z.string(),\n\t\tspecifications: z.array(DocumentSpecificationSchema())\n\t});\n}\nfunction DocumentSpecificationSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"DocumentSpecification\").optional(),\n\t\tstate: ScopeStateSchema(),\n\t\tmodules: z.array(ModuleSchema()),\n\t\tversion: z.number().int(),\n\t\tchangeLog: z.array(z.string())\n\t});\n}\nfunction ModuleSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"ModuleSpecification\").optional(),\n\t\tid: z.string(),\n\t\tname: z.string(),\n\t\tdescription: z.string().nullable(),\n\t\toperations: z.array(OperationSpecificationSchema())\n\t});\n}\nfunction MoveOperationInputSchema() {\n\treturn z.object({\n\t\tnewModuleId: z.string(),\n\t\toperationId: z.string()\n\t});\n}\nfunction OperationSpecificationSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"OperationSpecification\").optional(),\n\t\tid: z.string(),\n\t\tname: z.string().nullable(),\n\t\tdescription: z.string().nullable(),\n\t\tschema: z.string().nullable(),\n\t\ttemplate: z.string().nullable(),\n\t\treducer: z.string().nullable(),\n\t\terrors: z.array(OperationErrorSchema()),\n\t\texamples: z.array(CodeExampleSchema()),\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction OperationErrorSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"OperationErrorSpecification\").optional(),\n\t\tid: z.string(),\n\t\tname: z.string().nullable(),\n\t\tcode: z.string().nullable(),\n\t\tdescription: z.string().nullable(),\n\t\ttemplate: z.string().nullable()\n\t});\n}\nfunction ReorderChangeLogItemsInputSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"ReorderChangeLogItemsInput\").optional(),\n\t\torder: z.array(z.string())\n\t});\n}\nfunction ReorderModuleOperationsInputSchema() {\n\treturn z.object({\n\t\tmoduleId: z.string(),\n\t\torder: z.array(z.string())\n\t});\n}\nfunction ReorderModulesInputSchema() {\n\treturn z.object({ order: z.array(z.string()) });\n}\nfunction ReorderOperationErrorsInputSchema() {\n\treturn z.object({\n\t\toperationId: z.string(),\n\t\torder: z.array(z.string())\n\t});\n}\nfunction ReorderOperationExamplesInputSchema() {\n\treturn z.object({\n\t\toperationId: z.string(),\n\t\torder: z.array(z.string())\n\t});\n}\nfunction ReorderStateExamplesInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\torder: z.array(z.string())\n\t});\n}\nfunction SetAuthorNameInputSchema() {\n\treturn z.object({ authorName: z.string() });\n}\nfunction SetAuthorWebsiteInputSchema() {\n\treturn z.object({ authorWebsite: z.string() });\n}\nfunction SetInitialStateInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\tinitialValue: z.string()\n\t});\n}\nfunction SetModelDescriptionInputSchema() {\n\treturn z.object({ description: z.string() });\n}\nfunction SetModelExtensionInputSchema() {\n\treturn z.object({ extension: z.string() });\n}\nfunction SetModelIdInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction SetModelNameInputSchema() {\n\treturn z.object({ name: z.string() });\n}\nfunction SetModuleDescriptionInputSchema() {\n\treturn z.object({\n\t\tdescription: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetModuleNameInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tname: z.string().nullish()\n\t});\n}\nfunction SetOperationDescriptionInputSchema() {\n\treturn z.object({\n\t\tdescription: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetOperationErrorCodeInputSchema() {\n\treturn z.object({\n\t\terrorCode: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetOperationErrorDescriptionInputSchema() {\n\treturn z.object({\n\t\terrorDescription: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetOperationErrorNameInputSchema() {\n\treturn z.object({\n\t\terrorName: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetOperationErrorTemplateInputSchema() {\n\treturn z.object({\n\t\terrorTemplate: z.string().nullish(),\n\t\tid: z.string()\n\t});\n}\nfunction SetOperationNameInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tname: z.string().nullish()\n\t});\n}\nfunction SetOperationScopeInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tscope: OperationScopeSchema()\n\t});\n}\nfunction SetOperationReducerInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\treducer: z.string().nullish()\n\t});\n}\nfunction SetOperationSchemaInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tschema: z.string().nullish()\n\t});\n}\nfunction SetOperationTemplateInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\ttemplate: z.string().nullish()\n\t});\n}\nfunction SetStateSchemaInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\tschema: z.string()\n\t});\n}\nfunction StateSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"State\").optional(),\n\t\tschema: z.string(),\n\t\texamples: z.array(CodeExampleSchema()),\n\t\tinitialValue: z.string()\n\t});\n}\nfunction ScopeStateSchema() {\n\treturn z.object({\n\t\tlocal: StateSchema(),\n\t\tglobal: StateSchema()\n\t});\n}\nfunction UpdateChangeLogItemInputSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"UpdateChangeLogItemInput\").optional(),\n\t\tid: z.string(),\n\t\tnewContent: z.string()\n\t});\n}\nfunction UpdateOperationExampleInputSchema() {\n\treturn z.object({\n\t\texample: z.string(),\n\t\tid: z.string()\n\t});\n}\nfunction UpdateStateExampleInputSchema() {\n\treturn z.object({\n\t\tscope: z.string(),\n\t\tid: z.string(),\n\t\tnewExample: z.string()\n\t});\n}\nconst PowerhouseModuleSchema = z.object({\n\tid: z.string(),\n\tname: z.string(),\n\tdocumentTypes: z.array(z.string()).optional()\n});\nconst PowerhouseModulesSchema = z.array(PowerhouseModuleSchema).optional();\nconst PublisherSchema = z.object({\n\tname: z.string().optional(),\n\turl: z.string().optional()\n});\nconst ConfigEntryTypeSchema = z.union([z.literal(\"var\"), z.literal(\"secret\")]);\nconst ConfigEntrySchema = z.object({\n\tname: z.string(),\n\ttype: ConfigEntryTypeSchema,\n\tdescription: z.string().optional(),\n\trequired: z.boolean().optional(),\n\tdefault: z.boolean().optional()\n});\nconst ManifestSchema = z.object({\n\tname: z.string(),\n\tdescription: z.string().optional(),\n\tcategory: z.string().optional(),\n\tpublisher: PublisherSchema.optional(),\n\tdocumentModels: PowerhouseModulesSchema,\n\tapps: PowerhouseModulesSchema,\n\teditors: PowerhouseModulesSchema,\n\tprocessors: PowerhouseModulesSchema,\n\tsubgraphs: PowerhouseModulesSchema,\n\tconfig: z.array(ConfigEntrySchema).optional()\n});\n//#endregion\n//#region document-model/actions.ts\n/**\n* Cancels the last `count` operations.\n*\n* @param count - Number of operations to cancel\n* @category Actions\n*/\nconst undo = (count = 1, scope = \"global\") => createAction(\"UNDO\", { count }, void 0, UndoActionInputSchema, scope);\n/**\n* Cancels the last `count` {@link undo | UNDO} operations.\n*\n* @param count - Number of UNDO operations to cancel\n* @category Actions\n*/\nconst redo = (count = 1, scope = \"global\") => createAction(\"REDO\", { count }, void 0, RedoActionInputSchema, scope);\n/**\n* Joins multiple operations into a single {@link loadState | LOAD_STATE} operation.\n*\n* @remarks\n* Useful to keep operations history smaller. Operations to prune are selected by index,\n* similar to the {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice | slice} method in Arrays.\n*\n* @param start - Index of the first operation to prune\n* @param end - Index of the last operation to prune\n* @category Actions\n*/\nconst prune = (start, end, scope = \"global\") => createAction(\"PRUNE\", {\n\tstart,\n\tend\n}, void 0, PruneActionInputSchema, scope);\n/**\n* Replaces the state of the document.\n*\n* @remarks\n* This action shouldn't be used directly. It is dispatched by the {@link prune} action.\n*\n* @param state - State to be set in the document.\n* @param operations - Number of operations that were removed from the previous state.\n* @category Actions\n*/\nconst loadState = (state, operations) => createAction(\"LOAD_STATE\", {\n\tstate,\n\toperations\n}, void 0, LoadStateActionInputSchema);\nconst noop = (scope = \"global\") => createAction(\"NOOP\", {}, void 0, void 0, scope);\n/**\n* Helper function to be used by action creators.\n*\n* @remarks\n* Creates an action with the given type and input properties. The input\n* properties default to an empty object.\n*\n* @typeParam A - Type of the action to be returned.\n*\n* @param type - The type of the action.\n* @param input - The input properties of the action.\n* @param _attachments - Deprecated and ignored. Retained so action creators\n*   generated before the attachment-system removal keep their 5-argument shape.\n* @param validator - The validator to use for the input properties.\n* @param scope - The scope of the action, can either be 'global' or 'local'.\n*\n* @throws Error if the type is empty or not a string.\n*\n* @returns The new action.\n*/\nfunction createAction(type, input, _attachments, validator, scope = \"global\") {\n\tif (!type) throw new Error(\"Empty action type\");\n\tif (typeof type !== \"string\") throw new Error(`Invalid action type: ${JSON.stringify(type)}`);\n\tconst action = {\n\t\tid: generateId(),\n\t\ttimestampUtcMs: (/* @__PURE__ */ new Date()).toISOString(),\n\t\ttype,\n\t\tinput,\n\t\tscope\n\t};\n\ttry {\n\t\tvalidator?.().parse(action.input);\n\t} catch (error) {\n\t\tif (error instanceof ZodError) throw new InvalidActionInputZodError(error.issues);\n\t\tthrow new InvalidActionInputError(error);\n\t}\n\treturn action;\n}\n/**\n* This function should be used instead of { ...action } to ensure\n* that extra properties are not included in the action.\n*/\nconst actionFromAction = (action) => {\n\treturn {\n\t\tid: action.id,\n\t\ttimestampUtcMs: action.timestampUtcMs,\n\t\ttype: action.type,\n\t\tinput: action.input,\n\t\tscope: action.scope,\n\t\tcontext: action.context\n\t};\n};\nconst operationFromAction = (action, index, skip, context) => {\n\treturn {\n\t\t...action,\n\t\taction,\n\t\tid: deriveOperationId(context.documentId, context.scope, context.branch, action.id),\n\t\ttimestampUtcMs: action.timestampUtcMs,\n\t\thash: \"\",\n\t\terror: void 0,\n\t\tindex,\n\t\tskip\n\t};\n};\nconst operationFromOperation = (operation, index, skip, context) => {\n\tconst id = deriveOperationId(context.documentId, context.scope, context.branch, operation.action.id);\n\treturn {\n\t\t...operation,\n\t\thash: \"\",\n\t\terror: void 0,\n\t\tindex,\n\t\tskip,\n\t\tid\n\t};\n};\nconst operationWithContext = (operation, context) => {\n\tif (!operation.action) throw new Error(\"Operation has no action\");\n\treturn {\n\t\t...operation,\n\t\taction: {\n\t\t\t...operation.action,\n\t\t\tcontext\n\t\t}\n\t};\n};\nconst actionContext = () => ({});\nconst actionSigner = (user, app, signatures = []) => ({\n\tuser,\n\tapp,\n\tsignatures\n});\nasync function buildOperationSignature(context, signMethod) {\n\tconst params = buildOperationSignatureParams(context);\n\tconst signature = await signMethod(buildOperationSignatureMessage(params));\n\treturn [...params, `0x${ab2hex(signature)}`];\n}\nasync function buildSignedAction(action, reducer, document, signer, signHandler) {\n\tconst scopeOperations = reducer(document, action, void 0, { reuseOperationResultingState: true }).operations[action.scope];\n\tif (!scopeOperations) throw new Error(`No operations found for scope: ${action.scope}`);\n\tconst operation = scopeOperations.at(-1);\n\tif (!operation) throw new Error(\"Action was not applied\");\n\tconst previousStateHash = scopeOperations.at(-2)?.hash ?? \"\";\n\tconst signature = await buildOperationSignature({\n\t\tdocumentId: document.header.id,\n\t\tsigner,\n\t\taction,\n\t\tpreviousStateHash\n\t}, signHandler);\n\treturn operationWithContext(operation, { signer: actionSigner(signer.user, signer.app, [...signer.signatures, signature]) });\n}\nasync function verifyOperationSignature(signature, signer, verifyHandler) {\n\tconst publicKey = signer.app.key;\n\tconst params = signature.slice(0, 4);\n\treturn verifyHandler(publicKey, hex2ab(signature[4]), buildOperationSignatureMessage(params));\n}\n/**\n* Changes the name of the document.\n*\n* @param name - The name to be set in the document.\n* @category Actions\n*/\nconst setName = (name) => createAction(\"SET_NAME\", typeof name === \"string\" ? { name } : name, void 0, SetNameActionInputSchema, \"global\");\n/**\n* Changes the preferred editor recorded in the document header meta.\n*\n* Passing `null` clears the preferred editor.\n*\n* @category Actions\n*/\nconst setPreferredEditor = (input) => createAction(\"SET_PREFERRED_EDITOR\", typeof input === \"object\" && input !== null ? input : { preferredEditor: input }, void 0, SetPreferredEditorActionInputSchema, \"header\");\nconst setModelName = (input) => createAction(\"SET_MODEL_NAME\", { ...input }, void 0, SetModelNameInputSchema, \"global\");\nconst setModelId = (input) => createAction(\"SET_MODEL_ID\", { ...input }, void 0, SetModelIdInputSchema, \"global\");\nconst setModelExtension = (input) => createAction(\"SET_MODEL_EXTENSION\", { ...input }, void 0, SetModelExtensionInputSchema, \"global\");\nconst setModelDescription = (input) => createAction(\"SET_MODEL_DESCRIPTION\", { ...input }, void 0, SetModelDescriptionInputSchema, \"global\");\nconst setAuthorName = (input) => createAction(\"SET_AUTHOR_NAME\", { ...input }, void 0, SetAuthorNameInputSchema, \"global\");\nconst setAuthorWebsite = (input) => createAction(\"SET_AUTHOR_WEBSITE\", { ...input }, void 0, SetAuthorWebsiteInputSchema, \"global\");\nconst addModule = (input) => createAction(\"ADD_MODULE\", { ...input }, void 0, AddModuleInputSchema, \"global\");\nconst setModuleName = (input) => createAction(\"SET_MODULE_NAME\", { ...input }, void 0, SetModuleNameInputSchema, \"global\");\nconst setModuleDescription = (input) => createAction(\"SET_MODULE_DESCRIPTION\", { ...input }, void 0, SetModuleDescriptionInputSchema, \"global\");\nconst deleteModule = (input) => createAction(\"DELETE_MODULE\", { ...input }, void 0, DeleteModuleInputSchema, \"global\");\nconst reorderModules = (input) => createAction(\"REORDER_MODULES\", { ...input }, void 0, ReorderModulesInputSchema, \"global\");\nconst addOperation = (input) => createAction(\"ADD_OPERATION\", { ...input }, void 0, AddOperationInputSchema, \"global\");\nconst setOperationName = (input) => createAction(\"SET_OPERATION_NAME\", { ...input }, void 0, SetOperationNameInputSchema, \"global\");\nconst setOperationScope = (input) => createAction(\"SET_OPERATION_SCOPE\", { ...input }, void 0, SetOperationScopeInputSchema, \"global\");\nconst setOperationSchema = (input) => createAction(\"SET_OPERATION_SCHEMA\", { ...input }, void 0, SetOperationSchemaInputSchema, \"global\");\nconst setOperationDescription = (input) => createAction(\"SET_OPERATION_DESCRIPTION\", { ...input }, void 0, SetOperationDescriptionInputSchema, \"global\");\nconst setOperationTemplate = (input) => createAction(\"SET_OPERATION_TEMPLATE\", { ...input }, void 0, SetOperationTemplateInputSchema, \"global\");\nconst setOperationReducer = (input) => createAction(\"SET_OPERATION_REDUCER\", { ...input }, void 0, SetOperationReducerInputSchema, \"global\");\nconst moveOperation = (input) => createAction(\"MOVE_OPERATION\", { ...input }, void 0, MoveOperationInputSchema, \"global\");\nconst deleteOperation = (input) => createAction(\"DELETE_OPERATION\", { ...input }, void 0, DeleteOperationInputSchema, \"global\");\nconst reorderModuleOperations = (input) => createAction(\"REORDER_MODULE_OPERATIONS\", { ...input }, void 0, ReorderModuleOperationsInputSchema, \"global\");\nconst addOperationError = (input) => createAction(\"ADD_OPERATION_ERROR\", { ...input }, void 0, AddOperationErrorInputSchema, \"global\");\nconst setOperationErrorCode = (input) => createAction(\"SET_OPERATION_ERROR_CODE\", { ...input }, void 0, SetOperationErrorCodeInputSchema, \"global\");\nconst setOperationErrorName = (input) => createAction(\"SET_OPERATION_ERROR_NAME\", { ...input }, void 0, SetOperationErrorNameInputSchema, \"global\");\nconst setOperationErrorDescription = (input) => createAction(\"SET_OPERATION_ERROR_DESCRIPTION\", { ...input }, void 0, SetOperationErrorDescriptionInputSchema, \"global\");\nconst setOperationErrorTemplate = (input) => createAction(\"SET_OPERATION_ERROR_TEMPLATE\", { ...input }, void 0, SetOperationErrorTemplateInputSchema, \"global\");\nconst deleteOperationError = (input) => createAction(\"DELETE_OPERATION_ERROR\", { ...input }, void 0, DeleteOperationErrorInputSchema, \"global\");\nconst reorderOperationErrors = (input) => createAction(\"REORDER_OPERATION_ERRORS\", { ...input }, void 0, ReorderOperationErrorsInputSchema, \"global\");\nconst addOperationExample = (input) => createAction(\"ADD_OPERATION_EXAMPLE\", { ...input }, void 0, AddOperationExampleInputSchema, \"global\");\nconst updateOperationExample = (input) => createAction(\"UPDATE_OPERATION_EXAMPLE\", { ...input }, void 0, UpdateOperationExampleInputSchema, \"global\");\nconst deleteOperationExample = (input) => createAction(\"DELETE_OPERATION_EXAMPLE\", { ...input }, void 0, DeleteOperationExampleInputSchema, \"global\");\nconst reorderOperationExamples = (input) => createAction(\"REORDER_OPERATION_EXAMPLES\", { ...input }, void 0, ReorderOperationExamplesInputSchema, \"global\");\nconst operationExampleCreators = {\n\taddOperationExample,\n\tupdateOperationExample,\n\tdeleteOperationExample,\n\treorderOperationExamples\n};\nconst setStateSchema = (input) => createAction(\"SET_STATE_SCHEMA\", { ...input }, void 0, SetStateSchemaInputSchema, \"global\");\nconst setInitialState = (input) => createAction(\"SET_INITIAL_STATE\", { ...input }, void 0, SetInitialStateInputSchema, \"global\");\nconst addStateExample = (input) => createAction(\"ADD_STATE_EXAMPLE\", { ...input }, void 0, AddStateExampleInputSchema, \"global\");\nconst updateStateExample = (input) => createAction(\"UPDATE_STATE_EXAMPLE\", { ...input }, void 0, UpdateStateExampleInputSchema, \"global\");\nconst deleteStateExample = (input) => createAction(\"DELETE_STATE_EXAMPLE\", { ...input }, void 0, DeleteStateExampleInputSchema, \"global\");\nconst reorderStateExamples = (input) => createAction(\"REORDER_STATE_EXAMPLES\", { ...input }, void 0, ReorderStateExamplesInputSchema, \"global\");\nconst addChangeLogItem = (input) => createAction(\"ADD_CHANGE_LOG_ITEM\", { ...input }, void 0, AddChangeLogItemInputSchema, \"global\");\nconst updateChangeLogItem = (input) => createAction(\"UPDATE_CHANGE_LOG_ITEM\", { ...input }, void 0, UpdateChangeLogItemInputSchema, \"global\");\nconst deleteChangeLogItem = (input) => createAction(\"DELETE_CHANGE_LOG_ITEM\", { ...input }, void 0, DeleteChangeLogItemInputSchema, \"global\");\nconst reorderChangeLogItems = (input) => createAction(\"REORDER_CHANGE_LOG_ITEMS\", { ...input }, void 0, ReorderChangeLogItemsInputSchema, \"global\");\nconst releaseNewVersion = () => createAction(\"RELEASE_NEW_VERSION\", {}, void 0, void 0, \"global\");\nconst baseActions = {\n\tsetName,\n\tsetPreferredEditor,\n\tundo,\n\tredo,\n\tprune,\n\tloadState,\n\tnoop\n};\nconst documentModelActions = {\n\tsetModelName,\n\tsetModelId,\n\tsetModelExtension,\n\tsetModelDescription,\n\tsetAuthorName,\n\tsetAuthorWebsite,\n\taddModule,\n\tsetModuleName,\n\tsetModuleDescription,\n\tdeleteModule,\n\treorderModules,\n\taddOperation,\n\tsetOperationName,\n\tsetOperationScope,\n\tsetOperationSchema,\n\tsetOperationDescription,\n\tsetOperationTemplate,\n\tsetOperationReducer,\n\tmoveOperation,\n\tdeleteOperation,\n\treorderModuleOperations,\n\taddOperationError,\n\tsetOperationErrorCode,\n\tsetOperationErrorName,\n\tsetOperationErrorDescription,\n\tsetOperationErrorTemplate,\n\tdeleteOperationError,\n\treorderOperationErrors,\n\taddOperationExample,\n\tupdateOperationExample,\n\tdeleteOperationExample,\n\treorderOperationExamples,\n\tsetStateSchema,\n\tsetInitialState,\n\taddStateExample,\n\tupdateStateExample,\n\tdeleteStateExample,\n\treorderStateExamples,\n\taddChangeLogItem,\n\tupdateChangeLogItem,\n\tdeleteChangeLogItem,\n\treorderChangeLogItems,\n\treleaseNewVersion\n};\nconst actions = {\n\t...baseActions,\n\t...documentModelActions\n};\n//#endregion\n//#region document-model/constants.ts\nconst documentModelFileExtension = \"phdm\";\nconst documentModelInitialLocalState = {};\nconst documentModelInitialGlobalState = {\n\tid: \"\",\n\tname: \"\",\n\textension: \"\",\n\tdescription: \"\",\n\tauthor: {\n\t\tname: \"\",\n\t\twebsite: \"\"\n\t},\n\tspecifications: [{\n\t\tversion: 1,\n\t\tchangeLog: [],\n\t\tstate: {\n\t\t\tglobal: {\n\t\t\t\tschema: \"\",\n\t\t\t\tinitialValue: \"\",\n\t\t\t\texamples: []\n\t\t\t},\n\t\t\tlocal: {\n\t\t\t\tschema: \"\",\n\t\t\t\tinitialValue: \"\",\n\t\t\t\texamples: []\n\t\t\t}\n\t\t},\n\t\tmodules: []\n\t}]\n};\nconst documentModelGlobalState = {\n\tid: \"powerhouse/document-model\",\n\tname: \"DocumentModel\",\n\textension: \"phdm\",\n\tdescription: \"The Powerhouse Document Model describes the state and operations of a document type.\",\n\tauthor: {\n\t\tname: \"Powerhouse\",\n\t\twebsite: \"https://www.powerhouse.inc/\"\n\t},\n\tspecifications: [{\n\t\tversion: 1,\n\t\tchangeLog: [],\n\t\tstate: {\n\t\t\tglobal: {\n\t\t\t\tschema: \"type CodeExample {\\n    id: ID!\\n    value: String!\\n}\\n\\ntype OperationError {\\n    id: ID!\\n    code: String\\n    name: String\\n    description: String\\n    template: String\\n}\\n\\ntype Operation {\\n    id: ID!\\n    name: String\\n    schema: String\\n    description: String\\n    template: String\\n    errors: [OperationError!]!\\n    examples: [CodeExample!]!\\n    reducer: String\\n    scope: String\\n}\\n\\ntype Module {\\n    id: ID!\\n    name: String!\\n    description: String\\n    operations: [Operation!]!\\n}\\n\\ntype State {\\n    schema: String!\\n    initialValue: String!\\n    examples: [CodeExample!]!\\n}\\n\\ntype ScopeState {\\n    global: State!\\n    local: State!\\n}\\n\\ntype Author {\\n    name: String!\\n    website: String\\n}\\n\\ntype DocumentSpecification {\\n    version: Int!\\n    state: ScopeState!\\n    modules: [Module!]!\\n    changeLog: [String!]!\\n}\\n\\ntype DocumentModelGlobalState {\\n    name: String!\\n    id: String!\\n    extension: String!\\n    description: String!\\n    author: Author!\\n    specifications: [DocumentSpecification!]!\\n}\",\n\t\t\t\tinitialValue: \"{\\n    \\\"id\\\": \\\"\\\",\\n    \\\"name\\\": \\\"\\\",\\n    \\\"extension\\\": \\\"\\\",\\n    \\\"description\\\": \\\"\\\",\\n    \\\"author\\\": {\\n        \\\"name\\\": \\\"\\\",\\n        \\\"website\\\": \\\"\\\"\\n    },\\n    \\\"specifications\\\": [\\n        {\\n            \\\"version\\\": 1,\\n            \\\"changeLog\\\": [],\\n            \\\"state\\\": {\\n                \\\"global\\\": {\\n                    \\\"schema\\\": \\\"\\\",\\n                    \\\"initialValue\\\": \\\"\\\",\\n                    \\\"examples\\\": []\\n                },\\n                \\\"local\\\": {\\n                    \\\"schema\\\": \\\"\\\",\\n                    \\\"initialValue\\\": \\\"\\\",\\n                    \\\"examples\\\": []\\n                }\\n            },\\n            \\\"modules\\\": []\\n        }\\n    ]\\n}\",\n\t\t\t\texamples: []\n\t\t\t},\n\t\t\tlocal: {\n\t\t\t\tschema: \"\",\n\t\t\t\tinitialValue: \"\",\n\t\t\t\texamples: []\n\t\t\t}\n\t\t},\n\t\tmodules: [\n\t\t\t{\n\t\t\t\tname: \"header\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODEL_NAME\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the name of the document model\",\n\t\t\t\t\t\tschema: \"input SetModelNameInput {\\n    name: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODEL_ID\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the unique identifier for the document model\",\n\t\t\t\t\t\tschema: \"input SetModelIdInput {\\n    id: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODEL_EXTENSION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the file extension associated with this document model\",\n\t\t\t\t\t\tschema: \"input SetModelExtensionInput {\\n    extension: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODEL_DESCRIPTION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the description text for the document model\",\n\t\t\t\t\t\tschema: \"input SetModelDescriptionInput {\\n    description: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_AUTHOR_NAME\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the name of the document model author\",\n\t\t\t\t\t\tschema: \"input SetAuthorNameInput {\\n    authorName: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_AUTHOR_WEBSITE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the website URL of the document model author\",\n\t\t\t\t\t\tschema: \"input SetAuthorWebsiteInput {\\n    authorWebsite: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"versioning\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_CHANGE_LOG_ITEM\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new item to the document model changelog\",\n\t\t\t\t\t\tschema: \"input AddChangeLogItemInput {\\n    id: ID!\\n    insertBefore: ID\\n    content: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"UPDATE_CHANGE_LOG_ITEM\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Updates an existing changelog item\",\n\t\t\t\t\t\tschema: \"input UpdateChangeLogItemInput {\\n    id: ID!\\n    newContent: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_CHANGE_LOG_ITEM\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes an item from the document model changelog\",\n\t\t\t\t\t\tschema: \"input DeleteChangeLogItemInput {\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_CHANGE_LOG_ITEMS\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of changelog items\",\n\t\t\t\t\t\tschema: \"input ReorderChangeLogItemsInput {\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"RELEASE_NEW_VERSION\",\n\t\t\t\t\t\tschema: null,\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Creates a new version of the document model specification\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"module\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_MODULE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new module to the document model specification\",\n\t\t\t\t\t\tschema: \"input AddModuleInput {\\n    id: ID!\\n    name: String!\\n    description: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODULE_NAME\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the name of an existing module\",\n\t\t\t\t\t\tschema: \"input SetModuleNameInput {\\n    id: ID!\\n    name: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_MODULE_DESCRIPTION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the description of an existing module\",\n\t\t\t\t\t\tschema: \"input SetModuleDescriptionInput {\\n    id: ID!\\n    description: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_MODULE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes a module from the document model specification\",\n\t\t\t\t\t\tschema: \"input DeleteModuleInput {\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_MODULES\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of modules in the document model specification\",\n\t\t\t\t\t\tschema: \"input ReorderModulesInput {\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"operation-error\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_OPERATION_ERROR\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new error definition to an operation\",\n\t\t\t\t\t\tschema: \"input AddOperationErrorInput {\\n    operationId: ID!\\n    id: ID!\\n    errorCode: String\\n    errorName: String\\n    errorDescription: String\\n    errorTemplate: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_ERROR_CODE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the error code for an operation error\",\n\t\t\t\t\t\tschema: \"input SetOperationErrorCodeInput {\\n    id: ID!\\n    errorCode: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_ERROR_NAME\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the name of an operation error\",\n\t\t\t\t\t\tschema: \"input SetOperationErrorNameInput {\\n    id: ID!\\n    errorName: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_ERROR_DESCRIPTION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the description of an operation error\",\n\t\t\t\t\t\tschema: \"input SetOperationErrorDescriptionInput {\\n    id: ID!\\n    errorDescription: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_ERROR_TEMPLATE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the template for an operation error\",\n\t\t\t\t\t\tschema: \"input SetOperationErrorTemplateInput {\\n    id: ID!\\n    errorTemplate: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_OPERATION_ERROR\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes an error definition from an operation\",\n\t\t\t\t\t\tschema: \"input DeleteOperationErrorInput {\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_OPERATION_ERRORS\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of error definitions for an operation\",\n\t\t\t\t\t\tschema: \"input ReorderOperationErrorsInput {\\n    operationId: ID!\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"operation-example\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_OPERATION_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new code example to an operation\",\n\t\t\t\t\t\tschema: \"input AddOperationExampleInput {\\n    operationId: ID!\\n    id: ID!\\n    example: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"UPDATE_OPERATION_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Updates an existing code example for an operation\",\n\t\t\t\t\t\tschema: \"input UpdateOperationExampleInput {\\n    id: ID!\\n    example: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_OPERATION_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes a code example from an operation\",\n\t\t\t\t\t\tschema: \"input DeleteOperationExampleInput {\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_OPERATION_EXAMPLES\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of code examples for an operation\",\n\t\t\t\t\t\tschema: \"input ReorderOperationExamplesInput {\\n    operationId: ID!\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"operation\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_OPERATION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new operation to a module\",\n\t\t\t\t\t\tschema: \"input AddOperationInput {\\n    moduleId: ID!\\n    id: ID!\\n    name: String!\\n    schema: String\\n    description: String\\n    template: String\\n    reducer: String\\n    scope: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_NAME\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the name of an operation\",\n\t\t\t\t\t\tschema: \"input SetOperationNameInput {\\n    id: ID!\\n    name: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_SCHEMA\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the GraphQL schema definition for an operation's input\",\n\t\t\t\t\t\tschema: \"input SetOperationSchemaInput {\\n    id: ID!\\n    schema: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_DESCRIPTION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the description of an operation\",\n\t\t\t\t\t\tschema: \"input SetOperationDescriptionInput {\\n    id: ID!\\n    description: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_TEMPLATE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the template code for an operation\",\n\t\t\t\t\t\tschema: \"input SetOperationTemplateInput {\\n    id: ID!\\n    template: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_REDUCER\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the reducer function code for an operation\",\n\t\t\t\t\t\tschema: \"input SetOperationReducerInput {\\n    id: ID!\\n    reducer: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_OPERATION_SCOPE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the scope of an operation (global or local)\",\n\t\t\t\t\t\tschema: \"input SetOperationScopeInput {\\n    id: ID!\\n    scope: String\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"MOVE_OPERATION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Moves an operation from one module to another\",\n\t\t\t\t\t\tschema: \"input MoveOperationInput {\\n    operationId: ID!\\n    newModuleId: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_OPERATION\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes an operation from a module\",\n\t\t\t\t\t\tschema: \"input DeleteOperationInput {\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_MODULE_OPERATIONS\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of operations within a module\",\n\t\t\t\t\t\tschema: \"input ReorderModuleOperationsInput {\\n    moduleId: ID!\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"state\",\n\t\t\t\toperations: [\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_STATE_SCHEMA\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the GraphQL schema definition for document state\",\n\t\t\t\t\t\tschema: \"input SetStateSchemaInput {\\n    scope: String!\\n    schema: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"SET_INITIAL_STATE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Sets the initial state value for a document scope\",\n\t\t\t\t\t\tschema: \"input SetInitialStateInput {\\n    scope: String!\\n    initialValue: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"ADD_STATE_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Adds a new state example to a document scope\",\n\t\t\t\t\t\tschema: \"input AddStateExampleInput {\\n    scope: String!\\n    id: ID!\\n    insertBefore: ID\\n    example: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"UPDATE_STATE_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Updates an existing state example for a document scope\",\n\t\t\t\t\t\tschema: \"input UpdateStateExampleInput {\\n    scope: String!\\n    id: ID!\\n    newExample: String!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"DELETE_STATE_EXAMPLE\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Removes a state example from a document scope\",\n\t\t\t\t\t\tschema: \"input DeleteStateExampleInput {\\n    scope: String!\\n    id: ID!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tname: \"REORDER_STATE_EXAMPLES\",\n\t\t\t\t\t\tid: \"\",\n\t\t\t\t\t\tdescription: \"Changes the order of state examples for a document scope\",\n\t\t\t\t\t\tschema: \"input ReorderStateExamplesInput {\\n    scope: String!\\n    order: [ID!]!\\n}\",\n\t\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\t\treducer: \"\",\n\t\t\t\t\t\texamples: [],\n\t\t\t\t\t\terrors: [],\n\t\t\t\t\t\tscope: \"global\"\n\t\t\t\t\t}\n\t\t\t\t],\n\t\t\t\tid: \"\",\n\t\t\t\tdescription: \"\"\n\t\t\t}\n\t\t]\n\t}]\n};\nconst HASH_ALGORITHM_SHA1 = \"sha1\";\nconst HASH_ALGORITHM_SHA256 = \"sha256\";\nconst HASH_ALGORITHM_SHA512 = \"sha512\";\nconst HASH_ENCODING_BASE64 = \"base64\";\nconst HASH_ENCODING_HEX = \"hex\";\n//#endregion\n//#region document-model/document-type.ts\nconst documentModelDocumentType = \"powerhouse/document-model\";\n//#endregion\n//#region document-model/document-schema.ts\nconst BaseDocumentHeaderSchema = z.object({\n\tid: z.string(),\n\tname: z.string(),\n\tcreatedAtUtcIso: z.string(),\n\tlastModifiedAtUtcIso: z.string(),\n\tdocumentType: z.string()\n});\nconst BaseDocumentStateSchema = z.object({ global: z.unknown() });\n/** Schema for validating the header object of a DocumentModel document */\nconst DocumentModelHeaderSchema = BaseDocumentHeaderSchema.extend({ documentType: z.literal(documentModelDocumentType) });\n/** Schema for validating the state object of a DocumentModel document */\nconst DocumentModelPHStateSchema = BaseDocumentStateSchema.extend({ global: DocumentModelGlobalStateSchema() });\nconst DocumentModelSchema = z.object({\n\theader: DocumentModelHeaderSchema,\n\tstate: DocumentModelPHStateSchema,\n\tinitialState: DocumentModelPHStateSchema\n});\n/** Simple helper function to check if a state object is a DocumentModel document state object */\nfunction isDocumentModelState(state) {\n\treturn DocumentModelPHStateSchema.safeParse(state).success;\n}\n/** Simple helper function to assert that a document state object is a DocumentModel document state object */\nfunction assertIsDocumentModelState(state) {\n\tDocumentModelPHStateSchema.parse(state);\n}\n/** Simple helper function to check if a document is a DocumentModel document */\nfunction isDocumentModelDocument(document) {\n\treturn DocumentModelSchema.safeParse(document).success;\n}\n/** Simple helper function to assert that a document is a DocumentModel document */\nfunction assertIsDocumentModelDocument(document) {\n\tDocumentModelSchema.parse(document);\n}\n//#endregion\n//#region document-model/header.ts\n/**\n* Generates a deterministic payload from signing parameters\n*/\nconst generateStablePayload = (parameters) => `${parameters.documentType}:${parameters.createdAtUtcIso}:${parameters.nonce}`;\n/**\n* Creates a verification-only signer from a public key.\n* This signer can only verify signatures, not sign data.\n*\n* @param pubKey - The public key to use for verification.\n* @returns An ISigner that can only verify signatures.\n*/\nasync function createVerificationSigner(pubKey) {\n\tconst cryptoKey = await crypto.subtle.importKey(\"jwk\", pubKey, {\n\t\tname: \"ECDSA\",\n\t\tnamedCurve: \"P-256\"\n\t}, true, [\"verify\"]);\n\treturn {\n\t\tpublicKey: cryptoKey,\n\t\tasync sign(_data) {\n\t\t\tthrow new Error(\"verification-only signer cannot sign data\");\n\t\t},\n\t\tasync signAction(_action, _abortSignal) {\n\t\t\tthrow new Error(\"verification-only signer cannot sign actions\");\n\t\t},\n\t\tasync verify(data, signature) {\n\t\t\tlet isValid;\n\t\t\ttry {\n\t\t\t\tisValid = await crypto.subtle.verify({\n\t\t\t\t\tname: \"ECDSA\",\n\t\t\t\t\thash: \"SHA-256\"\n\t\t\t\t}, cryptoKey, new Uint8Array(signature), new Uint8Array(data));\n\t\t\t} catch {\n\t\t\t\tthrow new Error(\"invalid signature\");\n\t\t\t}\n\t\t\tif (!isValid) throw new Error(\"invalid signature\");\n\t\t}\n\t};\n}\n/**\n* Creates a verification-only signer from a header.\n*\n* @param header - The header to create a signer from.\n* @returns A signer that can verify the header's signature.\n*/\nconst createSignerFromHeader = async (header) => {\n\treturn createVerificationSigner(header.sig.publicKey);\n};\n/**\n* Signs a header. Generally, this is not called directly, but rather through\n* {@link createSignedHeader}.\n*\n* @param parameters - The parameters used to sign the header.\n* @param signer - The signer of the document.\n*\n* @returns The signature of the header.\n*/\nconst sign = async (parameters, signer) => {\n\tconst payload = generateStablePayload(parameters);\n\tconst data = new TextEncoder().encode(payload);\n\tconst signature = await signer.sign(data);\n\tconst signatureArray = new Uint8Array(signature);\n\treturn btoa(String.fromCharCode(...signatureArray));\n};\n/**\n* Verifies a header signature. Generally, this is not called directly, but\n* rather through {@link validateHeader}.\n*\n* @param parameters - The parameters used to sign the header.\n* @param signature - The signature to verify.\n* @param signer - The signer of the document.\n*/\nconst verify = async (parameters, signature, signer) => {\n\tconst payload = generateStablePayload(parameters);\n\tconst data = new TextEncoder().encode(payload);\n\tconst signatureBytes = Uint8Array.from(atob(signature), (c) => c.charCodeAt(0));\n\tawait signer.verify(data, signatureBytes);\n};\n/**\n* Validates a header signature.\n*/\nconst validateHeader = async (header) => {\n\tconst signer = await createSignerFromHeader(header);\n\treturn verify({\n\t\tdocumentType: header.documentType,\n\t\tcreatedAtUtcIso: header.createdAtUtcIso,\n\t\tnonce: header.sig.nonce\n\t}, header.id, signer);\n};\n/**\n* Creates a header that has yet to be signed. This header is not valid, but\n* can be input into {@link createSignedHeader} to create a signed header.\n*\n* @returns An unsigned header for a document.\n*/\nconst createPresignedHeader = (id = generateId(), documentType = \"\") => {\n\treturn {\n\t\tid,\n\t\tsig: {\n\t\t\tpublicKey: {},\n\t\t\tnonce: \"\"\n\t\t},\n\t\tdocumentType,\n\t\tcreatedAtUtcIso: (/* @__PURE__ */ new Date()).toISOString(),\n\t\tslug: \"\",\n\t\tname: \"\",\n\t\tbranch: \"main\",\n\t\trevision: { document: 0 },\n\t\tlastModifiedAtUtcIso: (/* @__PURE__ */ new Date()).toISOString(),\n\t\tmeta: {}\n\t};\n};\n/**\n* Creates a new, signed header for a document. This will replace the id of the\n* document.\n*\n* @param unsignedHeader - The unsigned header to created the signed header from.\n* @param signer - The signer of the document.\n*\n* @returns A new signed header for a document. Some fields are mutable and\n* some are not. See the PHDocumentHeader type for more information.\n*/\nconst createSignedHeader = async (unsignedHeader, documentType, signer) => {\n\tconst parameters = {\n\t\tdocumentType,\n\t\tcreatedAtUtcIso: unsignedHeader.createdAtUtcIso,\n\t\tnonce: generateId()\n\t};\n\treturn {\n\t\tid: await sign(parameters, signer),\n\t\tsig: {\n\t\t\tpublicKey: await crypto.subtle.exportKey(\"jwk\", signer.publicKey),\n\t\t\tnonce: parameters.nonce\n\t\t},\n\t\tdocumentType,\n\t\tcreatedAtUtcIso: unsignedHeader.createdAtUtcIso,\n\t\tslug: unsignedHeader.slug,\n\t\tname: unsignedHeader.name,\n\t\tbranch: unsignedHeader.branch,\n\t\trevision: unsignedHeader.revision,\n\t\tlastModifiedAtUtcIso: unsignedHeader.lastModifiedAtUtcIso,\n\t\tmeta: unsignedHeader.meta\n\t};\n};\n/**\n* Creates a signed header for a document. The document header requires a signer\n* as the document id is a cryptographic signature.\n*\n* @param documentType - The type of the document.\n* @param signer - The signer of the document.\n*\n* @returns The signed header for a document. Some fields are mutable and\n* some are not. See the PHDocumentHeader type for more information.\n*/\nconst createSignedHeaderForSigner = async (documentType, signer) => {\n\treturn await createSignedHeader(createPresignedHeader(), documentType, signer);\n};\n//#endregion\n//#region document-model/documents.ts\nfunction isNoopOperation(op) {\n\treturn op.type === \"NOOP\" && op.skip !== void 0 && op.skip > 0 && op.hash !== void 0;\n}\nfunction isUndoRedo(action) {\n\treturn [\"UNDO\", \"REDO\"].includes(action.type);\n}\nfunction isUndo(action) {\n\treturn action.type === \"UNDO\";\n}\nfunction isDocumentAction(action) {\n\treturn [\n\t\t\"SET_NAME\",\n\t\t\"SET_PREFERRED_EDITOR\",\n\t\t\"UNDO\",\n\t\t\"REDO\",\n\t\t\"PRUNE\",\n\t\t\"LOAD_STATE\"\n\t].includes(action.type);\n}\n/**\n* The document-scope operations a reactor mints on `create`, so a standalone\n* document carries its initial state when exported outside a reactor.\n*/\nfunction createDocumentScopeOperations(header, state) {\n\tconst createInput = {\n\t\tmodel: header.documentType,\n\t\tversion: 0,\n\t\tdocumentId: header.id,\n\t\tsigning: {\n\t\t\tsignature: header.id,\n\t\t\tpublicKey: header.sig.publicKey,\n\t\t\tnonce: header.sig.nonce,\n\t\t\tcreatedAtUtcIso: header.createdAtUtcIso,\n\t\t\tdocumentType: header.documentType\n\t\t},\n\t\tslug: header.slug,\n\t\tname: header.name,\n\t\tbranch: header.branch,\n\t\tmeta: header.meta,\n\t\tprotocolVersions: header.protocolVersions ?? { \"base-reducer\": 2 }\n\t};\n\tconst upgradeInput = {\n\t\tmodel: header.documentType,\n\t\tfromVersion: 0,\n\t\ttoVersion: state.document.version,\n\t\tdocumentId: header.id,\n\t\tinitialState: state\n\t};\n\treturn [{\n\t\tid: generateId(),\n\t\ttype: \"CREATE_DOCUMENT\",\n\t\tscope: \"document\",\n\t\ttimestampUtcMs: header.createdAtUtcIso,\n\t\tinput: createInput\n\t}, {\n\t\tid: generateId(),\n\t\ttype: \"UPGRADE_DOCUMENT\",\n\t\tscope: \"document\",\n\t\ttimestampUtcMs: header.createdAtUtcIso,\n\t\tinput: upgradeInput\n\t}].map((action, index) => ({\n\t\t...action,\n\t\taction,\n\t\tid: deriveOperationId(header.id, \"document\", header.branch, action.id),\n\t\thash: \"\",\n\t\terror: void 0,\n\t\tindex,\n\t\tskip: 0\n\t}));\n}\n/**\n* Creates a new document. When `documentType` is given the header is stamped\n* with it and the document-scope operations are seeded.\n*/\nfunction baseCreateDocument(createState, initialState, documentType = \"\") {\n\tconst state = createState(initialState);\n\tconst header = createPresignedHeader(generateId(), documentType);\n\treturn {\n\t\theader,\n\t\tstate,\n\t\tinitialState: state,\n\t\toperations: documentType ? {\n\t\t\tglobal: [],\n\t\t\tlocal: [],\n\t\t\tdocument: createDocumentScopeOperations(header, state)\n\t\t} : {\n\t\t\tglobal: [],\n\t\t\tlocal: []\n\t\t},\n\t\tclipboard: []\n\t};\n}\nfunction hashDocumentStateForScope(document, scope = \"global\") {\n\treturn hashBrowser(stringify(document.state[scope] || \"\"));\n}\nfunction readOnly(value) {\n\treturn Object.freeze(value);\n}\n/**\n* Maps skipped operations in an array of operations.\n* Skipped operations are operations that are ignored during processing.\n* @param operations - The array of operations to map.\n* @param skippedHeadOperations - The number of operations to skip at the head of the array of operations.\n* @returns An array of mapped operations with ignore flag indicating if the operation is skipped.\n* @throws Error if the operation index is invalid and there are missing operations.\n*/\nfunction mapSkippedOperations(operations, skippedHeadOperations) {\n\tconst ops = [...operations];\n\tlet skipped = skippedHeadOperations || 0;\n\tlet latestOpIndex = ops.length > 0 ? ops[ops.length - 1].index : 0;\n\tconst scopeOpsWithIgnore = [];\n\tfor (const operation of ops.reverse()) {\n\t\tif (skipped > 0) {\n\t\t\tconst operationsDiff = latestOpIndex - operation.index;\n\t\t\tskipped -= operationsDiff;\n\t\t}\n\t\tif (skipped < 0) throw new Error(\"Invalid operation index, missing operations\");\n\t\tconst mappedOp = {\n\t\t\tignore: skipped > 0,\n\t\t\toperation\n\t\t};\n\t\tconst operationSkip = operation.skip > 0 ? operation.skip + 1 : 0;\n\t\tif (operationSkip > 0 && operationSkip > skipped) {\n\t\t\tconst skipDiff = operationSkip - skipped;\n\t\t\tskipped = skipped + skipDiff;\n\t\t}\n\t\tlatestOpIndex = operation.index;\n\t\tscopeOpsWithIgnore.push(mappedOp);\n\t}\n\treturn scopeOpsWithIgnore.reverse();\n}\n/**\n* V2 version of mapSkippedOperations for protocol version 2+.\n* In V2, all NOOPs have skip=1 and consecutive NOOPs form chains.\n* N consecutive NOOPs at any point skip N preceding content operations.\n*\n* Algorithm: Process from end to start\n* - When hitting a NOOP: increment chain length, mark as ignored\n* - When hitting a non-NOOP:\n*   - If chain > 0: decrement chain, mark as ignored (this op was undone)\n*   - If chain == 0: mark as not ignored (apply this op)\n*/\nfunction mapSkippedOperationsV2(operations) {\n\tconst ops = [...operations];\n\tconst result = [];\n\tlet noopChainLength = 0;\n\tfor (let i = ops.length - 1; i >= 0; i--) {\n\t\tconst operation = ops[i];\n\t\tif (operation.action.type === \"NOOP\") {\n\t\t\tnoopChainLength++;\n\t\t\tresult.unshift({\n\t\t\t\tignore: true,\n\t\t\t\toperation\n\t\t\t});\n\t\t} else if (noopChainLength > 0) {\n\t\t\tnoopChainLength--;\n\t\t\tresult.unshift({\n\t\t\t\tignore: true,\n\t\t\t\toperation\n\t\t\t});\n\t\t} else result.unshift({\n\t\t\tignore: false,\n\t\t\toperation\n\t\t});\n\t}\n\treturn result;\n}\n/**\n* V2 garbage collect that returns only operations that should be applied for state.\n* Uses the V2 model where consecutive NOOPs form chains.\n* Unlike V1 garbageCollect, this preserves ALL operations but marks which to apply.\n*/\nfunction garbageCollectV2(sortedOperations) {\n\tconst result = [];\n\tlet noopChainLength = 0;\n\tfor (let i = sortedOperations.length - 1; i >= 0; i--) {\n\t\tconst op = sortedOperations[i];\n\t\tif (\"action\" in op && op.action.type === \"NOOP\" && op.skip > 0) {\n\t\t\tnoopChainLength++;\n\t\t\tresult.unshift(op);\n\t\t} else if (noopChainLength > 0) noopChainLength--;\n\t\telse result.unshift(op);\n\t}\n\treturn result;\n}\nfunction sortMappedOperations(operations) {\n\treturn Object.values(operations).flatMap((array) => array).sort((a, b) => new Date(a.operation.timestampUtcMs).getTime() - new Date(b.operation.timestampUtcMs).getTime());\n}\nconst defaultCreateState = (state) => {\n\treturn state;\n};\nfunction replayDocument(initialState, operations, reducer, header, dispatch, skipHeaderOperations = {}, options) {\n\tconst { checkHashes = true, reuseOperationResultingState, operationResultingStateParser = parseResultingState, skipIndexValidation } = options || {};\n\tlet documentState = initialState;\n\tconst operationsToReplay = [];\n\tconst allScopes = new Set([\n\t\t...Object.keys(operations),\n\t\t\"global\",\n\t\t\"local\"\n\t]);\n\tconst initialOperations = {};\n\tfor (const scope of allScopes) initialOperations[scope] = [];\n\tif (reuseOperationResultingState) for (const [scope, scopeOperations] of Object.entries(operations)) {\n\t\tif (!scopeOperations) continue;\n\t\tconst index = scopeOperations.findLastIndex((s) => !!s.resultingState);\n\t\tif (index < 0) {\n\t\t\toperationsToReplay.push(...scopeOperations);\n\t\t\tcontinue;\n\t\t}\n\t\tconst opWithState = scopeOperations[index];\n\t\tif (!opWithState || !opWithState.resultingState) continue;\n\t\ttry {\n\t\t\tconst scopeState = operationResultingStateParser(opWithState.resultingState);\n\t\t\tdocumentState = {\n\t\t\t\t...documentState,\n\t\t\t\t[scope]: scopeState\n\t\t\t};\n\t\t\tconst scopeInitialOps = initialOperations[scope];\n\t\t\tif (scopeInitialOps) scopeInitialOps.push(...scopeOperations.slice(0, index + 1));\n\t\t\toperationsToReplay.push(...scopeOperations.slice(index + 1));\n\t\t} catch {\n\t\t\toperationsToReplay.push(...scopeOperations);\n\t\t}\n\t}\n\telse operationsToReplay.push(...Object.values(operations).flatMap((ops) => ops || []));\n\tconst document = {\n\t\theader,\n\t\tstate: defaultCreateState(documentState),\n\t\tinitialState,\n\t\toperations: initialOperations,\n\t\tclipboard: []\n\t};\n\tlet result = document;\n\tif (operationsToReplay.length) result = operationsToReplay.reduce((document, operation) => {\n\t\treturn reducer(document, operation.action, dispatch, {\n\t\t\tignoreSkipOperations: true,\n\t\t\tcheckHashes,\n\t\t\tskipIndexValidation,\n\t\t\treplayOptions: { operation }\n\t\t});\n\t}, document);\n\telse for (const scopeOperations of Object.values(initialOperations)) {\n\t\tif (!scopeOperations) continue;\n\t\tconst lastOperation = scopeOperations.at(-1);\n\t\tif (lastOperation) result = updateHeaderRevision(result, lastOperation.action.scope, lastOperation.timestampUtcMs);\n\t}\n\tif (!checkHashes) for (const scope of Object.keys(result.state)) for (let i = operationsToReplay.length - 1; i >= 0; i--) {\n\t\tconst operation = operationsToReplay[i];\n\t\tif (operation.action.scope !== scope) continue;\n\t\tif (operation.hash !== hashDocumentStateForScope(result, scope)) throw new HashMismatchError(scope, result, operation);\n\t\telse break;\n\t}\n\tconst allResultScopes = new Set([\n\t\t...Object.keys(result.operations),\n\t\t...Object.keys(operations),\n\t\t\"global\",\n\t\t\"local\"\n\t]);\n\tconst initialResultOperations = {};\n\tfor (const scope of allResultScopes) initialResultOperations[scope] = [];\n\tconst resultOperations = Array.from(allResultScopes).reduce((acc, scope) => {\n\t\tconst scopeOps = result.operations[scope] || [];\n\t\treturn {\n\t\t\t...acc,\n\t\t\t[scope]: [...scopeOps.map((operation, index) => {\n\t\t\t\treturn {\n\t\t\t\t\t...operation,\n\t\t\t\t\ttimestamp: operations[scope]?.[index]?.timestampUtcMs ?? operation.timestampUtcMs\n\t\t\t\t};\n\t\t\t})]\n\t\t};\n\t}, initialResultOperations);\n\tconst lastModified = header ? header.lastModifiedAtUtcIso : Object.values(resultOperations).reduce((acc, curr) => {\n\t\tif (!curr) return acc;\n\t\tconst operation = curr.at(-1);\n\t\tif (operation) {\n\t\t\tif (operation.timestampUtcMs > acc) return operation.timestampUtcMs;\n\t\t}\n\t\treturn acc;\n\t}, document.header.lastModifiedAtUtcIso);\n\tif (header) result.header = {\n\t\t...header,\n\t\trevision: result.header.revision,\n\t\tlastModifiedAtUtcIso: lastModified\n\t};\n\treturn {\n\t\t...result,\n\t\toperations: resultOperations\n\t};\n}\nfunction parseResultingState(state) {\n\tconst stateType = typeof state;\n\tif (stateType === \"string\") return JSON.parse(state);\n\telse if (stateType === \"object\") return state;\n\telse throw new Error(`Providing resulting state is of type: ${stateType}`);\n}\nlet IntegrityIssueType = /* @__PURE__ */ function(IntegrityIssueType) {\n\tIntegrityIssueType[\"UNEXPECTED_INDEX\"] = \"UNEXPECTED_INDEX\";\n\treturn IntegrityIssueType;\n}({});\nlet IntegrityIssueSubType = /* @__PURE__ */ function(IntegrityIssueSubType) {\n\tIntegrityIssueSubType[\"DUPLICATED_INDEX\"] = \"DUPLICATED_INDEX\";\n\tIntegrityIssueSubType[\"MISSING_INDEX\"] = \"MISSING_INDEX\";\n\treturn IntegrityIssueSubType;\n}({});\nfunction checkCleanedOperationsIntegrity(sortedOperations) {\n\tconst result = [];\n\tlet currentIndex = -1;\n\tfor (const nextOperation of sortedOperations) {\n\t\tconst nextIndex = nextOperation.index - nextOperation.skip;\n\t\tif (nextIndex !== currentIndex + 1) result.push({\n\t\t\toperation: {\n\t\t\t\tindex: nextOperation.index,\n\t\t\t\tskip: nextOperation.skip\n\t\t\t},\n\t\t\tissue: IntegrityIssueType.UNEXPECTED_INDEX,\n\t\t\tcategory: nextIndex > currentIndex + 1 ? IntegrityIssueSubType.MISSING_INDEX : IntegrityIssueSubType.DUPLICATED_INDEX,\n\t\t\tmessage: `Expected index ${currentIndex + 1} with skip 0 or equivalent, got index ${nextOperation.index} with skip ${nextOperation.skip}`\n\t\t});\n\t\tcurrentIndex = nextOperation.index;\n\t}\n\treturn result;\n}\nfunction garbageCollect(sortedOperations) {\n\tconst result = [];\n\tlet i = sortedOperations.length - 1;\n\twhile (i > -1) {\n\t\tresult.unshift(sortedOperations[i]);\n\t\tconst skipUntil = (sortedOperations[i]?.index || 0) - (sortedOperations[i]?.skip || 0) - 1;\n\t\tlet j = i - 1;\n\t\twhile (j > -1 && (sortedOperations[j]?.index || 0) > skipUntil) j--;\n\t\ti = j;\n\t}\n\treturn result;\n}\nfunction addUndo(sortedOperations) {\n\tconst operationsCopy = [...sortedOperations];\n\tconst latestOperation = operationsCopy[operationsCopy.length - 1];\n\tif (!latestOperation) return operationsCopy;\n\tif (latestOperation.action.type === \"NOOP\") operationsCopy.push({\n\t\t...latestOperation,\n\t\tindex: latestOperation.index,\n\t\tskip: nextSkipNumber(sortedOperations),\n\t\taction: {\n\t\t\t...latestOperation.action,\n\t\t\tid: generateId(),\n\t\t\ttimestampUtcMs: (/* @__PURE__ */ new Date()).toISOString(),\n\t\t\ttype: \"NOOP\"\n\t\t}\n\t});\n\telse operationsCopy.push({\n\t\tid: generateId(),\n\t\ttimestampUtcMs: (/* @__PURE__ */ new Date()).toISOString(),\n\t\tindex: latestOperation.index + 1,\n\t\tskip: 1,\n\t\thash: latestOperation.hash,\n\t\taction: {\n\t\t\tid: generateId(),\n\t\t\ttimestampUtcMs: (/* @__PURE__ */ new Date()).toISOString(),\n\t\t\ttype: \"NOOP\",\n\t\t\tinput: {},\n\t\t\tscope: latestOperation.action.scope\n\t\t}\n\t});\n\treturn operationsCopy;\n}\nfunction sortOperations(operations) {\n\treturn operations.slice().sort((a, b) => a.skip - b.skip).sort((a, b) => a.index - b.index);\n}\nfunction reshuffleByTimestamp(startIndex, opsA, opsB) {\n\treturn [...opsA, ...opsB].sort((a, b) => {\n\t\tconst timestampDiff = new Date(a.timestampUtcMs || \"\").getTime() - new Date(b.timestampUtcMs || \"\").getTime();\n\t\tif (timestampDiff !== 0) return timestampDiff;\n\t\treturn (a.id || \"\").localeCompare(b.id || \"\");\n\t}).map((op, i) => ({\n\t\t...op,\n\t\tindex: startIndex.index + i,\n\t\tskip: i === 0 ? startIndex.skip : 0\n\t}));\n}\nfunction reshuffleByTimestampAndIndex(startIndex, opsA, opsB) {\n\treturn [...opsA, ...opsB].sort((a, b) => {\n\t\tconst indexDiff = a.index - b.index;\n\t\tif (indexDiff !== 0) return indexDiff;\n\t\tconst timestampDiff = new Date(a.timestampUtcMs || \"\").getTime() - new Date(b.timestampUtcMs || \"\").getTime();\n\t\tif (timestampDiff !== 0) return timestampDiff;\n\t\treturn (a.id || \"\").localeCompare(b.id || \"\");\n\t}).map((op, i) => ({\n\t\t...op,\n\t\tindex: startIndex.index + i,\n\t\tskip: i === 0 ? startIndex.skip : 0\n\t}));\n}\nfunction operationsAreEqual(op1, op2) {\n\tconst a = op1;\n\tconst b = op2;\n\tconst aComparable = {\n\t\tindex: a.index,\n\t\tskip: a.skip,\n\t\ttype: a.type ?? null,\n\t\tscope: a.scope ?? null,\n\t\tinput: a.input ?? null\n\t};\n\tconst bComparable = {\n\t\tindex: b.index,\n\t\tskip: b.skip,\n\t\ttype: b.type ?? null,\n\t\tscope: b.scope ?? null,\n\t\tinput: b.input ?? null\n\t};\n\treturn stringify(aComparable) === stringify(bComparable);\n}\nfunction attachBranch(trunk, newBranch) {\n\tconst trunkCopy = garbageCollect(sortOperations(trunk.slice()));\n\tconst newOperations = garbageCollect(sortOperations(newBranch.slice()));\n\tif (trunkCopy.length < 1) return [newOperations, []];\n\tconst result = [];\n\tlet enteredBranch = false;\n\twhile (newOperations.length > 0) {\n\t\tconst newOperationCandidate = newOperations[0];\n\t\tlet nextTrunkOperation = trunkCopy.shift();\n\t\twhile (nextTrunkOperation && precedes(nextTrunkOperation, newOperationCandidate)) {\n\t\t\tresult.push(nextTrunkOperation);\n\t\t\tnextTrunkOperation = trunkCopy.shift();\n\t\t}\n\t\tif (!nextTrunkOperation) enteredBranch = true;\n\t\telse if (!enteredBranch) if (operationsAreEqual(nextTrunkOperation, newOperationCandidate)) {\n\t\t\tnewOperations.shift();\n\t\t\tresult.push(nextTrunkOperation);\n\t\t} else {\n\t\t\ttrunkCopy.unshift(nextTrunkOperation);\n\t\t\tenteredBranch = true;\n\t\t}\n\t\tif (enteredBranch) {\n\t\t\tlet nextAppend = newOperations.shift();\n\t\t\twhile (nextAppend) {\n\t\t\t\tresult.push(nextAppend);\n\t\t\t\tnextAppend = newOperations.shift();\n\t\t\t}\n\t\t}\n\t}\n\tif (!enteredBranch) {\n\t\tlet nextAppend = trunkCopy.shift();\n\t\twhile (nextAppend) {\n\t\t\tresult.push(nextAppend);\n\t\t\tnextAppend = trunkCopy.shift();\n\t\t}\n\t}\n\treturn [garbageCollect(result), trunkCopy];\n}\nfunction precedes(op1, op2) {\n\treturn op1.index < op2.index || op1.index === op2.index && op1.id === op2.id && op1.skip < op2.skip;\n}\nfunction split(sortedTargetOperations, sortedMergeOperations) {\n\tconst commonOperations = [];\n\tconst targetDiffOperations = [];\n\tconst mergeDiffOperations = [];\n\tconst maxLength = Math.max(sortedTargetOperations.length, sortedMergeOperations.length);\n\tlet splitHappened = false;\n\tfor (let i = 0; i < maxLength; i++) {\n\t\tconst targetOperation = sortedTargetOperations[i];\n\t\tconst mergeOperation = sortedMergeOperations[i];\n\t\tif (targetOperation && mergeOperation) if (!splitHappened && operationsAreEqual(targetOperation, mergeOperation)) commonOperations.push(targetOperation);\n\t\telse {\n\t\t\tsplitHappened = true;\n\t\t\ttargetDiffOperations.push(targetOperation);\n\t\t\tmergeDiffOperations.push(mergeOperation);\n\t\t}\n\t\telse if (targetOperation) targetDiffOperations.push(targetOperation);\n\t\telse if (mergeOperation) mergeDiffOperations.push(mergeOperation);\n\t}\n\treturn [\n\t\tcommonOperations,\n\t\ttargetDiffOperations,\n\t\tmergeDiffOperations\n\t];\n}\nfunction merge(sortedTargetOperations, sortedMergeOperations, reshuffle) {\n\tconst [_commonOperations, _targetOperations, _mergeOperations] = split(garbageCollect(sortedTargetOperations), garbageCollect(sortedMergeOperations));\n\tconst maxCommonIndex = getMaxIndex(_commonOperations);\n\tconst nextIndex = 1 + Math.max(maxCommonIndex, getMaxIndex(_targetOperations), getMaxIndex(_mergeOperations));\n\tconst filteredMergeOperations = filterDuplicatedOperations(_mergeOperations, _targetOperations);\n\tconst newOperationHistory = reshuffle({\n\t\tindex: nextIndex,\n\t\tskip: nextIndex - (maxCommonIndex + 1)\n\t}, _targetOperations, filteredMergeOperations);\n\treturn _commonOperations.concat(newOperationHistory);\n}\nfunction getMaxIndex(sortedOperations) {\n\tconst lastElement = sortedOperations[sortedOperations.length - 1];\n\tif (!lastElement) return -1;\n\treturn lastElement.index;\n}\nfunction nextSkipNumber(sortedOperations) {\n\tif (sortedOperations.length < 1) return -1;\n\tconst cleanedOperations = garbageCollect(sortedOperations);\n\tlet nextSkip = (cleanedOperations[cleanedOperations.length - 1]?.skip || 0) + 1;\n\tif (cleanedOperations.length > 1) nextSkip += cleanedOperations[cleanedOperations.length - 2]?.skip || 0;\n\treturn (cleanedOperations[cleanedOperations.length - 1]?.index || -1) < nextSkip ? -1 : nextSkip;\n}\nfunction checkOperationsIntegrity(operations) {\n\treturn checkCleanedOperationsIntegrity(garbageCollect(sortOperations(operations)));\n}\nfunction groupOperationsByScope(operations) {\n\treturn operations.reduce((acc, operation) => {\n\t\tif (!acc[operation.action.scope]) acc[operation.action.scope] = [];\n\t\tacc[operation.action.scope]?.push(operation);\n\t\treturn acc;\n\t}, {});\n}\nfunction prepareOperations(operationsHistory, newOperations) {\n\tconst result = {\n\t\tintegrityIssues: [],\n\t\tvalidOperations: [],\n\t\tinvalidOperations: [],\n\t\tduplicatedOperations: []\n\t};\n\tconst sortedOperationsHistory = sortOperations(operationsHistory);\n\tconst sortedOperations = sortOperations(newOperations);\n\tconst integrityErrors = checkCleanedOperationsIntegrity([...sortedOperationsHistory, ...sortedOperations]);\n\tconst firstMissingIndexOperation = [...integrityErrors.filter((integrityIssue) => integrityIssue.category === IntegrityIssueSubType.MISSING_INDEX)].sort((a, b) => b.operation.index - a.operation.index).pop()?.operation;\n\tfor (const newOperation of sortedOperations) {\n\t\tif (firstMissingIndexOperation && newOperation.index >= firstMissingIndexOperation.index) {\n\t\t\tresult.invalidOperations.push(newOperation);\n\t\t\tcontinue;\n\t\t}\n\t\tif (integrityErrors.some((integrityError) => {\n\t\t\treturn integrityError.operation.index === newOperation.index && integrityError.operation.skip === newOperation.skip && integrityError.category === IntegrityIssueSubType.DUPLICATED_INDEX;\n\t\t})) {\n\t\t\tresult.duplicatedOperations.push(newOperation);\n\t\t\tcontinue;\n\t\t}\n\t\tresult.validOperations.push(newOperation);\n\t}\n\tresult.integrityIssues.push(...integrityErrors);\n\treturn result;\n}\nfunction removeExistingOperations(newOperations, operationsHistory) {\n\treturn newOperations.filter((newOperation) => {\n\t\treturn !operationsHistory.some((historyOperation) => {\n\t\t\treturn newOperation.action.type === \"NOOP\" && newOperation.skip === 0 && newOperation.index === historyOperation.index || newOperation.index === historyOperation.index && newOperation.skip === historyOperation.skip && newOperation.action.scope === historyOperation.action.scope && newOperation.hash === historyOperation.hash && newOperation.action.type === historyOperation.action.type;\n\t\t});\n\t});\n}\n/**\n* Skips header operations and returns the remaining operations.\n*\n* @param operations - The array of operations.\n* @param skipHeaderOperation - The skip header operation index.\n* @returns The remaining operations after skipping header operations.\n*/\nfunction skipHeaderOperations(operations, skipHeaderOperation) {\n\tconst lastIndex = sortOperations(operations).at(-1)?.index ?? -1;\n\tconst nextIndex = lastIndex + 1;\n\tconst skipOperationIndex = {\n\t\t...skipHeaderOperation,\n\t\tindex: skipHeaderOperation.index ?? nextIndex\n\t};\n\tif (skipOperationIndex.index < lastIndex) throw new Error(`The skip header operation index must be greater than or equal to ${lastIndex}`);\n\treturn garbageCollect(sortOperations([...operations, skipOperationIndex])).slice(0, -1);\n}\nfunction garbageCollectDocumentOperations(documentOperations) {\n\treturn Object.entries(documentOperations).reduce((acc, entry) => {\n\t\tconst [scope, ops] = entry;\n\t\tif (!ops) return acc;\n\t\treturn {\n\t\t\t...acc,\n\t\t\t[scope]: garbageCollect(sortOperations(ops))\n\t\t};\n\t}, {});\n}\n/**\n* Filters out duplicated operations from the target operations array based on their IDs.\n* If an operation has an ID, it is considered duplicated if there is another operation in the source operations array with the same ID.\n* If an operation does not have an ID, it is considered unique and will not be filtered out.\n* @param targetOperations - The array of target operations to filter.\n* @param sourceOperations - The array of source operations to compare against.\n* @returns An array of operations with duplicates filtered out.\n*/\nfunction filterDuplicatedOperations(targetOperations, sourceOperations) {\n\treturn targetOperations.filter((op) => {\n\t\tif (op.id) return !sourceOperations.some((targetOp) => targetOp.id === op.id);\n\t\treturn true;\n\t});\n}\nfunction filterDocumentOperationsResultingState(documentOperations) {\n\tif (!documentOperations) return {};\n\treturn Object.entries(documentOperations).reduce((acc, [scope, operations]) => {\n\t\tif (!operations) return acc;\n\t\treturn {\n\t\t\t...acc,\n\t\t\t[scope]: operations.map((op) => {\n\t\t\t\tconst { resultingState, ...restProps } = op;\n\t\t\t\treturn restProps;\n\t\t\t})\n\t\t};\n\t}, {});\n}\n/**\n* Calculates the difference between two arrays of operations.\n* Returns an array of operations that are present in `clearedOperationsA` but not in `clearedOperationsB`.\n*\n* @template TOp - The type of the operations.\n* @param {TOp[]} clearedOperationsA - The first array of operations.\n* @param {TOp[]} clearedOperationsB - The second array of operations.\n* @returns {TOp[]} - The difference between the two arrays of operations.\n*/\nfunction diffOperations(clearedOperationsA, clearedOperationsB) {\n\treturn clearedOperationsA.filter((operationA) => !clearedOperationsB.some((operationB) => operationA.index === operationB.index));\n}\nfunction getDocumentLastModified(document) {\n\tlet latest;\n\tfor (const ops of Object.values(document.operations)) {\n\t\tif (!ops) continue;\n\t\tfor (const op of ops) if (!latest || op.index > latest.index || op.index === latest.index && op.skip > latest.skip) latest = op;\n\t}\n\treturn latest?.timestampUtcMs || document.header.lastModifiedAtUtcIso;\n}\n/**\n* Gets the next revision number based on the provided scope.\n*\n* @param state The current state of the document.\n* @param scope The scope of the operation.\n* @returns The next revision number.\n*/\nfunction getNextRevision(document, scope) {\n\treturn (document.operations[scope]?.at(-1)?.index ?? -1) + 1;\n}\n/**\n* Updates the document header with the latest revision number and\n* date of last modification.\n*\n* @param document The current state of the document.\n* @param scope The scope of the operation.\n* @param lastModifiedTimestamp Optional timestamp to use directly, avoiding a scan of all operations.\n* @returns The updated document state.\n*/\nfunction updateHeaderRevision(document, scope, lastModifiedTimestamp) {\n\tconst newTimestamp = lastModifiedTimestamp ?? getDocumentLastModified(document);\n\tconst currentTimestamp = document.header.lastModifiedAtUtcIso;\n\tconst header = {\n\t\t...document.header,\n\t\trevision: {\n\t\t\t...document.header.revision,\n\t\t\t[scope]: getNextRevision(document, scope)\n\t\t},\n\t\tlastModifiedAtUtcIso: !currentTimestamp || newTimestamp > currentTimestamp ? newTimestamp : currentTimestamp\n\t};\n\treturn {\n\t\t...document,\n\t\theader\n\t};\n}\n//#endregion\n//#region document-model/operations.ts\nfunction setNameOperation(document, input) {\n\treturn {\n\t\t...document,\n\t\theader: {\n\t\t\t...document.header,\n\t\t\tname: input.name\n\t\t}\n\t};\n}\nfunction setPreferredEditorOperation(document, input) {\n\tconst existingMeta = document.header.meta ?? {};\n\tif (input.preferredEditor) return {\n\t\t...document,\n\t\theader: {\n\t\t\t...document.header,\n\t\t\tmeta: {\n\t\t\t\t...existingMeta,\n\t\t\t\tpreferredEditor: input.preferredEditor\n\t\t\t}\n\t\t}\n\t};\n\tconst { preferredEditor: _removed, ...rest } = existingMeta;\n\treturn {\n\t\t...document,\n\t\theader: {\n\t\t\t...document.header,\n\t\t\tmeta: rest\n\t\t}\n\t};\n}\nfunction undoOperation(document, action, skip) {\n\tconst { scope } = action;\n\treturn create({\n\t\tdocument,\n\t\taction,\n\t\tskip,\n\t\treuseLastOperationIndex: false\n\t}, (draft) => {\n\t\tconst sortedOperations = sortOperations([...document.operations[scope]]);\n\t\tdraft.action = noop(scope);\n\t\tconst lastOperation = sortedOperations.at(-1);\n\t\tlet nextIndex = lastOperation?.index ?? -1;\n\t\tconst isNewNoop = lastOperation?.action.type !== \"NOOP\";\n\t\tif (isNewNoop) nextIndex = nextIndex + 1;\n\t\telse draft.reuseLastOperationIndex = true;\n\t\tdraft.skip = nextSkipNumber(isNewNoop ? [...sortedOperations, {\n\t\t\tindex: nextIndex,\n\t\t\tskip: 0\n\t\t}] : sortedOperations);\n\t\tif (lastOperation && draft.skip > lastOperation.skip + 1) draft.skip = draft.skip + 1;\n\t\tif (draft.skip < 0) throw new Error(`Cannot undo: you can't undo more operations than the ones in the scope history`);\n\t});\n}\n/**\n* V2 of undoOperation for protocol version 2+.\n* Key differences from undoOperation:\n* - Never reuses operation index (always increments)\n* - Always sets skip=1 (consecutive NOOPs are handled during rebuild/GC)\n* - No complex skip calculation - simpler model where each UNDO is independent\n*/\nfunction undoOperationV2(document, action, skip) {\n\tconst { scope } = action;\n\treturn create({\n\t\tdocument,\n\t\taction,\n\t\tskip,\n\t\treuseLastOperationIndex: false\n\t}, (draft) => {\n\t\tconst sortedOperations = sortOperations([...document.operations[scope] || []]);\n\t\tconst nonNoopOps = sortedOperations.filter((op) => op.action.type !== \"NOOP\");\n\t\tlet noopChainLength = 0;\n\t\tfor (let i = sortedOperations.length - 1; i >= 0; i--) if (sortedOperations[i].action.type === \"NOOP\") noopChainLength++;\n\t\telse break;\n\t\tif (nonNoopOps.length <= noopChainLength) throw new Error(`Cannot undo: no more operations to undo in scope history`);\n\t\tdraft.action = noop(scope);\n\t\tdraft.skip = 1;\n\t});\n}\nfunction redoOperation(document, action, skip) {\n\tconst { scope, input } = action;\n\treturn create({\n\t\tdocument,\n\t\taction,\n\t\tskip,\n\t\treuseLastOperationIndex: false\n\t}, (draft) => {\n\t\tif (draft.skip > 0) throw new Error(`Cannot redo: skip value from reducer cannot be used with REDO action`);\n\t\tconst count = typeof input === \"object\" && input !== null && \"count\" in input ? input.count : input;\n\t\tif (typeof count !== \"number\" || count > 1) throw new Error(`Cannot redo: you can only redo one operation at a time`);\n\t\tif (typeof count !== \"number\" || count < 1) throw new Error(`Invalid REDO action: invalid redo input value`);\n\t\tif (draft.document.clipboard.length < 1) throw new Error(`Cannot redo: no operations in the clipboard`);\n\t\tconst operationIndex = draft.document.clipboard.findLastIndex((op) => op.action.scope === scope);\n\t\tif (operationIndex < 0) throw new Error(`Cannot redo: no operations in clipboard for scope \"${scope}\"`);\n\t\tconst operation = draft.document.clipboard.splice(operationIndex, 1)[0];\n\t\tdraft.action = castDraft({\n\t\t\ttype: operation.action.type,\n\t\t\tscope: operation.action.scope,\n\t\t\tinput: operation.action.input\n\t\t});\n\t});\n}\nfunction loadStateOperation(document, action) {\n\treturn {\n\t\t...document,\n\t\theader: {\n\t\t\t...document.header,\n\t\t\tname: action.state.name\n\t\t},\n\t\tstate: action.state.data\n\t};\n}\n//#endregion\n//#region document-model/reducer.ts\nfunction replayOperations(initialState, clearedOperations, stateReducer, header, dispatch, documentReducer = baseReducer, skipHeaderOperations = {}, options) {\n\treturn replayDocument(initialState, clearedOperations, createReducer(stateReducer, documentReducer), header, dispatch, skipHeaderOperations, options);\n}\n/**\n* Updates the operations history of the document based on the provided action.\n*\n* @param state The current state of the document.\n* @param action The action being applied to the document.\n* @param index The index of the operation to update.\n* @param skip The number of operations to skip before applying the action.\n* @param reuseLastOperationIndex Whether to reuse the last operation index (used when a an UNDO operation is performed after an existing one).\n* @param context The operation context for deterministic ID generation.\n* @returns The updated document state.\n*/\nfunction updateOperationsForAction(document, action, reuseLastOperationIndex, skip, context) {\n\tif ([\n\t\t\"UNDO\",\n\t\t\"REDO\",\n\t\t\"PRUNE\"\n\t].includes(action.type)) return document;\n\tconst scope = action.scope;\n\tconst existing = document.operations[scope];\n\tconst lastOperationIndex = existing?.at(-1)?.index ?? -1;\n\tconst newOperation = operationFromAction(action, reuseLastOperationIndex ? lastOperationIndex : lastOperationIndex + 1, skip, context);\n\tconst operations = [...existing ?? [], newOperation];\n\treturn {\n\t\t...document,\n\t\toperations: {\n\t\t\t...document.operations,\n\t\t\t[scope]: operations\n\t\t}\n\t};\n}\nfunction updateOperationsForOperation(document, operation, reuseLastOperationIndex, skip, context, skipIndexValidation) {\n\tconst scope = operation.action.scope;\n\tconst existing = document.operations[scope];\n\tconst lastOperationIndex = existing?.at(-1)?.index ?? -1;\n\tconst nextIndex = reuseLastOperationIndex ? lastOperationIndex : lastOperationIndex + 1;\n\tif (!skipIndexValidation && operation.index - skip > nextIndex) throw new Error(`Missing operations: expected ${nextIndex} with skip 0 or equivalent, got index ${operation.index} with skip ${skip}`);\n\tconst newOperation = operationFromOperation(operation, operation.index, skip, context);\n\tconst operations = [...existing ?? [], newOperation];\n\treturn {\n\t\t...document,\n\t\toperations: {\n\t\t\t...document.operations,\n\t\t\t[scope]: operations\n\t\t}\n\t};\n}\n/**\n* Updates the document state based on the provided action.\n*\n* @param state The current state of the document.\n* @param action The action being applied to the document.\n* @param skip The number of operations to skip before applying the action.\n* @param reuseLastOperationIndex Whether to reuse the last operation index (used when a an UNDO operation is performed after an existing one).\n* @param context The operation context for deterministic ID generation.\n* @returns The updated document state.\n*/\nfunction updateDocument(document, action, reuseLastOperationIndex, skip, context, operation, skipIndexValidation) {\n\tlet newDocument;\n\tif (operation) newDocument = updateOperationsForOperation(document, operation, reuseLastOperationIndex, skip, context, skipIndexValidation);\n\telse newDocument = updateOperationsForAction(document, action, reuseLastOperationIndex, skip, context);\n\tnewDocument = updateHeaderRevision(newDocument, action.scope, action.timestampUtcMs);\n\treturn newDocument;\n}\n/**\n* The base document reducer function that wraps a custom reducer function.\n*\n* @param state The current state of the document.\n* @param action The action being applied to the document.\n* @param wrappedReducer The custom reducer function being wrapped by the base reducer.\n* @returns The updated document state.\n*/\nfunction _baseReducer(document, action, wrappedReducer) {\n\tconst parsedAction = DocumentActionSchema().parse(action);\n\tswitch (parsedAction.type) {\n\t\tcase \"SET_NAME\": return setNameOperation(document, parsedAction.input);\n\t\tcase \"SET_PREFERRED_EDITOR\": return setPreferredEditorOperation(document, parsedAction.input);\n\t\tcase \"PRUNE\": return pruneOperation(document, parsedAction.input, wrappedReducer);\n\t\tcase \"LOAD_STATE\": return loadStateOperation(document, parsedAction.input);\n\t\tdefault: return document;\n\t}\n}\n/**\n* Processes an UNDO or REDO action.\n*\n* @param document The current state of the document.\n* @param action The action being applied to the document.\n* @param skip The number of operations to skip before applying the action.\n* @returns The updated document, calculated skip value and transformed action (if applied).\n*/\nfunction processUndoRedo(document, action, skip, protocolVersion = 1) {\n\tswitch (action.type) {\n\t\tcase \"UNDO\":\n\t\t\tif (protocolVersion >= 2) return undoOperationV2(document, action, skip);\n\t\t\treturn undoOperation(document, action, skip);\n\t\tcase \"REDO\": return redoOperation(document, action, skip);\n\t\tdefault: return {\n\t\t\tdocument,\n\t\t\taction,\n\t\t\tskip,\n\t\t\treuseLastOperationIndex: false\n\t\t};\n\t}\n}\nfunction processSkipOperation(document, action, customReducer, skipValue, reuseOperationResultingState = false, resultingStateParser = parseResultingState) {\n\tconst scope = action.scope;\n\tconst scopeOperations = document.operations[scope];\n\tif (!scopeOperations) return document;\n\tconst latestOperation = scopeOperations.at(-1);\n\tif (!latestOperation) return document;\n\tconst documentOperations = garbageCollectDocumentOperations({\n\t\t...document.operations,\n\t\t[scope]: skipHeaderOperations(scopeOperations, latestOperation)\n\t});\n\tlet scopeState = void 0;\n\tconst lastRemainingOperation = documentOperations[scope]?.at(-1);\n\tif (reuseOperationResultingState && lastRemainingOperation?.resultingState) scopeState = resultingStateParser(lastRemainingOperation.resultingState);\n\telse {\n\t\tconst { state } = replayOperations(document.initialState, documentOperations, customReducer, document.header, void 0, void 0, void 0, {\n\t\t\treuseOperationResultingState,\n\t\t\toperationResultingStateParser: resultingStateParser,\n\t\t\tskipIndexValidation: true\n\t\t});\n\t\tscopeState = state[scope];\n\t}\n\treturn {\n\t\t...document,\n\t\tstate: {\n\t\t\t...document.state,\n\t\t\t[scope]: scopeState\n\t\t},\n\t\toperations: garbageCollectDocumentOperations({ ...document.operations })\n\t};\n}\nfunction processUndoOperation(document, scope, customReducer, reuseOperationResultingState = false, resultingStateParser = parseResultingState) {\n\tconst scopeOperations = document.operations[scope];\n\tif (!scopeOperations) return document;\n\tconst sortedOperations = sortOperations([...scopeOperations]);\n\tsortedOperations.pop();\n\tconst documentOperations = garbageCollectDocumentOperations({ ...document.operations });\n\tconst documentScopeOps = documentOperations[scope];\n\tif (!documentScopeOps) return document;\n\tconst clearedOperations = [...documentScopeOps];\n\tconst diff = diffOperations(garbageCollect(sortedOperations), clearedOperations);\n\tconst doc = replayOperations(document.initialState, documentOperations, customReducer, document.header, void 0, void 0, void 0, {\n\t\treuseOperationResultingState,\n\t\toperationResultingStateParser: resultingStateParser\n\t});\n\tconst clipboard = sortOperations([...document.clipboard, ...diff].filter((op) => op.action.type !== \"NOOP\")).reverse();\n\treturn {\n\t\t...doc,\n\t\tclipboard\n\t};\n}\n/**\n* Base document reducer that wraps a custom document reducer and handles\n* document-level actions such as undo, redo, prune, and set name.\n*\n* @template TGlobalState - The type of the state of the custom reducer.\n* @template TAction - The type of the actions of the custom reducer.\n* @param state - The current state of the document.\n* @param action - The action object to apply to the state.\n* @param customReducer - The custom reducer that implements the application logic\n* specific to the document's state.\n* @returns The new state of the document.\n*/\nfunction baseReducer(document, action, customReducer, dispatch, options = {}) {\n\tconst { skip, ignoreSkipOperations = false, reuseOperationResultingState = false, operationResultingStateParser, pruneOnSkip = true, branch = \"main\" } = options;\n\tlet _action = actionFromAction(action);\n\tlet skipValue = skip ?? options.replayOptions?.operation.skip ?? 0;\n\tlet newDocument = { ...document };\n\tlet reuseLastOperationIndex = false;\n\tconst shouldProcessSkipOperation = !ignoreSkipOperations && skipValue > 0;\n\tif (isUndoRedo(_action)) {\n\t\tconst { skip: calculatedSkip, action: transformedAction, document: processedDocument, reuseLastOperationIndex: reuseIndex } = processUndoRedo(document, _action, skipValue, options.protocolVersion ?? 1);\n\t\t_action = transformedAction;\n\t\tskipValue = calculatedSkip;\n\t\tnewDocument = processedDocument;\n\t\treuseLastOperationIndex = reuseIndex;\n\t} else newDocument = {\n\t\t...newDocument,\n\t\tclipboard: []\n\t};\n\tif (isDocumentAction(_action)) newDocument = _baseReducer(newDocument, _action, customReducer);\n\tconst operationContext = {\n\t\tdocumentId: document.header.id,\n\t\tscope: _action.scope,\n\t\tbranch\n\t};\n\tnewDocument = updateDocument(newDocument, _action, reuseLastOperationIndex, skipValue, operationContext, options.replayOptions?.operation, options.skipIndexValidation);\n\tconst protocolVersion = options.protocolVersion ?? 1;\n\tif (isUndo(action) && protocolVersion < 2) return processUndoOperation(newDocument, action.scope, customReducer);\n\tconst isNoopWithSkip = _action.type === \"NOOP\" && skipValue > 0;\n\tif ((isUndo(action) || isNoopWithSkip) && protocolVersion >= 2) {\n\t\tconst scope = _action.scope;\n\t\tconst opsToReplay = garbageCollectV2(sortOperations([...newDocument.operations[scope] || []])).filter((op) => op.action.type !== \"NOOP\");\n\t\tconst replayOps = {\n\t\t\t...newDocument.operations,\n\t\t\t[scope]: opsToReplay\n\t\t};\n\t\treturn {\n\t\t\t...replayOperations(newDocument.initialState, replayOps, customReducer, newDocument.header, dispatch, baseReducer, {}, { skipIndexValidation: true }),\n\t\t\toperations: newDocument.operations,\n\t\t\tclipboard: []\n\t\t};\n\t}\n\tif (shouldProcessSkipOperation) {\n\t\tconst processed = processSkipOperation(newDocument, _action, customReducer, skipValue, reuseOperationResultingState, operationResultingStateParser);\n\t\tif (!pruneOnSkip) newDocument = {\n\t\t\t...processed,\n\t\t\toperations: newDocument.operations\n\t\t};\n\t\telse newDocument = processed;\n\t}\n\tnewDocument = create(newDocument, (draft) => {\n\t\ttry {\n\t\t\tconst newState = customReducer(draft.state, _action, dispatch);\n\t\t\tif (newState) unsafe(() => {\n\t\t\t\tdraft.state = castDraft(newState);\n\t\t\t});\n\t\t} catch (error) {\n\t\t\tconst actionScopeOps = newDocument.operations[_action.scope];\n\t\t\tif (!actionScopeOps) throw new Error(`No operations found for scope: ${_action.scope}`, { cause: error });\n\t\t\tconst lastOperationIndex = actionScopeOps.length - 1;\n\t\t\tconst draftScopeOps = draft.operations[_action.scope];\n\t\t\tif (!draftScopeOps) throw new Error(`No operations found in draft for scope: ${_action.scope}`, { cause: error });\n\t\t\tdraftScopeOps[lastOperationIndex].error = error.message;\n\t\t\tdraftScopeOps[lastOperationIndex].skip = 0;\n\t\t\tif (shouldProcessSkipOperation) {\n\t\t\t\tdraft.state = castDraft({ ...document.state });\n\t\t\t\tconst documentScopeOps = document.operations[_action.scope];\n\t\t\t\tif (!documentScopeOps) throw new Error(`No operations found for scope: ${_action.scope}`, { cause: error });\n\t\t\t\tdraft.operations = castDraft({\n\t\t\t\t\t...document.operations,\n\t\t\t\t\t[_action.scope]: [...documentScopeOps, { ...draftScopeOps[lastOperationIndex] }]\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t});\n\tif ([\n\t\t\"UNDO\",\n\t\t\"REDO\",\n\t\t\"PRUNE\"\n\t].includes(_action.type)) return newDocument;\n\tconst scope = _action.scope || \"global\";\n\tlet hash = hashDocumentStateForScope(newDocument, scope);\n\tif (options.replayOptions?.operation.hash && options.replayOptions.operation.hash !== \"\") hash = options.replayOptions.operation.hash;\n\tconst lastOperation = newDocument.operations[scope]?.at(-1);\n\tif (lastOperation) {\n\t\tlastOperation.hash = hash;\n\t\tif (reuseOperationResultingState) lastOperation.resultingState = JSON.stringify(newDocument.state[scope]);\n\t}\n\treturn newDocument;\n}\n/**\n* Helper function to create a document model reducer.\n*\n* @remarks\n* This function creates a new reducer that wraps the provided `reducer` with\n* `documentReducer`, adding support for document actions:\n*   - `SET_NAME`\n*   - `UNDO`\n*   - `REDO`\n*   - `PRUNE`\n*\n* It also updates the document-related attributes on every operation.\n*\n* @param reducer - The custom reducer to wrap.\n* @param documentReducer - The document reducer to use.\n*\n* @returns The new reducer.\n*/\nfunction createReducer(stateReducer, documentReducer = baseReducer) {\n\tconst reducer = (document, action, dispatch, options) => {\n\t\treturn documentReducer(document, action, stateReducer, dispatch, options);\n\t};\n\treturn reducer;\n}\nfunction pruneOperation(document, input, wrappedReducer) {\n\tconst operations = document.operations.global;\n\tif (!operations) throw new Error(\"No global operations found\");\n\tlet { start, end } = input;\n\tstart = start || 0;\n\tend = end || operations.length;\n\tconst actionsToPrune = operations.slice(start, end);\n\tconst actionsToKeepStart = operations.slice(0, start);\n\tconst actionsToKeepEnd = operations.slice(end);\n\tconst newDocument = replayOperations(document.initialState, {\n\t\t...document.operations,\n\t\tglobal: actionsToKeepStart.concat(actionsToPrune)\n\t}, wrappedReducer, document.header);\n\tconst newState = newDocument.state;\n\tconst name = newDocument.header.name;\n\tconst loadStateIndex = actionsToKeepStart.length;\n\tconst loadStateTimestamp = actionsToKeepStart.length ? actionsToKeepStart[actionsToKeepStart.length - 1].timestampUtcMs : actionsToKeepEnd.length ? actionsToKeepEnd[0].timestampUtcMs : (/* @__PURE__ */ new Date()).toISOString();\n\tconst action = loadState({\n\t\tname,\n\t\t...newState\n\t}, actionsToPrune.length);\n\treturn replayOperations(document.initialState, {\n\t\t...document.operations,\n\t\tglobal: [\n\t\t\t...actionsToKeepStart,\n\t\t\t{\n\t\t\t\tskip: 0,\n\t\t\t\t...action,\n\t\t\t\taction,\n\t\t\t\ttimestampUtcMs: loadStateTimestamp,\n\t\t\t\tindex: loadStateIndex,\n\t\t\t\thash: hashDocumentStateForScope({ state: newState }, \"global\")\n\t\t\t},\n\t\t\t...actionsToKeepEnd.map((action, index) => ({\n\t\t\t\t...action,\n\t\t\t\tindex: loadStateIndex + index + 1\n\t\t\t}))\n\t\t]\n\t}, wrappedReducer, document.header);\n}\n//#endregion\n//#region document-model/validation.ts\n/**\n* Reserved operation names from base reducer (core/actions.ts).\n* These names cannot be used for custom operations.\n*/\nconst RESERVED_OPERATION_NAMES = [\n\t\"UNDO\",\n\t\"REDO\",\n\t\"PRUNE\",\n\t\"LOAD_STATE\",\n\t\"SET_NAME\",\n\t\"SET_PREFERRED_EDITOR\",\n\t\"NOOP\"\n];\n/**\n* Operation names become the literal action `type` string at runtime and the\n* key for codegen's action union. They must be SCREAMING_SNAKE_CASE so the\n* generated TypeScript is valid.\n*/\nconst OPERATION_NAME_PATTERN = /^[A-Z][A-Z0-9_]*$/;\nfunction isValidOperationNameFormat(name) {\n\treturn OPERATION_NAME_PATTERN.test(name);\n}\n/**\n* Check if name conflicts with base reducer actions (case-insensitive).\n*/\nfunction isReservedOperationName(name) {\n\treturn RESERVED_OPERATION_NAMES.includes(name.toUpperCase());\n}\n/**\n* Get all operation names from all modules in the latest specification.\n* Returns names in uppercase for case-insensitive comparison.\n*/\nfunction getAllOperationNames(state, excludeOperationId) {\n\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\tif (!latestSpec) return [];\n\tconst names = [];\n\tfor (const module of latestSpec.modules) for (const operation of module.operations) {\n\t\tif (excludeOperationId && operation.id === excludeOperationId) continue;\n\t\tif (operation.name) names.push(operation.name.toUpperCase());\n\t}\n\treturn names;\n}\n/**\n* Validate operation name is not reserved or duplicate. Throws on failure.\n*\n* @param name - The operation name to validate\n* @param state - The document model global state\n* @param excludeOperationId - Optional operation ID to exclude (for rename validation)\n* @throws Error if the name is reserved or a duplicate\n*/\nfunction validateOperationName(name, state, excludeOperationId) {\n\tif (!name) return;\n\tif (!isValidOperationNameFormat(name)) {\n\t\tconst suggestion = constantCase(name);\n\t\tconst hint = suggestion && suggestion !== name && isValidOperationNameFormat(suggestion) ? ` Did you mean \"${suggestion}\"?` : \"\";\n\t\tthrow new Error(`Operation name \"${name}\" is invalid. Names must be SCREAMING_SNAKE_CASE (matching ${OPERATION_NAME_PATTERN.source}).${hint}`);\n\t}\n\tconst upperName = name.toUpperCase();\n\tif (isReservedOperationName(name)) throw new Error(`Operation name \"${name}\" is reserved. Please use a different name.`);\n\tif (getAllOperationNames(state, excludeOperationId).includes(upperName)) throw new Error(`Operation name \"${name}\" is already used by another operation. Operation names must be unique across all modules.`);\n}\nfunction validateInitialState(initialState, allowEmptyState = false) {\n\tconst errors = [];\n\tif (allowEmptyState && initialState === \"\") return errors;\n\ttry {\n\t\tconst state = JSON.parse(initialState);\n\t\tif (!allowEmptyState && !Object.keys(state).length) errors.push({\n\t\t\tmessage: \"Initial state cannot be empty\",\n\t\t\tdetails: { initialState }\n\t\t});\n\t} catch {\n\t\terrors.push({\n\t\t\tmessage: \"Invalid initial state\",\n\t\t\tdetails: { initialState }\n\t\t});\n\t}\n\treturn errors;\n}\nfunction validateStateSchemaName(schema, documentName, scope = \"\", allowEmptySchema = true) {\n\tconst errors = [];\n\tif (!allowEmptySchema && !schema) {\n\t\terrors.push({\n\t\t\tmessage: \"State schema is required\",\n\t\t\tdetails: { schema }\n\t\t});\n\t\treturn errors;\n\t}\n\tif (allowEmptySchema && !schema) return errors;\n\tconst expectedTypeName = `${pascalCase(documentName)}${pascalCase(scope)}State`;\n\tif (!new RegExp(`\\\\btype\\\\s+${expectedTypeName}(?:\\\\s|\\\\{|@|$)`).test(schema)) errors.push({\n\t\tmessage: `Invalid state schema name. Expected type ${expectedTypeName}`,\n\t\tdetails: { schema }\n\t});\n\treturn errors;\n}\nfunction validateModules(modules) {\n\tconst errors = [];\n\tif (!modules.length) errors.push({\n\t\tmessage: \"Modules are required\",\n\t\tdetails: { modules }\n\t});\n\tconst modulesError = modules.reduce((acc, mod) => [...acc, ...validateModule(mod)], []);\n\treturn [...errors, ...modulesError];\n}\nfunction validateModule(mod) {\n\tconst errors = [];\n\tif (!mod.name) errors.push({\n\t\tmessage: \"Module name is required\",\n\t\tdetails: { module: mod }\n\t});\n\tif (!mod.operations.length) errors.push({\n\t\tmessage: \"Module operations are required\",\n\t\tdetails: { module: mod }\n\t});\n\tconst operationErrors = mod.operations.reduce((acc, operation) => [...acc, ...validateModuleOperation(operation)], []);\n\treturn [...errors, ...operationErrors];\n}\nfunction validateModuleOperation(operation) {\n\tconst errors = [];\n\tif (!operation.name) errors.push({\n\t\tmessage: \"Operation name is required\",\n\t\tdetails: { operation }\n\t});\n\tif (!operation.schema) errors.push({\n\t\tmessage: \"Operation schema is required\",\n\t\tdetails: { operation }\n\t});\n\treturn errors;\n}\n/**\n* Find a module in the latest specification by id, or throw. Reducers that\n* mutate-by-id should call this up front so an unknown id fails loudly\n* instead of silently no-opping.\n*/\nfunction findModuleOrThrow(state, moduleId) {\n\tconst mod = state.specifications[state.specifications.length - 1]?.modules.find((m) => m.id === moduleId);\n\tif (!mod) throw new Error(`Module \"${moduleId}\" not found in the latest specification`);\n\treturn mod;\n}\n/**\n* Find an operation in the latest specification by id, or throw. Same\n* rationale as findModuleOrThrow — reducers that target an operation must\n* fail loudly when the operation doesn't exist.\n*/\nfunction findOperationOrThrow(state, operationId) {\n\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\tif (latestSpec) for (const mod of latestSpec.modules) {\n\t\tconst op = mod.operations.find((o) => o.id === operationId);\n\t\tif (op) return op;\n\t}\n\tthrow new Error(`Operation \"${operationId}\" not found in the latest specification`);\n}\n/**\n* Find an operation error by id across all operations in the latest\n* specification, or throw. Throws on a duplicate id too: setters act on a\n* single error, so an ambiguous id must fail loudly rather than mutate an\n* arbitrary match.\n*/\nfunction findOperationErrorOrThrow(state, errorId) {\n\tconst matches = state.specifications[state.specifications.length - 1]?.modules.flatMap((mod) => mod.operations.flatMap((op) => op.errors.filter((e) => e.id === errorId))) ?? [];\n\tif (matches.length === 0) throw new Error(`Operation error \"${errorId}\" not found in the latest specification`);\n\tif (matches.length > 1) throw new Error(`Operation error \"${errorId}\" is duplicated in the latest specification`);\n\treturn matches[0];\n}\n/**\n* Find an operation example (code example) by id across all operations in the\n* latest specification, or throw. Throws on a duplicate id for the same reason\n* as findOperationErrorOrThrow.\n*/\nfunction findOperationExampleOrThrow(state, exampleId) {\n\tconst matches = state.specifications[state.specifications.length - 1]?.modules.flatMap((mod) => mod.operations.flatMap((op) => op.examples.filter((e) => e.id === exampleId))) ?? [];\n\tif (matches.length === 0) throw new Error(`Operation example \"${exampleId}\" not found in the latest specification`);\n\tif (matches.length > 1) throw new Error(`Operation example \"${exampleId}\" is duplicated in the latest specification`);\n\treturn matches[0];\n}\n/**\n* Assert no module in the latest specification already uses `id`. Modules are\n* targeted by id by the setter/delete/reorder reducers, so a duplicate id makes\n* those operations ambiguous.\n*/\nfunction assertModuleIdUnique(state, id) {\n\tif (state.specifications[state.specifications.length - 1]?.modules.some((m) => m.id === id)) throw new Error(`Module \"${id}\" already exists in the latest specification`);\n}\n/**\n* Assert no operation in the latest specification already uses `id`. Operations\n* are targeted by id across all modules, so the id must be unique document-wide.\n*/\nfunction assertOperationIdUnique(state, id) {\n\tif (state.specifications[state.specifications.length - 1]?.modules.some((m) => m.operations.some((o) => o.id === id))) throw new Error(`Operation \"${id}\" already exists in the latest specification`);\n}\n/**\n* Assert no operation error in the latest specification already uses `id`.\n* Error ids are targeted document-wide by the setter/delete reducers, so the id\n* must be unique to keep those operations unambiguous.\n*/\nfunction assertOperationErrorIdUnique(state, id) {\n\tif (state.specifications[state.specifications.length - 1]?.modules.some((m) => m.operations.some((o) => o.errors.some((e) => e.id === id)))) throw new Error(`Operation error \"${id}\" already exists in the latest specification`);\n}\n/**\n* Assert no operation example in the latest specification already uses `id`.\n* Example ids are targeted document-wide by the update/delete reducers, so the\n* id must be unique to keep those operations unambiguous.\n*/\nfunction assertOperationExampleIdUnique(state, id) {\n\tif (state.specifications[state.specifications.length - 1]?.modules.some((m) => m.operations.some((o) => o.examples.some((e) => e.id === id)))) throw new Error(`Operation example \"${id}\" already exists in the latest specification`);\n}\nfunction validateOperations(operations) {\n\tconst errors = [];\n\tconst scopes = Object.keys(operations);\n\tfor (const scope of scopes) {\n\t\tconst scopeOperations = operations[scope];\n\t\tif (!scopeOperations) continue;\n\t\tconst ops = scopeOperations.sort((a, b) => a.index - b.index);\n\t\tlet opIndex = -1;\n\t\tfor (let i = 0; i < ops.length; i++) {\n\t\t\topIndex = opIndex + 1 + ops[i].skip;\n\t\t\tif (ops[i].index !== opIndex) errors.push({\n\t\t\t\tmessage: `Invalid operation index ${ops[i].index} at position ${i}`,\n\t\t\t\tdetails: {\n\t\t\t\t\tposition: i,\n\t\t\t\t\toperation: ops[i],\n\t\t\t\t\tscope: ops[i].action.scope\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\treturn errors;\n}\n//#endregion\n//#region document-model/reducers.ts\n/**\n* Reorder `items` by the position of their id in `order`. Ids not listed in\n* `order` keep their relative position after the listed ones. Throws if `order`\n* references an id that isn't present, so a stale or mistyped id fails loudly\n* instead of silently producing an arbitrary order.\n*/\nfunction orderBy(items, order) {\n\tconst ids = new Set(items.map((item) => item.id));\n\tfor (const id of order) if (!ids.has(id)) throw new Error(`Cannot reorder: unknown id \"${id}\"`);\n\tconst rank = new Map(order.map((id, index) => [id, index]));\n\treturn items.map((item, index) => ({\n\t\titem,\n\t\tindex\n\t})).sort((a, b) => {\n\t\treturn (rank.get(a.item.id) ?? Number.MAX_SAFE_INTEGER) - (rank.get(b.item.id) ?? Number.MAX_SAFE_INTEGER) || a.index - b.index;\n\t}).map(({ item }) => item);\n}\nconst documentModelHeaderReducer = {\n\tsetModelNameOperation(state, action) {\n\t\tstate.name = action.input.name;\n\t},\n\tsetModelIdOperation(state, action) {\n\t\tstate.id = action.input.id;\n\t},\n\tsetModelExtensionOperation(state, action) {\n\t\tstate.extension = action.input.extension;\n\t},\n\tsetModelDescriptionOperation(state, action) {\n\t\tstate.description = action.input.description;\n\t},\n\tsetAuthorNameOperation(state, action) {\n\t\tstate.author = state.author || {\n\t\t\tname: \"\",\n\t\t\twebsite: null\n\t\t};\n\t\tstate.author.name = action.input.authorName;\n\t},\n\tsetAuthorWebsiteOperation(state, action) {\n\t\tstate.author = state.author || {\n\t\t\tname: \"\",\n\t\t\twebsite: null\n\t\t};\n\t\tstate.author.website = action.input.authorWebsite;\n\t}\n};\nconst documentModelModuleReducer = {\n\taddModuleOperation(state, action) {\n\t\tassertModuleIdUnique(state, action.input.id);\n\t\tstate.specifications[state.specifications.length - 1].modules.push({\n\t\t\tid: action.input.id,\n\t\t\tname: action.input.name,\n\t\t\tdescription: action.input.description || \"\",\n\t\t\toperations: []\n\t\t});\n\t},\n\tsetModuleNameOperation(state, action) {\n\t\tconst targetModule = findModuleOrThrow(state, action.input.id);\n\t\ttargetModule.name = action.input.name || \"\";\n\t},\n\tsetModuleDescriptionOperation(state, action) {\n\t\tconst targetModule = findModuleOrThrow(state, action.input.id);\n\t\ttargetModule.description = action.input.description || \"\";\n\t},\n\tdeleteModuleOperation(state, action) {\n\t\tfindModuleOrThrow(state, action.input.id);\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tlatestSpec.modules = latestSpec.modules.filter((m) => m.id != action.input.id);\n\t},\n\treorderModulesOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tlatestSpec.modules = orderBy(latestSpec.modules, action.input.order);\n\t}\n};\nconst documentModelOperationErrorReducer = {\n\taddOperationErrorOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.operationId);\n\t\tassertOperationErrorIdUnique(state, action.input.id);\n\t\ttargetOp.errors.push({\n\t\t\tid: action.input.id,\n\t\t\tname: action.input.errorName || \"\",\n\t\t\tcode: action.input.errorCode || \"\",\n\t\t\tdescription: action.input.errorDescription || \"\",\n\t\t\ttemplate: action.input.errorTemplate || \"\"\n\t\t});\n\t},\n\tsetOperationErrorCodeOperation(state, action) {\n\t\tconst error = findOperationErrorOrThrow(state, action.input.id);\n\t\terror.code = action.input.errorCode || \"\";\n\t},\n\tsetOperationErrorNameOperation(state, action) {\n\t\tconst error = findOperationErrorOrThrow(state, action.input.id);\n\t\terror.name = action.input.errorName || \"\";\n\t},\n\tsetOperationErrorDescriptionOperation(state, action) {\n\t\tconst error = findOperationErrorOrThrow(state, action.input.id);\n\t\terror.description = action.input.errorDescription || \"\";\n\t},\n\tsetOperationErrorTemplateOperation(state, action) {\n\t\tconst error = findOperationErrorOrThrow(state, action.input.id);\n\t\terror.template = action.input.errorTemplate || \"\";\n\t},\n\tdeleteOperationErrorOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (!latestSpec.modules.some((mod) => mod.operations.some((op) => op.errors.some((e) => e.id === action.input.id)))) throw new Error(`Operation error \"${action.input.id}\" not found in the latest specification`);\n\t\tfor (const mod of latestSpec.modules) for (const op of mod.operations) op.errors = op.errors.filter((e) => e.id != action.input.id);\n\t},\n\treorderOperationErrorsOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.operationId);\n\t\ttargetOp.errors = orderBy(targetOp.errors, action.input.order);\n\t}\n};\nconst documentModelOperationExampleReducer = {\n\taddOperationExampleOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.operationId);\n\t\tassertOperationExampleIdUnique(state, action.input.id);\n\t\ttargetOp.examples.push({\n\t\t\tid: action.input.id,\n\t\t\tvalue: action.input.example\n\t\t});\n\t},\n\tupdateOperationExampleOperation(state, action) {\n\t\tconst example = findOperationExampleOrThrow(state, action.input.id);\n\t\texample.value = action.input.example;\n\t},\n\tdeleteOperationExampleOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (!latestSpec.modules.some((mod) => mod.operations.some((op) => op.examples.some((e) => e.id === action.input.id)))) throw new Error(`Operation example \"${action.input.id}\" not found in the latest specification`);\n\t\tfor (const mod of latestSpec.modules) for (const op of mod.operations) op.examples = op.examples.filter((e) => e.id != action.input.id);\n\t},\n\treorderOperationExamplesOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.operationId);\n\t\ttargetOp.examples = orderBy(targetOp.examples, action.input.order);\n\t}\n};\nconst documentModelOperationReducer = {\n\taddOperationOperation(state, action) {\n\t\tvalidateOperationName(action.input.name, state);\n\t\tassertOperationIdUnique(state, action.input.id);\n\t\tfindModuleOrThrow(state, action.input.moduleId).operations.push({\n\t\t\tid: action.input.id,\n\t\t\tname: action.input.name,\n\t\t\tdescription: action.input.description || \"\",\n\t\t\tschema: action.input.schema || \"\",\n\t\t\ttemplate: action.input.template || action.input.description || \"\",\n\t\t\treducer: action.input.reducer || \"\",\n\t\t\terrors: [],\n\t\t\texamples: [],\n\t\t\tscope: action.input.scope || \"global\"\n\t\t});\n\t},\n\tsetOperationNameOperation(state, action) {\n\t\tif (action.input.name) validateOperationName(action.input.name, state, action.input.id);\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\ttargetOp.name = action.input.name || \"\";\n\t},\n\tsetOperationScopeOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tconst allowedScopes = Object.keys(latestSpec.state);\n\t\tif (action.input.scope && !allowedScopes.includes(action.input.scope)) throw new Error(`Invalid scope: ${action.input.scope}`);\n\t\ttargetOp.scope = action.input.scope || \"global\";\n\t},\n\tsetOperationSchemaOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\ttargetOp.schema = action.input.schema || \"\";\n\t},\n\tsetOperationDescriptionOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\ttargetOp.description = action.input.description || \"\";\n\t},\n\tsetOperationTemplateOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\ttargetOp.template = action.input.template || \"\";\n\t},\n\tsetOperationReducerOperation(state, action) {\n\t\tconst targetOp = findOperationOrThrow(state, action.input.id);\n\t\ttargetOp.reducer = action.input.reducer || \"\";\n\t},\n\tmoveOperationOperation(state, action) {\n\t\tconst targetModule = findModuleOrThrow(state, action.input.newModuleId);\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tconst matches = latestSpec.modules.flatMap((mod) => mod.operations.filter((op) => op.id === action.input.operationId));\n\t\tif (matches.length === 0) throw new Error(`Operation \"${action.input.operationId}\" not found in the latest specification`);\n\t\tif (matches.length > 1) throw new Error(`Operation \"${action.input.operationId}\" is duplicated in the latest specification`);\n\t\tconst moved = matches[0];\n\t\tfor (const mod of latestSpec.modules) mod.operations = mod.operations.filter((op) => op.id !== action.input.operationId);\n\t\ttargetModule.operations.push(moved);\n\t},\n\tdeleteOperationOperation(state, action) {\n\t\tfindOperationOrThrow(state, action.input.id);\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tfor (const mod of latestSpec.modules) mod.operations = mod.operations.filter((operation) => operation.id != action.input.id);\n\t},\n\treorderModuleOperationsOperation(state, action) {\n\t\tconst targetModule = findModuleOrThrow(state, action.input.moduleId);\n\t\ttargetModule.operations = orderBy(targetModule.operations, action.input.order);\n\t}\n};\nconst documentModelStateSchemaReducer = {\n\tsetStateSchemaOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (Object.keys(latestSpec.state).includes(action.input.scope)) latestSpec.state[action.input.scope].schema = action.input.schema;\n\t\telse throw new Error(`Invalid scope: ${action.input.scope}`);\n\t},\n\tsetInitialStateOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (Object.keys(latestSpec.state).includes(action.input.scope)) latestSpec.state[action.input.scope].initialValue = action.input.initialValue;\n\t\telse throw new Error(`Invalid scope: ${action.input.scope}`);\n\t},\n\taddStateExampleOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (Object.keys(latestSpec.state).includes(action.input.scope)) latestSpec.state[action.input.scope].examples.push({\n\t\t\tid: action.input.id,\n\t\t\tvalue: action.input.example\n\t\t});\n\t\telse throw new Error(`Invalid scope: ${action.input.scope}`);\n\t},\n\tupdateStateExampleOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (!Object.keys(latestSpec.state).includes(action.input.scope)) throw new Error(`Invalid scope: ${action.input.scope}`);\n\t\tconst example = latestSpec.state[action.input.scope].examples.find((e) => e.id == action.input.id);\n\t\tif (!example) throw new Error(`State example \"${action.input.id}\" not found in scope \"${action.input.scope}\"`);\n\t\texample.value = action.input.newExample;\n\t},\n\tdeleteStateExampleOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (!Object.keys(latestSpec.state).includes(action.input.scope)) throw new Error(`Invalid scope: ${action.input.scope}`);\n\t\tconst scopeState = latestSpec.state[action.input.scope];\n\t\tif (!scopeState.examples.some((e) => e.id == action.input.id)) throw new Error(`State example \"${action.input.id}\" not found in scope \"${action.input.scope}\"`);\n\t\tscopeState.examples = scopeState.examples.filter((e) => e.id != action.input.id);\n\t},\n\treorderStateExamplesOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tif (!Object.keys(latestSpec.state).includes(action.input.scope)) throw new Error(`Invalid scope: ${action.input.scope}`);\n\t\tconst scopeState = latestSpec.state[action.input.scope];\n\t\tscopeState.examples = orderBy(scopeState.examples, action.input.order);\n\t}\n};\nconst documentModelVersioningReducer = {\n\taddChangeLogItemOperation(state, action) {\n\t\tthrow new Error(\"Reducer \\\"addChangeLogItemOperation\\\" not yet implemented\");\n\t},\n\tupdateChangeLogItemOperation(state, action) {\n\t\tthrow new Error(\"Reducer \\\"updateChangeLogItemOperation\\\" not yet implemented\");\n\t},\n\tdeleteChangeLogItemOperation(state, action) {\n\t\tthrow new Error(\"Reducer \\\"deleteChangeLogItemOperation\\\" not yet implemented\");\n\t},\n\treorderChangeLogItemsOperation(state, action) {\n\t\tthrow new Error(\"Reducer \\\"reorderChangeLogItemsOperation\\\" not yet implemented\");\n\t},\n\treleaseNewVersionOperation(state, action) {\n\t\tconst latestSpec = state.specifications[state.specifications.length - 1];\n\t\tconst copiedModules = latestSpec.modules.map((module) => ({\n\t\t\t...module,\n\t\t\toperations: module.operations.map((op) => ({\n\t\t\t\t...op,\n\t\t\t\terrors: op.errors.map((err) => ({ ...err })),\n\t\t\t\texamples: op.examples.map((ex) => ({ ...ex }))\n\t\t\t}))\n\t\t}));\n\t\tconst copiedState = {\n\t\t\tglobal: {\n\t\t\t\t...latestSpec.state.global,\n\t\t\t\texamples: latestSpec.state.global.examples.map((ex) => ({ ...ex }))\n\t\t\t},\n\t\t\tlocal: {\n\t\t\t\t...latestSpec.state.local,\n\t\t\t\texamples: latestSpec.state.local.examples.map((ex) => ({ ...ex }))\n\t\t\t}\n\t\t};\n\t\tconst newSpec = {\n\t\t\tversion: latestSpec.version + 1,\n\t\t\tchangeLog: [],\n\t\t\tstate: copiedState,\n\t\t\tmodules: copiedModules\n\t\t};\n\t\tstate.specifications.push(newSpec);\n\t}\n};\nconst documentModelStateReducer = (state, action) => {\n\tif (isDocumentAction(action)) return state;\n\tswitch (action.type) {\n\t\tcase \"SET_MODEL_NAME\":\n\t\t\tSetModelNameInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setModelNameOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_MODEL_ID\":\n\t\t\tSetModelIdInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setModelIdOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_MODEL_EXTENSION\":\n\t\t\tSetModelExtensionInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setModelExtensionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_MODEL_DESCRIPTION\":\n\t\t\tSetModelDescriptionInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setModelDescriptionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_AUTHOR_NAME\":\n\t\t\tSetAuthorNameInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setAuthorNameOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_AUTHOR_WEBSITE\":\n\t\t\tSetAuthorWebsiteInputSchema().parse(action.input);\n\t\t\tdocumentModelHeaderReducer.setAuthorWebsiteOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_CHANGE_LOG_ITEM\":\n\t\t\tAddChangeLogItemInputSchema().parse(action.input);\n\t\t\tdocumentModelVersioningReducer.addChangeLogItemOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"UPDATE_CHANGE_LOG_ITEM\":\n\t\t\tUpdateChangeLogItemInputSchema().parse(action.input);\n\t\t\tdocumentModelVersioningReducer.updateChangeLogItemOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_CHANGE_LOG_ITEM\":\n\t\t\tDeleteChangeLogItemInputSchema().parse(action.input);\n\t\t\tdocumentModelVersioningReducer.deleteChangeLogItemOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_CHANGE_LOG_ITEMS\":\n\t\t\tReorderChangeLogItemsInputSchema().parse(action.input);\n\t\t\tdocumentModelVersioningReducer.reorderChangeLogItemsOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"RELEASE_NEW_VERSION\":\n\t\t\tif (Object.keys(action.input).length > 0) throw new Error(\"Expected empty input for action RELEASE_NEW_VERSION\");\n\t\t\tdocumentModelVersioningReducer.releaseNewVersionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_MODULE\":\n\t\t\tAddModuleInputSchema().parse(action.input);\n\t\t\tdocumentModelModuleReducer.addModuleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_MODULE_NAME\":\n\t\t\tSetModuleNameInputSchema().parse(action.input);\n\t\t\tdocumentModelModuleReducer.setModuleNameOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_MODULE_DESCRIPTION\":\n\t\t\tSetModuleDescriptionInputSchema().parse(action.input);\n\t\t\tdocumentModelModuleReducer.setModuleDescriptionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_MODULE\":\n\t\t\tDeleteModuleInputSchema().parse(action.input);\n\t\t\tdocumentModelModuleReducer.deleteModuleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_MODULES\":\n\t\t\tReorderModulesInputSchema().parse(action.input);\n\t\t\tdocumentModelModuleReducer.reorderModulesOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_OPERATION_ERROR\":\n\t\t\tAddOperationErrorInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.addOperationErrorOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_ERROR_CODE\":\n\t\t\tSetOperationErrorCodeInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.setOperationErrorCodeOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_ERROR_NAME\":\n\t\t\tSetOperationErrorNameInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.setOperationErrorNameOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_ERROR_DESCRIPTION\":\n\t\t\tSetOperationErrorDescriptionInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.setOperationErrorDescriptionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_ERROR_TEMPLATE\":\n\t\t\tSetOperationErrorTemplateInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.setOperationErrorTemplateOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_OPERATION_ERROR\":\n\t\t\tDeleteOperationErrorInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.deleteOperationErrorOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_OPERATION_ERRORS\":\n\t\t\tReorderOperationErrorsInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationErrorReducer.reorderOperationErrorsOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_OPERATION_EXAMPLE\":\n\t\t\tAddOperationExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationExampleReducer.addOperationExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"UPDATE_OPERATION_EXAMPLE\":\n\t\t\tUpdateOperationExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationExampleReducer.updateOperationExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_OPERATION_EXAMPLE\":\n\t\t\tDeleteOperationExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationExampleReducer.deleteOperationExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_OPERATION_EXAMPLES\":\n\t\t\tReorderOperationExamplesInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationExampleReducer.reorderOperationExamplesOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_OPERATION\":\n\t\t\tAddOperationInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.addOperationOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_NAME\":\n\t\t\tSetOperationNameInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationNameOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_SCOPE\":\n\t\t\tSetOperationScopeInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationScopeOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_SCHEMA\":\n\t\t\tSetOperationSchemaInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationSchemaOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_DESCRIPTION\":\n\t\t\tSetOperationDescriptionInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationDescriptionOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_TEMPLATE\":\n\t\t\tSetOperationTemplateInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationTemplateOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_OPERATION_REDUCER\":\n\t\t\tSetOperationReducerInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.setOperationReducerOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"MOVE_OPERATION\":\n\t\t\tMoveOperationInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.moveOperationOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_OPERATION\":\n\t\t\tDeleteOperationInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.deleteOperationOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_MODULE_OPERATIONS\":\n\t\t\tReorderModuleOperationsInputSchema().parse(action.input);\n\t\t\tdocumentModelOperationReducer.reorderModuleOperationsOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_STATE_SCHEMA\":\n\t\t\tSetStateSchemaInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.setStateSchemaOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"SET_INITIAL_STATE\":\n\t\t\tSetInitialStateInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.setInitialStateOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"ADD_STATE_EXAMPLE\":\n\t\t\tAddStateExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.addStateExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"UPDATE_STATE_EXAMPLE\":\n\t\t\tUpdateStateExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.updateStateExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"DELETE_STATE_EXAMPLE\":\n\t\t\tDeleteStateExampleInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.deleteStateExampleOperation(state.global, action);\n\t\t\tbreak;\n\t\tcase \"REORDER_STATE_EXAMPLES\":\n\t\t\tReorderStateExamplesInputSchema().parse(action.input);\n\t\t\tdocumentModelStateSchemaReducer.reorderStateExamplesOperation(state.global, action);\n\t\t\tbreak;\n\t\tdefault: return state;\n\t}\n};\nconst documentModelReducer = createReducer(documentModelStateReducer);\n//#endregion\n//#region document-model/files.ts\nconst NON_DOMAIN_SCOPES = new Set([\"auth\", \"document\"]);\nfunction zipAsync(data) {\n\treturn new Promise((resolve, reject) => {\n\t\tzip(data, (err, out) => err ? reject(err) : resolve(out));\n\t});\n}\nfunction unzipAsync(data) {\n\treturn new Promise((resolve, reject) => {\n\t\tunzip(data, (err, out) => err ? reject(err) : resolve(out));\n\t});\n}\nconst BASE64_RE = /^[A-Za-z0-9+/]+={0,2}$/;\nfunction isLikelyBase64(s) {\n\tif (s.length === 0 || s.length % 4 !== 0) return false;\n\treturn BASE64_RE.test(s);\n}\nfunction binaryStringToUint8Array(s) {\n\tconst arr = new Uint8Array(s.length);\n\tfor (let i = 0; i < s.length; i++) arr[i] = s.charCodeAt(i) & 255;\n\treturn arr;\n}\nfunction base64ToUint8Array(s) {\n\tif (typeof atob === \"function\") return binaryStringToUint8Array(atob(s));\n\tconst BufferCtor = globalThis.Buffer;\n\tif (!BufferCtor) throw new Error(\"Cannot decode base64 string: neither `atob` nor `Buffer` is available in this environment\");\n\treturn BufferCtor.from(s, \"base64\");\n}\nasync function toUint8Array(input) {\n\tif (input instanceof Uint8Array) return input;\n\tif (input instanceof ArrayBuffer) return new Uint8Array(input);\n\tif (typeof Blob !== \"undefined\" && input instanceof Blob) return new Uint8Array(await input.arrayBuffer());\n\tif (Array.isArray(input)) return new Uint8Array(input);\n\tif (typeof input === \"string\") return isLikelyBase64(input) ? base64ToUint8Array(input) : binaryStringToUint8Array(input);\n\tthrow new Error(\"Unsupported FileInput type\");\n}\nfunction jsonEntry(value) {\n\treturn strToU8(JSON.stringify(value, null, 2));\n}\nasync function createZip(document) {\n\treturn zipAsync({\n\t\t\"header.json\": jsonEntry(document.header),\n\t\t\"state.json\": jsonEntry(document.initialState || {}),\n\t\t\"current-state.json\": jsonEntry(document.state || {}),\n\t\t\"operations.json\": jsonEntry(filterDocumentOperationsResultingState(document.operations))\n\t});\n}\n/**\n* Creates a minimal ZIP backup from strand data.\n* Used when the full document is not available (e.g., in onOperations handler).\n* Creates a ZIP with minimal header and empty operations.\n*/\nasync function createMinimalZip(data) {\n\tconst now = (/* @__PURE__ */ new Date()).toISOString();\n\tconst header = {\n\t\tid: data.documentId,\n\t\tsig: {\n\t\t\tpublicKey: {},\n\t\t\tnonce: \"\"\n\t\t},\n\t\tdocumentType: data.documentType,\n\t\tcreatedAtUtcIso: now,\n\t\tslug: data.name,\n\t\tname: data.name,\n\t\tbranch: data.branch,\n\t\trevision: {},\n\t\tlastModifiedAtUtcIso: now\n\t};\n\treturn zipAsync({\n\t\t\"header.json\": jsonEntry(header),\n\t\t\"state.json\": jsonEntry(data.state),\n\t\t\"current-state.json\": jsonEntry(data.state),\n\t\t\"operations.json\": jsonEntry({})\n\t});\n}\nasync function baseSaveToFileHandle(document, input) {\n\tconst data = await createZip(document);\n\tconst writable = await input.createWritable();\n\tawait writable.write(new Uint8Array(data));\n\tawait writable.close();\n}\nfunction readEntry(files, name) {\n\tconst entry = files[name];\n\tif (!entry) throw new Error(`${name} not found in document zip`);\n\treturn strFromU8(entry);\n}\nasync function loadFromZipData(data, reducer, options) {\n\tconst files = await unzipAsync(data);\n\tif (!files[\"state.json\"]) throw new Error(\"Initial state not found\");\n\tconst initialState = JSON.parse(readEntry(files, \"state.json\"));\n\tif (!files[\"header.json\"]) throw new Error(\"Document header not found - file format may be outdated\");\n\tconst header = JSON.parse(readEntry(files, \"header.json\"));\n\tif (!files[\"operations.json\"]) throw new Error(\"Operations history not found\");\n\tconst clearedOperations = garbageCollectDocumentOperations(JSON.parse(readEntry(files, \"operations.json\")));\n\tconst operationsError = validateOperations(clearedOperations);\n\tif (operationsError.length) {\n\t\tconst errorMessages = operationsError.map((err) => err.message);\n\t\tthrow new Error(errorMessages.join(\"\\n\"));\n\t}\n\treturn {\n\t\t...replayDocument(initialState, Object.fromEntries(Object.entries(clearedOperations).filter(([scope]) => !NON_DOMAIN_SCOPES.has(scope))), reducer, header, void 0, {}, options),\n\t\toperations: clearedOperations\n\t};\n}\nasync function baseLoadFromInput(input, reducer, options) {\n\treturn loadFromZipData(await toUint8Array(input), reducer, options);\n}\nconst documentModelLoadFromInput = (input) => {\n\treturn baseLoadFromInput(input, documentModelReducer);\n};\nconst documentModelSaveToFileHandle = (document, input) => {\n\treturn baseSaveToFileHandle(document, input);\n};\nfunction writeFileBrowser(path, name, stream) {\n\tthrow FileSystemError;\n}\nfunction readFileBrowser(path) {\n\tthrow FileSystemError;\n}\nfunction fetchFileBrowser(url) {\n\tthrow FileSystemError;\n}\nconst getFileBrowser = async (file) => {\n\treturn readFileBrowser(file);\n};\n//#endregion\n//#region document-model/state.ts\n/**\n* Creates a default PHAuthState\n*/\nfunction defaultAuthState() {\n\treturn {};\n}\n/**\n* Creates a default PHDocumentState\n*/\nfunction defaultDocumentState() {\n\treturn {\n\t\tversion: 0,\n\t\thash: {\n\t\t\talgorithm: HASH_ALGORITHM_SHA1,\n\t\t\tencoding: HASH_ENCODING_BASE64\n\t\t}\n\t};\n}\n/**\n* Creates a default PHBaseState with auth and document properties\n*/\nfunction defaultBaseState() {\n\treturn {\n\t\tauth: defaultAuthState(),\n\t\tdocument: defaultDocumentState()\n\t};\n}\n/**\n* Creates a PHAuthState with the given properties\n*/\nfunction createAuthState(auth) {\n\treturn {\n\t\t...defaultAuthState(),\n\t\t...auth\n\t};\n}\n/**\n* Creates a PHDocumentState with the given properties\n*/\nfunction createDocumentState(document) {\n\treturn {\n\t\t...defaultDocumentState(),\n\t\t...document\n\t};\n}\n/**\n* Creates a PHBaseState with the given auth and document properties\n*/\nfunction createBaseState(auth, document) {\n\treturn {\n\t\tauth: createAuthState(auth),\n\t\tdocument: createDocumentState(document)\n\t};\n}\nfunction defaultGlobalState() {\n\treturn {\n\t\t...defaultBaseState(),\n\t\tauthor: {\n\t\t\tname: \"\",\n\t\t\twebsite: \"\"\n\t\t},\n\t\tdescription: \"\",\n\t\textension: \"\",\n\t\tid: \"\",\n\t\tname: \"\",\n\t\tspecifications: []\n\t};\n}\nfunction defaultLocalState() {\n\treturn {};\n}\nfunction defaultPHState() {\n\treturn {\n\t\t...defaultBaseState(),\n\t\tglobal: defaultGlobalState(),\n\t\tlocal: defaultLocalState()\n\t};\n}\nfunction createGlobalState(state) {\n\treturn {\n\t\t...defaultGlobalState(),\n\t\t...state || {}\n\t};\n}\nfunction createLocalState(state) {\n\treturn {\n\t\t...defaultLocalState(),\n\t\t...state || {}\n\t};\n}\nfunction createState(baseState, globalState, localState) {\n\treturn {\n\t\t...createBaseState(baseState?.auth, baseState?.document),\n\t\tglobal: createGlobalState(globalState),\n\t\tlocal: createLocalState(localState)\n\t};\n}\n//#endregion\nexport { AddChangeLogItemInputSchema, AddModuleInputSchema, AddOperationErrorInputSchema, AddOperationExampleInputSchema, AddOperationInputSchema, AddStateExampleInputSchema, AuthorSchema, BaseDocumentHeaderSchema, BaseDocumentStateSchema, CodeExampleSchema, ConfigEntrySchema, ConfigEntryTypeSchema, DeleteChangeLogItemInputSchema, DeleteModuleInputSchema, DeleteOperationErrorInputSchema, DeleteOperationExampleInputSchema, DeleteOperationInputSchema, DeleteStateExampleInputSchema, DocumentActionSchema, DocumentModelGlobalStateSchema, DocumentModelHeaderSchema, DocumentModelInputSchema, DocumentModelPHStateSchema, DocumentModelSchema, DocumentSpecificationSchema, FileSystemError, HASH_ALGORITHM_SHA1, HASH_ALGORITHM_SHA256, HASH_ALGORITHM_SHA512, HASH_ENCODING_BASE64, HASH_ENCODING_HEX, HashMismatchError, IntegrityIssueSubType, IntegrityIssueType, InvalidActionInputError, InvalidActionInputZodError, LoadStateActionInputSchema, LoadStateActionSchema, LoadStateActionStateInputSchema, Load_StateSchema, ManifestSchema, ModuleSchema, MoveOperationInputSchema, OPERATION_NAME_PATTERN, OperationErrorSchema, OperationScopeSchema, OperationSpecificationSchema, PowerhouseModuleSchema, PowerhouseModulesSchema, PruneActionInputSchema, PruneActionSchema, PruneSchema, PublisherSchema, RESERVED_OPERATION_NAMES, RedoActionInputSchema, RedoActionSchema, RedoSchema, ReorderChangeLogItemsInputSchema, ReorderModuleOperationsInputSchema, ReorderModulesInputSchema, ReorderOperationErrorsInputSchema, ReorderOperationExamplesInputSchema, ReorderStateExamplesInputSchema, ScopeStateSchema, SetAuthorNameInputSchema, SetAuthorWebsiteInputSchema, SetInitialStateInputSchema, SetModelDescriptionInputSchema, SetModelExtensionInputSchema, SetModelIdInputSchema, SetModelNameInputSchema, SetModuleDescriptionInputSchema, SetModuleNameInputSchema, SetNameActionInputSchema, SetNameActionSchema, SetOperationDescriptionInputSchema, SetOperationErrorCodeInputSchema, SetOperationErrorDescriptionInputSchema, SetOperationErrorNameInputSchema, SetOperationErrorTemplateInputSchema, SetOperationNameInputSchema, SetOperationReducerInputSchema, SetOperationSchemaInputSchema, SetOperationScopeInputSchema, SetOperationTemplateInputSchema, SetPreferredEditorActionInputSchema, SetPreferredEditorActionSchema, SetStateSchemaInputSchema, Set_NameSchema, Set_PreferredEditorSchema, StateSchema, UndoActionInputSchema, UndoActionSchema, UndoSchema, UpdateChangeLogItemInputSchema, UpdateOperationExampleInputSchema, UpdateStateExampleInputSchema, ab2hex, actionContext, actionFromAction, actionSigner, actions, addChangeLogItem, addModule, addOperation, addOperationError, addOperationExample, addStateExample, addUndo, assertIsDocumentModelDocument, assertIsDocumentModelState, assertModuleIdUnique, assertOperationErrorIdUnique, assertOperationExampleIdUnique, assertOperationIdUnique, attachBranch, baseActions, baseCreateDocument, baseLoadFromInput, baseReducer, baseSaveToFileHandle, buildOperationSignature, buildOperationSignatureMessage, buildOperationSignatureParams, buildSignedAction, checkCleanedOperationsIntegrity, checkOperationsIntegrity, createAction, createAuthState, createBaseState, createDocumentState, createGlobalState, createLocalState, createMinimalZip, createPresignedHeader, createReducer, createSignedHeader, createSignedHeaderForSigner, createState, createVerificationSigner, createZip, defaultAuthState, defaultBaseState, defaultDocumentState, defaultGlobalState, defaultLocalState, defaultPHState, definedNonNullAnySchema, deleteChangeLogItem, deleteModule, deleteOperation, deleteOperationError, deleteOperationExample, deleteStateExample, deriveOperationId, diffOperations, documentModelActions, documentModelDocumentType, documentModelFileExtension, documentModelGlobalState, documentModelHeaderReducer, documentModelInitialGlobalState, documentModelInitialLocalState, documentModelLoadFromInput, documentModelModuleReducer, documentModelOperationErrorReducer, documentModelOperationExampleReducer, documentModelOperationReducer, documentModelReducer, documentModelSaveToFileHandle, documentModelStateReducer, documentModelStateSchemaReducer, documentModelVersioningReducer, fetchFileBrowser, filterDocumentOperationsResultingState, filterDuplicatedOperations, findModuleOrThrow, findOperationErrorOrThrow, findOperationExampleOrThrow, findOperationOrThrow, garbageCollect, garbageCollectDocumentOperations, garbageCollectV2, generateId, generateMock, getAllOperationNames, getDocumentLastModified, getFileBrowser, getUnixTimestamp, groupOperationsByScope, hashBrowser, hashDocumentStateForScope, hex2ab, isDefinedNonNullAny, isDocumentAction, isDocumentModelDocument, isDocumentModelState, isNoopOperation, isReservedOperationName, isUndo, isUndoRedo, isValidOperationNameFormat, loadState, loadStateOperation, mapSkippedOperations, mapSkippedOperationsV2, merge, moveOperation, nextSkipNumber, noop, operationExampleCreators, operationFromAction, operationFromOperation, operationWithContext, operationsAreEqual, parseResultingState, precedes, prepareOperations, processUndoRedo, prune, pruneOperation, readFileBrowser, readOnly, redo, redoOperation, releaseNewVersion, removeExistingOperations, reorderChangeLogItems, reorderModuleOperations, reorderModules, reorderOperationErrors, reorderOperationExamples, reorderStateExamples, replayDocument, replayOperations, reshuffleByTimestamp, reshuffleByTimestampAndIndex, setAuthorName, setAuthorWebsite, setInitialState, setModelDescription, setModelExtension, setModelId, setModelName, setModuleDescription, setModuleName, setName, setNameOperation, setOperationDescription, setOperationErrorCode, setOperationErrorDescription, setOperationErrorName, setOperationErrorTemplate, setOperationName, setOperationReducer, setOperationSchema, setOperationScope, setOperationTemplate, setPreferredEditor, setPreferredEditorOperation, setStateSchema, sign, skipHeaderOperations, sortMappedOperations, sortOperations, split, undo, undoOperation, undoOperationV2, updateChangeLogItem, updateDocument, updateHeaderRevision, updateOperationExample, updateStateExample, validateHeader, validateInitialState, validateModule, validateModuleOperation, validateModules, validateOperationName, validateOperations, validateStateSchemaName, verify, verifyOperationSignature, writeFileBrowser };\n\n//# sourceMappingURL=index.js.map","import { actions, assertIsDocumentModelDocument, assertIsDocumentModelState, baseCreateDocument, createState, defaultBaseState, documentModelDocumentType, documentModelFileExtension, documentModelGlobalState, documentModelInitialGlobalState, documentModelInitialLocalState, documentModelLoadFromInput, documentModelReducer, documentModelSaveToFileHandle, isDocumentModelDocument, isDocumentModelState } from \"@powerhousedao/shared/document-model\";\nexport * from \"@powerhousedao/shared/document-model\";\n//#region src/state.ts\nconst isStateOfType = (state) => {\n\treturn isDocumentModelState(state);\n};\nconst assertIsStateOfType = (state) => {\n\tassertIsDocumentModelState(state);\n};\nconst isDocumentOfType = (document) => {\n\treturn isDocumentModelDocument(document);\n};\nconst assertIsDocumentOfType = (document) => {\n\tassertIsDocumentModelDocument(document);\n};\nconst documentModelCreateState = (state) => {\n\treturn {\n\t\t...defaultBaseState(),\n\t\tglobal: {\n\t\t\t...documentModelInitialGlobalState,\n\t\t\t...state?.global ?? {}\n\t\t},\n\t\tlocal: {\n\t\t\t...documentModelInitialLocalState,\n\t\t\t...state?.local ?? {}\n\t\t}\n\t};\n};\nfunction documentModelCreateDocument(state) {\n\treturn baseCreateDocument(documentModelCreateState, state, documentModelDocumentType);\n}\n//#endregion\n//#region src/module.ts\nconst utils = {\n\tfileExtension: documentModelFileExtension,\n\tcreateState: documentModelCreateState,\n\tcreateDocument: documentModelCreateDocument,\n\tloadFromInput: documentModelLoadFromInput,\n\tsaveToFileHandle: documentModelSaveToFileHandle,\n\tisStateOfType,\n\tassertIsStateOfType,\n\tisDocumentOfType,\n\tassertIsDocumentOfType\n};\nconst documentModelDocumentModelModule = {\n\treducer: documentModelReducer,\n\tdocumentModel: createState(defaultBaseState(), documentModelGlobalState),\n\tactions,\n\tutils\n};\n//#endregion\n//#region src/controller.ts\nvar PHDocumentController = class PHDocumentController {\n\tmodule;\n\t_document;\n\tlisteners = [];\n\tconstructor(module, initialDocument) {\n\t\tthis.module = module;\n\t\tthis._document = initialDocument ?? module.utils.createDocument();\n\t\tfor (const actionType in this.module.actions) Object.defineProperty(this, actionType, { value: (input) => {\n\t\t\tconst action = this.module.actions[actionType](input);\n\t\t\tthis._document = this.module.reducer(this._document, action);\n\t\t\tthis.notifyListeners();\n\t\t\treturn this;\n\t\t} });\n\t}\n\tget document() {\n\t\treturn this._document;\n\t}\n\tget header() {\n\t\treturn this.document.header;\n\t}\n\tget state() {\n\t\treturn this.document.state;\n\t}\n\tget initialState() {\n\t\treturn this.document.initialState;\n\t}\n\tget operations() {\n\t\treturn this.document.operations;\n\t}\n\tget clipboard() {\n\t\treturn this.document.clipboard;\n\t}\n\tonChange(listener) {\n\t\tthis.listeners.push(listener);\n\t\treturn () => {\n\t\t\tthis.listeners = this.listeners.filter((l) => l !== listener);\n\t\t};\n\t}\n\tnotifyListeners() {\n\t\tif (this.listeners.length === 0) return;\n\t\tconst event = { document: this._document };\n\t\tfor (const listener of this.listeners) listener(event);\n\t}\n\tstatic forDocumentModel(module) {\n\t\treturn class extends PHDocumentController {\n\t\t\tconstructor(initialDocument) {\n\t\t\t\tsuper(module, initialDocument);\n\t\t\t}\n\t\t};\n\t}\n};\nconst DocumentModelController = PHDocumentController.forDocumentModel(documentModelDocumentModelModule);\n//#endregion\n//#region src/logger.ts\nconst tokenSub = /@([a-zA-Z0-9_]+)/g;\nconst dtf = new Intl.DateTimeFormat(void 0, {\n\thour12: false,\n\thour: \"2-digit\",\n\tminute: \"2-digit\",\n\tsecond: \"2-digit\",\n\tfractionalSecondDigits: 2\n});\nconst stringify = (value, includeStack) => {\n\tif (value === null || value === void 0) return \"null\";\n\tif (typeof value === \"string\") return value;\n\tif (value instanceof Error) {\n\t\tconst base = `${value.name}: ${value.message}`;\n\t\treturn includeStack && value.stack ? `${base}\\n${value.stack}` : base;\n\t}\n\tif (typeof value === \"object\") try {\n\t\treturn JSON.stringify(value);\n\t} catch {\n\t\treturn Object.prototype.toString.call(value);\n\t}\n\tif (typeof value === \"function\") {\n\t\tconst name = value.name;\n\t\treturn name ? `${name}()` : \"anonymous()\";\n\t}\n\treturn String(value);\n};\nconst formatMessage = (tagString, message, replacements, includeStack) => {\n\tconst meta = {};\n\tconst uniqueTokens = [];\n\tlet results;\n\twhile ((results = tokenSub.exec(message)) !== null) {\n\t\tconst tokenName = results[1];\n\t\tif (uniqueTokens.indexOf(tokenName) === -1) {\n\t\t\tuniqueTokens.push(tokenName);\n\t\t\tmeta[tokenName] = replacements[uniqueTokens.length - 1];\n\t\t}\n\t}\n\tfor (const [key, value] of Object.entries(meta)) message = message.replaceAll(`@${key}`, stringify(value, includeStack));\n\tconst extras = replacements.slice(uniqueTokens.length);\n\tif (extras.length > 0) message = `${message} ${extras.map((v) => stringify(v, includeStack)).join(\" \")}`;\n\tif (tagString.length > 0) message = `${tagString} ${message}`;\n\tconst now = /* @__PURE__ */ new Date();\n\tmeta[\"timestamp\"] = dtf.format(now);\n\treturn [message, meta];\n};\nconst LOG_LEVELS = {\n\tverbose: 0,\n\tdebug: 1,\n\tinfo: 2,\n\twarn: 3,\n\terror: 4\n};\nvar ConsoleLogger = class ConsoleLogger {\n\t#tags;\n\t#tagString;\n\t#level = LOG_LEVELS.info;\n\terrorHandler;\n\tconstructor(tags, handler) {\n\t\tthis.#tags = tags || [];\n\t\tthis.#tagString = this.#tags.map((tag) => `[${tag}]`).join(\"\");\n\t\tthis.errorHandler = handler ?? (() => {});\n\t}\n\tget level() {\n\t\treturn Object.keys(LOG_LEVELS).find((key) => LOG_LEVELS[key] === this.#level);\n\t}\n\tset level(value) {\n\t\tthis.#level = LOG_LEVELS[value];\n\t}\n\tchild(tags) {\n\t\tconst logger = new ConsoleLogger([...this.#tags, ...tags], this.errorHandler);\n\t\tlogger.level = this.level;\n\t\treturn logger;\n\t}\n\tget #includeStack() {\n\t\treturn this.#level <= LOG_LEVELS.debug;\n\t}\n\tverbose(message, ...replacements) {\n\t\tif (this.#level <= LOG_LEVELS.verbose) {\n\t\t\tconst [formattedMessage, meta] = formatMessage(this.#tagString, message, replacements, this.#includeStack);\n\t\t\tconsole.debug(`[${meta[\"timestamp\"]}] ${formattedMessage}`);\n\t\t}\n\t}\n\tdebug(message, ...replacements) {\n\t\tif (this.#level <= LOG_LEVELS.debug) {\n\t\t\tconst [formattedMessage, meta] = formatMessage(this.#tagString, message, replacements, this.#includeStack);\n\t\t\tconsole.debug(`[${meta[\"timestamp\"]}] ${formattedMessage}`);\n\t\t}\n\t}\n\tinfo(message, ...replacements) {\n\t\tif (this.#level <= LOG_LEVELS.info) {\n\t\t\tconst [formattedMessage, meta] = formatMessage(this.#tagString, message, replacements, this.#includeStack);\n\t\t\tconsole.info(`[${meta[\"timestamp\"]}] ${formattedMessage}`);\n\t\t}\n\t}\n\twarn(message, ...replacements) {\n\t\tif (this.#level <= LOG_LEVELS.warn) {\n\t\t\tconst [formattedMessage, meta] = formatMessage(this.#tagString, message, replacements, this.#includeStack);\n\t\t\tconsole.warn(`[${meta[\"timestamp\"]}] ${formattedMessage}`);\n\t\t}\n\t}\n\terror(message, ...replacements) {\n\t\tif (this.#level <= LOG_LEVELS.error) {\n\t\t\tconst [formattedMessage, meta] = formatMessage(this.#tagString, message, replacements, this.#includeStack);\n\t\t\tconsole.error(`[${meta[\"timestamp\"]}] ${formattedMessage}`);\n\t\t}\n\t}\n};\nconst logger = new ConsoleLogger();\nconst setLogLevel = (level) => {\n\tlogger.level = level;\n};\nconst setErrorHandler = (handler) => {\n\tlogger.errorHandler = handler;\n};\nconst childLogger = (tags) => {\n\treturn logger.child(tags);\n};\n//#endregion\nexport { ConsoleLogger, DocumentModelController, PHDocumentController, assertIsDocumentOfType, assertIsStateOfType, childLogger, documentModelCreateDocument, documentModelCreateState, documentModelDocumentModelModule, isDocumentOfType, isStateOfType, logger, setErrorHandler, setLogLevel };\n\n//# sourceMappingURL=index.js.map","import { BaseDocumentHeaderSchema, BaseDocumentStateSchema, baseCreateDocument, baseLoadFromInput, baseSaveToFileHandle, createAction, createBaseState, createReducer, createState as createState$1, defaultBaseState, isDocumentAction } from \"../document-model/index.js\";\nimport { z } from \"zod\";\n//#region \\0rolldown/runtime.js\nvar __defProp = Object.defineProperty;\nvar __exportAll = (all, no_symbols) => {\n\tlet target = {};\n\tfor (var name in all) __defProp(target, name, {\n\t\tget: all[name],\n\t\tenumerable: true\n\t});\n\tif (!no_symbols) __defProp(target, Symbol.toStringTag, { value: \"Module\" });\n\treturn target;\n};\n//#endregion\n//#region document-drive/constants.ts\nconst driveDocumentFileExtension = \"phdd\";\n//#endregion\n//#region document-drive/gen/schema/zod.ts\nconst isDefinedNonNullAny = (v) => v !== void 0 && v !== null;\nconst definedNonNullAnySchema = z.any().refine((v) => isDefinedNonNullAny(v));\nconst TransmitterTypeSchema = z.enum([\n\t\"Internal\",\n\t\"MatrixConnect\",\n\t\"PullResponder\",\n\t\"RESTWebhook\",\n\t\"SecureConnect\",\n\t\"SwitchboardPush\"\n]);\nconst TriggerTypeSchema = z.enum([\"PullResponder\"]);\nfunction AddFileInputSchema() {\n\treturn z.object({\n\t\tdocumentType: z.string(),\n\t\tid: z.string(),\n\t\tname: z.string(),\n\t\tparentFolder: z.string().nullish()\n\t});\n}\nfunction AddFolderInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tname: z.string(),\n\t\tparentFolder: z.string().nullish()\n\t});\n}\nfunction AddListenerInputSchema() {\n\treturn z.object({ listener: ListenerInputSchema() });\n}\nfunction AddTriggerInputSchema() {\n\treturn z.object({ trigger: TriggerInputSchema() });\n}\nfunction CopyNodeInputSchema() {\n\treturn z.object({\n\t\tsrcId: z.string(),\n\t\ttargetId: z.string(),\n\t\ttargetName: z.string().nullish(),\n\t\ttargetParentFolder: z.string().nullish()\n\t});\n}\nfunction DeleteNodeInputSchema() {\n\treturn z.object({ id: z.string() });\n}\nfunction DocumentDriveLocalStateSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"DocumentDriveLocalState\").optional(),\n\t\tavailableOffline: z.boolean(),\n\t\tlisteners: z.array(ListenerSchema()),\n\t\tsharingType: z.string().nullable(),\n\t\ttriggers: z.array(TriggerSchema())\n\t});\n}\nfunction DocumentDriveStateSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"DocumentDriveState\").optional(),\n\t\ticon: z.string().nullable(),\n\t\tname: z.string(),\n\t\tnodes: z.array(NodeSchema())\n\t});\n}\nfunction FileNodeSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"FileNode\").optional(),\n\t\tdocumentType: z.string(),\n\t\tid: z.string(),\n\t\tkind: z.string(),\n\t\tname: z.string(),\n\t\tparentFolder: z.string().nullable()\n\t});\n}\nfunction FolderNodeSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"FolderNode\").optional(),\n\t\tid: z.string(),\n\t\tkind: z.string(),\n\t\tname: z.string(),\n\t\tparentFolder: z.string().nullable()\n\t});\n}\nfunction ListenerSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"Listener\").optional(),\n\t\tblock: z.boolean(),\n\t\tcallInfo: ListenerCallInfoSchema().nullable(),\n\t\tfilter: ListenerFilterSchema(),\n\t\tlabel: z.string().nullable(),\n\t\tlistenerId: z.string(),\n\t\tsystem: z.boolean()\n\t});\n}\nfunction ListenerInputSchema() {\n\treturn z.object({\n\t\tblock: z.boolean(),\n\t\tcallInfo: ListenerCallInfoInputSchema().nullish(),\n\t\tfilter: ListenerFilterInputSchema(),\n\t\tlabel: z.string().nullish(),\n\t\tlistenerId: z.string(),\n\t\tsystem: z.boolean()\n\t});\n}\nfunction ListenerCallInfoSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"ListenerCallInfo\").optional(),\n\t\tdata: z.string().nullable(),\n\t\tname: z.string().nullable(),\n\t\ttransmitterType: TransmitterTypeSchema.nullable()\n\t});\n}\nfunction ListenerCallInfoInputSchema() {\n\treturn z.object({\n\t\tdata: z.string().nullish(),\n\t\tname: z.string().nullish(),\n\t\ttransmitterType: TransmitterTypeSchema.nullish()\n\t});\n}\nfunction ListenerFilterSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"ListenerFilter\").optional(),\n\t\tbranch: z.array(z.string()).nullable(),\n\t\tdocumentId: z.array(z.string()).nullable(),\n\t\tdocumentType: z.array(z.string()),\n\t\tscope: z.array(z.string()).nullable()\n\t});\n}\nfunction ListenerFilterInputSchema() {\n\treturn z.object({\n\t\tbranch: z.array(z.string()).nullish(),\n\t\tdocumentId: z.array(z.string()).nullish(),\n\t\tdocumentType: z.array(z.string()).nullish(),\n\t\tscope: z.array(z.string()).nullish()\n\t});\n}\nfunction MoveNodeInputSchema() {\n\treturn z.object({\n\t\tsrcFolder: z.string(),\n\t\ttargetParentFolder: z.string().nullish()\n\t});\n}\nfunction NodeSchema() {\n\treturn z.union([FileNodeSchema(), FolderNodeSchema()]);\n}\nfunction PullResponderTriggerDataSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"PullResponderTriggerData\").optional(),\n\t\tinterval: z.string(),\n\t\tlistenerId: z.string(),\n\t\turl: z.string()\n\t});\n}\nfunction PullResponderTriggerDataInputSchema() {\n\treturn z.object({\n\t\tinterval: z.string(),\n\t\tlistenerId: z.string(),\n\t\turl: z.string()\n\t});\n}\nfunction RemoveListenerInputSchema() {\n\treturn z.object({ listenerId: z.string() });\n}\nfunction RemoveTriggerInputSchema() {\n\treturn z.object({ triggerId: z.string() });\n}\nfunction SetAvailableOfflineInputSchema() {\n\treturn z.object({ availableOffline: z.boolean() });\n}\nfunction SetDriveIconInputSchema() {\n\treturn z.object({ icon: z.string() });\n}\nfunction SetDriveNameInputSchema() {\n\treturn z.object({ name: z.string() });\n}\nfunction SetSharingTypeInputSchema() {\n\treturn z.object({ type: z.string() });\n}\nfunction TriggerSchema() {\n\treturn z.object({\n\t\t__typename: z.literal(\"Trigger\").optional(),\n\t\tdata: TriggerDataSchema().nullable(),\n\t\tid: z.string(),\n\t\ttype: TriggerTypeSchema\n\t});\n}\nfunction TriggerInputSchema() {\n\treturn z.object({\n\t\tdata: PullResponderTriggerDataInputSchema().nullish(),\n\t\tid: z.string(),\n\t\ttype: TriggerTypeSchema\n\t});\n}\nfunction TriggerDataSchema() {\n\treturn PullResponderTriggerDataSchema();\n}\nfunction UpdateFileInputSchema() {\n\treturn z.object({\n\t\tdocumentType: z.string().nullish(),\n\t\tid: z.string(),\n\t\tname: z.string().nullish(),\n\t\tparentFolder: z.string().nullish()\n\t});\n}\nfunction UpdateNodeInputSchema() {\n\treturn z.object({\n\t\tid: z.string(),\n\t\tname: z.string().nullish(),\n\t\tparentFolder: z.string().nullish()\n\t});\n}\n//#endregion\n//#region document-drive/gen/node/creators.ts\nfunction addFile(input) {\n\tif (input && typeof input === \"object\" && \"synchronizationUnits\" in input) return createAction(\"ADD_FILE\", { ...input }, void 0, void 0, \"global\");\n\treturn createAction(\"ADD_FILE\", { ...input }, void 0, AddFileInputSchema, \"global\");\n}\nconst addFolder = (input) => createAction(\"ADD_FOLDER\", { ...input }, void 0, AddFolderInputSchema, \"global\");\nconst deleteNode = (input) => createAction(\"DELETE_NODE\", { ...input }, void 0, DeleteNodeInputSchema, \"global\");\nconst updateFile = (input) => createAction(\"UPDATE_FILE\", { ...input }, void 0, UpdateFileInputSchema, \"global\");\nconst updateNode = (input) => createAction(\"UPDATE_NODE\", { ...input }, void 0, UpdateNodeInputSchema, \"global\");\nconst copyNode = (input) => createAction(\"COPY_NODE\", { ...input }, void 0, CopyNodeInputSchema, \"global\");\nconst moveNode = (input) => createAction(\"MOVE_NODE\", { ...input }, void 0, MoveNodeInputSchema, \"global\");\n//#endregion\n//#region document-drive/gen/drive/creators.ts\nconst setDriveName = (input) => createAction(\"SET_DRIVE_NAME\", { ...input }, void 0, SetDriveNameInputSchema, \"global\");\nconst setDriveIcon = (input) => createAction(\"SET_DRIVE_ICON\", { ...input }, void 0, SetDriveIconInputSchema, \"global\");\nconst setSharingType = (input) => createAction(\"SET_SHARING_TYPE\", { ...input }, void 0, SetSharingTypeInputSchema, \"local\");\nconst setAvailableOffline = (input) => createAction(\"SET_AVAILABLE_OFFLINE\", { ...input }, void 0, SetAvailableOfflineInputSchema, \"local\");\nconst addListener = (input) => createAction(\"ADD_LISTENER\", { ...input }, void 0, AddListenerInputSchema, \"local\");\nconst removeListener = (input) => createAction(\"REMOVE_LISTENER\", { ...input }, void 0, RemoveListenerInputSchema, \"local\");\nconst addTrigger = (input) => createAction(\"ADD_TRIGGER\", { ...input }, void 0, AddTriggerInputSchema, \"local\");\nconst removeTrigger = (input) => createAction(\"REMOVE_TRIGGER\", { ...input }, void 0, RemoveTriggerInputSchema, \"local\");\n//#endregion\n//#region document-drive/gen/creators.ts\nvar creators_exports = /* @__PURE__ */ __exportAll({\n\taddFile: () => addFile,\n\taddFolder: () => addFolder,\n\taddListener: () => addListener,\n\taddTrigger: () => addTrigger,\n\tcopyNode: () => copyNode,\n\tdeleteNode: () => deleteNode,\n\tmoveNode: () => moveNode,\n\tremoveListener: () => removeListener,\n\tremoveTrigger: () => removeTrigger,\n\tsetAvailableOffline: () => setAvailableOffline,\n\tsetDriveIcon: () => setDriveIcon,\n\tsetDriveName: () => setDriveName,\n\tsetSharingType: () => setSharingType,\n\tupdateFile: () => updateFile,\n\tupdateNode: () => updateNode\n});\n//#endregion\n//#region document-drive/gen/document-model.ts\nconst driveDocumentModel = {\n\tid: \"powerhouse/document-drive\",\n\tname: \"DocumentDrive\",\n\textension: \"phdd\",\n\tdescription: \"\",\n\tauthor: {\n\t\tname: \"Powerhouse Inc\",\n\t\twebsite: \"https://www.powerhouse.inc/\"\n\t},\n\tspecifications: [{\n\t\tversion: 1,\n\t\tchangeLog: [],\n\t\tstate: {\n\t\t\tglobal: {\n\t\t\t\tschema: \"type FolderNode {\\n    id: String!\\n    name: String!\\n    kind: String!\\n    parentFolder: String\\n}\\n\\ntype FileNode {\\n    id: String!\\n    name: String!\\n    kind: String!\\n    documentType: String!\\n    parentFolder: String\\n}\\n\\nunion Node = FolderNode | FileNode\\n\\ntype DocumentDriveState {\\n    name: String!\\n    nodes: [Node!]!\\n    icon: String\\n}\",\n\t\t\t\tinitialValue: \"\\\"{\\\\\\\"name\\\\\\\":\\\\\\\"\\\\\\\",\\\\\\\"nodes\\\\\\\":[],\\\\\\\"icon\\\\\\\":null}\\\"\",\n\t\t\t\texamples: []\n\t\t\t},\n\t\t\tlocal: {\n\t\t\t\tschema: \"type ListenerFilter {\\n    documentType: [String!]!\\n    documentId: [ID!]\\n    scope: [String!]\\n    branch: [String!]\\n}\\n\\nenum TransmitterType {\\n    Internal,\\n    SwitchboardPush,\\n    PullResponder,\\n    SecureConnect, \\n    MatrixConnect,\\n    RESTWebhook\\n}\\n\\ntype ListenerCallInfo {\\n    transmitterType: TransmitterType\\n    name: String\\n    data: String\\n}\\n\\ntype Listener {\\n    listenerId: ID!\\n    label: String\\n    block: Boolean!\\n    system: Boolean!\\n    filter: ListenerFilter!\\n    callInfo: ListenerCallInfo\\n}\\n\\nenum TriggerType {\\n    PullResponder\\n}\\n\\ntype PullResponderTriggerData {\\n    listenerId: ID!\\n    url: String!\\n    interval: String!\\n}\\n\\nunion TriggerData = PullResponderTriggerData\\n\\ntype Trigger {\\n    id: ID!\\n    type: TriggerType!\\n    data: TriggerData\\n}\\n\\ntype DocumentDriveLocalState{\\n    sharingType: String\\n    listeners: [Listener!]!\\n    triggers: [Trigger!]!\\n    availableOffline: Boolean!\\n}\",\n\t\t\t\tinitialValue: \"\\\"{ \\\\\\\"listeners\\\\\\\": [], \\\\\\\"triggers\\\\\\\": [], \\\\\\\"sharingType\\\\\\\": \\\\\\\"private\\\\\\\", \\\\\\\"availableOffline\\\\\\\": false}\\\"\",\n\t\t\t\texamples: []\n\t\t\t}\n\t\t},\n\t\tmodules: [{\n\t\t\tid: \"GRzuvv78tBvmB6ciitokLfonNHA=\",\n\t\t\tname: \"Node\",\n\t\t\tdescription: \"\",\n\t\t\toperations: [\n\t\t\t\t{\n\t\t\t\t\tid: \"7xiTdxonc9yEASR8sfV/KnbSV10=\",\n\t\t\t\t\tname: \"ADD_FILE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input AddFileInput {\\n    id: ID!\\n    name: String!\\n    documentType: String!\\n    parentFolder: ID\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"4lzNMMKKdIAtEU6i12xLgi9hp+U=\",\n\t\t\t\t\tname: \"ADD_FOLDER\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input AddFolderInput {\\n    id: ID!\\n    name: String!\\n    parentFolder: ID\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"53jH2/3TWTTcgCJiv2C+BmuC6i0=\",\n\t\t\t\t\tname: \"DELETE_NODE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input DeleteNodeInput {\\n    id: ID!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"pNn+Y1/HVq/GNMk7t0u3g3gtMLE=\",\n\t\t\t\t\tname: \"UPDATE_FILE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input UpdateFileInput {\\n    id: ID!\\n    parentFolder: ID\\n    name: String\\n    documentType: String\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"P0x1M8Mnt+Q/+9nggkwgVbfybsc=\",\n\t\t\t\t\tname: \"UPDATE_NODE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input UpdateNodeInput {\\n    id: ID!\\n    parentFolder: ID\\n    name: String\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"vnQ7OB5b3wGLgjhbgJqAIpA+JLE=\",\n\t\t\t\t\tname: \"COPY_NODE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input CopyNodeInput {\\n    srcId: ID!\\n    targetId: ID!\\n    targetName: String\\n    targetParentFolder: ID\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"VNyiD/sNGzk6k9A1Qe7s8dmrJxA=\",\n\t\t\t\t\tname: \"MOVE_NODE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input MoveNodeInput {\\n    srcFolder: ID!\\n    targetParentFolder: ID\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t}\n\t\t\t]\n\t\t}, {\n\t\t\tid: \"0dHwHlxOM9x0vMZ+gLnKxf2qTEo=\",\n\t\t\tname: \"Drive\",\n\t\t\tdescription: \"\",\n\t\t\toperations: [\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z1dsU=\",\n\t\t\t\t\tname: \"SET_DRIVE_NAME\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input SetDriveNameInput {\\n    name: String!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z30dsU=\",\n\t\t\t\t\tname: \"SET_DRIVE_ICON\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input SetDriveIconInput {\\n    icon: String!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"global\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z2dsU=\",\n\t\t\t\t\tname: \"SET_SHARING_TYPE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input SetSharingTypeInput {\\n    type: String!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z3dsU=\",\n\t\t\t\t\tname: \"SET_AVAILABLE_OFFLINE\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input SetAvailableOfflineInput {\\n    availableOffline: Boolean!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z9dsU=\",\n\t\t\t\t\tname: \"ADD_LISTENER\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input ListenerFilterInput {\\n    documentType: [String!]\\n    documentId: [ID!]\\n    scope: [String!]\\n    branch: [String!]\\n}\\n\\ninput ListenerCallInfoInput {\\n    transmitterType: TransmitterType\\n    name: String\\n    data: String\\n}\\n\\ninput ListenerInput {\\n    listenerId: ID!\\n    label: String\\n    block: Boolean!\\n    system: Boolean!\\n    filter: ListenerFilterInput!\\n    callInfo: ListenerCallInfoInput\\n}\\n\\ninput AddListenerInput {\\n    listener: ListenerInput!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z10dsU=\",\n\t\t\t\t\tname: \"REMOVE_LISTENER\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input RemoveListenerInput {\\n    listenerId: String!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z20dsU=\",\n\t\t\t\t\tname: \"ADD_TRIGGER\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input PullResponderTriggerDataInput {\\n    listenerId: ID!\\n    url: String!\\n    interval: String!\\n}\\n\\ninput TriggerInput {\\n    id: ID!\\n    type: TriggerType!\\n    data: PullResponderTriggerDataInput\\n}\\n\\ninput AddTriggerInput {\\n    trigger: TriggerInput!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tid: \"qGCiPGpTt/cyz3HzyrBn92z30dsU=\",\n\t\t\t\t\tname: \"REMOVE_TRIGGER\",\n\t\t\t\t\tdescription: \"\",\n\t\t\t\t\tschema: \"input RemoveTriggerInput {\\n    triggerId: String!\\n}\",\n\t\t\t\t\ttemplate: \"\",\n\t\t\t\t\treducer: \"\",\n\t\t\t\t\terrors: [],\n\t\t\t\t\texamples: [],\n\t\t\t\t\tscope: \"local\"\n\t\t\t\t}\n\t\t\t]\n\t\t}]\n\t}]\n};\n//#endregion\n//#region document-drive/gen/document-type.ts\nconst driveDocumentType = \"powerhouse/document-drive\";\n//#endregion\n//#region document-drive/gen/document-schema.ts\n/** Schema for validating the header object of a Drive document */\nconst DriveDocumentHeaderSchema = BaseDocumentHeaderSchema.extend({ documentType: z.literal(driveDocumentType) });\n/** Schema for validating the state object of a Drive document */\nconst DrivePHStateSchema = BaseDocumentStateSchema.extend({\n\tglobal: DocumentDriveStateSchema(),\n\tlocal: DocumentDriveLocalStateSchema()\n});\nconst DriveDocumentSchema = z.object({\n\theader: DriveDocumentHeaderSchema,\n\tstate: DrivePHStateSchema,\n\tinitialState: DrivePHStateSchema\n});\n/** Simple helper function to check if a state object is a Drive document state object */\nfunction isDriveState(state) {\n\treturn DrivePHStateSchema.safeParse(state).success;\n}\n/** Simple helper function to assert that a document state object is a Drive document state object */\nfunction assertIsDriveState(state) {\n\tDrivePHStateSchema.parse(state);\n}\n/** Simple helper function to check if a document is a Drive document */\nfunction isDriveDocument(document) {\n\treturn DriveDocumentSchema.safeParse(document).success;\n}\n/** Simple helper function to assert that a document is a Drive document */\nfunction assertIsDriveDocument(document) {\n\tDriveDocumentSchema.parse(document);\n}\n//#endregion\n//#region document-drive/gen/ph-factories.ts\n/**\n* Factory methods for creating DocumentDriveDocument instances\n*/\nfunction defaultGlobalState() {\n\treturn {\n\t\ticon: null,\n\t\tname: \"\",\n\t\tnodes: []\n\t};\n}\nfunction defaultLocalState() {\n\treturn {\n\t\tavailableOffline: false,\n\t\tlisteners: [],\n\t\tsharingType: null,\n\t\ttriggers: []\n\t};\n}\nfunction defaultPHState() {\n\treturn {\n\t\t...defaultBaseState(),\n\t\tglobal: defaultGlobalState(),\n\t\tlocal: defaultLocalState()\n\t};\n}\nfunction createGlobalState(state) {\n\treturn {\n\t\t...defaultGlobalState(),\n\t\t...state || {}\n\t};\n}\nfunction createLocalState(state) {\n\treturn {\n\t\t...defaultLocalState(),\n\t\t...state || {}\n\t};\n}\nfunction createState(baseState, globalState, localState) {\n\treturn {\n\t\t...createBaseState(baseState?.auth, baseState?.document),\n\t\tglobal: createGlobalState(globalState),\n\t\tlocal: createLocalState(localState)\n\t};\n}\n//#endregion\n//#region document-drive/src/reducers/drive.ts\nconst driveReducer = {\n\tsetDriveNameOperation(state, action, dispatch) {\n\t\tstate.name = action.input.name;\n\t},\n\tsetDriveIconOperation(state, action, dispatch) {\n\t\tstate.icon = action.input.icon;\n\t},\n\tsetSharingTypeOperation(state, action, dispatch) {\n\t\tstate.sharingType = action.input.type;\n\t},\n\tsetAvailableOfflineOperation(state, action, dispatch) {\n\t\tstate.availableOffline = action.input.availableOffline;\n\t},\n\taddListenerOperation(state, action, dispatch) {\n\t\tconst { listener: input } = action.input;\n\t\tif (state.listeners.find((l) => l.listenerId === input.listenerId)) throw new Error(`A listener with Id: ${input.listenerId} already exists`);\n\t\tconst listener = {\n\t\t\tlistenerId: input.listenerId,\n\t\t\tlabel: input.label ?? null,\n\t\t\tblock: input.block,\n\t\t\tsystem: input.system,\n\t\t\tfilter: {\n\t\t\t\tdocumentType: input.filter.documentType ?? null,\n\t\t\t\tdocumentId: input.filter.documentId ?? null,\n\t\t\t\tscope: input.filter.scope ?? null,\n\t\t\t\tbranch: input.filter.branch ?? null\n\t\t\t},\n\t\t\tcallInfo: input.callInfo ? {\n\t\t\t\ttransmitterType: input.callInfo.transmitterType ?? null,\n\t\t\t\tname: input.callInfo.name ?? null,\n\t\t\t\tdata: input.callInfo.data ?? null\n\t\t\t} : null\n\t\t};\n\t\tstate.listeners.push(listener);\n\t},\n\tremoveListenerOperation(state, action, dispatch) {\n\t\tstate.listeners = state.listeners.filter((listener) => listener.listenerId !== action.input.listenerId);\n\t},\n\taddTriggerOperation(state, action, dispatch) {\n\t\tconst { trigger: input } = action.input;\n\t\tif (state.triggers.find((t) => t.id === input.id)) throw new Error(`A trigger with Id: ${input.id} already exists`);\n\t\tconst trigger = {\n\t\t\tid: input.id,\n\t\t\ttype: input.type,\n\t\t\tdata: input.data ? { ...input.data } : null\n\t\t};\n\t\tstate.triggers.push(trigger);\n\t},\n\tremoveTriggerOperation(state, action, dispatch) {\n\t\tstate.triggers = state.triggers.filter((trigger) => trigger.id !== action.input.triggerId);\n\t}\n};\n//#endregion\n//#region document-drive/src/utils.ts\nfunction isFileNode(node) {\n\treturn node.kind === \"file\";\n}\nfunction isFolderNode(node) {\n\treturn node.kind === \"folder\";\n}\nfunction getAncestors(node, allNodes) {\n\tif (!node.parentFolder) return [];\n\telse {\n\t\tconst parentNode = allNodes.find((_node) => _node.id === node.parentFolder);\n\t\tif (!parentNode) throw new Error(`Parent node with id ${node.parentFolder} not found`);\n\t\treturn [parentNode, ...getAncestors(parentNode, allNodes)];\n\t}\n}\nfunction getDescendants(node, allNodes) {\n\tconst children = allNodes.filter((_node) => _node.parentFolder === node.id);\n\tconst descendants = children.map((child) => getDescendants(child, allNodes));\n\treturn [...children, ...descendants.flat()];\n}\n/**\n* Generates a copy of nodes based on the provided source and target information.\n* @param src - The source information for generating the copy.\n* @param idGenerator - The function used to generate new IDs for the copied nodes.\n* @param nodes - The array of nodes to copy from.\n* @returns An array of copied nodes with updated IDs and parent folders.\n* @throws Error if the root node with the specified ID is not found.\n*/\nfunction generateNodesCopy(src, idGenerator, nodes) {\n\tconst rootNode = nodes.find((node) => node.id === src.srcId);\n\tif (!rootNode) throw new Error(`Node with id ${src.srcId} not found`);\n\tconst nodesToCopy = [{\n\t\t...rootNode,\n\t\tname: src.targetName || rootNode.name,\n\t\tparentFolder: src.targetParentFolder || null\n\t}, ...getDescendants(rootNode, nodes)];\n\tconst ids = {};\n\tif (src.targetParentFolder) ids[src.targetParentFolder] = src.targetParentFolder;\n\tconst getNewNodeId = (node) => {\n\t\tlet newId = ids[node.id];\n\t\tif (!newId) {\n\t\t\tconst oldId = node.id;\n\t\t\tnewId = idGenerator(node);\n\t\t\tids[oldId] = newId;\n\t\t}\n\t\treturn newId;\n\t};\n\treturn nodesToCopy.map((node) => ({\n\t\tsrcId: node.id,\n\t\ttargetId: getNewNodeId(node),\n\t\ttargetName: node.name,\n\t\ttargetParentFolder: node.parentFolder ? ids[node.parentFolder] : null\n\t}));\n}\nfunction getNextCopyNumber(files, baseFilename) {\n\tlet maxNumber = 0;\n\tconst regex = new RegExp(`^${escapeRegExp(baseFilename)} \\\\(copy\\\\)(?: (\\\\d+))?$`);\n\tfor (const file of files) {\n\t\tconst match = file.match(regex);\n\t\tif (match) {\n\t\t\tconst number = match[1] ? parseInt(match[1], 10) : 1;\n\t\t\tif (number > maxNumber) maxNumber = number;\n\t\t}\n\t}\n\treturn maxNumber + 1;\n}\nfunction escapeRegExp(string) {\n\treturn string.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\nfunction handleTargetNameCollisions(params) {\n\tconst { nodes, targetParentFolder, srcName, srcKind } = params;\n\tconst targetNodeChildrenNames = nodes.filter((node) => targetParentFolder === \"\" ? node.parentFolder === null : node.parentFolder === targetParentFolder).filter((node) => node.kind === srcKind).map((node) => node.name);\n\treturn targetNodeChildrenNames.includes(srcName) ? `${srcName} (copy) ${getNextCopyNumber(targetNodeChildrenNames, srcName)}` : srcName;\n}\nconst isValidName = (name) => {\n\treturn name.trim().length > 0 && !/[\\u0000-\\u001F\\u007F]/.test(name);\n};\n//#endregion\n//#region document-drive/src/reducers/node.ts\nconst nodeReducer = {\n\taddFileOperation(state, action, dispatch) {\n\t\tif (state.nodes.find((node) => node.id === action.input.id)) throw new Error(`Node with id ${action.input.id} already exists!`);\n\t\tif (!isValidName(action.input.name)) throw new Error(`Invalid name: '${action.input.name}'. Names must not be empty or contain control characters.`);\n\t\tconst name = handleTargetNameCollisions({\n\t\t\tnodes: state.nodes,\n\t\t\tsrcName: action.input.name,\n\t\t\tsrcKind: \"file\",\n\t\t\ttargetParentFolder: action.input.parentFolder || null\n\t\t});\n\t\tconst fileNode = {\n\t\t\tid: action.input.id,\n\t\t\tname,\n\t\t\tkind: \"file\",\n\t\t\tparentFolder: action.input.parentFolder ?? null,\n\t\t\tdocumentType: action.input.documentType\n\t\t};\n\t\tstate.nodes.push(fileNode);\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t\tdispatch?.({\n\t\t\ttype: \"CREATE_CHILD_DOCUMENT\",\n\t\t\tinput: {\n\t\t\t\tid: action.input.id,\n\t\t\t\tdocumentType: action.input.documentType\n\t\t\t}\n\t\t});\n\t},\n\taddFolderOperation(state, action) {\n\t\tif (state.nodes.find((node) => node.id === action.input.id)) throw new Error(`Node with id ${action.input.id} already exists!`);\n\t\tif (!isValidName(action.input.name)) throw new Error(`Invalid name: '${action.input.name}'. Names must not be empty or contain control characters.`);\n\t\tconst name = handleTargetNameCollisions({\n\t\t\tnodes: state.nodes,\n\t\t\tsrcName: action.input.name,\n\t\t\tsrcKind: \"folder\",\n\t\t\ttargetParentFolder: action.input.parentFolder || null\n\t\t});\n\t\tstate.nodes.push({\n\t\t\t...action.input,\n\t\t\tname,\n\t\t\tkind: \"folder\",\n\t\t\tparentFolder: action.input.parentFolder ?? null\n\t\t});\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t},\n\tdeleteNodeOperation(state, action, dispatch) {\n\t\tconst node = state.nodes.find((node) => node.id === action.input.id);\n\t\tif (!node) throw new Error(`Node with id ${action.input.id} not found`);\n\t\tconst descendants = getDescendants(node, state.nodes);\n\t\tstate.nodes = state.nodes.filter((node) => node.id !== action.input.id && !descendants.find((descendant) => descendant.id === node.id));\n\t\t[node, ...descendants].filter((node) => isFileNode(node)).forEach((node) => {\n\t\t\tdispatch?.({\n\t\t\t\ttype: \"DELETE_CHILD_DOCUMENT\",\n\t\t\t\tinput: { id: node.id }\n\t\t\t});\n\t\t});\n\t},\n\tupdateFileOperation(state, action) {\n\t\tif (action.input.name && !isValidName(action.input.name)) throw new Error(`Invalid name: '${action.input.name}'. Names must not be empty or contain control characters.`);\n\t\tstate.nodes = state.nodes.map((node) => node.id === action.input.id ? {\n\t\t\t...node,\n\t\t\tname: handleTargetNameCollisions({\n\t\t\t\tnodes: state.nodes.filter((n) => n.id !== action.input.id),\n\t\t\t\tsrcName: action.input.name ?? node.name,\n\t\t\t\tsrcKind: \"file\",\n\t\t\t\ttargetParentFolder: action.input.parentFolder ?? node.parentFolder\n\t\t\t}),\n\t\t\tdocumentType: action.input.documentType ?? node.documentType\n\t\t} : node);\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t},\n\tupdateNodeOperation(state, action) {\n\t\tif (action.input.name && !isValidName(action.input.name)) throw new Error(`Invalid name: '${action.input.name}'. Names must not be empty or contain control characters.`);\n\t\tstate.nodes = state.nodes.map((node) => node.id === action.input.id ? {\n\t\t\t...node,\n\t\t\tname: handleTargetNameCollisions({\n\t\t\t\tnodes: state.nodes.filter((n) => n.id !== action.input.id),\n\t\t\t\tsrcName: action.input.name ?? node.name,\n\t\t\t\tsrcKind: node.kind === \"file\" ? \"file\" : \"folder\",\n\t\t\t\ttargetParentFolder: action.input.parentFolder ?? node.parentFolder\n\t\t\t}),\n\t\t\tparentFolder: action.input.parentFolder === null ? null : node.parentFolder\n\t\t} : node);\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t},\n\tcopyNodeOperation(state, action, dispatch) {\n\t\tconst node = state.nodes.find((node) => node.id === action.input.srcId);\n\t\tif (!node) throw new Error(`Node with id ${action.input.srcId} not found`);\n\t\tif (state.nodes.find((node) => node.id === action.input.targetId)) throw new Error(`Node with id ${action.input.targetId} already exists`);\n\t\tconst name = handleTargetNameCollisions({\n\t\t\tnodes: state.nodes,\n\t\t\tsrcName: action.input.targetName || node.name,\n\t\t\tsrcKind: node.kind === \"file\" ? \"file\" : \"folder\",\n\t\t\ttargetParentFolder: action.input.targetParentFolder || null\n\t\t});\n\t\tconst newNode = {\n\t\t\t...node,\n\t\t\tid: action.input.targetId,\n\t\t\tslug: action.input.targetId,\n\t\t\tname,\n\t\t\tparentFolder: action.input.targetParentFolder || null\n\t\t};\n\t\tstate.nodes.push(newNode);\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t\tif (isFileNode(newNode)) dispatch?.({\n\t\t\ttype: \"COPY_CHILD_DOCUMENT\",\n\t\t\tinput: {\n\t\t\t\tid: action.input.srcId,\n\t\t\t\tnewId: action.input.targetId\n\t\t\t}\n\t\t});\n\t},\n\tmoveNodeOperation(state, action) {\n\t\tif (action.input.srcFolder === action.input.targetParentFolder) throw new Error(\"Circular Reference Error: Attempting to move a node to its current parent folder\");\n\t\tconst node = state.nodes.find((node) => node.id === action.input.srcFolder);\n\t\tif (!node) throw new Error(`Node with id ${action.input.srcFolder} not found`);\n\t\tconst name = handleTargetNameCollisions({\n\t\t\tnodes: state.nodes,\n\t\t\tsrcName: node.name,\n\t\t\tsrcKind: node.kind === \"file\" ? \"file\" : \"folder\",\n\t\t\ttargetParentFolder: action.input.targetParentFolder || null\n\t\t});\n\t\tif (isFolderNode(node)) {\n\t\t\tif (getDescendants(node, state.nodes).find((descendant) => descendant.id === action.input.targetParentFolder)) throw new Error(\"Circular Reference Error: Cannot move a folder to one of its descendants\");\n\t\t}\n\t\tstate.nodes = state.nodes.map((node) => {\n\t\t\tif (node.id === action.input.srcFolder) return {\n\t\t\t\t...node,\n\t\t\t\tname,\n\t\t\t\tparentFolder: action.input.targetParentFolder || null\n\t\t\t};\n\t\t\treturn node;\n\t\t});\n\t\tstate.nodes.sort((a, b) => a.id.localeCompare(b.id));\n\t}\n};\n//#endregion\n//#region document-drive/gen/reducer.ts\nconst driveStateReducer = (state, action, dispatch) => {\n\tif (isDocumentAction(action)) return state;\n\tconst typedAction = action;\n\tswitch (typedAction.type) {\n\t\tcase \"ADD_FILE\":\n\t\t\tAddFileInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.addFileOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"ADD_FOLDER\":\n\t\t\tAddFolderInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.addFolderOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"DELETE_NODE\":\n\t\t\tDeleteNodeInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.deleteNodeOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"UPDATE_FILE\":\n\t\t\tUpdateFileInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.updateFileOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"UPDATE_NODE\":\n\t\t\tUpdateNodeInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.updateNodeOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"COPY_NODE\":\n\t\t\tCopyNodeInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.copyNodeOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"MOVE_NODE\":\n\t\t\tMoveNodeInputSchema().parse(typedAction.input);\n\t\t\tnodeReducer.moveNodeOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"SET_DRIVE_NAME\":\n\t\t\tSetDriveNameInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.setDriveNameOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"SET_DRIVE_ICON\":\n\t\t\tSetDriveIconInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.setDriveIconOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"SET_SHARING_TYPE\":\n\t\t\tSetSharingTypeInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.setSharingTypeOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"SET_AVAILABLE_OFFLINE\":\n\t\t\tSetAvailableOfflineInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.setAvailableOfflineOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"ADD_LISTENER\":\n\t\t\tAddListenerInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.addListenerOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"REMOVE_LISTENER\":\n\t\t\tRemoveListenerInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.removeListenerOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"ADD_TRIGGER\":\n\t\t\tAddTriggerInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.addTriggerOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tcase \"REMOVE_TRIGGER\":\n\t\t\tRemoveTriggerInputSchema().parse(typedAction.input);\n\t\t\tdriveReducer.removeTriggerOperation(state[typedAction.scope], action, dispatch);\n\t\t\tbreak;\n\t\tdefault: return state;\n\t}\n};\nconst driveDocumentReducer = createReducer(driveStateReducer);\n//#endregion\n//#region document-drive/gen/utils.ts\nconst initialGlobalState = {\n\tname: \"\",\n\tnodes: [],\n\ticon: null\n};\nconst initialLocalState = {\n\tlisteners: [],\n\ttriggers: [],\n\tsharingType: \"private\",\n\tavailableOffline: false\n};\nconst driveCreateState = (state) => {\n\treturn {\n\t\t...defaultBaseState(),\n\t\tglobal: {\n\t\t\t...initialGlobalState,\n\t\t\t...state?.global\n\t\t},\n\t\tlocal: {\n\t\t\t...initialLocalState,\n\t\t\t...state?.local\n\t\t}\n\t};\n};\nconst driveCreateDocument = (state) => {\n\treturn baseCreateDocument(driveCreateState, state, driveDocumentType);\n};\nconst driveSaveToFileHandle = (document, input) => {\n\treturn baseSaveToFileHandle(document, input);\n};\nconst driveLoadFromInput = (input) => {\n\treturn baseLoadFromInput(input, driveDocumentReducer);\n};\nconst isStateOfType = (state) => {\n\treturn isDriveState(state);\n};\nconst assertIsStateOfType = (state) => {\n\tassertIsDriveState(state);\n};\nconst isDocumentOfType = (document) => {\n\treturn isDriveDocument(document);\n};\nconst assertIsDocumentOfType = (document) => {\n\tassertIsDriveDocument(document);\n};\n//#endregion\n//#region document-drive/module.ts\nconst driveDocumentModelModule = {\n\tactions: creators_exports,\n\treducer: driveDocumentReducer,\n\tdocumentModel: createState$1(defaultBaseState(), driveDocumentModel),\n\tutils: {\n\t\tfileExtension: driveDocumentFileExtension,\n\t\tcreateState: driveCreateState,\n\t\tcreateDocument: driveCreateDocument,\n\t\tloadFromInput: driveLoadFromInput,\n\t\tsaveToFileHandle: driveSaveToFileHandle,\n\t\tisStateOfType,\n\t\tassertIsStateOfType,\n\t\tisDocumentOfType,\n\t\tassertIsDocumentOfType\n\t}\n};\n//#endregion\nexport { AddFileInputSchema, AddFolderInputSchema, AddListenerInputSchema, AddTriggerInputSchema, CopyNodeInputSchema, DeleteNodeInputSchema, DocumentDriveLocalStateSchema, DocumentDriveStateSchema, DriveDocumentHeaderSchema, DriveDocumentSchema, DrivePHStateSchema, FileNodeSchema, FolderNodeSchema, ListenerCallInfoInputSchema, ListenerCallInfoSchema, ListenerFilterInputSchema, ListenerFilterSchema, ListenerInputSchema, ListenerSchema, MoveNodeInputSchema, NodeSchema, PullResponderTriggerDataInputSchema, PullResponderTriggerDataSchema, RemoveListenerInputSchema, RemoveTriggerInputSchema, SetAvailableOfflineInputSchema, SetDriveIconInputSchema, SetDriveNameInputSchema, SetSharingTypeInputSchema, TransmitterTypeSchema, TriggerDataSchema, TriggerInputSchema, TriggerSchema, TriggerTypeSchema, UpdateFileInputSchema, UpdateNodeInputSchema, addFile, addFolder, addListener, addTrigger, assertIsDocumentOfType, assertIsDriveDocument, assertIsDriveState, assertIsStateOfType, copyNode, createGlobalState, createLocalState, createState, defaultGlobalState, defaultLocalState, defaultPHState, definedNonNullAnySchema, deleteNode, driveCreateDocument, driveCreateState, driveDocumentFileExtension, driveDocumentModel, driveDocumentModelModule, driveDocumentReducer, driveDocumentType, driveLoadFromInput, driveReducer, driveSaveToFileHandle, escapeRegExp, generateNodesCopy, getAncestors, getDescendants, getNextCopyNumber, handleTargetNameCollisions, initialGlobalState, initialLocalState, isDefinedNonNullAny, isDocumentOfType, isDriveDocument, isDriveState, isFileNode, isFolderNode, isStateOfType, isValidName, moveNode, nodeReducer, removeListener, removeTrigger, setAvailableOffline, setDriveIcon, setDriveName, setSharingType, updateFile, updateNode };\n\n//# sourceMappingURL=index.js.map"],"x_google_ignoreList":[0,1,2,4,5],"mappings":";;;;;CAEA,MAAM,EAAE,mBAAmB,OAAO;CAElC,MAAM,YAAY,WAAW;AAG7B,WAAU,YAAY;AAEtB,WAAU,YAAY;AAGtB,WAAU,UAAU;AAGpB,SAAQ,YAAY;AAEpB,SAAQ,YAAY;AAEpB,QAAO,UAAU;CAGjB,MAAM,2BAA2B;CAIjC,SAAS,UAAW,KAAK;AAEvB,MAAI,IAAI,SAAS,OAAQ,CAAC,yBAAyB,KAAK,IAAI,CAC1D,QAAO,IAAI,IAAI;AAEjB,SAAO,KAAK,UAAU,IAAI;;CAG5B,SAAS,KAAM,OAAO,YAAY;AAGhC,MAAI,MAAM,SAAS,OAAO,WACxB,QAAO,MAAM,KAAK,WAAW;AAE/B,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,eAAe,MAAM;GAC3B,IAAI,WAAW;AACf,UAAO,aAAa,KAAK,MAAM,WAAW,KAAK,cAAc;AAC3D,UAAM,YAAY,MAAM,WAAW;AACnC;;AAEF,SAAM,YAAY;;AAEpB,SAAO;;CAGT,MAAM,0CACJ,OAAO,yBACL,OAAO,eACL,OAAO,eACL,IAAI,WAAW,CAChB,CACF,EACD,OAAO,YACR,CAAC;CAEJ,SAAS,wBAAyB,OAAO;AACvC,SAAO,wCAAwC,KAAK,MAAM,KAAK,KAAA,KAAa,MAAM,WAAW;;CAG/F,SAAS,oBAAqB,OAAO,WAAW,gBAAgB;AAC9D,MAAI,MAAM,SAAS,eACjB,kBAAiB,MAAM;EAEzB,MAAM,aAAa,cAAc,MAAM,KAAK;EAC5C,IAAI,MAAM,OAAO,aAAa,MAAM;AACpC,OAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,IAClC,QAAO,GAAG,UAAU,GAAG,EAAE,IAAI,aAAa,MAAM;AAElD,SAAO;;CAGT,SAAS,uBAAwB,SAAS;AACxC,MAAI,eAAe,KAAK,SAAS,gBAAgB,EAAE;GACjD,MAAM,gBAAgB,QAAQ;AAC9B,OAAI,OAAO,kBAAkB,SAC3B,QAAO,IAAI,cAAc;AAE3B,OAAI,iBAAiB,KACnB,QAAO;AAET,OAAI,kBAAkB,SAAS,kBAAkB,UAC/C,QAAO,EACL,WAAY;AACV,UAAM,IAAI,UAAU,wCAAwC;MAE/D;AAEH,SAAM,IAAI,UAAU,uFAAqF;;AAE3G,SAAO;;CAGT,SAAS,uBAAwB,SAAS;EACxC,IAAI;AACJ,MAAI,eAAe,KAAK,SAAS,gBAAgB,EAAE;AACjD,WAAQ,QAAQ;AAChB,OAAI,OAAO,UAAU,aAAa,OAAO,UAAU,WACjD,OAAM,IAAI,UAAU,gFAA8E;;AAGtG,SAAO,UAAU,KAAA,IAAY,OAAO;;CAGtC,SAAS,iBAAkB,SAAS,KAAK;EACvC,IAAI;AACJ,MAAI,eAAe,KAAK,SAAS,IAAI,EAAE;AACrC,WAAQ,QAAQ;AAChB,OAAI,OAAO,UAAU,UACnB,OAAM,IAAI,UAAU,QAAQ,IAAI,oCAAoC;;AAGxE,SAAO,UAAU,KAAA,IAAY,OAAO;;CAGtC,SAAS,yBAA0B,SAAS,KAAK;EAC/C,IAAI;AACJ,MAAI,eAAe,KAAK,SAAS,IAAI,EAAE;AACrC,WAAQ,QAAQ;AAChB,OAAI,OAAO,UAAU,SACnB,OAAM,IAAI,UAAU,QAAQ,IAAI,mCAAmC;AAErE,OAAI,CAAC,OAAO,UAAU,MAAM,CAC1B,OAAM,IAAI,UAAU,QAAQ,IAAI,+BAA+B;AAEjE,OAAI,QAAQ,EACV,OAAM,IAAI,WAAW,QAAQ,IAAI,yBAAyB;;AAG9D,SAAO,UAAU,KAAA,IAAY,WAAW;;CAG1C,SAAS,aAAc,QAAQ;AAC7B,MAAI,WAAW,EACb,QAAO;AAET,SAAO,GAAG,OAAO;;CAGnB,SAAS,qBAAsB,eAAe;EAC5C,MAAM,8BAAc,IAAI,KAAK;AAC7B,OAAK,MAAM,SAAS,cAClB,KAAI,OAAO,UAAU,YAAY,OAAO,UAAU,SAChD,aAAY,IAAI,OAAO,MAAM,CAAC;AAGlC,SAAO;;CAGT,SAAS,gBAAiB,SAAS;AACjC,MAAI,eAAe,KAAK,SAAS,SAAS,EAAE;GAC1C,MAAM,QAAQ,QAAQ;AACtB,OAAI,OAAO,UAAU,UACnB,OAAM,IAAI,UAAU,kDAAgD;AAEtE,OAAI,MACF,SAAQ,UAAU;IAChB,IAAI,UAAU,uDAAuD,OAAO;AAC5E,QAAI,OAAO,UAAU,WAAY,YAAW,KAAK,MAAM,UAAU,CAAC;AAClE,UAAM,IAAI,MAAM,QAAQ;;;;CAMhC,SAAS,UAAW,SAAS;AAC3B,YAAU,EAAE,GAAG,SAAS;EACxB,MAAM,OAAO,gBAAgB,QAAQ;AACrC,MAAI,MAAM;AACR,OAAI,QAAQ,WAAW,KAAA,EACrB,SAAQ,SAAS;AAEnB,OAAI,EAAE,mBAAmB,SACvB,SAAQ,gBAAgB;;EAG5B,MAAM,gBAAgB,uBAAuB,QAAQ;EACrD,MAAM,SAAS,iBAAiB,SAAS,SAAS;EAClD,MAAM,gBAAgB,uBAAuB,QAAQ;EACrD,MAAM,aAAa,OAAO,kBAAkB,aAAa,gBAAgB,KAAA;EACzE,MAAM,eAAe,yBAAyB,SAAS,eAAe;EACtE,MAAM,iBAAiB,yBAAyB,SAAS,iBAAiB;EAE1E,SAAS,oBAAqB,KAAK,QAAQ,OAAO,UAAU,QAAQ,aAAa;GAC/E,IAAI,QAAQ,OAAO;AAEnB,OAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,WACzE,SAAQ,MAAM,OAAO,IAAI;AAE3B,WAAQ,SAAS,KAAK,QAAQ,KAAK,MAAM;AAEzC,WAAQ,OAAO,OAAf;IACE,KAAK,SACH,QAAO,UAAU,MAAM;IACzB,KAAK,UAAU;AACb,SAAI,UAAU,KACZ,QAAO;AAET,SAAI,MAAM,QAAQ,MAAM,KAAK,GAC3B,QAAO;KAGT,IAAI,MAAM;KACV,IAAI,OAAO;KACX,MAAM,sBAAsB;AAE5B,SAAI,MAAM,QAAQ,MAAM,EAAE;AACxB,UAAI,MAAM,WAAW,EACnB,QAAO;AAET,UAAI,eAAe,MAAM,SAAS,EAChC,QAAO;AAET,YAAM,KAAK,MAAM;AACjB,UAAI,WAAW,IAAI;AACjB,sBAAe;AACf,cAAO,KAAK;AACZ,cAAO,MAAM;;MAEf,MAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,eAAe;MACvE,IAAI,IAAI;AACR,aAAO,IAAI,2BAA2B,GAAG,KAAK;OAC5C,MAAM,MAAM,oBAAoB,OAAO,EAAE,EAAE,OAAO,OAAO,UAAU,QAAQ,YAAY;AACvF,cAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,cAAO;;MAET,MAAM,MAAM,oBAAoB,OAAO,EAAE,EAAE,OAAO,OAAO,UAAU,QAAQ,YAAY;AACvF,aAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,UAAI,MAAM,SAAS,IAAI,gBAAgB;OACrC,MAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,cAAO,GAAG,KAAK,OAAO,aAAa,YAAY,CAAC;;AAElD,UAAI,WAAW,GACb,QAAO,KAAK;AAEd,YAAM,KAAK;AACX,aAAO,IAAI,IAAI;;KAGjB,IAAI,OAAO,OAAO,KAAK,MAAM;KAC7B,MAAM,YAAY,KAAK;AACvB,SAAI,cAAc,EAChB,QAAO;AAET,SAAI,eAAe,MAAM,SAAS,EAChC,QAAO;KAET,IAAI,aAAa;KACjB,IAAI,YAAY;AAChB,SAAI,WAAW,IAAI;AACjB,qBAAe;AACf,aAAO,MAAM;AACb,mBAAa;;KAEf,MAAM,+BAA+B,KAAK,IAAI,WAAW,eAAe;AACxE,SAAI,iBAAiB,CAAC,wBAAwB,MAAM,CAClD,QAAO,KAAK,MAAM,WAAW;AAE/B,WAAM,KAAK,MAAM;AACjB,UAAK,IAAI,IAAI,GAAG,IAAI,8BAA8B,KAAK;MACrD,MAAM,MAAM,KAAK;MACjB,MAAM,MAAM,oBAAoB,KAAK,OAAO,OAAO,UAAU,QAAQ,YAAY;AACjF,UAAI,QAAQ,KAAA,GAAW;AACrB,cAAO,GAAG,YAAY,UAAU,IAAI,CAAC,GAAG,aAAa;AACrD,mBAAY;;;AAGhB,SAAI,YAAY,gBAAgB;MAC9B,MAAM,cAAc,YAAY;AAChC,aAAO,GAAG,UAAU,QAAQ,WAAW,GAAG,aAAa,YAAY,CAAC;AACpE,kBAAY;;AAEd,SAAI,WAAW,MAAM,UAAU,SAAS,EACtC,OAAM,KAAK,cAAc,IAAI,IAAI;AAEnC,WAAM,KAAK;AACX,YAAO,IAAI,IAAI;;IAEjB,KAAK,SACH,QAAO,SAAS,MAAM,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK,MAAM,GAAG;IAChE,KAAK,UACH,QAAO,UAAU,OAAO,SAAS;IACnC,KAAK,YACH;IACF,KAAK,SACH,KAAI,OACF,QAAO,OAAO,MAAM;IAGxB,QACE,QAAO,OAAO,KAAK,MAAM,GAAG,KAAA;;;EAIlC,SAAS,uBAAwB,KAAK,OAAO,OAAO,UAAU,QAAQ,aAAa;AACjF,OAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,WACzE,SAAQ,MAAM,OAAO,IAAI;AAG3B,WAAQ,OAAO,OAAf;IACE,KAAK,SACH,QAAO,UAAU,MAAM;IACzB,KAAK,UAAU;AACb,SAAI,UAAU,KACZ,QAAO;AAET,SAAI,MAAM,QAAQ,MAAM,KAAK,GAC3B,QAAO;KAGT,MAAM,sBAAsB;KAC5B,IAAI,MAAM;KACV,IAAI,OAAO;AAEX,SAAI,MAAM,QAAQ,MAAM,EAAE;AACxB,UAAI,MAAM,WAAW,EACnB,QAAO;AAET,UAAI,eAAe,MAAM,SAAS,EAChC,QAAO;AAET,YAAM,KAAK,MAAM;AACjB,UAAI,WAAW,IAAI;AACjB,sBAAe;AACf,cAAO,KAAK;AACZ,cAAO,MAAM;;MAEf,MAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,eAAe;MACvE,IAAI,IAAI;AACR,aAAO,IAAI,2BAA2B,GAAG,KAAK;OAC5C,MAAM,MAAM,uBAAuB,OAAO,EAAE,EAAE,MAAM,IAAI,OAAO,UAAU,QAAQ,YAAY;AAC7F,cAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,cAAO;;MAET,MAAM,MAAM,uBAAuB,OAAO,EAAE,EAAE,MAAM,IAAI,OAAO,UAAU,QAAQ,YAAY;AAC7F,aAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,UAAI,MAAM,SAAS,IAAI,gBAAgB;OACrC,MAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,cAAO,GAAG,KAAK,OAAO,aAAa,YAAY,CAAC;;AAElD,UAAI,WAAW,GACb,QAAO,KAAK;AAEd,YAAM,KAAK;AACX,aAAO,IAAI,IAAI;;AAEjB,WAAM,KAAK,MAAM;KACjB,IAAI,aAAa;AACjB,SAAI,WAAW,IAAI;AACjB,qBAAe;AACf,aAAO,MAAM;AACb,mBAAa;;KAEf,IAAI,YAAY;AAChB,UAAK,MAAM,OAAO,UAAU;MAC1B,MAAM,MAAM,uBAAuB,KAAK,MAAM,MAAM,OAAO,UAAU,QAAQ,YAAY;AACzF,UAAI,QAAQ,KAAA,GAAW;AACrB,cAAO,GAAG,YAAY,UAAU,IAAI,CAAC,GAAG,aAAa;AACrD,mBAAY;;;AAGhB,SAAI,WAAW,MAAM,UAAU,SAAS,EACtC,OAAM,KAAK,cAAc,IAAI,IAAI;AAEnC,WAAM,KAAK;AACX,YAAO,IAAI,IAAI;;IAEjB,KAAK,SACH,QAAO,SAAS,MAAM,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK,MAAM,GAAG;IAChE,KAAK,UACH,QAAO,UAAU,OAAO,SAAS;IACnC,KAAK,YACH;IACF,KAAK,SACH,KAAI,OACF,QAAO,OAAO,MAAM;IAGxB,QACE,QAAO,OAAO,KAAK,MAAM,GAAG,KAAA;;;EAIlC,SAAS,gBAAiB,KAAK,OAAO,OAAO,QAAQ,aAAa;AAChE,WAAQ,OAAO,OAAf;IACE,KAAK,SACH,QAAO,UAAU,MAAM;IACzB,KAAK,UAAU;AACb,SAAI,UAAU,KACZ,QAAO;AAET,SAAI,OAAO,MAAM,WAAW,YAAY;AACtC,cAAQ,MAAM,OAAO,IAAI;AAEzB,UAAI,OAAO,UAAU,SACnB,QAAO,gBAAgB,KAAK,OAAO,OAAO,QAAQ,YAAY;AAEhE,UAAI,UAAU,KACZ,QAAO;;AAGX,SAAI,MAAM,QAAQ,MAAM,KAAK,GAC3B,QAAO;KAET,MAAM,sBAAsB;AAE5B,SAAI,MAAM,QAAQ,MAAM,EAAE;AACxB,UAAI,MAAM,WAAW,EACnB,QAAO;AAET,UAAI,eAAe,MAAM,SAAS,EAChC,QAAO;AAET,YAAM,KAAK,MAAM;AACjB,qBAAe;MACf,IAAI,MAAM,KAAK;MACf,MAAM,OAAO,MAAM;MACnB,MAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,eAAe;MACvE,IAAI,IAAI;AACR,aAAO,IAAI,2BAA2B,GAAG,KAAK;OAC5C,MAAM,MAAM,gBAAgB,OAAO,EAAE,EAAE,MAAM,IAAI,OAAO,QAAQ,YAAY;AAC5E,cAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,cAAO;;MAET,MAAM,MAAM,gBAAgB,OAAO,EAAE,EAAE,MAAM,IAAI,OAAO,QAAQ,YAAY;AAC5E,aAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,UAAI,MAAM,SAAS,IAAI,gBAAgB;OACrC,MAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,cAAO,GAAG,KAAK,OAAO,aAAa,YAAY,CAAC;;AAElD,aAAO,KAAK;AACZ,YAAM,KAAK;AACX,aAAO,IAAI,IAAI;;KAGjB,IAAI,OAAO,OAAO,KAAK,MAAM;KAC7B,MAAM,YAAY,KAAK;AACvB,SAAI,cAAc,EAChB,QAAO;AAET,SAAI,eAAe,MAAM,SAAS,EAChC,QAAO;AAET,oBAAe;KACf,MAAM,OAAO,MAAM;KACnB,IAAI,MAAM;KACV,IAAI,YAAY;KAChB,IAAI,+BAA+B,KAAK,IAAI,WAAW,eAAe;AACtE,SAAI,wBAAwB,MAAM,EAAE;AAClC,aAAO,oBAAoB,OAAO,MAAM,eAAe;AACvD,aAAO,KAAK,MAAM,MAAM,OAAO;AAC/B,sCAAgC,MAAM;AACtC,kBAAY;;AAEd,SAAI,cACF,QAAO,KAAK,MAAM,WAAW;AAE/B,WAAM,KAAK,MAAM;AACjB,UAAK,IAAI,IAAI,GAAG,IAAI,8BAA8B,KAAK;MACrD,MAAM,MAAM,KAAK;MACjB,MAAM,MAAM,gBAAgB,KAAK,MAAM,MAAM,OAAO,QAAQ,YAAY;AACxE,UAAI,QAAQ,KAAA,GAAW;AACrB,cAAO,GAAG,YAAY,UAAU,IAAI,CAAC,IAAI;AACzC,mBAAY;;;AAGhB,SAAI,YAAY,gBAAgB;MAC9B,MAAM,cAAc,YAAY;AAChC,aAAO,GAAG,UAAU,UAAU,aAAa,YAAY,CAAC;AACxD,kBAAY;;AAEd,SAAI,cAAc,GAChB,OAAM,KAAK,cAAc,IAAI,IAAI;AAEnC,WAAM,KAAK;AACX,YAAO,IAAI,IAAI;;IAEjB,KAAK,SACH,QAAO,SAAS,MAAM,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK,MAAM,GAAG;IAChE,KAAK,UACH,QAAO,UAAU,OAAO,SAAS;IACnC,KAAK,YACH;IACF,KAAK,SACH,KAAI,OACF,QAAO,OAAO,MAAM;IAGxB,QACE,QAAO,OAAO,KAAK,MAAM,GAAG,KAAA;;;EAIlC,SAAS,gBAAiB,KAAK,OAAO,OAAO;AAC3C,WAAQ,OAAO,OAAf;IACE,KAAK,SACH,QAAO,UAAU,MAAM;IACzB,KAAK,UAAU;AACb,SAAI,UAAU,KACZ,QAAO;AAET,SAAI,OAAO,MAAM,WAAW,YAAY;AACtC,cAAQ,MAAM,OAAO,IAAI;AAEzB,UAAI,OAAO,UAAU,SACnB,QAAO,gBAAgB,KAAK,OAAO,MAAM;AAE3C,UAAI,UAAU,KACZ,QAAO;;AAGX,SAAI,MAAM,QAAQ,MAAM,KAAK,GAC3B,QAAO;KAGT,IAAI,MAAM;KAEV,MAAM,YAAY,MAAM,WAAW,KAAA;AACnC,SAAI,aAAa,MAAM,QAAQ,MAAM,EAAE;AACrC,UAAI,MAAM,WAAW,EACnB,QAAO;AAET,UAAI,eAAe,MAAM,SAAS,EAChC,QAAO;AAET,YAAM,KAAK,MAAM;MACjB,MAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,eAAe;MACvE,IAAI,IAAI;AACR,aAAO,IAAI,2BAA2B,GAAG,KAAK;OAC5C,MAAM,MAAM,gBAAgB,OAAO,EAAE,EAAE,MAAM,IAAI,MAAM;AACvD,cAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,cAAO;;MAET,MAAM,MAAM,gBAAgB,OAAO,EAAE,EAAE,MAAM,IAAI,MAAM;AACvD,aAAO,QAAQ,KAAA,IAAY,MAAM;AACjC,UAAI,MAAM,SAAS,IAAI,gBAAgB;OACrC,MAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,cAAO,SAAS,aAAa,YAAY,CAAC;;AAE5C,YAAM,KAAK;AACX,aAAO,IAAI,IAAI;;KAGjB,IAAI,OAAO,OAAO,KAAK,MAAM;KAC7B,MAAM,YAAY,KAAK;AACvB,SAAI,cAAc,EAChB,QAAO;AAET,SAAI,eAAe,MAAM,SAAS,EAChC,QAAO;KAET,IAAI,YAAY;KAChB,IAAI,+BAA+B,KAAK,IAAI,WAAW,eAAe;AACtE,SAAI,aAAa,wBAAwB,MAAM,EAAE;AAC/C,aAAO,oBAAoB,OAAO,KAAK,eAAe;AACtD,aAAO,KAAK,MAAM,MAAM,OAAO;AAC/B,sCAAgC,MAAM;AACtC,kBAAY;;AAEd,SAAI,cACF,QAAO,KAAK,MAAM,WAAW;AAE/B,WAAM,KAAK,MAAM;AACjB,UAAK,IAAI,IAAI,GAAG,IAAI,8BAA8B,KAAK;MACrD,MAAM,MAAM,KAAK;MACjB,MAAM,MAAM,gBAAgB,KAAK,MAAM,MAAM,MAAM;AACnD,UAAI,QAAQ,KAAA,GAAW;AACrB,cAAO,GAAG,YAAY,UAAU,IAAI,CAAC,GAAG;AACxC,mBAAY;;;AAGhB,SAAI,YAAY,gBAAgB;MAC9B,MAAM,cAAc,YAAY;AAChC,aAAO,GAAG,UAAU,SAAS,aAAa,YAAY,CAAC;;AAEzD,WAAM,KAAK;AACX,YAAO,IAAI,IAAI;;IAEjB,KAAK,SACH,QAAO,SAAS,MAAM,GAAG,OAAO,MAAM,GAAG,OAAO,KAAK,MAAM,GAAG;IAChE,KAAK,UACH,QAAO,UAAU,OAAO,SAAS;IACnC,KAAK,YACH;IACF,KAAK,SACH,KAAI,OACF,QAAO,OAAO,MAAM;IAGxB,QACE,QAAO,OAAO,KAAK,MAAM,GAAG,KAAA;;;EAIlC,SAAS,UAAW,OAAO,UAAU,OAAO;AAC1C,OAAI,UAAU,SAAS,GAAG;IACxB,IAAI,SAAS;AACb,QAAI,OAAO,UAAU,SACnB,UAAS,IAAI,OAAO,KAAK,IAAI,OAAO,GAAG,CAAC;aAC/B,OAAO,UAAU,SAC1B,UAAS,MAAM,MAAM,GAAG,GAAG;AAE7B,QAAI,YAAY,MAAM;AACpB,SAAI,OAAO,aAAa,WACtB,QAAO,oBAAoB,IAAI,EAAE,IAAI,OAAO,EAAE,EAAE,EAAE,UAAU,QAAQ,GAAG;AAEzE,SAAI,MAAM,QAAQ,SAAS,CACzB,QAAO,uBAAuB,IAAI,OAAO,EAAE,EAAE,qBAAqB,SAAS,EAAE,QAAQ,GAAG;;AAG5F,QAAI,OAAO,WAAW,EACpB,QAAO,gBAAgB,IAAI,OAAO,EAAE,EAAE,QAAQ,GAAG;;AAGrD,UAAO,gBAAgB,IAAI,OAAO,EAAE,CAAC;;AAGvC,SAAO;;;AC7mBI,6BAAsB;AAEnC,MAAaA,cAAYC,6BAAAA;;;;;;ACDzB,MAAM,IAAI;CACN;CACA;CACA;CACA;CACH;AACD,MAAM,aAAa,EACf,MAAM,GACT;AACD,SAAgB,WAAW,WAAW;AAClC,KAAI,aAAa,CAAC,WAAW,cAAc,CAAC,WAAW,UAAU,aAAa,EAC1E,OAAM,IAAI,MAAM,8BAA8B;AAElD,QAAO,IAAI,MAAM;;AAErB,IAAM,OAAN,MAAW;CACP,cAAc;AACV,OAAK,IAAI;AACT,OAAK,IAAI;AACT,OAAK,IAAI;AACT,OAAK,IAAI;AACT,OAAK,IAAI;AACT,OAAK,QAAQ;AACb,OAAK,MAAM;AACX,MAAI,CAAC,gBAAgB,gBAAgB,KAAyB;AAC1D,kCAAe,IAAI,YAAY,IAAwB;AACvD,kBAAe;;AAEnB,OAAK,QAAQ,IAAI,WAAW,cAAc,cAAc,GAAsB;AAC9E,OAAK,QAAQ,IAAI,WAAW,cAAc,cAAc,GAAsB;AAC9E,kBAAgB;;CAEpB,OAAO,MAAM;AAET,MAAI,aAAa,OAAO,KACpB,QAAO,KAAK,MAAM,KAAK;AAG3B,MAAI,QAAQ,KACR,OAAM,IAAI,UAAU,mBAAmB,OAAO,KAAK;EAEvD,MAAM,aAAa,KAAK;EACxB,MAAM,SAAS,KAAK;EACpB,IAAI,SAAU,SAAS,KAAyB;EAChD,IAAI,SAAS;AAEb,MAAI,UAAU,EAAE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAwB;GACtE,MAAM,QAAQ,IAAI,WAAW,KAAK,QAAQ,YAAY,SAAS,GAAsB;AACrF,UAAO,UAAU;AACb,SAAK,OAAO,OAAO,UAAU,EAAE;AAC/B,cAAU;;AAEd,QAAK,SAAS;;AAIlB,MAD0B,KAAK,sBACL,KAAK,KAAK,QAAQ;GACxC,MAAM,OAAO,IAAI,WAAW,KAAK,QAAQ,aAAa,QAAQ,SAAS,OAAO;AAC9E,UAAO,KAAK,OAAO,KAAK;;AAG5B,MAAI,WAAW,OACX,QAAO;AAEX,SAAO,KAAK,OAAO,MAAM,OAAO;;CAEpC,OAAO,MAAM,QAAQ;EACjB,MAAM,EAAE,OAAO,UAAU;EACzB,MAAM,SAAS,KAAK;AACpB,WAAS,SAAS;AAClB,SAAO,SAAS,QAAQ;GACpB,MAAM,QAAQ,KAAK,QAAQ;GAC3B,IAAI,QAAQ;AACZ,UAAO,SAAS,UAAU,QAAQ,GAC9B,OAAM,WAAW,KAAK;AAE1B,OAAI,SAAS,GACT,MAAK,OAAO,MAAM;AAEtB,QAAK,SAAS,QAAQ;;AAE1B,SAAO;;CAEX,MAAM,MAAM;EACR,MAAM,EAAE,OAAO,UAAU;EACzB,MAAM,SAAS,KAAK;EACpB,IAAI,YAAY,KAAK;AACrB,OAAK,IAAI,SAAS,GAAG,SAAS,SAAS;GACnC,MAAM,QAAQ,KAAK,QAAQ;GAC3B,IAAI,QAAQ;AACZ,UAAO,SAAS,UAAU,QAAQ,IAAuB;IACrD,IAAI,OAAO,KAAK,WAAW,SAAS,GAAG;AACvC,QAAI,OAAO,IAEP,OAAM,WAAW;aAEZ,OAAO,MAAO;AAEnB,WAAM,WAAW,MAAQ,SAAS;AAClC,WAAM,WAAW,MAAQ,OAAO;eAE3B,OAAO,SAAU,OAAO,OAAQ;AAErC,WAAM,WAAW,MAAQ,SAAS;AAClC,WAAM,WAAW,MAAS,SAAS,IAAK;AACxC,WAAM,WAAW,MAAQ,OAAO;eAE3B,WAAW;AAEhB,cAAS,YAAY,SAAU,OAAO,OAAO,QAAS;AACtD,WAAM,WAAW,MAAQ,SAAS;AAClC,WAAM,WAAW,MAAS,SAAS,KAAM;AACzC,WAAM,WAAW,MAAS,SAAS,IAAK;AACxC,WAAM,WAAW,MAAQ,OAAO;AAChC,iBAAY;UAGZ,aAAY;;AAGpB,OAAI,SAAS,IAAuB;AAChC,SAAK,OAAO,MAAM;AAClB,UAAM,KAAK,MAAM;;AAErB,QAAK,SAAS,QAAQ;;AAE1B,OAAK,MAAM;AACX,SAAO;;CAEX,OAAO,MAAM,QAAQ;EACjB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,MAAM;EACxB,IAAI,IAAI;AACR,WAAS,SAAS;AAClB,SAAO,IAAI,GACP,GAAE,OAAO,OAAO,KAAK,UAAU;AAEnC,OAAK,IAAI,IAAuB,IAAI,IAAsB,IACtD,GAAE,KAAK,QAAQ,EAAE,IAAI,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,EAAE,IAAI,IAAI;AAE/D,OAAK,IAAI,GAAG,IAAI,IAAsB,KAAK;GACvC,MAAM,IAAK,IAAI,KAAM;GACrB,MAAM,IAAK,QAAQ,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,KAAM;AAC5D,OAAI;AACJ,OAAI;AACJ,OAAI,SAAS,EAAE;AACf,OAAI;AACJ,OAAI;;AAER,OAAK,IAAK,IAAI,KAAK,IAAK;AACxB,OAAK,IAAK,IAAI,KAAK,IAAK;AACxB,OAAK,IAAK,IAAI,KAAK,IAAK;AACxB,OAAK,IAAK,IAAI,KAAK,IAAK;AACxB,OAAK,IAAK,IAAI,KAAK,IAAK;;CAE5B,OAAO,UAAU;EACb,MAAM,EAAE,OAAO,UAAU;EACzB,IAAI,IAAK,KAAK,QAAQ,KAAyB;AAC/C,QAAM,OAAO;AAEb,SAAO,IAAI,EACP,OAAM,OAAO;AAEjB,QAAM;AACN,MAAI,IAAI,IAAsB;AAC1B,UAAO,IAAI,GACP,OAAM,OAAO;AAEjB,OAAI;AACJ,QAAK,OAAO,MAAM;;AAGtB,SAAO,IAAI,GACP,OAAM,OAAO;EAGjB,MAAM,SAAS,KAAK,QAAQ;EAC5B,MAAM,SAAS,SAAS,gBAAgB;EACxC,MAAM,UAAU,SAAS,SAAS;AAClC,MAAI,OACA,OAAM,MAAwB,OAAO,OAAO;AAChD,MAAI,MACA,OAAM,MAAuB,OAAO,MAAM;AAC9C,OAAK,OAAO,MAAM;AAClB,SAAQ,aAAa,QAAS,KAAK,MAAM,GAAG,KAAK,MAAM;;CAE3D,OAAO;EACH,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,MAAM;AAC1B,SAAO,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE;;CAE/D,OAAO;EACH,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,OAAO,UAAU;AACxC,QAAM,KAAK,OAAO,EAAE;AACpB,QAAM,KAAK,OAAO,EAAE;AACpB,QAAM,KAAK,OAAO,EAAE;AACpB,QAAM,KAAK,OAAO,EAAE;AACpB,QAAM,KAAK,OAAO,EAAE;AACpB,SAAO,MAAM,MAAM,GAAG,GAAG;;;AAGjC,MAAM,IAAI,IAAI,WAAW,GAAqB;AAC9C,IAAI;AACJ,IAAI,eAAe;AACnB,MAAM,SAAQ,SAAQ,MAAM,YAAa,SAAS,GAAG,CAAC,OAAO,GAAG;AAChE,MAAM,WAAU,MAAQ,KAAK,KAAM,aAAgB,KAAK,IAAK,WAAc,KAAK,IAAK,QAAY,KAAK,KAAM;AAC5G,MAAM,WAAU,MAAK;AACrB,MAAM,SAAS,MAAM,GAAG,SAAS;AACjC,MAAM,WAAU,QAAQ,OAAO,IAAM,QAAQ;AAC7C,MAAM,WAAU,QAAQ,OAAO,IAAM,QAAQ;AAC7C,MAAM,YAAW,QAAQ,OAAO,KAAO,QAAQ;AAC/C,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACpB,KAAI,MAAM,EACN,QAAQ,IAAI,IAAO,CAAC,IAAK;AAC7B,KAAI,MAAM,EACN,QAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AACpC,QAAO,IAAI,IAAI;;AAEnB,SAAS,OAAO;AAEZ,QADY,IAAI,WAAW,IAAI,YAAY,CAAC,MAAO,CAAC,CAAC,OAAO,CAChD,OAAO;;;;AC1NvB,MAAM,eAAe,MAAM,YAAY,QAAQ,WAAW,UAAU,YAAY;AAC/E,KAAI,CAAC,CAAC,OAAO,CAAC,SAAS,UAAU,CAAE,OAAM,IAAI,MAAM,qCAAqC,UAAU,oBAAoB;AACtH,KAAI,CAAC,CAAC,UAAU,MAAM,CAAC,SAAS,SAAS,CAAE,OAAM,IAAI,MAAM,iCAAiC,SAAS,2BAA2B;CAChI,MAAM,OAAO,cAAc,MAAM,UAAU;AAC3C,KAAI,aAAa,MAAO,QAAO,gBAAgB,KAAK;AACpD,QAAO,mBAAmB,KAAK;;AAEhC,SAAS,mBAAmB,YAAY;CACvC,IAAI,eAAe;AACnB,MAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IAAK,iBAAgB,OAAO,aAAa,WAAW,GAAG;AAC9F,QAAO,KAAK,aAAa;;AAE1B,SAAS,gBAAgB,YAAY;AACpC,QAAO,MAAM,KAAK,WAAW,CAAC,KAAK,SAAS,KAAK,SAAS,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,KAAK,GAAG;;AAEzF,SAAS,cAAc,MAAM,YAAY,QAAQ;AAChD,KAAI,CAAC,CAAC,OAAO,CAAC,SAAS,UAAU,CAAE,OAAM,IAAI,MAAM,mDAAmD;AACtG,QAAO,WAAW,OAAO,CAAC,OAAO,KAAK,CAAC,QAAQ;;AAEhD,SAAS,iBAAiB,MAAM;AAC/B,SAAQ,IAAI,KAAK,KAAK,CAAC,SAAS,GAAG,KAAK,QAAQ,EAAE;;AAEnD,SAAS,8BAA8B,EAAE,YAAY,QAAQ,QAAQ,qBAAqB;CACzF,MAAM,EAAE,OAAO,SAAS;AACxB,QAAO;EACN,iCAAiC,IAAI,MAAM,CAAC;EAC5C,OAAO,IAAI;EACX,YAAY;GACX;GACA;GACA;GACAC,YAAU,OAAO,MAAM;GACvB,CAAC,KAAK,GAAG,CAAC;EACX;EACA;;AAEF,MAAM,aAAa,IAAI,aAAa;AACpC,SAAS,+BAA+B,QAAQ;CAC/C,MAAM,UAAU,OAAO,KAAK,GAAG;CAC/B,MAAM,SAAS,yBAAyB,QAAQ,OAAO,UAAU;AACjE,QAAO,WAAW,OAAO,SAAS,QAAQ;;AAE3C,SAAS,OAAO,IAAI;CACnB,MAAM,OAAO,YAAY,OAAO,GAAG,GAAG,KAAK,IAAI,WAAW,GAAG;AAC7D,QAAO,MAAM,UAAU,IAAI,KAAK,OAAO,OAAO,OAAO,EAAE,SAAS,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG;;AASzF,SAAS,WAAW,QAAQ;AAC3B,KAAI,UAAU,OAAO,UAAU,KAAK,SAAU,OAAM,IAAI,MAAM,wCAAwC,OAAO,UAAU,CAAC,GAAG;AAC3H,QAAO,WAAW,OAAO,YAAY;;;;;AAKtC,SAAS,kBAAkB,YAAY,OAAO,QAAQ,UAAU;AAC/D,QAAO,YAAY,GAAG,WAAW,GAAG,MAAM,GAAG,OAAO,GAAG,YAAY,QAAQ,MAAM,CAAC,MAAM,GAAG,GAAG;;;;AC/D/F,IAAI,UAAU,cAAc,IAAI;AAWhC,IAAI;AACJ,IAAI,YAAY;AAChB,IAAI;AACA,UAAS,QAAQ,iBAAiB,CAAC;SAEhC,GAAG;AAEV,IAAI,KAAK,SAAS,SAAU,GAAG,GAAG,KAAK,UAAU,IAAI;CACjD,IAAI,OAAO;CACX,IAAI,IAAI,IAAI,OAAO,IAAI,WAAW,EAAE,MAAM,MAAM,CAAC,CAC5C,GAAG,SAAS,SAAU,GAAG;AAAE,SAAO,GAAG,GAAG,KAAK;GAAI,CACjD,GAAG,WAAW,SAAU,GAAG;AAAE,SAAO,GAAG,MAAM,EAAE;GAAI,CACnD,GAAG,QAAQ,SAAU,GAAG;AACzB,MAAI,KAAK,CAAC,KACN,oBAAG,IAAI,MAAM,sBAAsB,EAAE,EAAE,KAAK;GAClD;AACF,GAAE,YAAY,KAAK,SAAS;AAC5B,GAAE,YAAY,WAAY;AACtB,SAAO;AACP,SAAO,OAAO,UAAU,UAAU,KAAK,EAAE;;AAE7C,QAAO;IACP,SAAU,GAAG,IAAI,KAAK,MAAM,IAAI;AAChC,cAAa,WAAY;AAAE,SAAO,mBAAG,IAAI,MAAM,4GAA4G,EAAE,KAAK;GAAI;CACtK,IAAI,MAAM,WAAY;AACtB,QAAO;EACH,WAAW;EACX,aAAa;EAChB;;AAIL,IAAI,KAAK,YAAY,MAAM,aAAa,MAAM;AAE9C,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;CAAE,CAAC;AAEjJ,IAAI,OAAO,IAAI,GAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;CAAE,CAAC;AAExI,IAAI,OAAO,IAAI,GAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAG,CAAC;AAErF,IAAI,OAAO,SAAU,IAAI,OAAO;CAC5B,IAAI,IAAI,IAAI,IAAI,GAAG;AACnB,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,GAAE,KAAK,SAAS,KAAK,GAAG,IAAI;CAGhC,IAAI,IAAI,IAAI,IAAI,EAAE,IAAI;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,MAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,EAC/B,GAAE,KAAO,IAAI,EAAE,MAAO,IAAK;AAGnC,QAAO;EAAK;EAAM;EAAG;;AAEzB,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,GAAG,QAAQ,GAAG;AAE9C,GAAG,MAAM,KAAK,MAAM,OAAO;AAC3B,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,GAAG,QAAQ,GAAG;AAE9C,IAAI,MAAM,IAAI,IAAI,MAAM;AACxB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;AAC/C,MAAM,IAAI,UAAW,KAAO,IAAI,UAAW;AAC3C,MAAM,IAAI,UAAW,KAAO,IAAI,SAAW;AAC3C,KAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;;AAK5D,IAAI,QAAQ,SAAU,IAAI,IAAI,GAAG;CAC7B,IAAI,IAAI,GAAG;CAEX,IAAI,IAAI;CAER,IAAI,IAAI,IAAI,IAAI,GAAG;AAEnB,QAAO,IAAI,GAAG,EAAE,EACZ,KAAI,GAAG,GACH,GAAE,EAAE,GAAG,KAAK;CAGpB,IAAI,KAAK,IAAI,IAAI,GAAG;AACpB,MAAK,IAAI,GAAG,IAAI,IAAI,EAAE,EAClB,IAAG,KAAM,GAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;AACJ,KAAI,GAAG;AAEH,OAAK,IAAI,IAAI,KAAK,GAAG;EAErB,IAAI,MAAM,KAAK;AACf,OAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EAEjB,KAAI,GAAG,IAAI;GAEP,IAAI,KAAM,KAAK,IAAK,GAAG;GAEvB,IAAI,MAAM,KAAK,GAAG;GAElB,IAAI,IAAI,GAAG,GAAG,KAAK,QAAQ;AAE3B,QAAK,IAAI,IAAI,KAAM,KAAK,OAAO,GAAI,KAAK,GAAG,EAAE,EAEzC,IAAG,IAAI,MAAM,OAAO;;QAK/B;AACD,OAAK,IAAI,IAAI,EAAE;AACf,OAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EACjB,KAAI,GAAG,GACH,IAAG,KAAK,IAAI,GAAG,GAAG,KAAK,SAAU,KAAK,GAAG;;AAIrD,QAAO;;AAGX,IAAI,MAAM,IAAI,GAAG,IAAI;AACrB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,EACvB,KAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,KAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,KAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,KAAI,KAAK;AAEb,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,KAAI,KAAK;AAEb,IAAI,MAAoB,qBAAK,KAAK,GAAG,EAAE,EAAE,OAAqB,qBAAK,KAAK,GAAG,EAAE;AAE7E,IAAI,MAAoB,qBAAK,KAAK,GAAG,EAAE,EAAE,OAAqB,qBAAK,KAAK,GAAG,EAAE;AAE7E,IAAI,MAAM,SAAU,GAAG;CACnB,IAAI,IAAI,EAAE;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC5B,KAAI,EAAE,KAAK,EACP,KAAI,EAAE;AAEd,QAAO;;AAGX,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG;CAC1B,IAAI,IAAK,IAAI,IAAK;AAClB,SAAS,EAAE,KAAM,EAAE,IAAI,MAAM,OAAQ,IAAI,KAAM;;AAGnD,IAAI,SAAS,SAAU,GAAG,GAAG;CACzB,IAAI,IAAK,IAAI,IAAK;AAClB,SAAS,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,QAAS,IAAI;;AAGhE,IAAI,OAAO,SAAU,GAAG;AAAE,SAAS,IAAI,KAAK,IAAK;;AAGjD,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG;AACzB,KAAI,KAAK,QAAQ,IAAI,EACjB,KAAI;AACR,KAAI,KAAK,QAAQ,IAAI,EAAE,OACnB,KAAI,EAAE;AAEV,QAAO,IAAI,GAAG,EAAE,SAAS,GAAG,EAAE,CAAC;;AAuBnC,IAAI,KAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CAEH;AAED,IAAI,MAAM,SAAU,KAAK,KAAK,IAAI;CAC9B,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,KAAK;AACjC,GAAE,OAAO;AACT,KAAI,MAAM,kBACN,OAAM,kBAAkB,GAAG,IAAI;AACnC,KAAI,CAAC,GACD,OAAM;AACV,QAAO;;AAGX,IAAI,QAAQ,SAAU,KAAK,IAAI,KAAK,MAAM;CAEtC,IAAI,KAAK,IAAI,QAAQ,KAAK,OAAO,KAAK,SAAS;AAC/C,KAAI,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,EACnB,QAAO,OAAO,IAAI,GAAG,EAAE;CAC3B,IAAI,QAAQ,CAAC;CAEb,IAAI,SAAS,SAAS,GAAG,KAAK;CAE9B,IAAI,OAAO,GAAG;AAEd,KAAI,MACA,OAAM,IAAI,GAAG,KAAK,EAAE;CAExB,IAAI,OAAO,SAAU,GAAG;EACpB,IAAI,KAAK,IAAI;AAEb,MAAI,IAAI,IAAI;GAER,IAAI,OAAO,IAAI,GAAG,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC;AACtC,QAAK,IAAI,IAAI;AACb,SAAM;;;CAId,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG;CAEnG,IAAI,OAAO,KAAK;AAChB,IAAG;AACC,MAAI,CAAC,IAAI;AAEL,WAAQ,KAAK,KAAK,KAAK,EAAE;GAEzB,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAChC,UAAO;AACP,OAAI,CAAC,MAAM;IAEP,IAAI,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,KAAM,IAAI,IAAI,MAAM,GAAI,IAAI,IAAI;AACnE,QAAI,IAAI,IAAI;AACR,SAAI,KACA,KAAI,EAAE;AACV;;AAGJ,QAAI,OACA,MAAK,KAAK,EAAE;AAEhB,QAAI,IAAI,IAAI,SAAS,GAAG,EAAE,EAAE,GAAG;AAE/B,OAAG,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,IAAI;AAC3C;cAEK,QAAQ,EACb,MAAK,MAAM,KAAK,MAAM,MAAM,GAAG,MAAM;YAChC,QAAQ,GAAG;IAEhB,IAAI,OAAO,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG,GAAG;IACvE,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG;AACzC,WAAO;IAEP,IAAI,MAAM,IAAI,GAAG,GAAG;IAEpB,IAAI,MAAM,IAAI,GAAG,GAAG;AACpB,SAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,EAEzB,KAAI,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,GAAG,EAAE;AAE5C,WAAO,QAAQ;IAEf,IAAI,MAAM,IAAI,IAAI,EAAE,UAAU,KAAK,OAAO;IAE1C,IAAI,MAAM,KAAK,KAAK,KAAK,EAAE;AAC3B,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK;KACrB,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,OAAO;AAElC,YAAO,IAAI;KAEX,IAAI,IAAI,KAAK;AAEb,SAAI,IAAI,GACJ,KAAI,OAAO;UAEV;MAED,IAAI,IAAI,GAAG,IAAI;AACf,UAAI,KAAK,GACL,KAAI,IAAI,KAAK,KAAK,KAAK,EAAE,EAAE,OAAO,GAAG,IAAI,IAAI,IAAI;eAC5C,KAAK,GACV,KAAI,IAAI,KAAK,KAAK,KAAK,EAAE,EAAE,OAAO;eAC7B,KAAK,GACV,KAAI,KAAK,KAAK,KAAK,KAAK,IAAI,EAAE,OAAO;AACzC,aAAO,IACH,KAAI,OAAO;;;IAIvB,IAAI,KAAK,IAAI,SAAS,GAAG,KAAK,EAAE,KAAK,IAAI,SAAS,KAAK;AAEvD,UAAM,IAAI,GAAG;AAEb,UAAM,IAAI,GAAG;AACb,SAAK,KAAK,IAAI,KAAK,EAAE;AACrB,SAAK,KAAK,IAAI,KAAK,EAAE;SAGrB,KAAI,EAAE;AACV,OAAI,MAAM,MAAM;AACZ,QAAI,KACA,KAAI,EAAE;AACV;;;AAKR,MAAI,OACA,MAAK,KAAK,OAAO;EACrB,IAAI,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,OAAO;EAC7C,IAAI,OAAO;AACX,UAAQ,OAAO,KAAK;GAEhB,IAAI,IAAI,GAAG,OAAO,KAAK,IAAI,GAAG,MAAM,MAAM,KAAK;AAC/C,UAAO,IAAI;AACX,OAAI,MAAM,MAAM;AACZ,QAAI,KACA,KAAI,EAAE;AACV;;AAEJ,OAAI,CAAC,EACD,KAAI,EAAE;AACV,OAAI,MAAM,IACN,KAAI,QAAQ;YACP,OAAO,KAAK;AACjB,WAAO,KAAK,KAAK;AACjB;UAEC;IACD,IAAI,MAAM,MAAM;AAEhB,QAAI,MAAM,KAAK;KAEX,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;AAC5B,WAAM,KAAK,KAAK,MAAM,KAAK,KAAK,EAAE,GAAG,GAAG;AACxC,YAAO;;IAGX,IAAI,IAAI,GAAG,OAAO,KAAK,IAAI,GAAG,MAAM,OAAO,KAAK;AAChD,QAAI,CAAC,EACD,KAAI,EAAE;AACV,WAAO,IAAI;IACX,IAAI,KAAK,GAAG;AACZ,QAAI,OAAO,GAAG;KACV,IAAI,IAAI,KAAK;AACb,WAAM,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,GAAG,OAAO;;AAElD,QAAI,MAAM,MAAM;AACZ,SAAI,KACA,KAAI,EAAE;AACV;;AAEJ,QAAI,OACA,MAAK,KAAK,OAAO;IACrB,IAAI,MAAM,KAAK;AACf,QAAI,KAAK,IAAI;KACT,IAAI,QAAQ,KAAK,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI;AAC7C,SAAI,QAAQ,KAAK,EACb,KAAI,EAAE;AACV,YAAO,KAAK,MAAM,EAAE,GAChB,KAAI,MAAM,KAAK,QAAQ;;AAE/B,WAAO,KAAK,KAAK,EAAE,GACf,KAAI,MAAM,IAAI,KAAK;;;AAG/B,KAAG,IAAI,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI;AAC1C,MAAI,GACA,SAAQ,GAAG,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI;UACxC,CAAC;AAEV,QAAO,MAAM,IAAI,UAAU,QAAQ,IAAI,KAAK,GAAG,GAAG,GAAG,IAAI,SAAS,GAAG,GAAG;;AAG5E,IAAI,QAAQ,SAAU,GAAG,GAAG,GAAG;AAC3B,OAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;AAClB,GAAE,MAAM;AACR,GAAE,IAAI,MAAM,KAAK;;AAGrB,IAAI,UAAU,SAAU,GAAG,GAAG,GAAG;AAC7B,OAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;AAClB,GAAE,MAAM;AACR,GAAE,IAAI,MAAM,KAAK;AACjB,GAAE,IAAI,MAAM,KAAK;;AAGrB,IAAI,QAAQ,SAAU,GAAG,IAAI;CAEzB,IAAI,IAAI,EAAE;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC5B,KAAI,EAAE,GACF,GAAE,KAAK;EAAE,GAAG;EAAG,GAAG,EAAE;EAAI,CAAC;CAEjC,IAAI,IAAI,EAAE;CACV,IAAI,KAAK,EAAE,OAAO;AAClB,KAAI,CAAC,EACD,QAAO;EAAE,GAAG;EAAI,GAAG;EAAG;AAC1B,KAAI,KAAK,GAAG;EACR,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE;AAC1B,IAAE,EAAE,GAAG,KAAK;AACZ,SAAO;GAAE,GAAG;GAAG,GAAG;GAAG;;AAEzB,GAAE,KAAK,SAAU,GAAG,GAAG;AAAE,SAAO,EAAE,IAAI,EAAE;GAAK;AAG7C,GAAE,KAAK;EAAE,GAAG;EAAI,GAAG;EAAO,CAAC;CAC3B,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,KAAK,GAAG,KAAK,GAAG,KAAK;AAC7C,GAAE,KAAK;EAAE,GAAG;EAAI,GAAG,EAAE,IAAI,EAAE;EAAM;EAAM;EAAG;AAM1C,QAAO,MAAM,IAAI,GAAG;AAChB,MAAI,EAAE,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,OAAO;AACjC,MAAI,EAAE,MAAM,MAAM,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,OAAO;AAC7C,IAAE,QAAQ;GAAE,GAAG;GAAI,GAAG,EAAE,IAAI,EAAE;GAAM;GAAM;GAAG;;CAEjD,IAAI,SAAS,GAAG,GAAG;AACnB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,KAAI,GAAG,GAAG,IAAI,OACV,UAAS,GAAG,GAAG;CAGvB,IAAI,KAAK,IAAI,IAAI,SAAS,EAAE;CAE5B,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI,IAAI,EAAE;AAC9B,KAAI,MAAM,IAAI;EAIV,IAAI,IAAI,GAAG,KAAK;EAEhB,IAAI,MAAM,MAAM,IAAI,MAAM,KAAK;AAC/B,KAAG,KAAK,SAAU,GAAG,GAAG;AAAE,UAAO,GAAG,EAAE,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;IAAK;AACnE,SAAO,IAAI,GAAG,EAAE,GAAG;GACf,IAAI,OAAO,GAAG,GAAG;AACjB,OAAI,GAAG,QAAQ,IAAI;AACf,UAAM,OAAO,KAAM,MAAM,GAAG;AAC5B,OAAG,QAAQ;SAGX;;AAER,SAAO;AACP,SAAO,KAAK,GAAG;GACX,IAAI,OAAO,GAAG,GAAG;AACjB,OAAI,GAAG,QAAQ,GACX,OAAM,KAAM,KAAK,GAAG,UAAU;OAE9B,GAAE;;AAEV,SAAO,KAAK,KAAK,IAAI,EAAE,GAAG;GACtB,IAAI,OAAO,GAAG,GAAG;AACjB,OAAI,GAAG,SAAS,IAAI;AAChB,MAAE,GAAG;AACL,MAAE;;;AAGV,QAAM;;AAEV,QAAO;EAAE,GAAG,IAAI,GAAG,GAAG;EAAE,GAAG;EAAK;;AAGpC,IAAI,KAAK,SAAU,GAAG,GAAG,GAAG;AACxB,QAAO,EAAE,KAAK,KACR,KAAK,IAAI,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,CAAC,GAC7C,EAAE,EAAE,KAAK;;AAGpB,IAAI,KAAK,SAAU,GAAG;CAClB,IAAI,IAAI,EAAE;AAEV,QAAO,KAAK,CAAC,EAAE,EAAE;CAEjB,IAAI,KAAK,IAAI,IAAI,EAAE,EAAE;CAErB,IAAI,MAAM,GAAG,MAAM,EAAE,IAAI,MAAM;CAC/B,IAAI,IAAI,SAAU,GAAG;AAAE,KAAG,SAAS;;AACnC,MAAK,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,EACtB,KAAI,EAAE,MAAM,OAAO,KAAK,EACpB,GAAE;MACD;AACD,MAAI,CAAC,OAAO,MAAM,GAAG;AACjB,UAAO,MAAM,KAAK,OAAO,IACrB,GAAE,MAAM;AACZ,OAAI,MAAM,GAAG;AACT,MAAE,MAAM,KAAO,MAAM,MAAO,IAAK,QAAU,MAAM,KAAM,IAAK,MAAM;AAClE,UAAM;;aAGL,MAAM,GAAG;AACd,KAAE,IAAI,EAAE,EAAE;AACV,UAAO,MAAM,GAAG,OAAO,EACnB,GAAE,KAAK;AACX,OAAI,MAAM,EACN,GAAI,MAAM,KAAM,IAAK,KAAK,EAAE,MAAM;;AAE1C,SAAO,MACH,GAAE,IAAI;AACV,QAAM;AACN,QAAM,EAAE;;AAGhB,QAAO;EAAE,GAAG,GAAG,SAAS,GAAG,IAAI;EAAE,GAAG;EAAG;;AAG3C,IAAI,OAAO,SAAU,IAAI,IAAI;CACzB,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,EAC7B,MAAK,GAAG,KAAK,GAAG;AACpB,QAAO;;AAIX,IAAI,QAAQ,SAAU,KAAK,KAAK,KAAK;CAEjC,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,KAAK,MAAM,EAAE;AACrB,KAAI,KAAK,IAAI;AACb,KAAI,IAAI,KAAK,KAAK;AAClB,KAAI,IAAI,KAAK,IAAI,KAAK;AACtB,KAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,KAAI,IAAI,IAAI,KAAK,IAAI;AACzB,SAAQ,IAAI,IAAI,KAAK;;AAGzB,IAAI,OAAO,SAAU,KAAK,KAAK,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG;AACnE,OAAM,KAAK,KAAK,MAAM;AACtB,GAAE,GAAG;CACL,IAAI,KAAK,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,GAAG,MAAM,GAAG;CAC7C,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO,GAAG,GAAG,MAAM,GAAG;CACxC,IAAI,SAAS,IAAI,IAAI,GAAG;AACxB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EAC/B,GAAE,OAAO,KAAK,KAAK;AACvB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EAC/B,GAAE,OAAO,KAAK,KAAK;CACvB,IAAI,KAAK,MAAM,QAAQ,EAAE,EAAE,MAAM,GAAG,GAAG,OAAO,GAAG;CACjD,IAAI,OAAO;AACX,QAAO,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,KAAK,EAAE;CAE3C,IAAI,OAAQ,KAAK,KAAM;CACvB,IAAI,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG;CAC5C,IAAI,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,IAAI,OAAO,KAAK,QAAQ,IAAI,GAAG,IAAI,OAAO,MAAM,IAAI,OAAO,MAAM,IAAI,OAAO;AAClI,KAAI,MAAM,KAAK,QAAQ,SAAS,QAAQ,MACpC,QAAO,MAAM,KAAK,GAAG,IAAI,SAAS,IAAI,KAAK,GAAG,CAAC;CACnD,IAAI,IAAI,IAAI,IAAI;AAChB,OAAM,KAAK,GAAG,KAAK,QAAQ,OAAO,EAAE,KAAK;AACzC,KAAI,QAAQ,OAAO;AACf,OAAK,KAAK,KAAK,KAAK,EAAE,EAAE,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,EAAE,KAAK;EAC/D,IAAI,MAAM,KAAK,KAAK,MAAM,EAAE;AAC5B,QAAM,KAAK,GAAG,MAAM,IAAI;AACxB,QAAM,KAAK,IAAI,GAAG,MAAM,EAAE;AAC1B,QAAM,KAAK,IAAI,IAAI,OAAO,EAAE;AAC5B,OAAK;AACL,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,EACxB,OAAM,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI;AACvC,OAAK,IAAI;EACT,IAAI,OAAO,CAAC,MAAM,KAAK;AACvB,OAAK,IAAI,KAAK,GAAG,KAAK,GAAG,EAAE,IAAI;GAC3B,IAAI,OAAO,KAAK;AAChB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;IAClC,IAAI,MAAM,KAAK,KAAK;AACpB,UAAM,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,IAAI;AAClC,QAAI,MAAM,GACN,OAAM,KAAK,GAAI,KAAK,MAAM,IAAK,IAAI,EAAE,KAAK,KAAK,MAAM;;;OAKjE,MAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAEvC,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;EACzB,IAAI,MAAM,KAAK;AACf,MAAI,MAAM,KAAK;GACX,IAAI,MAAO,OAAO,KAAM;AACxB,WAAQ,KAAK,GAAG,GAAG,MAAM,KAAK,EAAE,KAAK,GAAG,MAAM;AAC9C,OAAI,MAAM,EACN,OAAM,KAAK,GAAI,OAAO,KAAM,GAAG,EAAE,KAAK,KAAK;GAC/C,IAAI,MAAM,MAAM;AAChB,WAAQ,KAAK,GAAG,GAAG,KAAK,EAAE,KAAK,GAAG;AAClC,OAAI,MAAM,EACN,SAAQ,KAAK,GAAI,OAAO,IAAK,KAAK,EAAE,KAAK,KAAK;QAGlD,SAAQ,KAAK,GAAG,GAAG,KAAK,EAAE,KAAK,GAAG;;AAG1C,SAAQ,KAAK,GAAG,GAAG,KAAK;AACxB,QAAO,IAAI,GAAG;;AAGlB,IAAI,sBAAoB,IAAI,IAAI;CAAC;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAS;CAAS;CAAS;CAAQ,CAAC;AAE5G,IAAI,qBAAmB,IAAI,GAAG,EAAE;AAEhC,IAAI,OAAO,SAAU,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;CAChD,IAAI,IAAI,GAAG,KAAK,IAAI;CACpB,IAAI,IAAI,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAK,IAAI,KAAK;CAE9D,IAAI,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,KAAK;CACxC,IAAI,MAAM,GAAG;CACb,IAAI,OAAO,GAAG,KAAK,KAAK;AACxB,KAAI,KAAK;AACL,MAAI,IACA,GAAE,KAAK,GAAG,KAAK;EACnB,IAAI,MAAM,IAAI,MAAM;EACpB,IAAI,IAAI,OAAO,IAAI,IAAI,MAAM;EAC7B,IAAI,SAAS,KAAK,QAAQ;EAE1B,IAAI,OAAO,GAAG,KAAK,IAAI,IAAI,MAAM,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,QAAQ,EAAE;EACpE,IAAI,QAAQ,KAAK,KAAK,OAAO,EAAE,EAAE,QAAQ,IAAI;EAC7C,IAAI,MAAM,SAAU,GAAG;AAAE,WAAQ,IAAI,KAAM,IAAI,IAAI,MAAM,QAAU,IAAI,IAAI,MAAM,SAAU;;EAG3F,IAAI,OAAO,IAAI,IAAI,KAAM;EAEzB,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,GAAG;EAEvC,IAAI,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK;AAClE,SAAO,IAAI,IAAI,GAAG,EAAE,GAAG;GAEnB,IAAI,KAAK,IAAI,EAAE;GAEf,IAAI,OAAO,IAAI,OAAO,QAAQ,KAAK;AACnC,QAAK,QAAQ;AACb,QAAK,MAAM;AAGX,OAAI,MAAM,GAAG;IAET,IAAI,MAAM,IAAI;AACd,SAAK,OAAO,OAAQ,KAAK,WAAW,MAAM,OAAO,CAAC,MAAM;AACpD,WAAM,KAAK,KAAK,GAAG,GAAG,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAC5D,UAAK,OAAO,KAAK,GAAG,KAAK;AACzB,UAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,EACvB,IAAG,KAAK;AACZ,UAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,IAAG,KAAK;;IAGhB,IAAI,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,OAAO,QAAQ;AACjD,QAAI,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;KAC/B,IAAI,OAAO,KAAK,IAAI,GAAG,IAAI,GAAG;KAC9B,IAAI,OAAO,KAAK,IAAI,OAAO,EAAE;KAG7B,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI;AAC3B,YAAO,OAAO,QAAQ,EAAE,QAAQ,QAAQ,OAAO;AAC3C,UAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;OAChC,IAAI,KAAK;AACT,cAAO,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI,IAAI,KAAK,MAAM,EAAE;AAEtD,WAAI,KAAK,GAAG;AACR,YAAI,IAAI,IAAI;AAEZ,YAAI,KAAK,KACL;QAIJ,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE;QAC/B,IAAI,KAAK;AACT,aAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;SAC1B,IAAI,KAAK,IAAI,MAAM,IAAI;SAEvB,IAAI,KAAK,KADC,KAAK,MACK;AACpB,aAAI,KAAK,GACL,MAAK,IAAI,QAAQ;;;;AAKjC,aAAO,OAAO,QAAQ,KAAK;AAC3B,aAAO,OAAO,QAAQ;;;AAI9B,QAAI,GAAG;AAGH,UAAK,QAAQ,YAAa,MAAM,MAAM,KAAM,MAAM;KAClD,IAAI,MAAM,MAAM,KAAK,IAAI,MAAM,MAAM,KAAK;AAC1C,WAAM,KAAK,OAAO,KAAK;AACvB,OAAE,GAAG,MAAM;AACX,OAAE,GAAG;AACL,UAAK,IAAI;AACT,OAAE;WAED;AACD,UAAK,QAAQ,IAAI;AACjB,OAAE,GAAG,IAAI;;;;AAIrB,OAAK,IAAI,KAAK,IAAI,GAAG,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG;AAClC,QAAK,QAAQ,IAAI;AACjB,KAAE,GAAG,IAAI;;AAEb,QAAM,KAAK,KAAK,GAAG,KAAK,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAC9D,MAAI,CAAC,KAAK;AACN,MAAG,IAAK,MAAM,IAAK,EAAG,MAAM,IAAK,MAAM;AAEvC,UAAO;AACP,MAAG,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,IAAI,GAAG,GAAG,IAAI;;QAG9C;AACD,OAAK,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAK,OAAO;GAE7C,IAAI,IAAI,IAAI;AACZ,OAAI,KAAK,GAAG;AAER,MAAG,MAAM,IAAK,KAAK;AACnB,QAAI;;AAER,SAAM,MAAM,GAAG,MAAM,GAAG,IAAI,SAAS,GAAG,EAAE,CAAC;;AAE/C,KAAG,IAAI;;AAEX,QAAO,IAAI,GAAG,GAAG,MAAM,KAAK,IAAI,GAAG,KAAK;;AAG5C,IAAI,OAAqB,iBAAC,WAAY;CAClC,IAAI,IAAI,IAAI,WAAW,IAAI;AAC3B,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;EAC1B,IAAI,IAAI,GAAG,IAAI;AACf,SAAO,EAAE,EACL,MAAM,IAAI,KAAM,cAAe,MAAM;AACzC,IAAE,KAAK;;AAEX,QAAO;IACP;AAEJ,IAAI,MAAM,WAAY;CAClB,IAAI,IAAI;AACR,QAAO;EACH,GAAG,SAAU,GAAG;GAEZ,IAAI,KAAK;AACT,QAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC5B,MAAK,KAAM,KAAK,MAAO,EAAE,MAAO,OAAO;AAC3C,OAAI;;EAER,GAAG,WAAY;AAAE,UAAO,CAAC;;EAC5B;;AA0BL,IAAI,OAAO,SAAU,KAAK,KAAK,KAAK,MAAM,IAAI;AAC1C,KAAI,CAAC,IAAI;AACL,OAAK,EAAE,GAAG,GAAG;AACb,MAAI,IAAI,YAAY;GAChB,IAAI,OAAO,IAAI,WAAW,SAAS,OAAO;GAC1C,IAAI,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO;AAC7C,UAAO,IAAI,KAAK;AAChB,UAAO,IAAI,KAAK,KAAK,OAAO;AAC5B,SAAM;AACN,MAAG,IAAI,KAAK;;;AAGpB,QAAO,KAAK,KAAK,IAAI,SAAS,OAAO,IAAI,IAAI,OAAO,IAAI,OAAO,OAAQ,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,KAAO,KAAK,IAAI,KAAM,KAAK,MAAM,GAAG;;AAGzL,IAAI,MAAM,SAAU,GAAG,GAAG;CACtB,IAAI,IAAI,EAAE;AACV,MAAK,IAAI,KAAK,EACV,GAAE,KAAK,EAAE;AACb,MAAK,IAAI,KAAK,EACV,GAAE,KAAK,EAAE;AACb,QAAO;;AASX,IAAI,OAAO,SAAU,IAAI,OAAO,IAAI;CAChC,IAAI,KAAK,IAAI;CACb,IAAI,KAAK,GAAG,UAAU;CACtB,IAAI,KAAK,GAAG,MAAM,GAAG,QAAQ,IAAI,GAAG,GAAG,GAAG,YAAY,IAAI,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,MAAM,IAAI;AAC1F,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,EAAE,GAAG;EAChC,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG;AACtB,MAAI,OAAO,KAAK,YAAY;AACxB,YAAS,MAAM,IAAI;GACnB,IAAI,OAAO,EAAE,UAAU;AACvB,OAAI,EAAE,UAEF,KAAI,KAAK,QAAQ,gBAAgB,IAAI,IAAI;IACrC,IAAI,QAAQ,KAAK,QAAQ,KAAK,EAAE,GAAG;AACnC,aAAS,KAAK,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAM,CAAC;UAEnD;AACD,aAAS;AACT,SAAK,IAAI,KAAK,EAAE,UACZ,UAAS,MAAM,IAAI,gBAAgB,IAAI,MAAM,EAAE,UAAU,GAAG,UAAU;;OAI9E,UAAS;QAGb,IAAG,KAAK;;AAEhB,QAAO;;AAEX,IAAI,KAAK,EAAE;AAEX,IAAI,OAAO,SAAU,GAAG;CACpB,IAAI,KAAK,EAAE;AACX,MAAK,IAAI,KAAK,EACV,KAAI,EAAE,GAAG,OACL,IAAG,MAAM,EAAE,KAAK,IAAI,EAAE,GAAG,YAAY,EAAE,GAAG,EAAE,OAAO;AAG3D,QAAO;;AAGX,IAAI,OAAO,SAAU,KAAK,MAAM,IAAI,IAAI;AACpC,KAAI,CAAC,GAAG,KAAK;EACT,IAAI,QAAQ,IAAI,OAAO,EAAE,EAAE,IAAI,IAAI,SAAS;AAC5C,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,SAAQ,KAAK,IAAI,IAAI,OAAO,KAAK;AACrC,KAAG,MAAM;GAAE,GAAG,KAAK,IAAI,IAAI,OAAO,KAAK;GAAE,GAAG;GAAM;;CAEtD,IAAI,KAAK,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE;AAC1B,QAAO,GAAG,GAAG,IAAI,IAAI,4EAA4E,KAAK,UAAU,GAAG,KAAK,IAAI,IAAI,KAAK,GAAG,EAAE,GAAG;;AAGjJ,IAAI,SAAS,WAAY;AAAE,QAAO;EAAC;EAAI;EAAK;EAAK;EAAM;EAAM;EAAM;EAAI;EAAI;EAAM;EAAM;EAAK;EAAI;EAAM;EAAK;EAAM;EAAQ;EAAM;EAAK;EAAK;EAAO;EAAa;EAAK;EAAK;;AACvK,IAAI,QAAQ,WAAY;AAAE,QAAO;EAAC;EAAI;EAAK;EAAK;EAAM;EAAM;EAAM;EAAO;EAAO;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAI;EAAM;EAAO;EAAS;EAAO;EAAI;EAAI;EAAM;EAAO;EAAM;EAAM;EAAK;EAAM;EAAM;EAAa;EAAI;;AAUlN,IAAI,MAAM,SAAU,KAAK;AAAE,QAAO,YAAY,KAAK,CAAC,IAAI,OAAO,CAAC;;AAEhE,IAAI,OAAO,SAAU,GAAG;AAAE,QAAO,KAAK;EAClC,KAAK,EAAE,QAAQ,IAAI,GAAG,EAAE,KAAK;EAC7B,YAAY,EAAE;EACjB;;AAED,IAAI,QAAQ,SAAU,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI;CAChD,IAAI,IAAI,KAAK,KAAK,MAAM,IAAI,SAAU,KAAK,KAAK;AAC5C,IAAE,WAAW;AACb,KAAG,KAAK,IAAI;GACd;AACF,GAAE,YAAY,CAAC,KAAK,KAAK,EAAE,KAAK,UAAU,CAAC,IAAI,OAAO,GAAG,EAAE,CAAC;AAC5D,QAAO,WAAY;AAAE,IAAE,WAAW;;;AAiDtC,IAAI,KAAK,SAAU,GAAG,GAAG;AAAE,QAAO,EAAE,KAAM,EAAE,IAAI,MAAM;;AAEtD,IAAI,KAAK,SAAU,GAAG,GAAG;AAAE,SAAQ,EAAE,KAAM,EAAE,IAAI,MAAM,IAAM,EAAE,IAAI,MAAM,KAAO,EAAE,IAAI,MAAM,QAAS;;AACrG,IAAI,KAAK,SAAU,GAAG,GAAG;AAAE,QAAO,GAAG,GAAG,EAAE,GAAI,GAAG,GAAG,IAAI,EAAE,GAAG;;AAE7D,IAAI,SAAS,SAAU,GAAG,GAAG,GAAG;AAC5B,QAAO,GAAG,EAAE,EACR,GAAE,KAAK,GAAG,OAAO;;AAoJzB,SAAgB,QAAQ,MAAM,MAAM,IAAI;AACpC,KAAI,CAAC,GACD,MAAK,MAAM,OAAO,EAAE;AACxB,KAAI,OAAO,MAAM,WACb,KAAI,EAAE;AACV,QAAO,MAAM,MAAM,MAAM,CACrB,MACH,EAAE,SAAU,IAAI;AAAE,SAAO,IAAI,YAAY,GAAG,KAAK,IAAI,GAAG,KAAK,GAAG,CAAC;IAAK,GAAG,GAAG;;;;;;;;AAQjF,SAAgB,YAAY,MAAM,MAAM;AACpC,QAAO,KAAK,MAAM,QAAQ,EAAE,EAAE,GAAG,EAAE;;AAiEvC,SAAgB,QAAQ,MAAM,MAAM,IAAI;AACpC,KAAI,CAAC,GACD,MAAK,MAAM,OAAO,EAAE;AACxB,KAAI,OAAO,MAAM,WACb,KAAI,EAAE;AACV,QAAO,MAAM,MAAM,MAAM,CACrB,OACH,EAAE,SAAU,IAAI;AAAE,SAAO,IAAI,YAAY,GAAG,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;IAAK,GAAG,GAAG;;;;;;;;AAQvF,SAAgB,YAAY,MAAM,MAAM;AACpC,QAAO,MAAM,MAAM,EAAE,GAAG,GAAG,EAAE,QAAQ,KAAK,KAAK,QAAQ,KAAK,WAAW;;AA2a3E,IAAI,OAAO,SAAU,GAAG,GAAG,GAAG,GAAG;AAC7B,MAAK,IAAI,KAAK,GAAG;EACb,IAAI,MAAM,EAAE,IAAI,IAAI,IAAI,GAAG,KAAK;AAChC,MAAI,MAAM,QAAQ,IAAI,CAClB,MAAK,IAAI,GAAG,IAAI,GAAG,EAAE,MAAM,IAAI;AACnC,MAAI,eAAe,GACf,GAAE,KAAK,CAAC,KAAK,GAAG;OACf;AACD,KAAE,KAAK,OAAO,CAAC,IAAI,GAAG,EAAE,EAAE,GAAG;AAC7B,QAAK,KAAK,GAAG,GAAG,EAAE;;;;AAK9B,IAAI,KAAK,OAAO,eAAe,+BAA6B,IAAI,aAAa;AAE7E,IAAI,KAAK,OAAO,eAAe,+BAA6B,IAAI,aAAa;AAG7E,IAAI;AACA,IAAG,OAAO,IAAI,EAAE,QAAQ,MAAM,CAAC;SAG5B,GAAG;AAEV,IAAI,QAAQ,SAAU,GAAG;AACrB,MAAK,IAAI,IAAI,IAAI,IAAI,KAAK;EACtB,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,IAAI,QAAQ,IAAI,QAAQ,IAAI;AACtC,MAAI,IAAI,KAAK,EAAE,OACX,QAAO;GAAE,GAAG;GAAG,GAAG,IAAI,GAAG,IAAI,EAAE;GAAE;AACrC,MAAI,CAAC,GACD,MAAK,OAAO,aAAa,EAAE;WACtB,MAAM,EACX,OAAM,IAAI,OAAO,MAAM,EAAE,OAAO,OAAO,MAAM,EAAE,OAAO,OAAO,IAAK,EAAE,OAAO,MAAO,OAC9E,KAAK,OAAO,aAAa,QAAS,KAAK,IAAK,QAAS,IAAI,KAAM;WAE9D,KAAK,EACV,MAAK,OAAO,cAAc,IAAI,OAAO,IAAK,EAAE,OAAO,GAAI;MAEvD,MAAK,OAAO,cAAc,IAAI,OAAO,MAAM,EAAE,OAAO,OAAO,IAAK,EAAE,OAAO,GAAI;;;;;;;;;;AAuFzF,SAAgB,QAAQ,KAAK,QAAQ;AACjC,KAAI,QAAQ;EACR,IAAI,OAAO,IAAI,GAAG,IAAI,OAAO;AAC7B,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,EAC9B,MAAK,KAAK,IAAI,WAAW,EAAE;AAC/B,SAAO;;AAEX,KAAI,GACA,QAAO,GAAG,OAAO,IAAI;CACzB,IAAI,IAAI,IAAI;CACZ,IAAI,KAAK,IAAI,GAAG,IAAI,UAAU,IAAI,UAAU,GAAG;CAC/C,IAAI,KAAK;CACT,IAAI,IAAI,SAAU,GAAG;AAAE,KAAG,QAAQ;;AAClC,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,MAAI,KAAK,IAAI,GAAG,QAAQ;GACpB,IAAI,IAAI,IAAI,GAAG,KAAK,KAAM,IAAI,KAAM,GAAG;AACvC,KAAE,IAAI,GAAG;AACT,QAAK;;EAET,IAAI,IAAI,IAAI,WAAW,EAAE;AACzB,MAAI,IAAI,OAAO,OACX,GAAE,EAAE;WACC,IAAI,KACT,GAAE,MAAO,KAAK,EAAG,EAAE,EAAE,MAAO,IAAI,GAAI;WAC/B,IAAI,SAAS,IAAI,MACtB,KAAI,SAAS,IAAI,WAAe,IAAI,WAAW,EAAE,EAAE,GAAG,MAClD,EAAE,MAAO,KAAK,GAAI,EAAE,EAAE,MAAQ,KAAK,KAAM,GAAI,EAAE,EAAE,MAAQ,KAAK,IAAK,GAAI,EAAE,EAAE,MAAO,IAAI,GAAI;MAE9F,GAAE,MAAO,KAAK,GAAI,EAAE,EAAE,MAAQ,KAAK,IAAK,GAAI,EAAE,EAAE,MAAO,IAAI,GAAI;;AAEvE,QAAO,IAAI,IAAI,GAAG,GAAG;;;;;;;;;AASzB,SAAgB,UAAU,KAAK,QAAQ;AACnC,KAAI,QAAQ;EACR,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,MACjC,MAAK,OAAO,aAAa,MAAM,MAAM,IAAI,SAAS,GAAG,IAAI,MAAM,CAAC;AACpE,SAAO;YAEF,GACL,QAAO,GAAG,OAAO,IAAI;MAEpB;EACD,IAAI,KAAK,MAAM,IAAI,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG;AACtC,MAAI,EAAE,OACF,KAAI,EAAE;AACV,SAAO;;;AAOf,IAAI,OAAO,SAAU,GAAG,GAAG;AAAE,QAAO,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;;AAE1E,IAAI,KAAK,SAAU,GAAG,GAAG,GAAG;CACxB,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,KAAK,UAAU,EAAE,SAAS,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,MAAM,EAAE,KAAK,IAAI,KAAK,KAAK,KAAK,GAAG,GAAG,IAAI,GAAG;CACxI,IAAI,KAAK,KAAK,MAAM,aAAa,KAAK,GAAG,GAAG,GAAG;EAAC;EAAI,GAAG,GAAG,IAAI,GAAG;EAAE,GAAG,GAAG,IAAI,GAAG;EAAC,EAAE,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG;AACpH,QAAO;EAAC,GAAG,GAAG,IAAI,GAAG;EAAE;EAAI;EAAI;EAAI,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;EAAE;EAAI;;AAG/E,IAAI,OAAO,SAAU,GAAG,GAAG;AACvB,QAAO,GAAG,GAAG,EAAE,IAAI,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,EAAE;AAE3C,QAAO;EAAC,GAAG,GAAG,IAAI,GAAG;EAAE,GAAG,GAAG,IAAI,EAAE;EAAE,GAAG,GAAG,IAAI,GAAG;EAAC;;AAGvD,IAAI,OAAO,SAAU,IAAI;CACrB,IAAI,KAAK;AACT,KAAI,GACA,MAAK,IAAI,KAAK,IAAI;EACd,IAAI,IAAI,GAAG,GAAG;AACd,MAAI,IAAI,MACJ,KAAI,EAAE;AACV,QAAM,IAAI;;AAGlB,QAAO;;AAGX,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI;CAC3C,IAAI,KAAK,GAAG,QAAQ,KAAK,EAAE,OAAO,MAAM,MAAM,GAAG;CACjD,IAAI,MAAM,KAAK,GAAG;AAClB,QAAO,GAAG,GAAG,MAAM,OAAO,WAAY,SAAU,EAAE,KAAK;AACvD,KAAI,MAAM,KACN,GAAE,OAAO,IAAI,EAAE,OAAO,EAAE;AAC5B,GAAE,KAAK,IAAI,KAAK;AAChB,GAAE,OAAQ,EAAE,QAAQ,KAAM,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK;AACrD,GAAE,OAAO,EAAE,cAAc,KAAK,EAAE,OAAO,EAAE,eAAe;CACxD,IAAI,KAAK,IAAI,KAAK,EAAE,SAAS,OAAO,KAAK,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,GAAG,aAAa,GAAG;AAClF,KAAI,IAAI,KAAK,IAAI,IACb,KAAI,GAAG;AACX,QAAO,GAAG,GAAI,KAAK,KAAQ,GAAG,UAAU,GAAG,KAAM,KAAO,GAAG,SAAS,IAAI,KAAO,GAAG,UAAU,IAAI,KAAO,GAAG,YAAY,IAAI,IAAM,GAAG,YAAY,IAAI,EAAG,EAAE,KAAK;AAC7J,KAAI,KAAK,IAAI;AACT,SAAO,GAAG,GAAG,EAAE,IAAI;AACnB,SAAO,GAAG,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE;AACpC,SAAO,GAAG,IAAI,GAAG,EAAE,KAAK;;AAE5B,QAAO,GAAG,IAAI,IAAI,GAAG;AACrB,QAAO,GAAG,IAAI,IAAI,IAAI,EAAE,KAAK;AAC7B,KAAI,MAAM,MAAM;AACZ,SAAO,GAAG,GAAG,IAAI;AACjB,SAAO,GAAG,IAAI,GAAG,EAAE,MAAM;AACzB,SAAO,GAAG,IAAI,IAAI,GAAG,EAAE,KAAK;;AAEhC,GAAE,IAAI,IAAI,EAAE;AACZ,MAAK;AACL,KAAI,IACA,MAAK,IAAI,KAAK,IAAI;EACd,IAAI,MAAM,GAAG,IAAI,IAAI,IAAI;AACzB,SAAO,GAAG,GAAG,CAAC,EAAE;AAChB,SAAO,GAAG,IAAI,GAAG,EAAE;AACnB,IAAE,IAAI,KAAK,IAAI,EAAE,EAAE,KAAK,IAAI;;AAGpC,KAAI,IACA,GAAE,IAAI,IAAI,EAAE,EAAE,KAAK;AACvB,QAAO;;AAGX,IAAI,MAAM,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG;AAC/B,QAAO,GAAG,GAAG,UAAU;AACvB,QAAO,GAAG,IAAI,GAAG,EAAE;AACnB,QAAO,GAAG,IAAI,IAAI,EAAE;AACpB,QAAO,GAAG,IAAI,IAAI,EAAE;AACpB,QAAO,GAAG,IAAI,IAAI,EAAE;;AA+QxB,SAAgB,IAAI,MAAM,MAAM,IAAI;AAChC,KAAI,CAAC,GACD,MAAK,MAAM,OAAO,EAAE;AACxB,KAAI,OAAO,MAAM,WACb,KAAI,EAAE;CACV,IAAI,IAAI,EAAE;AACV,MAAK,MAAM,IAAI,GAAG,KAAK;CACvB,IAAI,IAAI,OAAO,KAAK,EAAE;CACtB,IAAI,MAAM,EAAE,QAAQ,IAAI,GAAG,MAAM;CACjC,IAAI,OAAO,KAAK,QAAQ,IAAI,MAAM,IAAI;CACtC,IAAI,OAAO,EAAE;CACb,IAAI,OAAO,WAAY;AACnB,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EAC/B,MAAK,IAAI;;CAEjB,IAAI,MAAM,SAAU,GAAG,GAAG;AACtB,KAAG,WAAY;AAAE,MAAG,GAAG,EAAE;IAAI;;AAEjC,IAAG,WAAY;AAAE,QAAM;GAAM;CAC7B,IAAI,MAAM,WAAY;EAClB,IAAI,MAAM,IAAI,GAAG,MAAM,GAAG,EAAE,KAAK,GAAG,MAAM,MAAM;AAChD,QAAM;AACN,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,GAAG;GAC3B,IAAI,IAAI,MAAM;AACd,OAAI;IACA,IAAI,IAAI,EAAE,EAAE;AACZ,QAAI,KAAK,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAC7B,IAAI,OAAO,KAAK,EAAE,EAAE,SAAS,KAAK,EAAE,MAAM;IAC1C,IAAI,MAAM,MAAM;AAChB,QAAI,IAAI,EAAE,GAAG,IAAI;AACjB,QAAI,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,QAAQ,EAAE,IAAI,EAAE,EAAE,SAAS,IAAI,MAAM,MAAM;YAEzF,GAAG;AACN,WAAO,IAAI,GAAG,KAAK;;;AAG3B,MAAI,KAAK,GAAG,MAAM,QAAQ,KAAK,GAAG;AAClC,MAAI,MAAM,IAAI;;AAElB,KAAI,CAAC,IACD,MAAK;CACT,IAAI,UAAU,SAAU,GAAG;EACvB,IAAI,KAAK,EAAE;EACX,IAAI,KAAK,EAAE,KAAK,OAAO,GAAG,IAAI,IAAI,GAAG;EACrC,IAAI,IAAI,KAAK,EAAE,OAAO,KAAK;AAC3B,IAAE,EAAE,KAAK;EACT,IAAI,IAAI,QAAQ,GAAG,EAAE,IAAI,EAAE;EAC3B,IAAI,MAAM,EAAE,SAAS,IAAI,OAAO,QAAQ,IAAI,EAAE,KAAK,KAAK,EAAE;EAC1D,IAAI,MAAM,KAAK,EAAE,MAAM;EACvB,IAAI,cAAc,EAAE,SAAS,IAAI,IAAI;EACrC,IAAI,MAAM,SAAU,GAAG,GAAG;AACtB,OAAI,GAAG;AACH,UAAM;AACN,QAAI,GAAG,KAAK;UAEX;IACD,IAAI,IAAI,EAAE;AACV,UAAM,KAAK,IAAI,GAAG;KACR;KACN,KAAK,EAAE,GAAG;KACV,GAAG;KACA;KACA;KACH,GAAG,KAAK,GAAG,UAAW,KAAM,IAAI,UAAU;KAC7B;KAChB,CAAC;AACF,SAAK,KAAK,IAAI,MAAM;AACpB,WAAO,KAAK,KAAK,IAAI,QAAQ,MAAM,KAAK;AACxC,QAAI,CAAC,EAAE,IACH,MAAK;;;AAGjB,MAAI,IAAI,MACJ,KAAI,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK;AAC5B,MAAI,CAAC,YACD,KAAI,MAAM,KAAK;WACV,OAAO,KACZ,KAAI;AACA,OAAI,MAAM,YAAY,MAAM,EAAE,CAAC;WAE5B,GAAG;AACN,OAAI,GAAG,KAAK;;MAIhB,MAAK,KAAK,QAAQ,MAAM,GAAG,IAAI,CAAC;;AAGxC,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,EAAE,EACxB,SAAQ,EAAE;AAEd,QAAO;;AAkRX,IAAI,KAAK,OAAO,kBAAkB,aAAa,iBAAiB,OAAO,cAAc,aAAa,aAAa,SAAU,IAAI;AAAE,KAAI;;AACnI,SAAgB,MAAM,MAAM,MAAM,IAAI;AAClC,KAAI,CAAC,GACD,MAAK,MAAM,OAAO,EAAE;AACxB,KAAI,OAAO,MAAM,WACb,KAAI,EAAE;CACV,IAAI,OAAO,EAAE;CACb,IAAI,OAAO,WAAY;AACnB,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EAC/B,MAAK,IAAI;;CAEjB,IAAI,QAAQ,EAAE;CACd,IAAI,MAAM,SAAU,GAAG,GAAG;AACtB,KAAG,WAAY;AAAE,MAAG,GAAG,EAAE;IAAI;;AAEjC,IAAG,WAAY;AAAE,QAAM;GAAM;CAC7B,IAAI,IAAI,KAAK,SAAS;AACtB,QAAO,GAAG,MAAM,EAAE,IAAI,WAAW,EAAE,EAC/B,KAAI,CAAC,KAAK,KAAK,SAAS,IAAI,OAAO;AAC/B,MAAI,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK;AACxB,SAAO;;CAIf,IAAI,MAAM,GAAG,MAAM,IAAI,EAAE;AACzB,KAAI,KAAK;EACL,IAAI,IAAI;EACR,IAAI,IAAI,GAAG,MAAM,IAAI,GAAG;EACxB,IAAI,IAAI,KAAK,cAAc,KAAK;AAChC,MAAI,GAAG;GACH,IAAI,KAAK,GAAG,MAAM,IAAI,GAAG;AACzB,OAAI,GAAG,MAAM,GAAG,IAAI;AACpB,OAAI,GAAG;AACH,QAAI,MAAM,GAAG,MAAM,KAAK,GAAG;AAC3B,QAAI,GAAG,MAAM,KAAK,GAAG;;;EAG7B,IAAI,OAAO,QAAQ,KAAK;EACxB,IAAI,UAAU,SAAU,GAAG;GACvB,IAAI,KAAK,GAAG,MAAM,GAAG,EAAE,EAAE,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG,IAAI,IAAI,KAAK,MAAM,IAAI;AACtH,OAAI;GACJ,IAAI,MAAM,SAAU,GAAG,GAAG;AACtB,QAAI,GAAG;AACH,WAAM;AACN,SAAI,GAAG,KAAK;WAEX;AACD,SAAI,EACA,OAAM,MAAM;AAChB,SAAI,CAAC,EAAE,IACH,KAAI,MAAM,MAAM;;;AAG5B,OAAI,CAAC,QAAQ,KAAK;IACd,MAAM;IACN,MAAM;IACN,cAAc;IACd,aAAa;IAChB,CAAC,CACE,KAAI,CAAC,IACD,KAAI,MAAM,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC;YAC1B,OAAO,GAAG;IACf,IAAI,OAAO,KAAK,SAAS,GAAG,IAAI,GAAG;AAEnC,QAAI,KAAK,UAAU,KAAK,KAAM,GAC1B,KAAI;AACA,SAAI,MAAM,YAAY,MAAM,EAAE,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC;aAE9C,GAAG;AACN,SAAI,GAAG,KAAK;;QAIhB,MAAK,KAAK,QAAQ,MAAM,EAAE,MAAM,IAAI,EAAE,IAAI,CAAC;SAG/C,KAAI,IAAI,IAAI,8BAA8B,KAAK,EAAE,EAAE,KAAK;OAG5D,KAAI,MAAM,KAAK;;AAEvB,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,SAAQ,EAAE;OAId,KAAI,MAAM,EAAE,CAAC;AACjB,QAAO;;;;ACrkFX,MAAM,YAAY;CACd,QAAQ;CACR,SAAS;CACT,KAAK;CACR;AAGD,MAAM,cAAc,OAAO,IAAI,2BAA2B;AAC1D,MAAM,oBAAoB,OAAO,iCAAiC;AAClE,MAAM,iBAAiB,OAAO;AAC9B,MAAM,YAAY;CACd,SAAS;CACT,WAAW;CACd;AAED,MAAM,WAAW,EAAE;AAEnB,SAAS,IAAI,QAAQ,KAAK;AACtB,QAAO,kBAAkB,MACnB,OAAO,IAAI,IAAI,GACf,OAAO,UAAU,eAAe,KAAK,QAAQ,IAAI;;AAE3D,SAAS,cAAc,QAAQ,KAAK;AAChC,KAAI,OAAO,QAAQ;EACf,IAAI,YAAY,QAAQ,eAAe,OAAO;AAC9C,SAAO,WAAW;GACd,MAAM,aAAa,QAAQ,yBAAyB,WAAW,IAAI;AACnE,OAAI,WACA,QAAO;AACX,eAAY,QAAQ,eAAe,UAAU;;;;AAKzD,SAAS,kBAAkB,KAAK;AAC5B,QAAO,OAAO,eAAe,IAAI,KAAK,IAAI;;AAE9C,SAAS,kBAAkB,KAAK;AAC5B,QAAO,OAAO,eAAe,IAAI,KAAK,IAAI;;AAG9C,SAAS,OAAO,YAAY;CACxB,IAAI;AACJ,SAAQ,KAAK,WAAW,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,WAAW;;;;;AAK9E,SAAS,QAAQ,QAAQ;AACrB,QAAO,CAAC,CAAC,cAAc,OAAO;;AAElC,SAAS,cAAc,OAAO;AAC1B,KAAI,OAAO,UAAU,SACjB,QAAO;AACX,QAAO,UAAU,QAAQ,UAAU,KAAK,IAAI,KAAK,IAAI,MAAM;;AAE/D,SAAS,SAAS,OAAO;CACrB,IAAI;CACJ,MAAM,aAAa,cAAc,MAAM;AACvC,QAAO,cAAe,KAAK,WAAW,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,WAAW,WAAY;;;;;AAKxG,SAAS,YAAY,OAAO,SAAS;AACjC,KAAI,CAAC,SAAS,OAAO,UAAU,SAC3B,QAAO;CACX,IAAI;AACJ,QAAQ,OAAO,eAAe,MAAM,KAAK,OAAO,aAC5C,MAAM,QAAQ,MAAM,IACpB,iBAAiB,OACjB,iBAAiB,OAChB,CAAC,EAAE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,WACxD,aAAa,QAAQ,KAAK,OAAO,UAAU,MAAM,UAAU,aACzD,OAAO,eAAe;;AAEtC,SAAS,QAAQ,QAAQ,OAAO,EAAE,EAAE;AAChC,KAAI,OAAO,eAAe,KAAK,QAAQ,MAAM,EAAE;EAE3C,MAAM,aAAa,OAAO,OAAO;EACjC,MAAM,aAAa,cAAc,IAAI,YAAY,OAAO,IAAI,CAAC;AAC7D,MAAI,eAAe,SAAS,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,cAAc,OAAO,SAChH,QAAO;EAEX,MAAM,QAAQ,OAAO,OAAO,SAAS;EACrC,MAAM,MAAM,QACN,MAAM,KAAK,OAAO,OAAO,OAAO,MAAM,CAAC,CAAC,QAAQ,OAAO,IAAI,GAC3D,OAAO;AAEb,MAAI,EAAG,SAAS,WAAW,OAAO,OAAQ,IAAI,YAAY,IAAI,EAC1D,QAAO;AACX,OAAK,KAAK,IAAI;;AAElB,KAAI,OAAO,OACP,QAAO,QAAQ,OAAO,QAAQ,KAAK;AAGvC,MAAK,SAAS;AACd,KAAI;AAEA,cAAY,OAAO,MAAM,KAAK;UAE3B,GAAG;AACN,SAAO;;AAEX,QAAO;;AAEX,SAAS,QAAQ,QAAQ;AACrB,KAAI,MAAM,QAAQ,OAAO,CACrB,QAAO;AACX,KAAI,kBAAkB,IAClB,QAAO;AACX,KAAI,kBAAkB,IAClB,QAAO;AACX,QAAO;;AAEX,SAAS,IAAI,QAAQ,KAAK;AACtB,QAAO,QAAQ,OAAO,KAAK,IAAwB,OAAO,IAAI,IAAI,GAAG,OAAO;;AAEhF,SAAS,IAAI,QAAQ,KAAK,OAAO;AAE7B,KADa,QAAQ,OAAO,KACf,EACT,QAAO,IAAI,KAAK,MAAM;KAGtB,QAAO,OAAO;;AAGtB,SAAS,KAAK,QAAQ,KAAK;CACvB,MAAM,QAAQ,cAAc,OAAO;AAEnC,SADe,QAAQ,OAAO,MAAM,GAAG,QACzB;;AAElB,SAAS,QAAQ,GAAG,GAAG;AACnB,KAAI,MAAM,EACN,QAAO,MAAM,KAAK,IAAI,MAAM,IAAI;KAGhC,QAAO,MAAM,KAAK,MAAM;;AAGhC,SAAS,YAAY,YAAY;AAC7B,KAAI,CAAC,WACD;AACJ,QAAO,WAAW,WAAW,OAAO,SAAS,EAC1B,YAAW,WAAW,OAAO,KAAK,EACzC;;AAIhB,SAAS,WAAW,MAAM,aAAa;AACnC,QAAO,cACD,OACA,CAAC,GAAG,CACD,OAAO,KAAK,CACZ,KAAK,UAAU;EAChB,MAAM,OAAO,GAAG;AAChB,MAAI,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,QAAQ,IAAI,KAAK,GAClD,QAAO;AACX,SAAO,KAAK,QAAQ,MAAM,KAAK,CAAC,QAAQ,OAAO,KAAK;GACtD,CACG,KAAK,IAAI;;AAUtB,SAAS,YAAY,MAAM,MAAM;AAC7B,MAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG;EACrD,MAAM,MAAM,KAAK;AAEjB,SAAO,IAAI,QAAQ,KAAK,KAAK,IAAwB,MAAM,KAAK,KAAK,GAAG,MAAM,IAAI;AAClF,MAAI,OAAO,SAAS,SAChB,OAAM,IAAI,MAAM,4BAA4B,KAAK,KAAK,IAAI,CAAC,IAAI;;AAGvE,QAAO;;AAGX,SAAS,WAAW,QAAQ;CACxB,MAAM,OAAO,OAAO,OAAO,OAAO,eAAe,OAAO,CAAC;AACzD,SAAQ,QAAQ,OAAO,CAAC,SAAS,QAAQ;EACrC,IAAI,OAAO,QAAQ,yBAAyB,QAAQ,IAAI;AACxD,MAAI,KAAK,cAAc,KAAK,gBAAgB,KAAK,UAAU;AACvD,QAAK,OAAO,OAAO;AACnB;;AAGJ,MAAI,CAAC,KAAK,UAAU;AAChB,QAAK,WAAW;AAChB,QAAK,eAAe;;AAExB,MAAI,KAAK,OAAO,KAAK,IACjB,QAAO;GACH,cAAc;GACd,UAAU;GACV,YAAY,KAAK;GACjB,OAAO,OAAO;GACjB;AACL,UAAQ,eAAe,MAAM,KAAK,KAAK;GACzC;AACF,QAAO;;AAEX,MAAM,aAAa,OAAO,UAAU;AACpC,SAAS,YAAY,UAAU,SAAS;CACpC,IAAI;AACJ,KAAI,MAAM,QAAQ,SAAS,CACvB,QAAO,MAAM,UAAU,OAAO,KAAK,SAAS;UAEvC,oBAAoB,KAAK;AAC9B,MAAI,CAAC,kBAAkB,SAAS,EAAE;GAC9B,MAAM,WAAW,OAAO,eAAe,SAAS,CAAC;AACjD,UAAO,IAAI,SAAS,SAAS,QAAQ,CAAC;;AAE1C,SAAO,IAAI,UAAU,aACf,IAAI,UAAU,WAAW,KAAK,0BAAU,IAAI,KAAK,CAAC,GAClD,IAAI,IAAI,SAAS,QAAQ,CAAC;YAE3B,oBAAoB,KAAK;AAC9B,MAAI,CAAC,kBAAkB,SAAS,EAAE;GAC9B,MAAM,WAAW,OAAO,eAAe,SAAS,CAAC;AACjD,UAAO,IAAI,SAAS,SAAS;;AAEjC,SAAO,IAAI,IAAI,SAAS;aAElB,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,UAC9D,aAAa,QAAQ,KAAK,UAAU,UAAU,EAC5C,eAAe,KAAA,MACnB,eAAe,UAAU,SAAS;AAClC,MAAI,eAAe,UAAU,UACzB,QAAO,WAAW,SAAS;WAEtB,OAAO,eAAe,YAAY;AACvC,OAAK,QAAQ,iBAAiB,QAAQ,iBAClC,OAAM,IAAI,MAAM,0DAA0D;AAE9E,UAAO,YAAY;;AAEvB,QAAM,IAAI,MAAM,4BAA4B,aAAa;YAEpD,OAAO,aAAa,YACzB,OAAO,eAAe,SAAS,KAAK,OAAO,WAAW;EAGtD,MAAM,OAAO,EAAE;AACf,SAAO,KAAK,SAAS,CAAC,SAAS,QAAQ;AACnC,QAAK,OAAO,SAAS;IACvB;AACF,SAAO,sBAAsB,SAAS,CAAC,SAAS,QAAQ;AACpD,OAAI,WAAW,KAAK,UAAU,IAAI,CAC9B,MAAK,OAAO,SAAS;IAE3B;AACF,SAAO;OAGP,OAAM,IAAI,MAAM,+EAA+E;;AAGvG,SAAS,kBAAkB,QAAQ;AAC/B,KAAI,OAAO,KACP;AACJ,QAAO,OAAO,YAAY,OAAO,UAAU,OAAO,QAAQ;;AAE9D,SAAS,UAAU,QAAQ;AACvB,KAAI,CAAC,YAAY,OAAO,CACpB,QAAO,SAAS,OAAO;AAC3B,KAAI,MAAM,QAAQ,OAAO,CACrB,QAAO,OAAO,IAAI,UAAU;AAChC,KAAI,kBAAkB,KAAK;EACvB,MAAM,WAAW,MAAM,KAAK,OAAO,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAC1D,GACA,UAAU,EAAE,CACf,CAAC;AACF,MAAI,CAAC,kBAAkB,OAAO,EAAE;GAC5B,MAAM,WAAW,OAAO,eAAe,OAAO,CAAC;AAC/C,UAAO,IAAI,SAAS,SAAS;;AAEjC,SAAO,IAAI,IAAI,SAAS;;AAE5B,KAAI,kBAAkB,KAAK;EACvB,MAAM,WAAW,MAAM,KAAK,OAAO,CAAC,IAAI,UAAU;AAClD,MAAI,CAAC,kBAAkB,OAAO,EAAE;GAC5B,MAAM,WAAW,OAAO,eAAe,OAAO,CAAC;AAC/C,UAAO,IAAI,SAAS,SAAS;;AAEjC,SAAO,IAAI,IAAI,SAAS;;CAE5B,MAAM,OAAO,OAAO,OAAO,OAAO,eAAe,OAAO,CAAC;AACzD,MAAK,MAAM,OAAO,OACd,MAAK,OAAO,UAAU,OAAO,KAAK;AACtC,QAAO;;AAEX,SAAS,cAAc,QAAQ;AAC3B,QAAO,QAAQ,OAAO,GAAG,UAAU,OAAO,GAAG;;AAGjD,SAAS,YAAY,YAAY;CAC7B,IAAI;AACJ,YAAW,eAAe,KAAK,WAAW,iBAAiB,QAAQ,OAAO,KAAK,IAAI,qBAAK,IAAI,KAAK;AACjG,KAAI,CAAC,WAAW,UAAU;AACtB,aAAW,WAAW;AACtB,MAAI,WAAW,OACX,aAAY,WAAW,OAAO;;;AAK1C,SAAS,mBAAmB;AACxB,OAAM,IAAI,MAAM,8BAA8B;;AAElD,SAAS,WAAW,QAAQ,QAAQ,eAAe,OAAO,MAAM;CAC5D;AACI,kBAAgB,kBAAkB,QAAQ,kBAAkB,KAAK,IAAI,gCAAgB,IAAI,SAAS;AAClG,UAAQ,UAAU,QAAQ,UAAU,KAAK,IAAI,QAAQ,EAAE;AACvD,SAAO,SAAS,QAAQ,SAAS,KAAK,IAAI,OAAO,EAAE;EACnD,MAAM,QAAQ,cAAc,IAAI,OAAO,GACjC,cAAc,IAAI,OAAO,GACzB;AACN,MAAI,MAAM,SAAS,GAAG;GAClB,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAClC,OAAI,SAAS,OAAO,UAAU,YAAY,UAAU,IAAI;AACpD,QAAI,MAAM,OAAO,MACb,OAAM,IAAI,MAAM,6BAA6B;AAEjD,UAAM,IAAI,MAAM,iCAAiC,KAC5C,MAAM,GAAG,MAAM,CACf,KAAK,KAAK,UAAU;AACrB,SAAI,OAAO,QAAQ,SACf,QAAO,IAAI,IAAI,UAAU,CAAC;KAC9B,MAAM,SAAS,MAAM;AACrB,SAAI,OAAO,QAAQ,aACd,kBAAkB,OAAO,kBAAkB,KAC5C,QAAO,MAAM,KAAK,OAAO,MAAM,CAAC,CAAC,QAAQ,IAAI;AACjD,YAAO;MACT,CACG,KAAK,IAAI,GAAG;;AAErB,SAAM,KAAK,MAAM;AACjB,QAAK,KAAK,OAAO;QAGjB,OAAM,KAAK,MAAM;;AAGzB,KAAI,OAAO,SAAS,OAAO,IAAI,QAAQ,OAAO,EAAE;AAExC,QAAM,KAAK;AACX,OAAK,KAAK;AAEd;;AAGJ,SADa,QAAQ,OAAO,EAC5B;EACI,KAAK;AACD,QAAK,MAAM,CAAC,KAAK,UAAU,QAAQ;AAC/B,eAAW,KAAK,KAAK,eAAe,OAAO,KAAK;AAChD,eAAW,OAAO,KAAK,eAAe,OAAO,KAAK;;AAEtD,UAAO,MAAM,OAAO,QAAQ,OAAO,SAAS;AAC5C;EACJ,KAAK;AACD,QAAK,MAAM,SAAS,OAChB,YAAW,OAAO,OAAO,eAAe,OAAO,KAAK;AAExD,UAAO,MAAM,OAAO,QAAQ,OAAO,SAAS;AAC5C;EACJ,KAAK;AACD,UAAO,OAAO,OAAO;GACrB,IAAI,QAAQ;AACZ,QAAK,MAAM,SAAS,QAAQ;AACxB,eAAW,OAAO,OAAO,eAAe,OAAO,KAAK;AACpD,aAAS;;AAEb;EACJ;AACI,UAAO,OAAO,OAAO;AAErB,UAAO,KAAK,OAAO,CAAC,SAAS,SAAS;IAClC,MAAM,QAAQ,OAAO;AACrB,eAAW,OAAO,MAAM,eAAe,OAAO,KAAK;KACrD;;AAGN,OAAM,KAAK;AACX,MAAK,KAAK;;AAIlB,SAAS,QAAQ,QAAQ,MAAM;CAC3B,MAAM,OAAO,QAAQ,OAAO;AAC5B,KAAI,SAAS,EACT,SAAQ,QAAQ,OAAO,CAAC,SAAS,QAAQ;AACrC,OAAK,KAAK,OAAO,MAAM,OAAO;GAChC;UAEG,SAAS,GAAyB;EACvC,IAAI,QAAQ;AACZ,OAAK,MAAM,SAAS,QAAQ;AACxB,QAAK,OAAO,OAAO,OAAO;AAC1B,YAAS;;OAIb,QAAO,SAAS,OAAO,UAAU,KAAK,OAAO,OAAO,OAAO,CAAC;;AAIpE,SAAS,YAAY,QAAQ,YAAY,SAAS;AAC9C,KAAI,QAAQ,OAAO,IACf,CAAC,YAAY,QAAQ,QAAQ,IAC7B,WAAW,IAAI,OAAO,IACtB,OAAO,SAAS,OAAO,CACvB;CACJ,MAAM,QAAQ,kBAAkB;CAChC,MAAM,SAAS,wBAAQ,IAAI,KAAK,GAAG,KAAA;AACnC,YAAW,IAAI,OAAO;AACtB,SAAQ,SAAS,KAAK,UAAU;EAC5B,IAAI;AACJ,MAAI,QAAQ,MAAM,EAAE;GAChB,MAAM,aAAa,cAAc,MAAM;AACvC,qBAAkB,WAAW;GAE7B,MAAM,iBAAiB,KAAK,WAAW,iBAAiB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,SAAS,WAAW,WAC1G,WAAW,OACX,WAAW;AAEjB,OAAI,QAAQ,SAAS,QAAQ,KAAK,aAAa;QAG/C,aAAY,OAAO,YAAY,QAAQ;GAE7C;AACF,KAAI,QAAQ;EACR,MAAM,MAAM;EACZ,MAAM,SAAS,MAAM,KAAK,IAAI;AAC9B,MAAI,OAAO;AACX,SAAO,SAAS,UAAU;AACtB,OAAI,IAAI,OAAO,IAAI,MAAM,GAAG,OAAO,IAAI,MAAM,GAAG,MAAM;IACxD;;;AAGV,SAAS,iBAAiB,YAAY,KAAK;CAEvC,MAAM,OAAO,WAAW,SAAS,IAAwB,WAAW,SAAS,WAAW;AACxF,KAAI,WAAW,WAAW,OAAO,SAAS,KACtC,WAAW,YAAY,IAAI,IAAI,IAC/B,KACA,aAAY,IAAI,MAAM,IAAI,EAAE,WAAW,WAAW,YAAY,WAAW,QAAQ;;AAGzF,SAAS,iBAAiB,QAAQ;AAC9B,KAAI,OAAO,SAAS,KAAyB,OAAO,MAAM;AACtD,SAAO,KAAK,OAAO;AACnB,SAAO,OAAO,SAAS,UAAU;AAC7B,UAAO,KAAK,IAAI,SAAS,MAAM,CAAC;IAClC;;;AAGV,SAAS,gBAAgB,QAAQ,iBAAiB,SAAS,gBAAgB;AAKvE,KAJuB,OAAO,YAC1B,OAAO,eACP,OAAO,YAAY,OAAO,KAC1B,CAAC,OAAO,WACQ;AAChB,MAAI,WAAW,gBAAgB;GAC3B,MAAM,WAAW,QAAQ,OAAO;AAChC,OAAI,SACA,iBAAgB,QAAQ,UAAU,SAAS,eAAe;;AAGlE,SAAO,YAAY;;;AAG3B,SAAS,iBAAiB,QAAQ,KAAK,OAAO,iBAAiB;CAC3D,MAAM,aAAa,cAAc,MAAM;AACvC,KAAI,YAAY;AAEZ,MAAI,CAAC,WAAW,UACZ,YAAW,YAAY,EAAE;AAE7B,aAAW,UAAU,MAAM,SAAS,mBAAmB;GACnD,IAAI;GACJ,MAAM,OAAO,OAAO,SAAS,IAAwB,OAAO,SAAS,OAAO;AAC5E,OAAI,QAAQ,IAAI,MAAM,IAAI,EAAE,MAAM,EAAE;IAChC,IAAI,eAAe,WAAW;AAC9B,QAAI,WAAW,KACX,gBAAe,WAAW;AAE9B,qBAAiB,OAAO;AACxB,oBAAgB,QAAQ,iBAAiB,SAAS,eAAe;AACjE,QAAI,OAAO,QAAQ,kBAAkB;AACjC,YAAO,QAAQ,iBACV,KAAK,OAAO,QAAQ,mBAAmB,QAAQ,OAAO,KAAK,IAAI,qBAAK,IAAI,SAAS;AACtF,YAAO,QAAQ,cAAc,IAAI,cAAc,WAAW,SAAS;;AAGvE,QAAI,MAAM,KAAK,aAAa;;IAElC;AACF,MAAI,OAAO,QAAQ;OAEX,WAAW,eAAe,OAAO,WACjC,QAAO,QAAQ,mBAAmB;;;AAI9C,KAAI,YAAY,OAAO,OAAO,QAAQ,CAElC,QAAO,WAAW,MAAM,WAAW;AAE/B,MAAI,QAAQ,IADC,OAAO,SAAS,IAAwB,OAAO,SAAS,OAAO,MACtD,IAAI,EAAE,MAAM,CAC9B,kBAAiB,QAAQ,IAAI;GAEnC;;AAIV,SAAS,qBAAqB,YAAY,UAAU,SAAS,gBAAgB,aAAa;CACtF,IAAI,EAAE,UAAU,aAAa,YAAY;CACzC,IAAI,OAAO,WAAW;AACtB,KAAI,KAAK,SAAS,SAAS,QAAQ;AAC/B,GAAC,UAAU,QAAQ,CAAC,MAAM,SAAS;AACnC,GAAC,SAAS,kBAAkB,CAAC,gBAAgB,QAAQ;;AAEzD,MAAK,IAAI,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,EAClD,KAAI,YAAY,IAAI,MAAM,UAAU,CAAC,IAAI,KAAK,WAAW,SAAS,QAAQ;EAEtE,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,MAAM,CAAC,EACP,YAAY;AAC3C,UAAQ,KAAK;GACT,IAAI,UAAU;GACd;GAEA,OAAO,cAAc,KAAK,OAAO;GACpC,CAAC;AACF,iBAAe,KAAK;GAChB,IAAI,UAAU;GACd;GAEA,OAAO,cAAc,SAAS,OAAO;GACxC,CAAC;;AAGV,MAAK,IAAI,QAAQ,SAAS,QAAQ,QAAQ,KAAK,QAAQ,SAAS,GAAG;EAE/D,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,MAAM,CAAC,EACP,YAAY;AAC3C,UAAQ,KAAK;GACT,IAAI,UAAU;GACd;GAEA,OAAO,cAAc,KAAK,OAAO;GACpC,CAAC;;AAEN,KAAI,SAAS,SAAS,KAAK,QAAQ;EAI/B,MAAM,EAAE,wBAAwB,SAAS,QAAQ;AACjD,MAAI,uBAAuB;GAEvB,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,SAAS,CAAC,EACV,YAAY;AAC3C,kBAAe,KAAK;IAChB,IAAI,UAAU;IACd;IACA,OAAO,SAAS;IACnB,CAAC;QAGF,MAAK,IAAI,QAAQ,KAAK,QAAQ,SAAS,SAAS,OAAO,SAAS,GAAG;GAE/D,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,QAAQ,EAAE,CAAC,EACX,YAAY;AAC3C,kBAAe,KAAK;IAChB,IAAI,UAAU;IACd;IACH,CAAC;;;;AAKlB,SAAS,4BAA4B,EAAE,UAAU,MAAM,eAAe,UAAU,SAAS,gBAAgB,aAAa;AAClH,aAAY,SAAS,eAAe,QAAQ;EACxC,MAAM,gBAAgB,IAAI,UAAU,IAAI;EACxC,MAAM,QAAQ,cAAc,IAAI,MAAM,IAAI,CAAC;EAC3C,MAAM,KAAK,CAAC,gBACN,UAAU,SACV,IAAI,UAAU,IAAI,GACd,UAAU,UACV,UAAU;AACpB,MAAI,QAAQ,eAAe,MAAM,IAAI,OAAO,UAAU,QAClD;EAEJ,MAAM,OAAO,WADC,SAAS,OAAO,IAAI,EACH,YAAY;AAC3C,UAAQ,KAAK,OAAO,UAAU,SAAS;GAAE;GAAI;GAAM,GAAG;GAAE;GAAI;GAAM;GAAO,CAAC;AAC1E,iBAAe,KAAK,OAAO,UAAU,MAC/B;GAAE,IAAI,UAAU;GAAQ;GAAM,GAC9B,OAAO,UAAU,SACb;GAAE,IAAI,UAAU;GAAK;GAAM,OAAO;GAAe,GACjD;GAAE,IAAI,UAAU;GAAS;GAAM,OAAO;GAAe,CAAC;GAClE;;AAEN,SAAS,mBAAmB,EAAE,UAAU,QAAQ,UAAU,SAAS,gBAAgB,aAAa;CAC5F,IAAI,QAAQ;AACZ,UAAS,SAAS,UAAU;AACxB,MAAI,CAAC,KAAK,IAAI,MAAM,EAAE;GAElB,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,MAAM,CAAC,EACP,YAAY;AAC3C,WAAQ,KAAK;IACT,IAAI,UAAU;IACd;IACA;IACH,CAAC;AACF,kBAAe,QAAQ;IACnB,IAAI,UAAU;IACd;IACA;IACH,CAAC;;AAEN,WAAS;GACX;AACF,SAAQ;AACR,MAAK,SAAS,UAAU;AACpB,MAAI,CAAC,SAAS,IAAI,MAAM,EAAE;GAEtB,MAAM,OAAO,WADC,SAAS,OAAO,CAAC,MAAM,CAAC,EACP,YAAY;AAC3C,WAAQ,KAAK;IACT,IAAI,UAAU;IACd;IACA;IACH,CAAC;AACF,kBAAe,QAAQ;IACnB,IAAI,UAAU;IACd;IACA;IACH,CAAC;;AAEN,WAAS;GACX;;AAEN,SAAS,gBAAgB,YAAY,UAAU,SAAS,gBAAgB;CACpE,MAAM,EAAE,cAAc,SAAS,WAAW,QAAQ;AAClD,SAAQ,WAAW,MAAnB;EACI,KAAK;EACL,KAAK,EACD,QAAO,4BAA4B,YAAY,UAAU,SAAS,gBAAgB,YAAY;EAClG,KAAK,EACD,QAAO,qBAAqB,YAAY,UAAU,SAAS,gBAAgB,YAAY;EAC3F,KAAK,EACD,QAAO,mBAAmB,YAAY,UAAU,SAAS,gBAAgB,YAAY;;;AAIjG,IAAI,WAAW;AACf,MAAM,iBAAiB,OAAO,SAAS,uBAAuB,UAAU;AACpE,KAAI,OAAO,UAAU,YACjB,UAAU,SACT,CAAC,YAAY,OAAO,QAAQ,IAAI,yBACjC,CAAC,SACD,OAAM,IAAI,MAAM,6FAA6F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCrH,SAAS,OAAO,UAAU;AACtB,YAAW;CACX,IAAI;AACJ,KAAI;AACA,WAAS,UAAU;WAEf;AACJ,aAAW;;AAEf,QAAO;;AAGX,MAAM,aAAa;CACf,IAAI,OAAO;AAEP,SADgB,OAAO,cAAc,KAAK,CAAC,CAC5B;;CAEnB,IAAI,KAAK;AACL,SAAO,OAAO,cAAc,KAAK,CAAC,CAAC,IAAI,IAAI;;CAE/C,IAAI,KAAK,OAAO;EACZ,MAAM,SAAS,cAAc,KAAK;EAClC,MAAM,SAAS,OAAO,OAAO;AAC7B,MAAI,CAAC,OAAO,IAAI,IAAI,IAAI,CAAC,QAAQ,OAAO,IAAI,IAAI,EAAE,MAAM,EAAE;AACtD,qBAAkB,OAAO;AACzB,eAAY,OAAO;AACnB,UAAO,YAAY,IAAI,KAAK,KAAK;AACjC,UAAO,KAAK,IAAI,KAAK,MAAM;AAC3B,oBAAiB,QAAQ,KAAK,OAAO,gBAAgB;;AAEzD,SAAO;;CAEX,OAAO,KAAK;AACR,MAAI,CAAC,KAAK,IAAI,IAAI,CACd,QAAO;EAEX,MAAM,SAAS,cAAc,KAAK;AAClC,oBAAkB,OAAO;AACzB,cAAY,OAAO;AACnB,MAAI,OAAO,SAAS,IAAI,IAAI,CACxB,QAAO,YAAY,IAAI,KAAK,MAAM;MAGlC,QAAO,YAAY,OAAO,IAAI;AAElC,SAAO,KAAK,OAAO,IAAI;AACvB,SAAO;;CAEX,QAAQ;EACJ,MAAM,SAAS,cAAc,KAAK;AAClC,MAAI,CAAC,KAAK,KACN;AACJ,oBAAkB,OAAO;AACzB,cAAY,OAAO;AACnB,SAAO,8BAAc,IAAI,KAAK;AAC9B,OAAK,MAAM,CAAC,QAAQ,OAAO,SACvB,QAAO,YAAY,IAAI,KAAK,MAAM;AAEtC,SAAO,KAAK,OAAO;;CAEvB,QAAQ,UAAU,SAAS;AAEvB,SADe,cAAc,KAAK,CACpB,CAAC,SAAS,QAAQ,SAAS;AACrC,YAAS,KAAK,SAAS,KAAK,IAAI,KAAK,EAAE,MAAM,KAAK;IACpD;;CAEN,IAAI,KAAK;EACL,IAAI,IAAI;EACR,MAAM,SAAS,cAAc,KAAK;EAClC,MAAM,QAAQ,OAAO,OAAO,CAAC,IAAI,IAAI;EACrC,MAAM,YAAY,MAAM,KAAK,OAAO,SAAS,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,UAAU,MAAM,UAAU;AACrI,MAAI,OAAO,QAAQ,OACf,eAAc,OAAO,OAAO,SAAS,QAAQ;AAEjD,MAAI,QACA,QAAO;AAEX,MAAI,OAAO,aAAa,CAAC,YAAY,OAAO,OAAO,QAAQ,CACvD,QAAO;AAGX,MAAI,UAAU,OAAO,SAAS,IAAI,IAAI,CAClC,QAAO;EAEX,MAAM,QAAQ,SAAS,YAAY;GAC/B,UAAU;GACV,aAAa;GACb;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;GACnB,CAAC;AACF,oBAAkB,OAAO;AACzB,SAAO,KAAK,IAAI,KAAK,MAAM;AAC3B,SAAO;;CAEX,OAAO;AACH,SAAO,OAAO,cAAc,KAAK,CAAC,CAAC,MAAM;;CAE7C,SAAS;EACL,MAAM,WAAW,KAAK,MAAM;AAC5B,SAAO;IACF,uBAAuB,KAAK,QAAQ;GACrC,YAAY;IACR,MAAM,SAAS,SAAS,MAAM;AAC9B,QAAI,OAAO,KACP,QAAO;AAEX,WAAO;KACH,MAAM;KACN,OAHU,KAAK,IAAI,OAAO,MAAM;KAInC;;GAER;;CAEL,UAAU;EACN,MAAM,WAAW,KAAK,MAAM;AAC5B,SAAO;IACF,uBAAuB,KAAK,SAAS;GACtC,YAAY;IACR,MAAM,SAAS,SAAS,MAAM;AAC9B,QAAI,OAAO,KACP,QAAO;IACX,MAAM,QAAQ,KAAK,IAAI,OAAO,MAAM;AACpC,WAAO;KACH,MAAM;KACN,OAAO,CAAC,OAAO,OAAO,MAAM;KAC/B;;GAER;;CAEL,CAAC,kBAAkB;AACf,SAAO,KAAK,SAAS;;CAE5B;AACD,MAAM,iBAAiB,QAAQ,QAAQ,WAAW;AAElD,MAAM,mBAAmB,QAAQ,UAAU,EAAE,6BAA6B;CACtE,IAAI,IAAI;CACR,MAAM,SAAS,SAAS,MAAM;AAC9B,KAAI,OAAO,KACP,QAAO;CACX,MAAM,MAAM,OAAO;CACnB,IAAI,QAAQ,OAAO,OAAO,IAAI,IAAI;CAClC,MAAM,eAAe,cAAc,MAAM;CACzC,MAAM,YAAY,MAAM,KAAK,OAAO,SAAS,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,UAAU,MAAM,UAAU;AACrI,KAAI,OAAO,QAAQ,OACf,eAAc,KAAK,OAAO,SAAS,QAAQ;AAE/C,KAAI,CAAC,WACD,CAAC,gBACD,YAAY,KAAK,OAAO,QAAQ,IAChC,CAAC,OAAO,aACR,OAAO,SAAS,IAAI,IAAI,EAAE;EAE1B,MAAM,QAAQ,SAAS,YAAY;GAC/B,UAAU;GACV,aAAa;GACb;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;GACnB,CAAC;AACF,SAAO,OAAO,IAAI,KAAK,MAAM;AAC7B,UAAQ;YAEH,aAEL,SAAQ,aAAa;AAEzB,QAAO;EACH,MAAM;EACN,OAAO,mBAAmB,QAAQ,CAAC,OAAO,MAAM;EACnD;;AAEL,MAAM,aAAa;CACf,IAAI,OAAO;AAEP,SADe,cAAc,KAAK,CACpB,OAAO;;CAEzB,IAAI,OAAO;EACP,MAAM,SAAS,cAAc,KAAK;AAElC,MAAI,OAAO,OAAO,IAAI,MAAM,CACxB,QAAO;AACX,oBAAkB,OAAO;EACzB,MAAM,kBAAkB,cAAc,MAAM;AAE5C,MAAI,mBAAmB,OAAO,OAAO,IAAI,gBAAgB,SAAS,CAC9D,QAAO;AACX,SAAO;;CAEX,IAAI,OAAO;EACP,MAAM,SAAS,cAAc,KAAK;AAClC,MAAI,CAAC,KAAK,IAAI,MAAM,EAAE;AAClB,qBAAkB,OAAO;AACzB,eAAY,OAAO;AACnB,UAAO,YAAY,IAAI,OAAO,KAAK;AACnC,UAAO,OAAO,IAAI,OAAO,MAAM;AAC/B,oBAAiB,QAAQ,OAAO,OAAO,gBAAgB;;AAE3D,SAAO;;CAEX,OAAO,OAAO;AACV,MAAI,CAAC,KAAK,IAAI,MAAM,CAChB,QAAO;EAEX,MAAM,SAAS,cAAc,KAAK;AAClC,oBAAkB,OAAO;AACzB,cAAY,OAAO;EACnB,MAAM,kBAAkB,cAAc,MAAM;AAC5C,MAAI,mBAAmB,OAAO,OAAO,IAAI,gBAAgB,SAAS,EAAE;AAEhE,UAAO,YAAY,IAAI,gBAAgB,UAAU,MAAM;AACvD,UAAO,OAAO,OAAO,OAAO,gBAAgB,SAAS;;AAEzD,MAAI,CAAC,mBAAmB,OAAO,OAAO,IAAI,MAAM,CAE5C,QAAO,YAAY,IAAI,OAAO,MAAM;MAIpC,QAAO,YAAY,OAAO,MAAM;AAGpC,SAAO,OAAO,OAAO,OAAO,MAAM;;CAEtC,QAAQ;AACJ,MAAI,CAAC,KAAK,KACN;EACJ,MAAM,SAAS,cAAc,KAAK;AAClC,oBAAkB,OAAO;AACzB,cAAY,OAAO;AACnB,OAAK,MAAM,SAAS,OAAO,SACvB,QAAO,YAAY,IAAI,OAAO,MAAM;AAExC,SAAO,OAAO,OAAO;;CAEzB,SAAS;EACL,MAAM,SAAS,cAAc,KAAK;AAClC,oBAAkB,OAAO;EACzB,MAAM,WAAW,OAAO,OAAO,MAAM;AACrC,SAAO;IACF,OAAO,iBAAiB,KAAK,QAAQ;GACtC,MAAM,gBAAgB,QAAQ,UAAU,EAAE,kBAAkB,MAAM,CAAC;GACtE;;CAEL,UAAU;EACN,MAAM,SAAS,cAAc,KAAK;AAClC,oBAAkB,OAAO;EACzB,MAAM,WAAW,OAAO,OAAO,MAAM;AACrC,SAAO;IACF,OAAO,iBAAiB,KAAK,SAAS;GACvC,MAAM,gBAAgB,QAAQ,UAAU,EACpC,kBAAkB,OACrB,CAAC;GACL;;CAEL,OAAO;AACH,SAAO,KAAK,QAAQ;;CAExB,CAAC,kBAAkB;AACf,SAAO,KAAK,QAAQ;;CAExB,QAAQ,UAAU,SAAS;EACvB,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,SAAS,SAAS,MAAM;AAC5B,SAAO,CAAC,OAAO,MAAM;AACjB,YAAS,KAAK,SAAS,OAAO,OAAO,OAAO,OAAO,KAAK;AACxD,YAAS,SAAS,MAAM;;;CAGnC;AACD,IAAI,IAAI,UAAU,WAKd,QAAO,OAAO,YAAY;CACtB,aAAa,OAAO;AAChB,SAAO,IAAI,UAAU,aAAa,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAEzE,MAAM,OAAO;AACT,SAAO,IAAI,UAAU,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAElE,WAAW,OAAO;AACd,SAAO,IAAI,UAAU,WAAW,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAEvE,oBAAoB,OAAO;AACvB,SAAO,IAAI,UAAU,oBAAoB,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAEhF,WAAW,OAAO;AACd,SAAO,IAAI,UAAU,WAAW,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAEvE,aAAa,OAAO;AAChB,SAAO,IAAI,UAAU,aAAa,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAEzE,eAAe,OAAO;AAClB,SAAO,IAAI,UAAU,eAAe,KAAK,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,MAAM;;CAE9E,CAAC;AAEN,MAAM,iBAAiB,QAAQ,QAAQ,WAAW;AAElD,MAAM,eAAe;CACjB,IAAI,QAAQ,KAAK,UAAU;EACvB,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,OAAO,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;AAExE,MAAI,QAAQ,OAAO,WAAW,YAAY,IAAI,KAAK,CAC/C,QAAO;AAEX,MAAI,QAAQ,YACR,QAAO;EACX,IAAI;AACJ,MAAI,OAAO,QAAQ,MAAM;GAGrB,MAAM,QAAQ,QAAQ,WACjB,OAAO,oBAAoB,OAAO,OAAO,oBAAoB,OAC5D,QAAQ,IAAI,OAAO,UAAU,IAAI,GACjC,QAAQ,IAAI,OAAO,UAAU,KAAK,SAAS;AACjD,gBAAa,OAAO,QAAQ,KAAK,OAAO,UAAU;AAClD,OAAI,eAAe,UAAU,SAAS;AAClC,QAAI,OAAO,QAAQ,OACf,eAAc,OAAO,OAAO,SAAS,KAAK;AAE9C,WAAO;;;EAGf,MAAM,SAAS,OAAO,OAAO;AAC7B,MAAI,kBAAkB,OAAO,eAAe,SAAS,IAAI,EAAE;AACvD,OAAI,QAAQ,OACR,QAAO,OAAO,yBAAyB,YAAY,OAAO,CAAC,IAAI,KAAK,OAAO,MAAM;AAGrF,UADe,WAAW,KACZ,KAAK,OAAO,MAAM;;AAEpC,MAAI,kBAAkB,OAAO,eAAe,SAAS,IAAI,EAAE;AACvD,OAAI,QAAQ,OACR,QAAO,OAAO,yBAAyB,YAAY,OAAO,CAAC,IAAI,KAAK,OAAO,MAAM;AAGrF,UADe,WAAW,KACZ,KAAK,OAAO,MAAM;;AAEpC,MAAI,CAAC,IAAI,QAAQ,IAAI,EAAE;GACnB,MAAM,OAAO,cAAc,QAAQ,IAAI;AACvC,UAAO,OACD,WAAW,OACP,KAAK,SAEF,KAAK,KAAK,SAAS,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,MAAM,GAChF,KAAA;;EAEV,MAAM,QAAQ,OAAO;AACrB,MAAI,OAAO,QAAQ,OACf,eAAc,OAAO,OAAO,QAAQ;AAExC,MAAI,OAAO,aAAa,CAAC,YAAY,OAAO,OAAO,QAAQ,CACvD,QAAO;AAGX,MAAI,UAAU,KAAK,OAAO,UAAU,IAAI,EAAE;AACtC,qBAAkB,OAAO;AACzB,UAAO,KAAK,OAAO,YAAY;IAC3B,UAAU,OAAO,SAAS;IAC1B,aAAa;IACb,KAAK,OAAO,SAAS,IAA0B,OAAO,IAAI,GAAG;IAC7D,YAAY,OAAO;IACnB,SAAS,OAAO;IACnB,CAAC;AAEF,OAAI,OAAO,eAAe,YAAY;IAClC,MAAM,gBAAgB,cAAc,OAAO,KAAK,KAAK;AACrD,sBAAkB,cAAc;AAEhC,gBAAY,cAAc;AAC1B,WAAO,cAAc;;AAEzB,UAAO,OAAO,KAAK;;AAEvB,MAAI,QAAQ,MAAM,CACd,QAAO,WAAW,YAAY,IAAI,MAAM;AAE5C,SAAO;;CAEX,IAAI,QAAQ,KAAK,OAAO;EACpB,IAAI;AACJ,MAAI,OAAO,SAAS,KAAyB,OAAO,SAAS,EACzD,OAAM,IAAI,MAAM,0DAA0D;EAE9E,IAAI;AACJ,MAAI,OAAO,SAAS,KAChB,QAAQ,YACR,EAAE,OAAO,UAAW,OAAO,OAAO,IAAI,CAAE,IACpC,QAAQ,MACP,QAAQ,KAAK,SAAS,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI,GAC5D,OAAM,IAAI,MAAM,iEAAiE;EAErF,MAAM,OAAO,cAAc,OAAO,OAAO,EAAE,IAAI;AAC/C,MAAI,SAAS,QAAQ,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK;AAEtD,QAAK,IAAI,KAAK,OAAO,OAAO,MAAM;AAClC,UAAO;;EAEX,MAAM,UAAU,KAAK,OAAO,OAAO,EAAE,IAAI;EACzC,MAAM,oBAAoB,cAAc,QAAQ;AAChD,MAAI,qBAAqB,QAAQ,kBAAkB,UAAU,MAAM,EAAE;AAEjE,UAAO,KAAK,OAAO;AACnB,UAAO,eAAe,KAAK,OAAO,iBAAiB,QAAQ,OAAO,KAAK,IAAI,qBAAK,IAAI,KAAK;AACzF,UAAO,YAAY,IAAI,KAAK,MAAM;AAClC,UAAO;;AAGX,MAAI,QAAQ,OAAO,QAAQ,KACtB,UAAU,KAAA,KAAa,IAAI,OAAO,UAAU,IAAI,EACjD,QAAO;AACX,oBAAkB,OAAO;AACzB,cAAY,OAAO;AACnB,MAAI,IAAI,OAAO,UAAU,IAAI,IAAI,QAAQ,OAAO,OAAO,SAAS,KAAK,CAEjE,QAAO,YAAY,OAAO,IAAI;MAG9B,QAAO,YAAY,IAAI,KAAK,KAAK;AAErC,SAAO,KAAK,OAAO;AACnB,mBAAiB,QAAQ,KAAK,OAAO,gBAAgB;AACrD,SAAO;;CAEX,IAAI,QAAQ,KAAK;AACb,SAAO,OAAO,OAAO,OAAO;;CAEhC,QAAQ,QAAQ;AACZ,SAAO,QAAQ,QAAQ,OAAO,OAAO,CAAC;;CAE1C,yBAAyB,QAAQ,KAAK;EAClC,MAAM,SAAS,OAAO,OAAO;EAC7B,MAAM,aAAa,QAAQ,yBAAyB,QAAQ,IAAI;AAChE,MAAI,CAAC,WACD,QAAO;AACX,SAAO;GACH,UAAU;GACV,cAAc,OAAO,SAAS,KAA2B,QAAQ;GACjE,YAAY,WAAW;GACvB,OAAO,OAAO;GACjB;;CAEL,eAAe,QAAQ;AACnB,SAAO,QAAQ,eAAe,OAAO,SAAS;;CAElD,iBAAiB;AACb,QAAM,IAAI,MAAM,2CAA2C;;CAE/D,iBAAiB;AACb,QAAM,IAAI,MAAM,2CAA2C;;CAE/D,eAAe,QAAQ,KAAK;EACxB,IAAI;AACJ,MAAI,OAAO,SAAS,EAChB,QAAO,aAAa,IAAI,KAAK,MAAM,QAAQ,KAAK,KAAA,GAAW,OAAO,MAAM;AAE5E,MAAI,KAAK,OAAO,UAAU,IAAI,KAAK,KAAA,KAAa,OAAO,OAAO,UAAU;AAEpE,qBAAkB,OAAO;AACzB,eAAY,OAAO;AACnB,UAAO,YAAY,IAAI,KAAK,MAAM;SAEjC;AACD,UAAO,eAAe,KAAK,OAAO,iBAAiB,QAAQ,OAAO,KAAK,IAAI,qBAAK,IAAI,KAAK;AAEzF,UAAO,YAAY,OAAO,IAAI;;AAElC,MAAI,OAAO,KACP,QAAO,OAAO,KAAK;AACvB,SAAO;;CAEd;AACD,SAAS,YAAY,oBAAoB;CACrC,MAAM,EAAE,UAAU,aAAa,KAAK,YAAY,YAAY;CAC5D,MAAM,OAAO,QAAQ,SAAS;CAC9B,MAAM,aAAa;EACf;EACA,WAAW;EACX,QAAQ;EACR;EACA,MAAM;EACN,OAAO;EACP;EACA;EAEA,QAAQ,SAAS,IACX,IAAI,IAAI,SAAS,SAAS,CAAC,GAC3B,KAAA;EACT;AAED,KAAI,OAAO,SAAS,mBAChB,YAAW,MAAM;CAErB,MAAM,EAAE,OAAO,WAAW,MAAM,UAAU,SAAS,IAA0B,OAAO,OAAO,EAAE,EAAE,WAAW,GAAG,YAAY,aAAa;AACtI,YAAW,OAAO,KAAK,OAAO;AAC9B,YAAW,QAAQ;AACnB,KAAI,aAAa;EACb,MAAM,SAAS;AACf,SAAO,WAAW,MAAM,MAAM,SAAS,mBAAmB;GACtD,IAAI,IAAI;GACR,MAAM,gBAAgB,cAAc,MAAM;GAE1C,IAAI,OAAO,OAAO,SAAS,IAAwB,OAAO,SAAS,OAAO;GAC1E,MAAM,QAAQ,IAAI,MAAM,IAAI;GAC5B,MAAM,aAAa,cAAc,MAAM;AACvC,OAAI,YAAY;IAEZ,IAAI,eAAe,WAAW;AAC9B,QAAI,WAAW,SACX,gBAAe,SAAS,MAAM;AAElC,qBAAiB,WAAW;AAC5B,oBAAgB,YAAY,iBAAiB,SAAS,eAAe;AACrE,QAAI,OAAO,QAAQ,kBAAkB;AACjC,YAAO,QAAQ,iBACV,KAAK,OAAO,QAAQ,mBAAmB,QAAQ,OAAO,KAAK,IAAI,qBAAK,IAAI,SAAS;AACtF,YAAO,QAAQ,cAAc,IAAI,cAAc,WAAW,SAAS;;AAGvE,QAAI,MAAM,KAAK,aAAa;;AAGhC,IAAC,KAAK,cAAc,eAAe,QAAQ,OAAO,KAAK,KAAa,GAAG,SAAS,aAAa;AACzF,aAAS,SAAS,eAAe;KACnC;IACJ;QAED;EAED,MAAM,SAAS,cAAc,MAAM;AACnC,SAAO,WAAW,MAAM,MAAM,SAAS,mBAAmB;AACtD,oBAAiB,OAAO;AACxB,mBAAgB,QAAQ,iBAAiB,SAAS,eAAe;IACnE;;AAEN,QAAO;;AAEX,SAAS,cAAc;AACvB,SAAS,cAAc,QAAQ,eAAe,SAAS,gBAAgB,kBAAkB;CACrF,IAAI;CACJ,MAAM,aAAa,cAAc,OAAO;CACxC,MAAM,YAAY,KAAK,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK;CACrI,MAAM,mBAAmB,CAAC,CAAC,cAAc;AACzC,KAAI,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,SACnE,QAAO,WAAW,WAAW,MAAM,SAAS,EACvB,YAAW,WAAW,MAAM,KAAK,CACzC,SAAS,eAAe;CAGzC,MAAM,QAAQ,mBACR,cAAc,KACd,aACI,WAAW,WACP,WAAW,OACX,WAAW,WACf;AACV,KAAI,WACA,aAAY,WAAW;AAC3B,KAAI,iBACA,YAAW,OAAO,OAAO,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,QAAQ,cAAc;AAEtH,QAAO;EACH;EACA,WAAW,mBACL,CAAC;GAAE,IAAI,UAAU;GAAS,MAAM,EAAE;GAAE,OAAO,cAAc;GAAI,CAAC,GAC9D;EACN,kBAAkB,mBACZ,CAAC;GAAE,IAAI,UAAU;GAAS,MAAM,EAAE;GAAE,OAAO;GAAU,CAAC,GACtD;EACT;;AAGL,SAAS,SAAS,WAAW,SAAS;CAClC,IAAI;CACJ,MAAM,aAAa;EACf,OAAO,EAAE;EACT,QAAQ,EAAE;EACV,4BAAY,IAAI,SAAS;EACzB,6BAAa,IAAI,SAAS;EAC7B;CACD,IAAI;CACJ,IAAI;AACJ,KAAI,QAAQ,eAAe;AACvB,YAAU,EAAE;AACZ,mBAAiB,EAAE;;CAIvB,MAAM,UAFc,KAAK,QAAQ,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,SAAS,WAAW,UAAU,MAAM,UAAU,WAC9H,CAAC,YAAY,WAAW,QAAQ,GAE9B,YACA,YAAY;EACV,UAAU;EACV,aAAa;EACb;EACA;EACH,CAAC;AACN,QAAO,CACH,QACC,gBAAgB,EAAE,KAAK;EACpB,MAAM,CAAC,gBAAgB,kBAAkB,2BAA2B,cAAc,OAAO,eAAe,SAAS,gBAAgB,QAAQ,iBAAiB;AAC1J,SAAQ,QAAQ,gBACV;GAAC;GAAgB;GAAkB;GAAwB,GAC3D;GAEb;;AAGL,SAAS,kBAAkB,SAAS;CAChC,MAAM,EAAE,WAAW,OAAO,eAAe,OAAO,SAAS,SAAS;AAClE,SAAQ,QAAQ,KAAK,MAAM,WAAW;EAClC,MAAM,aAAa,cAAc,KAAK;AAEtC,MAAI,cACA,aACA,WAAW,eAAe,UAAU,YAAY;AAChD,WAAQ,iBAAiB;GACzB,MAAM,eAAe,WAAW;AAEhC,OAAI,kBAAkB,KAAK;IACvB,MAAM,MAAM,MAAM,KAAK,OAAO;AAC9B,WAAO,OAAO;AACd,QAAI,SAAS,UAAU,OAAO,IAAI,QAAQ,QAAQ,eAAe,MAAM,CAAC;SAGxE,KAAI,QAAQ,KAAK,aAAa;aAG7B,OAAO,SAAS,YAAY,SAAS,MAAM;AAChD,WAAQ,QAAQ;AAChB,WAAQ,SAAS;AACjB,qBAAkB,QAAQ;;GAEhC;AACF,KAAI,QAAQ;AACR,MAAI,CAAC,QAAQ,eACT,SAAQ,KAAK,yHAAyH;AAC1I,MAAI,aACA,SAAQ,KAAK,6FAA6F;;;AAItH,SAAS,WAAW,QAAQ;CACxB,IAAI;CACJ,MAAM,aAAa,cAAc,OAAO;AACxC,KAAI,CAAC,YAAY,QAAQ,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,QAAQ,CAChG,QAAO;CACX,MAAM,OAAO,QAAQ,OAAO;AAC5B,KAAI,cAAc,CAAC,WAAW,SAC1B,QAAO,WAAW;CACtB,IAAI;CACJ,SAAS,oBAAoB;AACzB,iBACI,SAAS,IACH,CAAC,kBAAkB,OAAO,GACtB,KAAK,OAAO,eAAe,OAAO,EAAC,YAAa,OAAO,GACvD,IAAI,IAAI,OAAO,GACnB,SAAS,IACL,MAAM,KAAK,WAAW,OAAO,QAAQ,CAAC,GACtC,YAAY,QAAQ,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,QAAQ;;AAEjH,KAAI,YAAY;AAEZ,aAAW,YAAY;AACvB,MAAI;AACA,sBAAmB;YAEf;AACJ,cAAW,YAAY;;OAM3B,gBAAe;AAEnB,SAAQ,eAAe,KAAK,UAAU;AAClC,MAAI,cAAc,QAAQ,IAAI,WAAW,UAAU,IAAI,EAAE,MAAM,CAC3D;EACJ,MAAM,WAAW,WAAW,MAAM;AAClC,MAAI,aAAa,OAAO;AACpB,OAAI,iBAAiB,OACjB,oBAAmB;AACvB,OAAI,cAAc,KAAK,SAAS;;GAEtC;AACF,KAAI,SAAS,GAAuB;EAChC,MAAM,SAAS,KAAK,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK;AAClI,SAAO,CAAC,kBAAkB,MAAM,GAC1B,KAAK,OAAO,eAAe,MAAM,EAAC,YAAa,aAAa,GAC5D,IAAI,IAAI,aAAa;;AAE/B,QAAO;;AAEX,SAAS,QAAQ,QAAQ;AACrB,KAAI,CAAC,QAAQ,OAAO,CAChB,OAAM,IAAI,MAAM,gDAAgD,SAAS;AAE7E,QAAO,WAAW,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;AA2B7B,MAAM,eAAe,QAAQ;AACzB,KAAI,QAAQ,KAAA,KACR,OAAO,UAAU,SAAS,KAAK,IAAI,KAAK,kBACxC,OAAM,IAAI,MAAM,oBAAoB,OAAO,IAAI,CAAC,kCAAkC;AAEtF,QAAO,SAAS,OAAO,MAAM,MAAM,MAAM;EACrC,IAAI,IAAI,IAAI;AACZ,MAAI,OAAO,SAAS,cAAc,OAAO,SAAS,WAC9C,QAAO,SAAU,MAAM,GAAG,MAAM;AAC5B,UAAO,OAAO,OAAO,UAAU,KAAK,KAAK,MAAM,OAAO,GAAG,KAAK,EAAE,KAAK;;EAG7E,MAAM,OAAO;EACb,MAAM,SAAS;EACf,IAAI,UAAU;AACd,MAAI,OAAO,SAAS,WAChB,WAAU;AAEd,MAAI,YAAY,KAAA,KACZ,OAAO,UAAU,SAAS,KAAK,QAAQ,KAAK,kBAC5C,OAAM,IAAI,MAAM,oBAAoB,QAAQ,kCAAkC;AAElF,YAAU,OAAO,OAAO,OAAO,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ;EACxD,MAAM,QAAQ,QAAQ,KAAK,GAAG,QAAQ,KAAK,GAAG;EAC9C,MAAM,OAAO,MAAM,QAAQ,QAAQ,KAAK,KAChC,OAAO,UAAU;AACjB,QAAK,MAAM,QAAQ,QAAQ,MAAM;AAC7B,QAAI,OAAO,SAAS,WAChB,OAAM,IAAI,MAAM,iBAAiB,KAAK,gCAAgC;IAE1E,MAAM,SAAS,KAAK,OAAO,MAAM;AACjC,QAAI,OACA,QAAO;;OAKjB,QAAQ;EACd,MAAM,iBAAiB,KAAK,QAAQ,mBAAmB,QAAQ,OAAO,KAAK,IAAI,KAAK;EACpF,MAAM,UAAU,KAAK,QAAQ,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK;EAEtE,MAAM,WAAW;GACb,mBAFsB,KAAK,QAAQ,sBAAsB,QAAQ,OAAO,KAAK,IAAI,KAAK;GAGtF;GACA;GACA;GACH;AACD,MAAI,CAAC,YAAY,OAAO,SAAS,IAC7B,OAAO,UAAU,YACjB,UAAU,KACV,OAAM,IAAI,MAAM,6HAA6H;EAEjJ,MAAM,CAAC,OAAO,YAAY,SAAS,OAAO,SAAS;AACnD,MAAI,OAAO,SAAS,YAAY;AAC5B,OAAI,CAAC,YAAY,OAAO,SAAS,CAC7B,OAAM,IAAI,MAAM,6HAA6H;AAEjJ,UAAO,CAAC,OAAO,SAAS;;EAE5B,IAAI;AACJ,MAAI;AACA,YAAS,OAAO,MAAM;WAEnB,OAAO;AACV,eAAY,cAAc,MAAM,CAAC;AACjC,SAAM;;EAEV,MAAM,eAAe,UAAU;GAC3B,MAAM,aAAa,cAAc,MAAM;AACvC,OAAI,CAAC,QAAQ,MAAM,EAAE;AACjB,QAAI,UAAU,KAAA,KACV,CAAC,QAAQ,OAAO,MAAM,KACrB,eAAe,QAAQ,eAAe,KAAK,IAAI,KAAK,IAAI,WAAW,UACpE,OAAM,IAAI,MAAM,oHAAoH;IAExI,MAAM,iBAAiB,UAAU,QAAQ,UAAU,KAAK,IAAI,KAAK,IAAI,MAAM;AAC3E,QAAI,gBAAgB;KAChB,MAAM,SAAS,eAAe;AAC9B,SAAI,SAAS,UAAU,OAAO,UAAU,YAAY,UAAU,KAC1D,mBAAkB;MACd,WAAW;MACX;MACA,cAAc;MACjB,CAAC;AAEN,YAAO,SAAS,CAAC,OAAO,CAAC;;AAE7B,QAAI,UAAU,KAAA,GAAW;AACrB,SAAI,OAAO,UAAU,YAAY,UAAU,KACvC,mBAAkB;MAAE,WAAW;MAAY;MAAO,CAAC;AAEvD,YAAO,SAAS,CAAC,MAAM,CAAC;;;AAGhC,OAAI,UAAU,SAAS,UAAU,KAAA,EAC7B,QAAO,SAAS,EAAE,CAAC;GAEvB,MAAM,qBAAqB,cAAc,MAAM;AAC/C,OAAI,aAAa,mBAAmB,SAAS;AACzC,QAAI,mBAAmB,SACnB,OAAM,IAAI,MAAM,wCAAwC;AAE5D,WAAO,SAAS,CAAC,QAAQ,MAAM,CAAC,CAAC;;AAErC,UAAO,SAAS,CAAC,MAAM,CAAC;;AAE5B,MAAI,kBAAkB,QAClB,QAAO,OAAO,KAAK,cAAc,UAAU;AACvC,eAAY,cAAc,MAAM,CAAC;AACjC,SAAM;IACR;AAEN,SAAO,YAAY,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;AA0BlC,MAAM,SAAS,aAAa;AAwLF,OAAO,UAAU,YAAY,UAAU;;;;AA6BjE,SAAS,UAAU,OAAO;AACtB,QAAO;;;;ACtuDX,IAAI,0BAA0B,cAAc,MAAM;CACjD;CACA,YAAY,MAAM;AACjB,SAAO;AACP,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,UAAU,KAAK,WAAW,yBAAyB,KAAK,UAAU,MAAM,MAAM,EAAE;;;AAGvF,IAAI,6BAA6B,cAAc,wBAAwB;CACtE;CACA,YAAY,QAAQ;AACnB,QAAM,OAAO;AACb,OAAK,SAAS;AACd,OAAK,OAAO;;;AAGd,IAAI,oBAAoB,cAAc,MAAM;CAC3C;CACA;CACA;CACA,YAAY,OAAO,UAAU,WAAW;AACvC,SAAO;AACP,OAAK,OAAO;AACZ,OAAK,YAAY;AACjB,OAAK,SAAS;AACd,OAAK,aAAa;AAClB,OAAK,UAAU,KAAK,UAAU;GAC7B,OAAO,6BAA6B,SAAS,OAAO,GAAG,UAAU,MAAM,UAAU,UAAU;GAC3F;GACA;GACA,EAAE,MAAM,EAAE;;CAEZ,IAAI,WAAW;AACd,SAAO,KAAK;;CAEb,IAAI,QAAQ;AACX,SAAO,KAAK;;CAEb,IAAI,YAAY;AACf,SAAO,KAAK;;;AAKd,MAAMC,yBAAuB,MAAM,MAAM,KAAK,KAAK,MAAM;AACzBE,KAAO,CAAC,QAAQ,MAAMF,sBAAoB,EAAE,CAAC;AAC7E,MAAM,mBAAmBG,MAAO,CAAC,aAAa,CAAC;AAC/C,MAAM,cAAcA,MAAO,CAAC,QAAQ,CAAC;AACrC,MAAM,aAAaA,MAAO,CAAC,OAAO,CAAC;AACnC,MAAM,iBAAiBA,MAAO,CAAC,WAAW,CAAC;AAC3C,MAAM,4BAA4BA,MAAO,CAAC,uBAAuB,CAAC;AAClE,MAAM,aAAaA,MAAO,CAAC,OAAO,CAAC;AACnC,SAAS,uBAAuB;AAC/B,QAAOC,QAAU;;AAElB,SAAS,uBAAuB;AAC/B,QAAOC,MAAQ;EACd,uBAAuB;EACvB,mBAAmB;EACnB,kBAAkB;EAClB,qBAAqB;EACrB,gCAAgC;EAChC,kBAAkB;EAClB,CAAC;;AAEH,SAAS,wBAAwB;AAChC,QAAOC,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU;EAC1B,OAAOG,WAAa,4BAA4B,CAAC;EACjD,MAAM;EACN,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,6BAA6B;AACrC,QAAOD,OAAS;EACf,YAAYE,QAAU;EACtB,OAAOD,WAAa,iCAAiC,CAAC;EACtD,CAAC;;AAEH,SAAS,kCAAkC;AAC1C,QAAOD,OAAS;EACf,MAAMG,SAAW,CAAC,SAAS;EAC3B,MAAML,QAAU;EAChB,CAAC;;AAEH,SAAS,oBAAoB;AAC5B,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU;EAC1B,OAAOG,WAAa,wBAAwB,CAAC;EAC7C,MAAM;EACN,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,yBAAyB;AACjC,QAAOD,OAAS;EACf,KAAKE,QAAU,CAAC,SAAS;EACzB,OAAOA,QAAU,CAAC,SAAS;EAC3B,CAAC;;AAEH,SAAS,wBAAwB;AAChC,QAAOF,OAAS,EAAE,OAAOE,QAAU,EAAE,CAAC;;AAEvC,SAAS,mBAAmB;AAC3B,QAAOF,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU,CAAC,UAAU;EACrC,OAAO,uBAAuB;EAC9B,MAAM;EACN,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,2BAA2B;AACnC,QAAOE,OAAS,EAAE,MAAMF,QAAU,EAAE,CAAC;;AAEtC,SAAS,sBAAsB;AAC9B,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU,CAAC,UAAU;EACrC,OAAO,0BAA0B;EACjC,MAAM;EACN,OAAOM,QAAU,SAAS;EAC1B,CAAC;;AAEH,SAAS,sCAAsC;AAC9C,QAAOJ,OAAS,EAAE,iBAAiBF,QAAU,CAAC,UAAU,EAAE,CAAC;;AAE5D,SAAS,iCAAiC;AACzC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU,CAAC,UAAU;EACrC,OAAO,qCAAqC;EAC5C,MAAM;EACN,OAAOM,QAAU,SAAS;EAC1B,CAAC;;AAEH,SAAS,wBAAwB;AAChC,QAAOJ,OAAS,EAAE,OAAOE,QAAU,EAAE,CAAC;;AAEvC,SAAS,mBAAmB;AAC3B,QAAOF,OAAS;EACf,IAAIF,QAAU;EACd,gBAAgBA,QAAU,CAAC,UAAU;EACrC,OAAO,uBAAuB;EAC9B,MAAM;EACN,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,8BAA8B;AACtC,QAAOE,OAAS;EACf,YAAYI,QAAU,wBAAwB,CAAC,UAAU;EACzD,SAASN,QAAU;EACnB,IAAIA,QAAU;EACd,cAAcA,QAAU,CAAC,UAAU;EACnC,CAAC;;AAEH,SAAS,uBAAuB;AAC/B,QAAOE,OAAS;EACf,aAAaF,QAAU,CAAC,SAAS;EACjC,IAAIA,QAAU;EACd,MAAMA,QAAU;EAChB,CAAC;;AAEH,SAAS,+BAA+B;AACvC,QAAOE,OAAS;EACf,WAAWF,QAAU,CAAC,SAAS;EAC/B,kBAAkBA,QAAU,CAAC,SAAS;EACtC,WAAWA,QAAU,CAAC,SAAS;EAC/B,eAAeA,QAAU,CAAC,SAAS;EACnC,IAAIA,QAAU;EACd,aAAaA,QAAU;EACvB,CAAC;;AAEH,SAAS,iCAAiC;AACzC,QAAOE,OAAS;EACf,SAASF,QAAU;EACnB,IAAIA,QAAU;EACd,aAAaA,QAAU;EACvB,CAAC;;AAEH,SAAS,0BAA0B;AAClC,QAAOE,OAAS;EACf,aAAaF,QAAU,CAAC,SAAS;EACjC,IAAIA,QAAU;EACd,UAAUA,QAAU;EACpB,MAAMA,QAAU;EAChB,SAASA,QAAU,CAAC,SAAS;EAC7B,QAAQA,QAAU,CAAC,SAAS;EAC5B,UAAUA,QAAU,CAAC,SAAS;EAC9B,OAAO,sBAAsB,CAAC,SAAS;EACvC,CAAC;;AAEH,SAAS,6BAA6B;AACrC,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,SAASA,QAAU;EACnB,IAAIA,QAAU;EACd,cAAcA,QAAU,CAAC,SAAS;EAClC,CAAC;;AAEH,SAAS,eAAe;AACvB,QAAOE,OAAS;EACf,YAAYI,QAAU,SAAS,CAAC,UAAU;EAC1C,MAAMN,QAAU;EAChB,SAASA,QAAU,CAAC,UAAU;EAC9B,CAAC;;AAEH,SAAS,oBAAoB;AAC5B,QAAOE,OAAS;EACf,YAAYI,QAAU,cAAc,CAAC,UAAU;EAC/C,IAAIN,QAAU;EACd,OAAOA,QAAU;EACjB,CAAC;;AAEH,SAAS,iCAAiC;AACzC,QAAOE,OAAS;EACf,YAAYI,QAAU,2BAA2B,CAAC,UAAU;EAC5D,IAAIN,QAAU;EACd,CAAC;;AAEH,SAAS,0BAA0B;AAClC,QAAOE,OAAS,EAAE,IAAIF,QAAU,EAAE,CAAC;;AAEpC,SAAS,kCAAkC;AAC1C,QAAOE,OAAS,EAAE,IAAIF,QAAU,EAAE,CAAC;;AAEpC,SAAS,oCAAoC;AAC5C,QAAOE,OAAS,EAAE,IAAIF,QAAU,EAAE,CAAC;;AAEpC,SAAS,6BAA6B;AACrC,QAAOE,OAAS,EAAE,IAAIF,QAAU,EAAE,CAAC;;AAEpC,SAAS,gCAAgC;AACxC,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,IAAIA,QAAU;EACd,CAAC;;AA+CH,SAAS,iCAAiC;AACzC,QAAOE,OAAS;EACf,YAAYI,QAAU,2BAA2B,CAAC,UAAU;EAC5D,IAAIN,QAAU;EACd,MAAMA,QAAU;EAChB,QAAQ,cAAc;EACtB,WAAWA,QAAU;EACrB,aAAaA,QAAU;EACvB,gBAAgBO,MAAQ,6BAA6B,CAAC;EACtD,CAAC;;AAEH,SAAS,8BAA8B;AACtC,QAAOL,OAAS;EACf,YAAYI,QAAU,wBAAwB,CAAC,UAAU;EACzD,OAAO,kBAAkB;EACzB,SAASC,MAAQ,cAAc,CAAC;EAChC,SAASH,QAAU,CAAC,KAAK;EACzB,WAAWG,MAAQP,QAAU,CAAC;EAC9B,CAAC;;AAEH,SAAS,eAAe;AACvB,QAAOE,OAAS;EACf,YAAYI,QAAU,sBAAsB,CAAC,UAAU;EACvD,IAAIN,QAAU;EACd,MAAMA,QAAU;EAChB,aAAaA,QAAU,CAAC,UAAU;EAClC,YAAYO,MAAQ,8BAA8B,CAAC;EACnD,CAAC;;AAEH,SAAS,2BAA2B;AACnC,QAAOL,OAAS;EACf,aAAaF,QAAU;EACvB,aAAaA,QAAU;EACvB,CAAC;;AAEH,SAAS,+BAA+B;AACvC,QAAOE,OAAS;EACf,YAAYI,QAAU,yBAAyB,CAAC,UAAU;EAC1D,IAAIN,QAAU;EACd,MAAMA,QAAU,CAAC,UAAU;EAC3B,aAAaA,QAAU,CAAC,UAAU;EAClC,QAAQA,QAAU,CAAC,UAAU;EAC7B,UAAUA,QAAU,CAAC,UAAU;EAC/B,SAASA,QAAU,CAAC,UAAU;EAC9B,QAAQO,MAAQ,sBAAsB,CAAC;EACvC,UAAUA,MAAQ,mBAAmB,CAAC;EACtC,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,uBAAuB;AAC/B,QAAOL,OAAS;EACf,YAAYI,QAAU,8BAA8B,CAAC,UAAU;EAC/D,IAAIN,QAAU;EACd,MAAMA,QAAU,CAAC,UAAU;EAC3B,MAAMA,QAAU,CAAC,UAAU;EAC3B,aAAaA,QAAU,CAAC,UAAU;EAClC,UAAUA,QAAU,CAAC,UAAU;EAC/B,CAAC;;AAEH,SAAS,mCAAmC;AAC3C,QAAOE,OAAS;EACf,YAAYI,QAAU,6BAA6B,CAAC,UAAU;EAC9D,OAAOC,MAAQP,QAAU,CAAC;EAC1B,CAAC;;AAEH,SAAS,qCAAqC;AAC7C,QAAOE,OAAS;EACf,UAAUF,QAAU;EACpB,OAAOO,MAAQP,QAAU,CAAC;EAC1B,CAAC;;AAEH,SAAS,4BAA4B;AACpC,QAAOE,OAAS,EAAE,OAAOK,MAAQP,QAAU,CAAC,EAAE,CAAC;;AAEhD,SAAS,oCAAoC;AAC5C,QAAOE,OAAS;EACf,aAAaF,QAAU;EACvB,OAAOO,MAAQP,QAAU,CAAC;EAC1B,CAAC;;AAEH,SAAS,sCAAsC;AAC9C,QAAOE,OAAS;EACf,aAAaF,QAAU;EACvB,OAAOO,MAAQP,QAAU,CAAC;EAC1B,CAAC;;AAEH,SAAS,kCAAkC;AAC1C,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,OAAOO,MAAQP,QAAU,CAAC;EAC1B,CAAC;;AAEH,SAAS,2BAA2B;AACnC,QAAOE,OAAS,EAAE,YAAYF,QAAU,EAAE,CAAC;;AAE5C,SAAS,8BAA8B;AACtC,QAAOE,OAAS,EAAE,eAAeF,QAAU,EAAE,CAAC;;AAE/C,SAAS,6BAA6B;AACrC,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,cAAcA,QAAU;EACxB,CAAC;;AAEH,SAAS,iCAAiC;AACzC,QAAOE,OAAS,EAAE,aAAaF,QAAU,EAAE,CAAC;;AAE7C,SAAS,+BAA+B;AACvC,QAAOE,OAAS,EAAE,WAAWF,QAAU,EAAE,CAAC;;AAE3C,SAAS,wBAAwB;AAChC,QAAOE,OAAS,EAAE,IAAIF,QAAU,EAAE,CAAC;;AAEpC,SAAS,0BAA0B;AAClC,QAAOE,OAAS,EAAE,MAAMF,QAAU,EAAE,CAAC;;AAEtC,SAAS,kCAAkC;AAC1C,QAAOE,OAAS;EACf,aAAaF,QAAU,CAAC,SAAS;EACjC,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,2BAA2B;AACnC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,MAAMA,QAAU,CAAC,SAAS;EAC1B,CAAC;;AAEH,SAAS,qCAAqC;AAC7C,QAAOE,OAAS;EACf,aAAaF,QAAU,CAAC,SAAS;EACjC,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,mCAAmC;AAC3C,QAAOE,OAAS;EACf,WAAWF,QAAU,CAAC,SAAS;EAC/B,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,0CAA0C;AAClD,QAAOE,OAAS;EACf,kBAAkBF,QAAU,CAAC,SAAS;EACtC,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,mCAAmC;AAC3C,QAAOE,OAAS;EACf,WAAWF,QAAU,CAAC,SAAS;EAC/B,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,uCAAuC;AAC/C,QAAOE,OAAS;EACf,eAAeF,QAAU,CAAC,SAAS;EACnC,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,8BAA8B;AACtC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,MAAMA,QAAU,CAAC,SAAS;EAC1B,CAAC;;AAEH,SAAS,+BAA+B;AACvC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,OAAO,sBAAsB;EAC7B,CAAC;;AAEH,SAAS,iCAAiC;AACzC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,SAASA,QAAU,CAAC,SAAS;EAC7B,CAAC;;AAEH,SAAS,gCAAgC;AACxC,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,QAAQA,QAAU,CAAC,SAAS;EAC5B,CAAC;;AAEH,SAAS,kCAAkC;AAC1C,QAAOE,OAAS;EACf,IAAIF,QAAU;EACd,UAAUA,QAAU,CAAC,SAAS;EAC9B,CAAC;;AAEH,SAAS,4BAA4B;AACpC,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,QAAQA,QAAU;EAClB,CAAC;;AAEH,SAAS,cAAc;AACtB,QAAOE,OAAS;EACf,YAAYI,QAAU,QAAQ,CAAC,UAAU;EACzC,QAAQN,QAAU;EAClB,UAAUO,MAAQ,mBAAmB,CAAC;EACtC,cAAcP,QAAU;EACxB,CAAC;;AAEH,SAAS,mBAAmB;AAC3B,QAAOE,OAAS;EACf,OAAO,aAAa;EACpB,QAAQ,aAAa;EACrB,CAAC;;AAEH,SAAS,iCAAiC;AACzC,QAAOA,OAAS;EACf,YAAYI,QAAU,2BAA2B,CAAC,UAAU;EAC5D,IAAIN,QAAU;EACd,YAAYA,QAAU;EACtB,CAAC;;AAEH,SAAS,oCAAoC;AAC5C,QAAOE,OAAS;EACf,SAASF,QAAU;EACnB,IAAIA,QAAU;EACd,CAAC;;AAEH,SAAS,gCAAgC;AACxC,QAAOE,OAAS;EACf,OAAOF,QAAU;EACjB,IAAIA,QAAU;EACd,YAAYA,QAAU;EACtB,CAAC;;AAOH,MAAM,0BAA0BO,MALDL,OAAS;CACvC,IAAIF,QAAU;CACd,MAAMA,QAAU;CAChB,eAAeO,MAAQP,QAAU,CAAC,CAAC,UAAU;CAC7C,CAAC,CAC6D,CAAC,UAAU;AAC1E,MAAM,kBAAkBE,OAAS;CAChC,MAAMF,QAAU,CAAC,UAAU;CAC3B,KAAKA,QAAU,CAAC,UAAU;CAC1B,CAAC;AACF,MAAM,wBAAwBC,MAAQ,CAACK,QAAU,MAAM,EAAEA,QAAU,SAAS,CAAC,CAAC;AAC9E,MAAM,oBAAoBJ,OAAS;CAClC,MAAMF,QAAU;CAChB,MAAM;CACN,aAAaA,QAAU,CAAC,UAAU;CAClC,UAAUQ,SAAW,CAAC,UAAU;CAChC,SAASA,SAAW,CAAC,UAAU;CAC/B,CAAC;AACqBN,OAAS;CAC/B,MAAMF,QAAU;CAChB,aAAaA,QAAU,CAAC,UAAU;CAClC,UAAUA,QAAU,CAAC,UAAU;CAC/B,WAAW,gBAAgB,UAAU;CACrC,gBAAgB;CAChB,MAAM;CACN,SAAS;CACT,YAAY;CACZ,WAAW;CACX,QAAQO,MAAQ,kBAAkB,CAAC,UAAU;CAC7C,CAAC;;;;;;;AASF,MAAM,QAAQ,QAAQ,GAAG,QAAQ,aAAa,aAAa,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,uBAAuB,MAAM;;;;;;;AAOnH,MAAM,QAAQ,QAAQ,GAAG,QAAQ,aAAa,aAAa,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,uBAAuB,MAAM;;;;;;;;;;;;AAYnH,MAAM,SAAS,OAAO,KAAK,QAAQ,aAAa,aAAa,SAAS;CACrE;CACA;CACA,EAAE,KAAK,GAAG,wBAAwB,MAAM;;;;;;;;;;;AAWzC,MAAM,aAAa,OAAO,eAAe,aAAa,cAAc;CACnE;CACA;CACA,EAAE,KAAK,GAAG,2BAA2B;AACtC,MAAM,QAAQ,QAAQ,aAAa,aAAa,QAAQ,EAAE,EAAE,KAAK,GAAG,KAAK,GAAG,MAAM;;;;;;;;;;;;;;;;;;;;;AAqBlF,SAAS,aAAa,MAAM,OAAO,cAAc,WAAW,QAAQ,UAAU;AAC7E,KAAI,CAAC,KAAM,OAAM,IAAI,MAAM,oBAAoB;AAC/C,KAAI,OAAO,SAAS,SAAU,OAAM,IAAI,MAAM,wBAAwB,KAAK,UAAU,KAAK,GAAG;CAC7F,MAAM,SAAS;EACd,IAAI,YAAY;EAChB,iCAAiC,IAAI,MAAM,EAAE,aAAa;EAC1D;EACA;EACA;EACA;AACD,KAAI;AACH,eAAa,CAAC,MAAM,OAAO,MAAM;UACzB,OAAO;AACf,MAAI,iBAAiB,SAAU,OAAM,IAAI,2BAA2B,MAAM,OAAO;AACjF,QAAM,IAAI,wBAAwB,MAAM;;AAEzC,QAAO;;;;;;AAMR,MAAM,oBAAoB,WAAW;AACpC,QAAO;EACN,IAAI,OAAO;EACX,gBAAgB,OAAO;EACvB,MAAM,OAAO;EACb,OAAO,OAAO;EACd,OAAO,OAAO;EACd,SAAS,OAAO;EAChB;;AAEF,MAAM,uBAAuB,QAAQ,OAAO,MAAM,YAAY;AAC7D,QAAO;EACN,GAAG;EACH;EACA,IAAI,kBAAkB,QAAQ,YAAY,QAAQ,OAAO,QAAQ,QAAQ,OAAO,GAAG;EACnF,gBAAgB,OAAO;EACvB,MAAM;EACN,OAAO,KAAK;EACZ;EACA;EACA;;AAEF,MAAM,0BAA0B,WAAW,OAAO,MAAM,YAAY;CACnE,MAAM,KAAK,kBAAkB,QAAQ,YAAY,QAAQ,OAAO,QAAQ,QAAQ,UAAU,OAAO,GAAG;AACpG,QAAO;EACN,GAAG;EACH,MAAM;EACN,OAAO,KAAK;EACZ;EACA;EACA;EACA;;AAEF,MAAM,wBAAwB,WAAW,YAAY;AACpD,KAAI,CAAC,UAAU,OAAQ,OAAM,IAAI,MAAM,0BAA0B;AACjE,QAAO;EACN,GAAG;EACH,QAAQ;GACP,GAAG,UAAU;GACb;GACA;EACD;;AAGF,MAAM,gBAAgB,MAAM,KAAK,aAAa,EAAE,MAAM;CACrD;CACA;CACA;CACA;AACD,eAAe,wBAAwB,SAAS,YAAY;CAC3D,MAAM,SAAS,8BAA8B,QAAQ;CACrD,MAAM,YAAY,MAAM,WAAW,+BAA+B,OAAO,CAAC;AAC1E,QAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,UAAU,GAAG;;AAE7C,eAAe,kBAAkB,QAAQ,SAAS,UAAU,QAAQ,aAAa;CAChF,MAAM,kBAAkB,QAAQ,UAAU,QAAQ,KAAK,GAAG,EAAE,8BAA8B,MAAM,CAAC,CAAC,WAAW,OAAO;AACpH,KAAI,CAAC,gBAAiB,OAAM,IAAI,MAAM,kCAAkC,OAAO,QAAQ;CACvF,MAAM,YAAY,gBAAgB,GAAG,GAAG;AACxC,KAAI,CAAC,UAAW,OAAM,IAAI,MAAM,yBAAyB;CACzD,MAAM,oBAAoB,gBAAgB,GAAG,GAAG,EAAE,QAAQ;CAC1D,MAAM,YAAY,MAAM,wBAAwB;EAC/C,YAAY,SAAS,OAAO;EAC5B;EACA;EACA;EACA,EAAE,YAAY;AACf,QAAO,qBAAqB,WAAW,EAAE,QAAQ,aAAa,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG,OAAO,YAAY,UAAU,CAAC,EAAE,CAAC;;;;;;;;AAa7H,MAAM,WAAW,SAAS,aAAa,YAAY,OAAO,SAAS,WAAW,EAAE,MAAM,GAAG,MAAM,KAAK,GAAG,0BAA0B,SAAS;;;;;;;;AAQ1I,MAAM,sBAAsB,UAAU,aAAa,wBAAwB,OAAO,UAAU,YAAY,UAAU,OAAO,QAAQ,EAAE,iBAAiB,OAAO,EAAE,KAAK,GAAG,qCAAqC,SAAS;AACnN,MAAM,gBAAgB,UAAU,aAAa,kBAAkB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yBAAyB,SAAS;AACvH,MAAM,cAAc,UAAU,aAAa,gBAAgB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,uBAAuB,SAAS;AACjH,MAAM,qBAAqB,UAAU,aAAa,uBAAuB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,8BAA8B,SAAS;AACtI,MAAM,uBAAuB,UAAU,aAAa,yBAAyB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,SAAS;AAC5I,MAAM,iBAAiB,UAAU,aAAa,mBAAmB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,0BAA0B,SAAS;AAC1H,MAAM,oBAAoB,UAAU,aAAa,sBAAsB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,6BAA6B,SAAS;AACnI,MAAM,aAAa,UAAU,aAAa,cAAc,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,sBAAsB,SAAS;AAC7G,MAAM,iBAAiB,UAAU,aAAa,mBAAmB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,0BAA0B,SAAS;AAC1H,MAAM,wBAAwB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,iCAAiC,SAAS;AAC/I,MAAM,gBAAgB,UAAU,aAAa,iBAAiB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yBAAyB,SAAS;AACtH,MAAM,kBAAkB,UAAU,aAAa,mBAAmB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,2BAA2B,SAAS;AAC5H,MAAM,gBAAgB,UAAU,aAAa,iBAAiB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yBAAyB,SAAS;AACtH,MAAM,oBAAoB,UAAU,aAAa,sBAAsB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,6BAA6B,SAAS;AACnI,MAAM,qBAAqB,UAAU,aAAa,uBAAuB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,8BAA8B,SAAS;AACtI,MAAM,sBAAsB,UAAU,aAAa,wBAAwB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,+BAA+B,SAAS;AACzI,MAAM,2BAA2B,UAAU,aAAa,6BAA6B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,oCAAoC,SAAS;AACxJ,MAAM,wBAAwB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,iCAAiC,SAAS;AAC/I,MAAM,uBAAuB,UAAU,aAAa,yBAAyB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,SAAS;AAC5I,MAAM,iBAAiB,UAAU,aAAa,kBAAkB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,0BAA0B,SAAS;AACzH,MAAM,mBAAmB,UAAU,aAAa,oBAAoB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,4BAA4B,SAAS;AAC/H,MAAM,2BAA2B,UAAU,aAAa,6BAA6B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,oCAAoC,SAAS;AACxJ,MAAM,qBAAqB,UAAU,aAAa,uBAAuB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,8BAA8B,SAAS;AACtI,MAAM,yBAAyB,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,kCAAkC,SAAS;AACnJ,MAAM,yBAAyB,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,kCAAkC,SAAS;AACnJ,MAAM,gCAAgC,UAAU,aAAa,mCAAmC,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yCAAyC,SAAS;AACxK,MAAM,6BAA6B,UAAU,aAAa,gCAAgC,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,sCAAsC,SAAS;AAC/J,MAAM,wBAAwB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,iCAAiC,SAAS;AAC/I,MAAM,0BAA0B,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,mCAAmC,SAAS;AACrJ,MAAM,uBAAuB,UAAU,aAAa,yBAAyB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,SAAS;AAC5I,MAAM,0BAA0B,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,mCAAmC,SAAS;AACrJ,MAAM,0BAA0B,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,mCAAmC,SAAS;AACrJ,MAAM,4BAA4B,UAAU,aAAa,8BAA8B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,qCAAqC,SAAS;AAO3J,MAAM,kBAAkB,UAAU,aAAa,oBAAoB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,2BAA2B,SAAS;AAC7H,MAAM,mBAAmB,UAAU,aAAa,qBAAqB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,4BAA4B,SAAS;AAChI,MAAM,mBAAmB,UAAU,aAAa,qBAAqB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,4BAA4B,SAAS;AAChI,MAAM,sBAAsB,UAAU,aAAa,wBAAwB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,+BAA+B,SAAS;AACzI,MAAM,sBAAsB,UAAU,aAAa,wBAAwB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,+BAA+B,SAAS;AACzI,MAAM,wBAAwB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,iCAAiC,SAAS;AAC/I,MAAM,oBAAoB,UAAU,aAAa,uBAAuB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,6BAA6B,SAAS;AACpI,MAAM,uBAAuB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,SAAS;AAC7I,MAAM,uBAAuB,UAAU,aAAa,0BAA0B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,SAAS;AAC7I,MAAM,yBAAyB,UAAU,aAAa,4BAA4B,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,kCAAkC,SAAS;AACnJ,MAAM,0BAA0B,aAAa,uBAAuB,EAAE,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;AACjG,MAAM,cAAc;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACD,MAAM,uBAAuB;CAC5B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACD,MAAM,UAAU;CACf,GAAG;CACH,GAAG;CACH;AAGD,MAAM,6BAA6B;AACnC,MAAM,iCAAiC,EAAE;AACzC,MAAM,kCAAkC;CACvC,IAAI;CACJ,MAAM;CACN,WAAW;CACX,aAAa;CACb,QAAQ;EACP,MAAM;EACN,SAAS;EACT;CACD,gBAAgB,CAAC;EAChB,SAAS;EACT,WAAW,EAAE;EACb,OAAO;GACN,QAAQ;IACP,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD,OAAO;IACN,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD;EACD,SAAS,EAAE;EACX,CAAC;CACF;AACD,MAAM,2BAA2B;CAChC,IAAI;CACJ,MAAM;CACN,WAAW;CACX,aAAa;CACb,QAAQ;EACP,MAAM;EACN,SAAS;EACT;CACD,gBAAgB,CAAC;EAChB,SAAS;EACT,WAAW,EAAE;EACb,OAAO;GACN,QAAQ;IACP,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD,OAAO;IACN,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD;EACD,SAAS;GACR;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,QAAQ;MACR,IAAI;MACJ,aAAa;MACb,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;IACC,MAAM;IACN,YAAY;KACX;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;MACC,MAAM;MACN,IAAI;MACJ,aAAa;MACb,QAAQ;MACR,UAAU;MACV,SAAS;MACT,UAAU,EAAE;MACZ,QAAQ,EAAE;MACV,OAAO;MACP;KACD;IACD,IAAI;IACJ,aAAa;IACb;GACD;EACD,CAAC;CACF;AACD,MAAM,sBAAsB;AAG5B,MAAM,uBAAuB;AAI7B,MAAM,4BAA4B;AAGlC,MAAM,2BAA2BL,OAAS;CACzC,IAAIF,QAAU;CACd,MAAMA,QAAU;CAChB,iBAAiBA,QAAU;CAC3B,sBAAsBA,QAAU;CAChC,cAAcA,QAAU;CACxB,CAAC;AACF,MAAM,0BAA0BE,OAAS,EAAE,QAAQG,SAAW,EAAE,CAAC;;AAEjE,MAAM,4BAA4B,yBAAyB,OAAO,EAAE,cAAcC,QAAU,0BAA0B,EAAE,CAAC;;AAEzH,MAAM,6BAA6B,wBAAwB,OAAO,EAAE,QAAQ,gCAAgC,EAAE,CAAC;AAC/G,MAAM,sBAAsBJ,OAAS;CACpC,QAAQ;CACR,OAAO;CACP,cAAc;CACd,CAAC;;AAEF,SAAS,qBAAqB,OAAO;AACpC,QAAO,2BAA2B,UAAU,MAAM,CAAC;;;AAGpD,SAAS,2BAA2B,OAAO;AAC1C,4BAA2B,MAAM,MAAM;;;AAGxC,SAAS,wBAAwB,UAAU;AAC1C,QAAO,oBAAoB,UAAU,SAAS,CAAC;;;AAGhD,SAAS,8BAA8B,UAAU;AAChD,qBAAoB,MAAM,SAAS;;;;;;;;AAkGpC,MAAM,yBAAyB,KAAK,YAAY,EAAE,eAAe,OAAO;AACvE,QAAO;EACN;EACA,KAAK;GACJ,WAAW,EAAE;GACb,OAAO;GACP;EACD;EACA,kCAAkC,IAAI,MAAM,EAAE,aAAa;EAC3D,MAAM;EACN,MAAM;EACN,QAAQ;EACR,UAAU,EAAE,UAAU,GAAG;EACzB,uCAAuC,IAAI,MAAM,EAAE,aAAa;EAChE,MAAM,EAAE;EACR;;AAoDF,SAAS,WAAW,QAAQ;AAC3B,QAAO,CAAC,QAAQ,OAAO,CAAC,SAAS,OAAO,KAAK;;AAE9C,SAAS,OAAO,QAAQ;AACvB,QAAO,OAAO,SAAS;;AAExB,SAAS,iBAAiB,QAAQ;AACjC,QAAO;EACN;EACA;EACA;EACA;EACA;EACA;EACA,CAAC,SAAS,OAAO,KAAK;;;;;;AAMxB,SAAS,8BAA8B,QAAQ,OAAO;CACrD,MAAM,cAAc;EACnB,OAAO,OAAO;EACd,SAAS;EACT,YAAY,OAAO;EACnB,SAAS;GACR,WAAW,OAAO;GAClB,WAAW,OAAO,IAAI;GACtB,OAAO,OAAO,IAAI;GAClB,iBAAiB,OAAO;GACxB,cAAc,OAAO;GACrB;EACD,MAAM,OAAO;EACb,MAAM,OAAO;EACb,QAAQ,OAAO;EACf,MAAM,OAAO;EACb,kBAAkB,OAAO,oBAAoB,EAAE,gBAAgB,GAAG;EAClE;CACD,MAAM,eAAe;EACpB,OAAO,OAAO;EACd,aAAa;EACb,WAAW,MAAM,SAAS;EAC1B,YAAY,OAAO;EACnB,cAAc;EACd;AACD,QAAO,CAAC;EACP,IAAI,YAAY;EAChB,MAAM;EACN,OAAO;EACP,gBAAgB,OAAO;EACvB,OAAO;EACP,EAAE;EACF,IAAI,YAAY;EAChB,MAAM;EACN,OAAO;EACP,gBAAgB,OAAO;EACvB,OAAO;EACP,CAAC,CAAC,KAAK,QAAQ,WAAW;EAC1B,GAAG;EACH;EACA,IAAI,kBAAkB,OAAO,IAAI,YAAY,OAAO,QAAQ,OAAO,GAAG;EACtE,MAAM;EACN,OAAO,KAAK;EACZ;EACA,MAAM;EACN,EAAE;;;;;;AAMJ,SAAS,mBAAmB,aAAa,cAAc,eAAe,IAAI;CACzE,MAAM,QAAQ,YAAY,aAAa;CACvC,MAAM,SAAS,sBAAsB,YAAY,EAAE,aAAa;AAChE,QAAO;EACN;EACA;EACA,cAAc;EACd,YAAY,eAAe;GAC1B,QAAQ,EAAE;GACV,OAAO,EAAE;GACT,UAAU,8BAA8B,QAAQ,MAAM;GACtD,GAAG;GACH,QAAQ,EAAE;GACV,OAAO,EAAE;GACT;EACD,WAAW,EAAE;EACb;;AAEF,SAAS,0BAA0B,UAAU,QAAQ,UAAU;AAC9D,QAAO,YAAYO,YAAU,SAAS,MAAM,UAAU,GAAG,CAAC;;;;;;;AA+E3D,SAAS,iBAAiB,kBAAkB;CAC3C,MAAM,SAAS,EAAE;CACjB,IAAI,kBAAkB;AACtB,MAAK,IAAI,IAAI,iBAAiB,SAAS,GAAG,KAAK,GAAG,KAAK;EACtD,MAAM,KAAK,iBAAiB;AAC5B,MAAI,YAAY,MAAM,GAAG,OAAO,SAAS,UAAU,GAAG,OAAO,GAAG;AAC/D;AACA,UAAO,QAAQ,GAAG;aACR,kBAAkB,EAAG;MAC3B,QAAO,QAAQ,GAAG;;AAExB,QAAO;;AAKR,MAAM,sBAAsB,UAAU;AACrC,QAAO;;AAER,SAAS,eAAe,cAAc,YAAY,SAAS,QAAQ,UAAU,uBAAuB,EAAE,EAAE,SAAS;CAChH,MAAM,EAAE,cAAc,MAAM,8BAA8B,gCAAgC,qBAAqB,wBAAwB,WAAW,EAAE;CACpJ,IAAI,gBAAgB;CACpB,MAAM,qBAAqB,EAAE;CAC7B,MAAM,YAAY,IAAI,IAAI;EACzB,GAAG,OAAO,KAAK,WAAW;EAC1B;EACA;EACA,CAAC;CACF,MAAM,oBAAoB,EAAE;AAC5B,MAAK,MAAM,SAAS,UAAW,mBAAkB,SAAS,EAAE;AAC5D,KAAI,6BAA8B,MAAK,MAAM,CAAC,OAAO,oBAAoB,OAAO,QAAQ,WAAW,EAAE;AACpG,MAAI,CAAC,gBAAiB;EACtB,MAAM,QAAQ,gBAAgB,eAAe,MAAM,CAAC,CAAC,EAAE,eAAe;AACtE,MAAI,QAAQ,GAAG;AACd,sBAAmB,KAAK,GAAG,gBAAgB;AAC3C;;EAED,MAAM,cAAc,gBAAgB;AACpC,MAAI,CAAC,eAAe,CAAC,YAAY,eAAgB;AACjD,MAAI;GACH,MAAM,aAAa,8BAA8B,YAAY,eAAe;AAC5E,mBAAgB;IACf,GAAG;KACF,QAAQ;IACT;GACD,MAAM,kBAAkB,kBAAkB;AAC1C,OAAI,gBAAiB,iBAAgB,KAAK,GAAG,gBAAgB,MAAM,GAAG,QAAQ,EAAE,CAAC;AACjF,sBAAmB,KAAK,GAAG,gBAAgB,MAAM,QAAQ,EAAE,CAAC;UACrD;AACP,sBAAmB,KAAK,GAAG,gBAAgB;;;KAGxC,oBAAmB,KAAK,GAAG,OAAO,OAAO,WAAW,CAAC,SAAS,QAAQ,OAAO,EAAE,CAAC,CAAC;CACtF,MAAM,WAAW;EAChB;EACA,OAAO,mBAAmB,cAAc;EACxC;EACA,YAAY;EACZ,WAAW,EAAE;EACb;CACD,IAAI,SAAS;AACb,KAAI,mBAAmB,OAAQ,UAAS,mBAAmB,QAAQ,UAAU,cAAc;AAC1F,SAAO,QAAQ,UAAU,UAAU,QAAQ,UAAU;GACpD,sBAAsB;GACtB;GACA;GACA,eAAe,EAAE,WAAW;GAC5B,CAAC;IACA,SAAS;KACP,MAAK,MAAM,mBAAmB,OAAO,OAAO,kBAAkB,EAAE;AACpE,MAAI,CAAC,gBAAiB;EACtB,MAAM,gBAAgB,gBAAgB,GAAG,GAAG;AAC5C,MAAI,cAAe,UAAS,qBAAqB,QAAQ,cAAc,OAAO,OAAO,cAAc,eAAe;;AAEnH,KAAI,CAAC,YAAa,MAAK,MAAM,SAAS,OAAO,KAAK,OAAO,MAAM,CAAE,MAAK,IAAI,IAAI,mBAAmB,SAAS,GAAG,KAAK,GAAG,KAAK;EACzH,MAAM,YAAY,mBAAmB;AACrC,MAAI,UAAU,OAAO,UAAU,MAAO;AACtC,MAAI,UAAU,SAAS,0BAA0B,QAAQ,MAAM,CAAE,OAAM,IAAI,kBAAkB,OAAO,QAAQ,UAAU;MACjH;;CAEN,MAAM,kBAAkB,IAAI,IAAI;EAC/B,GAAG,OAAO,KAAK,OAAO,WAAW;EACjC,GAAG,OAAO,KAAK,WAAW;EAC1B;EACA;EACA,CAAC;CACF,MAAM,0BAA0B,EAAE;AAClC,MAAK,MAAM,SAAS,gBAAiB,yBAAwB,SAAS,EAAE;CACxE,MAAM,mBAAmB,MAAM,KAAK,gBAAgB,CAAC,QAAQ,KAAK,UAAU;EAC3E,MAAM,WAAW,OAAO,WAAW,UAAU,EAAE;AAC/C,SAAO;GACN,GAAG;IACF,QAAQ,CAAC,GAAG,SAAS,KAAK,WAAW,UAAU;AAC/C,WAAO;KACN,GAAG;KACH,WAAW,WAAW,SAAS,QAAQ,kBAAkB,UAAU;KACnE;KACA,CAAC;GACH;IACC,wBAAwB;CAC3B,MAAM,eAAe,SAAS,OAAO,uBAAuB,OAAO,OAAO,iBAAiB,CAAC,QAAQ,KAAK,SAAS;AACjH,MAAI,CAAC,KAAM,QAAO;EAClB,MAAM,YAAY,KAAK,GAAG,GAAG;AAC7B,MAAI;OACC,UAAU,iBAAiB,IAAK,QAAO,UAAU;;AAEtD,SAAO;IACL,SAAS,OAAO,qBAAqB;AACxC,KAAI,OAAQ,QAAO,SAAS;EAC3B,GAAG;EACH,UAAU,OAAO,OAAO;EACxB,sBAAsB;EACtB;AACD,QAAO;EACN,GAAG;EACH,YAAY;EACZ;;AAEF,SAAS,oBAAoB,OAAO;CACnC,MAAM,YAAY,OAAO;AACzB,KAAI,cAAc,SAAU,QAAO,KAAK,MAAM,MAAM;UAC3C,cAAc,SAAU,QAAO;KACnC,OAAM,IAAI,MAAM,yCAAyC,YAAY;;AA6B3E,SAAS,eAAe,kBAAkB;CACzC,MAAM,SAAS,EAAE;CACjB,IAAI,IAAI,iBAAiB,SAAS;AAClC,QAAO,IAAI,IAAI;AACd,SAAO,QAAQ,iBAAiB,GAAG;EACnC,MAAM,aAAa,iBAAiB,IAAI,SAAS,MAAM,iBAAiB,IAAI,QAAQ,KAAK;EACzF,IAAI,IAAI,IAAI;AACZ,SAAO,IAAI,OAAO,iBAAiB,IAAI,SAAS,KAAK,UAAW;AAChE,MAAI;;AAEL,QAAO;;AAiCR,SAAS,eAAe,YAAY;AACnC,QAAO,WAAW,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;;AA8H5F,SAAS,eAAe,kBAAkB;AACzC,KAAI,iBAAiB,SAAS,EAAG,QAAO;CACxC,MAAM,oBAAoB,eAAe,iBAAiB;CAC1D,IAAI,YAAY,kBAAkB,kBAAkB,SAAS,IAAI,QAAQ,KAAK;AAC9E,KAAI,kBAAkB,SAAS,EAAG,aAAY,kBAAkB,kBAAkB,SAAS,IAAI,QAAQ;AACvG,SAAQ,kBAAkB,kBAAkB,SAAS,IAAI,SAAS,MAAM,WAAW,KAAK;;;;;;;;;AAqDzF,SAAS,qBAAqB,YAAY,qBAAqB;CAC9D,MAAM,YAAY,eAAe,WAAW,CAAC,GAAG,GAAG,EAAE,SAAS;CAC9D,MAAM,YAAY,YAAY;CAC9B,MAAM,qBAAqB;EAC1B,GAAG;EACH,OAAO,oBAAoB,SAAS;EACpC;AACD,KAAI,mBAAmB,QAAQ,UAAW,OAAM,IAAI,MAAM,oEAAoE,YAAY;AAC1I,QAAO,eAAe,eAAe,CAAC,GAAG,YAAY,mBAAmB,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG;;AAExF,SAAS,iCAAiC,oBAAoB;AAC7D,QAAO,OAAO,QAAQ,mBAAmB,CAAC,QAAQ,KAAK,UAAU;EAChE,MAAM,CAAC,OAAO,OAAO;AACrB,MAAI,CAAC,IAAK,QAAO;AACjB,SAAO;GACN,GAAG;IACF,QAAQ,eAAe,eAAe,IAAI,CAAC;GAC5C;IACC,EAAE,CAAC;;AAgBP,SAAS,uCAAuC,oBAAoB;AACnE,KAAI,CAAC,mBAAoB,QAAO,EAAE;AAClC,QAAO,OAAO,QAAQ,mBAAmB,CAAC,QAAQ,KAAK,CAAC,OAAO,gBAAgB;AAC9E,MAAI,CAAC,WAAY,QAAO;AACxB,SAAO;GACN,GAAG;IACF,QAAQ,WAAW,KAAK,OAAO;IAC/B,MAAM,EAAE,gBAAgB,GAAG,cAAc;AACzC,WAAO;KACN;GACF;IACC,EAAE,CAAC;;;;;;;;;;;AAWP,SAAS,eAAe,oBAAoB,oBAAoB;AAC/D,QAAO,mBAAmB,QAAQ,eAAe,CAAC,mBAAmB,MAAM,eAAe,WAAW,UAAU,WAAW,MAAM,CAAC;;AAElI,SAAS,wBAAwB,UAAU;CAC1C,IAAI;AACJ,MAAK,MAAM,OAAO,OAAO,OAAO,SAAS,WAAW,EAAE;AACrD,MAAI,CAAC,IAAK;AACV,OAAK,MAAM,MAAM,IAAK,KAAI,CAAC,UAAU,GAAG,QAAQ,OAAO,SAAS,GAAG,UAAU,OAAO,SAAS,GAAG,OAAO,OAAO,KAAM,UAAS;;AAE9H,QAAO,QAAQ,kBAAkB,SAAS,OAAO;;;;;;;;;AASlD,SAAS,gBAAgB,UAAU,OAAO;AACzC,SAAQ,SAAS,WAAW,QAAQ,GAAG,GAAG,EAAE,SAAS,MAAM;;;;;;;;;;;AAW5D,SAAS,qBAAqB,UAAU,OAAO,uBAAuB;CACrE,MAAM,eAAe,yBAAyB,wBAAwB,SAAS;CAC/E,MAAM,mBAAmB,SAAS,OAAO;CACzC,MAAM,SAAS;EACd,GAAG,SAAS;EACZ,UAAU;GACT,GAAG,SAAS,OAAO;IAClB,QAAQ,gBAAgB,UAAU,MAAM;GACzC;EACD,sBAAsB,CAAC,oBAAoB,eAAe,mBAAmB,eAAe;EAC5F;AACD,QAAO;EACN,GAAG;EACH;EACA;;AAIF,SAAS,iBAAiB,UAAU,OAAO;AAC1C,QAAO;EACN,GAAG;EACH,QAAQ;GACP,GAAG,SAAS;GACZ,MAAM,MAAM;GACZ;EACD;;AAEF,SAAS,4BAA4B,UAAU,OAAO;CACrD,MAAM,eAAe,SAAS,OAAO,QAAQ,EAAE;AAC/C,KAAI,MAAM,gBAAiB,QAAO;EACjC,GAAG;EACH,QAAQ;GACP,GAAG,SAAS;GACZ,MAAM;IACL,GAAG;IACH,iBAAiB,MAAM;IACvB;GACD;EACD;CACD,MAAM,EAAE,iBAAiB,UAAU,GAAG,SAAS;AAC/C,QAAO;EACN,GAAG;EACH,QAAQ;GACP,GAAG,SAAS;GACZ,MAAM;GACN;EACD;;AAEF,SAAS,cAAc,UAAU,QAAQ,MAAM;CAC9C,MAAM,EAAE,UAAU;AAClB,QAAO,OAAO;EACb;EACA;EACA;EACA,yBAAyB;EACzB,GAAG,UAAU;EACb,MAAM,mBAAmB,eAAe,CAAC,GAAG,SAAS,WAAW,OAAO,CAAC;AACxE,QAAM,SAAS,KAAK,MAAM;EAC1B,MAAM,gBAAgB,iBAAiB,GAAG,GAAG;EAC7C,IAAI,YAAY,eAAe,SAAS;EACxC,MAAM,YAAY,eAAe,OAAO,SAAS;AACjD,MAAI,UAAW,aAAY,YAAY;MAClC,OAAM,0BAA0B;AACrC,QAAM,OAAO,eAAe,YAAY,CAAC,GAAG,kBAAkB;GAC7D,OAAO;GACP,MAAM;GACN,CAAC,GAAG,iBAAiB;AACtB,MAAI,iBAAiB,MAAM,OAAO,cAAc,OAAO,EAAG,OAAM,OAAO,MAAM,OAAO;AACpF,MAAI,MAAM,OAAO,EAAG,OAAM,IAAI,MAAM,iFAAiF;GACpH;;;;;;;;;AASH,SAAS,gBAAgB,UAAU,QAAQ,MAAM;CAChD,MAAM,EAAE,UAAU;AAClB,QAAO,OAAO;EACb;EACA;EACA;EACA,yBAAyB;EACzB,GAAG,UAAU;EACb,MAAM,mBAAmB,eAAe,CAAC,GAAG,SAAS,WAAW,UAAU,EAAE,CAAC,CAAC;EAC9E,MAAM,aAAa,iBAAiB,QAAQ,OAAO,GAAG,OAAO,SAAS,OAAO;EAC7E,IAAI,kBAAkB;AACtB,OAAK,IAAI,IAAI,iBAAiB,SAAS,GAAG,KAAK,GAAG,IAAK,KAAI,iBAAiB,GAAG,OAAO,SAAS,OAAQ;MAClG;AACL,MAAI,WAAW,UAAU,gBAAiB,OAAM,IAAI,MAAM,2DAA2D;AACrH,QAAM,SAAS,KAAK,MAAM;AAC1B,QAAM,OAAO;GACZ;;AAEH,SAAS,cAAc,UAAU,QAAQ,MAAM;CAC9C,MAAM,EAAE,OAAO,UAAU;AACzB,QAAO,OAAO;EACb;EACA;EACA;EACA,yBAAyB;EACzB,GAAG,UAAU;AACb,MAAI,MAAM,OAAO,EAAG,OAAM,IAAI,MAAM,uEAAuE;EAC3G,MAAM,QAAQ,OAAO,UAAU,YAAY,UAAU,QAAQ,WAAW,QAAQ,MAAM,QAAQ;AAC9F,MAAI,OAAO,UAAU,YAAY,QAAQ,EAAG,OAAM,IAAI,MAAM,yDAAyD;AACrH,MAAI,OAAO,UAAU,YAAY,QAAQ,EAAG,OAAM,IAAI,MAAM,gDAAgD;AAC5G,MAAI,MAAM,SAAS,UAAU,SAAS,EAAG,OAAM,IAAI,MAAM,8CAA8C;EACvG,MAAM,iBAAiB,MAAM,SAAS,UAAU,eAAe,OAAO,GAAG,OAAO,UAAU,MAAM;AAChG,MAAI,iBAAiB,EAAG,OAAM,IAAI,MAAM,sDAAsD,MAAM,GAAG;EACvG,MAAM,YAAY,MAAM,SAAS,UAAU,OAAO,gBAAgB,EAAE,CAAC;AACrE,QAAM,SAAS,UAAU;GACxB,MAAM,UAAU,OAAO;GACvB,OAAO,UAAU,OAAO;GACxB,OAAO,UAAU,OAAO;GACxB,CAAC;GACD;;AAEH,SAAS,mBAAmB,UAAU,QAAQ;AAC7C,QAAO;EACN,GAAG;EACH,QAAQ;GACP,GAAG,SAAS;GACZ,MAAM,OAAO,MAAM;GACnB;EACD,OAAO,OAAO,MAAM;EACpB;;AAIF,SAAS,iBAAiB,cAAc,mBAAmB,cAAc,QAAQ,UAAU,kBAAkB,aAAa,uBAAuB,EAAE,EAAE,SAAS;AAC7J,QAAO,eAAe,cAAc,mBAAmB,cAAc,cAAc,gBAAgB,EAAE,QAAQ,UAAU,sBAAsB,QAAQ;;;;;;;;;;;;;AAatJ,SAAS,0BAA0B,UAAU,QAAQ,yBAAyB,MAAM,SAAS;AAC5F,KAAI;EACH;EACA;EACA;EACA,CAAC,SAAS,OAAO,KAAK,CAAE,QAAO;CAChC,MAAM,QAAQ,OAAO;CACrB,MAAM,WAAW,SAAS,WAAW;CACrC,MAAM,qBAAqB,UAAU,GAAG,GAAG,EAAE,SAAS;CACtD,MAAM,eAAe,oBAAoB,QAAQ,0BAA0B,qBAAqB,qBAAqB,GAAG,MAAM,QAAQ;CACtI,MAAM,aAAa,CAAC,GAAG,YAAY,EAAE,EAAE,aAAa;AACpD,QAAO;EACN,GAAG;EACH,YAAY;GACX,GAAG,SAAS;IACX,QAAQ;GACT;EACD;;AAEF,SAAS,6BAA6B,UAAU,WAAW,yBAAyB,MAAM,SAAS,qBAAqB;CACvH,MAAM,QAAQ,UAAU,OAAO;CAC/B,MAAM,WAAW,SAAS,WAAW;CACrC,MAAM,qBAAqB,UAAU,GAAG,GAAG,EAAE,SAAS;CACtD,MAAM,YAAY,0BAA0B,qBAAqB,qBAAqB;AACtF,KAAI,CAAC,uBAAuB,UAAU,QAAQ,OAAO,UAAW,OAAM,IAAI,MAAM,gCAAgC,UAAU,wCAAwC,UAAU,MAAM,aAAa,OAAO;CACtM,MAAM,eAAe,uBAAuB,WAAW,UAAU,OAAO,MAAM,QAAQ;CACtF,MAAM,aAAa,CAAC,GAAG,YAAY,EAAE,EAAE,aAAa;AACpD,QAAO;EACN,GAAG;EACH,YAAY;GACX,GAAG,SAAS;IACX,QAAQ;GACT;EACD;;;;;;;;;;;;AAYF,SAAS,eAAe,UAAU,QAAQ,yBAAyB,MAAM,SAAS,WAAW,qBAAqB;CACjH,IAAI;AACJ,KAAI,UAAW,eAAc,6BAA6B,UAAU,WAAW,yBAAyB,MAAM,SAAS,oBAAoB;KACtI,eAAc,0BAA0B,UAAU,QAAQ,yBAAyB,MAAM,QAAQ;AACtG,eAAc,qBAAqB,aAAa,OAAO,OAAO,OAAO,eAAe;AACpF,QAAO;;;;;;;;;;AAUR,SAAS,aAAa,UAAU,QAAQ,gBAAgB;CACvD,MAAM,eAAe,sBAAsB,CAAC,MAAM,OAAO;AACzD,SAAQ,aAAa,MAArB;EACC,KAAK,WAAY,QAAO,iBAAiB,UAAU,aAAa,MAAM;EACtE,KAAK,uBAAwB,QAAO,4BAA4B,UAAU,aAAa,MAAM;EAC7F,KAAK,QAAS,QAAO,eAAe,UAAU,aAAa,OAAO,eAAe;EACjF,KAAK,aAAc,QAAO,mBAAmB,UAAU,aAAa,MAAM;EAC1E,QAAS,QAAO;;;;;;;;;;;AAWlB,SAAS,gBAAgB,UAAU,QAAQ,MAAM,kBAAkB,GAAG;AACrE,SAAQ,OAAO,MAAf;EACC,KAAK;AACJ,OAAI,mBAAmB,EAAG,QAAO,gBAAgB,UAAU,QAAQ,KAAK;AACxE,UAAO,cAAc,UAAU,QAAQ,KAAK;EAC7C,KAAK,OAAQ,QAAO,cAAc,UAAU,QAAQ,KAAK;EACzD,QAAS,QAAO;GACf;GACA;GACA;GACA,yBAAyB;GACzB;;;AAGH,SAAS,qBAAqB,UAAU,QAAQ,eAAe,WAAW,+BAA+B,OAAO,uBAAuB,qBAAqB;CAC3J,MAAM,QAAQ,OAAO;CACrB,MAAM,kBAAkB,SAAS,WAAW;AAC5C,KAAI,CAAC,gBAAiB,QAAO;CAC7B,MAAM,kBAAkB,gBAAgB,GAAG,GAAG;AAC9C,KAAI,CAAC,gBAAiB,QAAO;CAC7B,MAAM,qBAAqB,iCAAiC;EAC3D,GAAG,SAAS;GACX,QAAQ,qBAAqB,iBAAiB,gBAAgB;EAC/D,CAAC;CACF,IAAI,aAAa,KAAK;CACtB,MAAM,yBAAyB,mBAAmB,QAAQ,GAAG,GAAG;AAChE,KAAI,gCAAgC,wBAAwB,eAAgB,cAAa,qBAAqB,uBAAuB,eAAe;MAC/I;EACJ,MAAM,EAAE,UAAU,iBAAiB,SAAS,cAAc,oBAAoB,eAAe,SAAS,QAAQ,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG;GACrI;GACA,+BAA+B;GAC/B,qBAAqB;GACrB,CAAC;AACF,eAAa,MAAM;;AAEpB,QAAO;EACN,GAAG;EACH,OAAO;GACN,GAAG,SAAS;IACX,QAAQ;GACT;EACD,YAAY,iCAAiC,EAAE,GAAG,SAAS,YAAY,CAAC;EACxE;;AAEF,SAAS,qBAAqB,UAAU,OAAO,eAAe,+BAA+B,OAAO,uBAAuB,qBAAqB;CAC/I,MAAM,kBAAkB,SAAS,WAAW;AAC5C,KAAI,CAAC,gBAAiB,QAAO;CAC7B,MAAM,mBAAmB,eAAe,CAAC,GAAG,gBAAgB,CAAC;AAC7D,kBAAiB,KAAK;CACtB,MAAM,qBAAqB,iCAAiC,EAAE,GAAG,SAAS,YAAY,CAAC;CACvF,MAAM,mBAAmB,mBAAmB;AAC5C,KAAI,CAAC,iBAAkB,QAAO;CAC9B,MAAM,oBAAoB,CAAC,GAAG,iBAAiB;CAC/C,MAAM,OAAO,eAAe,eAAe,iBAAiB,EAAE,kBAAkB;CAChF,MAAM,MAAM,iBAAiB,SAAS,cAAc,oBAAoB,eAAe,SAAS,QAAQ,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG;EAC/H;EACA,+BAA+B;EAC/B,CAAC;CACF,MAAM,YAAY,eAAe,CAAC,GAAG,SAAS,WAAW,GAAG,KAAK,CAAC,QAAQ,OAAO,GAAG,OAAO,SAAS,OAAO,CAAC,CAAC,SAAS;AACtH,QAAO;EACN,GAAG;EACH;EACA;;;;;;;;;;;;;;AAcF,SAAS,YAAY,UAAU,QAAQ,eAAe,UAAU,UAAU,EAAE,EAAE;CAC7E,MAAM,EAAE,MAAM,uBAAuB,OAAO,+BAA+B,OAAO,+BAA+B,cAAc,MAAM,SAAS,WAAW;CACzJ,IAAI,UAAU,iBAAiB,OAAO;CACtC,IAAI,YAAY,QAAQ,QAAQ,eAAe,UAAU,QAAQ;CACjE,IAAI,cAAc,EAAE,GAAG,UAAU;CACjC,IAAI,0BAA0B;CAC9B,MAAM,6BAA6B,CAAC,wBAAwB,YAAY;AACxE,KAAI,WAAW,QAAQ,EAAE;EACxB,MAAM,EAAE,MAAM,gBAAgB,QAAQ,mBAAmB,UAAU,mBAAmB,yBAAyB,eAAe,gBAAgB,UAAU,SAAS,WAAW,QAAQ,mBAAmB,EAAE;AACzM,YAAU;AACV,cAAY;AACZ,gBAAc;AACd,4BAA0B;OACpB,eAAc;EACpB,GAAG;EACH,WAAW,EAAE;EACb;AACD,KAAI,iBAAiB,QAAQ,CAAE,eAAc,aAAa,aAAa,SAAS,cAAc;CAC9F,MAAM,mBAAmB;EACxB,YAAY,SAAS,OAAO;EAC5B,OAAO,QAAQ;EACf;EACA;AACD,eAAc,eAAe,aAAa,SAAS,yBAAyB,WAAW,kBAAkB,QAAQ,eAAe,WAAW,QAAQ,oBAAoB;CACvK,MAAM,kBAAkB,QAAQ,mBAAmB;AACnD,KAAI,OAAO,OAAO,IAAI,kBAAkB,EAAG,QAAO,qBAAqB,aAAa,OAAO,OAAO,cAAc;CAChH,MAAM,iBAAiB,QAAQ,SAAS,UAAU,YAAY;AAC9D,MAAK,OAAO,OAAO,IAAI,mBAAmB,mBAAmB,GAAG;EAC/D,MAAM,QAAQ,QAAQ;EACtB,MAAM,cAAc,iBAAiB,eAAe,CAAC,GAAG,YAAY,WAAW,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,OAAO,GAAG,OAAO,SAAS,OAAO;EACxI,MAAM,YAAY;GACjB,GAAG,YAAY;IACd,QAAQ;GACT;AACD,SAAO;GACN,GAAG,iBAAiB,YAAY,cAAc,WAAW,eAAe,YAAY,QAAQ,UAAU,aAAa,EAAE,EAAE,EAAE,qBAAqB,MAAM,CAAC;GACrJ,YAAY,YAAY;GACxB,WAAW,EAAE;GACb;;AAEF,KAAI,4BAA4B;EAC/B,MAAM,YAAY,qBAAqB,aAAa,SAAS,eAAe,WAAW,8BAA8B,8BAA8B;AACnJ,MAAI,CAAC,YAAa,eAAc;GAC/B,GAAG;GACH,YAAY,YAAY;GACxB;MACI,eAAc;;AAEpB,eAAc,OAAO,cAAc,UAAU;AAC5C,MAAI;GACH,MAAM,WAAW,cAAc,MAAM,OAAO,SAAS,SAAS;AAC9D,OAAI,SAAU,cAAa;AAC1B,UAAM,QAAQ,UAAU,SAAS;KAChC;WACM,OAAO;GACf,MAAM,iBAAiB,YAAY,WAAW,QAAQ;AACtD,OAAI,CAAC,eAAgB,OAAM,IAAI,MAAM,kCAAkC,QAAQ,SAAS,EAAE,OAAO,OAAO,CAAC;GACzG,MAAM,qBAAqB,eAAe,SAAS;GACnD,MAAM,gBAAgB,MAAM,WAAW,QAAQ;AAC/C,OAAI,CAAC,cAAe,OAAM,IAAI,MAAM,2CAA2C,QAAQ,SAAS,EAAE,OAAO,OAAO,CAAC;AACjH,iBAAc,oBAAoB,QAAQ,MAAM;AAChD,iBAAc,oBAAoB,OAAO;AACzC,OAAI,4BAA4B;AAC/B,UAAM,QAAQ,UAAU,EAAE,GAAG,SAAS,OAAO,CAAC;IAC9C,MAAM,mBAAmB,SAAS,WAAW,QAAQ;AACrD,QAAI,CAAC,iBAAkB,OAAM,IAAI,MAAM,kCAAkC,QAAQ,SAAS,EAAE,OAAO,OAAO,CAAC;AAC3G,UAAM,aAAa,UAAU;KAC5B,GAAG,SAAS;MACX,QAAQ,QAAQ,CAAC,GAAG,kBAAkB,EAAE,GAAG,cAAc,qBAAqB,CAAC;KAChF,CAAC;;;GAGH;AACF,KAAI;EACH;EACA;EACA;EACA,CAAC,SAAS,QAAQ,KAAK,CAAE,QAAO;CACjC,MAAM,QAAQ,QAAQ,SAAS;CAC/B,IAAI,OAAO,0BAA0B,aAAa,MAAM;AACxD,KAAI,QAAQ,eAAe,UAAU,QAAQ,QAAQ,cAAc,UAAU,SAAS,GAAI,QAAO,QAAQ,cAAc,UAAU;CACjI,MAAM,gBAAgB,YAAY,WAAW,QAAQ,GAAG,GAAG;AAC3D,KAAI,eAAe;AAClB,gBAAc,OAAO;AACrB,MAAI,6BAA8B,eAAc,iBAAiB,KAAK,UAAU,YAAY,MAAM,OAAO;;AAE1G,QAAO;;;;;;;;;;;;;;;;;;;;AAoBR,SAAS,cAAc,cAAc,kBAAkB,aAAa;CACnE,MAAM,WAAW,UAAU,QAAQ,UAAU,YAAY;AACxD,SAAO,gBAAgB,UAAU,QAAQ,cAAc,UAAU,QAAQ;;AAE1E,QAAO;;AAER,SAAS,eAAe,UAAU,OAAO,gBAAgB;CACxD,MAAM,aAAa,SAAS,WAAW;AACvC,KAAI,CAAC,WAAY,OAAM,IAAI,MAAM,6BAA6B;CAC9D,IAAI,EAAE,OAAO,QAAQ;AACrB,SAAQ,SAAS;AACjB,OAAM,OAAO,WAAW;CACxB,MAAM,iBAAiB,WAAW,MAAM,OAAO,IAAI;CACnD,MAAM,qBAAqB,WAAW,MAAM,GAAG,MAAM;CACrD,MAAM,mBAAmB,WAAW,MAAM,IAAI;CAC9C,MAAM,cAAc,iBAAiB,SAAS,cAAc;EAC3D,GAAG,SAAS;EACZ,QAAQ,mBAAmB,OAAO,eAAe;EACjD,EAAE,gBAAgB,SAAS,OAAO;CACnC,MAAM,WAAW,YAAY;CAC7B,MAAM,OAAO,YAAY,OAAO;CAChC,MAAM,iBAAiB,mBAAmB;CAC1C,MAAM,qBAAqB,mBAAmB,SAAS,mBAAmB,mBAAmB,SAAS,GAAG,iBAAiB,iBAAiB,SAAS,iBAAiB,GAAG,kCAAkC,IAAI,MAAM,EAAE,aAAa;CACnO,MAAM,SAAS,UAAU;EACxB;EACA,GAAG;EACH,EAAE,eAAe,OAAO;AACzB,QAAO,iBAAiB,SAAS,cAAc;EAC9C,GAAG,SAAS;EACZ,QAAQ;GACP,GAAG;GACH;IACC,MAAM;IACN,GAAG;IACH;IACA,gBAAgB;IAChB,OAAO;IACP,MAAM,0BAA0B,EAAE,OAAO,UAAU,EAAE,SAAS;IAC9D;GACD,GAAG,iBAAiB,KAAK,QAAQ,WAAW;IAC3C,GAAG;IACH,OAAO,iBAAiB,QAAQ;IAChC,EAAE;GACH;EACD,EAAE,gBAAgB,SAAS,OAAO;;;;;;AAQpC,MAAM,2BAA2B;CAChC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;AAMD,MAAM,yBAAyB;AAC/B,SAAS,2BAA2B,MAAM;AACzC,QAAO,uBAAuB,KAAK,KAAK;;;;;AAKzC,SAAS,wBAAwB,MAAM;AACtC,QAAO,yBAAyB,SAAS,KAAK,aAAa,CAAC;;;;;;AAM7D,SAAS,qBAAqB,OAAO,oBAAoB;CACxD,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,KAAI,CAAC,WAAY,QAAO,EAAE;CAC1B,MAAM,QAAQ,EAAE;AAChB,MAAK,MAAM,UAAU,WAAW,QAAS,MAAK,MAAM,aAAa,OAAO,YAAY;AACnF,MAAI,sBAAsB,UAAU,OAAO,mBAAoB;AAC/D,MAAI,UAAU,KAAM,OAAM,KAAK,UAAU,KAAK,aAAa,CAAC;;AAE7D,QAAO;;;;;;;;;;AAUR,SAAS,sBAAsB,MAAM,OAAO,oBAAoB;AAC/D,KAAI,CAAC,KAAM;AACX,KAAI,CAAC,2BAA2B,KAAK,EAAE;EACtC,MAAM,aAAa,aAAa,KAAK;EACrC,MAAM,OAAO,cAAc,eAAe,QAAQ,2BAA2B,WAAW,GAAG,kBAAkB,WAAW,MAAM;AAC9H,QAAM,IAAI,MAAM,mBAAmB,KAAK,6DAA6D,uBAAuB,OAAO,IAAI,OAAO;;CAE/I,MAAM,YAAY,KAAK,aAAa;AACpC,KAAI,wBAAwB,KAAK,CAAE,OAAM,IAAI,MAAM,mBAAmB,KAAK,6CAA6C;AACxH,KAAI,qBAAqB,OAAO,mBAAmB,CAAC,SAAS,UAAU,CAAE,OAAM,IAAI,MAAM,mBAAmB,KAAK,4FAA4F;;AAE9M,SAAS,qBAAqB,cAAc,kBAAkB,OAAO;CACpE,MAAM,SAAS,EAAE;AACjB,KAAI,mBAAmB,iBAAiB,GAAI,QAAO;AACnD,KAAI;EACH,MAAM,QAAQ,KAAK,MAAM,aAAa;AACtC,MAAI,CAAC,mBAAmB,CAAC,OAAO,KAAK,MAAM,CAAC,OAAQ,QAAO,KAAK;GAC/D,SAAS;GACT,SAAS,EAAE,cAAc;GACzB,CAAC;SACK;AACP,SAAO,KAAK;GACX,SAAS;GACT,SAAS,EAAE,cAAc;GACzB,CAAC;;AAEH,QAAO;;AAER,SAAS,wBAAwB,QAAQ,cAAc,QAAQ,IAAI,mBAAmB,MAAM;CAC3F,MAAM,SAAS,EAAE;AACjB,KAAI,CAAC,oBAAoB,CAAC,QAAQ;AACjC,SAAO,KAAK;GACX,SAAS;GACT,SAAS,EAAE,QAAQ;GACnB,CAAC;AACF,SAAO;;AAER,KAAI,oBAAoB,CAAC,OAAQ,QAAO;CACxC,MAAM,mBAAmB,GAAG,WAAW,aAAa,GAAG,WAAW,MAAM,CAAC;AACzE,KAAI,CAAC,IAAI,OAAO,cAAc,iBAAiB,iBAAiB,CAAC,KAAK,OAAO,CAAE,QAAO,KAAK;EAC1F,SAAS,4CAA4C;EACrD,SAAS,EAAE,QAAQ;EACnB,CAAC;AACF,QAAO;;AAER,SAAS,gBAAgB,SAAS;CACjC,MAAM,SAAS,EAAE;AACjB,KAAI,CAAC,QAAQ,OAAQ,QAAO,KAAK;EAChC,SAAS;EACT,SAAS,EAAE,SAAS;EACpB,CAAC;CACF,MAAM,eAAe,QAAQ,QAAQ,KAAK,QAAQ,CAAC,GAAG,KAAK,GAAG,eAAe,IAAI,CAAC,EAAE,EAAE,CAAC;AACvF,QAAO,CAAC,GAAG,QAAQ,GAAG,aAAa;;AAEpC,SAAS,eAAe,KAAK;CAC5B,MAAM,SAAS,EAAE;AACjB,KAAI,CAAC,IAAI,KAAM,QAAO,KAAK;EAC1B,SAAS;EACT,SAAS,EAAE,QAAQ,KAAK;EACxB,CAAC;AACF,KAAI,CAAC,IAAI,WAAW,OAAQ,QAAO,KAAK;EACvC,SAAS;EACT,SAAS,EAAE,QAAQ,KAAK;EACxB,CAAC;CACF,MAAM,kBAAkB,IAAI,WAAW,QAAQ,KAAK,cAAc,CAAC,GAAG,KAAK,GAAG,wBAAwB,UAAU,CAAC,EAAE,EAAE,CAAC;AACtH,QAAO,CAAC,GAAG,QAAQ,GAAG,gBAAgB;;AAEvC,SAAS,wBAAwB,WAAW;CAC3C,MAAM,SAAS,EAAE;AACjB,KAAI,CAAC,UAAU,KAAM,QAAO,KAAK;EAChC,SAAS;EACT,SAAS,EAAE,WAAW;EACtB,CAAC;AACF,KAAI,CAAC,UAAU,OAAQ,QAAO,KAAK;EAClC,SAAS;EACT,SAAS,EAAE,WAAW;EACtB,CAAC;AACF,QAAO;;;;;;;AAOR,SAAS,kBAAkB,OAAO,UAAU;CAC3C,MAAM,MAAM,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,MAAM,MAAM,EAAE,OAAO,SAAS;AACzG,KAAI,CAAC,IAAK,OAAM,IAAI,MAAM,WAAW,SAAS,yCAAyC;AACvF,QAAO;;;;;;;AAOR,SAAS,qBAAqB,OAAO,aAAa;CACjD,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,KAAI,WAAY,MAAK,MAAM,OAAO,WAAW,SAAS;EACrD,MAAM,KAAK,IAAI,WAAW,MAAM,MAAM,EAAE,OAAO,YAAY;AAC3D,MAAI,GAAI,QAAO;;AAEhB,OAAM,IAAI,MAAM,cAAc,YAAY,yCAAyC;;;;;;;;AAQpF,SAAS,0BAA0B,OAAO,SAAS;CAClD,MAAM,UAAU,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,SAAS,QAAQ,IAAI,WAAW,SAAS,OAAO,GAAG,OAAO,QAAQ,MAAM,EAAE,OAAO,QAAQ,CAAC,CAAC,IAAI,EAAE;AAChL,KAAI,QAAQ,WAAW,EAAG,OAAM,IAAI,MAAM,oBAAoB,QAAQ,yCAAyC;AAC/G,KAAI,QAAQ,SAAS,EAAG,OAAM,IAAI,MAAM,oBAAoB,QAAQ,6CAA6C;AACjH,QAAO,QAAQ;;;;;;;AAOhB,SAAS,4BAA4B,OAAO,WAAW;CACtD,MAAM,UAAU,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,SAAS,QAAQ,IAAI,WAAW,SAAS,OAAO,GAAG,SAAS,QAAQ,MAAM,EAAE,OAAO,UAAU,CAAC,CAAC,IAAI,EAAE;AACpL,KAAI,QAAQ,WAAW,EAAG,OAAM,IAAI,MAAM,sBAAsB,UAAU,yCAAyC;AACnH,KAAI,QAAQ,SAAS,EAAG,OAAM,IAAI,MAAM,sBAAsB,UAAU,6CAA6C;AACrH,QAAO,QAAQ;;;;;;;AAOhB,SAAS,qBAAqB,OAAO,IAAI;AACxC,KAAI,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,MAAM,MAAM,EAAE,OAAO,GAAG,CAAE,OAAM,IAAI,MAAM,WAAW,GAAG,8CAA8C;;;;;;AAM1K,SAAS,wBAAwB,OAAO,IAAI;AAC3C,KAAI,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,MAAM,MAAM,EAAE,WAAW,MAAM,MAAM,EAAE,OAAO,GAAG,CAAC,CAAE,OAAM,IAAI,MAAM,cAAc,GAAG,8CAA8C;;;;;;;AAOvM,SAAS,6BAA6B,OAAO,IAAI;AAChD,KAAI,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,MAAM,MAAM,EAAE,WAAW,MAAM,MAAM,EAAE,OAAO,MAAM,MAAM,EAAE,OAAO,GAAG,CAAC,CAAC,CAAE,OAAM,IAAI,MAAM,oBAAoB,GAAG,8CAA8C;;;;;;;AAOnO,SAAS,+BAA+B,OAAO,IAAI;AAClD,KAAI,MAAM,eAAe,MAAM,eAAe,SAAS,IAAI,QAAQ,MAAM,MAAM,EAAE,WAAW,MAAM,MAAM,EAAE,SAAS,MAAM,MAAM,EAAE,OAAO,GAAG,CAAC,CAAC,CAAE,OAAM,IAAI,MAAM,sBAAsB,GAAG,8CAA8C;;AAEvO,SAAS,mBAAmB,YAAY;CACvC,MAAM,SAAS,EAAE;CACjB,MAAM,SAAS,OAAO,KAAK,WAAW;AACtC,MAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,kBAAkB,WAAW;AACnC,MAAI,CAAC,gBAAiB;EACtB,MAAM,MAAM,gBAAgB,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;EAC7D,IAAI,UAAU;AACd,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACpC,aAAU,UAAU,IAAI,IAAI,GAAG;AAC/B,OAAI,IAAI,GAAG,UAAU,QAAS,QAAO,KAAK;IACzC,SAAS,2BAA2B,IAAI,GAAG,MAAM,eAAe;IAChE,SAAS;KACR,UAAU;KACV,WAAW,IAAI;KACf,OAAO,IAAI,GAAG,OAAO;KACrB;IACD,CAAC;;;AAGJ,QAAO;;;;;;;;AAUR,SAAS,QAAQ,OAAO,OAAO;CAC9B,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,GAAG,CAAC;AACjD,MAAK,MAAM,MAAM,MAAO,KAAI,CAAC,IAAI,IAAI,GAAG,CAAE,OAAM,IAAI,MAAM,+BAA+B,GAAG,GAAG;CAC/F,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,MAAM,CAAC,CAAC;AAC3D,QAAO,MAAM,KAAK,MAAM,WAAW;EAClC;EACA;EACA,EAAE,CAAC,MAAM,GAAG,MAAM;AAClB,UAAQ,KAAK,IAAI,EAAE,KAAK,GAAG,IAAI,OAAO,qBAAqB,KAAK,IAAI,EAAE,KAAK,GAAG,IAAI,OAAO,qBAAqB,EAAE,QAAQ,EAAE;GACzH,CAAC,KAAK,EAAE,WAAW,KAAK;;AAE3B,MAAM,6BAA6B;CAClC,sBAAsB,OAAO,QAAQ;AACpC,QAAM,OAAO,OAAO,MAAM;;CAE3B,oBAAoB,OAAO,QAAQ;AAClC,QAAM,KAAK,OAAO,MAAM;;CAEzB,2BAA2B,OAAO,QAAQ;AACzC,QAAM,YAAY,OAAO,MAAM;;CAEhC,6BAA6B,OAAO,QAAQ;AAC3C,QAAM,cAAc,OAAO,MAAM;;CAElC,uBAAuB,OAAO,QAAQ;AACrC,QAAM,SAAS,MAAM,UAAU;GAC9B,MAAM;GACN,SAAS;GACT;AACD,QAAM,OAAO,OAAO,OAAO,MAAM;;CAElC,0BAA0B,OAAO,QAAQ;AACxC,QAAM,SAAS,MAAM,UAAU;GAC9B,MAAM;GACN,SAAS;GACT;AACD,QAAM,OAAO,UAAU,OAAO,MAAM;;CAErC;AACD,MAAM,6BAA6B;CAClC,mBAAmB,OAAO,QAAQ;AACjC,uBAAqB,OAAO,OAAO,MAAM,GAAG;AAC5C,QAAM,eAAe,MAAM,eAAe,SAAS,GAAG,QAAQ,KAAK;GAClE,IAAI,OAAO,MAAM;GACjB,MAAM,OAAO,MAAM;GACnB,aAAa,OAAO,MAAM,eAAe;GACzC,YAAY,EAAE;GACd,CAAC;;CAEH,uBAAuB,OAAO,QAAQ;EACrC,MAAM,eAAe,kBAAkB,OAAO,OAAO,MAAM,GAAG;AAC9D,eAAa,OAAO,OAAO,MAAM,QAAQ;;CAE1C,8BAA8B,OAAO,QAAQ;EAC5C,MAAM,eAAe,kBAAkB,OAAO,OAAO,MAAM,GAAG;AAC9D,eAAa,cAAc,OAAO,MAAM,eAAe;;CAExD,sBAAsB,OAAO,QAAQ;AACpC,oBAAkB,OAAO,OAAO,MAAM,GAAG;EACzC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,aAAW,UAAU,WAAW,QAAQ,QAAQ,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG;;CAE/E,wBAAwB,OAAO,QAAQ;EACtC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,aAAW,UAAU,QAAQ,WAAW,SAAS,OAAO,MAAM,MAAM;;CAErE;AACD,MAAM,qCAAqC;CAC1C,2BAA2B,OAAO,QAAQ;EACzC,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,YAAY;AACtE,+BAA6B,OAAO,OAAO,MAAM,GAAG;AACpD,WAAS,OAAO,KAAK;GACpB,IAAI,OAAO,MAAM;GACjB,MAAM,OAAO,MAAM,aAAa;GAChC,MAAM,OAAO,MAAM,aAAa;GAChC,aAAa,OAAO,MAAM,oBAAoB;GAC9C,UAAU,OAAO,MAAM,iBAAiB;GACxC,CAAC;;CAEH,+BAA+B,OAAO,QAAQ;EAC7C,MAAM,QAAQ,0BAA0B,OAAO,OAAO,MAAM,GAAG;AAC/D,QAAM,OAAO,OAAO,MAAM,aAAa;;CAExC,+BAA+B,OAAO,QAAQ;EAC7C,MAAM,QAAQ,0BAA0B,OAAO,OAAO,MAAM,GAAG;AAC/D,QAAM,OAAO,OAAO,MAAM,aAAa;;CAExC,sCAAsC,OAAO,QAAQ;EACpD,MAAM,QAAQ,0BAA0B,OAAO,OAAO,MAAM,GAAG;AAC/D,QAAM,cAAc,OAAO,MAAM,oBAAoB;;CAEtD,mCAAmC,OAAO,QAAQ;EACjD,MAAM,QAAQ,0BAA0B,OAAO,OAAO,MAAM,GAAG;AAC/D,QAAM,WAAW,OAAO,MAAM,iBAAiB;;CAEhD,8BAA8B,OAAO,QAAQ;EAC5C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,CAAC,WAAW,QAAQ,MAAM,QAAQ,IAAI,WAAW,MAAM,OAAO,GAAG,OAAO,MAAM,MAAM,EAAE,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC,CAAE,OAAM,IAAI,MAAM,oBAAoB,OAAO,MAAM,GAAG,yCAAyC;AAClN,OAAK,MAAM,OAAO,WAAW,QAAS,MAAK,MAAM,MAAM,IAAI,WAAY,IAAG,SAAS,GAAG,OAAO,QAAQ,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG;;CAEpI,gCAAgC,OAAO,QAAQ;EAC9C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,YAAY;AACtE,WAAS,SAAS,QAAQ,SAAS,QAAQ,OAAO,MAAM,MAAM;;CAE/D;AACD,MAAM,uCAAuC;CAC5C,6BAA6B,OAAO,QAAQ;EAC3C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,YAAY;AACtE,iCAA+B,OAAO,OAAO,MAAM,GAAG;AACtD,WAAS,SAAS,KAAK;GACtB,IAAI,OAAO,MAAM;GACjB,OAAO,OAAO,MAAM;GACpB,CAAC;;CAEH,gCAAgC,OAAO,QAAQ;EAC9C,MAAM,UAAU,4BAA4B,OAAO,OAAO,MAAM,GAAG;AACnE,UAAQ,QAAQ,OAAO,MAAM;;CAE9B,gCAAgC,OAAO,QAAQ;EAC9C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,CAAC,WAAW,QAAQ,MAAM,QAAQ,IAAI,WAAW,MAAM,OAAO,GAAG,SAAS,MAAM,MAAM,EAAE,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC,CAAE,OAAM,IAAI,MAAM,sBAAsB,OAAO,MAAM,GAAG,yCAAyC;AACtN,OAAK,MAAM,OAAO,WAAW,QAAS,MAAK,MAAM,MAAM,IAAI,WAAY,IAAG,WAAW,GAAG,SAAS,QAAQ,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG;;CAExI,kCAAkC,OAAO,QAAQ;EAChD,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,YAAY;AACtE,WAAS,WAAW,QAAQ,SAAS,UAAU,OAAO,MAAM,MAAM;;CAEnE;AACD,MAAM,gCAAgC;CACrC,sBAAsB,OAAO,QAAQ;AACpC,wBAAsB,OAAO,MAAM,MAAM,MAAM;AAC/C,0BAAwB,OAAO,OAAO,MAAM,GAAG;AAC/C,oBAAkB,OAAO,OAAO,MAAM,SAAS,CAAC,WAAW,KAAK;GAC/D,IAAI,OAAO,MAAM;GACjB,MAAM,OAAO,MAAM;GACnB,aAAa,OAAO,MAAM,eAAe;GACzC,QAAQ,OAAO,MAAM,UAAU;GAC/B,UAAU,OAAO,MAAM,YAAY,OAAO,MAAM,eAAe;GAC/D,SAAS,OAAO,MAAM,WAAW;GACjC,QAAQ,EAAE;GACV,UAAU,EAAE;GACZ,OAAO,OAAO,MAAM,SAAS;GAC7B,CAAC;;CAEH,0BAA0B,OAAO,QAAQ;AACxC,MAAI,OAAO,MAAM,KAAM,uBAAsB,OAAO,MAAM,MAAM,OAAO,OAAO,MAAM,GAAG;EACvF,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;AAC7D,WAAS,OAAO,OAAO,MAAM,QAAQ;;CAEtC,2BAA2B,OAAO,QAAQ;EACzC,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;EAC7D,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;EACtE,MAAM,gBAAgB,OAAO,KAAK,WAAW,MAAM;AACnD,MAAI,OAAO,MAAM,SAAS,CAAC,cAAc,SAAS,OAAO,MAAM,MAAM,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;AAC9H,WAAS,QAAQ,OAAO,MAAM,SAAS;;CAExC,4BAA4B,OAAO,QAAQ;EAC1C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;AAC7D,WAAS,SAAS,OAAO,MAAM,UAAU;;CAE1C,iCAAiC,OAAO,QAAQ;EAC/C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;AAC7D,WAAS,cAAc,OAAO,MAAM,eAAe;;CAEpD,8BAA8B,OAAO,QAAQ;EAC5C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;AAC7D,WAAS,WAAW,OAAO,MAAM,YAAY;;CAE9C,6BAA6B,OAAO,QAAQ;EAC3C,MAAM,WAAW,qBAAqB,OAAO,OAAO,MAAM,GAAG;AAC7D,WAAS,UAAU,OAAO,MAAM,WAAW;;CAE5C,uBAAuB,OAAO,QAAQ;EACrC,MAAM,eAAe,kBAAkB,OAAO,OAAO,MAAM,YAAY;EACvE,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;EACtE,MAAM,UAAU,WAAW,QAAQ,SAAS,QAAQ,IAAI,WAAW,QAAQ,OAAO,GAAG,OAAO,OAAO,MAAM,YAAY,CAAC;AACtH,MAAI,QAAQ,WAAW,EAAG,OAAM,IAAI,MAAM,cAAc,OAAO,MAAM,YAAY,yCAAyC;AAC1H,MAAI,QAAQ,SAAS,EAAG,OAAM,IAAI,MAAM,cAAc,OAAO,MAAM,YAAY,6CAA6C;EAC5H,MAAM,QAAQ,QAAQ;AACtB,OAAK,MAAM,OAAO,WAAW,QAAS,KAAI,aAAa,IAAI,WAAW,QAAQ,OAAO,GAAG,OAAO,OAAO,MAAM,YAAY;AACxH,eAAa,WAAW,KAAK,MAAM;;CAEpC,yBAAyB,OAAO,QAAQ;AACvC,uBAAqB,OAAO,OAAO,MAAM,GAAG;EAC5C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,OAAK,MAAM,OAAO,WAAW,QAAS,KAAI,aAAa,IAAI,WAAW,QAAQ,cAAc,UAAU,MAAM,OAAO,MAAM,GAAG;;CAE7H,iCAAiC,OAAO,QAAQ;EAC/C,MAAM,eAAe,kBAAkB,OAAO,OAAO,MAAM,SAAS;AACpE,eAAa,aAAa,QAAQ,aAAa,YAAY,OAAO,MAAM,MAAM;;CAE/E;AACD,MAAM,kCAAkC;CACvC,wBAAwB,OAAO,QAAQ;EACtC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,YAAW,MAAM,OAAO,MAAM,OAAO,SAAS,OAAO,MAAM;MACtH,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;;CAE7D,yBAAyB,OAAO,QAAQ;EACvC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,YAAW,MAAM,OAAO,MAAM,OAAO,eAAe,OAAO,MAAM;MAC5H,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;;CAE7D,yBAAyB,OAAO,QAAQ;EACvC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,YAAW,MAAM,OAAO,MAAM,OAAO,SAAS,KAAK;GAClH,IAAI,OAAO,MAAM;GACjB,OAAO,OAAO,MAAM;GACpB,CAAC;MACG,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;;CAE7D,4BAA4B,OAAO,QAAQ;EAC1C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,CAAC,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;EACxH,MAAM,UAAU,WAAW,MAAM,OAAO,MAAM,OAAO,SAAS,MAAM,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG;AAClG,MAAI,CAAC,QAAS,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,GAAG,wBAAwB,OAAO,MAAM,MAAM,GAAG;AAC9G,UAAQ,QAAQ,OAAO,MAAM;;CAE9B,4BAA4B,OAAO,QAAQ;EAC1C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,CAAC,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;EACxH,MAAM,aAAa,WAAW,MAAM,OAAO,MAAM;AACjD,MAAI,CAAC,WAAW,SAAS,MAAM,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,GAAG,wBAAwB,OAAO,MAAM,MAAM,GAAG;AAC/J,aAAW,WAAW,WAAW,SAAS,QAAQ,MAAM,EAAE,MAAM,OAAO,MAAM,GAAG;;CAEjF,8BAA8B,OAAO,QAAQ;EAC5C,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;AACtE,MAAI,CAAC,OAAO,KAAK,WAAW,MAAM,CAAC,SAAS,OAAO,MAAM,MAAM,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,QAAQ;EACxH,MAAM,aAAa,WAAW,MAAM,OAAO,MAAM;AACjD,aAAW,WAAW,QAAQ,WAAW,UAAU,OAAO,MAAM,MAAM;;CAEvE;AACD,MAAM,iCAAiC;CACtC,0BAA0B,OAAO,QAAQ;AACxC,QAAM,IAAI,MAAM,4DAA4D;;CAE7E,6BAA6B,OAAO,QAAQ;AAC3C,QAAM,IAAI,MAAM,+DAA+D;;CAEhF,6BAA6B,OAAO,QAAQ;AAC3C,QAAM,IAAI,MAAM,+DAA+D;;CAEhF,+BAA+B,OAAO,QAAQ;AAC7C,QAAM,IAAI,MAAM,iEAAiE;;CAElF,2BAA2B,OAAO,QAAQ;EACzC,MAAM,aAAa,MAAM,eAAe,MAAM,eAAe,SAAS;EACtE,MAAM,gBAAgB,WAAW,QAAQ,KAAK,YAAY;GACzD,GAAG;GACH,YAAY,OAAO,WAAW,KAAK,QAAQ;IAC1C,GAAG;IACH,QAAQ,GAAG,OAAO,KAAK,SAAS,EAAE,GAAG,KAAK,EAAE;IAC5C,UAAU,GAAG,SAAS,KAAK,QAAQ,EAAE,GAAG,IAAI,EAAE;IAC9C,EAAE;GACH,EAAE;EACH,MAAM,cAAc;GACnB,QAAQ;IACP,GAAG,WAAW,MAAM;IACpB,UAAU,WAAW,MAAM,OAAO,SAAS,KAAK,QAAQ,EAAE,GAAG,IAAI,EAAE;IACnE;GACD,OAAO;IACN,GAAG,WAAW,MAAM;IACpB,UAAU,WAAW,MAAM,MAAM,SAAS,KAAK,QAAQ,EAAE,GAAG,IAAI,EAAE;IAClE;GACD;EACD,MAAM,UAAU;GACf,SAAS,WAAW,UAAU;GAC9B,WAAW,EAAE;GACb,OAAO;GACP,SAAS;GACT;AACD,QAAM,eAAe,KAAK,QAAQ;;CAEnC;AACD,MAAM,6BAA6B,OAAO,WAAW;AACpD,KAAI,iBAAiB,OAAO,CAAE,QAAO;AACrC,SAAQ,OAAO,MAAf;EACC,KAAK;AACJ,4BAAyB,CAAC,MAAM,OAAO,MAAM;AAC7C,8BAA2B,sBAAsB,MAAM,QAAQ,OAAO;AACtE;EACD,KAAK;AACJ,0BAAuB,CAAC,MAAM,OAAO,MAAM;AAC3C,8BAA2B,oBAAoB,MAAM,QAAQ,OAAO;AACpE;EACD,KAAK;AACJ,iCAA8B,CAAC,MAAM,OAAO,MAAM;AAClD,8BAA2B,2BAA2B,MAAM,QAAQ,OAAO;AAC3E;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,OAAO,MAAM;AACpD,8BAA2B,6BAA6B,MAAM,QAAQ,OAAO;AAC7E;EACD,KAAK;AACJ,6BAA0B,CAAC,MAAM,OAAO,MAAM;AAC9C,8BAA2B,uBAAuB,MAAM,QAAQ,OAAO;AACvE;EACD,KAAK;AACJ,gCAA6B,CAAC,MAAM,OAAO,MAAM;AACjD,8BAA2B,0BAA0B,MAAM,QAAQ,OAAO;AAC1E;EACD,KAAK;AACJ,gCAA6B,CAAC,MAAM,OAAO,MAAM;AACjD,kCAA+B,0BAA0B,MAAM,QAAQ,OAAO;AAC9E;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,OAAO,MAAM;AACpD,kCAA+B,6BAA6B,MAAM,QAAQ,OAAO;AACjF;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,OAAO,MAAM;AACpD,kCAA+B,6BAA6B,MAAM,QAAQ,OAAO;AACjF;EACD,KAAK;AACJ,qCAAkC,CAAC,MAAM,OAAO,MAAM;AACtD,kCAA+B,+BAA+B,MAAM,QAAQ,OAAO;AACnF;EACD,KAAK;AACJ,OAAI,OAAO,KAAK,OAAO,MAAM,CAAC,SAAS,EAAG,OAAM,IAAI,MAAM,sDAAsD;AAChH,kCAA+B,2BAA2B,MAAM,QAAQ,OAAO;AAC/E;EACD,KAAK;AACJ,yBAAsB,CAAC,MAAM,OAAO,MAAM;AAC1C,8BAA2B,mBAAmB,MAAM,QAAQ,OAAO;AACnE;EACD,KAAK;AACJ,6BAA0B,CAAC,MAAM,OAAO,MAAM;AAC9C,8BAA2B,uBAAuB,MAAM,QAAQ,OAAO;AACvE;EACD,KAAK;AACJ,oCAAiC,CAAC,MAAM,OAAO,MAAM;AACrD,8BAA2B,8BAA8B,MAAM,QAAQ,OAAO;AAC9E;EACD,KAAK;AACJ,4BAAyB,CAAC,MAAM,OAAO,MAAM;AAC7C,8BAA2B,sBAAsB,MAAM,QAAQ,OAAO;AACtE;EACD,KAAK;AACJ,8BAA2B,CAAC,MAAM,OAAO,MAAM;AAC/C,8BAA2B,wBAAwB,MAAM,QAAQ,OAAO;AACxE;EACD,KAAK;AACJ,iCAA8B,CAAC,MAAM,OAAO,MAAM;AAClD,sCAAmC,2BAA2B,MAAM,QAAQ,OAAO;AACnF;EACD,KAAK;AACJ,qCAAkC,CAAC,MAAM,OAAO,MAAM;AACtD,sCAAmC,+BAA+B,MAAM,QAAQ,OAAO;AACvF;EACD,KAAK;AACJ,qCAAkC,CAAC,MAAM,OAAO,MAAM;AACtD,sCAAmC,+BAA+B,MAAM,QAAQ,OAAO;AACvF;EACD,KAAK;AACJ,4CAAyC,CAAC,MAAM,OAAO,MAAM;AAC7D,sCAAmC,sCAAsC,MAAM,QAAQ,OAAO;AAC9F;EACD,KAAK;AACJ,yCAAsC,CAAC,MAAM,OAAO,MAAM;AAC1D,sCAAmC,mCAAmC,MAAM,QAAQ,OAAO;AAC3F;EACD,KAAK;AACJ,oCAAiC,CAAC,MAAM,OAAO,MAAM;AACrD,sCAAmC,8BAA8B,MAAM,QAAQ,OAAO;AACtF;EACD,KAAK;AACJ,sCAAmC,CAAC,MAAM,OAAO,MAAM;AACvD,sCAAmC,gCAAgC,MAAM,QAAQ,OAAO;AACxF;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,OAAO,MAAM;AACpD,wCAAqC,6BAA6B,MAAM,QAAQ,OAAO;AACvF;EACD,KAAK;AACJ,sCAAmC,CAAC,MAAM,OAAO,MAAM;AACvD,wCAAqC,gCAAgC,MAAM,QAAQ,OAAO;AAC1F;EACD,KAAK;AACJ,sCAAmC,CAAC,MAAM,OAAO,MAAM;AACvD,wCAAqC,gCAAgC,MAAM,QAAQ,OAAO;AAC1F;EACD,KAAK;AACJ,wCAAqC,CAAC,MAAM,OAAO,MAAM;AACzD,wCAAqC,kCAAkC,MAAM,QAAQ,OAAO;AAC5F;EACD,KAAK;AACJ,4BAAyB,CAAC,MAAM,OAAO,MAAM;AAC7C,iCAA8B,sBAAsB,MAAM,QAAQ,OAAO;AACzE;EACD,KAAK;AACJ,gCAA6B,CAAC,MAAM,OAAO,MAAM;AACjD,iCAA8B,0BAA0B,MAAM,QAAQ,OAAO;AAC7E;EACD,KAAK;AACJ,iCAA8B,CAAC,MAAM,OAAO,MAAM;AAClD,iCAA8B,2BAA2B,MAAM,QAAQ,OAAO;AAC9E;EACD,KAAK;AACJ,kCAA+B,CAAC,MAAM,OAAO,MAAM;AACnD,iCAA8B,4BAA4B,MAAM,QAAQ,OAAO;AAC/E;EACD,KAAK;AACJ,uCAAoC,CAAC,MAAM,OAAO,MAAM;AACxD,iCAA8B,iCAAiC,MAAM,QAAQ,OAAO;AACpF;EACD,KAAK;AACJ,oCAAiC,CAAC,MAAM,OAAO,MAAM;AACrD,iCAA8B,8BAA8B,MAAM,QAAQ,OAAO;AACjF;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,OAAO,MAAM;AACpD,iCAA8B,6BAA6B,MAAM,QAAQ,OAAO;AAChF;EACD,KAAK;AACJ,6BAA0B,CAAC,MAAM,OAAO,MAAM;AAC9C,iCAA8B,uBAAuB,MAAM,QAAQ,OAAO;AAC1E;EACD,KAAK;AACJ,+BAA4B,CAAC,MAAM,OAAO,MAAM;AAChD,iCAA8B,yBAAyB,MAAM,QAAQ,OAAO;AAC5E;EACD,KAAK;AACJ,uCAAoC,CAAC,MAAM,OAAO,MAAM;AACxD,iCAA8B,iCAAiC,MAAM,QAAQ,OAAO;AACpF;EACD,KAAK;AACJ,8BAA2B,CAAC,MAAM,OAAO,MAAM;AAC/C,mCAAgC,wBAAwB,MAAM,QAAQ,OAAO;AAC7E;EACD,KAAK;AACJ,+BAA4B,CAAC,MAAM,OAAO,MAAM;AAChD,mCAAgC,yBAAyB,MAAM,QAAQ,OAAO;AAC9E;EACD,KAAK;AACJ,+BAA4B,CAAC,MAAM,OAAO,MAAM;AAChD,mCAAgC,yBAAyB,MAAM,QAAQ,OAAO;AAC9E;EACD,KAAK;AACJ,kCAA+B,CAAC,MAAM,OAAO,MAAM;AACnD,mCAAgC,4BAA4B,MAAM,QAAQ,OAAO;AACjF;EACD,KAAK;AACJ,kCAA+B,CAAC,MAAM,OAAO,MAAM;AACnD,mCAAgC,4BAA4B,MAAM,QAAQ,OAAO;AACjF;EACD,KAAK;AACJ,oCAAiC,CAAC,MAAM,OAAO,MAAM;AACrD,mCAAgC,8BAA8B,MAAM,QAAQ,OAAO;AACnF;EACD,QAAS,QAAO;;;AAGlB,MAAM,uBAAuB,cAAc,0BAA0B;AAGrE,MAAM,oBAAoB,IAAI,IAAI,CAAC,QAAQ,WAAW,CAAC;AACvD,SAAS,SAAS,MAAM;AACvB,QAAO,IAAI,SAAS,SAAS,WAAW;AACvC,MAAI,OAAO,KAAK,QAAQ,MAAM,OAAO,IAAI,GAAG,QAAQ,IAAI,CAAC;GACxD;;AAEH,SAAS,WAAW,MAAM;AACzB,QAAO,IAAI,SAAS,SAAS,WAAW;AACvC,QAAM,OAAO,KAAK,QAAQ,MAAM,OAAO,IAAI,GAAG,QAAQ,IAAI,CAAC;GAC1D;;AAEH,MAAM,YAAY;AAClB,SAAS,eAAe,GAAG;AAC1B,KAAI,EAAE,WAAW,KAAK,EAAE,SAAS,MAAM,EAAG,QAAO;AACjD,QAAO,UAAU,KAAK,EAAE;;AAEzB,SAAS,yBAAyB,GAAG;CACpC,MAAM,MAAM,IAAI,WAAW,EAAE,OAAO;AACpC,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,KAAK,EAAE,WAAW,EAAE,GAAG;AAC9D,QAAO;;AAER,SAAS,mBAAmB,GAAG;AAC9B,KAAI,OAAO,SAAS,WAAY,QAAO,yBAAyB,KAAK,EAAE,CAAC;CACxE,MAAM,aAAa,WAAW;AAC9B,KAAI,CAAC,WAAY,OAAM,IAAI,MAAM,4FAA4F;AAC7H,QAAO,WAAW,KAAK,GAAG,SAAS;;AAEpC,eAAe,aAAa,OAAO;AAClC,KAAI,iBAAiB,WAAY,QAAO;AACxC,KAAI,iBAAiB,YAAa,QAAO,IAAI,WAAW,MAAM;AAC9D,KAAI,OAAO,SAAS,eAAe,iBAAiB,KAAM,QAAO,IAAI,WAAW,MAAM,MAAM,aAAa,CAAC;AAC1G,KAAI,MAAM,QAAQ,MAAM,CAAE,QAAO,IAAI,WAAW,MAAM;AACtD,KAAI,OAAO,UAAU,SAAU,QAAO,eAAe,MAAM,GAAG,mBAAmB,MAAM,GAAG,yBAAyB,MAAM;AACzH,OAAM,IAAI,MAAM,6BAA6B;;AAE9C,SAAS,UAAU,OAAO;AACzB,QAAO,QAAQ,KAAK,UAAU,OAAO,MAAM,EAAE,CAAC;;AAE/C,eAAe,UAAU,UAAU;AAClC,QAAO,SAAS;EACf,eAAe,UAAU,SAAS,OAAO;EACzC,cAAc,UAAU,SAAS,gBAAgB,EAAE,CAAC;EACpD,sBAAsB,UAAU,SAAS,SAAS,EAAE,CAAC;EACrD,mBAAmB,UAAU,uCAAuC,SAAS,WAAW,CAAC;EACzF,CAAC;;AA8BH,eAAe,qBAAqB,UAAU,OAAO;CACpD,MAAM,OAAO,MAAM,UAAU,SAAS;CACtC,MAAM,WAAW,MAAM,MAAM,gBAAgB;AAC7C,OAAM,SAAS,MAAM,IAAI,WAAW,KAAK,CAAC;AAC1C,OAAM,SAAS,OAAO;;AAEvB,SAAS,UAAU,OAAO,MAAM;CAC/B,MAAM,QAAQ,MAAM;AACpB,KAAI,CAAC,MAAO,OAAM,IAAI,MAAM,GAAG,KAAK,4BAA4B;AAChE,QAAO,UAAU,MAAM;;AAExB,eAAe,gBAAgB,MAAM,SAAS,SAAS;CACtD,MAAM,QAAQ,MAAM,WAAW,KAAK;AACpC,KAAI,CAAC,MAAM,cAAe,OAAM,IAAI,MAAM,0BAA0B;CACpE,MAAM,eAAe,KAAK,MAAM,UAAU,OAAO,aAAa,CAAC;AAC/D,KAAI,CAAC,MAAM,eAAgB,OAAM,IAAI,MAAM,0DAA0D;CACrG,MAAM,SAAS,KAAK,MAAM,UAAU,OAAO,cAAc,CAAC;AAC1D,KAAI,CAAC,MAAM,mBAAoB,OAAM,IAAI,MAAM,+BAA+B;CAC9E,MAAM,oBAAoB,iCAAiC,KAAK,MAAM,UAAU,OAAO,kBAAkB,CAAC,CAAC;CAC3G,MAAM,kBAAkB,mBAAmB,kBAAkB;AAC7D,KAAI,gBAAgB,QAAQ;EAC3B,MAAM,gBAAgB,gBAAgB,KAAK,QAAQ,IAAI,QAAQ;AAC/D,QAAM,IAAI,MAAM,cAAc,KAAK,KAAK,CAAC;;AAE1C,QAAO;EACN,GAAG,eAAe,cAAc,OAAO,YAAY,OAAO,QAAQ,kBAAkB,CAAC,QAAQ,CAAC,WAAW,CAAC,kBAAkB,IAAI,MAAM,CAAC,CAAC,EAAE,SAAS,QAAQ,KAAK,GAAG,EAAE,EAAE,QAAQ;EAC/K,YAAY;EACZ;;AAEF,eAAe,kBAAkB,OAAO,SAAS,SAAS;AACzD,QAAO,gBAAgB,MAAM,aAAa,MAAM,EAAE,SAAS,QAAQ;;AAEpE,MAAM,8BAA8B,UAAU;AAC7C,QAAO,kBAAkB,OAAO,qBAAqB;;AAEtD,MAAM,iCAAiC,UAAU,UAAU;AAC1D,QAAO,qBAAqB,UAAU,MAAM;;;;;AAmB7C,SAAS,mBAAmB;AAC3B,QAAO,EAAE;;;;;AAKV,SAAS,uBAAuB;AAC/B,QAAO;EACN,SAAS;EACT,MAAM;GACL,WAAW;GACX,UAAU;GACV;EACD;;;;;AAKF,SAAS,mBAAmB;AAC3B,QAAO;EACN,MAAM,kBAAkB;EACxB,UAAU,sBAAsB;EAChC;;;;;AAKF,SAAS,gBAAgB,MAAM;AAC9B,QAAO;EACN,GAAG,kBAAkB;EACrB,GAAG;EACH;;;;;AAKF,SAAS,oBAAoB,UAAU;AACtC,QAAO;EACN,GAAG,sBAAsB;EACzB,GAAG;EACH;;;;;AAKF,SAAS,gBAAgB,MAAM,UAAU;AACxC,QAAO;EACN,MAAM,gBAAgB,KAAK;EAC3B,UAAU,oBAAoB,SAAS;EACvC;;AAEF,SAAS,qBAAqB;AAC7B,QAAO;EACN,GAAG,kBAAkB;EACrB,QAAQ;GACP,MAAM;GACN,SAAS;GACT;EACD,aAAa;EACb,WAAW;EACX,IAAI;EACJ,MAAM;EACN,gBAAgB,EAAE;EAClB;;AAEF,SAAS,oBAAoB;AAC5B,QAAO,EAAE;;AASV,SAAS,kBAAkB,OAAO;AACjC,QAAO;EACN,GAAG,oBAAoB;EACvB,GAAG,SAAS,EAAE;EACd;;AAEF,SAAS,iBAAiB,OAAO;AAChC,QAAO;EACN,GAAG,mBAAmB;EACtB,GAAG,SAAS,EAAE;EACd;;AAEF,SAAS,YAAY,WAAW,aAAa,YAAY;AACxD,QAAO;EACN,GAAG,gBAAgB,WAAW,MAAM,WAAW,SAAS;EACxD,QAAQ,kBAAkB,YAAY;EACtC,OAAO,iBAAiB,WAAW;EACnC;;;;ACliHF,MAAMC,mBAAiB,UAAU;AAChC,QAAO,qBAAqB,MAAM;;AAEnC,MAAMC,yBAAuB,UAAU;AACtC,4BAA2B,MAAM;;AAElC,MAAMC,sBAAoB,aAAa;AACtC,QAAO,wBAAwB,SAAS;;AAEzC,MAAMC,4BAA0B,aAAa;AAC5C,+BAA8B,SAAS;;AAExC,MAAM,4BAA4B,UAAU;AAC3C,QAAO;EACN,GAAG,kBAAkB;EACrB,QAAQ;GACP,GAAG;GACH,GAAG,OAAO,UAAU,EAAE;GACtB;EACD,OAAO;GACN,GAAG;GACH,GAAG,OAAO,SAAS,EAAE;GACrB;EACD;;AAEF,SAAS,4BAA4B,OAAO;AAC3C,QAAO,mBAAmB,0BAA0B,OAAO,0BAA0B;;AAItF,MAAM,QAAQ;CACb,eAAe;CACf,aAAa;CACb,gBAAgB;CAChB,eAAe;CACf,kBAAkB;CAClB,eAAA;CACA,qBAAA;CACA,kBAAA;CACA,wBAAA;CACA;AACD,MAAM,mCAAmC;CACxC,SAAS;CACT,eAAe,YAAY,kBAAkB,EAAE,yBAAyB;CACxE;CACA;CACA;CAG0B,MAAM,qBAAqB;CACrD;CACA;CACA,YAAY,EAAE;CACd,YAAY,QAAQ,iBAAiB;AACpC,OAAK,SAAS;AACd,OAAK,YAAY,mBAAmB,OAAO,MAAM,gBAAgB;AACjE,OAAK,MAAM,cAAc,KAAK,OAAO,QAAS,QAAO,eAAe,MAAM,YAAY,EAAE,QAAQ,UAAU;GACzG,MAAM,SAAS,KAAK,OAAO,QAAQ,YAAY,MAAM;AACrD,QAAK,YAAY,KAAK,OAAO,QAAQ,KAAK,WAAW,OAAO;AAC5D,QAAK,iBAAiB;AACtB,UAAO;KACL,CAAC;;CAEL,IAAI,WAAW;AACd,SAAO,KAAK;;CAEb,IAAI,SAAS;AACZ,SAAO,KAAK,SAAS;;CAEtB,IAAI,QAAQ;AACX,SAAO,KAAK,SAAS;;CAEtB,IAAI,eAAe;AAClB,SAAO,KAAK,SAAS;;CAEtB,IAAI,aAAa;AAChB,SAAO,KAAK,SAAS;;CAEtB,IAAI,YAAY;AACf,SAAO,KAAK,SAAS;;CAEtB,SAAS,UAAU;AAClB,OAAK,UAAU,KAAK,SAAS;AAC7B,eAAa;AACZ,QAAK,YAAY,KAAK,UAAU,QAAQ,MAAM,MAAM,SAAS;;;CAG/D,kBAAkB;AACjB,MAAI,KAAK,UAAU,WAAW,EAAG;EACjC,MAAM,QAAQ,EAAE,UAAU,KAAK,WAAW;AAC1C,OAAK,MAAM,YAAY,KAAK,UAAW,UAAS,MAAM;;CAEvD,OAAO,iBAAiB,QAAQ;AAC/B,SAAO,cAAc,qBAAqB;GACzC,YAAY,iBAAiB;AAC5B,UAAM,QAAQ,gBAAgB;;;;GAKmB,iBAAiB,iCAAiC;AAGvG,MAAM,WAAW;AACjB,MAAM,MAAM,IAAI,KAAK,eAAe,KAAK,GAAG;CAC3C,QAAQ;CACR,MAAM;CACN,QAAQ;CACR,QAAQ;CACR,wBAAwB;CACxB,CAAC;AACF,MAAM,aAAa,OAAO,iBAAiB;AAC1C,KAAI,UAAU,QAAQ,UAAU,KAAK,EAAG,QAAO;AAC/C,KAAI,OAAO,UAAU,SAAU,QAAO;AACtC,KAAI,iBAAiB,OAAO;EAC3B,MAAM,OAAO,GAAG,MAAM,KAAK,IAAI,MAAM;AACrC,SAAO,gBAAgB,MAAM,QAAQ,GAAG,KAAK,IAAI,MAAM,UAAU;;AAElE,KAAI,OAAO,UAAU,SAAU,KAAI;AAClC,SAAO,KAAK,UAAU,MAAM;SACrB;AACP,SAAO,OAAO,UAAU,SAAS,KAAK,MAAM;;AAE7C,KAAI,OAAO,UAAU,YAAY;EAChC,MAAM,OAAO,MAAM;AACnB,SAAO,OAAO,GAAG,KAAK,MAAM;;AAE7B,QAAO,OAAO,MAAM;;AAErB,MAAM,iBAAiB,WAAW,SAAS,cAAc,iBAAiB;CACzE,MAAM,OAAO,EAAE;CACf,MAAM,eAAe,EAAE;CACvB,IAAI;AACJ,SAAQ,UAAU,SAAS,KAAK,QAAQ,MAAM,MAAM;EACnD,MAAM,YAAY,QAAQ;AAC1B,MAAI,aAAa,QAAQ,UAAU,KAAK,IAAI;AAC3C,gBAAa,KAAK,UAAU;AAC5B,QAAK,aAAa,aAAa,aAAa,SAAS;;;AAGvD,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,CAAE,WAAU,QAAQ,WAAW,IAAI,OAAO,UAAU,OAAO,aAAa,CAAC;CACxH,MAAM,SAAS,aAAa,MAAM,aAAa,OAAO;AACtD,KAAI,OAAO,SAAS,EAAG,WAAU,GAAG,QAAQ,GAAG,OAAO,KAAK,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,KAAK,IAAI;AACtG,KAAI,UAAU,SAAS,EAAG,WAAU,GAAG,UAAU,GAAG;CACpD,MAAM,sBAAsB,IAAI,MAAM;AACtC,MAAK,eAAe,IAAI,OAAO,IAAI;AACnC,QAAO,CAAC,SAAS,KAAK;;AAEvB,MAAM,aAAa;CAClB,SAAS;CACT,OAAO;CACP,MAAM;CACN,MAAM;CACN,OAAO;CACP;AAwDD,MAAM,SAAS,IAvDK,MAAM,cAAc;CACvC;CACA;CACA,SAAS,WAAW;CACpB;CACA,YAAY,MAAM,SAAS;AAC1B,QAAA,OAAa,QAAQ,EAAE;AACvB,QAAA,YAAkB,MAAA,KAAW,KAAK,QAAQ,IAAI,IAAI,GAAG,CAAC,KAAK,GAAG;AAC9D,OAAK,eAAe,kBAAkB;;CAEvC,IAAI,QAAQ;AACX,SAAO,OAAO,KAAK,WAAW,CAAC,MAAM,QAAQ,WAAW,SAAS,MAAA,MAAY;;CAE9E,IAAI,MAAM,OAAO;AAChB,QAAA,QAAc,WAAW;;CAE1B,MAAM,MAAM;EACX,MAAM,SAAS,IAAI,cAAc,CAAC,GAAG,MAAA,MAAY,GAAG,KAAK,EAAE,KAAK,aAAa;AAC7E,SAAO,QAAQ,KAAK;AACpB,SAAO;;CAER,KAAA,eAAoB;AACnB,SAAO,MAAA,SAAe,WAAW;;CAElC,QAAQ,SAAS,GAAG,cAAc;AACjC,MAAI,MAAA,SAAe,WAAW,SAAS;GACtC,MAAM,CAAC,kBAAkB,QAAQ,cAAc,MAAA,WAAiB,SAAS,cAAc,MAAA,aAAmB;AAC1G,WAAQ,MAAM,IAAI,KAAK,aAAa,IAAI,mBAAmB;;;CAG7D,MAAM,SAAS,GAAG,cAAc;AAC/B,MAAI,MAAA,SAAe,WAAW,OAAO;GACpC,MAAM,CAAC,kBAAkB,QAAQ,cAAc,MAAA,WAAiB,SAAS,cAAc,MAAA,aAAmB;AAC1G,WAAQ,MAAM,IAAI,KAAK,aAAa,IAAI,mBAAmB;;;CAG7D,KAAK,SAAS,GAAG,cAAc;AAC9B,MAAI,MAAA,SAAe,WAAW,MAAM;GACnC,MAAM,CAAC,kBAAkB,QAAQ,cAAc,MAAA,WAAiB,SAAS,cAAc,MAAA,aAAmB;AAC1G,WAAQ,KAAK,IAAI,KAAK,aAAa,IAAI,mBAAmB;;;CAG5D,KAAK,SAAS,GAAG,cAAc;AAC9B,MAAI,MAAA,SAAe,WAAW,MAAM;GACnC,MAAM,CAAC,kBAAkB,QAAQ,cAAc,MAAA,WAAiB,SAAS,cAAc,MAAA,aAAmB;AAC1G,WAAQ,KAAK,IAAI,KAAK,aAAa,IAAI,mBAAmB;;;CAG5D,MAAM,SAAS,GAAG,cAAc;AAC/B,MAAI,MAAA,SAAe,WAAW,OAAO;GACpC,MAAM,CAAC,kBAAkB,QAAQ,cAAc,MAAA,WAAiB,SAAS,cAAc,MAAA,aAAmB;AAC1G,WAAQ,MAAM,IAAI,KAAK,aAAa,IAAI,mBAAmB;;;GAI5B;;;AClNlC,IAAI,YAAY,OAAO;AACvB,IAAI,eAAe,KAAK,eAAe;CACtC,IAAI,SAAS,EAAE;AACf,MAAK,IAAI,QAAQ,IAAK,WAAU,QAAQ,MAAM;EAC7C,KAAK,IAAI;EACT,YAAY;EACZ,CAAC;AACF,KAAI,CAAC,WAAY,WAAU,QAAQ,OAAO,aAAa,EAAE,OAAO,UAAU,CAAC;AAC3E,QAAO;;AAIR,MAAM,6BAA6B;AAGnC,MAAM,uBAAuB,MAAM,MAAM,KAAK,KAAK,MAAM;AACzBK,KAAO,CAAC,QAAQ,MAAM,oBAAoB,EAAE,CAAC;AAC7E,MAAM,wBAAwBC,MAAO;CACpC;CACA;CACA;CACA;CACA;CACA;CACA,CAAC;AACF,MAAM,oBAAoBA,MAAO,CAAC,gBAAgB,CAAC;AACnD,SAAS,qBAAqB;AAC7B,QAAOC,OAAS;EACf,cAAcC,QAAU;EACxB,IAAIA,QAAU;EACd,MAAMA,QAAU;EAChB,cAAcA,QAAU,CAAC,SAAS;EAClC,CAAC;;AAEH,SAAS,uBAAuB;AAC/B,QAAOD,OAAS;EACf,IAAIC,QAAU;EACd,MAAMA,QAAU;EAChB,cAAcA,QAAU,CAAC,SAAS;EAClC,CAAC;;AAEH,SAAS,yBAAyB;AACjC,QAAOD,OAAS,EAAE,UAAU,qBAAqB,EAAE,CAAC;;AAErD,SAAS,wBAAwB;AAChC,QAAOA,OAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;;AAEnD,SAAS,sBAAsB;AAC9B,QAAOA,OAAS;EACf,OAAOC,QAAU;EACjB,UAAUA,QAAU;EACpB,YAAYA,QAAU,CAAC,SAAS;EAChC,oBAAoBA,QAAU,CAAC,SAAS;EACxC,CAAC;;AAEH,SAAS,wBAAwB;AAChC,QAAOD,OAAS,EAAE,IAAIC,QAAU,EAAE,CAAC;;AAEpC,SAAS,gCAAgC;AACxC,QAAOD,OAAS;EACf,YAAYE,QAAU,0BAA0B,CAAC,UAAU;EAC3D,kBAAkBC,SAAW;EAC7B,WAAWC,MAAQ,gBAAgB,CAAC;EACpC,aAAaH,QAAU,CAAC,UAAU;EAClC,UAAUG,MAAQ,eAAe,CAAC;EAClC,CAAC;;AAEH,SAAS,2BAA2B;AACnC,QAAOJ,OAAS;EACf,YAAYE,QAAU,qBAAqB,CAAC,UAAU;EACtD,MAAMD,QAAU,CAAC,UAAU;EAC3B,MAAMA,QAAU;EAChB,OAAOG,MAAQ,YAAY,CAAC;EAC5B,CAAC;;AAEH,SAAS,iBAAiB;AACzB,QAAOJ,OAAS;EACf,YAAYE,QAAU,WAAW,CAAC,UAAU;EAC5C,cAAcD,QAAU;EACxB,IAAIA,QAAU;EACd,MAAMA,QAAU;EAChB,MAAMA,QAAU;EAChB,cAAcA,QAAU,CAAC,UAAU;EACnC,CAAC;;AAEH,SAAS,mBAAmB;AAC3B,QAAOD,OAAS;EACf,YAAYE,QAAU,aAAa,CAAC,UAAU;EAC9C,IAAID,QAAU;EACd,MAAMA,QAAU;EAChB,MAAMA,QAAU;EAChB,cAAcA,QAAU,CAAC,UAAU;EACnC,CAAC;;AAEH,SAAS,iBAAiB;AACzB,QAAOD,OAAS;EACf,YAAYE,QAAU,WAAW,CAAC,UAAU;EAC5C,OAAOC,SAAW;EAClB,UAAU,wBAAwB,CAAC,UAAU;EAC7C,QAAQ,sBAAsB;EAC9B,OAAOF,QAAU,CAAC,UAAU;EAC5B,YAAYA,QAAU;EACtB,QAAQE,SAAW;EACnB,CAAC;;AAEH,SAAS,sBAAsB;AAC9B,QAAOH,OAAS;EACf,OAAOG,SAAW;EAClB,UAAU,6BAA6B,CAAC,SAAS;EACjD,QAAQ,2BAA2B;EACnC,OAAOF,QAAU,CAAC,SAAS;EAC3B,YAAYA,QAAU;EACtB,QAAQE,SAAW;EACnB,CAAC;;AAEH,SAAS,yBAAyB;AACjC,QAAOH,OAAS;EACf,YAAYE,QAAU,mBAAmB,CAAC,UAAU;EACpD,MAAMD,QAAU,CAAC,UAAU;EAC3B,MAAMA,QAAU,CAAC,UAAU;EAC3B,iBAAiB,sBAAsB,UAAU;EACjD,CAAC;;AAEH,SAAS,8BAA8B;AACtC,QAAOD,OAAS;EACf,MAAMC,QAAU,CAAC,SAAS;EAC1B,MAAMA,QAAU,CAAC,SAAS;EAC1B,iBAAiB,sBAAsB,SAAS;EAChD,CAAC;;AAEH,SAAS,uBAAuB;AAC/B,QAAOD,OAAS;EACf,YAAYE,QAAU,iBAAiB,CAAC,UAAU;EAClD,QAAQE,MAAQH,QAAU,CAAC,CAAC,UAAU;EACtC,YAAYG,MAAQH,QAAU,CAAC,CAAC,UAAU;EAC1C,cAAcG,MAAQH,QAAU,CAAC;EACjC,OAAOG,MAAQH,QAAU,CAAC,CAAC,UAAU;EACrC,CAAC;;AAEH,SAAS,4BAA4B;AACpC,QAAOD,OAAS;EACf,QAAQI,MAAQH,QAAU,CAAC,CAAC,SAAS;EACrC,YAAYG,MAAQH,QAAU,CAAC,CAAC,SAAS;EACzC,cAAcG,MAAQH,QAAU,CAAC,CAAC,SAAS;EAC3C,OAAOG,MAAQH,QAAU,CAAC,CAAC,SAAS;EACpC,CAAC;;AAEH,SAAS,sBAAsB;AAC9B,QAAOD,OAAS;EACf,WAAWC,QAAU;EACrB,oBAAoBA,QAAU,CAAC,SAAS;EACxC,CAAC;;AAEH,SAAS,aAAa;AACrB,QAAOI,MAAQ,CAAC,gBAAgB,EAAE,kBAAkB,CAAC,CAAC;;AAEvD,SAAS,iCAAiC;AACzC,QAAOL,OAAS;EACf,YAAYE,QAAU,2BAA2B,CAAC,UAAU;EAC5D,UAAUD,QAAU;EACpB,YAAYA,QAAU;EACtB,KAAKA,QAAU;EACf,CAAC;;AAEH,SAAS,sCAAsC;AAC9C,QAAOD,OAAS;EACf,UAAUC,QAAU;EACpB,YAAYA,QAAU;EACtB,KAAKA,QAAU;EACf,CAAC;;AAEH,SAAS,4BAA4B;AACpC,QAAOD,OAAS,EAAE,YAAYC,QAAU,EAAE,CAAC;;AAE5C,SAAS,2BAA2B;AACnC,QAAOD,OAAS,EAAE,WAAWC,QAAU,EAAE,CAAC;;AAE3C,SAAS,iCAAiC;AACzC,QAAOD,OAAS,EAAE,kBAAkBG,SAAW,EAAE,CAAC;;AAEnD,SAAS,0BAA0B;AAClC,QAAOH,OAAS,EAAE,MAAMC,QAAU,EAAE,CAAC;;AAEtC,SAAS,0BAA0B;AAClC,QAAOD,OAAS,EAAE,MAAMC,QAAU,EAAE,CAAC;;AAEtC,SAAS,4BAA4B;AACpC,QAAOD,OAAS,EAAE,MAAMC,QAAU,EAAE,CAAC;;AAEtC,SAAS,gBAAgB;AACxB,QAAOD,OAAS;EACf,YAAYE,QAAU,UAAU,CAAC,UAAU;EAC3C,MAAM,mBAAmB,CAAC,UAAU;EACpC,IAAID,QAAU;EACd,MAAM;EACN,CAAC;;AAEH,SAAS,qBAAqB;AAC7B,QAAOD,OAAS;EACf,MAAM,qCAAqC,CAAC,SAAS;EACrD,IAAIC,QAAU;EACd,MAAM;EACN,CAAC;;AAEH,SAAS,oBAAoB;AAC5B,QAAO,gCAAgC;;AAExC,SAAS,wBAAwB;AAChC,QAAOD,OAAS;EACf,cAAcC,QAAU,CAAC,SAAS;EAClC,IAAIA,QAAU;EACd,MAAMA,QAAU,CAAC,SAAS;EAC1B,cAAcA,QAAU,CAAC,SAAS;EAClC,CAAC;;AAEH,SAAS,wBAAwB;AAChC,QAAOD,OAAS;EACf,IAAIC,QAAU;EACd,MAAMA,QAAU,CAAC,SAAS;EAC1B,cAAcA,QAAU,CAAC,SAAS;EAClC,CAAC;;AAIH,SAAS,QAAQ,OAAO;AACvB,KAAI,SAAS,OAAO,UAAU,YAAY,0BAA0B,MAAO,QAAO,aAAa,YAAY,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;AAClJ,QAAO,aAAa,YAAY,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,oBAAoB,SAAS;;AAEpF,MAAM,aAAa,UAAU,aAAa,cAAc,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,sBAAsB,SAAS;AAC7G,MAAM,cAAc,UAAU,aAAa,eAAe,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,uBAAuB,SAAS;AAChH,MAAM,cAAc,UAAU,aAAa,eAAe,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,uBAAuB,SAAS;AAChH,MAAM,cAAc,UAAU,aAAa,eAAe,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,uBAAuB,SAAS;AAChH,MAAM,YAAY,UAAU,aAAa,aAAa,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,qBAAqB,SAAS;AAC1G,MAAM,YAAY,UAAU,aAAa,aAAa,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,qBAAqB,SAAS;AAG1G,MAAM,gBAAgB,UAAU,aAAa,kBAAkB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yBAAyB,SAAS;AACvH,MAAM,gBAAgB,UAAU,aAAa,kBAAkB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,yBAAyB,SAAS;AACvH,MAAM,kBAAkB,UAAU,aAAa,oBAAoB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,2BAA2B,QAAQ;AAC5H,MAAM,uBAAuB,UAAU,aAAa,yBAAyB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,gCAAgC,QAAQ;AAC3I,MAAM,eAAe,UAAU,aAAa,gBAAgB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,wBAAwB,QAAQ;AAClH,MAAM,kBAAkB,UAAU,aAAa,mBAAmB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,2BAA2B,QAAQ;AAC3H,MAAM,cAAc,UAAU,aAAa,eAAe,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,uBAAuB,QAAQ;AAC/G,MAAM,iBAAiB,UAAU,aAAa,kBAAkB,EAAE,GAAG,OAAO,EAAE,KAAK,GAAG,0BAA0B,QAAQ;AAGxH,IAAI,mBAAmC,4BAAY;CAClD,eAAe;CACf,iBAAiB;CACjB,mBAAmB;CACnB,kBAAkB;CAClB,gBAAgB;CAChB,kBAAkB;CAClB,gBAAgB;CAChB,sBAAsB;CACtB,qBAAqB;CACrB,2BAA2B;CAC3B,oBAAoB;CACpB,oBAAoB;CACpB,sBAAsB;CACtB,kBAAkB;CAClB,kBAAkB;CAClB,CAAC;AAGF,MAAM,qBAAqB;CAC1B,IAAI;CACJ,MAAM;CACN,WAAW;CACX,aAAa;CACb,QAAQ;EACP,MAAM;EACN,SAAS;EACT;CACD,gBAAgB,CAAC;EAChB,SAAS;EACT,WAAW,EAAE;EACb,OAAO;GACN,QAAQ;IACP,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD,OAAO;IACN,QAAQ;IACR,cAAc;IACd,UAAU,EAAE;IACZ;GACD;EACD,SAAS,CAAC;GACT,IAAI;GACJ,MAAM;GACN,aAAa;GACb,YAAY;IACX;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;GACD,EAAE;GACF,IAAI;GACJ,MAAM;GACN,aAAa;GACb,YAAY;IACX;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;KACC,IAAI;KACJ,MAAM;KACN,aAAa;KACb,QAAQ;KACR,UAAU;KACV,SAAS;KACT,QAAQ,EAAE;KACV,UAAU,EAAE;KACZ,OAAO;KACP;IACD;GACD,CAAC;EACF,CAAC;CACF;AAGD,MAAM,oBAAoB;;AAI1B,MAAM,4BAA4B,yBAAyB,OAAO,EAAE,cAAcC,QAAU,kBAAkB,EAAE,CAAC;;AAEjH,MAAM,qBAAqB,wBAAwB,OAAO;CACzD,QAAQ,0BAA0B;CAClC,OAAO,+BAA+B;CACtC,CAAC;AACF,MAAM,sBAAsBF,OAAS;CACpC,QAAQ;CACR,OAAO;CACP,cAAc;CACd,CAAC;;AAEF,SAAS,aAAa,OAAO;AAC5B,QAAO,mBAAmB,UAAU,MAAM,CAAC;;;AAG5C,SAAS,mBAAmB,OAAO;AAClC,oBAAmB,MAAM,MAAM;;;AAGhC,SAAS,gBAAgB,UAAU;AAClC,QAAO,oBAAoB,UAAU,SAAS,CAAC;;;AAGhD,SAAS,sBAAsB,UAAU;AACxC,qBAAoB,MAAM,SAAS;;AAkDpC,MAAM,eAAe;CACpB,sBAAsB,OAAO,QAAQ,UAAU;AAC9C,QAAM,OAAO,OAAO,MAAM;;CAE3B,sBAAsB,OAAO,QAAQ,UAAU;AAC9C,QAAM,OAAO,OAAO,MAAM;;CAE3B,wBAAwB,OAAO,QAAQ,UAAU;AAChD,QAAM,cAAc,OAAO,MAAM;;CAElC,6BAA6B,OAAO,QAAQ,UAAU;AACrD,QAAM,mBAAmB,OAAO,MAAM;;CAEvC,qBAAqB,OAAO,QAAQ,UAAU;EAC7C,MAAM,EAAE,UAAU,UAAU,OAAO;AACnC,MAAI,MAAM,UAAU,MAAM,MAAM,EAAE,eAAe,MAAM,WAAW,CAAE,OAAM,IAAI,MAAM,uBAAuB,MAAM,WAAW,iBAAiB;EAC7I,MAAM,WAAW;GAChB,YAAY,MAAM;GAClB,OAAO,MAAM,SAAS;GACtB,OAAO,MAAM;GACb,QAAQ,MAAM;GACd,QAAQ;IACP,cAAc,MAAM,OAAO,gBAAgB;IAC3C,YAAY,MAAM,OAAO,cAAc;IACvC,OAAO,MAAM,OAAO,SAAS;IAC7B,QAAQ,MAAM,OAAO,UAAU;IAC/B;GACD,UAAU,MAAM,WAAW;IAC1B,iBAAiB,MAAM,SAAS,mBAAmB;IACnD,MAAM,MAAM,SAAS,QAAQ;IAC7B,MAAM,MAAM,SAAS,QAAQ;IAC7B,GAAG;GACJ;AACD,QAAM,UAAU,KAAK,SAAS;;CAE/B,wBAAwB,OAAO,QAAQ,UAAU;AAChD,QAAM,YAAY,MAAM,UAAU,QAAQ,aAAa,SAAS,eAAe,OAAO,MAAM,WAAW;;CAExG,oBAAoB,OAAO,QAAQ,UAAU;EAC5C,MAAM,EAAE,SAAS,UAAU,OAAO;AAClC,MAAI,MAAM,SAAS,MAAM,MAAM,EAAE,OAAO,MAAM,GAAG,CAAE,OAAM,IAAI,MAAM,sBAAsB,MAAM,GAAG,iBAAiB;EACnH,MAAM,UAAU;GACf,IAAI,MAAM;GACV,MAAM,MAAM;GACZ,MAAM,MAAM,OAAO,EAAE,GAAG,MAAM,MAAM,GAAG;GACvC;AACD,QAAM,SAAS,KAAK,QAAQ;;CAE7B,uBAAuB,OAAO,QAAQ,UAAU;AAC/C,QAAM,WAAW,MAAM,SAAS,QAAQ,YAAY,QAAQ,OAAO,OAAO,MAAM,UAAU;;CAE3F;AAGD,SAAS,WAAW,MAAM;AACzB,QAAO,KAAK,SAAS;;AAEtB,SAAS,aAAa,MAAM;AAC3B,QAAO,KAAK,SAAS;;AAUtB,SAAS,eAAe,MAAM,UAAU;CACvC,MAAM,WAAW,SAAS,QAAQ,UAAU,MAAM,iBAAiB,KAAK,GAAG;CAC3E,MAAM,cAAc,SAAS,KAAK,UAAU,eAAe,OAAO,SAAS,CAAC;AAC5E,QAAO,CAAC,GAAG,UAAU,GAAG,YAAY,MAAM,CAAC;;;;;;;;;;AAU5C,SAAS,kBAAkB,KAAK,aAAa,OAAO;CACnD,MAAM,WAAW,MAAM,MAAM,SAAS,KAAK,OAAO,IAAI,MAAM;AAC5D,KAAI,CAAC,SAAU,OAAM,IAAI,MAAM,gBAAgB,IAAI,MAAM,YAAY;CACrE,MAAM,cAAc,CAAC;EACpB,GAAG;EACH,MAAM,IAAI,cAAc,SAAS;EACjC,cAAc,IAAI,sBAAsB;EACxC,EAAE,GAAG,eAAe,UAAU,MAAM,CAAC;CACtC,MAAM,MAAM,EAAE;AACd,KAAI,IAAI,mBAAoB,KAAI,IAAI,sBAAsB,IAAI;CAC9D,MAAM,gBAAgB,SAAS;EAC9B,IAAI,QAAQ,IAAI,KAAK;AACrB,MAAI,CAAC,OAAO;GACX,MAAM,QAAQ,KAAK;AACnB,WAAQ,YAAY,KAAK;AACzB,OAAI,SAAS;;AAEd,SAAO;;AAER,QAAO,YAAY,KAAK,UAAU;EACjC,OAAO,KAAK;EACZ,UAAU,aAAa,KAAK;EAC5B,YAAY,KAAK;EACjB,oBAAoB,KAAK,eAAe,IAAI,KAAK,gBAAgB;EACjE,EAAE;;AAEJ,SAAS,kBAAkB,OAAO,cAAc;CAC/C,IAAI,YAAY;CAChB,MAAM,QAAQ,IAAI,OAAO,IAAI,aAAa,aAAa,CAAC,0BAA0B;AAClF,MAAK,MAAM,QAAQ,OAAO;EACzB,MAAM,QAAQ,KAAK,MAAM,MAAM;AAC/B,MAAI,OAAO;GACV,MAAM,SAAS,MAAM,KAAK,SAAS,MAAM,IAAI,GAAG,GAAG;AACnD,OAAI,SAAS,UAAW,aAAY;;;AAGtC,QAAO,YAAY;;AAEpB,SAAS,aAAa,QAAQ;AAC7B,QAAO,OAAO,QAAQ,uBAAuB,OAAO;;AAErD,SAAS,2BAA2B,QAAQ;CAC3C,MAAM,EAAE,OAAO,oBAAoB,SAAS,YAAY;CACxD,MAAM,0BAA0B,MAAM,QAAQ,SAAS,uBAAuB,KAAK,KAAK,iBAAiB,OAAO,KAAK,iBAAiB,mBAAmB,CAAC,QAAQ,SAAS,KAAK,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,KAAK;AAC1N,QAAO,wBAAwB,SAAS,QAAQ,GAAG,GAAG,QAAQ,UAAU,kBAAkB,yBAAyB,QAAQ,KAAK;;AAEjI,MAAM,eAAe,SAAS;AAC7B,QAAO,KAAK,MAAM,CAAC,SAAS,KAAK,CAAC,wBAAwB,KAAK,KAAK;;AAIrE,MAAM,cAAc;CACnB,iBAAiB,OAAO,QAAQ,UAAU;AACzC,MAAI,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,GAAG,CAAE,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,GAAG,kBAAkB;AAC/H,MAAI,CAAC,YAAY,OAAO,MAAM,KAAK,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,KAAK,2DAA2D;EACpJ,MAAM,OAAO,2BAA2B;GACvC,OAAO,MAAM;GACb,SAAS,OAAO,MAAM;GACtB,SAAS;GACT,oBAAoB,OAAO,MAAM,gBAAgB;GACjD,CAAC;EACF,MAAM,WAAW;GAChB,IAAI,OAAO,MAAM;GACjB;GACA,MAAM;GACN,cAAc,OAAO,MAAM,gBAAgB;GAC3C,cAAc,OAAO,MAAM;GAC3B;AACD,QAAM,MAAM,KAAK,SAAS;AAC1B,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;AACpD,aAAW;GACV,MAAM;GACN,OAAO;IACN,IAAI,OAAO,MAAM;IACjB,cAAc,OAAO,MAAM;IAC3B;GACD,CAAC;;CAEH,mBAAmB,OAAO,QAAQ;AACjC,MAAI,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,GAAG,CAAE,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,GAAG,kBAAkB;AAC/H,MAAI,CAAC,YAAY,OAAO,MAAM,KAAK,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,KAAK,2DAA2D;EACpJ,MAAM,OAAO,2BAA2B;GACvC,OAAO,MAAM;GACb,SAAS,OAAO,MAAM;GACtB,SAAS;GACT,oBAAoB,OAAO,MAAM,gBAAgB;GACjD,CAAC;AACF,QAAM,MAAM,KAAK;GAChB,GAAG,OAAO;GACV;GACA,MAAM;GACN,cAAc,OAAO,MAAM,gBAAgB;GAC3C,CAAC;AACF,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;;CAErD,oBAAoB,OAAO,QAAQ,UAAU;EAC5C,MAAM,OAAO,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,GAAG;AACpE,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,GAAG,YAAY;EACvE,MAAM,cAAc,eAAe,MAAM,MAAM,MAAM;AACrD,QAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,KAAK,OAAO,OAAO,MAAM,MAAM,CAAC,YAAY,MAAM,eAAe,WAAW,OAAO,KAAK,GAAG,CAAC;AACvI,GAAC,MAAM,GAAG,YAAY,CAAC,QAAQ,SAAS,WAAW,KAAK,CAAC,CAAC,SAAS,SAAS;AAC3E,cAAW;IACV,MAAM;IACN,OAAO,EAAE,IAAI,KAAK,IAAI;IACtB,CAAC;IACD;;CAEH,oBAAoB,OAAO,QAAQ;AAClC,MAAI,OAAO,MAAM,QAAQ,CAAC,YAAY,OAAO,MAAM,KAAK,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,KAAK,2DAA2D;AACzK,QAAM,QAAQ,MAAM,MAAM,KAAK,SAAS,KAAK,OAAO,OAAO,MAAM,KAAK;GACrE,GAAG;GACH,MAAM,2BAA2B;IAChC,OAAO,MAAM,MAAM,QAAQ,MAAM,EAAE,OAAO,OAAO,MAAM,GAAG;IAC1D,SAAS,OAAO,MAAM,QAAQ,KAAK;IACnC,SAAS;IACT,oBAAoB,OAAO,MAAM,gBAAgB,KAAK;IACtD,CAAC;GACF,cAAc,OAAO,MAAM,gBAAgB,KAAK;GAChD,GAAG,KAAK;AACT,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;;CAErD,oBAAoB,OAAO,QAAQ;AAClC,MAAI,OAAO,MAAM,QAAQ,CAAC,YAAY,OAAO,MAAM,KAAK,CAAE,OAAM,IAAI,MAAM,kBAAkB,OAAO,MAAM,KAAK,2DAA2D;AACzK,QAAM,QAAQ,MAAM,MAAM,KAAK,SAAS,KAAK,OAAO,OAAO,MAAM,KAAK;GACrE,GAAG;GACH,MAAM,2BAA2B;IAChC,OAAO,MAAM,MAAM,QAAQ,MAAM,EAAE,OAAO,OAAO,MAAM,GAAG;IAC1D,SAAS,OAAO,MAAM,QAAQ,KAAK;IACnC,SAAS,KAAK,SAAS,SAAS,SAAS;IACzC,oBAAoB,OAAO,MAAM,gBAAgB,KAAK;IACtD,CAAC;GACF,cAAc,OAAO,MAAM,iBAAiB,OAAO,OAAO,KAAK;GAC/D,GAAG,KAAK;AACT,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;;CAErD,kBAAkB,OAAO,QAAQ,UAAU;EAC1C,MAAM,OAAO,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,MAAM;AACvE,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,MAAM,YAAY;AAC1E,MAAI,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,SAAS,CAAE,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,SAAS,iBAAiB;EAC1I,MAAM,OAAO,2BAA2B;GACvC,OAAO,MAAM;GACb,SAAS,OAAO,MAAM,cAAc,KAAK;GACzC,SAAS,KAAK,SAAS,SAAS,SAAS;GACzC,oBAAoB,OAAO,MAAM,sBAAsB;GACvD,CAAC;EACF,MAAM,UAAU;GACf,GAAG;GACH,IAAI,OAAO,MAAM;GACjB,MAAM,OAAO,MAAM;GACnB;GACA,cAAc,OAAO,MAAM,sBAAsB;GACjD;AACD,QAAM,MAAM,KAAK,QAAQ;AACzB,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;AACpD,MAAI,WAAW,QAAQ,CAAE,YAAW;GACnC,MAAM;GACN,OAAO;IACN,IAAI,OAAO,MAAM;IACjB,OAAO,OAAO,MAAM;IACpB;GACD,CAAC;;CAEH,kBAAkB,OAAO,QAAQ;AAChC,MAAI,OAAO,MAAM,cAAc,OAAO,MAAM,mBAAoB,OAAM,IAAI,MAAM,mFAAmF;EACnK,MAAM,OAAO,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,UAAU;AAC3E,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,gBAAgB,OAAO,MAAM,UAAU,YAAY;EAC9E,MAAM,OAAO,2BAA2B;GACvC,OAAO,MAAM;GACb,SAAS,KAAK;GACd,SAAS,KAAK,SAAS,SAAS,SAAS;GACzC,oBAAoB,OAAO,MAAM,sBAAsB;GACvD,CAAC;AACF,MAAI,aAAa,KAAK;OACjB,eAAe,MAAM,MAAM,MAAM,CAAC,MAAM,eAAe,WAAW,OAAO,OAAO,MAAM,mBAAmB,CAAE,OAAM,IAAI,MAAM,2EAA2E;;AAE3M,QAAM,QAAQ,MAAM,MAAM,KAAK,SAAS;AACvC,OAAI,KAAK,OAAO,OAAO,MAAM,UAAW,QAAO;IAC9C,GAAG;IACH;IACA,cAAc,OAAO,MAAM,sBAAsB;IACjD;AACD,UAAO;IACN;AACF,QAAM,MAAM,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,GAAG,CAAC;;CAErD;AAGD,MAAM,qBAAqB,OAAO,QAAQ,aAAa;AACtD,KAAI,iBAAiB,OAAO,CAAE,QAAO;CACrC,MAAM,cAAc;AACpB,SAAQ,YAAY,MAApB;EACC,KAAK;AACJ,uBAAoB,CAAC,MAAM,YAAY,MAAM;AAC7C,eAAY,iBAAiB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AACxE;EACD,KAAK;AACJ,yBAAsB,CAAC,MAAM,YAAY,MAAM;AAC/C,eAAY,mBAAmB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC1E;EACD,KAAK;AACJ,0BAAuB,CAAC,MAAM,YAAY,MAAM;AAChD,eAAY,oBAAoB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC3E;EACD,KAAK;AACJ,0BAAuB,CAAC,MAAM,YAAY,MAAM;AAChD,eAAY,oBAAoB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC3E;EACD,KAAK;AACJ,0BAAuB,CAAC,MAAM,YAAY,MAAM;AAChD,eAAY,oBAAoB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC3E;EACD,KAAK;AACJ,wBAAqB,CAAC,MAAM,YAAY,MAAM;AAC9C,eAAY,kBAAkB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AACzE;EACD,KAAK;AACJ,wBAAqB,CAAC,MAAM,YAAY,MAAM;AAC9C,eAAY,kBAAkB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AACzE;EACD,KAAK;AACJ,4BAAyB,CAAC,MAAM,YAAY,MAAM;AAClD,gBAAa,sBAAsB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC9E;EACD,KAAK;AACJ,4BAAyB,CAAC,MAAM,YAAY,MAAM;AAClD,gBAAa,sBAAsB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC9E;EACD,KAAK;AACJ,8BAA2B,CAAC,MAAM,YAAY,MAAM;AACpD,gBAAa,wBAAwB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAChF;EACD,KAAK;AACJ,mCAAgC,CAAC,MAAM,YAAY,MAAM;AACzD,gBAAa,6BAA6B,MAAM,YAAY,QAAQ,QAAQ,SAAS;AACrF;EACD,KAAK;AACJ,2BAAwB,CAAC,MAAM,YAAY,MAAM;AACjD,gBAAa,qBAAqB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC7E;EACD,KAAK;AACJ,8BAA2B,CAAC,MAAM,YAAY,MAAM;AACpD,gBAAa,wBAAwB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAChF;EACD,KAAK;AACJ,0BAAuB,CAAC,MAAM,YAAY,MAAM;AAChD,gBAAa,oBAAoB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC5E;EACD,KAAK;AACJ,6BAA0B,CAAC,MAAM,YAAY,MAAM;AACnD,gBAAa,uBAAuB,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC/E;EACD,QAAS,QAAO;;;AAGlB,MAAM,uBAAuB,cAAc,kBAAkB;AAG7D,MAAM,qBAAqB;CAC1B,MAAM;CACN,OAAO,EAAE;CACT,MAAM;CACN;AACD,MAAM,oBAAoB;CACzB,WAAW,EAAE;CACb,UAAU,EAAE;CACZ,aAAa;CACb,kBAAkB;CAClB;AACD,MAAM,oBAAoB,UAAU;AACnC,QAAO;EACN,GAAG,kBAAkB;EACrB,QAAQ;GACP,GAAG;GACH,GAAG,OAAO;GACV;EACD,OAAO;GACN,GAAG;GACH,GAAG,OAAO;GACV;EACD;;AAEF,MAAM,uBAAuB,UAAU;AACtC,QAAO,mBAAmB,kBAAkB,OAAO,kBAAkB;;AAEtE,MAAM,yBAAyB,UAAU,UAAU;AAClD,QAAO,qBAAqB,UAAU,MAAM;;AAE7C,MAAM,sBAAsB,UAAU;AACrC,QAAO,kBAAkB,OAAO,qBAAqB;;AAEtD,MAAM,iBAAiB,UAAU;AAChC,QAAO,aAAa,MAAM;;AAE3B,MAAM,uBAAuB,UAAU;AACtC,oBAAmB,MAAM;;AAE1B,MAAM,oBAAoB,aAAa;AACtC,QAAO,gBAAgB,SAAS;;AAEjC,MAAM,0BAA0B,aAAa;AAC5C,uBAAsB,SAAS;;AAIhC,MAAM,2BAA2B;CAChC,SAAS;CACT,SAAS;CACT,eAAeM,YAAc,kBAAkB,EAAE,mBAAmB;CACpE,OAAO;EACN,eAAe;EACf,aAAa;EACb,gBAAgB;EAChB,eAAe;EACf,kBAAkB;EAClB;EACA;EACA;EACA;EACA;CACD"}