{"version":3,"file":"common-25091b06.js","sources":["../../node_modules/base64-js/index.js","../../node_modules/@babel/runtime/helpers/esm/extends.js","../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../node_modules/@babel/runtime/helpers/esm/typeof.js","../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js","../../node_modules/@babel/runtime/helpers/esm/toPrimitive.js","../../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","../../node_modules/@babel/runtime/helpers/esm/createClass.js","../../node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js","../../node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js","../../node_modules/@babel/runtime/helpers/esm/inherits.js","../../node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js","../../node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js","../../node_modules/@babel/runtime/helpers/esm/defineProperty.js","../../node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js","../../node_modules/@babel/runtime/helpers/esm/iterableToArray.js","../../node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","../../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js","../../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js","../../node_modules/@babel/runtime/helpers/esm/toArray.js","../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js","../../node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js","../../node_modules/@babel/runtime/helpers/esm/slicedToArray.js","../../node_modules/cross-fetch/dist/browser-ponyfill.js","../../node_modules/@babel/runtime/helpers/esm/inheritsLoose.js","../../node_modules/@babel/runtime/helpers/interopRequireDefault.js","../../node_modules/events/events.js","../../node_modules/inherits/inherits_browser.js","../../node_modules/pako/lib/zlib/zstream.js","../../node_modules/pako/lib/utils/common.js","../../node_modules/pako/lib/zlib/trees.js","../../node_modules/pako/lib/zlib/adler32.js","../../node_modules/pako/lib/zlib/crc32.js","../../node_modules/pako/lib/zlib/messages.js","../../node_modules/pako/lib/zlib/deflate.js","../../node_modules/pako/lib/zlib/inffast.js","../../node_modules/pako/lib/zlib/inftrees.js","../../node_modules/pako/lib/zlib/inflate.js","../../node_modules/pako/lib/zlib/constants.js","../../node_modules/browserify-zlib/lib/binding.js","../../node_modules/browserify-zlib/lib/index.js","../../node_modules/pngjs/lib/chunkstream.js","../../node_modules/pngjs/lib/interlace.js","../../node_modules/pngjs/lib/paeth-predictor.js","../../node_modules/pngjs/lib/filter-parse.js","../../node_modules/pngjs/lib/filter-parse-async.js","../../node_modules/pngjs/lib/constants.js","../../node_modules/pngjs/lib/crc.js","../../node_modules/pngjs/lib/parser.js","../../node_modules/pngjs/lib/bitmapper.js","../../node_modules/pngjs/lib/format-normaliser.js","../../node_modules/pngjs/lib/parser-async.js","../../node_modules/pngjs/lib/bitpacker.js","../../node_modules/pngjs/lib/filter-pack.js","../../node_modules/pngjs/lib/packer.js","../../node_modules/pngjs/lib/packer-async.js","../../node_modules/pngjs/lib/sync-inflate.js","../../node_modules/pngjs/lib/sync-reader.js","../../node_modules/pngjs/lib/filter-parse-sync.js","../../node_modules/pngjs/lib/parser-sync.js","../../node_modules/pngjs/lib/packer-sync.js","../../node_modules/pngjs/lib/png-sync.js","../../node_modules/pngjs/lib/png.js","../../node_modules/queue/index.js","../../node_modules/@babel/runtime/helpers/esm/regeneratorRuntime.js","../../node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js","../../node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js","../../node_modules/object-assign/index.js"],"sourcesContent":["'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","export default function _extends() {\n  _extends = Object.assign ? Object.assign.bind() : function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n    return target;\n  };\n  return _extends.apply(this, arguments);\n}","export default function _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n  return target;\n}","export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, _typeof(obj);\n}","export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","import _typeof from \"./typeof.js\";\nexport default function _toPrimitive(input, hint) {\n  if (_typeof(input) !== \"object\" || input === null) return input;\n  var prim = input[Symbol.toPrimitive];\n  if (prim !== undefined) {\n    var res = prim.call(input, hint || \"default\");\n    if (_typeof(res) !== \"object\") return res;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (hint === \"string\" ? String : Number)(input);\n}","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nexport default function _toPropertyKey(arg) {\n  var key = toPrimitive(arg, \"string\");\n  return _typeof(key) === \"symbol\" ? key : String(key);\n}","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);\n  }\n}\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}","export default function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n  return self;\n}","export default function _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n  return _setPrototypeOf(o, p);\n}","import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  Object.defineProperty(subClass, \"prototype\", {\n    writable: false\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}","import _typeof from \"./typeof.js\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nexport default function _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  } else if (call !== void 0) {\n    throw new TypeError(\"Derived constructors may only return object or undefined\");\n  }\n  return assertThisInitialized(self);\n}","export default function _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}","import toPropertyKey from \"./toPropertyKey.js\";\nexport default function _defineProperty(obj, key, value) {\n  key = toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}","export default function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}","export default function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}","export default function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];\n  return arr2;\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}","export default function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _toArray(arr) {\n  return arrayWithHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableRest();\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose.js\";\nexport default function _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n  return target;\n}","export default function _iterableToArrayLimit(arr, i) {\n  var _i = null == arr ? null : \"undefined\" != typeof Symbol && arr[Symbol.iterator] || arr[\"@@iterator\"];\n  if (null != _i) {\n    var _s,\n      _e,\n      _x,\n      _r,\n      _arr = [],\n      _n = !0,\n      _d = !1;\n    try {\n      if (_x = (_i = _i.call(arr)).next, 0 === i) {\n        if (Object(_i) !== _i) return;\n        _n = !1;\n      } else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0);\n    } catch (err) {\n      _d = !0, _e = err;\n    } finally {\n      try {\n        if (!_n && null != _i[\"return\"] && (_r = _i[\"return\"](), Object(_r) !== _r)) return;\n      } finally {\n        if (_d) throw _e;\n      }\n    }\n    return _arr;\n  }\n}","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}","var global = typeof self !== 'undefined' ? self : this;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\nvar irrelevant = (function (exports) {\n\n  var support = {\n    searchParams: 'URLSearchParams' in self,\n    iterable: 'Symbol' in self && 'iterator' in Symbol,\n    blob:\n      'FileReader' in self &&\n      'Blob' in self &&\n      (function() {\n        try {\n          new Blob();\n          return true\n        } catch (e) {\n          return false\n        }\n      })(),\n    formData: 'FormData' in self,\n    arrayBuffer: 'ArrayBuffer' in self\n  };\n\n  function isDataView(obj) {\n    return obj && DataView.prototype.isPrototypeOf(obj)\n  }\n\n  if (support.arrayBuffer) {\n    var viewClasses = [\n      '[object Int8Array]',\n      '[object Uint8Array]',\n      '[object Uint8ClampedArray]',\n      '[object Int16Array]',\n      '[object Uint16Array]',\n      '[object Int32Array]',\n      '[object Uint32Array]',\n      '[object Float32Array]',\n      '[object Float64Array]'\n    ];\n\n    var isArrayBufferView =\n      ArrayBuffer.isView ||\n      function(obj) {\n        return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n      };\n  }\n\n  function normalizeName(name) {\n    if (typeof name !== 'string') {\n      name = String(name);\n    }\n    if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n      throw new TypeError('Invalid character in header field name')\n    }\n    return name.toLowerCase()\n  }\n\n  function normalizeValue(value) {\n    if (typeof value !== 'string') {\n      value = String(value);\n    }\n    return value\n  }\n\n  // Build a destructive iterator for the value list\n  function iteratorFor(items) {\n    var iterator = {\n      next: function() {\n        var value = items.shift();\n        return {done: value === undefined, value: value}\n      }\n    };\n\n    if (support.iterable) {\n      iterator[Symbol.iterator] = function() {\n        return iterator\n      };\n    }\n\n    return iterator\n  }\n\n  function Headers(headers) {\n    this.map = {};\n\n    if (headers instanceof Headers) {\n      headers.forEach(function(value, name) {\n        this.append(name, value);\n      }, this);\n    } else if (Array.isArray(headers)) {\n      headers.forEach(function(header) {\n        this.append(header[0], header[1]);\n      }, this);\n    } else if (headers) {\n      Object.getOwnPropertyNames(headers).forEach(function(name) {\n        this.append(name, headers[name]);\n      }, this);\n    }\n  }\n\n  Headers.prototype.append = function(name, value) {\n    name = normalizeName(name);\n    value = normalizeValue(value);\n    var oldValue = this.map[name];\n    this.map[name] = oldValue ? oldValue + ', ' + value : value;\n  };\n\n  Headers.prototype['delete'] = function(name) {\n    delete this.map[normalizeName(name)];\n  };\n\n  Headers.prototype.get = function(name) {\n    name = normalizeName(name);\n    return this.has(name) ? this.map[name] : null\n  };\n\n  Headers.prototype.has = function(name) {\n    return this.map.hasOwnProperty(normalizeName(name))\n  };\n\n  Headers.prototype.set = function(name, value) {\n    this.map[normalizeName(name)] = normalizeValue(value);\n  };\n\n  Headers.prototype.forEach = function(callback, thisArg) {\n    for (var name in this.map) {\n      if (this.map.hasOwnProperty(name)) {\n        callback.call(thisArg, this.map[name], name, this);\n      }\n    }\n  };\n\n  Headers.prototype.keys = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push(name);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.values = function() {\n    var items = [];\n    this.forEach(function(value) {\n      items.push(value);\n    });\n    return iteratorFor(items)\n  };\n\n  Headers.prototype.entries = function() {\n    var items = [];\n    this.forEach(function(value, name) {\n      items.push([name, value]);\n    });\n    return iteratorFor(items)\n  };\n\n  if (support.iterable) {\n    Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n  }\n\n  function consumed(body) {\n    if (body.bodyUsed) {\n      return Promise.reject(new TypeError('Already read'))\n    }\n    body.bodyUsed = true;\n  }\n\n  function fileReaderReady(reader) {\n    return new Promise(function(resolve, reject) {\n      reader.onload = function() {\n        resolve(reader.result);\n      };\n      reader.onerror = function() {\n        reject(reader.error);\n      };\n    })\n  }\n\n  function readBlobAsArrayBuffer(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsArrayBuffer(blob);\n    return promise\n  }\n\n  function readBlobAsText(blob) {\n    var reader = new FileReader();\n    var promise = fileReaderReady(reader);\n    reader.readAsText(blob);\n    return promise\n  }\n\n  function readArrayBufferAsText(buf) {\n    var view = new Uint8Array(buf);\n    var chars = new Array(view.length);\n\n    for (var i = 0; i < view.length; i++) {\n      chars[i] = String.fromCharCode(view[i]);\n    }\n    return chars.join('')\n  }\n\n  function bufferClone(buf) {\n    if (buf.slice) {\n      return buf.slice(0)\n    } else {\n      var view = new Uint8Array(buf.byteLength);\n      view.set(new Uint8Array(buf));\n      return view.buffer\n    }\n  }\n\n  function Body() {\n    this.bodyUsed = false;\n\n    this._initBody = function(body) {\n      this._bodyInit = body;\n      if (!body) {\n        this._bodyText = '';\n      } else if (typeof body === 'string') {\n        this._bodyText = body;\n      } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n        this._bodyBlob = body;\n      } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n        this._bodyFormData = body;\n      } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n        this._bodyText = body.toString();\n      } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n        this._bodyArrayBuffer = bufferClone(body.buffer);\n        // IE 10-11 can't handle a DataView body.\n        this._bodyInit = new Blob([this._bodyArrayBuffer]);\n      } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n        this._bodyArrayBuffer = bufferClone(body);\n      } else {\n        this._bodyText = body = Object.prototype.toString.call(body);\n      }\n\n      if (!this.headers.get('content-type')) {\n        if (typeof body === 'string') {\n          this.headers.set('content-type', 'text/plain;charset=UTF-8');\n        } else if (this._bodyBlob && this._bodyBlob.type) {\n          this.headers.set('content-type', this._bodyBlob.type);\n        } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n          this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n        }\n      }\n    };\n\n    if (support.blob) {\n      this.blob = function() {\n        var rejected = consumed(this);\n        if (rejected) {\n          return rejected\n        }\n\n        if (this._bodyBlob) {\n          return Promise.resolve(this._bodyBlob)\n        } else if (this._bodyArrayBuffer) {\n          return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n        } else if (this._bodyFormData) {\n          throw new Error('could not read FormData body as blob')\n        } else {\n          return Promise.resolve(new Blob([this._bodyText]))\n        }\n      };\n\n      this.arrayBuffer = function() {\n        if (this._bodyArrayBuffer) {\n          return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n        } else {\n          return this.blob().then(readBlobAsArrayBuffer)\n        }\n      };\n    }\n\n    this.text = function() {\n      var rejected = consumed(this);\n      if (rejected) {\n        return rejected\n      }\n\n      if (this._bodyBlob) {\n        return readBlobAsText(this._bodyBlob)\n      } else if (this._bodyArrayBuffer) {\n        return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n      } else if (this._bodyFormData) {\n        throw new Error('could not read FormData body as text')\n      } else {\n        return Promise.resolve(this._bodyText)\n      }\n    };\n\n    if (support.formData) {\n      this.formData = function() {\n        return this.text().then(decode)\n      };\n    }\n\n    this.json = function() {\n      return this.text().then(JSON.parse)\n    };\n\n    return this\n  }\n\n  // HTTP methods whose capitalization should be normalized\n  var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n  function normalizeMethod(method) {\n    var upcased = method.toUpperCase();\n    return methods.indexOf(upcased) > -1 ? upcased : method\n  }\n\n  function Request(input, options) {\n    options = options || {};\n    var body = options.body;\n\n    if (input instanceof Request) {\n      if (input.bodyUsed) {\n        throw new TypeError('Already read')\n      }\n      this.url = input.url;\n      this.credentials = input.credentials;\n      if (!options.headers) {\n        this.headers = new Headers(input.headers);\n      }\n      this.method = input.method;\n      this.mode = input.mode;\n      this.signal = input.signal;\n      if (!body && input._bodyInit != null) {\n        body = input._bodyInit;\n        input.bodyUsed = true;\n      }\n    } else {\n      this.url = String(input);\n    }\n\n    this.credentials = options.credentials || this.credentials || 'same-origin';\n    if (options.headers || !this.headers) {\n      this.headers = new Headers(options.headers);\n    }\n    this.method = normalizeMethod(options.method || this.method || 'GET');\n    this.mode = options.mode || this.mode || null;\n    this.signal = options.signal || this.signal;\n    this.referrer = null;\n\n    if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n      throw new TypeError('Body not allowed for GET or HEAD requests')\n    }\n    this._initBody(body);\n  }\n\n  Request.prototype.clone = function() {\n    return new Request(this, {body: this._bodyInit})\n  };\n\n  function decode(body) {\n    var form = new FormData();\n    body\n      .trim()\n      .split('&')\n      .forEach(function(bytes) {\n        if (bytes) {\n          var split = bytes.split('=');\n          var name = split.shift().replace(/\\+/g, ' ');\n          var value = split.join('=').replace(/\\+/g, ' ');\n          form.append(decodeURIComponent(name), decodeURIComponent(value));\n        }\n      });\n    return form\n  }\n\n  function parseHeaders(rawHeaders) {\n    var headers = new Headers();\n    // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n    // https://tools.ietf.org/html/rfc7230#section-3.2\n    var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n    preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n      var parts = line.split(':');\n      var key = parts.shift().trim();\n      if (key) {\n        var value = parts.join(':').trim();\n        headers.append(key, value);\n      }\n    });\n    return headers\n  }\n\n  Body.call(Request.prototype);\n\n  function Response(bodyInit, options) {\n    if (!options) {\n      options = {};\n    }\n\n    this.type = 'default';\n    this.status = options.status === undefined ? 200 : options.status;\n    this.ok = this.status >= 200 && this.status < 300;\n    this.statusText = 'statusText' in options ? options.statusText : 'OK';\n    this.headers = new Headers(options.headers);\n    this.url = options.url || '';\n    this._initBody(bodyInit);\n  }\n\n  Body.call(Response.prototype);\n\n  Response.prototype.clone = function() {\n    return new Response(this._bodyInit, {\n      status: this.status,\n      statusText: this.statusText,\n      headers: new Headers(this.headers),\n      url: this.url\n    })\n  };\n\n  Response.error = function() {\n    var response = new Response(null, {status: 0, statusText: ''});\n    response.type = 'error';\n    return response\n  };\n\n  var redirectStatuses = [301, 302, 303, 307, 308];\n\n  Response.redirect = function(url, status) {\n    if (redirectStatuses.indexOf(status) === -1) {\n      throw new RangeError('Invalid status code')\n    }\n\n    return new Response(null, {status: status, headers: {location: url}})\n  };\n\n  exports.DOMException = self.DOMException;\n  try {\n    new exports.DOMException();\n  } catch (err) {\n    exports.DOMException = function(message, name) {\n      this.message = message;\n      this.name = name;\n      var error = Error(message);\n      this.stack = error.stack;\n    };\n    exports.DOMException.prototype = Object.create(Error.prototype);\n    exports.DOMException.prototype.constructor = exports.DOMException;\n  }\n\n  function fetch(input, init) {\n    return new Promise(function(resolve, reject) {\n      var request = new Request(input, init);\n\n      if (request.signal && request.signal.aborted) {\n        return reject(new exports.DOMException('Aborted', 'AbortError'))\n      }\n\n      var xhr = new XMLHttpRequest();\n\n      function abortXhr() {\n        xhr.abort();\n      }\n\n      xhr.onload = function() {\n        var options = {\n          status: xhr.status,\n          statusText: xhr.statusText,\n          headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n        };\n        options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n        var body = 'response' in xhr ? xhr.response : xhr.responseText;\n        resolve(new Response(body, options));\n      };\n\n      xhr.onerror = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.ontimeout = function() {\n        reject(new TypeError('Network request failed'));\n      };\n\n      xhr.onabort = function() {\n        reject(new exports.DOMException('Aborted', 'AbortError'));\n      };\n\n      xhr.open(request.method, request.url, true);\n\n      if (request.credentials === 'include') {\n        xhr.withCredentials = true;\n      } else if (request.credentials === 'omit') {\n        xhr.withCredentials = false;\n      }\n\n      if ('responseType' in xhr && support.blob) {\n        xhr.responseType = 'blob';\n      }\n\n      request.headers.forEach(function(value, name) {\n        xhr.setRequestHeader(name, value);\n      });\n\n      if (request.signal) {\n        request.signal.addEventListener('abort', abortXhr);\n\n        xhr.onreadystatechange = function() {\n          // DONE (success or failure)\n          if (xhr.readyState === 4) {\n            request.signal.removeEventListener('abort', abortXhr);\n          }\n        };\n      }\n\n      xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n    })\n  }\n\n  fetch.polyfill = true;\n\n  if (!self.fetch) {\n    self.fetch = fetch;\n    self.Headers = Headers;\n    self.Request = Request;\n    self.Response = Response;\n  }\n\n  exports.Headers = Headers;\n  exports.Request = Request;\n  exports.Response = Response;\n  exports.fetch = fetch;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n  return exports;\n\n})({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\n","import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inheritsLoose(subClass, superClass) {\n  subClass.prototype = Object.create(superClass.prototype);\n  subClass.prototype.constructor = subClass;\n  setPrototypeOf(subClass, superClass);\n}","function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\nmodule.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      ctor.prototype = Object.create(superCtor.prototype, {\n        constructor: {\n          value: ctor,\n          enumerable: false,\n          writable: true,\n          configurable: true\n        }\n      })\n    }\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      var TempCtor = function () {}\n      TempCtor.prototype = superCtor.prototype\n      ctor.prototype = new TempCtor()\n      ctor.prototype.constructor = ctor\n    }\n  }\n}\n","'use strict';\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\nmodule.exports = ZStream;\n","'use strict';\n\n\nvar TYPED_OK =  (typeof Uint8Array !== 'undefined') &&\n                (typeof Uint16Array !== 'undefined') &&\n                (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    var 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 (var p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n  if (buf.length === size) { return buf; }\n  if (buf.subarray) { return buf.subarray(0, size); }\n  buf.length = size;\n  return buf;\n};\n\n\nvar fnTyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    if (src.subarray && dest.subarray) {\n      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n      return;\n    }\n    // Fallback to ordinary array\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    var i, l, len, pos, chunk, result;\n\n    // calculate data length\n    len = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      len += chunks[i].length;\n    }\n\n    // join chunks\n    result = new Uint8Array(len);\n    pos = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      chunk = chunks[i];\n      result.set(chunk, pos);\n      pos += chunk.length;\n    }\n\n    return result;\n  }\n};\n\nvar fnUntyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    return [].concat.apply([], chunks);\n  }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n  if (on) {\n    exports.Buf8  = Uint8Array;\n    exports.Buf16 = Uint16Array;\n    exports.Buf32 = Int32Array;\n    exports.assign(exports, fnTyped);\n  } else {\n    exports.Buf8  = Array;\n    exports.Buf16 = Array;\n    exports.Buf32 = Array;\n    exports.assign(exports, fnUntyped);\n  }\n};\n\nexports.setTyped(TYPED_OK);\n","'use strict';\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/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED          = 1;\n//var Z_HUFFMAN_ONLY      = 2;\n//var Z_RLE               = 3;\nvar Z_FIXED               = 4;\n//var Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY              = 0;\nvar Z_TEXT                = 1;\n//var Z_ASCII             = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES    = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH    = 3;\nvar MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES       = 30;\n/* number of distance codes */\n\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK   = 256;\n/* end of block literal code */\n\nvar REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nvar 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 */\nvar extra_lbits =   /* extra bits for each length code */\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,5,5,5,5,0];\n\nvar extra_dbits =   /* extra bits for each distance code */\n  [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\nvar extra_blbits =  /* extra bits for each bit length code */\n  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n  [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\nvar 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\nvar static_ltree  = new Array((L_CODES + 2) * 2);\nzero(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\nvar static_dtree  = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code    = new Array(DIST_CODE_LEN);\nzero(_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\nvar _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist     = new Array(D_CODES);\nzero(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\nvar static_l_desc;\nvar static_d_desc;\nvar 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\nfunction d_code(dist) {\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 */\nfunction 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 */\nfunction send_bits(s, value, length) {\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\nfunction send_code(s, c, tree) {\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 */\nfunction bi_reverse(code, len) {\n  var 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 */\nfunction bi_flush(s) {\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 */\nfunction gen_bitlen(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n{\n  var tree            = desc.dyn_tree;\n  var max_code        = desc.max_code;\n  var stree           = desc.stat_desc.static_tree;\n  var has_stree       = desc.stat_desc.has_stree;\n  var extra           = desc.stat_desc.extra_bits;\n  var base            = desc.stat_desc.extra_base;\n  var max_length      = desc.stat_desc.max_length;\n  var h;              /* heap index */\n  var n, m;           /* iterate over the tree elements */\n  var bits;           /* bit length */\n  var xbits;          /* extra bits */\n  var f;              /* frequency */\n  var overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; 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; 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  // Trace((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        // Trace((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 */\nfunction 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  var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  var code = 0;              /* running code value */\n  var bits;                  /* bit index */\n  var 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; bits++) {\n    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\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    var 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 */\nfunction tr_static_init() {\n  var n;        /* iterates over tree elements */\n  var bits;     /* bit counter */\n  var length;   /* length value */\n  var code;     /* code value */\n  var dist;     /* distance index */\n  var bl_count = new Array(MAX_BITS + 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; 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; 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; 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, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES; 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, L_CODES, MAX_BITS);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);\n\n  //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n  var n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES; 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.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction 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 * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf    *buf;    /* the input data */\n//unsigned len;     /* its length */\n//int      header;  /* true if block header must be written */\n{\n  bi_windup(s);        /* align on byte boundary */\n\n  if (header) {\n    put_short(s, len);\n    put_short(s, ~len);\n  }\n//  while (len--) {\n//    put_byte(s, *buf++);\n//  }\n  utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n  s.pending += len;\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 */\nfunction smaller(tree, n, m, depth) {\n  var _n2 = n * 2;\n  var _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 */\nfunction 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  var v = s.heap[k];\n  var 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// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction 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  var dist;           /* distance of matched string */\n  var lc;             /* match length or unmatched char (if dist == 0) */\n  var lx = 0;         /* running index in l_buf */\n  var code;           /* the code to send */\n  var extra;          /* number of extra bits to send */\n\n  if (s.last_lit !== 0) {\n    do {\n      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n      lc = s.pending_buf[s.l_buf + lx];\n      lx++;\n\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, 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 d_buf+l_buf is ok: */\n      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n      //       \"pendingBuf overflow\");\n\n    } while (lx < s.last_lit);\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 */\nfunction build_tree(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n{\n  var tree     = desc.dyn_tree;\n  var stree    = desc.stat_desc.static_tree;\n  var has_stree = desc.stat_desc.has_stree;\n  var elems    = desc.stat_desc.elems;\n  var n, m;          /* iterate over heap elements */\n  var max_code = -1; /* largest code with non zero frequency */\n  var 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;\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 */\nfunction 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  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var 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 */\nfunction 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  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var 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 */\nfunction build_bl_tree(s) {\n  var 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; 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 */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n  var 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 *       \"black list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"white 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 */\nfunction detect_data_type(s) {\n  /* black_mask is the bit mask of black-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  var black_mask = 0xf3ffc07f;\n  var n;\n\n  /* Check for non-textual (\"black-listed\") bytes. */\n  for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"white-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; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"black-listed\" or \"white-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(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 */\nfunction _tr_stored_block(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  copy_block(s, buf, stored_len, true); /* with header */\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 */\nfunction _tr_align(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 output the encoded block to the zip file.\n */\nfunction _tr_flush_block(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  var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  var 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) {\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->last_lit));\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(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED || 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 */\nfunction _tr_tally(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  //var out_length, in_length, dcode;\n\n  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;\n  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n  s.last_lit++;\n\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) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n//  /* Try to guess if it is profitable to stop the current block here */\n//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n//    /* Compute an upper bound for the compressed length */\n//    out_length = s.last_lit*8;\n//    in_length = s.strstart - s.block_start;\n//\n//    for (dcode = 0; dcode < D_CODES; dcode++) {\n//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n//    }\n//    out_length >>>= 3;\n//    //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n//    //       s->last_lit, in_length, out_length,\n//    //       100L - out_length*100L/in_length));\n//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n//      return true;\n//    }\n//  }\n//#endif\n\n  return (s.last_lit === s.lit_bufsize - 1);\n  /* We avoid equality with lit_bufsize because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n}\n\nexports._tr_init  = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block  = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\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\nfunction adler32(adler, buf, len, pos) {\n  var 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\nmodule.exports = adler32;\n","'use strict';\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\nfunction makeTable() {\n  var 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.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n  var t = crcTable,\n      end = pos + len;\n\n  crc ^= -1;\n\n  for (var i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n","'use strict';\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\nmodule.exports = {\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","'use strict';\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 utils   = require('../utils/common');\nvar trees   = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32   = require('./crc32');\nvar msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH      = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\nvar Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\n//var Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\n//var Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\n//var Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION      = 0;\n//var Z_BEST_SPEED          = 1;\n//var Z_BEST_COMPRESSION    = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED            = 1;\nvar Z_HUFFMAN_ONLY        = 2;\nvar Z_RLE                 = 3;\nvar Z_FIXED               = 4;\nvar Z_DEFAULT_STRATEGY    = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY              = 0;\n//var Z_TEXT                = 1;\n//var Z_ASCII               = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES       = 30;\n/* number of distance codes */\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE     = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n  strm.msg = msg[errorCode];\n  return errorCode;\n}\n\nfunction rank(f) {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n  var s = strm.state;\n\n  //_tr_flush_bits(s);\n  var len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  utils.arraySet(strm.output, s.pending_buf, 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\nfunction flush_block_only(s, last) {\n  trees._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\nfunction 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 */\nfunction putShortMSB(s, b) {\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 */\nfunction read_buf(strm, buf, start, size) {\n  var 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  utils.arraySet(buf, strm.input, strm.next_in, len, start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32(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 */\nfunction longest_match(s, cur_match) {\n  var chain_length = s.max_chain_length;      /* max hash chain length */\n  var scan = s.strstart; /* current string */\n  var match;                       /* matched string */\n  var len;                           /* length of current match */\n  var best_len = s.prev_length;              /* best match length so far */\n  var nice_match = s.nice_match;             /* stop if match long enough */\n  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  var _win = s.window; // shortcut\n\n  var wmask = s.w_mask;\n  var 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  var strend = s.strstart + MAX_MATCH;\n  var scan_end1  = _win[scan + best_len - 1];\n  var 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 */\nfunction fill_window(s) {\n  var _w_size = s.w_size;\n  var p, n, m, 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      utils.arraySet(s.window, s.window, _w_size, _w_size, 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\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 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\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 = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\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 = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\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//    var curr = s.strstart + s.lookahead;\n//    var 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 * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  var max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    var max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\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    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\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\n  s.insert = 0;\n\n  if (flush === Z_FINISH) {\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\n  if (s.strstart > s.block_start) {\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_NEED_MORE;\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 */\nfunction deflate_fast(s, flush) {\n  var hash_head;        /* head of the hash chain */\n  var 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) {\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 = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\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 = trees._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 = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\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 = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\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 = trees._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) {\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.last_lit) {\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 */\nfunction deflate_slow(s, flush) {\n  var hash_head;          /* head of hash chain */\n  var bflush;              /* set if current block must be flushed */\n\n  var 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) {\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 = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\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 = trees._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 = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\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 = trees._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 = trees._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) {\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.last_lit) {\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 */\nfunction deflate_rle(s, flush) {\n  var bflush;            /* set if current block must be flushed */\n  var prev;              /* byte at distance one to match */\n  var scan, strend;      /* scan goes up to strend for length of run */\n\n  var _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) {\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 = trees._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 = trees._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) {\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.last_lit) {\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 */\nfunction deflate_huff(s, flush) {\n  var 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) {\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 = trees._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) {\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.last_lit) {\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  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\nvar configuration_table;\n\nconfiguration_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 */\nfunction lm_init(s) {\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; /* 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 utils.Buf16(HEAP_SIZE * 2);\n  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new utils.Buf16((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 utils.Buf16(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 utils.Buf16(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 utils.Buf16(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.l_buf = 0;          /* buffer index for literals or 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.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\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\nfunction deflateResetKeep(strm) {\n  var s;\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  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 = (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 = Z_NO_FLUSH;\n  trees._tr_init(s);\n  return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n  var ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n  strm.state.gzhead = head;\n  return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  var wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION) {\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 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  var s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\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 utils.Buf8(s.w_size * 2);\n  s.head = new utils.Buf16(s.hash_size);\n  s.prev = new utils.Buf16(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  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n  var old_flush, s;\n  var beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  s.strm = strm; /* just in case */\n  old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // 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      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(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n      var 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      s.status = BUSY_STATE;\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    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\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\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\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\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\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      }\n      if (s.pending + 2 <= s.pending_buf_size) {\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        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\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;\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) {\n    return err(strm, Z_BUF_ERROR);\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);\n  }\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 && s.status !== FINISH_STATE)) {\n    var bstate = (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;\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        trees._tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        trees._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) {\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;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH) { return Z_OK; }\n  if (s.wrap <= 0) { return Z_STREAM_END; }\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 : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n  var status;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var s;\n  var str, n;\n  var wrap;\n  var avail;\n  var next;\n  var input;\n  var tmpDict;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n  wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\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(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    tmpDict = new utils.Buf8(s.w_size);\n    utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  avail = strm.avail_in;\n  next = strm.next_in;\n  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    str = s.strstart;\n    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 = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\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;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\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\nvar BAD = 30;       /* got a data error -- remain here until reset */\nvar TYPE = 12;      /* 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 */\nmodule.exports = function inflate_fast(strm, start) {\n  var state;\n  var _in;                    /* local strm.input */\n  var last;                   /* have enough input while in < last */\n  var _out;                   /* local strm.output */\n  var beg;                    /* inflate()'s initial strm.output */\n  var end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  var dmax;                   /* maximum distance from zlib header */\n//#endif\n  var wsize;                  /* window size or zero if not using window */\n  var whave;                  /* valid bytes in the window */\n  var wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  var s_window;               /* allocated sliding window, if wsize != 0 */\n  var hold;                   /* local strm.hold */\n  var bits;                   /* local strm.bits */\n  var lcode;                  /* local strm.lencode */\n  var dcode;                  /* local strm.distcode */\n  var lmask;                  /* mask for first level of length codes */\n  var dmask;                  /* mask for first level of distance codes */\n  var here;                   /* retrieved table entry */\n  var op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  var len;                    /* match length, unused bytes */\n  var dist;                   /* match distance */\n  var from;                   /* where to copy match from */\n  var from_source;\n\n\n  var input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  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;\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;\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;\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;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD;\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","'use strict';\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 utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* 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\nvar lext = [ /* 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\nvar dbase = [ /* 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\nvar dext = [ /* 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\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n  var bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  var len = 0;               /* a code's length in bits */\n  var sym = 0;               /* index of code symbols */\n  var min = 0, max = 0;          /* minimum and maximum code lengths */\n  var root = 0;              /* number of index bits for root table */\n  var curr = 0;              /* number of index bits for current table */\n  var drop = 0;              /* code bits to drop for sub-table */\n  var left = 0;                   /* number of prefix codes available */\n  var used = 0;              /* code entries in table used */\n  var huff = 0;              /* Huffman code */\n  var incr;              /* for incrementing code, index */\n  var fill;              /* index for replicating entries */\n  var low;               /* low bits for current root entry */\n  var mask;              /* mask for low root bits */\n  var next;             /* next available space in table */\n  var base = null;     /* base value table to use */\n  var base_index = 0;\n//  var shoextra;    /* extra bits table to use */\n  var end;                    /* use base and extra for symbol > end */\n  var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  var extra = null;\n  var extra_index = 0;\n\n  var 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 || 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) {\n    base = extra = work;    /* dummy value--not used */\n    end = 19;\n\n  } else if (type === LENS) {\n    base = lbase;\n    base_index -= 257;\n    extra = lext;\n    extra_index -= 257;\n    end = 256;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    end = -1;\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 && used > ENOUGH_LENS) ||\n    (type === DISTS && used > ENOUGH_DISTS)) {\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] < end) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] > end) {\n      here_op = extra[extra_index + work[sym]];\n      here_val = base[base_index + work[sym]];\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 && used > ENOUGH_LENS) ||\n        (type === DISTS && used > ENOUGH_DISTS)) {\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","'use strict';\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 utils         = require('../utils/common');\nvar adler32       = require('./adler32');\nvar crc32         = require('./crc32');\nvar inflate_fast  = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH      = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\n//var Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\nvar Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\nvar Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\nvar Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar    HEAD = 1;       /* i: waiting for magic header */\nvar    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\nvar    TIME = 3;       /* i: waiting for modification time (gzip) */\nvar    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\nvar    EXLEN = 5;      /* i: waiting for extra length (gzip) */\nvar    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\nvar    NAME = 7;       /* i: waiting for end of file name (gzip) */\nvar    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\nvar    HCRC = 9;       /* i: waiting for header crc (gzip) */\nvar    DICTID = 10;    /* i: waiting for dictionary check value */\nvar    DICT = 11;      /* waiting for inflateSetDictionary() call */\nvar        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\nvar        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\nvar        STORED = 14;    /* i: waiting for stored size (length and complement) */\nvar        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\nvar        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\nvar        TABLE = 17;     /* i: waiting for dynamic block table lengths */\nvar        LENLENS = 18;   /* i: waiting for code length code lengths */\nvar        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\nvar            LEN_ = 20;      /* i: same as LEN below, but only first time in */\nvar            LEN = 21;       /* i: waiting for length/lit/eob code */\nvar            LENEXT = 22;    /* i: waiting for length extra bits */\nvar            DIST = 23;      /* i: waiting for distance code */\nvar            DISTEXT = 24;   /* i: waiting for distance extra bits */\nvar            MATCH = 25;     /* o: waiting for output space to copy string */\nvar            LIT = 26;       /* o: waiting for output space to write literal */\nvar    CHECK = 27;     /* i: waiting for 32-bit check value */\nvar    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\nvar    DONE = 29;      /* finished check, done -- remain here until reset */\nvar    BAD = 30;       /* got a data error -- remain here until reset */\nvar    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\nvar    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\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  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\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 utils.Buf16(320); /* temporary storage for code lengths */\n  this.work = new utils.Buf16(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 utils.Buf32(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\nfunction inflateResetKeep(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  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.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 utils.Buf32(ENOUGH_LENS);\n  state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK;\n}\n\nfunction inflateReset(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n  var wrap;\n  var state;\n\n  /* get the state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  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) + 1;\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;\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\nfunction inflateInit2(strm, windowBits) {\n  var ret;\n  var state;\n\n  if (!strm) { return Z_STREAM_ERROR; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  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.window = null/*Z_NULL*/;\n  ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n}\n\nfunction inflateInit(strm) {\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 */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    var sym;\n\n    lenfix = new utils.Buf32(512);\n    distfix = new utils.Buf32(32);\n\n    /* literal/length table */\n    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    inflate_table(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    inflate_table(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 */\nfunction updatewindow(strm, src, end, copy) {\n  var dist;\n  var 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 utils.Buf8(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    utils.arraySet(state.window, src, end - state.wsize, state.wsize, 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    utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      utils.arraySet(state.window, src, end - copy, copy, 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\nfunction inflate(strm, flush) {\n  var state;\n  var input, output;          // input/output buffers\n  var next;                   /* next input INDEX */\n  var put;                    /* next output INDEX */\n  var have, left;             /* available input and output */\n  var hold;                   /* bit buffer */\n  var bits;                   /* bits in bit buffer */\n  var _in, _out;              /* save starting available input and output */\n  var copy;                   /* number of stored or match bytes to copy */\n  var from;                   /* where to copy match bytes from */\n  var from_source;\n  var here = 0;               /* current decoding table entry */\n  var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //var last;                   /* parent table entry */\n  var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  var len;                    /* length to copy for repeats, bits to drop */\n  var ret;                    /* return code */\n  var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */\n  var opts;\n\n  var n; // temporary var for NEED_BITS\n\n  var order = /* permutation of code lengths */\n    [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n  if (!strm || !strm.state || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR;\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;\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          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(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        state.flags = 0;           /* expect zlib header */\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        else if (len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n        state.dmax = 1 << len;\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) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(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) {\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(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) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(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) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32(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 Array(state.head.extra_len);\n              }\n              utils.arraySet(\n                state.head.extra,\n                input,\n                next,\n                // extra field is limited to 65536 bytes\n                // - no need for additional size check\n                copy,\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) {\n              state.check = crc32(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) {\n            state.check = crc32(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) {\n            state.check = crc32(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 (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;\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          utils.arraySet(output, input, 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 = inflate_table(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 = inflate_table(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 = inflate_table(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          inflate_fast(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 (_out) {\n            strm.adler = state.check =\n                /*UPDATE(state.check, put - _out, _out);*/\n                (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(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.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 (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;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR;\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))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n      state.mode = MEM;\n      return Z_MEM_ERROR;\n    }\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 && _out) {\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(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) && ret === Z_OK) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n}\n\nfunction inflateEnd(strm) {\n\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  var state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n  var state;\n\n  /* check state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var state;\n  var dictid;\n  var ret;\n\n  /* check state */\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR;\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(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR;\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;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\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\nmodule.exports = {\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","'use strict';\n/* eslint camelcase: \"off\" */\n\nvar assert = require('assert');\n\nvar Zstream = require('pako/lib/zlib/zstream');\nvar zlib_deflate = require('pako/lib/zlib/deflate.js');\nvar zlib_inflate = require('pako/lib/zlib/inflate.js');\nvar constants = require('pako/lib/zlib/constants');\n\nfor (var key in constants) {\n  exports[key] = constants[key];\n}\n\n// zlib modes\nexports.NONE = 0;\nexports.DEFLATE = 1;\nexports.INFLATE = 2;\nexports.GZIP = 3;\nexports.GUNZIP = 4;\nexports.DEFLATERAW = 5;\nexports.INFLATERAW = 6;\nexports.UNZIP = 7;\n\nvar GZIP_HEADER_ID1 = 0x1f;\nvar GZIP_HEADER_ID2 = 0x8b;\n\n/**\n * Emulate Node's zlib C++ layer for use by the JS layer in index.js\n */\nfunction Zlib(mode) {\n  if (typeof mode !== 'number' || mode < exports.DEFLATE || mode > exports.UNZIP) {\n    throw new TypeError('Bad argument');\n  }\n\n  this.dictionary = null;\n  this.err = 0;\n  this.flush = 0;\n  this.init_done = false;\n  this.level = 0;\n  this.memLevel = 0;\n  this.mode = mode;\n  this.strategy = 0;\n  this.windowBits = 0;\n  this.write_in_progress = false;\n  this.pending_close = false;\n  this.gzip_id_bytes_read = 0;\n}\n\nZlib.prototype.close = function () {\n  if (this.write_in_progress) {\n    this.pending_close = true;\n    return;\n  }\n\n  this.pending_close = false;\n\n  assert(this.init_done, 'close before init');\n  assert(this.mode <= exports.UNZIP);\n\n  if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) {\n    zlib_deflate.deflateEnd(this.strm);\n  } else if (this.mode === exports.INFLATE || this.mode === exports.GUNZIP || this.mode === exports.INFLATERAW || this.mode === exports.UNZIP) {\n    zlib_inflate.inflateEnd(this.strm);\n  }\n\n  this.mode = exports.NONE;\n\n  this.dictionary = null;\n};\n\nZlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) {\n  return this._write(true, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) {\n  return this._write(false, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) {\n  assert.equal(arguments.length, 8);\n\n  assert(this.init_done, 'write before init');\n  assert(this.mode !== exports.NONE, 'already finalized');\n  assert.equal(false, this.write_in_progress, 'write already in progress');\n  assert.equal(false, this.pending_close, 'close is pending');\n\n  this.write_in_progress = true;\n\n  assert.equal(false, flush === undefined, 'must provide flush value');\n\n  this.write_in_progress = true;\n\n  if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && flush !== exports.Z_FULL_FLUSH && flush !== exports.Z_FINISH && flush !== exports.Z_BLOCK) {\n    throw new Error('Invalid flush value');\n  }\n\n  if (input == null) {\n    input = Buffer.alloc(0);\n    in_len = 0;\n    in_off = 0;\n  }\n\n  this.strm.avail_in = in_len;\n  this.strm.input = input;\n  this.strm.next_in = in_off;\n  this.strm.avail_out = out_len;\n  this.strm.output = out;\n  this.strm.next_out = out_off;\n  this.flush = flush;\n\n  if (!async) {\n    // sync version\n    this._process();\n\n    if (this._checkError()) {\n      return this._afterSync();\n    }\n    return;\n  }\n\n  // async version\n  var self = this;\n  process.nextTick(function () {\n    self._process();\n    self._after();\n  });\n\n  return this;\n};\n\nZlib.prototype._afterSync = function () {\n  var avail_out = this.strm.avail_out;\n  var avail_in = this.strm.avail_in;\n\n  this.write_in_progress = false;\n\n  return [avail_in, avail_out];\n};\n\nZlib.prototype._process = function () {\n  var next_expected_header_byte = null;\n\n  // If the avail_out is left at 0, then it means that it ran out\n  // of room.  If there was avail_out left over, then it means\n  // that all of the input was consumed.\n  switch (this.mode) {\n    case exports.DEFLATE:\n    case exports.GZIP:\n    case exports.DEFLATERAW:\n      this.err = zlib_deflate.deflate(this.strm, this.flush);\n      break;\n    case exports.UNZIP:\n      if (this.strm.avail_in > 0) {\n        next_expected_header_byte = this.strm.next_in;\n      }\n\n      switch (this.gzip_id_bytes_read) {\n        case 0:\n          if (next_expected_header_byte === null) {\n            break;\n          }\n\n          if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID1) {\n            this.gzip_id_bytes_read = 1;\n            next_expected_header_byte++;\n\n            if (this.strm.avail_in === 1) {\n              // The only available byte was already read.\n              break;\n            }\n          } else {\n            this.mode = exports.INFLATE;\n            break;\n          }\n\n        // fallthrough\n        case 1:\n          if (next_expected_header_byte === null) {\n            break;\n          }\n\n          if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID2) {\n            this.gzip_id_bytes_read = 2;\n            this.mode = exports.GUNZIP;\n          } else {\n            // There is no actual difference between INFLATE and INFLATERAW\n            // (after initialization).\n            this.mode = exports.INFLATE;\n          }\n\n          break;\n        default:\n          throw new Error('invalid number of gzip magic number bytes read');\n      }\n\n    // fallthrough\n    case exports.INFLATE:\n    case exports.GUNZIP:\n    case exports.INFLATERAW:\n      this.err = zlib_inflate.inflate(this.strm, this.flush\n\n      // If data was encoded with dictionary\n      );if (this.err === exports.Z_NEED_DICT && this.dictionary) {\n        // Load it\n        this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary);\n        if (this.err === exports.Z_OK) {\n          // And try to decode again\n          this.err = zlib_inflate.inflate(this.strm, this.flush);\n        } else if (this.err === exports.Z_DATA_ERROR) {\n          // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR.\n          // Make it possible for After() to tell a bad dictionary from bad\n          // input.\n          this.err = exports.Z_NEED_DICT;\n        }\n      }\n      while (this.strm.avail_in > 0 && this.mode === exports.GUNZIP && this.err === exports.Z_STREAM_END && this.strm.next_in[0] !== 0x00) {\n        // Bytes remain in input buffer. Perhaps this is another compressed\n        // member in the same archive, or just trailing garbage.\n        // Trailing zero bytes are okay, though, since they are frequently\n        // used for padding.\n\n        this.reset();\n        this.err = zlib_inflate.inflate(this.strm, this.flush);\n      }\n      break;\n    default:\n      throw new Error('Unknown mode ' + this.mode);\n  }\n};\n\nZlib.prototype._checkError = function () {\n  // Acceptable error states depend on the type of zlib stream.\n  switch (this.err) {\n    case exports.Z_OK:\n    case exports.Z_BUF_ERROR:\n      if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) {\n        this._error('unexpected end of file');\n        return false;\n      }\n      break;\n    case exports.Z_STREAM_END:\n      // normal statuses, not fatal\n      break;\n    case exports.Z_NEED_DICT:\n      if (this.dictionary == null) {\n        this._error('Missing dictionary');\n      } else {\n        this._error('Bad dictionary');\n      }\n      return false;\n    default:\n      // something else.\n      this._error('Zlib error');\n      return false;\n  }\n\n  return true;\n};\n\nZlib.prototype._after = function () {\n  if (!this._checkError()) {\n    return;\n  }\n\n  var avail_out = this.strm.avail_out;\n  var avail_in = this.strm.avail_in;\n\n  this.write_in_progress = false;\n\n  // call the write() cb\n  this.callback(avail_in, avail_out);\n\n  if (this.pending_close) {\n    this.close();\n  }\n};\n\nZlib.prototype._error = function (message) {\n  if (this.strm.msg) {\n    message = this.strm.msg;\n  }\n  this.onerror(message, this.err\n\n  // no hope of rescue.\n  );this.write_in_progress = false;\n  if (this.pending_close) {\n    this.close();\n  }\n};\n\nZlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) {\n  assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])');\n\n  assert(windowBits >= 8 && windowBits <= 15, 'invalid windowBits');\n  assert(level >= -1 && level <= 9, 'invalid compression level');\n\n  assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel');\n\n  assert(strategy === exports.Z_FILTERED || strategy === exports.Z_HUFFMAN_ONLY || strategy === exports.Z_RLE || strategy === exports.Z_FIXED || strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy');\n\n  this._init(level, windowBits, memLevel, strategy, dictionary);\n  this._setDictionary();\n};\n\nZlib.prototype.params = function () {\n  throw new Error('deflateParams Not supported');\n};\n\nZlib.prototype.reset = function () {\n  this._reset();\n  this._setDictionary();\n};\n\nZlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) {\n  this.level = level;\n  this.windowBits = windowBits;\n  this.memLevel = memLevel;\n  this.strategy = strategy;\n\n  this.flush = exports.Z_NO_FLUSH;\n\n  this.err = exports.Z_OK;\n\n  if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) {\n    this.windowBits += 16;\n  }\n\n  if (this.mode === exports.UNZIP) {\n    this.windowBits += 32;\n  }\n\n  if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) {\n    this.windowBits = -1 * this.windowBits;\n  }\n\n  this.strm = new Zstream();\n\n  switch (this.mode) {\n    case exports.DEFLATE:\n    case exports.GZIP:\n    case exports.DEFLATERAW:\n      this.err = zlib_deflate.deflateInit2(this.strm, this.level, exports.Z_DEFLATED, this.windowBits, this.memLevel, this.strategy);\n      break;\n    case exports.INFLATE:\n    case exports.GUNZIP:\n    case exports.INFLATERAW:\n    case exports.UNZIP:\n      this.err = zlib_inflate.inflateInit2(this.strm, this.windowBits);\n      break;\n    default:\n      throw new Error('Unknown mode ' + this.mode);\n  }\n\n  if (this.err !== exports.Z_OK) {\n    this._error('Init error');\n  }\n\n  this.dictionary = dictionary;\n\n  this.write_in_progress = false;\n  this.init_done = true;\n};\n\nZlib.prototype._setDictionary = function () {\n  if (this.dictionary == null) {\n    return;\n  }\n\n  this.err = exports.Z_OK;\n\n  switch (this.mode) {\n    case exports.DEFLATE:\n    case exports.DEFLATERAW:\n      this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary);\n      break;\n    default:\n      break;\n  }\n\n  if (this.err !== exports.Z_OK) {\n    this._error('Failed to set dictionary');\n  }\n};\n\nZlib.prototype._reset = function () {\n  this.err = exports.Z_OK;\n\n  switch (this.mode) {\n    case exports.DEFLATE:\n    case exports.DEFLATERAW:\n    case exports.GZIP:\n      this.err = zlib_deflate.deflateReset(this.strm);\n      break;\n    case exports.INFLATE:\n    case exports.INFLATERAW:\n    case exports.GUNZIP:\n      this.err = zlib_inflate.inflateReset(this.strm);\n      break;\n    default:\n      break;\n  }\n\n  if (this.err !== exports.Z_OK) {\n    this._error('Failed to reset stream');\n  }\n};\n\nexports.Zlib = Zlib;","'use strict';\n\nvar Buffer = require('buffer').Buffer;\nvar Transform = require('stream').Transform;\nvar binding = require('./binding');\nvar util = require('util');\nvar assert = require('assert').ok;\nvar kMaxLength = require('buffer').kMaxLength;\nvar kRangeErrorMessage = 'Cannot create final Buffer. It would be larger ' + 'than 0x' + kMaxLength.toString(16) + ' bytes';\n\n// zlib doesn't provide these, so kludge them in following the same\n// const naming scheme zlib uses.\nbinding.Z_MIN_WINDOWBITS = 8;\nbinding.Z_MAX_WINDOWBITS = 15;\nbinding.Z_DEFAULT_WINDOWBITS = 15;\n\n// fewer than 64 bytes per chunk is stupid.\n// technically it could work with as few as 8, but even 64 bytes\n// is absurdly low.  Usually a MB or more is best.\nbinding.Z_MIN_CHUNK = 64;\nbinding.Z_MAX_CHUNK = Infinity;\nbinding.Z_DEFAULT_CHUNK = 16 * 1024;\n\nbinding.Z_MIN_MEMLEVEL = 1;\nbinding.Z_MAX_MEMLEVEL = 9;\nbinding.Z_DEFAULT_MEMLEVEL = 8;\n\nbinding.Z_MIN_LEVEL = -1;\nbinding.Z_MAX_LEVEL = 9;\nbinding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION;\n\n// expose all the zlib constants\nvar bkeys = Object.keys(binding);\nfor (var bk = 0; bk < bkeys.length; bk++) {\n  var bkey = bkeys[bk];\n  if (bkey.match(/^Z/)) {\n    Object.defineProperty(exports, bkey, {\n      enumerable: true, value: binding[bkey], writable: false\n    });\n  }\n}\n\n// translation table for return codes.\nvar codes = {\n  Z_OK: binding.Z_OK,\n  Z_STREAM_END: binding.Z_STREAM_END,\n  Z_NEED_DICT: binding.Z_NEED_DICT,\n  Z_ERRNO: binding.Z_ERRNO,\n  Z_STREAM_ERROR: binding.Z_STREAM_ERROR,\n  Z_DATA_ERROR: binding.Z_DATA_ERROR,\n  Z_MEM_ERROR: binding.Z_MEM_ERROR,\n  Z_BUF_ERROR: binding.Z_BUF_ERROR,\n  Z_VERSION_ERROR: binding.Z_VERSION_ERROR\n};\n\nvar ckeys = Object.keys(codes);\nfor (var ck = 0; ck < ckeys.length; ck++) {\n  var ckey = ckeys[ck];\n  codes[codes[ckey]] = ckey;\n}\n\nObject.defineProperty(exports, 'codes', {\n  enumerable: true, value: Object.freeze(codes), writable: false\n});\n\nexports.Deflate = Deflate;\nexports.Inflate = Inflate;\nexports.Gzip = Gzip;\nexports.Gunzip = Gunzip;\nexports.DeflateRaw = DeflateRaw;\nexports.InflateRaw = InflateRaw;\nexports.Unzip = Unzip;\n\nexports.createDeflate = function (o) {\n  return new Deflate(o);\n};\n\nexports.createInflate = function (o) {\n  return new Inflate(o);\n};\n\nexports.createDeflateRaw = function (o) {\n  return new DeflateRaw(o);\n};\n\nexports.createInflateRaw = function (o) {\n  return new InflateRaw(o);\n};\n\nexports.createGzip = function (o) {\n  return new Gzip(o);\n};\n\nexports.createGunzip = function (o) {\n  return new Gunzip(o);\n};\n\nexports.createUnzip = function (o) {\n  return new Unzip(o);\n};\n\n// Convenience methods.\n// compress/decompress a string or buffer in one step.\nexports.deflate = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new Deflate(opts), buffer, callback);\n};\n\nexports.deflateSync = function (buffer, opts) {\n  return zlibBufferSync(new Deflate(opts), buffer);\n};\n\nexports.gzip = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new Gzip(opts), buffer, callback);\n};\n\nexports.gzipSync = function (buffer, opts) {\n  return zlibBufferSync(new Gzip(opts), buffer);\n};\n\nexports.deflateRaw = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new DeflateRaw(opts), buffer, callback);\n};\n\nexports.deflateRawSync = function (buffer, opts) {\n  return zlibBufferSync(new DeflateRaw(opts), buffer);\n};\n\nexports.unzip = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new Unzip(opts), buffer, callback);\n};\n\nexports.unzipSync = function (buffer, opts) {\n  return zlibBufferSync(new Unzip(opts), buffer);\n};\n\nexports.inflate = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new Inflate(opts), buffer, callback);\n};\n\nexports.inflateSync = function (buffer, opts) {\n  return zlibBufferSync(new Inflate(opts), buffer);\n};\n\nexports.gunzip = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new Gunzip(opts), buffer, callback);\n};\n\nexports.gunzipSync = function (buffer, opts) {\n  return zlibBufferSync(new Gunzip(opts), buffer);\n};\n\nexports.inflateRaw = function (buffer, opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts;\n    opts = {};\n  }\n  return zlibBuffer(new InflateRaw(opts), buffer, callback);\n};\n\nexports.inflateRawSync = function (buffer, opts) {\n  return zlibBufferSync(new InflateRaw(opts), buffer);\n};\n\nfunction zlibBuffer(engine, buffer, callback) {\n  var buffers = [];\n  var nread = 0;\n\n  engine.on('error', onError);\n  engine.on('end', onEnd);\n\n  engine.end(buffer);\n  flow();\n\n  function flow() {\n    var chunk;\n    while (null !== (chunk = engine.read())) {\n      buffers.push(chunk);\n      nread += chunk.length;\n    }\n    engine.once('readable', flow);\n  }\n\n  function onError(err) {\n    engine.removeListener('end', onEnd);\n    engine.removeListener('readable', flow);\n    callback(err);\n  }\n\n  function onEnd() {\n    var buf;\n    var err = null;\n\n    if (nread >= kMaxLength) {\n      err = new RangeError(kRangeErrorMessage);\n    } else {\n      buf = Buffer.concat(buffers, nread);\n    }\n\n    buffers = [];\n    engine.close();\n    callback(err, buf);\n  }\n}\n\nfunction zlibBufferSync(engine, buffer) {\n  if (typeof buffer === 'string') buffer = Buffer.from(buffer);\n\n  if (!Buffer.isBuffer(buffer)) throw new TypeError('Not a string or buffer');\n\n  var flushFlag = engine._finishFlushFlag;\n\n  return engine._processChunk(buffer, flushFlag);\n}\n\n// generic zlib\n// minimal 2-byte header\nfunction Deflate(opts) {\n  if (!(this instanceof Deflate)) return new Deflate(opts);\n  Zlib.call(this, opts, binding.DEFLATE);\n}\n\nfunction Inflate(opts) {\n  if (!(this instanceof Inflate)) return new Inflate(opts);\n  Zlib.call(this, opts, binding.INFLATE);\n}\n\n// gzip - bigger header, same deflate compression\nfunction Gzip(opts) {\n  if (!(this instanceof Gzip)) return new Gzip(opts);\n  Zlib.call(this, opts, binding.GZIP);\n}\n\nfunction Gunzip(opts) {\n  if (!(this instanceof Gunzip)) return new Gunzip(opts);\n  Zlib.call(this, opts, binding.GUNZIP);\n}\n\n// raw - no header\nfunction DeflateRaw(opts) {\n  if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts);\n  Zlib.call(this, opts, binding.DEFLATERAW);\n}\n\nfunction InflateRaw(opts) {\n  if (!(this instanceof InflateRaw)) return new InflateRaw(opts);\n  Zlib.call(this, opts, binding.INFLATERAW);\n}\n\n// auto-detect header.\nfunction Unzip(opts) {\n  if (!(this instanceof Unzip)) return new Unzip(opts);\n  Zlib.call(this, opts, binding.UNZIP);\n}\n\nfunction isValidFlushFlag(flag) {\n  return flag === binding.Z_NO_FLUSH || flag === binding.Z_PARTIAL_FLUSH || flag === binding.Z_SYNC_FLUSH || flag === binding.Z_FULL_FLUSH || flag === binding.Z_FINISH || flag === binding.Z_BLOCK;\n}\n\n// the Zlib class they all inherit from\n// This thing manages the queue of requests, and returns\n// true or false if there is anything in the queue when\n// you call the .write() method.\n\nfunction Zlib(opts, mode) {\n  var _this = this;\n\n  this._opts = opts = opts || {};\n  this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK;\n\n  Transform.call(this, opts);\n\n  if (opts.flush && !isValidFlushFlag(opts.flush)) {\n    throw new Error('Invalid flush flag: ' + opts.flush);\n  }\n  if (opts.finishFlush && !isValidFlushFlag(opts.finishFlush)) {\n    throw new Error('Invalid flush flag: ' + opts.finishFlush);\n  }\n\n  this._flushFlag = opts.flush || binding.Z_NO_FLUSH;\n  this._finishFlushFlag = typeof opts.finishFlush !== 'undefined' ? opts.finishFlush : binding.Z_FINISH;\n\n  if (opts.chunkSize) {\n    if (opts.chunkSize < exports.Z_MIN_CHUNK || opts.chunkSize > exports.Z_MAX_CHUNK) {\n      throw new Error('Invalid chunk size: ' + opts.chunkSize);\n    }\n  }\n\n  if (opts.windowBits) {\n    if (opts.windowBits < exports.Z_MIN_WINDOWBITS || opts.windowBits > exports.Z_MAX_WINDOWBITS) {\n      throw new Error('Invalid windowBits: ' + opts.windowBits);\n    }\n  }\n\n  if (opts.level) {\n    if (opts.level < exports.Z_MIN_LEVEL || opts.level > exports.Z_MAX_LEVEL) {\n      throw new Error('Invalid compression level: ' + opts.level);\n    }\n  }\n\n  if (opts.memLevel) {\n    if (opts.memLevel < exports.Z_MIN_MEMLEVEL || opts.memLevel > exports.Z_MAX_MEMLEVEL) {\n      throw new Error('Invalid memLevel: ' + opts.memLevel);\n    }\n  }\n\n  if (opts.strategy) {\n    if (opts.strategy != exports.Z_FILTERED && opts.strategy != exports.Z_HUFFMAN_ONLY && opts.strategy != exports.Z_RLE && opts.strategy != exports.Z_FIXED && opts.strategy != exports.Z_DEFAULT_STRATEGY) {\n      throw new Error('Invalid strategy: ' + opts.strategy);\n    }\n  }\n\n  if (opts.dictionary) {\n    if (!Buffer.isBuffer(opts.dictionary)) {\n      throw new Error('Invalid dictionary: it should be a Buffer instance');\n    }\n  }\n\n  this._handle = new binding.Zlib(mode);\n\n  var self = this;\n  this._hadError = false;\n  this._handle.onerror = function (message, errno) {\n    // there is no way to cleanly recover.\n    // continuing only obscures problems.\n    _close(self);\n    self._hadError = true;\n\n    var error = new Error(message);\n    error.errno = errno;\n    error.code = exports.codes[errno];\n    self.emit('error', error);\n  };\n\n  var level = exports.Z_DEFAULT_COMPRESSION;\n  if (typeof opts.level === 'number') level = opts.level;\n\n  var strategy = exports.Z_DEFAULT_STRATEGY;\n  if (typeof opts.strategy === 'number') strategy = opts.strategy;\n\n  this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, level, opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, strategy, opts.dictionary);\n\n  this._buffer = Buffer.allocUnsafe(this._chunkSize);\n  this._offset = 0;\n  this._level = level;\n  this._strategy = strategy;\n\n  this.once('end', this.close);\n\n  Object.defineProperty(this, '_closed', {\n    get: function () {\n      return !_this._handle;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n\nutil.inherits(Zlib, Transform);\n\nZlib.prototype.params = function (level, strategy, callback) {\n  if (level < exports.Z_MIN_LEVEL || level > exports.Z_MAX_LEVEL) {\n    throw new RangeError('Invalid compression level: ' + level);\n  }\n  if (strategy != exports.Z_FILTERED && strategy != exports.Z_HUFFMAN_ONLY && strategy != exports.Z_RLE && strategy != exports.Z_FIXED && strategy != exports.Z_DEFAULT_STRATEGY) {\n    throw new TypeError('Invalid strategy: ' + strategy);\n  }\n\n  if (this._level !== level || this._strategy !== strategy) {\n    var self = this;\n    this.flush(binding.Z_SYNC_FLUSH, function () {\n      assert(self._handle, 'zlib binding closed');\n      self._handle.params(level, strategy);\n      if (!self._hadError) {\n        self._level = level;\n        self._strategy = strategy;\n        if (callback) callback();\n      }\n    });\n  } else {\n    process.nextTick(callback);\n  }\n};\n\nZlib.prototype.reset = function () {\n  assert(this._handle, 'zlib binding closed');\n  return this._handle.reset();\n};\n\n// This is the _flush function called by the transform class,\n// internally, when the last chunk has been written.\nZlib.prototype._flush = function (callback) {\n  this._transform(Buffer.alloc(0), '', callback);\n};\n\nZlib.prototype.flush = function (kind, callback) {\n  var _this2 = this;\n\n  var ws = this._writableState;\n\n  if (typeof kind === 'function' || kind === undefined && !callback) {\n    callback = kind;\n    kind = binding.Z_FULL_FLUSH;\n  }\n\n  if (ws.ended) {\n    if (callback) process.nextTick(callback);\n  } else if (ws.ending) {\n    if (callback) this.once('end', callback);\n  } else if (ws.needDrain) {\n    if (callback) {\n      this.once('drain', function () {\n        return _this2.flush(kind, callback);\n      });\n    }\n  } else {\n    this._flushFlag = kind;\n    this.write(Buffer.alloc(0), '', callback);\n  }\n};\n\nZlib.prototype.close = function (callback) {\n  _close(this, callback);\n  process.nextTick(emitCloseNT, this);\n};\n\nfunction _close(engine, callback) {\n  if (callback) process.nextTick(callback);\n\n  // Caller may invoke .close after a zlib error (which will null _handle).\n  if (!engine._handle) return;\n\n  engine._handle.close();\n  engine._handle = null;\n}\n\nfunction emitCloseNT(self) {\n  self.emit('close');\n}\n\nZlib.prototype._transform = function (chunk, encoding, cb) {\n  var flushFlag;\n  var ws = this._writableState;\n  var ending = ws.ending || ws.ended;\n  var last = ending && (!chunk || ws.length === chunk.length);\n\n  if (chunk !== null && !Buffer.isBuffer(chunk)) return cb(new Error('invalid input'));\n\n  if (!this._handle) return cb(new Error('zlib binding closed'));\n\n  // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag\n  // (or whatever flag was provided using opts.finishFlush).\n  // If it's explicitly flushing at some other time, then we use\n  // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression\n  // goodness.\n  if (last) flushFlag = this._finishFlushFlag;else {\n    flushFlag = this._flushFlag;\n    // once we've flushed the last of the queue, stop flushing and\n    // go back to the normal behavior.\n    if (chunk.length >= ws.length) {\n      this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH;\n    }\n  }\n\n  this._processChunk(chunk, flushFlag, cb);\n};\n\nZlib.prototype._processChunk = function (chunk, flushFlag, cb) {\n  var availInBefore = chunk && chunk.length;\n  var availOutBefore = this._chunkSize - this._offset;\n  var inOff = 0;\n\n  var self = this;\n\n  var async = typeof cb === 'function';\n\n  if (!async) {\n    var buffers = [];\n    var nread = 0;\n\n    var error;\n    this.on('error', function (er) {\n      error = er;\n    });\n\n    assert(this._handle, 'zlib binding closed');\n    do {\n      var res = this._handle.writeSync(flushFlag, chunk, // in\n      inOff, // in_off\n      availInBefore, // in_len\n      this._buffer, // out\n      this._offset, //out_off\n      availOutBefore); // out_len\n    } while (!this._hadError && callback(res[0], res[1]));\n\n    if (this._hadError) {\n      throw error;\n    }\n\n    if (nread >= kMaxLength) {\n      _close(this);\n      throw new RangeError(kRangeErrorMessage);\n    }\n\n    var buf = Buffer.concat(buffers, nread);\n    _close(this);\n\n    return buf;\n  }\n\n  assert(this._handle, 'zlib binding closed');\n  var req = this._handle.write(flushFlag, chunk, // in\n  inOff, // in_off\n  availInBefore, // in_len\n  this._buffer, // out\n  this._offset, //out_off\n  availOutBefore); // out_len\n\n  req.buffer = chunk;\n  req.callback = callback;\n\n  function callback(availInAfter, availOutAfter) {\n    // When the callback is used in an async write, the callback's\n    // context is the `req` object that was created. The req object\n    // is === this._handle, and that's why it's important to null\n    // out the values after they are done being used. `this._handle`\n    // can stay in memory longer than the callback and buffer are needed.\n    if (this) {\n      this.buffer = null;\n      this.callback = null;\n    }\n\n    if (self._hadError) return;\n\n    var have = availOutBefore - availOutAfter;\n    assert(have >= 0, 'have should not go down');\n\n    if (have > 0) {\n      var out = self._buffer.slice(self._offset, self._offset + have);\n      self._offset += have;\n      // serve some output to the consumer.\n      if (async) {\n        self.push(out);\n      } else {\n        buffers.push(out);\n        nread += out.length;\n      }\n    }\n\n    // exhausted the output buffer, or used all the input create a new one.\n    if (availOutAfter === 0 || self._offset >= self._chunkSize) {\n      availOutBefore = self._chunkSize;\n      self._offset = 0;\n      self._buffer = Buffer.allocUnsafe(self._chunkSize);\n    }\n\n    if (availOutAfter === 0) {\n      // Not actually done.  Need to reprocess.\n      // Also, update the availInBefore to the availInAfter value,\n      // so that if we have to hit it a third (fourth, etc.) time,\n      // it'll have the correct byte counts.\n      inOff += availInBefore - availInAfter;\n      availInBefore = availInAfter;\n\n      if (!async) return true;\n\n      var newReq = self._handle.write(flushFlag, chunk, inOff, availInBefore, self._buffer, self._offset, self._chunkSize);\n      newReq.callback = callback; // this same function\n      newReq.buffer = chunk;\n      return;\n    }\n\n    if (!async) return false;\n\n    // finished with the chunk.\n    cb();\n  }\n};\n\nutil.inherits(Deflate, Zlib);\nutil.inherits(Inflate, Zlib);\nutil.inherits(Gzip, Zlib);\nutil.inherits(Gunzip, Zlib);\nutil.inherits(DeflateRaw, Zlib);\nutil.inherits(InflateRaw, Zlib);\nutil.inherits(Unzip, Zlib);","\"use strict\";\n\nlet util = require(\"util\");\nlet Stream = require(\"stream\");\n\nlet ChunkStream = (module.exports = function () {\n  Stream.call(this);\n\n  this._buffers = [];\n  this._buffered = 0;\n\n  this._reads = [];\n  this._paused = false;\n\n  this._encoding = \"utf8\";\n  this.writable = true;\n});\nutil.inherits(ChunkStream, Stream);\n\nChunkStream.prototype.read = function (length, callback) {\n  this._reads.push({\n    length: Math.abs(length), // if length < 0 then at most this length\n    allowLess: length < 0,\n    func: callback,\n  });\n\n  process.nextTick(\n    function () {\n      this._process();\n\n      // its paused and there is not enought data then ask for more\n      if (this._paused && this._reads && this._reads.length > 0) {\n        this._paused = false;\n\n        this.emit(\"drain\");\n      }\n    }.bind(this)\n  );\n};\n\nChunkStream.prototype.write = function (data, encoding) {\n  if (!this.writable) {\n    this.emit(\"error\", new Error(\"Stream not writable\"));\n    return false;\n  }\n\n  let dataBuffer;\n  if (Buffer.isBuffer(data)) {\n    dataBuffer = data;\n  } else {\n    dataBuffer = Buffer.from(data, encoding || this._encoding);\n  }\n\n  this._buffers.push(dataBuffer);\n  this._buffered += dataBuffer.length;\n\n  this._process();\n\n  // ok if there are no more read requests\n  if (this._reads && this._reads.length === 0) {\n    this._paused = true;\n  }\n\n  return this.writable && !this._paused;\n};\n\nChunkStream.prototype.end = function (data, encoding) {\n  if (data) {\n    this.write(data, encoding);\n  }\n\n  this.writable = false;\n\n  // already destroyed\n  if (!this._buffers) {\n    return;\n  }\n\n  // enqueue or handle end\n  if (this._buffers.length === 0) {\n    this._end();\n  } else {\n    this._buffers.push(null);\n    this._process();\n  }\n};\n\nChunkStream.prototype.destroySoon = ChunkStream.prototype.end;\n\nChunkStream.prototype._end = function () {\n  if (this._reads.length > 0) {\n    this.emit(\"error\", new Error(\"Unexpected end of input\"));\n  }\n\n  this.destroy();\n};\n\nChunkStream.prototype.destroy = function () {\n  if (!this._buffers) {\n    return;\n  }\n\n  this.writable = false;\n  this._reads = null;\n  this._buffers = null;\n\n  this.emit(\"close\");\n};\n\nChunkStream.prototype._processReadAllowingLess = function (read) {\n  // ok there is any data so that we can satisfy this request\n  this._reads.shift(); // == read\n\n  // first we need to peek into first buffer\n  let smallerBuf = this._buffers[0];\n\n  // ok there is more data than we need\n  if (smallerBuf.length > read.length) {\n    this._buffered -= read.length;\n    this._buffers[0] = smallerBuf.slice(read.length);\n\n    read.func.call(this, smallerBuf.slice(0, read.length));\n  } else {\n    // ok this is less than maximum length so use it all\n    this._buffered -= smallerBuf.length;\n    this._buffers.shift(); // == smallerBuf\n\n    read.func.call(this, smallerBuf);\n  }\n};\n\nChunkStream.prototype._processRead = function (read) {\n  this._reads.shift(); // == read\n\n  let pos = 0;\n  let count = 0;\n  let data = Buffer.alloc(read.length);\n\n  // create buffer for all data\n  while (pos < read.length) {\n    let buf = this._buffers[count++];\n    let len = Math.min(buf.length, read.length - pos);\n\n    buf.copy(data, pos, 0, len);\n    pos += len;\n\n    // last buffer wasn't used all so just slice it and leave\n    if (len !== buf.length) {\n      this._buffers[--count] = buf.slice(len);\n    }\n  }\n\n  // remove all used buffers\n  if (count > 0) {\n    this._buffers.splice(0, count);\n  }\n\n  this._buffered -= read.length;\n\n  read.func.call(this, data);\n};\n\nChunkStream.prototype._process = function () {\n  try {\n    // as long as there is any data and read requests\n    while (this._buffered > 0 && this._reads && this._reads.length > 0) {\n      let read = this._reads[0];\n\n      // read any data (but no more than length)\n      if (read.allowLess) {\n        this._processReadAllowingLess(read);\n      } else if (this._buffered >= read.length) {\n        // ok we can meet some expectations\n\n        this._processRead(read);\n      } else {\n        // not enought data to satisfy first request in queue\n        // so we need to wait for more\n        break;\n      }\n    }\n\n    if (this._buffers && !this.writable) {\n      this._end();\n    }\n  } catch (ex) {\n    this.emit(\"error\", ex);\n  }\n};\n","\"use strict\";\n\n// Adam 7\n//   0 1 2 3 4 5 6 7\n// 0 x 6 4 6 x 6 4 6\n// 1 7 7 7 7 7 7 7 7\n// 2 5 6 5 6 5 6 5 6\n// 3 7 7 7 7 7 7 7 7\n// 4 3 6 4 6 3 6 4 6\n// 5 7 7 7 7 7 7 7 7\n// 6 5 6 5 6 5 6 5 6\n// 7 7 7 7 7 7 7 7 7\n\nlet imagePasses = [\n  {\n    // pass 1 - 1px\n    x: [0],\n    y: [0],\n  },\n  {\n    // pass 2 - 1px\n    x: [4],\n    y: [0],\n  },\n  {\n    // pass 3 - 2px\n    x: [0, 4],\n    y: [4],\n  },\n  {\n    // pass 4 - 4px\n    x: [2, 6],\n    y: [0, 4],\n  },\n  {\n    // pass 5 - 8px\n    x: [0, 2, 4, 6],\n    y: [2, 6],\n  },\n  {\n    // pass 6 - 16px\n    x: [1, 3, 5, 7],\n    y: [0, 2, 4, 6],\n  },\n  {\n    // pass 7 - 32px\n    x: [0, 1, 2, 3, 4, 5, 6, 7],\n    y: [1, 3, 5, 7],\n  },\n];\n\nexports.getImagePasses = function (width, height) {\n  let images = [];\n  let xLeftOver = width % 8;\n  let yLeftOver = height % 8;\n  let xRepeats = (width - xLeftOver) / 8;\n  let yRepeats = (height - yLeftOver) / 8;\n  for (let i = 0; i < imagePasses.length; i++) {\n    let pass = imagePasses[i];\n    let passWidth = xRepeats * pass.x.length;\n    let passHeight = yRepeats * pass.y.length;\n    for (let j = 0; j < pass.x.length; j++) {\n      if (pass.x[j] < xLeftOver) {\n        passWidth++;\n      } else {\n        break;\n      }\n    }\n    for (let j = 0; j < pass.y.length; j++) {\n      if (pass.y[j] < yLeftOver) {\n        passHeight++;\n      } else {\n        break;\n      }\n    }\n    if (passWidth > 0 && passHeight > 0) {\n      images.push({ width: passWidth, height: passHeight, index: i });\n    }\n  }\n  return images;\n};\n\nexports.getInterlaceIterator = function (width) {\n  return function (x, y, pass) {\n    let outerXLeftOver = x % imagePasses[pass].x.length;\n    let outerX =\n      ((x - outerXLeftOver) / imagePasses[pass].x.length) * 8 +\n      imagePasses[pass].x[outerXLeftOver];\n    let outerYLeftOver = y % imagePasses[pass].y.length;\n    let outerY =\n      ((y - outerYLeftOver) / imagePasses[pass].y.length) * 8 +\n      imagePasses[pass].y[outerYLeftOver];\n    return outerX * 4 + outerY * width * 4;\n  };\n};\n","\"use strict\";\n\nmodule.exports = function paethPredictor(left, above, upLeft) {\n  let paeth = left + above - upLeft;\n  let pLeft = Math.abs(paeth - left);\n  let pAbove = Math.abs(paeth - above);\n  let pUpLeft = Math.abs(paeth - upLeft);\n\n  if (pLeft <= pAbove && pLeft <= pUpLeft) {\n    return left;\n  }\n  if (pAbove <= pUpLeft) {\n    return above;\n  }\n  return upLeft;\n};\n","\"use strict\";\n\nlet interlaceUtils = require(\"./interlace\");\nlet paethPredictor = require(\"./paeth-predictor\");\n\nfunction getByteWidth(width, bpp, depth) {\n  let byteWidth = width * bpp;\n  if (depth !== 8) {\n    byteWidth = Math.ceil(byteWidth / (8 / depth));\n  }\n  return byteWidth;\n}\n\nlet Filter = (module.exports = function (bitmapInfo, dependencies) {\n  let width = bitmapInfo.width;\n  let height = bitmapInfo.height;\n  let interlace = bitmapInfo.interlace;\n  let bpp = bitmapInfo.bpp;\n  let depth = bitmapInfo.depth;\n\n  this.read = dependencies.read;\n  this.write = dependencies.write;\n  this.complete = dependencies.complete;\n\n  this._imageIndex = 0;\n  this._images = [];\n  if (interlace) {\n    let passes = interlaceUtils.getImagePasses(width, height);\n    for (let i = 0; i < passes.length; i++) {\n      this._images.push({\n        byteWidth: getByteWidth(passes[i].width, bpp, depth),\n        height: passes[i].height,\n        lineIndex: 0,\n      });\n    }\n  } else {\n    this._images.push({\n      byteWidth: getByteWidth(width, bpp, depth),\n      height: height,\n      lineIndex: 0,\n    });\n  }\n\n  // when filtering the line we look at the pixel to the left\n  // the spec also says it is done on a byte level regardless of the number of pixels\n  // so if the depth is byte compatible (8 or 16) we subtract the bpp in order to compare back\n  // a pixel rather than just a different byte part. However if we are sub byte, we ignore.\n  if (depth === 8) {\n    this._xComparison = bpp;\n  } else if (depth === 16) {\n    this._xComparison = bpp * 2;\n  } else {\n    this._xComparison = 1;\n  }\n});\n\nFilter.prototype.start = function () {\n  this.read(\n    this._images[this._imageIndex].byteWidth + 1,\n    this._reverseFilterLine.bind(this)\n  );\n};\n\nFilter.prototype._unFilterType1 = function (\n  rawData,\n  unfilteredLine,\n  byteWidth\n) {\n  let xComparison = this._xComparison;\n  let xBiggerThan = xComparison - 1;\n\n  for (let x = 0; x < byteWidth; x++) {\n    let rawByte = rawData[1 + x];\n    let f1Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;\n    unfilteredLine[x] = rawByte + f1Left;\n  }\n};\n\nFilter.prototype._unFilterType2 = function (\n  rawData,\n  unfilteredLine,\n  byteWidth\n) {\n  let lastLine = this._lastLine;\n\n  for (let x = 0; x < byteWidth; x++) {\n    let rawByte = rawData[1 + x];\n    let f2Up = lastLine ? lastLine[x] : 0;\n    unfilteredLine[x] = rawByte + f2Up;\n  }\n};\n\nFilter.prototype._unFilterType3 = function (\n  rawData,\n  unfilteredLine,\n  byteWidth\n) {\n  let xComparison = this._xComparison;\n  let xBiggerThan = xComparison - 1;\n  let lastLine = this._lastLine;\n\n  for (let x = 0; x < byteWidth; x++) {\n    let rawByte = rawData[1 + x];\n    let f3Up = lastLine ? lastLine[x] : 0;\n    let f3Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;\n    let f3Add = Math.floor((f3Left + f3Up) / 2);\n    unfilteredLine[x] = rawByte + f3Add;\n  }\n};\n\nFilter.prototype._unFilterType4 = function (\n  rawData,\n  unfilteredLine,\n  byteWidth\n) {\n  let xComparison = this._xComparison;\n  let xBiggerThan = xComparison - 1;\n  let lastLine = this._lastLine;\n\n  for (let x = 0; x < byteWidth; x++) {\n    let rawByte = rawData[1 + x];\n    let f4Up = lastLine ? lastLine[x] : 0;\n    let f4Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;\n    let f4UpLeft = x > xBiggerThan && lastLine ? lastLine[x - xComparison] : 0;\n    let f4Add = paethPredictor(f4Left, f4Up, f4UpLeft);\n    unfilteredLine[x] = rawByte + f4Add;\n  }\n};\n\nFilter.prototype._reverseFilterLine = function (rawData) {\n  let filter = rawData[0];\n  let unfilteredLine;\n  let currentImage = this._images[this._imageIndex];\n  let byteWidth = currentImage.byteWidth;\n\n  if (filter === 0) {\n    unfilteredLine = rawData.slice(1, byteWidth + 1);\n  } else {\n    unfilteredLine = Buffer.alloc(byteWidth);\n\n    switch (filter) {\n      case 1:\n        this._unFilterType1(rawData, unfilteredLine, byteWidth);\n        break;\n      case 2:\n        this._unFilterType2(rawData, unfilteredLine, byteWidth);\n        break;\n      case 3:\n        this._unFilterType3(rawData, unfilteredLine, byteWidth);\n        break;\n      case 4:\n        this._unFilterType4(rawData, unfilteredLine, byteWidth);\n        break;\n      default:\n        throw new Error(\"Unrecognised filter type - \" + filter);\n    }\n  }\n\n  this.write(unfilteredLine);\n\n  currentImage.lineIndex++;\n  if (currentImage.lineIndex >= currentImage.height) {\n    this._lastLine = null;\n    this._imageIndex++;\n    currentImage = this._images[this._imageIndex];\n  } else {\n    this._lastLine = unfilteredLine;\n  }\n\n  if (currentImage) {\n    // read, using the byte width that may be from the new current image\n    this.read(currentImage.byteWidth + 1, this._reverseFilterLine.bind(this));\n  } else {\n    this._lastLine = null;\n    this.complete();\n  }\n};\n","\"use strict\";\n\nlet util = require(\"util\");\nlet ChunkStream = require(\"./chunkstream\");\nlet Filter = require(\"./filter-parse\");\n\nlet FilterAsync = (module.exports = function (bitmapInfo) {\n  ChunkStream.call(this);\n\n  let buffers = [];\n  let that = this;\n  this._filter = new Filter(bitmapInfo, {\n    read: this.read.bind(this),\n    write: function (buffer) {\n      buffers.push(buffer);\n    },\n    complete: function () {\n      that.emit(\"complete\", Buffer.concat(buffers));\n    },\n  });\n\n  this._filter.start();\n});\nutil.inherits(FilterAsync, ChunkStream);\n","\"use strict\";\n\nmodule.exports = {\n  PNG_SIGNATURE: [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a],\n\n  TYPE_IHDR: 0x49484452,\n  TYPE_IEND: 0x49454e44,\n  TYPE_IDAT: 0x49444154,\n  TYPE_PLTE: 0x504c5445,\n  TYPE_tRNS: 0x74524e53, // eslint-disable-line camelcase\n  TYPE_gAMA: 0x67414d41, // eslint-disable-line camelcase\n\n  // color-type bits\n  COLORTYPE_GRAYSCALE: 0,\n  COLORTYPE_PALETTE: 1,\n  COLORTYPE_COLOR: 2,\n  COLORTYPE_ALPHA: 4, // e.g. grayscale and alpha\n\n  // color-type combinations\n  COLORTYPE_PALETTE_COLOR: 3,\n  COLORTYPE_COLOR_ALPHA: 6,\n\n  COLORTYPE_TO_BPP_MAP: {\n    0: 1,\n    2: 3,\n    3: 1,\n    4: 2,\n    6: 4,\n  },\n\n  GAMMA_DIVISION: 100000,\n};\n","\"use strict\";\n\nlet crcTable = [];\n\n(function () {\n  for (let i = 0; i < 256; i++) {\n    let currentCrc = i;\n    for (let j = 0; j < 8; j++) {\n      if (currentCrc & 1) {\n        currentCrc = 0xedb88320 ^ (currentCrc >>> 1);\n      } else {\n        currentCrc = currentCrc >>> 1;\n      }\n    }\n    crcTable[i] = currentCrc;\n  }\n})();\n\nlet CrcCalculator = (module.exports = function () {\n  this._crc = -1;\n});\n\nCrcCalculator.prototype.write = function (data) {\n  for (let i = 0; i < data.length; i++) {\n    this._crc = crcTable[(this._crc ^ data[i]) & 0xff] ^ (this._crc >>> 8);\n  }\n  return true;\n};\n\nCrcCalculator.prototype.crc32 = function () {\n  return this._crc ^ -1;\n};\n\nCrcCalculator.crc32 = function (buf) {\n  let crc = -1;\n  for (let i = 0; i < buf.length; i++) {\n    crc = crcTable[(crc ^ buf[i]) & 0xff] ^ (crc >>> 8);\n  }\n  return crc ^ -1;\n};\n","\"use strict\";\n\nlet constants = require(\"./constants\");\nlet CrcCalculator = require(\"./crc\");\n\nlet Parser = (module.exports = function (options, dependencies) {\n  this._options = options;\n  options.checkCRC = options.checkCRC !== false;\n\n  this._hasIHDR = false;\n  this._hasIEND = false;\n  this._emittedHeadersFinished = false;\n\n  // input flags/metadata\n  this._palette = [];\n  this._colorType = 0;\n\n  this._chunks = {};\n  this._chunks[constants.TYPE_IHDR] = this._handleIHDR.bind(this);\n  this._chunks[constants.TYPE_IEND] = this._handleIEND.bind(this);\n  this._chunks[constants.TYPE_IDAT] = this._handleIDAT.bind(this);\n  this._chunks[constants.TYPE_PLTE] = this._handlePLTE.bind(this);\n  this._chunks[constants.TYPE_tRNS] = this._handleTRNS.bind(this);\n  this._chunks[constants.TYPE_gAMA] = this._handleGAMA.bind(this);\n\n  this.read = dependencies.read;\n  this.error = dependencies.error;\n  this.metadata = dependencies.metadata;\n  this.gamma = dependencies.gamma;\n  this.transColor = dependencies.transColor;\n  this.palette = dependencies.palette;\n  this.parsed = dependencies.parsed;\n  this.inflateData = dependencies.inflateData;\n  this.finished = dependencies.finished;\n  this.simpleTransparency = dependencies.simpleTransparency;\n  this.headersFinished = dependencies.headersFinished || function () {};\n});\n\nParser.prototype.start = function () {\n  this.read(constants.PNG_SIGNATURE.length, this._parseSignature.bind(this));\n};\n\nParser.prototype._parseSignature = function (data) {\n  let signature = constants.PNG_SIGNATURE;\n\n  for (let i = 0; i < signature.length; i++) {\n    if (data[i] !== signature[i]) {\n      this.error(new Error(\"Invalid file signature\"));\n      return;\n    }\n  }\n  this.read(8, this._parseChunkBegin.bind(this));\n};\n\nParser.prototype._parseChunkBegin = function (data) {\n  // chunk content length\n  let length = data.readUInt32BE(0);\n\n  // chunk type\n  let type = data.readUInt32BE(4);\n  let name = \"\";\n  for (let i = 4; i < 8; i++) {\n    name += String.fromCharCode(data[i]);\n  }\n\n  //console.log('chunk ', name, length);\n\n  // chunk flags\n  let ancillary = Boolean(data[4] & 0x20); // or critical\n  //    priv = Boolean(data[5] & 0x20), // or public\n  //    safeToCopy = Boolean(data[7] & 0x20); // or unsafe\n\n  if (!this._hasIHDR && type !== constants.TYPE_IHDR) {\n    this.error(new Error(\"Expected IHDR on beggining\"));\n    return;\n  }\n\n  this._crc = new CrcCalculator();\n  this._crc.write(Buffer.from(name));\n\n  if (this._chunks[type]) {\n    return this._chunks[type](length);\n  }\n\n  if (!ancillary) {\n    this.error(new Error(\"Unsupported critical chunk type \" + name));\n    return;\n  }\n\n  this.read(length + 4, this._skipChunk.bind(this));\n};\n\nParser.prototype._skipChunk = function (/*data*/) {\n  this.read(8, this._parseChunkBegin.bind(this));\n};\n\nParser.prototype._handleChunkEnd = function () {\n  this.read(4, this._parseChunkEnd.bind(this));\n};\n\nParser.prototype._parseChunkEnd = function (data) {\n  let fileCrc = data.readInt32BE(0);\n  let calcCrc = this._crc.crc32();\n\n  // check CRC\n  if (this._options.checkCRC && calcCrc !== fileCrc) {\n    this.error(new Error(\"Crc error - \" + fileCrc + \" - \" + calcCrc));\n    return;\n  }\n\n  if (!this._hasIEND) {\n    this.read(8, this._parseChunkBegin.bind(this));\n  }\n};\n\nParser.prototype._handleIHDR = function (length) {\n  this.read(length, this._parseIHDR.bind(this));\n};\nParser.prototype._parseIHDR = function (data) {\n  this._crc.write(data);\n\n  let width = data.readUInt32BE(0);\n  let height = data.readUInt32BE(4);\n  let depth = data[8];\n  let colorType = data[9]; // bits: 1 palette, 2 color, 4 alpha\n  let compr = data[10];\n  let filter = data[11];\n  let interlace = data[12];\n\n  // console.log('    width', width, 'height', height,\n  //     'depth', depth, 'colorType', colorType,\n  //     'compr', compr, 'filter', filter, 'interlace', interlace\n  // );\n\n  if (\n    depth !== 8 &&\n    depth !== 4 &&\n    depth !== 2 &&\n    depth !== 1 &&\n    depth !== 16\n  ) {\n    this.error(new Error(\"Unsupported bit depth \" + depth));\n    return;\n  }\n  if (!(colorType in constants.COLORTYPE_TO_BPP_MAP)) {\n    this.error(new Error(\"Unsupported color type\"));\n    return;\n  }\n  if (compr !== 0) {\n    this.error(new Error(\"Unsupported compression method\"));\n    return;\n  }\n  if (filter !== 0) {\n    this.error(new Error(\"Unsupported filter method\"));\n    return;\n  }\n  if (interlace !== 0 && interlace !== 1) {\n    this.error(new Error(\"Unsupported interlace method\"));\n    return;\n  }\n\n  this._colorType = colorType;\n\n  let bpp = constants.COLORTYPE_TO_BPP_MAP[this._colorType];\n\n  this._hasIHDR = true;\n\n  this.metadata({\n    width: width,\n    height: height,\n    depth: depth,\n    interlace: Boolean(interlace),\n    palette: Boolean(colorType & constants.COLORTYPE_PALETTE),\n    color: Boolean(colorType & constants.COLORTYPE_COLOR),\n    alpha: Boolean(colorType & constants.COLORTYPE_ALPHA),\n    bpp: bpp,\n    colorType: colorType,\n  });\n\n  this._handleChunkEnd();\n};\n\nParser.prototype._handlePLTE = function (length) {\n  this.read(length, this._parsePLTE.bind(this));\n};\nParser.prototype._parsePLTE = function (data) {\n  this._crc.write(data);\n\n  let entries = Math.floor(data.length / 3);\n  // console.log('Palette:', entries);\n\n  for (let i = 0; i < entries; i++) {\n    this._palette.push([data[i * 3], data[i * 3 + 1], data[i * 3 + 2], 0xff]);\n  }\n\n  this.palette(this._palette);\n\n  this._handleChunkEnd();\n};\n\nParser.prototype._handleTRNS = function (length) {\n  this.simpleTransparency();\n  this.read(length, this._parseTRNS.bind(this));\n};\nParser.prototype._parseTRNS = function (data) {\n  this._crc.write(data);\n\n  // palette\n  if (this._colorType === constants.COLORTYPE_PALETTE_COLOR) {\n    if (this._palette.length === 0) {\n      this.error(new Error(\"Transparency chunk must be after palette\"));\n      return;\n    }\n    if (data.length > this._palette.length) {\n      this.error(new Error(\"More transparent colors than palette size\"));\n      return;\n    }\n    for (let i = 0; i < data.length; i++) {\n      this._palette[i][3] = data[i];\n    }\n    this.palette(this._palette);\n  }\n\n  // for colorType 0 (grayscale) and 2 (rgb)\n  // there might be one gray/color defined as transparent\n  if (this._colorType === constants.COLORTYPE_GRAYSCALE) {\n    // grey, 2 bytes\n    this.transColor([data.readUInt16BE(0)]);\n  }\n  if (this._colorType === constants.COLORTYPE_COLOR) {\n    this.transColor([\n      data.readUInt16BE(0),\n      data.readUInt16BE(2),\n      data.readUInt16BE(4),\n    ]);\n  }\n\n  this._handleChunkEnd();\n};\n\nParser.prototype._handleGAMA = function (length) {\n  this.read(length, this._parseGAMA.bind(this));\n};\nParser.prototype._parseGAMA = function (data) {\n  this._crc.write(data);\n  this.gamma(data.readUInt32BE(0) / constants.GAMMA_DIVISION);\n\n  this._handleChunkEnd();\n};\n\nParser.prototype._handleIDAT = function (length) {\n  if (!this._emittedHeadersFinished) {\n    this._emittedHeadersFinished = true;\n    this.headersFinished();\n  }\n  this.read(-length, this._parseIDAT.bind(this, length));\n};\nParser.prototype._parseIDAT = function (length, data) {\n  this._crc.write(data);\n\n  if (\n    this._colorType === constants.COLORTYPE_PALETTE_COLOR &&\n    this._palette.length === 0\n  ) {\n    throw new Error(\"Expected palette not found\");\n  }\n\n  this.inflateData(data);\n  let leftOverLength = length - data.length;\n\n  if (leftOverLength > 0) {\n    this._handleIDAT(leftOverLength);\n  } else {\n    this._handleChunkEnd();\n  }\n};\n\nParser.prototype._handleIEND = function (length) {\n  this.read(length, this._parseIEND.bind(this));\n};\nParser.prototype._parseIEND = function (data) {\n  this._crc.write(data);\n\n  this._hasIEND = true;\n  this._handleChunkEnd();\n\n  if (this.finished) {\n    this.finished();\n  }\n};\n","\"use strict\";\n\nlet interlaceUtils = require(\"./interlace\");\n\nlet pixelBppMapper = [\n  // 0 - dummy entry\n  function () {},\n\n  // 1 - L\n  // 0: 0, 1: 0, 2: 0, 3: 0xff\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos === data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    let pixel = data[rawPos];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = 0xff;\n  },\n\n  // 2 - LA\n  // 0: 0, 1: 0, 2: 0, 3: 1\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 1 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    let pixel = data[rawPos];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = data[rawPos + 1];\n  },\n\n  // 3 - RGB\n  // 0: 0, 1: 1, 2: 2, 3: 0xff\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 2 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    pxData[pxPos] = data[rawPos];\n    pxData[pxPos + 1] = data[rawPos + 1];\n    pxData[pxPos + 2] = data[rawPos + 2];\n    pxData[pxPos + 3] = 0xff;\n  },\n\n  // 4 - RGBA\n  // 0: 0, 1: 1, 2: 2, 3: 3\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 3 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    pxData[pxPos] = data[rawPos];\n    pxData[pxPos + 1] = data[rawPos + 1];\n    pxData[pxPos + 2] = data[rawPos + 2];\n    pxData[pxPos + 3] = data[rawPos + 3];\n  },\n];\n\nlet pixelBppCustomMapper = [\n  // 0 - dummy entry\n  function () {},\n\n  // 1 - L\n  // 0: 0, 1: 0, 2: 0, 3: 0xff\n  function (pxData, pixelData, pxPos, maxBit) {\n    let pixel = pixelData[0];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = maxBit;\n  },\n\n  // 2 - LA\n  // 0: 0, 1: 0, 2: 0, 3: 1\n  function (pxData, pixelData, pxPos) {\n    let pixel = pixelData[0];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = pixelData[1];\n  },\n\n  // 3 - RGB\n  // 0: 0, 1: 1, 2: 2, 3: 0xff\n  function (pxData, pixelData, pxPos, maxBit) {\n    pxData[pxPos] = pixelData[0];\n    pxData[pxPos + 1] = pixelData[1];\n    pxData[pxPos + 2] = pixelData[2];\n    pxData[pxPos + 3] = maxBit;\n  },\n\n  // 4 - RGBA\n  // 0: 0, 1: 1, 2: 2, 3: 3\n  function (pxData, pixelData, pxPos) {\n    pxData[pxPos] = pixelData[0];\n    pxData[pxPos + 1] = pixelData[1];\n    pxData[pxPos + 2] = pixelData[2];\n    pxData[pxPos + 3] = pixelData[3];\n  },\n];\n\nfunction bitRetriever(data, depth) {\n  let leftOver = [];\n  let i = 0;\n\n  function split() {\n    if (i === data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n    let byte = data[i];\n    i++;\n    let byte8, byte7, byte6, byte5, byte4, byte3, byte2, byte1;\n    switch (depth) {\n      default:\n        throw new Error(\"unrecognised depth\");\n      case 16:\n        byte2 = data[i];\n        i++;\n        leftOver.push((byte << 8) + byte2);\n        break;\n      case 4:\n        byte2 = byte & 0x0f;\n        byte1 = byte >> 4;\n        leftOver.push(byte1, byte2);\n        break;\n      case 2:\n        byte4 = byte & 3;\n        byte3 = (byte >> 2) & 3;\n        byte2 = (byte >> 4) & 3;\n        byte1 = (byte >> 6) & 3;\n        leftOver.push(byte1, byte2, byte3, byte4);\n        break;\n      case 1:\n        byte8 = byte & 1;\n        byte7 = (byte >> 1) & 1;\n        byte6 = (byte >> 2) & 1;\n        byte5 = (byte >> 3) & 1;\n        byte4 = (byte >> 4) & 1;\n        byte3 = (byte >> 5) & 1;\n        byte2 = (byte >> 6) & 1;\n        byte1 = (byte >> 7) & 1;\n        leftOver.push(byte1, byte2, byte3, byte4, byte5, byte6, byte7, byte8);\n        break;\n    }\n  }\n\n  return {\n    get: function (count) {\n      while (leftOver.length < count) {\n        split();\n      }\n      let returner = leftOver.slice(0, count);\n      leftOver = leftOver.slice(count);\n      return returner;\n    },\n    resetAfterLine: function () {\n      leftOver.length = 0;\n    },\n    end: function () {\n      if (i !== data.length) {\n        throw new Error(\"extra data found\");\n      }\n    },\n  };\n}\n\nfunction mapImage8Bit(image, pxData, getPxPos, bpp, data, rawPos) {\n  // eslint-disable-line max-params\n  let imageWidth = image.width;\n  let imageHeight = image.height;\n  let imagePass = image.index;\n  for (let y = 0; y < imageHeight; y++) {\n    for (let x = 0; x < imageWidth; x++) {\n      let pxPos = getPxPos(x, y, imagePass);\n      pixelBppMapper[bpp](pxData, data, pxPos, rawPos);\n      rawPos += bpp; //eslint-disable-line no-param-reassign\n    }\n  }\n  return rawPos;\n}\n\nfunction mapImageCustomBit(image, pxData, getPxPos, bpp, bits, maxBit) {\n  // eslint-disable-line max-params\n  let imageWidth = image.width;\n  let imageHeight = image.height;\n  let imagePass = image.index;\n  for (let y = 0; y < imageHeight; y++) {\n    for (let x = 0; x < imageWidth; x++) {\n      let pixelData = bits.get(bpp);\n      let pxPos = getPxPos(x, y, imagePass);\n      pixelBppCustomMapper[bpp](pxData, pixelData, pxPos, maxBit);\n    }\n    bits.resetAfterLine();\n  }\n}\n\nexports.dataToBitMap = function (data, bitmapInfo) {\n  let width = bitmapInfo.width;\n  let height = bitmapInfo.height;\n  let depth = bitmapInfo.depth;\n  let bpp = bitmapInfo.bpp;\n  let interlace = bitmapInfo.interlace;\n  let bits;\n\n  if (depth !== 8) {\n    bits = bitRetriever(data, depth);\n  }\n  let pxData;\n  if (depth <= 8) {\n    pxData = Buffer.alloc(width * height * 4);\n  } else {\n    pxData = new Uint16Array(width * height * 4);\n  }\n  let maxBit = Math.pow(2, depth) - 1;\n  let rawPos = 0;\n  let images;\n  let getPxPos;\n\n  if (interlace) {\n    images = interlaceUtils.getImagePasses(width, height);\n    getPxPos = interlaceUtils.getInterlaceIterator(width, height);\n  } else {\n    let nonInterlacedPxPos = 0;\n    getPxPos = function () {\n      let returner = nonInterlacedPxPos;\n      nonInterlacedPxPos += 4;\n      return returner;\n    };\n    images = [{ width: width, height: height }];\n  }\n\n  for (let imageIndex = 0; imageIndex < images.length; imageIndex++) {\n    if (depth === 8) {\n      rawPos = mapImage8Bit(\n        images[imageIndex],\n        pxData,\n        getPxPos,\n        bpp,\n        data,\n        rawPos\n      );\n    } else {\n      mapImageCustomBit(\n        images[imageIndex],\n        pxData,\n        getPxPos,\n        bpp,\n        bits,\n        maxBit\n      );\n    }\n  }\n  if (depth === 8) {\n    if (rawPos !== data.length) {\n      throw new Error(\"extra data found\");\n    }\n  } else {\n    bits.end();\n  }\n\n  return pxData;\n};\n","\"use strict\";\n\nfunction dePalette(indata, outdata, width, height, palette) {\n  let pxPos = 0;\n  // use values from palette\n  for (let y = 0; y < height; y++) {\n    for (let x = 0; x < width; x++) {\n      let color = palette[indata[pxPos]];\n\n      if (!color) {\n        throw new Error(\"index \" + indata[pxPos] + \" not in palette\");\n      }\n\n      for (let i = 0; i < 4; i++) {\n        outdata[pxPos + i] = color[i];\n      }\n      pxPos += 4;\n    }\n  }\n}\n\nfunction replaceTransparentColor(indata, outdata, width, height, transColor) {\n  let pxPos = 0;\n  for (let y = 0; y < height; y++) {\n    for (let x = 0; x < width; x++) {\n      let makeTrans = false;\n\n      if (transColor.length === 1) {\n        if (transColor[0] === indata[pxPos]) {\n          makeTrans = true;\n        }\n      } else if (\n        transColor[0] === indata[pxPos] &&\n        transColor[1] === indata[pxPos + 1] &&\n        transColor[2] === indata[pxPos + 2]\n      ) {\n        makeTrans = true;\n      }\n      if (makeTrans) {\n        for (let i = 0; i < 4; i++) {\n          outdata[pxPos + i] = 0;\n        }\n      }\n      pxPos += 4;\n    }\n  }\n}\n\nfunction scaleDepth(indata, outdata, width, height, depth) {\n  let maxOutSample = 255;\n  let maxInSample = Math.pow(2, depth) - 1;\n  let pxPos = 0;\n\n  for (let y = 0; y < height; y++) {\n    for (let x = 0; x < width; x++) {\n      for (let i = 0; i < 4; i++) {\n        outdata[pxPos + i] = Math.floor(\n          (indata[pxPos + i] * maxOutSample) / maxInSample + 0.5\n        );\n      }\n      pxPos += 4;\n    }\n  }\n}\n\nmodule.exports = function (indata, imageData) {\n  let depth = imageData.depth;\n  let width = imageData.width;\n  let height = imageData.height;\n  let colorType = imageData.colorType;\n  let transColor = imageData.transColor;\n  let palette = imageData.palette;\n\n  let outdata = indata; // only different for 16 bits\n\n  if (colorType === 3) {\n    // paletted\n    dePalette(indata, outdata, width, height, palette);\n  } else {\n    if (transColor) {\n      replaceTransparentColor(indata, outdata, width, height, transColor);\n    }\n    // if it needs scaling\n    if (depth !== 8) {\n      // if we need to change the buffer size\n      if (depth === 16) {\n        outdata = Buffer.alloc(width * height * 4);\n      }\n      scaleDepth(indata, outdata, width, height, depth);\n    }\n  }\n  return outdata;\n};\n","\"use strict\";\n\nlet util = require(\"util\");\nlet zlib = require(\"zlib\");\nlet ChunkStream = require(\"./chunkstream\");\nlet FilterAsync = require(\"./filter-parse-async\");\nlet Parser = require(\"./parser\");\nlet bitmapper = require(\"./bitmapper\");\nlet formatNormaliser = require(\"./format-normaliser\");\n\nlet ParserAsync = (module.exports = function (options) {\n  ChunkStream.call(this);\n\n  this._parser = new Parser(options, {\n    read: this.read.bind(this),\n    error: this._handleError.bind(this),\n    metadata: this._handleMetaData.bind(this),\n    gamma: this.emit.bind(this, \"gamma\"),\n    palette: this._handlePalette.bind(this),\n    transColor: this._handleTransColor.bind(this),\n    finished: this._finished.bind(this),\n    inflateData: this._inflateData.bind(this),\n    simpleTransparency: this._simpleTransparency.bind(this),\n    headersFinished: this._headersFinished.bind(this),\n  });\n  this._options = options;\n  this.writable = true;\n\n  this._parser.start();\n});\nutil.inherits(ParserAsync, ChunkStream);\n\nParserAsync.prototype._handleError = function (err) {\n  this.emit(\"error\", err);\n\n  this.writable = false;\n\n  this.destroy();\n\n  if (this._inflate && this._inflate.destroy) {\n    this._inflate.destroy();\n  }\n\n  if (this._filter) {\n    this._filter.destroy();\n    // For backward compatibility with Node 7 and below.\n    // Suppress errors due to _inflate calling write() even after\n    // it's destroy()'ed.\n    this._filter.on(\"error\", function () {});\n  }\n\n  this.errord = true;\n};\n\nParserAsync.prototype._inflateData = function (data) {\n  if (!this._inflate) {\n    if (this._bitmapInfo.interlace) {\n      this._inflate = zlib.createInflate();\n\n      this._inflate.on(\"error\", this.emit.bind(this, \"error\"));\n      this._filter.on(\"complete\", this._complete.bind(this));\n\n      this._inflate.pipe(this._filter);\n    } else {\n      let rowSize =\n        ((this._bitmapInfo.width *\n          this._bitmapInfo.bpp *\n          this._bitmapInfo.depth +\n          7) >>\n          3) +\n        1;\n      let imageSize = rowSize * this._bitmapInfo.height;\n      let chunkSize = Math.max(imageSize, zlib.Z_MIN_CHUNK);\n\n      this._inflate = zlib.createInflate({ chunkSize: chunkSize });\n      let leftToInflate = imageSize;\n\n      let emitError = this.emit.bind(this, \"error\");\n      this._inflate.on(\"error\", function (err) {\n        if (!leftToInflate) {\n          return;\n        }\n\n        emitError(err);\n      });\n      this._filter.on(\"complete\", this._complete.bind(this));\n\n      let filterWrite = this._filter.write.bind(this._filter);\n      this._inflate.on(\"data\", function (chunk) {\n        if (!leftToInflate) {\n          return;\n        }\n\n        if (chunk.length > leftToInflate) {\n          chunk = chunk.slice(0, leftToInflate);\n        }\n\n        leftToInflate -= chunk.length;\n\n        filterWrite(chunk);\n      });\n\n      this._inflate.on(\"end\", this._filter.end.bind(this._filter));\n    }\n  }\n  this._inflate.write(data);\n};\n\nParserAsync.prototype._handleMetaData = function (metaData) {\n  this._metaData = metaData;\n  this._bitmapInfo = Object.create(metaData);\n\n  this._filter = new FilterAsync(this._bitmapInfo);\n};\n\nParserAsync.prototype._handleTransColor = function (transColor) {\n  this._bitmapInfo.transColor = transColor;\n};\n\nParserAsync.prototype._handlePalette = function (palette) {\n  this._bitmapInfo.palette = palette;\n};\n\nParserAsync.prototype._simpleTransparency = function () {\n  this._metaData.alpha = true;\n};\n\nParserAsync.prototype._headersFinished = function () {\n  // Up until this point, we don't know if we have a tRNS chunk (alpha)\n  // so we can't emit metadata any earlier\n  this.emit(\"metadata\", this._metaData);\n};\n\nParserAsync.prototype._finished = function () {\n  if (this.errord) {\n    return;\n  }\n\n  if (!this._inflate) {\n    this.emit(\"error\", \"No Inflate block\");\n  } else {\n    // no more data to inflate\n    this._inflate.end();\n  }\n};\n\nParserAsync.prototype._complete = function (filteredData) {\n  if (this.errord) {\n    return;\n  }\n\n  let normalisedBitmapData;\n\n  try {\n    let bitmapData = bitmapper.dataToBitMap(filteredData, this._bitmapInfo);\n\n    normalisedBitmapData = formatNormaliser(bitmapData, this._bitmapInfo);\n    bitmapData = null;\n  } catch (ex) {\n    this._handleError(ex);\n    return;\n  }\n\n  this.emit(\"parsed\", normalisedBitmapData);\n};\n","\"use strict\";\n\nlet constants = require(\"./constants\");\n\nmodule.exports = function (dataIn, width, height, options) {\n  let outHasAlpha =\n    [constants.COLORTYPE_COLOR_ALPHA, constants.COLORTYPE_ALPHA].indexOf(\n      options.colorType\n    ) !== -1;\n  if (options.colorType === options.inputColorType) {\n    let bigEndian = (function () {\n      let buffer = new ArrayBuffer(2);\n      new DataView(buffer).setInt16(0, 256, true /* littleEndian */);\n      // Int16Array uses the platform's endianness.\n      return new Int16Array(buffer)[0] !== 256;\n    })();\n    // If no need to convert to grayscale and alpha is present/absent in both, take a fast route\n    if (options.bitDepth === 8 || (options.bitDepth === 16 && bigEndian)) {\n      return dataIn;\n    }\n  }\n\n  // map to a UInt16 array if data is 16bit, fix endianness below\n  let data = options.bitDepth !== 16 ? dataIn : new Uint16Array(dataIn.buffer);\n\n  let maxValue = 255;\n  let inBpp = constants.COLORTYPE_TO_BPP_MAP[options.inputColorType];\n  if (inBpp === 4 && !options.inputHasAlpha) {\n    inBpp = 3;\n  }\n  let outBpp = constants.COLORTYPE_TO_BPP_MAP[options.colorType];\n  if (options.bitDepth === 16) {\n    maxValue = 65535;\n    outBpp *= 2;\n  }\n  let outData = Buffer.alloc(width * height * outBpp);\n\n  let inIndex = 0;\n  let outIndex = 0;\n\n  let bgColor = options.bgColor || {};\n  if (bgColor.red === undefined) {\n    bgColor.red = maxValue;\n  }\n  if (bgColor.green === undefined) {\n    bgColor.green = maxValue;\n  }\n  if (bgColor.blue === undefined) {\n    bgColor.blue = maxValue;\n  }\n\n  function getRGBA() {\n    let red;\n    let green;\n    let blue;\n    let alpha = maxValue;\n    switch (options.inputColorType) {\n      case constants.COLORTYPE_COLOR_ALPHA:\n        alpha = data[inIndex + 3];\n        red = data[inIndex];\n        green = data[inIndex + 1];\n        blue = data[inIndex + 2];\n        break;\n      case constants.COLORTYPE_COLOR:\n        red = data[inIndex];\n        green = data[inIndex + 1];\n        blue = data[inIndex + 2];\n        break;\n      case constants.COLORTYPE_ALPHA:\n        alpha = data[inIndex + 1];\n        red = data[inIndex];\n        green = red;\n        blue = red;\n        break;\n      case constants.COLORTYPE_GRAYSCALE:\n        red = data[inIndex];\n        green = red;\n        blue = red;\n        break;\n      default:\n        throw new Error(\n          \"input color type:\" +\n            options.inputColorType +\n            \" is not supported at present\"\n        );\n    }\n\n    if (options.inputHasAlpha) {\n      if (!outHasAlpha) {\n        alpha /= maxValue;\n        red = Math.min(\n          Math.max(Math.round((1 - alpha) * bgColor.red + alpha * red), 0),\n          maxValue\n        );\n        green = Math.min(\n          Math.max(Math.round((1 - alpha) * bgColor.green + alpha * green), 0),\n          maxValue\n        );\n        blue = Math.min(\n          Math.max(Math.round((1 - alpha) * bgColor.blue + alpha * blue), 0),\n          maxValue\n        );\n      }\n    }\n    return { red: red, green: green, blue: blue, alpha: alpha };\n  }\n\n  for (let y = 0; y < height; y++) {\n    for (let x = 0; x < width; x++) {\n      let rgba = getRGBA(data, inIndex);\n\n      switch (options.colorType) {\n        case constants.COLORTYPE_COLOR_ALPHA:\n        case constants.COLORTYPE_COLOR:\n          if (options.bitDepth === 8) {\n            outData[outIndex] = rgba.red;\n            outData[outIndex + 1] = rgba.green;\n            outData[outIndex + 2] = rgba.blue;\n            if (outHasAlpha) {\n              outData[outIndex + 3] = rgba.alpha;\n            }\n          } else {\n            outData.writeUInt16BE(rgba.red, outIndex);\n            outData.writeUInt16BE(rgba.green, outIndex + 2);\n            outData.writeUInt16BE(rgba.blue, outIndex + 4);\n            if (outHasAlpha) {\n              outData.writeUInt16BE(rgba.alpha, outIndex + 6);\n            }\n          }\n          break;\n        case constants.COLORTYPE_ALPHA:\n        case constants.COLORTYPE_GRAYSCALE: {\n          // Convert to grayscale and alpha\n          let grayscale = (rgba.red + rgba.green + rgba.blue) / 3;\n          if (options.bitDepth === 8) {\n            outData[outIndex] = grayscale;\n            if (outHasAlpha) {\n              outData[outIndex + 1] = rgba.alpha;\n            }\n          } else {\n            outData.writeUInt16BE(grayscale, outIndex);\n            if (outHasAlpha) {\n              outData.writeUInt16BE(rgba.alpha, outIndex + 2);\n            }\n          }\n          break;\n        }\n        default:\n          throw new Error(\"unrecognised color Type \" + options.colorType);\n      }\n\n      inIndex += inBpp;\n      outIndex += outBpp;\n    }\n  }\n\n  return outData;\n};\n","\"use strict\";\n\nlet paethPredictor = require(\"./paeth-predictor\");\n\nfunction filterNone(pxData, pxPos, byteWidth, rawData, rawPos) {\n  for (let x = 0; x < byteWidth; x++) {\n    rawData[rawPos + x] = pxData[pxPos + x];\n  }\n}\n\nfunction filterSumNone(pxData, pxPos, byteWidth) {\n  let sum = 0;\n  let length = pxPos + byteWidth;\n\n  for (let i = pxPos; i < length; i++) {\n    sum += Math.abs(pxData[i]);\n  }\n  return sum;\n}\n\nfunction filterSub(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let val = pxData[pxPos + x] - left;\n\n    rawData[rawPos + x] = val;\n  }\n}\n\nfunction filterSumSub(pxData, pxPos, byteWidth, bpp) {\n  let sum = 0;\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let val = pxData[pxPos + x] - left;\n\n    sum += Math.abs(val);\n  }\n\n  return sum;\n}\n\nfunction filterUp(pxData, pxPos, byteWidth, rawData, rawPos) {\n  for (let x = 0; x < byteWidth; x++) {\n    let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;\n    let val = pxData[pxPos + x] - up;\n\n    rawData[rawPos + x] = val;\n  }\n}\n\nfunction filterSumUp(pxData, pxPos, byteWidth) {\n  let sum = 0;\n  let length = pxPos + byteWidth;\n  for (let x = pxPos; x < length; x++) {\n    let up = pxPos > 0 ? pxData[x - byteWidth] : 0;\n    let val = pxData[x] - up;\n\n    sum += Math.abs(val);\n  }\n\n  return sum;\n}\n\nfunction filterAvg(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;\n    let val = pxData[pxPos + x] - ((left + up) >> 1);\n\n    rawData[rawPos + x] = val;\n  }\n}\n\nfunction filterSumAvg(pxData, pxPos, byteWidth, bpp) {\n  let sum = 0;\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;\n    let val = pxData[pxPos + x] - ((left + up) >> 1);\n\n    sum += Math.abs(val);\n  }\n\n  return sum;\n}\n\nfunction filterPaeth(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;\n    let upleft =\n      pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;\n    let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);\n\n    rawData[rawPos + x] = val;\n  }\n}\n\nfunction filterSumPaeth(pxData, pxPos, byteWidth, bpp) {\n  let sum = 0;\n  for (let x = 0; x < byteWidth; x++) {\n    let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;\n    let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;\n    let upleft =\n      pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;\n    let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);\n\n    sum += Math.abs(val);\n  }\n\n  return sum;\n}\n\nlet filters = {\n  0: filterNone,\n  1: filterSub,\n  2: filterUp,\n  3: filterAvg,\n  4: filterPaeth,\n};\n\nlet filterSums = {\n  0: filterSumNone,\n  1: filterSumSub,\n  2: filterSumUp,\n  3: filterSumAvg,\n  4: filterSumPaeth,\n};\n\nmodule.exports = function (pxData, width, height, options, bpp) {\n  let filterTypes;\n  if (!(\"filterType\" in options) || options.filterType === -1) {\n    filterTypes = [0, 1, 2, 3, 4];\n  } else if (typeof options.filterType === \"number\") {\n    filterTypes = [options.filterType];\n  } else {\n    throw new Error(\"unrecognised filter types\");\n  }\n\n  if (options.bitDepth === 16) {\n    bpp *= 2;\n  }\n  let byteWidth = width * bpp;\n  let rawPos = 0;\n  let pxPos = 0;\n  let rawData = Buffer.alloc((byteWidth + 1) * height);\n\n  let sel = filterTypes[0];\n\n  for (let y = 0; y < height; y++) {\n    if (filterTypes.length > 1) {\n      // find best filter for this line (with lowest sum of values)\n      let min = Infinity;\n\n      for (let i = 0; i < filterTypes.length; i++) {\n        let sum = filterSums[filterTypes[i]](pxData, pxPos, byteWidth, bpp);\n        if (sum < min) {\n          sel = filterTypes[i];\n          min = sum;\n        }\n      }\n    }\n\n    rawData[rawPos] = sel;\n    rawPos++;\n    filters[sel](pxData, pxPos, byteWidth, rawData, rawPos, bpp);\n    rawPos += byteWidth;\n    pxPos += byteWidth;\n  }\n  return rawData;\n};\n","\"use strict\";\n\nlet constants = require(\"./constants\");\nlet CrcStream = require(\"./crc\");\nlet bitPacker = require(\"./bitpacker\");\nlet filter = require(\"./filter-pack\");\nlet zlib = require(\"zlib\");\n\nlet Packer = (module.exports = function (options) {\n  this._options = options;\n\n  options.deflateChunkSize = options.deflateChunkSize || 32 * 1024;\n  options.deflateLevel =\n    options.deflateLevel != null ? options.deflateLevel : 9;\n  options.deflateStrategy =\n    options.deflateStrategy != null ? options.deflateStrategy : 3;\n  options.inputHasAlpha =\n    options.inputHasAlpha != null ? options.inputHasAlpha : true;\n  options.deflateFactory = options.deflateFactory || zlib.createDeflate;\n  options.bitDepth = options.bitDepth || 8;\n  // This is outputColorType\n  options.colorType =\n    typeof options.colorType === \"number\"\n      ? options.colorType\n      : constants.COLORTYPE_COLOR_ALPHA;\n  options.inputColorType =\n    typeof options.inputColorType === \"number\"\n      ? options.inputColorType\n      : constants.COLORTYPE_COLOR_ALPHA;\n\n  if (\n    [\n      constants.COLORTYPE_GRAYSCALE,\n      constants.COLORTYPE_COLOR,\n      constants.COLORTYPE_COLOR_ALPHA,\n      constants.COLORTYPE_ALPHA,\n    ].indexOf(options.colorType) === -1\n  ) {\n    throw new Error(\n      \"option color type:\" + options.colorType + \" is not supported at present\"\n    );\n  }\n  if (\n    [\n      constants.COLORTYPE_GRAYSCALE,\n      constants.COLORTYPE_COLOR,\n      constants.COLORTYPE_COLOR_ALPHA,\n      constants.COLORTYPE_ALPHA,\n    ].indexOf(options.inputColorType) === -1\n  ) {\n    throw new Error(\n      \"option input color type:\" +\n        options.inputColorType +\n        \" is not supported at present\"\n    );\n  }\n  if (options.bitDepth !== 8 && options.bitDepth !== 16) {\n    throw new Error(\n      \"option bit depth:\" + options.bitDepth + \" is not supported at present\"\n    );\n  }\n});\n\nPacker.prototype.getDeflateOptions = function () {\n  return {\n    chunkSize: this._options.deflateChunkSize,\n    level: this._options.deflateLevel,\n    strategy: this._options.deflateStrategy,\n  };\n};\n\nPacker.prototype.createDeflate = function () {\n  return this._options.deflateFactory(this.getDeflateOptions());\n};\n\nPacker.prototype.filterData = function (data, width, height) {\n  // convert to correct format for filtering (e.g. right bpp and bit depth)\n  let packedData = bitPacker(data, width, height, this._options);\n\n  // filter pixel data\n  let bpp = constants.COLORTYPE_TO_BPP_MAP[this._options.colorType];\n  let filteredData = filter(packedData, width, height, this._options, bpp);\n  return filteredData;\n};\n\nPacker.prototype._packChunk = function (type, data) {\n  let len = data ? data.length : 0;\n  let buf = Buffer.alloc(len + 12);\n\n  buf.writeUInt32BE(len, 0);\n  buf.writeUInt32BE(type, 4);\n\n  if (data) {\n    data.copy(buf, 8);\n  }\n\n  buf.writeInt32BE(\n    CrcStream.crc32(buf.slice(4, buf.length - 4)),\n    buf.length - 4\n  );\n  return buf;\n};\n\nPacker.prototype.packGAMA = function (gamma) {\n  let buf = Buffer.alloc(4);\n  buf.writeUInt32BE(Math.floor(gamma * constants.GAMMA_DIVISION), 0);\n  return this._packChunk(constants.TYPE_gAMA, buf);\n};\n\nPacker.prototype.packIHDR = function (width, height) {\n  let buf = Buffer.alloc(13);\n  buf.writeUInt32BE(width, 0);\n  buf.writeUInt32BE(height, 4);\n  buf[8] = this._options.bitDepth; // Bit depth\n  buf[9] = this._options.colorType; // colorType\n  buf[10] = 0; // compression\n  buf[11] = 0; // filter\n  buf[12] = 0; // interlace\n\n  return this._packChunk(constants.TYPE_IHDR, buf);\n};\n\nPacker.prototype.packIDAT = function (data) {\n  return this._packChunk(constants.TYPE_IDAT, data);\n};\n\nPacker.prototype.packIEND = function () {\n  return this._packChunk(constants.TYPE_IEND, null);\n};\n","\"use strict\";\n\nlet util = require(\"util\");\nlet Stream = require(\"stream\");\nlet constants = require(\"./constants\");\nlet Packer = require(\"./packer\");\n\nlet PackerAsync = (module.exports = function (opt) {\n  Stream.call(this);\n\n  let options = opt || {};\n\n  this._packer = new Packer(options);\n  this._deflate = this._packer.createDeflate();\n\n  this.readable = true;\n});\nutil.inherits(PackerAsync, Stream);\n\nPackerAsync.prototype.pack = function (data, width, height, gamma) {\n  // Signature\n  this.emit(\"data\", Buffer.from(constants.PNG_SIGNATURE));\n  this.emit(\"data\", this._packer.packIHDR(width, height));\n\n  if (gamma) {\n    this.emit(\"data\", this._packer.packGAMA(gamma));\n  }\n\n  let filteredData = this._packer.filterData(data, width, height);\n\n  // compress it\n  this._deflate.on(\"error\", this.emit.bind(this, \"error\"));\n\n  this._deflate.on(\n    \"data\",\n    function (compressedData) {\n      this.emit(\"data\", this._packer.packIDAT(compressedData));\n    }.bind(this)\n  );\n\n  this._deflate.on(\n    \"end\",\n    function () {\n      this.emit(\"data\", this._packer.packIEND());\n      this.emit(\"end\");\n    }.bind(this)\n  );\n\n  this._deflate.end(filteredData);\n};\n","\"use strict\";\n\nlet assert = require(\"assert\").ok;\nlet zlib = require(\"zlib\");\nlet util = require(\"util\");\n\nlet kMaxLength = require(\"buffer\").kMaxLength;\n\nfunction Inflate(opts) {\n  if (!(this instanceof Inflate)) {\n    return new Inflate(opts);\n  }\n\n  if (opts && opts.chunkSize < zlib.Z_MIN_CHUNK) {\n    opts.chunkSize = zlib.Z_MIN_CHUNK;\n  }\n\n  zlib.Inflate.call(this, opts);\n\n  // Node 8 --> 9 compatibility check\n  this._offset = this._offset === undefined ? this._outOffset : this._offset;\n  this._buffer = this._buffer || this._outBuffer;\n\n  if (opts && opts.maxLength != null) {\n    this._maxLength = opts.maxLength;\n  }\n}\n\nfunction createInflate(opts) {\n  return new Inflate(opts);\n}\n\nfunction _close(engine, callback) {\n  if (callback) {\n    process.nextTick(callback);\n  }\n\n  // Caller may invoke .close after a zlib error (which will null _handle).\n  if (!engine._handle) {\n    return;\n  }\n\n  engine._handle.close();\n  engine._handle = null;\n}\n\nInflate.prototype._processChunk = function (chunk, flushFlag, asyncCb) {\n  if (typeof asyncCb === \"function\") {\n    return zlib.Inflate._processChunk.call(this, chunk, flushFlag, asyncCb);\n  }\n\n  let self = this;\n\n  let availInBefore = chunk && chunk.length;\n  let availOutBefore = this._chunkSize - this._offset;\n  let leftToInflate = this._maxLength;\n  let inOff = 0;\n\n  let buffers = [];\n  let nread = 0;\n\n  let error;\n  this.on(\"error\", function (err) {\n    error = err;\n  });\n\n  function handleChunk(availInAfter, availOutAfter) {\n    if (self._hadError) {\n      return;\n    }\n\n    let have = availOutBefore - availOutAfter;\n    assert(have >= 0, \"have should not go down\");\n\n    if (have > 0) {\n      let out = self._buffer.slice(self._offset, self._offset + have);\n      self._offset += have;\n\n      if (out.length > leftToInflate) {\n        out = out.slice(0, leftToInflate);\n      }\n\n      buffers.push(out);\n      nread += out.length;\n      leftToInflate -= out.length;\n\n      if (leftToInflate === 0) {\n        return false;\n      }\n    }\n\n    if (availOutAfter === 0 || self._offset >= self._chunkSize) {\n      availOutBefore = self._chunkSize;\n      self._offset = 0;\n      self._buffer = Buffer.allocUnsafe(self._chunkSize);\n    }\n\n    if (availOutAfter === 0) {\n      inOff += availInBefore - availInAfter;\n      availInBefore = availInAfter;\n\n      return true;\n    }\n\n    return false;\n  }\n\n  assert(this._handle, \"zlib binding closed\");\n  let res;\n  do {\n    res = this._handle.writeSync(\n      flushFlag,\n      chunk, // in\n      inOff, // in_off\n      availInBefore, // in_len\n      this._buffer, // out\n      this._offset, //out_off\n      availOutBefore\n    ); // out_len\n    // Node 8 --> 9 compatibility check\n    res = res || this._writeState;\n  } while (!this._hadError && handleChunk(res[0], res[1]));\n\n  if (this._hadError) {\n    throw error;\n  }\n\n  if (nread >= kMaxLength) {\n    _close(this);\n    throw new RangeError(\n      \"Cannot create final Buffer. It would be larger than 0x\" +\n        kMaxLength.toString(16) +\n        \" bytes\"\n    );\n  }\n\n  let buf = Buffer.concat(buffers, nread);\n  _close(this);\n\n  return buf;\n};\n\nutil.inherits(Inflate, zlib.Inflate);\n\nfunction zlibBufferSync(engine, buffer) {\n  if (typeof buffer === \"string\") {\n    buffer = Buffer.from(buffer);\n  }\n  if (!(buffer instanceof Buffer)) {\n    throw new TypeError(\"Not a string or buffer\");\n  }\n\n  let flushFlag = engine._finishFlushFlag;\n  if (flushFlag == null) {\n    flushFlag = zlib.Z_FINISH;\n  }\n\n  return engine._processChunk(buffer, flushFlag);\n}\n\nfunction inflateSync(buffer, opts) {\n  return zlibBufferSync(new Inflate(opts), buffer);\n}\n\nmodule.exports = exports = inflateSync;\nexports.Inflate = Inflate;\nexports.createInflate = createInflate;\nexports.inflateSync = inflateSync;\n","\"use strict\";\n\nlet SyncReader = (module.exports = function (buffer) {\n  this._buffer = buffer;\n  this._reads = [];\n});\n\nSyncReader.prototype.read = function (length, callback) {\n  this._reads.push({\n    length: Math.abs(length), // if length < 0 then at most this length\n    allowLess: length < 0,\n    func: callback,\n  });\n};\n\nSyncReader.prototype.process = function () {\n  // as long as there is any data and read requests\n  while (this._reads.length > 0 && this._buffer.length) {\n    let read = this._reads[0];\n\n    if (\n      this._buffer.length &&\n      (this._buffer.length >= read.length || read.allowLess)\n    ) {\n      // ok there is any data so that we can satisfy this request\n      this._reads.shift(); // == read\n\n      let buf = this._buffer;\n\n      this._buffer = buf.slice(read.length);\n\n      read.func.call(this, buf.slice(0, read.length));\n    } else {\n      break;\n    }\n  }\n\n  if (this._reads.length > 0) {\n    return new Error(\"There are some read requests waitng on finished stream\");\n  }\n\n  if (this._buffer.length > 0) {\n    return new Error(\"unrecognised content at end of stream\");\n  }\n};\n","\"use strict\";\n\nlet SyncReader = require(\"./sync-reader\");\nlet Filter = require(\"./filter-parse\");\n\nexports.process = function (inBuffer, bitmapInfo) {\n  let outBuffers = [];\n  let reader = new SyncReader(inBuffer);\n  let filter = new Filter(bitmapInfo, {\n    read: reader.read.bind(reader),\n    write: function (bufferPart) {\n      outBuffers.push(bufferPart);\n    },\n    complete: function () {},\n  });\n\n  filter.start();\n  reader.process();\n\n  return Buffer.concat(outBuffers);\n};\n","\"use strict\";\n\nlet hasSyncZlib = true;\nlet zlib = require(\"zlib\");\nlet inflateSync = require(\"./sync-inflate\");\nif (!zlib.deflateSync) {\n  hasSyncZlib = false;\n}\nlet SyncReader = require(\"./sync-reader\");\nlet FilterSync = require(\"./filter-parse-sync\");\nlet Parser = require(\"./parser\");\nlet bitmapper = require(\"./bitmapper\");\nlet formatNormaliser = require(\"./format-normaliser\");\n\nmodule.exports = function (buffer, options) {\n  if (!hasSyncZlib) {\n    throw new Error(\n      \"To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0\"\n    );\n  }\n\n  let err;\n  function handleError(_err_) {\n    err = _err_;\n  }\n\n  let metaData;\n  function handleMetaData(_metaData_) {\n    metaData = _metaData_;\n  }\n\n  function handleTransColor(transColor) {\n    metaData.transColor = transColor;\n  }\n\n  function handlePalette(palette) {\n    metaData.palette = palette;\n  }\n\n  function handleSimpleTransparency() {\n    metaData.alpha = true;\n  }\n\n  let gamma;\n  function handleGamma(_gamma_) {\n    gamma = _gamma_;\n  }\n\n  let inflateDataList = [];\n  function handleInflateData(inflatedData) {\n    inflateDataList.push(inflatedData);\n  }\n\n  let reader = new SyncReader(buffer);\n\n  let parser = new Parser(options, {\n    read: reader.read.bind(reader),\n    error: handleError,\n    metadata: handleMetaData,\n    gamma: handleGamma,\n    palette: handlePalette,\n    transColor: handleTransColor,\n    inflateData: handleInflateData,\n    simpleTransparency: handleSimpleTransparency,\n  });\n\n  parser.start();\n  reader.process();\n\n  if (err) {\n    throw err;\n  }\n\n  //join together the inflate datas\n  let inflateData = Buffer.concat(inflateDataList);\n  inflateDataList.length = 0;\n\n  let inflatedData;\n  if (metaData.interlace) {\n    inflatedData = zlib.inflateSync(inflateData);\n  } else {\n    let rowSize =\n      ((metaData.width * metaData.bpp * metaData.depth + 7) >> 3) + 1;\n    let imageSize = rowSize * metaData.height;\n    inflatedData = inflateSync(inflateData, {\n      chunkSize: imageSize,\n      maxLength: imageSize,\n    });\n  }\n  inflateData = null;\n\n  if (!inflatedData || !inflatedData.length) {\n    throw new Error(\"bad png - invalid inflate data response\");\n  }\n\n  let unfilteredData = FilterSync.process(inflatedData, metaData);\n  inflateData = null;\n\n  let bitmapData = bitmapper.dataToBitMap(unfilteredData, metaData);\n  unfilteredData = null;\n\n  let normalisedBitmapData = formatNormaliser(bitmapData, metaData);\n\n  metaData.data = normalisedBitmapData;\n  metaData.gamma = gamma || 0;\n\n  return metaData;\n};\n","\"use strict\";\n\nlet hasSyncZlib = true;\nlet zlib = require(\"zlib\");\nif (!zlib.deflateSync) {\n  hasSyncZlib = false;\n}\nlet constants = require(\"./constants\");\nlet Packer = require(\"./packer\");\n\nmodule.exports = function (metaData, opt) {\n  if (!hasSyncZlib) {\n    throw new Error(\n      \"To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0\"\n    );\n  }\n\n  let options = opt || {};\n\n  let packer = new Packer(options);\n\n  let chunks = [];\n\n  // Signature\n  chunks.push(Buffer.from(constants.PNG_SIGNATURE));\n\n  // Header\n  chunks.push(packer.packIHDR(metaData.width, metaData.height));\n\n  if (metaData.gamma) {\n    chunks.push(packer.packGAMA(metaData.gamma));\n  }\n\n  let filteredData = packer.filterData(\n    metaData.data,\n    metaData.width,\n    metaData.height\n  );\n\n  // compress it\n  let compressedData = zlib.deflateSync(\n    filteredData,\n    packer.getDeflateOptions()\n  );\n  filteredData = null;\n\n  if (!compressedData || !compressedData.length) {\n    throw new Error(\"bad png - invalid compressed data response\");\n  }\n  chunks.push(packer.packIDAT(compressedData));\n\n  // End\n  chunks.push(packer.packIEND());\n\n  return Buffer.concat(chunks);\n};\n","\"use strict\";\n\nlet parse = require(\"./parser-sync\");\nlet pack = require(\"./packer-sync\");\n\nexports.read = function (buffer, options) {\n  return parse(buffer, options || {});\n};\n\nexports.write = function (png, options) {\n  return pack(png, options);\n};\n","\"use strict\";\n\nlet util = require(\"util\");\nlet Stream = require(\"stream\");\nlet Parser = require(\"./parser-async\");\nlet Packer = require(\"./packer-async\");\nlet PNGSync = require(\"./png-sync\");\n\nlet PNG = (exports.PNG = function (options) {\n  Stream.call(this);\n\n  options = options || {}; // eslint-disable-line no-param-reassign\n\n  // coerce pixel dimensions to integers (also coerces undefined -> 0):\n  this.width = options.width | 0;\n  this.height = options.height | 0;\n\n  this.data =\n    this.width > 0 && this.height > 0\n      ? Buffer.alloc(4 * this.width * this.height)\n      : null;\n\n  if (options.fill && this.data) {\n    this.data.fill(0);\n  }\n\n  this.gamma = 0;\n  this.readable = this.writable = true;\n\n  this._parser = new Parser(options);\n\n  this._parser.on(\"error\", this.emit.bind(this, \"error\"));\n  this._parser.on(\"close\", this._handleClose.bind(this));\n  this._parser.on(\"metadata\", this._metadata.bind(this));\n  this._parser.on(\"gamma\", this._gamma.bind(this));\n  this._parser.on(\n    \"parsed\",\n    function (data) {\n      this.data = data;\n      this.emit(\"parsed\", data);\n    }.bind(this)\n  );\n\n  this._packer = new Packer(options);\n  this._packer.on(\"data\", this.emit.bind(this, \"data\"));\n  this._packer.on(\"end\", this.emit.bind(this, \"end\"));\n  this._parser.on(\"close\", this._handleClose.bind(this));\n  this._packer.on(\"error\", this.emit.bind(this, \"error\"));\n});\nutil.inherits(PNG, Stream);\n\nPNG.sync = PNGSync;\n\nPNG.prototype.pack = function () {\n  if (!this.data || !this.data.length) {\n    this.emit(\"error\", \"No data provided\");\n    return this;\n  }\n\n  process.nextTick(\n    function () {\n      this._packer.pack(this.data, this.width, this.height, this.gamma);\n    }.bind(this)\n  );\n\n  return this;\n};\n\nPNG.prototype.parse = function (data, callback) {\n  if (callback) {\n    let onParsed, onError;\n\n    onParsed = function (parsedData) {\n      this.removeListener(\"error\", onError);\n\n      this.data = parsedData;\n      callback(null, this);\n    }.bind(this);\n\n    onError = function (err) {\n      this.removeListener(\"parsed\", onParsed);\n\n      callback(err, null);\n    }.bind(this);\n\n    this.once(\"parsed\", onParsed);\n    this.once(\"error\", onError);\n  }\n\n  this.end(data);\n  return this;\n};\n\nPNG.prototype.write = function (data) {\n  this._parser.write(data);\n  return true;\n};\n\nPNG.prototype.end = function (data) {\n  this._parser.end(data);\n};\n\nPNG.prototype._metadata = function (metadata) {\n  this.width = metadata.width;\n  this.height = metadata.height;\n\n  this.emit(\"metadata\", metadata);\n};\n\nPNG.prototype._gamma = function (gamma) {\n  this.gamma = gamma;\n};\n\nPNG.prototype._handleClose = function () {\n  if (!this._parser.writable && !this._packer.readable) {\n    this.emit(\"close\");\n  }\n};\n\nPNG.bitblt = function (src, dst, srcX, srcY, width, height, deltaX, deltaY) {\n  // eslint-disable-line max-params\n  // coerce pixel dimensions to integers (also coerces undefined -> 0):\n  /* eslint-disable no-param-reassign */\n  srcX |= 0;\n  srcY |= 0;\n  width |= 0;\n  height |= 0;\n  deltaX |= 0;\n  deltaY |= 0;\n  /* eslint-enable no-param-reassign */\n\n  if (\n    srcX > src.width ||\n    srcY > src.height ||\n    srcX + width > src.width ||\n    srcY + height > src.height\n  ) {\n    throw new Error(\"bitblt reading outside image\");\n  }\n\n  if (\n    deltaX > dst.width ||\n    deltaY > dst.height ||\n    deltaX + width > dst.width ||\n    deltaY + height > dst.height\n  ) {\n    throw new Error(\"bitblt writing outside image\");\n  }\n\n  for (let y = 0; y < height; y++) {\n    src.data.copy(\n      dst.data,\n      ((deltaY + y) * dst.width + deltaX) << 2,\n      ((srcY + y) * src.width + srcX) << 2,\n      ((srcY + y) * src.width + srcX + width) << 2\n    );\n  }\n};\n\nPNG.prototype.bitblt = function (\n  dst,\n  srcX,\n  srcY,\n  width,\n  height,\n  deltaX,\n  deltaY\n) {\n  // eslint-disable-line max-params\n\n  PNG.bitblt(this, dst, srcX, srcY, width, height, deltaX, deltaY);\n  return this;\n};\n\nPNG.adjustGamma = function (src) {\n  if (src.gamma) {\n    for (let y = 0; y < src.height; y++) {\n      for (let x = 0; x < src.width; x++) {\n        let idx = (src.width * y + x) << 2;\n\n        for (let i = 0; i < 3; i++) {\n          let sample = src.data[idx + i] / 255;\n          sample = Math.pow(sample, 1 / 2.2 / src.gamma);\n          src.data[idx + i] = Math.round(sample * 255);\n        }\n      }\n    }\n    src.gamma = 0;\n  }\n};\n\nPNG.prototype.adjustGamma = function () {\n  PNG.adjustGamma(this);\n};\n","var inherits = require('inherits')\nvar EventEmitter = require('events').EventEmitter\n\nmodule.exports = Queue\nmodule.exports.default = Queue\n\nfunction Queue (options) {\n  if (!(this instanceof Queue)) {\n    return new Queue(options)\n  }\n\n  EventEmitter.call(this)\n  options = options || {}\n  this.concurrency = options.concurrency || Infinity\n  this.timeout = options.timeout || 0\n  this.autostart = options.autostart || false\n  this.results = options.results || null\n  this.pending = 0\n  this.session = 0\n  this.running = false\n  this.jobs = []\n  this.timers = {}\n}\ninherits(Queue, EventEmitter)\n\nvar arrayMethods = [\n  'pop',\n  'shift',\n  'indexOf',\n  'lastIndexOf'\n]\n\narrayMethods.forEach(function (method) {\n  Queue.prototype[method] = function () {\n    return Array.prototype[method].apply(this.jobs, arguments)\n  }\n})\n\nQueue.prototype.slice = function (begin, end) {\n  this.jobs = this.jobs.slice(begin, end)\n  return this\n}\n\nQueue.prototype.reverse = function () {\n  this.jobs.reverse()\n  return this\n}\n\nvar arrayAddMethods = [\n  'push',\n  'unshift',\n  'splice'\n]\n\narrayAddMethods.forEach(function (method) {\n  Queue.prototype[method] = function () {\n    var methodResult = Array.prototype[method].apply(this.jobs, arguments)\n    if (this.autostart) {\n      this.start()\n    }\n    return methodResult\n  }\n})\n\nObject.defineProperty(Queue.prototype, 'length', {\n  get: function () {\n    return this.pending + this.jobs.length\n  }\n})\n\nQueue.prototype.start = function (cb) {\n  if (cb) {\n    callOnErrorOrEnd.call(this, cb)\n  }\n\n  this.running = true\n\n  if (this.pending >= this.concurrency) {\n    return\n  }\n\n  if (this.jobs.length === 0) {\n    if (this.pending === 0) {\n      done.call(this)\n    }\n    return\n  }\n\n  var self = this\n  var job = this.jobs.shift()\n  var once = true\n  var session = this.session\n  var timeoutId = null\n  var didTimeout = false\n  var resultIndex = null\n  var timeout = job.hasOwnProperty('timeout') ? job.timeout : this.timeout\n\n  function next (err, result) {\n    if (once && self.session === session) {\n      once = false\n      self.pending--\n      if (timeoutId !== null) {\n        delete self.timers[timeoutId]\n        clearTimeout(timeoutId)\n      }\n\n      if (err) {\n        self.emit('error', err, job)\n      } else if (didTimeout === false) {\n        if (resultIndex !== null) {\n          self.results[resultIndex] = Array.prototype.slice.call(arguments, 1)\n        }\n        self.emit('success', result, job)\n      }\n\n      if (self.session === session) {\n        if (self.pending === 0 && self.jobs.length === 0) {\n          done.call(self)\n        } else if (self.running) {\n          self.start()\n        }\n      }\n    }\n  }\n\n  if (timeout) {\n    timeoutId = setTimeout(function () {\n      didTimeout = true\n      if (self.listeners('timeout').length > 0) {\n        self.emit('timeout', next, job)\n      } else {\n        next()\n      }\n    }, timeout)\n    this.timers[timeoutId] = timeoutId\n  }\n\n  if (this.results) {\n    resultIndex = this.results.length\n    this.results[resultIndex] = null\n  }\n\n  this.pending++\n  self.emit('start', job)\n  var promise = job(next)\n  if (promise && promise.then && typeof promise.then === 'function') {\n    promise.then(function (result) {\n      return next(null, result)\n    }).catch(function (err) {\n      return next(err || true)\n    })\n  }\n\n  if (this.running && this.jobs.length > 0) {\n    this.start()\n  }\n}\n\nQueue.prototype.stop = function () {\n  this.running = false\n}\n\nQueue.prototype.end = function (err) {\n  clearTimers.call(this)\n  this.jobs.length = 0\n  this.pending = 0\n  done.call(this, err)\n}\n\nfunction clearTimers () {\n  for (var key in this.timers) {\n    var timeoutId = this.timers[key]\n    delete this.timers[key]\n    clearTimeout(timeoutId)\n  }\n}\n\nfunction callOnErrorOrEnd (cb) {\n  var self = this\n  this.on('error', onerror)\n  this.on('end', onend)\n\n  function onerror (err) { self.end(err) }\n  function onend (err) {\n    self.removeListener('error', onerror)\n    self.removeListener('end', onend)\n    cb(err, this.results)\n  }\n}\n\nfunction done (err) {\n  this.session++\n  this.running = false\n  this.emit('end', err)\n}\n","import _typeof from \"./typeof.js\";\nexport default function _regeneratorRuntime() {\n  \"use strict\"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */\n  _regeneratorRuntime = function _regeneratorRuntime() {\n    return exports;\n  };\n  var exports = {},\n    Op = Object.prototype,\n    hasOwn = Op.hasOwnProperty,\n    defineProperty = Object.defineProperty || function (obj, key, desc) {\n      obj[key] = desc.value;\n    },\n    $Symbol = \"function\" == typeof Symbol ? Symbol : {},\n    iteratorSymbol = $Symbol.iterator || \"@@iterator\",\n    asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\",\n    toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n  function define(obj, key, value) {\n    return Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: !0,\n      configurable: !0,\n      writable: !0\n    }), obj[key];\n  }\n  try {\n    define({}, \"\");\n  } catch (err) {\n    define = function define(obj, key, value) {\n      return obj[key] = value;\n    };\n  }\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator,\n      generator = Object.create(protoGenerator.prototype),\n      context = new Context(tryLocsList || []);\n    return defineProperty(generator, \"_invoke\", {\n      value: makeInvokeMethod(innerFn, self, context)\n    }), generator;\n  }\n  function tryCatch(fn, obj, arg) {\n    try {\n      return {\n        type: \"normal\",\n        arg: fn.call(obj, arg)\n      };\n    } catch (err) {\n      return {\n        type: \"throw\",\n        arg: err\n      };\n    }\n  }\n  exports.wrap = wrap;\n  var ContinueSentinel = {};\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n  var IteratorPrototype = {};\n  define(IteratorPrototype, iteratorSymbol, function () {\n    return this;\n  });\n  var getProto = Object.getPrototypeOf,\n    NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  NativeIteratorPrototype && NativeIteratorPrototype !== Op && hasOwn.call(NativeIteratorPrototype, iteratorSymbol) && (IteratorPrototype = NativeIteratorPrototype);\n  var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(IteratorPrototype);\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function (method) {\n      define(prototype, method, function (arg) {\n        return this._invoke(method, arg);\n      });\n    });\n  }\n  function AsyncIterator(generator, PromiseImpl) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (\"throw\" !== record.type) {\n        var result = record.arg,\n          value = result.value;\n        return value && \"object\" == _typeof(value) && hasOwn.call(value, \"__await\") ? PromiseImpl.resolve(value.__await).then(function (value) {\n          invoke(\"next\", value, resolve, reject);\n        }, function (err) {\n          invoke(\"throw\", err, resolve, reject);\n        }) : PromiseImpl.resolve(value).then(function (unwrapped) {\n          result.value = unwrapped, resolve(result);\n        }, function (error) {\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n      reject(record.arg);\n    }\n    var previousPromise;\n    defineProperty(this, \"_invoke\", {\n      value: function value(method, arg) {\n        function callInvokeWithMethodAndArg() {\n          return new PromiseImpl(function (resolve, reject) {\n            invoke(method, arg, resolve, reject);\n          });\n        }\n        return previousPromise = previousPromise ? previousPromise.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();\n      }\n    });\n  }\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = \"suspendedStart\";\n    return function (method, arg) {\n      if (\"executing\" === state) throw new Error(\"Generator is already running\");\n      if (\"completed\" === state) {\n        if (\"throw\" === method) throw arg;\n        return doneResult();\n      }\n      for (context.method = method, context.arg = arg;;) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n        if (\"next\" === context.method) context.sent = context._sent = context.arg;else if (\"throw\" === context.method) {\n          if (\"suspendedStart\" === state) throw state = \"completed\", context.arg;\n          context.dispatchException(context.arg);\n        } else \"return\" === context.method && context.abrupt(\"return\", context.arg);\n        state = \"executing\";\n        var record = tryCatch(innerFn, self, context);\n        if (\"normal\" === record.type) {\n          if (state = context.done ? \"completed\" : \"suspendedYield\", record.arg === ContinueSentinel) continue;\n          return {\n            value: record.arg,\n            done: context.done\n          };\n        }\n        \"throw\" === record.type && (state = \"completed\", context.method = \"throw\", context.arg = record.arg);\n      }\n    };\n  }\n  function maybeInvokeDelegate(delegate, context) {\n    var methodName = context.method,\n      method = delegate.iterator[methodName];\n    if (undefined === method) return context.delegate = null, \"throw\" === methodName && delegate.iterator[\"return\"] && (context.method = \"return\", context.arg = undefined, maybeInvokeDelegate(delegate, context), \"throw\" === context.method) || \"return\" !== methodName && (context.method = \"throw\", context.arg = new TypeError(\"The iterator does not provide a '\" + methodName + \"' method\")), ContinueSentinel;\n    var record = tryCatch(method, delegate.iterator, context.arg);\n    if (\"throw\" === record.type) return context.method = \"throw\", context.arg = record.arg, context.delegate = null, ContinueSentinel;\n    var info = record.arg;\n    return info ? info.done ? (context[delegate.resultName] = info.value, context.next = delegate.nextLoc, \"return\" !== context.method && (context.method = \"next\", context.arg = undefined), context.delegate = null, ContinueSentinel) : info : (context.method = \"throw\", context.arg = new TypeError(\"iterator result is not an object\"), context.delegate = null, ContinueSentinel);\n  }\n  function pushTryEntry(locs) {\n    var entry = {\n      tryLoc: locs[0]\n    };\n    1 in locs && (entry.catchLoc = locs[1]), 2 in locs && (entry.finallyLoc = locs[2], entry.afterLoc = locs[3]), this.tryEntries.push(entry);\n  }\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\", delete record.arg, entry.completion = record;\n  }\n  function Context(tryLocsList) {\n    this.tryEntries = [{\n      tryLoc: \"root\"\n    }], tryLocsList.forEach(pushTryEntry, this), this.reset(!0);\n  }\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) return iteratorMethod.call(iterable);\n      if (\"function\" == typeof iterable.next) return iterable;\n      if (!isNaN(iterable.length)) {\n        var i = -1,\n          next = function next() {\n            for (; ++i < iterable.length;) if (hasOwn.call(iterable, i)) return next.value = iterable[i], next.done = !1, next;\n            return next.value = undefined, next.done = !0, next;\n          };\n        return next.next = next;\n      }\n    }\n    return {\n      next: doneResult\n    };\n  }\n  function doneResult() {\n    return {\n      value: undefined,\n      done: !0\n    };\n  }\n  return GeneratorFunction.prototype = GeneratorFunctionPrototype, defineProperty(Gp, \"constructor\", {\n    value: GeneratorFunctionPrototype,\n    configurable: !0\n  }), defineProperty(GeneratorFunctionPrototype, \"constructor\", {\n    value: GeneratorFunction,\n    configurable: !0\n  }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, toStringTagSymbol, \"GeneratorFunction\"), exports.isGeneratorFunction = function (genFun) {\n    var ctor = \"function\" == typeof genFun && genFun.constructor;\n    return !!ctor && (ctor === GeneratorFunction || \"GeneratorFunction\" === (ctor.displayName || ctor.name));\n  }, exports.mark = function (genFun) {\n    return Object.setPrototypeOf ? Object.setPrototypeOf(genFun, GeneratorFunctionPrototype) : (genFun.__proto__ = GeneratorFunctionPrototype, define(genFun, toStringTagSymbol, \"GeneratorFunction\")), genFun.prototype = Object.create(Gp), genFun;\n  }, exports.awrap = function (arg) {\n    return {\n      __await: arg\n    };\n  }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, asyncIteratorSymbol, function () {\n    return this;\n  }), exports.AsyncIterator = AsyncIterator, exports.async = function (innerFn, outerFn, self, tryLocsList, PromiseImpl) {\n    void 0 === PromiseImpl && (PromiseImpl = Promise);\n    var iter = new AsyncIterator(wrap(innerFn, outerFn, self, tryLocsList), PromiseImpl);\n    return exports.isGeneratorFunction(outerFn) ? iter : iter.next().then(function (result) {\n      return result.done ? result.value : iter.next();\n    });\n  }, defineIteratorMethods(Gp), define(Gp, toStringTagSymbol, \"Generator\"), define(Gp, iteratorSymbol, function () {\n    return this;\n  }), define(Gp, \"toString\", function () {\n    return \"[object Generator]\";\n  }), exports.keys = function (val) {\n    var object = Object(val),\n      keys = [];\n    for (var key in object) keys.push(key);\n    return keys.reverse(), function next() {\n      for (; keys.length;) {\n        var key = keys.pop();\n        if (key in object) return next.value = key, next.done = !1, next;\n      }\n      return next.done = !0, next;\n    };\n  }, exports.values = values, Context.prototype = {\n    constructor: Context,\n    reset: function reset(skipTempReset) {\n      if (this.prev = 0, this.next = 0, this.sent = this._sent = undefined, this.done = !1, this.delegate = null, this.method = \"next\", this.arg = undefined, this.tryEntries.forEach(resetTryEntry), !skipTempReset) for (var name in this) \"t\" === name.charAt(0) && hasOwn.call(this, name) && !isNaN(+name.slice(1)) && (this[name] = undefined);\n    },\n    stop: function stop() {\n      this.done = !0;\n      var rootRecord = this.tryEntries[0].completion;\n      if (\"throw\" === rootRecord.type) throw rootRecord.arg;\n      return this.rval;\n    },\n    dispatchException: function dispatchException(exception) {\n      if (this.done) throw exception;\n      var context = this;\n      function handle(loc, caught) {\n        return record.type = \"throw\", record.arg = exception, context.next = loc, caught && (context.method = \"next\", context.arg = undefined), !!caught;\n      }\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i],\n          record = entry.completion;\n        if (\"root\" === entry.tryLoc) return handle(\"end\");\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\"),\n            hasFinally = hasOwn.call(entry, \"finallyLoc\");\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) return handle(entry.catchLoc, !0);\n            if (this.prev < entry.finallyLoc) return handle(entry.finallyLoc);\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) return handle(entry.catchLoc, !0);\n          } else {\n            if (!hasFinally) throw new Error(\"try statement without catch or finally\");\n            if (this.prev < entry.finallyLoc) return handle(entry.finallyLoc);\n          }\n        }\n      }\n    },\n    abrupt: function abrupt(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev && hasOwn.call(entry, \"finallyLoc\") && this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n      finallyEntry && (\"break\" === type || \"continue\" === type) && finallyEntry.tryLoc <= arg && arg <= finallyEntry.finallyLoc && (finallyEntry = null);\n      var record = finallyEntry ? finallyEntry.completion : {};\n      return record.type = type, record.arg = arg, finallyEntry ? (this.method = \"next\", this.next = finallyEntry.finallyLoc, ContinueSentinel) : this.complete(record);\n    },\n    complete: function complete(record, afterLoc) {\n      if (\"throw\" === record.type) throw record.arg;\n      return \"break\" === record.type || \"continue\" === record.type ? this.next = record.arg : \"return\" === record.type ? (this.rval = this.arg = record.arg, this.method = \"return\", this.next = \"end\") : \"normal\" === record.type && afterLoc && (this.next = afterLoc), ContinueSentinel;\n    },\n    finish: function finish(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) return this.complete(entry.completion, entry.afterLoc), resetTryEntry(entry), ContinueSentinel;\n      }\n    },\n    \"catch\": function _catch(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (\"throw\" === record.type) {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n      throw new Error(\"illegal catch attempt\");\n    },\n    delegateYield: function delegateYield(iterable, resultName, nextLoc) {\n      return this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      }, \"next\" === this.method && (this.arg = undefined), ContinueSentinel;\n    }\n  }, exports;\n}","function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {\n  try {\n    var info = gen[key](arg);\n    var value = info.value;\n  } catch (error) {\n    reject(error);\n    return;\n  }\n  if (info.done) {\n    resolve(value);\n  } else {\n    Promise.resolve(value).then(_next, _throw);\n  }\n}\nexport default function _asyncToGenerator(fn) {\n  return function () {\n    var self = this,\n      args = arguments;\n    return new Promise(function (resolve, reject) {\n      var gen = fn.apply(self, args);\n      function _next(value) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"next\", value);\n      }\n      function _throw(err) {\n        asyncGeneratorStep(gen, resolve, reject, _next, _throw, \"throw\", err);\n      }\n      _next(undefined);\n    });\n  };\n}","import unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nexport default function _createForOfIteratorHelperLoose(o, allowArrayLike) {\n  var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n  if (it) return (it = it.call(o)).next.bind(it);\n  if (Array.isArray(o) || (it = unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n    if (it) o = it;\n    var i = 0;\n    return function () {\n      if (i >= o.length) return {\n        done: true\n      };\n      return {\n        done: false,\n        value: o[i++]\n      };\n    };\n  }\n  throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}","/*\nobject-assign\n(c) Sindre Sorhus\n@license MIT\n*/\n\n'use strict';\n/* eslint-disable no-unused-vars */\nvar getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nvar propIsEnumerable = Object.prototype.propertyIsEnumerable;\n\nfunction toObject(val) {\n\tif (val === null || val === undefined) {\n\t\tthrow new TypeError('Object.assign cannot be called with null or undefined');\n\t}\n\n\treturn Object(val);\n}\n\nfunction shouldUseNative() {\n\ttry {\n\t\tif (!Object.assign) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Detect buggy property enumeration order in older V8 versions.\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=4118\n\t\tvar test1 = new String('abc');  // eslint-disable-line no-new-wrappers\n\t\ttest1[5] = 'de';\n\t\tif (Object.getOwnPropertyNames(test1)[0] === '5') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test2 = {};\n\t\tfor (var i = 0; i < 10; i++) {\n\t\t\ttest2['_' + String.fromCharCode(i)] = i;\n\t\t}\n\t\tvar order2 = Object.getOwnPropertyNames(test2).map(function (n) {\n\t\t\treturn test2[n];\n\t\t});\n\t\tif (order2.join('') !== '0123456789') {\n\t\t\treturn false;\n\t\t}\n\n\t\t// https://bugs.chromium.org/p/v8/issues/detail?id=3056\n\t\tvar test3 = {};\n\t\t'abcdefghijklmnopqrst'.split('').forEach(function (letter) {\n\t\t\ttest3[letter] = letter;\n\t\t});\n\t\tif (Object.keys(Object.assign({}, test3)).join('') !==\n\t\t\t\t'abcdefghijklmnopqrst') {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t} catch (err) {\n\t\t// We don't expect any of the above to throw, but better to be safe.\n\t\treturn false;\n\t}\n}\n\nmodule.exports = shouldUseNative() ? Object.assign : function (target, source) {\n\tvar from;\n\tvar to = toObject(target);\n\tvar symbols;\n\n\tfor (var s = 1; s < arguments.length; s++) {\n\t\tfrom = Object(arguments[s]);\n\n\t\tfor (var key in from) {\n\t\t\tif (hasOwnProperty.call(from, key)) {\n\t\t\t\tto[key] = from[key];\n\t\t\t}\n\t\t}\n\n\t\tif (getOwnPropertySymbols) {\n\t\t\tsymbols = getOwnPropertySymbols(from);\n\t\t\tfor (var i = 0; i < symbols.length; i++) {\n\t\t\t\tif (propIsEnumerable.call(from, symbols[i])) {\n\t\t\t\t\tto[symbols[i]] = from[symbols[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn to;\n};\n"],"names":["base64Js","byteLength","toByteArray","fromByteArray","lookup","revLookup","Arr","code","i","len","getLens","b64","validLen","placeHoldersLen","lens","_byteLength","tmp","arr","curByte","tripletToBase64","num","encodeChunk","uint8","start","end","output","extraBytes","parts","maxChunkLength","len2","_extends","target","source","key","_objectWithoutPropertiesLoose","excluded","sourceKeys","_typeof","obj","_classCallCheck","instance","Constructor","_toPrimitive","input","hint","prim","res","_toPropertyKey","arg","toPrimitive","_defineProperties","props","descriptor","toPropertyKey","_createClass","protoProps","staticProps","_assertThisInitialized","self","_setPrototypeOf","o","p","_inherits","subClass","superClass","setPrototypeOf","_possibleConstructorReturn","call","assertThisInitialized","_getPrototypeOf","_defineProperty","value","_arrayWithHoles","_iterableToArray","iter","_arrayLikeToArray","arr2","_unsupportedIterableToArray","minLen","arrayLikeToArray","n","_nonIterableRest","_toArray","arrayWithHoles","iterableToArray","unsupportedIterableToArray","nonIterableRest","_objectWithoutProperties","objectWithoutPropertiesLoose","sourceSymbolKeys","_iterableToArrayLimit","_i","_s","_e","_x","_r","_arr","_n","_d","err","_slicedToArray","iterableToArrayLimit","global","this","__self__","F","exports","support","isDataView","viewClasses","isArrayBufferView","normalizeName","name","normalizeValue","iteratorFor","items","iterator","Headers","headers","header","oldValue","callback","thisArg","consumed","body","fileReaderReady","reader","resolve","reject","readBlobAsArrayBuffer","blob","promise","readBlobAsText","readArrayBufferAsText","buf","view","chars","bufferClone","Body","rejected","decode","methods","normalizeMethod","method","upcased","Request","options","form","bytes","split","parseHeaders","rawHeaders","preProcessedHeaders","line","Response","bodyInit","response","redirectStatuses","url","status","message","error","fetch","init","request","xhr","abortXhr","ctx","module","_inheritsLoose","_interopRequireDefault","R","ReflectApply","receiver","args","ReflectOwnKeys","ProcessEmitWarning","warning","NumberIsNaN","EventEmitter","eventsModule","once","defaultMaxListeners","checkListener","listener","_getMaxListeners","that","type","doError","events","er","handler","listeners","arrayClone","_addListener","prepend","m","existing","w","onceWrapper","_onceWrap","state","wrapped","list","position","originalListener","spliceOne","keys","_listeners","unwrap","evlistener","unwrapListeners","emitter","listenerCount","copy","index","ret","errorListener","resolver","eventTargetAgnosticAddListener","addErrorHandlerIfEventEmitter","flags","wrapListener","inherits_browserModule","ctor","superCtor","TempCtor","ZStream","zstream","TYPED_OK","_has","sources","size","fnTyped","dest","src","src_offs","dest_offs","chunks","l","pos","chunk","result","fnUntyped","on","utils","require$$0","Z_FIXED","Z_BINARY","Z_TEXT","Z_UNKNOWN","zero","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH","MAX_MATCH","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","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","s","send_bits","length","send_code","c","tree","bi_reverse","bi_flush","gen_bitlen","desc","max_code","stree","has_stree","extra","base","h","bits","xbits","f","overflow","gen_codes","bl_count","next_code","tr_static_init","init_block","bi_windup","copy_block","smaller","depth","_n2","_m2","pqdownheap","k","v","j","compress_block","ltree","dtree","lc","lx","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","black_mask","static_init_done","_tr_init","_tr_stored_block","stored_len","last","_tr_align","_tr_flush_block","opt_lenb","static_lenb","_tr_tally","trees","adler32","adler","s1","s2","adler32_1","makeTable","table","crcTable","crc32","crc","t","crc32_1","messages","require$$1","require$$2","require$$3","msg","require$$4","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_OK","Z_STREAM_END","Z_STREAM_ERROR","Z_DATA_ERROR","Z_BUF_ERROR","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_DEFAULT_STRATEGY","Z_DEFLATED","MAX_MEM_LEVEL","MAX_WBITS","DEF_MEM_LEVEL","MIN_LOOKAHEAD","PRESET_DICT","INIT_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","strm","errorCode","flush_pending","flush_block_only","put_byte","b","putShortMSB","read_buf","longest_match","cur_match","chain_length","scan","match","best_len","nice_match","limit","_win","wmask","prev","strend","scan_end1","scan_end","fill_window","_w_size","more","str","deflate_stored","flush","max_block_size","max_start","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","deflateResetKeep","deflateReset","deflateSetHeader","head","deflateInit2","level","windowBits","memLevel","strategy","wrap","deflateInit","deflate","old_flush","beg","val","level_flags","bstate","deflateEnd","deflateSetDictionary","dictionary","dictLength","avail","next","tmpDict","deflate_1","BAD","TYPE","inffast","_in","_out","dmax","wsize","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","from","from_source","top","dolen","dodist","MAXBITS","ENOUGH_LENS","ENOUGH_DISTS","CODES","LENS","DISTS","lbase","lext","dbase","dext","inftrees","lens_index","codes","table_index","work","opts","sym","min","max","root","curr","drop","left","used","huff","incr","fill","low","mask","base_index","offs","extra_index","here_bits","here_op","here_val","inflate_fast","inflate_table","Z_TREES","Z_NEED_DICT","Z_MEM_ERROR","HEAD","FLAGS","TIME","OS","EXLEN","EXTRA","NAME","COMMENT","HCRC","DICTID","DICT","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","MEM","SYNC","DEF_WBITS","zswap32","q","InflateState","inflateResetKeep","inflateReset","inflateReset2","inflateInit2","inflateInit","virgin","lenfix","distfix","fixedtables","updatewindow","inflate","put","have","last_bits","last_op","last_val","hbuf","order","inf_leave","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflate_1","constants","assert","Zstream","zlib_deflate","zlib_inflate","GZIP_HEADER_ID1","GZIP_HEADER_ID2","Zlib","mode","in_off","in_len","out","out_off","out_len","async","avail_out","avail_in","next_expected_header_byte","Buffer","Transform","binding","util","kMaxLength","kRangeErrorMessage","bkeys","bk","bkey","ckeys","ck","ckey","Deflate","Inflate","Gzip","Gunzip","DeflateRaw","InflateRaw","Unzip","buffer","zlibBuffer","zlibBufferSync","engine","buffers","nread","onError","onEnd","flow","flushFlag","isValidFlushFlag","flag","_this","errno","_close","kind","_this2","ws","emitCloseNT","encoding","cb","ending","availInBefore","availOutBefore","inOff","req","availInAfter","availOutAfter","newReq","Stream","ChunkStream","chunkstreamModule","data","dataBuffer","read","smallerBuf","ex","imagePasses","interlace","width","height","images","xLeftOver","yLeftOver","xRepeats","yRepeats","pass","passWidth","passHeight","x","y","outerXLeftOver","outerX","outerYLeftOver","outerY","paethPredictor","above","upLeft","paeth","pLeft","pAbove","pUpLeft","interlaceUtils","getByteWidth","bpp","byteWidth","Filter","filterParseModule","bitmapInfo","dependencies","passes","rawData","unfilteredLine","xComparison","xBiggerThan","rawByte","f1Left","lastLine","f2Up","f3Up","f3Left","f3Add","f4Up","f4Left","f4UpLeft","f4Add","filter","currentImage","FilterAsync","filterParseAsyncModule","currentCrc","CrcCalculator","crcModule","Parser","parserModule","signature","ancillary","fileCrc","calcCrc","colorType","compr","entries","leftOverLength","pixelBppMapper","pxData","pxPos","rawPos","pixel","pixelBppCustomMapper","pixelData","maxBit","bitRetriever","leftOver","byte","byte8","byte7","byte6","byte5","byte4","byte3","byte2","byte1","returner","mapImage8Bit","image","getPxPos","imageWidth","imageHeight","imagePass","mapImageCustomBit","bitmapper","nonInterlacedPxPos","imageIndex","dePalette","indata","outdata","palette","color","replaceTransparentColor","transColor","makeTrans","scaleDepth","maxOutSample","maxInSample","formatNormaliser","imageData","zlib","require$$5","require$$6","ParserAsync","parserAsyncModule","imageSize","chunkSize","leftToInflate","emitError","filterWrite","metaData","filteredData","normalisedBitmapData","bitmapData","bitpacker","dataIn","outHasAlpha","bigEndian","maxValue","inBpp","outBpp","outData","inIndex","outIndex","bgColor","getRGBA","red","green","blue","alpha","rgba","grayscale","filterNone","filterSumNone","sum","filterSub","filterSumSub","filterUp","up","filterSumUp","filterAvg","filterSumAvg","filterPaeth","upleft","filterSumPaeth","filters","filterSums","filterPack","filterTypes","sel","CrcStream","bitPacker","Packer","packerModule","packedData","gamma","PackerAsync","packerAsyncModule","opt","compressedData","createInflate","asyncCb","handleChunk","inflateSync","SyncReader","syncReaderModule","filterParseSync","inBuffer","outBuffers","bufferPart","hasSyncZlib","FilterSync","parserSync","handleError","_err_","handleMetaData","_metaData_","handleTransColor","handlePalette","handleSimpleTransparency","handleGamma","_gamma_","inflateDataList","handleInflateData","inflatedData","inflateData","unfilteredData","packerSync","packer","parse","pack","pngSync","png","PNGSync","PNG","onParsed","parsedData","metadata","dst","srcX","srcY","deltaX","deltaY","idx","sample","inherits","queueModule","Queue","arrayMethods","begin","arrayAddMethods","methodResult","callOnErrorOrEnd","done","job","session","timeoutId","didTimeout","resultIndex","timeout","clearTimers","onerror","onend","_regeneratorRuntime","Op","hasOwn","defineProperty","$Symbol","iteratorSymbol","asyncIteratorSymbol","toStringTagSymbol","define","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","context","Context","makeInvokeMethod","tryCatch","fn","ContinueSentinel","GeneratorFunction","GeneratorFunctionPrototype","IteratorPrototype","getProto","NativeIteratorPrototype","values","Gp","defineIteratorMethods","prototype","AsyncIterator","PromiseImpl","invoke","record","unwrapped","previousPromise","callInvokeWithMethodAndArg","doneResult","delegate","delegateResult","maybeInvokeDelegate","methodName","info","pushTryEntry","locs","entry","resetTryEntry","iterable","iteratorMethod","genFun","object","skipTempReset","rootRecord","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","afterLoc","finallyLoc","tryLoc","thrown","resultName","nextLoc","asyncGeneratorStep","gen","_next","_throw","_asyncToGenerator","_createForOfIteratorHelperLoose","allowArrayLike","it","getOwnPropertySymbols","hasOwnProperty","propIsEnumerable","toObject","shouldUseNative","test1","test2","order2","test3","letter","objectAssign","to","symbols"],"mappings":"ouBAEAA,GAAA,WAAqBC,GACrBD,GAAA,YAAsBE,GACtBF,GAAA,cAAwBG,GAExB,IAAIC,GAAS,CAAE,EACXC,GAAY,CAAE,EACdC,GAAM,OAAO,WAAe,IAAc,WAAa,MAEvDC,GAAO,mEACX,QAASC,GAAI,EAAGC,GAAMF,GAAK,OAAQC,GAAIC,GAAK,EAAED,GAC5CJ,GAAOI,EAAC,EAAID,GAAKC,EAAC,EAClBH,GAAUE,GAAK,WAAWC,EAAC,CAAC,EAAIA,GAKlCH,GAAU,IAAI,WAAW,CAAC,CAAC,EAAI,GAC/BA,GAAU,IAAI,WAAW,CAAC,CAAC,EAAI,GAE/B,SAASK,GAASC,EAAK,CACrB,IAAIF,EAAME,EAAI,OAEd,GAAIF,EAAM,EAAI,EACZ,MAAM,IAAI,MAAM,gDAAgD,EAKlE,IAAIG,EAAWD,EAAI,QAAQ,GAAG,EAC1BC,IAAa,KAAIA,EAAWH,GAEhC,IAAII,EAAkBD,IAAaH,EAC/B,EACA,EAAKG,EAAW,EAEpB,MAAO,CAACA,EAAUC,CAAe,CACnC,CAGA,SAASZ,GAAYU,EAAK,CACxB,IAAIG,EAAOJ,GAAQC,CAAG,EAClBC,EAAWE,EAAK,CAAC,EACjBD,EAAkBC,EAAK,CAAC,EAC5B,OAASF,EAAWC,GAAmB,EAAI,EAAKA,CAClD,CAEA,SAASE,GAAaJ,EAAKC,EAAUC,EAAiB,CACpD,OAASD,EAAWC,GAAmB,EAAI,EAAKA,CAClD,CAEA,SAASX,GAAaS,EAAK,CACzB,IAAIK,EACAF,EAAOJ,GAAQC,CAAG,EAClBC,EAAWE,EAAK,CAAC,EACjBD,EAAkBC,EAAK,CAAC,EAExBG,EAAM,IAAIX,GAAIS,GAAYJ,EAAKC,EAAUC,CAAe,CAAC,EAEzDK,EAAU,EAGVT,EAAMI,EAAkB,EACxBD,EAAW,EACXA,EAEAJ,EACJ,IAAKA,EAAI,EAAGA,EAAIC,EAAKD,GAAK,EACxBQ,EACGX,GAAUM,EAAI,WAAWH,CAAC,CAAC,GAAK,GAChCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,GAAK,GACpCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,GAAK,EACrCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,EACjCS,EAAIC,GAAS,EAAKF,GAAO,GAAM,IAC/BC,EAAIC,GAAS,EAAKF,GAAO,EAAK,IAC9BC,EAAIC,GAAS,EAAIF,EAAM,IAGzB,OAAIH,IAAoB,IACtBG,EACGX,GAAUM,EAAI,WAAWH,CAAC,CAAC,GAAK,EAChCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,GAAK,EACvCS,EAAIC,GAAS,EAAIF,EAAM,KAGrBH,IAAoB,IACtBG,EACGX,GAAUM,EAAI,WAAWH,CAAC,CAAC,GAAK,GAChCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,GAAK,EACpCH,GAAUM,EAAI,WAAWH,EAAI,CAAC,CAAC,GAAK,EACvCS,EAAIC,GAAS,EAAKF,GAAO,EAAK,IAC9BC,EAAIC,GAAS,EAAIF,EAAM,KAGlBC,CACT,CAEA,SAASE,GAAiBC,EAAK,CAC7B,OAAOhB,GAAOgB,GAAO,GAAK,EAAI,EAC5BhB,GAAOgB,GAAO,GAAK,EAAI,EACvBhB,GAAOgB,GAAO,EAAI,EAAI,EACtBhB,GAAOgB,EAAM,EAAI,CACrB,CAEA,SAASC,GAAaC,EAAOC,EAAOC,EAAK,CAGvC,QAFIR,EACAS,EAAS,CAAE,EACNjB,EAAIe,EAAOf,EAAIgB,EAAKhB,GAAK,EAChCQ,GACIM,EAAMd,CAAC,GAAK,GAAM,WAClBc,EAAMd,EAAI,CAAC,GAAK,EAAK,QACtBc,EAAMd,EAAI,CAAC,EAAI,KAClBiB,EAAO,KAAKN,GAAgBH,CAAG,CAAC,EAElC,OAAOS,EAAO,KAAK,EAAE,CACvB,CAEA,SAAStB,GAAemB,EAAO,CAQ7B,QAPIN,EACAP,EAAMa,EAAM,OACZI,EAAajB,EAAM,EACnBkB,EAAQ,CAAE,EACVC,EAAiB,MAGZpB,EAAI,EAAGqB,EAAOpB,EAAMiB,EAAYlB,EAAIqB,EAAMrB,GAAKoB,EACtDD,EAAM,KAAKN,GAAYC,EAAOd,EAAIA,EAAIoB,EAAkBC,EAAOA,EAAQrB,EAAIoB,CAAe,CAAC,EAI7F,OAAIF,IAAe,GACjBV,EAAMM,EAAMb,EAAM,CAAC,EACnBkB,EAAM,KACJvB,GAAOY,GAAO,CAAC,EACfZ,GAAQY,GAAO,EAAK,EAAI,EACxB,IACD,GACQU,IAAe,IACxBV,GAAOM,EAAMb,EAAM,CAAC,GAAK,GAAKa,EAAMb,EAAM,CAAC,EAC3CkB,EAAM,KACJvB,GAAOY,GAAO,EAAE,EAChBZ,GAAQY,GAAO,EAAK,EAAI,EACxBZ,GAAQY,GAAO,EAAK,EAAI,EACxB,GACD,GAGIW,EAAM,KAAK,EAAE,CACtB,CCrJe,SAASG,IAAW,CACjC,OAAAA,GAAW,OAAO,OAAS,OAAO,OAAO,KAAI,EAAK,SAAUC,EAAQ,CAClE,QAASvB,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIwB,EAAS,UAAUxB,CAAC,EACxB,QAASyB,KAAOD,EACV,OAAO,UAAU,eAAe,KAAKA,EAAQC,CAAG,IAClDF,EAAOE,CAAG,EAAID,EAAOC,CAAG,EAG7B,CACD,OAAOF,CACX,EACSD,GAAS,MAAM,KAAM,SAAS,CACvC,CCbe,SAASI,GAA8BF,EAAQG,EAAU,CACtE,GAAIH,GAAU,KAAM,MAAO,GAC3B,IAAID,EAAS,CAAA,EACTK,EAAa,OAAO,KAAKJ,CAAM,EAC/BC,EAAKzB,EACT,IAAKA,EAAI,EAAGA,EAAI4B,EAAW,OAAQ5B,IACjCyB,EAAMG,EAAW5B,CAAC,EACd,EAAA2B,EAAS,QAAQF,CAAG,GAAK,KAC7BF,EAAOE,CAAG,EAAID,EAAOC,CAAG,GAE1B,OAAOF,CACT,CCXe,SAASM,GAAQC,EAAK,CACnC,0BAEA,OAAOD,GAAwB,OAAO,QAArB,YAA2C,OAAO,OAAO,UAA1B,SAAqC,SAAUC,EAAK,CAClG,OAAO,OAAOA,CACf,EAAG,SAAUA,EAAK,CACjB,OAAOA,GAAqB,OAAO,QAArB,YAA+BA,EAAI,cAAgB,QAAUA,IAAQ,OAAO,UAAY,SAAW,OAAOA,CAC5H,EAAKD,GAAQC,CAAG,CAChB,CCRe,SAASC,GAAgBC,EAAUC,EAAa,CAC7D,GAAI,EAAED,aAAoBC,GACxB,MAAM,IAAI,UAAU,mCAAmC,CAE3D,CCHe,SAASC,GAAaC,EAAOC,EAAM,CAChD,GAAIP,GAAQM,CAAK,IAAM,UAAYA,IAAU,KAAM,OAAOA,EAC1D,IAAIE,EAAOF,EAAM,OAAO,WAAW,EACnC,GAAIE,IAAS,OAAW,CACtB,IAAIC,EAAMD,EAAK,KAAKF,EAAOC,GAAQ,SAAS,EAC5C,GAAIP,GAAQS,CAAG,IAAM,SAAU,OAAOA,EACtC,MAAM,IAAI,UAAU,8CAA8C,CACnE,CACD,OAAQF,IAAS,SAAW,OAAS,QAAQD,CAAK,CACpD,CCRe,SAASI,GAAeC,EAAK,CAC1C,IAAIf,EAAMgB,GAAYD,EAAK,QAAQ,EACnC,OAAOX,GAAQJ,CAAG,IAAM,SAAWA,EAAM,OAAOA,CAAG,CACrD,CCJA,SAASiB,GAAkBnB,EAAQoB,EAAO,CACxC,QAAS3C,EAAI,EAAGA,EAAI2C,EAAM,OAAQ3C,IAAK,CACrC,IAAI4C,EAAaD,EAAM3C,CAAC,EACxB4C,EAAW,WAAaA,EAAW,YAAc,GACjDA,EAAW,aAAe,GACtB,UAAWA,IAAYA,EAAW,SAAW,IACjD,OAAO,eAAerB,EAAQsB,GAAcD,EAAW,GAAG,EAAGA,CAAU,CACxE,CACH,CACe,SAASE,GAAab,EAAac,EAAYC,EAAa,CACzE,OAAID,GAAYL,GAAkBT,EAAY,UAAWc,CAAU,EAC/DC,GAAaN,GAAkBT,EAAae,CAAW,EAC3D,OAAO,eAAef,EAAa,YAAa,CAC9C,SAAU,EACd,CAAG,EACMA,CACT,CCjBe,SAASgB,GAAuBC,EAAM,CACnD,GAAIA,IAAS,OACX,MAAM,IAAI,eAAe,2DAA2D,EAEtF,OAAOA,CACT,CCLe,SAASC,GAAgBC,EAAGC,EAAG,CAC5C,OAAAF,GAAkB,OAAO,eAAiB,OAAO,eAAe,KAAI,EAAK,SAAyBC,EAAGC,EAAG,CACtG,OAAAD,EAAE,UAAYC,EACPD,CACX,EACSD,GAAgBC,EAAGC,CAAC,CAC7B,CCLe,SAASC,GAAUC,EAAUC,EAAY,CACtD,GAAI,OAAOA,GAAe,YAAcA,IAAe,KACrD,MAAM,IAAI,UAAU,oDAAoD,EAE1ED,EAAS,UAAY,OAAO,OAAOC,GAAcA,EAAW,UAAW,CACrE,YAAa,CACX,MAAOD,EACP,SAAU,GACV,aAAc,EACf,CACL,CAAG,EACD,OAAO,eAAeA,EAAU,YAAa,CAC3C,SAAU,EACd,CAAG,EACGC,GAAYC,GAAeF,EAAUC,CAAU,CACrD,CCde,SAASE,GAA2BR,EAAMS,EAAM,CAC7D,GAAIA,IAAS9B,GAAQ8B,CAAI,IAAM,UAAY,OAAOA,GAAS,YACzD,OAAOA,EACF,GAAIA,IAAS,OAClB,MAAM,IAAI,UAAU,0DAA0D,EAEhF,OAAOC,GAAsBV,CAAI,CACnC,CCTe,SAASW,GAAgBT,EAAG,CACzC,OAAAS,GAAkB,OAAO,eAAiB,OAAO,eAAe,KAAM,EAAG,SAAyBT,EAAG,CACnG,OAAOA,EAAE,WAAa,OAAO,eAAeA,CAAC,CACjD,EACSS,GAAgBT,CAAC,CAC1B,CCJe,SAASU,GAAgBhC,EAAKL,EAAKsC,EAAO,CACvD,OAAAtC,EAAMoB,GAAcpB,CAAG,EACnBA,KAAOK,EACT,OAAO,eAAeA,EAAKL,EAAK,CAC9B,MAAOsC,EACP,WAAY,GACZ,aAAc,GACd,SAAU,EAChB,CAAK,EAEDjC,EAAIL,CAAG,EAAIsC,EAENjC,CACT,CCde,SAASkC,GAAgBvD,EAAK,CAC3C,GAAI,MAAM,QAAQA,CAAG,EAAG,OAAOA,CACjC,CCFe,SAASwD,GAAiBC,EAAM,CAC7C,GAAI,OAAO,OAAW,KAAeA,EAAK,OAAO,QAAQ,GAAK,MAAQA,EAAK,YAAY,GAAK,KAAM,OAAO,MAAM,KAAKA,CAAI,CAC1H,CCFe,SAASC,GAAkB1D,EAAKR,EAAK,EAC9CA,GAAO,MAAQA,EAAMQ,EAAI,UAAQR,EAAMQ,EAAI,QAC/C,QAAST,EAAI,EAAGoE,EAAO,IAAI,MAAMnE,CAAG,EAAGD,EAAIC,EAAKD,IAAKoE,EAAKpE,CAAC,EAAIS,EAAIT,CAAC,EACpE,OAAOoE,CACT,CCHe,SAASC,GAA4BjB,EAAGkB,EAAQ,CAC7D,GAAKlB,EACL,IAAI,OAAOA,GAAM,SAAU,OAAOmB,GAAiBnB,EAAGkB,CAAM,EAC5D,IAAIE,EAAI,OAAO,UAAU,SAAS,KAAKpB,CAAC,EAAE,MAAM,EAAG,EAAE,EAErD,GADIoB,IAAM,UAAYpB,EAAE,cAAaoB,EAAIpB,EAAE,YAAY,MACnDoB,IAAM,OAASA,IAAM,MAAO,OAAO,MAAM,KAAKpB,CAAC,EACnD,GAAIoB,IAAM,aAAe,2CAA2C,KAAKA,CAAC,EAAG,OAAOD,GAAiBnB,EAAGkB,CAAM,EAChH,CCRe,SAASG,IAAmB,CACzC,MAAM,IAAI,UAAU;AAAA,mFAA2I,CACjK,CCEe,SAASC,GAASjE,EAAK,CACpC,OAAOkE,GAAelE,CAAG,GAAKmE,GAAgBnE,CAAG,GAAKoE,GAA2BpE,CAAG,GAAKqE,IAC3F,CCLe,SAASC,GAAyBvD,EAAQG,EAAU,CACjE,GAAIH,GAAU,KAAM,MAAO,GAC3B,IAAID,EAASyD,GAA6BxD,EAAQG,CAAQ,EACtDF,EAAKzB,EACT,GAAI,OAAO,sBAAuB,CAChC,IAAIiF,EAAmB,OAAO,sBAAsBzD,CAAM,EAC1D,IAAKxB,EAAI,EAAGA,EAAIiF,EAAiB,OAAQjF,IACvCyB,EAAMwD,EAAiBjF,CAAC,EACpB,EAAA2B,EAAS,QAAQF,CAAG,GAAK,IACxB,OAAO,UAAU,qBAAqB,KAAKD,EAAQC,CAAG,IAC3DF,EAAOE,CAAG,EAAID,EAAOC,CAAG,EAE3B,CACD,OAAOF,CACT,CCfe,SAAS2D,GAAsBzE,EAAKT,EAAG,CACpD,IAAImF,EAAa1E,GAAR,KAAc,KAAsB,OAAO,OAAtB,KAAgCA,EAAI,OAAO,QAAQ,GAAKA,EAAI,YAAY,EACtG,GAAY0E,GAAR,KAAY,CACd,IAAIC,EACFC,EACAC,EACAC,EACAC,EAAO,CAAE,EACTC,EAAK,GACLC,EAAK,GACP,GAAI,CACF,GAAIJ,GAAMH,EAAKA,EAAG,KAAK1E,CAAG,GAAG,KAAYT,IAAN,EAAS,CAC1C,GAAI,OAAOmF,CAAE,IAAMA,EAAI,OACvBM,EAAK,EACb,KAAa,MAAO,EAAEA,GAAML,EAAKE,EAAG,KAAKH,CAAE,GAAG,QAAUK,EAAK,KAAKJ,EAAG,KAAK,EAAGI,EAAK,SAAWxF,GAAIyF,EAAK,GAAG,CACpG,OAAQE,EAAK,CACZD,EAAK,GAAIL,EAAKM,CACpB,QAAc,CACR,GAAI,CACF,GAAI,CAACF,GAAcN,EAAG,QAAX,OAAyBI,EAAKJ,EAAG,OAAW,EAAE,OAAOI,CAAE,IAAMA,GAAK,MACrF,QAAgB,CACR,GAAIG,EAAI,MAAML,CACf,CACF,CACD,OAAOG,CACR,CACH,CCtBe,SAASI,GAAenF,EAAKT,EAAG,CAC7C,OAAO2E,GAAelE,CAAG,GAAKoF,GAAqBpF,EAAKT,CAAC,GAAK6E,GAA2BpE,EAAKT,CAAC,GAAK8E,GAAe,CACrH,qECNA,IAAIgB,EAAS,OAAO,KAAS,IAAc,KAAOC,GAC9CC,EAAY,UAAY,CAC5B,SAASC,GAAI,CACb,KAAK,MAAQ,GACb,KAAK,aAAeH,EAAO,YAC1B,CACD,OAAAG,EAAE,UAAYH,EACP,IAAIG,CACX,KACC,SAAS/C,EAAM,EAEE,SAAUgD,EAAS,CAEnC,IAAIC,EAAU,CACZ,aAAc,oBAAqBjD,EACnC,SAAU,WAAYA,GAAQ,aAAc,OAC5C,KACE,eAAgBA,GAChB,SAAUA,GACT,UAAW,CACV,GAAI,CACF,WAAI,KACG,EACR,MAAW,CACV,MAAO,EACR,CACT,EAAU,EACN,SAAU,aAAcA,EACxB,YAAa,gBAAiBA,CAClC,EAEE,SAASkD,EAAWtE,EAAK,CACvB,OAAOA,GAAO,SAAS,UAAU,cAAcA,CAAG,CACnD,CAED,GAAIqE,EAAQ,YACV,IAAIE,EAAc,CAChB,qBACA,sBACA,6BACA,sBACA,uBACA,sBACA,uBACA,wBACA,uBACN,EAEQC,EACF,YAAY,QACZ,SAASxE,EAAK,CACZ,OAAOA,GAAOuE,EAAY,QAAQ,OAAO,UAAU,SAAS,KAAKvE,CAAG,CAAC,EAAI,EACjF,EAGE,SAASyE,EAAcC,EAAM,CAI3B,GAHI,OAAOA,GAAS,WAClBA,EAAO,OAAOA,CAAI,GAEhB,4BAA4B,KAAKA,CAAI,EACvC,MAAM,IAAI,UAAU,wCAAwC,EAE9D,OAAOA,EAAK,YAAa,CAC1B,CAED,SAASC,EAAe1C,EAAO,CAC7B,OAAI,OAAOA,GAAU,WACnBA,EAAQ,OAAOA,CAAK,GAEfA,CACR,CAGD,SAAS2C,EAAYC,EAAO,CAC1B,IAAIC,EAAW,CACb,KAAM,UAAW,CACf,IAAI7C,EAAQ4C,EAAM,QAClB,MAAO,CAAC,KAAM5C,IAAU,OAAW,MAAOA,CAAK,CAChD,CACP,EAEI,OAAIoC,EAAQ,WACVS,EAAS,OAAO,QAAQ,EAAI,UAAW,CACrC,OAAOA,CACf,GAGWA,CACR,CAED,SAASC,EAAQC,EAAS,CACxB,KAAK,IAAM,GAEPA,aAAmBD,EACrBC,EAAQ,QAAQ,SAAS/C,EAAOyC,EAAM,CACpC,KAAK,OAAOA,EAAMzC,CAAK,CACxB,EAAE,IAAI,EACE,MAAM,QAAQ+C,CAAO,EAC9BA,EAAQ,QAAQ,SAASC,EAAQ,CAC/B,KAAK,OAAOA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,CACjC,EAAE,IAAI,EACED,GACT,OAAO,oBAAoBA,CAAO,EAAE,QAAQ,SAASN,EAAM,CACzD,KAAK,OAAOA,EAAMM,EAAQN,CAAI,CAAC,CAChC,EAAE,IAAI,CAEV,CAEDK,EAAQ,UAAU,OAAS,SAASL,EAAMzC,EAAO,CAC/CyC,EAAOD,EAAcC,CAAI,EACzBzC,EAAQ0C,EAAe1C,CAAK,EAC5B,IAAIiD,EAAW,KAAK,IAAIR,CAAI,EAC5B,KAAK,IAAIA,CAAI,EAAIQ,EAAWA,EAAW,KAAOjD,EAAQA,CAC1D,EAEE8C,EAAQ,UAAU,OAAY,SAASL,EAAM,CAC3C,OAAO,KAAK,IAAID,EAAcC,CAAI,CAAC,CACvC,EAEEK,EAAQ,UAAU,IAAM,SAASL,EAAM,CACrC,OAAAA,EAAOD,EAAcC,CAAI,EAClB,KAAK,IAAIA,CAAI,EAAI,KAAK,IAAIA,CAAI,EAAI,IAC7C,EAEEK,EAAQ,UAAU,IAAM,SAASL,EAAM,CACrC,OAAO,KAAK,IAAI,eAAeD,EAAcC,CAAI,CAAC,CACtD,EAEEK,EAAQ,UAAU,IAAM,SAASL,EAAMzC,EAAO,CAC5C,KAAK,IAAIwC,EAAcC,CAAI,CAAC,EAAIC,EAAe1C,CAAK,CACxD,EAEE8C,EAAQ,UAAU,QAAU,SAASI,EAAUC,EAAS,CACtD,QAASV,KAAQ,KAAK,IAChB,KAAK,IAAI,eAAeA,CAAI,GAC9BS,EAAS,KAAKC,EAAS,KAAK,IAAIV,CAAI,EAAGA,EAAM,IAAI,CAGzD,EAEEK,EAAQ,UAAU,KAAO,UAAW,CAClC,IAAIF,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS5C,EAAOyC,EAAM,CACjCG,EAAM,KAAKH,CAAI,CACrB,CAAK,EACME,EAAYC,CAAK,CAC5B,EAEEE,EAAQ,UAAU,OAAS,UAAW,CACpC,IAAIF,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS5C,EAAO,CAC3B4C,EAAM,KAAK5C,CAAK,CACtB,CAAK,EACM2C,EAAYC,CAAK,CAC5B,EAEEE,EAAQ,UAAU,QAAU,UAAW,CACrC,IAAIF,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAS5C,EAAOyC,EAAM,CACjCG,EAAM,KAAK,CAACH,EAAMzC,CAAK,CAAC,CAC9B,CAAK,EACM2C,EAAYC,CAAK,CAC5B,EAEMR,EAAQ,WACVU,EAAQ,UAAU,OAAO,QAAQ,EAAIA,EAAQ,UAAU,SAGzD,SAASM,EAASC,EAAM,CACtB,GAAIA,EAAK,SACP,OAAO,QAAQ,OAAO,IAAI,UAAU,cAAc,CAAC,EAErDA,EAAK,SAAW,EACjB,CAED,SAASC,EAAgBC,EAAQ,CAC/B,OAAO,IAAI,QAAQ,SAASC,EAASC,EAAQ,CAC3CF,EAAO,OAAS,UAAW,CACzBC,EAAQD,EAAO,MAAM,CAC7B,EACMA,EAAO,QAAU,UAAW,CAC1BE,EAAOF,EAAO,KAAK,CAC3B,CACA,CAAK,CACF,CAED,SAASG,EAAsBC,EAAM,CACnC,IAAIJ,EAAS,IAAI,WACbK,EAAUN,EAAgBC,CAAM,EACpC,OAAAA,EAAO,kBAAkBI,CAAI,EACtBC,CACR,CAED,SAASC,EAAeF,EAAM,CAC5B,IAAIJ,EAAS,IAAI,WACbK,EAAUN,EAAgBC,CAAM,EACpC,OAAAA,EAAO,WAAWI,CAAI,EACfC,CACR,CAED,SAASE,EAAsBC,EAAK,CAIlC,QAHIC,EAAO,IAAI,WAAWD,CAAG,EACzBE,EAAQ,IAAI,MAAMD,EAAK,MAAM,EAExB/H,EAAI,EAAGA,EAAI+H,EAAK,OAAQ/H,IAC/BgI,EAAMhI,CAAC,EAAI,OAAO,aAAa+H,EAAK/H,CAAC,CAAC,EAExC,OAAOgI,EAAM,KAAK,EAAE,CACrB,CAED,SAASC,EAAYH,EAAK,CACxB,GAAIA,EAAI,MACN,OAAOA,EAAI,MAAM,CAAC,EAElB,IAAIC,EAAO,IAAI,WAAWD,EAAI,UAAU,EACxC,OAAAC,EAAK,IAAI,IAAI,WAAWD,CAAG,CAAC,EACrBC,EAAK,MAEf,CAED,SAASG,GAAO,CACd,YAAK,SAAW,GAEhB,KAAK,UAAY,SAASd,EAAM,CAC9B,KAAK,UAAYA,EACZA,EAEM,OAAOA,GAAS,SACzB,KAAK,UAAYA,EACRjB,EAAQ,MAAQ,KAAK,UAAU,cAAciB,CAAI,EAC1D,KAAK,UAAYA,EACRjB,EAAQ,UAAY,SAAS,UAAU,cAAciB,CAAI,EAClE,KAAK,cAAgBA,EACZjB,EAAQ,cAAgB,gBAAgB,UAAU,cAAciB,CAAI,EAC7E,KAAK,UAAYA,EAAK,WACbjB,EAAQ,aAAeA,EAAQ,MAAQC,EAAWgB,CAAI,GAC/D,KAAK,iBAAmBa,EAAYb,EAAK,MAAM,EAE/C,KAAK,UAAY,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,GACxCjB,EAAQ,cAAgB,YAAY,UAAU,cAAciB,CAAI,GAAKd,EAAkBc,CAAI,GACpG,KAAK,iBAAmBa,EAAYb,CAAI,EAExC,KAAK,UAAYA,EAAO,OAAO,UAAU,SAAS,KAAKA,CAAI,EAhB3D,KAAK,UAAY,GAmBd,KAAK,QAAQ,IAAI,cAAc,IAC9B,OAAOA,GAAS,SAClB,KAAK,QAAQ,IAAI,eAAgB,0BAA0B,EAClD,KAAK,WAAa,KAAK,UAAU,KAC1C,KAAK,QAAQ,IAAI,eAAgB,KAAK,UAAU,IAAI,EAC3CjB,EAAQ,cAAgB,gBAAgB,UAAU,cAAciB,CAAI,GAC7E,KAAK,QAAQ,IAAI,eAAgB,iDAAiD,EAG5F,EAEQjB,EAAQ,OACV,KAAK,KAAO,UAAW,CACrB,IAAIgC,EAAWhB,EAAS,IAAI,EAC5B,GAAIgB,EACF,OAAOA,EAGT,GAAI,KAAK,UACP,OAAO,QAAQ,QAAQ,KAAK,SAAS,EAChC,GAAI,KAAK,iBACd,OAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,CAAC,EACnD,GAAI,KAAK,cACd,MAAM,IAAI,MAAM,sCAAsC,EAEtD,OAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC,CAE3D,EAEM,KAAK,YAAc,UAAW,CAC5B,OAAI,KAAK,iBACAhB,EAAS,IAAI,GAAK,QAAQ,QAAQ,KAAK,gBAAgB,EAEvD,KAAK,OAAO,KAAKM,CAAqB,CAEvD,GAGI,KAAK,KAAO,UAAW,CACrB,IAAIU,EAAWhB,EAAS,IAAI,EAC5B,GAAIgB,EACF,OAAOA,EAGT,GAAI,KAAK,UACP,OAAOP,EAAe,KAAK,SAAS,EAC/B,GAAI,KAAK,iBACd,OAAO,QAAQ,QAAQC,EAAsB,KAAK,gBAAgB,CAAC,EAC9D,GAAI,KAAK,cACd,MAAM,IAAI,MAAM,sCAAsC,EAEtD,OAAO,QAAQ,QAAQ,KAAK,SAAS,CAE7C,EAEQ1B,EAAQ,WACV,KAAK,SAAW,UAAW,CACzB,OAAO,KAAK,OAAO,KAAKiC,CAAM,CACtC,GAGI,KAAK,KAAO,UAAW,CACrB,OAAO,KAAK,KAAI,EAAG,KAAK,KAAK,KAAK,CACxC,EAEW,IACR,CAGD,IAAIC,EAAU,CAAC,SAAU,MAAO,OAAQ,UAAW,OAAQ,KAAK,EAEhE,SAASC,EAAgBC,EAAQ,CAC/B,IAAIC,EAAUD,EAAO,cACrB,OAAOF,EAAQ,QAAQG,CAAO,EAAI,GAAKA,EAAUD,CAClD,CAED,SAASE,EAAQtG,EAAOuG,EAAS,CAC/BA,EAAUA,GAAW,GACrB,IAAItB,EAAOsB,EAAQ,KAEnB,GAAIvG,aAAiBsG,EAAS,CAC5B,GAAItG,EAAM,SACR,MAAM,IAAI,UAAU,cAAc,EAEpC,KAAK,IAAMA,EAAM,IACjB,KAAK,YAAcA,EAAM,YACpBuG,EAAQ,UACX,KAAK,QAAU,IAAI7B,EAAQ1E,EAAM,OAAO,GAE1C,KAAK,OAASA,EAAM,OACpB,KAAK,KAAOA,EAAM,KAClB,KAAK,OAASA,EAAM,OAChB,CAACiF,GAAQjF,EAAM,WAAa,OAC9BiF,EAAOjF,EAAM,UACbA,EAAM,SAAW,GAEzB,MACM,KAAK,IAAM,OAAOA,CAAK,EAYzB,GATA,KAAK,YAAcuG,EAAQ,aAAe,KAAK,aAAe,eAC1DA,EAAQ,SAAW,CAAC,KAAK,WAC3B,KAAK,QAAU,IAAI7B,EAAQ6B,EAAQ,OAAO,GAE5C,KAAK,OAASJ,EAAgBI,EAAQ,QAAU,KAAK,QAAU,KAAK,EACpE,KAAK,KAAOA,EAAQ,MAAQ,KAAK,MAAQ,KACzC,KAAK,OAASA,EAAQ,QAAU,KAAK,OACrC,KAAK,SAAW,MAEX,KAAK,SAAW,OAAS,KAAK,SAAW,SAAWtB,EACvD,MAAM,IAAI,UAAU,2CAA2C,EAEjE,KAAK,UAAUA,CAAI,CACpB,CAEDqB,EAAQ,UAAU,MAAQ,UAAW,CACnC,OAAO,IAAIA,EAAQ,KAAM,CAAC,KAAM,KAAK,SAAS,CAAC,CACnD,EAEE,SAASL,EAAOhB,EAAM,CACpB,IAAIuB,EAAO,IAAI,SACf,OAAAvB,EACG,KAAM,EACN,MAAM,GAAG,EACT,QAAQ,SAASwB,EAAO,CACvB,GAAIA,EAAO,CACT,IAAIC,EAAQD,EAAM,MAAM,GAAG,EACvBpC,EAAOqC,EAAM,MAAK,EAAG,QAAQ,MAAO,GAAG,EACvC9E,EAAQ8E,EAAM,KAAK,GAAG,EAAE,QAAQ,MAAO,GAAG,EAC9CF,EAAK,OAAO,mBAAmBnC,CAAI,EAAG,mBAAmBzC,CAAK,CAAC,CAChE,CACT,CAAO,EACI4E,CACR,CAED,SAASG,EAAaC,EAAY,CAChC,IAAIjC,EAAU,IAAID,EAGdmC,EAAsBD,EAAW,QAAQ,eAAgB,GAAG,EAChE,OAAAC,EAAoB,MAAM,OAAO,EAAE,QAAQ,SAASC,EAAM,CACxD,IAAI9H,EAAQ8H,EAAK,MAAM,GAAG,EACtBxH,EAAMN,EAAM,MAAO,EAAC,KAAI,EAC5B,GAAIM,EAAK,CACP,IAAIsC,GAAQ5C,EAAM,KAAK,GAAG,EAAE,KAAI,EAChC2F,EAAQ,OAAOrF,EAAKsC,EAAK,CAC1B,CACP,CAAK,EACM+C,CACR,CAEDoB,EAAK,KAAKO,EAAQ,SAAS,EAE3B,SAASS,EAASC,EAAUT,EAAS,CAC9BA,IACHA,EAAU,CAAA,GAGZ,KAAK,KAAO,UACZ,KAAK,OAASA,EAAQ,SAAW,OAAY,IAAMA,EAAQ,OAC3D,KAAK,GAAK,KAAK,QAAU,KAAO,KAAK,OAAS,IAC9C,KAAK,WAAa,eAAgBA,EAAUA,EAAQ,WAAa,KACjE,KAAK,QAAU,IAAI7B,EAAQ6B,EAAQ,OAAO,EAC1C,KAAK,IAAMA,EAAQ,KAAO,GAC1B,KAAK,UAAUS,CAAQ,CACxB,CAEDjB,EAAK,KAAKgB,EAAS,SAAS,EAE5BA,EAAS,UAAU,MAAQ,UAAW,CACpC,OAAO,IAAIA,EAAS,KAAK,UAAW,CAClC,OAAQ,KAAK,OACb,WAAY,KAAK,WACjB,QAAS,IAAIrC,EAAQ,KAAK,OAAO,EACjC,IAAK,KAAK,GAChB,CAAK,CACL,EAEEqC,EAAS,MAAQ,UAAW,CAC1B,IAAIE,EAAW,IAAIF,EAAS,KAAM,CAAC,OAAQ,EAAG,WAAY,EAAE,CAAC,EAC7D,OAAAE,EAAS,KAAO,QACTA,CACX,EAEE,IAAIC,EAAmB,CAAC,IAAK,IAAK,IAAK,IAAK,GAAG,EAE/CH,EAAS,SAAW,SAASI,EAAKC,EAAQ,CACxC,GAAIF,EAAiB,QAAQE,CAAM,IAAM,GACvC,MAAM,IAAI,WAAW,qBAAqB,EAG5C,OAAO,IAAIL,EAAS,KAAM,CAAC,OAAQK,EAAQ,QAAS,CAAC,SAAUD,CAAG,CAAC,CAAC,CACxE,EAEEpD,EAAQ,aAAehD,EAAK,aAC5B,GAAI,CACF,IAAIgD,EAAQ,YACb,MAAa,CACZA,EAAQ,aAAe,SAASsD,EAAShD,EAAM,CAC7C,KAAK,QAAUgD,EACf,KAAK,KAAOhD,EACZ,IAAIiD,EAAQ,MAAMD,CAAO,EACzB,KAAK,MAAQC,EAAM,KACzB,EACIvD,EAAQ,aAAa,UAAY,OAAO,OAAO,MAAM,SAAS,EAC9DA,EAAQ,aAAa,UAAU,YAAcA,EAAQ,YACtD,CAED,SAASwD,EAAMvH,EAAOwH,EAAM,CAC1B,OAAO,IAAI,QAAQ,SAASpC,EAASC,EAAQ,CAC3C,IAAIoC,EAAU,IAAInB,EAAQtG,EAAOwH,CAAI,EAErC,GAAIC,EAAQ,QAAUA,EAAQ,OAAO,QACnC,OAAOpC,EAAO,IAAItB,EAAQ,aAAa,UAAW,YAAY,CAAC,EAGjE,IAAI2D,EAAM,IAAI,eAEd,SAASC,IAAW,CAClBD,EAAI,MAAK,CACV,CAEDA,EAAI,OAAS,UAAW,CACtB,IAAInB,GAAU,CACZ,OAAQmB,EAAI,OACZ,WAAYA,EAAI,WAChB,QAASf,EAAae,EAAI,sBAAqB,GAAM,EAAE,CACjE,EACQnB,GAAQ,IAAM,gBAAiBmB,EAAMA,EAAI,YAAcnB,GAAQ,QAAQ,IAAI,eAAe,EAC1F,IAAItB,GAAO,aAAcyC,EAAMA,EAAI,SAAWA,EAAI,aAClDtC,EAAQ,IAAI2B,EAAS9B,GAAMsB,EAAO,CAAC,CAC3C,EAEMmB,EAAI,QAAU,UAAW,CACvBrC,EAAO,IAAI,UAAU,wBAAwB,CAAC,CACtD,EAEMqC,EAAI,UAAY,UAAW,CACzBrC,EAAO,IAAI,UAAU,wBAAwB,CAAC,CACtD,EAEMqC,EAAI,QAAU,UAAW,CACvBrC,EAAO,IAAItB,EAAQ,aAAa,UAAW,YAAY,CAAC,CAChE,EAEM2D,EAAI,KAAKD,EAAQ,OAAQA,EAAQ,IAAK,EAAI,EAEtCA,EAAQ,cAAgB,UAC1BC,EAAI,gBAAkB,GACbD,EAAQ,cAAgB,SACjCC,EAAI,gBAAkB,IAGpB,iBAAkBA,GAAO1D,EAAQ,OACnC0D,EAAI,aAAe,QAGrBD,EAAQ,QAAQ,QAAQ,SAAS7F,GAAOyC,GAAM,CAC5CqD,EAAI,iBAAiBrD,GAAMzC,EAAK,CACxC,CAAO,EAEG6F,EAAQ,SACVA,EAAQ,OAAO,iBAAiB,QAASE,EAAQ,EAEjDD,EAAI,mBAAqB,UAAW,CAE9BA,EAAI,aAAe,GACrBD,EAAQ,OAAO,oBAAoB,QAASE,EAAQ,CAEhE,GAGMD,EAAI,KAAK,OAAOD,EAAQ,UAAc,IAAc,KAAOA,EAAQ,SAAS,CAClF,CAAK,CACF,CAED,OAAAF,EAAM,SAAW,GAEZxG,EAAK,QACRA,EAAK,MAAQwG,EACbxG,EAAK,QAAU2D,EACf3D,EAAK,QAAUuF,EACfvF,EAAK,SAAWgG,GAGlBhD,EAAQ,QAAUW,EAClBX,EAAQ,QAAUuC,EAClBvC,EAAQ,SAAWgD,EACnBhD,EAAQ,MAAQwD,EAEhB,OAAO,eAAexD,EAAS,aAAc,CAAE,MAAO,EAAI,CAAE,EAErDA,CAER,GAAE,EAAE,CACJ,GAAEF,CAAQ,EACXA,EAAS,MAAM,SAAW,GAE1B,OAAOA,EAAS,MAAM,SAGtB,IAAI+D,EAAM/D,EACVE,EAAU6D,EAAI,MACd7D,EAAkB,QAAA6D,EAAI,MACtB7D,EAAgB,MAAA6D,EAAI,MACpB7D,EAAkB,QAAA6D,EAAI,QACtB7D,EAAkB,QAAA6D,EAAI,QACtB7D,EAAmB,SAAA6D,EAAI,SACvBC,EAAiB,QAAA9D,8BCxiBF,SAAS+D,GAAe1G,EAAUC,EAAY,CAC3DD,EAAS,UAAY,OAAO,OAAOC,EAAW,SAAS,EACvDD,EAAS,UAAU,YAAcA,EACjCE,GAAeF,EAAUC,CAAU,CACrC,kCCLA,SAAS0G,EAAuBpI,EAAK,CACnC,OAAOA,GAAOA,EAAI,WAAaA,EAAM,CACnC,QAAWA,CACf,CACC,CACDkI,EAAA,QAAiBE,EAAwBF,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,8FCkB9G,IAAIG,EAAI,OAAO,SAAY,SAAW,QAAU,KAC5CC,EAAeD,GAAK,OAAOA,EAAE,OAAU,WACvCA,EAAE,MACF,SAAsB5I,EAAQ8I,EAAUC,EAAM,CAC9C,OAAO,SAAS,UAAU,MAAM,KAAK/I,EAAQ8I,EAAUC,CAAI,CAC5D,EAECC,EACAJ,GAAK,OAAOA,EAAE,SAAY,WAC5BI,EAAiBJ,EAAE,QACV,OAAO,sBAChBI,EAAiB,SAAwBhJ,EAAQ,CAC/C,OAAO,OAAO,oBAAoBA,CAAM,EACrC,OAAO,OAAO,sBAAsBA,CAAM,CAAC,CAClD,EAEEgJ,EAAiB,SAAwBhJ,EAAQ,CAC/C,OAAO,OAAO,oBAAoBA,CAAM,CAC5C,EAGA,SAASiJ,EAAmBC,EAAS,CAC/B,SAAW,QAAQ,MAAM,QAAQ,KAAKA,CAAO,CAClD,CAED,IAAIC,EAAc,OAAO,OAAS,SAAqB3G,EAAO,CAC5D,OAAOA,IAAUA,CAClB,EAED,SAAS4G,GAAe,CACtBA,EAAa,KAAK,KAAK,IAAI,CAC5B,CACaC,GAAA,QAAGD,EACEC,GAAA,QAAA,KAAGC,EAGtBF,EAAa,aAAeA,EAE5BA,EAAa,UAAU,QAAU,OACjCA,EAAa,UAAU,aAAe,EACtCA,EAAa,UAAU,cAAgB,OAIvC,IAAIG,EAAsB,GAE1B,SAASC,EAAcC,EAAU,CAC/B,GAAI,OAAOA,GAAa,WACtB,MAAM,IAAI,UAAU,mEAAqE,OAAOA,CAAQ,CAE3G,CAED,OAAO,eAAeL,EAAc,sBAAuB,CACzD,WAAY,GACZ,IAAK,UAAW,CACd,OAAOG,CACR,EACD,IAAK,SAAStI,EAAK,CACjB,GAAI,OAAOA,GAAQ,UAAYA,EAAM,GAAKkI,EAAYlI,CAAG,EACvD,MAAM,IAAI,WAAW,kGAAoGA,EAAM,GAAG,EAEpIsI,EAAsBtI,CACvB,CACH,CAAC,EAEDmI,EAAa,KAAO,UAAW,EAEzB,KAAK,UAAY,QACjB,KAAK,UAAY,OAAO,eAAe,IAAI,EAAE,WAC/C,KAAK,QAAU,OAAO,OAAO,IAAI,EACjC,KAAK,aAAe,GAGtB,KAAK,cAAgB,KAAK,eAAiB,MAC7C,EAIAA,EAAa,UAAU,gBAAkB,SAAyBnG,EAAG,CACnE,GAAI,OAAOA,GAAM,UAAYA,EAAI,GAAKkG,EAAYlG,CAAC,EACjD,MAAM,IAAI,WAAW,gFAAkFA,EAAI,GAAG,EAEhH,YAAK,cAAgBA,EACd,IACT,EAEA,SAASyG,EAAiBC,EAAM,CAC9B,OAAIA,EAAK,gBAAkB,OAClBP,EAAa,oBACfO,EAAK,aACb,CAEDP,EAAa,UAAU,gBAAkB,UAA2B,CAClE,OAAOM,EAAiB,IAAI,CAC9B,EAEAN,EAAa,UAAU,KAAO,SAAcQ,EAAM,CAEhD,QADIb,EAAO,CAAA,EACFtK,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAKsK,EAAK,KAAK,UAAUtK,CAAC,CAAC,EACjE,IAAIoL,EAAWD,IAAS,QAEpBE,EAAS,KAAK,QAClB,GAAIA,IAAW,OACbD,EAAWA,GAAWC,EAAO,QAAU,eAChC,CAACD,EACR,MAAO,GAGT,GAAIA,EAAS,CACX,IAAIE,EAGJ,GAFIhB,EAAK,OAAS,IAChBgB,EAAKhB,EAAK,CAAC,GACTgB,aAAc,MAGhB,MAAMA,EAGR,IAAI3F,EAAM,IAAI,MAAM,oBAAsB2F,EAAK,KAAOA,EAAG,QAAU,IAAM,GAAG,EAC5E,MAAA3F,EAAI,QAAU2F,EACR3F,CACP,CAED,IAAI4F,EAAUF,EAAOF,CAAI,EAEzB,GAAII,IAAY,OACd,MAAO,GAET,GAAI,OAAOA,GAAY,WACrBnB,EAAamB,EAAS,KAAMjB,CAAI,MAIhC,SAFIrK,EAAMsL,EAAQ,OACdC,EAAYC,EAAWF,EAAStL,CAAG,EAC9BD,EAAI,EAAGA,EAAIC,EAAK,EAAED,EACzBoK,EAAaoB,EAAUxL,CAAC,EAAG,KAAMsK,CAAI,EAGzC,MAAO,EACT,EAEA,SAASoB,EAAanK,EAAQ4J,EAAMH,EAAUW,EAAS,CACrD,IAAIC,EACAP,EACAQ,EAsBJ,GApBAd,EAAcC,CAAQ,EAEtBK,EAAS9J,EAAO,QACZ8J,IAAW,QACbA,EAAS9J,EAAO,QAAU,OAAO,OAAO,IAAI,EAC5CA,EAAO,aAAe,IAIlB8J,EAAO,cAAgB,SACzB9J,EAAO,KAAK,cAAe4J,EACfH,EAAS,SAAWA,EAAS,SAAWA,CAAQ,EAI5DK,EAAS9J,EAAO,SAElBsK,EAAWR,EAAOF,CAAI,GAGpBU,IAAa,OAEfA,EAAWR,EAAOF,CAAI,EAAIH,EAC1B,EAAEzJ,EAAO,qBAEL,OAAOsK,GAAa,WAEtBA,EAAWR,EAAOF,CAAI,EACpBQ,EAAU,CAACX,EAAUa,CAAQ,EAAI,CAACA,EAAUb,CAAQ,EAE7CW,EACTE,EAAS,QAAQb,CAAQ,EAEzBa,EAAS,KAAKb,CAAQ,EAIxBY,EAAIX,EAAiB1J,CAAM,EACvBqK,EAAI,GAAKC,EAAS,OAASD,GAAK,CAACC,EAAS,OAAQ,CACpDA,EAAS,OAAS,GAGlB,IAAIC,EAAI,IAAI,MAAM,+CACED,EAAS,OAAS,IAAM,OAAOV,CAAI,EAAI,mEAEvB,EACpCW,EAAE,KAAO,8BACTA,EAAE,QAAUvK,EACZuK,EAAE,KAAOX,EACTW,EAAE,MAAQD,EAAS,OACnBrB,EAAmBsB,CAAC,CACrB,CAGH,OAAOvK,CACR,CAEDoJ,EAAa,UAAU,YAAc,SAAqBQ,EAAMH,EAAU,CACxE,OAAOU,EAAa,KAAMP,EAAMH,EAAU,EAAK,CACjD,EAEAL,EAAa,UAAU,GAAKA,EAAa,UAAU,YAEnDA,EAAa,UAAU,gBACnB,SAAyBQ,EAAMH,EAAU,CACvC,OAAOU,EAAa,KAAMP,EAAMH,EAAU,EAAI,CACpD,EAEA,SAASe,GAAc,CACrB,GAAI,CAAC,KAAK,MAGR,OAFA,KAAK,OAAO,eAAe,KAAK,KAAM,KAAK,MAAM,EACjD,KAAK,MAAQ,GACT,UAAU,SAAW,EAChB,KAAK,SAAS,KAAK,KAAK,MAAM,EAChC,KAAK,SAAS,MAAM,KAAK,OAAQ,SAAS,CAEpD,CAED,SAASC,EAAUzK,EAAQ4J,EAAMH,EAAU,CACzC,IAAIiB,EAAQ,CAAE,MAAO,GAAO,OAAQ,OAAW,OAAQ1K,EAAQ,KAAM4J,EAAM,SAAUH,CAAQ,EACzFkB,EAAUH,EAAY,KAAKE,CAAK,EACpC,OAAAC,EAAQ,SAAWlB,EACnBiB,EAAM,OAASC,EACRA,CACR,CAEDvB,EAAa,UAAU,KAAO,SAAcQ,EAAMH,EAAU,CAC1D,OAAAD,EAAcC,CAAQ,EACtB,KAAK,GAAGG,EAAMa,EAAU,KAAMb,EAAMH,CAAQ,CAAC,EACtC,IACT,EAEAL,EAAa,UAAU,oBACnB,SAA6BQ,EAAMH,EAAU,CAC3C,OAAAD,EAAcC,CAAQ,EACtB,KAAK,gBAAgBG,EAAMa,EAAU,KAAMb,EAAMH,CAAQ,CAAC,EACnD,IACb,EAGAL,EAAa,UAAU,eACnB,SAAwBQ,EAAMH,EAAU,CACtC,IAAImB,EAAMd,EAAQe,EAAUpM,EAAGqM,EAK/B,GAHAtB,EAAcC,CAAQ,EAEtBK,EAAS,KAAK,QACVA,IAAW,OACb,OAAO,KAGT,GADAc,EAAOd,EAAOF,CAAI,EACdgB,IAAS,OACX,OAAO,KAET,GAAIA,IAASnB,GAAYmB,EAAK,WAAanB,EACrC,EAAE,KAAK,eAAiB,EAC1B,KAAK,QAAU,OAAO,OAAO,IAAI,GAEjC,OAAOK,EAAOF,CAAI,EACdE,EAAO,gBACT,KAAK,KAAK,iBAAkBF,EAAMgB,EAAK,UAAYnB,CAAQ,WAEtD,OAAOmB,GAAS,WAAY,CAGrC,IAFAC,EAAW,GAENpM,EAAImM,EAAK,OAAS,EAAGnM,GAAK,EAAGA,IAChC,GAAImM,EAAKnM,CAAC,IAAMgL,GAAYmB,EAAKnM,CAAC,EAAE,WAAagL,EAAU,CACzDqB,EAAmBF,EAAKnM,CAAC,EAAE,SAC3BoM,EAAWpM,EACX,KACD,CAGH,GAAIoM,EAAW,EACb,OAAO,KAELA,IAAa,EACfD,EAAK,MAAK,EAEVG,EAAUH,EAAMC,CAAQ,EAGtBD,EAAK,SAAW,IAClBd,EAAOF,CAAI,EAAIgB,EAAK,CAAC,GAEnBd,EAAO,iBAAmB,QAC5B,KAAK,KAAK,iBAAkBF,EAAMkB,GAAoBrB,CAAQ,CACjE,CAED,OAAO,IACb,EAEAL,EAAa,UAAU,IAAMA,EAAa,UAAU,eAEpDA,EAAa,UAAU,mBACnB,SAA4BQ,EAAM,CAChC,IAAIK,EAAWH,EAAQrL,EAGvB,GADAqL,EAAS,KAAK,QACVA,IAAW,OACb,OAAO,KAGT,GAAIA,EAAO,iBAAmB,OAC5B,OAAI,UAAU,SAAW,GACvB,KAAK,QAAU,OAAO,OAAO,IAAI,EACjC,KAAK,aAAe,GACXA,EAAOF,CAAI,IAAM,SACtB,EAAE,KAAK,eAAiB,EAC1B,KAAK,QAAU,OAAO,OAAO,IAAI,EAEjC,OAAOE,EAAOF,CAAI,GAEf,KAIT,GAAI,UAAU,SAAW,EAAG,CAC1B,IAAIoB,EAAO,OAAO,KAAKlB,CAAM,EACzB5J,EACJ,IAAKzB,EAAI,EAAGA,EAAIuM,EAAK,OAAQ,EAAEvM,EAC7ByB,EAAM8K,EAAKvM,CAAC,EACRyB,IAAQ,kBACZ,KAAK,mBAAmBA,CAAG,EAE7B,YAAK,mBAAmB,gBAAgB,EACxC,KAAK,QAAU,OAAO,OAAO,IAAI,EACjC,KAAK,aAAe,EACb,IACR,CAID,GAFA+J,EAAYH,EAAOF,CAAI,EAEnB,OAAOK,GAAc,WACvB,KAAK,eAAeL,EAAMK,CAAS,UAC1BA,IAAc,OAEvB,IAAKxL,EAAIwL,EAAU,OAAS,EAAGxL,GAAK,EAAGA,IACrC,KAAK,eAAemL,EAAMK,EAAUxL,CAAC,CAAC,EAI1C,OAAO,IACb,EAEA,SAASwM,EAAWjL,EAAQ4J,EAAMsB,EAAQ,CACxC,IAAIpB,EAAS9J,EAAO,QAEpB,GAAI8J,IAAW,OACb,MAAO,GAET,IAAIqB,EAAarB,EAAOF,CAAI,EAC5B,OAAIuB,IAAe,OACV,GAEL,OAAOA,GAAe,WACjBD,EAAS,CAACC,EAAW,UAAYA,CAAU,EAAI,CAACA,CAAU,EAE5DD,EACLE,EAAgBD,CAAU,EAAIjB,EAAWiB,EAAYA,EAAW,MAAM,CACzE,CAED/B,EAAa,UAAU,UAAY,SAAmBQ,EAAM,CAC1D,OAAOqB,EAAW,KAAMrB,EAAM,EAAI,CACpC,EAEAR,EAAa,UAAU,aAAe,SAAsBQ,EAAM,CAChE,OAAOqB,EAAW,KAAMrB,EAAM,EAAK,CACrC,EAEAR,EAAa,cAAgB,SAASiC,EAASzB,EAAM,CACnD,OAAI,OAAOyB,EAAQ,eAAkB,WAC5BA,EAAQ,cAAczB,CAAI,EAE1B0B,EAAc,KAAKD,EAASzB,CAAI,CAE3C,EAEAR,EAAa,UAAU,cAAgBkC,EACvC,SAASA,EAAc1B,EAAM,CAC3B,IAAIE,EAAS,KAAK,QAElB,GAAIA,IAAW,OAAW,CACxB,IAAIqB,EAAarB,EAAOF,CAAI,EAE5B,GAAI,OAAOuB,GAAe,WACxB,MAAO,GACF,GAAIA,IAAe,OACxB,OAAOA,EAAW,MAErB,CAED,MAAO,EACR,CAED/B,EAAa,UAAU,WAAa,UAAsB,CACxD,OAAO,KAAK,aAAe,EAAIJ,EAAe,KAAK,OAAO,EAAI,EAChE,EAEA,SAASkB,EAAWhL,EAAK+D,EAAG,CAE1B,QADIsI,EAAO,IAAI,MAAMtI,CAAC,EACbxE,EAAI,EAAGA,EAAIwE,EAAG,EAAExE,EACvB8M,EAAK9M,CAAC,EAAIS,EAAIT,CAAC,EACjB,OAAO8M,CACR,CAED,SAASR,EAAUH,EAAMY,EAAO,CAC9B,KAAOA,EAAQ,EAAIZ,EAAK,OAAQY,IAC9BZ,EAAKY,CAAK,EAAIZ,EAAKY,EAAQ,CAAC,EAC9BZ,EAAK,IAAG,CACT,CAED,SAASQ,EAAgBlM,EAAK,CAE5B,QADIuM,EAAM,IAAI,MAAMvM,EAAI,MAAM,EACrBT,EAAI,EAAGA,EAAIgN,EAAI,OAAQ,EAAEhN,EAChCgN,EAAIhN,CAAC,EAAIS,EAAIT,CAAC,EAAE,UAAYS,EAAIT,CAAC,EAEnC,OAAOgN,CACR,CAED,SAASnC,EAAK+B,EAASpG,EAAM,CAC3B,OAAO,IAAI,QAAQ,SAAUe,EAASC,EAAQ,CAC5C,SAASyF,EAActH,EAAK,CAC1BiH,EAAQ,eAAepG,EAAM0G,CAAQ,EACrC1F,EAAO7B,CAAG,CACX,CAED,SAASuH,GAAW,CACd,OAAON,EAAQ,gBAAmB,YACpCA,EAAQ,eAAe,QAASK,CAAa,EAE/C1F,EAAQ,CAAA,EAAG,MAAM,KAAK,SAAS,CAAC,CAEtC,CACI4F,EAA+BP,EAASpG,EAAM0G,EAAU,CAAE,KAAM,EAAI,CAAE,EAClE1G,IAAS,SACX4G,EAA8BR,EAASK,EAAe,CAAE,KAAM,EAAM,CAAA,CAE1E,CAAG,CACF,CAED,SAASG,EAA8BR,EAASrB,EAAS8B,EAAO,CAC1D,OAAOT,EAAQ,IAAO,YACxBO,EAA+BP,EAAS,QAASrB,EAAS8B,CAAK,CAElE,CAED,SAASF,EAA+BP,EAASpG,EAAMwE,EAAUqC,EAAO,CACtE,GAAI,OAAOT,EAAQ,IAAO,WACpBS,EAAM,KACRT,EAAQ,KAAKpG,EAAMwE,CAAQ,EAE3B4B,EAAQ,GAAGpG,EAAMwE,CAAQ,UAElB,OAAO4B,EAAQ,kBAAqB,WAG7CA,EAAQ,iBAAiBpG,EAAM,SAAS8G,EAAa9K,EAAK,CAGpD6K,EAAM,MACRT,EAAQ,oBAAoBpG,EAAM8G,CAAY,EAEhDtC,EAASxI,CAAG,CAClB,CAAK,MAED,OAAM,IAAI,UAAU,sEAAwE,OAAOoK,CAAO,CAE9G,yEChfI,OAAO,OAAO,QAAW,WAE3BW,GAAA,QAAiB,SAAkBC,EAAMC,EAAW,CAC9CA,IACFD,EAAK,OAASC,EACdD,EAAK,UAAY,OAAO,OAAOC,EAAU,UAAW,CAClD,YAAa,CACX,MAAOD,EACP,WAAY,GACZ,SAAU,GACV,aAAc,EACf,CACT,CAAO,EAEP,EAGED,GAAA,QAAiB,SAAkBC,EAAMC,EAAW,CAClD,GAAIA,EAAW,CACbD,EAAK,OAASC,EACd,IAAIC,EAAW,UAAY,CAAE,EAC7BA,EAAS,UAAYD,EAAU,UAC/BD,EAAK,UAAY,IAAIE,EACrBF,EAAK,UAAU,YAAcA,CAC9B,CACF,6FCJH,SAASG,GAAU,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,CACd,CAED,OAAAC,GAAiBD,mEC3CjB,IAAIE,EAAa,OAAO,WAAe,KACtB,OAAO,YAAgB,KACvB,OAAO,WAAe,IAEvC,SAASC,EAAKhM,EAAKL,EAAK,CACtB,OAAO,OAAO,UAAU,eAAe,KAAKK,EAAKL,CAAG,CACrD,CAEDyE,EAAiB,OAAA,SAAUpE,EAAkC,CAE3D,QADIiM,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EAC9CA,EAAQ,QAAQ,CACrB,IAAIvM,EAASuM,EAAQ,QACrB,GAAKvM,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,QAAS6B,KAAK7B,EACRsM,EAAKtM,EAAQ6B,CAAC,IAChBvB,EAAIuB,CAAC,EAAI7B,EAAO6B,CAAC,GAGtB,CAED,OAAOvB,CACT,EAIAoE,EAAA,UAAoB,SAAU4B,EAAKkG,EAAM,CACvC,OAAIlG,EAAI,SAAWkG,EAAelG,EAC9BA,EAAI,SAAmBA,EAAI,SAAS,EAAGkG,CAAI,GAC/ClG,EAAI,OAASkG,EACNlG,EACT,EAGA,IAAImG,EAAU,CACZ,SAAU,SAAUC,EAAMC,EAAKC,EAAUnO,EAAKoO,EAAW,CACvD,GAAIF,EAAI,UAAYD,EAAK,SAAU,CACjCA,EAAK,IAAIC,EAAI,SAASC,EAAUA,EAAWnO,CAAG,EAAGoO,CAAS,EAC1D,MACD,CAED,QAASrO,EAAI,EAAGA,EAAIC,EAAKD,IACvBkO,EAAKG,EAAYrO,CAAC,EAAImO,EAAIC,EAAWpO,CAAC,CAEzC,EAED,cAAe,SAAUsO,EAAQ,CAC/B,IAAItO,EAAGuO,EAAGtO,EAAKuO,EAAKC,EAAOC,EAI3B,IADAzO,EAAM,EACDD,EAAI,EAAGuO,EAAID,EAAO,OAAQtO,EAAIuO,EAAGvO,IACpCC,GAAOqO,EAAOtO,CAAC,EAAE,OAMnB,IAFA0O,EAAS,IAAI,WAAWzO,CAAG,EAC3BuO,EAAM,EACDxO,EAAI,EAAGuO,EAAID,EAAO,OAAQtO,EAAIuO,EAAGvO,IACpCyO,EAAQH,EAAOtO,CAAC,EAChB0O,EAAO,IAAID,EAAOD,CAAG,EACrBA,GAAOC,EAAM,OAGf,OAAOC,CACR,CACH,EAEIC,EAAY,CACd,SAAU,SAAUT,EAAMC,EAAKC,EAAUnO,EAAKoO,EAAW,CACvD,QAASrO,EAAI,EAAGA,EAAIC,EAAKD,IACvBkO,EAAKG,EAAYrO,CAAC,EAAImO,EAAIC,EAAWpO,CAAC,CAEzC,EAED,cAAe,SAAUsO,EAAQ,CAC/B,MAAO,CAAE,EAAC,OAAO,MAAM,CAAE,EAAEA,CAAM,CAClC,CACH,EAKApI,EAAmB,SAAA,SAAU0I,EAAI,CAC3BA,GACF1I,EAAA,KAAgB,WAChBA,EAAA,MAAgB,YAChBA,EAAA,MAAgB,WAChBA,EAAQ,OAAOA,EAAS+H,CAAO,IAE/B/H,EAAA,KAAgB,MAChBA,EAAA,MAAgB,MAChBA,EAAA,MAAgB,MAChBA,EAAQ,OAAOA,EAASyI,CAAS,EAErC,EAEAzI,EAAQ,SAAS2H,CAAQ,2DCjFzB,IAAIgB,EAAQC,KASRC,EAAwB,EAIxBC,EAAwB,EACxBC,EAAwB,EAExBC,EAAwB,EAK5B,SAASC,EAAKrH,EAAK,CAAwB,QAAlB7H,EAAM6H,EAAI,OAAe,EAAE7H,GAAO,GAAK6H,EAAI7H,CAAG,EAAI,CAAM,CAIjF,IAAImP,EAAe,EACfC,EAAe,EACfC,EAAe,EAGfC,EAAe,EACfC,EAAe,IAQfC,EAAgB,GAGhBC,EAAgB,IAGhBC,EAAgBD,EAAW,EAAID,EAG/BG,EAAgB,GAGhBC,EAAgB,GAGhBC,EAAgB,EAAIH,EAAU,EAG9BI,EAAgB,GAGhBC,EAAgB,GAQhBC,EAAc,EAGdC,EAAc,IAGdC,EAAc,GAGdC,EAAc,GAGdC,EAAc,GAIdC,EACF,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,EAExDC,EACF,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,EAElEC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAEpCC,EACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAa7CC,EAAgB,IAGhBC,EAAgB,IAAI,OAAOhB,EAAU,GAAK,CAAC,EAC/CR,EAAKwB,CAAY,EAOjB,IAAIC,EAAgB,IAAI,MAAMhB,EAAU,CAAC,EACzCT,EAAKyB,CAAY,EAKjB,IAAIC,EAAgB,IAAI,MAAMH,CAAa,EAC3CvB,EAAK0B,CAAU,EAMf,IAAIC,EAAgB,IAAI,MAAMtB,EAAYD,EAAY,CAAC,EACvDJ,EAAK2B,CAAY,EAGjB,IAAIC,EAAgB,IAAI,MAAMtB,CAAY,EAC1CN,EAAK4B,CAAW,EAGhB,IAAIC,EAAgB,IAAI,MAAMpB,CAAO,EACrCT,EAAK6B,CAAS,EAId,SAASC,EAAeC,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,MAChD,CAGD,IAAIK,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,CAClB,CAID,SAASC,GAAOC,EAAM,CACpB,OAAOA,EAAO,IAAMjB,EAAWiB,CAAI,EAAIjB,EAAW,KAAOiB,IAAS,EAAE,CACrE,CAOD,SAASC,GAAUC,EAAGlG,EAAG,CAGvBkG,EAAE,YAAYA,EAAE,SAAS,EAAKlG,EAAK,IACnCkG,EAAE,YAAYA,EAAE,SAAS,EAAKlG,IAAM,EAAK,GAC1C,CAOD,SAASmG,GAAUD,EAAGjO,EAAOmO,EAAQ,CAC/BF,EAAE,SAAYhC,EAAWkC,GAC3BF,EAAE,QAAWjO,GAASiO,EAAE,SAAY,MACpCD,GAAUC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAASjO,GAAUiM,EAAWgC,EAAE,SAClCA,EAAE,UAAYE,EAASlC,IAEvBgC,EAAE,QAAWjO,GAASiO,EAAE,SAAY,MACpCA,EAAE,UAAYE,EAEjB,CAGD,SAASC,GAAUH,EAAGI,EAAGC,EAAM,CAC7BJ,GAAUD,EAAGK,EAAKD,EAAI,CAAC,EAAYC,EAAKD,EAAI,EAAI,CAAC,EAClD,CAQD,SAASE,GAAWvS,EAAME,EAAK,CAC7B,IAAIqC,EAAM,EACV,GACEA,GAAOvC,EAAO,EACdA,KAAU,EACVuC,IAAQ,QACD,EAAErC,EAAM,GACjB,OAAOqC,IAAQ,CAChB,CAMD,SAASiQ,GAASP,EAAG,CACfA,EAAE,WAAa,IACjBD,GAAUC,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,EAEjB,CAaD,SAASQ,GAAWR,EAAGS,EAGvB,CACE,IAAIJ,EAAkBI,EAAK,SACvBC,EAAkBD,EAAK,SACvBE,EAAkBF,EAAK,UAAU,YACjCG,EAAkBH,EAAK,UAAU,UACjCI,EAAkBJ,EAAK,UAAU,WACjCK,EAAkBL,EAAK,UAAU,WACjCnB,EAAkBmB,EAAK,UAAU,WACjCM,EACAvO,EAAGoH,EACHoH,EACAC,EACAC,EACAC,EAAW,EAEf,IAAKH,EAAO,EAAGA,GAAQjD,EAAUiD,IAC/BhB,EAAE,SAASgB,CAAI,EAAI,EAQrB,IAFAX,EAAKL,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtCe,EAAIf,EAAE,SAAW,EAAGe,EAAIjD,EAAWiD,IACtCvO,EAAIwN,EAAE,KAAKe,CAAC,EACZC,EAAOX,EAAKA,EAAK7N,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDwO,EAAO1B,IACT0B,EAAO1B,EACP6B,KAEFd,EAAK7N,EAAI,EAAI,CAAC,EAAYwO,EAGtB,EAAAxO,EAAIkO,KAERV,EAAE,SAASgB,CAAI,IACfC,EAAQ,EACJzO,GAAKsO,IACPG,EAAQJ,EAAMrO,EAAIsO,CAAI,GAExBI,EAAIb,EAAK7N,EAAI,CAAC,EACdwN,EAAE,SAAWkB,GAAKF,EAAOC,GACrBL,IACFZ,EAAE,YAAckB,GAAKP,EAAMnO,EAAI,EAAI,CAAC,EAAYyO,KAGpD,GAAIE,IAAa,EAMjB,GAAG,CAED,IADAH,EAAO1B,EAAa,EACbU,EAAE,SAASgB,CAAI,IAAM,GAAKA,IACjChB,EAAE,SAASgB,CAAI,IACfhB,EAAE,SAASgB,EAAO,CAAC,GAAK,EACxBhB,EAAE,SAASV,CAAU,IAIrB6B,GAAY,CAChB,OAAWA,EAAW,GAOpB,IAAKH,EAAO1B,EAAY0B,IAAS,EAAGA,IAElC,IADAxO,EAAIwN,EAAE,SAASgB,CAAI,EACZxO,IAAM,GACXoH,EAAIoG,EAAE,KAAK,EAAEe,CAAC,EACV,EAAAnH,EAAI8G,KACJL,EAAKzG,EAAI,EAAI,CAAC,IAAcoH,IAE9BhB,EAAE,UAAYgB,EAAOX,EAAKzG,EAAI,EAAI,CAAC,GAAayG,EAAKzG,EAAI,CAAC,EAC1DyG,EAAKzG,EAAI,EAAI,CAAC,EAAYoH,GAE5BxO,KAGL,CAWD,SAAS4O,GAAUf,EAAMK,EAAUW,EAInC,CACE,IAAIC,EAAY,IAAI,MAAMvD,EAAW,CAAC,EAClChQ,EAAO,EACPiT,EACAxO,EAKJ,IAAKwO,EAAO,EAAGA,GAAQjD,EAAUiD,IAC/BM,EAAUN,CAAI,EAAIjT,EAAQA,EAAOsT,EAASL,EAAO,CAAC,GAAM,EAS1D,IAAKxO,EAAI,EAAIA,GAAKkO,EAAUlO,IAAK,CAC/B,IAAIvE,EAAMoS,EAAK7N,EAAI,EAAI,CAAC,EACpBvE,IAAQ,IAEZoS,EAAK7N,EAAI,CAAC,EAAa8N,GAAWgB,EAAUrT,CAAG,IAAKA,CAAG,EAIxD,CACF,CAMD,SAASsT,IAAiB,CACxB,IAAI/O,EACAwO,EACAd,EACAnS,EACA+R,EACAuB,EAAW,IAAI,MAAMtD,EAAW,CAAC,EAiBrC,IADAmC,EAAS,EACJnS,EAAO,EAAGA,EAAO0P,EAAe,EAAG1P,IAEtC,IADAgR,EAAYhR,CAAI,EAAImS,EACf1N,EAAI,EAAGA,EAAK,GAAK8L,EAAYvQ,CAAI,EAAIyE,IACxCsM,EAAaoB,GAAQ,EAAInS,EAY7B,IAJA+Q,EAAaoB,EAAS,CAAC,EAAInS,EAG3B+R,EAAO,EACF/R,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAiR,EAAUjR,CAAI,EAAI+R,EACbtN,EAAI,EAAGA,EAAK,GAAK+L,EAAYxQ,CAAI,EAAIyE,IACxCqM,EAAWiB,GAAM,EAAI/R,EAKzB,IADA+R,IAAS,EACF/R,EAAO6P,EAAS7P,IAErB,IADAiR,EAAUjR,CAAI,EAAI+R,GAAQ,EACrBtN,EAAI,EAAGA,EAAK,GAAM+L,EAAYxQ,CAAI,EAAI,EAAKyE,IAC9CqM,EAAW,IAAMiB,GAAM,EAAI/R,EAM/B,IAAKiT,EAAO,EAAGA,GAAQjD,EAAUiD,IAC/BK,EAASL,CAAI,EAAI,EAInB,IADAxO,EAAI,EACGA,GAAK,KACVmM,EAAanM,EAAI,EAAI,CAAC,EAAY,EAClCA,IACA6O,EAAS,CAAC,IAEZ,KAAO7O,GAAK,KACVmM,EAAanM,EAAI,EAAI,CAAC,EAAY,EAClCA,IACA6O,EAAS,CAAC,IAEZ,KAAO7O,GAAK,KACVmM,EAAanM,EAAI,EAAI,CAAC,EAAY,EAClCA,IACA6O,EAAS,CAAC,IAEZ,KAAO7O,GAAK,KACVmM,EAAanM,EAAI,EAAI,CAAC,EAAY,EAClCA,IACA6O,EAAS,CAAC,IASZ,IAHAD,GAAUzC,EAAchB,EAAU,EAAG0D,CAAQ,EAGxC7O,EAAI,EAAGA,EAAIoL,EAASpL,IACvBoM,EAAapM,EAAI,EAAI,CAAC,EAAY,EAClCoM,EAAapM,EAAI,CAAC,EAAa8N,GAAW9N,EAAG,CAAC,EAIhD+M,GAAgB,IAAIN,EAAeN,EAAcL,EAAaZ,EAAW,EAAGC,EAASI,CAAQ,EAC7FyB,GAAgB,IAAIP,EAAeL,EAAcL,EAAa,EAAYX,EAASG,CAAQ,EAC3F0B,GAAiB,IAAIR,EAAe,IAAI,MAAM,CAAC,EAAGT,EAAc,EAAWX,EAAUI,CAAW,CAGjG,CAMD,SAASuD,GAAWxB,EAAG,CACrB,IAAIxN,EAGJ,IAAKA,EAAI,EAAGA,EAAImL,EAAUnL,IAAOwN,EAAE,UAAUxN,EAAI,CAAC,EAAa,EAC/D,IAAKA,EAAI,EAAGA,EAAIoL,EAAUpL,IAAOwN,EAAE,UAAUxN,EAAI,CAAC,EAAa,EAC/D,IAAKA,EAAI,EAAGA,EAAIqL,EAAUrL,IAAOwN,EAAE,QAAQxN,EAAI,CAAC,EAAa,EAE7DwN,EAAE,UAAU9B,EAAY,CAAC,EAAa,EACtC8B,EAAE,QAAUA,EAAE,WAAa,EAC3BA,EAAE,SAAWA,EAAE,QAAU,CAC1B,CAMD,SAASyB,GAAUzB,EACnB,CACMA,EAAE,SAAW,EACfD,GAAUC,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,CACd,CAMD,SAAS0B,GAAW1B,EAAGlK,EAAK7H,EAAK8G,EAKjC,CACE0M,GAAUzB,CAAC,EAEPjL,IACFgL,GAAUC,EAAG/R,CAAG,EAChB8R,GAAUC,EAAG,CAAC/R,CAAG,GAKnB4O,EAAM,SAASmD,EAAE,YAAaA,EAAE,OAAQlK,EAAK7H,EAAK+R,EAAE,OAAO,EAC3DA,EAAE,SAAW/R,CACd,CAMD,SAAS0T,GAAQtB,EAAM7N,EAAGoH,EAAGgI,EAAO,CAClC,IAAIC,EAAMrP,EAAI,EACVsP,EAAMlI,EAAI,EACd,OAAQyG,EAAKwB,CAAG,EAAaxB,EAAKyB,CAAG,GAC7BzB,EAAKwB,CAAG,IAAexB,EAAKyB,CAAG,GAAcF,EAAMpP,CAAC,GAAKoP,EAAMhI,CAAC,CACzE,CAQD,SAASmI,GAAW/B,EAAGK,EAAM2B,EAI7B,CAGE,QAFIC,EAAIjC,EAAE,KAAKgC,CAAC,EACZE,EAAIF,GAAK,EACNE,GAAKlC,EAAE,WAERkC,EAAIlC,EAAE,UACR2B,GAAQtB,EAAML,EAAE,KAAKkC,EAAI,CAAC,EAAGlC,EAAE,KAAKkC,CAAC,EAAGlC,EAAE,KAAK,GAC/CkC,IAGE,CAAAP,GAAQtB,EAAM4B,EAAGjC,EAAE,KAAKkC,CAAC,EAAGlC,EAAE,KAAK,IAGvCA,EAAE,KAAKgC,CAAC,EAAIhC,EAAE,KAAKkC,CAAC,EACpBF,EAAIE,EAGJA,IAAM,EAERlC,EAAE,KAAKgC,CAAC,EAAIC,CACb,CASD,SAASE,GAAenC,EAAGoC,EAAOC,EAIlC,CACE,IAAIvC,EACAwC,EACAC,EAAK,EACLxU,EACA8S,EAEJ,GAAIb,EAAE,WAAa,EACjB,GACEF,EAAQE,EAAE,YAAYA,EAAE,MAAQuC,EAAK,CAAC,GAAK,EAAMvC,EAAE,YAAYA,EAAE,MAAQuC,EAAK,EAAI,CAAC,EACnFD,EAAKtC,EAAE,YAAYA,EAAE,MAAQuC,CAAE,EAC/BA,IAEIzC,IAAS,EACXK,GAAUH,EAAGsC,EAAIF,CAAK,GAItBrU,EAAO+Q,EAAawD,CAAE,EACtBnC,GAAUH,EAAGjS,EAAO2P,EAAW,EAAG0E,CAAK,EACvCvB,EAAQvC,EAAYvQ,CAAI,EACpB8S,IAAU,IACZyB,GAAMvD,EAAYhR,CAAI,EACtBkS,GAAUD,EAAGsC,EAAIzB,CAAK,GAExBf,IACA/R,EAAO8R,GAAOC,CAAI,EAGlBK,GAAUH,EAAGjS,EAAMsU,CAAK,EACxBxB,EAAQtC,EAAYxQ,CAAI,EACpB8S,IAAU,IACZf,GAAQd,EAAUjR,CAAI,EACtBkS,GAAUD,EAAGF,EAAMe,CAAK,UAQrB0B,EAAKvC,EAAE,UAGlBG,GAAUH,EAAG9B,EAAWkE,CAAK,CAC9B,CAWD,SAASI,GAAWxC,EAAGS,EAGvB,CACE,IAAIJ,EAAWI,EAAK,SAChBE,EAAWF,EAAK,UAAU,YAC1BG,EAAYH,EAAK,UAAU,UAC3BpB,EAAWoB,EAAK,UAAU,MAC1BjO,EAAGoH,EACH8G,EAAW,GACX+B,EASJ,IAHAzC,EAAE,SAAW,EACbA,EAAE,SAAWlC,EAERtL,EAAI,EAAGA,EAAI6M,EAAO7M,IACjB6N,EAAK7N,EAAI,CAAC,IAAe,GAC3BwN,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIU,EAAWlO,EAClCwN,EAAE,MAAMxN,CAAC,EAAI,GAGb6N,EAAK7N,EAAI,EAAI,CAAC,EAAY,EAS9B,KAAOwN,EAAE,SAAW,GAClByC,EAAOzC,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAKU,EAAW,EAAI,EAAEA,EAAW,EAC3DL,EAAKoC,EAAO,CAAC,EAAa,EAC1BzC,EAAE,MAAMyC,CAAI,EAAI,EAChBzC,EAAE,UAEEY,IACFZ,EAAE,YAAcW,EAAM8B,EAAO,EAAI,CAAC,GAStC,IALAhC,EAAK,SAAWC,EAKXlO,EAAKwN,EAAE,UAAY,EAAcxN,GAAK,EAAGA,IAAOuP,GAAW/B,EAAGK,EAAM7N,CAAC,EAK1EiQ,EAAOpD,EACP,GAGE7M,EAAIwN,EAAE,KAAK,GACXA,EAAE,KAAK,GAAiBA,EAAE,KAAKA,EAAE,UAAU,EAC3C+B,GAAW/B,EAAGK,EAAM,GAGpBzG,EAAIoG,EAAE,KAAK,GAEXA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIxN,EACvBwN,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIpG,EAGvByG,EAAKoC,EAAO,CAAC,EAAapC,EAAK7N,EAAI,CAAC,EAAa6N,EAAKzG,EAAI,CAAC,EAC3DoG,EAAE,MAAMyC,CAAI,GAAKzC,EAAE,MAAMxN,CAAC,GAAKwN,EAAE,MAAMpG,CAAC,EAAIoG,EAAE,MAAMxN,CAAC,EAAIwN,EAAE,MAAMpG,CAAC,GAAK,EACvEyG,EAAK7N,EAAI,EAAI,CAAC,EAAY6N,EAAKzG,EAAI,EAAI,CAAC,EAAY6I,EAGpDzC,EAAE,KAAK,CAAc,EAAGyC,IACxBV,GAAW/B,EAAGK,EAAM,SAEbL,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,GAK9BQ,GAAWR,EAAGS,CAAI,EAGlBW,GAAUf,EAAMK,EAAUV,EAAE,QAAQ,CACrC,CAOD,SAAS0C,GAAU1C,EAAGK,EAAMK,EAI5B,CACE,IAAIlO,EACAmQ,EAAU,GACVC,EAEAC,EAAUxC,EAAK,EAAI,EAAI,CAAC,EAExByC,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAEd3C,GAAMK,EAAW,GAAK,EAAI,CAAC,EAAY,MAElClO,EAAI,EAAGA,GAAKkO,EAAUlO,IACzBoQ,EAASC,EACTA,EAAUxC,GAAM7N,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEsQ,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACjBhD,EAAE,QAAQ4C,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAW3C,EAAE,QAAQ4C,EAAS,CAAC,IAC9C5C,EAAE,QAAQ7B,EAAU,CAAC,KAEZ2E,GAAS,GAClB9C,EAAE,QAAQ5B,EAAY,CAAC,IAGvB4B,EAAE,QAAQ3B,EAAc,CAAC,IAG3ByE,EAAQ,EACRH,EAAUC,EAENC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGjB,CAOD,SAASC,GAAUjD,EAAGK,EAAMK,EAI5B,CACE,IAAIlO,EACAmQ,EAAU,GACVC,EAEAC,EAAUxC,EAAK,EAAI,EAAI,CAAC,EAExByC,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACdE,EAAY,IACZC,EAAY,GAGTxQ,EAAI,EAAGA,GAAKkO,EAAUlO,IAIzB,GAHAoQ,EAASC,EACTA,EAAUxC,GAAM7N,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEsQ,EAAQC,GAAaH,IAAWC,GAG/B,IAAIC,EAAQE,EACjB,GAAK7C,GAAUH,EAAG4C,EAAQ5C,EAAE,OAAO,QAAY,EAAE8C,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACbxC,GAAUH,EAAG4C,EAAQ5C,EAAE,OAAO,EAC9B8C,KAGF3C,GAAUH,EAAG7B,EAAS6B,EAAE,OAAO,EAC/BC,GAAUD,EAAG8C,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IAClB3C,GAAUH,EAAG5B,EAAW4B,EAAE,OAAO,EACjCC,GAAUD,EAAG8C,EAAQ,EAAG,CAAC,IAGzB3C,GAAUH,EAAG3B,EAAa2B,EAAE,OAAO,EACnCC,GAAUD,EAAG8C,EAAQ,GAAI,CAAC,GAG5BA,EAAQ,EACRH,EAAUC,EACNC,IAAY,GACdE,EAAY,IACZC,EAAY,GAEHJ,IAAWC,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAGjB,CAOD,SAASE,GAAclD,EAAG,CACxB,IAAImD,EAgBJ,IAbAT,GAAU1C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3C0C,GAAU1C,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAG3CwC,GAAWxC,EAAGA,EAAE,OAAO,EASlBmD,EAActF,EAAW,EAAGsF,GAAe,GAC1CnD,EAAE,QAAQvB,EAAS0E,CAAW,EAAI,EAAI,CAAC,IAAc,EADRA,IACjD,CAKF,OAAAnD,EAAE,SAAW,GAAKmD,EAAc,GAAK,EAAI,EAAI,EAItCA,CACR,CAQD,SAASC,GAAepD,EAAGqD,EAAQC,EAAQC,EAG3C,CACE,IAAIC,EASJ,IAHAvD,GAAUD,EAAGqD,EAAS,IAAK,CAAC,EAC5BpD,GAAUD,EAAGsD,EAAS,EAAK,CAAC,EAC5BrD,GAAUD,EAAGuD,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BvD,GAAUD,EAAGA,EAAE,QAAQvB,EAAS+E,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUjD,EAAGA,EAAE,UAAWqD,EAAS,CAAC,EAGpCJ,GAAUjD,EAAGA,EAAE,UAAWsD,EAAS,CAAC,CAErC,CAgBD,SAASG,GAAiBzD,EAAG,CAK3B,IAAI0D,EAAa,WACblR,EAGJ,IAAKA,EAAI,EAAGA,GAAK,GAAIA,IAAKkR,KAAgB,EACxC,GAAKA,EAAa,GAAO1D,EAAE,UAAUxN,EAAI,CAAC,IAAe,EACvD,OAAOwK,EAKX,GAAIgD,EAAE,UAAU,EAAI,CAAC,IAAe,GAAKA,EAAE,UAAU,GAAK,CAAC,IAAe,GACtEA,EAAE,UAAU,GAAK,CAAC,IAAe,EACnC,OAAO/C,EAET,IAAKzK,EAAI,GAAIA,EAAIkL,EAAUlL,IACzB,GAAIwN,EAAE,UAAUxN,EAAI,CAAC,IAAe,EAClC,OAAOyK,EAOX,OAAOD,CACR,CAGD,IAAI2G,GAAmB,GAKvB,SAASC,GAAS5D,EAClB,CAEO2D,KACHpC,KACAoC,GAAmB,IAGrB3D,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWT,EAAa,EACnDS,EAAE,OAAU,IAAIN,GAASM,EAAE,UAAWR,EAAa,EACnDQ,EAAE,QAAU,IAAIN,GAASM,EAAE,QAASP,EAAc,EAElDO,EAAE,OAAS,EACXA,EAAE,SAAW,EAGbwB,GAAWxB,CAAC,CACb,CAMD,SAAS6D,GAAiB7D,EAAGlK,EAAKgO,EAAYC,EAK9C,CACE9D,GAAUD,GAAI5C,GAAgB,IAAM2G,EAAO,EAAI,GAAI,CAAC,EACpDrC,GAAW1B,EAAGlK,EAAKgO,EAAY,EAAI,CACpC,CAOD,SAASE,GAAUhE,EAAG,CACpBC,GAAUD,EAAG3C,GAAgB,EAAG,CAAC,EACjC8C,GAAUH,EAAG9B,EAAWS,CAAY,EACpC4B,GAASP,CAAC,CACX,CAOD,SAASiE,GAAgBjE,EAAGlK,EAAKgO,EAAYC,EAK7C,CACE,IAAIG,EAAUC,EACVhB,EAAc,EAGdnD,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAc9C,IACvB8C,EAAE,KAAK,UAAYyD,GAAiBzD,CAAC,GAIvCwC,GAAWxC,EAAGA,EAAE,MAAM,EAItBwC,GAAWxC,EAAGA,EAAE,MAAM,EAUtBmD,EAAcD,GAAclD,CAAC,EAG7BkE,EAAYlE,EAAE,QAAU,EAAI,IAAO,EACnCmE,EAAenE,EAAE,WAAa,EAAI,IAAO,EAMrCmE,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAAcpO,IAAQ,GAS3C+N,GAAiB7D,EAAGlK,EAAKgO,EAAYC,CAAI,EAEhC/D,EAAE,WAAajD,GAAWoH,IAAgBD,GAEnDjE,GAAUD,GAAI3C,GAAgB,IAAM0G,EAAO,EAAI,GAAI,CAAC,EACpD5B,GAAenC,EAAGrB,EAAcC,CAAY,IAG5CqB,GAAUD,GAAI1C,GAAa,IAAMyG,EAAO,EAAI,GAAI,CAAC,EACjDX,GAAepD,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAGmD,EAAc,CAAC,EAC/EhB,GAAenC,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5CwB,GAAWxB,CAAC,EAER+D,GACFtC,GAAUzB,CAAC,CAId,CAMD,SAASoE,GAAUpE,EAAGF,EAAMwC,EAI5B,CAGE,OAAAtC,EAAE,YAAYA,EAAE,MAAQA,EAAE,SAAW,CAAC,EAASF,IAAS,EAAK,IAC7DE,EAAE,YAAYA,EAAE,MAAQA,EAAE,SAAW,EAAI,CAAC,EAAIF,EAAO,IAErDE,EAAE,YAAYA,EAAE,MAAQA,EAAE,QAAQ,EAAIsC,EAAK,IAC3CtC,EAAE,WAEEF,IAAS,EAEXE,EAAE,UAAUsC,EAAK,CAAC,KAElBtC,EAAE,UAEFF,IAKAE,EAAE,WAAWlB,EAAawD,CAAE,EAAI5E,EAAW,GAAK,CAAC,IACjDsC,EAAE,UAAUH,GAAOC,CAAI,EAAI,CAAC,KA0BtBE,EAAE,WAAaA,EAAE,YAAc,CAKxC,CAEe,OAAAqE,GAAA,SAAIT,GACIS,GAAA,iBAAGR,GACJQ,GAAA,gBAAIJ,GACVI,GAAA,UAAGD,GACpBC,GAAA,UAAoBL,mDC5qCpB,SAASM,EAAQC,EAAOzO,EAAK7H,EAAKuO,EAAK,CAKrC,QAJIgI,EAAMD,EAAQ,MAAS,EACvBE,EAAOF,IAAU,GAAM,MAAS,EAChC/R,EAAI,EAEDvE,IAAQ,GAAG,CAIhBuE,EAAIvE,EAAM,IAAO,IAAOA,EACxBA,GAAOuE,EAEP,GACEgS,EAAMA,EAAK1O,EAAI0G,GAAK,EAAI,EACxBiI,EAAMA,EAAKD,EAAK,QACT,EAAEhS,GAEXgS,GAAM,MACNC,GAAM,KACP,CAED,OAAQD,EAAMC,GAAM,GAAM,CAC3B,CAGD,OAAAC,GAAiBJ,kDCxBjB,SAASK,GAAY,CAGnB,QAFIvE,EAAGwE,EAAQ,GAENpS,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B4N,EAAI5N,EACJ,QAASwP,EAAI,EAAGA,EAAI,EAAGA,IACrB5B,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDwE,EAAMpS,CAAC,EAAI4N,CACZ,CAED,OAAOwE,CACR,CAGD,IAAIC,EAAWF,IAGf,SAASG,EAAMC,EAAKjP,EAAK7H,EAAKuO,EAAK,CACjC,IAAIwI,EAAIH,EACJ7V,EAAMwN,EAAMvO,EAEhB8W,GAAO,GAEP,QAAS/W,EAAIwO,EAAKxO,EAAIgB,EAAKhB,IACzB+W,EAAOA,IAAQ,EAAKC,GAAGD,EAAMjP,EAAI9H,CAAC,GAAK,GAAI,EAG7C,OAAQ+W,EAAO,EAChB,CAGD,OAAAE,GAAiBH,8CCrCjBI,GAAiB,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sECTV,IAAIrI,EAAUC,KACVuH,EAAUc,KACVb,EAAUc,KACVN,EAAUO,KACVC,EAAUC,KAOVC,EAAkB,EAClBC,EAAkB,EAElBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAkB,EAOlBC,EAAkB,EAClBC,EAAkB,EAGlBC,EAAkB,GAClBC,EAAkB,GAElBC,EAAkB,GAQlBC,EAAwB,GAGxBC,EAAwB,EACxBC,EAAwB,EACxBC,EAAwB,EACxBtJ,EAAwB,EACxBuJ,EAAwB,EAMxBpJ,EAAwB,EAIxBqJ,EAAc,EAKdC,EAAgB,EAEhBC,EAAY,GAEZC,EAAgB,EAGhBjJ,EAAgB,GAEhBC,EAAgB,IAEhBC,EAAgBD,EAAW,EAAID,EAE/BG,EAAgB,GAEhBC,EAAgB,GAEhBC,EAAgB,EAAIH,EAAU,EAE9BI,EAAY,GAGZR,EAAY,EACZC,EAAY,IACZmJ,EAAiBnJ,EAAYD,EAAY,EAEzCqJ,GAAc,GAEdC,GAAa,GACbC,GAAc,GACdC,GAAa,GACbC,GAAgB,GAChBC,GAAa,IACbC,GAAa,IACbC,GAAe,IAEfC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EACpBC,GAAoB,EAEpBC,GAAU,EAEd,SAAS7T,GAAI8T,EAAMC,EAAW,CAC5B,OAAAD,EAAK,IAAMnC,EAAIoC,CAAS,EACjBA,CACR,CAED,SAASlE,GAAKtC,EAAG,CACf,OAASA,GAAM,IAAOA,EAAK,EAAI,EAAI,EACpC,CAED,SAAS/D,GAAKrH,EAAK,CAAwB,QAAlB7H,EAAM6H,EAAI,OAAe,EAAE7H,GAAO,GAAK6H,EAAI7H,CAAG,EAAI,CAAM,CASjF,SAAS0Z,GAAcF,EAAM,CAC3B,IAAIzH,EAAIyH,EAAK,MAGTxZ,EAAM+R,EAAE,QACR/R,EAAMwZ,EAAK,YACbxZ,EAAMwZ,EAAK,WAETxZ,IAAQ,IAEZ4O,EAAM,SAAS4K,EAAK,OAAQzH,EAAE,YAAaA,EAAE,YAAa/R,EAAKwZ,EAAK,QAAQ,EAC5EA,EAAK,UAAYxZ,EACjB+R,EAAE,aAAe/R,EACjBwZ,EAAK,WAAaxZ,EAClBwZ,EAAK,WAAaxZ,EAClB+R,EAAE,SAAW/R,EACT+R,EAAE,UAAY,IAChBA,EAAE,YAAc,GAEnB,CAGD,SAAS4H,GAAiB5H,EAAG+D,EAAM,CACjCM,EAAM,gBAAgBrE,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAa+D,CAAI,EACpG/D,EAAE,YAAcA,EAAE,SAClB2H,GAAc3H,EAAE,IAAI,CACrB,CAGD,SAAS6H,GAAS7H,EAAG8H,EAAG,CACtB9H,EAAE,YAAYA,EAAE,SAAS,EAAI8H,CAC9B,CAQD,SAASC,GAAY/H,EAAG8H,EAAG,CAGzB9H,EAAE,YAAYA,EAAE,SAAS,EAAK8H,IAAM,EAAK,IACzC9H,EAAE,YAAYA,EAAE,SAAS,EAAI8H,EAAI,GAClC,CAUD,SAASE,GAASP,EAAM3R,EAAK/G,EAAOiN,EAAM,CACxC,IAAI/N,EAAMwZ,EAAK,SAGf,OADIxZ,EAAM+N,IAAQ/N,EAAM+N,GACpB/N,IAAQ,EAAY,GAExBwZ,EAAK,UAAYxZ,EAGjB4O,EAAM,SAAS/G,EAAK2R,EAAK,MAAOA,EAAK,QAASxZ,EAAKc,CAAK,EACpD0Y,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQnD,EAAQmD,EAAK,MAAO3R,EAAK7H,EAAKc,CAAK,EAGzC0Y,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQ3C,EAAM2C,EAAK,MAAO3R,EAAK7H,EAAKc,CAAK,GAGhD0Y,EAAK,SAAWxZ,EAChBwZ,EAAK,UAAYxZ,EAEVA,EACR,CAYD,SAASga,GAAcjI,EAAGkI,EAAW,CACnC,IAAIC,EAAenI,EAAE,iBACjBoI,EAAOpI,EAAE,SACTqI,EACApa,EACAqa,EAAWtI,EAAE,YACbuI,EAAavI,EAAE,WACfwI,EAASxI,EAAE,SAAYA,EAAE,OAAS2G,EAClC3G,EAAE,UAAYA,EAAE,OAAS2G,GAAiB,EAE1C8B,GAAOzI,EAAE,OAET0I,GAAQ1I,EAAE,OACV2I,GAAQ3I,EAAE,KAMV4I,GAAS5I,EAAE,SAAWxC,EACtBqL,GAAaJ,GAAKL,EAAOE,EAAW,CAAC,EACrCQ,GAAaL,GAAKL,EAAOE,CAAQ,EAQjCtI,EAAE,aAAeA,EAAE,aACrBmI,IAAiB,GAKfI,EAAavI,EAAE,YAAauI,EAAavI,EAAE,WAI/C,EAaE,IAXAqI,EAAQH,EAWJ,EAAAO,GAAKJ,EAAQC,CAAQ,IAAUQ,IAC/BL,GAAKJ,EAAQC,EAAW,CAAC,IAAMO,IAC/BJ,GAAKJ,CAAK,IAAqBI,GAAKL,CAAI,GACxCK,GAAK,EAAEJ,CAAK,IAAmBI,GAAKL,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRC,IAMA,EAAG,OAEMI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAAKI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAC/DI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAAKI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAC/DI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAAKI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAC/DI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAAKI,GAAK,EAAEL,CAAI,IAAMK,GAAK,EAAEJ,CAAK,GAC/DD,EAAOQ,IAOhB,GAHA3a,EAAMuP,GAAaoL,GAASR,GAC5BA,EAAOQ,GAASpL,EAEZvP,EAAMqa,EAAU,CAGlB,GAFAtI,EAAE,YAAckI,EAChBI,EAAWra,EACPA,GAAOsa,EACT,MAEFM,GAAaJ,GAAKL,EAAOE,EAAW,CAAC,EACrCQ,GAAaL,GAAKL,EAAOE,CAAQ,CAClC,SACOJ,EAAYS,GAAKT,EAAYQ,EAAK,GAAKF,GAAS,EAAEL,IAAiB,GAE7E,OAAIG,GAAYtI,EAAE,UACTsI,EAEFtI,EAAE,SACV,CAaD,SAAS+I,GAAY/I,EAAG,CACtB,IAAIgJ,EAAUhJ,EAAE,OACZ3O,EAAGmB,EAAGoH,EAAGqP,EAAMC,EAInB,EAAG,CAqBD,GApBAD,EAAOjJ,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAYgJ,GAAWA,EAAUrC,GAAgB,CAErD9J,EAAM,SAASmD,EAAE,OAAQA,EAAE,OAAQgJ,EAASA,EAAS,CAAC,EACtDhJ,EAAE,aAAegJ,EACjBhJ,EAAE,UAAYgJ,EAEdhJ,EAAE,aAAegJ,EASjBxW,EAAIwN,EAAE,UACN3O,EAAImB,EACJ,GACEoH,EAAIoG,EAAE,KAAK,EAAE3O,CAAC,EACd2O,EAAE,KAAK3O,CAAC,EAAKuI,GAAKoP,EAAUpP,EAAIoP,EAAU,QACnC,EAAExW,GAEXA,EAAIwW,EACJ3X,EAAImB,EACJ,GACEoH,EAAIoG,EAAE,KAAK,EAAE3O,CAAC,EACd2O,EAAE,KAAK3O,CAAC,EAAKuI,GAAKoP,EAAUpP,EAAIoP,EAAU,QAInC,EAAExW,GAEXyW,GAAQD,CACT,CACD,GAAIhJ,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJAxN,EAAIwV,GAAShI,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAWiJ,CAAI,EAC7DjJ,EAAE,WAAaxN,EAGXwN,EAAE,UAAYA,EAAE,QAAUzC,EAS5B,IARA2L,EAAMlJ,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAOkJ,CAAG,EAGtBlJ,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOkJ,EAAM,CAAC,GAAKlJ,EAAE,UAIvDA,EAAE,SAEPA,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOkJ,EAAM3L,EAAY,CAAC,GAAKyC,EAAE,UAE1EA,EAAE,KAAKkJ,EAAMlJ,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAIkJ,EAClBA,IACAlJ,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASzC,KAA7B,CASR,OAAWyC,EAAE,UAAY2G,GAAiB3G,EAAE,KAAK,WAAa,EAsC7D,CAWD,SAASmJ,GAAenJ,EAAGoJ,EAAO,CAIhC,IAAIC,EAAiB,MAOrB,IALIA,EAAiBrJ,EAAE,iBAAmB,IACxCqJ,EAAiBrJ,EAAE,iBAAmB,KAI/B,CAEP,GAAIA,EAAE,WAAa,EAAG,CAUpB,GADA+I,GAAY/I,CAAC,EACTA,EAAE,YAAc,GAAKoJ,IAAU5D,EACjC,OAAO4B,GAGT,GAAIpH,EAAE,YAAc,EAClB,KAGH,CAIDA,EAAE,UAAYA,EAAE,UAChBA,EAAE,UAAY,EAGd,IAAIsJ,EAAYtJ,EAAE,YAAcqJ,EAkBhC,IAhBIrJ,EAAE,WAAa,GAAKA,EAAE,UAAYsJ,KAEpCtJ,EAAE,UAAYA,EAAE,SAAWsJ,EAC3BtJ,EAAE,SAAWsJ,EAEb1B,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,IAUvBA,EAAE,SAAWA,EAAE,aAAgBA,EAAE,OAAS2G,IAE5CiB,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoH,EAIZ,CAID,OAFApH,EAAE,OAAS,EAEPoJ,IAAUzD,GAEZiC,GAAiB5H,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsH,GAGFC,KAGLvH,EAAE,SAAWA,EAAE,cAEjB4H,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoH,GAMZ,CASD,SAASmC,GAAavJ,EAAGoJ,EAAO,CAI9B,QAHII,EACAC,IAEK,CAMP,GAAIzJ,EAAE,UAAY2G,EAAe,CAE/B,GADAoC,GAAY/I,CAAC,EACTA,EAAE,UAAY2G,GAAiByC,IAAU5D,EAC3C,OAAO4B,GAET,GAAIpH,EAAE,YAAc,EAClB,KAEH,CAyBD,GApBAwJ,EAAY,EACRxJ,EAAE,WAAazC,IAEjByC,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzC,EAAY,CAAC,GAAKyC,EAAE,UACjFwJ,EAAYxJ,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlBwJ,IAAc,GAAcxJ,EAAE,SAAWwJ,GAAexJ,EAAE,OAAS2G,IAKrE3G,EAAE,aAAeiI,GAAcjI,EAAGwJ,CAAS,GAGzCxJ,EAAE,cAAgBzC,EAYpB,GAPAkM,EAASpF,EAAM,UAAUrE,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAezC,CAAS,EAElFyC,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAazC,EAAW,CACvFyC,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzC,EAAY,CAAC,GAAKyC,EAAE,UACjFwJ,EAAYxJ,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,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAW,CAAC,GAAKA,EAAE,eAavEyJ,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAEnDA,EAAE,YACFA,EAAE,WAEJ,GAAIyJ,IAEF7B,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoH,EAIZ,CAED,OADApH,EAAE,OAAWA,EAAE,SAAYzC,EAAY,EAAMyC,EAAE,SAAWzC,EAAY,EAClE6L,IAAUzD,GAEZiC,GAAiB5H,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsH,GAGFC,IAELvH,EAAE,WAEJ4H,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoH,GAIJC,EACR,CAOD,SAASqC,GAAa1J,EAAGoJ,EAAO,CAO9B,QANII,EACAC,EAEAE,IAGK,CAMP,GAAI3J,EAAE,UAAY2G,EAAe,CAE/B,GADAoC,GAAY/I,CAAC,EACTA,EAAE,UAAY2G,GAAiByC,IAAU5D,EAC3C,OAAO4B,GAET,GAAIpH,EAAE,YAAc,EAAK,KAC1B,CAyCD,GApCAwJ,EAAY,EACRxJ,EAAE,WAAazC,IAEjByC,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzC,EAAY,CAAC,GAAKyC,EAAE,UACjFwJ,EAAYxJ,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,aAAezC,EAAY,EAEzBiM,IAAc,GAAYxJ,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAWwJ,GAAcxJ,EAAE,OAAS2G,IAKxC3G,EAAE,aAAeiI,GAAcjI,EAAGwJ,CAAS,EAGvCxJ,EAAE,cAAgB,IAClBA,EAAE,WAAamG,GAAenG,EAAE,eAAiBzC,GAAayC,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAezC,EAAY,IAM7ByC,EAAE,aAAezC,GAAayC,EAAE,cAAgBA,EAAE,YAAa,CACjE2J,EAAa3J,EAAE,SAAWA,EAAE,UAAYzC,EAOxCkM,EAASpF,EAAM,UAAUrE,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAczC,CAAS,EAMpFyC,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAY2J,IAElB3J,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzC,EAAY,CAAC,GAAKyC,EAAE,UACjFwJ,EAAYxJ,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,aAAezC,EAAY,EAC7ByC,EAAE,WAEEyJ,IAEF7B,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoH,EAKjB,SAAepH,EAAE,iBAgBX,GATAyJ,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEnDyJ,GAEF7B,GAAiB5H,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAOoH,QAMTpH,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,WAEL,CAUD,OARIA,EAAE,kBAGJyJ,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEvDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWzC,EAAY,EAAIyC,EAAE,SAAWzC,EAAY,EAC7D6L,IAAUzD,GAEZiC,GAAiB5H,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsH,GAGFC,IAELvH,EAAE,WAEJ4H,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoH,GAKJC,EACR,CAQD,SAASuC,GAAY5J,EAAGoJ,EAAO,CAO7B,QANIK,EACAd,EACAP,EAAMQ,EAENH,EAAOzI,EAAE,SAEJ,CAKP,GAAIA,EAAE,WAAaxC,EAAW,CAE5B,GADAuL,GAAY/I,CAAC,EACTA,EAAE,WAAaxC,GAAa4L,IAAU5D,EACxC,OAAO4B,GAET,GAAIpH,EAAE,YAAc,EAAK,KAC1B,CAID,GADAA,EAAE,aAAe,EACbA,EAAE,WAAazC,GAAayC,EAAE,SAAW,IAC3CoI,EAAOpI,EAAE,SAAW,EACpB2I,EAAOF,EAAKL,CAAI,EACZO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAAG,CAC3EQ,EAAS5I,EAAE,SAAWxC,EACtB,EAAG,OAEMmL,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CA,EAAOQ,GAChB5I,EAAE,aAAexC,GAAaoL,EAASR,GACnCpI,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,UAEtB,CAuBH,GAlBIA,EAAE,cAAgBzC,GAIpBkM,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,aAAezC,CAAS,EAEzDyC,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjByJ,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAEnDA,EAAE,YACFA,EAAE,YAEAyJ,IAEF7B,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoH,EAIZ,CAED,OADApH,EAAE,OAAS,EACPoJ,IAAUzD,GAEZiC,GAAiB5H,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsH,GAGFC,IAELvH,EAAE,WAEJ4H,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoH,GAIJC,EACR,CAMD,SAASwC,GAAa7J,EAAGoJ,EAAO,CAG9B,QAFIK,IAEK,CAEP,GAAIzJ,EAAE,YAAc,IAClB+I,GAAY/I,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAIoJ,IAAU5D,EACZ,OAAO4B,GAET,KACD,CAUH,GANApH,EAAE,aAAe,EAGjByJ,EAASpF,EAAM,UAAUrE,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EACnDA,EAAE,YACFA,EAAE,WACEyJ,IAEF7B,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOoH,EAIZ,CAED,OADApH,EAAE,OAAS,EACPoJ,IAAUzD,GAEZiC,GAAiB5H,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBsH,GAGFC,IAELvH,EAAE,WAEJ4H,GAAiB5H,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBoH,GAIJC,EACR,CAOD,SAASyC,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CACnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,CACb,CAED,IAAIC,GAEJA,GAAsB,CAEpB,IAAIN,GAAO,EAAG,EAAG,EAAG,EAAGX,EAAc,EACrC,IAAIW,GAAO,EAAG,EAAG,EAAG,EAAGP,EAAY,EACnC,IAAIO,GAAO,EAAG,EAAG,GAAI,EAAGP,EAAY,EACpC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIP,EAAY,EAErC,IAAIO,GAAO,EAAG,EAAG,GAAI,GAAIJ,EAAY,EACrC,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,EAAY,EACtC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,EAAY,EACxC,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,EAC3C,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,EAAY,CAC7C,EAMA,SAASW,GAAQrK,EAAG,CAClBA,EAAE,YAAc,EAAIA,EAAE,OAGtB7C,GAAK6C,EAAE,IAAI,EAIXA,EAAE,eAAiBoK,GAAoBpK,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAaoK,GAAoBpK,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAaoK,GAAoBpK,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmBoK,GAAoBpK,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAczC,EAAY,EAC7CyC,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,CACX,CAGD,SAASsK,GAAe,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,OAAS/D,EACd,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,IAAI1J,EAAM,MAAMiB,EAAY,CAAC,EAC/C,KAAK,UAAa,IAAIjB,EAAM,OAAO,EAAIe,EAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAIf,EAAM,OAAO,EAAIgB,EAAW,GAAK,CAAC,EACxDV,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,SAAS,EACnBA,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAIN,EAAM,MAAMkB,EAAW,CAAC,EAI5C,KAAK,KAAO,IAAIlB,EAAM,MAAM,EAAIc,EAAU,CAAC,EAC3CR,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAIN,EAAM,MAAM,EAAIc,EAAU,CAAC,EAC5CR,GAAK,KAAK,KAAK,EAIf,KAAK,MAAQ,EAEb,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAEhB,KAAK,MAAQ,EAMb,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAajB,CAGD,SAASoN,EAAiB9C,EAAM,CAC9B,IAAIzH,EAEJ,MAAI,CAACyH,GAAQ,CAACA,EAAK,MACV9T,GAAI8T,EAAM1B,CAAc,GAGjC0B,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAYvK,EAEjB8C,EAAIyH,EAAK,MACTzH,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAAUA,EAAE,KAAO6G,GAAaK,GAClCO,EAAK,MAASzH,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAawF,EACfnB,EAAM,SAASrE,CAAC,EACT6F,EACR,CAGD,SAAS2E,EAAa/C,EAAM,CAC1B,IAAIzM,EAAMuP,EAAiB9C,CAAI,EAC/B,OAAIzM,IAAQ6K,GACVwE,GAAQ5C,EAAK,KAAK,EAEbzM,CACR,CAGD,SAASyP,EAAiBhD,EAAMiD,EAAM,CAEpC,MADI,CAACjD,GAAQ,CAACA,EAAK,OACfA,EAAK,MAAM,OAAS,EAAY1B,GACpC0B,EAAK,MAAM,OAASiD,EACb7E,EACR,CAGD,SAAS8E,EAAalD,EAAMmD,EAAOrU,EAAQsU,EAAYC,EAAUC,EAAU,CACzE,GAAI,CAACtD,EACH,OAAO1B,EAET,IAAIiF,EAAO,EAiBX,GAfIJ,IAAU1E,IACZ0E,EAAQ,GAGNC,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAWtE,GAAiBjQ,IAAWgQ,GACzDsE,EAAa,GAAKA,EAAa,IAAMD,EAAQ,GAAKA,EAAQ,GAC1DG,EAAW,GAAKA,EAAWhO,EAC3B,OAAOpJ,GAAI8T,EAAM1B,CAAc,EAI7B8E,IAAe,IACjBA,EAAa,GAIf,IAAI7K,EAAI,IAAIsK,EAEZ,OAAA7C,EAAK,MAAQzH,EACbA,EAAE,KAAOyH,EAETzH,EAAE,KAAOgL,EACThL,EAAE,OAAS,KACXA,EAAE,OAAS6K,EACX7K,EAAE,OAAS,GAAKA,EAAE,OAClBA,EAAE,OAASA,EAAE,OAAS,EAEtBA,EAAE,UAAY8K,EAAW,EACzB9K,EAAE,UAAY,GAAKA,EAAE,UACrBA,EAAE,UAAYA,EAAE,UAAY,EAC5BA,EAAE,WAAa,CAAC,GAAGA,EAAE,UAAYzC,EAAY,GAAKA,GAElDyC,EAAE,OAAS,IAAInD,EAAM,KAAKmD,EAAE,OAAS,CAAC,EACtCA,EAAE,KAAO,IAAInD,EAAM,MAAMmD,EAAE,SAAS,EACpCA,EAAE,KAAO,IAAInD,EAAM,MAAMmD,EAAE,MAAM,EAKjCA,EAAE,YAAc,GAAM8K,EAAW,EAEjC9K,EAAE,iBAAmBA,EAAE,YAAc,EAIrCA,EAAE,YAAc,IAAInD,EAAM,KAAKmD,EAAE,gBAAgB,EAIjDA,EAAE,MAAQ,EAAIA,EAAE,YAGhBA,EAAE,OAAS,EAAI,GAAKA,EAAE,YAEtBA,EAAE,MAAQ4K,EACV5K,EAAE,SAAW+K,EACb/K,EAAE,OAASzJ,EAEJiU,EAAa/C,CAAI,CACzB,CAED,SAASwD,EAAYxD,EAAMmD,EAAO,CAChC,OAAOD,EAAalD,EAAMmD,EAAOrE,EAAYE,EAAWC,EAAeJ,CAAkB,CAC1F,CAGD,SAAS4E,EAAQzD,EAAM2B,EAAO,CAC5B,IAAI+B,EAAWnL,EACXoL,EAAKC,EAET,GAAI,CAAC5D,GAAQ,CAACA,EAAK,OACjB2B,EAAQxD,GAAWwD,EAAQ,EAC3B,OAAO3B,EAAO9T,GAAI8T,EAAM1B,CAAc,EAAIA,EAK5C,GAFA/F,EAAIyH,EAAK,MAEL,CAACA,EAAK,QACL,CAACA,EAAK,OAASA,EAAK,WAAa,GACjCzH,EAAE,SAAWmH,IAAgBiC,IAAUzD,EAC1C,OAAOhS,GAAI8T,EAAOA,EAAK,YAAc,EAAKxB,EAAcF,CAAc,EAQxE,GALA/F,EAAE,KAAOyH,EACT0D,EAAYnL,EAAE,WACdA,EAAE,WAAaoJ,EAGXpJ,EAAE,SAAW6G,GAEf,GAAI7G,EAAE,OAAS,EACbyH,EAAK,MAAQ,EACbI,GAAS7H,EAAG,EAAE,EACd6H,GAAS7H,EAAG,GAAG,EACf6H,GAAS7H,EAAG,CAAC,EACRA,EAAE,QAaL6H,GAAS7H,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,EACzC,EACQ6H,GAAS7H,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChC6H,GAAS7H,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvC6H,GAAS7H,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC6H,GAAS7H,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC6H,GAAS7H,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYoG,GAAkBpG,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB6H,GAAS7H,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnC6H,GAAS7H,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxC6H,GAAS7H,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACXyH,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE5DA,EAAE,QAAU,EACZA,EAAE,OAAS8G,KAlCXe,GAAS7H,EAAG,CAAC,EACb6H,GAAS7H,EAAG,CAAC,EACb6H,GAAS7H,EAAG,CAAC,EACb6H,GAAS7H,EAAG,CAAC,EACb6H,GAAS7H,EAAG,CAAC,EACb6H,GAAS7H,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYoG,GAAkBpG,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB6H,GAAS7H,EAAGwH,EAAO,EACnBxH,EAAE,OAASkH,QA6Bf,CACE,IAAInS,EAAUwR,GAAevG,EAAE,OAAS,GAAM,IAAO,EACjDsL,EAAc,GAEdtL,EAAE,UAAYoG,GAAkBpG,EAAE,MAAQ,EAC5CsL,EAAc,EACLtL,EAAE,MAAQ,EACnBsL,EAAc,EACLtL,EAAE,QAAU,EACrBsL,EAAc,EAEdA,EAAc,EAEhBvW,GAAWuW,GAAe,EACtBtL,EAAE,WAAa,IAAKjL,GAAU6R,IAClC7R,GAAU,GAAMA,EAAS,GAEzBiL,EAAE,OAASkH,GACXa,GAAY/H,EAAGjL,CAAM,EAGjBiL,EAAE,WAAa,IACjB+H,GAAY/H,EAAGyH,EAAK,QAAU,EAAE,EAChCM,GAAY/H,EAAGyH,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,CACd,CAIH,GAAIzH,EAAE,SAAW8G,GACf,GAAI9G,EAAE,OAAO,MAAqB,CAGhC,IAFAoL,EAAMpL,EAAE,QAEDA,EAAE,SAAWA,EAAE,OAAO,MAAM,OAAS,QACtC,EAAAA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEpEzD,GAAcF,CAAI,EAClB2D,EAAMpL,EAAE,QACJA,EAAE,UAAYA,EAAE,oBAItB6H,GAAS7H,EAAGA,EAAE,OAAO,MAAMA,EAAE,OAAO,EAAI,GAAI,EAC5CA,EAAE,UAEAA,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEhEpL,EAAE,UAAYA,EAAE,OAAO,MAAM,SAC/BA,EAAE,QAAU,EACZA,EAAE,OAAS+G,GAEd,MAEC/G,EAAE,OAAS+G,GAGf,GAAI/G,EAAE,SAAW+G,GACf,GAAI/G,EAAE,OAAO,KAAoB,CAC/BoL,EAAMpL,EAAE,QAGR,EAAG,CACD,GAAIA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEpEzD,GAAcF,CAAI,EAClB2D,EAAMpL,EAAE,QACJA,EAAE,UAAYA,EAAE,kBAAkB,CACpCqL,EAAM,EACN,KACD,CAGCrL,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BqL,EAAMrL,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CqL,EAAM,EAERxD,GAAS7H,EAAGqL,CAAG,CACvB,OAAeA,IAAQ,GAEbrL,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEhEC,IAAQ,IACVrL,EAAE,QAAU,EACZA,EAAE,OAASgH,GAEd,MAEChH,EAAE,OAASgH,GAGf,GAAIhH,EAAE,SAAWgH,GACf,GAAIhH,EAAE,OAAO,QAAuB,CAClCoL,EAAMpL,EAAE,QAGR,EAAG,CACD,GAAIA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEpEzD,GAAcF,CAAI,EAClB2D,EAAMpL,EAAE,QACJA,EAAE,UAAYA,EAAE,kBAAkB,CACpCqL,EAAM,EACN,KACD,CAGCrL,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BqL,EAAMrL,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDqL,EAAM,EAERxD,GAAS7H,EAAGqL,CAAG,CACvB,OAAeA,IAAQ,GAEbrL,EAAE,OAAO,MAAQA,EAAE,QAAUoL,IAC/B3D,EAAK,MAAQ3C,EAAM2C,EAAK,MAAOzH,EAAE,YAAaA,EAAE,QAAUoL,EAAKA,CAAG,GAEhEC,IAAQ,IACVrL,EAAE,OAASiH,GAEd,MAECjH,EAAE,OAASiH,GAsBf,GAnBIjH,EAAE,SAAWiH,KACXjH,EAAE,OAAO,MACPA,EAAE,QAAU,EAAIA,EAAE,kBACpB2H,GAAcF,CAAI,EAEhBzH,EAAE,QAAU,GAAKA,EAAE,mBACrB6H,GAAS7H,EAAGyH,EAAK,MAAQ,GAAI,EAC7BI,GAAS7H,EAAIyH,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,EACbzH,EAAE,OAASkH,KAIblH,EAAE,OAASkH,IAMXlH,EAAE,UAAY,GAEhB,GADA2H,GAAcF,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAAzH,EAAE,WAAa,GACR6F,UAOA4B,EAAK,WAAa,GAAKjE,GAAK4F,CAAK,GAAK5F,GAAK2H,CAAS,GAC7D/B,IAAUzD,EACV,OAAOhS,GAAI8T,EAAMxB,CAAW,EAI9B,GAAIjG,EAAE,SAAWmH,IAAgBM,EAAK,WAAa,EACjD,OAAO9T,GAAI8T,EAAMxB,CAAW,EAK9B,GAAIwB,EAAK,WAAa,GAAKzH,EAAE,YAAc,GACxCoJ,IAAU5D,GAAcxF,EAAE,SAAWmH,GAAe,CACrD,IAAIoE,EAAUvL,EAAE,WAAaoG,EAAkByD,GAAa7J,EAAGoJ,CAAK,EACjEpJ,EAAE,WAAaqG,EAAQuD,GAAY5J,EAAGoJ,CAAK,EAC1CgB,GAAoBpK,EAAE,KAAK,EAAE,KAAKA,EAAGoJ,CAAK,EAK9C,IAHImC,IAAWjE,IAAqBiE,IAAWhE,MAC7CvH,EAAE,OAASmH,IAEToE,IAAWnE,IAAgBmE,IAAWjE,GACxC,OAAIG,EAAK,YAAc,IACrBzH,EAAE,WAAa,IAGV6F,EAST,GAAI0F,IAAWlE,KACT+B,IAAU3D,EACZpB,EAAM,UAAUrE,CAAC,EAEVoJ,IAAUxD,IAEjBvB,EAAM,iBAAiBrE,EAAG,EAAG,EAAG,EAAK,EAIjCoJ,IAAU1D,IAEZvI,GAAK6C,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjB2H,GAAcF,CAAI,EACdA,EAAK,YAAc,GACrB,OAAAzH,EAAE,WAAa,GACR6F,CAGZ,CAID,OAAIuD,IAAUzD,EAAmBE,EAC7B7F,EAAE,MAAQ,EAAY8F,GAGtB9F,EAAE,OAAS,GACb6H,GAAS7H,EAAGyH,EAAK,MAAQ,GAAI,EAC7BI,GAAS7H,EAAIyH,EAAK,OAAS,EAAK,GAAI,EACpCI,GAAS7H,EAAIyH,EAAK,OAAS,GAAM,GAAI,EACrCI,GAAS7H,EAAIyH,EAAK,OAAS,GAAM,GAAI,EACrCI,GAAS7H,EAAGyH,EAAK,SAAW,GAAI,EAChCI,GAAS7H,EAAIyH,EAAK,UAAY,EAAK,GAAI,EACvCI,GAAS7H,EAAIyH,EAAK,UAAY,GAAM,GAAI,EACxCI,GAAS7H,EAAIyH,EAAK,UAAY,GAAM,GAAI,IAIxCM,GAAY/H,EAAGyH,EAAK,QAAU,EAAE,EAChCM,GAAY/H,EAAGyH,EAAK,MAAQ,KAAM,GAGpCE,GAAcF,CAAI,EAIdzH,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAI6F,EAAOC,EACjC,CAED,SAAS0F,EAAW/D,EAAM,CACxB,IAAIlQ,EAEJ,MAAI,CAACkQ,GAAqB,CAACA,EAAK,MACvB1B,GAGTxO,EAASkQ,EAAK,MAAM,OAChBlQ,IAAWsP,IACbtP,IAAWuP,IACXvP,IAAWwP,IACXxP,IAAWyP,IACXzP,IAAW0P,IACX1P,IAAW2P,IACX3P,IAAW4P,GAEJxT,GAAI8T,EAAM1B,CAAc,GAGjC0B,EAAK,MAAQ,KAENlQ,IAAW2P,GAAavT,GAAI8T,EAAMzB,CAAY,EAAIH,GAC1D,CAOD,SAAS4F,EAAqBhE,EAAMiE,EAAY,CAC9C,IAAIC,EAAaD,EAAW,OAExB1L,EACAkJ,EAAK1W,EACLwY,EACAY,EACAC,EACA1b,GACA2b,GASJ,GAPI,CAACrE,GAAqB,CAACA,EAAK,QAIhCzH,EAAIyH,EAAK,MACTuD,EAAOhL,EAAE,KAELgL,IAAS,GAAMA,IAAS,GAAKhL,EAAE,SAAW6G,IAAe7G,EAAE,WAC7D,OAAO+F,EAmCT,IA/BIiF,IAAS,IAEXvD,EAAK,MAAQnD,EAAQmD,EAAK,MAAOiE,EAAYC,EAAY,CAAC,GAG5D3L,EAAE,KAAO,EAGL2L,GAAc3L,EAAE,SACdgL,IAAS,IAEX7N,GAAK6C,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb8L,GAAU,IAAIjP,EAAM,KAAKmD,EAAE,MAAM,EACjCnD,EAAM,SAASiP,GAASJ,EAAYC,EAAa3L,EAAE,OAAQA,EAAE,OAAQ,CAAC,EACtE0L,EAAaI,GACbH,EAAa3L,EAAE,QAGjB4L,EAAQnE,EAAK,SACboE,EAAOpE,EAAK,QACZtX,GAAQsX,EAAK,MACbA,EAAK,SAAWkE,EAChBlE,EAAK,QAAU,EACfA,EAAK,MAAQiE,EACb3C,GAAY/I,CAAC,EACNA,EAAE,WAAazC,GAAW,CAC/B2L,EAAMlJ,EAAE,SACRxN,EAAIwN,EAAE,WAAazC,EAAY,GAC/B,GAEEyC,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOkJ,EAAM3L,EAAY,CAAC,GAAKyC,EAAE,UAE1EA,EAAE,KAAKkJ,EAAMlJ,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAIkJ,EAClBA,UACO,EAAE1W,GACXwN,EAAE,SAAWkJ,EACblJ,EAAE,UAAYzC,EAAY,EAC1BwL,GAAY/I,CAAC,CACd,CACD,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAczC,EAAY,EAC7CyC,EAAE,gBAAkB,EACpByH,EAAK,QAAUoE,EACfpE,EAAK,MAAQtX,GACbsX,EAAK,SAAWmE,EAChB5L,EAAE,KAAOgL,EACFnF,CACR,CAGkBkG,OAAAA,GAAA,YAAGd,EACFc,GAAA,aAAGpB,EACHoB,GAAA,aAAGvB,EACCuB,GAAA,iBAAGxB,EACHwB,GAAA,iBAAGtB,EACZsB,GAAA,QAAGb,EACAa,GAAA,WAAGP,EACOO,GAAA,qBAAGN,EACZM,GAAA,YAAG,2FClzDtB,IAAIC,EAAM,GACNC,EAAO,GAqCX,OAAAC,GAAiB,SAAsBzE,EAAM1Y,EAAO,CAClD,IAAIkL,EACAkS,EACApI,EACAqI,EACAhB,EACApc,EAEAqd,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACA1L,EACA2L,EACAC,EACAC,EACAC,EACAC,EACAC,EAEA/e,EACA6R,EACAmN,EACAC,EAGA/c,EAAOlB,EAGXgL,EAAQwN,EAAK,MAEb0E,EAAM1E,EAAK,QACXtX,EAAQsX,EAAK,MACb1D,EAAOoI,GAAO1E,EAAK,SAAW,GAC9B2E,EAAO3E,EAAK,SACZxY,EAASwY,EAAK,OACd2D,EAAMgB,GAAQrd,EAAQ0Y,EAAK,WAC3BzY,EAAMod,GAAQ3E,EAAK,UAAY,KAE/B4E,EAAOpS,EAAM,KAEbqS,EAAQrS,EAAM,MACdsS,EAAQtS,EAAM,MACduS,EAAQvS,EAAM,MACdwS,EAAWxS,EAAM,OACjByS,EAAOzS,EAAM,KACb+G,EAAO/G,EAAM,KACb0S,EAAQ1S,EAAM,QACd2S,EAAQ3S,EAAM,SACd4S,GAAS,GAAK5S,EAAM,SAAW,EAC/B6S,GAAS,GAAK7S,EAAM,UAAY,EAMhCkT,EACA,EAAG,CACGnM,EAAO,KACT0L,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,EACR0L,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,GAGV+L,EAAOJ,EAAMD,EAAOG,CAAK,EAEzBO,EACA,OAAS,CAKP,GAJAJ,EAAKD,IAAS,GACdL,KAAUM,EACVhM,GAAQgM,EACRA,EAAMD,IAAS,GAAM,IACjBC,IAAO,EAIT/d,EAAOmd,GAAM,EAAIW,EAAO,cAEjBC,EAAK,GAAI,CAChB/e,EAAM8e,EAAO,MACbC,GAAM,GACFA,IACEhM,EAAOgM,IACTN,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,GAEV/S,GAAOye,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACVhM,GAAQgM,GAGNhM,EAAO,KACT0L,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,EACR0L,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,GAEV+L,EAAOH,EAAMF,EAAOI,CAAK,EAEzBO,EACA,OAAS,CAMP,GALAL,EAAKD,IAAS,GACdL,KAAUM,EACVhM,GAAQgM,EACRA,EAAMD,IAAS,GAAM,IAEjBC,EAAK,GAAI,CAaX,GAZAlN,EAAOiN,EAAO,MACdC,GAAM,GACFhM,EAAOgM,IACTN,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,EACJA,EAAOgM,IACTN,GAAQvc,EAAMgc,GAAK,GAAKnL,EACxBA,GAAQ,IAGZlB,GAAQ4M,GAAS,GAAKM,GAAM,EAExBlN,EAAOuM,EAAM,CACf5E,EAAK,IAAM,gCACXxN,EAAM,KAAO+R,EACb,MAAMmB,CACP,CAMD,GAJAT,KAAUM,EACVhM,GAAQgM,EAERA,EAAKZ,EAAOhB,EACRtL,EAAOkN,EAAI,CAEb,GADAA,EAAKlN,EAAOkN,EACRA,EAAKT,GACHtS,EAAM,KAAM,CACdwN,EAAK,IAAM,gCACXxN,EAAM,KAAO+R,EACb,MAAMmB,CACP,CA0BH,GAFAF,EAAO,EACPC,EAAcT,EACVD,IAAU,GAEZ,GADAS,GAAQX,EAAQU,EACZA,EAAK/e,EAAK,CACZA,GAAO+e,EACP,GACE/d,EAAOmd,GAAM,EAAIK,EAASQ,GAAM,QACzB,EAAED,GACXC,EAAOb,EAAOtM,EACdoN,EAAcje,CACf,UAEMud,EAAQQ,GAGf,GAFAC,GAAQX,EAAQE,EAAQQ,EACxBA,GAAMR,EACFQ,EAAK/e,EAAK,CACZA,GAAO+e,EACP,GACE/d,EAAOmd,GAAM,EAAIK,EAASQ,GAAM,QACzB,EAAED,GAEX,GADAC,EAAO,EACHT,EAAQve,EAAK,CACf+e,EAAKR,EACLve,GAAO+e,EACP,GACE/d,EAAOmd,GAAM,EAAIK,EAASQ,GAAM,QACzB,EAAED,GACXC,EAAOb,EAAOtM,EACdoN,EAAcje,CACf,CACF,UAGDge,GAAQT,EAAQQ,EACZA,EAAK/e,EAAK,CACZA,GAAO+e,EACP,GACE/d,EAAOmd,GAAM,EAAIK,EAASQ,GAAM,QACzB,EAAED,GACXC,EAAOb,EAAOtM,EACdoN,EAAcje,CACf,CAEH,KAAOhB,EAAM,GACXgB,EAAOmd,GAAM,EAAIc,EAAYD,GAAM,EACnChe,EAAOmd,GAAM,EAAIc,EAAYD,GAAM,EACnChe,EAAOmd,GAAM,EAAIc,EAAYD,GAAM,EACnChf,GAAO,EAELA,IACFgB,EAAOmd,GAAM,EAAIc,EAAYD,GAAM,EAC/Bhf,EAAM,IACRgB,EAAOmd,GAAM,EAAIc,EAAYD,GAAM,GAGxC,KACI,CACHA,EAAOb,EAAOtM,EACd,GACE7Q,EAAOmd,GAAM,EAAInd,EAAOge,GAAM,EAC9Bhe,EAAOmd,GAAM,EAAInd,EAAOge,GAAM,EAC9Bhe,EAAOmd,GAAM,EAAInd,EAAOge,GAAM,EAC9Bhf,GAAO,QACAA,EAAM,GACXA,IACFgB,EAAOmd,GAAM,EAAInd,EAAOge,GAAM,EAC1Bhf,EAAM,IACRgB,EAAOmd,GAAM,EAAInd,EAAOge,GAAM,GAGnC,CACF,SACSD,EAAK,GAIV,CACHvF,EAAK,IAAM,wBACXxN,EAAM,KAAO+R,EACb,MAAMmB,CACP,KARyB,CACxBJ,EAAOH,GAAOG,EAAO,QAAuBL,GAAS,GAAKM,GAAM,EAAG,EACnE,SAASK,CACV,CAOD,KACD,CACF,SACSL,EAAK,GAIV,GAAIA,EAAK,GAAI,CAEhB/S,EAAM,KAAOgS,EACb,MAAMkB,CACP,KACI,CACH1F,EAAK,IAAM,8BACXxN,EAAM,KAAO+R,EACb,MAAMmB,CACP,KAbyB,CACxBJ,EAAOJ,GAAOI,EAAO,QAAuBL,GAAS,GAAKM,GAAM,EAAG,EACnE,SAASI,CACV,CAYD,KACD,CACF,OAAQjB,EAAMpI,GAAQqI,EAAOpd,GAG9Bf,EAAM+S,GAAQ,EACdmL,GAAOle,EACP+S,GAAQ/S,GAAO,EACfye,IAAS,GAAK1L,GAAQ,EAGtByG,EAAK,QAAU0E,EACf1E,EAAK,SAAW2E,EAChB3E,EAAK,SAAY0E,EAAMpI,EAAO,GAAKA,EAAOoI,GAAO,GAAKA,EAAMpI,GAC5D0D,EAAK,UAAa2E,EAAOpd,EAAM,KAAOA,EAAMod,GAAQ,KAAOA,EAAOpd,GAClEiL,EAAM,KAAOyS,EACbzS,EAAM,KAAO+G,mDCjUf,IAAInE,EAAQC,KAERwQ,EAAU,GACVC,EAAc,IACdC,EAAe,IAGfC,EAAQ,EACRC,EAAO,EACPC,EAAQ,EAERC,EAAQ,CACV,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,EAEIC,EAAO,CACT,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,EAEIC,EAAQ,CACV,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,EAEIC,EAAO,CACT,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,EAEA,OAAAC,GAAiB,SAAuB7U,EAAM7K,EAAM2f,EAAYC,EAAOtJ,EAAOuJ,EAAaC,EAAMC,EACjG,CACE,IAAIrN,EAAOqN,EAAK,KAGZpgB,EAAM,EACNqgB,EAAM,EACNC,EAAM,EAAGC,EAAM,EACfC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EACAC,EACAC,EACAC,EACArD,EACA/K,GAAO,KACPqO,GAAa,EAEbngB,GACA8T,GAAQ,IAAIjG,EAAM,MAAMyQ,EAAU,CAAC,EACnC8B,GAAO,IAAIvS,EAAM,MAAMyQ,EAAU,CAAC,EAClCzM,GAAQ,KACRwO,GAAc,EAEdC,GAAWC,GAASC,GAkCxB,IAAKvhB,EAAM,EAAGA,GAAOqf,EAASrf,IAC5B6U,GAAM7U,CAAG,EAAI,EAEf,IAAKqgB,EAAM,EAAGA,EAAMJ,EAAOI,IACzBxL,GAAMxU,EAAK2f,EAAaK,CAAG,CAAC,IAK9B,IADAG,EAAOzN,EACFwN,EAAMlB,EAASkB,GAAO,GACrB1L,GAAM0L,CAAG,IAAM,EADSA,IAC5B,CAKF,GAHIC,EAAOD,IACTC,EAAOD,GAELA,IAAQ,EAIV,OAAA5J,EAAMuJ,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAMhDvJ,EAAMuJ,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAEhDE,EAAK,KAAO,EACL,EAET,IAAKE,EAAM,EAAGA,EAAMC,GACd1L,GAAMyL,CAAG,IAAM,EADIA,IACvB,CAQF,IANIE,EAAOF,IACTE,EAAOF,GAITK,EAAO,EACF3gB,EAAM,EAAGA,GAAOqf,EAASrf,IAG5B,GAFA2gB,IAAS,EACTA,GAAQ9L,GAAM7U,CAAG,EACb2gB,EAAO,EACT,MAAO,GAGX,GAAIA,EAAO,IAAMzV,IAASsU,GAASe,IAAQ,GACzC,MAAO,GAKT,IADAY,GAAK,CAAC,EAAI,EACLnhB,EAAM,EAAGA,EAAMqf,EAASrf,IAC3BmhB,GAAKnhB,EAAM,CAAC,EAAImhB,GAAKnhB,CAAG,EAAI6U,GAAM7U,CAAG,EAIvC,IAAKqgB,EAAM,EAAGA,EAAMJ,EAAOI,IACrBhgB,EAAK2f,EAAaK,CAAG,IAAM,IAC7BF,EAAKgB,GAAK9gB,EAAK2f,EAAaK,CAAG,CAAC,GAAG,EAAIA,GAmE3C,GA7BInV,IAASsU,GACX3M,GAAOD,GAAQuN,EACfpf,GAAM,IAEGmK,IAASuU,GAClB5M,GAAO8M,EACPuB,IAAc,IACdtO,GAAQgN,EACRwB,IAAe,IACfrgB,GAAM,MAGN8R,GAAOgN,EACPjN,GAAQkN,EACR/e,GAAM,IAIR8f,EAAO,EACPR,EAAM,EACNrgB,EAAMsgB,EACN1C,EAAOsC,EACPO,EAAOD,EACPE,EAAO,EACPM,EAAM,GACNJ,EAAO,GAAKJ,EACZS,EAAOL,EAAO,EAGT1V,IAASuU,GAAQmB,EAAOtB,GAC1BpU,IAASwU,GAASkB,EAAOrB,EAC1B,MAAO,GAIT,OAAS,CAEP8B,GAAYrhB,EAAM0gB,EACdP,EAAKE,CAAG,EAAItf,IACdugB,GAAU,EACVC,GAAWpB,EAAKE,CAAG,GAEZF,EAAKE,CAAG,EAAItf,IACnBugB,GAAU1O,GAAMwO,GAAcjB,EAAKE,CAAG,CAAC,EACvCkB,GAAW1O,GAAKqO,GAAaf,EAAKE,CAAG,CAAC,IAGtCiB,GAAU,GAAK,GACfC,GAAW,GAIbT,EAAO,GAAM9gB,EAAM0gB,EACnBK,EAAO,GAAKN,EACZH,EAAMS,EACN,GACEA,GAAQD,EACRnK,EAAMiH,GAAQiD,GAAQH,GAAQK,CAAI,EAAKM,IAAa,GAAOC,IAAW,GAAMC,GAAU,QAC/ER,IAAS,GAIlB,IADAD,EAAO,GAAM9gB,EAAM,EACZ6gB,EAAOC,GACZA,IAAS,EAWX,GATIA,IAAS,GACXD,GAAQC,EAAO,EACfD,GAAQC,GAERD,EAAO,EAITR,IACI,EAAExL,GAAM7U,CAAG,IAAM,EAAG,CACtB,GAAIA,IAAQugB,EAAO,MACnBvgB,EAAMK,EAAK2f,EAAaG,EAAKE,CAAG,CAAC,CAClC,CAGD,GAAIrgB,EAAMwgB,IAASK,EAAOI,KAAUD,EAAK,CAYvC,IAVIN,IAAS,IACXA,EAAOF,GAIT5C,GAAQ0C,EAGRG,EAAOzgB,EAAM0gB,EACbC,EAAO,GAAKF,EACLA,EAAOC,EAAOH,IACnBI,GAAQ9L,GAAM4L,EAAOC,CAAI,EACrB,EAAAC,GAAQ,KACZF,IACAE,IAAS,EAKX,GADAC,GAAQ,GAAKH,EACRvV,IAASuU,GAAQmB,EAAOtB,GAC1BpU,IAASwU,GAASkB,EAAOrB,EAC1B,MAAO,GAITyB,EAAMH,EAAOI,EAIbtK,EAAMqK,CAAG,EAAKR,GAAQ,GAAOC,GAAQ,GAAO7C,EAAOsC,EAAc,CAClE,CACF,CAKD,OAAIW,IAAS,IAIXlK,EAAMiH,EAAOiD,CAAI,EAAM7gB,EAAM0gB,GAAS,GAAO,IAAM,GAAK,GAK1DN,EAAK,KAAOI,EACL,gDChUT,IAAI5R,EAAgBC,KAChBwH,EAAgBa,KAChBL,EAAgBM,KAChBqK,EAAgBpK,KAChBqK,EAAgBnK,KAEhBkI,EAAQ,EACRC,EAAO,EACPC,EAAQ,EAWRhI,EAAkB,EAClBC,EAAkB,EAClB+J,EAAkB,EAMlB9J,EAAkB,EAClBC,EAAkB,EAClB8J,EAAkB,EAElB7J,EAAkB,GAClBC,EAAkB,GAClB6J,EAAkB,GAClB5J,EAAkB,GAIlBM,EAAc,EAOXuJ,EAAO,EACPC,EAAQ,EACRC,EAAO,EACPC,EAAK,EACLC,EAAQ,EACRC,EAAQ,EACRC,EAAO,EACPC,EAAU,EACVC,EAAO,EACPC,EAAS,GACTC,EAAO,GACHvE,EAAO,GACPwE,EAAS,GACTC,EAAS,GACTC,EAAQ,GACRC,EAAO,GACPC,EAAQ,GACRC,GAAU,GACVC,GAAW,GACPC,GAAO,GACPC,GAAM,GACNC,GAAS,GACTC,GAAO,GACPC,GAAU,GACVC,GAAQ,GACRC,GAAM,GACdC,GAAQ,GACRC,GAAS,GACTC,GAAO,GACPzF,GAAM,GACN0F,GAAM,GACNC,GAAO,GAMVpE,GAAc,IACdC,GAAe,IAGf/G,GAAY,GAEZmL,GAAYnL,GAGhB,SAASoL,GAAQC,EAAG,CAClB,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACXA,EAAI,QAAW,KACfA,EAAI,MAAS,GACxB,CAGD,SAASC,IAAe,CACtB,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EACZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EACb,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,IAAIlV,EAAM,MAAM,GAAG,EAC/B,KAAK,KAAO,IAAIA,EAAM,MAAM,GAAG,EAO/B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,CACZ,CAED,SAASmV,GAAiBvK,EAAM,CAC9B,IAAIxN,EAEJ,MAAI,CAACwN,GAAQ,CAACA,EAAK,MAAgB1B,GACnC9L,EAAQwN,EAAK,MACbA,EAAK,SAAWA,EAAK,UAAYxN,EAAM,MAAQ,EAC/CwN,EAAK,IAAM,GACPxN,EAAM,OACRwN,EAAK,MAAQxN,EAAM,KAAO,GAE5BA,EAAM,KAAO6V,EACb7V,EAAM,KAAO,EACbA,EAAM,SAAW,EACjBA,EAAM,KAAO,MACbA,EAAM,KAAO,KACbA,EAAM,KAAO,EACbA,EAAM,KAAO,EAEbA,EAAM,QAAUA,EAAM,OAAS,IAAI4C,EAAM,MAAM0Q,EAAW,EAC1DtT,EAAM,SAAWA,EAAM,QAAU,IAAI4C,EAAM,MAAM2Q,EAAY,EAE7DvT,EAAM,KAAO,EACbA,EAAM,KAAO,GAEN4L,EACR,CAED,SAASoM,GAAaxK,EAAM,CAC1B,IAAIxN,EAEJ,MAAI,CAACwN,GAAQ,CAACA,EAAK,MAAgB1B,GACnC9L,EAAQwN,EAAK,MACbxN,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACP+X,GAAiBvK,CAAI,EAE7B,CAED,SAASyK,GAAczK,EAAMoD,EAAY,CACvC,IAAIG,EACA/Q,EAmBJ,MAhBI,CAACwN,GAAQ,CAACA,EAAK,QACnBxN,EAAQwN,EAAK,MAGToD,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,IAGdG,GAAQH,GAAc,GAAK,EACvBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,KACzC9E,GAEL9L,EAAM,SAAW,MAAQA,EAAM,QAAU4Q,IAC3C5Q,EAAM,OAAS,MAIjBA,EAAM,KAAO+Q,EACb/Q,EAAM,MAAQ4Q,EACPoH,GAAaxK,CAAI,EACzB,CAED,SAAS0K,GAAa1K,EAAMoD,EAAY,CACtC,IAAI7P,EACAf,EAEJ,OAAKwN,GAGLxN,EAAQ,IAAI8X,GAIZtK,EAAK,MAAQxN,EACbA,EAAM,OAAS,KACfe,EAAMkX,GAAczK,EAAMoD,CAAU,EAChC7P,IAAQ6K,IACV4B,EAAK,MAAQ,MAERzM,GAba+K,CAcrB,CAED,SAASqM,GAAY3K,EAAM,CACzB,OAAO0K,GAAa1K,EAAMmK,EAAS,CACpC,CAaD,IAAIS,GAAS,GAETC,GAAQC,GAEZ,SAASC,GAAYvY,EAAO,CAE1B,GAAIoY,GAAQ,CACV,IAAI/D,EAOJ,IALAgE,GAAS,IAAIzV,EAAM,MAAM,GAAG,EAC5B0V,GAAU,IAAI1V,EAAM,MAAM,EAAE,EAG5ByR,EAAM,EACCA,EAAM,KAAOrU,EAAM,KAAKqU,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOrU,EAAM,KAAKqU,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOrU,EAAM,KAAKqU,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOrU,EAAM,KAAKqU,GAAK,EAAI,EAMxC,IAJAoB,EAAchC,EAAOzT,EAAM,KAAM,EAAG,IAAKqY,GAAU,EAAGrY,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAG7EqU,EAAM,EACCA,EAAM,IAAMrU,EAAM,KAAKqU,GAAK,EAAI,EAEvCoB,EAAc/B,EAAO1T,EAAM,KAAM,EAAG,GAAMsY,GAAS,EAAGtY,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAG7EoY,GAAS,EACV,CAEDpY,EAAM,QAAUqY,GAChBrY,EAAM,QAAU,EAChBA,EAAM,SAAWsY,GACjBtY,EAAM,SAAW,CAClB,CAiBD,SAASwY,GAAahL,EAAMtL,EAAKnN,EAAK8L,EAAM,CAC1C,IAAIgF,EACA7F,EAAQwN,EAAK,MAGjB,OAAIxN,EAAM,SAAW,OACnBA,EAAM,MAAQ,GAAKA,EAAM,MACzBA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EAEdA,EAAM,OAAS,IAAI4C,EAAM,KAAK5C,EAAM,KAAK,GAIvCa,GAAQb,EAAM,OAChB4C,EAAM,SAAS5C,EAAM,OAAQkC,EAAKnN,EAAMiL,EAAM,MAAOA,EAAM,MAAO,CAAC,EACnEA,EAAM,MAAQ,EACdA,EAAM,MAAQA,EAAM,QAGpB6F,EAAO7F,EAAM,MAAQA,EAAM,MACvB6F,EAAOhF,IACTgF,EAAOhF,GAGT+B,EAAM,SAAS5C,EAAM,OAAQkC,EAAKnN,EAAM8L,EAAMgF,EAAM7F,EAAM,KAAK,EAC/Da,GAAQgF,EACJhF,GAEF+B,EAAM,SAAS5C,EAAM,OAAQkC,EAAKnN,EAAM8L,EAAMA,EAAM,CAAC,EACrDb,EAAM,MAAQa,EACdb,EAAM,MAAQA,EAAM,QAGpBA,EAAM,OAAS6F,EACX7F,EAAM,QAAUA,EAAM,QAASA,EAAM,MAAQ,GAC7CA,EAAM,MAAQA,EAAM,QAASA,EAAM,OAAS6F,KAG7C,CACR,CAED,SAAS4S,EAAQjL,EAAM2B,EAAO,CAC5B,IAAInP,EACA9J,EAAOlB,EACP4c,EACA8G,EACAC,EAAMhE,EACNlC,EACA1L,EACAmL,EAAKC,EACLtR,EACAmS,GACAC,GACAH,GAAO,EACPuC,GAAWC,GAASC,GAEpBqD,GAAWC,GAASC,GACpB9kB,GACA+M,GACAgY,GAAO,IAAInW,EAAM,KAAK,CAAC,EACvBwR,GAEA7b,GAEAygB,GACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,GAAI,CAACxL,GAAQ,CAACA,EAAK,OAAS,CAACA,EAAK,QAC7B,CAACA,EAAK,OAASA,EAAK,WAAa,EACpC,OAAO1B,EAGT9L,EAAQwN,EAAK,MACTxN,EAAM,OAASgS,IAAQhS,EAAM,KAAOwW,GAIxCkC,EAAMlL,EAAK,SACXxY,EAASwY,EAAK,OACdmH,EAAOnH,EAAK,UACZoE,EAAOpE,EAAK,QACZtX,EAAQsX,EAAK,MACbmL,EAAOnL,EAAK,SACZiF,EAAOzS,EAAM,KACb+G,EAAO/G,EAAM,KAGbkS,EAAMyG,EACNxG,EAAOwC,EACP5T,GAAM6K,EAENqN,EACA,OACE,OAAQjZ,EAAM,KAAI,CAChB,KAAK6V,EACH,GAAI7V,EAAM,OAAS,EAAG,CACpBA,EAAM,KAAOwW,EACb,KACD,CAED,KAAOzP,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED,GAAK/G,EAAM,KAAO,GAAMyS,IAAS,MAAQ,CACvCzS,EAAM,MAAQ,EAEd+Y,GAAK,CAAC,EAAItG,EAAO,IACjBsG,GAAK,CAAC,EAAKtG,IAAS,EAAK,IACzBzS,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO+Y,GAAM,EAAG,CAAC,EAI3CtG,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAO8V,EACb,KACD,CAKD,GAJA9V,EAAM,MAAQ,EACVA,EAAM,OACRA,EAAM,KAAK,KAAO,IAEhB,EAAEA,EAAM,KAAO,OACdyS,EAAO,MAAoB,IAAMA,GAAQ,IAAM,GAAI,CACtDjF,EAAK,IAAM,yBACXxN,EAAM,KAAO+R,GACb,KACD,CACD,IAAKU,EAAO,MAAqBnG,EAAY,CAC3CkB,EAAK,IAAM,6BACXxN,EAAM,KAAO+R,GACb,KACD,CAMD,GAJAU,KAAU,EACV1L,GAAQ,EAER/S,IAAOye,EAAO,IAAmB,EAC7BzS,EAAM,QAAU,EAClBA,EAAM,MAAQhM,WAEPA,GAAMgM,EAAM,MAAO,CAC1BwN,EAAK,IAAM,sBACXxN,EAAM,KAAO+R,GACb,KACD,CACD/R,EAAM,KAAO,GAAKhM,GAElBwZ,EAAK,MAAQxN,EAAM,MAAQ,EAC3BA,EAAM,KAAOyS,EAAO,IAAQ6D,EAAStE,EAErCS,EAAO,EACP1L,EAAO,EAEP,MACF,KAAK+O,EAEH,KAAO/O,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAGD,GADA/G,EAAM,MAAQyS,GACTzS,EAAM,MAAQ,OAAUsM,EAAY,CACvCkB,EAAK,IAAM,6BACXxN,EAAM,KAAO+R,GACb,KACD,CACD,GAAI/R,EAAM,MAAQ,MAAQ,CACxBwN,EAAK,IAAM,2BACXxN,EAAM,KAAO+R,GACb,KACD,CACG/R,EAAM,OACRA,EAAM,KAAK,KAASyS,GAAQ,EAAK,GAE/BzS,EAAM,MAAQ,MAEhB+Y,GAAK,CAAC,EAAItG,EAAO,IACjBsG,GAAK,CAAC,EAAKtG,IAAS,EAAK,IACzBzS,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO+Y,GAAM,EAAG,CAAC,GAI7CtG,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAO+V,EAEf,KAAKA,EAEH,KAAOhP,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAEG/G,EAAM,OACRA,EAAM,KAAK,KAAOyS,GAEhBzS,EAAM,MAAQ,MAEhB+Y,GAAK,CAAC,EAAItG,EAAO,IACjBsG,GAAK,CAAC,EAAKtG,IAAS,EAAK,IACzBsG,GAAK,CAAC,EAAKtG,IAAS,GAAM,IAC1BsG,GAAK,CAAC,EAAKtG,IAAS,GAAM,IAC1BzS,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO+Y,GAAM,EAAG,CAAC,GAI7CtG,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAOgW,EAEf,KAAKA,EAEH,KAAOjP,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAEG/G,EAAM,OACRA,EAAM,KAAK,OAAUyS,EAAO,IAC5BzS,EAAM,KAAK,GAAMyS,GAAQ,GAEvBzS,EAAM,MAAQ,MAEhB+Y,GAAK,CAAC,EAAItG,EAAO,IACjBsG,GAAK,CAAC,EAAKtG,IAAS,EAAK,IACzBzS,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO+Y,GAAM,EAAG,CAAC,GAI7CtG,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAOiW,EAEf,KAAKA,EACH,GAAIjW,EAAM,MAAQ,KAAQ,CAExB,KAAO+G,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED/G,EAAM,OAASyS,EACXzS,EAAM,OACRA,EAAM,KAAK,UAAYyS,GAErBzS,EAAM,MAAQ,MAEhB+Y,GAAK,CAAC,EAAItG,EAAO,IACjBsG,GAAK,CAAC,EAAKtG,IAAS,EAAK,IACzBzS,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO+Y,GAAM,EAAG,CAAC,GAI7CtG,EAAO,EACP1L,EAAO,CAER,MACQ/G,EAAM,OACbA,EAAM,KAAK,MAAQ,MAErBA,EAAM,KAAOkW,EAEf,KAAKA,EACH,GAAIlW,EAAM,MAAQ,OAChBa,EAAOb,EAAM,OACTa,EAAO8X,IAAQ9X,EAAO8X,GACtB9X,IACEb,EAAM,OACRhM,GAAMgM,EAAM,KAAK,UAAYA,EAAM,OAC9BA,EAAM,KAAK,QAEdA,EAAM,KAAK,MAAQ,IAAI,MAAMA,EAAM,KAAK,SAAS,GAEnD4C,EAAM,SACJ5C,EAAM,KAAK,MACX9J,EACA0b,EAGA/Q,EAEA7M,EAChB,GAKgBgM,EAAM,MAAQ,MAChBA,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO9J,EAAO2K,EAAM+Q,CAAI,GAEpD+G,GAAQ9X,EACR+Q,GAAQ/Q,EACRb,EAAM,QAAUa,GAEdb,EAAM,QAAU,MAAMiZ,EAE5BjZ,EAAM,OAAS,EACfA,EAAM,KAAOmW,EAEf,KAAKA,EACH,GAAInW,EAAM,MAAQ,KAAQ,CACxB,GAAI2Y,IAAS,EAAK,MAAMM,EACxBpY,EAAO,EACP,GAEE7M,GAAMkC,EAAM0b,EAAO/Q,GAAM,EAErBb,EAAM,MAAQhM,IACbgM,EAAM,OAAS,QAClBA,EAAM,KAAK,MAAQ,OAAO,aAAahM,EAAG,SAErCA,IAAO6M,EAAO8X,GAOvB,GALI3Y,EAAM,MAAQ,MAChBA,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO9J,EAAO2K,EAAM+Q,CAAI,GAEpD+G,GAAQ9X,EACR+Q,GAAQ/Q,EACJ7M,GAAO,MAAMilB,CAClB,MACQjZ,EAAM,OACbA,EAAM,KAAK,KAAO,MAEpBA,EAAM,OAAS,EACfA,EAAM,KAAOoW,EAEf,KAAKA,EACH,GAAIpW,EAAM,MAAQ,KAAQ,CACxB,GAAI2Y,IAAS,EAAK,MAAMM,EACxBpY,EAAO,EACP,GACE7M,GAAMkC,EAAM0b,EAAO/Q,GAAM,EAErBb,EAAM,MAAQhM,IACbgM,EAAM,OAAS,QAClBA,EAAM,KAAK,SAAW,OAAO,aAAahM,EAAG,SAExCA,IAAO6M,EAAO8X,GAMvB,GALI3Y,EAAM,MAAQ,MAChBA,EAAM,MAAQ6K,EAAM7K,EAAM,MAAO9J,EAAO2K,EAAM+Q,CAAI,GAEpD+G,GAAQ9X,EACR+Q,GAAQ/Q,EACJ7M,GAAO,MAAMilB,CAClB,MACQjZ,EAAM,OACbA,EAAM,KAAK,QAAU,MAEvBA,EAAM,KAAOqW,EAEf,KAAKA,EACH,GAAIrW,EAAM,MAAQ,IAAQ,CAExB,KAAO+G,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED,GAAI0L,KAAUzS,EAAM,MAAQ,OAAS,CACnCwN,EAAK,IAAM,sBACXxN,EAAM,KAAO+R,GACb,KACD,CAEDU,EAAO,EACP1L,EAAO,CAER,CACG/G,EAAM,OACRA,EAAM,KAAK,KAASA,EAAM,OAAS,EAAK,EACxCA,EAAM,KAAK,KAAO,IAEpBwN,EAAK,MAAQxN,EAAM,MAAQ,EAC3BA,EAAM,KAAOgS,EACb,MACF,KAAKsE,EAEH,KAAOvP,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAEDyG,EAAK,MAAQxN,EAAM,MAAQ4X,GAAQnF,CAAI,EAEvCA,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAOuW,EAEf,KAAKA,EACH,GAAIvW,EAAM,WAAa,EAErB,OAAAwN,EAAK,SAAWkL,EAChBlL,EAAK,UAAYmH,EACjBnH,EAAK,QAAUoE,EACfpE,EAAK,SAAWmL,EAChB3Y,EAAM,KAAOyS,EACbzS,EAAM,KAAO+G,EAEN4O,EAETnI,EAAK,MAAQxN,EAAM,MAAQ,EAC3BA,EAAM,KAAOgS,EAEf,KAAKA,EACH,GAAI7C,IAAUxD,GAAWwD,IAAUuG,EAAW,MAAMuD,EAEtD,KAAKzC,EACH,GAAIxW,EAAM,KAAM,CAEdyS,KAAU1L,EAAO,EACjBA,GAAQA,EAAO,EAEf/G,EAAM,KAAOsX,GACb,KACD,CAED,KAAOvQ,EAAO,GAAG,CACf,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAQD,OANA/G,EAAM,KAAQyS,EAAO,EAErBA,KAAU,EACV1L,GAAQ,EAGC0L,EAAO,EAAI,CAClB,IAAK,GAGHzS,EAAM,KAAOyW,EACb,MACF,IAAK,GAKH,GAJA8B,GAAYvY,CAAK,EAGjBA,EAAM,KAAO+W,GACT5H,IAAUuG,EAAS,CAErBjD,KAAU,EACV1L,GAAQ,EAER,MAAMkS,CACP,CACD,MACF,IAAK,GAGHjZ,EAAM,KAAO4W,EACb,MACF,IAAK,GACHpJ,EAAK,IAAM,qBACXxN,EAAM,KAAO+R,EAChB,CAEDU,KAAU,EACV1L,GAAQ,EAER,MACF,KAAK0P,EAMH,IAJAhE,KAAU1L,EAAO,EACjBA,GAAQA,EAAO,EAGRA,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED,IAAK0L,EAAO,UAAcA,IAAS,GAAM,OAAS,CAChDjF,EAAK,IAAM,+BACXxN,EAAM,KAAO+R,GACb,KACD,CASD,GARA/R,EAAM,OAASyS,EAAO,MAItBA,EAAO,EACP1L,EAAO,EAEP/G,EAAM,KAAO0W,EACTvH,IAAUuG,EAAW,MAAMuD,EAEjC,KAAKvC,EACH1W,EAAM,KAAO2W,EAEf,KAAKA,EAEH,GADA9V,EAAOb,EAAM,OACTa,EAAM,CAGR,GAFIA,EAAO8X,IAAQ9X,EAAO8X,GACtB9X,EAAO8T,IAAQ9T,EAAO8T,GACtB9T,IAAS,EAAK,MAAMoY,EAExBrW,EAAM,SAAS5N,EAAQkB,EAAO0b,EAAM/Q,EAAM6X,CAAG,EAE7CC,GAAQ9X,EACR+Q,GAAQ/Q,EACR8T,GAAQ9T,EACR6X,GAAO7X,EACPb,EAAM,QAAUa,EAChB,KACD,CAEDb,EAAM,KAAOgS,EACb,MACF,KAAK4E,EAEH,KAAO7P,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAkBD,GAhBA/G,EAAM,MAAQyS,EAAO,IAAmB,IAExCA,KAAU,EACV1L,GAAQ,EAER/G,EAAM,OAASyS,EAAO,IAAmB,EAEzCA,KAAU,EACV1L,GAAQ,EAER/G,EAAM,OAASyS,EAAO,IAAmB,EAEzCA,KAAU,EACV1L,GAAQ,EAGJ/G,EAAM,KAAO,KAAOA,EAAM,MAAQ,GAAI,CACxCwN,EAAK,IAAM,sCACXxN,EAAM,KAAO+R,GACb,KACD,CAGD/R,EAAM,KAAO,EACbA,EAAM,KAAO6W,GAEf,KAAKA,GACH,KAAO7W,EAAM,KAAOA,EAAM,OAAO,CAE/B,KAAO+G,EAAO,GAAG,CACf,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED/G,EAAM,KAAKgZ,GAAMhZ,EAAM,MAAM,CAAC,EAAKyS,EAAO,EAE1CA,KAAU,EACV1L,GAAQ,CAET,CACD,KAAO/G,EAAM,KAAO,IAClBA,EAAM,KAAKgZ,GAAMhZ,EAAM,MAAM,CAAC,EAAI,EAapC,GAPAA,EAAM,QAAUA,EAAM,OACtBA,EAAM,QAAU,EAEhBoU,GAAO,CAAE,KAAMpU,EAAM,OAAO,EAC5Be,GAAM0U,EAAcjC,EAAOxT,EAAM,KAAM,EAAG,GAAIA,EAAM,QAAS,EAAGA,EAAM,KAAMoU,EAAI,EAChFpU,EAAM,QAAUoU,GAAK,KAEjBrT,GAAK,CACPyM,EAAK,IAAM,2BACXxN,EAAM,KAAO+R,GACb,KACD,CAED/R,EAAM,KAAO,EACbA,EAAM,KAAO8W,GAEf,KAAKA,GACH,KAAO9W,EAAM,KAAOA,EAAM,KAAOA,EAAM,OAAO,CAC5C,KACE8S,GAAO9S,EAAM,QAAQyS,GAAS,GAAKzS,EAAM,SAAW,CAAE,EACtDqV,GAAYvC,KAAS,GACrBwC,GAAWxC,KAAS,GAAM,IAC1ByC,GAAWzC,GAAO,MAEb,EAAAuC,IAActO,IANZ,CAQP,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CAET,CACD,GAAIwO,GAAW,GAEb9C,KAAU4C,GACVtO,GAAQsO,GAERrV,EAAM,KAAKA,EAAM,MAAM,EAAIuV,OAExB,CACH,GAAIA,KAAa,GAAI,CAGnB,IADAhd,GAAI8c,GAAY,EACTtO,EAAOxO,IAAG,CACf,GAAIogB,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAMD,GAHA0L,KAAU4C,GACVtO,GAAQsO,GAEJrV,EAAM,OAAS,EAAG,CACpBwN,EAAK,IAAM,4BACXxN,EAAM,KAAO+R,GACb,KACD,CACD/d,GAAMgM,EAAM,KAAKA,EAAM,KAAO,CAAC,EAC/Ba,EAAO,GAAK4R,EAAO,GAEnBA,KAAU,EACV1L,GAAQ,CAET,SACQwO,KAAa,GAAI,CAGxB,IADAhd,GAAI8c,GAAY,EACTtO,EAAOxO,IAAG,CACf,GAAIogB,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAGD0L,KAAU4C,GACVtO,GAAQsO,GAERrhB,GAAM,EACN6M,EAAO,GAAK4R,EAAO,GAEnBA,KAAU,EACV1L,GAAQ,CAET,KACI,CAGH,IADAxO,GAAI8c,GAAY,EACTtO,EAAOxO,IAAG,CACf,GAAIogB,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAGD0L,KAAU4C,GACVtO,GAAQsO,GAERrhB,GAAM,EACN6M,EAAO,IAAM4R,EAAO,KAEpBA,KAAU,EACV1L,GAAQ,CAET,CACD,GAAI/G,EAAM,KAAOa,EAAOb,EAAM,KAAOA,EAAM,MAAO,CAChDwN,EAAK,IAAM,4BACXxN,EAAM,KAAO+R,GACb,KACD,CACD,KAAOlR,KACLb,EAAM,KAAKA,EAAM,MAAM,EAAIhM,EAE9B,CACF,CAGD,GAAIgM,EAAM,OAAS+R,GAAO,MAG1B,GAAI/R,EAAM,KAAK,GAAG,IAAM,EAAG,CACzBwN,EAAK,IAAM,uCACXxN,EAAM,KAAO+R,GACb,KACD,CAcD,GATA/R,EAAM,QAAU,EAEhBoU,GAAO,CAAE,KAAMpU,EAAM,OAAO,EAC5Be,GAAM0U,EAAchC,EAAMzT,EAAM,KAAM,EAAGA,EAAM,KAAMA,EAAM,QAAS,EAAGA,EAAM,KAAMoU,EAAI,EAGvFpU,EAAM,QAAUoU,GAAK,KAGjBrT,GAAK,CACPyM,EAAK,IAAM,8BACXxN,EAAM,KAAO+R,GACb,KACD,CAaD,GAXA/R,EAAM,SAAW,EAGjBA,EAAM,SAAWA,EAAM,QACvBoU,GAAO,CAAE,KAAMpU,EAAM,QAAQ,EAC7Be,GAAM0U,EAAc/B,EAAO1T,EAAM,KAAMA,EAAM,KAAMA,EAAM,MAAOA,EAAM,SAAU,EAAGA,EAAM,KAAMoU,EAAI,EAGnGpU,EAAM,SAAWoU,GAAK,KAGlBrT,GAAK,CACPyM,EAAK,IAAM,wBACXxN,EAAM,KAAO+R,GACb,KACD,CAGD,GADA/R,EAAM,KAAO+W,GACT5H,IAAUuG,EAAW,MAAMuD,EAEjC,KAAKlC,GACH/W,EAAM,KAAOgX,GAEf,KAAKA,GACH,GAAI2B,GAAQ,GAAKhE,GAAQ,IAAK,CAE5BnH,EAAK,SAAWkL,EAChBlL,EAAK,UAAYmH,EACjBnH,EAAK,QAAUoE,EACfpE,EAAK,SAAWmL,EAChB3Y,EAAM,KAAOyS,EACbzS,EAAM,KAAO+G,EAEbyO,EAAahI,EAAM2E,CAAI,EAEvBuG,EAAMlL,EAAK,SACXxY,EAASwY,EAAK,OACdmH,EAAOnH,EAAK,UACZoE,EAAOpE,EAAK,QACZtX,EAAQsX,EAAK,MACbmL,EAAOnL,EAAK,SACZiF,EAAOzS,EAAM,KACb+G,EAAO/G,EAAM,KAGTA,EAAM,OAASgS,IACjBhS,EAAM,KAAO,IAEf,KACD,CAED,IADAA,EAAM,KAAO,EAEX8S,GAAO9S,EAAM,QAAQyS,GAAS,GAAKzS,EAAM,SAAW,CAAE,EACtDqV,GAAYvC,KAAS,GACrBwC,GAAWxC,KAAS,GAAM,IAC1ByC,GAAWzC,GAAO,MAEd,EAAAuC,IAAatO,IANV,CAQP,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CAET,CACD,GAAIuO,IAAY,EAAAA,GAAU,KAAa,CAIrC,IAHAsD,GAAYvD,GACZwD,GAAUvD,GACVwD,GAAWvD,GAETzC,GAAO9S,EAAM,QAAQ8Y,KACXrG,GAAS,GAAMmG,GAAYC,IAAY,IAAoCD,GAAU,EAC/FvD,GAAYvC,KAAS,GACrBwC,GAAWxC,KAAS,GAAM,IAC1ByC,GAAWzC,GAAO,MAEb,EAAA8F,GAAYvD,IAActO,IAPxB,CASP,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CAET,CAED0L,KAAUmG,GACV7R,GAAQ6R,GAER5Y,EAAM,MAAQ4Y,EACf,CAOD,GALAnG,KAAU4C,GACVtO,GAAQsO,GAERrV,EAAM,MAAQqV,GACdrV,EAAM,OAASuV,GACXD,KAAY,EAAG,CAIjBtV,EAAM,KAAOqX,GACb,KACD,CACD,GAAI/B,GAAU,GAAI,CAEhBtV,EAAM,KAAO,GACbA,EAAM,KAAOgS,EACb,KACD,CACD,GAAIsD,GAAU,GAAI,CAChB9H,EAAK,IAAM,8BACXxN,EAAM,KAAO+R,GACb,KACD,CACD/R,EAAM,MAAQsV,GAAU,GACxBtV,EAAM,KAAOiX,GAEf,KAAKA,GACH,GAAIjX,EAAM,MAAO,CAGf,IADAzH,GAAIyH,EAAM,MACH+G,EAAOxO,IAAG,CACf,GAAIogB,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED/G,EAAM,QAAUyS,GAAS,GAAKzS,EAAM,OAAS,EAE7CyS,KAAUzS,EAAM,MAChB+G,GAAQ/G,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAEDA,EAAM,IAAMA,EAAM,OAClBA,EAAM,KAAOkX,GAEf,KAAKA,GACH,KACEpE,GAAO9S,EAAM,SAASyS,GAAS,GAAKzS,EAAM,UAAY,CAAE,EACxDqV,GAAYvC,KAAS,GACrBwC,GAAWxC,KAAS,GAAM,IAC1ByC,GAAWzC,GAAO,MAEb,EAAAuC,IAActO,IANZ,CAQP,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CAET,CACD,GAAK,EAAAuO,GAAU,KAAa,CAI1B,IAHAsD,GAAYvD,GACZwD,GAAUvD,GACVwD,GAAWvD,GAETzC,GAAO9S,EAAM,SAAS8Y,KACZrG,GAAS,GAAMmG,GAAYC,IAAY,IAAoCD,GAAU,EAC/FvD,GAAYvC,KAAS,GACrBwC,GAAWxC,KAAS,GAAM,IAC1ByC,GAAWzC,GAAO,MAEb,EAAA8F,GAAYvD,IAActO,IAPxB,CASP,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CAET,CAED0L,KAAUmG,GACV7R,GAAQ6R,GAER5Y,EAAM,MAAQ4Y,EACf,CAMD,GAJAnG,KAAU4C,GACVtO,GAAQsO,GAERrV,EAAM,MAAQqV,GACVC,GAAU,GAAI,CAChB9H,EAAK,IAAM,wBACXxN,EAAM,KAAO+R,GACb,KACD,CACD/R,EAAM,OAASuV,GACfvV,EAAM,MAASsV,GAAW,GAC1BtV,EAAM,KAAOmX,GAEf,KAAKA,GACH,GAAInX,EAAM,MAAO,CAGf,IADAzH,GAAIyH,EAAM,MACH+G,EAAOxO,IAAG,CACf,GAAIogB,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED/G,EAAM,QAAUyS,GAAS,GAAKzS,EAAM,OAAS,EAE7CyS,KAAUzS,EAAM,MAChB+G,GAAQ/G,EAAM,MAEdA,EAAM,MAAQA,EAAM,KACrB,CAED,GAAIA,EAAM,OAASA,EAAM,KAAM,CAC7BwN,EAAK,IAAM,gCACXxN,EAAM,KAAO+R,GACb,KACD,CAGD/R,EAAM,KAAOoX,GAEf,KAAKA,GACH,GAAIzC,IAAS,EAAK,MAAMsE,EAExB,GADApY,EAAOsR,EAAOwC,EACV3U,EAAM,OAASa,EAAM,CAEvB,GADAA,EAAOb,EAAM,OAASa,EAClBA,EAAOb,EAAM,OACXA,EAAM,KAAM,CACdwN,EAAK,IAAM,gCACXxN,EAAM,KAAO+R,GACb,KACD,CAiBClR,EAAOb,EAAM,OACfa,GAAQb,EAAM,MACdgT,GAAOhT,EAAM,MAAQa,GAGrBmS,GAAOhT,EAAM,MAAQa,EAEnBA,EAAOb,EAAM,SAAUa,EAAOb,EAAM,QACxCiT,GAAcjT,EAAM,MACrB,MAECiT,GAAcje,EACdge,GAAO0F,EAAM1Y,EAAM,OACnBa,EAAOb,EAAM,OAEXa,EAAO8T,IAAQ9T,EAAO8T,GAC1BA,GAAQ9T,EACRb,EAAM,QAAUa,EAChB,GACE7L,EAAO0jB,GAAK,EAAIzF,GAAYD,IAAM,QAC3B,EAAEnS,GACPb,EAAM,SAAW,IAAKA,EAAM,KAAOgX,IACvC,MACF,KAAKK,GACH,GAAI1C,IAAS,EAAK,MAAMsE,EACxBjkB,EAAO0jB,GAAK,EAAI1Y,EAAM,OACtB2U,IACA3U,EAAM,KAAOgX,GACb,MACF,KAAKM,GACH,GAAItX,EAAM,KAAM,CAEd,KAAO+G,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IAEAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAaD,GAXAoL,GAAQwC,EACRnH,EAAK,WAAa2E,EAClBnS,EAAM,OAASmS,EACXA,IACF3E,EAAK,MAAQxN,EAAM,MAEdA,EAAM,MAAQ6K,EAAM7K,EAAM,MAAOhL,EAAQmd,EAAMuG,EAAMvG,CAAI,EAAI9H,EAAQrK,EAAM,MAAOhL,EAAQmd,EAAMuG,EAAMvG,CAAI,GAGjHA,EAAOwC,GAEF3U,EAAM,MAAQyS,EAAOmF,GAAQnF,CAAI,KAAOzS,EAAM,MAAO,CACxDwN,EAAK,IAAM,uBACXxN,EAAM,KAAO+R,GACb,KACD,CAEDU,EAAO,EACP1L,EAAO,CAGR,CACD/G,EAAM,KAAOuX,GAEf,KAAKA,GACH,GAAIvX,EAAM,MAAQA,EAAM,MAAO,CAE7B,KAAO+G,EAAO,IAAI,CAChB,GAAI4R,IAAS,EAAK,MAAMM,EACxBN,IACAlG,GAAQvc,EAAM0b,GAAM,GAAK7K,EACzBA,GAAQ,CACT,CAED,GAAI0L,KAAUzS,EAAM,MAAQ,YAAa,CACvCwN,EAAK,IAAM,yBACXxN,EAAM,KAAO+R,GACb,KACD,CAEDU,EAAO,EACP1L,EAAO,CAGR,CACD/G,EAAM,KAAOwX,GAEf,KAAKA,GACHzW,GAAM8K,EACN,MAAMoN,EACR,KAAKlH,GACHhR,GAAMgL,EACN,MAAMkN,EACR,KAAKxB,GACH,OAAO7B,EACT,KAAK8B,GAEL,QACE,OAAO5L,CACV,CAaH,OAAA0B,EAAK,SAAWkL,EAChBlL,EAAK,UAAYmH,EACjBnH,EAAK,QAAUoE,EACfpE,EAAK,SAAWmL,EAChB3Y,EAAM,KAAOyS,EACbzS,EAAM,KAAO+G,GAGT/G,EAAM,OAAUmS,IAAS3E,EAAK,WAAaxN,EAAM,KAAO+R,KACvC/R,EAAM,KAAOsX,IAASnI,IAAUzD,KAC/C8M,GAAahL,EAAMA,EAAK,OAAQA,EAAK,SAAU2E,EAAO3E,EAAK,SAAS,EAK1E0E,GAAO1E,EAAK,SACZ2E,GAAQ3E,EAAK,UACbA,EAAK,UAAY0E,EACjB1E,EAAK,WAAa2E,EAClBnS,EAAM,OAASmS,EACXnS,EAAM,MAAQmS,IAChB3E,EAAK,MAAQxN,EAAM,MAChBA,EAAM,MAAQ6K,EAAM7K,EAAM,MAAOhL,EAAQmd,EAAM3E,EAAK,SAAW2E,CAAI,EAAI9H,EAAQrK,EAAM,MAAOhL,EAAQmd,EAAM3E,EAAK,SAAW2E,CAAI,GAEnI3E,EAAK,UAAYxN,EAAM,MAAQA,EAAM,KAAO,GAAK,IAC9BA,EAAM,OAASgS,EAAO,IAAM,IAC5BhS,EAAM,OAAS+W,IAAQ/W,EAAM,OAAS0W,EAAQ,IAAM,IACjExE,IAAQ,GAAKC,IAAS,GAAMhD,IAAUzD,IAAa3K,KAAQ6K,IAC/D7K,GAAMiL,GAEDjL,EACR,CAED,SAASmY,EAAW1L,EAAM,CAExB,GAAI,CAACA,GAAQ,CAACA,EAAK,MACjB,OAAO1B,EAGT,IAAI9L,EAAQwN,EAAK,MACjB,OAAIxN,EAAM,SACRA,EAAM,OAAS,MAEjBwN,EAAK,MAAQ,KACN5B,CACR,CAED,SAASuN,EAAiB3L,EAAMiD,EAAM,CACpC,IAAIzQ,EAKJ,MAFI,CAACwN,GAAQ,CAACA,EAAK,QACnBxN,EAAQwN,EAAK,MACR,EAAAxN,EAAM,KAAO,IAAmB8L,GAGrC9L,EAAM,KAAOyQ,EACbA,EAAK,KAAO,GACL7E,EACR,CAED,SAASwN,EAAqB5L,EAAMiE,EAAY,CAC9C,IAAIC,EAAaD,EAAW,OAExBzR,EACAqZ,EACAtY,EAMJ,MAHI,CAACyM,GAAwB,CAACA,EAAK,QACnCxN,EAAQwN,EAAK,MAETxN,EAAM,OAAS,GAAKA,EAAM,OAASuW,GAC9BzK,EAIL9L,EAAM,OAASuW,IACjB8C,EAAS,EAETA,EAAShP,EAAQgP,EAAQ5H,EAAYC,EAAY,CAAC,EAC9C2H,IAAWrZ,EAAM,OACZ+L,GAKXhL,EAAMyX,GAAahL,EAAMiE,EAAYC,EAAYA,CAAU,EACvD3Q,GACFf,EAAM,KAAOyX,GACN7B,IAET5V,EAAM,SAAW,EAEV4L,GACR,CAEmB0N,OAAAA,GAAA,aAAGtB,GACFsB,GAAA,cAAGrB,GACAqB,GAAA,iBAAGvB,GACRuB,GAAA,YAAGnB,GACFmB,GAAA,aAAGpB,GACRoB,GAAA,QAAGb,EACAa,GAAA,WAAGJ,EACGI,GAAA,iBAAGH,EACCG,GAAA,qBAAGF,EACZE,GAAA,YAAG,iFCp/CtBC,GAAiB,CAGf,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,GAEnB,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,yDC9D5B,IAAIC,EAAS3W,KAET4W,EAAUvO,KACVwO,EAAevO,KACfwO,EAAevO,KACfmO,EAAYjO,KAEhB,QAAS9V,KAAO+jB,EACdtf,EAAQzE,CAAG,EAAI+jB,EAAU/jB,CAAG,EAI9ByE,EAAA,KAAe,EACfA,EAAA,QAAkB,EAClBA,EAAA,QAAkB,EAClBA,EAAA,KAAe,EACfA,EAAA,OAAiB,EACjBA,EAAA,WAAqB,EACrBA,EAAA,WAAqB,EACrBA,EAAA,MAAgB,EAEhB,IAAI2f,EAAkB,GAClBC,EAAkB,IAKtB,SAASC,EAAKC,EAAM,CAClB,GAAI,OAAOA,GAAS,UAAYA,EAAO9f,EAAQ,SAAW8f,EAAO9f,EAAQ,MACvE,MAAM,IAAI,UAAU,cAAc,EAGpC,KAAK,WAAa,KAClB,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,UAAY,GACjB,KAAK,MAAQ,EACb,KAAK,SAAW,EAChB,KAAK,KAAO8f,EACZ,KAAK,SAAW,EAChB,KAAK,WAAa,EAClB,KAAK,kBAAoB,GACzB,KAAK,cAAgB,GACrB,KAAK,mBAAqB,CAC3B,CAEDD,EAAK,UAAU,MAAQ,UAAY,CACjC,GAAI,KAAK,kBAAmB,CAC1B,KAAK,cAAgB,GACrB,MACD,CAED,KAAK,cAAgB,GAErBN,EAAO,KAAK,UAAW,mBAAmB,EAC1CA,EAAO,KAAK,MAAQvf,EAAQ,KAAK,EAE7B,KAAK,OAASA,EAAQ,SAAW,KAAK,OAASA,EAAQ,MAAQ,KAAK,OAASA,EAAQ,WACvFyf,EAAa,WAAW,KAAK,IAAI,GACxB,KAAK,OAASzf,EAAQ,SAAW,KAAK,OAASA,EAAQ,QAAU,KAAK,OAASA,EAAQ,YAAc,KAAK,OAASA,EAAQ,QACpI0f,EAAa,WAAW,KAAK,IAAI,EAGnC,KAAK,KAAO1f,EAAQ,KAEpB,KAAK,WAAa,IACpB,EAEA6f,EAAK,UAAU,MAAQ,SAAU3K,EAAOjZ,EAAO8jB,EAAQC,EAAQC,EAAKC,EAASC,EAAS,CACpF,OAAO,KAAK,OAAO,GAAMjL,EAAOjZ,EAAO8jB,EAAQC,EAAQC,EAAKC,EAASC,CAAO,CAC9E,EAEAN,EAAK,UAAU,UAAY,SAAU3K,EAAOjZ,EAAO8jB,EAAQC,EAAQC,EAAKC,EAASC,EAAS,CACxF,OAAO,KAAK,OAAO,GAAOjL,EAAOjZ,EAAO8jB,EAAQC,EAAQC,EAAKC,EAASC,CAAO,CAC/E,EAEAN,EAAK,UAAU,OAAS,SAAUO,EAAOlL,EAAOjZ,EAAO8jB,EAAQC,EAAQC,EAAKC,EAASC,EAAS,CAc5F,GAbAZ,EAAO,MAAM,UAAU,OAAQ,CAAC,EAEhCA,EAAO,KAAK,UAAW,mBAAmB,EAC1CA,EAAO,KAAK,OAASvf,EAAQ,KAAM,mBAAmB,EACtDuf,EAAO,MAAM,GAAO,KAAK,kBAAmB,2BAA2B,EACvEA,EAAO,MAAM,GAAO,KAAK,cAAe,kBAAkB,EAE1D,KAAK,kBAAoB,GAEzBA,EAAO,MAAM,GAAOrK,IAAU,OAAW,0BAA0B,EAEnE,KAAK,kBAAoB,GAErBA,IAAUlV,EAAQ,YAAckV,IAAUlV,EAAQ,iBAAmBkV,IAAUlV,EAAQ,cAAgBkV,IAAUlV,EAAQ,cAAgBkV,IAAUlV,EAAQ,UAAYkV,IAAUlV,EAAQ,QAC3L,MAAM,IAAI,MAAM,qBAAqB,EAiBvC,GAdI/D,GAAS,OACXA,EAAQ,OAAO,MAAM,CAAC,EACtB+jB,EAAS,EACTD,EAAS,GAGX,KAAK,KAAK,SAAWC,EACrB,KAAK,KAAK,MAAQ/jB,EAClB,KAAK,KAAK,QAAU8jB,EACpB,KAAK,KAAK,UAAYI,EACtB,KAAK,KAAK,OAASF,EACnB,KAAK,KAAK,SAAWC,EACrB,KAAK,MAAQhL,EAET,CAACkL,EAIH,OAFA,KAAK,SAAQ,EAET,KAAK,cACA,KAAK,aAEd,OAIF,IAAIpjB,EAAO,KACX,eAAQ,SAAS,UAAY,CAC3BA,EAAK,SAAQ,EACbA,EAAK,OAAM,CACf,CAAG,EAEM,IACT,EAEA6iB,EAAK,UAAU,WAAa,UAAY,CACtC,IAAIQ,EAAY,KAAK,KAAK,UACtBC,EAAW,KAAK,KAAK,SAEzB,YAAK,kBAAoB,GAElB,CAACA,EAAUD,CAAS,CAC7B,EAEAR,EAAK,UAAU,SAAW,UAAY,CACpC,IAAIU,EAA4B,KAKhC,OAAQ,KAAK,KAAI,CACf,KAAKvgB,EAAQ,QACb,KAAKA,EAAQ,KACb,KAAKA,EAAQ,WACX,KAAK,IAAMyf,EAAa,QAAQ,KAAK,KAAM,KAAK,KAAK,EACrD,MACF,KAAKzf,EAAQ,MAKX,OAJI,KAAK,KAAK,SAAW,IACvBugB,EAA4B,KAAK,KAAK,SAGhC,KAAK,mBAAkB,CAC7B,IAAK,GACH,GAAIA,IAA8B,KAChC,MAGF,GAAI,KAAK,KAAK,MAAMA,CAAyB,IAAMZ,GAIjD,GAHA,KAAK,mBAAqB,EAC1BY,IAEI,KAAK,KAAK,WAAa,EAEzB,UAEG,CACL,KAAK,KAAOvgB,EAAQ,QACpB,KACD,CAGH,IAAK,GACH,GAAIugB,IAA8B,KAChC,MAGE,KAAK,KAAK,MAAMA,CAAyB,IAAMX,GACjD,KAAK,mBAAqB,EAC1B,KAAK,KAAO5f,EAAQ,QAIpB,KAAK,KAAOA,EAAQ,QAGtB,MACF,QACE,MAAM,IAAI,MAAM,gDAAgD,CACnE,CAGH,KAAKA,EAAQ,QACb,KAAKA,EAAQ,OACb,KAAKA,EAAQ,WAiBX,IAhBA,KAAK,IAAM0f,EAAa,QAAQ,KAAK,KAAM,KAAK,KAGtD,EAAY,KAAK,MAAQ1f,EAAQ,aAAe,KAAK,aAE7C,KAAK,IAAM0f,EAAa,qBAAqB,KAAK,KAAM,KAAK,UAAU,EACnE,KAAK,MAAQ1f,EAAQ,KAEvB,KAAK,IAAM0f,EAAa,QAAQ,KAAK,KAAM,KAAK,KAAK,EAC5C,KAAK,MAAQ1f,EAAQ,eAI9B,KAAK,IAAMA,EAAQ,cAGhB,KAAK,KAAK,SAAW,GAAK,KAAK,OAASA,EAAQ,QAAU,KAAK,MAAQA,EAAQ,cAAgB,KAAK,KAAK,QAAQ,CAAC,IAAM,GAM7H,KAAK,MAAK,EACV,KAAK,IAAM0f,EAAa,QAAQ,KAAK,KAAM,KAAK,KAAK,EAEvD,MACF,QACE,MAAM,IAAI,MAAM,gBAAkB,KAAK,IAAI,CAC9C,CACH,EAEAG,EAAK,UAAU,YAAc,UAAY,CAEvC,OAAQ,KAAK,IAAG,CACd,KAAK7f,EAAQ,KACb,KAAKA,EAAQ,YACX,GAAI,KAAK,KAAK,YAAc,GAAK,KAAK,QAAUA,EAAQ,SACtD,YAAK,OAAO,wBAAwB,EAC7B,GAET,MACF,KAAKA,EAAQ,aAEX,MACF,KAAKA,EAAQ,YACX,OAAI,KAAK,YAAc,KACrB,KAAK,OAAO,oBAAoB,EAEhC,KAAK,OAAO,gBAAgB,EAEvB,GACT,QAEE,YAAK,OAAO,YAAY,EACjB,EACV,CAED,MAAO,EACT,EAEA6f,EAAK,UAAU,OAAS,UAAY,CAClC,GAAK,KAAK,cAIV,KAAIQ,EAAY,KAAK,KAAK,UACtBC,EAAW,KAAK,KAAK,SAEzB,KAAK,kBAAoB,GAGzB,KAAK,SAASA,EAAUD,CAAS,EAE7B,KAAK,eACP,KAAK,MAAK,EAEd,EAEAR,EAAK,UAAU,OAAS,SAAUvc,EAAS,CACrC,KAAK,KAAK,MACZA,EAAU,KAAK,KAAK,KAEtB,KAAK,QAAQA,EAAS,KAAK,GAG7B,EAAI,KAAK,kBAAoB,GACvB,KAAK,eACP,KAAK,MAAK,CAEd,EAEAuc,EAAK,UAAU,KAAO,SAAUlJ,EAAYD,EAAOE,EAAUC,EAAUW,EAAY,CACjF+H,EAAO,UAAU,SAAW,GAAK,UAAU,SAAW,EAAG,2DAA2D,EAEpHA,EAAO5I,GAAc,GAAKA,GAAc,GAAI,oBAAoB,EAChE4I,EAAO7I,GAAS,IAAMA,GAAS,EAAG,2BAA2B,EAE7D6I,EAAO3I,GAAY,GAAKA,GAAY,EAAG,kBAAkB,EAEzD2I,EAAO1I,IAAa7W,EAAQ,YAAc6W,IAAa7W,EAAQ,gBAAkB6W,IAAa7W,EAAQ,OAAS6W,IAAa7W,EAAQ,SAAW6W,IAAa7W,EAAQ,mBAAoB,kBAAkB,EAE1M,KAAK,MAAM0W,EAAOC,EAAYC,EAAUC,EAAUW,CAAU,EAC5D,KAAK,eAAc,CACrB,EAEAqI,EAAK,UAAU,OAAS,UAAY,CAClC,MAAM,IAAI,MAAM,6BAA6B,CAC/C,EAEAA,EAAK,UAAU,MAAQ,UAAY,CACjC,KAAK,OAAM,EACX,KAAK,eAAc,CACrB,EAEAA,EAAK,UAAU,MAAQ,SAAUnJ,EAAOC,EAAYC,EAAUC,EAAUW,EAAY,CAwBlF,OAvBA,KAAK,MAAQd,EACb,KAAK,WAAaC,EAClB,KAAK,SAAWC,EAChB,KAAK,SAAWC,EAEhB,KAAK,MAAQ7W,EAAQ,WAErB,KAAK,IAAMA,EAAQ,MAEf,KAAK,OAASA,EAAQ,MAAQ,KAAK,OAASA,EAAQ,UACtD,KAAK,YAAc,IAGjB,KAAK,OAASA,EAAQ,QACxB,KAAK,YAAc,KAGjB,KAAK,OAASA,EAAQ,YAAc,KAAK,OAASA,EAAQ,cAC5D,KAAK,WAAa,GAAK,KAAK,YAG9B,KAAK,KAAO,IAAIwf,EAER,KAAK,KAAI,CACf,KAAKxf,EAAQ,QACb,KAAKA,EAAQ,KACb,KAAKA,EAAQ,WACX,KAAK,IAAMyf,EAAa,aAAa,KAAK,KAAM,KAAK,MAAOzf,EAAQ,WAAY,KAAK,WAAY,KAAK,SAAU,KAAK,QAAQ,EAC7H,MACF,KAAKA,EAAQ,QACb,KAAKA,EAAQ,OACb,KAAKA,EAAQ,WACb,KAAKA,EAAQ,MACX,KAAK,IAAM0f,EAAa,aAAa,KAAK,KAAM,KAAK,UAAU,EAC/D,MACF,QACE,MAAM,IAAI,MAAM,gBAAkB,KAAK,IAAI,CAC9C,CAEG,KAAK,MAAQ1f,EAAQ,MACvB,KAAK,OAAO,YAAY,EAG1B,KAAK,WAAawX,EAElB,KAAK,kBAAoB,GACzB,KAAK,UAAY,EACnB,EAEAqI,EAAK,UAAU,eAAiB,UAAY,CAC1C,GAAI,KAAK,YAAc,KAMvB,QAFA,KAAK,IAAM7f,EAAQ,KAEX,KAAK,KAAI,CACf,KAAKA,EAAQ,QACb,KAAKA,EAAQ,WACX,KAAK,IAAMyf,EAAa,qBAAqB,KAAK,KAAM,KAAK,UAAU,EACvE,KAGH,CAEG,KAAK,MAAQzf,EAAQ,MACvB,KAAK,OAAO,0BAA0B,EAE1C,EAEA6f,EAAK,UAAU,OAAS,UAAY,CAGlC,OAFA,KAAK,IAAM7f,EAAQ,KAEX,KAAK,KAAI,CACf,KAAKA,EAAQ,QACb,KAAKA,EAAQ,WACb,KAAKA,EAAQ,KACX,KAAK,IAAMyf,EAAa,aAAa,KAAK,IAAI,EAC9C,MACF,KAAKzf,EAAQ,QACb,KAAKA,EAAQ,WACb,KAAKA,EAAQ,OACX,KAAK,IAAM0f,EAAa,aAAa,KAAK,IAAI,EAC9C,KAGH,CAEG,KAAK,MAAQ1f,EAAQ,MACvB,KAAK,OAAO,wBAAwB,CAExC,EAEAA,EAAA,KAAe6f,6DCtZf,IAAIW,EAAS5X,GAAkB,OAC3B6X,EAAYxP,GAAiB,EAAC,UAC9ByP,EAAUxP,KACVyP,EAAOxP,KACPoO,EAASlO,GAAiB,EAAC,GAC3BuP,EAAahY,GAAkB,WAC/BiY,EAAqB,yDAAgED,EAAW,SAAS,EAAE,EAAI,SAInHF,EAAQ,iBAAmB,EAC3BA,EAAQ,iBAAmB,GAC3BA,EAAQ,qBAAuB,GAK/BA,EAAQ,YAAc,GACtBA,EAAQ,YAAc,IACtBA,EAAQ,gBAAkB,GAAK,KAE/BA,EAAQ,eAAiB,EACzBA,EAAQ,eAAiB,EACzBA,EAAQ,mBAAqB,EAE7BA,EAAQ,YAAc,GACtBA,EAAQ,YAAc,EACtBA,EAAQ,gBAAkBA,EAAQ,sBAIlC,QADII,EAAQ,OAAO,KAAKJ,CAAO,EACtBK,EAAK,EAAGA,EAAKD,EAAM,OAAQC,IAAM,CACxC,IAAIC,EAAOF,EAAMC,CAAE,EACfC,EAAK,MAAM,IAAI,GACjB,OAAO,eAAehhB,EAASghB,EAAM,CACnC,WAAY,GAAM,MAAON,EAAQM,CAAI,EAAG,SAAU,EACxD,CAAK,CAEJ,CAgBD,QAbIhH,EAAQ,CACV,KAAM0G,EAAQ,KACd,aAAcA,EAAQ,aACtB,YAAaA,EAAQ,YACrB,QAASA,EAAQ,QACjB,eAAgBA,EAAQ,eACxB,aAAcA,EAAQ,aACtB,YAAaA,EAAQ,YACrB,YAAaA,EAAQ,YACrB,gBAAiBA,EAAQ,eAC3B,EAEIO,EAAQ,OAAO,KAAKjH,CAAK,EACpBkH,EAAK,EAAGA,EAAKD,EAAM,OAAQC,IAAM,CACxC,IAAIC,EAAOF,EAAMC,CAAE,EACnBlH,EAAMA,EAAMmH,CAAI,CAAC,EAAIA,CACtB,CAED,OAAO,eAAenhB,EAAS,QAAS,CACtC,WAAY,GAAM,MAAO,OAAO,OAAOga,CAAK,EAAG,SAAU,EAC3D,CAAC,EAEDha,EAAA,QAAkBohB,EAClBphB,EAAA,QAAkBqhB,EAClBrhB,EAAA,KAAeshB,EACfthB,EAAA,OAAiBuhB,EACjBvhB,EAAA,WAAqBwhB,EACrBxhB,EAAA,WAAqByhB,EACrBzhB,EAAA,MAAgB0hB,EAEhB1hB,EAAwB,cAAA,SAAU9C,EAAG,CACnC,OAAO,IAAIkkB,EAAQlkB,CAAC,CACtB,EAEA8C,EAAwB,cAAA,SAAU9C,EAAG,CACnC,OAAO,IAAImkB,EAAQnkB,CAAC,CACtB,EAEA8C,EAA2B,iBAAA,SAAU9C,EAAG,CACtC,OAAO,IAAIskB,EAAWtkB,CAAC,CACzB,EAEA8C,EAA2B,iBAAA,SAAU9C,EAAG,CACtC,OAAO,IAAIukB,EAAWvkB,CAAC,CACzB,EAEA8C,EAAqB,WAAA,SAAU9C,EAAG,CAChC,OAAO,IAAIokB,EAAKpkB,CAAC,CACnB,EAEA8C,EAAuB,aAAA,SAAU9C,EAAG,CAClC,OAAO,IAAIqkB,EAAOrkB,CAAC,CACrB,EAEA8C,EAAsB,YAAA,SAAU9C,EAAG,CACjC,OAAO,IAAIwkB,EAAMxkB,CAAC,CACpB,EAIA8C,EAAA,QAAkB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CAClD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIR,EAAQjH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CACvD,EAEAf,EAAA,YAAsB,SAAU2hB,EAAQxH,EAAM,CAC5C,OAAO0H,EAAe,IAAIT,EAAQjH,CAAI,EAAGwH,CAAM,CACjD,EAEA3hB,EAAA,KAAe,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CAC/C,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIN,EAAKnH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CACpD,EAEAf,EAAA,SAAmB,SAAU2hB,EAAQxH,EAAM,CACzC,OAAO0H,EAAe,IAAIP,EAAKnH,CAAI,EAAGwH,CAAM,CAC9C,EAEA3hB,EAAA,WAAqB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CACrD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIJ,EAAWrH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CAC1D,EAEAf,EAAA,eAAyB,SAAU2hB,EAAQxH,EAAM,CAC/C,OAAO0H,EAAe,IAAIL,EAAWrH,CAAI,EAAGwH,CAAM,CACpD,EAEA3hB,EAAA,MAAgB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CAChD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIF,EAAMvH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CACrD,EAEAf,EAAA,UAAoB,SAAU2hB,EAAQxH,EAAM,CAC1C,OAAO0H,EAAe,IAAIH,EAAMvH,CAAI,EAAGwH,CAAM,CAC/C,EAEA3hB,EAAA,QAAkB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CAClD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIP,EAAQlH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CACvD,EAEAf,EAAA,YAAsB,SAAU2hB,EAAQxH,EAAM,CAC5C,OAAO0H,EAAe,IAAIR,EAAQlH,CAAI,EAAGwH,CAAM,CACjD,EAEA3hB,EAAA,OAAiB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CACjD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIL,EAAOpH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CACtD,EAEAf,EAAA,WAAqB,SAAU2hB,EAAQxH,EAAM,CAC3C,OAAO0H,EAAe,IAAIN,EAAOpH,CAAI,EAAGwH,CAAM,CAChD,EAEA3hB,EAAA,WAAqB,SAAU2hB,EAAQxH,EAAMpZ,EAAU,CACrD,OAAI,OAAOoZ,GAAS,aAClBpZ,EAAWoZ,EACXA,EAAO,CAAA,GAEFyH,EAAW,IAAIH,EAAWtH,CAAI,EAAGwH,EAAQ5gB,CAAQ,CAC1D,EAEAf,EAAA,eAAyB,SAAU2hB,EAAQxH,EAAM,CAC/C,OAAO0H,EAAe,IAAIJ,EAAWtH,CAAI,EAAGwH,CAAM,CACpD,EAEA,SAASC,EAAWE,EAAQH,EAAQ5gB,EAAU,CAC5C,IAAIghB,EAAU,CAAA,EACVC,EAAQ,EAEZF,EAAO,GAAG,QAASG,CAAO,EAC1BH,EAAO,GAAG,MAAOI,CAAK,EAEtBJ,EAAO,IAAIH,CAAM,EACjBQ,IAEA,SAASA,GAAO,CAEd,QADI5Z,IACaA,GAAQuZ,EAAO,KAAM,KAA/B,MACLC,EAAQ,KAAKxZ,EAAK,EAClByZ,GAASzZ,GAAM,OAEjBuZ,EAAO,KAAK,WAAYK,CAAI,CAC7B,CAED,SAASF,EAAQxiB,GAAK,CACpBqiB,EAAO,eAAe,MAAOI,CAAK,EAClCJ,EAAO,eAAe,WAAYK,CAAI,EACtCphB,EAAStB,EAAG,CACb,CAED,SAASyiB,GAAQ,CACf,IAAItgB,GACAnC,GAAM,KAENuiB,GAASpB,EACXnhB,GAAM,IAAI,WAAWohB,CAAkB,EAEvCjf,GAAM4e,EAAO,OAAOuB,EAASC,CAAK,EAGpCD,EAAU,CAAA,EACVD,EAAO,MAAK,EACZ/gB,EAAStB,GAAKmC,EAAG,CAClB,CACF,CAED,SAASigB,EAAeC,EAAQH,EAAQ,CAGtC,GAFI,OAAOA,GAAW,WAAUA,EAASnB,EAAO,KAAKmB,CAAM,GAEvD,CAACnB,EAAO,SAASmB,CAAM,EAAG,MAAM,IAAI,UAAU,wBAAwB,EAE1E,IAAIS,EAAYN,EAAO,iBAEvB,OAAOA,EAAO,cAAcH,EAAQS,CAAS,CAC9C,CAID,SAAShB,EAAQjH,EAAM,CACrB,GAAI,EAAE,gBAAgBiH,GAAU,OAAO,IAAIA,EAAQjH,CAAI,EACvD0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,OAAO,CACtC,CAED,SAASW,EAAQlH,EAAM,CACrB,GAAI,EAAE,gBAAgBkH,GAAU,OAAO,IAAIA,EAAQlH,CAAI,EACvD0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,OAAO,CACtC,CAGD,SAASY,EAAKnH,EAAM,CAClB,GAAI,EAAE,gBAAgBmH,GAAO,OAAO,IAAIA,EAAKnH,CAAI,EACjD0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,IAAI,CACnC,CAED,SAASa,EAAOpH,EAAM,CACpB,GAAI,EAAE,gBAAgBoH,GAAS,OAAO,IAAIA,EAAOpH,CAAI,EACrD0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,MAAM,CACrC,CAGD,SAASc,EAAWrH,EAAM,CACxB,GAAI,EAAE,gBAAgBqH,GAAa,OAAO,IAAIA,EAAWrH,CAAI,EAC7D0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,UAAU,CACzC,CAED,SAASe,EAAWtH,EAAM,CACxB,GAAI,EAAE,gBAAgBsH,GAAa,OAAO,IAAIA,EAAWtH,CAAI,EAC7D0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,UAAU,CACzC,CAGD,SAASgB,EAAMvH,EAAM,CACnB,GAAI,EAAE,gBAAgBuH,GAAQ,OAAO,IAAIA,EAAMvH,CAAI,EACnD0F,EAAK,KAAK,KAAM1F,EAAMuG,EAAQ,KAAK,CACpC,CAED,SAAS2B,EAAiBC,EAAM,CAC9B,OAAOA,IAAS5B,EAAQ,YAAc4B,IAAS5B,EAAQ,iBAAmB4B,IAAS5B,EAAQ,cAAgB4B,IAAS5B,EAAQ,cAAgB4B,IAAS5B,EAAQ,UAAY4B,IAAS5B,EAAQ,OAC3L,CAOD,SAASb,EAAK1F,EAAM2F,EAAM,CACxB,IAAIyC,EAAQ,KAOZ,GALA,KAAK,MAAQpI,EAAOA,GAAQ,CAAA,EAC5B,KAAK,WAAaA,EAAK,WAAana,EAAQ,gBAE5CygB,EAAU,KAAK,KAAMtG,CAAI,EAErBA,EAAK,OAAS,CAACkI,EAAiBlI,EAAK,KAAK,EAC5C,MAAM,IAAI,MAAM,uBAAyBA,EAAK,KAAK,EAErD,GAAIA,EAAK,aAAe,CAACkI,EAAiBlI,EAAK,WAAW,EACxD,MAAM,IAAI,MAAM,uBAAyBA,EAAK,WAAW,EAM3D,GAHA,KAAK,WAAaA,EAAK,OAASuG,EAAQ,WACxC,KAAK,iBAAmB,OAAOvG,EAAK,YAAgB,IAAcA,EAAK,YAAcuG,EAAQ,SAEzFvG,EAAK,YACHA,EAAK,UAAYna,EAAQ,aAAema,EAAK,UAAYna,EAAQ,aACnE,MAAM,IAAI,MAAM,uBAAyBma,EAAK,SAAS,EAI3D,GAAIA,EAAK,aACHA,EAAK,WAAana,EAAQ,kBAAoBma,EAAK,WAAana,EAAQ,kBAC1E,MAAM,IAAI,MAAM,uBAAyBma,EAAK,UAAU,EAI5D,GAAIA,EAAK,QACHA,EAAK,MAAQna,EAAQ,aAAema,EAAK,MAAQna,EAAQ,aAC3D,MAAM,IAAI,MAAM,8BAAgCma,EAAK,KAAK,EAI9D,GAAIA,EAAK,WACHA,EAAK,SAAWna,EAAQ,gBAAkBma,EAAK,SAAWna,EAAQ,gBACpE,MAAM,IAAI,MAAM,qBAAuBma,EAAK,QAAQ,EAIxD,GAAIA,EAAK,UACHA,EAAK,UAAYna,EAAQ,YAAcma,EAAK,UAAYna,EAAQ,gBAAkBma,EAAK,UAAYna,EAAQ,OAASma,EAAK,UAAYna,EAAQ,SAAWma,EAAK,UAAYna,EAAQ,mBACnL,MAAM,IAAI,MAAM,qBAAuBma,EAAK,QAAQ,EAIxD,GAAIA,EAAK,YACH,CAACqG,EAAO,SAASrG,EAAK,UAAU,EAClC,MAAM,IAAI,MAAM,oDAAoD,EAIxE,KAAK,QAAU,IAAIuG,EAAQ,KAAKZ,CAAI,EAEpC,IAAI9iB,EAAO,KACX,KAAK,UAAY,GACjB,KAAK,QAAQ,QAAU,SAAUsG,EAASkf,EAAO,CAG/CC,EAAOzlB,CAAI,EACXA,EAAK,UAAY,GAEjB,IAAIuG,GAAQ,IAAI,MAAMD,CAAO,EAC7BC,GAAM,MAAQif,EACdjf,GAAM,KAAOvD,EAAQ,MAAMwiB,CAAK,EAChCxlB,EAAK,KAAK,QAASuG,EAAK,CAC5B,EAEE,IAAImT,EAAQ1W,EAAQ,sBAChB,OAAOma,EAAK,OAAU,WAAUzD,EAAQyD,EAAK,OAEjD,IAAItD,EAAW7W,EAAQ,mBACnB,OAAOma,EAAK,UAAa,WAAUtD,EAAWsD,EAAK,UAEvD,KAAK,QAAQ,KAAKA,EAAK,YAAcna,EAAQ,qBAAsB0W,EAAOyD,EAAK,UAAYna,EAAQ,mBAAoB6W,EAAUsD,EAAK,UAAU,EAEhJ,KAAK,QAAUqG,EAAO,YAAY,KAAK,UAAU,EACjD,KAAK,QAAU,EACf,KAAK,OAAS9J,EACd,KAAK,UAAYG,EAEjB,KAAK,KAAK,MAAO,KAAK,KAAK,EAE3B,OAAO,eAAe,KAAM,UAAW,CACrC,IAAK,UAAY,CACf,MAAO,CAAC0L,EAAM,OACf,EACD,aAAc,GACd,WAAY,EAChB,CAAG,CACF,CAED5B,EAAK,SAASd,EAAMY,CAAS,EAE7BZ,EAAK,UAAU,OAAS,SAAUnJ,EAAOG,EAAU9V,EAAU,CAC3D,GAAI2V,EAAQ1W,EAAQ,aAAe0W,EAAQ1W,EAAQ,YACjD,MAAM,IAAI,WAAW,8BAAgC0W,CAAK,EAE5D,GAAIG,GAAY7W,EAAQ,YAAc6W,GAAY7W,EAAQ,gBAAkB6W,GAAY7W,EAAQ,OAAS6W,GAAY7W,EAAQ,SAAW6W,GAAY7W,EAAQ,mBAC1J,MAAM,IAAI,UAAU,qBAAuB6W,CAAQ,EAGrD,GAAI,KAAK,SAAWH,GAAS,KAAK,YAAcG,EAAU,CACxD,IAAI7Z,EAAO,KACX,KAAK,MAAM0jB,EAAQ,aAAc,UAAY,CAC3CnB,EAAOviB,EAAK,QAAS,qBAAqB,EAC1CA,EAAK,QAAQ,OAAO0Z,EAAOG,CAAQ,EAC9B7Z,EAAK,YACRA,EAAK,OAAS0Z,EACd1Z,EAAK,UAAY6Z,EACb9V,GAAUA,IAEtB,CAAK,CACL,MACI,QAAQ,SAASA,CAAQ,CAE7B,EAEA8e,EAAK,UAAU,MAAQ,UAAY,CACjC,OAAAN,EAAO,KAAK,QAAS,qBAAqB,EACnC,KAAK,QAAQ,OACtB,EAIAM,EAAK,UAAU,OAAS,SAAU9e,EAAU,CAC1C,KAAK,WAAWyf,EAAO,MAAM,CAAC,EAAG,GAAIzf,CAAQ,CAC/C,EAEA8e,EAAK,UAAU,MAAQ,SAAU6C,EAAM3hB,EAAU,CAC/C,IAAI4hB,EAAS,KAETC,EAAK,KAAK,gBAEV,OAAOF,GAAS,YAAcA,IAAS,QAAa,CAAC3hB,KACvDA,EAAW2hB,EACXA,EAAOhC,EAAQ,cAGbkC,EAAG,MACD7hB,GAAU,QAAQ,SAASA,CAAQ,EAC9B6hB,EAAG,OACR7hB,GAAU,KAAK,KAAK,MAAOA,CAAQ,EAC9B6hB,EAAG,UACR7hB,GACF,KAAK,KAAK,QAAS,UAAY,CAC7B,OAAO4hB,EAAO,MAAMD,EAAM3hB,CAAQ,CAC1C,CAAO,GAGH,KAAK,WAAa2hB,EAClB,KAAK,MAAMlC,EAAO,MAAM,CAAC,EAAG,GAAIzf,CAAQ,EAE5C,EAEA8e,EAAK,UAAU,MAAQ,SAAU9e,EAAU,CACzC0hB,EAAO,KAAM1hB,CAAQ,EACrB,QAAQ,SAAS8hB,EAAa,IAAI,CACpC,EAEA,SAASJ,EAAOX,EAAQ/gB,EAAU,CAC5BA,GAAU,QAAQ,SAASA,CAAQ,EAGlC+gB,EAAO,UAEZA,EAAO,QAAQ,QACfA,EAAO,QAAU,KAClB,CAED,SAASe,EAAY7lB,EAAM,CACzBA,EAAK,KAAK,OAAO,CAClB,CAED6iB,EAAK,UAAU,WAAa,SAAUtX,EAAOua,EAAUC,EAAI,CACzD,IAAIX,EACAQ,EAAK,KAAK,eACVI,EAASJ,EAAG,QAAUA,EAAG,MACzB/S,EAAOmT,IAAW,CAACza,GAASqa,EAAG,SAAWra,EAAM,QAEpD,GAAIA,IAAU,MAAQ,CAACiY,EAAO,SAASjY,CAAK,EAAG,OAAOwa,EAAG,IAAI,MAAM,eAAe,CAAC,EAEnF,GAAI,CAAC,KAAK,QAAS,OAAOA,EAAG,IAAI,MAAM,qBAAqB,CAAC,EAOzDlT,EAAMuS,EAAY,KAAK,kBACzBA,EAAY,KAAK,WAGb7Z,EAAM,QAAUqa,EAAG,SACrB,KAAK,WAAa,KAAK,MAAM,OAASlC,EAAQ,aAIlD,KAAK,cAAcnY,EAAO6Z,EAAWW,CAAE,CACzC,EAEAlD,EAAK,UAAU,cAAgB,SAAUtX,EAAO6Z,EAAWW,EAAI,CAC7D,IAAIE,EAAgB1a,GAASA,EAAM,OAC/B2a,EAAiB,KAAK,WAAa,KAAK,QACxCC,EAAQ,EAERnmB,EAAO,KAEPojB,EAAQ,OAAO2C,GAAO,WAE1B,GAAI,CAAC3C,EAAO,CACV,IAAI2B,GAAU,CAAA,EACVC,GAAQ,EAERze,GACJ,KAAK,GAAG,QAAS,SAAU6B,GAAI,CAC7B7B,GAAQ6B,EACd,CAAK,EAEDma,EAAO,KAAK,QAAS,qBAAqB,EAC1C,EACE,KAAInjB,GAAM,KAAK,QAAQ,UAAUgmB,EAAW7Z,EAC5C4a,EACAF,EACA,KAAK,QACL,KAAK,QACLC,CAAc,QACP,CAAC,KAAK,WAAaniB,GAAS3E,GAAI,CAAC,EAAGA,GAAI,CAAC,CAAC,GAEnD,GAAI,KAAK,UACP,MAAMmH,GAGR,GAAIye,IAASpB,EACX,MAAA6B,EAAO,IAAI,EACL,IAAI,WAAW5B,CAAkB,EAGzC,IAAIjf,GAAM4e,EAAO,OAAOuB,GAASC,EAAK,EACtC,OAAAS,EAAO,IAAI,EAEJ7gB,EACR,CAED2d,EAAO,KAAK,QAAS,qBAAqB,EAC1C,IAAI6D,GAAM,KAAK,QAAQ,MAAMhB,EAAW7Z,EACxC4a,EACAF,EACA,KAAK,QACL,KAAK,QACLC,CAAc,EAEdE,GAAI,OAAS7a,EACb6a,GAAI,SAAWriB,GAEf,SAASA,GAASsiB,GAAcC,GAAe,CAW7C,GALI,OACF,KAAK,OAAS,KACd,KAAK,SAAW,MAGd,CAAAtmB,EAAK,UAET,KAAI0hB,GAAOwE,EAAiBI,GAG5B,GAFA/D,EAAOb,IAAQ,EAAG,yBAAyB,EAEvCA,GAAO,EAAG,CACZ,IAAIuB,GAAMjjB,EAAK,QAAQ,MAAMA,EAAK,QAASA,EAAK,QAAU0hB,EAAI,EAC9D1hB,EAAK,SAAW0hB,GAEZ0B,EACFpjB,EAAK,KAAKijB,EAAG,GAEb8B,GAAQ,KAAK9B,EAAG,EAChB+B,IAAS/B,GAAI,OAEhB,CASD,IANIqD,KAAkB,GAAKtmB,EAAK,SAAWA,EAAK,cAC9CkmB,EAAiBlmB,EAAK,WACtBA,EAAK,QAAU,EACfA,EAAK,QAAUwjB,EAAO,YAAYxjB,EAAK,UAAU,GAG/CsmB,KAAkB,EAAG,CAQvB,GAHAH,GAASF,EAAgBI,GACzBJ,EAAgBI,GAEZ,CAACjD,EAAO,MAAO,GAEnB,IAAImD,GAASvmB,EAAK,QAAQ,MAAMolB,EAAW7Z,EAAO4a,EAAOF,EAAejmB,EAAK,QAASA,EAAK,QAASA,EAAK,UAAU,EACnHumB,GAAO,SAAWxiB,GAClBwiB,GAAO,OAAShb,EAChB,MACD,CAED,GAAI,CAAC6X,EAAO,MAAO,GAGnB2C,IACD,CACH,EAEApC,EAAK,SAASS,EAASvB,CAAI,EAC3Bc,EAAK,SAASU,EAASxB,CAAI,EAC3Bc,EAAK,SAASW,EAAMzB,CAAI,EACxBc,EAAK,SAASY,EAAQ1B,CAAI,EAC1Bc,EAAK,SAASa,EAAY3B,CAAI,EAC9Bc,EAAK,SAASc,EAAY5B,CAAI,EAC9Bc,EAAK,SAASe,EAAO7B,CAAI,6EC9lBzB,IAAIc,EAAO/X,KACP4a,EAASvS,KAETwS,EAAeC,GAAc,QAAG,UAAY,CAC9CF,EAAO,KAAK,IAAI,EAEhB,KAAK,SAAW,GAChB,KAAK,UAAY,EAEjB,KAAK,OAAS,GACd,KAAK,QAAU,GAEf,KAAK,UAAY,OACjB,KAAK,SAAW,EAClB,EACA,OAAA7C,EAAK,SAAS8C,EAAaD,CAAM,EAEjCC,EAAY,UAAU,KAAO,SAAUzX,EAAQjL,EAAU,CACvD,KAAK,OAAO,KAAK,CACf,OAAQ,KAAK,IAAIiL,CAAM,EACvB,UAAWA,EAAS,EACpB,KAAMjL,CACV,CAAG,EAED,QAAQ,UACN,UAAY,CACV,KAAK,SAAQ,EAGT,KAAK,SAAW,KAAK,QAAU,KAAK,OAAO,OAAS,IACtD,KAAK,QAAU,GAEf,KAAK,KAAK,OAAO,EAEzB,GAAM,KAAK,IAAI,CACf,CACA,EAEA0iB,EAAY,UAAU,MAAQ,SAAUE,EAAMb,EAAU,CACtD,GAAI,CAAC,KAAK,SACR,YAAK,KAAK,QAAS,IAAI,MAAM,qBAAqB,CAAC,EAC5C,GAGT,IAAIc,EACJ,OAAI,OAAO,SAASD,CAAI,EACtBC,EAAaD,EAEbC,EAAa,OAAO,KAAKD,EAAMb,GAAY,KAAK,SAAS,EAG3D,KAAK,SAAS,KAAKc,CAAU,EAC7B,KAAK,WAAaA,EAAW,OAE7B,KAAK,SAAQ,EAGT,KAAK,QAAU,KAAK,OAAO,SAAW,IACxC,KAAK,QAAU,IAGV,KAAK,UAAY,CAAC,KAAK,OAChC,EAEAH,EAAY,UAAU,IAAM,SAAUE,EAAMb,EAAU,CAChDa,GACF,KAAK,MAAMA,EAAMb,CAAQ,EAG3B,KAAK,SAAW,GAGX,KAAK,WAKN,KAAK,SAAS,SAAW,EAC3B,KAAK,KAAI,GAET,KAAK,SAAS,KAAK,IAAI,EACvB,KAAK,SAAQ,GAEjB,EAEAW,EAAY,UAAU,YAAcA,EAAY,UAAU,IAE1DA,EAAY,UAAU,KAAO,UAAY,CACnC,KAAK,OAAO,OAAS,GACvB,KAAK,KAAK,QAAS,IAAI,MAAM,yBAAyB,CAAC,EAGzD,KAAK,QAAO,CACd,EAEAA,EAAY,UAAU,QAAU,UAAY,CACrC,KAAK,WAIV,KAAK,SAAW,GAChB,KAAK,OAAS,KACd,KAAK,SAAW,KAEhB,KAAK,KAAK,OAAO,EACnB,EAEAA,EAAY,UAAU,yBAA2B,SAAUI,EAAM,CAE/D,KAAK,OAAO,QAGZ,IAAIC,EAAa,KAAK,SAAS,CAAC,EAG5BA,EAAW,OAASD,EAAK,QAC3B,KAAK,WAAaA,EAAK,OACvB,KAAK,SAAS,CAAC,EAAIC,EAAW,MAAMD,EAAK,MAAM,EAE/CA,EAAK,KAAK,KAAK,KAAMC,EAAW,MAAM,EAAGD,EAAK,MAAM,CAAC,IAGrD,KAAK,WAAaC,EAAW,OAC7B,KAAK,SAAS,QAEdD,EAAK,KAAK,KAAK,KAAMC,CAAU,EAEnC,EAEAL,EAAY,UAAU,aAAe,SAAUI,EAAM,CACnD,KAAK,OAAO,QAEZ,IAAIvb,EAAM,EACNsG,EAAQ,EACR+U,EAAO,OAAO,MAAME,EAAK,MAAM,EAGnC,KAAOvb,EAAMub,EAAK,QAAQ,CACxB,IAAIjiB,EAAM,KAAK,SAASgN,GAAO,EAC3B7U,EAAM,KAAK,IAAI6H,EAAI,OAAQiiB,EAAK,OAASvb,CAAG,EAEhD1G,EAAI,KAAK+hB,EAAMrb,EAAK,EAAGvO,CAAG,EAC1BuO,GAAOvO,EAGHA,IAAQ6H,EAAI,SACd,KAAK,SAAS,EAAEgN,CAAK,EAAIhN,EAAI,MAAM7H,CAAG,EAEzC,CAGG6U,EAAQ,GACV,KAAK,SAAS,OAAO,EAAGA,CAAK,EAG/B,KAAK,WAAaiV,EAAK,OAEvBA,EAAK,KAAK,KAAK,KAAMF,CAAI,CAC3B,EAEAF,EAAY,UAAU,SAAW,UAAY,CAC3C,GAAI,CAEF,KAAO,KAAK,UAAY,GAAK,KAAK,QAAU,KAAK,OAAO,OAAS,GAAG,CAClE,IAAII,EAAO,KAAK,OAAO,CAAC,EAGxB,GAAIA,EAAK,UACP,KAAK,yBAAyBA,CAAI,UACzB,KAAK,WAAaA,EAAK,OAGhC,KAAK,aAAaA,CAAI,MAItB,MAEH,CAEG,KAAK,UAAY,CAAC,KAAK,UACzB,KAAK,KAAI,CAEZ,OAAQE,EAAI,CACX,KAAK,KAAK,QAASA,CAAE,CACtB,8FC9KH,IAAIC,EAAc,CAChB,CAEE,EAAG,CAAC,CAAC,EACL,EAAG,CAAC,CAAC,CACN,EACD,CAEE,EAAG,CAAC,CAAC,EACL,EAAG,CAAC,CAAC,CACN,EACD,CAEE,EAAG,CAAC,EAAG,CAAC,EACR,EAAG,CAAC,CAAC,CACN,EACD,CAEE,EAAG,CAAC,EAAG,CAAC,EACR,EAAG,CAAC,EAAG,CAAC,CACT,EACD,CAEE,EAAG,CAAC,EAAG,EAAG,EAAG,CAAC,EACd,EAAG,CAAC,EAAG,CAAC,CACT,EACD,CAEE,EAAG,CAAC,EAAG,EAAG,EAAG,CAAC,EACd,EAAG,CAAC,EAAG,EAAG,EAAG,CAAC,CACf,EACD,CAEE,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC1B,EAAG,CAAC,EAAG,EAAG,EAAG,CAAC,CACf,CACH,EAEA,OAAAC,GAAA,eAAyB,SAAUC,EAAOC,EAAQ,CAChD,IAAIC,EAAS,CAAA,EACTC,EAAYH,EAAQ,EACpBI,EAAYH,EAAS,EACrBI,GAAYL,EAAQG,GAAa,EACjCG,GAAYL,EAASG,GAAa,EACtC,QAASxqB,EAAI,EAAGA,EAAIkqB,EAAY,OAAQlqB,IAAK,CAC3C,IAAI2qB,EAAOT,EAAYlqB,CAAC,EACpB4qB,EAAYH,EAAWE,EAAK,EAAE,OAC9BE,EAAaH,EAAWC,EAAK,EAAE,OACnC,QAASzW,EAAI,EAAGA,EAAIyW,EAAK,EAAE,QACrBA,EAAK,EAAEzW,CAAC,EAAIqW,EADiBrW,IAE/B0W,IAKJ,QAAS1W,EAAI,EAAGA,EAAIyW,EAAK,EAAE,QACrBA,EAAK,EAAEzW,CAAC,EAAIsW,EADiBtW,IAE/B2W,IAKAD,EAAY,GAAKC,EAAa,GAChCP,EAAO,KAAK,CAAE,MAAOM,EAAW,OAAQC,EAAY,MAAO7qB,CAAC,CAAE,CAEjE,CACD,OAAOsqB,CACT,EAE4BH,GAAA,qBAAG,SAAUC,EAAO,CAC9C,OAAO,SAAUU,EAAGC,EAAGJ,EAAM,CAC3B,IAAIK,EAAiBF,EAAIZ,EAAYS,CAAI,EAAE,EAAE,OACzCM,GACAH,EAAIE,GAAkBd,EAAYS,CAAI,EAAE,EAAE,OAAU,EACtDT,EAAYS,CAAI,EAAE,EAAEK,CAAc,EAChCE,EAAiBH,EAAIb,EAAYS,CAAI,EAAE,EAAE,OACzCQ,GACAJ,EAAIG,GAAkBhB,EAAYS,CAAI,EAAE,EAAE,OAAU,EACtDT,EAAYS,CAAI,EAAE,EAAEO,CAAc,EACpC,OAAOD,EAAS,EAAIE,EAASf,EAAQ,CACzC,+CC3FcgB,GAAG,SAAwBxK,EAAMyK,EAAOC,EAAQ,CAC5D,IAAIC,EAAQ3K,EAAOyK,EAAQC,EACvBE,EAAQ,KAAK,IAAID,EAAQ3K,CAAI,EAC7B6K,EAAS,KAAK,IAAIF,EAAQF,CAAK,EAC/BK,EAAU,KAAK,IAAIH,EAAQD,CAAM,EAErC,OAAIE,GAASC,GAAUD,GAASE,EACvB9K,EAEL6K,GAAUC,EACLL,EAEFC,yDCZT,IAAIK,EAAiB7c,KACjBsc,EAAiBjU,KAErB,SAASyU,EAAaxB,EAAOyB,EAAKjY,EAAO,CACvC,IAAIkY,EAAY1B,EAAQyB,EACxB,OAAIjY,IAAU,IACZkY,EAAY,KAAK,KAAKA,GAAa,EAAIlY,EAAM,GAExCkY,CACR,CAED,IAAIC,EAAUC,GAAc,QAAG,SAAUC,EAAYC,EAAc,CACjE,IAAI9B,EAAQ6B,EAAW,MACnB5B,EAAS4B,EAAW,OACpB9B,EAAY8B,EAAW,UACvBJ,EAAMI,EAAW,IACjBrY,EAAQqY,EAAW,MAQvB,GANA,KAAK,KAAOC,EAAa,KACzB,KAAK,MAAQA,EAAa,MAC1B,KAAK,SAAWA,EAAa,SAE7B,KAAK,YAAc,EACnB,KAAK,QAAU,GACX/B,EAAW,CACb,IAAIgC,EAASR,EAAe,eAAevB,EAAOC,CAAM,EACxD,QAASrqB,EAAI,EAAGA,EAAImsB,EAAO,OAAQnsB,IACjC,KAAK,QAAQ,KAAK,CAChB,UAAW4rB,EAAaO,EAAOnsB,CAAC,EAAE,MAAO6rB,EAAKjY,CAAK,EACnD,OAAQuY,EAAOnsB,CAAC,EAAE,OAClB,UAAW,CACnB,CAAO,CAEP,MACI,KAAK,QAAQ,KAAK,CAChB,UAAW4rB,EAAaxB,EAAOyB,EAAKjY,CAAK,EACzC,OAAQyW,EACR,UAAW,CACjB,CAAK,EAOCzW,IAAU,EACZ,KAAK,aAAeiY,EACXjY,IAAU,GACnB,KAAK,aAAeiY,EAAM,EAE1B,KAAK,aAAe,CAExB,EAEA,OAAAE,EAAO,UAAU,MAAQ,UAAY,CACnC,KAAK,KACH,KAAK,QAAQ,KAAK,WAAW,EAAE,UAAY,EAC3C,KAAK,mBAAmB,KAAK,IAAI,CACrC,CACA,EAEAA,EAAO,UAAU,eAAiB,SAChCK,EACAC,EACAP,EACA,CACA,IAAIQ,EAAc,KAAK,aACnBC,EAAcD,EAAc,EAEhC,QAASxB,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAI0B,EAAUJ,EAAQ,EAAItB,CAAC,EACvB2B,EAAS3B,EAAIyB,EAAcF,EAAevB,EAAIwB,CAAW,EAAI,EACjED,EAAevB,CAAC,EAAI0B,EAAUC,CAC/B,CACH,EAEAV,EAAO,UAAU,eAAiB,SAChCK,EACAC,EACAP,EACA,CACA,IAAIY,EAAW,KAAK,UAEpB,QAAS5B,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAI0B,EAAUJ,EAAQ,EAAItB,CAAC,EACvB6B,EAAOD,EAAWA,EAAS5B,CAAC,EAAI,EACpCuB,EAAevB,CAAC,EAAI0B,EAAUG,CAC/B,CACH,EAEAZ,EAAO,UAAU,eAAiB,SAChCK,EACAC,EACAP,EACA,CACA,IAAIQ,EAAc,KAAK,aACnBC,EAAcD,EAAc,EAC5BI,EAAW,KAAK,UAEpB,QAAS5B,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAI0B,EAAUJ,EAAQ,EAAItB,CAAC,EACvB8B,EAAOF,EAAWA,EAAS5B,CAAC,EAAI,EAChC+B,EAAS/B,EAAIyB,EAAcF,EAAevB,EAAIwB,CAAW,EAAI,EAC7DQ,EAAQ,KAAK,OAAOD,EAASD,GAAQ,CAAC,EAC1CP,EAAevB,CAAC,EAAI0B,EAAUM,CAC/B,CACH,EAEAf,EAAO,UAAU,eAAiB,SAChCK,EACAC,EACAP,EACA,CACA,IAAIQ,EAAc,KAAK,aACnBC,EAAcD,EAAc,EAC5BI,EAAW,KAAK,UAEpB,QAAS5B,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAI0B,EAAUJ,EAAQ,EAAItB,CAAC,EACvBiC,EAAOL,EAAWA,EAAS5B,CAAC,EAAI,EAChCkC,EAASlC,EAAIyB,EAAcF,EAAevB,EAAIwB,CAAW,EAAI,EAC7DW,EAAWnC,EAAIyB,GAAeG,EAAWA,EAAS5B,EAAIwB,CAAW,EAAI,EACrEY,EAAQ9B,EAAe4B,EAAQD,EAAME,CAAQ,EACjDZ,EAAevB,CAAC,EAAI0B,EAAUU,CAC/B,CACH,EAEAnB,EAAO,UAAU,mBAAqB,SAAUK,EAAS,CACvD,IAAIe,EAASf,EAAQ,CAAC,EAClBC,EACAe,EAAe,KAAK,QAAQ,KAAK,WAAW,EAC5CtB,EAAYsB,EAAa,UAE7B,GAAID,IAAW,EACbd,EAAiBD,EAAQ,MAAM,EAAGN,EAAY,CAAC,MAI/C,QAFAO,EAAiB,OAAO,MAAMP,CAAS,EAE/BqB,EAAM,CACZ,IAAK,GACH,KAAK,eAAef,EAASC,EAAgBP,CAAS,EACtD,MACF,IAAK,GACH,KAAK,eAAeM,EAASC,EAAgBP,CAAS,EACtD,MACF,IAAK,GACH,KAAK,eAAeM,EAASC,EAAgBP,CAAS,EACtD,MACF,IAAK,GACH,KAAK,eAAeM,EAASC,EAAgBP,CAAS,EACtD,MACF,QACE,MAAM,IAAI,MAAM,8BAAgCqB,CAAM,CACzD,CAGH,KAAK,MAAMd,CAAc,EAEzBe,EAAa,YACTA,EAAa,WAAaA,EAAa,QACzC,KAAK,UAAY,KACjB,KAAK,cACLA,EAAe,KAAK,QAAQ,KAAK,WAAW,GAE5C,KAAK,UAAYf,EAGfe,EAEF,KAAK,KAAKA,EAAa,UAAY,EAAG,KAAK,mBAAmB,KAAK,IAAI,CAAC,GAExE,KAAK,UAAY,KACjB,KAAK,SAAQ,iEC5KjB,IAAIvG,EAAO/X,KACP6a,EAAcxS,KACd4U,EAAS3U,KAETiW,EAAeC,GAAA,QAAiB,SAAUrB,EAAY,CACxDtC,EAAY,KAAK,IAAI,EAErB,IAAI1B,EAAU,CAAA,EACV/c,EAAO,KACX,KAAK,QAAU,IAAI6gB,EAAOE,EAAY,CACpC,KAAM,KAAK,KAAK,KAAK,IAAI,EACzB,MAAO,SAAUpE,EAAQ,CACvBI,EAAQ,KAAKJ,CAAM,CACpB,EACD,SAAU,UAAY,CACpB3c,EAAK,KAAK,WAAY,OAAO,OAAO+c,CAAO,CAAC,CAC7C,CACL,CAAG,EAED,KAAK,QAAQ,OACf,EACA,OAAApB,EAAK,SAASwG,EAAa1D,CAAW,sECrBtCnE,GAAiB,CACf,cAAe,CAAC,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAI,EAE9D,UAAW,WACX,UAAW,WACX,UAAW,WACX,UAAW,WACX,UAAW,WACX,UAAW,WAGX,oBAAqB,EACrB,kBAAmB,EACnB,gBAAiB,EACjB,gBAAiB,EAGjB,wBAAyB,EACzB,sBAAuB,EAEvB,qBAAsB,CACpB,EAAG,EACH,EAAG,EACH,EAAG,EACH,EAAG,EACH,EAAG,CACJ,EAED,eAAgB,2EC5BlB,IAAI3O,EAAW,CAAA,GAEd,UAAY,CACX,QAAS7W,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,IAAIutB,EAAavtB,EACjB,QAASkU,EAAI,EAAGA,EAAI,EAAGA,IACjBqZ,EAAa,EACfA,EAAa,WAAcA,IAAe,EAE1CA,EAAaA,IAAe,EAGhC1W,EAAS7W,CAAC,EAAIutB,CACf,CACH,KAEA,IAAIC,EAAiBC,GAAc,QAAG,UAAY,CAChD,KAAK,KAAO,EACd,EAEA,OAAAD,EAAc,UAAU,MAAQ,SAAU3D,EAAM,CAC9C,QAAS,EAAI,EAAG,EAAIA,EAAK,OAAQ,IAC/B,KAAK,KAAOhT,GAAU,KAAK,KAAOgT,EAAK,CAAC,GAAK,GAAI,EAAK,KAAK,OAAS,EAEtE,MAAO,EACT,EAEA2D,EAAc,UAAU,MAAQ,UAAY,CAC1C,OAAO,KAAK,KAAO,EACrB,EAEAA,EAAc,MAAQ,SAAU1lB,EAAK,CACnC,IAAIiP,EAAM,GACV,QAAS/W,EAAI,EAAGA,EAAI8H,EAAI,OAAQ9H,IAC9B+W,EAAMF,GAAUE,EAAMjP,EAAI9H,CAAC,GAAK,GAAI,EAAK+W,IAAQ,EAEnD,OAAOA,EAAM,iECpCf,IAAIyO,EAAY1W,KACZ0e,EAAgBrW,KAEhBuW,EAAUC,GAAc,QAAG,SAAUjlB,EAASwjB,EAAc,CAC9D,KAAK,SAAWxjB,EAChBA,EAAQ,SAAWA,EAAQ,WAAa,GAExC,KAAK,SAAW,GAChB,KAAK,SAAW,GAChB,KAAK,wBAA0B,GAG/B,KAAK,SAAW,GAChB,KAAK,WAAa,EAElB,KAAK,QAAU,GACf,KAAK,QAAQ8c,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAC9D,KAAK,QAAQA,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAC9D,KAAK,QAAQA,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAC9D,KAAK,QAAQA,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAC9D,KAAK,QAAQA,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAC9D,KAAK,QAAQA,EAAU,SAAS,EAAI,KAAK,YAAY,KAAK,IAAI,EAE9D,KAAK,KAAO0G,EAAa,KACzB,KAAK,MAAQA,EAAa,MAC1B,KAAK,SAAWA,EAAa,SAC7B,KAAK,MAAQA,EAAa,MAC1B,KAAK,WAAaA,EAAa,WAC/B,KAAK,QAAUA,EAAa,QAC5B,KAAK,OAASA,EAAa,OAC3B,KAAK,YAAcA,EAAa,YAChC,KAAK,SAAWA,EAAa,SAC7B,KAAK,mBAAqBA,EAAa,mBACvC,KAAK,gBAAkBA,EAAa,iBAAmB,UAAY,CAAA,CACrE,EAEA,OAAAwB,EAAO,UAAU,MAAQ,UAAY,CACnC,KAAK,KAAKlI,EAAU,cAAc,OAAQ,KAAK,gBAAgB,KAAK,IAAI,CAAC,CAC3E,EAEAkI,EAAO,UAAU,gBAAkB,SAAU7D,EAAM,CACjD,IAAI+D,EAAYpI,EAAU,cAE1B,QAASxlB,EAAI,EAAGA,EAAI4tB,EAAU,OAAQ5tB,IACpC,GAAI6pB,EAAK7pB,CAAC,IAAM4tB,EAAU5tB,CAAC,EAAG,CAC5B,KAAK,MAAM,IAAI,MAAM,wBAAwB,CAAC,EAC9C,MACD,CAEH,KAAK,KAAK,EAAG,KAAK,iBAAiB,KAAK,IAAI,CAAC,CAC/C,EAEA0tB,EAAO,UAAU,iBAAmB,SAAU7D,EAAM,CAElD,IAAI3X,EAAS2X,EAAK,aAAa,CAAC,EAG5B1e,EAAO0e,EAAK,aAAa,CAAC,EAC1BrjB,EAAO,GACX,QAASxG,EAAI,EAAGA,EAAI,EAAGA,IACrBwG,GAAQ,OAAO,aAAaqjB,EAAK7pB,CAAC,CAAC,EAMrC,IAAI6tB,EAAY,GAAQhE,EAAK,CAAC,EAAI,IAIlC,GAAI,CAAC,KAAK,UAAY1e,IAASqa,EAAU,UAAW,CAClD,KAAK,MAAM,IAAI,MAAM,4BAA4B,CAAC,EAClD,MACD,CAKD,GAHA,KAAK,KAAO,IAAIgI,EAChB,KAAK,KAAK,MAAM,OAAO,KAAKhnB,CAAI,CAAC,EAE7B,KAAK,QAAQ2E,CAAI,EACnB,OAAO,KAAK,QAAQA,CAAI,EAAE+G,CAAM,EAGlC,GAAI,CAAC2b,EAAW,CACd,KAAK,MAAM,IAAI,MAAM,mCAAqCrnB,CAAI,CAAC,EAC/D,MACD,CAED,KAAK,KAAK0L,EAAS,EAAG,KAAK,WAAW,KAAK,IAAI,CAAC,CAClD,EAEAwb,EAAO,UAAU,WAAa,UAAoB,CAChD,KAAK,KAAK,EAAG,KAAK,iBAAiB,KAAK,IAAI,CAAC,CAC/C,EAEAA,EAAO,UAAU,gBAAkB,UAAY,CAC7C,KAAK,KAAK,EAAG,KAAK,eAAe,KAAK,IAAI,CAAC,CAC7C,EAEAA,EAAO,UAAU,eAAiB,SAAU7D,EAAM,CAChD,IAAIiE,EAAUjE,EAAK,YAAY,CAAC,EAC5BkE,EAAU,KAAK,KAAK,MAAK,EAG7B,GAAI,KAAK,SAAS,UAAYA,IAAYD,EAAS,CACjD,KAAK,MAAM,IAAI,MAAM,eAAiBA,EAAU,MAAQC,CAAO,CAAC,EAChE,MACD,CAEI,KAAK,UACR,KAAK,KAAK,EAAG,KAAK,iBAAiB,KAAK,IAAI,CAAC,CAEjD,EAEAL,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC/C,KAAK,KAAKA,EAAQ,KAAK,WAAW,KAAK,IAAI,CAAC,CAC9C,EACAwb,EAAO,UAAU,WAAa,SAAU7D,EAAM,CAC5C,KAAK,KAAK,MAAMA,CAAI,EAEpB,IAAIO,EAAQP,EAAK,aAAa,CAAC,EAC3BQ,EAASR,EAAK,aAAa,CAAC,EAC5BjW,EAAQiW,EAAK,CAAC,EACdmE,EAAYnE,EAAK,CAAC,EAClBoE,EAAQpE,EAAK,EAAE,EACfsD,EAAStD,EAAK,EAAE,EAChBM,EAAYN,EAAK,EAAE,EAOvB,GACEjW,IAAU,GACVA,IAAU,GACVA,IAAU,GACVA,IAAU,GACVA,IAAU,GACV,CACA,KAAK,MAAM,IAAI,MAAM,yBAA2BA,CAAK,CAAC,EACtD,MACD,CACD,GAAI,EAAEoa,KAAaxI,EAAU,sBAAuB,CAClD,KAAK,MAAM,IAAI,MAAM,wBAAwB,CAAC,EAC9C,MACD,CACD,GAAIyI,IAAU,EAAG,CACf,KAAK,MAAM,IAAI,MAAM,gCAAgC,CAAC,EACtD,MACD,CACD,GAAId,IAAW,EAAG,CAChB,KAAK,MAAM,IAAI,MAAM,2BAA2B,CAAC,EACjD,MACD,CACD,GAAIhD,IAAc,GAAKA,IAAc,EAAG,CACtC,KAAK,MAAM,IAAI,MAAM,8BAA8B,CAAC,EACpD,MACD,CAED,KAAK,WAAa6D,EAElB,IAAInC,EAAMrG,EAAU,qBAAqB,KAAK,UAAU,EAExD,KAAK,SAAW,GAEhB,KAAK,SAAS,CACZ,MAAO4E,EACP,OAAQC,EACR,MAAOzW,EACP,UAAW,EAAQuW,EACnB,QAAS,GAAQ6D,EAAYxI,EAAU,mBACvC,MAAO,GAAQwI,EAAYxI,EAAU,iBACrC,MAAO,GAAQwI,EAAYxI,EAAU,iBACrC,IAAKqG,EACL,UAAWmC,CACf,CAAG,EAED,KAAK,gBAAe,CACtB,EAEAN,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC/C,KAAK,KAAKA,EAAQ,KAAK,WAAW,KAAK,IAAI,CAAC,CAC9C,EACAwb,EAAO,UAAU,WAAa,SAAU7D,EAAM,CAC5C,KAAK,KAAK,MAAMA,CAAI,EAEpB,IAAIqE,EAAU,KAAK,MAAMrE,EAAK,OAAS,CAAC,EAGxC,QAAS7pB,EAAI,EAAGA,EAAIkuB,EAASluB,IAC3B,KAAK,SAAS,KAAK,CAAC6pB,EAAK7pB,EAAI,CAAC,EAAG6pB,EAAK7pB,EAAI,EAAI,CAAC,EAAG6pB,EAAK7pB,EAAI,EAAI,CAAC,EAAG,GAAI,CAAC,EAG1E,KAAK,QAAQ,KAAK,QAAQ,EAE1B,KAAK,gBAAe,CACtB,EAEA0tB,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC/C,KAAK,mBAAkB,EACvB,KAAK,KAAKA,EAAQ,KAAK,WAAW,KAAK,IAAI,CAAC,CAC9C,EACAwb,EAAO,UAAU,WAAa,SAAU7D,EAAM,CAI5C,GAHA,KAAK,KAAK,MAAMA,CAAI,EAGhB,KAAK,aAAerE,EAAU,wBAAyB,CACzD,GAAI,KAAK,SAAS,SAAW,EAAG,CAC9B,KAAK,MAAM,IAAI,MAAM,0CAA0C,CAAC,EAChE,MACD,CACD,GAAIqE,EAAK,OAAS,KAAK,SAAS,OAAQ,CACtC,KAAK,MAAM,IAAI,MAAM,2CAA2C,CAAC,EACjE,MACD,CACD,QAAS7pB,EAAI,EAAGA,EAAI6pB,EAAK,OAAQ7pB,IAC/B,KAAK,SAASA,CAAC,EAAE,CAAC,EAAI6pB,EAAK7pB,CAAC,EAE9B,KAAK,QAAQ,KAAK,QAAQ,CAC3B,CAIG,KAAK,aAAewlB,EAAU,qBAEhC,KAAK,WAAW,CAACqE,EAAK,aAAa,CAAC,CAAC,CAAC,EAEpC,KAAK,aAAerE,EAAU,iBAChC,KAAK,WAAW,CACdqE,EAAK,aAAa,CAAC,EACnBA,EAAK,aAAa,CAAC,EACnBA,EAAK,aAAa,CAAC,CACzB,CAAK,EAGH,KAAK,gBAAe,CACtB,EAEA6D,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC/C,KAAK,KAAKA,EAAQ,KAAK,WAAW,KAAK,IAAI,CAAC,CAC9C,EACAwb,EAAO,UAAU,WAAa,SAAU7D,EAAM,CAC5C,KAAK,KAAK,MAAMA,CAAI,EACpB,KAAK,MAAMA,EAAK,aAAa,CAAC,EAAIrE,EAAU,cAAc,EAE1D,KAAK,gBAAe,CACtB,EAEAkI,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC1C,KAAK,0BACR,KAAK,wBAA0B,GAC/B,KAAK,gBAAe,GAEtB,KAAK,KAAK,CAACA,EAAQ,KAAK,WAAW,KAAK,KAAMA,CAAM,CAAC,CACvD,EACAwb,EAAO,UAAU,WAAa,SAAUxb,EAAQ2X,EAAM,CAGpD,GAFA,KAAK,KAAK,MAAMA,CAAI,EAGlB,KAAK,aAAerE,EAAU,yBAC9B,KAAK,SAAS,SAAW,EAEzB,MAAM,IAAI,MAAM,4BAA4B,EAG9C,KAAK,YAAYqE,CAAI,EACrB,IAAIsE,EAAiBjc,EAAS2X,EAAK,OAE/BsE,EAAiB,EACnB,KAAK,YAAYA,CAAc,EAE/B,KAAK,gBAAe,CAExB,EAEAT,EAAO,UAAU,YAAc,SAAUxb,EAAQ,CAC/C,KAAK,KAAKA,EAAQ,KAAK,WAAW,KAAK,IAAI,CAAC,CAC9C,EACAwb,EAAO,UAAU,WAAa,SAAU7D,EAAM,CAC5C,KAAK,KAAK,MAAMA,CAAI,EAEpB,KAAK,SAAW,GAChB,KAAK,gBAAe,EAEhB,KAAK,UACP,KAAK,SAAQ,8DC7RjB,IAAI8B,EAAiB7c,KAEjBsf,EAAiB,CAEnB,UAAY,CAAE,EAId,SAAUC,EAAQxE,EAAMyE,EAAOC,EAAQ,CACrC,GAAIA,IAAW1E,EAAK,OAClB,MAAM,IAAI,MAAM,iBAAiB,EAGnC,IAAI2E,EAAQ3E,EAAK0E,CAAM,EACvBF,EAAOC,CAAK,EAAIE,EAChBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAI,GACrB,EAID,SAAUD,EAAQxE,EAAMyE,EAAOC,EAAQ,CACrC,GAAIA,EAAS,GAAK1E,EAAK,OACrB,MAAM,IAAI,MAAM,iBAAiB,EAGnC,IAAI2E,EAAQ3E,EAAK0E,CAAM,EACvBF,EAAOC,CAAK,EAAIE,EAChBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,CACpC,EAID,SAAUF,EAAQxE,EAAMyE,EAAOC,EAAQ,CACrC,GAAIA,EAAS,GAAK1E,EAAK,OACrB,MAAM,IAAI,MAAM,iBAAiB,EAGnCwE,EAAOC,CAAK,EAAIzE,EAAK0E,CAAM,EAC3BF,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,EACnCF,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,EACnCF,EAAOC,EAAQ,CAAC,EAAI,GACrB,EAID,SAAUD,EAAQxE,EAAMyE,EAAOC,EAAQ,CACrC,GAAIA,EAAS,GAAK1E,EAAK,OACrB,MAAM,IAAI,MAAM,iBAAiB,EAGnCwE,EAAOC,CAAK,EAAIzE,EAAK0E,CAAM,EAC3BF,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,EACnCF,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,EACnCF,EAAOC,EAAQ,CAAC,EAAIzE,EAAK0E,EAAS,CAAC,CACpC,CACH,EAEIE,EAAuB,CAEzB,UAAY,CAAE,EAId,SAAUJ,EAAQK,EAAWJ,EAAOK,EAAQ,CAC1C,IAAIH,EAAQE,EAAU,CAAC,EACvBL,EAAOC,CAAK,EAAIE,EAChBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIK,CACrB,EAID,SAAUN,EAAQK,EAAWJ,EAAO,CAClC,IAAIE,EAAQE,EAAU,CAAC,EACvBL,EAAOC,CAAK,EAAIE,EAChBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAIE,EACpBH,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,CAChC,EAID,SAAUL,EAAQK,EAAWJ,EAAOK,EAAQ,CAC1CN,EAAOC,CAAK,EAAII,EAAU,CAAC,EAC3BL,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,EAC/BL,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,EAC/BL,EAAOC,EAAQ,CAAC,EAAIK,CACrB,EAID,SAAUN,EAAQK,EAAWJ,EAAO,CAClCD,EAAOC,CAAK,EAAII,EAAU,CAAC,EAC3BL,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,EAC/BL,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,EAC/BL,EAAOC,EAAQ,CAAC,EAAII,EAAU,CAAC,CAChC,CACH,EAEA,SAASE,EAAa/E,EAAMjW,EAAO,CACjC,IAAIib,EAAW,CAAA,EACX7uB,EAAI,EAER,SAAS6I,GAAQ,CACf,GAAI7I,IAAM6pB,EAAK,OACb,MAAM,IAAI,MAAM,iBAAiB,EAEnC,IAAIiF,EAAOjF,EAAK7pB,CAAC,EACjBA,IACA,IAAI+uB,EAAOC,EAAOC,EAAOC,EAAOC,EAAOC,EAAOC,EAAOC,EACrD,OAAQ1b,EAAK,CACX,QACE,MAAM,IAAI,MAAM,oBAAoB,EACtC,IAAK,IACHyb,EAAQxF,EAAK7pB,CAAC,EACdA,IACA6uB,EAAS,MAAMC,GAAQ,GAAKO,CAAK,EACjC,MACF,IAAK,GACHA,EAAQP,EAAO,GACfQ,EAAQR,GAAQ,EAChBD,EAAS,KAAKS,EAAOD,CAAK,EAC1B,MACF,IAAK,GACHF,EAAQL,EAAO,EACfM,EAASN,GAAQ,EAAK,EACtBO,EAASP,GAAQ,EAAK,EACtBQ,EAASR,GAAQ,EAAK,EACtBD,EAAS,KAAKS,EAAOD,EAAOD,EAAOD,CAAK,EACxC,MACF,IAAK,GACHJ,EAAQD,EAAO,EACfE,EAASF,GAAQ,EAAK,EACtBG,EAASH,GAAQ,EAAK,EACtBI,EAASJ,GAAQ,EAAK,EACtBK,EAASL,GAAQ,EAAK,EACtBM,EAASN,GAAQ,EAAK,EACtBO,EAASP,GAAQ,EAAK,EACtBQ,EAASR,GAAQ,EAAK,EACtBD,EAAS,KAAKS,EAAOD,EAAOD,EAAOD,EAAOD,EAAOD,EAAOD,EAAOD,CAAK,EACpE,KACH,CACF,CAED,MAAO,CACL,IAAK,SAAUja,EAAO,CACpB,KAAO+Z,EAAS,OAAS/Z,GACvBjM,IAEF,IAAI0mB,EAAWV,EAAS,MAAM,EAAG/Z,CAAK,EACtC,OAAA+Z,EAAWA,EAAS,MAAM/Z,CAAK,EACxBya,CACR,EACD,eAAgB,UAAY,CAC1BV,EAAS,OAAS,CACnB,EACD,IAAK,UAAY,CACf,GAAI7uB,IAAM6pB,EAAK,OACb,MAAM,IAAI,MAAM,kBAAkB,CAErC,CACL,CACC,CAED,SAAS2F,EAAaC,EAAOpB,EAAQqB,EAAU7D,EAAKhC,EAAM0E,EAAQ,CAEhE,IAAIoB,EAAaF,EAAM,MACnBG,EAAcH,EAAM,OACpBI,EAAYJ,EAAM,MACtB,QAAS1E,EAAI,EAAGA,EAAI6E,EAAa7E,IAC/B,QAASD,EAAI,EAAGA,EAAI6E,EAAY7E,IAAK,CACnC,IAAIwD,EAAQoB,EAAS5E,EAAGC,EAAG8E,CAAS,EACpCzB,EAAevC,CAAG,EAAEwC,EAAQxE,EAAMyE,EAAOC,CAAM,EAC/CA,GAAU1C,CACX,CAEH,OAAO0C,CACR,CAED,SAASuB,EAAkBL,EAAOpB,EAAQqB,EAAU7D,EAAK7Y,EAAM2b,EAAQ,CAErE,IAAIgB,EAAaF,EAAM,MACnBG,EAAcH,EAAM,OACpBI,EAAYJ,EAAM,MACtB,QAAS1E,EAAI,EAAGA,EAAI6E,EAAa7E,IAAK,CACpC,QAASD,EAAI,EAAGA,EAAI6E,EAAY7E,IAAK,CACnC,IAAI4D,EAAY1b,EAAK,IAAI6Y,CAAG,EACxByC,EAAQoB,EAAS5E,EAAGC,EAAG8E,CAAS,EACpCpB,EAAqB5C,CAAG,EAAEwC,EAAQK,EAAWJ,EAAOK,CAAM,CAC3D,CACD3b,EAAK,eAAc,CACpB,CACF,CAED,OAAA+c,GAAA,aAAuB,SAAUlG,EAAMoC,EAAY,CACjD,IAAI7B,EAAQ6B,EAAW,MACnB5B,EAAS4B,EAAW,OACpBrY,EAAQqY,EAAW,MACnBJ,EAAMI,EAAW,IACjB9B,EAAY8B,EAAW,UACvBjZ,EAEAY,IAAU,IACZZ,EAAO4b,EAAa/E,EAAMjW,CAAK,GAEjC,IAAIya,EACAza,GAAS,EACXya,EAAS,OAAO,MAAMjE,EAAQC,EAAS,CAAC,EAExCgE,EAAS,IAAI,YAAYjE,EAAQC,EAAS,CAAC,EAE7C,IAAIsE,EAAS,KAAK,IAAI,EAAG/a,CAAK,EAAI,EAC9B2a,EAAS,EACTjE,EACAoF,EAEJ,GAAIvF,EACFG,EAASqB,EAAe,eAAevB,EAAOC,CAAM,EACpDqF,EAAW/D,EAAe,qBAAqBvB,EAAOC,CAAM,MACvD,CACL,IAAI2F,EAAqB,EACzBN,EAAW,UAAY,CACrB,IAAIH,EAAWS,EACf,OAAAA,GAAsB,EACfT,CACb,EACIjF,EAAS,CAAC,CAAE,MAAOF,EAAO,OAAQC,CAAM,CAAE,CAC3C,CAED,QAAS4F,EAAa,EAAGA,EAAa3F,EAAO,OAAQ2F,IAC/Crc,IAAU,EACZ2a,EAASiB,EACPlF,EAAO2F,CAAU,EACjB5B,EACAqB,EACA7D,EACAhC,EACA0E,CACR,EAEMuB,EACExF,EAAO2F,CAAU,EACjB5B,EACAqB,EACA7D,EACA7Y,EACA2b,CACR,EAGE,GAAI/a,IAAU,GACZ,GAAI2a,IAAW1E,EAAK,OAClB,MAAM,IAAI,MAAM,kBAAkB,OAGpC7W,EAAK,IAAG,EAGV,OAAOqb,mDCvQT,SAAS6B,EAAUC,EAAQC,EAAShG,EAAOC,EAAQgG,EAAS,CAC1D,IAAI/B,EAAQ,EAEZ,QAAS,EAAI,EAAG,EAAIjE,EAAQ,IAC1B,QAASS,EAAI,EAAGA,EAAIV,EAAOU,IAAK,CAC9B,IAAIwF,EAAQD,EAAQF,EAAO7B,CAAK,CAAC,EAEjC,GAAI,CAACgC,EACH,MAAM,IAAI,MAAM,SAAWH,EAAO7B,CAAK,EAAI,iBAAiB,EAG9D,QAAStuB,EAAI,EAAGA,EAAI,EAAGA,IACrBowB,EAAQ9B,EAAQtuB,CAAC,EAAIswB,EAAMtwB,CAAC,EAE9BsuB,GAAS,CACV,CAEJ,CAED,SAASiC,EAAwBJ,EAAQC,EAAShG,EAAOC,EAAQmG,EAAY,CAC3E,IAAIlC,EAAQ,EACZ,QAAS,EAAI,EAAG,EAAIjE,EAAQ,IAC1B,QAASS,EAAI,EAAGA,EAAIV,EAAOU,IAAK,CAC9B,IAAI2F,EAAY,GAahB,GAXID,EAAW,SAAW,EACpBA,EAAW,CAAC,IAAML,EAAO7B,CAAK,IAChCmC,EAAY,IAGdD,EAAW,CAAC,IAAML,EAAO7B,CAAK,GAC9BkC,EAAW,CAAC,IAAML,EAAO7B,EAAQ,CAAC,GAClCkC,EAAW,CAAC,IAAML,EAAO7B,EAAQ,CAAC,IAElCmC,EAAY,IAEVA,EACF,QAASzwB,EAAI,EAAGA,EAAI,EAAGA,IACrBowB,EAAQ9B,EAAQtuB,CAAC,EAAI,EAGzBsuB,GAAS,CACV,CAEJ,CAED,SAASoC,EAAWP,EAAQC,EAAShG,EAAOC,EAAQzW,EAAO,CACzD,IAAI+c,EAAe,IACfC,EAAc,KAAK,IAAI,EAAGhd,CAAK,EAAI,EACnC0a,EAAQ,EAEZ,QAASvD,EAAI,EAAGA,EAAIV,EAAQU,IAC1B,QAASD,EAAI,EAAGA,EAAIV,EAAOU,IAAK,CAC9B,QAAS9qB,EAAI,EAAGA,EAAI,EAAGA,IACrBowB,EAAQ9B,EAAQtuB,CAAC,EAAI,KAAK,MACvBmwB,EAAO7B,EAAQtuB,CAAC,EAAI2wB,EAAgBC,EAAc,EAC7D,EAEMtC,GAAS,CACV,CAEJ,CAED,OAAAuC,GAAiB,SAAUV,EAAQW,EAAW,CAC5C,IAAIld,EAAQkd,EAAU,MAClB1G,EAAQ0G,EAAU,MAClBzG,EAASyG,EAAU,OACnB9C,EAAY8C,EAAU,UACtBN,EAAaM,EAAU,WACvBT,EAAUS,EAAU,QAEpBV,EAAUD,EAEd,OAAInC,IAAc,EAEhBkC,EAAUC,EAAQC,EAAShG,EAAOC,EAAQgG,CAAO,GAE7CG,GACFD,EAAwBJ,EAAQC,EAAShG,EAAOC,EAAQmG,CAAU,EAGhE5c,IAAU,IAERA,IAAU,KACZwc,EAAU,OAAO,MAAMhG,EAAQC,EAAS,CAAC,GAE3CqG,EAAWP,EAAQC,EAAShG,EAAOC,EAAQzW,CAAK,IAG7Cwc,wDCzFT,IAAIvJ,EAAO/X,KACPiiB,EAAO5Z,KACPwS,EAAcvS,KACdiW,EAAchW,KACdqW,EAASnW,KACTwY,EAAYiB,KACZH,EAAmBI,KAEnBC,EAAeC,GAAA,QAAiB,SAAUzoB,EAAS,CACrDihB,EAAY,KAAK,IAAI,EAErB,KAAK,QAAU,IAAI+D,EAAOhlB,EAAS,CACjC,KAAM,KAAK,KAAK,KAAK,IAAI,EACzB,MAAO,KAAK,aAAa,KAAK,IAAI,EAClC,SAAU,KAAK,gBAAgB,KAAK,IAAI,EACxC,MAAO,KAAK,KAAK,KAAK,KAAM,OAAO,EACnC,QAAS,KAAK,eAAe,KAAK,IAAI,EACtC,WAAY,KAAK,kBAAkB,KAAK,IAAI,EAC5C,SAAU,KAAK,UAAU,KAAK,IAAI,EAClC,YAAa,KAAK,aAAa,KAAK,IAAI,EACxC,mBAAoB,KAAK,oBAAoB,KAAK,IAAI,EACtD,gBAAiB,KAAK,iBAAiB,KAAK,IAAI,CACpD,CAAG,EACD,KAAK,SAAWA,EAChB,KAAK,SAAW,GAEhB,KAAK,QAAQ,OACf,EACA,OAAAme,EAAK,SAASqK,EAAavH,CAAW,EAEtCuH,EAAY,UAAU,aAAe,SAAUvrB,EAAK,CAClD,KAAK,KAAK,QAASA,CAAG,EAEtB,KAAK,SAAW,GAEhB,KAAK,QAAO,EAER,KAAK,UAAY,KAAK,SAAS,SACjC,KAAK,SAAS,UAGZ,KAAK,UACP,KAAK,QAAQ,UAIb,KAAK,QAAQ,GAAG,QAAS,UAAY,CAAE,CAAA,GAGzC,KAAK,OAAS,EAChB,EAEAurB,EAAY,UAAU,aAAe,SAAUrH,EAAM,CACnD,GAAI,CAAC,KAAK,SACR,GAAI,KAAK,YAAY,UACnB,KAAK,SAAWkH,EAAK,gBAErB,KAAK,SAAS,GAAG,QAAS,KAAK,KAAK,KAAK,KAAM,OAAO,CAAC,EACvD,KAAK,QAAQ,GAAG,WAAY,KAAK,UAAU,KAAK,IAAI,CAAC,EAErD,KAAK,SAAS,KAAK,KAAK,OAAO,MAC1B,CAQL,IAAIK,IANA,KAAK,YAAY,MACjB,KAAK,YAAY,IACjB,KAAK,YAAY,MACjB,GACA,GACF,GACwB,KAAK,YAAY,OACvCC,EAAY,KAAK,IAAID,EAAWL,EAAK,WAAW,EAEpD,KAAK,SAAWA,EAAK,cAAc,CAAE,UAAWM,CAAS,CAAE,EAC3D,IAAIC,EAAgBF,EAEhBG,EAAY,KAAK,KAAK,KAAK,KAAM,OAAO,EAC5C,KAAK,SAAS,GAAG,QAAS,SAAU5rB,EAAK,CAClC2rB,GAILC,EAAU5rB,CAAG,CACrB,CAAO,EACD,KAAK,QAAQ,GAAG,WAAY,KAAK,UAAU,KAAK,IAAI,CAAC,EAErD,IAAI6rB,EAAc,KAAK,QAAQ,MAAM,KAAK,KAAK,OAAO,EACtD,KAAK,SAAS,GAAG,OAAQ,SAAU/iB,EAAO,CACnC6iB,IAID7iB,EAAM,OAAS6iB,IACjB7iB,EAAQA,EAAM,MAAM,EAAG6iB,CAAa,GAGtCA,GAAiB7iB,EAAM,OAEvB+iB,EAAY/iB,CAAK,EACzB,CAAO,EAED,KAAK,SAAS,GAAG,MAAO,KAAK,QAAQ,IAAI,KAAK,KAAK,OAAO,CAAC,CAC5D,CAEH,KAAK,SAAS,MAAMob,CAAI,CAC1B,EAEAqH,EAAY,UAAU,gBAAkB,SAAUO,EAAU,CAC1D,KAAK,UAAYA,EACjB,KAAK,YAAc,OAAO,OAAOA,CAAQ,EAEzC,KAAK,QAAU,IAAIpE,EAAY,KAAK,WAAW,CACjD,EAEA6D,EAAY,UAAU,kBAAoB,SAAUV,EAAY,CAC9D,KAAK,YAAY,WAAaA,CAChC,EAEAU,EAAY,UAAU,eAAiB,SAAUb,EAAS,CACxD,KAAK,YAAY,QAAUA,CAC7B,EAEAa,EAAY,UAAU,oBAAsB,UAAY,CACtD,KAAK,UAAU,MAAQ,EACzB,EAEAA,EAAY,UAAU,iBAAmB,UAAY,CAGnD,KAAK,KAAK,WAAY,KAAK,SAAS,CACtC,EAEAA,EAAY,UAAU,UAAY,UAAY,CACxC,KAAK,SAIJ,KAAK,SAIR,KAAK,SAAS,MAHd,KAAK,KAAK,QAAS,kBAAkB,EAKzC,EAEAA,EAAY,UAAU,UAAY,SAAUQ,EAAc,CACxD,GAAI,KAAK,OACP,OAGF,IAAIC,EAEJ,GAAI,CACF,IAAIC,EAAa7B,EAAU,aAAa2B,EAAc,KAAK,WAAW,EAEtEC,EAAuBd,EAAiBe,EAAY,KAAK,WAAW,EACpEA,EAAa,IACd,OAAQ3H,EAAI,CACX,KAAK,aAAaA,CAAE,EACpB,MACD,CAED,KAAK,KAAK,SAAU0H,CAAoB,2FCjK1C,IAAInM,EAAY1W,KAEF,OAAA+iB,GAAG,SAAUC,EAAQ1H,EAAOC,EAAQ3hB,EAAS,CACzD,IAAIqpB,EACF,CAACvM,EAAU,sBAAuBA,EAAU,eAAe,EAAE,QAC3D9c,EAAQ,SACT,IAAK,GACR,GAAIA,EAAQ,YAAcA,EAAQ,eAAgB,CAChD,IAAIspB,EAAa,UAAY,CAC3B,IAAInK,EAAS,IAAI,YAAY,CAAC,EAC9B,WAAI,SAASA,CAAM,EAAE,SAAS,EAAG,IAAK,IAE/B,IAAI,WAAWA,CAAM,EAAE,CAAC,IAAM,GAC3C,IAEI,GAAInf,EAAQ,WAAa,GAAMA,EAAQ,WAAa,IAAMspB,EACxD,OAAOF,CAEV,CAGD,IAAIjI,EAAOnhB,EAAQ,WAAa,GAAKopB,EAAS,IAAI,YAAYA,EAAO,MAAM,EAEvEG,EAAW,IACXC,EAAQ1M,EAAU,qBAAqB9c,EAAQ,cAAc,EAC7DwpB,IAAU,GAAK,CAACxpB,EAAQ,gBAC1BwpB,EAAQ,GAEV,IAAIC,EAAS3M,EAAU,qBAAqB9c,EAAQ,SAAS,EACzDA,EAAQ,WAAa,KACvBupB,EAAW,MACXE,GAAU,GAEZ,IAAIC,EAAU,OAAO,MAAMhI,EAAQC,EAAS8H,CAAM,EAE9CE,EAAU,EACVC,EAAW,EAEXC,EAAU7pB,EAAQ,SAAW,GAC7B6pB,EAAQ,MAAQ,SAClBA,EAAQ,IAAMN,GAEZM,EAAQ,QAAU,SACpBA,EAAQ,MAAQN,GAEdM,EAAQ,OAAS,SACnBA,EAAQ,KAAON,GAGjB,SAASO,GAAU,CACjB,IAAIC,EACAC,EACAC,EACAC,EAAQX,EACZ,OAAQvpB,EAAQ,eAAc,CAC5B,KAAK8c,EAAU,sBACboN,EAAQ/I,EAAKwI,EAAU,CAAC,EACxBI,EAAM5I,EAAKwI,CAAO,EAClBK,EAAQ7I,EAAKwI,EAAU,CAAC,EACxBM,EAAO9I,EAAKwI,EAAU,CAAC,EACvB,MACF,KAAK7M,EAAU,gBACbiN,EAAM5I,EAAKwI,CAAO,EAClBK,EAAQ7I,EAAKwI,EAAU,CAAC,EACxBM,EAAO9I,EAAKwI,EAAU,CAAC,EACvB,MACF,KAAK7M,EAAU,gBACboN,EAAQ/I,EAAKwI,EAAU,CAAC,EACxBI,EAAM5I,EAAKwI,CAAO,EAClBK,EAAQD,EACRE,EAAOF,EACP,MACF,KAAKjN,EAAU,oBACbiN,EAAM5I,EAAKwI,CAAO,EAClBK,EAAQD,EACRE,EAAOF,EACP,MACF,QACE,MAAM,IAAI,MACR,oBACE/pB,EAAQ,eACR,8BACZ,CACK,CAED,OAAIA,EAAQ,gBACLqpB,IACHa,GAASX,EACTQ,EAAM,KAAK,IACT,KAAK,IAAI,KAAK,OAAO,EAAIG,GAASL,EAAQ,IAAMK,EAAQH,CAAG,EAAG,CAAC,EAC/DR,CACV,EACQS,EAAQ,KAAK,IACX,KAAK,IAAI,KAAK,OAAO,EAAIE,GAASL,EAAQ,MAAQK,EAAQF,CAAK,EAAG,CAAC,EACnET,CACV,EACQU,EAAO,KAAK,IACV,KAAK,IAAI,KAAK,OAAO,EAAIC,GAASL,EAAQ,KAAOK,EAAQD,CAAI,EAAG,CAAC,EACjEV,CACV,IAGW,CAAE,IAAKQ,EAAK,MAAOC,EAAO,KAAMC,EAAM,MAAOC,EACrD,CAED,QAAS7H,EAAI,EAAGA,EAAIV,EAAQU,IAC1B,QAASD,EAAI,EAAGA,EAAIV,EAAOU,IAAK,CAC9B,IAAI+H,EAAOL,EAAqB,EAEhC,OAAQ9pB,EAAQ,UAAS,CACvB,KAAK8c,EAAU,sBACf,KAAKA,EAAU,gBACT9c,EAAQ,WAAa,GACvB0pB,EAAQE,CAAQ,EAAIO,EAAK,IACzBT,EAAQE,EAAW,CAAC,EAAIO,EAAK,MAC7BT,EAAQE,EAAW,CAAC,EAAIO,EAAK,KACzBd,IACFK,EAAQE,EAAW,CAAC,EAAIO,EAAK,SAG/BT,EAAQ,cAAcS,EAAK,IAAKP,CAAQ,EACxCF,EAAQ,cAAcS,EAAK,MAAOP,EAAW,CAAC,EAC9CF,EAAQ,cAAcS,EAAK,KAAMP,EAAW,CAAC,EACzCP,GACFK,EAAQ,cAAcS,EAAK,MAAOP,EAAW,CAAC,GAGlD,MACF,KAAK9M,EAAU,gBACf,KAAKA,EAAU,oBAAqB,CAElC,IAAIsN,GAAaD,EAAK,IAAMA,EAAK,MAAQA,EAAK,MAAQ,EAClDnqB,EAAQ,WAAa,GACvB0pB,EAAQE,CAAQ,EAAIQ,EAChBf,IACFK,EAAQE,EAAW,CAAC,EAAIO,EAAK,SAG/BT,EAAQ,cAAcU,EAAWR,CAAQ,EACrCP,GACFK,EAAQ,cAAcS,EAAK,MAAOP,EAAW,CAAC,GAGlD,KACD,CACD,QACE,MAAM,IAAI,MAAM,2BAA6B5pB,EAAQ,SAAS,CACjE,CAED2pB,GAAWH,EACXI,GAAYH,CACb,CAGH,OAAOC,mDC1JT,IAAIhH,EAAiBtc,KAErB,SAASikB,EAAW1E,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ,CAC7D,QAASzD,EAAI,EAAGA,EAAIgB,EAAWhB,IAC7BsB,EAAQmC,EAASzD,CAAC,EAAIuD,EAAOC,EAAQxD,CAAC,CAEzC,CAED,SAASkI,EAAc3E,EAAQC,EAAOxC,EAAW,CAC/C,IAAImH,EAAM,EACN/gB,EAASoc,EAAQxC,EAErB,QAAS9rB,EAAIsuB,EAAOtuB,EAAIkS,EAAQlS,IAC9BizB,GAAO,KAAK,IAAI5E,EAAOruB,CAAC,CAAC,EAE3B,OAAOizB,CACR,CAED,SAASC,EAAU7E,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ1C,EAAK,CACjE,QAASf,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CxO,EAAMgR,EAAOC,EAAQxD,CAAC,EAAIlK,EAE9BwL,EAAQmC,EAASzD,CAAC,EAAIzN,CACvB,CACF,CAED,SAAS8V,EAAa9E,EAAQC,EAAOxC,EAAWD,EAAK,CACnD,IAAIoH,EAAM,EACV,QAASnI,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CxO,EAAMgR,EAAOC,EAAQxD,CAAC,EAAIlK,EAE9BqS,GAAO,KAAK,IAAI5V,CAAG,CACpB,CAED,OAAO4V,CACR,CAED,SAASG,EAAS/E,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ,CAC3D,QAASzD,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIuI,EAAK/E,EAAQ,EAAID,EAAOC,EAAQxD,EAAIgB,CAAS,EAAI,EACjDzO,EAAMgR,EAAOC,EAAQxD,CAAC,EAAIuI,EAE9BjH,EAAQmC,EAASzD,CAAC,EAAIzN,CACvB,CACF,CAED,SAASiW,EAAYjF,EAAQC,EAAOxC,EAAW,CAC7C,IAAImH,EAAM,EACN/gB,EAASoc,EAAQxC,EACrB,QAAShB,EAAIwD,EAAOxD,EAAI5Y,EAAQ4Y,IAAK,CACnC,IAAIuI,EAAK/E,EAAQ,EAAID,EAAOvD,EAAIgB,CAAS,EAAI,EACzCzO,EAAMgR,EAAOvD,CAAC,EAAIuI,EAEtBJ,GAAO,KAAK,IAAI5V,CAAG,CACpB,CAED,OAAO4V,CACR,CAED,SAASM,EAAUlF,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ1C,EAAK,CACjE,QAASf,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CwH,EAAK/E,EAAQ,EAAID,EAAOC,EAAQxD,EAAIgB,CAAS,EAAI,EACjDzO,EAAMgR,EAAOC,EAAQxD,CAAC,GAAMlK,EAAOyS,GAAO,GAE9CjH,EAAQmC,EAASzD,CAAC,EAAIzN,CACvB,CACF,CAED,SAASmW,EAAanF,EAAQC,EAAOxC,EAAWD,EAAK,CACnD,IAAIoH,EAAM,EACV,QAASnI,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CwH,EAAK/E,EAAQ,EAAID,EAAOC,EAAQxD,EAAIgB,CAAS,EAAI,EACjDzO,EAAMgR,EAAOC,EAAQxD,CAAC,GAAMlK,EAAOyS,GAAO,GAE9CJ,GAAO,KAAK,IAAI5V,CAAG,CACpB,CAED,OAAO4V,CACR,CAED,SAASQ,EAAYpF,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ1C,EAAK,CACnE,QAASf,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CwH,EAAK/E,EAAQ,EAAID,EAAOC,EAAQxD,EAAIgB,CAAS,EAAI,EACjD4H,EACFpF,EAAQ,GAAKxD,GAAKe,EAAMwC,EAAOC,EAAQxD,GAAKgB,EAAYD,EAAI,EAAI,EAC9DxO,EAAMgR,EAAOC,EAAQxD,CAAC,EAAIM,EAAexK,EAAMyS,EAAIK,CAAM,EAE7DtH,EAAQmC,EAASzD,CAAC,EAAIzN,CACvB,CACF,CAED,SAASsW,EAAetF,EAAQC,EAAOxC,EAAWD,EAAK,CACrD,IAAIoH,EAAM,EACV,QAASnI,EAAI,EAAGA,EAAIgB,EAAWhB,IAAK,CAClC,IAAIlK,EAAOkK,GAAKe,EAAMwC,EAAOC,EAAQxD,EAAIe,CAAG,EAAI,EAC5CwH,EAAK/E,EAAQ,EAAID,EAAOC,EAAQxD,EAAIgB,CAAS,EAAI,EACjD4H,EACFpF,EAAQ,GAAKxD,GAAKe,EAAMwC,EAAOC,EAAQxD,GAAKgB,EAAYD,EAAI,EAAI,EAC9DxO,EAAMgR,EAAOC,EAAQxD,CAAC,EAAIM,EAAexK,EAAMyS,EAAIK,CAAM,EAE7DT,GAAO,KAAK,IAAI5V,CAAG,CACpB,CAED,OAAO4V,CACR,CAED,IAAIW,EAAU,CACZ,EAAGb,EACH,EAAGG,EACH,EAAGE,EACH,EAAGG,EACH,EAAGE,CACL,EAEII,EAAa,CACf,EAAGb,EACH,EAAGG,EACH,EAAGG,EACH,EAAGE,EACH,EAAGG,CACL,EAEc,OAAAG,GAAG,SAAUzF,EAAQjE,EAAOC,EAAQ3hB,EAASmjB,EAAK,CAC9D,IAAIkI,EACJ,GAAI,EAAE,eAAgBrrB,IAAYA,EAAQ,aAAe,GACvDqrB,EAAc,CAAC,EAAG,EAAG,EAAG,EAAG,CAAC,UACnB,OAAOrrB,EAAQ,YAAe,SACvCqrB,EAAc,CAACrrB,EAAQ,UAAU,MAEjC,OAAM,IAAI,MAAM,2BAA2B,EAGzCA,EAAQ,WAAa,KACvBmjB,GAAO,GAET,IAAIC,EAAY1B,EAAQyB,EACpB0C,EAAS,EACTD,EAAQ,EACRlC,EAAU,OAAO,OAAON,EAAY,GAAKzB,CAAM,EAE/C2J,EAAMD,EAAY,CAAC,EAEvB,QAAShJ,EAAI,EAAGA,EAAIV,EAAQU,IAAK,CAC/B,GAAIgJ,EAAY,OAAS,EAAG,CAE1B,IAAIxT,EAAM,IAEV,QAASvgB,EAAI,EAAGA,EAAI+zB,EAAY,OAAQ/zB,IAAK,CAC3C,IAAIizB,EAAMY,EAAWE,EAAY/zB,CAAC,CAAC,EAAEquB,EAAQC,EAAOxC,EAAWD,CAAG,EAC9DoH,EAAM1S,IACRyT,EAAMD,EAAY/zB,CAAC,EACnBugB,EAAM0S,EAET,CACF,CAED7G,EAAQmC,CAAM,EAAIyF,EAClBzF,IACAqF,EAAQI,CAAG,EAAE3F,EAAQC,EAAOxC,EAAWM,EAASmC,EAAQ1C,CAAG,EAC3D0C,GAAUzC,EACVwC,GAASxC,CACV,CACD,OAAOM,wDCvKT,IAAI5G,EAAY1W,KACZmlB,EAAY9c,KACZ+c,EAAY9c,KACZ+V,EAAS9V,KACT0Z,EAAOxZ,KAEP4c,EAAUC,GAAA,QAAiB,SAAU1rB,EAAS,CAsBhD,GArBA,KAAK,SAAWA,EAEhBA,EAAQ,iBAAmBA,EAAQ,kBAAoB,GAAK,KAC5DA,EAAQ,aACNA,EAAQ,cAAgB,KAAOA,EAAQ,aAAe,EACxDA,EAAQ,gBACNA,EAAQ,iBAAmB,KAAOA,EAAQ,gBAAkB,EAC9DA,EAAQ,cACNA,EAAQ,eAAiB,KAAOA,EAAQ,cAAgB,GAC1DA,EAAQ,eAAiBA,EAAQ,gBAAkBqoB,EAAK,cACxDroB,EAAQ,SAAWA,EAAQ,UAAY,EAEvCA,EAAQ,UACN,OAAOA,EAAQ,WAAc,SACzBA,EAAQ,UACR8c,EAAU,sBAChB9c,EAAQ,eACN,OAAOA,EAAQ,gBAAmB,SAC9BA,EAAQ,eACR8c,EAAU,sBAGd,CACEA,EAAU,oBACVA,EAAU,gBACVA,EAAU,sBACVA,EAAU,eACX,EAAC,QAAQ9c,EAAQ,SAAS,IAAM,GAEjC,MAAM,IAAI,MACR,qBAAuBA,EAAQ,UAAY,8BACjD,EAEE,GACE,CACE8c,EAAU,oBACVA,EAAU,gBACVA,EAAU,sBACVA,EAAU,eACX,EAAC,QAAQ9c,EAAQ,cAAc,IAAM,GAEtC,MAAM,IAAI,MACR,2BACEA,EAAQ,eACR,8BACR,EAEE,GAAIA,EAAQ,WAAa,GAAKA,EAAQ,WAAa,GACjD,MAAM,IAAI,MACR,oBAAsBA,EAAQ,SAAW,8BAC/C,CAEA,EAEA,OAAAyrB,EAAO,UAAU,kBAAoB,UAAY,CAC/C,MAAO,CACL,UAAW,KAAK,SAAS,iBACzB,MAAO,KAAK,SAAS,aACrB,SAAU,KAAK,SAAS,eAC5B,CACA,EAEAA,EAAO,UAAU,cAAgB,UAAY,CAC3C,OAAO,KAAK,SAAS,eAAe,KAAK,kBAAmB,CAAA,CAC9D,EAEAA,EAAO,UAAU,WAAa,SAAUtK,EAAMO,EAAOC,EAAQ,CAE3D,IAAIgK,EAAaH,EAAUrK,EAAMO,EAAOC,EAAQ,KAAK,QAAQ,EAGzDwB,EAAMrG,EAAU,qBAAqB,KAAK,SAAS,SAAS,EAEhE,OADmB2H,EAAOkH,EAAYjK,EAAOC,EAAQ,KAAK,SAAUwB,CAAG,CAEzE,EAEAsI,EAAO,UAAU,WAAa,SAAUhpB,EAAM0e,EAAM,CAClD,IAAI5pB,EAAM4pB,EAAOA,EAAK,OAAS,EAC3B/hB,EAAM,OAAO,MAAM7H,EAAM,EAAE,EAE/B,OAAA6H,EAAI,cAAc7H,EAAK,CAAC,EACxB6H,EAAI,cAAcqD,EAAM,CAAC,EAErB0e,GACFA,EAAK,KAAK/hB,EAAK,CAAC,EAGlBA,EAAI,aACFmsB,EAAU,MAAMnsB,EAAI,MAAM,EAAGA,EAAI,OAAS,CAAC,CAAC,EAC5CA,EAAI,OAAS,CACjB,EACSA,CACT,EAEAqsB,EAAO,UAAU,SAAW,SAAUG,EAAO,CAC3C,IAAIxsB,EAAM,OAAO,MAAM,CAAC,EACxB,OAAAA,EAAI,cAAc,KAAK,MAAMwsB,EAAQ9O,EAAU,cAAc,EAAG,CAAC,EAC1D,KAAK,WAAWA,EAAU,UAAW1d,CAAG,CACjD,EAEAqsB,EAAO,UAAU,SAAW,SAAU/J,EAAOC,EAAQ,CACnD,IAAIviB,EAAM,OAAO,MAAM,EAAE,EACzB,OAAAA,EAAI,cAAcsiB,EAAO,CAAC,EAC1BtiB,EAAI,cAAcuiB,EAAQ,CAAC,EAC3BviB,EAAI,CAAC,EAAI,KAAK,SAAS,SACvBA,EAAI,CAAC,EAAI,KAAK,SAAS,UACvBA,EAAI,EAAE,EAAI,EACVA,EAAI,EAAE,EAAI,EACVA,EAAI,EAAE,EAAI,EAEH,KAAK,WAAW0d,EAAU,UAAW1d,CAAG,CACjD,EAEAqsB,EAAO,UAAU,SAAW,SAAUtK,EAAM,CAC1C,OAAO,KAAK,WAAWrE,EAAU,UAAWqE,CAAI,CAClD,EAEAsK,EAAO,UAAU,SAAW,UAAY,CACtC,OAAO,KAAK,WAAW3O,EAAU,UAAW,IAAI,gEC7HlD,IAAIqB,EAAO/X,KACP4a,EAASvS,KACTqO,EAAYpO,KACZ+c,EAAS9c,KAETkd,EAAeC,GAAA,QAAiB,SAAUC,EAAK,CACjD/K,EAAO,KAAK,IAAI,EAEhB,IAAIhhB,EAAU+rB,GAAO,GAErB,KAAK,QAAU,IAAIN,EAAOzrB,CAAO,EACjC,KAAK,SAAW,KAAK,QAAQ,cAAa,EAE1C,KAAK,SAAW,EAClB,EACA,OAAAme,EAAK,SAAS0N,EAAa7K,CAAM,EAEjC6K,EAAY,UAAU,KAAO,SAAU1K,EAAMO,EAAOC,EAAQiK,EAAO,CAEjE,KAAK,KAAK,OAAQ,OAAO,KAAK9O,EAAU,aAAa,CAAC,EACtD,KAAK,KAAK,OAAQ,KAAK,QAAQ,SAAS4E,EAAOC,CAAM,CAAC,EAElDiK,GACF,KAAK,KAAK,OAAQ,KAAK,QAAQ,SAASA,CAAK,CAAC,EAGhD,IAAI5C,EAAe,KAAK,QAAQ,WAAW7H,EAAMO,EAAOC,CAAM,EAG9D,KAAK,SAAS,GAAG,QAAS,KAAK,KAAK,KAAK,KAAM,OAAO,CAAC,EAEvD,KAAK,SAAS,GACZ,QACA,SAAUqK,EAAgB,CACxB,KAAK,KAAK,OAAQ,KAAK,QAAQ,SAASA,CAAc,CAAC,CAC7D,GAAM,KAAK,IAAI,CACf,EAEE,KAAK,SAAS,GACZ,OACA,UAAY,CACV,KAAK,KAAK,OAAQ,KAAK,QAAQ,SAAQ,CAAE,EACzC,KAAK,KAAK,KAAK,CACrB,GAAM,KAAK,IAAI,CACf,EAEE,KAAK,SAAS,IAAIhD,CAAY,wFC9ChC,IAAIjM,EAAS3W,GAAiB,EAAC,GAC3BiiB,EAAO5Z,KACP0P,EAAOzP,KAEP0P,EAAazP,GAAkB,WAEnC,SAASkQ,EAAQlH,EAAM,CACrB,GAAI,EAAE,gBAAgBkH,GACpB,OAAO,IAAIA,EAAQlH,CAAI,EAGrBA,GAAQA,EAAK,UAAY0Q,EAAK,cAChC1Q,EAAK,UAAY0Q,EAAK,aAGxBA,EAAK,QAAQ,KAAK,KAAM1Q,CAAI,EAG5B,KAAK,QAAU,KAAK,UAAY,OAAY,KAAK,WAAa,KAAK,QACnE,KAAK,QAAU,KAAK,SAAW,KAAK,WAEhCA,GAAQA,EAAK,WAAa,OAC5B,KAAK,WAAaA,EAAK,UAE1B,CAED,SAASsU,EAActU,EAAM,CAC3B,OAAO,IAAIkH,EAAQlH,CAAI,CACxB,CAED,SAASsI,EAAOX,EAAQ/gB,EAAU,CAC5BA,GACF,QAAQ,SAASA,CAAQ,EAItB+gB,EAAO,UAIZA,EAAO,QAAQ,QACfA,EAAO,QAAU,KAClB,CAEDT,EAAQ,UAAU,cAAgB,SAAU9Y,EAAO6Z,EAAWsM,EAAS,CACrE,GAAI,OAAOA,GAAY,WACrB,OAAO7D,EAAK,QAAQ,cAAc,KAAK,KAAMtiB,EAAO6Z,EAAWsM,CAAO,EAGxE,IAAI1xB,EAAO,KAEPimB,EAAgB1a,GAASA,EAAM,OAC/B2a,EAAiB,KAAK,WAAa,KAAK,QACxCkI,EAAgB,KAAK,WACrBjI,EAAQ,EAERpB,EAAU,CAAA,EACVC,EAAQ,EAERze,EACJ,KAAK,GAAG,QAAS,SAAU9D,EAAK,CAC9B8D,EAAQ9D,CACZ,CAAG,EAED,SAASkvB,EAAYtL,EAAcC,EAAe,CAChD,GAAItmB,EAAK,UACP,OAGF,IAAI0hB,EAAOwE,EAAiBI,EAG5B,GAFA/D,EAAOb,GAAQ,EAAG,yBAAyB,EAEvCA,EAAO,EAAG,CACZ,IAAIuB,EAAMjjB,EAAK,QAAQ,MAAMA,EAAK,QAASA,EAAK,QAAU0hB,CAAI,EAW9D,GAVA1hB,EAAK,SAAW0hB,EAEZuB,EAAI,OAASmL,IACfnL,EAAMA,EAAI,MAAM,EAAGmL,CAAa,GAGlCrJ,EAAQ,KAAK9B,CAAG,EAChB+B,GAAS/B,EAAI,OACbmL,GAAiBnL,EAAI,OAEjBmL,IAAkB,EACpB,MAAO,EAEV,CAQD,OANI9H,IAAkB,GAAKtmB,EAAK,SAAWA,EAAK,cAC9CkmB,EAAiBlmB,EAAK,WACtBA,EAAK,QAAU,EACfA,EAAK,QAAU,OAAO,YAAYA,EAAK,UAAU,GAG/CsmB,IAAkB,GACpBH,GAASF,EAAgBI,EACzBJ,EAAgBI,EAET,IAGF,EACR,CAED9D,EAAO,KAAK,QAAS,qBAAqB,EAC1C,IAAInjB,EACJ,GACEA,EAAM,KAAK,QAAQ,UACjBgmB,EACA7Z,EACA4a,EACAF,EACA,KAAK,QACL,KAAK,QACLC,CACN,EAEI9mB,EAAMA,GAAO,KAAK,kBACX,CAAC,KAAK,WAAauyB,EAAYvyB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,GAEtD,GAAI,KAAK,UACP,MAAMmH,EAGR,GAAIye,GAASpB,EACX,MAAA6B,EAAO,IAAI,EACL,IAAI,WACR,yDACE7B,EAAW,SAAS,EAAE,EACtB,QACR,EAGE,IAAIhf,EAAM,OAAO,OAAOmgB,EAASC,CAAK,EACtC,OAAAS,EAAO,IAAI,EAEJ7gB,CACT,EAEA+e,EAAK,SAASU,EAASwJ,EAAK,OAAO,EAEnC,SAAShJ,EAAeC,EAAQH,EAAQ,CAItC,GAHI,OAAOA,GAAW,WACpBA,EAAS,OAAO,KAAKA,CAAM,GAEzB,EAAEA,aAAkB,QACtB,MAAM,IAAI,UAAU,wBAAwB,EAG9C,IAAIS,EAAYN,EAAO,iBACvB,OAAIM,GAAa,OACfA,EAAYyI,EAAK,UAGZ/I,EAAO,cAAcH,EAAQS,CAAS,CAC9C,CAED,SAASwM,EAAYjN,EAAQxH,EAAM,CACjC,OAAO0H,EAAe,IAAIR,EAAQlH,CAAI,EAAGwH,CAAM,CAChD,CAED7d,EAAiB,QAAA9D,EAAU4uB,EAC3B5uB,EAAA,QAAkBqhB,EAClBrhB,EAAA,cAAwByuB,EACxBzuB,EAAA,YAAsB4uB,gGCrKtB,IAAIC,EAAcC,GAAA,QAAiB,SAAUnN,EAAQ,CACnD,KAAK,QAAUA,EACf,KAAK,OAAS,EAChB,EAEA,OAAAkN,EAAW,UAAU,KAAO,SAAU7iB,EAAQjL,EAAU,CACtD,KAAK,OAAO,KAAK,CACf,OAAQ,KAAK,IAAIiL,CAAM,EACvB,UAAWA,EAAS,EACpB,KAAMjL,CACV,CAAG,CACH,EAEA8tB,EAAW,UAAU,QAAU,UAAY,CAEzC,KAAO,KAAK,OAAO,OAAS,GAAK,KAAK,QAAQ,QAAQ,CACpD,IAAIhL,EAAO,KAAK,OAAO,CAAC,EAExB,GACE,KAAK,QAAQ,SACZ,KAAK,QAAQ,QAAUA,EAAK,QAAUA,EAAK,WAC5C,CAEA,KAAK,OAAO,QAEZ,IAAIjiB,EAAM,KAAK,QAEf,KAAK,QAAUA,EAAI,MAAMiiB,EAAK,MAAM,EAEpCA,EAAK,KAAK,KAAK,KAAMjiB,EAAI,MAAM,EAAGiiB,EAAK,MAAM,CAAC,CACpD,KACM,MAEH,CAED,GAAI,KAAK,OAAO,OAAS,EACvB,OAAO,IAAI,MAAM,wDAAwD,EAG3E,GAAI,KAAK,QAAQ,OAAS,EACxB,OAAO,IAAI,MAAM,uCAAuC,8DCxC5D,IAAIgL,EAAajmB,KACbid,EAAS5U,KAEb,OAAA8d,GAAA,QAAkB,SAAUC,EAAUjJ,EAAY,CAChD,IAAIkJ,EAAa,CAAA,EACb7tB,EAAS,IAAIytB,EAAWG,CAAQ,EASpC,OARa,IAAInJ,EAAOE,EAAY,CAClC,KAAM3kB,EAAO,KAAK,KAAKA,CAAM,EAC7B,MAAO,SAAU8tB,EAAY,CAC3BD,EAAW,KAAKC,CAAU,CAC3B,EACD,SAAU,UAAY,CAAE,CAC5B,CAAG,EAEM,MAAK,EACZ9tB,EAAO,QAAO,EAEP,OAAO,OAAO6tB,CAAU,mDCjBjC,IAAIE,EAAc,GACdtE,EAAOjiB,KACPgmB,EAAc3d,KACb4Z,EAAK,cACRsE,EAAc,IAEhB,IAAIN,EAAa3d,KACbke,EAAaje,KACbqW,EAASnW,KACTwY,EAAYiB,KACZH,EAAmBI,KAEvB,OAAAsE,GAAiB,SAAU1N,EAAQnf,EAAS,CAC1C,GAAI,CAAC2sB,EACH,MAAM,IAAI,MACR,6FACN,EAGE,IAAI1vB,EACJ,SAAS6vB,EAAYC,EAAO,CAC1B9vB,EAAM8vB,CACP,CAED,IAAIhE,EACJ,SAASiE,EAAeC,EAAY,CAClClE,EAAWkE,CACZ,CAED,SAASC,EAAiBpF,EAAY,CACpCiB,EAAS,WAAajB,CACvB,CAED,SAASqF,EAAcxF,EAAS,CAC9BoB,EAAS,QAAUpB,CACpB,CAED,SAASyF,GAA2B,CAClCrE,EAAS,MAAQ,EAClB,CAED,IAAI6C,EACJ,SAASyB,EAAYC,EAAS,CAC5B1B,EAAQ0B,CACT,CAED,IAAIC,EAAkB,CAAA,EACtB,SAASC,EAAkBC,EAAc,CACvCF,EAAgB,KAAKE,CAAY,CAClC,CAED,IAAI7uB,EAAS,IAAIytB,EAAWlN,CAAM,EAgBlC,GAda,IAAI6F,EAAOhlB,EAAS,CAC/B,KAAMpB,EAAO,KAAK,KAAKA,CAAM,EAC7B,MAAOkuB,EACP,SAAUE,EACV,MAAOK,EACP,QAASF,EACT,WAAYD,EACZ,YAAaM,EACb,mBAAoBJ,CACxB,CAAG,EAEM,MAAK,EACZxuB,EAAO,QAAO,EAEV3B,EACF,MAAMA,EAIR,IAAIywB,EAAc,OAAO,OAAOH,CAAe,EAC/CA,EAAgB,OAAS,EAEzB,IAAIE,EACJ,GAAI1E,EAAS,UACX0E,EAAepF,EAAK,YAAYqF,CAAW,MACtC,CAGL,IAAIhF,IADAK,EAAS,MAAQA,EAAS,IAAMA,EAAS,MAAQ,GAAM,GAAK,GACtCA,EAAS,OACnC0E,EAAerB,EAAYsB,EAAa,CACtC,UAAWhF,EACX,UAAWA,CACjB,CAAK,CACF,CAGD,GAFAgF,EAAc,KAEV,CAACD,GAAgB,CAACA,EAAa,OACjC,MAAM,IAAI,MAAM,yCAAyC,EAG3D,IAAIE,EAAiBf,EAAW,QAAQa,EAAc1E,CAAQ,EAC9D2E,EAAc,KAEd,IAAIxE,EAAa7B,EAAU,aAAasG,EAAgB5E,CAAQ,EAChE4E,EAAiB,KAEjB,IAAI1E,EAAuBd,EAAiBe,EAAYH,CAAQ,EAEhE,OAAAA,EAAS,KAAOE,EAChBF,EAAS,MAAQ6C,GAAS,EAEnB7C,mDCxGT,IAAI4D,EAAc,GACdtE,EAAOjiB,KACNiiB,EAAK,cACRsE,EAAc,IAEhB,IAAI7P,EAAYrO,KACZgd,EAAS/c,KAEb,OAAAkf,GAAiB,SAAU7E,EAAUgD,EAAK,CACxC,GAAI,CAACY,EACH,MAAM,IAAI,MACR,6FACN,EAGE,IAAI3sB,EAAU+rB,GAAO,GAEjB8B,EAAS,IAAIpC,EAAOzrB,CAAO,EAE3B4F,EAAS,CAAA,EAGbA,EAAO,KAAK,OAAO,KAAKkX,EAAU,aAAa,CAAC,EAGhDlX,EAAO,KAAKioB,EAAO,SAAS9E,EAAS,MAAOA,EAAS,MAAM,CAAC,EAExDA,EAAS,OACXnjB,EAAO,KAAKioB,EAAO,SAAS9E,EAAS,KAAK,CAAC,EAG7C,IAAIC,EAAe6E,EAAO,WACxB9E,EAAS,KACTA,EAAS,MACTA,EAAS,MACb,EAGMiD,EAAiB3D,EAAK,YACxBW,EACA6E,EAAO,kBAAmB,CAC9B,EAGE,GAFA7E,EAAe,KAEX,CAACgD,GAAkB,CAACA,EAAe,OACrC,MAAM,IAAI,MAAM,4CAA4C,EAE9D,OAAApmB,EAAO,KAAKioB,EAAO,SAAS7B,CAAc,CAAC,EAG3CpmB,EAAO,KAAKioB,EAAO,SAAU,CAAA,EAEtB,OAAO,OAAOjoB,CAAM,gDCpD7B,IAAIkoB,EAAQ1nB,KACR2nB,EAAOtf,KAEX,OAAAuf,GAAA,KAAe,SAAU7O,EAAQnf,EAAS,CACxC,OAAO8tB,EAAM3O,EAAQnf,GAAW,CAAE,CAAA,CACpC,EAEAguB,GAAA,MAAgB,SAAUC,EAAKjuB,EAAS,CACtC,OAAO+tB,EAAKE,EAAKjuB,CAAO,gDCR1B,IAAIme,EAAO/X,KACP4a,EAASvS,KACTuW,EAAStW,KACT+c,EAAS9c,KACTuf,EAAUrf,KAEVsf,EAAOF,GAAA,IAAc,SAAUjuB,EAAS,CAC1CghB,EAAO,KAAK,IAAI,EAEhBhhB,EAAUA,GAAW,GAGrB,KAAK,MAAQA,EAAQ,MAAQ,EAC7B,KAAK,OAASA,EAAQ,OAAS,EAE/B,KAAK,KACH,KAAK,MAAQ,GAAK,KAAK,OAAS,EAC5B,OAAO,MAAM,EAAI,KAAK,MAAQ,KAAK,MAAM,EACzC,KAEFA,EAAQ,MAAQ,KAAK,MACvB,KAAK,KAAK,KAAK,CAAC,EAGlB,KAAK,MAAQ,EACb,KAAK,SAAW,KAAK,SAAW,GAEhC,KAAK,QAAU,IAAIglB,EAAOhlB,CAAO,EAEjC,KAAK,QAAQ,GAAG,QAAS,KAAK,KAAK,KAAK,KAAM,OAAO,CAAC,EACtD,KAAK,QAAQ,GAAG,QAAS,KAAK,aAAa,KAAK,IAAI,CAAC,EACrD,KAAK,QAAQ,GAAG,WAAY,KAAK,UAAU,KAAK,IAAI,CAAC,EACrD,KAAK,QAAQ,GAAG,QAAS,KAAK,OAAO,KAAK,IAAI,CAAC,EAC/C,KAAK,QAAQ,GACX,UACA,SAAUmhB,EAAM,CACd,KAAK,KAAOA,EACZ,KAAK,KAAK,SAAUA,CAAI,CAC9B,GAAM,KAAK,IAAI,CACf,EAEE,KAAK,QAAU,IAAIsK,EAAOzrB,CAAO,EACjC,KAAK,QAAQ,GAAG,OAAQ,KAAK,KAAK,KAAK,KAAM,MAAM,CAAC,EACpD,KAAK,QAAQ,GAAG,MAAO,KAAK,KAAK,KAAK,KAAM,KAAK,CAAC,EAClD,KAAK,QAAQ,GAAG,QAAS,KAAK,aAAa,KAAK,IAAI,CAAC,EACrD,KAAK,QAAQ,GAAG,QAAS,KAAK,KAAK,KAAK,KAAM,OAAO,CAAC,CACxD,EACA,OAAAme,EAAK,SAASgQ,EAAKnN,CAAM,EAEzBmN,EAAI,KAAOD,EAEXC,EAAI,UAAU,KAAO,UAAY,CAC/B,MAAI,CAAC,KAAK,MAAQ,CAAC,KAAK,KAAK,QAC3B,KAAK,KAAK,QAAS,kBAAkB,EAC9B,OAGT,QAAQ,UACN,UAAY,CACV,KAAK,QAAQ,KAAK,KAAK,KAAM,KAAK,MAAO,KAAK,OAAQ,KAAK,KAAK,CACtE,GAAM,KAAK,IAAI,CACf,EAES,KACT,EAEAA,EAAI,UAAU,MAAQ,SAAUhN,EAAM5iB,EAAU,CAC9C,GAAIA,EAAU,CACZ,IAAI6vB,EAAU3O,EAEd2O,GAAW,SAAUC,EAAY,CAC/B,KAAK,eAAe,QAAS5O,CAAO,EAEpC,KAAK,KAAO4O,EACZ9vB,EAAS,KAAM,IAAI,CACzB,GAAM,KAAK,IAAI,EAEXkhB,GAAU,SAAUxiB,EAAK,CACvB,KAAK,eAAe,SAAUmxB,CAAQ,EAEtC7vB,EAAStB,EAAK,IAAI,CACxB,GAAM,KAAK,IAAI,EAEX,KAAK,KAAK,SAAUmxB,CAAQ,EAC5B,KAAK,KAAK,QAAS3O,CAAO,CAC3B,CAED,YAAK,IAAI0B,CAAI,EACN,IACT,EAEAgN,EAAI,UAAU,MAAQ,SAAUhN,EAAM,CACpC,YAAK,QAAQ,MAAMA,CAAI,EAChB,EACT,EAEAgN,EAAI,UAAU,IAAM,SAAUhN,EAAM,CAClC,KAAK,QAAQ,IAAIA,CAAI,CACvB,EAEAgN,EAAI,UAAU,UAAY,SAAUG,EAAU,CAC5C,KAAK,MAAQA,EAAS,MACtB,KAAK,OAASA,EAAS,OAEvB,KAAK,KAAK,WAAYA,CAAQ,CAChC,EAEAH,EAAI,UAAU,OAAS,SAAUvC,EAAO,CACtC,KAAK,MAAQA,CACf,EAEAuC,EAAI,UAAU,aAAe,UAAY,CACnC,CAAC,KAAK,QAAQ,UAAY,CAAC,KAAK,QAAQ,UAC1C,KAAK,KAAK,OAAO,CAErB,EAEAA,EAAI,OAAS,SAAU1oB,EAAK8oB,EAAKC,EAAMC,EAAM/M,EAAOC,EAAQ+M,EAAQC,EAAQ,CAY1E,GARAH,GAAQ,EACRC,GAAQ,EACR/M,GAAS,EACTC,GAAU,EACV+M,GAAU,EACVC,GAAU,EAIRH,EAAO/oB,EAAI,OACXgpB,EAAOhpB,EAAI,QACX+oB,EAAO9M,EAAQjc,EAAI,OACnBgpB,EAAO9M,EAASlc,EAAI,OAEpB,MAAM,IAAI,MAAM,8BAA8B,EAGhD,GACEipB,EAASH,EAAI,OACbI,EAASJ,EAAI,QACbG,EAAShN,EAAQ6M,EAAI,OACrBI,EAAShN,EAAS4M,EAAI,OAEtB,MAAM,IAAI,MAAM,8BAA8B,EAGhD,QAASlM,EAAI,EAAGA,EAAIV,EAAQU,IAC1B5c,EAAI,KAAK,KACP8oB,EAAI,MACFI,EAAStM,GAAKkM,EAAI,MAAQG,GAAW,GACrCD,EAAOpM,GAAK5c,EAAI,MAAQ+oB,GAAS,GACjCC,EAAOpM,GAAK5c,EAAI,MAAQ+oB,EAAO9M,GAAU,CACjD,CAEA,EAEAyM,EAAI,UAAU,OAAS,SACrBI,EACAC,EACAC,EACA/M,EACAC,EACA+M,EACAC,EACA,CAGA,OAAAR,EAAI,OAAO,KAAMI,EAAKC,EAAMC,EAAM/M,EAAOC,EAAQ+M,EAAQC,CAAM,EACxD,IACT,EAEAR,EAAI,YAAc,SAAU1oB,EAAK,CAC/B,GAAIA,EAAI,MAAO,CACb,QAAS4c,EAAI,EAAGA,EAAI5c,EAAI,OAAQ4c,IAC9B,QAASD,EAAI,EAAGA,EAAI3c,EAAI,MAAO2c,IAAK,CAClC,IAAIwM,EAAOnpB,EAAI,MAAQ4c,EAAID,GAAM,EAEjC,QAAS9qB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIu3B,EAASppB,EAAI,KAAKmpB,EAAMt3B,CAAC,EAAI,IACjCu3B,EAAS,KAAK,IAAIA,EAAQ,EAAI,IAAMppB,EAAI,KAAK,EAC7CA,EAAI,KAAKmpB,EAAMt3B,CAAC,EAAI,KAAK,MAAMu3B,EAAS,GAAG,CAC5C,CACF,CAEHppB,EAAI,MAAQ,CACb,CACH,EAEA0oB,EAAI,UAAU,YAAc,UAAY,CACtCA,EAAI,YAAY,IAAI,0BChMlBW,GAAW1oB,GAAmB,EAC9BnE,GAAewM,GAAiB,EAAC,aAErCsgB,GAAA,QAAiBC,GACjBD,GAAA,QAAA,QAAyBC,GAEzB,SAASA,GAAOhvB,EAAS,CACvB,GAAI,EAAE,gBAAgBgvB,IACpB,OAAO,IAAIA,GAAMhvB,CAAO,EAG1BiC,GAAa,KAAK,IAAI,EACtBjC,EAAUA,GAAW,CAAE,EACvB,KAAK,YAAcA,EAAQ,aAAe,IAC1C,KAAK,QAAUA,EAAQ,SAAW,EAClC,KAAK,UAAYA,EAAQ,WAAa,GACtC,KAAK,QAAUA,EAAQ,SAAW,KAClC,KAAK,QAAU,EACf,KAAK,QAAU,EACf,KAAK,QAAU,GACf,KAAK,KAAO,CAAE,EACd,KAAK,OAAS,CAAE,CAClB,CACA8uB,GAASE,GAAO/sB,EAAY,EAE5B,IAAIgtB,GAAe,CACjB,MACA,QACA,UACA,aACF,EAEAA,GAAa,QAAQ,SAAUpvB,EAAQ,CACrCmvB,GAAM,UAAUnvB,CAAM,EAAI,UAAY,CACpC,OAAO,MAAM,UAAUA,CAAM,EAAE,MAAM,KAAK,KAAM,SAAS,CAC1D,CACH,CAAC,EAEDmvB,GAAM,UAAU,MAAQ,SAAUE,EAAO52B,EAAK,CAC5C,YAAK,KAAO,KAAK,KAAK,MAAM42B,EAAO52B,CAAG,EAC/B,IACT,EAEA02B,GAAM,UAAU,QAAU,UAAY,CACpC,YAAK,KAAK,QAAS,EACZ,IACT,EAEA,IAAIG,GAAkB,CACpB,OACA,UACA,QACF,EAEAA,GAAgB,QAAQ,SAAUtvB,EAAQ,CACxCmvB,GAAM,UAAUnvB,CAAM,EAAI,UAAY,CACpC,IAAIuvB,EAAe,MAAM,UAAUvvB,CAAM,EAAE,MAAM,KAAK,KAAM,SAAS,EACrE,OAAI,KAAK,WACP,KAAK,MAAO,EAEPuvB,CACR,CACH,CAAC,EAED,OAAO,eAAeJ,GAAM,UAAW,SAAU,CAC/C,IAAK,UAAY,CACf,OAAO,KAAK,QAAU,KAAK,KAAK,MACjC,CACH,CAAC,EAEDA,GAAM,UAAU,MAAQ,SAAUzO,EAAI,CAOpC,GANIA,GACF8O,GAAiB,KAAK,KAAM9O,CAAE,EAGhC,KAAK,QAAU,GAEX,KAAK,SAAW,KAAK,YACvB,OAGF,GAAI,KAAK,KAAK,SAAW,EAAG,CACtB,KAAK,UAAY,GACnB+O,GAAK,KAAK,IAAI,EAEhB,MACD,CAED,IAAI90B,EAAO,KACP+0B,EAAM,KAAK,KAAK,MAAO,EACvBptB,EAAO,GACPqtB,EAAU,KAAK,QACfC,EAAY,KACZC,EAAa,GACbC,EAAc,KACdC,EAAUL,EAAI,eAAe,SAAS,EAAIA,EAAI,QAAU,KAAK,QAEjE,SAASpa,EAAMlY,EAAK+I,EAAQ,CACtB7D,GAAQ3H,EAAK,UAAYg1B,IAC3BrtB,EAAO,GACP3H,EAAK,UACDi1B,IAAc,OAChB,OAAOj1B,EAAK,OAAOi1B,CAAS,EAC5B,aAAaA,CAAS,GAGpBxyB,EACFzC,EAAK,KAAK,QAASyC,EAAKsyB,CAAG,EAClBG,IAAe,KACpBC,IAAgB,OAClBn1B,EAAK,QAAQm1B,CAAW,EAAI,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,GAErEn1B,EAAK,KAAK,UAAWwL,EAAQupB,CAAG,GAG9B/0B,EAAK,UAAYg1B,IACfh1B,EAAK,UAAY,GAAKA,EAAK,KAAK,SAAW,EAC7C80B,GAAK,KAAK90B,CAAI,EACLA,EAAK,SACdA,EAAK,MAAO,GAInB,CAEGo1B,IACFH,EAAY,WAAW,UAAY,CACjCC,EAAa,GACTl1B,EAAK,UAAU,SAAS,EAAE,OAAS,EACrCA,EAAK,KAAK,UAAW2a,EAAMoa,CAAG,EAE9Bpa,EAAM,CAET,EAAEya,CAAO,EACV,KAAK,OAAOH,CAAS,EAAIA,GAGvB,KAAK,UACPE,EAAc,KAAK,QAAQ,OAC3B,KAAK,QAAQA,CAAW,EAAI,MAG9B,KAAK,UACLn1B,EAAK,KAAK,QAAS+0B,CAAG,EACtB,IAAItwB,EAAUswB,EAAIpa,CAAI,EAClBlW,GAAWA,EAAQ,MAAQ,OAAOA,EAAQ,MAAS,YACrDA,EAAQ,KAAK,SAAU+G,EAAQ,CAC7B,OAAOmP,EAAK,KAAMnP,CAAM,CAC9B,CAAK,EAAE,MAAM,SAAU/I,EAAK,CACtB,OAAOkY,EAAKlY,GAAO,EAAI,CAC7B,CAAK,EAGC,KAAK,SAAW,KAAK,KAAK,OAAS,GACrC,KAAK,MAAO,CAEhB,EAEA+xB,GAAM,UAAU,KAAO,UAAY,CACjC,KAAK,QAAU,EACjB,EAEAA,GAAM,UAAU,IAAM,SAAU/xB,EAAK,CACnC4yB,GAAY,KAAK,IAAI,EACrB,KAAK,KAAK,OAAS,EACnB,KAAK,QAAU,EACfP,GAAK,KAAK,KAAMryB,CAAG,CACrB,EAEA,SAAS4yB,IAAe,CACtB,QAAS92B,KAAO,KAAK,OAAQ,CAC3B,IAAI02B,EAAY,KAAK,OAAO12B,CAAG,EAC/B,OAAO,KAAK,OAAOA,CAAG,EACtB,aAAa02B,CAAS,CACvB,CACH,CAEA,SAASJ,GAAkB9O,EAAI,CAC7B,IAAI/lB,EAAO,KACX,KAAK,GAAG,QAASs1B,CAAO,EACxB,KAAK,GAAG,MAAOC,CAAK,EAEpB,SAASD,EAAS7yB,EAAK,CAAEzC,EAAK,IAAIyC,CAAG,CAAG,CACxC,SAAS8yB,EAAO9yB,EAAK,CACnBzC,EAAK,eAAe,QAASs1B,CAAO,EACpCt1B,EAAK,eAAe,MAAOu1B,CAAK,EAChCxP,EAAGtjB,EAAK,KAAK,OAAO,CACrB,CACH,CAEA,SAASqyB,GAAMryB,EAAK,CAClB,KAAK,UACL,KAAK,QAAU,GACf,KAAK,KAAK,MAAOA,CAAG,CACtB,mCCjMe,SAAS+yB,IAAsB,CAE5CA,GAAsB,UAA+B,CACnD,OAAOxyB,CACX,EACE,IAAIA,EAAU,CAAE,EACdyyB,EAAK,OAAO,UACZC,EAASD,EAAG,eACZE,EAAiB,OAAO,gBAAkB,SAAU/2B,EAAKL,EAAKgR,EAAM,CAClE3Q,EAAIL,CAAG,EAAIgR,EAAK,KACjB,EACDqmB,EAAwB,OAAO,QAArB,WAA8B,OAAS,CAAE,EACnDC,EAAiBD,EAAQ,UAAY,aACrCE,EAAsBF,EAAQ,eAAiB,kBAC/CG,EAAoBH,EAAQ,aAAe,gBAC7C,SAASI,EAAOp3B,EAAKL,EAAKsC,EAAO,CAC/B,OAAO,OAAO,eAAejC,EAAKL,EAAK,CACrC,MAAOsC,EACP,WAAY,GACZ,aAAc,GACd,SAAU,EAChB,CAAK,EAAGjC,EAAIL,CAAG,CACZ,CACD,GAAI,CACFy3B,EAAO,CAAA,EAAI,EAAE,CACd,MAAa,CACZA,EAAS,SAAgBp3B,EAAKL,EAAKsC,EAAO,CACxC,OAAOjC,EAAIL,CAAG,EAAIsC,CACxB,CACG,CACD,SAASiZ,EAAKmc,EAASC,EAASl2B,EAAMm2B,EAAa,CACjD,IAAIC,EAAiBF,GAAWA,EAAQ,qBAAqBG,EAAYH,EAAUG,EACjFC,EAAY,OAAO,OAAOF,EAAe,SAAS,EAClDG,EAAU,IAAIC,EAAQL,GAAe,CAAE,CAAA,EACzC,OAAOR,EAAeW,EAAW,UAAW,CAC1C,MAAOG,EAAiBR,EAASj2B,EAAMu2B,CAAO,CAC/C,CAAA,EAAGD,CACL,CACD,SAASI,EAASC,EAAI/3B,EAAKU,EAAK,CAC9B,GAAI,CACF,MAAO,CACL,KAAM,SACN,IAAKq3B,EAAG,KAAK/3B,EAAKU,CAAG,CAC7B,CACK,OAAQmD,EAAK,CACZ,MAAO,CACL,KAAM,QACN,IAAKA,CACb,CACK,CACF,CACDO,EAAQ,KAAO8W,EACf,IAAI8c,EAAmB,CAAA,EACvB,SAASP,GAAY,CAAE,CACvB,SAASQ,GAAoB,CAAE,CAC/B,SAASC,GAA6B,CAAE,CACxC,IAAIC,EAAoB,CAAA,EACxBf,EAAOe,EAAmBlB,EAAgB,UAAY,CACpD,OAAO,IACX,CAAG,EACD,IAAImB,EAAW,OAAO,eACpBC,EAA0BD,GAAYA,EAASA,EAASE,EAAO,CAAA,CAAE,CAAC,CAAC,EACrED,GAA2BA,IAA4BxB,GAAMC,EAAO,KAAKuB,EAAyBpB,CAAc,IAAMkB,EAAoBE,GAC1I,IAAIE,EAAKL,EAA2B,UAAYT,EAAU,UAAY,OAAO,OAAOU,CAAiB,EACrG,SAASK,EAAsBC,EAAW,CACxC,CAAC,OAAQ,QAAS,QAAQ,EAAE,QAAQ,SAAUhyB,EAAQ,CACpD2wB,EAAOqB,EAAWhyB,EAAQ,SAAU/F,EAAK,CACvC,OAAO,KAAK,QAAQ+F,EAAQ/F,CAAG,CACvC,CAAO,CACP,CAAK,CACF,CACD,SAASg4B,EAAchB,EAAWiB,EAAa,CAC7C,SAASC,EAAOnyB,EAAQ/F,EAAK+E,EAASC,EAAQ,CAC5C,IAAImzB,GAASf,EAASJ,EAAUjxB,CAAM,EAAGixB,EAAWh3B,CAAG,EACvD,GAAgBm4B,GAAO,OAAnB,QAAyB,CAC3B,IAAIjsB,GAASisB,GAAO,IAClB52B,GAAQ2K,GAAO,MACjB,OAAO3K,IAAqBlC,GAAQkC,EAAK,GAAzB,UAA8B60B,EAAO,KAAK70B,GAAO,SAAS,EAAI02B,EAAY,QAAQ12B,GAAM,OAAO,EAAE,KAAK,SAAUA,GAAO,CACrI22B,EAAO,OAAQ32B,GAAOwD,EAASC,CAAM,CACtC,EAAE,SAAU7B,GAAK,CAChB+0B,EAAO,QAAS/0B,GAAK4B,EAASC,CAAM,CAC9C,CAAS,EAAIizB,EAAY,QAAQ12B,EAAK,EAAE,KAAK,SAAU62B,GAAW,CACxDlsB,GAAO,MAAQksB,GAAWrzB,EAAQmH,EAAM,CACzC,EAAE,SAAUjF,GAAO,CAClB,OAAOixB,EAAO,QAASjxB,GAAOlC,EAASC,CAAM,CACvD,CAAS,CACF,CACDA,EAAOmzB,GAAO,GAAG,CAClB,CACD,IAAIE,EACJhC,EAAe,KAAM,UAAW,CAC9B,MAAO,SAAetwB,EAAQ/F,EAAK,CACjC,SAASs4B,GAA6B,CACpC,OAAO,IAAIL,EAAY,SAAUlzB,GAASC,GAAQ,CAChDkzB,EAAOnyB,EAAQ/F,EAAK+E,GAASC,EAAM,CAC/C,CAAW,CACF,CACD,OAAOqzB,EAAkBA,EAAkBA,EAAgB,KAAKC,EAA4BA,CAA0B,EAAIA,GAC3H,CACP,CAAK,CACF,CACD,SAASnB,EAAiBR,EAASj2B,EAAMu2B,EAAS,CAChD,IAAIxtB,EAAQ,iBACZ,OAAO,SAAU1D,EAAQ/F,EAAK,CAC5B,GAAoByJ,IAAhB,YAAuB,MAAM,IAAI,MAAM,8BAA8B,EACzE,GAAoBA,IAAhB,YAAuB,CACzB,GAAgB1D,IAAZ,QAAoB,MAAM/F,EAC9B,OAAOu4B,EAAU,CAClB,CACD,IAAKtB,EAAQ,OAASlxB,EAAQkxB,EAAQ,IAAMj3B,IAAO,CACjD,IAAIw4B,EAAWvB,EAAQ,SACvB,GAAIuB,EAAU,CACZ,IAAIC,EAAiBC,EAAoBF,EAAUvB,CAAO,EAC1D,GAAIwB,EAAgB,CAClB,GAAIA,IAAmBnB,EAAkB,SACzC,OAAOmB,CACR,CACF,CACD,GAAexB,EAAQ,SAAnB,OAA2BA,EAAQ,KAAOA,EAAQ,MAAQA,EAAQ,YAAyBA,EAAQ,SAApB,QAA4B,CAC7G,GAAyBxtB,IAArB,iBAA4B,MAAMA,EAAQ,YAAawtB,EAAQ,IACnEA,EAAQ,kBAAkBA,EAAQ,GAAG,CAC/C,MAA4BA,EAAQ,SAArB,UAA+BA,EAAQ,OAAO,SAAUA,EAAQ,GAAG,EAC1ExtB,EAAQ,YACR,IAAI0uB,GAASf,EAAST,EAASj2B,EAAMu2B,CAAO,EAC5C,GAAiBkB,GAAO,OAApB,SAA0B,CAC5B,GAAI1uB,EAAQwtB,EAAQ,KAAO,YAAc,iBAAkBkB,GAAO,MAAQb,EAAkB,SAC5F,MAAO,CACL,MAAOa,GAAO,IACd,KAAMlB,EAAQ,IAC1B,CACS,CACWkB,GAAO,OAAnB,UAA4B1uB,EAAQ,YAAawtB,EAAQ,OAAS,QAASA,EAAQ,IAAMkB,GAAO,IACjG,CACP,CACG,CACD,SAASO,EAAoBF,EAAUvB,EAAS,CAC9C,IAAI0B,EAAa1B,EAAQ,OACvBlxB,EAASyyB,EAAS,SAASG,CAAU,EACvC,GAAkB5yB,IAAd,OAAsB,OAAOkxB,EAAQ,SAAW,KAAkB0B,IAAZ,SAA0BH,EAAS,SAAS,SAAcvB,EAAQ,OAAS,SAAUA,EAAQ,IAAM,OAAWyB,EAAoBF,EAAUvB,CAAO,EAAeA,EAAQ,SAApB,UAA4C0B,IAAb,WAA4B1B,EAAQ,OAAS,QAASA,EAAQ,IAAM,IAAI,UAAU,oCAAsC0B,EAAa,UAAU,GAAIrB,EAClY,IAAIa,EAASf,EAASrxB,EAAQyyB,EAAS,SAAUvB,EAAQ,GAAG,EAC5D,GAAgBkB,EAAO,OAAnB,QAAyB,OAAOlB,EAAQ,OAAS,QAASA,EAAQ,IAAMkB,EAAO,IAAKlB,EAAQ,SAAW,KAAMK,EACjH,IAAIsB,EAAOT,EAAO,IAClB,OAAOS,EAAOA,EAAK,MAAQ3B,EAAQuB,EAAS,UAAU,EAAII,EAAK,MAAO3B,EAAQ,KAAOuB,EAAS,QAAsBvB,EAAQ,SAArB,WAAgCA,EAAQ,OAAS,OAAQA,EAAQ,IAAM,QAAYA,EAAQ,SAAW,KAAMK,GAAoBsB,GAAQ3B,EAAQ,OAAS,QAASA,EAAQ,IAAM,IAAI,UAAU,kCAAkC,EAAGA,EAAQ,SAAW,KAAMK,EACpW,CACD,SAASuB,EAAaC,EAAM,CAC1B,IAAIC,EAAQ,CACV,OAAQD,EAAK,CAAC,CACpB,EACI,KAAKA,IAASC,EAAM,SAAWD,EAAK,CAAC,GAAI,KAAKA,IAASC,EAAM,WAAaD,EAAK,CAAC,EAAGC,EAAM,SAAWD,EAAK,CAAC,GAAI,KAAK,WAAW,KAAKC,CAAK,CACzI,CACD,SAASC,EAAcD,EAAO,CAC5B,IAAIZ,EAASY,EAAM,YAAc,GACjCZ,EAAO,KAAO,SAAU,OAAOA,EAAO,IAAKY,EAAM,WAAaZ,CAC/D,CACD,SAASjB,EAAQL,EAAa,CAC5B,KAAK,WAAa,CAAC,CACjB,OAAQ,MACd,CAAK,EAAGA,EAAY,QAAQgC,EAAc,IAAI,EAAG,KAAK,MAAM,EAAE,CAC3D,CACD,SAASjB,EAAOqB,EAAU,CACxB,GAAIA,EAAU,CACZ,IAAIC,EAAiBD,EAAS1C,CAAc,EAC5C,GAAI2C,EAAgB,OAAOA,EAAe,KAAKD,CAAQ,EACvD,GAAkB,OAAOA,EAAS,MAA9B,WAAoC,OAAOA,EAC/C,GAAI,CAAC,MAAMA,EAAS,MAAM,EAAG,CAC3B,IAAIz7B,EAAI,GACN6d,EAAO,SAASA,GAAO,CACrB,KAAO,EAAE7d,EAAIy7B,EAAS,QAAS,GAAI7C,EAAO,KAAK6C,EAAUz7B,CAAC,EAAG,OAAO6d,EAAK,MAAQ4d,EAASz7B,CAAC,EAAG6d,EAAK,KAAO,GAAIA,EAC9G,OAAOA,EAAK,MAAQ,OAAWA,EAAK,KAAO,GAAIA,CAC3D,EACQ,OAAOA,EAAK,KAAOA,CACpB,CACF,CACD,MAAO,CACL,KAAMkd,CACZ,CACG,CACD,SAASA,GAAa,CACpB,MAAO,CACL,MAAO,OACP,KAAM,EACZ,CACG,CACD,OAAOhB,EAAkB,UAAYC,EAA4BnB,EAAewB,EAAI,cAAe,CACjG,MAAOL,EACP,aAAc,EAClB,CAAG,EAAGnB,EAAemB,EAA4B,cAAe,CAC5D,MAAOD,EACP,aAAc,EACf,CAAA,EAAGA,EAAkB,YAAcb,EAAOc,EAA4Bf,EAAmB,mBAAmB,EAAG/yB,EAAQ,oBAAsB,SAAUy1B,EAAQ,CAC9J,IAAInuB,EAAqB,OAAOmuB,GAArB,YAA+BA,EAAO,YACjD,MAAO,CAAC,CAACnuB,IAASA,IAASusB,IAA8CvsB,EAAK,aAAeA,EAAK,QAAlD,oBACpD,EAAKtH,EAAQ,KAAO,SAAUy1B,EAAQ,CAClC,OAAO,OAAO,eAAiB,OAAO,eAAeA,EAAQ3B,CAA0B,GAAK2B,EAAO,UAAY3B,EAA4Bd,EAAOyC,EAAQ1C,EAAmB,mBAAmB,GAAI0C,EAAO,UAAY,OAAO,OAAOtB,CAAE,EAAGsB,CAC9O,EAAKz1B,EAAQ,MAAQ,SAAU1D,EAAK,CAChC,MAAO,CACL,QAASA,CACf,CACA,EAAK83B,EAAsBE,EAAc,SAAS,EAAGtB,EAAOsB,EAAc,UAAWxB,EAAqB,UAAY,CAClH,OAAO,IACR,CAAA,EAAG9yB,EAAQ,cAAgBs0B,EAAet0B,EAAQ,MAAQ,SAAUizB,EAASC,EAASl2B,EAAMm2B,EAAaoB,EAAa,CAC1GA,IAAX,SAA2BA,EAAc,SACzC,IAAIv2B,EAAO,IAAIs2B,EAAcxd,EAAKmc,EAASC,EAASl2B,EAAMm2B,CAAW,EAAGoB,CAAW,EACnF,OAAOv0B,EAAQ,oBAAoBkzB,CAAO,EAAIl1B,EAAOA,EAAK,KAAM,EAAC,KAAK,SAAUwK,EAAQ,CACtF,OAAOA,EAAO,KAAOA,EAAO,MAAQxK,EAAK,MAC/C,CAAK,CACF,EAAEo2B,EAAsBD,CAAE,EAAGnB,EAAOmB,EAAIpB,EAAmB,WAAW,EAAGC,EAAOmB,EAAItB,EAAgB,UAAY,CAC/G,OAAO,IACR,CAAA,EAAGG,EAAOmB,EAAI,WAAY,UAAY,CACrC,MAAO,oBACR,CAAA,EAAGn0B,EAAQ,KAAO,SAAUmX,EAAK,CAChC,IAAIue,EAAS,OAAOve,CAAG,EACrB9Q,EAAO,CAAA,EACT,QAAS9K,KAAOm6B,EAAQrvB,EAAK,KAAK9K,CAAG,EACrC,OAAO8K,EAAK,UAAW,SAASsR,GAAO,CACrC,KAAOtR,EAAK,QAAS,CACnB,IAAI9K,EAAM8K,EAAK,MACf,GAAI9K,KAAOm6B,EAAQ,OAAO/d,EAAK,MAAQpc,EAAKoc,EAAK,KAAO,GAAIA,CAC7D,CACD,OAAOA,EAAK,KAAO,GAAIA,CAC7B,CACG,EAAE3X,EAAQ,OAASk0B,EAAQV,EAAQ,UAAY,CAC9C,YAAaA,EACb,MAAO,SAAemC,EAAe,CACnC,GAAI,KAAK,KAAO,EAAG,KAAK,KAAO,EAAG,KAAK,KAAO,KAAK,MAAQ,OAAW,KAAK,KAAO,GAAI,KAAK,SAAW,KAAM,KAAK,OAAS,OAAQ,KAAK,IAAM,OAAW,KAAK,WAAW,QAAQL,CAAa,EAAG,CAACK,EAAe,QAASr1B,KAAQ,KAAcA,EAAK,OAAO,CAAC,IAArB,KAA0BoyB,EAAO,KAAK,KAAMpyB,CAAI,GAAK,CAAC,MAAM,CAACA,EAAK,MAAM,CAAC,CAAC,IAAM,KAAKA,CAAI,EAAI,OACrU,EACD,KAAM,UAAgB,CACpB,KAAK,KAAO,GACZ,IAAIs1B,EAAa,KAAK,WAAW,CAAC,EAAE,WACpC,GAAgBA,EAAW,OAAvB,QAA6B,MAAMA,EAAW,IAClD,OAAO,KAAK,IACb,EACD,kBAAmB,SAA2BC,EAAW,CACvD,GAAI,KAAK,KAAM,MAAMA,EACrB,IAAItC,EAAU,KACd,SAASuC,EAAOC,GAAKC,GAAQ,CAC3B,OAAOvB,EAAO,KAAO,QAASA,EAAO,IAAMoB,EAAWtC,EAAQ,KAAOwC,GAAKC,KAAWzC,EAAQ,OAAS,OAAQA,EAAQ,IAAM,QAAY,CAAC,CAACyC,EAC3I,CACD,QAASl8B,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAIu7B,EAAQ,KAAK,WAAWv7B,CAAC,EAC3B26B,EAASY,EAAM,WACjB,GAAeA,EAAM,SAAjB,OAAyB,OAAOS,EAAO,KAAK,EAChD,GAAIT,EAAM,QAAU,KAAK,KAAM,CAC7B,IAAIY,EAAWvD,EAAO,KAAK2C,EAAO,UAAU,EAC1Ca,GAAaxD,EAAO,KAAK2C,EAAO,YAAY,EAC9C,GAAIY,GAAYC,GAAY,CAC1B,GAAI,KAAK,KAAOb,EAAM,SAAU,OAAOS,EAAOT,EAAM,SAAU,EAAE,EAChE,GAAI,KAAK,KAAOA,EAAM,WAAY,OAAOS,EAAOT,EAAM,UAAU,CACjE,SAAUY,GACT,GAAI,KAAK,KAAOZ,EAAM,SAAU,OAAOS,EAAOT,EAAM,SAAU,EAAE,MAC3D,CACL,GAAI,CAACa,GAAY,MAAM,IAAI,MAAM,wCAAwC,EACzE,GAAI,KAAK,KAAOb,EAAM,WAAY,OAAOS,EAAOT,EAAM,UAAU,CACjE,CACF,CACF,CACF,EACD,OAAQ,SAAgBpwB,EAAM3I,EAAK,CACjC,QAASxC,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAIu7B,EAAQ,KAAK,WAAWv7B,CAAC,EAC7B,GAAIu7B,EAAM,QAAU,KAAK,MAAQ3C,EAAO,KAAK2C,EAAO,YAAY,GAAK,KAAK,KAAOA,EAAM,WAAY,CACjG,IAAIc,EAAed,EACnB,KACD,CACF,CACDc,IAA6BlxB,IAAZ,SAAmCA,IAAf,aAAwBkxB,EAAa,QAAU75B,GAAOA,GAAO65B,EAAa,aAAeA,EAAe,MAC7I,IAAI1B,EAAS0B,EAAeA,EAAa,WAAa,CAAA,EACtD,OAAO1B,EAAO,KAAOxvB,EAAMwvB,EAAO,IAAMn4B,EAAK65B,GAAgB,KAAK,OAAS,OAAQ,KAAK,KAAOA,EAAa,WAAYvC,GAAoB,KAAK,SAASa,CAAM,CACjK,EACD,SAAU,SAAkBA,EAAQ2B,EAAU,CAC5C,GAAgB3B,EAAO,OAAnB,QAAyB,MAAMA,EAAO,IAC1C,OAAmBA,EAAO,OAAnB,SAA0CA,EAAO,OAAtB,WAA6B,KAAK,KAAOA,EAAO,IAAmBA,EAAO,OAApB,UAA4B,KAAK,KAAO,KAAK,IAAMA,EAAO,IAAK,KAAK,OAAS,SAAU,KAAK,KAAO,OAAsBA,EAAO,OAApB,UAA4B2B,IAAa,KAAK,KAAOA,GAAWxC,CACrQ,EACD,OAAQ,SAAgByC,EAAY,CAClC,QAASv8B,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAIu7B,EAAQ,KAAK,WAAWv7B,CAAC,EAC7B,GAAIu7B,EAAM,aAAegB,EAAY,OAAO,KAAK,SAAShB,EAAM,WAAYA,EAAM,QAAQ,EAAGC,EAAcD,CAAK,EAAGzB,CACpH,CACF,EACD,MAAS,SAAgB0C,EAAQ,CAC/B,QAASx8B,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAIu7B,EAAQ,KAAK,WAAWv7B,CAAC,EAC7B,GAAIu7B,EAAM,SAAWiB,EAAQ,CAC3B,IAAI7B,EAASY,EAAM,WACnB,GAAgBZ,EAAO,OAAnB,QAAyB,CAC3B,IAAI8B,EAAS9B,EAAO,IACpBa,EAAcD,CAAK,CACpB,CACD,OAAOkB,CACR,CACF,CACD,MAAM,IAAI,MAAM,uBAAuB,CACxC,EACD,cAAe,SAAuBhB,EAAUiB,EAAYC,EAAS,CACnE,OAAO,KAAK,SAAW,CACrB,SAAUvC,EAAOqB,CAAQ,EACzB,WAAYiB,EACZ,QAASC,CACjB,EAAoB,KAAK,SAAhB,SAA2B,KAAK,IAAM,QAAY7C,CACtD,CACF,EAAE5zB,CACL,CC9SA,SAAS02B,GAAmBC,EAAKt1B,EAASC,EAAQs1B,EAAOC,EAAQt7B,EAAKe,EAAK,CACzE,GAAI,CACF,IAAI44B,EAAOyB,EAAIp7B,CAAG,EAAEe,CAAG,EACnBuB,EAAQq3B,EAAK,KAClB,OAAQ3xB,EAAO,CACdjC,EAAOiC,CAAK,EACZ,MACD,CACG2xB,EAAK,KACP7zB,EAAQxD,CAAK,EAEb,QAAQ,QAAQA,CAAK,EAAE,KAAK+4B,EAAOC,CAAM,CAE7C,CACe,SAASC,GAAkBnD,EAAI,CAC5C,OAAO,UAAY,CACjB,IAAI32B,EAAO,KACToH,EAAO,UACT,OAAO,IAAI,QAAQ,SAAU/C,EAASC,EAAQ,CAC5C,IAAIq1B,EAAMhD,EAAG,MAAM32B,EAAMoH,CAAI,EAC7B,SAASwyB,EAAM/4B,EAAO,CACpB64B,GAAmBC,EAAKt1B,EAASC,EAAQs1B,EAAOC,EAAQ,OAAQh5B,CAAK,CACtE,CACD,SAASg5B,EAAOp3B,EAAK,CACnBi3B,GAAmBC,EAAKt1B,EAASC,EAAQs1B,EAAOC,EAAQ,QAASp3B,CAAG,CACrE,CACDm3B,EAAM,MAAS,CACrB,CAAK,CACL,CACA,6IC5Be,SAASG,GAAgC75B,EAAG85B,EAAgB,CACzE,IAAIC,EAAK,OAAO,OAAW,KAAe/5B,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAC9E,GAAI+5B,EAAI,OAAQA,EAAKA,EAAG,KAAK/5B,CAAC,GAAG,KAAK,KAAK+5B,CAAE,EAC7C,GAAI,MAAM,QAAQ/5B,CAAC,IAAM+5B,EAAKt4B,GAA2BzB,CAAC,IAAM85B,GAAkB95B,GAAK,OAAOA,EAAE,QAAW,SAAU,CAC/G+5B,IAAI/5B,EAAI+5B,GACZ,IAAI,EAAI,EACR,OAAO,UAAY,CACjB,OAAI,GAAK/5B,EAAE,OAAe,CACxB,KAAM,EACd,EACa,CACL,KAAM,GACN,MAAOA,EAAE,GAAG,CACpB,CACA,CACG,CACD,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAC7J;;;;ECVA,IAAIg6B,GAAwB,OAAO,sBAC/BC,GAAiB,OAAO,UAAU,eAClCC,GAAmB,OAAO,UAAU,qBAExC,SAASC,GAASlgB,EAAK,CACtB,GAAIA,GAAQ,KACX,MAAM,IAAI,UAAU,uDAAuD,EAG5E,OAAO,OAAOA,CAAG,CAClB,CAEA,SAASmgB,IAAkB,CAC1B,GAAI,CACH,GAAI,CAAC,OAAO,OACX,MAAO,GAMR,IAAIC,EAAQ,IAAI,OAAO,KAAK,EAE5B,GADAA,EAAM,CAAC,EAAI,KACP,OAAO,oBAAoBA,CAAK,EAAE,CAAC,IAAM,IAC5C,MAAO,GAKR,QADIC,EAAQ,CAAA,EACH19B,EAAI,EAAGA,EAAI,GAAIA,IACvB09B,EAAM,IAAM,OAAO,aAAa19B,CAAC,CAAC,EAAIA,EAEvC,IAAI29B,EAAS,OAAO,oBAAoBD,CAAK,EAAE,IAAI,SAAUl5B,EAAG,CAC/D,OAAOk5B,EAAMl5B,CAAC,CACjB,CAAG,EACD,GAAIm5B,EAAO,KAAK,EAAE,IAAM,aACvB,MAAO,GAIR,IAAIC,EAAQ,CAAA,EAIZ,MAHA,uBAAuB,MAAM,EAAE,EAAE,QAAQ,SAAUC,EAAQ,CAC1DD,EAAMC,CAAM,EAAIA,CACnB,CAAG,EACG,OAAO,KAAK,OAAO,OAAO,CAAE,EAAED,CAAK,CAAC,EAAE,KAAK,EAAE,IAC/C,sBAKF,MAAa,CAEb,MAAO,EACP,CACF,CAEA,IAAAE,GAAiBN,GAAe,EAAK,OAAO,OAAS,SAAUj8B,EAAQC,EAAQ,CAK9E,QAJIyd,EACA8e,EAAKR,GAASh8B,CAAM,EACpBy8B,EAEKhsB,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CAC1CiN,EAAO,OAAO,UAAUjN,CAAC,CAAC,EAE1B,QAASvQ,KAAOwd,EACXoe,GAAe,KAAKpe,EAAMxd,CAAG,IAChCs8B,EAAGt8B,CAAG,EAAIwd,EAAKxd,CAAG,GAIpB,GAAI27B,GAAuB,CAC1BY,EAAUZ,GAAsBne,CAAI,EACpC,QAASjf,EAAI,EAAGA,EAAIg+B,EAAQ,OAAQh+B,IAC/Bs9B,GAAiB,KAAKre,EAAM+e,EAAQh+B,CAAC,CAAC,IACzC+9B,EAAGC,EAAQh+B,CAAC,CAAC,EAAIif,EAAK+e,EAAQh+B,CAAC,CAAC,EAGlC,CACD,CAED,OAAO+9B,CACR","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67]}