@zyzgroup/core-web 0.0.7 → 0.0.8

package/dist/zyzgroup_core_web.iife.js.map

@@ -1 +1 @@
-{"version":3,"file":"zyzgroup_core_web.iife.js","sources":["../src/error.ts","../src/file.ts","../src/onDocumentReady.ts","../src/microTask.ts","../src/patchDOM.ts","../src/cookie.js","../src/websocket.js","../src/position.ts","../src/mouse.js","../src/env.js","../src/rem.js","../src/url.js","../src/theme.ts","../src/DOMKeyboardKeyCode.ts","../src/dom.js","../src/tween/Easing.ts","../src/tween/Now.ts","../src/tween/Group.ts","../src/tween/Interpolation.ts","../src/tween/Sequence.ts","../src/tween/mainGroup.ts","../src/tween/Tween.ts","../src/tween/index.ts","../src/animate.ts","../../../node_modules/.pnpm/uzip@0.20201231.0/node_modules/uzip/UZIP.js","../../../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/UPNG.js","../src/image.ts","../src/fetch.js","../src/localstorage.ts","../src/scroll.ts","../src/reactive.ts"],"sourcesContent":["export class BaseError extends Error {\n  cause?: Error;\n\n  constructor(message: string, options?: ErrorOptions) {\n    super(message, options);\n    this.name = this.constructor.name;\n  }\n}\n\nexport class EnvironmentError extends BaseError {\n  constructor() {\n    super(\"This is not a browser environment\");\n  }\n}\n\nexport class FileSelectCancelError extends BaseError {\n  constructor() {\n    super(\"Cancel select\");\n  }\n}\n\nexport class IllegalFileError extends BaseError {\n  accepts: string[];\n\n  constructor(accepts: string[]) {\n    super(`Please select files in ${accepts} format`);\n    this.accepts = accepts;\n  }\n}\n","import {\n  EnvironmentError,\n  FileSelectCancelError,\n  IllegalFileError\n} from \"./error\";\n\n// <input type=\"file\" id=\"input\">\n// <input type=\"file\" id=\"input\" multiple accept=\"image/*\" style=\"display:none\" name=\"photos[]\">\n// <label for=\"input\">Select some files</label>\n// input css :focus :focus-within\nexport function handleInputFiles(\n  el: HTMLInputElement,\n  cb: (files: FileList | null) => any\n) {\n  el.addEventListener(\n    \"change\",\n    function () {\n      cb(el.files);\n    },\n    false\n  );\n}\n\nexport function handleDragAndDropFiles(\n  dropZoneEl: HTMLElement,\n  cb: (files: FileList | null) => any\n) {\n  // dragover dragenter dragend drop\n  dropZoneEl.addEventListener(\n    \"dragover\",\n    function (e) {\n      e.stopPropagation();\n      e.preventDefault();\n      if (e.dataTransfer) e.dataTransfer.dropEffect = \"copy\";\n    },\n    false\n  );\n  dropZoneEl.addEventListener(\n    \"drop\",\n    function (e) {\n      e.stopPropagation();\n      e.preventDefault();\n      if (e.dataTransfer) cb(e.dataTransfer.files);\n    },\n    false\n  );\n}\n\n/**\n * 选择系统文件\n *\n * @param accepts 可选文件后缀\n * @param multiple 是否多选\n * @returns\n */\nexport const selectFile = (\n  accepts: string[] = [\"*\"],\n  multiple?: boolean\n): Promise<File[]> => {\n  if (!globalThis.document || !(globalThis.document instanceof Document)) {\n    throw new EnvironmentError();\n  }\n  const inputElement = globalThis.document.createElement(\"input\");\n  inputElement.setAttribute(\"type\", \"file\");\n  inputElement.setAttribute(\"visibility\", \"hidden\");\n  if (Array.isArray(accepts) && accepts.length > 0) {\n    inputElement.setAttribute(\"accept\", accepts.join(\",\"));\n  }\n  if (multiple) {\n    inputElement.setAttribute(\"multiple\", \"true\");\n  }\n  inputElement.click();\n\n  return new Promise((resolve, reject) => {\n    globalThis.addEventListener(\n      \"focus\",\n      () => {\n        setTimeout(() => {\n          if (!inputElement.files || inputElement.files?.length === 0) {\n            reject(new FileSelectCancelError());\n          }\n        }, 1000);\n      },\n      { once: true }\n    );\n    inputElement.addEventListener(\"change\", () => {\n      if (!inputElement.files || inputElement.files?.length === 0) {\n        reject(new FileSelectCancelError());\n      } else {\n        const files = Array.from(inputElement.files);\n        if (illegalFiles(files)) {\n          reject(new IllegalFileError(accepts));\n        }\n        resolve(files);\n      }\n    });\n  });\n\n  function illegalFiles(files: File[]): boolean {\n    return (\n      !accepts.includes(\"*\") &&\n      files.some((file) => !accepts.includes(`.${getFileExtension(file)}`))\n    );\n  }\n};\n\nexport interface FileHandler {\n  (fileRender: FileReader): void;\n}\n\nexport const readeFile = <T extends string | ArrayBuffer | null>(\n  fileHandler: FileHandler\n): Promise<T> => {\n  const reader = new FileReader();\n  return new Promise((resolve, reject) => {\n    reader.addEventListener(\n      \"progress\",\n      (event: FileReaderEventMap[\"progress\"]) => {\n        const size = \"(\" + Math.floor(event.total / 1000) + \" KB)\";\n        const progress = Math.floor((event.loaded / event.total) * 100) + \"%\";\n        console.log(`Loading size: ${size} progress: ${progress}`);\n      }\n    );\n    reader.addEventListener(\"load\", (event: FileReaderEventMap[\"load\"]) => {\n      resolve(event.target?.result as T);\n    });\n    reader.addEventListener(\"error\", (event: FileReaderEventMap[\"error\"]) => {\n      reject(event);\n    });\n    fileHandler(reader);\n    // reader.readAsDataURL(file);\n    // reader.readAsBinaryString(file);\n  });\n};\n\n/**\n * 获取文件后缀\n *\n * @param file 文件或文件名\n * @returns\n */\nexport const getFileExtension = (file: File | string): string => {\n  let fileName: string;\n  if (file instanceof File) {\n    fileName = file.name;\n  } else {\n    fileName = file;\n  }\n  return fileName.match(/\\.([0-9a-z]+)(?:[\\\\?#]|$)/i)![1] ?? \"\";\n};\n\nexport const isImage = (file: File): boolean => {\n  return /^image\\//.test(file.type);\n};\n\nexport const isVideo = (file: File): boolean => {\n  return /^video\\//.test(file.type);\n};\n\nexport const isAudio = (file: File): boolean => {\n  return /^audio\\//.test(file.type);\n};\n\nexport const isWordDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.openxmlformats-officedocument\\.wordprocessingml\\.document|msword|vnd\\.ms-word\\.document\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.wordprocessingml\\.template|vnd\\.ms-word\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isExcelDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.openxmlformats-officedocument\\.spreadsheetml\\.sheet|vnd\\.ms-excel|vnd\\.ms-excel\\.sheet\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.spreadsheetml\\.template|vnd\\.ms-excel\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isPowerPointDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.ms-powerpoint|vnd\\.openxmlformats-officedocument\\.presentationml\\.presentation|vnd\\.ms-powerpoint\\.presentation\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.presentationml\\.template|vnd\\.ms-powerpoint\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isJsonDocument = (file: File): boolean => {\n  return /^application\\/json$/.test(file.type);\n};\n\nexport const isXmlDocument = (file: File): boolean => {\n  return /^(?:application|text)\\/(?:xml|xhtml\\+xml)$/.test(file.type);\n};\n\n// base64: `data:image/png;base64,`\n/**\n * 判断文件类型\n * @example <input type=\"file\" onchange=\"getFileType(this.files[0])\"></input>\n */\nexport function getFileType(file: File) {\n  // 文件开头的四个字节，生成一个 Blob 对象\n  const slice = file.slice(0, 4);\n  const reader = new FileReader();\n  let verified_type: string;\n  return new Promise((resolve, reject) => {\n    reader.onload = function () {\n      const buffer = reader.result as ArrayBuffer;\n      // 将这四个字节的内容，视作一个32位整数\n      const view = new DataView(buffer);\n      const magic = view.getUint32(0, false);\n      // 根据文件的前四个字节，判断它的类型\n      switch (magic) {\n        case 0x89504e47:\n          verified_type = \"image/png\";\n          break;\n        case 0x47494638:\n          verified_type = \"image/gif\";\n          break;\n        case 0x25504446:\n          verified_type = \"application/pdf\";\n          break;\n        case 0x504b0304:\n          verified_type = \"application/zip\";\n          break;\n      }\n      return resolve(verified_type);\n    };\n    // 读取这四个字节\n    reader.readAsArrayBuffer(slice);\n  });\n}\n\n/**\n * 将一个函数转换为 blob，然后为这个 blob 生成 URL 对象\n */\nexport function fn2ObjectURL(fn: (...args: any[]) => any) {\n  const blob = new Blob([\"(\" + fn.toString() + \")()\"], {\n    type: \"application/javascript\"\n  });\n  return URL.createObjectURL(blob);\n  // URL.revokeObjectURL(URL.createObjectURL(blob))\n}\n","export function onDocumentReady(cb: () => void) {\n  function check() {\n    if (document.readyState === \"loading\") return;\n    cb();\n    document.removeEventListener(\"DOMContentLoaded\", check);\n  }\n  if (typeof document !== \"undefined\") {\n    document.addEventListener(\"DOMContentLoaded\", check);\n    check();\n  }\n}\n","export function microTask(cb: () => void) {\n  if (typeof queueMicrotask === \"function\") {\n    queueMicrotask(cb);\n  } else {\n    Promise.resolve()\n      .then(cb)\n      .catch((e) =>\n        setTimeout(() => {\n          throw e;\n        })\n      );\n  }\n}\n","export function patchDOM(\n  oldNode: HTMLElement,\n  newNode: HTMLElement,\n  parent: HTMLElement\n) {\n  if (!oldNode) {\n    if (parent && newNode) {\n      parent.appendChild(newNode);\n    }\n    return;\n  }\n\n  if (oldNode.isEqualNode(newNode)) return;\n\n  if (oldNode.nodeName !== newNode.nodeName) {\n    parent.replaceChild(newNode, oldNode);\n    return;\n  }\n\n  if (oldNode.nodeType === Node.TEXT_NODE) {\n    if (oldNode.textContent !== newNode.textContent) {\n      oldNode.textContent = newNode.textContent;\n    }\n    return;\n  }\n\n  for (let i = oldNode.attributes.length - 1; i >= 0; i--) {\n    const attrName = oldNode.attributes[i].name;\n    if (!newNode.hasAttribute(attrName) && attrName !== \"open\") {\n      oldNode.removeAttribute(attrName);\n    }\n  }\n\n  for (let i = 0; i < newNode.attributes.length; i++) {\n    const attrName = newNode.attributes[i].name;\n    const attrValue = newNode.attributes[i].value;\n    oldNode.setAttribute(attrName, attrValue);\n  }\n\n  for (let i = 0; i < newNode.childNodes.length; i++) {\n    if (oldNode.childNodes[i]) {\n      patchDOM(\n        oldNode.childNodes[i] as HTMLElement,\n        newNode.childNodes[i] as HTMLElement,\n        oldNode\n      );\n    } else {\n      oldNode.appendChild(newNode.childNodes[i].cloneNode(true));\n    }\n  }\n\n  while (oldNode.childNodes.length > newNode.childNodes.length) {\n    if (oldNode.lastChild) oldNode.removeChild(oldNode.lastChild);\n  }\n}\n","export function setCookie(cname, cvalue, exdays) {\n  var d = new Date();\n  d.setTime(d.getTime() + exdays * 24 * 60 * 60 * 1000);\n  var expires = \"expires=\" + d.toGMTString();\n  document.cookie = cname + \"=\" + cvalue + \"; \" + expires;\n}\n\nexport function getCookie(cname) {\n  var name = cname + \"=\";\n  var ca = document.cookie.split(\";\");\n  for (var i = 0; i < ca.length; i++) {\n    var c = ca[i].trim();\n    if (c.indexOf(name) == 0) return c.substring(name.length, c.length);\n  }\n  return \"\";\n  // return `; ${document.cookie}`.split(`; ${cname}=`).pop().split(\";\").shift();\n}\n\n// Convert cookie to object\nexport const getCookieObject = () =>\n  document.cookie\n    .split(\";\")\n    .map((item) => item.split(\"=\"))\n    .reduce((acc, [k, v]) => (acc[k.trim().replace('\"', \"\")] = v) && acc, {});\n\n// Clear all cookies\nexport const clearCookies = () =>\n  document.cookie\n    .split(\";\")\n    .forEach(\n      (c) =>\n        (document.cookie = c\n          .replace(/^ +/, \"\")\n          .replace(/=.*/, `=;expires=${new Date().toUTCString()};path=/`))\n    );\n","/// wss://echo.websocket.org\n\nexport class WebSocket {\n  constructor(url) {\n    // Here we create an empty array [] which we will add to later\n    // Note that we can use {} also, which is for empty objects\n    // (arrays are objects)\n    this.waitingResponse = [];\n\n    // Here we create an empty array [] that represents the queue of\n    // messages that didn't send because the socket was closed and\n    // are queued up to be sent during the onopen handler (which iterates\n    // through this array)\n    this.messageQueue = [];\n\n    this.url = url;\n\n    // We separate out the socket initialisation into its own function\n    // as we will also call it during a reconnect attempt\n    this.createSocket();\n  }\n\n  // The reconnection logic is that whenever a message fails to send, the\n  // message is added to messageQueue and a reconnection attempt is made.\n  // So, when a connection is lost, it is reconnected to after a certain\n  // time, but rather only when the user initiates an action that must\n  // message (i.e.) interact with the WebSocket\n  createSocket() {\n    this.socket = new WebSocket(this.url);\n\n    // Iterate through the queue of messages that haven't been sent\n    // If this queue is empty then no messages are sent\n\n    // All messages in the message queue arise from a previous\n    // sendPayload event, thus are parsed in the correct JSON form\n    // and have an associated request object in waitingResponse\n    this.socket.onopen = () => {\n      this.messageQueue.forEach((item) => this.socket.send(item));\n      this.messageQueue = [];\n    };\n\n    this.socket.onclose = (e) => {\n      const { code, reason, wasClean } = e;\n      console.log(`ws closed : ${code} ${reason} ${wasClean}`);\n    };\n\n    this.socket.onerror = (e) => {\n      console.log(`ws error :  ${e}`);\n    };\n\n    this.socket.onmessage = (e) => {\n      this.processMessage(e);\n    };\n  }\n\n  // Creates a new socket and adds any unsent\n  // messages onto the message queue\n  recreateSocket(message) {\n    console.log(\"Reconnection Attempted\");\n    this.messageQueue.push(message);\n    this.createSocket();\n  }\n\n  // Closes a socket, which can take a bit\n  // of time (few seconds) since a roundtrip to\n  // the server is done\n  closeSocket() {\n    this.socket.close();\n    console.log(\"Socket closed manually.\");\n  }\n\n  // Exposes a function for users to start a new\n  // socket - there is no way to 'reconnect' to\n  // a socket, a new websocket needs to be created\n  openSocket() {\n    this.createSocket();\n    console.log(\"Socket opened manually.\");\n  }\n\n  async sendPayload(details) {\n    // Create a request where request = { sent: + new Date()} and this.waiting... = request\n    // this means both request and waitingResponse[details.requestid] point to the same thing\n    // so that changing request.test will also result in waitingResponse[details.requestid].test\n    // having the same value\n\n    // Note that details.requestid here is an index = the timestamp. Later when we process\n    // messages received, we will check the timestamp of the requestid of the message received\n    // against this waitingResponse array and resolve the request if a match is found\n\n    let requestid = +new Date();\n    const request = (this.waitingResponse[requestid] = { sent: requestid });\n\n    // Here we combine the request (which at this point is just { sent: ...} with the\n    // actual data to be sent to form the final message to send\n    const message = { ...request, ...details };\n\n    // If Socket open then send the details (message) in String Format\n    try {\n      // WebSocket.CONNECTING  WebSocket.OPEN WebSocket.CLOSING WebSocket.CLOSED\n      if (this.socket.readyState === WebSocket.OPEN) {\n        this.socket.send(JSON.stringify(message));\n      } else {\n        // Otherwise we try to recreate the socket and send the message\n        // after recreating the socket\n        this.recreateSocket(JSON.stringify(message));\n      }\n\n      // Here we create a new promise function\n      // We set the resolve property of request [which is also referenced\n      // by waitingResponse[details.requestid] to the Promise's resolve function\n\n      // Thus we can resolve the promise from processMessage (refer below)\n\n      // We reject after 5 seconds of not receiving the associated message\n      // with the same requestid\n      const result = await new Promise(function (resolve, reject) {\n        // This will automatically run, allowing us to access\n        // the resolve function from outside this function\n        request.resolve = resolve;\n\n        console.log(request);\n        // This will take 5 seconds to run, which becomes the lifecycle\n        // of this Promise function - the resolve function must be\n        // called before this point\n        setTimeout(() => {\n          reject(\"Timeout\"); // or resolve({action: \"to\"}), or whatever\n        }, 5000);\n      });\n\n      console.info(\"Time took\", (+new Date() - request.sent) / 1000);\n\n      // function returns result\n      return result; // or {...request, ...result} if you care\n    } finally {\n      // code to run regardless of whether try worked or error thrown\n      console.log(\"Exit code ran successfully\");\n\n      delete this.waitingResponse[requestid];\n    }\n  }\n\n  // Message Receiver, we attach this to the onmessage handler\n  // Expects message to be in JSON format, otherwise throws\n  // an error and simply logs the message to console\n\n  // The message must also have a requestid property (we\n  // use lowercase \"i\" here because Common Lisp's JZON library\n  // lowercases property names in JSON messages\n\n  // Test if the requestid passed in has an entry in the waitingResponse\n  // queue (data.requestid is the array index and the sendPayload function\n  // sets a value in this array for various id indexes to { sent: .. }\n  // This index also has a reference to the resolve function for the\n  // associated promise for that request id\n\n  // If that is true ('truthy' via if (request)), then resolve the\n  // associated promise via request.resolve(data), where data is\n  // the value resolved by the promise\n\n  // Otherwise pass a variety of console warnings / logs - the message\n  // will not be handled and disappear from the future (i.e. every\n  // message needs a requestid set in waitingResponse to be caught\n\n  // We could probably add in a router for server initiated messages\n  // to be handled (under the second warning below)\n  async processMessage(msg) {\n    try {\n      let data = JSON.parse(msg.data);\n\n      if (Object.prototype.hasOwnProperty.call(data, \"requestid\")) {\n        const request = this.waitingResponse[data.requestid];\n        if (request) request.resolve(data);\n        else\n          console.warn(\n            \"Got data but found no associated request, already timed out?\",\n            data\n          );\n      } else {\n        // Add handlers here for messages without request ID\n        console.warn(\"Got data without request id\", data);\n      }\n    } catch {\n      console.log(msg.data);\n    }\n  }\n\n  // Main entry point for calling functions with a simple\n  // callback to action to perform on the received data\n  // Exists here to reduce boilerplate for the calling function\n  async sendRequest(\n    details,\n    resolution,\n    rejection = (error) => {\n      console.log(error);\n    }\n  ) {\n    this.sendPayload(details).then(\n      function (value) {\n        resolution(value);\n      },\n      function (error) {\n        rejection(error);\n      }\n    );\n  }\n\n  // Second entry point for one direction messages\n  // i.e. not expecting any responses. This bypasses\n  // the request-response promise functions above\n\n  // Attempts to JSON.stringify the object first,\n  // and just sends the object if cannot be made\n  // into a JSON string\n\n  sendMessage(details) {\n    // Example of an Immediately-Invoked Function Expression\n    const message = (() => {\n      try {\n        return JSON.stringify(details);\n      } catch (e) {\n        return details;\n      }\n    })();\n\n    if (this.socket.readyState === WebSocket.OPEN) {\n      this.socket.send(message);\n    } else {\n      // Otherwise we try to recreate the socket and send the message\n      // after recreating the socket\n      this.recreateSocket(message);\n    }\n  }\n}\n","export function getDocumentElement() {\n  if (document.compatMode == \"BackCompat\") {\n    return document.body;\n  } else {\n    return document.documentElement;\n  }\n}\n\n// 获取可视区域大小\nexport function getViewportSize() {\n  const documentElement = getDocumentElement();\n  return {\n    width: documentElement.clientWidth || window.innerWidth,\n    height: documentElement.clientHeight || window.innerHeight\n  };\n}\n\n// 获取页面整体大小\nexport function getPageSize() {\n  const documentElement = getDocumentElement();\n  const viewport = getViewportSize();\n  return {\n    width: Math.max(documentElement.scrollWidth, viewport.width),\n    height: Math.max(documentElement.scrollHeight, viewport.height)\n  };\n}\n\n/**\n * 判断元素是否在可视区域\n *\n * DOMRect 对象包含了一组用于描述边框的只读属性——top,lef,right,bottom,width,height，单位为像素。\n * 除了 width 和 height 外的属性都是相对于浏览器可视范围的左上角位置而言的。\n * right是指元素右边界距窗口最左边的距离，bottom是指元素下边界距窗口最上面的距离。\n * 兼容所有浏览器写法：\n * var ro = object.getBoundingClientRect();\n * var Top = ro.top;\n * var Bottom = ro.bottom;\n * var Left = ro.left;\n * var Right = ro.right;\n * var Width = ro.width || Right - Left;\n * var Height = ro.height || Bottom - Top;\n */\nexport function isElementInViewport(el: HTMLElement) {\n  const viewport = getViewportSize();\n  const rect = el.getBoundingClientRect();\n  return (\n    rect.bottom > 0 &&\n    rect.top < viewport.height &&\n    rect.right > 0 &&\n    rect.left < viewport.width\n  );\n}\n\n//scrollTop和scrollLeft属性是可以赋值的，并且会立即自动滚动网页到相应位置，因此可以利用它们改变网页元素的相对位置\nexport function getPageScroll() {\n  const documentElement = getDocumentElement();\n  return {\n    scrollLeft: documentElement.scrollLeft,\n    scrollTop: documentElement.scrollTop\n  };\n}\n\nexport function getPageClient() {\n  const documentElement = getDocumentElement();\n  return {\n    clientLeft: documentElement.clientLeft,\n    clientTop: documentElement.clientTop\n  };\n}\n\nexport function getElementLeftInPage(element: HTMLElement) {\n  let actualLeft = element.offsetLeft;\n  let current = element.offsetParent as HTMLElement;\n  while (current !== null) {\n    actualLeft += current.offsetLeft;\n    current = current.offsetParent as HTMLElement;\n  }\n  return actualLeft;\n}\n\nexport function getElementTopInPage(element: HTMLElement) {\n  let actualTop = element.offsetTop;\n  let current = element.offsetParent as HTMLElement;\n  while (current !== null) {\n    actualTop += current.offsetTop;\n    current = current.offsetParent as HTMLElement;\n  }\n  return actualTop;\n}\n\nexport function getElementPositionInPage2(element: HTMLElement) {\n  return {\n    x: getElementLeftInPage(element),\n    y: getElementTopInPage(element)\n  };\n}\nexport function getElementPositionInPage(element: HTMLElement) {\n  const rect = element.getBoundingClientRect();\n  const scroll = getPageScroll();\n  const pageClient = getPageClient();\n  return {\n    x: rect.left + scroll.scrollLeft - pageClient.clientLeft,\n    y: rect.top + scroll.scrollTop - pageClient.clientTop\n  };\n}\n\nexport function getElementPositionInViewport(element: HTMLElement) {\n  const rect = element.getBoundingClientRect();\n  return {\n    x: rect.left,\n    y: rect.top\n  };\n}\n\n// horizontal scroll indicator\n// window.onscroll = () => getPageVerticalScrollPercent();\nexport function getPageVerticalScrollPercent() {\n  const documentElement = getDocumentElement();\n  // https://www.w3schools.com/howto/howto_js_scroll_indicator.asp\n  const height = documentElement.scrollHeight - documentElement.clientHeight;\n  return height <= 0 ? 0 : (documentElement.scrollTop / height) * 100;\n}\n\n//////////////////////////////// 鼠标 ////////////////////////////////\nexport function getMousePositionInPage(ev: MouseEvent) {\n  if (ev.pageX && ev.pageY) {\n    return { x: ev.pageX, y: ev.pageY };\n  }\n  const pageScroll = getPageScroll();\n  const pageClient = getPageClient();\n  return {\n    x: ev.clientX + pageScroll.scrollLeft - pageClient.clientLeft,\n    y: ev.clientY + pageScroll.scrollTop - pageClient.clientTop\n  };\n}\n\nexport function getMousePositionInViewport(ev: MouseEvent) {\n  return {\n    x: ev.clientX,\n    y: ev.clientY\n  };\n}\n","/**\n * 鼠标按键\n * @returns 0 左键 1 中键 2 右键\n */\nexport function getMouseButton(event) {\n  if (document.implementation.hasFeature(\"MouseEvents\", \"2.0\")) {\n    return event.button;\n  } else {\n    switch (event.button) {\n      case 0:\n      case 1:\n      case 3:\n      case 5:\n      case 7:\n        return 0; //左键\n      case 2:\n      case 6:\n        return 2; //右键\n      case 4:\n        return 1; //中键\n    }\n  }\n}\n","// Mozilla/5.0 (Linux; Android 6.0; Nexus 5 Build/MRA58N) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/118.0.0.0 Mobile Safari/537.36\n// Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/118.0.0.0 Safari/537.36\nexport const getOperatingSystem = () => {\n  const userAgent = navigator.userAgent.toLowerCase();\n  let operatingSystem = \"Unknown\";\n  if (userAgent.includes(\"mac\")) {\n    operatingSystem = \"macOS\";\n  } else if (userAgent.includes(\"win\")) {\n    operatingSystem = \"Windows\";\n  } else if (/android/.test(userAgent)) {\n    operatingSystem = \"Android\";\n  } else if (/iphone|ipad|ipod/.test(userAgent)) {\n    operatingSystem = \"iOS\";\n  } else if (/linux/.test(userAgent)) {\n    operatingSystem = \"Linux\";\n  } else if (/bsd/.test(userAgent)) {\n    operatingSystem = \"BSD\";\n  }\n  return operatingSystem.toLowerCase();\n};\n\nexport const getOperatingSystemVersion = () => {\n  const userAgent = navigator.userAgent;\n  let osVersion = \"Unknown\";\n  if (/Windows NT/.test(userAgent)) {\n    const match = userAgent.match(/Windows NT (\\d+\\.\\d+)/);\n    if (match) {\n      osVersion = match[1];\n    }\n  } else if (/Mac OS X/.test(userAgent)) {\n    const match = userAgent.match(/Mac OS X (\\d+_\\d+)/);\n    if (match) {\n      osVersion = match[1].replace(\"_\", \".\");\n    }\n  } else if (/Android/.test(userAgent)) {\n    const match = userAgent.match(/Android (\\d+\\.\\d+)/);\n    if (match) {\n      osVersion = match[1];\n    }\n  } else if (/iPhone|iPad|iPod/.test(userAgent)) {\n    const match = userAgent.match(/OS (\\d+_\\d+)/);\n    if (match) {\n      osVersion = match[1].replace(\"_\", \".\");\n    }\n  }\n  return osVersion.toLowerCase();\n};\n\nexport const getBrowserClient = () => {\n  const userAgent = navigator.userAgent.toLowerCase();\n  let client = \"Unknown\";\n  if (/chrome/.test(userAgent)) {\n    client = \"Chrome\";\n  } else if (/firefox/.test(userAgent)) {\n    client = \"Firefox\";\n  } else if (/safari/.test(userAgent)) {\n    client = \"Safari\";\n  } else if (/edge/.test(userAgent)) {\n    client = \"Edge\";\n  } else if (/msie|trident/.test(userAgent)) {\n    // client = \"Internet Explorer\";\n    client = \"IE\";\n  }\n  return client.toLowerCase();\n};\n\nexport const getBrowserClientVersion = () => {\n  const userAgent = navigator.userAgent;\n  let browserVersion = \"Unknown\";\n  if (/Chrome/.test(userAgent)) {\n    const match = userAgent.match(/Chrome\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Firefox/.test(userAgent)) {\n    const match = userAgent.match(/Firefox\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Safari/.test(userAgent)) {\n    const match = userAgent.match(/Version\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Edge/.test(userAgent)) {\n    const match = userAgent.match(/Edge\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/MSIE|Trident/.test(userAgent)) {\n    const match = userAgent.match(/(?:MSIE|rv:)(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  }\n  return browserVersion;\n};\n\nexport const getUserGeolocationPromise = () => {\n  if (\"geolocation\" in navigator) {\n    return new Promise((resolve, reject) => {\n      navigator.geolocation.getCurrentPosition(\n        (position) => {\n          const latitude = position.coords.latitude;\n          const longitude = position.coords.longitude;\n          resolve({ latitude, longitude });\n        },\n        (error) => {\n          reject(error);\n        }\n      );\n    });\n  } else {\n    return Promise.reject(\"Geolocation is not available.\");\n  }\n};\n\nexport function getBrowserLanguage() {\n  return (navigator.browserLanguage || navigator.language).toLowerCase();\n}\n\nexport function getTimeZone() {\n  return Intl.DateTimeFormat().resolvedOptions().timeZone.toLowerCase();\n}\n\nexport function isIOS() {\n  return getOperatingSystem() === \"ios\";\n}\n\nexport function isAppleDevice() {\n  return (getOperatingSystem() === \"ios\") | (getOperatingSystem() === \"macos\");\n}\n\nexport function isAndroid() {\n  return getOperatingSystem() === \"android\";\n}\n\nexport function isMobile() {\n  return isIOS() || isAndroid();\n}\n\nexport function isDarkMode() {\n  return (\n    typeof window === \"object\" &&\n    window.matchMedia &&\n    window.matchMedia(\"(prefers-color-scheme: dark)\").matches\n  );\n}\n\nexport const isBrowser =\n  typeof window === \"object\" && typeof document === \"object\";\n\nexport const isNode =\n  typeof process !== \"undefined\" &&\n  process.versions != null &&\n  process.versions.node != null;\n","// import { isAndroid } from \"./env\";\n\nexport function setRem(designWidth) {\n  // 修正页面高度100%的渲染错误\n  // document.documentElement.style.height = window.innerHeight + \"px\";\n\n  var docEl = document.documentElement;\n\n  // var dpr = isAndroid()\n  //   ? 1\n  //   : window.top === window.self\n  //   ? window.devicePixelRatio\n  //   : 1;\n  var dpr = window.devicePixelRatio;\n  docEl.dataset.dpr = dpr;\n\n  // 设置viewport，进行缩放，达到高清效果\n  // var metaEl = document.querySelector('meta[name=\"viewport\"]');\n  // var scale = 1 / dpr;\n  // metaEl.setAttribute(\n  //   \"content\",\n  //   \"width=device-width\" +\n  //     \",initial-scale=\" +\n  //     scale +\n  //     \",maximum-scale=\" +\n  //     scale +\n  //     \", minimum-scale=\" +\n  //     scale +\n  //     \",user-scalable=no, viewport-fit=cover, shrink-to-fit=no\"\n  // );\n\n  // default: 1rem = 100px\n  var rem = 100;\n  var recalc = function () {\n    // var clientWidth = docEl.clientWidth;\n    // // 限制最大rem\n    // if (clientWidth > maxWidth) {\n    //   clientWidth = maxWidth;\n    // }\n    // // 限制最小rem\n    // if (clientWidth < minWidth) {\n    //   clientWidth = minWidth;\n    // }\n    var clientWidth = Math.min(docEl.clientWidth, designWidth);\n    docEl.dataset.width = clientWidth;\n    docEl.dataset.rem = rem = Math.round(100 * (clientWidth / designWidth));\n    // 配合：设置viewport，进行缩放，达到高清效果\n    // docEl.dataset.rem = rem =\n    //   Math.round(100 * (clientWidth / designWidth)) * dpr;\n    docEl.style.fontSize = rem + \"px\";\n  };\n\n  recalc();\n\n  // 给js调用的，某一dpr下rem和px之间的转换函数\n  window.rem2px = function (v) {\n    v = parseFloat(v);\n    return v * rem;\n  };\n  window.px2rem = function (v) {\n    v = parseFloat(v);\n    return v / rem;\n  };\n\n  if (!window.addEventListener) return;\n  window.addEventListener(\n    \"orientationchange\" in window ? \"orientationchange\" : \"resize\",\n    recalc,\n    false\n  );\n}\n","// const path = require(\"path\"); // 路径模块\n// const qs = require(\"querystring\"); // 地址参数解析模块\n// const util = require(\"util\"); // 常用工具方法模块\n// const url = require(\"url\"); // URL 解析模块\n\n// // 新定义的内置对象\n// new Promise();\n// // 原有内置对象新添加的静态方法\n// Array.from();\n// // 原有内置对象新添加的实例方法\n// Array.prototype.includes();\n\n// 编码\nexport function urlsafe_b64encode(str) {\n  return btoa(encodeURIComponent(str))\n    .replaceAll(\"+\", \"*\")\n    .replaceAll(\"/\", \"-\")\n    .replaceAll(\"=\", \"\");\n}\n\n// 解码\nexport function urlsafe_b64decode(base64UrlStr) {\n  let data = base64UrlStr.replaceAll(\"*\", \"+\").replaceAll(\"-\", \"/\");\n  let mod4 = data.length % 4;\n  if (mod4) {\n    data = data.padEnd(data.length + (4 - mod4), \"=\");\n  }\n  return decodeURIComponent(atob(data));\n}\n\nexport const isURLRelative = (path) => !/^([a-z]+:)?[\\\\/]/i.test(path);\n\nexport function isURL(string) {\n  let givenURL;\n  try {\n    givenURL = new URL(string);\n  } catch (error) {\n    console.log(error);\n    return false;\n  }\n  // let host = givenURL.host;\n  // let path = givenURL.pathname;\n  return givenURL.protocol === \"http:\" || givenURL.protocol === \"https:\";\n}\n\nexport const getUrlParams = (query) =>\n  Array.from(new URLSearchParams(query)).reduce(\n    (p, [k, v]) =>\n      Object.assign({}, p, {\n        [k]: p[k] ? (Array.isArray(p[k]) ? p[k] : [p[k]]).concat(v) : v\n      }),\n    {}\n  );\n\nexport function getUrlParams2() {\n  let obj = {};\n  let searchString = location.search;\n  if (searchString) {\n    searchString = searchString.substring(1, searchString.length);\n    let tempArray = searchString.split(\"&\");\n    tempArray.forEach((item) => {\n      const splits = item.split(\"=\");\n      obj[splits[0]] = decodeURIComponent(splits[1]);\n    });\n  }\n  return obj;\n}\n\nexport function handleURLChange(cb) {\n  let previousUrl = \"\";\n  let observer = new MutationObserver(function (mutations) {\n    if (window.location.href !== previousUrl) {\n      previousUrl = window.location.href;\n      console.log(`URL data changed to ${window.location.href}`);\n      if (cb) cb(location.href);\n    }\n  });\n  observer.observe(document, {\n    attributes: true,\n    childList: true,\n    subtree: true\n  });\n}\n\nexport function handleHashChange(cb) {\n  window.addEventListener(\"hashchange\", () => {\n    cb(location.hash);\n  });\n}\n\nexport function handleHistoryChange(cb) {\n  // history.pushState(null, \"\", target);\n  // window.dispatchEvent(new PopStateEvent(\"popstate\"));\n  window.addEventListener(\"popstate\", cb);\n}\n","export function setTheme(theme?: string) {\n  theme = theme || localStorage.theme;\n  if (!theme) {\n    theme = window.matchMedia(\"(prefers-color-scheme: dark)\").matches\n      ? \"dark\"\n      : \"light\";\n    localStorage.theme = theme;\n  }\n  document.documentElement.classList.toggle(\"dark\", theme === \"dark\");\n}\n","export class DOMKeyboardKeyCode {\n  public static getEvent(event: KeyboardEvent): { code: number; key: string } {\n    // const key = event.code;\n    const code = event.keyCode || event.charCode;\n    return {\n      code: code,\n      key: DOMKeyboardKeyCode.codeToKey(code)\n    };\n  }\n\n  /**\n   * keyToCode(keyName: string)\n   *\n   * @param keyName {string} - The keyName of the key you wish to get the code for.\n   *\n   * @return {number} - Will be the keycode of the given keyName, or -1 if it does not exist in\n   *  the set of known keys.\n   */\n  public static keyToCode(keyName: string): number {\n    if (\n      Object.prototype.hasOwnProperty.call(\n        DOMKeyboardKeyCode.keyToCodes,\n        keyName\n      )\n    ) {\n      return DOMKeyboardKeyCode.keyToCodes[keyName];\n    } else {\n      return -1;\n    }\n  }\n\n  /**\n   * codeToKey(code: string)\n   *\n   * @param code {string} - The key code to lookup the keyname for\n   *\n   * @reaturn {string} - Will be the keyname of the given Code or '' if it does not\n   * exist on the set of known codes.\n   */\n  public static codeToKey(code: number): string {\n    if (\n      Object.prototype.hasOwnProperty.call(\n        DOMKeyboardKeyCode.codeToKeys,\n        code.toString()\n      )\n    ) {\n      return DOMKeyboardKeyCode.codeToKeys[code.toString()];\n    } else {\n      return \"\";\n    }\n  }\n\n  private static keyToCodes: { [index: string]: number } = {\n    \"0\": 48,\n    \"1\": 49,\n    \"2\": 50,\n    \"3\": 51,\n    \"4\": 52,\n    \"5\": 53,\n    \"6\": 54,\n    \"7\": 55,\n    \"8\": 56,\n    \"9\": 57,\n    spacebar: 32,\n    backspace: 8,\n    tab: 9,\n    enter: 13,\n    shift: 16,\n    ctrl: 17,\n    alt: 18,\n    pause_break: 19,\n    caps_lock: 20,\n    escape: 27,\n    page_up: 33,\n    page_down: 34,\n    end: 35,\n    home: 36,\n    left_arrow: 37,\n    up_arrow: 38,\n    right_arrow: 39,\n    down_arrow: 40,\n    insert: 45,\n    delete: 46,\n    a: 65,\n    b: 66,\n    c: 67,\n    d: 68,\n    e: 69,\n    f: 70,\n    g: 71,\n    h: 72,\n    i: 73,\n    j: 74,\n    k: 75,\n    l: 76,\n    m: 77,\n    n: 78,\n    o: 79,\n    p: 80,\n    q: 81,\n    r: 82,\n    s: 83,\n    t: 84,\n    u: 85,\n    v: 86,\n    w: 87,\n    x: 88,\n    y: 89,\n    z: 90,\n    left_window_key: 91,\n    right_window_key: 92,\n    select_key: 93,\n    numpad_0: 96,\n    numpad_1: 97,\n    numpad_2: 98,\n    numpad_3: 99,\n    numpad_4: 100,\n    numpad_5: 101,\n    numpad_6: 102,\n    numpad_7: 103,\n    numpad_8: 104,\n    numpad_9: 105,\n    multiply: 106,\n    add: 107,\n    subtract: 109,\n    decimal_point: 110,\n    divide: 111,\n    f1: 112,\n    f2: 113,\n    f3: 114,\n    f4: 115,\n    f5: 116,\n    f6: 117,\n    f7: 118,\n    f8: 119,\n    f9: 120,\n    f10: 121,\n    f11: 122,\n    f12: 123,\n    num_lock: 144,\n    scroll_lock: 145,\n    semi_colon: 186,\n    equal_sign: 187,\n    comma: 188,\n    dash: 189,\n    period: 190,\n    forward_slash: 191,\n    grave_accent: 192,\n    open_bracket: 219,\n    back_slash: 220,\n    close_braket: 221,\n    single_quote: 222\n  };\n\n  private static codeToKeys: { [index: string]: string } = {\n    \"8\": \"backspace\",\n    \"9\": \"tab\",\n    \"13\": \"enter\",\n    \"16\": \"shift\",\n    \"17\": \"ctrl\",\n    \"18\": \"alt\",\n    \"19\": \"pause_break\",\n    \"20\": \"caps_lock\",\n    \"27\": \"escape\",\n    \"32\": \"spacebar\",\n    \"33\": \"page_up\",\n    \"34\": \"page_down\",\n    \"35\": \"end\",\n    \"36\": \"home\",\n    \"37\": \"left_arrow\",\n    \"38\": \"up_arrow\",\n    \"39\": \"right_arrow\",\n    \"40\": \"down_arrow\",\n    \"45\": \"insert\",\n    \"46\": \"delete\",\n    \"48\": \"0\",\n    \"49\": \"1\",\n    \"50\": \"2\",\n    \"51\": \"3\",\n    \"52\": \"4\",\n    \"53\": \"5\",\n    \"54\": \"6\",\n    \"55\": \"7\",\n    \"56\": \"8\",\n    \"57\": \"9\",\n    \"65\": \"a\",\n    \"66\": \"b\",\n    \"67\": \"c\",\n    \"68\": \"d\",\n    \"69\": \"e\",\n    \"70\": \"f\",\n    \"71\": \"g\",\n    \"72\": \"h\",\n    \"73\": \"i\",\n    \"74\": \"j\",\n    \"75\": \"k\",\n    \"76\": \"l\",\n    \"77\": \"m\",\n    \"78\": \"n\",\n    \"79\": \"o\",\n    \"80\": \"p\",\n    \"81\": \"q\",\n    \"82\": \"r\",\n    \"83\": \"s\",\n    \"84\": \"t\",\n    \"85\": \"u\",\n    \"86\": \"v\",\n    \"87\": \"w\",\n    \"88\": \"x\",\n    \"89\": \"y\",\n    \"90\": \"z\",\n    \"91\": \"left_window_key\",\n    \"92\": \"right_window_key\",\n    \"93\": \"select_key\",\n    \"96\": \"numpad_0\",\n    \"97\": \"numpad_1\",\n    \"98\": \"numpad_2\",\n    \"99\": \"numpad_3\",\n    \"100\": \"numpad_4\",\n    \"101\": \"numpad_5\",\n    \"102\": \"numpad_6\",\n    \"103\": \"numpad_7\",\n    \"104\": \"numpad_8\",\n    \"105\": \"numpad_9\",\n    \"106\": \"multiply\",\n    \"107\": \"add\",\n    \"109\": \"subtract\",\n    \"110\": \"decimal_point\",\n    \"111\": \"divide\",\n    \"112\": \"f1\",\n    \"113\": \"f2\",\n    \"114\": \"f3\",\n    \"115\": \"f4\",\n    \"116\": \"f5\",\n    \"117\": \"f6\",\n    \"118\": \"f7\",\n    \"119\": \"f8\",\n    \"120\": \"f9\",\n    \"121\": \"f10\",\n    \"122\": \"f11\",\n    \"123\": \"f12\",\n    \"144\": \"num_lock\",\n    \"145\": \"scroll_lock\",\n    \"186\": \"semi_colon\",\n    \"187\": \"equal_sign\",\n    \"188\": \"comma\",\n    \"189\": \"dash\",\n    \"190\": \"period\",\n    \"191\": \"forward_slash\",\n    \"192\": \"grave_accent\",\n    \"219\": \"open_bracket\",\n    \"220\": \"back_slash\",\n    \"221\": \"close_braket\",\n    \"222\": \"single_quote\"\n  };\n}\n","export const copyToClipboard = (text) => navigator.clipboard.writeText(text);\n\nexport const getSelectedText = () => window.getSelection().toString();\n\n// Check if an element is focused\nexport const isFocus = (ele) => ele === document.activeElement;\n\n// Get all siblings of an element\nexport const siblings = (ele) =>\n  [].slice.call(ele.parentNode.children).filter((child) => child !== ele);\n\n// Check if the current tab is in view/focus\nexport const isTabInView = () => !document.hidden;\n\nexport const navigateBack = () => history.back();\nexport const navigateBack2 = () => history.go(-1);\n\nexport function loadScript(src) {\n  let script = document.createElement(\"script\");\n  script.type = \"text/javascript\";\n  script.src = src;\n  script.async = false;\n  document.body.appendChild(script);\n  script.onload = () => {};\n  script.onerror = () => {};\n}\n\n/**\n * 获取字符串的宽度\n * @text   将要被提取的原字符串\n * @fontSize  字符串显示时的字符大小，支持>=12\n * @fontWeight  字符串显示时的字符粗细\n */\nexport const getTextWidth = (text, fontSize, fontWeight = 400) => {\n  const span = document.createElement(\"span\");\n  span.style.visibility = \"hidden\";\n  span.style.padding = \"0\";\n  span.style.whiteSpace = \"nowrap\";\n  span.style.overflow = \"visible\";\n  span.style.fontSize = fontSize > 12 ? fontSize + \"px\" : \"12px\";\n  span.style.fontWeight = fontWeight.toString();\n  span.innerText = text;\n  document.body.appendChild(span);\n  const width = span.offsetWidth;\n  document.body.removeChild(span);\n  return width;\n};\n\n/**\n * 获取固定宽度的字符串，如果传入的text的宽度不够width,则返回原字符串\n * @text   将要被提取的原字符串\n * @width  想要提取的字符串长度\n * @fontSize  字符串显示时的字符大小，支持>=12\n * @fontWeight  字符串显示时的字符粗细\n * @isNeedEllipsis   当text的宽度大于width时是否需要省略号，会在传入的width基础上加，最后返回字符串宽度会>width\n */\nexport const getFixedWidthText = (\n  text,\n  width,\n  fontSize = 12,\n  fontWeight = 400,\n  isNeedEllipsis = true\n) => {\n  let returnText = \"\";\n  let oldText = \"\";\n  let newText = \"\";\n  if (!text || width < fontSize || typeof text !== \"string\") return returnText;\n  const arr = text.split(\"\");\n  const span = document.createElement(\"span\");\n  span.style.visibility = \"hidden\";\n  span.style.padding = \"0\";\n  span.style.whiteSpace = \"nowrap\";\n  span.style.overflow = \"visible\";\n  span.style.fontSize = fontSize > 12 ? fontSize + \"px\" : \"12px\";\n  span.style.fontWeight = fontWeight.toString();\n  document.body.appendChild(span);\n\n  for (let i = 0, l = arr.length; i < l; i++) {\n    const item = arr[i];\n    oldText = newText;\n    newText += item;\n    returnText = newText;\n    span.innerText = newText;\n    const nowWidth = span.offsetWidth;\n    if (nowWidth > width) {\n      if (isNeedEllipsis) {\n        returnText = oldText + \"...\";\n      } else {\n        returnText = oldText;\n      }\n      break;\n    }\n  }\n\n  document.body.removeChild(span);\n  return returnText;\n};\n\n/**\n * let sender = '<script>alert(\"abc\")</script>'; // 恶意代码\n    let safer = saferHTML`<p>${sender} has sent you a message.</p>`;\n    expect(safer).toBe(\n      '<p>&lt;script&gt;alert(\"abc\")&lt;/script&gt; has sent you a message.</p>'\n    );\n    [Arguments] {\n      '0': [ '<p>', ' has sent you a message.</p>' ],\n      '1': '<script>alert(\"abc\")</script>'\n    }\n*/\nexport function htmlEncode(templateData) {\n  let s = templateData[0];\n  for (let i = 1; i < arguments.length; i++) {\n    let arg = String(arguments[i]);\n\n    // Escape special characters in the substitution.\n    s += arg\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\")\n      .replace(/'/g, \"&#39;\");\n\n    // Don't escape special characters in the template.\n    s += templateData[i];\n  }\n  return s;\n}\n\nexport function htmlDecode(rawContent) {\n  var entities = {\n    \"&amp;\": \"&\",\n    \"&lt;\": \"<\",\n    \"&gt;\": \">\",\n    \"&quot;\": '\"',\n    \"&#39;\": \"'\"\n  };\n  for (var prop in entities) {\n    if (Object.hasOwnProperty.call(entities, prop)) {\n      rawContent = rawContent.replace(new RegExp(prop, \"g\"), entities[prop]);\n    }\n  }\n  return rawContent;\n}\n\nexport function templateCompile(template) {\n  const evalExpr = /<%=(.+?)%>/g;\n  const expr = /<%([\\s\\S]+?)%>/g;\n\n  template = template\n    .replace(evalExpr, \"`); \\n  echo( $1 ); \\n  echo(`\")\n    .replace(expr, \"`); \\n $1 \\n  echo(`\");\n\n  template = \"echo(`\" + template + \"`);\";\n\n  let script = `(function parse(data){\n      let output = \"\";\n\n      function echo(html){\n        output += html;\n      }\n\n      ${template}\n\n      return output;\n    })`;\n\n  return script;\n}\n\nexport function addEventListener(element, type, handler) {\n  // DOM2级事件\n  if (element.addEventListener) {\n    //true 捕获阶段 false 冒泡阶段\n    element.addEventListener(type, handler, false);\n  } else if (element.attachEvent) {\n    //IE\n    element.attachEvent(\"on\" + type, handler);\n  } else {\n    element[\"on\" + type] = handler;\n  }\n}\n\nexport function removeEventListener(element, type, handler) {\n  if (element.removeEventListener) {\n    element.removeEventListener(type, handler, false);\n  } else if (element.detachEvent) {\n    element.detachEvent(\"on\" + type, handler);\n  } else {\n    element[\"on\" + type] = null;\n  }\n}\n\nexport function stopPropagation(event) {\n  if (event.stopPropagation) {\n    event.stopPropagation();\n  } else {\n    event.cancelBubble = true;\n  }\n}\n\nexport function preventDefault(event) {\n  if (event.preventDefault) {\n    event.preventDefault;\n  } else {\n    event.returnValue = false;\n  }\n}\n\nexport function getTarget(event) {\n  return event.target || event.srcElement;\n}\n\nexport function getRelatedTarget(event) {\n  if (event.relatedTarget) {\n    return event.relatedTarget;\n  } else if (event.toElement) {\n    return event.toElement;\n  } else if (event.fromElement) {\n    return event.fromElement;\n  } else {\n    return null;\n  }\n}\n\nexport function isBrowserSupportFileAPI() {\n  if (window.File && window.FileReader && window.FileList && window.Blob) {\n    return true;\n  } else {\n    // console.log(\"The File APIs are not fully supported in this browser.\");\n    return false;\n  }\n}\n\nexport const waitForStyleSheetsLoaded = (document) =>\n  new Promise((resolve) => {\n    const links = Array.from(document.querySelectorAll(\"link[rel=stylesheet]\"));\n    let loadedCount = document.styleSheets.length ?? 0;\n    const checkAllLoaded = () => {\n      if (loadedCount >= links.length) {\n        resolve();\n        return true;\n      }\n      return false;\n    };\n    if (!checkAllLoaded()) {\n      links.forEach((stylesheet) => {\n        stylesheet.onload = () => {\n          loadedCount += 1;\n          checkAllLoaded();\n        };\n      });\n    }\n  });\n","// amount: 0-1\nexport type EasingFunction = (amount: number) => number;\n\nexport const Easing = {\n  // 线性\n  Linear: {\n    None: function (amount: number): number {\n      return amount;\n    }\n  },\n  // 二次\n  Quadratic: {\n    In: function (amount: number): number {\n      return amount * amount;\n    },\n    Out: function (amount: number): number {\n      return amount * (2 - amount);\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount;\n      }\n      return -0.5 * (--amount * (amount - 2) - 1);\n    }\n  },\n  // 三次\n  Cubic: {\n    In: function (amount: number): number {\n      return amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return --amount * amount * amount + 1;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount;\n      }\n      return 0.5 * ((amount -= 2) * amount * amount + 2);\n    }\n  },\n  // 四次\n  Quartic: {\n    In: function (amount: number): number {\n      return amount * amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return 1 - --amount * amount * amount * amount;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount * amount;\n      }\n      return -0.5 * ((amount -= 2) * amount * amount * amount - 2);\n    }\n  },\n  // 昆蒂克\n  Quintic: {\n    In: function (amount: number): number {\n      return amount * amount * amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return --amount * amount * amount * amount * amount + 1;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount * amount * amount;\n      }\n      return 0.5 * ((amount -= 2) * amount * amount * amount * amount + 2);\n    }\n  },\n  // 正弦曲线\n  Sinusoidal: {\n    In: function (amount: number): number {\n      return 1 - Math.sin(((1.0 - amount) * Math.PI) / 2);\n    },\n    Out: function (amount: number): number {\n      return Math.sin((amount * Math.PI) / 2);\n    },\n    InOut: function (amount: number): number {\n      return 0.5 * (1 - Math.sin(Math.PI * (0.5 - amount)));\n    }\n  },\n  // 指数\n  Exponential: {\n    In: function (amount: number): number {\n      return amount === 0 ? 0 : Math.pow(1024, amount - 1);\n    },\n    Out: function (amount: number): number {\n      return amount === 1 ? 1 : 1 - Math.pow(2, -10 * amount);\n    },\n    InOut: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      if ((amount *= 2) < 1) {\n        return 0.5 * Math.pow(1024, amount - 1);\n      }\n      return 0.5 * (-Math.pow(2, -10 * (amount - 1)) + 2);\n    }\n  },\n  // 圆\n  Circular: {\n    In: function (amount: number): number {\n      return 1 - Math.sqrt(1 - amount * amount);\n    },\n    Out: function (amount: number): number {\n      return Math.sqrt(1 - --amount * amount);\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return -0.5 * (Math.sqrt(1 - amount * amount) - 1);\n      }\n      return 0.5 * (Math.sqrt(1 - (amount -= 2) * amount) + 1);\n    }\n  },\n  // 松紧带\n  Elastic: {\n    In: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      return (\n        -Math.pow(2, 10 * (amount - 1)) * Math.sin((amount - 1.1) * 5 * Math.PI)\n      );\n    },\n    Out: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      return (\n        Math.pow(2, -10 * amount) * Math.sin((amount - 0.1) * 5 * Math.PI) + 1\n      );\n    },\n    InOut: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      amount *= 2;\n      if (amount < 1) {\n        return (\n          -0.5 *\n          Math.pow(2, 10 * (amount - 1)) *\n          Math.sin((amount - 1.1) * 5 * Math.PI)\n        );\n      }\n      return (\n        0.5 *\n          Math.pow(2, -10 * (amount - 1)) *\n          Math.sin((amount - 1.1) * 5 * Math.PI) +\n        1\n      );\n    }\n  },\n  // 后退\n  Back: {\n    In: function (amount: number): number {\n      const s = 1.70158;\n      return amount === 1 ? 1 : amount * amount * ((s + 1) * amount - s);\n    },\n    Out: function (amount: number): number {\n      const s = 1.70158;\n      return amount === 0 ? 0 : --amount * amount * ((s + 1) * amount + s) + 1;\n    },\n    InOut: function (amount: number): number {\n      const s = 1.70158 * 1.525;\n      if ((amount *= 2) < 1) {\n        return 0.5 * (amount * amount * ((s + 1) * amount - s));\n      }\n      return 0.5 * ((amount -= 2) * amount * ((s + 1) * amount + s) + 2);\n    }\n  },\n  // 弹跳\n  Bounce: {\n    In: function (amount: number): number {\n      return 1 - Easing.Bounce.Out(1 - amount);\n    },\n    Out: function (amount: number): number {\n      if (amount < 1 / 2.75) {\n        return 7.5625 * amount * amount;\n      } else if (amount < 2 / 2.75) {\n        return 7.5625 * (amount -= 1.5 / 2.75) * amount + 0.75;\n      } else if (amount < 2.5 / 2.75) {\n        return 7.5625 * (amount -= 2.25 / 2.75) * amount + 0.9375;\n      } else {\n        return 7.5625 * (amount -= 2.625 / 2.75) * amount + 0.984375;\n      }\n    },\n    InOut: function (amount: number): number {\n      if (amount < 0.5) {\n        return Easing.Bounce.In(amount * 2) * 0.5;\n      }\n      return Easing.Bounce.Out(amount * 2 - 1) * 0.5 + 0.5;\n    }\n  },\n  generatePow: function (power = 4): {\n    In(amount: number): number;\n    Out(amount: number): number;\n    InOut(amount: number): number;\n  } {\n    power = power < Number.EPSILON ? Number.EPSILON : power;\n    power = power > 10000 ? 10000 : power;\n    return {\n      In: function (amount: number): number {\n        return amount ** power;\n      },\n      Out: function (amount: number): number {\n        return 1 - (1 - amount) ** power;\n      },\n      InOut: function (amount: number): number {\n        if (amount < 0.5) {\n          return (amount * 2) ** power / 2;\n        }\n        return (1 - (2 - amount * 2) ** power) / 2 + 0.5;\n      }\n    };\n  }\n};\n\nexport default Easing;\n","let now: () => number;\n\nif (\n  typeof self === \"undefined\" &&\n  typeof process !== \"undefined\" &&\n  process.hrtime\n) {\n  now = function (): number {\n    const time = process.hrtime();\n\n    // Convert [seconds, nanoseconds] to milliseconds.\n    return time[0] * 1000 + time[1] / 1000000;\n  };\n}\n// In a browser, use self.performance.now if it is available.\nelse if (\n  typeof self !== \"undefined\" &&\n  self.performance !== undefined &&\n  self.performance.now !== undefined\n) {\n  // This must be bound, because directly assigning this function\n  // leads to an invocation exception in Chrome.\n  now = self.performance.now.bind(self.performance);\n} else if (Date.now !== undefined) {\n  now = Date.now;\n} else {\n  now = function (): number {\n    return new Date().getTime();\n  };\n}\n\nexport default now;\n","import now from \"./Now\";\nimport type { Tween, UnknownProps } from \"./Tween\";\n\n/**\n * Controlling groups of tweens\n *\n * Using the TWEEN singleton to manage your tweens can cause issues in large apps with many components.\n * In these cases, you may want to create your own smaller groups of tween\n */\nexport default class Group {\n  private _tweens: {\n    [key: string]: Tween<UnknownProps>;\n  } = {};\n\n  private _tweensAddedDuringUpdate: {\n    [key: string]: Tween<UnknownProps>;\n  } = {};\n\n  getAll(): Array<Tween<UnknownProps>> {\n    return Object.keys(this._tweens).map((tweenId) => {\n      return this._tweens[tweenId];\n    });\n  }\n\n  removeAll(): void {\n    this._tweens = {};\n  }\n\n  add(tween: Tween<UnknownProps>): void {\n    this._tweens[tween.getId()] = tween;\n    this._tweensAddedDuringUpdate[tween.getId()] = tween;\n  }\n\n  remove(tween: Tween<UnknownProps>): void {\n    delete this._tweens[tween.getId()];\n    delete this._tweensAddedDuringUpdate[tween.getId()];\n  }\n\n  update(time: number = now(), preserve = false): boolean {\n    let tweenIds = Object.keys(this._tweens);\n    if (tweenIds.length === 0) {\n      return false;\n    }\n    while (tweenIds.length > 0) {\n      this._tweensAddedDuringUpdate = {};\n      for (let i = 0; i < tweenIds.length; i++) {\n        const tween = this._tweens[tweenIds[i]];\n        const autoStart = !preserve;\n        if (tween && tween.update(time, autoStart) === false && !preserve) {\n          delete this._tweens[tweenIds[i]];\n        }\n      }\n      tweenIds = Object.keys(this._tweensAddedDuringUpdate);\n    }\n    return true;\n  }\n}\n","export type InterpolationFunction = (\n  targetValue: number[],\n  easingResult: number\n) => number;\n\nexport const Interpolation = {\n  Linear: function (v: number[], k: number): number {\n    const m = v.length - 1;\n    const f = m * k;\n    const i = Math.floor(f);\n    const fn = Interpolation.Utils.Linear;\n    if (k < 0) {\n      return fn(v[0], v[1], f);\n    }\n    if (k > 1) {\n      return fn(v[m], v[m - 1], m - f);\n    }\n    return fn(v[i], v[i + 1 > m ? m : i + 1], f - i);\n  },\n  // 贝塞尔\n  Bezier: function (v: number[], k: number): number {\n    let b = 0;\n    const n = v.length - 1;\n    const pw = Math.pow;\n    const bn = Interpolation.Utils.Bernstein;\n    for (let i = 0; i <= n; i++) {\n      b += pw(1 - k, n - i) * pw(k, i) * v[i] * bn(n, i);\n    }\n    return b;\n  },\n  // 卡特穆尔·罗姆\n  CatmullRom: function (v: number[], k: number): number {\n    const m = v.length - 1;\n    let f = m * k;\n    let i = Math.floor(f);\n    const fn = Interpolation.Utils.CatmullRom;\n    if (v[0] === v[m]) {\n      if (k < 0) {\n        i = Math.floor((f = m * (1 + k)));\n      }\n      return fn(\n        v[(i - 1 + m) % m],\n        v[i],\n        v[(i + 1) % m],\n        v[(i + 2) % m],\n        f - i\n      );\n    } else {\n      if (k < 0) {\n        return v[0] - (fn(v[0], v[0], v[1], v[1], -f) - v[0]);\n      }\n      if (k > 1) {\n        return v[m] - (fn(v[m], v[m], v[m - 1], v[m - 1], f - m) - v[m]);\n      }\n      return fn(\n        v[i ? i - 1 : 0],\n        v[i],\n        v[m < i + 1 ? m : i + 1],\n        v[m < i + 2 ? m : i + 2],\n        f - i\n      );\n    }\n  },\n\n  Utils: {\n    Linear: function (p0: number, p1: number, t: number): number {\n      return (p1 - p0) * t + p0;\n    },\n    Bernstein: function (n: number, i: number): number {\n      const fc = Interpolation.Utils.Factorial;\n      return fc(n) / fc(i) / fc(n - i);\n    },\n    Factorial: (function () {\n      const a = [1];\n      return function (n: number): number {\n        let s = 1;\n        if (a[n]) {\n          return a[n];\n        }\n        for (let i = n; i > 1; i--) {\n          s *= i;\n        }\n        a[n] = s;\n        return s;\n      };\n    })(),\n    CatmullRom: function (\n      p0: number,\n      p1: number,\n      p2: number,\n      p3: number,\n      t: number\n    ): number {\n      const v0 = (p2 - p0) * 0.5;\n      const v1 = (p3 - p1) * 0.5;\n      const t2 = t * t;\n      const t3 = t * t2;\n      return (\n        (2 * p1 - 2 * p2 + v0 + v1) * t3 +\n        (-3 * p1 + 3 * p2 - 2 * v0 - v1) * t2 +\n        v0 * t +\n        p1\n      );\n    }\n  }\n};\n\nexport default Interpolation;\n","export default class Sequence {\n  private static _nextId = 0;\n\n  static nextId(): number {\n    return Sequence._nextId++;\n  }\n}\n","import Group from \"./Group\";\n\nexport const mainGroup = new Group();\n","import Easing from \"./Easing\";\nimport Interpolation from \"./Interpolation\";\nimport { mainGroup } from \"./mainGroup\";\nimport Sequence from \"./Sequence\";\nimport now from \"./Now\";\n\nimport type { EasingFunction } from \"./Easing\";\nimport type { InterpolationFunction } from \"./Interpolation\";\nimport type Group from \"./Group\";\n\nexport type UnknownProps = Record<string, any>;\n\nexport class Tween<T extends UnknownProps> {\n  // id\n  private _id = Sequence.nextId();\n\n  // 是都正在执行\n  private _isPlaying = false;\n  // 动画开始时间\n  private _startTime = 0;\n  // 动画延迟开始时间\n  private _delayTime = 0;\n  // 动画持续时间\n  private _duration = 1000;\n\n  // 是否暂停\n  private _isPaused = false;\n  // 暂停开始时间\n  private _pauseStart = 0;\n\n  // 初始值\n  private _valuesStart: UnknownProps = {};\n  // 结束值\n  private _valuesEnd: Record<string, number | string> = {};\n  private _valuesStartRepeat: UnknownProps = {};\n\n  // 动画重复次数初始值\n  private _initialRepeat = 0;\n  // 动画重复次数剩余值\n  private _repeat = 0;\n  // 动画重复间隔\n  private _repeatDelayTime?: number;\n  // 动画重复时是否倒置\n  private _yoyo = false;\n  // 是否倒置运行\n  private _reversed = false;\n\n  // 缓动函数\n  private _easingFunction: EasingFunction = Easing.Linear.None;\n  // 插值函数\n  private _interpolationFunction: InterpolationFunction = Interpolation.Linear;\n\n  // 链式动画数组\n  private _chainedTweens: Array<Tween<any>> = [];\n  private _isChainStopped = false;\n\n  // 动画开始hook\n  private _onStartCallback?: (object: T) => void;\n  // 动画开始hook是否已被执行\n  private _onStartCallbackFired = false;\n  // 动画每轮repeat开始hook\n  private _onEveryStartCallback?: (object: T) => void;\n  // 动画每轮repeat开始hook是否已被执行\n  private _onEveryStartCallbackFired = false;\n  // 动画更新hook\n  private _onUpdateCallback?: (object: T, elapsed: number) => void;\n  // 动画repeat hook\n  private _onRepeatCallback?: (object: T) => void;\n  // 动画完成hook\n  private _onCompleteCallback?: (object: T) => void;\n  // 动画结束hook\n  private _onStopCallback?: (object: T) => void;\n  // 是否强制结束动画\n  private _goToEnd = false;\n\n  constructor(private _object: T, private _group: Group | false = mainGroup) {}\n\n  getId(): number {\n    return this._id;\n  }\n\n  isPlaying(): boolean {\n    return this._isPlaying;\n  }\n\n  isPaused(): boolean {\n    return this._isPaused;\n  }\n\n  to(properties: UnknownProps, duration?: number): this {\n    this._valuesEnd = Object.create(properties);\n    if (duration !== undefined) {\n      this._duration = duration;\n    }\n    return this;\n  }\n\n  duration(d = 1000): this {\n    this._duration = d;\n    return this;\n  }\n\n  start(time: number = now()): this {\n    if (this._isPlaying) {\n      return this;\n    }\n    this._group && this._group.add(this as any);\n    this._repeat = this._initialRepeat;\n    if (this._reversed) {\n      // If we were reversed (f.e. using the yoyo feature) then we need to\n      // flip the tween direction back to forward.\n      this._reversed = false;\n      for (const property in this._valuesStartRepeat) {\n        this._swapEndStartRepeatValues(property);\n        this._valuesStart[property] = this._valuesStartRepeat[property];\n      }\n    }\n    this._isPlaying = true;\n    this._isPaused = false;\n    this._onStartCallbackFired = false;\n    this._onEveryStartCallbackFired = false;\n    this._isChainStopped = false;\n    this._startTime = time;\n    this._startTime += this._delayTime;\n    this._setupProperties(\n      this._object,\n      this._valuesStart,\n      this._valuesEnd,\n      this._valuesStartRepeat\n    );\n    return this;\n  }\n\n  private _setupProperties(\n    _object: UnknownProps,\n    _valuesStart: UnknownProps,\n    _valuesEnd: UnknownProps,\n    _valuesStartRepeat: UnknownProps\n  ): void {\n    for (const property in _valuesEnd) {\n      const startValue = _object[property];\n      const startValueIsArray = Array.isArray(startValue);\n      const propType = startValueIsArray ? \"array\" : typeof startValue;\n      const isInterpolationList =\n        !startValueIsArray && Array.isArray(_valuesEnd[property]);\n      // If `to()` specifies a property that doesn't exist in the source object,\n      // we should not set that property in the object\n      if (propType === \"undefined\" || propType === \"function\") {\n        continue;\n      }\n      // Check if an Array was provided as property value\n      if (isInterpolationList) {\n        let endValues = _valuesEnd[property] as Array<number | string>;\n        if (endValues.length === 0) {\n          continue;\n        }\n        // handle an array of relative values\n        endValues = endValues.map(\n          this._handleRelativeValue.bind(this, startValue as number)\n        );\n        // Create a local copy of the Array with the start value at the front\n        _valuesEnd[property] = [startValue].concat(endValues);\n      }\n      // handle the deepness of the values\n      if (\n        (propType === \"object\" || startValueIsArray) &&\n        startValue &&\n        !isInterpolationList\n      ) {\n        _valuesStart[property] = startValueIsArray ? [] : {};\n        for (const prop in startValue as object) {\n          _valuesStart[property][prop] = startValue[prop];\n        }\n        _valuesStartRepeat[property] = startValueIsArray ? [] : {}; // TODO? repeat nested values? And yoyo? And array values?\n        this._setupProperties(\n          startValue,\n          _valuesStart[property],\n          _valuesEnd[property],\n          _valuesStartRepeat[property]\n        );\n      } else {\n        // Save the starting value, but only once.\n        if (typeof _valuesStart[property] === \"undefined\") {\n          _valuesStart[property] = startValue;\n        }\n        if (!startValueIsArray) {\n          _valuesStart[property] *= 1.0; // Ensures we're using numbers, not strings\n        }\n        if (isInterpolationList) {\n          _valuesStartRepeat[property] = _valuesEnd[property].slice().reverse();\n        } else {\n          _valuesStartRepeat[property] = _valuesStart[property] || 0;\n        }\n      }\n    }\n  }\n\n  stop(): this {\n    if (!this._isChainStopped) {\n      this._isChainStopped = true;\n      this.stopChainedTweens();\n    }\n    if (!this._isPlaying) {\n      return this;\n    }\n    this._group && this._group.remove(this as any);\n    this._isPlaying = false;\n    this._isPaused = false;\n    if (this._onStopCallback) {\n      this._onStopCallback(this._object);\n    }\n    return this;\n  }\n\n  end(): this {\n    this._goToEnd = true;\n    this.update(Infinity);\n    return this;\n  }\n\n  pause(time: number = now()): this {\n    if (this._isPaused || !this._isPlaying) {\n      return this;\n    }\n    this._isPaused = true;\n    this._pauseStart = time;\n    this._group && this._group.remove(this as any);\n    return this;\n  }\n\n  resume(time: number = now()): this {\n    if (!this._isPaused || !this._isPlaying) {\n      return this;\n    }\n    this._isPaused = false;\n    this._startTime += time - this._pauseStart;\n    this._pauseStart = 0;\n    this._group && this._group.add(this as any);\n    return this;\n  }\n\n  stopChainedTweens(): this {\n    for (\n      let i = 0, numChainedTweens = this._chainedTweens.length;\n      i < numChainedTweens;\n      i++\n    ) {\n      this._chainedTweens[i].stop();\n    }\n    return this;\n  }\n\n  group(group = mainGroup): this {\n    this._group = group;\n    return this;\n  }\n\n  delay(amount = 0): this {\n    this._delayTime = amount;\n    return this;\n  }\n\n  repeat(times = 0): this {\n    this._initialRepeat = times;\n    this._repeat = times;\n    return this;\n  }\n\n  repeatDelay(amount?: number): this {\n    this._repeatDelayTime = amount;\n    return this;\n  }\n\n  yoyo(yoyo = false): this {\n    this._yoyo = yoyo;\n    return this;\n  }\n\n  easing(easingFunction: EasingFunction = Easing.Linear.None): this {\n    this._easingFunction = easingFunction;\n    return this;\n  }\n\n  interpolation(\n    interpolationFunction: InterpolationFunction = Interpolation.Linear\n  ): this {\n    this._interpolationFunction = interpolationFunction;\n    return this;\n  }\n\n  chain(...tweens: Array<Tween<any>>): this {\n    this._chainedTweens = tweens;\n    return this;\n  }\n\n  onStart(callback?: (object: T) => void): this {\n    this._onStartCallback = callback;\n    return this;\n  }\n\n  onEveryStart(callback?: (object: T) => void): this {\n    this._onEveryStartCallback = callback;\n    return this;\n  }\n\n  onUpdate(callback?: (object: T, elapsed: number) => void): this {\n    this._onUpdateCallback = callback;\n    return this;\n  }\n\n  onRepeat(callback?: (object: T) => void): this {\n    this._onRepeatCallback = callback;\n    return this;\n  }\n\n  onComplete(callback?: (object: T) => void): this {\n    this._onCompleteCallback = callback;\n    return this;\n  }\n\n  onStop(callback?: (object: T) => void): this {\n    this._onStopCallback = callback;\n    return this;\n  }\n\n  /**\n   * @returns true if the tween is still playing after the update, false otherwise\n   */\n  update(time = now(), autoStart = true): boolean {\n    if (this._isPaused) return true;\n    let property;\n    let elapsed;\n    const endTime = this._startTime + this._duration;\n    if (!this._goToEnd && !this._isPlaying) {\n      if (time > endTime) return false;\n      if (autoStart) this.start(time);\n    }\n    this._goToEnd = false;\n    if (time < this._startTime) {\n      return true;\n    }\n    if (this._onStartCallbackFired === false) {\n      if (this._onStartCallback) {\n        this._onStartCallback(this._object);\n      }\n      this._onStartCallbackFired = true;\n    }\n    if (this._onEveryStartCallbackFired === false) {\n      if (this._onEveryStartCallback) {\n        this._onEveryStartCallback(this._object);\n      }\n      this._onEveryStartCallbackFired = true;\n    }\n    elapsed = (time - this._startTime) / this._duration;\n    elapsed = this._duration === 0 || elapsed > 1 ? 1 : elapsed;\n    const value = this._easingFunction(elapsed);\n    this._updateProperties(\n      this._object,\n      this._valuesStart,\n      this._valuesEnd,\n      value\n    );\n    if (this._onUpdateCallback) {\n      this._onUpdateCallback(this._object, elapsed);\n    }\n    if (elapsed === 1) {\n      if (this._repeat > 0) {\n        if (isFinite(this._repeat)) {\n          this._repeat--;\n        }\n        // Reassign starting values, restart by making startTime = now\n        for (property in this._valuesStartRepeat) {\n          if (!this._yoyo && typeof this._valuesEnd[property] === \"string\") {\n            this._valuesStartRepeat[property] =\n              this._valuesStartRepeat[property] +\n              parseFloat(this._valuesEnd[property] as string);\n          }\n          if (this._yoyo) {\n            this._swapEndStartRepeatValues(property);\n          }\n          this._valuesStart[property] = this._valuesStartRepeat[property];\n        }\n        if (this._yoyo) {\n          this._reversed = !this._reversed;\n        }\n        if (this._repeatDelayTime !== undefined) {\n          this._startTime = time + this._repeatDelayTime;\n        } else {\n          this._startTime = time + this._delayTime;\n        }\n        if (this._onRepeatCallback) {\n          this._onRepeatCallback(this._object);\n        }\n        this._onEveryStartCallbackFired = false;\n        return true;\n      } else {\n        if (this._onCompleteCallback) {\n          this._onCompleteCallback(this._object);\n        }\n        for (\n          let i = 0, numChainedTweens = this._chainedTweens.length;\n          i < numChainedTweens;\n          i++\n        ) {\n          // Make the chained tweens start exactly at the time they should,\n          // even if the `update()` method was called way past the duration of the tween\n          this._chainedTweens[i].start(this._startTime + this._duration);\n        }\n        this._isPlaying = false;\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private _updateProperties(\n    _object: UnknownProps,\n    _valuesStart: UnknownProps,\n    _valuesEnd: UnknownProps,\n    value: number\n  ): void {\n    for (const property in _valuesEnd) {\n      if (_valuesStart[property] === undefined) {\n        continue;\n      }\n      const start = _valuesStart[property] || 0;\n      let end = _valuesEnd[property];\n      const startIsArray = Array.isArray(_object[property]);\n      const endIsArray = Array.isArray(end);\n      const isInterpolationList = !startIsArray && endIsArray;\n      if (isInterpolationList) {\n        _object[property] = this._interpolationFunction(\n          end as Array<number>,\n          value\n        );\n      } else if (typeof end === \"object\" && end) {\n        this._updateProperties(_object[property], start, end, value);\n      } else {\n        // Parses relative end values with start as base (e.g.: +10, -3)\n        end = this._handleRelativeValue(\n          start as number,\n          end as number | string\n        );\n        if (typeof end === \"number\") {\n          _object[property] = start + (end - start) * value;\n        }\n      }\n    }\n  }\n\n  private _handleRelativeValue(start: number, end: number | string): number {\n    if (typeof end !== \"string\") {\n      return end;\n    }\n    if (end.charAt(0) === \"+\" || end.charAt(0) === \"-\") {\n      return start + parseFloat(end);\n    } else {\n      return parseFloat(end);\n    }\n  }\n\n  private _swapEndStartRepeatValues(property: string): void {\n    const tmp = this._valuesStartRepeat[property];\n    const endValue = this._valuesEnd[property];\n    if (typeof endValue === \"string\") {\n      this._valuesStartRepeat[property] =\n        this._valuesStartRepeat[property] + parseFloat(endValue);\n    } else {\n      this._valuesStartRepeat[property] = this._valuesEnd[property];\n    }\n    this._valuesEnd[property] = tmp;\n  }\n}\n\nexport default Tween;\n","import Easing from \"./Easing\";\nimport Group from \"./Group\";\nimport Interpolation from \"./Interpolation\";\nimport now from \"./Now\";\nimport Sequence from \"./Sequence\";\nimport Tween from \"./Tween\";\nimport { mainGroup } from \"./mainGroup\";\n\nconst nextId = Sequence.nextId;\n\n// This is the best way to export things in a way that's compatible with both ES\n// Modules and CommonJS, without build hacks, and so as not to break the\n// existing API.\n// https://github.com/rollup/rollup/issues/1961#issuecomment-423037881\nconst getAll = mainGroup.getAll.bind(mainGroup);\nconst removeAll = mainGroup.removeAll.bind(mainGroup);\nconst add = mainGroup.add.bind(mainGroup);\nconst remove = mainGroup.remove.bind(mainGroup);\nconst update = mainGroup.update.bind(mainGroup);\n\nexport const TWEEN = {\n  Easing,\n  Group,\n  Interpolation,\n  now,\n  Sequence,\n  nextId,\n  Tween,\n  getAll,\n  removeAll,\n  add,\n  remove,\n  update\n};\nexport default TWEEN;\n","import TWEEN from \"./tween/\";\n\n(function () {\n  let lastTime = 0;\n  // const vendors = [\"ms\", \"moz\", \"webkit\", \"o\"];\n  // for (let x = 0; x < vendors.length && !window.requestAnimationFrame; ++x) {\n  //   window.requestAnimationFrame = window[vendors[x] + \"RequestAnimationFrame\"];\n  //   window.cancelAnimationFrame =\n  //     window[vendors[x] + \"CancelAnimationFrame\"] ||\n  //     window[vendors[x] + \"CancelRequestAnimationFrame\"];\n  // }\n  if (!window.requestAnimationFrame)\n    window.requestAnimationFrame = function (callback) {\n      const currTime = new Date().getTime();\n      const timeToCall = Math.max(0, 16 - (currTime - lastTime));\n      const id = window.setTimeout(function () {\n        callback(currTime + timeToCall);\n      }, timeToCall);\n      lastTime = currTime + timeToCall;\n      return id;\n    };\n  if (!window.cancelAnimationFrame)\n    window.cancelAnimationFrame = function (id) {\n      clearTimeout(id);\n    };\n})();\n\nexport const animateInWeb = (render: (durationTime: number) => void) => {\n  function animate(durationTime: number) {\n    window.requestAnimationFrame(animate);\n    render(durationTime);\n  }\n  window.requestAnimationFrame(animate);\n};\n\nexport const animateCanvas = (\n  canvasID: string,\n  render: (ctx: CanvasRenderingContext2D, durationTime: number) => void\n) => {\n  const canvas = document.getElementById(canvasID) as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  animateInWeb((durationTime) => {\n    ctx.clearRect(0, 0, canvas.width, canvas.height);\n    render(ctx, durationTime);\n  });\n};\n\n// /apps/animate.html\nexport const animateTWEEN = () => {\n  animateInWeb((durationTime) => TWEEN.update(durationTime));\n};\n","\r\n\r\nvar UZIP = {};\r\nif(typeof module == \"object\") module.exports = UZIP;\r\n\r\n\r\nUZIP[\"parse\"] = function(buf, onlyNames)\t// ArrayBuffer\r\n{\r\n\tvar rUs = UZIP.bin.readUshort, rUi = UZIP.bin.readUint, o = 0, out = {};\r\n\tvar data = new Uint8Array(buf);\r\n\tvar eocd = data.length-4;\r\n\t\r\n\twhile(rUi(data, eocd)!=0x06054b50) eocd--;\r\n\t\r\n\tvar o = eocd;\r\n\to+=4;\t// sign  = 0x06054b50\r\n\to+=4;  // disks = 0;\r\n\tvar cnu = rUs(data, o);  o+=2;\r\n\tvar cnt = rUs(data, o);  o+=2;\r\n\t\t\t\r\n\tvar csize = rUi(data, o);  o+=4;\r\n\tvar coffs = rUi(data, o);  o+=4;\r\n\t\r\n\to = coffs;\r\n\tfor(var i=0; i<cnu; i++)\r\n\t{\r\n\t\tvar sign = rUi(data, o);  o+=4;\r\n\t\to += 4;  // versions;\r\n\t\to += 4;  // flag + compr\r\n\t\to += 4;  // time\r\n\t\t\r\n\t\tvar crc32 = rUi(data, o);  o+=4;\r\n\t\tvar csize = rUi(data, o);  o+=4;\r\n\t\tvar usize = rUi(data, o);  o+=4;\r\n\t\t\r\n\t\tvar nl = rUs(data, o), el = rUs(data, o+2), cl = rUs(data, o+4);  o += 6;  // name, extra, comment\r\n\t\to += 8;  // disk, attribs\r\n\t\t\r\n\t\tvar roff = rUi(data, o);  o+=4;\r\n\t\to += nl + el + cl;\r\n\t\t\r\n\t\tUZIP._readLocal(data, roff, out, csize, usize, onlyNames);\r\n\t}\r\n\t//console.log(out);\r\n\treturn out;\r\n}\r\n\r\nUZIP._readLocal = function(data, o, out, csize, usize, onlyNames)\r\n{\r\n\tvar rUs = UZIP.bin.readUshort, rUi = UZIP.bin.readUint;\r\n\tvar sign  = rUi(data, o);  o+=4;\r\n\tvar ver   = rUs(data, o);  o+=2;\r\n\tvar gpflg = rUs(data, o);  o+=2;\r\n\t//if((gpflg&8)!=0) throw \"unknown sizes\";\r\n\tvar cmpr  = rUs(data, o);  o+=2;\r\n\t\r\n\tvar time  = rUi(data, o);  o+=4;\r\n\t\r\n\tvar crc32 = rUi(data, o);  o+=4;\r\n\t//var csize = rUi(data, o);  o+=4;\r\n\t//var usize = rUi(data, o);  o+=4;\r\n\to+=8;\r\n\t\t\r\n\tvar nlen  = rUs(data, o);  o+=2;\r\n\tvar elen  = rUs(data, o);  o+=2;\r\n\t\t\r\n\tvar name =  UZIP.bin.readUTF8(data, o, nlen);  o+=nlen;  //console.log(name);\r\n\to += elen;\r\n\t\t\t\r\n\t//console.log(sign.toString(16), ver, gpflg, cmpr, crc32.toString(16), \"csize, usize\", csize, usize, nlen, elen, name, o);\r\n\tif(onlyNames) {  out[name]={size:usize, csize:csize};  return;  }   \r\n\tvar file = new Uint8Array(data.buffer, o);\r\n\tif(false) {}\r\n\telse if(cmpr==0) out[name] = new Uint8Array(file.buffer.slice(o, o+csize));\r\n\telse if(cmpr==8) {\r\n\t\tvar buf = new Uint8Array(usize);  UZIP.inflateRaw(file, buf);\r\n\t\t/*var nbuf = pako[\"inflateRaw\"](file);\r\n\t\tif(usize>8514000) {\r\n\t\t\t//console.log(PUtils.readASCII(buf , 8514500, 500));\r\n\t\t\t//console.log(PUtils.readASCII(nbuf, 8514500, 500));\r\n\t\t}\r\n\t\tfor(var i=0; i<buf.length; i++) if(buf[i]!=nbuf[i]) {  console.log(buf.length, nbuf.length, usize, i);  throw \"e\";  }\r\n\t\t*/\r\n\t\tout[name] = buf;\r\n\t}\r\n\telse throw \"unknown compression method: \"+cmpr;\r\n}\r\n\r\nUZIP.inflateRaw = function(file, buf) {  return UZIP.F.inflate(file, buf);  }\r\nUZIP.inflate    = function(file, buf) { \r\n\tvar CMF = file[0], FLG = file[1];\r\n\tvar CM = (CMF&15), CINFO = (CMF>>>4);\r\n\t//console.log(CM, CINFO,CMF,FLG);\r\n\treturn UZIP.inflateRaw(new Uint8Array(file.buffer, file.byteOffset+2, file.length-6), buf);  \r\n}\r\nUZIP.deflate    = function(data, opts/*, buf, off*/) {\r\n\tif(opts==null) opts={level:6};\r\n\tvar off=0, buf=new Uint8Array(50+Math.floor(data.length*1.1));\r\n\tbuf[off]=120;  buf[off+1]=156;  off+=2;\r\n\toff = UZIP.F.deflateRaw(data, buf, off, opts.level);\r\n\tvar crc = UZIP.adler(data, 0, data.length);\r\n\tbuf[off+0]=((crc>>>24)&255); \r\n\tbuf[off+1]=((crc>>>16)&255); \r\n\tbuf[off+2]=((crc>>> 8)&255); \r\n\tbuf[off+3]=((crc>>> 0)&255); \t\r\n\treturn new Uint8Array(buf.buffer, 0, off+4);\r\n}\r\nUZIP.deflateRaw = function(data, opts) {\r\n\tif(opts==null) opts={level:6};\r\n\tvar buf=new Uint8Array(50+Math.floor(data.length*1.1));\r\n\tvar off = UZIP.F.deflateRaw(data, buf, off, opts.level);\r\n\treturn new Uint8Array(buf.buffer, 0, off);\r\n}\r\n\r\n\r\nUZIP.encode = function(obj, noCmpr) {\r\n\tif(noCmpr==null) noCmpr=false;\r\n\tvar tot = 0, wUi = UZIP.bin.writeUint, wUs = UZIP.bin.writeUshort;\r\n\tvar zpd = {};\r\n\tfor(var p in obj) {  var cpr = !UZIP._noNeed(p) && !noCmpr, buf = obj[p], crc = UZIP.crc.crc(buf,0,buf.length); \r\n\t\tzpd[p] = {  cpr:cpr, usize:buf.length, crc:crc, file: (cpr ? UZIP.deflateRaw(buf) : buf)  };  }\r\n\t\r\n\tfor(var p in zpd) tot += zpd[p].file.length + 30 + 46 + 2*UZIP.bin.sizeUTF8(p);\r\n\ttot +=  22;\r\n\t\r\n\tvar data = new Uint8Array(tot), o = 0;\r\n\tvar fof = []\r\n\t\r\n\tfor(var p in zpd) {\r\n\t\tvar file = zpd[p];  fof.push(o);\r\n\t\to = UZIP._writeHeader(data, o, p, file, 0);\r\n\t}\r\n\tvar i=0, ioff = o;\r\n\tfor(var p in zpd) {\r\n\t\tvar file = zpd[p];  fof.push(o);\r\n\t\to = UZIP._writeHeader(data, o, p, file, 1, fof[i++]);\t\t\r\n\t}\r\n\tvar csize = o-ioff;\r\n\t\r\n\twUi(data, o, 0x06054b50);  o+=4;\r\n\to += 4;  // disks\r\n\twUs(data, o, i);  o += 2;\r\n\twUs(data, o, i);  o += 2;\t// number of c d records\r\n\twUi(data, o, csize);  o += 4;\r\n\twUi(data, o, ioff );  o += 4;\r\n\to += 2;\r\n\treturn data.buffer;\r\n}\r\n// no need to compress .PNG, .ZIP, .JPEG ....\r\nUZIP._noNeed = function(fn) {  var ext = fn.split(\".\").pop().toLowerCase();  return \"png,jpg,jpeg,zip\".indexOf(ext)!=-1;  }\r\n\r\nUZIP._writeHeader = function(data, o, p, obj, t, roff)\r\n{\r\n\tvar wUi = UZIP.bin.writeUint, wUs = UZIP.bin.writeUshort;\r\n\tvar file = obj.file;\r\n\t\r\n\twUi(data, o, t==0 ? 0x04034b50 : 0x02014b50);  o+=4; // sign\r\n\tif(t==1) o+=2;  // ver made by\r\n\twUs(data, o, 20);  o+=2;\t// ver\r\n\twUs(data, o,  0);  o+=2;    // gflip\r\n\twUs(data, o,  obj.cpr?8:0);  o+=2;\t// cmpr\r\n\t\t\r\n\twUi(data, o,  0);  o+=4;\t// time\t\t\r\n\twUi(data, o, obj.crc);  o+=4;\t// crc32\r\n\twUi(data, o, file.length);  o+=4;\t// csize\r\n\twUi(data, o, obj.usize);  o+=4;\t// usize\r\n\t\t\r\n\twUs(data, o, UZIP.bin.sizeUTF8(p));  o+=2;\t// nlen\r\n\twUs(data, o, 0);  o+=2;\t// elen\r\n\t\r\n\tif(t==1) {\r\n\t\to += 2;  // comment length\r\n\t\to += 2;  // disk number\r\n\t\to += 6;  // attributes\r\n\t\twUi(data, o, roff);  o+=4;\t// usize\r\n\t}\r\n\tvar nlen = UZIP.bin.writeUTF8(data, o, p);  o+= nlen;\t\r\n\tif(t==0) {  data.set(file, o);  o += file.length;  }\r\n\treturn o;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nUZIP.crc = {\r\n\ttable : ( function() {\r\n\t   var tab = new Uint32Array(256);\r\n\t   for (var n=0; n<256; n++) {\r\n\t\t\tvar c = n;\r\n\t\t\tfor (var k=0; k<8; k++) {\r\n\t\t\t\tif (c & 1)  c = 0xedb88320 ^ (c >>> 1);\r\n\t\t\t\telse        c = c >>> 1;\r\n\t\t\t}\r\n\t\t\ttab[n] = c;  }    \r\n\t\treturn tab;  })(),\r\n\tupdate : function(c, buf, off, len) {\r\n\t\tfor (var i=0; i<len; i++)  c = UZIP.crc.table[(c ^ buf[off+i]) & 0xff] ^ (c >>> 8);\r\n\t\treturn c;\r\n\t},\r\n\tcrc : function(b,o,l)  {  return UZIP.crc.update(0xffffffff,b,o,l) ^ 0xffffffff;  }\r\n}\r\nUZIP.adler = function(data,o,len) {\r\n\tvar a = 1, b = 0;\r\n\tvar off = o, end=o+len;\r\n\twhile(off<end) {\r\n\t\tvar eend = Math.min(off+5552, end);\r\n\t\twhile(off<eend) {\r\n\t\t\ta += data[off++];\r\n\t\t\tb += a;\r\n\t\t}\r\n\t\ta=a%65521;\r\n\t\tb=b%65521;\r\n\t}\r\n    return (b << 16) | a;\r\n}\r\n\r\nUZIP.bin = {\r\n\treadUshort : function(buff,p)  {  return (buff[p]) | (buff[p+1]<<8);  },\r\n\twriteUshort: function(buff,p,n){  buff[p] = (n)&255;  buff[p+1] = (n>>8)&255;  },\r\n\treadUint   : function(buff,p)  {  return (buff[p+3]*(256*256*256)) + ((buff[p+2]<<16) | (buff[p+1]<< 8) | buff[p]);  },\r\n\twriteUint  : function(buff,p,n){  buff[p]=n&255;  buff[p+1]=(n>>8)&255;  buff[p+2]=(n>>16)&255;  buff[p+3]=(n>>24)&255;  },\r\n\treadASCII  : function(buff,p,l){  var s = \"\";  for(var i=0; i<l; i++) s += String.fromCharCode(buff[p+i]);  return s;    },\r\n\twriteASCII : function(data,p,s){  for(var i=0; i<s.length; i++) data[p+i] = s.charCodeAt(i);  },\r\n\tpad : function(n) { return n.length < 2 ? \"0\" + n : n; },\r\n\treadUTF8 : function(buff, p, l) {\r\n\t\tvar s = \"\", ns;\r\n\t\tfor(var i=0; i<l; i++) s += \"%\" + UZIP.bin.pad(buff[p+i].toString(16));\r\n\t\ttry {  ns = decodeURIComponent(s); }\r\n\t\tcatch(e) {  return UZIP.bin.readASCII(buff, p, l);  }\r\n\t\treturn  ns;\r\n\t},\r\n\twriteUTF8 : function(buff, p, str) {\r\n\t\tvar strl = str.length, i=0;\r\n\t\tfor(var ci=0; ci<strl; ci++)\r\n\t\t{\r\n\t\t\tvar code = str.charCodeAt(ci);\r\n\t\t\tif     ((code&(0xffffffff-(1<< 7)+1))==0) {  buff[p+i] = (     code     );  i++;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<11)+1))==0) {  buff[p+i] = (192|(code>> 6));  buff[p+i+1] = (128|((code>> 0)&63));  i+=2;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<16)+1))==0) {  buff[p+i] = (224|(code>>12));  buff[p+i+1] = (128|((code>> 6)&63));  buff[p+i+2] = (128|((code>>0)&63));  i+=3;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<21)+1))==0) {  buff[p+i] = (240|(code>>18));  buff[p+i+1] = (128|((code>>12)&63));  buff[p+i+2] = (128|((code>>6)&63));  buff[p+i+3] = (128|((code>>0)&63)); i+=4;  }\r\n\t\t\telse throw \"e\";\r\n\t\t}\r\n\t\treturn i;\r\n\t},\r\n\tsizeUTF8 : function(str) {\r\n\t\tvar strl = str.length, i=0;\r\n\t\tfor(var ci=0; ci<strl; ci++)\r\n\t\t{\r\n\t\t\tvar code = str.charCodeAt(ci);\r\n\t\t\tif     ((code&(0xffffffff-(1<< 7)+1))==0) {  i++ ;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<11)+1))==0) {  i+=2;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<16)+1))==0) {  i+=3;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<21)+1))==0) {  i+=4;  }\r\n\t\t\telse throw \"e\";\r\n\t\t}\r\n\t\treturn i;\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n\r\nUZIP.F = {};\r\n\r\nUZIP.F.deflateRaw = function(data, out, opos, lvl) {\t\r\n\tvar opts = [\r\n\t/*\r\n\t\t ush good_length; /* reduce lazy search above this match length \r\n\t\t ush max_lazy;    /* do not perform lazy search above this match length \r\n         ush nice_length; /* quit search above this match length \r\n\t*/\r\n\t/*      good lazy nice chain */\r\n\t/* 0 */ [ 0,   0,   0,    0,0],  /* store only */\r\n\t/* 1 */ [ 4,   4,   8,    4,0], /* max speed, no lazy matches */\r\n\t/* 2 */ [ 4,   5,  16,    8,0],\r\n\t/* 3 */ [ 4,   6,  16,   16,0],\r\n\r\n\t/* 4 */ [ 4,  10,  16,   32,0],  /* lazy matches */\r\n\t/* 5 */ [ 8,  16,  32,   32,0],\r\n\t/* 6 */ [ 8,  16, 128,  128,0],\r\n\t/* 7 */ [ 8,  32, 128,  256,0],\r\n\t/* 8 */ [32, 128, 258, 1024,1],\r\n\t/* 9 */ [32, 258, 258, 4096,1]]; /* max compression */\r\n\t\r\n\tvar opt = opts[lvl];\r\n\t\r\n\t\r\n\tvar U = UZIP.F.U, goodIndex = UZIP.F._goodIndex, hash = UZIP.F._hash, putsE = UZIP.F._putsE;\r\n\tvar i = 0, pos = opos<<3, cvrd = 0, dlen = data.length;\r\n\t\r\n\tif(lvl==0) {\r\n\t\twhile(i<dlen) {   var len = Math.min(0xffff, dlen-i);\r\n\t\t\tputsE(out, pos, (i+len==dlen ? 1 : 0));  pos = UZIP.F._copyExact(data, i, len, out, pos+8);  i += len;  }\r\n\t\treturn pos>>>3;\r\n\t}\r\n\r\n\tvar lits = U.lits, strt=U.strt, prev=U.prev, li=0, lc=0, bs=0, ebits=0, c=0, nc=0;  // last_item, literal_count, block_start\r\n\tif(dlen>2) {  nc=UZIP.F._hash(data,0);  strt[nc]=0;  }\r\n\tvar nmch=0,nmci=0;\r\n\t\r\n\tfor(i=0; i<dlen; i++)  {\r\n\t\tc = nc;\r\n\t\t//*\r\n\t\tif(i+1<dlen-2) {\r\n\t\t\tnc = UZIP.F._hash(data, i+1);\r\n\t\t\tvar ii = ((i+1)&0x7fff);\r\n\t\t\tprev[ii]=strt[nc];\r\n\t\t\tstrt[nc]=ii;\r\n\t\t} //*/\r\n\t\tif(cvrd<=i) {\r\n\t\t\tif((li>14000 || lc>26697) && (dlen-i)>100) {\r\n\t\t\t\tif(cvrd<i) {  lits[li]=i-cvrd;  li+=2;  cvrd=i;  }\r\n\t\t\t\tpos = UZIP.F._writeBlock(((i==dlen-1) || (cvrd==dlen))?1:0, lits, li, ebits, data,bs,i-bs, out, pos);  li=lc=ebits=0;  bs=i;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tvar mch = 0;\r\n\t\t\t//if(nmci==i) mch= nmch;  else \r\n\t\t\tif(i<dlen-2) mch = UZIP.F._bestMatch(data, i, prev, c, Math.min(opt[2],dlen-i), opt[3]);\r\n\t\t\t/*\r\n\t\t\tif(mch!=0 && opt[4]==1 && (mch>>>16)<opt[1] && i+1<dlen-2) {\r\n\t\t\t\tnmch = UZIP.F._bestMatch(data, i+1, prev, nc, opt[2], opt[3]);  nmci=i+1;\r\n\t\t\t\t//var mch2 = UZIP.F._bestMatch(data, i+2, prev, nnc);  //nmci=i+1;\r\n\t\t\t\tif((nmch>>>16)>(mch>>>16)) mch=0;\r\n\t\t\t}//*/\r\n\t\t\tvar len = mch>>>16, dst = mch&0xffff;  //if(i-dst<0) throw \"e\";\r\n\t\t\tif(mch!=0) { \r\n\t\t\t\tvar len = mch>>>16, dst = mch&0xffff;  //if(i-dst<0) throw \"e\";\r\n\t\t\t\tvar lgi = goodIndex(len, U.of0);  U.lhst[257+lgi]++; \r\n\t\t\t\tvar dgi = goodIndex(dst, U.df0);  U.dhst[    dgi]++;  ebits += U.exb[lgi] + U.dxb[dgi]; \r\n\t\t\t\tlits[li] = (len<<23)|(i-cvrd);  lits[li+1] = (dst<<16)|(lgi<<8)|dgi;  li+=2;\r\n\t\t\t\tcvrd = i + len;  \r\n\t\t\t}\r\n\t\t\telse {\tU.lhst[data[i]]++;  }\r\n\t\t\tlc++;\r\n\t\t}\r\n\t}\r\n\tif(bs!=i || data.length==0) {\r\n\t\tif(cvrd<i) {  lits[li]=i-cvrd;  li+=2;  cvrd=i;  }\r\n\t\tpos = UZIP.F._writeBlock(1, lits, li, ebits, data,bs,i-bs, out, pos);  li=0;  lc=0;  li=lc=ebits=0;  bs=i;\r\n\t}\r\n\twhile((pos&7)!=0) pos++;\r\n\treturn pos>>>3;\r\n}\r\nUZIP.F._bestMatch = function(data, i, prev, c, nice, chain) {\r\n\tvar ci = (i&0x7fff), pi=prev[ci];  \r\n\t//console.log(\"----\", i);\r\n\tvar dif = ((ci-pi + (1<<15)) & 0x7fff);  if(pi==ci || c!=UZIP.F._hash(data,i-dif)) return 0;\r\n\tvar tl=0, td=0;  // top length, top distance\r\n\tvar dlim = Math.min(0x7fff, i);\r\n\twhile(dif<=dlim && --chain!=0 && pi!=ci /*&& c==UZIP.F._hash(data,i-dif)*/) {\r\n\t\tif(tl==0 || (data[i+tl]==data[i+tl-dif])) {\r\n\t\t\tvar cl = UZIP.F._howLong(data, i, dif);\r\n\t\t\tif(cl>tl) {  \r\n\t\t\t\ttl=cl;  td=dif;  if(tl>=nice) break;    //* \r\n\t\t\t\tif(dif+2<cl) cl = dif+2;\r\n\t\t\t\tvar maxd = 0; // pi does not point to the start of the word\r\n\t\t\t\tfor(var j=0; j<cl-2; j++) {\r\n\t\t\t\t\tvar ei =  (i-dif+j+ (1<<15)) & 0x7fff;\r\n\t\t\t\t\tvar li = prev[ei];\r\n\t\t\t\t\tvar curd = (ei-li + (1<<15)) & 0x7fff;\r\n\t\t\t\t\tif(curd>maxd) {  maxd=curd;  pi = ei; }\r\n\t\t\t\t}  //*/\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tci=pi;  pi = prev[ci];\r\n\t\tdif += ((ci-pi + (1<<15)) & 0x7fff);\r\n\t}\r\n\treturn (tl<<16)|td;\r\n}\r\nUZIP.F._howLong = function(data, i, dif) {\r\n\tif(data[i]!=data[i-dif] || data[i+1]!=data[i+1-dif] || data[i+2]!=data[i+2-dif]) return 0;\r\n\tvar oi=i, l = Math.min(data.length, i+258);  i+=3;\r\n\t//while(i+4<l && data[i]==data[i-dif] && data[i+1]==data[i+1-dif] && data[i+2]==data[i+2-dif] && data[i+3]==data[i+3-dif]) i+=4;\r\n\twhile(i<l && data[i]==data[i-dif]) i++;\r\n\treturn i-oi;\r\n}\r\nUZIP.F._hash = function(data, i) {\r\n\treturn (((data[i]<<8) | data[i+1])+(data[i+2]<<4))&0xffff;\r\n\t//var hash_shift = 0, hash_mask = 255;\r\n\t//var h = data[i+1] % 251;\r\n\t//h = (((h << 8) + data[i+2]) % 251);\r\n\t//h = (((h << 8) + data[i+2]) % 251);\r\n\t//h = ((h<<hash_shift) ^ (c) ) & hash_mask;\r\n\t//return h | (data[i]<<8);\r\n\t//return (data[i] | (data[i+1]<<8));\r\n}\r\n//UZIP.___toth = 0;\r\nUZIP.saved = 0;\r\nUZIP.F._writeBlock = function(BFINAL, lits, li, ebits, data,o0,l0, out, pos) {\r\n\tvar U = UZIP.F.U, putsF = UZIP.F._putsF, putsE = UZIP.F._putsE;\r\n\t\r\n\t//*\r\n\tvar T, ML, MD, MH, numl, numd, numh, lset, dset;  U.lhst[256]++;\r\n\tT = UZIP.F.getTrees(); ML=T[0]; MD=T[1]; MH=T[2]; numl=T[3]; numd=T[4]; numh=T[5]; lset=T[6]; dset=T[7];\r\n\t\r\n\tvar cstSize = (((pos+3)&7)==0 ? 0 : 8-((pos+3)&7)) + 32 + (l0<<3);\r\n\tvar fxdSize = ebits + UZIP.F.contSize(U.fltree, U.lhst) + UZIP.F.contSize(U.fdtree, U.dhst);\r\n\tvar dynSize = ebits + UZIP.F.contSize(U.ltree , U.lhst) + UZIP.F.contSize(U.dtree , U.dhst);\r\n\tdynSize    += 14 + 3*numh + UZIP.F.contSize(U.itree, U.ihst) + (U.ihst[16]*2 + U.ihst[17]*3 + U.ihst[18]*7);\r\n\t\r\n\tfor(var j=0; j<286; j++) U.lhst[j]=0;   for(var j=0; j<30; j++) U.dhst[j]=0;   for(var j=0; j<19; j++) U.ihst[j]=0;\r\n\t//*/\r\n\tvar BTYPE = (cstSize<fxdSize && cstSize<dynSize) ? 0 : ( fxdSize<dynSize ? 1 : 2 );\r\n\tputsF(out, pos, BFINAL);  putsF(out, pos+1, BTYPE);  pos+=3;\r\n\t\r\n\tvar opos = pos;\r\n\tif(BTYPE==0) {\r\n\t\twhile((pos&7)!=0) pos++;\r\n\t\tpos = UZIP.F._copyExact(data, o0, l0, out, pos);\r\n\t}\r\n\telse {\r\n\t\tvar ltree, dtree;\r\n\t\tif(BTYPE==1) {  ltree=U.fltree;  dtree=U.fdtree;  }\r\n\t\tif(BTYPE==2) {\t\r\n\t\t\tUZIP.F.makeCodes(U.ltree, ML);  UZIP.F.revCodes(U.ltree, ML);\r\n\t\t\tUZIP.F.makeCodes(U.dtree, MD);  UZIP.F.revCodes(U.dtree, MD);\r\n\t\t\tUZIP.F.makeCodes(U.itree, MH);  UZIP.F.revCodes(U.itree, MH);\r\n\t\t\t\r\n\t\t\tltree = U.ltree;  dtree = U.dtree;\r\n\t\t\t\r\n\t\t\tputsE(out, pos,numl-257);  pos+=5;  // 286\r\n\t\t\tputsE(out, pos,numd-  1);  pos+=5;  // 30\r\n\t\t\tputsE(out, pos,numh-  4);  pos+=4;  // 19\r\n\t\t\t\r\n\t\t\tfor(var i=0; i<numh; i++) putsE(out, pos+i*3, U.itree[(U.ordr[i]<<1)+1]);   pos+=3* numh;\r\n\t\t\tpos = UZIP.F._codeTiny(lset, U.itree, out, pos);\r\n\t\t\tpos = UZIP.F._codeTiny(dset, U.itree, out, pos);\r\n\t\t}\r\n\t\t\r\n\t\tvar off=o0;\r\n\t\tfor(var si=0; si<li; si+=2) {\r\n\t\t\tvar qb=lits[si], len=(qb>>>23), end = off+(qb&((1<<23)-1));\r\n\t\t\twhile(off<end) pos = UZIP.F._writeLit(data[off++], ltree, out, pos);\r\n\t\t\t\r\n\t\t\tif(len!=0) {\r\n\t\t\t\tvar qc = lits[si+1], dst=(qc>>16), lgi=(qc>>8)&255, dgi=(qc&255);\r\n\t\t\t\tpos = UZIP.F._writeLit(257+lgi, ltree, out, pos);\r\n\t\t\t\tputsE(out, pos, len-U.of0[lgi]);  pos+=U.exb[lgi];\r\n\t\t\t\t\r\n\t\t\t\tpos = UZIP.F._writeLit(dgi, dtree, out, pos);\r\n\t\t\t\tputsF(out, pos, dst-U.df0[dgi]);  pos+=U.dxb[dgi];  off+=len;\r\n\t\t\t}\r\n\t\t}\r\n\t\tpos = UZIP.F._writeLit(256, ltree, out, pos);\r\n\t}\r\n\t//console.log(pos-opos, fxdSize, dynSize, cstSize);\r\n\treturn pos;\r\n}\r\nUZIP.F._copyExact = function(data,off,len,out,pos) {\r\n\tvar p8 = (pos>>>3);\r\n\tout[p8]=(len);  out[p8+1]=(len>>>8);  out[p8+2]=255-out[p8];  out[p8+3]=255-out[p8+1];  p8+=4;\r\n\tout.set(new Uint8Array(data.buffer, off, len), p8);\r\n\t//for(var i=0; i<len; i++) out[p8+i]=data[off+i];\r\n\treturn pos + ((len+4)<<3);\r\n}\r\n/*\r\n\tInteresting facts:\r\n\t- decompressed block can have bytes, which do not occur in a Huffman tree (copied from the previous block by reference)\r\n*/\r\n\r\nUZIP.F.getTrees = function() {\r\n\tvar U = UZIP.F.U;\r\n\tvar ML = UZIP.F._hufTree(U.lhst, U.ltree, 15);\r\n\tvar MD = UZIP.F._hufTree(U.dhst, U.dtree, 15);\r\n\tvar lset = [], numl = UZIP.F._lenCodes(U.ltree, lset);\r\n\tvar dset = [], numd = UZIP.F._lenCodes(U.dtree, dset);\r\n\tfor(var i=0; i<lset.length; i+=2) U.ihst[lset[i]]++;\r\n\tfor(var i=0; i<dset.length; i+=2) U.ihst[dset[i]]++;\r\n\tvar MH = UZIP.F._hufTree(U.ihst, U.itree,  7);\r\n\tvar numh = 19;  while(numh>4 && U.itree[(U.ordr[numh-1]<<1)+1]==0) numh--;\r\n\treturn [ML, MD, MH, numl, numd, numh, lset, dset];\r\n}\r\nUZIP.F.getSecond= function(a) {  var b=[];  for(var i=0; i<a.length; i+=2) b.push  (a[i+1]);  return b;  }\r\nUZIP.F.nonZero  = function(a) {  var b= \"\";  for(var i=0; i<a.length; i+=2) if(a[i+1]!=0)b+=(i>>1)+\",\";  return b;  }\r\nUZIP.F.contSize = function(tree, hst) {  var s=0;  for(var i=0; i<hst.length; i++) s+= hst[i]*tree[(i<<1)+1];  return s;  }\r\nUZIP.F._codeTiny = function(set, tree, out, pos) {\r\n\tfor(var i=0; i<set.length; i+=2) {\r\n\t\tvar l = set[i], rst = set[i+1];  //console.log(l, pos, tree[(l<<1)+1]);\r\n\t\tpos = UZIP.F._writeLit(l, tree, out, pos);\r\n\t\tvar rsl = l==16 ? 2 : (l==17 ? 3 : 7);\r\n\t\tif(l>15) {  UZIP.F._putsE(out, pos, rst, rsl);  pos+=rsl;  }\r\n\t}\r\n\treturn pos;\r\n}\r\nUZIP.F._lenCodes = function(tree, set) {\r\n\tvar len=tree.length;  while(len!=2 && tree[len-1]==0) len-=2;  // when no distances, keep one code with length 0\r\n\tfor(var i=0; i<len; i+=2) {\r\n\t\tvar l = tree[i+1], nxt = (i+3<len ? tree[i+3]:-1),  nnxt = (i+5<len ? tree[i+5]:-1),  prv = (i==0 ? -1 : tree[i-1]);\r\n\t\tif(l==0 && nxt==l && nnxt==l) {\r\n\t\t\tvar lz = i+5;\r\n\t\t\twhile(lz+2<len && tree[lz+2]==l) lz+=2;\r\n\t\t\tvar zc = Math.min((lz+1-i)>>>1, 138);\r\n\t\t\tif(zc<11) set.push(17, zc-3);\r\n\t\t\telse set.push(18, zc-11);\r\n\t\t\ti += zc*2-2;\r\n\t\t}\r\n\t\telse if(l==prv && nxt==l && nnxt==l) {\r\n\t\t\tvar lz = i+5;\r\n\t\t\twhile(lz+2<len && tree[lz+2]==l) lz+=2;\r\n\t\t\tvar zc = Math.min((lz+1-i)>>>1, 6);\r\n\t\t\tset.push(16, zc-3);\r\n\t\t\ti += zc*2-2;\r\n\t\t}\r\n\t\telse set.push(l, 0);\r\n\t}\r\n\treturn len>>>1;\r\n}\r\nUZIP.F._hufTree   = function(hst, tree, MAXL) {\r\n\tvar list=[], hl = hst.length, tl=tree.length, i=0;\r\n\tfor(i=0; i<tl; i+=2) {  tree[i]=0;  tree[i+1]=0;  }\t\r\n\tfor(i=0; i<hl; i++) if(hst[i]!=0) list.push({lit:i, f:hst[i]});\r\n\tvar end = list.length, l2=list.slice(0);\r\n\tif(end==0) return 0;  // empty histogram (usually for dist)\r\n\tif(end==1) {  var lit=list[0].lit, l2=lit==0?1:0;  tree[(lit<<1)+1]=1;  tree[(l2<<1)+1]=1;  return 1;  }\r\n\tlist.sort(function(a,b){return a.f-b.f;});\r\n\tvar a=list[0], b=list[1], i0=0, i1=1, i2=2;  list[0]={lit:-1,f:a.f+b.f,l:a,r:b,d:0};\r\n\twhile(i1!=end-1) {\r\n\t\tif(i0!=i1 && (i2==end || list[i0].f<list[i2].f)) {  a=list[i0++];  }  else {  a=list[i2++];  }\r\n\t\tif(i0!=i1 && (i2==end || list[i0].f<list[i2].f)) {  b=list[i0++];  }  else {  b=list[i2++];  }\r\n\t\tlist[i1++]={lit:-1,f:a.f+b.f, l:a,r:b};\r\n\t}\r\n\tvar maxl = UZIP.F.setDepth(list[i1-1], 0);\r\n\tif(maxl>MAXL) {  UZIP.F.restrictDepth(l2, MAXL, maxl);  maxl = MAXL;  }\r\n\tfor(i=0; i<end; i++) tree[(l2[i].lit<<1)+1]=l2[i].d;\r\n\treturn maxl;\r\n}\r\n\r\nUZIP.F.setDepth  = function(t, d) {\r\n\tif(t.lit!=-1) {  t.d=d;  return d;  }\r\n\treturn Math.max( UZIP.F.setDepth(t.l, d+1),  UZIP.F.setDepth(t.r, d+1) );\r\n}\r\n\r\nUZIP.F.restrictDepth = function(dps, MD, maxl) {\r\n\tvar i=0, bCost=1<<(maxl-MD), dbt=0;\r\n\tdps.sort(function(a,b){return b.d==a.d ? a.f-b.f : b.d-a.d;});\r\n\t\r\n\tfor(i=0; i<dps.length; i++) if(dps[i].d>MD) {  var od=dps[i].d;  dps[i].d=MD;  dbt+=bCost-(1<<(maxl-od));  }  else break;\r\n\tdbt = dbt>>>(maxl-MD);\r\n\twhile(dbt>0) {  var od=dps[i].d;  if(od<MD) {  dps[i].d++;  dbt-=(1<<(MD-od-1));  }  else  i++;  }\r\n\tfor(; i>=0; i--) if(dps[i].d==MD && dbt<0) {  dps[i].d--;  dbt++;  }  if(dbt!=0) console.log(\"debt left\");\r\n}\r\n\r\nUZIP.F._goodIndex = function(v, arr) {\r\n\tvar i=0;  if(arr[i|16]<=v) i|=16;  if(arr[i|8]<=v) i|=8;  if(arr[i|4]<=v) i|=4;  if(arr[i|2]<=v) i|=2;  if(arr[i|1]<=v) i|=1;  return i;\r\n}\r\nUZIP.F._writeLit = function(ch, ltree, out, pos) {\r\n\tUZIP.F._putsF(out, pos, ltree[ch<<1]);\r\n\treturn pos+ltree[(ch<<1)+1];\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nUZIP.F.inflate = function(data, buf) {\r\n\tvar u8=Uint8Array;\r\n\tif(data[0]==3 && data[1]==0) return (buf ? buf : new u8(0));\r\n\tvar F=UZIP.F, bitsF = F._bitsF, bitsE = F._bitsE, decodeTiny = F._decodeTiny, makeCodes = F.makeCodes, codes2map=F.codes2map, get17 = F._get17;\r\n\tvar U = F.U;\r\n\t\r\n\tvar noBuf = (buf==null);\r\n\tif(noBuf) buf = new u8((data.length>>>2)<<3);\r\n\t\r\n\tvar BFINAL=0, BTYPE=0, HLIT=0, HDIST=0, HCLEN=0, ML=0, MD=0; \t\r\n\tvar off = 0, pos = 0;\r\n\tvar lmap, dmap;\r\n\t\r\n\twhile(BFINAL==0) {\t\t\r\n\t\tBFINAL = bitsF(data, pos  , 1);\r\n\t\tBTYPE  = bitsF(data, pos+1, 2);  pos+=3;\r\n\t\t//console.log(BFINAL, BTYPE);\r\n\t\t\r\n\t\tif(BTYPE==0) {\r\n\t\t\tif((pos&7)!=0) pos+=8-(pos&7);\r\n\t\t\tvar p8 = (pos>>>3)+4, len = data[p8-4]|(data[p8-3]<<8);  //console.log(len);//bitsF(data, pos, 16), \r\n\t\t\tif(noBuf) buf=UZIP.F._check(buf, off+len);\r\n\t\t\tbuf.set(new u8(data.buffer, data.byteOffset+p8, len), off);\r\n\t\t\t//for(var i=0; i<len; i++) buf[off+i] = data[p8+i];\r\n\t\t\t//for(var i=0; i<len; i++) if(buf[off+i] != data[p8+i]) throw \"e\";\r\n\t\t\tpos = ((p8+len)<<3);  off+=len;  continue;\r\n\t\t}\r\n\t\tif(noBuf) buf=UZIP.F._check(buf, off+(1<<17));  // really not enough in many cases (but PNG and ZIP provide buffer in advance)\r\n\t\tif(BTYPE==1) {  lmap = U.flmap;  dmap = U.fdmap;  ML = (1<<9)-1;  MD = (1<<5)-1;   }\r\n\t\tif(BTYPE==2) {\r\n\t\t\tHLIT  = bitsE(data, pos   , 5)+257;  \r\n\t\t\tHDIST = bitsE(data, pos+ 5, 5)+  1;  \r\n\t\t\tHCLEN = bitsE(data, pos+10, 4)+  4;  pos+=14;\r\n\t\t\t\r\n\t\t\tvar ppos = pos;\r\n\t\t\tfor(var i=0; i<38; i+=2) {  U.itree[i]=0;  U.itree[i+1]=0;  }\r\n\t\t\tvar tl = 1;\r\n\t\t\tfor(var i=0; i<HCLEN; i++) {  var l=bitsE(data, pos+i*3, 3);  U.itree[(U.ordr[i]<<1)+1] = l;  if(l>tl)tl=l;  }     pos+=3*HCLEN;  //console.log(itree);\r\n\t\t\tmakeCodes(U.itree, tl);\r\n\t\t\tcodes2map(U.itree, tl, U.imap);\r\n\t\t\t\r\n\t\t\tlmap = U.lmap;  dmap = U.dmap;\r\n\t\t\t\r\n\t\t\tpos = decodeTiny(U.imap, (1<<tl)-1, HLIT+HDIST, data, pos, U.ttree);\r\n\t\t\tvar mx0 = F._copyOut(U.ttree,    0, HLIT , U.ltree);  ML = (1<<mx0)-1;\r\n\t\t\tvar mx1 = F._copyOut(U.ttree, HLIT, HDIST, U.dtree);  MD = (1<<mx1)-1;\r\n\t\t\t\r\n\t\t\t//var ml = decodeTiny(U.imap, (1<<tl)-1, HLIT , data, pos, U.ltree); ML = (1<<(ml>>>24))-1;  pos+=(ml&0xffffff);\r\n\t\t\tmakeCodes(U.ltree, mx0);\r\n\t\t\tcodes2map(U.ltree, mx0, lmap);\r\n\t\t\t\r\n\t\t\t//var md = decodeTiny(U.imap, (1<<tl)-1, HDIST, data, pos, U.dtree); MD = (1<<(md>>>24))-1;  pos+=(md&0xffffff);\r\n\t\t\tmakeCodes(U.dtree, mx1);\r\n\t\t\tcodes2map(U.dtree, mx1, dmap);\r\n\t\t}\r\n\t\t//var ooff=off, opos=pos;\r\n\t\twhile(true) {\r\n\t\t\tvar code = lmap[get17(data, pos) & ML];  pos += code&15;\r\n\t\t\tvar lit = code>>>4;  //U.lhst[lit]++;  \r\n\t\t\tif((lit>>>8)==0) {  buf[off++] = lit;  }\r\n\t\t\telse if(lit==256) {  break;  }\r\n\t\t\telse {\r\n\t\t\t\tvar end = off+lit-254;\r\n\t\t\t\tif(lit>264) { var ebs = U.ldef[lit-257];  end = off + (ebs>>>3) + bitsE(data, pos, ebs&7);  pos += ebs&7;  }\r\n\t\t\t\t//UZIP.F.dst[end-off]++;\r\n\t\t\t\t\r\n\t\t\t\tvar dcode = dmap[get17(data, pos) & MD];  pos += dcode&15;\r\n\t\t\t\tvar dlit = dcode>>>4;\r\n\t\t\t\tvar dbs = U.ddef[dlit], dst = (dbs>>>4) + bitsF(data, pos, dbs&15);  pos += dbs&15;\r\n\t\t\t\t\r\n\t\t\t\t//var o0 = off-dst, stp = Math.min(end-off, dst);\r\n\t\t\t\t//if(stp>20) while(off<end) {  buf.copyWithin(off, o0, o0+stp);  off+=stp;  }  else\r\n\t\t\t\t//if(end-dst<=off) buf.copyWithin(off, off-dst, end-dst);  else\r\n\t\t\t\t//if(dst==1) buf.fill(buf[off-1], off, end);  else\r\n\t\t\t\tif(noBuf) buf=UZIP.F._check(buf, off+(1<<17));\r\n\t\t\t\twhile(off<end) {  buf[off]=buf[off++-dst];    buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  }   \r\n\t\t\t\toff=end;\r\n\t\t\t\t//while(off!=end) {  buf[off]=buf[off++-dst];  }\r\n\t\t\t}\r\n\t\t}\r\n\t\t//console.log(off-ooff, (pos-opos)>>>3);\r\n\t}\r\n\t//console.log(UZIP.F.dst);\r\n\t//console.log(tlen, dlen, off-tlen+tcnt);\r\n\treturn buf.length==off ? buf : buf.slice(0,off);\r\n}\r\nUZIP.F._check=function(buf, len) {\r\n\tvar bl=buf.length;  if(len<=bl) return buf;\r\n\tvar nbuf = new Uint8Array(Math.max(bl<<1,len));  nbuf.set(buf,0);\r\n\t//for(var i=0; i<bl; i+=4) {  nbuf[i]=buf[i];  nbuf[i+1]=buf[i+1];  nbuf[i+2]=buf[i+2];  nbuf[i+3]=buf[i+3];  }\r\n\treturn nbuf;\r\n}\r\n\r\nUZIP.F._decodeTiny = function(lmap, LL, len, data, pos, tree) {\r\n\tvar bitsE = UZIP.F._bitsE, get17 = UZIP.F._get17;\r\n\tvar i = 0;\r\n\twhile(i<len) {\r\n\t\tvar code = lmap[get17(data, pos)&LL];  pos+=code&15;\r\n\t\tvar lit = code>>>4; \r\n\t\tif(lit<=15) {  tree[i]=lit;  i++;  }\r\n\t\telse {\r\n\t\t\tvar ll = 0, n = 0;\r\n\t\t\tif(lit==16) {\r\n\t\t\t\tn = (3  + bitsE(data, pos, 2));  pos += 2;  ll = tree[i-1];\r\n\t\t\t}\r\n\t\t\telse if(lit==17) {\r\n\t\t\t\tn = (3  + bitsE(data, pos, 3));  pos += 3;\r\n\t\t\t}\r\n\t\t\telse if(lit==18) {\r\n\t\t\t\tn = (11 + bitsE(data, pos, 7));  pos += 7;\r\n\t\t\t}\r\n\t\t\tvar ni = i+n;\r\n\t\t\twhile(i<ni) {  tree[i]=ll;  i++; }\r\n\t\t}\r\n\t}\r\n\treturn pos;\r\n}\r\nUZIP.F._copyOut = function(src, off, len, tree) {\r\n\tvar mx=0, i=0, tl=tree.length>>>1;\r\n\twhile(i<len) {  var v=src[i+off];  tree[(i<<1)]=0;  tree[(i<<1)+1]=v;  if(v>mx)mx=v;  i++;  }\r\n\twhile(i<tl ) {  tree[(i<<1)]=0;  tree[(i<<1)+1]=0;  i++;  }\r\n\treturn mx;\r\n}\r\n\r\nUZIP.F.makeCodes = function(tree, MAX_BITS) {  // code, length\r\n\tvar U = UZIP.F.U;\r\n\tvar max_code = tree.length;\r\n\tvar code, bits, n, i, len;\r\n\t\r\n\tvar bl_count = U.bl_count;  for(var i=0; i<=MAX_BITS; i++) bl_count[i]=0;\r\n\tfor(i=1; i<max_code; i+=2) bl_count[tree[i]]++;\r\n\t\r\n\tvar next_code = U.next_code;\t// smallest code for each length\r\n\t\r\n\tcode = 0;\r\n\tbl_count[0] = 0;\r\n\tfor (bits = 1; bits <= MAX_BITS; bits++) {\r\n\t\tcode = (code + bl_count[bits-1]) << 1;\r\n\t\tnext_code[bits] = code;\r\n\t}\r\n\t\r\n\tfor (n = 0; n < max_code; n+=2) {\r\n\t\tlen = tree[n+1];\r\n\t\tif (len != 0) {\r\n\t\t\ttree[n] = next_code[len];\r\n\t\t\tnext_code[len]++;\r\n\t\t}\r\n\t}\r\n}\r\nUZIP.F.codes2map = function(tree, MAX_BITS, map) {\r\n\tvar max_code = tree.length;\r\n\tvar U=UZIP.F.U, r15 = U.rev15;\r\n\tfor(var i=0; i<max_code; i+=2) if(tree[i+1]!=0)  {\r\n\t\tvar lit = i>>1;\r\n\t\tvar cl = tree[i+1], val = (lit<<4)|cl; // :  (0x8000 | (U.of0[lit-257]<<7) | (U.exb[lit-257]<<4) | cl);\r\n\t\tvar rest = (MAX_BITS-cl), i0 = tree[i]<<rest, i1 = i0 + (1<<rest);\r\n\t\t//tree[i]=r15[i0]>>>(15-MAX_BITS);\r\n\t\twhile(i0!=i1) {\r\n\t\t\tvar p0 = r15[i0]>>>(15-MAX_BITS);\r\n\t\t\tmap[p0]=val;  i0++;\r\n\t\t}\r\n\t}\r\n}\r\nUZIP.F.revCodes = function(tree, MAX_BITS) {\r\n\tvar r15 = UZIP.F.U.rev15, imb = 15-MAX_BITS;\r\n\tfor(var i=0; i<tree.length; i+=2) {  var i0 = (tree[i]<<(MAX_BITS-tree[i+1]));  tree[i] = r15[i0]>>>imb;  }\r\n}\r\n\r\n// used only in deflate\r\nUZIP.F._putsE= function(dt, pos, val   ) {  val = val<<(pos&7);  var o=(pos>>>3);  dt[o]|=val;  dt[o+1]|=(val>>>8);                        }\r\nUZIP.F._putsF= function(dt, pos, val   ) {  val = val<<(pos&7);  var o=(pos>>>3);  dt[o]|=val;  dt[o+1]|=(val>>>8);  dt[o+2]|=(val>>>16);  }\r\n\r\nUZIP.F._bitsE= function(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8)                        )>>>(pos&7))&((1<<length)-1);  }\r\nUZIP.F._bitsF= function(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16))>>>(pos&7))&((1<<length)-1);  }\r\n/*\r\nUZIP.F._get9 = function(dt, pos) {\r\n\treturn ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8))>>>(pos&7))&511;\r\n} */\r\nUZIP.F._get17= function(dt, pos) {\t// return at least 17 meaningful bytes\r\n\treturn (dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16) )>>>(pos&7);\r\n}\r\nUZIP.F._get25= function(dt, pos) {\t// return at least 17 meaningful bytes\r\n\treturn (dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16) | (dt[(pos>>>3)+3]<<24) )>>>(pos&7);\r\n}\r\nUZIP.F.U = function(){\r\n\tvar u16=Uint16Array, u32=Uint32Array;\r\n\treturn {\r\n\t\tnext_code : new u16(16),\r\n\t\tbl_count  : new u16(16),\r\n\t\tordr : [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ],\r\n\t\tof0  : [3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,999,999,999],\r\n\t\texb  : [0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4,  4,  5,  5,  5,  5,  0,  0,  0,  0],\r\n\t\tldef : new u16(32),\r\n\t\tdf0  : [1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577, 65535, 65535],\r\n\t\tdxb  : [0,0,0,0,1,1,2, 2, 3, 3, 4, 4, 5, 5,  6,  6,  7,  7,  8,  8,   9,   9,  10,  10,  11,  11,  12,   12,   13,   13,     0,     0],\r\n\t\tddef : new u32(32),\r\n\t\tflmap: new u16(  512),  fltree: [],\r\n\t\tfdmap: new u16(   32),  fdtree: [],\r\n\t\tlmap : new u16(32768),  ltree : [],  ttree:[],\r\n\t\tdmap : new u16(32768),  dtree : [],\r\n\t\timap : new u16(  512),  itree : [],\r\n\t\t//rev9 : new u16(  512)\r\n\t\trev15: new u16(1<<15),\r\n\t\tlhst : new u32(286), dhst : new u32( 30), ihst : new u32(19),\r\n\t\tlits : new u32(15000),\r\n\t\tstrt : new u16(1<<16),\r\n\t\tprev : new u16(1<<15)\r\n\t};  \r\n} ();\r\n\r\n(function(){\t\r\n\tvar U = UZIP.F.U;\r\n\tvar len = 1<<15;\r\n\tfor(var i=0; i<len; i++) {\r\n\t\tvar x = i;\r\n\t\tx = (((x & 0xaaaaaaaa) >>> 1) | ((x & 0x55555555) << 1));\r\n\t\tx = (((x & 0xcccccccc) >>> 2) | ((x & 0x33333333) << 2));\r\n\t\tx = (((x & 0xf0f0f0f0) >>> 4) | ((x & 0x0f0f0f0f) << 4));\r\n\t\tx = (((x & 0xff00ff00) >>> 8) | ((x & 0x00ff00ff) << 8));\r\n\t\tU.rev15[i] = (((x >>> 16) | (x << 16)))>>>17;\r\n\t}\r\n\t\r\n\tfunction pushV(tgt, n, sv) {  while(n--!=0) tgt.push(0,sv);  }\r\n\t\r\n\tfor(var i=0; i<32; i++) {  U.ldef[i]=(U.of0[i]<<3)|U.exb[i];  U.ddef[i]=(U.df0[i]<<4)|U.dxb[i];  }\r\n\t\r\n\tpushV(U.fltree, 144, 8);  pushV(U.fltree, 255-143, 9);  pushV(U.fltree, 279-255, 7);  pushV(U.fltree,287-279,8);\r\n\t/*\r\n\tvar i = 0;\r\n\tfor(; i<=143; i++) U.fltree.push(0,8);\r\n\tfor(; i<=255; i++) U.fltree.push(0,9);\r\n\tfor(; i<=279; i++) U.fltree.push(0,7);\r\n\tfor(; i<=287; i++) U.fltree.push(0,8);\r\n\t*/\r\n\tUZIP.F.makeCodes(U.fltree, 9);\r\n\tUZIP.F.codes2map(U.fltree, 9, U.flmap);\r\n\tUZIP.F.revCodes (U.fltree, 9)\r\n\t\r\n\tpushV(U.fdtree,32,5);\r\n\t//for(i=0;i<32; i++) U.fdtree.push(0,5);\r\n\tUZIP.F.makeCodes(U.fdtree, 5);\r\n\tUZIP.F.codes2map(U.fdtree, 5, U.fdmap);\r\n\tUZIP.F.revCodes (U.fdtree, 5)\r\n\t\r\n\tpushV(U.itree,19,0);  pushV(U.ltree,286,0);  pushV(U.dtree,30,0);  pushV(U.ttree,320,0);\r\n\t/*\r\n\tfor(var i=0; i< 19; i++) U.itree.push(0,0);\r\n\tfor(var i=0; i<286; i++) U.ltree.push(0,0);\r\n\tfor(var i=0; i< 30; i++) U.dtree.push(0,0);\r\n\tfor(var i=0; i<320; i++) U.ttree.push(0,0);\r\n\t*/\r\n})()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","import UZIP from \"uzip\";\nimport pako from \"pako\";\n\nconst UPNG = {};\n\nUPNG.toRGBA8 = function (out) {\n  const w = out.width;\n  const h = out.height;\n  if (out.tabs.acTL === null)\n    return [UPNG.toRGBA8.decodeImage(out.data, w, h, out).buffer];\n\n  const frms = [];\n  if (out.frames[0].data === null) out.frames[0].data = out.data;\n  const len = w * h * 4;\n  const img = new Uint8Array(len);\n  const empty = new Uint8Array(len);\n  const prev = new Uint8Array(len);\n  for (let i = 0; i < out.frames.length; i++) {\n    const frm = out.frames[i];\n    const fx = frm.rect.x;\n    const fy = frm.rect.y;\n    const fw = frm.rect.width;\n    const fh = frm.rect.height;\n    const fdata = UPNG.toRGBA8.decodeImage(frm.data, fw, fh, out);\n\n    if (i !== 0) for (let j = 0; j < len; j++) prev[j] = img[j];\n\n    if (frm.blend === 0) UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 0);\n    else if (frm.blend === 1)\n      UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 1);\n\n    frms.push(img.buffer.slice(0));\n\n    if (frm.dispose === 1) UPNG._copyTile(empty, fw, fh, img, w, h, fx, fy, 0);\n    else if (frm.dispose === 2) for (let j = 0; j < len; j++) img[j] = prev[j];\n  }\n  return frms;\n};\nUPNG.toRGBA8.decodeImage = function (data, w, h, out) {\n  const area = w * h;\n  const bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8); // bytes per line\n\n  const bf = new Uint8Array(area * 4);\n  const bf32 = new Uint32Array(bf.buffer);\n  const ctype = out.ctype;\n  const depth = out.depth;\n  const rs = UPNG._bin.readUshort;\n\n  if (ctype === 6) {\n    // RGB + alpha\n    const qarea = area << 2;\n    if (depth === 8)\n      for (let i = 0; i < qarea; i += 4) {\n        bf[i] = data[i];\n        bf[i + 1] = data[i + 1];\n        bf[i + 2] = data[i + 2];\n        bf[i + 3] = data[i + 3];\n      }\n    if (depth === 16)\n      for (let i = 0; i < qarea; i++) {\n        bf[i] = data[i << 1];\n      }\n  } else if (ctype === 2) {\n    // RGB\n    const ts = out.tabs.tRNS;\n    if (ts === null) {\n      if (depth === 8)\n        for (let i = 0; i < area; i++) {\n          const ti = i * 3;\n          bf32[i] =\n            (255 << 24) | (data[ti + 2] << 16) | (data[ti + 1] << 8) | data[ti];\n        }\n      if (depth === 16)\n        for (let i = 0; i < area; i++) {\n          const ti = i * 6;\n          bf32[i] =\n            (255 << 24) | (data[ti + 4] << 16) | (data[ti + 2] << 8) | data[ti];\n        }\n    } else {\n      const tr = ts[0];\n      const tg = ts[1];\n      const tb = ts[2];\n      if (depth === 8)\n        for (let i = 0; i < area; i++) {\n          const qi = i << 2;\n          const ti = i * 3;\n          bf32[i] =\n            (255 << 24) | (data[ti + 2] << 16) | (data[ti + 1] << 8) | data[ti];\n          if (data[ti] === tr && data[ti + 1] === tg && data[ti + 2] === tb)\n            bf[qi + 3] = 0;\n        }\n      if (depth === 16)\n        for (let i = 0; i < area; i++) {\n          const qi = i << 2;\n          const ti = i * 6;\n          bf32[i] =\n            (255 << 24) | (data[ti + 4] << 16) | (data[ti + 2] << 8) | data[ti];\n          if (\n            rs(data, ti) === tr &&\n            rs(data, ti + 2) === tg &&\n            rs(data, ti + 4) === tb\n          )\n            bf[qi + 3] = 0;\n        }\n    }\n  } else if (ctype === 3) {\n    // palette\n    const p = out.tabs.PLTE;\n    const ap = out.tabs.tRNS;\n    const tl = ap ? ap.length : 0;\n    if (depth === 1)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 3)] >> (7 - ((i & 7) << 0))) & 1;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 2)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 2)] >> (6 - ((i & 3) << 1))) & 3;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 4)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 1)] >> (4 - ((i & 1) << 2))) & 15;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 8)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const j = data[i];\n        const cj = 3 * j;\n        bf[qi] = p[cj];\n        bf[qi + 1] = p[cj + 1];\n        bf[qi + 2] = p[cj + 2];\n        bf[qi + 3] = j < tl ? ap[j] : 255;\n      }\n  } else if (ctype === 4) {\n    // gray + alpha\n    if (depth === 8)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const di = i << 1;\n        const gr = data[di];\n        bf[qi] = gr;\n        bf[qi + 1] = gr;\n        bf[qi + 2] = gr;\n        bf[qi + 3] = data[di + 1];\n      }\n    if (depth === 16)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const di = i << 2;\n        const gr = data[di];\n        bf[qi] = gr;\n        bf[qi + 1] = gr;\n        bf[qi + 2] = gr;\n        bf[qi + 3] = data[di + 2];\n      }\n  } else if (ctype === 0) {\n    // gray\n    const tr = out.tabs.tRNS ? out.tabs.tRNS : -1;\n    for (let y = 0; y < h; y++) {\n      const off = y * bpl;\n      const to = y * w;\n      if (depth === 1)\n        for (let x = 0; x < w; x++) {\n          const gr = 255 * ((data[off + (x >>> 3)] >>> (7 - (x & 7))) & 1);\n          const al = gr === tr * 255 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 2)\n        for (let x = 0; x < w; x++) {\n          const gr =\n            85 * ((data[off + (x >>> 2)] >>> (6 - ((x & 3) << 1))) & 3);\n          const al = gr === tr * 85 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 4)\n        for (let x = 0; x < w; x++) {\n          const gr =\n            17 * ((data[off + (x >>> 1)] >>> (4 - ((x & 1) << 2))) & 15);\n          const al = gr === tr * 17 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 8)\n        for (let x = 0; x < w; x++) {\n          const gr = data[off + x];\n          const al = gr === tr ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 16)\n        for (let x = 0; x < w; x++) {\n          const gr = data[off + (x << 1)];\n          const al = rs(data, off + (x << 1)) === tr ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n    }\n  }\n  return bf;\n};\n\nUPNG.decode = function (buff) {\n  const data = new Uint8Array(buff);\n  let offset = 8;\n  const bin = UPNG._bin;\n  const rUs = bin.readUshort;\n  const rUi = bin.readUint;\n  const out = { tabs: {}, frames: [] };\n  const dd = new Uint8Array(data.length);\n  let doff = 0; // put all IDAT data into it\n  let fd;\n  let foff = 0; // frames\n\n  const mgck = [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a];\n  for (let i = 0; i < 8; i++)\n    if (data[i] !== mgck[i]) throw \"The input is not a PNG file!\";\n\n  while (offset < data.length) {\n    const len = bin.readUint(data, offset);\n    offset += 4;\n    const type = bin.readASCII(data, offset, 4);\n    offset += 4;\n\n    if (type === \"IHDR\") {\n      UPNG.decode._IHDR(data, offset, out);\n    } else if (type === \"CgBI\") {\n      out.tabs[type] = data.slice(offset, offset + 4);\n    } else if (type === \"IDAT\") {\n      for (let i = 0; i < len; i++) dd[doff + i] = data[offset + i];\n      doff += len;\n    } else if (type === \"acTL\") {\n      out.tabs[type] = {\n        num_frames: rUi(data, offset),\n        num_plays: rUi(data, offset + 4)\n      };\n      fd = new Uint8Array(data.length);\n    } else if (type === \"fcTL\") {\n      if (foff !== 0) {\n        const fr = out.frames[out.frames.length - 1];\n        fr.data = UPNG.decode._decompress(\n          out,\n          fd.slice(0, foff),\n          fr.rect.width,\n          fr.rect.height\n        );\n        foff = 0;\n      }\n      const rct = {\n        x: rUi(data, offset + 12),\n        y: rUi(data, offset + 16),\n        width: rUi(data, offset + 4),\n        height: rUi(data, offset + 8)\n      };\n      let del = rUs(data, offset + 22);\n      del = rUs(data, offset + 20) / (del === 0 ? 100 : del);\n      const frm = {\n        rect: rct,\n        delay: Math.round(del * 1000),\n        dispose: data[offset + 24],\n        blend: data[offset + 25]\n      };\n      out.frames.push(frm);\n    } else if (type === \"fdAT\") {\n      for (let i = 0; i < len - 4; i++) fd[foff + i] = data[offset + i + 4];\n      foff += len - 4;\n    } else if (type === \"pHYs\") {\n      out.tabs[type] = [\n        bin.readUint(data, offset),\n        bin.readUint(data, offset + 4),\n        data[offset + 8]\n      ];\n    } else if (type === \"cHRM\") {\n      out.tabs[type] = [];\n      for (let i = 0; i < 8; i++)\n        out.tabs[type].push(bin.readUint(data, offset + i * 4));\n    } else if (type === \"tEXt\" || type === \"zTXt\") {\n      if (out.tabs[type] === null) out.tabs[type] = {};\n      const nz = bin.nextZero(data, offset);\n      const keyw = bin.readASCII(data, offset, nz - offset);\n      let text;\n      const tl = offset + len - nz - 1;\n      if (type === \"tEXt\") text = bin.readASCII(data, nz + 1, tl);\n      else {\n        const bfr = UPNG.decode._inflate(data.slice(nz + 2, nz + 2 + tl));\n        text = bin.readUTF8(bfr, 0, bfr.length);\n      }\n      out.tabs[type][keyw] = text;\n    } else if (type === \"iTXt\") {\n      if (out.tabs[type] == null) out.tabs[type] = {};\n      let nz = 0;\n      let off = offset;\n      nz = bin.nextZero(data, off);\n      const keyw = bin.readASCII(data, off, nz - off);\n      off = nz + 1;\n      const cflag = data[off];\n      // const cmeth = data[off + 1];\n      off += 2;\n      nz = bin.nextZero(data, off);\n      // const ltag = bin.readASCII(data, off, nz - off);\n      off = nz + 1;\n      nz = bin.nextZero(data, off);\n      // const tkeyw = bin.readUTF8(data, off, nz - off);\n      off = nz + 1;\n      let text;\n      const tl = len - (off - offset);\n      if (cflag === 0) text = bin.readUTF8(data, off, tl);\n      else {\n        const bfr = UPNG.decode._inflate(data.slice(off, off + tl));\n        text = bin.readUTF8(bfr, 0, bfr.length);\n      }\n      out.tabs[type][keyw] = text;\n    } else if (type === \"PLTE\") {\n      out.tabs[type] = bin.readBytes(data, offset, len);\n    } else if (type === \"hIST\") {\n      const pl = out.tabs.PLTE.length / 3;\n      out.tabs[type] = [];\n      for (let i = 0; i < pl; i++)\n        out.tabs[type].push(rUs(data, offset + i * 2));\n    } else if (type === \"tRNS\") {\n      if (out.ctype === 3) out.tabs[type] = bin.readBytes(data, offset, len);\n      else if (out.ctype === 0) out.tabs[type] = rUs(data, offset);\n      else if (out.ctype === 2)\n        out.tabs[type] = [\n          rUs(data, offset),\n          rUs(data, offset + 2),\n          rUs(data, offset + 4)\n        ];\n    } else if (type === \"gAMA\")\n      out.tabs[type] = bin.readUint(data, offset) / 100000;\n    else if (type === \"sRGB\") out.tabs[type] = data[offset];\n    else if (type === \"bKGD\") {\n      if (out.ctype === 0 || out.ctype === 4)\n        out.tabs[type] = [rUs(data, offset)];\n      else if (out.ctype === 2 || out.ctype === 6)\n        out.tabs[type] = [\n          rUs(data, offset),\n          rUs(data, offset + 2),\n          rUs(data, offset + 4)\n        ];\n      else if (out.ctype === 3) out.tabs[type] = data[offset];\n    } else if (type === \"IEND\") {\n      break;\n    }\n    offset += len;\n    // const crc = bin.readUint(data, offset);\n    offset += 4;\n  }\n  if (foff !== 0) {\n    const fr = out.frames[out.frames.length - 1];\n    fr.data = UPNG.decode._decompress(\n      out,\n      fd.slice(0, foff),\n      fr.rect.width,\n      fr.rect.height\n    );\n    foff = 0;\n  }\n  out.data = UPNG.decode._decompress(out, dd, out.width, out.height);\n\n  delete out.compress;\n  delete out.interlace;\n  delete out.filter;\n  return out;\n};\n\nUPNG.decode._decompress = function (out, dd, w, h) {\n  const bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8);\n  const buff = new Uint8Array((bpl + 1 + out.interlace) * h);\n  if (out.tabs.CgBI) dd = UPNG.inflateRaw(dd, buff);\n  else dd = UPNG.decode._inflate(dd, buff);\n\n  if (out.interlace === 0) dd = UPNG.decode._filterZero(dd, out, 0, w, h);\n  else if (out.interlace === 1) dd = UPNG.decode._readInterlace(dd, out);\n  return dd;\n};\n\nUPNG.decode._inflate = function (data, buff) {\n  const out = UPNG.inflateRaw(\n    new Uint8Array(data.buffer, 2, data.length - 6),\n    buff\n  );\n  return out;\n};\nUPNG.inflateRaw = (function () {\n  const H = {};\n  H.H = {};\n  H.H.N = function (N, W) {\n    const R = Uint8Array;\n    let i = 0;\n    let m = 0;\n    let J = 0;\n    let h = 0;\n    let Q = 0;\n    let X = 0;\n    let u = 0;\n    let w = 0;\n    let d = 0;\n    let v;\n    let C;\n    if (N[0] === 3 && N[1] === 0) {\n      return W || new R(0);\n    }\n    const V = H.H;\n    const n = V.b;\n    const A = V.e;\n    const l = V.R;\n    const M = V.n;\n    const I = V.A;\n    const e = V.Z;\n    const b = V.m;\n    const Z = W === null;\n    if (Z) W = new R((N.length >>> 2) << 3);\n    while (i === 0) {\n      i = n(N, d, 1);\n      m = n(N, d + 1, 2);\n      d += 3;\n      if (m === 0) {\n        if ((d & 7) !== 0) d += 8 - (d & 7);\n        const D = (d >>> 3) + 4;\n        const q = N[D - 4] | (N[D - 3] << 8);\n        if (Z) W = H.H.W(W, w + q);\n        W.set(new R(N.buffer, N.byteOffset + D, q), w);\n        d = (D + q) << 3;\n        w += q;\n        continue;\n      }\n      if (Z) W = H.H.W(W, w + (1 << 17));\n      if (m === 1) {\n        v = b.J;\n        C = b.h;\n        X = (1 << 9) - 1;\n        u = (1 << 5) - 1;\n      }\n      if (m === 2) {\n        J = A(N, d, 5) + 257;\n        h = A(N, d + 5, 5) + 1;\n        Q = A(N, d + 10, 4) + 4;\n        d += 14;\n        // const E = d;\n        let j = 1;\n        for (let c = 0; c < 38; c += 2) {\n          b.Q[c] = 0;\n          b.Q[c + 1] = 0;\n        }\n        for (let c = 0; c < Q; c++) {\n          const K = A(N, d + c * 3, 3);\n          b.Q[(b.X[c] << 1) + 1] = K;\n          if (K > j) j = K;\n        }\n        d += 3 * Q;\n        M(b.Q, j);\n        I(b.Q, j, b.u);\n        v = b.w;\n        C = b.d;\n        d = l(b.u, (1 << j) - 1, J + h, N, d, b.v);\n        const r = V.V(b.v, 0, J, b.C);\n        X = (1 << r) - 1;\n        const S = V.V(b.v, J, h, b.D);\n        u = (1 << S) - 1;\n        M(b.C, r);\n        I(b.C, r, v);\n        M(b.D, S);\n        I(b.D, S, C);\n      }\n      // eslint-disable-next-line no-constant-condition\n      while (!0) {\n        const T = v[e(N, d) & X];\n        d += T & 15;\n        const p = T >>> 4;\n        if (p >>> 8 === 0) {\n          W[w++] = p;\n        } else if (p === 256) {\n          break;\n        } else {\n          let z = w + p - 254;\n          if (p > 264) {\n            const _ = b.q[p - 257];\n            z = w + (_ >>> 3) + A(N, d, _ & 7);\n            d += _ & 7;\n          }\n          const $ = C[e(N, d) & u];\n          d += $ & 15;\n          const s = $ >>> 4;\n          const Y = b.c[s];\n          const a = (Y >>> 4) + n(N, d, Y & 15);\n          d += Y & 15;\n          while (w < z) {\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n          }\n          w = z;\n        }\n      }\n    }\n    return W.length === w ? W : W.slice(0, w);\n  };\n  H.H.W = function (N, W) {\n    const R = N.length;\n    if (W <= R) return N;\n    const V = new Uint8Array(R << 1);\n    V.set(N, 0);\n    return V;\n  };\n  H.H.R = function (N, W, R, V, n, A) {\n    const l = H.H.e;\n    const M = H.H.Z;\n    let I = 0;\n    while (I < R) {\n      const e = N[M(V, n) & W];\n      n += e & 15;\n      const b = e >>> 4;\n      if (b <= 15) {\n        A[I] = b;\n        I++;\n      } else {\n        let Z = 0;\n        let m = 0;\n        if (b === 16) {\n          m = 3 + l(V, n, 2);\n          n += 2;\n          Z = A[I - 1];\n        } else if (b === 17) {\n          m = 3 + l(V, n, 3);\n          n += 3;\n        } else if (b === 18) {\n          m = 11 + l(V, n, 7);\n          n += 7;\n        }\n        const J = I + m;\n        while (I < J) {\n          A[I] = Z;\n          I++;\n        }\n      }\n    }\n    return n;\n  };\n  H.H.V = function (N, W, R, V) {\n    let n = 0;\n    let A = 0;\n    const l = V.length >>> 1;\n    while (A < R) {\n      const M = N[A + W];\n      V[A << 1] = 0;\n      V[(A << 1) + 1] = M;\n      if (M > n) n = M;\n      A++;\n    }\n    while (A < l) {\n      V[A << 1] = 0;\n      V[(A << 1) + 1] = 0;\n      A++;\n    }\n    return n;\n  };\n  H.H.n = function (N, W) {\n    const R = H.H.m;\n    const V = N.length;\n    let n;\n    let A;\n    let l;\n    let M;\n    let I;\n    const e = R.j;\n    for (let M = 0; M <= W; M++) e[M] = 0;\n    for (M = 1; M < V; M += 2) e[N[M]]++;\n    const b = R.K;\n    n = 0;\n    e[0] = 0;\n    for (A = 1; A <= W; A++) {\n      n = (n + e[A - 1]) << 1;\n      b[A] = n;\n    }\n    for (l = 0; l < V; l += 2) {\n      I = N[l + 1];\n      if (I !== 0) {\n        N[l] = b[I];\n        b[I]++;\n      }\n    }\n  };\n  H.H.A = function (N, W, R) {\n    const V = N.length;\n    const n = H.H.m;\n    const A = n.r;\n    for (let l = 0; l < V; l += 2)\n      if (N[l + 1] !== 0) {\n        const M = l >> 1;\n        const I = N[l + 1];\n        const e = (M << 4) | I;\n        const b = W - I;\n        let Z = N[l] << b;\n        const m = Z + (1 << b);\n        while (Z !== m) {\n          const J = A[Z] >>> (15 - W);\n          R[J] = e;\n          Z++;\n        }\n      }\n  };\n  H.H.l = function (N, W) {\n    const R = H.H.m.r;\n    const V = 15 - W;\n    for (let n = 0; n < N.length; n += 2) {\n      const A = N[n] << (W - N[n + 1]);\n      N[n] = R[A] >>> V;\n    }\n  };\n  H.H.M = function (N, W, R) {\n    R = R << (W & 7);\n    const V = W >>> 3;\n    N[V] |= R;\n    N[V + 1] |= R >>> 8;\n  };\n  H.H.I = function (N, W, R) {\n    R = R << (W & 7);\n    const V = W >>> 3;\n    N[V] |= R;\n    N[V + 1] |= R >>> 8;\n    N[V + 2] |= R >>> 16;\n  };\n  H.H.e = function (N, W, R) {\n    return (\n      ((N[W >>> 3] | (N[(W >>> 3) + 1] << 8)) >>> (W & 7)) & ((1 << R) - 1)\n    );\n  };\n  H.H.b = function (N, W, R) {\n    return (\n      ((N[W >>> 3] | (N[(W >>> 3) + 1] << 8) | (N[(W >>> 3) + 2] << 16)) >>>\n        (W & 7)) &\n      ((1 << R) - 1)\n    );\n  };\n  H.H.Z = function (N, W) {\n    return (\n      (N[W >>> 3] | (N[(W >>> 3) + 1] << 8) | (N[(W >>> 3) + 2] << 16)) >>>\n      (W & 7)\n    );\n  };\n  H.H.i = function (N, W) {\n    return (\n      (N[W >>> 3] |\n        (N[(W >>> 3) + 1] << 8) |\n        (N[(W >>> 3) + 2] << 16) |\n        (N[(W >>> 3) + 3] << 24)) >>>\n      (W & 7)\n    );\n  };\n  H.H.m = (function () {\n    const N = Uint16Array;\n    const W = Uint32Array;\n    return {\n      K: new N(16),\n      j: new N(16),\n      X: [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],\n      S: [\n        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59,\n        67, 83, 99, 115, 131, 163, 195, 227, 258, 999, 999, 999\n      ],\n      T: [\n        0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4,\n        5, 5, 5, 5, 0, 0, 0, 0\n      ],\n      q: new N(32),\n      p: [\n        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385,\n        513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577,\n        65535, 65535\n      ],\n      z: [\n        0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10,\n        10, 11, 11, 12, 12, 13, 13, 0, 0\n      ],\n      c: new W(32),\n      J: new N(512),\n      _: [],\n      h: new N(32),\n      $: [],\n      w: new N(32768),\n      C: [],\n      v: [],\n      d: new N(32768),\n      D: [],\n      u: new N(512),\n      Q: [],\n      r: new N(1 << 15),\n      s: new W(286),\n      Y: new W(30),\n      a: new W(19),\n      t: new W(15e3),\n      k: new N(1 << 16),\n      g: new N(1 << 15)\n    };\n  })();\n  (function () {\n    const N = H.H.m;\n    const W = 1 << 15;\n    for (let R = 0; R < W; R++) {\n      let V = R;\n      V = ((V & 2863311530) >>> 1) | ((V & 1431655765) << 1);\n      V = ((V & 3435973836) >>> 2) | ((V & 858993459) << 2);\n      V = ((V & 4042322160) >>> 4) | ((V & 252645135) << 4);\n      V = ((V & 4278255360) >>> 8) | ((V & 16711935) << 8);\n      N.r[R] = ((V >>> 16) | (V << 16)) >>> 17;\n    }\n    function n(A, l, M) {\n      while (l-- !== 0) A.push(0, M);\n    }\n    for (let R = 0; R < 32; R++) {\n      N.q[R] = (N.S[R] << 3) | N.T[R];\n      N.c[R] = (N.p[R] << 4) | N.z[R];\n    }\n    n(N._, 144, 8);\n    n(N._, 255 - 143, 9);\n    n(N._, 279 - 255, 7);\n    n(N._, 287 - 279, 8);\n    H.H.n(N._, 9);\n    H.H.A(N._, 9, N.J);\n    H.H.l(N._, 9);\n    n(N.$, 32, 5);\n    H.H.n(N.$, 5);\n    H.H.A(N.$, 5, N.h);\n    H.H.l(N.$, 5);\n    n(N.Q, 19, 0);\n    n(N.C, 286, 0);\n    n(N.D, 30, 0);\n    n(N.v, 320, 0);\n  })();\n  return H.H.N;\n})();\n\nUPNG.decode._readInterlace = function (data, out) {\n  const w = out.width;\n  const h = out.height;\n  const bpp = UPNG.decode._getBPP(out);\n  const cbpp = bpp >> 3;\n  const bpl = Math.ceil((w * bpp) / 8);\n  const img = new Uint8Array(h * bpl);\n  let di = 0;\n\n  const starting_row = [0, 0, 4, 0, 2, 0, 1];\n  const starting_col = [0, 4, 0, 2, 0, 1, 0];\n  const row_increment = [8, 8, 8, 4, 4, 2, 2];\n  const col_increment = [8, 8, 4, 4, 2, 2, 1];\n\n  let pass = 0;\n  while (pass < 7) {\n    const ri = row_increment[pass];\n    const ci = col_increment[pass];\n    let sw = 0;\n    let sh = 0;\n    let cr = starting_row[pass];\n    while (cr < h) {\n      cr += ri;\n      sh++;\n    }\n    let cc = starting_col[pass];\n    while (cc < w) {\n      cc += ci;\n      sw++;\n    }\n    const bpll = Math.ceil((sw * bpp) / 8);\n    UPNG.decode._filterZero(data, out, di, sw, sh);\n\n    let y = 0;\n    let row = starting_row[pass];\n    while (row < h) {\n      let col = starting_col[pass];\n      let cdi = (di + y * bpll) << 3;\n\n      while (col < w) {\n        if (bpp === 1) {\n          let val = data[cdi >> 3];\n          val = (val >> (7 - (cdi & 7))) & 1;\n          img[row * bpl + (col >> 3)] |= val << (7 - ((col & 7) << 0));\n        }\n        if (bpp === 2) {\n          let val = data[cdi >> 3];\n          val = (val >> (6 - (cdi & 7))) & 3;\n          img[row * bpl + (col >> 2)] |= val << (6 - ((col & 3) << 1));\n        }\n        if (bpp === 4) {\n          let val = data[cdi >> 3];\n          val = (val >> (4 - (cdi & 7))) & 15;\n          img[row * bpl + (col >> 1)] |= val << (4 - ((col & 1) << 2));\n        }\n        if (bpp >= 8) {\n          const ii = row * bpl + col * cbpp;\n          for (let j = 0; j < cbpp; j++) img[ii + j] = data[(cdi >> 3) + j];\n        }\n        cdi += bpp;\n        col += ci;\n      }\n      y++;\n      row += ri;\n    }\n    if (sw * sh !== 0) di += sh * (1 + bpll);\n    pass = pass + 1;\n  }\n  return img;\n};\n\nUPNG.decode._getBPP = function (out) {\n  const noc = [1, null, 3, 1, 2, null, 4][out.ctype];\n  return noc * out.depth;\n};\n\nUPNG.decode._filterZero = function (data, out, off, w, h) {\n  let bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8);\n  const paeth = UPNG.decode._paeth;\n  bpp = Math.ceil(bpp / 8);\n\n  let i = 0;\n  let di = 1;\n  let type = data[off];\n  let x = 0;\n\n  if (type > 1) data[off] = [0, 0, 1][type - 2];\n  if (type === 3)\n    for (x = bpp; x < bpl; x++)\n      data[x + 1] = (data[x + 1] + (data[x + 1 - bpp] >>> 1)) & 255;\n\n  for (let y = 0; y < h; y++) {\n    i = off + y * bpl;\n    di = i + y + 1;\n    type = data[di - 1];\n    x = 0;\n\n    if (type === 0) for (; x < bpl; x++) data[i + x] = data[di + x];\n    else if (type === 1) {\n      for (; x < bpp; x++) data[i + x] = data[di + x];\n      for (; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpp];\n    } else if (type === 2) {\n      for (; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpl];\n    } else if (type === 3) {\n      for (; x < bpp; x++)\n        data[i + x] = data[di + x] + (data[i + x - bpl] >>> 1);\n      for (; x < bpl; x++)\n        data[i + x] =\n          data[di + x] + ((data[i + x - bpl] + data[i + x - bpp]) >>> 1);\n    } else {\n      for (; x < bpp; x++)\n        data[i + x] = data[di + x] + paeth(0, data[i + x - bpl], 0);\n      for (; x < bpl; x++)\n        data[i + x] =\n          data[di + x] +\n          paeth(data[i + x - bpp], data[i + x - bpl], data[i + x - bpp - bpl]);\n    }\n  }\n  return data;\n};\n\nUPNG.decode._paeth = function (a, b, c) {\n  const p = a + b - c;\n  const pa = p - a;\n  const pb = p - b;\n  const pc = p - c;\n  if (pa * pa <= pb * pb && pa * pa <= pc * pc) return a;\n  else if (pb * pb <= pc * pc) return b;\n  return c;\n};\n\nUPNG.decode._IHDR = function (data, offset, out) {\n  const bin = UPNG._bin;\n  out.width = bin.readUint(data, offset);\n  offset += 4;\n  out.height = bin.readUint(data, offset);\n  offset += 4;\n  out.depth = data[offset];\n  offset++;\n  out.ctype = data[offset];\n  offset++;\n  out.compress = data[offset];\n  offset++;\n  out.filter = data[offset];\n  offset++;\n  out.interlace = data[offset];\n  offset++;\n};\n\nUPNG._bin = {\n  nextZero: function (data, p) {\n    while (data[p] !== 0) p++;\n    return p;\n  },\n  readUshort: function (buff, p) {\n    return (buff[p] << 8) | buff[p + 1];\n  },\n  writeUshort: function (buff, p, n) {\n    buff[p] = (n >> 8) & 255;\n    buff[p + 1] = n & 255;\n  },\n  readUint: function (buff, p) {\n    return (\n      buff[p] * (256 * 256 * 256) +\n      ((buff[p + 1] << 16) | (buff[p + 2] << 8) | buff[p + 3])\n    );\n  },\n  writeUint: function (buff, p, n) {\n    buff[p] = (n >> 24) & 255;\n    buff[p + 1] = (n >> 16) & 255;\n    buff[p + 2] = (n >> 8) & 255;\n    buff[p + 3] = n & 255;\n  },\n  readASCII: function (buff, p, l) {\n    let s = \"\";\n    for (let i = 0; i < l; i++) s += String.fromCharCode(buff[p + i]);\n    return s;\n  },\n  writeASCII: function (data, p, s) {\n    for (let i = 0; i < s.length; i++) data[p + i] = s.charCodeAt(i);\n  },\n  readBytes: function (buff, p, l) {\n    const arr = [];\n    for (let i = 0; i < l; i++) arr.push(buff[p + i]);\n    return arr;\n  },\n  pad: function (n) {\n    return n.length < 2 ? \"0\" + n : n;\n  },\n  readUTF8: function (buff, p, l) {\n    let s = \"\";\n    let ns;\n    for (let i = 0; i < l; i++)\n      s += \"%\" + UPNG._bin.pad(buff[p + i].toString(16));\n    try {\n      ns = decodeURIComponent(s);\n    } catch (e) {\n      return UPNG._bin.readASCII(buff, p, l);\n    }\n    return ns;\n  }\n};\nUPNG._copyTile = function (sb, sw, sh, tb, tw, th, xoff, yoff, mode) {\n  const w = Math.min(sw, tw);\n  const h = Math.min(sh, th);\n  let si = 0;\n  let ti = 0;\n  for (let y = 0; y < h; y++)\n    for (let x = 0; x < w; x++) {\n      if (xoff >= 0 && yoff >= 0) {\n        si = (y * sw + x) << 2;\n        ti = ((yoff + y) * tw + xoff + x) << 2;\n      } else {\n        si = ((-yoff + y) * sw - xoff + x) << 2;\n        ti = (y * tw + x) << 2;\n      }\n\n      if (mode === 0) {\n        tb[ti] = sb[si];\n        tb[ti + 1] = sb[si + 1];\n        tb[ti + 2] = sb[si + 2];\n        tb[ti + 3] = sb[si + 3];\n      } else if (mode === 1) {\n        const fa = sb[si + 3] * (1 / 255);\n        const fr = sb[si] * fa;\n        const fg = sb[si + 1] * fa;\n        const fb = sb[si + 2] * fa;\n        const ba = tb[ti + 3] * (1 / 255);\n        const br = tb[ti] * ba;\n        const bg = tb[ti + 1] * ba;\n        const bb = tb[ti + 2] * ba;\n\n        const ifa = 1 - fa;\n        const oa = fa + ba * ifa;\n        const ioa = oa === 0 ? 0 : 1 / oa;\n        tb[ti + 3] = 255 * oa;\n        tb[ti + 0] = (fr + br * ifa) * ioa;\n        tb[ti + 1] = (fg + bg * ifa) * ioa;\n        tb[ti + 2] = (fb + bb * ifa) * ioa;\n      } else if (mode === 2) {\n        // copy only differences, otherwise zero\n        const fa = sb[si + 3];\n        const fr = sb[si];\n        const fg = sb[si + 1];\n        const fb = sb[si + 2];\n        const ba = tb[ti + 3];\n        const br = tb[ti];\n        const bg = tb[ti + 1];\n        const bb = tb[ti + 2];\n        if (fa === ba && fr === br && fg === bg && fb === bb) {\n          tb[ti] = 0;\n          tb[ti + 1] = 0;\n          tb[ti + 2] = 0;\n          tb[ti + 3] = 0;\n        } else {\n          tb[ti] = fr;\n          tb[ti + 1] = fg;\n          tb[ti + 2] = fb;\n          tb[ti + 3] = fa;\n        }\n      } else if (mode === 3) {\n        // check if can be blended\n        const fa = sb[si + 3];\n        const fr = sb[si];\n        const fg = sb[si + 1];\n        const fb = sb[si + 2];\n        const ba = tb[ti + 3];\n        const br = tb[ti];\n        const bg = tb[ti + 1];\n        const bb = tb[ti + 2];\n        if (fa === ba && fr === br && fg === bg && fb === bb) continue;\n        if (fa < 220 && ba > 20) return false;\n      }\n    }\n  return true;\n};\n\nUPNG.encode = function (bufs, w, h, ps, dels, tabs, forbidPlte) {\n  if (ps === null) ps = 0;\n  if (forbidPlte === null) forbidPlte = false;\n\n  const nimg = UPNG.encode.compress(bufs, w, h, ps, [\n    false,\n    false,\n    false,\n    0,\n    forbidPlte\n  ]);\n  UPNG.encode.compressPNG(nimg, -1);\n\n  return UPNG.encode._main(nimg, w, h, dels, tabs);\n};\n\nUPNG.encodeLL = function (bufs, w, h, cc, ac, depth, dels, tabs) {\n  const nimg = {\n    ctype: 0 + (cc === 1 ? 0 : 2) + (ac === 0 ? 0 : 4),\n    depth,\n    frames: []\n  };\n\n  const bipp = (cc + ac) * depth;\n  const bipl = bipp * w;\n  for (let i = 0; i < bufs.length; i++)\n    nimg.frames.push({\n      rect: { x: 0, y: 0, width: w, height: h },\n      img: new Uint8Array(bufs[i]),\n      blend: 0,\n      dispose: 1,\n      bpp: Math.ceil(bipp / 8),\n      bpl: Math.ceil(bipl / 8)\n    });\n\n  UPNG.encode.compressPNG(nimg, 0, true);\n\n  const out = UPNG.encode._main(nimg, w, h, dels, tabs);\n  return out;\n};\n\nUPNG.encode._main = function (nimg, w, h, dels, tabs) {\n  if (!tabs) tabs = {};\n  const crc = UPNG.crc.crc;\n  const wUi = UPNG._bin.writeUint;\n  const wUs = UPNG._bin.writeUshort;\n  const wAs = UPNG._bin.writeASCII;\n  let offset = 8;\n  const anim = nimg.frames.length > 1;\n  let pltAlpha = false;\n\n  let leng = 8 + (16 + 5 + 4) + (anim ? 20 : 0);\n  if (tabs.sRGB !== null && tabs.sRGB !== undefined) leng += 8 + 1 + 4;\n  if (tabs.pHYs !== null && tabs.pHYs !== undefined) leng += 8 + 9 + 4;\n  if (nimg.ctype === 3) {\n    const dl = nimg.plte.length;\n    for (let i = 0; i < dl; i++)\n      if (nimg.plte[i] >>> 24 !== 255) pltAlpha = true;\n    leng += 8 + dl * 3 + 4 + (pltAlpha ? 8 + dl * 1 + 4 : 0);\n  }\n  for (let j = 0; j < nimg.frames.length; j++) {\n    const fr = nimg.frames[j];\n    if (anim) leng += 38;\n    leng += fr.cimg.length + 12;\n    if (j !== 0) leng += 4;\n  }\n  leng += 12;\n\n  const data = new Uint8Array(leng);\n  const wr = [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a];\n  for (let i = 0; i < 8; i++) data[i] = wr[i];\n\n  wUi(data, offset, 13);\n  offset += 4;\n  wAs(data, offset, \"IHDR\");\n  offset += 4;\n  wUi(data, offset, w);\n  offset += 4;\n  wUi(data, offset, h);\n  offset += 4;\n  data[offset] = nimg.depth;\n  offset++; // depth\n  data[offset] = nimg.ctype;\n  offset++; // ctype\n  data[offset] = 0;\n  offset++; // compress\n  data[offset] = 0;\n  offset++; // filter\n  data[offset] = 0;\n  offset++; // interlace\n  wUi(data, offset, crc(data, offset - 17, 17));\n  offset += 4; // crc\n\n  // 13 bytes to say, that it is sRGB\n  if (tabs.sRGB !== null && tabs.sRGB !== undefined) {\n    wUi(data, offset, 1);\n    offset += 4;\n    wAs(data, offset, \"sRGB\");\n    offset += 4;\n    data[offset] = tabs.sRGB;\n    offset++;\n    wUi(data, offset, crc(data, offset - 5, 5));\n    offset += 4; // crc\n  }\n  if (tabs.pHYs !== null && tabs.pHYs !== undefined) {\n    wUi(data, offset, 9);\n    offset += 4;\n    wAs(data, offset, \"pHYs\");\n    offset += 4;\n    wUi(data, offset, tabs.pHYs[0]);\n    offset += 4;\n    wUi(data, offset, tabs.pHYs[1]);\n    offset += 4;\n    data[offset] = tabs.pHYs[2];\n    offset++;\n    wUi(data, offset, crc(data, offset - 13, 13));\n    offset += 4; // crc\n  }\n\n  if (anim) {\n    wUi(data, offset, 8);\n    offset += 4;\n    wAs(data, offset, \"acTL\");\n    offset += 4;\n    wUi(data, offset, nimg.frames.length);\n    offset += 4;\n    wUi(data, offset, tabs.loop != null ? tabs.loop : 0);\n    offset += 4;\n    wUi(data, offset, crc(data, offset - 12, 12));\n    offset += 4; // crc\n  }\n\n  if (nimg.ctype === 3) {\n    const dl = nimg.plte.length;\n    wUi(data, offset, dl * 3);\n    offset += 4;\n    wAs(data, offset, \"PLTE\");\n    offset += 4;\n    for (let i = 0; i < dl; i++) {\n      const ti = i * 3;\n      const c = nimg.plte[i];\n      const r = c & 255;\n      const g = (c >>> 8) & 255;\n      const b = (c >>> 16) & 255;\n      data[offset + ti + 0] = r;\n      data[offset + ti + 1] = g;\n      data[offset + ti + 2] = b;\n    }\n    offset += dl * 3;\n    wUi(data, offset, crc(data, offset - dl * 3 - 4, dl * 3 + 4));\n    offset += 4; // crc\n\n    if (pltAlpha) {\n      wUi(data, offset, dl);\n      offset += 4;\n      wAs(data, offset, \"tRNS\");\n      offset += 4;\n      for (let i = 0; i < dl; i++)\n        data[offset + i] = (nimg.plte[i] >>> 24) & 255;\n      offset += dl;\n      wUi(data, offset, crc(data, offset - dl - 4, dl + 4));\n      offset += 4; // crc\n    }\n  }\n\n  let fi = 0;\n  for (let j = 0; j < nimg.frames.length; j++) {\n    const fr = nimg.frames[j];\n    if (anim) {\n      wUi(data, offset, 26);\n      offset += 4;\n      wAs(data, offset, \"fcTL\");\n      offset += 4;\n      wUi(data, offset, fi++);\n      offset += 4;\n      wUi(data, offset, fr.rect.width);\n      offset += 4;\n      wUi(data, offset, fr.rect.height);\n      offset += 4;\n      wUi(data, offset, fr.rect.x);\n      offset += 4;\n      wUi(data, offset, fr.rect.y);\n      offset += 4;\n      wUs(data, offset, dels[j]);\n      offset += 2;\n      wUs(data, offset, 1000);\n      offset += 2;\n      data[offset] = fr.dispose;\n      offset++; // dispose\n      data[offset] = fr.blend;\n      offset++; // blend\n      wUi(data, offset, crc(data, offset - 30, 30));\n      offset += 4; // crc\n    }\n\n    const imgd = fr.cimg;\n    const dl = imgd.length;\n    wUi(data, offset, dl + (j === 0 ? 0 : 4));\n    offset += 4;\n    const ioff = offset;\n    wAs(data, offset, j === 0 ? \"IDAT\" : \"fdAT\");\n    offset += 4;\n    if (j !== 0) {\n      wUi(data, offset, fi++);\n      offset += 4;\n    }\n    data.set(imgd, offset);\n    offset += dl;\n    wUi(data, offset, crc(data, ioff, offset - ioff));\n    offset += 4; // crc\n  }\n\n  wUi(data, offset, 0);\n  offset += 4;\n  wAs(data, offset, \"IEND\");\n  offset += 4;\n  wUi(data, offset, crc(data, offset - 4, 4));\n  offset += 4; // crc\n\n  return data.buffer;\n};\n\nUPNG.encode.compressPNG = function (out, filter, levelZero) {\n  for (let i = 0; i < out.frames.length; i++) {\n    const frm = out.frames[i];\n    // const nw = frm.rect.width;\n    const nh = frm.rect.height;\n    const fdata = new Uint8Array(nh * frm.bpl + nh);\n    frm.cimg = UPNG.encode._filterZero(\n      frm.img,\n      nh,\n      frm.bpp,\n      frm.bpl,\n      fdata,\n      filter,\n      levelZero\n    );\n  }\n};\n\nUPNG.encode.compress = function (\n  bufs,\n  w,\n  h,\n  ps,\n  prms // prms:  onlyBlend, minBits, forbidPlte\n) {\n  const onlyBlend = prms[0];\n  const evenCrd = prms[1];\n  const forbidPrev = prms[2];\n  const minBits = prms[3];\n  const forbidPlte = prms[4];\n\n  let ctype = 6;\n  let depth = 8;\n  let alphaAnd = 255;\n\n  for (let j = 0; j < bufs.length; j++) {\n    // when not quantized, other frames can contain colors, that are not in an initial frame\n    const img = new Uint8Array(bufs[j]);\n    const ilen = img.length;\n    for (let i = 0; i < ilen; i += 4) alphaAnd &= img[i + 3];\n  }\n  const gotAlpha = alphaAnd !== 255;\n\n  // brute : frames can only be copied, not \"blended\"\n  const frms = UPNG.encode.framize(bufs, w, h, onlyBlend, evenCrd, forbidPrev);\n\n  const cmap = {};\n  const plte = [];\n  const inds = [];\n\n  if (ps !== 0) {\n    const nbufs = [];\n    for (let i = 0; i < frms.length; i++) nbufs.push(frms[i].img.buffer);\n\n    const abuf = UPNG.encode.concatRGBA(nbufs);\n    const qres = UPNG.quantize(abuf, ps);\n    let cof = 0;\n    const bb = new Uint8Array(qres.abuf);\n    for (let i = 0; i < frms.length; i++) {\n      const ti = frms[i].img;\n      const bln = ti.length;\n      inds.push(new Uint8Array(qres.inds.buffer, cof >> 2, bln >> 2));\n      for (let j = 0; j < bln; j += 4) {\n        ti[j] = bb[cof + j];\n        ti[j + 1] = bb[cof + j + 1];\n        ti[j + 2] = bb[cof + j + 2];\n        ti[j + 3] = bb[cof + j + 3];\n      }\n      cof += bln;\n    }\n\n    for (let i = 0; i < qres.plte.length; i++) plte.push(qres.plte[i].est.rgba);\n  } else {\n    // what if ps==0, but there are <=256 colors?  we still need to detect, if the palette could be used\n    for (let j = 0; j < frms.length; j++) {\n      // when not quantized, other frames can contain colors, that are not in an initial frame\n      const frm = frms[j];\n      const img32 = new Uint32Array(frm.img.buffer);\n      const nw = frm.rect.width;\n      const ilen = img32.length;\n      const ind = new Uint8Array(ilen);\n      inds.push(ind);\n      for (let i = 0; i < ilen; i++) {\n        const c = img32[i];\n        if (i !== 0 && c === img32[i - 1]) ind[i] = ind[i - 1];\n        else if (i > nw && c === img32[i - nw]) ind[i] = ind[i - nw];\n        else {\n          let cmc = cmap[c];\n          if (cmc === null) {\n            cmap[c] = cmc = plte.length;\n            plte.push(c);\n            if (plte.length >= 300) break;\n          }\n          ind[i] = cmc;\n        }\n      }\n    }\n  }\n\n  const cc = plte.length;\n  if (cc <= 256 && forbidPlte === false) {\n    if (cc <= 2) depth = 1;\n    else if (cc <= 4) depth = 2;\n    else if (cc <= 16) depth = 4;\n    else depth = 8;\n    depth = Math.max(depth, minBits);\n  }\n\n  for (let j = 0; j < frms.length; j++) {\n    const frm = frms[j];\n    // const nx = frm.rect.x;\n    // const ny = frm.rect.y;\n    const nw = frm.rect.width;\n    const nh = frm.rect.height;\n    let cimg = frm.img;\n    // const cimg32 = new Uint32Array(cimg.buffer);\n    let bpl = 4 * nw;\n    let bpp = 4;\n    if (cc <= 256 && forbidPlte === false) {\n      bpl = Math.ceil((depth * nw) / 8);\n      const nimg = new Uint8Array(bpl * nh);\n      const inj = inds[j];\n      for (let y = 0; y < nh; y++) {\n        const i = y * bpl;\n        const ii = y * nw;\n        if (depth === 8) for (let x = 0; x < nw; x++) nimg[i + x] = inj[ii + x];\n        else if (depth === 4)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 1)] |= inj[ii + x] << (4 - (x & 1) * 4);\n        else if (depth === 2)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 2)] |= inj[ii + x] << (6 - (x & 3) * 2);\n        else if (depth === 1)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 3)] |= inj[ii + x] << (7 - (x & 7) * 1);\n      }\n      cimg = nimg;\n      ctype = 3;\n      bpp = 1;\n    } else if (gotAlpha === false && frms.length === 1) {\n      // some next \"reduced\" frames may contain alpha for blending\n      const nimg = new Uint8Array(nw * nh * 3);\n      const area = nw * nh;\n      for (let i = 0; i < area; i++) {\n        const ti = i * 3;\n        const qi = i * 4;\n        nimg[ti] = cimg[qi];\n        nimg[ti + 1] = cimg[qi + 1];\n        nimg[ti + 2] = cimg[qi + 2];\n      }\n      cimg = nimg;\n      ctype = 2;\n      bpp = 3;\n      bpl = 3 * nw;\n    }\n    frm.img = cimg;\n    frm.bpl = bpl;\n    frm.bpp = bpp;\n  }\n\n  return { ctype, depth, plte, frames: frms };\n};\nUPNG.encode.framize = function (bufs, w, h, alwaysBlend, evenCrd, forbidPrev) {\n  /**\n   * DISPOSE\n   * 0 : no change\n   * 1 : clear to transparent\n   * 2 : retstore to content before rendering (previous frame disposed)\n   * BLEND\n   * 0 : replace\n   * 1 : blend\n   */\n  const frms = [];\n  for (let j = 0; j < bufs.length; j++) {\n    const cimg = new Uint8Array(bufs[j]);\n    const cimg32 = new Uint32Array(cimg.buffer);\n    let nimg;\n\n    let nx = 0;\n    let ny = 0;\n    let nw = w;\n    let nh = h;\n    let blend = alwaysBlend ? 1 : 0;\n    if (j !== 0) {\n      const tlim =\n        forbidPrev || alwaysBlend || j === 1 || frms[j - 2].dispose !== 0\n          ? 1\n          : 2;\n      let tstp = 0;\n      let tarea = 1e9;\n      for (let it = 0; it < tlim; it++) {\n        // const pimg = new Uint8Array(bufs[j - 1 - it]);\n        const p32 = new Uint32Array(bufs[j - 1 - it]);\n        let mix = w;\n        let miy = h;\n        let max = -1;\n        let may = -1;\n        for (let y = 0; y < h; y++)\n          for (let x = 0; x < w; x++) {\n            const i = y * w + x;\n            if (cimg32[i] !== p32[i]) {\n              if (x < mix) mix = x;\n              if (x > max) max = x;\n              if (y < miy) miy = y;\n              if (y > may) may = y;\n            }\n          }\n        if (max === -1) mix = miy = max = may = 0;\n        if (evenCrd) {\n          if ((mix & 1) === 1) mix--;\n          if ((miy & 1) === 1) miy--;\n        }\n        const sarea = (max - mix + 1) * (may - miy + 1);\n        if (sarea < tarea) {\n          tarea = sarea;\n          tstp = it;\n          nx = mix;\n          ny = miy;\n          nw = max - mix + 1;\n          nh = may - miy + 1;\n        }\n      }\n\n      // alwaysBlend: pokud zjistím, že blendit nelze, nastavím předchozímu snímku dispose=1. Zajistím, aby obsahoval můj obdélník.\n      const pimg = new Uint8Array(bufs[j - 1 - tstp]);\n      if (tstp === 1) frms[j - 1].dispose = 2;\n\n      nimg = new Uint8Array(nw * nh * 4);\n      UPNG._copyTile(pimg, w, h, nimg, nw, nh, -nx, -ny, 0);\n\n      blend = UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 3) ? 1 : 0;\n      if (blend === 1)\n        UPNG.encode._prepareDiff(cimg, w, h, nimg, {\n          x: nx,\n          y: ny,\n          width: nw,\n          height: nh\n        });\n      else UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 0);\n    } else nimg = cimg.slice(0); // img may be rewritten further ... don't rewrite input\n\n    frms.push({\n      rect: { x: nx, y: ny, width: nw, height: nh },\n      img: nimg,\n      blend,\n      dispose: 0\n    });\n  }\n\n  if (alwaysBlend)\n    for (let j = 0; j < frms.length; j++) {\n      const frm = frms[j];\n      if (frm.blend === 1) continue;\n      const r0 = frm.rect;\n      const r1 = frms[j - 1].rect;\n      const miX = Math.min(r0.x, r1.x);\n      const miY = Math.min(r0.y, r1.y);\n      const maX = Math.max(r0.x + r0.width, r1.x + r1.width);\n      const maY = Math.max(r0.y + r0.height, r1.y + r1.height);\n      const r = { x: miX, y: miY, width: maX - miX, height: maY - miY };\n\n      frms[j - 1].dispose = 1;\n      if (j - 1 !== 0)\n        UPNG.encode._updateFrame(bufs, w, h, frms, j - 1, r, evenCrd);\n      UPNG.encode._updateFrame(bufs, w, h, frms, j, r, evenCrd);\n    }\n  // let area = 0;\n  // if (bufs.length !== 1)\n  //   for (let i = 0; i < frms.length; i++) {\n  //     const frm = frms[i];\n  //     area += frm.rect.width * frm.rect.height;\n  //   }\n\n  return frms;\n};\nUPNG.encode._updateFrame = function (bufs, w, h, frms, i, r, evenCrd) {\n  const U8 = Uint8Array;\n  const U32 = Uint32Array;\n  const pimg = new U8(bufs[i - 1]);\n  const pimg32 = new U32(bufs[i - 1]);\n  const nimg = i + 1 < bufs.length ? new U8(bufs[i + 1]) : null;\n  const cimg = new U8(bufs[i]);\n  const cimg32 = new U32(cimg.buffer);\n\n  let mix = w;\n  let miy = h;\n  let max = -1;\n  let may = -1;\n  for (let y = 0; y < r.height; y++)\n    for (let x = 0; x < r.width; x++) {\n      const cx = r.x + x;\n      const cy = r.y + y;\n      const j = cy * w + cx;\n      const cc = cimg32[j];\n      // no need to draw transparency, or to dispose it. Or, if writing the same color and the next one does not need transparency.\n      if (\n        !(\n          cc === 0 ||\n          (frms[i - 1].dispose === 0 &&\n            pimg32[j] === cc &&\n            (nimg === null || nimg[j * 4 + 3] !== 0))\n        )\n      ) {\n        if (cx < mix) mix = cx;\n        if (cx > max) max = cx;\n        if (cy < miy) miy = cy;\n        if (cy > may) may = cy;\n      }\n    }\n  if (max === -1) mix = miy = max = may = 0;\n  if (evenCrd) {\n    if ((mix & 1) === 1) mix--;\n    if ((miy & 1) === 1) miy--;\n  }\n  r = { x: mix, y: miy, width: max - mix + 1, height: may - miy + 1 };\n\n  const fr = frms[i];\n  fr.rect = r;\n  fr.blend = 1;\n  fr.img = new Uint8Array(r.width * r.height * 4);\n  if (frms[i - 1].dispose === 0) {\n    UPNG._copyTile(pimg, w, h, fr.img, r.width, r.height, -r.x, -r.y, 0);\n    UPNG.encode._prepareDiff(cimg, w, h, fr.img, r);\n  } else UPNG._copyTile(cimg, w, h, fr.img, r.width, r.height, -r.x, -r.y, 0);\n};\nUPNG.encode._prepareDiff = function (cimg, w, h, nimg, rec) {\n  UPNG._copyTile(cimg, w, h, nimg, rec.width, rec.height, -rec.x, -rec.y, 2);\n};\n\nUPNG.encode._filterZero = function (img, h, bpp, bpl, data, filter, levelZero) {\n  const fls = [];\n  let ftry = [0, 1, 2, 3, 4];\n  if (filter !== -1) ftry = [filter];\n  else if (h * bpl > 500000 || bpp === 1) ftry = [0];\n  let opts;\n  if (levelZero) opts = { level: 0 };\n\n  const CMPR = data.length > 10e6 && UZIP != null ? UZIP : pako;\n\n  for (let i = 0; i < ftry.length; i++) {\n    for (let y = 0; y < h; y++)\n      UPNG.encode._filterLine(data, img, y, bpl, bpp, ftry[i]);\n    fls.push(CMPR.deflate(data, opts));\n  }\n\n  let ti;\n  let tsize = 1e9;\n  for (let i = 0; i < fls.length; i++)\n    if (fls[i].length < tsize) {\n      ti = i;\n      tsize = fls[i].length;\n    }\n  return fls[ti];\n};\nUPNG.encode._filterLine = function (data, img, y, bpl, bpp, type) {\n  const i = y * bpl;\n  let di = i + y;\n  const paeth = UPNG.decode._paeth;\n  data[di] = type;\n  di++;\n\n  if (type === 0) {\n    if (bpl < 500) for (let x = 0; x < bpl; x++) data[di + x] = img[i + x];\n    else data.set(new Uint8Array(img.buffer, i, bpl), di);\n  } else if (type === 1) {\n    for (let x = 0; x < bpp; x++) data[di + x] = img[i + x];\n    for (let x = bpp; x < bpl; x++)\n      data[di + x] = (img[i + x] - img[i + x - bpp] + 256) & 255;\n  } else if (y === 0) {\n    for (let x = 0; x < bpp; x++) data[di + x] = img[i + x];\n\n    if (type === 2) for (let x = bpp; x < bpl; x++) data[di + x] = img[i + x];\n    if (type === 3)\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] = (img[i + x] - (img[i + x - bpp] >> 1) + 256) & 255;\n    if (type === 4)\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] = (img[i + x] - paeth(img[i + x - bpp], 0, 0) + 256) & 255;\n  } else {\n    if (type === 2) {\n      for (let x = 0; x < bpl; x++)\n        data[di + x] = (img[i + x] + 256 - img[i + x - bpl]) & 255;\n    }\n    if (type === 3) {\n      for (let x = 0; x < bpp; x++)\n        data[di + x] = (img[i + x] + 256 - (img[i + x - bpl] >> 1)) & 255;\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] =\n          (img[i + x] + 256 - ((img[i + x - bpl] + img[i + x - bpp]) >> 1)) &\n          255;\n    }\n    if (type === 4) {\n      for (let x = 0; x < bpp; x++)\n        data[di + x] = (img[i + x] + 256 - paeth(0, img[i + x - bpl], 0)) & 255;\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] =\n          (img[i + x] +\n            256 -\n            paeth(img[i + x - bpp], img[i + x - bpl], img[i + x - bpp - bpl])) &\n          255;\n    }\n  }\n};\n\nUPNG.crc = {\n  table: (function () {\n    const tab = new Uint32Array(256);\n    for (let n = 0; n < 256; n++) {\n      let c = n;\n      for (let k = 0; k < 8; k++) {\n        if (c & 1) c = 0xedb88320 ^ (c >>> 1);\n        else c = c >>> 1;\n      }\n      tab[n] = c;\n    }\n    return tab;\n  })(),\n  update: function (c, buf, off, len) {\n    for (let i = 0; i < len; i++)\n      c = UPNG.crc.table[(c ^ buf[off + i]) & 0xff] ^ (c >>> 8);\n    return c;\n  },\n  crc: function (b, o, l) {\n    return UPNG.crc.update(0xffffffff, b, o, l) ^ 0xffffffff;\n  }\n};\n\nUPNG.quantize = function (abuf, ps) {\n  const oimg = new Uint8Array(abuf);\n  const nimg = oimg.slice(0);\n  const nimg32 = new Uint32Array(nimg.buffer);\n\n  const KD = UPNG.quantize.getKDtree(nimg, ps);\n  const root = KD[0];\n  const leafs = KD[1];\n\n  const planeDst = UPNG.quantize.planeDst;\n  const sb = oimg;\n  const tb = nimg32;\n  const len = sb.length;\n\n  const inds = new Uint8Array(oimg.length >> 2);\n  let nd;\n  if (oimg.length < 20e6)\n    // precise, but slow :(\n    for (let i = 0; i < len; i += 4) {\n      const r = sb[i] * (1 / 255);\n      const g = sb[i + 1] * (1 / 255);\n      const b = sb[i + 2] * (1 / 255);\n      const a = sb[i + 3] * (1 / 255);\n\n      nd = UPNG.quantize.getNearest(root, r, g, b, a);\n      inds[i >> 2] = nd.ind;\n      tb[i >> 2] = nd.est.rgba;\n    }\n  else\n    for (let i = 0; i < len; i += 4) {\n      const r = sb[i] * (1 / 255);\n      const g = sb[i + 1] * (1 / 255);\n      const b = sb[i + 2] * (1 / 255);\n      const a = sb[i + 3] * (1 / 255);\n\n      nd = root;\n      while (nd.left)\n        nd = planeDst(nd.est, r, g, b, a) <= 0 ? nd.left : nd.right;\n      inds[i >> 2] = nd.ind;\n      tb[i >> 2] = nd.est.rgba;\n    }\n  return { abuf: nimg.buffer, inds, plte: leafs };\n};\n\nUPNG.quantize.getKDtree = function (nimg, ps, err) {\n  if (err === null) err = 0.0001;\n  const nimg32 = new Uint32Array(nimg.buffer);\n\n  const root = {\n    i0: 0,\n    i1: nimg.length,\n    bst: null,\n    est: null,\n    tdst: 0,\n    left: null,\n    right: null\n  }; // basic statistic, extra statistic\n  root.bst = UPNG.quantize.stats(nimg, root.i0, root.i1);\n  root.est = UPNG.quantize.estats(root.bst);\n  const leafs = [root];\n\n  while (leafs.length < ps) {\n    let maxL = 0;\n    let mi = 0;\n    for (let i = 0; i < leafs.length; i++)\n      if (leafs[i].est.L > maxL) {\n        maxL = leafs[i].est.L;\n        mi = i;\n      }\n    if (maxL < err) break;\n    const node = leafs[mi];\n\n    const s0 = UPNG.quantize.splitPixels(\n      nimg,\n      nimg32,\n      node.i0,\n      node.i1,\n      node.est.e,\n      node.est.eMq255\n    );\n    const s0wrong = node.i0 >= s0 || node.i1 <= s0;\n    if (s0wrong) {\n      node.est.L = 0;\n      continue;\n    }\n\n    const ln = {\n      i0: node.i0,\n      i1: s0,\n      bst: null,\n      est: null,\n      tdst: 0,\n      left: null,\n      right: null\n    };\n    ln.bst = UPNG.quantize.stats(nimg, ln.i0, ln.i1);\n    ln.est = UPNG.quantize.estats(ln.bst);\n    const rn = {\n      i0: s0,\n      i1: node.i1,\n      bst: null,\n      est: null,\n      tdst: 0,\n      left: null,\n      right: null\n    };\n    rn.bst = { R: [], m: [], N: node.bst.N - ln.bst.N };\n    for (let i = 0; i < 16; i++) rn.bst.R[i] = node.bst.R[i] - ln.bst.R[i];\n    for (let i = 0; i < 4; i++) rn.bst.m[i] = node.bst.m[i] - ln.bst.m[i];\n    rn.est = UPNG.quantize.estats(rn.bst);\n\n    node.left = ln;\n    node.right = rn;\n    leafs[mi] = ln;\n    leafs.push(rn);\n  }\n  leafs.sort(function (a, b) {\n    return b.bst.N - a.bst.N;\n  });\n  for (let i = 0; i < leafs.length; i++) leafs[i].ind = i;\n  return [root, leafs];\n};\n\nUPNG.quantize.getNearest = function (nd, r, g, b, a) {\n  if (nd.left == null) {\n    nd.tdst = UPNG.quantize.dist(nd.est.q, r, g, b, a);\n    return nd;\n  }\n  const planeDst = UPNG.quantize.planeDst(nd.est, r, g, b, a);\n\n  let node0 = nd.left;\n  let node1 = nd.right;\n  if (planeDst > 0) {\n    node0 = nd.right;\n    node1 = nd.left;\n  }\n\n  const ln = UPNG.quantize.getNearest(node0, r, g, b, a);\n  if (ln.tdst <= planeDst * planeDst) return ln;\n  const rn = UPNG.quantize.getNearest(node1, r, g, b, a);\n  return rn.tdst < ln.tdst ? rn : ln;\n};\nUPNG.quantize.planeDst = function (est, r, g, b, a) {\n  const e = est.e;\n  return e[0] * r + e[1] * g + e[2] * b + e[3] * a - est.eMq;\n};\nUPNG.quantize.dist = function (q, r, g, b, a) {\n  const d0 = r - q[0];\n  const d1 = g - q[1];\n  const d2 = b - q[2];\n  const d3 = a - q[3];\n  return d0 * d0 + d1 * d1 + d2 * d2 + d3 * d3;\n};\n\nUPNG.quantize.splitPixels = function (nimg, nimg32, i0, i1, e, eMq) {\n  const vecDot = UPNG.quantize.vecDot;\n  i1 -= 4;\n  // const shfs = 0;\n  while (i0 < i1) {\n    while (vecDot(nimg, i0, e) <= eMq) i0 += 4;\n    while (vecDot(nimg, i1, e) > eMq) i1 -= 4;\n    if (i0 >= i1) break;\n\n    const t = nimg32[i0 >> 2];\n    nimg32[i0 >> 2] = nimg32[i1 >> 2];\n    nimg32[i1 >> 2] = t;\n\n    i0 += 4;\n    i1 -= 4;\n  }\n  while (vecDot(nimg, i0, e) > eMq) i0 -= 4;\n  return i0 + 4;\n};\nUPNG.quantize.vecDot = function (nimg, i, e) {\n  return (\n    nimg[i] * e[0] +\n    nimg[i + 1] * e[1] +\n    nimg[i + 2] * e[2] +\n    nimg[i + 3] * e[3]\n  );\n};\nUPNG.quantize.stats = function (nimg, i0, i1) {\n  const R = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n  const m = [0, 0, 0, 0];\n  const N = (i1 - i0) >> 2;\n  for (let i = i0; i < i1; i += 4) {\n    const r = nimg[i] * (1 / 255);\n    const g = nimg[i + 1] * (1 / 255);\n    const b = nimg[i + 2] * (1 / 255);\n    const a = nimg[i + 3] * (1 / 255);\n    m[0] += r;\n    m[1] += g;\n    m[2] += b;\n    m[3] += a;\n\n    R[0] += r * r;\n    R[1] += r * g;\n    R[2] += r * b;\n    R[3] += r * a;\n    R[5] += g * g;\n    R[6] += g * b;\n    R[7] += g * a;\n    R[10] += b * b;\n    R[11] += b * a;\n    R[15] += a * a;\n  }\n  R[4] = R[1];\n  R[8] = R[2];\n  R[9] = R[6];\n  R[12] = R[3];\n  R[13] = R[7];\n  R[14] = R[11];\n\n  return { R, m, N };\n};\nUPNG.quantize.estats = function (stats) {\n  const R = stats.R;\n  const m = stats.m;\n  const N = stats.N;\n\n  // when all samples are equal, but N is large (millions), the Rj can be non-zero ( 0.0003.... - precission error)\n  const m0 = m[0];\n  const m1 = m[1];\n  const m2 = m[2];\n  const m3 = m[3];\n  const iN = N === 0 ? 0 : 1 / N;\n  const Rj = [\n    R[0] - m0 * m0 * iN,\n    R[1] - m0 * m1 * iN,\n    R[2] - m0 * m2 * iN,\n    R[3] - m0 * m3 * iN,\n    R[4] - m1 * m0 * iN,\n    R[5] - m1 * m1 * iN,\n    R[6] - m1 * m2 * iN,\n    R[7] - m1 * m3 * iN,\n    R[8] - m2 * m0 * iN,\n    R[9] - m2 * m1 * iN,\n    R[10] - m2 * m2 * iN,\n    R[11] - m2 * m3 * iN,\n    R[12] - m3 * m0 * iN,\n    R[13] - m3 * m1 * iN,\n    R[14] - m3 * m2 * iN,\n    R[15] - m3 * m3 * iN\n  ];\n\n  const A = Rj;\n  const M = UPNG.M4;\n  let b = [Math.random(), Math.random(), Math.random(), Math.random()];\n  let mi = 0;\n  let tmi = 0;\n\n  if (N !== 0)\n    for (let i = 0; i < 16; i++) {\n      b = M.multVec(A, b);\n      tmi = Math.sqrt(M.dot(b, b));\n      b = M.sml(1 / tmi, b);\n      if (i !== 0 && Math.abs(tmi - mi) < 1e-9) break;\n      mi = tmi;\n    }\n  const q = [m0 * iN, m1 * iN, m2 * iN, m3 * iN];\n  const eMq255 = M.dot(M.sml(255, q), b);\n\n  return {\n    Cov: Rj,\n    q,\n    e: b,\n    L: mi,\n    eMq255,\n    eMq: M.dot(b, q),\n    rgba:\n      ((Math.round(255 * q[3]) << 24) |\n        (Math.round(255 * q[2]) << 16) |\n        (Math.round(255 * q[1]) << 8) |\n        (Math.round(255 * q[0]) << 0)) >>>\n      0\n  };\n};\nUPNG.M4 = {\n  multVec: function (m, v) {\n    return [\n      m[0] * v[0] + m[1] * v[1] + m[2] * v[2] + m[3] * v[3],\n      m[4] * v[0] + m[5] * v[1] + m[6] * v[2] + m[7] * v[3],\n      m[8] * v[0] + m[9] * v[1] + m[10] * v[2] + m[11] * v[3],\n      m[12] * v[0] + m[13] * v[1] + m[14] * v[2] + m[15] * v[3]\n    ];\n  },\n  dot: function (x, y) {\n    return x[0] * y[0] + x[1] * y[1] + x[2] * y[2] + x[3] * y[3];\n  },\n  sml: function (a, y) {\n    return [a * y[0], a * y[1], a * y[2], a * y[3]];\n  }\n};\n\nUPNG.encode.concatRGBA = function (bufs) {\n  let tlen = 0;\n  for (let i = 0; i < bufs.length; i++) tlen += bufs[i].byteLength;\n  const nimg = new Uint8Array(tlen);\n  let noff = 0;\n  for (let i = 0; i < bufs.length; i++) {\n    const img = new Uint8Array(bufs[i]);\n    const il = img.length;\n    for (let j = 0; j < il; j += 4) {\n      let r = img[j];\n      let g = img[j + 1];\n      let b = img[j + 2];\n      const a = img[j + 3];\n      if (a === 0) r = g = b = 0;\n      nimg[noff + j] = r;\n      nimg[noff + j + 1] = g;\n      nimg[noff + j + 2] = b;\n      nimg[noff + j + 3] = a;\n    }\n    noff += il;\n  }\n  return nimg.buffer;\n};\n\nexport default UPNG;\n","import { getViewportSize } from \"./position\";\nimport UPNG from \"./UPNG\";\n\nexport interface ImgInfo {\n  name: string;\n  fileType: string;\n  size: number;\n  imgUrl: string;\n  width: number;\n  height: number;\n  imageData: ImageData;\n  blob: Blob;\n}\n\nexport const getRawImgInfo = (\n  imgUrl: string,\n  cb: (err: any, rawInfo: Pick<ImgInfo, \"width\" | \"height\"> | null) => void\n) => {\n  const image = new Image();\n  image.onload = function () {\n    cb(null, { width: image.width, height: image.height });\n  };\n  image.onerror = function (err) {\n    cb(err, null);\n  };\n  image.src = imgUrl;\n};\n\n// 获取解析图片数据\nexport const getImgInfo = (\n  files: FileList,\n  callback: (err: any, imgInfo: ImgInfo | null) => void\n) => {\n  if (!files) {\n    callback(\"no files\", null);\n  }\n  for (let i = 0, l = files.length; i < l; i++) {\n    const file = files[i];\n    const { type } = file;\n    const typeArr = type.split(\"/\");\n    if (typeArr[0] !== \"image\") return;\n    let fileType = typeArr[1].toUpperCase();\n    const reader = new FileReader();\n    reader.onload = function (e: any) {\n      const buffer = e.target.result;\n      const imageType = getImageType(buffer);\n      if (imageType) {\n        fileType = imageType;\n      }\n      const blob = new Blob([buffer]);\n      fileOrBlobToDataURL(blob, function (dataUrl: string | null) {\n        if (dataUrl) {\n          getRawImgInfo(dataUrl, (rawInfo) => {\n            if (rawInfo) {\n              const imageData = getCanvasImgData(\n                dataUrl,\n                rawInfo.width,\n                rawInfo.height\n              );\n              if (imageData) {\n                const imgInfo: ImgInfo = {\n                  name: file.name,\n                  fileType,\n                  size: file.size,\n                  width: rawInfo.width,\n                  height: rawInfo.height,\n                  imgUrl: dataUrl,\n                  imageData,\n                  blob\n                };\n                callback(null, imgInfo);\n              } else {\n                callback(\"no imageData\", null);\n              }\n            } else {\n              callback(\"no image raw info\", null);\n            }\n          });\n        } else {\n          callback(\"no image url\", null);\n        }\n      });\n    };\n    reader.readAsArrayBuffer(file);\n  }\n};\n\n// 根据buffer中的文件头信息判断图片类型\nexport const getImageType = (buffer: ArrayBuffer) => {\n  let fileType = \"\";\n  if (buffer) {\n    const view = new DataView(buffer);\n    const first4Byte = view.getUint32(0, false);\n    const hexValue = Number(first4Byte).toString(16).toUpperCase();\n    switch (hexValue) {\n      case \"FFD8FFDB\":\n        fileType = \"JPG\";\n        break;\n      case \"FFD8FFE0\":\n      case \"FFD8FFE1\":\n      case \"FFD8FFE2\":\n      case \"FFD8FFE3\":\n        fileType = \"JPEG\";\n        break;\n      case \"89504E47\":\n        fileType = \"PNG\";\n        break;\n      case \"47494638\":\n        fileType = \"GIF\";\n        break;\n      case \"52494646\":\n        fileType = \"WEBP\";\n        break;\n      default:\n        break;\n    }\n  }\n  return fileType;\n};\n\n// File或Blob对象转DataURL\nexport const fileOrBlobToDataURL = (\n  obj: File | Blob,\n  cb: (err: any, result: string | null) => void\n) => {\n  if (!obj) {\n    cb(\"no obj\", null);\n    return;\n  }\n  const reader = new FileReader();\n  reader.onload = function (e) {\n    if (e.target) {\n      cb(null, e.target.result as string);\n    } else {\n      cb(\"can't read\", null);\n    }\n  };\n  reader.readAsDataURL(obj);\n};\n\n// 获取图片二进制数据\nexport const getCanvasImgData = (\n  imgUrl: string,\n  width: number,\n  height: number\n) => {\n  if (imgUrl && width && height) {\n    const img = new Image();\n    img.src = imgUrl;\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(img, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\n// 根据video元素获取图片二进制数据\nexport const getCanvasImgDataByVideo = (\n  video: HTMLVideoElement,\n  width = 0,\n  height = 0\n) => {\n  if (video && width && height) {\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(video, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\n// 根据ImageBitmap获取图片二进制数据\nexport const getCanvasImgDataByBitmap = (\n  imageBitmap: ImageBitmap,\n  width = 0,\n  height = 0\n) => {\n  if (imageBitmap && width && height) {\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(imageBitmap, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\nexport const imageDataToBitmap = (imageData: ImageData) => {\n  //\n  // BITMAPFILEHEADER: http://msdn.microsoft.com/en-us/library/windows/desktop/dd183374(v=vs.85).aspx\n  // BITMAPINFOHEADER: http://msdn.microsoft.com/en-us/library/dd183376.aspx\n  //\n\n  const biWidth = imageData.width;\n  const biHeight = imageData.height;\n  const biSizeImage = biWidth * biHeight * 3;\n  const bfSize = biSizeImage + 54; // total header size = 54 bytes\n\n  //\n  //  typedef struct tagBITMAPFILEHEADER {\n  //  \tWORD bfType;\n  //  \tDWORD bfSize;\n  //  \tWORD bfReserved1;\n  //  \tWORD bfReserved2;\n  //  \tDWORD bfOffBits;\n  //  } BITMAPFILEHEADER;\n  //\n  const BITMAPFILEHEADER = [\n    // WORD bfType -- The file type signature; must be \"BM\"\n    0x42,\n    0x4d,\n    // DWORD bfSize -- The size, in bytes, of the bitmap file\n    bfSize & 0xff,\n    (bfSize >> 8) & 0xff,\n    (bfSize >> 16) & 0xff,\n    (bfSize >> 24) & 0xff,\n    // WORD bfReserved1 -- Reserved; must be zero\n    0,\n    0,\n    // WORD bfReserved2 -- Reserved; must be zero\n    0,\n    0,\n    // DWORD bfOffBits -- The offset, in bytes, from the beginning of the BITMAPFILEHEADER structure to the bitmap bits.\n    54,\n    0,\n    0,\n    0\n  ];\n\n  //\n  //  typedef struct tagBITMAPINFOHEADER {\n  //  \tDWORD biSize;\n  //  \tLONG  biWidth;\n  //  \tLONG  biHeight;\n  //  \tWORD  biPlanes;\n  //  \tWORD  biBitCount;\n  //  \tDWORD biCompression;\n  //  \tDWORD biSizeImage;\n  //  \tLONG  biXPelsPerMeter;\n  //  \tLONG  biYPelsPerMeter;\n  //  \tDWORD biClrUsed;\n  //  \tDWORD biClrImportant;\n  //  } BITMAPINFOHEADER, *PBITMAPINFOHEADER;\n  //\n  const BITMAPINFOHEADER = [\n    // DWORD biSize -- The number of bytes required by the structure\n    40,\n    0,\n    0,\n    0,\n    // LONG biWidth -- The width of the bitmap, in pixels\n    biWidth & 0xff,\n    (biWidth >> 8) & 0xff,\n    (biWidth >> 16) & 0xff,\n    (biWidth >> 24) & 0xff,\n    // LONG biHeight -- The height of the bitmap, in pixels\n    biHeight & 0xff,\n    (biHeight >> 8) & 0xff,\n    (biHeight >> 16) & 0xff,\n    (biHeight >> 24) & 0xff,\n    // WORD biPlanes -- The number of planes for the target device. This value must be set to 1\n    1,\n    0,\n    // WORD biBitCount -- The number of bits-per-pixel, 24 bits-per-pixel -- the bitmap\n    // has a maximum of 2^24 colors (16777216, Truecolor)\n    24,\n    0,\n    // DWORD biCompression -- The type of compression, BI_RGB (code 0) -- uncompressed\n    0,\n    0,\n    0,\n    0,\n    // DWORD biSizeImage -- The size, in bytes, of the image. This may be set to zero for BI_RGB bitmaps\n    biSizeImage & 0xff,\n    (biSizeImage >> 8) & 0xff,\n    (biSizeImage >> 16) & 0xff,\n    (biSizeImage >> 24) & 0xff,\n    // LONG biXPelsPerMeter, unused\n    0,\n    0,\n    0,\n    0,\n    // LONG biYPelsPerMeter, unused\n    0,\n    0,\n    0,\n    0,\n    // DWORD biClrUsed, the number of color indexes of palette, unused\n    0,\n    0,\n    0,\n    0,\n    // DWORD biClrImportant, unused\n    0,\n    0,\n    0,\n    0\n  ];\n\n  const iPadding = (4 - ((biWidth * 3) % 4)) % 4;\n  const aImgData = imageData.data;\n\n  let strPixelData = \"\";\n  const biWidth4 = biWidth << 2;\n  let y = biHeight;\n  const fromCharCode = String.fromCharCode;\n\n  do {\n    const iOffsetY = biWidth4 * (y - 1);\n    let strPixelRow = \"\";\n    for (let x = 0; x < biWidth; x++) {\n      const iOffsetX = x << 2;\n      strPixelRow +=\n        fromCharCode(aImgData[iOffsetY + iOffsetX + 2]) +\n        fromCharCode(aImgData[iOffsetY + iOffsetX + 1]) +\n        fromCharCode(aImgData[iOffsetY + iOffsetX]);\n    }\n\n    for (let c = 0; c < iPadding; c++) {\n      strPixelRow += String.fromCharCode(0);\n    }\n\n    strPixelData += strPixelRow;\n  } while (--y);\n\n  function encodeData(data: string | any[]) {\n    if (!window.btoa) {\n      throw \"btoa undefined\";\n    }\n    let str = \"\";\n    if (typeof data == \"string\") {\n      str = data;\n    } else {\n      for (let i = 0; i < data.length; i++) {\n        str += String.fromCharCode(data[i]);\n      }\n    }\n    return btoa(str);\n  }\n\n  return (\n    encodeData(BITMAPFILEHEADER.concat(BITMAPINFOHEADER)) +\n    encodeData(strPixelData)\n  );\n};\n\n// ImageData对象转DataURL\nexport const imageDataToDataURL = (imageData: ImageData) => {\n  if (!imageData) {\n    return null;\n  }\n  const { width, height } = imageData;\n  const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  canvas.width = width;\n  canvas.height = height;\n  ctx.putImageData(imageData, 0, 0, 0, 0, width, height);\n  const dataUrl = canvas.toDataURL(\"image/png\");\n  return dataUrl;\n};\n\n// ImageData对象转Blob\nexport const imageDataToBlob = (\n  imageData: ImageData,\n  exportImageType = \"PNG\",\n  cb: (err: any, blob: Blob | null) => void\n) => {\n  if (!imageData) {\n    cb(\"no imageData\", null);\n    return;\n  }\n  const { width, height } = imageData;\n  const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  canvas.width = width;\n  canvas.height = height;\n  ctx.putImageData(imageData, 0, 0, 0, 0, width, height);\n  const toImageType = `image/${\n    exportImageType ? exportImageType.toLowerCase() : \"png\"\n  }`;\n  canvas.toBlob(\n    (blob: Blob | null) => {\n      cb(null, blob);\n    },\n    toImageType,\n    1\n  );\n};\n\n// Blob对象转Image\nexport const blobToImage = (blob: Blob, cb: (err: any) => void) => {\n  fileOrBlobToDataURL(blob, function (err, dataUrl: string | null) {\n    if (dataUrl) {\n      const image = new Image();\n      image.src = dataUrl;\n    } else {\n      cb(err);\n    }\n  });\n};\n\n// 导出图片\nexport const blobToExport = (blob: Blob, imgName: string) => {\n  if (!blob) return;\n  const a = document.createElement(\"a\");\n  a.style.visibility = \"hidden\";\n  document.body.appendChild(a);\n  a.download = imgName;\n  const objUrl = window.URL.createObjectURL(blob);\n  a.href = objUrl;\n  a.click();\n  document.body.removeChild(a);\n  window.URL.revokeObjectURL(objUrl);\n};\n\n// 异步加载图片\nexport function loadImage(\n  url: string,\n  cb: (err: any, image: HTMLImageElement | null) => void\n) {\n  const image = new Image();\n  image.onload = function () {\n    cb(null, image);\n  };\n  image.onerror = function () {\n    cb(new Error(\"Could not load image at \" + url), null);\n  };\n  image.src = url;\n}\n\n/**\n * 懒加载图片\n * document.addEventListener(\"scroll\", throttle(lazyloadImages(), 300));\n */\nexport function lazyloadImages() {\n  const imgs = document.getElementsByTagName(\"img\");\n  const viewHeight = getViewportSize().height;\n  let start = 0;\n  return () => {\n    for (let i = start; i < imgs.length; i++) {\n      // 元素露出\n      if (imgs[i].getBoundingClientRect().top < viewHeight) {\n        imgs[i].src = imgs[i].getAttribute(\"data-src\") ?? \"\";\n        start = i + 1;\n      }\n    }\n  };\n}\n\n// 获取传入图片链接的这个图片的主要颜色值 返回表示颜色值的字符串,如rgb(red,green,blue)\nexport function getImageMainColor(\n  imgUrl: string,\n  cb: (err: any, rgb: string | null) => void\n) {\n  getRawImgInfo(imgUrl, (rawInfo) => {\n    if (!rawInfo) return cb(\"no image info\", null);\n    const canvasImageData = getCanvasImgData(\n      imgUrl,\n      rawInfo.width,\n      rawInfo.height\n    );\n    if (!canvasImageData) return cb(\"no canvas image info\", null);\n    const imageData = canvasImageData.data;\n    let j = 0;\n    const arrR = [];\n    const arrG = [];\n    const arrB = [];\n    for (let i = 0; i < imageData.length; i += 4) {\n      arrR[j] = imageData[i];\n      arrG[j] = imageData[i + 1];\n      arrB[j] = imageData[i + 2];\n      j += 1;\n    }\n    const R = _getArryWeightValue(arrR);\n    const G = _getArryWeightValue(arrG);\n    const B = _getArryWeightValue(arrB);\n    return cb(null, \"rgb(\" + R + \",\" + G + \",\" + B + \")\");\n  });\n}\n// 用于获取数组中的最高权重值 返回数组的最高权重值\nfunction _getArryWeightValue(arr: number[]) {\n  const existArr = {} as { [index: number]: number };\n  const duplicationArr = [];\n  const duplicationCount = [];\n  for (let i = 0; i < arr.length; i++) {\n    if (!existArr[arr[i]]) {\n      existArr[arr[i]] = 1;\n    } else {\n      duplicationArr.push(arr[i]);\n    }\n  }\n  let k = 0;\n  for (let i = 0; i < duplicationArr.length; i++) {\n    k = 0;\n    for (let j = 0; j < duplicationArr.length; j++) {\n      if (duplicationArr[i] === duplicationArr[j]) {\n        k += 1;\n      }\n      duplicationCount[i] = k;\n    }\n  }\n  const max = Math.max.apply(null, duplicationCount);\n  let maxIndex = 0;\n  for (; maxIndex < duplicationCount.length; maxIndex++) {\n    if (duplicationCount[maxIndex] === max) {\n      return;\n    }\n  }\n  return duplicationArr[maxIndex];\n}\n\n// 左右翻转\nexport const flipSideToSide = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[(y * width + width - x - 1) * 4];\n        newImgData[startIndex + 1] = data[(y * width + width - x - 1) * 4 + 1];\n        newImgData[startIndex + 2] = data[(y * width + width - x - 1) * 4 + 2];\n        newImgData[startIndex + 3] = data[(y * width + width - x - 1) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 上下翻转\nexport const flipUpsideDown = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[((height - y - 1) * width + x) * 4];\n        newImgData[startIndex + 1] =\n          data[((height - y - 1) * width + x) * 4 + 1];\n        newImgData[startIndex + 2] =\n          data[((height - y - 1) * width + x) * 4 + 2];\n        newImgData[startIndex + 3] =\n          data[((height - y - 1) * width + x) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 左旋转\nexport const leftRotate = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let x = 0; x < width; x++) {\n      for (let y = 0; y < height; y++) {\n        const startIndex = (x * height + y) * 4;\n        newImgData[startIndex] = data[(y * width + width - x - 1) * 4];\n        newImgData[startIndex + 1] = data[(y * width + width - x - 1) * 4 + 1];\n        newImgData[startIndex + 2] = data[(y * width + width - x - 1) * 4 + 2];\n        newImgData[startIndex + 3] = data[(y * width + width - x - 1) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, height, width);\n    return newImageData;\n  }\n  return null;\n};\n\n// 右旋转\nexport const rightRotate = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let x = 0; x < width; x++) {\n      for (let y = 0; y < height; y++) {\n        const startIndex = (x * height + y) * 4;\n        newImgData[startIndex] = data[((height - y - 1) * width + x) * 4];\n        newImgData[startIndex + 1] =\n          data[((height - y - 1) * width + x) * 4 + 1];\n        newImgData[startIndex + 2] =\n          data[((height - y - 1) * width + x) * 4 + 2];\n        newImgData[startIndex + 3] =\n          data[((height - y - 1) * width + x) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, height, width);\n    return newImageData;\n  }\n  return null;\n};\n\n// 灰化\nexport const toGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const avgColor =\n          (data[startIndex] + data[startIndex + 1] + data[startIndex + 2]) / 3;\n        newImgData[startIndex] = avgColor;\n        newImgData[startIndex + 1] = avgColor;\n        newImgData[startIndex + 2] = avgColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 黑白化\nexport const toBlackAndWhite = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const avgColor =\n          (data[startIndex] + data[startIndex + 1] + data[startIndex + 2]) / 3;\n        const newColor = avgColor > 127 ? 255 : 0;\n        newImgData[startIndex] = newColor;\n        newImgData[startIndex + 1] = newColor;\n        newImgData[startIndex + 2] = newColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 反相色滤镜\nexport const toOpposite = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 255 - data[startIndex];\n        newImgData[startIndex + 1] = 255 - data[startIndex + 1];\n        newImgData[startIndex + 2] = 255 - data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红色滤镜\nexport const toRed = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 绿色滤镜\nexport const toGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝色滤镜\nexport const toBlue = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红绿色滤镜\nexport const toRedAndGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红蓝色滤镜\nexport const toRedAndBlue = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = data[startIndex + 1];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝绿色滤镜\nexport const toBlueAndGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = data[startIndex + 1];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红灰色滤镜\nexport const toRedAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex + 1] + data[startIndex + 2]) / 2;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = greyColor;\n        newImgData[startIndex + 2] = greyColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 绿灰色滤镜\nexport const toGreenAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex] + data[startIndex + 2]) / 2;\n        newImgData[startIndex] = greyColor;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = greyColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝灰色滤镜\nexport const toBlueAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex] + data[startIndex + 1]) / 2;\n        newImgData[startIndex] = greyColor;\n        newImgData[startIndex + 1] = greyColor;\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 锐化\nexport const sharpen = (imageData: ImageData) => {\n  if (imageData) {\n    const kernel = [-1, -1, -1, -1, 9, -1, -1, -1, -1]; // 锐化卷积核\n    const newImageData = convolutionMatrix(imageData, kernel);\n    return newImageData;\n  }\n  return null;\n};\n\n// 边缘锐化\nexport const marginSharpen = (imageData: ImageData) => {\n  if (imageData) {\n    const kernel = [-1, -1, -1, -1, 8, -1, -1, -1, -1]; // 边缘化卷积核\n    const newImageData = convolutionMatrix(imageData, kernel);\n    return newImageData;\n  }\n  return null;\n};\n\n// JPG转PNG\nexport const jpgToPng = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = 255;\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// PNG转JPG\nexport const pngToJpg = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (data[startIndex + 3] === 0) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n          newImgData[startIndex + 3] = 255;\n        } else {\n          const newColor = colorStacks(\n            [\n              data[startIndex],\n              data[startIndex + 1],\n              data[startIndex + 2],\n              data[startIndex + 3]\n            ],\n            [255, 255, 255, 255]\n          );\n          newImgData[startIndex] = newColor[0];\n          newImgData[startIndex + 1] = newColor[1];\n          newImgData[startIndex + 2] = newColor[2];\n          newImgData[startIndex + 3] = newColor[3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n/**\n * 矩形裁剪\n * @param imageData ImageData源数据\n * @param newWidth 新图的宽度（retainOriginalSize为true时，宽度为imageData.width）\n * @param newHeight 新图的高度（retainOriginalSize为true时，高度为imageData.height）\n * @param top 新图相对于原图顶部的起始位置\n * @param left 新图相对于原图左侧的起始位置\n * @param retainOriginalSize 是否保留为原图的宽高 (宽高继承原图，多余部分用白色或透明色填充)\n * @param imageType 图片类型 (retainOriginalSize为true时必须传该值)\n * @returns ImageData | null\n */\nexport const rectClip = (\n  imageData: ImageData,\n  newWidth: number,\n  newHeight: number,\n  top: number,\n  left: number,\n  retainOriginalSize = false,\n  imageType?: string\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalLeft = left;\n    let finalTop = top;\n    let finalWidth = newWidth;\n    let finalHeight = newHeight;\n    if (finalLeft < 0) {\n      finalLeft = 0;\n    } else if (finalLeft > width) {\n      finalLeft = width;\n    }\n    if (finalTop < 0) {\n      finalTop = 0;\n    } else if (finalTop > height) {\n      finalTop = height;\n    }\n    if (finalWidth < 1) {\n      finalWidth = 1;\n    } else if (finalWidth > width) {\n      finalWidth = width;\n    }\n    if (finalHeight < 1) {\n      finalHeight = 1;\n    } else if (finalHeight > height) {\n      finalHeight = height;\n    }\n    if (finalLeft + finalWidth > width) {\n      finalWidth = width - finalLeft;\n    }\n    if (finalTop + finalHeight > height) {\n      finalHeight = height - finalTop;\n    }\n    // 保留原尺寸\n    if (retainOriginalSize) {\n      const newImgData = new Uint8ClampedArray(data.length);\n      for (let y = 0; y < height; y++) {\n        for (let x = 0; x < width; x++) {\n          const startIndex = (y * width + x) * 4;\n          if (\n            x >= finalLeft &&\n            x <= finalLeft + finalWidth &&\n            y >= finalTop &&\n            y <= finalTop + finalHeight\n          ) {\n            newImgData[startIndex] = data[startIndex];\n            newImgData[startIndex + 1] = data[startIndex + 1];\n            newImgData[startIndex + 2] = data[startIndex + 2];\n            newImgData[startIndex + 3] = data[startIndex + 3];\n          } else {\n            newImgData[startIndex] = 255;\n            newImgData[startIndex + 1] = 255;\n            newImgData[startIndex + 2] = 255;\n            newImgData[startIndex + 3] =\n              imageType && [\"JPG\", \"JPEG\"].includes(imageType.toUpperCase())\n                ? 255\n                : 0;\n          }\n        }\n      }\n      const newImageData = new ImageData(newImgData, width, height);\n      return newImageData;\n    } else {\n      const newImgData = new Uint8ClampedArray(finalWidth * finalHeight * 4);\n      for (let y = finalTop; y <= finalTop + finalHeight; y++) {\n        for (let x = finalLeft; x <= finalLeft + finalWidth; x++) {\n          const startIndex = ((y - finalTop) * finalWidth + x - finalLeft) * 4;\n          const startIndex2 = (y * width + x) * 4;\n          newImgData[startIndex] = data[startIndex2];\n          newImgData[startIndex + 1] = data[startIndex2 + 1];\n          newImgData[startIndex + 2] = data[startIndex2 + 2];\n          newImgData[startIndex + 3] = data[startIndex2 + 3];\n        }\n      }\n      const newImageData = new ImageData(newImgData, finalWidth, finalHeight);\n      return newImageData;\n    }\n  }\n  return null;\n};\n\n/**\n * 圆角裁剪\n * @param imageData ImageData源数据\n * @param borderRadius 圆角半径\n * @param imageType 图片类型\n * @param jpgToPNG 是否为JPG转成PNG\n * @returns ImageData | null\n */\nexport const radiusClip = (\n  imageData: ImageData,\n  borderRadius: number,\n  imageType: string,\n  jpgToPNG?: boolean\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalRadius = borderRadius;\n    if (finalRadius > Math.floor(width / 2)) {\n      finalRadius = Math.floor(width / 2);\n    }\n    if (finalRadius > Math.floor(height / 2)) {\n      finalRadius = Math.floor(height / 2);\n    }\n    if (finalRadius < 0) {\n      finalRadius = 0;\n    }\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        let l = -1;\n        if (x < finalRadius) {\n          if (y < finalRadius) {\n            l = Math.sqrt(\n              Math.pow(finalRadius - x - 1, 2) +\n                Math.pow(finalRadius - y - 1, 2)\n            );\n          } else if (y > height - finalRadius - 1) {\n            l = Math.sqrt(\n              Math.pow(finalRadius - x - 1, 2) +\n                Math.pow(y - (height - finalRadius), 2)\n            );\n          }\n        } else if (x > width - finalRadius - 1) {\n          if (y < finalRadius) {\n            l = Math.sqrt(\n              Math.pow(x - (width - finalRadius), 2) +\n                Math.pow(finalRadius - y - 1, 2)\n            );\n          } else if (y > height - finalRadius - 1) {\n            l = Math.sqrt(\n              Math.pow(x - (width - finalRadius), 2) +\n                Math.pow(y - (height - finalRadius), 2)\n            );\n          }\n        }\n        if (Math.round(l) > finalRadius) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n          newImgData[startIndex + 3] =\n            jpgToPNG || imageType.toUpperCase() === \"PNG\" ? 0 : 255;\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] =\n            jpgToPNG || imageType.toUpperCase() === \"PNG\"\n              ? data[startIndex + 3]\n              : 255;\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改尺寸\nexport const changeSize = (\n  imgUrl: string,\n  width: number,\n  height: number,\n  newWidth: number,\n  newHeight: number,\n  maxWidthHeight = 10000\n) => {\n  if (imgUrl) {\n    const img = new Image();\n    img.src = imgUrl;\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = maxWidthHeight;\n    canvas.height = maxWidthHeight;\n    ctx.drawImage(img, 0, 0, width, height, 0, 0, newWidth, newHeight);\n    const newImageData = ctx.getImageData(\n      0,\n      0,\n      newWidth,\n      newHeight\n    ) as ImageData;\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改亮度\nexport const changeBrightness = (imageData: ImageData, changeNum: number) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = Math.max(\n          Math.min(data[startIndex] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 1] = Math.max(\n          Math.min(data[startIndex + 1] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 2] = Math.max(\n          Math.min(data[startIndex + 2] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改透明度\nexport const changeDiaphaneity = (\n  imageData: ImageData,\n  value: number,\n  fixedDiaphaneity = false\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (data[startIndex + 3] === 0) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n        }\n        let a = data[startIndex + 3];\n        if (fixedDiaphaneity) {\n          a = Math.max(Math.min(Math.floor(255 * value), 255), 0);\n        } else {\n          a = Math.max(Math.min(Math.floor(a + 255 * value), 255), 0);\n        }\n        newImgData[startIndex + 3] = a;\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 添加水印\nexport const addWatermark = (\n  imageData: ImageData,\n  watermarkImageData: ImageData,\n  top: number,\n  left: number\n) => {\n  if (imageData && watermarkImageData) {\n    const { data, width, height } = imageData;\n    const {\n      data: watermarkData,\n      width: watermarkWidth,\n      height: watermarkHeight\n    } = watermarkImageData;\n    let finalTop = top;\n    let finalLeft = left;\n    if (top + watermarkHeight > height) {\n      finalTop = height - watermarkHeight;\n    }\n    if (left + watermarkWidth > width) {\n      finalLeft = width - watermarkWidth;\n    }\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (\n          x < finalLeft ||\n          x > finalLeft + watermarkWidth ||\n          y <= finalTop ||\n          y >= finalTop + watermarkHeight\n        ) {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] = data[startIndex + 3];\n        } else {\n          const watermarkStartIndex =\n            (y * width +\n              x -\n              ((finalTop + 1) * width +\n                (y - (finalTop + 1)) * (width - watermarkWidth)) +\n              watermarkWidth -\n              finalLeft -\n              1) *\n            4;\n          const aboveColor: [number, number, number, number] = [\n            watermarkData[watermarkStartIndex],\n            watermarkData[watermarkStartIndex + 1],\n            watermarkData[watermarkStartIndex + 2],\n            watermarkData[watermarkStartIndex + 3]\n          ];\n          const belowColor: [number, number, number, number] = [\n            data[startIndex],\n            data[startIndex + 1],\n            data[startIndex + 2],\n            data[startIndex + 3]\n          ];\n          const finalColor = colorStacks(aboveColor, belowColor);\n          newImgData[startIndex] = finalColor[0];\n          newImgData[startIndex + 1] = finalColor[1];\n          newImgData[startIndex + 2] = finalColor[2];\n          newImgData[startIndex + 3] = finalColor[3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n/**\n * 打马赛克\n * @param imageData ImageData源数据\n * @param width 马赛克区域的宽度\n * @param height 马赛克区域的高度\n * @param top 马赛克相对于顶部的起始位置\n * @param left 马塞克相对于左侧的起始位置\n * @param mosaicSize 马塞克颗粒的大小\n * @returns ImageData | null\n */\nexport const mosaic = (\n  imageData: ImageData,\n  mosaicWidth: number,\n  mosaicHeight: number,\n  top: number,\n  left: number,\n  mosaicSize = 10\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalLeft = left;\n    let finalTop = top;\n    let finalWidth = mosaicWidth;\n    let finalHeight = mosaicHeight;\n    if (finalLeft < 0) {\n      finalLeft = 0;\n    } else if (finalLeft > width) {\n      finalLeft = width;\n    }\n    if (finalTop < 0) {\n      finalTop = 0;\n    } else if (finalTop > height) {\n      finalTop = height;\n    }\n    if (finalWidth < 1) {\n      finalWidth = 1;\n    } else if (finalWidth > width) {\n      finalWidth = width;\n    }\n    if (finalHeight < 1) {\n      finalHeight = 1;\n    } else if (finalHeight > height) {\n      finalHeight = height;\n    }\n    if (finalLeft + finalWidth > width) {\n      finalWidth = width - finalLeft;\n    }\n    if (finalTop + finalHeight > height) {\n      finalHeight = height - finalTop;\n    }\n\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (\n          x >= finalLeft &&\n          x <= finalLeft + finalWidth &&\n          y >= finalTop &&\n          y <= finalTop + finalHeight\n        ) {\n          const boxXIndex = Math.floor((x - finalLeft) / mosaicSize);\n          const boxYIndex = Math.floor((y - finalTop) / mosaicSize);\n          let mosaicBoxColorX = Math.floor(\n            mosaicSize * (boxXIndex + 1) - mosaicSize / 2 + finalLeft\n          );\n          let mosaicBoxColorY = Math.floor(\n            mosaicSize * (boxYIndex + 1) - mosaicSize / 2 + finalTop\n          );\n          if (mosaicBoxColorX > width - 1) {\n            mosaicBoxColorX = width - 1;\n          }\n          if (mosaicBoxColorY > height - 1) {\n            mosaicBoxColorY = height - 1;\n          }\n          const mosaicBoxColorIndex =\n            (mosaicBoxColorY * width + mosaicBoxColorX) * 4;\n          newImgData[startIndex] = data[mosaicBoxColorIndex];\n          newImgData[startIndex + 1] = data[mosaicBoxColorIndex + 1];\n          newImgData[startIndex + 2] = data[mosaicBoxColorIndex + 2];\n          newImgData[startIndex + 3] = data[mosaicBoxColorIndex + 3];\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] = data[startIndex + 3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 图片压缩\nexport const compression = async (\n  imageUrl: string | ImageData,\n  width: number,\n  height: number,\n  imageType: string,\n  compressionDegree: number,\n  cb: (blob: Blob | null) => void\n) => {\n  if (imageUrl && imageType) {\n    const degree = compressionDegree / 100;\n    if ([\"JPG\", \"JPEG\"].includes(imageType.toUpperCase())) {\n      const img = new Image();\n      img.src = imageUrl as string;\n      const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n      const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n      canvas.width = width;\n      canvas.height = height;\n      ctx.drawImage(img, 0, 0, width, height);\n      canvas.toBlob(\n        (blob: Blob | null) => {\n          cb && cb(blob);\n        },\n        `image/${imageType.toLowerCase()}`,\n        degree\n      );\n    } else {\n      const bit = Math.floor(degree * 256);\n      const png = UPNG.encode(\n        [(imageUrl as ImageData).data.buffer],\n        width,\n        height,\n        bit\n      );\n      const blob = new Blob([png]);\n      cb && cb(blob);\n    }\n  } else {\n    cb && cb(null);\n  }\n};\n\n// 根据AI识别的人像数据算出界面中需要显示的最终数据\nexport const getImageDataByAIData = (\n  originalImageData: ImageData,\n  AIImageData: ImageData,\n  options: {\n    backgroundColor: { r: number; g: number; b: number; a: number };\n    changeIntoColor: { r: number; g: number; b: number; a: number };\n  } = {\n    backgroundColor: { r: 0, g: 0, b: 0, a: 255 },\n    changeIntoColor: { r: 0, g: 0, b: 0, a: 0 }\n  }\n) => {\n  if (originalImageData) {\n    if (AIImageData && options) {\n      const { data, width, height } = originalImageData;\n      const { data: AIData } = AIImageData;\n      const newImgData = new Uint8ClampedArray(data.length);\n      const { backgroundColor, changeIntoColor } = options;\n      for (let y = 0; y < height; y++) {\n        for (let x = 0; x < width; x++) {\n          const startIndex = (y * width + x) * 4;\n          const r = AIData[startIndex];\n          const g = AIData[startIndex + 1];\n          const b = AIData[startIndex + 2];\n          const a = AIData[startIndex + 3];\n          if (\n            r === backgroundColor.r &&\n            g === backgroundColor.g &&\n            b === backgroundColor.b &&\n            a === backgroundColor.a &&\n            changeIntoColor.a !== 0\n          ) {\n            newImgData[startIndex] = changeIntoColor.r;\n            newImgData[startIndex + 1] = changeIntoColor.g;\n            newImgData[startIndex + 2] = changeIntoColor.b;\n            newImgData[startIndex + 3] = changeIntoColor.a;\n          } else {\n            newImgData[startIndex] = data[startIndex];\n            newImgData[startIndex + 1] = data[startIndex + 1];\n            newImgData[startIndex + 2] = data[startIndex + 2];\n            newImgData[startIndex + 3] = data[startIndex + 3];\n          }\n        }\n      }\n      const newImageData = new ImageData(newImgData, width, height);\n      return newImageData;\n    }\n    return originalImageData;\n  }\n  return null;\n};\n\n// 卷积算法\nconst convolutionMatrix = (imageData: ImageData, kernel: number[]) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        for (let i = 0; i < 3; i++) {\n          const index = startIndex + i;\n          if (x === 0 || x === width - 1 || y === 0 || y === height - 1) {\n            newImgData[index] = data[index];\n          } else {\n            newImgData[index] =\n              kernel[0] * data[index - width * 4 - 4] +\n              kernel[1] * data[index - width * 4] +\n              kernel[2] * data[index - width * 4 + 4] +\n              kernel[3] * data[index - 4] +\n              kernel[4] * data[index] +\n              kernel[5] * data[index + 4] +\n              kernel[6] * data[index + width * 4 - 4] +\n              kernel[7] * data[index + width * 4] +\n              kernel[8] * data[index + width * 4 + 4];\n          }\n        }\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 颜色叠加算法\nconst colorStacks = (\n  aboveColor: [number, number, number, number],\n  belowColor: [number, number, number, number]\n) => {\n  if (\n    aboveColor &&\n    aboveColor.length === 4 &&\n    belowColor &&\n    belowColor.length === 4\n  ) {\n    const aboveA = aboveColor[3];\n    const belowA = belowColor[3];\n    if (aboveA === 255 || belowA === 0) {\n      return aboveColor;\n    } else if (aboveA === 0) {\n      return belowColor;\n    } else {\n      const aboveDiaphaneity = aboveA / 255;\n      const belowDiaphaneity = belowA / 255;\n      const newColorR = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[0] * aboveDiaphaneity +\n              belowColor[0] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorG = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[1] * aboveDiaphaneity +\n              belowColor[1] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorB = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[2] * aboveDiaphaneity +\n              belowColor[2] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorA = Math.max(\n        Math.min(\n          Math.floor(\n            (aboveDiaphaneity + belowDiaphaneity * (1 - aboveDiaphaneity)) * 255\n          ),\n          255\n        ),\n        0\n      );\n      return [newColorR, newColorG, newColorB, newColorA];\n    }\n  }\n  return [255, 255, 255, 255];\n};\n","export function createXMLHttpRequest() {\n  var xhr = null;\n\n  if (window.ActiveXObject) {\n    var versions = [\n      \"Microsoft.XMLHTTP\",\n      \"MSXML6.XMLHTTP\",\n      \"MSXML5.XMLHTTP\",\n      \"MSXML4.XMLHTTP\",\n      \"MSXML3.XMLHTTP\",\n      \"MSXML2.XMLHTTP\",\n      \"MSXML.XMLHTTP\"\n    ];\n\n    for (var i = 0; i < versions.length; i++) {\n      try {\n        xhr = new window.ActiveXObject(versions[i]);\n        break;\n      } catch (ex) {\n        continue;\n      }\n    }\n  } else {\n    xhr = new XMLHttpRequest();\n  }\n  return xhr;\n}\n\nexport function getFormElementData(oFormElement) {\n  if (!oFormElement.action) {\n    return;\n  }\n  if (oFormElement.method.toLowerCase() === \"post\") {\n    /* enctype is multipart/form-data */\n    // segments.push(\n    //   'Content-Disposition: form-data; name=\"' +\n    //     fd.name +\n    //     '\"; filename=\"' +\n    //     fd.name +\n    //     '\"\\r\\nContent-Type: ' +\n    //     fd.type +\n    //     \"\\r\\n\\r\\n\"\n    // );\n    // segments.push(\n    //   'Content-Disposition: form-data; name=\"' +\n    //     input.name +\n    //     '\"\\r\\n\\r\\n' +\n    //     input.value +\n    //     \"\\r\\n\"\n    // );\n    // var sBoundary = \"---------------------------\" + Date.now().toString(16);\n    // xhr.setRequestHeader(\n    //   \"Content-Type\",\n    //   \"multipart/form-data; boundary=\" + sBoundary\n    // );\n    // xhr.sendAsBinary(\n    //   \"--\" +\n    //     sBoundary +\n    //     \"\\r\\n\" +\n    //     segments.join(\"--\" + sBoundary + \"\\r\\n\") +\n    //     \"--\" +\n    //     sBoundary +\n    //     \"--\\r\\n\"\n    // );\n    /* enctype is application/x-www-form-urlencoded or text/plain */\n    // segments.push(escape(input.name) + \"=\" + escape(input.value));\n    return {\n      url: oFormElement.action,\n      data: new FormData(oFormElement)\n    };\n  } else {\n    var sSearch = \"\";\n    for (var nItem = 0; nItem < oFormElement.elements.length; nItem++) {\n      var oField = oFormElement.elements[nItem];\n      if (!oField.hasAttribute(\"name\")) {\n        continue;\n      }\n      var sFieldType =\n        oField.nodeName.toUpperCase() === \"INPUT\"\n          ? oField.getAttribute(\"type\").toUpperCase()\n          : \"TEXT\";\n      if (sFieldType === \"FILE\") {\n        for (\n          var nFile = 0;\n          nFile < oField.files.length;\n          sSearch +=\n            \"&\" + escape(oField.name) + \"=\" + escape(oField.files[nFile++].name)\n        );\n      } else if (\n        (sFieldType !== \"RADIO\" && sFieldType !== \"CHECKBOX\") ||\n        oField.checked\n      ) {\n        sSearch += \"&\" + escape(oField.name) + \"=\" + escape(oField.value);\n      }\n    }\n    return {\n      url: oFormElement.action.replace(\n        /(?:\\?.*)?$/,\n        sSearch.replace(/^&/, \"?\")\n      ),\n      data: null\n    };\n  }\n}\n\nexport function fetchUseXMLHttpRequest(url, timeout) {\n  return new Promise((resolve, reject) => {\n    var xhr = new XMLHttpRequest();\n    var timeoutHandler = function () {\n      reject(\"The request for \" + url + \" is timed out for \" + timeout + \".\");\n    };\n    var handler = function (e) {\n      // - 0 代理被创建，但尚未调用 open()方法\n      // - 1 open() 方法已经被调用\n      // - 2 send()方法已经被调用，并且头部和状态已经可获得\n      // - 3 下载中， responseText`属性已经包含部分数据\n      // - 4 下载操作已完成\n      if (xhr.readyState === 4) {\n        if (xhr.status === 200) {\n          resolve(xhr.response); // xhr.responseText\n          // var arrayBuffer = xhr.response;\n          // if (arrayBuffer) {\n          //   var byteArray = new Uint8Array(arrayBuffer);\n          //   for (var i = 0; i < byteArray.byteLength; i++) {\n          //     // do something with each byte in the array\n          //   }\n          // }\n        } else {\n          reject(xhr.statusText);\n        }\n      }\n    };\n\n    xhr.open(\"GET\", url);\n    // xhr.open(\"GET\", url, true);\n    // xhr.open(\"POST\", url);\n\n    xhr.onload = handler;\n    // xhr.onreadystatechange = handler;\n    xhr.timeout = timeout;\n    xhr.ontimeout = timeoutHandler;\n\n    xhr.upload.addEventListener(\n      \"progress\",\n      function (e) {\n        if (e.lengthComputable) {\n          const percentage = Math.round((e.loaded * 100) / e.total);\n          console.log(percentage + \"%\");\n        }\n      },\n      false\n    );\n    xhr.upload.addEventListener(\"load\", function (e) {}, false);\n    // xhr.overrideMimeType(\"text/plain; charset=x-user-defined-binary\");\n\n    // empty string (default), \"arraybuffer\", \"blob\", \"document\", \"json\", and \"text\"\n    // xhr.responseType = \"json\";\n    // xhr.setRequestHeader(\"Accept\", \"application/json\");\n\n    // The send method of the XMLHttpRequest has been extended to enable easy transmission of binary data by accepting an ArrayBuffer or Blob or File object.\n    xhr.send(null);\n\n    // // multipart/form-data upload\n    // const fd = new FormData();\n    // fd.append(\"avatar\", file);\n    // fd.append(\"photos\", photos.files[0]);\n    // fd.append(\"photos\", photos.files[1]);\n    // fd.append(\"username\", \"abc123\");\n    // xhr.send(fd);\n  });\n}\n\nexport function fetchUseFetch(url, options, data) {\n  return fetch(\n    url,\n    Object.assign(\n      {\n        method: \"POST\", // GET, POST, PUT, DELETE\n        headers: {\n          // \"Content-Type\": \"application/json\"\n          // \"Content-Type\": \"application/x-www-form-urlencoded\"\n        }, // 请求的头信息，形式为 Headers 对象或 ByteString\n        body: {}, // JSON.stringify(data) 请求发送的数据 blob、BufferSource、FormData、URLSearchParams（get 或head 方法中不能包含 body）\n        mode: \"\", //请求的模式，是否跨域等，如 cors、 no-cors 或 same-origin\n        credentials: \"\", //cookie 的跨域策略，如 omit、same-origin 或 include\n        cache: \"\", //请求的 cache 模式: default、no-store、reload、no-cache、 force-cache 或 only-if-cached\n        redirect: \"follow\", // manual, *follow, error\n        referrerPolicy: \"no-referrer\" // no-referrer, *no-referrer-when-downgrade, origin, origin-when-cross-origin, same-origin, strict-origin, strict-origin-when-cross-origin, unsafe-url\n      },\n      options\n    )\n  ).then((response) => response.json());\n}\n\n/**\n *  ifWebFileHasChanged(\"yourpage.html\", function (nModif, nVisit) {\n      console.log(\n        \"The page '\" +\n          this.filepath +\n          \"' has been changed on \" +\n          new Date(nModif).toLocaleString() +\n          \"!\"\n      );\n    });\n */\nexport function ifWebFileHasChanged(sURL, fCallback) {\n  var xhr = new XMLHttpRequest();\n  xhr.open(\"HEAD\" /* use HEAD - we only need the headers! */, sURL);\n  xhr.filepath = sURL;\n  xhr.callback = fCallback;\n  xhr.onload = function () {\n    var nLastVisit = parseFloat(\n      window.localStorage.getItem(\"lm_\" + this.filepath)\n    );\n    var nLastModif = Date.parse(this.getResponseHeader(\"Last-Modified\"));\n    if (isNaN(nLastVisit) || nLastModif > nLastVisit) {\n      window.localStorage.setItem(\"lm_\" + this.filepath, Date.now());\n      isFinite(nLastVisit) && this.callback(nLastModif, nLastVisit);\n    }\n  };\n  xhr.send();\n}\n","export function localstorage(\n  key: string,\n  value?: string | number | boolean | object | []\n) {\n  if (value) {\n    window.localStorage.setItem(\n      key,\n      typeof value === \"string\" ? value : JSON.stringify(value)\n    );\n  } else {\n    return window.localStorage.getItem(key);\n  }\n}\n","export const scrollTo = (position: { x: number; y: number } = { x: 0, y: 0 }) =>\n  window.scrollTo(position.x, position.y);\n\nexport function setScrollRestoration(newVal: ScrollRestoration) {\n  try {\n    window.history.scrollRestoration = newVal;\n  } catch (e) {\n    ///\n  }\n}\n\nif (\"scrollRestoration\" in window.history) {\n  setScrollRestoration(\"manual\");\n  // reset scrollRestoration to auto when leaving page, allowing page reload\n  // and back-navigation from other pages to use the browser to restore the\n  // scrolling position.\n  window.addEventListener(\"beforeunload\", () => {\n    setScrollRestoration(\"auto\");\n  });\n  // Setting scrollRestoration to manual again when returning to this page.\n  window.addEventListener(\"load\", () => {\n    setScrollRestoration(\"manual\");\n  });\n}\n","type Target = Record<string, any>;\ntype Effect = () => void;\n\nlet activeEffect: Effect | null;\n\nconst targetKeyDep = new WeakMap<Target, Map<string, Dep>>();\n\nfunction getDep(target: Target, key: string) {\n  let depMap = targetKeyDep.get(target);\n  if (!depMap) {\n    depMap = new Map();\n    targetKeyDep.set(target, depMap);\n  }\n  let dep = depMap.get(key);\n  if (!dep) {\n    dep = new Dep();\n    depMap.set(key, dep);\n  }\n  return dep;\n}\n\nexport class Dep {\n  subscribers: Set<Effect>;\n\n  constructor() {\n    this.subscribers = new Set();\n  }\n\n  depend() {\n    if (activeEffect) {\n      this.subscribers.add(activeEffect);\n    }\n  }\n\n  notify() {\n    this.subscribers.forEach((effect) => effect());\n  }\n}\n\nexport function watchEffect(effect: Effect) {\n  activeEffect = effect;\n  // effect里面get数据后设置dep\n  effect();\n  activeEffect = null;\n}\n\nexport function reactiveVue2(raw: Target) {\n  Object.keys(raw).forEach((key) => {\n    let value = raw[key];\n    const dep = getDep(raw, key);\n    Object.defineProperty(raw, key, {\n      get() {\n        dep.depend();\n        return value;\n      },\n      set(newValue) {\n        if (newValue != value) {\n          value = newValue;\n          dep.notify();\n        }\n      }\n    });\n  });\n  return raw;\n}\n\nexport function reactiveVue3(raw: Target) {\n  return new Proxy(raw, {\n    get(target, key, receiver) {\n      const dep = getDep(raw, key as string);\n      dep.depend();\n      return Reflect.get(target, key, receiver);\n    },\n    set(target, key, value, receiver) {\n      const dep = getDep(raw, key as string);\n      if (raw[key as string] != value) {\n        raw[key as string] = value;\n        dep.notify();\n      }\n      return Reflect.set(target, key, value, receiver);\n    }\n  });\n}\n\n// /app/reactive.html\n"],"names":["BaseError","message","options","EnvironmentError","FileSelectCancelError","IllegalFileError","accepts","handleInputFiles","el","cb","handleDragAndDropFiles","dropZoneEl","e","selectFile","multiple","inputElement","resolve","reject","files","illegalFiles","file","getFileExtension","readeFile","fileHandler","reader","event","size","progress","fileName","isImage","isVideo","isAudio","isWordDocument","isExcelDocument","isPowerPointDocument","isJsonDocument","isXmlDocument","getFileType","slice","verified_type","buffer","fn2ObjectURL","fn","blob","onDocumentReady","check","microTask","patchDOM","oldNode","newNode","parent","attrName","attrValue","setCookie","cname","cvalue","exdays","d","expires","getCookie","name","ca","c","getCookieObject","item","acc","k","v","clearCookies","WebSocket","url","code","reason","wasClean","details","requestid","request","result","msg","data","resolution","rejection","error","value","getDocumentElement","getViewportSize","documentElement","getPageSize","viewport","isElementInViewport","rect","getPageScroll","getPageClient","getElementLeftInPage","element","actualLeft","current","getElementTopInPage","actualTop","getElementPositionInPage2","getElementPositionInPage","scroll","pageClient","getElementPositionInViewport","getPageVerticalScrollPercent","height","getMousePositionInPage","ev","pageScroll","getMousePositionInViewport","getMouseButton","getOperatingSystem","userAgent","operatingSystem","getOperatingSystemVersion","osVersion","match","getBrowserClient","client","getBrowserClientVersion","browserVersion","getUserGeolocationPromise","position","latitude","longitude","getBrowserLanguage","getTimeZone","isIOS","isAppleDevice","isAndroid","isMobile","isDarkMode","isBrowser","isNode","setRem","designWidth","docEl","dpr","rem","recalc","clientWidth","urlsafe_b64encode","str","urlsafe_b64decode","base64UrlStr","mod4","isURLRelative","path","isURL","string","givenURL","getUrlParams","query","p","getUrlParams2","obj","searchString","splits","handleURLChange","previousUrl","mutations","handleHashChange","handleHistoryChange","setTheme","theme","DOMKeyboardKeyCode","keyName","copyToClipboard","text","getSelectedText","isFocus","ele","siblings","child","isTabInView","navigateBack","navigateBack2","loadScript","src","script","getTextWidth","fontSize","fontWeight","span","width","getFixedWidthText","isNeedEllipsis","returnText","oldText","newText","arr","i","l","htmlEncode","templateData","s","arg","htmlDecode","rawContent","entities","prop","templateCompile","template","evalExpr","expr","addEventListener","type","handler","removeEventListener","stopPropagation","preventDefault","getTarget","getRelatedTarget","isBrowserSupportFileAPI","waitForStyleSheetsLoaded","document","links","loadedCount","checkAllLoaded","stylesheet","Easing","amount","power","now","time","now$1","Group","tweenId","tween","preserve","tweenIds","autoStart","Interpolation","m","f","b","n","pw","bn","p0","p1","fc","a","p2","p3","t","v0","v1","t2","t3","Sequence","mainGroup","Tween","_object","_group","properties","duration","property","_valuesStart","_valuesEnd","_valuesStartRepeat","startValue","startValueIsArray","propType","isInterpolationList","endValues","numChainedTweens","group","times","yoyo","easingFunction","interpolationFunction","tweens","callback","elapsed","endTime","start","end","startIsArray","endIsArray","tmp","endValue","nextId","getAll","removeAll","add","remove","update","TWEEN","lastTime","currTime","timeToCall","id","animateInWeb","render","animate","durationTime","animateCanvas","canvasID","canvas","ctx","animateTWEEN","UZIP","module","buf","onlyNames","rUs","rUi","o","out","eocd","cnu","csize","coffs","usize","nl","cl","roff","cmpr","nlen","elen","opts","off","crc","noCmpr","tot","wUi","wUs","zpd","cpr","fof","ioff","ext","tab","len","eend","buff","ns","strl","ci","opos","lvl","opt","U","goodIndex","putsE","pos","cvrd","dlen","lits","strt","prev","li","lc","bs","ebits","nc","ii","mch","dst","lgi","dgi","nice","chain","pi","dif","tl","td","dlim","maxd","j","ei","curd","oi","BFINAL","o0","l0","putsF","T","ML","MD","MH","numl","numd","numh","lset","dset","cstSize","fxdSize","dynSize","BTYPE","ltree","dtree","si","qb","qc","p8","tree","hst","set","rst","rsl","nxt","nnxt","prv","lz","zc","MAXL","list","hl","l2","lit","i0","i1","i2","maxl","dps","bCost","dbt","od","ch","u8","F","bitsF","bitsE","decodeTiny","makeCodes","codes2map","get17","noBuf","HLIT","HDIST","HCLEN","lmap","dmap","mx0","mx1","ebs","dcode","dlit","dbs","bl","nbuf","LL","ll","ni","mx","MAX_BITS","max_code","bits","bl_count","next_code","map","r15","val","rest","imb","dt","length","u16","u32","x","pushV","tgt","sv","Z_FIXED$1","Z_BINARY","Z_TEXT","Z_UNKNOWN$1","zero$1","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","BL_CODES$1","HEAP_SIZE$1","MAX_BITS$1","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","d_code","dist","put_short","w","send_bits","send_code","bi_reverse","res","bi_flush","gen_bitlen","desc","stree","has_stree","extra","base","h","xbits","overflow","gen_codes","tr_static_init","init_block","bi_windup","smaller","depth","_n2","_m2","pqdownheap","compress_block","sx","build_tree","node","scan_tree","prevlen","curlen","nextlen","count","max_count","min_count","send_tree","build_bl_tree","max_blindex","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","block_mask","static_init_done","_tr_init$1","_tr_stored_block$1","stored_len","last","_tr_align$1","_tr_flush_block$1","opt_lenb","static_lenb","_tr_tally$1","_tr_init_1","_tr_stored_block_1","_tr_flush_block_1","_tr_tally_1","_tr_align_1","trees","adler32_1","adler","s1","s2","makeTable","table","crcTable","crc32_1","messages","constants$2","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","Z_NO_FLUSH$2","Z_PARTIAL_FLUSH","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY$1","Z_UNKNOWN","Z_DEFLATED$2","MAX_MEM_LEVEL","MAX_WBITS$1","DEF_MEM_LEVEL","LENGTH_CODES","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","GZIP_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","err","strm","errorCode","zero","slide_hash","wsize","HASH","flush_pending","flush_block_only","put_byte","putShortMSB","read_buf","longest_match","cur_match","chain_length","scan","best_len","nice_match","limit","_win","wmask","strend","scan_end1","scan_end","fill_window","_w_size","more","deflate_stored","flush","min_block","left","have","used","deflate_fast","hash_head","bflush","deflate_slow","max_insert","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","lm_init","DeflateState","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateSetHeader","head","deflateInit2","level","method","windowBits","memLevel","strategy","wrap","deflateInit","deflate$2","old_flush","header","level_flags","beg","copy","gzhead_extra","bstate","deflateEnd","status","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","input","deflateInit_1","deflateInit2_1","deflateReset_1","deflateResetKeep_1","deflateSetHeader_1","deflate_2$1","deflateEnd_1","deflateSetDictionary_1","deflateInfo","deflate_1$2","_has","key","assign","sources","source","flattenChunks","chunks","chunk","common","STR_APPLY_UIA_OK","_utf8len","q","string2buf","c2","m_pos","str_len","buf_len","buf2binstring","buf2string","max","utf16buf","c_len","utf8border","strings","ZStream","zstream","toString$1","Z_NO_FLUSH$1","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFAULT_COMPRESSION","Z_DEFAULT_STRATEGY","Z_DEFLATED$1","Deflate$1","dict","flush_mode","chunkSize","_flush_mode","deflate$1","deflator","deflateRaw$1","gzip$1","Deflate_1$1","deflate_2","deflateRaw_1$1","gzip_1$1","constants$1","deflate_1$1","BAD$1","TYPE$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","lmask","dmask","here","op","from","from_source","output","state","top","dolen","dodist","MAXBITS","ENOUGH_LENS$1","ENOUGH_DISTS$1","CODES$1","LENS$1","DISTS$1","lbase","lext","dbase","dext","inftrees","lens","lens_index","codes","table_index","work","sym","min","root","curr","drop","huff","incr","fill","low","mask","offs","here_bits","here_op","here_val","CODES","LENS","DISTS","Z_FINISH$1","Z_BLOCK","Z_TREES","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","Z_BUF_ERROR","Z_DEFLATED","HEAD","FLAGS","TIME","OS","EXLEN","EXTRA","NAME","COMMENT","HCRC","DICTID","DICT","TYPE","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","BAD","MEM","SYNC","ENOUGH_LENS","ENOUGH_DISTS","DEF_WBITS","zswap32","InflateState","inflateStateCheck","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","inflateInit","virgin","lenfix","distfix","fixedtables","updatewindow","inflate$2","put","last_bits","last_op","last_val","hbuf","order","inf_leave","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflateReset_1","inflateReset2_1","inflateResetKeep_1","inflateInit_1","inflateInit2_1","inflate_2$1","inflateEnd_1","inflateGetHeader_1","inflateSetDictionary_1","inflateInfo","inflate_1$2","GZheader","gzheader","toString","Z_NO_FLUSH","Z_FINISH","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Inflate$1","last_avail_out","next_out_utf8","tail","utf8str","inflate$1","inflator","inflateRaw$1","Inflate_1$1","inflate_2","inflateRaw_1$1","ungzip$1","constants","inflate_1$1","Deflate","deflate","deflateRaw","gzip","Inflate","inflate","inflateRaw","ungzip","Deflate_1","deflate_1","deflateRaw_1","gzip_1","Inflate_1","inflate_1","inflateRaw_1","ungzip_1","constants_1","pako","UPNG","frms","img","empty","frm","fx","fy","fw","fh","fdata","area","bpp","bpl","bf","bf32","ctype","rs","qarea","ts","ti","tr","tg","tb","qi","ap","y","s0","t0","cj","di","gr","to","al","offset","bin","dd","doff","fd","foff","mgck","fr","rct","del","nz","keyw","bfr","cflag","pl","H","N","W","R","J","Q","X","u","C","V","A","M","I","Z","D","K","r","S","z","_","$","Y","cbpp","starting_row","starting_col","row_increment","col_increment","pass","ri","sw","sh","cr","cc","bpll","row","col","cdi","paeth","pa","pb","pc","sb","tw","th","xoff","yoff","mode","fa","fg","fb","ba","br","bg","bb","ifa","oa","ioa","bufs","ps","dels","tabs","forbidPlte","nimg","ac","bipp","bipl","wAs","anim","pltAlpha","leng","dl","wr","g","fi","imgd","filter","levelZero","nh","prms","onlyBlend","evenCrd","forbidPrev","minBits","alphaAnd","ilen","gotAlpha","cmap","plte","inds","nbufs","abuf","qres","cof","bln","img32","nw","ind","cmc","cimg","inj","alwaysBlend","cimg32","nx","ny","blend","tlim","tstp","tarea","it","p32","mix","miy","may","sarea","pimg","r0","r1","miX","miY","maX","maY","U8","U32","pimg32","cx","cy","rec","fls","ftry","CMPR","tsize","oimg","nimg32","KD","leafs","planeDst","nd","maxL","mi","ln","rn","node0","node1","est","d0","d1","d2","d3","eMq","vecDot","stats","m0","m1","m2","m3","iN","Rj","tmi","eMq255","tlen","noff","il","getRawImgInfo","imgUrl","image","getImgInfo","typeArr","fileType","imageType","getImageType","fileOrBlobToDataURL","dataUrl","rawInfo","imageData","getCanvasImgData","imgInfo","first4Byte","getCanvasImgDataByVideo","video","getCanvasImgDataByBitmap","imageBitmap","imageDataToBitmap","biWidth","biHeight","biSizeImage","bfSize","BITMAPFILEHEADER","BITMAPINFOHEADER","iPadding","aImgData","strPixelData","biWidth4","fromCharCode","iOffsetY","strPixelRow","iOffsetX","encodeData","imageDataToDataURL","imageDataToBlob","exportImageType","toImageType","blobToImage","blobToExport","imgName","objUrl","loadImage","lazyloadImages","imgs","viewHeight","getImageMainColor","canvasImageData","arrR","arrG","arrB","_getArryWeightValue","G","B","existArr","duplicationArr","duplicationCount","maxIndex","flipSideToSide","newImgData","startIndex","flipUpsideDown","leftRotate","rightRotate","toGrey","avgColor","toBlackAndWhite","newColor","toOpposite","toRed","toGreen","toBlue","toRedAndGreen","toRedAndBlue","toBlueAndGreen","toRedAndGrey","greyColor","toGreenAndGrey","toBlueAndGrey","sharpen","convolutionMatrix","marginSharpen","jpgToPng","pngToJpg","colorStacks","rectClip","newWidth","newHeight","retainOriginalSize","finalLeft","finalTop","finalWidth","finalHeight","startIndex2","radiusClip","borderRadius","jpgToPNG","finalRadius","changeSize","maxWidthHeight","changeBrightness","changeNum","changeDiaphaneity","fixedDiaphaneity","addWatermark","watermarkImageData","watermarkData","watermarkWidth","watermarkHeight","watermarkStartIndex","aboveColor","belowColor","finalColor","mosaic","mosaicWidth","mosaicHeight","mosaicSize","boxXIndex","boxYIndex","mosaicBoxColorX","mosaicBoxColorY","mosaicBoxColorIndex","compression","imageUrl","compressionDegree","degree","bit","png","getImageDataByAIData","originalImageData","AIImageData","AIData","backgroundColor","changeIntoColor","kernel","index","aboveA","belowA","aboveDiaphaneity","belowDiaphaneity","newColorR","newColorG","newColorB","newColorA","createXMLHttpRequest","xhr","versions","getFormElementData","oFormElement","sSearch","nItem","oField","sFieldType","nFile","fetchUseXMLHttpRequest","timeout","timeoutHandler","percentage","fetchUseFetch","response","ifWebFileHasChanged","sURL","fCallback","nLastVisit","nLastModif","localstorage","scrollTo","setScrollRestoration","newVal","activeEffect","targetKeyDep","getDep","target","depMap","dep","Dep","effect","watchEffect","reactiveVue2","raw","newValue","reactiveVue3","receiver"],"mappings":"6CAAO,MAAMA,WAAkB,KAAM,CACnC,MAEA,YAAYC,EAAiBC,EAAwB,CACnD,MAAMD,EAASC,CAAO,EACjB,KAAA,KAAO,KAAK,YAAY,IAC/B,CACF,CAEO,MAAMC,WAAyBH,EAAU,CAC9C,aAAc,CACZ,MAAM,mCAAmC,CAC3C,CACF,CAEO,MAAMI,WAA8BJ,EAAU,CACnD,aAAc,CACZ,MAAM,eAAe,CACvB,CACF,CAEO,MAAMK,WAAyBL,EAAU,CAC9C,QAEA,YAAYM,EAAmB,CACvB,MAAA,0BAA0BA,CAAO,SAAS,EAChD,KAAK,QAAUA,CACjB,CACF,CClBgB,SAAAC,GACdC,EACAC,EACA,CACGD,EAAA,iBACD,SACA,UAAY,CACVC,EAAGD,EAAG,KAAK,CACb,EACA,EAAA,CAEJ,CAEgB,SAAAE,GACdC,EACAF,EACA,CAEWE,EAAA,iBACT,WACA,SAAUC,EAAG,CACXA,EAAE,gBAAgB,EAClBA,EAAE,eAAe,EACbA,EAAE,eAAcA,EAAE,aAAa,WAAa,OAClD,EACA,EAAA,EAESD,EAAA,iBACT,OACA,SAAUC,EAAG,CACXA,EAAE,gBAAgB,EAClBA,EAAE,eAAe,EACbA,EAAE,cAAiBH,EAAAG,EAAE,aAAa,KAAK,CAC7C,EACA,EAAA,CAEJ,CASa,MAAAC,GAAa,CACxBP,EAAoB,CAAC,GAAG,EACxBQ,IACoB,CACpB,GAAI,CAAC,WAAW,UAAY,EAAE,WAAW,oBAAoB,UAC3D,MAAM,IAAIX,GAEZ,MAAMY,EAAe,WAAW,SAAS,cAAc,OAAO,EACjD,OAAAA,EAAA,aAAa,OAAQ,MAAM,EAC3BA,EAAA,aAAa,aAAc,QAAQ,EAC5C,MAAM,QAAQT,CAAO,GAAKA,EAAQ,OAAS,GAC7CS,EAAa,aAAa,SAAUT,EAAQ,KAAK,GAAG,CAAC,EAEnDQ,GACWC,EAAA,aAAa,WAAY,MAAM,EAE9CA,EAAa,MAAM,EAEZ,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC3B,WAAA,iBACT,QACA,IAAM,CACJ,WAAW,IAAM,EACX,CAACF,EAAa,OAASA,EAAa,OAAO,SAAW,IACjDE,EAAA,IAAIb,EAAuB,GAEnC,GAAI,CACT,EACA,CAAE,KAAM,EAAK,CAAA,EAEFW,EAAA,iBAAiB,SAAU,IAAM,CAC5C,GAAI,CAACA,EAAa,OAASA,EAAa,OAAO,SAAW,EACjDE,EAAA,IAAIb,EAAuB,MAC7B,CACL,MAAMc,EAAQ,MAAM,KAAKH,EAAa,KAAK,EACvCI,EAAaD,CAAK,GACbD,EAAA,IAAIZ,GAAiBC,CAAO,CAAC,EAEtCU,EAAQE,CAAK,CACf,CAAA,CACD,CAAA,CACF,EAED,SAASC,EAAaD,EAAwB,CAC5C,MACE,CAACZ,EAAQ,SAAS,GAAG,GACrBY,EAAM,KAAME,GAAS,CAACd,EAAQ,SAAS,IAAIe,GAAiBD,CAAI,CAAC,EAAE,CAAC,CAExE,CACF,EAMaE,GACXC,GACe,CACT,MAAAC,EAAS,IAAI,WACnB,OAAO,IAAI,QAAQ,CAACR,EAASC,IAAW,CAC/BO,EAAA,iBACL,WACCC,GAA0C,CACzC,MAAMC,EAAO,IAAM,KAAK,MAAMD,EAAM,MAAQ,GAAI,EAAI,OAC9CE,EAAW,KAAK,MAAOF,EAAM,OAASA,EAAM,MAAS,GAAG,EAAI,IAClE,QAAQ,IAAI,iBAAiBC,CAAI,cAAcC,CAAQ,EAAE,CAC3D,CAAA,EAEKH,EAAA,iBAAiB,OAASC,GAAsC,CAC7DT,EAAAS,EAAM,QAAQ,MAAW,CAAA,CAClC,EACMD,EAAA,iBAAiB,QAAUC,GAAuC,CACvER,EAAOQ,CAAK,CAAA,CACb,EACDF,EAAYC,CAAM,CAAA,CAGnB,CACH,EAQaH,GAAoBD,GAAgC,CAC3D,IAAAQ,EACJ,OAAIR,aAAgB,KAClBQ,EAAWR,EAAK,KAELQ,EAAAR,EAENQ,EAAS,MAAM,4BAA4B,EAAG,CAAC,GAAK,EAC7D,EAEaC,GAAWT,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBU,GAAWV,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBW,GAAWX,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBY,GAAkBZ,GACtB,4OAA4O,KACjPA,EAAK,IAAA,EAIIa,GAAmBb,GACvB,yOAAyO,KAC9OA,EAAK,IAAA,EAIIc,GAAwBd,GAC5B,wQAAwQ,KAC7QA,EAAK,IAAA,EAIIe,GAAkBf,GACtB,sBAAsB,KAAKA,EAAK,IAAI,EAGhCgB,GAAiBhB,GACrB,6CAA6C,KAAKA,EAAK,IAAI,EAQ7D,SAASiB,GAAYjB,EAAY,CAEtC,MAAMkB,EAAQlB,EAAK,MAAM,EAAG,CAAC,EACvBI,EAAS,IAAI,WACf,IAAAe,EACJ,OAAO,IAAI,QAAQ,CAACvB,EAASC,IAAW,CACtCO,EAAO,OAAS,UAAY,CAC1B,MAAMgB,EAAShB,EAAO,OAKtB,OAHa,IAAI,SAASgB,CAAM,EACb,UAAU,EAAG,EAAK,EAEtB,CACb,IAAK,YACaD,EAAA,YAChB,MACF,IAAK,YACaA,EAAA,YAChB,MACF,IAAK,WACaA,EAAA,kBAChB,MACF,IAAK,YACaA,EAAA,kBAChB,KACJ,CACA,OAAOvB,EAAQuB,CAAa,CAAA,EAG9Bf,EAAO,kBAAkBc,CAAK,CAAA,CAC/B,CACH,CAKO,SAASG,GAAaC,EAA6B,CAClD,MAAAC,EAAO,IAAI,KAAK,CAAC,IAAMD,EAAG,SAAA,EAAa,KAAK,EAAG,CACnD,KAAM,wBAAA,CACP,EACM,OAAA,IAAI,gBAAgBC,CAAI,CAEjC,CC5OO,SAASC,GAAgBnC,EAAgB,CAC9C,SAASoC,GAAQ,CACX,SAAS,aAAe,YACzBpC,IACM,SAAA,oBAAoB,mBAAoBoC,CAAK,EACxD,CACI,OAAO,SAAa,MACb,SAAA,iBAAiB,mBAAoBA,CAAK,EAC7CA,IAEV,CCVO,SAASC,GAAUrC,EAAgB,CACpC,OAAO,gBAAmB,WAC5B,eAAeA,CAAE,EAEjB,QAAQ,QAAQ,EACb,KAAKA,CAAE,EACP,MAAOG,GACN,WAAW,IAAM,CACT,MAAAA,CAAA,CACP,CAAA,CAGT,CCZgB,SAAAmC,GACdC,EACAC,EACAC,EACA,CACA,GAAI,CAACF,EAAS,CACRE,GAAUD,GACZC,EAAO,YAAYD,CAAO,EAE5B,MACF,CAEI,GAAA,CAAAD,EAAQ,YAAYC,CAAO,EAE3B,IAAAD,EAAQ,WAAaC,EAAQ,SAAU,CAClCC,EAAA,aAAaD,EAASD,CAAO,EACpC,MACF,CAEI,GAAAA,EAAQ,WAAa,KAAK,UAAW,CACnCA,EAAQ,cAAgBC,EAAQ,cAClCD,EAAQ,YAAcC,EAAQ,aAEhC,MACF,CAEA,QAAS,EAAID,EAAQ,WAAW,OAAS,EAAG,GAAK,EAAG,IAAK,CACvD,MAAMG,EAAWH,EAAQ,WAAW,CAAC,EAAE,KACnC,CAACC,EAAQ,aAAaE,CAAQ,GAAKA,IAAa,QAClDH,EAAQ,gBAAgBG,CAAQ,CAEpC,CAEA,QAAS,EAAI,EAAG,EAAIF,EAAQ,WAAW,OAAQ,IAAK,CAClD,MAAME,EAAWF,EAAQ,WAAW,CAAC,EAAE,KACjCG,EAAYH,EAAQ,WAAW,CAAC,EAAE,MAChCD,EAAA,aAAaG,EAAUC,CAAS,CAC1C,CAEA,QAAS,EAAI,EAAG,EAAIH,EAAQ,WAAW,OAAQ,IACzCD,EAAQ,WAAW,CAAC,EACtBD,GACEC,EAAQ,WAAW,CAAC,EACpBC,EAAQ,WAAW,CAAC,EACpBD,CAAA,EAGFA,EAAQ,YAAYC,EAAQ,WAAW,CAAC,EAAE,UAAU,EAAI,CAAC,EAI7D,KAAOD,EAAQ,WAAW,OAASC,EAAQ,WAAW,QAChDD,EAAQ,WAAmBA,EAAA,YAAYA,EAAQ,SAAS,EAEhE,CCtDO,SAASK,GAAUC,EAAOC,EAAQC,EAAQ,CAC/C,IAAIC,EAAI,IAAI,KACZA,EAAE,QAAQA,EAAE,QAAS,EAAGD,EAAS,GAAK,GAAK,GAAK,GAAI,EACpD,IAAIE,EAAU,WAAaD,EAAE,YAAW,EACxC,SAAS,OAASH,EAAQ,IAAMC,EAAS,KAAOG,CAClD,CAEO,SAASC,GAAUL,EAAO,CAG/B,QAFIM,EAAON,EAAQ,IACfO,EAAK,SAAS,OAAO,MAAM,GAAG,EACzB,EAAI,EAAG,EAAIA,EAAG,OAAQ,IAAK,CAClC,IAAIC,EAAID,EAAG,CAAC,EAAE,KAAI,EAClB,GAAIC,EAAE,QAAQF,CAAI,GAAK,EAAG,OAAOE,EAAE,UAAUF,EAAK,OAAQE,EAAE,MAAM,CACnE,CACD,MAAO,EAET,CAGY,MAACC,GAAkB,IAC7B,SAAS,OACN,MAAM,GAAG,EACT,IAAKC,GAASA,EAAK,MAAM,GAAG,CAAC,EAC7B,OAAO,CAACC,EAAK,CAACC,EAAGC,CAAC,KAAOF,EAAIC,EAAE,KAAI,EAAG,QAAQ,IAAK,EAAE,CAAC,EAAIC,IAAMF,EAAK,EAAE,EAG/DG,GAAe,IAC1B,SAAS,OACN,MAAM,GAAG,EACT,QACEN,GACE,SAAS,OAASA,EAChB,QAAQ,MAAO,EAAE,EACjB,QAAQ,MAAO,aAAa,IAAI,KAAI,EAAG,YAAW,CAAE,SAAS,CACxE,EChCO,MAAMO,EAAU,CACrB,YAAYC,EAAK,CAIf,KAAK,gBAAkB,GAMvB,KAAK,aAAe,GAEpB,KAAK,IAAMA,EAIX,KAAK,aAAY,CAClB,CAOD,cAAe,CACb,KAAK,OAAS,IAAID,GAAU,KAAK,GAAG,EAQpC,KAAK,OAAO,OAAS,IAAM,CACzB,KAAK,aAAa,QAASL,GAAS,KAAK,OAAO,KAAKA,CAAI,CAAC,EAC1D,KAAK,aAAe,EAC1B,EAEI,KAAK,OAAO,QAAWpD,GAAM,CAC3B,KAAM,CAAE,KAAA2D,EAAM,OAAAC,EAAQ,SAAAC,CAAQ,EAAK7D,EACnC,QAAQ,IAAI,eAAe2D,CAAI,IAAIC,CAAM,IAAIC,CAAQ,EAAE,CAC7D,EAEI,KAAK,OAAO,QAAW7D,GAAM,CAC3B,QAAQ,IAAI,eAAeA,CAAC,EAAE,CACpC,EAEI,KAAK,OAAO,UAAaA,GAAM,CAC7B,KAAK,eAAeA,CAAC,CAC3B,CACG,CAID,eAAeX,EAAS,CACtB,QAAQ,IAAI,wBAAwB,EACpC,KAAK,aAAa,KAAKA,CAAO,EAC9B,KAAK,aAAY,CAClB,CAKD,aAAc,CACZ,KAAK,OAAO,QACZ,QAAQ,IAAI,yBAAyB,CACtC,CAKD,YAAa,CACX,KAAK,aAAY,EACjB,QAAQ,IAAI,yBAAyB,CACtC,CAED,MAAM,YAAYyE,EAAS,CAUzB,IAAIC,EAAY,CAAC,IAAI,KACrB,MAAMC,EAAW,KAAK,gBAAgBD,CAAS,EAAI,CAAE,KAAMA,CAAS,EAI9D1E,EAAU,CAAE,GAAG2E,EAAS,GAAGF,CAAO,EAGxC,GAAI,CAEE,KAAK,OAAO,aAAeL,GAAU,KACvC,KAAK,OAAO,KAAK,KAAK,UAAUpE,CAAO,CAAC,EAIxC,KAAK,eAAe,KAAK,UAAUA,CAAO,CAAC,EAW7C,MAAM4E,EAAS,MAAM,IAAI,QAAQ,SAAU7D,EAASC,EAAQ,CAG1D2D,EAAQ,QAAU5D,EAElB,QAAQ,IAAI4D,CAAO,EAInB,WAAW,IAAM,CACf3D,EAAO,SAAS,CACjB,EAAE,GAAI,CACf,CAAO,EAED,eAAQ,KAAK,aAAc,CAAC,IAAI,KAAS2D,EAAQ,MAAQ,GAAI,EAGtDC,CACb,QAAc,CAER,QAAQ,IAAI,4BAA4B,EAExC,OAAO,KAAK,gBAAgBF,CAAS,CACtC,CACF,CA0BD,MAAM,eAAeG,EAAK,CACxB,GAAI,CACF,IAAIC,EAAO,KAAK,MAAMD,EAAI,IAAI,EAE9B,GAAI,OAAO,UAAU,eAAe,KAAKC,EAAM,WAAW,EAAG,CAC3D,MAAMH,EAAU,KAAK,gBAAgBG,EAAK,SAAS,EAC/CH,EAASA,EAAQ,QAAQG,CAAI,EAE/B,QAAQ,KACN,+DACAA,CACZ,CACA,MAEQ,QAAQ,KAAK,8BAA+BA,CAAI,CAExD,MAAY,CACN,QAAQ,IAAID,EAAI,IAAI,CACrB,CACF,CAKD,MAAM,YACJJ,EACAM,EACAC,EAAaC,GAAU,CACrB,QAAQ,IAAIA,CAAK,CAClB,EACD,CACA,KAAK,YAAYR,CAAO,EAAE,KACxB,SAAUS,EAAO,CACfH,EAAWG,CAAK,CACjB,EACD,SAAUD,EAAO,CACfD,EAAUC,CAAK,CAChB,CACP,CACG,CAUD,YAAYR,EAAS,CAEnB,MAAMzE,GAAW,IAAM,CACrB,GAAI,CACF,OAAO,KAAK,UAAUyE,CAAO,CAC9B,MAAW,CACV,OAAOA,CACR,CACP,KAEQ,KAAK,OAAO,aAAeL,GAAU,KACvC,KAAK,OAAO,KAAKpE,CAAO,EAIxB,KAAK,eAAeA,CAAO,CAE9B,CACH,CCxOO,SAASmF,IAAqB,CAC/B,OAAA,SAAS,YAAc,aAClB,SAAS,KAET,SAAS,eAEpB,CAGO,SAASC,IAAkB,CAChC,MAAMC,EAAkBF,KACjB,MAAA,CACL,MAAOE,EAAgB,aAAe,OAAO,WAC7C,OAAQA,EAAgB,cAAgB,OAAO,WAAA,CAEnD,CAGO,SAASC,IAAc,CAC5B,MAAMD,EAAkBF,KAClBI,EAAWH,KACV,MAAA,CACL,MAAO,KAAK,IAAIC,EAAgB,YAAaE,EAAS,KAAK,EAC3D,OAAQ,KAAK,IAAIF,EAAgB,aAAcE,EAAS,MAAM,CAAA,CAElE,CAiBO,SAASC,GAAoBjF,EAAiB,CACnD,MAAMgF,EAAWH,KACXK,EAAOlF,EAAG,wBAChB,OACEkF,EAAK,OAAS,GACdA,EAAK,IAAMF,EAAS,QACpBE,EAAK,MAAQ,GACbA,EAAK,KAAOF,EAAS,KAEzB,CAGO,SAASG,IAAgB,CAC9B,MAAML,EAAkBF,KACjB,MAAA,CACL,WAAYE,EAAgB,WAC5B,UAAWA,EAAgB,SAAA,CAE/B,CAEO,SAASM,IAAgB,CAC9B,MAAMN,EAAkBF,KACjB,MAAA,CACL,WAAYE,EAAgB,WAC5B,UAAWA,EAAgB,SAAA,CAE/B,CAEO,SAASO,GAAqBC,EAAsB,CACzD,IAAIC,EAAaD,EAAQ,WACrBE,EAAUF,EAAQ,aACtB,KAAOE,IAAY,MACjBD,GAAcC,EAAQ,WACtBA,EAAUA,EAAQ,aAEb,OAAAD,CACT,CAEO,SAASE,GAAoBH,EAAsB,CACxD,IAAII,EAAYJ,EAAQ,UACpBE,EAAUF,EAAQ,aACtB,KAAOE,IAAY,MACjBE,GAAaF,EAAQ,UACrBA,EAAUA,EAAQ,aAEb,OAAAE,CACT,CAEO,SAASC,GAA0BL,EAAsB,CACvD,MAAA,CACL,EAAGD,GAAqBC,CAAO,EAC/B,EAAGG,GAAoBH,CAAO,CAAA,CAElC,CACO,SAASM,GAAyBN,EAAsB,CACvD,MAAAJ,EAAOI,EAAQ,wBACfO,EAASV,KACTW,EAAaV,KACZ,MAAA,CACL,EAAGF,EAAK,KAAOW,EAAO,WAAaC,EAAW,WAC9C,EAAGZ,EAAK,IAAMW,EAAO,UAAYC,EAAW,SAAA,CAEhD,CAEO,SAASC,GAA6BT,EAAsB,CAC3D,MAAAJ,EAAOI,EAAQ,wBACd,MAAA,CACL,EAAGJ,EAAK,KACR,EAAGA,EAAK,GAAA,CAEZ,CAIO,SAASc,IAA+B,CAC7C,MAAMlB,EAAkBF,KAElBqB,EAASnB,EAAgB,aAAeA,EAAgB,aAC9D,OAAOmB,GAAU,EAAI,EAAKnB,EAAgB,UAAYmB,EAAU,GAClE,CAGO,SAASC,GAAuBC,EAAgB,CACjD,GAAAA,EAAG,OAASA,EAAG,MACjB,MAAO,CAAE,EAAGA,EAAG,MAAO,EAAGA,EAAG,OAE9B,MAAMC,EAAajB,KACbW,EAAaV,KACZ,MAAA,CACL,EAAGe,EAAG,QAAUC,EAAW,WAAaN,EAAW,WACnD,EAAGK,EAAG,QAAUC,EAAW,UAAYN,EAAW,SAAA,CAEtD,CAEO,SAASO,GAA2BF,EAAgB,CAClD,MAAA,CACL,EAAGA,EAAG,QACN,EAAGA,EAAG,OAAA,CAEV,CCzIO,SAASG,GAAerF,EAAO,CACpC,GAAI,SAAS,eAAe,WAAW,cAAe,KAAK,EACzD,OAAOA,EAAM,OAEb,OAAQA,EAAM,OAAM,CAClB,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACH,MAAO,GACT,IAAK,GACL,IAAK,GACH,MAAO,GACT,IAAK,GACH,MAAO,EACV,CAEL,CCpBa,MAAAsF,GAAqB,IAAM,CACtC,MAAMC,EAAY,UAAU,UAAU,YAAW,EACjD,IAAIC,EAAkB,UACtB,OAAID,EAAU,SAAS,KAAK,EAC1BC,EAAkB,QACTD,EAAU,SAAS,KAAK,EACjCC,EAAkB,UACT,UAAU,KAAKD,CAAS,EACjCC,EAAkB,UACT,mBAAmB,KAAKD,CAAS,EAC1CC,EAAkB,MACT,QAAQ,KAAKD,CAAS,EAC/BC,EAAkB,QACT,MAAM,KAAKD,CAAS,IAC7BC,EAAkB,OAEbA,EAAgB,aACzB,EAEaC,GAA4B,IAAM,CAC7C,MAAMF,EAAY,UAAU,UAC5B,IAAIG,EAAY,UAChB,GAAI,aAAa,KAAKH,CAAS,EAAG,CAChC,MAAMI,EAAQJ,EAAU,MAAM,uBAAuB,EACjDI,IACFD,EAAYC,EAAM,CAAC,EAEtB,SAAU,WAAW,KAAKJ,CAAS,EAAG,CACrC,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFD,EAAYC,EAAM,CAAC,EAAE,QAAQ,IAAK,GAAG,EAExC,SAAU,UAAU,KAAKJ,CAAS,EAAG,CACpC,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFD,EAAYC,EAAM,CAAC,EAEtB,SAAU,mBAAmB,KAAKJ,CAAS,EAAG,CAC7C,MAAMI,EAAQJ,EAAU,MAAM,cAAc,EACxCI,IACFD,EAAYC,EAAM,CAAC,EAAE,QAAQ,IAAK,GAAG,EAExC,CACD,OAAOD,EAAU,aACnB,EAEaE,GAAmB,IAAM,CACpC,MAAML,EAAY,UAAU,UAAU,YAAW,EACjD,IAAIM,EAAS,UACb,MAAI,SAAS,KAAKN,CAAS,EACzBM,EAAS,SACA,UAAU,KAAKN,CAAS,EACjCM,EAAS,UACA,SAAS,KAAKN,CAAS,EAChCM,EAAS,SACA,OAAO,KAAKN,CAAS,EAC9BM,EAAS,OACA,eAAe,KAAKN,CAAS,IAEtCM,EAAS,MAEJA,EAAO,aAChB,EAEaC,GAA0B,IAAM,CAC3C,MAAMP,EAAY,UAAU,UAC5B,IAAIQ,EAAiB,UACrB,GAAI,SAAS,KAAKR,CAAS,EAAG,CAC5B,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,UAAU,KAAKJ,CAAS,EAAG,CACpC,MAAMI,EAAQJ,EAAU,MAAM,qBAAqB,EAC/CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,SAAS,KAAKJ,CAAS,EAAG,CACnC,MAAMI,EAAQJ,EAAU,MAAM,qBAAqB,EAC/CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,OAAO,KAAKJ,CAAS,EAAG,CACjC,MAAMI,EAAQJ,EAAU,MAAM,kBAAkB,EAC5CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,eAAe,KAAKJ,CAAS,EAAG,CACzC,MAAMI,EAAQJ,EAAU,MAAM,wBAAwB,EAClDI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,CACD,OAAOI,CACT,EAEaC,GAA4B,IACnC,gBAAiB,UACZ,IAAI,QAAQ,CAACzG,EAASC,IAAW,CACtC,UAAU,YAAY,mBACnByG,GAAa,CACZ,MAAMC,EAAWD,EAAS,OAAO,SAC3BE,EAAYF,EAAS,OAAO,UAClC1G,EAAQ,CAAE,SAAA2G,EAAU,UAAAC,CAAS,CAAE,CAChC,EACA1C,GAAU,CACTjE,EAAOiE,CAAK,CACb,CACT,CACA,CAAK,EAEM,QAAQ,OAAO,+BAA+B,EAIlD,SAAS2C,IAAqB,CACnC,OAAQ,UAAU,iBAAmB,UAAU,UAAU,YAAW,CACtE,CAEO,SAASC,IAAc,CAC5B,OAAO,KAAK,eAAgB,EAAC,gBAAe,EAAG,SAAS,aAC1D,CAEO,SAASC,IAAQ,CACtB,OAAOhB,GAAoB,IAAK,KAClC,CAEO,SAASiB,IAAgB,CAC9B,OAAQjB,GAAkB,IAAO,MAAUA,GAAoB,IAAK,OACtE,CAEO,SAASkB,IAAY,CAC1B,OAAOlB,GAAoB,IAAK,SAClC,CAEO,SAASmB,IAAW,CACzB,OAAOH,GAAK,GAAME,IACpB,CAEO,SAASE,IAAa,CAC3B,OACE,OAAO,QAAW,UAClB,OAAO,YACP,OAAO,WAAW,8BAA8B,EAAE,OAEtD,CAEY,MAACC,GACX,OAAO,QAAW,UAAY,OAAO,UAAa,SAEvCC,GACX,OAAO,QAAY,KACnB,QAAQ,UAAY,MACpB,QAAQ,SAAS,MAAQ,KCzJpB,SAASC,GAAOC,EAAa,CAIlC,IAAIC,EAAQ,SAAS,gBAOjBC,EAAM,OAAO,iBACjBD,EAAM,QAAQ,IAAMC,EAkBpB,IAAIC,EAAM,IACNC,EAAS,UAAY,CAUvB,IAAIC,EAAc,KAAK,IAAIJ,EAAM,YAAaD,CAAW,EACzDC,EAAM,QAAQ,MAAQI,EACtBJ,EAAM,QAAQ,IAAME,EAAM,KAAK,MAAM,KAAOE,EAAcL,EAAY,EAItEC,EAAM,MAAM,SAAWE,EAAM,IACjC,EAEEC,IAGA,OAAO,OAAS,SAAUxE,EAAG,CAC3B,OAAAA,EAAI,WAAWA,CAAC,EACTA,EAAIuE,CACf,EACE,OAAO,OAAS,SAAUvE,EAAG,CAC3B,OAAAA,EAAI,WAAWA,CAAC,EACTA,EAAIuE,CACf,EAEO,OAAO,kBACZ,OAAO,iBACL,sBAAuB,OAAS,oBAAsB,SACtDC,EACA,EACJ,CACA,CCzDO,SAASE,GAAkBC,EAAK,CACrC,OAAO,KAAK,mBAAmBA,CAAG,CAAC,EAChC,WAAW,IAAK,GAAG,EACnB,WAAW,IAAK,GAAG,EACnB,WAAW,IAAK,EAAE,CACvB,CAGO,SAASC,GAAkBC,EAAc,CAC9C,IAAIjE,EAAOiE,EAAa,WAAW,IAAK,GAAG,EAAE,WAAW,IAAK,GAAG,EAC5DC,EAAOlE,EAAK,OAAS,EACzB,OAAIkE,IACFlE,EAAOA,EAAK,OAAOA,EAAK,QAAU,EAAIkE,GAAO,GAAG,GAE3C,mBAAmB,KAAKlE,CAAI,CAAC,CACtC,CAEa,MAAAmE,GAAiBC,GAAS,CAAC,oBAAoB,KAAKA,CAAI,EAE9D,SAASC,GAAMC,EAAQ,CAC5B,IAAIC,EACJ,GAAI,CACFA,EAAW,IAAI,IAAID,CAAM,CAC1B,OAAQnE,EAAO,CACd,eAAQ,IAAIA,CAAK,EACV,EACR,CAGD,OAAOoE,EAAS,WAAa,SAAWA,EAAS,WAAa,QAChE,CAEa,MAAAC,GAAgBC,GAC3B,MAAM,KAAK,IAAI,gBAAgBA,CAAK,CAAC,EAAE,OACrC,CAACC,EAAG,CAACvF,EAAGC,CAAC,IACP,OAAO,OAAO,CAAE,EAAEsF,EAAG,CACnB,CAACvF,CAAC,EAAGuF,EAAEvF,CAAC,GAAK,MAAM,QAAQuF,EAAEvF,CAAC,CAAC,EAAIuF,EAAEvF,CAAC,EAAI,CAACuF,EAAEvF,CAAC,CAAC,GAAG,OAAOC,CAAC,EAAIA,CACtE,CAAO,EACH,CAAE,CACF,EAEG,SAASuF,IAAgB,CAC9B,IAAIC,EAAM,CAAA,EACNC,EAAe,SAAS,OAC5B,OAAIA,IACFA,EAAeA,EAAa,UAAU,EAAGA,EAAa,MAAM,EAC5CA,EAAa,MAAM,GAAG,EAC5B,QAAS5F,GAAS,CAC1B,MAAM6F,EAAS7F,EAAK,MAAM,GAAG,EAC7B2F,EAAIE,EAAO,CAAC,CAAC,EAAI,mBAAmBA,EAAO,CAAC,CAAC,CACnD,CAAK,GAEIF,CACT,CAEO,SAASG,GAAgBrJ,EAAI,CAClC,IAAIsJ,EAAc,GACH,IAAI,iBAAiB,SAAUC,EAAW,CACnD,OAAO,SAAS,OAASD,IAC3BA,EAAc,OAAO,SAAS,KAC9B,QAAQ,IAAI,uBAAuB,OAAO,SAAS,IAAI,EAAE,EACrDtJ,GAAIA,EAAG,SAAS,IAAI,EAE9B,CAAG,EACQ,QAAQ,SAAU,CACzB,WAAY,GACZ,UAAW,GACX,QAAS,EACb,CAAG,CACH,CAEO,SAASwJ,GAAiBxJ,EAAI,CACnC,OAAO,iBAAiB,aAAc,IAAM,CAC1CA,EAAG,SAAS,IAAI,CACpB,CAAG,CACH,CAEO,SAASyJ,GAAoBzJ,EAAI,CAGtC,OAAO,iBAAiB,WAAYA,CAAE,CACxC,CC9FO,SAAS0J,GAASC,EAAgB,CACvCA,EAAQA,GAAS,aAAa,MACzBA,IACHA,EAAQ,OAAO,WAAW,8BAA8B,EAAE,QACtD,OACA,QACJ,aAAa,MAAQA,GAEvB,SAAS,gBAAgB,UAAU,OAAO,OAAQA,IAAU,MAAM,CACpE,CCTO,MAAMC,EAAmB,CAC9B,OAAc,SAAS5I,EAAqD,CAEpE,MAAA8C,EAAO9C,EAAM,SAAWA,EAAM,SAC7B,MAAA,CACL,KAAA8C,EACA,IAAK8F,GAAmB,UAAU9F,CAAI,CAAA,CAE1C,CAUA,OAAc,UAAU+F,EAAyB,CAE7C,OAAA,OAAO,UAAU,eAAe,KAC9BD,GAAmB,WACnBC,CAAA,EAGKD,GAAmB,WAAWC,CAAO,EAErC,EAEX,CAUA,OAAc,UAAU/F,EAAsB,CAE1C,OAAA,OAAO,UAAU,eAAe,KAC9B8F,GAAmB,WACnB9F,EAAK,SAAS,CAAA,EAGT8F,GAAmB,WAAW9F,EAAK,SAAU,CAAA,EAE7C,EAEX,CAEA,OAAe,WAA0C,CACvD,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,SAAU,GACV,UAAW,EACX,IAAK,EACL,MAAO,GACP,MAAO,GACP,KAAM,GACN,IAAK,GACL,YAAa,GACb,UAAW,GACX,OAAQ,GACR,QAAS,GACT,UAAW,GACX,IAAK,GACL,KAAM,GACN,WAAY,GACZ,SAAU,GACV,YAAa,GACb,WAAY,GACZ,OAAQ,GACR,OAAQ,GACR,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,gBAAiB,GACjB,iBAAkB,GAClB,WAAY,GACZ,SAAU,GACV,SAAU,GACV,SAAU,GACV,SAAU,GACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,IAAK,IACL,SAAU,IACV,cAAe,IACf,OAAQ,IACR,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,SAAU,IACV,YAAa,IACb,WAAY,IACZ,WAAY,IACZ,MAAO,IACP,KAAM,IACN,OAAQ,IACR,cAAe,IACf,aAAc,IACd,aAAc,IACd,WAAY,IACZ,aAAc,IACd,aAAc,GAAA,EAGhB,OAAe,WAA0C,CACvD,EAAK,YACL,EAAK,MACL,GAAM,QACN,GAAM,QACN,GAAM,OACN,GAAM,MACN,GAAM,cACN,GAAM,YACN,GAAM,SACN,GAAM,WACN,GAAM,UACN,GAAM,YACN,GAAM,MACN,GAAM,OACN,GAAM,aACN,GAAM,WACN,GAAM,cACN,GAAM,aACN,GAAM,SACN,GAAM,SACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,kBACN,GAAM,mBACN,GAAM,aACN,GAAM,WACN,GAAM,WACN,GAAM,WACN,GAAM,WACN,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,MACP,IAAO,WACP,IAAO,gBACP,IAAO,SACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,MACP,IAAO,MACP,IAAO,MACP,IAAO,WACP,IAAO,cACP,IAAO,aACP,IAAO,aACP,IAAO,QACP,IAAO,OACP,IAAO,SACP,IAAO,gBACP,IAAO,eACP,IAAO,eACP,IAAO,aACP,IAAO,eACP,IAAO,cAAA,CAEX,CC/PY,MAACgG,GAAmBC,GAAS,UAAU,UAAU,UAAUA,CAAI,EAE9DC,GAAkB,IAAM,OAAO,aAAY,EAAG,SAAW,EAGzDC,GAAWC,GAAQA,IAAQ,SAAS,cAGpCC,GAAYD,GACvB,CAAA,EAAG,MAAM,KAAKA,EAAI,WAAW,QAAQ,EAAE,OAAQE,GAAUA,IAAUF,CAAG,EAG3DG,GAAc,IAAM,CAAC,SAAS,OAE9BC,GAAe,IAAM,QAAQ,KAAO,EACpCC,GAAgB,IAAM,QAAQ,GAAG,EAAE,EAEzC,SAASC,GAAWC,EAAK,CAC9B,IAAIC,EAAS,SAAS,cAAc,QAAQ,EAC5CA,EAAO,KAAO,kBACdA,EAAO,IAAMD,EACbC,EAAO,MAAQ,GACf,SAAS,KAAK,YAAYA,CAAM,EAChCA,EAAO,OAAS,IAAM,GACtBA,EAAO,QAAU,IAAM,EACzB,CAQa,MAAAC,GAAe,CAACZ,EAAMa,EAAUC,EAAa,MAAQ,CAChE,MAAMC,EAAO,SAAS,cAAc,MAAM,EAC1CA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,QAAU,IACrBA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,SAAW,UACtBA,EAAK,MAAM,SAAWF,EAAW,GAAKA,EAAW,KAAO,OACxDE,EAAK,MAAM,WAAaD,EAAW,SAAQ,EAC3CC,EAAK,UAAYf,EACjB,SAAS,KAAK,YAAYe,CAAI,EAC9B,MAAMC,EAAQD,EAAK,YACnB,gBAAS,KAAK,YAAYA,CAAI,EACvBC,CACT,EAUaC,GAAoB,CAC/BjB,EACAgB,EACAH,EAAW,GACXC,EAAa,IACbI,EAAiB,KACd,CACH,IAAIC,EAAa,GACbC,EAAU,GACVC,EAAU,GACd,GAAI,CAACrB,GAAQgB,EAAQH,GAAY,OAAOb,GAAS,SAAU,OAAOmB,EAClE,MAAMG,EAAMtB,EAAK,MAAM,EAAE,EACnBe,EAAO,SAAS,cAAc,MAAM,EAC1CA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,QAAU,IACrBA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,SAAW,UACtBA,EAAK,MAAM,SAAWF,EAAW,GAAKA,EAAW,KAAO,OACxDE,EAAK,MAAM,WAAaD,EAAW,SAAQ,EAC3C,SAAS,KAAK,YAAYC,CAAI,EAE9B,QAASQ,EAAI,EAAGC,EAAIF,EAAI,OAAQC,EAAIC,EAAGD,IAAK,CAC1C,MAAM/H,EAAO8H,EAAIC,CAAC,EAMlB,GALAH,EAAUC,EACVA,GAAW7H,EACX2H,EAAaE,EACbN,EAAK,UAAYM,EACAN,EAAK,YACPC,EAAO,CAChBE,EACFC,EAAaC,EAAU,MAEvBD,EAAaC,EAEf,KACD,CACF,CAED,gBAAS,KAAK,YAAYL,CAAI,EACvBI,CACT,EAaO,SAASM,GAAWC,EAAc,CACvC,IAAIC,EAAID,EAAa,CAAC,EACtB,QAASH,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIK,EAAM,OAAO,UAAUL,CAAC,CAAC,EAG7BI,GAAKC,EACF,QAAQ,KAAM,OAAO,EACrB,QAAQ,KAAM,MAAM,EACpB,QAAQ,KAAM,MAAM,EACpB,QAAQ,KAAM,QAAQ,EACtB,QAAQ,KAAM,OAAO,EAGxBD,GAAKD,EAAaH,CAAC,CACpB,CACD,OAAOI,CACT,CAEO,SAASE,GAAWC,EAAY,CACrC,IAAIC,EAAW,CACb,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,GACb,EACE,QAASC,KAAQD,EACX,OAAO,eAAe,KAAKA,EAAUC,CAAI,IAC3CF,EAAaA,EAAW,QAAQ,IAAI,OAAOE,EAAM,GAAG,EAAGD,EAASC,CAAI,CAAC,GAGzE,OAAOF,CACT,CAEO,SAASG,GAAgBC,EAAU,CACxC,MAAMC,EAAW,cACXC,EAAO,kBAEb,OAAAF,EAAWA,EACR,QAAQC,EAAU,gCAAgC,EAClD,QAAQC,EAAM,sBAAsB,EAEvCF,EAAW,SAAWA,EAAW,MAEpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAOPA,CAAQ;AAAA;AAAA;AAAA,OAMhB,CAEO,SAASG,GAAiB/G,EAASgH,EAAMC,EAAS,CAEnDjH,EAAQ,iBAEVA,EAAQ,iBAAiBgH,EAAMC,EAAS,EAAK,EACpCjH,EAAQ,YAEjBA,EAAQ,YAAY,KAAOgH,EAAMC,CAAO,EAExCjH,EAAQ,KAAOgH,CAAI,EAAIC,CAE3B,CAEO,SAASC,GAAoBlH,EAASgH,EAAMC,EAAS,CACtDjH,EAAQ,oBACVA,EAAQ,oBAAoBgH,EAAMC,EAAS,EAAK,EACvCjH,EAAQ,YACjBA,EAAQ,YAAY,KAAOgH,EAAMC,CAAO,EAExCjH,EAAQ,KAAOgH,CAAI,EAAI,IAE3B,CAEO,SAASG,GAAgBxL,EAAO,CACjCA,EAAM,gBACRA,EAAM,gBAAe,EAErBA,EAAM,aAAe,EAEzB,CAEO,SAASyL,GAAezL,EAAO,CAChCA,EAAM,eACRA,EAAM,eAENA,EAAM,YAAc,EAExB,CAEO,SAAS0L,GAAU1L,EAAO,CAC/B,OAAOA,EAAM,QAAUA,EAAM,UAC/B,CAEO,SAAS2L,GAAiB3L,EAAO,CACtC,OAAIA,EAAM,cACDA,EAAM,cACJA,EAAM,UACRA,EAAM,UACJA,EAAM,YACRA,EAAM,YAEN,IAEX,CAEO,SAAS4L,IAA0B,CACxC,MAAI,UAAO,MAAQ,OAAO,YAAc,OAAO,UAAY,OAAO,KAMpE,CAEa,MAAAC,GAA4BC,GACvC,IAAI,QAASvM,GAAY,CACvB,MAAMwM,EAAQ,MAAM,KAAKD,EAAS,iBAAiB,sBAAsB,CAAC,EAC1E,IAAIE,EAAcF,EAAS,YAAY,QAAU,EACjD,MAAMG,EAAiB,IACjBD,GAAeD,EAAM,QACvBxM,IACO,IAEF,GAEJ0M,EAAc,GACjBF,EAAM,QAASG,GAAe,CAC5BA,EAAW,OAAS,IAAM,CACxBF,GAAe,EACfC,GACV,CACA,CAAO,CAEJ,CAAA,ECzPUE,GAAS,CAEpB,OAAQ,CACN,KAAM,SAAUC,EAAwB,CAC/B,OAAAA,CACT,CACF,EAEA,UAAW,CACT,GAAI,SAAUA,EAAwB,CACpC,OAAOA,EAASA,CAClB,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAOA,GAAU,EAAIA,EACvB,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAEjB,KAAQ,EAAEA,GAAUA,EAAS,GAAK,EAC3C,CACF,EAEA,MAAO,CACL,GAAI,SAAUA,EAAwB,CACpC,OAAOA,EAASA,EAASA,CAC3B,EACA,IAAK,SAAUA,EAAwB,CAC9B,MAAA,EAAEA,EAASA,EAASA,EAAS,CACtC,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAE1B,KAAQA,GAAU,GAAKA,EAASA,EAAS,EAClD,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CAC7B,OAAAA,EAASA,EAASA,EAASA,CACpC,EACA,IAAK,SAAUA,EAAwB,CACrC,MAAO,IAAI,EAAEA,EAASA,EAASA,EAASA,CAC1C,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAASA,EAEnC,MAASA,GAAU,GAAKA,EAASA,EAASA,EAAS,EAC5D,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CAC7B,OAAAA,EAASA,EAASA,EAASA,EAASA,CAC7C,EACA,IAAK,SAAUA,EAAwB,CACrC,MAAO,EAAEA,EAASA,EAASA,EAASA,EAASA,EAAS,CACxD,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAASA,EAASA,EAE5C,KAAQA,GAAU,GAAKA,EAASA,EAASA,EAASA,EAAS,EACpE,CACF,EAEA,WAAY,CACV,GAAI,SAAUA,EAAwB,CACpC,MAAO,GAAI,KAAK,KAAM,EAAMA,GAAU,KAAK,GAAM,CAAC,CACpD,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAO,KAAK,IAAKA,EAAS,KAAK,GAAM,CAAC,CACxC,EACA,MAAO,SAAUA,EAAwB,CACvC,MAAO,KAAO,EAAI,KAAK,IAAI,KAAK,IAAM,GAAMA,EAAO,EACrD,CACF,EAEA,YAAa,CACX,GAAI,SAAUA,EAAwB,CACpC,OAAOA,IAAW,EAAI,EAAI,KAAK,IAAI,KAAMA,EAAS,CAAC,CACrD,EACA,IAAK,SAAUA,EAAwB,CAC9B,OAAAA,IAAW,EAAI,EAAI,EAAI,KAAK,IAAI,EAAG,IAAMA,CAAM,CACxD,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,GAEJA,GAAU,GAAK,EACX,GAAM,KAAK,IAAI,KAAMA,EAAS,CAAC,EAEjC,IAAO,CAAC,KAAK,IAAI,EAAG,KAAOA,EAAS,EAAE,EAAI,EACnD,CACF,EAEA,SAAU,CACR,GAAI,SAAUA,EAAwB,CACpC,MAAO,GAAI,KAAK,KAAK,EAAIA,EAASA,CAAM,CAC1C,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAO,KAAK,KAAK,GAAI,EAAEA,EAASA,CAAM,CACxC,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,KAAQ,KAAK,KAAK,EAAIA,EAASA,CAAM,EAAI,GAE3C,IAAO,KAAK,KAAK,GAAKA,GAAU,GAAKA,CAAM,EAAI,EACxD,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CACpC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,EAGP,CAAC,KAAK,IAAI,EAAG,IAAMA,EAAS,EAAE,EAAI,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,CAE3E,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,EAGP,KAAK,IAAI,EAAG,IAAMA,CAAM,EAAI,KAAK,KAAKA,EAAS,IAAO,EAAI,KAAK,EAAE,EAAI,CAEzE,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,GAECA,GAAA,EACNA,EAAS,EAET,IACA,KAAK,IAAI,EAAG,IAAMA,EAAS,EAAE,EAC7B,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,EAIvC,GACE,KAAK,IAAI,EAAG,KAAOA,EAAS,EAAE,EAC9B,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,EACvC,EAEJ,CACF,EAEA,KAAM,CACJ,GAAI,SAAUA,EAAwB,CAEpC,OAAOA,IAAW,EAAI,EAAIA,EAASA,IAAW,QAAI,GAAKA,EAAS,QAClE,EACA,IAAK,SAAUA,EAAwB,CAE9B,OAAAA,IAAW,EAAI,EAAI,EAAEA,EAASA,IAAW,QAAI,GAAKA,EAAS,SAAK,CACzE,EACA,MAAO,SAAUA,EAAwB,CACvC,MAAM1B,EAAI,UACL,OAAA0B,GAAU,GAAK,EACX,IAAOA,EAASA,IAAW1B,EAAI,GAAK0B,EAAS1B,IAE/C,KAAQ0B,GAAU,GAAKA,IAAW1B,EAAI,GAAK0B,EAAS1B,GAAK,EAClE,CACF,EAEA,OAAQ,CACN,GAAI,SAAU0B,EAAwB,CACpC,MAAO,GAAID,GAAO,OAAO,IAAI,EAAIC,CAAM,CACzC,EACA,IAAK,SAAUA,EAAwB,CACjC,OAAAA,EAAS,EAAI,KACR,OAASA,EAASA,EAChBA,EAAS,EAAI,KACf,QAAUA,GAAU,IAAM,MAAQA,EAAS,IACzCA,EAAS,IAAM,KACjB,QAAUA,GAAU,KAAO,MAAQA,EAAS,MAE5C,QAAUA,GAAU,MAAQ,MAAQA,EAAS,OAExD,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,EAAS,GACJD,GAAO,OAAO,GAAGC,EAAS,CAAC,EAAI,GAEjCD,GAAO,OAAO,IAAIC,EAAS,EAAI,CAAC,EAAI,GAAM,EACnD,CACF,EACA,YAAa,SAAUC,EAAQ,EAI7B,CACA,OAAAA,EAAQA,EAAQ,OAAO,QAAU,OAAO,QAAUA,EAC1CA,EAAAA,EAAQ,IAAQ,IAAQA,EACzB,CACL,GAAI,SAAUD,EAAwB,CACpC,OAAOA,GAAUC,CACnB,EACA,IAAK,SAAUD,EAAwB,CAC9B,MAAA,IAAK,EAAIA,IAAWC,CAC7B,EACA,MAAO,SAAUD,EAAwB,CACvC,OAAIA,EAAS,IACHA,EAAS,IAAMC,EAAQ,GAEzB,GAAK,EAAID,EAAS,IAAMC,GAAS,EAAI,EAC/C,CAAA,CAEJ,CACF,ECpOA,IAAIC,GAGF,OAAO,KAAS,KAChB,OAAO,QAAY,KACnB,QAAQ,OAERA,GAAM,UAAoB,CAClB,MAAAC,EAAO,QAAQ,SAGrB,OAAOA,EAAK,CAAC,EAAI,IAAOA,EAAK,CAAC,EAAI,GAAA,EAKpC,OAAO,KAAS,KAChB,KAAK,cAAgB,QACrB,KAAK,YAAY,MAAQ,OAIzBD,GAAM,KAAK,YAAY,IAAI,KAAK,KAAK,WAAW,EACvC,KAAK,MAAQ,OACtBA,GAAM,KAAK,IAEXA,GAAM,UAAoB,CACjB,OAAA,IAAI,OAAO,SAAQ,EAI9B,MAAAE,GAAeF,GCtBf,MAAqBG,EAAM,CACjB,QAEJ,CAAA,EAEI,yBAEJ,CAAA,EAEJ,QAAqC,CACnC,OAAO,OAAO,KAAK,KAAK,OAAO,EAAE,IAAKC,GAC7B,KAAK,QAAQA,CAAO,CAC5B,CACH,CAEA,WAAkB,CAChB,KAAK,QAAU,EACjB,CAEA,IAAIC,EAAkC,CACpC,KAAK,QAAQA,EAAM,MAAO,CAAA,EAAIA,EAC9B,KAAK,yBAAyBA,EAAM,MAAO,CAAA,EAAIA,CACjD,CAEA,OAAOA,EAAkC,CACvC,OAAO,KAAK,QAAQA,EAAM,MAAO,CAAA,EACjC,OAAO,KAAK,yBAAyBA,EAAM,MAAO,CAAA,CACpD,CAEA,OAAOJ,EAAeD,KAAOM,EAAW,GAAgB,CACtD,IAAIC,EAAW,OAAO,KAAK,KAAK,OAAO,EACnC,GAAAA,EAAS,SAAW,EACf,MAAA,GAEF,KAAAA,EAAS,OAAS,GAAG,CAC1B,KAAK,yBAA2B,GAChC,QAASvC,EAAI,EAAGA,EAAIuC,EAAS,OAAQvC,IAAK,CACxC,MAAMqC,EAAQ,KAAK,QAAQE,EAASvC,CAAC,CAAC,EAChCwC,EAAY,CAACF,EACfD,GAASA,EAAM,OAAOJ,EAAMO,CAAS,IAAM,IAAS,CAACF,GACvD,OAAO,KAAK,QAAQC,EAASvC,CAAC,CAAC,CAEnC,CACWuC,EAAA,OAAO,KAAK,KAAK,wBAAwB,CACtD,CACO,MAAA,EACT,CACF,CCnDO,MAAME,GAAgB,CAC3B,OAAQ,SAAUrK,EAAaD,EAAmB,CAC1C,MAAAuK,EAAItK,EAAE,OAAS,EACfuK,EAAID,EAAIvK,EACR6H,EAAI,KAAK,MAAM2C,CAAC,EAChBhM,EAAK8L,GAAc,MAAM,OAC/B,OAAItK,EAAI,EACCxB,EAAGyB,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGuK,CAAC,EAErBxK,EAAI,EACCxB,EAAGyB,EAAEsK,CAAC,EAAGtK,EAAEsK,EAAI,CAAC,EAAGA,EAAIC,CAAC,EAE1BhM,EAAGyB,EAAE4H,CAAC,EAAG5H,EAAE4H,EAAI,EAAI0C,EAAIA,EAAI1C,EAAI,CAAC,EAAG2C,EAAI3C,CAAC,CACjD,EAEA,OAAQ,SAAU5H,EAAaD,EAAmB,CAChD,IAAIyK,EAAI,EACF,MAAAC,EAAIzK,EAAE,OAAS,EACf0K,EAAK,KAAK,IACVC,EAAKN,GAAc,MAAM,UAC/B,QAASzC,EAAI,EAAGA,GAAK6C,EAAG7C,IACtB4C,GAAKE,EAAG,EAAI3K,EAAG0K,EAAI7C,CAAC,EAAI8C,EAAG3K,EAAG6H,CAAC,EAAI5H,EAAE4H,CAAC,EAAI+C,EAAGF,EAAG7C,CAAC,EAE5C,OAAA4C,CACT,EAEA,WAAY,SAAUxK,EAAaD,EAAmB,CAC9C,MAAAuK,EAAItK,EAAE,OAAS,EACrB,IAAIuK,EAAID,EAAIvK,EACR6H,EAAI,KAAK,MAAM2C,CAAC,EACd,MAAAhM,EAAK8L,GAAc,MAAM,WAC/B,OAAIrK,EAAE,CAAC,IAAMA,EAAEsK,CAAC,GACVvK,EAAI,IACN6H,EAAI,KAAK,MAAO2C,EAAID,GAAK,EAAIvK,EAAG,GAE3BxB,EACLyB,GAAG4H,EAAI,EAAI0C,GAAKA,CAAC,EACjBtK,EAAE4H,CAAC,EACH5H,GAAG4H,EAAI,GAAK0C,CAAC,EACbtK,GAAG4H,EAAI,GAAK0C,CAAC,EACbC,EAAI3C,CAAA,GAGF7H,EAAI,EACCC,EAAE,CAAC,GAAKzB,EAAGyB,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG,CAACuK,CAAC,EAAIvK,EAAE,CAAC,GAEjDD,EAAI,EACCC,EAAEsK,CAAC,GAAK/L,EAAGyB,EAAEsK,CAAC,EAAGtK,EAAEsK,CAAC,EAAGtK,EAAEsK,EAAI,CAAC,EAAGtK,EAAEsK,EAAI,CAAC,EAAGC,EAAID,CAAC,EAAItK,EAAEsK,CAAC,GAEzD/L,EACLyB,EAAE4H,EAAIA,EAAI,EAAI,CAAC,EACf5H,EAAE4H,CAAC,EACH5H,EAAEsK,EAAI1C,EAAI,EAAI0C,EAAI1C,EAAI,CAAC,EACvB5H,EAAEsK,EAAI1C,EAAI,EAAI0C,EAAI1C,EAAI,CAAC,EACvB2C,EAAI3C,CAAA,CAGV,EAEA,MAAO,CACL,OAAQ,SAAUgD,EAAYC,EAAY,EAAmB,CACnD,OAAAA,EAAKD,GAAM,EAAIA,CACzB,EACA,UAAW,SAAUH,EAAW7C,EAAmB,CAC3C,MAAAkD,EAAKT,GAAc,MAAM,UACxB,OAAAS,EAAGL,CAAC,EAAIK,EAAGlD,CAAC,EAAIkD,EAAGL,EAAI7C,CAAC,CACjC,EACA,UAAY,UAAY,CAChB,MAAAmD,EAAI,CAAC,CAAC,EACZ,OAAO,SAAU,EAAmB,CAClC,IAAI/C,EAAI,EACJ,GAAA+C,EAAE,CAAC,EACL,OAAOA,EAAE,CAAC,EAEZ,QAAS,EAAI,EAAG,EAAI,EAAG,IAChB/C,GAAA,EAEP,OAAA+C,EAAE,CAAC,EAAI/C,EACAA,CAAA,CACT,EACC,EACH,WAAY,SACV4C,EACAC,EACAG,EACAC,EACAC,EACQ,CACF,MAAAC,GAAMH,EAAKJ,GAAM,GACjBQ,GAAMH,EAAKJ,GAAM,GACjBQ,EAAKH,EAAIA,EACTI,EAAKJ,EAAIG,EACf,OACG,EAAIR,EAAK,EAAIG,EAAKG,EAAKC,GAAME,GAC7B,GAAKT,EAAK,EAAIG,EAAK,EAAIG,EAAKC,GAAMC,EACnCF,EAAKD,EACLL,CAEJ,CACF,CACF,ECzGA,MAAqBU,EAAS,CAC5B,OAAe,QAAU,EAEzB,OAAO,QAAiB,CACtB,OAAOA,GAAS,SAClB,CACF,CCJa,MAAAC,EAAY,IAAIzB,GCUtB,MAAM0B,EAA8B,CA+DzC,YAAoBC,EAAoBC,EAAwBH,EAAW,CAAvD,KAAA,QAAAE,EAAoB,KAAA,OAAAC,CAAoC,CA7DpE,IAAMJ,GAAS,SAGf,WAAa,GAEb,WAAa,EAEb,WAAa,EAEb,UAAY,IAGZ,UAAY,GAEZ,YAAc,EAGd,aAA6B,CAAA,EAE7B,WAA8C,CAAA,EAC9C,mBAAmC,CAAA,EAGnC,eAAiB,EAEjB,QAAU,EAEV,iBAEA,MAAQ,GAER,UAAY,GAGZ,gBAAkC9B,GAAO,OAAO,KAEhD,uBAAgDY,GAAc,OAG9D,eAAoC,CAAA,EACpC,gBAAkB,GAGlB,iBAEA,sBAAwB,GAExB,sBAEA,2BAA6B,GAE7B,kBAEA,kBAEA,oBAEA,gBAEA,SAAW,GAInB,OAAgB,CACd,OAAO,KAAK,GACd,CAEA,WAAqB,CACnB,OAAO,KAAK,UACd,CAEA,UAAoB,CAClB,OAAO,KAAK,SACd,CAEA,GAAGuB,EAA0BC,EAAyB,CAC/C,YAAA,WAAa,OAAO,OAAOD,CAAU,EACtCC,IAAa,SACf,KAAK,UAAYA,GAEZ,IACT,CAEA,SAASvM,EAAI,IAAY,CACvB,YAAK,UAAYA,EACV,IACT,CAEA,MAAMuK,EAAeD,KAAa,CAChC,GAAI,KAAK,WACA,OAAA,KAIT,GAFA,KAAK,QAAU,KAAK,OAAO,IAAI,IAAW,EAC1C,KAAK,QAAU,KAAK,eAChB,KAAK,UAAW,CAGlB,KAAK,UAAY,GACN,UAAAkC,KAAY,KAAK,mBAC1B,KAAK,0BAA0BA,CAAQ,EACvC,KAAK,aAAaA,CAAQ,EAAI,KAAK,mBAAmBA,CAAQ,CAElE,CACA,YAAK,WAAa,GAClB,KAAK,UAAY,GACjB,KAAK,sBAAwB,GAC7B,KAAK,2BAA6B,GAClC,KAAK,gBAAkB,GACvB,KAAK,WAAajC,EAClB,KAAK,YAAc,KAAK,WACnB,KAAA,iBACH,KAAK,QACL,KAAK,aACL,KAAK,WACL,KAAK,kBAAA,EAEA,IACT,CAEQ,iBACN6B,EACAK,EACAC,EACAC,EACM,CACN,UAAWH,KAAYE,EAAY,CAC3B,MAAAE,EAAaR,EAAQI,CAAQ,EAC7BK,EAAoB,MAAM,QAAQD,CAAU,EAC5CE,EAAWD,EAAoB,QAAU,OAAOD,EAChDG,EACJ,CAACF,GAAqB,MAAM,QAAQH,EAAWF,CAAQ,CAAC,EAGtD,GAAA,EAAAM,IAAa,aAAeA,IAAa,YAI7C,IAAIC,EAAqB,CACnB,IAAAC,EAAYN,EAAWF,CAAQ,EAC/B,GAAAQ,EAAU,SAAW,EACvB,SAGFA,EAAYA,EAAU,IACpB,KAAK,qBAAqB,KAAK,KAAMJ,CAAoB,CAAA,EAG3DF,EAAWF,CAAQ,EAAI,CAACI,CAAU,EAAE,OAAOI,CAAS,CACtD,CAEA,IACGF,IAAa,UAAYD,IAC1BD,GACA,CAACG,EACD,CACAN,EAAaD,CAAQ,EAAIK,EAAoB,CAAA,EAAK,CAAA,EAClD,UAAW9D,KAAQ6D,EACjBH,EAAaD,CAAQ,EAAEzD,CAAI,EAAI6D,EAAW7D,CAAI,EAEhD4D,EAAmBH,CAAQ,EAAIK,EAAoB,CAAA,EAAK,CAAA,EACnD,KAAA,iBACHD,EACAH,EAAaD,CAAQ,EACrBE,EAAWF,CAAQ,EACnBG,EAAmBH,CAAQ,CAAA,CAC7B,MAGI,OAAOC,EAAaD,CAAQ,EAAM,MACpCC,EAAaD,CAAQ,EAAII,GAEtBC,IACHJ,EAAaD,CAAQ,GAAK,GAExBO,EACFJ,EAAmBH,CAAQ,EAAIE,EAAWF,CAAQ,EAAE,MAAA,EAAQ,UAE5DG,EAAmBH,CAAQ,EAAIC,EAAaD,CAAQ,GAAK,EAG/D,CACF,CAEA,MAAa,CAKP,OAJC,KAAK,kBACR,KAAK,gBAAkB,GACvB,KAAK,kBAAkB,GAEpB,KAAK,YAGV,KAAK,QAAU,KAAK,OAAO,OAAO,IAAW,EAC7C,KAAK,WAAa,GAClB,KAAK,UAAY,GACb,KAAK,iBACF,KAAA,gBAAgB,KAAK,OAAO,EAE5B,MARE,IASX,CAEA,KAAY,CACV,YAAK,SAAW,GAChB,KAAK,OAAO,GAAQ,EACb,IACT,CAEA,MAAMjC,EAAeD,KAAa,CAChC,OAAI,KAAK,WAAa,CAAC,KAAK,WACnB,MAET,KAAK,UAAY,GACjB,KAAK,YAAcC,EACnB,KAAK,QAAU,KAAK,OAAO,OAAO,IAAW,EACtC,KACT,CAEA,OAAOA,EAAeD,KAAa,CACjC,MAAI,CAAC,KAAK,WAAa,CAAC,KAAK,WACpB,MAET,KAAK,UAAY,GACZ,KAAA,YAAcC,EAAO,KAAK,YAC/B,KAAK,YAAc,EACnB,KAAK,QAAU,KAAK,OAAO,IAAI,IAAW,EACnC,KACT,CAEA,mBAA0B,CAElB,QAAAjC,EAAI,EAAG2E,EAAmB,KAAK,eAAe,OAClD3E,EAAI2E,EACJ3E,IAEK,KAAA,eAAeA,CAAC,EAAE,KAAK,EAEvB,OAAA,IACT,CAEA,MAAM4E,EAAQhB,EAAiB,CAC7B,YAAK,OAASgB,EACP,IACT,CAEA,MAAM9C,EAAS,EAAS,CACtB,YAAK,WAAaA,EACX,IACT,CAEA,OAAO+C,EAAQ,EAAS,CACtB,YAAK,eAAiBA,EACtB,KAAK,QAAUA,EACR,IACT,CAEA,YAAY/C,EAAuB,CACjC,YAAK,iBAAmBA,EACjB,IACT,CAEA,KAAKgD,EAAO,GAAa,CACvB,YAAK,MAAQA,EACN,IACT,CAEA,OAAOC,EAAiClD,GAAO,OAAO,KAAY,CAChE,YAAK,gBAAkBkD,EAChB,IACT,CAEA,cACEC,EAA+CvC,GAAc,OACvD,CACN,YAAK,uBAAyBuC,EACvB,IACT,CAEA,SAASC,EAAiC,CACxC,YAAK,eAAiBA,EACf,IACT,CAEA,QAAQC,EAAsC,CAC5C,YAAK,iBAAmBA,EACjB,IACT,CAEA,aAAaA,EAAsC,CACjD,YAAK,sBAAwBA,EACtB,IACT,CAEA,SAASA,EAAuD,CAC9D,YAAK,kBAAoBA,EAClB,IACT,CAEA,SAASA,EAAsC,CAC7C,YAAK,kBAAoBA,EAClB,IACT,CAEA,WAAWA,EAAsC,CAC/C,YAAK,oBAAsBA,EACpB,IACT,CAEA,OAAOA,EAAsC,CAC3C,YAAK,gBAAkBA,EAChB,IACT,CAKA,OAAOjD,EAAOD,KAAOQ,EAAY,GAAe,CAC9C,GAAI,KAAK,UAAkB,MAAA,GACvB,IAAA0B,EACAiB,EACE,MAAAC,EAAU,KAAK,WAAa,KAAK,UACvC,GAAI,CAAC,KAAK,UAAY,CAAC,KAAK,WAAY,CACtC,GAAInD,EAAOmD,EAAgB,MAAA,GACvB5C,GAAW,KAAK,MAAMP,CAAI,CAChC,CAEI,GADJ,KAAK,SAAW,GACZA,EAAO,KAAK,WACP,MAAA,GAEL,KAAK,wBAA0B,KAC7B,KAAK,kBACF,KAAA,iBAAiB,KAAK,OAAO,EAEpC,KAAK,sBAAwB,IAE3B,KAAK,6BAA+B,KAClC,KAAK,uBACF,KAAA,sBAAsB,KAAK,OAAO,EAEzC,KAAK,2BAA6B,IAEzBkD,GAAAlD,EAAO,KAAK,YAAc,KAAK,UAC1CkD,EAAU,KAAK,YAAc,GAAKA,EAAU,EAAI,EAAIA,EAC9C,MAAA/L,EAAQ,KAAK,gBAAgB+L,CAAO,EAU1C,GATK,KAAA,kBACH,KAAK,QACL,KAAK,aACL,KAAK,WACL/L,CAAA,EAEE,KAAK,mBACF,KAAA,kBAAkB,KAAK,QAAS+L,CAAO,EAE1CA,IAAY,EACV,GAAA,KAAK,QAAU,EAAG,CAChB,SAAS,KAAK,OAAO,GAClB,KAAA,UAGF,IAAAjB,KAAY,KAAK,mBAChB,CAAC,KAAK,OAAS,OAAO,KAAK,WAAWA,CAAQ,GAAM,WACjD,KAAA,mBAAmBA,CAAQ,EAC9B,KAAK,mBAAmBA,CAAQ,EAChC,WAAW,KAAK,WAAWA,CAAQ,CAAW,GAE9C,KAAK,OACP,KAAK,0BAA0BA,CAAQ,EAEzC,KAAK,aAAaA,CAAQ,EAAI,KAAK,mBAAmBA,CAAQ,EAEhE,OAAI,KAAK,QACF,KAAA,UAAY,CAAC,KAAK,WAErB,KAAK,mBAAqB,OACvB,KAAA,WAAajC,EAAO,KAAK,iBAEzB,KAAA,WAAaA,EAAO,KAAK,WAE5B,KAAK,mBACF,KAAA,kBAAkB,KAAK,OAAO,EAErC,KAAK,2BAA6B,GAC3B,EAAA,KACF,CACD,KAAK,qBACF,KAAA,oBAAoB,KAAK,OAAO,EAGjC,QAAAjC,EAAI,EAAG2E,EAAmB,KAAK,eAAe,OAClD3E,EAAI2E,EACJ3E,IAIA,KAAK,eAAeA,CAAC,EAAE,MAAM,KAAK,WAAa,KAAK,SAAS,EAE/D,YAAK,WAAa,GACX,EACT,CAEK,MAAA,EACT,CAEQ,kBACN8D,EACAK,EACAC,EACAhL,EACM,CACN,UAAW8K,KAAYE,EAAY,CAC7B,GAAAD,EAAaD,CAAQ,IAAM,OAC7B,SAEI,MAAAmB,EAAQlB,EAAaD,CAAQ,GAAK,EACpC,IAAAoB,EAAMlB,EAAWF,CAAQ,EAC7B,MAAMqB,EAAe,MAAM,QAAQzB,EAAQI,CAAQ,CAAC,EAC9CsB,EAAa,MAAM,QAAQF,CAAG,EACR,CAACC,GAAgBC,EAEnC1B,EAAAI,CAAQ,EAAI,KAAK,uBACvBoB,EACAlM,CAAA,EAEO,OAAOkM,GAAQ,UAAYA,EACpC,KAAK,kBAAkBxB,EAAQI,CAAQ,EAAGmB,EAAOC,EAAKlM,CAAK,GAG3DkM,EAAM,KAAK,qBACTD,EACAC,CAAA,EAEE,OAAOA,GAAQ,WACjBxB,EAAQI,CAAQ,EAAImB,GAASC,EAAMD,GAASjM,GAGlD,CACF,CAEQ,qBAAqBiM,EAAeC,EAA8B,CACpE,OAAA,OAAOA,GAAQ,SACVA,EAELA,EAAI,OAAO,CAAC,IAAM,KAAOA,EAAI,OAAO,CAAC,IAAM,IACtCD,EAAQ,WAAWC,CAAG,EAEtB,WAAWA,CAAG,CAEzB,CAEQ,0BAA0BpB,EAAwB,CAClD,MAAAuB,EAAM,KAAK,mBAAmBvB,CAAQ,EACtCwB,EAAW,KAAK,WAAWxB,CAAQ,EACrC,OAAOwB,GAAa,SACjB,KAAA,mBAAmBxB,CAAQ,EAC9B,KAAK,mBAAmBA,CAAQ,EAAI,WAAWwB,CAAQ,EAEzD,KAAK,mBAAmBxB,CAAQ,EAAI,KAAK,WAAWA,CAAQ,EAEzD,KAAA,WAAWA,CAAQ,EAAIuB,CAC9B,CACF,CChdA,MAAME,GAAShC,GAAS,OAMlBiC,GAAShC,EAAU,OAAO,KAAKA,CAAS,EACxCiC,GAAYjC,EAAU,UAAU,KAAKA,CAAS,EAC9CkC,GAAMlC,EAAU,IAAI,KAAKA,CAAS,EAClCmC,GAASnC,EAAU,OAAO,KAAKA,CAAS,EACxCoC,GAASpC,EAAU,OAAO,KAAKA,CAAS,EAEjCqC,GAAQ,CACnB,OAAApE,GACA,MAAAM,GACA,cAAAM,GAAA,IACAT,GACA,SAAA2B,GACA,OAAAgC,GACA,MAAA9B,GACA,OAAA+B,GACA,UAAAC,GACA,IAAAC,GACA,OAAAC,GACA,OAAAC,EACF,GC/BC,UAAY,CACX,IAAIE,EAAW,EAQV,OAAO,wBACH,OAAA,sBAAwB,SAAUhB,EAAU,CACjD,MAAMiB,EAAW,IAAI,KAAK,EAAE,QAAQ,EAC9BC,EAAa,KAAK,IAAI,EAAG,IAAMD,EAAWD,EAAS,EACnDG,EAAK,OAAO,WAAW,UAAY,CACvCnB,EAASiB,EAAWC,CAAU,GAC7BA,CAAU,EACb,OAAAF,EAAWC,EAAWC,EACfC,CAAA,GAEN,OAAO,uBACH,OAAA,qBAAuB,SAAUA,EAAI,CAC1C,aAAaA,CAAE,CAAA,EAErB,KAEa,MAAAC,GAAgBC,GAA2C,CACtE,SAASC,EAAQC,EAAsB,CACrC,OAAO,sBAAsBD,CAAO,EACpCD,EAAOE,CAAY,CACrB,CACA,OAAO,sBAAsBD,CAAO,CACtC,EAEaE,GAAgB,CAC3BC,EACAJ,IACG,CACG,MAAAK,EAAS,SAAS,eAAeD,CAAQ,EACzCE,EAAMD,EAAO,WAAW,IAAI,EAClCN,GAAcG,GAAiB,CAC7BI,EAAI,UAAU,EAAG,EAAGD,EAAO,MAAOA,EAAO,MAAM,EAC/CL,EAAOM,EAAKJ,CAAY,CAAA,CACzB,CACH,EAGaK,GAAe,IAAM,CAChCR,GAAcG,GAAiBR,GAAM,OAAOQ,CAAY,CAAC,CAC3D,wIChDA,IAAIM,EAAO,CAAA,EACmBC,EAAA,QAAiBD,EAG/CA,EAAK,MAAW,SAASE,EAAKC,EAC9B,CAKC,QAJIC,EAAMJ,EAAK,IAAI,WAAYK,EAAML,EAAK,IAAI,SAAUM,EAAI,EAAGC,EAAM,CAAA,EACjEtO,EAAO,IAAI,WAAWiO,CAAG,EACzBM,EAAOvO,EAAK,OAAO,EAEjBoO,EAAIpO,EAAMuO,CAAI,GAAG,WAAYA,IAEnC,IAAIF,EAAIE,EACRF,GAAG,EACHA,GAAG,EACH,IAAIG,EAAML,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAClBF,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAE5B,IAAII,EAAQL,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAC9B,IAAIK,EAAQN,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAE9BA,EAAIK,EACJ,QAAQ1H,EAAE,EAAGA,EAAEwH,EAAKxH,IACpB,CACYoH,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAC7BA,GAAK,EACLA,GAAK,EACLA,GAAK,EAEOD,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAC9B,IAAII,EAAQL,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAC9B,IAAIM,EAAQP,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAE9B,IAAIO,EAAKT,EAAInO,EAAMqO,CAAC,EAAG5S,EAAK0S,EAAInO,EAAMqO,EAAE,CAAC,EAAGQ,EAAKV,EAAInO,EAAMqO,EAAE,CAAC,EAAIA,GAAK,EACvEA,GAAK,EAEL,IAAIS,EAAOV,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAC7BA,GAAKO,EAAKnT,EAAKoT,EAEfd,EAAK,WAAW/N,EAAM8O,EAAMR,EAAKG,EAAOE,EAAOT,CAAS,CACxD,CAED,OAAOI,CACP,EAEDP,EAAK,WAAa,SAAS/N,EAAMqO,EAAGC,EAAKG,EAAOE,EAAOT,EACvD,CACC,IAAIC,EAAMJ,EAAK,IAAI,WAAYK,EAAML,EAAK,IAAI,SAClCK,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAClBF,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAClBF,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAE9B,IAAIU,EAAQZ,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAElBD,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAElBD,EAAIpO,EAAMqO,CAAC,EAAIA,GAAG,EAG9BA,GAAG,EAEH,IAAIW,EAAQb,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAC9B,IAAIY,EAAQd,EAAInO,EAAMqO,CAAC,EAAIA,GAAG,EAE9B,IAAIxP,EAAQkP,EAAK,IAAI,SAAS/N,EAAMqO,EAAGW,CAAI,EAI3C,GAJ+CX,GAAGW,EAClDX,GAAKY,EAGFf,EAAW,CAAGI,EAAIzP,CAAI,EAAE,CAAC,KAAK8P,EAAO,MAAMF,CAAK,EAAI,MAAU,CACjE,IAAIpS,EAAO,IAAI,WAAW2D,EAAK,OAAQqO,CAAC,EAEnC,GAAGU,GAAM,EAAGT,EAAIzP,CAAI,EAAI,IAAI,WAAWxC,EAAK,OAAO,MAAMgS,EAAGA,EAAEI,CAAK,CAAC,UACjEM,GAAM,EAAG,CAChB,IAAId,EAAM,IAAI,WAAWU,CAAK,EAAIZ,EAAK,WAAW1R,EAAM4R,CAAG,EAQ3DK,EAAIzP,CAAI,EAAIoP,CACZ,KACI,MAAM,+BAA+Bc,CAC1C,EAEDhB,EAAK,WAAa,SAAS1R,EAAM4R,EAAK,CAAG,OAAOF,EAAK,EAAE,QAAQ1R,EAAM4R,CAAG,CAAK,EAC7EF,EAAK,QAAa,SAAS1R,EAAM4R,EAAK,CAC3B,OAAA5R,EAAK,CAAC,EAASA,EAAK,CAAC,EAGxB0R,EAAK,WAAW,IAAI,WAAW1R,EAAK,OAAQA,EAAK,WAAW,EAAGA,EAAK,OAAO,CAAC,EAAG4R,CAAG,CACzF,EACDF,EAAK,QAAa,SAAS/N,EAAMkP,EAAoB,CACjDA,GAAM,OAAMA,EAAK,CAAC,MAAM,CAAC,GAC5B,IAAIC,EAAI,EAAGlB,EAAI,IAAI,WAAW,GAAG,KAAK,MAAMjO,EAAK,OAAO,GAAG,CAAC,EAC5DiO,EAAIkB,CAAG,EAAE,IAAMlB,EAAIkB,EAAI,CAAC,EAAE,IAAMA,GAAK,EACrCA,EAAMpB,EAAK,EAAE,WAAW/N,EAAMiO,EAAKkB,EAAKD,EAAK,KAAK,EAClD,IAAIE,EAAMrB,EAAK,MAAM/N,EAAM,EAAGA,EAAK,MAAM,EACzC,OAAAiO,EAAIkB,EAAI,CAAC,EAAIC,IAAM,GAAI,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAM,GAAI,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAO,EAAG,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAO,EAAG,IAChB,IAAI,WAAWnB,EAAI,OAAQ,EAAGkB,EAAI,CAAC,CAC1C,EACDpB,EAAK,WAAa,SAAS/N,EAAMkP,EAAM,CACnCA,GAAM,OAAMA,EAAK,CAAC,MAAM,CAAC,GAC5B,IAAIjB,EAAI,IAAI,WAAW,GAAG,KAAK,MAAMjO,EAAK,OAAO,GAAG,CAAC,EACjDmP,EAAMpB,EAAK,EAAE,WAAW/N,EAAMiO,EAAKkB,EAAKD,EAAK,KAAK,EACtD,OAAO,IAAI,WAAWjB,EAAI,OAAQ,EAAGkB,CAAG,CACxC,EAGDpB,EAAK,OAAS,SAASnJ,EAAKyK,EAAQ,CAChCA,GAAQ,OAAMA,EAAO,IACxB,IAAIC,EAAM,EAAGC,EAAMxB,EAAK,IAAI,UAAWyB,EAAMzB,EAAK,IAAI,YAClD0B,EAAM,CAAA,EACV,QAAQ/K,KAAKE,EAAK,CAAG,IAAI8K,EAAM,CAAC3B,EAAK,QAAQrJ,CAAC,GAAK,CAAC2K,EAAQpB,EAAMrJ,EAAIF,CAAC,EAAG0K,EAAMrB,EAAK,IAAI,IAAIE,EAAI,EAAEA,EAAI,MAAM,EAC5GwB,EAAI/K,CAAC,EAAI,CAAG,IAAIgL,EAAK,MAAMzB,EAAI,OAAQ,IAAImB,EAAK,KAAOM,EAAM3B,EAAK,WAAWE,CAAG,EAAIA,CAAI,CAAO,CAEhG,QAAQvJ,KAAK+K,EAAKH,GAAOG,EAAI/K,CAAC,EAAE,KAAK,OAAS,GAAK,GAAK,EAAEqJ,EAAK,IAAI,SAASrJ,CAAC,EAC7E4K,GAAQ,GAER,IAAItP,EAAO,IAAI,WAAWsP,CAAG,EAAGjB,EAAI,EAChCsB,EAAM,CAAE,EAEZ,QAAQjL,KAAK+K,EAAK,CACjB,IAAIpT,EAAOoT,EAAI/K,CAAC,EAAIiL,EAAI,KAAKtB,CAAC,EAC9BA,EAAIN,EAAK,aAAa/N,EAAMqO,EAAG3J,EAAGrI,EAAM,CAAC,CACzC,CACD,IAAI2K,EAAE,EAAG4I,EAAOvB,EAChB,QAAQ3J,KAAK+K,EAAK,CACjB,IAAIpT,EAAOoT,EAAI/K,CAAC,EAAIiL,EAAI,KAAKtB,CAAC,EAC9BA,EAAIN,EAAK,aAAa/N,EAAMqO,EAAG3J,EAAGrI,EAAM,EAAGsT,EAAI3I,GAAG,CAAC,CACnD,CACD,IAAIyH,EAAQJ,EAAEuB,EAEd,OAAAL,EAAIvP,EAAMqO,EAAG,SAAU,EAAIA,GAAG,EAC9BA,GAAK,EACLmB,EAAIxP,EAAMqO,EAAGrH,CAAC,EAAIqH,GAAK,EACvBmB,EAAIxP,EAAMqO,EAAGrH,CAAC,EAAIqH,GAAK,EACvBkB,EAAIvP,EAAMqO,EAAGI,CAAK,EAAIJ,GAAK,EAC3BkB,EAAIvP,EAAMqO,EAAGuB,CAAI,EAAKvB,GAAK,EAC3BA,GAAK,EACErO,EAAK,MACZ,EAED+N,EAAK,QAAU,SAASpQ,EAAI,CAAG,IAAIkS,EAAMlS,EAAG,MAAM,GAAG,EAAE,IAAG,EAAG,YAAW,EAAK,MAAO,mBAAmB,QAAQkS,CAAG,GAAG,EAAM,EAE3H9B,EAAK,aAAe,SAAS/N,EAAMqO,EAAG3J,EAAGE,EAAK0F,EAAGwE,EACjD,CACC,IAAIS,EAAMxB,EAAK,IAAI,UAAWyB,EAAMzB,EAAK,IAAI,YACzC1R,EAAOuI,EAAI,KAEf2K,EAAIvP,EAAMqO,EAAG/D,GAAG,EAAI,SAAa,QAAU,EAAI+D,GAAG,EAC/C/D,GAAG,IAAG+D,GAAG,GACZmB,EAAIxP,EAAMqO,EAAG,EAAE,EAAIA,GAAG,EACtBmB,EAAIxP,EAAMqO,EAAI,CAAC,EAAIA,GAAG,EACtBmB,EAAIxP,EAAMqO,EAAIzJ,EAAI,IAAI,EAAE,CAAC,EAAIyJ,GAAG,EAEhCkB,EAAIvP,EAAMqO,EAAI,CAAC,EAAIA,GAAG,EACtBkB,EAAIvP,EAAMqO,EAAGzJ,EAAI,GAAG,EAAIyJ,GAAG,EAC3BkB,EAAIvP,EAAMqO,EAAGhS,EAAK,MAAM,EAAIgS,GAAG,EAC/BkB,EAAIvP,EAAMqO,EAAGzJ,EAAI,KAAK,EAAIyJ,GAAG,EAE7BmB,EAAIxP,EAAMqO,EAAGN,EAAK,IAAI,SAASrJ,CAAC,CAAC,EAAI2J,GAAG,EACxCmB,EAAIxP,EAAMqO,EAAG,CAAC,EAAIA,GAAG,EAElB/D,GAAG,IACL+D,GAAK,EACLA,GAAK,EACLA,GAAK,EACLkB,EAAIvP,EAAMqO,EAAGS,CAAI,EAAIT,GAAG,GAEzB,IAAIW,EAAOjB,EAAK,IAAI,UAAU/N,EAAMqO,EAAG3J,CAAC,EAAI,OAAA2J,GAAIW,EAC7C1E,GAAG,IAAMtK,EAAK,IAAI3D,EAAMgS,CAAC,EAAIA,GAAKhS,EAAK,QACnCgS,CACP,EAMDN,EAAK,IAAM,CACV,MAAU,UAAW,CAElB,QADI+B,EAAM,IAAI,YAAY,GAAG,EACpBjG,EAAE,EAAGA,EAAE,IAAKA,IAAK,CAE3B,QADI9K,EAAI8K,EACC1K,EAAE,EAAGA,EAAE,EAAGA,IACdJ,EAAI,EAAIA,EAAI,WAAcA,IAAM,EACxBA,EAAIA,IAAM,EAEvB+Q,EAAIjG,CAAC,EAAI9K,CAAK,CACf,OAAO+Q,CAAI,EAAM,EAClB,OAAS,SAAS/Q,EAAGkP,EAAKkB,EAAKY,EAAK,CACnC,QAAS/I,EAAE,EAAGA,EAAE+I,EAAK/I,IAAMjI,EAAIgP,EAAK,IAAI,OAAOhP,EAAIkP,EAAIkB,EAAInI,CAAC,GAAK,GAAI,EAAKjI,IAAM,EAChF,OAAOA,CACP,EACD,IAAM,SAAS6K,EAAEyE,EAAEpH,EAAI,CAAG,OAAO8G,EAAK,IAAI,OAAO,WAAWnE,EAAEyE,EAAEpH,CAAC,EAAI,UAAc,CACnF,EACD8G,EAAK,MAAQ,SAAS/N,EAAKqO,EAAE0B,EAAK,CAGjC,QAFI,EAAI,EAAGnG,EAAI,EACXuF,EAAMd,EAAG/B,EAAI+B,EAAE0B,EACbZ,EAAI7C,GAAK,CAEd,QADI0D,EAAO,KAAK,IAAIb,EAAI,KAAM7C,CAAG,EAC3B6C,EAAIa,GACT,GAAKhQ,EAAKmP,GAAK,EACfvF,GAAK,EAEN,EAAE,EAAE,MACJA,EAAEA,EAAE,KACJ,CACE,OAAQA,GAAK,GAAM,CACtB,EAEDmE,EAAK,IAAM,CACV,WAAa,SAASkC,EAAKvL,EAAI,CAAG,OAAQuL,EAAKvL,CAAC,EAAMuL,EAAKvL,EAAE,CAAC,GAAG,CAAM,EACvE,YAAa,SAASuL,EAAKvL,EAAEmF,EAAE,CAAGoG,EAAKvL,CAAC,EAAKmF,EAAG,IAAMoG,EAAKvL,EAAE,CAAC,EAAKmF,GAAG,EAAG,GAAO,EAChF,SAAa,SAASoG,EAAKvL,EAAI,CAAG,OAAQuL,EAAKvL,EAAE,CAAC,EAAG,UAAkBuL,EAAKvL,EAAE,CAAC,GAAG,GAAOuL,EAAKvL,EAAE,CAAC,GAAI,EAAKuL,EAAKvL,CAAC,EAAM,EACtH,UAAa,SAASuL,EAAKvL,EAAEmF,EAAE,CAAGoG,EAAKvL,CAAC,EAAEmF,EAAE,IAAMoG,EAAKvL,EAAE,CAAC,EAAGmF,GAAG,EAAG,IAAMoG,EAAKvL,EAAE,CAAC,EAAGmF,GAAG,GAAI,IAAMoG,EAAKvL,EAAE,CAAC,EAAGmF,GAAG,GAAI,GAAO,EAC1H,UAAa,SAASoG,EAAKvL,EAAEuC,EAAE,CAAgB,QAATG,EAAI,GAAaJ,EAAE,EAAGA,EAAEC,EAAGD,IAAKI,GAAK,OAAO,aAAa6I,EAAKvL,EAAEsC,CAAC,CAAC,EAAI,OAAOI,CAAO,EAC1H,WAAa,SAASpH,EAAK0E,EAAE0C,EAAE,CAAG,QAAQJ,EAAE,EAAGA,EAAEI,EAAE,OAAQJ,IAAKhH,EAAK0E,EAAEsC,CAAC,EAAII,EAAE,WAAWJ,CAAC,CAAK,EAC/F,IAAM,SAAS6C,EAAG,CAAE,OAAOA,EAAE,OAAS,EAAI,IAAMA,EAAIA,CAAI,EACxD,SAAW,SAASoG,EAAMvL,EAAGuC,EAAG,CAE/B,QADIG,EAAI,GAAI8I,EACJlJ,EAAE,EAAGA,EAAEC,EAAGD,IAAKI,GAAK,IAAM2G,EAAK,IAAI,IAAIkC,EAAKvL,EAAEsC,CAAC,EAAE,SAAS,EAAE,CAAC,EACrE,GAAI,CAAGkJ,EAAK,mBAAmB9I,CAAC,CAAI,MAC3B,CAAG,OAAO2G,EAAK,IAAI,UAAUkC,EAAMvL,EAAGuC,CAAC,CAAK,CACrD,OAAQiJ,CACR,EACD,UAAY,SAASD,EAAMvL,EAAGX,EAAK,CAElC,QADIoM,EAAOpM,EAAI,OAAQiD,EAAE,EACjBoJ,EAAG,EAAGA,EAAGD,EAAMC,IACvB,CACC,IAAI5Q,EAAOuE,EAAI,WAAWqM,CAAE,EAC5B,GAAS,EAAA5Q,EAAM,YAA8ByQ,EAAKvL,EAAEsC,CAAC,EAAUxH,EAAawH,YACnE,EAAAxH,EAAM,YAA8ByQ,EAAKvL,EAAEsC,CAAC,EAAK,IAAKxH,GAAO,EAAMyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAO,EAAG,GAAOwH,GAAG,UAC5G,EAAAxH,EAAM,YAA8ByQ,EAAKvL,EAAEsC,CAAC,EAAK,IAAKxH,GAAM,GAAOyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAO,EAAG,GAAOyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAOwH,GAAG,UACjJ,EAAAxH,EAAM,YAA8ByQ,EAAKvL,EAAEsC,CAAC,EAAK,IAAKxH,GAAM,GAAOyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,GAAI,GAAOyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAOyQ,EAAKvL,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAMwH,GAAG,MACzL,MAAM,GACX,CACD,OAAOA,CACP,EACD,SAAW,SAASjD,EAAK,CAExB,QADIoM,EAAOpM,EAAI,OAAQiD,EAAE,EACjBoJ,EAAG,EAAGA,EAAGD,EAAMC,IACvB,CACC,IAAI5Q,EAAOuE,EAAI,WAAWqM,CAAE,EAC5B,GAAS,EAAA5Q,EAAM,YAA8BwH,YACpC,EAAAxH,EAAM,YAA8BwH,GAAG,UACvC,EAAAxH,EAAM,YAA8BwH,GAAG,UACvC,EAAAxH,EAAM,YAA8BwH,GAAG,MAC3C,MAAM,GACX,CACD,OAAOA,CACP,CACD,EAMD+G,EAAK,EAAI,GAETA,EAAK,EAAE,WAAa,SAAS/N,EAAMsO,EAAK+B,EAAMC,EAAK,CAClD,IAAIpB,EAAO,CAOH,CAAE,EAAK,EAAK,EAAM,EAAE,CAAC,EACrB,CAAE,EAAK,EAAK,EAAM,EAAE,CAAC,EACrB,CAAE,EAAK,EAAI,GAAO,EAAE,CAAC,EACrB,CAAE,EAAK,EAAI,GAAM,GAAG,CAAC,EAErB,CAAE,EAAI,GAAK,GAAM,GAAG,CAAC,EACrB,CAAE,EAAI,GAAK,GAAM,GAAG,CAAC,EACrB,CAAE,EAAI,GAAI,IAAM,IAAI,CAAC,EACrB,CAAE,EAAI,GAAI,IAAM,IAAI,CAAC,EACrB,CAAC,GAAI,IAAK,IAAK,KAAK,CAAC,EACrB,CAAC,GAAI,IAAK,IAAK,KAAK,CAAC,CAAC,EAE1BqB,EAAMrB,EAAKoB,CAAG,EAGdE,EAAIzC,EAAK,EAAE,EAAG0C,EAAY1C,EAAK,EAAE,WAAmBA,EAAK,EAAE,MAAO,IAAA2C,EAAQ3C,EAAK,EAAE,OACjF/G,EAAI,EAAG2J,EAAMN,GAAM,EAAGO,EAAO,EAAGC,EAAO7Q,EAAK,OAEhD,GAAGsQ,GAAK,EAAG,CACV,KAAMtJ,EAAE6J,GAAM,CAAI,IAAId,EAAM,KAAK,IAAI,MAAQc,EAAK7J,CAAC,EAClD0J,EAAMpC,EAAKqC,EAAM3J,EAAE+I,GAAKc,EAAO,EAAI,CAAC,EAAKF,EAAM5C,EAAK,EAAE,WAAW/N,EAAMgH,EAAG+I,EAAKzB,EAAKqC,EAAI,CAAC,EAAI3J,GAAK+I,CAAO,CAC1G,OAAOY,IAAM,CACb,CAED,IAAIG,EAAON,EAAE,KAAMO,EAAKP,EAAE,KAAMQ,EAAKR,EAAE,KAAMS,EAAG,EAAGC,EAAG,EAAGC,EAAG,EAAGC,EAAM,EAAGrS,EAAE,EAAGsS,EAAG,EAIhF,IAHGR,EAAK,IAAMQ,EAAGtD,EAAK,EAAE,MAAM/N,EAAK,CAAC,EAAI+Q,EAAKM,CAAE,EAAE,GAG7CrK,EAAE,EAAGA,EAAE6J,EAAM7J,IAAM,CAGtB,GAFAjI,EAAIsS,EAEDrK,EAAE,EAAE6J,EAAK,EAAG,CACdQ,EAAKtD,EAAK,EAAE,MAAM/N,EAAMgH,EAAE,CAAC,EAC3B,IAAIsK,EAAOtK,EAAE,EAAG,MAChBgK,EAAKM,CAAE,EAAEP,EAAKM,CAAE,EAChBN,EAAKM,CAAE,EAAEC,CACT,CACD,GAAGV,GAAM5J,EAAG,EACPiK,EAAG,MAASC,EAAG,QAAWL,EAAK7J,EAAG,MAClC4J,EAAK5J,IAAM8J,EAAKG,CAAE,EAAEjK,EAAE4J,EAAOK,GAAI,EAAIL,EAAK5J,GAC7C2J,EAAM5C,EAAK,EAAE,YAAc/G,GAAG6J,EAAK,GAAOD,GAAMC,EAAO,EAAE,EAAGC,EAAMG,EAAIG,EAAOpR,EAAKmR,EAAGnK,EAAEmK,EAAI7C,EAAKqC,CAAG,EAAIM,EAAGC,EAAGE,EAAM,EAAID,EAAGnK,GAG3H,IAAIuK,EAAM,EAEPvK,EAAE6J,EAAK,IAAGU,EAAMxD,EAAK,EAAE,WAAW/N,EAAMgH,EAAGgK,EAAMjS,EAAG,KAAK,IAAIwR,EAAI,CAAC,EAAEM,EAAK7J,CAAC,EAAGuJ,EAAI,CAAC,CAAC,GAOtF,IAAIR,EAAMwB,IAAM,GAAIC,EAAMD,EAAI,MAC9B,GAAGA,GAAK,EAAG,CACV,IAAIxB,EAAMwB,IAAM,GAAIC,EAAMD,EAAI,MAC1BE,EAAMhB,EAAUV,EAAKS,EAAE,GAAG,EAAIA,EAAE,KAAK,IAAIiB,CAAG,IAChD,IAAIC,EAAMjB,EAAUe,EAAKhB,EAAE,GAAG,EAAIA,EAAE,KAASkB,CAAG,IAAMN,GAASZ,EAAE,IAAIiB,CAAG,EAAIjB,EAAE,IAAIkB,CAAG,EACrFZ,EAAKG,CAAE,EAAKlB,GAAK,GAAK/I,EAAE4J,EAAQE,EAAKG,EAAG,CAAC,EAAKO,GAAK,GAAKC,GAAK,EAAGC,EAAMT,GAAI,EAC1EL,EAAO5J,EAAI+I,CACX,MACMS,EAAE,KAAKxQ,EAAKgH,CAAC,CAAC,IACrBkK,GACA,CACD,CAKD,KAJGC,GAAInK,GAAKhH,EAAK,QAAQ,KACrB4Q,EAAK5J,IAAM8J,EAAKG,CAAE,EAAEjK,EAAE4J,EAAOK,GAAI,EAAIL,EAAK5J,GAC7C2J,EAAM5C,EAAK,EAAE,YAAY,EAAG+C,EAAMG,EAAIG,EAAOpR,EAAKmR,EAAGnK,EAAEmK,EAAI7C,EAAKqC,CAAG,EAAIM,EAAG,EAAIC,EAAG,EAAID,EAAGC,EAAGE,EAAM,EAAID,EAAGnK,GAElG2J,EAAI,GAAOA,IAClB,OAAOA,IAAM,CACb,EACD5C,EAAK,EAAE,WAAa,SAAS/N,EAAM,EAAGgR,EAAMjS,EAAG4S,EAAMC,EAAO,CAC3D,IAAIxB,EAAM,EAAE,MAASyB,EAAGb,EAAKZ,CAAE,EAE3B0B,EAAQ1B,EAAGyB,EAAM,MAAU,MAAU,GAAGA,GAAIzB,GAAMrR,GAAGgP,EAAK,EAAE,MAAM/N,EAAK,EAAE8R,CAAG,EAAG,MAAO,GAG1F,QAFIC,EAAG,EAAGC,EAAG,EACTC,EAAO,KAAK,IAAI,MAAQ,CAAC,EACvBH,GAAKG,GAAQ,EAAEL,GAAO,GAAKC,GAAIzB,GAAuC,CAC3E,GAAG2B,GAAI,GAAM/R,EAAK,EAAE+R,CAAE,GAAG/R,EAAK,EAAE+R,EAAGD,CAAG,EAAI,CACzC,IAAIjD,EAAKd,EAAK,EAAE,SAAS/N,EAAM,EAAG8R,CAAG,EACrC,GAAGjD,EAAGkD,EAAI,CACQ,GAAjBA,EAAGlD,EAAKmD,EAAGF,EAASC,GAAIJ,EAAM,MAC3BG,EAAI,EAAEjD,IAAIA,EAAKiD,EAAI,GAEtB,QADII,EAAO,EACHC,EAAE,EAAGA,EAAEtD,EAAG,EAAGsD,IAAK,CACzB,IAAIC,EAAO,EAAEN,EAAIK,EAAI,MAAU,MAC3BlB,EAAKD,EAAKoB,CAAE,EACZC,EAAQD,EAAGnB,EAAM,MAAU,MAC5BoB,EAAKH,IAASA,EAAKG,EAAOR,EAAKO,EAClC,CACD,CACD,CAEDhC,EAAGyB,EAAKA,EAAKb,EAAKZ,CAAE,EACpB0B,GAAS1B,EAAGyB,EAAM,MAAU,KAC5B,CACD,OAAQE,GAAI,GAAIC,CAChB,EACDjE,EAAK,EAAE,SAAW,SAAS/N,EAAM,EAAG8R,EAAK,CACxC,GAAG9R,EAAK,CAAC,GAAGA,EAAK,EAAE8R,CAAG,GAAK9R,EAAK,EAAE,CAAC,GAAGA,EAAK,EAAE,EAAE8R,CAAG,GAAK9R,EAAK,EAAE,CAAC,GAAGA,EAAK,EAAE,EAAE8R,CAAG,EAAG,MAAO,GACxF,IAAIQ,EAAG,EAAGrL,EAAI,KAAK,IAAIjH,EAAK,OAAQ,EAAE,GAAG,EAEzC,IAF6C,GAAG,EAE1C,EAAEiH,GAAKjH,EAAK,CAAC,GAAGA,EAAK,EAAE8R,CAAG,GAAG,IACnC,OAAO,EAAEQ,CACT,EACDvE,EAAK,EAAE,MAAQ,SAAS/N,EAAM,EAAG,CAChC,OAAUA,EAAK,CAAC,GAAG,EAAKA,EAAK,EAAE,CAAC,IAAIA,EAAK,EAAE,CAAC,GAAG,GAAI,KAQnD,EAED+N,EAAK,MAAQ,EACbA,EAAK,EAAE,YAAc,SAASwE,EAAQzB,EAAMG,EAAIG,EAAOpR,EAAKwS,EAAGC,EAAInE,EAAKqC,EAAK,CAC5E,IAAIH,EAAIzC,EAAK,EAAE,EAAG2E,EAAQ3E,EAAK,EAAE,OAAQ2C,EAAQ3C,EAAK,EAAE,OAGpD4E,EAAGC,EAAIC,EAAIC,EAAIC,EAAMC,EAAMC,EAAMC,EAAMC,EAAO3C,EAAE,KAAK,GAAG,IAC5DmC,EAAI5E,EAAK,EAAE,SAAU,EAAE6E,EAAGD,EAAE,CAAC,EAAGE,EAAGF,EAAE,CAAC,EAAGG,EAAGH,EAAE,CAAC,EAAGI,EAAKJ,EAAE,CAAC,EAAGK,EAAKL,EAAE,CAAC,EAAGM,EAAKN,EAAE,CAAC,EAAGO,EAAKP,EAAE,CAAC,EAAGQ,EAAKR,EAAE,CAAC,EAEtG,IAAIS,GAAazC,EAAI,EAAG,EAAY,GAAIA,EAAI,EAAG,GAAf,GAAqB,IAAM8B,GAAI,GAC3DY,EAAUjC,EAAQrD,EAAK,EAAE,SAASyC,EAAE,OAAQA,EAAE,IAAI,EAAIzC,EAAK,EAAE,SAASyC,EAAE,OAAQA,EAAE,IAAI,EACtF8C,EAAUlC,EAAQrD,EAAK,EAAE,SAASyC,EAAE,MAAQA,EAAE,IAAI,EAAIzC,EAAK,EAAE,SAASyC,EAAE,MAAQA,EAAE,IAAI,EAC1F8C,GAAc,GAAK,EAAEL,EAAOlF,EAAK,EAAE,SAASyC,EAAE,MAAOA,EAAE,IAAI,GAAKA,EAAE,KAAK,EAAE,EAAE,EAAIA,EAAE,KAAK,EAAE,EAAE,EAAIA,EAAE,KAAK,EAAE,EAAE,GAEzG,QAAQ2B,EAAE,EAAGA,EAAE,IAAKA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAAK,QAAQA,EAAE,EAAGA,EAAE,GAAIA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAAK,QAAQA,EAAE,EAAGA,EAAE,GAAIA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAEjH,IAAIoB,EAASH,EAAQC,GAAWD,EAAQE,EAAW,EAAMD,EAAQC,EAAU,EAAI,EAI/E,GAHAZ,EAAMpE,EAAKqC,EAAK4B,CAAM,EAAIG,EAAMpE,EAAKqC,EAAI,EAAG4C,CAAK,EAAI5C,GAAK,EAGvD4C,GAAO,EAAG,CACZ,KAAO5C,EAAI,GAAOA,IAClBA,EAAM5C,EAAK,EAAE,WAAW/N,EAAMwS,EAAIC,EAAInE,EAAKqC,CAAG,CAC9C,KACI,CACJ,IAAI6C,EAAOC,EAEX,GADGF,GAAO,IAAMC,EAAMhD,EAAE,OAASiD,EAAMjD,EAAE,QACtC+C,GAAO,EAAG,CACZxF,EAAK,EAAE,UAAUyC,EAAE,MAAOoC,CAAE,EAAI7E,EAAK,EAAE,SAASyC,EAAE,MAAOoC,CAAE,EAC3D7E,EAAK,EAAE,UAAUyC,EAAE,MAAOqC,CAAE,EAAI9E,EAAK,EAAE,SAASyC,EAAE,MAAOqC,CAAE,EAC3D9E,EAAK,EAAE,UAAUyC,EAAE,MAAOsC,CAAE,EAAI/E,EAAK,EAAE,SAASyC,EAAE,MAAOsC,CAAE,EAE3DU,EAAQhD,EAAE,MAAQiD,EAAQjD,EAAE,MAE5BE,EAAMpC,EAAKqC,EAAIoC,EAAK,GAAG,EAAIpC,GAAK,EAChCD,EAAMpC,EAAKqC,EAAIqC,EAAO,CAAC,EAAIrC,GAAK,EAChCD,EAAMpC,EAAKqC,EAAIsC,EAAO,CAAC,EAAItC,GAAK,EAEhC,QAAQ3J,EAAE,EAAGA,EAAEiM,EAAMjM,IAAK0J,EAAMpC,EAAKqC,EAAI3J,EAAE,EAAGwJ,EAAE,OAAOA,EAAE,KAAKxJ,CAAC,GAAG,GAAG,CAAC,CAAC,EAAK2J,GAAK,EAAGsC,EACpFtC,EAAM5C,EAAK,EAAE,UAAUmF,EAAM1C,EAAE,MAAOlC,EAAKqC,CAAG,EAC9CA,EAAM5C,EAAK,EAAE,UAAUoF,EAAM3C,EAAE,MAAOlC,EAAKqC,CAAG,CAC9C,CAGD,QADIxB,EAAIqD,EACAkB,GAAG,EAAGA,GAAGzC,EAAIyC,IAAI,EAAG,CAE3B,QADIC,EAAG7C,EAAK4C,EAAE,EAAG3D,GAAK4D,IAAK,GAAKrH,GAAM6C,GAAKwE,GAAK,GAAG,IAAI,GACjDxE,EAAI7C,IAAKqE,EAAM5C,EAAK,EAAE,UAAU/N,EAAKmP,GAAK,EAAGqE,EAAOlF,EAAKqC,CAAG,EAElE,GAAGZ,IAAK,EAAG,CACV,IAAI6D,GAAK9C,EAAK4C,GAAG,CAAC,EAAGlC,GAAKoC,IAAI,GAAKnC,GAAKmC,IAAI,EAAG,IAAKlC,GAAKkC,GAAG,IAC5DjD,EAAM5C,EAAK,EAAE,UAAU,IAAI0D,GAAK+B,EAAOlF,EAAKqC,CAAG,EAC/CD,EAAMpC,EAAKqC,EAAKZ,GAAIS,EAAE,IAAIiB,EAAG,CAAC,EAAId,GAAKH,EAAE,IAAIiB,EAAG,EAEhDd,EAAM5C,EAAK,EAAE,UAAU2D,GAAK+B,EAAOnF,EAAKqC,CAAG,EAC3C+B,EAAMpE,EAAKqC,EAAKa,GAAIhB,EAAE,IAAIkB,EAAG,CAAC,EAAIf,GAAKH,EAAE,IAAIkB,EAAG,EAAIvC,GAAKY,EACzD,CACD,CACDY,EAAM5C,EAAK,EAAE,UAAU,IAAKyF,EAAOlF,EAAKqC,CAAG,CAC3C,CAED,OAAOA,CACP,EACD5C,EAAK,EAAE,WAAa,SAAS/N,EAAKmP,EAAIY,EAAIzB,EAAIqC,EAAK,CAClD,IAAIkD,EAAMlD,IAAM,EAChB,OAAArC,EAAIuF,CAAE,EAAG9D,EAAOzB,EAAIuF,EAAG,CAAC,EAAG9D,IAAM,EAAKzB,EAAIuF,EAAG,CAAC,EAAE,IAAIvF,EAAIuF,CAAE,EAAIvF,EAAIuF,EAAG,CAAC,EAAE,IAAIvF,EAAIuF,EAAG,CAAC,EAAIA,GAAI,EAC5FvF,EAAI,IAAI,IAAI,WAAWtO,EAAK,OAAQmP,EAAKY,CAAG,EAAG8D,CAAE,EAE1ClD,GAAQZ,EAAI,GAAI,EACvB,EAMDhC,EAAK,EAAE,SAAW,UAAW,CAM5B,QALIyC,EAAIzC,EAAK,EAAE,EACX6E,EAAK7E,EAAK,EAAE,SAASyC,EAAE,KAAMA,EAAE,MAAO,EAAE,EACxCqC,EAAK9E,EAAK,EAAE,SAASyC,EAAE,KAAMA,EAAE,MAAO,EAAE,EACxC0C,EAAO,GAAIH,EAAOhF,EAAK,EAAE,UAAUyC,EAAE,MAAO0C,CAAI,EAChDC,EAAO,GAAIH,EAAOjF,EAAK,EAAE,UAAUyC,EAAE,MAAO2C,CAAI,EAC5CnM,EAAE,EAAGA,EAAEkM,EAAK,OAAQlM,GAAG,EAAGwJ,EAAE,KAAK0C,EAAKlM,CAAC,CAAC,IAChD,QAAQA,EAAE,EAAGA,EAAEmM,EAAK,OAAQnM,GAAG,EAAGwJ,EAAE,KAAK2C,EAAKnM,CAAC,CAAC,IAEhC,QADZ8L,EAAK/E,EAAK,EAAE,SAASyC,EAAE,KAAMA,EAAE,MAAQ,CAAC,EACxCyC,EAAO,GAAWA,EAAK,GAAKzC,EAAE,OAAOA,EAAE,KAAKyC,EAAK,CAAC,GAAG,GAAG,CAAC,GAAG,GAAGA,IACnE,MAAO,CAACL,EAAIC,EAAIC,EAAIC,EAAMC,EAAMC,EAAMC,EAAMC,CAAI,CAChD,EACDpF,EAAK,EAAE,UAAW,SAAS5D,EAAG,CAAc,QAAPP,EAAE,CAAA,EAAa5C,EAAE,EAAGA,EAAEmD,EAAE,OAAQnD,GAAG,EAAG4C,EAAE,KAAOO,EAAEnD,EAAE,CAAC,CAAC,EAAI,OAAO4C,CAAK,EAC1GmE,EAAK,EAAE,QAAW,SAAS5D,EAAG,CAAe,QAARP,EAAG,GAAa5C,EAAE,EAAGA,EAAEmD,EAAE,OAAQnD,GAAG,EAAMmD,EAAEnD,EAAE,CAAC,GAAG,IAAE4C,IAAI5C,GAAG,GAAG,KAAM,OAAO4C,CAAK,EACrHmE,EAAK,EAAE,SAAW,SAAS+F,EAAMC,EAAK,CAAa,QAAN3M,EAAE,EAAYJ,EAAE,EAAGA,EAAE+M,EAAI,OAAQ/M,IAAKI,GAAI2M,EAAI/M,CAAC,EAAE8M,GAAM9M,GAAG,GAAG,CAAC,EAAI,OAAOI,CAAK,EAC3H2G,EAAK,EAAE,UAAY,SAASiG,EAAKF,EAAMxF,EAAKqC,EAAK,CAChD,QAAQ3J,EAAE,EAAGA,EAAEgN,EAAI,OAAQhN,GAAG,EAAG,CAChC,IAAIC,EAAI+M,EAAIhN,CAAC,EAAGiN,EAAMD,EAAIhN,EAAE,CAAC,EAC7B2J,EAAM5C,EAAK,EAAE,UAAU9G,EAAG6M,EAAMxF,EAAKqC,CAAG,EACxC,IAAIuD,EAAMjN,GAAG,GAAK,EAAKA,GAAG,GAAK,EAAI,EAChCA,EAAE,KAAO8G,EAAK,EAAE,OAAOO,EAAKqC,EAAKsD,EAAKC,CAAG,EAAIvD,GAAKuD,EACrD,CACD,OAAOvD,CACP,EACD5C,EAAK,EAAE,UAAY,SAAS+F,EAAME,EAAK,CAChB,QAAlBjE,EAAI+D,EAAK,OAAe/D,GAAK,GAAK+D,EAAK/D,EAAI,CAAC,GAAG,GAAGA,GAAK,EAC3D,QAAQ/I,EAAE,EAAGA,EAAE+I,EAAK/I,GAAG,EAAG,CACzB,IAAIC,EAAI6M,EAAK9M,EAAE,CAAC,EAAGmN,EAAOnN,EAAE,EAAE+I,EAAM+D,EAAK9M,EAAE,CAAC,EAAE,GAAMoN,EAAQpN,EAAE,EAAE+I,EAAM+D,EAAK9M,EAAE,CAAC,EAAE,GAAMqN,EAAOrN,GAAG,EAAI,GAAK8M,EAAK9M,EAAE,CAAC,EACjH,GAAGC,GAAG,GAAKkN,GAAKlN,GAAKmN,GAAMnN,EAAG,CAE7B,QADIqN,EAAKtN,EAAE,EACLsN,EAAG,EAAEvE,GAAO+D,EAAKQ,EAAG,CAAC,GAAGrN,GAAGqN,GAAI,EACrC,IAAIC,EAAK,KAAK,IAAKD,EAAG,EAAEtN,IAAK,EAAG,GAAG,EAChCuN,EAAG,GAAIP,EAAI,KAAK,GAAIO,EAAG,CAAC,EACtBP,EAAI,KAAK,GAAIO,EAAG,EAAE,EACvBvN,GAAKuN,EAAG,EAAE,CACV,SACOtN,GAAGoN,GAAOF,GAAKlN,GAAKmN,GAAMnN,EAAG,CAEpC,QADIqN,EAAKtN,EAAE,EACLsN,EAAG,EAAEvE,GAAO+D,EAAKQ,EAAG,CAAC,GAAGrN,GAAGqN,GAAI,EACrC,IAAIC,EAAK,KAAK,IAAKD,EAAG,EAAEtN,IAAK,EAAG,CAAC,EACjCgN,EAAI,KAAK,GAAIO,EAAG,CAAC,EACjBvN,GAAKuN,EAAG,EAAE,CACV,MACIP,EAAI,KAAK/M,EAAG,CAAC,CAClB,CACD,OAAO8I,IAAM,CACb,EACDhC,EAAK,EAAE,SAAa,SAASgG,EAAKD,EAAMU,EAAM,CAC7C,IAAIC,EAAK,CAAA,EAAIC,EAAKX,EAAI,OAAQhC,EAAG+B,EAAK,OAAQ9M,EAAE,EAChD,IAAIA,EAAE,EAAGA,EAAE+K,EAAI/K,GAAG,EAAM8M,EAAK9M,CAAC,EAAE,EAAI8M,EAAK9M,EAAE,CAAC,EAAE,EAC9C,IAAIA,EAAE,EAAGA,EAAE0N,EAAI1N,IAAQ+M,EAAI/M,CAAC,GAAG,GAAGyN,EAAK,KAAK,CAAC,IAAIzN,EAAG,EAAE+M,EAAI/M,CAAC,CAAC,CAAC,EAC7D,IAAIsF,EAAMmI,EAAK,OAAQE,EAAGF,EAAK,MAAM,CAAC,EACtC,GAAGnI,GAAK,EAAG,MAAO,GAClB,GAAGA,GAAK,EAAG,CAAG,IAAIsI,EAAIH,EAAK,CAAC,EAAE,IAAKE,EAAGC,GAAK,EAAE,EAAE,EAAI,OAAAd,GAAMc,GAAK,GAAG,CAAC,EAAE,EAAId,GAAMa,GAAI,GAAG,CAAC,EAAE,EAAW,CAAK,CACxGF,EAAK,KAAK,SAAStK,EAAEP,EAAE,CAAC,OAAOO,EAAE,EAAEP,EAAE,CAAE,CAAC,EACxC,IAAIO,EAAEsK,EAAK,CAAC,EAAG7K,EAAE6K,EAAK,CAAC,EAAGI,EAAG,EAAGC,EAAG,EAAGC,EAAG,EACzC,IAD6CN,EAAK,CAAC,EAAE,CAAC,IAAI,GAAG,EAAEtK,EAAE,EAAEP,EAAE,EAAE,EAAEO,EAAE,EAAEP,EAAE,EAAE,CAAC,EAC5EkL,GAAIxI,EAAI,GACVuI,GAAIC,IAAOC,GAAIzI,GAAOmI,EAAKI,CAAE,EAAE,EAAEJ,EAAKM,CAAE,EAAE,GAAO5K,EAAEsK,EAAKI,GAAI,EAAe1K,EAAEsK,EAAKM,GAAI,EACtFF,GAAIC,IAAOC,GAAIzI,GAAOmI,EAAKI,CAAE,EAAE,EAAEJ,EAAKM,CAAE,EAAE,GAAOnL,EAAE6K,EAAKI,GAAI,EAAejL,EAAE6K,EAAKM,GAAI,EACzFN,EAAKK,GAAI,EAAE,CAAC,IAAI,GAAG,EAAE3K,EAAE,EAAEP,EAAE,EAAG,EAAEO,EAAE,EAAEP,CAAC,EAEtC,IAAIoL,EAAOjH,EAAK,EAAE,SAAS0G,EAAKK,EAAG,CAAC,EAAG,CAAC,EAExC,IADGE,EAAKR,IAASzG,EAAK,EAAE,cAAc4G,EAAIH,EAAMQ,CAAI,EAAIA,EAAOR,GAC3DxN,EAAE,EAAGA,EAAEsF,EAAKtF,IAAK8M,GAAMa,EAAG3N,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE2N,EAAG3N,CAAC,EAAE,EAClD,OAAOgO,CACP,EAEDjH,EAAK,EAAE,SAAY,SAAS,EAAGrP,EAAG,CACjC,OAAG,EAAE,KAAK,IAAO,EAAE,EAAEA,EAAWA,GACzB,KAAK,IAAKqP,EAAK,EAAE,SAAS,EAAE,EAAGrP,EAAE,CAAC,EAAIqP,EAAK,EAAE,SAAS,EAAE,EAAGrP,EAAE,CAAC,EACrE,EAEDqP,EAAK,EAAE,cAAgB,SAASkH,EAAKpC,EAAImC,EAAM,CAC9C,IAAIhO,EAAE,EAAGkO,EAAM,GAAIF,EAAKnC,EAAKsC,EAAI,EAGjC,IAFAF,EAAI,KAAK,SAAS9K,EAAEP,EAAE,CAAC,OAAOA,EAAE,GAAGO,EAAE,EAAIA,EAAE,EAAEP,EAAE,EAAIA,EAAE,EAAEO,EAAE,CAAE,CAAC,EAExDnD,EAAE,EAAGA,EAAEiO,EAAI,QAAgBA,EAAIjO,CAAC,EAAE,EAAE6L,EAAjB7L,IAAqB,CAAG,IAAIoO,EAAGH,EAAIjO,CAAC,EAAE,EAAIiO,EAAIjO,CAAC,EAAE,EAAE6L,EAAKsC,GAAKD,GAAO,GAAIF,EAAKI,EAAQ,CAE5G,IADAD,EAAMA,IAAOH,EAAKnC,EACZsC,EAAI,GAAG,CAAG,IAAIC,EAAGH,EAAIjO,CAAC,EAAE,EAAOoO,EAAGvC,GAAOoC,EAAIjO,CAAC,EAAE,IAAMmO,GAAM,GAAItC,EAAGuC,EAAG,GAAepO,GAAO,CAClG,KAAMA,GAAG,EAAGA,IAAQiO,EAAIjO,CAAC,EAAE,GAAG6L,GAAMsC,EAAI,IAAMF,EAAIjO,CAAC,EAAE,IAAMmO,KAAcA,GAAK,GAAG,QAAQ,IAAI,WAAW,CACxG,EAEDpH,EAAK,EAAE,WAAa,SAAS3O,EAAG2H,EAAK,CACpC,IAAIC,EAAE,EAAI,OAAGD,EAAIC,EAAE,EAAE,GAAG5H,IAAG4H,GAAG,IAAQD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAWA,CACtI,EACD+G,EAAK,EAAE,UAAY,SAASsH,EAAI7B,EAAOlF,EAAKqC,EAAK,CAChD,OAAA5C,EAAK,EAAE,OAAOO,EAAKqC,EAAK6C,EAAM6B,GAAI,CAAC,CAAC,EAC7B1E,EAAI6C,GAAO6B,GAAI,GAAG,CAAC,CAC1B,EASDtH,EAAK,EAAE,QAAU,SAAS/N,EAAMiO,EAAK,CACpC,IAAIqH,EAAG,WACP,GAAGtV,EAAK,CAAC,GAAG,GAAKA,EAAK,CAAC,GAAG,EAAG,OAAQiO,GAAY,IAAIqH,EAAG,CAAC,EACzD,IAAIC,EAAExH,EAAK,EAAGyH,EAAQD,EAAE,OAAQE,EAAQF,EAAE,OAAQG,EAAaH,EAAE,YAAaI,EAAYJ,EAAE,UAAWK,EAAUL,EAAE,UAAWM,EAAQN,EAAE,OACpI/E,EAAI+E,EAAE,EAENO,EAAS7H,GAAK,KACf6H,IAAO7H,EAAM,IAAIqH,EAAItV,EAAK,SAAS,GAAI,CAAC,GAM3C,QAJIuS,EAAO,EAAGgB,EAAM,EAAGwC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGrD,EAAG,EAAGC,EAAG,EACtD1D,EAAM,EAAGwB,EAAM,EACfuF,EAAMC,EAEJ5D,GAAQ,GAAG,CAKhB,GAJAA,EAASiD,EAAMxV,EAAM2Q,EAAO,CAAC,EAC7B4C,EAASiC,EAAMxV,EAAM2Q,EAAI,EAAG,CAAC,EAAIA,GAAK,EAGnC4C,GAAO,EAAG,CACR5C,EAAI,IAAOA,GAAK,GAAGA,EAAI,IAC3B,IAAIkD,GAAMlD,IAAM,GAAG,EAAGZ,EAAM/P,EAAK6T,EAAG,CAAC,EAAG7T,EAAK6T,EAAG,CAAC,GAAG,EACjDiC,IAAO7H,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAIY,CAAG,GACxC9B,EAAI,IAAI,IAAIqH,EAAGtV,EAAK,OAAQA,EAAK,WAAW6T,EAAI9D,CAAG,EAAGZ,CAAG,EAGzDwB,EAAQkD,EAAG9D,GAAM,EAAKZ,GAAKY,EAAM,QACjC,CAGD,GAFG+F,IAAO7H,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAK,MAAM,GACzCoE,GAAO,IAAM2C,EAAO1F,EAAE,MAAQ2F,EAAO3F,EAAE,MAAQoC,EAAM,IAAUC,EAAM,IACrEU,GAAO,EAAG,CACZwC,EAAQN,EAAMzV,EAAM2Q,EAAQ,CAAC,EAAE,IAC/BqF,EAAQP,EAAMzV,EAAM2Q,EAAK,EAAG,CAAC,EAAI,EACjCsF,EAAQR,EAAMzV,EAAM2Q,EAAI,GAAI,CAAC,EAAI,EAAIA,GAAK,GAG1C,QAAQ3J,EAAE,EAAGA,EAAE,GAAIA,GAAG,EAAMwJ,EAAE,MAAMxJ,CAAC,EAAE,EAAIwJ,EAAE,MAAMxJ,EAAE,CAAC,EAAE,EAExD,QADI+K,EAAK,EACD/K,EAAE,EAAGA,EAAEiP,EAAOjP,IAAK,CAAG,IAAIC,EAAEwO,EAAMzV,EAAM2Q,EAAI3J,EAAE,EAAG,CAAC,EAAIwJ,EAAE,OAAOA,EAAE,KAAKxJ,CAAC,GAAG,GAAG,CAAC,EAAIC,EAAOA,EAAE8K,IAAGA,EAAG9K,EAAK,CAAK0J,GAAK,EAAEsF,EAC1HN,EAAUnF,EAAE,MAAOuB,CAAE,EACrB6D,EAAUpF,EAAE,MAAOuB,EAAIvB,EAAE,IAAI,EAE7B0F,EAAO1F,EAAE,KAAO2F,EAAO3F,EAAE,KAEzBG,EAAM+E,EAAWlF,EAAE,MAAO,GAAGuB,GAAI,EAAGgE,EAAKC,EAAOhW,EAAM2Q,EAAKH,EAAE,KAAK,EAClE,IAAI4F,EAAMb,EAAE,SAAS/E,EAAE,MAAU,EAAGuF,EAAOvF,EAAE,KAAK,EAAIoC,GAAM,GAAGwD,GAAK,EACpE,IAAIC,EAAMd,EAAE,SAAS/E,EAAE,MAAOuF,EAAMC,EAAOxF,EAAE,KAAK,EAAIqC,GAAM,GAAGwD,GAAK,EAGpEV,EAAUnF,EAAE,MAAO4F,CAAG,EACtBR,EAAUpF,EAAE,MAAO4F,EAAKF,CAAI,EAG5BP,EAAUnF,EAAE,MAAO6F,CAAG,EACtBT,EAAUpF,EAAE,MAAO6F,EAAKF,CAAI,CAC5B,CAED,OAAY,CACX,IAAI3W,GAAO0W,EAAKL,EAAM7V,EAAM2Q,CAAG,EAAIiC,CAAE,EAAIjC,GAAOnR,GAAK,GACrD,IAAIoV,EAAMpV,KAAO,EACjB,GAAI,EAAAoV,IAAM,GAAU3G,EAAIkB,GAAK,EAAIyF,MAC5B,IAAGA,GAAK,IAAQ,MAEpB,IAAItI,GAAM6C,EAAIyF,EAAI,IAClB,GAAGA,EAAI,IAAK,CAAE,IAAI0B,GAAM9F,EAAE,KAAKoE,EAAI,GAAG,EAAItI,GAAM6C,GAAOmH,KAAM,GAAKb,EAAMzV,EAAM2Q,EAAK2F,GAAI,CAAC,EAAI3F,GAAO2F,GAAI,CAAK,CAG5G,IAAIC,GAAQJ,EAAKN,EAAM7V,EAAM2Q,CAAG,EAAIkC,CAAE,EAAIlC,GAAO4F,GAAM,GACvD,IAAIC,GAAOD,KAAQ,EACfE,GAAMjG,EAAE,KAAKgG,EAAI,EAAGhF,IAAOiF,KAAM,GAAKjB,EAAMxV,EAAM2Q,EAAK8F,GAAI,EAAE,EAOjE,IAPqE9F,GAAO8F,GAAI,GAM7EX,IAAO7H,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAK,MAAM,GACtCA,EAAI7C,IAAQ2B,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMqC,EAAG,EAAMvD,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMqC,EAAG,EAAIvD,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMqC,EAAG,EAAIvD,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMqC,EAAG,EACxHrC,EAAI7C,GAGL,CAED,CAGD,OAAO2B,EAAI,QAAQkB,EAAMlB,EAAMA,EAAI,MAAM,EAAEkB,CAAG,CAC9C,EACDpB,EAAK,EAAE,OAAO,SAASE,EAAK8B,EAAK,CAChC,IAAI2G,EAAGzI,EAAI,OAAS,GAAG8B,GAAK2G,EAAI,OAAOzI,EACvC,IAAI0I,EAAO,IAAI,WAAW,KAAK,IAAID,GAAI,EAAE3G,CAAG,CAAC,EAAI,OAAA4G,EAAK,IAAI1I,EAAI,CAAC,EAExD0I,CACP,EAED5I,EAAK,EAAE,YAAc,SAASmI,EAAMU,EAAI7G,EAAK/P,EAAM2Q,EAAKmD,EAAM,CAG7D,QAFI2B,EAAQ1H,EAAK,EAAE,OAAQ8H,EAAQ9H,EAAK,EAAE,OACtC/G,EAAI,EACFA,EAAE+I,GAAK,CACZ,IAAIvQ,EAAO0W,EAAKL,EAAM7V,EAAM2Q,CAAG,EAAEiG,CAAE,EAAIjG,GAAKnR,EAAK,GACjD,IAAIoV,EAAMpV,IAAO,EACjB,GAAGoV,GAAK,GAAOd,EAAK9M,CAAC,EAAE4N,EAAM5N,QACxB,CACJ,IAAI6P,EAAK,EAAGhN,EAAI,EACb+K,GAAK,IACP/K,EAAK,EAAK4L,EAAMzV,EAAM2Q,EAAK,CAAC,EAAKA,GAAO,EAAIkG,EAAK/C,EAAK9M,EAAE,CAAC,GAElD4N,GAAK,IACZ/K,EAAK,EAAK4L,EAAMzV,EAAM2Q,EAAK,CAAC,EAAKA,GAAO,GAEjCiE,GAAK,KACZ/K,EAAK,GAAK4L,EAAMzV,EAAM2Q,EAAK,CAAC,EAAKA,GAAO,GAGzC,QADImG,EAAK9P,EAAE6C,EACL7C,EAAE8P,GAAOhD,EAAK9M,CAAC,EAAE6P,EAAK7P,GAC5B,CACD,CACD,OAAO2J,CACP,EACD5C,EAAK,EAAE,SAAW,SAAS5H,EAAKgJ,EAAKY,EAAK+D,EAAM,CAE/C,QADIiD,EAAG,EAAG/P,EAAE,EAAG+K,EAAG+B,EAAK,SAAS,EAC1B9M,EAAE+I,GAAK,CAAG,IAAI3Q,EAAE+G,EAAIa,EAAEmI,CAAG,EAAI2E,EAAM9M,GAAG,CAAG,EAAC,EAAI8M,GAAM9M,GAAG,GAAG,CAAC,EAAE5H,EAAOA,EAAE2X,IAAGA,EAAG3X,GAAI4H,GAAO,CAC7F,KAAMA,EAAE+K,GAAQ+B,EAAM9M,GAAG,CAAG,EAAC,EAAI8M,GAAM9M,GAAG,GAAG,CAAC,EAAE,EAAIA,IACpD,OAAO+P,CACP,EAEDhJ,EAAK,EAAE,UAAY,SAAS+F,EAAMkD,EAAU,CAKf,QAJxBxG,EAAIzC,EAAK,EAAE,EACXkJ,EAAWnD,EAAK,OAChBtU,EAAM0X,EAAMrN,EAAG7C,EAAG+I,EAElBoH,EAAW3G,EAAE,SAAmBxJ,EAAE,EAAGA,GAAGgQ,EAAUhQ,IAAKmQ,EAASnQ,CAAC,EAAE,EACvE,IAAIA,EAAE,EAAGA,EAAEiQ,EAAUjQ,GAAG,EAAGmQ,EAASrD,EAAK9M,CAAC,CAAC,IAE3C,IAAIoQ,EAAY5G,EAAE,UAIlB,IAFAhR,EAAO,EACP2X,EAAS,CAAC,EAAI,EACTD,EAAO,EAAGA,GAAQF,EAAUE,IAChC1X,EAAQA,EAAO2X,EAASD,EAAK,CAAC,GAAM,EACpCE,EAAUF,CAAI,EAAI1X,EAGnB,IAAKqK,EAAI,EAAGA,EAAIoN,EAAUpN,GAAG,EAC5BkG,EAAM+D,EAAKjK,EAAE,CAAC,EACVkG,GAAO,IACV+D,EAAKjK,CAAC,EAAIuN,EAAUrH,CAAG,EACvBqH,EAAUrH,CAAG,IAGf,EACDhC,EAAK,EAAE,UAAY,SAAS+F,EAAMkD,EAAUK,EAAK,CAGhD,QAFIJ,EAAWnD,EAAK,OAChBtD,EAAEzC,EAAK,EAAE,EAAGuJ,EAAM9G,EAAE,MAChBxJ,EAAE,EAAGA,EAAEiQ,EAAUjQ,GAAG,EAAG,GAAG8M,EAAK9M,EAAE,CAAC,GAAG,EAK5C,QAJI4N,EAAM5N,GAAG,EACT6H,EAAKiF,EAAK9M,EAAE,CAAC,EAAGuQ,EAAO3C,GAAK,EAAG/F,EAC/B2I,EAAQR,EAASnI,EAAKgG,EAAKf,EAAK9M,CAAC,GAAGwQ,EAAM1C,EAAKD,GAAM,GAAG2C,GAEtD3C,GAAIC,GAAI,CACb,IAAI9K,EAAKsN,EAAIzC,CAAE,IAAK,GAAGmC,EACvBK,EAAIrN,CAAE,EAAEuN,EAAM1C,GACd,CAEF,EACD9G,EAAK,EAAE,SAAW,SAAS+F,EAAMkD,EAAU,CAE1C,QADIM,EAAMvJ,EAAK,EAAE,EAAE,MAAO0J,EAAM,GAAGT,EAC3BhQ,EAAE,EAAGA,EAAE8M,EAAK,OAAQ9M,GAAG,EAAG,CAAG,IAAI6N,EAAMf,EAAK9M,CAAC,GAAIgQ,EAASlD,EAAK9M,EAAE,CAAC,EAAM8M,EAAK9M,CAAC,EAAIsQ,EAAIzC,CAAE,IAAI4C,CAAO,CAC3G,EAGD1J,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAK4G,EAAQ,CAAGA,EAAMA,IAAM5G,EAAI,GAAK,IAAItC,EAAGsC,IAAM,EAAK+G,EAAGrJ,CAAC,GAAGkJ,EAAMG,EAAGrJ,EAAE,CAAC,GAAIkJ,IAAM,CAA4B,EAC5IxJ,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAK4G,EAAQ,CAAGA,EAAMA,IAAM5G,EAAI,GAAK,IAAItC,EAAGsC,IAAM,EAAK+G,EAAGrJ,CAAC,GAAGkJ,EAAMG,EAAGrJ,EAAE,CAAC,GAAIkJ,IAAM,EAAKG,EAAGrJ,EAAE,CAAC,GAAIkJ,IAAM,EAAO,EAE5IxJ,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAKgH,EAAQ,CAAG,OAASD,EAAG/G,IAAM,CAAC,EAAK+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,MAA+BA,EAAI,IAAM,GAAGgH,GAAQ,CAAM,EAC/I5J,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAKgH,EAAQ,CAAG,OAASD,EAAG/G,IAAM,CAAC,EAAK+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,EAAM+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,OAAQA,EAAI,IAAM,GAAGgH,GAAQ,CAAM,EAK/I5J,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAK,CAChC,OAAQ+G,EAAG/G,IAAM,CAAC,EAAK+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,EAAM+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,OAASA,EAAI,EAC5E,EACD5C,EAAK,EAAE,OAAQ,SAAS2J,EAAI/G,EAAK,CAChC,OAAQ+G,EAAG/G,IAAM,CAAC,EAAK+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,EAAM+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,GAAO+G,GAAI/G,IAAM,GAAG,CAAC,GAAG,OAASA,EAAI,EACpG,EACD5C,EAAK,EAAE,EAAI,UAAU,CACpB,IAAI6J,EAAI,YAAaC,EAAI,YACzB,MAAO,CACN,UAAY,IAAID,EAAI,EAAE,EACtB,SAAY,IAAIA,EAAI,EAAE,EACtB,KAAO,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAI,EAC3E,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,EACzG,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,CAAC,EACzG,KAAO,IAAIA,EAAI,EAAE,EACjB,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,MAAO,MAAO,KAAK,EACrI,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAK,EAAK,EAAI,GAAK,GAAK,GAAK,GAAK,GAAM,GAAM,GAAM,GAAQ,EAAO,CAAC,EACrI,KAAO,IAAIC,EAAI,EAAE,EACjB,MAAO,IAAID,EAAM,GAAG,EAAI,OAAQ,CAAE,EAClC,MAAO,IAAIA,EAAO,EAAE,EAAI,OAAQ,CAAE,EAClC,KAAO,IAAIA,EAAI,KAAK,EAAI,MAAQ,CAAA,EAAK,MAAM,CAAE,EAC7C,KAAO,IAAIA,EAAI,KAAK,EAAI,MAAQ,CAAE,EAClC,KAAO,IAAIA,EAAM,GAAG,EAAI,MAAQ,CAAE,EAElC,MAAO,IAAIA,EAAI,KAAK,EACpB,KAAO,IAAIC,EAAI,GAAG,EAAG,KAAO,IAAIA,EAAK,EAAE,EAAG,KAAO,IAAIA,EAAI,EAAE,EAC3D,KAAO,IAAIA,EAAI,IAAK,EACpB,KAAO,IAAID,EAAI,KAAK,EACpB,KAAO,IAAIA,EAAI,KAAK,CACtB,CACA,IAEC,UAAU,CAGV,QAFIpH,EAAIzC,EAAK,EAAE,EACXgC,EAAM,MACF/I,EAAE,EAAGA,EAAE+I,EAAK/I,IAAK,CACxB,IAAI8Q,EAAI9Q,EACR8Q,GAAOA,EAAI,cAAgB,GAAOA,EAAI,aAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,YAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,YAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,WAAe,EACrDtH,EAAE,MAAMxJ,CAAC,GAAO8Q,IAAM,GAAOA,GAAK,MAAQ,EAC1C,CAED,SAASC,EAAMC,EAAKnO,EAAGoO,EAAI,CAAG,KAAMpO,KAAK,GAAGmO,EAAI,KAAK,EAAEC,CAAE,CAAK,CAE9D,QAAQjR,EAAE,EAAGA,EAAE,GAAIA,IAAQwJ,EAAE,KAAKxJ,CAAC,EAAGwJ,EAAE,IAAIxJ,CAAC,GAAG,EAAGwJ,EAAE,IAAIxJ,CAAC,EAAIwJ,EAAE,KAAKxJ,CAAC,EAAGwJ,EAAE,IAAIxJ,CAAC,GAAG,EAAGwJ,EAAE,IAAIxJ,CAAC,EAE7F+Q,EAAMvH,EAAE,OAAQ,IAAK,CAAC,EAAIuH,EAAMvH,EAAE,OAAQ,IAAS,CAAC,EAAIuH,EAAMvH,EAAE,OAAQ,GAAS,CAAC,EAAIuH,EAAMvH,EAAE,OAAO,EAAQ,CAAC,EAQ9GzC,EAAK,EAAE,UAAUyC,EAAE,OAAQ,CAAC,EAC5BzC,EAAK,EAAE,UAAUyC,EAAE,OAAQ,EAAGA,EAAE,KAAK,EACrCzC,EAAK,EAAE,SAAUyC,EAAE,OAAQ,CAAC,EAE5BuH,EAAMvH,EAAE,OAAO,GAAG,CAAC,EAEnBzC,EAAK,EAAE,UAAUyC,EAAE,OAAQ,CAAC,EAC5BzC,EAAK,EAAE,UAAUyC,EAAE,OAAQ,EAAGA,EAAE,KAAK,EACrCzC,EAAK,EAAE,SAAUyC,EAAE,OAAQ,CAAC,EAE5BuH,EAAMvH,EAAE,MAAM,GAAG,CAAC,EAAIuH,EAAMvH,EAAE,MAAM,IAAI,CAAC,EAAIuH,EAAMvH,EAAE,MAAM,GAAG,CAAC,EAAIuH,EAAMvH,EAAE,MAAM,IAAI,CAAC,GAOtF,0CC1yBD,wEA6BA,MAAM0H,GAA0B,EAI1BC,GAAwB,EACxBC,GAAwB,EAExBC,GAA0B,EAKhC,SAASC,GAAOrK,EAAK,CAAE,IAAI8B,EAAM9B,EAAI,OAAQ,KAAO,EAAE8B,GAAO,GAAK9B,EAAI8B,CAAG,EAAI,CAAM,CAInF,MAAMwI,GAAe,EACfC,GAAe,EACfC,GAAe,EAGfC,GAAiB,EACjBC,GAAiB,IAQjBC,GAAkB,GAGlBC,GAAkB,IAGlBC,GAAkBD,GAAa,EAAID,GAGnCG,GAAkB,GAGlBC,GAAkB,GAGlBC,GAAkB,EAAIH,GAAY,EAGlCI,GAAkB,GAGlBC,GAAgB,GAQhBC,GAAc,EAGdC,GAAc,IAGdC,GAAc,GAGdC,GAAc,GAGdC,GAAc,GAIdC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAEtEC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,EAEhFC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAElDC,GACJ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAa3DC,GAAgB,IAGhBC,EAAgB,IAAI,OAAOhB,GAAY,GAAK,CAAC,EACnDR,GAAOwB,CAAY,EAOnB,MAAMC,GAAgB,IAAI,MAAMhB,GAAY,CAAC,EAC7CT,GAAOyB,EAAY,EAKnB,MAAMC,GAAgB,IAAI,MAAMH,EAAa,EAC7CvB,GAAO0B,EAAU,EAMjB,MAAMC,GAAgB,IAAI,MAAMtB,GAAcD,GAAc,CAAC,EAC7DJ,GAAO2B,EAAY,EAGnB,MAAMC,GAAgB,IAAI,MAAMtB,EAAc,EAC9CN,GAAO4B,EAAW,EAGlB,MAAMC,GAAgB,IAAI,MAAMpB,EAAS,EACzCT,GAAO6B,EAAS,EAIhB,SAASC,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,EAAY,CAE9E,KAAK,YAAeJ,EACpB,KAAK,WAAeC,EACpB,KAAK,WAAeC,EACpB,KAAK,MAAeC,EACpB,KAAK,WAAeC,EAGpB,KAAK,UAAeJ,GAAeA,EAAY,MACjD,CAGA,IAAIK,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,CACnB,CAIA,MAAMC,GAAUC,GAEPA,EAAO,IAAMjB,GAAWiB,CAAI,EAAIjB,GAAW,KAAOiB,IAAS,EAAE,EAQhEC,GAAY,CAAC9T,EAAG+T,IAAM,CAG1B/T,EAAE,YAAYA,EAAE,SAAS,EAAK+T,EAAK,IACnC/T,EAAE,YAAYA,EAAE,SAAS,EAAK+T,IAAM,EAAK,GAC3C,EAOMC,EAAY,CAAChU,EAAGhH,EAAOuX,IAAW,CAElCvQ,EAAE,SAAY+R,GAAWxB,GAC3BvQ,EAAE,QAAWhH,GAASgH,EAAE,SAAY,MACpC8T,GAAU9T,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAShH,GAAU+Y,GAAW/R,EAAE,SAClCA,EAAE,UAAYuQ,EAASwB,KAEvB/R,EAAE,QAAWhH,GAASgH,EAAE,SAAY,MACpCA,EAAE,UAAYuQ,EAElB,EAGM0D,EAAY,CAACjU,EAAGrI,EAAG+U,IAAS,CAEhCsH,EAAUhU,EAAG0M,EAAK/U,EAAI,CAAC,EAAY+U,EAAK/U,EAAI,EAAI,CAAC,EACnD,EAQMuc,GAAa,CAAC9b,EAAMuQ,IAAQ,CAEhC,IAAIwL,EAAM,EACV,GACEA,GAAO/b,EAAO,EACdA,KAAU,EACV+b,IAAQ,QACD,EAAExL,EAAM,GACjB,OAAOwL,IAAQ,CACjB,EAMMC,GAAYpU,GAAM,CAElBA,EAAE,WAAa,IACjB8T,GAAU9T,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAS,EACXA,EAAE,SAAW,GAEJA,EAAE,UAAY,IACvBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,OAAS,IACxCA,EAAE,SAAW,EACbA,EAAE,UAAY,EAElB,EAaMqU,GAAa,CAACrU,EAAGsU,IAAS,CAI9B,MAAM5H,EAAkB4H,EAAK,SACvBzE,EAAkByE,EAAK,SACvBC,EAAkBD,EAAK,UAAU,YACjCE,EAAkBF,EAAK,UAAU,UACjCG,EAAkBH,EAAK,UAAU,WACjCI,EAAkBJ,EAAK,UAAU,WACjCjB,EAAkBiB,EAAK,UAAU,WACvC,IAAIK,EACAlS,EAAGH,EACHwN,EACA8E,EACArS,EACAsS,EAAW,EAEf,IAAK/E,EAAO,EAAGA,GAAQgC,GAAYhC,IACjC9P,EAAE,SAAS8P,CAAI,EAAI,EAQrB,IAFApD,EAAK1M,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtC2U,EAAI3U,EAAE,SAAW,EAAG2U,EAAI9C,GAAa8C,IACxClS,EAAIzC,EAAE,KAAK2U,CAAC,EACZ7E,EAAOpD,EAAKA,EAAKjK,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDqN,EAAOuD,IACTvD,EAAOuD,EACPwB,KAEFnI,EAAKjK,EAAI,EAAI,CAAC,EAAYqN,EAGtB,EAAArN,EAAIoN,KAER7P,EAAE,SAAS8P,CAAI,IACf8E,EAAQ,EACJnS,GAAKiS,IACPE,EAAQH,EAAMhS,EAAIiS,CAAI,GAExBnS,EAAImK,EAAKjK,EAAI,CAAC,EACdzC,EAAE,SAAWuC,GAAKuN,EAAO8E,GACrBJ,IACFxU,EAAE,YAAcuC,GAAKgS,EAAM9R,EAAI,EAAI,CAAC,EAAYmS,KAGpD,GAAIC,IAAa,EAMjB,GAAG,CAED,IADA/E,EAAOuD,EAAa,EACbrT,EAAE,SAAS8P,CAAI,IAAM,GAAKA,IACjC9P,EAAE,SAAS8P,CAAI,IACf9P,EAAE,SAAS8P,EAAO,CAAC,GAAK,EACxB9P,EAAE,SAASqT,CAAU,IAIrBwB,GAAY,CAChB,OAAWA,EAAW,GAOpB,IAAK/E,EAAOuD,EAAYvD,IAAS,EAAGA,IAElC,IADArN,EAAIzC,EAAE,SAAS8P,CAAI,EACZrN,IAAM,GACXH,EAAItC,EAAE,KAAK,EAAE2U,CAAC,EACV,EAAArS,EAAIuN,KACJnD,EAAKpK,EAAI,EAAI,CAAC,IAAcwN,IAE9B9P,EAAE,UAAY8P,EAAOpD,EAAKpK,EAAI,EAAI,CAAC,GAAaoK,EAAKpK,EAAI,CAAC,EAC1DoK,EAAKpK,EAAI,EAAI,CAAC,EAAYwN,GAE5BrN,KAGN,EAWMqS,GAAY,CAACpI,EAAMmD,EAAUE,IAAa,CAK9C,MAAMC,EAAY,IAAI,MAAM8B,GAAa,CAAC,EAC1C,IAAI1Z,EAAO,EACP0X,EACArN,EAKJ,IAAKqN,EAAO,EAAGA,GAAQgC,GAAYhC,IACjC1X,EAAQA,EAAO2X,EAASD,EAAO,CAAC,GAAM,EACtCE,EAAUF,CAAI,EAAI1X,EASpB,IAAKqK,EAAI,EAAIA,GAAKoN,EAAUpN,IAAK,CAC/B,IAAIkG,EAAM+D,EAAKjK,EAAI,EAAI,CAAC,EACpBkG,IAAQ,IAEZ+D,EAAKjK,EAAI,CAAC,EAAayR,GAAWlE,EAAUrH,CAAG,IAAKA,CAAG,EAIxD,CACH,EAMMoM,GAAiB,IAAM,CAE3B,IAAItS,EACAqN,EACAS,EACAnY,EACAyb,EACJ,MAAM9D,EAAW,IAAI,MAAM+B,GAAa,CAAC,EAiBzC,IADAvB,EAAS,EACJnY,EAAO,EAAGA,EAAOoZ,GAAiB,EAAGpZ,IAExC,IADA0a,GAAY1a,CAAI,EAAImY,EACf9N,EAAI,EAAGA,EAAK,GAAK4P,GAAYja,CAAI,EAAIqK,IACxCoQ,GAAatC,GAAQ,EAAInY,EAY7B,IAJAya,GAAatC,EAAS,CAAC,EAAInY,EAG3Byb,EAAO,EACFzb,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA2a,GAAU3a,CAAI,EAAIyb,EACbpR,EAAI,EAAGA,EAAK,GAAK6P,GAAYla,CAAI,EAAIqK,IACxCmQ,GAAWiB,GAAM,EAAIzb,EAKzB,IADAyb,IAAS,EACFzb,EAAOuZ,GAAWvZ,IAEvB,IADA2a,GAAU3a,CAAI,EAAIyb,GAAQ,EACrBpR,EAAI,EAAGA,EAAK,GAAM6P,GAAYla,CAAI,EAAI,EAAKqK,IAC9CmQ,GAAW,IAAMiB,GAAM,EAAIzb,EAM/B,IAAK0X,EAAO,EAAGA,GAAQgC,GAAYhC,IACjCC,EAASD,CAAI,EAAI,EAInB,IADArN,EAAI,EACGA,GAAK,KACViQ,EAAajQ,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAsN,EAAS,CAAC,IAEZ,KAAOtN,GAAK,KACViQ,EAAajQ,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAsN,EAAS,CAAC,IAEZ,KAAOtN,GAAK,KACViQ,EAAajQ,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAsN,EAAS,CAAC,IAEZ,KAAOtN,GAAK,KACViQ,EAAajQ,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAsN,EAAS,CAAC,IASZ,IAHA+E,GAAUpC,EAAchB,GAAY,EAAG3B,CAAQ,EAG1CtN,EAAI,EAAGA,EAAIkP,GAAWlP,IACzBkQ,GAAalQ,EAAI,EAAI,CAAC,EAAY,EAClCkQ,GAAalQ,EAAI,CAAC,EAAayR,GAAWzR,EAAG,CAAC,EAIhD6Q,GAAgB,IAAIN,GAAeN,EAAcL,GAAaZ,GAAa,EAAGC,GAAWI,EAAU,EACnGyB,GAAgB,IAAIP,GAAeL,GAAcL,GAAa,EAAYX,GAAWG,EAAU,EAC/F0B,GAAiB,IAAIR,GAAe,IAAI,MAAM,CAAC,EAAGT,GAAc,EAAWX,GAAYI,EAAW,CAGpG,EAMMgD,GAAchV,GAAM,CAExB,IAAI,EAGJ,IAAK,EAAI,EAAG,EAAI0R,GAAY,IAAO1R,EAAE,UAAU,EAAI,CAAC,EAAa,EACjE,IAAK,EAAI,EAAG,EAAI2R,GAAY,IAAO3R,EAAE,UAAU,EAAI,CAAC,EAAa,EACjE,IAAK,EAAI,EAAG,EAAI4R,GAAY,IAAO5R,EAAE,QAAQ,EAAI,CAAC,EAAa,EAE/DA,EAAE,UAAUiS,GAAY,CAAC,EAAa,EACtCjS,EAAE,QAAUA,EAAE,WAAa,EAC3BA,EAAE,SAAWA,EAAE,QAAU,CAC3B,EAMMiV,GAAajV,GACnB,CACMA,EAAE,SAAW,EACf8T,GAAU9T,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,CACf,EAMMkV,GAAU,CAACxI,EAAM,EAAGpK,EAAG6S,IAAU,CAErC,MAAMC,EAAM,EAAI,EACVC,EAAM/S,EAAI,EAChB,OAAQoK,EAAK0I,CAAG,EAAa1I,EAAK2I,CAAG,GAC7B3I,EAAK0I,CAAG,IAAe1I,EAAK2I,CAAG,GAAcF,EAAM,CAAC,GAAKA,EAAM7S,CAAC,CAC1E,EAQMgT,GAAa,CAACtV,EAAG0M,EAAM3U,IAAM,CAKjC,MAAMC,EAAIgI,EAAE,KAAKjI,CAAC,EAClB,IAAIgT,EAAIhT,GAAK,EACb,KAAOgT,GAAK/K,EAAE,WAER+K,EAAI/K,EAAE,UACRkV,GAAQxI,EAAM1M,EAAE,KAAK+K,EAAI,CAAC,EAAG/K,EAAE,KAAK+K,CAAC,EAAG/K,EAAE,KAAK,GAC/C+K,IAGE,CAAAmK,GAAQxI,EAAM1U,EAAGgI,EAAE,KAAK+K,CAAC,EAAG/K,EAAE,KAAK,IAGvCA,EAAE,KAAKjI,CAAC,EAAIiI,EAAE,KAAK+K,CAAC,EACpBhT,EAAIgT,EAGJA,IAAM,EAER/K,EAAE,KAAKjI,CAAC,EAAIC,CACd,EASMud,GAAiB,CAACvV,EAAGoM,EAAOC,IAAU,CAK1C,IAAIwH,EACA/J,EACA0L,EAAK,EACLpd,EACAqc,EAEJ,GAAIzU,EAAE,WAAa,EACjB,GACE6T,EAAO7T,EAAE,YAAYA,EAAE,QAAUwV,GAAI,EAAI,IACzC3B,IAAS7T,EAAE,YAAYA,EAAE,QAAUwV,GAAI,EAAI,MAAS,EACpD1L,EAAK9J,EAAE,YAAYA,EAAE,QAAUwV,GAAI,EAC/B3B,IAAS,EACXI,EAAUjU,EAAG8J,EAAIsC,CAAK,GAItBhU,EAAOya,GAAa/I,CAAE,EACtBmK,EAAUjU,EAAG5H,EAAOqZ,GAAa,EAAGrF,CAAK,EACzCqI,EAAQpC,GAAYja,CAAI,EACpBqc,IAAU,IACZ3K,GAAMgJ,GAAY1a,CAAI,EACtB4b,EAAUhU,EAAG8J,EAAI2K,CAAK,GAExBZ,IACAzb,EAAOwb,GAAOC,CAAI,EAGlBI,EAAUjU,EAAG5H,EAAMiU,CAAK,EACxBoI,EAAQnC,GAAYla,CAAI,EACpBqc,IAAU,IACZZ,GAAQd,GAAU3a,CAAI,EACtB4b,EAAUhU,EAAG6T,EAAMY,CAAK,UAOrBe,EAAKxV,EAAE,UAGlBiU,EAAUjU,EAAGiS,GAAW7F,CAAK,CAC/B,EAWMqJ,GAAa,CAACzV,EAAGsU,IAAS,CAI9B,MAAM5H,EAAW4H,EAAK,SAChBC,EAAWD,EAAK,UAAU,YAC1BE,EAAYF,EAAK,UAAU,UAC3BlB,EAAWkB,EAAK,UAAU,MAChC,IAAI7R,EAAGH,EACHuN,EAAW,GACX6F,EASJ,IAHA1V,EAAE,SAAW,EACbA,EAAE,SAAW6R,GAERpP,EAAI,EAAGA,EAAI2Q,EAAO3Q,IACjBiK,EAAKjK,EAAI,CAAC,IAAe,GAC3BzC,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAI6P,EAAWpN,EAClCzC,EAAE,MAAMyC,CAAC,EAAI,GAGbiK,EAAKjK,EAAI,EAAI,CAAC,EAAY,EAS9B,KAAOzC,EAAE,SAAW,GAClB0V,EAAO1V,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAK6P,EAAW,EAAI,EAAEA,EAAW,EAC3DnD,EAAKgJ,EAAO,CAAC,EAAa,EAC1B1V,EAAE,MAAM0V,CAAI,EAAI,EAChB1V,EAAE,UAEEwU,IACFxU,EAAE,YAAcuU,EAAMmB,EAAO,EAAI,CAAC,GAStC,IALApB,EAAK,SAAWzE,EAKXpN,EAAKzC,EAAE,UAAY,EAAcyC,GAAK,EAAGA,IAAO6S,GAAWtV,EAAG0M,EAAMjK,CAAC,EAK1EiT,EAAOtC,EACP,GAGE3Q,EAAIzC,EAAE,KAAK,GACXA,EAAE,KAAK,GAAiBA,EAAE,KAAKA,EAAE,UAAU,EAC3CsV,GAAWtV,EAAG0M,EAAM,GAGpBpK,EAAItC,EAAE,KAAK,GAEXA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIyC,EACvBzC,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIsC,EAGvBoK,EAAKgJ,EAAO,CAAC,EAAahJ,EAAKjK,EAAI,CAAC,EAAaiK,EAAKpK,EAAI,CAAC,EAC3DtC,EAAE,MAAM0V,CAAI,GAAK1V,EAAE,MAAMyC,CAAC,GAAKzC,EAAE,MAAMsC,CAAC,EAAItC,EAAE,MAAMyC,CAAC,EAAIzC,EAAE,MAAMsC,CAAC,GAAK,EACvEoK,EAAKjK,EAAI,EAAI,CAAC,EAAYiK,EAAKpK,EAAI,EAAI,CAAC,EAAYoT,EAGpD1V,EAAE,KAAK,CAAc,EAAG0V,IACxBJ,GAAWtV,EAAG0M,EAAM,SAEb1M,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,GAK9BqU,GAAWrU,EAAGsU,CAAI,EAGlBQ,GAAUpI,EAAMmD,EAAU7P,EAAE,QAAQ,CACtC,EAOM2V,GAAY,CAAC3V,EAAG0M,EAAMmD,IAAa,CAKvC,IAAIpN,EACAmT,EAAU,GACVC,EAEAC,EAAUpJ,EAAK,EAAI,EAAI,CAAC,EAExBqJ,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAEdvJ,GAAMmD,EAAW,GAAK,EAAI,CAAC,EAAY,MAElCpN,EAAI,EAAGA,GAAKoN,EAAUpN,IACzBoT,EAASC,EACTA,EAAUpJ,GAAMjK,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEsT,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACjBjW,EAAE,QAAQ6V,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAW5V,EAAE,QAAQ6V,EAAS,CAAC,IAC9C7V,EAAE,QAAQkS,GAAU,CAAC,KAEZ6D,GAAS,GAClB/V,EAAE,QAAQmS,GAAY,CAAC,IAGvBnS,EAAE,QAAQoS,GAAc,CAAC,IAG3B2D,EAAQ,EACRH,EAAUC,EAENC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOMC,GAAY,CAAClW,EAAG0M,EAAMmD,IAAa,CAKvC,IAAIpN,EACAmT,EAAU,GACVC,EAEAC,EAAUpJ,EAAK,EAAI,EAAI,CAAC,EAExBqJ,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAGTxT,EAAI,EAAGA,GAAKoN,EAAUpN,IAIzB,GAHAoT,EAASC,EACTA,EAAUpJ,GAAMjK,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEsT,EAAQC,GAAaH,IAAWC,GAG/B,IAAIC,EAAQE,EACjB,GAAKhC,EAAUjU,EAAG6V,EAAQ7V,EAAE,OAAO,QAAY,EAAE+V,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACb3B,EAAUjU,EAAG6V,EAAQ7V,EAAE,OAAO,EAC9B+V,KAGF9B,EAAUjU,EAAGkS,GAASlS,EAAE,OAAO,EAC/BgU,EAAUhU,EAAG+V,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IAClB9B,EAAUjU,EAAGmS,GAAWnS,EAAE,OAAO,EACjCgU,EAAUhU,EAAG+V,EAAQ,EAAG,CAAC,IAGzB9B,EAAUjU,EAAGoS,GAAapS,EAAE,OAAO,EACnCgU,EAAUhU,EAAG+V,EAAQ,GAAI,CAAC,GAG5BA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOME,GAAiBnW,GAAM,CAE3B,IAAIoW,EAgBJ,IAbAT,GAAU3V,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3C2V,GAAU3V,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAG3CyV,GAAWzV,EAAGA,EAAE,OAAO,EASlBoW,EAAcxE,GAAa,EAAGwE,GAAe,GAC5CpW,EAAE,QAAQwS,GAAS4D,CAAW,EAAI,EAAI,CAAC,IAAc,EADNA,IACnD,CAKF,OAAApW,EAAE,SAAW,GAAKoW,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,EAQMC,GAAiB,CAACrW,EAAGsW,EAAQC,EAAQC,IAAY,CAIrD,IAAIC,EASJ,IAHAzC,EAAUhU,EAAGsW,EAAS,IAAK,CAAC,EAC5BtC,EAAUhU,EAAGuW,EAAS,EAAK,CAAC,EAC5BvC,EAAUhU,EAAGwW,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BzC,EAAUhU,EAAGA,EAAE,QAAQwS,GAASiE,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUlW,EAAGA,EAAE,UAAWsW,EAAS,CAAC,EAGpCJ,GAAUlW,EAAGA,EAAE,UAAWuW,EAAS,CAAC,CAEtC,EAgBMG,GAAoB1W,GAAM,CAK9B,IAAI2W,EAAa,WACblU,EAGJ,IAAKA,EAAI,EAAGA,GAAK,GAAIA,IAAKkU,KAAgB,EACxC,GAAKA,EAAa,GAAO3W,EAAE,UAAUyC,EAAI,CAAC,IAAe,EACvD,OAAOsO,GAKX,GAAI/Q,EAAE,UAAU,EAAI,CAAC,IAAe,GAAKA,EAAE,UAAU,GAAK,CAAC,IAAe,GACtEA,EAAE,UAAU,GAAK,CAAC,IAAe,EACnC,OAAOgR,GAET,IAAKvO,EAAI,GAAIA,EAAIgP,GAAYhP,IAC3B,GAAIzC,EAAE,UAAUyC,EAAI,CAAC,IAAe,EAClC,OAAOuO,GAOX,OAAOD,EACT,EAGA,IAAI6F,GAAmB,GAKvB,MAAMC,GAAc7W,GACpB,CAEO4W,KACH7B,KACA6B,GAAmB,IAGrB5W,EAAE,OAAU,IAAIyT,GAASzT,EAAE,UAAWsT,EAAa,EACnDtT,EAAE,OAAU,IAAIyT,GAASzT,EAAE,UAAWuT,EAAa,EACnDvT,EAAE,QAAU,IAAIyT,GAASzT,EAAE,QAASwT,EAAc,EAElDxT,EAAE,OAAS,EACXA,EAAE,SAAW,EAGbgV,GAAWhV,CAAC,CACd,EAMM8W,GAAqB,CAAC9W,EAAG6G,EAAKkQ,EAAYC,IAAS,CAMvDhD,EAAUhU,GAAImR,IAAgB,IAAM6F,EAAO,EAAI,GAAI,CAAC,EACpD/B,GAAUjV,CAAC,EACX8T,GAAU9T,EAAG+W,CAAU,EACvBjD,GAAU9T,EAAG,CAAC+W,CAAU,EACpBA,GACF/W,EAAE,YAAY,IAAIA,EAAE,OAAO,SAAS6G,EAAKA,EAAMkQ,CAAU,EAAG/W,EAAE,OAAO,EAEvEA,EAAE,SAAW+W,CACf,EAOME,GAAejX,GAAM,CACzBgU,EAAUhU,EAAGoR,IAAgB,EAAG,CAAC,EACjC6C,EAAUjU,EAAGiS,GAAWS,CAAY,EACpC0B,GAASpU,CAAC,CACZ,EAOMkX,GAAoB,CAAClX,EAAG6G,EAAKkQ,EAAYC,IAAS,CAMtD,IAAIG,EAAUC,EACVhB,EAAc,EAGdpW,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAciR,KACvBjR,EAAE,KAAK,UAAY0W,GAAiB1W,CAAC,GAIvCyV,GAAWzV,EAAGA,EAAE,MAAM,EAItByV,GAAWzV,EAAGA,EAAE,MAAM,EAUtBoW,EAAcD,GAAcnW,CAAC,EAG7BmX,EAAYnX,EAAE,QAAU,EAAI,IAAO,EACnCoX,EAAepX,EAAE,WAAa,EAAI,IAAO,EAMrCoX,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAActQ,IAAQ,GAS3CiQ,GAAmB9W,EAAG6G,EAAKkQ,EAAYC,CAAI,EAElChX,EAAE,WAAa8Q,IAAasG,IAAgBD,GAErDnD,EAAUhU,GAAIoR,IAAgB,IAAM4F,EAAO,EAAI,GAAI,CAAC,EACpDzB,GAAevV,EAAG0S,EAAcC,EAAY,IAG5CqB,EAAUhU,GAAIqR,IAAa,IAAM2F,EAAO,EAAI,GAAI,CAAC,EACjDX,GAAerW,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAGoW,EAAc,CAAC,EAC/Eb,GAAevV,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5CgV,GAAWhV,CAAC,EAERgX,GACF/B,GAAUjV,CAAC,CAIf,EAMMqX,GAAc,CAACrX,EAAG6T,EAAM/J,KAK5B9J,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI6T,EAC1C7T,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI6T,GAAQ,EAClD7T,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI8J,EACtC+J,IAAS,EAEX7T,EAAE,UAAU8J,EAAK,CAAC,KAElB9J,EAAE,UAEF6T,IAKA7T,EAAE,WAAW6S,GAAa/I,CAAE,EAAI2H,GAAa,GAAK,CAAC,IACnDzR,EAAE,UAAU4T,GAAOC,CAAI,EAAI,CAAC,KAGtB7T,EAAE,WAAaA,EAAE,SAG3B,IAAIsX,GAAcT,GACdU,GAAqBT,GACrBU,GAAqBN,GACrBO,GAAcJ,GACdK,GAAcT,GAEdU,GAAQ,CACX,SAAUL,GACV,iBAAkBC,GAClB,gBAAiBC,GACjB,UAAWC,GACX,UAAWC,EACZ,EAkDIE,GAzBY,CAACC,EAAOhR,EAAK8B,EAAKY,IAAQ,CACxC,IAAIuO,EAAMD,EAAQ,MAAS,EACvBE,EAAOF,IAAU,GAAM,MAAS,EAChCpV,EAAI,EAER,KAAOkG,IAAQ,GAAG,CAIhBlG,EAAIkG,EAAM,IAAO,IAAOA,EACxBA,GAAOlG,EAEP,GACEqV,EAAMA,EAAKjR,EAAI0C,GAAK,EAAI,EACxBwO,EAAMA,EAAKD,EAAK,QACT,EAAErV,GAEXqV,GAAM,MACNC,GAAM,KACP,CAED,OAAQD,EAAMC,GAAM,GAAM,CAC5B,EA6BA,MAAMC,GAAY,IAAM,CACtB,IAAIrgB,EAAGsgB,EAAQ,GAEf,QAASxV,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B9K,EAAI8K,EACJ,QAAS1K,EAAI,EAAGA,EAAI,EAAGA,IACrBJ,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDsgB,EAAMxV,CAAC,EAAI9K,CACZ,CAED,OAAOsgB,CACT,EAGMC,GAAW,IAAI,YAAYF,GAAS,CAAE,EAiB5C,IAAIG,EAdU,CAACnQ,EAAKnB,EAAK8B,EAAKY,IAAQ,CACpC,MAAMrG,EAAIgV,GACJhT,EAAMqE,EAAMZ,EAElBX,GAAO,GAEP,QAASpI,EAAI2J,EAAK3J,EAAIsF,EAAKtF,IACzBoI,EAAOA,IAAQ,EAAK9E,GAAG8E,EAAMnB,EAAIjH,CAAC,GAAK,GAAI,EAG7C,OAAQoI,EAAO,EACjB,EAwBIoQ,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACV,EAqBIC,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GACnB,YAAmB,GACnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,CAE5B,EAqBA,KAAM,CAAE,SAAAC,GAAU,iBAAAC,GAAkB,gBAAAC,GAAiB,UAAAC,GAAW,UAAAC,EAAW,EAAGf,GAQxE,CACJ,WAAYgB,GAAc,gBAAAC,GAAiB,aAAcC,GAAgB,SAAUC,EAAY,QAASC,GACxG,KAAMC,EAAQ,aAAcC,GAAgB,eAAgBC,EAAkB,aAAcC,GAAgB,YAAaC,GACzH,sBAAuBC,GACvB,WAAAC,GAAY,eAAAC,GAAgB,MAAAC,GAAO,QAAAC,GAAS,mBAAoBC,GAChE,UAAAC,GACA,WAAYC,EACd,EAAIvB,GAKEwB,GAAgB,EAEhBC,GAAc,GAEdC,GAAgB,EAGhBC,GAAgB,GAIhBC,GAFgB,IAEW,EAAID,GAE/BE,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,GAAU,EAE9BrK,GAAY,GAGZyK,EAAY,EACZC,GAAY,IACZC,EAAiBD,GAAYD,EAAY,EAEzCG,GAAc,GAEdC,GAAiB,GAEjBC,GAAiB,GAEjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAgB,IAEhBC,EAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAEpBC,GAAU,EAEVC,GAAM,CAACC,EAAMC,KACjBD,EAAK,IAAMnD,GAASoD,CAAS,EACtBA,GAGH/E,GAAQlU,GACHA,EAAK,GAAOA,EAAK,EAAI,EAAI,GAG9BkZ,GAAQ5U,GAAQ,CACpB,IAAI8B,EAAM9B,EAAI,OAAQ,KAAO,EAAE8B,GAAO,GAAK9B,EAAI8B,CAAG,EAAI,CACxD,EAOM+S,GAAc1b,GAAM,CACxB,IAAI,EAAGsC,EACHhF,EACAqe,EAAQ3b,EAAE,OAEd,EAAIA,EAAE,UACN1C,EAAI,EACJ,GACEgF,EAAItC,EAAE,KAAK,EAAE1C,CAAC,EACd0C,EAAE,KAAK1C,CAAC,EAAKgF,GAAKqZ,EAAQrZ,EAAIqZ,EAAQ,QAC/B,EAAE,GACX,EAAIA,EAEJre,EAAI,EACJ,GACEgF,EAAItC,EAAE,KAAK,EAAE1C,CAAC,EACd0C,EAAE,KAAK1C,CAAC,EAAKgF,GAAKqZ,EAAQrZ,EAAIqZ,EAAQ,QAI/B,EAAE,EAEb,EAOA,IAAIC,GAJY,CAAC5b,EAAG4J,EAAMhR,KAAWgR,GAAQ5J,EAAE,WAAcpH,GAAQoH,EAAE,UAavE,MAAM6b,EAAiBN,GAAS,CAC9B,MAAMvb,EAAIub,EAAK,MAGf,IAAI5S,EAAM3I,EAAE,QACR2I,EAAM4S,EAAK,YACb5S,EAAM4S,EAAK,WAET5S,IAAQ,IAEZ4S,EAAK,OAAO,IAAIvb,EAAE,YAAY,SAASA,EAAE,YAAaA,EAAE,YAAc2I,CAAG,EAAG4S,EAAK,QAAQ,EACzFA,EAAK,UAAa5S,EAClB3I,EAAE,aAAgB2I,EAClB4S,EAAK,WAAa5S,EAClB4S,EAAK,WAAa5S,EAClB3I,EAAE,SAAgB2I,EACd3I,EAAE,UAAY,IAChBA,EAAE,YAAc,GAEpB,EAGM8b,EAAmB,CAAC9b,EAAGgX,IAAS,CACpCwB,GAAgBxY,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAagX,CAAI,EAC9FhX,EAAE,YAAcA,EAAE,SAClB6b,EAAc7b,EAAE,IAAI,CACtB,EAGM+b,EAAW,CAAC/b,EAAGwC,IAAM,CACzBxC,EAAE,YAAYA,EAAE,SAAS,EAAIwC,CAC/B,EAQMwZ,GAAc,CAAChc,EAAGwC,IAAM,CAI5BxC,EAAE,YAAYA,EAAE,SAAS,EAAKwC,IAAM,EAAK,IACzCxC,EAAE,YAAYA,EAAE,SAAS,EAAIwC,EAAI,GACnC,EAUMyZ,GAAW,CAACV,EAAM1U,EAAK5B,EAAO1P,IAAS,CAE3C,IAAIoT,EAAM4S,EAAK,SAGf,OADI5S,EAAMpT,IAAQoT,EAAMpT,GACpBoT,IAAQ,EAAY,GAExB4S,EAAK,UAAY5S,EAGjB9B,EAAI,IAAI0U,EAAK,MAAM,SAASA,EAAK,QAASA,EAAK,QAAU5S,CAAG,EAAG1D,CAAK,EAChEsW,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQ3D,GAAU2D,EAAK,MAAO1U,EAAK8B,EAAK1D,CAAK,EAG3CsW,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1U,EAAK8B,EAAK1D,CAAK,GAGlDsW,EAAK,SAAW5S,EAChB4S,EAAK,UAAY5S,EAEVA,EACT,EAYMuT,GAAgB,CAAClc,EAAGmc,IAAc,CAEtC,IAAIC,EAAepc,EAAE,iBACjBqc,EAAOrc,EAAE,SACT/E,EACA0N,EACA2T,EAAWtc,EAAE,YACbuc,EAAavc,EAAE,WACnB,MAAMwc,EAASxc,EAAE,SAAYA,EAAE,OAASua,EACpCva,EAAE,UAAYA,EAAE,OAASua,GAAiB,EAExCkC,EAAOzc,EAAE,OAET0c,EAAQ1c,EAAE,OACV4J,EAAQ5J,EAAE,KAMV2c,EAAS3c,EAAE,SAAWsa,GAC5B,IAAIsC,EAAaH,EAAKJ,EAAOC,EAAW,CAAC,EACrCO,EAAaJ,EAAKJ,EAAOC,CAAQ,EAQjCtc,EAAE,aAAeA,EAAE,aACrBoc,IAAiB,GAKfG,EAAavc,EAAE,YAAauc,EAAavc,EAAE,WAI/C,EAaE,IAXA/E,EAAQkhB,EAWJ,EAAAM,EAAKxhB,EAAQqhB,CAAQ,IAAUO,GAC/BJ,EAAKxhB,EAAQqhB,EAAW,CAAC,IAAMM,GAC/BH,EAAKxhB,CAAK,IAAqBwhB,EAAKJ,CAAI,GACxCI,EAAK,EAAExhB,CAAK,IAAmBwhB,EAAKJ,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRphB,IAMA,EAAG,OAEMwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAAKwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAC/DwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAAKwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAC/DwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAAKwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAC/DwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAAKwhB,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAExhB,CAAK,GAC/DohB,EAAOM,GAOhB,GAHAhU,EAAM2R,IAAaqC,EAASN,GAC5BA,EAAOM,EAASrC,GAEZ3R,EAAM2T,EAAU,CAGlB,GAFAtc,EAAE,YAAcmc,EAChBG,EAAW3T,EACPA,GAAO4T,EACT,MAEFK,EAAaH,EAAKJ,EAAOC,EAAW,CAAC,EACrCO,EAAaJ,EAAKJ,EAAOC,CAAQ,CAClC,SACOH,EAAYvS,EAAKuS,EAAYO,CAAK,GAAKF,GAAS,EAAEJ,IAAiB,GAE7E,OAAIE,GAAYtc,EAAE,UACTsc,EAEFtc,EAAE,SACX,EAaM8c,GAAe9c,GAAM,CAEzB,MAAM+c,EAAU/c,EAAE,OAClB,IAAIyC,EAAGua,EAAMrgB,EAIb,EAAG,CAkCD,GAjCAqgB,EAAOhd,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAY+c,GAAWA,EAAUxC,KAErCva,EAAE,OAAO,IAAIA,EAAE,OAAO,SAAS+c,EAASA,EAAUA,EAAUC,CAAI,EAAG,CAAC,EACpEhd,EAAE,aAAe+c,EACjB/c,EAAE,UAAY+c,EAEd/c,EAAE,aAAe+c,EACb/c,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,UAEf0b,GAAW1b,CAAC,EACZgd,GAAQD,GAEN/c,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJAyC,EAAIwZ,GAASjc,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAWgd,CAAI,EAC7Dhd,EAAE,WAAayC,EAGXzC,EAAE,UAAYA,EAAE,QAAUqa,EAS5B,IARA1d,EAAMqD,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAOrD,CAAG,EAGtBqD,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM,CAAC,CAAC,EAIrCqD,EAAE,SAEPA,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM0d,EAAY,CAAC,CAAC,EAExDra,EAAE,KAAKrD,EAAMqD,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAIrD,EAClBA,IACAqD,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASqa,KAA7B,CASR,OAAWra,EAAE,UAAYua,GAAiBva,EAAE,KAAK,WAAa,EAsC9D,EAiBMid,GAAiB,CAACjd,EAAGkd,IAAU,CAMnC,IAAIC,EAAYnd,EAAE,iBAAmB,EAAIA,EAAE,OAASA,EAAE,OAASA,EAAE,iBAAmB,EAMhF2I,EAAKyU,EAAMC,EAAMrG,EAAO,EACxBsG,EAAOtd,EAAE,KAAK,SAClB,EAAG,CAyBD,GApBA2I,EAAM,MACN0U,EAAQrd,EAAE,SAAW,IAAO,EACxBA,EAAE,KAAK,UAAYqd,IAIvBA,EAAOrd,EAAE,KAAK,UAAYqd,EAC1BD,EAAOpd,EAAE,SAAWA,EAAE,YAClB2I,EAAMyU,EAAOpd,EAAE,KAAK,WACtB2I,EAAMyU,EAAOpd,EAAE,KAAK,UAElB2I,EAAM0U,IACR1U,EAAM0U,GAQJ1U,EAAMwU,IAAexU,IAAQ,GAAKuU,IAAUpE,GAC5BoE,IAAUvE,IACVhQ,IAAQyU,EAAOpd,EAAE,KAAK,WACxC,MAMFgX,EAAOkG,IAAUpE,GAAcnQ,IAAQyU,EAAOpd,EAAE,KAAK,SAAW,EAAI,EACpEuY,GAAiBvY,EAAG,EAAG,EAAGgX,CAAI,EAG9BhX,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI2I,EAC/B3I,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI2I,GAAO,EACtC3I,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC2I,EAChC3I,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAAC2I,GAAO,EAGvCkT,EAAc7b,EAAE,IAAI,EAShBod,IACEA,EAAOzU,IACTyU,EAAOzU,GAGT3I,EAAE,KAAK,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,YAAaA,EAAE,YAAcod,CAAI,EAAGpd,EAAE,KAAK,QAAQ,EACzFA,EAAE,KAAK,UAAYod,EACnBpd,EAAE,KAAK,WAAaod,EACpBpd,EAAE,KAAK,WAAaod,EACpBpd,EAAE,aAAeod,EACjBzU,GAAOyU,GAMLzU,IACFsT,GAASjc,EAAE,KAAMA,EAAE,KAAK,OAAQA,EAAE,KAAK,SAAU2I,CAAG,EACpD3I,EAAE,KAAK,UAAY2I,EACnB3I,EAAE,KAAK,WAAa2I,EACpB3I,EAAE,KAAK,WAAa2I,EAE1B,OAAWqO,IAAS,GA6ClB,OArCAsG,GAAQtd,EAAE,KAAK,SACXsd,IAIEA,GAAQtd,EAAE,QACZA,EAAE,QAAU,EAEZA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAUA,EAAE,OAAQA,EAAE,KAAK,OAAO,EAAG,CAAC,EAChFA,EAAE,SAAWA,EAAE,OACfA,EAAE,OAASA,EAAE,WAGTA,EAAE,YAAcA,EAAE,UAAYsd,IAEhCtd,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEAA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAIjBA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAUsd,EAAMtd,EAAE,KAAK,OAAO,EAAGA,EAAE,QAAQ,EACrFA,EAAE,UAAYsd,EACdtd,EAAE,QAAUsd,EAAOtd,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAASsd,GAEjEtd,EAAE,YAAcA,EAAE,UAEhBA,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAIfgX,EACKoE,GAIL8B,IAAUvE,IAAgBuE,IAAUpE,GACtC9Y,EAAE,KAAK,WAAa,GAAKA,EAAE,WAAaA,EAAE,YACnCkb,IAITmC,EAAOrd,EAAE,YAAcA,EAAE,SACrBA,EAAE,KAAK,SAAWqd,GAAQrd,EAAE,aAAeA,EAAE,SAE/CA,EAAE,aAAeA,EAAE,OACnBA,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEJqd,GAAQrd,EAAE,OACNA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAGbqd,EAAOrd,EAAE,KAAK,WAChBqd,EAAOrd,EAAE,KAAK,UAEZqd,IACFpB,GAASjc,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAUqd,CAAI,EAC3Crd,EAAE,UAAYqd,EACdrd,EAAE,QAAUqd,EAAOrd,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAASqd,GAE7Drd,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAQnBqd,EAAQrd,EAAE,SAAW,IAAO,EAE5Bqd,EAAOrd,EAAE,iBAAmBqd,EAAO,MAAwB,MAAwBrd,EAAE,iBAAmBqd,EACxGF,EAAYE,EAAOrd,EAAE,OAASA,EAAE,OAASqd,EACzCD,EAAOpd,EAAE,SAAWA,EAAE,aAClBod,GAAQD,IACPC,GAAQF,IAAUpE,IAAeoE,IAAUvE,IAC7C3Y,EAAE,KAAK,WAAa,GAAKod,GAAQC,KAClC1U,EAAMyU,EAAOC,EAAOA,EAAOD,EAC3BpG,EAAOkG,IAAUpE,GAAc9Y,EAAE,KAAK,WAAa,GAC9C2I,IAAQyU,EAAO,EAAI,EACxB7E,GAAiBvY,EAAGA,EAAE,YAAa2I,EAAKqO,CAAI,EAC5ChX,EAAE,aAAe2I,EACjBkT,EAAc7b,EAAE,IAAI,GAIfgX,EAAOmE,GAAoBF,EACpC,EAUMsC,GAAe,CAACvd,EAAGkd,IAAU,CAEjC,IAAIM,EACAC,EAEJ,OAAS,CAMP,GAAIzd,EAAE,UAAYua,EAAe,CAE/B,GADAuC,GAAY9c,CAAC,EACTA,EAAE,UAAYua,GAAiB2C,IAAUvE,GAC3C,OAAOsC,EAET,GAAIjb,EAAE,YAAc,EAClB,KAEH,CAyBD,GApBAwd,EAAY,EACRxd,EAAE,WAAaqa,IAEjBra,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWqa,EAAY,CAAC,CAAC,EAC/DmD,EAAYxd,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlBwd,IAAc,GAAcxd,EAAE,SAAWwd,GAAexd,EAAE,OAASua,IAKrEva,EAAE,aAAekc,GAAclc,EAAGwd,CAAS,GAGzCxd,EAAE,cAAgBqa,EAYpB,GAPAoD,EAAShF,GAAUzY,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAeqa,CAAS,EAE5Era,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAaqa,EAAW,CACvFra,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWqa,EAAY,CAAC,CAAC,EAC/DmD,EAAYxd,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,eAKb,EAAEA,EAAE,eAAiB,GAC9BA,EAAE,UACH,MAECA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,EACjBA,EAAE,MAAQA,EAAE,OAAOA,EAAE,QAAQ,EAE7BA,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,OAarDyd,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,WAEJ,GAAIyd,IAEF3B,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOib,CAIZ,CAED,OADAjb,EAAE,OAAWA,EAAE,SAAYqa,EAAY,EAAMra,EAAE,SAAWqa,EAAY,EAClE6C,IAAUpE,GAEZgD,EAAiB9b,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBmb,GAGFC,IAELpb,EAAE,WAEJ8b,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBib,EAIJC,EACT,EAOMwC,GAAe,CAAC1d,EAAGkd,IAAU,CAEjC,IAAIM,EACAC,EAEAE,EAGJ,OAAS,CAMP,GAAI3d,EAAE,UAAYua,EAAe,CAE/B,GADAuC,GAAY9c,CAAC,EACTA,EAAE,UAAYua,GAAiB2C,IAAUvE,GAC3C,OAAOsC,EAET,GAAIjb,EAAE,YAAc,EAAK,KAC1B,CAyCD,GApCAwd,EAAY,EACRxd,EAAE,WAAaqa,IAEjBra,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWqa,EAAY,CAAC,CAAC,EAC/DmD,EAAYxd,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAMtBA,EAAE,YAAcA,EAAE,aAClBA,EAAE,WAAaA,EAAE,YACjBA,EAAE,aAAeqa,EAAY,EAEzBmD,IAAc,GAAYxd,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAWwd,GAAcxd,EAAE,OAASua,IAKxCva,EAAE,aAAekc,GAAclc,EAAGwd,CAAS,EAGvCxd,EAAE,cAAgB,IAClBA,EAAE,WAAasZ,IAAetZ,EAAE,eAAiBqa,GAAara,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAeqa,EAAY,IAM7Bra,EAAE,aAAeqa,GAAara,EAAE,cAAgBA,EAAE,YAAa,CACjE2d,EAAa3d,EAAE,SAAWA,EAAE,UAAYqa,EAOxCoD,EAAShF,GAAUzY,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAcqa,CAAS,EAM9Era,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAY2d,IAElB3d,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWqa,EAAY,CAAC,CAAC,EAC/DmD,EAAYxd,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,gBAGf,EAAEA,EAAE,cAAgB,GAK7B,GAJAA,EAAE,gBAAkB,EACpBA,EAAE,aAAeqa,EAAY,EAC7Bra,EAAE,WAEEyd,IAEF3B,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOib,CAKjB,SAAejb,EAAE,iBAgBX,GATAyd,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAE7Cyd,GAEF3B,EAAiB9b,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAOib,OAMTjb,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,WAEL,CAUD,OARIA,EAAE,kBAGJyd,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEjDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWqa,EAAY,EAAIra,EAAE,SAAWqa,EAAY,EAC7D6C,IAAUpE,GAEZgD,EAAiB9b,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBmb,GAGFC,IAELpb,EAAE,WAEJ8b,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBib,EAKJC,EACT,EAQM0C,GAAc,CAAC5d,EAAGkd,IAAU,CAEhC,IAAIO,EACA7T,EACAyS,EAAMM,EAEV,MAAMF,EAAOzc,EAAE,OAEf,OAAS,CAKP,GAAIA,EAAE,WAAasa,GAAW,CAE5B,GADAwC,GAAY9c,CAAC,EACTA,EAAE,WAAasa,IAAa4C,IAAUvE,GACxC,OAAOsC,EAET,GAAIjb,EAAE,YAAc,EAAK,KAC1B,CAID,GADAA,EAAE,aAAe,EACbA,EAAE,WAAaqa,GAAara,EAAE,SAAW,IAC3Cqc,EAAOrc,EAAE,SAAW,EACpB4J,EAAO6S,EAAKJ,CAAI,EACZzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAG,CAC3EM,EAAS3c,EAAE,SAAWsa,GACtB,EAAG,OAEM1Q,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAC7CzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAC7CzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAC7CzS,IAAS6S,EAAK,EAAEJ,CAAI,GAAKzS,IAAS6S,EAAK,EAAEJ,CAAI,GAC7CA,EAAOM,GAChB3c,EAAE,aAAesa,IAAaqC,EAASN,GACnCrc,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,UAEtB,CAuBH,GAlBIA,EAAE,cAAgBqa,GAIpBoD,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,aAAeqa,CAAS,EAEnDra,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjByd,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,YAEAyd,IAEF3B,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOib,CAIZ,CAED,OADAjb,EAAE,OAAS,EACPkd,IAAUpE,GAEZgD,EAAiB9b,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBmb,GAGFC,IAELpb,EAAE,WAEJ8b,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBib,EAIJC,EACT,EAMM2C,GAAe,CAAC7d,EAAGkd,IAAU,CAEjC,IAAIO,EAEJ,OAAS,CAEP,GAAIzd,EAAE,YAAc,IAClB8c,GAAY9c,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAIkd,IAAUvE,GACZ,OAAOsC,EAET,KACD,CAUH,GANAjb,EAAE,aAAe,EAGjByd,EAAShF,GAAUzY,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAC7CA,EAAE,YACFA,EAAE,WACEyd,IAEF3B,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOib,CAIZ,CAED,OADAjb,EAAE,OAAS,EACPkd,IAAUpE,GAEZgD,EAAiB9b,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBmb,GAGFC,IAELpb,EAAE,WAEJ8b,EAAiB9b,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBib,EAIJC,EACT,EAOA,SAAS4C,EAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CAEnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,CACd,CAEA,MAAMC,GAAsB,CAE1B,IAAIN,EAAO,EAAG,EAAG,EAAG,EAAGb,EAAc,EACrC,IAAIa,EAAO,EAAG,EAAG,EAAG,EAAGP,EAAY,EACnC,IAAIO,EAAO,EAAG,EAAG,GAAI,EAAGP,EAAY,EACpC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIP,EAAY,EAErC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIJ,EAAY,EACrC,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,EAAY,EACtC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,EAC3C,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,CAC7C,EAMMW,GAAWre,GAAM,CAErBA,EAAE,YAAc,EAAIA,EAAE,OAGtByb,GAAKzb,EAAE,IAAI,EAIXA,EAAE,eAAiBoe,GAAoBpe,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAaoe,GAAoBpe,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAaoe,GAAoBpe,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmBoe,GAAoBpe,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAcqa,EAAY,EAC7Cra,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,CACZ,EAGA,SAASse,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAAS1E,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,IAAI,YAAYQ,GAAY,CAAC,EAC/C,KAAK,UAAa,IAAI,aAAa,EAAIF,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAI,aAAa,EAAIC,GAAW,GAAK,CAAC,EACxDsB,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAI,YAAY7L,GAAW,CAAC,EAI5C,KAAK,KAAO,IAAI,YAAY,EAAIqK,GAAU,CAAC,EAC3CwB,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAI,YAAY,EAAIxB,GAAU,CAAC,EAC5CwB,GAAK,KAAK,KAAK,EAIf,KAAK,QAAU,EAEf,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAChB,KAAK,QAAU,EAEf,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAalB,CAMA,MAAM8C,GAAqBhD,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAMvb,EAAIub,EAAK,MACf,MAAI,CAACvb,GAAKA,EAAE,OAASub,GAASvb,EAAE,SAAWya,IAEbza,EAAE,SAAW0a,IAEb1a,EAAE,SAAW2a,IACb3a,EAAE,SAAW4a,IACb5a,EAAE,SAAW6a,IACb7a,EAAE,SAAW8a,IACb9a,EAAE,SAAW+a,IACb/a,EAAE,SAAWgb,GAClC,EAEF,CACT,EAGMwD,GAAoBjD,GAAS,CAEjC,GAAIgD,GAAkBhD,CAAI,EACxB,OAAOD,GAAIC,EAAMrC,CAAgB,EAGnCqC,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAY5B,GAEjB,MAAM3Z,EAAIub,EAAK,MACf,OAAAvb,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAEAA,EAAE,OAAS,EAAI0a,GAEf1a,EAAE,KAAOya,GAAaM,GACxBQ,EAAK,MAASvb,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAa,GACfsY,GAAStY,CAAC,EACHgZ,CACT,EAGMyF,GAAgBlD,GAAS,CAE7B,MAAMmD,EAAMF,GAAiBjD,CAAI,EACjC,OAAImD,IAAQ1F,GACVqF,GAAQ9C,EAAK,KAAK,EAEbmD,CACT,EAGMC,GAAmB,CAACpD,EAAMqD,IAE1BL,GAAkBhD,CAAI,GAAKA,EAAK,MAAM,OAAS,EAC1CrC,GAETqC,EAAK,MAAM,OAASqD,EACb5F,GAIH6F,GAAe,CAACtD,EAAMuD,EAAOC,EAAQC,EAAYC,EAAUC,IAAa,CAE5E,GAAI,CAAC3D,EACH,OAAOrC,EAET,IAAIiG,EAAO,EAiBX,GAfIL,IAAUzF,KACZyF,EAAQ,GAGNE,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAWpF,IAAiBkF,IAAWnF,IACzDoF,EAAa,GAAKA,EAAa,IAAMF,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EAAWzF,IAAYuF,IAAe,GAAKG,IAAS,EACpE,OAAO7D,GAAIC,EAAMrC,CAAgB,EAI/B8F,IAAe,IACjBA,EAAa,GAIf,MAAM,EAAI,IAAIV,GAEd,OAAA/C,EAAK,MAAQ,EACb,EAAE,KAAOA,EACT,EAAE,OAASd,GAEX,EAAE,KAAO0E,EACT,EAAE,OAAS,KACX,EAAE,OAASH,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAYC,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,GAAG,EAAE,UAAY5E,EAAY,GAAKA,GAElD,EAAE,OAAS,IAAI,WAAW,EAAE,OAAS,CAAC,EACtC,EAAE,KAAO,IAAI,YAAY,EAAE,SAAS,EACpC,EAAE,KAAO,IAAI,YAAY,EAAE,MAAM,EAKjC,EAAE,YAAc,GAAM4E,EAAW,EAyCjC,EAAE,iBAAmB,EAAE,YAAc,EACrC,EAAE,YAAc,IAAI,WAAW,EAAE,gBAAgB,EAIjD,EAAE,QAAU,EAAE,YAGd,EAAE,SAAW,EAAE,YAAc,GAAK,EAMlC,EAAE,MAAQH,EACV,EAAE,SAAWI,EACb,EAAE,OAASH,EAEJN,GAAalD,CAAI,CAC1B,EAEM6D,GAAc,CAAC7D,EAAMuD,IAElBD,GAAatD,EAAMuD,EAAOlF,GAAcE,GAAaC,GAAeL,EAAoB,EAK3F2F,GAAY,CAAC9D,EAAM2B,IAAU,CAEjC,GAAIqB,GAAkBhD,CAAI,GAAK2B,EAAQnE,IAAamE,EAAQ,EAC1D,OAAO3B,EAAOD,GAAIC,EAAMrC,CAAgB,EAAIA,EAG9C,MAAMlZ,EAAIub,EAAK,MAEf,GAAI,CAACA,EAAK,QACLA,EAAK,WAAa,GAAK,CAACA,EAAK,OAC7Bvb,EAAE,SAAWgb,IAAgBkC,IAAUpE,EAC1C,OAAOwC,GAAIC,EAAOA,EAAK,YAAc,EAAKnC,GAAgBF,CAAgB,EAG5E,MAAMoG,EAAYtf,EAAE,WAIpB,GAHAA,EAAE,WAAakd,EAGXld,EAAE,UAAY,GAEhB,GADA6b,EAAcN,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAAvb,EAAE,WAAa,GACRgZ,UAOAuC,EAAK,WAAa,GAAK9E,GAAKyG,CAAK,GAAKzG,GAAK6I,CAAS,GAC7DpC,IAAUpE,EACV,OAAOwC,GAAIC,EAAMnC,EAAa,EAIhC,GAAIpZ,EAAE,SAAWgb,IAAgBO,EAAK,WAAa,EACjD,OAAOD,GAAIC,EAAMnC,EAAa,EAOhC,GAHIpZ,EAAE,SAAWya,IAAcza,EAAE,OAAS,IACxCA,EAAE,OAAS+a,IAET/a,EAAE,SAAWya,GAAY,CAE3B,IAAI8E,EAAU3F,IAAiB5Z,EAAE,OAAS,GAAM,IAAO,EACnDwf,EAAc,GA2BlB,GAzBIxf,EAAE,UAAYuZ,IAAkBvZ,EAAE,MAAQ,EAC5Cwf,EAAc,EACLxf,EAAE,MAAQ,EACnBwf,EAAc,EACLxf,EAAE,QAAU,EACrBwf,EAAc,EAEdA,EAAc,EAEhBD,GAAWC,GAAe,EACtBxf,EAAE,WAAa,IAAKuf,GAAU/E,IAClC+E,GAAU,GAAMA,EAAS,GAEzBvD,GAAYhc,EAAGuf,CAAM,EAGjBvf,EAAE,WAAa,IACjBgc,GAAYhc,EAAGub,EAAK,QAAU,EAAE,EAChCS,GAAYhc,EAAGub,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,EACbvb,EAAE,OAAS+a,GAGXc,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,CAEV,CAED,GAAIhZ,EAAE,SAAW0a,IAMf,GAJAa,EAAK,MAAQ,EACbQ,EAAS/b,EAAG,EAAE,EACd+b,EAAS/b,EAAG,GAAG,EACf+b,EAAS/b,EAAG,CAAC,EACRA,EAAE,OAoBL+b,EAAS/b,GAAIA,EAAE,OAAO,KAAO,EAAI,IACpBA,EAAE,OAAO,KAAO,EAAI,IACnBA,EAAE,OAAO,MAAY,EAAJ,IACjBA,EAAE,OAAO,KAAW,EAAJ,IAChBA,EAAE,OAAO,QAAc,GAAJ,EACvC,EACM+b,EAAS/b,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChC+b,EAAS/b,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvC+b,EAAS/b,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC+b,EAAS/b,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC+b,EAAS/b,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYuZ,IAAkBvZ,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB+b,EAAS/b,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnC+b,EAAS/b,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxC+b,EAAS/b,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACXub,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE9DA,EAAE,QAAU,EACZA,EAAE,OAAS2a,WAzCXoB,EAAS/b,EAAG,CAAC,EACb+b,EAAS/b,EAAG,CAAC,EACb+b,EAAS/b,EAAG,CAAC,EACb+b,EAAS/b,EAAG,CAAC,EACb+b,EAAS/b,EAAG,CAAC,EACb+b,EAAS/b,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYuZ,IAAkBvZ,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB+b,EAAS/b,EAAGqb,EAAO,EACnBrb,EAAE,OAAS+a,GAGXc,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,EA6Bb,GAAIhZ,EAAE,SAAW2a,GAAa,CAC5B,GAAI3a,EAAE,OAAO,MAAqB,CAChC,IAAIyf,EAAMzf,EAAE,QACRod,GAAQpd,EAAE,OAAO,MAAM,OAAS,OAAUA,EAAE,QAChD,KAAOA,EAAE,QAAUod,EAAOpd,EAAE,kBAAkB,CAC5C,IAAI0f,EAAO1f,EAAE,iBAAmBA,EAAE,QAYlC,GATAA,EAAE,YAAY,IAAIA,EAAE,OAAO,MAAM,SAASA,EAAE,QAASA,EAAE,QAAU0f,CAAI,EAAG1f,EAAE,OAAO,EACjFA,EAAE,QAAUA,EAAE,iBAEVA,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,GAGtEzf,EAAE,SAAW0f,EACb7D,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,EAETyG,EAAM,EACNrC,GAAQsC,CACT,CAGD,IAAIC,EAAe,IAAI,WAAW3f,EAAE,OAAO,KAAK,EAGhDA,EAAE,YAAY,IAAI2f,EAAa,SAAS3f,EAAE,QAASA,EAAE,QAAUod,CAAI,EAAGpd,EAAE,OAAO,EAC/EA,EAAE,SAAWod,EAETpd,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,GAGtEzf,EAAE,QAAU,CACb,CACDA,EAAE,OAAS4a,EACZ,CACD,GAAI5a,EAAE,SAAW4a,GAAY,CAC3B,GAAI5a,EAAE,OAAO,KAAoB,CAC/B,IAAIyf,EAAMzf,EAAE,QACRmQ,EACJ,EAAG,CACD,GAAInQ,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,GAGtE5D,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,EAETyG,EAAM,CACP,CAEGzf,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BmQ,EAAMnQ,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CmQ,EAAM,EAER4L,EAAS/b,EAAGmQ,CAAG,CACvB,OAAeA,IAAQ,GAEbnQ,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,GAGtEzf,EAAE,QAAU,CACb,CACDA,EAAE,OAAS6a,EACZ,CACD,GAAI7a,EAAE,SAAW6a,GAAe,CAC9B,GAAI7a,EAAE,OAAO,QAAuB,CAClC,IAAIyf,EAAMzf,EAAE,QACRmQ,EACJ,EAAG,CACD,GAAInQ,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,GAGtE5D,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,EAETyG,EAAM,CACP,CAEGzf,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BmQ,EAAMnQ,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDmQ,EAAM,EAER4L,EAAS/b,EAAGmQ,CAAG,CACvB,OAAeA,IAAQ,GAEbnQ,EAAE,OAAO,MAAQA,EAAE,QAAUyf,IAC/BlE,EAAK,MAAQpD,EAAQoD,EAAK,MAAOvb,EAAE,YAAaA,EAAE,QAAUyf,EAAKA,CAAG,EAGvE,CACDzf,EAAE,OAAS8a,EACZ,CACD,GAAI9a,EAAE,SAAW8a,GAAY,CAC3B,GAAI9a,EAAE,OAAO,KAAM,CACjB,GAAIA,EAAE,QAAU,EAAIA,EAAE,mBACpB6b,EAAcN,CAAI,EACdvb,EAAE,UAAY,GAChB,OAAAA,EAAE,WAAa,GACRgZ,EAGX+C,EAAS/b,EAAGub,EAAK,MAAQ,GAAI,EAC7BQ,EAAS/b,EAAIub,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,CACd,CAKD,GAJAvb,EAAE,OAAS+a,GAGXc,EAAcN,CAAI,EACdvb,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRgZ,CAEV,CAKD,GAAIuC,EAAK,WAAa,GAAKvb,EAAE,YAAc,GACxCkd,IAAUvE,IAAgB3Y,EAAE,SAAWgb,GAAe,CACvD,IAAI4E,EAAS5f,EAAE,QAAU,EAAIid,GAAejd,EAAGkd,CAAK,EACvCld,EAAE,WAAauZ,GAAiBsE,GAAa7d,EAAGkd,CAAK,EACrDld,EAAE,WAAawZ,GAAQoE,GAAY5d,EAAGkd,CAAK,EAC3CkB,GAAoBpe,EAAE,KAAK,EAAE,KAAKA,EAAGkd,CAAK,EAKvD,IAHI0C,IAAWzE,IAAqByE,IAAWxE,MAC7Cpb,EAAE,OAASgb,IAET4E,IAAW3E,GAAgB2E,IAAWzE,GACxC,OAAII,EAAK,YAAc,IACrBvb,EAAE,WAAa,IAGVgZ,EAST,GAAI4G,IAAW1E,KACTgC,IAAUtE,GACZF,GAAU1Y,CAAC,EAEJkd,IAAUnE,KAEjBR,GAAiBvY,EAAG,EAAG,EAAG,EAAK,EAI3Bkd,IAAUrE,KAEZ4C,GAAKzb,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjB6b,EAAcN,CAAI,EACdA,EAAK,YAAc,GACrB,OAAAvb,EAAE,WAAa,GACRgZ,CAGZ,CAED,OAAIkE,IAAUpE,EAAqBE,EAC/BhZ,EAAE,MAAQ,EAAYiZ,IAGtBjZ,EAAE,OAAS,GACb+b,EAAS/b,EAAGub,EAAK,MAAQ,GAAI,EAC7BQ,EAAS/b,EAAIub,EAAK,OAAS,EAAK,GAAI,EACpCQ,EAAS/b,EAAIub,EAAK,OAAS,GAAM,GAAI,EACrCQ,EAAS/b,EAAIub,EAAK,OAAS,GAAM,GAAI,EACrCQ,EAAS/b,EAAGub,EAAK,SAAW,GAAI,EAChCQ,EAAS/b,EAAIub,EAAK,UAAY,EAAK,GAAI,EACvCQ,EAAS/b,EAAIub,EAAK,UAAY,GAAM,GAAI,EACxCQ,EAAS/b,EAAIub,EAAK,UAAY,GAAM,GAAI,IAIxCS,GAAYhc,EAAGub,EAAK,QAAU,EAAE,EAChCS,GAAYhc,EAAGub,EAAK,MAAQ,KAAM,GAGpCM,EAAcN,CAAI,EAIdvb,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAIgZ,EAASC,GACpC,EAGM4G,GAActE,GAAS,CAE3B,GAAIgD,GAAkBhD,CAAI,EACxB,OAAOrC,EAGT,MAAM4G,EAASvE,EAAK,MAAM,OAE1B,OAAAA,EAAK,MAAQ,KAENuE,IAAW/E,GAAaO,GAAIC,EAAMpC,EAAc,EAAIH,CAC7D,EAOM+G,GAAuB,CAACxE,EAAMyE,IAAe,CAEjD,IAAIC,EAAaD,EAAW,OAE5B,GAAIzB,GAAkBhD,CAAI,EACxB,OAAOrC,EAGT,MAAMlZ,EAAIub,EAAK,MACT4D,EAAOnf,EAAE,KAEf,GAAImf,IAAS,GAAMA,IAAS,GAAKnf,EAAE,SAAWya,IAAeza,EAAE,UAC7D,OAAOkZ,EAYT,GARIiG,IAAS,IAEX5D,EAAK,MAAQ3D,GAAU2D,EAAK,MAAOyE,EAAYC,EAAY,CAAC,GAG9DjgB,EAAE,KAAO,EAGLigB,GAAcjgB,EAAE,OAAQ,CACtBmf,IAAS,IAEX1D,GAAKzb,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb,IAAIkgB,EAAU,IAAI,WAAWlgB,EAAE,MAAM,EACrCkgB,EAAQ,IAAIF,EAAW,SAASC,EAAajgB,EAAE,OAAQigB,CAAU,EAAG,CAAC,EACrED,EAAaE,EACbD,EAAajgB,EAAE,MAChB,CAED,MAAMmgB,EAAQ5E,EAAK,SACb6E,EAAO7E,EAAK,QACZ8E,EAAQ9E,EAAK,MAKnB,IAJAA,EAAK,SAAW0E,EAChB1E,EAAK,QAAU,EACfA,EAAK,MAAQyE,EACblD,GAAY9c,CAAC,EACNA,EAAE,WAAaqa,GAAW,CAC/B,IAAI1d,EAAMqD,EAAE,SACRyC,EAAIzC,EAAE,WAAaqa,EAAY,GACnC,GAEEra,EAAE,MAAQ4b,GAAK5b,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM0d,EAAY,CAAC,CAAC,EAExDra,EAAE,KAAKrD,EAAMqD,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAIrD,EAClBA,UACO,EAAE8F,GACXzC,EAAE,SAAWrD,EACbqD,EAAE,UAAYqa,EAAY,EAC1ByC,GAAY9c,CAAC,CACd,CACD,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAcqa,EAAY,EAC7Cra,EAAE,gBAAkB,EACpBub,EAAK,QAAU6E,EACf7E,EAAK,MAAQ8E,EACb9E,EAAK,SAAW4E,EAChBngB,EAAE,KAAOmf,EACFnG,CACT,EAGA,IAAIsH,GAAgBlB,GAChBmB,GAAiB1B,GACjB2B,GAAiB/B,GACjBgC,GAAqBjC,GACrBkC,GAAqB/B,GACrBgC,GAActB,GACduB,GAAef,GACfgB,GAAyBd,GACzBe,GAAc,qCAYdC,GAAc,CACjB,YAAaT,GACb,aAAcC,GACd,aAAcC,GACd,iBAAkBC,GAClB,iBAAkBC,GAClB,QAASC,GACT,WAAYC,GACZ,qBAAsBC,GACtB,YAAaC,EACd,EAEA,MAAME,GAAO,CAACxjB,EAAKyjB,IACV,OAAO,UAAU,eAAe,KAAKzjB,EAAKyjB,CAAG,EAGtD,IAAIC,GAAS,SAAU1jB,EAAkC,CACvD,MAAM2jB,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACvD,KAAOA,EAAQ,QAAQ,CACrB,MAAMC,EAASD,EAAQ,QACvB,GAAKC,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,UAAW9jB,KAAK8jB,EACVJ,GAAKI,EAAQ9jB,CAAC,IAChBE,EAAIF,CAAC,EAAI8jB,EAAO9jB,CAAC,GAGtB,CAED,OAAOE,CACT,EAII6jB,GAAiBC,GAAW,CAE9B,IAAI3Y,EAAM,EAEV,QAAS,EAAI,EAAG9I,EAAIyhB,EAAO,OAAQ,EAAIzhB,EAAG,IACxC8I,GAAO2Y,EAAO,CAAC,EAAE,OAInB,MAAM5oB,EAAS,IAAI,WAAWiQ,CAAG,EAEjC,QAAS,EAAI,EAAGY,EAAM,EAAG1J,EAAIyhB,EAAO,OAAQ,EAAIzhB,EAAG,IAAK,CACtD,IAAI0hB,EAAQD,EAAO,CAAC,EACpB5oB,EAAO,IAAI6oB,EAAOhY,CAAG,EACrBA,GAAOgY,EAAM,MACd,CAED,OAAO7oB,CACT,EAEI8oB,GAAS,CACZ,OAAQN,GACR,cAAeG,EAChB,EAUA,IAAII,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,IAAI,WAAW,CAAC,CAAC,CAAI,MAAY,CAAEA,GAAmB,EAAQ,CAMpG,MAAMC,GAAW,IAAI,WAAW,GAAG,EACnC,QAASC,EAAI,EAAGA,EAAI,IAAKA,IACvBD,GAASC,CAAC,EAAKA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EAE5FD,GAAS,GAAG,EAAIA,GAAS,GAAG,EAAI,EAIhC,IAAIE,GAAcjlB,GAAQ,CACxB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAG,EAGrC,IAAIkK,EAAKlP,EAAGkqB,EAAIC,EAAOliB,EAAGmiB,EAAUplB,EAAI,OAAQqlB,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/BnqB,EAAIgF,EAAI,WAAWmlB,CAAK,GACnBnqB,EAAI,SAAY,OAAWmqB,EAAQ,EAAIC,IAC1CF,EAAKllB,EAAI,WAAWmlB,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlqB,EAAI,OAAYA,EAAI,OAAW,KAAOkqB,EAAK,OAC3CC,MAGJE,GAAWrqB,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHAkP,EAAM,IAAI,WAAWmb,CAAO,EAGvBpiB,EAAI,EAAGkiB,EAAQ,EAAGliB,EAAIoiB,EAASF,IAClCnqB,EAAIgF,EAAI,WAAWmlB,CAAK,GACnBnqB,EAAI,SAAY,OAAWmqB,EAAQ,EAAIC,IAC1CF,EAAKllB,EAAI,WAAWmlB,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBlqB,EAAI,OAAYA,EAAI,OAAW,KAAOkqB,EAAK,OAC3CC,MAGAnqB,EAAI,IAENkP,EAAIjH,GAAG,EAAIjI,EACFA,EAAI,MAEbkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,EACzBkP,EAAIjH,GAAG,EAAI,IAAQjI,EAAI,IACdA,EAAI,OAEbkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,GACzBkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,EAAI,GAC7BkP,EAAIjH,GAAG,EAAI,IAAQjI,EAAI,KAGvBkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,GACzBkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,GAAK,GAC9BkP,EAAIjH,GAAG,EAAI,IAAQjI,IAAM,EAAI,GAC7BkP,EAAIjH,GAAG,EAAI,IAAQjI,EAAI,IAI3B,OAAOkP,CACT,EAGA,MAAMob,GAAgB,CAACpb,EAAK8B,IAAQ,CAIlC,GAAIA,EAAM,OACJ9B,EAAI,UAAY4a,GAClB,OAAO,OAAO,aAAa,MAAM,KAAM5a,EAAI,SAAW8B,EAAM9B,EAAMA,EAAI,SAAS,EAAG8B,CAAG,CAAC,EAI1F,IAAIjQ,EAAS,GACb,QAAS,EAAI,EAAG,EAAIiQ,EAAK,IACvBjQ,GAAU,OAAO,aAAamO,EAAI,CAAC,CAAC,EAEtC,OAAOnO,CACT,EAIA,IAAIwpB,GAAa,CAACrb,EAAKsb,IAAQ,CAC7B,MAAMxZ,EAAMwZ,GAAOtb,EAAI,OAEvB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAa,EAAC,OAAOA,EAAI,SAAS,EAAGsb,CAAG,CAAC,EAGtD,IAAI,EAAGjb,EAKP,MAAMkb,EAAW,IAAI,MAAMzZ,EAAM,CAAC,EAElC,IAAKzB,EAAM,EAAG,EAAI,EAAG,EAAIyB,GAAM,CAC7B,IAAIhR,EAAIkP,EAAI,GAAG,EAEf,GAAIlP,EAAI,IAAM,CAAEyqB,EAASlb,GAAK,EAAIvP,EAAG,QAAW,CAEhD,IAAI0qB,EAAQX,GAAS/pB,CAAC,EAEtB,GAAI0qB,EAAQ,EAAG,CAAED,EAASlb,GAAK,EAAI,MAAQ,GAAKmb,EAAQ,EAAG,QAAW,CAKtE,IAFA1qB,GAAK0qB,IAAU,EAAI,GAAOA,IAAU,EAAI,GAAO,EAExCA,EAAQ,GAAK,EAAI1Z,GACtBhR,EAAKA,GAAK,EAAMkP,EAAI,GAAG,EAAI,GAC3Bwb,IAIF,GAAIA,EAAQ,EAAG,CAAED,EAASlb,GAAK,EAAI,MAAQ,QAAW,CAElDvP,EAAI,MACNyqB,EAASlb,GAAK,EAAIvP,GAElBA,GAAK,MACLyqB,EAASlb,GAAK,EAAI,MAAWvP,GAAK,GAAM,KACxCyqB,EAASlb,GAAK,EAAI,MAAUvP,EAAI,KAEnC,CAED,OAAOsqB,GAAcG,EAAUlb,CAAG,CACpC,EASIob,GAAa,CAACzb,EAAKsb,IAAQ,CAE7BA,EAAMA,GAAOtb,EAAI,OACbsb,EAAMtb,EAAI,SAAUsb,EAAMtb,EAAI,QAGlC,IAAI0C,EAAM4Y,EAAM,EAChB,KAAO5Y,GAAO,IAAM1C,EAAI0C,CAAG,EAAI,OAAU,KAAQA,IAQjD,OAJIA,EAAM,GAINA,IAAQ,EAAY4Y,EAEhB5Y,EAAMmY,GAAS7a,EAAI0C,CAAG,CAAC,EAAI4Y,EAAO5Y,EAAM4Y,CAClD,EAEII,GAAU,CACb,WAAYX,GACZ,WAAYM,GACZ,WAAYI,EACb,EAqBA,SAASE,IAAU,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,CACf,CAEA,IAAIC,GAAUD,GAEd,MAAME,GAAa,OAAO,UAAU,SAK9B,CACJ,WAAYC,GAAc,aAAAC,GAAc,aAAAC,GAAc,SAAUC,GAChE,KAAMC,GAAQ,aAAcC,GAC5B,sBAAAC,GACA,mBAAAC,GACA,WAAYC,EACd,EAAI9K,GA0FJ,SAAS+K,GAAUrvB,EAAS,CAC1B,KAAK,QAAUytB,GAAO,OAAO,CAC3B,MAAOyB,GACP,OAAQE,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAUD,EACd,EAAKnvB,GAAW,CAAA,CAAE,EAEhB,IAAIoV,EAAM,KAAK,QAEXA,EAAI,KAAQA,EAAI,WAAa,EAC/BA,EAAI,WAAa,CAACA,EAAI,WAGfA,EAAI,MAASA,EAAI,WAAa,GAAOA,EAAI,WAAa,KAC7DA,EAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,IAAIsZ,GAChB,KAAK,KAAK,UAAY,EAEtB,IAAI3C,EAASiB,GAAY,aACvB,KAAK,KACL5X,EAAI,MACJA,EAAI,OACJA,EAAI,WACJA,EAAI,SACJA,EAAI,QACR,EAEE,GAAI2W,IAAWiD,GACb,MAAM,IAAI,MAAM3K,GAAS0H,CAAM,CAAC,EAOlC,GAJI3W,EAAI,QACN4X,GAAY,iBAAiB,KAAK,KAAM5X,EAAI,MAAM,EAGhDA,EAAI,WAAY,CAClB,IAAIka,EAaJ,GAXI,OAAOla,EAAI,YAAe,SAE5Bka,EAAOd,GAAQ,WAAWpZ,EAAI,UAAU,EAC/BuZ,GAAW,KAAKvZ,EAAI,UAAU,IAAM,uBAC7Cka,EAAO,IAAI,WAAWla,EAAI,UAAU,EAEpCka,EAAOla,EAAI,WAGb2W,EAASiB,GAAY,qBAAqB,KAAK,KAAMsC,CAAI,EAErDvD,IAAWiD,GACb,MAAM,IAAI,MAAM3K,GAAS0H,CAAM,CAAC,EAGlC,KAAK,UAAY,EAClB,CACH,CAwBAsD,GAAU,UAAU,KAAO,SAAUxqB,EAAM0qB,EAAY,CACrD,MAAM/H,EAAO,KAAK,KACZgI,EAAY,KAAK,QAAQ,UAC/B,IAAIzD,EAAQ0D,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBIF,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAOR,GAAaH,GAGlD,OAAO/pB,GAAS,SAElB2iB,EAAK,MAAQgH,GAAQ,WAAW3pB,CAAI,EAC3B8pB,GAAW,KAAK9pB,CAAI,IAAM,uBACnC2iB,EAAK,MAAQ,IAAI,WAAW3iB,CAAI,EAEhC2iB,EAAK,MAAQ3iB,EAGf2iB,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAQP,GAPIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWgI,CAAS,EACtChI,EAAK,SAAW,EAChBA,EAAK,UAAYgI,IAIdC,IAAgBZ,IAAgBY,IAAgBX,KAAiBtH,EAAK,WAAa,EAAG,CACzF,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACD,CAKD,GAHAuE,EAASiB,GAAY,QAAQxF,EAAMiI,CAAW,EAG1C1D,IAAWkD,GACb,OAAIzH,EAAK,SAAW,GAClB,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAEpDuE,EAASiB,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAMjB,CAAM,EACjB,KAAK,MAAQ,GACNA,IAAWiD,GAIpB,GAAIxH,EAAK,YAAc,EAAG,CACxB,KAAK,OAAOA,EAAK,MAAM,EACvB,QACD,CAGD,GAAIiI,EAAc,GAAKjI,EAAK,SAAW,EAAG,CACxC,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACD,CAED,GAAIA,EAAK,WAAa,EAAG,KAC1B,CAED,MAAO,EACT,EAUA6H,GAAU,UAAU,OAAS,SAAU7B,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYA6B,GAAU,UAAU,MAAQ,SAAUtD,EAAQ,CAExCA,IAAWiD,KACb,KAAK,OAASvB,GAAO,cAAc,KAAK,MAAM,GAEhD,KAAK,OAAS,GACd,KAAK,IAAM1B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EAmCA,SAAS2D,GAAUpD,EAAOtsB,EAAS,CACjC,MAAM2vB,EAAW,IAAIN,GAAUrvB,CAAO,EAKtC,GAHA2vB,EAAS,KAAKrD,EAAO,EAAI,EAGrBqD,EAAS,IAAO,MAAMA,EAAS,KAAOtL,GAASsL,EAAS,GAAG,EAE/D,OAAOA,EAAS,MAClB,CAWA,SAASC,GAAatD,EAAOtsB,EAAS,CACpC,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,IAAM,GACP0vB,GAAUpD,EAAOtsB,CAAO,CACjC,CAWA,SAAS6vB,GAAOvD,EAAOtsB,EAAS,CAC9B,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,KAAO,GACR0vB,GAAUpD,EAAOtsB,CAAO,CACjC,CAGA,IAAI8vB,GAAcT,GACdU,GAAYL,GACZM,GAAiBJ,GACjBK,GAAWJ,GACXK,GAAc5L,GAEd6L,GAAc,CACjB,QAASL,GACT,QAASC,GACT,WAAYC,GACZ,KAAMC,GACN,UAAWC,EACZ,EAsBA,MAAME,GAAQ,MACRC,GAAS,MAqCf,IAAIC,GAAU,SAAsB9I,EAAMtW,EAAO,CAC/C,IAAIqf,EACAtN,EACAuN,EACA9E,EACAva,EAEAsf,EAEA7I,EACA8I,EACAC,EAEAC,EACAC,EACA9U,EACA+U,EACA1V,EACA2V,EACAC,EACAC,EACAC,EAEAtc,EACAkL,EACAqR,EACAC,EAGA9E,EAAO+E,EAGX,MAAMC,EAAQ9J,EAAK,MAEnB+I,EAAM/I,EAAK,QACX8E,EAAQ9E,EAAK,MACbvE,EAAOsN,GAAO/I,EAAK,SAAW,GAC9BgJ,EAAOhJ,EAAK,SACZ6J,EAAS7J,EAAK,OACdkE,EAAM8E,GAAQtf,EAAQsW,EAAK,WAC3BrW,EAAMqf,GAAQhJ,EAAK,UAAY,KAE/BiJ,EAAOa,EAAM,KAEb1J,EAAQ0J,EAAM,MACdZ,EAAQY,EAAM,MACdX,EAAQW,EAAM,MACdV,EAAWU,EAAM,OACjBT,EAAOS,EAAM,KACbvV,EAAOuV,EAAM,KACbR,EAAQQ,EAAM,QACdlW,EAAQkW,EAAM,SACdP,GAAS,GAAKO,EAAM,SAAW,EAC/BN,GAAS,GAAKM,EAAM,UAAY,EAMhCC,EACA,EAAG,CACGxV,EAAO,KACT8U,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,EACR8U,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,GAGVkV,EAAOH,EAAMD,EAAOE,CAAK,EAEzBS,EACA,OAAS,CAKP,GAJAN,EAAKD,IAAS,GACdJ,KAAUK,EACVnV,GAAQmV,EACRA,EAAMD,IAAS,GAAM,IACjBC,IAAO,EAITG,EAAOb,GAAM,EAAIS,EAAO,cAEjBC,EAAK,GAAI,CAChBtc,EAAMqc,EAAO,MACbC,GAAM,GACFA,IACEnV,EAAOmV,IACTL,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,GAEVnH,GAAOic,GAAS,GAAKK,GAAM,EAC3BL,KAAUK,EACVnV,GAAQmV,GAGNnV,EAAO,KACT8U,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,EACR8U,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,GAEVkV,EAAO7V,EAAMyV,EAAOG,CAAK,EAEzBS,EACA,OAAS,CAMP,GALAP,EAAKD,IAAS,GACdJ,KAAUK,EACVnV,GAAQmV,EACRA,EAAMD,IAAS,GAAM,IAEjBC,EAAK,GAAI,CAaX,GAZApR,EAAOmR,EAAO,MACdC,GAAM,GACFnV,EAAOmV,IACTL,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,EACJA,EAAOmV,IACTL,GAAQvE,EAAMiE,GAAK,GAAKxU,EACxBA,GAAQ,IAGZ+D,GAAQ+Q,GAAS,GAAKK,GAAM,EAExBpR,EAAO2Q,EAAM,CACfjJ,EAAK,IAAM,gCACX8J,EAAM,KAAOlB,GACb,MAAMmB,CACP,CAMD,GAJAV,KAAUK,EACVnV,GAAQmV,EAERA,EAAKV,EAAO9E,EACR5L,EAAOoR,EAAI,CAEb,GADAA,EAAKpR,EAAOoR,EACRA,EAAKR,GACHY,EAAM,KAAM,CACd9J,EAAK,IAAM,gCACX8J,EAAM,KAAOlB,GACb,MAAMmB,CACP,CA0BH,GAFAJ,EAAO,EACPC,EAAcR,EACVD,IAAU,GAEZ,GADAQ,GAAQvJ,EAAQsJ,EACZA,EAAKtc,EAAK,CACZA,GAAOsc,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO1Q,EACdsR,EAAcC,CACf,UAEMV,EAAQO,GAGf,GAFAC,GAAQvJ,EAAQ+I,EAAQO,EACxBA,GAAMP,EACFO,EAAKtc,EAAK,CACZA,GAAOsc,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GAEX,GADAC,EAAO,EACHR,EAAQ/b,EAAK,CACfsc,EAAKP,EACL/b,GAAOsc,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO1Q,EACdsR,EAAcC,CACf,CACF,UAGDF,GAAQR,EAAQO,EACZA,EAAKtc,EAAK,CACZA,GAAOsc,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO1Q,EACdsR,EAAcC,CACf,CAEH,KAAOzc,EAAM,GACXyc,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnCE,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnCE,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnCvc,GAAO,EAELA,IACFyc,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EAC/Bvc,EAAM,IACRyc,EAAOb,GAAM,EAAIY,EAAYD,GAAM,GAGxC,KACI,CACHA,EAAOX,EAAO1Q,EACd,GACEuR,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9BE,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9BE,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9Bvc,GAAO,QACAA,EAAM,GACXA,IACFyc,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC1Bvc,EAAM,IACRyc,EAAOb,GAAM,EAAIa,EAAOF,GAAM,GAGnC,CACF,SACSD,EAAK,GAIV,CACH1J,EAAK,IAAM,wBACX8J,EAAM,KAAOlB,GACb,MAAMmB,CACP,KARyB,CACxBN,EAAO7V,GAAO6V,EAAO,QAAuBJ,GAAS,GAAKK,GAAM,EAAG,EACnE,SAASO,CACV,CAOD,KACD,CACF,SACSP,EAAK,GAIV,GAAIA,EAAK,GAAI,CAEhBI,EAAM,KAAOjB,GACb,MAAMkB,CACP,KACI,CACH/J,EAAK,IAAM,8BACX8J,EAAM,KAAOlB,GACb,MAAMmB,CACP,KAbyB,CACxBN,EAAOH,GAAOG,EAAO,QAAuBJ,GAAS,GAAKK,GAAM,EAAG,EACnE,SAASM,CACV,CAYD,KACD,CACF,OAAQjB,EAAMtN,GAAQuN,EAAOrf,GAG9ByD,EAAMmH,GAAQ,EACdwU,GAAO3b,EACPmH,GAAQnH,GAAO,EACfic,IAAS,GAAK9U,GAAQ,EAGtByL,EAAK,QAAU+I,EACf/I,EAAK,SAAWgJ,EAChBhJ,EAAK,SAAY+I,EAAMtN,EAAO,GAAKA,EAAOsN,GAAO,GAAKA,EAAMtN,GAC5DuE,EAAK,UAAagJ,EAAOrf,EAAM,KAAOA,EAAMqf,GAAQ,KAAOA,EAAOrf,GAClEmgB,EAAM,KAAOT,EACbS,EAAM,KAAOvV,CAEf,EAqBA,MAAM2V,GAAU,GACVC,GAAgB,IAChBC,GAAiB,IAGjBC,GAAU,EACVC,GAAS,EACTC,GAAU,EAEVC,GAAQ,IAAI,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,CAC/D,CAAC,EAEKC,GAAO,IAAI,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAC1D,CAAC,EAEKC,GAAQ,IAAI,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,CAChC,CAAC,EAEKC,GAAO,IAAI,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,EACtB,CAAC,EAiSD,IAAIC,GA/RkB,CAACxlB,EAAMylB,EAAMC,EAAYC,EAAOrO,EAAOsO,EAAaC,EAAM1e,IAChF,CACE,MAAMgI,EAAOhI,EAAK,KAGlB,IAAIa,EAAM,EACN8d,EAAM,EACNC,EAAM,EAAGvE,EAAM,EACfwE,EAAO,EACPC,EAAO,EACPC,EAAO,EACPzJ,EAAO,EACPE,EAAO,EACPwJ,EAAO,EACPC,EACAC,EACAC,EACAC,EACA9G,EACA1L,EAAO,KAEPzZ,EACJ,MAAM8a,EAAQ,IAAI,YAAY0P,GAAU,CAAC,EACnC0B,EAAO,IAAI,YAAY1B,GAAU,CAAC,EACxC,IAAIhR,EAAQ,KAER2S,EAAWC,EAASC,EAkCxB,IAAK3e,EAAM,EAAGA,GAAO8c,GAAS9c,IAC5BoN,EAAMpN,CAAG,EAAI,EAEf,IAAK8d,EAAM,EAAGA,EAAMH,EAAOG,IACzB1Q,EAAMqQ,EAAKC,EAAaI,CAAG,CAAC,IAK9B,IADAE,EAAO7W,EACFqS,EAAMsD,GAAStD,GAAO,GACrBpM,EAAMoM,CAAG,IAAM,EADSA,IAC5B,CAKF,GAHIwE,EAAOxE,IACTwE,EAAOxE,GAELA,IAAQ,EAIV,OAAAlK,EAAMsO,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAMhDtO,EAAMsO,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAEhDze,EAAK,KAAO,EACL,EAET,IAAK4e,EAAM,EAAGA,EAAMvE,GACdpM,EAAM2Q,CAAG,IAAM,EADIA,IACvB,CAQF,IANIC,EAAOD,IACTC,EAAOD,GAITtJ,EAAO,EACFzU,EAAM,EAAGA,GAAO8c,GAAS9c,IAG5B,GAFAyU,IAAS,EACTA,GAAQrH,EAAMpN,CAAG,EACbyU,EAAO,EACT,MAAO,GAGX,GAAIA,EAAO,IAAMzc,IAASilB,IAAWzD,IAAQ,GAC3C,MAAO,GAKT,IADAgF,EAAK,CAAC,EAAI,EACLxe,EAAM,EAAGA,EAAM8c,GAAS9c,IAC3Bwe,EAAKxe,EAAM,CAAC,EAAIwe,EAAKxe,CAAG,EAAIoN,EAAMpN,CAAG,EAIvC,IAAK8d,EAAM,EAAGA,EAAMH,EAAOG,IACrBL,EAAKC,EAAaI,CAAG,IAAM,IAC7BD,EAAKW,EAAKf,EAAKC,EAAaI,CAAG,CAAC,GAAG,EAAIA,GAiE3C,GA3BI9lB,IAASilB,IACXlR,EAAOD,EAAQ+R,EACfvrB,EAAQ,IAEC0F,IAASklB,IAClBnR,EAAOqR,GACPtR,EAAQuR,GACR/qB,EAAQ,MAGRyZ,EAAOuR,GACPxR,EAAQyR,GACRjrB,EAAQ,GAIV6rB,EAAO,EACPL,EAAM,EACN9d,EAAM+d,EACNtG,EAAOmG,EACPK,EAAOD,EACPE,EAAO,EACPI,EAAM,GACN3J,EAAO,GAAKqJ,EACZO,EAAO5J,EAAO,EAGT3c,IAASklB,IAAUvI,EAAOoI,IAC5B/kB,IAASmlB,IAAWxI,EAAOqI,GAC5B,MAAO,GAIT,OAAS,CAEPyB,EAAYze,EAAMke,EACdL,EAAKC,CAAG,EAAI,EAAIxrB,GAClBosB,EAAU,EACVC,EAAWd,EAAKC,CAAG,GAEZD,EAAKC,CAAG,GAAKxrB,GACpBosB,EAAU5S,EAAM+R,EAAKC,CAAG,EAAIxrB,CAAK,EACjCqsB,EAAW5S,EAAK8R,EAAKC,CAAG,EAAIxrB,CAAK,IAGjCosB,EAAU,GAAK,GACfC,EAAW,GAIbP,EAAO,GAAMpe,EAAMke,EACnBG,EAAO,GAAKJ,EACZF,EAAMM,EACN,GACEA,GAAQD,EACR9O,EAAMmI,GAAQ0G,GAAQD,GAAQG,CAAI,EAAKI,GAAa,GAAOC,GAAW,GAAMC,EAAU,QAC/EN,IAAS,GAIlB,IADAD,EAAO,GAAMpe,EAAM,EACZme,EAAOC,GACZA,IAAS,EAWX,GATIA,IAAS,GACXD,GAAQC,EAAO,EACfD,GAAQC,GAERD,EAAO,EAITL,IACI,EAAE1Q,EAAMpN,CAAG,IAAM,EAAG,CACtB,GAAIA,IAAQwZ,EAAO,MACnBxZ,EAAMyd,EAAKC,EAAaG,EAAKC,CAAG,CAAC,CAClC,CAGD,GAAI9d,EAAMge,IAASG,EAAOI,KAAUD,EAAK,CAYvC,IAVIJ,IAAS,IACXA,EAAOF,GAITvG,GAAQsG,EAGRE,EAAOje,EAAMke,EACbzJ,EAAO,GAAKwJ,EACLA,EAAOC,EAAO1E,IACnB/E,GAAQrH,EAAM6Q,EAAOC,CAAI,EACrB,EAAAzJ,GAAQ,KACZwJ,IACAxJ,IAAS,EAKX,GADAE,GAAQ,GAAKsJ,EACRjmB,IAASklB,IAAUvI,EAAOoI,IAC5B/kB,IAASmlB,IAAWxI,EAAOqI,GAC5B,MAAO,GAITsB,EAAMH,EAAOI,EAIbjP,EAAMgP,CAAG,EAAKN,GAAQ,GAAOC,GAAQ,GAAOxG,EAAOmG,EAAc,CAClE,CACF,CAKD,OAAIO,IAAS,IAIX7O,EAAMmI,EAAO0G,CAAI,EAAMne,EAAMke,GAAS,GAAO,IAAM,GAAK,GAK1D/e,EAAK,KAAO6e,EACL,CACT,EA6BA,MAAMY,GAAQ,EACRC,GAAO,EACPC,GAAQ,EAKR,CACJ,SAAUC,GAAY,QAAAC,GAAS,QAAAC,GAC/B,KAAMC,GAAQ,aAAcC,GAAgB,YAAaC,GAAe,eAAgBC,EAAkB,aAAcC,GAAgB,YAAaC,GAAe,YAAAC,GACpK,WAAAC,EACF,EAAI/P,GAOKgQ,GAAO,MACPC,GAAQ,MACRC,GAAO,MACPC,GAAK,MACLC,GAAQ,MACRC,GAAQ,MACRC,GAAO,MACPC,GAAU,MACVC,GAAO,MACPC,GAAS,MACTC,GAAO,MACHC,EAAO,MACPC,GAAS,MACTC,GAAS,MACTC,GAAQ,MACRC,GAAO,MACPC,GAAQ,MACRC,GAAU,MACVC,GAAW,MACPC,GAAO,MACPC,GAAM,MACNC,GAAS,MACTC,GAAO,MACPC,GAAU,MACVC,GAAQ,MACRC,GAAM,MACdC,GAAQ,MACRC,GAAS,MACTC,GAAO,MACPC,EAAM,MACNC,GAAM,MACNC,GAAO,MAMVC,GAAc,IACdC,GAAe,IAKfC,GAFY,GAKZC,GAAW7I,IAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACXA,EAAI,QAAW,KACfA,EAAI,MAAS,IAIzB,SAAS8I,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EAEZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EAEb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EAEb,KAAK,KAAO,KAGZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,OAAS,KAGd,KAAK,KAAO,EACZ,KAAK,KAAO,EAGZ,KAAK,OAAS,EACd,KAAK,OAAS,EAGd,KAAK,MAAQ,EAGb,KAAK,QAAU,KACf,KAAK,SAAW,KAChB,KAAK,QAAU,EACf,KAAK,SAAW,EAGhB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,KAAO,KAEZ,KAAK,KAAO,IAAI,YAAY,GAAG,EAC/B,KAAK,KAAO,IAAI,YAAY,GAAG,EAO/B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,CACb,CAGA,MAAMC,GAAqBnP,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAM8J,EAAQ9J,EAAK,MACnB,MAAI,CAAC8J,GAASA,EAAM,OAAS9J,GAC3B8J,EAAM,KAAOgD,IAAQhD,EAAM,KAAO+E,GAC3B,EAEF,CACT,EAGMO,GAAoBpP,GAAS,CAEjC,GAAImP,GAAkBnP,CAAI,EAAK,OAAOyM,EACtC,MAAM3C,EAAQ9J,EAAK,MACnB,OAAAA,EAAK,SAAWA,EAAK,UAAY8J,EAAM,MAAQ,EAC/C9J,EAAK,IAAM,GACP8J,EAAM,OACR9J,EAAK,MAAQ8J,EAAM,KAAO,GAE5BA,EAAM,KAAOgD,GACbhD,EAAM,KAAO,EACbA,EAAM,SAAW,EACjBA,EAAM,MAAQ,GACdA,EAAM,KAAO,MACbA,EAAM,KAAO,KACbA,EAAM,KAAO,EACbA,EAAM,KAAO,EAEbA,EAAM,QAAUA,EAAM,OAAS,IAAI,WAAWgF,EAAW,EACzDhF,EAAM,SAAWA,EAAM,QAAU,IAAI,WAAWiF,EAAY,EAE5DjF,EAAM,KAAO,EACbA,EAAM,KAAO,GAENwC,EACT,EAGM+C,GAAgBrP,GAAS,CAE7B,GAAImP,GAAkBnP,CAAI,EAAK,OAAOyM,EACtC,MAAM3C,EAAQ9J,EAAK,MACnB,OAAA8J,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACPsF,GAAiBpP,CAAI,CAE9B,EAGMsP,GAAgB,CAACtP,EAAMyD,IAAe,CAC1C,IAAIG,EAGJ,GAAIuL,GAAkBnP,CAAI,EAAK,OAAOyM,EACtC,MAAM3C,EAAQ9J,EAAK,MAenB,OAZIyD,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,IAGdG,GAAQH,GAAc,GAAK,EACvBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCgJ,GAEL3C,EAAM,SAAW,MAAQA,EAAM,QAAUrG,IAC3CqG,EAAM,OAAS,MAIjBA,EAAM,KAAOlG,EACbkG,EAAM,MAAQrG,EACP4L,GAAarP,CAAI,EAC1B,EAGMuP,GAAe,CAACvP,EAAMyD,IAAe,CAEzC,GAAI,CAACzD,EAAQ,OAAOyM,EAGpB,MAAM3C,EAAQ,IAAIoF,GAIlBlP,EAAK,MAAQ8J,EACbA,EAAM,KAAO9J,EACb8J,EAAM,OAAS,KACfA,EAAM,KAAOgD,GACb,MAAM3J,EAAMmM,GAActP,EAAMyD,CAAU,EAC1C,OAAIN,IAAQmJ,KACVtM,EAAK,MAAQ,MAERmD,CACT,EAGMqM,GAAexP,GAEZuP,GAAavP,EAAMgP,EAAS,EAcrC,IAAIS,GAAS,GAETC,GAAQC,GAGZ,MAAMC,GAAe9F,GAAU,CAG7B,GAAI2F,GAAQ,CACVC,GAAS,IAAI,WAAW,GAAG,EAC3BC,GAAU,IAAI,WAAW,EAAE,EAG3B,IAAIzE,EAAM,EACV,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EAMxC,IAJAN,GAASqB,GAAOnC,EAAM,KAAM,EAAG,IAAK4F,GAAU,EAAG5F,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxEoB,EAAM,EACCA,EAAM,IAAMpB,EAAM,KAAKoB,GAAK,EAAI,EAEvCN,GAASsB,GAAOpC,EAAM,KAAM,EAAG,GAAM6F,GAAS,EAAG7F,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxE2F,GAAS,EACV,CAED3F,EAAM,QAAU4F,GAChB5F,EAAM,QAAU,EAChBA,EAAM,SAAW6F,GACjB7F,EAAM,SAAW,CACnB,EAiBM+F,GAAe,CAAC7P,EAAMxc,EAAKmG,EAAKwa,IAAS,CAE7C,IAAI7L,EACJ,MAAMwR,EAAQ9J,EAAK,MAGnB,OAAI8J,EAAM,SAAW,OACnBA,EAAM,MAAQ,GAAKA,EAAM,MACzBA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EAEdA,EAAM,OAAS,IAAI,WAAWA,EAAM,KAAK,GAIvC3F,GAAQ2F,EAAM,OAChBA,EAAM,OAAO,IAAItmB,EAAI,SAASmG,EAAMmgB,EAAM,MAAOngB,CAAG,EAAG,CAAC,EACxDmgB,EAAM,MAAQ,EACdA,EAAM,MAAQA,EAAM,QAGpBxR,EAAOwR,EAAM,MAAQA,EAAM,MACvBxR,EAAO6L,IACT7L,EAAO6L,GAGT2F,EAAM,OAAO,IAAItmB,EAAI,SAASmG,EAAMwa,EAAMxa,EAAMwa,EAAO7L,CAAI,EAAGwR,EAAM,KAAK,EACzE3F,GAAQ7L,EACJ6L,GAEF2F,EAAM,OAAO,IAAItmB,EAAI,SAASmG,EAAMwa,EAAMxa,CAAG,EAAG,CAAC,EACjDmgB,EAAM,MAAQ3F,EACd2F,EAAM,MAAQA,EAAM,QAGpBA,EAAM,OAASxR,EACXwR,EAAM,QAAUA,EAAM,QAASA,EAAM,MAAQ,GAC7CA,EAAM,MAAQA,EAAM,QAASA,EAAM,OAASxR,KAG7C,CACT,EAGMwX,GAAY,CAAC9P,EAAM2B,IAAU,CAEjC,IAAImI,EACAhF,EAAO+E,EACPhF,EACAkL,EACAjO,EAAMD,EACNwH,EACA9U,EACAwU,EAAKC,EACL7E,EACAwF,EACAC,EACAH,EAAO,EACPoC,EAAWC,EAASC,EAEpBiE,EAAWC,EAASC,EACpB9iB,EACA+V,EACJ,MAAMgN,EAAO,IAAI,WAAW,CAAC,EAC7B,IAAI5jB,EAEArF,EAEJ,MAAMkpB,EACJ,IAAI,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAE,EAGrF,GAAIjB,GAAkBnP,CAAI,GAAK,CAACA,EAAK,QAChC,CAACA,EAAK,OAASA,EAAK,WAAa,EACpC,OAAOyM,EAGT3C,EAAQ9J,EAAK,MACT8J,EAAM,OAAS2D,IAAQ3D,EAAM,KAAO4D,IAIxCqC,EAAM/P,EAAK,SACX6J,EAAS7J,EAAK,OACd6B,EAAO7B,EAAK,UACZ6E,EAAO7E,EAAK,QACZ8E,EAAQ9E,EAAK,MACb8B,EAAO9B,EAAK,SACZqJ,EAAOS,EAAM,KACbvV,EAAOuV,EAAM,KAGbf,EAAMjH,EACNkH,EAAOnH,EACPsB,EAAMmJ,GAEN+D,EACA,OACE,OAAQvG,EAAM,KAAI,CAChB,KAAKgD,GACH,GAAIhD,EAAM,OAAS,EAAG,CACpBA,EAAM,KAAO4D,GACb,KACD,CAED,KAAOnZ,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAED,GAAKuV,EAAM,KAAO,GAAMT,IAAS,MAAQ,CACnCS,EAAM,QAAU,IAClBA,EAAM,MAAQ,IAEhBA,EAAM,MAAQ,EAEdqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQlN,EAAQkN,EAAM,MAAOqG,EAAM,EAAG,CAAC,EAI7C9G,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAOiD,GACb,KACD,CAID,GAHIjD,EAAM,OACRA,EAAM,KAAK,KAAO,IAEhB,EAAEA,EAAM,KAAO,OACdT,EAAO,MAAoB,IAAMA,GAAQ,IAAM,GAAI,CACtDrJ,EAAK,IAAM,yBACX8J,EAAM,KAAO6E,EACb,KACD,CACD,IAAKtF,EAAO,MAAqBwD,GAAY,CAC3C7M,EAAK,IAAM,6BACX8J,EAAM,KAAO6E,EACb,KACD,CASD,GAPAtF,KAAU,EACV9U,GAAQ,EAERnH,GAAOic,EAAO,IAAmB,EAC7BS,EAAM,QAAU,IAClBA,EAAM,MAAQ1c,GAEZA,EAAM,IAAMA,EAAM0c,EAAM,MAAO,CACjC9J,EAAK,IAAM,sBACX8J,EAAM,KAAO6E,EACb,KACD,CAID7E,EAAM,KAAO,GAAKA,EAAM,MAGxBA,EAAM,MAAQ,EAEd9J,EAAK,MAAQ8J,EAAM,MAAQ,EAC3BA,EAAM,KAAOT,EAAO,IAAQkE,GAASE,EAErCpE,EAAO,EACP9U,EAAO,EAEP,MACF,KAAKwY,GAEH,KAAOxY,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAGD,GADAuV,EAAM,MAAQT,GACTS,EAAM,MAAQ,OAAU+C,GAAY,CACvC7M,EAAK,IAAM,6BACX8J,EAAM,KAAO6E,EACb,KACD,CACD,GAAI7E,EAAM,MAAQ,MAAQ,CACxB9J,EAAK,IAAM,2BACX8J,EAAM,KAAO6E,EACb,KACD,CACG7E,EAAM,OACRA,EAAM,KAAK,KAAST,GAAQ,EAAK,GAE9BS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQlN,EAAQkN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAOkD,GAEf,KAAKA,GAEH,KAAOzY,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEGuV,EAAM,OACRA,EAAM,KAAK,KAAOT,GAEfS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzB8G,EAAK,CAAC,EAAK9G,IAAS,GAAM,IAC1B8G,EAAK,CAAC,EAAK9G,IAAS,GAAM,IAC1BS,EAAM,MAAQlN,EAAQkN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAOmD,GAEf,KAAKA,GAEH,KAAO1Y,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEGuV,EAAM,OACRA,EAAM,KAAK,OAAUT,EAAO,IAC5BS,EAAM,KAAK,GAAMT,GAAQ,GAEtBS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQlN,EAAQkN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAOoD,GAEf,KAAKA,GACH,GAAIpD,EAAM,MAAQ,KAAQ,CAExB,KAAOvV,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEDuV,EAAM,OAAST,EACXS,EAAM,OACRA,EAAM,KAAK,UAAYT,GAEpBS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQlN,EAAQkN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACP9U,EAAO,CAER,MACQuV,EAAM,OACbA,EAAM,KAAK,MAAQ,MAErBA,EAAM,KAAOqD,GAEf,KAAKA,GACH,GAAIrD,EAAM,MAAQ,OAChB3F,EAAO2F,EAAM,OACT3F,EAAOrC,IAAQqC,EAAOrC,GACtBqC,IACE2F,EAAM,OACR1c,EAAM0c,EAAM,KAAK,UAAYA,EAAM,OAC9BA,EAAM,KAAK,QAEdA,EAAM,KAAK,MAAQ,IAAI,WAAWA,EAAM,KAAK,SAAS,GAExDA,EAAM,KAAK,MAAM,IACfhF,EAAM,SACJD,EAGAA,EAAOV,CACR,EAED/W,CAChB,GAKiB0c,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQlN,EAAQkN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACR2F,EAAM,QAAU3F,GAEd2F,EAAM,QAAU,MAAMuG,EAE5BvG,EAAM,OAAS,EACfA,EAAM,KAAOsD,GAEf,KAAKA,GACH,GAAItD,EAAM,MAAQ,KAAQ,CACxB,GAAIhI,IAAS,EAAK,MAAMuO,EACxBlM,EAAO,EACP,GAEE/W,EAAM0X,EAAMD,EAAOV,GAAM,EAErB2F,EAAM,MAAQ1c,GACb0c,EAAM,OAAS,QAClBA,EAAM,KAAK,MAAQ,OAAO,aAAa1c,CAAG,SAErCA,GAAO+W,EAAOrC,GAOvB,GALKgI,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQlN,EAAQkN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACJ/W,EAAO,MAAMijB,CAClB,MACQvG,EAAM,OACbA,EAAM,KAAK,KAAO,MAEpBA,EAAM,OAAS,EACfA,EAAM,KAAOuD,GAEf,KAAKA,GACH,GAAIvD,EAAM,MAAQ,KAAQ,CACxB,GAAIhI,IAAS,EAAK,MAAMuO,EACxBlM,EAAO,EACP,GACE/W,EAAM0X,EAAMD,EAAOV,GAAM,EAErB2F,EAAM,MAAQ1c,GACb0c,EAAM,OAAS,QAClBA,EAAM,KAAK,SAAW,OAAO,aAAa1c,CAAG,SAExCA,GAAO+W,EAAOrC,GAMvB,GALKgI,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQlN,EAAQkN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACJ/W,EAAO,MAAMijB,CAClB,MACQvG,EAAM,OACbA,EAAM,KAAK,QAAU,MAEvBA,EAAM,KAAOwD,GAEf,KAAKA,GACH,GAAIxD,EAAM,MAAQ,IAAQ,CAExB,KAAOvV,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAED,GAAKuV,EAAM,KAAO,GAAMT,KAAUS,EAAM,MAAQ,OAAS,CACvD9J,EAAK,IAAM,sBACX8J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACP9U,EAAO,CAER,CACGuV,EAAM,OACRA,EAAM,KAAK,KAASA,EAAM,OAAS,EAAK,EACxCA,EAAM,KAAK,KAAO,IAEpB9J,EAAK,MAAQ8J,EAAM,MAAQ,EAC3BA,EAAM,KAAO2D,EACb,MACF,KAAKF,GAEH,KAAOhZ,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEDyL,EAAK,MAAQ8J,EAAM,MAAQmF,GAAQ5F,CAAI,EAEvCA,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAO0D,GAEf,KAAKA,GACH,GAAI1D,EAAM,WAAa,EAErB,OAAA9J,EAAK,SAAW+P,EAChB/P,EAAK,UAAY6B,EACjB7B,EAAK,QAAU6E,EACf7E,EAAK,SAAW8B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAOvV,EAENiY,GAETxM,EAAK,MAAQ8J,EAAM,MAAQ,EAC3BA,EAAM,KAAO2D,EAEf,KAAKA,EACH,GAAI9L,IAAUyK,IAAWzK,IAAU0K,GAAW,MAAMgE,EAEtD,KAAK3C,GACH,GAAI5D,EAAM,KAAM,CAEdT,KAAU9U,EAAO,EACjBA,GAAQA,EAAO,EAEfuV,EAAM,KAAO0E,GACb,KACD,CAED,KAAOja,EAAO,GAAG,CACf,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAQD,OANAuV,EAAM,KAAQT,EAAO,EAErBA,KAAU,EACV9U,GAAQ,EAGC8U,EAAO,EAAI,CAClB,IAAK,GAGHS,EAAM,KAAO6D,GACb,MACF,IAAK,GAKH,GAJAiC,GAAY9F,CAAK,EAGjBA,EAAM,KAAOmE,GACTtM,IAAU0K,GAAS,CAErBhD,KAAU,EACV9U,GAAQ,EAER,MAAM8b,CACP,CACD,MACF,IAAK,GAGHvG,EAAM,KAAOgE,GACb,MACF,IAAK,GACH9N,EAAK,IAAM,qBACX8J,EAAM,KAAO6E,CAChB,CAEDtF,KAAU,EACV9U,GAAQ,EAER,MACF,KAAKoZ,GAMH,IAJAtE,KAAU9U,EAAO,EACjBA,GAAQA,EAAO,EAGRA,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAED,IAAK8U,EAAO,UAAcA,IAAS,GAAM,OAAS,CAChDrJ,EAAK,IAAM,+BACX8J,EAAM,KAAO6E,EACb,KACD,CASD,GARA7E,EAAM,OAAST,EAAO,MAItBA,EAAO,EACP9U,EAAO,EAEPuV,EAAM,KAAO8D,GACTjM,IAAU0K,GAAW,MAAMgE,EAEjC,KAAKzC,GACH9D,EAAM,KAAO+D,GAEf,KAAKA,GAEH,GADA1J,EAAO2F,EAAM,OACT3F,EAAM,CAGR,GAFIA,EAAOrC,IAAQqC,EAAOrC,GACtBqC,EAAOtC,IAAQsC,EAAOtC,GACtBsC,IAAS,EAAK,MAAMkM,EAExBxG,EAAO,IAAI/E,EAAM,SAASD,EAAMA,EAAOV,CAAI,EAAG4L,CAAG,EAEjDjO,GAAQqC,EACRU,GAAQV,EACRtC,GAAQsC,EACR4L,GAAO5L,EACP2F,EAAM,QAAU3F,EAChB,KACD,CAED2F,EAAM,KAAO2D,EACb,MACF,KAAKK,GAEH,KAAOvZ,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAkBD,GAhBAuV,EAAM,MAAQT,EAAO,IAAmB,IAExCA,KAAU,EACV9U,GAAQ,EAERuV,EAAM,OAAST,EAAO,IAAmB,EAEzCA,KAAU,EACV9U,GAAQ,EAERuV,EAAM,OAAST,EAAO,IAAmB,EAEzCA,KAAU,EACV9U,GAAQ,EAGJuV,EAAM,KAAO,KAAOA,EAAM,MAAQ,GAAI,CACxC9J,EAAK,IAAM,sCACX8J,EAAM,KAAO6E,EACb,KACD,CAGD7E,EAAM,KAAO,EACbA,EAAM,KAAOiE,GAEf,KAAKA,GACH,KAAOjE,EAAM,KAAOA,EAAM,OAAO,CAE/B,KAAOvV,EAAO,GAAG,CACf,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEDuV,EAAM,KAAKsG,EAAMtG,EAAM,MAAM,CAAC,EAAKT,EAAO,EAE1CA,KAAU,EACV9U,GAAQ,CAET,CACD,KAAOuV,EAAM,KAAO,IAClBA,EAAM,KAAKsG,EAAMtG,EAAM,MAAM,CAAC,EAAI,EAapC,GAPAA,EAAM,QAAUA,EAAM,OACtBA,EAAM,QAAU,EAEhBvd,EAAO,CAAE,KAAMud,EAAM,OAAO,EAC5B3G,EAAMyH,GAASoB,GAAOlC,EAAM,KAAM,EAAG,GAAIA,EAAM,QAAS,EAAGA,EAAM,KAAMvd,CAAI,EAC3Eud,EAAM,QAAUvd,EAAK,KAEjB4W,EAAK,CACPnD,EAAK,IAAM,2BACX8J,EAAM,KAAO6E,EACb,KACD,CAED7E,EAAM,KAAO,EACbA,EAAM,KAAOkE,GAEf,KAAKA,GACH,KAAOlE,EAAM,KAAOA,EAAM,KAAOA,EAAM,OAAO,CAC5C,KACEL,EAAOK,EAAM,QAAQT,GAAS,GAAKS,EAAM,SAAW,CAAE,EACtD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAoC,GAActX,IANZ,CAQP,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CAET,CACD,GAAIwX,EAAW,GAEb1C,KAAUwC,EACVtX,GAAQsX,EAER/B,EAAM,KAAKA,EAAM,MAAM,EAAIiC,MAExB,CACH,GAAIA,IAAa,GAAI,CAGnB,IADA7kB,EAAI2kB,EAAY,EACTtX,EAAOrN,GAAG,CACf,GAAI4a,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAMD,GAHA8U,KAAUwC,EACVtX,GAAQsX,EAEJ/B,EAAM,OAAS,EAAG,CACpB9J,EAAK,IAAM,4BACX8J,EAAM,KAAO6E,EACb,KACD,CACDvhB,EAAM0c,EAAM,KAAKA,EAAM,KAAO,CAAC,EAC/B3F,EAAO,GAAKkF,EAAO,GAEnBA,KAAU,EACV9U,GAAQ,CAET,SACQwX,IAAa,GAAI,CAGxB,IADA7kB,EAAI2kB,EAAY,EACTtX,EAAOrN,GAAG,CACf,GAAI4a,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAGD8U,KAAUwC,EACVtX,GAAQsX,EAERze,EAAM,EACN+W,EAAO,GAAKkF,EAAO,GAEnBA,KAAU,EACV9U,GAAQ,CAET,KACI,CAGH,IADArN,EAAI2kB,EAAY,EACTtX,EAAOrN,GAAG,CACf,GAAI4a,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAGD8U,KAAUwC,EACVtX,GAAQsX,EAERze,EAAM,EACN+W,EAAO,IAAMkF,EAAO,KAEpBA,KAAU,EACV9U,GAAQ,CAET,CACD,GAAIuV,EAAM,KAAO3F,EAAO2F,EAAM,KAAOA,EAAM,MAAO,CAChD9J,EAAK,IAAM,4BACX8J,EAAM,KAAO6E,EACb,KACD,CACD,KAAOxK,KACL2F,EAAM,KAAKA,EAAM,MAAM,EAAI1c,CAE9B,CACF,CAGD,GAAI0c,EAAM,OAAS6E,EAAO,MAG1B,GAAI7E,EAAM,KAAK,GAAG,IAAM,EAAG,CACzB9J,EAAK,IAAM,uCACX8J,EAAM,KAAO6E,EACb,KACD,CAcD,GATA7E,EAAM,QAAU,EAEhBvd,EAAO,CAAE,KAAMud,EAAM,OAAO,EAC5B3G,EAAMyH,GAASqB,GAAMnC,EAAM,KAAM,EAAGA,EAAM,KAAMA,EAAM,QAAS,EAAGA,EAAM,KAAMvd,CAAI,EAGlFud,EAAM,QAAUvd,EAAK,KAGjB4W,EAAK,CACPnD,EAAK,IAAM,8BACX8J,EAAM,KAAO6E,EACb,KACD,CAaD,GAXA7E,EAAM,SAAW,EAGjBA,EAAM,SAAWA,EAAM,QACvBvd,EAAO,CAAE,KAAMud,EAAM,QAAQ,EAC7B3G,EAAMyH,GAASsB,GAAOpC,EAAM,KAAMA,EAAM,KAAMA,EAAM,MAAOA,EAAM,SAAU,EAAGA,EAAM,KAAMvd,CAAI,EAG9Fud,EAAM,SAAWvd,EAAK,KAGlB4W,EAAK,CACPnD,EAAK,IAAM,wBACX8J,EAAM,KAAO6E,EACb,KACD,CAGD,GADA7E,EAAM,KAAOmE,GACTtM,IAAU0K,GAAW,MAAMgE,EAEjC,KAAKpC,GACHnE,EAAM,KAAOoE,GAEf,KAAKA,GACH,GAAIpM,GAAQ,GAAKD,GAAQ,IAAK,CAE5B7B,EAAK,SAAW+P,EAChB/P,EAAK,UAAY6B,EACjB7B,EAAK,QAAU6E,EACf7E,EAAK,SAAW8B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAOvV,EAEbuU,GAAQ9I,EAAMgJ,CAAI,EAElB+G,EAAM/P,EAAK,SACX6J,EAAS7J,EAAK,OACd6B,EAAO7B,EAAK,UACZ6E,EAAO7E,EAAK,QACZ8E,EAAQ9E,EAAK,MACb8B,EAAO9B,EAAK,SACZqJ,EAAOS,EAAM,KACbvV,EAAOuV,EAAM,KAGTA,EAAM,OAAS2D,IACjB3D,EAAM,KAAO,IAEf,KACD,CAED,IADAA,EAAM,KAAO,EAEXL,EAAOK,EAAM,QAAQT,GAAS,GAAKS,EAAM,SAAW,CAAE,EACtD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEd,EAAAoC,GAAatX,IANV,CAQP,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CAET,CACD,GAAIuX,GAAY,EAAAA,EAAU,KAAa,CAIrC,IAHAkE,EAAYnE,EACZoE,EAAUnE,EACVoE,EAAWnE,EAETtC,EAAOK,EAAM,QAAQoG,IACX7G,GAAS,GAAM2G,EAAYC,GAAY,IAAoCD,EAAU,EAC/FnE,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAuG,EAAYnE,GAActX,IAPxB,CASP,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CAET,CAED8U,KAAU2G,EACVzb,GAAQyb,EAERlG,EAAM,MAAQkG,CACf,CAOD,GALA3G,KAAUwC,EACVtX,GAAQsX,EAER/B,EAAM,MAAQ+B,EACd/B,EAAM,OAASiC,EACXD,IAAY,EAAG,CAIjBhC,EAAM,KAAOyE,GACb,KACD,CACD,GAAIzC,EAAU,GAAI,CAEhBhC,EAAM,KAAO,GACbA,EAAM,KAAO2D,EACb,KACD,CACD,GAAI3B,EAAU,GAAI,CAChB9L,EAAK,IAAM,8BACX8J,EAAM,KAAO6E,EACb,KACD,CACD7E,EAAM,MAAQgC,EAAU,GACxBhC,EAAM,KAAOqE,GAEf,KAAKA,GACH,GAAIrE,EAAM,MAAO,CAGf,IADA5iB,EAAI4iB,EAAM,MACHvV,EAAOrN,GAAG,CACf,GAAI4a,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEDuV,EAAM,QAAUT,GAAS,GAAKS,EAAM,OAAS,EAE7CT,KAAUS,EAAM,MAChBvV,GAAQuV,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAEDA,EAAM,IAAMA,EAAM,OAClBA,EAAM,KAAOsE,GAEf,KAAKA,GACH,KACE3E,EAAOK,EAAM,SAAST,GAAS,GAAKS,EAAM,UAAY,CAAE,EACxD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAoC,GAActX,IANZ,CAQP,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CAET,CACD,GAAK,EAAAuX,EAAU,KAAa,CAI1B,IAHAkE,EAAYnE,EACZoE,EAAUnE,EACVoE,EAAWnE,EAETtC,EAAOK,EAAM,SAASoG,IACZ7G,GAAS,GAAM2G,EAAYC,GAAY,IAAoCD,EAAU,EAC/FnE,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAuG,EAAYnE,GAActX,IAPxB,CASP,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CAET,CAED8U,KAAU2G,EACVzb,GAAQyb,EAERlG,EAAM,MAAQkG,CACf,CAMD,GAJA3G,KAAUwC,EACVtX,GAAQsX,EAER/B,EAAM,MAAQ+B,EACVC,EAAU,GAAI,CAChB9L,EAAK,IAAM,wBACX8J,EAAM,KAAO6E,EACb,KACD,CACD7E,EAAM,OAASiC,EACfjC,EAAM,MAASgC,EAAW,GAC1BhC,EAAM,KAAOuE,GAEf,KAAKA,GACH,GAAIvE,EAAM,MAAO,CAGf,IADA5iB,EAAI4iB,EAAM,MACHvV,EAAOrN,GAAG,CACf,GAAI4a,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAEDuV,EAAM,QAAUT,GAAS,GAAKS,EAAM,OAAS,EAE7CT,KAAUS,EAAM,MAChBvV,GAAQuV,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAED,GAAIA,EAAM,OAASA,EAAM,KAAM,CAC7B9J,EAAK,IAAM,gCACX8J,EAAM,KAAO6E,EACb,KACD,CAGD7E,EAAM,KAAOwE,GAEf,KAAKA,GACH,GAAIzM,IAAS,EAAK,MAAMwO,EAExB,GADAlM,EAAO6E,EAAOnH,EACViI,EAAM,OAAS3F,EAAM,CAEvB,GADAA,EAAO2F,EAAM,OAAS3F,EAClBA,EAAO2F,EAAM,OACXA,EAAM,KAAM,CACd9J,EAAK,IAAM,gCACX8J,EAAM,KAAO6E,EACb,KACD,CAiBCxK,EAAO2F,EAAM,OACf3F,GAAQ2F,EAAM,MACdH,EAAOG,EAAM,MAAQ3F,GAGrBwF,EAAOG,EAAM,MAAQ3F,EAEnBA,EAAO2F,EAAM,SAAU3F,EAAO2F,EAAM,QACxCF,EAAcE,EAAM,MACrB,MAECF,EAAcC,EACdF,EAAOoG,EAAMjG,EAAM,OACnB3F,EAAO2F,EAAM,OAEX3F,EAAOtC,IAAQsC,EAAOtC,GAC1BA,GAAQsC,EACR2F,EAAM,QAAU3F,EAChB,GACE0F,EAAOkG,GAAK,EAAInG,EAAYD,GAAM,QAC3B,EAAExF,GACP2F,EAAM,SAAW,IAAKA,EAAM,KAAOoE,IACvC,MACF,KAAKK,GACH,GAAI1M,IAAS,EAAK,MAAMwO,EACxBxG,EAAOkG,GAAK,EAAIjG,EAAM,OACtBjI,IACAiI,EAAM,KAAOoE,GACb,MACF,KAAKM,GACH,GAAI1E,EAAM,KAAM,CAEd,KAAOvV,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IAEAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAaD,GAXAyU,GAAQnH,EACR7B,EAAK,WAAagJ,EAClBc,EAAM,OAASd,EACVc,EAAM,KAAO,GAAMd,IACtBhJ,EAAK,MAAQ8J,EAAM,MAEdA,EAAM,MAAQlN,EAAQkN,EAAM,MAAOD,EAAQb,EAAM+G,EAAM/G,CAAI,EAAI3M,GAAUyN,EAAM,MAAOD,EAAQb,EAAM+G,EAAM/G,CAAI,GAGrHA,EAAOnH,EAEFiI,EAAM,KAAO,IAAOA,EAAM,MAAQT,EAAO4F,GAAQ5F,CAAI,KAAOS,EAAM,MAAO,CAC5E9J,EAAK,IAAM,uBACX8J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACP9U,EAAO,CAGR,CACDuV,EAAM,KAAO2E,GAEf,KAAKA,GACH,GAAI3E,EAAM,MAAQA,EAAM,MAAO,CAE7B,KAAOvV,EAAO,IAAI,CAChB,GAAIuN,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAKtQ,EACzBA,GAAQ,CACT,CAED,GAAKuV,EAAM,KAAO,GAAMT,KAAUS,EAAM,MAAQ,YAAa,CAC3D9J,EAAK,IAAM,yBACX8J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACP9U,EAAO,CAGR,CACDuV,EAAM,KAAO4E,GAEf,KAAKA,GACHvL,EAAMoJ,GACN,MAAM8D,EACR,KAAK1B,EACHxL,EAAMuJ,GACN,MAAM2D,EACR,KAAKzB,GACH,OAAOjC,GACT,KAAKkC,GAEL,QACE,OAAOpC,CACV,CAaH,OAAAzM,EAAK,SAAW+P,EAChB/P,EAAK,UAAY6B,EACjB7B,EAAK,QAAU6E,EACf7E,EAAK,SAAW8B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAOvV,GAGTuV,EAAM,OAAUd,IAAShJ,EAAK,WAAa8J,EAAM,KAAO6E,IACvC7E,EAAM,KAAO0E,IAAS7M,IAAUwK,MAC/C0D,GAAa7P,EAAMA,EAAK,OAAQA,EAAK,SAAUgJ,EAAOhJ,EAAK,SAAS,EAE1E+I,GAAO/I,EAAK,SACZgJ,GAAQhJ,EAAK,UACbA,EAAK,UAAY+I,EACjB/I,EAAK,WAAagJ,EAClBc,EAAM,OAASd,EACVc,EAAM,KAAO,GAAMd,IACtBhJ,EAAK,MAAQ8J,EAAM,MAChBA,EAAM,MAAQlN,EAAQkN,EAAM,MAAOD,EAAQb,EAAMhJ,EAAK,SAAWgJ,CAAI,EAAI3M,GAAUyN,EAAM,MAAOD,EAAQb,EAAMhJ,EAAK,SAAWgJ,CAAI,GAEvIhJ,EAAK,UAAY8J,EAAM,MAAQA,EAAM,KAAO,GAAK,IAC9BA,EAAM,OAAS2D,EAAO,IAAM,IAC5B3D,EAAM,OAASmE,IAAQnE,EAAM,OAAS8D,GAAQ,IAAM,IACjE7E,IAAQ,GAAKC,IAAS,GAAMrH,IAAUwK,KAAehJ,IAAQmJ,KACjEnJ,EAAMyJ,IAEDzJ,CACT,EAGMmN,GAActQ,GAAS,CAE3B,GAAImP,GAAkBnP,CAAI,EACxB,OAAOyM,EAGT,IAAI3C,EAAQ9J,EAAK,MACjB,OAAI8J,EAAM,SACRA,EAAM,OAAS,MAEjB9J,EAAK,MAAQ,KACNsM,EACT,EAGMiE,GAAmB,CAACvQ,EAAMqD,IAAS,CAGvC,GAAI8L,GAAkBnP,CAAI,EAAK,OAAOyM,EACtC,MAAM3C,EAAQ9J,EAAK,MACnB,OAAK8J,EAAM,KAAO,GAGlBA,EAAM,KAAOzG,EACbA,EAAK,KAAO,GACLiJ,IAL8BG,CAMvC,EAGM+D,GAAuB,CAACxQ,EAAMyE,IAAe,CACjD,MAAMC,EAAaD,EAAW,OAE9B,IAAIqF,EACA2G,EACAtN,EAMJ,OAHIgM,GAAkBnP,CAAI,IAC1B8J,EAAQ9J,EAAK,MAET8J,EAAM,OAAS,GAAKA,EAAM,OAAS0D,IAC9Bf,EAIL3C,EAAM,OAAS0D,KACjBiD,EAAS,EAETA,EAASpU,GAAUoU,EAAQhM,EAAYC,EAAY,CAAC,EAChD+L,IAAW3G,EAAM,OACZ4C,IAKXvJ,EAAM0M,GAAa7P,EAAMyE,EAAYC,EAAYA,CAAU,EACvDvB,GACF2G,EAAM,KAAO8E,GACNjC,KAET7C,EAAM,SAAW,EAEVwC,IACT,EAGA,IAAIoE,GAAiBrB,GACjBsB,GAAkBrB,GAClBsB,GAAqBxB,GACrByB,GAAgBrB,GAChBsB,GAAiBvB,GACjBwB,GAAcjB,GACdkB,GAAeV,GACfW,GAAqBV,GACrBW,GAAyBV,GACzBW,GAAc,qCAcdC,EAAc,CACjB,aAAcV,GACd,cAAeC,GACf,iBAAkBC,GAClB,YAAaC,GACb,aAAcC,GACd,QAASC,GACT,WAAYC,GACZ,iBAAkBC,GAClB,qBAAsBC,GACtB,YAAaC,EACd,EAqBA,SAASE,IAAW,CAElB,KAAK,KAAa,EAElB,KAAK,KAAa,EAElB,KAAK,OAAa,EAElB,KAAK,GAAa,EAElB,KAAK,MAAa,KAElB,KAAK,UAAa,EAWlB,KAAK,KAAa,GAIlB,KAAK,QAAa,GAIlB,KAAK,KAAa,EAElB,KAAK,KAAa,EACpB,CAEA,IAAIC,GAAWD,GAEf,MAAME,GAAW,OAAO,UAAU,SAK5B,CACJ,WAAAC,GAAY,SAAAC,GACZ,KAAAC,GAAM,aAAAC,GAAc,YAAAC,GAAa,eAAAC,GAAgB,aAAAC,GAAc,YAAAC,EACjE,EAAIjV,GAkFJ,SAASkV,GAAUx5B,EAAS,CAC1B,KAAK,QAAUytB,GAAO,OAAO,CAC3B,UAAW,MACX,WAAY,GACZ,GAAI,EACR,EAAKztB,GAAW,CAAA,CAAE,EAEhB,MAAMoV,EAAM,KAAK,QAIbA,EAAI,KAAQA,EAAI,YAAc,GAAOA,EAAI,WAAa,KACxDA,EAAI,WAAa,CAACA,EAAI,WAClBA,EAAI,aAAe,IAAKA,EAAI,WAAa,MAI1CA,EAAI,YAAc,GAAOA,EAAI,WAAa,IAC3C,EAAEpV,GAAWA,EAAQ,cACvBoV,EAAI,YAAc,IAKfA,EAAI,WAAa,IAAQA,EAAI,WAAa,KAGxCA,EAAI,WAAa,KACpBA,EAAI,YAAc,KAItB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAS,IAAIsZ,GAClB,KAAK,KAAK,UAAY,EAEtB,IAAI3C,EAAU6M,EAAY,aACxB,KAAK,KACLxjB,EAAI,UACR,EAEE,GAAI2W,IAAWmN,GACb,MAAM,IAAI,MAAM7U,GAAS0H,CAAM,CAAC,EAQlC,GALA,KAAK,OAAS,IAAI+M,GAElBF,EAAY,iBAAiB,KAAK,KAAM,KAAK,MAAM,EAG/CxjB,EAAI,aAEF,OAAOA,EAAI,YAAe,SAC5BA,EAAI,WAAaoZ,GAAQ,WAAWpZ,EAAI,UAAU,EACzC2jB,GAAS,KAAK3jB,EAAI,UAAU,IAAM,yBAC3CA,EAAI,WAAa,IAAI,WAAWA,EAAI,UAAU,GAE5CA,EAAI,MACN2W,EAAS6M,EAAY,qBAAqB,KAAK,KAAMxjB,EAAI,UAAU,EAC/D2W,IAAWmN,KACb,MAAM,IAAI,MAAM7U,GAAS0H,CAAM,CAAC,CAIxC,CA2BAyN,GAAU,UAAU,KAAO,SAAU30B,EAAM0qB,EAAY,CACrD,MAAM/H,EAAO,KAAK,KACZgI,EAAY,KAAK,QAAQ,UACzBvD,EAAa,KAAK,QAAQ,WAChC,IAAIF,EAAQ0D,EAAagK,EAEzB,GAAI,KAAK,MAAO,MAAO,GAevB,IAbIlK,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAO0J,GAAWD,GAGhDD,GAAS,KAAKl0B,CAAI,IAAM,uBAC1B2iB,EAAK,MAAQ,IAAI,WAAW3iB,CAAI,EAEhC2iB,EAAK,MAAQ3iB,EAGf2iB,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAqBP,IApBIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWgI,CAAS,EACtChI,EAAK,SAAW,EAChBA,EAAK,UAAYgI,GAGnBzD,EAAS6M,EAAY,QAAQpR,EAAMiI,CAAW,EAE1C1D,IAAWqN,IAAenN,IAC5BF,EAAS6M,EAAY,qBAAqBpR,EAAMyE,CAAU,EAEtDF,IAAWmN,GACbnN,EAAS6M,EAAY,QAAQpR,EAAMiI,CAAW,EACrC1D,IAAWuN,KAEpBvN,EAASqN,KAKN5R,EAAK,SAAW,GAChBuE,IAAWoN,IACX3R,EAAK,MAAM,KAAO,GAClB3iB,EAAK2iB,EAAK,OAAO,IAAM,GAE5BoR,EAAY,aAAapR,CAAI,EAC7BuE,EAAS6M,EAAY,QAAQpR,EAAMiI,CAAW,EAGhD,OAAQ1D,EAAM,CACZ,KAAKsN,GACL,KAAKC,GACL,KAAKF,GACL,KAAKG,GACH,YAAK,MAAMxN,CAAM,EACjB,KAAK,MAAQ,GACN,EACV,CAMD,GAFA0N,EAAiBjS,EAAK,UAElBA,EAAK,WACHA,EAAK,YAAc,GAAKuE,IAAWoN,IAErC,GAAI,KAAK,QAAQ,KAAO,SAAU,CAEhC,IAAIO,EAAgBlL,GAAQ,WAAWhH,EAAK,OAAQA,EAAK,QAAQ,EAE7DmS,EAAOnS,EAAK,SAAWkS,EACvBE,EAAUpL,GAAQ,WAAWhH,EAAK,OAAQkS,CAAa,EAG3DlS,EAAK,SAAWmS,EAChBnS,EAAK,UAAYgI,EAAYmK,EACzBA,GAAMnS,EAAK,OAAO,IAAIA,EAAK,OAAO,SAASkS,EAAeA,EAAgBC,CAAI,EAAG,CAAC,EAEtF,KAAK,OAAOC,CAAO,CAE7B,MACU,KAAK,OAAOpS,EAAK,OAAO,SAAWA,EAAK,SAAWA,EAAK,OAASA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAM7G,GAAI,EAAAuE,IAAWmN,IAAQO,IAAmB,GAG1C,IAAI1N,IAAWoN,GACb,OAAApN,EAAS6M,EAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAM7M,CAAM,EACjB,KAAK,MAAQ,GACN,GAGT,GAAIvE,EAAK,WAAa,EAAG,MAC1B,CAED,MAAO,EACT,EAWAgS,GAAU,UAAU,OAAS,SAAUhM,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYAgM,GAAU,UAAU,MAAQ,SAAUzN,EAAQ,CAExCA,IAAWmN,KACT,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAS,KAAK,OAAO,KAAK,EAAE,EAEjC,KAAK,OAASzL,GAAO,cAAc,KAAK,MAAM,GAGlD,KAAK,OAAS,GACd,KAAK,IAAM1B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EA0CA,SAAS8N,GAAUvN,EAAOtsB,EAAS,CACjC,MAAM85B,EAAW,IAAIN,GAAUx5B,CAAO,EAKtC,GAHA85B,EAAS,KAAKxN,CAAK,EAGfwN,EAAS,IAAK,MAAMA,EAAS,KAAOzV,GAASyV,EAAS,GAAG,EAE7D,OAAOA,EAAS,MAClB,CAWA,SAASC,GAAazN,EAAOtsB,EAAS,CACpC,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,IAAM,GACP65B,GAAUvN,EAAOtsB,CAAO,CACjC,CAaA,IAAIg6B,GAAcR,GACdS,GAAYJ,GACZK,GAAiBH,GACjBI,GAAWN,GACXO,GAAY9V,GAEZ+V,GAAc,CACjB,QAASL,GACT,QAASC,GACT,WAAYC,GACZ,OAAQC,GACR,UAAWC,EACZ,EAEA,KAAM,CAAE,QAAAE,GAAS,QAAAC,GAAS,WAAAC,GAAY,KAAAC,EAAI,EAAKtK,GAEzC,CAAE,QAAAuK,GAAS,QAAAC,GAAS,WAAAC,GAAY,OAAAC,EAAM,EAAKR,GAIjD,IAAIS,GAAYR,GACZS,GAAYR,GACZS,GAAeR,GACfS,GAASR,GACTS,GAAYR,GACZS,GAAYR,GACZS,GAAeR,GACfS,GAAWR,GACXS,GAAchX,GAEdiX,GAAO,CACV,QAAST,GACT,QAASC,GACT,WAAYC,GACZ,KAAMC,GACN,QAASC,GACT,QAASC,GACT,WAAYC,GACZ,OAAQC,GACR,UAAWC,EACZ,ECvtNA,MAAME,EAAO,CAAA,EAEbA,EAAK,QAAU,SAAUroB,EAAK,CAC5B,MAAM6M,EAAI7M,EAAI,MACRyN,EAAIzN,EAAI,OACd,GAAIA,EAAI,KAAK,OAAS,KACpB,MAAO,CAACqoB,EAAK,QAAQ,YAAYroB,EAAI,KAAM6M,EAAGY,EAAGzN,CAAG,EAAE,MAAM,EAE9D,MAAMsoB,EAAO,CAAA,EACTtoB,EAAI,OAAO,CAAC,EAAE,OAAS,OAAMA,EAAI,OAAO,CAAC,EAAE,KAAOA,EAAI,MAC1D,MAAMyB,EAAMoL,EAAIY,EAAI,EACd8a,EAAM,IAAI,WAAW9mB,CAAG,EACxB+mB,EAAQ,IAAI,WAAW/mB,CAAG,EAC1BiB,EAAO,IAAI,WAAWjB,CAAG,EAC/B,QAAS/I,EAAI,EAAGA,EAAIsH,EAAI,OAAO,OAAQtH,IAAK,CAC1C,MAAM+vB,EAAMzoB,EAAI,OAAOtH,CAAC,EAClBgwB,EAAKD,EAAI,KAAK,EACdE,EAAKF,EAAI,KAAK,EACdG,EAAKH,EAAI,KAAK,MACdI,EAAKJ,EAAI,KAAK,OACdK,EAAQT,EAAK,QAAQ,YAAYI,EAAI,KAAMG,EAAIC,EAAI7oB,CAAG,EAE5D,GAAItH,IAAM,EAAG,QAASmL,EAAI,EAAGA,EAAIpC,EAAKoC,IAAKnB,EAAKmB,CAAC,EAAI0kB,EAAI1kB,CAAC,EAQ1D,GANI4kB,EAAI,QAAU,EAAGJ,EAAK,UAAUS,EAAOF,EAAIC,EAAIN,EAAK1b,EAAGY,EAAGib,EAAIC,EAAI,CAAC,EAC9DF,EAAI,QAAU,GACrBJ,EAAK,UAAUS,EAAOF,EAAIC,EAAIN,EAAK1b,EAAGY,EAAGib,EAAIC,EAAI,CAAC,EAEpDL,EAAK,KAAKC,EAAI,OAAO,MAAM,CAAC,CAAC,EAEzBE,EAAI,UAAY,EAAGJ,EAAK,UAAUG,EAAOI,EAAIC,EAAIN,EAAK1b,EAAGY,EAAGib,EAAIC,EAAI,CAAC,UAChEF,EAAI,UAAY,EAAG,QAAS5kB,EAAI,EAAGA,EAAIpC,EAAKoC,IAAK0kB,EAAI1kB,CAAC,EAAInB,EAAKmB,CAAC,CAC1E,CACD,OAAOykB,CACT,EACAD,EAAK,QAAQ,YAAc,SAAU32B,EAAMmb,EAAGY,EAAGzN,EAAK,CACpD,MAAM+oB,EAAOlc,EAAIY,EACXub,EAAMX,EAAK,OAAO,QAAQroB,CAAG,EAC7BipB,EAAM,KAAK,KAAMpc,EAAImc,EAAO,CAAC,EAE7BE,EAAK,IAAI,WAAWH,EAAO,CAAC,EAC5BI,EAAO,IAAI,YAAYD,EAAG,MAAM,EAChCE,EAAQppB,EAAI,MACZiO,EAAQjO,EAAI,MACZqpB,EAAKhB,EAAK,KAAK,WAErB,GAAIe,IAAU,EAAG,CAEf,MAAME,EAAQP,GAAQ,EACtB,GAAI9a,IAAU,EACZ,QAASvV,EAAI,EAAGA,EAAI4wB,EAAO5wB,GAAK,EAC9BwwB,EAAGxwB,CAAC,EAAIhH,EAAKgH,CAAC,EACdwwB,EAAGxwB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EACtBwwB,EAAGxwB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EACtBwwB,EAAGxwB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EAE1B,GAAIuV,IAAU,GACZ,QAASvV,EAAI,EAAGA,EAAI4wB,EAAO5wB,IACzBwwB,EAAGxwB,CAAC,EAAIhH,EAAKgH,GAAK,CAAC,CAE3B,SAAa0wB,IAAU,EAAG,CAEtB,MAAMG,EAAKvpB,EAAI,KAAK,KACpB,GAAIupB,IAAO,KAAM,CACf,GAAItb,IAAU,EACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAM8wB,EAAK9wB,EAAI,EACfywB,EAAKzwB,CAAC,EACH,UAAchH,EAAK83B,EAAK,CAAC,GAAK,GAAO93B,EAAK83B,EAAK,CAAC,GAAK,EAAK93B,EAAK83B,CAAE,CACrE,CACH,GAAIvb,IAAU,GACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAM8wB,EAAK9wB,EAAI,EACfywB,EAAKzwB,CAAC,EACH,UAAchH,EAAK83B,EAAK,CAAC,GAAK,GAAO93B,EAAK83B,EAAK,CAAC,GAAK,EAAK93B,EAAK83B,CAAE,CACrE,CACT,KAAW,CACL,MAAMC,EAAKF,EAAG,CAAC,EACTG,EAAKH,EAAG,CAAC,EACTI,EAAKJ,EAAG,CAAC,EACf,GAAItb,IAAU,EACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAMkxB,EAAKlxB,GAAK,EACV8wB,EAAK9wB,EAAI,EACfywB,EAAKzwB,CAAC,EACH,UAAchH,EAAK83B,EAAK,CAAC,GAAK,GAAO93B,EAAK83B,EAAK,CAAC,GAAK,EAAK93B,EAAK83B,CAAE,EAChE93B,EAAK83B,CAAE,IAAMC,GAAM/3B,EAAK83B,EAAK,CAAC,IAAME,GAAMh4B,EAAK83B,EAAK,CAAC,IAAMG,IAC7DT,EAAGU,EAAK,CAAC,EAAI,EAChB,CACH,GAAI3b,IAAU,GACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAMkxB,EAAKlxB,GAAK,EACV8wB,EAAK9wB,EAAI,EACfywB,EAAKzwB,CAAC,EACH,UAAchH,EAAK83B,EAAK,CAAC,GAAK,GAAO93B,EAAK83B,EAAK,CAAC,GAAK,EAAK93B,EAAK83B,CAAE,EAElEH,EAAG33B,EAAM83B,CAAE,IAAMC,GACjBJ,EAAG33B,EAAM83B,EAAK,CAAC,IAAME,GACrBL,EAAG33B,EAAM83B,EAAK,CAAC,IAAMG,IAErBT,EAAGU,EAAK,CAAC,EAAI,EAChB,CACJ,CACL,SAAaR,IAAU,EAAG,CAEtB,MAAMhzB,EAAI4J,EAAI,KAAK,KACb6pB,EAAK7pB,EAAI,KAAK,KACdyD,EAAKomB,EAAKA,EAAG,OAAS,EAC5B,GAAI5b,IAAU,EACZ,QAAS6b,EAAI,EAAGA,EAAIrc,EAAGqc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIjd,EACf,QAASnU,EAAI,EAAGA,EAAImU,EAAGnU,IAAK,CAC1B,MAAMkxB,EAAMI,EAAKtxB,GAAM,EACjBmL,EAAKnS,EAAKq4B,GAAMrxB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,EACpDuxB,EAAK,EAAIpmB,EACfqlB,EAAGU,CAAE,EAAIxzB,EAAE6zB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI/lB,EAAIJ,EAAKomB,EAAGhmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIoK,IAAU,EACZ,QAAS6b,EAAI,EAAGA,EAAIrc,EAAGqc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIjd,EACf,QAASnU,EAAI,EAAGA,EAAImU,EAAGnU,IAAK,CAC1B,MAAMkxB,EAAMI,EAAKtxB,GAAM,EACjBmL,EAAKnS,EAAKq4B,GAAMrxB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,EACpDuxB,EAAK,EAAIpmB,EACfqlB,EAAGU,CAAE,EAAIxzB,EAAE6zB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI/lB,EAAIJ,EAAKomB,EAAGhmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIoK,IAAU,EACZ,QAAS6b,EAAI,EAAGA,EAAIrc,EAAGqc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIjd,EACf,QAASnU,EAAI,EAAGA,EAAImU,EAAGnU,IAAK,CAC1B,MAAMkxB,EAAMI,EAAKtxB,GAAM,EACjBmL,EAAKnS,EAAKq4B,GAAMrxB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,GACpDuxB,EAAK,EAAIpmB,EACfqlB,EAAGU,CAAE,EAAIxzB,EAAE6zB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI/lB,EAAIJ,EAAKomB,EAAGhmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIoK,IAAU,EACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAMkxB,EAAKlxB,GAAK,EACVmL,EAAInS,EAAKgH,CAAC,EACVuxB,EAAK,EAAIpmB,EACfqlB,EAAGU,CAAE,EAAIxzB,EAAE6zB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIxzB,EAAE6zB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI/lB,EAAIJ,EAAKomB,EAAGhmB,CAAC,EAAI,GAC/B,CACP,SAAaulB,IAAU,EAAG,CAEtB,GAAInb,IAAU,EACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAMkxB,EAAKlxB,GAAK,EACVwxB,EAAKxxB,GAAK,EACVyxB,EAAKz4B,EAAKw4B,CAAE,EAClBhB,EAAGU,CAAE,EAAIO,EACTjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIl4B,EAAKw4B,EAAK,CAAC,CACzB,CACH,GAAIjc,IAAU,GACZ,QAASvV,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAMkxB,EAAKlxB,GAAK,EACVwxB,EAAKxxB,GAAK,EACVyxB,EAAKz4B,EAAKw4B,CAAE,EAClBhB,EAAGU,CAAE,EAAIO,EACTjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIl4B,EAAKw4B,EAAK,CAAC,CACzB,CACP,SAAad,IAAU,EAAG,CAEtB,MAAMK,EAAKzpB,EAAI,KAAK,KAAOA,EAAI,KAAK,KAAO,GAC3C,QAAS8pB,EAAI,EAAGA,EAAIrc,EAAGqc,IAAK,CAC1B,MAAMjpB,EAAMipB,EAAIb,EACVmB,EAAKN,EAAIjd,EACf,GAAIoB,IAAU,EACZ,QAASzE,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM2gB,EAAK,KAAQz4B,EAAKmP,GAAO2I,IAAM,EAAE,IAAO,GAAKA,EAAI,GAAO,GACxD6gB,EAAKF,IAAOV,EAAK,IAAM,EAAI,IACjCN,EAAKiB,EAAK5gB,CAAC,EAAK6gB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMlc,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM2gB,EACJ,IAAOz4B,EAAKmP,GAAO2I,IAAM,EAAE,IAAO,IAAMA,EAAI,IAAM,GAAO,GACrD6gB,EAAKF,IAAOV,EAAK,GAAK,EAAI,IAChCN,EAAKiB,EAAK5gB,CAAC,EAAK6gB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMlc,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM2gB,EACJ,IAAOz4B,EAAKmP,GAAO2I,IAAM,EAAE,IAAO,IAAMA,EAAI,IAAM,GAAO,IACrD6gB,EAAKF,IAAOV,EAAK,GAAK,EAAI,IAChCN,EAAKiB,EAAK5gB,CAAC,EAAK6gB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMlc,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM2gB,EAAKz4B,EAAKmP,EAAM2I,CAAC,EACjB6gB,EAAKF,IAAOV,EAAK,EAAI,IAC3BN,EAAKiB,EAAK5gB,CAAC,EAAK6gB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMlc,IAAU,GACjB,QAASzE,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM2gB,EAAKz4B,EAAKmP,GAAO2I,GAAK,EAAE,EACxB6gB,EAAKhB,EAAG33B,EAAMmP,GAAO2I,GAAK,EAAE,IAAMigB,EAAK,EAAI,IACjDN,EAAKiB,EAAK5gB,CAAC,EAAK6gB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,CACJ,CACF,CACD,OAAOjB,CACT,EAEAb,EAAK,OAAS,SAAU1mB,EAAM,CAC5B,MAAMjQ,EAAO,IAAI,WAAWiQ,CAAI,EAChC,IAAI2oB,EAAS,EACb,MAAMC,EAAMlC,EAAK,KACXxoB,EAAM0qB,EAAI,WACVzqB,EAAMyqB,EAAI,SACVvqB,EAAM,CAAE,KAAM,CAAE,EAAE,OAAQ,CAAE,CAAA,EAC5BwqB,EAAK,IAAI,WAAW94B,EAAK,MAAM,EACrC,IAAI+4B,EAAO,EACPC,EACAC,EAAO,EAEX,MAAMC,EAAO,CAAC,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAI,EAC5D,QAASlyB,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAIhH,EAAKgH,CAAC,IAAMkyB,EAAKlyB,CAAC,EAAG,KAAM,+BAEjC,KAAO4xB,EAAS54B,EAAK,QAAQ,CAC3B,MAAM+P,EAAM8oB,EAAI,SAAS74B,EAAM44B,CAAM,EACrCA,GAAU,EACV,MAAM7wB,EAAO8wB,EAAI,UAAU74B,EAAM44B,EAAQ,CAAC,EAG1C,GAFAA,GAAU,EAEN7wB,IAAS,OACX4uB,EAAK,OAAO,MAAM32B,EAAM44B,EAAQtqB,CAAG,UAC1BvG,IAAS,OAClBuG,EAAI,KAAKvG,CAAI,EAAI/H,EAAK,MAAM44B,EAAQA,EAAS,CAAC,UACrC7wB,IAAS,OAAQ,CAC1B,QAASf,EAAI,EAAGA,EAAI+I,EAAK/I,IAAK8xB,EAAGC,EAAO/xB,CAAC,EAAIhH,EAAK44B,EAAS5xB,CAAC,EAC5D+xB,GAAQhpB,CACd,SAAehI,IAAS,OAClBuG,EAAI,KAAKvG,CAAI,EAAI,CACf,WAAYqG,EAAIpO,EAAM44B,CAAM,EAC5B,UAAWxqB,EAAIpO,EAAM44B,EAAS,CAAC,CACvC,EACMI,EAAK,IAAI,WAAWh5B,EAAK,MAAM,UACtB+H,IAAS,OAAQ,CAC1B,GAAIkxB,IAAS,EAAG,CACd,MAAME,EAAK7qB,EAAI,OAAOA,EAAI,OAAO,OAAS,CAAC,EAC3C6qB,EAAG,KAAOxC,EAAK,OAAO,YACpBroB,EACA0qB,EAAG,MAAM,EAAGC,CAAI,EAChBE,EAAG,KAAK,MACRA,EAAG,KAAK,MAClB,EACQF,EAAO,CACR,CACD,MAAMG,EAAM,CACV,EAAGhrB,EAAIpO,EAAM44B,EAAS,EAAE,EACxB,EAAGxqB,EAAIpO,EAAM44B,EAAS,EAAE,EACxB,MAAOxqB,EAAIpO,EAAM44B,EAAS,CAAC,EAC3B,OAAQxqB,EAAIpO,EAAM44B,EAAS,CAAC,CACpC,EACM,IAAIS,EAAMlrB,EAAInO,EAAM44B,EAAS,EAAE,EAC/BS,EAAMlrB,EAAInO,EAAM44B,EAAS,EAAE,GAAKS,IAAQ,EAAI,IAAMA,GAClD,MAAMtC,EAAM,CACV,KAAMqC,EACN,MAAO,KAAK,MAAMC,EAAM,GAAI,EAC5B,QAASr5B,EAAK44B,EAAS,EAAE,EACzB,MAAO54B,EAAK44B,EAAS,EAAE,CAC/B,EACMtqB,EAAI,OAAO,KAAKyoB,CAAG,CACzB,SAAehvB,IAAS,OAAQ,CAC1B,QAASf,EAAI,EAAGA,EAAI+I,EAAM,EAAG/I,IAAKgyB,EAAGC,EAAOjyB,CAAC,EAAIhH,EAAK44B,EAAS5xB,EAAI,CAAC,EACpEiyB,GAAQlpB,EAAM,CACpB,SAAehI,IAAS,OAClBuG,EAAI,KAAKvG,CAAI,EAAI,CACf8wB,EAAI,SAAS74B,EAAM44B,CAAM,EACzBC,EAAI,SAAS74B,EAAM44B,EAAS,CAAC,EAC7B54B,EAAK44B,EAAS,CAAC,CACvB,UACe7wB,IAAS,OAAQ,CAC1BuG,EAAI,KAAKvG,CAAI,EAAI,GACjB,QAASf,EAAI,EAAGA,EAAI,EAAGA,IACrBsH,EAAI,KAAKvG,CAAI,EAAE,KAAK8wB,EAAI,SAAS74B,EAAM44B,EAAS5xB,EAAI,CAAC,CAAC,CACzD,SAAUe,IAAS,QAAUA,IAAS,OAAQ,CACzCuG,EAAI,KAAKvG,CAAI,IAAM,OAAMuG,EAAI,KAAKvG,CAAI,EAAI,IAC9C,MAAMuxB,EAAKT,EAAI,SAAS74B,EAAM44B,CAAM,EAC9BW,EAAOV,EAAI,UAAU74B,EAAM44B,EAAQU,EAAKV,CAAM,EACpD,IAAInzB,EACJ,MAAMsM,EAAK6mB,EAAS7oB,EAAMupB,EAAK,EAC/B,GAAIvxB,IAAS,OAAQtC,EAAOozB,EAAI,UAAU74B,EAAMs5B,EAAK,EAAGvnB,CAAE,MACrD,CACH,MAAMynB,EAAM7C,EAAK,OAAO,SAAS32B,EAAK,MAAMs5B,EAAK,EAAGA,EAAK,EAAIvnB,CAAE,CAAC,EAChEtM,EAAOozB,EAAI,SAASW,EAAK,EAAGA,EAAI,MAAM,CACvC,CACDlrB,EAAI,KAAKvG,CAAI,EAAEwxB,CAAI,EAAI9zB,CAC7B,SAAesC,IAAS,OAAQ,CACtBuG,EAAI,KAAKvG,CAAI,GAAK,OAAMuG,EAAI,KAAKvG,CAAI,EAAI,IAC7C,IAAIuxB,EAAK,EACLnqB,EAAMypB,EACVU,EAAKT,EAAI,SAAS74B,EAAMmP,CAAG,EAC3B,MAAMoqB,EAAOV,EAAI,UAAU74B,EAAMmP,EAAKmqB,EAAKnqB,CAAG,EAC9CA,EAAMmqB,EAAK,EACX,MAAMG,EAAQz5B,EAAKmP,CAAG,EAEtBA,GAAO,EACPmqB,EAAKT,EAAI,SAAS74B,EAAMmP,CAAG,EAE3BA,EAAMmqB,EAAK,EACXA,EAAKT,EAAI,SAAS74B,EAAMmP,CAAG,EAE3BA,EAAMmqB,EAAK,EACX,IAAI7zB,EACJ,MAAMsM,EAAKhC,GAAOZ,EAAMypB,GACxB,GAAIa,IAAU,EAAGh0B,EAAOozB,EAAI,SAAS74B,EAAMmP,EAAK4C,CAAE,MAC7C,CACH,MAAMynB,EAAM7C,EAAK,OAAO,SAAS32B,EAAK,MAAMmP,EAAKA,EAAM4C,CAAE,CAAC,EAC1DtM,EAAOozB,EAAI,SAASW,EAAK,EAAGA,EAAI,MAAM,CACvC,CACDlrB,EAAI,KAAKvG,CAAI,EAAEwxB,CAAI,EAAI9zB,CAC7B,SAAesC,IAAS,OAClBuG,EAAI,KAAKvG,CAAI,EAAI8wB,EAAI,UAAU74B,EAAM44B,EAAQ7oB,CAAG,UACvChI,IAAS,OAAQ,CAC1B,MAAM2xB,EAAKprB,EAAI,KAAK,KAAK,OAAS,EAClCA,EAAI,KAAKvG,CAAI,EAAI,GACjB,QAASf,EAAI,EAAGA,EAAI0yB,EAAI1yB,IACtBsH,EAAI,KAAKvG,CAAI,EAAE,KAAKoG,EAAInO,EAAM44B,EAAS5xB,EAAI,CAAC,CAAC,CACrD,SAAee,IAAS,OACduG,EAAI,QAAU,EAAGA,EAAI,KAAKvG,CAAI,EAAI8wB,EAAI,UAAU74B,EAAM44B,EAAQ7oB,CAAG,EAC5DzB,EAAI,QAAU,EAAGA,EAAI,KAAKvG,CAAI,EAAIoG,EAAInO,EAAM44B,CAAM,EAClDtqB,EAAI,QAAU,IACrBA,EAAI,KAAKvG,CAAI,EAAI,CACfoG,EAAInO,EAAM44B,CAAM,EAChBzqB,EAAInO,EAAM44B,EAAS,CAAC,EACpBzqB,EAAInO,EAAM44B,EAAS,CAAC,CAC9B,WACe7wB,IAAS,OAClBuG,EAAI,KAAKvG,CAAI,EAAI8wB,EAAI,SAAS74B,EAAM44B,CAAM,EAAI,YACvC7wB,IAAS,OAAQuG,EAAI,KAAKvG,CAAI,EAAI/H,EAAK44B,CAAM,UAC7C7wB,IAAS,OACZuG,EAAI,QAAU,GAAKA,EAAI,QAAU,EACnCA,EAAI,KAAKvG,CAAI,EAAI,CAACoG,EAAInO,EAAM44B,CAAM,CAAC,EAC5BtqB,EAAI,QAAU,GAAKA,EAAI,QAAU,EACxCA,EAAI,KAAKvG,CAAI,EAAI,CACfoG,EAAInO,EAAM44B,CAAM,EAChBzqB,EAAInO,EAAM44B,EAAS,CAAC,EACpBzqB,EAAInO,EAAM44B,EAAS,CAAC,CAC9B,EACetqB,EAAI,QAAU,IAAGA,EAAI,KAAKvG,CAAI,EAAI/H,EAAK44B,CAAM,WAC7C7wB,IAAS,OAClB,MAEF6wB,GAAU7oB,EAEV6oB,GAAU,CACX,CACD,GAAIK,IAAS,EAAG,CACd,MAAME,EAAK7qB,EAAI,OAAOA,EAAI,OAAO,OAAS,CAAC,EAC3C6qB,EAAG,KAAOxC,EAAK,OAAO,YACpBroB,EACA0qB,EAAG,MAAM,EAAGC,CAAI,EAChBE,EAAG,KAAK,MACRA,EAAG,KAAK,MACd,EACIF,EAAO,CACR,CACD,OAAA3qB,EAAI,KAAOqoB,EAAK,OAAO,YAAYroB,EAAKwqB,EAAIxqB,EAAI,MAAOA,EAAI,MAAM,EAEjE,OAAOA,EAAI,SACX,OAAOA,EAAI,UACX,OAAOA,EAAI,OACJA,CACT,EAEAqoB,EAAK,OAAO,YAAc,SAAUroB,EAAKwqB,EAAI3d,EAAGY,EAAG,CACjD,MAAMub,EAAMX,EAAK,OAAO,QAAQroB,CAAG,EAC7BipB,EAAM,KAAK,KAAMpc,EAAImc,EAAO,CAAC,EAC7BrnB,EAAO,IAAI,YAAYsnB,EAAM,EAAIjpB,EAAI,WAAayN,CAAC,EACzD,OAAIzN,EAAI,KAAK,KAAMwqB,EAAKnC,EAAK,WAAWmC,EAAI7oB,CAAI,EAC3C6oB,EAAKnC,EAAK,OAAO,SAASmC,EAAI7oB,CAAI,EAEnC3B,EAAI,YAAc,EAAGwqB,EAAKnC,EAAK,OAAO,YAAYmC,EAAIxqB,EAAK,EAAG6M,EAAGY,CAAC,EAC7DzN,EAAI,YAAc,IAAGwqB,EAAKnC,EAAK,OAAO,eAAemC,EAAIxqB,CAAG,GAC9DwqB,CACT,EAEAnC,EAAK,OAAO,SAAW,SAAU32B,EAAMiQ,EAAM,CAK3C,OAJY0mB,EAAK,WACf,IAAI,WAAW32B,EAAK,OAAQ,EAAGA,EAAK,OAAS,CAAC,EAC9CiQ,CACJ,CAEA,EACA0mB,EAAK,WAAc,UAAY,CAC7B,MAAMgD,EAAI,CAAA,EACV,OAAAA,EAAE,EAAI,GACNA,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAI,WACV,IAAI9yB,EAAI,EACJ0C,EAAI,EACJqwB,EAAI,EACJhe,EAAI,EACJie,EAAI,EACJC,EAAI,EACJC,EAAI,EACJ/e,EAAI,EACJ,EAAI,EACJ/b,EACA+6B,EACJ,GAAIP,EAAE,CAAC,IAAM,GAAKA,EAAE,CAAC,IAAM,EACzB,OAAOC,GAAK,IAAIC,EAAE,CAAC,EAErB,MAAMM,EAAIT,EAAE,EACN9vB,EAAIuwB,EAAE,EACNC,EAAID,EAAE,EACNnzB,EAAImzB,EAAE,EACNE,EAAIF,EAAE,EACNG,EAAIH,EAAE,EACNv+B,EAAIu+B,EAAE,EACNxwB,EAAIwwB,EAAE,EACNI,EAAIX,IAAM,KAEhB,IADIW,IAAGX,EAAI,IAAIC,EAAGF,EAAE,SAAW,GAAM,CAAC,GAC/B5yB,IAAM,GAAG,CAId,GAHAA,EAAI6C,EAAE+vB,EAAG,EAAG,CAAC,EACblwB,EAAIG,EAAE+vB,EAAG,EAAI,EAAG,CAAC,EACjB,GAAK,EACDlwB,IAAM,EAAG,CACN,EAAI,IAAU,GAAK,GAAK,EAAI,IACjC,MAAM+wB,GAAK,IAAM,GAAK,EAChB1R,EAAI6Q,EAAEa,EAAI,CAAC,EAAKb,EAAEa,EAAI,CAAC,GAAK,EAC9BD,IAAGX,EAAIF,EAAE,EAAE,EAAEE,EAAG1e,EAAI4N,CAAC,GACzB8Q,EAAE,IAAI,IAAIC,EAAEF,EAAE,OAAQA,EAAE,WAAaa,EAAG1R,CAAC,EAAG5N,CAAC,EAC7C,EAAKsf,EAAI1R,GAAM,EACf5N,GAAK4N,EACL,QACD,CAQD,GAPIyR,IAAGX,EAAIF,EAAE,EAAE,EAAEE,EAAG1e,EAAK,MAAQ,GAC7BzR,IAAM,IACRtK,EAAIwK,EAAE,EACNuwB,EAAIvwB,EAAE,EACNqwB,EAAK,IACLC,EAAK,IAEHxwB,IAAM,EAAG,CACXqwB,EAAIM,EAAET,EAAG,EAAG,CAAC,EAAI,IACjB7d,EAAIse,EAAET,EAAG,EAAI,EAAG,CAAC,EAAI,EACrBI,EAAIK,EAAET,EAAG,EAAI,GAAI,CAAC,EAAI,EACtB,GAAK,GAEL,IAAIznB,EAAI,EACR,QAASpT,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3B6K,EAAE,EAAE7K,CAAC,EAAI,EACT6K,EAAE,EAAE7K,EAAI,CAAC,EAAI,EAEf,QAASA,EAAI,EAAGA,EAAIi7B,EAAGj7B,IAAK,CAC1B,MAAM27B,EAAIL,EAAET,EAAG,EAAI76B,EAAI,EAAG,CAAC,EAC3B6K,EAAE,GAAGA,EAAE,EAAE7K,CAAC,GAAK,GAAK,CAAC,EAAI27B,EACrBA,EAAIvoB,IAAGA,EAAIuoB,EAChB,CACD,GAAK,EAAIV,EACTM,EAAE1wB,EAAE,EAAGuI,CAAC,EACRooB,EAAE3wB,EAAE,EAAGuI,EAAGvI,EAAE,CAAC,EACbxK,EAAIwK,EAAE,EACNuwB,EAAIvwB,EAAE,EACN,EAAI3C,EAAE2C,EAAE,GAAI,GAAKuI,GAAK,EAAG4nB,EAAIhe,EAAG6d,EAAG,EAAGhwB,EAAE,CAAC,EACzC,MAAM+wB,EAAIP,EAAE,EAAExwB,EAAE,EAAG,EAAGmwB,EAAGnwB,EAAE,CAAC,EAC5BqwB,GAAK,GAAKU,GAAK,EACf,MAAMC,EAAIR,EAAE,EAAExwB,EAAE,EAAGmwB,EAAGhe,EAAGnS,EAAE,CAAC,EAC5BswB,GAAK,GAAKU,GAAK,EACfN,EAAE1wB,EAAE,EAAG+wB,CAAC,EACRJ,EAAE3wB,EAAE,EAAG+wB,EAAGv7B,CAAC,EACXk7B,EAAE1wB,EAAE,EAAGgxB,CAAC,EACRL,EAAE3wB,EAAE,EAAGgxB,EAAGT,CAAC,CACZ,CAED,OAAW,CACT,MAAM,EAAI/6B,EAAEvD,EAAE+9B,EAAG,CAAC,EAAIK,CAAC,EACvB,GAAK,EAAI,GACT,MAAMv1B,EAAI,IAAM,EAChB,GAAI,EAAAA,IAAM,GACRm1B,EAAE1e,GAAG,EAAIzW,MACJ,IAAIA,IAAM,IACf,MACK,CACL,IAAIm2B,EAAI1f,EAAIzW,EAAI,IAChB,GAAIA,EAAI,IAAK,CACX,MAAMo2B,EAAIlxB,EAAE,EAAElF,EAAI,GAAG,EACrBm2B,EAAI1f,GAAK2f,IAAM,GAAKT,EAAET,EAAG,EAAGkB,EAAI,CAAC,EACjC,GAAKA,EAAI,CACV,CACD,MAAMC,EAAIZ,EAAEt+B,EAAE+9B,EAAG,CAAC,EAAIM,CAAC,EACvB,GAAKa,EAAI,GACT,MAAM3zB,EAAI2zB,IAAM,EACVC,EAAIpxB,EAAE,EAAExC,CAAC,EACT+C,GAAK6wB,IAAM,GAAKnxB,EAAE+vB,EAAG,EAAGoB,EAAI,EAAE,EAEpC,IADA,GAAKA,EAAI,GACF7f,EAAI0f,GACThB,EAAE1e,CAAC,EAAI0e,EAAE1e,IAAMhR,CAAC,EAChB0vB,EAAE1e,CAAC,EAAI0e,EAAE1e,IAAMhR,CAAC,EAChB0vB,EAAE1e,CAAC,EAAI0e,EAAE1e,IAAMhR,CAAC,EAChB0vB,EAAE1e,CAAC,EAAI0e,EAAE1e,IAAMhR,CAAC,EAElBgR,EAAI0f,CACL,EACF,CACF,CACD,OAAOhB,EAAE,SAAW1e,EAAI0e,EAAIA,EAAE,MAAM,EAAG1e,CAAC,CAC5C,EACEwe,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIF,EAAE,OACZ,GAAIC,GAAKC,EAAG,OAAOF,EACnB,MAAMQ,EAAI,IAAI,WAAWN,GAAK,CAAC,EAC/B,OAAAM,EAAE,IAAIR,EAAG,CAAC,EACHQ,CACX,EACET,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAGM,EAAGvwB,EAAGwwB,EAAG,CAClC,MAAMpzB,EAAI0yB,EAAE,EAAE,EACRW,EAAIX,EAAE,EAAE,EACd,IAAIY,EAAI,EACR,KAAOA,EAAIT,GAAG,CACZ,MAAMj+B,EAAI+9B,EAAEU,EAAEF,EAAGvwB,CAAC,EAAIgwB,CAAC,EACvBhwB,GAAKhO,EAAI,GACT,MAAM+N,EAAI/N,IAAM,EAChB,GAAI+N,GAAK,GACPywB,EAAEE,CAAC,EAAI3wB,EACP2wB,QACK,CACL,IAAIC,EAAI,EACJ9wB,EAAI,EACJE,IAAM,IACRF,EAAI,EAAIzC,EAAEmzB,EAAGvwB,EAAG,CAAC,EACjBA,GAAK,EACL2wB,EAAIH,EAAEE,EAAI,CAAC,GACF3wB,IAAM,IACfF,EAAI,EAAIzC,EAAEmzB,EAAGvwB,EAAG,CAAC,EACjBA,GAAK,GACID,IAAM,KACfF,EAAI,GAAKzC,EAAEmzB,EAAGvwB,EAAG,CAAC,EAClBA,GAAK,GAEP,MAAMkwB,EAAIQ,EAAI7wB,EACd,KAAO6wB,EAAIR,GACTM,EAAEE,CAAC,EAAIC,EACPD,GAEH,CACF,CACD,OAAO1wB,CACX,EACE8vB,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAGM,EAAG,CAC5B,IAAIvwB,EAAI,EACJwwB,EAAI,EACR,MAAMpzB,EAAImzB,EAAE,SAAW,EACvB,KAAOC,EAAIP,GAAG,CACZ,MAAMQ,EAAIV,EAAES,EAAIR,CAAC,EACjBO,EAAEC,GAAK,CAAC,EAAI,EACZD,GAAGC,GAAK,GAAK,CAAC,EAAIC,EACdA,EAAIzwB,IAAGA,EAAIywB,GACfD,GACD,CACD,KAAOA,EAAIpzB,GACTmzB,EAAEC,GAAK,CAAC,EAAI,EACZD,GAAGC,GAAK,GAAK,CAAC,EAAI,EAClBA,IAEF,OAAOxwB,CACX,EACE8vB,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIH,EAAE,EAAE,EACRS,EAAIR,EAAE,OACZ,IAAI/vB,EACAwwB,EACApzB,EACAqzB,EACAC,EACJ,MAAM1+B,EAAIi+B,EAAE,EACZ,QAASQ,EAAI,EAAGA,GAAKT,EAAGS,IAAKz+B,EAAEy+B,CAAC,EAAI,EACpC,IAAKA,EAAI,EAAGA,EAAIF,EAAGE,GAAK,EAAGz+B,EAAE+9B,EAAEU,CAAC,CAAC,IACjC,MAAM1wB,EAAIkwB,EAAE,EAGZ,IAFAjwB,EAAI,EACJhO,EAAE,CAAC,EAAI,EACFw+B,EAAI,EAAGA,GAAKR,EAAGQ,IAClBxwB,EAAKA,EAAIhO,EAAEw+B,EAAI,CAAC,GAAM,EACtBzwB,EAAEywB,CAAC,EAAIxwB,EAET,IAAK5C,EAAI,EAAGA,EAAImzB,EAAGnzB,GAAK,EACtBszB,EAAIX,EAAE3yB,EAAI,CAAC,EACPszB,IAAM,IACRX,EAAE3yB,CAAC,EAAI2C,EAAE2wB,CAAC,EACV3wB,EAAE2wB,CAAC,IAGX,EACEZ,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,MAAMM,EAAIR,EAAE,OAENS,EADIV,EAAE,EAAE,EACF,EACZ,QAAS1yB,EAAI,EAAGA,EAAImzB,EAAGnzB,GAAK,EAC1B,GAAI2yB,EAAE3yB,EAAI,CAAC,IAAM,EAAG,CAClB,MAAMqzB,EAAIrzB,GAAK,EACTszB,EAAIX,EAAE3yB,EAAI,CAAC,EACXpL,EAAKy+B,GAAK,EAAKC,EACf3wB,EAAIiwB,EAAIU,EACd,IAAIC,EAAIZ,EAAE3yB,CAAC,GAAK2C,EAChB,MAAMF,EAAI8wB,GAAK,GAAK5wB,GACpB,KAAO4wB,IAAM9wB,GAAG,CACd,MAAMqwB,EAAIM,EAAEG,CAAC,IAAO,GAAKX,EACzBC,EAAEC,CAAC,EAAIl+B,EACP2+B,GACD,CACF,CACP,EACEb,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIH,EAAE,EAAE,EAAE,EACVS,EAAI,GAAKP,EACf,QAAShwB,EAAI,EAAGA,EAAI+vB,EAAE,OAAQ/vB,GAAK,EAAG,CACpC,MAAMwwB,EAAIT,EAAE/vB,CAAC,GAAMgwB,EAAID,EAAE/vB,EAAI,CAAC,EAC9B+vB,EAAE/vB,CAAC,EAAIiwB,EAAEO,CAAC,IAAMD,CACjB,CACL,EACET,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzBA,EAAIA,IAAMD,EAAI,GACd,MAAMO,EAAIP,IAAM,EAChBD,EAAEQ,CAAC,GAAKN,EACRF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,CACtB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzBA,EAAIA,IAAMD,EAAI,GACd,MAAMO,EAAIP,IAAM,EAChBD,EAAEQ,CAAC,GAAKN,EACRF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,EAClBF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,EACtB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,OACIF,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,MAASA,EAAI,IAAQ,GAAKC,GAAK,CAEzE,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,OACIF,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,EAAMD,GAAGC,IAAM,GAAK,CAAC,GAAK,OAC3DA,EAAI,IACL,GAAKC,GAAK,CAElB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,OACGD,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,EAAMD,GAAGC,IAAM,GAAK,CAAC,GAAK,OAC5DA,EAAI,EAEX,EACEF,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,OACGD,EAAEC,IAAM,CAAC,EACPD,GAAGC,IAAM,GAAK,CAAC,GAAK,EACpBD,GAAGC,IAAM,GAAK,CAAC,GAAK,GACpBD,GAAGC,IAAM,GAAK,CAAC,GAAK,OACtBA,EAAI,EAEX,EACEF,EAAE,EAAE,EAAK,UAAY,CACnB,MAAMC,EAAI,YACJC,EAAI,YACV,MAAO,CACL,EAAG,IAAID,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,EACpE,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrE,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GACrD,EACD,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CACtB,EACD,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAChE,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MAAO,MAAO,MAClE,MAAO,KACR,EACD,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAClE,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,CAChC,EACD,EAAG,IAAIC,EAAE,EAAE,EACX,EAAG,IAAID,EAAE,GAAG,EACZ,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAK,EACd,EAAG,CAAE,EACL,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAK,EACd,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,GAAG,EACZ,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAO,EAChB,EAAG,IAAIC,EAAE,GAAG,EACZ,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,IAAI,EACb,EAAG,IAAID,EAAE,KAAO,EAChB,EAAG,IAAIA,EAAE,KAAO,CACtB,CACA,IACG,UAAY,CACX,MAAMA,EAAID,EAAE,EAAE,EACRE,EAAI,MACV,QAASC,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,IAAIM,EAAIN,EACRM,GAAMA,EAAI,cAAgB,GAAOA,EAAI,aAAe,EACpDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,YAAc,EACnDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,YAAc,EACnDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,WAAa,EAClDR,EAAE,EAAEE,CAAC,GAAMM,IAAM,GAAOA,GAAK,MAAS,EACvC,CACD,SAASvwB,EAAEwwB,EAAGpzB,EAAGqzB,EAAG,CAClB,KAAOrzB,MAAQ,GAAGozB,EAAE,KAAK,EAAGC,CAAC,CAC9B,CACD,QAASR,EAAI,EAAGA,EAAI,GAAIA,IACtBF,EAAE,EAAEE,CAAC,EAAKF,EAAE,EAAEE,CAAC,GAAK,EAAKF,EAAE,EAAEE,CAAC,EAC9BF,EAAE,EAAEE,CAAC,EAAKF,EAAE,EAAEE,CAAC,GAAK,EAAKF,EAAE,EAAEE,CAAC,EAEhCjwB,EAAE+vB,EAAE,EAAG,IAAK,CAAC,EACb/vB,EAAE+vB,EAAE,EAAG,IAAW,CAAC,EACnB/vB,EAAE+vB,EAAE,EAAG,GAAW,CAAC,EACnB/vB,EAAE+vB,EAAE,EAAG,EAAW,CAAC,EACnBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,EAAGA,EAAE,CAAC,EACjBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZ/vB,EAAE+vB,EAAE,EAAG,GAAI,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,EAAGA,EAAE,CAAC,EACjBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZ/vB,EAAE+vB,EAAE,EAAG,GAAI,CAAC,EACZ/vB,EAAE+vB,EAAE,EAAG,IAAK,CAAC,EACb/vB,EAAE+vB,EAAE,EAAG,GAAI,CAAC,EACZ/vB,EAAE+vB,EAAE,EAAG,IAAK,CAAC,CACjB,IACSD,EAAE,EAAE,CACb,IAEAhD,EAAK,OAAO,eAAiB,SAAU32B,EAAMsO,EAAK,CAChD,MAAM6M,EAAI7M,EAAI,MACRyN,EAAIzN,EAAI,OACRgpB,EAAMX,EAAK,OAAO,QAAQroB,CAAG,EAC7B2sB,EAAO3D,GAAO,EACdC,EAAM,KAAK,KAAMpc,EAAImc,EAAO,CAAC,EAC7BT,EAAM,IAAI,WAAW9a,EAAIwb,CAAG,EAClC,IAAIiB,EAAK,EAET,MAAM0C,EAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnCC,EAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnCC,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACpCC,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAE1C,IAAIC,EAAO,EACX,KAAOA,EAAO,GAAG,CACf,MAAMC,EAAKH,EAAcE,CAAI,EACvBlrB,EAAKirB,EAAcC,CAAI,EAC7B,IAAIE,EAAK,EACLC,EAAK,EACLC,EAAKR,EAAaI,CAAI,EAC1B,KAAOI,EAAK3f,GACV2f,GAAMH,EACNE,IAEF,IAAIE,EAAKR,EAAaG,CAAI,EAC1B,KAAOK,EAAKxgB,GACVwgB,GAAMvrB,EACNorB,IAEF,MAAMI,EAAO,KAAK,KAAMJ,EAAKlE,EAAO,CAAC,EACrCX,EAAK,OAAO,YAAY32B,EAAMsO,EAAKkqB,EAAIgD,EAAIC,CAAE,EAE7C,IAAIrD,EAAI,EACJyD,EAAMX,EAAaI,CAAI,EAC3B,KAAOO,EAAM9f,GAAG,CACd,IAAI+f,EAAMX,EAAaG,CAAI,EACvBS,EAAOvD,EAAKJ,EAAIwD,GAAS,EAE7B,KAAOE,EAAM3gB,GAAG,CACd,GAAImc,IAAQ,EAAG,CACb,IAAI/f,EAAMvX,EAAK+7B,GAAO,CAAC,EACvBxkB,EAAOA,GAAQ,GAAKwkB,EAAM,GAAO,EACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAKvkB,GAAQ,IAAMukB,EAAM,IAAM,EAC1D,CACD,GAAIxE,IAAQ,EAAG,CACb,IAAI/f,EAAMvX,EAAK+7B,GAAO,CAAC,EACvBxkB,EAAOA,GAAQ,GAAKwkB,EAAM,GAAO,EACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAKvkB,GAAQ,IAAMukB,EAAM,IAAM,EAC1D,CACD,GAAIxE,IAAQ,EAAG,CACb,IAAI/f,EAAMvX,EAAK+7B,GAAO,CAAC,EACvBxkB,EAAOA,GAAQ,GAAKwkB,EAAM,GAAO,GACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAKvkB,GAAQ,IAAMukB,EAAM,IAAM,EAC1D,CACD,GAAIxE,GAAO,EAAG,CACZ,MAAMhmB,EAAKuqB,EAAMtE,EAAMuE,EAAMb,EAC7B,QAAS9oB,EAAI,EAAGA,EAAI8oB,EAAM9oB,IAAK0kB,EAAIvlB,EAAKa,CAAC,EAAInS,GAAM+7B,GAAO,GAAK5pB,CAAC,CACjE,CACD4pB,GAAOzE,EACPwE,GAAO1rB,CACR,CACDgoB,IACAyD,GAAON,CACR,CACGC,EAAKC,IAAO,IAAGjD,GAAMiD,GAAM,EAAIG,IACnCN,EAAOA,EAAO,CACf,CACD,OAAOzE,CACT,EAEAF,EAAK,OAAO,QAAU,SAAUroB,EAAK,CAEnC,MADY,CAAC,EAAG,KAAM,EAAG,EAAG,EAAG,KAAM,CAAC,EAAEA,EAAI,KAAK,EACpCA,EAAI,KACnB,EAEAqoB,EAAK,OAAO,YAAc,SAAU32B,EAAMsO,EAAKa,EAAKgM,EAAGY,EAAG,CACxD,IAAIub,EAAMX,EAAK,OAAO,QAAQroB,CAAG,EACjC,MAAMipB,EAAM,KAAK,KAAMpc,EAAImc,EAAO,CAAC,EAC7B0E,EAAQrF,EAAK,OAAO,OAC1BW,EAAM,KAAK,KAAKA,EAAM,CAAC,EAEvB,IAAItwB,EAAI,EACJwxB,EAAK,EACLzwB,EAAO/H,EAAKmP,CAAG,EACf2I,EAAI,EAGR,GADI/P,EAAO,IAAG/H,EAAKmP,CAAG,EAAI,CAAC,EAAG,EAAG,CAAC,EAAEpH,EAAO,CAAC,GACxCA,IAAS,EACX,IAAK+P,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACrB9X,EAAK8X,EAAI,CAAC,EAAK9X,EAAK8X,EAAI,CAAC,GAAK9X,EAAK8X,EAAI,EAAIwf,CAAG,IAAM,GAAM,IAE9D,QAASc,EAAI,EAAGA,EAAIrc,EAAGqc,IAMrB,GALApxB,EAAImI,EAAMipB,EAAIb,EACdiB,EAAKxxB,EAAIoxB,EAAI,EACbrwB,EAAO/H,EAAKw4B,EAAK,CAAC,EAClB1gB,EAAI,EAEA/P,IAAS,EAAG,KAAO+P,EAAIyf,EAAKzf,IAAK9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,UACrD/P,IAAS,EAAG,CACnB,KAAO+P,EAAIwf,EAAKxf,IAAK9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,EAC9C,KAAOA,EAAIyf,EAAKzf,IAAK9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,EAAI9X,EAAKgH,EAAI8Q,EAAIwf,CAAG,CACxE,SAAevvB,IAAS,EAClB,KAAO+P,EAAIyf,EAAKzf,IAAK9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,EAAI9X,EAAKgH,EAAI8Q,EAAIyf,CAAG,UACzDxvB,IAAS,EAAG,CACrB,KAAO+P,EAAIwf,EAAKxf,IACd9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,GAAK9X,EAAKgH,EAAI8Q,EAAIyf,CAAG,IAAM,GACtD,KAAOzf,EAAIyf,EAAKzf,IACd9X,EAAKgH,EAAI8Q,CAAC,EACR9X,EAAKw4B,EAAK1gB,CAAC,GAAM9X,EAAKgH,EAAI8Q,EAAIyf,CAAG,EAAIv3B,EAAKgH,EAAI8Q,EAAIwf,CAAG,IAAO,EACtE,KAAW,CACL,KAAOxf,EAAIwf,EAAKxf,IACd9X,EAAKgH,EAAI8Q,CAAC,EAAI9X,EAAKw4B,EAAK1gB,CAAC,EAAIkkB,EAAM,EAAGh8B,EAAKgH,EAAI8Q,EAAIyf,CAAG,EAAG,CAAC,EAC5D,KAAOzf,EAAIyf,EAAKzf,IACd9X,EAAKgH,EAAI8Q,CAAC,EACR9X,EAAKw4B,EAAK1gB,CAAC,EACXkkB,EAAMh8B,EAAKgH,EAAI8Q,EAAIwf,CAAG,EAAGt3B,EAAKgH,EAAI8Q,EAAIyf,CAAG,EAAGv3B,EAAKgH,EAAI8Q,EAAIwf,EAAMC,CAAG,CAAC,CACxE,CAEH,OAAOv3B,CACT,EAEA22B,EAAK,OAAO,OAAS,SAAUxsB,EAAGP,EAAG7K,EAAG,CACtC,MAAM2F,EAAIyF,EAAIP,EAAI7K,EACZk9B,EAAKv3B,EAAIyF,EACT+xB,EAAKx3B,EAAIkF,EACTuyB,EAAKz3B,EAAI3F,EACf,OAAIk9B,EAAKA,GAAMC,EAAKA,GAAMD,EAAKA,GAAME,EAAKA,EAAWhyB,EAC5C+xB,EAAKA,GAAMC,EAAKA,EAAWvyB,EAC7B7K,CACT,EAEA43B,EAAK,OAAO,MAAQ,SAAU32B,EAAM44B,EAAQtqB,EAAK,CAC/C,MAAMuqB,EAAMlC,EAAK,KACjBroB,EAAI,MAAQuqB,EAAI,SAAS74B,EAAM44B,CAAM,EACrCA,GAAU,EACVtqB,EAAI,OAASuqB,EAAI,SAAS74B,EAAM44B,CAAM,EACtCA,GAAU,EACVtqB,EAAI,MAAQtO,EAAK44B,CAAM,EACvBA,IACAtqB,EAAI,MAAQtO,EAAK44B,CAAM,EACvBA,IACAtqB,EAAI,SAAWtO,EAAK44B,CAAM,EAC1BA,IACAtqB,EAAI,OAAStO,EAAK44B,CAAM,EACxBA,IACAtqB,EAAI,UAAYtO,EAAK44B,CAAM,EAC3BA,GACF,EAEAjC,EAAK,KAAO,CACV,SAAU,SAAU32B,EAAM0E,EAAG,CAC3B,KAAO1E,EAAK0E,CAAC,IAAM,GAAGA,IACtB,OAAOA,CACR,EACD,WAAY,SAAUuL,EAAMvL,EAAG,CAC7B,OAAQuL,EAAKvL,CAAC,GAAK,EAAKuL,EAAKvL,EAAI,CAAC,CACnC,EACD,YAAa,SAAUuL,EAAMvL,EAAGmF,EAAG,CACjCoG,EAAKvL,CAAC,EAAKmF,GAAK,EAAK,IACrBoG,EAAKvL,EAAI,CAAC,EAAImF,EAAI,GACnB,EACD,SAAU,SAAUoG,EAAMvL,EAAG,CAC3B,OACEuL,EAAKvL,CAAC,EAAK,UACTuL,EAAKvL,EAAI,CAAC,GAAK,GAAOuL,EAAKvL,EAAI,CAAC,GAAK,EAAKuL,EAAKvL,EAAI,CAAC,EAEzD,EACD,UAAW,SAAUuL,EAAMvL,EAAGmF,EAAG,CAC/BoG,EAAKvL,CAAC,EAAKmF,GAAK,GAAM,IACtBoG,EAAKvL,EAAI,CAAC,EAAKmF,GAAK,GAAM,IAC1BoG,EAAKvL,EAAI,CAAC,EAAKmF,GAAK,EAAK,IACzBoG,EAAKvL,EAAI,CAAC,EAAImF,EAAI,GACnB,EACD,UAAW,SAAUoG,EAAMvL,EAAGuC,EAAG,CAC/B,IAAIG,EAAI,GACR,QAASJ,EAAI,EAAGA,EAAIC,EAAGD,IAAKI,GAAK,OAAO,aAAa6I,EAAKvL,EAAIsC,CAAC,CAAC,EAChE,OAAOI,CACR,EACD,WAAY,SAAUpH,EAAM0E,EAAG0C,EAAG,CAChC,QAAS,EAAI,EAAG,EAAIA,EAAE,OAAQ,IAAKpH,EAAK0E,EAAI,CAAC,EAAI0C,EAAE,WAAW,CAAC,CAChE,EACD,UAAW,SAAU6I,EAAMvL,EAAGuC,EAAG,CAC/B,MAAMF,EAAM,CAAA,EACZ,QAASC,EAAI,EAAGA,EAAIC,EAAGD,IAAKD,EAAI,KAAKkJ,EAAKvL,EAAIsC,CAAC,CAAC,EAChD,OAAOD,CACR,EACD,IAAK,SAAU8C,EAAG,CAChB,OAAOA,EAAE,OAAS,EAAI,IAAMA,EAAIA,CACjC,EACD,SAAU,SAAUoG,EAAMvL,EAAGuC,EAAG,CAC9B,IAAIG,EAAI,GACJ8I,EACJ,QAASlJ,EAAI,EAAGA,EAAIC,EAAGD,IACrBI,GAAK,IAAMuvB,EAAK,KAAK,IAAI1mB,EAAKvL,EAAIsC,CAAC,EAAE,SAAS,EAAE,CAAC,EACnD,GAAI,CACFkJ,EAAK,mBAAmB9I,CAAC,CAC1B,MAAW,CACV,OAAOuvB,EAAK,KAAK,UAAU1mB,EAAMvL,EAAGuC,CAAC,CACtC,CACD,OAAOiJ,CACR,CACH,EACAymB,EAAK,UAAY,SAAUyF,EAAIZ,EAAIC,EAAIxD,EAAIoE,EAAIC,EAAIC,EAAMC,EAAMC,EAAM,CACnE,MAAMthB,EAAI,KAAK,IAAIqgB,EAAIa,CAAE,EACnB,EAAI,KAAK,IAAIZ,EAAIa,CAAE,EACzB,IAAI5oB,EAAK,EACLokB,EAAK,EACT,QAASM,EAAI,EAAGA,EAAI,EAAGA,IACrB,QAAStgB,EAAI,EAAGA,EAAIqD,EAAGrD,IASrB,GARIykB,GAAQ,GAAKC,GAAQ,GACvB9oB,EAAM0kB,EAAIoD,EAAK1jB,GAAM,EACrBggB,GAAO0E,EAAOpE,GAAKiE,EAAKE,EAAOzkB,GAAM,IAErCpE,GAAO,CAAC8oB,EAAOpE,GAAKoD,EAAKe,EAAOzkB,GAAM,EACtCggB,EAAMM,EAAIiE,EAAKvkB,GAAM,GAGnB2kB,IAAS,EACXxE,EAAGH,CAAE,EAAIsE,EAAG1oB,CAAE,EACdukB,EAAGH,EAAK,CAAC,EAAIsE,EAAG1oB,EAAK,CAAC,EACtBukB,EAAGH,EAAK,CAAC,EAAIsE,EAAG1oB,EAAK,CAAC,EACtBukB,EAAGH,EAAK,CAAC,EAAIsE,EAAG1oB,EAAK,CAAC,UACb+oB,IAAS,EAAG,CACrB,MAAMC,EAAKN,EAAG1oB,EAAK,CAAC,EAAK,mBACnBylB,EAAKiD,EAAG1oB,CAAE,EAAIgpB,EACdC,EAAKP,EAAG1oB,EAAK,CAAC,EAAIgpB,EAClBE,EAAKR,EAAG1oB,EAAK,CAAC,EAAIgpB,EAClBG,EAAK5E,EAAGH,EAAK,CAAC,GAAK,EAAI,KACvBgF,EAAK7E,EAAGH,CAAE,EAAI+E,EACdE,EAAK9E,EAAGH,EAAK,CAAC,EAAI+E,EAClBG,EAAK/E,EAAGH,EAAK,CAAC,EAAI+E,EAElBI,EAAM,EAAIP,EACVQ,EAAKR,EAAKG,EAAKI,EACfE,EAAMD,IAAO,EAAI,EAAI,EAAIA,EAC/BjF,EAAGH,EAAK,CAAC,EAAI,IAAMoF,EACnBjF,EAAGH,EAAK,CAAC,GAAKqB,EAAK2D,EAAKG,GAAOE,EAC/BlF,EAAGH,EAAK,CAAC,GAAK6E,EAAKI,EAAKE,GAAOE,EAC/BlF,EAAGH,EAAK,CAAC,GAAK8E,EAAKI,EAAKC,GAAOE,CACvC,SAAiBV,IAAS,EAAG,CAErB,MAAMC,EAAKN,EAAG1oB,EAAK,CAAC,EACdylB,EAAKiD,EAAG1oB,CAAE,EACVipB,EAAKP,EAAG1oB,EAAK,CAAC,EACdkpB,EAAKR,EAAG1oB,EAAK,CAAC,EACdmpB,EAAK5E,EAAGH,EAAK,CAAC,EACdgF,EAAK7E,EAAGH,CAAE,EACViF,EAAK9E,EAAGH,EAAK,CAAC,EACdkF,EAAK/E,EAAGH,EAAK,CAAC,EAChB4E,IAAOG,GAAM1D,IAAO2D,GAAMH,IAAOI,GAAMH,IAAOI,GAChD/E,EAAGH,CAAE,EAAI,EACTG,EAAGH,EAAK,CAAC,EAAI,EACbG,EAAGH,EAAK,CAAC,EAAI,EACbG,EAAGH,EAAK,CAAC,EAAI,IAEbG,EAAGH,CAAE,EAAIqB,EACTlB,EAAGH,EAAK,CAAC,EAAI6E,EACb1E,EAAGH,EAAK,CAAC,EAAI8E,EACb3E,EAAGH,EAAK,CAAC,EAAI4E,EAEvB,SAAiBD,IAAS,EAAG,CAErB,MAAMC,EAAKN,EAAG1oB,EAAK,CAAC,EACdylB,EAAKiD,EAAG1oB,CAAE,EACVipB,EAAKP,EAAG1oB,EAAK,CAAC,EACdkpB,EAAKR,EAAG1oB,EAAK,CAAC,EACdmpB,EAAK5E,EAAGH,EAAK,CAAC,EACdgF,EAAK7E,EAAGH,CAAE,EACViF,EAAK9E,EAAGH,EAAK,CAAC,EACdkF,EAAK/E,EAAGH,EAAK,CAAC,EACpB,GAAI4E,IAAOG,GAAM1D,IAAO2D,GAAMH,IAAOI,GAAMH,IAAOI,EAAI,SACtD,GAAIN,EAAK,KAAOG,EAAK,GAAI,MAAO,EACjC,CAEL,MAAO,EACT,EAEAlG,EAAK,OAAS,SAAUyG,EAAMjiB,EAAGY,EAAGshB,EAAIC,EAAMC,EAAMC,EAAY,CAC1DH,IAAO,OAAMA,EAAK,GAClBG,IAAe,OAAMA,EAAa,IAEtC,MAAMC,EAAO9G,EAAK,OAAO,SAASyG,EAAMjiB,EAAGY,EAAGshB,EAAI,CAChD,GACA,GACA,GACA,EACAG,CACJ,CAAG,EACD,OAAA7G,EAAK,OAAO,YAAY8G,EAAM,EAAE,EAEzB9G,EAAK,OAAO,MAAM8G,EAAMtiB,EAAGY,EAAGuhB,EAAMC,CAAI,CACjD,EAEA5G,EAAK,SAAW,SAAUyG,EAAMjiB,EAAGY,EAAG4f,EAAI+B,EAAInhB,EAAO+gB,EAAMC,EAAM,CAC/D,MAAME,EAAO,CACX,MAAO,GAAK9B,IAAO,EAAI,EAAI,IAAM+B,IAAO,EAAI,EAAI,GAChD,MAAAnhB,EACA,OAAQ,CAAE,CACd,EAEQohB,GAAQhC,EAAK+B,GAAMnhB,EACnBqhB,EAAOD,EAAOxiB,EACpB,QAASnU,EAAI,EAAGA,EAAIo2B,EAAK,OAAQp2B,IAC/By2B,EAAK,OAAO,KAAK,CACf,KAAM,CAAE,EAAG,EAAG,EAAG,EAAG,MAAOtiB,EAAG,OAAQY,CAAG,EACzC,IAAK,IAAI,WAAWqhB,EAAKp2B,CAAC,CAAC,EAC3B,MAAO,EACP,QAAS,EACT,IAAK,KAAK,KAAK22B,EAAO,CAAC,EACvB,IAAK,KAAK,KAAKC,EAAO,CAAC,CAC7B,CAAK,EAEH,OAAAjH,EAAK,OAAO,YAAY8G,EAAM,EAAG,EAAI,EAEzB9G,EAAK,OAAO,MAAM8G,EAAMtiB,EAAGY,EAAGuhB,EAAMC,CAAI,CAEtD,EAEA5G,EAAK,OAAO,MAAQ,SAAU8G,EAAMtiB,EAAGY,EAAGuhB,EAAMC,EAAM,CAC/CA,IAAMA,EAAO,IAClB,MAAMnuB,EAAMunB,EAAK,IAAI,IACfpnB,EAAMonB,EAAK,KAAK,UAChBnnB,EAAMmnB,EAAK,KAAK,YAChBkH,EAAMlH,EAAK,KAAK,WACtB,IAAIiC,EAAS,EACb,MAAMkF,EAAOL,EAAK,OAAO,OAAS,EAClC,IAAIM,EAAW,GAEXC,EAAO,GAAK,GAAK,EAAI,IAAMF,EAAO,GAAK,GAG3C,GAFIP,EAAK,OAAS,MAAQA,EAAK,OAAS,SAAWS,GAAQ,IACvDT,EAAK,OAAS,MAAQA,EAAK,OAAS,SAAWS,GAAQ,IACvDP,EAAK,QAAU,EAAG,CACpB,MAAMQ,EAAKR,EAAK,KAAK,OACrB,QAASz2B,EAAI,EAAGA,EAAIi3B,EAAIj3B,IAClBy2B,EAAK,KAAKz2B,CAAC,IAAM,KAAO,MAAK+2B,EAAW,IAC9CC,GAAQ,EAAIC,EAAK,EAAI,GAAKF,EAAW,EAAIE,EAAK,EAAI,EAAI,EACvD,CACD,QAAS9rB,EAAI,EAAGA,EAAIsrB,EAAK,OAAO,OAAQtrB,IAAK,CAC3C,MAAMgnB,EAAKsE,EAAK,OAAOtrB,CAAC,EACpB2rB,IAAME,GAAQ,IAClBA,GAAQ7E,EAAG,KAAK,OAAS,GACrBhnB,IAAM,IAAG6rB,GAAQ,EACtB,CACDA,GAAQ,GAER,MAAMh+B,EAAO,IAAI,WAAWg+B,CAAI,EAC1BE,EAAK,CAAC,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAI,EAC1D,QAASl3B,EAAI,EAAGA,EAAI,EAAGA,IAAKhH,EAAKgH,CAAC,EAAIk3B,EAAGl3B,CAAC,EA8D1C,GA5DAuI,EAAIvP,EAAM44B,EAAQ,EAAE,EACpBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQzd,CAAC,EACnByd,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQ7c,CAAC,EACnB6c,GAAU,EACV54B,EAAK44B,CAAM,EAAI6E,EAAK,MACpB7E,IACA54B,EAAK44B,CAAM,EAAI6E,EAAK,MACpB7E,IACA54B,EAAK44B,CAAM,EAAI,EACfA,IACA54B,EAAK44B,CAAM,EAAI,EACfA,IACA54B,EAAK44B,CAAM,EAAI,EACfA,IACArpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,EAGN2E,EAAK,OAAS,MAAQA,EAAK,OAAS,SACtChuB,EAAIvP,EAAM44B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACV54B,EAAK44B,CAAM,EAAI2E,EAAK,KACpB3E,IACArpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,EAAG,CAAC,CAAC,EAC1CA,GAAU,GAER2E,EAAK,OAAS,MAAQA,EAAK,OAAS,SACtChuB,EAAIvP,EAAM44B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQ2E,EAAK,KAAK,CAAC,CAAC,EAC9B3E,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQ2E,EAAK,KAAK,CAAC,CAAC,EAC9B3E,GAAU,EACV54B,EAAK44B,CAAM,EAAI2E,EAAK,KAAK,CAAC,EAC1B3E,IACArpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGRkF,IACFvuB,EAAIvP,EAAM44B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQ6E,EAAK,OAAO,MAAM,EACpC7E,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQ2E,EAAK,MAAQ,KAAOA,EAAK,KAAO,CAAC,EACnD3E,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGR6E,EAAK,QAAU,EAAG,CACpB,MAAMQ,EAAKR,EAAK,KAAK,OACrBluB,EAAIvP,EAAM44B,EAAQqF,EAAK,CAAC,EACxBrF,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACV,QAAS5xB,EAAI,EAAGA,EAAIi3B,EAAIj3B,IAAK,CAC3B,MAAM8wB,EAAK9wB,EAAI,EACTjI,EAAI0+B,EAAK,KAAKz2B,CAAC,EACf2zB,EAAI57B,EAAI,IACRo/B,EAAKp/B,IAAM,EAAK,IAChB6K,EAAK7K,IAAM,GAAM,IACvBiB,EAAK44B,EAASd,EAAK,CAAC,EAAI6C,EACxB36B,EAAK44B,EAASd,EAAK,CAAC,EAAIqG,EACxBn+B,EAAK44B,EAASd,EAAK,CAAC,EAAIluB,CACzB,CAKD,GAJAgvB,GAAUqF,EAAK,EACf1uB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAASqF,EAAK,EAAI,EAAGA,EAAK,EAAI,CAAC,CAAC,EAC5DrF,GAAU,EAENmF,EAAU,CACZxuB,EAAIvP,EAAM44B,EAAQqF,CAAE,EACpBrF,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACV,QAAS5xB,EAAI,EAAGA,EAAIi3B,EAAIj3B,IACtBhH,EAAK44B,EAAS5xB,CAAC,EAAKy2B,EAAK,KAAKz2B,CAAC,IAAM,GAAM,IAC7C4xB,GAAUqF,EACV1uB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAASqF,EAAK,EAAGA,EAAK,CAAC,CAAC,EACpDrF,GAAU,CACX,CACF,CAED,IAAIwF,EAAK,EACT,QAASjsB,EAAI,EAAGA,EAAIsrB,EAAK,OAAO,OAAQtrB,IAAK,CAC3C,MAAMgnB,EAAKsE,EAAK,OAAOtrB,CAAC,EACpB2rB,IACFvuB,EAAIvP,EAAM44B,EAAQ,EAAE,EACpBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQwF,GAAI,EACtBxF,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQO,EAAG,KAAK,KAAK,EAC/BP,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQO,EAAG,KAAK,MAAM,EAChCP,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQO,EAAG,KAAK,CAAC,EAC3BP,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQO,EAAG,KAAK,CAAC,EAC3BP,GAAU,EACVppB,EAAIxP,EAAM44B,EAAQ0E,EAAKnrB,CAAC,CAAC,EACzBymB,GAAU,EACVppB,EAAIxP,EAAM44B,EAAQ,GAAI,EACtBA,GAAU,EACV54B,EAAK44B,CAAM,EAAIO,EAAG,QAClBP,IACA54B,EAAK44B,CAAM,EAAIO,EAAG,MAClBP,IACArpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGZ,MAAMyF,EAAOlF,EAAG,KACV8E,EAAKI,EAAK,OAChB9uB,EAAIvP,EAAM44B,EAAQqF,GAAM9rB,IAAM,EAAI,EAAI,EAAE,EACxCymB,GAAU,EACV,MAAMhpB,EAAOgpB,EACbiF,EAAI79B,EAAM44B,EAAQzmB,IAAM,EAAI,OAAS,MAAM,EAC3CymB,GAAU,EACNzmB,IAAM,IACR5C,EAAIvP,EAAM44B,EAAQwF,GAAI,EACtBxF,GAAU,GAEZ54B,EAAK,IAAIq+B,EAAMzF,CAAM,EACrBA,GAAUqF,EACV1uB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM4P,EAAMgpB,EAAShpB,CAAI,CAAC,EAChDgpB,GAAU,CACX,CAED,OAAArpB,EAAIvP,EAAM44B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAI79B,EAAM44B,EAAQ,MAAM,EACxBA,GAAU,EACVrpB,EAAIvP,EAAM44B,EAAQxpB,EAAIpP,EAAM44B,EAAS,EAAG,CAAC,CAAC,EAC1CA,GAAU,EAEH54B,EAAK,MACd,EAEA22B,EAAK,OAAO,YAAc,SAAUroB,EAAKgwB,EAAQC,EAAW,CAC1D,QAAS,EAAI,EAAG,EAAIjwB,EAAI,OAAO,OAAQ,IAAK,CAC1C,MAAMyoB,EAAMzoB,EAAI,OAAO,CAAC,EAElBkwB,EAAKzH,EAAI,KAAK,OACdK,EAAQ,IAAI,WAAWoH,EAAKzH,EAAI,IAAMyH,CAAE,EAC9CzH,EAAI,KAAOJ,EAAK,OAAO,YACrBI,EAAI,IACJyH,EACAzH,EAAI,IACJA,EAAI,IACJK,EACAkH,EACAC,CACN,CACG,CACH,EAEA5H,EAAK,OAAO,SAAW,SACrByG,EACAjiB,EACAY,EACAshB,EACAoB,EACA,CACA,MAAMC,EAAYD,EAAK,CAAC,EAClBE,EAAUF,EAAK,CAAC,EAChBG,EAAaH,EAAK,CAAC,EACnBI,EAAUJ,EAAK,CAAC,EAChBjB,EAAaiB,EAAK,CAAC,EAEzB,IAAI/G,EAAQ,EACRnb,EAAQ,EACRuiB,EAAW,IAEf,QAAS3sB,EAAI,EAAGA,EAAIirB,EAAK,OAAQjrB,IAAK,CAEpC,MAAM0kB,EAAM,IAAI,WAAWuG,EAAKjrB,CAAC,CAAC,EAC5B4sB,EAAOlI,EAAI,OACjB,QAAS7vB,EAAI,EAAGA,EAAI+3B,EAAM/3B,GAAK,EAAG83B,GAAYjI,EAAI7vB,EAAI,CAAC,CACxD,CACD,MAAMg4B,EAAWF,IAAa,IAGxBlI,EAAOD,EAAK,OAAO,QAAQyG,EAAMjiB,EAAGY,EAAG2iB,EAAWC,EAASC,CAAU,EAErEK,EAAO,CAAA,EACPC,EAAO,CAAA,EACPC,EAAO,CAAA,EAEb,GAAI9B,IAAO,EAAG,CACZ,MAAM+B,EAAQ,CAAA,EACd,QAASp4B,EAAI,EAAGA,EAAI4vB,EAAK,OAAQ5vB,IAAKo4B,EAAM,KAAKxI,EAAK5vB,CAAC,EAAE,IAAI,MAAM,EAEnE,MAAMq4B,EAAO1I,EAAK,OAAO,WAAWyI,CAAK,EACnCE,EAAO3I,EAAK,SAAS0I,EAAMhC,CAAE,EACnC,IAAIkC,EAAM,EACV,MAAMvC,EAAK,IAAI,WAAWsC,EAAK,IAAI,EACnC,QAASt4B,EAAI,EAAGA,EAAI4vB,EAAK,OAAQ5vB,IAAK,CACpC,MAAM8wB,EAAKlB,EAAK5vB,CAAC,EAAE,IACbw4B,EAAM1H,EAAG,OACfqH,EAAK,KAAK,IAAI,WAAWG,EAAK,KAAK,OAAQC,GAAO,EAAGC,GAAO,CAAC,CAAC,EAC9D,QAASrtB,EAAI,EAAGA,EAAIqtB,EAAKrtB,GAAK,EAC5B2lB,EAAG3lB,CAAC,EAAI6qB,EAAGuC,EAAMptB,CAAC,EAClB2lB,EAAG3lB,EAAI,CAAC,EAAI6qB,EAAGuC,EAAMptB,EAAI,CAAC,EAC1B2lB,EAAG3lB,EAAI,CAAC,EAAI6qB,EAAGuC,EAAMptB,EAAI,CAAC,EAC1B2lB,EAAG3lB,EAAI,CAAC,EAAI6qB,EAAGuC,EAAMptB,EAAI,CAAC,EAE5BotB,GAAOC,CACR,CAED,QAASx4B,EAAI,EAAGA,EAAIs4B,EAAK,KAAK,OAAQt4B,IAAKk4B,EAAK,KAAKI,EAAK,KAAKt4B,CAAC,EAAE,IAAI,IAAI,CAC9E,KAEI,SAASmL,EAAI,EAAGA,EAAIykB,EAAK,OAAQzkB,IAAK,CAEpC,MAAM4kB,EAAMH,EAAKzkB,CAAC,EACZstB,EAAQ,IAAI,YAAY1I,EAAI,IAAI,MAAM,EACtC2I,EAAK3I,EAAI,KAAK,MACdgI,EAAOU,EAAM,OACbE,EAAM,IAAI,WAAWZ,CAAI,EAC/BI,EAAK,KAAKQ,CAAG,EACb,QAAS34B,EAAI,EAAGA,EAAI+3B,EAAM/3B,IAAK,CAC7B,MAAMjI,EAAI0gC,EAAMz4B,CAAC,EACjB,GAAIA,IAAM,GAAKjI,IAAM0gC,EAAMz4B,EAAI,CAAC,EAAG24B,EAAI34B,CAAC,EAAI24B,EAAI34B,EAAI,CAAC,UAC5CA,EAAI04B,GAAM3gC,IAAM0gC,EAAMz4B,EAAI04B,CAAE,EAAGC,EAAI34B,CAAC,EAAI24B,EAAI34B,EAAI04B,CAAE,MACtD,CACH,IAAIE,EAAMX,EAAKlgC,CAAC,EAChB,GAAI6gC,IAAQ,OACVX,EAAKlgC,CAAC,EAAI6gC,EAAMV,EAAK,OACrBA,EAAK,KAAKngC,CAAC,EACPmgC,EAAK,QAAU,KAAK,MAE1BS,EAAI34B,CAAC,EAAI44B,CACV,CACF,CACF,CAGH,MAAMjE,EAAKuD,EAAK,OACZvD,GAAM,KAAO6B,IAAe,KAC1B7B,GAAM,EAAGpf,EAAQ,EACZof,GAAM,EAAGpf,EAAQ,EACjBof,GAAM,GAAIpf,EAAQ,EACtBA,EAAQ,EACbA,EAAQ,KAAK,IAAIA,EAAOsiB,CAAO,GAGjC,QAAS1sB,EAAI,EAAGA,EAAIykB,EAAK,OAAQzkB,IAAK,CACpC,MAAM4kB,EAAMH,EAAKzkB,CAAC,EAGZutB,EAAK3I,EAAI,KAAK,MACdyH,EAAKzH,EAAI,KAAK,OACpB,IAAI8I,EAAO9I,EAAI,IAEXQ,EAAM,EAAImI,EACVpI,EAAM,EACV,GAAIqE,GAAM,KAAO6B,IAAe,GAAO,CACrCjG,EAAM,KAAK,KAAMhb,EAAQmjB,EAAM,CAAC,EAChC,MAAMjC,EAAO,IAAI,WAAWlG,EAAMiH,CAAE,EAC9BsB,EAAMX,EAAKhtB,CAAC,EAClB,QAASimB,EAAI,EAAGA,EAAIoG,EAAIpG,IAAK,CAC3B,MAAMpxB,EAAIoxB,EAAIb,EACRjmB,EAAK8mB,EAAIsH,EACf,GAAInjB,IAAU,EAAG,QAASzE,EAAI,EAAGA,EAAI4nB,EAAI5nB,IAAK2lB,EAAKz2B,EAAI8Q,CAAC,EAAIgoB,EAAIxuB,EAAKwG,CAAC,UAC7DyE,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAI4nB,EAAI5nB,IACtB2lB,EAAKz2B,GAAK8Q,GAAK,EAAE,GAAKgoB,EAAIxuB,EAAKwG,CAAC,GAAM,GAAKA,EAAI,GAAK,UAC/CyE,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAI4nB,EAAI5nB,IACtB2lB,EAAKz2B,GAAK8Q,GAAK,EAAE,GAAKgoB,EAAIxuB,EAAKwG,CAAC,GAAM,GAAKA,EAAI,GAAK,UAC/CyE,IAAU,EACjB,QAASzE,EAAI,EAAGA,EAAI4nB,EAAI5nB,IACtB2lB,EAAKz2B,GAAK8Q,GAAK,EAAE,GAAKgoB,EAAIxuB,EAAKwG,CAAC,GAAM,GAAKA,EAAI,GAAK,CACzD,CACD+nB,EAAOpC,EACP/F,EAAQ,EACRJ,EAAM,CACP,SAAU0H,IAAa,IAASpI,EAAK,SAAW,EAAG,CAElD,MAAM6G,EAAO,IAAI,WAAWiC,EAAKlB,EAAK,CAAC,EACjCnH,EAAOqI,EAAKlB,EAClB,QAASx3B,EAAI,EAAGA,EAAIqwB,EAAMrwB,IAAK,CAC7B,MAAM8wB,EAAK9wB,EAAI,EACTkxB,EAAKlxB,EAAI,EACfy2B,EAAK3F,CAAE,EAAI+H,EAAK3H,CAAE,EAClBuF,EAAK3F,EAAK,CAAC,EAAI+H,EAAK3H,EAAK,CAAC,EAC1BuF,EAAK3F,EAAK,CAAC,EAAI+H,EAAK3H,EAAK,CAAC,CAC3B,CACD2H,EAAOpC,EACP/F,EAAQ,EACRJ,EAAM,EACNC,EAAM,EAAImI,CACX,CACD3I,EAAI,IAAM8I,EACV9I,EAAI,IAAMQ,EACVR,EAAI,IAAMO,CACX,CAED,MAAO,CAAE,MAAAI,EAAO,MAAAnb,EAAO,KAAA2iB,EAAM,OAAQtI,CAAI,CAC3C,EACAD,EAAK,OAAO,QAAU,SAAUyG,EAAMjiB,EAAGY,EAAGgkB,EAAapB,EAASC,EAAY,CAU5E,MAAMhI,EAAO,CAAA,EACb,QAASzkB,EAAI,EAAGA,EAAIirB,EAAK,OAAQjrB,IAAK,CACpC,MAAM0tB,EAAO,IAAI,WAAWzC,EAAKjrB,CAAC,CAAC,EAC7B6tB,EAAS,IAAI,YAAYH,EAAK,MAAM,EAC1C,IAAIpC,EAEAwC,EAAK,EACLC,EAAK,EACLR,EAAKvkB,EACLqjB,EAAKziB,EACLokB,EAAQJ,EAAc,EAAI,EAC9B,GAAI5tB,IAAM,EAAG,CACX,MAAMiuB,EACJxB,GAAcmB,GAAe5tB,IAAM,GAAKykB,EAAKzkB,EAAI,CAAC,EAAE,UAAY,EAC5D,EACA,EACN,IAAIkuB,EAAO,EACPC,EAAQ,IACZ,QAASC,EAAK,EAAGA,EAAKH,EAAMG,IAAM,CAEhC,MAAMC,EAAM,IAAI,YAAYpD,EAAKjrB,EAAI,EAAIouB,CAAE,CAAC,EAC5C,IAAIE,EAAMtlB,EACNulB,EAAM3kB,EACNwN,EAAM,GACNoX,EAAM,GACV,QAASvI,EAAI,EAAGA,EAAIrc,EAAGqc,IACrB,QAAStgB,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM9Q,EAAIoxB,EAAIjd,EAAIrD,EACdkoB,EAAOh5B,CAAC,IAAMw5B,EAAIx5B,CAAC,IACjB8Q,EAAI2oB,IAAKA,EAAM3oB,GACfA,EAAIyR,IAAKA,EAAMzR,GACfsgB,EAAIsI,IAAKA,EAAMtI,GACfA,EAAIuI,IAAKA,EAAMvI,GAEtB,CACC7O,IAAQ,KAAIkX,EAAMC,EAAMnX,EAAMoX,EAAM,GACpChC,KACG8B,EAAM,KAAO,GAAGA,KAChBC,EAAM,KAAO,GAAGA,KAEvB,MAAME,GAASrX,EAAMkX,EAAM,IAAME,EAAMD,EAAM,GACzCE,EAAQN,IACVA,EAAQM,EACRP,EAAOE,EACPN,EAAKQ,EACLP,EAAKQ,EACLhB,EAAKnW,EAAMkX,EAAM,EACjBjC,EAAKmC,EAAMD,EAAM,EAEpB,CAGD,MAAMG,EAAO,IAAI,WAAWzD,EAAKjrB,EAAI,EAAIkuB,CAAI,CAAC,EAC1CA,IAAS,IAAGzJ,EAAKzkB,EAAI,CAAC,EAAE,QAAU,GAEtCsrB,EAAO,IAAI,WAAWiC,EAAKlB,EAAK,CAAC,EACjC7H,EAAK,UAAUkK,EAAM1lB,EAAGY,EAAG0hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,EAEpDC,EAAQxJ,EAAK,UAAUkJ,EAAM1kB,EAAGY,EAAG0hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,EAAI,EAAI,EAChEC,IAAU,EACZxJ,EAAK,OAAO,aAAakJ,EAAM1kB,EAAGY,EAAG0hB,EAAM,CACzC,EAAGwC,EACH,EAAGC,EACH,MAAOR,EACP,OAAQlB,CAClB,CAAS,EACE7H,EAAK,UAAUkJ,EAAM1kB,EAAGY,EAAG0hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,CAC1D,MAAMzC,EAAOoC,EAAK,MAAM,CAAC,EAE1BjJ,EAAK,KAAK,CACR,KAAM,CAAE,EAAGqJ,EAAI,EAAGC,EAAI,MAAOR,EAAI,OAAQlB,CAAI,EAC7C,IAAKf,EACL,MAAA0C,EACA,QAAS,CACf,CAAK,CACF,CAED,GAAIJ,EACF,QAAS5tB,EAAI,EAAGA,EAAIykB,EAAK,OAAQzkB,IAAK,CACpC,MAAM4kB,EAAMH,EAAKzkB,CAAC,EAClB,GAAI4kB,EAAI,QAAU,EAAG,SACrB,MAAM+J,EAAK/J,EAAI,KACTgK,EAAKnK,EAAKzkB,EAAI,CAAC,EAAE,KACjB6uB,EAAM,KAAK,IAAIF,EAAG,EAAGC,EAAG,CAAC,EACzBE,EAAM,KAAK,IAAIH,EAAG,EAAGC,EAAG,CAAC,EACzBG,EAAM,KAAK,IAAIJ,EAAG,EAAIA,EAAG,MAAOC,EAAG,EAAIA,EAAG,KAAK,EAC/CI,EAAM,KAAK,IAAIL,EAAG,EAAIA,EAAG,OAAQC,EAAG,EAAIA,EAAG,MAAM,EACjDpG,EAAI,CAAE,EAAGqG,EAAK,EAAGC,EAAK,MAAOC,EAAMF,EAAK,OAAQG,EAAMF,CAAG,EAE/DrK,EAAKzkB,EAAI,CAAC,EAAE,QAAU,EAClBA,EAAI,IAAM,GACZwkB,EAAK,OAAO,aAAayG,EAAMjiB,EAAGY,EAAG6a,EAAMzkB,EAAI,EAAGwoB,EAAGgE,CAAO,EAC9DhI,EAAK,OAAO,aAAayG,EAAMjiB,EAAGY,EAAG6a,EAAMzkB,EAAGwoB,EAAGgE,CAAO,CACzD,CAQH,OAAO/H,CACT,EACAD,EAAK,OAAO,aAAe,SAAUyG,EAAMjiB,EAAGY,EAAG6a,EAAM5vB,EAAG2zB,EAAGgE,EAAS,CACpE,MAAMyC,EAAK,WACLC,EAAM,YACNR,EAAO,IAAIO,EAAGhE,EAAKp2B,EAAI,CAAC,CAAC,EACzBs6B,EAAS,IAAID,EAAIjE,EAAKp2B,EAAI,CAAC,CAAC,EAC5By2B,EAAOz2B,EAAI,EAAIo2B,EAAK,OAAS,IAAIgE,EAAGhE,EAAKp2B,EAAI,CAAC,CAAC,EAAI,KACnD64B,EAAO,IAAIuB,EAAGhE,EAAKp2B,CAAC,CAAC,EACrBg5B,EAAS,IAAIqB,EAAIxB,EAAK,MAAM,EAElC,IAAIY,EAAMtlB,EACNulB,EAAM3kB,EACNwN,EAAM,GACNoX,EAAM,GACV,QAAS,EAAI,EAAG,EAAIhG,EAAE,OAAQ,IAC5B,QAAS7iB,EAAI,EAAGA,EAAI6iB,EAAE,MAAO7iB,IAAK,CAChC,MAAMypB,EAAK5G,EAAE,EAAI7iB,EACX0pB,EAAK7G,EAAE,EAAI,EACXxoB,EAAIqvB,EAAKrmB,EAAIomB,EACb5F,EAAKqE,EAAO7tB,CAAC,EAIfwpB,IAAO,GACN/E,EAAK5vB,EAAI,CAAC,EAAE,UAAY,GACvBs6B,EAAOnvB,CAAC,IAAMwpB,IACb8B,IAAS,MAAQA,EAAKtrB,EAAI,EAAI,CAAC,IAAM,KAGtCovB,EAAKd,IAAKA,EAAMc,GAChBA,EAAKhY,IAAKA,EAAMgY,GAChBC,EAAKd,IAAKA,EAAMc,GAChBA,EAAKb,IAAKA,EAAMa,GAEvB,CACCjY,IAAQ,KAAIkX,EAAMC,EAAMnX,EAAMoX,EAAM,GACpChC,KACG8B,EAAM,KAAO,GAAGA,KAChBC,EAAM,KAAO,GAAGA,KAEvB/F,EAAI,CAAE,EAAG8F,EAAK,EAAGC,EAAK,MAAOnX,EAAMkX,EAAM,EAAG,OAAQE,EAAMD,EAAM,CAAC,EAEjE,MAAMvH,EAAKvC,EAAK5vB,CAAC,EACjBmyB,EAAG,KAAOwB,EACVxB,EAAG,MAAQ,EACXA,EAAG,IAAM,IAAI,WAAWwB,EAAE,MAAQA,EAAE,OAAS,CAAC,EAC1C/D,EAAK5vB,EAAI,CAAC,EAAE,UAAY,GAC1B2vB,EAAK,UAAUkK,EAAM1lB,EAAGY,EAAGod,EAAG,IAAKwB,EAAE,MAAOA,EAAE,OAAQ,CAACA,EAAE,EAAG,CAACA,EAAE,EAAG,CAAC,EACnEhE,EAAK,OAAO,aAAakJ,EAAM1kB,EAAGY,EAAGod,EAAG,IAAKwB,CAAC,GACzChE,EAAK,UAAUkJ,EAAM1kB,EAAGY,EAAGod,EAAG,IAAKwB,EAAE,MAAOA,EAAE,OAAQ,CAACA,EAAE,EAAG,CAACA,EAAE,EAAG,CAAC,CAC5E,EACAhE,EAAK,OAAO,aAAe,SAAUkJ,EAAM1kB,EAAGY,EAAG0hB,EAAMgE,EAAK,CAC1D9K,EAAK,UAAUkJ,EAAM1kB,EAAGY,EAAG0hB,EAAMgE,EAAI,MAAOA,EAAI,OAAQ,CAACA,EAAI,EAAG,CAACA,EAAI,EAAG,CAAC,CAC3E,EAEA9K,EAAK,OAAO,YAAc,SAAUE,EAAK9a,EAAGub,EAAKC,EAAKv3B,EAAMs+B,EAAQC,EAAW,CAC7E,MAAMmD,EAAM,CAAA,EACZ,IAAIC,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,CAAC,EACrBrD,IAAW,GAAIqD,EAAO,CAACrD,CAAM,GACxBviB,EAAIwb,EAAM,KAAUD,IAAQ,KAAGqK,EAAO,CAAC,CAAC,GACjD,IAAIzyB,EACAqvB,IAAWrvB,EAAO,CAAE,MAAO,CAAC,GAEhC,MAAM0yB,EAAO5hC,EAAK,OAAS,KAAQ+N,IAAQ,KAAOA,GAAO2oB,GAEzD,QAAS1vB,EAAI,EAAGA,EAAI26B,EAAK,OAAQ36B,IAAK,CACpC,QAASoxB,EAAI,EAAGA,EAAIrc,EAAGqc,IACrBzB,EAAK,OAAO,YAAY32B,EAAM62B,EAAKuB,EAAGb,EAAKD,EAAKqK,EAAK36B,CAAC,CAAC,EACzD06B,EAAI,KAAKE,EAAK,QAAQ5hC,EAAMkP,CAAI,CAAC,CAClC,CAED,IAAI4oB,EACA+J,EAAQ,IACZ,QAAS76B,EAAI,EAAGA,EAAI06B,EAAI,OAAQ16B,IAC1B06B,EAAI16B,CAAC,EAAE,OAAS66B,IAClB/J,EAAK9wB,EACL66B,EAAQH,EAAI16B,CAAC,EAAE,QAEnB,OAAO06B,EAAI5J,CAAE,CACf,EACAnB,EAAK,OAAO,YAAc,SAAU32B,EAAM62B,EAAKuB,EAAGb,EAAKD,EAAKvvB,EAAM,CAChE,MAAMf,EAAIoxB,EAAIb,EACd,IAAIiB,EAAKxxB,EAAIoxB,EACb,MAAM4D,EAAQrF,EAAK,OAAO,OAI1B,GAHA32B,EAAKw4B,CAAE,EAAIzwB,EACXywB,IAEIzwB,IAAS,EACX,GAAIwvB,EAAM,IAAK,QAASzf,EAAI,EAAGA,EAAIyf,EAAKzf,IAAK9X,EAAKw4B,EAAK1gB,CAAC,EAAI+e,EAAI7vB,EAAI8Q,CAAC,OAChE9X,EAAK,IAAI,IAAI,WAAW62B,EAAI,OAAQ7vB,EAAGuwB,CAAG,EAAGiB,CAAE,UAC3CzwB,IAAS,EAAG,CACrB,QAAS+P,EAAI,EAAGA,EAAIwf,EAAKxf,IAAK9X,EAAKw4B,EAAK1gB,CAAC,EAAI+e,EAAI7vB,EAAI8Q,CAAC,EACtD,QAASA,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACzB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,EAAI+e,EAAI7vB,EAAI8Q,EAAIwf,CAAG,EAAI,IAAO,GAC7D,SAAac,IAAM,EAAG,CAClB,QAAStgB,EAAI,EAAGA,EAAIwf,EAAKxf,IAAK9X,EAAKw4B,EAAK1gB,CAAC,EAAI+e,EAAI7vB,EAAI8Q,CAAC,EAEtD,GAAI/P,IAAS,EAAG,QAAS+P,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IAAK9X,EAAKw4B,EAAK1gB,CAAC,EAAI+e,EAAI7vB,EAAI8Q,CAAC,EACxE,GAAI/P,IAAS,EACX,QAAS+P,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACzB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,GAAK+e,EAAI7vB,EAAI8Q,EAAIwf,CAAG,GAAK,GAAK,IAAO,IAClE,GAAIvvB,IAAS,EACX,QAAS+P,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACzB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,EAAIkkB,EAAMnF,EAAI7vB,EAAI8Q,EAAIwf,CAAG,EAAG,EAAG,CAAC,EAAI,IAAO,GAC5E,KAAS,CACL,GAAIvvB,IAAS,EACX,QAAS+P,EAAI,EAAGA,EAAIyf,EAAKzf,IACvB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,EAAI,IAAM+e,EAAI7vB,EAAI8Q,EAAIyf,CAAG,EAAK,IAE3D,GAAIxvB,IAAS,EAAG,CACd,QAAS+P,EAAI,EAAGA,EAAIwf,EAAKxf,IACvB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,EAAI,KAAO+e,EAAI7vB,EAAI8Q,EAAIyf,CAAG,GAAK,GAAM,IAChE,QAASzf,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACzB9X,EAAKw4B,EAAK1gB,CAAC,EACR+e,EAAI7vB,EAAI8Q,CAAC,EAAI,KAAQ+e,EAAI7vB,EAAI8Q,EAAIyf,CAAG,EAAIV,EAAI7vB,EAAI8Q,EAAIwf,CAAG,GAAM,GAC9D,GACL,CACD,GAAIvvB,IAAS,EAAG,CACd,QAAS+P,EAAI,EAAGA,EAAIwf,EAAKxf,IACvB9X,EAAKw4B,EAAK1gB,CAAC,EAAK+e,EAAI7vB,EAAI8Q,CAAC,EAAI,IAAMkkB,EAAM,EAAGnF,EAAI7vB,EAAI8Q,EAAIyf,CAAG,EAAG,CAAC,EAAK,IACtE,QAASzf,EAAIwf,EAAKxf,EAAIyf,EAAKzf,IACzB9X,EAAKw4B,EAAK1gB,CAAC,EACR+e,EAAI7vB,EAAI8Q,CAAC,EACR,IACAkkB,EAAMnF,EAAI7vB,EAAI8Q,EAAIwf,CAAG,EAAGT,EAAI7vB,EAAI8Q,EAAIyf,CAAG,EAAGV,EAAI7vB,EAAI8Q,EAAIwf,EAAMC,CAAG,CAAC,EAClE,GACL,CACF,CACH,EAEAZ,EAAK,IAAM,CACT,MAAQ,UAAY,CAClB,MAAM7mB,EAAM,IAAI,YAAY,GAAG,EAC/B,QAAS,EAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,IAAI/Q,EAAI,EACR,QAASI,EAAI,EAAGA,EAAI,EAAGA,IACjBJ,EAAI,EAAGA,EAAI,WAAcA,IAAM,EAC9BA,EAAIA,IAAM,EAEjB+Q,EAAI,CAAC,EAAI/Q,CACV,CACD,OAAO+Q,CACX,EAAM,EACJ,OAAQ,SAAU/Q,EAAGkP,EAAKkB,EAAKY,EAAK,CAClC,QAAS/I,EAAI,EAAGA,EAAI+I,EAAK/I,IACvBjI,EAAI43B,EAAK,IAAI,OAAO53B,EAAIkP,EAAIkB,EAAMnI,CAAC,GAAK,GAAI,EAAKjI,IAAM,EACzD,OAAOA,CACR,EACD,IAAK,SAAU6K,EAAGyE,EAAGpH,EAAG,CACtB,OAAO0vB,EAAK,IAAI,OAAO,WAAY/sB,EAAGyE,EAAGpH,CAAC,EAAI,UAC/C,CACH,EAEA0vB,EAAK,SAAW,SAAU0I,EAAMhC,EAAI,CAClC,MAAMyE,EAAO,IAAI,WAAWzC,CAAI,EAC1B5B,EAAOqE,EAAK,MAAM,CAAC,EACnBC,EAAS,IAAI,YAAYtE,EAAK,MAAM,EAEpCuE,EAAKrL,EAAK,SAAS,UAAU8G,EAAMJ,CAAE,EACrCtP,EAAOiU,EAAG,CAAC,EACXC,EAAQD,EAAG,CAAC,EAEZE,EAAWvL,EAAK,SAAS,SACzByF,EAAK0F,EACL7J,EAAK8J,EACLhyB,EAAMqsB,EAAG,OAET+C,EAAO,IAAI,WAAW2C,EAAK,QAAU,CAAC,EAC5C,IAAIK,EACJ,GAAIL,EAAK,OAAS,IAEhB,QAAS96B,EAAI,EAAGA,EAAI+I,EAAK/I,GAAK,EAAG,CAC/B,MAAM2zB,EAAIyB,EAAGp1B,CAAC,EAAK,mBACb,EAAIo1B,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KACrB4C,EAAIwyB,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KACrBmD,EAAIiyB,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KAE3Bm7B,EAAKxL,EAAK,SAAS,WAAW5I,EAAM4M,EAAG,EAAG/wB,EAAGO,CAAC,EAC9Cg1B,EAAKn4B,GAAK,CAAC,EAAIm7B,EAAG,IAClBlK,EAAGjxB,GAAK,CAAC,EAAIm7B,EAAG,IAAI,IACrB,KAED,SAASn7B,EAAI,EAAGA,EAAI+I,EAAK/I,GAAK,EAAG,CAC/B,MAAM2zB,EAAIyB,EAAGp1B,CAAC,EAAK,mBACb,EAAIo1B,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KACrB4C,EAAIwyB,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KACrBmD,EAAIiyB,EAAGp1B,EAAI,CAAC,GAAK,EAAI,KAG3B,IADAm7B,EAAKpU,EACEoU,EAAG,MACRA,EAAKD,EAASC,EAAG,IAAKxH,EAAG,EAAG/wB,EAAGO,CAAC,GAAK,EAAIg4B,EAAG,KAAOA,EAAG,MACxDhD,EAAKn4B,GAAK,CAAC,EAAIm7B,EAAG,IAClBlK,EAAGjxB,GAAK,CAAC,EAAIm7B,EAAG,IAAI,IACrB,CACH,MAAO,CAAE,KAAM1E,EAAK,OAAQ,KAAA0B,EAAM,KAAM8C,EAC1C,EAEAtL,EAAK,SAAS,UAAY,SAAU8G,EAAMJ,EAAI3a,EAAK,CAC7CA,IAAQ,OAAMA,EAAM,MACxB,MAAMqf,EAAS,IAAI,YAAYtE,EAAK,MAAM,EAEpC1P,EAAO,CACX,GAAI,EACJ,GAAI0P,EAAK,OACT,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACX,EACE1P,EAAK,IAAM4I,EAAK,SAAS,MAAM8G,EAAM1P,EAAK,GAAIA,EAAK,EAAE,EACrDA,EAAK,IAAM4I,EAAK,SAAS,OAAO5I,EAAK,GAAG,EACxC,MAAMkU,EAAQ,CAAClU,CAAI,EAEnB,KAAOkU,EAAM,OAAS5E,GAAI,CACxB,IAAI+E,EAAO,EACPC,EAAK,EACT,QAASr7B,EAAI,EAAGA,EAAIi7B,EAAM,OAAQj7B,IAC5Bi7B,EAAMj7B,CAAC,EAAE,IAAI,EAAIo7B,IACnBA,EAAOH,EAAMj7B,CAAC,EAAE,IAAI,EACpBq7B,EAAKr7B,GAET,GAAIo7B,EAAO1f,EAAK,MAChB,MAAM5F,EAAOmlB,EAAMI,CAAE,EAEfhK,EAAK1B,EAAK,SAAS,YACvB8G,EACAsE,EACAjlB,EAAK,GACLA,EAAK,GACLA,EAAK,IAAI,EACTA,EAAK,IAAI,MACf,EAEI,GADgBA,EAAK,IAAMub,GAAMvb,EAAK,IAAMub,EAC/B,CACXvb,EAAK,IAAI,EAAI,EACb,QACD,CAED,MAAMwlB,EAAK,CACT,GAAIxlB,EAAK,GACT,GAAIub,EACJ,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACb,EACIiK,EAAG,IAAM3L,EAAK,SAAS,MAAM8G,EAAM6E,EAAG,GAAIA,EAAG,EAAE,EAC/CA,EAAG,IAAM3L,EAAK,SAAS,OAAO2L,EAAG,GAAG,EACpC,MAAMC,EAAK,CACT,GAAIlK,EACJ,GAAIvb,EAAK,GACT,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACb,EACIylB,EAAG,IAAM,CAAE,EAAG,CAAE,EAAE,EAAG,CAAE,EAAE,EAAGzlB,EAAK,IAAI,EAAIwlB,EAAG,IAAI,CAAC,EACjD,QAASt7B,EAAI,EAAGA,EAAI,GAAIA,IAAKu7B,EAAG,IAAI,EAAEv7B,CAAC,EAAI8V,EAAK,IAAI,EAAE9V,CAAC,EAAIs7B,EAAG,IAAI,EAAEt7B,CAAC,EACrE,QAASA,EAAI,EAAGA,EAAI,EAAGA,IAAKu7B,EAAG,IAAI,EAAEv7B,CAAC,EAAI8V,EAAK,IAAI,EAAE9V,CAAC,EAAIs7B,EAAG,IAAI,EAAEt7B,CAAC,EACpEu7B,EAAG,IAAM5L,EAAK,SAAS,OAAO4L,EAAG,GAAG,EAEpCzlB,EAAK,KAAOwlB,EACZxlB,EAAK,MAAQylB,EACbN,EAAMI,CAAE,EAAIC,EACZL,EAAM,KAAKM,CAAE,CACd,CACDN,EAAM,KAAK,SAAU93B,EAAGP,EAAG,CACzB,OAAOA,EAAE,IAAI,EAAIO,EAAE,IAAI,CAC3B,CAAG,EACD,QAASnD,EAAI,EAAGA,EAAIi7B,EAAM,OAAQj7B,IAAKi7B,EAAMj7B,CAAC,EAAE,IAAMA,EACtD,MAAO,CAAC+mB,EAAMkU,CAAK,CACrB,EAEAtL,EAAK,SAAS,WAAa,SAAUwL,EAAIxH,EAAGwD,EAAGv0B,EAAGO,EAAG,CACnD,GAAIg4B,EAAG,MAAQ,KACb,OAAAA,EAAG,KAAOxL,EAAK,SAAS,KAAKwL,EAAG,IAAI,EAAGxH,EAAGwD,EAAGv0B,EAAGO,CAAC,EAC1Cg4B,EAET,MAAMD,EAAWvL,EAAK,SAAS,SAASwL,EAAG,IAAKxH,EAAGwD,EAAGv0B,EAAGO,CAAC,EAE1D,IAAIq4B,EAAQL,EAAG,KACXM,EAAQN,EAAG,MACXD,EAAW,IACbM,EAAQL,EAAG,MACXM,EAAQN,EAAG,MAGb,MAAMG,EAAK3L,EAAK,SAAS,WAAW6L,EAAO7H,EAAGwD,EAAGv0B,EAAGO,CAAC,EACrD,GAAIm4B,EAAG,MAAQJ,EAAWA,EAAU,OAAOI,EAC3C,MAAMC,EAAK5L,EAAK,SAAS,WAAW8L,EAAO9H,EAAGwD,EAAGv0B,EAAGO,CAAC,EACrD,OAAOo4B,EAAG,KAAOD,EAAG,KAAOC,EAAKD,CAClC,EACA3L,EAAK,SAAS,SAAW,SAAU+L,EAAK/H,EAAGwD,EAAGv0B,EAAGO,EAAG,CAClD,MAAMtO,EAAI6mC,EAAI,EACd,OAAO7mC,EAAE,CAAC,EAAI8+B,EAAI9+B,EAAE,CAAC,EAAIsiC,EAAItiC,EAAE,CAAC,EAAI+N,EAAI/N,EAAE,CAAC,EAAIsO,EAAIu4B,EAAI,GACzD,EACA/L,EAAK,SAAS,KAAO,SAAU5N,EAAG4R,EAAGwD,EAAGv0B,EAAGO,EAAG,CAC5C,MAAMw4B,EAAKhI,EAAI5R,EAAE,CAAC,EACZ6Z,EAAKzE,EAAIpV,EAAE,CAAC,EACZ8Z,EAAKj5B,EAAImf,EAAE,CAAC,EACZ+Z,EAAK34B,EAAI4e,EAAE,CAAC,EAClB,OAAO4Z,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,CAC5C,EAEAnM,EAAK,SAAS,YAAc,SAAU8G,EAAMsE,EAAQltB,EAAIC,EAAIjZ,EAAGknC,EAAK,CAClE,MAAMC,EAASrM,EAAK,SAAS,OAG7B,IAFA7hB,GAAM,EAECD,EAAKC,GAAI,CACd,KAAOkuB,EAAOvF,EAAM5oB,EAAIhZ,CAAC,GAAKknC,GAAKluB,GAAM,EACzC,KAAOmuB,EAAOvF,EAAM3oB,EAAIjZ,CAAC,EAAIknC,GAAKjuB,GAAM,EACxC,GAAID,GAAMC,EAAI,MAEd,MAAMxK,EAAIy3B,EAAOltB,GAAM,CAAC,EACxBktB,EAAOltB,GAAM,CAAC,EAAIktB,EAAOjtB,GAAM,CAAC,EAChCitB,EAAOjtB,GAAM,CAAC,EAAIxK,EAElBuK,GAAM,EACNC,GAAM,CACP,CACD,KAAOkuB,EAAOvF,EAAM5oB,EAAIhZ,CAAC,EAAIknC,GAAKluB,GAAM,EACxC,OAAOA,EAAK,CACd,EACA8hB,EAAK,SAAS,OAAS,SAAU8G,EAAMz2B,EAAGnL,EAAG,CAC3C,OACE4hC,EAAKz2B,CAAC,EAAInL,EAAE,CAAC,EACb4hC,EAAKz2B,EAAI,CAAC,EAAInL,EAAE,CAAC,EACjB4hC,EAAKz2B,EAAI,CAAC,EAAInL,EAAE,CAAC,EACjB4hC,EAAKz2B,EAAI,CAAC,EAAInL,EAAE,CAAC,CAErB,EACA86B,EAAK,SAAS,MAAQ,SAAU8G,EAAM5oB,EAAIC,EAAI,CAC5C,MAAMglB,EAAI,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnDpwB,EAAI,CAAC,EAAG,EAAG,EAAG,CAAC,EACfkwB,EAAK9kB,EAAKD,GAAO,EACvB,QAAS7N,EAAI6N,EAAI7N,EAAI8N,EAAI9N,GAAK,EAAG,CAC/B,MAAM2zB,EAAI8C,EAAKz2B,CAAC,EAAK,mBACfm3B,EAAIV,EAAKz2B,EAAI,CAAC,GAAK,EAAI,KACvB4C,EAAI6zB,EAAKz2B,EAAI,CAAC,GAAK,EAAI,KACvBmD,EAAIszB,EAAKz2B,EAAI,CAAC,GAAK,EAAI,KAC7B0C,EAAE,CAAC,GAAKixB,EACRjxB,EAAE,CAAC,GAAKy0B,EACRz0B,EAAE,CAAC,GAAKE,EACRF,EAAE,CAAC,GAAKS,EAER2vB,EAAE,CAAC,GAAKa,EAAIA,EACZb,EAAE,CAAC,GAAKa,EAAIwD,EACZrE,EAAE,CAAC,GAAKa,EAAI/wB,EACZkwB,EAAE,CAAC,GAAKa,EAAIxwB,EACZ2vB,EAAE,CAAC,GAAKqE,EAAIA,EACZrE,EAAE,CAAC,GAAKqE,EAAIv0B,EACZkwB,EAAE,CAAC,GAAKqE,EAAIh0B,EACZ2vB,EAAE,EAAE,GAAKlwB,EAAIA,EACbkwB,EAAE,EAAE,GAAKlwB,EAAIO,EACb2vB,EAAE,EAAE,GAAK3vB,EAAIA,CACd,CACD,OAAA2vB,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,EAAE,EAAIA,EAAE,CAAC,EACXA,EAAE,EAAE,EAAIA,EAAE,CAAC,EACXA,EAAE,EAAE,EAAIA,EAAE,EAAE,EAEL,CAAE,EAAAA,EAAG,EAAApwB,EAAG,EAAAkwB,EACjB,EACAjD,EAAK,SAAS,OAAS,SAAUsM,EAAO,CACtC,MAAMnJ,EAAImJ,EAAM,EACVv5B,EAAIu5B,EAAM,EACVrJ,EAAIqJ,EAAM,EAGVC,EAAKx5B,EAAE,CAAC,EACRy5B,EAAKz5B,EAAE,CAAC,EACR05B,EAAK15B,EAAE,CAAC,EACR25B,EAAK35B,EAAE,CAAC,EACR45B,EAAK1J,IAAM,EAAI,EAAI,EAAIA,EACvB2J,EAAK,CACTzJ,EAAE,CAAC,EAAIoJ,EAAKA,EAAKI,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKC,EAAKG,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKE,EAAKE,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKG,EAAKC,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKD,EAAKI,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKA,EAAKG,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKC,EAAKE,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKE,EAAKC,EACjBxJ,EAAE,CAAC,EAAIsJ,EAAKF,EAAKI,EACjBxJ,EAAE,CAAC,EAAIsJ,EAAKD,EAAKG,EACjBxJ,EAAE,EAAE,EAAIsJ,EAAKA,EAAKE,EAClBxJ,EAAE,EAAE,EAAIsJ,EAAKC,EAAKC,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKH,EAAKI,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKF,EAAKG,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKD,EAAKE,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKA,EAAKC,CACtB,EAEQjJ,EAAIkJ,EACJjJ,EAAI3D,EAAK,GACf,IAAI/sB,EAAI,CAAC,KAAK,OAAM,EAAI,KAAK,SAAU,KAAK,OAAQ,EAAE,KAAK,OAAQ,CAAA,EAC/Dy4B,EAAK,EACLmB,EAAM,EAEV,GAAI5J,IAAM,EACR,QAAS5yB,EAAI,EAAGA,EAAI,KAClB4C,EAAI0wB,EAAE,QAAQD,EAAGzwB,CAAC,EAClB45B,EAAM,KAAK,KAAKlJ,EAAE,IAAI1wB,EAAGA,CAAC,CAAC,EAC3BA,EAAI0wB,EAAE,IAAI,EAAIkJ,EAAK55B,CAAC,EAChB,EAAA5C,IAAM,GAAK,KAAK,IAAIw8B,EAAMnB,CAAE,EAAI,OAJdr7B,IAKtBq7B,EAAKmB,EAET,MAAMza,EAAI,CAACma,EAAKI,EAAIH,EAAKG,EAAIF,EAAKE,EAAID,EAAKC,CAAE,EACvCG,EAASnJ,EAAE,IAAIA,EAAE,IAAI,IAAKvR,CAAC,EAAGnf,CAAC,EAErC,MAAO,CACL,IAAK25B,EACL,EAAAxa,EACA,EAAGnf,EACH,EAAGy4B,EACH,OAAAoB,EACA,IAAKnJ,EAAE,IAAI1wB,EAAGmf,CAAC,EACf,MACI,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,GACzB,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,GAC1B,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,EAC1B,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,KAC7B,CACN,CACA,EACA4N,EAAK,GAAK,CACR,QAAS,SAAUjtB,EAAGtK,EAAG,CACvB,MAAO,CACLsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EACpDsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EACpDsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,CAAC,EAAItK,EAAE,CAAC,EAAIsK,EAAE,EAAE,EAAItK,EAAE,CAAC,EAAIsK,EAAE,EAAE,EAAItK,EAAE,CAAC,EACtDsK,EAAE,EAAE,EAAItK,EAAE,CAAC,EAAIsK,EAAE,EAAE,EAAItK,EAAE,CAAC,EAAIsK,EAAE,EAAE,EAAItK,EAAE,CAAC,EAAIsK,EAAE,EAAE,EAAItK,EAAE,CAAC,CAC9D,CACG,EACD,IAAK,SAAU0Y,EAAGsgB,EAAG,CACnB,OAAOtgB,EAAE,CAAC,EAAIsgB,EAAE,CAAC,EAAItgB,EAAE,CAAC,EAAIsgB,EAAE,CAAC,EAAItgB,EAAE,CAAC,EAAIsgB,EAAE,CAAC,EAAItgB,EAAE,CAAC,EAAIsgB,EAAE,CAAC,CAC5D,EACD,IAAK,SAAUjuB,EAAGiuB,EAAG,CACnB,MAAO,CAACjuB,EAAIiuB,EAAE,CAAC,EAAGjuB,EAAIiuB,EAAE,CAAC,EAAGjuB,EAAIiuB,EAAE,CAAC,EAAGjuB,EAAIiuB,EAAE,CAAC,CAAC,CAC/C,CACH,EAEAzB,EAAK,OAAO,WAAa,SAAUyG,EAAM,CACvC,IAAIsG,EAAO,EACX,QAAS18B,EAAI,EAAGA,EAAIo2B,EAAK,OAAQp2B,IAAK08B,GAAQtG,EAAKp2B,CAAC,EAAE,WACtD,MAAMy2B,EAAO,IAAI,WAAWiG,CAAI,EAChC,IAAIC,EAAO,EACX,QAAS38B,EAAI,EAAGA,EAAIo2B,EAAK,OAAQp2B,IAAK,CACpC,MAAM6vB,EAAM,IAAI,WAAWuG,EAAKp2B,CAAC,CAAC,EAC5B48B,EAAK/M,EAAI,OACf,QAAS1kB,EAAI,EAAGA,EAAIyxB,EAAIzxB,GAAK,EAAG,CAC9B,IAAIwoB,EAAI9D,EAAI1kB,CAAC,EACTgsB,EAAItH,EAAI1kB,EAAI,CAAC,EACbvI,EAAIitB,EAAI1kB,EAAI,CAAC,EACjB,MAAMhI,EAAI0sB,EAAI1kB,EAAI,CAAC,EACfhI,IAAM,IAAGwwB,EAAIwD,EAAIv0B,EAAI,GACzB6zB,EAAKkG,EAAOxxB,CAAC,EAAIwoB,EACjB8C,EAAKkG,EAAOxxB,EAAI,CAAC,EAAIgsB,EACrBV,EAAKkG,EAAOxxB,EAAI,CAAC,EAAIvI,EACrB6zB,EAAKkG,EAAOxxB,EAAI,CAAC,EAAIhI,CACtB,CACDw5B,GAAQC,CACT,CACD,OAAOnG,EAAK,MACd,ECt8Da,MAAAoG,GAAgB,CAC3BC,EACApoC,IACG,CACG,MAAAqoC,EAAQ,IAAI,MAClBA,EAAM,OAAS,UAAY,CACtBroC,EAAA,KAAM,CAAE,MAAOqoC,EAAM,MAAO,OAAQA,EAAM,OAAQ,CAAA,EAEjDA,EAAA,QAAU,SAAUrhB,EAAK,CAC7BhnB,EAAGgnB,EAAK,IAAI,CAAA,EAEdqhB,EAAM,IAAMD,CACd,EAGaE,GAAa,CACxB7nC,EACA+P,IACG,CACE/P,GACH+P,EAAS,WAAY,IAAI,EAE3B,QAASlF,EAAI,EAAGC,EAAI9K,EAAM,OAAQ6K,EAAIC,EAAGD,IAAK,CACtC,MAAA3K,EAAOF,EAAM6K,CAAC,EACd,CAAE,KAAAe,CAAS,EAAA1L,EACX4nC,EAAUl8B,EAAK,MAAM,GAAG,EAC1B,GAAAk8B,EAAQ,CAAC,IAAM,QAAS,OAC5B,IAAIC,EAAWD,EAAQ,CAAC,EAAE,YAAY,EAChC,MAAAxnC,EAAS,IAAI,WACZA,EAAA,OAAS,SAAUZ,EAAQ,CAC1B,MAAA4B,EAAS5B,EAAE,OAAO,OAClBsoC,EAAYC,GAAa3mC,CAAM,EACjC0mC,IACSD,EAAAC,GAEb,MAAMvmC,EAAO,IAAI,KAAK,CAACH,CAAM,CAAC,EACV4mC,GAAAzmC,EAAM,SAAU0mC,EAAwB,CACtDA,EACYT,GAAAS,EAAUC,GAAY,CAClC,GAAIA,EAAS,CACX,MAAMC,EAAYC,GAChBH,EACAC,EAAQ,MACRA,EAAQ,MAAA,EAEV,GAAIC,EAAW,CACb,MAAME,EAAmB,CACvB,KAAMroC,EAAK,KACX,SAAA6nC,EACA,KAAM7nC,EAAK,KACX,MAAOkoC,EAAQ,MACf,OAAQA,EAAQ,OAChB,OAAQD,EACR,UAAAE,EACA,KAAA5mC,CAAA,EAEFsO,EAAS,KAAMw4B,CAAO,CAAA,MAEtBx4B,EAAS,eAAgB,IAAI,CAC/B,MAEAA,EAAS,oBAAqB,IAAI,CACpC,CACD,EAEDA,EAAS,eAAgB,IAAI,CAC/B,CACD,CAAA,EAEHzP,EAAO,kBAAkBJ,CAAI,CAC/B,CACF,EAGa+nC,GAAgB3mC,GAAwB,CACnD,IAAIymC,EAAW,GACf,GAAIzmC,EAAQ,CAEV,MAAMknC,EADO,IAAI,SAASlnC,CAAM,EACR,UAAU,EAAG,EAAK,EAE1C,OADiB,OAAOknC,CAAU,EAAE,SAAS,EAAE,EAAE,cAC/B,CAChB,IAAK,WACQT,EAAA,MACX,MACF,IAAK,WACL,IAAK,WACL,IAAK,WACL,IAAK,WACQA,EAAA,OACX,MACF,IAAK,WACQA,EAAA,MACX,MACF,IAAK,WACQA,EAAA,MACX,MACF,IAAK,WACQA,EAAA,OACX,KAGJ,CACF,CACO,OAAAA,CACT,EAGaG,GAAsB,CACjCz/B,EACAlJ,IACG,CACH,GAAI,CAACkJ,EAAK,CACRlJ,EAAG,SAAU,IAAI,EACjB,MACF,CACM,MAAAe,EAAS,IAAI,WACZA,EAAA,OAAS,SAAUZ,EAAG,CACvBA,EAAE,OACDH,EAAA,KAAMG,EAAE,OAAO,MAAgB,EAElCH,EAAG,aAAc,IAAI,CACvB,EAEFe,EAAO,cAAcmI,CAAG,CAC1B,EAGa6/B,GAAmB,CAC9BX,EACAr9B,EACA/E,IACG,CACC,GAAAoiC,GAAUr9B,GAAS/E,EAAQ,CACvB,MAAAm1B,EAAM,IAAI,MAChBA,EAAI,IAAMiN,EACJ,MAAAl2B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,UAAUgpB,EAAK,EAAG,EAAGpwB,EAAO/E,CAAM,EACpBmM,EAAI,aAAa,EAAG,EAAGpH,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAGakjC,GAA0B,CACrCC,EACAp+B,EAAQ,EACR/E,EAAS,IACN,CACC,GAAAmjC,GAASp+B,GAAS/E,EAAQ,CACtB,MAAAkM,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,UAAUg3B,EAAO,EAAG,EAAGp+B,EAAO/E,CAAM,EACtBmM,EAAI,aAAa,EAAG,EAAGpH,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAGaojC,GAA2B,CACtCC,EACAt+B,EAAQ,EACR/E,EAAS,IACN,CACC,GAAAqjC,GAAet+B,GAAS/E,EAAQ,CAC5B,MAAAkM,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,UAAUk3B,EAAa,EAAG,EAAGt+B,EAAO/E,CAAM,EAC5BmM,EAAI,aAAa,EAAG,EAAGpH,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAEasjC,GAAqBR,GAAyB,CAMzD,MAAMS,EAAUT,EAAU,MACpBU,EAAWV,EAAU,OACrBW,EAAcF,EAAUC,EAAW,EACnCE,EAASD,EAAc,GAWvBE,EAAmB,CAEvB,GACA,GAEAD,EAAS,IACRA,GAAU,EAAK,IACfA,GAAU,GAAM,IAChBA,GAAU,GAAM,IAEjB,EACA,EAEA,EACA,EAEA,GACA,EACA,EACA,CAAA,EAkBIE,EAAmB,CAEvB,GACA,EACA,EACA,EAEAL,EAAU,IACTA,GAAW,EAAK,IAChBA,GAAW,GAAM,IACjBA,GAAW,GAAM,IAElBC,EAAW,IACVA,GAAY,EAAK,IACjBA,GAAY,GAAM,IAClBA,GAAY,GAAM,IAEnB,EACA,EAGA,GACA,EAEA,EACA,EACA,EACA,EAEAC,EAAc,IACbA,GAAe,EAAK,IACpBA,GAAe,GAAM,IACrBA,GAAe,GAAM,IAEtB,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,CAAA,EAGII,GAAY,EAAMN,EAAU,EAAK,GAAM,EACvCO,EAAWhB,EAAU,KAE3B,IAAIiB,EAAe,GACnB,MAAMC,EAAWT,GAAW,EAC5B,IAAI7M,EAAI8M,EACR,MAAMS,EAAe,OAAO,aAEzB,EAAA,CACK,MAAAC,EAAWF,GAAYtN,EAAI,GACjC,IAAIyN,EAAc,GAClB,QAAS/tB,EAAI,EAAGA,EAAImtB,EAASntB,IAAK,CAChC,MAAMguB,EAAWhuB,GAAK,EACtB+tB,GACEF,EAAaH,EAASI,EAAWE,EAAW,CAAC,CAAC,EAC9CH,EAAaH,EAASI,EAAWE,EAAW,CAAC,CAAC,EAC9CH,EAAaH,EAASI,EAAWE,CAAQ,CAAC,CAC9C,CAEA,QAAS/mC,EAAI,EAAGA,EAAIwmC,EAAUxmC,IACb8mC,GAAA,OAAO,aAAa,CAAC,EAGtBJ,GAAAI,QACT,EAAEzN,GAEX,SAAS2N,EAAW/lC,EAAsB,CACpC,GAAA,CAAC,OAAO,KACJ,KAAA,iBAER,IAAI+D,EAAM,GACN,GAAA,OAAO/D,GAAQ,SACX+D,EAAA/D,MAEN,SAASgH,EAAI,EAAGA,EAAIhH,EAAK,OAAQgH,IAC/BjD,GAAO,OAAO,aAAa/D,EAAKgH,CAAC,CAAC,EAGtC,OAAO,KAAKjD,CAAG,CACjB,CAEA,OACEgiC,EAAWV,EAAiB,OAAOC,CAAgB,CAAC,EACpDS,EAAWN,CAAY,CAE3B,EAGaO,GAAsBxB,GAAyB,CAC1D,GAAI,CAACA,EACI,OAAA,KAEH,KAAA,CAAE,MAAA/9B,EAAO,OAAA/E,CAAW,EAAA8iC,EACpB52B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,aAAa22B,EAAW,EAAG,EAAG,EAAG,EAAG/9B,EAAO/E,CAAM,EACrCkM,EAAO,UAAU,WAAW,CAE9C,EAGaq4B,GAAkB,CAC7BzB,EACA0B,EAAkB,MAClBxqC,IACG,CACH,GAAI,CAAC8oC,EAAW,CACd9oC,EAAG,eAAgB,IAAI,EACvB,MACF,CACM,KAAA,CAAE,MAAA+K,EAAO,OAAA/E,CAAW,EAAA8iC,EACpB52B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClCA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,aAAa22B,EAAW,EAAG,EAAG,EAAG,EAAG/9B,EAAO/E,CAAM,EACrD,MAAMykC,EAAc,SAClBD,EAAkBA,EAAgB,cAAgB,KACpD,GACOt4B,EAAA,OACJhQ,GAAsB,CACrBlC,EAAG,KAAMkC,CAAI,CACf,EACAuoC,EACA,CAAA,CAEJ,EAGaC,GAAc,CAACxoC,EAAYlC,IAA2B,CAC7C2oC,GAAAzmC,EAAM,SAAU8kB,EAAK4hB,EAAwB,CAC/D,GAAIA,EAAS,CACL,MAAAP,EAAQ,IAAI,MAClBA,EAAM,IAAMO,CAAA,MAEZ5oC,EAAGgnB,CAAG,CACR,CACD,CACH,EAGa2jB,GAAe,CAACzoC,EAAY0oC,IAAoB,CAC3D,GAAI,CAAC1oC,EAAM,OACL,MAAAuM,EAAI,SAAS,cAAc,GAAG,EACpCA,EAAE,MAAM,WAAa,SACZ,SAAA,KAAK,YAAYA,CAAC,EAC3BA,EAAE,SAAWm8B,EACb,MAAMC,EAAS,OAAO,IAAI,gBAAgB3oC,CAAI,EAC9CuM,EAAE,KAAOo8B,EACTp8B,EAAE,MAAM,EACC,SAAA,KAAK,YAAYA,CAAC,EACpB,OAAA,IAAI,gBAAgBo8B,CAAM,CACnC,EAGgB,SAAAC,GACdjnC,EACA7D,EACA,CACM,MAAAqoC,EAAQ,IAAI,MAClBA,EAAM,OAAS,UAAY,CACzBroC,EAAG,KAAMqoC,CAAK,CAAA,EAEhBA,EAAM,QAAU,UAAY,CAC1BroC,EAAG,IAAI,MAAM,2BAA6B6D,CAAG,EAAG,IAAI,CAAA,EAEtDwkC,EAAM,IAAMxkC,CACd,CAMO,SAASknC,IAAiB,CACzB,MAAAC,EAAO,SAAS,qBAAqB,KAAK,EAC1CC,EAAarmC,GAAkB,EAAA,OACrC,IAAI+L,EAAQ,EACZ,MAAO,IAAM,CACX,QAAS,EAAIA,EAAO,EAAIq6B,EAAK,OAAQ,IAE/BA,EAAK,CAAC,EAAE,sBAAsB,EAAE,IAAMC,IACnCD,EAAA,CAAC,EAAE,IAAMA,EAAK,CAAC,EAAE,aAAa,UAAU,GAAK,GAClDr6B,EAAQ,EAAI,EAEhB,CAEJ,CAGgB,SAAAu6B,GACd9C,EACApoC,EACA,CACcmoC,GAAAC,EAASS,GAAY,CACjC,GAAI,CAACA,EAAgB,OAAA7oC,EAAG,gBAAiB,IAAI,EAC7C,MAAMmrC,EAAkBpC,GACtBX,EACAS,EAAQ,MACRA,EAAQ,MAAA,EAEV,GAAI,CAACsC,EAAwB,OAAAnrC,EAAG,uBAAwB,IAAI,EAC5D,MAAM8oC,EAAYqC,EAAgB,KAClC,IAAI10B,EAAI,EACR,MAAM20B,EAAO,CAAA,EACPC,EAAO,CAAA,EACPC,EAAO,CAAA,EACb,QAAShgC,EAAI,EAAGA,EAAIw9B,EAAU,OAAQx9B,GAAK,EACpC8/B,EAAA30B,CAAC,EAAIqyB,EAAUx9B,CAAC,EACrB+/B,EAAK50B,CAAC,EAAIqyB,EAAUx9B,EAAI,CAAC,EACzBggC,EAAK70B,CAAC,EAAIqyB,EAAUx9B,EAAI,CAAC,EACpBmL,GAAA,EAED,MAAA2nB,EAAImN,GAAoBH,CAAI,EAC5BI,EAAID,GAAoBF,CAAI,EAC5BI,EAAIF,GAAoBD,CAAI,EAC3B,OAAAtrC,EAAG,KAAM,OAASo+B,EAAI,IAAMoN,EAAI,IAAMC,EAAI,GAAG,CAAA,CACrD,CACH,CAEA,SAASF,GAAoBlgC,EAAe,CAC1C,MAAMqgC,EAAW,CAAA,EACXC,EAAiB,CAAA,EACjBC,EAAmB,CAAA,EACzB,QAAStgC,EAAI,EAAGA,EAAID,EAAI,OAAQC,IACzBogC,EAASrgC,EAAIC,CAAC,CAAC,EAGHqgC,EAAA,KAAKtgC,EAAIC,CAAC,CAAC,EAFjBogC,EAAArgC,EAAIC,CAAC,CAAC,EAAI,EAKvB,IAAI7H,EAAI,EACR,QAAS6H,EAAI,EAAGA,EAAIqgC,EAAe,OAAQrgC,IAAK,CAC1C7H,EAAA,EACJ,QAASgT,EAAI,EAAGA,EAAIk1B,EAAe,OAAQl1B,IACrCk1B,EAAergC,CAAC,IAAMqgC,EAAel1B,CAAC,IACnChT,GAAA,GAEPmoC,EAAiBtgC,CAAC,EAAI7H,CAE1B,CACA,MAAMoqB,EAAM,KAAK,IAAI,MAAM,KAAM+d,CAAgB,EACjD,IAAIC,EAAW,EACR,KAAAA,EAAWD,EAAiB,OAAQC,IACrC,GAAAD,EAAiBC,CAAQ,IAAMhe,EACjC,OAGJ,OAAO8d,EAAeE,CAAQ,CAChC,CAGa,MAAAC,GAAkBhD,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,CAAC,EAClD2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,EAC1D2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,EAC1D2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,CACvE,CAGK,OADc,IAAI,UAAU2vB,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaimC,GAAkBnD,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,CAAC,EACrD2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,EAClC2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,EAClC2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,CAC/C,CAGK,OADc,IAAI,UAAU2vB,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGakmC,GAAcpD,GAAyB,CAClD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAAS8X,EAAI,EAAGA,EAAIrR,EAAOqR,IACzB,QAASsgB,EAAI,EAAGA,EAAI12B,EAAQ02B,IAAK,CACzB,MAAAsP,GAAc5vB,EAAIpW,EAAS02B,GAAK,EAC3BqP,EAAAC,CAAU,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,CAAC,EAClD2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,EAC1D2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,EAC1D2vB,EAAAC,EAAa,CAAC,EAAI1nC,GAAMo4B,EAAI3xB,EAAQA,EAAQqR,EAAI,GAAK,EAAI,CAAC,CACvE,CAGK,OADc,IAAI,UAAU2vB,EAAY/lC,EAAQ+E,CAAK,CAE9D,CACO,OAAA,IACT,EAGaohC,GAAerD,GAAyB,CACnD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAAS8X,EAAI,EAAGA,EAAIrR,EAAOqR,IACzB,QAASsgB,EAAI,EAAGA,EAAI12B,EAAQ02B,IAAK,CACzB,MAAAsP,GAAc5vB,EAAIpW,EAAS02B,GAAK,EAC3BqP,EAAAC,CAAU,EAAI1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,CAAC,EACrD2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,EAClC2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,EAClC2vB,EAAAC,EAAa,CAAC,EACvB1nC,IAAO0B,EAAS02B,EAAI,GAAK3xB,EAAQqR,GAAK,EAAI,CAAC,CAC/C,CAGK,OADc,IAAI,UAAU2vB,EAAY/lC,EAAQ+E,CAAK,CAE9D,CACO,OAAA,IACT,EAGaqhC,GAAUtD,GAAyB,CAC9C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC/BiwB,GACH/nC,EAAK0nC,CAAU,EAAI1nC,EAAK0nC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,GAAK,EACrED,EAAWC,CAAU,EAAIK,EACdN,EAAAC,EAAa,CAAC,EAAIK,EAClBN,EAAAC,EAAa,CAAC,EAAIK,EAC7BN,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGasmC,GAAmBxD,GAAyB,CACvD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAG/BmwB,GADHjoC,EAAK0nC,CAAU,EAAI1nC,EAAK0nC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,GAAK,EACzC,IAAM,IAAM,EACxCD,EAAWC,CAAU,EAAIO,EACdR,EAAAC,EAAa,CAAC,EAAIO,EAClBR,EAAAC,EAAa,CAAC,EAAIO,EAC7BR,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGawmC,GAAc1D,GAAyB,CAClD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC2vB,EAAWC,CAAU,EAAI,IAAM1nC,EAAK0nC,CAAU,EAC9CD,EAAWC,EAAa,CAAC,EAAI,IAAM1nC,EAAK0nC,EAAa,CAAC,EACtDD,EAAWC,EAAa,CAAC,EAAI,IAAM1nC,EAAK0nC,EAAa,CAAC,EACtDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaymC,GAAS3D,GAAyB,CAC7C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAI,EAClBD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa0mC,GAAW5D,GAAyB,CAC/C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC2vB,EAAWC,CAAU,EAAI,EACzBD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa2mC,GAAU7D,GAAyB,CAC9C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC2vB,EAAWC,CAAU,EAAI,EACdD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa4mC,GAAiB9D,GAAyB,CACrD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa6mC,GAAgB/D,GAAyB,CACpD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa8mC,GAAkBhE,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC2vB,EAAWC,CAAU,EAAI,EACzBD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa+mC,GAAgBjE,GAAyB,CACpD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC/B4wB,GAAa1oC,EAAK0nC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,GAAK,EACvDD,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAIgB,EAClBjB,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGainC,GAAkBnE,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC/B4wB,GAAa1oC,EAAK0nC,CAAU,EAAI1nC,EAAK0nC,EAAa,CAAC,GAAK,EAC9DD,EAAWC,CAAU,EAAIgB,EACzBjB,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaknC,GAAiBpE,GAAyB,CACrD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC/B4wB,GAAa1oC,EAAK0nC,CAAU,EAAI1nC,EAAK0nC,EAAa,CAAC,GAAK,EAC9DD,EAAWC,CAAU,EAAIgB,EACdjB,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGamnC,GAAWrE,GAClBA,EAEmBsE,GAAkBtE,EADxB,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAE,CACO,EAGnD,KAIIuE,GAAiBvE,GACxBA,EAEmBsE,GAAkBtE,EADxB,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAE,CACO,EAGnD,KAIIwE,GAAYxE,GAAyB,CAChD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,GAC/B,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaunC,GAAYzE,GAAyB,CAChD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC,GAAI9X,EAAK0nC,EAAa,CAAC,IAAM,EAC3BD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,QACxB,CACL,MAAMO,EAAWiB,GACf,CACElpC,EAAK0nC,CAAU,EACf1nC,EAAK0nC,EAAa,CAAC,EACnB1nC,EAAK0nC,EAAa,CAAC,EACnB1nC,EAAK0nC,EAAa,CAAC,CACrB,EACA,CAAC,IAAK,IAAK,IAAK,GAAG,CAAA,EAEVD,EAAAC,CAAU,EAAIO,EAAS,CAAC,EACnCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,EACvCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,EACvCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,CACzC,CACF,CAGK,OADc,IAAI,UAAUR,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAaaynC,GAAW,CACtB3E,EACA4E,EACAC,EACA3c,EACAlI,EACA8kB,EAAqB,GACrBnF,IACG,CACH,GAAIK,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAChC,IAAI+E,EAAY/kB,EACZglB,EAAW9c,EACX+c,EAAaL,EACbM,EAAcL,EA4BlB,GA3BIE,EAAY,EACFA,EAAA,EACHA,EAAY9iC,IACT8iC,EAAA9iC,GAEV+iC,EAAW,EACFA,EAAA,EACFA,EAAW9nC,IACT8nC,EAAA9nC,GAET+nC,EAAa,EACFA,EAAA,EACJA,EAAahjC,IACTgjC,EAAAhjC,GAEXijC,EAAc,EACFA,EAAA,EACLA,EAAchoC,IACTgoC,EAAAhoC,GAEZ6nC,EAAYE,EAAahjC,IAC3BgjC,EAAahjC,EAAQ8iC,GAEnBC,EAAWE,EAAchoC,IAC3BgoC,EAAchoC,EAAS8nC,GAGrBF,EAAoB,CACtB,MAAM7B,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAEnCA,GAAKyxB,GACLzxB,GAAKyxB,EAAYE,GACjBrR,GAAKoR,GACLpR,GAAKoR,EAAWE,GAELjC,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,IAEhDD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAC7BD,EAAWC,EAAa,CAAC,EACvBvD,GAAa,CAAC,MAAO,MAAM,EAAE,SAASA,EAAU,YAAa,CAAA,EACzD,IACA,EAEV,CAGK,OADc,IAAI,UAAUsD,EAAYhhC,EAAO/E,CAAM,CACrD,KACF,CACL,MAAM+lC,EAAa,IAAI,kBAAkBgC,EAAaC,EAAc,CAAC,EACrE,QAAStR,EAAIoR,EAAUpR,GAAKoR,EAAWE,EAAatR,IAClD,QAAStgB,EAAIyxB,EAAWzxB,GAAKyxB,EAAYE,EAAY3xB,IAAK,CACxD,MAAM4vB,IAAetP,EAAIoR,GAAYC,EAAa3xB,EAAIyxB,GAAa,EAC7DI,GAAevR,EAAI3xB,EAAQqR,GAAK,EAC3B2vB,EAAAC,CAAU,EAAI1nC,EAAK2pC,CAAW,EACzClC,EAAWC,EAAa,CAAC,EAAI1nC,EAAK2pC,EAAc,CAAC,EACjDlC,EAAWC,EAAa,CAAC,EAAI1nC,EAAK2pC,EAAc,CAAC,EACjDlC,EAAWC,EAAa,CAAC,EAAI1nC,EAAK2pC,EAAc,CAAC,CACnD,CAGK,OADc,IAAI,UAAUlC,EAAYgC,EAAYC,CAAW,CAExE,CACF,CACO,OAAA,IACT,EAUaE,GAAa,CACxBpF,EACAqF,EACA1F,EACA2F,IACG,CACH,GAAItF,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAChC,IAAIuF,EAAcF,EACdE,EAAc,KAAK,MAAMtjC,EAAQ,CAAC,IACtBsjC,EAAA,KAAK,MAAMtjC,EAAQ,CAAC,GAEhCsjC,EAAc,KAAK,MAAMroC,EAAS,CAAC,IACvBqoC,EAAA,KAAK,MAAMroC,EAAS,CAAC,GAEjCqoC,EAAc,IACFA,EAAA,GAEhB,MAAMtC,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC,IAAI7Q,EAAI,GACJ6Q,EAAIiyB,EACF3R,EAAI2R,EACN9iC,EAAI,KAAK,KACP,KAAK,IAAI8iC,EAAcjyB,EAAI,EAAG,CAAC,EAC7B,KAAK,IAAIiyB,EAAc3R,EAAI,EAAG,CAAC,CAAA,EAE1BA,EAAI12B,EAASqoC,EAAc,IACpC9iC,EAAI,KAAK,KACP,KAAK,IAAI8iC,EAAcjyB,EAAI,EAAG,CAAC,EAC7B,KAAK,IAAIsgB,GAAK12B,EAASqoC,GAAc,CAAC,CAAA,GAGnCjyB,EAAIrR,EAAQsjC,EAAc,IAC/B3R,EAAI2R,EACN9iC,EAAI,KAAK,KACP,KAAK,IAAI6Q,GAAKrR,EAAQsjC,GAAc,CAAC,EACnC,KAAK,IAAIA,EAAc3R,EAAI,EAAG,CAAC,CAAA,EAE1BA,EAAI12B,EAASqoC,EAAc,IACpC9iC,EAAI,KAAK,KACP,KAAK,IAAI6Q,GAAKrR,EAAQsjC,GAAc,CAAC,EACnC,KAAK,IAAI3R,GAAK12B,EAASqoC,GAAc,CAAC,CAAA,IAI1C,KAAK,MAAM9iC,CAAC,EAAI8iC,GAClBtC,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EACvBoC,GAAY3F,EAAU,gBAAkB,MAAQ,EAAI,MAE3CsD,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EACvBoC,GAAY3F,EAAU,gBAAkB,MACpCnkC,EAAK0nC,EAAa,CAAC,EACnB,IAEV,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGasoC,GAAa,CACxBlG,EACAr9B,EACA/E,EACA0nC,EACAC,EACAY,EAAiB,MACd,CACH,GAAInG,EAAQ,CACJ,MAAAjN,EAAM,IAAI,MAChBA,EAAI,IAAMiN,EACJ,MAAAl2B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQq8B,EACfr8B,EAAO,OAASq8B,EACZp8B,EAAA,UAAUgpB,EAAK,EAAG,EAAGpwB,EAAO/E,EAAQ,EAAG,EAAG0nC,EAAUC,CAAS,EAC5Cx7B,EAAI,aACvB,EACA,EACAu7B,EACAC,CAAA,CAGJ,CACO,OAAA,IACT,EAGaa,GAAmB,CAAC1F,EAAsB2F,IAAsB,CAC3E,GAAI3F,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC1B2vB,EAAAC,CAAU,EAAI,KAAK,IAC5B,KAAK,IAAI1nC,EAAK0nC,CAAU,EAAIyC,EAAW,GAAG,EAC1C,CAAA,EAES1C,EAAAC,EAAa,CAAC,EAAI,KAAK,IAChC,KAAK,IAAI1nC,EAAK0nC,EAAa,CAAC,EAAIyC,EAAW,GAAG,EAC9C,CAAA,EAES1C,EAAAC,EAAa,CAAC,EAAI,KAAK,IAChC,KAAK,IAAI1nC,EAAK0nC,EAAa,CAAC,EAAIyC,EAAW,GAAG,EAC9C,CAAA,EAEF1C,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa0oC,GAAoB,CAC/B5F,EACApkC,EACAiqC,EAAmB,KAChB,CACH,GAAI7F,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACjC9X,EAAK0nC,EAAa,CAAC,IAAM,GAC3BD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,MAElBD,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,GAE9C,IAAAv9B,EAAInK,EAAK0nC,EAAa,CAAC,EACvB2C,EACElgC,EAAA,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,IAAM/J,CAAK,EAAG,GAAG,EAAG,CAAC,EAEtD+J,EAAI,KAAK,IAAI,KAAK,IAAI,KAAK,MAAMA,EAAI,IAAM/J,CAAK,EAAG,GAAG,EAAG,CAAC,EAEjDqnC,EAAAC,EAAa,CAAC,EAAIv9B,CAC/B,CAGK,OADc,IAAI,UAAUs9B,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa4oC,GAAe,CAC1B9F,EACA+F,EACA7d,EACAlI,IACG,CACH,GAAIggB,GAAa+F,EAAoB,CACnC,KAAM,CAAE,KAAAvqC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1B,CACJ,KAAMgG,EACN,MAAOC,EACP,OAAQC,CACN,EAAAH,EACJ,IAAIf,EAAW9c,EACX6c,EAAY/kB,EACZkI,EAAMge,EAAkBhpC,IAC1B8nC,EAAW9nC,EAASgpC,GAElBlmB,EAAOimB,EAAiBhkC,IAC1B8iC,EAAY9iC,EAAQgkC,GAEtB,MAAMhD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAEnC,GAAAA,EAAIyxB,GACJzxB,EAAIyxB,EAAYkB,GAChBrS,GAAKoR,GACLpR,GAAKoR,EAAWkB,EAELjD,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,MAC3C,CACL,MAAMiD,GACHvS,EAAI3xB,EACHqR,IACE0xB,EAAW,GAAK/iC,GACf2xB,GAAKoR,EAAW,KAAO/iC,EAAQgkC,IAClCA,EACAlB,EACA,GACF,EACIqB,EAA+C,CACnDJ,EAAcG,CAAmB,EACjCH,EAAcG,EAAsB,CAAC,EACrCH,EAAcG,EAAsB,CAAC,EACrCH,EAAcG,EAAsB,CAAC,CAAA,EAEjCE,EAA+C,CACnD7qC,EAAK0nC,CAAU,EACf1nC,EAAK0nC,EAAa,CAAC,EACnB1nC,EAAK0nC,EAAa,CAAC,EACnB1nC,EAAK0nC,EAAa,CAAC,CAAA,EAEfoD,EAAa5B,GAAY0B,EAAYC,CAAU,EAC1CpD,EAAAC,CAAU,EAAIoD,EAAW,CAAC,EACrCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,EACzCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,EACzCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,CAC3C,CACF,CAGK,OADc,IAAI,UAAUrD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAYaqpC,GAAS,CACpBvG,EACAwG,EACAC,EACAve,EACAlI,EACA0mB,EAAa,KACV,CACH,GAAI1G,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAChC,IAAI+E,EAAY/kB,EACZglB,EAAW9c,EACX+c,EAAauB,EACbtB,EAAcuB,EACd1B,EAAY,EACFA,EAAA,EACHA,EAAY9iC,IACT8iC,EAAA9iC,GAEV+iC,EAAW,EACFA,EAAA,EACFA,EAAW9nC,IACT8nC,EAAA9nC,GAET+nC,EAAa,EACFA,EAAA,EACJA,EAAahjC,IACTgjC,EAAAhjC,GAEXijC,EAAc,EACFA,EAAA,EACLA,EAAchoC,IACTgoC,EAAAhoC,GAEZ6nC,EAAYE,EAAahjC,IAC3BgjC,EAAahjC,EAAQ8iC,GAEnBC,EAAWE,EAAchoC,IAC3BgoC,EAAchoC,EAAS8nC,GAGzB,MAAM/B,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAEnC,GAAAA,GAAKyxB,GACLzxB,GAAKyxB,EAAYE,GACjBrR,GAAKoR,GACLpR,GAAKoR,EAAWE,EAChB,CACA,MAAMyB,EAAY,KAAK,OAAOrzB,EAAIyxB,GAAa2B,CAAU,EACnDE,EAAY,KAAK,OAAOhT,EAAIoR,GAAY0B,CAAU,EACxD,IAAIG,EAAkB,KAAK,MACzBH,GAAcC,EAAY,GAAKD,EAAa,EAAI3B,CAAA,EAE9C+B,EAAkB,KAAK,MACzBJ,GAAcE,EAAY,GAAKF,EAAa,EAAI1B,CAAA,EAE9C6B,EAAkB5kC,EAAQ,IAC5B4kC,EAAkB5kC,EAAQ,GAExB6kC,EAAkB5pC,EAAS,IAC7B4pC,EAAkB5pC,EAAS,GAEvB,MAAA6pC,GACHD,EAAkB7kC,EAAQ4kC,GAAmB,EACrC5D,EAAAC,CAAU,EAAI1nC,EAAKurC,CAAmB,EACjD9D,EAAWC,EAAa,CAAC,EAAI1nC,EAAKurC,EAAsB,CAAC,EACzD9D,EAAWC,EAAa,CAAC,EAAI1nC,EAAKurC,EAAsB,CAAC,EACzD9D,EAAWC,EAAa,CAAC,EAAI1nC,EAAKurC,EAAsB,CAAC,CAAA,MAE9C9D,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAEpD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa8pC,GAAc,MACzBC,EACAhlC,EACA/E,EACAyiC,EACAuH,EACAhwC,IACG,CACH,GAAI+vC,GAAYtH,EAAW,CACzB,MAAMwH,EAASD,EAAoB,IAC/B,GAAA,CAAC,MAAO,MAAM,EAAE,SAASvH,EAAU,YAAA,CAAa,EAAG,CAC/C,MAAAtN,EAAM,IAAI,MAChBA,EAAI,IAAM4U,EACJ,MAAA79B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClCA,EAAO,MAAQnH,EACfmH,EAAO,OAASlM,EAChBmM,EAAI,UAAUgpB,EAAK,EAAG,EAAGpwB,EAAO/E,CAAM,EAC/BkM,EAAA,OACJhQ,GAAsB,CACrBlC,GAAMA,EAAGkC,CAAI,CACf,EACA,SAASumC,EAAU,YAAA,CAAa,GAChCwH,CAAA,CACF,KACK,CACL,MAAMC,EAAM,KAAK,MAAMD,EAAS,GAAG,EAC7BE,EAAMlV,EAAK,OACf,CAAE8U,EAAuB,KAAK,MAAM,EACpChlC,EACA/E,EACAkqC,CAAA,EAEIhuC,EAAO,IAAI,KAAK,CAACiuC,CAAG,CAAC,EAC3BnwC,GAAMA,EAAGkC,CAAI,CACf,CAAA,MAEAlC,GAAMA,EAAG,IAAI,CAEjB,EAGaowC,GAAuB,CAClCC,EACAC,EACA7wC,EAGI,CACF,gBAAiB,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAC5C,gBAAiB,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAE,CAC5C,IACG,CACH,GAAI4wC,EAAmB,CACrB,GAAIC,GAAe7wC,EAAS,CAC1B,KAAM,CAAE,KAAA6E,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWqqC,EAC1B,CAAE,KAAME,CAAW,EAAAD,EACnBvE,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EAC9C,CAAE,gBAAAksC,EAAiB,gBAAAC,CAAoB,EAAAhxC,EAC7C,QAASi9B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EAC/B6iB,EAAIsR,EAAOvE,CAAU,EACrBvJ,EAAI8N,EAAOvE,EAAa,CAAC,EACzB99B,EAAIqiC,EAAOvE,EAAa,CAAC,EACzBv9B,EAAI8hC,EAAOvE,EAAa,CAAC,EAE7B/M,IAAMuR,EAAgB,GACtB/N,IAAM+N,EAAgB,GACtBtiC,IAAMsiC,EAAgB,GACtB/hC,IAAM+hC,EAAgB,GACtBC,EAAgB,IAAM,GAEX1E,EAAAC,CAAU,EAAIyE,EAAgB,EAC9B1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,EAClC1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,EAClC1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,IAElC1E,EAAAC,CAAU,EAAI1nC,EAAK0nC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,EAEpD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAAqqC,CACT,CACO,OAAA,IACT,EAGMjD,GAAoB,CAACtE,EAAsB4H,IAAqB,CACpE,GAAI5H,EAAW,CACb,KAAM,CAAE,KAAAxkC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAW8iC,EAC1BiD,EAAa,IAAI,kBAAkBznC,EAAK,MAAM,EACpD,QAASo4B,EAAI,EAAGA,EAAI12B,EAAQ02B,IAC1B,QAAStgB,EAAI,EAAGA,EAAIrR,EAAOqR,IAAK,CACxB,MAAA4vB,GAActP,EAAI3xB,EAAQqR,GAAK,EACrC,QAAS9Q,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,MAAMqlC,EAAQ3E,EAAa1gC,EACvB8Q,IAAM,GAAKA,IAAMrR,EAAQ,GAAK2xB,IAAM,GAAKA,IAAM12B,EAAS,EAC/C+lC,EAAA4E,CAAK,EAAIrsC,EAAKqsC,CAAK,EAE9B5E,EAAW4E,CAAK,EACdD,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,EAAI,CAAC,EACtC2lC,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,CAAC,EAClC2lC,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,EAAI,CAAC,EACtC2lC,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ,CAAC,EAC1BD,EAAO,CAAC,EAAIpsC,EAAKqsC,CAAK,EACtBD,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ,CAAC,EAC1BD,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,EAAI,CAAC,EACtC2lC,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,CAAC,EAClC2lC,EAAO,CAAC,EAAIpsC,EAAKqsC,EAAQ5lC,EAAQ,EAAI,CAAC,CAE5C,CACAghC,EAAWC,EAAa,CAAC,EAAI1nC,EAAK0nC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYhhC,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGMwnC,GAAc,CAClB0B,EACAC,IACG,CACH,GACED,GACAA,EAAW,SAAW,GACtBC,GACAA,EAAW,SAAW,EACtB,CACM,MAAAyB,EAAS1B,EAAW,CAAC,EACrB2B,EAAS1B,EAAW,CAAC,EACvB,GAAAyB,IAAW,KAAOC,IAAW,EACxB,OAAA3B,EACT,GAAW0B,IAAW,EACb,OAAAzB,EACF,CACL,MAAM2B,EAAmBF,EAAS,IAC5BG,EAAmBF,EAAS,IAC5BG,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACH9B,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEIG,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACH/B,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEII,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACHhC,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEIK,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,OACFL,EAAmBC,GAAoB,EAAID,IAAqB,GACnE,EACA,GACF,EACA,CAAA,EAEF,MAAO,CAACE,EAAWC,EAAWC,EAAWC,CAAS,CACpD,CACF,CACA,MAAO,CAAC,IAAK,IAAK,IAAK,GAAG,CAC5B,ECxhDO,SAASC,IAAuB,CACrC,IAAIC,EAAM,KAEV,GAAI,OAAO,cAWT,QAVIC,EAAW,CACb,oBACA,iBACA,iBACA,iBACA,iBACA,iBACA,eACN,EAEahmC,EAAI,EAAGA,EAAIgmC,EAAS,OAAQhmC,IACnC,GAAI,CACF+lC,EAAM,IAAI,OAAO,cAAcC,EAAShmC,CAAC,CAAC,EAC1C,KACD,MAAY,CACX,QACD,MAGH+lC,EAAM,IAAI,eAEZ,OAAOA,CACT,CAEO,SAASE,GAAmBC,EAAc,CAC/C,GAAKA,EAAa,OAGlB,IAAIA,EAAa,OAAO,YAAW,IAAO,OAkCxC,MAAO,CACL,IAAKA,EAAa,OAClB,KAAM,IAAI,SAASA,CAAY,CACrC,EAGI,QADIC,EAAU,GACLC,EAAQ,EAAGA,EAAQF,EAAa,SAAS,OAAQE,IAAS,CACjE,IAAIC,EAASH,EAAa,SAASE,CAAK,EACxC,GAAKC,EAAO,aAAa,MAAM,EAG/B,KAAIC,EACFD,EAAO,SAAS,YAAW,IAAO,QAC9BA,EAAO,aAAa,MAAM,EAAE,YAAa,EACzC,OACN,GAAIC,IAAe,OACjB,QACMC,EAAQ,EACZA,EAAQF,EAAO,MAAM,OACrBF,GACE,IAAM,OAAOE,EAAO,IAAI,EAAI,IAAM,OAAOA,EAAO,MAAME,GAAO,EAAE,IAAI,EACtE,MAEAD,IAAe,SAAWA,IAAe,YAC1CD,EAAO,WAEPF,GAAW,IAAM,OAAOE,EAAO,IAAI,EAAI,IAAM,OAAOA,EAAO,KAAK,GAEnE,CACD,MAAO,CACL,IAAKH,EAAa,OAAO,QACvB,aACAC,EAAQ,QAAQ,KAAM,GAAG,CAC1B,EACD,KAAM,IACZ,EAEA,CAEO,SAASK,GAAuBjuC,EAAKkuC,EAAS,CACnD,OAAO,IAAI,QAAQ,CAACxxC,EAASC,IAAW,CACtC,IAAI6wC,EAAM,IAAI,eACVW,EAAiB,UAAY,CAC/BxxC,EAAO,mBAAqBqD,EAAM,qBAAuBkuC,EAAU,GAAG,CAC5E,EACQzlC,EAAU,SAAUnM,EAAG,CAMrBkxC,EAAI,aAAe,IACjBA,EAAI,SAAW,IACjB9wC,EAAQ8wC,EAAI,QAAQ,EASpB7wC,EAAO6wC,EAAI,UAAU,EAG/B,EAEIA,EAAI,KAAK,MAAOxtC,CAAG,EAInBwtC,EAAI,OAAS/kC,EAEb+kC,EAAI,QAAUU,EACdV,EAAI,UAAYW,EAEhBX,EAAI,OAAO,iBACT,WACA,SAAUlxC,EAAG,CACX,GAAIA,EAAE,iBAAkB,CACtB,MAAM8xC,EAAa,KAAK,MAAO9xC,EAAE,OAAS,IAAOA,EAAE,KAAK,EACxD,QAAQ,IAAI8xC,EAAa,GAAG,CAC7B,CACF,EACD,EACN,EACIZ,EAAI,OAAO,iBAAiB,OAAQ,SAAUlxC,EAAG,CAAA,EAAI,EAAK,EAQ1DkxC,EAAI,KAAK,IAAI,CASjB,CAAG,CACH,CAEO,SAASa,GAAcruC,EAAKpE,EAAS6E,EAAM,CAChD,OAAO,MACLT,EACA,OAAO,OACL,CACE,OAAQ,OACR,QAAS,CAGR,EACD,KAAM,CAAE,EACR,KAAM,GACN,YAAa,GACb,MAAO,GACP,SAAU,SACV,eAAgB,aACjB,EACDpE,CACD,CACF,EAAC,KAAM0yC,GAAaA,EAAS,KAAM,CAAA,CACtC,CAaO,SAASC,GAAoBC,EAAMC,EAAW,CACnD,IAAIjB,EAAM,IAAI,eACdA,EAAI,KAAK,OAAmDgB,CAAI,EAChEhB,EAAI,SAAWgB,EACfhB,EAAI,SAAWiB,EACfjB,EAAI,OAAS,UAAY,CACvB,IAAIkB,EAAa,WACf,OAAO,aAAa,QAAQ,MAAQ,KAAK,QAAQ,CACvD,EACQC,EAAa,KAAK,MAAM,KAAK,kBAAkB,eAAe,CAAC,GAC/D,MAAMD,CAAU,GAAKC,EAAaD,KACpC,OAAO,aAAa,QAAQ,MAAQ,KAAK,SAAU,KAAK,IAAG,CAAE,EAC7D,SAASA,CAAU,GAAK,KAAK,SAASC,EAAYD,CAAU,EAElE,EACElB,EAAI,KAAI,CACV,CC7NgB,SAAAoB,GACd9lB,EACAjoB,EACA,CACA,GAAIA,EACF,OAAO,aAAa,QAClBioB,EACA,OAAOjoB,GAAU,SAAWA,EAAQ,KAAK,UAAUA,CAAK,CAAA,MAGnD,QAAA,OAAO,aAAa,QAAQioB,CAAG,CAE1C,CCZa,MAAA+lB,GAAW,CAACzrC,EAAqC,CAAE,EAAG,EAAG,EAAG,KACvE,OAAO,SAASA,EAAS,EAAGA,EAAS,CAAC,EAEjC,SAAS0rC,GAAqBC,EAA2B,CAC1D,GAAA,CACF,OAAO,QAAQ,kBAAoBA,OACzB,CAEZ,CACF,CAEI,sBAAuB,OAAO,UAChCD,GAAqB,QAAQ,EAItB,OAAA,iBAAiB,eAAgB,IAAM,CAC5CA,GAAqB,MAAM,CAAA,CAC5B,EAEM,OAAA,iBAAiB,OAAQ,IAAM,CACpCA,GAAqB,QAAQ,CAAA,CAC9B,GCnBH,IAAIE,GAEJ,MAAMC,OAAmB,QAEzB,SAASC,GAAOC,EAAgBrmB,EAAa,CACvC,IAAAsmB,EAASH,GAAa,IAAIE,CAAM,EAC/BC,IACHA,MAAa,IACAH,GAAA,IAAIE,EAAQC,CAAM,GAE7B,IAAAC,EAAMD,EAAO,IAAItmB,CAAG,EACxB,OAAKumB,IACHA,EAAM,IAAIC,GACHF,EAAA,IAAItmB,EAAKumB,CAAG,GAEdA,CACT,CAEO,MAAMC,EAAI,CACf,YAEA,aAAc,CACP,KAAA,gBAAkB,GACzB,CAEA,QAAS,CACHN,IACG,KAAA,YAAY,IAAIA,EAAY,CAErC,CAEA,QAAS,CACP,KAAK,YAAY,QAASO,GAAWA,EAAQ,CAAA,CAC/C,CACF,CAEO,SAASC,GAAYD,EAAgB,CAC3BP,GAAAO,EAERA,IACQP,GAAA,IACjB,CAEO,SAASS,GAAaC,EAAa,CACxC,cAAO,KAAKA,CAAG,EAAE,QAAS5mB,GAAQ,CAC5B,IAAAjoB,EAAQ6uC,EAAI5mB,CAAG,EACb,MAAAumB,EAAMH,GAAOQ,EAAK5mB,CAAG,EACpB,OAAA,eAAe4mB,EAAK5mB,EAAK,CAC9B,KAAM,CACJ,OAAAumB,EAAI,OAAO,EACJxuC,CACT,EACA,IAAI8uC,EAAU,CACRA,GAAY9uC,IACNA,EAAA8uC,EACRN,EAAI,OAAO,EAEf,CAAA,CACD,CAAA,CACF,EACMK,CACT,CAEO,SAASE,GAAaF,EAAa,CACjC,OAAA,IAAI,MAAMA,EAAK,CACpB,IAAIP,EAAQrmB,EAAK+mB,EAAU,CAEzB,OADYX,GAAOQ,EAAK5mB,CAAa,EACjC,OAAO,EACJ,QAAQ,IAAIqmB,EAAQrmB,EAAK+mB,CAAQ,CAC1C,EACA,IAAIV,EAAQrmB,EAAKjoB,EAAOgvC,EAAU,CAC1B,MAAAR,EAAMH,GAAOQ,EAAK5mB,CAAa,EACjC,OAAA4mB,EAAI5mB,CAAa,GAAKjoB,IACxB6uC,EAAI5mB,CAAa,EAAIjoB,EACrBwuC,EAAI,OAAO,GAEN,QAAQ,IAAIF,EAAQrmB,EAAKjoB,EAAOgvC,CAAQ,CACjD,CAAA,CACD,CACH","x_google_ignoreList":[24,25]}
+{"version":3,"file":"zyzgroup_core_web.iife.js","sources":["../src/error.ts","../src/file.ts","../src/onDocumentReady.ts","../src/microTask.ts","../src/patchDOM.ts","../src/cookie.js","../src/websocket.js","../src/position.ts","../src/mouse.js","../src/env.js","../src/rem.js","../src/url.js","../src/theme.ts","../src/DOMKeyboardKeyCode.ts","../src/dom.js","../src/animate.ts","../../../node_modules/.pnpm/uzip@0.20201231.0/node_modules/uzip/UZIP.js","../../../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/UPNG.js","../src/image.ts","../src/fetch.js","../src/localstorage.ts","../src/scroll.ts","../src/reactive.ts","../src/tween/Easing.ts","../src/tween/Now.ts","../src/tween/Group.ts","../src/tween/Interpolation.ts","../src/tween/Sequence.ts","../src/tween/mainGroup.ts","../src/tween/Tween.ts","../src/tween/index.ts","../src/sprite-math/matrix.js","../src/svg/platform-browser.js","../src/svg/parse-svg-path.js","../src/svg/abs-svg-path.js","../src/svg/a2c.js","../src/svg/normalize-svg-path.js","../src/svg/is-svg-path.js","../src/svg/index.js"],"sourcesContent":["export class BaseError extends Error {\n  cause?: Error;\n\n  constructor(message: string, options?: ErrorOptions) {\n    super(message, options);\n    this.name = this.constructor.name;\n  }\n}\n\nexport class EnvironmentError extends BaseError {\n  constructor() {\n    super(\"This is not a browser environment\");\n  }\n}\n\nexport class FileSelectCancelError extends BaseError {\n  constructor() {\n    super(\"Cancel select\");\n  }\n}\n\nexport class IllegalFileError extends BaseError {\n  accepts: string[];\n\n  constructor(accepts: string[]) {\n    super(`Please select files in ${accepts} format`);\n    this.accepts = accepts;\n  }\n}\n","import {\n  EnvironmentError,\n  FileSelectCancelError,\n  IllegalFileError\n} from \"./error\";\n\n// <input type=\"file\" id=\"input\">\n// <input type=\"file\" id=\"input\" multiple accept=\"image/*\" style=\"display:none\" name=\"photos[]\">\n// <label for=\"input\">Select some files</label>\n// input css :focus :focus-within\nexport function handleInputFiles(\n  el: HTMLInputElement,\n  cb: (files: FileList | null) => any\n) {\n  el.addEventListener(\n    \"change\",\n    function () {\n      cb(el.files);\n    },\n    false\n  );\n}\n\nexport function handleDragAndDropFiles(\n  dropZoneEl: HTMLElement,\n  cb: (files: FileList | null) => any\n) {\n  // dragover dragenter dragend drop\n  dropZoneEl.addEventListener(\n    \"dragover\",\n    function (e) {\n      e.stopPropagation();\n      e.preventDefault();\n      if (e.dataTransfer) e.dataTransfer.dropEffect = \"copy\";\n    },\n    false\n  );\n  dropZoneEl.addEventListener(\n    \"drop\",\n    function (e) {\n      e.stopPropagation();\n      e.preventDefault();\n      if (e.dataTransfer) cb(e.dataTransfer.files);\n    },\n    false\n  );\n}\n\n/**\n * 选择系统文件\n *\n * @param accepts 可选文件后缀\n * @param multiple 是否多选\n * @returns\n */\nexport const selectFile = (\n  accepts: string[] = [\"*\"],\n  multiple?: boolean\n): Promise<File[]> => {\n  if (!globalThis.document || !(globalThis.document instanceof Document)) {\n    throw new EnvironmentError();\n  }\n  const inputElement = globalThis.document.createElement(\"input\");\n  inputElement.setAttribute(\"type\", \"file\");\n  inputElement.setAttribute(\"visibility\", \"hidden\");\n  if (Array.isArray(accepts) && accepts.length > 0) {\n    inputElement.setAttribute(\"accept\", accepts.join(\",\"));\n  }\n  if (multiple) {\n    inputElement.setAttribute(\"multiple\", \"true\");\n  }\n  inputElement.click();\n\n  return new Promise((resolve, reject) => {\n    globalThis.addEventListener(\n      \"focus\",\n      () => {\n        setTimeout(() => {\n          if (!inputElement.files || inputElement.files?.length === 0) {\n            reject(new FileSelectCancelError());\n          }\n        }, 1000);\n      },\n      { once: true }\n    );\n    inputElement.addEventListener(\"change\", () => {\n      if (!inputElement.files || inputElement.files?.length === 0) {\n        reject(new FileSelectCancelError());\n      } else {\n        const files = Array.from(inputElement.files);\n        if (illegalFiles(files)) {\n          reject(new IllegalFileError(accepts));\n        }\n        resolve(files);\n      }\n    });\n  });\n\n  function illegalFiles(files: File[]): boolean {\n    return (\n      !accepts.includes(\"*\") &&\n      files.some((file) => !accepts.includes(`.${getFileExtension(file)}`))\n    );\n  }\n};\n\nexport interface FileHandler {\n  (fileRender: FileReader): void;\n}\n\nexport const readeFile = <T extends string | ArrayBuffer | null>(\n  fileHandler: FileHandler\n): Promise<T> => {\n  const reader = new FileReader();\n  return new Promise((resolve, reject) => {\n    reader.addEventListener(\n      \"progress\",\n      (event: FileReaderEventMap[\"progress\"]) => {\n        const size = \"(\" + Math.floor(event.total / 1000) + \" KB)\";\n        const progress = Math.floor((event.loaded / event.total) * 100) + \"%\";\n        console.log(`Loading size: ${size} progress: ${progress}`);\n      }\n    );\n    reader.addEventListener(\"load\", (event: FileReaderEventMap[\"load\"]) => {\n      resolve(event.target?.result as T);\n    });\n    reader.addEventListener(\"error\", (event: FileReaderEventMap[\"error\"]) => {\n      reject(event);\n    });\n    fileHandler(reader);\n    // reader.readAsDataURL(file);\n    // reader.readAsBinaryString(file);\n  });\n};\n\n/**\n * 获取文件后缀\n *\n * @param file 文件或文件名\n * @returns\n */\nexport const getFileExtension = (file: File | string): string => {\n  let fileName: string;\n  if (file instanceof File) {\n    fileName = file.name;\n  } else {\n    fileName = file;\n  }\n  return fileName.match(/\\.([0-9a-z]+)(?:[\\\\?#]|$)/i)![1] ?? \"\";\n};\n\nexport const isImage = (file: File): boolean => {\n  return /^image\\//.test(file.type);\n};\n\nexport const isVideo = (file: File): boolean => {\n  return /^video\\//.test(file.type);\n};\n\nexport const isAudio = (file: File): boolean => {\n  return /^audio\\//.test(file.type);\n};\n\nexport const isWordDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.openxmlformats-officedocument\\.wordprocessingml\\.document|msword|vnd\\.ms-word\\.document\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.wordprocessingml\\.template|vnd\\.ms-word\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isExcelDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.openxmlformats-officedocument\\.spreadsheetml\\.sheet|vnd\\.ms-excel|vnd\\.ms-excel\\.sheet\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.spreadsheetml\\.template|vnd\\.ms-excel\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isPowerPointDocument = (file: File): boolean => {\n  return /^application\\/(?:vnd\\.ms-powerpoint|vnd\\.openxmlformats-officedocument\\.presentationml\\.presentation|vnd\\.ms-powerpoint\\.presentation\\.macroenabled\\.12|vnd\\.openxmlformats-officedocument\\.presentationml\\.template|vnd\\.ms-powerpoint\\.template\\.macroenabled\\.12)$/.test(\n    file.type\n  );\n};\n\nexport const isJsonDocument = (file: File): boolean => {\n  return /^application\\/json$/.test(file.type);\n};\n\nexport const isXmlDocument = (file: File): boolean => {\n  return /^(?:application|text)\\/(?:xml|xhtml\\+xml)$/.test(file.type);\n};\n\n// base64: `data:image/png;base64,`\n/**\n * 判断文件类型\n * @example <input type=\"file\" onchange=\"getFileType(this.files[0])\"></input>\n */\nexport function getFileType(file: File) {\n  // 文件开头的四个字节，生成一个 Blob 对象\n  const slice = file.slice(0, 4);\n  const reader = new FileReader();\n  let verified_type: string;\n  return new Promise((resolve, reject) => {\n    reader.onload = function () {\n      const buffer = reader.result as ArrayBuffer;\n      // 将这四个字节的内容，视作一个32位整数\n      const view = new DataView(buffer);\n      const magic = view.getUint32(0, false);\n      // 根据文件的前四个字节，判断它的类型\n      switch (magic) {\n        case 0x89504e47:\n          verified_type = \"image/png\";\n          break;\n        case 0x47494638:\n          verified_type = \"image/gif\";\n          break;\n        case 0x25504446:\n          verified_type = \"application/pdf\";\n          break;\n        case 0x504b0304:\n          verified_type = \"application/zip\";\n          break;\n      }\n      return resolve(verified_type);\n    };\n    // 读取这四个字节\n    reader.readAsArrayBuffer(slice);\n  });\n}\n\n/**\n * 将一个函数转换为 blob，然后为这个 blob 生成 URL 对象\n */\nexport function fn2ObjectURL(fn: (...args: any[]) => any) {\n  const blob = new Blob([\"(\" + fn.toString() + \")()\"], {\n    type: \"application/javascript\"\n  });\n  return URL.createObjectURL(blob);\n  // URL.revokeObjectURL(URL.createObjectURL(blob))\n}\n","export function onDocumentReady(cb: () => void) {\n  function check() {\n    if (document.readyState === \"loading\") return;\n    cb();\n    document.removeEventListener(\"DOMContentLoaded\", check);\n  }\n  if (typeof document !== \"undefined\") {\n    document.addEventListener(\"DOMContentLoaded\", check);\n    check();\n  }\n}\n","export function microTask(cb: () => void) {\n  if (typeof queueMicrotask === \"function\") {\n    queueMicrotask(cb);\n  } else {\n    Promise.resolve()\n      .then(cb)\n      .catch((e) =>\n        setTimeout(() => {\n          throw e;\n        })\n      );\n  }\n}\n","export function patchDOM(\n  oldNode: HTMLElement,\n  newNode: HTMLElement,\n  parent: HTMLElement\n) {\n  if (!oldNode) {\n    if (parent && newNode) {\n      parent.appendChild(newNode);\n    }\n    return;\n  }\n\n  if (oldNode.isEqualNode(newNode)) return;\n\n  if (oldNode.nodeName !== newNode.nodeName) {\n    parent.replaceChild(newNode, oldNode);\n    return;\n  }\n\n  if (oldNode.nodeType === Node.TEXT_NODE) {\n    if (oldNode.textContent !== newNode.textContent) {\n      oldNode.textContent = newNode.textContent;\n    }\n    return;\n  }\n\n  for (let i = oldNode.attributes.length - 1; i >= 0; i--) {\n    const attrName = oldNode.attributes[i].name;\n    if (!newNode.hasAttribute(attrName) && attrName !== \"open\") {\n      oldNode.removeAttribute(attrName);\n    }\n  }\n\n  for (let i = 0; i < newNode.attributes.length; i++) {\n    const attrName = newNode.attributes[i].name;\n    const attrValue = newNode.attributes[i].value;\n    oldNode.setAttribute(attrName, attrValue);\n  }\n\n  for (let i = 0; i < newNode.childNodes.length; i++) {\n    if (oldNode.childNodes[i]) {\n      patchDOM(\n        oldNode.childNodes[i] as HTMLElement,\n        newNode.childNodes[i] as HTMLElement,\n        oldNode\n      );\n    } else {\n      oldNode.appendChild(newNode.childNodes[i].cloneNode(true));\n    }\n  }\n\n  while (oldNode.childNodes.length > newNode.childNodes.length) {\n    if (oldNode.lastChild) oldNode.removeChild(oldNode.lastChild);\n  }\n}\n","export function setCookie(cname, cvalue, exdays) {\n  var d = new Date();\n  d.setTime(d.getTime() + exdays * 24 * 60 * 60 * 1000);\n  var expires = \"expires=\" + d.toGMTString();\n  document.cookie = cname + \"=\" + cvalue + \"; \" + expires;\n}\n\nexport function getCookie(cname) {\n  var name = cname + \"=\";\n  var ca = document.cookie.split(\";\");\n  for (var i = 0; i < ca.length; i++) {\n    var c = ca[i].trim();\n    if (c.indexOf(name) == 0) return c.substring(name.length, c.length);\n  }\n  return \"\";\n  // return `; ${document.cookie}`.split(`; ${cname}=`).pop().split(\";\").shift();\n}\n\n// Convert cookie to object\nexport const getCookieObject = () =>\n  document.cookie\n    .split(\";\")\n    .map((item) => item.split(\"=\"))\n    .reduce((acc, [k, v]) => (acc[k.trim().replace('\"', \"\")] = v) && acc, {});\n\n// Clear all cookies\nexport const clearCookies = () =>\n  document.cookie\n    .split(\";\")\n    .forEach(\n      (c) =>\n        (document.cookie = c\n          .replace(/^ +/, \"\")\n          .replace(/=.*/, `=;expires=${new Date().toUTCString()};path=/`))\n    );\n","/// wss://echo.websocket.org\n\nexport class WebSocket {\n  constructor(url) {\n    // Here we create an empty array [] which we will add to later\n    // Note that we can use {} also, which is for empty objects\n    // (arrays are objects)\n    this.waitingResponse = [];\n\n    // Here we create an empty array [] that represents the queue of\n    // messages that didn't send because the socket was closed and\n    // are queued up to be sent during the onopen handler (which iterates\n    // through this array)\n    this.messageQueue = [];\n\n    this.url = url;\n\n    // We separate out the socket initialisation into its own function\n    // as we will also call it during a reconnect attempt\n    this.createSocket();\n  }\n\n  // The reconnection logic is that whenever a message fails to send, the\n  // message is added to messageQueue and a reconnection attempt is made.\n  // So, when a connection is lost, it is reconnected to after a certain\n  // time, but rather only when the user initiates an action that must\n  // message (i.e.) interact with the WebSocket\n  createSocket() {\n    this.socket = new WebSocket(this.url);\n\n    // Iterate through the queue of messages that haven't been sent\n    // If this queue is empty then no messages are sent\n\n    // All messages in the message queue arise from a previous\n    // sendPayload event, thus are parsed in the correct JSON form\n    // and have an associated request object in waitingResponse\n    this.socket.onopen = () => {\n      this.messageQueue.forEach((item) => this.socket.send(item));\n      this.messageQueue = [];\n    };\n\n    this.socket.onclose = (e) => {\n      const { code, reason, wasClean } = e;\n      console.log(`ws closed : ${code} ${reason} ${wasClean}`);\n    };\n\n    this.socket.onerror = (e) => {\n      console.log(`ws error :  ${e}`);\n    };\n\n    this.socket.onmessage = (e) => {\n      this.processMessage(e);\n    };\n  }\n\n  // Creates a new socket and adds any unsent\n  // messages onto the message queue\n  recreateSocket(message) {\n    console.log(\"Reconnection Attempted\");\n    this.messageQueue.push(message);\n    this.createSocket();\n  }\n\n  // Closes a socket, which can take a bit\n  // of time (few seconds) since a roundtrip to\n  // the server is done\n  closeSocket() {\n    this.socket.close();\n    console.log(\"Socket closed manually.\");\n  }\n\n  // Exposes a function for users to start a new\n  // socket - there is no way to 'reconnect' to\n  // a socket, a new websocket needs to be created\n  openSocket() {\n    this.createSocket();\n    console.log(\"Socket opened manually.\");\n  }\n\n  async sendPayload(details) {\n    // Create a request where request = { sent: + new Date()} and this.waiting... = request\n    // this means both request and waitingResponse[details.requestid] point to the same thing\n    // so that changing request.test will also result in waitingResponse[details.requestid].test\n    // having the same value\n\n    // Note that details.requestid here is an index = the timestamp. Later when we process\n    // messages received, we will check the timestamp of the requestid of the message received\n    // against this waitingResponse array and resolve the request if a match is found\n\n    let requestid = +new Date();\n    const request = (this.waitingResponse[requestid] = { sent: requestid });\n\n    // Here we combine the request (which at this point is just { sent: ...} with the\n    // actual data to be sent to form the final message to send\n    const message = { ...request, ...details };\n\n    // If Socket open then send the details (message) in String Format\n    try {\n      // WebSocket.CONNECTING  WebSocket.OPEN WebSocket.CLOSING WebSocket.CLOSED\n      if (this.socket.readyState === WebSocket.OPEN) {\n        this.socket.send(JSON.stringify(message));\n      } else {\n        // Otherwise we try to recreate the socket and send the message\n        // after recreating the socket\n        this.recreateSocket(JSON.stringify(message));\n      }\n\n      // Here we create a new promise function\n      // We set the resolve property of request [which is also referenced\n      // by waitingResponse[details.requestid] to the Promise's resolve function\n\n      // Thus we can resolve the promise from processMessage (refer below)\n\n      // We reject after 5 seconds of not receiving the associated message\n      // with the same requestid\n      const result = await new Promise(function (resolve, reject) {\n        // This will automatically run, allowing us to access\n        // the resolve function from outside this function\n        request.resolve = resolve;\n\n        console.log(request);\n        // This will take 5 seconds to run, which becomes the lifecycle\n        // of this Promise function - the resolve function must be\n        // called before this point\n        setTimeout(() => {\n          reject(\"Timeout\"); // or resolve({action: \"to\"}), or whatever\n        }, 5000);\n      });\n\n      console.info(\"Time took\", (+new Date() - request.sent) / 1000);\n\n      // function returns result\n      return result; // or {...request, ...result} if you care\n    } finally {\n      // code to run regardless of whether try worked or error thrown\n      console.log(\"Exit code ran successfully\");\n\n      delete this.waitingResponse[requestid];\n    }\n  }\n\n  // Message Receiver, we attach this to the onmessage handler\n  // Expects message to be in JSON format, otherwise throws\n  // an error and simply logs the message to console\n\n  // The message must also have a requestid property (we\n  // use lowercase \"i\" here because Common Lisp's JZON library\n  // lowercases property names in JSON messages\n\n  // Test if the requestid passed in has an entry in the waitingResponse\n  // queue (data.requestid is the array index and the sendPayload function\n  // sets a value in this array for various id indexes to { sent: .. }\n  // This index also has a reference to the resolve function for the\n  // associated promise for that request id\n\n  // If that is true ('truthy' via if (request)), then resolve the\n  // associated promise via request.resolve(data), where data is\n  // the value resolved by the promise\n\n  // Otherwise pass a variety of console warnings / logs - the message\n  // will not be handled and disappear from the future (i.e. every\n  // message needs a requestid set in waitingResponse to be caught\n\n  // We could probably add in a router for server initiated messages\n  // to be handled (under the second warning below)\n  async processMessage(msg) {\n    try {\n      let data = JSON.parse(msg.data);\n\n      if (Object.prototype.hasOwnProperty.call(data, \"requestid\")) {\n        const request = this.waitingResponse[data.requestid];\n        if (request) request.resolve(data);\n        else\n          console.warn(\n            \"Got data but found no associated request, already timed out?\",\n            data\n          );\n      } else {\n        // Add handlers here for messages without request ID\n        console.warn(\"Got data without request id\", data);\n      }\n    } catch {\n      console.log(msg.data);\n    }\n  }\n\n  // Main entry point for calling functions with a simple\n  // callback to action to perform on the received data\n  // Exists here to reduce boilerplate for the calling function\n  async sendRequest(\n    details,\n    resolution,\n    rejection = (error) => {\n      console.log(error);\n    }\n  ) {\n    this.sendPayload(details).then(\n      function (value) {\n        resolution(value);\n      },\n      function (error) {\n        rejection(error);\n      }\n    );\n  }\n\n  // Second entry point for one direction messages\n  // i.e. not expecting any responses. This bypasses\n  // the request-response promise functions above\n\n  // Attempts to JSON.stringify the object first,\n  // and just sends the object if cannot be made\n  // into a JSON string\n\n  sendMessage(details) {\n    // Example of an Immediately-Invoked Function Expression\n    const message = (() => {\n      try {\n        return JSON.stringify(details);\n      } catch (e) {\n        return details;\n      }\n    })();\n\n    if (this.socket.readyState === WebSocket.OPEN) {\n      this.socket.send(message);\n    } else {\n      // Otherwise we try to recreate the socket and send the message\n      // after recreating the socket\n      this.recreateSocket(message);\n    }\n  }\n}\n","export function getDocumentElement() {\n  if (document.compatMode == \"BackCompat\") {\n    return document.body;\n  } else {\n    return document.documentElement;\n  }\n}\n\n// 获取可视区域大小\nexport function getViewportSize() {\n  const documentElement = getDocumentElement();\n  return {\n    width: documentElement.clientWidth || window.innerWidth,\n    height: documentElement.clientHeight || window.innerHeight\n  };\n}\n\n// 获取页面整体大小\nexport function getPageSize() {\n  const documentElement = getDocumentElement();\n  const viewport = getViewportSize();\n  return {\n    width: Math.max(documentElement.scrollWidth, viewport.width),\n    height: Math.max(documentElement.scrollHeight, viewport.height)\n  };\n}\n\n/**\n * 判断元素是否在可视区域\n *\n * DOMRect 对象包含了一组用于描述边框的只读属性——top,lef,right,bottom,width,height，单位为像素。\n * 除了 width 和 height 外的属性都是相对于浏览器可视范围的左上角位置而言的。\n * right是指元素右边界距窗口最左边的距离，bottom是指元素下边界距窗口最上面的距离。\n * 兼容所有浏览器写法：\n * var ro = object.getBoundingClientRect();\n * var Top = ro.top;\n * var Bottom = ro.bottom;\n * var Left = ro.left;\n * var Right = ro.right;\n * var Width = ro.width || Right - Left;\n * var Height = ro.height || Bottom - Top;\n */\nexport function isElementInViewport(el: HTMLElement) {\n  const viewport = getViewportSize();\n  const rect = el.getBoundingClientRect();\n  return (\n    rect.bottom > 0 &&\n    rect.top < viewport.height &&\n    rect.right > 0 &&\n    rect.left < viewport.width\n  );\n}\n\n//scrollTop和scrollLeft属性是可以赋值的，并且会立即自动滚动网页到相应位置，因此可以利用它们改变网页元素的相对位置\nexport function getPageScroll() {\n  const documentElement = getDocumentElement();\n  return {\n    scrollLeft: documentElement.scrollLeft,\n    scrollTop: documentElement.scrollTop\n  };\n}\n\nexport function getPageClient() {\n  const documentElement = getDocumentElement();\n  return {\n    clientLeft: documentElement.clientLeft,\n    clientTop: documentElement.clientTop\n  };\n}\n\nexport function getElementLeftInPage(element: HTMLElement) {\n  let actualLeft = element.offsetLeft;\n  let current = element.offsetParent as HTMLElement;\n  while (current !== null) {\n    actualLeft += current.offsetLeft;\n    current = current.offsetParent as HTMLElement;\n  }\n  return actualLeft;\n}\n\nexport function getElementTopInPage(element: HTMLElement) {\n  let actualTop = element.offsetTop;\n  let current = element.offsetParent as HTMLElement;\n  while (current !== null) {\n    actualTop += current.offsetTop;\n    current = current.offsetParent as HTMLElement;\n  }\n  return actualTop;\n}\n\nexport function getElementPositionInPage2(element: HTMLElement) {\n  return {\n    x: getElementLeftInPage(element),\n    y: getElementTopInPage(element)\n  };\n}\nexport function getElementPositionInPage(element: HTMLElement) {\n  const rect = element.getBoundingClientRect();\n  const scroll = getPageScroll();\n  const pageClient = getPageClient();\n  return {\n    x: rect.left + scroll.scrollLeft - pageClient.clientLeft,\n    y: rect.top + scroll.scrollTop - pageClient.clientTop\n  };\n}\n\nexport function getElementPositionInViewport(element: HTMLElement) {\n  const rect = element.getBoundingClientRect();\n  return {\n    x: rect.left,\n    y: rect.top\n  };\n}\n\n// horizontal scroll indicator\n// window.onscroll = () => getPageVerticalScrollPercent();\nexport function getPageVerticalScrollPercent() {\n  const documentElement = getDocumentElement();\n  // https://www.w3schools.com/howto/howto_js_scroll_indicator.asp\n  const height = documentElement.scrollHeight - documentElement.clientHeight;\n  return height <= 0 ? 0 : (documentElement.scrollTop / height) * 100;\n}\n\n//////////////////////////////// 鼠标 ////////////////////////////////\nexport function getMousePositionInPage(ev: MouseEvent) {\n  if (ev.pageX && ev.pageY) {\n    return { x: ev.pageX, y: ev.pageY };\n  }\n  const pageScroll = getPageScroll();\n  const pageClient = getPageClient();\n  return {\n    x: ev.clientX + pageScroll.scrollLeft - pageClient.clientLeft,\n    y: ev.clientY + pageScroll.scrollTop - pageClient.clientTop\n  };\n}\n\nexport function getMousePositionInViewport(ev: MouseEvent) {\n  return {\n    x: ev.clientX,\n    y: ev.clientY\n  };\n}\n","/**\n * 鼠标按键\n * @returns 0 左键 1 中键 2 右键\n */\nexport function getMouseButton(event) {\n  if (document.implementation.hasFeature(\"MouseEvents\", \"2.0\")) {\n    return event.button;\n  } else {\n    switch (event.button) {\n      case 0:\n      case 1:\n      case 3:\n      case 5:\n      case 7:\n        return 0; //左键\n      case 2:\n      case 6:\n        return 2; //右键\n      case 4:\n        return 1; //中键\n    }\n  }\n}\n","// Mozilla/5.0 (Linux; Android 6.0; Nexus 5 Build/MRA58N) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/118.0.0.0 Mobile Safari/537.36\n// Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/118.0.0.0 Safari/537.36\nexport const getOperatingSystem = () => {\n  const userAgent = navigator.userAgent.toLowerCase();\n  let operatingSystem = \"Unknown\";\n  if (userAgent.includes(\"mac\")) {\n    operatingSystem = \"macOS\";\n  } else if (userAgent.includes(\"win\")) {\n    operatingSystem = \"Windows\";\n  } else if (/android/.test(userAgent)) {\n    operatingSystem = \"Android\";\n  } else if (/iphone|ipad|ipod/.test(userAgent)) {\n    operatingSystem = \"iOS\";\n  } else if (/linux/.test(userAgent)) {\n    operatingSystem = \"Linux\";\n  } else if (/bsd/.test(userAgent)) {\n    operatingSystem = \"BSD\";\n  }\n  return operatingSystem.toLowerCase();\n};\n\nexport const getOperatingSystemVersion = () => {\n  const userAgent = navigator.userAgent;\n  let osVersion = \"Unknown\";\n  if (/Windows NT/.test(userAgent)) {\n    const match = userAgent.match(/Windows NT (\\d+\\.\\d+)/);\n    if (match) {\n      osVersion = match[1];\n    }\n  } else if (/Mac OS X/.test(userAgent)) {\n    const match = userAgent.match(/Mac OS X (\\d+_\\d+)/);\n    if (match) {\n      osVersion = match[1].replace(\"_\", \".\");\n    }\n  } else if (/Android/.test(userAgent)) {\n    const match = userAgent.match(/Android (\\d+\\.\\d+)/);\n    if (match) {\n      osVersion = match[1];\n    }\n  } else if (/iPhone|iPad|iPod/.test(userAgent)) {\n    const match = userAgent.match(/OS (\\d+_\\d+)/);\n    if (match) {\n      osVersion = match[1].replace(\"_\", \".\");\n    }\n  }\n  return osVersion.toLowerCase();\n};\n\nexport const getBrowserClient = () => {\n  const userAgent = navigator.userAgent.toLowerCase();\n  let client = \"Unknown\";\n  if (/chrome/.test(userAgent)) {\n    client = \"Chrome\";\n  } else if (/firefox/.test(userAgent)) {\n    client = \"Firefox\";\n  } else if (/safari/.test(userAgent)) {\n    client = \"Safari\";\n  } else if (/edge/.test(userAgent)) {\n    client = \"Edge\";\n  } else if (/msie|trident/.test(userAgent)) {\n    // client = \"Internet Explorer\";\n    client = \"IE\";\n  }\n  return client.toLowerCase();\n};\n\nexport const getBrowserClientVersion = () => {\n  const userAgent = navigator.userAgent;\n  let browserVersion = \"Unknown\";\n  if (/Chrome/.test(userAgent)) {\n    const match = userAgent.match(/Chrome\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Firefox/.test(userAgent)) {\n    const match = userAgent.match(/Firefox\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Safari/.test(userAgent)) {\n    const match = userAgent.match(/Version\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/Edge/.test(userAgent)) {\n    const match = userAgent.match(/Edge\\/(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  } else if (/MSIE|Trident/.test(userAgent)) {\n    const match = userAgent.match(/(?:MSIE|rv:)(\\d+\\.\\d+)/);\n    if (match) {\n      browserVersion = match[1];\n    }\n  }\n  return browserVersion;\n};\n\nexport const getUserGeolocationPromise = () => {\n  if (\"geolocation\" in navigator) {\n    return new Promise((resolve, reject) => {\n      navigator.geolocation.getCurrentPosition(\n        (position) => {\n          const latitude = position.coords.latitude;\n          const longitude = position.coords.longitude;\n          resolve({ latitude, longitude });\n        },\n        (error) => {\n          reject(error);\n        }\n      );\n    });\n  } else {\n    return Promise.reject(\"Geolocation is not available.\");\n  }\n};\n\nexport function getBrowserLanguage() {\n  return (navigator.browserLanguage || navigator.language).toLowerCase();\n}\n\nexport function getTimeZone() {\n  return Intl.DateTimeFormat().resolvedOptions().timeZone.toLowerCase();\n}\n\nexport function isIOS() {\n  return getOperatingSystem() === \"ios\";\n}\n\nexport function isAppleDevice() {\n  return (getOperatingSystem() === \"ios\") | (getOperatingSystem() === \"macos\");\n}\n\nexport function isAndroid() {\n  return getOperatingSystem() === \"android\";\n}\n\nexport function isMobile() {\n  return isIOS() || isAndroid();\n}\n\nexport function isDarkMode() {\n  return (\n    typeof window === \"object\" &&\n    window.matchMedia &&\n    window.matchMedia(\"(prefers-color-scheme: dark)\").matches\n  );\n}\n\nexport const isBrowser =\n  typeof window === \"object\" && typeof document === \"object\";\n\nexport const isNode =\n  typeof process !== \"undefined\" &&\n  process.versions != null &&\n  process.versions.node != null;\n","// import { isAndroid } from \"./env\";\n\nexport function setRem(designWidth) {\n  // 修正页面高度100%的渲染错误\n  // document.documentElement.style.height = window.innerHeight + \"px\";\n\n  var docEl = document.documentElement;\n\n  // var dpr = isAndroid()\n  //   ? 1\n  //   : window.top === window.self\n  //   ? window.devicePixelRatio\n  //   : 1;\n  var dpr = window.devicePixelRatio;\n  docEl.dataset.dpr = dpr;\n\n  // 设置viewport，进行缩放，达到高清效果\n  // var metaEl = document.querySelector('meta[name=\"viewport\"]');\n  // var scale = 1 / dpr;\n  // metaEl.setAttribute(\n  //   \"content\",\n  //   \"width=device-width\" +\n  //     \",initial-scale=\" +\n  //     scale +\n  //     \",maximum-scale=\" +\n  //     scale +\n  //     \", minimum-scale=\" +\n  //     scale +\n  //     \",user-scalable=no, viewport-fit=cover, shrink-to-fit=no\"\n  // );\n\n  // default: 1rem = 100px\n  var rem = 100;\n  var recalc = function () {\n    // var clientWidth = docEl.clientWidth;\n    // // 限制最大rem\n    // if (clientWidth > maxWidth) {\n    //   clientWidth = maxWidth;\n    // }\n    // // 限制最小rem\n    // if (clientWidth < minWidth) {\n    //   clientWidth = minWidth;\n    // }\n    var clientWidth = Math.min(docEl.clientWidth, designWidth);\n    docEl.dataset.width = clientWidth;\n    docEl.dataset.rem = rem = Math.round(100 * (clientWidth / designWidth));\n    // 配合：设置viewport，进行缩放，达到高清效果\n    // docEl.dataset.rem = rem =\n    //   Math.round(100 * (clientWidth / designWidth)) * dpr;\n    docEl.style.fontSize = rem + \"px\";\n  };\n\n  recalc();\n\n  // 给js调用的，某一dpr下rem和px之间的转换函数\n  window.rem2px = function (v) {\n    v = parseFloat(v);\n    return v * rem;\n  };\n  window.px2rem = function (v) {\n    v = parseFloat(v);\n    return v / rem;\n  };\n\n  if (!window.addEventListener) return;\n  window.addEventListener(\n    \"orientationchange\" in window ? \"orientationchange\" : \"resize\",\n    recalc,\n    false\n  );\n}\n","// const path = require(\"path\"); // 路径模块\n// const qs = require(\"querystring\"); // 地址参数解析模块\n// const util = require(\"util\"); // 常用工具方法模块\n// const url = require(\"url\"); // URL 解析模块\n\n// // 新定义的内置对象\n// new Promise();\n// // 原有内置对象新添加的静态方法\n// Array.from();\n// // 原有内置对象新添加的实例方法\n// Array.prototype.includes();\n\n// 编码\nexport function urlsafe_b64encode(str) {\n  return btoa(encodeURIComponent(str))\n    .replaceAll(\"+\", \"*\")\n    .replaceAll(\"/\", \"-\")\n    .replaceAll(\"=\", \"\");\n}\n\n// 解码\nexport function urlsafe_b64decode(base64UrlStr) {\n  let data = base64UrlStr.replaceAll(\"*\", \"+\").replaceAll(\"-\", \"/\");\n  let mod4 = data.length % 4;\n  if (mod4) {\n    data = data.padEnd(data.length + (4 - mod4), \"=\");\n  }\n  return decodeURIComponent(atob(data));\n}\n\nexport const isURLRelative = (path) => !/^([a-z]+:)?[\\\\/]/i.test(path);\n\nexport function isURL(string) {\n  let givenURL;\n  try {\n    givenURL = new URL(string);\n  } catch (error) {\n    console.log(error);\n    return false;\n  }\n  // let host = givenURL.host;\n  // let path = givenURL.pathname;\n  return givenURL.protocol === \"http:\" || givenURL.protocol === \"https:\";\n}\n\nexport const getUrlParams = (query) =>\n  Array.from(new URLSearchParams(query)).reduce(\n    (p, [k, v]) =>\n      Object.assign({}, p, {\n        [k]: p[k] ? (Array.isArray(p[k]) ? p[k] : [p[k]]).concat(v) : v\n      }),\n    {}\n  );\n\nexport function getUrlParams2() {\n  let obj = {};\n  let searchString = location.search;\n  if (searchString) {\n    searchString = searchString.substring(1, searchString.length);\n    let tempArray = searchString.split(\"&\");\n    tempArray.forEach((item) => {\n      const splits = item.split(\"=\");\n      obj[splits[0]] = decodeURIComponent(splits[1]);\n    });\n  }\n  return obj;\n}\n\nexport function handleURLChange(cb) {\n  let previousUrl = \"\";\n  let observer = new MutationObserver(function (mutations) {\n    if (window.location.href !== previousUrl) {\n      previousUrl = window.location.href;\n      console.log(`URL data changed to ${window.location.href}`);\n      if (cb) cb(location.href);\n    }\n  });\n  observer.observe(document, {\n    attributes: true,\n    childList: true,\n    subtree: true\n  });\n}\n\nexport function handleHashChange(cb) {\n  window.addEventListener(\"hashchange\", () => {\n    cb(location.hash);\n  });\n}\n\nexport function handleHistoryChange(cb) {\n  // history.pushState(null, \"\", target);\n  // window.dispatchEvent(new PopStateEvent(\"popstate\"));\n  window.addEventListener(\"popstate\", cb);\n}\n","export function setTheme(theme?: string) {\n  theme = theme || localStorage.theme;\n  if (!theme) {\n    theme = window.matchMedia(\"(prefers-color-scheme: dark)\").matches\n      ? \"dark\"\n      : \"light\";\n    localStorage.theme = theme;\n  }\n  document.documentElement.classList.toggle(\"dark\", theme === \"dark\");\n}\n","export class DOMKeyboardKeyCode {\n  public static getEvent(event: KeyboardEvent): { code: number; key: string } {\n    // const key = event.code;\n    const code = event.keyCode || event.charCode;\n    return {\n      code: code,\n      key: DOMKeyboardKeyCode.codeToKey(code)\n    };\n  }\n\n  /**\n   * keyToCode(keyName: string)\n   *\n   * @param keyName {string} - The keyName of the key you wish to get the code for.\n   *\n   * @return {number} - Will be the keycode of the given keyName, or -1 if it does not exist in\n   *  the set of known keys.\n   */\n  public static keyToCode(keyName: string): number {\n    if (\n      Object.prototype.hasOwnProperty.call(\n        DOMKeyboardKeyCode.keyToCodes,\n        keyName\n      )\n    ) {\n      return DOMKeyboardKeyCode.keyToCodes[keyName];\n    } else {\n      return -1;\n    }\n  }\n\n  /**\n   * codeToKey(code: string)\n   *\n   * @param code {string} - The key code to lookup the keyname for\n   *\n   * @reaturn {string} - Will be the keyname of the given Code or '' if it does not\n   * exist on the set of known codes.\n   */\n  public static codeToKey(code: number): string {\n    if (\n      Object.prototype.hasOwnProperty.call(\n        DOMKeyboardKeyCode.codeToKeys,\n        code.toString()\n      )\n    ) {\n      return DOMKeyboardKeyCode.codeToKeys[code.toString()];\n    } else {\n      return \"\";\n    }\n  }\n\n  private static keyToCodes: { [index: string]: number } = {\n    \"0\": 48,\n    \"1\": 49,\n    \"2\": 50,\n    \"3\": 51,\n    \"4\": 52,\n    \"5\": 53,\n    \"6\": 54,\n    \"7\": 55,\n    \"8\": 56,\n    \"9\": 57,\n    spacebar: 32,\n    backspace: 8,\n    tab: 9,\n    enter: 13,\n    shift: 16,\n    ctrl: 17,\n    alt: 18,\n    pause_break: 19,\n    caps_lock: 20,\n    escape: 27,\n    page_up: 33,\n    page_down: 34,\n    end: 35,\n    home: 36,\n    left_arrow: 37,\n    up_arrow: 38,\n    right_arrow: 39,\n    down_arrow: 40,\n    insert: 45,\n    delete: 46,\n    a: 65,\n    b: 66,\n    c: 67,\n    d: 68,\n    e: 69,\n    f: 70,\n    g: 71,\n    h: 72,\n    i: 73,\n    j: 74,\n    k: 75,\n    l: 76,\n    m: 77,\n    n: 78,\n    o: 79,\n    p: 80,\n    q: 81,\n    r: 82,\n    s: 83,\n    t: 84,\n    u: 85,\n    v: 86,\n    w: 87,\n    x: 88,\n    y: 89,\n    z: 90,\n    left_window_key: 91,\n    right_window_key: 92,\n    select_key: 93,\n    numpad_0: 96,\n    numpad_1: 97,\n    numpad_2: 98,\n    numpad_3: 99,\n    numpad_4: 100,\n    numpad_5: 101,\n    numpad_6: 102,\n    numpad_7: 103,\n    numpad_8: 104,\n    numpad_9: 105,\n    multiply: 106,\n    add: 107,\n    subtract: 109,\n    decimal_point: 110,\n    divide: 111,\n    f1: 112,\n    f2: 113,\n    f3: 114,\n    f4: 115,\n    f5: 116,\n    f6: 117,\n    f7: 118,\n    f8: 119,\n    f9: 120,\n    f10: 121,\n    f11: 122,\n    f12: 123,\n    num_lock: 144,\n    scroll_lock: 145,\n    semi_colon: 186,\n    equal_sign: 187,\n    comma: 188,\n    dash: 189,\n    period: 190,\n    forward_slash: 191,\n    grave_accent: 192,\n    open_bracket: 219,\n    back_slash: 220,\n    close_braket: 221,\n    single_quote: 222\n  };\n\n  private static codeToKeys: { [index: string]: string } = {\n    \"8\": \"backspace\",\n    \"9\": \"tab\",\n    \"13\": \"enter\",\n    \"16\": \"shift\",\n    \"17\": \"ctrl\",\n    \"18\": \"alt\",\n    \"19\": \"pause_break\",\n    \"20\": \"caps_lock\",\n    \"27\": \"escape\",\n    \"32\": \"spacebar\",\n    \"33\": \"page_up\",\n    \"34\": \"page_down\",\n    \"35\": \"end\",\n    \"36\": \"home\",\n    \"37\": \"left_arrow\",\n    \"38\": \"up_arrow\",\n    \"39\": \"right_arrow\",\n    \"40\": \"down_arrow\",\n    \"45\": \"insert\",\n    \"46\": \"delete\",\n    \"48\": \"0\",\n    \"49\": \"1\",\n    \"50\": \"2\",\n    \"51\": \"3\",\n    \"52\": \"4\",\n    \"53\": \"5\",\n    \"54\": \"6\",\n    \"55\": \"7\",\n    \"56\": \"8\",\n    \"57\": \"9\",\n    \"65\": \"a\",\n    \"66\": \"b\",\n    \"67\": \"c\",\n    \"68\": \"d\",\n    \"69\": \"e\",\n    \"70\": \"f\",\n    \"71\": \"g\",\n    \"72\": \"h\",\n    \"73\": \"i\",\n    \"74\": \"j\",\n    \"75\": \"k\",\n    \"76\": \"l\",\n    \"77\": \"m\",\n    \"78\": \"n\",\n    \"79\": \"o\",\n    \"80\": \"p\",\n    \"81\": \"q\",\n    \"82\": \"r\",\n    \"83\": \"s\",\n    \"84\": \"t\",\n    \"85\": \"u\",\n    \"86\": \"v\",\n    \"87\": \"w\",\n    \"88\": \"x\",\n    \"89\": \"y\",\n    \"90\": \"z\",\n    \"91\": \"left_window_key\",\n    \"92\": \"right_window_key\",\n    \"93\": \"select_key\",\n    \"96\": \"numpad_0\",\n    \"97\": \"numpad_1\",\n    \"98\": \"numpad_2\",\n    \"99\": \"numpad_3\",\n    \"100\": \"numpad_4\",\n    \"101\": \"numpad_5\",\n    \"102\": \"numpad_6\",\n    \"103\": \"numpad_7\",\n    \"104\": \"numpad_8\",\n    \"105\": \"numpad_9\",\n    \"106\": \"multiply\",\n    \"107\": \"add\",\n    \"109\": \"subtract\",\n    \"110\": \"decimal_point\",\n    \"111\": \"divide\",\n    \"112\": \"f1\",\n    \"113\": \"f2\",\n    \"114\": \"f3\",\n    \"115\": \"f4\",\n    \"116\": \"f5\",\n    \"117\": \"f6\",\n    \"118\": \"f7\",\n    \"119\": \"f8\",\n    \"120\": \"f9\",\n    \"121\": \"f10\",\n    \"122\": \"f11\",\n    \"123\": \"f12\",\n    \"144\": \"num_lock\",\n    \"145\": \"scroll_lock\",\n    \"186\": \"semi_colon\",\n    \"187\": \"equal_sign\",\n    \"188\": \"comma\",\n    \"189\": \"dash\",\n    \"190\": \"period\",\n    \"191\": \"forward_slash\",\n    \"192\": \"grave_accent\",\n    \"219\": \"open_bracket\",\n    \"220\": \"back_slash\",\n    \"221\": \"close_braket\",\n    \"222\": \"single_quote\"\n  };\n}\n","export const copyToClipboard = (text) => navigator.clipboard.writeText(text);\n\nexport const getSelectedText = () => window.getSelection().toString();\n\n// Check if an element is focused\nexport const isFocus = (ele) => ele === document.activeElement;\n\n// Get all siblings of an element\nexport const siblings = (ele) =>\n  [].slice.call(ele.parentNode.children).filter((child) => child !== ele);\n\n// Check if the current tab is in view/focus\nexport const isTabInView = () => !document.hidden;\n\nexport const navigateBack = () => history.back();\nexport const navigateBack2 = () => history.go(-1);\n\nexport function loadScript(src) {\n  let script = document.createElement(\"script\");\n  script.type = \"text/javascript\";\n  script.src = src;\n  script.async = false;\n  document.body.appendChild(script);\n  script.onload = () => {};\n  script.onerror = () => {};\n}\n\n/**\n * 获取字符串的宽度\n * @text   将要被提取的原字符串\n * @fontSize  字符串显示时的字符大小，支持>=12\n * @fontWeight  字符串显示时的字符粗细\n */\nexport const getTextWidth = (text, fontSize, fontWeight = 400) => {\n  const span = document.createElement(\"span\");\n  span.style.visibility = \"hidden\";\n  span.style.padding = \"0\";\n  span.style.whiteSpace = \"nowrap\";\n  span.style.overflow = \"visible\";\n  span.style.fontSize = fontSize > 12 ? fontSize + \"px\" : \"12px\";\n  span.style.fontWeight = fontWeight.toString();\n  span.innerText = text;\n  document.body.appendChild(span);\n  const width = span.offsetWidth;\n  document.body.removeChild(span);\n  return width;\n};\n\n/**\n * 获取固定宽度的字符串，如果传入的text的宽度不够width,则返回原字符串\n * @text   将要被提取的原字符串\n * @width  想要提取的字符串长度\n * @fontSize  字符串显示时的字符大小，支持>=12\n * @fontWeight  字符串显示时的字符粗细\n * @isNeedEllipsis   当text的宽度大于width时是否需要省略号，会在传入的width基础上加，最后返回字符串宽度会>width\n */\nexport const getFixedWidthText = (\n  text,\n  width,\n  fontSize = 12,\n  fontWeight = 400,\n  isNeedEllipsis = true\n) => {\n  let returnText = \"\";\n  let oldText = \"\";\n  let newText = \"\";\n  if (!text || width < fontSize || typeof text !== \"string\") return returnText;\n  const arr = text.split(\"\");\n  const span = document.createElement(\"span\");\n  span.style.visibility = \"hidden\";\n  span.style.padding = \"0\";\n  span.style.whiteSpace = \"nowrap\";\n  span.style.overflow = \"visible\";\n  span.style.fontSize = fontSize > 12 ? fontSize + \"px\" : \"12px\";\n  span.style.fontWeight = fontWeight.toString();\n  document.body.appendChild(span);\n\n  for (let i = 0, l = arr.length; i < l; i++) {\n    const item = arr[i];\n    oldText = newText;\n    newText += item;\n    returnText = newText;\n    span.innerText = newText;\n    const nowWidth = span.offsetWidth;\n    if (nowWidth > width) {\n      if (isNeedEllipsis) {\n        returnText = oldText + \"...\";\n      } else {\n        returnText = oldText;\n      }\n      break;\n    }\n  }\n\n  document.body.removeChild(span);\n  return returnText;\n};\n\n/**\n * let sender = '<script>alert(\"abc\")</script>'; // 恶意代码\n    let safer = saferHTML`<p>${sender} has sent you a message.</p>`;\n    expect(safer).toBe(\n      '<p>&lt;script&gt;alert(\"abc\")&lt;/script&gt; has sent you a message.</p>'\n    );\n    [Arguments] {\n      '0': [ '<p>', ' has sent you a message.</p>' ],\n      '1': '<script>alert(\"abc\")</script>'\n    }\n*/\nexport function htmlEncode(templateData) {\n  let s = templateData[0];\n  for (let i = 1; i < arguments.length; i++) {\n    let arg = String(arguments[i]);\n\n    // Escape special characters in the substitution.\n    s += arg\n      .replace(/&/g, \"&amp;\")\n      .replace(/</g, \"&lt;\")\n      .replace(/>/g, \"&gt;\")\n      .replace(/\"/g, \"&quot;\")\n      .replace(/'/g, \"&#39;\");\n\n    // Don't escape special characters in the template.\n    s += templateData[i];\n  }\n  return s;\n}\n\nexport function htmlDecode(rawContent) {\n  var entities = {\n    \"&amp;\": \"&\",\n    \"&lt;\": \"<\",\n    \"&gt;\": \">\",\n    \"&quot;\": '\"',\n    \"&#39;\": \"'\"\n  };\n  for (var prop in entities) {\n    if (Object.hasOwnProperty.call(entities, prop)) {\n      rawContent = rawContent.replace(new RegExp(prop, \"g\"), entities[prop]);\n    }\n  }\n  return rawContent;\n}\n\nexport function templateCompile(template) {\n  const evalExpr = /<%=(.+?)%>/g;\n  const expr = /<%([\\s\\S]+?)%>/g;\n\n  template = template\n    .replace(evalExpr, \"`); \\n  echo( $1 ); \\n  echo(`\")\n    .replace(expr, \"`); \\n $1 \\n  echo(`\");\n\n  template = \"echo(`\" + template + \"`);\";\n\n  let script = `(function parse(data){\n      let output = \"\";\n\n      function echo(html){\n        output += html;\n      }\n\n      ${template}\n\n      return output;\n    })`;\n\n  return script;\n}\n\nexport function addEventListener(element, type, handler) {\n  // DOM2级事件\n  if (element.addEventListener) {\n    //true 捕获阶段 false 冒泡阶段\n    element.addEventListener(type, handler, false);\n  } else if (element.attachEvent) {\n    //IE\n    element.attachEvent(\"on\" + type, handler);\n  } else {\n    element[\"on\" + type] = handler;\n  }\n}\n\nexport function removeEventListener(element, type, handler) {\n  if (element.removeEventListener) {\n    element.removeEventListener(type, handler, false);\n  } else if (element.detachEvent) {\n    element.detachEvent(\"on\" + type, handler);\n  } else {\n    element[\"on\" + type] = null;\n  }\n}\n\nexport function stopPropagation(event) {\n  if (event.stopPropagation) {\n    event.stopPropagation();\n  } else {\n    event.cancelBubble = true;\n  }\n}\n\nexport function preventDefault(event) {\n  if (event.preventDefault) {\n    event.preventDefault;\n  } else {\n    event.returnValue = false;\n  }\n}\n\nexport function getTarget(event) {\n  return event.target || event.srcElement;\n}\n\nexport function getRelatedTarget(event) {\n  if (event.relatedTarget) {\n    return event.relatedTarget;\n  } else if (event.toElement) {\n    return event.toElement;\n  } else if (event.fromElement) {\n    return event.fromElement;\n  } else {\n    return null;\n  }\n}\n\nexport function isBrowserSupportFileAPI() {\n  if (window.File && window.FileReader && window.FileList && window.Blob) {\n    return true;\n  } else {\n    // console.log(\"The File APIs are not fully supported in this browser.\");\n    return false;\n  }\n}\n\nexport const waitForStyleSheetsLoaded = (document) =>\n  new Promise((resolve) => {\n    const links = Array.from(document.querySelectorAll(\"link[rel=stylesheet]\"));\n    let loadedCount = document.styleSheets.length ?? 0;\n    const checkAllLoaded = () => {\n      if (loadedCount >= links.length) {\n        resolve();\n        return true;\n      }\n      return false;\n    };\n    if (!checkAllLoaded()) {\n      links.forEach((stylesheet) => {\n        stylesheet.onload = () => {\n          loadedCount += 1;\n          checkAllLoaded();\n        };\n      });\n    }\n  });\n","(function () {\n  let lastTime = 0;\n  // const vendors = [\"ms\", \"moz\", \"webkit\", \"o\"];\n  // for (let x = 0; x < vendors.length && !window.requestAnimationFrame; ++x) {\n  //   window.requestAnimationFrame = window[vendors[x] + \"RequestAnimationFrame\"];\n  //   window.cancelAnimationFrame =\n  //     window[vendors[x] + \"CancelAnimationFrame\"] ||\n  //     window[vendors[x] + \"CancelRequestAnimationFrame\"];\n  // }\n  if (!window.requestAnimationFrame)\n    window.requestAnimationFrame = function (callback) {\n      const currTime = new Date().getTime();\n      const timeToCall = Math.max(0, 16 - (currTime - lastTime));\n      const id = window.setTimeout(function () {\n        callback(currTime + timeToCall);\n      }, timeToCall);\n      lastTime = currTime + timeToCall;\n      return id;\n    };\n  if (!window.cancelAnimationFrame)\n    window.cancelAnimationFrame = function (id) {\n      clearTimeout(id);\n    };\n})();\n\nexport const animateInWeb = (\n  render: (durationTime: number, id: number) => void\n) => {\n  function animate(durationTime: number) {\n    const id = window.requestAnimationFrame(animate);\n    render(durationTime, id);\n  }\n  window.requestAnimationFrame(animate);\n};\n\nexport const animateCanvas = (\n  canvasID: string,\n  render: (\n    ctx: CanvasRenderingContext2D,\n    durationTime: number,\n    id: number\n  ) => void\n) => {\n  const canvas = document.getElementById(canvasID) as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  animateInWeb((durationTime, id) => {\n    ctx.clearRect(0, 0, canvas.width, canvas.height);\n    render(ctx, durationTime, id);\n  });\n};\n","\r\n\r\nvar UZIP = {};\r\nif(typeof module == \"object\") module.exports = UZIP;\r\n\r\n\r\nUZIP[\"parse\"] = function(buf, onlyNames)\t// ArrayBuffer\r\n{\r\n\tvar rUs = UZIP.bin.readUshort, rUi = UZIP.bin.readUint, o = 0, out = {};\r\n\tvar data = new Uint8Array(buf);\r\n\tvar eocd = data.length-4;\r\n\t\r\n\twhile(rUi(data, eocd)!=0x06054b50) eocd--;\r\n\t\r\n\tvar o = eocd;\r\n\to+=4;\t// sign  = 0x06054b50\r\n\to+=4;  // disks = 0;\r\n\tvar cnu = rUs(data, o);  o+=2;\r\n\tvar cnt = rUs(data, o);  o+=2;\r\n\t\t\t\r\n\tvar csize = rUi(data, o);  o+=4;\r\n\tvar coffs = rUi(data, o);  o+=4;\r\n\t\r\n\to = coffs;\r\n\tfor(var i=0; i<cnu; i++)\r\n\t{\r\n\t\tvar sign = rUi(data, o);  o+=4;\r\n\t\to += 4;  // versions;\r\n\t\to += 4;  // flag + compr\r\n\t\to += 4;  // time\r\n\t\t\r\n\t\tvar crc32 = rUi(data, o);  o+=4;\r\n\t\tvar csize = rUi(data, o);  o+=4;\r\n\t\tvar usize = rUi(data, o);  o+=4;\r\n\t\t\r\n\t\tvar nl = rUs(data, o), el = rUs(data, o+2), cl = rUs(data, o+4);  o += 6;  // name, extra, comment\r\n\t\to += 8;  // disk, attribs\r\n\t\t\r\n\t\tvar roff = rUi(data, o);  o+=4;\r\n\t\to += nl + el + cl;\r\n\t\t\r\n\t\tUZIP._readLocal(data, roff, out, csize, usize, onlyNames);\r\n\t}\r\n\t//console.log(out);\r\n\treturn out;\r\n}\r\n\r\nUZIP._readLocal = function(data, o, out, csize, usize, onlyNames)\r\n{\r\n\tvar rUs = UZIP.bin.readUshort, rUi = UZIP.bin.readUint;\r\n\tvar sign  = rUi(data, o);  o+=4;\r\n\tvar ver   = rUs(data, o);  o+=2;\r\n\tvar gpflg = rUs(data, o);  o+=2;\r\n\t//if((gpflg&8)!=0) throw \"unknown sizes\";\r\n\tvar cmpr  = rUs(data, o);  o+=2;\r\n\t\r\n\tvar time  = rUi(data, o);  o+=4;\r\n\t\r\n\tvar crc32 = rUi(data, o);  o+=4;\r\n\t//var csize = rUi(data, o);  o+=4;\r\n\t//var usize = rUi(data, o);  o+=4;\r\n\to+=8;\r\n\t\t\r\n\tvar nlen  = rUs(data, o);  o+=2;\r\n\tvar elen  = rUs(data, o);  o+=2;\r\n\t\t\r\n\tvar name =  UZIP.bin.readUTF8(data, o, nlen);  o+=nlen;  //console.log(name);\r\n\to += elen;\r\n\t\t\t\r\n\t//console.log(sign.toString(16), ver, gpflg, cmpr, crc32.toString(16), \"csize, usize\", csize, usize, nlen, elen, name, o);\r\n\tif(onlyNames) {  out[name]={size:usize, csize:csize};  return;  }   \r\n\tvar file = new Uint8Array(data.buffer, o);\r\n\tif(false) {}\r\n\telse if(cmpr==0) out[name] = new Uint8Array(file.buffer.slice(o, o+csize));\r\n\telse if(cmpr==8) {\r\n\t\tvar buf = new Uint8Array(usize);  UZIP.inflateRaw(file, buf);\r\n\t\t/*var nbuf = pako[\"inflateRaw\"](file);\r\n\t\tif(usize>8514000) {\r\n\t\t\t//console.log(PUtils.readASCII(buf , 8514500, 500));\r\n\t\t\t//console.log(PUtils.readASCII(nbuf, 8514500, 500));\r\n\t\t}\r\n\t\tfor(var i=0; i<buf.length; i++) if(buf[i]!=nbuf[i]) {  console.log(buf.length, nbuf.length, usize, i);  throw \"e\";  }\r\n\t\t*/\r\n\t\tout[name] = buf;\r\n\t}\r\n\telse throw \"unknown compression method: \"+cmpr;\r\n}\r\n\r\nUZIP.inflateRaw = function(file, buf) {  return UZIP.F.inflate(file, buf);  }\r\nUZIP.inflate    = function(file, buf) { \r\n\tvar CMF = file[0], FLG = file[1];\r\n\tvar CM = (CMF&15), CINFO = (CMF>>>4);\r\n\t//console.log(CM, CINFO,CMF,FLG);\r\n\treturn UZIP.inflateRaw(new Uint8Array(file.buffer, file.byteOffset+2, file.length-6), buf);  \r\n}\r\nUZIP.deflate    = function(data, opts/*, buf, off*/) {\r\n\tif(opts==null) opts={level:6};\r\n\tvar off=0, buf=new Uint8Array(50+Math.floor(data.length*1.1));\r\n\tbuf[off]=120;  buf[off+1]=156;  off+=2;\r\n\toff = UZIP.F.deflateRaw(data, buf, off, opts.level);\r\n\tvar crc = UZIP.adler(data, 0, data.length);\r\n\tbuf[off+0]=((crc>>>24)&255); \r\n\tbuf[off+1]=((crc>>>16)&255); \r\n\tbuf[off+2]=((crc>>> 8)&255); \r\n\tbuf[off+3]=((crc>>> 0)&255); \t\r\n\treturn new Uint8Array(buf.buffer, 0, off+4);\r\n}\r\nUZIP.deflateRaw = function(data, opts) {\r\n\tif(opts==null) opts={level:6};\r\n\tvar buf=new Uint8Array(50+Math.floor(data.length*1.1));\r\n\tvar off = UZIP.F.deflateRaw(data, buf, off, opts.level);\r\n\treturn new Uint8Array(buf.buffer, 0, off);\r\n}\r\n\r\n\r\nUZIP.encode = function(obj, noCmpr) {\r\n\tif(noCmpr==null) noCmpr=false;\r\n\tvar tot = 0, wUi = UZIP.bin.writeUint, wUs = UZIP.bin.writeUshort;\r\n\tvar zpd = {};\r\n\tfor(var p in obj) {  var cpr = !UZIP._noNeed(p) && !noCmpr, buf = obj[p], crc = UZIP.crc.crc(buf,0,buf.length); \r\n\t\tzpd[p] = {  cpr:cpr, usize:buf.length, crc:crc, file: (cpr ? UZIP.deflateRaw(buf) : buf)  };  }\r\n\t\r\n\tfor(var p in zpd) tot += zpd[p].file.length + 30 + 46 + 2*UZIP.bin.sizeUTF8(p);\r\n\ttot +=  22;\r\n\t\r\n\tvar data = new Uint8Array(tot), o = 0;\r\n\tvar fof = []\r\n\t\r\n\tfor(var p in zpd) {\r\n\t\tvar file = zpd[p];  fof.push(o);\r\n\t\to = UZIP._writeHeader(data, o, p, file, 0);\r\n\t}\r\n\tvar i=0, ioff = o;\r\n\tfor(var p in zpd) {\r\n\t\tvar file = zpd[p];  fof.push(o);\r\n\t\to = UZIP._writeHeader(data, o, p, file, 1, fof[i++]);\t\t\r\n\t}\r\n\tvar csize = o-ioff;\r\n\t\r\n\twUi(data, o, 0x06054b50);  o+=4;\r\n\to += 4;  // disks\r\n\twUs(data, o, i);  o += 2;\r\n\twUs(data, o, i);  o += 2;\t// number of c d records\r\n\twUi(data, o, csize);  o += 4;\r\n\twUi(data, o, ioff );  o += 4;\r\n\to += 2;\r\n\treturn data.buffer;\r\n}\r\n// no need to compress .PNG, .ZIP, .JPEG ....\r\nUZIP._noNeed = function(fn) {  var ext = fn.split(\".\").pop().toLowerCase();  return \"png,jpg,jpeg,zip\".indexOf(ext)!=-1;  }\r\n\r\nUZIP._writeHeader = function(data, o, p, obj, t, roff)\r\n{\r\n\tvar wUi = UZIP.bin.writeUint, wUs = UZIP.bin.writeUshort;\r\n\tvar file = obj.file;\r\n\t\r\n\twUi(data, o, t==0 ? 0x04034b50 : 0x02014b50);  o+=4; // sign\r\n\tif(t==1) o+=2;  // ver made by\r\n\twUs(data, o, 20);  o+=2;\t// ver\r\n\twUs(data, o,  0);  o+=2;    // gflip\r\n\twUs(data, o,  obj.cpr?8:0);  o+=2;\t// cmpr\r\n\t\t\r\n\twUi(data, o,  0);  o+=4;\t// time\t\t\r\n\twUi(data, o, obj.crc);  o+=4;\t// crc32\r\n\twUi(data, o, file.length);  o+=4;\t// csize\r\n\twUi(data, o, obj.usize);  o+=4;\t// usize\r\n\t\t\r\n\twUs(data, o, UZIP.bin.sizeUTF8(p));  o+=2;\t// nlen\r\n\twUs(data, o, 0);  o+=2;\t// elen\r\n\t\r\n\tif(t==1) {\r\n\t\to += 2;  // comment length\r\n\t\to += 2;  // disk number\r\n\t\to += 6;  // attributes\r\n\t\twUi(data, o, roff);  o+=4;\t// usize\r\n\t}\r\n\tvar nlen = UZIP.bin.writeUTF8(data, o, p);  o+= nlen;\t\r\n\tif(t==0) {  data.set(file, o);  o += file.length;  }\r\n\treturn o;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nUZIP.crc = {\r\n\ttable : ( function() {\r\n\t   var tab = new Uint32Array(256);\r\n\t   for (var n=0; n<256; n++) {\r\n\t\t\tvar c = n;\r\n\t\t\tfor (var k=0; k<8; k++) {\r\n\t\t\t\tif (c & 1)  c = 0xedb88320 ^ (c >>> 1);\r\n\t\t\t\telse        c = c >>> 1;\r\n\t\t\t}\r\n\t\t\ttab[n] = c;  }    \r\n\t\treturn tab;  })(),\r\n\tupdate : function(c, buf, off, len) {\r\n\t\tfor (var i=0; i<len; i++)  c = UZIP.crc.table[(c ^ buf[off+i]) & 0xff] ^ (c >>> 8);\r\n\t\treturn c;\r\n\t},\r\n\tcrc : function(b,o,l)  {  return UZIP.crc.update(0xffffffff,b,o,l) ^ 0xffffffff;  }\r\n}\r\nUZIP.adler = function(data,o,len) {\r\n\tvar a = 1, b = 0;\r\n\tvar off = o, end=o+len;\r\n\twhile(off<end) {\r\n\t\tvar eend = Math.min(off+5552, end);\r\n\t\twhile(off<eend) {\r\n\t\t\ta += data[off++];\r\n\t\t\tb += a;\r\n\t\t}\r\n\t\ta=a%65521;\r\n\t\tb=b%65521;\r\n\t}\r\n    return (b << 16) | a;\r\n}\r\n\r\nUZIP.bin = {\r\n\treadUshort : function(buff,p)  {  return (buff[p]) | (buff[p+1]<<8);  },\r\n\twriteUshort: function(buff,p,n){  buff[p] = (n)&255;  buff[p+1] = (n>>8)&255;  },\r\n\treadUint   : function(buff,p)  {  return (buff[p+3]*(256*256*256)) + ((buff[p+2]<<16) | (buff[p+1]<< 8) | buff[p]);  },\r\n\twriteUint  : function(buff,p,n){  buff[p]=n&255;  buff[p+1]=(n>>8)&255;  buff[p+2]=(n>>16)&255;  buff[p+3]=(n>>24)&255;  },\r\n\treadASCII  : function(buff,p,l){  var s = \"\";  for(var i=0; i<l; i++) s += String.fromCharCode(buff[p+i]);  return s;    },\r\n\twriteASCII : function(data,p,s){  for(var i=0; i<s.length; i++) data[p+i] = s.charCodeAt(i);  },\r\n\tpad : function(n) { return n.length < 2 ? \"0\" + n : n; },\r\n\treadUTF8 : function(buff, p, l) {\r\n\t\tvar s = \"\", ns;\r\n\t\tfor(var i=0; i<l; i++) s += \"%\" + UZIP.bin.pad(buff[p+i].toString(16));\r\n\t\ttry {  ns = decodeURIComponent(s); }\r\n\t\tcatch(e) {  return UZIP.bin.readASCII(buff, p, l);  }\r\n\t\treturn  ns;\r\n\t},\r\n\twriteUTF8 : function(buff, p, str) {\r\n\t\tvar strl = str.length, i=0;\r\n\t\tfor(var ci=0; ci<strl; ci++)\r\n\t\t{\r\n\t\t\tvar code = str.charCodeAt(ci);\r\n\t\t\tif     ((code&(0xffffffff-(1<< 7)+1))==0) {  buff[p+i] = (     code     );  i++;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<11)+1))==0) {  buff[p+i] = (192|(code>> 6));  buff[p+i+1] = (128|((code>> 0)&63));  i+=2;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<16)+1))==0) {  buff[p+i] = (224|(code>>12));  buff[p+i+1] = (128|((code>> 6)&63));  buff[p+i+2] = (128|((code>>0)&63));  i+=3;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<21)+1))==0) {  buff[p+i] = (240|(code>>18));  buff[p+i+1] = (128|((code>>12)&63));  buff[p+i+2] = (128|((code>>6)&63));  buff[p+i+3] = (128|((code>>0)&63)); i+=4;  }\r\n\t\t\telse throw \"e\";\r\n\t\t}\r\n\t\treturn i;\r\n\t},\r\n\tsizeUTF8 : function(str) {\r\n\t\tvar strl = str.length, i=0;\r\n\t\tfor(var ci=0; ci<strl; ci++)\r\n\t\t{\r\n\t\t\tvar code = str.charCodeAt(ci);\r\n\t\t\tif     ((code&(0xffffffff-(1<< 7)+1))==0) {  i++ ;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<11)+1))==0) {  i+=2;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<16)+1))==0) {  i+=3;  }\r\n\t\t\telse if((code&(0xffffffff-(1<<21)+1))==0) {  i+=4;  }\r\n\t\t\telse throw \"e\";\r\n\t\t}\r\n\t\treturn i;\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n\r\nUZIP.F = {};\r\n\r\nUZIP.F.deflateRaw = function(data, out, opos, lvl) {\t\r\n\tvar opts = [\r\n\t/*\r\n\t\t ush good_length; /* reduce lazy search above this match length \r\n\t\t ush max_lazy;    /* do not perform lazy search above this match length \r\n         ush nice_length; /* quit search above this match length \r\n\t*/\r\n\t/*      good lazy nice chain */\r\n\t/* 0 */ [ 0,   0,   0,    0,0],  /* store only */\r\n\t/* 1 */ [ 4,   4,   8,    4,0], /* max speed, no lazy matches */\r\n\t/* 2 */ [ 4,   5,  16,    8,0],\r\n\t/* 3 */ [ 4,   6,  16,   16,0],\r\n\r\n\t/* 4 */ [ 4,  10,  16,   32,0],  /* lazy matches */\r\n\t/* 5 */ [ 8,  16,  32,   32,0],\r\n\t/* 6 */ [ 8,  16, 128,  128,0],\r\n\t/* 7 */ [ 8,  32, 128,  256,0],\r\n\t/* 8 */ [32, 128, 258, 1024,1],\r\n\t/* 9 */ [32, 258, 258, 4096,1]]; /* max compression */\r\n\t\r\n\tvar opt = opts[lvl];\r\n\t\r\n\t\r\n\tvar U = UZIP.F.U, goodIndex = UZIP.F._goodIndex, hash = UZIP.F._hash, putsE = UZIP.F._putsE;\r\n\tvar i = 0, pos = opos<<3, cvrd = 0, dlen = data.length;\r\n\t\r\n\tif(lvl==0) {\r\n\t\twhile(i<dlen) {   var len = Math.min(0xffff, dlen-i);\r\n\t\t\tputsE(out, pos, (i+len==dlen ? 1 : 0));  pos = UZIP.F._copyExact(data, i, len, out, pos+8);  i += len;  }\r\n\t\treturn pos>>>3;\r\n\t}\r\n\r\n\tvar lits = U.lits, strt=U.strt, prev=U.prev, li=0, lc=0, bs=0, ebits=0, c=0, nc=0;  // last_item, literal_count, block_start\r\n\tif(dlen>2) {  nc=UZIP.F._hash(data,0);  strt[nc]=0;  }\r\n\tvar nmch=0,nmci=0;\r\n\t\r\n\tfor(i=0; i<dlen; i++)  {\r\n\t\tc = nc;\r\n\t\t//*\r\n\t\tif(i+1<dlen-2) {\r\n\t\t\tnc = UZIP.F._hash(data, i+1);\r\n\t\t\tvar ii = ((i+1)&0x7fff);\r\n\t\t\tprev[ii]=strt[nc];\r\n\t\t\tstrt[nc]=ii;\r\n\t\t} //*/\r\n\t\tif(cvrd<=i) {\r\n\t\t\tif((li>14000 || lc>26697) && (dlen-i)>100) {\r\n\t\t\t\tif(cvrd<i) {  lits[li]=i-cvrd;  li+=2;  cvrd=i;  }\r\n\t\t\t\tpos = UZIP.F._writeBlock(((i==dlen-1) || (cvrd==dlen))?1:0, lits, li, ebits, data,bs,i-bs, out, pos);  li=lc=ebits=0;  bs=i;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tvar mch = 0;\r\n\t\t\t//if(nmci==i) mch= nmch;  else \r\n\t\t\tif(i<dlen-2) mch = UZIP.F._bestMatch(data, i, prev, c, Math.min(opt[2],dlen-i), opt[3]);\r\n\t\t\t/*\r\n\t\t\tif(mch!=0 && opt[4]==1 && (mch>>>16)<opt[1] && i+1<dlen-2) {\r\n\t\t\t\tnmch = UZIP.F._bestMatch(data, i+1, prev, nc, opt[2], opt[3]);  nmci=i+1;\r\n\t\t\t\t//var mch2 = UZIP.F._bestMatch(data, i+2, prev, nnc);  //nmci=i+1;\r\n\t\t\t\tif((nmch>>>16)>(mch>>>16)) mch=0;\r\n\t\t\t}//*/\r\n\t\t\tvar len = mch>>>16, dst = mch&0xffff;  //if(i-dst<0) throw \"e\";\r\n\t\t\tif(mch!=0) { \r\n\t\t\t\tvar len = mch>>>16, dst = mch&0xffff;  //if(i-dst<0) throw \"e\";\r\n\t\t\t\tvar lgi = goodIndex(len, U.of0);  U.lhst[257+lgi]++; \r\n\t\t\t\tvar dgi = goodIndex(dst, U.df0);  U.dhst[    dgi]++;  ebits += U.exb[lgi] + U.dxb[dgi]; \r\n\t\t\t\tlits[li] = (len<<23)|(i-cvrd);  lits[li+1] = (dst<<16)|(lgi<<8)|dgi;  li+=2;\r\n\t\t\t\tcvrd = i + len;  \r\n\t\t\t}\r\n\t\t\telse {\tU.lhst[data[i]]++;  }\r\n\t\t\tlc++;\r\n\t\t}\r\n\t}\r\n\tif(bs!=i || data.length==0) {\r\n\t\tif(cvrd<i) {  lits[li]=i-cvrd;  li+=2;  cvrd=i;  }\r\n\t\tpos = UZIP.F._writeBlock(1, lits, li, ebits, data,bs,i-bs, out, pos);  li=0;  lc=0;  li=lc=ebits=0;  bs=i;\r\n\t}\r\n\twhile((pos&7)!=0) pos++;\r\n\treturn pos>>>3;\r\n}\r\nUZIP.F._bestMatch = function(data, i, prev, c, nice, chain) {\r\n\tvar ci = (i&0x7fff), pi=prev[ci];  \r\n\t//console.log(\"----\", i);\r\n\tvar dif = ((ci-pi + (1<<15)) & 0x7fff);  if(pi==ci || c!=UZIP.F._hash(data,i-dif)) return 0;\r\n\tvar tl=0, td=0;  // top length, top distance\r\n\tvar dlim = Math.min(0x7fff, i);\r\n\twhile(dif<=dlim && --chain!=0 && pi!=ci /*&& c==UZIP.F._hash(data,i-dif)*/) {\r\n\t\tif(tl==0 || (data[i+tl]==data[i+tl-dif])) {\r\n\t\t\tvar cl = UZIP.F._howLong(data, i, dif);\r\n\t\t\tif(cl>tl) {  \r\n\t\t\t\ttl=cl;  td=dif;  if(tl>=nice) break;    //* \r\n\t\t\t\tif(dif+2<cl) cl = dif+2;\r\n\t\t\t\tvar maxd = 0; // pi does not point to the start of the word\r\n\t\t\t\tfor(var j=0; j<cl-2; j++) {\r\n\t\t\t\t\tvar ei =  (i-dif+j+ (1<<15)) & 0x7fff;\r\n\t\t\t\t\tvar li = prev[ei];\r\n\t\t\t\t\tvar curd = (ei-li + (1<<15)) & 0x7fff;\r\n\t\t\t\t\tif(curd>maxd) {  maxd=curd;  pi = ei; }\r\n\t\t\t\t}  //*/\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tci=pi;  pi = prev[ci];\r\n\t\tdif += ((ci-pi + (1<<15)) & 0x7fff);\r\n\t}\r\n\treturn (tl<<16)|td;\r\n}\r\nUZIP.F._howLong = function(data, i, dif) {\r\n\tif(data[i]!=data[i-dif] || data[i+1]!=data[i+1-dif] || data[i+2]!=data[i+2-dif]) return 0;\r\n\tvar oi=i, l = Math.min(data.length, i+258);  i+=3;\r\n\t//while(i+4<l && data[i]==data[i-dif] && data[i+1]==data[i+1-dif] && data[i+2]==data[i+2-dif] && data[i+3]==data[i+3-dif]) i+=4;\r\n\twhile(i<l && data[i]==data[i-dif]) i++;\r\n\treturn i-oi;\r\n}\r\nUZIP.F._hash = function(data, i) {\r\n\treturn (((data[i]<<8) | data[i+1])+(data[i+2]<<4))&0xffff;\r\n\t//var hash_shift = 0, hash_mask = 255;\r\n\t//var h = data[i+1] % 251;\r\n\t//h = (((h << 8) + data[i+2]) % 251);\r\n\t//h = (((h << 8) + data[i+2]) % 251);\r\n\t//h = ((h<<hash_shift) ^ (c) ) & hash_mask;\r\n\t//return h | (data[i]<<8);\r\n\t//return (data[i] | (data[i+1]<<8));\r\n}\r\n//UZIP.___toth = 0;\r\nUZIP.saved = 0;\r\nUZIP.F._writeBlock = function(BFINAL, lits, li, ebits, data,o0,l0, out, pos) {\r\n\tvar U = UZIP.F.U, putsF = UZIP.F._putsF, putsE = UZIP.F._putsE;\r\n\t\r\n\t//*\r\n\tvar T, ML, MD, MH, numl, numd, numh, lset, dset;  U.lhst[256]++;\r\n\tT = UZIP.F.getTrees(); ML=T[0]; MD=T[1]; MH=T[2]; numl=T[3]; numd=T[4]; numh=T[5]; lset=T[6]; dset=T[7];\r\n\t\r\n\tvar cstSize = (((pos+3)&7)==0 ? 0 : 8-((pos+3)&7)) + 32 + (l0<<3);\r\n\tvar fxdSize = ebits + UZIP.F.contSize(U.fltree, U.lhst) + UZIP.F.contSize(U.fdtree, U.dhst);\r\n\tvar dynSize = ebits + UZIP.F.contSize(U.ltree , U.lhst) + UZIP.F.contSize(U.dtree , U.dhst);\r\n\tdynSize    += 14 + 3*numh + UZIP.F.contSize(U.itree, U.ihst) + (U.ihst[16]*2 + U.ihst[17]*3 + U.ihst[18]*7);\r\n\t\r\n\tfor(var j=0; j<286; j++) U.lhst[j]=0;   for(var j=0; j<30; j++) U.dhst[j]=0;   for(var j=0; j<19; j++) U.ihst[j]=0;\r\n\t//*/\r\n\tvar BTYPE = (cstSize<fxdSize && cstSize<dynSize) ? 0 : ( fxdSize<dynSize ? 1 : 2 );\r\n\tputsF(out, pos, BFINAL);  putsF(out, pos+1, BTYPE);  pos+=3;\r\n\t\r\n\tvar opos = pos;\r\n\tif(BTYPE==0) {\r\n\t\twhile((pos&7)!=0) pos++;\r\n\t\tpos = UZIP.F._copyExact(data, o0, l0, out, pos);\r\n\t}\r\n\telse {\r\n\t\tvar ltree, dtree;\r\n\t\tif(BTYPE==1) {  ltree=U.fltree;  dtree=U.fdtree;  }\r\n\t\tif(BTYPE==2) {\t\r\n\t\t\tUZIP.F.makeCodes(U.ltree, ML);  UZIP.F.revCodes(U.ltree, ML);\r\n\t\t\tUZIP.F.makeCodes(U.dtree, MD);  UZIP.F.revCodes(U.dtree, MD);\r\n\t\t\tUZIP.F.makeCodes(U.itree, MH);  UZIP.F.revCodes(U.itree, MH);\r\n\t\t\t\r\n\t\t\tltree = U.ltree;  dtree = U.dtree;\r\n\t\t\t\r\n\t\t\tputsE(out, pos,numl-257);  pos+=5;  // 286\r\n\t\t\tputsE(out, pos,numd-  1);  pos+=5;  // 30\r\n\t\t\tputsE(out, pos,numh-  4);  pos+=4;  // 19\r\n\t\t\t\r\n\t\t\tfor(var i=0; i<numh; i++) putsE(out, pos+i*3, U.itree[(U.ordr[i]<<1)+1]);   pos+=3* numh;\r\n\t\t\tpos = UZIP.F._codeTiny(lset, U.itree, out, pos);\r\n\t\t\tpos = UZIP.F._codeTiny(dset, U.itree, out, pos);\r\n\t\t}\r\n\t\t\r\n\t\tvar off=o0;\r\n\t\tfor(var si=0; si<li; si+=2) {\r\n\t\t\tvar qb=lits[si], len=(qb>>>23), end = off+(qb&((1<<23)-1));\r\n\t\t\twhile(off<end) pos = UZIP.F._writeLit(data[off++], ltree, out, pos);\r\n\t\t\t\r\n\t\t\tif(len!=0) {\r\n\t\t\t\tvar qc = lits[si+1], dst=(qc>>16), lgi=(qc>>8)&255, dgi=(qc&255);\r\n\t\t\t\tpos = UZIP.F._writeLit(257+lgi, ltree, out, pos);\r\n\t\t\t\tputsE(out, pos, len-U.of0[lgi]);  pos+=U.exb[lgi];\r\n\t\t\t\t\r\n\t\t\t\tpos = UZIP.F._writeLit(dgi, dtree, out, pos);\r\n\t\t\t\tputsF(out, pos, dst-U.df0[dgi]);  pos+=U.dxb[dgi];  off+=len;\r\n\t\t\t}\r\n\t\t}\r\n\t\tpos = UZIP.F._writeLit(256, ltree, out, pos);\r\n\t}\r\n\t//console.log(pos-opos, fxdSize, dynSize, cstSize);\r\n\treturn pos;\r\n}\r\nUZIP.F._copyExact = function(data,off,len,out,pos) {\r\n\tvar p8 = (pos>>>3);\r\n\tout[p8]=(len);  out[p8+1]=(len>>>8);  out[p8+2]=255-out[p8];  out[p8+3]=255-out[p8+1];  p8+=4;\r\n\tout.set(new Uint8Array(data.buffer, off, len), p8);\r\n\t//for(var i=0; i<len; i++) out[p8+i]=data[off+i];\r\n\treturn pos + ((len+4)<<3);\r\n}\r\n/*\r\n\tInteresting facts:\r\n\t- decompressed block can have bytes, which do not occur in a Huffman tree (copied from the previous block by reference)\r\n*/\r\n\r\nUZIP.F.getTrees = function() {\r\n\tvar U = UZIP.F.U;\r\n\tvar ML = UZIP.F._hufTree(U.lhst, U.ltree, 15);\r\n\tvar MD = UZIP.F._hufTree(U.dhst, U.dtree, 15);\r\n\tvar lset = [], numl = UZIP.F._lenCodes(U.ltree, lset);\r\n\tvar dset = [], numd = UZIP.F._lenCodes(U.dtree, dset);\r\n\tfor(var i=0; i<lset.length; i+=2) U.ihst[lset[i]]++;\r\n\tfor(var i=0; i<dset.length; i+=2) U.ihst[dset[i]]++;\r\n\tvar MH = UZIP.F._hufTree(U.ihst, U.itree,  7);\r\n\tvar numh = 19;  while(numh>4 && U.itree[(U.ordr[numh-1]<<1)+1]==0) numh--;\r\n\treturn [ML, MD, MH, numl, numd, numh, lset, dset];\r\n}\r\nUZIP.F.getSecond= function(a) {  var b=[];  for(var i=0; i<a.length; i+=2) b.push  (a[i+1]);  return b;  }\r\nUZIP.F.nonZero  = function(a) {  var b= \"\";  for(var i=0; i<a.length; i+=2) if(a[i+1]!=0)b+=(i>>1)+\",\";  return b;  }\r\nUZIP.F.contSize = function(tree, hst) {  var s=0;  for(var i=0; i<hst.length; i++) s+= hst[i]*tree[(i<<1)+1];  return s;  }\r\nUZIP.F._codeTiny = function(set, tree, out, pos) {\r\n\tfor(var i=0; i<set.length; i+=2) {\r\n\t\tvar l = set[i], rst = set[i+1];  //console.log(l, pos, tree[(l<<1)+1]);\r\n\t\tpos = UZIP.F._writeLit(l, tree, out, pos);\r\n\t\tvar rsl = l==16 ? 2 : (l==17 ? 3 : 7);\r\n\t\tif(l>15) {  UZIP.F._putsE(out, pos, rst, rsl);  pos+=rsl;  }\r\n\t}\r\n\treturn pos;\r\n}\r\nUZIP.F._lenCodes = function(tree, set) {\r\n\tvar len=tree.length;  while(len!=2 && tree[len-1]==0) len-=2;  // when no distances, keep one code with length 0\r\n\tfor(var i=0; i<len; i+=2) {\r\n\t\tvar l = tree[i+1], nxt = (i+3<len ? tree[i+3]:-1),  nnxt = (i+5<len ? tree[i+5]:-1),  prv = (i==0 ? -1 : tree[i-1]);\r\n\t\tif(l==0 && nxt==l && nnxt==l) {\r\n\t\t\tvar lz = i+5;\r\n\t\t\twhile(lz+2<len && tree[lz+2]==l) lz+=2;\r\n\t\t\tvar zc = Math.min((lz+1-i)>>>1, 138);\r\n\t\t\tif(zc<11) set.push(17, zc-3);\r\n\t\t\telse set.push(18, zc-11);\r\n\t\t\ti += zc*2-2;\r\n\t\t}\r\n\t\telse if(l==prv && nxt==l && nnxt==l) {\r\n\t\t\tvar lz = i+5;\r\n\t\t\twhile(lz+2<len && tree[lz+2]==l) lz+=2;\r\n\t\t\tvar zc = Math.min((lz+1-i)>>>1, 6);\r\n\t\t\tset.push(16, zc-3);\r\n\t\t\ti += zc*2-2;\r\n\t\t}\r\n\t\telse set.push(l, 0);\r\n\t}\r\n\treturn len>>>1;\r\n}\r\nUZIP.F._hufTree   = function(hst, tree, MAXL) {\r\n\tvar list=[], hl = hst.length, tl=tree.length, i=0;\r\n\tfor(i=0; i<tl; i+=2) {  tree[i]=0;  tree[i+1]=0;  }\t\r\n\tfor(i=0; i<hl; i++) if(hst[i]!=0) list.push({lit:i, f:hst[i]});\r\n\tvar end = list.length, l2=list.slice(0);\r\n\tif(end==0) return 0;  // empty histogram (usually for dist)\r\n\tif(end==1) {  var lit=list[0].lit, l2=lit==0?1:0;  tree[(lit<<1)+1]=1;  tree[(l2<<1)+1]=1;  return 1;  }\r\n\tlist.sort(function(a,b){return a.f-b.f;});\r\n\tvar a=list[0], b=list[1], i0=0, i1=1, i2=2;  list[0]={lit:-1,f:a.f+b.f,l:a,r:b,d:0};\r\n\twhile(i1!=end-1) {\r\n\t\tif(i0!=i1 && (i2==end || list[i0].f<list[i2].f)) {  a=list[i0++];  }  else {  a=list[i2++];  }\r\n\t\tif(i0!=i1 && (i2==end || list[i0].f<list[i2].f)) {  b=list[i0++];  }  else {  b=list[i2++];  }\r\n\t\tlist[i1++]={lit:-1,f:a.f+b.f, l:a,r:b};\r\n\t}\r\n\tvar maxl = UZIP.F.setDepth(list[i1-1], 0);\r\n\tif(maxl>MAXL) {  UZIP.F.restrictDepth(l2, MAXL, maxl);  maxl = MAXL;  }\r\n\tfor(i=0; i<end; i++) tree[(l2[i].lit<<1)+1]=l2[i].d;\r\n\treturn maxl;\r\n}\r\n\r\nUZIP.F.setDepth  = function(t, d) {\r\n\tif(t.lit!=-1) {  t.d=d;  return d;  }\r\n\treturn Math.max( UZIP.F.setDepth(t.l, d+1),  UZIP.F.setDepth(t.r, d+1) );\r\n}\r\n\r\nUZIP.F.restrictDepth = function(dps, MD, maxl) {\r\n\tvar i=0, bCost=1<<(maxl-MD), dbt=0;\r\n\tdps.sort(function(a,b){return b.d==a.d ? a.f-b.f : b.d-a.d;});\r\n\t\r\n\tfor(i=0; i<dps.length; i++) if(dps[i].d>MD) {  var od=dps[i].d;  dps[i].d=MD;  dbt+=bCost-(1<<(maxl-od));  }  else break;\r\n\tdbt = dbt>>>(maxl-MD);\r\n\twhile(dbt>0) {  var od=dps[i].d;  if(od<MD) {  dps[i].d++;  dbt-=(1<<(MD-od-1));  }  else  i++;  }\r\n\tfor(; i>=0; i--) if(dps[i].d==MD && dbt<0) {  dps[i].d--;  dbt++;  }  if(dbt!=0) console.log(\"debt left\");\r\n}\r\n\r\nUZIP.F._goodIndex = function(v, arr) {\r\n\tvar i=0;  if(arr[i|16]<=v) i|=16;  if(arr[i|8]<=v) i|=8;  if(arr[i|4]<=v) i|=4;  if(arr[i|2]<=v) i|=2;  if(arr[i|1]<=v) i|=1;  return i;\r\n}\r\nUZIP.F._writeLit = function(ch, ltree, out, pos) {\r\n\tUZIP.F._putsF(out, pos, ltree[ch<<1]);\r\n\treturn pos+ltree[(ch<<1)+1];\r\n}\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nUZIP.F.inflate = function(data, buf) {\r\n\tvar u8=Uint8Array;\r\n\tif(data[0]==3 && data[1]==0) return (buf ? buf : new u8(0));\r\n\tvar F=UZIP.F, bitsF = F._bitsF, bitsE = F._bitsE, decodeTiny = F._decodeTiny, makeCodes = F.makeCodes, codes2map=F.codes2map, get17 = F._get17;\r\n\tvar U = F.U;\r\n\t\r\n\tvar noBuf = (buf==null);\r\n\tif(noBuf) buf = new u8((data.length>>>2)<<3);\r\n\t\r\n\tvar BFINAL=0, BTYPE=0, HLIT=0, HDIST=0, HCLEN=0, ML=0, MD=0; \t\r\n\tvar off = 0, pos = 0;\r\n\tvar lmap, dmap;\r\n\t\r\n\twhile(BFINAL==0) {\t\t\r\n\t\tBFINAL = bitsF(data, pos  , 1);\r\n\t\tBTYPE  = bitsF(data, pos+1, 2);  pos+=3;\r\n\t\t//console.log(BFINAL, BTYPE);\r\n\t\t\r\n\t\tif(BTYPE==0) {\r\n\t\t\tif((pos&7)!=0) pos+=8-(pos&7);\r\n\t\t\tvar p8 = (pos>>>3)+4, len = data[p8-4]|(data[p8-3]<<8);  //console.log(len);//bitsF(data, pos, 16), \r\n\t\t\tif(noBuf) buf=UZIP.F._check(buf, off+len);\r\n\t\t\tbuf.set(new u8(data.buffer, data.byteOffset+p8, len), off);\r\n\t\t\t//for(var i=0; i<len; i++) buf[off+i] = data[p8+i];\r\n\t\t\t//for(var i=0; i<len; i++) if(buf[off+i] != data[p8+i]) throw \"e\";\r\n\t\t\tpos = ((p8+len)<<3);  off+=len;  continue;\r\n\t\t}\r\n\t\tif(noBuf) buf=UZIP.F._check(buf, off+(1<<17));  // really not enough in many cases (but PNG and ZIP provide buffer in advance)\r\n\t\tif(BTYPE==1) {  lmap = U.flmap;  dmap = U.fdmap;  ML = (1<<9)-1;  MD = (1<<5)-1;   }\r\n\t\tif(BTYPE==2) {\r\n\t\t\tHLIT  = bitsE(data, pos   , 5)+257;  \r\n\t\t\tHDIST = bitsE(data, pos+ 5, 5)+  1;  \r\n\t\t\tHCLEN = bitsE(data, pos+10, 4)+  4;  pos+=14;\r\n\t\t\t\r\n\t\t\tvar ppos = pos;\r\n\t\t\tfor(var i=0; i<38; i+=2) {  U.itree[i]=0;  U.itree[i+1]=0;  }\r\n\t\t\tvar tl = 1;\r\n\t\t\tfor(var i=0; i<HCLEN; i++) {  var l=bitsE(data, pos+i*3, 3);  U.itree[(U.ordr[i]<<1)+1] = l;  if(l>tl)tl=l;  }     pos+=3*HCLEN;  //console.log(itree);\r\n\t\t\tmakeCodes(U.itree, tl);\r\n\t\t\tcodes2map(U.itree, tl, U.imap);\r\n\t\t\t\r\n\t\t\tlmap = U.lmap;  dmap = U.dmap;\r\n\t\t\t\r\n\t\t\tpos = decodeTiny(U.imap, (1<<tl)-1, HLIT+HDIST, data, pos, U.ttree);\r\n\t\t\tvar mx0 = F._copyOut(U.ttree,    0, HLIT , U.ltree);  ML = (1<<mx0)-1;\r\n\t\t\tvar mx1 = F._copyOut(U.ttree, HLIT, HDIST, U.dtree);  MD = (1<<mx1)-1;\r\n\t\t\t\r\n\t\t\t//var ml = decodeTiny(U.imap, (1<<tl)-1, HLIT , data, pos, U.ltree); ML = (1<<(ml>>>24))-1;  pos+=(ml&0xffffff);\r\n\t\t\tmakeCodes(U.ltree, mx0);\r\n\t\t\tcodes2map(U.ltree, mx0, lmap);\r\n\t\t\t\r\n\t\t\t//var md = decodeTiny(U.imap, (1<<tl)-1, HDIST, data, pos, U.dtree); MD = (1<<(md>>>24))-1;  pos+=(md&0xffffff);\r\n\t\t\tmakeCodes(U.dtree, mx1);\r\n\t\t\tcodes2map(U.dtree, mx1, dmap);\r\n\t\t}\r\n\t\t//var ooff=off, opos=pos;\r\n\t\twhile(true) {\r\n\t\t\tvar code = lmap[get17(data, pos) & ML];  pos += code&15;\r\n\t\t\tvar lit = code>>>4;  //U.lhst[lit]++;  \r\n\t\t\tif((lit>>>8)==0) {  buf[off++] = lit;  }\r\n\t\t\telse if(lit==256) {  break;  }\r\n\t\t\telse {\r\n\t\t\t\tvar end = off+lit-254;\r\n\t\t\t\tif(lit>264) { var ebs = U.ldef[lit-257];  end = off + (ebs>>>3) + bitsE(data, pos, ebs&7);  pos += ebs&7;  }\r\n\t\t\t\t//UZIP.F.dst[end-off]++;\r\n\t\t\t\t\r\n\t\t\t\tvar dcode = dmap[get17(data, pos) & MD];  pos += dcode&15;\r\n\t\t\t\tvar dlit = dcode>>>4;\r\n\t\t\t\tvar dbs = U.ddef[dlit], dst = (dbs>>>4) + bitsF(data, pos, dbs&15);  pos += dbs&15;\r\n\t\t\t\t\r\n\t\t\t\t//var o0 = off-dst, stp = Math.min(end-off, dst);\r\n\t\t\t\t//if(stp>20) while(off<end) {  buf.copyWithin(off, o0, o0+stp);  off+=stp;  }  else\r\n\t\t\t\t//if(end-dst<=off) buf.copyWithin(off, off-dst, end-dst);  else\r\n\t\t\t\t//if(dst==1) buf.fill(buf[off-1], off, end);  else\r\n\t\t\t\tif(noBuf) buf=UZIP.F._check(buf, off+(1<<17));\r\n\t\t\t\twhile(off<end) {  buf[off]=buf[off++-dst];    buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  }   \r\n\t\t\t\toff=end;\r\n\t\t\t\t//while(off!=end) {  buf[off]=buf[off++-dst];  }\r\n\t\t\t}\r\n\t\t}\r\n\t\t//console.log(off-ooff, (pos-opos)>>>3);\r\n\t}\r\n\t//console.log(UZIP.F.dst);\r\n\t//console.log(tlen, dlen, off-tlen+tcnt);\r\n\treturn buf.length==off ? buf : buf.slice(0,off);\r\n}\r\nUZIP.F._check=function(buf, len) {\r\n\tvar bl=buf.length;  if(len<=bl) return buf;\r\n\tvar nbuf = new Uint8Array(Math.max(bl<<1,len));  nbuf.set(buf,0);\r\n\t//for(var i=0; i<bl; i+=4) {  nbuf[i]=buf[i];  nbuf[i+1]=buf[i+1];  nbuf[i+2]=buf[i+2];  nbuf[i+3]=buf[i+3];  }\r\n\treturn nbuf;\r\n}\r\n\r\nUZIP.F._decodeTiny = function(lmap, LL, len, data, pos, tree) {\r\n\tvar bitsE = UZIP.F._bitsE, get17 = UZIP.F._get17;\r\n\tvar i = 0;\r\n\twhile(i<len) {\r\n\t\tvar code = lmap[get17(data, pos)&LL];  pos+=code&15;\r\n\t\tvar lit = code>>>4; \r\n\t\tif(lit<=15) {  tree[i]=lit;  i++;  }\r\n\t\telse {\r\n\t\t\tvar ll = 0, n = 0;\r\n\t\t\tif(lit==16) {\r\n\t\t\t\tn = (3  + bitsE(data, pos, 2));  pos += 2;  ll = tree[i-1];\r\n\t\t\t}\r\n\t\t\telse if(lit==17) {\r\n\t\t\t\tn = (3  + bitsE(data, pos, 3));  pos += 3;\r\n\t\t\t}\r\n\t\t\telse if(lit==18) {\r\n\t\t\t\tn = (11 + bitsE(data, pos, 7));  pos += 7;\r\n\t\t\t}\r\n\t\t\tvar ni = i+n;\r\n\t\t\twhile(i<ni) {  tree[i]=ll;  i++; }\r\n\t\t}\r\n\t}\r\n\treturn pos;\r\n}\r\nUZIP.F._copyOut = function(src, off, len, tree) {\r\n\tvar mx=0, i=0, tl=tree.length>>>1;\r\n\twhile(i<len) {  var v=src[i+off];  tree[(i<<1)]=0;  tree[(i<<1)+1]=v;  if(v>mx)mx=v;  i++;  }\r\n\twhile(i<tl ) {  tree[(i<<1)]=0;  tree[(i<<1)+1]=0;  i++;  }\r\n\treturn mx;\r\n}\r\n\r\nUZIP.F.makeCodes = function(tree, MAX_BITS) {  // code, length\r\n\tvar U = UZIP.F.U;\r\n\tvar max_code = tree.length;\r\n\tvar code, bits, n, i, len;\r\n\t\r\n\tvar bl_count = U.bl_count;  for(var i=0; i<=MAX_BITS; i++) bl_count[i]=0;\r\n\tfor(i=1; i<max_code; i+=2) bl_count[tree[i]]++;\r\n\t\r\n\tvar next_code = U.next_code;\t// smallest code for each length\r\n\t\r\n\tcode = 0;\r\n\tbl_count[0] = 0;\r\n\tfor (bits = 1; bits <= MAX_BITS; bits++) {\r\n\t\tcode = (code + bl_count[bits-1]) << 1;\r\n\t\tnext_code[bits] = code;\r\n\t}\r\n\t\r\n\tfor (n = 0; n < max_code; n+=2) {\r\n\t\tlen = tree[n+1];\r\n\t\tif (len != 0) {\r\n\t\t\ttree[n] = next_code[len];\r\n\t\t\tnext_code[len]++;\r\n\t\t}\r\n\t}\r\n}\r\nUZIP.F.codes2map = function(tree, MAX_BITS, map) {\r\n\tvar max_code = tree.length;\r\n\tvar U=UZIP.F.U, r15 = U.rev15;\r\n\tfor(var i=0; i<max_code; i+=2) if(tree[i+1]!=0)  {\r\n\t\tvar lit = i>>1;\r\n\t\tvar cl = tree[i+1], val = (lit<<4)|cl; // :  (0x8000 | (U.of0[lit-257]<<7) | (U.exb[lit-257]<<4) | cl);\r\n\t\tvar rest = (MAX_BITS-cl), i0 = tree[i]<<rest, i1 = i0 + (1<<rest);\r\n\t\t//tree[i]=r15[i0]>>>(15-MAX_BITS);\r\n\t\twhile(i0!=i1) {\r\n\t\t\tvar p0 = r15[i0]>>>(15-MAX_BITS);\r\n\t\t\tmap[p0]=val;  i0++;\r\n\t\t}\r\n\t}\r\n}\r\nUZIP.F.revCodes = function(tree, MAX_BITS) {\r\n\tvar r15 = UZIP.F.U.rev15, imb = 15-MAX_BITS;\r\n\tfor(var i=0; i<tree.length; i+=2) {  var i0 = (tree[i]<<(MAX_BITS-tree[i+1]));  tree[i] = r15[i0]>>>imb;  }\r\n}\r\n\r\n// used only in deflate\r\nUZIP.F._putsE= function(dt, pos, val   ) {  val = val<<(pos&7);  var o=(pos>>>3);  dt[o]|=val;  dt[o+1]|=(val>>>8);                        }\r\nUZIP.F._putsF= function(dt, pos, val   ) {  val = val<<(pos&7);  var o=(pos>>>3);  dt[o]|=val;  dt[o+1]|=(val>>>8);  dt[o+2]|=(val>>>16);  }\r\n\r\nUZIP.F._bitsE= function(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8)                        )>>>(pos&7))&((1<<length)-1);  }\r\nUZIP.F._bitsF= function(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16))>>>(pos&7))&((1<<length)-1);  }\r\n/*\r\nUZIP.F._get9 = function(dt, pos) {\r\n\treturn ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8))>>>(pos&7))&511;\r\n} */\r\nUZIP.F._get17= function(dt, pos) {\t// return at least 17 meaningful bytes\r\n\treturn (dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16) )>>>(pos&7);\r\n}\r\nUZIP.F._get25= function(dt, pos) {\t// return at least 17 meaningful bytes\r\n\treturn (dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16) | (dt[(pos>>>3)+3]<<24) )>>>(pos&7);\r\n}\r\nUZIP.F.U = function(){\r\n\tvar u16=Uint16Array, u32=Uint32Array;\r\n\treturn {\r\n\t\tnext_code : new u16(16),\r\n\t\tbl_count  : new u16(16),\r\n\t\tordr : [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ],\r\n\t\tof0  : [3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,999,999,999],\r\n\t\texb  : [0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4,  4,  5,  5,  5,  5,  0,  0,  0,  0],\r\n\t\tldef : new u16(32),\r\n\t\tdf0  : [1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577, 65535, 65535],\r\n\t\tdxb  : [0,0,0,0,1,1,2, 2, 3, 3, 4, 4, 5, 5,  6,  6,  7,  7,  8,  8,   9,   9,  10,  10,  11,  11,  12,   12,   13,   13,     0,     0],\r\n\t\tddef : new u32(32),\r\n\t\tflmap: new u16(  512),  fltree: [],\r\n\t\tfdmap: new u16(   32),  fdtree: [],\r\n\t\tlmap : new u16(32768),  ltree : [],  ttree:[],\r\n\t\tdmap : new u16(32768),  dtree : [],\r\n\t\timap : new u16(  512),  itree : [],\r\n\t\t//rev9 : new u16(  512)\r\n\t\trev15: new u16(1<<15),\r\n\t\tlhst : new u32(286), dhst : new u32( 30), ihst : new u32(19),\r\n\t\tlits : new u32(15000),\r\n\t\tstrt : new u16(1<<16),\r\n\t\tprev : new u16(1<<15)\r\n\t};  \r\n} ();\r\n\r\n(function(){\t\r\n\tvar U = UZIP.F.U;\r\n\tvar len = 1<<15;\r\n\tfor(var i=0; i<len; i++) {\r\n\t\tvar x = i;\r\n\t\tx = (((x & 0xaaaaaaaa) >>> 1) | ((x & 0x55555555) << 1));\r\n\t\tx = (((x & 0xcccccccc) >>> 2) | ((x & 0x33333333) << 2));\r\n\t\tx = (((x & 0xf0f0f0f0) >>> 4) | ((x & 0x0f0f0f0f) << 4));\r\n\t\tx = (((x & 0xff00ff00) >>> 8) | ((x & 0x00ff00ff) << 8));\r\n\t\tU.rev15[i] = (((x >>> 16) | (x << 16)))>>>17;\r\n\t}\r\n\t\r\n\tfunction pushV(tgt, n, sv) {  while(n--!=0) tgt.push(0,sv);  }\r\n\t\r\n\tfor(var i=0; i<32; i++) {  U.ldef[i]=(U.of0[i]<<3)|U.exb[i];  U.ddef[i]=(U.df0[i]<<4)|U.dxb[i];  }\r\n\t\r\n\tpushV(U.fltree, 144, 8);  pushV(U.fltree, 255-143, 9);  pushV(U.fltree, 279-255, 7);  pushV(U.fltree,287-279,8);\r\n\t/*\r\n\tvar i = 0;\r\n\tfor(; i<=143; i++) U.fltree.push(0,8);\r\n\tfor(; i<=255; i++) U.fltree.push(0,9);\r\n\tfor(; i<=279; i++) U.fltree.push(0,7);\r\n\tfor(; i<=287; i++) U.fltree.push(0,8);\r\n\t*/\r\n\tUZIP.F.makeCodes(U.fltree, 9);\r\n\tUZIP.F.codes2map(U.fltree, 9, U.flmap);\r\n\tUZIP.F.revCodes (U.fltree, 9)\r\n\t\r\n\tpushV(U.fdtree,32,5);\r\n\t//for(i=0;i<32; i++) U.fdtree.push(0,5);\r\n\tUZIP.F.makeCodes(U.fdtree, 5);\r\n\tUZIP.F.codes2map(U.fdtree, 5, U.fdmap);\r\n\tUZIP.F.revCodes (U.fdtree, 5)\r\n\t\r\n\tpushV(U.itree,19,0);  pushV(U.ltree,286,0);  pushV(U.dtree,30,0);  pushV(U.ttree,320,0);\r\n\t/*\r\n\tfor(var i=0; i< 19; i++) U.itree.push(0,0);\r\n\tfor(var i=0; i<286; i++) U.ltree.push(0,0);\r\n\tfor(var i=0; i< 30; i++) U.dtree.push(0,0);\r\n\tfor(var i=0; i<320; i++) U.ttree.push(0,0);\r\n\t*/\r\n})()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","import UZIP from \"uzip\";\nimport pako from \"pako\";\n\nconst UPNG = {};\n\nUPNG.toRGBA8 = function (out) {\n  const w = out.width;\n  const h = out.height;\n  if (out.tabs.acTL === null)\n    return [UPNG.toRGBA8.decodeImage(out.data, w, h, out).buffer];\n\n  const frms = [];\n  if (out.frames[0].data === null) out.frames[0].data = out.data;\n  const len = w * h * 4;\n  const img = new Uint8Array(len);\n  const empty = new Uint8Array(len);\n  const prev = new Uint8Array(len);\n  for (let i = 0; i < out.frames.length; i++) {\n    const frm = out.frames[i];\n    const fx = frm.rect.x;\n    const fy = frm.rect.y;\n    const fw = frm.rect.width;\n    const fh = frm.rect.height;\n    const fdata = UPNG.toRGBA8.decodeImage(frm.data, fw, fh, out);\n\n    if (i !== 0) for (let j = 0; j < len; j++) prev[j] = img[j];\n\n    if (frm.blend === 0) UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 0);\n    else if (frm.blend === 1)\n      UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 1);\n\n    frms.push(img.buffer.slice(0));\n\n    if (frm.dispose === 1) UPNG._copyTile(empty, fw, fh, img, w, h, fx, fy, 0);\n    else if (frm.dispose === 2) for (let j = 0; j < len; j++) img[j] = prev[j];\n  }\n  return frms;\n};\nUPNG.toRGBA8.decodeImage = function (data, w, h, out) {\n  const area = w * h;\n  const bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8); // bytes per line\n\n  const bf = new Uint8Array(area * 4);\n  const bf32 = new Uint32Array(bf.buffer);\n  const ctype = out.ctype;\n  const depth = out.depth;\n  const rs = UPNG._bin.readUshort;\n\n  if (ctype === 6) {\n    // RGB + alpha\n    const qarea = area << 2;\n    if (depth === 8)\n      for (let i = 0; i < qarea; i += 4) {\n        bf[i] = data[i];\n        bf[i + 1] = data[i + 1];\n        bf[i + 2] = data[i + 2];\n        bf[i + 3] = data[i + 3];\n      }\n    if (depth === 16)\n      for (let i = 0; i < qarea; i++) {\n        bf[i] = data[i << 1];\n      }\n  } else if (ctype === 2) {\n    // RGB\n    const ts = out.tabs.tRNS;\n    if (ts === null) {\n      if (depth === 8)\n        for (let i = 0; i < area; i++) {\n          const ti = i * 3;\n          bf32[i] =\n            (255 << 24) | (data[ti + 2] << 16) | (data[ti + 1] << 8) | data[ti];\n        }\n      if (depth === 16)\n        for (let i = 0; i < area; i++) {\n          const ti = i * 6;\n          bf32[i] =\n            (255 << 24) | (data[ti + 4] << 16) | (data[ti + 2] << 8) | data[ti];\n        }\n    } else {\n      const tr = ts[0];\n      const tg = ts[1];\n      const tb = ts[2];\n      if (depth === 8)\n        for (let i = 0; i < area; i++) {\n          const qi = i << 2;\n          const ti = i * 3;\n          bf32[i] =\n            (255 << 24) | (data[ti + 2] << 16) | (data[ti + 1] << 8) | data[ti];\n          if (data[ti] === tr && data[ti + 1] === tg && data[ti + 2] === tb)\n            bf[qi + 3] = 0;\n        }\n      if (depth === 16)\n        for (let i = 0; i < area; i++) {\n          const qi = i << 2;\n          const ti = i * 6;\n          bf32[i] =\n            (255 << 24) | (data[ti + 4] << 16) | (data[ti + 2] << 8) | data[ti];\n          if (\n            rs(data, ti) === tr &&\n            rs(data, ti + 2) === tg &&\n            rs(data, ti + 4) === tb\n          )\n            bf[qi + 3] = 0;\n        }\n    }\n  } else if (ctype === 3) {\n    // palette\n    const p = out.tabs.PLTE;\n    const ap = out.tabs.tRNS;\n    const tl = ap ? ap.length : 0;\n    if (depth === 1)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 3)] >> (7 - ((i & 7) << 0))) & 1;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 2)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 2)] >> (6 - ((i & 3) << 1))) & 3;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 4)\n      for (let y = 0; y < h; y++) {\n        const s0 = y * bpl;\n        const t0 = y * w;\n        for (let i = 0; i < w; i++) {\n          const qi = (t0 + i) << 2;\n          const j = (data[s0 + (i >> 1)] >> (4 - ((i & 1) << 2))) & 15;\n          const cj = 3 * j;\n          bf[qi] = p[cj];\n          bf[qi + 1] = p[cj + 1];\n          bf[qi + 2] = p[cj + 2];\n          bf[qi + 3] = j < tl ? ap[j] : 255;\n        }\n      }\n    if (depth === 8)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const j = data[i];\n        const cj = 3 * j;\n        bf[qi] = p[cj];\n        bf[qi + 1] = p[cj + 1];\n        bf[qi + 2] = p[cj + 2];\n        bf[qi + 3] = j < tl ? ap[j] : 255;\n      }\n  } else if (ctype === 4) {\n    // gray + alpha\n    if (depth === 8)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const di = i << 1;\n        const gr = data[di];\n        bf[qi] = gr;\n        bf[qi + 1] = gr;\n        bf[qi + 2] = gr;\n        bf[qi + 3] = data[di + 1];\n      }\n    if (depth === 16)\n      for (let i = 0; i < area; i++) {\n        const qi = i << 2;\n        const di = i << 2;\n        const gr = data[di];\n        bf[qi] = gr;\n        bf[qi + 1] = gr;\n        bf[qi + 2] = gr;\n        bf[qi + 3] = data[di + 2];\n      }\n  } else if (ctype === 0) {\n    // gray\n    const tr = out.tabs.tRNS ? out.tabs.tRNS : -1;\n    for (let y = 0; y < h; y++) {\n      const off = y * bpl;\n      const to = y * w;\n      if (depth === 1)\n        for (let x = 0; x < w; x++) {\n          const gr = 255 * ((data[off + (x >>> 3)] >>> (7 - (x & 7))) & 1);\n          const al = gr === tr * 255 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 2)\n        for (let x = 0; x < w; x++) {\n          const gr =\n            85 * ((data[off + (x >>> 2)] >>> (6 - ((x & 3) << 1))) & 3);\n          const al = gr === tr * 85 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 4)\n        for (let x = 0; x < w; x++) {\n          const gr =\n            17 * ((data[off + (x >>> 1)] >>> (4 - ((x & 1) << 2))) & 15);\n          const al = gr === tr * 17 ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 8)\n        for (let x = 0; x < w; x++) {\n          const gr = data[off + x];\n          const al = gr === tr ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n      else if (depth === 16)\n        for (let x = 0; x < w; x++) {\n          const gr = data[off + (x << 1)];\n          const al = rs(data, off + (x << 1)) === tr ? 0 : 255;\n          bf32[to + x] = (al << 24) | (gr << 16) | (gr << 8) | gr;\n        }\n    }\n  }\n  return bf;\n};\n\nUPNG.decode = function (buff) {\n  const data = new Uint8Array(buff);\n  let offset = 8;\n  const bin = UPNG._bin;\n  const rUs = bin.readUshort;\n  const rUi = bin.readUint;\n  const out = { tabs: {}, frames: [] };\n  const dd = new Uint8Array(data.length);\n  let doff = 0; // put all IDAT data into it\n  let fd;\n  let foff = 0; // frames\n\n  const mgck = [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a];\n  for (let i = 0; i < 8; i++)\n    if (data[i] !== mgck[i]) throw \"The input is not a PNG file!\";\n\n  while (offset < data.length) {\n    const len = bin.readUint(data, offset);\n    offset += 4;\n    const type = bin.readASCII(data, offset, 4);\n    offset += 4;\n\n    if (type === \"IHDR\") {\n      UPNG.decode._IHDR(data, offset, out);\n    } else if (type === \"CgBI\") {\n      out.tabs[type] = data.slice(offset, offset + 4);\n    } else if (type === \"IDAT\") {\n      for (let i = 0; i < len; i++) dd[doff + i] = data[offset + i];\n      doff += len;\n    } else if (type === \"acTL\") {\n      out.tabs[type] = {\n        num_frames: rUi(data, offset),\n        num_plays: rUi(data, offset + 4)\n      };\n      fd = new Uint8Array(data.length);\n    } else if (type === \"fcTL\") {\n      if (foff !== 0) {\n        const fr = out.frames[out.frames.length - 1];\n        fr.data = UPNG.decode._decompress(\n          out,\n          fd.slice(0, foff),\n          fr.rect.width,\n          fr.rect.height\n        );\n        foff = 0;\n      }\n      const rct = {\n        x: rUi(data, offset + 12),\n        y: rUi(data, offset + 16),\n        width: rUi(data, offset + 4),\n        height: rUi(data, offset + 8)\n      };\n      let del = rUs(data, offset + 22);\n      del = rUs(data, offset + 20) / (del === 0 ? 100 : del);\n      const frm = {\n        rect: rct,\n        delay: Math.round(del * 1000),\n        dispose: data[offset + 24],\n        blend: data[offset + 25]\n      };\n      out.frames.push(frm);\n    } else if (type === \"fdAT\") {\n      for (let i = 0; i < len - 4; i++) fd[foff + i] = data[offset + i + 4];\n      foff += len - 4;\n    } else if (type === \"pHYs\") {\n      out.tabs[type] = [\n        bin.readUint(data, offset),\n        bin.readUint(data, offset + 4),\n        data[offset + 8]\n      ];\n    } else if (type === \"cHRM\") {\n      out.tabs[type] = [];\n      for (let i = 0; i < 8; i++)\n        out.tabs[type].push(bin.readUint(data, offset + i * 4));\n    } else if (type === \"tEXt\" || type === \"zTXt\") {\n      if (out.tabs[type] === null) out.tabs[type] = {};\n      const nz = bin.nextZero(data, offset);\n      const keyw = bin.readASCII(data, offset, nz - offset);\n      let text;\n      const tl = offset + len - nz - 1;\n      if (type === \"tEXt\") text = bin.readASCII(data, nz + 1, tl);\n      else {\n        const bfr = UPNG.decode._inflate(data.slice(nz + 2, nz + 2 + tl));\n        text = bin.readUTF8(bfr, 0, bfr.length);\n      }\n      out.tabs[type][keyw] = text;\n    } else if (type === \"iTXt\") {\n      if (out.tabs[type] == null) out.tabs[type] = {};\n      let nz = 0;\n      let off = offset;\n      nz = bin.nextZero(data, off);\n      const keyw = bin.readASCII(data, off, nz - off);\n      off = nz + 1;\n      const cflag = data[off];\n      // const cmeth = data[off + 1];\n      off += 2;\n      nz = bin.nextZero(data, off);\n      // const ltag = bin.readASCII(data, off, nz - off);\n      off = nz + 1;\n      nz = bin.nextZero(data, off);\n      // const tkeyw = bin.readUTF8(data, off, nz - off);\n      off = nz + 1;\n      let text;\n      const tl = len - (off - offset);\n      if (cflag === 0) text = bin.readUTF8(data, off, tl);\n      else {\n        const bfr = UPNG.decode._inflate(data.slice(off, off + tl));\n        text = bin.readUTF8(bfr, 0, bfr.length);\n      }\n      out.tabs[type][keyw] = text;\n    } else if (type === \"PLTE\") {\n      out.tabs[type] = bin.readBytes(data, offset, len);\n    } else if (type === \"hIST\") {\n      const pl = out.tabs.PLTE.length / 3;\n      out.tabs[type] = [];\n      for (let i = 0; i < pl; i++)\n        out.tabs[type].push(rUs(data, offset + i * 2));\n    } else if (type === \"tRNS\") {\n      if (out.ctype === 3) out.tabs[type] = bin.readBytes(data, offset, len);\n      else if (out.ctype === 0) out.tabs[type] = rUs(data, offset);\n      else if (out.ctype === 2)\n        out.tabs[type] = [\n          rUs(data, offset),\n          rUs(data, offset + 2),\n          rUs(data, offset + 4)\n        ];\n    } else if (type === \"gAMA\")\n      out.tabs[type] = bin.readUint(data, offset) / 100000;\n    else if (type === \"sRGB\") out.tabs[type] = data[offset];\n    else if (type === \"bKGD\") {\n      if (out.ctype === 0 || out.ctype === 4)\n        out.tabs[type] = [rUs(data, offset)];\n      else if (out.ctype === 2 || out.ctype === 6)\n        out.tabs[type] = [\n          rUs(data, offset),\n          rUs(data, offset + 2),\n          rUs(data, offset + 4)\n        ];\n      else if (out.ctype === 3) out.tabs[type] = data[offset];\n    } else if (type === \"IEND\") {\n      break;\n    }\n    offset += len;\n    // const crc = bin.readUint(data, offset);\n    offset += 4;\n  }\n  if (foff !== 0) {\n    const fr = out.frames[out.frames.length - 1];\n    fr.data = UPNG.decode._decompress(\n      out,\n      fd.slice(0, foff),\n      fr.rect.width,\n      fr.rect.height\n    );\n    foff = 0;\n  }\n  out.data = UPNG.decode._decompress(out, dd, out.width, out.height);\n\n  delete out.compress;\n  delete out.interlace;\n  delete out.filter;\n  return out;\n};\n\nUPNG.decode._decompress = function (out, dd, w, h) {\n  const bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8);\n  const buff = new Uint8Array((bpl + 1 + out.interlace) * h);\n  if (out.tabs.CgBI) dd = UPNG.inflateRaw(dd, buff);\n  else dd = UPNG.decode._inflate(dd, buff);\n\n  if (out.interlace === 0) dd = UPNG.decode._filterZero(dd, out, 0, w, h);\n  else if (out.interlace === 1) dd = UPNG.decode._readInterlace(dd, out);\n  return dd;\n};\n\nUPNG.decode._inflate = function (data, buff) {\n  const out = UPNG.inflateRaw(\n    new Uint8Array(data.buffer, 2, data.length - 6),\n    buff\n  );\n  return out;\n};\nUPNG.inflateRaw = (function () {\n  const H = {};\n  H.H = {};\n  H.H.N = function (N, W) {\n    const R = Uint8Array;\n    let i = 0;\n    let m = 0;\n    let J = 0;\n    let h = 0;\n    let Q = 0;\n    let X = 0;\n    let u = 0;\n    let w = 0;\n    let d = 0;\n    let v;\n    let C;\n    if (N[0] === 3 && N[1] === 0) {\n      return W || new R(0);\n    }\n    const V = H.H;\n    const n = V.b;\n    const A = V.e;\n    const l = V.R;\n    const M = V.n;\n    const I = V.A;\n    const e = V.Z;\n    const b = V.m;\n    const Z = W === null;\n    if (Z) W = new R((N.length >>> 2) << 3);\n    while (i === 0) {\n      i = n(N, d, 1);\n      m = n(N, d + 1, 2);\n      d += 3;\n      if (m === 0) {\n        if ((d & 7) !== 0) d += 8 - (d & 7);\n        const D = (d >>> 3) + 4;\n        const q = N[D - 4] | (N[D - 3] << 8);\n        if (Z) W = H.H.W(W, w + q);\n        W.set(new R(N.buffer, N.byteOffset + D, q), w);\n        d = (D + q) << 3;\n        w += q;\n        continue;\n      }\n      if (Z) W = H.H.W(W, w + (1 << 17));\n      if (m === 1) {\n        v = b.J;\n        C = b.h;\n        X = (1 << 9) - 1;\n        u = (1 << 5) - 1;\n      }\n      if (m === 2) {\n        J = A(N, d, 5) + 257;\n        h = A(N, d + 5, 5) + 1;\n        Q = A(N, d + 10, 4) + 4;\n        d += 14;\n        // const E = d;\n        let j = 1;\n        for (let c = 0; c < 38; c += 2) {\n          b.Q[c] = 0;\n          b.Q[c + 1] = 0;\n        }\n        for (let c = 0; c < Q; c++) {\n          const K = A(N, d + c * 3, 3);\n          b.Q[(b.X[c] << 1) + 1] = K;\n          if (K > j) j = K;\n        }\n        d += 3 * Q;\n        M(b.Q, j);\n        I(b.Q, j, b.u);\n        v = b.w;\n        C = b.d;\n        d = l(b.u, (1 << j) - 1, J + h, N, d, b.v);\n        const r = V.V(b.v, 0, J, b.C);\n        X = (1 << r) - 1;\n        const S = V.V(b.v, J, h, b.D);\n        u = (1 << S) - 1;\n        M(b.C, r);\n        I(b.C, r, v);\n        M(b.D, S);\n        I(b.D, S, C);\n      }\n      // eslint-disable-next-line no-constant-condition\n      while (!0) {\n        const T = v[e(N, d) & X];\n        d += T & 15;\n        const p = T >>> 4;\n        if (p >>> 8 === 0) {\n          W[w++] = p;\n        } else if (p === 256) {\n          break;\n        } else {\n          let z = w + p - 254;\n          if (p > 264) {\n            const _ = b.q[p - 257];\n            z = w + (_ >>> 3) + A(N, d, _ & 7);\n            d += _ & 7;\n          }\n          const $ = C[e(N, d) & u];\n          d += $ & 15;\n          const s = $ >>> 4;\n          const Y = b.c[s];\n          const a = (Y >>> 4) + n(N, d, Y & 15);\n          d += Y & 15;\n          while (w < z) {\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n            W[w] = W[w++ - a];\n          }\n          w = z;\n        }\n      }\n    }\n    return W.length === w ? W : W.slice(0, w);\n  };\n  H.H.W = function (N, W) {\n    const R = N.length;\n    if (W <= R) return N;\n    const V = new Uint8Array(R << 1);\n    V.set(N, 0);\n    return V;\n  };\n  H.H.R = function (N, W, R, V, n, A) {\n    const l = H.H.e;\n    const M = H.H.Z;\n    let I = 0;\n    while (I < R) {\n      const e = N[M(V, n) & W];\n      n += e & 15;\n      const b = e >>> 4;\n      if (b <= 15) {\n        A[I] = b;\n        I++;\n      } else {\n        let Z = 0;\n        let m = 0;\n        if (b === 16) {\n          m = 3 + l(V, n, 2);\n          n += 2;\n          Z = A[I - 1];\n        } else if (b === 17) {\n          m = 3 + l(V, n, 3);\n          n += 3;\n        } else if (b === 18) {\n          m = 11 + l(V, n, 7);\n          n += 7;\n        }\n        const J = I + m;\n        while (I < J) {\n          A[I] = Z;\n          I++;\n        }\n      }\n    }\n    return n;\n  };\n  H.H.V = function (N, W, R, V) {\n    let n = 0;\n    let A = 0;\n    const l = V.length >>> 1;\n    while (A < R) {\n      const M = N[A + W];\n      V[A << 1] = 0;\n      V[(A << 1) + 1] = M;\n      if (M > n) n = M;\n      A++;\n    }\n    while (A < l) {\n      V[A << 1] = 0;\n      V[(A << 1) + 1] = 0;\n      A++;\n    }\n    return n;\n  };\n  H.H.n = function (N, W) {\n    const R = H.H.m;\n    const V = N.length;\n    let n;\n    let A;\n    let l;\n    let M;\n    let I;\n    const e = R.j;\n    for (let M = 0; M <= W; M++) e[M] = 0;\n    for (M = 1; M < V; M += 2) e[N[M]]++;\n    const b = R.K;\n    n = 0;\n    e[0] = 0;\n    for (A = 1; A <= W; A++) {\n      n = (n + e[A - 1]) << 1;\n      b[A] = n;\n    }\n    for (l = 0; l < V; l += 2) {\n      I = N[l + 1];\n      if (I !== 0) {\n        N[l] = b[I];\n        b[I]++;\n      }\n    }\n  };\n  H.H.A = function (N, W, R) {\n    const V = N.length;\n    const n = H.H.m;\n    const A = n.r;\n    for (let l = 0; l < V; l += 2)\n      if (N[l + 1] !== 0) {\n        const M = l >> 1;\n        const I = N[l + 1];\n        const e = (M << 4) | I;\n        const b = W - I;\n        let Z = N[l] << b;\n        const m = Z + (1 << b);\n        while (Z !== m) {\n          const J = A[Z] >>> (15 - W);\n          R[J] = e;\n          Z++;\n        }\n      }\n  };\n  H.H.l = function (N, W) {\n    const R = H.H.m.r;\n    const V = 15 - W;\n    for (let n = 0; n < N.length; n += 2) {\n      const A = N[n] << (W - N[n + 1]);\n      N[n] = R[A] >>> V;\n    }\n  };\n  H.H.M = function (N, W, R) {\n    R = R << (W & 7);\n    const V = W >>> 3;\n    N[V] |= R;\n    N[V + 1] |= R >>> 8;\n  };\n  H.H.I = function (N, W, R) {\n    R = R << (W & 7);\n    const V = W >>> 3;\n    N[V] |= R;\n    N[V + 1] |= R >>> 8;\n    N[V + 2] |= R >>> 16;\n  };\n  H.H.e = function (N, W, R) {\n    return (\n      ((N[W >>> 3] | (N[(W >>> 3) + 1] << 8)) >>> (W & 7)) & ((1 << R) - 1)\n    );\n  };\n  H.H.b = function (N, W, R) {\n    return (\n      ((N[W >>> 3] | (N[(W >>> 3) + 1] << 8) | (N[(W >>> 3) + 2] << 16)) >>>\n        (W & 7)) &\n      ((1 << R) - 1)\n    );\n  };\n  H.H.Z = function (N, W) {\n    return (\n      (N[W >>> 3] | (N[(W >>> 3) + 1] << 8) | (N[(W >>> 3) + 2] << 16)) >>>\n      (W & 7)\n    );\n  };\n  H.H.i = function (N, W) {\n    return (\n      (N[W >>> 3] |\n        (N[(W >>> 3) + 1] << 8) |\n        (N[(W >>> 3) + 2] << 16) |\n        (N[(W >>> 3) + 3] << 24)) >>>\n      (W & 7)\n    );\n  };\n  H.H.m = (function () {\n    const N = Uint16Array;\n    const W = Uint32Array;\n    return {\n      K: new N(16),\n      j: new N(16),\n      X: [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],\n      S: [\n        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59,\n        67, 83, 99, 115, 131, 163, 195, 227, 258, 999, 999, 999\n      ],\n      T: [\n        0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4,\n        5, 5, 5, 5, 0, 0, 0, 0\n      ],\n      q: new N(32),\n      p: [\n        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385,\n        513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577,\n        65535, 65535\n      ],\n      z: [\n        0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10,\n        10, 11, 11, 12, 12, 13, 13, 0, 0\n      ],\n      c: new W(32),\n      J: new N(512),\n      _: [],\n      h: new N(32),\n      $: [],\n      w: new N(32768),\n      C: [],\n      v: [],\n      d: new N(32768),\n      D: [],\n      u: new N(512),\n      Q: [],\n      r: new N(1 << 15),\n      s: new W(286),\n      Y: new W(30),\n      a: new W(19),\n      t: new W(15e3),\n      k: new N(1 << 16),\n      g: new N(1 << 15)\n    };\n  })();\n  (function () {\n    const N = H.H.m;\n    const W = 1 << 15;\n    for (let R = 0; R < W; R++) {\n      let V = R;\n      V = ((V & 2863311530) >>> 1) | ((V & 1431655765) << 1);\n      V = ((V & 3435973836) >>> 2) | ((V & 858993459) << 2);\n      V = ((V & 4042322160) >>> 4) | ((V & 252645135) << 4);\n      V = ((V & 4278255360) >>> 8) | ((V & 16711935) << 8);\n      N.r[R] = ((V >>> 16) | (V << 16)) >>> 17;\n    }\n    function n(A, l, M) {\n      while (l-- !== 0) A.push(0, M);\n    }\n    for (let R = 0; R < 32; R++) {\n      N.q[R] = (N.S[R] << 3) | N.T[R];\n      N.c[R] = (N.p[R] << 4) | N.z[R];\n    }\n    n(N._, 144, 8);\n    n(N._, 255 - 143, 9);\n    n(N._, 279 - 255, 7);\n    n(N._, 287 - 279, 8);\n    H.H.n(N._, 9);\n    H.H.A(N._, 9, N.J);\n    H.H.l(N._, 9);\n    n(N.$, 32, 5);\n    H.H.n(N.$, 5);\n    H.H.A(N.$, 5, N.h);\n    H.H.l(N.$, 5);\n    n(N.Q, 19, 0);\n    n(N.C, 286, 0);\n    n(N.D, 30, 0);\n    n(N.v, 320, 0);\n  })();\n  return H.H.N;\n})();\n\nUPNG.decode._readInterlace = function (data, out) {\n  const w = out.width;\n  const h = out.height;\n  const bpp = UPNG.decode._getBPP(out);\n  const cbpp = bpp >> 3;\n  const bpl = Math.ceil((w * bpp) / 8);\n  const img = new Uint8Array(h * bpl);\n  let di = 0;\n\n  const starting_row = [0, 0, 4, 0, 2, 0, 1];\n  const starting_col = [0, 4, 0, 2, 0, 1, 0];\n  const row_increment = [8, 8, 8, 4, 4, 2, 2];\n  const col_increment = [8, 8, 4, 4, 2, 2, 1];\n\n  let pass = 0;\n  while (pass < 7) {\n    const ri = row_increment[pass];\n    const ci = col_increment[pass];\n    let sw = 0;\n    let sh = 0;\n    let cr = starting_row[pass];\n    while (cr < h) {\n      cr += ri;\n      sh++;\n    }\n    let cc = starting_col[pass];\n    while (cc < w) {\n      cc += ci;\n      sw++;\n    }\n    const bpll = Math.ceil((sw * bpp) / 8);\n    UPNG.decode._filterZero(data, out, di, sw, sh);\n\n    let y = 0;\n    let row = starting_row[pass];\n    while (row < h) {\n      let col = starting_col[pass];\n      let cdi = (di + y * bpll) << 3;\n\n      while (col < w) {\n        if (bpp === 1) {\n          let val = data[cdi >> 3];\n          val = (val >> (7 - (cdi & 7))) & 1;\n          img[row * bpl + (col >> 3)] |= val << (7 - ((col & 7) << 0));\n        }\n        if (bpp === 2) {\n          let val = data[cdi >> 3];\n          val = (val >> (6 - (cdi & 7))) & 3;\n          img[row * bpl + (col >> 2)] |= val << (6 - ((col & 3) << 1));\n        }\n        if (bpp === 4) {\n          let val = data[cdi >> 3];\n          val = (val >> (4 - (cdi & 7))) & 15;\n          img[row * bpl + (col >> 1)] |= val << (4 - ((col & 1) << 2));\n        }\n        if (bpp >= 8) {\n          const ii = row * bpl + col * cbpp;\n          for (let j = 0; j < cbpp; j++) img[ii + j] = data[(cdi >> 3) + j];\n        }\n        cdi += bpp;\n        col += ci;\n      }\n      y++;\n      row += ri;\n    }\n    if (sw * sh !== 0) di += sh * (1 + bpll);\n    pass = pass + 1;\n  }\n  return img;\n};\n\nUPNG.decode._getBPP = function (out) {\n  const noc = [1, null, 3, 1, 2, null, 4][out.ctype];\n  return noc * out.depth;\n};\n\nUPNG.decode._filterZero = function (data, out, off, w, h) {\n  let bpp = UPNG.decode._getBPP(out);\n  const bpl = Math.ceil((w * bpp) / 8);\n  const paeth = UPNG.decode._paeth;\n  bpp = Math.ceil(bpp / 8);\n\n  let i = 0;\n  let di = 1;\n  let type = data[off];\n  let x = 0;\n\n  if (type > 1) data[off] = [0, 0, 1][type - 2];\n  if (type === 3)\n    for (x = bpp; x < bpl; x++)\n      data[x + 1] = (data[x + 1] + (data[x + 1 - bpp] >>> 1)) & 255;\n\n  for (let y = 0; y < h; y++) {\n    i = off + y * bpl;\n    di = i + y + 1;\n    type = data[di - 1];\n    x = 0;\n\n    if (type === 0) for (; x < bpl; x++) data[i + x] = data[di + x];\n    else if (type === 1) {\n      for (; x < bpp; x++) data[i + x] = data[di + x];\n      for (; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpp];\n    } else if (type === 2) {\n      for (; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpl];\n    } else if (type === 3) {\n      for (; x < bpp; x++)\n        data[i + x] = data[di + x] + (data[i + x - bpl] >>> 1);\n      for (; x < bpl; x++)\n        data[i + x] =\n          data[di + x] + ((data[i + x - bpl] + data[i + x - bpp]) >>> 1);\n    } else {\n      for (; x < bpp; x++)\n        data[i + x] = data[di + x] + paeth(0, data[i + x - bpl], 0);\n      for (; x < bpl; x++)\n        data[i + x] =\n          data[di + x] +\n          paeth(data[i + x - bpp], data[i + x - bpl], data[i + x - bpp - bpl]);\n    }\n  }\n  return data;\n};\n\nUPNG.decode._paeth = function (a, b, c) {\n  const p = a + b - c;\n  const pa = p - a;\n  const pb = p - b;\n  const pc = p - c;\n  if (pa * pa <= pb * pb && pa * pa <= pc * pc) return a;\n  else if (pb * pb <= pc * pc) return b;\n  return c;\n};\n\nUPNG.decode._IHDR = function (data, offset, out) {\n  const bin = UPNG._bin;\n  out.width = bin.readUint(data, offset);\n  offset += 4;\n  out.height = bin.readUint(data, offset);\n  offset += 4;\n  out.depth = data[offset];\n  offset++;\n  out.ctype = data[offset];\n  offset++;\n  out.compress = data[offset];\n  offset++;\n  out.filter = data[offset];\n  offset++;\n  out.interlace = data[offset];\n  offset++;\n};\n\nUPNG._bin = {\n  nextZero: function (data, p) {\n    while (data[p] !== 0) p++;\n    return p;\n  },\n  readUshort: function (buff, p) {\n    return (buff[p] << 8) | buff[p + 1];\n  },\n  writeUshort: function (buff, p, n) {\n    buff[p] = (n >> 8) & 255;\n    buff[p + 1] = n & 255;\n  },\n  readUint: function (buff, p) {\n    return (\n      buff[p] * (256 * 256 * 256) +\n      ((buff[p + 1] << 16) | (buff[p + 2] << 8) | buff[p + 3])\n    );\n  },\n  writeUint: function (buff, p, n) {\n    buff[p] = (n >> 24) & 255;\n    buff[p + 1] = (n >> 16) & 255;\n    buff[p + 2] = (n >> 8) & 255;\n    buff[p + 3] = n & 255;\n  },\n  readASCII: function (buff, p, l) {\n    let s = \"\";\n    for (let i = 0; i < l; i++) s += String.fromCharCode(buff[p + i]);\n    return s;\n  },\n  writeASCII: function (data, p, s) {\n    for (let i = 0; i < s.length; i++) data[p + i] = s.charCodeAt(i);\n  },\n  readBytes: function (buff, p, l) {\n    const arr = [];\n    for (let i = 0; i < l; i++) arr.push(buff[p + i]);\n    return arr;\n  },\n  pad: function (n) {\n    return n.length < 2 ? \"0\" + n : n;\n  },\n  readUTF8: function (buff, p, l) {\n    let s = \"\";\n    let ns;\n    for (let i = 0; i < l; i++)\n      s += \"%\" + UPNG._bin.pad(buff[p + i].toString(16));\n    try {\n      ns = decodeURIComponent(s);\n    } catch (e) {\n      return UPNG._bin.readASCII(buff, p, l);\n    }\n    return ns;\n  }\n};\nUPNG._copyTile = function (sb, sw, sh, tb, tw, th, xoff, yoff, mode) {\n  const w = Math.min(sw, tw);\n  const h = Math.min(sh, th);\n  let si = 0;\n  let ti = 0;\n  for (let y = 0; y < h; y++)\n    for (let x = 0; x < w; x++) {\n      if (xoff >= 0 && yoff >= 0) {\n        si = (y * sw + x) << 2;\n        ti = ((yoff + y) * tw + xoff + x) << 2;\n      } else {\n        si = ((-yoff + y) * sw - xoff + x) << 2;\n        ti = (y * tw + x) << 2;\n      }\n\n      if (mode === 0) {\n        tb[ti] = sb[si];\n        tb[ti + 1] = sb[si + 1];\n        tb[ti + 2] = sb[si + 2];\n        tb[ti + 3] = sb[si + 3];\n      } else if (mode === 1) {\n        const fa = sb[si + 3] * (1 / 255);\n        const fr = sb[si] * fa;\n        const fg = sb[si + 1] * fa;\n        const fb = sb[si + 2] * fa;\n        const ba = tb[ti + 3] * (1 / 255);\n        const br = tb[ti] * ba;\n        const bg = tb[ti + 1] * ba;\n        const bb = tb[ti + 2] * ba;\n\n        const ifa = 1 - fa;\n        const oa = fa + ba * ifa;\n        const ioa = oa === 0 ? 0 : 1 / oa;\n        tb[ti + 3] = 255 * oa;\n        tb[ti + 0] = (fr + br * ifa) * ioa;\n        tb[ti + 1] = (fg + bg * ifa) * ioa;\n        tb[ti + 2] = (fb + bb * ifa) * ioa;\n      } else if (mode === 2) {\n        // copy only differences, otherwise zero\n        const fa = sb[si + 3];\n        const fr = sb[si];\n        const fg = sb[si + 1];\n        const fb = sb[si + 2];\n        const ba = tb[ti + 3];\n        const br = tb[ti];\n        const bg = tb[ti + 1];\n        const bb = tb[ti + 2];\n        if (fa === ba && fr === br && fg === bg && fb === bb) {\n          tb[ti] = 0;\n          tb[ti + 1] = 0;\n          tb[ti + 2] = 0;\n          tb[ti + 3] = 0;\n        } else {\n          tb[ti] = fr;\n          tb[ti + 1] = fg;\n          tb[ti + 2] = fb;\n          tb[ti + 3] = fa;\n        }\n      } else if (mode === 3) {\n        // check if can be blended\n        const fa = sb[si + 3];\n        const fr = sb[si];\n        const fg = sb[si + 1];\n        const fb = sb[si + 2];\n        const ba = tb[ti + 3];\n        const br = tb[ti];\n        const bg = tb[ti + 1];\n        const bb = tb[ti + 2];\n        if (fa === ba && fr === br && fg === bg && fb === bb) continue;\n        if (fa < 220 && ba > 20) return false;\n      }\n    }\n  return true;\n};\n\nUPNG.encode = function (bufs, w, h, ps, dels, tabs, forbidPlte) {\n  if (ps === null) ps = 0;\n  if (forbidPlte === null) forbidPlte = false;\n\n  const nimg = UPNG.encode.compress(bufs, w, h, ps, [\n    false,\n    false,\n    false,\n    0,\n    forbidPlte\n  ]);\n  UPNG.encode.compressPNG(nimg, -1);\n\n  return UPNG.encode._main(nimg, w, h, dels, tabs);\n};\n\nUPNG.encodeLL = function (bufs, w, h, cc, ac, depth, dels, tabs) {\n  const nimg = {\n    ctype: 0 + (cc === 1 ? 0 : 2) + (ac === 0 ? 0 : 4),\n    depth,\n    frames: []\n  };\n\n  const bipp = (cc + ac) * depth;\n  const bipl = bipp * w;\n  for (let i = 0; i < bufs.length; i++)\n    nimg.frames.push({\n      rect: { x: 0, y: 0, width: w, height: h },\n      img: new Uint8Array(bufs[i]),\n      blend: 0,\n      dispose: 1,\n      bpp: Math.ceil(bipp / 8),\n      bpl: Math.ceil(bipl / 8)\n    });\n\n  UPNG.encode.compressPNG(nimg, 0, true);\n\n  const out = UPNG.encode._main(nimg, w, h, dels, tabs);\n  return out;\n};\n\nUPNG.encode._main = function (nimg, w, h, dels, tabs) {\n  if (!tabs) tabs = {};\n  const crc = UPNG.crc.crc;\n  const wUi = UPNG._bin.writeUint;\n  const wUs = UPNG._bin.writeUshort;\n  const wAs = UPNG._bin.writeASCII;\n  let offset = 8;\n  const anim = nimg.frames.length > 1;\n  let pltAlpha = false;\n\n  let leng = 8 + (16 + 5 + 4) + (anim ? 20 : 0);\n  if (tabs.sRGB !== null && tabs.sRGB !== undefined) leng += 8 + 1 + 4;\n  if (tabs.pHYs !== null && tabs.pHYs !== undefined) leng += 8 + 9 + 4;\n  if (nimg.ctype === 3) {\n    const dl = nimg.plte.length;\n    for (let i = 0; i < dl; i++)\n      if (nimg.plte[i] >>> 24 !== 255) pltAlpha = true;\n    leng += 8 + dl * 3 + 4 + (pltAlpha ? 8 + dl * 1 + 4 : 0);\n  }\n  for (let j = 0; j < nimg.frames.length; j++) {\n    const fr = nimg.frames[j];\n    if (anim) leng += 38;\n    leng += fr.cimg.length + 12;\n    if (j !== 0) leng += 4;\n  }\n  leng += 12;\n\n  const data = new Uint8Array(leng);\n  const wr = [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a];\n  for (let i = 0; i < 8; i++) data[i] = wr[i];\n\n  wUi(data, offset, 13);\n  offset += 4;\n  wAs(data, offset, \"IHDR\");\n  offset += 4;\n  wUi(data, offset, w);\n  offset += 4;\n  wUi(data, offset, h);\n  offset += 4;\n  data[offset] = nimg.depth;\n  offset++; // depth\n  data[offset] = nimg.ctype;\n  offset++; // ctype\n  data[offset] = 0;\n  offset++; // compress\n  data[offset] = 0;\n  offset++; // filter\n  data[offset] = 0;\n  offset++; // interlace\n  wUi(data, offset, crc(data, offset - 17, 17));\n  offset += 4; // crc\n\n  // 13 bytes to say, that it is sRGB\n  if (tabs.sRGB !== null && tabs.sRGB !== undefined) {\n    wUi(data, offset, 1);\n    offset += 4;\n    wAs(data, offset, \"sRGB\");\n    offset += 4;\n    data[offset] = tabs.sRGB;\n    offset++;\n    wUi(data, offset, crc(data, offset - 5, 5));\n    offset += 4; // crc\n  }\n  if (tabs.pHYs !== null && tabs.pHYs !== undefined) {\n    wUi(data, offset, 9);\n    offset += 4;\n    wAs(data, offset, \"pHYs\");\n    offset += 4;\n    wUi(data, offset, tabs.pHYs[0]);\n    offset += 4;\n    wUi(data, offset, tabs.pHYs[1]);\n    offset += 4;\n    data[offset] = tabs.pHYs[2];\n    offset++;\n    wUi(data, offset, crc(data, offset - 13, 13));\n    offset += 4; // crc\n  }\n\n  if (anim) {\n    wUi(data, offset, 8);\n    offset += 4;\n    wAs(data, offset, \"acTL\");\n    offset += 4;\n    wUi(data, offset, nimg.frames.length);\n    offset += 4;\n    wUi(data, offset, tabs.loop != null ? tabs.loop : 0);\n    offset += 4;\n    wUi(data, offset, crc(data, offset - 12, 12));\n    offset += 4; // crc\n  }\n\n  if (nimg.ctype === 3) {\n    const dl = nimg.plte.length;\n    wUi(data, offset, dl * 3);\n    offset += 4;\n    wAs(data, offset, \"PLTE\");\n    offset += 4;\n    for (let i = 0; i < dl; i++) {\n      const ti = i * 3;\n      const c = nimg.plte[i];\n      const r = c & 255;\n      const g = (c >>> 8) & 255;\n      const b = (c >>> 16) & 255;\n      data[offset + ti + 0] = r;\n      data[offset + ti + 1] = g;\n      data[offset + ti + 2] = b;\n    }\n    offset += dl * 3;\n    wUi(data, offset, crc(data, offset - dl * 3 - 4, dl * 3 + 4));\n    offset += 4; // crc\n\n    if (pltAlpha) {\n      wUi(data, offset, dl);\n      offset += 4;\n      wAs(data, offset, \"tRNS\");\n      offset += 4;\n      for (let i = 0; i < dl; i++)\n        data[offset + i] = (nimg.plte[i] >>> 24) & 255;\n      offset += dl;\n      wUi(data, offset, crc(data, offset - dl - 4, dl + 4));\n      offset += 4; // crc\n    }\n  }\n\n  let fi = 0;\n  for (let j = 0; j < nimg.frames.length; j++) {\n    const fr = nimg.frames[j];\n    if (anim) {\n      wUi(data, offset, 26);\n      offset += 4;\n      wAs(data, offset, \"fcTL\");\n      offset += 4;\n      wUi(data, offset, fi++);\n      offset += 4;\n      wUi(data, offset, fr.rect.width);\n      offset += 4;\n      wUi(data, offset, fr.rect.height);\n      offset += 4;\n      wUi(data, offset, fr.rect.x);\n      offset += 4;\n      wUi(data, offset, fr.rect.y);\n      offset += 4;\n      wUs(data, offset, dels[j]);\n      offset += 2;\n      wUs(data, offset, 1000);\n      offset += 2;\n      data[offset] = fr.dispose;\n      offset++; // dispose\n      data[offset] = fr.blend;\n      offset++; // blend\n      wUi(data, offset, crc(data, offset - 30, 30));\n      offset += 4; // crc\n    }\n\n    const imgd = fr.cimg;\n    const dl = imgd.length;\n    wUi(data, offset, dl + (j === 0 ? 0 : 4));\n    offset += 4;\n    const ioff = offset;\n    wAs(data, offset, j === 0 ? \"IDAT\" : \"fdAT\");\n    offset += 4;\n    if (j !== 0) {\n      wUi(data, offset, fi++);\n      offset += 4;\n    }\n    data.set(imgd, offset);\n    offset += dl;\n    wUi(data, offset, crc(data, ioff, offset - ioff));\n    offset += 4; // crc\n  }\n\n  wUi(data, offset, 0);\n  offset += 4;\n  wAs(data, offset, \"IEND\");\n  offset += 4;\n  wUi(data, offset, crc(data, offset - 4, 4));\n  offset += 4; // crc\n\n  return data.buffer;\n};\n\nUPNG.encode.compressPNG = function (out, filter, levelZero) {\n  for (let i = 0; i < out.frames.length; i++) {\n    const frm = out.frames[i];\n    // const nw = frm.rect.width;\n    const nh = frm.rect.height;\n    const fdata = new Uint8Array(nh * frm.bpl + nh);\n    frm.cimg = UPNG.encode._filterZero(\n      frm.img,\n      nh,\n      frm.bpp,\n      frm.bpl,\n      fdata,\n      filter,\n      levelZero\n    );\n  }\n};\n\nUPNG.encode.compress = function (\n  bufs,\n  w,\n  h,\n  ps,\n  prms // prms:  onlyBlend, minBits, forbidPlte\n) {\n  const onlyBlend = prms[0];\n  const evenCrd = prms[1];\n  const forbidPrev = prms[2];\n  const minBits = prms[3];\n  const forbidPlte = prms[4];\n\n  let ctype = 6;\n  let depth = 8;\n  let alphaAnd = 255;\n\n  for (let j = 0; j < bufs.length; j++) {\n    // when not quantized, other frames can contain colors, that are not in an initial frame\n    const img = new Uint8Array(bufs[j]);\n    const ilen = img.length;\n    for (let i = 0; i < ilen; i += 4) alphaAnd &= img[i + 3];\n  }\n  const gotAlpha = alphaAnd !== 255;\n\n  // brute : frames can only be copied, not \"blended\"\n  const frms = UPNG.encode.framize(bufs, w, h, onlyBlend, evenCrd, forbidPrev);\n\n  const cmap = {};\n  const plte = [];\n  const inds = [];\n\n  if (ps !== 0) {\n    const nbufs = [];\n    for (let i = 0; i < frms.length; i++) nbufs.push(frms[i].img.buffer);\n\n    const abuf = UPNG.encode.concatRGBA(nbufs);\n    const qres = UPNG.quantize(abuf, ps);\n    let cof = 0;\n    const bb = new Uint8Array(qres.abuf);\n    for (let i = 0; i < frms.length; i++) {\n      const ti = frms[i].img;\n      const bln = ti.length;\n      inds.push(new Uint8Array(qres.inds.buffer, cof >> 2, bln >> 2));\n      for (let j = 0; j < bln; j += 4) {\n        ti[j] = bb[cof + j];\n        ti[j + 1] = bb[cof + j + 1];\n        ti[j + 2] = bb[cof + j + 2];\n        ti[j + 3] = bb[cof + j + 3];\n      }\n      cof += bln;\n    }\n\n    for (let i = 0; i < qres.plte.length; i++) plte.push(qres.plte[i].est.rgba);\n  } else {\n    // what if ps==0, but there are <=256 colors?  we still need to detect, if the palette could be used\n    for (let j = 0; j < frms.length; j++) {\n      // when not quantized, other frames can contain colors, that are not in an initial frame\n      const frm = frms[j];\n      const img32 = new Uint32Array(frm.img.buffer);\n      const nw = frm.rect.width;\n      const ilen = img32.length;\n      const ind = new Uint8Array(ilen);\n      inds.push(ind);\n      for (let i = 0; i < ilen; i++) {\n        const c = img32[i];\n        if (i !== 0 && c === img32[i - 1]) ind[i] = ind[i - 1];\n        else if (i > nw && c === img32[i - nw]) ind[i] = ind[i - nw];\n        else {\n          let cmc = cmap[c];\n          if (cmc === null) {\n            cmap[c] = cmc = plte.length;\n            plte.push(c);\n            if (plte.length >= 300) break;\n          }\n          ind[i] = cmc;\n        }\n      }\n    }\n  }\n\n  const cc = plte.length;\n  if (cc <= 256 && forbidPlte === false) {\n    if (cc <= 2) depth = 1;\n    else if (cc <= 4) depth = 2;\n    else if (cc <= 16) depth = 4;\n    else depth = 8;\n    depth = Math.max(depth, minBits);\n  }\n\n  for (let j = 0; j < frms.length; j++) {\n    const frm = frms[j];\n    // const nx = frm.rect.x;\n    // const ny = frm.rect.y;\n    const nw = frm.rect.width;\n    const nh = frm.rect.height;\n    let cimg = frm.img;\n    // const cimg32 = new Uint32Array(cimg.buffer);\n    let bpl = 4 * nw;\n    let bpp = 4;\n    if (cc <= 256 && forbidPlte === false) {\n      bpl = Math.ceil((depth * nw) / 8);\n      const nimg = new Uint8Array(bpl * nh);\n      const inj = inds[j];\n      for (let y = 0; y < nh; y++) {\n        const i = y * bpl;\n        const ii = y * nw;\n        if (depth === 8) for (let x = 0; x < nw; x++) nimg[i + x] = inj[ii + x];\n        else if (depth === 4)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 1)] |= inj[ii + x] << (4 - (x & 1) * 4);\n        else if (depth === 2)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 2)] |= inj[ii + x] << (6 - (x & 3) * 2);\n        else if (depth === 1)\n          for (let x = 0; x < nw; x++)\n            nimg[i + (x >> 3)] |= inj[ii + x] << (7 - (x & 7) * 1);\n      }\n      cimg = nimg;\n      ctype = 3;\n      bpp = 1;\n    } else if (gotAlpha === false && frms.length === 1) {\n      // some next \"reduced\" frames may contain alpha for blending\n      const nimg = new Uint8Array(nw * nh * 3);\n      const area = nw * nh;\n      for (let i = 0; i < area; i++) {\n        const ti = i * 3;\n        const qi = i * 4;\n        nimg[ti] = cimg[qi];\n        nimg[ti + 1] = cimg[qi + 1];\n        nimg[ti + 2] = cimg[qi + 2];\n      }\n      cimg = nimg;\n      ctype = 2;\n      bpp = 3;\n      bpl = 3 * nw;\n    }\n    frm.img = cimg;\n    frm.bpl = bpl;\n    frm.bpp = bpp;\n  }\n\n  return { ctype, depth, plte, frames: frms };\n};\nUPNG.encode.framize = function (bufs, w, h, alwaysBlend, evenCrd, forbidPrev) {\n  /**\n   * DISPOSE\n   * 0 : no change\n   * 1 : clear to transparent\n   * 2 : retstore to content before rendering (previous frame disposed)\n   * BLEND\n   * 0 : replace\n   * 1 : blend\n   */\n  const frms = [];\n  for (let j = 0; j < bufs.length; j++) {\n    const cimg = new Uint8Array(bufs[j]);\n    const cimg32 = new Uint32Array(cimg.buffer);\n    let nimg;\n\n    let nx = 0;\n    let ny = 0;\n    let nw = w;\n    let nh = h;\n    let blend = alwaysBlend ? 1 : 0;\n    if (j !== 0) {\n      const tlim =\n        forbidPrev || alwaysBlend || j === 1 || frms[j - 2].dispose !== 0\n          ? 1\n          : 2;\n      let tstp = 0;\n      let tarea = 1e9;\n      for (let it = 0; it < tlim; it++) {\n        // const pimg = new Uint8Array(bufs[j - 1 - it]);\n        const p32 = new Uint32Array(bufs[j - 1 - it]);\n        let mix = w;\n        let miy = h;\n        let max = -1;\n        let may = -1;\n        for (let y = 0; y < h; y++)\n          for (let x = 0; x < w; x++) {\n            const i = y * w + x;\n            if (cimg32[i] !== p32[i]) {\n              if (x < mix) mix = x;\n              if (x > max) max = x;\n              if (y < miy) miy = y;\n              if (y > may) may = y;\n            }\n          }\n        if (max === -1) mix = miy = max = may = 0;\n        if (evenCrd) {\n          if ((mix & 1) === 1) mix--;\n          if ((miy & 1) === 1) miy--;\n        }\n        const sarea = (max - mix + 1) * (may - miy + 1);\n        if (sarea < tarea) {\n          tarea = sarea;\n          tstp = it;\n          nx = mix;\n          ny = miy;\n          nw = max - mix + 1;\n          nh = may - miy + 1;\n        }\n      }\n\n      // alwaysBlend: pokud zjistím, že blendit nelze, nastavím předchozímu snímku dispose=1. Zajistím, aby obsahoval můj obdélník.\n      const pimg = new Uint8Array(bufs[j - 1 - tstp]);\n      if (tstp === 1) frms[j - 1].dispose = 2;\n\n      nimg = new Uint8Array(nw * nh * 4);\n      UPNG._copyTile(pimg, w, h, nimg, nw, nh, -nx, -ny, 0);\n\n      blend = UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 3) ? 1 : 0;\n      if (blend === 1)\n        UPNG.encode._prepareDiff(cimg, w, h, nimg, {\n          x: nx,\n          y: ny,\n          width: nw,\n          height: nh\n        });\n      else UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 0);\n    } else nimg = cimg.slice(0); // img may be rewritten further ... don't rewrite input\n\n    frms.push({\n      rect: { x: nx, y: ny, width: nw, height: nh },\n      img: nimg,\n      blend,\n      dispose: 0\n    });\n  }\n\n  if (alwaysBlend)\n    for (let j = 0; j < frms.length; j++) {\n      const frm = frms[j];\n      if (frm.blend === 1) continue;\n      const r0 = frm.rect;\n      const r1 = frms[j - 1].rect;\n      const miX = Math.min(r0.x, r1.x);\n      const miY = Math.min(r0.y, r1.y);\n      const maX = Math.max(r0.x + r0.width, r1.x + r1.width);\n      const maY = Math.max(r0.y + r0.height, r1.y + r1.height);\n      const r = { x: miX, y: miY, width: maX - miX, height: maY - miY };\n\n      frms[j - 1].dispose = 1;\n      if (j - 1 !== 0)\n        UPNG.encode._updateFrame(bufs, w, h, frms, j - 1, r, evenCrd);\n      UPNG.encode._updateFrame(bufs, w, h, frms, j, r, evenCrd);\n    }\n  // let area = 0;\n  // if (bufs.length !== 1)\n  //   for (let i = 0; i < frms.length; i++) {\n  //     const frm = frms[i];\n  //     area += frm.rect.width * frm.rect.height;\n  //   }\n\n  return frms;\n};\nUPNG.encode._updateFrame = function (bufs, w, h, frms, i, r, evenCrd) {\n  const U8 = Uint8Array;\n  const U32 = Uint32Array;\n  const pimg = new U8(bufs[i - 1]);\n  const pimg32 = new U32(bufs[i - 1]);\n  const nimg = i + 1 < bufs.length ? new U8(bufs[i + 1]) : null;\n  const cimg = new U8(bufs[i]);\n  const cimg32 = new U32(cimg.buffer);\n\n  let mix = w;\n  let miy = h;\n  let max = -1;\n  let may = -1;\n  for (let y = 0; y < r.height; y++)\n    for (let x = 0; x < r.width; x++) {\n      const cx = r.x + x;\n      const cy = r.y + y;\n      const j = cy * w + cx;\n      const cc = cimg32[j];\n      // no need to draw transparency, or to dispose it. Or, if writing the same color and the next one does not need transparency.\n      if (\n        !(\n          cc === 0 ||\n          (frms[i - 1].dispose === 0 &&\n            pimg32[j] === cc &&\n            (nimg === null || nimg[j * 4 + 3] !== 0))\n        )\n      ) {\n        if (cx < mix) mix = cx;\n        if (cx > max) max = cx;\n        if (cy < miy) miy = cy;\n        if (cy > may) may = cy;\n      }\n    }\n  if (max === -1) mix = miy = max = may = 0;\n  if (evenCrd) {\n    if ((mix & 1) === 1) mix--;\n    if ((miy & 1) === 1) miy--;\n  }\n  r = { x: mix, y: miy, width: max - mix + 1, height: may - miy + 1 };\n\n  const fr = frms[i];\n  fr.rect = r;\n  fr.blend = 1;\n  fr.img = new Uint8Array(r.width * r.height * 4);\n  if (frms[i - 1].dispose === 0) {\n    UPNG._copyTile(pimg, w, h, fr.img, r.width, r.height, -r.x, -r.y, 0);\n    UPNG.encode._prepareDiff(cimg, w, h, fr.img, r);\n  } else UPNG._copyTile(cimg, w, h, fr.img, r.width, r.height, -r.x, -r.y, 0);\n};\nUPNG.encode._prepareDiff = function (cimg, w, h, nimg, rec) {\n  UPNG._copyTile(cimg, w, h, nimg, rec.width, rec.height, -rec.x, -rec.y, 2);\n};\n\nUPNG.encode._filterZero = function (img, h, bpp, bpl, data, filter, levelZero) {\n  const fls = [];\n  let ftry = [0, 1, 2, 3, 4];\n  if (filter !== -1) ftry = [filter];\n  else if (h * bpl > 500000 || bpp === 1) ftry = [0];\n  let opts;\n  if (levelZero) opts = { level: 0 };\n\n  const CMPR = data.length > 10e6 && UZIP != null ? UZIP : pako;\n\n  for (let i = 0; i < ftry.length; i++) {\n    for (let y = 0; y < h; y++)\n      UPNG.encode._filterLine(data, img, y, bpl, bpp, ftry[i]);\n    fls.push(CMPR.deflate(data, opts));\n  }\n\n  let ti;\n  let tsize = 1e9;\n  for (let i = 0; i < fls.length; i++)\n    if (fls[i].length < tsize) {\n      ti = i;\n      tsize = fls[i].length;\n    }\n  return fls[ti];\n};\nUPNG.encode._filterLine = function (data, img, y, bpl, bpp, type) {\n  const i = y * bpl;\n  let di = i + y;\n  const paeth = UPNG.decode._paeth;\n  data[di] = type;\n  di++;\n\n  if (type === 0) {\n    if (bpl < 500) for (let x = 0; x < bpl; x++) data[di + x] = img[i + x];\n    else data.set(new Uint8Array(img.buffer, i, bpl), di);\n  } else if (type === 1) {\n    for (let x = 0; x < bpp; x++) data[di + x] = img[i + x];\n    for (let x = bpp; x < bpl; x++)\n      data[di + x] = (img[i + x] - img[i + x - bpp] + 256) & 255;\n  } else if (y === 0) {\n    for (let x = 0; x < bpp; x++) data[di + x] = img[i + x];\n\n    if (type === 2) for (let x = bpp; x < bpl; x++) data[di + x] = img[i + x];\n    if (type === 3)\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] = (img[i + x] - (img[i + x - bpp] >> 1) + 256) & 255;\n    if (type === 4)\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] = (img[i + x] - paeth(img[i + x - bpp], 0, 0) + 256) & 255;\n  } else {\n    if (type === 2) {\n      for (let x = 0; x < bpl; x++)\n        data[di + x] = (img[i + x] + 256 - img[i + x - bpl]) & 255;\n    }\n    if (type === 3) {\n      for (let x = 0; x < bpp; x++)\n        data[di + x] = (img[i + x] + 256 - (img[i + x - bpl] >> 1)) & 255;\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] =\n          (img[i + x] + 256 - ((img[i + x - bpl] + img[i + x - bpp]) >> 1)) &\n          255;\n    }\n    if (type === 4) {\n      for (let x = 0; x < bpp; x++)\n        data[di + x] = (img[i + x] + 256 - paeth(0, img[i + x - bpl], 0)) & 255;\n      for (let x = bpp; x < bpl; x++)\n        data[di + x] =\n          (img[i + x] +\n            256 -\n            paeth(img[i + x - bpp], img[i + x - bpl], img[i + x - bpp - bpl])) &\n          255;\n    }\n  }\n};\n\nUPNG.crc = {\n  table: (function () {\n    const tab = new Uint32Array(256);\n    for (let n = 0; n < 256; n++) {\n      let c = n;\n      for (let k = 0; k < 8; k++) {\n        if (c & 1) c = 0xedb88320 ^ (c >>> 1);\n        else c = c >>> 1;\n      }\n      tab[n] = c;\n    }\n    return tab;\n  })(),\n  update: function (c, buf, off, len) {\n    for (let i = 0; i < len; i++)\n      c = UPNG.crc.table[(c ^ buf[off + i]) & 0xff] ^ (c >>> 8);\n    return c;\n  },\n  crc: function (b, o, l) {\n    return UPNG.crc.update(0xffffffff, b, o, l) ^ 0xffffffff;\n  }\n};\n\nUPNG.quantize = function (abuf, ps) {\n  const oimg = new Uint8Array(abuf);\n  const nimg = oimg.slice(0);\n  const nimg32 = new Uint32Array(nimg.buffer);\n\n  const KD = UPNG.quantize.getKDtree(nimg, ps);\n  const root = KD[0];\n  const leafs = KD[1];\n\n  const planeDst = UPNG.quantize.planeDst;\n  const sb = oimg;\n  const tb = nimg32;\n  const len = sb.length;\n\n  const inds = new Uint8Array(oimg.length >> 2);\n  let nd;\n  if (oimg.length < 20e6)\n    // precise, but slow :(\n    for (let i = 0; i < len; i += 4) {\n      const r = sb[i] * (1 / 255);\n      const g = sb[i + 1] * (1 / 255);\n      const b = sb[i + 2] * (1 / 255);\n      const a = sb[i + 3] * (1 / 255);\n\n      nd = UPNG.quantize.getNearest(root, r, g, b, a);\n      inds[i >> 2] = nd.ind;\n      tb[i >> 2] = nd.est.rgba;\n    }\n  else\n    for (let i = 0; i < len; i += 4) {\n      const r = sb[i] * (1 / 255);\n      const g = sb[i + 1] * (1 / 255);\n      const b = sb[i + 2] * (1 / 255);\n      const a = sb[i + 3] * (1 / 255);\n\n      nd = root;\n      while (nd.left)\n        nd = planeDst(nd.est, r, g, b, a) <= 0 ? nd.left : nd.right;\n      inds[i >> 2] = nd.ind;\n      tb[i >> 2] = nd.est.rgba;\n    }\n  return { abuf: nimg.buffer, inds, plte: leafs };\n};\n\nUPNG.quantize.getKDtree = function (nimg, ps, err) {\n  if (err === null) err = 0.0001;\n  const nimg32 = new Uint32Array(nimg.buffer);\n\n  const root = {\n    i0: 0,\n    i1: nimg.length,\n    bst: null,\n    est: null,\n    tdst: 0,\n    left: null,\n    right: null\n  }; // basic statistic, extra statistic\n  root.bst = UPNG.quantize.stats(nimg, root.i0, root.i1);\n  root.est = UPNG.quantize.estats(root.bst);\n  const leafs = [root];\n\n  while (leafs.length < ps) {\n    let maxL = 0;\n    let mi = 0;\n    for (let i = 0; i < leafs.length; i++)\n      if (leafs[i].est.L > maxL) {\n        maxL = leafs[i].est.L;\n        mi = i;\n      }\n    if (maxL < err) break;\n    const node = leafs[mi];\n\n    const s0 = UPNG.quantize.splitPixels(\n      nimg,\n      nimg32,\n      node.i0,\n      node.i1,\n      node.est.e,\n      node.est.eMq255\n    );\n    const s0wrong = node.i0 >= s0 || node.i1 <= s0;\n    if (s0wrong) {\n      node.est.L = 0;\n      continue;\n    }\n\n    const ln = {\n      i0: node.i0,\n      i1: s0,\n      bst: null,\n      est: null,\n      tdst: 0,\n      left: null,\n      right: null\n    };\n    ln.bst = UPNG.quantize.stats(nimg, ln.i0, ln.i1);\n    ln.est = UPNG.quantize.estats(ln.bst);\n    const rn = {\n      i0: s0,\n      i1: node.i1,\n      bst: null,\n      est: null,\n      tdst: 0,\n      left: null,\n      right: null\n    };\n    rn.bst = { R: [], m: [], N: node.bst.N - ln.bst.N };\n    for (let i = 0; i < 16; i++) rn.bst.R[i] = node.bst.R[i] - ln.bst.R[i];\n    for (let i = 0; i < 4; i++) rn.bst.m[i] = node.bst.m[i] - ln.bst.m[i];\n    rn.est = UPNG.quantize.estats(rn.bst);\n\n    node.left = ln;\n    node.right = rn;\n    leafs[mi] = ln;\n    leafs.push(rn);\n  }\n  leafs.sort(function (a, b) {\n    return b.bst.N - a.bst.N;\n  });\n  for (let i = 0; i < leafs.length; i++) leafs[i].ind = i;\n  return [root, leafs];\n};\n\nUPNG.quantize.getNearest = function (nd, r, g, b, a) {\n  if (nd.left == null) {\n    nd.tdst = UPNG.quantize.dist(nd.est.q, r, g, b, a);\n    return nd;\n  }\n  const planeDst = UPNG.quantize.planeDst(nd.est, r, g, b, a);\n\n  let node0 = nd.left;\n  let node1 = nd.right;\n  if (planeDst > 0) {\n    node0 = nd.right;\n    node1 = nd.left;\n  }\n\n  const ln = UPNG.quantize.getNearest(node0, r, g, b, a);\n  if (ln.tdst <= planeDst * planeDst) return ln;\n  const rn = UPNG.quantize.getNearest(node1, r, g, b, a);\n  return rn.tdst < ln.tdst ? rn : ln;\n};\nUPNG.quantize.planeDst = function (est, r, g, b, a) {\n  const e = est.e;\n  return e[0] * r + e[1] * g + e[2] * b + e[3] * a - est.eMq;\n};\nUPNG.quantize.dist = function (q, r, g, b, a) {\n  const d0 = r - q[0];\n  const d1 = g - q[1];\n  const d2 = b - q[2];\n  const d3 = a - q[3];\n  return d0 * d0 + d1 * d1 + d2 * d2 + d3 * d3;\n};\n\nUPNG.quantize.splitPixels = function (nimg, nimg32, i0, i1, e, eMq) {\n  const vecDot = UPNG.quantize.vecDot;\n  i1 -= 4;\n  // const shfs = 0;\n  while (i0 < i1) {\n    while (vecDot(nimg, i0, e) <= eMq) i0 += 4;\n    while (vecDot(nimg, i1, e) > eMq) i1 -= 4;\n    if (i0 >= i1) break;\n\n    const t = nimg32[i0 >> 2];\n    nimg32[i0 >> 2] = nimg32[i1 >> 2];\n    nimg32[i1 >> 2] = t;\n\n    i0 += 4;\n    i1 -= 4;\n  }\n  while (vecDot(nimg, i0, e) > eMq) i0 -= 4;\n  return i0 + 4;\n};\nUPNG.quantize.vecDot = function (nimg, i, e) {\n  return (\n    nimg[i] * e[0] +\n    nimg[i + 1] * e[1] +\n    nimg[i + 2] * e[2] +\n    nimg[i + 3] * e[3]\n  );\n};\nUPNG.quantize.stats = function (nimg, i0, i1) {\n  const R = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n  const m = [0, 0, 0, 0];\n  const N = (i1 - i0) >> 2;\n  for (let i = i0; i < i1; i += 4) {\n    const r = nimg[i] * (1 / 255);\n    const g = nimg[i + 1] * (1 / 255);\n    const b = nimg[i + 2] * (1 / 255);\n    const a = nimg[i + 3] * (1 / 255);\n    m[0] += r;\n    m[1] += g;\n    m[2] += b;\n    m[3] += a;\n\n    R[0] += r * r;\n    R[1] += r * g;\n    R[2] += r * b;\n    R[3] += r * a;\n    R[5] += g * g;\n    R[6] += g * b;\n    R[7] += g * a;\n    R[10] += b * b;\n    R[11] += b * a;\n    R[15] += a * a;\n  }\n  R[4] = R[1];\n  R[8] = R[2];\n  R[9] = R[6];\n  R[12] = R[3];\n  R[13] = R[7];\n  R[14] = R[11];\n\n  return { R, m, N };\n};\nUPNG.quantize.estats = function (stats) {\n  const R = stats.R;\n  const m = stats.m;\n  const N = stats.N;\n\n  // when all samples are equal, but N is large (millions), the Rj can be non-zero ( 0.0003.... - precission error)\n  const m0 = m[0];\n  const m1 = m[1];\n  const m2 = m[2];\n  const m3 = m[3];\n  const iN = N === 0 ? 0 : 1 / N;\n  const Rj = [\n    R[0] - m0 * m0 * iN,\n    R[1] - m0 * m1 * iN,\n    R[2] - m0 * m2 * iN,\n    R[3] - m0 * m3 * iN,\n    R[4] - m1 * m0 * iN,\n    R[5] - m1 * m1 * iN,\n    R[6] - m1 * m2 * iN,\n    R[7] - m1 * m3 * iN,\n    R[8] - m2 * m0 * iN,\n    R[9] - m2 * m1 * iN,\n    R[10] - m2 * m2 * iN,\n    R[11] - m2 * m3 * iN,\n    R[12] - m3 * m0 * iN,\n    R[13] - m3 * m1 * iN,\n    R[14] - m3 * m2 * iN,\n    R[15] - m3 * m3 * iN\n  ];\n\n  const A = Rj;\n  const M = UPNG.M4;\n  let b = [Math.random(), Math.random(), Math.random(), Math.random()];\n  let mi = 0;\n  let tmi = 0;\n\n  if (N !== 0)\n    for (let i = 0; i < 16; i++) {\n      b = M.multVec(A, b);\n      tmi = Math.sqrt(M.dot(b, b));\n      b = M.sml(1 / tmi, b);\n      if (i !== 0 && Math.abs(tmi - mi) < 1e-9) break;\n      mi = tmi;\n    }\n  const q = [m0 * iN, m1 * iN, m2 * iN, m3 * iN];\n  const eMq255 = M.dot(M.sml(255, q), b);\n\n  return {\n    Cov: Rj,\n    q,\n    e: b,\n    L: mi,\n    eMq255,\n    eMq: M.dot(b, q),\n    rgba:\n      ((Math.round(255 * q[3]) << 24) |\n        (Math.round(255 * q[2]) << 16) |\n        (Math.round(255 * q[1]) << 8) |\n        (Math.round(255 * q[0]) << 0)) >>>\n      0\n  };\n};\nUPNG.M4 = {\n  multVec: function (m, v) {\n    return [\n      m[0] * v[0] + m[1] * v[1] + m[2] * v[2] + m[3] * v[3],\n      m[4] * v[0] + m[5] * v[1] + m[6] * v[2] + m[7] * v[3],\n      m[8] * v[0] + m[9] * v[1] + m[10] * v[2] + m[11] * v[3],\n      m[12] * v[0] + m[13] * v[1] + m[14] * v[2] + m[15] * v[3]\n    ];\n  },\n  dot: function (x, y) {\n    return x[0] * y[0] + x[1] * y[1] + x[2] * y[2] + x[3] * y[3];\n  },\n  sml: function (a, y) {\n    return [a * y[0], a * y[1], a * y[2], a * y[3]];\n  }\n};\n\nUPNG.encode.concatRGBA = function (bufs) {\n  let tlen = 0;\n  for (let i = 0; i < bufs.length; i++) tlen += bufs[i].byteLength;\n  const nimg = new Uint8Array(tlen);\n  let noff = 0;\n  for (let i = 0; i < bufs.length; i++) {\n    const img = new Uint8Array(bufs[i]);\n    const il = img.length;\n    for (let j = 0; j < il; j += 4) {\n      let r = img[j];\n      let g = img[j + 1];\n      let b = img[j + 2];\n      const a = img[j + 3];\n      if (a === 0) r = g = b = 0;\n      nimg[noff + j] = r;\n      nimg[noff + j + 1] = g;\n      nimg[noff + j + 2] = b;\n      nimg[noff + j + 3] = a;\n    }\n    noff += il;\n  }\n  return nimg.buffer;\n};\n\nexport default UPNG;\n","import { getViewportSize } from \"./position\";\nimport UPNG from \"./UPNG\";\n\nexport interface ImgInfo {\n  name: string;\n  fileType: string;\n  size: number;\n  imgUrl: string;\n  width: number;\n  height: number;\n  imageData: ImageData;\n  blob: Blob;\n}\n\nexport const getRawImgInfo = (\n  imgUrl: string,\n  cb: (err: any, rawInfo: Pick<ImgInfo, \"width\" | \"height\"> | null) => void\n) => {\n  const image = new Image();\n  image.onload = function () {\n    cb(null, { width: image.width, height: image.height });\n  };\n  image.onerror = function (err) {\n    cb(err, null);\n  };\n  image.src = imgUrl;\n};\n\n// 获取解析图片数据\nexport const getImgInfo = (\n  files: FileList,\n  callback: (err: any, imgInfo: ImgInfo | null) => void\n) => {\n  if (!files) {\n    callback(\"no files\", null);\n  }\n  for (let i = 0, l = files.length; i < l; i++) {\n    const file = files[i];\n    const { type } = file;\n    const typeArr = type.split(\"/\");\n    if (typeArr[0] !== \"image\") return;\n    let fileType = typeArr[1].toUpperCase();\n    const reader = new FileReader();\n    reader.onload = function (e: any) {\n      const buffer = e.target.result;\n      const imageType = getImageType(buffer);\n      if (imageType) {\n        fileType = imageType;\n      }\n      const blob = new Blob([buffer]);\n      fileOrBlobToDataURL(blob, function (dataUrl: string | null) {\n        if (dataUrl) {\n          getRawImgInfo(dataUrl, (rawInfo) => {\n            if (rawInfo) {\n              const imageData = getCanvasImgData(\n                dataUrl,\n                rawInfo.width,\n                rawInfo.height\n              );\n              if (imageData) {\n                const imgInfo: ImgInfo = {\n                  name: file.name,\n                  fileType,\n                  size: file.size,\n                  width: rawInfo.width,\n                  height: rawInfo.height,\n                  imgUrl: dataUrl,\n                  imageData,\n                  blob\n                };\n                callback(null, imgInfo);\n              } else {\n                callback(\"no imageData\", null);\n              }\n            } else {\n              callback(\"no image raw info\", null);\n            }\n          });\n        } else {\n          callback(\"no image url\", null);\n        }\n      });\n    };\n    reader.readAsArrayBuffer(file);\n  }\n};\n\n// 根据buffer中的文件头信息判断图片类型\nexport const getImageType = (buffer: ArrayBuffer) => {\n  let fileType = \"\";\n  if (buffer) {\n    const view = new DataView(buffer);\n    const first4Byte = view.getUint32(0, false);\n    const hexValue = Number(first4Byte).toString(16).toUpperCase();\n    switch (hexValue) {\n      case \"FFD8FFDB\":\n        fileType = \"JPG\";\n        break;\n      case \"FFD8FFE0\":\n      case \"FFD8FFE1\":\n      case \"FFD8FFE2\":\n      case \"FFD8FFE3\":\n        fileType = \"JPEG\";\n        break;\n      case \"89504E47\":\n        fileType = \"PNG\";\n        break;\n      case \"47494638\":\n        fileType = \"GIF\";\n        break;\n      case \"52494646\":\n        fileType = \"WEBP\";\n        break;\n      default:\n        break;\n    }\n  }\n  return fileType;\n};\n\n// File或Blob对象转DataURL\nexport const fileOrBlobToDataURL = (\n  obj: File | Blob,\n  cb: (err: any, result: string | null) => void\n) => {\n  if (!obj) {\n    cb(\"no obj\", null);\n    return;\n  }\n  const reader = new FileReader();\n  reader.onload = function (e) {\n    if (e.target) {\n      cb(null, e.target.result as string);\n    } else {\n      cb(\"can't read\", null);\n    }\n  };\n  reader.readAsDataURL(obj);\n};\n\n// 获取图片二进制数据\nexport const getCanvasImgData = (\n  imgUrl: string,\n  width: number,\n  height: number\n) => {\n  if (imgUrl && width && height) {\n    const img = new Image();\n    img.src = imgUrl;\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(img, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\n// 根据video元素获取图片二进制数据\nexport const getCanvasImgDataByVideo = (\n  video: HTMLVideoElement,\n  width = 0,\n  height = 0\n) => {\n  if (video && width && height) {\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(video, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\n// 根据ImageBitmap获取图片二进制数据\nexport const getCanvasImgDataByBitmap = (\n  imageBitmap: ImageBitmap,\n  width = 0,\n  height = 0\n) => {\n  if (imageBitmap && width && height) {\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = width;\n    canvas.height = height;\n    ctx.drawImage(imageBitmap, 0, 0, width, height);\n    const imageData = ctx.getImageData(0, 0, width, height) as ImageData;\n    return imageData;\n  }\n  return null;\n};\n\nexport const imageDataToBitmap = (imageData: ImageData) => {\n  //\n  // BITMAPFILEHEADER: http://msdn.microsoft.com/en-us/library/windows/desktop/dd183374(v=vs.85).aspx\n  // BITMAPINFOHEADER: http://msdn.microsoft.com/en-us/library/dd183376.aspx\n  //\n\n  const biWidth = imageData.width;\n  const biHeight = imageData.height;\n  const biSizeImage = biWidth * biHeight * 3;\n  const bfSize = biSizeImage + 54; // total header size = 54 bytes\n\n  //\n  //  typedef struct tagBITMAPFILEHEADER {\n  //  \tWORD bfType;\n  //  \tDWORD bfSize;\n  //  \tWORD bfReserved1;\n  //  \tWORD bfReserved2;\n  //  \tDWORD bfOffBits;\n  //  } BITMAPFILEHEADER;\n  //\n  const BITMAPFILEHEADER = [\n    // WORD bfType -- The file type signature; must be \"BM\"\n    0x42,\n    0x4d,\n    // DWORD bfSize -- The size, in bytes, of the bitmap file\n    bfSize & 0xff,\n    (bfSize >> 8) & 0xff,\n    (bfSize >> 16) & 0xff,\n    (bfSize >> 24) & 0xff,\n    // WORD bfReserved1 -- Reserved; must be zero\n    0,\n    0,\n    // WORD bfReserved2 -- Reserved; must be zero\n    0,\n    0,\n    // DWORD bfOffBits -- The offset, in bytes, from the beginning of the BITMAPFILEHEADER structure to the bitmap bits.\n    54,\n    0,\n    0,\n    0\n  ];\n\n  //\n  //  typedef struct tagBITMAPINFOHEADER {\n  //  \tDWORD biSize;\n  //  \tLONG  biWidth;\n  //  \tLONG  biHeight;\n  //  \tWORD  biPlanes;\n  //  \tWORD  biBitCount;\n  //  \tDWORD biCompression;\n  //  \tDWORD biSizeImage;\n  //  \tLONG  biXPelsPerMeter;\n  //  \tLONG  biYPelsPerMeter;\n  //  \tDWORD biClrUsed;\n  //  \tDWORD biClrImportant;\n  //  } BITMAPINFOHEADER, *PBITMAPINFOHEADER;\n  //\n  const BITMAPINFOHEADER = [\n    // DWORD biSize -- The number of bytes required by the structure\n    40,\n    0,\n    0,\n    0,\n    // LONG biWidth -- The width of the bitmap, in pixels\n    biWidth & 0xff,\n    (biWidth >> 8) & 0xff,\n    (biWidth >> 16) & 0xff,\n    (biWidth >> 24) & 0xff,\n    // LONG biHeight -- The height of the bitmap, in pixels\n    biHeight & 0xff,\n    (biHeight >> 8) & 0xff,\n    (biHeight >> 16) & 0xff,\n    (biHeight >> 24) & 0xff,\n    // WORD biPlanes -- The number of planes for the target device. This value must be set to 1\n    1,\n    0,\n    // WORD biBitCount -- The number of bits-per-pixel, 24 bits-per-pixel -- the bitmap\n    // has a maximum of 2^24 colors (16777216, Truecolor)\n    24,\n    0,\n    // DWORD biCompression -- The type of compression, BI_RGB (code 0) -- uncompressed\n    0,\n    0,\n    0,\n    0,\n    // DWORD biSizeImage -- The size, in bytes, of the image. This may be set to zero for BI_RGB bitmaps\n    biSizeImage & 0xff,\n    (biSizeImage >> 8) & 0xff,\n    (biSizeImage >> 16) & 0xff,\n    (biSizeImage >> 24) & 0xff,\n    // LONG biXPelsPerMeter, unused\n    0,\n    0,\n    0,\n    0,\n    // LONG biYPelsPerMeter, unused\n    0,\n    0,\n    0,\n    0,\n    // DWORD biClrUsed, the number of color indexes of palette, unused\n    0,\n    0,\n    0,\n    0,\n    // DWORD biClrImportant, unused\n    0,\n    0,\n    0,\n    0\n  ];\n\n  const iPadding = (4 - ((biWidth * 3) % 4)) % 4;\n  const aImgData = imageData.data;\n\n  let strPixelData = \"\";\n  const biWidth4 = biWidth << 2;\n  let y = biHeight;\n  const fromCharCode = String.fromCharCode;\n\n  do {\n    const iOffsetY = biWidth4 * (y - 1);\n    let strPixelRow = \"\";\n    for (let x = 0; x < biWidth; x++) {\n      const iOffsetX = x << 2;\n      strPixelRow +=\n        fromCharCode(aImgData[iOffsetY + iOffsetX + 2]) +\n        fromCharCode(aImgData[iOffsetY + iOffsetX + 1]) +\n        fromCharCode(aImgData[iOffsetY + iOffsetX]);\n    }\n\n    for (let c = 0; c < iPadding; c++) {\n      strPixelRow += String.fromCharCode(0);\n    }\n\n    strPixelData += strPixelRow;\n  } while (--y);\n\n  function encodeData(data: string | any[]) {\n    if (!window.btoa) {\n      throw \"btoa undefined\";\n    }\n    let str = \"\";\n    if (typeof data == \"string\") {\n      str = data;\n    } else {\n      for (let i = 0; i < data.length; i++) {\n        str += String.fromCharCode(data[i]);\n      }\n    }\n    return btoa(str);\n  }\n\n  return (\n    encodeData(BITMAPFILEHEADER.concat(BITMAPINFOHEADER)) +\n    encodeData(strPixelData)\n  );\n};\n\n// ImageData对象转DataURL\nexport const imageDataToDataURL = (imageData: ImageData) => {\n  if (!imageData) {\n    return null;\n  }\n  const { width, height } = imageData;\n  const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  canvas.width = width;\n  canvas.height = height;\n  ctx.putImageData(imageData, 0, 0, 0, 0, width, height);\n  const dataUrl = canvas.toDataURL(\"image/png\");\n  return dataUrl;\n};\n\n// ImageData对象转Blob\nexport const imageDataToBlob = (\n  imageData: ImageData,\n  exportImageType = \"PNG\",\n  cb: (err: any, blob: Blob | null) => void\n) => {\n  if (!imageData) {\n    cb(\"no imageData\", null);\n    return;\n  }\n  const { width, height } = imageData;\n  const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n  const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n  canvas.width = width;\n  canvas.height = height;\n  ctx.putImageData(imageData, 0, 0, 0, 0, width, height);\n  const toImageType = `image/${\n    exportImageType ? exportImageType.toLowerCase() : \"png\"\n  }`;\n  canvas.toBlob(\n    (blob: Blob | null) => {\n      cb(null, blob);\n    },\n    toImageType,\n    1\n  );\n};\n\n// Blob对象转Image\nexport const blobToImage = (blob: Blob, cb: (err: any) => void) => {\n  fileOrBlobToDataURL(blob, function (err, dataUrl: string | null) {\n    if (dataUrl) {\n      const image = new Image();\n      image.src = dataUrl;\n    } else {\n      cb(err);\n    }\n  });\n};\n\n// 导出图片\nexport const blobToExport = (blob: Blob, imgName: string) => {\n  if (!blob) return;\n  const a = document.createElement(\"a\");\n  a.style.visibility = \"hidden\";\n  document.body.appendChild(a);\n  a.download = imgName;\n  const objUrl = window.URL.createObjectURL(blob);\n  a.href = objUrl;\n  a.click();\n  document.body.removeChild(a);\n  window.URL.revokeObjectURL(objUrl);\n};\n\n// 异步加载图片\nexport function loadImage(\n  url: string,\n  cb: (err: any, image: HTMLImageElement | null) => void\n) {\n  const image = new Image();\n  image.onload = function () {\n    cb(null, image);\n  };\n  image.onerror = function () {\n    cb(new Error(\"Could not load image at \" + url), null);\n  };\n  image.src = url;\n}\n\n/**\n * 懒加载图片\n * document.addEventListener(\"scroll\", throttle(lazyloadImages(), 300));\n */\nexport function lazyloadImages() {\n  const imgs = document.getElementsByTagName(\"img\");\n  const viewHeight = getViewportSize().height;\n  let start = 0;\n  return () => {\n    for (let i = start; i < imgs.length; i++) {\n      // 元素露出\n      if (imgs[i].getBoundingClientRect().top < viewHeight) {\n        imgs[i].src = imgs[i].getAttribute(\"data-src\") ?? \"\";\n        start = i + 1;\n      }\n    }\n  };\n}\n\n// 获取传入图片链接的这个图片的主要颜色值 返回表示颜色值的字符串,如rgb(red,green,blue)\nexport function getImageMainColor(\n  imgUrl: string,\n  cb: (err: any, rgb: string | null) => void\n) {\n  getRawImgInfo(imgUrl, (rawInfo) => {\n    if (!rawInfo) return cb(\"no image info\", null);\n    const canvasImageData = getCanvasImgData(\n      imgUrl,\n      rawInfo.width,\n      rawInfo.height\n    );\n    if (!canvasImageData) return cb(\"no canvas image info\", null);\n    const imageData = canvasImageData.data;\n    let j = 0;\n    const arrR = [];\n    const arrG = [];\n    const arrB = [];\n    for (let i = 0; i < imageData.length; i += 4) {\n      arrR[j] = imageData[i];\n      arrG[j] = imageData[i + 1];\n      arrB[j] = imageData[i + 2];\n      j += 1;\n    }\n    const R = _getArryWeightValue(arrR);\n    const G = _getArryWeightValue(arrG);\n    const B = _getArryWeightValue(arrB);\n    return cb(null, \"rgb(\" + R + \",\" + G + \",\" + B + \")\");\n  });\n}\n// 用于获取数组中的最高权重值 返回数组的最高权重值\nfunction _getArryWeightValue(arr: number[]) {\n  const existArr = {} as { [index: number]: number };\n  const duplicationArr = [];\n  const duplicationCount = [];\n  for (let i = 0; i < arr.length; i++) {\n    if (!existArr[arr[i]]) {\n      existArr[arr[i]] = 1;\n    } else {\n      duplicationArr.push(arr[i]);\n    }\n  }\n  let k = 0;\n  for (let i = 0; i < duplicationArr.length; i++) {\n    k = 0;\n    for (let j = 0; j < duplicationArr.length; j++) {\n      if (duplicationArr[i] === duplicationArr[j]) {\n        k += 1;\n      }\n      duplicationCount[i] = k;\n    }\n  }\n  const max = Math.max.apply(null, duplicationCount);\n  let maxIndex = 0;\n  for (; maxIndex < duplicationCount.length; maxIndex++) {\n    if (duplicationCount[maxIndex] === max) {\n      return;\n    }\n  }\n  return duplicationArr[maxIndex];\n}\n\n// 左右翻转\nexport const flipSideToSide = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[(y * width + width - x - 1) * 4];\n        newImgData[startIndex + 1] = data[(y * width + width - x - 1) * 4 + 1];\n        newImgData[startIndex + 2] = data[(y * width + width - x - 1) * 4 + 2];\n        newImgData[startIndex + 3] = data[(y * width + width - x - 1) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 上下翻转\nexport const flipUpsideDown = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[((height - y - 1) * width + x) * 4];\n        newImgData[startIndex + 1] =\n          data[((height - y - 1) * width + x) * 4 + 1];\n        newImgData[startIndex + 2] =\n          data[((height - y - 1) * width + x) * 4 + 2];\n        newImgData[startIndex + 3] =\n          data[((height - y - 1) * width + x) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 左旋转\nexport const leftRotate = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let x = 0; x < width; x++) {\n      for (let y = 0; y < height; y++) {\n        const startIndex = (x * height + y) * 4;\n        newImgData[startIndex] = data[(y * width + width - x - 1) * 4];\n        newImgData[startIndex + 1] = data[(y * width + width - x - 1) * 4 + 1];\n        newImgData[startIndex + 2] = data[(y * width + width - x - 1) * 4 + 2];\n        newImgData[startIndex + 3] = data[(y * width + width - x - 1) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, height, width);\n    return newImageData;\n  }\n  return null;\n};\n\n// 右旋转\nexport const rightRotate = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let x = 0; x < width; x++) {\n      for (let y = 0; y < height; y++) {\n        const startIndex = (x * height + y) * 4;\n        newImgData[startIndex] = data[((height - y - 1) * width + x) * 4];\n        newImgData[startIndex + 1] =\n          data[((height - y - 1) * width + x) * 4 + 1];\n        newImgData[startIndex + 2] =\n          data[((height - y - 1) * width + x) * 4 + 2];\n        newImgData[startIndex + 3] =\n          data[((height - y - 1) * width + x) * 4 + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, height, width);\n    return newImageData;\n  }\n  return null;\n};\n\n// 灰化\nexport const toGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const avgColor =\n          (data[startIndex] + data[startIndex + 1] + data[startIndex + 2]) / 3;\n        newImgData[startIndex] = avgColor;\n        newImgData[startIndex + 1] = avgColor;\n        newImgData[startIndex + 2] = avgColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 黑白化\nexport const toBlackAndWhite = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const avgColor =\n          (data[startIndex] + data[startIndex + 1] + data[startIndex + 2]) / 3;\n        const newColor = avgColor > 127 ? 255 : 0;\n        newImgData[startIndex] = newColor;\n        newImgData[startIndex + 1] = newColor;\n        newImgData[startIndex + 2] = newColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 反相色滤镜\nexport const toOpposite = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 255 - data[startIndex];\n        newImgData[startIndex + 1] = 255 - data[startIndex + 1];\n        newImgData[startIndex + 2] = 255 - data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红色滤镜\nexport const toRed = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 绿色滤镜\nexport const toGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝色滤镜\nexport const toBlue = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红绿色滤镜\nexport const toRedAndGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = 0;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红蓝色滤镜\nexport const toRedAndBlue = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = 0;\n        newImgData[startIndex + 2] = data[startIndex + 1];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝绿色滤镜\nexport const toBlueAndGreen = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = 0;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = data[startIndex + 1];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 红灰色滤镜\nexport const toRedAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex + 1] + data[startIndex + 2]) / 2;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = greyColor;\n        newImgData[startIndex + 2] = greyColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 绿灰色滤镜\nexport const toGreenAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex] + data[startIndex + 2]) / 2;\n        newImgData[startIndex] = greyColor;\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = greyColor;\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 蓝灰色滤镜\nexport const toBlueAndGrey = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        const greyColor = (data[startIndex] + data[startIndex + 1]) / 2;\n        newImgData[startIndex] = greyColor;\n        newImgData[startIndex + 1] = greyColor;\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 锐化\nexport const sharpen = (imageData: ImageData) => {\n  if (imageData) {\n    const kernel = [-1, -1, -1, -1, 9, -1, -1, -1, -1]; // 锐化卷积核\n    const newImageData = convolutionMatrix(imageData, kernel);\n    return newImageData;\n  }\n  return null;\n};\n\n// 边缘锐化\nexport const marginSharpen = (imageData: ImageData) => {\n  if (imageData) {\n    const kernel = [-1, -1, -1, -1, 8, -1, -1, -1, -1]; // 边缘化卷积核\n    const newImageData = convolutionMatrix(imageData, kernel);\n    return newImageData;\n  }\n  return null;\n};\n\n// JPG转PNG\nexport const jpgToPng = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = data[startIndex];\n        newImgData[startIndex + 1] = data[startIndex + 1];\n        newImgData[startIndex + 2] = data[startIndex + 2];\n        newImgData[startIndex + 3] = 255;\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// PNG转JPG\nexport const pngToJpg = (imageData: ImageData) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (data[startIndex + 3] === 0) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n          newImgData[startIndex + 3] = 255;\n        } else {\n          const newColor = colorStacks(\n            [\n              data[startIndex],\n              data[startIndex + 1],\n              data[startIndex + 2],\n              data[startIndex + 3]\n            ],\n            [255, 255, 255, 255]\n          );\n          newImgData[startIndex] = newColor[0];\n          newImgData[startIndex + 1] = newColor[1];\n          newImgData[startIndex + 2] = newColor[2];\n          newImgData[startIndex + 3] = newColor[3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n/**\n * 矩形裁剪\n * @param imageData ImageData源数据\n * @param newWidth 新图的宽度（retainOriginalSize为true时，宽度为imageData.width）\n * @param newHeight 新图的高度（retainOriginalSize为true时，高度为imageData.height）\n * @param top 新图相对于原图顶部的起始位置\n * @param left 新图相对于原图左侧的起始位置\n * @param retainOriginalSize 是否保留为原图的宽高 (宽高继承原图，多余部分用白色或透明色填充)\n * @param imageType 图片类型 (retainOriginalSize为true时必须传该值)\n * @returns ImageData | null\n */\nexport const rectClip = (\n  imageData: ImageData,\n  newWidth: number,\n  newHeight: number,\n  top: number,\n  left: number,\n  retainOriginalSize = false,\n  imageType?: string\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalLeft = left;\n    let finalTop = top;\n    let finalWidth = newWidth;\n    let finalHeight = newHeight;\n    if (finalLeft < 0) {\n      finalLeft = 0;\n    } else if (finalLeft > width) {\n      finalLeft = width;\n    }\n    if (finalTop < 0) {\n      finalTop = 0;\n    } else if (finalTop > height) {\n      finalTop = height;\n    }\n    if (finalWidth < 1) {\n      finalWidth = 1;\n    } else if (finalWidth > width) {\n      finalWidth = width;\n    }\n    if (finalHeight < 1) {\n      finalHeight = 1;\n    } else if (finalHeight > height) {\n      finalHeight = height;\n    }\n    if (finalLeft + finalWidth > width) {\n      finalWidth = width - finalLeft;\n    }\n    if (finalTop + finalHeight > height) {\n      finalHeight = height - finalTop;\n    }\n    // 保留原尺寸\n    if (retainOriginalSize) {\n      const newImgData = new Uint8ClampedArray(data.length);\n      for (let y = 0; y < height; y++) {\n        for (let x = 0; x < width; x++) {\n          const startIndex = (y * width + x) * 4;\n          if (\n            x >= finalLeft &&\n            x <= finalLeft + finalWidth &&\n            y >= finalTop &&\n            y <= finalTop + finalHeight\n          ) {\n            newImgData[startIndex] = data[startIndex];\n            newImgData[startIndex + 1] = data[startIndex + 1];\n            newImgData[startIndex + 2] = data[startIndex + 2];\n            newImgData[startIndex + 3] = data[startIndex + 3];\n          } else {\n            newImgData[startIndex] = 255;\n            newImgData[startIndex + 1] = 255;\n            newImgData[startIndex + 2] = 255;\n            newImgData[startIndex + 3] =\n              imageType && [\"JPG\", \"JPEG\"].includes(imageType.toUpperCase())\n                ? 255\n                : 0;\n          }\n        }\n      }\n      const newImageData = new ImageData(newImgData, width, height);\n      return newImageData;\n    } else {\n      const newImgData = new Uint8ClampedArray(finalWidth * finalHeight * 4);\n      for (let y = finalTop; y <= finalTop + finalHeight; y++) {\n        for (let x = finalLeft; x <= finalLeft + finalWidth; x++) {\n          const startIndex = ((y - finalTop) * finalWidth + x - finalLeft) * 4;\n          const startIndex2 = (y * width + x) * 4;\n          newImgData[startIndex] = data[startIndex2];\n          newImgData[startIndex + 1] = data[startIndex2 + 1];\n          newImgData[startIndex + 2] = data[startIndex2 + 2];\n          newImgData[startIndex + 3] = data[startIndex2 + 3];\n        }\n      }\n      const newImageData = new ImageData(newImgData, finalWidth, finalHeight);\n      return newImageData;\n    }\n  }\n  return null;\n};\n\n/**\n * 圆角裁剪\n * @param imageData ImageData源数据\n * @param borderRadius 圆角半径\n * @param imageType 图片类型\n * @param jpgToPNG 是否为JPG转成PNG\n * @returns ImageData | null\n */\nexport const radiusClip = (\n  imageData: ImageData,\n  borderRadius: number,\n  imageType: string,\n  jpgToPNG?: boolean\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalRadius = borderRadius;\n    if (finalRadius > Math.floor(width / 2)) {\n      finalRadius = Math.floor(width / 2);\n    }\n    if (finalRadius > Math.floor(height / 2)) {\n      finalRadius = Math.floor(height / 2);\n    }\n    if (finalRadius < 0) {\n      finalRadius = 0;\n    }\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        let l = -1;\n        if (x < finalRadius) {\n          if (y < finalRadius) {\n            l = Math.sqrt(\n              Math.pow(finalRadius - x - 1, 2) +\n                Math.pow(finalRadius - y - 1, 2)\n            );\n          } else if (y > height - finalRadius - 1) {\n            l = Math.sqrt(\n              Math.pow(finalRadius - x - 1, 2) +\n                Math.pow(y - (height - finalRadius), 2)\n            );\n          }\n        } else if (x > width - finalRadius - 1) {\n          if (y < finalRadius) {\n            l = Math.sqrt(\n              Math.pow(x - (width - finalRadius), 2) +\n                Math.pow(finalRadius - y - 1, 2)\n            );\n          } else if (y > height - finalRadius - 1) {\n            l = Math.sqrt(\n              Math.pow(x - (width - finalRadius), 2) +\n                Math.pow(y - (height - finalRadius), 2)\n            );\n          }\n        }\n        if (Math.round(l) > finalRadius) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n          newImgData[startIndex + 3] =\n            jpgToPNG || imageType.toUpperCase() === \"PNG\" ? 0 : 255;\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] =\n            jpgToPNG || imageType.toUpperCase() === \"PNG\"\n              ? data[startIndex + 3]\n              : 255;\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改尺寸\nexport const changeSize = (\n  imgUrl: string,\n  width: number,\n  height: number,\n  newWidth: number,\n  newHeight: number,\n  maxWidthHeight = 10000\n) => {\n  if (imgUrl) {\n    const img = new Image();\n    img.src = imgUrl;\n    const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n    const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n    canvas.width = maxWidthHeight;\n    canvas.height = maxWidthHeight;\n    ctx.drawImage(img, 0, 0, width, height, 0, 0, newWidth, newHeight);\n    const newImageData = ctx.getImageData(\n      0,\n      0,\n      newWidth,\n      newHeight\n    ) as ImageData;\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改亮度\nexport const changeBrightness = (imageData: ImageData, changeNum: number) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        newImgData[startIndex] = Math.max(\n          Math.min(data[startIndex] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 1] = Math.max(\n          Math.min(data[startIndex + 1] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 2] = Math.max(\n          Math.min(data[startIndex + 2] + changeNum, 255),\n          0\n        );\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 修改透明度\nexport const changeDiaphaneity = (\n  imageData: ImageData,\n  value: number,\n  fixedDiaphaneity = false\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (data[startIndex + 3] === 0) {\n          newImgData[startIndex] = 255;\n          newImgData[startIndex + 1] = 255;\n          newImgData[startIndex + 2] = 255;\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n        }\n        let a = data[startIndex + 3];\n        if (fixedDiaphaneity) {\n          a = Math.max(Math.min(Math.floor(255 * value), 255), 0);\n        } else {\n          a = Math.max(Math.min(Math.floor(a + 255 * value), 255), 0);\n        }\n        newImgData[startIndex + 3] = a;\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 添加水印\nexport const addWatermark = (\n  imageData: ImageData,\n  watermarkImageData: ImageData,\n  top: number,\n  left: number\n) => {\n  if (imageData && watermarkImageData) {\n    const { data, width, height } = imageData;\n    const {\n      data: watermarkData,\n      width: watermarkWidth,\n      height: watermarkHeight\n    } = watermarkImageData;\n    let finalTop = top;\n    let finalLeft = left;\n    if (top + watermarkHeight > height) {\n      finalTop = height - watermarkHeight;\n    }\n    if (left + watermarkWidth > width) {\n      finalLeft = width - watermarkWidth;\n    }\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (\n          x < finalLeft ||\n          x > finalLeft + watermarkWidth ||\n          y <= finalTop ||\n          y >= finalTop + watermarkHeight\n        ) {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] = data[startIndex + 3];\n        } else {\n          const watermarkStartIndex =\n            (y * width +\n              x -\n              ((finalTop + 1) * width +\n                (y - (finalTop + 1)) * (width - watermarkWidth)) +\n              watermarkWidth -\n              finalLeft -\n              1) *\n            4;\n          const aboveColor: [number, number, number, number] = [\n            watermarkData[watermarkStartIndex],\n            watermarkData[watermarkStartIndex + 1],\n            watermarkData[watermarkStartIndex + 2],\n            watermarkData[watermarkStartIndex + 3]\n          ];\n          const belowColor: [number, number, number, number] = [\n            data[startIndex],\n            data[startIndex + 1],\n            data[startIndex + 2],\n            data[startIndex + 3]\n          ];\n          const finalColor = colorStacks(aboveColor, belowColor);\n          newImgData[startIndex] = finalColor[0];\n          newImgData[startIndex + 1] = finalColor[1];\n          newImgData[startIndex + 2] = finalColor[2];\n          newImgData[startIndex + 3] = finalColor[3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n/**\n * 打马赛克\n * @param imageData ImageData源数据\n * @param width 马赛克区域的宽度\n * @param height 马赛克区域的高度\n * @param top 马赛克相对于顶部的起始位置\n * @param left 马塞克相对于左侧的起始位置\n * @param mosaicSize 马塞克颗粒的大小\n * @returns ImageData | null\n */\nexport const mosaic = (\n  imageData: ImageData,\n  mosaicWidth: number,\n  mosaicHeight: number,\n  top: number,\n  left: number,\n  mosaicSize = 10\n) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    let finalLeft = left;\n    let finalTop = top;\n    let finalWidth = mosaicWidth;\n    let finalHeight = mosaicHeight;\n    if (finalLeft < 0) {\n      finalLeft = 0;\n    } else if (finalLeft > width) {\n      finalLeft = width;\n    }\n    if (finalTop < 0) {\n      finalTop = 0;\n    } else if (finalTop > height) {\n      finalTop = height;\n    }\n    if (finalWidth < 1) {\n      finalWidth = 1;\n    } else if (finalWidth > width) {\n      finalWidth = width;\n    }\n    if (finalHeight < 1) {\n      finalHeight = 1;\n    } else if (finalHeight > height) {\n      finalHeight = height;\n    }\n    if (finalLeft + finalWidth > width) {\n      finalWidth = width - finalLeft;\n    }\n    if (finalTop + finalHeight > height) {\n      finalHeight = height - finalTop;\n    }\n\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        if (\n          x >= finalLeft &&\n          x <= finalLeft + finalWidth &&\n          y >= finalTop &&\n          y <= finalTop + finalHeight\n        ) {\n          const boxXIndex = Math.floor((x - finalLeft) / mosaicSize);\n          const boxYIndex = Math.floor((y - finalTop) / mosaicSize);\n          let mosaicBoxColorX = Math.floor(\n            mosaicSize * (boxXIndex + 1) - mosaicSize / 2 + finalLeft\n          );\n          let mosaicBoxColorY = Math.floor(\n            mosaicSize * (boxYIndex + 1) - mosaicSize / 2 + finalTop\n          );\n          if (mosaicBoxColorX > width - 1) {\n            mosaicBoxColorX = width - 1;\n          }\n          if (mosaicBoxColorY > height - 1) {\n            mosaicBoxColorY = height - 1;\n          }\n          const mosaicBoxColorIndex =\n            (mosaicBoxColorY * width + mosaicBoxColorX) * 4;\n          newImgData[startIndex] = data[mosaicBoxColorIndex];\n          newImgData[startIndex + 1] = data[mosaicBoxColorIndex + 1];\n          newImgData[startIndex + 2] = data[mosaicBoxColorIndex + 2];\n          newImgData[startIndex + 3] = data[mosaicBoxColorIndex + 3];\n        } else {\n          newImgData[startIndex] = data[startIndex];\n          newImgData[startIndex + 1] = data[startIndex + 1];\n          newImgData[startIndex + 2] = data[startIndex + 2];\n          newImgData[startIndex + 3] = data[startIndex + 3];\n        }\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 图片压缩\nexport const compression = async (\n  imageUrl: string | ImageData,\n  width: number,\n  height: number,\n  imageType: string,\n  compressionDegree: number,\n  cb: (blob: Blob | null) => void\n) => {\n  if (imageUrl && imageType) {\n    const degree = compressionDegree / 100;\n    if ([\"JPG\", \"JPEG\"].includes(imageType.toUpperCase())) {\n      const img = new Image();\n      img.src = imageUrl as string;\n      const canvas = document.createElement(\"canvas\") as HTMLCanvasElement;\n      const ctx = canvas.getContext(\"2d\") as CanvasRenderingContext2D;\n      canvas.width = width;\n      canvas.height = height;\n      ctx.drawImage(img, 0, 0, width, height);\n      canvas.toBlob(\n        (blob: Blob | null) => {\n          cb && cb(blob);\n        },\n        `image/${imageType.toLowerCase()}`,\n        degree\n      );\n    } else {\n      const bit = Math.floor(degree * 256);\n      const png = UPNG.encode(\n        [(imageUrl as ImageData).data.buffer],\n        width,\n        height,\n        bit\n      );\n      const blob = new Blob([png]);\n      cb && cb(blob);\n    }\n  } else {\n    cb && cb(null);\n  }\n};\n\n// 根据AI识别的人像数据算出界面中需要显示的最终数据\nexport const getImageDataByAIData = (\n  originalImageData: ImageData,\n  AIImageData: ImageData,\n  options: {\n    backgroundColor: { r: number; g: number; b: number; a: number };\n    changeIntoColor: { r: number; g: number; b: number; a: number };\n  } = {\n    backgroundColor: { r: 0, g: 0, b: 0, a: 255 },\n    changeIntoColor: { r: 0, g: 0, b: 0, a: 0 }\n  }\n) => {\n  if (originalImageData) {\n    if (AIImageData && options) {\n      const { data, width, height } = originalImageData;\n      const { data: AIData } = AIImageData;\n      const newImgData = new Uint8ClampedArray(data.length);\n      const { backgroundColor, changeIntoColor } = options;\n      for (let y = 0; y < height; y++) {\n        for (let x = 0; x < width; x++) {\n          const startIndex = (y * width + x) * 4;\n          const r = AIData[startIndex];\n          const g = AIData[startIndex + 1];\n          const b = AIData[startIndex + 2];\n          const a = AIData[startIndex + 3];\n          if (\n            r === backgroundColor.r &&\n            g === backgroundColor.g &&\n            b === backgroundColor.b &&\n            a === backgroundColor.a &&\n            changeIntoColor.a !== 0\n          ) {\n            newImgData[startIndex] = changeIntoColor.r;\n            newImgData[startIndex + 1] = changeIntoColor.g;\n            newImgData[startIndex + 2] = changeIntoColor.b;\n            newImgData[startIndex + 3] = changeIntoColor.a;\n          } else {\n            newImgData[startIndex] = data[startIndex];\n            newImgData[startIndex + 1] = data[startIndex + 1];\n            newImgData[startIndex + 2] = data[startIndex + 2];\n            newImgData[startIndex + 3] = data[startIndex + 3];\n          }\n        }\n      }\n      const newImageData = new ImageData(newImgData, width, height);\n      return newImageData;\n    }\n    return originalImageData;\n  }\n  return null;\n};\n\n// 卷积算法\nconst convolutionMatrix = (imageData: ImageData, kernel: number[]) => {\n  if (imageData) {\n    const { data, width, height } = imageData;\n    const newImgData = new Uint8ClampedArray(data.length);\n    for (let y = 0; y < height; y++) {\n      for (let x = 0; x < width; x++) {\n        const startIndex = (y * width + x) * 4;\n        for (let i = 0; i < 3; i++) {\n          const index = startIndex + i;\n          if (x === 0 || x === width - 1 || y === 0 || y === height - 1) {\n            newImgData[index] = data[index];\n          } else {\n            newImgData[index] =\n              kernel[0] * data[index - width * 4 - 4] +\n              kernel[1] * data[index - width * 4] +\n              kernel[2] * data[index - width * 4 + 4] +\n              kernel[3] * data[index - 4] +\n              kernel[4] * data[index] +\n              kernel[5] * data[index + 4] +\n              kernel[6] * data[index + width * 4 - 4] +\n              kernel[7] * data[index + width * 4] +\n              kernel[8] * data[index + width * 4 + 4];\n          }\n        }\n        newImgData[startIndex + 3] = data[startIndex + 3];\n      }\n    }\n    const newImageData = new ImageData(newImgData, width, height);\n    return newImageData;\n  }\n  return null;\n};\n\n// 颜色叠加算法\nconst colorStacks = (\n  aboveColor: [number, number, number, number],\n  belowColor: [number, number, number, number]\n) => {\n  if (\n    aboveColor &&\n    aboveColor.length === 4 &&\n    belowColor &&\n    belowColor.length === 4\n  ) {\n    const aboveA = aboveColor[3];\n    const belowA = belowColor[3];\n    if (aboveA === 255 || belowA === 0) {\n      return aboveColor;\n    } else if (aboveA === 0) {\n      return belowColor;\n    } else {\n      const aboveDiaphaneity = aboveA / 255;\n      const belowDiaphaneity = belowA / 255;\n      const newColorR = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[0] * aboveDiaphaneity +\n              belowColor[0] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorG = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[1] * aboveDiaphaneity +\n              belowColor[1] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorB = Math.max(\n        Math.min(\n          Math.floor(\n            aboveColor[2] * aboveDiaphaneity +\n              belowColor[2] * belowDiaphaneity * (1 - aboveDiaphaneity)\n          ),\n          255\n        ),\n        0\n      );\n      const newColorA = Math.max(\n        Math.min(\n          Math.floor(\n            (aboveDiaphaneity + belowDiaphaneity * (1 - aboveDiaphaneity)) * 255\n          ),\n          255\n        ),\n        0\n      );\n      return [newColorR, newColorG, newColorB, newColorA];\n    }\n  }\n  return [255, 255, 255, 255];\n};\n","export function createXMLHttpRequest() {\n  var xhr = null;\n\n  if (window.ActiveXObject) {\n    var versions = [\n      \"Microsoft.XMLHTTP\",\n      \"MSXML6.XMLHTTP\",\n      \"MSXML5.XMLHTTP\",\n      \"MSXML4.XMLHTTP\",\n      \"MSXML3.XMLHTTP\",\n      \"MSXML2.XMLHTTP\",\n      \"MSXML.XMLHTTP\"\n    ];\n\n    for (var i = 0; i < versions.length; i++) {\n      try {\n        xhr = new window.ActiveXObject(versions[i]);\n        break;\n      } catch (ex) {\n        continue;\n      }\n    }\n  } else {\n    xhr = new XMLHttpRequest();\n  }\n  return xhr;\n}\n\nexport function getFormElementData(oFormElement) {\n  if (!oFormElement.action) {\n    return;\n  }\n  if (oFormElement.method.toLowerCase() === \"post\") {\n    /* enctype is multipart/form-data */\n    // segments.push(\n    //   'Content-Disposition: form-data; name=\"' +\n    //     fd.name +\n    //     '\"; filename=\"' +\n    //     fd.name +\n    //     '\"\\r\\nContent-Type: ' +\n    //     fd.type +\n    //     \"\\r\\n\\r\\n\"\n    // );\n    // segments.push(\n    //   'Content-Disposition: form-data; name=\"' +\n    //     input.name +\n    //     '\"\\r\\n\\r\\n' +\n    //     input.value +\n    //     \"\\r\\n\"\n    // );\n    // var sBoundary = \"---------------------------\" + Date.now().toString(16);\n    // xhr.setRequestHeader(\n    //   \"Content-Type\",\n    //   \"multipart/form-data; boundary=\" + sBoundary\n    // );\n    // xhr.sendAsBinary(\n    //   \"--\" +\n    //     sBoundary +\n    //     \"\\r\\n\" +\n    //     segments.join(\"--\" + sBoundary + \"\\r\\n\") +\n    //     \"--\" +\n    //     sBoundary +\n    //     \"--\\r\\n\"\n    // );\n    /* enctype is application/x-www-form-urlencoded or text/plain */\n    // segments.push(escape(input.name) + \"=\" + escape(input.value));\n    return {\n      url: oFormElement.action,\n      data: new FormData(oFormElement)\n    };\n  } else {\n    var sSearch = \"\";\n    for (var nItem = 0; nItem < oFormElement.elements.length; nItem++) {\n      var oField = oFormElement.elements[nItem];\n      if (!oField.hasAttribute(\"name\")) {\n        continue;\n      }\n      var sFieldType =\n        oField.nodeName.toUpperCase() === \"INPUT\"\n          ? oField.getAttribute(\"type\").toUpperCase()\n          : \"TEXT\";\n      if (sFieldType === \"FILE\") {\n        for (\n          var nFile = 0;\n          nFile < oField.files.length;\n          sSearch +=\n            \"&\" + escape(oField.name) + \"=\" + escape(oField.files[nFile++].name)\n        );\n      } else if (\n        (sFieldType !== \"RADIO\" && sFieldType !== \"CHECKBOX\") ||\n        oField.checked\n      ) {\n        sSearch += \"&\" + escape(oField.name) + \"=\" + escape(oField.value);\n      }\n    }\n    return {\n      url: oFormElement.action.replace(\n        /(?:\\?.*)?$/,\n        sSearch.replace(/^&/, \"?\")\n      ),\n      data: null\n    };\n  }\n}\n\nexport function fetchUseXMLHttpRequest(url, timeout) {\n  return new Promise((resolve, reject) => {\n    var xhr = new XMLHttpRequest();\n    var timeoutHandler = function () {\n      reject(\"The request for \" + url + \" is timed out for \" + timeout + \".\");\n    };\n    var handler = function (e) {\n      // - 0 代理被创建，但尚未调用 open()方法\n      // - 1 open() 方法已经被调用\n      // - 2 send()方法已经被调用，并且头部和状态已经可获得\n      // - 3 下载中， responseText`属性已经包含部分数据\n      // - 4 下载操作已完成\n      if (xhr.readyState === 4) {\n        if (xhr.status === 200) {\n          resolve(xhr.response); // xhr.responseText\n          // var arrayBuffer = xhr.response;\n          // if (arrayBuffer) {\n          //   var byteArray = new Uint8Array(arrayBuffer);\n          //   for (var i = 0; i < byteArray.byteLength; i++) {\n          //     // do something with each byte in the array\n          //   }\n          // }\n        } else {\n          reject(xhr.statusText);\n        }\n      }\n    };\n\n    xhr.open(\"GET\", url);\n    // xhr.open(\"GET\", url, true);\n    // xhr.open(\"POST\", url);\n\n    xhr.onload = handler;\n    // xhr.onreadystatechange = handler;\n    xhr.timeout = timeout;\n    xhr.ontimeout = timeoutHandler;\n\n    xhr.upload.addEventListener(\n      \"progress\",\n      function (e) {\n        if (e.lengthComputable) {\n          const percentage = Math.round((e.loaded * 100) / e.total);\n          console.log(percentage + \"%\");\n        }\n      },\n      false\n    );\n    xhr.upload.addEventListener(\"load\", function (e) {}, false);\n    // xhr.overrideMimeType(\"text/plain; charset=x-user-defined-binary\");\n\n    // empty string (default), \"arraybuffer\", \"blob\", \"document\", \"json\", and \"text\"\n    // xhr.responseType = \"json\";\n    // xhr.setRequestHeader(\"Accept\", \"application/json\");\n\n    // The send method of the XMLHttpRequest has been extended to enable easy transmission of binary data by accepting an ArrayBuffer or Blob or File object.\n    xhr.send(null);\n\n    // // multipart/form-data upload\n    // const fd = new FormData();\n    // fd.append(\"avatar\", file);\n    // fd.append(\"photos\", photos.files[0]);\n    // fd.append(\"photos\", photos.files[1]);\n    // fd.append(\"username\", \"abc123\");\n    // xhr.send(fd);\n  });\n}\n\nexport function fetchUseFetch(url, options, data) {\n  return fetch(\n    url,\n    Object.assign(\n      {\n        method: \"POST\", // GET, POST, PUT, DELETE\n        headers: {\n          // \"Content-Type\": \"application/json\"\n          // \"Content-Type\": \"application/x-www-form-urlencoded\"\n        }, // 请求的头信息，形式为 Headers 对象或 ByteString\n        body: {}, // JSON.stringify(data) 请求发送的数据 blob、BufferSource、FormData、URLSearchParams（get 或head 方法中不能包含 body）\n        mode: \"\", //请求的模式，是否跨域等，如 cors、 no-cors 或 same-origin\n        credentials: \"\", //cookie 的跨域策略，如 omit、same-origin 或 include\n        cache: \"\", //请求的 cache 模式: default、no-store、reload、no-cache、 force-cache 或 only-if-cached\n        redirect: \"follow\", // manual, *follow, error\n        referrerPolicy: \"no-referrer\" // no-referrer, *no-referrer-when-downgrade, origin, origin-when-cross-origin, same-origin, strict-origin, strict-origin-when-cross-origin, unsafe-url\n      },\n      options\n    )\n  ).then((response) => response.json());\n}\n\n/**\n *  ifWebFileHasChanged(\"yourpage.html\", function (nModif, nVisit) {\n      console.log(\n        \"The page '\" +\n          this.filepath +\n          \"' has been changed on \" +\n          new Date(nModif).toLocaleString() +\n          \"!\"\n      );\n    });\n */\nexport function ifWebFileHasChanged(sURL, fCallback) {\n  var xhr = new XMLHttpRequest();\n  xhr.open(\"HEAD\" /* use HEAD - we only need the headers! */, sURL);\n  xhr.filepath = sURL;\n  xhr.callback = fCallback;\n  xhr.onload = function () {\n    var nLastVisit = parseFloat(\n      window.localStorage.getItem(\"lm_\" + this.filepath)\n    );\n    var nLastModif = Date.parse(this.getResponseHeader(\"Last-Modified\"));\n    if (isNaN(nLastVisit) || nLastModif > nLastVisit) {\n      window.localStorage.setItem(\"lm_\" + this.filepath, Date.now());\n      isFinite(nLastVisit) && this.callback(nLastModif, nLastVisit);\n    }\n  };\n  xhr.send();\n}\n","export function localstorage(\n  key: string,\n  value?: string | number | boolean | object | []\n) {\n  if (value) {\n    window.localStorage.setItem(\n      key,\n      typeof value === \"string\" ? value : JSON.stringify(value)\n    );\n  } else {\n    return window.localStorage.getItem(key);\n  }\n}\n","export const scrollTo = (position: { x: number; y: number } = { x: 0, y: 0 }) =>\n  window.scrollTo(position.x, position.y);\n\nexport function setScrollRestoration(newVal: ScrollRestoration) {\n  try {\n    window.history.scrollRestoration = newVal;\n  } catch (e) {\n    ///\n  }\n}\n\nif (\"scrollRestoration\" in window.history) {\n  setScrollRestoration(\"manual\");\n  // reset scrollRestoration to auto when leaving page, allowing page reload\n  // and back-navigation from other pages to use the browser to restore the\n  // scrolling position.\n  window.addEventListener(\"beforeunload\", () => {\n    setScrollRestoration(\"auto\");\n  });\n  // Setting scrollRestoration to manual again when returning to this page.\n  window.addEventListener(\"load\", () => {\n    setScrollRestoration(\"manual\");\n  });\n}\n","type Target = Record<string, any>;\ntype Effect = () => void;\n\nlet activeEffect: Effect | null;\n\nconst targetKeyDep = new WeakMap<Target, Map<string, Dep>>();\n\nfunction getDep(target: Target, key: string) {\n  let depMap = targetKeyDep.get(target);\n  if (!depMap) {\n    depMap = new Map();\n    targetKeyDep.set(target, depMap);\n  }\n  let dep = depMap.get(key);\n  if (!dep) {\n    dep = new Dep();\n    depMap.set(key, dep);\n  }\n  return dep;\n}\n\nexport class Dep {\n  subscribers: Set<Effect>;\n\n  constructor() {\n    this.subscribers = new Set();\n  }\n\n  depend() {\n    if (activeEffect) {\n      this.subscribers.add(activeEffect);\n    }\n  }\n\n  notify() {\n    this.subscribers.forEach((effect) => effect());\n  }\n}\n\nexport function watchEffect(effect: Effect) {\n  activeEffect = effect;\n  // effect里面get数据后设置dep\n  effect();\n  activeEffect = null;\n}\n\nexport function reactiveVue2(raw: Target) {\n  Object.keys(raw).forEach((key) => {\n    let value = raw[key];\n    const dep = getDep(raw, key);\n    Object.defineProperty(raw, key, {\n      get() {\n        dep.depend();\n        return value;\n      },\n      set(newValue) {\n        if (newValue != value) {\n          value = newValue;\n          dep.notify();\n        }\n      }\n    });\n  });\n  return raw;\n}\n\nexport function reactiveVue3(raw: Target) {\n  return new Proxy(raw, {\n    get(target, key, receiver) {\n      const dep = getDep(raw, key as string);\n      dep.depend();\n      return Reflect.get(target, key, receiver);\n    },\n    set(target, key, value, receiver) {\n      const dep = getDep(raw, key as string);\n      if (raw[key as string] != value) {\n        raw[key as string] = value;\n        dep.notify();\n      }\n      return Reflect.set(target, key, value, receiver);\n    }\n  });\n}\n\n// /app/reactive.html\n","// 缓动函数 amount: 0-1\nexport type EasingFunction = (amount: number) => number;\n\nexport const Easing = {\n  // 线性\n  Linear: {\n    None: function (amount: number): number {\n      return amount;\n    }\n  },\n  // 二次\n  Quadratic: {\n    In: function (amount: number): number {\n      return amount * amount;\n    },\n    Out: function (amount: number): number {\n      return amount * (2 - amount);\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount;\n      }\n      return -0.5 * (--amount * (amount - 2) - 1);\n    }\n  },\n  // 三次\n  Cubic: {\n    In: function (amount: number): number {\n      return amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return --amount * amount * amount + 1;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount;\n      }\n      return 0.5 * ((amount -= 2) * amount * amount + 2);\n    }\n  },\n  // 四次\n  Quartic: {\n    In: function (amount: number): number {\n      return amount * amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return 1 - --amount * amount * amount * amount;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount * amount;\n      }\n      return -0.5 * ((amount -= 2) * amount * amount * amount - 2);\n    }\n  },\n  // 五次\n  Quintic: {\n    In: function (amount: number): number {\n      return amount * amount * amount * amount * amount;\n    },\n    Out: function (amount: number): number {\n      return --amount * amount * amount * amount * amount + 1;\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return 0.5 * amount * amount * amount * amount * amount;\n      }\n      return 0.5 * ((amount -= 2) * amount * amount * amount * amount + 2);\n    }\n  },\n  // 正弦曲线\n  Sinusoidal: {\n    In: function (amount: number): number {\n      return 1 - Math.sin(((1.0 - amount) * Math.PI) / 2);\n    },\n    Out: function (amount: number): number {\n      return Math.sin((amount * Math.PI) / 2);\n    },\n    InOut: function (amount: number): number {\n      return 0.5 * (1 - Math.sin(Math.PI * (0.5 - amount)));\n    }\n  },\n  // 指数\n  Exponential: {\n    In: function (amount: number): number {\n      return amount === 0 ? 0 : Math.pow(1024, amount - 1);\n    },\n    Out: function (amount: number): number {\n      return amount === 1 ? 1 : 1 - Math.pow(2, -10 * amount);\n    },\n    InOut: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      if ((amount *= 2) < 1) {\n        return 0.5 * Math.pow(1024, amount - 1);\n      }\n      return 0.5 * (-Math.pow(2, -10 * (amount - 1)) + 2);\n    }\n  },\n  // 圆\n  Circular: {\n    In: function (amount: number): number {\n      return 1 - Math.sqrt(1 - amount * amount);\n    },\n    Out: function (amount: number): number {\n      return Math.sqrt(1 - --amount * amount);\n    },\n    InOut: function (amount: number): number {\n      if ((amount *= 2) < 1) {\n        return -0.5 * (Math.sqrt(1 - amount * amount) - 1);\n      }\n      return 0.5 * (Math.sqrt(1 - (amount -= 2) * amount) + 1);\n    }\n  },\n  // 松紧带\n  Elastic: {\n    In: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      return (\n        -Math.pow(2, 10 * (amount - 1)) * Math.sin((amount - 1.1) * 5 * Math.PI)\n      );\n    },\n    Out: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      return (\n        Math.pow(2, -10 * amount) * Math.sin((amount - 0.1) * 5 * Math.PI) + 1\n      );\n    },\n    InOut: function (amount: number): number {\n      if (amount === 0) {\n        return 0;\n      }\n      if (amount === 1) {\n        return 1;\n      }\n      amount *= 2;\n      if (amount < 1) {\n        return (\n          -0.5 *\n          Math.pow(2, 10 * (amount - 1)) *\n          Math.sin((amount - 1.1) * 5 * Math.PI)\n        );\n      }\n      return (\n        0.5 *\n          Math.pow(2, -10 * (amount - 1)) *\n          Math.sin((amount - 1.1) * 5 * Math.PI) +\n        1\n      );\n    }\n  },\n  // 后退\n  Back: {\n    In: function (amount: number): number {\n      const s = 1.70158;\n      return amount === 1 ? 1 : amount * amount * ((s + 1) * amount - s);\n    },\n    Out: function (amount: number): number {\n      const s = 1.70158;\n      return amount === 0 ? 0 : --amount * amount * ((s + 1) * amount + s) + 1;\n    },\n    InOut: function (amount: number): number {\n      const s = 1.70158 * 1.525;\n      if ((amount *= 2) < 1) {\n        return 0.5 * (amount * amount * ((s + 1) * amount - s));\n      }\n      return 0.5 * ((amount -= 2) * amount * ((s + 1) * amount + s) + 2);\n    }\n  },\n  // 弹跳\n  Bounce: {\n    In: function (amount: number): number {\n      return 1 - Easing.Bounce.Out(1 - amount);\n    },\n    Out: function (amount: number): number {\n      if (amount < 1 / 2.75) {\n        return 7.5625 * amount * amount;\n      } else if (amount < 2 / 2.75) {\n        return 7.5625 * (amount -= 1.5 / 2.75) * amount + 0.75;\n      } else if (amount < 2.5 / 2.75) {\n        return 7.5625 * (amount -= 2.25 / 2.75) * amount + 0.9375;\n      } else {\n        return 7.5625 * (amount -= 2.625 / 2.75) * amount + 0.984375;\n      }\n    },\n    InOut: function (amount: number): number {\n      if (amount < 0.5) {\n        return Easing.Bounce.In(amount * 2) * 0.5;\n      }\n      return Easing.Bounce.Out(amount * 2 - 1) * 0.5 + 0.5;\n    }\n  },\n  generatePow: function (power = 4): {\n    In(amount: number): number;\n    Out(amount: number): number;\n    InOut(amount: number): number;\n  } {\n    power = power < Number.EPSILON ? Number.EPSILON : power;\n    power = power > 10000 ? 10000 : power;\n    return {\n      In: function (amount: number): number {\n        return amount ** power;\n      },\n      Out: function (amount: number): number {\n        return 1 - (1 - amount) ** power;\n      },\n      InOut: function (amount: number): number {\n        if (amount < 0.5) {\n          return (amount * 2) ** power / 2;\n        }\n        return (1 - (2 - amount * 2) ** power) / 2 + 0.5;\n      }\n    };\n  }\n};\n\nexport default Easing;\n","let now: () => number;\n\nif (\n  typeof self === \"undefined\" &&\n  typeof process !== \"undefined\" &&\n  process.hrtime\n) {\n  now = function (): number {\n    const time = process.hrtime();\n    // Convert [seconds, nanoseconds] to milliseconds.\n    return time[0] * 1000 + time[1] / 1000000;\n  };\n}\n// In a browser\nelse if (\n  typeof self !== \"undefined\" &&\n  self.performance !== undefined &&\n  self.performance.now !== undefined\n) {\n  // This must be bound, because directly assigning this function leads to an invocation exception in Chrome.\n  now = self.performance.now.bind(self.performance);\n} else if (Date.now !== undefined) {\n  now = Date.now;\n} else {\n  now = function (): number {\n    return new Date().getTime();\n  };\n}\n\nexport default now;\n","import now from \"./Now\";\nimport type { Tween, UnknownProps } from \"./Tween\";\n\n/**\n * Controlling groups of tweens\n *\n * Using the TWEEN singleton to manage your tweens can cause issues in large apps with many components.\n * In these cases, you may want to create your own smaller groups of tween\n */\nexport default class Group {\n  private _tweens: {\n    [key: string]: Tween<UnknownProps>;\n  } = {};\n\n  private _tweensAddedDuringUpdate: {\n    [key: string]: Tween<UnknownProps>;\n  } = {};\n\n  getAll(): Array<Tween<UnknownProps>> {\n    return Object.keys(this._tweens).map((tweenId) => this._tweens[tweenId]);\n  }\n\n  removeAll(): void {\n    this._tweens = {};\n  }\n\n  add(tween: Tween<UnknownProps>): void {\n    this._tweens[tween.getId()] = tween;\n    this._tweensAddedDuringUpdate[tween.getId()] = tween;\n  }\n\n  remove(tween: Tween<UnknownProps>): void {\n    delete this._tweens[tween.getId()];\n    delete this._tweensAddedDuringUpdate[tween.getId()];\n  }\n\n  update(time: number = now(), preserve = false): boolean {\n    let tweenIds = Object.keys(this._tweens);\n    if (tweenIds.length === 0) {\n      return false;\n    }\n    while (tweenIds.length > 0) {\n      this._tweensAddedDuringUpdate = {};\n      for (let i = 0; i < tweenIds.length; i++) {\n        const tween = this._tweens[tweenIds[i]];\n        const autoStart = !preserve;\n        if (tween && tween.update(time, autoStart) === false && !preserve) {\n          delete this._tweens[tweenIds[i]];\n        }\n      }\n      tweenIds = Object.keys(this._tweensAddedDuringUpdate);\n    }\n    return true;\n  }\n}\n","// 插值函数\nexport type InterpolationFunction = (\n  targetValue: number[],\n  easingResult: number\n) => number;\n\nexport const Interpolation = {\n  Linear: function (v: number[], k: number): number {\n    const m = v.length - 1;\n    const f = m * k;\n    const i = Math.floor(f);\n    const fn = Interpolation.Utils.Linear;\n    if (k < 0) {\n      return fn(v[0], v[1], f);\n    }\n    if (k > 1) {\n      return fn(v[m], v[m - 1], m - f);\n    }\n    return fn(v[i], v[i + 1 > m ? m : i + 1], f - i);\n  },\n  // 贝塞尔\n  Bezier: function (v: number[], k: number): number {\n    let b = 0;\n    const n = v.length - 1;\n    const pw = Math.pow;\n    const bn = Interpolation.Utils.Bernstein;\n    for (let i = 0; i <= n; i++) {\n      b += pw(1 - k, n - i) * pw(k, i) * v[i] * bn(n, i);\n    }\n    return b;\n  },\n  // 卡特穆尔·罗姆\n  CatmullRom: function (v: number[], k: number): number {\n    const m = v.length - 1;\n    let f = m * k;\n    let i = Math.floor(f);\n    const fn = Interpolation.Utils.CatmullRom;\n    if (v[0] === v[m]) {\n      if (k < 0) {\n        i = Math.floor((f = m * (1 + k)));\n      }\n      return fn(\n        v[(i - 1 + m) % m],\n        v[i],\n        v[(i + 1) % m],\n        v[(i + 2) % m],\n        f - i\n      );\n    } else {\n      if (k < 0) {\n        return v[0] - (fn(v[0], v[0], v[1], v[1], -f) - v[0]);\n      }\n      if (k > 1) {\n        return v[m] - (fn(v[m], v[m], v[m - 1], v[m - 1], f - m) - v[m]);\n      }\n      return fn(\n        v[i ? i - 1 : 0],\n        v[i],\n        v[m < i + 1 ? m : i + 1],\n        v[m < i + 2 ? m : i + 2],\n        f - i\n      );\n    }\n  },\n\n  Utils: {\n    Linear: function (p0: number, p1: number, t: number): number {\n      return (p1 - p0) * t + p0;\n    },\n    Factorial: (function () {\n      const a = [1];\n      return function (n: number): number {\n        let s = 1;\n        if (a[n]) {\n          return a[n];\n        }\n        for (let i = n; i > 1; i--) {\n          s *= i;\n        }\n        a[n] = s;\n        return s;\n      };\n    })(),\n    Bernstein: function (n: number, i: number): number {\n      const fc = Interpolation.Utils.Factorial;\n      return fc(n) / fc(i) / fc(n - i);\n    },\n    CatmullRom: function (\n      p0: number,\n      p1: number,\n      p2: number,\n      p3: number,\n      t: number\n    ): number {\n      const v0 = (p2 - p0) * 0.5;\n      const v1 = (p3 - p1) * 0.5;\n      const t2 = t * t;\n      const t3 = t * t2;\n      return (\n        (2 * p1 - 2 * p2 + v0 + v1) * t3 +\n        (-3 * p1 + 3 * p2 - 2 * v0 - v1) * t2 +\n        v0 * t +\n        p1\n      );\n    }\n  }\n};\n\nexport default Interpolation;\n","export default class Sequence {\n  private static _nextId = 0;\n\n  static nextId(): number {\n    return Sequence._nextId++;\n  }\n}\n","import Group from \"./Group\";\n\nexport const mainGroup = new Group();\n","import Easing from \"./Easing\";\nimport Interpolation from \"./Interpolation\";\nimport { mainGroup } from \"./mainGroup\";\nimport Sequence from \"./Sequence\";\nimport now from \"./Now\";\n\nimport type { EasingFunction } from \"./Easing\";\nimport type { InterpolationFunction } from \"./Interpolation\";\nimport type Group from \"./Group\";\n\nexport type UnknownProps = Record<string, any>;\n\nexport class Tween<T extends UnknownProps> {\n  // id\n  private _id = Sequence.nextId();\n\n  // 是否正在执行\n  private _isPlaying = false;\n  // 动画开始时间\n  private _startTime = 0;\n  // 动画延迟时间\n  private _delayTime = 0;\n  // 动画持续时间\n  private _durationTime = 1000;\n\n  // 是否暂停\n  private _isPaused = false;\n  // 暂停开始时间\n  private _pauseStartTime = 0;\n\n  // 动画重复次数初始值\n  private _initialRepeat = 0;\n  // 动画重复次数剩余值\n  private _repeat = 0;\n  // 动画重复间隔\n  private _repeatDelayTime?: number;\n  // 动画重复时是否倒置\n  private _yoyo = false;\n  // 是否倒置运行\n  private _reversed = false;\n\n  // 初始值\n  private _valuesStart: UnknownProps = {};\n  // 结束值\n  private _valuesEnd: Record<string, number | string> = {};\n  // reverse时的初始值\n  private _valuesStartRepeat: UnknownProps = {};\n\n  // 缓动函数\n  private _easingFunction: EasingFunction = Easing.Linear.None;\n  // 插值函数\n  private _interpolationFunction: InterpolationFunction = Interpolation.Linear;\n\n  // 链式动画数组\n  private _chainedTweens: Array<Tween<any>> = [];\n  // 链式动画是否已停止\n  private _isChainStopped = false;\n\n  // 动画开始hook\n  private _onStartCallback?: (object: T) => void;\n  // 动画开始hook是否已被执行\n  private _onStartCallbackFired = false;\n  // 动画每轮repeat开始hook\n  private _onEveryStartCallback?: (object: T) => void;\n  // 动画每轮repeat开始hook是否已被执行\n  private _onEveryStartCallbackFired = false;\n  // 动画更新hook\n  private _onUpdateCallback?: (object: T, elapsed: number) => void;\n  // 动画repeat hook\n  private _onRepeatCallback?: (object: T) => void;\n  // 动画完成hook\n  private _onCompleteCallback?: (object: T) => void;\n  // 动画结束hook\n  private _onStopCallback?: (object: T) => void;\n  // 是否强制结束动画\n  private _goToEnd = false;\n\n  constructor(private _object: T, private _group: Group | false = mainGroup) {}\n\n  getId(): number {\n    return this._id;\n  }\n\n  isPlaying(): boolean {\n    return this._isPlaying;\n  }\n\n  isPaused(): boolean {\n    return this._isPaused;\n  }\n\n  to(properties: UnknownProps, duration?: number): this {\n    this._valuesEnd = Object.create(properties);\n    if (duration !== undefined) {\n      this._durationTime = duration;\n    }\n    return this;\n  }\n\n  duration(d = 1000): this {\n    this._durationTime = d;\n    return this;\n  }\n\n  start(time: number = now()): this {\n    if (this._isPlaying) {\n      return this;\n    }\n    this._group && this._group.add(this as Tween<UnknownProps>);\n    this._repeat = this._initialRepeat;\n    if (this._reversed) {\n      this._reversed = false;\n      for (const property in this._valuesStartRepeat) {\n        this._swapEndStartRepeatValues(property);\n        this._valuesStart[property] = this._valuesStartRepeat[property];\n      }\n    }\n    this._isPlaying = true;\n    this._isPaused = false;\n    this._onStartCallbackFired = false;\n    this._onEveryStartCallbackFired = false;\n    this._isChainStopped = false;\n    this._startTime = time;\n    this._startTime += this._delayTime;\n    this._setupProperties(\n      this._object,\n      this._valuesStart,\n      this._valuesEnd,\n      this._valuesStartRepeat\n    );\n    return this;\n  }\n\n  private _setupProperties(\n    _object: UnknownProps,\n    _valuesStart: UnknownProps,\n    _valuesEnd: UnknownProps,\n    _valuesStartRepeat: UnknownProps\n  ): void {\n    for (const property in _valuesEnd) {\n      const startValue = _object[property];\n      const startValueIsArray = Array.isArray(startValue);\n      const propType = startValueIsArray ? \"array\" : typeof startValue;\n      const isInterpolationList =\n        !startValueIsArray && Array.isArray(_valuesEnd[property]);\n      if (propType === \"undefined\" || propType === \"function\") {\n        continue;\n      }\n      if (isInterpolationList) {\n        let endValues = _valuesEnd[property] as Array<number | string>;\n        if (endValues.length === 0) {\n          continue;\n        }\n        endValues = endValues.map(\n          this._handleRelativeValue.bind(this, startValue as number)\n        );\n        _valuesEnd[property] = [startValue].concat(endValues);\n      }\n      if (\n        (propType === \"object\" || startValueIsArray) &&\n        startValue &&\n        !isInterpolationList\n      ) {\n        _valuesStart[property] = startValueIsArray ? [] : {};\n        for (const prop in startValue as object) {\n          _valuesStart[property][prop] = startValue[prop];\n        }\n        _valuesStartRepeat[property] = startValueIsArray ? [] : {}; // TODO? repeat nested values? And yoyo? And array values?\n        this._setupProperties(\n          startValue,\n          _valuesStart[property],\n          _valuesEnd[property],\n          _valuesStartRepeat[property]\n        );\n      } else {\n        if (typeof _valuesStart[property] === \"undefined\") {\n          _valuesStart[property] = startValue;\n        }\n        if (!startValueIsArray) {\n          _valuesStart[property] *= 1.0;\n        }\n        if (isInterpolationList) {\n          _valuesStartRepeat[property] = _valuesEnd[property].slice().reverse();\n        } else {\n          _valuesStartRepeat[property] = _valuesStart[property] || 0;\n        }\n      }\n    }\n  }\n\n  stop(): this {\n    if (!this._isChainStopped) {\n      this._isChainStopped = true;\n      this.stopChainedTweens();\n    }\n    if (!this._isPlaying) {\n      return this;\n    }\n    this._group && this._group.remove(this as Tween<UnknownProps>);\n    this._isPlaying = false;\n    this._isPaused = false;\n    if (this._onStopCallback) {\n      this._onStopCallback(this._object);\n    }\n    return this;\n  }\n\n  end(): this {\n    this._goToEnd = true;\n    this.update(Infinity);\n    return this;\n  }\n\n  pause(time: number = now()): this {\n    if (this._isPaused || !this._isPlaying) {\n      return this;\n    }\n    this._isPaused = true;\n    this._pauseStartTime = time;\n    this._group && this._group.remove(this as Tween<UnknownProps>);\n    return this;\n  }\n\n  resume(time: number = now()): this {\n    if (!this._isPaused || !this._isPlaying) {\n      return this;\n    }\n    this._isPaused = false;\n    this._startTime += time - this._pauseStartTime;\n    this._pauseStartTime = 0;\n    this._group && this._group.add(this as Tween<UnknownProps>);\n    return this;\n  }\n\n  stopChainedTweens(): this {\n    for (\n      let i = 0, numChainedTweens = this._chainedTweens.length;\n      i < numChainedTweens;\n      i++\n    ) {\n      this._chainedTweens[i].stop();\n    }\n    return this;\n  }\n\n  group(group = mainGroup): this {\n    this._group = group;\n    return this;\n  }\n\n  delay(amount = 0): this {\n    this._delayTime = amount;\n    return this;\n  }\n\n  repeat(times = 0): this {\n    this._initialRepeat = times;\n    this._repeat = times;\n    return this;\n  }\n\n  repeatDelay(amount?: number): this {\n    this._repeatDelayTime = amount;\n    return this;\n  }\n\n  yoyo(yoyo = false): this {\n    this._yoyo = yoyo;\n    return this;\n  }\n\n  easing(easingFunction: EasingFunction = Easing.Linear.None): this {\n    this._easingFunction = easingFunction;\n    return this;\n  }\n\n  interpolation(\n    interpolationFunction: InterpolationFunction = Interpolation.Linear\n  ): this {\n    this._interpolationFunction = interpolationFunction;\n    return this;\n  }\n\n  chain(...tweens: Array<Tween<any>>): this {\n    this._chainedTweens = tweens;\n    return this;\n  }\n\n  onStart(callback?: (object: T) => void): this {\n    this._onStartCallback = callback;\n    return this;\n  }\n\n  onEveryStart(callback?: (object: T) => void): this {\n    this._onEveryStartCallback = callback;\n    return this;\n  }\n\n  onUpdate(callback?: (object: T, elapsed: number) => void): this {\n    this._onUpdateCallback = callback;\n    return this;\n  }\n\n  onRepeat(callback?: (object: T) => void): this {\n    this._onRepeatCallback = callback;\n    return this;\n  }\n\n  onComplete(callback?: (object: T) => void): this {\n    this._onCompleteCallback = callback;\n    return this;\n  }\n\n  onStop(callback?: (object: T) => void): this {\n    this._onStopCallback = callback;\n    return this;\n  }\n\n  /**\n   * @returns true if the tween is still playing after the update, false otherwise\n   */\n  update(time = now(), autoStart = true): boolean {\n    if (this._isPaused) return true;\n    let property;\n    let elapsed;\n    const endTime = this._startTime + this._durationTime;\n    if (!this._goToEnd && !this._isPlaying) {\n      if (time > endTime) return false;\n      if (autoStart) this.start(time);\n    }\n    this._goToEnd = false;\n    if (time < this._startTime) {\n      return true;\n    }\n    if (this._onStartCallbackFired === false) {\n      if (this._onStartCallback) {\n        this._onStartCallback(this._object);\n      }\n      this._onStartCallbackFired = true;\n    }\n    if (this._onEveryStartCallbackFired === false) {\n      if (this._onEveryStartCallback) {\n        this._onEveryStartCallback(this._object);\n      }\n      this._onEveryStartCallbackFired = true;\n    }\n    elapsed = (time - this._startTime) / this._durationTime;\n    elapsed = this._durationTime === 0 || elapsed > 1 ? 1 : elapsed;\n    const value = this._easingFunction(elapsed);\n    this._updateProperties(\n      this._object,\n      this._valuesStart,\n      this._valuesEnd,\n      value\n    );\n    if (this._onUpdateCallback) {\n      this._onUpdateCallback(this._object, elapsed);\n    }\n    if (elapsed === 1) {\n      if (this._repeat > 0) {\n        if (isFinite(this._repeat)) {\n          this._repeat--;\n        }\n        for (property in this._valuesStartRepeat) {\n          if (!this._yoyo && typeof this._valuesEnd[property] === \"string\") {\n            this._valuesStartRepeat[property] =\n              this._valuesStartRepeat[property] +\n              parseFloat(this._valuesEnd[property] as string);\n          }\n          if (this._yoyo) {\n            this._swapEndStartRepeatValues(property);\n          }\n          this._valuesStart[property] = this._valuesStartRepeat[property];\n        }\n        if (this._yoyo) {\n          this._reversed = !this._reversed;\n        }\n        if (this._repeatDelayTime !== undefined) {\n          this._startTime = time + this._repeatDelayTime;\n        } else {\n          this._startTime = time + this._delayTime;\n        }\n        if (this._onRepeatCallback) {\n          this._onRepeatCallback(this._object);\n        }\n        this._onEveryStartCallbackFired = false;\n        return true;\n      } else {\n        if (this._onCompleteCallback) {\n          this._onCompleteCallback(this._object);\n        }\n        for (\n          let i = 0, numChainedTweens = this._chainedTweens.length;\n          i < numChainedTweens;\n          i++\n        ) {\n          // Make the chained tweens start exactly at the time they should,\n          // even if the `update()` method was called way past the duration of the tween\n          this._chainedTweens[i].start(this._startTime + this._durationTime);\n        }\n        this._isPlaying = false;\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private _updateProperties(\n    _object: UnknownProps,\n    _valuesStart: UnknownProps,\n    _valuesEnd: UnknownProps,\n    value: number\n  ): void {\n    for (const property in _valuesEnd) {\n      if (_valuesStart[property] === undefined) {\n        continue;\n      }\n      const start = _valuesStart[property] || 0;\n      let end = _valuesEnd[property];\n      const startIsArray = Array.isArray(_object[property]);\n      const endIsArray = Array.isArray(end);\n      const isInterpolationList = !startIsArray && endIsArray;\n      if (isInterpolationList) {\n        _object[property] = this._interpolationFunction(\n          end as Array<number>,\n          value\n        );\n      } else if (typeof end === \"object\" && end) {\n        this._updateProperties(_object[property], start, end, value);\n      } else {\n        end = this._handleRelativeValue(\n          start as number,\n          end as number | string\n        );\n        if (typeof end === \"number\") {\n          _object[property] = start + (end - start) * value;\n        }\n      }\n    }\n  }\n\n  // Parses relative end values with start as base (e.g.: +10, -3)\n  private _handleRelativeValue(start: number, end: number | string): number {\n    if (typeof end !== \"string\") {\n      return end;\n    }\n    if (end.charAt(0) === \"+\" || end.charAt(0) === \"-\") {\n      return start + parseFloat(end);\n    } else {\n      return parseFloat(end);\n    }\n  }\n\n  private _swapEndStartRepeatValues(property: string): void {\n    const tmp = this._valuesStartRepeat[property];\n    const endValue = this._valuesEnd[property];\n    if (typeof endValue === \"string\") {\n      this._valuesStartRepeat[property] =\n        this._valuesStartRepeat[property] + parseFloat(endValue);\n    } else {\n      this._valuesStartRepeat[property] = endValue;\n    }\n    this._valuesEnd[property] = tmp;\n  }\n}\n\nexport default Tween;\n","import Easing from \"./Easing\";\nimport Group from \"./Group\";\nimport Interpolation from \"./Interpolation\";\nimport now from \"./Now\";\nimport Sequence from \"./Sequence\";\nimport Tween from \"./Tween\";\nimport { mainGroup } from \"./mainGroup\";\n\nconst nextId = Sequence.nextId;\n\n// This is the best way to export things in a way that's compatible with both ES\n// Modules and CommonJS, without build hacks, and so as not to break the\n// existing API.\n// https://github.com/rollup/rollup/issues/1961#issuecomment-423037881\nconst getAll = mainGroup.getAll.bind(mainGroup);\nconst removeAll = mainGroup.removeAll.bind(mainGroup);\nconst add = mainGroup.add.bind(mainGroup);\nconst remove = mainGroup.remove.bind(mainGroup);\nconst update = mainGroup.update.bind(mainGroup);\n\nexport const TWEEN = {\n  Easing,\n  Group,\n  Interpolation,\n  now,\n  Sequence,\n  nextId,\n  Tween,\n  getAll,\n  removeAll,\n  add,\n  remove,\n  update\n};\nexport default TWEEN;\n","// from https://github.com/chrisaljoudi/transformatrix.js\n\nclass Matrix {\n  /**\n    (1, 0, 0)\n    (0, 1, 0)\n  */\n  constructor(m) {\n    m = m || [1, 0, 0, 1, 0, 0];\n    this.m = [m[0], m[1], m[2], m[3], m[4], m[5]];\n  }\n\n  unit() {\n    this.m = [1, 0, 0, 1, 0, 0];\n    return this;\n  }\n\n  multiply(m) {\n    const m1 = this.m;\n    let m2;\n\n    if (m instanceof Matrix) {\n      m2 = m.m;\n    } else {\n      m2 = m;\n    }\n\n    const m11 = m1[0] * m2[0] + m1[2] * m2[1],\n      m12 = m1[1] * m2[0] + m1[3] * m2[1],\n      m21 = m1[0] * m2[2] + m1[2] * m2[3],\n      m22 = m1[1] * m2[2] + m1[3] * m2[3];\n\n    const dx = m1[0] * m2[4] + m1[2] * m2[5] + m1[4],\n      dy = m1[1] * m2[4] + m1[3] * m2[5] + m1[5];\n\n    m1[0] = m11;\n    m1[1] = m12;\n    m1[2] = m21;\n    m1[3] = m22;\n    m1[4] = dx;\n    m1[5] = dy;\n\n    return this;\n  }\n\n  inverse() {\n    const inv = new Matrix(this.m),\n      invm = inv.m;\n\n    const d = 1 / (invm[0] * invm[3] - invm[1] * invm[2]),\n      m0 = invm[3] * d,\n      m1 = -invm[1] * d,\n      m2 = -invm[2] * d,\n      m3 = invm[0] * d,\n      m4 = d * (invm[2] * invm[5] - invm[3] * invm[4]),\n      m5 = d * (invm[1] * invm[4] - invm[0] * invm[5]);\n\n    invm[0] = m0;\n    invm[1] = m1;\n    invm[2] = m2;\n    invm[3] = m3;\n    invm[4] = m4;\n    invm[5] = m5;\n\n    return inv;\n  }\n\n  /**\n    (1, 0, sx)\n    (0, 1, sy)\n  */\n  translate(x, y) {\n    return this.multiply([1, 0, 0, 1, x, y]);\n  }\n\n  /**\n    (cos, -sin, 0)\n    (sin, cos, 0)\n  */\n  rotate(deg) {\n    const rad = (deg * Math.PI) / 180,\n      c = Math.cos(rad),\n      s = Math.sin(rad);\n\n    return this.multiply([c, s, -s, c, 0, 0]);\n  }\n\n  /**\n    (1, tx, 0)\n    (ty, 1, 0)\n  */\n  skew(degX, degY) {\n    degY |= 0;\n    const radX = (degX * Math.PI) / 180,\n      radY = (degY * Math.PI) / 180;\n    const tx = Math.tan(radX),\n      ty = Math.tan(radY);\n\n    return this.multiply([1, ty, tx, 1, 0, 0]);\n  }\n\n  /**\n    (sx, 0, 0)\n    (0, sy, 0)\n  */\n  scale(sx, sy) {\n    return this.multiply([sx, 0, 0, sy, 0, 0]);\n  }\n\n  transformPoint = function (px, py) {\n    const x = px,\n      y = py;\n    px = x * this.m[0] + y * this.m[2] + this.m[4];\n    py = x * this.m[1] + y * this.m[3] + this.m[5];\n\n    return [px, py];\n  };\n\n  transformVector(px, py) {\n    const x = px,\n      y = py;\n    px = x * this.m[0] + y * this.m[2];\n    py = x * this.m[1] + y * this.m[3];\n\n    return [px, py];\n  }\n}\n\nexport default Matrix;\n","function createSvgPath(d) {\n  const path = document.createElementNS(\"http://www.w3.org/2000/svg\", \"path\");\n  path.setAttribute(\"d\", d);\n  return path;\n}\n\nexport function getPointAtLength(d, len) {\n  const path = createSvgPath(d);\n  const { x, y } = path.getPointAtLength(len);\n  return [x, y];\n}\n\nexport function getTotalLength(d, len) {\n  const path = createSvgPath(d);\n  return path.getTotalLength(len);\n}\n\nlet context = null;\nexport function isPointInPath({ d }, x, y) {\n  if (!context) context = document.createElement(\"canvas\").getContext(\"2d\");\n  const path = new Path2D(d);\n  return context.isPointInPath(path, x, y);\n}\n\nexport function isPointInStroke(\n  { d },\n  x,\n  y,\n  { lineWidth = 1, lineCap = \"butt\", lineJoin = \"miter\" }\n) {\n  if (!context) context = document.createElement(\"canvas\").getContext(\"2d\");\n  if (context.isPointInStroke) {\n    context.save();\n    context.lineWidth = lineWidth;\n    context.lineCap = lineCap;\n    context.lineJoin = lineJoin;\n    const path = new Path2D(d);\n    const ret = context.isPointInStroke(path, x, y);\n    context.restore();\n    return ret;\n  }\n}\n","// https://github.com/jkroso/parse-svg-path\n\n/**\n * expected argument lengths\n * @type {Object}\n */\nvar length = { a: 7, c: 6, h: 1, l: 2, m: 2, q: 4, s: 4, t: 2, v: 1, z: 0 };\n\n/**\n * segment pattern\n * @type {RegExp}\n */\nvar segment = /([astvzqmhlc])([^astvzqmhlc]*)/gi;\n\n/**\n * parse an svg path data string. Generates an Array\n * of commands where each command is an Array of the\n * form `[command, arg1, arg2, ...]`\n *\n * @param {String} path\n * @return {Array}\n */\nexport default function parse(path) {\n  var data = [];\n  path.replace(segment, function (_, command, args) {\n    var type = command.toLowerCase();\n    args = parseValues(args);\n\n    // overloaded moveTo\n    if (type == \"m\" && args.length > 2) {\n      data.push([command].concat(args.splice(0, 2)));\n      type = \"l\";\n      command = command == \"m\" ? \"l\" : \"L\";\n    }\n\n    // eslint-disable-next-line no-constant-condition\n    while (true) {\n      if (args.length == length[type]) {\n        args.unshift(command);\n        return data.push(args);\n      }\n      if (args.length < length[type]) throw new Error(\"malformed path data\");\n      data.push([command].concat(args.splice(0, length[type])));\n    }\n  });\n  return data;\n}\n\nvar number = /-?[0-9]*\\.?[0-9]+(?:e[-+]?\\d+)?/gi;\nfunction parseValues(args) {\n  var numbers = args.match(number);\n  return numbers ? numbers.map(Number) : [];\n}\n","// https://github.com/jkroso/abs-svg-path\n\n/**\n * redefine `path` with absolute coordinates\n *\n * @param {Array} path\n * @return {Array}\n */\nexport default function absolutize(path) {\n  var startX = 0;\n  var startY = 0;\n  var x = 0;\n  var y = 0;\n\n  return path.map(function (seg) {\n    seg = seg.slice();\n    var type = seg[0];\n    var command = type.toUpperCase();\n\n    // is relative\n    if (type != command) {\n      seg[0] = command;\n      switch (type) {\n        case \"a\":\n          seg[6] += x;\n          seg[7] += y;\n          break;\n        case \"v\":\n          seg[1] += y;\n          break;\n        case \"h\":\n          seg[1] += x;\n          break;\n        default:\n          for (var i = 1; i < seg.length; ) {\n            seg[i++] += x;\n            seg[i++] += y;\n          }\n      }\n    }\n\n    // update cursor state\n    switch (command) {\n      case \"Z\":\n        x = startX;\n        y = startY;\n        break;\n      case \"H\":\n        x = seg[1];\n        break;\n      case \"V\":\n        y = seg[1];\n        break;\n      case \"M\":\n        x = startX = seg[1];\n        y = startY = seg[2];\n        break;\n      default:\n        x = seg[seg.length - 2];\n        y = seg[seg.length - 1];\n    }\n\n    return seg;\n  });\n}\n","// https://github.com/colinmeinke/svg-arc-to-cubic-bezier\n//\n// Convert an arc to a sequence of cubic bézier curves\n//\n\nconst TAU = Math.PI * 2;\n\n// Calculate an angle between two unit vectors\n//\n// Since we measure angle between radii of circular arcs,\n// we can use simplified math (without length normalization)\n//\nfunction unit_vector_angle(ux, uy, vx, vy) {\n  const sign = ux * vy - uy * vx < 0 ? -1 : 1;\n  let dot = ux * vx + uy * vy;\n\n  // Add this to work with arbitrary vectors:\n  // dot /= Math.sqrt(ux * ux + uy * uy) * Math.sqrt(vx * vx + vy * vy);\n\n  // rounding errors, e.g. -1.0000000000000002 can screw up this\n  if (dot > 1.0) {\n    dot = 1.0;\n  }\n  if (dot < -1.0) {\n    dot = -1.0;\n  }\n\n  return sign * Math.acos(dot);\n}\n\n// Convert from endpoint to center parameterization,\n// see http://www.w3.org/TR/SVG11/implnote.html#ArcImplementationNotes\n//\n// Return [cx, cy, theta1, delta_theta]\n//\nfunction get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi) {\n  // Step 1.\n  //\n  // Moving an ellipse so origin will be the middlepoint between our two\n  // points. After that, rotate it to line up ellipse axes with coordinate\n  // axes.\n  //\n  const x1p = (cos_phi * (x1 - x2)) / 2 + (sin_phi * (y1 - y2)) / 2;\n  const y1p = (-sin_phi * (x1 - x2)) / 2 + (cos_phi * (y1 - y2)) / 2;\n\n  const rx_sq = rx * rx;\n  const ry_sq = ry * ry;\n  const x1p_sq = x1p * x1p;\n  const y1p_sq = y1p * y1p;\n\n  // Step 2.\n  //\n  // Compute coordinates of the centre of this ellipse (cx', cy')\n  // in the new coordinate system.\n  //\n  let radicant = rx_sq * ry_sq - rx_sq * y1p_sq - ry_sq * x1p_sq;\n\n  if (radicant < 0) {\n    // due to rounding errors it might be e.g. -1.3877787807814457e-17\n    radicant = 0;\n  }\n\n  radicant /= rx_sq * y1p_sq + ry_sq * x1p_sq;\n  radicant = Math.sqrt(radicant) * (fa === fs ? -1 : 1);\n\n  const cxp = ((radicant * rx) / ry) * y1p;\n  const cyp = ((radicant * -ry) / rx) * x1p;\n\n  // Step 3.\n  //\n  // Transform back to get centre coordinates (cx, cy) in the original\n  // coordinate system.\n  //\n  const cx = cos_phi * cxp - sin_phi * cyp + (x1 + x2) / 2;\n  const cy = sin_phi * cxp + cos_phi * cyp + (y1 + y2) / 2;\n\n  // Step 4.\n  //\n  // Compute angles (theta1, delta_theta).\n  //\n  const v1x = (x1p - cxp) / rx;\n  const v1y = (y1p - cyp) / ry;\n  const v2x = (-x1p - cxp) / rx;\n  const v2y = (-y1p - cyp) / ry;\n\n  const theta1 = unit_vector_angle(1, 0, v1x, v1y);\n  let delta_theta = unit_vector_angle(v1x, v1y, v2x, v2y);\n\n  if (fs === 0 && delta_theta > 0) {\n    delta_theta -= TAU;\n  }\n  if (fs === 1 && delta_theta < 0) {\n    delta_theta += TAU;\n  }\n\n  return [cx, cy, theta1, delta_theta];\n}\n\n//\n// Approximate one unit arc segment with bézier curves,\n// see http://math.stackexchange.com/questions/873224\n//\nfunction approximate_unit_arc(theta1, delta_theta) {\n  const alpha = (4 / 3) * Math.tan(delta_theta / 4);\n\n  const x1 = Math.cos(theta1);\n  const y1 = Math.sin(theta1);\n  const x2 = Math.cos(theta1 + delta_theta);\n  const y2 = Math.sin(theta1 + delta_theta);\n\n  return [\n    x1,\n    y1,\n    x1 - y1 * alpha,\n    y1 + x1 * alpha,\n    x2 + y2 * alpha,\n    y2 - x2 * alpha,\n    x2,\n    y2\n  ];\n}\n\nexport default function a2c(x1, y1, x2, y2, fa, fs, rx, ry, phi) {\n  const sin_phi = Math.sin((phi * TAU) / 360);\n  const cos_phi = Math.cos((phi * TAU) / 360);\n\n  // Make sure radii are valid\n  //\n  const x1p = (cos_phi * (x1 - x2)) / 2 + (sin_phi * (y1 - y2)) / 2;\n  const y1p = (-sin_phi * (x1 - x2)) / 2 + (cos_phi * (y1 - y2)) / 2;\n\n  if (x1p === 0 && y1p === 0) {\n    // we're asked to draw line to itself\n    return [];\n  }\n\n  if (rx === 0 || ry === 0) {\n    // one of the radii is zero\n    return [];\n  }\n\n  // Compensate out-of-range radii\n  //\n  rx = Math.abs(rx);\n  ry = Math.abs(ry);\n\n  const lambda = (x1p * x1p) / (rx * rx) + (y1p * y1p) / (ry * ry);\n  if (lambda > 1) {\n    rx *= Math.sqrt(lambda);\n    ry *= Math.sqrt(lambda);\n  }\n\n  // Get center parameters (cx, cy, theta1, delta_theta)\n  //\n  const cc = get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi);\n\n  const result = [];\n  let theta1 = cc[2];\n  let delta_theta = cc[3];\n\n  // Split an arc to multiple segments, so each segment\n  // will be less than τ/4 (= 90°)\n  //\n  const segments = Math.max(Math.ceil(Math.abs(delta_theta) / (TAU / 4)), 1);\n  delta_theta /= segments;\n\n  for (let i = 0; i < segments; i++) {\n    result.push(approximate_unit_arc(theta1, delta_theta));\n    theta1 += delta_theta;\n  }\n\n  // We have a bezier approximation of a unit circle,\n  // now need to transform back to the original ellipse\n  //\n  return result.map((curve) => {\n    for (let i = 0; i < curve.length; i += 2) {\n      let x = curve[i + 0];\n      let y = curve[i + 1];\n\n      // scale\n      x *= rx;\n      y *= ry;\n\n      // rotate\n      const xp = cos_phi * x - sin_phi * y;\n      const yp = sin_phi * x + cos_phi * y;\n\n      // translate\n      curve[i + 0] = xp + cc[0];\n      curve[i + 1] = yp + cc[1];\n    }\n\n    return curve;\n  });\n}\n","// https://github.com/jkroso/normalize-svg-path\nimport a2c from \"./a2c\";\n\nexport default function normalize(path) {\n  // init state\n  var prev;\n  var result = [];\n  var bezierX = 0;\n  var bezierY = 0;\n  var startX = 0;\n  var startY = 0;\n  var quadX = null;\n  var quadY = null;\n  var x = 0;\n  var y = 0;\n\n  for (var i = 0, len = path.length; i < len; i++) {\n    var seg = path[i];\n    var command = seg[0];\n\n    switch (command) {\n      case \"M\":\n        startX = seg[1];\n        startY = seg[2];\n        break;\n      case \"A\":\n        var curves = a2c(\n          x,\n          y,\n          seg[6],\n          seg[7],\n          seg[4],\n          seg[5],\n          seg[1],\n          seg[2],\n          seg[3]\n        );\n\n        if (!curves.length) continue;\n\n        curves = curves.map((curve) => {\n          const [x0, y0, x1, y1, x2, y2, x, y] = curve;\n          return { x1, y1, x2, y2, x, y };\n        });\n\n        for (var j = 0, c; j < curves.length; j++) {\n          c = curves[j];\n          seg = [\"C\", c.x1, c.y1, c.x2, c.y2, c.x, c.y];\n          if (j < curves.length - 1) result.push(seg);\n        }\n\n        break;\n      case \"S\":\n        // default control point\n        var cx = x;\n        var cy = y;\n        if (prev == \"C\" || prev == \"S\") {\n          cx += cx - bezierX; // reflect the previous command's control\n          cy += cy - bezierY; // point relative to the current point\n        }\n        seg = [\"C\", cx, cy, seg[1], seg[2], seg[3], seg[4]];\n        break;\n      case \"T\":\n        if (prev == \"Q\" || prev == \"T\") {\n          quadX = x * 2 - quadX; // as with 'S' reflect previous control point\n          quadY = y * 2 - quadY;\n        } else {\n          quadX = x;\n          quadY = y;\n        }\n        seg = quadratic(x, y, quadX, quadY, seg[1], seg[2]);\n        break;\n      case \"Q\":\n        quadX = seg[1];\n        quadY = seg[2];\n        seg = quadratic(x, y, seg[1], seg[2], seg[3], seg[4]);\n        break;\n      case \"L\":\n        seg = line(x, y, seg[1], seg[2]);\n        break;\n      case \"H\":\n        seg = line(x, y, seg[1], y);\n        break;\n      case \"V\":\n        seg = line(x, y, x, seg[1]);\n        break;\n      case \"Z\":\n        seg = line(x, y, startX, startY);\n        break;\n    }\n\n    // update state\n    prev = command;\n    x = seg[seg.length - 2];\n    y = seg[seg.length - 1];\n    if (seg.length > 4) {\n      bezierX = seg[seg.length - 4];\n      bezierY = seg[seg.length - 3];\n    } else {\n      bezierX = x;\n      bezierY = y;\n    }\n    result.push(seg);\n  }\n\n  return result;\n}\n\nfunction line(x1, y1, x2, y2) {\n  return [\"C\", x1, y1, x2, y2, x2, y2];\n}\n\nfunction quadratic(x1, y1, cx, cy, x2, y2) {\n  return [\n    \"C\",\n    x1 / 3 + (2 / 3) * cx,\n    y1 / 3 + (2 / 3) * cy,\n    x2 / 3 + (2 / 3) * cx,\n    y2 / 3 + (2 / 3) * cy,\n    x2,\n    y2\n  ];\n}\n","// https://github.com/dy/is-svg-path\n\n// isSvgPath('M0 0L10 20 20 0Z') //true\n// isSvgPath('M00Z') //false\n// isSvgPath('xyz') //false\nexport default function isSvgPath(str) {\n  if (typeof str !== \"string\") return false;\n  str = str.trim();\n  // https://www.w3.org/TR/SVG/paths.html#PathDataBNF\n  return (\n    /^[mzlhvcsqta]\\s*[-+.0-9][^mlhvzcsqta]+/i.test(str) &&\n    /[\\dz]$/i.test(str) &&\n    str.length > 4\n  );\n}\n","// https://developer.mozilla.org/en-US/docs/Web/API/Path2D\n\nimport { Matrix } from \"../sprite-math\";\n// import {\n//   isPointInPath,\n//   isPointInStroke,\n//   getPointAtLength,\n//   getTotalLength\n// } from \"./platform-node\";\nimport {\n  isPointInPath,\n  isPointInStroke,\n  getPointAtLength,\n  getTotalLength\n} from \"./platform-browser\";\nimport parse from \"./parse-svg-path\";\nimport abs from \"./abs-svg-path\";\nimport normalize from \"./normalize-svg-path\";\nimport isSvgPath from \"./is-svg-path\";\n\nconst _initialPath = Symbol(\"initialPath\");\nconst _path = Symbol(\"path\");\nconst _bounds = Symbol(\"bounds\");\nconst _savedPaths = Symbol(\"savedPaths\");\nconst _renderProps = Symbol(\"renderProps\");\nconst _beginPath = Symbol(\"beginPath\");\n\nexport class SvgPath {\n  constructor(d) {\n    if (!isSvgPath(d)) {\n      throw new Error(\"Not an SVG path!\");\n    }\n\n    this[_initialPath] = abs(parse(d));\n    this[_path] = normalize(this[_initialPath]);\n    this[_bounds] = null;\n    this[_savedPaths] = [];\n    this[_renderProps] = {};\n    this[_beginPath] = false;\n  }\n\n  save() {\n    this[_savedPaths].push({\n      path: this[_path],\n      bounds: this[_bounds],\n      renderProps: Object.assign({}, this[_renderProps])\n    });\n    return this;\n  }\n\n  restore() {\n    if (this[_savedPaths].length) {\n      const { path, bounds, renderProps } = this[_savedPaths].pop();\n      this[_path] = path;\n      this[_bounds] = bounds;\n      this[_renderProps] = renderProps;\n    }\n    return this;\n  }\n\n  get bounds() {\n    if (!this[_bounds]) {\n      const path = this[_path];\n      this[_bounds] = [0, 0, 0, 0];\n      if (path.length) {\n        const bounds = [Infinity, Infinity, -Infinity, -Infinity];\n\n        for (let i = 0, l = path.length; i < l; i++) {\n          const points = path[i].slice(1);\n\n          for (let j = 0; j < points.length; j += 2) {\n            if (points[j + 0] < bounds[0]) bounds[0] = points[j + 0];\n            if (points[j + 1] < bounds[1]) bounds[1] = points[j + 1];\n            if (points[j + 0] > bounds[2]) bounds[2] = points[j + 0];\n            if (points[j + 1] > bounds[3]) bounds[3] = points[j + 1];\n          }\n        }\n        this[_bounds] = bounds;\n      }\n    }\n    return this[_bounds];\n  }\n\n  get size() {\n    const bounds = this.bounds;\n    return [bounds[2] - bounds[0], bounds[3] - bounds[1]];\n  }\n\n  get center() {\n    const [x0, y0, x1, y1] = this.bounds;\n    return [(x0 + x1) / 2, (y0 + y1) / 2];\n  }\n\n  get d() {\n    let path = this[_path]\n      .map((p) => {\n        const [c, ...points] = p;\n        return c + points.join();\n      })\n      .join(\"\");\n    if (this.isClosed) {\n      path += \"Z\";\n    }\n    return path;\n  }\n\n  get path() {\n    return this[_path];\n  }\n\n  get isClosed() {\n    const part = this[_initialPath][this[_initialPath].length - 1];\n    return part && part[0] === \"Z\";\n  }\n\n  isPointInPath(x, y) {\n    return isPointInPath(this, x, y);\n  }\n\n  isPointInStroke(\n    x,\n    y,\n    { lineWidth = 1, lineCap = \"butt\", lineJoin = \"miter\" }\n  ) {\n    if (isPointInStroke) {\n      return isPointInStroke(this, x, y, { lineWidth, lineCap, lineJoin });\n    }\n    // node-canvas return undefined\n  }\n\n  getPointAtLength(len) {\n    return getPointAtLength(this.d, len);\n  }\n\n  getTotalLength() {\n    return getTotalLength(this.d);\n  }\n\n  transform(...args) {\n    this[_bounds] = null;\n    const m = new Matrix(args);\n    const commands = this[_path];\n    this[_path] = commands.map((c) => {\n      const [cmd, ...args] = c;\n      const transformed = [cmd];\n      for (let i = 0; i < args.length; i += 2) {\n        const x0 = args[i],\n          y0 = args[i + 1];\n        const [x, y] = m.transformPoint(x0, y0);\n        transformed.push(x, y);\n      }\n      return transformed;\n    });\n    return this;\n  }\n\n  translate(x, y) {\n    const m = new Matrix().translate(x, y);\n    return this.transform(...m.m);\n  }\n\n  rotate(deg) {\n    const m = new Matrix().rotate(deg);\n    return this.transform(...m.m);\n  }\n\n  scale(sx, sy) {\n    if (sy == null) sy = sx;\n    const m = new Matrix().scale(sx, sy);\n    return this.transform(...m.m);\n  }\n\n  skew(degX, degY) {\n    const m = new Matrix().skew(degX, degY);\n    return this.transform(...m.m);\n  }\n\n  trim() {\n    const [x, y] = this.bounds;\n    this.translate(-x, -y);\n    return this;\n  }\n\n  beginPath() {\n    this[_beginPath] = true;\n    return this;\n  }\n\n  toCanvas(context) {\n    const commands = this[_path];\n    const renderProps = this[_renderProps];\n    if (commands.length) {\n      if (this[_beginPath]) {\n        context.beginPath();\n      }\n      commands.forEach((c) => {\n        const [cmd, ...args] = c;\n        if (cmd === \"M\") {\n          context.moveTo(...args);\n        } else {\n          context.bezierCurveTo(...args);\n        }\n      });\n      if (this.isClosed) {\n        context.closePath();\n      }\n    }\n    Object.assign(context, renderProps);\n    return {\n      stroke() {\n        context.stroke();\n        return this;\n      },\n      fill() {\n        context.fill();\n        return this;\n      }\n    };\n  }\n\n  strokeStyle(value) {\n    this[_renderProps].strokeStyle = value;\n    return this;\n  }\n\n  fillStyle(value) {\n    this[_renderProps].fillStyle = value;\n    return this;\n  }\n\n  lineWidth(value) {\n    this[_renderProps].lineWidth = value;\n    return this;\n  }\n\n  lineCap(value) {\n    this[_renderProps].lineCap = value;\n    return this;\n  }\n\n  lineJoin(value) {\n    this[_renderProps].lineJoin = value;\n    return this;\n  }\n}\n"],"names":["BaseError","message","options","EnvironmentError","FileSelectCancelError","IllegalFileError","accepts","handleInputFiles","el","cb","handleDragAndDropFiles","dropZoneEl","e","selectFile","multiple","inputElement","resolve","reject","files","illegalFiles","file","getFileExtension","readeFile","fileHandler","reader","event","size","progress","fileName","isImage","isVideo","isAudio","isWordDocument","isExcelDocument","isPowerPointDocument","isJsonDocument","isXmlDocument","getFileType","slice","verified_type","buffer","fn2ObjectURL","fn","blob","onDocumentReady","check","microTask","patchDOM","oldNode","newNode","parent","attrName","attrValue","setCookie","cname","cvalue","exdays","d","expires","getCookie","name","ca","c","getCookieObject","item","acc","k","v","clearCookies","WebSocket","url","code","reason","wasClean","details","requestid","request","result","msg","data","resolution","rejection","error","value","getDocumentElement","getViewportSize","documentElement","getPageSize","viewport","isElementInViewport","rect","getPageScroll","getPageClient","getElementLeftInPage","element","actualLeft","current","getElementTopInPage","actualTop","getElementPositionInPage2","getElementPositionInPage","scroll","pageClient","getElementPositionInViewport","getPageVerticalScrollPercent","height","getMousePositionInPage","ev","pageScroll","getMousePositionInViewport","getMouseButton","getOperatingSystem","userAgent","operatingSystem","getOperatingSystemVersion","osVersion","match","getBrowserClient","client","getBrowserClientVersion","browserVersion","getUserGeolocationPromise","position","latitude","longitude","getBrowserLanguage","getTimeZone","isIOS","isAppleDevice","isAndroid","isMobile","isDarkMode","isBrowser","isNode","setRem","designWidth","docEl","dpr","rem","recalc","clientWidth","urlsafe_b64encode","str","urlsafe_b64decode","base64UrlStr","mod4","isURLRelative","path","isURL","string","givenURL","getUrlParams","query","p","getUrlParams2","obj","searchString","splits","handleURLChange","previousUrl","mutations","handleHashChange","handleHistoryChange","setTheme","theme","DOMKeyboardKeyCode","keyName","copyToClipboard","text","getSelectedText","isFocus","ele","siblings","child","isTabInView","navigateBack","navigateBack2","loadScript","src","script","getTextWidth","fontSize","fontWeight","span","width","getFixedWidthText","isNeedEllipsis","returnText","oldText","newText","arr","i","l","htmlEncode","templateData","s","arg","htmlDecode","rawContent","entities","prop","templateCompile","template","evalExpr","expr","addEventListener","type","handler","removeEventListener","stopPropagation","preventDefault","getTarget","getRelatedTarget","isBrowserSupportFileAPI","waitForStyleSheetsLoaded","document","links","loadedCount","checkAllLoaded","stylesheet","lastTime","callback","currTime","timeToCall","id","animateInWeb","render","animate","durationTime","animateCanvas","canvasID","canvas","ctx","UZIP","module","buf","onlyNames","rUs","rUi","o","out","eocd","cnu","csize","coffs","usize","nl","cl","roff","cmpr","nlen","elen","opts","off","crc","noCmpr","tot","wUi","wUs","zpd","cpr","fof","ioff","ext","t","tab","n","len","b","end","eend","buff","ns","strl","ci","opos","lvl","opt","U","goodIndex","putsE","pos","cvrd","dlen","lits","strt","prev","li","lc","bs","ebits","nc","ii","mch","dst","lgi","dgi","nice","chain","pi","dif","tl","td","dlim","maxd","j","ei","curd","oi","BFINAL","o0","l0","putsF","T","ML","MD","MH","numl","numd","numh","lset","dset","cstSize","fxdSize","dynSize","BTYPE","ltree","dtree","si","qb","qc","p8","a","tree","hst","set","rst","rsl","nxt","nnxt","prv","lz","zc","MAXL","list","hl","l2","lit","i0","i1","i2","maxl","dps","bCost","dbt","od","ch","u8","F","bitsF","bitsE","decodeTiny","makeCodes","codes2map","get17","noBuf","HLIT","HDIST","HCLEN","lmap","dmap","mx0","mx1","ebs","dcode","dlit","dbs","bl","nbuf","LL","ll","ni","mx","MAX_BITS","max_code","bits","bl_count","next_code","map","r15","val","rest","p0","imb","dt","length","u16","u32","x","pushV","tgt","sv","Z_FIXED$1","Z_BINARY","Z_TEXT","Z_UNKNOWN$1","zero$1","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH$1","MAX_MATCH$1","LENGTH_CODES$1","LITERALS$1","L_CODES$1","D_CODES$1","BL_CODES$1","HEAP_SIZE$1","MAX_BITS$1","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","d_code","dist","put_short","w","send_bits","send_code","bi_reverse","res","bi_flush","gen_bitlen","desc","stree","has_stree","extra","base","h","m","xbits","f","overflow","gen_codes","tr_static_init","init_block","bi_windup","smaller","depth","_n2","_m2","pqdownheap","compress_block","sx","build_tree","node","scan_tree","prevlen","curlen","nextlen","count","max_count","min_count","send_tree","build_bl_tree","max_blindex","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","block_mask","static_init_done","_tr_init$1","_tr_stored_block$1","stored_len","last","_tr_align$1","_tr_flush_block$1","opt_lenb","static_lenb","_tr_tally$1","_tr_init_1","_tr_stored_block_1","_tr_flush_block_1","_tr_tally_1","_tr_align_1","trees","adler32_1","adler","s1","s2","makeTable","table","crcTable","crc32_1","messages","constants$2","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","Z_NO_FLUSH$2","Z_PARTIAL_FLUSH","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY$1","Z_UNKNOWN","Z_DEFLATED$2","MAX_MEM_LEVEL","MAX_WBITS$1","DEF_MEM_LEVEL","LENGTH_CODES","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","GZIP_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","err","strm","errorCode","zero","slide_hash","wsize","HASH","flush_pending","flush_block_only","put_byte","putShortMSB","read_buf","start","longest_match","cur_match","chain_length","scan","best_len","nice_match","limit","_win","wmask","strend","scan_end1","scan_end","fill_window","_w_size","more","deflate_stored","flush","min_block","left","have","used","deflate_fast","hash_head","bflush","deflate_slow","max_insert","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","lm_init","DeflateState","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateSetHeader","head","deflateInit2","level","method","windowBits","memLevel","strategy","wrap","deflateInit","deflate$2","old_flush","header","level_flags","beg","copy","gzhead_extra","bstate","deflateEnd","status","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","input","deflateInit_1","deflateInit2_1","deflateReset_1","deflateResetKeep_1","deflateSetHeader_1","deflate_2$1","deflateEnd_1","deflateSetDictionary_1","deflateInfo","deflate_1$2","_has","key","assign","sources","source","flattenChunks","chunks","chunk","common","STR_APPLY_UIA_OK","_utf8len","q","string2buf","c2","m_pos","str_len","buf_len","buf2binstring","buf2string","max","utf16buf","c_len","utf8border","strings","ZStream","zstream","toString$1","Z_NO_FLUSH$1","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFAULT_COMPRESSION","Z_DEFAULT_STRATEGY","Z_DEFLATED$1","Deflate$1","dict","flush_mode","chunkSize","_flush_mode","deflate$1","deflator","deflateRaw$1","gzip$1","Deflate_1$1","deflate_2","deflateRaw_1$1","gzip_1$1","constants$1","deflate_1$1","BAD$1","TYPE$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","lmask","dmask","here","op","from","from_source","output","state","top","dolen","dodist","MAXBITS","ENOUGH_LENS$1","ENOUGH_DISTS$1","CODES$1","LENS$1","DISTS$1","lbase","lext","dbase","dext","inftrees","lens","lens_index","codes","table_index","work","sym","min","root","curr","drop","huff","incr","fill","low","mask","offs","here_bits","here_op","here_val","CODES","LENS","DISTS","Z_FINISH$1","Z_BLOCK","Z_TREES","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","Z_BUF_ERROR","Z_DEFLATED","HEAD","FLAGS","TIME","OS","EXLEN","EXTRA","NAME","COMMENT","HCRC","DICTID","DICT","TYPE","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","BAD","MEM","SYNC","ENOUGH_LENS","ENOUGH_DISTS","DEF_WBITS","zswap32","InflateState","inflateStateCheck","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","inflateInit","virgin","lenfix","distfix","fixedtables","updatewindow","inflate$2","put","last_bits","last_op","last_val","hbuf","order","inf_leave","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflateReset_1","inflateReset2_1","inflateResetKeep_1","inflateInit_1","inflateInit2_1","inflate_2$1","inflateEnd_1","inflateGetHeader_1","inflateSetDictionary_1","inflateInfo","inflate_1$2","GZheader","gzheader","toString","Z_NO_FLUSH","Z_FINISH","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Inflate$1","last_avail_out","next_out_utf8","tail","utf8str","inflate$1","inflator","inflateRaw$1","Inflate_1$1","inflate_2","inflateRaw_1$1","ungzip$1","constants","inflate_1$1","Deflate","deflate","deflateRaw","gzip","Inflate","inflate","inflateRaw","ungzip","Deflate_1","deflate_1","deflateRaw_1","gzip_1","Inflate_1","inflate_1","inflateRaw_1","ungzip_1","constants_1","pako","UPNG","frms","img","empty","frm","fx","fy","fw","fh","fdata","area","bpp","bpl","bf","bf32","ctype","rs","qarea","ts","ti","tr","tg","tb","qi","ap","y","s0","t0","cj","di","gr","to","al","offset","bin","dd","doff","fd","foff","mgck","fr","rct","del","nz","keyw","bfr","cflag","pl","H","N","W","R","J","Q","X","u","C","V","A","M","I","Z","D","K","r","S","z","_","$","Y","cbpp","starting_row","starting_col","row_increment","col_increment","pass","ri","sw","sh","cr","cc","bpll","row","col","cdi","paeth","pa","pb","pc","sb","tw","th","xoff","yoff","mode","fa","fg","fb","ba","br","bg","bb","ifa","oa","ioa","bufs","ps","dels","tabs","forbidPlte","nimg","ac","bipp","bipl","wAs","anim","pltAlpha","leng","dl","wr","g","fi","imgd","filter","levelZero","nh","prms","onlyBlend","evenCrd","forbidPrev","minBits","alphaAnd","ilen","gotAlpha","cmap","plte","inds","nbufs","abuf","qres","cof","bln","img32","nw","ind","cmc","cimg","inj","alwaysBlend","cimg32","nx","ny","blend","tlim","tstp","tarea","it","p32","mix","miy","may","sarea","pimg","r0","r1","miX","miY","maX","maY","U8","U32","pimg32","cx","cy","rec","fls","ftry","CMPR","tsize","oimg","nimg32","KD","leafs","planeDst","nd","maxL","mi","ln","rn","node0","node1","est","d0","d1","d2","d3","eMq","vecDot","stats","m0","m1","m2","m3","iN","Rj","tmi","eMq255","tlen","noff","il","getRawImgInfo","imgUrl","image","getImgInfo","typeArr","fileType","imageType","getImageType","fileOrBlobToDataURL","dataUrl","rawInfo","imageData","getCanvasImgData","imgInfo","first4Byte","getCanvasImgDataByVideo","video","getCanvasImgDataByBitmap","imageBitmap","imageDataToBitmap","biWidth","biHeight","biSizeImage","bfSize","BITMAPFILEHEADER","BITMAPINFOHEADER","iPadding","aImgData","strPixelData","biWidth4","fromCharCode","iOffsetY","strPixelRow","iOffsetX","encodeData","imageDataToDataURL","imageDataToBlob","exportImageType","toImageType","blobToImage","blobToExport","imgName","objUrl","loadImage","lazyloadImages","imgs","viewHeight","getImageMainColor","canvasImageData","arrR","arrG","arrB","_getArryWeightValue","G","B","existArr","duplicationArr","duplicationCount","maxIndex","flipSideToSide","newImgData","startIndex","flipUpsideDown","leftRotate","rightRotate","toGrey","avgColor","toBlackAndWhite","newColor","toOpposite","toRed","toGreen","toBlue","toRedAndGreen","toRedAndBlue","toBlueAndGreen","toRedAndGrey","greyColor","toGreenAndGrey","toBlueAndGrey","sharpen","convolutionMatrix","marginSharpen","jpgToPng","pngToJpg","colorStacks","rectClip","newWidth","newHeight","retainOriginalSize","finalLeft","finalTop","finalWidth","finalHeight","startIndex2","radiusClip","borderRadius","jpgToPNG","finalRadius","changeSize","maxWidthHeight","changeBrightness","changeNum","changeDiaphaneity","fixedDiaphaneity","addWatermark","watermarkImageData","watermarkData","watermarkWidth","watermarkHeight","watermarkStartIndex","aboveColor","belowColor","finalColor","mosaic","mosaicWidth","mosaicHeight","mosaicSize","boxXIndex","boxYIndex","mosaicBoxColorX","mosaicBoxColorY","mosaicBoxColorIndex","compression","imageUrl","compressionDegree","degree","bit","png","getImageDataByAIData","originalImageData","AIImageData","AIData","backgroundColor","changeIntoColor","kernel","index","aboveA","belowA","aboveDiaphaneity","belowDiaphaneity","newColorR","newColorG","newColorB","newColorA","createXMLHttpRequest","xhr","versions","getFormElementData","oFormElement","sSearch","nItem","oField","sFieldType","nFile","fetchUseXMLHttpRequest","timeout","timeoutHandler","percentage","fetchUseFetch","response","ifWebFileHasChanged","sURL","fCallback","nLastVisit","nLastModif","localstorage","scrollTo","setScrollRestoration","newVal","activeEffect","targetKeyDep","getDep","target","depMap","dep","Dep","effect","watchEffect","reactiveVue2","raw","newValue","reactiveVue3","receiver","Easing","amount","power","now","time","now$1","Group","tweenId","tween","preserve","tweenIds","autoStart","Interpolation","pw","bn","p1","fc","p2","p3","v0","v1","t2","t3","Sequence","mainGroup","Tween","_object","_group","properties","duration","property","_valuesStart","_valuesEnd","_valuesStartRepeat","startValue","startValueIsArray","propType","isInterpolationList","endValues","numChainedTweens","group","times","yoyo","easingFunction","interpolationFunction","tweens","elapsed","endTime","startIsArray","endIsArray","tmp","endValue","nextId","getAll","removeAll","add","remove","update","TWEEN","Matrix","m11","m12","m21","m22","dx","dy","inv","invm","m4","m5","deg","rad","degX","degY","radX","radY","tx","ty","sy","px","py","createSvgPath","getPointAtLength","getTotalLength","context","isPointInPath","isPointInStroke","lineWidth","lineCap","lineJoin","segment","parse","command","args","parseValues","number","numbers","absolutize","startX","startY","seg","TAU","unit_vector_angle","ux","uy","vx","vy","sign","dot","get_arc_center","x1","y1","x2","y2","fs","rx","ry","sin_phi","cos_phi","x1p","y1p","rx_sq","ry_sq","x1p_sq","y1p_sq","radicant","cxp","cyp","v1x","v1y","v2x","v2y","theta1","delta_theta","approximate_unit_arc","alpha","a2c","phi","lambda","segments","curve","xp","yp","normalize","bezierX","bezierY","quadX","quadY","curves","x0","y0","quadratic","line","isSvgPath","_initialPath","_path","_bounds","_savedPaths","_renderProps","_beginPath","SvgPath","abs","bounds","renderProps","points","part","commands","cmd","transformed"],"mappings":"6CAAO,MAAMA,WAAkB,KAAM,CACnC,MAEA,YAAYC,EAAiBC,EAAwB,CACnD,MAAMD,EAASC,CAAO,EACjB,KAAA,KAAO,KAAK,YAAY,IAC/B,CACF,CAEO,MAAMC,WAAyBH,EAAU,CAC9C,aAAc,CACZ,MAAM,mCAAmC,CAC3C,CACF,CAEO,MAAMI,WAA8BJ,EAAU,CACnD,aAAc,CACZ,MAAM,eAAe,CACvB,CACF,CAEO,MAAMK,WAAyBL,EAAU,CAC9C,QAEA,YAAYM,EAAmB,CACvB,MAAA,0BAA0BA,CAAO,SAAS,EAChD,KAAK,QAAUA,CACjB,CACF,CClBgB,SAAAC,GACdC,EACAC,EACA,CACGD,EAAA,iBACD,SACA,UAAY,CACVC,EAAGD,EAAG,KAAK,CACb,EACA,EAAA,CAEJ,CAEgB,SAAAE,GACdC,EACAF,EACA,CAEWE,EAAA,iBACT,WACA,SAAUC,EAAG,CACXA,EAAE,gBAAgB,EAClBA,EAAE,eAAe,EACbA,EAAE,eAAcA,EAAE,aAAa,WAAa,OAClD,EACA,EAAA,EAESD,EAAA,iBACT,OACA,SAAUC,EAAG,CACXA,EAAE,gBAAgB,EAClBA,EAAE,eAAe,EACbA,EAAE,cAAiBH,EAAAG,EAAE,aAAa,KAAK,CAC7C,EACA,EAAA,CAEJ,CASa,MAAAC,GAAa,CACxBP,EAAoB,CAAC,GAAG,EACxBQ,IACoB,CACpB,GAAI,CAAC,WAAW,UAAY,EAAE,WAAW,oBAAoB,UAC3D,MAAM,IAAIX,GAEZ,MAAMY,EAAe,WAAW,SAAS,cAAc,OAAO,EACjD,OAAAA,EAAA,aAAa,OAAQ,MAAM,EAC3BA,EAAA,aAAa,aAAc,QAAQ,EAC5C,MAAM,QAAQT,CAAO,GAAKA,EAAQ,OAAS,GAC7CS,EAAa,aAAa,SAAUT,EAAQ,KAAK,GAAG,CAAC,EAEnDQ,GACWC,EAAA,aAAa,WAAY,MAAM,EAE9CA,EAAa,MAAM,EAEZ,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC3B,WAAA,iBACT,QACA,IAAM,CACJ,WAAW,IAAM,EACX,CAACF,EAAa,OAASA,EAAa,OAAO,SAAW,IACjDE,EAAA,IAAIb,EAAuB,GAEnC,GAAI,CACT,EACA,CAAE,KAAM,EAAK,CAAA,EAEFW,EAAA,iBAAiB,SAAU,IAAM,CAC5C,GAAI,CAACA,EAAa,OAASA,EAAa,OAAO,SAAW,EACjDE,EAAA,IAAIb,EAAuB,MAC7B,CACL,MAAMc,EAAQ,MAAM,KAAKH,EAAa,KAAK,EACvCI,EAAaD,CAAK,GACbD,EAAA,IAAIZ,GAAiBC,CAAO,CAAC,EAEtCU,EAAQE,CAAK,CACf,CAAA,CACD,CAAA,CACF,EAED,SAASC,EAAaD,EAAwB,CAC5C,MACE,CAACZ,EAAQ,SAAS,GAAG,GACrBY,EAAM,KAAME,GAAS,CAACd,EAAQ,SAAS,IAAIe,GAAiBD,CAAI,CAAC,EAAE,CAAC,CAExE,CACF,EAMaE,GACXC,GACe,CACT,MAAAC,EAAS,IAAI,WACnB,OAAO,IAAI,QAAQ,CAACR,EAASC,IAAW,CAC/BO,EAAA,iBACL,WACCC,GAA0C,CACzC,MAAMC,EAAO,IAAM,KAAK,MAAMD,EAAM,MAAQ,GAAI,EAAI,OAC9CE,EAAW,KAAK,MAAOF,EAAM,OAASA,EAAM,MAAS,GAAG,EAAI,IAClE,QAAQ,IAAI,iBAAiBC,CAAI,cAAcC,CAAQ,EAAE,CAC3D,CAAA,EAEKH,EAAA,iBAAiB,OAASC,GAAsC,CAC7DT,EAAAS,EAAM,QAAQ,MAAW,CAAA,CAClC,EACMD,EAAA,iBAAiB,QAAUC,GAAuC,CACvER,EAAOQ,CAAK,CAAA,CACb,EACDF,EAAYC,CAAM,CAAA,CAGnB,CACH,EAQaH,GAAoBD,GAAgC,CAC3D,IAAAQ,EACJ,OAAIR,aAAgB,KAClBQ,EAAWR,EAAK,KAELQ,EAAAR,EAENQ,EAAS,MAAM,4BAA4B,EAAG,CAAC,GAAK,EAC7D,EAEaC,GAAWT,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBU,GAAWV,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBW,GAAWX,GACf,WAAW,KAAKA,EAAK,IAAI,EAGrBY,GAAkBZ,GACtB,4OAA4O,KACjPA,EAAK,IAAA,EAIIa,GAAmBb,GACvB,yOAAyO,KAC9OA,EAAK,IAAA,EAIIc,GAAwBd,GAC5B,wQAAwQ,KAC7QA,EAAK,IAAA,EAIIe,GAAkBf,GACtB,sBAAsB,KAAKA,EAAK,IAAI,EAGhCgB,GAAiBhB,GACrB,6CAA6C,KAAKA,EAAK,IAAI,EAQ7D,SAASiB,GAAYjB,EAAY,CAEtC,MAAMkB,EAAQlB,EAAK,MAAM,EAAG,CAAC,EACvBI,EAAS,IAAI,WACf,IAAAe,EACJ,OAAO,IAAI,QAAQ,CAACvB,EAASC,IAAW,CACtCO,EAAO,OAAS,UAAY,CAC1B,MAAMgB,EAAShB,EAAO,OAKtB,OAHa,IAAI,SAASgB,CAAM,EACb,UAAU,EAAG,EAAK,EAEtB,CACb,IAAK,YACaD,EAAA,YAChB,MACF,IAAK,YACaA,EAAA,YAChB,MACF,IAAK,WACaA,EAAA,kBAChB,MACF,IAAK,YACaA,EAAA,kBAChB,KACJ,CACA,OAAOvB,EAAQuB,CAAa,CAAA,EAG9Bf,EAAO,kBAAkBc,CAAK,CAAA,CAC/B,CACH,CAKO,SAASG,GAAaC,EAA6B,CAClD,MAAAC,EAAO,IAAI,KAAK,CAAC,IAAMD,EAAG,SAAA,EAAa,KAAK,EAAG,CACnD,KAAM,wBAAA,CACP,EACM,OAAA,IAAI,gBAAgBC,CAAI,CAEjC,CC5OO,SAASC,GAAgBnC,EAAgB,CAC9C,SAASoC,GAAQ,CACX,SAAS,aAAe,YACzBpC,IACM,SAAA,oBAAoB,mBAAoBoC,CAAK,EACxD,CACI,OAAO,SAAa,MACb,SAAA,iBAAiB,mBAAoBA,CAAK,EAC7CA,IAEV,CCVO,SAASC,GAAUrC,EAAgB,CACpC,OAAO,gBAAmB,WAC5B,eAAeA,CAAE,EAEjB,QAAQ,QAAQ,EACb,KAAKA,CAAE,EACP,MAAOG,GACN,WAAW,IAAM,CACT,MAAAA,CAAA,CACP,CAAA,CAGT,CCZgB,SAAAmC,GACdC,EACAC,EACAC,EACA,CACA,GAAI,CAACF,EAAS,CACRE,GAAUD,GACZC,EAAO,YAAYD,CAAO,EAE5B,MACF,CAEI,GAAA,CAAAD,EAAQ,YAAYC,CAAO,EAE3B,IAAAD,EAAQ,WAAaC,EAAQ,SAAU,CAClCC,EAAA,aAAaD,EAASD,CAAO,EACpC,MACF,CAEI,GAAAA,EAAQ,WAAa,KAAK,UAAW,CACnCA,EAAQ,cAAgBC,EAAQ,cAClCD,EAAQ,YAAcC,EAAQ,aAEhC,MACF,CAEA,QAAS,EAAID,EAAQ,WAAW,OAAS,EAAG,GAAK,EAAG,IAAK,CACvD,MAAMG,EAAWH,EAAQ,WAAW,CAAC,EAAE,KACnC,CAACC,EAAQ,aAAaE,CAAQ,GAAKA,IAAa,QAClDH,EAAQ,gBAAgBG,CAAQ,CAEpC,CAEA,QAAS,EAAI,EAAG,EAAIF,EAAQ,WAAW,OAAQ,IAAK,CAClD,MAAME,EAAWF,EAAQ,WAAW,CAAC,EAAE,KACjCG,EAAYH,EAAQ,WAAW,CAAC,EAAE,MAChCD,EAAA,aAAaG,EAAUC,CAAS,CAC1C,CAEA,QAAS,EAAI,EAAG,EAAIH,EAAQ,WAAW,OAAQ,IACzCD,EAAQ,WAAW,CAAC,EACtBD,GACEC,EAAQ,WAAW,CAAC,EACpBC,EAAQ,WAAW,CAAC,EACpBD,CAAA,EAGFA,EAAQ,YAAYC,EAAQ,WAAW,CAAC,EAAE,UAAU,EAAI,CAAC,EAI7D,KAAOD,EAAQ,WAAW,OAASC,EAAQ,WAAW,QAChDD,EAAQ,WAAmBA,EAAA,YAAYA,EAAQ,SAAS,EAEhE,CCtDO,SAASK,GAAUC,EAAOC,EAAQC,EAAQ,CAC/C,IAAIC,EAAI,IAAI,KACZA,EAAE,QAAQA,EAAE,QAAS,EAAGD,EAAS,GAAK,GAAK,GAAK,GAAI,EACpD,IAAIE,EAAU,WAAaD,EAAE,YAAW,EACxC,SAAS,OAASH,EAAQ,IAAMC,EAAS,KAAOG,CAClD,CAEO,SAASC,GAAUL,EAAO,CAG/B,QAFIM,EAAON,EAAQ,IACfO,EAAK,SAAS,OAAO,MAAM,GAAG,EACzB,EAAI,EAAG,EAAIA,EAAG,OAAQ,IAAK,CAClC,IAAIC,EAAID,EAAG,CAAC,EAAE,KAAI,EAClB,GAAIC,EAAE,QAAQF,CAAI,GAAK,EAAG,OAAOE,EAAE,UAAUF,EAAK,OAAQE,EAAE,MAAM,CACnE,CACD,MAAO,EAET,CAGY,MAACC,GAAkB,IAC7B,SAAS,OACN,MAAM,GAAG,EACT,IAAKC,GAASA,EAAK,MAAM,GAAG,CAAC,EAC7B,OAAO,CAACC,EAAK,CAACC,EAAGC,CAAC,KAAOF,EAAIC,EAAE,KAAI,EAAG,QAAQ,IAAK,EAAE,CAAC,EAAIC,IAAMF,EAAK,EAAE,EAG/DG,GAAe,IAC1B,SAAS,OACN,MAAM,GAAG,EACT,QACEN,GACE,SAAS,OAASA,EAChB,QAAQ,MAAO,EAAE,EACjB,QAAQ,MAAO,aAAa,IAAI,KAAI,EAAG,YAAW,CAAE,SAAS,CACxE,EChCO,MAAMO,EAAU,CACrB,YAAYC,EAAK,CAIf,KAAK,gBAAkB,GAMvB,KAAK,aAAe,GAEpB,KAAK,IAAMA,EAIX,KAAK,aAAY,CAClB,CAOD,cAAe,CACb,KAAK,OAAS,IAAID,GAAU,KAAK,GAAG,EAQpC,KAAK,OAAO,OAAS,IAAM,CACzB,KAAK,aAAa,QAASL,GAAS,KAAK,OAAO,KAAKA,CAAI,CAAC,EAC1D,KAAK,aAAe,EAC1B,EAEI,KAAK,OAAO,QAAWpD,GAAM,CAC3B,KAAM,CAAE,KAAA2D,EAAM,OAAAC,EAAQ,SAAAC,CAAQ,EAAK7D,EACnC,QAAQ,IAAI,eAAe2D,CAAI,IAAIC,CAAM,IAAIC,CAAQ,EAAE,CAC7D,EAEI,KAAK,OAAO,QAAW7D,GAAM,CAC3B,QAAQ,IAAI,eAAeA,CAAC,EAAE,CACpC,EAEI,KAAK,OAAO,UAAaA,GAAM,CAC7B,KAAK,eAAeA,CAAC,CAC3B,CACG,CAID,eAAeX,EAAS,CACtB,QAAQ,IAAI,wBAAwB,EACpC,KAAK,aAAa,KAAKA,CAAO,EAC9B,KAAK,aAAY,CAClB,CAKD,aAAc,CACZ,KAAK,OAAO,QACZ,QAAQ,IAAI,yBAAyB,CACtC,CAKD,YAAa,CACX,KAAK,aAAY,EACjB,QAAQ,IAAI,yBAAyB,CACtC,CAED,MAAM,YAAYyE,EAAS,CAUzB,IAAIC,EAAY,CAAC,IAAI,KACrB,MAAMC,EAAW,KAAK,gBAAgBD,CAAS,EAAI,CAAE,KAAMA,CAAS,EAI9D1E,EAAU,CAAE,GAAG2E,EAAS,GAAGF,CAAO,EAGxC,GAAI,CAEE,KAAK,OAAO,aAAeL,GAAU,KACvC,KAAK,OAAO,KAAK,KAAK,UAAUpE,CAAO,CAAC,EAIxC,KAAK,eAAe,KAAK,UAAUA,CAAO,CAAC,EAW7C,MAAM4E,EAAS,MAAM,IAAI,QAAQ,SAAU7D,EAASC,EAAQ,CAG1D2D,EAAQ,QAAU5D,EAElB,QAAQ,IAAI4D,CAAO,EAInB,WAAW,IAAM,CACf3D,EAAO,SAAS,CACjB,EAAE,GAAI,CACf,CAAO,EAED,eAAQ,KAAK,aAAc,CAAC,IAAI,KAAS2D,EAAQ,MAAQ,GAAI,EAGtDC,CACb,QAAc,CAER,QAAQ,IAAI,4BAA4B,EAExC,OAAO,KAAK,gBAAgBF,CAAS,CACtC,CACF,CA0BD,MAAM,eAAeG,EAAK,CACxB,GAAI,CACF,IAAIC,EAAO,KAAK,MAAMD,EAAI,IAAI,EAE9B,GAAI,OAAO,UAAU,eAAe,KAAKC,EAAM,WAAW,EAAG,CAC3D,MAAMH,EAAU,KAAK,gBAAgBG,EAAK,SAAS,EAC/CH,EAASA,EAAQ,QAAQG,CAAI,EAE/B,QAAQ,KACN,+DACAA,CACZ,CACA,MAEQ,QAAQ,KAAK,8BAA+BA,CAAI,CAExD,MAAY,CACN,QAAQ,IAAID,EAAI,IAAI,CACrB,CACF,CAKD,MAAM,YACJJ,EACAM,EACAC,EAAaC,GAAU,CACrB,QAAQ,IAAIA,CAAK,CAClB,EACD,CACA,KAAK,YAAYR,CAAO,EAAE,KACxB,SAAUS,EAAO,CACfH,EAAWG,CAAK,CACjB,EACD,SAAUD,EAAO,CACfD,EAAUC,CAAK,CAChB,CACP,CACG,CAUD,YAAYR,EAAS,CAEnB,MAAMzE,GAAW,IAAM,CACrB,GAAI,CACF,OAAO,KAAK,UAAUyE,CAAO,CAC9B,MAAW,CACV,OAAOA,CACR,CACP,KAEQ,KAAK,OAAO,aAAeL,GAAU,KACvC,KAAK,OAAO,KAAKpE,CAAO,EAIxB,KAAK,eAAeA,CAAO,CAE9B,CACH,CCxOO,SAASmF,IAAqB,CAC/B,OAAA,SAAS,YAAc,aAClB,SAAS,KAET,SAAS,eAEpB,CAGO,SAASC,IAAkB,CAChC,MAAMC,EAAkBF,KACjB,MAAA,CACL,MAAOE,EAAgB,aAAe,OAAO,WAC7C,OAAQA,EAAgB,cAAgB,OAAO,WAAA,CAEnD,CAGO,SAASC,IAAc,CAC5B,MAAMD,EAAkBF,KAClBI,EAAWH,KACV,MAAA,CACL,MAAO,KAAK,IAAIC,EAAgB,YAAaE,EAAS,KAAK,EAC3D,OAAQ,KAAK,IAAIF,EAAgB,aAAcE,EAAS,MAAM,CAAA,CAElE,CAiBO,SAASC,GAAoBjF,EAAiB,CACnD,MAAMgF,EAAWH,KACXK,EAAOlF,EAAG,wBAChB,OACEkF,EAAK,OAAS,GACdA,EAAK,IAAMF,EAAS,QACpBE,EAAK,MAAQ,GACbA,EAAK,KAAOF,EAAS,KAEzB,CAGO,SAASG,IAAgB,CAC9B,MAAML,EAAkBF,KACjB,MAAA,CACL,WAAYE,EAAgB,WAC5B,UAAWA,EAAgB,SAAA,CAE/B,CAEO,SAASM,IAAgB,CAC9B,MAAMN,EAAkBF,KACjB,MAAA,CACL,WAAYE,EAAgB,WAC5B,UAAWA,EAAgB,SAAA,CAE/B,CAEO,SAASO,GAAqBC,EAAsB,CACzD,IAAIC,EAAaD,EAAQ,WACrBE,EAAUF,EAAQ,aACtB,KAAOE,IAAY,MACjBD,GAAcC,EAAQ,WACtBA,EAAUA,EAAQ,aAEb,OAAAD,CACT,CAEO,SAASE,GAAoBH,EAAsB,CACxD,IAAII,EAAYJ,EAAQ,UACpBE,EAAUF,EAAQ,aACtB,KAAOE,IAAY,MACjBE,GAAaF,EAAQ,UACrBA,EAAUA,EAAQ,aAEb,OAAAE,CACT,CAEO,SAASC,GAA0BL,EAAsB,CACvD,MAAA,CACL,EAAGD,GAAqBC,CAAO,EAC/B,EAAGG,GAAoBH,CAAO,CAAA,CAElC,CACO,SAASM,GAAyBN,EAAsB,CACvD,MAAAJ,EAAOI,EAAQ,wBACfO,EAASV,KACTW,EAAaV,KACZ,MAAA,CACL,EAAGF,EAAK,KAAOW,EAAO,WAAaC,EAAW,WAC9C,EAAGZ,EAAK,IAAMW,EAAO,UAAYC,EAAW,SAAA,CAEhD,CAEO,SAASC,GAA6BT,EAAsB,CAC3D,MAAAJ,EAAOI,EAAQ,wBACd,MAAA,CACL,EAAGJ,EAAK,KACR,EAAGA,EAAK,GAAA,CAEZ,CAIO,SAASc,IAA+B,CAC7C,MAAMlB,EAAkBF,KAElBqB,EAASnB,EAAgB,aAAeA,EAAgB,aAC9D,OAAOmB,GAAU,EAAI,EAAKnB,EAAgB,UAAYmB,EAAU,GAClE,CAGO,SAASC,GAAuBC,EAAgB,CACjD,GAAAA,EAAG,OAASA,EAAG,MACjB,MAAO,CAAE,EAAGA,EAAG,MAAO,EAAGA,EAAG,OAE9B,MAAMC,EAAajB,KACbW,EAAaV,KACZ,MAAA,CACL,EAAGe,EAAG,QAAUC,EAAW,WAAaN,EAAW,WACnD,EAAGK,EAAG,QAAUC,EAAW,UAAYN,EAAW,SAAA,CAEtD,CAEO,SAASO,GAA2BF,EAAgB,CAClD,MAAA,CACL,EAAGA,EAAG,QACN,EAAGA,EAAG,OAAA,CAEV,CCzIO,SAASG,GAAerF,EAAO,CACpC,GAAI,SAAS,eAAe,WAAW,cAAe,KAAK,EACzD,OAAOA,EAAM,OAEb,OAAQA,EAAM,OAAM,CAClB,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACH,MAAO,GACT,IAAK,GACL,IAAK,GACH,MAAO,GACT,IAAK,GACH,MAAO,EACV,CAEL,CCpBa,MAAAsF,GAAqB,IAAM,CACtC,MAAMC,EAAY,UAAU,UAAU,YAAW,EACjD,IAAIC,EAAkB,UACtB,OAAID,EAAU,SAAS,KAAK,EAC1BC,EAAkB,QACTD,EAAU,SAAS,KAAK,EACjCC,EAAkB,UACT,UAAU,KAAKD,CAAS,EACjCC,EAAkB,UACT,mBAAmB,KAAKD,CAAS,EAC1CC,EAAkB,MACT,QAAQ,KAAKD,CAAS,EAC/BC,EAAkB,QACT,MAAM,KAAKD,CAAS,IAC7BC,EAAkB,OAEbA,EAAgB,aACzB,EAEaC,GAA4B,IAAM,CAC7C,MAAMF,EAAY,UAAU,UAC5B,IAAIG,EAAY,UAChB,GAAI,aAAa,KAAKH,CAAS,EAAG,CAChC,MAAMI,EAAQJ,EAAU,MAAM,uBAAuB,EACjDI,IACFD,EAAYC,EAAM,CAAC,EAEtB,SAAU,WAAW,KAAKJ,CAAS,EAAG,CACrC,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFD,EAAYC,EAAM,CAAC,EAAE,QAAQ,IAAK,GAAG,EAExC,SAAU,UAAU,KAAKJ,CAAS,EAAG,CACpC,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFD,EAAYC,EAAM,CAAC,EAEtB,SAAU,mBAAmB,KAAKJ,CAAS,EAAG,CAC7C,MAAMI,EAAQJ,EAAU,MAAM,cAAc,EACxCI,IACFD,EAAYC,EAAM,CAAC,EAAE,QAAQ,IAAK,GAAG,EAExC,CACD,OAAOD,EAAU,aACnB,EAEaE,GAAmB,IAAM,CACpC,MAAML,EAAY,UAAU,UAAU,YAAW,EACjD,IAAIM,EAAS,UACb,MAAI,SAAS,KAAKN,CAAS,EACzBM,EAAS,SACA,UAAU,KAAKN,CAAS,EACjCM,EAAS,UACA,SAAS,KAAKN,CAAS,EAChCM,EAAS,SACA,OAAO,KAAKN,CAAS,EAC9BM,EAAS,OACA,eAAe,KAAKN,CAAS,IAEtCM,EAAS,MAEJA,EAAO,aAChB,EAEaC,GAA0B,IAAM,CAC3C,MAAMP,EAAY,UAAU,UAC5B,IAAIQ,EAAiB,UACrB,GAAI,SAAS,KAAKR,CAAS,EAAG,CAC5B,MAAMI,EAAQJ,EAAU,MAAM,oBAAoB,EAC9CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,UAAU,KAAKJ,CAAS,EAAG,CACpC,MAAMI,EAAQJ,EAAU,MAAM,qBAAqB,EAC/CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,SAAS,KAAKJ,CAAS,EAAG,CACnC,MAAMI,EAAQJ,EAAU,MAAM,qBAAqB,EAC/CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,OAAO,KAAKJ,CAAS,EAAG,CACjC,MAAMI,EAAQJ,EAAU,MAAM,kBAAkB,EAC5CI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,SAAU,eAAe,KAAKJ,CAAS,EAAG,CACzC,MAAMI,EAAQJ,EAAU,MAAM,wBAAwB,EAClDI,IACFI,EAAiBJ,EAAM,CAAC,EAE3B,CACD,OAAOI,CACT,EAEaC,GAA4B,IACnC,gBAAiB,UACZ,IAAI,QAAQ,CAACzG,EAASC,IAAW,CACtC,UAAU,YAAY,mBACnByG,GAAa,CACZ,MAAMC,EAAWD,EAAS,OAAO,SAC3BE,EAAYF,EAAS,OAAO,UAClC1G,EAAQ,CAAE,SAAA2G,EAAU,UAAAC,CAAS,CAAE,CAChC,EACA1C,GAAU,CACTjE,EAAOiE,CAAK,CACb,CACT,CACA,CAAK,EAEM,QAAQ,OAAO,+BAA+B,EAIlD,SAAS2C,IAAqB,CACnC,OAAQ,UAAU,iBAAmB,UAAU,UAAU,YAAW,CACtE,CAEO,SAASC,IAAc,CAC5B,OAAO,KAAK,eAAgB,EAAC,gBAAe,EAAG,SAAS,aAC1D,CAEO,SAASC,IAAQ,CACtB,OAAOhB,GAAoB,IAAK,KAClC,CAEO,SAASiB,IAAgB,CAC9B,OAAQjB,GAAkB,IAAO,MAAUA,GAAoB,IAAK,OACtE,CAEO,SAASkB,IAAY,CAC1B,OAAOlB,GAAoB,IAAK,SAClC,CAEO,SAASmB,IAAW,CACzB,OAAOH,GAAK,GAAME,IACpB,CAEO,SAASE,IAAa,CAC3B,OACE,OAAO,QAAW,UAClB,OAAO,YACP,OAAO,WAAW,8BAA8B,EAAE,OAEtD,CAEY,MAACC,GACX,OAAO,QAAW,UAAY,OAAO,UAAa,SAEvCC,GACX,OAAO,QAAY,KACnB,QAAQ,UAAY,MACpB,QAAQ,SAAS,MAAQ,KCzJpB,SAASC,GAAOC,EAAa,CAIlC,IAAIC,EAAQ,SAAS,gBAOjBC,EAAM,OAAO,iBACjBD,EAAM,QAAQ,IAAMC,EAkBpB,IAAIC,EAAM,IACNC,EAAS,UAAY,CAUvB,IAAIC,EAAc,KAAK,IAAIJ,EAAM,YAAaD,CAAW,EACzDC,EAAM,QAAQ,MAAQI,EACtBJ,EAAM,QAAQ,IAAME,EAAM,KAAK,MAAM,KAAOE,EAAcL,EAAY,EAItEC,EAAM,MAAM,SAAWE,EAAM,IACjC,EAEEC,IAGA,OAAO,OAAS,SAAUxE,EAAG,CAC3B,OAAAA,EAAI,WAAWA,CAAC,EACTA,EAAIuE,CACf,EACE,OAAO,OAAS,SAAUvE,EAAG,CAC3B,OAAAA,EAAI,WAAWA,CAAC,EACTA,EAAIuE,CACf,EAEO,OAAO,kBACZ,OAAO,iBACL,sBAAuB,OAAS,oBAAsB,SACtDC,EACA,EACJ,CACA,CCzDO,SAASE,GAAkBC,EAAK,CACrC,OAAO,KAAK,mBAAmBA,CAAG,CAAC,EAChC,WAAW,IAAK,GAAG,EACnB,WAAW,IAAK,GAAG,EACnB,WAAW,IAAK,EAAE,CACvB,CAGO,SAASC,GAAkBC,EAAc,CAC9C,IAAIjE,EAAOiE,EAAa,WAAW,IAAK,GAAG,EAAE,WAAW,IAAK,GAAG,EAC5DC,EAAOlE,EAAK,OAAS,EACzB,OAAIkE,IACFlE,EAAOA,EAAK,OAAOA,EAAK,QAAU,EAAIkE,GAAO,GAAG,GAE3C,mBAAmB,KAAKlE,CAAI,CAAC,CACtC,CAEa,MAAAmE,GAAiBC,GAAS,CAAC,oBAAoB,KAAKA,CAAI,EAE9D,SAASC,GAAMC,EAAQ,CAC5B,IAAIC,EACJ,GAAI,CACFA,EAAW,IAAI,IAAID,CAAM,CAC1B,OAAQnE,EAAO,CACd,eAAQ,IAAIA,CAAK,EACV,EACR,CAGD,OAAOoE,EAAS,WAAa,SAAWA,EAAS,WAAa,QAChE,CAEa,MAAAC,GAAgBC,GAC3B,MAAM,KAAK,IAAI,gBAAgBA,CAAK,CAAC,EAAE,OACrC,CAACC,EAAG,CAACvF,EAAGC,CAAC,IACP,OAAO,OAAO,CAAE,EAAEsF,EAAG,CACnB,CAACvF,CAAC,EAAGuF,EAAEvF,CAAC,GAAK,MAAM,QAAQuF,EAAEvF,CAAC,CAAC,EAAIuF,EAAEvF,CAAC,EAAI,CAACuF,EAAEvF,CAAC,CAAC,GAAG,OAAOC,CAAC,EAAIA,CACtE,CAAO,EACH,CAAE,CACF,EAEG,SAASuF,IAAgB,CAC9B,IAAIC,EAAM,CAAA,EACNC,EAAe,SAAS,OAC5B,OAAIA,IACFA,EAAeA,EAAa,UAAU,EAAGA,EAAa,MAAM,EAC5CA,EAAa,MAAM,GAAG,EAC5B,QAAS5F,GAAS,CAC1B,MAAM6F,EAAS7F,EAAK,MAAM,GAAG,EAC7B2F,EAAIE,EAAO,CAAC,CAAC,EAAI,mBAAmBA,EAAO,CAAC,CAAC,CACnD,CAAK,GAEIF,CACT,CAEO,SAASG,GAAgBrJ,EAAI,CAClC,IAAIsJ,EAAc,GACH,IAAI,iBAAiB,SAAUC,EAAW,CACnD,OAAO,SAAS,OAASD,IAC3BA,EAAc,OAAO,SAAS,KAC9B,QAAQ,IAAI,uBAAuB,OAAO,SAAS,IAAI,EAAE,EACrDtJ,GAAIA,EAAG,SAAS,IAAI,EAE9B,CAAG,EACQ,QAAQ,SAAU,CACzB,WAAY,GACZ,UAAW,GACX,QAAS,EACb,CAAG,CACH,CAEO,SAASwJ,GAAiBxJ,EAAI,CACnC,OAAO,iBAAiB,aAAc,IAAM,CAC1CA,EAAG,SAAS,IAAI,CACpB,CAAG,CACH,CAEO,SAASyJ,GAAoBzJ,EAAI,CAGtC,OAAO,iBAAiB,WAAYA,CAAE,CACxC,CC9FO,SAAS0J,GAASC,EAAgB,CACvCA,EAAQA,GAAS,aAAa,MACzBA,IACHA,EAAQ,OAAO,WAAW,8BAA8B,EAAE,QACtD,OACA,QACJ,aAAa,MAAQA,GAEvB,SAAS,gBAAgB,UAAU,OAAO,OAAQA,IAAU,MAAM,CACpE,CCTO,MAAMC,EAAmB,CAC9B,OAAc,SAAS5I,EAAqD,CAEpE,MAAA8C,EAAO9C,EAAM,SAAWA,EAAM,SAC7B,MAAA,CACL,KAAA8C,EACA,IAAK8F,GAAmB,UAAU9F,CAAI,CAAA,CAE1C,CAUA,OAAc,UAAU+F,EAAyB,CAE7C,OAAA,OAAO,UAAU,eAAe,KAC9BD,GAAmB,WACnBC,CAAA,EAGKD,GAAmB,WAAWC,CAAO,EAErC,EAEX,CAUA,OAAc,UAAU/F,EAAsB,CAE1C,OAAA,OAAO,UAAU,eAAe,KAC9B8F,GAAmB,WACnB9F,EAAK,SAAS,CAAA,EAGT8F,GAAmB,WAAW9F,EAAK,SAAU,CAAA,EAE7C,EAEX,CAEA,OAAe,WAA0C,CACvD,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,EAAK,GACL,SAAU,GACV,UAAW,EACX,IAAK,EACL,MAAO,GACP,MAAO,GACP,KAAM,GACN,IAAK,GACL,YAAa,GACb,UAAW,GACX,OAAQ,GACR,QAAS,GACT,UAAW,GACX,IAAK,GACL,KAAM,GACN,WAAY,GACZ,SAAU,GACV,YAAa,GACb,WAAY,GACZ,OAAQ,GACR,OAAQ,GACR,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,EAAG,GACH,gBAAiB,GACjB,iBAAkB,GAClB,WAAY,GACZ,SAAU,GACV,SAAU,GACV,SAAU,GACV,SAAU,GACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,SAAU,IACV,IAAK,IACL,SAAU,IACV,cAAe,IACf,OAAQ,IACR,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,GAAI,IACJ,IAAK,IACL,IAAK,IACL,IAAK,IACL,SAAU,IACV,YAAa,IACb,WAAY,IACZ,WAAY,IACZ,MAAO,IACP,KAAM,IACN,OAAQ,IACR,cAAe,IACf,aAAc,IACd,aAAc,IACd,WAAY,IACZ,aAAc,IACd,aAAc,GAAA,EAGhB,OAAe,WAA0C,CACvD,EAAK,YACL,EAAK,MACL,GAAM,QACN,GAAM,QACN,GAAM,OACN,GAAM,MACN,GAAM,cACN,GAAM,YACN,GAAM,SACN,GAAM,WACN,GAAM,UACN,GAAM,YACN,GAAM,MACN,GAAM,OACN,GAAM,aACN,GAAM,WACN,GAAM,cACN,GAAM,aACN,GAAM,SACN,GAAM,SACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,IACN,GAAM,kBACN,GAAM,mBACN,GAAM,aACN,GAAM,WACN,GAAM,WACN,GAAM,WACN,GAAM,WACN,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,WACP,IAAO,MACP,IAAO,WACP,IAAO,gBACP,IAAO,SACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,KACP,IAAO,MACP,IAAO,MACP,IAAO,MACP,IAAO,WACP,IAAO,cACP,IAAO,aACP,IAAO,aACP,IAAO,QACP,IAAO,OACP,IAAO,SACP,IAAO,gBACP,IAAO,eACP,IAAO,eACP,IAAO,aACP,IAAO,eACP,IAAO,cAAA,CAEX,CC/PY,MAACgG,GAAmBC,GAAS,UAAU,UAAU,UAAUA,CAAI,EAE9DC,GAAkB,IAAM,OAAO,aAAY,EAAG,SAAW,EAGzDC,GAAWC,GAAQA,IAAQ,SAAS,cAGpCC,GAAYD,GACvB,CAAA,EAAG,MAAM,KAAKA,EAAI,WAAW,QAAQ,EAAE,OAAQE,GAAUA,IAAUF,CAAG,EAG3DG,GAAc,IAAM,CAAC,SAAS,OAE9BC,GAAe,IAAM,QAAQ,KAAO,EACpCC,GAAgB,IAAM,QAAQ,GAAG,EAAE,EAEzC,SAASC,GAAWC,EAAK,CAC9B,IAAIC,EAAS,SAAS,cAAc,QAAQ,EAC5CA,EAAO,KAAO,kBACdA,EAAO,IAAMD,EACbC,EAAO,MAAQ,GACf,SAAS,KAAK,YAAYA,CAAM,EAChCA,EAAO,OAAS,IAAM,GACtBA,EAAO,QAAU,IAAM,EACzB,CAQa,MAAAC,GAAe,CAACZ,EAAMa,EAAUC,EAAa,MAAQ,CAChE,MAAMC,EAAO,SAAS,cAAc,MAAM,EAC1CA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,QAAU,IACrBA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,SAAW,UACtBA,EAAK,MAAM,SAAWF,EAAW,GAAKA,EAAW,KAAO,OACxDE,EAAK,MAAM,WAAaD,EAAW,SAAQ,EAC3CC,EAAK,UAAYf,EACjB,SAAS,KAAK,YAAYe,CAAI,EAC9B,MAAMC,EAAQD,EAAK,YACnB,gBAAS,KAAK,YAAYA,CAAI,EACvBC,CACT,EAUaC,GAAoB,CAC/BjB,EACAgB,EACAH,EAAW,GACXC,EAAa,IACbI,EAAiB,KACd,CACH,IAAIC,EAAa,GACbC,EAAU,GACVC,EAAU,GACd,GAAI,CAACrB,GAAQgB,EAAQH,GAAY,OAAOb,GAAS,SAAU,OAAOmB,EAClE,MAAMG,EAAMtB,EAAK,MAAM,EAAE,EACnBe,EAAO,SAAS,cAAc,MAAM,EAC1CA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,QAAU,IACrBA,EAAK,MAAM,WAAa,SACxBA,EAAK,MAAM,SAAW,UACtBA,EAAK,MAAM,SAAWF,EAAW,GAAKA,EAAW,KAAO,OACxDE,EAAK,MAAM,WAAaD,EAAW,SAAQ,EAC3C,SAAS,KAAK,YAAYC,CAAI,EAE9B,QAASQ,EAAI,EAAGC,EAAIF,EAAI,OAAQC,EAAIC,EAAGD,IAAK,CAC1C,MAAM/H,EAAO8H,EAAIC,CAAC,EAMlB,GALAH,EAAUC,EACVA,GAAW7H,EACX2H,EAAaE,EACbN,EAAK,UAAYM,EACAN,EAAK,YACPC,EAAO,CAChBE,EACFC,EAAaC,EAAU,MAEvBD,EAAaC,EAEf,KACD,CACF,CAED,gBAAS,KAAK,YAAYL,CAAI,EACvBI,CACT,EAaO,SAASM,GAAWC,EAAc,CACvC,IAAIC,EAAID,EAAa,CAAC,EACtB,QAASH,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIK,EAAM,OAAO,UAAUL,CAAC,CAAC,EAG7BI,GAAKC,EACF,QAAQ,KAAM,OAAO,EACrB,QAAQ,KAAM,MAAM,EACpB,QAAQ,KAAM,MAAM,EACpB,QAAQ,KAAM,QAAQ,EACtB,QAAQ,KAAM,OAAO,EAGxBD,GAAKD,EAAaH,CAAC,CACpB,CACD,OAAOI,CACT,CAEO,SAASE,GAAWC,EAAY,CACrC,IAAIC,EAAW,CACb,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,GACb,EACE,QAASC,KAAQD,EACX,OAAO,eAAe,KAAKA,EAAUC,CAAI,IAC3CF,EAAaA,EAAW,QAAQ,IAAI,OAAOE,EAAM,GAAG,EAAGD,EAASC,CAAI,CAAC,GAGzE,OAAOF,CACT,CAEO,SAASG,GAAgBC,EAAU,CACxC,MAAMC,EAAW,cACXC,EAAO,kBAEb,OAAAF,EAAWA,EACR,QAAQC,EAAU,gCAAgC,EAClD,QAAQC,EAAM,sBAAsB,EAEvCF,EAAW,SAAWA,EAAW,MAEpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAOPA,CAAQ;AAAA;AAAA;AAAA,OAMhB,CAEO,SAASG,GAAiB/G,EAASgH,EAAMC,EAAS,CAEnDjH,EAAQ,iBAEVA,EAAQ,iBAAiBgH,EAAMC,EAAS,EAAK,EACpCjH,EAAQ,YAEjBA,EAAQ,YAAY,KAAOgH,EAAMC,CAAO,EAExCjH,EAAQ,KAAOgH,CAAI,EAAIC,CAE3B,CAEO,SAASC,GAAoBlH,EAASgH,EAAMC,EAAS,CACtDjH,EAAQ,oBACVA,EAAQ,oBAAoBgH,EAAMC,EAAS,EAAK,EACvCjH,EAAQ,YACjBA,EAAQ,YAAY,KAAOgH,EAAMC,CAAO,EAExCjH,EAAQ,KAAOgH,CAAI,EAAI,IAE3B,CAEO,SAASG,GAAgBxL,EAAO,CACjCA,EAAM,gBACRA,EAAM,gBAAe,EAErBA,EAAM,aAAe,EAEzB,CAEO,SAASyL,GAAezL,EAAO,CAChCA,EAAM,eACRA,EAAM,eAENA,EAAM,YAAc,EAExB,CAEO,SAAS0L,GAAU1L,EAAO,CAC/B,OAAOA,EAAM,QAAUA,EAAM,UAC/B,CAEO,SAAS2L,GAAiB3L,EAAO,CACtC,OAAIA,EAAM,cACDA,EAAM,cACJA,EAAM,UACRA,EAAM,UACJA,EAAM,YACRA,EAAM,YAEN,IAEX,CAEO,SAAS4L,IAA0B,CACxC,MAAI,UAAO,MAAQ,OAAO,YAAc,OAAO,UAAY,OAAO,KAMpE,CAEa,MAAAC,GAA4BC,GACvC,IAAI,QAASvM,GAAY,CACvB,MAAMwM,EAAQ,MAAM,KAAKD,EAAS,iBAAiB,sBAAsB,CAAC,EAC1E,IAAIE,EAAcF,EAAS,YAAY,QAAU,EACjD,MAAMG,EAAiB,IACjBD,GAAeD,EAAM,QACvBxM,IACO,IAEF,GAEJ0M,EAAc,GACjBF,EAAM,QAASG,GAAe,CAC5BA,EAAW,OAAS,IAAM,CACxBF,GAAe,EACfC,GACV,CACA,CAAO,CAEJ,CAAA,GC5PF,UAAY,CACX,IAAIE,EAAW,EAQV,OAAO,wBACH,OAAA,sBAAwB,SAAUC,EAAU,CACjD,MAAMC,EAAW,IAAI,KAAK,EAAE,QAAQ,EAC9BC,EAAa,KAAK,IAAI,EAAG,IAAMD,EAAWF,EAAS,EACnDI,EAAK,OAAO,WAAW,UAAY,CACvCH,EAASC,EAAWC,CAAU,GAC7BA,CAAU,EACb,OAAAH,EAAWE,EAAWC,EACfC,CAAA,GAEN,OAAO,uBACH,OAAA,qBAAuB,SAAUA,EAAI,CAC1C,aAAaA,CAAE,CAAA,EAErB,KAEa,MAAAC,GACXC,GACG,CACH,SAASC,EAAQC,EAAsB,CAC/B,MAAAJ,EAAK,OAAO,sBAAsBG,CAAO,EAC/CD,EAAOE,EAAcJ,CAAE,CACzB,CACA,OAAO,sBAAsBG,CAAO,CACtC,EAEaE,GAAgB,CAC3BC,EACAJ,IAKG,CACG,MAAAK,EAAS,SAAS,eAAeD,CAAQ,EACzCE,EAAMD,EAAO,WAAW,IAAI,EACrBN,GAAA,CAACG,EAAcJ,IAAO,CACjCQ,EAAI,UAAU,EAAG,EAAGD,EAAO,MAAOA,EAAO,MAAM,EACxCL,EAAAM,EAAKJ,EAAcJ,CAAE,CAAA,CAC7B,CACH,wIC/CA,IAAIS,EAAO,CAAA,EACmBC,EAAA,QAAiBD,EAG/CA,EAAK,MAAW,SAASE,EAAKC,EAC9B,CAKC,QAJIC,EAAMJ,EAAK,IAAI,WAAYK,EAAML,EAAK,IAAI,SAAUM,EAAI,EAAGC,EAAM,CAAA,EACjEjK,EAAO,IAAI,WAAW4J,CAAG,EACzBM,EAAOlK,EAAK,OAAO,EAEjB+J,EAAI/J,EAAMkK,CAAI,GAAG,WAAYA,IAEnC,IAAIF,EAAIE,EACRF,GAAG,EACHA,GAAG,EACH,IAAIG,EAAML,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAClBF,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAE5B,IAAII,EAAQL,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAC9B,IAAIK,EAAQN,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAE9BA,EAAIK,EACJ,QAAQrD,EAAE,EAAGA,EAAEmD,EAAKnD,IACpB,CACY+C,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAC7BA,GAAK,EACLA,GAAK,EACLA,GAAK,EAEOD,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAC9B,IAAII,EAAQL,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAC9B,IAAIM,EAAQP,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAE9B,IAAIO,EAAKT,EAAI9J,EAAMgK,CAAC,EAAGvO,EAAKqO,EAAI9J,EAAMgK,EAAE,CAAC,EAAGQ,EAAKV,EAAI9J,EAAMgK,EAAE,CAAC,EAAIA,GAAK,EACvEA,GAAK,EAEL,IAAIS,EAAOV,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAC7BA,GAAKO,EAAK9O,EAAK+O,EAEfd,EAAK,WAAW1J,EAAMyK,EAAMR,EAAKG,EAAOE,EAAOT,CAAS,CACxD,CAED,OAAOI,CACP,EAEDP,EAAK,WAAa,SAAS1J,EAAMgK,EAAGC,EAAKG,EAAOE,EAAOT,EACvD,CACC,IAAIC,EAAMJ,EAAK,IAAI,WAAYK,EAAML,EAAK,IAAI,SAClCK,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAClBF,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAClBF,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAE9B,IAAIU,EAAQZ,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAElBD,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAElBD,EAAI/J,EAAMgK,CAAC,EAAIA,GAAG,EAG9BA,GAAG,EAEH,IAAIW,EAAQb,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAC9B,IAAIY,EAAQd,EAAI9J,EAAMgK,CAAC,EAAIA,GAAG,EAE9B,IAAInL,EAAQ6K,EAAK,IAAI,SAAS1J,EAAMgK,EAAGW,CAAI,EAI3C,GAJ+CX,GAAGW,EAClDX,GAAKY,EAGFf,EAAW,CAAGI,EAAIpL,CAAI,EAAE,CAAC,KAAKyL,EAAO,MAAMF,CAAK,EAAI,MAAU,CACjE,IAAI/N,EAAO,IAAI,WAAW2D,EAAK,OAAQgK,CAAC,EAEnC,GAAGU,GAAM,EAAGT,EAAIpL,CAAI,EAAI,IAAI,WAAWxC,EAAK,OAAO,MAAM2N,EAAGA,EAAEI,CAAK,CAAC,UACjEM,GAAM,EAAG,CAChB,IAAId,EAAM,IAAI,WAAWU,CAAK,EAAIZ,EAAK,WAAWrN,EAAMuN,CAAG,EAQ3DK,EAAIpL,CAAI,EAAI+K,CACZ,KACI,MAAM,+BAA+Bc,CAC1C,EAEDhB,EAAK,WAAa,SAASrN,EAAMuN,EAAK,CAAG,OAAOF,EAAK,EAAE,QAAQrN,EAAMuN,CAAG,CAAK,EAC7EF,EAAK,QAAa,SAASrN,EAAMuN,EAAK,CAC3B,OAAAvN,EAAK,CAAC,EAASA,EAAK,CAAC,EAGxBqN,EAAK,WAAW,IAAI,WAAWrN,EAAK,OAAQA,EAAK,WAAW,EAAGA,EAAK,OAAO,CAAC,EAAGuN,CAAG,CACzF,EACDF,EAAK,QAAa,SAAS1J,EAAM6K,EAAoB,CACjDA,GAAM,OAAMA,EAAK,CAAC,MAAM,CAAC,GAC5B,IAAIC,EAAI,EAAGlB,EAAI,IAAI,WAAW,GAAG,KAAK,MAAM5J,EAAK,OAAO,GAAG,CAAC,EAC5D4J,EAAIkB,CAAG,EAAE,IAAMlB,EAAIkB,EAAI,CAAC,EAAE,IAAMA,GAAK,EACrCA,EAAMpB,EAAK,EAAE,WAAW1J,EAAM4J,EAAKkB,EAAKD,EAAK,KAAK,EAClD,IAAIE,EAAMrB,EAAK,MAAM1J,EAAM,EAAGA,EAAK,MAAM,EACzC,OAAA4J,EAAIkB,EAAI,CAAC,EAAIC,IAAM,GAAI,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAM,GAAI,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAO,EAAG,IACvBnB,EAAIkB,EAAI,CAAC,EAAIC,IAAO,EAAG,IAChB,IAAI,WAAWnB,EAAI,OAAQ,EAAGkB,EAAI,CAAC,CAC1C,EACDpB,EAAK,WAAa,SAAS1J,EAAM6K,EAAM,CACnCA,GAAM,OAAMA,EAAK,CAAC,MAAM,CAAC,GAC5B,IAAIjB,EAAI,IAAI,WAAW,GAAG,KAAK,MAAM5J,EAAK,OAAO,GAAG,CAAC,EACjD8K,EAAMpB,EAAK,EAAE,WAAW1J,EAAM4J,EAAKkB,EAAKD,EAAK,KAAK,EACtD,OAAO,IAAI,WAAWjB,EAAI,OAAQ,EAAGkB,CAAG,CACxC,EAGDpB,EAAK,OAAS,SAAS9E,EAAKoG,EAAQ,CAChCA,GAAQ,OAAMA,EAAO,IACxB,IAAIC,EAAM,EAAGC,EAAMxB,EAAK,IAAI,UAAWyB,EAAMzB,EAAK,IAAI,YAClD0B,EAAM,CAAA,EACV,QAAQ1G,KAAKE,EAAK,CAAG,IAAIyG,EAAM,CAAC3B,EAAK,QAAQhF,CAAC,GAAK,CAACsG,EAAQpB,EAAMhF,EAAIF,CAAC,EAAGqG,EAAMrB,EAAK,IAAI,IAAIE,EAAI,EAAEA,EAAI,MAAM,EAC5GwB,EAAI1G,CAAC,EAAI,CAAG,IAAI2G,EAAK,MAAMzB,EAAI,OAAQ,IAAImB,EAAK,KAAOM,EAAM3B,EAAK,WAAWE,CAAG,EAAIA,CAAI,CAAO,CAEhG,QAAQlF,KAAK0G,EAAKH,GAAOG,EAAI1G,CAAC,EAAE,KAAK,OAAS,GAAK,GAAK,EAAEgF,EAAK,IAAI,SAAShF,CAAC,EAC7EuG,GAAQ,GAER,IAAIjL,EAAO,IAAI,WAAWiL,CAAG,EAAGjB,EAAI,EAChCsB,EAAM,CAAE,EAEZ,QAAQ5G,KAAK0G,EAAK,CACjB,IAAI/O,EAAO+O,EAAI1G,CAAC,EAAI4G,EAAI,KAAKtB,CAAC,EAC9BA,EAAIN,EAAK,aAAa1J,EAAMgK,EAAGtF,EAAGrI,EAAM,CAAC,CACzC,CACD,IAAI2K,EAAE,EAAGuE,EAAOvB,EAChB,QAAQtF,KAAK0G,EAAK,CACjB,IAAI/O,EAAO+O,EAAI1G,CAAC,EAAI4G,EAAI,KAAKtB,CAAC,EAC9BA,EAAIN,EAAK,aAAa1J,EAAMgK,EAAGtF,EAAGrI,EAAM,EAAGiP,EAAItE,GAAG,CAAC,CACnD,CACD,IAAIoD,EAAQJ,EAAEuB,EAEd,OAAAL,EAAIlL,EAAMgK,EAAG,SAAU,EAAIA,GAAG,EAC9BA,GAAK,EACLmB,EAAInL,EAAMgK,EAAGhD,CAAC,EAAIgD,GAAK,EACvBmB,EAAInL,EAAMgK,EAAGhD,CAAC,EAAIgD,GAAK,EACvBkB,EAAIlL,EAAMgK,EAAGI,CAAK,EAAIJ,GAAK,EAC3BkB,EAAIlL,EAAMgK,EAAGuB,CAAI,EAAKvB,GAAK,EAC3BA,GAAK,EACEhK,EAAK,MACZ,EAED0J,EAAK,QAAU,SAAS/L,EAAI,CAAG,IAAI6N,EAAM7N,EAAG,MAAM,GAAG,EAAE,IAAG,EAAG,YAAW,EAAK,MAAO,mBAAmB,QAAQ6N,CAAG,GAAG,EAAM,EAE3H9B,EAAK,aAAe,SAAS1J,EAAMgK,EAAGtF,EAAGE,EAAK6G,EAAGhB,EACjD,CACC,IAAIS,EAAMxB,EAAK,IAAI,UAAWyB,EAAMzB,EAAK,IAAI,YACzCrN,EAAOuI,EAAI,KAEfsG,EAAIlL,EAAMgK,EAAGyB,GAAG,EAAI,SAAa,QAAU,EAAIzB,GAAG,EAC/CyB,GAAG,IAAGzB,GAAG,GACZmB,EAAInL,EAAMgK,EAAG,EAAE,EAAIA,GAAG,EACtBmB,EAAInL,EAAMgK,EAAI,CAAC,EAAIA,GAAG,EACtBmB,EAAInL,EAAMgK,EAAIpF,EAAI,IAAI,EAAE,CAAC,EAAIoF,GAAG,EAEhCkB,EAAIlL,EAAMgK,EAAI,CAAC,EAAIA,GAAG,EACtBkB,EAAIlL,EAAMgK,EAAGpF,EAAI,GAAG,EAAIoF,GAAG,EAC3BkB,EAAIlL,EAAMgK,EAAG3N,EAAK,MAAM,EAAI2N,GAAG,EAC/BkB,EAAIlL,EAAMgK,EAAGpF,EAAI,KAAK,EAAIoF,GAAG,EAE7BmB,EAAInL,EAAMgK,EAAGN,EAAK,IAAI,SAAShF,CAAC,CAAC,EAAIsF,GAAG,EACxCmB,EAAInL,EAAMgK,EAAG,CAAC,EAAIA,GAAG,EAElByB,GAAG,IACLzB,GAAK,EACLA,GAAK,EACLA,GAAK,EACLkB,EAAIlL,EAAMgK,EAAGS,CAAI,EAAIT,GAAG,GAEzB,IAAIW,EAAOjB,EAAK,IAAI,UAAU1J,EAAMgK,EAAGtF,CAAC,EAAI,OAAAsF,GAAIW,EAC7Cc,GAAG,IAAMzL,EAAK,IAAI3D,EAAM2N,CAAC,EAAIA,GAAK3N,EAAK,QACnC2N,CACP,EAMDN,EAAK,IAAM,CACV,MAAU,UAAW,CAElB,QADIgC,EAAM,IAAI,YAAY,GAAG,EACpBC,EAAE,EAAGA,EAAE,IAAKA,IAAK,CAE3B,QADI5M,EAAI4M,EACCxM,EAAE,EAAGA,EAAE,EAAGA,IACdJ,EAAI,EAAIA,EAAI,WAAcA,IAAM,EACxBA,EAAIA,IAAM,EAEvB2M,EAAIC,CAAC,EAAI5M,CAAK,CACf,OAAO2M,CAAI,EAAM,EAClB,OAAS,SAAS3M,EAAG6K,EAAKkB,EAAKc,EAAK,CACnC,QAAS5E,EAAE,EAAGA,EAAE4E,EAAK5E,IAAMjI,EAAI2K,EAAK,IAAI,OAAO3K,EAAI6K,EAAIkB,EAAI9D,CAAC,GAAK,GAAI,EAAKjI,IAAM,EAChF,OAAOA,CACP,EACD,IAAM,SAAS8M,EAAE7B,EAAE/C,EAAI,CAAG,OAAOyC,EAAK,IAAI,OAAO,WAAWmC,EAAE7B,EAAE/C,CAAC,EAAI,UAAc,CACnF,EACDyC,EAAK,MAAQ,SAAS1J,EAAKgK,EAAE4B,EAAK,CAGjC,QAFI,EAAI,EAAGC,EAAI,EACXf,EAAMd,EAAG8B,EAAI9B,EAAE4B,EACbd,EAAIgB,GAAK,CAEd,QADIC,EAAO,KAAK,IAAIjB,EAAI,KAAMgB,CAAG,EAC3BhB,EAAIiB,GACT,GAAK/L,EAAK8K,GAAK,EACfe,GAAK,EAEN,EAAE,EAAE,MACJA,EAAEA,EAAE,KACJ,CACE,OAAQA,GAAK,GAAM,CACtB,EAEDnC,EAAK,IAAM,CACV,WAAa,SAASsC,EAAKtH,EAAI,CAAG,OAAQsH,EAAKtH,CAAC,EAAMsH,EAAKtH,EAAE,CAAC,GAAG,CAAM,EACvE,YAAa,SAASsH,EAAKtH,EAAEiH,EAAE,CAAGK,EAAKtH,CAAC,EAAKiH,EAAG,IAAMK,EAAKtH,EAAE,CAAC,EAAKiH,GAAG,EAAG,GAAO,EAChF,SAAa,SAASK,EAAKtH,EAAI,CAAG,OAAQsH,EAAKtH,EAAE,CAAC,EAAG,UAAkBsH,EAAKtH,EAAE,CAAC,GAAG,GAAOsH,EAAKtH,EAAE,CAAC,GAAI,EAAKsH,EAAKtH,CAAC,EAAM,EACtH,UAAa,SAASsH,EAAKtH,EAAEiH,EAAE,CAAGK,EAAKtH,CAAC,EAAEiH,EAAE,IAAMK,EAAKtH,EAAE,CAAC,EAAGiH,GAAG,EAAG,IAAMK,EAAKtH,EAAE,CAAC,EAAGiH,GAAG,GAAI,IAAMK,EAAKtH,EAAE,CAAC,EAAGiH,GAAG,GAAI,GAAO,EAC1H,UAAa,SAASK,EAAKtH,EAAEuC,EAAE,CAAgB,QAATG,EAAI,GAAaJ,EAAE,EAAGA,EAAEC,EAAGD,IAAKI,GAAK,OAAO,aAAa4E,EAAKtH,EAAEsC,CAAC,CAAC,EAAI,OAAOI,CAAO,EAC1H,WAAa,SAASpH,EAAK0E,EAAE0C,EAAE,CAAG,QAAQJ,EAAE,EAAGA,EAAEI,EAAE,OAAQJ,IAAKhH,EAAK0E,EAAEsC,CAAC,EAAII,EAAE,WAAWJ,CAAC,CAAK,EAC/F,IAAM,SAAS2E,EAAG,CAAE,OAAOA,EAAE,OAAS,EAAI,IAAMA,EAAIA,CAAI,EACxD,SAAW,SAASK,EAAMtH,EAAGuC,EAAG,CAE/B,QADIG,EAAI,GAAI6E,EACJjF,EAAE,EAAGA,EAAEC,EAAGD,IAAKI,GAAK,IAAMsC,EAAK,IAAI,IAAIsC,EAAKtH,EAAEsC,CAAC,EAAE,SAAS,EAAE,CAAC,EACrE,GAAI,CAAGiF,EAAK,mBAAmB7E,CAAC,CAAI,MAC3B,CAAG,OAAOsC,EAAK,IAAI,UAAUsC,EAAMtH,EAAGuC,CAAC,CAAK,CACrD,OAAQgF,CACR,EACD,UAAY,SAASD,EAAMtH,EAAGX,EAAK,CAElC,QADImI,EAAOnI,EAAI,OAAQiD,EAAE,EACjBmF,EAAG,EAAGA,EAAGD,EAAMC,IACvB,CACC,IAAI3M,EAAOuE,EAAI,WAAWoI,CAAE,EAC5B,GAAS,EAAA3M,EAAM,YAA8BwM,EAAKtH,EAAEsC,CAAC,EAAUxH,EAAawH,YACnE,EAAAxH,EAAM,YAA8BwM,EAAKtH,EAAEsC,CAAC,EAAK,IAAKxH,GAAO,EAAMwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAO,EAAG,GAAOwH,GAAG,UAC5G,EAAAxH,EAAM,YAA8BwM,EAAKtH,EAAEsC,CAAC,EAAK,IAAKxH,GAAM,GAAOwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAO,EAAG,GAAOwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAOwH,GAAG,UACjJ,EAAAxH,EAAM,YAA8BwM,EAAKtH,EAAEsC,CAAC,EAAK,IAAKxH,GAAM,GAAOwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,GAAI,GAAOwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAOwM,EAAKtH,EAAEsC,EAAE,CAAC,EAAK,IAAMxH,GAAM,EAAG,GAAMwH,GAAG,MACzL,MAAM,GACX,CACD,OAAOA,CACP,EACD,SAAW,SAASjD,EAAK,CAExB,QADImI,EAAOnI,EAAI,OAAQiD,EAAE,EACjBmF,EAAG,EAAGA,EAAGD,EAAMC,IACvB,CACC,IAAI3M,EAAOuE,EAAI,WAAWoI,CAAE,EAC5B,GAAS,EAAA3M,EAAM,YAA8BwH,YACpC,EAAAxH,EAAM,YAA8BwH,GAAG,UACvC,EAAAxH,EAAM,YAA8BwH,GAAG,UACvC,EAAAxH,EAAM,YAA8BwH,GAAG,MAC3C,MAAM,GACX,CACD,OAAOA,CACP,CACD,EAMD0C,EAAK,EAAI,GAETA,EAAK,EAAE,WAAa,SAAS1J,EAAMiK,EAAKmC,EAAMC,EAAK,CAClD,IAAIxB,EAAO,CAOH,CAAE,EAAK,EAAK,EAAM,EAAE,CAAC,EACrB,CAAE,EAAK,EAAK,EAAM,EAAE,CAAC,EACrB,CAAE,EAAK,EAAI,GAAO,EAAE,CAAC,EACrB,CAAE,EAAK,EAAI,GAAM,GAAG,CAAC,EAErB,CAAE,EAAI,GAAK,GAAM,GAAG,CAAC,EACrB,CAAE,EAAI,GAAK,GAAM,GAAG,CAAC,EACrB,CAAE,EAAI,GAAI,IAAM,IAAI,CAAC,EACrB,CAAE,EAAI,GAAI,IAAM,IAAI,CAAC,EACrB,CAAC,GAAI,IAAK,IAAK,KAAK,CAAC,EACrB,CAAC,GAAI,IAAK,IAAK,KAAK,CAAC,CAAC,EAE1ByB,EAAMzB,EAAKwB,CAAG,EAGdE,EAAI7C,EAAK,EAAE,EAAG8C,EAAY9C,EAAK,EAAE,WAAmBA,EAAK,EAAE,MAAO,IAAA+C,EAAQ/C,EAAK,EAAE,OACjF1C,EAAI,EAAG0F,EAAMN,GAAM,EAAGO,EAAO,EAAGC,EAAO5M,EAAK,OAEhD,GAAGqM,GAAK,EAAG,CACV,KAAMrF,EAAE4F,GAAM,CAAI,IAAIhB,EAAM,KAAK,IAAI,MAAQgB,EAAK5F,CAAC,EAClDyF,EAAMxC,EAAKyC,EAAM1F,EAAE4E,GAAKgB,EAAO,EAAI,CAAC,EAAKF,EAAMhD,EAAK,EAAE,WAAW1J,EAAMgH,EAAG4E,EAAK3B,EAAKyC,EAAI,CAAC,EAAI1F,GAAK4E,CAAO,CAC1G,OAAOc,IAAM,CACb,CAED,IAAIG,EAAON,EAAE,KAAMO,EAAKP,EAAE,KAAMQ,EAAKR,EAAE,KAAMS,EAAG,EAAGC,EAAG,EAAGC,EAAG,EAAGC,EAAM,EAAGpO,EAAE,EAAGqO,EAAG,EAIhF,IAHGR,EAAK,IAAMQ,EAAG1D,EAAK,EAAE,MAAM1J,EAAK,CAAC,EAAI8M,EAAKM,CAAE,EAAE,GAG7CpG,EAAE,EAAGA,EAAE4F,EAAM5F,IAAM,CAGtB,GAFAjI,EAAIqO,EAEDpG,EAAE,EAAE4F,EAAK,EAAG,CACdQ,EAAK1D,EAAK,EAAE,MAAM1J,EAAMgH,EAAE,CAAC,EAC3B,IAAIqG,EAAOrG,EAAE,EAAG,MAChB+F,EAAKM,CAAE,EAAEP,EAAKM,CAAE,EAChBN,EAAKM,CAAE,EAAEC,CACT,CACD,GAAGV,GAAM3F,EAAG,EACPgG,EAAG,MAASC,EAAG,QAAWL,EAAK5F,EAAG,MAClC2F,EAAK3F,IAAM6F,EAAKG,CAAE,EAAEhG,EAAE2F,EAAOK,GAAI,EAAIL,EAAK3F,GAC7C0F,EAAMhD,EAAK,EAAE,YAAc1C,GAAG4F,EAAK,GAAOD,GAAMC,EAAO,EAAE,EAAGC,EAAMG,EAAIG,EAAOnN,EAAKkN,EAAGlG,EAAEkG,EAAIjD,EAAKyC,CAAG,EAAIM,EAAGC,EAAGE,EAAM,EAAID,EAAGlG,GAG3H,IAAIsG,EAAM,EAEPtG,EAAE4F,EAAK,IAAGU,EAAM5D,EAAK,EAAE,WAAW1J,EAAMgH,EAAG+F,EAAMhO,EAAG,KAAK,IAAIuN,EAAI,CAAC,EAAEM,EAAK5F,CAAC,EAAGsF,EAAI,CAAC,CAAC,GAOtF,IAAIV,EAAM0B,IAAM,GAAIC,EAAMD,EAAI,MAC9B,GAAGA,GAAK,EAAG,CACV,IAAI1B,EAAM0B,IAAM,GAAIC,EAAMD,EAAI,MAC1BE,EAAMhB,EAAUZ,EAAKW,EAAE,GAAG,EAAIA,EAAE,KAAK,IAAIiB,CAAG,IAChD,IAAIC,EAAMjB,EAAUe,EAAKhB,EAAE,GAAG,EAAIA,EAAE,KAASkB,CAAG,IAAMN,GAASZ,EAAE,IAAIiB,CAAG,EAAIjB,EAAE,IAAIkB,CAAG,EACrFZ,EAAKG,CAAE,EAAKpB,GAAK,GAAK5E,EAAE2F,EAAQE,EAAKG,EAAG,CAAC,EAAKO,GAAK,GAAKC,GAAK,EAAGC,EAAMT,GAAI,EAC1EL,EAAO3F,EAAI4E,CACX,MACMW,EAAE,KAAKvM,EAAKgH,CAAC,CAAC,IACrBiG,GACA,CACD,CAKD,KAJGC,GAAIlG,GAAKhH,EAAK,QAAQ,KACrB2M,EAAK3F,IAAM6F,EAAKG,CAAE,EAAEhG,EAAE2F,EAAOK,GAAI,EAAIL,EAAK3F,GAC7C0F,EAAMhD,EAAK,EAAE,YAAY,EAAGmD,EAAMG,EAAIG,EAAOnN,EAAKkN,EAAGlG,EAAEkG,EAAIjD,EAAKyC,CAAG,EAAIM,EAAG,EAAIC,EAAG,EAAID,EAAGC,EAAGE,EAAM,EAAID,EAAGlG,GAElG0F,EAAI,GAAOA,IAClB,OAAOA,IAAM,CACb,EACDhD,EAAK,EAAE,WAAa,SAAS1J,EAAM,EAAG+M,EAAMhO,EAAG2O,EAAMC,EAAO,CAC3D,IAAIxB,EAAM,EAAE,MAASyB,EAAGb,EAAKZ,CAAE,EAE3B0B,EAAQ1B,EAAGyB,EAAM,MAAU,MAAU,GAAGA,GAAIzB,GAAMpN,GAAG2K,EAAK,EAAE,MAAM1J,EAAK,EAAE6N,CAAG,EAAG,MAAO,GAG1F,QAFIC,EAAG,EAAGC,EAAG,EACTC,EAAO,KAAK,IAAI,MAAQ,CAAC,EACvBH,GAAKG,GAAQ,EAAEL,GAAO,GAAKC,GAAIzB,GAAuC,CAC3E,GAAG2B,GAAI,GAAM9N,EAAK,EAAE8N,CAAE,GAAG9N,EAAK,EAAE8N,EAAGD,CAAG,EAAI,CACzC,IAAIrD,EAAKd,EAAK,EAAE,SAAS1J,EAAM,EAAG6N,CAAG,EACrC,GAAGrD,EAAGsD,EAAI,CACQ,GAAjBA,EAAGtD,EAAKuD,EAAGF,EAASC,GAAIJ,EAAM,MAC3BG,EAAI,EAAErD,IAAIA,EAAKqD,EAAI,GAEtB,QADII,EAAO,EACHC,EAAE,EAAGA,EAAE1D,EAAG,EAAG0D,IAAK,CACzB,IAAIC,EAAO,EAAEN,EAAIK,EAAI,MAAU,MAC3BlB,EAAKD,EAAKoB,CAAE,EACZC,EAAQD,EAAGnB,EAAM,MAAU,MAC5BoB,EAAKH,IAASA,EAAKG,EAAOR,EAAKO,EAClC,CACD,CACD,CAEDhC,EAAGyB,EAAKA,EAAKb,EAAKZ,CAAE,EACpB0B,GAAS1B,EAAGyB,EAAM,MAAU,KAC5B,CACD,OAAQE,GAAI,GAAIC,CAChB,EACDrE,EAAK,EAAE,SAAW,SAAS1J,EAAM,EAAG6N,EAAK,CACxC,GAAG7N,EAAK,CAAC,GAAGA,EAAK,EAAE6N,CAAG,GAAK7N,EAAK,EAAE,CAAC,GAAGA,EAAK,EAAE,EAAE6N,CAAG,GAAK7N,EAAK,EAAE,CAAC,GAAGA,EAAK,EAAE,EAAE6N,CAAG,EAAG,MAAO,GACxF,IAAIQ,EAAG,EAAGpH,EAAI,KAAK,IAAIjH,EAAK,OAAQ,EAAE,GAAG,EAEzC,IAF6C,GAAG,EAE1C,EAAEiH,GAAKjH,EAAK,CAAC,GAAGA,EAAK,EAAE6N,CAAG,GAAG,IACnC,OAAO,EAAEQ,CACT,EACD3E,EAAK,EAAE,MAAQ,SAAS1J,EAAM,EAAG,CAChC,OAAUA,EAAK,CAAC,GAAG,EAAKA,EAAK,EAAE,CAAC,IAAIA,EAAK,EAAE,CAAC,GAAG,GAAI,KAQnD,EAED0J,EAAK,MAAQ,EACbA,EAAK,EAAE,YAAc,SAAS4E,EAAQzB,EAAMG,EAAIG,EAAOnN,EAAKuO,EAAGC,EAAIvE,EAAKyC,EAAK,CAC5E,IAAIH,EAAI7C,EAAK,EAAE,EAAG+E,EAAQ/E,EAAK,EAAE,OAAQ+C,EAAQ/C,EAAK,EAAE,OAGpDgF,EAAGC,EAAIC,EAAIC,EAAIC,EAAMC,EAAMC,EAAMC,EAAMC,EAAO3C,EAAE,KAAK,GAAG,IAC5DmC,EAAIhF,EAAK,EAAE,SAAU,EAAEiF,EAAGD,EAAE,CAAC,EAAGE,EAAGF,EAAE,CAAC,EAAGG,EAAGH,EAAE,CAAC,EAAGI,EAAKJ,EAAE,CAAC,EAAGK,EAAKL,EAAE,CAAC,EAAGM,EAAKN,EAAE,CAAC,EAAGO,EAAKP,EAAE,CAAC,EAAGQ,EAAKR,EAAE,CAAC,EAEtG,IAAIS,GAAazC,EAAI,EAAG,EAAY,GAAIA,EAAI,EAAG,GAAf,GAAqB,IAAM8B,GAAI,GAC3DY,EAAUjC,EAAQzD,EAAK,EAAE,SAAS6C,EAAE,OAAQA,EAAE,IAAI,EAAI7C,EAAK,EAAE,SAAS6C,EAAE,OAAQA,EAAE,IAAI,EACtF8C,EAAUlC,EAAQzD,EAAK,EAAE,SAAS6C,EAAE,MAAQA,EAAE,IAAI,EAAI7C,EAAK,EAAE,SAAS6C,EAAE,MAAQA,EAAE,IAAI,EAC1F8C,GAAc,GAAK,EAAEL,EAAOtF,EAAK,EAAE,SAAS6C,EAAE,MAAOA,EAAE,IAAI,GAAKA,EAAE,KAAK,EAAE,EAAE,EAAIA,EAAE,KAAK,EAAE,EAAE,EAAIA,EAAE,KAAK,EAAE,EAAE,GAEzG,QAAQ2B,EAAE,EAAGA,EAAE,IAAKA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAAK,QAAQA,EAAE,EAAGA,EAAE,GAAIA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAAK,QAAQA,EAAE,EAAGA,EAAE,GAAIA,IAAK3B,EAAE,KAAK2B,CAAC,EAAE,EAEjH,IAAIoB,EAASH,EAAQC,GAAWD,EAAQE,EAAW,EAAMD,EAAQC,EAAU,EAAI,EAI/E,GAHAZ,EAAMxE,EAAKyC,EAAK4B,CAAM,EAAIG,EAAMxE,EAAKyC,EAAI,EAAG4C,CAAK,EAAI5C,GAAK,EAGvD4C,GAAO,EAAG,CACZ,KAAO5C,EAAI,GAAOA,IAClBA,EAAMhD,EAAK,EAAE,WAAW1J,EAAMuO,EAAIC,EAAIvE,EAAKyC,CAAG,CAC9C,KACI,CACJ,IAAI6C,EAAOC,EAEX,GADGF,GAAO,IAAMC,EAAMhD,EAAE,OAASiD,EAAMjD,EAAE,QACtC+C,GAAO,EAAG,CACZ5F,EAAK,EAAE,UAAU6C,EAAE,MAAOoC,CAAE,EAAIjF,EAAK,EAAE,SAAS6C,EAAE,MAAOoC,CAAE,EAC3DjF,EAAK,EAAE,UAAU6C,EAAE,MAAOqC,CAAE,EAAIlF,EAAK,EAAE,SAAS6C,EAAE,MAAOqC,CAAE,EAC3DlF,EAAK,EAAE,UAAU6C,EAAE,MAAOsC,CAAE,EAAInF,EAAK,EAAE,SAAS6C,EAAE,MAAOsC,CAAE,EAE3DU,EAAQhD,EAAE,MAAQiD,EAAQjD,EAAE,MAE5BE,EAAMxC,EAAKyC,EAAIoC,EAAK,GAAG,EAAIpC,GAAK,EAChCD,EAAMxC,EAAKyC,EAAIqC,EAAO,CAAC,EAAIrC,GAAK,EAChCD,EAAMxC,EAAKyC,EAAIsC,EAAO,CAAC,EAAItC,GAAK,EAEhC,QAAQ1F,EAAE,EAAGA,EAAEgI,EAAMhI,IAAKyF,EAAMxC,EAAKyC,EAAI1F,EAAE,EAAGuF,EAAE,OAAOA,EAAE,KAAKvF,CAAC,GAAG,GAAG,CAAC,CAAC,EAAK0F,GAAK,EAAGsC,EACpFtC,EAAMhD,EAAK,EAAE,UAAUuF,EAAM1C,EAAE,MAAOtC,EAAKyC,CAAG,EAC9CA,EAAMhD,EAAK,EAAE,UAAUwF,EAAM3C,EAAE,MAAOtC,EAAKyC,CAAG,CAC9C,CAGD,QADI5B,EAAIyD,EACAkB,GAAG,EAAGA,GAAGzC,EAAIyC,IAAI,EAAG,CAE3B,QADIC,GAAG7C,EAAK4C,EAAE,EAAG7D,GAAK8D,KAAK,GAAK5D,GAAMhB,GAAK4E,IAAK,GAAG,IAAI,GACjD5E,EAAIgB,IAAKY,EAAMhD,EAAK,EAAE,UAAU1J,EAAK8K,GAAK,EAAGyE,EAAOtF,EAAKyC,CAAG,EAElE,GAAGd,IAAK,EAAG,CACV,IAAI+D,GAAK9C,EAAK4C,GAAG,CAAC,EAAGlC,GAAKoC,IAAI,GAAKnC,GAAKmC,IAAI,EAAG,IAAKlC,GAAKkC,GAAG,IAC5DjD,EAAMhD,EAAK,EAAE,UAAU,IAAI8D,GAAK+B,EAAOtF,EAAKyC,CAAG,EAC/CD,EAAMxC,EAAKyC,EAAKd,GAAIW,EAAE,IAAIiB,EAAG,CAAC,EAAId,GAAKH,EAAE,IAAIiB,EAAG,EAEhDd,EAAMhD,EAAK,EAAE,UAAU+D,GAAK+B,EAAOvF,EAAKyC,CAAG,EAC3C+B,EAAMxE,EAAKyC,EAAKa,GAAIhB,EAAE,IAAIkB,EAAG,CAAC,EAAIf,GAAKH,EAAE,IAAIkB,EAAG,EAAI3C,GAAKc,EACzD,CACD,CACDc,EAAMhD,EAAK,EAAE,UAAU,IAAK6F,EAAOtF,EAAKyC,CAAG,CAC3C,CAED,OAAOA,CACP,EACDhD,EAAK,EAAE,WAAa,SAAS1J,EAAK8K,EAAIc,EAAI3B,EAAIyC,EAAK,CAClD,IAAIkD,EAAMlD,IAAM,EAChB,OAAAzC,EAAI2F,CAAE,EAAGhE,EAAO3B,EAAI2F,EAAG,CAAC,EAAGhE,IAAM,EAAK3B,EAAI2F,EAAG,CAAC,EAAE,IAAI3F,EAAI2F,CAAE,EAAI3F,EAAI2F,EAAG,CAAC,EAAE,IAAI3F,EAAI2F,EAAG,CAAC,EAAIA,GAAI,EAC5F3F,EAAI,IAAI,IAAI,WAAWjK,EAAK,OAAQ8K,EAAKc,CAAG,EAAGgE,CAAE,EAE1ClD,GAAQd,EAAI,GAAI,EACvB,EAMDlC,EAAK,EAAE,SAAW,UAAW,CAM5B,QALI6C,EAAI7C,EAAK,EAAE,EACXiF,EAAKjF,EAAK,EAAE,SAAS6C,EAAE,KAAMA,EAAE,MAAO,EAAE,EACxCqC,EAAKlF,EAAK,EAAE,SAAS6C,EAAE,KAAMA,EAAE,MAAO,EAAE,EACxC0C,EAAO,GAAIH,EAAOpF,EAAK,EAAE,UAAU6C,EAAE,MAAO0C,CAAI,EAChDC,EAAO,GAAIH,EAAOrF,EAAK,EAAE,UAAU6C,EAAE,MAAO2C,CAAI,EAC5ClI,EAAE,EAAGA,EAAEiI,EAAK,OAAQjI,GAAG,EAAGuF,EAAE,KAAK0C,EAAKjI,CAAC,CAAC,IAChD,QAAQA,EAAE,EAAGA,EAAEkI,EAAK,OAAQlI,GAAG,EAAGuF,EAAE,KAAK2C,EAAKlI,CAAC,CAAC,IAEhC,QADZ6H,EAAKnF,EAAK,EAAE,SAAS6C,EAAE,KAAMA,EAAE,MAAQ,CAAC,EACxCyC,EAAO,GAAWA,EAAK,GAAKzC,EAAE,OAAOA,EAAE,KAAKyC,EAAK,CAAC,GAAG,GAAG,CAAC,GAAG,GAAGA,IACnE,MAAO,CAACL,EAAIC,EAAIC,EAAIC,EAAMC,EAAMC,EAAMC,EAAMC,CAAI,CAChD,EACDxF,EAAK,EAAE,UAAW,SAASmG,EAAG,CAAc,QAAPhE,EAAE,CAAA,EAAa7E,EAAE,EAAGA,EAAE6I,EAAE,OAAQ7I,GAAG,EAAG6E,EAAE,KAAOgE,EAAE7I,EAAE,CAAC,CAAC,EAAI,OAAO6E,CAAK,EAC1GnC,EAAK,EAAE,QAAW,SAASmG,EAAG,CAAe,QAARhE,EAAG,GAAa7E,EAAE,EAAGA,EAAE6I,EAAE,OAAQ7I,GAAG,EAAM6I,EAAE7I,EAAE,CAAC,GAAG,IAAE6E,IAAI7E,GAAG,GAAG,KAAM,OAAO6E,CAAK,EACrHnC,EAAK,EAAE,SAAW,SAASoG,EAAMC,EAAK,CAAa,QAAN3I,EAAE,EAAYJ,EAAE,EAAGA,EAAE+I,EAAI,OAAQ/I,IAAKI,GAAI2I,EAAI/I,CAAC,EAAE8I,GAAM9I,GAAG,GAAG,CAAC,EAAI,OAAOI,CAAK,EAC3HsC,EAAK,EAAE,UAAY,SAASsG,EAAKF,EAAM7F,EAAKyC,EAAK,CAChD,QAAQ1F,EAAE,EAAGA,EAAEgJ,EAAI,OAAQhJ,GAAG,EAAG,CAChC,IAAIC,EAAI+I,EAAIhJ,CAAC,EAAGiJ,EAAMD,EAAIhJ,EAAE,CAAC,EAC7B0F,EAAMhD,EAAK,EAAE,UAAUzC,EAAG6I,EAAM7F,EAAKyC,CAAG,EACxC,IAAIwD,EAAMjJ,GAAG,GAAK,EAAKA,GAAG,GAAK,EAAI,EAChCA,EAAE,KAAOyC,EAAK,EAAE,OAAOO,EAAKyC,EAAKuD,EAAKC,CAAG,EAAIxD,GAAKwD,EACrD,CACD,OAAOxD,CACP,EACDhD,EAAK,EAAE,UAAY,SAASoG,EAAME,EAAK,CAChB,QAAlBpE,EAAIkE,EAAK,OAAelE,GAAK,GAAKkE,EAAKlE,EAAI,CAAC,GAAG,GAAGA,GAAK,EAC3D,QAAQ5E,EAAE,EAAGA,EAAE4E,EAAK5E,GAAG,EAAG,CACzB,IAAIC,EAAI6I,EAAK9I,EAAE,CAAC,EAAGmJ,EAAOnJ,EAAE,EAAE4E,EAAMkE,EAAK9I,EAAE,CAAC,EAAE,GAAMoJ,EAAQpJ,EAAE,EAAE4E,EAAMkE,EAAK9I,EAAE,CAAC,EAAE,GAAMqJ,EAAOrJ,GAAG,EAAI,GAAK8I,EAAK9I,EAAE,CAAC,EACjH,GAAGC,GAAG,GAAKkJ,GAAKlJ,GAAKmJ,GAAMnJ,EAAG,CAE7B,QADIqJ,EAAKtJ,EAAE,EACLsJ,EAAG,EAAE1E,GAAOkE,EAAKQ,EAAG,CAAC,GAAGrJ,GAAGqJ,GAAI,EACrC,IAAIC,EAAK,KAAK,IAAKD,EAAG,EAAEtJ,IAAK,EAAG,GAAG,EAChCuJ,EAAG,GAAIP,EAAI,KAAK,GAAIO,EAAG,CAAC,EACtBP,EAAI,KAAK,GAAIO,EAAG,EAAE,EACvBvJ,GAAKuJ,EAAG,EAAE,CACV,SACOtJ,GAAGoJ,GAAOF,GAAKlJ,GAAKmJ,GAAMnJ,EAAG,CAEpC,QADIqJ,EAAKtJ,EAAE,EACLsJ,EAAG,EAAE1E,GAAOkE,EAAKQ,EAAG,CAAC,GAAGrJ,GAAGqJ,GAAI,EACrC,IAAIC,EAAK,KAAK,IAAKD,EAAG,EAAEtJ,IAAK,EAAG,CAAC,EACjCgJ,EAAI,KAAK,GAAIO,EAAG,CAAC,EACjBvJ,GAAKuJ,EAAG,EAAE,CACV,MACIP,EAAI,KAAK/I,EAAG,CAAC,CAClB,CACD,OAAO2E,IAAM,CACb,EACDlC,EAAK,EAAE,SAAa,SAASqG,EAAKD,EAAMU,EAAM,CAC7C,IAAIC,EAAK,CAAA,EAAIC,EAAKX,EAAI,OAAQjC,EAAGgC,EAAK,OAAQ9I,EAAE,EAChD,IAAIA,EAAE,EAAGA,EAAE8G,EAAI9G,GAAG,EAAM8I,EAAK9I,CAAC,EAAE,EAAI8I,EAAK9I,EAAE,CAAC,EAAE,EAC9C,IAAIA,EAAE,EAAGA,EAAE0J,EAAI1J,IAAQ+I,EAAI/I,CAAC,GAAG,GAAGyJ,EAAK,KAAK,CAAC,IAAIzJ,EAAG,EAAE+I,EAAI/I,CAAC,CAAC,CAAC,EAC7D,IAAI8E,EAAM2E,EAAK,OAAQE,EAAGF,EAAK,MAAM,CAAC,EACtC,GAAG3E,GAAK,EAAG,MAAO,GAClB,GAAGA,GAAK,EAAG,CAAG,IAAI8E,EAAIH,EAAK,CAAC,EAAE,IAAKE,EAAGC,GAAK,EAAE,EAAE,EAAI,OAAAd,GAAMc,GAAK,GAAG,CAAC,EAAE,EAAId,GAAMa,GAAI,GAAG,CAAC,EAAE,EAAW,CAAK,CACxGF,EAAK,KAAK,SAASZ,EAAEhE,EAAE,CAAC,OAAOgE,EAAE,EAAEhE,EAAE,CAAE,CAAC,EACxC,IAAIgE,EAAEY,EAAK,CAAC,EAAG5E,EAAE4E,EAAK,CAAC,EAAGI,EAAG,EAAGC,EAAG,EAAGC,EAAG,EACzC,IAD6CN,EAAK,CAAC,EAAE,CAAC,IAAI,GAAG,EAAEZ,EAAE,EAAEhE,EAAE,EAAE,EAAEgE,EAAE,EAAEhE,EAAE,EAAE,CAAC,EAC5EiF,GAAIhF,EAAI,GACV+E,GAAIC,IAAOC,GAAIjF,GAAO2E,EAAKI,CAAE,EAAE,EAAEJ,EAAKM,CAAE,EAAE,GAAOlB,EAAEY,EAAKI,GAAI,EAAehB,EAAEY,EAAKM,GAAI,EACtFF,GAAIC,IAAOC,GAAIjF,GAAO2E,EAAKI,CAAE,EAAE,EAAEJ,EAAKM,CAAE,EAAE,GAAOlF,EAAE4E,EAAKI,GAAI,EAAehF,EAAE4E,EAAKM,GAAI,EACzFN,EAAKK,GAAI,EAAE,CAAC,IAAI,GAAG,EAAEjB,EAAE,EAAEhE,EAAE,EAAG,EAAEgE,EAAE,EAAEhE,CAAC,EAEtC,IAAImF,EAAOtH,EAAK,EAAE,SAAS+G,EAAKK,EAAG,CAAC,EAAG,CAAC,EAExC,IADGE,EAAKR,IAAS9G,EAAK,EAAE,cAAciH,EAAIH,EAAMQ,CAAI,EAAIA,EAAOR,GAC3DxJ,EAAE,EAAGA,EAAE8E,EAAK9E,IAAK8I,GAAMa,EAAG3J,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE2J,EAAG3J,CAAC,EAAE,EAClD,OAAOgK,CACP,EAEDtH,EAAK,EAAE,SAAY,SAAS,EAAGhL,EAAG,CACjC,OAAG,EAAE,KAAK,IAAO,EAAE,EAAEA,EAAWA,GACzB,KAAK,IAAKgL,EAAK,EAAE,SAAS,EAAE,EAAGhL,EAAE,CAAC,EAAIgL,EAAK,EAAE,SAAS,EAAE,EAAGhL,EAAE,CAAC,EACrE,EAEDgL,EAAK,EAAE,cAAgB,SAASuH,EAAKrC,EAAIoC,EAAM,CAC9C,IAAIhK,EAAE,EAAGkK,EAAM,GAAIF,EAAKpC,EAAKuC,EAAI,EAGjC,IAFAF,EAAI,KAAK,SAASpB,EAAEhE,EAAE,CAAC,OAAOA,EAAE,GAAGgE,EAAE,EAAIA,EAAE,EAAEhE,EAAE,EAAIA,EAAE,EAAEgE,EAAE,CAAE,CAAC,EAExD7I,EAAE,EAAGA,EAAEiK,EAAI,QAAgBA,EAAIjK,CAAC,EAAE,EAAE4H,EAAjB5H,IAAqB,CAAG,IAAIoK,EAAGH,EAAIjK,CAAC,EAAE,EAAIiK,EAAIjK,CAAC,EAAE,EAAE4H,EAAKuC,GAAKD,GAAO,GAAIF,EAAKI,EAAQ,CAE5G,IADAD,EAAMA,IAAOH,EAAKpC,EACZuC,EAAI,GAAG,CAAG,IAAIC,EAAGH,EAAIjK,CAAC,EAAE,EAAOoK,EAAGxC,GAAOqC,EAAIjK,CAAC,EAAE,IAAMmK,GAAM,GAAIvC,EAAGwC,EAAG,GAAepK,GAAO,CAClG,KAAMA,GAAG,EAAGA,IAAQiK,EAAIjK,CAAC,EAAE,GAAG4H,GAAMuC,EAAI,IAAMF,EAAIjK,CAAC,EAAE,IAAMmK,KAAcA,GAAK,GAAG,QAAQ,IAAI,WAAW,CACxG,EAEDzH,EAAK,EAAE,WAAa,SAAStK,EAAG2H,EAAK,CACpC,IAAIC,EAAE,EAAI,OAAGD,EAAIC,EAAE,EAAE,GAAG5H,IAAG4H,GAAG,IAAQD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAOD,EAAIC,EAAE,CAAC,GAAG5H,IAAG4H,GAAG,GAAWA,CACtI,EACD0C,EAAK,EAAE,UAAY,SAAS2H,EAAI9B,EAAOtF,EAAKyC,EAAK,CAChD,OAAAhD,EAAK,EAAE,OAAOO,EAAKyC,EAAK6C,EAAM8B,GAAI,CAAC,CAAC,EAC7B3E,EAAI6C,GAAO8B,GAAI,GAAG,CAAC,CAC1B,EASD3H,EAAK,EAAE,QAAU,SAAS1J,EAAM4J,EAAK,CACpC,IAAI0H,EAAG,WACP,GAAGtR,EAAK,CAAC,GAAG,GAAKA,EAAK,CAAC,GAAG,EAAG,OAAQ4J,GAAY,IAAI0H,EAAG,CAAC,EACzD,IAAIC,EAAE7H,EAAK,EAAG8H,EAAQD,EAAE,OAAQE,EAAQF,EAAE,OAAQG,EAAaH,EAAE,YAAaI,EAAYJ,EAAE,UAAWK,EAAUL,EAAE,UAAWM,EAAQN,EAAE,OACpIhF,EAAIgF,EAAE,EAENO,EAASlI,GAAK,KACfkI,IAAOlI,EAAM,IAAI0H,EAAItR,EAAK,SAAS,GAAI,CAAC,GAM3C,QAJIsO,EAAO,EAAGgB,EAAM,EAAGyC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGtD,EAAG,EAAGC,EAAG,EACtD9D,EAAM,EAAG4B,EAAM,EACfwF,EAAMC,EAEJ7D,GAAQ,GAAG,CAKhB,GAJAA,EAASkD,EAAMxR,EAAM0M,EAAO,CAAC,EAC7B4C,EAASkC,EAAMxR,EAAM0M,EAAI,EAAG,CAAC,EAAIA,GAAK,EAGnC4C,GAAO,EAAG,CACR5C,EAAI,IAAOA,GAAK,GAAGA,EAAI,IAC3B,IAAIkD,GAAMlD,IAAM,GAAG,EAAGd,EAAM5L,EAAK4P,EAAG,CAAC,EAAG5P,EAAK4P,EAAG,CAAC,GAAG,EACjDkC,IAAOlI,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAIc,CAAG,GACxChC,EAAI,IAAI,IAAI0H,EAAGtR,EAAK,OAAQA,EAAK,WAAW4P,EAAIhE,CAAG,EAAGd,CAAG,EAGzD4B,EAAQkD,EAAGhE,GAAM,EAAKd,GAAKc,EAAM,QACjC,CAGD,GAFGkG,IAAOlI,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAK,MAAM,GACzCwE,GAAO,IAAM4C,EAAO3F,EAAE,MAAQ4F,EAAO5F,EAAE,MAAQoC,EAAM,IAAUC,EAAM,IACrEU,GAAO,EAAG,CACZyC,EAAQN,EAAMzR,EAAM0M,EAAQ,CAAC,EAAE,IAC/BsF,EAAQP,EAAMzR,EAAM0M,EAAK,EAAG,CAAC,EAAI,EACjCuF,EAAQR,EAAMzR,EAAM0M,EAAI,GAAI,CAAC,EAAI,EAAIA,GAAK,GAG1C,QAAQ1F,EAAE,EAAGA,EAAE,GAAIA,GAAG,EAAMuF,EAAE,MAAMvF,CAAC,EAAE,EAAIuF,EAAE,MAAMvF,EAAE,CAAC,EAAE,EAExD,QADI8G,EAAK,EACD9G,EAAE,EAAGA,EAAEiL,EAAOjL,IAAK,CAAG,IAAIC,EAAEwK,EAAMzR,EAAM0M,EAAI1F,EAAE,EAAG,CAAC,EAAIuF,EAAE,OAAOA,EAAE,KAAKvF,CAAC,GAAG,GAAG,CAAC,EAAIC,EAAOA,EAAE6G,IAAGA,EAAG7G,EAAK,CAAKyF,GAAK,EAAEuF,EAC1HN,EAAUpF,EAAE,MAAOuB,CAAE,EACrB8D,EAAUrF,EAAE,MAAOuB,EAAIvB,EAAE,IAAI,EAE7B2F,EAAO3F,EAAE,KAAO4F,EAAO5F,EAAE,KAEzBG,EAAMgF,EAAWnF,EAAE,MAAO,GAAGuB,GAAI,EAAGiE,EAAKC,EAAOhS,EAAM0M,EAAKH,EAAE,KAAK,EAClE,IAAI6F,EAAMb,EAAE,SAAShF,EAAE,MAAU,EAAGwF,EAAOxF,EAAE,KAAK,EAAIoC,GAAM,GAAGyD,GAAK,EACpE,IAAIC,EAAMd,EAAE,SAAShF,EAAE,MAAOwF,EAAMC,EAAOzF,EAAE,KAAK,EAAIqC,GAAM,GAAGyD,GAAK,EAGpEV,EAAUpF,EAAE,MAAO6F,CAAG,EACtBR,EAAUrF,EAAE,MAAO6F,EAAKF,CAAI,EAG5BP,EAAUpF,EAAE,MAAO8F,CAAG,EACtBT,EAAUrF,EAAE,MAAO8F,EAAKF,CAAI,CAC5B,CAED,OAAY,CACX,IAAI3S,GAAO0S,EAAKL,EAAM7R,EAAM0M,CAAG,EAAIiC,CAAE,EAAIjC,GAAOlN,GAAK,GACrD,IAAIoR,GAAMpR,KAAO,EACjB,GAAI,EAAAoR,KAAM,GAAUhH,EAAIkB,GAAK,EAAI8F,OAC5B,IAAGA,IAAK,IAAQ,MAEpB,IAAI9E,GAAMhB,EAAI8F,GAAI,IAClB,GAAGA,GAAI,IAAK,CAAE,IAAI0B,GAAM/F,EAAE,KAAKqE,GAAI,GAAG,EAAI9E,GAAMhB,GAAOwH,KAAM,GAAKb,EAAMzR,EAAM0M,EAAK4F,GAAI,CAAC,EAAI5F,GAAO4F,GAAI,CAAK,CAG5G,IAAIC,GAAQJ,EAAKN,EAAM7R,EAAM0M,CAAG,EAAIkC,CAAE,EAAIlC,GAAO6F,GAAM,GACvD,IAAIC,GAAOD,KAAQ,EACfE,GAAMlG,EAAE,KAAKiG,EAAI,EAAGjF,IAAOkF,KAAM,GAAKjB,EAAMxR,EAAM0M,EAAK+F,GAAI,EAAE,EAOjE,IAPqE/F,GAAO+F,GAAI,GAM7EX,IAAOlI,EAAIF,EAAK,EAAE,OAAOE,EAAKkB,EAAK,MAAM,GACtCA,EAAIgB,IAAQlC,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMyC,EAAG,EAAM3D,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMyC,EAAG,EAAI3D,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMyC,EAAG,EAAI3D,EAAIkB,CAAG,EAAElB,EAAIkB,IAAMyC,EAAG,EACxHzC,EAAIgB,GAGL,CAED,CAGD,OAAOlC,EAAI,QAAQkB,EAAMlB,EAAMA,EAAI,MAAM,EAAEkB,CAAG,CAC9C,EACDpB,EAAK,EAAE,OAAO,SAASE,EAAKgC,EAAK,CAChC,IAAI8G,EAAG9I,EAAI,OAAS,GAAGgC,GAAK8G,EAAI,OAAO9I,EACvC,IAAI+I,EAAO,IAAI,WAAW,KAAK,IAAID,GAAI,EAAE9G,CAAG,CAAC,EAAI,OAAA+G,EAAK,IAAI/I,EAAI,CAAC,EAExD+I,CACP,EAEDjJ,EAAK,EAAE,YAAc,SAASwI,EAAMU,EAAIhH,EAAK5L,EAAM0M,EAAKoD,EAAM,CAG7D,QAFI2B,EAAQ/H,EAAK,EAAE,OAAQmI,EAAQnI,EAAK,EAAE,OACtC1C,EAAI,EACFA,EAAE4E,GAAK,CACZ,IAAIpM,EAAO0S,EAAKL,EAAM7R,EAAM0M,CAAG,EAAEkG,CAAE,EAAIlG,GAAKlN,EAAK,GACjD,IAAIoR,EAAMpR,IAAO,EACjB,GAAGoR,GAAK,GAAOd,EAAK9I,CAAC,EAAE4J,EAAM5J,QACxB,CACJ,IAAI6L,EAAK,EAAGlH,EAAI,EACbiF,GAAK,IACPjF,EAAK,EAAK8F,EAAMzR,EAAM0M,EAAK,CAAC,EAAKA,GAAO,EAAImG,EAAK/C,EAAK9I,EAAE,CAAC,GAElD4J,GAAK,IACZjF,EAAK,EAAK8F,EAAMzR,EAAM0M,EAAK,CAAC,EAAKA,GAAO,GAEjCkE,GAAK,KACZjF,EAAK,GAAK8F,EAAMzR,EAAM0M,EAAK,CAAC,EAAKA,GAAO,GAGzC,QADIoG,EAAK9L,EAAE2E,EACL3E,EAAE8L,GAAOhD,EAAK9I,CAAC,EAAE6L,EAAK7L,GAC5B,CACD,CACD,OAAO0F,CACP,EACDhD,EAAK,EAAE,SAAW,SAASvD,EAAK2E,EAAKc,EAAKkE,EAAM,CAE/C,QADIiD,EAAG,EAAG/L,EAAE,EAAG8G,EAAGgC,EAAK,SAAS,EAC1B9I,EAAE4E,GAAK,CAAG,IAAIxM,EAAE+G,EAAIa,EAAE8D,CAAG,EAAIgF,EAAM9I,GAAG,CAAG,EAAC,EAAI8I,GAAM9I,GAAG,GAAG,CAAC,EAAE5H,EAAOA,EAAE2T,IAAGA,EAAG3T,GAAI4H,GAAO,CAC7F,KAAMA,EAAE8G,GAAQgC,EAAM9I,GAAG,CAAG,EAAC,EAAI8I,GAAM9I,GAAG,GAAG,CAAC,EAAE,EAAIA,IACpD,OAAO+L,CACP,EAEDrJ,EAAK,EAAE,UAAY,SAASoG,EAAMkD,EAAU,CAKf,QAJxBzG,EAAI7C,EAAK,EAAE,EACXuJ,EAAWnD,EAAK,OAChBtQ,EAAM0T,EAAMvH,EAAG3E,EAAG4E,EAElBuH,EAAW5G,EAAE,SAAmBvF,EAAE,EAAGA,GAAGgM,EAAUhM,IAAKmM,EAASnM,CAAC,EAAE,EACvE,IAAIA,EAAE,EAAGA,EAAEiM,EAAUjM,GAAG,EAAGmM,EAASrD,EAAK9I,CAAC,CAAC,IAE3C,IAAIoM,EAAY7G,EAAE,UAIlB,IAFA/M,EAAO,EACP2T,EAAS,CAAC,EAAI,EACTD,EAAO,EAAGA,GAAQF,EAAUE,IAChC1T,EAAQA,EAAO2T,EAASD,EAAK,CAAC,GAAM,EACpCE,EAAUF,CAAI,EAAI1T,EAGnB,IAAKmM,EAAI,EAAGA,EAAIsH,EAAUtH,GAAG,EAC5BC,EAAMkE,EAAKnE,EAAE,CAAC,EACVC,GAAO,IACVkE,EAAKnE,CAAC,EAAIyH,EAAUxH,CAAG,EACvBwH,EAAUxH,CAAG,IAGf,EACDlC,EAAK,EAAE,UAAY,SAASoG,EAAMkD,EAAUK,EAAK,CAGhD,QAFIJ,EAAWnD,EAAK,OAChBvD,EAAE7C,EAAK,EAAE,EAAG4J,EAAM/G,EAAE,MAChBvF,EAAE,EAAGA,EAAEiM,EAAUjM,GAAG,EAAG,GAAG8I,EAAK9I,EAAE,CAAC,GAAG,EAK5C,QAJI4J,EAAM5J,GAAG,EACTwD,EAAKsF,EAAK9I,EAAE,CAAC,EAAGuM,EAAO3C,GAAK,EAAGpG,EAC/BgJ,EAAQR,EAASxI,EAAKqG,EAAKf,EAAK9I,CAAC,GAAGwM,EAAM1C,EAAKD,GAAM,GAAG2C,GAEtD3C,GAAIC,GAAI,CACb,IAAI2C,EAAKH,EAAIzC,CAAE,IAAK,GAAGmC,EACvBK,EAAII,CAAE,EAAEF,EAAM1C,GACd,CAEF,EACDnH,EAAK,EAAE,SAAW,SAASoG,EAAMkD,EAAU,CAE1C,QADIM,EAAM5J,EAAK,EAAE,EAAE,MAAOgK,EAAM,GAAGV,EAC3BhM,EAAE,EAAGA,EAAE8I,EAAK,OAAQ9I,GAAG,EAAG,CAAG,IAAI6J,EAAMf,EAAK9I,CAAC,GAAIgM,EAASlD,EAAK9I,EAAE,CAAC,EAAM8I,EAAK9I,CAAC,EAAIsM,EAAIzC,CAAE,IAAI6C,CAAO,CAC3G,EAGDhK,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAK6G,EAAQ,CAAGA,EAAMA,IAAM7G,EAAI,GAAK,IAAI1C,EAAG0C,IAAM,EAAKiH,EAAG3J,CAAC,GAAGuJ,EAAMI,EAAG3J,EAAE,CAAC,GAAIuJ,IAAM,CAA4B,EAC5I7J,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAK6G,EAAQ,CAAGA,EAAMA,IAAM7G,EAAI,GAAK,IAAI1C,EAAG0C,IAAM,EAAKiH,EAAG3J,CAAC,GAAGuJ,EAAMI,EAAG3J,EAAE,CAAC,GAAIuJ,IAAM,EAAKI,EAAG3J,EAAE,CAAC,GAAIuJ,IAAM,EAAO,EAE5I7J,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAKkH,EAAQ,CAAG,OAASD,EAAGjH,IAAM,CAAC,EAAKiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,MAA+BA,EAAI,IAAM,GAAGkH,GAAQ,CAAM,EAC/IlK,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAKkH,EAAQ,CAAG,OAASD,EAAGjH,IAAM,CAAC,EAAKiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,EAAMiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,OAAQA,EAAI,IAAM,GAAGkH,GAAQ,CAAM,EAK/IlK,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAK,CAChC,OAAQiH,EAAGjH,IAAM,CAAC,EAAKiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,EAAMiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,OAASA,EAAI,EAC5E,EACDhD,EAAK,EAAE,OAAQ,SAASiK,EAAIjH,EAAK,CAChC,OAAQiH,EAAGjH,IAAM,CAAC,EAAKiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,EAAMiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,GAAOiH,GAAIjH,IAAM,GAAG,CAAC,GAAG,OAASA,EAAI,EACpG,EACDhD,EAAK,EAAE,EAAI,UAAU,CACpB,IAAImK,EAAI,YAAaC,EAAI,YACzB,MAAO,CACN,UAAY,IAAID,EAAI,EAAE,EACtB,SAAY,IAAIA,EAAI,EAAE,EACtB,KAAO,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAI,EAC3E,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,EACzG,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,CAAC,EACzG,KAAO,IAAIA,EAAI,EAAE,EACjB,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,MAAM,MAAO,MAAO,KAAK,EACrI,IAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAK,EAAK,EAAI,GAAK,GAAK,GAAK,GAAK,GAAM,GAAM,GAAM,GAAQ,EAAO,CAAC,EACrI,KAAO,IAAIC,EAAI,EAAE,EACjB,MAAO,IAAID,EAAM,GAAG,EAAI,OAAQ,CAAE,EAClC,MAAO,IAAIA,EAAO,EAAE,EAAI,OAAQ,CAAE,EAClC,KAAO,IAAIA,EAAI,KAAK,EAAI,MAAQ,CAAA,EAAK,MAAM,CAAE,EAC7C,KAAO,IAAIA,EAAI,KAAK,EAAI,MAAQ,CAAE,EAClC,KAAO,IAAIA,EAAM,GAAG,EAAI,MAAQ,CAAE,EAElC,MAAO,IAAIA,EAAI,KAAK,EACpB,KAAO,IAAIC,EAAI,GAAG,EAAG,KAAO,IAAIA,EAAK,EAAE,EAAG,KAAO,IAAIA,EAAI,EAAE,EAC3D,KAAO,IAAIA,EAAI,IAAK,EACpB,KAAO,IAAID,EAAI,KAAK,EACpB,KAAO,IAAIA,EAAI,KAAK,CACtB,CACA,IAEC,UAAU,CAGV,QAFItH,EAAI7C,EAAK,EAAE,EACXkC,EAAM,MACF5E,EAAE,EAAGA,EAAE4E,EAAK5E,IAAK,CACxB,IAAI+M,EAAI/M,EACR+M,GAAOA,EAAI,cAAgB,GAAOA,EAAI,aAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,YAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,YAAe,EACrDA,GAAOA,EAAI,cAAgB,GAAOA,EAAI,WAAe,EACrDxH,EAAE,MAAMvF,CAAC,GAAO+M,IAAM,GAAOA,GAAK,MAAQ,EAC1C,CAED,SAASC,EAAMC,EAAKtI,EAAGuI,EAAI,CAAG,KAAMvI,KAAK,GAAGsI,EAAI,KAAK,EAAEC,CAAE,CAAK,CAE9D,QAAQlN,EAAE,EAAGA,EAAE,GAAIA,IAAQuF,EAAE,KAAKvF,CAAC,EAAGuF,EAAE,IAAIvF,CAAC,GAAG,EAAGuF,EAAE,IAAIvF,CAAC,EAAIuF,EAAE,KAAKvF,CAAC,EAAGuF,EAAE,IAAIvF,CAAC,GAAG,EAAGuF,EAAE,IAAIvF,CAAC,EAE7FgN,EAAMzH,EAAE,OAAQ,IAAK,CAAC,EAAIyH,EAAMzH,EAAE,OAAQ,IAAS,CAAC,EAAIyH,EAAMzH,EAAE,OAAQ,GAAS,CAAC,EAAIyH,EAAMzH,EAAE,OAAO,EAAQ,CAAC,EAQ9G7C,EAAK,EAAE,UAAU6C,EAAE,OAAQ,CAAC,EAC5B7C,EAAK,EAAE,UAAU6C,EAAE,OAAQ,EAAGA,EAAE,KAAK,EACrC7C,EAAK,EAAE,SAAU6C,EAAE,OAAQ,CAAC,EAE5ByH,EAAMzH,EAAE,OAAO,GAAG,CAAC,EAEnB7C,EAAK,EAAE,UAAU6C,EAAE,OAAQ,CAAC,EAC5B7C,EAAK,EAAE,UAAU6C,EAAE,OAAQ,EAAGA,EAAE,KAAK,EACrC7C,EAAK,EAAE,SAAU6C,EAAE,OAAQ,CAAC,EAE5ByH,EAAMzH,EAAE,MAAM,GAAG,CAAC,EAAIyH,EAAMzH,EAAE,MAAM,IAAI,CAAC,EAAIyH,EAAMzH,EAAE,MAAM,GAAG,CAAC,EAAIyH,EAAMzH,EAAE,MAAM,IAAI,CAAC,GAOtF,0CC1yBD,wEA6BA,MAAM4H,GAA0B,EAI1BC,GAAwB,EACxBC,GAAwB,EAExBC,GAA0B,EAKhC,SAASC,GAAO3K,EAAK,CAAE,IAAIgC,EAAMhC,EAAI,OAAQ,KAAO,EAAEgC,GAAO,GAAKhC,EAAIgC,CAAG,EAAI,CAAM,CAInF,MAAM4I,GAAe,EACfC,GAAe,EACfC,GAAe,EAGfC,GAAiB,EACjBC,GAAiB,IAQjBC,GAAkB,GAGlBC,GAAkB,IAGlBC,GAAkBD,GAAa,EAAID,GAGnCG,GAAkB,GAGlBC,GAAkB,GAGlBC,GAAkB,EAAIH,GAAY,EAGlCI,GAAkB,GAGlBC,GAAgB,GAQhBC,GAAc,EAGdC,GAAc,IAGdC,GAAc,GAGdC,GAAc,GAGdC,GAAc,GAIdC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAEtEC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,EAEhFC,GACJ,IAAI,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAElDC,GACJ,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAa3DC,GAAgB,IAGhBC,EAAgB,IAAI,OAAOhB,GAAY,GAAK,CAAC,EACnDR,GAAOwB,CAAY,EAOnB,MAAMC,GAAgB,IAAI,MAAMhB,GAAY,CAAC,EAC7CT,GAAOyB,EAAY,EAKnB,MAAMC,GAAgB,IAAI,MAAMH,EAAa,EAC7CvB,GAAO0B,EAAU,EAMjB,MAAMC,GAAgB,IAAI,MAAMtB,GAAcD,GAAc,CAAC,EAC7DJ,GAAO2B,EAAY,EAGnB,MAAMC,GAAgB,IAAI,MAAMtB,EAAc,EAC9CN,GAAO4B,EAAW,EAGlB,MAAMC,GAAgB,IAAI,MAAMpB,EAAS,EACzCT,GAAO6B,EAAS,EAIhB,SAASC,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,EAAY,CAE9E,KAAK,YAAeJ,EACpB,KAAK,WAAeC,EACpB,KAAK,WAAeC,EACpB,KAAK,MAAeC,EACpB,KAAK,WAAeC,EAGpB,KAAK,UAAeJ,GAAeA,EAAY,MACjD,CAGA,IAAIK,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,CACnB,CAIA,MAAMC,GAAUC,GAEPA,EAAO,IAAMjB,GAAWiB,CAAI,EAAIjB,GAAW,KAAOiB,IAAS,EAAE,EAQhEC,GAAY,CAAC/P,EAAGgQ,IAAM,CAG1BhQ,EAAE,YAAYA,EAAE,SAAS,EAAKgQ,EAAK,IACnChQ,EAAE,YAAYA,EAAE,SAAS,EAAKgQ,IAAM,EAAK,GAC3C,EAOMC,EAAY,CAACjQ,EAAGhH,EAAOwT,IAAW,CAElCxM,EAAE,SAAYgO,GAAWxB,GAC3BxM,EAAE,QAAWhH,GAASgH,EAAE,SAAY,MACpC+P,GAAU/P,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAShH,GAAUgV,GAAWhO,EAAE,SAClCA,EAAE,UAAYwM,EAASwB,KAEvBhO,EAAE,QAAWhH,GAASgH,EAAE,SAAY,MACpCA,EAAE,UAAYwM,EAElB,EAGM0D,EAAY,CAAClQ,EAAGrI,EAAG+Q,IAAS,CAEhCuH,EAAUjQ,EAAG0I,EAAK/Q,EAAI,CAAC,EAAY+Q,EAAK/Q,EAAI,EAAI,CAAC,EACnD,EAQMwY,GAAa,CAAC/X,EAAMoM,IAAQ,CAEhC,IAAI4L,EAAM,EACV,GACEA,GAAOhY,EAAO,EACdA,KAAU,EACVgY,IAAQ,QACD,EAAE5L,EAAM,GACjB,OAAO4L,IAAQ,CACjB,EAMMC,GAAYrQ,GAAM,CAElBA,EAAE,WAAa,IACjB+P,GAAU/P,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAS,EACXA,EAAE,SAAW,GAEJA,EAAE,UAAY,IACvBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,OAAS,IACxCA,EAAE,SAAW,EACbA,EAAE,UAAY,EAElB,EAaMsQ,GAAa,CAACtQ,EAAGuQ,IAAS,CAI9B,MAAM7H,EAAkB6H,EAAK,SACvB1E,EAAkB0E,EAAK,SACvBC,EAAkBD,EAAK,UAAU,YACjCE,EAAkBF,EAAK,UAAU,UACjCG,EAAkBH,EAAK,UAAU,WACjCI,EAAkBJ,EAAK,UAAU,WACjCjB,EAAkBiB,EAAK,UAAU,WACvC,IAAIK,EACArM,EAAGsM,EACH/E,EACAgF,EACAC,EACAC,EAAW,EAEf,IAAKlF,EAAO,EAAGA,GAAQiC,GAAYjC,IACjC9L,EAAE,SAAS8L,CAAI,EAAI,EAQrB,IAFApD,EAAK1I,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtC4Q,EAAI5Q,EAAE,SAAW,EAAG4Q,EAAI9C,GAAa8C,IACxCrM,EAAIvE,EAAE,KAAK4Q,CAAC,EACZ9E,EAAOpD,EAAKA,EAAKnE,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDuH,EAAOwD,IACTxD,EAAOwD,EACP0B,KAEFtI,EAAKnE,EAAI,EAAI,CAAC,EAAYuH,EAGtB,EAAAvH,EAAIsH,KAER7L,EAAE,SAAS8L,CAAI,IACfgF,EAAQ,EACJvM,GAAKoM,IACPG,EAAQJ,EAAMnM,EAAIoM,CAAI,GAExBI,EAAIrI,EAAKnE,EAAI,CAAC,EACdvE,EAAE,SAAW+Q,GAAKjF,EAAOgF,GACrBL,IACFzQ,EAAE,YAAc+Q,GAAKP,EAAMjM,EAAI,EAAI,CAAC,EAAYuM,KAGpD,GAAIE,IAAa,EAMjB,GAAG,CAED,IADAlF,EAAOwD,EAAa,EACbtP,EAAE,SAAS8L,CAAI,IAAM,GAAKA,IACjC9L,EAAE,SAAS8L,CAAI,IACf9L,EAAE,SAAS8L,EAAO,CAAC,GAAK,EACxB9L,EAAE,SAASsP,CAAU,IAIrB0B,GAAY,CAChB,OAAWA,EAAW,GAOpB,IAAKlF,EAAOwD,EAAYxD,IAAS,EAAGA,IAElC,IADAvH,EAAIvE,EAAE,SAAS8L,CAAI,EACZvH,IAAM,GACXsM,EAAI7Q,EAAE,KAAK,EAAE4Q,CAAC,EACV,EAAAC,EAAIhF,KACJnD,EAAKmI,EAAI,EAAI,CAAC,IAAc/E,IAE9B9L,EAAE,UAAY8L,EAAOpD,EAAKmI,EAAI,EAAI,CAAC,GAAanI,EAAKmI,EAAI,CAAC,EAC1DnI,EAAKmI,EAAI,EAAI,CAAC,EAAY/E,GAE5BvH,KAGN,EAWM0M,GAAY,CAACvI,EAAMmD,EAAUE,IAAa,CAK9C,MAAMC,EAAY,IAAI,MAAM+B,GAAa,CAAC,EAC1C,IAAI3V,EAAO,EACP0T,EACAvH,EAKJ,IAAKuH,EAAO,EAAGA,GAAQiC,GAAYjC,IACjC1T,EAAQA,EAAO2T,EAASD,EAAO,CAAC,GAAM,EACtCE,EAAUF,CAAI,EAAI1T,EASpB,IAAKmM,EAAI,EAAIA,GAAKsH,EAAUtH,IAAK,CAC/B,IAAIC,EAAMkE,EAAKnE,EAAI,EAAI,CAAC,EACpBC,IAAQ,IAEZkE,EAAKnE,EAAI,CAAC,EAAa4L,GAAWnE,EAAUxH,CAAG,IAAKA,CAAG,EAIxD,CACH,EAMM0M,GAAiB,IAAM,CAE3B,IAAI3M,EACAuH,EACAU,EACApU,EACA0X,EACJ,MAAM/D,EAAW,IAAI,MAAMgC,GAAa,CAAC,EAiBzC,IADAvB,EAAS,EACJpU,EAAO,EAAGA,EAAOqV,GAAiB,EAAGrV,IAExC,IADA2W,GAAY3W,CAAI,EAAIoU,EACfjI,EAAI,EAAGA,EAAK,GAAK+J,GAAYlW,CAAI,EAAImM,IACxCuK,GAAatC,GAAQ,EAAIpU,EAY7B,IAJA0W,GAAatC,EAAS,CAAC,EAAIpU,EAG3B0X,EAAO,EACF1X,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA4W,GAAU5W,CAAI,EAAI0X,EACbvL,EAAI,EAAGA,EAAK,GAAKgK,GAAYnW,CAAI,EAAImM,IACxCsK,GAAWiB,GAAM,EAAI1X,EAKzB,IADA0X,IAAS,EACF1X,EAAOwV,GAAWxV,IAEvB,IADA4W,GAAU5W,CAAI,EAAI0X,GAAQ,EACrBvL,EAAI,EAAGA,EAAK,GAAMgK,GAAYnW,CAAI,EAAI,EAAKmM,IAC9CsK,GAAW,IAAMiB,GAAM,EAAI1X,EAM/B,IAAK0T,EAAO,EAAGA,GAAQiC,GAAYjC,IACjCC,EAASD,CAAI,EAAI,EAInB,IADAvH,EAAI,EACGA,GAAK,KACVoK,EAAapK,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAwH,EAAS,CAAC,IAEZ,KAAOxH,GAAK,KACVoK,EAAapK,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAwH,EAAS,CAAC,IAEZ,KAAOxH,GAAK,KACVoK,EAAapK,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAwH,EAAS,CAAC,IAEZ,KAAOxH,GAAK,KACVoK,EAAapK,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAwH,EAAS,CAAC,IASZ,IAHAkF,GAAUtC,EAAchB,GAAY,EAAG5B,CAAQ,EAG1CxH,EAAI,EAAGA,EAAIqJ,GAAWrJ,IACzBqK,GAAarK,EAAI,EAAI,CAAC,EAAY,EAClCqK,GAAarK,EAAI,CAAC,EAAa4L,GAAW5L,EAAG,CAAC,EAIhDgL,GAAgB,IAAIN,GAAeN,EAAcL,GAAaZ,GAAa,EAAGC,GAAWI,EAAU,EACnGyB,GAAgB,IAAIP,GAAeL,GAAcL,GAAa,EAAYX,GAAWG,EAAU,EAC/F0B,GAAiB,IAAIR,GAAe,IAAI,MAAM,CAAC,EAAGT,GAAc,EAAWX,GAAYI,EAAW,CAGpG,EAMMkD,GAAcnR,GAAM,CAExB,IAAI,EAGJ,IAAK,EAAI,EAAG,EAAI2N,GAAY,IAAO3N,EAAE,UAAU,EAAI,CAAC,EAAa,EACjE,IAAK,EAAI,EAAG,EAAI4N,GAAY,IAAO5N,EAAE,UAAU,EAAI,CAAC,EAAa,EACjE,IAAK,EAAI,EAAG,EAAI6N,GAAY,IAAO7N,EAAE,QAAQ,EAAI,CAAC,EAAa,EAE/DA,EAAE,UAAUkO,GAAY,CAAC,EAAa,EACtClO,EAAE,QAAUA,EAAE,WAAa,EAC3BA,EAAE,SAAWA,EAAE,QAAU,CAC3B,EAMMoR,GAAapR,GACnB,CACMA,EAAE,SAAW,EACf+P,GAAU/P,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,CACf,EAMMqR,GAAU,CAAC3I,EAAM,EAAGmI,EAAGS,IAAU,CAErC,MAAMC,EAAM,EAAI,EACVC,EAAMX,EAAI,EAChB,OAAQnI,EAAK6I,CAAG,EAAa7I,EAAK8I,CAAG,GAC7B9I,EAAK6I,CAAG,IAAe7I,EAAK8I,CAAG,GAAcF,EAAM,CAAC,GAAKA,EAAMT,CAAC,CAC1E,EAQMY,GAAa,CAACzR,EAAG0I,EAAM3Q,IAAM,CAKjC,MAAMC,EAAIgI,EAAE,KAAKjI,CAAC,EAClB,IAAI+O,EAAI/O,GAAK,EACb,KAAO+O,GAAK9G,EAAE,WAER8G,EAAI9G,EAAE,UACRqR,GAAQ3I,EAAM1I,EAAE,KAAK8G,EAAI,CAAC,EAAG9G,EAAE,KAAK8G,CAAC,EAAG9G,EAAE,KAAK,GAC/C8G,IAGE,CAAAuK,GAAQ3I,EAAM1Q,EAAGgI,EAAE,KAAK8G,CAAC,EAAG9G,EAAE,KAAK,IAGvCA,EAAE,KAAKjI,CAAC,EAAIiI,EAAE,KAAK8G,CAAC,EACpB/O,EAAI+O,EAGJA,IAAM,EAER9G,EAAE,KAAKjI,CAAC,EAAIC,CACd,EASM0Z,GAAiB,CAAC1R,EAAGmI,EAAOC,IAAU,CAK1C,IAAI0H,EACAjK,EACA8L,EAAK,EACLvZ,EACAsY,EAEJ,GAAI1Q,EAAE,WAAa,EACjB,GACE8P,EAAO9P,EAAE,YAAYA,EAAE,QAAU2R,GAAI,EAAI,IACzC7B,IAAS9P,EAAE,YAAYA,EAAE,QAAU2R,GAAI,EAAI,MAAS,EACpD9L,EAAK7F,EAAE,YAAYA,EAAE,QAAU2R,GAAI,EAC/B7B,IAAS,EACXI,EAAUlQ,EAAG6F,EAAIsC,CAAK,GAItB/P,EAAO0W,GAAajJ,CAAE,EACtBqK,EAAUlQ,EAAG5H,EAAOsV,GAAa,EAAGvF,CAAK,EACzCuI,EAAQpC,GAAYlW,CAAI,EACpBsY,IAAU,IACZ7K,GAAMkJ,GAAY3W,CAAI,EACtB6X,EAAUjQ,EAAG6F,EAAI6K,CAAK,GAExBZ,IACA1X,EAAOyX,GAAOC,CAAI,EAGlBI,EAAUlQ,EAAG5H,EAAMgQ,CAAK,EACxBsI,EAAQnC,GAAYnW,CAAI,EACpBsY,IAAU,IACZZ,GAAQd,GAAU5W,CAAI,EACtB6X,EAAUjQ,EAAG8P,EAAMY,CAAK,UAOrBiB,EAAK3R,EAAE,UAGlBkQ,EAAUlQ,EAAGkO,GAAW/F,CAAK,CAC/B,EAWMyJ,GAAa,CAAC5R,EAAGuQ,IAAS,CAI9B,MAAM7H,EAAW6H,EAAK,SAChBC,EAAWD,EAAK,UAAU,YAC1BE,EAAYF,EAAK,UAAU,UAC3BlB,EAAWkB,EAAK,UAAU,MAChC,IAAIhM,EAAGsM,EACHhF,EAAW,GACXgG,EASJ,IAHA7R,EAAE,SAAW,EACbA,EAAE,SAAW8N,GAERvJ,EAAI,EAAGA,EAAI8K,EAAO9K,IACjBmE,EAAKnE,EAAI,CAAC,IAAe,GAC3BvE,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAI6L,EAAWtH,EAClCvE,EAAE,MAAMuE,CAAC,EAAI,GAGbmE,EAAKnE,EAAI,EAAI,CAAC,EAAY,EAS9B,KAAOvE,EAAE,SAAW,GAClB6R,EAAO7R,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAK6L,EAAW,EAAI,EAAEA,EAAW,EAC3DnD,EAAKmJ,EAAO,CAAC,EAAa,EAC1B7R,EAAE,MAAM6R,CAAI,EAAI,EAChB7R,EAAE,UAEEyQ,IACFzQ,EAAE,YAAcwQ,EAAMqB,EAAO,EAAI,CAAC,GAStC,IALAtB,EAAK,SAAW1E,EAKXtH,EAAKvE,EAAE,UAAY,EAAcuE,GAAK,EAAGA,IAAOkN,GAAWzR,EAAG0I,EAAMnE,CAAC,EAK1EsN,EAAOxC,EACP,GAGE9K,EAAIvE,EAAE,KAAK,GACXA,EAAE,KAAK,GAAiBA,EAAE,KAAKA,EAAE,UAAU,EAC3CyR,GAAWzR,EAAG0I,EAAM,GAGpBmI,EAAI7Q,EAAE,KAAK,GAEXA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIuE,EACvBvE,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAI6Q,EAGvBnI,EAAKmJ,EAAO,CAAC,EAAanJ,EAAKnE,EAAI,CAAC,EAAamE,EAAKmI,EAAI,CAAC,EAC3D7Q,EAAE,MAAM6R,CAAI,GAAK7R,EAAE,MAAMuE,CAAC,GAAKvE,EAAE,MAAM6Q,CAAC,EAAI7Q,EAAE,MAAMuE,CAAC,EAAIvE,EAAE,MAAM6Q,CAAC,GAAK,EACvEnI,EAAKnE,EAAI,EAAI,CAAC,EAAYmE,EAAKmI,EAAI,EAAI,CAAC,EAAYgB,EAGpD7R,EAAE,KAAK,CAAc,EAAG6R,IACxBJ,GAAWzR,EAAG0I,EAAM,SAEb1I,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,GAK9BsQ,GAAWtQ,EAAGuQ,CAAI,EAGlBU,GAAUvI,EAAMmD,EAAU7L,EAAE,QAAQ,CACtC,EAOM8R,GAAY,CAAC9R,EAAG0I,EAAMmD,IAAa,CAKvC,IAAItH,EACAwN,EAAU,GACVC,EAEAC,EAAUvJ,EAAK,EAAI,EAAI,CAAC,EAExBwJ,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAEd1J,GAAMmD,EAAW,GAAK,EAAI,CAAC,EAAY,MAElCtH,EAAI,EAAGA,GAAKsH,EAAUtH,IACzByN,EAASC,EACTA,EAAUvJ,GAAMnE,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE2N,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACjBpS,EAAE,QAAQgS,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAW/R,EAAE,QAAQgS,EAAS,CAAC,IAC9ChS,EAAE,QAAQmO,GAAU,CAAC,KAEZ+D,GAAS,GAClBlS,EAAE,QAAQoO,GAAY,CAAC,IAGvBpO,EAAE,QAAQqO,GAAc,CAAC,IAG3B6D,EAAQ,EACRH,EAAUC,EAENC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOMC,GAAY,CAACrS,EAAG0I,EAAMmD,IAAa,CAKvC,IAAItH,EACAwN,EAAU,GACVC,EAEAC,EAAUvJ,EAAK,EAAI,EAAI,CAAC,EAExBwJ,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAGT7N,EAAI,EAAGA,GAAKsH,EAAUtH,IAIzB,GAHAyN,EAASC,EACTA,EAAUvJ,GAAMnE,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAE2N,EAAQC,GAAaH,IAAWC,GAG/B,IAAIC,EAAQE,EACjB,GAAKlC,EAAUlQ,EAAGgS,EAAQhS,EAAE,OAAO,QAAY,EAAEkS,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACb7B,EAAUlQ,EAAGgS,EAAQhS,EAAE,OAAO,EAC9BkS,KAGFhC,EAAUlQ,EAAGmO,GAASnO,EAAE,OAAO,EAC/BiQ,EAAUjQ,EAAGkS,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IAClBhC,EAAUlQ,EAAGoO,GAAWpO,EAAE,OAAO,EACjCiQ,EAAUjQ,EAAGkS,EAAQ,EAAG,CAAC,IAGzBhC,EAAUlQ,EAAGqO,GAAarO,EAAE,OAAO,EACnCiQ,EAAUjQ,EAAGkS,EAAQ,GAAI,CAAC,GAG5BA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGlB,EAOME,GAAiBtS,GAAM,CAE3B,IAAIuS,EAgBJ,IAbAT,GAAU9R,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3C8R,GAAU9R,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAG3C4R,GAAW5R,EAAGA,EAAE,OAAO,EASlBuS,EAAc1E,GAAa,EAAG0E,GAAe,GAC5CvS,EAAE,QAAQyO,GAAS8D,CAAW,EAAI,EAAI,CAAC,IAAc,EADNA,IACnD,CAKF,OAAAvS,EAAE,SAAW,GAAKuS,EAAc,GAAK,EAAI,EAAI,EAItCA,CACT,EAQMC,GAAiB,CAACxS,EAAGyS,EAAQC,EAAQC,IAAY,CAIrD,IAAIC,EASJ,IAHA3C,EAAUjQ,EAAGyS,EAAS,IAAK,CAAC,EAC5BxC,EAAUjQ,EAAG0S,EAAS,EAAK,CAAC,EAC5BzC,EAAUjQ,EAAG2S,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B3C,EAAUjQ,EAAGA,EAAE,QAAQyO,GAASmE,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUrS,EAAGA,EAAE,UAAWyS,EAAS,CAAC,EAGpCJ,GAAUrS,EAAGA,EAAE,UAAW0S,EAAS,CAAC,CAEtC,EAgBMG,GAAoB7S,GAAM,CAK9B,IAAI8S,EAAa,WACbvO,EAGJ,IAAKA,EAAI,EAAGA,GAAK,GAAIA,IAAKuO,KAAgB,EACxC,GAAKA,EAAa,GAAO9S,EAAE,UAAUuE,EAAI,CAAC,IAAe,EACvD,OAAOyI,GAKX,GAAIhN,EAAE,UAAU,EAAI,CAAC,IAAe,GAAKA,EAAE,UAAU,GAAK,CAAC,IAAe,GACtEA,EAAE,UAAU,GAAK,CAAC,IAAe,EACnC,OAAOiN,GAET,IAAK1I,EAAI,GAAIA,EAAImJ,GAAYnJ,IAC3B,GAAIvE,EAAE,UAAUuE,EAAI,CAAC,IAAe,EAClC,OAAO0I,GAOX,OAAOD,EACT,EAGA,IAAI+F,GAAmB,GAKvB,MAAMC,GAAchT,GACpB,CAEO+S,KACH7B,KACA6B,GAAmB,IAGrB/S,EAAE,OAAU,IAAI0P,GAAS1P,EAAE,UAAWuP,EAAa,EACnDvP,EAAE,OAAU,IAAI0P,GAAS1P,EAAE,UAAWwP,EAAa,EACnDxP,EAAE,QAAU,IAAI0P,GAAS1P,EAAE,QAASyP,EAAc,EAElDzP,EAAE,OAAS,EACXA,EAAE,SAAW,EAGbmR,GAAWnR,CAAC,CACd,EAMMiT,GAAqB,CAACjT,EAAGwC,EAAK0Q,EAAYC,IAAS,CAMvDlD,EAAUjQ,GAAIoN,IAAgB,IAAM+F,EAAO,EAAI,GAAI,CAAC,EACpD/B,GAAUpR,CAAC,EACX+P,GAAU/P,EAAGkT,CAAU,EACvBnD,GAAU/P,EAAG,CAACkT,CAAU,EACpBA,GACFlT,EAAE,YAAY,IAAIA,EAAE,OAAO,SAASwC,EAAKA,EAAM0Q,CAAU,EAAGlT,EAAE,OAAO,EAEvEA,EAAE,SAAWkT,CACf,EAOME,GAAepT,GAAM,CACzBiQ,EAAUjQ,EAAGqN,IAAgB,EAAG,CAAC,EACjC6C,EAAUlQ,EAAGkO,GAAWS,CAAY,EACpC0B,GAASrQ,CAAC,CACZ,EAOMqT,GAAoB,CAACrT,EAAGwC,EAAK0Q,EAAYC,IAAS,CAMtD,IAAIG,EAAUC,EACVhB,EAAc,EAGdvS,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAckN,KACvBlN,EAAE,KAAK,UAAY6S,GAAiB7S,CAAC,GAIvC4R,GAAW5R,EAAGA,EAAE,MAAM,EAItB4R,GAAW5R,EAAGA,EAAE,MAAM,EAUtBuS,EAAcD,GAActS,CAAC,EAG7BsT,EAAYtT,EAAE,QAAU,EAAI,IAAO,EACnCuT,EAAevT,EAAE,WAAa,EAAI,IAAO,EAMrCuT,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAAc9Q,IAAQ,GAS3CyQ,GAAmBjT,EAAGwC,EAAK0Q,EAAYC,CAAI,EAElCnT,EAAE,WAAa+M,IAAawG,IAAgBD,GAErDrD,EAAUjQ,GAAIqN,IAAgB,IAAM8F,EAAO,EAAI,GAAI,CAAC,EACpDzB,GAAe1R,EAAG2O,EAAcC,EAAY,IAG5CqB,EAAUjQ,GAAIsN,IAAa,IAAM6F,EAAO,EAAI,GAAI,CAAC,EACjDX,GAAexS,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAGuS,EAAc,CAAC,EAC/Eb,GAAe1R,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5CmR,GAAWnR,CAAC,EAERmT,GACF/B,GAAUpR,CAAC,CAIf,EAMMwT,GAAc,CAACxT,EAAG8P,EAAMjK,KAK5B7F,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI8P,EAC1C9P,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI8P,GAAQ,EAClD9P,EAAE,YAAYA,EAAE,QAAUA,EAAE,UAAU,EAAI6F,EACtCiK,IAAS,EAEX9P,EAAE,UAAU6F,EAAK,CAAC,KAElB7F,EAAE,UAEF8P,IAKA9P,EAAE,WAAW8O,GAAajJ,CAAE,EAAI6H,GAAa,GAAK,CAAC,IACnD1N,EAAE,UAAU6P,GAAOC,CAAI,EAAI,CAAC,KAGtB9P,EAAE,WAAaA,EAAE,SAG3B,IAAIyT,GAAcT,GACdU,GAAqBT,GACrBU,GAAqBN,GACrBO,GAAcJ,GACdK,GAAcT,GAEdU,GAAQ,CACX,SAAUL,GACV,iBAAkBC,GAClB,gBAAiBC,GACjB,UAAWC,GACX,UAAWC,EACZ,EAkDIE,GAzBY,CAACC,EAAOxR,EAAKgC,EAAKc,IAAQ,CACxC,IAAI2O,EAAMD,EAAQ,MAAS,EACvBE,EAAOF,IAAU,GAAM,MAAS,EAChCzP,EAAI,EAER,KAAOC,IAAQ,GAAG,CAIhBD,EAAIC,EAAM,IAAO,IAAOA,EACxBA,GAAOD,EAEP,GACE0P,EAAMA,EAAKzR,EAAI8C,GAAK,EAAI,EACxB4O,EAAMA,EAAKD,EAAK,QACT,EAAE1P,GAEX0P,GAAM,MACNC,GAAM,KACP,CAED,OAAQD,EAAMC,GAAM,GAAM,CAC5B,EA6BA,MAAMC,GAAY,IAAM,CACtB,IAAIxc,EAAGyc,EAAQ,GAEf,QAAS7P,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B5M,EAAI4M,EACJ,QAASxM,EAAI,EAAGA,EAAI,EAAGA,IACrBJ,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDyc,EAAM7P,CAAC,EAAI5M,CACZ,CAED,OAAOyc,CACT,EAGMC,GAAW,IAAI,YAAYF,GAAS,CAAE,EAiB5C,IAAIG,EAdU,CAAC3Q,EAAKnB,EAAKgC,EAAKc,IAAQ,CACpC,MAAMjB,EAAIgQ,GACJ3P,EAAMY,EAAMd,EAElBb,GAAO,GAEP,QAAS/D,EAAI0F,EAAK1F,EAAI8E,EAAK9E,IACzB+D,EAAOA,IAAQ,EAAKU,GAAGV,EAAMnB,EAAI5C,CAAC,GAAK,GAAI,EAG7C,OAAQ+D,EAAO,EACjB,EAwBI4Q,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACV,EAqBIC,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GACnB,YAAmB,GACnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,CAE5B,EAqBA,KAAM,CAAE,SAAAC,GAAU,iBAAAC,GAAkB,gBAAAC,GAAiB,UAAAC,GAAW,UAAAC,EAAW,EAAGf,GAQxE,CACJ,WAAYgB,GAAc,gBAAAC,GAAiB,aAAcC,GAAgB,SAAUC,EAAY,QAASC,GACxG,KAAMC,EAAQ,aAAcC,GAAgB,eAAgBC,EAAkB,aAAcC,GAAgB,YAAaC,GACzH,sBAAuBC,GACvB,WAAAC,GAAY,eAAAC,GAAgB,MAAAC,GAAO,QAAAC,GAAS,mBAAoBC,GAChE,UAAAC,GACA,WAAYC,EACd,EAAIvB,GAKEwB,GAAgB,EAEhBC,GAAc,GAEdC,GAAgB,EAGhBC,GAAgB,GAIhBC,GAFgB,IAEW,EAAID,GAE/BE,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,GAAU,EAE9BxK,GAAY,GAGZ4K,EAAY,EACZC,GAAY,IACZC,EAAiBD,GAAYD,EAAY,EAEzCG,GAAc,GAEdC,GAAiB,GAEjBC,GAAiB,GAEjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAiB,GACjBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAgB,IAEhBC,EAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAEpBC,GAAU,EAEVC,GAAM,CAACC,EAAMC,KACjBD,EAAK,IAAMnD,GAASoD,CAAS,EACtBA,GAGH/E,GAAQ7B,GACHA,EAAK,GAAOA,EAAK,EAAI,EAAI,GAG9B6G,GAAQpV,GAAQ,CACpB,IAAIgC,EAAMhC,EAAI,OAAQ,KAAO,EAAEgC,GAAO,GAAKhC,EAAIgC,CAAG,EAAI,CACxD,EAOMqT,GAAc7X,GAAM,CACxB,IAAI,EAAG6Q,EACHvT,EACAwa,EAAQ9X,EAAE,OAEd,EAAIA,EAAE,UACN1C,EAAI,EACJ,GACEuT,EAAI7Q,EAAE,KAAK,EAAE1C,CAAC,EACd0C,EAAE,KAAK1C,CAAC,EAAKuT,GAAKiH,EAAQjH,EAAIiH,EAAQ,QAC/B,EAAE,GACX,EAAIA,EAEJxa,EAAI,EACJ,GACEuT,EAAI7Q,EAAE,KAAK,EAAE1C,CAAC,EACd0C,EAAE,KAAK1C,CAAC,EAAKuT,GAAKiH,EAAQjH,EAAIiH,EAAQ,QAI/B,EAAE,EAEb,EAOA,IAAIC,GAJY,CAAC/X,EAAG2F,EAAM/M,KAAW+M,GAAQ3F,EAAE,WAAcpH,GAAQoH,EAAE,UAavE,MAAMgY,EAAiBN,GAAS,CAC9B,MAAM1X,EAAI0X,EAAK,MAGf,IAAIlT,EAAMxE,EAAE,QACRwE,EAAMkT,EAAK,YACblT,EAAMkT,EAAK,WAETlT,IAAQ,IAEZkT,EAAK,OAAO,IAAI1X,EAAE,YAAY,SAASA,EAAE,YAAaA,EAAE,YAAcwE,CAAG,EAAGkT,EAAK,QAAQ,EACzFA,EAAK,UAAalT,EAClBxE,EAAE,aAAgBwE,EAClBkT,EAAK,WAAalT,EAClBkT,EAAK,WAAalT,EAClBxE,EAAE,SAAgBwE,EACdxE,EAAE,UAAY,IAChBA,EAAE,YAAc,GAEpB,EAGMiY,EAAmB,CAACjY,EAAGmT,IAAS,CACpCwB,GAAgB3U,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAamT,CAAI,EAC9FnT,EAAE,YAAcA,EAAE,SAClBgY,EAAchY,EAAE,IAAI,CACtB,EAGMkY,EAAW,CAAClY,EAAGyE,IAAM,CACzBzE,EAAE,YAAYA,EAAE,SAAS,EAAIyE,CAC/B,EAQM0T,GAAc,CAACnY,EAAGyE,IAAM,CAI5BzE,EAAE,YAAYA,EAAE,SAAS,EAAKyE,IAAM,EAAK,IACzCzE,EAAE,YAAYA,EAAE,SAAS,EAAIyE,EAAI,GACnC,EAUM2T,GAAW,CAACV,EAAMlV,EAAK6V,EAAO9iB,IAAS,CAE3C,IAAIiP,EAAMkT,EAAK,SAGf,OADIlT,EAAMjP,IAAQiP,EAAMjP,GACpBiP,IAAQ,EAAY,GAExBkT,EAAK,UAAYlT,EAGjBhC,EAAI,IAAIkV,EAAK,MAAM,SAASA,EAAK,QAASA,EAAK,QAAUlT,CAAG,EAAG6T,CAAK,EAChEX,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQ3D,GAAU2D,EAAK,MAAOlV,EAAKgC,EAAK6T,CAAK,EAG3CX,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQpD,EAAQoD,EAAK,MAAOlV,EAAKgC,EAAK6T,CAAK,GAGlDX,EAAK,SAAWlT,EAChBkT,EAAK,UAAYlT,EAEVA,EACT,EAYM8T,GAAgB,CAACtY,EAAGuY,IAAc,CAEtC,IAAIC,EAAexY,EAAE,iBACjByY,EAAOzY,EAAE,SACT/E,EACAuJ,EACAkU,EAAW1Y,EAAE,YACb2Y,EAAa3Y,EAAE,WACnB,MAAM4Y,EAAS5Y,EAAE,SAAYA,EAAE,OAAS0W,EACpC1W,EAAE,UAAYA,EAAE,OAAS0W,GAAiB,EAExCmC,EAAO7Y,EAAE,OAET8Y,EAAQ9Y,EAAE,OACV2F,EAAQ3F,EAAE,KAMV+Y,EAAS/Y,EAAE,SAAWyW,GAC5B,IAAIuC,EAAaH,EAAKJ,EAAOC,EAAW,CAAC,EACrCO,EAAaJ,EAAKJ,EAAOC,CAAQ,EAQjC1Y,EAAE,aAAeA,EAAE,aACrBwY,IAAiB,GAKfG,EAAa3Y,EAAE,YAAa2Y,EAAa3Y,EAAE,WAI/C,EAaE,IAXA/E,EAAQsd,EAWJ,EAAAM,EAAK5d,EAAQyd,CAAQ,IAAUO,GAC/BJ,EAAK5d,EAAQyd,EAAW,CAAC,IAAMM,GAC/BH,EAAK5d,CAAK,IAAqB4d,EAAKJ,CAAI,GACxCI,EAAK,EAAE5d,CAAK,IAAmB4d,EAAKJ,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRxd,IAMA,EAAG,OAEM4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAAK4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAC/D4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAAK4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAC/D4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAAK4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAC/D4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAAK4d,EAAK,EAAEJ,CAAI,IAAMI,EAAK,EAAE5d,CAAK,GAC/Dwd,EAAOM,GAOhB,GAHAvU,EAAMiS,IAAasC,EAASN,GAC5BA,EAAOM,EAAStC,GAEZjS,EAAMkU,EAAU,CAGlB,GAFA1Y,EAAE,YAAcuY,EAChBG,EAAWlU,EACPA,GAAOmU,EACT,MAEFK,EAAaH,EAAKJ,EAAOC,EAAW,CAAC,EACrCO,EAAaJ,EAAKJ,EAAOC,CAAQ,CAClC,SACOH,EAAY5S,EAAK4S,EAAYO,CAAK,GAAKF,GAAS,EAAEJ,IAAiB,GAE7E,OAAIE,GAAY1Y,EAAE,UACT0Y,EAEF1Y,EAAE,SACX,EAaMkZ,GAAelZ,GAAM,CAEzB,MAAMmZ,EAAUnZ,EAAE,OAClB,IAAIuE,EAAG6U,EAAMzc,EAIb,EAAG,CAkCD,GAjCAyc,EAAOpZ,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAYmZ,GAAWA,EAAUzC,KAErC1W,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASmZ,EAASA,EAAUA,EAAUC,CAAI,EAAG,CAAC,EACpEpZ,EAAE,aAAemZ,EACjBnZ,EAAE,UAAYmZ,EAEdnZ,EAAE,aAAemZ,EACbnZ,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,UAEf6X,GAAW7X,CAAC,EACZoZ,GAAQD,GAENnZ,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJAuE,EAAI6T,GAASpY,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAWoZ,CAAI,EAC7DpZ,EAAE,WAAauE,EAGXvE,EAAE,UAAYA,EAAE,QAAUwW,EAS5B,IARA7Z,EAAMqD,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAOrD,CAAG,EAGtBqD,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM,CAAC,CAAC,EAIrCqD,EAAE,SAEPA,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM6Z,EAAY,CAAC,CAAC,EAExDxW,EAAE,KAAKrD,EAAMqD,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAIrD,EAClBA,IACAqD,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASwW,KAA7B,CASR,OAAWxW,EAAE,UAAY0W,GAAiB1W,EAAE,KAAK,WAAa,EAsC9D,EAiBMqZ,GAAiB,CAACrZ,EAAGsZ,IAAU,CAMnC,IAAIC,EAAYvZ,EAAE,iBAAmB,EAAIA,EAAE,OAASA,EAAE,OAASA,EAAE,iBAAmB,EAMhFwE,EAAKgV,EAAMC,EAAMtG,EAAO,EACxBuG,EAAO1Z,EAAE,KAAK,SAClB,EAAG,CAyBD,GApBAwE,EAAM,MACNiV,EAAQzZ,EAAE,SAAW,IAAO,EACxBA,EAAE,KAAK,UAAYyZ,IAIvBA,EAAOzZ,EAAE,KAAK,UAAYyZ,EAC1BD,EAAOxZ,EAAE,SAAWA,EAAE,YAClBwE,EAAMgV,EAAOxZ,EAAE,KAAK,WACtBwE,EAAMgV,EAAOxZ,EAAE,KAAK,UAElBwE,EAAMiV,IACRjV,EAAMiV,GAQJjV,EAAM+U,IAAe/U,IAAQ,GAAK8U,IAAUrE,GAC5BqE,IAAUxE,IACVtQ,IAAQgV,EAAOxZ,EAAE,KAAK,WACxC,MAMFmT,EAAOmG,IAAUrE,GAAczQ,IAAQgV,EAAOxZ,EAAE,KAAK,SAAW,EAAI,EACpE0U,GAAiB1U,EAAG,EAAG,EAAGmT,CAAI,EAG9BnT,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAIwE,EAC/BxE,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAIwE,GAAO,EACtCxE,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAACwE,EAChCxE,EAAE,YAAYA,EAAE,QAAU,CAAC,EAAI,CAACwE,GAAO,EAGvCwT,EAAchY,EAAE,IAAI,EAShBwZ,IACEA,EAAOhV,IACTgV,EAAOhV,GAGTxE,EAAE,KAAK,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,YAAaA,EAAE,YAAcwZ,CAAI,EAAGxZ,EAAE,KAAK,QAAQ,EACzFA,EAAE,KAAK,UAAYwZ,EACnBxZ,EAAE,KAAK,WAAawZ,EACpBxZ,EAAE,KAAK,WAAawZ,EACpBxZ,EAAE,aAAewZ,EACjBhV,GAAOgV,GAMLhV,IACF4T,GAASpY,EAAE,KAAMA,EAAE,KAAK,OAAQA,EAAE,KAAK,SAAUwE,CAAG,EACpDxE,EAAE,KAAK,UAAYwE,EACnBxE,EAAE,KAAK,WAAawE,EACpBxE,EAAE,KAAK,WAAawE,EAE1B,OAAW2O,IAAS,GA6ClB,OArCAuG,GAAQ1Z,EAAE,KAAK,SACX0Z,IAIEA,GAAQ1Z,EAAE,QACZA,EAAE,QAAU,EAEZA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAUA,EAAE,OAAQA,EAAE,KAAK,OAAO,EAAG,CAAC,EAChFA,EAAE,SAAWA,EAAE,OACfA,EAAE,OAASA,EAAE,WAGTA,EAAE,YAAcA,EAAE,UAAY0Z,IAEhC1Z,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEAA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAIjBA,EAAE,OAAO,IAAIA,EAAE,KAAK,MAAM,SAASA,EAAE,KAAK,QAAU0Z,EAAM1Z,EAAE,KAAK,OAAO,EAAGA,EAAE,QAAQ,EACrFA,EAAE,UAAY0Z,EACd1Z,EAAE,QAAU0Z,EAAO1Z,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAAS0Z,GAEjE1Z,EAAE,YAAcA,EAAE,UAEhBA,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAIfmT,EACKoE,GAIL+B,IAAUxE,IAAgBwE,IAAUrE,GACtCjV,EAAE,KAAK,WAAa,GAAKA,EAAE,WAAaA,EAAE,YACnCqX,IAIToC,EAAOzZ,EAAE,YAAcA,EAAE,SACrBA,EAAE,KAAK,SAAWyZ,GAAQzZ,EAAE,aAAeA,EAAE,SAE/CA,EAAE,aAAeA,EAAE,OACnBA,EAAE,UAAYA,EAAE,OAEhBA,EAAE,OAAO,IAAIA,EAAE,OAAO,SAASA,EAAE,OAAQA,EAAE,OAASA,EAAE,QAAQ,EAAG,CAAC,EAC9DA,EAAE,QAAU,GACdA,EAAE,UAEJyZ,GAAQzZ,EAAE,OACNA,EAAE,OAASA,EAAE,WACfA,EAAE,OAASA,EAAE,WAGbyZ,EAAOzZ,EAAE,KAAK,WAChByZ,EAAOzZ,EAAE,KAAK,UAEZyZ,IACFrB,GAASpY,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAUyZ,CAAI,EAC3CzZ,EAAE,UAAYyZ,EACdzZ,EAAE,QAAUyZ,EAAOzZ,EAAE,OAASA,EAAE,OAASA,EAAE,OAASA,EAAE,OAASyZ,GAE7DzZ,EAAE,WAAaA,EAAE,WACnBA,EAAE,WAAaA,EAAE,UAQnByZ,EAAQzZ,EAAE,SAAW,IAAO,EAE5ByZ,EAAOzZ,EAAE,iBAAmByZ,EAAO,MAAwB,MAAwBzZ,EAAE,iBAAmByZ,EACxGF,EAAYE,EAAOzZ,EAAE,OAASA,EAAE,OAASyZ,EACzCD,EAAOxZ,EAAE,SAAWA,EAAE,aAClBwZ,GAAQD,IACPC,GAAQF,IAAUrE,IAAeqE,IAAUxE,IAC7C9U,EAAE,KAAK,WAAa,GAAKwZ,GAAQC,KAClCjV,EAAMgV,EAAOC,EAAOA,EAAOD,EAC3BrG,EAAOmG,IAAUrE,GAAcjV,EAAE,KAAK,WAAa,GAC9CwE,IAAQgV,EAAO,EAAI,EACxB9E,GAAiB1U,EAAGA,EAAE,YAAawE,EAAK2O,CAAI,EAC5CnT,EAAE,aAAewE,EACjBwT,EAAchY,EAAE,IAAI,GAIfmT,EAAOmE,GAAoBF,EACpC,EAUMuC,GAAe,CAAC3Z,EAAGsZ,IAAU,CAEjC,IAAIM,EACAC,EAEJ,OAAS,CAMP,GAAI7Z,EAAE,UAAY0W,EAAe,CAE/B,GADAwC,GAAYlZ,CAAC,EACTA,EAAE,UAAY0W,GAAiB4C,IAAUxE,GAC3C,OAAOsC,EAET,GAAIpX,EAAE,YAAc,EAClB,KAEH,CAyBD,GApBA4Z,EAAY,EACR5Z,EAAE,WAAawW,IAEjBxW,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWwW,EAAY,CAAC,CAAC,EAC/DoD,EAAY5Z,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlB4Z,IAAc,GAAc5Z,EAAE,SAAW4Z,GAAe5Z,EAAE,OAAS0W,IAKrE1W,EAAE,aAAesY,GAActY,EAAG4Z,CAAS,GAGzC5Z,EAAE,cAAgBwW,EAYpB,GAPAqD,EAASjF,GAAU5U,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAewW,CAAS,EAE5ExW,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAawW,EAAW,CACvFxW,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWwW,EAAY,CAAC,CAAC,EAC/DoD,EAAY5Z,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,eAKb,EAAEA,EAAE,eAAiB,GAC9BA,EAAE,UACH,MAECA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,EACjBA,EAAE,MAAQA,EAAE,OAAOA,EAAE,QAAQ,EAE7BA,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,OAarD6Z,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,WAEJ,GAAI6Z,IAEF5B,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoX,CAIZ,CAED,OADApX,EAAE,OAAWA,EAAE,SAAYwW,EAAY,EAAMxW,EAAE,SAAWwW,EAAY,EAClE8C,IAAUrE,GAEZgD,EAAiBjY,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsX,GAGFC,IAELvX,EAAE,WAEJiY,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoX,EAIJC,EACT,EAOMyC,GAAe,CAAC9Z,EAAGsZ,IAAU,CAEjC,IAAIM,EACAC,EAEAE,EAGJ,OAAS,CAMP,GAAI/Z,EAAE,UAAY0W,EAAe,CAE/B,GADAwC,GAAYlZ,CAAC,EACTA,EAAE,UAAY0W,GAAiB4C,IAAUxE,GAC3C,OAAOsC,EAET,GAAIpX,EAAE,YAAc,EAAK,KAC1B,CAyCD,GApCA4Z,EAAY,EACR5Z,EAAE,WAAawW,IAEjBxW,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWwW,EAAY,CAAC,CAAC,EAC/DoD,EAAY5Z,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAMtBA,EAAE,YAAcA,EAAE,aAClBA,EAAE,WAAaA,EAAE,YACjBA,EAAE,aAAewW,EAAY,EAEzBoD,IAAc,GAAY5Z,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAW4Z,GAAc5Z,EAAE,OAAS0W,IAKxC1W,EAAE,aAAesY,GAActY,EAAG4Z,CAAS,EAGvC5Z,EAAE,cAAgB,IAClBA,EAAE,WAAayV,IAAezV,EAAE,eAAiBwW,GAAaxW,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAewW,EAAY,IAM7BxW,EAAE,aAAewW,GAAaxW,EAAE,cAAgBA,EAAE,YAAa,CACjE+Z,EAAa/Z,EAAE,SAAWA,EAAE,UAAYwW,EAOxCqD,EAASjF,GAAU5U,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAcwW,CAAS,EAM9ExW,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAY+Z,IAElB/Z,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOA,EAAE,SAAWwW,EAAY,CAAC,CAAC,EAC/DoD,EAAY5Z,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,gBAGf,EAAEA,EAAE,cAAgB,GAK7B,GAJAA,EAAE,gBAAkB,EACpBA,EAAE,aAAewW,EAAY,EAC7BxW,EAAE,WAEE6Z,IAEF5B,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoX,CAKjB,SAAepX,EAAE,iBAgBX,GATA6Z,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAE7C6Z,GAEF5B,EAAiBjY,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAOoX,OAMTpX,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,WAEL,CAUD,OARIA,EAAE,kBAGJ6Z,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEjDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWwW,EAAY,EAAIxW,EAAE,SAAWwW,EAAY,EAC7D8C,IAAUrE,GAEZgD,EAAiBjY,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsX,GAGFC,IAELvX,EAAE,WAEJiY,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoX,EAKJC,EACT,EAQM2C,GAAc,CAACha,EAAGsZ,IAAU,CAEhC,IAAIO,EACAlU,EACA8S,EAAMM,EAEV,MAAMF,EAAO7Y,EAAE,OAEf,OAAS,CAKP,GAAIA,EAAE,WAAayW,GAAW,CAE5B,GADAyC,GAAYlZ,CAAC,EACTA,EAAE,WAAayW,IAAa6C,IAAUxE,GACxC,OAAOsC,EAET,GAAIpX,EAAE,YAAc,EAAK,KAC1B,CAID,GADAA,EAAE,aAAe,EACbA,EAAE,WAAawW,GAAaxW,EAAE,SAAW,IAC3CyY,EAAOzY,EAAE,SAAW,EACpB2F,EAAOkT,EAAKJ,CAAI,EACZ9S,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAAG,CAC3EM,EAAS/Y,EAAE,SAAWyW,GACtB,EAAG,OAEM9Q,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAC7C9S,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAC7C9S,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAC7C9S,IAASkT,EAAK,EAAEJ,CAAI,GAAK9S,IAASkT,EAAK,EAAEJ,CAAI,GAC7CA,EAAOM,GAChB/Y,EAAE,aAAeyW,IAAasC,EAASN,GACnCzY,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,UAEtB,CAuBH,GAlBIA,EAAE,cAAgBwW,GAIpBqD,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,aAAewW,CAAS,EAEnDxW,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjB6Z,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAE7CA,EAAE,YACFA,EAAE,YAEA6Z,IAEF5B,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoX,CAIZ,CAED,OADApX,EAAE,OAAS,EACPsZ,IAAUrE,GAEZgD,EAAiBjY,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsX,GAGFC,IAELvX,EAAE,WAEJiY,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoX,EAIJC,EACT,EAMM4C,GAAe,CAACja,EAAGsZ,IAAU,CAEjC,IAAIO,EAEJ,OAAS,CAEP,GAAI7Z,EAAE,YAAc,IAClBkZ,GAAYlZ,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAIsZ,IAAUxE,GACZ,OAAOsC,EAET,KACD,CAUH,GANApX,EAAE,aAAe,EAGjB6Z,EAASjF,GAAU5U,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAC7CA,EAAE,YACFA,EAAE,WACE6Z,IAEF5B,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoX,CAIZ,CAED,OADApX,EAAE,OAAS,EACPsZ,IAAUrE,GAEZgD,EAAiBjY,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsX,GAGFC,IAELvX,EAAE,WAEJiY,EAAiBjY,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoX,EAIJC,EACT,EAOA,SAAS6C,EAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CAEnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,CACd,CAEA,MAAMC,GAAsB,CAE1B,IAAIN,EAAO,EAAG,EAAG,EAAG,EAAGb,EAAc,EACrC,IAAIa,EAAO,EAAG,EAAG,EAAG,EAAGP,EAAY,EACnC,IAAIO,EAAO,EAAG,EAAG,GAAI,EAAGP,EAAY,EACpC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIP,EAAY,EAErC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIJ,EAAY,EACrC,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,EAAY,EACtC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,EAC3C,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,CAC7C,EAMMW,GAAWza,GAAM,CAErBA,EAAE,YAAc,EAAIA,EAAE,OAGtB4X,GAAK5X,EAAE,IAAI,EAIXA,EAAE,eAAiBwa,GAAoBxa,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAawa,GAAoBxa,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAawa,GAAoBxa,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmBwa,GAAoBxa,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAcwW,EAAY,EAC7CxW,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,CACZ,EAGA,SAAS0a,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAAS3E,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,IAAI,YAAYQ,GAAY,CAAC,EAC/C,KAAK,UAAa,IAAI,aAAa,EAAIF,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAI,aAAa,EAAIC,GAAW,GAAK,CAAC,EACxDsB,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAI,YAAYhM,GAAW,CAAC,EAI5C,KAAK,KAAO,IAAI,YAAY,EAAIwK,GAAU,CAAC,EAC3CwB,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAI,YAAY,EAAIxB,GAAU,CAAC,EAC5CwB,GAAK,KAAK,KAAK,EAIf,KAAK,QAAU,EAEf,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAChB,KAAK,QAAU,EAEf,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAalB,CAMA,MAAM+C,GAAqBjD,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAM1X,EAAI0X,EAAK,MACf,MAAI,CAAC1X,GAAKA,EAAE,OAAS0X,GAAS1X,EAAE,SAAW4W,IAEb5W,EAAE,SAAW6W,IAEb7W,EAAE,SAAW8W,IACb9W,EAAE,SAAW+W,IACb/W,EAAE,SAAWgX,IACbhX,EAAE,SAAWiX,IACbjX,EAAE,SAAWkX,IACblX,EAAE,SAAWmX,GAClC,EAEF,CACT,EAGMyD,GAAoBlD,GAAS,CAEjC,GAAIiD,GAAkBjD,CAAI,EACxB,OAAOD,GAAIC,EAAMrC,CAAgB,EAGnCqC,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAY5B,GAEjB,MAAM9V,EAAI0X,EAAK,MACf,OAAA1X,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAEAA,EAAE,OAAS,EAAI6W,GAEf7W,EAAE,KAAO4W,GAAaM,GACxBQ,EAAK,MAAS1X,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAa,GACfyU,GAASzU,CAAC,EACHmV,CACT,EAGM0F,GAAgBnD,GAAS,CAE7B,MAAMoD,EAAMF,GAAiBlD,CAAI,EACjC,OAAIoD,IAAQ3F,GACVsF,GAAQ/C,EAAK,KAAK,EAEboD,CACT,EAGMC,GAAmB,CAACrD,EAAMsD,IAE1BL,GAAkBjD,CAAI,GAAKA,EAAK,MAAM,OAAS,EAC1CrC,GAETqC,EAAK,MAAM,OAASsD,EACb7F,GAIH8F,GAAe,CAACvD,EAAMwD,EAAOC,EAAQC,EAAYC,EAAUC,IAAa,CAE5E,GAAI,CAAC5D,EACH,OAAOrC,EAET,IAAIkG,EAAO,EAiBX,GAfIL,IAAU1F,KACZ0F,EAAQ,GAGNE,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAWrF,IAAiBmF,IAAWpF,IACzDqF,EAAa,GAAKA,EAAa,IAAMF,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EAAW1F,IAAYwF,IAAe,GAAKG,IAAS,EACpE,OAAO9D,GAAIC,EAAMrC,CAAgB,EAI/B+F,IAAe,IACjBA,EAAa,GAIf,MAAM,EAAI,IAAIV,GAEd,OAAAhD,EAAK,MAAQ,EACb,EAAE,KAAOA,EACT,EAAE,OAASd,GAEX,EAAE,KAAO2E,EACT,EAAE,OAAS,KACX,EAAE,OAASH,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAYC,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,GAAG,EAAE,UAAY7E,EAAY,GAAKA,GAElD,EAAE,OAAS,IAAI,WAAW,EAAE,OAAS,CAAC,EACtC,EAAE,KAAO,IAAI,YAAY,EAAE,SAAS,EACpC,EAAE,KAAO,IAAI,YAAY,EAAE,MAAM,EAKjC,EAAE,YAAc,GAAM6E,EAAW,EAyCjC,EAAE,iBAAmB,EAAE,YAAc,EACrC,EAAE,YAAc,IAAI,WAAW,EAAE,gBAAgB,EAIjD,EAAE,QAAU,EAAE,YAGd,EAAE,SAAW,EAAE,YAAc,GAAK,EAMlC,EAAE,MAAQH,EACV,EAAE,SAAWI,EACb,EAAE,OAASH,EAEJN,GAAanD,CAAI,CAC1B,EAEM8D,GAAc,CAAC9D,EAAMwD,IAElBD,GAAavD,EAAMwD,EAAOnF,GAAcE,GAAaC,GAAeL,EAAoB,EAK3F4F,GAAY,CAAC/D,EAAM4B,IAAU,CAEjC,GAAIqB,GAAkBjD,CAAI,GAAK4B,EAAQpE,IAAaoE,EAAQ,EAC1D,OAAO5B,EAAOD,GAAIC,EAAMrC,CAAgB,EAAIA,EAG9C,MAAMrV,EAAI0X,EAAK,MAEf,GAAI,CAACA,EAAK,QACLA,EAAK,WAAa,GAAK,CAACA,EAAK,OAC7B1X,EAAE,SAAWmX,IAAgBmC,IAAUrE,EAC1C,OAAOwC,GAAIC,EAAOA,EAAK,YAAc,EAAKnC,GAAgBF,CAAgB,EAG5E,MAAMqG,EAAY1b,EAAE,WAIpB,GAHAA,EAAE,WAAasZ,EAGXtZ,EAAE,UAAY,GAEhB,GADAgY,EAAcN,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAA1X,EAAE,WAAa,GACRmV,UAOAuC,EAAK,WAAa,GAAK9E,GAAK0G,CAAK,GAAK1G,GAAK8I,CAAS,GAC7DpC,IAAUrE,EACV,OAAOwC,GAAIC,EAAMnC,EAAa,EAIhC,GAAIvV,EAAE,SAAWmX,IAAgBO,EAAK,WAAa,EACjD,OAAOD,GAAIC,EAAMnC,EAAa,EAOhC,GAHIvV,EAAE,SAAW4W,IAAc5W,EAAE,OAAS,IACxCA,EAAE,OAASkX,IAETlX,EAAE,SAAW4W,GAAY,CAE3B,IAAI+E,EAAU5F,IAAiB/V,EAAE,OAAS,GAAM,IAAO,EACnD4b,EAAc,GA2BlB,GAzBI5b,EAAE,UAAY0V,IAAkB1V,EAAE,MAAQ,EAC5C4b,EAAc,EACL5b,EAAE,MAAQ,EACnB4b,EAAc,EACL5b,EAAE,QAAU,EACrB4b,EAAc,EAEdA,EAAc,EAEhBD,GAAWC,GAAe,EACtB5b,EAAE,WAAa,IAAK2b,GAAUhF,IAClCgF,GAAU,GAAMA,EAAS,GAEzBxD,GAAYnY,EAAG2b,CAAM,EAGjB3b,EAAE,WAAa,IACjBmY,GAAYnY,EAAG0X,EAAK,QAAU,EAAE,EAChCS,GAAYnY,EAAG0X,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,EACb1X,EAAE,OAASkX,GAGXc,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,CAEV,CAED,GAAInV,EAAE,SAAW6W,IAMf,GAJAa,EAAK,MAAQ,EACbQ,EAASlY,EAAG,EAAE,EACdkY,EAASlY,EAAG,GAAG,EACfkY,EAASlY,EAAG,CAAC,EACRA,EAAE,OAoBLkY,EAASlY,GAAIA,EAAE,OAAO,KAAO,EAAI,IACpBA,EAAE,OAAO,KAAO,EAAI,IACnBA,EAAE,OAAO,MAAY,EAAJ,IACjBA,EAAE,OAAO,KAAW,EAAJ,IAChBA,EAAE,OAAO,QAAc,GAAJ,EACvC,EACMkY,EAASlY,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChCkY,EAASlY,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvCkY,EAASlY,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCkY,EAASlY,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCkY,EAASlY,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAY0V,IAAkB1V,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBkY,EAASlY,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnCkY,EAASlY,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxCkY,EAASlY,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACX0X,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE9DA,EAAE,QAAU,EACZA,EAAE,OAAS8W,WAzCXoB,EAASlY,EAAG,CAAC,EACbkY,EAASlY,EAAG,CAAC,EACbkY,EAASlY,EAAG,CAAC,EACbkY,EAASlY,EAAG,CAAC,EACbkY,EAASlY,EAAG,CAAC,EACbkY,EAASlY,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAY0V,IAAkB1V,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBkY,EAASlY,EAAGwX,EAAO,EACnBxX,EAAE,OAASkX,GAGXc,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,EA6Bb,GAAInV,EAAE,SAAW8W,GAAa,CAC5B,GAAI9W,EAAE,OAAO,MAAqB,CAChC,IAAI6b,EAAM7b,EAAE,QACRwZ,GAAQxZ,EAAE,OAAO,MAAM,OAAS,OAAUA,EAAE,QAChD,KAAOA,EAAE,QAAUwZ,EAAOxZ,EAAE,kBAAkB,CAC5C,IAAI8b,EAAO9b,EAAE,iBAAmBA,EAAE,QAYlC,GATAA,EAAE,YAAY,IAAIA,EAAE,OAAO,MAAM,SAASA,EAAE,QAASA,EAAE,QAAU8b,CAAI,EAAG9b,EAAE,OAAO,EACjFA,EAAE,QAAUA,EAAE,iBAEVA,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,GAGtE7b,EAAE,SAAW8b,EACb9D,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,EAET0G,EAAM,EACNrC,GAAQsC,CACT,CAGD,IAAIC,EAAe,IAAI,WAAW/b,EAAE,OAAO,KAAK,EAGhDA,EAAE,YAAY,IAAI+b,EAAa,SAAS/b,EAAE,QAASA,EAAE,QAAUwZ,CAAI,EAAGxZ,EAAE,OAAO,EAC/EA,EAAE,SAAWwZ,EAETxZ,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,GAGtE7b,EAAE,QAAU,CACb,CACDA,EAAE,OAAS+W,EACZ,CACD,GAAI/W,EAAE,SAAW+W,GAAY,CAC3B,GAAI/W,EAAE,OAAO,KAAoB,CAC/B,IAAI6b,EAAM7b,EAAE,QACRmM,EACJ,EAAG,CACD,GAAInM,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,GAGtE7D,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,EAET0G,EAAM,CACP,CAEG7b,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BmM,EAAMnM,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CmM,EAAM,EAER+L,EAASlY,EAAGmM,CAAG,CACvB,OAAeA,IAAQ,GAEbnM,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,GAGtE7b,EAAE,QAAU,CACb,CACDA,EAAE,OAASgX,EACZ,CACD,GAAIhX,EAAE,SAAWgX,GAAe,CAC9B,GAAIhX,EAAE,OAAO,QAAuB,CAClC,IAAI6b,EAAM7b,EAAE,QACRmM,EACJ,EAAG,CACD,GAAInM,EAAE,UAAYA,EAAE,iBAAkB,CAOpC,GALIA,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,GAGtE7D,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,EAET0G,EAAM,CACP,CAEG7b,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BmM,EAAMnM,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDmM,EAAM,EAER+L,EAASlY,EAAGmM,CAAG,CACvB,OAAeA,IAAQ,GAEbnM,EAAE,OAAO,MAAQA,EAAE,QAAU6b,IAC/BnE,EAAK,MAAQpD,EAAQoD,EAAK,MAAO1X,EAAE,YAAaA,EAAE,QAAU6b,EAAKA,CAAG,EAGvE,CACD7b,EAAE,OAASiX,EACZ,CACD,GAAIjX,EAAE,SAAWiX,GAAY,CAC3B,GAAIjX,EAAE,OAAO,KAAM,CACjB,GAAIA,EAAE,QAAU,EAAIA,EAAE,mBACpBgY,EAAcN,CAAI,EACd1X,EAAE,UAAY,GAChB,OAAAA,EAAE,WAAa,GACRmV,EAGX+C,EAASlY,EAAG0X,EAAK,MAAQ,GAAI,EAC7BQ,EAASlY,EAAI0X,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,CACd,CAKD,GAJA1X,EAAE,OAASkX,GAGXc,EAAcN,CAAI,EACd1X,EAAE,UAAY,EAChB,OAAAA,EAAE,WAAa,GACRmV,CAEV,CAKD,GAAIuC,EAAK,WAAa,GAAK1X,EAAE,YAAc,GACxCsZ,IAAUxE,IAAgB9U,EAAE,SAAWmX,GAAe,CACvD,IAAI6E,EAAShc,EAAE,QAAU,EAAIqZ,GAAerZ,EAAGsZ,CAAK,EACvCtZ,EAAE,WAAa0V,GAAiBuE,GAAaja,EAAGsZ,CAAK,EACrDtZ,EAAE,WAAa2V,GAAQqE,GAAYha,EAAGsZ,CAAK,EAC3CkB,GAAoBxa,EAAE,KAAK,EAAE,KAAKA,EAAGsZ,CAAK,EAKvD,IAHI0C,IAAW1E,IAAqB0E,IAAWzE,MAC7CvX,EAAE,OAASmX,IAET6E,IAAW5E,GAAgB4E,IAAW1E,GACxC,OAAII,EAAK,YAAc,IACrB1X,EAAE,WAAa,IAGVmV,EAST,GAAI6G,IAAW3E,KACTiC,IAAUvE,GACZF,GAAU7U,CAAC,EAEJsZ,IAAUpE,KAEjBR,GAAiB1U,EAAG,EAAG,EAAG,EAAK,EAI3BsZ,IAAUtE,KAEZ4C,GAAK5X,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjBgY,EAAcN,CAAI,EACdA,EAAK,YAAc,GACrB,OAAA1X,EAAE,WAAa,GACRmV,CAGZ,CAED,OAAImE,IAAUrE,EAAqBE,EAC/BnV,EAAE,MAAQ,EAAYoV,IAGtBpV,EAAE,OAAS,GACbkY,EAASlY,EAAG0X,EAAK,MAAQ,GAAI,EAC7BQ,EAASlY,EAAI0X,EAAK,OAAS,EAAK,GAAI,EACpCQ,EAASlY,EAAI0X,EAAK,OAAS,GAAM,GAAI,EACrCQ,EAASlY,EAAI0X,EAAK,OAAS,GAAM,GAAI,EACrCQ,EAASlY,EAAG0X,EAAK,SAAW,GAAI,EAChCQ,EAASlY,EAAI0X,EAAK,UAAY,EAAK,GAAI,EACvCQ,EAASlY,EAAI0X,EAAK,UAAY,GAAM,GAAI,EACxCQ,EAASlY,EAAI0X,EAAK,UAAY,GAAM,GAAI,IAIxCS,GAAYnY,EAAG0X,EAAK,QAAU,EAAE,EAChCS,GAAYnY,EAAG0X,EAAK,MAAQ,KAAM,GAGpCM,EAAcN,CAAI,EAId1X,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAImV,EAASC,GACpC,EAGM6G,GAAcvE,GAAS,CAE3B,GAAIiD,GAAkBjD,CAAI,EACxB,OAAOrC,EAGT,MAAM6G,EAASxE,EAAK,MAAM,OAE1B,OAAAA,EAAK,MAAQ,KAENwE,IAAWhF,GAAaO,GAAIC,EAAMpC,EAAc,EAAIH,CAC7D,EAOMgH,GAAuB,CAACzE,EAAM0E,IAAe,CAEjD,IAAIC,EAAaD,EAAW,OAE5B,GAAIzB,GAAkBjD,CAAI,EACxB,OAAOrC,EAGT,MAAMrV,EAAI0X,EAAK,MACT6D,EAAOvb,EAAE,KAEf,GAAIub,IAAS,GAAMA,IAAS,GAAKvb,EAAE,SAAW4W,IAAe5W,EAAE,UAC7D,OAAOqV,EAYT,GARIkG,IAAS,IAEX7D,EAAK,MAAQ3D,GAAU2D,EAAK,MAAO0E,EAAYC,EAAY,CAAC,GAG9Drc,EAAE,KAAO,EAGLqc,GAAcrc,EAAE,OAAQ,CACtBub,IAAS,IAEX3D,GAAK5X,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb,IAAIsc,EAAU,IAAI,WAAWtc,EAAE,MAAM,EACrCsc,EAAQ,IAAIF,EAAW,SAASC,EAAarc,EAAE,OAAQqc,CAAU,EAAG,CAAC,EACrED,EAAaE,EACbD,EAAarc,EAAE,MAChB,CAED,MAAMuc,EAAQ7E,EAAK,SACb8E,EAAO9E,EAAK,QACZ+E,EAAQ/E,EAAK,MAKnB,IAJAA,EAAK,SAAW2E,EAChB3E,EAAK,QAAU,EACfA,EAAK,MAAQ0E,EACblD,GAAYlZ,CAAC,EACNA,EAAE,WAAawW,GAAW,CAC/B,IAAI7Z,EAAMqD,EAAE,SACRuE,EAAIvE,EAAE,WAAawW,EAAY,GACnC,GAEExW,EAAE,MAAQ+X,GAAK/X,EAAGA,EAAE,MAAOA,EAAE,OAAOrD,EAAM6Z,EAAY,CAAC,CAAC,EAExDxW,EAAE,KAAKrD,EAAMqD,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAIrD,EAClBA,UACO,EAAE4H,GACXvE,EAAE,SAAWrD,EACbqD,EAAE,UAAYwW,EAAY,EAC1B0C,GAAYlZ,CAAC,CACd,CACD,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAcwW,EAAY,EAC7CxW,EAAE,gBAAkB,EACpB0X,EAAK,QAAU8E,EACf9E,EAAK,MAAQ+E,EACb/E,EAAK,SAAW6E,EAChBvc,EAAE,KAAOub,EACFpG,CACT,EAGA,IAAIuH,GAAgBlB,GAChBmB,GAAiB1B,GACjB2B,GAAiB/B,GACjBgC,GAAqBjC,GACrBkC,GAAqB/B,GACrBgC,GAActB,GACduB,GAAef,GACfgB,GAAyBd,GACzBe,GAAc,qCAYdC,GAAc,CACjB,YAAaT,GACb,aAAcC,GACd,aAAcC,GACd,iBAAkBC,GAClB,iBAAkBC,GAClB,QAASC,GACT,WAAYC,GACZ,qBAAsBC,GACtB,YAAaC,EACd,EAEA,MAAME,GAAO,CAAC5f,EAAK6f,IACV,OAAO,UAAU,eAAe,KAAK7f,EAAK6f,CAAG,EAGtD,IAAIC,GAAS,SAAU9f,EAAkC,CACvD,MAAM+f,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACvD,KAAOA,EAAQ,QAAQ,CACrB,MAAMC,EAASD,EAAQ,QACvB,GAAKC,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,UAAWlgB,KAAKkgB,EACVJ,GAAKI,EAAQlgB,CAAC,IAChBE,EAAIF,CAAC,EAAIkgB,EAAOlgB,CAAC,GAGtB,CAED,OAAOE,CACT,EAIIigB,GAAiBC,GAAW,CAE9B,IAAIlZ,EAAM,EAEV,QAAS,EAAI,EAAG3E,EAAI6d,EAAO,OAAQ,EAAI7d,EAAG,IACxC2E,GAAOkZ,EAAO,CAAC,EAAE,OAInB,MAAMhlB,EAAS,IAAI,WAAW8L,CAAG,EAEjC,QAAS,EAAI,EAAGc,EAAM,EAAGzF,EAAI6d,EAAO,OAAQ,EAAI7d,EAAG,IAAK,CACtD,IAAI8d,EAAQD,EAAO,CAAC,EACpBhlB,EAAO,IAAIilB,EAAOrY,CAAG,EACrBA,GAAOqY,EAAM,MACd,CAED,OAAOjlB,CACT,EAEIklB,GAAS,CACZ,OAAQN,GACR,cAAeG,EAChB,EAUA,IAAII,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,IAAI,WAAW,CAAC,CAAC,CAAI,MAAY,CAAEA,GAAmB,EAAQ,CAMpG,MAAMC,GAAW,IAAI,WAAW,GAAG,EACnC,QAASC,EAAI,EAAGA,EAAI,IAAKA,IACvBD,GAASC,CAAC,EAAKA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EAE5FD,GAAS,GAAG,EAAIA,GAAS,GAAG,EAAI,EAIhC,IAAIE,GAAcrhB,GAAQ,CACxB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAW,EAAG,OAAOA,CAAG,EAGrC,IAAI6F,EAAK7K,EAAGsmB,EAAIC,EAAOte,EAAGue,EAAUxhB,EAAI,OAAQyhB,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/BvmB,EAAIgF,EAAI,WAAWuhB,CAAK,GACnBvmB,EAAI,SAAY,OAAWumB,EAAQ,EAAIC,IAC1CF,EAAKthB,EAAI,WAAWuhB,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBtmB,EAAI,OAAYA,EAAI,OAAW,KAAOsmB,EAAK,OAC3CC,MAGJE,GAAWzmB,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHA6K,EAAM,IAAI,WAAW4b,CAAO,EAGvBxe,EAAI,EAAGse,EAAQ,EAAGte,EAAIwe,EAASF,IAClCvmB,EAAIgF,EAAI,WAAWuhB,CAAK,GACnBvmB,EAAI,SAAY,OAAWumB,EAAQ,EAAIC,IAC1CF,EAAKthB,EAAI,WAAWuhB,EAAQ,CAAC,GACxBD,EAAK,SAAY,QACpBtmB,EAAI,OAAYA,EAAI,OAAW,KAAOsmB,EAAK,OAC3CC,MAGAvmB,EAAI,IAEN6K,EAAI5C,GAAG,EAAIjI,EACFA,EAAI,MAEb6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,EACzB6K,EAAI5C,GAAG,EAAI,IAAQjI,EAAI,IACdA,EAAI,OAEb6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,GACzB6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,EAAI,GAC7B6K,EAAI5C,GAAG,EAAI,IAAQjI,EAAI,KAGvB6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,GACzB6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,GAAK,GAC9B6K,EAAI5C,GAAG,EAAI,IAAQjI,IAAM,EAAI,GAC7B6K,EAAI5C,GAAG,EAAI,IAAQjI,EAAI,IAI3B,OAAO6K,CACT,EAGA,MAAM6b,GAAgB,CAAC7b,EAAKgC,IAAQ,CAIlC,GAAIA,EAAM,OACJhC,EAAI,UAAYqb,GAClB,OAAO,OAAO,aAAa,MAAM,KAAMrb,EAAI,SAAWgC,EAAMhC,EAAMA,EAAI,SAAS,EAAGgC,CAAG,CAAC,EAI1F,IAAI9L,EAAS,GACb,QAAS,EAAI,EAAG,EAAI8L,EAAK,IACvB9L,GAAU,OAAO,aAAa8J,EAAI,CAAC,CAAC,EAEtC,OAAO9J,CACT,EAIA,IAAI4lB,GAAa,CAAC9b,EAAK+b,IAAQ,CAC7B,MAAM/Z,EAAM+Z,GAAO/b,EAAI,OAEvB,GAAI,OAAO,aAAgB,YAAc,YAAY,UAAU,OAC7D,OAAO,IAAI,YAAa,EAAC,OAAOA,EAAI,SAAS,EAAG+b,CAAG,CAAC,EAGtD,IAAI,EAAG1b,EAKP,MAAM2b,EAAW,IAAI,MAAMha,EAAM,CAAC,EAElC,IAAK3B,EAAM,EAAG,EAAI,EAAG,EAAI2B,GAAM,CAC7B,IAAI7M,EAAI6K,EAAI,GAAG,EAEf,GAAI7K,EAAI,IAAM,CAAE6mB,EAAS3b,GAAK,EAAIlL,EAAG,QAAW,CAEhD,IAAI8mB,EAAQX,GAASnmB,CAAC,EAEtB,GAAI8mB,EAAQ,EAAG,CAAED,EAAS3b,GAAK,EAAI,MAAQ,GAAK4b,EAAQ,EAAG,QAAW,CAKtE,IAFA9mB,GAAK8mB,IAAU,EAAI,GAAOA,IAAU,EAAI,GAAO,EAExCA,EAAQ,GAAK,EAAIja,GACtB7M,EAAKA,GAAK,EAAM6K,EAAI,GAAG,EAAI,GAC3Bic,IAIF,GAAIA,EAAQ,EAAG,CAAED,EAAS3b,GAAK,EAAI,MAAQ,QAAW,CAElDlL,EAAI,MACN6mB,EAAS3b,GAAK,EAAIlL,GAElBA,GAAK,MACL6mB,EAAS3b,GAAK,EAAI,MAAWlL,GAAK,GAAM,KACxC6mB,EAAS3b,GAAK,EAAI,MAAUlL,EAAI,KAEnC,CAED,OAAO0mB,GAAcG,EAAU3b,CAAG,CACpC,EASI6b,GAAa,CAAClc,EAAK+b,IAAQ,CAE7BA,EAAMA,GAAO/b,EAAI,OACb+b,EAAM/b,EAAI,SAAU+b,EAAM/b,EAAI,QAGlC,IAAI8C,EAAMiZ,EAAM,EAChB,KAAOjZ,GAAO,IAAM9C,EAAI8C,CAAG,EAAI,OAAU,KAAQA,IAQjD,OAJIA,EAAM,GAINA,IAAQ,EAAYiZ,EAEhBjZ,EAAMwY,GAAStb,EAAI8C,CAAG,CAAC,EAAIiZ,EAAOjZ,EAAMiZ,CAClD,EAEII,GAAU,CACb,WAAYX,GACZ,WAAYM,GACZ,WAAYI,EACb,EAqBA,SAASE,IAAU,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,CACf,CAEA,IAAIC,GAAUD,GAEd,MAAME,GAAa,OAAO,UAAU,SAK9B,CACJ,WAAYC,GAAc,aAAAC,GAAc,aAAAC,GAAc,SAAUC,GAChE,KAAMC,GAAQ,aAAcC,GAC5B,sBAAAC,GACA,mBAAAC,GACA,WAAYC,EACd,EAAI/K,GA0FJ,SAASgL,GAAUzrB,EAAS,CAC1B,KAAK,QAAU6pB,GAAO,OAAO,CAC3B,MAAOyB,GACP,OAAQE,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAUD,EACd,EAAKvrB,GAAW,CAAA,CAAE,EAEhB,IAAImR,EAAM,KAAK,QAEXA,EAAI,KAAQA,EAAI,WAAa,EAC/BA,EAAI,WAAa,CAACA,EAAI,WAGfA,EAAI,MAASA,EAAI,WAAa,GAAOA,EAAI,WAAa,KAC7DA,EAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,IAAI2Z,GAChB,KAAK,KAAK,UAAY,EAEtB,IAAI3C,EAASiB,GAAY,aACvB,KAAK,KACLjY,EAAI,MACJA,EAAI,OACJA,EAAI,WACJA,EAAI,SACJA,EAAI,QACR,EAEE,GAAIgX,IAAWiD,GACb,MAAM,IAAI,MAAM5K,GAAS2H,CAAM,CAAC,EAOlC,GAJIhX,EAAI,QACNiY,GAAY,iBAAiB,KAAK,KAAMjY,EAAI,MAAM,EAGhDA,EAAI,WAAY,CAClB,IAAIua,EAaJ,GAXI,OAAOva,EAAI,YAAe,SAE5Bua,EAAOd,GAAQ,WAAWzZ,EAAI,UAAU,EAC/B4Z,GAAW,KAAK5Z,EAAI,UAAU,IAAM,uBAC7Cua,EAAO,IAAI,WAAWva,EAAI,UAAU,EAEpCua,EAAOva,EAAI,WAGbgX,EAASiB,GAAY,qBAAqB,KAAK,KAAMsC,CAAI,EAErDvD,IAAWiD,GACb,MAAM,IAAI,MAAM5K,GAAS2H,CAAM,CAAC,EAGlC,KAAK,UAAY,EAClB,CACH,CAwBAsD,GAAU,UAAU,KAAO,SAAU5mB,EAAM8mB,EAAY,CACrD,MAAMhI,EAAO,KAAK,KACZiI,EAAY,KAAK,QAAQ,UAC/B,IAAIzD,EAAQ0D,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBIF,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAOR,GAAaH,GAGlD,OAAOnmB,GAAS,SAElB8e,EAAK,MAAQiH,GAAQ,WAAW/lB,CAAI,EAC3BkmB,GAAW,KAAKlmB,CAAI,IAAM,uBACnC8e,EAAK,MAAQ,IAAI,WAAW9e,CAAI,EAEhC8e,EAAK,MAAQ9e,EAGf8e,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAQP,GAPIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWiI,CAAS,EACtCjI,EAAK,SAAW,EAChBA,EAAK,UAAYiI,IAIdC,IAAgBZ,IAAgBY,IAAgBX,KAAiBvH,EAAK,WAAa,EAAG,CACzF,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACD,CAKD,GAHAwE,EAASiB,GAAY,QAAQzF,EAAMkI,CAAW,EAG1C1D,IAAWkD,GACb,OAAI1H,EAAK,SAAW,GAClB,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAEpDwE,EAASiB,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAMjB,CAAM,EACjB,KAAK,MAAQ,GACNA,IAAWiD,GAIpB,GAAIzH,EAAK,YAAc,EAAG,CACxB,KAAK,OAAOA,EAAK,MAAM,EACvB,QACD,CAGD,GAAIkI,EAAc,GAAKlI,EAAK,SAAW,EAAG,CACxC,KAAK,OAAOA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAClDA,EAAK,UAAY,EACjB,QACD,CAED,GAAIA,EAAK,WAAa,EAAG,KAC1B,CAED,MAAO,EACT,EAUA8H,GAAU,UAAU,OAAS,SAAU7B,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYA6B,GAAU,UAAU,MAAQ,SAAUtD,EAAQ,CAExCA,IAAWiD,KACb,KAAK,OAASvB,GAAO,cAAc,KAAK,MAAM,GAEhD,KAAK,OAAS,GACd,KAAK,IAAM1B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EAmCA,SAAS2D,GAAUpD,EAAO1oB,EAAS,CACjC,MAAM+rB,EAAW,IAAIN,GAAUzrB,CAAO,EAKtC,GAHA+rB,EAAS,KAAKrD,EAAO,EAAI,EAGrBqD,EAAS,IAAO,MAAMA,EAAS,KAAOvL,GAASuL,EAAS,GAAG,EAE/D,OAAOA,EAAS,MAClB,CAWA,SAASC,GAAatD,EAAO1oB,EAAS,CACpC,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,IAAM,GACP8rB,GAAUpD,EAAO1oB,CAAO,CACjC,CAWA,SAASisB,GAAOvD,EAAO1oB,EAAS,CAC9B,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,KAAO,GACR8rB,GAAUpD,EAAO1oB,CAAO,CACjC,CAGA,IAAIksB,GAAcT,GACdU,GAAYL,GACZM,GAAiBJ,GACjBK,GAAWJ,GACXK,GAAc7L,GAEd8L,GAAc,CACjB,QAASL,GACT,QAASC,GACT,WAAYC,GACZ,KAAMC,GACN,UAAWC,EACZ,EAsBA,MAAME,GAAQ,MACRC,GAAS,MAqCf,IAAIC,GAAU,SAAsB/I,EAAMW,EAAO,CAC/C,IAAIqI,EACAvN,EACAwN,EACA9E,EACAnX,EAEAkc,EAEA9I,EACA+I,EACAC,EAEAC,EACAC,EACAlV,EACAmV,EACA9V,EACA+V,EACAC,EACAC,EACAC,EAEA7c,EACAsL,EACAwR,EACAC,EAGA9E,EAAO+E,EAGX,MAAMC,EAAQ/J,EAAK,MAEnBgJ,EAAMhJ,EAAK,QACX+E,EAAQ/E,EAAK,MACbvE,EAAOuN,GAAOhJ,EAAK,SAAW,GAC9BiJ,EAAOjJ,EAAK,SACZ8J,EAAS9J,EAAK,OACdmE,EAAM8E,GAAQtI,EAAQX,EAAK,WAC3BhT,EAAMic,GAAQjJ,EAAK,UAAY,KAE/BkJ,EAAOa,EAAM,KAEb3J,EAAQ2J,EAAM,MACdZ,EAAQY,EAAM,MACdX,EAAQW,EAAM,MACdV,EAAWU,EAAM,OACjBT,EAAOS,EAAM,KACb3V,EAAO2V,EAAM,KACbR,EAAQQ,EAAM,QACdtW,EAAQsW,EAAM,SACdP,GAAS,GAAKO,EAAM,SAAW,EAC/BN,GAAS,GAAKM,EAAM,UAAY,EAMhCC,EACA,EAAG,CACG5V,EAAO,KACTkV,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,EACRkV,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,GAGVsV,EAAOH,EAAMD,EAAOE,CAAK,EAEzBS,EACA,OAAS,CAKP,GAJAN,EAAKD,IAAS,GACdJ,KAAUK,EACVvV,GAAQuV,EACRA,EAAMD,IAAS,GAAM,IACjBC,IAAO,EAITG,EAAOb,GAAM,EAAIS,EAAO,cAEjBC,EAAK,GAAI,CAChB7c,EAAM4c,EAAO,MACbC,GAAM,GACFA,IACEvV,EAAOuV,IACTL,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,GAEVtH,GAAOwc,GAAS,GAAKK,GAAM,EAC3BL,KAAUK,EACVvV,GAAQuV,GAGNvV,EAAO,KACTkV,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,EACRkV,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,GAEVsV,EAAOjW,EAAM6V,EAAOG,CAAK,EAEzBS,EACA,OAAS,CAMP,GALAP,EAAKD,IAAS,GACdJ,KAAUK,EACVvV,GAAQuV,EACRA,EAAMD,IAAS,GAAM,IAEjBC,EAAK,GAAI,CAaX,GAZAvR,EAAOsR,EAAO,MACdC,GAAM,GACFvV,EAAOuV,IACTL,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,EACJA,EAAOuV,IACTL,GAAQvE,EAAMiE,GAAK,GAAK5U,EACxBA,GAAQ,IAGZgE,GAAQkR,GAAS,GAAKK,GAAM,EAExBvR,EAAO8Q,EAAM,CACflJ,EAAK,IAAM,gCACX+J,EAAM,KAAOlB,GACb,MAAMmB,CACP,CAMD,GAJAV,KAAUK,EACVvV,GAAQuV,EAERA,EAAKV,EAAO9E,EACR/L,EAAOuR,EAAI,CAEb,GADAA,EAAKvR,EAAOuR,EACRA,EAAKR,GACHY,EAAM,KAAM,CACd/J,EAAK,IAAM,gCACX+J,EAAM,KAAOlB,GACb,MAAMmB,CACP,CA0BH,GAFAJ,EAAO,EACPC,EAAcR,EACVD,IAAU,GAEZ,GADAQ,GAAQxJ,EAAQuJ,EACZA,EAAK7c,EAAK,CACZA,GAAO6c,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO7Q,EACdyR,EAAcC,CACf,UAEMV,EAAQO,GAGf,GAFAC,GAAQxJ,EAAQgJ,EAAQO,EACxBA,GAAMP,EACFO,EAAK7c,EAAK,CACZA,GAAO6c,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GAEX,GADAC,EAAO,EACHR,EAAQtc,EAAK,CACf6c,EAAKP,EACLtc,GAAO6c,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO7Q,EACdyR,EAAcC,CACf,CACF,UAGDF,GAAQR,EAAQO,EACZA,EAAK7c,EAAK,CACZA,GAAO6c,EACP,GACEG,EAAOb,GAAM,EAAII,EAASO,GAAM,QACzB,EAAED,GACXC,EAAOX,EAAO7Q,EACdyR,EAAcC,CACf,CAEH,KAAOhd,EAAM,GACXgd,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnCE,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnCE,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EACnC9c,GAAO,EAELA,IACFgd,EAAOb,GAAM,EAAIY,EAAYD,GAAM,EAC/B9c,EAAM,IACRgd,EAAOb,GAAM,EAAIY,EAAYD,GAAM,GAGxC,KACI,CACHA,EAAOX,EAAO7Q,EACd,GACE0R,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9BE,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9BE,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC9B9c,GAAO,QACAA,EAAM,GACXA,IACFgd,EAAOb,GAAM,EAAIa,EAAOF,GAAM,EAC1B9c,EAAM,IACRgd,EAAOb,GAAM,EAAIa,EAAOF,GAAM,GAGnC,CACF,SACSD,EAAK,GAIV,CACH3J,EAAK,IAAM,wBACX+J,EAAM,KAAOlB,GACb,MAAMmB,CACP,KARyB,CACxBN,EAAOjW,GAAOiW,EAAO,QAAuBJ,GAAS,GAAKK,GAAM,EAAG,EACnE,SAASO,CACV,CAOD,KACD,CACF,SACSP,EAAK,GAIV,GAAIA,EAAK,GAAI,CAEhBI,EAAM,KAAOjB,GACb,MAAMkB,CACP,KACI,CACHhK,EAAK,IAAM,8BACX+J,EAAM,KAAOlB,GACb,MAAMmB,CACP,KAbyB,CACxBN,EAAOH,GAAOG,EAAO,QAAuBJ,GAAS,GAAKK,GAAM,EAAG,EACnE,SAASM,CACV,CAYD,KACD,CACF,OAAQjB,EAAMvN,GAAQwN,EAAOjc,GAG9BF,EAAMsH,GAAQ,EACd4U,GAAOlc,EACPsH,GAAQtH,GAAO,EACfwc,IAAS,GAAKlV,GAAQ,EAGtB4L,EAAK,QAAUgJ,EACfhJ,EAAK,SAAWiJ,EAChBjJ,EAAK,SAAYgJ,EAAMvN,EAAO,GAAKA,EAAOuN,GAAO,GAAKA,EAAMvN,GAC5DuE,EAAK,UAAaiJ,EAAOjc,EAAM,KAAOA,EAAMic,GAAQ,KAAOA,EAAOjc,GAClE+c,EAAM,KAAOT,EACbS,EAAM,KAAO3V,CAEf,EAqBA,MAAM+V,GAAU,GACVC,GAAgB,IAChBC,GAAiB,IAGjBC,GAAU,EACVC,GAAS,EACTC,GAAU,EAEVC,GAAQ,IAAI,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,CAC/D,CAAC,EAEKC,GAAO,IAAI,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAC1D,CAAC,EAEKC,GAAQ,IAAI,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,CAChC,CAAC,EAEKC,GAAO,IAAI,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,EACtB,CAAC,EAiSD,IAAIC,GA/RkB,CAAC5hB,EAAM6hB,EAAMC,EAAYC,EAAOtO,EAAOuO,EAAaC,EAAMnf,IAChF,CACE,MAAMqI,EAAOrI,EAAK,KAGlB,IAAIe,EAAM,EACNqe,EAAM,EACNC,EAAM,EAAGvE,EAAM,EACfwE,EAAO,EACPC,EAAO,EACPC,EAAO,EACPzJ,EAAO,EACPE,EAAO,EACPwJ,EAAO,EACPC,EACAC,EACAC,EACAC,EACA9G,EACA7L,EAAO,KAEP1V,EACJ,MAAMiX,EAAQ,IAAI,YAAY2P,GAAU,CAAC,EACnC0B,EAAO,IAAI,YAAY1B,GAAU,CAAC,EACxC,IAAInR,EAAQ,KAER8S,EAAWC,EAASC,EAkCxB,IAAKlf,EAAM,EAAGA,GAAOqd,GAASrd,IAC5B0N,EAAM1N,CAAG,EAAI,EAEf,IAAKqe,EAAM,EAAGA,EAAMH,EAAOG,IACzB3Q,EAAMsQ,EAAKC,EAAaI,CAAG,CAAC,IAK9B,IADAE,EAAOjX,EACFyS,EAAMsD,GAAStD,GAAO,GACrBrM,EAAMqM,CAAG,IAAM,EADSA,IAC5B,CAKF,GAHIwE,EAAOxE,IACTwE,EAAOxE,GAELA,IAAQ,EAIV,OAAAnK,EAAMuO,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAMhDvO,EAAMuO,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAEhDlf,EAAK,KAAO,EACL,EAET,IAAKqf,EAAM,EAAGA,EAAMvE,GACdrM,EAAM4Q,CAAG,IAAM,EADIA,IACvB,CAQF,IANIC,EAAOD,IACTC,EAAOD,GAITtJ,EAAO,EACFhV,EAAM,EAAGA,GAAOqd,GAASrd,IAG5B,GAFAgV,IAAS,EACTA,GAAQtH,EAAM1N,CAAG,EACbgV,EAAO,EACT,MAAO,GAGX,GAAIA,EAAO,IAAM7Y,IAASqhB,IAAWzD,IAAQ,GAC3C,MAAO,GAKT,IADAgF,EAAK,CAAC,EAAI,EACL/e,EAAM,EAAGA,EAAMqd,GAASrd,IAC3B+e,EAAK/e,EAAM,CAAC,EAAI+e,EAAK/e,CAAG,EAAI0N,EAAM1N,CAAG,EAIvC,IAAKqe,EAAM,EAAGA,EAAMH,EAAOG,IACrBL,EAAKC,EAAaI,CAAG,IAAM,IAC7BD,EAAKW,EAAKf,EAAKC,EAAaI,CAAG,CAAC,GAAG,EAAIA,GAiE3C,GA3BIliB,IAASqhB,IACXrR,EAAOD,EAAQkS,EACf3nB,EAAQ,IAEC0F,IAASshB,IAClBtR,EAAOwR,GACPzR,EAAQ0R,GACRnnB,EAAQ,MAGR0V,EAAO0R,GACP3R,EAAQ4R,GACRrnB,EAAQ,GAIVioB,EAAO,EACPL,EAAM,EACNre,EAAMse,EACNtG,EAAOmG,EACPK,EAAOD,EACPE,EAAO,EACPI,EAAM,GACN3J,EAAO,GAAKqJ,EACZO,EAAO5J,EAAO,EAGT/Y,IAASshB,IAAUvI,EAAOoI,IAC5BnhB,IAASuhB,IAAWxI,EAAOqI,GAC5B,MAAO,GAIT,OAAS,CAEPyB,EAAYhf,EAAMye,EACdL,EAAKC,CAAG,EAAI,EAAI5nB,GAClBwoB,EAAU,EACVC,EAAWd,EAAKC,CAAG,GAEZD,EAAKC,CAAG,GAAK5nB,GACpBwoB,EAAU/S,EAAMkS,EAAKC,CAAG,EAAI5nB,CAAK,EACjCyoB,EAAW/S,EAAKiS,EAAKC,CAAG,EAAI5nB,CAAK,IAGjCwoB,EAAU,GAAK,GACfC,EAAW,GAIbP,EAAO,GAAM3e,EAAMye,EACnBG,EAAO,GAAKJ,EACZF,EAAMM,EACN,GACEA,GAAQD,EACR/O,EAAMoI,GAAQ0G,GAAQD,GAAQG,CAAI,EAAKI,GAAa,GAAOC,GAAW,GAAMC,EAAU,QAC/EN,IAAS,GAIlB,IADAD,EAAO,GAAM3e,EAAM,EACZ0e,EAAOC,GACZA,IAAS,EAWX,GATIA,IAAS,GACXD,GAAQC,EAAO,EACfD,GAAQC,GAERD,EAAO,EAITL,IACI,EAAE3Q,EAAM1N,CAAG,IAAM,EAAG,CACtB,GAAIA,IAAQ+Z,EAAO,MACnB/Z,EAAMge,EAAKC,EAAaG,EAAKC,CAAG,CAAC,CAClC,CAGD,GAAIre,EAAMue,IAASG,EAAOI,KAAUD,EAAK,CAYvC,IAVIJ,IAAS,IACXA,EAAOF,GAITvG,GAAQsG,EAGRE,EAAOxe,EAAMye,EACbzJ,EAAO,GAAKwJ,EACLA,EAAOC,EAAO1E,IACnB/E,GAAQtH,EAAM8Q,EAAOC,CAAI,EACrB,EAAAzJ,GAAQ,KACZwJ,IACAxJ,IAAS,EAKX,GADAE,GAAQ,GAAKsJ,EACRriB,IAASshB,IAAUvI,EAAOoI,IAC5BnhB,IAASuhB,IAAWxI,EAAOqI,GAC5B,MAAO,GAITsB,EAAMH,EAAOI,EAIblP,EAAMiP,CAAG,EAAKN,GAAQ,GAAOC,GAAQ,GAAOxG,EAAOmG,EAAc,CAClE,CACF,CAKD,OAAIO,IAAS,IAIX9O,EAAMoI,EAAO0G,CAAI,EAAM1e,EAAMye,GAAS,GAAO,IAAM,GAAK,GAK1Dxf,EAAK,KAAOsf,EACL,CACT,EA6BA,MAAMY,GAAQ,EACRC,GAAO,EACPC,GAAQ,EAKR,CACJ,SAAUC,GAAY,QAAAC,GAAS,QAAAC,GAC/B,KAAMC,GAAQ,aAAcC,GAAgB,YAAaC,GAAe,eAAgBC,EAAkB,aAAcC,GAAgB,YAAaC,GAAe,YAAAC,GACpK,WAAAC,EACF,EAAIhQ,GAOKiQ,GAAO,MACPC,GAAQ,MACRC,GAAO,MACPC,GAAK,MACLC,GAAQ,MACRC,GAAQ,MACRC,GAAO,MACPC,GAAU,MACVC,GAAO,MACPC,GAAS,MACTC,GAAO,MACHC,EAAO,MACPC,GAAS,MACTC,GAAS,MACTC,GAAQ,MACRC,GAAO,MACPC,GAAQ,MACRC,GAAU,MACVC,GAAW,MACPC,GAAO,MACPC,GAAM,MACNC,GAAS,MACTC,GAAO,MACPC,GAAU,MACVC,GAAQ,MACRC,GAAM,MACdC,GAAQ,MACRC,GAAS,MACTC,GAAO,MACPC,EAAM,MACNC,GAAM,MACNC,GAAO,MAMVC,GAAc,IACdC,GAAe,IAKfC,GAFY,GAKZC,GAAW7I,IAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACXA,EAAI,QAAW,KACfA,EAAI,MAAS,IAIzB,SAAS8I,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EAEZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EAEb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EAEb,KAAK,KAAO,KAGZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,OAAS,KAGd,KAAK,KAAO,EACZ,KAAK,KAAO,EAGZ,KAAK,OAAS,EACd,KAAK,OAAS,EAGd,KAAK,MAAQ,EAGb,KAAK,QAAU,KACf,KAAK,SAAW,KAChB,KAAK,QAAU,EACf,KAAK,SAAW,EAGhB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,KAAO,KAEZ,KAAK,KAAO,IAAI,YAAY,GAAG,EAC/B,KAAK,KAAO,IAAI,YAAY,GAAG,EAO/B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,CACb,CAGA,MAAMC,GAAqBpP,GAAS,CAElC,GAAI,CAACA,EACH,MAAO,GAET,MAAM+J,EAAQ/J,EAAK,MACnB,MAAI,CAAC+J,GAASA,EAAM,OAAS/J,GAC3B+J,EAAM,KAAOgD,IAAQhD,EAAM,KAAO+E,GAC3B,EAEF,CACT,EAGMO,GAAoBrP,GAAS,CAEjC,GAAIoP,GAAkBpP,CAAI,EAAK,OAAO0M,EACtC,MAAM3C,EAAQ/J,EAAK,MACnB,OAAAA,EAAK,SAAWA,EAAK,UAAY+J,EAAM,MAAQ,EAC/C/J,EAAK,IAAM,GACP+J,EAAM,OACR/J,EAAK,MAAQ+J,EAAM,KAAO,GAE5BA,EAAM,KAAOgD,GACbhD,EAAM,KAAO,EACbA,EAAM,SAAW,EACjBA,EAAM,MAAQ,GACdA,EAAM,KAAO,MACbA,EAAM,KAAO,KACbA,EAAM,KAAO,EACbA,EAAM,KAAO,EAEbA,EAAM,QAAUA,EAAM,OAAS,IAAI,WAAWgF,EAAW,EACzDhF,EAAM,SAAWA,EAAM,QAAU,IAAI,WAAWiF,EAAY,EAE5DjF,EAAM,KAAO,EACbA,EAAM,KAAO,GAENwC,EACT,EAGM+C,GAAgBtP,GAAS,CAE7B,GAAIoP,GAAkBpP,CAAI,EAAK,OAAO0M,EACtC,MAAM3C,EAAQ/J,EAAK,MACnB,OAAA+J,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACPsF,GAAiBrP,CAAI,CAE9B,EAGMuP,GAAgB,CAACvP,EAAM0D,IAAe,CAC1C,IAAIG,EAGJ,GAAIuL,GAAkBpP,CAAI,EAAK,OAAO0M,EACtC,MAAM3C,EAAQ/J,EAAK,MAenB,OAZI0D,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,IAGdG,GAAQH,GAAc,GAAK,EACvBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCgJ,GAEL3C,EAAM,SAAW,MAAQA,EAAM,QAAUrG,IAC3CqG,EAAM,OAAS,MAIjBA,EAAM,KAAOlG,EACbkG,EAAM,MAAQrG,EACP4L,GAAatP,CAAI,EAC1B,EAGMwP,GAAe,CAACxP,EAAM0D,IAAe,CAEzC,GAAI,CAAC1D,EAAQ,OAAO0M,EAGpB,MAAM3C,EAAQ,IAAIoF,GAIlBnP,EAAK,MAAQ+J,EACbA,EAAM,KAAO/J,EACb+J,EAAM,OAAS,KACfA,EAAM,KAAOgD,GACb,MAAM3J,EAAMmM,GAAcvP,EAAM0D,CAAU,EAC1C,OAAIN,IAAQmJ,KACVvM,EAAK,MAAQ,MAERoD,CACT,EAGMqM,GAAezP,GAEZwP,GAAaxP,EAAMiP,EAAS,EAcrC,IAAIS,GAAS,GAETC,GAAQC,GAGZ,MAAMC,GAAe9F,GAAU,CAG7B,GAAI2F,GAAQ,CACVC,GAAS,IAAI,WAAW,GAAG,EAC3BC,GAAU,IAAI,WAAW,EAAE,EAG3B,IAAIzE,EAAM,EACV,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOpB,EAAM,KAAKoB,GAAK,EAAI,EAMxC,IAJAN,GAASqB,GAAOnC,EAAM,KAAM,EAAG,IAAK4F,GAAU,EAAG5F,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxEoB,EAAM,EACCA,EAAM,IAAMpB,EAAM,KAAKoB,GAAK,EAAI,EAEvCN,GAASsB,GAAOpC,EAAM,KAAM,EAAG,GAAM6F,GAAS,EAAG7F,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxE2F,GAAS,EACV,CAED3F,EAAM,QAAU4F,GAChB5F,EAAM,QAAU,EAChBA,EAAM,SAAW6F,GACjB7F,EAAM,SAAW,CACnB,EAiBM+F,GAAe,CAAC9P,EAAM3Y,EAAK2F,EAAKoX,IAAS,CAE7C,IAAIhM,EACJ,MAAM2R,EAAQ/J,EAAK,MAGnB,OAAI+J,EAAM,SAAW,OACnBA,EAAM,MAAQ,GAAKA,EAAM,MACzBA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EAEdA,EAAM,OAAS,IAAI,WAAWA,EAAM,KAAK,GAIvC3F,GAAQ2F,EAAM,OAChBA,EAAM,OAAO,IAAI1iB,EAAI,SAAS2F,EAAM+c,EAAM,MAAO/c,CAAG,EAAG,CAAC,EACxD+c,EAAM,MAAQ,EACdA,EAAM,MAAQA,EAAM,QAGpB3R,EAAO2R,EAAM,MAAQA,EAAM,MACvB3R,EAAOgM,IACThM,EAAOgM,GAGT2F,EAAM,OAAO,IAAI1iB,EAAI,SAAS2F,EAAMoX,EAAMpX,EAAMoX,EAAOhM,CAAI,EAAG2R,EAAM,KAAK,EACzE3F,GAAQhM,EACJgM,GAEF2F,EAAM,OAAO,IAAI1iB,EAAI,SAAS2F,EAAMoX,EAAMpX,CAAG,EAAG,CAAC,EACjD+c,EAAM,MAAQ3F,EACd2F,EAAM,MAAQA,EAAM,QAGpBA,EAAM,OAAS3R,EACX2R,EAAM,QAAUA,EAAM,QAASA,EAAM,MAAQ,GAC7CA,EAAM,MAAQA,EAAM,QAASA,EAAM,OAAS3R,KAG7C,CACT,EAGM2X,GAAY,CAAC/P,EAAM4B,IAAU,CAEjC,IAAImI,EACAhF,EAAO+E,EACPhF,EACAkL,EACAjO,EAAMD,EACNwH,EACAlV,EACA4U,EAAKC,EACL7E,EACAwF,EACAC,EACAH,EAAO,EACPoC,EAAWC,EAASC,EAEpBiE,EAAWC,EAASC,EACpBrjB,EACAsW,EACJ,MAAMgN,EAAO,IAAI,WAAW,CAAC,EAC7B,IAAIrkB,EAEAc,EAEJ,MAAMwjB,EACJ,IAAI,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAE,EAGrF,GAAIjB,GAAkBpP,CAAI,GAAK,CAACA,EAAK,QAChC,CAACA,EAAK,OAASA,EAAK,WAAa,EACpC,OAAO0M,EAGT3C,EAAQ/J,EAAK,MACT+J,EAAM,OAAS2D,IAAQ3D,EAAM,KAAO4D,IAIxCqC,EAAMhQ,EAAK,SACX8J,EAAS9J,EAAK,OACd8B,EAAO9B,EAAK,UACZ8E,EAAO9E,EAAK,QACZ+E,EAAQ/E,EAAK,MACb+B,EAAO/B,EAAK,SACZsJ,EAAOS,EAAM,KACb3V,EAAO2V,EAAM,KAGbf,EAAMjH,EACNkH,EAAOnH,EACPsB,EAAMmJ,GAEN+D,EACA,OACE,OAAQvG,EAAM,KAAI,CAChB,KAAKgD,GACH,GAAIhD,EAAM,OAAS,EAAG,CACpBA,EAAM,KAAO4D,GACb,KACD,CAED,KAAOvZ,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED,GAAK2V,EAAM,KAAO,GAAMT,IAAS,MAAQ,CACnCS,EAAM,QAAU,IAClBA,EAAM,MAAQ,IAEhBA,EAAM,MAAQ,EAEdqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQnN,EAAQmN,EAAM,MAAOqG,EAAM,EAAG,CAAC,EAI7C9G,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAOiD,GACb,KACD,CAID,GAHIjD,EAAM,OACRA,EAAM,KAAK,KAAO,IAEhB,EAAEA,EAAM,KAAO,OACdT,EAAO,MAAoB,IAAMA,GAAQ,IAAM,GAAI,CACtDtJ,EAAK,IAAM,yBACX+J,EAAM,KAAO6E,EACb,KACD,CACD,IAAKtF,EAAO,MAAqBwD,GAAY,CAC3C9M,EAAK,IAAM,6BACX+J,EAAM,KAAO6E,EACb,KACD,CASD,GAPAtF,KAAU,EACVlV,GAAQ,EAERtH,GAAOwc,EAAO,IAAmB,EAC7BS,EAAM,QAAU,IAClBA,EAAM,MAAQjd,GAEZA,EAAM,IAAMA,EAAMid,EAAM,MAAO,CACjC/J,EAAK,IAAM,sBACX+J,EAAM,KAAO6E,EACb,KACD,CAID7E,EAAM,KAAO,GAAKA,EAAM,MAGxBA,EAAM,MAAQ,EAEd/J,EAAK,MAAQ+J,EAAM,MAAQ,EAC3BA,EAAM,KAAOT,EAAO,IAAQkE,GAASE,EAErCpE,EAAO,EACPlV,EAAO,EAEP,MACF,KAAK4Y,GAEH,KAAO5Y,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAGD,GADA2V,EAAM,MAAQT,GACTS,EAAM,MAAQ,OAAU+C,GAAY,CACvC9M,EAAK,IAAM,6BACX+J,EAAM,KAAO6E,EACb,KACD,CACD,GAAI7E,EAAM,MAAQ,MAAQ,CACxB/J,EAAK,IAAM,2BACX+J,EAAM,KAAO6E,EACb,KACD,CACG7E,EAAM,OACRA,EAAM,KAAK,KAAST,GAAQ,EAAK,GAE9BS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQnN,EAAQmN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAOkD,GAEf,KAAKA,GAEH,KAAO7Y,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAEG2V,EAAM,OACRA,EAAM,KAAK,KAAOT,GAEfS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzB8G,EAAK,CAAC,EAAK9G,IAAS,GAAM,IAC1B8G,EAAK,CAAC,EAAK9G,IAAS,GAAM,IAC1BS,EAAM,MAAQnN,EAAQmN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAOmD,GAEf,KAAKA,GAEH,KAAO9Y,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAEG2V,EAAM,OACRA,EAAM,KAAK,OAAUT,EAAO,IAC5BS,EAAM,KAAK,GAAMT,GAAQ,GAEtBS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQnN,EAAQmN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAOoD,GAEf,KAAKA,GACH,GAAIpD,EAAM,MAAQ,KAAQ,CAExB,KAAO3V,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED2V,EAAM,OAAST,EACXS,EAAM,OACRA,EAAM,KAAK,UAAYT,GAEpBS,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAE1CqG,EAAK,CAAC,EAAI9G,EAAO,IACjB8G,EAAK,CAAC,EAAK9G,IAAS,EAAK,IACzBS,EAAM,MAAQnN,EAAQmN,EAAM,MAAOqG,EAAM,EAAG,CAAC,GAI/C9G,EAAO,EACPlV,EAAO,CAER,MACQ2V,EAAM,OACbA,EAAM,KAAK,MAAQ,MAErBA,EAAM,KAAOqD,GAEf,KAAKA,GACH,GAAIrD,EAAM,MAAQ,OAChB3F,EAAO2F,EAAM,OACT3F,EAAOrC,IAAQqC,EAAOrC,GACtBqC,IACE2F,EAAM,OACRjd,EAAMid,EAAM,KAAK,UAAYA,EAAM,OAC9BA,EAAM,KAAK,QAEdA,EAAM,KAAK,MAAQ,IAAI,WAAWA,EAAM,KAAK,SAAS,GAExDA,EAAM,KAAK,MAAM,IACfhF,EAAM,SACJD,EAGAA,EAAOV,CACR,EAEDtX,CAChB,GAKiBid,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQnN,EAAQmN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACR2F,EAAM,QAAU3F,GAEd2F,EAAM,QAAU,MAAMuG,EAE5BvG,EAAM,OAAS,EACfA,EAAM,KAAOsD,GAEf,KAAKA,GACH,GAAItD,EAAM,MAAQ,KAAQ,CACxB,GAAIhI,IAAS,EAAK,MAAMuO,EACxBlM,EAAO,EACP,GAEEtX,EAAMiY,EAAMD,EAAOV,GAAM,EAErB2F,EAAM,MAAQjd,GACbid,EAAM,OAAS,QAClBA,EAAM,KAAK,MAAQ,OAAO,aAAajd,CAAG,SAErCA,GAAOsX,EAAOrC,GAOvB,GALKgI,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQnN,EAAQmN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACJtX,EAAO,MAAMwjB,CAClB,MACQvG,EAAM,OACbA,EAAM,KAAK,KAAO,MAEpBA,EAAM,OAAS,EACfA,EAAM,KAAOuD,GAEf,KAAKA,GACH,GAAIvD,EAAM,MAAQ,KAAQ,CACxB,GAAIhI,IAAS,EAAK,MAAMuO,EACxBlM,EAAO,EACP,GACEtX,EAAMiY,EAAMD,EAAOV,GAAM,EAErB2F,EAAM,MAAQjd,GACbid,EAAM,OAAS,QAClBA,EAAM,KAAK,SAAW,OAAO,aAAajd,CAAG,SAExCA,GAAOsX,EAAOrC,GAMvB,GALKgI,EAAM,MAAQ,KAAYA,EAAM,KAAO,IAC1CA,EAAM,MAAQnN,EAAQmN,EAAM,MAAOhF,EAAOX,EAAMU,CAAI,GAEtD/C,GAAQqC,EACRU,GAAQV,EACJtX,EAAO,MAAMwjB,CAClB,MACQvG,EAAM,OACbA,EAAM,KAAK,QAAU,MAEvBA,EAAM,KAAOwD,GAEf,KAAKA,GACH,GAAIxD,EAAM,MAAQ,IAAQ,CAExB,KAAO3V,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED,GAAK2V,EAAM,KAAO,GAAMT,KAAUS,EAAM,MAAQ,OAAS,CACvD/J,EAAK,IAAM,sBACX+J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACPlV,EAAO,CAER,CACG2V,EAAM,OACRA,EAAM,KAAK,KAASA,EAAM,OAAS,EAAK,EACxCA,EAAM,KAAK,KAAO,IAEpB/J,EAAK,MAAQ+J,EAAM,MAAQ,EAC3BA,EAAM,KAAO2D,EACb,MACF,KAAKF,GAEH,KAAOpZ,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED4L,EAAK,MAAQ+J,EAAM,MAAQmF,GAAQ5F,CAAI,EAEvCA,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAO0D,GAEf,KAAKA,GACH,GAAI1D,EAAM,WAAa,EAErB,OAAA/J,EAAK,SAAWgQ,EAChBhQ,EAAK,UAAY8B,EACjB9B,EAAK,QAAU8E,EACf9E,EAAK,SAAW+B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAO3V,EAENqY,GAETzM,EAAK,MAAQ+J,EAAM,MAAQ,EAC3BA,EAAM,KAAO2D,EAEf,KAAKA,EACH,GAAI9L,IAAUyK,IAAWzK,IAAU0K,GAAW,MAAMgE,EAEtD,KAAK3C,GACH,GAAI5D,EAAM,KAAM,CAEdT,KAAUlV,EAAO,EACjBA,GAAQA,EAAO,EAEf2V,EAAM,KAAO0E,GACb,KACD,CAED,KAAOra,EAAO,GAAG,CACf,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAQD,OANA2V,EAAM,KAAQT,EAAO,EAErBA,KAAU,EACVlV,GAAQ,EAGCkV,EAAO,EAAI,CAClB,IAAK,GAGHS,EAAM,KAAO6D,GACb,MACF,IAAK,GAKH,GAJAiC,GAAY9F,CAAK,EAGjBA,EAAM,KAAOmE,GACTtM,IAAU0K,GAAS,CAErBhD,KAAU,EACVlV,GAAQ,EAER,MAAMkc,CACP,CACD,MACF,IAAK,GAGHvG,EAAM,KAAOgE,GACb,MACF,IAAK,GACH/N,EAAK,IAAM,qBACX+J,EAAM,KAAO6E,CAChB,CAEDtF,KAAU,EACVlV,GAAQ,EAER,MACF,KAAKwZ,GAMH,IAJAtE,KAAUlV,EAAO,EACjBA,GAAQA,EAAO,EAGRA,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED,IAAKkV,EAAO,UAAcA,IAAS,GAAM,OAAS,CAChDtJ,EAAK,IAAM,+BACX+J,EAAM,KAAO6E,EACb,KACD,CASD,GARA7E,EAAM,OAAST,EAAO,MAItBA,EAAO,EACPlV,EAAO,EAEP2V,EAAM,KAAO8D,GACTjM,IAAU0K,GAAW,MAAMgE,EAEjC,KAAKzC,GACH9D,EAAM,KAAO+D,GAEf,KAAKA,GAEH,GADA1J,EAAO2F,EAAM,OACT3F,EAAM,CAGR,GAFIA,EAAOrC,IAAQqC,EAAOrC,GACtBqC,EAAOtC,IAAQsC,EAAOtC,GACtBsC,IAAS,EAAK,MAAMkM,EAExBxG,EAAO,IAAI/E,EAAM,SAASD,EAAMA,EAAOV,CAAI,EAAG4L,CAAG,EAEjDjO,GAAQqC,EACRU,GAAQV,EACRtC,GAAQsC,EACR4L,GAAO5L,EACP2F,EAAM,QAAU3F,EAChB,KACD,CAED2F,EAAM,KAAO2D,EACb,MACF,KAAKK,GAEH,KAAO3Z,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAkBD,GAhBA2V,EAAM,MAAQT,EAAO,IAAmB,IAExCA,KAAU,EACVlV,GAAQ,EAER2V,EAAM,OAAST,EAAO,IAAmB,EAEzCA,KAAU,EACVlV,GAAQ,EAER2V,EAAM,OAAST,EAAO,IAAmB,EAEzCA,KAAU,EACVlV,GAAQ,EAGJ2V,EAAM,KAAO,KAAOA,EAAM,MAAQ,GAAI,CACxC/J,EAAK,IAAM,sCACX+J,EAAM,KAAO6E,EACb,KACD,CAGD7E,EAAM,KAAO,EACbA,EAAM,KAAOiE,GAEf,KAAKA,GACH,KAAOjE,EAAM,KAAOA,EAAM,OAAO,CAE/B,KAAO3V,EAAO,GAAG,CACf,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED2V,EAAM,KAAKsG,EAAMtG,EAAM,MAAM,CAAC,EAAKT,EAAO,EAE1CA,KAAU,EACVlV,GAAQ,CAET,CACD,KAAO2V,EAAM,KAAO,IAClBA,EAAM,KAAKsG,EAAMtG,EAAM,MAAM,CAAC,EAAI,EAapC,GAPAA,EAAM,QAAUA,EAAM,OACtBA,EAAM,QAAU,EAEhBhe,EAAO,CAAE,KAAMge,EAAM,OAAO,EAC5B3G,EAAMyH,GAASoB,GAAOlC,EAAM,KAAM,EAAG,GAAIA,EAAM,QAAS,EAAGA,EAAM,KAAMhe,CAAI,EAC3Ege,EAAM,QAAUhe,EAAK,KAEjBqX,EAAK,CACPpD,EAAK,IAAM,2BACX+J,EAAM,KAAO6E,EACb,KACD,CAED7E,EAAM,KAAO,EACbA,EAAM,KAAOkE,GAEf,KAAKA,GACH,KAAOlE,EAAM,KAAOA,EAAM,KAAOA,EAAM,OAAO,CAC5C,KACEL,EAAOK,EAAM,QAAQT,GAAS,GAAKS,EAAM,SAAW,CAAE,EACtD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAoC,GAAc1X,IANZ,CAQP,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CAET,CACD,GAAI4X,EAAW,GAEb1C,KAAUwC,EACV1X,GAAQ0X,EAER/B,EAAM,KAAKA,EAAM,MAAM,EAAIiC,MAExB,CACH,GAAIA,IAAa,GAAI,CAGnB,IADAnf,EAAIif,EAAY,EACT1X,EAAOvH,GAAG,CACf,GAAIkV,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAMD,GAHAkV,KAAUwC,EACV1X,GAAQ0X,EAEJ/B,EAAM,OAAS,EAAG,CACpB/J,EAAK,IAAM,4BACX+J,EAAM,KAAO6E,EACb,KACD,CACD9hB,EAAMid,EAAM,KAAKA,EAAM,KAAO,CAAC,EAC/B3F,EAAO,GAAKkF,EAAO,GAEnBA,KAAU,EACVlV,GAAQ,CAET,SACQ4X,IAAa,GAAI,CAGxB,IADAnf,EAAIif,EAAY,EACT1X,EAAOvH,GAAG,CACf,GAAIkV,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAGDkV,KAAUwC,EACV1X,GAAQ0X,EAERhf,EAAM,EACNsX,EAAO,GAAKkF,EAAO,GAEnBA,KAAU,EACVlV,GAAQ,CAET,KACI,CAGH,IADAvH,EAAIif,EAAY,EACT1X,EAAOvH,GAAG,CACf,GAAIkV,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAGDkV,KAAUwC,EACV1X,GAAQ0X,EAERhf,EAAM,EACNsX,EAAO,IAAMkF,EAAO,KAEpBA,KAAU,EACVlV,GAAQ,CAET,CACD,GAAI2V,EAAM,KAAO3F,EAAO2F,EAAM,KAAOA,EAAM,MAAO,CAChD/J,EAAK,IAAM,4BACX+J,EAAM,KAAO6E,EACb,KACD,CACD,KAAOxK,KACL2F,EAAM,KAAKA,EAAM,MAAM,EAAIjd,CAE9B,CACF,CAGD,GAAIid,EAAM,OAAS6E,EAAO,MAG1B,GAAI7E,EAAM,KAAK,GAAG,IAAM,EAAG,CACzB/J,EAAK,IAAM,uCACX+J,EAAM,KAAO6E,EACb,KACD,CAcD,GATA7E,EAAM,QAAU,EAEhBhe,EAAO,CAAE,KAAMge,EAAM,OAAO,EAC5B3G,EAAMyH,GAASqB,GAAMnC,EAAM,KAAM,EAAGA,EAAM,KAAMA,EAAM,QAAS,EAAGA,EAAM,KAAMhe,CAAI,EAGlFge,EAAM,QAAUhe,EAAK,KAGjBqX,EAAK,CACPpD,EAAK,IAAM,8BACX+J,EAAM,KAAO6E,EACb,KACD,CAaD,GAXA7E,EAAM,SAAW,EAGjBA,EAAM,SAAWA,EAAM,QACvBhe,EAAO,CAAE,KAAMge,EAAM,QAAQ,EAC7B3G,EAAMyH,GAASsB,GAAOpC,EAAM,KAAMA,EAAM,KAAMA,EAAM,MAAOA,EAAM,SAAU,EAAGA,EAAM,KAAMhe,CAAI,EAG9Fge,EAAM,SAAWhe,EAAK,KAGlBqX,EAAK,CACPpD,EAAK,IAAM,wBACX+J,EAAM,KAAO6E,EACb,KACD,CAGD,GADA7E,EAAM,KAAOmE,GACTtM,IAAU0K,GAAW,MAAMgE,EAEjC,KAAKpC,GACHnE,EAAM,KAAOoE,GAEf,KAAKA,GACH,GAAIpM,GAAQ,GAAKD,GAAQ,IAAK,CAE5B9B,EAAK,SAAWgQ,EAChBhQ,EAAK,UAAY8B,EACjB9B,EAAK,QAAU8E,EACf9E,EAAK,SAAW+B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAO3V,EAEb2U,GAAQ/I,EAAMiJ,CAAI,EAElB+G,EAAMhQ,EAAK,SACX8J,EAAS9J,EAAK,OACd8B,EAAO9B,EAAK,UACZ8E,EAAO9E,EAAK,QACZ+E,EAAQ/E,EAAK,MACb+B,EAAO/B,EAAK,SACZsJ,EAAOS,EAAM,KACb3V,EAAO2V,EAAM,KAGTA,EAAM,OAAS2D,IACjB3D,EAAM,KAAO,IAEf,KACD,CAED,IADAA,EAAM,KAAO,EAEXL,EAAOK,EAAM,QAAQT,GAAS,GAAKS,EAAM,SAAW,CAAE,EACtD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEd,EAAAoC,GAAa1X,IANV,CAQP,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CAET,CACD,GAAI2X,GAAY,EAAAA,EAAU,KAAa,CAIrC,IAHAkE,EAAYnE,EACZoE,EAAUnE,EACVoE,EAAWnE,EAETtC,EAAOK,EAAM,QAAQoG,IACX7G,GAAS,GAAM2G,EAAYC,GAAY,IAAoCD,EAAU,EAC/FnE,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAuG,EAAYnE,GAAc1X,IAPxB,CASP,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CAET,CAEDkV,KAAU2G,EACV7b,GAAQ6b,EAERlG,EAAM,MAAQkG,CACf,CAOD,GALA3G,KAAUwC,EACV1X,GAAQ0X,EAER/B,EAAM,MAAQ+B,EACd/B,EAAM,OAASiC,EACXD,IAAY,EAAG,CAIjBhC,EAAM,KAAOyE,GACb,KACD,CACD,GAAIzC,EAAU,GAAI,CAEhBhC,EAAM,KAAO,GACbA,EAAM,KAAO2D,EACb,KACD,CACD,GAAI3B,EAAU,GAAI,CAChB/L,EAAK,IAAM,8BACX+J,EAAM,KAAO6E,EACb,KACD,CACD7E,EAAM,MAAQgC,EAAU,GACxBhC,EAAM,KAAOqE,GAEf,KAAKA,GACH,GAAIrE,EAAM,MAAO,CAGf,IADAld,EAAIkd,EAAM,MACH3V,EAAOvH,GAAG,CACf,GAAIkV,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED2V,EAAM,QAAUT,GAAS,GAAKS,EAAM,OAAS,EAE7CT,KAAUS,EAAM,MAChB3V,GAAQ2V,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAEDA,EAAM,IAAMA,EAAM,OAClBA,EAAM,KAAOsE,GAEf,KAAKA,GACH,KACE3E,EAAOK,EAAM,SAAST,GAAS,GAAKS,EAAM,UAAY,CAAE,EACxD+B,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAoC,GAAc1X,IANZ,CAQP,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CAET,CACD,GAAK,EAAA2X,EAAU,KAAa,CAI1B,IAHAkE,EAAYnE,EACZoE,EAAUnE,EACVoE,EAAWnE,EAETtC,EAAOK,EAAM,SAASoG,IACZ7G,GAAS,GAAM2G,EAAYC,GAAY,IAAoCD,EAAU,EAC/FnE,EAAYpC,IAAS,GACrBqC,EAAWrC,IAAS,GAAM,IAC1BsC,EAAWtC,EAAO,MAEb,EAAAuG,EAAYnE,GAAc1X,IAPxB,CASP,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CAET,CAEDkV,KAAU2G,EACV7b,GAAQ6b,EAERlG,EAAM,MAAQkG,CACf,CAMD,GAJA3G,KAAUwC,EACV1X,GAAQ0X,EAER/B,EAAM,MAAQ+B,EACVC,EAAU,GAAI,CAChB/L,EAAK,IAAM,wBACX+J,EAAM,KAAO6E,EACb,KACD,CACD7E,EAAM,OAASiC,EACfjC,EAAM,MAASgC,EAAW,GAC1BhC,EAAM,KAAOuE,GAEf,KAAKA,GACH,GAAIvE,EAAM,MAAO,CAGf,IADAld,EAAIkd,EAAM,MACH3V,EAAOvH,GAAG,CACf,GAAIkV,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED2V,EAAM,QAAUT,GAAS,GAAKS,EAAM,OAAS,EAE7CT,KAAUS,EAAM,MAChB3V,GAAQ2V,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAED,GAAIA,EAAM,OAASA,EAAM,KAAM,CAC7B/J,EAAK,IAAM,gCACX+J,EAAM,KAAO6E,EACb,KACD,CAGD7E,EAAM,KAAOwE,GAEf,KAAKA,GACH,GAAIzM,IAAS,EAAK,MAAMwO,EAExB,GADAlM,EAAO6E,EAAOnH,EACViI,EAAM,OAAS3F,EAAM,CAEvB,GADAA,EAAO2F,EAAM,OAAS3F,EAClBA,EAAO2F,EAAM,OACXA,EAAM,KAAM,CACd/J,EAAK,IAAM,gCACX+J,EAAM,KAAO6E,EACb,KACD,CAiBCxK,EAAO2F,EAAM,OACf3F,GAAQ2F,EAAM,MACdH,EAAOG,EAAM,MAAQ3F,GAGrBwF,EAAOG,EAAM,MAAQ3F,EAEnBA,EAAO2F,EAAM,SAAU3F,EAAO2F,EAAM,QACxCF,EAAcE,EAAM,MACrB,MAECF,EAAcC,EACdF,EAAOoG,EAAMjG,EAAM,OACnB3F,EAAO2F,EAAM,OAEX3F,EAAOtC,IAAQsC,EAAOtC,GAC1BA,GAAQsC,EACR2F,EAAM,QAAU3F,EAChB,GACE0F,EAAOkG,GAAK,EAAInG,EAAYD,GAAM,QAC3B,EAAExF,GACP2F,EAAM,SAAW,IAAKA,EAAM,KAAOoE,IACvC,MACF,KAAKK,GACH,GAAI1M,IAAS,EAAK,MAAMwO,EACxBxG,EAAOkG,GAAK,EAAIjG,EAAM,OACtBjI,IACAiI,EAAM,KAAOoE,GACb,MACF,KAAKM,GACH,GAAI1E,EAAM,KAAM,CAEd,KAAO3V,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IAEAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAaD,GAXA6U,GAAQnH,EACR9B,EAAK,WAAaiJ,EAClBc,EAAM,OAASd,EACVc,EAAM,KAAO,GAAMd,IACtBjJ,EAAK,MAAQ+J,EAAM,MAEdA,EAAM,MAAQnN,EAAQmN,EAAM,MAAOD,EAAQb,EAAM+G,EAAM/G,CAAI,EAAI5M,GAAU0N,EAAM,MAAOD,EAAQb,EAAM+G,EAAM/G,CAAI,GAGrHA,EAAOnH,EAEFiI,EAAM,KAAO,IAAOA,EAAM,MAAQT,EAAO4F,GAAQ5F,CAAI,KAAOS,EAAM,MAAO,CAC5E/J,EAAK,IAAM,uBACX+J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACPlV,EAAO,CAGR,CACD2V,EAAM,KAAO2E,GAEf,KAAKA,GACH,GAAI3E,EAAM,MAAQA,EAAM,MAAO,CAE7B,KAAO3V,EAAO,IAAI,CAChB,GAAI2N,IAAS,EAAK,MAAMuO,EACxBvO,IACAuH,GAAQvE,EAAMD,GAAM,GAAK1Q,EACzBA,GAAQ,CACT,CAED,GAAK2V,EAAM,KAAO,GAAMT,KAAUS,EAAM,MAAQ,YAAa,CAC3D/J,EAAK,IAAM,yBACX+J,EAAM,KAAO6E,EACb,KACD,CAEDtF,EAAO,EACPlV,EAAO,CAGR,CACD2V,EAAM,KAAO4E,GAEf,KAAKA,GACHvL,EAAMoJ,GACN,MAAM8D,EACR,KAAK1B,EACHxL,EAAMuJ,GACN,MAAM2D,EACR,KAAKzB,GACH,OAAOjC,GACT,KAAKkC,GAEL,QACE,OAAOpC,CACV,CAaH,OAAA1M,EAAK,SAAWgQ,EAChBhQ,EAAK,UAAY8B,EACjB9B,EAAK,QAAU8E,EACf9E,EAAK,SAAW+B,EAChBgI,EAAM,KAAOT,EACbS,EAAM,KAAO3V,GAGT2V,EAAM,OAAUd,IAASjJ,EAAK,WAAa+J,EAAM,KAAO6E,IACvC7E,EAAM,KAAO0E,IAAS7M,IAAUwK,MAC/C0D,GAAa9P,EAAMA,EAAK,OAAQA,EAAK,SAAUiJ,EAAOjJ,EAAK,SAAS,EAE1EgJ,GAAOhJ,EAAK,SACZiJ,GAAQjJ,EAAK,UACbA,EAAK,UAAYgJ,EACjBhJ,EAAK,WAAaiJ,EAClBc,EAAM,OAASd,EACVc,EAAM,KAAO,GAAMd,IACtBjJ,EAAK,MAAQ+J,EAAM,MAChBA,EAAM,MAAQnN,EAAQmN,EAAM,MAAOD,EAAQb,EAAMjJ,EAAK,SAAWiJ,CAAI,EAAI5M,GAAU0N,EAAM,MAAOD,EAAQb,EAAMjJ,EAAK,SAAWiJ,CAAI,GAEvIjJ,EAAK,UAAY+J,EAAM,MAAQA,EAAM,KAAO,GAAK,IAC9BA,EAAM,OAAS2D,EAAO,IAAM,IAC5B3D,EAAM,OAASmE,IAAQnE,EAAM,OAAS8D,GAAQ,IAAM,IACjE7E,IAAQ,GAAKC,IAAS,GAAMrH,IAAUwK,KAAehJ,IAAQmJ,KACjEnJ,EAAMyJ,IAEDzJ,CACT,EAGMmN,GAAcvQ,GAAS,CAE3B,GAAIoP,GAAkBpP,CAAI,EACxB,OAAO0M,EAGT,IAAI3C,EAAQ/J,EAAK,MACjB,OAAI+J,EAAM,SACRA,EAAM,OAAS,MAEjB/J,EAAK,MAAQ,KACNuM,EACT,EAGMiE,GAAmB,CAACxQ,EAAMsD,IAAS,CAGvC,GAAI8L,GAAkBpP,CAAI,EAAK,OAAO0M,EACtC,MAAM3C,EAAQ/J,EAAK,MACnB,OAAK+J,EAAM,KAAO,GAGlBA,EAAM,KAAOzG,EACbA,EAAK,KAAO,GACLiJ,IAL8BG,CAMvC,EAGM+D,GAAuB,CAACzQ,EAAM0E,IAAe,CACjD,MAAMC,EAAaD,EAAW,OAE9B,IAAIqF,EACA2G,EACAtN,EAMJ,OAHIgM,GAAkBpP,CAAI,IAC1B+J,EAAQ/J,EAAK,MAET+J,EAAM,OAAS,GAAKA,EAAM,OAAS0D,IAC9Bf,EAIL3C,EAAM,OAAS0D,KACjBiD,EAAS,EAETA,EAASrU,GAAUqU,EAAQhM,EAAYC,EAAY,CAAC,EAChD+L,IAAW3G,EAAM,OACZ4C,IAKXvJ,EAAM0M,GAAa9P,EAAM0E,EAAYC,EAAYA,CAAU,EACvDvB,GACF2G,EAAM,KAAO8E,GACNjC,KAET7C,EAAM,SAAW,EAEVwC,IACT,EAGA,IAAIoE,GAAiBrB,GACjBsB,GAAkBrB,GAClBsB,GAAqBxB,GACrByB,GAAgBrB,GAChBsB,GAAiBvB,GACjBwB,GAAcjB,GACdkB,GAAeV,GACfW,GAAqBV,GACrBW,GAAyBV,GACzBW,GAAc,qCAcdC,EAAc,CACjB,aAAcV,GACd,cAAeC,GACf,iBAAkBC,GAClB,YAAaC,GACb,aAAcC,GACd,QAASC,GACT,WAAYC,GACZ,iBAAkBC,GAClB,qBAAsBC,GACtB,YAAaC,EACd,EAqBA,SAASE,IAAW,CAElB,KAAK,KAAa,EAElB,KAAK,KAAa,EAElB,KAAK,OAAa,EAElB,KAAK,GAAa,EAElB,KAAK,MAAa,KAElB,KAAK,UAAa,EAWlB,KAAK,KAAa,GAIlB,KAAK,QAAa,GAIlB,KAAK,KAAa,EAElB,KAAK,KAAa,EACpB,CAEA,IAAIC,GAAWD,GAEf,MAAME,GAAW,OAAO,UAAU,SAK5B,CACJ,WAAAC,GAAY,SAAAC,GACZ,KAAAC,GAAM,aAAAC,GAAc,YAAAC,GAAa,eAAAC,GAAgB,aAAAC,GAAc,YAAAC,EACjE,EAAIlV,GAkFJ,SAASmV,GAAU51B,EAAS,CAC1B,KAAK,QAAU6pB,GAAO,OAAO,CAC3B,UAAW,MACX,WAAY,GACZ,GAAI,EACR,EAAK7pB,GAAW,CAAA,CAAE,EAEhB,MAAMmR,EAAM,KAAK,QAIbA,EAAI,KAAQA,EAAI,YAAc,GAAOA,EAAI,WAAa,KACxDA,EAAI,WAAa,CAACA,EAAI,WAClBA,EAAI,aAAe,IAAKA,EAAI,WAAa,MAI1CA,EAAI,YAAc,GAAOA,EAAI,WAAa,IAC3C,EAAEnR,GAAWA,EAAQ,cACvBmR,EAAI,YAAc,IAKfA,EAAI,WAAa,IAAQA,EAAI,WAAa,KAGxCA,EAAI,WAAa,KACpBA,EAAI,YAAc,KAItB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAS,IAAI2Z,GAClB,KAAK,KAAK,UAAY,EAEtB,IAAI3C,EAAU6M,EAAY,aACxB,KAAK,KACL7jB,EAAI,UACR,EAEE,GAAIgX,IAAWmN,GACb,MAAM,IAAI,MAAM9U,GAAS2H,CAAM,CAAC,EAQlC,GALA,KAAK,OAAS,IAAI+M,GAElBF,EAAY,iBAAiB,KAAK,KAAM,KAAK,MAAM,EAG/C7jB,EAAI,aAEF,OAAOA,EAAI,YAAe,SAC5BA,EAAI,WAAayZ,GAAQ,WAAWzZ,EAAI,UAAU,EACzCgkB,GAAS,KAAKhkB,EAAI,UAAU,IAAM,yBAC3CA,EAAI,WAAa,IAAI,WAAWA,EAAI,UAAU,GAE5CA,EAAI,MACNgX,EAAS6M,EAAY,qBAAqB,KAAK,KAAM7jB,EAAI,UAAU,EAC/DgX,IAAWmN,KACb,MAAM,IAAI,MAAM9U,GAAS2H,CAAM,CAAC,CAIxC,CA2BAyN,GAAU,UAAU,KAAO,SAAU/wB,EAAM8mB,EAAY,CACrD,MAAMhI,EAAO,KAAK,KACZiI,EAAY,KAAK,QAAQ,UACzBvD,EAAa,KAAK,QAAQ,WAChC,IAAIF,EAAQ0D,EAAagK,EAEzB,GAAI,KAAK,MAAO,MAAO,GAevB,IAbIlK,IAAe,CAAC,CAACA,EAAYE,EAAcF,EAC1CE,EAAcF,IAAe,GAAO0J,GAAWD,GAGhDD,GAAS,KAAKtwB,CAAI,IAAM,uBAC1B8e,EAAK,MAAQ,IAAI,WAAW9e,CAAI,EAEhC8e,EAAK,MAAQ9e,EAGf8e,EAAK,QAAU,EACfA,EAAK,SAAWA,EAAK,MAAM,SAElB,CAqBP,IApBIA,EAAK,YAAc,IACrBA,EAAK,OAAS,IAAI,WAAWiI,CAAS,EACtCjI,EAAK,SAAW,EAChBA,EAAK,UAAYiI,GAGnBzD,EAAS6M,EAAY,QAAQrR,EAAMkI,CAAW,EAE1C1D,IAAWqN,IAAenN,IAC5BF,EAAS6M,EAAY,qBAAqBrR,EAAM0E,CAAU,EAEtDF,IAAWmN,GACbnN,EAAS6M,EAAY,QAAQrR,EAAMkI,CAAW,EACrC1D,IAAWuN,KAEpBvN,EAASqN,KAKN7R,EAAK,SAAW,GAChBwE,IAAWoN,IACX5R,EAAK,MAAM,KAAO,GAClB9e,EAAK8e,EAAK,OAAO,IAAM,GAE5BqR,EAAY,aAAarR,CAAI,EAC7BwE,EAAS6M,EAAY,QAAQrR,EAAMkI,CAAW,EAGhD,OAAQ1D,EAAM,CACZ,KAAKsN,GACL,KAAKC,GACL,KAAKF,GACL,KAAKG,GACH,YAAK,MAAMxN,CAAM,EACjB,KAAK,MAAQ,GACN,EACV,CAMD,GAFA0N,EAAiBlS,EAAK,UAElBA,EAAK,WACHA,EAAK,YAAc,GAAKwE,IAAWoN,IAErC,GAAI,KAAK,QAAQ,KAAO,SAAU,CAEhC,IAAIO,EAAgBlL,GAAQ,WAAWjH,EAAK,OAAQA,EAAK,QAAQ,EAE7DoS,EAAOpS,EAAK,SAAWmS,EACvBE,EAAUpL,GAAQ,WAAWjH,EAAK,OAAQmS,CAAa,EAG3DnS,EAAK,SAAWoS,EAChBpS,EAAK,UAAYiI,EAAYmK,EACzBA,GAAMpS,EAAK,OAAO,IAAIA,EAAK,OAAO,SAASmS,EAAeA,EAAgBC,CAAI,EAAG,CAAC,EAEtF,KAAK,OAAOC,CAAO,CAE7B,MACU,KAAK,OAAOrS,EAAK,OAAO,SAAWA,EAAK,SAAWA,EAAK,OAASA,EAAK,OAAO,SAAS,EAAGA,EAAK,QAAQ,CAAC,EAM7G,GAAI,EAAAwE,IAAWmN,IAAQO,IAAmB,GAG1C,IAAI1N,IAAWoN,GACb,OAAApN,EAAS6M,EAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAM7M,CAAM,EACjB,KAAK,MAAQ,GACN,GAGT,GAAIxE,EAAK,WAAa,EAAG,MAC1B,CAED,MAAO,EACT,EAWAiS,GAAU,UAAU,OAAS,SAAUhM,EAAO,CAC5C,KAAK,OAAO,KAAKA,CAAK,CACxB,EAYAgM,GAAU,UAAU,MAAQ,SAAUzN,EAAQ,CAExCA,IAAWmN,KACT,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAS,KAAK,OAAO,KAAK,EAAE,EAEjC,KAAK,OAASzL,GAAO,cAAc,KAAK,MAAM,GAGlD,KAAK,OAAS,GACd,KAAK,IAAM1B,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EA0CA,SAAS8N,GAAUvN,EAAO1oB,EAAS,CACjC,MAAMk2B,EAAW,IAAIN,GAAU51B,CAAO,EAKtC,GAHAk2B,EAAS,KAAKxN,CAAK,EAGfwN,EAAS,IAAK,MAAMA,EAAS,KAAO1V,GAAS0V,EAAS,GAAG,EAE7D,OAAOA,EAAS,MAClB,CAWA,SAASC,GAAazN,EAAO1oB,EAAS,CACpC,OAAAA,EAAUA,GAAW,GACrBA,EAAQ,IAAM,GACPi2B,GAAUvN,EAAO1oB,CAAO,CACjC,CAaA,IAAIo2B,GAAcR,GACdS,GAAYJ,GACZK,GAAiBH,GACjBI,GAAWN,GACXO,GAAY/V,GAEZgW,GAAc,CACjB,QAASL,GACT,QAASC,GACT,WAAYC,GACZ,OAAQC,GACR,UAAWC,EACZ,EAEA,KAAM,CAAE,QAAAE,GAAS,QAAAC,GAAS,WAAAC,GAAY,KAAAC,EAAI,EAAKtK,GAEzC,CAAE,QAAAuK,GAAS,QAAAC,GAAS,WAAAC,GAAY,OAAAC,EAAM,EAAKR,GAIjD,IAAIS,GAAYR,GACZS,GAAYR,GACZS,GAAeR,GACfS,GAASR,GACTS,GAAYR,GACZS,GAAYR,GACZS,GAAeR,GACfS,GAAWR,GACXS,GAAcjX,GAEdkX,GAAO,CACV,QAAST,GACT,QAASC,GACT,WAAYC,GACZ,KAAMC,GACN,QAASC,GACT,QAASC,GACT,WAAYC,GACZ,OAAQC,GACR,UAAWC,EACZ,ECvtNA,MAAME,EAAO,CAAA,EAEbA,EAAK,QAAU,SAAU9oB,EAAK,CAC5B,MAAMmN,EAAInN,EAAI,MACR+N,EAAI/N,EAAI,OACd,GAAIA,EAAI,KAAK,OAAS,KACpB,MAAO,CAAC8oB,EAAK,QAAQ,YAAY9oB,EAAI,KAAMmN,EAAGY,EAAG/N,CAAG,EAAE,MAAM,EAE9D,MAAM+oB,EAAO,CAAA,EACT/oB,EAAI,OAAO,CAAC,EAAE,OAAS,OAAMA,EAAI,OAAO,CAAC,EAAE,KAAOA,EAAI,MAC1D,MAAM2B,EAAMwL,EAAIY,EAAI,EACdib,EAAM,IAAI,WAAWrnB,CAAG,EACxBsnB,EAAQ,IAAI,WAAWtnB,CAAG,EAC1BmB,EAAO,IAAI,WAAWnB,CAAG,EAC/B,QAAS5E,EAAI,EAAGA,EAAIiD,EAAI,OAAO,OAAQjD,IAAK,CAC1C,MAAMmsB,EAAMlpB,EAAI,OAAOjD,CAAC,EAClBosB,EAAKD,EAAI,KAAK,EACdE,EAAKF,EAAI,KAAK,EACdG,EAAKH,EAAI,KAAK,MACdI,EAAKJ,EAAI,KAAK,OACdK,EAAQT,EAAK,QAAQ,YAAYI,EAAI,KAAMG,EAAIC,EAAItpB,CAAG,EAE5D,GAAIjD,IAAM,EAAG,QAASkH,EAAI,EAAGA,EAAItC,EAAKsC,IAAKnB,EAAKmB,CAAC,EAAI+kB,EAAI/kB,CAAC,EAQ1D,GANIilB,EAAI,QAAU,EAAGJ,EAAK,UAAUS,EAAOF,EAAIC,EAAIN,EAAK7b,EAAGY,EAAGob,EAAIC,EAAI,CAAC,EAC9DF,EAAI,QAAU,GACrBJ,EAAK,UAAUS,EAAOF,EAAIC,EAAIN,EAAK7b,EAAGY,EAAGob,EAAIC,EAAI,CAAC,EAEpDL,EAAK,KAAKC,EAAI,OAAO,MAAM,CAAC,CAAC,EAEzBE,EAAI,UAAY,EAAGJ,EAAK,UAAUG,EAAOI,EAAIC,EAAIN,EAAK7b,EAAGY,EAAGob,EAAIC,EAAI,CAAC,UAChEF,EAAI,UAAY,EAAG,QAASjlB,EAAI,EAAGA,EAAItC,EAAKsC,IAAK+kB,EAAI/kB,CAAC,EAAInB,EAAKmB,CAAC,CAC1E,CACD,OAAO8kB,CACT,EACAD,EAAK,QAAQ,YAAc,SAAU/yB,EAAMoX,EAAGY,EAAG/N,EAAK,CACpD,MAAMwpB,EAAOrc,EAAIY,EACX0b,EAAMX,EAAK,OAAO,QAAQ9oB,CAAG,EAC7B0pB,EAAM,KAAK,KAAMvc,EAAIsc,EAAO,CAAC,EAE7BE,EAAK,IAAI,WAAWH,EAAO,CAAC,EAC5BI,EAAO,IAAI,YAAYD,EAAG,MAAM,EAChCE,EAAQ7pB,EAAI,MACZyO,EAAQzO,EAAI,MACZ8pB,EAAKhB,EAAK,KAAK,WAErB,GAAIe,IAAU,EAAG,CAEf,MAAME,EAAQP,GAAQ,EACtB,GAAI/a,IAAU,EACZ,QAAS1R,EAAI,EAAGA,EAAIgtB,EAAOhtB,GAAK,EAC9B4sB,EAAG5sB,CAAC,EAAIhH,EAAKgH,CAAC,EACd4sB,EAAG5sB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EACtB4sB,EAAG5sB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EACtB4sB,EAAG5sB,EAAI,CAAC,EAAIhH,EAAKgH,EAAI,CAAC,EAE1B,GAAI0R,IAAU,GACZ,QAAS1R,EAAI,EAAGA,EAAIgtB,EAAOhtB,IACzB4sB,EAAG5sB,CAAC,EAAIhH,EAAKgH,GAAK,CAAC,CAE3B,SAAa8sB,IAAU,EAAG,CAEtB,MAAMG,EAAKhqB,EAAI,KAAK,KACpB,GAAIgqB,IAAO,KAAM,CACf,GAAIvb,IAAU,EACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMktB,EAAKltB,EAAI,EACf6sB,EAAK7sB,CAAC,EACH,UAAchH,EAAKk0B,EAAK,CAAC,GAAK,GAAOl0B,EAAKk0B,EAAK,CAAC,GAAK,EAAKl0B,EAAKk0B,CAAE,CACrE,CACH,GAAIxb,IAAU,GACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMktB,EAAKltB,EAAI,EACf6sB,EAAK7sB,CAAC,EACH,UAAchH,EAAKk0B,EAAK,CAAC,GAAK,GAAOl0B,EAAKk0B,EAAK,CAAC,GAAK,EAAKl0B,EAAKk0B,CAAE,CACrE,CACT,KAAW,CACL,MAAMC,EAAKF,EAAG,CAAC,EACTG,EAAKH,EAAG,CAAC,EACTI,EAAKJ,EAAG,CAAC,EACf,GAAIvb,IAAU,EACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMstB,EAAKttB,GAAK,EACVktB,EAAKltB,EAAI,EACf6sB,EAAK7sB,CAAC,EACH,UAAchH,EAAKk0B,EAAK,CAAC,GAAK,GAAOl0B,EAAKk0B,EAAK,CAAC,GAAK,EAAKl0B,EAAKk0B,CAAE,EAChEl0B,EAAKk0B,CAAE,IAAMC,GAAMn0B,EAAKk0B,EAAK,CAAC,IAAME,GAAMp0B,EAAKk0B,EAAK,CAAC,IAAMG,IAC7DT,EAAGU,EAAK,CAAC,EAAI,EAChB,CACH,GAAI5b,IAAU,GACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMstB,EAAKttB,GAAK,EACVktB,EAAKltB,EAAI,EACf6sB,EAAK7sB,CAAC,EACH,UAAchH,EAAKk0B,EAAK,CAAC,GAAK,GAAOl0B,EAAKk0B,EAAK,CAAC,GAAK,EAAKl0B,EAAKk0B,CAAE,EAElEH,EAAG/zB,EAAMk0B,CAAE,IAAMC,GACjBJ,EAAG/zB,EAAMk0B,EAAK,CAAC,IAAME,GACrBL,EAAG/zB,EAAMk0B,EAAK,CAAC,IAAMG,IAErBT,EAAGU,EAAK,CAAC,EAAI,EAChB,CACJ,CACL,SAAaR,IAAU,EAAG,CAEtB,MAAMpvB,EAAIuF,EAAI,KAAK,KACbsqB,EAAKtqB,EAAI,KAAK,KACd6D,EAAKymB,EAAKA,EAAG,OAAS,EAC5B,GAAI7b,IAAU,EACZ,QAAS8b,EAAI,EAAGA,EAAIxc,EAAGwc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIpd,EACf,QAASpQ,EAAI,EAAGA,EAAIoQ,EAAGpQ,IAAK,CAC1B,MAAMstB,EAAMI,EAAK1tB,GAAM,EACjBkH,EAAKlO,EAAKy0B,GAAMztB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,EACpD2tB,EAAK,EAAIzmB,EACf0lB,EAAGU,CAAE,EAAI5vB,EAAEiwB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIpmB,EAAIJ,EAAKymB,EAAGrmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIwK,IAAU,EACZ,QAAS8b,EAAI,EAAGA,EAAIxc,EAAGwc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIpd,EACf,QAASpQ,EAAI,EAAGA,EAAIoQ,EAAGpQ,IAAK,CAC1B,MAAMstB,EAAMI,EAAK1tB,GAAM,EACjBkH,EAAKlO,EAAKy0B,GAAMztB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,EACpD2tB,EAAK,EAAIzmB,EACf0lB,EAAGU,CAAE,EAAI5vB,EAAEiwB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIpmB,EAAIJ,EAAKymB,EAAGrmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIwK,IAAU,EACZ,QAAS8b,EAAI,EAAGA,EAAIxc,EAAGwc,IAAK,CAC1B,MAAMC,EAAKD,EAAIb,EACTe,EAAKF,EAAIpd,EACf,QAASpQ,EAAI,EAAGA,EAAIoQ,EAAGpQ,IAAK,CAC1B,MAAMstB,EAAMI,EAAK1tB,GAAM,EACjBkH,EAAKlO,EAAKy0B,GAAMztB,GAAK,EAAE,GAAM,IAAMA,EAAI,IAAM,GAAO,GACpD2tB,EAAK,EAAIzmB,EACf0lB,EAAGU,CAAE,EAAI5vB,EAAEiwB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIpmB,EAAIJ,EAAKymB,EAAGrmB,CAAC,EAAI,GAC/B,CACF,CACH,GAAIwK,IAAU,EACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMstB,EAAKttB,GAAK,EACVkH,EAAIlO,EAAKgH,CAAC,EACV2tB,EAAK,EAAIzmB,EACf0lB,EAAGU,CAAE,EAAI5vB,EAAEiwB,CAAE,EACbf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAI5vB,EAAEiwB,EAAK,CAAC,EACrBf,EAAGU,EAAK,CAAC,EAAIpmB,EAAIJ,EAAKymB,EAAGrmB,CAAC,EAAI,GAC/B,CACP,SAAa4lB,IAAU,EAAG,CAEtB,GAAIpb,IAAU,EACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMstB,EAAKttB,GAAK,EACV4tB,EAAK5tB,GAAK,EACV6tB,EAAK70B,EAAK40B,CAAE,EAClBhB,EAAGU,CAAE,EAAIO,EACTjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIt0B,EAAK40B,EAAK,CAAC,CACzB,CACH,GAAIlc,IAAU,GACZ,QAAS1R,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMstB,EAAKttB,GAAK,EACV4tB,EAAK5tB,GAAK,EACV6tB,EAAK70B,EAAK40B,CAAE,EAClBhB,EAAGU,CAAE,EAAIO,EACTjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIO,EACbjB,EAAGU,EAAK,CAAC,EAAIt0B,EAAK40B,EAAK,CAAC,CACzB,CACP,SAAad,IAAU,EAAG,CAEtB,MAAMK,EAAKlqB,EAAI,KAAK,KAAOA,EAAI,KAAK,KAAO,GAC3C,QAASuqB,EAAI,EAAGA,EAAIxc,EAAGwc,IAAK,CAC1B,MAAM1pB,EAAM0pB,EAAIb,EACVmB,EAAKN,EAAIpd,EACf,GAAIsB,IAAU,EACZ,QAAS3E,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM8gB,EAAK,KAAQ70B,EAAK8K,GAAOiJ,IAAM,EAAE,IAAO,GAAKA,EAAI,GAAO,GACxDghB,EAAKF,IAAOV,EAAK,IAAM,EAAI,IACjCN,EAAKiB,EAAK/gB,CAAC,EAAKghB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMnc,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM8gB,EACJ,IAAO70B,EAAK8K,GAAOiJ,IAAM,EAAE,IAAO,IAAMA,EAAI,IAAM,GAAO,GACrDghB,EAAKF,IAAOV,EAAK,GAAK,EAAI,IAChCN,EAAKiB,EAAK/gB,CAAC,EAAKghB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMnc,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM8gB,EACJ,IAAO70B,EAAK8K,GAAOiJ,IAAM,EAAE,IAAO,IAAMA,EAAI,IAAM,GAAO,IACrDghB,EAAKF,IAAOV,EAAK,GAAK,EAAI,IAChCN,EAAKiB,EAAK/gB,CAAC,EAAKghB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMnc,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM8gB,EAAK70B,EAAK8K,EAAMiJ,CAAC,EACjBghB,EAAKF,IAAOV,EAAK,EAAI,IAC3BN,EAAKiB,EAAK/gB,CAAC,EAAKghB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,SACMnc,IAAU,GACjB,QAAS3E,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM8gB,EAAK70B,EAAK8K,GAAOiJ,GAAK,EAAE,EACxBghB,EAAKhB,EAAG/zB,EAAM8K,GAAOiJ,GAAK,EAAE,IAAMogB,EAAK,EAAI,IACjDN,EAAKiB,EAAK/gB,CAAC,EAAKghB,GAAM,GAAOF,GAAM,GAAOA,GAAM,EAAKA,CACtD,CACJ,CACF,CACD,OAAOjB,CACT,EAEAb,EAAK,OAAS,SAAU/mB,EAAM,CAC5B,MAAMhM,EAAO,IAAI,WAAWgM,CAAI,EAChC,IAAIgpB,EAAS,EACb,MAAMC,EAAMlC,EAAK,KACXjpB,EAAMmrB,EAAI,WACVlrB,EAAMkrB,EAAI,SACVhrB,EAAM,CAAE,KAAM,CAAE,EAAE,OAAQ,CAAE,CAAA,EAC5BirB,EAAK,IAAI,WAAWl1B,EAAK,MAAM,EACrC,IAAIm1B,EAAO,EACPC,EACAC,EAAO,EAEX,MAAMC,EAAO,CAAC,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAI,EAC5D,QAAStuB,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAIhH,EAAKgH,CAAC,IAAMsuB,EAAKtuB,CAAC,EAAG,KAAM,+BAEjC,KAAOguB,EAASh1B,EAAK,QAAQ,CAC3B,MAAM4L,EAAMqpB,EAAI,SAASj1B,EAAMg1B,CAAM,EACrCA,GAAU,EACV,MAAMjtB,EAAOktB,EAAI,UAAUj1B,EAAMg1B,EAAQ,CAAC,EAG1C,GAFAA,GAAU,EAENjtB,IAAS,OACXgrB,EAAK,OAAO,MAAM/yB,EAAMg1B,EAAQ/qB,CAAG,UAC1BlC,IAAS,OAClBkC,EAAI,KAAKlC,CAAI,EAAI/H,EAAK,MAAMg1B,EAAQA,EAAS,CAAC,UACrCjtB,IAAS,OAAQ,CAC1B,QAASf,EAAI,EAAGA,EAAI4E,EAAK5E,IAAKkuB,EAAGC,EAAOnuB,CAAC,EAAIhH,EAAKg1B,EAAShuB,CAAC,EAC5DmuB,GAAQvpB,CACd,SAAe7D,IAAS,OAClBkC,EAAI,KAAKlC,CAAI,EAAI,CACf,WAAYgC,EAAI/J,EAAMg1B,CAAM,EAC5B,UAAWjrB,EAAI/J,EAAMg1B,EAAS,CAAC,CACvC,EACMI,EAAK,IAAI,WAAWp1B,EAAK,MAAM,UACtB+H,IAAS,OAAQ,CAC1B,GAAIstB,IAAS,EAAG,CACd,MAAME,EAAKtrB,EAAI,OAAOA,EAAI,OAAO,OAAS,CAAC,EAC3CsrB,EAAG,KAAOxC,EAAK,OAAO,YACpB9oB,EACAmrB,EAAG,MAAM,EAAGC,CAAI,EAChBE,EAAG,KAAK,MACRA,EAAG,KAAK,MAClB,EACQF,EAAO,CACR,CACD,MAAMG,EAAM,CACV,EAAGzrB,EAAI/J,EAAMg1B,EAAS,EAAE,EACxB,EAAGjrB,EAAI/J,EAAMg1B,EAAS,EAAE,EACxB,MAAOjrB,EAAI/J,EAAMg1B,EAAS,CAAC,EAC3B,OAAQjrB,EAAI/J,EAAMg1B,EAAS,CAAC,CACpC,EACM,IAAIS,EAAM3rB,EAAI9J,EAAMg1B,EAAS,EAAE,EAC/BS,EAAM3rB,EAAI9J,EAAMg1B,EAAS,EAAE,GAAKS,IAAQ,EAAI,IAAMA,GAClD,MAAMtC,EAAM,CACV,KAAMqC,EACN,MAAO,KAAK,MAAMC,EAAM,GAAI,EAC5B,QAASz1B,EAAKg1B,EAAS,EAAE,EACzB,MAAOh1B,EAAKg1B,EAAS,EAAE,CAC/B,EACM/qB,EAAI,OAAO,KAAKkpB,CAAG,CACzB,SAAeprB,IAAS,OAAQ,CAC1B,QAASf,EAAI,EAAGA,EAAI4E,EAAM,EAAG5E,IAAKouB,EAAGC,EAAOruB,CAAC,EAAIhH,EAAKg1B,EAAShuB,EAAI,CAAC,EACpEquB,GAAQzpB,EAAM,CACpB,SAAe7D,IAAS,OAClBkC,EAAI,KAAKlC,CAAI,EAAI,CACfktB,EAAI,SAASj1B,EAAMg1B,CAAM,EACzBC,EAAI,SAASj1B,EAAMg1B,EAAS,CAAC,EAC7Bh1B,EAAKg1B,EAAS,CAAC,CACvB,UACejtB,IAAS,OAAQ,CAC1BkC,EAAI,KAAKlC,CAAI,EAAI,GACjB,QAASf,EAAI,EAAGA,EAAI,EAAGA,IACrBiD,EAAI,KAAKlC,CAAI,EAAE,KAAKktB,EAAI,SAASj1B,EAAMg1B,EAAShuB,EAAI,CAAC,CAAC,CACzD,SAAUe,IAAS,QAAUA,IAAS,OAAQ,CACzCkC,EAAI,KAAKlC,CAAI,IAAM,OAAMkC,EAAI,KAAKlC,CAAI,EAAI,IAC9C,MAAM2tB,EAAKT,EAAI,SAASj1B,EAAMg1B,CAAM,EAC9BW,EAAOV,EAAI,UAAUj1B,EAAMg1B,EAAQU,EAAKV,CAAM,EACpD,IAAIvvB,EACJ,MAAMqI,EAAKknB,EAASppB,EAAM8pB,EAAK,EAC/B,GAAI3tB,IAAS,OAAQtC,EAAOwvB,EAAI,UAAUj1B,EAAM01B,EAAK,EAAG5nB,CAAE,MACrD,CACH,MAAM8nB,EAAM7C,EAAK,OAAO,SAAS/yB,EAAK,MAAM01B,EAAK,EAAGA,EAAK,EAAI5nB,CAAE,CAAC,EAChErI,EAAOwvB,EAAI,SAASW,EAAK,EAAGA,EAAI,MAAM,CACvC,CACD3rB,EAAI,KAAKlC,CAAI,EAAE4tB,CAAI,EAAIlwB,CAC7B,SAAesC,IAAS,OAAQ,CACtBkC,EAAI,KAAKlC,CAAI,GAAK,OAAMkC,EAAI,KAAKlC,CAAI,EAAI,IAC7C,IAAI2tB,EAAK,EACL5qB,EAAMkqB,EACVU,EAAKT,EAAI,SAASj1B,EAAM8K,CAAG,EAC3B,MAAM6qB,EAAOV,EAAI,UAAUj1B,EAAM8K,EAAK4qB,EAAK5qB,CAAG,EAC9CA,EAAM4qB,EAAK,EACX,MAAMG,EAAQ71B,EAAK8K,CAAG,EAEtBA,GAAO,EACP4qB,EAAKT,EAAI,SAASj1B,EAAM8K,CAAG,EAE3BA,EAAM4qB,EAAK,EACXA,EAAKT,EAAI,SAASj1B,EAAM8K,CAAG,EAE3BA,EAAM4qB,EAAK,EACX,IAAIjwB,EACJ,MAAMqI,EAAKlC,GAAOd,EAAMkqB,GACxB,GAAIa,IAAU,EAAGpwB,EAAOwvB,EAAI,SAASj1B,EAAM8K,EAAKgD,CAAE,MAC7C,CACH,MAAM8nB,EAAM7C,EAAK,OAAO,SAAS/yB,EAAK,MAAM8K,EAAKA,EAAMgD,CAAE,CAAC,EAC1DrI,EAAOwvB,EAAI,SAASW,EAAK,EAAGA,EAAI,MAAM,CACvC,CACD3rB,EAAI,KAAKlC,CAAI,EAAE4tB,CAAI,EAAIlwB,CAC7B,SAAesC,IAAS,OAClBkC,EAAI,KAAKlC,CAAI,EAAIktB,EAAI,UAAUj1B,EAAMg1B,EAAQppB,CAAG,UACvC7D,IAAS,OAAQ,CAC1B,MAAM+tB,EAAK7rB,EAAI,KAAK,KAAK,OAAS,EAClCA,EAAI,KAAKlC,CAAI,EAAI,GACjB,QAASf,EAAI,EAAGA,EAAI8uB,EAAI9uB,IACtBiD,EAAI,KAAKlC,CAAI,EAAE,KAAK+B,EAAI9J,EAAMg1B,EAAShuB,EAAI,CAAC,CAAC,CACrD,SAAee,IAAS,OACdkC,EAAI,QAAU,EAAGA,EAAI,KAAKlC,CAAI,EAAIktB,EAAI,UAAUj1B,EAAMg1B,EAAQppB,CAAG,EAC5D3B,EAAI,QAAU,EAAGA,EAAI,KAAKlC,CAAI,EAAI+B,EAAI9J,EAAMg1B,CAAM,EAClD/qB,EAAI,QAAU,IACrBA,EAAI,KAAKlC,CAAI,EAAI,CACf+B,EAAI9J,EAAMg1B,CAAM,EAChBlrB,EAAI9J,EAAMg1B,EAAS,CAAC,EACpBlrB,EAAI9J,EAAMg1B,EAAS,CAAC,CAC9B,WACejtB,IAAS,OAClBkC,EAAI,KAAKlC,CAAI,EAAIktB,EAAI,SAASj1B,EAAMg1B,CAAM,EAAI,YACvCjtB,IAAS,OAAQkC,EAAI,KAAKlC,CAAI,EAAI/H,EAAKg1B,CAAM,UAC7CjtB,IAAS,OACZkC,EAAI,QAAU,GAAKA,EAAI,QAAU,EACnCA,EAAI,KAAKlC,CAAI,EAAI,CAAC+B,EAAI9J,EAAMg1B,CAAM,CAAC,EAC5B/qB,EAAI,QAAU,GAAKA,EAAI,QAAU,EACxCA,EAAI,KAAKlC,CAAI,EAAI,CACf+B,EAAI9J,EAAMg1B,CAAM,EAChBlrB,EAAI9J,EAAMg1B,EAAS,CAAC,EACpBlrB,EAAI9J,EAAMg1B,EAAS,CAAC,CAC9B,EACe/qB,EAAI,QAAU,IAAGA,EAAI,KAAKlC,CAAI,EAAI/H,EAAKg1B,CAAM,WAC7CjtB,IAAS,OAClB,MAEFitB,GAAUppB,EAEVopB,GAAU,CACX,CACD,GAAIK,IAAS,EAAG,CACd,MAAME,EAAKtrB,EAAI,OAAOA,EAAI,OAAO,OAAS,CAAC,EAC3CsrB,EAAG,KAAOxC,EAAK,OAAO,YACpB9oB,EACAmrB,EAAG,MAAM,EAAGC,CAAI,EAChBE,EAAG,KAAK,MACRA,EAAG,KAAK,MACd,EACIF,EAAO,CACR,CACD,OAAAprB,EAAI,KAAO8oB,EAAK,OAAO,YAAY9oB,EAAKirB,EAAIjrB,EAAI,MAAOA,EAAI,MAAM,EAEjE,OAAOA,EAAI,SACX,OAAOA,EAAI,UACX,OAAOA,EAAI,OACJA,CACT,EAEA8oB,EAAK,OAAO,YAAc,SAAU9oB,EAAKirB,EAAI9d,EAAGY,EAAG,CACjD,MAAM0b,EAAMX,EAAK,OAAO,QAAQ9oB,CAAG,EAC7B0pB,EAAM,KAAK,KAAMvc,EAAIsc,EAAO,CAAC,EAC7B1nB,EAAO,IAAI,YAAY2nB,EAAM,EAAI1pB,EAAI,WAAa+N,CAAC,EACzD,OAAI/N,EAAI,KAAK,KAAMirB,EAAKnC,EAAK,WAAWmC,EAAIlpB,CAAI,EAC3CkpB,EAAKnC,EAAK,OAAO,SAASmC,EAAIlpB,CAAI,EAEnC/B,EAAI,YAAc,EAAGirB,EAAKnC,EAAK,OAAO,YAAYmC,EAAIjrB,EAAK,EAAGmN,EAAGY,CAAC,EAC7D/N,EAAI,YAAc,IAAGirB,EAAKnC,EAAK,OAAO,eAAemC,EAAIjrB,CAAG,GAC9DirB,CACT,EAEAnC,EAAK,OAAO,SAAW,SAAU/yB,EAAMgM,EAAM,CAK3C,OAJY+mB,EAAK,WACf,IAAI,WAAW/yB,EAAK,OAAQ,EAAGA,EAAK,OAAS,CAAC,EAC9CgM,CACJ,CAEA,EACA+mB,EAAK,WAAc,UAAY,CAC7B,MAAMgD,EAAI,CAAA,EACV,OAAAA,EAAE,EAAI,GACNA,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAI,WACV,IAAIlvB,EAAI,EACJiR,EAAI,EACJke,EAAI,EACJne,EAAI,EACJoe,EAAI,EACJC,EAAI,EACJC,EAAI,EACJlf,EAAI,EACJ,EAAI,EACJhY,EACAm3B,EACJ,GAAIP,EAAE,CAAC,IAAM,GAAKA,EAAE,CAAC,IAAM,EACzB,OAAOC,GAAK,IAAIC,EAAE,CAAC,EAErB,MAAMM,EAAIT,EAAE,EACNpqB,EAAI6qB,EAAE,EACNC,EAAID,EAAE,EACNvvB,EAAIuvB,EAAE,EACNE,EAAIF,EAAE,EACNG,EAAIH,EAAE,EACN36B,EAAI26B,EAAE,EACN3qB,EAAI2qB,EAAE,EACNI,EAAIX,IAAM,KAEhB,IADIW,IAAGX,EAAI,IAAIC,EAAGF,EAAE,SAAW,GAAM,CAAC,GAC/BhvB,IAAM,GAAG,CAId,GAHAA,EAAI2E,EAAEqqB,EAAG,EAAG,CAAC,EACb/d,EAAItM,EAAEqqB,EAAG,EAAI,EAAG,CAAC,EACjB,GAAK,EACD/d,IAAM,EAAG,CACN,EAAI,IAAU,GAAK,GAAK,EAAI,IACjC,MAAM4e,GAAK,IAAM,GAAK,EAChB1R,EAAI6Q,EAAEa,EAAI,CAAC,EAAKb,EAAEa,EAAI,CAAC,GAAK,EAC9BD,IAAGX,EAAIF,EAAE,EAAE,EAAEE,EAAG7e,EAAI+N,CAAC,GACzB8Q,EAAE,IAAI,IAAIC,EAAEF,EAAE,OAAQA,EAAE,WAAaa,EAAG1R,CAAC,EAAG/N,CAAC,EAC7C,EAAKyf,EAAI1R,GAAM,EACf/N,GAAK+N,EACL,QACD,CAQD,GAPIyR,IAAGX,EAAIF,EAAE,EAAE,EAAEE,EAAG7e,EAAK,MAAQ,GAC7Ba,IAAM,IACR7Y,EAAIyM,EAAE,EACN0qB,EAAI1qB,EAAE,EACNwqB,EAAK,IACLC,EAAK,IAEHre,IAAM,EAAG,CACXke,EAAIM,EAAET,EAAG,EAAG,CAAC,EAAI,IACjBhe,EAAIye,EAAET,EAAG,EAAI,EAAG,CAAC,EAAI,EACrBI,EAAIK,EAAET,EAAG,EAAI,GAAI,CAAC,EAAI,EACtB,GAAK,GAEL,IAAI9nB,EAAI,EACR,QAASnP,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3B8M,EAAE,EAAE9M,CAAC,EAAI,EACT8M,EAAE,EAAE9M,EAAI,CAAC,EAAI,EAEf,QAASA,EAAI,EAAGA,EAAIq3B,EAAGr3B,IAAK,CAC1B,MAAM+3B,EAAIL,EAAET,EAAG,EAAIj3B,EAAI,EAAG,CAAC,EAC3B8M,EAAE,GAAGA,EAAE,EAAE9M,CAAC,GAAK,GAAK,CAAC,EAAI+3B,EACrBA,EAAI5oB,IAAGA,EAAI4oB,EAChB,CACD,GAAK,EAAIV,EACTM,EAAE7qB,EAAE,EAAGqC,CAAC,EACRyoB,EAAE9qB,EAAE,EAAGqC,EAAGrC,EAAE,CAAC,EACbzM,EAAIyM,EAAE,EACN0qB,EAAI1qB,EAAE,EACN,EAAI5E,EAAE4E,EAAE,GAAI,GAAKqC,GAAK,EAAGioB,EAAIne,EAAGge,EAAG,EAAGnqB,EAAE,CAAC,EACzC,MAAMkrB,EAAIP,EAAE,EAAE3qB,EAAE,EAAG,EAAGsqB,EAAGtqB,EAAE,CAAC,EAC5BwqB,GAAK,GAAKU,GAAK,EACf,MAAMC,EAAIR,EAAE,EAAE3qB,EAAE,EAAGsqB,EAAGne,EAAGnM,EAAE,CAAC,EAC5ByqB,GAAK,GAAKU,GAAK,EACfN,EAAE7qB,EAAE,EAAGkrB,CAAC,EACRJ,EAAE9qB,EAAE,EAAGkrB,EAAG33B,CAAC,EACXs3B,EAAE7qB,EAAE,EAAGmrB,CAAC,EACRL,EAAE9qB,EAAE,EAAGmrB,EAAGT,CAAC,CACZ,CAED,OAAW,CACT,MAAM,EAAIn3B,EAAEvD,EAAEm6B,EAAG,CAAC,EAAIK,CAAC,EACvB,GAAK,EAAI,GACT,MAAM3xB,EAAI,IAAM,EAChB,GAAI,EAAAA,IAAM,GACRuxB,EAAE7e,GAAG,EAAI1S,MACJ,IAAIA,IAAM,IACf,MACK,CACL,IAAIuyB,EAAI7f,EAAI1S,EAAI,IAChB,GAAIA,EAAI,IAAK,CACX,MAAMwyB,EAAIrrB,EAAE,EAAEnH,EAAI,GAAG,EACrBuyB,EAAI7f,GAAK8f,IAAM,GAAKT,EAAET,EAAG,EAAGkB,EAAI,CAAC,EACjC,GAAKA,EAAI,CACV,CACD,MAAMC,EAAIZ,EAAE16B,EAAEm6B,EAAG,CAAC,EAAIM,CAAC,EACvB,GAAKa,EAAI,GACT,MAAM/vB,EAAI+vB,IAAM,EACVC,EAAIvrB,EAAE,EAAEzE,CAAC,EACTyI,GAAKunB,IAAM,GAAKzrB,EAAEqqB,EAAG,EAAGoB,EAAI,EAAE,EAEpC,IADA,GAAKA,EAAI,GACFhgB,EAAI6f,GACThB,EAAE7e,CAAC,EAAI6e,EAAE7e,IAAMvH,CAAC,EAChBomB,EAAE7e,CAAC,EAAI6e,EAAE7e,IAAMvH,CAAC,EAChBomB,EAAE7e,CAAC,EAAI6e,EAAE7e,IAAMvH,CAAC,EAChBomB,EAAE7e,CAAC,EAAI6e,EAAE7e,IAAMvH,CAAC,EAElBuH,EAAI6f,CACL,EACF,CACF,CACD,OAAOhB,EAAE,SAAW7e,EAAI6e,EAAIA,EAAE,MAAM,EAAG7e,CAAC,CAC5C,EACE2e,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIF,EAAE,OACZ,GAAIC,GAAKC,EAAG,OAAOF,EACnB,MAAMQ,EAAI,IAAI,WAAWN,GAAK,CAAC,EAC/B,OAAAM,EAAE,IAAIR,EAAG,CAAC,EACHQ,CACX,EACET,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAGM,EAAG7qB,EAAG8qB,EAAG,CAClC,MAAMxvB,EAAI8uB,EAAE,EAAE,EACRW,EAAIX,EAAE,EAAE,EACd,IAAIY,EAAI,EACR,KAAOA,EAAIT,GAAG,CACZ,MAAMr6B,EAAIm6B,EAAEU,EAAEF,EAAG7qB,CAAC,EAAIsqB,CAAC,EACvBtqB,GAAK9P,EAAI,GACT,MAAMgQ,EAAIhQ,IAAM,EAChB,GAAIgQ,GAAK,GACP4qB,EAAEE,CAAC,EAAI9qB,EACP8qB,QACK,CACL,IAAIC,EAAI,EACJ3e,EAAI,EACJpM,IAAM,IACRoM,EAAI,EAAIhR,EAAEuvB,EAAG7qB,EAAG,CAAC,EACjBA,GAAK,EACLirB,EAAIH,EAAEE,EAAI,CAAC,GACF9qB,IAAM,IACfoM,EAAI,EAAIhR,EAAEuvB,EAAG7qB,EAAG,CAAC,EACjBA,GAAK,GACIE,IAAM,KACfoM,EAAI,GAAKhR,EAAEuvB,EAAG7qB,EAAG,CAAC,EAClBA,GAAK,GAEP,MAAMwqB,EAAIQ,EAAI1e,EACd,KAAO0e,EAAIR,GACTM,EAAEE,CAAC,EAAIC,EACPD,GAEH,CACF,CACD,OAAOhrB,CACX,EACEoqB,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAGM,EAAG,CAC5B,IAAI7qB,EAAI,EACJ8qB,EAAI,EACR,MAAMxvB,EAAIuvB,EAAE,SAAW,EACvB,KAAOC,EAAIP,GAAG,CACZ,MAAMQ,EAAIV,EAAES,EAAIR,CAAC,EACjBO,EAAEC,GAAK,CAAC,EAAI,EACZD,GAAGC,GAAK,GAAK,CAAC,EAAIC,EACdA,EAAI/qB,IAAGA,EAAI+qB,GACfD,GACD,CACD,KAAOA,EAAIxvB,GACTuvB,EAAEC,GAAK,CAAC,EAAI,EACZD,GAAGC,GAAK,GAAK,CAAC,EAAI,EAClBA,IAEF,OAAO9qB,CACX,EACEoqB,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIH,EAAE,EAAE,EACRS,EAAIR,EAAE,OACZ,IAAIrqB,EACA8qB,EACAxvB,EACAyvB,EACAC,EACJ,MAAM96B,EAAIq6B,EAAE,EACZ,QAASQ,EAAI,EAAGA,GAAKT,EAAGS,IAAK76B,EAAE66B,CAAC,EAAI,EACpC,IAAKA,EAAI,EAAGA,EAAIF,EAAGE,GAAK,EAAG76B,EAAEm6B,EAAEU,CAAC,CAAC,IACjC,MAAM7qB,EAAIqqB,EAAE,EAGZ,IAFAvqB,EAAI,EACJ9P,EAAE,CAAC,EAAI,EACF46B,EAAI,EAAGA,GAAKR,EAAGQ,IAClB9qB,EAAKA,EAAI9P,EAAE46B,EAAI,CAAC,GAAM,EACtB5qB,EAAE4qB,CAAC,EAAI9qB,EAET,IAAK1E,EAAI,EAAGA,EAAIuvB,EAAGvvB,GAAK,EACtB0vB,EAAIX,EAAE/uB,EAAI,CAAC,EACP0vB,IAAM,IACRX,EAAE/uB,CAAC,EAAI4E,EAAE8qB,CAAC,EACV9qB,EAAE8qB,CAAC,IAGX,EACEZ,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,MAAMM,EAAIR,EAAE,OAENS,EADIV,EAAE,EAAE,EACF,EACZ,QAAS9uB,EAAI,EAAGA,EAAIuvB,EAAGvvB,GAAK,EAC1B,GAAI+uB,EAAE/uB,EAAI,CAAC,IAAM,EAAG,CAClB,MAAMyvB,EAAIzvB,GAAK,EACT0vB,EAAIX,EAAE/uB,EAAI,CAAC,EACXpL,EAAK66B,GAAK,EAAKC,EACf9qB,EAAIoqB,EAAIU,EACd,IAAIC,EAAIZ,EAAE/uB,CAAC,GAAK4E,EAChB,MAAMoM,EAAI2e,GAAK,GAAK/qB,GACpB,KAAO+qB,IAAM3e,GAAG,CACd,MAAMke,EAAIM,EAAEG,CAAC,IAAO,GAAKX,EACzBC,EAAEC,CAAC,EAAIt6B,EACP+6B,GACD,CACF,CACP,EACEb,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,MAAMC,EAAIH,EAAE,EAAE,EAAE,EACVS,EAAI,GAAKP,EACf,QAAStqB,EAAI,EAAGA,EAAIqqB,EAAE,OAAQrqB,GAAK,EAAG,CACpC,MAAM8qB,EAAIT,EAAErqB,CAAC,GAAMsqB,EAAID,EAAErqB,EAAI,CAAC,EAC9BqqB,EAAErqB,CAAC,EAAIuqB,EAAEO,CAAC,IAAMD,CACjB,CACL,EACET,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzBA,EAAIA,IAAMD,EAAI,GACd,MAAMO,EAAIP,IAAM,EAChBD,EAAEQ,CAAC,GAAKN,EACRF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,CACtB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzBA,EAAIA,IAAMD,EAAI,GACd,MAAMO,EAAIP,IAAM,EAChBD,EAAEQ,CAAC,GAAKN,EACRF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,EAClBF,EAAEQ,EAAI,CAAC,GAAKN,IAAM,EACtB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,OACIF,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,MAASA,EAAI,IAAQ,GAAKC,GAAK,CAEzE,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAGC,EAAG,CACzB,OACIF,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,EAAMD,GAAGC,IAAM,GAAK,CAAC,GAAK,OAC3DA,EAAI,IACL,GAAKC,GAAK,CAElB,EACEH,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,OACGD,EAAEC,IAAM,CAAC,EAAKD,GAAGC,IAAM,GAAK,CAAC,GAAK,EAAMD,GAAGC,IAAM,GAAK,CAAC,GAAK,OAC5DA,EAAI,EAEX,EACEF,EAAE,EAAE,EAAI,SAAUC,EAAGC,EAAG,CACtB,OACGD,EAAEC,IAAM,CAAC,EACPD,GAAGC,IAAM,GAAK,CAAC,GAAK,EACpBD,GAAGC,IAAM,GAAK,CAAC,GAAK,GACpBD,GAAGC,IAAM,GAAK,CAAC,GAAK,OACtBA,EAAI,EAEX,EACEF,EAAE,EAAE,EAAK,UAAY,CACnB,MAAMC,EAAI,YACJC,EAAI,YACV,MAAO,CACL,EAAG,IAAID,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,EACpE,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrE,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GACrD,EACD,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CACtB,EACD,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAChE,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MAAO,MAAO,MAClE,MAAO,KACR,EACD,EAAG,CACD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAClE,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,CAChC,EACD,EAAG,IAAIC,EAAE,EAAE,EACX,EAAG,IAAID,EAAE,GAAG,EACZ,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAK,EACd,EAAG,CAAE,EACL,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAK,EACd,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,GAAG,EACZ,EAAG,CAAE,EACL,EAAG,IAAIA,EAAE,KAAO,EAChB,EAAG,IAAIC,EAAE,GAAG,EACZ,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,EAAE,EACX,EAAG,IAAIA,EAAE,IAAI,EACb,EAAG,IAAID,EAAE,KAAO,EAChB,EAAG,IAAIA,EAAE,KAAO,CACtB,CACA,IACG,UAAY,CACX,MAAMA,EAAID,EAAE,EAAE,EACRE,EAAI,MACV,QAASC,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,IAAIM,EAAIN,EACRM,GAAMA,EAAI,cAAgB,GAAOA,EAAI,aAAe,EACpDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,YAAc,EACnDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,YAAc,EACnDA,GAAMA,EAAI,cAAgB,GAAOA,EAAI,WAAa,EAClDR,EAAE,EAAEE,CAAC,GAAMM,IAAM,GAAOA,GAAK,MAAS,EACvC,CACD,SAAS7qB,EAAE8qB,EAAGxvB,EAAGyvB,EAAG,CAClB,KAAOzvB,MAAQ,GAAGwvB,EAAE,KAAK,EAAGC,CAAC,CAC9B,CACD,QAASR,EAAI,EAAGA,EAAI,GAAIA,IACtBF,EAAE,EAAEE,CAAC,EAAKF,EAAE,EAAEE,CAAC,GAAK,EAAKF,EAAE,EAAEE,CAAC,EAC9BF,EAAE,EAAEE,CAAC,EAAKF,EAAE,EAAEE,CAAC,GAAK,EAAKF,EAAE,EAAEE,CAAC,EAEhCvqB,EAAEqqB,EAAE,EAAG,IAAK,CAAC,EACbrqB,EAAEqqB,EAAE,EAAG,IAAW,CAAC,EACnBrqB,EAAEqqB,EAAE,EAAG,GAAW,CAAC,EACnBrqB,EAAEqqB,EAAE,EAAG,EAAW,CAAC,EACnBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,EAAGA,EAAE,CAAC,EACjBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZrqB,EAAEqqB,EAAE,EAAG,GAAI,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZD,EAAE,EAAE,EAAEC,EAAE,EAAG,EAAGA,EAAE,CAAC,EACjBD,EAAE,EAAE,EAAEC,EAAE,EAAG,CAAC,EACZrqB,EAAEqqB,EAAE,EAAG,GAAI,CAAC,EACZrqB,EAAEqqB,EAAE,EAAG,IAAK,CAAC,EACbrqB,EAAEqqB,EAAE,EAAG,GAAI,CAAC,EACZrqB,EAAEqqB,EAAE,EAAG,IAAK,CAAC,CACjB,IACSD,EAAE,EAAE,CACb,IAEAhD,EAAK,OAAO,eAAiB,SAAU/yB,EAAMiK,EAAK,CAChD,MAAMmN,EAAInN,EAAI,MACR+N,EAAI/N,EAAI,OACRypB,EAAMX,EAAK,OAAO,QAAQ9oB,CAAG,EAC7BotB,EAAO3D,GAAO,EACdC,EAAM,KAAK,KAAMvc,EAAIsc,EAAO,CAAC,EAC7BT,EAAM,IAAI,WAAWjb,EAAI2b,CAAG,EAClC,IAAIiB,EAAK,EAET,MAAM0C,EAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnCC,EAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnCC,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACpCC,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAE1C,IAAIC,EAAO,EACX,KAAOA,EAAO,GAAG,CACf,MAAMC,EAAKH,EAAcE,CAAI,EACvBvrB,EAAKsrB,EAAcC,CAAI,EAC7B,IAAIE,EAAK,EACLC,EAAK,EACLC,EAAKR,EAAaI,CAAI,EAC1B,KAAOI,EAAK9f,GACV8f,GAAMH,EACNE,IAEF,IAAIE,EAAKR,EAAaG,CAAI,EAC1B,KAAOK,EAAK3gB,GACV2gB,GAAM5rB,EACNyrB,IAEF,MAAMI,EAAO,KAAK,KAAMJ,EAAKlE,EAAO,CAAC,EACrCX,EAAK,OAAO,YAAY/yB,EAAMiK,EAAK2qB,EAAIgD,EAAIC,CAAE,EAE7C,IAAIrD,EAAI,EACJyD,EAAMX,EAAaI,CAAI,EAC3B,KAAOO,EAAMjgB,GAAG,CACd,IAAIkgB,EAAMX,EAAaG,CAAI,EACvBS,EAAOvD,EAAKJ,EAAIwD,GAAS,EAE7B,KAAOE,EAAM9gB,GAAG,CACd,GAAIsc,IAAQ,EAAG,CACb,IAAIngB,EAAMvT,EAAKm4B,GAAO,CAAC,EACvB5kB,EAAOA,GAAQ,GAAK4kB,EAAM,GAAO,EACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAK3kB,GAAQ,IAAM2kB,EAAM,IAAM,EAC1D,CACD,GAAIxE,IAAQ,EAAG,CACb,IAAIngB,EAAMvT,EAAKm4B,GAAO,CAAC,EACvB5kB,EAAOA,GAAQ,GAAK4kB,EAAM,GAAO,EACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAK3kB,GAAQ,IAAM2kB,EAAM,IAAM,EAC1D,CACD,GAAIxE,IAAQ,EAAG,CACb,IAAIngB,EAAMvT,EAAKm4B,GAAO,CAAC,EACvB5kB,EAAOA,GAAQ,GAAK4kB,EAAM,GAAO,GACjClF,EAAIgF,EAAMtE,GAAOuE,GAAO,EAAE,GAAK3kB,GAAQ,IAAM2kB,EAAM,IAAM,EAC1D,CACD,GAAIxE,GAAO,EAAG,CACZ,MAAMrmB,EAAK4qB,EAAMtE,EAAMuE,EAAMb,EAC7B,QAASnpB,EAAI,EAAGA,EAAImpB,EAAMnpB,IAAK+kB,EAAI5lB,EAAKa,CAAC,EAAIlO,GAAMm4B,GAAO,GAAKjqB,CAAC,CACjE,CACDiqB,GAAOzE,EACPwE,GAAO/rB,CACR,CACDqoB,IACAyD,GAAON,CACR,CACGC,EAAKC,IAAO,IAAGjD,GAAMiD,GAAM,EAAIG,IACnCN,EAAOA,EAAO,CACf,CACD,OAAOzE,CACT,EAEAF,EAAK,OAAO,QAAU,SAAU9oB,EAAK,CAEnC,MADY,CAAC,EAAG,KAAM,EAAG,EAAG,EAAG,KAAM,CAAC,EAAEA,EAAI,KAAK,EACpCA,EAAI,KACnB,EAEA8oB,EAAK,OAAO,YAAc,SAAU/yB,EAAMiK,EAAKa,EAAKsM,EAAGY,EAAG,CACxD,IAAI0b,EAAMX,EAAK,OAAO,QAAQ9oB,CAAG,EACjC,MAAM0pB,EAAM,KAAK,KAAMvc,EAAIsc,EAAO,CAAC,EAC7B0E,EAAQrF,EAAK,OAAO,OAC1BW,EAAM,KAAK,KAAKA,EAAM,CAAC,EAEvB,IAAI1sB,EAAI,EACJ4tB,EAAK,EACL7sB,EAAO/H,EAAK8K,CAAG,EACfiJ,EAAI,EAGR,GADIhM,EAAO,IAAG/H,EAAK8K,CAAG,EAAI,CAAC,EAAG,EAAG,CAAC,EAAE/C,EAAO,CAAC,GACxCA,IAAS,EACX,IAAKgM,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACrB/T,EAAK+T,EAAI,CAAC,EAAK/T,EAAK+T,EAAI,CAAC,GAAK/T,EAAK+T,EAAI,EAAI2f,CAAG,IAAM,GAAM,IAE9D,QAASc,EAAI,EAAGA,EAAIxc,EAAGwc,IAMrB,GALAxtB,EAAI8D,EAAM0pB,EAAIb,EACdiB,EAAK5tB,EAAIwtB,EAAI,EACbzsB,EAAO/H,EAAK40B,EAAK,CAAC,EAClB7gB,EAAI,EAEAhM,IAAS,EAAG,KAAOgM,EAAI4f,EAAK5f,IAAK/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,UACrDhM,IAAS,EAAG,CACnB,KAAOgM,EAAI2f,EAAK3f,IAAK/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,EAC9C,KAAOA,EAAI4f,EAAK5f,IAAK/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,EAAI/T,EAAKgH,EAAI+M,EAAI2f,CAAG,CACxE,SAAe3rB,IAAS,EAClB,KAAOgM,EAAI4f,EAAK5f,IAAK/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,EAAI/T,EAAKgH,EAAI+M,EAAI4f,CAAG,UACzD5rB,IAAS,EAAG,CACrB,KAAOgM,EAAI2f,EAAK3f,IACd/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,GAAK/T,EAAKgH,EAAI+M,EAAI4f,CAAG,IAAM,GACtD,KAAO5f,EAAI4f,EAAK5f,IACd/T,EAAKgH,EAAI+M,CAAC,EACR/T,EAAK40B,EAAK7gB,CAAC,GAAM/T,EAAKgH,EAAI+M,EAAI4f,CAAG,EAAI3zB,EAAKgH,EAAI+M,EAAI2f,CAAG,IAAO,EACtE,KAAW,CACL,KAAO3f,EAAI2f,EAAK3f,IACd/T,EAAKgH,EAAI+M,CAAC,EAAI/T,EAAK40B,EAAK7gB,CAAC,EAAIqkB,EAAM,EAAGp4B,EAAKgH,EAAI+M,EAAI4f,CAAG,EAAG,CAAC,EAC5D,KAAO5f,EAAI4f,EAAK5f,IACd/T,EAAKgH,EAAI+M,CAAC,EACR/T,EAAK40B,EAAK7gB,CAAC,EACXqkB,EAAMp4B,EAAKgH,EAAI+M,EAAI2f,CAAG,EAAG1zB,EAAKgH,EAAI+M,EAAI4f,CAAG,EAAG3zB,EAAKgH,EAAI+M,EAAI2f,EAAMC,CAAG,CAAC,CACxE,CAEH,OAAO3zB,CACT,EAEA+yB,EAAK,OAAO,OAAS,SAAUljB,EAAGhE,EAAG9M,EAAG,CACtC,MAAM2F,EAAImL,EAAIhE,EAAI9M,EACZs5B,EAAK3zB,EAAImL,EACTyoB,EAAK5zB,EAAImH,EACT0sB,EAAK7zB,EAAI3F,EACf,OAAIs5B,EAAKA,GAAMC,EAAKA,GAAMD,EAAKA,GAAME,EAAKA,EAAW1oB,EAC5CyoB,EAAKA,GAAMC,EAAKA,EAAW1sB,EAC7B9M,CACT,EAEAg0B,EAAK,OAAO,MAAQ,SAAU/yB,EAAMg1B,EAAQ/qB,EAAK,CAC/C,MAAMgrB,EAAMlC,EAAK,KACjB9oB,EAAI,MAAQgrB,EAAI,SAASj1B,EAAMg1B,CAAM,EACrCA,GAAU,EACV/qB,EAAI,OAASgrB,EAAI,SAASj1B,EAAMg1B,CAAM,EACtCA,GAAU,EACV/qB,EAAI,MAAQjK,EAAKg1B,CAAM,EACvBA,IACA/qB,EAAI,MAAQjK,EAAKg1B,CAAM,EACvBA,IACA/qB,EAAI,SAAWjK,EAAKg1B,CAAM,EAC1BA,IACA/qB,EAAI,OAASjK,EAAKg1B,CAAM,EACxBA,IACA/qB,EAAI,UAAYjK,EAAKg1B,CAAM,EAC3BA,GACF,EAEAjC,EAAK,KAAO,CACV,SAAU,SAAU/yB,EAAM0E,EAAG,CAC3B,KAAO1E,EAAK0E,CAAC,IAAM,GAAGA,IACtB,OAAOA,CACR,EACD,WAAY,SAAUsH,EAAMtH,EAAG,CAC7B,OAAQsH,EAAKtH,CAAC,GAAK,EAAKsH,EAAKtH,EAAI,CAAC,CACnC,EACD,YAAa,SAAUsH,EAAMtH,EAAGiH,EAAG,CACjCK,EAAKtH,CAAC,EAAKiH,GAAK,EAAK,IACrBK,EAAKtH,EAAI,CAAC,EAAIiH,EAAI,GACnB,EACD,SAAU,SAAUK,EAAMtH,EAAG,CAC3B,OACEsH,EAAKtH,CAAC,EAAK,UACTsH,EAAKtH,EAAI,CAAC,GAAK,GAAOsH,EAAKtH,EAAI,CAAC,GAAK,EAAKsH,EAAKtH,EAAI,CAAC,EAEzD,EACD,UAAW,SAAUsH,EAAMtH,EAAGiH,EAAG,CAC/BK,EAAKtH,CAAC,EAAKiH,GAAK,GAAM,IACtBK,EAAKtH,EAAI,CAAC,EAAKiH,GAAK,GAAM,IAC1BK,EAAKtH,EAAI,CAAC,EAAKiH,GAAK,EAAK,IACzBK,EAAKtH,EAAI,CAAC,EAAIiH,EAAI,GACnB,EACD,UAAW,SAAUK,EAAMtH,EAAGuC,EAAG,CAC/B,IAAIG,EAAI,GACR,QAASJ,EAAI,EAAGA,EAAIC,EAAGD,IAAKI,GAAK,OAAO,aAAa4E,EAAKtH,EAAIsC,CAAC,CAAC,EAChE,OAAOI,CACR,EACD,WAAY,SAAUpH,EAAM0E,EAAG0C,EAAG,CAChC,QAAS,EAAI,EAAG,EAAIA,EAAE,OAAQ,IAAKpH,EAAK0E,EAAI,CAAC,EAAI0C,EAAE,WAAW,CAAC,CAChE,EACD,UAAW,SAAU4E,EAAMtH,EAAGuC,EAAG,CAC/B,MAAMF,EAAM,CAAA,EACZ,QAASC,EAAI,EAAGA,EAAIC,EAAGD,IAAKD,EAAI,KAAKiF,EAAKtH,EAAIsC,CAAC,CAAC,EAChD,OAAOD,CACR,EACD,IAAK,SAAU4E,EAAG,CAChB,OAAOA,EAAE,OAAS,EAAI,IAAMA,EAAIA,CACjC,EACD,SAAU,SAAUK,EAAMtH,EAAGuC,EAAG,CAC9B,IAAIG,EAAI,GACJ6E,EACJ,QAASjF,EAAI,EAAGA,EAAIC,EAAGD,IACrBI,GAAK,IAAM2rB,EAAK,KAAK,IAAI/mB,EAAKtH,EAAIsC,CAAC,EAAE,SAAS,EAAE,CAAC,EACnD,GAAI,CACFiF,EAAK,mBAAmB7E,CAAC,CAC1B,MAAW,CACV,OAAO2rB,EAAK,KAAK,UAAU/mB,EAAMtH,EAAGuC,CAAC,CACtC,CACD,OAAOgF,CACR,CACH,EACA8mB,EAAK,UAAY,SAAUyF,EAAIZ,EAAIC,EAAIxD,EAAIoE,EAAIC,EAAIC,EAAMC,EAAMC,EAAM,CACnE,MAAMzhB,EAAI,KAAK,IAAIwgB,EAAIa,CAAE,EACnB,EAAI,KAAK,IAAIZ,EAAIa,CAAE,EACzB,IAAIjpB,EAAK,EACLykB,EAAK,EACT,QAASM,EAAI,EAAGA,EAAI,EAAGA,IACrB,QAASzgB,EAAI,EAAGA,EAAIqD,EAAGrD,IASrB,GARI4kB,GAAQ,GAAKC,GAAQ,GACvBnpB,EAAM+kB,EAAIoD,EAAK7jB,GAAM,EACrBmgB,GAAO0E,EAAOpE,GAAKiE,EAAKE,EAAO5kB,GAAM,IAErCtE,GAAO,CAACmpB,EAAOpE,GAAKoD,EAAKe,EAAO5kB,GAAM,EACtCmgB,EAAMM,EAAIiE,EAAK1kB,GAAM,GAGnB8kB,IAAS,EACXxE,EAAGH,CAAE,EAAIsE,EAAG/oB,CAAE,EACd4kB,EAAGH,EAAK,CAAC,EAAIsE,EAAG/oB,EAAK,CAAC,EACtB4kB,EAAGH,EAAK,CAAC,EAAIsE,EAAG/oB,EAAK,CAAC,EACtB4kB,EAAGH,EAAK,CAAC,EAAIsE,EAAG/oB,EAAK,CAAC,UACbopB,IAAS,EAAG,CACrB,MAAMC,EAAKN,EAAG/oB,EAAK,CAAC,EAAK,mBACnB8lB,EAAKiD,EAAG/oB,CAAE,EAAIqpB,EACdC,EAAKP,EAAG/oB,EAAK,CAAC,EAAIqpB,EAClBE,EAAKR,EAAG/oB,EAAK,CAAC,EAAIqpB,EAClBG,EAAK5E,EAAGH,EAAK,CAAC,GAAK,EAAI,KACvBgF,EAAK7E,EAAGH,CAAE,EAAI+E,EACdE,EAAK9E,EAAGH,EAAK,CAAC,EAAI+E,EAClBG,EAAK/E,EAAGH,EAAK,CAAC,EAAI+E,EAElBI,EAAM,EAAIP,EACVQ,EAAKR,EAAKG,EAAKI,EACfE,EAAMD,IAAO,EAAI,EAAI,EAAIA,EAC/BjF,EAAGH,EAAK,CAAC,EAAI,IAAMoF,EACnBjF,EAAGH,EAAK,CAAC,GAAKqB,EAAK2D,EAAKG,GAAOE,EAC/BlF,EAAGH,EAAK,CAAC,GAAK6E,EAAKI,EAAKE,GAAOE,EAC/BlF,EAAGH,EAAK,CAAC,GAAK8E,EAAKI,EAAKC,GAAOE,CACvC,SAAiBV,IAAS,EAAG,CAErB,MAAMC,EAAKN,EAAG/oB,EAAK,CAAC,EACd8lB,EAAKiD,EAAG/oB,CAAE,EACVspB,EAAKP,EAAG/oB,EAAK,CAAC,EACdupB,EAAKR,EAAG/oB,EAAK,CAAC,EACdwpB,EAAK5E,EAAGH,EAAK,CAAC,EACdgF,EAAK7E,EAAGH,CAAE,EACViF,EAAK9E,EAAGH,EAAK,CAAC,EACdkF,EAAK/E,EAAGH,EAAK,CAAC,EAChB4E,IAAOG,GAAM1D,IAAO2D,GAAMH,IAAOI,GAAMH,IAAOI,GAChD/E,EAAGH,CAAE,EAAI,EACTG,EAAGH,EAAK,CAAC,EAAI,EACbG,EAAGH,EAAK,CAAC,EAAI,EACbG,EAAGH,EAAK,CAAC,EAAI,IAEbG,EAAGH,CAAE,EAAIqB,EACTlB,EAAGH,EAAK,CAAC,EAAI6E,EACb1E,EAAGH,EAAK,CAAC,EAAI8E,EACb3E,EAAGH,EAAK,CAAC,EAAI4E,EAEvB,SAAiBD,IAAS,EAAG,CAErB,MAAMC,EAAKN,EAAG/oB,EAAK,CAAC,EACd8lB,EAAKiD,EAAG/oB,CAAE,EACVspB,EAAKP,EAAG/oB,EAAK,CAAC,EACdupB,EAAKR,EAAG/oB,EAAK,CAAC,EACdwpB,EAAK5E,EAAGH,EAAK,CAAC,EACdgF,EAAK7E,EAAGH,CAAE,EACViF,EAAK9E,EAAGH,EAAK,CAAC,EACdkF,EAAK/E,EAAGH,EAAK,CAAC,EACpB,GAAI4E,IAAOG,GAAM1D,IAAO2D,GAAMH,IAAOI,GAAMH,IAAOI,EAAI,SACtD,GAAIN,EAAK,KAAOG,EAAK,GAAI,MAAO,EACjC,CAEL,MAAO,EACT,EAEAlG,EAAK,OAAS,SAAUyG,EAAMpiB,EAAGY,EAAGyhB,EAAIC,EAAMC,EAAMC,EAAY,CAC1DH,IAAO,OAAMA,EAAK,GAClBG,IAAe,OAAMA,EAAa,IAEtC,MAAMC,EAAO9G,EAAK,OAAO,SAASyG,EAAMpiB,EAAGY,EAAGyhB,EAAI,CAChD,GACA,GACA,GACA,EACAG,CACJ,CAAG,EACD,OAAA7G,EAAK,OAAO,YAAY8G,EAAM,EAAE,EAEzB9G,EAAK,OAAO,MAAM8G,EAAMziB,EAAGY,EAAG0hB,EAAMC,CAAI,CACjD,EAEA5G,EAAK,SAAW,SAAUyG,EAAMpiB,EAAGY,EAAG+f,EAAI+B,EAAIphB,EAAOghB,EAAMC,EAAM,CAC/D,MAAME,EAAO,CACX,MAAO,GAAK9B,IAAO,EAAI,EAAI,IAAM+B,IAAO,EAAI,EAAI,GAChD,MAAAphB,EACA,OAAQ,CAAE,CACd,EAEQqhB,GAAQhC,EAAK+B,GAAMphB,EACnBshB,EAAOD,EAAO3iB,EACpB,QAASpQ,EAAI,EAAGA,EAAIwyB,EAAK,OAAQxyB,IAC/B6yB,EAAK,OAAO,KAAK,CACf,KAAM,CAAE,EAAG,EAAG,EAAG,EAAG,MAAOziB,EAAG,OAAQY,CAAG,EACzC,IAAK,IAAI,WAAWwhB,EAAKxyB,CAAC,CAAC,EAC3B,MAAO,EACP,QAAS,EACT,IAAK,KAAK,KAAK+yB,EAAO,CAAC,EACvB,IAAK,KAAK,KAAKC,EAAO,CAAC,CAC7B,CAAK,EAEH,OAAAjH,EAAK,OAAO,YAAY8G,EAAM,EAAG,EAAI,EAEzB9G,EAAK,OAAO,MAAM8G,EAAMziB,EAAGY,EAAG0hB,EAAMC,CAAI,CAEtD,EAEA5G,EAAK,OAAO,MAAQ,SAAU8G,EAAMziB,EAAGY,EAAG0hB,EAAMC,EAAM,CAC/CA,IAAMA,EAAO,IAClB,MAAM5uB,EAAMgoB,EAAK,IAAI,IACf7nB,EAAM6nB,EAAK,KAAK,UAChB5nB,EAAM4nB,EAAK,KAAK,YAChBkH,EAAMlH,EAAK,KAAK,WACtB,IAAIiC,EAAS,EACb,MAAMkF,EAAOL,EAAK,OAAO,OAAS,EAClC,IAAIM,EAAW,GAEXC,EAAO,GAAK,GAAK,EAAI,IAAMF,EAAO,GAAK,GAG3C,GAFIP,EAAK,OAAS,MAAQA,EAAK,OAAS,SAAWS,GAAQ,IACvDT,EAAK,OAAS,MAAQA,EAAK,OAAS,SAAWS,GAAQ,IACvDP,EAAK,QAAU,EAAG,CACpB,MAAMQ,EAAKR,EAAK,KAAK,OACrB,QAAS7yB,EAAI,EAAGA,EAAIqzB,EAAIrzB,IAClB6yB,EAAK,KAAK7yB,CAAC,IAAM,KAAO,MAAKmzB,EAAW,IAC9CC,GAAQ,EAAIC,EAAK,EAAI,GAAKF,EAAW,EAAIE,EAAK,EAAI,EAAI,EACvD,CACD,QAASnsB,EAAI,EAAGA,EAAI2rB,EAAK,OAAO,OAAQ3rB,IAAK,CAC3C,MAAMqnB,EAAKsE,EAAK,OAAO3rB,CAAC,EACpBgsB,IAAME,GAAQ,IAClBA,GAAQ7E,EAAG,KAAK,OAAS,GACrBrnB,IAAM,IAAGksB,GAAQ,EACtB,CACDA,GAAQ,GAER,MAAMp6B,EAAO,IAAI,WAAWo6B,CAAI,EAC1BE,EAAK,CAAC,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAI,EAC1D,QAAStzB,EAAI,EAAGA,EAAI,EAAGA,IAAKhH,EAAKgH,CAAC,EAAIszB,EAAGtzB,CAAC,EA8D1C,GA5DAkE,EAAIlL,EAAMg1B,EAAQ,EAAE,EACpBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQ5d,CAAC,EACnB4d,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQhd,CAAC,EACnBgd,GAAU,EACVh1B,EAAKg1B,CAAM,EAAI6E,EAAK,MACpB7E,IACAh1B,EAAKg1B,CAAM,EAAI6E,EAAK,MACpB7E,IACAh1B,EAAKg1B,CAAM,EAAI,EACfA,IACAh1B,EAAKg1B,CAAM,EAAI,EACfA,IACAh1B,EAAKg1B,CAAM,EAAI,EACfA,IACA9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,EAGN2E,EAAK,OAAS,MAAQA,EAAK,OAAS,SACtCzuB,EAAIlL,EAAMg1B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACVh1B,EAAKg1B,CAAM,EAAI2E,EAAK,KACpB3E,IACA9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,EAAG,CAAC,CAAC,EAC1CA,GAAU,GAER2E,EAAK,OAAS,MAAQA,EAAK,OAAS,SACtCzuB,EAAIlL,EAAMg1B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQ2E,EAAK,KAAK,CAAC,CAAC,EAC9B3E,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQ2E,EAAK,KAAK,CAAC,CAAC,EAC9B3E,GAAU,EACVh1B,EAAKg1B,CAAM,EAAI2E,EAAK,KAAK,CAAC,EAC1B3E,IACA9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGRkF,IACFhvB,EAAIlL,EAAMg1B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQ6E,EAAK,OAAO,MAAM,EACpC7E,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQ2E,EAAK,MAAQ,KAAOA,EAAK,KAAO,CAAC,EACnD3E,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGR6E,EAAK,QAAU,EAAG,CACpB,MAAMQ,EAAKR,EAAK,KAAK,OACrB3uB,EAAIlL,EAAMg1B,EAAQqF,EAAK,CAAC,EACxBrF,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV,QAAShuB,EAAI,EAAGA,EAAIqzB,EAAIrzB,IAAK,CAC3B,MAAMktB,EAAKltB,EAAI,EACTjI,EAAI86B,EAAK,KAAK7yB,CAAC,EACf+vB,EAAIh4B,EAAI,IACRw7B,EAAKx7B,IAAM,EAAK,IAChB8M,EAAK9M,IAAM,GAAM,IACvBiB,EAAKg1B,EAASd,EAAK,CAAC,EAAI6C,EACxB/2B,EAAKg1B,EAASd,EAAK,CAAC,EAAIqG,EACxBv6B,EAAKg1B,EAASd,EAAK,CAAC,EAAIroB,CACzB,CAKD,GAJAmpB,GAAUqF,EAAK,EACfnvB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAASqF,EAAK,EAAI,EAAGA,EAAK,EAAI,CAAC,CAAC,EAC5DrF,GAAU,EAENmF,EAAU,CACZjvB,EAAIlL,EAAMg1B,EAAQqF,CAAE,EACpBrF,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV,QAAShuB,EAAI,EAAGA,EAAIqzB,EAAIrzB,IACtBhH,EAAKg1B,EAAShuB,CAAC,EAAK6yB,EAAK,KAAK7yB,CAAC,IAAM,GAAM,IAC7CguB,GAAUqF,EACVnvB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAASqF,EAAK,EAAGA,EAAK,CAAC,CAAC,EACpDrF,GAAU,CACX,CACF,CAED,IAAIwF,EAAK,EACT,QAAStsB,EAAI,EAAGA,EAAI2rB,EAAK,OAAO,OAAQ3rB,IAAK,CAC3C,MAAMqnB,EAAKsE,EAAK,OAAO3rB,CAAC,EACpBgsB,IACFhvB,EAAIlL,EAAMg1B,EAAQ,EAAE,EACpBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQwF,GAAI,EACtBxF,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQO,EAAG,KAAK,KAAK,EAC/BP,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQO,EAAG,KAAK,MAAM,EAChCP,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQO,EAAG,KAAK,CAAC,EAC3BP,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQO,EAAG,KAAK,CAAC,EAC3BP,GAAU,EACV7pB,EAAInL,EAAMg1B,EAAQ0E,EAAKxrB,CAAC,CAAC,EACzB8mB,GAAU,EACV7pB,EAAInL,EAAMg1B,EAAQ,GAAI,EACtBA,GAAU,EACVh1B,EAAKg1B,CAAM,EAAIO,EAAG,QAClBP,IACAh1B,EAAKg1B,CAAM,EAAIO,EAAG,MAClBP,IACA9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,GAAI,EAAE,CAAC,EAC5CA,GAAU,GAGZ,MAAMyF,EAAOlF,EAAG,KACV8E,EAAKI,EAAK,OAChBvvB,EAAIlL,EAAMg1B,EAAQqF,GAAMnsB,IAAM,EAAI,EAAI,EAAE,EACxC8mB,GAAU,EACV,MAAMzpB,EAAOypB,EACbiF,EAAIj6B,EAAMg1B,EAAQ9mB,IAAM,EAAI,OAAS,MAAM,EAC3C8mB,GAAU,EACN9mB,IAAM,IACRhD,EAAIlL,EAAMg1B,EAAQwF,GAAI,EACtBxF,GAAU,GAEZh1B,EAAK,IAAIy6B,EAAMzF,CAAM,EACrBA,GAAUqF,EACVnvB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMuL,EAAMypB,EAASzpB,CAAI,CAAC,EAChDypB,GAAU,CACX,CAED,OAAA9pB,EAAIlL,EAAMg1B,EAAQ,CAAC,EACnBA,GAAU,EACViF,EAAIj6B,EAAMg1B,EAAQ,MAAM,EACxBA,GAAU,EACV9pB,EAAIlL,EAAMg1B,EAAQjqB,EAAI/K,EAAMg1B,EAAS,EAAG,CAAC,CAAC,EAC1CA,GAAU,EAEHh1B,EAAK,MACd,EAEA+yB,EAAK,OAAO,YAAc,SAAU9oB,EAAKywB,EAAQC,EAAW,CAC1D,QAAS,EAAI,EAAG,EAAI1wB,EAAI,OAAO,OAAQ,IAAK,CAC1C,MAAMkpB,EAAMlpB,EAAI,OAAO,CAAC,EAElB2wB,EAAKzH,EAAI,KAAK,OACdK,EAAQ,IAAI,WAAWoH,EAAKzH,EAAI,IAAMyH,CAAE,EAC9CzH,EAAI,KAAOJ,EAAK,OAAO,YACrBI,EAAI,IACJyH,EACAzH,EAAI,IACJA,EAAI,IACJK,EACAkH,EACAC,CACN,CACG,CACH,EAEA5H,EAAK,OAAO,SAAW,SACrByG,EACApiB,EACAY,EACAyhB,EACAoB,EACA,CACA,MAAMC,EAAYD,EAAK,CAAC,EAClBE,EAAUF,EAAK,CAAC,EAChBG,EAAaH,EAAK,CAAC,EACnBI,EAAUJ,EAAK,CAAC,EAChBjB,EAAaiB,EAAK,CAAC,EAEzB,IAAI/G,EAAQ,EACRpb,EAAQ,EACRwiB,EAAW,IAEf,QAAShtB,EAAI,EAAGA,EAAIsrB,EAAK,OAAQtrB,IAAK,CAEpC,MAAM+kB,EAAM,IAAI,WAAWuG,EAAKtrB,CAAC,CAAC,EAC5BitB,EAAOlI,EAAI,OACjB,QAASjsB,EAAI,EAAGA,EAAIm0B,EAAMn0B,GAAK,EAAGk0B,GAAYjI,EAAIjsB,EAAI,CAAC,CACxD,CACD,MAAMo0B,EAAWF,IAAa,IAGxBlI,EAAOD,EAAK,OAAO,QAAQyG,EAAMpiB,EAAGY,EAAG8iB,EAAWC,EAASC,CAAU,EAErEK,EAAO,CAAA,EACPC,EAAO,CAAA,EACPC,EAAO,CAAA,EAEb,GAAI9B,IAAO,EAAG,CACZ,MAAM+B,EAAQ,CAAA,EACd,QAASx0B,EAAI,EAAGA,EAAIgsB,EAAK,OAAQhsB,IAAKw0B,EAAM,KAAKxI,EAAKhsB,CAAC,EAAE,IAAI,MAAM,EAEnE,MAAMy0B,EAAO1I,EAAK,OAAO,WAAWyI,CAAK,EACnCE,EAAO3I,EAAK,SAAS0I,EAAMhC,CAAE,EACnC,IAAIkC,EAAM,EACV,MAAMvC,EAAK,IAAI,WAAWsC,EAAK,IAAI,EACnC,QAAS10B,EAAI,EAAGA,EAAIgsB,EAAK,OAAQhsB,IAAK,CACpC,MAAMktB,EAAKlB,EAAKhsB,CAAC,EAAE,IACb40B,EAAM1H,EAAG,OACfqH,EAAK,KAAK,IAAI,WAAWG,EAAK,KAAK,OAAQC,GAAO,EAAGC,GAAO,CAAC,CAAC,EAC9D,QAAS1tB,EAAI,EAAGA,EAAI0tB,EAAK1tB,GAAK,EAC5BgmB,EAAGhmB,CAAC,EAAIkrB,EAAGuC,EAAMztB,CAAC,EAClBgmB,EAAGhmB,EAAI,CAAC,EAAIkrB,EAAGuC,EAAMztB,EAAI,CAAC,EAC1BgmB,EAAGhmB,EAAI,CAAC,EAAIkrB,EAAGuC,EAAMztB,EAAI,CAAC,EAC1BgmB,EAAGhmB,EAAI,CAAC,EAAIkrB,EAAGuC,EAAMztB,EAAI,CAAC,EAE5BytB,GAAOC,CACR,CAED,QAAS50B,EAAI,EAAGA,EAAI00B,EAAK,KAAK,OAAQ10B,IAAKs0B,EAAK,KAAKI,EAAK,KAAK10B,CAAC,EAAE,IAAI,IAAI,CAC9E,KAEI,SAASkH,EAAI,EAAGA,EAAI8kB,EAAK,OAAQ9kB,IAAK,CAEpC,MAAMilB,EAAMH,EAAK9kB,CAAC,EACZ2tB,EAAQ,IAAI,YAAY1I,EAAI,IAAI,MAAM,EACtC2I,EAAK3I,EAAI,KAAK,MACdgI,EAAOU,EAAM,OACbE,EAAM,IAAI,WAAWZ,CAAI,EAC/BI,EAAK,KAAKQ,CAAG,EACb,QAAS/0B,EAAI,EAAGA,EAAIm0B,EAAMn0B,IAAK,CAC7B,MAAMjI,EAAI88B,EAAM70B,CAAC,EACjB,GAAIA,IAAM,GAAKjI,IAAM88B,EAAM70B,EAAI,CAAC,EAAG+0B,EAAI/0B,CAAC,EAAI+0B,EAAI/0B,EAAI,CAAC,UAC5CA,EAAI80B,GAAM/8B,IAAM88B,EAAM70B,EAAI80B,CAAE,EAAGC,EAAI/0B,CAAC,EAAI+0B,EAAI/0B,EAAI80B,CAAE,MACtD,CACH,IAAIE,EAAMX,EAAKt8B,CAAC,EAChB,GAAIi9B,IAAQ,OACVX,EAAKt8B,CAAC,EAAIi9B,EAAMV,EAAK,OACrBA,EAAK,KAAKv8B,CAAC,EACPu8B,EAAK,QAAU,KAAK,MAE1BS,EAAI/0B,CAAC,EAAIg1B,CACV,CACF,CACF,CAGH,MAAMjE,EAAKuD,EAAK,OACZvD,GAAM,KAAO6B,IAAe,KAC1B7B,GAAM,EAAGrf,EAAQ,EACZqf,GAAM,EAAGrf,EAAQ,EACjBqf,GAAM,GAAIrf,EAAQ,EACtBA,EAAQ,EACbA,EAAQ,KAAK,IAAIA,EAAOuiB,CAAO,GAGjC,QAAS/sB,EAAI,EAAGA,EAAI8kB,EAAK,OAAQ9kB,IAAK,CACpC,MAAMilB,EAAMH,EAAK9kB,CAAC,EAGZ4tB,EAAK3I,EAAI,KAAK,MACdyH,EAAKzH,EAAI,KAAK,OACpB,IAAI8I,EAAO9I,EAAI,IAEXQ,EAAM,EAAImI,EACVpI,EAAM,EACV,GAAIqE,GAAM,KAAO6B,IAAe,GAAO,CACrCjG,EAAM,KAAK,KAAMjb,EAAQojB,EAAM,CAAC,EAChC,MAAMjC,EAAO,IAAI,WAAWlG,EAAMiH,CAAE,EAC9BsB,EAAMX,EAAKrtB,CAAC,EAClB,QAASsmB,EAAI,EAAGA,EAAIoG,EAAIpG,IAAK,CAC3B,MAAMxtB,EAAIwtB,EAAIb,EACRtmB,EAAKmnB,EAAIsH,EACf,GAAIpjB,IAAU,EAAG,QAAS3E,EAAI,EAAGA,EAAI+nB,EAAI/nB,IAAK8lB,EAAK7yB,EAAI+M,CAAC,EAAImoB,EAAI7uB,EAAK0G,CAAC,UAC7D2E,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAI+nB,EAAI/nB,IACtB8lB,EAAK7yB,GAAK+M,GAAK,EAAE,GAAKmoB,EAAI7uB,EAAK0G,CAAC,GAAM,GAAKA,EAAI,GAAK,UAC/C2E,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAI+nB,EAAI/nB,IACtB8lB,EAAK7yB,GAAK+M,GAAK,EAAE,GAAKmoB,EAAI7uB,EAAK0G,CAAC,GAAM,GAAKA,EAAI,GAAK,UAC/C2E,IAAU,EACjB,QAAS3E,EAAI,EAAGA,EAAI+nB,EAAI/nB,IACtB8lB,EAAK7yB,GAAK+M,GAAK,EAAE,GAAKmoB,EAAI7uB,EAAK0G,CAAC,GAAM,GAAKA,EAAI,GAAK,CACzD,CACDkoB,EAAOpC,EACP/F,EAAQ,EACRJ,EAAM,CACP,SAAU0H,IAAa,IAASpI,EAAK,SAAW,EAAG,CAElD,MAAM6G,EAAO,IAAI,WAAWiC,EAAKlB,EAAK,CAAC,EACjCnH,EAAOqI,EAAKlB,EAClB,QAAS5zB,EAAI,EAAGA,EAAIysB,EAAMzsB,IAAK,CAC7B,MAAMktB,EAAKltB,EAAI,EACTstB,EAAKttB,EAAI,EACf6yB,EAAK3F,CAAE,EAAI+H,EAAK3H,CAAE,EAClBuF,EAAK3F,EAAK,CAAC,EAAI+H,EAAK3H,EAAK,CAAC,EAC1BuF,EAAK3F,EAAK,CAAC,EAAI+H,EAAK3H,EAAK,CAAC,CAC3B,CACD2H,EAAOpC,EACP/F,EAAQ,EACRJ,EAAM,EACNC,EAAM,EAAImI,CACX,CACD3I,EAAI,IAAM8I,EACV9I,EAAI,IAAMQ,EACVR,EAAI,IAAMO,CACX,CAED,MAAO,CAAE,MAAAI,EAAO,MAAApb,EAAO,KAAA4iB,EAAM,OAAQtI,CAAI,CAC3C,EACAD,EAAK,OAAO,QAAU,SAAUyG,EAAMpiB,EAAGY,EAAGmkB,EAAapB,EAASC,EAAY,CAU5E,MAAMhI,EAAO,CAAA,EACb,QAAS9kB,EAAI,EAAGA,EAAIsrB,EAAK,OAAQtrB,IAAK,CACpC,MAAM+tB,EAAO,IAAI,WAAWzC,EAAKtrB,CAAC,CAAC,EAC7BkuB,EAAS,IAAI,YAAYH,EAAK,MAAM,EAC1C,IAAIpC,EAEAwC,EAAK,EACLC,EAAK,EACLR,EAAK1kB,EACLwjB,EAAK5iB,EACLukB,EAAQJ,EAAc,EAAI,EAC9B,GAAIjuB,IAAM,EAAG,CACX,MAAMsuB,EACJxB,GAAcmB,GAAejuB,IAAM,GAAK8kB,EAAK9kB,EAAI,CAAC,EAAE,UAAY,EAC5D,EACA,EACN,IAAIuuB,EAAO,EACPC,EAAQ,IACZ,QAASC,EAAK,EAAGA,EAAKH,EAAMG,IAAM,CAEhC,MAAMC,EAAM,IAAI,YAAYpD,EAAKtrB,EAAI,EAAIyuB,CAAE,CAAC,EAC5C,IAAIE,EAAMzlB,EACN0lB,EAAM9kB,EACN2N,EAAM,GACNoX,EAAM,GACV,QAASvI,EAAI,EAAGA,EAAIxc,EAAGwc,IACrB,QAASzgB,EAAI,EAAGA,EAAIqD,EAAGrD,IAAK,CAC1B,MAAM/M,EAAIwtB,EAAIpd,EAAIrD,EACdqoB,EAAOp1B,CAAC,IAAM41B,EAAI51B,CAAC,IACjB+M,EAAI8oB,IAAKA,EAAM9oB,GACfA,EAAI4R,IAAKA,EAAM5R,GACfygB,EAAIsI,IAAKA,EAAMtI,GACfA,EAAIuI,IAAKA,EAAMvI,GAEtB,CACC7O,IAAQ,KAAIkX,EAAMC,EAAMnX,EAAMoX,EAAM,GACpChC,KACG8B,EAAM,KAAO,GAAGA,KAChBC,EAAM,KAAO,GAAGA,KAEvB,MAAME,GAASrX,EAAMkX,EAAM,IAAME,EAAMD,EAAM,GACzCE,EAAQN,IACVA,EAAQM,EACRP,EAAOE,EACPN,EAAKQ,EACLP,EAAKQ,EACLhB,EAAKnW,EAAMkX,EAAM,EACjBjC,EAAKmC,EAAMD,EAAM,EAEpB,CAGD,MAAMG,EAAO,IAAI,WAAWzD,EAAKtrB,EAAI,EAAIuuB,CAAI,CAAC,EAC1CA,IAAS,IAAGzJ,EAAK9kB,EAAI,CAAC,EAAE,QAAU,GAEtC2rB,EAAO,IAAI,WAAWiC,EAAKlB,EAAK,CAAC,EACjC7H,EAAK,UAAUkK,EAAM7lB,EAAGY,EAAG6hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,EAEpDC,EAAQxJ,EAAK,UAAUkJ,EAAM7kB,EAAGY,EAAG6hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,EAAI,EAAI,EAChEC,IAAU,EACZxJ,EAAK,OAAO,aAAakJ,EAAM7kB,EAAGY,EAAG6hB,EAAM,CACzC,EAAGwC,EACH,EAAGC,EACH,MAAOR,EACP,OAAQlB,CAClB,CAAS,EACE7H,EAAK,UAAUkJ,EAAM7kB,EAAGY,EAAG6hB,EAAMiC,EAAIlB,EAAI,CAACyB,EAAI,CAACC,EAAI,CAAC,CAC1D,MAAMzC,EAAOoC,EAAK,MAAM,CAAC,EAE1BjJ,EAAK,KAAK,CACR,KAAM,CAAE,EAAGqJ,EAAI,EAAGC,EAAI,MAAOR,EAAI,OAAQlB,CAAI,EAC7C,IAAKf,EACL,MAAA0C,EACA,QAAS,CACf,CAAK,CACF,CAED,GAAIJ,EACF,QAASjuB,EAAI,EAAGA,EAAI8kB,EAAK,OAAQ9kB,IAAK,CACpC,MAAMilB,EAAMH,EAAK9kB,CAAC,EAClB,GAAIilB,EAAI,QAAU,EAAG,SACrB,MAAM+J,EAAK/J,EAAI,KACTgK,EAAKnK,EAAK9kB,EAAI,CAAC,EAAE,KACjBkvB,EAAM,KAAK,IAAIF,EAAG,EAAGC,EAAG,CAAC,EACzBE,EAAM,KAAK,IAAIH,EAAG,EAAGC,EAAG,CAAC,EACzBG,EAAM,KAAK,IAAIJ,EAAG,EAAIA,EAAG,MAAOC,EAAG,EAAIA,EAAG,KAAK,EAC/CI,EAAM,KAAK,IAAIL,EAAG,EAAIA,EAAG,OAAQC,EAAG,EAAIA,EAAG,MAAM,EACjDpG,EAAI,CAAE,EAAGqG,EAAK,EAAGC,EAAK,MAAOC,EAAMF,EAAK,OAAQG,EAAMF,CAAG,EAE/DrK,EAAK9kB,EAAI,CAAC,EAAE,QAAU,EAClBA,EAAI,IAAM,GACZ6kB,EAAK,OAAO,aAAayG,EAAMpiB,EAAGY,EAAGgb,EAAM9kB,EAAI,EAAG6oB,EAAGgE,CAAO,EAC9DhI,EAAK,OAAO,aAAayG,EAAMpiB,EAAGY,EAAGgb,EAAM9kB,EAAG6oB,EAAGgE,CAAO,CACzD,CAQH,OAAO/H,CACT,EACAD,EAAK,OAAO,aAAe,SAAUyG,EAAMpiB,EAAGY,EAAGgb,EAAMhsB,EAAG+vB,EAAGgE,EAAS,CACpE,MAAMyC,EAAK,WACLC,EAAM,YACNR,EAAO,IAAIO,EAAGhE,EAAKxyB,EAAI,CAAC,CAAC,EACzB02B,EAAS,IAAID,EAAIjE,EAAKxyB,EAAI,CAAC,CAAC,EAC5B6yB,EAAO7yB,EAAI,EAAIwyB,EAAK,OAAS,IAAIgE,EAAGhE,EAAKxyB,EAAI,CAAC,CAAC,EAAI,KACnDi1B,EAAO,IAAIuB,EAAGhE,EAAKxyB,CAAC,CAAC,EACrBo1B,EAAS,IAAIqB,EAAIxB,EAAK,MAAM,EAElC,IAAIY,EAAMzlB,EACN0lB,EAAM9kB,EACN2N,EAAM,GACNoX,EAAM,GACV,QAAS,EAAI,EAAG,EAAIhG,EAAE,OAAQ,IAC5B,QAAShjB,EAAI,EAAGA,EAAIgjB,EAAE,MAAOhjB,IAAK,CAChC,MAAM4pB,EAAK5G,EAAE,EAAIhjB,EACX6pB,EAAK7G,EAAE,EAAI,EACX7oB,EAAI0vB,EAAKxmB,EAAIumB,EACb5F,EAAKqE,EAAOluB,CAAC,EAIf6pB,IAAO,GACN/E,EAAKhsB,EAAI,CAAC,EAAE,UAAY,GACvB02B,EAAOxvB,CAAC,IAAM6pB,IACb8B,IAAS,MAAQA,EAAK3rB,EAAI,EAAI,CAAC,IAAM,KAGtCyvB,EAAKd,IAAKA,EAAMc,GAChBA,EAAKhY,IAAKA,EAAMgY,GAChBC,EAAKd,IAAKA,EAAMc,GAChBA,EAAKb,IAAKA,EAAMa,GAEvB,CACCjY,IAAQ,KAAIkX,EAAMC,EAAMnX,EAAMoX,EAAM,GACpChC,KACG8B,EAAM,KAAO,GAAGA,KAChBC,EAAM,KAAO,GAAGA,KAEvB/F,EAAI,CAAE,EAAG8F,EAAK,EAAGC,EAAK,MAAOnX,EAAMkX,EAAM,EAAG,OAAQE,EAAMD,EAAM,CAAC,EAEjE,MAAMvH,EAAKvC,EAAKhsB,CAAC,EACjBuuB,EAAG,KAAOwB,EACVxB,EAAG,MAAQ,EACXA,EAAG,IAAM,IAAI,WAAWwB,EAAE,MAAQA,EAAE,OAAS,CAAC,EAC1C/D,EAAKhsB,EAAI,CAAC,EAAE,UAAY,GAC1B+rB,EAAK,UAAUkK,EAAM7lB,EAAGY,EAAGud,EAAG,IAAKwB,EAAE,MAAOA,EAAE,OAAQ,CAACA,EAAE,EAAG,CAACA,EAAE,EAAG,CAAC,EACnEhE,EAAK,OAAO,aAAakJ,EAAM7kB,EAAGY,EAAGud,EAAG,IAAKwB,CAAC,GACzChE,EAAK,UAAUkJ,EAAM7kB,EAAGY,EAAGud,EAAG,IAAKwB,EAAE,MAAOA,EAAE,OAAQ,CAACA,EAAE,EAAG,CAACA,EAAE,EAAG,CAAC,CAC5E,EACAhE,EAAK,OAAO,aAAe,SAAUkJ,EAAM7kB,EAAGY,EAAG6hB,EAAMgE,EAAK,CAC1D9K,EAAK,UAAUkJ,EAAM7kB,EAAGY,EAAG6hB,EAAMgE,EAAI,MAAOA,EAAI,OAAQ,CAACA,EAAI,EAAG,CAACA,EAAI,EAAG,CAAC,CAC3E,EAEA9K,EAAK,OAAO,YAAc,SAAUE,EAAKjb,EAAG0b,EAAKC,EAAK3zB,EAAM06B,EAAQC,EAAW,CAC7E,MAAMmD,EAAM,CAAA,EACZ,IAAIC,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,CAAC,EACrBrD,IAAW,GAAIqD,EAAO,CAACrD,CAAM,GACxB1iB,EAAI2b,EAAM,KAAUD,IAAQ,KAAGqK,EAAO,CAAC,CAAC,GACjD,IAAIlzB,EACA8vB,IAAW9vB,EAAO,CAAE,MAAO,CAAC,GAEhC,MAAMmzB,EAAOh+B,EAAK,OAAS,KAAQ0J,IAAQ,KAAOA,GAAOopB,GAEzD,QAAS9rB,EAAI,EAAGA,EAAI+2B,EAAK,OAAQ/2B,IAAK,CACpC,QAASwtB,EAAI,EAAGA,EAAIxc,EAAGwc,IACrBzB,EAAK,OAAO,YAAY/yB,EAAMizB,EAAKuB,EAAGb,EAAKD,EAAKqK,EAAK/2B,CAAC,CAAC,EACzD82B,EAAI,KAAKE,EAAK,QAAQh+B,EAAM6K,CAAI,CAAC,CAClC,CAED,IAAIqpB,EACA+J,EAAQ,IACZ,QAASj3B,EAAI,EAAGA,EAAI82B,EAAI,OAAQ92B,IAC1B82B,EAAI92B,CAAC,EAAE,OAASi3B,IAClB/J,EAAKltB,EACLi3B,EAAQH,EAAI92B,CAAC,EAAE,QAEnB,OAAO82B,EAAI5J,CAAE,CACf,EACAnB,EAAK,OAAO,YAAc,SAAU/yB,EAAMizB,EAAKuB,EAAGb,EAAKD,EAAK3rB,EAAM,CAChE,MAAMf,EAAIwtB,EAAIb,EACd,IAAIiB,EAAK5tB,EAAIwtB,EACb,MAAM4D,EAAQrF,EAAK,OAAO,OAI1B,GAHA/yB,EAAK40B,CAAE,EAAI7sB,EACX6sB,IAEI7sB,IAAS,EACX,GAAI4rB,EAAM,IAAK,QAAS5f,EAAI,EAAGA,EAAI4f,EAAK5f,IAAK/T,EAAK40B,EAAK7gB,CAAC,EAAIkf,EAAIjsB,EAAI+M,CAAC,OAChE/T,EAAK,IAAI,IAAI,WAAWizB,EAAI,OAAQjsB,EAAG2sB,CAAG,EAAGiB,CAAE,UAC3C7sB,IAAS,EAAG,CACrB,QAASgM,EAAI,EAAGA,EAAI2f,EAAK3f,IAAK/T,EAAK40B,EAAK7gB,CAAC,EAAIkf,EAAIjsB,EAAI+M,CAAC,EACtD,QAASA,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACzB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,EAAIkf,EAAIjsB,EAAI+M,EAAI2f,CAAG,EAAI,IAAO,GAC7D,SAAac,IAAM,EAAG,CAClB,QAASzgB,EAAI,EAAGA,EAAI2f,EAAK3f,IAAK/T,EAAK40B,EAAK7gB,CAAC,EAAIkf,EAAIjsB,EAAI+M,CAAC,EAEtD,GAAIhM,IAAS,EAAG,QAASgM,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IAAK/T,EAAK40B,EAAK7gB,CAAC,EAAIkf,EAAIjsB,EAAI+M,CAAC,EACxE,GAAIhM,IAAS,EACX,QAASgM,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACzB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,GAAKkf,EAAIjsB,EAAI+M,EAAI2f,CAAG,GAAK,GAAK,IAAO,IAClE,GAAI3rB,IAAS,EACX,QAASgM,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACzB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,EAAIqkB,EAAMnF,EAAIjsB,EAAI+M,EAAI2f,CAAG,EAAG,EAAG,CAAC,EAAI,IAAO,GAC5E,KAAS,CACL,GAAI3rB,IAAS,EACX,QAASgM,EAAI,EAAGA,EAAI4f,EAAK5f,IACvB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,EAAI,IAAMkf,EAAIjsB,EAAI+M,EAAI4f,CAAG,EAAK,IAE3D,GAAI5rB,IAAS,EAAG,CACd,QAASgM,EAAI,EAAGA,EAAI2f,EAAK3f,IACvB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,EAAI,KAAOkf,EAAIjsB,EAAI+M,EAAI4f,CAAG,GAAK,GAAM,IAChE,QAAS5f,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACzB/T,EAAK40B,EAAK7gB,CAAC,EACRkf,EAAIjsB,EAAI+M,CAAC,EAAI,KAAQkf,EAAIjsB,EAAI+M,EAAI4f,CAAG,EAAIV,EAAIjsB,EAAI+M,EAAI2f,CAAG,GAAM,GAC9D,GACL,CACD,GAAI3rB,IAAS,EAAG,CACd,QAASgM,EAAI,EAAGA,EAAI2f,EAAK3f,IACvB/T,EAAK40B,EAAK7gB,CAAC,EAAKkf,EAAIjsB,EAAI+M,CAAC,EAAI,IAAMqkB,EAAM,EAAGnF,EAAIjsB,EAAI+M,EAAI4f,CAAG,EAAG,CAAC,EAAK,IACtE,QAAS5f,EAAI2f,EAAK3f,EAAI4f,EAAK5f,IACzB/T,EAAK40B,EAAK7gB,CAAC,EACRkf,EAAIjsB,EAAI+M,CAAC,EACR,IACAqkB,EAAMnF,EAAIjsB,EAAI+M,EAAI2f,CAAG,EAAGT,EAAIjsB,EAAI+M,EAAI4f,CAAG,EAAGV,EAAIjsB,EAAI+M,EAAI2f,EAAMC,CAAG,CAAC,EAClE,GACL,CACF,CACH,EAEAZ,EAAK,IAAM,CACT,MAAQ,UAAY,CAClB,MAAMrnB,EAAM,IAAI,YAAY,GAAG,EAC/B,QAAS,EAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,IAAI3M,EAAI,EACR,QAASI,EAAI,EAAGA,EAAI,EAAGA,IACjBJ,EAAI,EAAGA,EAAI,WAAcA,IAAM,EAC9BA,EAAIA,IAAM,EAEjB2M,EAAI,CAAC,EAAI3M,CACV,CACD,OAAO2M,CACX,EAAM,EACJ,OAAQ,SAAU3M,EAAG6K,EAAKkB,EAAKc,EAAK,CAClC,QAAS5E,EAAI,EAAGA,EAAI4E,EAAK5E,IACvBjI,EAAIg0B,EAAK,IAAI,OAAOh0B,EAAI6K,EAAIkB,EAAM9D,CAAC,GAAK,GAAI,EAAKjI,IAAM,EACzD,OAAOA,CACR,EACD,IAAK,SAAU8M,EAAG7B,EAAG/C,EAAG,CACtB,OAAO8rB,EAAK,IAAI,OAAO,WAAYlnB,EAAG7B,EAAG/C,CAAC,EAAI,UAC/C,CACH,EAEA8rB,EAAK,SAAW,SAAU0I,EAAMhC,EAAI,CAClC,MAAMyE,EAAO,IAAI,WAAWzC,CAAI,EAC1B5B,EAAOqE,EAAK,MAAM,CAAC,EACnBC,EAAS,IAAI,YAAYtE,EAAK,MAAM,EAEpCuE,EAAKrL,EAAK,SAAS,UAAU8G,EAAMJ,CAAE,EACrCtP,EAAOiU,EAAG,CAAC,EACXC,EAAQD,EAAG,CAAC,EAEZE,EAAWvL,EAAK,SAAS,SACzByF,EAAK0F,EACL7J,EAAK8J,EACLvyB,EAAM4sB,EAAG,OAET+C,EAAO,IAAI,WAAW2C,EAAK,QAAU,CAAC,EAC5C,IAAIK,EACJ,GAAIL,EAAK,OAAS,IAEhB,QAASl3B,EAAI,EAAGA,EAAI4E,EAAK5E,GAAK,EAAG,CAC/B,MAAM+vB,EAAIyB,EAAGxxB,CAAC,EAAK,mBACb,EAAIwxB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KACrB6E,EAAI2sB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KACrB6I,EAAI2oB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KAE3Bu3B,EAAKxL,EAAK,SAAS,WAAW5I,EAAM4M,EAAG,EAAGlrB,EAAGgE,CAAC,EAC9C0rB,EAAKv0B,GAAK,CAAC,EAAIu3B,EAAG,IAClBlK,EAAGrtB,GAAK,CAAC,EAAIu3B,EAAG,IAAI,IACrB,KAED,SAASv3B,EAAI,EAAGA,EAAI4E,EAAK5E,GAAK,EAAG,CAC/B,MAAM+vB,EAAIyB,EAAGxxB,CAAC,EAAK,mBACb,EAAIwxB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KACrB6E,EAAI2sB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KACrB6I,EAAI2oB,EAAGxxB,EAAI,CAAC,GAAK,EAAI,KAG3B,IADAu3B,EAAKpU,EACEoU,EAAG,MACRA,EAAKD,EAASC,EAAG,IAAKxH,EAAG,EAAGlrB,EAAGgE,CAAC,GAAK,EAAI0uB,EAAG,KAAOA,EAAG,MACxDhD,EAAKv0B,GAAK,CAAC,EAAIu3B,EAAG,IAClBlK,EAAGrtB,GAAK,CAAC,EAAIu3B,EAAG,IAAI,IACrB,CACH,MAAO,CAAE,KAAM1E,EAAK,OAAQ,KAAA0B,EAAM,KAAM8C,EAC1C,EAEAtL,EAAK,SAAS,UAAY,SAAU8G,EAAMJ,EAAI5a,EAAK,CAC7CA,IAAQ,OAAMA,EAAM,MACxB,MAAMsf,EAAS,IAAI,YAAYtE,EAAK,MAAM,EAEpC1P,EAAO,CACX,GAAI,EACJ,GAAI0P,EAAK,OACT,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACX,EACE1P,EAAK,IAAM4I,EAAK,SAAS,MAAM8G,EAAM1P,EAAK,GAAIA,EAAK,EAAE,EACrDA,EAAK,IAAM4I,EAAK,SAAS,OAAO5I,EAAK,GAAG,EACxC,MAAMkU,EAAQ,CAAClU,CAAI,EAEnB,KAAOkU,EAAM,OAAS5E,GAAI,CACxB,IAAI+E,EAAO,EACPC,EAAK,EACT,QAASz3B,EAAI,EAAGA,EAAIq3B,EAAM,OAAQr3B,IAC5Bq3B,EAAMr3B,CAAC,EAAE,IAAI,EAAIw3B,IACnBA,EAAOH,EAAMr3B,CAAC,EAAE,IAAI,EACpBy3B,EAAKz3B,GAET,GAAIw3B,EAAO3f,EAAK,MAChB,MAAM5F,EAAOolB,EAAMI,CAAE,EAEfhK,EAAK1B,EAAK,SAAS,YACvB8G,EACAsE,EACAllB,EAAK,GACLA,EAAK,GACLA,EAAK,IAAI,EACTA,EAAK,IAAI,MACf,EAEI,GADgBA,EAAK,IAAMwb,GAAMxb,EAAK,IAAMwb,EAC/B,CACXxb,EAAK,IAAI,EAAI,EACb,QACD,CAED,MAAMylB,EAAK,CACT,GAAIzlB,EAAK,GACT,GAAIwb,EACJ,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACb,EACIiK,EAAG,IAAM3L,EAAK,SAAS,MAAM8G,EAAM6E,EAAG,GAAIA,EAAG,EAAE,EAC/CA,EAAG,IAAM3L,EAAK,SAAS,OAAO2L,EAAG,GAAG,EACpC,MAAMC,EAAK,CACT,GAAIlK,EACJ,GAAIxb,EAAK,GACT,IAAK,KACL,IAAK,KACL,KAAM,EACN,KAAM,KACN,MAAO,IACb,EACI0lB,EAAG,IAAM,CAAE,EAAG,CAAE,EAAE,EAAG,CAAE,EAAE,EAAG1lB,EAAK,IAAI,EAAIylB,EAAG,IAAI,CAAC,EACjD,QAAS13B,EAAI,EAAGA,EAAI,GAAIA,IAAK23B,EAAG,IAAI,EAAE33B,CAAC,EAAIiS,EAAK,IAAI,EAAEjS,CAAC,EAAI03B,EAAG,IAAI,EAAE13B,CAAC,EACrE,QAASA,EAAI,EAAGA,EAAI,EAAGA,IAAK23B,EAAG,IAAI,EAAE33B,CAAC,EAAIiS,EAAK,IAAI,EAAEjS,CAAC,EAAI03B,EAAG,IAAI,EAAE13B,CAAC,EACpE23B,EAAG,IAAM5L,EAAK,SAAS,OAAO4L,EAAG,GAAG,EAEpC1lB,EAAK,KAAOylB,EACZzlB,EAAK,MAAQ0lB,EACbN,EAAMI,CAAE,EAAIC,EACZL,EAAM,KAAKM,CAAE,CACd,CACDN,EAAM,KAAK,SAAUxuB,EAAGhE,EAAG,CACzB,OAAOA,EAAE,IAAI,EAAIgE,EAAE,IAAI,CAC3B,CAAG,EACD,QAAS7I,EAAI,EAAGA,EAAIq3B,EAAM,OAAQr3B,IAAKq3B,EAAMr3B,CAAC,EAAE,IAAMA,EACtD,MAAO,CAACmjB,EAAMkU,CAAK,CACrB,EAEAtL,EAAK,SAAS,WAAa,SAAUwL,EAAIxH,EAAGwD,EAAG1uB,EAAGgE,EAAG,CACnD,GAAI0uB,EAAG,MAAQ,KACb,OAAAA,EAAG,KAAOxL,EAAK,SAAS,KAAKwL,EAAG,IAAI,EAAGxH,EAAGwD,EAAG1uB,EAAGgE,CAAC,EAC1C0uB,EAET,MAAMD,EAAWvL,EAAK,SAAS,SAASwL,EAAG,IAAKxH,EAAGwD,EAAG1uB,EAAGgE,CAAC,EAE1D,IAAI+uB,EAAQL,EAAG,KACXM,EAAQN,EAAG,MACXD,EAAW,IACbM,EAAQL,EAAG,MACXM,EAAQN,EAAG,MAGb,MAAMG,EAAK3L,EAAK,SAAS,WAAW6L,EAAO7H,EAAGwD,EAAG1uB,EAAGgE,CAAC,EACrD,GAAI6uB,EAAG,MAAQJ,EAAWA,EAAU,OAAOI,EAC3C,MAAMC,EAAK5L,EAAK,SAAS,WAAW8L,EAAO9H,EAAGwD,EAAG1uB,EAAGgE,CAAC,EACrD,OAAO8uB,EAAG,KAAOD,EAAG,KAAOC,EAAKD,CAClC,EACA3L,EAAK,SAAS,SAAW,SAAU+L,EAAK/H,EAAGwD,EAAG1uB,EAAGgE,EAAG,CAClD,MAAMhU,EAAIijC,EAAI,EACd,OAAOjjC,EAAE,CAAC,EAAIk7B,EAAIl7B,EAAE,CAAC,EAAI0+B,EAAI1+B,EAAE,CAAC,EAAIgQ,EAAIhQ,EAAE,CAAC,EAAIgU,EAAIivB,EAAI,GACzD,EACA/L,EAAK,SAAS,KAAO,SAAU5N,EAAG4R,EAAGwD,EAAG1uB,EAAGgE,EAAG,CAC5C,MAAMkvB,EAAKhI,EAAI5R,EAAE,CAAC,EACZ6Z,EAAKzE,EAAIpV,EAAE,CAAC,EACZ8Z,EAAKpzB,EAAIsZ,EAAE,CAAC,EACZ+Z,EAAKrvB,EAAIsV,EAAE,CAAC,EAClB,OAAO4Z,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,CAC5C,EAEAnM,EAAK,SAAS,YAAc,SAAU8G,EAAMsE,EAAQttB,EAAIC,EAAIjV,EAAGsjC,EAAK,CAClE,MAAMC,EAASrM,EAAK,SAAS,OAG7B,IAFAjiB,GAAM,EAECD,EAAKC,GAAI,CACd,KAAOsuB,EAAOvF,EAAMhpB,EAAIhV,CAAC,GAAKsjC,GAAKtuB,GAAM,EACzC,KAAOuuB,EAAOvF,EAAM/oB,EAAIjV,CAAC,EAAIsjC,GAAKruB,GAAM,EACxC,GAAID,GAAMC,EAAI,MAEd,MAAMrF,EAAI0yB,EAAOttB,GAAM,CAAC,EACxBstB,EAAOttB,GAAM,CAAC,EAAIstB,EAAOrtB,GAAM,CAAC,EAChCqtB,EAAOrtB,GAAM,CAAC,EAAIrF,EAElBoF,GAAM,EACNC,GAAM,CACP,CACD,KAAOsuB,EAAOvF,EAAMhpB,EAAIhV,CAAC,EAAIsjC,GAAKtuB,GAAM,EACxC,OAAOA,EAAK,CACd,EACAkiB,EAAK,SAAS,OAAS,SAAU8G,EAAM7yB,EAAGnL,EAAG,CAC3C,OACEg+B,EAAK7yB,CAAC,EAAInL,EAAE,CAAC,EACbg+B,EAAK7yB,EAAI,CAAC,EAAInL,EAAE,CAAC,EACjBg+B,EAAK7yB,EAAI,CAAC,EAAInL,EAAE,CAAC,EACjBg+B,EAAK7yB,EAAI,CAAC,EAAInL,EAAE,CAAC,CAErB,EACAk3B,EAAK,SAAS,MAAQ,SAAU8G,EAAMhpB,EAAIC,EAAI,CAC5C,MAAMolB,EAAI,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnDje,EAAI,CAAC,EAAG,EAAG,EAAG,CAAC,EACf+d,EAAKllB,EAAKD,GAAO,EACvB,QAAS7J,EAAI6J,EAAI7J,EAAI8J,EAAI9J,GAAK,EAAG,CAC/B,MAAM+vB,EAAI8C,EAAK7yB,CAAC,EAAK,mBACfuzB,EAAIV,EAAK7yB,EAAI,CAAC,GAAK,EAAI,KACvB6E,EAAIguB,EAAK7yB,EAAI,CAAC,GAAK,EAAI,KACvB6I,EAAIgqB,EAAK7yB,EAAI,CAAC,GAAK,EAAI,KAC7BiR,EAAE,CAAC,GAAK8e,EACR9e,EAAE,CAAC,GAAKsiB,EACRtiB,EAAE,CAAC,GAAKpM,EACRoM,EAAE,CAAC,GAAKpI,EAERqmB,EAAE,CAAC,GAAKa,EAAIA,EACZb,EAAE,CAAC,GAAKa,EAAIwD,EACZrE,EAAE,CAAC,GAAKa,EAAIlrB,EACZqqB,EAAE,CAAC,GAAKa,EAAIlnB,EACZqmB,EAAE,CAAC,GAAKqE,EAAIA,EACZrE,EAAE,CAAC,GAAKqE,EAAI1uB,EACZqqB,EAAE,CAAC,GAAKqE,EAAI1qB,EACZqmB,EAAE,EAAE,GAAKrqB,EAAIA,EACbqqB,EAAE,EAAE,GAAKrqB,EAAIgE,EACbqmB,EAAE,EAAE,GAAKrmB,EAAIA,CACd,CACD,OAAAqmB,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,CAAC,EAAIA,EAAE,CAAC,EACVA,EAAE,EAAE,EAAIA,EAAE,CAAC,EACXA,EAAE,EAAE,EAAIA,EAAE,CAAC,EACXA,EAAE,EAAE,EAAIA,EAAE,EAAE,EAEL,CAAE,EAAAA,EAAG,EAAAje,EAAG,EAAA+d,EACjB,EACAjD,EAAK,SAAS,OAAS,SAAUsM,EAAO,CACtC,MAAMnJ,EAAImJ,EAAM,EACVpnB,EAAIonB,EAAM,EACVrJ,EAAIqJ,EAAM,EAGVC,EAAKrnB,EAAE,CAAC,EACRsnB,EAAKtnB,EAAE,CAAC,EACRunB,EAAKvnB,EAAE,CAAC,EACRwnB,EAAKxnB,EAAE,CAAC,EACRynB,EAAK1J,IAAM,EAAI,EAAI,EAAIA,EACvB2J,EAAK,CACTzJ,EAAE,CAAC,EAAIoJ,EAAKA,EAAKI,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKC,EAAKG,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKE,EAAKE,EACjBxJ,EAAE,CAAC,EAAIoJ,EAAKG,EAAKC,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKD,EAAKI,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKA,EAAKG,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKC,EAAKE,EACjBxJ,EAAE,CAAC,EAAIqJ,EAAKE,EAAKC,EACjBxJ,EAAE,CAAC,EAAIsJ,EAAKF,EAAKI,EACjBxJ,EAAE,CAAC,EAAIsJ,EAAKD,EAAKG,EACjBxJ,EAAE,EAAE,EAAIsJ,EAAKA,EAAKE,EAClBxJ,EAAE,EAAE,EAAIsJ,EAAKC,EAAKC,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKH,EAAKI,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKF,EAAKG,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKD,EAAKE,EAClBxJ,EAAE,EAAE,EAAIuJ,EAAKA,EAAKC,CACtB,EAEQjJ,EAAIkJ,EACJjJ,EAAI3D,EAAK,GACf,IAAIlnB,EAAI,CAAC,KAAK,OAAM,EAAI,KAAK,SAAU,KAAK,OAAQ,EAAE,KAAK,OAAQ,CAAA,EAC/D4yB,EAAK,EACLmB,EAAM,EAEV,GAAI5J,IAAM,EACR,QAAShvB,EAAI,EAAGA,EAAI,KAClB6E,EAAI6qB,EAAE,QAAQD,EAAG5qB,CAAC,EAClB+zB,EAAM,KAAK,KAAKlJ,EAAE,IAAI7qB,EAAGA,CAAC,CAAC,EAC3BA,EAAI6qB,EAAE,IAAI,EAAIkJ,EAAK/zB,CAAC,EAChB,EAAA7E,IAAM,GAAK,KAAK,IAAI44B,EAAMnB,CAAE,EAAI,OAJdz3B,IAKtBy3B,EAAKmB,EAET,MAAMza,EAAI,CAACma,EAAKI,EAAIH,EAAKG,EAAIF,EAAKE,EAAID,EAAKC,CAAE,EACvCG,EAASnJ,EAAE,IAAIA,EAAE,IAAI,IAAKvR,CAAC,EAAGtZ,CAAC,EAErC,MAAO,CACL,IAAK8zB,EACL,EAAAxa,EACA,EAAGtZ,EACH,EAAG4yB,EACH,OAAAoB,EACA,IAAKnJ,EAAE,IAAI7qB,EAAGsZ,CAAC,EACf,MACI,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,GACzB,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,GAC1B,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,EAC1B,KAAK,MAAM,IAAMA,EAAE,CAAC,CAAC,GAAK,KAC7B,CACN,CACA,EACA4N,EAAK,GAAK,CACR,QAAS,SAAU9a,EAAG7Y,EAAG,CACvB,MAAO,CACL6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EACpD6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EACpD6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,CAAC,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,EACtD6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,EAAI6Y,EAAE,EAAE,EAAI7Y,EAAE,CAAC,CAC9D,CACG,EACD,IAAK,SAAU2U,EAAGygB,EAAG,CACnB,OAAOzgB,EAAE,CAAC,EAAIygB,EAAE,CAAC,EAAIzgB,EAAE,CAAC,EAAIygB,EAAE,CAAC,EAAIzgB,EAAE,CAAC,EAAIygB,EAAE,CAAC,EAAIzgB,EAAE,CAAC,EAAIygB,EAAE,CAAC,CAC5D,EACD,IAAK,SAAU3kB,EAAG2kB,EAAG,CACnB,MAAO,CAAC3kB,EAAI2kB,EAAE,CAAC,EAAG3kB,EAAI2kB,EAAE,CAAC,EAAG3kB,EAAI2kB,EAAE,CAAC,EAAG3kB,EAAI2kB,EAAE,CAAC,CAAC,CAC/C,CACH,EAEAzB,EAAK,OAAO,WAAa,SAAUyG,EAAM,CACvC,IAAIsG,EAAO,EACX,QAAS94B,EAAI,EAAGA,EAAIwyB,EAAK,OAAQxyB,IAAK84B,GAAQtG,EAAKxyB,CAAC,EAAE,WACtD,MAAM6yB,EAAO,IAAI,WAAWiG,CAAI,EAChC,IAAIC,EAAO,EACX,QAAS/4B,EAAI,EAAGA,EAAIwyB,EAAK,OAAQxyB,IAAK,CACpC,MAAMisB,EAAM,IAAI,WAAWuG,EAAKxyB,CAAC,CAAC,EAC5Bg5B,EAAK/M,EAAI,OACf,QAAS/kB,EAAI,EAAGA,EAAI8xB,EAAI9xB,GAAK,EAAG,CAC9B,IAAI6oB,EAAI9D,EAAI/kB,CAAC,EACTqsB,EAAItH,EAAI/kB,EAAI,CAAC,EACbrC,EAAIonB,EAAI/kB,EAAI,CAAC,EACjB,MAAM2B,EAAIojB,EAAI/kB,EAAI,CAAC,EACf2B,IAAM,IAAGknB,EAAIwD,EAAI1uB,EAAI,GACzBguB,EAAKkG,EAAO7xB,CAAC,EAAI6oB,EACjB8C,EAAKkG,EAAO7xB,EAAI,CAAC,EAAIqsB,EACrBV,EAAKkG,EAAO7xB,EAAI,CAAC,EAAIrC,EACrBguB,EAAKkG,EAAO7xB,EAAI,CAAC,EAAI2B,CACtB,CACDkwB,GAAQC,CACT,CACD,OAAOnG,EAAK,MACd,ECt8Da,MAAAoG,GAAgB,CAC3BC,EACAxkC,IACG,CACG,MAAAykC,EAAQ,IAAI,MAClBA,EAAM,OAAS,UAAY,CACtBzkC,EAAA,KAAM,CAAE,MAAOykC,EAAM,MAAO,OAAQA,EAAM,OAAQ,CAAA,EAEjDA,EAAA,QAAU,SAAUthB,EAAK,CAC7BnjB,EAAGmjB,EAAK,IAAI,CAAA,EAEdshB,EAAM,IAAMD,CACd,EAGaE,GAAa,CACxBjkC,EACA2M,IACG,CACE3M,GACH2M,EAAS,WAAY,IAAI,EAE3B,QAAS9B,EAAI,EAAGC,EAAI9K,EAAM,OAAQ6K,EAAIC,EAAGD,IAAK,CACtC,MAAA3K,EAAOF,EAAM6K,CAAC,EACd,CAAE,KAAAe,CAAS,EAAA1L,EACXgkC,EAAUt4B,EAAK,MAAM,GAAG,EAC1B,GAAAs4B,EAAQ,CAAC,IAAM,QAAS,OAC5B,IAAIC,EAAWD,EAAQ,CAAC,EAAE,YAAY,EAChC,MAAA5jC,EAAS,IAAI,WACZA,EAAA,OAAS,SAAUZ,EAAQ,CAC1B,MAAA4B,EAAS5B,EAAE,OAAO,OAClB0kC,EAAYC,GAAa/iC,CAAM,EACjC8iC,IACSD,EAAAC,GAEb,MAAM3iC,EAAO,IAAI,KAAK,CAACH,CAAM,CAAC,EACVgjC,GAAA7iC,EAAM,SAAU8iC,EAAwB,CACtDA,EACYT,GAAAS,EAAUC,GAAY,CAClC,GAAIA,EAAS,CACX,MAAMC,EAAYC,GAChBH,EACAC,EAAQ,MACRA,EAAQ,MAAA,EAEV,GAAIC,EAAW,CACb,MAAME,EAAmB,CACvB,KAAMzkC,EAAK,KACX,SAAAikC,EACA,KAAMjkC,EAAK,KACX,MAAOskC,EAAQ,MACf,OAAQA,EAAQ,OAChB,OAAQD,EACR,UAAAE,EACA,KAAAhjC,CAAA,EAEFkL,EAAS,KAAMg4B,CAAO,CAAA,MAEtBh4B,EAAS,eAAgB,IAAI,CAC/B,MAEAA,EAAS,oBAAqB,IAAI,CACpC,CACD,EAEDA,EAAS,eAAgB,IAAI,CAC/B,CACD,CAAA,EAEHrM,EAAO,kBAAkBJ,CAAI,CAC/B,CACF,EAGamkC,GAAgB/iC,GAAwB,CACnD,IAAI6iC,EAAW,GACf,GAAI7iC,EAAQ,CAEV,MAAMsjC,EADO,IAAI,SAAStjC,CAAM,EACR,UAAU,EAAG,EAAK,EAE1C,OADiB,OAAOsjC,CAAU,EAAE,SAAS,EAAE,EAAE,cAC/B,CAChB,IAAK,WACQT,EAAA,MACX,MACF,IAAK,WACL,IAAK,WACL,IAAK,WACL,IAAK,WACQA,EAAA,OACX,MACF,IAAK,WACQA,EAAA,MACX,MACF,IAAK,WACQA,EAAA,MACX,MACF,IAAK,WACQA,EAAA,OACX,KAGJ,CACF,CACO,OAAAA,CACT,EAGaG,GAAsB,CACjC77B,EACAlJ,IACG,CACH,GAAI,CAACkJ,EAAK,CACRlJ,EAAG,SAAU,IAAI,EACjB,MACF,CACM,MAAAe,EAAS,IAAI,WACZA,EAAA,OAAS,SAAUZ,EAAG,CACvBA,EAAE,OACDH,EAAA,KAAMG,EAAE,OAAO,MAAgB,EAElCH,EAAG,aAAc,IAAI,CACvB,EAEFe,EAAO,cAAcmI,CAAG,CAC1B,EAGai8B,GAAmB,CAC9BX,EACAz5B,EACA/E,IACG,CACC,GAAAw+B,GAAUz5B,GAAS/E,EAAQ,CACvB,MAAAuxB,EAAM,IAAI,MAChBA,EAAI,IAAMiN,EACJ,MAAA12B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,UAAUwpB,EAAK,EAAG,EAAGxsB,EAAO/E,CAAM,EACpB+H,EAAI,aAAa,EAAG,EAAGhD,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAGas/B,GAA0B,CACrCC,EACAx6B,EAAQ,EACR/E,EAAS,IACN,CACC,GAAAu/B,GAASx6B,GAAS/E,EAAQ,CACtB,MAAA8H,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,UAAUw3B,EAAO,EAAG,EAAGx6B,EAAO/E,CAAM,EACtB+H,EAAI,aAAa,EAAG,EAAGhD,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAGaw/B,GAA2B,CACtCC,EACA16B,EAAQ,EACR/E,EAAS,IACN,CACC,GAAAy/B,GAAe16B,GAAS/E,EAAQ,CAC5B,MAAA8H,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,UAAU03B,EAAa,EAAG,EAAG16B,EAAO/E,CAAM,EAC5B+H,EAAI,aAAa,EAAG,EAAGhD,EAAO/E,CAAM,CAExD,CACO,OAAA,IACT,EAEa0/B,GAAqBR,GAAyB,CAMzD,MAAMS,EAAUT,EAAU,MACpBU,EAAWV,EAAU,OACrBW,EAAcF,EAAUC,EAAW,EACnCE,EAASD,EAAc,GAWvBE,EAAmB,CAEvB,GACA,GAEAD,EAAS,IACRA,GAAU,EAAK,IACfA,GAAU,GAAM,IAChBA,GAAU,GAAM,IAEjB,EACA,EAEA,EACA,EAEA,GACA,EACA,EACA,CAAA,EAkBIE,EAAmB,CAEvB,GACA,EACA,EACA,EAEAL,EAAU,IACTA,GAAW,EAAK,IAChBA,GAAW,GAAM,IACjBA,GAAW,GAAM,IAElBC,EAAW,IACVA,GAAY,EAAK,IACjBA,GAAY,GAAM,IAClBA,GAAY,GAAM,IAEnB,EACA,EAGA,GACA,EAEA,EACA,EACA,EACA,EAEAC,EAAc,IACbA,GAAe,EAAK,IACpBA,GAAe,GAAM,IACrBA,GAAe,GAAM,IAEtB,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,CAAA,EAGII,GAAY,EAAMN,EAAU,EAAK,GAAM,EACvCO,EAAWhB,EAAU,KAE3B,IAAIiB,EAAe,GACnB,MAAMC,EAAWT,GAAW,EAC5B,IAAI7M,EAAI8M,EACR,MAAMS,EAAe,OAAO,aAEzB,EAAA,CACK,MAAAC,EAAWF,GAAYtN,EAAI,GACjC,IAAIyN,EAAc,GAClB,QAASluB,EAAI,EAAGA,EAAIstB,EAASttB,IAAK,CAChC,MAAMmuB,EAAWnuB,GAAK,EACtBkuB,GACEF,EAAaH,EAASI,EAAWE,EAAW,CAAC,CAAC,EAC9CH,EAAaH,EAASI,EAAWE,EAAW,CAAC,CAAC,EAC9CH,EAAaH,EAASI,EAAWE,CAAQ,CAAC,CAC9C,CAEA,QAASnjC,EAAI,EAAGA,EAAI4iC,EAAU5iC,IACbkjC,GAAA,OAAO,aAAa,CAAC,EAGtBJ,GAAAI,QACT,EAAEzN,GAEX,SAAS2N,EAAWniC,EAAsB,CACpC,GAAA,CAAC,OAAO,KACJ,KAAA,iBAER,IAAI+D,EAAM,GACN,GAAA,OAAO/D,GAAQ,SACX+D,EAAA/D,MAEN,SAASgH,EAAI,EAAGA,EAAIhH,EAAK,OAAQgH,IAC/BjD,GAAO,OAAO,aAAa/D,EAAKgH,CAAC,CAAC,EAGtC,OAAO,KAAKjD,CAAG,CACjB,CAEA,OACEo+B,EAAWV,EAAiB,OAAOC,CAAgB,CAAC,EACpDS,EAAWN,CAAY,CAE3B,EAGaO,GAAsBxB,GAAyB,CAC1D,GAAI,CAACA,EACI,OAAA,KAEH,KAAA,CAAE,MAAAn6B,EAAO,OAAA/E,CAAW,EAAAk/B,EACpBp3B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,aAAam3B,EAAW,EAAG,EAAG,EAAG,EAAGn6B,EAAO/E,CAAM,EACrC8H,EAAO,UAAU,WAAW,CAE9C,EAGa64B,GAAkB,CAC7BzB,EACA0B,EAAkB,MAClB5mC,IACG,CACH,GAAI,CAACklC,EAAW,CACdllC,EAAG,eAAgB,IAAI,EACvB,MACF,CACM,KAAA,CAAE,MAAA+K,EAAO,OAAA/E,CAAW,EAAAk/B,EACpBp3B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClCA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,aAAam3B,EAAW,EAAG,EAAG,EAAG,EAAGn6B,EAAO/E,CAAM,EACrD,MAAM6gC,EAAc,SAClBD,EAAkBA,EAAgB,cAAgB,KACpD,GACO94B,EAAA,OACJ5L,GAAsB,CACrBlC,EAAG,KAAMkC,CAAI,CACf,EACA2kC,EACA,CAAA,CAEJ,EAGaC,GAAc,CAAC5kC,EAAYlC,IAA2B,CAC7C+kC,GAAA7iC,EAAM,SAAUihB,EAAK6hB,EAAwB,CAC/D,GAAIA,EAAS,CACL,MAAAP,EAAQ,IAAI,MAClBA,EAAM,IAAMO,CAAA,MAEZhlC,EAAGmjB,CAAG,CACR,CACD,CACH,EAGa4jB,GAAe,CAAC7kC,EAAY8kC,IAAoB,CAC3D,GAAI,CAAC9kC,EAAM,OACL,MAAAiS,EAAI,SAAS,cAAc,GAAG,EACpCA,EAAE,MAAM,WAAa,SACZ,SAAA,KAAK,YAAYA,CAAC,EAC3BA,EAAE,SAAW6yB,EACb,MAAMC,EAAS,OAAO,IAAI,gBAAgB/kC,CAAI,EAC9CiS,EAAE,KAAO8yB,EACT9yB,EAAE,MAAM,EACC,SAAA,KAAK,YAAYA,CAAC,EACpB,OAAA,IAAI,gBAAgB8yB,CAAM,CACnC,EAGgB,SAAAC,GACdrjC,EACA7D,EACA,CACM,MAAAykC,EAAQ,IAAI,MAClBA,EAAM,OAAS,UAAY,CACzBzkC,EAAG,KAAMykC,CAAK,CAAA,EAEhBA,EAAM,QAAU,UAAY,CAC1BzkC,EAAG,IAAI,MAAM,2BAA6B6D,CAAG,EAAG,IAAI,CAAA,EAEtD4gC,EAAM,IAAM5gC,CACd,CAMO,SAASsjC,IAAiB,CACzB,MAAAC,EAAO,SAAS,qBAAqB,KAAK,EAC1CC,EAAaziC,GAAkB,EAAA,OACrC,IAAImf,EAAQ,EACZ,MAAO,IAAM,CACX,QAAS,EAAIA,EAAO,EAAIqjB,EAAK,OAAQ,IAE/BA,EAAK,CAAC,EAAE,sBAAsB,EAAE,IAAMC,IACnCD,EAAA,CAAC,EAAE,IAAMA,EAAK,CAAC,EAAE,aAAa,UAAU,GAAK,GAClDrjB,EAAQ,EAAI,EAEhB,CAEJ,CAGgB,SAAAujB,GACd9C,EACAxkC,EACA,CACcukC,GAAAC,EAASS,GAAY,CACjC,GAAI,CAACA,EAAgB,OAAAjlC,EAAG,gBAAiB,IAAI,EAC7C,MAAMunC,EAAkBpC,GACtBX,EACAS,EAAQ,MACRA,EAAQ,MAAA,EAEV,GAAI,CAACsC,EAAwB,OAAAvnC,EAAG,uBAAwB,IAAI,EAC5D,MAAMklC,EAAYqC,EAAgB,KAClC,IAAI/0B,EAAI,EACR,MAAMg1B,EAAO,CAAA,EACPC,EAAO,CAAA,EACPC,EAAO,CAAA,EACb,QAASp8B,EAAI,EAAGA,EAAI45B,EAAU,OAAQ55B,GAAK,EACpCk8B,EAAAh1B,CAAC,EAAI0yB,EAAU55B,CAAC,EACrBm8B,EAAKj1B,CAAC,EAAI0yB,EAAU55B,EAAI,CAAC,EACzBo8B,EAAKl1B,CAAC,EAAI0yB,EAAU55B,EAAI,CAAC,EACpBkH,GAAA,EAED,MAAAgoB,EAAImN,GAAoBH,CAAI,EAC5BI,EAAID,GAAoBF,CAAI,EAC5BI,EAAIF,GAAoBD,CAAI,EAC3B,OAAA1nC,EAAG,KAAM,OAASw6B,EAAI,IAAMoN,EAAI,IAAMC,EAAI,GAAG,CAAA,CACrD,CACH,CAEA,SAASF,GAAoBt8B,EAAe,CAC1C,MAAMy8B,EAAW,CAAA,EACXC,EAAiB,CAAA,EACjBC,EAAmB,CAAA,EACzB,QAAS18B,EAAI,EAAGA,EAAID,EAAI,OAAQC,IACzBw8B,EAASz8B,EAAIC,CAAC,CAAC,EAGHy8B,EAAA,KAAK18B,EAAIC,CAAC,CAAC,EAFjBw8B,EAAAz8B,EAAIC,CAAC,CAAC,EAAI,EAKvB,IAAI7H,EAAI,EACR,QAAS6H,EAAI,EAAGA,EAAIy8B,EAAe,OAAQz8B,IAAK,CAC1C7H,EAAA,EACJ,QAAS+O,EAAI,EAAGA,EAAIu1B,EAAe,OAAQv1B,IACrCu1B,EAAez8B,CAAC,IAAMy8B,EAAev1B,CAAC,IACnC/O,GAAA,GAEPukC,EAAiB18B,CAAC,EAAI7H,CAE1B,CACA,MAAMwmB,EAAM,KAAK,IAAI,MAAM,KAAM+d,CAAgB,EACjD,IAAIC,EAAW,EACR,KAAAA,EAAWD,EAAiB,OAAQC,IACrC,GAAAD,EAAiBC,CAAQ,IAAMhe,EACjC,OAGJ,OAAO8d,EAAeE,CAAQ,CAChC,CAGa,MAAAC,GAAkBhD,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,CAAC,EAClD8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,EAC1D8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,EAC1D8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,CACvE,CAGK,OADc,IAAI,UAAU8vB,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaqiC,GAAkBnD,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,CAAC,EACrD8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,EAClC8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,EAClC8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,CAC/C,CAGK,OADc,IAAI,UAAU8vB,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGasiC,GAAcpD,GAAyB,CAClD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAAS+T,EAAI,EAAGA,EAAItN,EAAOsN,IACzB,QAASygB,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAAK,CACzB,MAAAsP,GAAc/vB,EAAIrS,EAAS8yB,GAAK,EAC3BqP,EAAAC,CAAU,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,CAAC,EAClD8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,EAC1D8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,EAC1D8vB,EAAAC,EAAa,CAAC,EAAI9jC,GAAMw0B,EAAI/tB,EAAQA,EAAQsN,EAAI,GAAK,EAAI,CAAC,CACvE,CAGK,OADc,IAAI,UAAU8vB,EAAYniC,EAAQ+E,CAAK,CAE9D,CACO,OAAA,IACT,EAGaw9B,GAAerD,GAAyB,CACnD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAAS+T,EAAI,EAAGA,EAAItN,EAAOsN,IACzB,QAASygB,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAAK,CACzB,MAAAsP,GAAc/vB,EAAIrS,EAAS8yB,GAAK,EAC3BqP,EAAAC,CAAU,EAAI9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,CAAC,EACrD8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,EAClC8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,EAClC8vB,EAAAC,EAAa,CAAC,EACvB9jC,IAAO0B,EAAS8yB,EAAI,GAAK/tB,EAAQsN,GAAK,EAAI,CAAC,CAC/C,CAGK,OADc,IAAI,UAAU8vB,EAAYniC,EAAQ+E,CAAK,CAE9D,CACO,OAAA,IACT,EAGay9B,GAAUtD,GAAyB,CAC9C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC/BowB,GACHnkC,EAAK8jC,CAAU,EAAI9jC,EAAK8jC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,GAAK,EACrED,EAAWC,CAAU,EAAIK,EACdN,EAAAC,EAAa,CAAC,EAAIK,EAClBN,EAAAC,EAAa,CAAC,EAAIK,EAC7BN,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa0iC,GAAmBxD,GAAyB,CACvD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAG/BswB,GADHrkC,EAAK8jC,CAAU,EAAI9jC,EAAK8jC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,GAAK,EACzC,IAAM,IAAM,EACxCD,EAAWC,CAAU,EAAIO,EACdR,EAAAC,EAAa,CAAC,EAAIO,EAClBR,EAAAC,EAAa,CAAC,EAAIO,EAC7BR,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa4iC,GAAc1D,GAAyB,CAClD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC8vB,EAAWC,CAAU,EAAI,IAAM9jC,EAAK8jC,CAAU,EAC9CD,EAAWC,EAAa,CAAC,EAAI,IAAM9jC,EAAK8jC,EAAa,CAAC,EACtDD,EAAWC,EAAa,CAAC,EAAI,IAAM9jC,EAAK8jC,EAAa,CAAC,EACtDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa6iC,GAAS3D,GAAyB,CAC7C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAI,EAClBD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa8iC,GAAW5D,GAAyB,CAC/C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC8vB,EAAWC,CAAU,EAAI,EACzBD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa+iC,GAAU7D,GAAyB,CAC9C,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC8vB,EAAWC,CAAU,EAAI,EACdD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGagjC,GAAiB9D,GAAyB,CACrD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaijC,GAAgB/D,GAAyB,CACpD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAI,EAC7BD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGakjC,GAAkBhE,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC8vB,EAAWC,CAAU,EAAI,EACzBD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGamjC,GAAgBjE,GAAyB,CACpD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC/B+wB,GAAa9kC,EAAK8jC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,GAAK,EACvDD,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EAC7BD,EAAAC,EAAa,CAAC,EAAIgB,EAClBjB,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaqjC,GAAkBnE,GAAyB,CACtD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC/B+wB,GAAa9kC,EAAK8jC,CAAU,EAAI9jC,EAAK8jC,EAAa,CAAC,GAAK,EAC9DD,EAAWC,CAAU,EAAIgB,EACzBjB,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGasjC,GAAiBpE,GAAyB,CACrD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC/B+wB,GAAa9kC,EAAK8jC,CAAU,EAAI9jC,EAAK8jC,EAAa,CAAC,GAAK,EAC9DD,EAAWC,CAAU,EAAIgB,EACdjB,EAAAC,EAAa,CAAC,EAAIgB,EAC7BjB,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaujC,GAAWrE,GAClBA,EAEmBsE,GAAkBtE,EADxB,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAE,CACO,EAGnD,KAIIuE,GAAiBvE,GACxBA,EAEmBsE,GAAkBtE,EADxB,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAE,CACO,EAGnD,KAIIwE,GAAYxE,GAAyB,CAChD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EAAI,GAC/B,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa2jC,GAAYzE,GAAyB,CAChD,GAAIA,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC,GAAI/T,EAAK8jC,EAAa,CAAC,IAAM,EAC3BD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,QACxB,CACL,MAAMO,EAAWiB,GACf,CACEtlC,EAAK8jC,CAAU,EACf9jC,EAAK8jC,EAAa,CAAC,EACnB9jC,EAAK8jC,EAAa,CAAC,EACnB9jC,EAAK8jC,EAAa,CAAC,CACrB,EACA,CAAC,IAAK,IAAK,IAAK,GAAG,CAAA,EAEVD,EAAAC,CAAU,EAAIO,EAAS,CAAC,EACnCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,EACvCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,EACvCR,EAAWC,EAAa,CAAC,EAAIO,EAAS,CAAC,CACzC,CACF,CAGK,OADc,IAAI,UAAUR,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAaa6jC,GAAW,CACtB3E,EACA4E,EACAC,EACA3c,EACAlI,EACA8kB,EAAqB,GACrBnF,IACG,CACH,GAAIK,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAChC,IAAI+E,EAAY/kB,EACZglB,EAAW9c,EACX+c,EAAaL,EACbM,EAAcL,EA4BlB,GA3BIE,EAAY,EACFA,EAAA,EACHA,EAAYl/B,IACTk/B,EAAAl/B,GAEVm/B,EAAW,EACFA,EAAA,EACFA,EAAWlkC,IACTkkC,EAAAlkC,GAETmkC,EAAa,EACFA,EAAA,EACJA,EAAap/B,IACTo/B,EAAAp/B,GAEXq/B,EAAc,EACFA,EAAA,EACLA,EAAcpkC,IACTokC,EAAApkC,GAEZikC,EAAYE,EAAap/B,IAC3Bo/B,EAAap/B,EAAQk/B,GAEnBC,EAAWE,EAAcpkC,IAC3BokC,EAAcpkC,EAASkkC,GAGrBF,EAAoB,CACtB,MAAM7B,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAEnCA,GAAK4xB,GACL5xB,GAAK4xB,EAAYE,GACjBrR,GAAKoR,GACLpR,GAAKoR,EAAWE,GAELjC,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,IAEhDD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAC7BD,EAAWC,EAAa,CAAC,EACvBvD,GAAa,CAAC,MAAO,MAAM,EAAE,SAASA,EAAU,YAAa,CAAA,EACzD,IACA,EAEV,CAGK,OADc,IAAI,UAAUsD,EAAYp9B,EAAO/E,CAAM,CACrD,KACF,CACL,MAAMmiC,EAAa,IAAI,kBAAkBgC,EAAaC,EAAc,CAAC,EACrE,QAAStR,EAAIoR,EAAUpR,GAAKoR,EAAWE,EAAatR,IAClD,QAASzgB,EAAI4xB,EAAW5xB,GAAK4xB,EAAYE,EAAY9xB,IAAK,CACxD,MAAM+vB,IAAetP,EAAIoR,GAAYC,EAAa9xB,EAAI4xB,GAAa,EAC7DI,GAAevR,EAAI/tB,EAAQsN,GAAK,EAC3B8vB,EAAAC,CAAU,EAAI9jC,EAAK+lC,CAAW,EACzClC,EAAWC,EAAa,CAAC,EAAI9jC,EAAK+lC,EAAc,CAAC,EACjDlC,EAAWC,EAAa,CAAC,EAAI9jC,EAAK+lC,EAAc,CAAC,EACjDlC,EAAWC,EAAa,CAAC,EAAI9jC,EAAK+lC,EAAc,CAAC,CACnD,CAGK,OADc,IAAI,UAAUlC,EAAYgC,EAAYC,CAAW,CAExE,CACF,CACO,OAAA,IACT,EAUaE,GAAa,CACxBpF,EACAqF,EACA1F,EACA2F,IACG,CACH,GAAItF,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAChC,IAAIuF,EAAcF,EACdE,EAAc,KAAK,MAAM1/B,EAAQ,CAAC,IACtB0/B,EAAA,KAAK,MAAM1/B,EAAQ,CAAC,GAEhC0/B,EAAc,KAAK,MAAMzkC,EAAS,CAAC,IACvBykC,EAAA,KAAK,MAAMzkC,EAAS,CAAC,GAEjCykC,EAAc,IACFA,EAAA,GAEhB,MAAMtC,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC,IAAI9M,EAAI,GACJ8M,EAAIoyB,EACF3R,EAAI2R,EACNl/B,EAAI,KAAK,KACP,KAAK,IAAIk/B,EAAcpyB,EAAI,EAAG,CAAC,EAC7B,KAAK,IAAIoyB,EAAc3R,EAAI,EAAG,CAAC,CAAA,EAE1BA,EAAI9yB,EAASykC,EAAc,IACpCl/B,EAAI,KAAK,KACP,KAAK,IAAIk/B,EAAcpyB,EAAI,EAAG,CAAC,EAC7B,KAAK,IAAIygB,GAAK9yB,EAASykC,GAAc,CAAC,CAAA,GAGnCpyB,EAAItN,EAAQ0/B,EAAc,IAC/B3R,EAAI2R,EACNl/B,EAAI,KAAK,KACP,KAAK,IAAI8M,GAAKtN,EAAQ0/B,GAAc,CAAC,EACnC,KAAK,IAAIA,EAAc3R,EAAI,EAAG,CAAC,CAAA,EAE1BA,EAAI9yB,EAASykC,EAAc,IACpCl/B,EAAI,KAAK,KACP,KAAK,IAAI8M,GAAKtN,EAAQ0/B,GAAc,CAAC,EACnC,KAAK,IAAI3R,GAAK9yB,EAASykC,GAAc,CAAC,CAAA,IAI1C,KAAK,MAAMl/B,CAAC,EAAIk/B,GAClBtC,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EACvBoC,GAAY3F,EAAU,gBAAkB,MAAQ,EAAI,MAE3CsD,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EACrCD,EAAAC,EAAa,CAAC,EACvBoC,GAAY3F,EAAU,gBAAkB,MACpCvgC,EAAK8jC,EAAa,CAAC,EACnB,IAEV,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa0kC,GAAa,CACxBlG,EACAz5B,EACA/E,EACA8jC,EACAC,EACAY,EAAiB,MACd,CACH,GAAInG,EAAQ,CACJ,MAAAjN,EAAM,IAAI,MAChBA,EAAI,IAAMiN,EACJ,MAAA12B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClC,OAAAA,EAAO,MAAQ68B,EACf78B,EAAO,OAAS68B,EACZ58B,EAAA,UAAUwpB,EAAK,EAAG,EAAGxsB,EAAO/E,EAAQ,EAAG,EAAG8jC,EAAUC,CAAS,EAC5Ch8B,EAAI,aACvB,EACA,EACA+7B,EACAC,CAAA,CAGJ,CACO,OAAA,IACT,EAGaa,GAAmB,CAAC1F,EAAsB2F,IAAsB,CAC3E,GAAI3F,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC1B8vB,EAAAC,CAAU,EAAI,KAAK,IAC5B,KAAK,IAAI9jC,EAAK8jC,CAAU,EAAIyC,EAAW,GAAG,EAC1C,CAAA,EAES1C,EAAAC,EAAa,CAAC,EAAI,KAAK,IAChC,KAAK,IAAI9jC,EAAK8jC,EAAa,CAAC,EAAIyC,EAAW,GAAG,EAC9C,CAAA,EAES1C,EAAAC,EAAa,CAAC,EAAI,KAAK,IAChC,KAAK,IAAI9jC,EAAK8jC,EAAa,CAAC,EAAIyC,EAAW,GAAG,EAC9C,CAAA,EAEF1C,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGa8kC,GAAoB,CAC/B5F,EACAxgC,EACAqmC,EAAmB,KAChB,CACH,GAAI7F,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACjC/T,EAAK8jC,EAAa,CAAC,IAAM,GAC3BD,EAAWC,CAAU,EAAI,IACdD,EAAAC,EAAa,CAAC,EAAI,IAClBD,EAAAC,EAAa,CAAC,EAAI,MAElBD,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,GAE9C,IAAAj0B,EAAI7P,EAAK8jC,EAAa,CAAC,EACvB2C,EACE52B,EAAA,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,IAAMzP,CAAK,EAAG,GAAG,EAAG,CAAC,EAEtDyP,EAAI,KAAK,IAAI,KAAK,IAAI,KAAK,MAAMA,EAAI,IAAMzP,CAAK,EAAG,GAAG,EAAG,CAAC,EAEjDyjC,EAAAC,EAAa,CAAC,EAAIj0B,CAC/B,CAGK,OADc,IAAI,UAAUg0B,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGaglC,GAAe,CAC1B9F,EACA+F,EACA7d,EACAlI,IACG,CACH,GAAIggB,GAAa+F,EAAoB,CACnC,KAAM,CAAE,KAAA3mC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1B,CACJ,KAAMgG,EACN,MAAOC,EACP,OAAQC,CACN,EAAAH,EACJ,IAAIf,EAAW9c,EACX6c,EAAY/kB,EACZkI,EAAMge,EAAkBplC,IAC1BkkC,EAAWlkC,EAASolC,GAElBlmB,EAAOimB,EAAiBpgC,IAC1Bk/B,EAAYl/B,EAAQogC,GAEtB,MAAMhD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAEnC,GAAAA,EAAI4xB,GACJ5xB,EAAI4xB,EAAYkB,GAChBrS,GAAKoR,GACLpR,GAAKoR,EAAWkB,EAELjD,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,MAC3C,CACL,MAAMiD,GACHvS,EAAI/tB,EACHsN,IACE6xB,EAAW,GAAKn/B,GACf+tB,GAAKoR,EAAW,KAAOn/B,EAAQogC,IAClCA,EACAlB,EACA,GACF,EACIqB,EAA+C,CACnDJ,EAAcG,CAAmB,EACjCH,EAAcG,EAAsB,CAAC,EACrCH,EAAcG,EAAsB,CAAC,EACrCH,EAAcG,EAAsB,CAAC,CAAA,EAEjCE,EAA+C,CACnDjnC,EAAK8jC,CAAU,EACf9jC,EAAK8jC,EAAa,CAAC,EACnB9jC,EAAK8jC,EAAa,CAAC,EACnB9jC,EAAK8jC,EAAa,CAAC,CAAA,EAEfoD,EAAa5B,GAAY0B,EAAYC,CAAU,EAC1CpD,EAAAC,CAAU,EAAIoD,EAAW,CAAC,EACrCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,EACzCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,EACzCrD,EAAWC,EAAa,CAAC,EAAIoD,EAAW,CAAC,CAC3C,CACF,CAGK,OADc,IAAI,UAAUrD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAYaylC,GAAS,CACpBvG,EACAwG,EACAC,EACAve,EACAlI,EACA0mB,EAAa,KACV,CACH,GAAI1G,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAChC,IAAI+E,EAAY/kB,EACZglB,EAAW9c,EACX+c,EAAauB,EACbtB,EAAcuB,EACd1B,EAAY,EACFA,EAAA,EACHA,EAAYl/B,IACTk/B,EAAAl/B,GAEVm/B,EAAW,EACFA,EAAA,EACFA,EAAWlkC,IACTkkC,EAAAlkC,GAETmkC,EAAa,EACFA,EAAA,EACJA,EAAap/B,IACTo/B,EAAAp/B,GAEXq/B,EAAc,EACFA,EAAA,EACLA,EAAcpkC,IACTokC,EAAApkC,GAEZikC,EAAYE,EAAap/B,IAC3Bo/B,EAAap/B,EAAQk/B,GAEnBC,EAAWE,EAAcpkC,IAC3BokC,EAAcpkC,EAASkkC,GAGzB,MAAM/B,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAEnC,GAAAA,GAAK4xB,GACL5xB,GAAK4xB,EAAYE,GACjBrR,GAAKoR,GACLpR,GAAKoR,EAAWE,EAChB,CACA,MAAMyB,EAAY,KAAK,OAAOxzB,EAAI4xB,GAAa2B,CAAU,EACnDE,EAAY,KAAK,OAAOhT,EAAIoR,GAAY0B,CAAU,EACxD,IAAIG,EAAkB,KAAK,MACzBH,GAAcC,EAAY,GAAKD,EAAa,EAAI3B,CAAA,EAE9C+B,EAAkB,KAAK,MACzBJ,GAAcE,EAAY,GAAKF,EAAa,EAAI1B,CAAA,EAE9C6B,EAAkBhhC,EAAQ,IAC5BghC,EAAkBhhC,EAAQ,GAExBihC,EAAkBhmC,EAAS,IAC7BgmC,EAAkBhmC,EAAS,GAEvB,MAAAimC,GACHD,EAAkBjhC,EAAQghC,GAAmB,EACrC5D,EAAAC,CAAU,EAAI9jC,EAAK2nC,CAAmB,EACjD9D,EAAWC,EAAa,CAAC,EAAI9jC,EAAK2nC,EAAsB,CAAC,EACzD9D,EAAWC,EAAa,CAAC,EAAI9jC,EAAK2nC,EAAsB,CAAC,EACzD9D,EAAWC,EAAa,CAAC,EAAI9jC,EAAK2nC,EAAsB,CAAC,CAAA,MAE9C9D,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAEpD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGakmC,GAAc,MACzBC,EACAphC,EACA/E,EACA6+B,EACAuH,EACApsC,IACG,CACH,GAAImsC,GAAYtH,EAAW,CACzB,MAAMwH,EAASD,EAAoB,IAC/B,GAAA,CAAC,MAAO,MAAM,EAAE,SAASvH,EAAU,YAAA,CAAa,EAAG,CAC/C,MAAAtN,EAAM,IAAI,MAChBA,EAAI,IAAM4U,EACJ,MAAAr+B,EAAS,SAAS,cAAc,QAAQ,EACxCC,EAAMD,EAAO,WAAW,IAAI,EAClCA,EAAO,MAAQ/C,EACf+C,EAAO,OAAS9H,EAChB+H,EAAI,UAAUwpB,EAAK,EAAG,EAAGxsB,EAAO/E,CAAM,EAC/B8H,EAAA,OACJ5L,GAAsB,CACrBlC,GAAMA,EAAGkC,CAAI,CACf,EACA,SAAS2iC,EAAU,YAAA,CAAa,GAChCwH,CAAA,CACF,KACK,CACL,MAAMC,EAAM,KAAK,MAAMD,EAAS,GAAG,EAC7BE,EAAMlV,EAAK,OACf,CAAE8U,EAAuB,KAAK,MAAM,EACpCphC,EACA/E,EACAsmC,CAAA,EAEIpqC,EAAO,IAAI,KAAK,CAACqqC,CAAG,CAAC,EAC3BvsC,GAAMA,EAAGkC,CAAI,CACf,CAAA,MAEAlC,GAAMA,EAAG,IAAI,CAEjB,EAGawsC,GAAuB,CAClCC,EACAC,EACAjtC,EAGI,CACF,gBAAiB,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAC5C,gBAAiB,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAE,CAC5C,IACG,CACH,GAAIgtC,EAAmB,CACrB,GAAIC,GAAejtC,EAAS,CAC1B,KAAM,CAAE,KAAA6E,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWymC,EAC1B,CAAE,KAAME,CAAW,EAAAD,EACnBvE,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EAC9C,CAAE,gBAAAsoC,EAAiB,gBAAAC,CAAoB,EAAAptC,EAC7C,QAASq5B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EAC/BgjB,EAAIsR,EAAOvE,CAAU,EACrBvJ,EAAI8N,EAAOvE,EAAa,CAAC,EACzBj4B,EAAIw8B,EAAOvE,EAAa,CAAC,EACzBj0B,EAAIw4B,EAAOvE,EAAa,CAAC,EAE7B/M,IAAMuR,EAAgB,GACtB/N,IAAM+N,EAAgB,GACtBz8B,IAAMy8B,EAAgB,GACtBz4B,IAAMy4B,EAAgB,GACtBC,EAAgB,IAAM,GAEX1E,EAAAC,CAAU,EAAIyE,EAAgB,EAC9B1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,EAClC1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,EAClC1E,EAAAC,EAAa,CAAC,EAAIyE,EAAgB,IAElC1E,EAAAC,CAAU,EAAI9jC,EAAK8jC,CAAU,EACxCD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAChDD,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,EAEpD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAAymC,CACT,CACO,OAAA,IACT,EAGMjD,GAAoB,CAACtE,EAAsB4H,IAAqB,CACpE,GAAI5H,EAAW,CACb,KAAM,CAAE,KAAA5gC,EAAM,MAAAyG,EAAO,OAAA/E,CAAA,EAAWk/B,EAC1BiD,EAAa,IAAI,kBAAkB7jC,EAAK,MAAM,EACpD,QAASw0B,EAAI,EAAGA,EAAI9yB,EAAQ8yB,IAC1B,QAASzgB,EAAI,EAAGA,EAAItN,EAAOsN,IAAK,CACxB,MAAA+vB,GAActP,EAAI/tB,EAAQsN,GAAK,EACrC,QAAS/M,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,MAAMyhC,EAAQ3E,EAAa98B,EACvB+M,IAAM,GAAKA,IAAMtN,EAAQ,GAAK+tB,IAAM,GAAKA,IAAM9yB,EAAS,EAC/CmiC,EAAA4E,CAAK,EAAIzoC,EAAKyoC,CAAK,EAE9B5E,EAAW4E,CAAK,EACdD,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,EAAI,CAAC,EACtC+hC,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,CAAC,EAClC+hC,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,EAAI,CAAC,EACtC+hC,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQ,CAAC,EAC1BD,EAAO,CAAC,EAAIxoC,EAAKyoC,CAAK,EACtBD,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQ,CAAC,EAC1BD,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,EAAI,CAAC,EACtC+hC,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,CAAC,EAClC+hC,EAAO,CAAC,EAAIxoC,EAAKyoC,EAAQhiC,EAAQ,EAAI,CAAC,CAE5C,CACAo9B,EAAWC,EAAa,CAAC,EAAI9jC,EAAK8jC,EAAa,CAAC,CAClD,CAGK,OADc,IAAI,UAAUD,EAAYp9B,EAAO/E,CAAM,CAE9D,CACO,OAAA,IACT,EAGM4jC,GAAc,CAClB0B,EACAC,IACG,CACH,GACED,GACAA,EAAW,SAAW,GACtBC,GACAA,EAAW,SAAW,EACtB,CACM,MAAAyB,EAAS1B,EAAW,CAAC,EACrB2B,EAAS1B,EAAW,CAAC,EACvB,GAAAyB,IAAW,KAAOC,IAAW,EACxB,OAAA3B,EACT,GAAW0B,IAAW,EACb,OAAAzB,EACF,CACL,MAAM2B,EAAmBF,EAAS,IAC5BG,EAAmBF,EAAS,IAC5BG,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACH9B,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEIG,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACH/B,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEII,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,MACHhC,EAAW,CAAC,EAAI4B,EACd3B,EAAW,CAAC,EAAI4B,GAAoB,EAAID,EAC5C,EACA,GACF,EACA,CAAA,EAEIK,EAAY,KAAK,IACrB,KAAK,IACH,KAAK,OACFL,EAAmBC,GAAoB,EAAID,IAAqB,GACnE,EACA,GACF,EACA,CAAA,EAEF,MAAO,CAACE,EAAWC,EAAWC,EAAWC,CAAS,CACpD,CACF,CACA,MAAO,CAAC,IAAK,IAAK,IAAK,GAAG,CAC5B,ECxhDO,SAASC,IAAuB,CACrC,IAAIC,EAAM,KAEV,GAAI,OAAO,cAWT,QAVIC,EAAW,CACb,oBACA,iBACA,iBACA,iBACA,iBACA,iBACA,eACN,EAEapiC,EAAI,EAAGA,EAAIoiC,EAAS,OAAQpiC,IACnC,GAAI,CACFmiC,EAAM,IAAI,OAAO,cAAcC,EAASpiC,CAAC,CAAC,EAC1C,KACD,MAAY,CACX,QACD,MAGHmiC,EAAM,IAAI,eAEZ,OAAOA,CACT,CAEO,SAASE,GAAmBC,EAAc,CAC/C,GAAKA,EAAa,OAGlB,IAAIA,EAAa,OAAO,YAAW,IAAO,OAkCxC,MAAO,CACL,IAAKA,EAAa,OAClB,KAAM,IAAI,SAASA,CAAY,CACrC,EAGI,QADIC,EAAU,GACLC,EAAQ,EAAGA,EAAQF,EAAa,SAAS,OAAQE,IAAS,CACjE,IAAIC,EAASH,EAAa,SAASE,CAAK,EACxC,GAAKC,EAAO,aAAa,MAAM,EAG/B,KAAIC,EACFD,EAAO,SAAS,YAAW,IAAO,QAC9BA,EAAO,aAAa,MAAM,EAAE,YAAa,EACzC,OACN,GAAIC,IAAe,OACjB,QACMC,EAAQ,EACZA,EAAQF,EAAO,MAAM,OACrBF,GACE,IAAM,OAAOE,EAAO,IAAI,EAAI,IAAM,OAAOA,EAAO,MAAME,GAAO,EAAE,IAAI,EACtE,MAEAD,IAAe,SAAWA,IAAe,YAC1CD,EAAO,WAEPF,GAAW,IAAM,OAAOE,EAAO,IAAI,EAAI,IAAM,OAAOA,EAAO,KAAK,GAEnE,CACD,MAAO,CACL,IAAKH,EAAa,OAAO,QACvB,aACAC,EAAQ,QAAQ,KAAM,GAAG,CAC1B,EACD,KAAM,IACZ,EAEA,CAEO,SAASK,GAAuBrqC,EAAKsqC,EAAS,CACnD,OAAO,IAAI,QAAQ,CAAC5tC,EAASC,IAAW,CACtC,IAAIitC,EAAM,IAAI,eACVW,EAAiB,UAAY,CAC/B5tC,EAAO,mBAAqBqD,EAAM,qBAAuBsqC,EAAU,GAAG,CAC5E,EACQ7hC,EAAU,SAAUnM,EAAG,CAMrBstC,EAAI,aAAe,IACjBA,EAAI,SAAW,IACjBltC,EAAQktC,EAAI,QAAQ,EASpBjtC,EAAOitC,EAAI,UAAU,EAG/B,EAEIA,EAAI,KAAK,MAAO5pC,CAAG,EAInB4pC,EAAI,OAASnhC,EAEbmhC,EAAI,QAAUU,EACdV,EAAI,UAAYW,EAEhBX,EAAI,OAAO,iBACT,WACA,SAAUttC,EAAG,CACX,GAAIA,EAAE,iBAAkB,CACtB,MAAMkuC,EAAa,KAAK,MAAOluC,EAAE,OAAS,IAAOA,EAAE,KAAK,EACxD,QAAQ,IAAIkuC,EAAa,GAAG,CAC7B,CACF,EACD,EACN,EACIZ,EAAI,OAAO,iBAAiB,OAAQ,SAAUttC,EAAG,CAAA,EAAI,EAAK,EAQ1DstC,EAAI,KAAK,IAAI,CASjB,CAAG,CACH,CAEO,SAASa,GAAczqC,EAAKpE,EAAS6E,EAAM,CAChD,OAAO,MACLT,EACA,OAAO,OACL,CACE,OAAQ,OACR,QAAS,CAGR,EACD,KAAM,CAAE,EACR,KAAM,GACN,YAAa,GACb,MAAO,GACP,SAAU,SACV,eAAgB,aACjB,EACDpE,CACD,CACF,EAAC,KAAM8uC,GAAaA,EAAS,KAAM,CAAA,CACtC,CAaO,SAASC,GAAoBC,EAAMC,EAAW,CACnD,IAAIjB,EAAM,IAAI,eACdA,EAAI,KAAK,OAAmDgB,CAAI,EAChEhB,EAAI,SAAWgB,EACfhB,EAAI,SAAWiB,EACfjB,EAAI,OAAS,UAAY,CACvB,IAAIkB,EAAa,WACf,OAAO,aAAa,QAAQ,MAAQ,KAAK,QAAQ,CACvD,EACQC,EAAa,KAAK,MAAM,KAAK,kBAAkB,eAAe,CAAC,GAC/D,MAAMD,CAAU,GAAKC,EAAaD,KACpC,OAAO,aAAa,QAAQ,MAAQ,KAAK,SAAU,KAAK,IAAG,CAAE,EAC7D,SAASA,CAAU,GAAK,KAAK,SAASC,EAAYD,CAAU,EAElE,EACElB,EAAI,KAAI,CACV,CC7NgB,SAAAoB,GACd9lB,EACArkB,EACA,CACA,GAAIA,EACF,OAAO,aAAa,QAClBqkB,EACA,OAAOrkB,GAAU,SAAWA,EAAQ,KAAK,UAAUA,CAAK,CAAA,MAGnD,QAAA,OAAO,aAAa,QAAQqkB,CAAG,CAE1C,CCZa,MAAA+lB,GAAW,CAAC7nC,EAAqC,CAAE,EAAG,EAAG,EAAG,KACvE,OAAO,SAASA,EAAS,EAAGA,EAAS,CAAC,EAEjC,SAAS8nC,GAAqBC,EAA2B,CAC1D,GAAA,CACF,OAAO,QAAQ,kBAAoBA,OACzB,CAEZ,CACF,CAEI,sBAAuB,OAAO,UAChCD,GAAqB,QAAQ,EAItB,OAAA,iBAAiB,eAAgB,IAAM,CAC5CA,GAAqB,MAAM,CAAA,CAC5B,EAEM,OAAA,iBAAiB,OAAQ,IAAM,CACpCA,GAAqB,QAAQ,CAAA,CAC9B,GCnBH,IAAIE,GAEJ,MAAMC,OAAmB,QAEzB,SAASC,GAAOC,EAAgBrmB,EAAa,CACvC,IAAAsmB,EAASH,GAAa,IAAIE,CAAM,EAC/BC,IACHA,MAAa,IACAH,GAAA,IAAIE,EAAQC,CAAM,GAE7B,IAAAC,EAAMD,EAAO,IAAItmB,CAAG,EACxB,OAAKumB,IACHA,EAAM,IAAIC,GACHF,EAAA,IAAItmB,EAAKumB,CAAG,GAEdA,CACT,CAEO,MAAMC,EAAI,CACf,YAEA,aAAc,CACP,KAAA,gBAAkB,GACzB,CAEA,QAAS,CACHN,IACG,KAAA,YAAY,IAAIA,EAAY,CAErC,CAEA,QAAS,CACP,KAAK,YAAY,QAASO,GAAWA,EAAQ,CAAA,CAC/C,CACF,CAEO,SAASC,GAAYD,EAAgB,CAC3BP,GAAAO,EAERA,IACQP,GAAA,IACjB,CAEO,SAASS,GAAaC,EAAa,CACxC,cAAO,KAAKA,CAAG,EAAE,QAAS5mB,GAAQ,CAC5B,IAAArkB,EAAQirC,EAAI5mB,CAAG,EACb,MAAAumB,EAAMH,GAAOQ,EAAK5mB,CAAG,EACpB,OAAA,eAAe4mB,EAAK5mB,EAAK,CAC9B,KAAM,CACJ,OAAAumB,EAAI,OAAO,EACJ5qC,CACT,EACA,IAAIkrC,EAAU,CACRA,GAAYlrC,IACNA,EAAAkrC,EACRN,EAAI,OAAO,EAEf,CAAA,CACD,CAAA,CACF,EACMK,CACT,CAEO,SAASE,GAAaF,EAAa,CACjC,OAAA,IAAI,MAAMA,EAAK,CACpB,IAAIP,EAAQrmB,EAAK+mB,EAAU,CAEzB,OADYX,GAAOQ,EAAK5mB,CAAa,EACjC,OAAO,EACJ,QAAQ,IAAIqmB,EAAQrmB,EAAK+mB,CAAQ,CAC1C,EACA,IAAIV,EAAQrmB,EAAKrkB,EAAOorC,EAAU,CAC1B,MAAAR,EAAMH,GAAOQ,EAAK5mB,CAAa,EACjC,OAAA4mB,EAAI5mB,CAAa,GAAKrkB,IACxBirC,EAAI5mB,CAAa,EAAIrkB,EACrB4qC,EAAI,OAAO,GAEN,QAAQ,IAAIF,EAAQrmB,EAAKrkB,EAAOorC,CAAQ,CACjD,CAAA,CACD,CACH,CC/EO,MAAMC,GAAS,CAEpB,OAAQ,CACN,KAAM,SAAUC,EAAwB,CAC/B,OAAAA,CACT,CACF,EAEA,UAAW,CACT,GAAI,SAAUA,EAAwB,CACpC,OAAOA,EAASA,CAClB,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAOA,GAAU,EAAIA,EACvB,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAEjB,KAAQ,EAAEA,GAAUA,EAAS,GAAK,EAC3C,CACF,EAEA,MAAO,CACL,GAAI,SAAUA,EAAwB,CACpC,OAAOA,EAASA,EAASA,CAC3B,EACA,IAAK,SAAUA,EAAwB,CAC9B,MAAA,EAAEA,EAASA,EAASA,EAAS,CACtC,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAE1B,KAAQA,GAAU,GAAKA,EAASA,EAAS,EAClD,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CAC7B,OAAAA,EAASA,EAASA,EAASA,CACpC,EACA,IAAK,SAAUA,EAAwB,CACrC,MAAO,IAAI,EAAEA,EAASA,EAASA,EAASA,CAC1C,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAASA,EAEnC,MAASA,GAAU,GAAKA,EAASA,EAASA,EAAS,EAC5D,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CAC7B,OAAAA,EAASA,EAASA,EAASA,EAASA,CAC7C,EACA,IAAK,SAAUA,EAAwB,CACrC,MAAO,EAAEA,EAASA,EAASA,EAASA,EAASA,EAAS,CACxD,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,GAAMA,EAASA,EAASA,EAASA,EAASA,EAE5C,KAAQA,GAAU,GAAKA,EAASA,EAASA,EAASA,EAAS,EACpE,CACF,EAEA,WAAY,CACV,GAAI,SAAUA,EAAwB,CACpC,MAAO,GAAI,KAAK,KAAM,EAAMA,GAAU,KAAK,GAAM,CAAC,CACpD,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAO,KAAK,IAAKA,EAAS,KAAK,GAAM,CAAC,CACxC,EACA,MAAO,SAAUA,EAAwB,CACvC,MAAO,KAAO,EAAI,KAAK,IAAI,KAAK,IAAM,GAAMA,EAAO,EACrD,CACF,EAEA,YAAa,CACX,GAAI,SAAUA,EAAwB,CACpC,OAAOA,IAAW,EAAI,EAAI,KAAK,IAAI,KAAMA,EAAS,CAAC,CACrD,EACA,IAAK,SAAUA,EAAwB,CAC9B,OAAAA,IAAW,EAAI,EAAI,EAAI,KAAK,IAAI,EAAG,IAAMA,CAAM,CACxD,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,GAEJA,GAAU,GAAK,EACX,GAAM,KAAK,IAAI,KAAMA,EAAS,CAAC,EAEjC,IAAO,CAAC,KAAK,IAAI,EAAG,KAAOA,EAAS,EAAE,EAAI,EACnD,CACF,EAEA,SAAU,CACR,GAAI,SAAUA,EAAwB,CACpC,MAAO,GAAI,KAAK,KAAK,EAAIA,EAASA,CAAM,CAC1C,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAO,KAAK,KAAK,GAAI,EAAEA,EAASA,CAAM,CACxC,EACA,MAAO,SAAUA,EAAwB,CAClC,OAAAA,GAAU,GAAK,EACX,KAAQ,KAAK,KAAK,EAAIA,EAASA,CAAM,EAAI,GAE3C,IAAO,KAAK,KAAK,GAAKA,GAAU,GAAKA,CAAM,EAAI,EACxD,CACF,EAEA,QAAS,CACP,GAAI,SAAUA,EAAwB,CACpC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,EAGP,CAAC,KAAK,IAAI,EAAG,IAAMA,EAAS,EAAE,EAAI,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,CAE3E,EACA,IAAK,SAAUA,EAAwB,CACrC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,EAGP,KAAK,IAAI,EAAG,IAAMA,CAAM,EAAI,KAAK,KAAKA,EAAS,IAAO,EAAI,KAAK,EAAE,EAAI,CAEzE,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,IAAW,EACN,EAELA,IAAW,EACN,GAECA,GAAA,EACNA,EAAS,EAET,IACA,KAAK,IAAI,EAAG,IAAMA,EAAS,EAAE,EAC7B,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,EAIvC,GACE,KAAK,IAAI,EAAG,KAAOA,EAAS,EAAE,EAC9B,KAAK,KAAKA,EAAS,KAAO,EAAI,KAAK,EAAE,EACvC,EAEJ,CACF,EAEA,KAAM,CACJ,GAAI,SAAUA,EAAwB,CAEpC,OAAOA,IAAW,EAAI,EAAIA,EAASA,IAAW,QAAI,GAAKA,EAAS,QAClE,EACA,IAAK,SAAUA,EAAwB,CAE9B,OAAAA,IAAW,EAAI,EAAI,EAAEA,EAASA,IAAW,QAAI,GAAKA,EAAS,SAAK,CACzE,EACA,MAAO,SAAUA,EAAwB,CACvC,MAAMtkC,EAAI,UACL,OAAAskC,GAAU,GAAK,EACX,IAAOA,EAASA,IAAWtkC,EAAI,GAAKskC,EAAStkC,IAE/C,KAAQskC,GAAU,GAAKA,IAAWtkC,EAAI,GAAKskC,EAAStkC,GAAK,EAClE,CACF,EAEA,OAAQ,CACN,GAAI,SAAUskC,EAAwB,CACpC,MAAO,GAAID,GAAO,OAAO,IAAI,EAAIC,CAAM,CACzC,EACA,IAAK,SAAUA,EAAwB,CACjC,OAAAA,EAAS,EAAI,KACR,OAASA,EAASA,EAChBA,EAAS,EAAI,KACf,QAAUA,GAAU,IAAM,MAAQA,EAAS,IACzCA,EAAS,IAAM,KACjB,QAAUA,GAAU,KAAO,MAAQA,EAAS,MAE5C,QAAUA,GAAU,MAAQ,MAAQA,EAAS,OAExD,EACA,MAAO,SAAUA,EAAwB,CACvC,OAAIA,EAAS,GACJD,GAAO,OAAO,GAAGC,EAAS,CAAC,EAAI,GAEjCD,GAAO,OAAO,IAAIC,EAAS,EAAI,CAAC,EAAI,GAAM,EACnD,CACF,EACA,YAAa,SAAUC,EAAQ,EAI7B,CACA,OAAAA,EAAQA,EAAQ,OAAO,QAAU,OAAO,QAAUA,EAC1CA,EAAAA,EAAQ,IAAQ,IAAQA,EACzB,CACL,GAAI,SAAUD,EAAwB,CACpC,OAAOA,GAAUC,CACnB,EACA,IAAK,SAAUD,EAAwB,CAC9B,MAAA,IAAK,EAAIA,IAAWC,CAC7B,EACA,MAAO,SAAUD,EAAwB,CACvC,OAAIA,EAAS,IACHA,EAAS,IAAMC,EAAQ,GAEzB,GAAK,EAAID,EAAS,IAAMC,GAAS,EAAI,EAC/C,CAAA,CAEJ,CACF,ECpOA,IAAIC,GAGF,OAAO,KAAS,KAChB,OAAO,QAAY,KACnB,QAAQ,OAERA,GAAM,UAAoB,CAClB,MAAAC,EAAO,QAAQ,SAErB,OAAOA,EAAK,CAAC,EAAI,IAAOA,EAAK,CAAC,EAAI,GAAA,EAKpC,OAAO,KAAS,KAChB,KAAK,cAAgB,QACrB,KAAK,YAAY,MAAQ,OAGzBD,GAAM,KAAK,YAAY,IAAI,KAAK,KAAK,WAAW,EACvC,KAAK,MAAQ,OACtBA,GAAM,KAAK,IAEXA,GAAM,UAAoB,CACjB,OAAA,IAAI,OAAO,SAAQ,EAI9B,MAAAE,GAAeF,GCpBf,MAAqBG,EAAM,CACjB,QAEJ,CAAA,EAEI,yBAEJ,CAAA,EAEJ,QAAqC,CAC5B,OAAA,OAAO,KAAK,KAAK,OAAO,EAAE,IAAKC,GAAY,KAAK,QAAQA,CAAO,CAAC,CACzE,CAEA,WAAkB,CAChB,KAAK,QAAU,EACjB,CAEA,IAAIC,EAAkC,CACpC,KAAK,QAAQA,EAAM,MAAO,CAAA,EAAIA,EAC9B,KAAK,yBAAyBA,EAAM,MAAO,CAAA,EAAIA,CACjD,CAEA,OAAOA,EAAkC,CACvC,OAAO,KAAK,QAAQA,EAAM,MAAO,CAAA,EACjC,OAAO,KAAK,yBAAyBA,EAAM,MAAO,CAAA,CACpD,CAEA,OAAOJ,EAAeD,KAAOM,EAAW,GAAgB,CACtD,IAAIC,EAAW,OAAO,KAAK,KAAK,OAAO,EACnC,GAAAA,EAAS,SAAW,EACf,MAAA,GAEF,KAAAA,EAAS,OAAS,GAAG,CAC1B,KAAK,yBAA2B,GAChC,QAASnlC,EAAI,EAAGA,EAAImlC,EAAS,OAAQnlC,IAAK,CACxC,MAAMilC,EAAQ,KAAK,QAAQE,EAASnlC,CAAC,CAAC,EAChColC,EAAY,CAACF,EACfD,GAASA,EAAM,OAAOJ,EAAMO,CAAS,IAAM,IAAS,CAACF,GACvD,OAAO,KAAK,QAAQC,EAASnlC,CAAC,CAAC,CAEnC,CACWmlC,EAAA,OAAO,KAAK,KAAK,wBAAwB,CACtD,CACO,MAAA,EACT,CACF,CChDO,MAAME,GAAgB,CAC3B,OAAQ,SAAUjtC,EAAaD,EAAmB,CAC1C,MAAA8Y,EAAI7Y,EAAE,OAAS,EACf+Y,EAAIF,EAAI9Y,EACR6H,EAAI,KAAK,MAAMmR,CAAC,EAChBxa,EAAK0uC,GAAc,MAAM,OAC/B,OAAIltC,EAAI,EACCxB,EAAGyB,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG+Y,CAAC,EAErBhZ,EAAI,EACCxB,EAAGyB,EAAE6Y,CAAC,EAAG7Y,EAAE6Y,EAAI,CAAC,EAAGA,EAAIE,CAAC,EAE1Bxa,EAAGyB,EAAE4H,CAAC,EAAG5H,EAAE4H,EAAI,EAAIiR,EAAIA,EAAIjR,EAAI,CAAC,EAAGmR,EAAInR,CAAC,CACjD,EAEA,OAAQ,SAAU5H,EAAaD,EAAmB,CAChD,IAAI0M,EAAI,EACF,MAAAF,EAAIvM,EAAE,OAAS,EACfktC,EAAK,KAAK,IACVC,EAAKF,GAAc,MAAM,UAC/B,QAASrlC,EAAI,EAAGA,GAAK2E,EAAG3E,IACtB6E,GAAKygC,EAAG,EAAIntC,EAAGwM,EAAI3E,CAAC,EAAIslC,EAAGntC,EAAG6H,CAAC,EAAI5H,EAAE4H,CAAC,EAAIulC,EAAG5gC,EAAG3E,CAAC,EAE5C,OAAA6E,CACT,EAEA,WAAY,SAAUzM,EAAaD,EAAmB,CAC9C,MAAA8Y,EAAI7Y,EAAE,OAAS,EACrB,IAAI+Y,EAAIF,EAAI9Y,EACR6H,EAAI,KAAK,MAAMmR,CAAC,EACd,MAAAxa,EAAK0uC,GAAc,MAAM,WAC/B,OAAIjtC,EAAE,CAAC,IAAMA,EAAE6Y,CAAC,GACV9Y,EAAI,IACN6H,EAAI,KAAK,MAAOmR,EAAIF,GAAK,EAAI9Y,EAAG,GAE3BxB,EACLyB,GAAG4H,EAAI,EAAIiR,GAAKA,CAAC,EACjB7Y,EAAE4H,CAAC,EACH5H,GAAG4H,EAAI,GAAKiR,CAAC,EACb7Y,GAAG4H,EAAI,GAAKiR,CAAC,EACbE,EAAInR,CAAA,GAGF7H,EAAI,EACCC,EAAE,CAAC,GAAKzB,EAAGyB,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAG,CAAC+Y,CAAC,EAAI/Y,EAAE,CAAC,GAEjDD,EAAI,EACCC,EAAE6Y,CAAC,GAAKta,EAAGyB,EAAE6Y,CAAC,EAAG7Y,EAAE6Y,CAAC,EAAG7Y,EAAE6Y,EAAI,CAAC,EAAG7Y,EAAE6Y,EAAI,CAAC,EAAGE,EAAIF,CAAC,EAAI7Y,EAAE6Y,CAAC,GAEzDta,EACLyB,EAAE4H,EAAIA,EAAI,EAAI,CAAC,EACf5H,EAAE4H,CAAC,EACH5H,EAAE6Y,EAAIjR,EAAI,EAAIiR,EAAIjR,EAAI,CAAC,EACvB5H,EAAE6Y,EAAIjR,EAAI,EAAIiR,EAAIjR,EAAI,CAAC,EACvBmR,EAAInR,CAAA,CAGV,EAEA,MAAO,CACL,OAAQ,SAAUyM,EAAY+4B,EAAY,EAAmB,CACnD,OAAAA,EAAK/4B,GAAM,EAAIA,CACzB,EACA,UAAY,UAAY,CAChB,MAAA5D,EAAI,CAAC,CAAC,EACZ,OAAO,SAAU,EAAmB,CAClC,IAAIzI,EAAI,EACJ,GAAAyI,EAAE,CAAC,EACL,OAAOA,EAAE,CAAC,EAEZ,QAAS,EAAI,EAAG,EAAI,EAAG,IAChBzI,GAAA,EAEP,OAAAyI,EAAE,CAAC,EAAIzI,EACAA,CAAA,CACT,EACC,EACH,UAAW,SAAUuE,EAAW3E,EAAmB,CAC3C,MAAAylC,EAAKJ,GAAc,MAAM,UACxB,OAAAI,EAAG9gC,CAAC,EAAI8gC,EAAGzlC,CAAC,EAAIylC,EAAG9gC,EAAI3E,CAAC,CACjC,EACA,WAAY,SACVyM,EACA+4B,EACAE,EACAC,EACAlhC,EACQ,CACF,MAAAmhC,GAAMF,EAAKj5B,GAAM,GACjBo5B,GAAMF,EAAKH,GAAM,GACjBM,EAAKrhC,EAAIA,EACTshC,EAAKthC,EAAIqhC,EACf,OACG,EAAIN,EAAK,EAAIE,EAAKE,EAAKC,GAAME,GAC7B,GAAKP,EAAK,EAAIE,EAAK,EAAIE,EAAKC,GAAMC,EACnCF,EAAKnhC,EACL+gC,CAEJ,CACF,CACF,EC1GA,MAAqBQ,EAAS,CAC5B,OAAe,QAAU,EAEzB,OAAO,QAAiB,CACtB,OAAOA,GAAS,SAClB,CACF,CCJa,MAAAC,EAAY,IAAIlB,GCUtB,MAAMmB,EAA8B,CAiEzC,YAAoBC,EAAoBC,EAAwBH,EAAW,CAAvD,KAAA,QAAAE,EAAoB,KAAA,OAAAC,CAAoC,CA/DpE,IAAMJ,GAAS,SAGf,WAAa,GAEb,WAAa,EAEb,WAAa,EAEb,cAAgB,IAGhB,UAAY,GAEZ,gBAAkB,EAGlB,eAAiB,EAEjB,QAAU,EAEV,iBAEA,MAAQ,GAER,UAAY,GAGZ,aAA6B,CAAA,EAE7B,WAA8C,CAAA,EAE9C,mBAAmC,CAAA,EAGnC,gBAAkCvB,GAAO,OAAO,KAEhD,uBAAgDY,GAAc,OAG9D,eAAoC,CAAA,EAEpC,gBAAkB,GAGlB,iBAEA,sBAAwB,GAExB,sBAEA,2BAA6B,GAE7B,kBAEA,kBAEA,oBAEA,gBAEA,SAAW,GAInB,OAAgB,CACd,OAAO,KAAK,GACd,CAEA,WAAqB,CACnB,OAAO,KAAK,UACd,CAEA,UAAoB,CAClB,OAAO,KAAK,SACd,CAEA,GAAGgB,EAA0BC,EAAyB,CAC/C,YAAA,WAAa,OAAO,OAAOD,CAAU,EACtCC,IAAa,SACf,KAAK,cAAgBA,GAEhB,IACT,CAEA,SAAS5uC,EAAI,IAAY,CACvB,YAAK,cAAgBA,EACd,IACT,CAEA,MAAMmtC,EAAeD,KAAa,CAChC,GAAI,KAAK,WACA,OAAA,KAIT,GAFA,KAAK,QAAU,KAAK,OAAO,IAAI,IAA2B,EAC1D,KAAK,QAAU,KAAK,eAChB,KAAK,UAAW,CAClB,KAAK,UAAY,GACN,UAAA2B,KAAY,KAAK,mBAC1B,KAAK,0BAA0BA,CAAQ,EACvC,KAAK,aAAaA,CAAQ,EAAI,KAAK,mBAAmBA,CAAQ,CAElE,CACA,YAAK,WAAa,GAClB,KAAK,UAAY,GACjB,KAAK,sBAAwB,GAC7B,KAAK,2BAA6B,GAClC,KAAK,gBAAkB,GACvB,KAAK,WAAa1B,EAClB,KAAK,YAAc,KAAK,WACnB,KAAA,iBACH,KAAK,QACL,KAAK,aACL,KAAK,WACL,KAAK,kBAAA,EAEA,IACT,CAEQ,iBACNsB,EACAK,EACAC,EACAC,EACM,CACN,UAAWH,KAAYE,EAAY,CAC3B,MAAAE,EAAaR,EAAQI,CAAQ,EAC7BK,EAAoB,MAAM,QAAQD,CAAU,EAC5CE,EAAWD,EAAoB,QAAU,OAAOD,EAChDG,EACJ,CAACF,GAAqB,MAAM,QAAQH,EAAWF,CAAQ,CAAC,EACtD,GAAA,EAAAM,IAAa,aAAeA,IAAa,YAG7C,IAAIC,EAAqB,CACnB,IAAAC,EAAYN,EAAWF,CAAQ,EAC/B,GAAAQ,EAAU,SAAW,EACvB,SAEFA,EAAYA,EAAU,IACpB,KAAK,qBAAqB,KAAK,KAAMJ,CAAoB,CAAA,EAE3DF,EAAWF,CAAQ,EAAI,CAACI,CAAU,EAAE,OAAOI,CAAS,CACtD,CACA,IACGF,IAAa,UAAYD,IAC1BD,GACA,CAACG,EACD,CACAN,EAAaD,CAAQ,EAAIK,EAAoB,CAAA,EAAK,CAAA,EAClD,UAAWnmC,KAAQkmC,EACjBH,EAAaD,CAAQ,EAAE9lC,CAAI,EAAIkmC,EAAWlmC,CAAI,EAEhDimC,EAAmBH,CAAQ,EAAIK,EAAoB,CAAA,EAAK,CAAA,EACnD,KAAA,iBACHD,EACAH,EAAaD,CAAQ,EACrBE,EAAWF,CAAQ,EACnBG,EAAmBH,CAAQ,CAAA,CAC7B,MAEI,OAAOC,EAAaD,CAAQ,EAAM,MACpCC,EAAaD,CAAQ,EAAII,GAEtBC,IACHJ,EAAaD,CAAQ,GAAK,GAExBO,EACFJ,EAAmBH,CAAQ,EAAIE,EAAWF,CAAQ,EAAE,MAAA,EAAQ,UAE5DG,EAAmBH,CAAQ,EAAIC,EAAaD,CAAQ,GAAK,EAG/D,CACF,CAEA,MAAa,CAKP,OAJC,KAAK,kBACR,KAAK,gBAAkB,GACvB,KAAK,kBAAkB,GAEpB,KAAK,YAGV,KAAK,QAAU,KAAK,OAAO,OAAO,IAA2B,EAC7D,KAAK,WAAa,GAClB,KAAK,UAAY,GACb,KAAK,iBACF,KAAA,gBAAgB,KAAK,OAAO,EAE5B,MARE,IASX,CAEA,KAAY,CACV,YAAK,SAAW,GAChB,KAAK,OAAO,GAAQ,EACb,IACT,CAEA,MAAM1B,EAAeD,KAAa,CAChC,OAAI,KAAK,WAAa,CAAC,KAAK,WACnB,MAET,KAAK,UAAY,GACjB,KAAK,gBAAkBC,EACvB,KAAK,QAAU,KAAK,OAAO,OAAO,IAA2B,EACtD,KACT,CAEA,OAAOA,EAAeD,KAAa,CACjC,MAAI,CAAC,KAAK,WAAa,CAAC,KAAK,WACpB,MAET,KAAK,UAAY,GACZ,KAAA,YAAcC,EAAO,KAAK,gBAC/B,KAAK,gBAAkB,EACvB,KAAK,QAAU,KAAK,OAAO,IAAI,IAA2B,EACnD,KACT,CAEA,mBAA0B,CAElB,QAAA7kC,EAAI,EAAGgnC,EAAmB,KAAK,eAAe,OAClDhnC,EAAIgnC,EACJhnC,IAEK,KAAA,eAAeA,CAAC,EAAE,KAAK,EAEvB,OAAA,IACT,CAEA,MAAMinC,EAAQhB,EAAiB,CAC7B,YAAK,OAASgB,EACP,IACT,CAEA,MAAMvC,EAAS,EAAS,CACtB,YAAK,WAAaA,EACX,IACT,CAEA,OAAOwC,EAAQ,EAAS,CACtB,YAAK,eAAiBA,EACtB,KAAK,QAAUA,EACR,IACT,CAEA,YAAYxC,EAAuB,CACjC,YAAK,iBAAmBA,EACjB,IACT,CAEA,KAAKyC,EAAO,GAAa,CACvB,YAAK,MAAQA,EACN,IACT,CAEA,OAAOC,EAAiC3C,GAAO,OAAO,KAAY,CAChE,YAAK,gBAAkB2C,EAChB,IACT,CAEA,cACEC,EAA+ChC,GAAc,OACvD,CACN,YAAK,uBAAyBgC,EACvB,IACT,CAEA,SAASC,EAAiC,CACxC,YAAK,eAAiBA,EACf,IACT,CAEA,QAAQxlC,EAAsC,CAC5C,YAAK,iBAAmBA,EACjB,IACT,CAEA,aAAaA,EAAsC,CACjD,YAAK,sBAAwBA,EACtB,IACT,CAEA,SAASA,EAAuD,CAC9D,YAAK,kBAAoBA,EAClB,IACT,CAEA,SAASA,EAAsC,CAC7C,YAAK,kBAAoBA,EAClB,IACT,CAEA,WAAWA,EAAsC,CAC/C,YAAK,oBAAsBA,EACpB,IACT,CAEA,OAAOA,EAAsC,CAC3C,YAAK,gBAAkBA,EAChB,IACT,CAKA,OAAO+iC,EAAOD,KAAOQ,EAAY,GAAe,CAC9C,GAAI,KAAK,UAAkB,MAAA,GACvB,IAAAmB,EACAgB,EACE,MAAAC,EAAU,KAAK,WAAa,KAAK,cACvC,GAAI,CAAC,KAAK,UAAY,CAAC,KAAK,WAAY,CACtC,GAAI3C,EAAO2C,EAAgB,MAAA,GACvBpC,GAAW,KAAK,MAAMP,CAAI,CAChC,CAEI,GADJ,KAAK,SAAW,GACZA,EAAO,KAAK,WACP,MAAA,GAEL,KAAK,wBAA0B,KAC7B,KAAK,kBACF,KAAA,iBAAiB,KAAK,OAAO,EAEpC,KAAK,sBAAwB,IAE3B,KAAK,6BAA+B,KAClC,KAAK,uBACF,KAAA,sBAAsB,KAAK,OAAO,EAEzC,KAAK,2BAA6B,IAEzB0C,GAAA1C,EAAO,KAAK,YAAc,KAAK,cAC1C0C,EAAU,KAAK,gBAAkB,GAAKA,EAAU,EAAI,EAAIA,EAClD,MAAAnuC,EAAQ,KAAK,gBAAgBmuC,CAAO,EAU1C,GATK,KAAA,kBACH,KAAK,QACL,KAAK,aACL,KAAK,WACLnuC,CAAA,EAEE,KAAK,mBACF,KAAA,kBAAkB,KAAK,QAASmuC,CAAO,EAE1CA,IAAY,EACV,GAAA,KAAK,QAAU,EAAG,CAChB,SAAS,KAAK,OAAO,GAClB,KAAA,UAEF,IAAAhB,KAAY,KAAK,mBAChB,CAAC,KAAK,OAAS,OAAO,KAAK,WAAWA,CAAQ,GAAM,WACjD,KAAA,mBAAmBA,CAAQ,EAC9B,KAAK,mBAAmBA,CAAQ,EAChC,WAAW,KAAK,WAAWA,CAAQ,CAAW,GAE9C,KAAK,OACP,KAAK,0BAA0BA,CAAQ,EAEzC,KAAK,aAAaA,CAAQ,EAAI,KAAK,mBAAmBA,CAAQ,EAEhE,OAAI,KAAK,QACF,KAAA,UAAY,CAAC,KAAK,WAErB,KAAK,mBAAqB,OACvB,KAAA,WAAa1B,EAAO,KAAK,iBAEzB,KAAA,WAAaA,EAAO,KAAK,WAE5B,KAAK,mBACF,KAAA,kBAAkB,KAAK,OAAO,EAErC,KAAK,2BAA6B,GAC3B,EAAA,KACF,CACD,KAAK,qBACF,KAAA,oBAAoB,KAAK,OAAO,EAGjC,QAAA7kC,EAAI,EAAGgnC,EAAmB,KAAK,eAAe,OAClDhnC,EAAIgnC,EACJhnC,IAIA,KAAK,eAAeA,CAAC,EAAE,MAAM,KAAK,WAAa,KAAK,aAAa,EAEnE,YAAK,WAAa,GACX,EACT,CAEK,MAAA,EACT,CAEQ,kBACNmmC,EACAK,EACAC,EACArtC,EACM,CACN,UAAWmtC,KAAYE,EAAY,CAC7B,GAAAD,EAAaD,CAAQ,IAAM,OAC7B,SAEI,MAAA9tB,EAAQ+tB,EAAaD,CAAQ,GAAK,EACpC,IAAAzhC,EAAM2hC,EAAWF,CAAQ,EAC7B,MAAMkB,EAAe,MAAM,QAAQtB,EAAQI,CAAQ,CAAC,EAC9CmB,EAAa,MAAM,QAAQ5iC,CAAG,EACR,CAAC2iC,GAAgBC,EAEnCvB,EAAAI,CAAQ,EAAI,KAAK,uBACvBzhC,EACA1L,CAAA,EAEO,OAAO0L,GAAQ,UAAYA,EACpC,KAAK,kBAAkBqhC,EAAQI,CAAQ,EAAG9tB,EAAO3T,EAAK1L,CAAK,GAE3D0L,EAAM,KAAK,qBACT2T,EACA3T,CAAA,EAEE,OAAOA,GAAQ,WACjBqhC,EAAQI,CAAQ,EAAI9tB,GAAS3T,EAAM2T,GAASrf,GAGlD,CACF,CAGQ,qBAAqBqf,EAAe3T,EAA8B,CACpE,OAAA,OAAOA,GAAQ,SACVA,EAELA,EAAI,OAAO,CAAC,IAAM,KAAOA,EAAI,OAAO,CAAC,IAAM,IACtC2T,EAAQ,WAAW3T,CAAG,EAEtB,WAAWA,CAAG,CAEzB,CAEQ,0BAA0ByhC,EAAwB,CAClD,MAAAoB,EAAM,KAAK,mBAAmBpB,CAAQ,EACtCqB,EAAW,KAAK,WAAWrB,CAAQ,EACrC,OAAOqB,GAAa,SACjB,KAAA,mBAAmBrB,CAAQ,EAC9B,KAAK,mBAAmBA,CAAQ,EAAI,WAAWqB,CAAQ,EAEpD,KAAA,mBAAmBrB,CAAQ,EAAIqB,EAEjC,KAAA,WAAWrB,CAAQ,EAAIoB,CAC9B,CACF,CCxcA,MAAME,GAAS7B,GAAS,OAMlB8B,GAAS7B,EAAU,OAAO,KAAKA,CAAS,EACxC8B,GAAY9B,EAAU,UAAU,KAAKA,CAAS,EAC9C+B,GAAM/B,EAAU,IAAI,KAAKA,CAAS,EAClCgC,GAAShC,EAAU,OAAO,KAAKA,CAAS,EACxCiC,GAASjC,EAAU,OAAO,KAAKA,CAAS,EAEjCkC,GAAQ,CACnB,OAAA1D,GACA,MAAAM,GACA,cAAAM,GAAA,IACAT,GACA,SAAAoB,GACA,OAAA6B,GACA,MAAA3B,GACA,OAAA4B,GACA,UAAAC,GACA,IAAAC,GACA,OAAAC,GACA,OAAAC,EACF,EC/BA,MAAME,EAAO,CAKX,YAAYn3B,EAAG,CACbA,EAAIA,GAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC1B,KAAK,EAAI,CAACA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,CAC7C,CAED,MAAO,CACL,YAAK,EAAI,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACnB,IACR,CAED,SAASA,EAAG,CACV,MAAMsnB,EAAK,KAAK,EAChB,IAAIC,EAEAvnB,aAAam3B,GACf5P,EAAKvnB,EAAE,EAEPunB,EAAKvnB,EAGP,MAAMo3B,EAAM9P,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EACtC8P,EAAM/P,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EAClC+P,EAAMhQ,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EAClCgQ,EAAMjQ,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EAE9BiQ,EAAKlQ,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAC7CmQ,EAAKnQ,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAAIC,EAAG,CAAC,EAAID,EAAG,CAAC,EAE3C,OAAAA,EAAG,CAAC,EAAI8P,EACR9P,EAAG,CAAC,EAAI+P,EACR/P,EAAG,CAAC,EAAIgQ,EACRhQ,EAAG,CAAC,EAAIiQ,EACRjQ,EAAG,CAAC,EAAIkQ,EACRlQ,EAAG,CAAC,EAAImQ,EAED,IACR,CAED,SAAU,CACR,MAAMC,EAAM,IAAIP,GAAO,KAAK,CAAC,EAC3BQ,EAAOD,EAAI,EAEPjxC,EAAI,GAAKkxC,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,GACjDtQ,EAAKsQ,EAAK,CAAC,EAAIlxC,EACf6gC,EAAK,CAACqQ,EAAK,CAAC,EAAIlxC,EAChB8gC,EAAK,CAACoQ,EAAK,CAAC,EAAIlxC,EAChB+gC,EAAKmQ,EAAK,CAAC,EAAIlxC,EACfmxC,EAAKnxC,GAAKkxC,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,GAC9CE,EAAKpxC,GAAKkxC,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAIA,EAAK,CAAC,GAEhD,OAAAA,EAAK,CAAC,EAAItQ,EACVsQ,EAAK,CAAC,EAAIrQ,EACVqQ,EAAK,CAAC,EAAIpQ,EACVoQ,EAAK,CAAC,EAAInQ,EACVmQ,EAAK,CAAC,EAAIC,EACVD,EAAK,CAAC,EAAIE,EAEHH,CACR,CAMD,UAAU57B,EAAGygB,EAAG,CACd,OAAO,KAAK,SAAS,CAAC,EAAG,EAAG,EAAG,EAAGzgB,EAAGygB,CAAC,CAAC,CACxC,CAMD,OAAOub,EAAK,CACV,MAAMC,EAAOD,EAAM,KAAK,GAAM,IAC5BhxC,EAAI,KAAK,IAAIixC,CAAG,EAChB5oC,EAAI,KAAK,IAAI4oC,CAAG,EAElB,OAAO,KAAK,SAAS,CAACjxC,EAAGqI,EAAG,CAACA,EAAGrI,EAAG,EAAG,CAAC,CAAC,CACzC,CAMD,KAAKkxC,EAAMC,EAAM,CACfA,GAAQ,EACR,MAAMC,EAAQF,EAAO,KAAK,GAAM,IAC9BG,EAAQF,EAAO,KAAK,GAAM,IACtBG,EAAK,KAAK,IAAIF,CAAI,EACtBG,EAAK,KAAK,IAAIF,CAAI,EAEpB,OAAO,KAAK,SAAS,CAAC,EAAGE,EAAID,EAAI,EAAG,EAAG,CAAC,CAAC,CAC1C,CAMD,MAAMt3B,EAAIw3B,EAAI,CACZ,OAAO,KAAK,SAAS,CAACx3B,EAAI,EAAG,EAAGw3B,EAAI,EAAG,CAAC,CAAC,CAC1C,CAED,eAAiB,SAAUC,EAAIC,EAAI,CACjC,MAAM18B,EAAIy8B,EACRhc,EAAIic,EACN,OAAAD,EAAKz8B,EAAI,KAAK,EAAE,CAAC,EAAIygB,EAAI,KAAK,EAAE,CAAC,EAAI,KAAK,EAAE,CAAC,EAC7Cic,EAAK18B,EAAI,KAAK,EAAE,CAAC,EAAIygB,EAAI,KAAK,EAAE,CAAC,EAAI,KAAK,EAAE,CAAC,EAEtC,CAACgc,EAAIC,CAAE,CAClB,EAEE,gBAAgBD,EAAIC,EAAI,CACtB,MAAM18B,EAAIy8B,EACRhc,EAAIic,EACN,OAAAD,EAAKz8B,EAAI,KAAK,EAAE,CAAC,EAAIygB,EAAI,KAAK,EAAE,CAAC,EACjCic,EAAK18B,EAAI,KAAK,EAAE,CAAC,EAAIygB,EAAI,KAAK,EAAE,CAAC,EAE1B,CAACgc,EAAIC,CAAE,CACf,CACH,CC9HA,SAASC,GAAchyC,EAAG,CACxB,MAAM0F,EAAO,SAAS,gBAAgB,6BAA8B,MAAM,EAC1E,OAAAA,EAAK,aAAa,IAAK1F,CAAC,EACjB0F,CACT,CAEO,SAASusC,GAAiBjyC,EAAGkN,EAAK,CACvC,MAAMxH,EAAOssC,GAAchyC,CAAC,EACtB,CAAE,EAAAqV,EAAG,EAAAygB,CAAC,EAAKpwB,EAAK,iBAAiBwH,CAAG,EAC1C,MAAO,CAACmI,EAAGygB,CAAC,CACd,CAEO,SAASoc,GAAelyC,EAAGkN,EAAK,CAErC,OADa8kC,GAAchyC,CAAC,EAChB,eAAekN,CAAG,CAChC,CAEA,IAAIilC,EAAU,KACP,SAASC,GAAc,CAAE,EAAApyC,GAAKqV,EAAGygB,EAAG,CACpCqc,IAASA,EAAU,SAAS,cAAc,QAAQ,EAAE,WAAW,IAAI,GACxE,MAAMzsC,EAAO,IAAI,OAAO1F,CAAC,EACzB,OAAOmyC,EAAQ,cAAczsC,EAAM2P,EAAGygB,CAAC,CACzC,CAEO,SAASuc,GACd,CAAE,EAAAryC,CAAG,EACLqV,EACAygB,EACA,CAAE,UAAAwc,EAAY,EAAG,QAAAC,EAAU,OAAQ,SAAAC,EAAW,OAAS,EACvD,CAEA,GADKL,IAASA,EAAU,SAAS,cAAc,QAAQ,EAAE,WAAW,IAAI,GACpEA,EAAQ,gBAAiB,CAC3BA,EAAQ,KAAI,EACZA,EAAQ,UAAYG,EACpBH,EAAQ,QAAUI,EAClBJ,EAAQ,SAAWK,EACnB,MAAM9sC,EAAO,IAAI,OAAO1F,CAAC,EACnBwjB,EAAM2uB,EAAQ,gBAAgBzsC,EAAM2P,EAAGygB,CAAC,EAC9C,OAAAqc,EAAQ,QAAO,EACR3uB,CACR,CACH,CCnCA,IAAItO,GAAS,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAMpEu9B,GAAU,mCAUC,SAASC,GAAMhtC,EAAM,CAClC,IAAIpE,EAAO,CAAA,EACX,OAAAoE,EAAK,QAAQ+sC,GAAS,SAAUja,EAAGma,EAASC,EAAM,CAChD,IAAIvpC,EAAOspC,EAAQ,cAWnB,IAVAC,EAAOC,GAAYD,CAAI,EAGnBvpC,GAAQ,KAAOupC,EAAK,OAAS,IAC/BtxC,EAAK,KAAK,CAACqxC,CAAO,EAAE,OAAOC,EAAK,OAAO,EAAG,CAAC,CAAC,CAAC,EAC7CvpC,EAAO,IACPspC,EAAUA,GAAW,IAAM,IAAM,OAItB,CACX,GAAIC,EAAK,QAAU19B,GAAO7L,CAAI,EAC5B,OAAAupC,EAAK,QAAQD,CAAO,EACbrxC,EAAK,KAAKsxC,CAAI,EAEvB,GAAIA,EAAK,OAAS19B,GAAO7L,CAAI,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACrE/H,EAAK,KAAK,CAACqxC,CAAO,EAAE,OAAOC,EAAK,OAAO,EAAG19B,GAAO7L,CAAI,CAAC,CAAC,CAAC,CACzD,CACL,CAAG,EACM/H,CACT,CAEA,IAAIwxC,GAAS,oCACb,SAASD,GAAYD,EAAM,CACzB,IAAIG,EAAUH,EAAK,MAAME,EAAM,EAC/B,OAAOC,EAAUA,EAAQ,IAAI,MAAM,EAAI,CAAA,CACzC,CC5Ce,SAASC,GAAWttC,EAAM,CACvC,IAAIutC,EAAS,EACTC,EAAS,EACT79B,EAAI,EACJygB,EAAI,EAER,OAAOpwB,EAAK,IAAI,SAAUytC,EAAK,CAC7BA,EAAMA,EAAI,QACV,IAAI9pC,EAAO8pC,EAAI,CAAC,EACZR,EAAUtpC,EAAK,cAGnB,GAAIA,GAAQspC,EAEV,OADAQ,EAAI,CAAC,EAAIR,EACDtpC,EAAI,CACV,IAAK,IACH8pC,EAAI,CAAC,GAAK99B,EACV89B,EAAI,CAAC,GAAKrd,EACV,MACF,IAAK,IACHqd,EAAI,CAAC,GAAKrd,EACV,MACF,IAAK,IACHqd,EAAI,CAAC,GAAK99B,EACV,MACF,QACE,QAAS/M,EAAI,EAAGA,EAAI6qC,EAAI,QACtBA,EAAI7qC,GAAG,GAAK+M,EACZ89B,EAAI7qC,GAAG,GAAKwtB,CAEjB,CAIH,OAAQ6c,EAAO,CACb,IAAK,IACHt9B,EAAI49B,EACJnd,EAAIod,EACJ,MACF,IAAK,IACH79B,EAAI89B,EAAI,CAAC,EACT,MACF,IAAK,IACHrd,EAAIqd,EAAI,CAAC,EACT,MACF,IAAK,IACH99B,EAAI49B,EAASE,EAAI,CAAC,EAClBrd,EAAIod,EAASC,EAAI,CAAC,EAClB,MACF,QACE99B,EAAI89B,EAAIA,EAAI,OAAS,CAAC,EACtBrd,EAAIqd,EAAIA,EAAI,OAAS,CAAC,CACzB,CAED,OAAOA,CACX,CAAG,CACH,CC3DA,MAAMC,GAAM,KAAK,GAAK,EAOtB,SAASC,GAAkBC,EAAIC,EAAIC,EAAIC,EAAI,CACzC,MAAMC,EAAOJ,EAAKG,EAAKF,EAAKC,EAAK,EAAI,GAAK,EAC1C,IAAIG,EAAML,EAAKE,EAAKD,EAAKE,EAMzB,OAAIE,EAAM,IACRA,EAAM,GAEJA,EAAM,KACRA,EAAM,IAGDD,EAAO,KAAK,KAAKC,CAAG,CAC7B,CAOA,SAASC,GAAeC,EAAIC,EAAIC,EAAIC,EAAI5Z,EAAI6Z,EAAIC,EAAIC,EAAIC,EAASC,EAAS,CAOxE,MAAMC,EAAOD,GAAWR,EAAKE,GAAO,EAAKK,GAAWN,EAAKE,GAAO,EAC1DO,EAAO,CAACH,GAAWP,EAAKE,GAAO,EAAKM,GAAWP,EAAKE,GAAO,EAE3DQ,EAAQN,EAAKA,EACbO,EAAQN,EAAKA,EACbO,EAASJ,EAAMA,EACfK,EAASJ,EAAMA,EAOrB,IAAIK,EAAWJ,EAAQC,EAAQD,EAAQG,EAASF,EAAQC,EAEpDE,EAAW,IAEbA,EAAW,GAGbA,GAAYJ,EAAQG,EAASF,EAAQC,EACrCE,EAAW,KAAK,KAAKA,CAAQ,GAAKxa,IAAO6Z,EAAK,GAAK,GAEnD,MAAMY,EAAQD,EAAWV,EAAMC,EAAMI,EAC/BO,EAAQF,EAAW,CAACT,EAAMD,EAAMI,EAOhCrV,EAAKoV,EAAUQ,EAAMT,EAAUU,GAAOjB,EAAKE,GAAM,EACjD7U,EAAKkV,EAAUS,EAAMR,EAAUS,GAAOhB,EAAKE,GAAM,EAMjDe,GAAOT,EAAMO,GAAOX,EACpBc,GAAOT,EAAMO,GAAOX,EACpBc,GAAO,CAACX,EAAMO,GAAOX,EACrBgB,GAAO,CAACX,EAAMO,GAAOX,EAErBgB,EAAS9B,GAAkB,EAAG,EAAG0B,EAAKC,CAAG,EAC/C,IAAII,EAAc/B,GAAkB0B,EAAKC,EAAKC,EAAKC,CAAG,EAEtD,OAAIjB,IAAO,GAAKmB,EAAc,IAC5BA,GAAehC,IAEba,IAAO,GAAKmB,EAAc,IAC5BA,GAAehC,IAGV,CAACnU,EAAIC,EAAIiW,EAAQC,CAAW,CACrC,CAMA,SAASC,GAAqBF,EAAQC,EAAa,CACjD,MAAME,EAAS,mBAAS,KAAK,IAAIF,EAAc,CAAC,EAE1CvB,EAAK,KAAK,IAAIsB,CAAM,EACpBrB,EAAK,KAAK,IAAIqB,CAAM,EACpBpB,EAAK,KAAK,IAAIoB,EAASC,CAAW,EAClCpB,EAAK,KAAK,IAAImB,EAASC,CAAW,EAExC,MAAO,CACLvB,EACAC,EACAD,EAAKC,EAAKwB,EACVxB,EAAKD,EAAKyB,EACVvB,EAAKC,EAAKsB,EACVtB,EAAKD,EAAKuB,EACVvB,EACAC,CACJ,CACA,CAEe,SAASuB,GAAI1B,EAAIC,EAAIC,EAAIC,EAAI5Z,EAAI6Z,EAAIC,EAAIC,EAAIqB,EAAK,CAC/D,MAAMpB,EAAU,KAAK,IAAKoB,EAAMpC,GAAO,GAAG,EACpCiB,EAAU,KAAK,IAAKmB,EAAMpC,GAAO,GAAG,EAIpCkB,EAAOD,GAAWR,EAAKE,GAAO,EAAKK,GAAWN,EAAKE,GAAO,EAC1DO,EAAO,CAACH,GAAWP,EAAKE,GAAO,EAAKM,GAAWP,EAAKE,GAAO,EAEjE,GAAIM,IAAQ,GAAKC,IAAQ,EAEvB,MAAO,GAGT,GAAIL,IAAO,GAAKC,IAAO,EAErB,MAAO,GAKTD,EAAK,KAAK,IAAIA,CAAE,EAChBC,EAAK,KAAK,IAAIA,CAAE,EAEhB,MAAMsB,EAAUnB,EAAMA,GAAQJ,EAAKA,GAAOK,EAAMA,GAAQJ,EAAKA,GACzDsB,EAAS,IACXvB,GAAM,KAAK,KAAKuB,CAAM,EACtBtB,GAAM,KAAK,KAAKsB,CAAM,GAKxB,MAAMpc,EAAKua,GAAeC,EAAIC,EAAIC,EAAIC,EAAI5Z,EAAI6Z,EAAIC,EAAIC,EAAIC,EAASC,CAAO,EAEpEjzC,EAAS,CAAA,EACf,IAAI+zC,EAAS9b,EAAG,CAAC,EACb+b,EAAc/b,EAAG,CAAC,EAKtB,MAAMqc,EAAW,KAAK,IAAI,KAAK,KAAK,KAAK,IAAIN,CAAW,GAAKhC,GAAM,EAAE,EAAG,CAAC,EACzEgC,GAAeM,EAEf,QAASptC,EAAI,EAAGA,EAAIotC,EAAUptC,IAC5BlH,EAAO,KAAKi0C,GAAqBF,EAAQC,CAAW,CAAC,EACrDD,GAAUC,EAMZ,OAAOh0C,EAAO,IAAKu0C,GAAU,CAC3B,QAASrtC,EAAI,EAAGA,EAAIqtC,EAAM,OAAQrtC,GAAK,EAAG,CACxC,IAAI+M,EAAIsgC,EAAMrtC,EAAI,CAAC,EACfwtB,EAAI6f,EAAMrtC,EAAI,CAAC,EAGnB+M,GAAK6+B,EACLpe,GAAKqe,EAGL,MAAMyB,EAAKvB,EAAUh/B,EAAI++B,EAAUte,EAC7B+f,EAAKzB,EAAU/+B,EAAIg/B,EAAUve,EAGnC6f,EAAMrtC,EAAI,CAAC,EAAIstC,EAAKvc,EAAG,CAAC,EACxBsc,EAAMrtC,EAAI,CAAC,EAAIutC,EAAKxc,EAAG,CAAC,CACzB,CAED,OAAOsc,CACX,CAAG,CACH,CC/Le,SAASG,GAAUpwC,EAAM,CAatC,QAXI2I,EACAjN,EAAS,CAAA,EACT20C,EAAU,EACVC,EAAU,EACV/C,EAAS,EACTC,EAAS,EACT+C,EAAQ,KACRC,EAAQ,KACR7gC,EAAI,EACJygB,EAAI,EAECxtB,EAAI,EAAG4E,EAAMxH,EAAK,OAAQ4C,EAAI4E,EAAK5E,IAAK,CAC/C,IAAI6qC,EAAMztC,EAAK4C,CAAC,EACZqqC,EAAUQ,EAAI,CAAC,EAEnB,OAAQR,EAAO,CACb,IAAK,IACHM,EAASE,EAAI,CAAC,EACdD,EAASC,EAAI,CAAC,EACd,MACF,IAAK,IACH,IAAIgD,EAASZ,GACXlgC,EACAygB,EACAqd,EAAI,CAAC,EACLA,EAAI,CAAC,EACLA,EAAI,CAAC,EACLA,EAAI,CAAC,EACLA,EAAI,CAAC,EACLA,EAAI,CAAC,EACLA,EAAI,CAAC,CACf,EAEQ,GAAI,CAACgD,EAAO,OAAQ,SAEpBA,EAASA,EAAO,IAAKR,GAAU,CAC7B,KAAM,CAACS,EAAIC,EAAIxC,EAAIC,EAAIC,EAAIC,EAAI3+B,EAAGygB,CAAC,EAAI6f,EACvC,MAAO,CAAE,GAAA9B,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,EAAI,EAAA3+B,EAAG,EAAAygB,EACtC,CAAS,EAED,QAAStmB,EAAI,EAAGnP,EAAGmP,EAAI2mC,EAAO,OAAQ3mC,IACpCnP,EAAI81C,EAAO3mC,CAAC,EACZ2jC,EAAM,CAAC,IAAK9yC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAGA,EAAE,CAAC,EACxCmP,EAAI2mC,EAAO,OAAS,GAAG/0C,EAAO,KAAK+xC,CAAG,EAG5C,MACF,IAAK,IAEH,IAAIlU,EAAK5pB,EACL6pB,EAAKpJ,GACLznB,GAAQ,KAAOA,GAAQ,OACzB4wB,GAAMA,EAAK8W,EACX7W,GAAMA,EAAK8W,GAEb7C,EAAM,CAAC,IAAKlU,EAAIC,EAAIiU,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAClD,MACF,IAAK,IACC9kC,GAAQ,KAAOA,GAAQ,KACzB4nC,EAAQ5gC,EAAI,EAAI4gC,EAChBC,EAAQpgB,EAAI,EAAIogB,IAEhBD,EAAQ5gC,EACR6gC,EAAQpgB,GAEVqd,EAAMmD,GAAUjhC,EAAGygB,EAAGmgB,EAAOC,EAAO/C,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAClD,MACF,IAAK,IACH8C,EAAQ9C,EAAI,CAAC,EACb+C,EAAQ/C,EAAI,CAAC,EACbA,EAAMmD,GAAUjhC,EAAGygB,EAAGqd,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EACpD,MACF,IAAK,IACHA,EAAMoD,GAAKlhC,EAAGygB,EAAGqd,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC/B,MACF,IAAK,IACHA,EAAMoD,GAAKlhC,EAAGygB,EAAGqd,EAAI,CAAC,EAAGrd,CAAC,EAC1B,MACF,IAAK,IACHqd,EAAMoD,GAAKlhC,EAAGygB,EAAGzgB,EAAG89B,EAAI,CAAC,CAAC,EAC1B,MACF,IAAK,IACHA,EAAMoD,GAAKlhC,EAAGygB,EAAGmd,EAAQC,CAAM,EAC/B,KACH,CAGD7kC,EAAOskC,EACPt9B,EAAI89B,EAAIA,EAAI,OAAS,CAAC,EACtBrd,EAAIqd,EAAIA,EAAI,OAAS,CAAC,EAClBA,EAAI,OAAS,GACf4C,EAAU5C,EAAIA,EAAI,OAAS,CAAC,EAC5B6C,EAAU7C,EAAIA,EAAI,OAAS,CAAC,IAE5B4C,EAAU1gC,EACV2gC,EAAUlgB,GAEZ10B,EAAO,KAAK+xC,CAAG,CAChB,CAED,OAAO/xC,CACT,CAEA,SAASm1C,GAAK1C,EAAIC,EAAIC,EAAIC,EAAI,CAC5B,MAAO,CAAC,IAAKH,EAAIC,EAAIC,EAAIC,EAAID,EAAIC,CAAE,CACrC,CAEA,SAASsC,GAAUzC,EAAIC,EAAI7U,EAAIC,EAAI6U,EAAIC,EAAI,CACzC,MAAO,CACL,IACAH,EAAK,EAAK,kBAAS5U,EACnB6U,EAAK,EAAK,kBAAS5U,EACnB6U,EAAK,EAAK,kBAAS9U,EACnB+U,EAAK,EAAK,kBAAS9U,EACnB6U,EACAC,CACJ,CACA,CCrHe,SAASwC,GAAUnxC,EAAK,CACrC,OAAI,OAAOA,GAAQ,SAAiB,IACpCA,EAAMA,EAAI,OAGR,0CAA0C,KAAKA,CAAG,GAClD,UAAU,KAAKA,CAAG,GAClBA,EAAI,OAAS,EAEjB,CCMA,MAAMoxC,GAAe,OAAO,aAAa,EACnCC,GAAQ,OAAO,MAAM,EACrBC,GAAU,OAAO,QAAQ,EACzBC,GAAc,OAAO,YAAY,EACjCC,GAAe,OAAO,aAAa,EACnCC,GAAa,OAAO,WAAW,EAE9B,MAAMC,EAAQ,CACnB,YAAY/2C,EAAG,CACb,GAAI,CAACw2C,GAAUx2C,CAAC,EACd,MAAM,IAAI,MAAM,kBAAkB,EAGpC,KAAKy2C,EAAY,EAAIO,GAAItE,GAAM1yC,CAAC,CAAC,EACjC,KAAK02C,EAAK,EAAIZ,GAAU,KAAKW,EAAY,CAAC,EAC1C,KAAKE,EAAO,EAAI,KAChB,KAAKC,EAAW,EAAI,GACpB,KAAKC,EAAY,EAAI,GACrB,KAAKC,EAAU,EAAI,EACpB,CAED,MAAO,CACL,YAAKF,EAAW,EAAE,KAAK,CACrB,KAAM,KAAKF,EAAK,EAChB,OAAQ,KAAKC,EAAO,EACpB,YAAa,OAAO,OAAO,CAAE,EAAE,KAAKE,EAAY,CAAC,CACvD,CAAK,EACM,IACR,CAED,SAAU,CACR,GAAI,KAAKD,EAAW,EAAE,OAAQ,CAC5B,KAAM,CAAE,KAAAlxC,EAAM,OAAAuxC,EAAQ,YAAAC,CAAW,EAAK,KAAKN,EAAW,EAAE,MACxD,KAAKF,EAAK,EAAIhxC,EACd,KAAKixC,EAAO,EAAIM,EAChB,KAAKJ,EAAY,EAAIK,CACtB,CACD,OAAO,IACR,CAED,IAAI,QAAS,CACX,GAAI,CAAC,KAAKP,EAAO,EAAG,CAClB,MAAMjxC,EAAO,KAAKgxC,EAAK,EAEvB,GADA,KAAKC,EAAO,EAAI,CAAC,EAAG,EAAG,EAAG,CAAC,EACvBjxC,EAAK,OAAQ,CACf,MAAMuxC,EAAS,CAAC,IAAU,IAAU,KAAW,IAAS,EAExD,QAAS,EAAI,EAAG1uC,EAAI7C,EAAK,OAAQ,EAAI6C,EAAG,IAAK,CAC3C,MAAM4uC,EAASzxC,EAAK,CAAC,EAAE,MAAM,CAAC,EAE9B,QAAS8J,EAAI,EAAGA,EAAI2nC,EAAO,OAAQ3nC,GAAK,EAClC2nC,EAAO3nC,EAAI,CAAC,EAAIynC,EAAO,CAAC,IAAGA,EAAO,CAAC,EAAIE,EAAO3nC,EAAI,CAAC,GACnD2nC,EAAO3nC,EAAI,CAAC,EAAIynC,EAAO,CAAC,IAAGA,EAAO,CAAC,EAAIE,EAAO3nC,EAAI,CAAC,GACnD2nC,EAAO3nC,EAAI,CAAC,EAAIynC,EAAO,CAAC,IAAGA,EAAO,CAAC,EAAIE,EAAO3nC,EAAI,CAAC,GACnD2nC,EAAO3nC,EAAI,CAAC,EAAIynC,EAAO,CAAC,IAAGA,EAAO,CAAC,EAAIE,EAAO3nC,EAAI,CAAC,EAE1D,CACD,KAAKmnC,EAAO,EAAIM,CACjB,CACF,CACD,OAAO,KAAKN,EAAO,CACpB,CAED,IAAI,MAAO,CACT,MAAMM,EAAS,KAAK,OACpB,MAAO,CAACA,EAAO,CAAC,EAAIA,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAIA,EAAO,CAAC,CAAC,CACrD,CAED,IAAI,QAAS,CACX,KAAM,CAACb,EAAIC,EAAIxC,EAAIC,CAAE,EAAI,KAAK,OAC9B,MAAO,EAAEsC,EAAKvC,GAAM,GAAIwC,EAAKvC,GAAM,CAAC,CACrC,CAED,IAAI,GAAI,CACN,IAAIpuC,EAAO,KAAKgxC,EAAK,EAClB,IAAK1wC,GAAM,CACV,KAAM,CAAC3F,EAAG,GAAG82C,CAAM,EAAInxC,EACvB,OAAO3F,EAAI82C,EAAO,MAC1B,CAAO,EACA,KAAK,EAAE,EACV,OAAI,KAAK,WACPzxC,GAAQ,KAEHA,CACR,CAED,IAAI,MAAO,CACT,OAAO,KAAKgxC,EAAK,CAClB,CAED,IAAI,UAAW,CACb,MAAMU,EAAO,KAAKX,EAAY,EAAE,KAAKA,EAAY,EAAE,OAAS,CAAC,EAC7D,OAAOW,GAAQA,EAAK,CAAC,IAAM,GAC5B,CAED,cAAc/hC,EAAGygB,EAAG,CAClB,OAAOsc,GAAc,KAAM/8B,EAAGygB,CAAC,CAChC,CAED,gBACEzgB,EACAygB,EACA,CAAE,UAAAwc,EAAY,EAAG,QAAAC,EAAU,OAAQ,SAAAC,EAAW,OAAS,EACvD,CACA,GAAIH,GACF,OAAOA,GAAgB,KAAMh9B,EAAGygB,EAAG,CAAE,UAAAwc,EAAW,QAAAC,EAAS,SAAAC,CAAQ,CAAE,CAGtE,CAED,iBAAiBtlC,EAAK,CACpB,OAAO+kC,GAAiB,KAAK,EAAG/kC,CAAG,CACpC,CAED,gBAAiB,CACf,OAAOglC,GAAe,KAAK,CAAC,CAC7B,CAED,aAAaU,EAAM,CACjB,KAAK+D,EAAO,EAAI,KAChB,MAAMp9B,EAAI,IAAIm3B,GAAOkC,CAAI,EACnByE,EAAW,KAAKX,EAAK,EAC3B,YAAKA,EAAK,EAAIW,EAAS,IAAKh3C,GAAM,CAChC,KAAM,CAACi3C,EAAK,GAAG1E,CAAI,EAAIvyC,EACjBk3C,EAAc,CAACD,CAAG,EACxB,QAAShvC,EAAI,EAAGA,EAAIsqC,EAAK,OAAQtqC,GAAK,EAAG,CACvC,MAAM8tC,EAAKxD,EAAKtqC,CAAC,EACf+tC,EAAKzD,EAAKtqC,EAAI,CAAC,EACX,CAAC+M,EAAGygB,CAAC,EAAIvc,EAAE,eAAe68B,EAAIC,CAAE,EACtCkB,EAAY,KAAKliC,EAAGygB,CAAC,CACtB,CACD,OAAOyhB,CACb,CAAK,EACM,IACR,CAED,UAAUliC,EAAGygB,EAAG,CACd,MAAMvc,EAAI,IAAIm3B,GAAM,EAAG,UAAUr7B,EAAGygB,CAAC,EACrC,OAAO,KAAK,UAAU,GAAGvc,EAAE,CAAC,CAC7B,CAED,OAAO83B,EAAK,CACV,MAAM93B,EAAI,IAAIm3B,GAAQ,EAAC,OAAOW,CAAG,EACjC,OAAO,KAAK,UAAU,GAAG93B,EAAE,CAAC,CAC7B,CAED,MAAMc,EAAIw3B,EAAI,CACRA,GAAM,OAAMA,EAAKx3B,GACrB,MAAMd,EAAI,IAAIm3B,GAAM,EAAG,MAAMr2B,EAAIw3B,CAAE,EACnC,OAAO,KAAK,UAAU,GAAGt4B,EAAE,CAAC,CAC7B,CAED,KAAKg4B,EAAMC,EAAM,CACf,MAAMj4B,EAAI,IAAIm3B,GAAM,EAAG,KAAKa,EAAMC,CAAI,EACtC,OAAO,KAAK,UAAU,GAAGj4B,EAAE,CAAC,CAC7B,CAED,MAAO,CACL,KAAM,CAAClE,EAAGygB,CAAC,EAAI,KAAK,OACpB,YAAK,UAAU,CAACzgB,EAAG,CAACygB,CAAC,EACd,IACR,CAED,WAAY,CACV,YAAKghB,EAAU,EAAI,GACZ,IACR,CAED,SAAS3E,EAAS,CAChB,MAAMkF,EAAW,KAAKX,EAAK,EACrBQ,EAAc,KAAKL,EAAY,EACrC,OAAIQ,EAAS,SACP,KAAKP,EAAU,GACjB3E,EAAQ,UAAS,EAEnBkF,EAAS,QAASh3C,GAAM,CACtB,KAAM,CAACi3C,EAAK,GAAG1E,CAAI,EAAIvyC,EACnBi3C,IAAQ,IACVnF,EAAQ,OAAO,GAAGS,CAAI,EAEtBT,EAAQ,cAAc,GAAGS,CAAI,CAEvC,CAAO,EACG,KAAK,UACPT,EAAQ,UAAS,GAGrB,OAAO,OAAOA,EAAS+E,CAAW,EAC3B,CACL,QAAS,CACP,OAAA/E,EAAQ,OAAM,EACP,IACR,EACD,MAAO,CACL,OAAAA,EAAQ,KAAI,EACL,IACR,CACP,CACG,CAED,YAAYzwC,EAAO,CACjB,YAAKm1C,EAAY,EAAE,YAAcn1C,EAC1B,IACR,CAED,UAAUA,EAAO,CACf,YAAKm1C,EAAY,EAAE,UAAYn1C,EACxB,IACR,CAED,UAAUA,EAAO,CACf,YAAKm1C,EAAY,EAAE,UAAYn1C,EACxB,IACR,CAED,QAAQA,EAAO,CACb,YAAKm1C,EAAY,EAAE,QAAUn1C,EACtB,IACR,CAED,SAASA,EAAO,CACd,YAAKm1C,EAAY,EAAE,SAAWn1C,EACvB,IACR,CACH","x_google_ignoreList":[16,17]}