document-model 2.10.0 → 2.11.0

package/dist/browser/es/internal/{object-C0mdRngQ.js → object-oB7gkKNr.js}

@@ -1864,7 +1864,7 @@ function updateHeader(document, action) {
       ...document.revision,
       [action.scope]: getNextRevision(document, action)
     },
-    lastModified: (/* @__PURE__ */ new Date()).toISOString()
+    lastModified: getDocumentLastModified(document)
   };
 }
 function updateOperations(document, action, skip = 0, reuseLastOperationIndex = false) {
@@ -2307,6 +2307,12 @@ function sortMappedOperations(operations) {
     (a, b) => new Date(a.operation.timestamp).getTime() - new Date(b.operation.timestamp).getTime()
   );
 }
+function getDocumentLastModified(document) {
+  var _a;
+  const sortedOperations = sortOperations(document.operations);
+  const timestamp = ((_a = sortedOperations.at(-1)) == null ? void 0 : _a.timestamp) || document.initialState.lastModified;
+  return timestamp;
+}
 function replayOperations(initialState, clearedOperations, reducer, dispatch, header, documentReducer = baseReducer, skipHeaderOperations2 = {}, options) {
   const wrappedReducer = createReducer(reducer, documentReducer);
   return replayDocument(
@@ -2660,25 +2666,26 @@ function applyMixins(derivedCtor, constructors) {
   });
 }
 export {
-  isSameDocument as A,
+  isNoopOperation as A,
   BaseDocument as B,
-  isUndo as C,
-  isUndoRedo as D,
-  mapSkippedOperations as E,
-  parseResultingState as F,
-  readOnly as G,
-  replayDocument as H,
-  replayOperations as I,
-  sortMappedOperations as J,
-  sortOperations as K,
-  validateOperations as L,
-  verifyOperationSignature as M,
-  baseReducer as N,
-  mutableBaseReducer as O,
-  processUndoRedo as P,
-  updateDocument as Q,
-  updateHeader as R,
-  zod as S,
+  isSameDocument as C,
+  isUndo as D,
+  isUndoRedo as E,
+  mapSkippedOperations as F,
+  parseResultingState as G,
+  readOnly as H,
+  replayDocument as I,
+  replayOperations as J,
+  sortMappedOperations as K,
+  sortOperations as L,
+  validateOperations as M,
+  verifyOperationSignature as N,
+  baseReducer as O,
+  mutableBaseReducer as P,
+  processUndoRedo as Q,
+  updateDocument as R,
+  updateHeader as S,
+  zod as T,
   createExtendedState as a,
   createDocument as b,
   createReducer as c,
@@ -2698,12 +2705,12 @@ export {
   createZip as q,
   documentHelpers as r,
   saveToFile as s,
-  getLocalFile as t,
-  getRemoteFile as u,
-  getUnixTimestamp as v,
-  hashDocument as w,
-  hashKey as x,
-  hex2ab as y,
-  isNoopOperation as z
+  getDocumentLastModified as t,
+  getLocalFile as u,
+  getRemoteFile as v,
+  getUnixTimestamp as w,
+  hashDocument as x,
+  hashKey as y,
+  hex2ab as z
 };
-//# sourceMappingURL=object-C0mdRngQ.js.map
+//# sourceMappingURL=object-oB7gkKNr.js.map

package/dist/browser/es/internal/object-oB7gkKNr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"object-oB7gkKNr.js","sources":["../../../../src/document/schema/zod.ts","../../../../../../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/uuid@9.0.1/node_modules/uuid/dist/esm-browser/rng.js","../../../../../../node_modules/.pnpm/uuid@9.0.1/node_modules/uuid/dist/esm-browser/stringify.js","../../../../../../node_modules/.pnpm/uuid@9.0.1/node_modules/uuid/dist/esm-browser/native.js","../../../../../../node_modules/.pnpm/uuid@9.0.1/node_modules/uuid/dist/esm-browser/v4.js","../../../../../../node_modules/.pnpm/sha1-uint8array@0.10.7/node_modules/sha1-uint8array/dist/sha1-uint8array.mjs","../../../../src/document/utils/browser.ts","../../../../src/document/utils/crypto.ts","../../../../../../node_modules/.pnpm/mime@4.0.4/node_modules/mime/dist/types/standard.js","../../../../../../node_modules/.pnpm/mime@4.0.4/node_modules/mime/dist/src/Mime.js","../../../../../../node_modules/.pnpm/mime@4.0.4/node_modules/mime/dist/src/index_lite.js","../../../../src/document/utils/validation.ts","../../../../src/document/utils/document-helpers.ts","../../../../src/document/utils/file.ts","../../../../src/document/actions/index.ts","../../../../src/document/actions/types.ts","../../../../src/document/reducer.ts","../../../../src/document/utils/base.ts","../../../../src/document/actions/creators.ts","../../../../src/document/object.ts"],"sourcesContent":["import { z } from \"zod\";\nimport {\n  Action,\n  DocumentFile,\n  Load_State,\n  LoadStateAction,\n  LoadStateActionInput,\n  LoadStateActionStateInput,\n  Operation,\n  Prune,\n  PruneAction,\n  PruneActionInput,\n  Redo,\n  RedoAction,\n  Set_Name,\n  SetNameAction,\n  SetNameOperation,\n  Undo,\n  UndoAction,\n} from \".\";\nimport { OperationScope } from \"../types\";\n\ntype Properties<T> = Required<{\n  [K in keyof T]: z.ZodType<T[K], any, T[K]>;\n}>;\n\ntype definedNonNullAny = {};\n\nexport const isDefinedNonNullAny = (v: any): v is definedNonNullAny =>\n  v !== undefined && v !== null;\n\nexport const definedNonNullAnySchema = z\n  .any()\n  .refine((v) => isDefinedNonNullAny(v));\n\nexport const Load_StateSchema = z.enum([\"LOAD_STATE\"]);\n\nexport const PruneSchema = z.enum([\"PRUNE\"]);\n\nexport const RedoSchema = z.enum([\"REDO\"]);\n\nexport const Set_NameSchema = z.enum([\"SET_NAME\"]);\n\nexport const UndoSchema = z.enum([\"UNDO\"]);\n\nexport function ActionSchema(): z.ZodObject<Properties<Action>> {\n  return z.object({\n    __typename: z.literal(\"Action\").optional(),\n    type: z.string(),\n  });\n}\n\nexport function OperationScopeSchema(): z.ZodType<OperationScope> {\n  return z.literal(\"global\").or(z.literal(\"local\"));\n}\n\nexport function BaseActionSchema() {\n  return z.union([\n    LoadStateActionSchema(),\n    PruneActionSchema(),\n    RedoActionSchema(),\n    SetNameActionSchema(),\n    UndoActionSchema(),\n  ]);\n}\n\nexport function DocumentFileSchema(): z.ZodObject<Properties<DocumentFile>> {\n  return z.object({\n    __typename: z.literal(\"DocumentFile\").optional(),\n    data: z.string(),\n    extension: z.string().nullable(),\n    fileName: z.string().nullable(),\n    mimeType: z.string(),\n  });\n}\n\nexport function LoadStateActionSchema(): z.ZodObject<\n  Properties<LoadStateAction>\n> {\n  return z.object({\n    input: z.lazy(() => LoadStateActionInputSchema()),\n    type: Load_StateSchema,\n    scope: OperationScopeSchema(),\n  });\n}\n\nexport function LoadStateActionInputSchema(): z.ZodObject<\n  Properties<LoadStateActionInput>\n> {\n  return z.object({\n    operations: z.number(),\n    state: z.lazy(() => LoadStateActionStateInputSchema()),\n  });\n}\n\nexport function LoadStateActionStateInputSchema(): z.ZodObject<\n  Properties<LoadStateActionStateInput>\n> {\n  return z.object({\n    data: z.unknown().nullish(),\n    name: z.string(),\n  });\n}\n\nexport function OperationSchema(): z.ZodObject<Properties<Operation>> {\n  return z.object({\n    __typename: z.literal(\"Operation\").optional(),\n    hash: z.string(),\n    index: z.number(),\n    timestamp: z.string().datetime(),\n    type: z.string(),\n  });\n}\n\nexport function PruneActionSchema(): z.ZodObject<Properties<PruneAction>> {\n  return z.object({\n    input: z.lazy(() => PruneActionInputSchema()),\n    type: PruneSchema,\n    scope: OperationScopeSchema(),\n  });\n}\n\nexport function PruneActionInputSchema(): z.ZodObject<\n  Properties<PruneActionInput>\n> {\n  return z.object({\n    end: z.number().nullish(),\n    start: z.number().nullish(),\n  });\n}\n\nexport const RedoActionInputSchema = z.number;\n\nexport function RedoActionSchema(): z.ZodObject<Properties<RedoAction>> {\n  return z.object({\n    input: RedoActionInputSchema(),\n    type: RedoSchema,\n    scope: OperationScopeSchema(),\n  });\n}\n\nexport const SetNameActionInputSchema = z.string;\n\nexport function SetNameActionSchema(): z.ZodObject<Properties<SetNameAction>> {\n  return z.object({\n    input: SetNameActionInputSchema(),\n    type: Set_NameSchema,\n    scope: z.literal(\"global\"),\n  });\n}\n\nexport function SetNameOperationSchema(): z.ZodObject<\n  Properties<SetNameOperation>\n> {\n  return z.object({\n    __typename: z.literal(\"SetNameOperation\").optional(),\n    hash: z.string(),\n    index: z.number(),\n    input: z.string(),\n    timestamp: z.string().datetime(),\n    type: z.string(),\n  });\n}\n\nexport const UndoActionInputSchema = z.number;\n\nexport function UndoActionSchema(): z.ZodObject<Properties<UndoAction>> {\n  return z.object({\n    input: UndoActionInputSchema(),\n    type: UndoSchema,\n    scope: OperationScopeSchema(),\n  });\n}\n","'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","// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nlet getRandomValues;\nconst rnds8 = new Uint8Array(16);\nexport default function rng() {\n  // lazy load so that environments that need to polyfill have a chance to do so\n  if (!getRandomValues) {\n    // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation.\n    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto);\n\n    if (!getRandomValues) {\n      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n    }\n  }\n\n  return getRandomValues(rnds8);\n}","import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nconst byteToHex = [];\n\nfor (let i = 0; i < 256; ++i) {\n  byteToHex.push((i + 0x100).toString(16).slice(1));\n}\n\nexport function unsafeStringify(arr, offset = 0) {\n  // Note: Be careful editing this code!  It's been tuned for performance\n  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n  return byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]];\n}\n\nfunction stringify(arr, offset = 0) {\n  const uuid = unsafeStringify(arr, offset); // Consistency check for valid UUID.  If this throws, it's likely due to one\n  // of the following:\n  // - One or more input array values don't map to a hex octet (leading to\n  // \"undefined\" in the uuid)\n  // - Invalid input values for the RFC `version` or `variant` fields\n\n  if (!validate(uuid)) {\n    throw TypeError('Stringified UUID is invalid');\n  }\n\n  return uuid;\n}\n\nexport default stringify;","const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);\nexport default {\n  randomUUID\n};","import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\n\nfunction v4(options, buf, offset) {\n  if (native.randomUUID && !buf && !options) {\n    return native.randomUUID();\n  }\n\n  options = options || {};\n  const rnds = options.random || (options.rng || rng)(); // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`\n\n  rnds[6] = rnds[6] & 0x0f | 0x40;\n  rnds[8] = rnds[8] & 0x3f | 0x80; // Copy bytes to buffer, if provided\n\n  if (buf) {\n    offset = offset || 0;\n\n    for (let i = 0; i < 16; ++i) {\n      buf[offset + i] = rnds[i];\n    }\n\n    return buf;\n  }\n\n  return unsafeStringify(rnds);\n}\n\nexport default v4;","/**\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 type { Buffer } from \"buffer\";\nimport { createHash as createSha1Hash } from \"sha1-uint8array\";\n\nconst FileSystemError = new Error(\"File system not available.\");\n\nexport function writeFile(\n  path: string,\n  name: string,\n  stream: Uint8Array,\n): Promise<string> {\n  throw FileSystemError;\n}\n\nexport function readFile(path: string) {\n  throw FileSystemError;\n}\n\nexport function fetchFile(\n  url: string,\n): Promise<{ data: Buffer; mimeType?: string }> {\n  throw FileSystemError;\n}\n\nexport const getFile = async (file: string) => {\n  return readFile(file);\n};\n\nexport const hash = (\n  data: string | Uint8Array | ArrayBufferView | DataView,\n  algorithm = \"sha1\",\n) => {\n  if (![\"sha1\"].includes(algorithm)) {\n    throw new Error(\"Hashing algorithm not supported: Available: sha1\");\n  }\n\n  const hash = hashUIntArray(data);\n  return uint8ArrayToBase64(hash);\n};\n\nfunction uint8ArrayToBase64(uint8Array: Uint8Array) {\n  // Convert the Uint8Array to a binary string\n  let binaryString = \"\";\n  for (let i = 0; i < uint8Array.length; i++) {\n    binaryString += String.fromCharCode(uint8Array[i]);\n  }\n\n  // Encode the binary string to base64\n  const base64String = btoa(binaryString);\n  return base64String;\n}\n\nfunction hashUIntArray(\n  data: string | Uint8Array | ArrayBufferView,\n  algorithm = \"sha1\",\n) {\n  if (![\"sha1\"].includes(algorithm)) {\n    throw new Error(\"Hashing algorithm not supported: Available: sha1\");\n  }\n  return createSha1Hash(\"sha1\")\n    .update(data as string)\n    .digest();\n}\n","import stringifyJson from \"safe-stable-stringify\";\nimport type {\n  Action,\n  ActionSigner,\n  BaseAction,\n  Document,\n  Operation,\n  OperationSignatureContext,\n  OperationSigningHandler,\n  OperationVerificationHandler,\n  Reducer,\n  Signature,\n} from \"../types\";\nimport { hash } from \"./node\";\n\nexport function getUnixTimestamp(date: Date | string): string {\n  return (new Date(date).getTime() / 1000).toFixed(0);\n}\n\nexport function buildOperationSignatureParams({\n  documentId,\n  signer,\n  operation,\n  previousStateHash,\n}: OperationSignatureContext): [string, string, string, string] {\n  const { timestamp, scope, id, type } = operation;\n  return [\n    getUnixTimestamp(timestamp), // timestamp,\n    signer.app.key, // signer public key\n    hash(\n      // hash (docID, scope, operationID, operationName, operationInput)\n      [documentId, scope, id, type, stringifyJson(operation.input)].join(\"\"),\n    ),\n    previousStateHash, // state hash that the operation was applied to\n  ];\n}\n\nconst textEncode = new TextEncoder();\n\nexport function buildOperationSignatureMessage(\n  params: [string, string, string, string],\n): Uint8Array {\n  const message = params.join(\"\");\n  const prefix = \"\\x19Signed Operation:\\n\" + message.length.toString();\n  return textEncode.encode(prefix + message);\n}\n\nexport function ab2hex(ab: ArrayBuffer | ArrayBufferView): string {\n  const view = ArrayBuffer.isView(ab) ? ab : new Uint8Array(ab);\n  return Array.prototype.map\n    .call(view, (x: number) => (\"00\" + x.toString(16)).slice(-2))\n    .join(\"\");\n}\n\nexport function hex2ab(hex: string) {\n  return new Uint8Array(\n    hex.match(/[\\da-f]{2}/gi)?.map(function (h) {\n      return parseInt(h, 16);\n    }) ?? [],\n  );\n}\n\nexport async function buildOperationSignature(\n  context: OperationSignatureContext,\n  signMethod: OperationSigningHandler,\n): Promise<Signature> {\n  const params = buildOperationSignatureParams(context);\n  const message = buildOperationSignatureMessage(params);\n  const signature = await signMethod(message);\n  return [...params, `0x${ab2hex(signature)}`];\n}\n\nexport async function buildSignedOperation<T, A extends Action, L>(\n  action: A | Operation<A>,\n  reducer: Reducer<T, A, L>,\n  document: Document<T, A, L>,\n  context: Omit<OperationSignatureContext, \"operation\" | \"previousStateHash\">,\n  signHandler: OperationSigningHandler,\n): Promise<Operation<A | BaseAction>> {\n  const result = reducer(document, action, undefined, {\n    reuseHash: true,\n    reuseOperationResultingState: true,\n  });\n  const operation = result.operations[action.scope].at(-1);\n  if (!operation) {\n    throw new Error(\"Action was not applied\");\n  }\n\n  const previousStateHash = result.operations[action.scope].at(-2)?.hash ?? \"\";\n  const signature = await buildOperationSignature(\n    {\n      ...context,\n      operation,\n      previousStateHash,\n    },\n    signHandler,\n  );\n\n  return {\n    ...operation,\n    context: {\n      ...operation.context,\n      signer: {\n        ...operation.context?.signer,\n        ...context.signer,\n        signatures: [...(context.signer.signatures ?? []), signature],\n      },\n    },\n  };\n}\n\nexport async function verifyOperationSignature<T, A extends Action, L>(\n  signature: Signature,\n  signer: Omit<ActionSigner, \"signatures\">,\n  verifyHandler: OperationVerificationHandler,\n): Promise<boolean> {\n  const publicKey = signer.app.key;\n  const params = signature.slice(0, 4) as [string, string, string, string];\n  const signatureBytes = hex2ab(signature[4]);\n  const expectedMessage = buildOperationSignatureMessage(params);\n  return verifyHandler(publicKey, signatureBytes, expectedMessage);\n}\n","const types = { \"application/andrew-inset\": [\"ez\"], \"application/appinstaller\": [\"appinstaller\"], \"application/applixware\": [\"aw\"], \"application/appx\": [\"appx\"], \"application/appxbundle\": [\"appxbundle\"], \"application/atom+xml\": [\"atom\"], \"application/atomcat+xml\": [\"atomcat\"], \"application/atomdeleted+xml\": [\"atomdeleted\"], \"application/atomsvc+xml\": [\"atomsvc\"], \"application/atsc-dwd+xml\": [\"dwd\"], \"application/atsc-held+xml\": [\"held\"], \"application/atsc-rsat+xml\": [\"rsat\"], \"application/automationml-aml+xml\": [\"aml\"], \"application/automationml-amlx+zip\": [\"amlx\"], \"application/bdoc\": [\"bdoc\"], \"application/calendar+xml\": [\"xcs\"], \"application/ccxml+xml\": [\"ccxml\"], \"application/cdfx+xml\": [\"cdfx\"], \"application/cdmi-capability\": [\"cdmia\"], \"application/cdmi-container\": [\"cdmic\"], \"application/cdmi-domain\": [\"cdmid\"], \"application/cdmi-object\": [\"cdmio\"], \"application/cdmi-queue\": [\"cdmiq\"], \"application/cpl+xml\": [\"cpl\"], \"application/cu-seeme\": [\"cu\"], \"application/cwl\": [\"cwl\"], \"application/dash+xml\": [\"mpd\"], \"application/dash-patch+xml\": [\"mpp\"], \"application/davmount+xml\": [\"davmount\"], \"application/docbook+xml\": [\"dbk\"], \"application/dssc+der\": [\"dssc\"], \"application/dssc+xml\": [\"xdssc\"], \"application/ecmascript\": [\"ecma\"], \"application/emma+xml\": [\"emma\"], \"application/emotionml+xml\": [\"emotionml\"], \"application/epub+zip\": [\"epub\"], \"application/exi\": [\"exi\"], \"application/express\": [\"exp\"], \"application/fdf\": [\"fdf\"], \"application/fdt+xml\": [\"fdt\"], \"application/font-tdpfr\": [\"pfr\"], \"application/geo+json\": [\"geojson\"], \"application/gml+xml\": [\"gml\"], \"application/gpx+xml\": [\"gpx\"], \"application/gxf\": [\"gxf\"], \"application/gzip\": [\"gz\"], \"application/hjson\": [\"hjson\"], \"application/hyperstudio\": [\"stk\"], \"application/inkml+xml\": [\"ink\", \"inkml\"], \"application/ipfix\": [\"ipfix\"], \"application/its+xml\": [\"its\"], \"application/java-archive\": [\"jar\", \"war\", \"ear\"], \"application/java-serialized-object\": [\"ser\"], \"application/java-vm\": [\"class\"], \"application/javascript\": [\"*js\"], \"application/json\": [\"json\", \"map\"], \"application/json5\": [\"json5\"], \"application/jsonml+json\": [\"jsonml\"], \"application/ld+json\": [\"jsonld\"], \"application/lgr+xml\": [\"lgr\"], \"application/lost+xml\": [\"lostxml\"], \"application/mac-binhex40\": [\"hqx\"], \"application/mac-compactpro\": [\"cpt\"], \"application/mads+xml\": [\"mads\"], \"application/manifest+json\": [\"webmanifest\"], \"application/marc\": [\"mrc\"], \"application/marcxml+xml\": [\"mrcx\"], \"application/mathematica\": [\"ma\", \"nb\", \"mb\"], \"application/mathml+xml\": [\"mathml\"], \"application/mbox\": [\"mbox\"], \"application/media-policy-dataset+xml\": [\"mpf\"], \"application/mediaservercontrol+xml\": [\"mscml\"], \"application/metalink+xml\": [\"metalink\"], \"application/metalink4+xml\": [\"meta4\"], \"application/mets+xml\": [\"mets\"], \"application/mmt-aei+xml\": [\"maei\"], \"application/mmt-usd+xml\": [\"musd\"], \"application/mods+xml\": [\"mods\"], \"application/mp21\": [\"m21\", \"mp21\"], \"application/mp4\": [\"*mp4\", \"*mpg4\", \"mp4s\", \"m4p\"], \"application/msix\": [\"msix\"], \"application/msixbundle\": [\"msixbundle\"], \"application/msword\": [\"doc\", \"dot\"], \"application/mxf\": [\"mxf\"], \"application/n-quads\": [\"nq\"], \"application/n-triples\": [\"nt\"], \"application/node\": [\"cjs\"], \"application/octet-stream\": [\"bin\", \"dms\", \"lrf\", \"mar\", \"so\", \"dist\", \"distz\", \"pkg\", \"bpk\", \"dump\", \"elc\", \"deploy\", \"exe\", \"dll\", \"deb\", \"dmg\", \"iso\", \"img\", \"msi\", \"msp\", \"msm\", \"buffer\"], \"application/oda\": [\"oda\"], \"application/oebps-package+xml\": [\"opf\"], \"application/ogg\": [\"ogx\"], \"application/omdoc+xml\": [\"omdoc\"], \"application/onenote\": [\"onetoc\", \"onetoc2\", \"onetmp\", \"onepkg\"], \"application/oxps\": [\"oxps\"], \"application/p2p-overlay+xml\": [\"relo\"], \"application/patch-ops-error+xml\": [\"xer\"], \"application/pdf\": [\"pdf\"], \"application/pgp-encrypted\": [\"pgp\"], \"application/pgp-keys\": [\"asc\"], \"application/pgp-signature\": [\"sig\", \"*asc\"], \"application/pics-rules\": [\"prf\"], \"application/pkcs10\": [\"p10\"], \"application/pkcs7-mime\": [\"p7m\", \"p7c\"], \"application/pkcs7-signature\": [\"p7s\"], \"application/pkcs8\": [\"p8\"], \"application/pkix-attr-cert\": [\"ac\"], \"application/pkix-cert\": [\"cer\"], \"application/pkix-crl\": [\"crl\"], \"application/pkix-pkipath\": [\"pkipath\"], \"application/pkixcmp\": [\"pki\"], \"application/pls+xml\": [\"pls\"], \"application/postscript\": [\"ai\", \"eps\", \"ps\"], \"application/provenance+xml\": [\"provx\"], \"application/pskc+xml\": [\"pskcxml\"], \"application/raml+yaml\": [\"raml\"], \"application/rdf+xml\": [\"rdf\", \"owl\"], \"application/reginfo+xml\": [\"rif\"], \"application/relax-ng-compact-syntax\": [\"rnc\"], \"application/resource-lists+xml\": [\"rl\"], \"application/resource-lists-diff+xml\": [\"rld\"], \"application/rls-services+xml\": [\"rs\"], \"application/route-apd+xml\": [\"rapd\"], \"application/route-s-tsid+xml\": [\"sls\"], \"application/route-usd+xml\": [\"rusd\"], \"application/rpki-ghostbusters\": [\"gbr\"], \"application/rpki-manifest\": [\"mft\"], \"application/rpki-roa\": [\"roa\"], \"application/rsd+xml\": [\"rsd\"], \"application/rss+xml\": [\"rss\"], \"application/rtf\": [\"rtf\"], \"application/sbml+xml\": [\"sbml\"], \"application/scvp-cv-request\": [\"scq\"], \"application/scvp-cv-response\": [\"scs\"], \"application/scvp-vp-request\": [\"spq\"], \"application/scvp-vp-response\": [\"spp\"], \"application/sdp\": [\"sdp\"], \"application/senml+xml\": [\"senmlx\"], \"application/sensml+xml\": [\"sensmlx\"], \"application/set-payment-initiation\": [\"setpay\"], \"application/set-registration-initiation\": [\"setreg\"], \"application/shf+xml\": [\"shf\"], \"application/sieve\": [\"siv\", \"sieve\"], \"application/smil+xml\": [\"smi\", \"smil\"], \"application/sparql-query\": [\"rq\"], \"application/sparql-results+xml\": [\"srx\"], \"application/sql\": [\"sql\"], \"application/srgs\": [\"gram\"], \"application/srgs+xml\": [\"grxml\"], \"application/sru+xml\": [\"sru\"], \"application/ssdl+xml\": [\"ssdl\"], \"application/ssml+xml\": [\"ssml\"], \"application/swid+xml\": [\"swidtag\"], \"application/tei+xml\": [\"tei\", \"teicorpus\"], \"application/thraud+xml\": [\"tfi\"], \"application/timestamped-data\": [\"tsd\"], \"application/toml\": [\"toml\"], \"application/trig\": [\"trig\"], \"application/ttml+xml\": [\"ttml\"], \"application/ubjson\": [\"ubj\"], \"application/urc-ressheet+xml\": [\"rsheet\"], \"application/urc-targetdesc+xml\": [\"td\"], \"application/voicexml+xml\": [\"vxml\"], \"application/wasm\": [\"wasm\"], \"application/watcherinfo+xml\": [\"wif\"], \"application/widget\": [\"wgt\"], \"application/winhlp\": [\"hlp\"], \"application/wsdl+xml\": [\"wsdl\"], \"application/wspolicy+xml\": [\"wspolicy\"], \"application/xaml+xml\": [\"xaml\"], \"application/xcap-att+xml\": [\"xav\"], \"application/xcap-caps+xml\": [\"xca\"], \"application/xcap-diff+xml\": [\"xdf\"], \"application/xcap-el+xml\": [\"xel\"], \"application/xcap-ns+xml\": [\"xns\"], \"application/xenc+xml\": [\"xenc\"], \"application/xfdf\": [\"xfdf\"], \"application/xhtml+xml\": [\"xhtml\", \"xht\"], \"application/xliff+xml\": [\"xlf\"], \"application/xml\": [\"xml\", \"xsl\", \"xsd\", \"rng\"], \"application/xml-dtd\": [\"dtd\"], \"application/xop+xml\": [\"xop\"], \"application/xproc+xml\": [\"xpl\"], \"application/xslt+xml\": [\"*xsl\", \"xslt\"], \"application/xspf+xml\": [\"xspf\"], \"application/xv+xml\": [\"mxml\", \"xhvml\", \"xvml\", \"xvm\"], \"application/yang\": [\"yang\"], \"application/yin+xml\": [\"yin\"], \"application/zip\": [\"zip\"], \"audio/3gpp\": [\"*3gpp\"], \"audio/aac\": [\"adts\", \"aac\"], \"audio/adpcm\": [\"adp\"], \"audio/amr\": [\"amr\"], \"audio/basic\": [\"au\", \"snd\"], \"audio/midi\": [\"mid\", \"midi\", \"kar\", \"rmi\"], \"audio/mobile-xmf\": [\"mxmf\"], \"audio/mp3\": [\"*mp3\"], \"audio/mp4\": [\"m4a\", \"mp4a\"], \"audio/mpeg\": [\"mpga\", \"mp2\", \"mp2a\", \"mp3\", \"m2a\", \"m3a\"], \"audio/ogg\": [\"oga\", \"ogg\", \"spx\", \"opus\"], \"audio/s3m\": [\"s3m\"], \"audio/silk\": [\"sil\"], \"audio/wav\": [\"wav\"], \"audio/wave\": [\"*wav\"], \"audio/webm\": [\"weba\"], \"audio/xm\": [\"xm\"], \"font/collection\": [\"ttc\"], \"font/otf\": [\"otf\"], \"font/ttf\": [\"ttf\"], \"font/woff\": [\"woff\"], \"font/woff2\": [\"woff2\"], \"image/aces\": [\"exr\"], \"image/apng\": [\"apng\"], \"image/avci\": [\"avci\"], \"image/avcs\": [\"avcs\"], \"image/avif\": [\"avif\"], \"image/bmp\": [\"bmp\", \"dib\"], \"image/cgm\": [\"cgm\"], \"image/dicom-rle\": [\"drle\"], \"image/dpx\": [\"dpx\"], \"image/emf\": [\"emf\"], \"image/fits\": [\"fits\"], \"image/g3fax\": [\"g3\"], \"image/gif\": [\"gif\"], \"image/heic\": [\"heic\"], \"image/heic-sequence\": [\"heics\"], \"image/heif\": [\"heif\"], \"image/heif-sequence\": [\"heifs\"], \"image/hej2k\": [\"hej2\"], \"image/hsj2\": [\"hsj2\"], \"image/ief\": [\"ief\"], \"image/jls\": [\"jls\"], \"image/jp2\": [\"jp2\", \"jpg2\"], \"image/jpeg\": [\"jpeg\", \"jpg\", \"jpe\"], \"image/jph\": [\"jph\"], \"image/jphc\": [\"jhc\"], \"image/jpm\": [\"jpm\", \"jpgm\"], \"image/jpx\": [\"jpx\", \"jpf\"], \"image/jxr\": [\"jxr\"], \"image/jxra\": [\"jxra\"], \"image/jxrs\": [\"jxrs\"], \"image/jxs\": [\"jxs\"], \"image/jxsc\": [\"jxsc\"], \"image/jxsi\": [\"jxsi\"], \"image/jxss\": [\"jxss\"], \"image/ktx\": [\"ktx\"], \"image/ktx2\": [\"ktx2\"], \"image/png\": [\"png\"], \"image/sgi\": [\"sgi\"], \"image/svg+xml\": [\"svg\", \"svgz\"], \"image/t38\": [\"t38\"], \"image/tiff\": [\"tif\", \"tiff\"], \"image/tiff-fx\": [\"tfx\"], \"image/webp\": [\"webp\"], \"image/wmf\": [\"wmf\"], \"message/disposition-notification\": [\"disposition-notification\"], \"message/global\": [\"u8msg\"], \"message/global-delivery-status\": [\"u8dsn\"], \"message/global-disposition-notification\": [\"u8mdn\"], \"message/global-headers\": [\"u8hdr\"], \"message/rfc822\": [\"eml\", \"mime\"], \"model/3mf\": [\"3mf\"], \"model/gltf+json\": [\"gltf\"], \"model/gltf-binary\": [\"glb\"], \"model/iges\": [\"igs\", \"iges\"], \"model/jt\": [\"jt\"], \"model/mesh\": [\"msh\", \"mesh\", \"silo\"], \"model/mtl\": [\"mtl\"], \"model/obj\": [\"obj\"], \"model/prc\": [\"prc\"], \"model/step+xml\": [\"stpx\"], \"model/step+zip\": [\"stpz\"], \"model/step-xml+zip\": [\"stpxz\"], \"model/stl\": [\"stl\"], \"model/u3d\": [\"u3d\"], \"model/vrml\": [\"wrl\", \"vrml\"], \"model/x3d+binary\": [\"*x3db\", \"x3dbz\"], \"model/x3d+fastinfoset\": [\"x3db\"], \"model/x3d+vrml\": [\"*x3dv\", \"x3dvz\"], \"model/x3d+xml\": [\"x3d\", \"x3dz\"], \"model/x3d-vrml\": [\"x3dv\"], \"text/cache-manifest\": [\"appcache\", \"manifest\"], \"text/calendar\": [\"ics\", \"ifb\"], \"text/coffeescript\": [\"coffee\", \"litcoffee\"], \"text/css\": [\"css\"], \"text/csv\": [\"csv\"], \"text/html\": [\"html\", \"htm\", \"shtml\"], \"text/jade\": [\"jade\"], \"text/javascript\": [\"js\", \"mjs\"], \"text/jsx\": [\"jsx\"], \"text/less\": [\"less\"], \"text/markdown\": [\"md\", \"markdown\"], \"text/mathml\": [\"mml\"], \"text/mdx\": [\"mdx\"], \"text/n3\": [\"n3\"], \"text/plain\": [\"txt\", \"text\", \"conf\", \"def\", \"list\", \"log\", \"in\", \"ini\"], \"text/richtext\": [\"rtx\"], \"text/rtf\": [\"*rtf\"], \"text/sgml\": [\"sgml\", \"sgm\"], \"text/shex\": [\"shex\"], \"text/slim\": [\"slim\", \"slm\"], \"text/spdx\": [\"spdx\"], \"text/stylus\": [\"stylus\", \"styl\"], \"text/tab-separated-values\": [\"tsv\"], \"text/troff\": [\"t\", \"tr\", \"roff\", \"man\", \"me\", \"ms\"], \"text/turtle\": [\"ttl\"], \"text/uri-list\": [\"uri\", \"uris\", \"urls\"], \"text/vcard\": [\"vcard\"], \"text/vtt\": [\"vtt\"], \"text/wgsl\": [\"wgsl\"], \"text/xml\": [\"*xml\"], \"text/yaml\": [\"yaml\", \"yml\"], \"video/3gpp\": [\"3gp\", \"3gpp\"], \"video/3gpp2\": [\"3g2\"], \"video/h261\": [\"h261\"], \"video/h263\": [\"h263\"], \"video/h264\": [\"h264\"], \"video/iso.segment\": [\"m4s\"], \"video/jpeg\": [\"jpgv\"], \"video/jpm\": [\"*jpm\", \"*jpgm\"], \"video/mj2\": [\"mj2\", \"mjp2\"], \"video/mp2t\": [\"ts\"], \"video/mp4\": [\"mp4\", \"mp4v\", \"mpg4\"], \"video/mpeg\": [\"mpeg\", \"mpg\", \"mpe\", \"m1v\", \"m2v\"], \"video/ogg\": [\"ogv\"], \"video/quicktime\": [\"qt\", \"mov\"], \"video/webm\": [\"webm\"] };\nObject.freeze(types);\nexport default types;\n//# sourceMappingURL=standard.js.map","var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _Mime_extensionToType, _Mime_typeToExtension, _Mime_typeToExtensions;\nclass Mime {\n    constructor(...args) {\n        _Mime_extensionToType.set(this, new Map());\n        _Mime_typeToExtension.set(this, new Map());\n        _Mime_typeToExtensions.set(this, new Map());\n        for (const arg of args) {\n            this.define(arg);\n        }\n    }\n    define(typeMap, force = false) {\n        for (let [type, extensions] of Object.entries(typeMap)) {\n            type = type.toLowerCase();\n            extensions = extensions.map((ext) => ext.toLowerCase());\n            if (!__classPrivateFieldGet(this, _Mime_typeToExtensions, \"f\").has(type)) {\n                __classPrivateFieldGet(this, _Mime_typeToExtensions, \"f\").set(type, new Set());\n            }\n            const allExtensions = __classPrivateFieldGet(this, _Mime_typeToExtensions, \"f\").get(type);\n            let first = true;\n            for (let extension of extensions) {\n                const starred = extension.startsWith('*');\n                extension = starred ? extension.slice(1) : extension;\n                allExtensions?.add(extension);\n                if (first) {\n                    __classPrivateFieldGet(this, _Mime_typeToExtension, \"f\").set(type, extension);\n                }\n                first = false;\n                if (starred)\n                    continue;\n                const currentType = __classPrivateFieldGet(this, _Mime_extensionToType, \"f\").get(extension);\n                if (currentType && currentType != type && !force) {\n                    throw new Error(`\"${type} -> ${extension}\" conflicts with \"${currentType} -> ${extension}\". Pass \\`force=true\\` to override this definition.`);\n                }\n                __classPrivateFieldGet(this, _Mime_extensionToType, \"f\").set(extension, type);\n            }\n        }\n        return this;\n    }\n    getType(path) {\n        if (typeof path !== 'string')\n            return null;\n        const last = path.replace(/^.*[/\\\\]/, '').toLowerCase();\n        const ext = last.replace(/^.*\\./, '').toLowerCase();\n        const hasPath = last.length < path.length;\n        const hasDot = ext.length < last.length - 1;\n        if (!hasDot && hasPath)\n            return null;\n        return __classPrivateFieldGet(this, _Mime_extensionToType, \"f\").get(ext) ?? null;\n    }\n    getExtension(type) {\n        if (typeof type !== 'string')\n            return null;\n        type = type?.split?.(';')[0];\n        return ((type && __classPrivateFieldGet(this, _Mime_typeToExtension, \"f\").get(type.trim().toLowerCase())) ?? null);\n    }\n    getAllExtensions(type) {\n        if (typeof type !== 'string')\n            return null;\n        return __classPrivateFieldGet(this, _Mime_typeToExtensions, \"f\").get(type.toLowerCase()) ?? null;\n    }\n    _freeze() {\n        this.define = () => {\n            throw new Error('define() not allowed for built-in Mime objects. See https://github.com/broofa/mime/blob/main/README.md#custom-mime-instances');\n        };\n        Object.freeze(this);\n        for (const extensions of __classPrivateFieldGet(this, _Mime_typeToExtensions, \"f\").values()) {\n            Object.freeze(extensions);\n        }\n        return this;\n    }\n    _getTestState() {\n        return {\n            types: __classPrivateFieldGet(this, _Mime_extensionToType, \"f\"),\n            extensions: __classPrivateFieldGet(this, _Mime_typeToExtension, \"f\"),\n        };\n    }\n}\n_Mime_extensionToType = new WeakMap(), _Mime_typeToExtension = new WeakMap(), _Mime_typeToExtensions = new WeakMap();\nexport default Mime;\n//# sourceMappingURL=Mime.js.map","import standardTypes from '../types/standard.js';\nimport Mime from './Mime.js';\nexport { default as Mime } from './Mime.js';\nexport default new Mime(standardTypes)._freeze();\n//# sourceMappingURL=index_lite.js.map","import {\n  DocumentOperations,\n  Action,\n  ValidationError,\n  OperationScope,\n} from \"../types\";\n\nexport function validateOperations<A extends Action>(\n  operations: DocumentOperations<A>,\n) {\n  const errors: ValidationError[] = [];\n  const scopes = Object.keys(operations) as OperationScope[];\n\n  for (const scope of scopes) {\n    const ops = operations[scope].sort((a, b) => a.index - b.index);\n\n    let opIndex = -1;\n\n    for (let i = 0; i < ops.length; i++) {\n      opIndex = opIndex + 1 + ops[i].skip;\n      if (ops[i].index !== opIndex) {\n        errors.push({\n          message: `Invalid operation index ${ops[i].index} at position ${i}`,\n          details: {\n            position: i,\n            operation: ops[i],\n            scope: ops[i].scope,\n          },\n        });\n      }\n    }\n  }\n\n  return errors;\n}\n","import {\n  Operation,\n  OperationScope,\n  Action,\n  DocumentOperations,\n} from \"../types\";\nimport stringify from \"safe-stable-stringify\";\n\nexport type OperationIndex = {\n  index: number;\n  skip: number;\n};\n\nexport enum IntegrityIssueType {\n  UNEXPECTED_INDEX = \"UNEXPECTED_INDEX\",\n}\n\nexport enum IntegrityIssueSubType {\n  DUPLICATED_INDEX = \"DUPLICATED_INDEX\",\n  MISSING_INDEX = \"MISSING_INDEX\",\n}\n\ntype IntegrityIssue = {\n  operation: OperationIndex;\n  issue: IntegrityIssueType;\n  category: IntegrityIssueSubType;\n  message: string;\n};\n\ntype Reshuffle = (\n  startIndex: OperationIndex,\n  opsA: Operation[],\n  opsB: Operation[],\n) => Operation[];\n\nexport function checkCleanedOperationsIntegrity(\n  sortedOperations: Operation[],\n): IntegrityIssue[] {\n  const result: IntegrityIssue[] = [];\n\n  // 1:1 1\n  // 0:0 0 -> 1:0 1 -> 2:0 -> 3:0 -> 4:0 -> 5:0\n  // 0:0 0 -> 2:1 1 -> 3:0 -> 4:0 -> 5:0\n  // 0:0 0 -> 3:2 1 -> 4:0 -> 5:0\n  // 0:0 0 -> 3:2 1 -> 5:1\n\n  // 0:3 (expected 0, got -3)\n  // 1:2 (expected 0, got -1)\n  // 0:0 -> 1:1\n  // 0:0 -> 2:2\n  // 0:0 -> 3:2 -> 5:2\n\n  let currentIndex = -1;\n  for (const nextOperation of sortedOperations) {\n    const nextIndex = nextOperation.index - nextOperation.skip;\n\n    if (nextIndex !== currentIndex + 1) {\n      result.push({\n        operation: {\n          index: nextOperation.index,\n          skip: nextOperation.skip,\n        },\n        issue: IntegrityIssueType.UNEXPECTED_INDEX,\n        category:\n          nextIndex > currentIndex + 1\n            ? IntegrityIssueSubType.MISSING_INDEX\n            : IntegrityIssueSubType.DUPLICATED_INDEX,\n        message: `Expected index ${currentIndex + 1} with skip 0 or equivalent, got index ${nextOperation.index} with skip ${nextOperation.skip}`,\n      });\n    }\n\n    currentIndex = nextOperation.index;\n  }\n\n  return result;\n}\n\n// [] -> []\n// [0:0] -> [0:0]\n\n// 0:0 1:0 2:0 => 0:0 1:0 2:0, removals 0, no issues\n// 0:0 1:1 2:0 => 1:1 2:0, removals 1, no issues\n\n// 0:0 1:1 2:0 3:1 => 1:1 3:1, removals 2, no issues\n// 0:0 1:1 2:0 3:3 => 3:3\n\n// 1:1 2:0 3:0 => 1:1 2:0 3:0, removals 0, no issues\n// 1:0 0:0 2:0 => 2:0, removals 2, issues [UNEXPECTED_INDEX, INDEX_OUT_OF_ORDER]\n// 0:0 1:0 2:0 => 0:0 1:0 2:0, removals 0, no issues\n// 0:0 1:0 2:0 => 0:0 1:0 2:0, removals 0, no issues\n// 0:0 1:0 2:0 => 0:0 1:0 2:0, removals 0, no issues\n\nexport function garbageCollect<A extends OperationIndex>(\n  sortedOperations: A[],\n): A[] {\n  const result: A[] = [];\n\n  let i = sortedOperations.length - 1;\n\n  while (i > -1) {\n    result.unshift(sortedOperations[i]);\n    const skipUntil =\n      (sortedOperations[i]?.index || 0) - (sortedOperations[i]?.skip || 0) - 1;\n\n    let j = i - 1;\n    while (j > -1 && (sortedOperations[j]?.index || 0) > skipUntil) {\n      j--;\n    }\n\n    i = j;\n  }\n\n  return result;\n}\n\nexport function addUndo(sortedOperations: Operation[]): Operation[] {\n  const operationsCopy = [...sortedOperations];\n  const latestOperation = operationsCopy[operationsCopy.length - 1];\n\n  if (!latestOperation) return operationsCopy;\n\n  if (latestOperation.type === \"NOOP\") {\n    operationsCopy.push({\n      ...latestOperation,\n      index: latestOperation.index,\n      type: \"NOOP\",\n      skip: nextSkipNumber(sortedOperations),\n    });\n  } else {\n    operationsCopy.push({\n      type: \"NOOP\",\n      index: latestOperation.index + 1,\n      timestamp: new Date().toISOString(),\n      input: {},\n      skip: 1,\n      scope: latestOperation.scope,\n      hash: latestOperation.hash,\n    });\n  }\n\n  return operationsCopy;\n}\n\n// [0:0 2:0 1:0 3:3 3:1] => [0:0 1:0 2:0 3:1 3:3]\n// Sort by index _and_ skip number\nexport function sortOperations<A extends OperationIndex>(operations: A[]): A[] {\n  return operations\n    .slice()\n    .sort((a, b) => a.skip - b.skip)\n    .sort((a, b) => a.index - b.index);\n}\n\n// [0:0, 1:0, 2:0, A3:0, A4:0, A5:0] + [0:0, 1:0, 2:0, B3:0, B4:2, B5:0]\n// GC               => [0:0, 1:0, 2:0, A3:0, A4:0, A5:0] + [0:0, 1:0, B4:2, B5:0]\n// Split            => [0:0, 1:0] + [2:0, A3:0, A4:0, A5:0] + [B4:2, B5:0]\n// Reshuffle(6:4)   => [6:4, 7:0, 8:0, 9:0, 10:0, 11:0]\n// merge            => [0:0, 1:0, 6:4, 7:0, 8:0, 9:0, 10:0, 11:0]\nexport const reshuffleByTimestamp: Reshuffle = (startIndex, opsA, opsB) => {\n  return [...opsA, ...opsB]\n    .sort(\n      (a, b) =>\n        new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime(),\n    )\n    .map((op, i) => ({\n      ...op,\n      index: startIndex.index + i,\n      skip: i === 0 ? startIndex.skip : 0,\n    }));\n};\n\nexport const reshuffleByTimestampAndIndex: Reshuffle = (\n  startIndex,\n  opsA,\n  opsB,\n) => {\n  return [...opsA, ...opsB]\n    .sort(\n      (a, b) =>\n        new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime(),\n    )\n    .sort((a, b) => a.index - b.index)\n    .map((op, i) => ({\n      ...op,\n      index: startIndex.index + i,\n      skip: i === 0 ? startIndex.skip : 0,\n    }));\n};\n\n// TODO: implement better operation equality function\nexport function operationsAreEqual(op1: Operation, op2: Operation) {\n  return stringify(op1) === stringify(op2);\n}\n\n// [T0:0 T1:0 T2:0 T3:0] + [B4:0 B5:0] = [T0:0 T1:0 T2:0 T3:0 B4:0 B5:0]\n// [T0:0 T1:0 T2:0 T3:0] + [B3:0 B4:0] = [T0:0 T1:0 T2:0 B3:0 B4:0]\n// [T0:0 T1:0 T2:0 T3:0] + [B2:0 B3:0] = [T0:0 T1:0 B2:0 B3:0]\n\n// [T0:0 T1:0 T2:0 T3:0] + [B4:0 B4:2] = [T0:0 T1:0 T2:0 T3:0 B4:0 B4:2]\n// [T0:0 T1:0 T2:0 T3:0] + [B3:0 B3:2] = [T0:0 T1:0 T2:0 B3:0 B3:2]\n// [T0:0 T1:0 T2:0 T3:0] + [B2:3 B3:0] = [T0:0 T1:0 B2:3 B3:0]\n\nexport function attachBranch(\n  trunk: Operation[],\n  newBranch: Operation[],\n): [Operation[], Operation[]] {\n  const trunkCopy = garbageCollect(sortOperations(trunk.slice()));\n  const newOperations = garbageCollect(sortOperations(newBranch.slice()));\n  if (trunkCopy.length < 1) {\n    return [newOperations, []];\n  }\n\n  const result: Operation[] = [];\n  let enteredBranch = false;\n\n  while (newOperations.length > 0) {\n    const newOperationCandidate = newOperations[0];\n\n    let nextTrunkOperation = trunkCopy.shift();\n    while (\n      nextTrunkOperation &&\n      precedes(nextTrunkOperation, newOperationCandidate)\n    ) {\n      result.push(nextTrunkOperation);\n      nextTrunkOperation = trunkCopy.shift();\n    }\n\n    if (!nextTrunkOperation) {\n      enteredBranch = true;\n    } else if (!enteredBranch) {\n      if (operationsAreEqual(nextTrunkOperation, newOperationCandidate)) {\n        newOperations.shift();\n        result.push(nextTrunkOperation);\n      } else {\n        trunkCopy.unshift(nextTrunkOperation);\n        enteredBranch = true;\n      }\n    }\n\n    if (enteredBranch) {\n      let nextAppend = newOperations.shift();\n      while (nextAppend) {\n        result.push(nextAppend);\n        nextAppend = newOperations.shift();\n      }\n    }\n  }\n\n  if (!enteredBranch) {\n    let nextAppend = trunkCopy.shift();\n    while (nextAppend) {\n      result.push(nextAppend);\n      nextAppend = trunkCopy.shift();\n    }\n  }\n\n  return [garbageCollect(result), trunkCopy];\n}\n\nexport function precedes(op1: Operation, op2: Operation) {\n  return (\n    op1.index < op2.index ||\n    (op1.index === op2.index && op1.id === op2.id && op1.skip < op2.skip)\n  );\n}\n\nexport function split(\n  sortedTargetOperations: Operation[],\n  sortedMergeOperations: Operation[],\n): [Operation[], Operation[], Operation[]] {\n  const commonOperations: Operation[] = [];\n  const targetDiffOperations: Operation[] = [];\n  const mergeDiffOperations: Operation[] = [];\n\n  // get bigger array length\n  const maxLength = Math.max(\n    sortedTargetOperations.length,\n    sortedMergeOperations.length,\n  );\n\n  let splitHappened = false;\n  for (let i = 0; i < maxLength; i++) {\n    const targetOperation = sortedTargetOperations[i];\n    const mergeOperation = sortedMergeOperations[i];\n\n    if (targetOperation && mergeOperation) {\n      if (\n        !splitHappened &&\n        operationsAreEqual(targetOperation, mergeOperation)\n      ) {\n        commonOperations.push(targetOperation);\n      } else {\n        splitHappened = true;\n        targetDiffOperations.push(targetOperation);\n        mergeDiffOperations.push(mergeOperation);\n      }\n    } else if (targetOperation) {\n      targetDiffOperations.push(targetOperation);\n    } else if (mergeOperation) {\n      mergeDiffOperations.push(mergeOperation);\n    }\n  }\n\n  return [commonOperations, targetDiffOperations, mergeDiffOperations];\n}\n\n// [0:0, 1:0, 2:0, A3:0, A4:0, A5:0] + [0:0, 1:0, 2:0, B3:0, B4:2, B5:0]\n// GC               => [0:0, 1:0, 2:0, A3:0, A4:0, A5:0] + [0:0, 1:0, B4:2, B5:0]\n// Split            => [0:0, 1:0] + [2:0, A3:0, A4:0, A5:0] + [B4:2, B5:0]\n// Reshuffle(6:4)   => [6:4, 7:0, 8:0, 9:0, 10:0, 11:0]\n// merge            => [0:0, 1:0, 6:4, 7:0, 8:0, 9:0, 10:0, 11:0]\nexport function merge(\n  sortedTargetOperations: Operation[],\n  sortedMergeOperations: Operation[],\n  reshuffle: Reshuffle,\n): Operation[] {\n  const [_commonOperations, _targetOperations, _mergeOperations] = split(\n    garbageCollect(sortedTargetOperations),\n    garbageCollect(sortedMergeOperations),\n  );\n\n  const maxCommonIndex = getMaxIndex(_commonOperations);\n  const nextIndex =\n    1 +\n    Math.max(\n      maxCommonIndex,\n      getMaxIndex(_targetOperations),\n      getMaxIndex(_mergeOperations),\n    );\n\n  const filteredMergeOperations = filterDuplicatedOperations(\n    _mergeOperations,\n    _targetOperations,\n  );\n\n  const newOperationHistory = reshuffle(\n    {\n      index: nextIndex,\n      skip: nextIndex - (maxCommonIndex + 1),\n    },\n    _targetOperations,\n    filteredMergeOperations,\n  );\n\n  return _commonOperations.concat(newOperationHistory);\n}\n\nfunction getMaxIndex(sortedOperations: Operation[]) {\n  const lastElement = sortedOperations[sortedOperations.length - 1];\n  if (!lastElement) {\n    return -1;\n  }\n\n  return lastElement.index;\n}\n\n// [] => -1\n// [0:0] => -1\n// [0:0 1:0] => 1\n// [0:0 1:1] => -1\n// [1:1] => -1\n// [0:0 1:0 2:0] => 1\n// [0:0 1:0 2:0 2:1] => 2\n// [0:0 1:0 2:0 2:1 2:2] => -1\n// [0:0 1:1 2:0] => 2\n// [0:0 1:1 2:2] => -1\n// [0:0 1:1 2:0 3:0] => 1\n// [0:0 1:1 2:0 3:1] => 3\n// [0:0 1:1 2:0 3:3] => -1\n// [50:50 100:50 150:50 151:0 152:0 153:0 154:3] => 53\n\nexport function nextSkipNumber<A extends OperationIndex>(\n  sortedOperations: A[],\n): number {\n  if (sortedOperations.length < 1) {\n    return -1;\n  }\n\n  const cleanedOperations = garbageCollect(sortedOperations);\n\n  let nextSkip =\n    (cleanedOperations[cleanedOperations.length - 1]?.skip || 0) + 1;\n\n  if (cleanedOperations.length > 1) {\n    nextSkip += cleanedOperations[cleanedOperations.length - 2]?.skip || 0;\n  }\n\n  return (cleanedOperations[cleanedOperations.length - 1]?.index || -1) <\n    nextSkip\n    ? -1\n    : nextSkip;\n}\n\nexport const checkOperationsIntegrity = (\n  operations: Operation[],\n): IntegrityIssue[] => {\n  return checkCleanedOperationsIntegrity(\n    garbageCollect(sortOperations(operations)),\n  );\n};\n\nexport type OperationsByScope = Partial<Record<OperationScope, Operation[]>>;\n\nexport const groupOperationsByScope = (\n  operations: Operation[],\n): OperationsByScope => {\n  const result = operations.reduce<OperationsByScope>((acc, operation) => {\n    if (!acc[operation.scope]) {\n      acc[operation.scope] = [];\n    }\n\n    acc[operation.scope]?.push(operation);\n\n    return acc;\n  }, {});\n\n  return result;\n};\n\ntype PrepareOperationsResult = {\n  validOperations: Operation[];\n  invalidOperations: Operation[];\n  duplicatedOperations: Operation[];\n  integrityIssues: IntegrityIssue[];\n};\n\nexport const prepareOperations = (\n  operationsHistory: Operation[],\n  newOperations: Operation[],\n): PrepareOperationsResult => {\n  const result: PrepareOperationsResult = {\n    integrityIssues: [],\n    validOperations: [],\n    invalidOperations: [],\n    duplicatedOperations: [],\n  };\n\n  const sortedOperationsHistory = sortOperations(operationsHistory);\n  const sortedOperations = sortOperations(newOperations);\n\n  const integrityErrors = checkCleanedOperationsIntegrity([\n    ...sortedOperationsHistory,\n    ...sortedOperations,\n  ]);\n\n  const missingIndexErrors = integrityErrors.filter(\n    (integrityIssue) =>\n      integrityIssue.category === IntegrityIssueSubType.MISSING_INDEX,\n  );\n\n  // get the integrity error with the lowest index operation\n  const firstMissingIndexOperation = [...missingIndexErrors]\n    .sort((a, b) => b.operation.index - a.operation.index)\n    .pop()?.operation;\n\n  for (const newOperation of sortedOperations) {\n    // Operation is missing index or it follows an operation that is missing index\n    if (\n      firstMissingIndexOperation &&\n      newOperation.index >= firstMissingIndexOperation.index\n    ) {\n      result.invalidOperations.push(newOperation);\n      continue;\n    }\n\n    // check if operation is duplicated\n    const isDuplicatedOperation = integrityErrors.some((integrityError) => {\n      return (\n        integrityError.operation.index === newOperation.index &&\n        integrityError.operation.skip === newOperation.skip &&\n        integrityError.category === IntegrityIssueSubType.DUPLICATED_INDEX\n      );\n    });\n\n    // add to duplicated operations if it is duplicated\n    if (isDuplicatedOperation) {\n      result.duplicatedOperations.push(newOperation);\n      continue;\n    }\n\n    // otherwise, add to valid operations\n    result.validOperations.push(newOperation);\n  }\n\n  result.integrityIssues.push(...integrityErrors);\n  return result;\n};\n\nexport function removeExistingOperations(\n  newOperations: Operation[],\n  operationsHistory: Operation[],\n): Operation[] {\n  return newOperations.filter((newOperation) => {\n    return !operationsHistory.some((historyOperation) => {\n      return (\n        (newOperation.type === \"NOOP\" &&\n          newOperation.skip === 0 &&\n          newOperation.index === historyOperation.index) ||\n        (newOperation.index === historyOperation.index &&\n          newOperation.skip === historyOperation.skip &&\n          newOperation.scope === historyOperation.scope &&\n          newOperation.hash === historyOperation.hash &&\n          newOperation.type === historyOperation.type)\n      );\n    });\n  });\n}\n\nexport type SkipHeaderOperationIndex = Partial<Pick<OperationIndex, \"index\">> &\n  Pick<OperationIndex, \"skip\">;\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 */\nexport function skipHeaderOperations<A extends OperationIndex>(\n  operations: A[],\n  skipHeaderOperation: SkipHeaderOperationIndex,\n): A[] {\n  const [lastOperation] = sortOperations(operations).slice(-1);\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n  const lastIndex = lastOperation?.index ?? -1;\n  const nextIndex = lastIndex + 1;\n\n  const skipOperationIndex = {\n    ...skipHeaderOperation,\n    index: skipHeaderOperation.index ?? nextIndex,\n  };\n\n  if (skipOperationIndex.index < lastIndex) {\n    throw new Error(\n      `The skip header operation index must be greater than or equal to ${lastIndex}`,\n    );\n  }\n\n  const clearedOperations = garbageCollect(\n    sortOperations([...operations, skipOperationIndex]),\n  );\n\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n  return (clearedOperations || []).slice(0, -1) as A[];\n}\n\nexport function garbageCollectDocumentOperations<A extends Action>(\n  documentOperations: DocumentOperations<A>,\n): DocumentOperations<A> {\n  const clearedOperations = Object.entries(documentOperations).reduce(\n    (acc, entry) => {\n      const [scope, ops] = entry;\n\n      return {\n        ...acc,\n        [scope as OperationScope]: garbageCollect(sortOperations(ops)),\n      };\n    },\n    {},\n  );\n\n  return {\n    ...clearedOperations,\n  } as DocumentOperations<A>;\n}\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 */\nexport function filterDuplicatedOperations(\n  targetOperations: Operation[],\n  sourceOperations: Operation[],\n): Operation[] {\n  return targetOperations.filter((op) => {\n    if (op.id) {\n      return !sourceOperations.some((targetOp) => targetOp.id === op.id);\n    }\n\n    return true;\n  });\n}\n\nexport function filterDocumentOperationsResultingState<A extends Action>(\n  documentOperations?: DocumentOperations<A>,\n) {\n  if (!documentOperations) {\n    return {};\n  }\n\n  const entries = Object.entries(documentOperations);\n\n  return entries.reduce<DocumentOperations<A>>(\n    (acc, [scope, operations]) => ({\n      ...acc,\n      [scope]: operations.map((op) => {\n        const { resultingState, ...restProps } = op;\n\n        return restProps;\n      }),\n    }),\n    {} as DocumentOperations<A>,\n  );\n}\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 A - The type of the operations.\n * @param {A[]} clearedOperationsA - The first array of operations.\n * @param {A[]} clearedOperationsB - The second array of operations.\n * @returns {A[]} - The difference between the two arrays of operations.\n */\nexport function diffOperations<A extends OperationIndex>(\n  clearedOperationsA: A[],\n  clearedOperationsB: A[],\n): A[] {\n  return clearedOperationsA.filter(\n    (operationA) =>\n      !clearedOperationsB.some(\n        (operationB) => operationA.index === operationB.index,\n      ),\n  );\n}\n","import JSZip from \"jszip\";\nimport mime from \"mime/lite\";\nimport type {\n  Action,\n  Attachment,\n  AttachmentInput,\n  Document,\n  DocumentHeader,\n  DocumentOperations,\n  ExtendedState,\n  Reducer,\n} from \"../types\";\nimport { fetchFile, getFile, hash, readFile, writeFile } from \"./node\";\nimport { replayDocument, ReplayDocumentOptions } from \"./base\";\nimport { validateOperations } from \"./validation\";\nimport {\n  filterDocumentOperationsResultingState,\n  garbageCollectDocumentOperations,\n} from \"./document-helpers\";\n\nexport type FileInput = string | number[] | Uint8Array | ArrayBuffer | Blob;\n\nexport const createZip = async (document: Document) => {\n  // create zip file\n  const zip = new JSZip();\n\n  const { name, revision, documentType, created, lastModified } = document;\n  const header: DocumentHeader = {\n    name,\n    revision,\n    documentType,\n    created,\n    lastModified,\n  };\n  zip.file(\"header.json\", JSON.stringify(header, null, 2));\n  zip.file(\"state.json\", JSON.stringify(document.initialState || {}, null, 2));\n  zip.file(\"current-state.json\", JSON.stringify(document.state || {}, null, 2));\n  zip.file(\n    \"operations.json\",\n    JSON.stringify(\n      filterDocumentOperationsResultingState(document.operations),\n      null,\n      2,\n    ),\n  );\n\n  if (document.attachments) {\n    const attachments = Object.keys(document.attachments);\n    attachments.forEach((key) => {\n      const { data, ...attributes } = document.attachments[key];\n      zip.file(key, data, {\n        base64: true,\n        createFolders: true,\n        comment: JSON.stringify(attributes),\n      });\n    });\n  }\n\n  return zip;\n};\n\n/**\n * Saves a document to a ZIP file.\n *\n * @remarks\n * This function creates a ZIP file containing the document's state, operations,\n * and file attachments. The file is saved to the specified path.\n *\n * @param document - The document to save to the file.\n * @param path - The path to save the file to.\n * @param extension - The extension to use for the file.\n * @returns A promise that resolves to the path of the saved file.\n */\nexport const saveToFile = async (\n  document: Document,\n  path: string,\n  extension: string,\n  name?: string,\n): Promise<string> => {\n  // create zip file\n  const zip = await createZip(document);\n  const file = await zip.generateAsync({\n    type: \"uint8array\",\n    streamFiles: true,\n  });\n  const fileName = name ?? document.name;\n  const fileExtension = `.${extension}.zip`;\n\n  return writeFile(\n    path,\n    fileName.endsWith(fileExtension) ? fileName : `${fileName}${fileExtension}`,\n    file,\n  );\n};\n\nexport const saveToFileHandle = async (\n  document: Document,\n  input: FileSystemFileHandle,\n) => {\n  const zip = await createZip(document);\n  const blob = await zip.generateAsync({ type: \"blob\" });\n  const writable = await input.createWritable();\n  await writable.write(blob);\n  await writable.close();\n};\n\n/**\n * Loads a document from a ZIP file.\n *\n * @remarks\n * This function reads a ZIP file and returns the document state after\n * applying all the operations. The reducer is used to apply the operations.\n *\n * @typeParam S - The type of the state object.\n * @typeParam A - The type of the actions that can be applied to the state object.\n *\n * @param path - The path to the ZIP file.\n * @param reducer - The reducer to apply the operations to the state object.\n * @returns A promise that resolves to the document state after applying all the operations.\n * @throws An error if the initial state or the operations history is not found in the ZIP file.\n */\nexport const loadFromFile = async <S, A extends Action, L>(\n  path: string,\n  reducer: Reducer<S, A, L>,\n  options?: ReplayDocumentOptions,\n) => {\n  const file = readFile(path);\n  return loadFromInput(file, reducer, options);\n};\n\nexport const loadFromInput = async <S, A extends Action, L>(\n  input: FileInput,\n  reducer: Reducer<S, A, L>,\n  options?: ReplayDocumentOptions,\n) => {\n  const zip = new JSZip();\n  await zip.loadAsync(input);\n  return loadFromZip(zip, reducer, options);\n};\n\nasync function loadFromZip<S, A extends Action, L>(\n  zip: JSZip,\n  reducer: Reducer<S, A, L>,\n  options?: ReplayDocumentOptions,\n) {\n  const initialStateZip = zip.file(\"state.json\");\n  if (!initialStateZip) {\n    throw new Error(\"Initial state not found\");\n  }\n  const initialStateStr = await initialStateZip.async(\"string\");\n  const initialState = JSON.parse(initialStateStr) as ExtendedState<S, L>;\n\n  const headerZip = zip.file(\"header.json\");\n  let header: DocumentHeader | undefined = undefined;\n  if (headerZip) {\n    header = JSON.parse(await headerZip.async(\"string\")) as DocumentHeader;\n  }\n\n  const operationsZip = zip.file(\"operations.json\");\n  if (!operationsZip) {\n    throw new Error(\"Operations history not found\");\n  }\n\n  const operations = JSON.parse(\n    await operationsZip.async(\"string\"),\n  ) as DocumentOperations<A>;\n\n  const clearedOperations = garbageCollectDocumentOperations(operations);\n\n  const operationsError = validateOperations(clearedOperations);\n  if (operationsError.length) {\n    const errorMessages = operationsError.map((err) => err.message);\n    throw new Error(errorMessages.join(\"\\n\"));\n  }\n\n  let result = replayDocument(\n    initialState,\n    clearedOperations,\n    reducer,\n    undefined,\n    header,\n    {},\n    options,\n  );\n  if (header) {\n    result = {\n      ...result,\n      ...header,\n    };\n  }\n  return result;\n}\n\nfunction getFileAttributes(\n  file: string,\n): Omit<Attachment, \"data\" | \"mimeType\"> {\n  const extension = file.replace(/^.*\\./, \"\") || undefined;\n  const fileName = file.replace(/^.*[/\\\\]/, \"\") || undefined;\n  return { extension, fileName };\n}\n\n/**\n * Fetches an attachment from a URL and returns its base64-encoded data and MIME type.\n * @param url - The URL of the attachment to fetch.\n * @returns A Promise that resolves to an object containing the base64-encoded data and MIME type of the attachment.\n */\nexport async function getRemoteFile(url: string): Promise<AttachmentInput> {\n  const { buffer, mimeType = \"application/octet-stream\" } =\n    await fetchFile(url);\n  const attributes = getFileAttributes(url);\n  const data = buffer.toString(\"base64\");\n  return {\n    data,\n    hash: hash(data),\n    mimeType,\n    ...attributes,\n  };\n}\n\n/**\n * Reads an attachment from a file and returns its base64-encoded data and MIME type.\n * @param path - The path of the attachment file to read.\n * @returns A Promise that resolves to an object containing the base64-encoded data and MIME type of the attachment.\n */\nexport async function getLocalFile(path: string): Promise<AttachmentInput> {\n  const buffer = await getFile(path);\n  const mimeType = mime.getType(path) || \"application/octet-stream\";\n  const attributes = getFileAttributes(path);\n  const data = buffer.toString(\"base64\");\n  return { data, hash: hash(data), mimeType, ...attributes };\n}\n","import { castDraft, create } from \"mutative\";\nimport {\n  Action,\n  Document,\n  ImmutableStateReducer,\n  Operation,\n  PruneAction,\n  RedoAction,\n  State,\n  UndoAction,\n  UndoRedoProcessResult,\n} from \"../types\";\nimport { hashDocument, replayOperations } from \"../utils/base\";\nimport { loadState, noop } from \"./creators\";\nimport { documentHelpers } from \"../utils\";\n\n// updates the name of the document\nexport function setNameOperation<T>(document: T, name: string): T {\n  return { ...document, name };\n}\n\nexport function noopOperation<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: Partial<Operation>,\n  skip: number,\n) {\n  const defaultValues = {\n    skip,\n    document,\n  };\n\n  const { scope } = action;\n\n  if (!scope) return defaultValues;\n  if (action.skip === undefined) return defaultValues;\n\n  return create(defaultValues, (draft) => {\n    const lastOperation = draft.document.operations[scope].at(-1);\n\n    if (action.skip && action.skip > 0) {\n      draft.skip = action.skip;\n    }\n\n    if (\n      lastOperation &&\n      lastOperation.type === \"NOOP\" &&\n      action.index === lastOperation.index &&\n      draft.skip > lastOperation.skip\n    ) {\n      draft.document.operations[scope].pop();\n    }\n  });\n}\n\nexport function undoOperation<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: UndoAction,\n  skip: number,\n): UndoRedoProcessResult<T, A, L> {\n  // const scope = action.scope;\n  const { scope, input } = action;\n\n  const defaultResult: UndoRedoProcessResult<T, A, L> = {\n    document,\n    action,\n    skip,\n    reuseLastOperationIndex: false,\n  };\n\n  return create(defaultResult, (draft) => {\n    const operations = [...document.operations[scope]];\n    const sortedOperations = documentHelpers.sortOperations(operations);\n\n    draft.action = noop(scope);\n\n    const lastOperation = sortedOperations.at(-1);\n    let nextIndex = lastOperation?.index ?? -1;\n\n    const isNewNoop = lastOperation?.type !== \"NOOP\";\n\n    if (isNewNoop) {\n      nextIndex = nextIndex + 1;\n    } else {\n      draft.reuseLastOperationIndex = true;\n    }\n\n    const nextOperationHistory = isNewNoop\n      ? [...sortedOperations, { index: nextIndex, skip: 0 }]\n      : sortedOperations;\n\n    draft.skip = documentHelpers.nextSkipNumber(nextOperationHistory);\n\n    if (lastOperation && draft.skip > lastOperation.skip + 1) {\n      // there's an overlap with a previous skip operation\n      // (add 1 to the skip value because we are adding a new operation to the history)\n      draft.skip = draft.skip + 1;\n    }\n\n    if (draft.skip < 0) {\n      throw new Error(\n        `Cannot undo: you can't undo more operations than the ones in the scope history`,\n      );\n    }\n  });\n}\n\nexport function redoOperation<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: RedoAction,\n  skip: number,\n): UndoRedoProcessResult<T, A, L> {\n  const { scope, input } = action;\n\n  const defaultResult: UndoRedoProcessResult<T, A, L> = {\n    document,\n    action,\n    skip,\n    reuseLastOperationIndex: false,\n  };\n\n  return create(defaultResult, (draft) => {\n    if (draft.skip > 0) {\n      throw new Error(\n        `Cannot redo: skip value from reducer cannot be used with REDO action`,\n      );\n    }\n\n    if (input > 1) {\n      throw new Error(`Cannot redo: you can only redo one operation at a time`);\n    }\n\n    if (input < 1) {\n      throw new Error(`Invalid REDO action: invalid redo input value`);\n    }\n\n    if (draft.document.clipboard.length < 1) {\n      throw new Error(`Cannot redo: no operations in the clipboard`);\n    }\n\n    const operationIndex = draft.document.clipboard.findLastIndex(\n      (op) => op.scope === scope,\n    );\n    if (operationIndex < 0) {\n      throw new Error(\n        `Cannot redo: no operations in clipboard for scope \"${scope}\"`,\n      );\n    }\n\n    const operation = draft.document.clipboard.splice(operationIndex, 1)[0];\n\n    draft.action = castDraft({\n      type: operation.type,\n      scope: operation.scope,\n      input: operation.input,\n    } as A);\n  });\n}\n\nexport function pruneOperation<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: PruneAction,\n  wrappedReducer: ImmutableStateReducer<T, A, L>,\n): Document<T, A, L> {\n  const { scope } = action;\n  const operations = document.operations[scope];\n\n  let {\n    input: { start, end },\n  } = action;\n  start = start || 0;\n  end = end || operations.length;\n\n  const actionsToPrune = operations.slice(start, end);\n  const actionsToKeepStart = operations.slice(0, start);\n  const actionsToKeepEnd = operations.slice(end);\n\n  // runs all operations from the initial state to\n  // the end of prune to get name and data\n  const newDocument = replayOperations(\n    document.initialState,\n    {\n      ...document.operations,\n      [scope]: actionsToKeepStart.concat(actionsToPrune),\n    },\n    wrappedReducer,\n  );\n\n  const { name, state: newState } = newDocument;\n\n  // the new operation has the index of the first pruned operation\n  const loadStateIndex = actionsToKeepStart.length;\n\n  // if and operation is pruned then reuses the timestamp of the last operation\n  // if not then assigns the timestamp of the following unpruned operation\n  const loadStateTimestamp = actionsToKeepStart.length\n    ? actionsToKeepStart[actionsToKeepStart.length - 1].timestamp\n    : actionsToKeepEnd.length\n      ? actionsToKeepEnd[0].timestamp\n      : new Date().toISOString();\n\n  // replaces pruned operations with LOAD_STATE\n  return replayOperations(\n    document.initialState,\n    {\n      ...document.operations,\n      [scope]: [\n        ...actionsToKeepStart,\n        {\n          ...loadState({ name, state: newState }, actionsToPrune.length),\n          timestamp: loadStateTimestamp,\n          index: loadStateIndex,\n          hash: hashDocument({ state: newState }, \"global\"),\n        },\n        ...actionsToKeepEnd\n          // updates the index for all the following operations\n          .map((action, index) => ({\n            ...action,\n            index: loadStateIndex + index + 1,\n          })),\n      ],\n    },\n    wrappedReducer,\n  );\n}\n\nexport function loadStateOperation<T, A extends Action, L>(\n  oldDocument: Document<T, A, L>,\n  newDocument: { name: string; state?: State<T, L> },\n): Document<T, A, L> {\n  return {\n    ...oldDocument,\n    name: newDocument.name,\n    state: newDocument.state ?? ({ global: {}, local: {} } as State<T, L>),\n  };\n}\n\nexport * from \"./creators\";\n","import type { Action } from \"../types\";\nimport type {\n  LoadStateActionInput,\n  PruneActionInput,\n  RedoAction as _RedoAction,\n  SetNameAction as _SetNameAction,\n  UndoAction as _UndoAction,\n} from \"../schema/types\";\n\nexport const SET_NAME = \"SET_NAME\";\nexport const UNDO = \"UNDO\";\nexport const REDO = \"REDO\";\nexport const PRUNE = \"PRUNE\";\nexport const LOAD_STATE = \"LOAD_STATE\";\nexport const NOOP = \"NOOP\";\n\nexport type LoadStateAction = Action<\"LOAD_STATE\", LoadStateActionInput>;\nexport type PruneAction = Action<\"PRUNE\", PruneActionInput>;\nexport type RedoAction = Action<\"REDO\", _RedoAction[\"input\"]>;\nexport type SetNameAction = Action<\"SET_NAME\", _SetNameAction[\"input\"]>;\nexport type UndoAction = Action<\"UNDO\", _UndoAction[\"input\"]>;\nexport type NOOPAction = Action<\"NOOP\">;\n\nexport type BaseAction =\n  | LoadStateAction\n  | PruneAction\n  | RedoAction\n  | SetNameAction\n  | UndoAction\n  | NOOPAction;\n","import { create, castDraft, Draft, unsafe } from \"mutative\";\nimport { v4 as uuid } from \"uuid\";\nimport {\n  loadStateOperation,\n  pruneOperation,\n  redoOperation,\n  setNameOperation,\n  undoOperation,\n} from \"./actions\";\nimport {\n  BaseAction,\n  LOAD_STATE,\n  PRUNE,\n  REDO,\n  SET_NAME,\n  UNDO,\n} from \"./actions/types\";\nimport { UndoRedoAction, z } from \"./schema\";\nimport {\n  Action,\n  Document,\n  ImmutableStateReducer,\n  Operation,\n  OperationScope,\n  ReducerOptions,\n  State,\n} from \"./types\";\nimport {\n  isBaseAction,\n  hashDocument,\n  replayOperations,\n  isUndoRedo,\n  isUndo,\n  getDocumentLastModified,\n  parseResultingState,\n} from \"./utils/base\";\nimport { SignalDispatch } from \"./signal\";\nimport * as documentHelpers from \"./utils/document-helpers\";\n\n/**\n * Gets the next revision number 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 * @returns The next revision number.\n */\nfunction getNextRevision(\n  document: Document,\n  action: Action | Operation,\n): number {\n  let latestOperation: Operation | undefined;\n\n  if (\"index\" in action) {\n    latestOperation = { ...action };\n  } else {\n    latestOperation = document.operations[action.scope].at(-1);\n  }\n\n  return (latestOperation?.index ?? -1) + 1;\n}\n\n/**\n * Updates the document header with the latest revision number and\n * date of last modification.\n *\n * @param state The current state of the document.\n * @param action The action being applied to the document.\n * @returns The updated document state.\n */\nexport function updateHeader<T extends Document>(\n  document: T,\n  action: Action,\n): T {\n  return {\n    ...document,\n    revision: {\n      ...document.revision,\n      [action.scope]: getNextRevision(document, action),\n    },\n    lastModified: getDocumentLastModified(document),\n  };\n}\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 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 * @returns The updated document state.\n */\nfunction updateOperations<T extends Document>(\n  document: T,\n  action: Action | Operation,\n  skip = 0,\n  reuseLastOperationIndex = false,\n): T {\n  // UNDO, REDO and PRUNE are meta operations\n  // that alter the operations history themselves\n  if ([UNDO, REDO, PRUNE].includes(action.type)) {\n    return document;\n  }\n\n  const { scope } = action;\n  const operations = document.operations[scope].slice();\n  let operationId: string | undefined;\n\n  const latestOperation = operations.at(-1);\n  const lastOperationIndex = latestOperation?.index ?? -1;\n\n  let nextIndex = reuseLastOperationIndex\n    ? lastOperationIndex\n    : lastOperationIndex + 1;\n\n  let timestamp = new Date().toISOString();\n\n  if (\"index\" in action) {\n    if (action.index - skip > nextIndex) {\n      throw new Error(\n        `Missing operations: expected ${nextIndex} with skip 0 or equivalent, got index ${action.index} with skip ${skip}`,\n      );\n    }\n\n    nextIndex = action.index;\n    operationId = action.id;\n\n    timestamp = action.timestamp;\n  } else {\n    operationId = \"id\" in action ? (action.id as string) : uuid();\n  }\n\n  operations.push({\n    ...action,\n    id: operationId,\n    index: nextIndex,\n    timestamp,\n    hash: \"\",\n    scope,\n    skip,\n    error: undefined,\n  });\n\n  // adds the action to the operations history with\n  // the latest index and current timestamp\n  return {\n    ...document,\n    operations: { ...document.operations, [scope]: operations },\n  };\n}\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 * @returns The updated document state.\n */\nexport function updateDocument<T extends Document>(\n  document: T,\n  action: Action,\n  skip = 0,\n  reuseLastOperationIndex = false,\n) {\n  let newDocument = updateOperations(\n    document,\n    action,\n    skip,\n    reuseLastOperationIndex,\n  );\n  newDocument = updateHeader(newDocument, action);\n  return newDocument;\n}\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<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: BaseAction,\n  wrappedReducer: ImmutableStateReducer<T, A, L>,\n): Document<T, A, L> {\n  // throws if action is not valid base action\n  z.BaseActionSchema().parse(action);\n\n  switch (action.type) {\n    case SET_NAME:\n      return setNameOperation(document, action.input);\n    case PRUNE:\n      return pruneOperation(document, action, wrappedReducer);\n    case LOAD_STATE:\n      return loadStateOperation(document, action.input.state);\n    default:\n      return document;\n  }\n}\n\ntype UndoRedoProcessResult<T, A extends Action, L> = {\n  document: Document<T, A, L>;\n  action: A | BaseAction;\n  skip: number;\n  reuseLastOperationIndex: boolean;\n};\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 apply).\n */\nexport function processUndoRedo<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: UndoRedoAction,\n  skip: number,\n): UndoRedoProcessResult<T, A, L> {\n  switch (action.type) {\n    case UNDO:\n      return undoOperation(document, action, skip);\n    case REDO:\n      return redoOperation(document, action, skip);\n    default:\n      return { document, action, skip, reuseLastOperationIndex: false };\n  }\n}\n\n/**\n * Processes a skip operation on a document.\n *\n * @template T - The type of the document state.\n * @template A - The type of the document actions.\n * @template L - The type of the document labels.\n * @param {Document<T, A, L>} document - The document to process the skip operation on.\n * @param {A | BaseAction | Operation} action - The action or operation to process.\n * @param {ImmutableStateReducer<T, A, L>} customReducer - The custom reducer function for the document state.\n * @param {number} skipValue - The value to skip.\n * @returns {Document<T, A, L>} - The updated document after processing the skip operation.\n */\nfunction processSkipOperation<\n  T,\n  A extends Action,\n  L,\n  D extends Document<T, A, L>,\n>(\n  document: D,\n  action: A | BaseAction | Operation,\n  customReducer: ImmutableStateReducer<T, A, L>,\n  skipValue: number,\n  reuseOperationResultingState = false,\n  resultingStateParser = parseResultingState,\n): D {\n  const scope = action.scope;\n\n  const latestOperation = document.operations[scope].at(-1);\n\n  if (!latestOperation) return document;\n\n  const documentOperations = documentHelpers.garbageCollectDocumentOperations({\n    ...document.operations,\n    [scope]: documentHelpers.skipHeaderOperations(\n      document.operations[scope],\n      latestOperation,\n    ),\n  });\n\n  let scopeState: T | L | undefined = undefined;\n  const lastRemainingOperation = documentOperations[scope].at(-1);\n\n  // if the last operation has the resulting state and\n  // reuseOperationResultingState is true then reuses it\n  // instead of replaying the operations from the beginning\n  if (reuseOperationResultingState && lastRemainingOperation?.resultingState) {\n    scopeState = resultingStateParser(lastRemainingOperation.resultingState) as\n      | T\n      | L;\n  } else {\n    const { state } = replayOperations(\n      document.initialState,\n      documentOperations,\n      customReducer,\n      undefined,\n      undefined,\n      undefined,\n      undefined,\n      {\n        reuseHash: true,\n        reuseOperationResultingState,\n        operationResultingStateParser: resultingStateParser,\n      },\n    );\n    scopeState = state[scope];\n  }\n\n  return {\n    ...document,\n    state: {\n      ...document.state,\n      [scope]: scopeState,\n    },\n    operations: documentHelpers.garbageCollectDocumentOperations({\n      ...document.operations,\n    }),\n  };\n}\n\nfunction processUndoOperation<\n  T,\n  A extends Action,\n  L,\n  D extends Document<T, A, L>,\n>(\n  document: D,\n  scope: OperationScope,\n  customReducer: ImmutableStateReducer<T, A, L>,\n  reuseOperationResultingState = false,\n  resultingStateParser = parseResultingState,\n): Document<T, A, L> {\n  const operations = [...document.operations[scope]];\n  const sortedOperations = documentHelpers.sortOperations(operations);\n\n  sortedOperations.pop();\n\n  const documentOperations = documentHelpers.garbageCollectDocumentOperations({\n    ...document.operations,\n  });\n\n  const clearedOperations = [...documentOperations[scope]];\n  const diff = documentHelpers.diffOperations(\n    documentHelpers.garbageCollect(sortedOperations),\n    clearedOperations,\n  );\n\n  const doc = replayOperations(\n    document.initialState,\n    documentOperations,\n    customReducer,\n    undefined,\n    undefined,\n    undefined,\n    undefined,\n    {\n      reuseHash: true,\n      reuseOperationResultingState,\n      operationResultingStateParser: resultingStateParser,\n    },\n  );\n\n  const clipboard = documentHelpers\n    .sortOperations(\n      [...document.clipboard, ...diff].filter((op) => op.type !== \"NOOP\"),\n    )\n    .reverse();\n\n  return { ...doc, clipboard };\n}\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 T - The type of the state of the custom reducer.\n * @template A - 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 */\nexport function baseReducer<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: A | BaseAction | Operation,\n  customReducer: ImmutableStateReducer<T, A, L>,\n  dispatch?: SignalDispatch,\n  options: ReducerOptions = {},\n) {\n  const {\n    skip,\n    ignoreSkipOperations = false,\n    reuseHash = false,\n    reuseOperationResultingState = false,\n    operationResultingStateParser,\n  } = options;\n\n  let _action = { ...action };\n  let skipValue = skip || 0;\n  let newDocument: Document<T, A, L> = { ...document };\n  let reuseLastOperationIndex = false;\n\n  const shouldProcessSkipOperation =\n    !ignoreSkipOperations &&\n    (skipValue > 0 || (\"index\" in _action && _action.skip > 0));\n\n  if (isUndoRedo(_action)) {\n    const {\n      skip: calculatedSkip,\n      action: transformedAction,\n      document: processedDocument,\n      reuseLastOperationIndex: reuseIndex,\n    } = processUndoRedo(document, _action, skipValue);\n\n    _action = transformedAction;\n    skipValue = calculatedSkip;\n    newDocument = processedDocument;\n    reuseLastOperationIndex = reuseIndex;\n  } else {\n    newDocument = {\n      ...newDocument,\n      clipboard: [],\n    };\n  }\n\n  // if the action is one the base document actions (SET_NAME, UNDO, REDO, PRUNE)\n  // then runs the base reducer first\n  if (isBaseAction(_action)) {\n    newDocument = _baseReducer(newDocument, _action, customReducer);\n  }\n\n  // updates the document revision number, last modified date\n  // and operation history\n  newDocument = updateDocument(\n    newDocument,\n    _action,\n    skipValue,\n    reuseLastOperationIndex,\n  );\n\n  const isUndoAction = isUndo(action);\n\n  if (isUndoAction) {\n    const result = processUndoOperation(\n      newDocument,\n      action.scope,\n      customReducer,\n    );\n\n    return result;\n  }\n\n  if (shouldProcessSkipOperation) {\n    newDocument = processSkipOperation(\n      newDocument,\n      _action,\n      customReducer,\n      skipValue,\n      reuseOperationResultingState,\n      operationResultingStateParser,\n    );\n  }\n\n  // wraps the custom reducer with Mutative to avoid\n  // mutation bugs and allow writing reducers with\n  // mutating code\n  newDocument = create(newDocument, (draft) => {\n    // the reducer runs on a immutable version of\n    // provided state\n    try {\n      const newState = customReducer(draft.state, _action as A, dispatch);\n\n      // const clipboardValue = isUndoRedo(action) ? [...clipboard] : [];\n\n      // if the reducer creates a new state object instead\n      // of mutating the draft then returns the new state\n      if (newState) {\n        // Object.assign(draft.state, newState);\n        unsafe(() => {\n          // casts new state as draft to comply with typescript\n          draft.state = castDraft(newState);\n          // clipboard: [...clipboardValue],\n        });\n      } else {\n        // unsafe(() => {\n        // draft.clipboard = castDraft([...clipboardValue]);\n        // });\n      }\n    } catch (error) {\n      // if the reducer throws an error then we should keep the previous state (before replayOperations)\n      // and remove skip number from action/operation\n      const lastOperationIndex =\n        newDocument.operations[_action.scope].length - 1;\n      draft.operations[_action.scope][lastOperationIndex].error = (\n        error as Error\n      ).message;\n\n      draft.operations[_action.scope][lastOperationIndex].skip = 0;\n\n      if (shouldProcessSkipOperation) {\n        draft.state = castDraft<State<T, L>>({ ...document.state });\n        draft.operations = castDraft({\n          ...document.operations,\n          [_action.scope]: [\n            ...document.operations[_action.scope],\n            {\n              ...draft.operations[_action.scope][lastOperationIndex],\n            },\n          ],\n        });\n      }\n    }\n  });\n  // updates the document history\n  // meta operations are not added to the operations history\n  if ([UNDO, REDO, PRUNE].includes(_action.type)) {\n    return newDocument;\n  }\n\n  // if reuseHash is true, checks if the action has\n  // an hash and uses it instead of generating it\n  const scope = _action.scope || \"global\";\n  const hash =\n    reuseHash && Object.prototype.hasOwnProperty.call(_action, \"hash\")\n      ? (_action as Operation).hash\n      : hashDocument(newDocument, scope);\n\n  // updates the last operation with the hash of the resulting state\n  const lastOperation = newDocument.operations[scope].at(-1);\n  if (lastOperation) {\n    lastOperation.hash = hash;\n\n    if (reuseOperationResultingState) {\n      lastOperation.resultingState = newDocument.state[scope];\n    }\n\n    // if the action has attachments then adds them to the document\n    if (!isBaseAction(_action) && _action.attachments) {\n      _action.attachments.forEach((attachment) => {\n        const { hash, ...file } = attachment;\n        newDocument.attachments[hash] = {\n          ...file,\n        };\n      });\n    }\n  }\n\n  return newDocument;\n}\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 T - The type of the state of the custom reducer.\n * @template A - 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 */\nexport function mutableBaseReducer<T, A extends Action, L>(\n  document: Document<T, A, L>,\n  action: A | BaseAction | Operation,\n  customReducer: ImmutableStateReducer<T, A, L>,\n  dispatch?: SignalDispatch,\n  options: ReducerOptions = {},\n) {\n  const {\n    skip,\n    ignoreSkipOperations = false,\n    reuseHash = false,\n    reuseOperationResultingState = false,\n    operationResultingStateParser,\n  } = options;\n\n  const _action = { ...action };\n  const skipValue = skip || 0;\n  let newDocument: Document<T, A, L> = { ...document };\n  // let clipboard = [...document.clipboard];\n\n  const shouldProcessSkipOperation =\n    !ignoreSkipOperations &&\n    (skipValue > 0 || (\"index\" in _action && _action.skip > 0));\n\n  // if the action is one the base document actions (SET_NAME, UNDO, REDO, PRUNE)\n  // then runs the base reducer first\n  if (isBaseAction(_action)) {\n    newDocument = _baseReducer(newDocument, _action, customReducer);\n  }\n\n  // updates the document revision number, last modified date\n  // and operation history\n  newDocument = updateDocument(newDocument, _action, skipValue);\n\n  if (shouldProcessSkipOperation) {\n    newDocument = processSkipOperation(\n      newDocument,\n      _action,\n      customReducer,\n      skipValue,\n      reuseOperationResultingState,\n      operationResultingStateParser,\n    );\n  }\n\n  try {\n    const newState = customReducer(\n      newDocument.state as Draft<State<T, L>>,\n      _action as A,\n      dispatch,\n    );\n    if (newState) {\n      newDocument.state = newState;\n    }\n  } catch (error) {\n    // if the reducer throws an error then we should keep the previous state (before replayOperations)\n    // and remove skip number from action/operation\n    const lastOperationIndex = newDocument.operations[_action.scope].length - 1;\n    newDocument.operations[_action.scope][lastOperationIndex].error = (\n      error as Error\n    ).message;\n    newDocument.operations[_action.scope][lastOperationIndex].skip = 0;\n\n    if (shouldProcessSkipOperation) {\n      newDocument.state = { ...document.state };\n      newDocument.operations = {\n        ...document.operations,\n        [_action.scope]: [\n          ...document.operations[_action.scope],\n          {\n            ...newDocument.operations[_action.scope][lastOperationIndex],\n          },\n        ],\n      };\n    }\n  }\n\n  if ([UNDO, REDO, PRUNE].includes(_action.type)) {\n    return newDocument;\n  }\n\n  // if reuseHash is true, checks if the action has\n  // an hash and uses it instead of generating it\n  const scope = _action.scope || \"global\";\n  const hash =\n    reuseHash && Object.prototype.hasOwnProperty.call(_action, \"hash\")\n      ? (_action as Operation).hash\n      : hashDocument(newDocument, scope);\n\n  // updates the last operation with the hash of the resulting state\n  const lastOperation = newDocument.operations[scope].at(-1);\n  if (lastOperation) {\n    lastOperation.hash = hash;\n\n    if (reuseOperationResultingState) {\n      lastOperation.resultingState = newDocument.state[scope];\n    }\n\n    // if the action has attachments then adds them to the document\n    if (!isBaseAction(_action) && _action.attachments) {\n      _action.attachments.forEach((attachment) => {\n        const { hash, ...file } = attachment;\n        newDocument.attachments[hash] = {\n          ...file,\n        };\n      });\n    }\n  }\n  return newDocument;\n}\n","import stringifyJson from \"safe-stable-stringify\";\nimport { baseReducer, mutableBaseReducer, updateHeader } from \"../reducer\";\nimport {\n  Action,\n  BaseAction,\n  UndoRedoAction,\n  Document,\n  ExtendedState,\n  ImmutableStateReducer,\n  Reducer,\n  OperationScope,\n  State,\n  CreateState,\n  PartialState,\n  DocumentOperations,\n  DocumentHeader,\n  DocumentOperationsIgnoreMap,\n  Operation,\n  MappedOperation,\n  ReducerOptions,\n  UndoAction,\n} from \"../types\";\nimport { hash } from \"./node\";\nimport {\n  LOAD_STATE,\n  PRUNE,\n  REDO,\n  SET_NAME,\n  UNDO,\n  NOOP,\n} from \"../actions/types\";\nimport { SignalDispatch } from \"../signal\";\n\nexport function isNoopOperation(op: Partial<Operation>): boolean {\n  return (\n    op.type === NOOP &&\n    op.skip !== undefined &&\n    op.skip > 0 &&\n    op.hash !== undefined\n  );\n}\n\nexport function isUndoRedo(action: Action): action is UndoRedoAction {\n  return [UNDO, REDO].includes(action.type);\n}\n\nexport function isUndo(action: Action): action is UndoAction {\n  return action.type === UNDO;\n}\n\nexport function isBaseAction(action: Action): action is BaseAction {\n  return [SET_NAME, UNDO, REDO, PRUNE, LOAD_STATE].includes(action.type);\n}\n\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 - The attachments included in the action.\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 * @param skip - The number of operations to skip before this new action is applied.\n *\n * @throws Error if the type is empty or not a string.\n *\n * @returns The new action.\n */\nexport function createAction<A extends Action>(\n  type: A[\"type\"],\n  input?: A[\"input\"],\n  attachments?: Action[\"attachments\"],\n  validator?: () => { parse(v: unknown): A[\"input\"] },\n  scope: OperationScope = \"global\",\n): A {\n  if (!type) {\n    throw new Error(\"Empty action type\");\n  }\n\n  if (typeof type !== \"string\") {\n    throw new Error(`Invalid action type: ${JSON.stringify(type)}`);\n  }\n\n  const action: Action = { type, input, scope };\n\n  if (attachments) {\n    action.attachments = attachments;\n  }\n\n  try {\n    validator?.().parse(action.input);\n  } catch (error) {\n    throw new Error(`Invalid action input: ${error}`);\n  }\n\n  return action as A;\n}\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 */\nexport function createReducer<\n  S = unknown,\n  A extends Action = Action,\n  L = unknown,\n>(\n  reducer: ImmutableStateReducer<S, A, L>,\n  documentReducer = baseReducer,\n): Reducer<S, A, L> {\n  return (document, action, dispatch, options) => {\n    return documentReducer(document, action, reducer, dispatch, options);\n  };\n}\n\nexport function createUnsafeReducer<\n  S = unknown,\n  A extends Action = Action,\n  L = unknown,\n>(\n  reducer: ImmutableStateReducer<S, A, L>,\n  documentReducer = mutableBaseReducer,\n): Reducer<S, A, L> {\n  return (document, action, dispatch, options) => {\n    return documentReducer(document, action, reducer, dispatch, options);\n  };\n}\n\nexport const createExtendedState = <S, L>(\n  initialState?: Partial<ExtendedState<PartialState<S>, PartialState<L>>>,\n  createState?: CreateState<S, L>,\n): ExtendedState<S, L> => {\n  return {\n    name: \"\",\n    documentType: \"\",\n    revision: {\n      global: 0,\n      local: 0,\n    },\n    created: new Date().toISOString(),\n    lastModified: new Date().toISOString(),\n    attachments: {},\n    ...initialState,\n    state:\n      createState?.(initialState?.state) ??\n      ((initialState?.state ?? { global: {}, local: {} }) as State<S, L>),\n  };\n};\n\n/**\n * Builds the initial document state from the provided data.\n *\n * @typeParam T - The type of the data.\n * @typeParam A - The type of the actions.\n *\n * @param initialState - The initial state of the document. The `data` property\n *   is required, but all other properties are optional.\n *\n * @returns The new document state.\n */\nexport const createDocument = <S, A extends Action, L = unknown>(\n  initialState?: Partial<ExtendedState<PartialState<S>, PartialState<L>>>,\n  createState?: (\n    state?: Partial<State<PartialState<S>, PartialState<L>>>,\n  ) => State<S, L>,\n): Document<S, A, L> => {\n  const state: ExtendedState<S, L> = createExtendedState(\n    initialState,\n    createState,\n  );\n  return {\n    ...state,\n    initialState: state,\n    operations: { global: [], local: [] },\n    clipboard: [],\n  };\n};\n\n// export const stringifyJson = configureStringify\n\nexport const hashDocument = (\n  document: Pick<Document, \"state\">,\n  scope: OperationScope = \"global\",\n) => {\n  return hash(stringifyJson(document.state[scope] || \"\"));\n};\n\nexport const hashKey = (date?: Date, randomLimit = 1000) => {\n  const random = Math.random() * randomLimit;\n  return hash(`${(date ?? new Date()).toISOString()}${random}`);\n};\n\nexport function readOnly<T>(value: T): Readonly<T> {\n  return Object.freeze(value);\n}\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 */\nexport function mapSkippedOperations<A extends Action>(\n  operations: Operation<BaseAction | A>[],\n  skippedHeadOperations?: number,\n): MappedOperation<A>[] {\n  const ops = [...operations];\n\n  let skipped = skippedHeadOperations || 0;\n  let latestOpIndex = ops.length > 0 ? ops[ops.length - 1].index : 0;\n\n  const scopeOpsWithIgnore = [] as MappedOperation<A>[];\n\n  for (const operation of ops.reverse()) {\n    if (skipped > 0) {\n      const operationsDiff = latestOpIndex - operation.index;\n      skipped -= operationsDiff;\n    }\n\n    if (skipped < 0) {\n      throw new Error(\"Invalid operation index, missing operations\");\n    }\n\n    const mappedOp = {\n      ignore: skipped > 0,\n      operation,\n    };\n\n    // here we add 1 to the skip number because we want to get the number of\n    // operations that we want to move the pointer back to get the latest valid operation\n    // operation.skip = 1 means that we want to move the pointer back 2 operations to get to the latest valid operation\n    const operationSkip = operation.skip > 0 ? operation.skip + 1 : 0;\n\n    if (operationSkip > 0 && operationSkip > skipped) {\n      const skipDiff = operationSkip - skipped;\n      skipped = skipped + skipDiff;\n    }\n\n    latestOpIndex = operation.index;\n    scopeOpsWithIgnore.push(mappedOp);\n  }\n\n  return scopeOpsWithIgnore.reverse();\n}\n\n// Flattens the operations from all scopes into\n// a single array and sorts them by timestamp\nexport function sortOperations<A extends Action>(\n  operations: DocumentOperations<A>,\n) {\n  return Object.values(operations)\n    .flatMap((array) => array)\n    .sort(\n      (a, b) =>\n        new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime(),\n    );\n}\n\n// Flattens the mapped operations (with ignore flag) from all scopes into\n// a single array and sorts them by timestamp\nexport function sortMappedOperations<A extends Action>(\n  operations: DocumentOperationsIgnoreMap<A>,\n) {\n  return Object.values(operations)\n    .flatMap((array) => array)\n    .sort(\n      (a, b) =>\n        new Date(a.operation.timestamp).getTime() -\n        new Date(b.operation.timestamp).getTime(),\n    );\n}\n\n// gets the last modified timestamp of a document from\n// it's operations, falling back to the initial state\nexport function getDocumentLastModified(document: Document) {\n  const sortedOperations = sortOperations(document.operations);\n  const timestamp =\n    sortedOperations.at(-1)?.timestamp || document.initialState.lastModified;\n  return timestamp;\n}\n\n// Runs the operations on the initial data using the\n// provided reducer, wrapped with the document reducer.\n// This rebuilds the document according to the provided actions.\nexport function replayOperations<T, A extends Action, L>(\n  initialState: ExtendedState<T, L>,\n  clearedOperations: DocumentOperations<A>,\n  reducer: ImmutableStateReducer<T, A, L>,\n  dispatch?: SignalDispatch,\n  header?: DocumentHeader,\n  documentReducer = baseReducer,\n  skipHeaderOperations: SkipHeaderOperations = {},\n  options?: ReducerOptions,\n): Document<T, A, L> {\n  // wraps the provided custom reducer with the\n  // base document reducer\n  const wrappedReducer = createReducer(reducer, documentReducer);\n\n  return replayDocument(\n    initialState,\n    clearedOperations,\n    wrappedReducer,\n    dispatch,\n    header,\n    skipHeaderOperations,\n    options,\n  );\n}\n\nexport type SkipHeaderOperations = Partial<Record<OperationScope, number>>;\n\nexport type ReplayDocumentOptions = {\n  // if false then reuses the hash from the operations\n  // and only checks the final hash of each scope\n  checkHashes?: boolean;\n  // if true then looks for the latest operation with\n  // a resulting state and uses it as a starting point\n  reuseOperationResultingState?: boolean;\n  // Optional parser for the operation resulting state, uses JSON.parse by default\n  operationResultingStateParser?: (state: unknown) => object;\n};\n\n// Runs the operations on the initial data using the\n// provided document reducer.\n// This rebuilds the document according to the provided actions.\nexport function replayDocument<T, A extends Action, L>(\n  initialState: ExtendedState<T, L>,\n  operations: DocumentOperations<A>,\n  reducer: Reducer<T, A, L>,\n  dispatch?: SignalDispatch,\n  header?: DocumentHeader,\n  skipHeaderOperations: SkipHeaderOperations = {},\n  options?: ReplayDocumentOptions,\n): Document<T, A, L> {\n  const {\n    checkHashes = true,\n    reuseOperationResultingState,\n    operationResultingStateParser = parseResultingState,\n  } = options || {};\n\n  let documentState = initialState;\n  const operationsToReplay = [] as Operation<A | BaseAction>[];\n  const initialOperations: DocumentOperations<A> = {\n    global: [],\n    local: [],\n  };\n\n  // if operation resulting state is to be used then\n  // looks for the last operation with state of each\n  // scope to use it as the starting point and only\n  // replay operations that follow it\n  if (reuseOperationResultingState) {\n    for (const [scope, scopeOperations] of Object.entries(operations)) {\n      const index = scopeOperations.findLastIndex((s) => !!s.resultingState);\n      if (index < 0) {\n        operationsToReplay.push(...scopeOperations);\n        continue;\n      }\n      const opWithState = scopeOperations[index];\n      try {\n        const scopeState = operationResultingStateParser(\n          // eslint-disable-next-line @typescript-eslint/no-non-null-assertion, @typescript-eslint/no-unnecessary-type-assertion\n          opWithState.resultingState!,\n        );\n        documentState = {\n          ...documentState,\n          state: {\n            ...documentState.state,\n            // TODO how to deal with attachments?\n            [scope]: scopeState,\n          },\n        };\n        initialOperations[scope as keyof DocumentOperations<A>].push(\n          ...scopeOperations.slice(0, index + 1),\n        );\n        operationsToReplay.push(...scopeOperations.slice(index + 1));\n      } catch {\n        /* if parsing fails then keeps replays all scope operations */\n        operationsToReplay.push(...scopeOperations);\n      }\n    }\n  } else {\n    operationsToReplay.push(...Object.values(operations).flat());\n  }\n\n  // builds a new document from the initial data\n  const document = createDocument<T, A, L>(documentState);\n  document.initialState = initialState;\n  document.operations = initialOperations;\n\n  let result = document;\n  // if there are operations left without resulting state\n  // then replays them\n  if (operationsToReplay.length) {\n    result = operationsToReplay.reduce((document, operation) => {\n      const doc = reducer(document, operation, dispatch, {\n        skip: operation.skip,\n        ignoreSkipOperations: true,\n        reuseHash: !checkHashes,\n      });\n\n      return doc;\n    }, document);\n  }\n  // if not then updates the document header according\n  // to the latest operation of each scope\n  else {\n    for (const scopeOperations of Object.values(initialOperations)) {\n      const lastOperation = scopeOperations.at(-1);\n      if (lastOperation) {\n        result = updateHeader(result, lastOperation);\n      }\n    }\n  }\n\n  // if hash generation was skipped then checks if the hash\n  // of each scope matches the hash of last operation\n  if (!checkHashes) {\n    for (const scope of Object.keys(result.state)) {\n      for (let i = operationsToReplay.length - 1; i >= 0; i--) {\n        const operation = operationsToReplay[i];\n\n        if (operation.scope !== scope) {\n          continue;\n        }\n        if (operation.hash !== hashDocument(result, scope)) {\n          throw new Error(`Hash mismatch for scope ${scope}`);\n        } else {\n          break;\n        }\n      }\n    }\n  }\n\n  // reuses operation timestamp if provided\n  const resultOperations: DocumentOperations<A> = Object.keys(\n    result.operations,\n  ).reduce(\n    (acc, key) => {\n      const scope = key as keyof DocumentOperations<A>;\n      return {\n        ...acc,\n        [scope]: [\n          ...result.operations[scope].map((operation, index) => {\n            return {\n              ...operation,\n              timestamp:\n                operations[scope][index]?.timestamp ?? operation.timestamp,\n            };\n          }),\n        ],\n      };\n    },\n    { global: [], local: [] },\n  );\n  // gets the last modified timestamp from the latest operation\n  const lastModified = Object.values(resultOperations).reduce((acc, curr) => {\n    const operation = curr.at(-1);\n    if (operation && operation.timestamp > acc) {\n      acc = operation.timestamp;\n    }\n    return acc;\n  }, initialState.lastModified);\n\n  return { ...result, operations: resultOperations, lastModified };\n}\n\nexport function isSameDocument(documentA: Document, documentB: Document) {\n  return stringifyJson(documentA) === stringifyJson(documentB);\n}\n\nexport function parseResultingState(state: unknown) {\n  const stateType = typeof state;\n  if (stateType === \"string\") {\n    return JSON.parse(state as string) as object;\n  } else if (stateType === \"object\") {\n    return state as object;\n  } else {\n    throw new Error(`Providing resulting state is of type: ${stateType}`);\n  }\n}\n","import { ExtendedState, OperationScope, z } from \"../types\";\nimport { createAction } from \"../utils/base\";\nimport {\n  LoadStateAction,\n  PruneAction,\n  RedoAction,\n  SetNameAction,\n  UndoAction,\n  NOOPAction,\n} from \"./types\";\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 */\nexport const setName = (name: string) =>\n  createAction<SetNameAction>(\n    \"SET_NAME\",\n    name,\n    undefined,\n    z.SetNameActionInputSchema,\n    undefined,\n  );\n\n/**\n * Cancels the last `count` operations.\n *\n * @param count - Number of operations to cancel\n * @category Actions\n */\nexport const undo = (skip = 1, scope: OperationScope = \"global\") =>\n  createAction<UndoAction>(\n    \"UNDO\",\n    skip,\n    undefined,\n    z.UndoActionInputSchema,\n    scope,\n  );\n\n/**\n * Cancels the last `count` {@link undo | UNDO} operations.\n *\n * @param count - Number of UNDO operations to cancel\n * @category Actions\n */\nexport const redo = (count = 1, scope: OperationScope = \"global\") =>\n  createAction<RedoAction>(\n    \"REDO\",\n    count,\n    undefined,\n    z.RedoActionInputSchema,\n    scope,\n  );\n\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 */\nexport const prune = (\n  start?: number | undefined,\n  end?: number | undefined,\n  scope: OperationScope = \"global\",\n) =>\n  createAction<PruneAction>(\n    \"PRUNE\",\n    { start, end },\n    undefined,\n    z.PruneActionInputSchema,\n    scope,\n  );\n\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 */\nexport const loadState = <S, T>(\n  state: Pick<ExtendedState<S, T>, \"state\" | \"name\">,\n  operations: number,\n) =>\n  createAction<LoadStateAction>(\n    \"LOAD_STATE\",\n    { state, operations },\n    undefined,\n    z.LoadStateActionInputSchema,\n  );\n\nexport const noop = (scope: OperationScope = \"global\") =>\n  createAction<NOOPAction>(\"NOOP\", {}, undefined, undefined, scope);\n","import { loadState, prune, redo, setName, undo } from \"./actions\";\nimport type { BaseAction } from \"./actions/types\";\nimport type { SignalDispatch } from \"./signal\";\nimport type {\n  Action,\n  AttachmentRef,\n  Document,\n  ExtendedState,\n  OperationScope,\n  Reducer,\n  ReducerOptions,\n} from \"./types\";\nimport { loadFromFile, readOnly, saveToFile } from \"./utils\";\n\n/**\n * This is an abstract class representing a document and provides methods\n * for creating and manipulating documents.\n * @typeparam T - The type of data stored in the document.\n * @typeparam A - The type of action the document can take.\n */\nexport abstract class BaseDocument<T, A extends Action, L = unknown> {\n  protected _document: Document<T, A, L>;\n  private _reducer: Reducer<T, A, L>;\n  private _signalDispatch?: SignalDispatch;\n\n  /**\n   * Constructs a BaseDocument instance with an initial state.\n   * @param reducer - The reducer function that updates the state.\n   * @param document - The initial state of the document.\n   */\n  constructor(\n    reducer: Reducer<T, A, L>,\n    document: Document<T, A, L>,\n    signalDispatch?: SignalDispatch,\n  ) {\n    this._reducer = reducer;\n    this._document = document;\n    this._signalDispatch = signalDispatch;\n  }\n\n  /**\n   * Dispatches an action to update the state of the document.\n   * @param action - The action to dispatch.\n   * @returns The Document instance.\n   */\n  protected dispatch(action: A | BaseAction, options?: ReducerOptions) {\n    this._document = this._reducer(\n      this._document,\n      action,\n      this._signalDispatch,\n      options,\n    );\n    return this;\n  }\n\n  /**\n   * Saves the state of the document to a file.\n   * @param path - The file path where the state should be saved.\n   * @param extension - The file extension to use when saving the state.\n   * @returns The file path where the state was saved.\n   */\n  protected saveToFile(path: string, extension: string, name?: string) {\n    return saveToFile(this._document, path, extension, name);\n  }\n\n  /**\n   * Loads the state of the document from a file.\n   * @param path - The file path where the state is stored.\n   */\n  async loadFromFile(path: string) {\n    this._document = await loadFromFile<T, A, L>(path, this._reducer);\n  }\n\n  /**\n   * Loads the state of the document from a file and returns it.\n   * @param path - The file path where the state is stored.\n   * @param reducer - The reducer function that updates the state.\n   * @returns The state of the document.\n   */\n  protected static async stateFromFile<T, A extends Action, L>(\n    path: string,\n    reducer: Reducer<T, A, L>,\n  ) {\n    const state = await loadFromFile<T, A, L>(path, reducer);\n    return state;\n  }\n\n  /**\n   *    Gets the current state of the document.\n   */\n  get state() {\n    return readOnly(this._document.state);\n  }\n\n  /**\n   *    Gets the list of operations performed on the document.\n   */\n  get operations() {\n    return readOnly(this._document.operations);\n  }\n\n  /**\n   * Gets the name of the document.\n   */\n  get name() {\n    return this._document.name;\n  }\n\n  /**\n   * Gets the type of document.\n   */\n  get documentType() {\n    return this._document.documentType;\n  }\n\n  /**\n   * Gets the timestamp of the date the document was created.\n   */\n  get created() {\n    return this._document.created;\n  }\n\n  /**\n   * Gets the timestamp of the date the document was last modified.\n   */\n  get lastModified() {\n    return this._document.lastModified;\n  }\n\n  /**\n   * Gets the global revision number of the document.\n   */\n  get revision() {\n    return this._document.revision.global;\n  }\n\n  getRevision(scope: OperationScope) {\n    return this._document.revision[scope];\n  }\n\n  /**\n   * Gets the initial state of the document.\n   */\n  get initialState() {\n    return readOnly(this._document.initialState);\n  }\n\n  /**\n   * Returns the current document as an object\n   */\n  public toDocument() {\n    return readOnly(this._document);\n  }\n\n  /**\n   * Gets the attachment associated with the given key.\n   * @param attachment - The key of the attachment to retrieve.\n   */\n  public getAttachment(attachment: AttachmentRef) {\n    return this._document.attachments[attachment];\n  }\n\n  /**\n   * Sets the name of the document.\n   * @param name - The new name of the document.\n   */\n  public setName(name: string) {\n    this.dispatch(setName(name));\n    return this;\n  }\n\n  /**\n   * Reverts a number of actions from the document.\n   * @param count - The number of actions to revert.\n   */\n  public undo(count: number) {\n    this.dispatch(undo(count));\n    return this;\n  }\n\n  /**\n   * Reapplies a number of actions to the document.\n   * @param count - The number of actions to reapply.\n   */\n  public redo(count: number) {\n    this.dispatch(redo(count));\n    return this;\n  }\n  /**\n   * Removes a range of operations from the document.\n   * @param start - The starting index of the range to remove.\n   * @param end - The ending index of the range to remove.\n   */\n  public prune(start?: number | undefined, end?: number | undefined) {\n    this.dispatch(prune(start, end));\n    return this;\n  }\n\n  /**\n   * Loads a document state and a set of operations.\n   * @param state - The state to load.\n   * @param operations - The operations to apply to the document.\n   */\n  public loadState(\n    state: Pick<ExtendedState<T, L>, \"state\" | \"name\">,\n    operations: number,\n  ) {\n    this.dispatch(loadState(state, operations));\n    return this;\n  }\n}\n/**\n * Applies multiple mixins to a base class.\n * Used to have separate mixins to group methods by actions.\n *\n * @remarks\n * {@link https://www.typescriptlang.org/docs/handbook/mixins.html#alternative-pattern}\n *\n * @param derivedCtor - The class to apply the mixins to.\n * @param constructors - The constructors of the mixins.\n */\n\nexport function applyMixins(derivedCtor: any, constructors: any[]) {\n  constructors.forEach((baseCtor) => {\n    // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\n    Object.getOwnPropertyNames(baseCtor.prototype).forEach((name) => {\n      Object.defineProperty(\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\n        derivedCtor.prototype,\n        name,\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-argument, @typescript-eslint/no-unsafe-member-access\n        Object.getOwnPropertyDescriptor(baseCtor.prototype, name) ||\n          Object.create(null),\n      );\n    });\n  });\n}\n"],"names":["value","tmp","key","res","join","stringify","hash","createSha1Hash","stringifyJson","standardTypes","IntegrityIssueType","IntegrityIssueSubType","sortOperations","documentHelpers.sortOperations","documentHelpers.nextSkipNumber","action","uuid","z.BaseActionSchema","documentHelpers.garbageCollectDocumentOperations","documentHelpers.skipHeaderOperations","documentHelpers.diffOperations","documentHelpers.garbageCollect","skipHeaderOperations","document","z.SetNameActionInputSchema","z.UndoActionInputSchema","z.RedoActionInputSchema","z.PruneActionInputSchema","z.LoadStateActionInputSchema"],"mappings":";;;;;;AA4BO,MAAM,sBAAsB,CAAC,MAClC,MAAM,UAAa,MAAM;AAEd,MAAA,0BAA0B,EACpC,MACA,OAAO,CAAC,MAAM,oBAAoB,CAAC,CAAC;AAEhC,MAAM,mBAAmB,EAAE,KAAK,CAAC,YAAY,CAAC;AAE9C,MAAM,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC;AAEpC,MAAM,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC;AAElC,MAAM,iBAAiB,EAAE,KAAK,CAAC,UAAU,CAAC;AAE1C,MAAM,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC;AAElC,SAAS,eAAgD;AAC9D,SAAO,EAAE,OAAO;AAAA,IACd,YAAY,EAAE,QAAQ,QAAQ,EAAE,SAAS;AAAA,IACzC,MAAM,EAAE,OAAO;AAAA,EAAA,CAChB;AACH;AAEO,SAAS,uBAAkD;AACzD,SAAA,EAAE,QAAQ,QAAQ,EAAE,GAAG,EAAE,QAAQ,OAAO,CAAC;AAClD;AAEO,SAAS,mBAAmB;AACjC,SAAO,EAAE,MAAM;AAAA,IACb,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,IAClB,iBAAiB;AAAA,IACjB,oBAAoB;AAAA,IACpB,iBAAiB;AAAA,EAAA,CAClB;AACH;AAEO,SAAS,qBAA4D;AAC1E,SAAO,EAAE,OAAO;AAAA,IACd,YAAY,EAAE,QAAQ,cAAc,EAAE,SAAS;AAAA,IAC/C,MAAM,EAAE,OAAO;AAAA,IACf,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,UAAU,EAAE,OAAO,EAAE,SAAS;AAAA,IAC9B,UAAU,EAAE,OAAO;AAAA,EAAA,CACpB;AACH;AAEO,SAAS,wBAEd;AACA,SAAO,EAAE,OAAO;AAAA,IACd,OAAO,EAAE,KAAK,MAAM,4BAA4B;AAAA,IAChD,MAAM;AAAA,IACN,OAAO,qBAAqB;AAAA,EAAA,CAC7B;AACH;AAEO,SAAS,6BAEd;AACA,SAAO,EAAE,OAAO;AAAA,IACd,YAAY,EAAE,OAAO;AAAA,IACrB,OAAO,EAAE,KAAK,MAAM,gCAAiC,CAAA;AAAA,EAAA,CACtD;AACH;AAEO,SAAS,kCAEd;AACA,SAAO,EAAE,OAAO;AAAA,IACd,MAAM,EAAE,QAAQ,EAAE,QAAQ;AAAA,IAC1B,MAAM,EAAE,OAAO;AAAA,EAAA,CAChB;AACH;AAEO,SAAS,kBAAsD;AACpE,SAAO,EAAE,OAAO;AAAA,IACd,YAAY,EAAE,QAAQ,WAAW,EAAE,SAAS;AAAA,IAC5C,MAAM,EAAE,OAAO;AAAA,IACf,OAAO,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,MAAM,EAAE,OAAO;AAAA,EAAA,CAChB;AACH;AAEO,SAAS,oBAA0D;AACxE,SAAO,EAAE,OAAO;AAAA,IACd,OAAO,EAAE,KAAK,MAAM,wBAAwB;AAAA,IAC5C,MAAM;AAAA,IACN,OAAO,qBAAqB;AAAA,EAAA,CAC7B;AACH;AAEO,SAAS,yBAEd;AACA,SAAO,EAAE,OAAO;AAAA,IACd,KAAK,EAAE,OAAO,EAAE,QAAQ;AAAA,IACxB,OAAO,EAAE,OAAO,EAAE,QAAQ;AAAA,EAAA,CAC3B;AACH;AAEO,MAAM,wBAAwB,EAAE;AAEhC,SAAS,mBAAwD;AACtE,SAAO,EAAE,OAAO;AAAA,IACd,OAAO,sBAAsB;AAAA,IAC7B,MAAM;AAAA,IACN,OAAO,qBAAqB;AAAA,EAAA,CAC7B;AACH;AAEO,MAAM,2BAA2B,EAAE;AAEnC,SAAS,sBAA8D;AAC5E,SAAO,EAAE,OAAO;AAAA,IACd,OAAO,yBAAyB;AAAA,IAChC,MAAM;AAAA,IACN,OAAO,EAAE,QAAQ,QAAQ;AAAA,EAAA,CAC1B;AACH;AAEO,SAAS,yBAEd;AACA,SAAO,EAAE,OAAO;AAAA,IACd,YAAY,EAAE,QAAQ,kBAAkB,EAAE,SAAS;AAAA,IACnD,MAAM,EAAE,OAAO;AAAA,IACf,OAAO,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,MAAM,EAAE,OAAO;AAAA,EAAA,CAChB;AACH;AAEO,MAAM,wBAAwB,EAAE;AAEhC,SAAS,mBAAwD;AACtE,SAAO,EAAE,OAAO;AAAA,IACd,OAAO,sBAAsB;AAAA,IAC7B,MAAM;AAAA,IACN,OAAO,qBAAqB;AAAA,EAAA,CAC7B;AACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1KA,UAAM,EAAE,eAAgB,IAAG,OAAO;AAElC,UAAM,YAAY,UAAS;AAG3B,cAAU,YAAY;AAEtB,cAAU,YAAY;AAGtB,cAAU,UAAU;AAGpB,YAAoB,YAAA;AAEpB,YAAoB,YAAA;AAEpB,WAAiB,UAAA;AAGjB,UAAM,2BAA2B;AAIjC,aAAS,UAAW,KAAK;AAEvB,UAAI,IAAI,SAAS,OAAQ,CAAC,yBAAyB,KAAK,GAAG,GAAG;AAC5D,eAAO,IAAI,GAAG;AAAA,MAClB;AACE,aAAO,KAAK,UAAU,GAAG;AAAA,IAC3B;AAEA,aAAS,KAAM,OAAO,YAAY;AAGhC,UAAI,MAAM,SAAS,OAAO,YAAY;AACpC,eAAO,MAAM,KAAK,UAAU;AAAA,MAChC;AACE,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAM,eAAe,MAAM,CAAC;AAC5B,YAAI,WAAW;AACf,eAAO,aAAa,KAAK,MAAM,WAAW,CAAC,IAAI,cAAc;AAC3D,gBAAM,QAAQ,IAAI,MAAM,WAAW,CAAC;AACpC;AAAA,QACN;AACI,cAAM,QAAQ,IAAI;AAAA,MACtB;AACE,aAAO;AAAA,IACT;AAEA,UAAM,0CACJ,OAAO;AAAA,MACL,OAAO;AAAA,QACL,OAAO;AAAA,UACL,IAAI,UAAS;AAAA,QACrB;AAAA,MACK;AAAA,MACD,OAAO;AAAA,IACX,EAAI;AAEJ,aAAS,wBAAyB,OAAO;AACvC,aAAO,wCAAwC,KAAK,KAAK,MAAM,UAAa,MAAM,WAAW;AAAA,IAC/F;AAEA,aAAS,oBAAqB,OAAO,WAAW,gBAAgB;AAC9D,UAAI,MAAM,SAAS,gBAAgB;AACjC,yBAAiB,MAAM;AAAA,MAC3B;AACE,YAAM,aAAa,cAAc,MAAM,KAAK;AAC5C,UAAI,MAAM,OAAO,UAAU,GAAG,MAAM,CAAC,CAAC;AACtC,eAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,eAAO,GAAG,SAAS,IAAI,CAAC,KAAK,UAAU,GAAG,MAAM,CAAC,CAAC;AAAA,MACtD;AACE,aAAO;AAAA,IACT;AAEA,aAAS,uBAAwB,SAAS;AACxC,UAAI,eAAe,KAAK,SAAS,eAAe,GAAG;AACjD,cAAM,gBAAgB,QAAQ;AAC9B,YAAI,OAAO,kBAAkB,UAAU;AACrC,iBAAO,IAAI,aAAa;AAAA,QAC9B;AACI,YAAI,iBAAiB,MAAM;AACzB,iBAAO;AAAA,QACb;AACI,YAAI,kBAAkB,SAAS,kBAAkB,WAAW;AAC1D,iBAAO;AAAA,YACL,WAAY;AACV,oBAAM,IAAI,UAAU,uCAAuC;AAAA,YACrE;AAAA,UACA;AAAA,QACA;AACI,cAAM,IAAI,UAAU,oFAAoF;AAAA,MAC5G;AACE,aAAO;AAAA,IACT;AAEA,aAAS,uBAAwB,SAAS;AACxC,UAAI;AACJ,UAAI,eAAe,KAAK,SAAS,eAAe,GAAG;AACjD,gBAAQ,QAAQ;AAChB,YAAI,OAAO,UAAU,aAAa,OAAO,UAAU,YAAY;AAC7D,gBAAM,IAAI,UAAU,6EAA6E;AAAA,QACvG;AAAA,MACA;AACE,aAAO,UAAU,SAAY,OAAO;AAAA,IACtC;AAEA,aAAS,iBAAkB,SAAS,KAAK;AACvC,UAAI;AACJ,UAAI,eAAe,KAAK,SAAS,GAAG,GAAG;AACrC,gBAAQ,QAAQ,GAAG;AACnB,YAAI,OAAO,UAAU,WAAW;AAC9B,gBAAM,IAAI,UAAU,QAAQ,GAAG,oCAAoC;AAAA,QACzE;AAAA,MACA;AACE,aAAO,UAAU,SAAY,OAAO;AAAA,IACtC;AAEA,aAAS,yBAA0B,SAAS,KAAK;AAC/C,UAAI;AACJ,UAAI,eAAe,KAAK,SAAS,GAAG,GAAG;AACrC,gBAAQ,QAAQ,GAAG;AACnB,YAAI,OAAO,UAAU,UAAU;AAC7B,gBAAM,IAAI,UAAU,QAAQ,GAAG,mCAAmC;AAAA,QACxE;AACI,YAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAC5B,gBAAM,IAAI,UAAU,QAAQ,GAAG,+BAA+B;AAAA,QACpE;AACI,YAAI,QAAQ,GAAG;AACb,gBAAM,IAAI,WAAW,QAAQ,GAAG,yBAAyB;AAAA,QAC/D;AAAA,MACA;AACE,aAAO,UAAU,SAAY,WAAW;AAAA,IAC1C;AAEA,aAAS,aAAc,QAAQ;AAC7B,UAAI,WAAW,GAAG;AAChB,eAAO;AAAA,MACX;AACE,aAAO,GAAG,MAAM;AAAA,IAClB;AAEA,aAAS,qBAAsB,eAAe;AAC5C,YAAM,cAAc,oBAAI,IAAG;AAC3B,iBAAW,SAAS,eAAe;AACjC,YAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,sBAAY,IAAI,OAAO,KAAK,CAAC;AAAA,QACnC;AAAA,MACA;AACE,aAAO;AAAA,IACT;AAEA,aAAS,gBAAiB,SAAS;AACjC,UAAI,eAAe,KAAK,SAAS,QAAQ,GAAG;AAC1C,cAAM,QAAQ,QAAQ;AACtB,YAAI,OAAO,UAAU,WAAW;AAC9B,gBAAM,IAAI,UAAU,+CAA+C;AAAA,QACzE;AACI,YAAI,OAAO;AACT,iBAAO,CAACA,WAAU;AAChB,gBAAI,UAAU,uDAAuD,OAAOA,MAAK;AACjF,gBAAI,OAAOA,WAAU,WAAY,YAAW,KAAKA,OAAM,SAAQ,CAAE;AACjE,kBAAM,IAAI,MAAM,OAAO;AAAA,UAC/B;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAEA,aAAS,UAAW,SAAS;AAC3B,gBAAU,EAAE,GAAG,QAAO;AACtB,YAAM,OAAO,gBAAgB,OAAO;AACpC,UAAI,MAAM;AACR,YAAI,QAAQ,WAAW,QAAW;AAChC,kBAAQ,SAAS;AAAA,QACvB;AACI,YAAI,EAAE,mBAAmB,UAAU;AACjC,kBAAQ,gBAAgB;AAAA,QAC9B;AAAA,MACA;AACE,YAAM,gBAAgB,uBAAuB,OAAO;AACpD,YAAM,SAAS,iBAAiB,SAAS,QAAQ;AACjD,YAAM,gBAAgB,uBAAuB,OAAO;AACpD,YAAM,aAAa,OAAO,kBAAkB,aAAa,gBAAgB;AACzE,YAAM,eAAe,yBAAyB,SAAS,cAAc;AACrE,YAAM,iBAAiB,yBAAyB,SAAS,gBAAgB;AAEzE,eAAS,oBAAqB,KAAK,QAAQ,OAAO,UAAU,QAAQ,aAAa;AAC/E,YAAI,QAAQ,OAAO,GAAG;AAEtB,YAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,YAAY;AACrF,kBAAQ,MAAM,OAAO,GAAG;AAAA,QAC9B;AACI,gBAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK;AAExC,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACjB;AACQ,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACjB;AAEQ,gBAAI,MAAM;AACV,gBAAI,OAAO;AACX,kBAAM,sBAAsB;AAE5B,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACnB;AACU,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACnB;AACU,oBAAM,KAAK,KAAK;AAChB,kBAAI,WAAW,IAAI;AACjB,+BAAe;AACf,uBAAO;AAAA,EAAK,WAAW;AACvB,uBAAO;AAAA,EAAM,WAAW;AAAA,cACpC;AACU,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMC,OAAM,oBAAoB,OAAO,CAAC,GAAG,OAAO,OAAO,UAAU,QAAQ,WAAW;AACtF,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACnB;AACU,oBAAM,MAAM,oBAAoB,OAAO,CAAC,GAAG,OAAO,OAAO,UAAU,QAAQ,WAAW;AACtF,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,GAAG,IAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cAC3D;AACU,kBAAI,WAAW,IAAI;AACjB,uBAAO;AAAA,EAAK,mBAAmB;AAAA,cAC3C;AACU,oBAAM,IAAG;AACT,qBAAO,IAAI,GAAG;AAAA,YACxB;AAEQ,gBAAI,OAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAY,KAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACjB;AACQ,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACjB;AACQ,gBAAI,aAAa;AACjB,gBAAI,YAAY;AAChB,gBAAI,WAAW,IAAI;AACjB,6BAAe;AACf,qBAAO;AAAA,EAAM,WAAW;AACxB,2BAAa;AAAA,YACvB;AACQ,kBAAM,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACvE,gBAAI,iBAAiB,CAAC,wBAAwB,KAAK,GAAG;AACpD,qBAAO,KAAK,MAAM,UAAU;AAAA,YACtC;AACQ,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMC,OAAM,KAAK,CAAC;AAClB,oBAAM,MAAM,oBAAoBA,MAAK,OAAO,OAAO,UAAU,QAAQ,WAAW;AAChF,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,UAAU,GAAG,GAAG;AACxD,4BAAY;AAAA,cACxB;AAAA,YACA;AACQ,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,SAAS,UAAU,IAAI,aAAa,WAAW,CAAC;AACnE,0BAAY;AAAA,YACtB;AACQ,gBAAI,WAAW,MAAM,UAAU,SAAS,GAAG;AACzC,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YAC9D;AACQ,kBAAM,IAAG;AACT,mBAAO,IAAI,GAAG;AAAA,UACtB;AAAA,UACM,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YAC7B;AAAA;AAAA,UAEM;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QACpC;AAAA,MACA;AAEE,eAAS,uBAAwB,KAAK,OAAO,OAAO,UAAU,QAAQ,aAAa;AACjF,YAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,YAAY;AACrF,kBAAQ,MAAM,OAAO,GAAG;AAAA,QAC9B;AAEI,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACjB;AACQ,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACjB;AAEQ,kBAAM,sBAAsB;AAC5B,gBAAI,MAAM;AACV,gBAAI,OAAO;AAEX,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACnB;AACU,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACnB;AACU,oBAAM,KAAK,KAAK;AAChB,kBAAI,WAAW,IAAI;AACjB,+BAAe;AACf,uBAAO;AAAA,EAAK,WAAW;AACvB,uBAAO;AAAA,EAAM,WAAW;AAAA,cACpC;AACU,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMD,OAAM,uBAAuB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,UAAU,QAAQ,WAAW;AAC5F,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACnB;AACU,oBAAM,MAAM,uBAAuB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,UAAU,QAAQ,WAAW;AAC5F,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,GAAG,IAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cAC3D;AACU,kBAAI,WAAW,IAAI;AACjB,uBAAO;AAAA,EAAK,mBAAmB;AAAA,cAC3C;AACU,oBAAM,IAAG;AACT,qBAAO,IAAI,GAAG;AAAA,YACxB;AACQ,kBAAM,KAAK,KAAK;AAChB,gBAAI,aAAa;AACjB,gBAAI,WAAW,IAAI;AACjB,6BAAe;AACf,qBAAO;AAAA,EAAM,WAAW;AACxB,2BAAa;AAAA,YACvB;AACQ,gBAAI,YAAY;AAChB,uBAAWC,QAAO,UAAU;AAC1B,oBAAM,MAAM,uBAAuBA,MAAK,MAAMA,IAAG,GAAG,OAAO,UAAU,QAAQ,WAAW;AACxF,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,UAAU,GAAG,GAAG;AACxD,4BAAY;AAAA,cACxB;AAAA,YACA;AACQ,gBAAI,WAAW,MAAM,UAAU,SAAS,GAAG;AACzC,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YAC9D;AACQ,kBAAM,IAAG;AACT,mBAAO,IAAI,GAAG;AAAA,UACtB;AAAA,UACM,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YAC7B;AAAA;AAAA,UAEM;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QACpC;AAAA,MACA;AAEE,eAAS,gBAAiB,KAAK,OAAO,OAAO,QAAQ,aAAa;AAChE,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACjB;AACQ,gBAAI,OAAO,MAAM,WAAW,YAAY;AACtC,sBAAQ,MAAM,OAAO,GAAG;AAExB,kBAAI,OAAO,UAAU,UAAU;AAC7B,uBAAO,gBAAgB,KAAK,OAAO,OAAO,QAAQ,WAAW;AAAA,cACzE;AACU,kBAAI,UAAU,MAAM;AAClB,uBAAO;AAAA,cACnB;AAAA,YACA;AACQ,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACjB;AACQ,kBAAM,sBAAsB;AAE5B,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACnB;AACU,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACnB;AACU,oBAAM,KAAK,KAAK;AAChB,6BAAe;AACf,kBAAIC,OAAM;AAAA,EAAK,WAAW;AAC1B,oBAAMC,QAAO;AAAA,EAAM,WAAW;AAC9B,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMH,OAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,QAAQ,WAAW;AAC3E,gBAAAE,QAAOF,SAAQ,SAAYA,OAAM;AACjC,gBAAAE,QAAOC;AAAA,cACnB;AACU,oBAAM,MAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,QAAQ,WAAW;AAC3E,cAAAD,QAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,gBAAAA,QAAO,GAAGC,KAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cAC3D;AACU,cAAAD,QAAO;AAAA,EAAK,mBAAmB;AAC/B,oBAAM,IAAG;AACT,qBAAO,IAAIA,IAAG;AAAA,YACxB;AAEQ,gBAAI,OAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAY,KAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACjB;AACQ,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACjB;AACQ,2BAAe;AACf,kBAAM,OAAO;AAAA,EAAM,WAAW;AAC9B,gBAAI,MAAM;AACV,gBAAI,YAAY;AAChB,gBAAI,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACrE,gBAAI,wBAAwB,KAAK,GAAG;AAClC,qBAAO,oBAAoB,OAAO,MAAM,cAAc;AACtD,qBAAO,KAAK,MAAM,MAAM,MAAM;AAC9B,8CAAgC,MAAM;AACtC,0BAAY;AAAA,YACtB;AACQ,gBAAI,eAAe;AACjB,qBAAO,KAAK,MAAM,UAAU;AAAA,YACtC;AACQ,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMD,OAAM,KAAK,CAAC;AAClB,oBAAM,MAAM,gBAAgBA,MAAK,MAAMA,IAAG,GAAG,OAAO,QAAQ,WAAW;AACvE,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,KAAK,GAAG;AAC5C,4BAAY;AAAA,cACxB;AAAA,YACA;AACQ,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,WAAW,aAAa,WAAW,CAAC;AACvD,0BAAY;AAAA,YACtB;AACQ,gBAAI,cAAc,IAAI;AACpB,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YAC9D;AACQ,kBAAM,IAAG;AACT,mBAAO,IAAI,GAAG;AAAA,UACtB;AAAA,UACM,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YAC7B;AAAA;AAAA,UAEM;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QACpC;AAAA,MACA;AAEE,eAAS,gBAAiB,KAAK,OAAO,OAAO;AAC3C,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACjB;AACQ,gBAAI,OAAO,MAAM,WAAW,YAAY;AACtC,sBAAQ,MAAM,OAAO,GAAG;AAExB,kBAAI,OAAO,UAAU,UAAU;AAC7B,uBAAO,gBAAgB,KAAK,OAAO,KAAK;AAAA,cACpD;AACU,kBAAI,UAAU,MAAM;AAClB,uBAAO;AAAA,cACnB;AAAA,YACA;AACQ,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACjB;AAEQ,gBAAI,MAAM;AAEV,kBAAM,YAAY,MAAM,WAAW;AACnC,gBAAI,aAAa,MAAM,QAAQ,KAAK,GAAG;AACrC,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACnB;AACU,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACnB;AACU,oBAAM,KAAK,KAAK;AAChB,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMD,OAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK;AACtD,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACnB;AACU,oBAAM,MAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK;AACtD,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,SAAS,aAAa,WAAW,CAAC;AAAA,cACrD;AACU,oBAAM,IAAG;AACT,qBAAO,IAAI,GAAG;AAAA,YACxB;AAEQ,gBAAI,OAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAY,KAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACjB;AACQ,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACjB;AACQ,gBAAI,YAAY;AAChB,gBAAI,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACrE,gBAAI,aAAa,wBAAwB,KAAK,GAAG;AAC/C,qBAAO,oBAAoB,OAAO,KAAK,cAAc;AACrD,qBAAO,KAAK,MAAM,MAAM,MAAM;AAC9B,8CAAgC,MAAM;AACtC,0BAAY;AAAA,YACtB;AACQ,gBAAI,eAAe;AACjB,qBAAO,KAAK,MAAM,UAAU;AAAA,YACtC;AACQ,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMC,OAAM,KAAK,CAAC;AAClB,oBAAM,MAAM,gBAAgBA,MAAK,MAAMA,IAAG,GAAG,KAAK;AAClD,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,GAAG;AAC3C,4BAAY;AAAA,cACxB;AAAA,YACA;AACQ,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,UAAU,aAAa,WAAW,CAAC;AAAA,YAChE;AACQ,kBAAM,IAAG;AACT,mBAAO,IAAI,GAAG;AAAA,UACtB;AAAA,UACM,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YAC7B;AAAA;AAAA,UAEM;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QACpC;AAAA,MACA;AAEE,eAASG,WAAW,OAAO,UAAU,OAAO;AAC1C,YAAI,UAAU,SAAS,GAAG;AACxB,cAAI,SAAS;AACb,cAAI,OAAO,UAAU,UAAU;AAC7B,qBAAS,IAAI,OAAO,KAAK,IAAI,OAAO,EAAE,CAAC;AAAA,UAC/C,WAAiB,OAAO,UAAU,UAAU;AACpC,qBAAS,MAAM,MAAM,GAAG,EAAE;AAAA,UAClC;AACM,cAAI,YAAY,MAAM;AACpB,gBAAI,OAAO,aAAa,YAAY;AAClC,qBAAO,oBAAoB,IAAI,EAAE,IAAI,MAAK,GAAI,CAAE,GAAE,UAAU,QAAQ,EAAE;AAAA,YAChF;AACQ,gBAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,qBAAO,uBAAuB,IAAI,OAAO,CAAA,GAAI,qBAAqB,QAAQ,GAAG,QAAQ,EAAE;AAAA,YACjG;AAAA,UACA;AACM,cAAI,OAAO,WAAW,GAAG;AACvB,mBAAO,gBAAgB,IAAI,OAAO,CAAE,GAAE,QAAQ,EAAE;AAAA,UACxD;AAAA,QACA;AACI,eAAO,gBAAgB,IAAI,OAAO,CAAE,CAAA;AAAA,MACxC;AAEE,aAAOA;AAAA,IACT;AAAA;;;;;AC9mByB,UAAU;ACCnC,IAAI;AACJ,MAAM,QAAQ,IAAI,WAAW,EAAE;AAChB,SAAS,MAAM;AAE5B,MAAI,CAAC,iBAAiB;AAEpB,sBAAkB,OAAO,WAAW,eAAe,OAAO,mBAAmB,OAAO,gBAAgB,KAAK,MAAM;AAE/G,QAAI,CAAC,iBAAiB;AACpB,YAAM,IAAI,MAAM,0GAA0G;AAAA,IAChI;AAAA,EACA;AAEE,SAAO,gBAAgB,KAAK;AAC9B;ACXA,MAAM,YAAY,CAAE;AAEpB,SAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,YAAU,MAAM,IAAI,KAAO,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAClD;AAEO,SAAS,gBAAgB,KAAK,SAAS,GAAG;AAG/C,SAAO,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,MAAM,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,MAAM,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,MAAM,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,IAAI,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;AACnf;AChBA,MAAM,aAAa,OAAO,WAAW,eAAe,OAAO,cAAc,OAAO,WAAW,KAAK,MAAM;AACtG,MAAe,SAAA;AAAA,EACb;AACF;ACCA,SAAS,GAAG,SAAS,KAAK,QAAQ;AAChC,MAAI,OAAO,cAAc,CAAC,OAAO,CAAC,SAAS;AACzC,WAAO,OAAO,WAAY;AAAA,EAC9B;AAEE,YAAU,WAAW,CAAE;AACvB,QAAM,OAAO,QAAQ,WAAW,QAAQ,OAAO;AAE/C,OAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAO;AAC3B,OAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAO;AAY3B,SAAO,gBAAgB,IAAI;AAC7B;ACvBA,MAAM,IAAI;AAAA,EACN,aAAa;AAAA,EACb,aAAa;AAAA,EACb,aAAa;AAAA,EACb,aAAa;AACjB;AAIO,SAAS,WAAW,WAAW;AAIlC,SAAO,IAAI,KAAM;AACrB;AACA,MAAM,KAAK;AAAA,EACP,cAAc;AACV,SAAK,IAAI,aAAa;AACtB,SAAK,IAAI,aAAa;AACtB,SAAK,IAAI,aAAa;AACtB,SAAK,IAAI,YAAa;AACtB,SAAK,IAAI,aAAa;AACtB,SAAK,QAAQ;AACb,SAAK,MAAM;AACX,QAAI,CAAC,gBAAgB,gBAAgB,KAAyB;AAC1D,qBAAe,IAAI;AAAA,QAAY;AAAA;AAAA,MAAwB;AACvD,qBAAe;AAAA,IAC3B;AACQ,SAAK,QAAQ,IAAI;AAAA,MAAW;AAAA,MAAc;AAAA,MAAc;AAAA;AAAA,IAAsB;AAC9E,SAAK,QAAQ,IAAI;AAAA,MAAW;AAAA,MAAc;AAAA,MAAc;AAAA;AAAA,IAAsB;AAC9E,oBAAgB;AAAA,EACxB;AAAA,EACI,OAAO,MAAM;AAET,QAAI,aAAa,OAAO,MAAM;AAC1B,aAAO,KAAK,MAAM,IAAI;AAAA,IAClC;AAEQ,QAAI,QAAQ,MAAM;AACd,YAAM,IAAI,UAAU,mBAAmB,OAAO,IAAI;AAAA,IAC9D;AACQ,UAAM,aAAa,KAAK;AACxB,UAAM,SAAS,KAAK;AACpB,QAAI,SAAU,SAAS,KAAyB;AAChD,QAAI,SAAS;AAEb,QAAI,UAAU,EAAE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAwB;AACtE,YAAM,QAAQ,IAAI;AAAA,QAAW,KAAK;AAAA,QAAQ;AAAA,QAAY,SAAS;AAAA;AAAA,MAAsB;AACrF,aAAO,UAAU;AACb,aAAK,OAAO,OAAO,UAAU,CAAC;AAC9B,kBAAU;AAAA,MAC1B;AACY,WAAK,SAAS;AAAA,IAC1B;AAEQ,UAAM,oBAAoB,KAAK;AAC/B,QAAI,sBAAsB,KAAK,KAAK,QAAQ;AACxC,YAAM,OAAO,IAAI,WAAW,KAAK,QAAQ,aAAa,QAAQ,SAAS,MAAM;AAC7E,aAAO,KAAK,OAAO,IAAI;AAAA,IACnC;AAEQ,QAAI,WAAW;AACX,aAAO;AAEX,WAAO,KAAK,OAAO,MAAM,MAAM;AAAA,EACvC;AAAA,EACI,OAAO,MAAM,QAAQ;AACjB,UAAM,EAAE,OAAO,MAAK,IAAK;AACzB,UAAM,SAAS,KAAK;AACpB,aAAS,SAAS;AAClB,WAAO,SAAS,QAAQ;AACpB,YAAM,QAAQ,KAAK,QAAQ;AAC3B,UAAI,QAAQ;AACZ,aAAO,SAAS,UAAU,QAAQ,IAAuB;AACrD,cAAM,OAAO,IAAI,KAAK,QAAQ;AAAA,MAC9C;AACY,UAAI,SAAS,IAAuB;AAChC,aAAK,OAAO,KAAK;AAAA,MACjC;AACY,WAAK,SAAS,QAAQ;AAAA,IAClC;AACQ,WAAO;AAAA,EACf;AAAA,EACI,MAAM,MAAM;AACR,UAAM,EAAE,OAAO,MAAK,IAAK;AACzB,UAAM,SAAS,KAAK;AACpB,QAAI,YAAY,KAAK;AACrB,aAAS,SAAS,GAAG,SAAS,UAAS;AACnC,YAAM,QAAQ,KAAK,QAAQ;AAC3B,UAAI,QAAQ;AACZ,aAAO,SAAS,UAAU,QAAQ,IAAuB;AACrD,YAAI,OAAO,KAAK,WAAW,QAAQ,IAAI;AACvC,YAAI,OAAO,KAAM;AAEb,gBAAM,OAAO,IAAI;AAAA,QACrC,WACyB,OAAO,MAAO;AAEnB,gBAAM,OAAO,IAAI,MAAQ,SAAS;AAClC,gBAAM,OAAO,IAAI,MAAQ,OAAO;AAAA,QACpD,WACyB,OAAO,SAAU,OAAO,OAAQ;AAErC,gBAAM,OAAO,IAAI,MAAQ,SAAS;AAClC,gBAAM,OAAO,IAAI,MAAS,SAAS,IAAK;AACxC,gBAAM,OAAO,IAAI,MAAQ,OAAO;AAAA,QACpD,WACyB,WAAW;AAEhB,mBAAS,YAAY,SAAU,OAAO,OAAO,QAAS;AACtD,gBAAM,OAAO,IAAI,MAAQ,SAAS;AAClC,gBAAM,OAAO,IAAI,MAAS,SAAS,KAAM;AACzC,gBAAM,OAAO,IAAI,MAAS,SAAS,IAAK;AACxC,gBAAM,OAAO,IAAI,MAAQ,OAAO;AAChC,sBAAY;AAAA,QAChC,OACqB;AACD,sBAAY;AAAA,QAChC;AAAA,MACA;AACY,UAAI,SAAS,IAAuB;AAChC,aAAK,OAAO,KAAK;AACjB,cAAM,CAAC,IAAI;AAAA,UAAM;AAAA;AAAA,QAAsB;AAAA,MACvD;AACY,WAAK,SAAS,QAAQ;AAAA,IAClC;AACQ,SAAK,MAAM;AACX,WAAO;AAAA,EACf;AAAA,EACI,OAAO,MAAM,QAAQ;AACjB,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AACxB,QAAI,IAAI;AACR,aAAS,SAAS;AAClB,WAAO,IAAI,IAAuB;AAC9B,QAAE,GAAG,IAAI,OAAO,KAAK,QAAQ,CAAC;AAAA,IAC1C;AACQ,SAAK,IAAI,IAAuB,IAAI,IAAsB,KAAK;AAC3D,QAAE,CAAC,IAAI,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAAA,IACtE;AACQ,SAAK,IAAI,GAAG,IAAI,IAAsB,KAAK;AACvC,YAAM,IAAK,IAAI,KAAM;AACrB,YAAM,IAAK,QAAQ,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAK;AAC5D,UAAI;AACJ,UAAI;AACJ,UAAI,SAAS,CAAC;AACd,UAAI;AACJ,UAAI;AAAA,IAChB;AACQ,SAAK,IAAK,IAAI,KAAK,IAAK;AACxB,SAAK,IAAK,IAAI,KAAK,IAAK;AACxB,SAAK,IAAK,IAAI,KAAK,IAAK;AACxB,SAAK,IAAK,IAAI,KAAK,IAAK;AACxB,SAAK,IAAK,IAAI,KAAK,IAAK;AAAA,EAChC;AAAA,EACI,OAAO,UAAU;AACb,UAAM,EAAE,OAAO,MAAK,IAAK;AACzB,QAAI,IAAK,KAAK,QAAQ,KAAyB;AAC/C,UAAM,GAAG,IAAI;AAEb,WAAO,IAAI,GAAG;AACV,YAAM,GAAG,IAAI;AAAA,IACzB;AACQ,UAAM;AACN,QAAI,IAAI,IAAsB;AAC1B,aAAO,IAAI,IAAuB;AAC9B,cAAM,GAAG,IAAI;AAAA,MAC7B;AACY,UAAI;AACJ,WAAK,OAAO,KAAK;AAAA,IAC7B;AAEQ,WAAO,IAAI,IAAuB;AAC9B,YAAM,GAAG,IAAI;AAAA,IACzB;AAEQ,UAAM,SAAS,KAAK,QAAQ;AAC5B,UAAM,SAAS,SAAS,gBAAgB;AACxC,UAAM,UAAU,SAAS,SAAS;AAClC,QAAI;AACA;AAAA,QAAM;AAAA;AAAA,MAAE,IAAsB,OAAO,MAAM;AAC/C,QAAI;AACA;AAAA,QAAM;AAAA;AAAA,MAAE,IAAqB,OAAO,KAAK;AAC7C,SAAK,OAAO,KAAK;AACjB,WAAQ,aAAa,QAAS,KAAK,KAAM,IAAG,KAAK,KAAM;AAAA,EAC/D;AAAA,EACI,OAAO;AACH,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AAC1B,WAAO,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AAAA,EAClE;AAAA,EACI,OAAO;AACH,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,OAAO,MAAK,IAAK;AACxC,UAAM,CAAC,IAAI,OAAO,CAAC;AACnB,UAAM,CAAC,IAAI,OAAO,CAAC;AACnB,UAAM,CAAC,IAAI,OAAO,CAAC;AACnB,UAAM,CAAC,IAAI,OAAO,CAAC;AACnB,UAAM,CAAC,IAAI,OAAO,CAAC;AACnB,WAAO,MAAM,MAAM,GAAG,EAAE;AAAA,EAChC;AACA;AACA,MAAM,IAAI,IAAI;AAAA,EAAW;AAAA;AAAqB;AAC9C,IAAI;AACJ,IAAI,eAAe;AACnB,MAAM,QAAQ,UAAQ,MAAM,YAAa,SAAS,EAAE,EAAE,OAAO,EAAE;AAC/D,MAAM,SAAU,OAAQ,KAAK,KAAM,aAAgB,KAAK,IAAK,WAAc,KAAK,IAAK,QAAY,KAAK,KAAM;AAC5G,MAAM,SAAU,OAAK;AACrB,MAAM,SAAS,SAAS,SAAS;AACjC,MAAM,UAAU,SAAQ,OAAO,IAAM,QAAQ;AAC7C,MAAM,UAAU,SAAQ,OAAO,IAAM,QAAQ;AAC7C,MAAM,WAAW,SAAQ,OAAO,KAAO,QAAQ;AAC/C,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AACpB,MAAI,MAAM;AACN,WAAQ,IAAI,IAAO,CAAC,IAAK;AAC7B,MAAI,MAAM;AACN,WAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AACpC,SAAO,IAAI,IAAI;AACnB;AACA,SAAS,OAAO;AACZ,QAAM,MAAM,IAAI,WAAW,IAAI,YAAY,CAAC,KAAM,CAAC,EAAE,MAAM;AAC3D,SAAQ,IAAI,CAAC,MAAM;AACvB;AC3NA,MAAM,kBAAkB,IAAI,MAAM,4BAA4B;AAE9C,SAAA,UACd,MACA,MACA,QACiB;AACX,QAAA;AACR;AAEO,SAAS,SAAS,MAAc;AAC/B,QAAA;AACR;AAEO,SAAS,UACd,KAC8C;AACxC,QAAA;AACR;AAEa,MAAA,UAAU,OAAO,SAAiB;AAC7C,SAAO,SAAa;AACtB;AAEO,MAAM,OAAO,CAClB,MACA,YAAY,WACT;AACH,MAAI,CAAC,CAAC,MAAM,EAAE,SAAS,SAAS,GAAG;AAC3B,UAAA,IAAI,MAAM,kDAAkD;AAAA,EAAA;AAG9DC,QAAAA,QAAO,cAAc,IAAI;AAC/B,SAAO,mBAAmBA,KAAI;AAChC;AAEA,SAAS,mBAAmB,YAAwB;AAElD,MAAI,eAAe;AACnB,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,oBAAgB,OAAO,aAAa,WAAW,CAAC,CAAC;AAAA,EAAA;AAI7C,QAAA,eAAe,KAAK,YAAY;AAC/B,SAAA;AACT;AAEA,SAAS,cACP,MACA,YAAY,QACZ;AACA,MAAI,CAAC,CAAC,MAAM,EAAE,SAAS,SAAS,GAAG;AAC3B,UAAA,IAAI,MAAM,kDAAkD;AAAA,EAAA;AAEpE,SAAOC,WAAqB,EACzB,OAAO,IAAc,EACrB,OAAO;AACZ;AC9CO,SAAS,iBAAiB,MAA6B;AACpD,UAAA,IAAI,KAAK,IAAI,EAAE,YAAY,KAAM,QAAQ,CAAC;AACpD;AAEO,SAAS,8BAA8B;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAAgE;AAC9D,QAAM,EAAE,WAAW,OAAO,IAAI,KAAS,IAAA;AAChC,SAAA;AAAA,IACL,iBAAiB,SAAS;AAAA;AAAA,IAC1B,OAAO,IAAI;AAAA;AAAA,IACX;AAAA;AAAA,MAEE,CAAC,YAAY,OAAO,IAAI,MAAMC,UAAc,UAAU,KAAK,CAAC,EAAE,KAAK,EAAE;AAAA,IACvE;AAAA,IACA;AAAA;AAAA,EACF;AACF;AAEA,MAAM,aAAa,IAAI,YAAY;AAE5B,SAAS,+BACd,QACY;AACN,QAAA,UAAU,OAAO,KAAK,EAAE;AAC9B,QAAM,SAAS,yBAA4B,QAAQ,OAAO,SAAS;AAC5D,SAAA,WAAW,OAAO,SAAS,OAAO;AAC3C;AAEO,SAAS,OAAO,IAA2C;AAC1D,QAAA,OAAO,YAAY,OAAO,EAAE,IAAI,KAAK,IAAI,WAAW,EAAE;AAC5D,SAAO,MAAM,UAAU,IACpB,KAAK,MAAM,CAAC,OAAe,OAAO,EAAE,SAAS,EAAE,GAAG,MAAM,EAAE,CAAC,EAC3D,KAAK,EAAE;AACZ;AAEO,SAAS,OAAO,KAAa;;AAClC,SAAO,IAAI;AAAA,MACT,SAAI,MAAM,cAAc,MAAxB,mBAA2B,IAAI,SAAU,GAAG;AACnC,aAAA,SAAS,GAAG,EAAE;AAAA,IAAA,OACjB,CAAA;AAAA,EACR;AACF;AAEsB,eAAA,wBACpB,SACA,YACoB;AACd,QAAA,SAAS,8BAA8B,OAAO;AAC9C,QAAA,UAAU,+BAA+B,MAAM;AAC/C,QAAA,YAAY,MAAM,WAAW,OAAO;AAC1C,SAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,SAAS,CAAC,EAAE;AAC7C;AAEA,eAAsB,qBACpB,QACA,SACA,UACA,SACA,aACoC;;AACpC,QAAM,SAAS,QAAQ,UAAU,QAAQ,QAAW;AAAA,IAClD,WAAW;AAAA,IACX,8BAA8B;AAAA,EAAA,CAC/B;AACD,QAAM,YAAY,OAAO,WAAW,OAAO,KAAK,EAAE,GAAG,EAAE;AACvD,MAAI,CAAC,WAAW;AACR,UAAA,IAAI,MAAM,wBAAwB;AAAA,EAAA;AAGpC,QAAA,sBAAoB,YAAO,WAAW,OAAO,KAAK,EAAE,GAAG,EAAE,MAArC,mBAAwC,SAAQ;AAC1E,QAAM,YAAY,MAAM;AAAA,IACtB;AAAA,MACE,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IACF;AAAA,IACA;AAAA,EACF;AAEO,SAAA;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG,UAAU;AAAA,MACb,QAAQ;AAAA,QACN,IAAG,eAAU,YAAV,mBAAmB;AAAA,QACtB,GAAG,QAAQ;AAAA,QACX,YAAY,CAAC,GAAI,QAAQ,OAAO,cAAc,IAAK,SAAS;AAAA,MAAA;AAAA,IAC9D;AAAA,EAEJ;AACF;AAEsB,eAAA,yBACpB,WACA,QACA,eACkB;AACZ,QAAA,YAAY,OAAO,IAAI;AAC7B,QAAM,SAAS,UAAU,MAAM,GAAG,CAAC;AACnC,QAAM,iBAAiB,OAAO,UAAU,CAAC,CAAC;AACpC,QAAA,kBAAkB,+BAA+B,MAAM;AACtD,SAAA,cAAc,WAAW,gBAAgB,eAAe;AACjE;ACzHA,MAAM,QAAQ,EAAE,4BAA4B,CAAC,IAAI,GAAG,4BAA4B,CAAC,cAAc,GAAG,0BAA0B,CAAC,IAAI,GAAG,oBAAoB,CAAC,MAAM,GAAG,0BAA0B,CAAC,YAAY,GAAG,wBAAwB,CAAC,MAAM,GAAG,2BAA2B,CAAC,SAAS,GAAG,+BAA+B,CAAC,aAAa,GAAG,2BAA2B,CAAC,SAAS,GAAG,4BAA4B,CAAC,KAAK,GAAG,6BAA6B,CAAC,MAAM,GAAG,6BAA6B,CAAC,MAAM,GAAG,oCAAoC,CAAC,KAAK,GAAG,qCAAqC,CAAC,MAAM,GAAG,oBAAoB,CAAC,MAAM,GAAG,4BAA4B,CAAC,KAAK,GAAG,yBAAyB,CAAC,OAAO,GAAG,wBAAwB,CAAC,MAAM,GAAG,+BAA+B,CAAC,OAAO,GAAG,8BAA8B,CAAC,OAAO,GAAG,2BAA2B,CAAC,OAAO,GAAG,2BAA2B,CAAC,OAAO,GAAG,0BAA0B,CAAC,OAAO,GAAG,uBAAuB,CAAC,KAAK,GAAG,wBAAwB,CAAC,IAAI,GAAG,mBAAmB,CAAC,KAAK,GAAG,wBAAwB,CAAC,KAAK,GAAG,8BAA8B,CAAC,KAAK,GAAG,4BAA4B,CAAC,UAAU,GAAG,2BAA2B,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,wBAAwB,CAAC,OAAO,GAAG,0BAA0B,CAAC,MAAM,GAAG,wBAAwB,CAAC,MAAM,GAAG,6BAA6B,CAAC,WAAW,GAAG,wBAAwB,CAAC,MAAM,GAAG,mBAAmB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,0BAA0B,CAAC,KAAK,GAAG,wBAAwB,CAAC,SAAS,GAAG,uBAAuB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,oBAAoB,CAAC,IAAI,GAAG,qBAAqB,CAAC,OAAO,GAAG,2BAA2B,CAAC,KAAK,GAAG,yBAAyB,CAAC,OAAO,OAAO,GAAG,qBAAqB,CAAC,OAAO,GAAG,uBAAuB,CAAC,KAAK,GAAG,4BAA4B,CAAC,OAAO,OAAO,KAAK,GAAG,sCAAsC,CAAC,KAAK,GAAG,uBAAuB,CAAC,OAAO,GAAG,0BAA0B,CAAC,KAAK,GAAG,oBAAoB,CAAC,QAAQ,KAAK,GAAG,qBAAqB,CAAC,OAAO,GAAG,2BAA2B,CAAC,QAAQ,GAAG,uBAAuB,CAAC,QAAQ,GAAG,uBAAuB,CAAC,KAAK,GAAG,wBAAwB,CAAC,SAAS,GAAG,4BAA4B,CAAC,KAAK,GAAG,8BAA8B,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,6BAA6B,CAAC,aAAa,GAAG,oBAAoB,CAAC,KAAK,GAAG,2BAA2B,CAAC,MAAM,GAAG,2BAA2B,CAAC,MAAM,MAAM,IAAI,GAAG,0BAA0B,CAAC,QAAQ,GAAG,oBAAoB,CAAC,MAAM,GAAG,wCAAwC,CAAC,KAAK,GAAG,sCAAsC,CAAC,OAAO,GAAG,4BAA4B,CAAC,UAAU,GAAG,6BAA6B,CAAC,OAAO,GAAG,wBAAwB,CAAC,MAAM,GAAG,2BAA2B,CAAC,MAAM,GAAG,2BAA2B,CAAC,MAAM,GAAG,wBAAwB,CAAC,MAAM,GAAG,oBAAoB,CAAC,OAAO,MAAM,GAAG,mBAAmB,CAAC,QAAQ,SAAS,QAAQ,KAAK,GAAG,oBAAoB,CAAC,MAAM,GAAG,0BAA0B,CAAC,YAAY,GAAG,sBAAsB,CAAC,OAAO,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,uBAAuB,CAAC,IAAI,GAAG,yBAAyB,CAAC,IAAI,GAAG,oBAAoB,CAAC,KAAK,GAAG,4BAA4B,CAAC,OAAO,OAAO,OAAO,OAAO,MAAM,QAAQ,SAAS,OAAO,OAAO,QAAQ,OAAO,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,QAAQ,GAAG,mBAAmB,CAAC,KAAK,GAAG,iCAAiC,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,yBAAyB,CAAC,OAAO,GAAG,uBAAuB,CAAC,UAAU,WAAW,UAAU,QAAQ,GAAG,oBAAoB,CAAC,MAAM,GAAG,+BAA+B,CAAC,MAAM,GAAG,mCAAmC,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,6BAA6B,CAAC,KAAK,GAAG,wBAAwB,CAAC,KAAK,GAAG,6BAA6B,CAAC,OAAO,MAAM,GAAG,0BAA0B,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,GAAG,0BAA0B,CAAC,OAAO,KAAK,GAAG,+BAA+B,CAAC,KAAK,GAAG,qBAAqB,CAAC,IAAI,GAAG,8BAA8B,CAAC,IAAI,GAAG,yBAAyB,CAAC,KAAK,GAAG,wBAAwB,CAAC,KAAK,GAAG,4BAA4B,CAAC,SAAS,GAAG,uBAAuB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,0BAA0B,CAAC,MAAM,OAAO,IAAI,GAAG,8BAA8B,CAAC,OAAO,GAAG,wBAAwB,CAAC,SAAS,GAAG,yBAAyB,CAAC,MAAM,GAAG,uBAAuB,CAAC,OAAO,KAAK,GAAG,2BAA2B,CAAC,KAAK,GAAG,uCAAuC,CAAC,KAAK,GAAG,kCAAkC,CAAC,IAAI,GAAG,uCAAuC,CAAC,KAAK,GAAG,gCAAgC,CAAC,IAAI,GAAG,6BAA6B,CAAC,MAAM,GAAG,gCAAgC,CAAC,KAAK,GAAG,6BAA6B,CAAC,MAAM,GAAG,iCAAiC,CAAC,KAAK,GAAG,6BAA6B,CAAC,KAAK,GAAG,wBAAwB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,+BAA+B,CAAC,KAAK,GAAG,gCAAgC,CAAC,KAAK,GAAG,+BAA+B,CAAC,KAAK,GAAG,gCAAgC,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,yBAAyB,CAAC,QAAQ,GAAG,0BAA0B,CAAC,SAAS,GAAG,sCAAsC,CAAC,QAAQ,GAAG,2CAA2C,CAAC,QAAQ,GAAG,uBAAuB,CAAC,KAAK,GAAG,qBAAqB,CAAC,OAAO,OAAO,GAAG,wBAAwB,CAAC,OAAO,MAAM,GAAG,4BAA4B,CAAC,IAAI,GAAG,kCAAkC,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,oBAAoB,CAAC,MAAM,GAAG,wBAAwB,CAAC,OAAO,GAAG,uBAAuB,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,wBAAwB,CAAC,MAAM,GAAG,wBAAwB,CAAC,SAAS,GAAG,uBAAuB,CAAC,OAAO,WAAW,GAAG,0BAA0B,CAAC,KAAK,GAAG,gCAAgC,CAAC,KAAK,GAAG,oBAAoB,CAAC,MAAM,GAAG,oBAAoB,CAAC,MAAM,GAAG,wBAAwB,CAAC,MAAM,GAAG,sBAAsB,CAAC,KAAK,GAAG,gCAAgC,CAAC,QAAQ,GAAG,kCAAkC,CAAC,IAAI,GAAG,4BAA4B,CAAC,MAAM,GAAG,oBAAoB,CAAC,MAAM,GAAG,+BAA+B,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,4BAA4B,CAAC,UAAU,GAAG,wBAAwB,CAAC,MAAM,GAAG,4BAA4B,CAAC,KAAK,GAAG,6BAA6B,CAAC,KAAK,GAAG,6BAA6B,CAAC,KAAK,GAAG,2BAA2B,CAAC,KAAK,GAAG,2BAA2B,CAAC,KAAK,GAAG,wBAAwB,CAAC,MAAM,GAAG,oBAAoB,CAAC,MAAM,GAAG,yBAAyB,CAAC,SAAS,KAAK,GAAG,yBAAyB,CAAC,KAAK,GAAG,mBAAmB,CAAC,OAAO,OAAO,OAAO,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,uBAAuB,CAAC,KAAK,GAAG,yBAAyB,CAAC,KAAK,GAAG,wBAAwB,CAAC,QAAQ,MAAM,GAAG,wBAAwB,CAAC,MAAM,GAAG,sBAAsB,CAAC,QAAQ,SAAS,QAAQ,KAAK,GAAG,oBAAoB,CAAC,MAAM,GAAG,uBAAuB,CAAC,KAAK,GAAG,mBAAmB,CAAC,KAAK,GAAG,cAAc,CAAC,OAAO,GAAG,aAAa,CAAC,QAAQ,KAAK,GAAG,eAAe,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,eAAe,CAAC,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,QAAQ,OAAO,KAAK,GAAG,oBAAoB,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,GAAG,aAAa,CAAC,OAAO,MAAM,GAAG,cAAc,CAAC,QAAQ,OAAO,QAAQ,OAAO,OAAO,KAAK,GAAG,aAAa,CAAC,OAAO,OAAO,OAAO,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,YAAY,CAAC,IAAI,GAAG,mBAAmB,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,OAAO,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,mBAAmB,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,eAAe,CAAC,IAAI,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,uBAAuB,CAAC,OAAO,GAAG,cAAc,CAAC,MAAM,GAAG,uBAAuB,CAAC,OAAO,GAAG,eAAe,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,OAAO,MAAM,GAAG,cAAc,CAAC,QAAQ,OAAO,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,KAAK,GAAG,aAAa,CAAC,OAAO,MAAM,GAAG,aAAa,CAAC,OAAO,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,iBAAiB,CAAC,OAAO,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,OAAO,MAAM,GAAG,iBAAiB,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,oCAAoC,CAAC,0BAA0B,GAAG,kBAAkB,CAAC,OAAO,GAAG,kCAAkC,CAAC,OAAO,GAAG,2CAA2C,CAAC,OAAO,GAAG,0BAA0B,CAAC,OAAO,GAAG,kBAAkB,CAAC,OAAO,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,mBAAmB,CAAC,MAAM,GAAG,qBAAqB,CAAC,KAAK,GAAG,cAAc,CAAC,OAAO,MAAM,GAAG,YAAY,CAAC,IAAI,GAAG,cAAc,CAAC,OAAO,QAAQ,MAAM,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,kBAAkB,CAAC,MAAM,GAAG,kBAAkB,CAAC,MAAM,GAAG,sBAAsB,CAAC,OAAO,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,cAAc,CAAC,OAAO,MAAM,GAAG,oBAAoB,CAAC,SAAS,OAAO,GAAG,yBAAyB,CAAC,MAAM,GAAG,kBAAkB,CAAC,SAAS,OAAO,GAAG,iBAAiB,CAAC,OAAO,MAAM,GAAG,kBAAkB,CAAC,MAAM,GAAG,uBAAuB,CAAC,YAAY,UAAU,GAAG,iBAAiB,CAAC,OAAO,KAAK,GAAG,qBAAqB,CAAC,UAAU,WAAW,GAAG,YAAY,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,QAAQ,OAAO,OAAO,GAAG,aAAa,CAAC,MAAM,GAAG,mBAAmB,CAAC,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,GAAG,cAAc,CAAC,OAAO,QAAQ,QAAQ,OAAO,QAAQ,OAAO,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,eAAe,CAAC,UAAU,MAAM,GAAG,6BAA6B,CAAC,KAAK,GAAG,cAAc,CAAC,KAAK,MAAM,QAAQ,OAAO,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,GAAG,iBAAiB,CAAC,OAAO,QAAQ,MAAM,GAAG,cAAc,CAAC,OAAO,GAAG,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,KAAK,GAAG,cAAc,CAAC,OAAO,MAAM,GAAG,eAAe,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,GAAG,qBAAqB,CAAC,KAAK,GAAG,cAAc,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,OAAO,GAAG,aAAa,CAAC,OAAO,MAAM,GAAG,cAAc,CAAC,IAAI,GAAG,aAAa,CAAC,OAAO,QAAQ,MAAM,GAAG,cAAc,CAAC,QAAQ,OAAO,OAAO,OAAO,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,mBAAmB,CAAC,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,EAAG;AACj0V,OAAO,OAAO,KAAK;ACDnB,IAAI,yBAAkE,SAAU,UAAU,OAAO,MAAM,GAAG;AACtG,MAAI,SAAS,OAAO,CAAC,EAAG,OAAM,IAAI,UAAU,+CAA+C;AAC3F,MAAI,OAAO,UAAU,aAAa,aAAa,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ,EAAG,OAAM,IAAI,UAAU,0EAA0E;AACjL,SAAO,SAAS,MAAM,IAAI,SAAS,MAAM,EAAE,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ,MAAM,IAAI,QAAQ;AAChG;AACA,IAAI,uBAAuB,uBAAuB;AAClD,MAAM,KAAK;AAAA,EACP,eAAe,MAAM;AACjB,0BAAsB,IAAI,MAAM,oBAAI,IAAG,CAAE;AACzC,0BAAsB,IAAI,MAAM,oBAAI,IAAG,CAAE;AACzC,2BAAuB,IAAI,MAAM,oBAAI,IAAG,CAAE;AAC1C,eAAW,OAAO,MAAM;AACpB,WAAK,OAAO,GAAG;AAAA,IAC3B;AAAA,EACA;AAAA,EACI,OAAO,SAAS,QAAQ,OAAO;AAC3B,aAAS,CAAC,MAAM,UAAU,KAAK,OAAO,QAAQ,OAAO,GAAG;AACpD,aAAO,KAAK,YAAa;AACzB,mBAAa,WAAW,IAAI,CAAC,QAAQ,IAAI,aAAa;AACtD,UAAI,CAAC,uBAAuB,MAAM,wBAAwB,GAAG,EAAE,IAAI,IAAI,GAAG;AACtE,+BAAuB,MAAM,wBAAwB,GAAG,EAAE,IAAI,MAAM,oBAAI,KAAK;AAAA,MAC7F;AACY,YAAM,gBAAgB,uBAAuB,MAAM,wBAAwB,GAAG,EAAE,IAAI,IAAI;AACxF,UAAI,QAAQ;AACZ,eAAS,aAAa,YAAY;AAC9B,cAAM,UAAU,UAAU,WAAW,GAAG;AACxC,oBAAY,UAAU,UAAU,MAAM,CAAC,IAAI;AAC3C,uDAAe,IAAI;AACnB,YAAI,OAAO;AACP,iCAAuB,MAAM,uBAAuB,GAAG,EAAE,IAAI,MAAM,SAAS;AAAA,QAChG;AACgB,gBAAQ;AACR,YAAI;AACA;AACJ,cAAM,cAAc,uBAAuB,MAAM,uBAAuB,GAAG,EAAE,IAAI,SAAS;AAC1F,YAAI,eAAe,eAAe,QAAQ,CAAC,OAAO;AAC9C,gBAAM,IAAI,MAAM,IAAI,IAAI,OAAO,SAAS,qBAAqB,WAAW,OAAO,SAAS,qDAAqD;AAAA,QACjK;AACgB,+BAAuB,MAAM,uBAAuB,GAAG,EAAE,IAAI,WAAW,IAAI;AAAA,MAC5F;AAAA,IACA;AACQ,WAAO;AAAA,EACf;AAAA,EACI,QAAQ,MAAM;AACV,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,UAAM,OAAO,KAAK,QAAQ,YAAY,EAAE,EAAE,YAAa;AACvD,UAAM,MAAM,KAAK,QAAQ,SAAS,EAAE,EAAE,YAAa;AACnD,UAAM,UAAU,KAAK,SAAS,KAAK;AACnC,UAAM,SAAS,IAAI,SAAS,KAAK,SAAS;AAC1C,QAAI,CAAC,UAAU;AACX,aAAO;AACX,WAAO,uBAAuB,MAAM,uBAAuB,GAAG,EAAE,IAAI,GAAG,KAAK;AAAA,EACpF;AAAA,EACI,aAAa,MAAM;;AACf,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,YAAO,kCAAM,UAAN,8BAAc,KAAK;AAC1B,YAAS,QAAQ,uBAAuB,MAAM,uBAAuB,GAAG,EAAE,IAAI,KAAK,KAAI,EAAG,YAAW,CAAE,MAAM;AAAA,EACrH;AAAA,EACI,iBAAiB,MAAM;AACnB,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,WAAO,uBAAuB,MAAM,wBAAwB,GAAG,EAAE,IAAI,KAAK,YAAa,CAAA,KAAK;AAAA,EACpG;AAAA,EACI,UAAU;AACN,SAAK,SAAS,MAAM;AAChB,YAAM,IAAI,MAAM,8HAA8H;AAAA,IACjJ;AACD,WAAO,OAAO,IAAI;AAClB,eAAW,cAAc,uBAAuB,MAAM,wBAAwB,GAAG,EAAE,UAAU;AACzF,aAAO,OAAO,UAAU;AAAA,IACpC;AACQ,WAAO;AAAA,EACf;AAAA,EACI,gBAAgB;AACZ,WAAO;AAAA,MACH,OAAO,uBAAuB,MAAM,uBAAuB,GAAG;AAAA,MAC9D,YAAY,uBAAuB,MAAM,uBAAuB,GAAG;AAAA,IACtE;AAAA,EACT;AACA;AACA,wBAAwB,oBAAI,QAAO,GAAI,wBAAwB,oBAAI,WAAW,yBAAyB,oBAAI,QAAS;AC/EpH,MAAA,OAAe,IAAI,KAAKC,KAAa,EAAE,QAAS;ACIzC,SAAS,mBACd,YACA;AACA,QAAM,SAA4B,CAAC;AAC7B,QAAA,SAAS,OAAO,KAAK,UAAU;AAErC,aAAW,SAAS,QAAQ;AACpB,UAAA,MAAM,WAAW,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE9D,QAAI,UAAU;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,gBAAU,UAAU,IAAI,IAAI,CAAC,EAAE;AAC/B,UAAI,IAAI,CAAC,EAAE,UAAU,SAAS;AAC5B,eAAO,KAAK;AAAA,UACV,SAAS,2BAA2B,IAAI,CAAC,EAAE,KAAK,gBAAgB,CAAC;AAAA,UACjE,SAAS;AAAA,YACP,UAAU;AAAA,YACV,WAAW,IAAI,CAAC;AAAA,YAChB,OAAO,IAAI,CAAC,EAAE;AAAA,UAAA;AAAA,QAChB,CACD;AAAA,MAAA;AAAA,IACH;AAAA,EACF;AAGK,SAAA;AACT;ACrBY,IAAA,uCAAAC,wBAAL;AACLA,sBAAA,kBAAmB,IAAA;AADTA,SAAAA;AAAA,GAAA,sBAAA,CAAA,CAAA;AAIA,IAAA,0CAAAC,2BAAL;AACLA,yBAAA,kBAAmB,IAAA;AACnBA,yBAAA,eAAgB,IAAA;AAFNA,SAAAA;AAAA,GAAA,yBAAA,CAAA,CAAA;AAkBL,SAAS,gCACd,kBACkB;AAClB,QAAM,SAA2B,CAAC;AAclC,MAAI,eAAe;AACnB,aAAW,iBAAiB,kBAAkB;AACtC,UAAA,YAAY,cAAc,QAAQ,cAAc;AAElD,QAAA,cAAc,eAAe,GAAG;AAClC,aAAO,KAAK;AAAA,QACV,WAAW;AAAA,UACT,OAAO,cAAc;AAAA,UACrB,MAAM,cAAc;AAAA,QACtB;AAAA,QACA,OAAO;AAAA,QACP,UACE,YAAY,eAAe,IACvB,kBACA;AAAA,QACN,SAAS,kBAAkB,eAAe,CAAC,yCAAyC,cAAc,KAAK,cAAc,cAAc,IAAI;AAAA,MAAA,CACxI;AAAA,IAAA;AAGH,mBAAe,cAAc;AAAA,EAAA;AAGxB,SAAA;AACT;AAiBO,SAAS,eACd,kBACK;;AACL,QAAM,SAAc,CAAC;AAEjB,MAAA,IAAI,iBAAiB,SAAS;AAElC,SAAO,IAAI,IAAI;AACN,WAAA,QAAQ,iBAAiB,CAAC,CAAC;AAC5B,UAAA,eACH,sBAAiB,CAAC,MAAlB,mBAAqB,UAAS,QAAM,sBAAiB,CAAC,MAAlB,mBAAqB,SAAQ,KAAK;AAEzE,QAAI,IAAI,IAAI;AACZ,WAAO,IAAI,SAAO,sBAAiB,CAAC,MAAlB,mBAAqB,UAAS,KAAK,WAAW;AAC9D;AAAA,IAAA;AAGE,QAAA;AAAA,EAAA;AAGC,SAAA;AACT;AAEO,SAAS,QAAQ,kBAA4C;AAC5D,QAAA,iBAAiB,CAAC,GAAG,gBAAgB;AAC3C,QAAM,kBAAkB,eAAe,eAAe,SAAS,CAAC;AAE5D,MAAA,CAAC,gBAAwB,QAAA;AAEzB,MAAA,gBAAgB,SAAS,QAAQ;AACnC,mBAAe,KAAK;AAAA,MAClB,GAAG;AAAA,MACH,OAAO,gBAAgB;AAAA,MACvB,MAAM;AAAA,MACN,MAAM,eAAe,gBAAgB;AAAA,IAAA,CACtC;AAAA,EAAA,OACI;AACL,mBAAe,KAAK;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,gBAAgB,QAAQ;AAAA,MAC/B,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,OAAO,CAAC;AAAA,MACR,MAAM;AAAA,MACN,OAAO,gBAAgB;AAAA,MACvB,MAAM,gBAAgB;AAAA,IAAA,CACvB;AAAA,EAAA;AAGI,SAAA;AACT;AAIO,SAASC,iBAAyC,YAAsB;AAC7E,SAAO,WACJ,MAAM,EACN,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI,EAC9B,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACrC;AAOO,MAAM,uBAAkC,CAAC,YAAY,MAAM,SAAS;AACzE,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI,EACrB;AAAA,IACC,CAAC,GAAG,MACF,IAAI,KAAK,EAAE,SAAS,EAAE,QAAA,IAAY,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ;AAAA,EAAA,EAEnE,IAAI,CAAC,IAAI,OAAO;AAAA,IACf,GAAG;AAAA,IACH,OAAO,WAAW,QAAQ;AAAA,IAC1B,MAAM,MAAM,IAAI,WAAW,OAAO;AAAA,EAAA,EAClC;AACN;AAEO,MAAM,+BAA0C,CACrD,YACA,MACA,SACG;AACH,SAAO,CAAC,GAAG,MAAM,GAAG,IAAI,EACrB;AAAA,IACC,CAAC,GAAG,MACF,IAAI,KAAK,EAAE,SAAS,EAAE,QAAA,IAAY,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ;AAAA,EAEnE,EAAA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,IAAI,CAAC,IAAI,OAAO;AAAA,IACf,GAAG;AAAA,IACH,OAAO,WAAW,QAAQ;AAAA,IAC1B,MAAM,MAAM,IAAI,WAAW,OAAO;AAAA,EAAA,EAClC;AACN;AAGgB,SAAA,mBAAmB,KAAgB,KAAgB;AACjE,SAAOP,UAAU,GAAG,MAAMA,UAAU,GAAG;AACzC;AAUgB,SAAA,aACd,OACA,WAC4B;AAC5B,QAAM,YAAY,eAAeO,iBAAe,MAAM,MAAO,CAAA,CAAC;AAC9D,QAAM,gBAAgB,eAAeA,iBAAe,UAAU,MAAO,CAAA,CAAC;AAClE,MAAA,UAAU,SAAS,GAAG;AACjB,WAAA,CAAC,eAAe,EAAE;AAAA,EAAA;AAG3B,QAAM,SAAsB,CAAC;AAC7B,MAAI,gBAAgB;AAEb,SAAA,cAAc,SAAS,GAAG;AACzB,UAAA,wBAAwB,cAAc,CAAC;AAEzC,QAAA,qBAAqB,UAAU,MAAM;AACzC,WACE,sBACA,SAAS,oBAAoB,qBAAqB,GAClD;AACA,aAAO,KAAK,kBAAkB;AAC9B,2BAAqB,UAAU,MAAM;AAAA,IAAA;AAGvC,QAAI,CAAC,oBAAoB;AACP,sBAAA;AAAA,IAAA,WACP,CAAC,eAAe;AACrB,UAAA,mBAAmB,oBAAoB,qBAAqB,GAAG;AACjE,sBAAc,MAAM;AACpB,eAAO,KAAK,kBAAkB;AAAA,MAAA,OACzB;AACL,kBAAU,QAAQ,kBAAkB;AACpB,wBAAA;AAAA,MAAA;AAAA,IAClB;AAGF,QAAI,eAAe;AACb,UAAA,aAAa,cAAc,MAAM;AACrC,aAAO,YAAY;AACjB,eAAO,KAAK,UAAU;AACtB,qBAAa,cAAc,MAAM;AAAA,MAAA;AAAA,IACnC;AAAA,EACF;AAGF,MAAI,CAAC,eAAe;AACd,QAAA,aAAa,UAAU,MAAM;AACjC,WAAO,YAAY;AACjB,aAAO,KAAK,UAAU;AACtB,mBAAa,UAAU,MAAM;AAAA,IAAA;AAAA,EAC/B;AAGF,SAAO,CAAC,eAAe,MAAM,GAAG,SAAS;AAC3C;AAEgB,SAAA,SAAS,KAAgB,KAAgB;AACvD,SACE,IAAI,QAAQ,IAAI,SACf,IAAI,UAAU,IAAI,SAAS,IAAI,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI;AAEpE;AAEgB,SAAA,MACd,wBACA,uBACyC;AACzC,QAAM,mBAAgC,CAAC;AACvC,QAAM,uBAAoC,CAAC;AAC3C,QAAM,sBAAmC,CAAC;AAG1C,QAAM,YAAY,KAAK;AAAA,IACrB,uBAAuB;AAAA,IACvB,sBAAsB;AAAA,EACxB;AAEA,MAAI,gBAAgB;AACpB,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAC5B,UAAA,kBAAkB,uBAAuB,CAAC;AAC1C,UAAA,iBAAiB,sBAAsB,CAAC;AAE9C,QAAI,mBAAmB,gBAAgB;AACrC,UACE,CAAC,iBACD,mBAAmB,iBAAiB,cAAc,GAClD;AACA,yBAAiB,KAAK,eAAe;AAAA,MAAA,OAChC;AACW,wBAAA;AAChB,6BAAqB,KAAK,eAAe;AACzC,4BAAoB,KAAK,cAAc;AAAA,MAAA;AAAA,eAEhC,iBAAiB;AAC1B,2BAAqB,KAAK,eAAe;AAAA,eAChC,gBAAgB;AACzB,0BAAoB,KAAK,cAAc;AAAA,IAAA;AAAA,EACzC;AAGK,SAAA,CAAC,kBAAkB,sBAAsB,mBAAmB;AACrE;AAOgB,SAAA,MACd,wBACA,uBACA,WACa;AACb,QAAM,CAAC,mBAAmB,mBAAmB,gBAAgB,IAAI;AAAA,IAC/D,eAAe,sBAAsB;AAAA,IACrC,eAAe,qBAAqB;AAAA,EACtC;AAEM,QAAA,iBAAiB,YAAY,iBAAiB;AAC9C,QAAA,YACJ,IACA,KAAK;AAAA,IACH;AAAA,IACA,YAAY,iBAAiB;AAAA,IAC7B,YAAY,gBAAgB;AAAA,EAC9B;AAEF,QAAM,0BAA0B;AAAA,IAC9B;AAAA,IACA;AAAA,EACF;AAEA,QAAM,sBAAsB;AAAA,IAC1B;AAAA,MACE,OAAO;AAAA,MACP,MAAM,aAAa,iBAAiB;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEO,SAAA,kBAAkB,OAAO,mBAAmB;AACrD;AAEA,SAAS,YAAY,kBAA+B;AAClD,QAAM,cAAc,iBAAiB,iBAAiB,SAAS,CAAC;AAChE,MAAI,CAAC,aAAa;AACT,WAAA;AAAA,EAAA;AAGT,SAAO,YAAY;AACrB;AAiBO,SAAS,eACd,kBACQ;;AACJ,MAAA,iBAAiB,SAAS,GAAG;AACxB,WAAA;AAAA,EAAA;AAGH,QAAA,oBAAoB,eAAe,gBAAgB;AAEzD,MAAI,cACD,uBAAkB,kBAAkB,SAAS,CAAC,MAA9C,mBAAiD,SAAQ,KAAK;AAE7D,MAAA,kBAAkB,SAAS,GAAG;AAChC,kBAAY,uBAAkB,kBAAkB,SAAS,CAAC,MAA9C,mBAAiD,SAAQ;AAAA,EAAA;AAG/D,YAAA,uBAAkB,kBAAkB,SAAS,CAAC,MAA9C,mBAAiD,UAAS,MAChE,WACE,KACA;AACN;AAEa,MAAA,2BAA2B,CACtC,eACqB;AACd,SAAA;AAAA,IACL,eAAeA,iBAAe,UAAU,CAAC;AAAA,EAC3C;AACF;AAIa,MAAA,yBAAyB,CACpC,eACsB;AACtB,QAAM,SAAS,WAAW,OAA0B,CAAC,KAAK,cAAc;;AACtE,QAAI,CAAC,IAAI,UAAU,KAAK,GAAG;AACrB,UAAA,UAAU,KAAK,IAAI,CAAC;AAAA,IAAA;AAG1B,cAAI,UAAU,KAAK,MAAnB,mBAAsB,KAAK;AAEpB,WAAA;AAAA,EACT,GAAG,EAAE;AAEE,SAAA;AACT;AASa,MAAA,oBAAoB,CAC/B,mBACA,kBAC4B;;AAC5B,QAAM,SAAkC;AAAA,IACtC,iBAAiB,CAAC;AAAA,IAClB,iBAAiB,CAAC;AAAA,IAClB,mBAAmB,CAAC;AAAA,IACpB,sBAAsB,CAAA;AAAA,EACxB;AAEM,QAAA,0BAA0BA,iBAAe,iBAAiB;AAC1D,QAAA,mBAAmBA,iBAAe,aAAa;AAErD,QAAM,kBAAkB,gCAAgC;AAAA,IACtD,GAAG;AAAA,IACH,GAAG;AAAA,EAAA,CACJ;AAED,QAAM,qBAAqB,gBAAgB;AAAA,IACzC,CAAC,mBACC,eAAe,aAAa;AAAA;AAAA,EAChC;AAGA,QAAM,8BAA6B,MAAC,GAAG,kBAAkB,EACtD,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,QAAQ,EAAE,UAAU,KAAK,EACpD,UAFgC,mBAEzB;AAEV,aAAW,gBAAgB,kBAAkB;AAE3C,QACE,8BACA,aAAa,SAAS,2BAA2B,OACjD;AACO,aAAA,kBAAkB,KAAK,YAAY;AAC1C;AAAA,IAAA;AAIF,UAAM,wBAAwB,gBAAgB,KAAK,CAAC,mBAAmB;AAEnE,aAAA,eAAe,UAAU,UAAU,aAAa,SAChD,eAAe,UAAU,SAAS,aAAa,QAC/C,eAAe,aAAa;AAAA,IAAA,CAE/B;AAGD,QAAI,uBAAuB;AAClB,aAAA,qBAAqB,KAAK,YAAY;AAC7C;AAAA,IAAA;AAIK,WAAA,gBAAgB,KAAK,YAAY;AAAA,EAAA;AAGnC,SAAA,gBAAgB,KAAK,GAAG,eAAe;AACvC,SAAA;AACT;AAEgB,SAAA,yBACd,eACA,mBACa;AACN,SAAA,cAAc,OAAO,CAAC,iBAAiB;AAC5C,WAAO,CAAC,kBAAkB,KAAK,CAAC,qBAAqB;AACnD,aACG,aAAa,SAAS,UACrB,aAAa,SAAS,KACtB,aAAa,UAAU,iBAAiB,SACzC,aAAa,UAAU,iBAAiB,SACvC,aAAa,SAAS,iBAAiB,QACvC,aAAa,UAAU,iBAAiB,SACxC,aAAa,SAAS,iBAAiB,QACvC,aAAa,SAAS,iBAAiB;AAAA,IAAA,CAE5C;AAAA,EAAA,CACF;AACH;AAYgB,SAAA,qBACd,YACA,qBACK;AACL,QAAM,CAAC,aAAa,IAAIA,iBAAe,UAAU,EAAE,MAAM,EAAE;AAErD,QAAA,aAAY,+CAAe,UAAS;AAC1C,QAAM,YAAY,YAAY;AAE9B,QAAM,qBAAqB;AAAA,IACzB,GAAG;AAAA,IACH,OAAO,oBAAoB,SAAS;AAAA,EACtC;AAEI,MAAA,mBAAmB,QAAQ,WAAW;AACxC,UAAM,IAAI;AAAA,MACR,oEAAoE,SAAS;AAAA,IAC/E;AAAA,EAAA;AAGF,QAAM,oBAAoB;AAAA,IACxBA,iBAAe,CAAC,GAAG,YAAY,kBAAkB,CAAC;AAAA,EACpD;AAGA,UAAQ,qBAAqB,CAAI,GAAA,MAAM,GAAG,EAAE;AAC9C;AAEO,SAAS,iCACd,oBACuB;AACvB,QAAM,oBAAoB,OAAO,QAAQ,kBAAkB,EAAE;AAAA,IAC3D,CAAC,KAAK,UAAU;AACR,YAAA,CAAC,OAAO,GAAG,IAAI;AAEd,aAAA;AAAA,QACL,GAAG;AAAA,QACH,CAAC,KAAuB,GAAG,eAAeA,iBAAe,GAAG,CAAC;AAAA,MAC/D;AAAA,IACF;AAAA,IACA,CAAA;AAAA,EACF;AAEO,SAAA;AAAA,IACL,GAAG;AAAA,EACL;AACF;AAUgB,SAAA,2BACd,kBACA,kBACa;AACN,SAAA,iBAAiB,OAAO,CAAC,OAAO;AACrC,QAAI,GAAG,IAAI;AACF,aAAA,CAAC,iBAAiB,KAAK,CAAC,aAAa,SAAS,OAAO,GAAG,EAAE;AAAA,IAAA;AAG5D,WAAA;AAAA,EAAA,CACR;AACH;AAEO,SAAS,uCACd,oBACA;AACA,MAAI,CAAC,oBAAoB;AACvB,WAAO,CAAC;AAAA,EAAA;AAGJ,QAAA,UAAU,OAAO,QAAQ,kBAAkB;AAEjD,SAAO,QAAQ;AAAA,IACb,CAAC,KAAK,CAAC,OAAO,UAAU,OAAO;AAAA,MAC7B,GAAG;AAAA,MACH,CAAC,KAAK,GAAG,WAAW,IAAI,CAAC,OAAO;AAC9B,cAAM,EAAE,gBAAgB,GAAG,UAAA,IAAc;AAElC,eAAA;AAAA,MACR,CAAA;AAAA,IAAA;AAAA,IAEH,CAAA;AAAA,EACF;AACF;AAWgB,SAAA,eACd,oBACA,oBACK;AACL,SAAO,mBAAmB;AAAA,IACxB,CAAC,eACC,CAAC,mBAAmB;AAAA,MAClB,CAAC,eAAe,WAAW,UAAU,WAAW;AAAA,IAAA;AAAA,EAEtD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AC7lBa,MAAA,YAAY,OAAO,aAAuB;AAE/C,QAAA,MAAM,IAAI,MAAM;AAEtB,QAAM,EAAE,MAAM,UAAU,cAAc,SAAS,iBAAiB;AAChE,QAAM,SAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,KAAK,eAAe,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AACnD,MAAA,KAAK,cAAc,KAAK,UAAU,SAAS,gBAAgB,CAAC,GAAG,MAAM,CAAC,CAAC;AACvE,MAAA,KAAK,sBAAsB,KAAK,UAAU,SAAS,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC;AACxE,MAAA;AAAA,IACF;AAAA,IACA,KAAK;AAAA,MACH,uCAAuC,SAAS,UAAU;AAAA,MAC1D;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAEA,MAAI,SAAS,aAAa;AACxB,UAAM,cAAc,OAAO,KAAK,SAAS,WAAW;AACxC,gBAAA,QAAQ,CAAC,QAAQ;AAC3B,YAAM,EAAE,MAAM,GAAG,WAAe,IAAA,SAAS,YAAY,GAAG;AACpD,UAAA,KAAK,KAAK,MAAM;AAAA,QAClB,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,SAAS,KAAK,UAAU,UAAU;AAAA,MAAA,CACnC;AAAA,IAAA,CACF;AAAA,EAAA;AAGI,SAAA;AACT;AAcO,MAAM,aAAa,OACxB,UACA,MACA,WACA,SACoB;AAEd,QAAA,MAAM,MAAM,UAAU,QAAQ;AACvB,QAAM,IAAI,cAAc;AAAA,IACnC,MAAM;AAAA,IACN,aAAa;AAAA,EACd,CAAA;AACK,QAAA,WAAW,QAAQ,SAAS;AAC5B,QAAA,gBAAgB,IAAI,SAAS;AAE5B,SAAA;AAAA,IACL;AAAA,IACA,SAAS,SAAS,aAAa,IAAI,WAAW,GAAG,QAAQ,GAAG,aAAa;AAAA,EAE3E;AACF;AAEa,MAAA,mBAAmB,OAC9B,UACA,UACG;AACG,QAAA,MAAM,MAAM,UAAU,QAAQ;AACpC,QAAM,OAAO,MAAM,IAAI,cAAc,EAAE,MAAM,QAAQ;AAC/C,QAAA,WAAW,MAAM,MAAM,eAAe;AACtC,QAAA,SAAS,MAAM,IAAI;AACzB,QAAM,SAAS,MAAM;AACvB;AAiBO,MAAM,eAAe,OAC1B,MACA,SACA,YACG;AACG,QAAA,OAAO,SAAa;AACnB,SAAA,cAAc,MAAM,SAAS,OAAO;AAC7C;AAEO,MAAM,gBAAgB,OAC3B,OACA,SACA,YACG;AACG,QAAA,MAAM,IAAI,MAAM;AAChB,QAAA,IAAI,UAAU,KAAK;AAClB,SAAA,YAAY,KAAK,SAAS,OAAO;AAC1C;AAEA,eAAe,YACb,KACA,SACA,SACA;AACM,QAAA,kBAAkB,IAAI,KAAK,YAAY;AAC7C,MAAI,CAAC,iBAAiB;AACd,UAAA,IAAI,MAAM,yBAAyB;AAAA,EAAA;AAE3C,QAAM,kBAAkB,MAAM,gBAAgB,MAAM,QAAQ;AACtD,QAAA,eAAe,KAAK,MAAM,eAAe;AAEzC,QAAA,YAAY,IAAI,KAAK,aAAa;AACxC,MAAI,SAAqC;AACzC,MAAI,WAAW;AACb,aAAS,KAAK,MAAM,MAAM,UAAU,MAAM,QAAQ,CAAC;AAAA,EAAA;AAG/C,QAAA,gBAAgB,IAAI,KAAK,iBAAiB;AAChD,MAAI,CAAC,eAAe;AACZ,UAAA,IAAI,MAAM,8BAA8B;AAAA,EAAA;AAGhD,QAAM,aAAa,KAAK;AAAA,IACtB,MAAM,cAAc,MAAM,QAAQ;AAAA,EACpC;AAEM,QAAA,oBAAoB,iCAAiC,UAAU;AAE/D,QAAA,kBAAkB,mBAAmB,iBAAiB;AAC5D,MAAI,gBAAgB,QAAQ;AAC1B,UAAM,gBAAgB,gBAAgB,IAAI,CAAC,QAAQ,IAAI,OAAO;AAC9D,UAAM,IAAI,MAAM,cAAc,KAAK,IAAI,CAAC;AAAA,EAAA;AAG1C,MAAI,SAAS;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,CAAC;AAAA,IACD;AAAA,EACF;AACA,MAAI,QAAQ;AACD,aAAA;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,EAAA;AAEK,SAAA;AACT;AAEA,SAAS,kBACP,MACuC;AACvC,QAAM,YAAY,KAAK,QAAQ,SAAS,EAAE,KAAK;AAC/C,QAAM,WAAW,KAAK,QAAQ,YAAY,EAAE,KAAK;AAC1C,SAAA,EAAE,WAAW,SAAS;AAC/B;AAOA,eAAsB,cAAc,KAAuC;AACzE,QAAM,EAAE,QAAQ,WAAW,+BACzB,MAAM,UAAa;AACf,QAAA,aAAa,kBAAkB,GAAG;AAClC,QAAA,OAAO,OAAO,SAAS,QAAQ;AAC9B,SAAA;AAAA,IACL;AAAA,IACA,MAAM,KAAK,IAAI;AAAA,IACf;AAAA,IACA,GAAG;AAAA,EACL;AACF;AAOA,eAAsB,aAAa,MAAwC;AACnE,QAAA,SAAS,MAAM,QAAY;AACjC,QAAM,WAAW,KAAK,QAAQ,IAAI,KAAK;AACjC,QAAA,aAAa,kBAAkB,IAAI;AACnC,QAAA,OAAO,OAAO,SAAS,QAAQ;AAC9B,SAAA,EAAE,MAAM,MAAM,KAAK,IAAI,GAAG,UAAU,GAAG,WAAW;AAC3D;ACrNgB,SAAA,iBAAoB,UAAa,MAAiB;AACzD,SAAA,EAAE,GAAG,UAAU,KAAK;AAC7B;AAmCgB,SAAA,cACd,UACA,QACA,MACgC;AAE1B,QAAA,EAAE,OAAO,MAAA,IAAU;AAEzB,QAAM,gBAAgD;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,IACA,yBAAyB;AAAA,EAC3B;AAEO,SAAA,OAAO,eAAe,CAAC,UAAU;AACtC,UAAM,aAAa,CAAC,GAAG,SAAS,WAAW,KAAK,CAAC;AAC3C,UAAA,mBAAmBC,iBAA+B,UAAU;AAE5D,UAAA,SAAS,KAAK,KAAK;AAEnB,UAAA,gBAAgB,iBAAiB,GAAG,EAAE;AACxC,QAAA,aAAY,+CAAe,UAAS;AAElC,UAAA,aAAY,+CAAe,UAAS;AAE1C,QAAI,WAAW;AACb,kBAAY,YAAY;AAAA,IAAA,OACnB;AACL,YAAM,0BAA0B;AAAA,IAAA;AAG5B,UAAA,uBAAuB,YACzB,CAAC,GAAG,kBAAkB,EAAE,OAAO,WAAW,MAAM,EAAG,CAAA,IACnD;AAEE,UAAA,OAAOC,eAA+B,oBAAoB;AAEhE,QAAI,iBAAiB,MAAM,OAAO,cAAc,OAAO,GAAG;AAGlD,YAAA,OAAO,MAAM,OAAO;AAAA,IAAA;AAGxB,QAAA,MAAM,OAAO,GAAG;AAClB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IAAA;AAAA,EACF,CACD;AACH;AAEgB,SAAA,cACd,UACA,QACA,MACgC;AAC1B,QAAA,EAAE,OAAO,MAAA,IAAU;AAEzB,QAAM,gBAAgD;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,IACA,yBAAyB;AAAA,EAC3B;AAEO,SAAA,OAAO,eAAe,CAAC,UAAU;AAClC,QAAA,MAAM,OAAO,GAAG;AAClB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IAAA;AAGF,QAAI,QAAQ,GAAG;AACP,YAAA,IAAI,MAAM,wDAAwD;AAAA,IAAA;AAG1E,QAAI,QAAQ,GAAG;AACP,YAAA,IAAI,MAAM,+CAA+C;AAAA,IAAA;AAGjE,QAAI,MAAM,SAAS,UAAU,SAAS,GAAG;AACjC,YAAA,IAAI,MAAM,6CAA6C;AAAA,IAAA;AAGzD,UAAA,iBAAiB,MAAM,SAAS,UAAU;AAAA,MAC9C,CAAC,OAAO,GAAG,UAAU;AAAA,IACvB;AACA,QAAI,iBAAiB,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,sDAAsD,KAAK;AAAA,MAC7D;AAAA,IAAA;AAGI,UAAA,YAAY,MAAM,SAAS,UAAU,OAAO,gBAAgB,CAAC,EAAE,CAAC;AAEtE,UAAM,SAAS,UAAU;AAAA,MACvB,MAAM,UAAU;AAAA,MAChB,OAAO,UAAU;AAAA,MACjB,OAAO,UAAU;AAAA,IAAA,CACb;AAAA,EAAA,CACP;AACH;AAEgB,SAAA,eACd,UACA,QACA,gBACmB;AACb,QAAA,EAAE,UAAU;AACZ,QAAA,aAAa,SAAS,WAAW,KAAK;AAExC,MAAA;AAAA,IACF,OAAO,EAAE,OAAO,IAAI;AAAA,EAAA,IAClB;AACJ,UAAQ,SAAS;AACjB,QAAM,OAAO,WAAW;AAExB,QAAM,iBAAiB,WAAW,MAAM,OAAO,GAAG;AAClD,QAAM,qBAAqB,WAAW,MAAM,GAAG,KAAK;AAC9C,QAAA,mBAAmB,WAAW,MAAM,GAAG;AAI7C,QAAM,cAAc;AAAA,IAClB,SAAS;AAAA,IACT;AAAA,MACE,GAAG,SAAS;AAAA,MACZ,CAAC,KAAK,GAAG,mBAAmB,OAAO,cAAc;AAAA,IACnD;AAAA,IACA;AAAA,EACF;AAEA,QAAM,EAAE,MAAM,OAAO,SAAa,IAAA;AAGlC,QAAM,iBAAiB,mBAAmB;AAI1C,QAAM,qBAAqB,mBAAmB,SAC1C,mBAAmB,mBAAmB,SAAS,CAAC,EAAE,YAClD,iBAAiB,SACf,iBAAiB,CAAC,EAAE,aAChB,oBAAA,QAAO,YAAY;AAGtB,SAAA;AAAA,IACL,SAAS;AAAA,IACT;AAAA,MACE,GAAG,SAAS;AAAA,MACZ,CAAC,KAAK,GAAG;AAAA,QACP,GAAG;AAAA,QACH;AAAA,UACE,GAAG,UAAU,EAAE,MAAM,OAAO,SAAS,GAAG,eAAe,MAAM;AAAA,UAC7D,WAAW;AAAA,UACX,OAAO;AAAA,UACP,MAAM,aAAa,EAAE,OAAO,YAAY,QAAQ;AAAA,QAClD;AAAA,QACA,GAAG,iBAEA,IAAI,CAACC,SAAQ,WAAW;AAAA,UACvB,GAAGA;AAAAA,UACH,OAAO,iBAAiB,QAAQ;AAAA,QAAA,EAChC;AAAA,MAAA;AAAA,IAER;AAAA,IACA;AAAA,EACF;AACF;AAEgB,SAAA,mBACd,aACA,aACmB;AACZ,SAAA;AAAA,IACL,GAAG;AAAA,IACH,MAAM,YAAY;AAAA,IAClB,OAAO,YAAY,SAAU,EAAE,QAAQ,CAAA,GAAI,OAAO,CAAG,EAAA;AAAA,EACvD;AACF;ACjOO,MAAM,WAAW;AACjB,MAAM,OAAO;AACb,MAAM,OAAO;AACb,MAAM,QAAQ;AACd,MAAM,aAAa;AACnB,MAAM,OAAO;ACgCpB,SAAS,gBACP,UACA,QACQ;AACJ,MAAA;AAEJ,MAAI,WAAW,QAAQ;AACH,sBAAA,EAAE,GAAG,OAAO;AAAA,EAAA,OACzB;AACL,sBAAkB,SAAS,WAAW,OAAO,KAAK,EAAE,GAAG,EAAE;AAAA,EAAA;AAGnD,WAAA,mDAAiB,UAAS,MAAM;AAC1C;AAUgB,SAAA,aACd,UACA,QACG;AACI,SAAA;AAAA,IACL,GAAG;AAAA,IACH,UAAU;AAAA,MACR,GAAG,SAAS;AAAA,MACZ,CAAC,OAAO,KAAK,GAAG,gBAAgB,UAAU,MAAM;AAAA,IAClD;AAAA,IACA,cAAc,wBAAwB,QAAQ;AAAA,EAChD;AACF;AAWA,SAAS,iBACP,UACA,QACA,OAAO,GACP,0BAA0B,OACvB;AAGC,MAAA,CAAC,MAAM,MAAM,KAAK,EAAE,SAAS,OAAO,IAAI,GAAG;AACtC,WAAA;AAAA,EAAA;AAGH,QAAA,EAAE,UAAU;AAClB,QAAM,aAAa,SAAS,WAAW,KAAK,EAAE,MAAM;AAChD,MAAA;AAEE,QAAA,kBAAkB,WAAW,GAAG,EAAE;AAClC,QAAA,sBAAqB,mDAAiB,UAAS;AAEjD,MAAA,YAAY,0BACZ,qBACA,qBAAqB;AAEzB,MAAI,aAAY,oBAAI,KAAK,GAAE,YAAY;AAEvC,MAAI,WAAW,QAAQ;AACjB,QAAA,OAAO,QAAQ,OAAO,WAAW;AACnC,YAAM,IAAI;AAAA,QACR,gCAAgC,SAAS,yCAAyC,OAAO,KAAK,cAAc,IAAI;AAAA,MAClH;AAAA,IAAA;AAGF,gBAAY,OAAO;AACnB,kBAAc,OAAO;AAErB,gBAAY,OAAO;AAAA,EAAA,OACd;AACL,kBAAc,QAAQ,SAAU,OAAO,KAAgBC,GAAK;AAAA,EAAA;AAG9D,aAAW,KAAK;AAAA,IACd,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,OAAO;AAAA,IACP;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,OAAO;AAAA,EAAA,CACR;AAIM,SAAA;AAAA,IACL,GAAG;AAAA,IACH,YAAY,EAAE,GAAG,SAAS,YAAY,CAAC,KAAK,GAAG,WAAW;AAAA,EAC5D;AACF;AAWO,SAAS,eACd,UACA,QACA,OAAO,GACP,0BAA0B,OAC1B;AACA,MAAI,cAAc;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACc,gBAAA,aAAa,aAAa,MAAM;AACvC,SAAA;AACT;AAUA,SAAS,aACP,UACA,QACA,gBACmB;AAEjBC,mBAAmB,EAAA,MAAM,MAAM;AAEjC,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACI,aAAA,iBAAiB,UAAU,OAAO,KAAK;AAAA,IAChD,KAAK;AACI,aAAA,eAAe,UAAU,QAAQ,cAAc;AAAA,IACxD,KAAK;AACH,aAAO,mBAAmB,UAAU,OAAO,MAAM,KAAK;AAAA,IACxD;AACS,aAAA;AAAA,EAAA;AAEb;AAiBgB,SAAA,gBACd,UACA,QACA,MACgC;AAChC,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACI,aAAA,cAAc,UAAU,QAAQ,IAAI;AAAA,IAC7C,KAAK;AACI,aAAA,cAAc,UAAU,QAAQ,IAAI;AAAA,IAC7C;AACE,aAAO,EAAE,UAAU,QAAQ,MAAM,yBAAyB,MAAM;AAAA,EAAA;AAEtE;AAcA,SAAS,qBAMP,UACA,QACA,eACA,WACA,+BAA+B,OAC/B,uBAAuB,qBACpB;AACH,QAAM,QAAQ,OAAO;AAErB,QAAM,kBAAkB,SAAS,WAAW,KAAK,EAAE,GAAG,EAAE;AAEpD,MAAA,CAAC,gBAAwB,QAAA;AAEvB,QAAA,qBAAqBC,iCAAiD;AAAA,IAC1E,GAAG,SAAS;AAAA,IACZ,CAAC,KAAK,GAAGC;AAAAA,MACP,SAAS,WAAW,KAAK;AAAA,MACzB;AAAA,IAAA;AAAA,EACF,CACD;AAED,MAAI,aAAgC;AACpC,QAAM,yBAAyB,mBAAmB,KAAK,EAAE,GAAG,EAAE;AAK1D,MAAA,iCAAgC,iEAAwB,iBAAgB;AAC7D,iBAAA,qBAAqB,uBAAuB,cAAc;AAAA,EAAA,OAGlE;AACC,UAAA,EAAE,UAAU;AAAA,MAChB,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,QACE,WAAW;AAAA,QACX;AAAA,QACA,+BAA+B;AAAA,MAAA;AAAA,IAEnC;AACA,iBAAa,MAAM,KAAK;AAAA,EAAA;AAGnB,SAAA;AAAA,IACL,GAAG;AAAA,IACH,OAAO;AAAA,MACL,GAAG,SAAS;AAAA,MACZ,CAAC,KAAK,GAAG;AAAA,IACX;AAAA,IACA,YAAYD,iCAAiD;AAAA,MAC3D,GAAG,SAAS;AAAA,IACb,CAAA;AAAA,EACH;AACF;AAEA,SAAS,qBAMP,UACA,OACA,eACA,+BAA+B,OAC/B,uBAAuB,qBACJ;AACnB,QAAM,aAAa,CAAC,GAAG,SAAS,WAAW,KAAK,CAAC;AAC3C,QAAA,mBAAmBL,iBAA+B,UAAU;AAElE,mBAAiB,IAAI;AAEf,QAAA,qBAAqBK,iCAAiD;AAAA,IAC1E,GAAG,SAAS;AAAA,EAAA,CACb;AAED,QAAM,oBAAoB,CAAC,GAAG,mBAAmB,KAAK,CAAC;AACvD,QAAM,OAAOE;AAAAA,IACXC,eAA+B,gBAAgB;AAAA,IAC/C;AAAA,EACF;AAEA,QAAM,MAAM;AAAA,IACV,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,MACE,WAAW;AAAA,MACX;AAAA,MACA,+BAA+B;AAAA,IAAA;AAAA,EAEnC;AAEA,QAAM,YAAYR;AAAAA,IAEd,CAAC,GAAG,SAAS,WAAW,GAAG,IAAI,EAAE,OAAO,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,IAEnE,QAAQ;AAEJ,SAAA,EAAE,GAAG,KAAK,UAAU;AAC7B;AAcO,SAAS,YACd,UACA,QACA,eACA,UACA,UAA0B,IAC1B;AACM,QAAA;AAAA,IACJ;AAAA,IACA,uBAAuB;AAAA,IACvB,YAAY;AAAA,IACZ,+BAA+B;AAAA,IAC/B;AAAA,EAAA,IACE;AAEA,MAAA,UAAU,EAAE,GAAG,OAAO;AAC1B,MAAI,YAAY,QAAQ;AACpB,MAAA,cAAiC,EAAE,GAAG,SAAS;AACnD,MAAI,0BAA0B;AAExB,QAAA,6BACJ,CAAC,yBACA,YAAY,KAAM,WAAW,WAAW,QAAQ,OAAO;AAEtD,MAAA,WAAW,OAAO,GAAG;AACjB,UAAA;AAAA,MACJ,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,yBAAyB;AAAA,IACvB,IAAA,gBAAgB,UAAU,SAAS,SAAS;AAEtC,cAAA;AACE,gBAAA;AACE,kBAAA;AACY,8BAAA;AAAA,EAAA,OACrB;AACS,kBAAA;AAAA,MACZ,GAAG;AAAA,MACH,WAAW,CAAA;AAAA,IACb;AAAA,EAAA;AAKE,MAAA,aAAa,OAAO,GAAG;AACX,kBAAA,aAAa,aAAa,SAAS,aAAa;AAAA,EAAA;AAKlD,gBAAA;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEM,QAAA,eAAe,OAAO,MAAM;AAElC,MAAI,cAAc;AAChB,UAAM,SAAS;AAAA,MACb;AAAA,MACA,OAAO;AAAA,MACP;AAAA,IACF;AAEO,WAAA;AAAA,EAAA;AAGT,MAAI,4BAA4B;AAChB,kBAAA;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EAAA;AAMY,gBAAA,OAAO,aAAa,CAAC,UAAU;AAGvC,QAAA;AACF,YAAM,WAAW,cAAc,MAAM,OAAO,SAAc,QAAQ;AAMlE,UAAI,UAAU;AAEZ,eAAO,MAAM;AAEL,gBAAA,QAAQ,UAAU,QAAQ;AAAA,QAAA,CAEjC;AAAA,MAAA,OACI;AAAA,MAAA;AAAA,aAKA,OAAO;AAGd,YAAM,qBACJ,YAAY,WAAW,QAAQ,KAAK,EAAE,SAAS;AACjD,YAAM,WAAW,QAAQ,KAAK,EAAE,kBAAkB,EAAE,QAClD,MACA;AAEF,YAAM,WAAW,QAAQ,KAAK,EAAE,kBAAkB,EAAE,OAAO;AAE3D,UAAI,4BAA4B;AAC9B,cAAM,QAAQ,UAAuB,EAAE,GAAG,SAAS,OAAO;AAC1D,cAAM,aAAa,UAAU;AAAA,UAC3B,GAAG,SAAS;AAAA,UACZ,CAAC,QAAQ,KAAK,GAAG;AAAA,YACf,GAAG,SAAS,WAAW,QAAQ,KAAK;AAAA,YACpC;AAAA,cACE,GAAG,MAAM,WAAW,QAAQ,KAAK,EAAE,kBAAkB;AAAA,YAAA;AAAA,UACvD;AAAA,QACF,CACD;AAAA,MAAA;AAAA,IACH;AAAA,EACF,CACD;AAGG,MAAA,CAAC,MAAM,MAAM,KAAK,EAAE,SAAS,QAAQ,IAAI,GAAG;AACvC,WAAA;AAAA,EAAA;AAKH,QAAA,QAAQ,QAAQ,SAAS;AAC/B,QAAMP,QACJ,aAAa,OAAO,UAAU,eAAe,KAAK,SAAS,MAAM,IAC5D,QAAsB,OACvB,aAAa,aAAa,KAAK;AAGrC,QAAM,gBAAgB,YAAY,WAAW,KAAK,EAAE,GAAG,EAAE;AACzD,MAAI,eAAe;AACjB,kBAAc,OAAOA;AAErB,QAAI,8BAA8B;AAClB,oBAAA,iBAAiB,YAAY,MAAM,KAAK;AAAA,IAAA;AAIxD,QAAI,CAAC,aAAa,OAAO,KAAK,QAAQ,aAAa;AACzC,cAAA,YAAY,QAAQ,CAAC,eAAe;AAC1C,cAAM,EAAE,MAAAA,QAAM,GAAG,KAAS,IAAA;AACd,oBAAA,YAAYA,MAAI,IAAI;AAAA,UAC9B,GAAG;AAAA,QACL;AAAA,MAAA,CACD;AAAA,IAAA;AAAA,EACH;AAGK,SAAA;AACT;AAcO,SAAS,mBACd,UACA,QACA,eACA,UACA,UAA0B,IAC1B;AACM,QAAA;AAAA,IACJ;AAAA,IACA,uBAAuB;AAAA,IACvB,YAAY;AAAA,IACZ,+BAA+B;AAAA,IAC/B;AAAA,EAAA,IACE;AAEE,QAAA,UAAU,EAAE,GAAG,OAAO;AAC5B,QAAM,YAAY,QAAQ;AACtB,MAAA,cAAiC,EAAE,GAAG,SAAS;AAG7C,QAAA,6BACJ,CAAC,yBACA,YAAY,KAAM,WAAW,WAAW,QAAQ,OAAO;AAItD,MAAA,aAAa,OAAO,GAAG;AACX,kBAAA,aAAa,aAAa,SAAS,aAAa;AAAA,EAAA;AAKlD,gBAAA,eAAe,aAAa,SAAS,SAAS;AAE5D,MAAI,4BAA4B;AAChB,kBAAA;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EAAA;AAGE,MAAA;AACF,UAAM,WAAW;AAAA,MACf,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AACA,QAAI,UAAU;AACZ,kBAAY,QAAQ;AAAA,IAAA;AAAA,WAEf,OAAO;AAGd,UAAM,qBAAqB,YAAY,WAAW,QAAQ,KAAK,EAAE,SAAS;AAC1E,gBAAY,WAAW,QAAQ,KAAK,EAAE,kBAAkB,EAAE,QACxD,MACA;AACF,gBAAY,WAAW,QAAQ,KAAK,EAAE,kBAAkB,EAAE,OAAO;AAEjE,QAAI,4BAA4B;AAC9B,kBAAY,QAAQ,EAAE,GAAG,SAAS,MAAM;AACxC,kBAAY,aAAa;AAAA,QACvB,GAAG,SAAS;AAAA,QACZ,CAAC,QAAQ,KAAK,GAAG;AAAA,UACf,GAAG,SAAS,WAAW,QAAQ,KAAK;AAAA,UACpC;AAAA,YACE,GAAG,YAAY,WAAW,QAAQ,KAAK,EAAE,kBAAkB;AAAA,UAAA;AAAA,QAC7D;AAAA,MAEJ;AAAA,IAAA;AAAA,EACF;AAGE,MAAA,CAAC,MAAM,MAAM,KAAK,EAAE,SAAS,QAAQ,IAAI,GAAG;AACvC,WAAA;AAAA,EAAA;AAKH,QAAA,QAAQ,QAAQ,SAAS;AAC/B,QAAMA,QACJ,aAAa,OAAO,UAAU,eAAe,KAAK,SAAS,MAAM,IAC5D,QAAsB,OACvB,aAAa,aAAa,KAAK;AAGrC,QAAM,gBAAgB,YAAY,WAAW,KAAK,EAAE,GAAG,EAAE;AACzD,MAAI,eAAe;AACjB,kBAAc,OAAOA;AAErB,QAAI,8BAA8B;AAClB,oBAAA,iBAAiB,YAAY,MAAM,KAAK;AAAA,IAAA;AAIxD,QAAI,CAAC,aAAa,OAAO,KAAK,QAAQ,aAAa;AACzC,cAAA,YAAY,QAAQ,CAAC,eAAe;AAC1C,cAAM,EAAE,MAAAA,QAAM,GAAG,KAAS,IAAA;AACd,oBAAA,YAAYA,MAAI,IAAI;AAAA,UAC9B,GAAG;AAAA,QACL;AAAA,MAAA,CACD;AAAA,IAAA;AAAA,EACH;AAEK,SAAA;AACT;ACxnBO,SAAS,gBAAgB,IAAiC;AAE7D,SAAA,GAAG,SAAS,QACZ,GAAG,SAAS,UACZ,GAAG,OAAO,KACV,GAAG,SAAS;AAEhB;AAEO,SAAS,WAAW,QAA0C;AACnE,SAAO,CAAC,MAAM,IAAI,EAAE,SAAS,OAAO,IAAI;AAC1C;AAEO,SAAS,OAAO,QAAsC;AAC3D,SAAO,OAAO,SAAS;AACzB;AAEO,SAAS,aAAa,QAAsC;AAC1D,SAAA,CAAC,UAAU,MAAM,MAAM,OAAO,UAAU,EAAE,SAAS,OAAO,IAAI;AACvE;AAsBO,SAAS,aACd,MACA,OACA,aACA,WACA,QAAwB,UACrB;AACH,MAAI,CAAC,MAAM;AACH,UAAA,IAAI,MAAM,mBAAmB;AAAA,EAAA;AAGjC,MAAA,OAAO,SAAS,UAAU;AAC5B,UAAM,IAAI,MAAM,wBAAwB,KAAK,UAAU,IAAI,CAAC,EAAE;AAAA,EAAA;AAGhE,QAAM,SAAiB,EAAE,MAAM,OAAO,MAAM;AAE5C,MAAI,aAAa;AACf,WAAO,cAAc;AAAA,EAAA;AAGnB,MAAA;AACU,6CAAE,MAAM,OAAO;AAAA,WACpB,OAAO;AACd,UAAM,IAAI,MAAM,yBAAyB,KAAK,EAAE;AAAA,EAAA;AAG3C,SAAA;AACT;AAoBgB,SAAA,cAKd,SACA,kBAAkB,aACA;AAClB,SAAO,CAAC,UAAU,QAAQ,UAAU,YAAY;AAC9C,WAAO,gBAAgB,UAAU,QAAQ,SAAS,UAAU,OAAO;AAAA,EACrE;AACF;AAEgB,SAAA,oBAKd,SACA,kBAAkB,oBACA;AAClB,SAAO,CAAC,UAAU,QAAQ,UAAU,YAAY;AAC9C,WAAO,gBAAgB,UAAU,QAAQ,SAAS,UAAU,OAAO;AAAA,EACrE;AACF;AAEa,MAAA,sBAAsB,CACjC,cACA,gBACwB;AACjB,SAAA;AAAA,IACL,MAAM;AAAA,IACN,cAAc;AAAA,IACd,UAAU;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,IACT;AAAA,IACA,UAAS,oBAAI,KAAK,GAAE,YAAY;AAAA,IAChC,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrC,aAAa,CAAC;AAAA,IACd,GAAG;AAAA,IACH,QACE,2CAAc,6CAAc,aAC1B,6CAAc,UAAS,EAAE,QAAQ,IAAI,OAAO,CAAA,EAAG;AAAA,EACrD;AACF;AAaa,MAAA,iBAAiB,CAC5B,cACA,gBAGsB;AACtB,QAAM,QAA6B;AAAA,IACjC;AAAA,IACA;AAAA,EACF;AACO,SAAA;AAAA,IACL,GAAG;AAAA,IACH,cAAc;AAAA,IACd,YAAY,EAAE,QAAQ,IAAI,OAAO,CAAA,EAAG;AAAA,IACpC,WAAW,CAAA;AAAA,EACb;AACF;AAIO,MAAM,eAAe,CAC1B,UACA,QAAwB,aACrB;AACH,SAAO,KAAKE,UAAc,SAAS,MAAM,KAAK,KAAK,EAAE,CAAC;AACxD;AAEO,MAAM,UAAU,CAAC,MAAa,cAAc,QAAS;AACpD,QAAA,SAAS,KAAK,OAAA,IAAW;AACxB,SAAA,KAAK,IAAI,QAAY,oBAAA,QAAQ,YAAa,CAAA,GAAG,MAAM,EAAE;AAC9D;AAEO,SAAS,SAAY,OAAuB;AAC1C,SAAA,OAAO,OAAO,KAAK;AAC5B;AAUgB,SAAA,qBACd,YACA,uBACsB;AAChB,QAAA,MAAM,CAAC,GAAG,UAAU;AAE1B,MAAI,UAAU,yBAAyB;AACnC,MAAA,gBAAgB,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,EAAE,QAAQ;AAEjE,QAAM,qBAAqB,CAAC;AAEjB,aAAA,aAAa,IAAI,WAAW;AACrC,QAAI,UAAU,GAAG;AACT,YAAA,iBAAiB,gBAAgB,UAAU;AACtC,iBAAA;AAAA,IAAA;AAGb,QAAI,UAAU,GAAG;AACT,YAAA,IAAI,MAAM,6CAA6C;AAAA,IAAA;AAG/D,UAAM,WAAW;AAAA,MACf,QAAQ,UAAU;AAAA,MAClB;AAAA,IACF;AAKA,UAAM,gBAAgB,UAAU,OAAO,IAAI,UAAU,OAAO,IAAI;AAE5D,QAAA,gBAAgB,KAAK,gBAAgB,SAAS;AAChD,YAAM,WAAW,gBAAgB;AACjC,gBAAU,UAAU;AAAA,IAAA;AAGtB,oBAAgB,UAAU;AAC1B,uBAAmB,KAAK,QAAQ;AAAA,EAAA;AAGlC,SAAO,mBAAmB,QAAQ;AACpC;AAIO,SAAS,eACd,YACA;AACO,SAAA,OAAO,OAAO,UAAU,EAC5B,QAAQ,CAAC,UAAU,KAAK,EACxB;AAAA,IACC,CAAC,GAAG,MACF,IAAI,KAAK,EAAE,SAAS,EAAE,QAAA,IAAY,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ;AAAA,EACpE;AACJ;AAIO,SAAS,qBACd,YACA;AACO,SAAA,OAAO,OAAO,UAAU,EAC5B,QAAQ,CAAC,UAAU,KAAK,EACxB;AAAA,IACC,CAAC,GAAG,MACF,IAAI,KAAK,EAAE,UAAU,SAAS,EAAE,YAChC,IAAI,KAAK,EAAE,UAAU,SAAS,EAAE,QAAQ;AAAA,EAC5C;AACJ;AAIO,SAAS,wBAAwB,UAAoB;;AACpD,QAAA,mBAAmB,eAAe,SAAS,UAAU;AAC3D,QAAM,cACJ,sBAAiB,GAAG,EAAE,MAAtB,mBAAyB,cAAa,SAAS,aAAa;AACvD,SAAA;AACT;AAKgB,SAAA,iBACd,cACA,mBACA,SACA,UACA,QACA,kBAAkB,aAClBc,wBAA6C,CAAA,GAC7C,SACmB;AAGb,QAAA,iBAAiB,cAAc,SAAS,eAAe;AAEtD,SAAA;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACAA;AAAA,IACA;AAAA,EACF;AACF;AAkBgB,SAAA,eACd,cACA,YACA,SACA,UACA,QACAA,wBAA6C,CAAC,GAC9C,SACmB;AACb,QAAA;AAAA,IACJ,cAAc;AAAA,IACd;AAAA,IACA,gCAAgC;AAAA,EAClC,IAAI,WAAW,CAAC;AAEhB,MAAI,gBAAgB;AACpB,QAAM,qBAAqB,CAAC;AAC5B,QAAM,oBAA2C;AAAA,IAC/C,QAAQ,CAAC;AAAA,IACT,OAAO,CAAA;AAAA,EACT;AAMA,MAAI,8BAA8B;AAChC,eAAW,CAAC,OAAO,eAAe,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC3D,YAAA,QAAQ,gBAAgB,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,cAAc;AACrE,UAAI,QAAQ,GAAG;AACM,2BAAA,KAAK,GAAG,eAAe;AAC1C;AAAA,MAAA;AAEI,YAAA,cAAc,gBAAgB,KAAK;AACrC,UAAA;AACF,cAAM,aAAa;AAAA;AAAA,UAEjB,YAAY;AAAA,QACd;AACgB,wBAAA;AAAA,UACd,GAAG;AAAA,UACH,OAAO;AAAA,YACL,GAAG,cAAc;AAAA;AAAA,YAEjB,CAAC,KAAK,GAAG;AAAA,UAAA;AAAA,QAEb;AACA,0BAAkB,KAAoC,EAAE;AAAA,UACtD,GAAG,gBAAgB,MAAM,GAAG,QAAQ,CAAC;AAAA,QACvC;AACA,2BAAmB,KAAK,GAAG,gBAAgB,MAAM,QAAQ,CAAC,CAAC;AAAA,MAAA,QACrD;AAEa,2BAAA,KAAK,GAAG,eAAe;AAAA,MAAA;AAAA,IAC5C;AAAA,EACF,OACK;AACL,uBAAmB,KAAK,GAAG,OAAO,OAAO,UAAU,EAAE,MAAM;AAAA,EAAA;AAIvD,QAAA,WAAW,eAAwB,aAAa;AACtD,WAAS,eAAe;AACxB,WAAS,aAAa;AAEtB,MAAI,SAAS;AAGb,MAAI,mBAAmB,QAAQ;AAC7B,aAAS,mBAAmB,OAAO,CAACC,WAAU,cAAc;AAC1D,YAAM,MAAM,QAAQA,WAAU,WAAW,UAAU;AAAA,QACjD,MAAM,UAAU;AAAA,QAChB,sBAAsB;AAAA,QACtB,WAAW,CAAC;AAAA,MAAA,CACb;AAEM,aAAA;AAAA,OACN,QAAQ;AAAA,EAAA,OAIR;AACH,eAAW,mBAAmB,OAAO,OAAO,iBAAiB,GAAG;AACxD,YAAA,gBAAgB,gBAAgB,GAAG,EAAE;AAC3C,UAAI,eAAe;AACR,iBAAA,aAAa,QAAQ,aAAa;AAAA,MAAA;AAAA,IAC7C;AAAA,EACF;AAKF,MAAI,CAAC,aAAa;AAChB,eAAW,SAAS,OAAO,KAAK,OAAO,KAAK,GAAG;AAC7C,eAAS,IAAI,mBAAmB,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,cAAA,YAAY,mBAAmB,CAAC;AAElC,YAAA,UAAU,UAAU,OAAO;AAC7B;AAAA,QAAA;AAEF,YAAI,UAAU,SAAS,aAAa,QAAQ,KAAK,GAAG;AAClD,gBAAM,IAAI,MAAM,2BAA2B,KAAK,EAAE;AAAA,QAAA,OAC7C;AACL;AAAA,QAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAIF,QAAM,mBAA0C,OAAO;AAAA,IACrD,OAAO;AAAA,EAAA,EACP;AAAA,IACA,CAAC,KAAK,QAAQ;AACZ,YAAM,QAAQ;AACP,aAAA;AAAA,QACL,GAAG;AAAA,QACH,CAAC,KAAK,GAAG;AAAA,UACP,GAAG,OAAO,WAAW,KAAK,EAAE,IAAI,CAAC,WAAW,UAAU;;AAC7C,mBAAA;AAAA,cACL,GAAG;AAAA,cACH,aACE,gBAAW,KAAK,EAAE,KAAK,MAAvB,mBAA0B,cAAa,UAAU;AAAA,YACrD;AAAA,UACD,CAAA;AAAA,QAAA;AAAA,MAEL;AAAA,IACF;AAAA,IACA,EAAE,QAAQ,IAAI,OAAO,CAAG,EAAA;AAAA,EAC1B;AAEM,QAAA,eAAe,OAAO,OAAO,gBAAgB,EAAE,OAAO,CAAC,KAAK,SAAS;AACnE,UAAA,YAAY,KAAK,GAAG,EAAE;AACxB,QAAA,aAAa,UAAU,YAAY,KAAK;AAC1C,YAAM,UAAU;AAAA,IAAA;AAEX,WAAA;AAAA,EAAA,GACN,aAAa,YAAY;AAE5B,SAAO,EAAE,GAAG,QAAQ,YAAY,kBAAkB,aAAa;AACjE;AAEgB,SAAA,eAAe,WAAqB,WAAqB;AACvE,SAAOf,UAAc,SAAS,MAAMA,UAAc,SAAS;AAC7D;AAEO,SAAS,oBAAoB,OAAgB;AAClD,QAAM,YAAY,OAAO;AACzB,MAAI,cAAc,UAAU;AACnB,WAAA,KAAK,MAAM,KAAe;AAAA,EAAA,WACxB,cAAc,UAAU;AAC1B,WAAA;AAAA,EAAA,OACF;AACL,UAAM,IAAI,MAAM,yCAAyC,SAAS,EAAE;AAAA,EAAA;AAExE;ACrea,MAAA,UAAU,CAAC,SACtB;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACAgB;AAAAA,EACA;AACF;AAQK,MAAM,OAAO,CAAC,OAAO,GAAG,QAAwB,aACrD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACAC;AAAAA,EACA;AACF;AAQK,MAAM,OAAO,CAAC,QAAQ,GAAG,QAAwB,aACtD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACAC;AAAAA,EACA;AACF;AAaK,MAAM,QAAQ,CACnB,OACA,KACA,QAAwB,aAExB;AAAA,EACE;AAAA,EACA,EAAE,OAAO,IAAI;AAAA,EACb;AAAA,EACAC;AAAAA,EACA;AACF;AAYW,MAAA,YAAY,CACvB,OACA,eAEA;AAAA,EACE;AAAA,EACA,EAAE,OAAO,WAAW;AAAA,EACpB;AAAA,EACAC;AACF;AAEW,MAAA,OAAO,CAAC,QAAwB,aAC3C,aAAyB,QAAQ,CAAC,GAAG,QAAW,QAAW,KAAK;;;;;;;;;;AClF3D,MAAe,aAA+C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUnE,YACE,SACA,UACA,gBACA;AAbQ;AACF;AACA;AAYN,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,kBAAkB;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQf,SAAS,QAAwB,SAA0B;AACnE,SAAK,YAAY,KAAK;AAAA,MACpB,KAAK;AAAA,MACL;AAAA,MACA,KAAK;AAAA,MACL;AAAA,IACF;AACO,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASC,WAAW,MAAc,WAAmB,MAAe;AACnE,WAAO,WAAW,KAAK,WAAW,MAAM,WAAW,IAAI;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOzD,MAAM,aAAa,MAAc;AAC/B,SAAK,YAAY,MAAM,aAAsB,MAAM,KAAK,QAAQ;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASlE,aAAuB,cACrB,MACA,SACA;AACA,UAAM,QAAQ,MAAM,aAAsB,MAAM,OAAO;AAChD,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMT,IAAI,QAAQ;AACH,WAAA,SAAS,KAAK,UAAU,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMtC,IAAI,aAAa;AACR,WAAA,SAAS,KAAK,UAAU,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAM3C,IAAI,OAAO;AACT,WAAO,KAAK,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,IAAI,eAAe;AACjB,WAAO,KAAK,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,IAAI,UAAU;AACZ,WAAO,KAAK,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,IAAI,eAAe;AACjB,WAAO,KAAK,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMxB,IAAI,WAAW;AACN,WAAA,KAAK,UAAU,SAAS;AAAA,EAAA;AAAA,EAGjC,YAAY,OAAuB;AAC1B,WAAA,KAAK,UAAU,SAAS,KAAK;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMtC,IAAI,eAAe;AACV,WAAA,SAAS,KAAK,UAAU,YAAY;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA,EAMtC,aAAa;AACX,WAAA,SAAS,KAAK,SAAS;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOzB,cAAc,YAA2B;AACvC,WAAA,KAAK,UAAU,YAAY,UAAU;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOvC,QAAQ,MAAc;AACtB,SAAA,SAAS,QAAQ,IAAI,CAAC;AACpB,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF,KAAK,OAAe;AACpB,SAAA,SAAS,KAAK,KAAK,CAAC;AAClB,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF,KAAK,OAAe;AACpB,SAAA,SAAS,KAAK,KAAK,CAAC;AAClB,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF,MAAM,OAA4B,KAA0B;AACjE,SAAK,SAAS,MAAM,OAAO,GAAG,CAAC;AACxB,WAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQF,UACL,OACA,YACA;AACA,SAAK,SAAS,UAAU,OAAO,UAAU,CAAC;AACnC,WAAA;AAAA,EAAA;AAEX;AAYgB,SAAA,YAAY,aAAkB,cAAqB;AACpD,eAAA,QAAQ,CAAC,aAAa;AAEjC,WAAO,oBAAoB,SAAS,SAAS,EAAE,QAAQ,CAAC,SAAS;AACxD,aAAA;AAAA;AAAA,QAEL,YAAY;AAAA,QACZ;AAAA;AAAA,QAEA,OAAO,yBAAyB,SAAS,WAAW,IAAI,KACtD,uBAAO,OAAO,IAAI;AAAA,MACtB;AAAA,IAAA,CACD;AAAA,EAAA,CACF;AACH;","x_google_ignoreList":[1,2,3,4,5,6,7,10,11,12]}