neozipkit 1.0.2 → 1.0.5

package/dist/browser-esm/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js", "../../../../node_modules/.pnpm/ieee754@1.2.1/node_modules/ieee754/index.js", "../../../../node_modules/.pnpm/buffer@6.0.3/node_modules/buffer/index.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/trees.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/adler32.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/crc32.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/messages.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/constants.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/deflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/utils/common.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/utils/strings.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/zstream.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/deflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inffast.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inftrees.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/gzheader.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/inflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/index.js", "../../src/browser/index.esm.ts", "../../src/core/constants/Errors.ts", "../../src/core/constants/Headers.ts", "../../src/core/components/Logger.ts", "../../src/browser/crypto-browser-shim.js", "../../src/core/encryption/ZipCrypto.ts", "../../src/core/ZipEntry.ts", "../../src/types/index.ts", "../../src/browser/zstd-browser-shim.ts", "../../src/core/components/HashCalculator.ts", "../../src/core/encryption/AesCrypto.ts", "../../src/core/encryption/NeoCrypto.ts", "../../src/core/ZipCompress.ts", "../../src/node/LegacyZstd.ts", "../../src/core/ZipDecompress.ts", "../../src/core/Zipkit.ts", "../../src/core/ZipCopy.ts", "../../src/core/components/Support.ts", "../../src/core/components/Util.ts", "../../src/core/components/ProgressTracker.ts", "../../src/core/encryption/Manager.ts", "../../src/core/version.ts", "../../src/core/index.ts", "../../src/browser/ZipkitBrowser.ts"],
-  "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", "/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n", "/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\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/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH    = 3;\nconst MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES       = 30;\n/* number of distance codes */\n\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nconst MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES + 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\nconst 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\nconst _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\nconst _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst 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\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; 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  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS + 1);\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 */\nconst init_block = (s) => {\n\n  let 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.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block(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 */\nconst _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  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nmodule.exports._tr_init  = _tr_init;\nmodule.exports._tr_stored_block = _tr_stored_block;\nmodule.exports._tr_flush_block  = _tr_flush_block;\nmodule.exports._tr_tally = _tr_tally;\nmodule.exports._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\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\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\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\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\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\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = require('./trees');\nconst adler32 = require('./adler32');\nconst crc32   = require('./crc32');\nconst msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_PARTIAL_FLUSH, Z_FULL_FLUSH, Z_FINISH, Z_BLOCK,\n  Z_OK, Z_STREAM_END, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR,\n  Z_DEFAULT_COMPRESSION,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY,\n  Z_UNKNOWN,\n  Z_DEFLATED\n} = require('./constants');\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = msg[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n\n\n/* ===========================================================================\n * Insert string str in the dictionary and set match_head to the previous head\n * of the hash chain (the most recent string with same hash key). Return\n * the previous length of the hash chain.\n * IN  assertion: all calls to INSERT_STRING are made with consecutive input\n *    characters and the first MIN_MATCH bytes of str are valid (except for\n *    the last MIN_MATCH-1 bytes of the input file).\n */\nconst INSERT_STRING = (s, str) => {\n  let h;\n  if (s.legacy_hash) {\n    /* UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]); */\n    h = s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n  } else {\n    // ANZAC++ hash: reads 4 bytes, matches node.js zlib output (legacyHash\n    // restores classic zlib hash). Faster, with fewer collisions.\n    const w = s.window;\n    // Read 4 bytes little-endian. Math.imul reproduces C uint32 overflow in\n    // `(value * 66521 + 66521) >> 16` exactly.\n    const value = w[str] | (w[str + 1] << 8) | (w[str + 2] << 16) | (w[str + 3] << 24);\n    h = s.ins_h = ((Math.imul(value, 66521) + 66521) >>> 16) & s.hash_mask;\n  }\n  const hash_head = s.prev[str & s.w_mask] = s.head[h];\n  s.head[h] = str;\n  return hash_head;\n};\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(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 */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (!s.legacy_hash) {\n      /* The 4-byte hash reads one extra byte, so it needs one more available. */\n      if (s.lookahead + s.insert > MIN_MATCH) {\n        str = s.strstart - s.insert;\n        while (s.insert) {\n          INSERT_STRING(s, str);\n          str++;\n          s.insert--;\n          if (s.lookahead + s.insert <= MIN_MATCH) {\n            break;\n          }\n        }\n      }\n    } else if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        INSERT_STRING(s, str);\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH) ||\n                        flush === Z_NO_FLUSH ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH && flush !== Z_FINISH &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH) && flush !== Z_NO_FLUSH &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\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      hash_head = INSERT_STRING(s, s.strstart);\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          hash_head = INSERT_STRING(s, s.strstart);\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        if (s.legacy_hash) {\n          s.ins_h = s.window[s.strstart];\n          /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n          /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n           * matter since it will be recomputed at next deflate call.\n           */\n        }\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\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      hash_head = INSERT_STRING(s, s.strstart);\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          hash_head = INSERT_STRING(s, s.strstart);\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* 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.legacy_hash = 0; /* use classic zlib hash instead of default ANZAC++ */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR;\n  }\n  strm.state.gzhead = head;\n  return Z_OK;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy, legacyHash) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  let 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 || (windowBits === 8 && wrap !== 1)) {\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  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.legacy_hash = legacyHash ? 1 : 0;\n\n  s.hash_bits = memLevel + 7;\n  /* ANZAC++ hash needs >= 15 hash bits to span its 4 read bytes. */\n  if (!s.legacy_hash && s.hash_bits < 15) {\n    s.hash_bits = 15;\n  }\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n};\n\n\n/* ========================================================================= */\nconst deflate = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\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  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\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\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\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  const status = strm.state.status;\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 */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\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    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      INSERT_STRING(s, 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\nmodule.exports.deflateInit = deflateInit;\nmodule.exports.deflateInit2 = deflateInit2;\nmodule.exports.deflateReset = deflateReset;\nmodule.exports.deflateResetKeep = deflateResetKeep;\nmodule.exports.deflateSetHeader = deflateSetHeader;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateEnd = deflateEnd;\nmodule.exports.deflateSetDictionary = deflateSetDictionary;\nmodule.exports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n", "'use strict';\n\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nmodule.exports.assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nmodule.exports.flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n", "// String encode/decode helpers\n'use strict';\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[255] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nmodule.exports.string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nmodule.exports.buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nmodule.exports.utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n", "'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\nconst zlib_deflate = require('./zlib/deflate');\nconst utils        = require('./utils/common');\nconst strings      = require('./utils/strings');\nconst msg          = require('./zlib/messages');\nconst ZStream      = require('./zlib/zstream');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\nconst defaultOptions = {\n  level: Z_DEFAULT_COMPRESSION,\n  method: Z_DEFLATED,\n  chunkSize: 16384,\n  windowBits: 15,\n  memLevel: 8,\n  strategy: Z_DEFAULT_STRATEGY,\n  legacyHash: true\n};\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * - `legacyHash` (Boolean) - use the classic zlib hash (default), which matches\n *   canonical zlib output byte-for-byte. Set to `false` to use the faster\n *   ANZAC++ hash, which matches recent (chromium) node.js output instead.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n  this.options = utils.assign({}, defaultOptions, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new ZStream();\n  this.strm.avail_out = 0;\n\n  let status = zlib_deflate.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy,\n    opt.legacyHash\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  if (opt.header) {\n    zlib_deflate.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK) {\n      throw new Error(msg[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = zlib_deflate.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = zlib_deflate.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    this.result = utils.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n  const deflator = new Deflate(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate(input, options);\n}\n\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.constants = require('./zlib/constants');\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\nconst BAD = 16209;       /* got a data error -- remain here until reset */\nconst TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\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\nconst MAXBITS = 15;\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 199, 75\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES || 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    match = 20;\n\n  } else if (type === LENS) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS && 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] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS && 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\n\nmodule.exports = inflate_table;\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\nconst adler32       = require('./adler32');\nconst crc32         = require('./crc32');\nconst inflate_fast  = require('./inffast');\nconst inflate_table = require('./inftrees');\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH, Z_BLOCK, Z_TREES,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR,\n  Z_DEFLATED\n} = require('./constants');\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    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 */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.window = new Uint8Array(1 << state.wbits);\n  }\n\n  /* if window not in use yet, initialize */\n  if (state.wsize === 0) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR;\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          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = 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 ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(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.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END;\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 & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(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\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const 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\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\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\n\nmodule.exports.inflateReset = inflateReset;\nmodule.exports.inflateReset2 = inflateReset2;\nmodule.exports.inflateResetKeep = inflateResetKeep;\nmodule.exports.inflateInit = inflateInit;\nmodule.exports.inflateInit2 = inflateInit2;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateEnd = inflateEnd;\nmodule.exports.inflateGetHeader = inflateGetHeader;\nmodule.exports.inflateSetDictionary = inflateSetDictionary;\nmodule.exports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n", "'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 GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nmodule.exports = GZheader;\n", "'use strict';\n\n\nconst zlib_inflate = require('./zlib/inflate');\nconst utils        = require('./utils/common');\nconst strings      = require('./utils/strings');\nconst msg          = require('./zlib/messages');\nconst ZStream      = require('./zlib/zstream');\nconst GZheader     = require('./zlib/gzheader');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\nconst defaultOptions = {\n  chunkSize: 1024 * 64,\n  windowBits: 15,\n  to: ''\n};\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n  this.options = utils.assign({}, defaultOptions, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new ZStream();\n  this.strm.avail_out = 0;\n\n  let status  = zlib_inflate.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  this.header = new GZheader();\n\n  zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(msg[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = zlib_inflate.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = zlib_inflate.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = zlib_inflate.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Only the gzip format defines concatenated members (RFC 1952: a gzip file\n    // is \"a series of members\"). A zlib stream (RFC 1950) ends after its\n    // ADLER32, and a raw DEFLATE stream (RFC 1951) ends after its final block -\n    // neither format allows anything to follow, so bytes after the end are not\n    // ours to interpret and must be left in the input. Restart decoding only\n    // for a gzip member: `state.flags` is non-zero only once a gzip header has\n    // actually been decoded (it stays 0 for a zlib member, even when the format\n    // was auto-detected and the gzip bit of `wrap` is set). A trailing zero\n    // byte is padding, not the start of a member (no member can begin with 0).\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           (strm.state.wrap & 2) && strm.state.flags !== 0 &&\n           strm.input[strm.next_in] !== 0)\n    {\n      zlib_inflate.inflateReset(strm);\n      status = zlib_inflate.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      // Flush output if buffer is full, stream ended, or an explicit flush was\n      // requested (e.g. Z_SYNC_FLUSH) - to push out the tail, same as node's zlib.\n      if (strm.avail_out === 0 || status === Z_STREAM_END || _flush_mode > 0) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n\n          // Force a fresh output buffer on next iteration / next push, so the\n          // already emitted tail is not sent again.\n          strm.avail_out = 0;\n          strm.next_out = 0;\n        }\n      }\n    }\n\n    // A full output buffer means there may be more to produce - allocate a new\n    // one and call inflate again. The status depends on the flush mode: with\n    // Z_NO_FLUSH a full buffer is reported as Z_OK, but with Z_FINISH the same\n    // situation is reported as Z_BUF_ERROR (\"could not make progress now\",\n    // non-fatal) even though output is still pending. Both must continue; the\n    // distinction that matters is purely \"was the output buffer exhausted\".\n    if ((status === Z_OK || status === Z_BUF_ERROR) && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = zlib_inflate.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) {\n      // Input is exhausted. If the caller declared this the end of the stream\n      // (Z_FINISH) but we never saw Z_STREAM_END, the compressed data ended\n      // before its terminating marker - i.e. it is truncated/incomplete. That\n      // is an error: returning the partial output as success would be\n      // indistinguishable from a complete decode, hiding the data loss. Report\n      // it via Z_BUF_ERROR. (Reached only when the output buffer still had room\n      // - a full buffer is handled by the `continue` above - so this genuinely\n      // means \"ran out of input\", not \"ran out of output\".)\n      if (_flush_mode === Z_FINISH) {\n        status = zlib_inflate.inflateEnd(this.strm);\n        this.onEnd(status === Z_OK ? Z_BUF_ERROR : status);\n        this.ended = true;\n        return false;\n      }\n      break;\n    }\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n  const inflator = new Inflate(options);\n\n  inflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || msg[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = inflate;\nmodule.exports.constants = require('./zlib/constants');\n", "// Top level file is just a mixin of submodules & constants\n'use strict';\n\nconst { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate');\n\nconst { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate');\n\nconst constants = require('./lib/zlib/constants');\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = ungzip;\nmodule.exports.constants = constants;\n", "// =============================================================================\n// NeoZipkit - Browser ES Module Entry Point\n// =============================================================================\n// This is a clean ES module entry point for browser bundles\n// All exports are named exports for better tree-shaking support\n\n// Buffer polyfill for browser\nimport { Buffer } from 'buffer';\nif (typeof globalThis !== 'undefined') {\n  (globalThis as any).Buffer = Buffer;\n}\n\n// Core exports\nexport * from '../core';\n\n// Browser-specific class\nexport { default as ZipkitBrowser } from './ZipkitBrowser';\n\n// Re-export ZipEntry as named export for convenience\nexport { default as ZipEntry } from '../core/ZipEntry';\n\n// Re-export commonly used types and constants\nexport type { CompressOptions, CreateZipOptions } from '../core/ZipCompress';\nexport type { FileData } from '../types';\nexport * from '../core/constants/Headers';\nexport * from '../core/constants/Errors';\n\n// Platform utilities\nexport const PlatformUtils = {\n  isBrowser: typeof window !== 'undefined' && typeof document !== 'undefined',\n  isNode: typeof process !== 'undefined' && process.versions && process.versions.node,\n};\n", "// ======================================\n//\tErrors.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Error messages\n\nexport default {\n    /* Header error messages */\n    INVALID_LOC: \"Invalid LOC header (bad signature)\",\n    INVALID_CEN: \"Invalid CEN header (bad signature)\",\n    INVALID_END: \"Invalid END header (bad signature)\",\n\n    /* ZipEntry error messages*/\n    NO_DATA: \"Nothing to decompress\",\n    FILE_IN_THE_WAY: \"There is a file in the way: %s\",\n    UNKNOWN_METHOD: \"Invalid/unsupported compression method\",\n\n    /* Encryption Errors */\n    STRONG_ENCRYPT_UNSUPPORTED: \"Strong Encryption is not supported\",\n\n    /* Timestamp error messages */\n    INVALID_TIMESTAMP: \"Invalid timestamp\",\n    TIMESTAMP_FAILED: \"Failed to create the timestamp\",\n\n    /* Inflater error messages */\n    AVAIL_DATA: \"inflate::Available inflate data did not terminate\",\n    INVALID_DISTANCE: \"inflate::Invalid literal/length or distance code in fixed or dynamic block\",\n    TO_MANY_CODES: \"inflate::Dynamic block code description: too many length or distance codes\",\n    INVALID_REPEAT_LEN: \"inflate::Dynamic block code description: repeat more than specified lengths\",\n    INVALID_REPEAT_FIRST: \"inflate::Dynamic block code description: repeat lengths with no first length\",\n    INCOMPLETE_CODES: \"inflate::Dynamic block code description: code lengths codes incomplete\",\n    INVALID_DYN_DISTANCE: \"inflate::Dynamic block code description: invalid distance code lengths\",\n    INVALID_CODES_LEN: \"inflate::Dynamic block code description: invalid literal/length code lengths\",\n    INVALID_STORE_BLOCK: \"inflate::Stored block length did not match one's complement\",\n    INVALID_BLOCK_TYPE: \"inflate::Invalid block type (type == 3)\",\n\n    /* Extract error messages */\n    INVALID_CMP_DATA_LENGTH: \"Compressed data length does not match the expected length\",\n    EXTRACT_FAILED: \"Failed to extract file\",\n    INVALID_CRC: \"CRC32 checksum does not match the expected value\",\n    UNKNOWN_SHA256: \"The SHA-256 hash has not been saved\",\n    INVALID_SHA256: \"The SHA-256 hash does not match the expected value\",\n\n    /* NEO-ZIP error messages */\n    CANT_EXTRACT_FILE: \"Could not extract the file\",\n    CANT_OVERRIDE: \"Target file already exists\",\n    NO_ZIP: \"No zip file was loaded\",\n    NO_ENTRY: \"Entry doesn't exist\",\n    DIRECTORY_CONTENT_ERROR: \"A directory cannot have content\",\n    FILE_NOT_FOUND: \"File not found: %s\",\n    NOT_IMPLEMENTED: \"Not implemented\",\n    INVALID_FILENAME: \"Invalid filename\",\n    INVALID_FORMAT: \"Invalid or unsupported zip format. No END header found\",\n\n    // NeoZipKit error messages\n    NO_STREAM_SUPPORT: \"Streams are not supported in this environment\",\n    NO_BLOB_SUPPORT: \"Blobs are not supported in this environment\",\n    NO_FILE_READER_SUPPORT: \"FileReader is not supported in this environment\",\n\n    // Create Zip error messages\n    NO_FILES: \"No files added, Zip file not created\",\n\n    DATATYPE_STRING_UNSUPPORTED: \"The String type is not supported by this platform.\",\n    DATATYPE_ARRAY_UNSUPPORTED: \"The Array type is not supported by this platform.\",\n    DATATYPE_BUFFER_UNSUPPORTED: \"The Buffer type is not supported by this platform.\",\n    DATATYPE_BLOB_UNSUPPORTED: \"The Blob type is not supported by this platform.\",\n    DATATYPE_U8ARRAY_UNSUPPORTED: \"The uint8Array type is not supported by this platform.\",\n    DATATYPE_ARRAYBUFFER_UNSUPPORTED: \"The ArrayBuffer type is not supported by this platform.\",\n    DATATYPE_UNSUPPORTED: \"Unsupported input type.\",\n\n    COMPRESS_FAILED: 'Failed to compress data',\n    COMPRESSION_ERROR: 'Error occurred during compression',\n    DECOMPRESSION_ERROR: 'Error occurred during decompression',\n\n    ENCRYPT_FAILED: 'Encryption failed',\n};\n\n\n", "// ======================================\n//\tHeaders.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Zip File Format Constants\n\nexport const LOCAL_FILE_HEADER = 'PK\\x03\\x04';\nexport const CENTRAL_FILE_HEADER = 'PK\\x01\\x02';\nexport const CENTRAL_DIRECTORY_END = 'PK\\x05\\x06';\nexport const ZIP64_CENTRAL_DIRECTORY_LOCATOR = 'PK\\x06\\x07';\nexport const ZIP64_CENTRAL_DIRECTORY_END = 'PK\\x06\\x06';\nexport const DATA_DESCRIPTOR = 'PK\\x07\\x08';\n\nexport const TIMESTAMP_SUBMITTED = 'META-INF/TS-SUBMIT.OTS';\nexport const TIMESTAMP_METADATA = 'META-INF/TIMESTAMP.OTS';\nexport const TOKENIZED_METADATA = 'META-INF/NZIP.TOKEN';\n\n// Local file header\nexport const LOCAL_HDR = {\n  SIZE:       30,     // LOC header size in bytes\n  SIGNATURE:  0x04034b50,  // \"PK\\003\\004\"\n  VER_EXTRACT: 4,     // version needed to extract\n  FLAGS:       6,     // general purpose bit flag\n  COMPRESSION: 8,     // compression method\n  TIMEDATE_DOS: 10,   // modification time (2 bytes time, 2 bytes date)\n  CRC:        14,     // uncompressed file crc-32 value\n  CMP_SIZE:   18,     // compressed size\n  UNCMP_SIZE: 22,     // uncompressed size\n  FNAME_LEN:  26,     // filename length\n  EXTRA_LEN:  28      // extra field length\n};\nexport const ENCRYPT_HDR_SIZE = 12;\n\n// WinZip AES encryption constants\nexport const AES256_SALT_SIZE = 16;\nexport const AES256_KEY_SIZE = 32;\nexport const AES256_PWD_VERIFY_SIZE = 2;\nexport const AES_AUTH_CODE_SIZE = 10;\nexport const AES_EXTRA_FIELD_SIZE = 11;\nexport const AES_OVERHEAD = AES256_SALT_SIZE + AES256_PWD_VERIFY_SIZE + AES_AUTH_CODE_SIZE; // 28 bytes\n\n// NeoEncrypt extra field (HDR_ID.NEO_CRYPTO): id(2) + TSize(2) + payload; v1 payload = 11 bytes\nexport const NEO_CRYPTO_PAYLOAD_V1 = 11;\nexport const NEO_CRYPTO_EXTRA_FIELD_SIZE = 4 + NEO_CRYPTO_PAYLOAD_V1; // 15 bytes total per record (matches AES-style LOC extra slot)\n/** Magic bytes for NEO payload v1: ASCII `NEZ` + NUL */\nexport const NEO_CRYPTO_MAGIC_BYTES: readonly number[] = [0x4e, 0x45, 0x5a, 0x00];\n\n// Data descriptor\nexport const DATA_DESC = {\n  SIGNATURE:  0x08074b50,  // \"PK\\007\\008\"\n  SIZE:       16,     // EXT header size in bytes\n  CRC:        4,      // uncompressed file crc-32 value (offset)\n  CMP_SIZE:   8,      // compressed size (offset)\n  UNCMP_SIZE: 12      // uncompressed size\n};\n\n// The central directory file header \nexport const CENTRAL_DIR = {\n  SIZE:       46,     // Central directory header size\n  SIGNATURE:  0x02014b50,  // \"PK\\001\\002\"\n  VER_MADE:   4,      // version made by\n  VER_EXT:    6,      // version needed to extract\n  FLAGS:      8,      // encrypt, decrypt flags\n  CMP_METHOD: 10,    // compression method\n  TIMEDATE_DOS: 12,     // DOS modification time (2 bytes time, 2 bytes date)\n  CRC:        16,     // uncompressed file crc-32 value\n  CMP_SIZE:   20,     // compressed size\n  UNCMP_SIZE: 24,     // uncompressed size\n  FNAME_LEN:  28,     // filename length\n  EXTRA_LEN:  30,     // extra field length\n  COMMENT_LEN: 32,    // file comment length\n  DISK_NUM:   34,     // volume number start\n  INT_FILE_ATTR: 36,  // internal file attributes\n  EXT_FILE_ATTR: 38,  // external file attributes (host system dependent)\n  LOCAL_HDR_OFFSET: 42 // LOC header offset\n};\n\n// The Zip central directory Locator\nexport const CENTRAL_END = {\n  SIZE:       22,         // END header size\n  SIGNATURE:  0x06054b50, // \"PK\\005\\006\"\n  VOL_NUM:        4,      // number of this disk\n  VOLDIR_START:   6,      // number of the volume/disk with start of the Central Directory\n  VOL_ENTRIES:    8,      // number of entries on this volume/disk\n  TOTAL_ENTRIES:  10,     // total number of entries on this disk\n  CENTRAL_DIR_SIZE: 12,   // central directory size in bytes\n  CENTRAL_DIR_OFFSET: 16, // offset of first CEN header\n  ZIP_COMMENT_LEN: 20     // zip file comment length\n};\n\n// Zip64 Central Directory Entry\nexport const ZIP64_CENTRAL_DIR = {\n  SIGNATURE:  0x06064b50,  // zip64 signature, \"PK\\006\\006\"\n  SIZE:       56,     // zip64 record minimum size\n  LEAD:       12,     // leading bytes at the start of the record, not counted by the value stored in ZIP64SIZE\n  SIZE_FIELD:  4,     // zip64 size of the central directory record\n  VER_MADEBY: 12,     // zip64 version made by\n  VER_NEEDED: 14,     // zip64 version needed to extract\n  VOL_NUM:    16,     // zip64 number of this disk\n  VOLDIR_START: 20,  // number of the disk with the start of the record directory\n  VOL_ENTRIES:  24,  // number of entries on this disk\n  TOTAL_ENTRIES: 32,  // total number of entries\n  CENTRAL_DIR_SIZE: 40, // zip64 central directory size in bytes\n  CENTRAL_DIR_OFFSET: 48, // offset of start of central directory with respect to the starting disk number\n  EXTRA_FIELD:   56   // extensible data sector\n};\n\n// Zip64 Central directory locator\nexport const ZIP64_CENTRAL_END = {\n  SIZE:       20,         // zip64 END header size\n  SIGNATURE:  0x07064b50, // zip64 Locator signature, \"PK\\006\\007\"\n  VOL_NUM:    4,          // number of the disk with the start of the zip64\n  CENTRAL_DIR_OFFSET: 8,  // relative offset of the zip64 end of central directory\n  TOTAL_DISKS: 16         // total number of disks\n};\n\n// Compression methods\nexport const CMP_METHOD = {\n  STORED:           0,  // no compression\n  SHRUNK:           1,  // shrunk\n  REDUCED1:         2,  // reduced with compression factor 1\n  REDUCED2:         3,  // reduced with compression factor 2\n  REDUCED3:         4,  // reduced with compression factor 3\n  REDUCED4:         5,  // reduced with compression factor 4\n  IMPLODED:         6,  // imploded\n  DEFLATED:         8,  // deflated\n  ENHANCED_DEFLATE: 9,  // enhanced deflated\n  BZIP2:            12, //  compressed using BZIP2\n  LZMA:             14, // LZMA\n  IBM_TERSE:        18, // compressed using IBM TERSE\n  IBM_LZ77:         19, // IBM LZ77\n  ZSTD:             93, // Zstandard compression\n  AES_ENCRYPT:      99  // WinZIP AES encryption method\n};\n\n// General purpose bit flag\nexport const GP_FLAG = {\n  ENCRYPTED:      1,    // Bit 0: encrypted file\n  COMPRESSION1:   2,    // Bit 1, compression option\n  COMPRESSION2:   4,    // Bit 2, compression option\n  DATA_DESC:      8,    // Bit 3, data descriptor \n  ENHANCED_DEFLATE: 16, // Bit 4, enhanced deflating\n  PATCHED:        32,   // Bit 5, indicates that the file is compressed patched data.\n  STRONG_ENCRYPT: 64,   // Bit 6, strong encryption (patented)\n                        // Bits 7-10: Currently unused.\n  EFS:            2048, // Bit 11: Language encoding flag (EFS)\n                        // Bit 12: Reserved by PKWARE for enhanced compression.\n                        // Bit 13: encrypted the Central Directory (patented).\n                        // Bits 14-15: Reserved by PKWARE.\n  MASK:           4096, // mask header values\n};\n\n// 4.5 Extensible data fields\nexport const EXTENSIBLE_DATA_FIELDS = {\n  ID:              0,\n  SIZE:            2,\n};\n\n// Header IDs\nexport const HDR_ID = {\n  ZIP64:           0x0001,    // ZIP64 Extended Information Extra Field\n  AVINFO:          0x0007,    // AV Info\n  PFS:             0x0008,    // PFS Extra Field\n  OS2:             0x0009,    // OS/2 Extra Field\n  NTFS:            0x000a,    // NTFS Extra Field\n  OPENVMS:         0x000c,    // OpenVMS Extra Field\n  UNIX:            0x000d,    // Unix Extra Field\n  FORK:            0x000e,    // Fork Data Extra Field\n  PATCH:           0x000f,    // Patch Descriptor Extra Field\n  x509PKCS7:       0x0014,    // X.509 Certificate Store (PKCS#7)\n  x509CERT_IDF:    0x0015,    // X.509 Certificate ID and Fingerprint\n  x509CERT_IDC:    0x0016,    // X.509 Certificate ID and Certificate\n  STRONG_ENC:      0x0017,    // Strong Encryption Header\n  AES:             0x9901,    // WinZip AES Extra Data Field\n  RECORD_MGT:      0x0018,    // Record Management Controls\n  x509PKCS7RL:     0x0019,    // X.509 Certificate Revocation List (PKCS#7)\n  IBM1:            0x0065,    // IBM S/390 (Z390) - Attribute\n  IBM2:            0x0066,    // IBM S/390 (Z390) - Attribute\n  SHA256:          0x014E,    // SHA256 \"N\\01\" with 64 bytes (256 bit) of SHA256 hash data\n  NEO_CRYPTO:      0x024E,    // NeoEncrypt metadata (see docs/NEO_CRYPTO_FORMAT.md); LE on wire: 4E 02\n  POSZIP:          0x4690,    // POSZIP 4690\n  UNV_TIME:        0x5455,    // Universal Time (UT) (32-bit) 5 data bytes\n  UID_GID:         0x7875,    // Unix UID/GID (any size)\n  UNICODE_PATH:    0x7075,    // Info-ZIP Unicode Path Extra Field\n  SYMLINK:         0x7855,    // Unix Symbolic Link Extra Field\n  HARDLINK:        0x7865,    // Unix Hard Link Extra Field\n};\n\n// File System\nexport const FILE_SYSTEM = {\n  MSDOS:           0,   // MS-DOS and OS/2 (FAT / VFAT / FAT32 file systems)\n  AMIGA:           1,   // Amiga\n  OPENVMS:         2,   // OpenVMS\n  UNIX:            3,   // UNIX\n  VM_CMS:          4,   // VM/CMS\n  ATARI:           5,   // Atari ST\n  OS2:             6,   // OS/2 H.P.F.S.\n  MAC:             7,   // Macintosh\n  CP_M:            9,   // CP/M\n  NTFS:            10,  // Windows NTFS\n  MVS:             11,  // MVS (OS/390 - Z/OS)\n  VSE:             12,  // VSE\n  ACORN:           13,  // Acorn Risc\n  VFAT:            14,  // VFAT\n  ALTMVS:          15,  // Alternate MVS\n  BEOS:            16,  // BeOS\n  TANDEM:          17,  // Tandem\n  OS400:           18,  // OS/400\n  DARWIN:          19   // Apple OS/X (Darwin)\n};\n\n// DOS File Attributes\nexport const DOS_FILE_ATTR = {\n  READONLY:        0x01,\n  HIDDEN:          0x02,\n  SYSTEM:          0x04,\n  VOLUME:          0x08,\n  DIRECTORY:       0x10,\n  ARCHIVE:         0x20\n};\n\n", "/**\n * Global Logger Utility for NeoZipKit\n * Provides centralized console control with configurable log levels\n */\n\nexport type LogLevel = 'debug' | 'info' | 'warn' | 'error' | 'silent';\n\nexport interface LoggerConfig {\n  enabled: boolean;\n  level: LogLevel;\n}\n\n/**\n * Global Logger class for controlling console output throughout NeoZipKit\n */\nexport class Logger {\n  private static config: LoggerConfig = {\n    enabled: true,\n    level: 'info'\n  };\n\n  private static originalConsole = {\n    log: console.log,\n    error: console.error,\n    warn: console.warn,\n    debug: console.debug,\n    info: console.info\n  };\n\n  /**\n   * Configure the logger\n   */\n  static configure(config: Partial<LoggerConfig>): void {\n    this.config = { ...this.config, ...config };\n  }\n\n  /**\n   * Get current logger configuration\n   */\n  static getConfig(): LoggerConfig {\n    return { ...this.config };\n  }\n\n  /**\n   * Enable logging\n   */\n  static enable(): void {\n    this.config.enabled = true;\n  }\n\n  /**\n   * Disable all logging\n   */\n  static disable(): void {\n    this.config.enabled = false;\n  }\n\n  /**\n   * Set log level\n   */\n  static setLevel(level: LogLevel): void {\n    this.config.level = level;\n  }\n\n\n  /**\n   * Check if a log level should be output\n   */\n  private static shouldLog(level: LogLevel): boolean {\n    if (!this.config.enabled) return false;\n    \n    const levels: LogLevel[] = ['debug', 'info', 'warn', 'error', 'silent'];\n    const currentLevelIndex = levels.indexOf(this.config.level);\n    const requestedLevelIndex = levels.indexOf(level);\n    \n    return requestedLevelIndex >= currentLevelIndex;\n  }\n\n  /**\n   * Log a message\n   */\n  static log(...args: any[]): void {\n    if (this.shouldLog('info')) {\n      this.originalConsole.log(...args);\n    }\n  }\n\n  /**\n   * Log an error message\n   */\n  static error(...args: any[]): void {\n    if (this.shouldLog('error')) {\n      this.originalConsole.error(...args);\n    }\n  }\n\n  /**\n   * Log a warning message\n   */\n  static warn(...args: any[]): void {\n    if (this.shouldLog('warn')) {\n      this.originalConsole.warn(...args);\n    }\n  }\n\n  /**\n   * Log a debug message\n   */\n  static debug(...args: any[]): void {\n    if (this.shouldLog('debug')) {\n      // Use console.log for debug messages to ensure they're visible\n      this.originalConsole.log(...args);\n    }\n  }\n\n  /**\n   * Log an info message\n   */\n  static info(...args: any[]): void {\n    if (this.shouldLog('info')) {\n      this.originalConsole.info(...args);\n    }\n  }\n\n\n  /**\n   * Override console methods globally (use with caution)\n   */\n  static overrideConsole(): void {\n    console.log = (...args: any[]) => this.log(...args);\n    console.error = (...args: any[]) => this.error(...args);\n    console.warn = (...args: any[]) => this.warn(...args);\n    console.debug = (...args: any[]) => this.debug(...args);\n    console.info = (...args: any[]) => this.info(...args);\n  }\n\n  /**\n   * Restore original console methods\n   */\n  static restoreConsole(): void {\n    console.log = this.originalConsole.log;\n    console.error = this.originalConsole.error;\n    console.warn = this.originalConsole.warn;\n    console.debug = this.originalConsole.debug;\n    console.info = this.originalConsole.info;\n  }\n\n}\n\n/**\n * Environment-based configuration\n */\nexport function configureLoggerFromEnvironment(): void {\n  const env = typeof process !== 'undefined' ? process.env : {};\n  \n  // Check for NEOZIP_DEBUG environment variable\n  if (env.NEOZIP_DEBUG === 'false') {\n    Logger.disable();\n  } else if (env.NEOZIP_DEBUG === 'true') {\n    Logger.enable();\n    Logger.setLevel('debug');\n  }\n\n  // Check for NEOZIP_LOG_LEVEL\n  if (env.NEOZIP_LOG_LEVEL) {\n    const level = env.NEOZIP_LOG_LEVEL as LogLevel;\n    if (['debug', 'info', 'warn', 'error', 'silent'].includes(level)) {\n      Logger.setLevel(level);\n    }\n  }\n\n  // Check for NODE_ENV\n  if (env.NODE_ENV === 'production') {\n    Logger.setLevel('error');\n  }\n}\n\n// Auto-configure from environment on import\n// Only run in Node.js environment\nconfigureLoggerFromEnvironment();\n", "/**\n * Browser-compatible crypto shim\n * Provides Node.js crypto API using Web Crypto API + pure JS (SHA-1, PBKDF2, HMAC, AES-256-ECB).\n * Enables WinZip AES-256 encryption/decryption in the browser bundle. No extra dependencies.\n */\n\n// Use Web Crypto API for browser\nconst webCrypto = typeof crypto !== 'undefined' ? crypto : (typeof window !== 'undefined' && window.crypto ? window.crypto : null);\n\nif (!webCrypto || !webCrypto.subtle) {\n  throw new Error('Web Crypto API is not available in this environment');\n}\n\n// Convert ArrayBuffer to Buffer-like Uint8Array\nfunction arrayBufferToUint8Array(buffer) {\n  return new Uint8Array(buffer);\n}\n\n// Convert Uint8Array/ArrayBuffer to Buffer\nfunction toBuffer(data) {\n  if (data instanceof Uint8Array) {\n    return Buffer.from(data);\n  }\n  if (data instanceof ArrayBuffer) {\n    return Buffer.from(data);\n  }\n  return Buffer.from(data);\n}\n\n// Create hash using Web Crypto API\nasync function createHash(algorithm) {\n  const algoMap = {\n    'sha256': 'SHA-256',\n    'sha1': 'SHA-1',\n    'md5': 'MD5',\n  };\n\n  const webAlgo = algoMap[algorithm.toLowerCase()] || 'SHA-256';\n\n  return {\n    update: function(data) {\n      this._data = this._data ? Buffer.concat([this._data, toBuffer(data)]) : toBuffer(data);\n      return this;\n    },\n    digest: async function(encoding) {\n      const data = this._data || Buffer.alloc(0);\n      const hashBuffer = await webCrypto.subtle.digest(webAlgo, data);\n      const hashArray = arrayBufferToUint8Array(hashBuffer);\n      \n      if (encoding === 'hex') {\n        return Array.from(hashArray)\n          .map(b => b.toString(16).padStart(2, '0'))\n          .join('');\n      }\n      if (encoding === 'base64') {\n        return Buffer.from(hashArray).toString('base64');\n      }\n      return Buffer.from(hashArray);\n    }\n  };\n}\n\n// Generate random bytes using Web Crypto API\nfunction randomBytes(size) {\n  const array = new Uint8Array(size);\n  webCrypto.getRandomValues(array);\n  return Buffer.from(array);\n}\n\n// --- AES-256 support (WinZip AE-1/AE-2) via pure JS in browser (no deps) ---\n\n// Minimal SHA-1 (returns 20-byte hash), standard FIPS-180-4\nfunction sha1Raw(data) {\n  const buf = Buffer.isBuffer(data) ? Buffer.from(data) : Buffer.from(data);\n  const len = buf.length;\n  const bitLen = len * 8;\n  const padLen = 64 - ((len + 9) % 64);\n  const totalLen = len + 1 + (padLen < 0 ? padLen + 64 : padLen) + 8;\n  const padded = Buffer.alloc(totalLen);\n  buf.copy(padded, 0);\n  padded[len] = 0x80;\n  padded.writeUInt32BE((bitLen / 0x100000000) >>> 0, totalLen - 8);\n  padded.writeUInt32BE(bitLen >>> 0, totalLen - 4);\n\n  const h = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0];\n  const k = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];\n  const w = new Array(80);\n\n  for (let off = 0; off < totalLen; off += 64) {\n    for (let i = 0; i < 16; i++) {\n      w[i] = padded.readUInt32BE(off + i * 4);\n    }\n    for (let i = 16; i < 80; i++) {\n      w[i] = ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) << 1) | ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) >>> 31);\n    }\n    let [a, b, c, d, e] = h;\n    for (let i = 0; i < 80; i++) {\n      let f, t;\n      if (i < 20) {\n        f = (b & c) | ((~b) & d);\n        t = k[0];\n      } else if (i < 40) {\n        f = b ^ c ^ d;\n        t = k[1];\n      } else if (i < 60) {\n        f = (b & c) | (b & d) | (c & d);\n        t = k[2];\n      } else {\n        f = b ^ c ^ d;\n        t = k[3];\n      }\n      t = (((a << 5) | (a >>> 27)) + f + e + t + (w[i] >>> 0)) >>> 0;\n      e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n    }\n    h[0] = (h[0] + a) >>> 0; h[1] = (h[1] + b) >>> 0; h[2] = (h[2] + c) >>> 0; h[3] = (h[3] + d) >>> 0; h[4] = (h[4] + e) >>> 0;\n  }\n\n  const out = Buffer.alloc(20);\n  for (let i = 0; i < 5; i++) {\n    out.writeUInt32BE(h[i], i * 4);\n  }\n  return out;\n}\n\nfunction hmacSha1(key, data) {\n  const blockLen = 64;\n  let K = Buffer.isBuffer(key) ? Buffer.from(key) : Buffer.from(key);\n  if (K.length > blockLen) {\n    K = sha1Raw(K);\n  }\n  if (K.length < blockLen) {\n    K = Buffer.concat([K, Buffer.alloc(blockLen - K.length)]);\n  }\n  const ipad = Buffer.alloc(blockLen, 0x36);\n  const opad = Buffer.alloc(blockLen, 0x5c);\n  for (let i = 0; i < blockLen; i++) {\n    ipad[i] ^= K[i];\n    opad[i] ^= K[i];\n  }\n  const inner = sha1Raw(Buffer.concat([ipad, Buffer.isBuffer(data) ? data : Buffer.from(data)]));\n  return sha1Raw(Buffer.concat([opad, inner]));\n}\n\nfunction pbkdf2Sync(key, salt, iterations, keylen, digest) {\n  if (digest && digest.toLowerCase() !== 'sha1') {\n    throw new Error('Browser shim only supports PBKDF2 with sha1');\n  }\n  const hlen = 20;\n  const blocks = Math.ceil(keylen / hlen);\n  const result = [];\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  const saltBuf = Buffer.isBuffer(salt) ? salt : Buffer.from(salt);\n  for (let i = 1; i <= blocks; i++) {\n    const iBuf = Buffer.from([(i >>> 24) & 0xff, (i >>> 16) & 0xff, (i >>> 8) & 0xff, i & 0xff]);\n    let u = hmacSha1(keyBuf, Buffer.concat([saltBuf, iBuf]));\n    const block = Buffer.from(u);\n    for (let j = 1; j < iterations; j++) {\n      u = hmacSha1(keyBuf, u);\n      for (let k = 0; k < hlen; k++) block[k] ^= u[k];\n    }\n    result.push(block);\n  }\n  return Buffer.concat(result).subarray(0, keylen);\n}\n\nfunction createHmac(algorithm, key) {\n  if (algorithm !== 'sha1') {\n    throw new Error('Browser shim createHmac only supports sha1');\n  }\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  let data = Buffer.alloc(0);\n  return {\n    update(chunk) {\n      data = Buffer.concat([data, Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk)]);\n      return this;\n    },\n    digest() {\n      const out = hmacSha1(keyBuf, data);\n      data = Buffer.alloc(0);\n      return out;\n    },\n  };\n}\n\n// Minimal AES-256-ECB (encrypt one 16-byte block). FIPS-197.\nconst AES_SBOX = new Uint8Array([0x63,0x7c,0x77,0x7b,0xf2,0x6b,0x6f,0xc5,0x30,0x01,0x67,0x2b,0xfe,0xd7,0xab,0x76,0xca,0x82,0xc9,0x7d,0xfa,0x59,0x47,0xf0,0xad,0xd4,0xa2,0xaf,0x9c,0xa4,0x72,0xc0,0xb7,0xfd,0x93,0x26,0x36,0x3f,0xf7,0xcc,0x34,0xa5,0xe5,0xf1,0x71,0xd8,0x31,0x15,0x04,0xc7,0x23,0xc3,0x18,0x96,0x05,0x9a,0x07,0x12,0x80,0xe2,0xeb,0x27,0xb2,0x75,0x09,0x83,0x2c,0x1a,0x1b,0x6e,0x5a,0xa0,0x52,0x3b,0xd6,0xb3,0x29,0xe3,0x2f,0x84,0x53,0xd1,0x00,0xed,0x20,0xfc,0xb1,0x5b,0x6a,0xcb,0xbe,0x39,0x4a,0x4c,0x58,0xcf,0xd0,0xef,0xaa,0xfb,0x43,0x4d,0x33,0x85,0x45,0xf9,0x02,0x7f,0x50,0x3c,0x9f,0xa8,0x51,0xa3,0x40,0x8f,0x92,0x9d,0x38,0xf5,0xbc,0xb6,0xda,0x21,0x10,0xff,0xf3,0xd2,0xcd,0x0c,0x13,0xec,0x5f,0x97,0x44,0x17,0xc4,0xa7,0x7e,0x3d,0x64,0x5d,0x19,0x73,0x60,0x81,0x4f,0xdc,0x22,0x2a,0x90,0x88,0x46,0xee,0xb8,0x14,0xde,0x5e,0x0b,0xdb,0xe0,0x32,0x3a,0x0a,0x49,0x06,0x24,0x5c,0xc2,0xd3,0xac,0x62,0x91,0x95,0xe4,0x79,0xe7,0xc8,0x37,0x6d,0x8d,0xd5,0x4e,0xa9,0x6c,0x56,0xf4,0xea,0x65,0x7a,0xae,0x08,0xba,0x78,0x25,0x2e,0x1c,0xa6,0xb4,0xc6,0xe8,0xdd,0x74,0x1f,0x4b,0xbd,0x8b,0x8a,0x70,0x3e,0xb5,0x66,0x48,0x03,0xf6,0x0e,0x61,0x35,0x57,0xb9,0x86,0xc1,0x1d,0x9e,0xe1,0xf8,0x98,0x11,0x69,0xd9,0x8e,0x94,0x9b,0x1e,0x87,0xe9,0xce,0x55,0x28,0xdf,0x8c,0xa1,0x89,0x0d,0xbf,0xe6,0x42,0x68,0x41,0x99,0x2d,0x0f,0xb0,0x54,0xbb,0x16]);\nconst AES_RCON = new Uint8Array([0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1b,0x36]);\nfunction aes256KeyExpansion(key) {\n  const w = new Uint8Array(240);\n  for (let i = 0; i < 32; i++) w[i] = key[i];\n  for (let i = 8; i < 60; i++) {\n    const t = i * 4;\n    const prev = (i - 8) * 4;\n    const p = (i - 1) * 4;\n    if (i % 8 === 0) {\n      const t0 = AES_SBOX[w[p + 1]] ^ AES_RCON[(i / 8) - 1];\n      w[t] = w[prev] ^ t0; w[t+1] = w[prev+1] ^ AES_SBOX[w[p+2]]; w[t+2] = w[prev+2] ^ AES_SBOX[w[p+3]]; w[t+3] = w[prev+3] ^ AES_SBOX[w[p]];\n    } else if (i % 8 === 4) {\n      w[t] = w[prev] ^ AES_SBOX[w[p]]; w[t+1] = w[prev+1] ^ AES_SBOX[w[p+1]]; w[t+2] = w[prev+2] ^ AES_SBOX[w[p+2]]; w[t+3] = w[prev+3] ^ AES_SBOX[w[p+3]];\n    } else {\n      w[t] = w[prev] ^ w[p]; w[t+1] = w[prev+1] ^ w[p+1]; w[t+2] = w[prev+2] ^ w[p+2]; w[t+3] = w[prev+3] ^ w[p+3];\n    }\n  }\n  return w;\n}\nfunction xtime(x) {\n  return (((x << 1) & 0xff) ^ (((x >>> 7) & 1) * 0x1b));\n}\nfunction aes256EcbEncryptBlock(keySchedule, block) {\n  const s = new Uint8Array(16);\n  for (let i = 0; i < 16; i++) s[i] = block[i] ^ keySchedule[i];\n  for (let r = 1; r < 14; r++) {\n    for (let i = 0; i < 16; i++) s[i] = AES_SBOX[s[i]];\n    const t = s[1]; s[1]=s[5]; s[5]=s[9]; s[9]=s[13]; s[13]=t;\n    const t2=s[2]; s[2]=s[10]; s[10]=t2; const t3=s[6]; s[6]=s[14]; s[14]=t3;\n    const t4=s[3]; s[3]=s[15]; s[15]=s[11]; s[11]=s[7]; s[7]=t4;\n    for (let c = 0; c < 4; c++) {\n      const a = s[c*4]; const b = s[c*4+1]; const c2 = s[c*4+2]; const d = s[c*4+3];\n      s[c*4]   = xtime(a) ^ xtime(b) ^ b ^ c2 ^ d;\n      s[c*4+1] = a ^ xtime(b) ^ xtime(c2) ^ c2 ^ d;\n      s[c*4+2] = a ^ b ^ xtime(c2) ^ xtime(d) ^ d;\n      s[c*4+3] = xtime(a) ^ a ^ b ^ c2 ^ xtime(d);\n    }\n    const ro = r * 16;\n    for (let i = 0; i < 16; i++) s[i] ^= keySchedule[ro + i];\n  }\n  for (let i = 0; i < 16; i++) s[i] = AES_SBOX[s[i]];\n  const t = s[1]; s[1]=s[5]; s[5]=s[9]; s[9]=s[13]; s[13]=t;\n  const t2=s[2]; s[2]=s[10]; s[10]=t2; const t3=s[6]; s[6]=s[14]; s[14]=t3;\n  const t4=s[3]; s[3]=s[15]; s[15]=s[11]; s[11]=s[7]; s[7]=t4;\n  for (let i = 0; i < 16; i++) s[i] ^= keySchedule[224 + i];\n  return s;\n}\n\nfunction createCipheriv(algorithm, key, iv) {\n  if (algorithm !== 'aes-256-ecb' || (iv !== null && iv !== undefined)) {\n    throw new Error('Browser shim createCipheriv only supports aes-256-ecb with null iv');\n  }\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  if (keyBuf.length !== 32) throw new Error('aes-256-ecb requires 32-byte key');\n  const keySchedule = aes256KeyExpansion(keyBuf);\n  return {\n    setAutoPadding() {\n      return this;\n    },\n    update(block) {\n      const b = Buffer.isBuffer(block) ? block : Buffer.from(block);\n      if (b.length !== 16) {\n        throw new Error('Browser shim AES-ECB only supports 16-byte blocks');\n      }\n      const out = aes256EcbEncryptBlock(keySchedule, b);\n      return Buffer.from(out);\n    },\n    final() {\n      return Buffer.alloc(0);\n    },\n  };\n}\n\n// Export crypto-like object (ES module format)\nexport {\n  createHash,\n  randomBytes,\n  pbkdf2Sync,\n  createHmac,\n  createCipheriv,\n};\n\n// Also export as default for compatibility\nexport default {\n  createHash,\n  randomBytes,\n  pbkdf2Sync,\n  createHmac,\n  createCipheriv,\n};\n", "/**\n * Traditional ZIP Crypto encryption implementation\n * Compatible with standard ZIP 2.0 encryption (ZipCrypto)\n */\n\nimport { EncryptionProvider, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionMethod } from './types';\nimport ZipEntry from '../ZipEntry';\nimport { Logger } from '../components/Logger';\nimport { GP_FLAG, ENCRYPT_HDR_SIZE } from '../constants/Headers';\nimport { randomBytes } from 'crypto';\n\nexport class ZipCrypto implements EncryptionProvider {\n  private static readonly KEY_LENGTH = 3; // 24 bits for traditional ZIP crypto\n\n  canHandle(method: EncryptionMethod): boolean {\n    return method === EncryptionMethod.ZIP_CRYPTO;\n  }\n\n  getMethodName(): string {\n    return 'ZIP-Crypto';\n  }\n\n  getKeyLength(): number {\n    return ZipCrypto.KEY_LENGTH;\n  }\n\n  async encrypt(data: Buffer, options: EncryptionOptions): Promise<EncryptionResult> {\n    try {\n      if (options.method !== EncryptionMethod.ZIP_CRYPTO) {\n        return {\n          success: false,\n          error: 'ZIP-Crypto encryption method required'\n        };\n      }\n\n      // Initialize keys from password\n      const keys = this.initKeys(options.password);\n      \n      // Encrypt data using traditional ZIP crypto\n      const encryptedData = Buffer.alloc(data.length);\n      \n      for (let i = 0; i < data.length; i++) {\n        const byte = data[i];\n        const encryptedByte = this.encryptByte(keys, byte);\n        encryptedData[i] = encryptedByte;\n        this.updateKeys(keys, byte);\n      }\n\n      return {\n        success: true,\n        encryptedData: encryptedData\n      };\n    } catch (error) {\n      return {\n        success: false,\n        error: error instanceof Error ? error.message : 'Unknown encryption error'\n      };\n    }\n  }\n\n  async decrypt(data: Buffer, options: EncryptionOptions): Promise<DecryptionResult> {\n    try {\n      if (options.method !== EncryptionMethod.ZIP_CRYPTO) {\n        return {\n          success: false,\n          error: 'ZIP-Crypto decryption method required'\n        };\n      }\n\n      // Initialize keys from password\n      const keys = this.initKeys(options.password);\n      \n      // Decrypt data using traditional ZIP crypto\n      const decryptedData = Buffer.alloc(data.length);\n      \n      for (let i = 0; i < data.length; i++) {\n        const encryptedByte = data[i];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        decryptedData[i] = decryptedByte;\n        this.updateKeys(keys, decryptedByte);\n      }\n\n      return {\n        success: true,\n        decryptedData: decryptedData\n      };\n    } catch (error) {\n      return {\n        success: false,\n        error: error instanceof Error ? error.message : 'Unknown decryption error'\n      };\n    }\n  }\n\n  /**\n   * Verify password using check byte from decrypted header\n   * @param decryptedHeader - 12-byte decrypted encryption header\n   * @param checkByte - Expected check byte value\n   * @throws Error if password verification fails\n   */\n  verifyPassword(decryptedHeader: Buffer, checkByte: number): void {\n    if (decryptedHeader.length < 12) {\n      throw new Error('Decrypted header must be at least 12 bytes');\n    }\n    \n    // Verify check byte (11th byte, 0-indexed)\n    if (decryptedHeader[11] !== checkByte) {\n      throw new Error('Password verification FAILED');\n    }\n  }\n\n  /**\n   * Parse local header to extract information needed for decryption\n   * @param localHeaderBuffer - 30-byte local header buffer\n   * @param entry - ZIP entry to update with extracted information\n   * @returns Object with bitFlags, lastModTimeDate, localCrc, and checkByte\n   */\n  parseLocalHeaderForDecryption(localHeaderBuffer: Buffer, entry: ZipEntry): {\n    bitFlags: number;\n    lastModTimeDate: number;\n    localCrc: number;\n    checkByte: number;\n  } {\n    // Verify signature\n    if (localHeaderBuffer.readUInt32LE(0) !== 0x04034b50) {\n      throw new Error('Invalid local header signature');\n    }\n\n    // Read bit flags, lastModTimeDate, and CRC from local header\n    const bitFlags = localHeaderBuffer.readUInt16LE(6);\n    const lastModTimeDate = localHeaderBuffer.readUInt32LE(10);\n    const localCrc = localHeaderBuffer.readUInt32LE(14);\n\n    // Store lastModTimeDate in entry if DATA_DESC flag is set\n    if ((bitFlags & GP_FLAG.DATA_DESC) && (!(entry as any).lastModTimeDate || (entry as any).lastModTimeDate === 0)) {\n      (entry as any).lastModTimeDate = lastModTimeDate;\n    }\n\n    // Store local CRC for check byte calculation\n    (entry as any).localCrc = localCrc;\n\n    // Calculate check byte\n    let checkByte: number;\n    if (bitFlags & GP_FLAG.DATA_DESC) {\n      const timeDate = (entry as any).lastModTimeDate || entry.timeDateDOS || 0;\n      checkByte = (timeDate >> 8) & 0xff;\n    } else {\n      const crc = localCrc && localCrc !== 0 ? localCrc : entry.crc;\n      checkByte = (crc >> 24) & 0xff;\n    }\n\n    return { bitFlags, lastModTimeDate, localCrc, checkByte };\n  }\n\n  /**\n   * Create encryption header (12 bytes) for PKZIP encryption\n   * Generates 11 random bytes + 1 check byte\n   * @param entry - ZIP entry to create header for\n   * @param password - Password for encryption (used to calculate check byte)\n   * @returns 12-byte encryption header buffer\n   */\n  createEncryptionHeader(entry: ZipEntry, password: string): Buffer {\n    const header = Buffer.alloc(ENCRYPT_HDR_SIZE);\n    \n    // Generate 11 random bytes (bytes 0-10)\n    const random = randomBytes(11);\n    random.copy(header, 0);\n    \n    // Calculate check byte (byte 11)\n    // For DATA_DESC files: use lastModTimeDate >> 8\n    // For regular files: use CRC >> 24\n    let checkByte: number;\n    if ((entry.bitFlags & GP_FLAG.DATA_DESC) !== 0) {\n      const timeDate = entry.lastModTimeDate || entry.timeDateDOS || 0;\n      checkByte = (timeDate >> 8) & 0xff;\n    } else {\n      // Use CRC from entry (should be calculated before encryption)\n      checkByte = (entry.crc >> 24) & 0xff;\n    }\n    \n    // Set check byte (11th byte, 0-indexed)\n    header[11] = checkByte;\n    \n    Logger.debug(`[ZipCrypto] Created encryption header: checkByte=0x${checkByte.toString(16).padStart(2, '0')}, DATA_DESC=${(entry.bitFlags & GP_FLAG.DATA_DESC) !== 0}`);\n    \n    return header;\n  }\n\n  /**\n   * Encrypt buffer (header + compressed data) for PKZIP encryption\n   * Creates encryption header, concatenates with compressed data, and encrypts everything\n   * @param entry - ZIP entry to encrypt\n   * @param compressedData - Compressed data to encrypt\n   * @param password - Password for encryption\n   * @returns Encrypted buffer (encrypted header + encrypted compressed data)\n   */\n  encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    // Create 12-byte encryption header\n    const header = this.createEncryptionHeader(entry, password);\n    \n    // Concatenate header + compressed data\n    const dataToEncrypt = Buffer.concat([header, compressedData]);\n    \n    // Initialize encryption keys from password\n    const keys = this.initKeys(password);\n    \n    // Encrypt the entire buffer (header + compressed data) maintaining key state\n    // This ensures keys are updated correctly throughout encryption\n    const encryptedData = Buffer.alloc(dataToEncrypt.length);\n    \n    for (let i = 0; i < dataToEncrypt.length; i++) {\n      const byte = dataToEncrypt[i];\n      const encryptedByte = this.encryptByte(keys, byte);\n      encryptedData[i] = encryptedByte;\n      // Update keys after each byte - state must be maintained across the entire buffer\n      this.updateKeys(keys, byte);\n    }\n    \n    Logger.debug(`[ZipCrypto] Encrypted buffer: ${compressedData.length} bytes compressed data + ${ENCRYPT_HDR_SIZE} bytes header = ${encryptedData.length} bytes total`);\n    \n    return encryptedData;\n  }\n\n  /**\n   * Decrypt buffer-based encrypted data (for in-memory extraction)\n   * Handles local header parsing, encryption header extraction, and decryption\n   * @param entry - ZIP entry with encryption information\n   * @param buffer - Full ZIP file buffer\n   * @param encryptedData - Encrypted data without header (from parseLocalHeader)\n   * @param password - Password for decryption\n   * @returns Decrypted compressed data (without header)\n   */\n  decryptBuffer(entry: ZipEntry, buffer: Buffer, encryptedData: Buffer, password: string): Buffer {\n    // Read local header to get lastModTimeDate for DATA_DESC files (needed for check byte)\n    const localData = buffer.subarray(entry.localHdrOffset);\n    const localHeaderBuffer = localData.subarray(0, 30);\n\n    // Parse local header to extract decryption info\n    const { bitFlags, localCrc, checkByte } = this.parseLocalHeaderForDecryption(localHeaderBuffer, entry);\n\n    // Extract the 12-byte encryption header\n    // parseLocalHeader returns data WITHOUT the 12-byte encryption header\n    // We need to prepend the header before decrypting so keys are updated correctly\n    const fnameLen = localHeaderBuffer.readUInt16LE(26);\n    const extraLen = localHeaderBuffer.readUInt16LE(28);\n    const localSize = 30 + fnameLen + extraLen;\n    const ENCRYPT_HDR_SIZE = 12;\n    const encryptHeader = localData.subarray(localSize, localSize + ENCRYPT_HDR_SIZE);\n\n    // Prepend the header to the encrypted data\n    const encryptedDataWithHeader = Buffer.concat([encryptHeader, encryptedData]);\n\n    // Decrypt the full data (header + compressed data) in one pass\n    // This ensures keys are updated correctly throughout the decryption\n    // MEMORY EFFICIENCY: Decrypt in-place into encryptedDataWithHeader (no new allocation)\n    const keys = this.initKeys(password);\n\n    for (let i = 0; i < encryptedDataWithHeader.length; i++) {\n      const encryptedByte = encryptedDataWithHeader[i];\n      const decryptedByte = this.decryptByte(keys, encryptedByte);\n      encryptedDataWithHeader[i] = decryptedByte;\n      this.updateKeys(keys, decryptedByte);\n    }\n\n    // Extract the decrypted header (first 12 bytes) for password verification\n    // encryptedDataWithHeader now contains decrypted data\n    const decryptedHeader = encryptedDataWithHeader.subarray(0, ENCRYPT_HDR_SIZE);\n\n    // Verify password using check byte\n    this.verifyPassword(decryptedHeader, checkByte);\n\n    // Skip the decrypted header (first 12 bytes) and return only the decrypted compressed data\n    return encryptedDataWithHeader.subarray(ENCRYPT_HDR_SIZE);\n  }\n\n  /**\n   * Create a streaming decryptor for chunked data processing\n   * Handles 12-byte header decryption and verification, then yields decrypted chunks\n   * \n   * MEMORY EFFICIENCY: This method processes encrypted data one block at a time.\n   * - Decryption state (keys) is maintained across blocks via updateKeys()\n   * - Only the minimum 12-byte header is accumulated before password verification\n   * - Each decrypted block is yielded immediately without accumulation\n   * \n   * @param password - Password for decryption\n   * @param checkByte - Expected check byte value for password verification\n   * @param encryptedStream - Async generator of encrypted data chunks (one block at a time)\n   * @returns Async generator of decrypted data chunks (one block at a time)\n   */\n  async *createStreamDecryptor(\n    password: string,\n    checkByte: number,\n    encryptedStream: AsyncGenerator<Buffer>\n  ): AsyncGenerator<Buffer> {\n    // Initialize keys from password - state maintained across all blocks\n    const keys = this.initKeys(password);\n    \n    // Process 12-byte encryption header incrementally (minimum accumulation)\n    const ENCRYPT_HDR_SIZE = 12;\n    const headerBuffer = Buffer.alloc(ENCRYPT_HDR_SIZE);\n    let headerBytesCollected = 0;\n    let currentChunk: Buffer | null = null;\n    let currentChunkOffset = 0;\n    \n    // Read chunks incrementally until we have exactly 12 bytes for header\n    // This minimizes memory usage by only accumulating the necessary header bytes\n    while (headerBytesCollected < ENCRYPT_HDR_SIZE) {\n      // Get next chunk if current chunk is exhausted\n      if (!currentChunk || currentChunkOffset >= currentChunk.length) {\n        const result = await encryptedStream.next();\n        \n        if (result.done || !result.value) {\n          throw new Error('ZIP-Crypto: insufficient encrypted data (missing encryption header)');\n        }\n        \n        currentChunk = result.value;\n        currentChunkOffset = 0;\n      }\n      \n      // Copy bytes from current chunk to header buffer\n      const bytesNeeded = ENCRYPT_HDR_SIZE - headerBytesCollected;\n      const bytesToCopy = Math.min(bytesNeeded, currentChunk.length - currentChunkOffset);\n      \n      currentChunk.copy(headerBuffer, headerBytesCollected, currentChunkOffset, currentChunkOffset + bytesToCopy);\n      headerBytesCollected += bytesToCopy;\n      currentChunkOffset += bytesToCopy;\n    }\n    \n    // Decrypt the 12-byte encryption header byte-by-byte\n    // This maintains proper key state for subsequent decryption\n    // MEMORY EFFICIENCY: Decrypt in-place into headerBuffer (no new allocation)\n    for (let i = 0; i < ENCRYPT_HDR_SIZE; i++) {\n      const encryptedByte = headerBuffer[i];\n      const decryptedByte = this.decryptByte(keys, encryptedByte) & 0xff;\n      headerBuffer[i] = decryptedByte;\n      // Update keys after each byte - state must be maintained across blocks\n      this.updateKeys(keys, decryptedByte);\n    }\n    \n    // Verify password using check byte (11th byte of decrypted header)\n    // headerBuffer now contains decrypted header data\n    this.verifyPassword(headerBuffer, checkByte);\n    \n    // Process remaining data from the first chunk (after header) if any\n    // This ensures we decrypt and yield data immediately without accumulating\n    // MEMORY EFFICIENCY: Decrypt in-place into currentChunk buffer (no new allocation)\n    if (currentChunk && currentChunkOffset < currentChunk.length) {\n      const remainingInChunk = currentChunk.length - currentChunkOffset;\n      \n      for (let i = 0; i < remainingInChunk; i++) {\n        const pos = currentChunkOffset + i;\n        const encryptedByte = currentChunk[pos];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        currentChunk[pos] = decryptedByte;\n        // Maintain state across bytes - keys updated for next block\n        this.updateKeys(keys, decryptedByte);\n      }\n      \n      // Yield subarray of currentChunk (already decrypted in-place)\n      yield currentChunk.subarray(currentChunkOffset);\n    }\n    \n    // Process remaining chunks one at a time - decrypt and yield immediately\n    // Decryption state (keys) continues across blocks via updateKeys()\n    // MEMORY EFFICIENCY: Decrypt in-place into encryptedChunk buffer (no new allocation)\n    for await (const encryptedChunk of encryptedStream) {\n      \n      // Decrypt each byte in-place, maintaining state across bytes\n      for (let i = 0; i < encryptedChunk.length; i++) {\n        const encryptedByte = encryptedChunk[i];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        encryptedChunk[i] = decryptedByte;\n        // Update keys after each byte - ensures state continues correctly across blocks\n        this.updateKeys(keys, decryptedByte);\n      }\n      \n      // Yield the same buffer (now containing decrypted data) - no accumulation\n      yield encryptedChunk;\n    }\n  }\n\n  /**\n   * Initialize encryption keys from password\n   */\n  private initKeys(password: string): number[] {\n    const keys = [0x12345678, 0x23456789, 0x34567890];\n    \n    for (let i = 0; i < password.length; i++) {\n      this.updateKeys(keys, password.charCodeAt(i));\n    }\n    \n    return keys;\n  }\n\n  /**\n   * Update encryption keys with a byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private updateKeys(keys: number[], byte: number): void {\n    keys[0] = ((keys[0] >>> 8) ^ ZipCrypto.CRC_TABLE[(keys[0] ^ byte) & 0xff]) >>> 0;\n    // Use Math.imul for multiplication (matches zip.js) and 0x08088405 constant\n    keys[1] = ((Math.imul(keys[1] + (keys[0] & 0xff), 0x08088405) + 1) & 0xFFFFFFFF) >>> 0;\n    keys[2] = ((keys[2] >>> 8) ^ ZipCrypto.CRC_TABLE[(keys[2] ^ (keys[1] >>> 24)) & 0xff]) >>> 0;\n  }\n\n  /**\n   * Encrypt a single byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private encryptByte(keys: number[], byte: number): number {\n    const temp = keys[2] | 2;\n    // Use Math.imul like zip.js and mask with 0xFF\n    return (byte ^ (Math.imul(temp, (temp ^ 1)) >>> 8)) & 0xFF;\n  }\n\n  /**\n   * Decrypt a single byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private decryptByte(keys: number[], encryptedByte: number): number {\n    const temp = keys[2] | 2;\n    // Use Math.imul like zip.js and mask with 0xFF\n    return (encryptedByte ^ (Math.imul(temp, (temp ^ 1)) >>> 8)) & 0xFF;\n  }\n\n  /**\n   * CRC32 lookup table (shared for all CRC32 operations)\n   */\n  static readonly CRC_TABLE = [\n    0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,\n    0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,\n    0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,\n    0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,\n    0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,\n    0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,\n    0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,\n    0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,\n    0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,\n    0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n    0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,\n    0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,\n    0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,\n    0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,\n    0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,\n    0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,\n    0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,\n    0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,\n    0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,\n    0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n    0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,\n    0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,\n    0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,\n    0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,\n    0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,\n    0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,\n    0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,\n    0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,\n    0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,\n    0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n    0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,\n    0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,\n    0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,\n    0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,\n    0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,\n    0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,\n    0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,\n    0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,\n    0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,\n    0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n    0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,\n    0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,\n    0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d\n  ];\n\n  /**\n   * CRC32 implementation for ZIP crypto (single byte update)\n   * Used internally for key updates during encryption/decryption\n   */\n  private crc32(crc: number, byte: number): number {\n    return ((crc >>> 8) ^ ZipCrypto.CRC_TABLE[(crc ^ byte) & 0xff]) >>> 0;\n  }\n\n  /**\n   * Static CRC32 calculation for a full buffer\n   * Delegates to exported crc32() function\n   * @param buf - Buffer or string to calculate CRC32 for\n   * @returns CRC32 checksum as unsigned 32-bit integer\n   */\n  static crc32(buf: Buffer | string): number {\n    return crc32Impl(buf);\n  }\n\n  /**\n   * Static CRC32 incremental update (single byte)\n   * Delegates to exported crc32update() function\n   * @param crc - Current CRC32 value\n   * @param byte - Byte to update with\n   * @returns Updated CRC32 value\n   */\n  static crc32update(crc: number, byte: number): number {\n    return crc32updateImpl(crc, byte);\n  }\n}\n\n/**\n * CRC32 calculation for a full buffer\n * Main public API for CRC32 calculation\n * @param buf - Buffer or string to calculate CRC32 for\n * @returns CRC32 checksum as unsigned 32-bit integer\n */\nfunction crc32Impl(buf: Buffer | string): number {\n  if (typeof buf === \"string\") {\n    buf = Buffer.from(buf, \"utf8\");\n  }\n  \n  let len = buf.length;\n  let crc = ~0;\n  for (let off = 0; off < len; ) {\n    crc = ZipCrypto.CRC_TABLE[(crc ^ buf[off++]) & 0xff] ^ (crc >>> 8);\n  }\n  \n  // Finalize: xor with ~0 and cast as uint32\n  return ~crc >>> 0;\n}\n\n/**\n * CRC32 incremental update (single byte)\n * Used for streaming CRC32 calculation\n * @param crc - Current CRC32 value\n * @param byte - Byte to update with\n * @returns Updated CRC32 value\n */\nfunction crc32updateImpl(crc: number, byte: number): number {\n  return ZipCrypto.CRC_TABLE[(crc ^ byte) & 0xff] ^ (crc >>> 8);\n}\n\n/**\n * CRC32 calculation for a full buffer\n * Main public API for CRC32 calculation\n * @param buf - Buffer or string to calculate CRC32 for\n * @returns CRC32 checksum as unsigned 32-bit integer\n */\nexport function crc32(buf: Buffer | string): number {\n  return crc32Impl(buf);\n}\n\n/**\n * CRC32 incremental update (single byte)\n * Used for streaming CRC32 calculation\n * @param crc - Current CRC32 value\n * @param byte - Byte to update with\n * @returns Updated CRC32 value\n */\nexport function crc32update(crc: number, byte: number): number {\n  return crc32updateImpl(crc, byte);\n}\n\n// Cryptographic utility functions\nimport { createHash } from 'crypto';\n\n// Return the SHA256 hash of a buffer\nexport function sha256(data: Buffer): string {\n  const hash = createHash('sha256');\n  return hash\n    .update(data)\n    .digest('hex');\n}\n\n/**\n * Options for creating a DecryptionStream\n */\nexport interface DecryptionStreamOptions {\n  password: string;\n  method: EncryptionMethod;\n  entry: ZipEntry;\n}\n\n/**\n * Streaming decryption for chunked compressed data processing\n * Encapsulated within ZipCrypto for PKZIP decryption\n */\nexport class DecryptionStream {\n  private password: string;\n  private method: EncryptionMethod;\n  private entry: ZipEntry;\n  private zipCrypto: ZipCrypto;\n\n  constructor(options: DecryptionStreamOptions) {\n    this.password = options.password;\n    this.method = options.method;\n    this.entry = options.entry;\n    this.zipCrypto = new ZipCrypto();\n  }\n\n  /**\n   * Decrypt compressed data stream chunk by chunk\n   */\n  async *decrypt(encryptedStream: AsyncGenerator<Buffer>): AsyncGenerator<Buffer> {\n    if (this.method !== EncryptionMethod.ZIP_CRYPTO) {\n      throw new Error(`Unsupported encryption method: ${this.method}`);\n    }\n\n    // Calculate check byte based on entry\n    const checkByte = this.calculateCheckByte();\n    \n    // Use ZipCrypto's streaming decryptor\n    yield* this.zipCrypto.createStreamDecryptor(this.password, checkByte, encryptedStream);\n  }\n\n  /**\n   * Calculate check byte for password verification\n   * For DATA_DESC files: lastModTimeDate >> 8\n   * For non-DATA_DESC files: CRC >> 24\n   */\n  private calculateCheckByte(): number {\n    if (this.entry.bitFlags & GP_FLAG.DATA_DESC) {\n      let lastModTimeDate = (this.entry as any).lastModTimeDate;\n      if (!lastModTimeDate || lastModTimeDate === 0) {\n        lastModTimeDate = this.entry.timeDateDOS || 0;\n      }\n      const checkByte = (lastModTimeDate >> 8) & 0xff;\n      return checkByte;\n    } else {\n      const crc = (this.entry as any).localCrc && (this.entry as any).localCrc !== 0 \n        ? (this.entry as any).localCrc \n        : this.entry.crc;\n      const checkByte = (crc >> 24) & 0xff;\n      return checkByte;\n    }\n  }\n\n  /**\n   * Prepare entry for decryption by parsing local header from file handle\n   * This extracts the information needed for check byte calculation\n   * @param fileHandle - File handle to read from\n   * @param entry - ZIP entry to update\n   * @returns Check byte value for password verification\n   */\n  static async prepareEntryForDecryption(fileHandle: any, entry: ZipEntry): Promise<number> {\n    // Read local header to get lastModTimeDate for DATA_DESC files (needed for check byte)\n    const localHeaderBuffer = Buffer.alloc(30);\n    await fileHandle.read(localHeaderBuffer, 0, 30, entry.localHdrOffset);\n\n    // Use ZipCrypto to parse the header\n    const zipCrypto = new ZipCrypto();\n    const { checkByte } = zipCrypto.parseLocalHeaderForDecryption(localHeaderBuffer, entry);\n\n    return checkByte;\n  }\n}\n", "// ======================================\n//\tZipEntry.ts\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n// Zip Directory Item class\n\nimport Errors from './constants/Errors';\nimport { \n  LOCAL_HDR, \n  CENTRAL_DIR, \n  CMP_METHOD, \n  GP_FLAG, \n  FILE_SYSTEM, \n  HDR_ID,\n  DOS_FILE_ATTR,\n  AES_EXTRA_FIELD_SIZE,\n  AES256_SALT_SIZE,\n  AES256_PWD_VERIFY_SIZE,\n  AES_AUTH_CODE_SIZE,\n  NEO_CRYPTO_EXTRA_FIELD_SIZE,\n  NEO_CRYPTO_PAYLOAD_V1,\n  NEO_CRYPTO_MAGIC_BYTES,\n } from './constants/Headers';\nimport { ZipFileEntry, FileData } from '../types';\nimport { Logger } from './components/Logger';\nimport { crc32 } from './encryption/ZipCrypto';\n\nconst VER_ENCODING = 30;\nconst VER_EXTRACT = 10;                             // Version needed to extract (1.0)\nconst VER_AES_EXTRACT = 51;                         // Version needed for AES extraction (5.1)\n\n/**\n * Class representing a single entry (file or directory) within a ZIP archive\n */\nexport default class ZipEntry implements ZipFileEntry {\n  debug = true;\n\n  verMadeBy: number = 0;        // Read Version Made By\n  verExtract: number = 0;       // Read Version Needed to Extract\n  bitFlags: number = 0;         // General purpose bit flag\n  cmpMethod: number = 0;        // Compression method\n  timeDateDOS: number = 0;      // DOS File Time(2 bytes) & Date(2 bytes) \n  crc: number = 0;              // CRC-32\n  compressedSize: number = 0;   // Compressed size\n  uncompressedSize: number = 0; // Uncompressed size\n  volNumber: number = 0;        // Disk number start\n  intFileAttr: number = 0;      // Internal file attributes\n  extFileAttr: number = 0;      // External file attributes\n  localHdrOffset: number = 0;   // Relative offset to local header from File/Disk start\n  filename: string = '';       // File name\n  extraField: Buffer | null = null; // Extra field\n  comment: string | null = null;    // Entry comment\n\n  // File Data\n  fileBuffer: Buffer | null = null; // File Data Buffer\n\n  // Zip Compressed Data\n  cmpData: Buffer | null = null;    // Compressed Data Buffer\n\n  isEncrypted: boolean = false;     // Zip Entry is encrypted\n  isStrongEncrypt: boolean = false; // Zip Entry is strong encrypted\n  encryptHdr: Buffer | null = null;        // Encrypted Header (12 bytes)\n  lastModTimeDate: number = 0;      // Data Descriptor File Time & Date\n  decrypt: Function | null = null;  // Decrypt Class Function\n\n  // WinZip AES encryption fields (from extra field 0x9901)\n  aesVersion: number = 0;          // 1=AE-1 (CRC stored), 2=AE-2 (CRC=0)\n  aesStrength: number = 0;         // 1=AES-128, 2=AES-192, 3=AES-256\n  realCmpMethod: number = -1;      // Actual compression method when cmpMethod=99\n\n  // NeoEncrypt (extra 0x024E) \u2014 encryption metadata only; cmpMethod stays standard ZIP code\n  neoCryptoPayloadVersion: number = 0;\n  neoCryptoAlgorithm: number = 0;\n  neoCryptoFlags: number = 0;\n\n  isUpdated: boolean = true;        // Entry has been updated\n  isDirectory: boolean = false;     // Entry is a directory\n  isMetaData: boolean = false;      // Entry is Zip MetaData\n\n  // Platform specific data\n  platform: string | null = null;   // Platform\n  universalTime: number | null = null; // Universal Time\n  uid: number | null = null;        // User ID\n  gid: number | null = null;        // Group ID\n  sha256: string | null = null;     // SHA-256 hash of the file\n  \n  // Symbolic link data\n  isSymlink: boolean = false;       // Entry is a symbolic link\n  linkTarget: string | null = null; // Target path for symbolic links\n  \n  // Hard link data\n  isHardLink: boolean = false;      // Entry is a hard link\n  originalEntry: string | null = null; // Original entry name for hard links\n  inode: number | null = null;      // Inode number for hard links\n\n  fileData?: FileData;\n\n  /**\n   * Creates a new ZIP entry\n   * @param fname - Name of the file within the ZIP\n   * @param comment - Optional comment for this entry\n   * @param debug - Enable debug logging\n   */\n  constructor(fname: string | null, comment?: string | null, debug?: boolean) {\n    this.filename = fname || '';\n    this.comment = comment || null;\n    this.debug = debug || false;\n    \n    // Set the UTF-8 Language Encoding Flag (EFS) to indicate UTF-8 encoding for filenames\n    this.bitFlags |= GP_FLAG.EFS;\n  } \n\n  isMSDOS = this.platform === null;\n  isUnixLike = this.platform != null && this.platform !== 'win32';\n  isMacOS = this.platform != null && this.platform === 'darwin';\n  isLinux = this.platform != null && this.platform === 'linux';\n\n  VER_MADE_BY = (() => {\n    switch (this.platform) {\n      case 'darwin':\n        return (FILE_SYSTEM.DARWIN << 8) | VER_ENCODING;  // macOS/Darwin\n    case 'win32':\n      return (FILE_SYSTEM.NTFS << 8) | VER_ENCODING;    // Windows\n    default:\n      return (FILE_SYSTEM.UNIX << 8) | VER_ENCODING;    // Unix/Linux\n    }\n  })();\n\n  /**\n   * Reads ZIP entry data from a central directory buffer\n   * @param data - Buffer containing central directory entry data\n   * @returns Buffer positioned at start of next entry\n   * @throws Error if central directory entry is invalid\n   */\n  readZipEntry(data: Buffer): Buffer {\n    // Check if buffer is too small before trying to read from it\n    if (data.length < CENTRAL_DIR.SIZE) {\n      throw new Error('Zip entry data is too small or corrupt');\n    }\n\n    // Verify this is a Central Directory Header\n    // data should be 46 bytes and start with \"PK 01 02\"\n    if (data.readUInt32LE(0) !== CENTRAL_DIR.SIGNATURE) {\n      throw new Error(Errors.INVALID_CEN);\n    }\n\n    // Read Zip version made by\n    this.verMadeBy = data.readUInt16LE(CENTRAL_DIR.VER_MADE);\n    // Read Zip version needed to extract\n    this.verExtract = data.readUInt16LE(CENTRAL_DIR.VER_EXT);\n    // encrypt, decrypt flags\n    this.bitFlags = data.readUInt16LE(CENTRAL_DIR.FLAGS);\n    // Test if Zip Entry is encrypted\n    if ((this.bitFlags & GP_FLAG.ENCRYPTED) != 0) {\n      this.isEncrypted = true;\n      if ((this.bitFlags & GP_FLAG.STRONG_ENCRYPT) != 0)\n        this.isStrongEncrypt = true;  \n    }\n    // compression method\n    this.cmpMethod = data.readUInt16LE(CENTRAL_DIR.CMP_METHOD);\n    // modification time (2 bytes time, 2 bytes date)\n    this.timeDateDOS = data.readUInt32LE(CENTRAL_DIR.TIMEDATE_DOS);\n\n    // uncompressed file crc-32 value\n    this.crc = data.readUInt32LE(CENTRAL_DIR.CRC);\n    // compressed size\n    this.compressedSize = data.readUInt32LE(CENTRAL_DIR.CMP_SIZE);\n    // uncompressed size\n    this.uncompressedSize = data.readUInt32LE(CENTRAL_DIR.UNCMP_SIZE);\n    // volume number start\n    this.volNumber = data.readUInt16LE(CENTRAL_DIR.DISK_NUM);\n    // internal file attributes\n    this.intFileAttr = data.readUInt16LE(CENTRAL_DIR.INT_FILE_ATTR);\n    // external file attributes\n    this.extFileAttr = data.readUInt32LE(CENTRAL_DIR.EXT_FILE_ATTR);\n    if (this.extFileAttr & DOS_FILE_ATTR.DIRECTORY) \n      this.isDirectory = true;\n\n    // LOC header offset\n    this.localHdrOffset = data.readUInt32LE(CENTRAL_DIR.LOCAL_HDR_OFFSET);\n\n    // Filename Length - 2 bytes\n    let fnameLen = data.readUInt16LE(CENTRAL_DIR.FNAME_LEN);\n    const filename = data.toString('utf8', CENTRAL_DIR.SIZE, CENTRAL_DIR.SIZE + fnameLen);\n    this.filename = filename;\n    if (this.filename.endsWith('/'))\n      this.isDirectory = true;\n\n    // Extra Field Length - 2 bytes\n    let extraLen = data.readUInt16LE(CENTRAL_DIR.EXTRA_LEN);\n    if (extraLen > 0) {\n      this.extraField = data.subarray(CENTRAL_DIR.SIZE + fnameLen, CENTRAL_DIR.SIZE + fnameLen + extraLen);\n\n      // First pass: Check for Unicode Path to ensure correct filename before processing other fields\n      for (let i = 0; i < extraLen; ) {\n        let _id = this.extraField.readUInt16LE(i);\n        let _len = this.extraField.readUInt16LE(i + 2);\n        let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n        \n        if (_id === HDR_ID.UNICODE_PATH && _len >= 5) {\n          // Unicode Path Extra Field\n          const version = _data.readUInt8(0);\n          const nameCrc32 = _data.readUInt32LE(1);\n          \n          // Calculate CRC32 of the current filename\n          const fnameBuf = Buffer.from(this.filename);\n          const calculatedCrc = crc32(fnameBuf);\n          \n          // If CRCs match, use the UTF-8 filename from the extra field\n          if (calculatedCrc === nameCrc32) {\n            const unicodeName = _data.subarray(5).toString('utf8');\n            this.filename = unicodeName;\n            if (this.debug) {\n              Logger.log(`Using Unicode Path: ${this.filename}`);\n            }\n          }\n        }\n        i += 4 + _len;\n      }\n\n      // Second pass: Process all other extra fields\n      for (let i = 0; i < extraLen; ) {\n        let _id = this.extraField.readUInt16LE(i);\n        let _len = this.extraField.readUInt16LE(i + 2);\n        let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n        \n        if (_id === HDR_ID.SHA256) {          \n          if (_len === 64)\n            // Early versions of NeoZip used a UTF-8 encoded string\n            this.sha256 = _data.toString('utf8');\n          else\n            this.sha256 = _data.toString('hex');\n        } else if (_id === HDR_ID.UNV_TIME) {\n          // Universal Time field has a flag byte followed by a 4-byte timestamp\n          if (_len >= 5) {\n            const flags = _data.readUInt8(0);\n            // Check if modification time is present (bit 0)\n            if (flags & 0x01) {\n              this.universalTime = _data.readUInt32LE(1);\n            }\n          }\n        } else if (_id === HDR_ID.UID_GID) {\n          // Extract UID/GID if present\n          if (_len >= 5) {  // Version + UID size + UID + GID size + GID\n            const version = _data.readUInt8(0);\n            const uidSize = _data.readUInt8(1);\n            if (uidSize <= 4 && _len >= 2 + uidSize) {\n              // Read UID based on its size (1-4 bytes)\n              this.uid = _data.readUIntLE(2, uidSize);\n\n              // Check if GID is also present\n              if (_len >= 2 + uidSize + 1) {\n                const gidSize = _data.readUInt8(2 + uidSize);\n                if (gidSize <= 4 && _len >= 2 + uidSize + 1 + gidSize) {\n                  this.gid = _data.readUIntLE(2 + uidSize + 1, gidSize);\n                }\n              }\n            }\n          }\n        } else if (_id === HDR_ID.SYMLINK) {\n          // Extract symbolic link information\n          if (_len >= 3) {  // Version + Target Length + Target\n            const version = _data.readUInt8(0);\n            const targetLength = _data.readUInt16LE(1);\n            if (targetLength > 0 && _len >= 3 + targetLength) {\n              this.isSymlink = true;\n              this.linkTarget = _data.subarray(3, 3 + targetLength).toString('utf8');\n            }\n          }\n        } else if (_id === HDR_ID.HARDLINK) {\n          // Extract hard link information\n          if (_len >= 11) {  // Version + Inode + Original Length + Original\n            const version = _data.readUInt8(0);\n            this.inode = _data.readUInt32LE(1);\n            const originalLength = _data.readUInt16LE(5);\n            if (originalLength > 0 && _len >= 7 + originalLength) {\n              this.isHardLink = true;\n              this.originalEntry = _data.subarray(7, 7 + originalLength).toString('utf8');\n            }\n          }\n        } else if (_id === HDR_ID.AES) {\n          // WinZip AES extra field (0x9901)\n          if (_len >= 7) {\n            this.aesVersion = _data.readUInt16LE(0);\n            // vendorId at bytes 2-3 (\"AE\")\n            this.aesStrength = _data.readUInt8(4);\n            this.realCmpMethod = _data.readUInt16LE(5);\n          }\n        } else if (_id === HDR_ID.NEO_CRYPTO) {\n          if (_len >= NEO_CRYPTO_PAYLOAD_V1) {\n            if (\n              _data[0] === NEO_CRYPTO_MAGIC_BYTES[0] &&\n              _data[1] === NEO_CRYPTO_MAGIC_BYTES[1] &&\n              _data[2] === NEO_CRYPTO_MAGIC_BYTES[2] &&\n              _data[3] === NEO_CRYPTO_MAGIC_BYTES[3]\n            ) {\n              this.neoCryptoPayloadVersion = _data.readUInt8(4);\n              this.neoCryptoAlgorithm = _data.readUInt16LE(5);\n              this.neoCryptoFlags = _data.readUInt16LE(7);\n            }\n          }\n        }\n        // Skip Unicode Path here as we already processed it\n        i += 4 + _len;\n      }\n    }\n\n    // File Comment Length - 2 bytes\n    let comLen = data.readUInt16LE(CENTRAL_DIR.COMMENT_LEN);\n    if (comLen > 0)\n      this.comment = data.toString('utf8', CENTRAL_DIR.SIZE + fnameLen, CENTRAL_DIR.SIZE + fnameLen + comLen);\n\n    if (this.debug)\n      this.showVerboseInfo();\n\n    // Calculate the Buffer for the next entry\n    let rawSize = CENTRAL_DIR.SIZE + fnameLen + extraLen + comLen;\n    return data.subarray(rawSize);\n  }\n\n  /**\n   * Checks if the filename contains characters that require Unicode handling\n   * @returns true if the filename contains non-ASCII characters or special characters\n   */\n  needsUnicodeHandling(): boolean {\n    // Check if filename contains non-ASCII characters or special characters like apostrophes\n    return /[^\\x00-\\x7E]|['\"]/.test(this.filename);\n  }\n\n  /**\n   * Adds UTF-8 Unicode Path field to a buffer\n   * @param buffer - The buffer to write to\n   * @param offset - The offset in the buffer to start writing\n   * @returns The new offset after writing\n   */\n  private addUnicodePathField(buffer: Buffer, offset: number): number {\n    // Create a UTF-8 buffer of the filename\n    const unicodePathBuf = Buffer.from(this.filename, 'utf8');\n    \n    // Calculate CRC32 of the ASCII version of the filename\n    // Create an ASCII version by replacing non-ASCII chars with '?'\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const asciiNameBuf = Buffer.from(asciiName, 'ascii');\n    const nameCrc32 = crc32(asciiNameBuf);\n    \n    // 1 byte version + 4 bytes CRC + filename\n    const unicodePathLen = 5 + unicodePathBuf.length;\n    \n    // Write Unicode Path Extra Field (0x7075)\n    buffer.writeUInt16LE(HDR_ID.UNICODE_PATH, offset); // \"up\" header ID\n    buffer.writeUInt16LE(unicodePathLen, offset + 2);  // data length \n    buffer.writeUInt8(1, offset + 4);                  // version (1)\n    buffer.writeUInt32LE(nameCrc32, offset + 5);       // CRC-32 of standard filename\n    unicodePathBuf.copy(buffer, offset + 9);           // UTF-8 version of filename\n    \n    return offset + 4 + unicodePathLen; // 4 bytes for header + data length\n  }\n\n  /**\n   * Creates a local header for this ZIP entry\n   * @returns Buffer containing the local header data\n   */\n  createLocalHdr(): Buffer {\n    let extraFieldLen = 0;\n    \n    // Only create Unicode Path field if needed\n    const needsUnicode = this.needsUnicodeHandling();\n    \n    if (needsUnicode) {\n      // 1 byte version + 4 bytes CRC + filename + 4 bytes header\n      const unicodeNameLen = Buffer.from(this.filename, 'utf8').length;\n      extraFieldLen = 5 + unicodeNameLen + 4;\n    }\n\n    // Add AES extra field if using WinZip AES encryption\n    const isAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    if (isAes) {\n      extraFieldLen += AES_EXTRA_FIELD_SIZE;\n    }\n\n    const isNeoEncrypt = this.neoCryptoAlgorithm > 0;\n    if (isNeoEncrypt) {\n      extraFieldLen += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n    \n    const data = Buffer.alloc(LOCAL_HDR.SIZE + this.filename.length + extraFieldLen);\n    \n    // \"PK\\003\\004\"\n    data.writeUInt32LE(LOCAL_HDR.SIGNATURE, 0);\n    // version needed to extract (NeoEncrypt keeps standard ZIP method \u2014 use normal extract version)\n    const verExtract = this.cmpMethod === CMP_METHOD.AES_ENCRYPT ? VER_AES_EXTRACT : VER_EXTRACT;\n    data.writeUInt16LE(verExtract, LOCAL_HDR.VER_EXTRACT);\n    // general purpose bit flag\n    data.writeUInt16LE(this.bitFlags >>> 0, LOCAL_HDR.FLAGS);\n    // compression method\n    data.writeUInt16LE(this.cmpMethod, LOCAL_HDR.COMPRESSION);\n    // modification time (2 bytes time, 2 bytes date)\n    data.writeUInt32LE(this.timeDateDOS >>> 0, LOCAL_HDR.TIMEDATE_DOS);\n    // uncompressed file crc-32 value (AE-2 stores 0)\n    data.writeUInt32LE(this.aesVersion === 2 ? 0 : this.crc, LOCAL_HDR.CRC);\n    // compressed size\n    data.writeUInt32LE(this.compressedSize, LOCAL_HDR.CMP_SIZE);\n    // uncompressed size\n    data.writeUInt32LE(this.uncompressedSize, LOCAL_HDR.UNCMP_SIZE);\n    // filename length\n    data.writeUInt16LE(this.filename.length, LOCAL_HDR.FNAME_LEN);\n    // extra field length\n    data.writeUInt16LE(extraFieldLen, LOCAL_HDR.EXTRA_LEN);\n\n    // Write filename - use ASCII filename (replacing non-ASCII with ?)\n    // This ensures compatibility with older ZIP readers\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const fnameBuf = Buffer.from(asciiName);\n    fnameBuf.copy(data, LOCAL_HDR.SIZE);\n\n    let extraOffset = LOCAL_HDR.SIZE + fnameBuf.length;\n    \n    // Add Unicode Path Extra Field only if needed\n    if (needsUnicode) {\n      extraOffset = this.addUnicodePathField(data, extraOffset);\n    }\n\n    // Add AES extra field\n    if (isAes) {\n      data.writeUInt16LE(HDR_ID.AES, extraOffset);\n      data.writeUInt16LE(7, extraOffset + 2);\n      data.writeUInt16LE(this.aesVersion, extraOffset + 4);\n      data.writeUInt16LE(0x4541, extraOffset + 6); // \"AE\"\n      data.writeUInt8(this.aesStrength, extraOffset + 8);\n      data.writeUInt16LE(this.realCmpMethod, extraOffset + 9);\n      extraOffset += AES_EXTRA_FIELD_SIZE;\n    }\n\n    if (isNeoEncrypt) {\n      data.writeUInt16LE(HDR_ID.NEO_CRYPTO, extraOffset);\n      data.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, extraOffset + 2);\n      const p = extraOffset + 4;\n      for (let i = 0; i < 4; i++) {\n        data.writeUInt8(NEO_CRYPTO_MAGIC_BYTES[i], p + i);\n      }\n      data.writeUInt8(this.neoCryptoPayloadVersion, p + 4);\n      data.writeUInt16LE(this.neoCryptoAlgorithm, p + 5);\n      data.writeUInt16LE(this.neoCryptoFlags, p + 7);\n      data.writeUInt16LE(0, p + 9);\n      extraOffset += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n\n    return data;\n  }\n\n  /**\n   * Creates a central directory entry for this ZIP entry\n   * @returns Buffer containing the central directory entry data\n   */\n  centralDirEntry(): Buffer {\n    // Calculate the length of the extra fields\n    const commentLen = this.comment ? Buffer.from(this.comment, 'utf8').length : 0;\n    const utfLen = this.universalTime ? 9 : 0;  // 4 bytes header + 5 bytes data\n    const uidgidLen = this.uid && this.gid ? 11 + 4 : 0;  // 1 byte version + 1 byte size + 4 bytes data + 1 byte size + 4 bytes data\n    const sha256Buf = this.sha256 ? Buffer.from(this.sha256, 'hex') : null;\n    const sha256Len = sha256Buf ? (sha256Buf.length + 4) : 0;\n    \n    // Calculate symbolic link extra field length\n    const symlinkLen = this.isSymlink && this.linkTarget ? \n      (4 + 1 + 2 + Buffer.byteLength(this.linkTarget, 'utf8')) : 0; // 4 bytes header + 1 byte version + 2 bytes length + target\n    \n    // Calculate hard link extra field length\n    const hardlinkLen = this.isHardLink && this.originalEntry && this.inode !== null ? \n      (4 + 1 + 4 + 2 + Buffer.byteLength(this.originalEntry, 'utf8')) : 0; // 4 bytes header + 1 byte version + 4 bytes inode + 2 bytes length + original\n    \n    // Only add Unicode Path field if needed\n    const needsUnicode = this.needsUnicodeHandling();\n    let unicodePathLen = 0;\n    \n    if (needsUnicode) {\n      // 1 byte version + 4 bytes CRC + filename + 4 bytes header\n      const unicodeNameLen = Buffer.from(this.filename, 'utf8').length;\n      unicodePathLen = 5 + unicodeNameLen + 4;\n    }\n    \n    // Add AES extra field if using WinZip AES encryption\n    const isAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    const aesLen = isAes ? AES_EXTRA_FIELD_SIZE : 0;\n\n    const isNeoEncrypt = this.neoCryptoAlgorithm > 0;\n    const neoLen = isNeoEncrypt ? NEO_CRYPTO_EXTRA_FIELD_SIZE : 0;\n\n    const extraLen = utfLen + sha256Len + uidgidLen + symlinkLen + hardlinkLen + (needsUnicode ? unicodePathLen : 0) + aesLen + neoLen;\n\n    // Calculate actual filename length (ASCII conversion may change length)\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const fnameLen = asciiName.length;\n    \n    // Central directory header size (46 Bytes + filename + comment + extra fields)\n    const data = Buffer.alloc(CENTRAL_DIR.SIZE + fnameLen + commentLen + extraLen);\n    \n    // \"PK\\001\\002\"\n    data.writeUInt32LE(CENTRAL_DIR.SIGNATURE, 0);\n    // Version made by - Needs to be set for NeoZip \n    data.writeUInt16LE(this.isUpdated ? this.VER_MADE_BY : this.verMadeBy, CENTRAL_DIR.VER_MADE);\n    // Version needed to extract\n    const centralVerExtract = this.cmpMethod === CMP_METHOD.AES_ENCRYPT ? VER_AES_EXTRACT : VER_EXTRACT;\n    data.writeInt16LE(this.isUpdated ? centralVerExtract : this.verMadeBy, CENTRAL_DIR.VER_EXT);\n    // Encrypt, Decrypt Flags\n    data.writeInt16LE(this.bitFlags >>> 0, CENTRAL_DIR.FLAGS);\n    // Compression method\n    data.writeInt16LE(this.cmpMethod, CENTRAL_DIR.CMP_METHOD);\n    // Modification time (2 bytes time, 2 bytes date)\n    data.writeUInt32LE(this.timeDateDOS >>> 0, CENTRAL_DIR.TIMEDATE_DOS);\n    // Uncompressed file CRC-32 value (AE-2 stores 0)\n    data.writeUInt32LE(this.aesVersion === 2 ? 0 : this.crc, CENTRAL_DIR.CRC);\n    // Compressed Size\n    data.writeUInt32LE(this.compressedSize, CENTRAL_DIR.CMP_SIZE);\n    // Uncompressed Size\n    data.writeUInt32LE(this.uncompressedSize, CENTRAL_DIR.UNCMP_SIZE);\n    // Filename Length\n    data.writeUInt16LE(this.filename.length, CENTRAL_DIR.FNAME_LEN);\n    // Extra Field Length\n    data.writeUInt16LE(extraLen, CENTRAL_DIR.EXTRA_LEN);\n    // File Comment Length\n    data.writeUInt16LE(commentLen, CENTRAL_DIR.COMMENT_LEN);\n    // Volume Number Start\n    data.writeUInt16LE(0, CENTRAL_DIR.DISK_NUM);\n    // Internal File Attributes\n    data.writeUInt16LE(this.intFileAttr >>> 0, CENTRAL_DIR.INT_FILE_ATTR);\n    // External File Attributes\n    data.writeUInt32LE(this.extFileAttr >>> 0, CENTRAL_DIR.EXT_FILE_ATTR);\n    // Local Header Offset\n    data.writeUInt32LE(this.localHdrOffset, CENTRAL_DIR.LOCAL_HDR_OFFSET);\n\n    // Write filename - use ASCII filename (replacing non-ASCII with ?)\n    // This ensures compatibility with older ZIP readers\n    const fnameBuf = Buffer.from(asciiName);\n    fnameBuf.copy(data, CENTRAL_DIR.SIZE);\n\n    // Add file comment immediately after filename (InfoZip format)\n    let currentOffset = CENTRAL_DIR.SIZE + fnameLen;\n    if (commentLen > 0 && this.comment) {\n      const commentBuf = Buffer.from(this.comment, 'utf8');\n      commentBuf.copy(data, currentOffset);\n      currentOffset += commentLen;\n    }\n\n    // Add Extra Field data after file comment\n    let extraOffset = currentOffset;\n\n    // Add Universal Time field\n    if (this.universalTime) {\n      data.writeUInt16LE(HDR_ID.UNV_TIME, extraOffset);     // 0x5455\n      data.writeUInt16LE(5, extraOffset + 2);               // Length of data (flags + time)\n      data.writeUInt8(1, extraOffset + 4);                  // Flags: modification time present\n      data.writeUInt32LE(Math.floor(Date.now() / 1000), extraOffset + 5); // Unix timestamp\n      extraOffset += 9;\n    }\n\n    // Add SHA-256 field\n    if (sha256Buf) {\n      data.writeUInt16LE(HDR_ID.SHA256, extraOffset);       // 0x1f\n      data.writeUInt16LE(sha256Buf.length, extraOffset + 2); // Length of data\n      sha256Buf.copy(data, extraOffset + 4);\n      extraOffset += 4 + sha256Buf.length;\n    }\n\n    // Add UID/GID field\n    if (this.uid && this.gid) {\n      data.writeUInt16LE(HDR_ID.UID_GID, extraOffset);       // 0x7875\n      data.writeUInt16LE(11, extraOffset + 2);              // Length of data\n      data.writeUInt8(1, extraOffset + 4);                  // Version\n      data.writeUInt8(4, extraOffset + 5);                  // UID size\n      data.writeUInt32LE(this.uid, extraOffset + 6);        // UID\n      data.writeUInt8(4, extraOffset + 10);                 // GID size\n      data.writeUInt32LE(this.gid, extraOffset + 11);       // GID\n      extraOffset += 15;\n    }\n\n    // Add symbolic link field\n    if (this.isSymlink && this.linkTarget) {\n      const targetBuf = Buffer.from(this.linkTarget, 'utf8');\n      const dataLen = 1 + 2 + targetBuf.length; // version + length + target\n      \n      data.writeUInt16LE(HDR_ID.SYMLINK, extraOffset);       // 0x7855\n      data.writeUInt16LE(dataLen, extraOffset + 2);          // Length of data\n      data.writeUInt8(1, extraOffset + 4);                   // Version\n      data.writeUInt16LE(targetBuf.length, extraOffset + 5); // Target length\n      targetBuf.copy(data, extraOffset + 7);                 // Target path\n      extraOffset += 4 + dataLen;\n    }\n\n    // Add hard link field\n    if (this.isHardLink && this.originalEntry && this.inode !== null) {\n      const originalBuf = Buffer.from(this.originalEntry, 'utf8');\n      const dataLen = 1 + 4 + 2 + originalBuf.length; // version + inode + length + original\n      \n      data.writeUInt16LE(HDR_ID.HARDLINK, extraOffset);       // 0x7865\n      data.writeUInt16LE(dataLen, extraOffset + 2);           // Length of data\n      data.writeUInt8(1, extraOffset + 4);                    // Version\n      data.writeUInt32LE(this.inode, extraOffset + 5);        // Inode number\n      data.writeUInt16LE(originalBuf.length, extraOffset + 9); // Original entry length\n      originalBuf.copy(data, extraOffset + 11);               // Original entry path\n      extraOffset += 4 + dataLen;\n    }\n\n    // Add Unicode Path field if needed\n    if (needsUnicode) {\n      extraOffset = this.addUnicodePathField(data, extraOffset);\n    }\n\n    // Add AES extra field\n    if (isAes) {\n      data.writeUInt16LE(HDR_ID.AES, extraOffset);\n      data.writeUInt16LE(7, extraOffset + 2);\n      data.writeUInt16LE(this.aesVersion, extraOffset + 4);\n      data.writeUInt16LE(0x4541, extraOffset + 6); // \"AE\"\n      data.writeUInt8(this.aesStrength, extraOffset + 8);\n      data.writeUInt16LE(this.realCmpMethod, extraOffset + 9);\n      extraOffset += AES_EXTRA_FIELD_SIZE;\n    }\n\n    if (isNeoEncrypt) {\n      data.writeUInt16LE(HDR_ID.NEO_CRYPTO, extraOffset);\n      data.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, extraOffset + 2);\n      const p = extraOffset + 4;\n      for (let i = 0; i < 4; i++) {\n        data.writeUInt8(NEO_CRYPTO_MAGIC_BYTES[i], p + i);\n      }\n      data.writeUInt8(this.neoCryptoPayloadVersion, p + 4);\n      data.writeUInt16LE(this.neoCryptoAlgorithm, p + 5);\n      data.writeUInt16LE(this.neoCryptoFlags, p + 7);\n      data.writeUInt16LE(0, p + 9);\n      extraOffset += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n\n    return data;\n  }\n\n  // ======================================\n  //\tRoutines to handle the details of the Zip Entry\n  // ======================================\n\n  /**\n   * Sets the DOS date/time for this entry\n   * @param date - Date to convert to DOS format\n   * @returns number - DOS format date/time\n   */\n  setDateTime(date: Date): number {\n    if (!date) return 0;\n    \n    // DOS date/time format:\n    // Date part (16 bits): Year (7 bits) + Month (4 bits) + Day (5 bits)\n    // Time part (16 bits): Hour (5 bits) + Minute (6 bits) + Second (5 bits, stored as seconds/2)\n    \n    const year = date.getFullYear() - 1980; // Years since 1980\n    const month = date.getMonth() + 1; // Month (1-12)\n    const day = date.getDate(); // Day (1-31)\n    const hour = date.getHours(); // Hour (0-23)\n    const minute = date.getMinutes(); // Minute (0-59)\n    const second = date.getSeconds(); // Second (0-59)\n    \n    // Pack date: year (7 bits) + month (4 bits) + day (5 bits)\n    const datePart = ((year & 0x7f) << 9) | ((month & 0x0f) << 5) | (day & 0x1f);\n    \n    // Pack time: hour (5 bits) + minute (6 bits) + second/2 (5 bits)\n    const timePart = ((hour & 0x1f) << 11) | ((minute & 0x3f) << 5) | ((second >> 1) & 0x1f);\n    \n    // Combine date and time parts\n    const time = (datePart << 16) | timePart;\n    \n    return time;\n  }\n\n  /**\n   * Converts DOS date/time to JavaScript Date\n   * @param timeStamp - DOS format date/time\n   * @returns Date object or null if timestamp is 0\n   */\n  parseDateTime(timeStamp: number): Date | null {\n    if (timeStamp == 0)\n      return null;\n    \n    // Extract date part (upper 16 bits)\n    const datePart = (timeStamp >> 16) & 0xffff;\n    const year = ((datePart >> 9) & 0x7f) + 1980;  // Year (7 bits) + 1980\n    const month = ((datePart >> 5) & 0x0f) - 1;    // Month (4 bits) - 1 for 0-based\n    const day = datePart & 0x1f;                   // Day (5 bits)\n    \n    // Extract time part (lower 16 bits)\n    const timePart = timeStamp & 0xffff;\n    const hour = (timePart >> 11) & 0x1f;          // Hour (5 bits)\n    const minute = (timePart >> 5) & 0x3f;         // Minute (6 bits)\n    const second = (timePart & 0x1f) << 1;         // Second (5 bits) * 2\n    \n    return new Date(year, month, day, hour, minute, second);\n  }\n\n  /**\n   * Formats the entry's date in local format\n   * @returns String in MM/DD/YYYY format or \"--/--/----\" if no date\n   */\n  toLocalDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate === null) return \"--/--/----\";\n\n    return _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: '2-digit',\n      day: '2-digit'\n    }).slice(0,10);\n  }\n\n  /**\n   * Formats the entry's time\n   * @returns String in HH:MM format or \"--:--\" if no time\n   */\n  toTimeString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate === null) return \"--:--\";\n\n    return _timeDate.toTimeString().slice(0, 5);\n  }\n\n  /**\n   * Formats the entry's date and time in local format\n   * @returns String like \"Jan 01, 2024 13:45:30\" or \"--/--/-- --:--\" if no date/time\n   */\n  toFormattedDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate == null) return \"--/--/-- --:--\";\n\n    const datePart = _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: 'short',\n      day: '2-digit'\n    });\n\n    const timePart = _timeDate.toLocaleTimeString('en-US', {\n      hour: '2-digit',\n      minute: '2-digit',\n      second: '2-digit',\n      hour12: false\n    });\n\n    return `${datePart} ${timePart}`;\n  }\n\n  /**\n   * Formats the entry's date and time in UTC\n   * @returns String like \"Jan 01, 2024 13:45:30 UTC\" or \"--/--/-- --:--\" if no date/time\n   */\n  toFormattedUTCDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate == null) return \"--/--/-- --:--\";\n\n    const datePart = _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: 'short',\n      day: '2-digit',\n      timeZone: 'UTC'\n    });\n\n    const timePart = _timeDate.toLocaleTimeString('en-US', {\n      hour: '2-digit',\n      minute: '2-digit',\n      second: '2-digit',\n      hour12: false,\n      timeZone: 'UTC'\n    });\n\n    return `${datePart} ${timePart} UTC`;\n  }\n\n  /**\n   * Converts compression method code to human-readable string\n   * @returns String describing the compression method\n   */\n  cmpMethodToString(): string {\n    switch (this.cmpMethod) {\n      case CMP_METHOD.STORED: return 'Stored';\n      case CMP_METHOD.SHRUNK: return 'Shrunk';\n      case CMP_METHOD.REDUCED1: return 'Reduced-1';\n      case CMP_METHOD.REDUCED2: return 'Reduced-2';\n      case CMP_METHOD.REDUCED3: return 'Reduced-3';\n      case CMP_METHOD.REDUCED4: return 'Reduced-4';\n      case CMP_METHOD.IMPLODED: return 'Imploded';\n      case CMP_METHOD.DEFLATED:\n        switch (this.bitFlags & 0x6) {\n          case 0: return 'Deflate-N';     // Deflate Normal\n          case 2: return 'Deflate-M';     // Deflate Maximum\n          case 4: return 'Deflate-F';     // Deflate Fast\n          case 6: return 'Deflate-S';     // Deflate Super Fast\n        }\n      case CMP_METHOD.ENHANCED_DEFLATE: return 'Deflate-Enh';\n      case CMP_METHOD.IBM_TERSE: return 'PKDCL-LZ77';\n      case CMP_METHOD.ZSTD: return 'Zstandard';\n      case CMP_METHOD.AES_ENCRYPT:\n        return this.aesStrength === 3 ? 'AES-256' :\n               this.aesStrength === 2 ? 'AES-192' :\n               this.aesStrength === 1 ? 'AES-128' : 'AES';\n      \n      default: return 'Unknown';\n    }\n  }\n\n  /**\n   * Converts file system code to human-readable string\n   * @returns String describing the file system\n   */\n  fileSystemToString(): string {\n    switch (this.verMadeBy >> 8) {\n      case FILE_SYSTEM.MSDOS: return 'MS-DOS';\n      case FILE_SYSTEM.AMIGA: return 'Amiga';\n      case FILE_SYSTEM.OPENVMS: return 'OpenVMS';\n      case FILE_SYSTEM.UNIX: return 'Unix';\n      case FILE_SYSTEM.VM_CMS: return 'VM/CMS';\n      case FILE_SYSTEM.ATARI: return 'Atari ST';\n      case FILE_SYSTEM.OS2: return 'OS/2 HPFS';\n      case FILE_SYSTEM.MAC: return 'Macintosh';\n      case FILE_SYSTEM.CP_M: return 'CP/M';\n      case FILE_SYSTEM.NTFS: return 'Windows NTFS';\n      case FILE_SYSTEM.MVS: return 'MVS (OS/390 - Z/OS)';\n      case FILE_SYSTEM.VSE: return 'VSE';\n      case FILE_SYSTEM.ACORN: return 'Acorn Risc';\n      case FILE_SYSTEM.ALTMVS: return 'Alternate MVS';\n      case FILE_SYSTEM.BEOS: return 'BeOS';\n      case FILE_SYSTEM.TANDEM: return 'Tandem';\n      case FILE_SYSTEM.OS400: return 'OS/400';\n      case FILE_SYSTEM.DARWIN: return 'Apple OS/X (Darwin)';\n      default: return 'Unknown';\n    }\n  }\n\n  /**\n   * Compression method name for a raw code (e.g. 0x9901 \"real\" method).\n   */\n  private compressionMethodCodeToString(method: number): string {\n    if (method < 0) {\n      return 'Not set';\n    }\n    switch (method) {\n      case CMP_METHOD.STORED: return 'Stored (0)';\n      case CMP_METHOD.DEFLATED: return 'Deflated (8)';\n      case CMP_METHOD.ZSTD: return 'Zstandard (93)';\n      case CMP_METHOD.BZIP2: return 'BZIP2 (12)';\n      case CMP_METHOD.LZMA: return 'LZMA (14)';\n      case CMP_METHOD.AES_ENCRYPT: return 'AES wrapper (99)';\n      default:\n        return `code ${method}`;\n    }\n  }\n\n  /**\n   * Prints encryption scheme details (WinZip AES vs ZipCrypto vs PKWARE strong).\n   * See docs/WINZIP_AES_FORMAT.md.\n   */\n  private logEncryptionDetails(): void {\n    const encrypted = (this.bitFlags & GP_FLAG.ENCRYPTED) !== 0;\n    const strong = (this.bitFlags & GP_FLAG.STRONG_ENCRYPT) !== 0;\n\n    Logger.log('Encryption (detailed):                       ');\n    Logger.log('  GP flags:                                  ',\n      `bit0 encrypted=${encrypted}, bit6 strong_encrypt=${strong}`);\n\n    const winZipAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    const neoEncrypt = !winZipAes && this.neoCryptoAlgorithm > 0;\n\n    if (winZipAes) {\n      Logger.log('  Scheme:                                    ', 'WinZip AES (ZIP compression method 99 + extra 0x9901, vendor \"AE\")');\n      Logger.log('  AE variant:                                ',\n        this.aesVersion === 2\n          ? 'AE-2 \u2014 CRC-32 in local/CEN headers is 0; plaintext integrity from HMAC-SHA1'\n          : 'AE-1 \u2014 CRC-32 in headers is plaintext (uncompressed) CRC-32');\n      const strengthLabel =\n        this.aesStrength === 3 ? 'AES-256 (extra field strength byte 3)'\n        : this.aesStrength === 2 ? 'AES-192 (2)'\n        : this.aesStrength === 1 ? 'AES-128 (1)'\n        : `Unknown (${this.aesStrength})`;\n      Logger.log('  Key size:                                  ', strengthLabel);\n      Logger.log('  Real compression (inside ciphertext):    ',\n        this.compressionMethodCodeToString(this.realCmpMethod));\n      Logger.log('  \"Compressed size\" in headers:            ',\n        'Length of full AES file data: salt + password verifier + ciphertext + 10-byte HMAC');\n      Logger.log('  Payload layout:                            ',\n        `${AES256_SALT_SIZE} byte salt + ${AES256_PWD_VERIFY_SIZE} byte verifier + encrypted(compressed) data + ${AES_AUTH_CODE_SIZE} byte HMAC (PBKDF2-HMAC-SHA1, WinZip AES-CTR)`);\n      Logger.log('  Version needed to extract (from entry):  ',\n        `${this.verExtract}${this.verExtract === VER_AES_EXTRACT ? ' (5.1 \u2014 typical for AES)' : ''}`);\n      if (!strong) {\n        Logger.log('  Typical WinZip AES:                        ', 'bit 6 (strong) usually clear; bit 0 (encrypted) set.');\n      } else {\n        Logger.log('  Note:                                       ', 'Strong-encrypt bit set \u2014 unusual for pure WinZip AES; confirm with extra fields.');\n      }\n    } else if (neoEncrypt) {\n      Logger.log('  Scheme:                                    ', 'NeoEncrypt (GP encrypted + NEO extra 0x024E; standard ZIP compression method in header)');\n      Logger.log('  NEO payload version / algorithm / flags: ',\n        `${this.neoCryptoPayloadVersion} / ${this.neoCryptoAlgorithm} / ${this.neoCryptoFlags}`);\n      Logger.log('  Compression after decrypt:                 ', this.compressionMethodCodeToString(this.cmpMethod));\n      Logger.log('  Ciphertext layout:                         ',\n        `Same as WinZip AES-256 stream: ${AES256_SALT_SIZE} byte salt + ${AES256_PWD_VERIFY_SIZE} byte verifier + encrypted(compressed) + ${AES_AUTH_CODE_SIZE} byte HMAC`);\n      Logger.log('  CRC in headers:                            ', 'Plaintext CRC (AE-1 style) for algorithm 1');\n    } else if (encrypted) {\n      if (strong) {\n        Logger.log('  Scheme:                                    ', 'PKWARE strong encryption (GP bit 6) \u2014 not WinZip method 99; expect extras e.g. 0x0017');\n      } else {\n        Logger.log('  Scheme:                                    ', 'Encrypted (bit 0) \u2014 typically legacy ZipCrypto if method \u2260 99');\n      }\n      Logger.log('  Compression method in header:              ', `${this.cmpMethodToString()} (${this.cmpMethod})`);\n    } else {\n      Logger.log('  Scheme:                                    ', 'Not encrypted');\n    }\n  }\n\n  /**\n   * Converts MS-DOS file attributes to string representation\n   * @returns String like \"----\" where R=readonly, H=hidden, S=system, A=archive\n   */\n  private dosAttributesToString(): string {\n    let dosAttr = this.extFileAttr & 0xFFFF;\n    if (dosAttr === 0) return 'none';\n    let attrs = '';\n    attrs += (dosAttr & DOS_FILE_ATTR.READONLY) ? 'r' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.HIDDEN)   ? 'h' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.SYSTEM)   ? 's' : '-';\n    // attrs += (dosAttr & DOS_FILE_ATTR.VOLUME)   ? 'v' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.DIRECTORY)  ? 'd' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.ARCHIVE)  ? 'a' : '-';\n    return attrs;\n  }\n\n  /**\n   * Outputs detailed information about this entry for debugging\n   * Includes compression, encryption, timestamps, and extra fields\n   */\n  showVerboseInfo() {\n    Logger.log('=== Central Directory Entry (%s) ===', this.filename);\n    Logger.log('unzip from start of archive: ', this.localHdrOffset);\n    Logger.log('File system or operating system of origin:    ', this.fileSystemToString());\n    Logger.log('Version of encoding software:                 ', this.verMadeBy);\n    Logger.log('Compression Method:                           ', this.cmpMethodToString());\n    Logger.log('File Security Status:                         ', \n      this.bitFlags & GP_FLAG.ENCRYPTED ? \n        this.bitFlags & GP_FLAG.STRONG_ENCRYPT ? 'Strong Encrypt' : 'Encrypted' :\n        'Not Encrypted');\n    this.logEncryptionDetails();\n    Logger.log('File Modified (DOS date/time)                 ', this.toFormattedDateString()); \n    Logger.log('File Modified (UTC)                           ', this.toFormattedUTCDateString());\n    Logger.log('Compressed Size:                              ', this.compressedSize);\n    Logger.log('UnCompressed Size:                            ', this.uncompressedSize);\n    Logger.log(`32-bit CRC value (hex):                        ${this.crc.toString(16).padStart(8, '0')}`);\n    Logger.log('Length of extra field:                        ', this.extraField?.length ?? 0);\n    Logger.log('Length of file comment:                       ', this.comment?.length ?? 0);\n    Logger.log('Unix File Attributes:                         ');\n    Logger.log('MS-DOS File Attributes:                       ', this.dosAttributesToString());\n    if (this.extraField) {\n      Logger.log('\\nThe Central-Directory Extra Field contains:');\n      try {\n        for (let i = 0; i < this.extraField.length; ) {\n          // Ensure we have at least 4 bytes (header ID + length)\n          if (i + 4 > this.extraField.length) {\n            Logger.log(`   Warning: Truncated extra field at offset ${i}`);\n            break;\n          }\n          \n          let _id = this.extraField.readUInt16LE(i);\n          let _idStr = _id.toString(16).padStart(4, '0');\n          let _len = this.extraField.readUInt16LE(i + 2);\n          \n          // Validate the length to ensure it doesn't exceed buffer bounds\n          if (_len < 0 || i + 4 + _len > this.extraField.length) {\n            Logger.log(`   Warning: Invalid extra field length (${_len}) at offset ${i} for ID ${_idStr}`);\n            break;\n          }\n          \n          let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n          \n          try {\n            if (_id === HDR_ID.SHA256) {          \n              Logger.log(`   ID[0x${_idStr}] NeoZip-SHA256: ${_data.toString('hex')}`);\n            } else if (_id === HDR_ID.UNV_TIME) {\n              if (_len >= 5) {\n                const flags = _data.readUInt8(0);\n                const timestamp = _data.readUInt32LE(1);\n                const date = new Date(timestamp * 1000);\n                Logger.log(`   ID[0x${_idStr}] Universal Time: flags=${flags}, time=${date.toISOString()}`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Universal Time: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.UID_GID) {\n              if (_len >= 5) {\n                const version = _data.readUInt8(0);\n                const uidSize = _data.readUInt8(1);\n                if (2 + uidSize > _len) {\n                  Logger.log(`   ID[0x${_idStr}] Unix UID/GID: (invalid UID size ${uidSize})`);\n                } else {\n                  const uid = _data.readUIntLE(2, Math.min(uidSize, 4));\n                  let gid = 0;\n                  if (2 + uidSize + 1 < _len) {\n                    const gidSize = _data.readUInt8(2 + uidSize);\n                    if (2 + uidSize + 1 + gidSize <= _len) {\n                      gid = _data.readUIntLE(2 + uidSize + 1, Math.min(gidSize, 4));\n                    }\n                  }\n                  Logger.log(`   ID[0x${_idStr}] Unix UID/GID: version=${version}, uid=${uid}, gid=${gid}`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Unix UID/GID: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.SYMLINK) {\n              if (_len >= 3) {\n                const version = _data.readUInt8(0);\n                const targetLength = _data.readUInt16LE(1);\n                if (targetLength > 0 && _len >= 3 + targetLength) {\n                  const target = _data.subarray(3, 3 + targetLength).toString('utf8');\n                  Logger.log(`   ID[0x${_idStr}] Symbolic Link: version=${version}, target=\"${target}\"`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] Symbolic Link: (invalid target length ${targetLength})`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Symbolic Link: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.HARDLINK) {\n              if (_len >= 11) {\n                const version = _data.readUInt8(0);\n                const inode = _data.readUInt32LE(1);\n                const originalLength = _data.readUInt16LE(5);\n                if (originalLength > 0 && _len >= 7 + originalLength) {\n                  const original = _data.subarray(7, 7 + originalLength).toString('utf8');\n                  Logger.log(`   ID[0x${_idStr}] Hard Link: version=${version}, inode=${inode}, original=\"${original}\"`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] Hard Link: (invalid original length ${originalLength})`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Hard Link: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.UNICODE_PATH) {\n              if (_len >= 5) {\n                const version = _data.readUInt8(0);\n                const nameCrc32 = _data.readUInt32LE(1);\n                const unicodeName = _data.subarray(5).toString('utf8');\n                \n                // Calculate CRC32 of the original filename for verification\n                const fnameBuf = Buffer.from(this.filename);\n                const calculatedCrc = crc32(fnameBuf);\n                \n                const crcMatch = nameCrc32 === calculatedCrc ? 'MATCH' : 'MISMATCH';\n                \n                Logger.log(`   ID[0x${_idStr}] Unicode Path: version=${version}, CRC32=${nameCrc32.toString(16)} (${crcMatch})`);\n                Logger.log(`                      Path: \"${unicodeName}\"`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Unicode Path: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.AES) {\n              if (_len >= 7) {\n                const vendorVersion = _data.readUInt16LE(0);\n                const vendorId = String.fromCharCode(_data[2], _data[3]);\n                const strength = _data.readUInt8(4);\n                const realMethod = _data.readUInt16LE(5);\n                const strengthStr = strength === 3 ? '256-bit' : strength === 2 ? '192-bit' : strength === 1 ? '128-bit' : 'Unknown';\n                const aeLabel = vendorVersion === 2 ? 'AE-2 (CRC=0 in headers)' : vendorVersion === 1 ? 'AE-1 (plaintext CRC in headers)' : `vendorVer=${vendorVersion}`;\n                Logger.log(`   ID[0x${_idStr}] WinZip AES: ${aeLabel}, vendor=\"${vendorId}\", strength=${strengthStr}, realCompressionMethod=${realMethod}`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] WinZip AES: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.NEO_CRYPTO) {\n              if (_len >= NEO_CRYPTO_PAYLOAD_V1) {\n                if (\n                  _data[0] === NEO_CRYPTO_MAGIC_BYTES[0] &&\n                  _data[1] === NEO_CRYPTO_MAGIC_BYTES[1] &&\n                  _data[2] === NEO_CRYPTO_MAGIC_BYTES[2] &&\n                  _data[3] === NEO_CRYPTO_MAGIC_BYTES[3]\n                ) {\n                  const pv = _data.readUInt8(4);\n                  const alg = _data.readUInt16LE(5);\n                  const flg = _data.readUInt16LE(7);\n                  Logger.log(`   ID[0x${_idStr}] NeoEncrypt: payloadVer=${pv}, algorithm=${alg}, flags=${flg}`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] NeoEncrypt: (invalid magic)`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] NeoEncrypt: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.ZIP64) {\n              // ZIP64 Extended Information (0x0001)\n              Logger.log(`   ID[0x${_idStr}] ZIP64 Extended Information:`);\n              if (_len >= 8) {\n                let offset = 0;\n                \n                // Read uncompressed size (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const uncompressedSize = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Uncompressed Size (ZIP64): ${uncompressedSize.toString()} bytes`);\n                  offset += 8;\n                }\n                \n                // Read compressed size (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const compressedSize = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Compressed Size (ZIP64): ${compressedSize.toString()} bytes`);\n                  offset += 8;\n                }\n                \n                // Read local header offset (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const localHeaderOffset = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Local Header Offset (ZIP64): ${localHeaderOffset.toString()}`);\n                  offset += 8;\n                }\n                \n                // Read disk number (4 bytes) if present\n                if (offset + 4 <= _len) {\n                  const diskNumber = _data.readUInt32LE(offset);\n                  Logger.log(`     Disk Number (ZIP64): ${diskNumber}`);\n                }\n              } else {\n                Logger.log(`     ZIP64 Extended Information: (invalid length ${_len})`);\n              }\n            } else {\n              // For unknown fields, show a hex preview of the first few bytes\n              const preview = _len > 0 \n                ? _data.slice(0, Math.min(16, _len)).toString('hex')\n                : '';\n              Logger.log(`   ID[0x${_idStr}] Unknown field: length=${_len} bytes${preview ? ', data=' + preview + '...' : ''}`);\n            }\n          } catch (error: any) {\n            Logger.log(`   Error parsing extra field ID[0x${_idStr}]: ${error.message}`);\n          }\n          \n          i += 4 + _len;\n        }\n      } catch (error: any) {\n        Logger.log(`   Error parsing extra fields: ${error.message}`);\n      }\n    }\n    Logger.log('\\n');\n  }\n}\n\nexport { ZipEntry };\n", "// ============================================================================\n// NeoZipKit Version Info\n// ============================================================================\n\nexport interface NeoZipKitInfo {\n  version: string;\n  releaseDate: string;\n}\n\nexport const NEOZIPKIT_INFO: NeoZipKitInfo = {\n  version: '0.7.0',\n  releaseDate: '2026-04-06'\n};\n\n// ============================================================================\n// File Data Interfaces\n// ============================================================================\n\nexport interface FileData {\n  name: string;\n  size: number;\n  lastModified: number;\n  arrayBuffer(): Promise<ArrayBuffer>;\n}\n\nexport interface ZipFileEntry {\n  filename: string;\n  comment?: string | null;\n  fileData?: FileData;\n  fileBuffer?: Buffer | null;\n  isDirectory: boolean;\n  isMetaData: boolean;\n  isEncrypted: boolean;\n  sha256?: string | null;\n}\n\n// ============================================================================\n// Support Interface\n// ============================================================================\n\nexport interface Support {\n  base64: boolean;\n  array: boolean;\n  string: boolean;\n  isNode: boolean;\n  buffer: boolean;\n  uint8array: boolean;\n  arrayBuffer: boolean;\n  blob: boolean;\n  streams: boolean;\n  fileReader: boolean;\n}\n\n// ============================================================================\n// Archive Statistics\n// ============================================================================\n\nexport interface ArchiveStatistics {\n  fileSize: number;\n  created: Date;\n  modified: Date;\n  totalFiles: number;\n  totalFolders: number;\n  uncompressedSize: number;\n  compressedSize: number;\n  compressionRatio: number;\n  averageCompressionRatio: number;\n}\n", "/**\n * Browser stub for ZSTD \u2014 native zlib streaming is Node-only.\n * Browser builds alias `ZstdNode` to this module so the bad WASM codec is never shipped.\n */\n\nconst ZSTD_BROWSER_UNSUPPORTED =\n  'ZSTD requires Node.js with native zlib support (Node.js >= 22.15 or >= 23.8). ' +\n  'Browser builds do not include a zstd codec; use Deflate or process zstd archives in Node.';\n\nfunction unsupported(): never {\n  throw new Error(ZSTD_BROWSER_UNSUPPORTED);\n}\n\nexport function isNativeZstdAvailable(): boolean {\n  return false;\n}\n\nexport function mapCompressionLevel(_level: number): number {\n  return unsupported();\n}\n\nexport function createCompressTransform(_level?: number): never {\n  return unsupported();\n}\n\nexport function createDecompressTransform(): never {\n  return unsupported();\n}\n\nexport async function compress(_data: Buffer, _level?: number): Promise<Buffer> {\n  return unsupported();\n}\n\nexport async function decompress(_data: Buffer): Promise<Buffer> {\n  return unsupported();\n}\n\nexport function compressSync(_data: Buffer, _level?: number): Buffer {\n  return unsupported();\n}\n\nexport function decompressSync(_data: Buffer): Buffer {\n  return unsupported();\n}\n\nexport async function compressChunks(\n  _readChunk: (position: number, size: number) => Buffer,\n  _totalSize: number,\n  _chunkSize: number,\n  _level: number,\n  _onPlainChunk?: (chunk: Buffer) => void,\n  _onCompressedChunk?: (chunk: Buffer) => void | Promise<void>\n): Promise<number> {\n  return unsupported();\n}\n\nexport async function* decompressStream(\n  _compressedStream: AsyncIterable<Buffer>\n): AsyncGenerator<Buffer> {\n  unsupported();\n}\n\nexport const ZstdNode = {\n  isNativeZstdAvailable,\n  mapCompressionLevel,\n  createCompressTransform,\n  createDecompressTransform,\n  compress,\n  decompress,\n  compressSync,\n  decompressSync,\n  compressChunks,\n  decompressStream,\n};\n\nexport default ZstdNode;\n", "// ======================================\n//  HashCalculator.ts - Unified Hash Component\n//  Combines StreamHashCalculator, HashAccumulator, and MerkleTree functionality\n// ======================================\n\nimport * as crypto from 'crypto';\nimport { crc32update } from '../encryption/ZipCrypto';\n\n/**\n * Configuration options for Merkle tree construction\n */\ninterface MerkleTreeOptions {\n  hashLeaves: boolean;      // Whether to hash the leaf nodes before adding to tree\n  sortLeaves: boolean;      // Whether to sort leaf nodes for consistent trees\n  sortPairs: boolean;       // Whether to sort each pair before hashing\n  duplicateOdd: boolean;    // Whether to duplicate last leaf when odd number of leaves\n}\n\n/**\n * Unified hash calculator supporting:\n * - Incremental CRC-32 and SHA-256 calculation from raw data chunks\n * - Accumulation of pre-computed SHA-256 hashes with XOR and Merkle tree operations\n * - Merkle tree construction, proof generation, and verification\n * \n * Usage examples:\n * \n * Incremental hash calculation:\n * ```typescript\n * const calculator = new HashCalculator({ useSHA256: true });\n * calculator.update(dataChunk);\n * const crc32 = calculator.finalizeCRC32();\n * const sha256 = calculator.finalizeSHA256();\n * ```\n * \n * Hash accumulation:\n * ```typescript\n * const calculator = new HashCalculator({ enableAccumulation: true });\n * calculator.addHash(sha256Hash1);\n * calculator.addHash(sha256Hash2);\n * const xor = calculator.xorHash();\n * const merkle = calculator.merkleRoot();\n * ```\n */\nexport class HashCalculator {\n  // Incremental hash calculation state (from StreamHashCalculator)\n  private crc32State: number = ~0;\n  private sha256Hash: crypto.Hash | null = null;\n  private useSHA256: boolean = false;\n\n  // Hash accumulation state (from HashAccumulator)\n  private hashes: Buffer[] = [];\n  private xorResult: Buffer = Buffer.alloc(32, 0);\n  private enableAccumulation: boolean = false;\n\n  // Merkle tree state (from MerkleTree)\n  private merkleLeaves: Buffer[] = [];\n  private merkleLayers: Buffer[][] = [];\n  private merkleOptions: MerkleTreeOptions = {\n    hashLeaves: false,\n    sortLeaves: true,\n    sortPairs: true,\n    duplicateOdd: true\n  };\n\n  /**\n   * Creates a new HashCalculator instance\n   * @param options - Configuration options:\n   *   - useSHA256: Enable SHA-256 calculation for incremental mode (default: false)\n   *   - enableAccumulation: Enable hash accumulation mode (default: false)\n   */\n  constructor(options?: {\n    useSHA256?: boolean;\n    enableAccumulation?: boolean;\n  }) {\n    this.useSHA256 = options?.useSHA256 || false;\n    this.enableAccumulation = options?.enableAccumulation || false;\n\n    if (this.useSHA256) {\n      this.sha256Hash = crypto.createHash('sha256');\n    }\n  }\n\n  // ============================================================================\n  // Incremental Hash Calculation Methods (from StreamHashCalculator)\n  // ============================================================================\n\n  /**\n   * Update hash state with a new chunk of data\n   * Updates both CRC-32 and SHA-256 (if enabled) incrementally\n   * @param chunk - Data chunk to process\n   */\n  update(chunk: Buffer): void {\n    // Update CRC-32 incrementally using existing crc32update function\n    for (let i = 0; i < chunk.length; i++) {\n      this.crc32State = crc32update(this.crc32State, chunk[i]);\n    }\n    \n    // Update SHA-256 incrementally\n    if (this.sha256Hash) {\n      this.sha256Hash.update(chunk);\n    }\n  }\n\n  /**\n   * Get final CRC-32 value\n   * @returns Final CRC-32 value as unsigned 32-bit integer\n   */\n  finalizeCRC32(): number {\n    return ~this.crc32State >>> 0; // Finalize with ~0 like the existing crc32 function\n  }\n\n  /**\n   * Get final SHA-256 hash as hex string\n   * @returns SHA-256 hash as hex string, or null if SHA-256 not enabled\n   */\n  finalizeSHA256(): string | null {\n    if (this.sha256Hash) {\n      return this.sha256Hash.digest('hex');\n    }\n    return null;\n  }\n\n  /**\n   * Reset the incremental hash calculation state\n   */\n  reset(): void {\n    this.crc32State = ~0;\n    if (this.sha256Hash) {\n      this.sha256Hash = crypto.createHash('sha256');\n    }\n  }\n\n  // ============================================================================\n  // Hash Accumulation Methods (from HashAccumulator)\n  // ============================================================================\n\n  /**\n   * Adds a pre-computed SHA-256 hash to both the XOR accumulation and hash array\n   * @param hash - Hash value as hex string or Buffer (must be 32 bytes for SHA-256)\n   */\n  addHash(hash: string | Buffer): void {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    // Convert hash to Buffer if it's a string\n    const hashBuffer = typeof hash === 'string' \n      ? Buffer.from(hash, 'hex') \n      : hash;\n\n    // Add to array for Merkle tree\n    this.hashes.push(hashBuffer);\n    this.merkleLeaves.push(hashBuffer);\n\n    // XOR accumulation\n    for (let i = 0; i < 32; i++) {\n      this.xorResult[i] ^= hashBuffer[i];\n    }\n\n    // Rebuild Merkle tree when hash is added\n    this.rebuildMerkleTree();\n  }\n\n  /**\n   * Gets the accumulated XOR of all added hashes\n   * @returns Hex string of XOR result\n   */\n  xorHash(): string {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    return this.xorResult.toString('hex');\n  }\n\n  /**\n   * Creates a Merkle tree from accumulated hashes and returns the root\n   * @returns Hex string of Merkle root, or null if no hashes added\n   */\n  merkleRoot(): string | null {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    if (this.merkleLeaves.length === 0) {\n      return null;\n    }\n\n    // If Merkle tree not built yet, build it\n    if (this.merkleLayers.length === 0) {\n      this.rebuildMerkleTree();\n    }\n\n    const root = this.merkleLayers[this.merkleLayers.length - 1];\n    if (root && root.length > 0) {\n      return root[0].toString('hex');\n    }\n\n    return null;\n  }\n\n  /**\n   * Gets the number of hashes accumulated\n   * @returns Number of accumulated hashes\n   */\n  leafCount(): number {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    return this.hashes.length;\n  }\n\n  /**\n   * Clears the accumulated hashes and resets XOR buffer\n   */\n  clear(): void {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    this.hashes = [];\n    this.merkleLeaves = [];\n    this.merkleLayers = [];\n    this.xorResult = Buffer.alloc(32, 0);\n  }\n\n  /**\n   * Combines multiple hash results into a single Merkle root\n   * Static method for combining results from multiple HashCalculator instances\n   * @param results - Array of objects containing merkleRoot properties\n   * @returns Combined Merkle root as hex string, or null if no valid roots\n   */\n  static combineResults(results: { merkleRoot?: string }[]): string | null {\n    const calculator = new HashCalculator({ enableAccumulation: true });\n    \n    // Combine all hashes\n    for (const result of results) {\n      if (result.merkleRoot) {\n        calculator.addHash(result.merkleRoot);\n      }\n    }\n\n    return calculator.merkleRoot();\n  }\n\n  // ============================================================================\n  // Merkle Tree Methods (from MerkleTree)\n  // ============================================================================\n\n  /**\n   * Computes SHA-256 hash of input data\n   * @param data - Data to hash\n   * @returns Buffer containing hash\n   */\n  private hash(data: Buffer): Buffer {\n    return crypto.createHash('sha256').update(data).digest();\n  }\n\n  /**\n   * Combines two child hashes to create parent hash\n   * @param left - Left child hash\n   * @param right - Right child hash\n   * @returns Combined hash of children\n   */\n  private combinedHash(left: Buffer, right: Buffer): Buffer {\n    if (this.merkleOptions.sortPairs && Buffer.compare(left, right) > 0) {\n      [left, right] = [right, left];\n    }\n    return this.hash(Buffer.concat([left, right]));\n  }\n\n  /**\n   * Builds the Merkle tree by creating successive layers of hashes\n   * @param nodes - Array of nodes in current layer\n   */\n  private createHashes(nodes: Buffer[]): void {\n    while (nodes.length > 1) {\n      const layerIndex = this.merkleLayers.length;\n      this.merkleLayers.push([]);\n\n      // Process pairs of nodes\n      for (let i = 0; i < nodes.length - 1; i += 2) {\n        const left = nodes[i];\n        const right = nodes[i + 1];\n        const hash = this.combinedHash(left, right);\n        this.merkleLayers[layerIndex].push(hash);\n      }\n\n      // Handle odd number of nodes\n      if (nodes.length % 2 === 1) {\n        const last = nodes[nodes.length - 1];\n        if (this.merkleOptions.duplicateOdd) {\n          // Duplicate the last node if odd\n          const hash = this.combinedHash(last, last);\n          this.merkleLayers[layerIndex].push(hash);\n        } else {\n          // Push last node up to next layer\n          this.merkleLayers[layerIndex].push(last);\n        }\n      }\n\n      nodes = this.merkleLayers[layerIndex];\n    }\n  }\n\n  /**\n   * Rebuilds the Merkle tree from current leaves\n   */\n  private rebuildMerkleTree(): void {\n    if (this.merkleLeaves.length === 0) {\n      this.merkleLayers = [];\n      return;\n    }\n\n    // Process leaves according to options\n    const processedLeaves = this.merkleLeaves.map(leaf => {\n      if (this.merkleOptions.hashLeaves) {\n        return this.hash(leaf);\n      }\n      return Buffer.isBuffer(leaf) ? leaf : Buffer.from(leaf);\n    });\n\n    if (this.merkleOptions.sortLeaves) {\n      processedLeaves.sort(Buffer.compare);\n    }\n\n    this.merkleLayers = [processedLeaves];\n    this.createHashes(processedLeaves);\n  }\n\n  /**\n   * Generates a proof of inclusion for a leaf node\n   * @param leaf - The leaf node to generate proof for\n   * @returns Array of sibling hashes needed to reconstruct root\n   * @throws Error if leaf not found in tree or accumulation not enabled\n   */\n  getProof(leaf: Buffer): Buffer[] {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    if (this.merkleLayers.length === 0) {\n      this.rebuildMerkleTree();\n    }\n\n    let index = this.merkleLeaves.findIndex(item => item.equals(leaf));\n    if (index === -1) {\n      throw new Error('Leaf not found in tree');\n    }\n\n    return this.merkleLayers.reduce((proof, layer) => {\n      if (layer.length === 1) return proof;\n\n      const pairIndex = index % 2 === 0 ? index + 1 : index - 1;\n      if (pairIndex < layer.length) {\n        proof.push(layer[pairIndex]);\n      }\n\n      index = Math.floor(index / 2);\n      return proof;\n    }, [] as Buffer[]);\n  }\n\n  /**\n   * Verifies a proof of inclusion for a leaf node\n   * @param proof - Array of sibling hashes from getProof()\n   * @param targetHash - Hash of the leaf node being verified\n   * @param root - Expected root hash\n   * @returns boolean indicating if proof is valid\n   */\n  verify(proof: Buffer[], targetHash: Buffer, root: Buffer): boolean {\n    let computedHash = targetHash;\n\n    for (const proofElement of proof) {\n      computedHash = Buffer.compare(computedHash, proofElement) <= 0\n        ? this.combinedHash(computedHash, proofElement)\n        : this.combinedHash(proofElement, computedHash);\n    }\n\n    return computedHash.equals(root);\n  }\n}\n\n// Default export\nexport default HashCalculator;\n\n", "// ======================================\n//  AesCrypto.ts - WinZip AES-256 Encryption (AE-1/AE-2)\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n// Implements the WinZip AES encryption specification for ZIP files.\n// Compatible with WinZip, 7-Zip, and other tools that support the AE-1/AE-2 format.\n//\n// Spec: https://www.winzip.com/en/support/aes-encryption/\n//\n// Data layout per encrypted entry:\n//   [salt (16 bytes)] [password verifier (2 bytes)] [encrypted data] [HMAC-SHA1 (10 bytes)]\n//\n// Extra field 0x9901 (11 bytes):\n//   [header ID (2)] [data size (2)] [vendor version (2)] [vendor ID (2)] [strength (1)] [real method (2)]\n//\n// Streaming helpers (AesEncryptor / AesDecryptor) keep only a 16-byte CTR block in\n// flight so Node create/extract can chunk large AE-1/AE-2 entries.\n\nimport * as crypto from 'crypto';\nimport ZipEntry from '../ZipEntry';\nimport {\n  AES256_SALT_SIZE,\n  AES256_KEY_SIZE,\n  AES256_PWD_VERIFY_SIZE,\n  AES_AUTH_CODE_SIZE,\n  AES_EXTRA_FIELD_SIZE,\n  AES_OVERHEAD,\n  HDR_ID,\n} from '../constants/Headers';\n\nconst COMPOSITE_KEY_LENGTH = 2 * AES256_KEY_SIZE + AES256_PWD_VERIFY_SIZE; // 66 bytes\nconst PBKDF2_ITERATIONS = 1000;\nconst AES_BLOCK_SIZE = 16;\n\ninterface DerivedKeys {\n  aesKey: Buffer;\n  hmacKey: Buffer;\n  passwordVerifier: Buffer;\n}\n\n/** Little-endian AES-CTR keystream (WinZip counter starts at 1). */\nclass AesCtrEngine {\n  private readonly aesKey: Buffer;\n  private readonly counter: Buffer;\n  private keystream: Buffer;\n  private ksPos: number;\n\n  constructor(aesKey: Buffer) {\n    this.aesKey = aesKey;\n    this.counter = Buffer.alloc(AES_BLOCK_SIZE);\n    this.counter[0] = 1;\n    this.keystream = this.encryptCounter();\n    this.ksPos = 0;\n  }\n\n  process(data: Buffer): Buffer {\n    if (data.length === 0) {\n      return Buffer.alloc(0);\n    }\n    const result = Buffer.alloc(data.length);\n    for (let i = 0; i < data.length; i++) {\n      if (this.ksPos >= AES_BLOCK_SIZE) {\n        AesCtrEngine.incrementCounterLE(this.counter);\n        this.keystream = this.encryptCounter();\n        this.ksPos = 0;\n      }\n      result[i] = data[i] ^ this.keystream[this.ksPos++];\n    }\n    return result;\n  }\n\n  private encryptCounter(): Buffer {\n    const cipher = crypto.createCipheriv('aes-256-ecb', this.aesKey, null);\n    cipher.setAutoPadding(false);\n    return cipher.update(this.counter);\n  }\n\n  static incrementCounterLE(counter: Buffer): void {\n    for (let i = 0; i < AES_BLOCK_SIZE; i++) {\n      if (counter[i] === 255) {\n        counter[i] = 0;\n      } else {\n        counter[i]++;\n        break;\n      }\n    }\n  }\n}\n\n/**\n * Streaming AE-1/AE-2 encryptor for ZIP entry payloads.\n *\n * Usage: `header()` once \u2192 `update(compressedChunk)` repeatedly \u2192 `finish()` for HMAC.\n */\nexport class AesEncryptor {\n  private readonly keys: DerivedKeys;\n  private readonly salt: Buffer;\n  private readonly ctr: AesCtrEngine;\n  private readonly hmac: crypto.Hmac;\n  private headerSent = false;\n  private finished = false;\n\n  constructor(password: string) {\n    this.salt = crypto.randomBytes(AES256_SALT_SIZE);\n    this.keys = AesCrypto.deriveKeys(password, this.salt);\n    this.ctr = new AesCtrEngine(this.keys.aesKey);\n    this.hmac = crypto.createHmac('sha1', this.keys.hmacKey);\n  }\n\n  /** salt (16) + password verifier (2). Write before any ciphertext. */\n  header(): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    this.headerSent = true;\n    return Buffer.concat([this.salt, this.keys.passwordVerifier]);\n  }\n\n  /** Encrypt one compressed-data chunk; updates HMAC over ciphertext. */\n  update(plain: Buffer): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    if (!this.headerSent) {\n      throw new Error('AesEncryptor.header() must be called before update()');\n    }\n    if (plain.length === 0) {\n      return Buffer.alloc(0);\n    }\n    const cipher = this.ctr.process(plain);\n    this.hmac.update(cipher);\n    return cipher;\n  }\n\n  /** Final 10-byte authentication code. */\n  finish(): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    if (!this.headerSent) {\n      throw new Error('AesEncryptor.header() must be called before finish()');\n    }\n    this.finished = true;\n    return this.hmac.digest().subarray(0, AES_AUTH_CODE_SIZE);\n  }\n}\n\n/**\n * Streaming AE-1/AE-2 decryptor. `compressedSize` is the full ZIP payload length\n * (salt + verifier + ciphertext + auth), as stored in the local/central header.\n */\nexport class AesDecryptor {\n  private readonly password: string;\n  private readonly cipherLen: number;\n  private remainingCipher: number;\n  private keys: DerivedKeys | null = null;\n  private ctr: AesCtrEngine | null = null;\n  private hmac: crypto.Hmac | null = null;\n  private headerBuf = Buffer.alloc(0);\n  private authBuf = Buffer.alloc(0);\n  private headerDone = false;\n  private verified = false;\n\n  constructor(password: string, compressedSize: number) {\n    if (compressedSize < AES_OVERHEAD) {\n      throw new Error('AES decryption failed: payload too short');\n    }\n    this.password = password;\n    this.cipherLen = compressedSize - AES_OVERHEAD;\n    this.remainingCipher = this.cipherLen;\n  }\n\n  /**\n   * Feed the next archive chunk. Returns decrypted compressed bytes\n   * (empty while still reading salt/verifier).\n   */\n  push(chunk: Buffer): Buffer {\n    let data = chunk;\n    if (!this.headerDone) {\n      this.headerBuf = Buffer.concat([this.headerBuf, data]);\n      const need = AES256_SALT_SIZE + AES256_PWD_VERIFY_SIZE;\n      if (this.headerBuf.length < need) {\n        return Buffer.alloc(0);\n      }\n      const salt = this.headerBuf.subarray(0, AES256_SALT_SIZE);\n      const storedVerifier = this.headerBuf.subarray(AES256_SALT_SIZE, need);\n      this.keys = AesCrypto.deriveKeys(this.password, salt);\n      if (!this.keys.passwordVerifier.equals(storedVerifier)) {\n        throw new Error('AES decryption failed: wrong password');\n      }\n      this.ctr = new AesCtrEngine(this.keys.aesKey);\n      this.hmac = crypto.createHmac('sha1', this.keys.hmacKey);\n      this.headerDone = true;\n      data = this.headerBuf.subarray(need);\n      this.headerBuf = Buffer.alloc(0);\n    }\n\n    if (data.length === 0) {\n      return Buffer.alloc(0);\n    }\n\n    const cipherTake = Math.min(data.length, this.remainingCipher);\n    const cipherPart = data.subarray(0, cipherTake);\n    const rest = data.subarray(cipherTake);\n    if (rest.length > 0) {\n      this.authBuf = Buffer.concat([this.authBuf, rest]);\n    }\n\n    if (cipherPart.length === 0) {\n      this.tryVerify();\n      return Buffer.alloc(0);\n    }\n\n    this.hmac!.update(cipherPart);\n    const plain = this.ctr!.process(cipherPart);\n    this.remainingCipher -= cipherPart.length;\n    this.tryVerify();\n    return plain;\n  }\n\n  /** Ensure ciphertext is complete and HMAC verified. */\n  end(): void {\n    if (this.remainingCipher > 0) {\n      throw new Error('AES decryption failed: truncated ciphertext');\n    }\n    this.tryVerify();\n    if (!this.verified) {\n      throw new Error('AES decryption failed: missing authentication code');\n    }\n  }\n\n  private tryVerify(): void {\n    if (this.verified || this.remainingCipher > 0 || !this.hmac) {\n      return;\n    }\n    if (this.authBuf.length < AES_AUTH_CODE_SIZE) {\n      return;\n    }\n    const stored = this.authBuf.subarray(0, AES_AUTH_CODE_SIZE);\n    const calculated = this.hmac.digest().subarray(0, AES_AUTH_CODE_SIZE);\n    if (!calculated.equals(stored)) {\n      throw new Error(\n        'AES decryption failed: authentication code mismatch (data corrupted or tampered)'\n      );\n    }\n    this.verified = true;\n  }\n}\n\n/**\n * WinZip AES-256 encryption/decryption for ZIP files.\n *\n * Uses PBKDF2-HMAC-SHA1 for key derivation, AES-256 in CTR mode with\n * a little-endian counter (WinZip convention), and HMAC-SHA1 for authentication.\n */\nexport class AesCrypto {\n  /**\n   * Derive encryption key, HMAC key, and password verification value\n   * using PBKDF2 with HMAC-SHA1.\n   */\n  static deriveKeys(password: string | Buffer, salt: Buffer): DerivedKeys {\n    const key = Buffer.isBuffer(password) ? password : Buffer.from(password);\n    const compositeKey = crypto.pbkdf2Sync(\n      key,\n      salt,\n      PBKDF2_ITERATIONS,\n      COMPOSITE_KEY_LENGTH,\n      'sha1'\n    );\n    return {\n      aesKey: compositeKey.subarray(0, AES256_KEY_SIZE),\n      hmacKey: compositeKey.subarray(AES256_KEY_SIZE, 2 * AES256_KEY_SIZE),\n      passwordVerifier: compositeKey.subarray(2 * AES256_KEY_SIZE),\n    };\n  }\n\n  /** Create a streaming AE-1/AE-2 encryptor. */\n  static createEncryptor(password: string): AesEncryptor {\n    return new AesEncryptor(password);\n  }\n\n  /**\n   * Create a streaming AE-1/AE-2 decryptor.\n   * @param compressedSize Full payload size including salt, verifier, and auth code.\n   */\n  static createDecryptor(password: string, compressedSize: number): AesDecryptor {\n    return new AesDecryptor(password, compressedSize);\n  }\n\n  /**\n   * Encrypt compressed data using WinZip AES-256.\n   *\n   * @returns Buffer: salt(16) + verifier(2) + encryptedData + hmac(10)\n   */\n  static encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    void entry;\n    const enc = AesCrypto.createEncryptor(password);\n    const parts = [enc.header()];\n    if (compressedData.length > 0) {\n      parts.push(enc.update(compressedData));\n    }\n    parts.push(enc.finish());\n    return Buffer.concat(parts);\n  }\n\n  /**\n   * Decrypt AES-256 encrypted data from a ZIP entry.\n   *\n   * @param entry - ZIP entry metadata\n   * @param fullPayload - The full payload: salt + verifier + encrypted + hmac\n   * @param password - Decryption password\n   * @returns Decrypted (compressed) data\n   */\n  static decryptBuffer(entry: ZipEntry, fullPayload: Buffer, password: string): Buffer {\n    void entry;\n    const dec = AesCrypto.createDecryptor(password, fullPayload.length);\n    const out = dec.push(fullPayload);\n    dec.end();\n    return out;\n  }\n\n  /**\n   * Decrypt an async chunk stream (Node extract path).\n   * Yields decrypted compressed chunks; verifies HMAC when the stream ends.\n   */\n  static async *decryptStream(\n    password: string,\n    compressedSize: number,\n    encryptedStream: AsyncIterable<Buffer>\n  ): AsyncGenerator<Buffer> {\n    const dec = AesCrypto.createDecryptor(password, compressedSize);\n    for await (const chunk of encryptedStream) {\n      const plain = dec.push(chunk);\n      if (plain.length > 0) {\n        yield plain;\n      }\n    }\n    dec.end();\n  }\n\n  /**\n   * Build the WinZip AES extra data field (0x9901).\n   *\n   * @param realMethod - The actual compression method (e.g. DEFLATED=8, STORED=0)\n   * @param vendorVersion - 1 for AE-1 (CRC stored), 2 for AE-2 (CRC=0)\n   * @returns 11-byte buffer containing the complete extra field\n   */\n  static buildAesExtraField(realMethod: number, vendorVersion: number = 1): Buffer {\n    const buf = Buffer.alloc(AES_EXTRA_FIELD_SIZE);\n    buf.writeUInt16LE(HDR_ID.AES, 0);\n    buf.writeUInt16LE(7, 2);\n    buf.writeUInt16LE(vendorVersion, 4);\n    buf.writeUInt16LE(0x4541, 6); // \"AE\"\n    buf.writeUInt8(0x03, 8); // AES-256\n    buf.writeUInt16LE(realMethod, 9);\n    return buf;\n  }\n\n  /**\n   * Parse the AES extra data field (0x9901) from a buffer.\n   *\n   * @param data - 7-byte data portion of the extra field (without header ID and size)\n   */\n  static parseAesExtraField(data: Buffer): {\n    vendorVersion: number;\n    vendorId: string;\n    encryptionStrength: number;\n    realCmpMethod: number;\n  } {\n    return {\n      vendorVersion: data.readUInt16LE(0),\n      vendorId: String.fromCharCode(data[2], data[3]),\n      encryptionStrength: data.readUInt8(4),\n      realCmpMethod: data.readUInt16LE(5),\n    };\n  }\n}\n", "// ======================================\n//  NeoCrypto.ts - NeoEncrypt (NEO AES-256 via extra 0x024E)\n//  Copyright (c) 2026 NeoWare, Inc. All rights reserved.\n// ======================================\n// See docs/NEO_CRYPTO_FORMAT.md. Ciphertext layout matches AesCrypto (WinZip LE CTR + HMAC).\n// NeoEncrypt uses standard ZIP compression method; only encryption metadata is in the NEO extra.\n\nimport ZipEntry from '../ZipEntry';\nimport {\n  HDR_ID,\n  NEO_CRYPTO_MAGIC_BYTES,\n  NEO_CRYPTO_PAYLOAD_V1,\n  NEO_CRYPTO_EXTRA_FIELD_SIZE,\n} from '../constants/Headers';\nimport { AesCrypto } from './AesCrypto';\n\n/** Encryption algorithm IDs inside NEO extra (payload format v1) */\nexport const NEO_CRYPTO_ALGORITHM_AES256_V1 = 1;\n\nexport interface NeoCryptoParsedPayload {\n  payloadVersion: number;\n  algorithm: number;\n  flags: number;\n  reserved: number;\n}\n\nexport class NeoCrypto {\n  /**\n   * Build 11-byte NEO crypto payload (format version 1).\n   */\n  static buildPayloadV1(\n    algorithm: number = NEO_CRYPTO_ALGORITHM_AES256_V1,\n    flags: number = 0,\n    reserved: number = 0\n  ): Buffer {\n    const buf = Buffer.alloc(NEO_CRYPTO_PAYLOAD_V1);\n    for (let i = 0; i < 4; i++) {\n      buf[i] = NEO_CRYPTO_MAGIC_BYTES[i];\n    }\n    buf.writeUInt8(1, 4);\n    buf.writeUInt16LE(algorithm, 5);\n    buf.writeUInt16LE(flags, 7);\n    buf.writeUInt16LE(reserved, 9);\n    return buf;\n  }\n\n  /**\n   * Full ZIP extra field record: HeaderID + TSize + payload (15 bytes for v1).\n   */\n  static buildExtraFieldRecordV1(\n    algorithm: number = NEO_CRYPTO_ALGORITHM_AES256_V1,\n    flags: number = 0,\n    reserved: number = 0\n  ): Buffer {\n    const buf = Buffer.alloc(NEO_CRYPTO_EXTRA_FIELD_SIZE);\n    buf.writeUInt16LE(HDR_ID.NEO_CRYPTO, 0);\n    buf.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, 2);\n    NeoCrypto.buildPayloadV1(algorithm, flags, reserved).copy(buf, 4);\n    return buf;\n  }\n\n  /**\n   * Parse NEO payload (11 bytes after extra header id+len). Returns null if invalid.\n   */\n  static tryParsePayload(data: Buffer): NeoCryptoParsedPayload | null {\n    if (data.length < NEO_CRYPTO_PAYLOAD_V1) {\n      return null;\n    }\n    if (\n      data[0] !== NEO_CRYPTO_MAGIC_BYTES[0] ||\n      data[1] !== NEO_CRYPTO_MAGIC_BYTES[1] ||\n      data[2] !== NEO_CRYPTO_MAGIC_BYTES[2] ||\n      data[3] !== NEO_CRYPTO_MAGIC_BYTES[3]\n    ) {\n      return null;\n    }\n    return {\n      payloadVersion: data.readUInt8(4),\n      algorithm: data.readUInt16LE(5),\n      flags: data.readUInt16LE(7),\n      reserved: data.readUInt16LE(9),\n    };\n  }\n\n  static parsePayload(data: Buffer): NeoCryptoParsedPayload {\n    const p = NeoCrypto.tryParsePayload(data);\n    if (!p || p.payloadVersion !== 1) {\n      throw new Error('NeoEncrypt: invalid NEO crypto extra field');\n    }\n    return p;\n  }\n\n  /**\n   * Encrypt compressed data (algorithm 1 = same bytes as WinZip AES-256 in AesCrypto).\n   */\n  static encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    return AesCrypto.encryptBuffer(entry, compressedData, password);\n  }\n\n  /**\n   * Decrypt NeoEncrypt file data (full salt+verifier+ciphertext+hmac).\n   */\n  static decryptBuffer(entry: ZipEntry, fullPayload: Buffer, password: string): Buffer {\n    return AesCrypto.decryptBuffer(entry, fullPayload, password);\n  }\n}\n", "// ======================================\n//\tZipkitCompress.ts - Compression Module\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// LOGGING INSTRUCTIONS:\n// ---------------------\n// To enable/disable logging, set loggingEnabled to true/false in the class:\n//   private static loggingEnabled: boolean = true;  // Enable logging\n//   private static loggingEnabled: boolean = false; // Disable logging\n//\n// Logging respects the global Logger level (debug, info, warn, error, silent).\n// Logger level is automatically set to 'debug' when loggingEnabled is true.\n//\n\nconst pako = require('pako');\nimport { ZstdNode } from '../node/ZstdNode';\nimport Zipkit from './Zipkit';\nimport { Logger } from './components/Logger';\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { CMP_METHOD, GP_FLAG, ENCRYPT_HDR_SIZE } from './constants/Headers';\nimport { HashCalculator } from './components/HashCalculator';\nimport { ZipCrypto } from './encryption/ZipCrypto';\nimport { AesCrypto } from './encryption/AesCrypto';\nimport { NeoCrypto, NEO_CRYPTO_ALGORITHM_AES256_V1 } from './encryption/NeoCrypto';\n\n/**\n * Options for compressing files in a ZIP archive\n */\nexport interface CompressOptions {\n  level?: number;             // Compression level (1-9, 0=store)\n  password?: string | null;   // Password for encryption\n  encryptionMethod?: 'aes256' | 'zipcrypto' | 'neo-aes256'; // default WinZip AES when password set; 'neo-aes256' = NeoEncrypt extra 0x024E\n  useSHA256?: boolean;        // Whether to calculate SHA256 hash default is false\n  useZstd?: boolean;          // Whether to use Zstandard compression default is true\n  bufferSize?: number;        // Override default buffer size\n}\n\n/**\n * Callbacks for ZIP file creation process\n * Buffer-based only - no file I/O operations\n */\nexport interface CreateZipOptions {\n  onError?: (error: Error) => void;              // Called when an error occurs\n  onEntryDone?: (entry: ZipEntry, status: string) => void;  // Called when entry processing completes\n  onOutputBuffer?: (data: Buffer) => Promise<void>;       // Called to write output data\n}\n\n/**\n * Compression handler for ZIP files\n * Supports Deflate, Zstandard, and Store methods\n */\nexport class ZipCompress {\n  private zipkit: Zipkit;\n  private debug: boolean;\n\n  // Class-level logging control - set to true to enable logging\n  private static loggingEnabled: boolean = false;\n\n  /**\n   * Internal logging method - only logs if class logging is enabled\n   */\n  private log(...args: any[]): void {\n    if (ZipCompress.loggingEnabled) {\n      Logger.debug(`[ZipCompress]`, ...args);\n    }\n  }\n\n  /**\n   * Creates a new ZipCompress instance\n   * @param zipkit - Zipkit instance to use for ZIP operations\n   */\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n    // Debug disabled by default (controlled by class-level logging)\n    this.debug = false;\n    // If logging is enabled, ensure Logger level is set to debug\n    if (ZipCompress.loggingEnabled) {\n      Logger.setLevel('debug');\n    }\n    this.log(`ZipCompress initialized`);\n  }\n\n  /**\n   * Compresses data for a ZIP entry (Buffer-based only)\n   * @param entry - ZIP entry to compress\n   * @param data - Buffer containing data to compress\n   * @param options - Compression options\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Buffer containing compressed data\n   */\n  async compressData(entry: ZipEntry, data: Buffer, options?: CompressOptions, onOutputBuffer?: (data: Buffer) => Promise<void>): Promise<Buffer> {\n    this.log(`compressData() called for entry: ${entry.filename}`);\n    \n    // Set uncompressed size if not already set\n    if (!entry.uncompressedSize || entry.uncompressedSize === 0) {\n      entry.uncompressedSize = data.length;\n    }\n    const totalSize = data.length;\n    const bufferSize = options?.bufferSize || this.zipkit.getBufferSize(); // Use Zipkit's bufferSize\n    \n    this.log(`Compressing ${totalSize} bytes for entry: ${entry.filename}`);\n    this.log(`Compression options:`, { level: options?.level, useZstd: options?.useZstd, bufferSize });\n    \n    // Determine compression method\n    let compressionMethod: number;\n    \n    if (options?.level === 0) {\n      compressionMethod = CMP_METHOD.STORED;\n      this.log(`Using STORED method (no compression)`);\n    } else if (options?.useZstd) {\n      // ZSTD fallback to STORED if file too small\n      if (totalSize < 100) {\n        compressionMethod = CMP_METHOD.STORED;\n        this.log(`ZSTD fallback to STORED (file too small: ${totalSize} bytes)`);\n      } else {\n        compressionMethod = CMP_METHOD.ZSTD;\n        this.log(`Using ZSTD method (zstd compression)`);\n      }\n    } else {\n      compressionMethod = CMP_METHOD.DEFLATED;\n      this.log(`Using DEFLATED method (default compression)`);\n    }\n    \n    entry.cmpMethod = compressionMethod;\n    \n    // Initialize hash calculator\n    const needsHashCalculation = (!entry.crc || entry.crc === 0) || (options?.useSHA256 && !entry.sha256);\n    const hashCalculator = needsHashCalculation ? new HashCalculator({ useSHA256: options?.useSHA256 && !entry.sha256 || false }) : null;\n    \n    // Calculate hashes if needed\n    if (hashCalculator) {\n      hashCalculator.update(data);\n      if (!entry.crc || entry.crc === 0) {\n        entry.crc = hashCalculator.finalizeCRC32();\n      }\n      if (options?.useSHA256 && !entry.sha256) {\n        entry.sha256 = hashCalculator.finalizeSHA256();\n      }\n      this.log(`Final hashes: CRC32=0x${entry.crc.toString(16).padStart(8, '0')}, SHA256=${entry.sha256 || 'N/A'}`);\n    }\n    \n    // Encrypt if password provided\n    const enc = options?.encryptionMethod;\n    const useZipCrypto = enc === 'zipcrypto';\n    const useNeo = enc === 'neo-aes256';\n    const useAes = options?.password && !useZipCrypto && !useNeo;\n    if (options?.password) {\n      const label = useZipCrypto ? 'ZipCrypto' : useNeo ? 'NeoEncrypt (AES-256)' : 'WinZip AES-256';\n      this.log(`Encrypting compressed data for entry: ${entry.filename} (method: ${label})`);\n      entry.bitFlags = (entry.bitFlags || 0) | GP_FLAG.ENCRYPTED;\n      entry.isEncrypted = true;\n    }\n    \n    // Compress data based on method\n    let compressedData: Buffer;\n    const methodName = compressionMethod === CMP_METHOD.ZSTD ? 'ZSTD' : compressionMethod === CMP_METHOD.DEFLATED ? 'DEFLATED' : 'STORED';\n    \n    if (compressionMethod === CMP_METHOD.STORED) {\n      compressedData = data;\n    } else {\n      this.log(`Processing sequence for ${methodName}: [HASH] -> [COMPRESS] -> [OUTPUT]`);\n      this.log(`Compressing: method=${methodName}, input=${totalSize} bytes, buffer size=${bufferSize} bytes`);\n      this.log(`Calculating hashes: CRC32=${!entry.crc || entry.crc === 0}, SHA256=${options?.useSHA256}`);\n      \n      if (compressionMethod === CMP_METHOD.ZSTD) {\n        compressedData = await this.zstdCompress(data, options, bufferSize, entry, onOutputBuffer);\n      } else {\n        compressedData = await this.deflateCompress(data, options, bufferSize, entry, onOutputBuffer);\n      }\n    }\n    \n    // Encrypt compressed data if password provided\n    if (options?.password) {\n      if (useNeo) {\n        compressedData = this.encryptCompressedDataNeo(entry, compressedData, options.password);\n      } else if (useAes) {\n        compressedData = this.encryptCompressedDataAes(entry, compressedData, options.password);\n      } else {\n        compressedData = this.encryptCompressedData(entry, compressedData, options.password);\n      }\n    }\n    \n    entry.compressedSize = compressedData.length;\n    \n    return compressedData;\n  }\n\n  /**\n   * Compress data using deflate algorithm with chunked processing\n   * @param data - Data to compress (Buffer or chunked reader)\n   * @param options - Compression options\n   * @param bufferSize - Buffer size for chunked processing\n   * @param entry - ZIP entry being compressed\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Buffer containing compressed data\n   */\n  async deflateCompress(\n    data: Buffer | { totalSize: number, onReadChunk: (position: number, size: number) => Buffer, onOutChunk: (chunk: Buffer) => void },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    this.log(`deflateCompress() called - entry: ${entry?.filename ?? 'unknown'}, bufferSize: ${bufferSize}, level: ${options?.level ?? 6}`);\n    \n    const effectiveBufferSize = bufferSize || this.zipkit.getBufferSize();\n    const level = options?.level ?? 6;\n    \n    // Handle chunked reader\n    if (typeof data === 'object' && 'totalSize' in data && 'onReadChunk' in data) {\n      // Chunked reader mode - not implemented in simplified version\n      throw new Error('Chunked reader mode not supported in ZipCompress');\n    }\n    \n    // For small data, use synchronous deflate\n    if (data.length <= effectiveBufferSize) {\n      return this.deflate(data, options);\n    }\n    \n    // For large data, use chunked deflate\n    const deflator = new pako.Deflate({ level, raw: true });\n    const compressedChunks: Buffer[] = [];\n    let totalProcessed = 0;\n    let totalCompressedSize = 0;\n    \n    try {\n      // Process data in chunks\n      for (let offset = 0; offset < data.length; offset += effectiveBufferSize) {\n        const chunk = data.slice(offset, offset + effectiveBufferSize);\n        const isLast = offset + effectiveBufferSize >= data.length;\n        \n        deflator.push(chunk, isLast);\n        \n        // Collect compressed chunks\n        if (deflator.result && deflator.result.length > 0) {\n          const compressedChunk = Buffer.from(deflator.result);\n          compressedChunks.push(compressedChunk);\n          totalCompressedSize += compressedChunk.length;\n          \n          // Stream output if callback provided\n          if (onOutputBuffer) {\n            await onOutputBuffer(compressedChunk);\n          }\n        }\n        \n        totalProcessed += chunk.length;\n      }\n      \n      // Calculate compression ratio\n      const ratio = totalProcessed > 0 ? Math.round((totalCompressedSize / totalProcessed) * 100) : 0;\n      this.log(`Final hashes: CRC32=0x${entry?.crc?.toString(16).padStart(8, '0')}, SHA256=${entry?.sha256 || 'N/A'}`);\n      this.log(`Deflate compression complete: ${totalCompressedSize} bytes from ${totalProcessed} bytes (ratio=${ratio}%)`);\n      \n      return Buffer.concat(compressedChunks);\n    } catch (e) {\n      throw new Error(`Deflate compression failed: ${e instanceof Error ? e.message : String(e)}`);\n    }\n  }\n\n  /**\n   * Compress data using deflate algorithm (synchronous, small buffers only)\n   * @param inbuf - Buffer containing data to compress\n   * @param options - Compression options\n   * @returns Buffer containing compressed data\n   */\n  deflate(inbuf: Buffer, options?: CompressOptions): Buffer {\n    this.log(`deflate() called with buffer size: ${inbuf.length}, level: ${options?.level ?? 6}`);\n    const level = options?.level ?? 6;\n    const result = pako.deflateRaw(inbuf, { level });\n    const ratio = inbuf.length > 0 ? Math.round((result.length / inbuf.length) * 100) : 0;\n    this.log(`Deflate compression complete: ${result.length} bytes from ${inbuf.length} bytes (ratio=${ratio}%)`);\n    return Buffer.from(result.buffer, result.byteOffset, result.byteLength);\n  }\n\n  /**\n   * Compress data using Zstandard via Node native zlib chunked streaming.\n   * Not available in browser builds (throws).\n   */\n  async zstdCompress(\n    input: Buffer | { totalSize: number, readChunk: (position: number, size: number) => Buffer },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    this.log(`zstdCompress() called - entry: ${entry?.filename ?? 'unknown'}, bufferSize: ${bufferSize}, level: ${options?.level ?? 6}`);\n\n    const effectiveBufferSize = bufferSize || this.zipkit.getBufferSize();\n    const level = options?.level ?? 6;\n    const isBuffer = Buffer.isBuffer(input);\n    const totalSize = isBuffer ? input.length : input.totalSize;\n\n    if (!totalSize) {\n      throw new Error('ZSTD compression: empty input buffer');\n    }\n\n    if (options?.level === 0) {\n      if (isBuffer) {\n        if (onOutputBuffer) {\n          await onOutputBuffer(input);\n        }\n        return input;\n      }\n      const chunks: Buffer[] = [];\n      let position = 0;\n      while (position < totalSize) {\n        const size = Math.min(effectiveBufferSize, totalSize - position);\n        const chunk = input.readChunk(position, size);\n        if (onOutputBuffer) {\n          await onOutputBuffer(chunk);\n        } else {\n          chunks.push(chunk);\n        }\n        position += chunk.length;\n      }\n      return onOutputBuffer ? Buffer.alloc(0) : Buffer.concat(chunks);\n    }\n\n    const readChunk = isBuffer\n      ? (position: number, size: number) => input.subarray(position, position + size)\n      : input.readChunk.bind(input);\n\n    const collected: Buffer[] = [];\n    const compressedSize = await ZstdNode.compressChunks(\n      readChunk,\n      totalSize,\n      effectiveBufferSize,\n      level,\n      undefined,\n      async (compressed) => {\n        if (onOutputBuffer) {\n          await onOutputBuffer(compressed);\n        } else {\n          collected.push(compressed);\n        }\n      }\n    );\n\n    if (entry) {\n      entry.compressedSize = compressedSize;\n    }\n\n    if (onOutputBuffer) {\n      return Buffer.alloc(0);\n    }\n    return Buffer.concat(collected);\n  }\n\n  /**\n   * Encrypt compressed data using PKZIP encryption\n   * @param entry - ZIP entry to encrypt\n   * @param compressedData - Compressed data to encrypt\n   * @param password - Password for encryption\n   * @returns Buffer containing encrypted data (includes 12-byte header)\n   */\n  encryptCompressedData(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedData() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n    \n    const zipCrypto = new ZipCrypto();\n    const encryptedData = zipCrypto.encryptBuffer(entry, compressedData, password);\n    \n    this.log(`Encryption complete: ${compressedData.length} bytes compressed -> ${encryptedData.length} bytes encrypted (includes ${ENCRYPT_HDR_SIZE}-byte header)`);\n    \n    return encryptedData;\n  }\n\n  /**\n   * NeoEncrypt: same ciphertext as WinZip AES stream; standard cmpMethod + NEO extra (0x024E).\n   */\n  encryptCompressedDataNeo(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedDataNeo() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n\n    const encryptedData = NeoCrypto.encryptBuffer(entry, compressedData, password);\n\n    entry.neoCryptoPayloadVersion = 1;\n    entry.neoCryptoAlgorithm = NEO_CRYPTO_ALGORITHM_AES256_V1;\n    entry.neoCryptoFlags = 0;\n\n    this.log(`NeoEncrypt encryption complete: ${compressedData.length} bytes -> ${encryptedData.length} bytes`);\n\n    return encryptedData;\n  }\n\n  /**\n   * Encrypt compressed data using WinZip AES-256\n   * Sets compression method to 99, stores real method in entry for the 0x9901 extra field\n   */\n  encryptCompressedDataAes(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedDataAes() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n\n    const encryptedData = AesCrypto.encryptBuffer(entry, compressedData, password);\n\n    // Store the real compression method and switch to method 99\n    entry.realCmpMethod = entry.cmpMethod;\n    entry.cmpMethod = CMP_METHOD.AES_ENCRYPT;\n    entry.aesVersion = 1; // AE-1: CRC is stored\n    entry.aesStrength = 3; // AES-256\n\n    this.log(`AES-256 encryption complete: ${compressedData.length} bytes -> ${encryptedData.length} bytes (salt+verifier+data+hmac)`);\n\n    return encryptedData;\n  }\n\n  /**\n   * Compress file data in memory and return ZIP entry information as Buffer\n   * @param entry - ZIP entry to compress\n   * @param fileData - File data buffer to compress\n   * @param cmpOptions - Compression options\n   * @returns Buffer containing local header + compressed data\n   */\n  async compressFileBuffer(\n    entry: ZipEntry,\n    fileData: Buffer,\n    cmpOptions?: CompressOptions\n  ): Promise<Buffer> {\n    this.log(`compressFileBuffer() called for entry: ${entry.filename}, size: ${fileData.length}`);\n    \n    // Set uncompressed size\n    entry.uncompressedSize = fileData.length;\n    \n    // Initialize hash calculator\n    const hashCalculator = new HashCalculator({ useSHA256: cmpOptions?.useSHA256 || false });\n    hashCalculator.update(fileData);\n    \n    // Set hashes\n    entry.crc = hashCalculator.finalizeCRC32();\n    if (cmpOptions?.useSHA256) {\n      entry.sha256 = hashCalculator.finalizeSHA256();\n      this.log(`SHA-256 calculated: ${entry.sha256}`);\n    }\n    \n    // compressData already handles encryption when password is provided\n    return await this.compressData(entry, fileData, cmpOptions);\n  }\n}\n", "/**\n * Detect legacy NeoZipKit WASM zstd (`@oneidentity/zstd-js`).\n *\n * That codec wrote valid-looking zstd frames but declared Frame_Content_Size as\n * `uncompressed_size + 18`. Standard libzstd / Node zlib decode to the real\n * payload plus 18 trailing zero bytes. CRC of the truncated payload matches\n * the ZIP entry CRC.\n *\n * Header-only checks do not require decompressing. Verified checks decompress\n * with native zlib and confirm trailing zeros + optional CRC.\n */\n\nimport { ZstdNode } from './ZstdNode';\nimport { HashCalculator } from '../core/components/HashCalculator';\n\n/** Fixed extra bytes declared/emitted by the broken WASM codec. */\nexport const LEGACY_WASM_ZSTD_PADDING = 18;\n\nconst ZSTD_MAGIC = Buffer.from([0x28, 0xb5, 0x2f, 0xfd]);\n\nexport type LegacyZstdConfidence = 'none' | 'header' | 'verified';\n\nexport interface LegacyZstdDetectResult {\n  /** True when this looks like (or verifies as) legacy WASM zstd. */\n  isLegacyWasm: boolean;\n  /** How the decision was made. */\n  confidence: LegacyZstdConfidence;\n  /** Parsed Frame_Content_Size, if present in the frame header. */\n  frameContentSize: number | null;\n  /** Expected plaintext size from the ZIP entry (or caller). */\n  expectedUncompressedSize: number;\n  /** Declared/observed padding past expected size (typically 18). */\n  paddingBytes: number;\n  /** Human-readable reason. */\n  reason: string;\n}\n\nexport interface DetectLegacyZstdOptions {\n  /**\n   * When true (default), decompress with native zlib and confirm\n   * trailing zeros (+ optional CRC) instead of trusting the header alone.\n   */\n  verify?: boolean;\n  /** ZIP CRC-32 of the original uncompressed data (strengthens verified check). */\n  crc?: number;\n}\n\n/**\n * Read Frame_Content_Size from a zstd frame header, or null if absent / unparseable.\n * @see https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md\n */\nexport function parseZstdFrameContentSize(compressed: Buffer): number | null {\n  if (!compressed || compressed.length < 6) {\n    return null;\n  }\n  if (\n    compressed[0] !== ZSTD_MAGIC[0] ||\n    compressed[1] !== ZSTD_MAGIC[1] ||\n    compressed[2] !== ZSTD_MAGIC[2] ||\n    compressed[3] !== ZSTD_MAGIC[3]\n  ) {\n    return null;\n  }\n\n  const descriptor = compressed[4];\n  const fcsFlag = (descriptor >> 6) & 0x3;\n  const singleSegment = ((descriptor >> 5) & 0x1) === 1;\n  const dictIdFlag = descriptor & 0x3;\n  const dictIdSizes = [0, 1, 2, 4];\n  let pos = 5 + dictIdSizes[dictIdFlag];\n\n  if (fcsFlag === 0) {\n    if (!singleSegment) {\n      return null;\n    }\n    if (pos >= compressed.length) {\n      return null;\n    }\n    return compressed[pos];\n  }\n\n  const fcsSizes = [0, 2, 4, 8];\n  const n = fcsSizes[fcsFlag];\n  if (pos + n > compressed.length) {\n    return null;\n  }\n\n  let fcs: number;\n  if (n === 2) {\n    fcs = compressed.readUInt16LE(pos);\n  } else if (n === 4) {\n    fcs = compressed.readUInt32LE(pos);\n  } else {\n    const lo = compressed.readUInt32LE(pos);\n    const hi = compressed.readUInt32LE(pos + 4);\n    // Content sizes that do not fit in JS safe integers are not our legacy case.\n    if (hi !== 0) {\n      return null;\n    }\n    fcs = lo;\n  }\n\n  // Spec: when FCS_Flag == 1, stored value is (size - 256).\n  if (fcsFlag === 1) {\n    fcs += 256;\n  }\n  return fcs;\n}\n\n/**\n * Fast header heuristic: FCS === expectedUncompressedSize + 18.\n */\nexport function looksLikeLegacyWasmZstd(\n  compressed: Buffer,\n  expectedUncompressedSize: number\n): boolean {\n  if (expectedUncompressedSize < 0 || !Number.isFinite(expectedUncompressedSize)) {\n    return false;\n  }\n  const fcs = parseZstdFrameContentSize(compressed);\n  if (fcs === null) {\n    return false;\n  }\n  return fcs === expectedUncompressedSize + LEGACY_WASM_ZSTD_PADDING;\n}\n\nfunction crc32Of(data: Buffer): number {\n  const h = new HashCalculator();\n  h.update(data);\n  return h.finalizeCRC32();\n}\n\n/**\n * Detect legacy WASM zstd frames for a single compressed payload.\n */\nexport async function detectLegacyWasmZstd(\n  compressed: Buffer,\n  expectedUncompressedSize: number,\n  options?: DetectLegacyZstdOptions\n): Promise<LegacyZstdDetectResult> {\n  const expected = expectedUncompressedSize >>> 0;\n  const fcs = parseZstdFrameContentSize(compressed);\n  const headerMatch =\n    fcs !== null && fcs === expected + LEGACY_WASM_ZSTD_PADDING;\n\n  const base = {\n    frameContentSize: fcs,\n    expectedUncompressedSize: expected,\n    paddingBytes: LEGACY_WASM_ZSTD_PADDING,\n  };\n\n  if (!headerMatch && options?.verify === false) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason:\n        fcs === null\n          ? 'No Frame_Content_Size in zstd header (or not a zstd frame)'\n          : `Frame_Content_Size ${fcs} does not equal expected ${expected} + ${LEGACY_WASM_ZSTD_PADDING}`,\n    };\n  }\n\n  if (options?.verify === false) {\n    return {\n      ...base,\n      isLegacyWasm: true,\n      confidence: 'header',\n      reason: `Frame_Content_Size is expected+${LEGACY_WASM_ZSTD_PADDING} (legacy WASM heuristic)`,\n    };\n  }\n\n  // Verified path (default): decompress and check padding / CRC.\n  let decoded: Buffer;\n  try {\n    decoded = await ZstdNode.decompress(compressed);\n  } catch (e) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason: `Native decompress failed: ${e instanceof Error ? e.message : String(e)}`,\n    };\n  }\n\n  const pad = decoded.length - expected;\n  const trailingZeros =\n    pad === LEGACY_WASM_ZSTD_PADDING &&\n    decoded.subarray(expected).equals(Buffer.alloc(LEGACY_WASM_ZSTD_PADDING));\n  const truncated = decoded.subarray(0, Math.min(expected, decoded.length));\n  const crcOk =\n    options?.crc === undefined ||\n    options.crc === 0 ||\n    crc32Of(truncated) === (options.crc >>> 0);\n\n  if (trailingZeros && crcOk && decoded.length === expected + LEGACY_WASM_ZSTD_PADDING) {\n    return {\n      ...base,\n      isLegacyWasm: true,\n      confidence: 'verified',\n      reason:\n        options?.crc && options.crc !== 0\n          ? `Decoded length is +${LEGACY_WASM_ZSTD_PADDING} with trailing zeros; truncated CRC matches`\n          : `Decoded length is +${LEGACY_WASM_ZSTD_PADDING} with trailing zeros`,\n    };\n  }\n\n  if (headerMatch && !trailingZeros) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason:\n        'Header suggested legacy WASM but decoded payload did not have 18 trailing zeros',\n    };\n  }\n\n  return {\n    ...base,\n    isLegacyWasm: false,\n    confidence: 'none',\n    paddingBytes: Math.max(0, pad),\n    reason:\n      decoded.length === expected\n        ? 'Standard zstd frame (decoded size matches expected)'\n        : `Decoded size ${decoded.length} does not match legacy pattern (expected ${expected} or ${expected + LEGACY_WASM_ZSTD_PADDING})`,\n  };\n}\n\n/**\n * Truncate plaintext if it matches the legacy +18 zero padding pattern.\n * Returns the original buffer when not legacy-shaped.\n */\nexport function repairLegacyWasmZstdPlaintext(\n  decoded: Buffer,\n  expectedUncompressedSize: number,\n  crc?: number\n): { repaired: Buffer; wasLegacy: boolean } {\n  const expected = expectedUncompressedSize >>> 0;\n  if (\n    decoded.length === expected + LEGACY_WASM_ZSTD_PADDING &&\n    decoded.subarray(expected).equals(Buffer.alloc(LEGACY_WASM_ZSTD_PADDING))\n  ) {\n    const repaired = decoded.subarray(0, expected);\n    if (crc !== undefined && crc !== 0) {\n      if (crc32Of(repaired) !== (crc >>> 0)) {\n        return { repaired: decoded, wasLegacy: false };\n      }\n    }\n    return { repaired, wasLegacy: true };\n  }\n  if (decoded.length > expected && expected > 0) {\n    // Match Rust extract behavior: bound to declared uncompressed size for zstd.\n    const repaired = decoded.subarray(0, expected);\n    if (crc !== undefined && crc !== 0 && crc32Of(repaired) === (crc >>> 0)) {\n      return { repaired, wasLegacy: true };\n    }\n  }\n  return { repaired: decoded, wasLegacy: false };\n}\n\nexport const LegacyZstd = {\n  LEGACY_WASM_ZSTD_PADDING,\n  parseZstdFrameContentSize,\n  looksLikeLegacyWasmZstd,\n  detectLegacyWasmZstd,\n  repairLegacyWasmZstdPlaintext,\n};\n\nexport default LegacyZstd;\n", "// ======================================\n//\tZipDecompress.ts - Decompression Module\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// LOGGING INSTRUCTIONS:\n// ---------------------\n// To enable/disable logging, set loggingEnabled to true/false in the class:\n//   private static loggingEnabled: boolean = true;  // Enable logging\n//   private static loggingEnabled: boolean = false; // Disable logging\n//\n// Logging respects the global Logger level (debug, info, warn, error, silent).\n// Logger level is automatically set to 'debug' when loggingEnabled is true.\n//\n\nconst pako = require('pako');\nimport { ZstdNode } from '../node/ZstdNode';\nimport { repairLegacyWasmZstdPlaintext } from '../node/LegacyZstd';\nimport Zipkit from './Zipkit';\nimport { Logger } from './components/Logger';\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { CMP_METHOD } from './constants/Headers';\nimport { ZipCrypto } from './encryption/ZipCrypto';\nimport { AesCrypto } from './encryption/AesCrypto';\n\nexport interface DecompressionResult {\n  success: boolean;\n  data?: Buffer;\n  error?: string;\n}\n\nexport interface DecompressionOptions {\n  method: number; // Compression method code (0=stored, 8=deflate, 93=zstd)\n  debug?: boolean; // Enable debug logging\n}\n\n/**\n * ZipDecompress - Unified Decompression Module (Internal to Zipkit)\n * Consolidates decompression functionality from ZipCompress\n * Supports deflate, zstd, and stored compression methods with chunked processing\n * \n * This class is internal to Zipkit and should not be used directly.\n * Use Zipkit methods instead.\n */\nclass ZipDecompress {\n  private zipkit: Zipkit;\n  private debug: boolean;\n\n  // Class-level logging control - set to true to enable logging\n  private static loggingEnabled: boolean = false;\n\n  /**\n   * Internal logging method - only logs if class logging is enabled\n   */\n  private log(...args: any[]): void {\n    if (ZipDecompress.loggingEnabled) {\n      Logger.debug(`[ZipDecompress]`, ...args);\n    }\n  }\n\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n    // Debug disabled by default\n    this.debug = false;\n    // If logging is enabled, ensure Logger level is set to debug\n    if (ZipDecompress.loggingEnabled) {\n      Logger.setLevel('debug');\n    }\n  }\n\n  /**\n   * Extract file data (Buffer-based ZIP only)\n   * Public method that validates buffer mode and extracts entry\n   * \n   * @param entry ZIP entry to extract\n   * @param skipHashCheck Skip hash verification (CRC-32 or SHA-256)\n   * @returns Promise resolving to extracted data as Buffer, or null if failed\n   * @throws Error if not a Buffer-based ZIP\n   */\n  async extract(entry: ZipEntry, skipHashCheck?: boolean): Promise<Buffer | null> {\n    if (!this.zipkit.hasInBuffer()) {\n      throw new Error('extract() requires Buffer-based ZIP. Use ZipkitNode.extractToFile() for file-based ZIP or call loadZip() first.');\n    }\n    \n    this.log(`extract() called for entry: ${entry.filename}, method: ${entry.cmpMethod}, skipHashCheck: ${skipHashCheck}`);\n    \n    const buffer = this.zipkit.ensureBuffer();\n    \n    // Decrypt if needed using password on zipkit instance\n    let fdata = this.zipkit.parseLocalHeader(entry, buffer);\n    const password = (this.zipkit as any)?.password;\n    const isAes = entry.aesVersion > 0 || entry.cmpMethod === CMP_METHOD.AES_ENCRYPT;\n    const isNeo = entry.neoCryptoAlgorithm > 0;\n    \n    if ((entry as any).isEncrypted && password) {\n      this.log(`Starting in-memory decryption for entry: ${entry.filename} (${isAes || isNeo ? 'AES-256 stream (WinZip or Neo)' : 'ZipCrypto'})`);\n\n      if (isAes || isNeo) {\n        fdata = AesCrypto.decryptBuffer(entry, fdata, password);\n      } else {\n        const zipCrypto = new ZipCrypto();\n        fdata = zipCrypto.decryptBuffer(entry, buffer, fdata, password);\n      }\n      \n      this.log(`Decryption successful, decrypted compressed data length: ${fdata.length}`);\n    }\n\n    if (fdata.length === 0) {\n      return null;\n    }\n\n    // For WinZip AES method 99, use realCmpMethod; NeoEncrypt already uses standard cmpMethod in header\n    // For AE-2 (aesVersion=2), skip CRC check since CRC is stored as 0\n    const skipHash = isAes && entry.aesVersion === 2 ? true : skipHashCheck;\n    return this.unCompress(fdata, entry, skipHash);\n  }\n\n\n\n  /**\n   * Inflate data using pako (internal use only)\n   */\n  private inflate(data: Buffer): Buffer {\n    this.log(`inflate() called with ${data.length} bytes`);\n    const result = pako.inflateRaw(data);\n    return Buffer.from(result.buffer, result.byteOffset, result.byteLength);\n  }\n\n\n  /**\n   * Zstd decompress via Node native zlib, repairing legacy WASM +18 padding when present.\n   */\n  private async zstdDecompressSync(data: Buffer, entry?: ZipEntry): Promise<Buffer> {\n    this.log(`zstdDecompressSync() called with ${data.length} bytes`);\n\n    try {\n      let decompressed = await ZstdNode.decompress(data);\n      if (entry && entry.uncompressedSize > 0) {\n        const { repaired, wasLegacy } = repairLegacyWasmZstdPlaintext(\n          decompressed,\n          entry.uncompressedSize,\n          entry.crc\n        );\n        if (wasLegacy) {\n          this.log(\n            `Legacy WASM zstd padding repaired: ${decompressed.length} -> ${repaired.length} bytes`\n          );\n        }\n        decompressed = repaired;\n      }\n      this.log(`ZSTD decompression successful: ${data.length} bytes -> ${decompressed.length} bytes`);\n      return decompressed;\n    } catch (error) {\n      this.log(`ZSTD decompression failed: ${error}`);\n      throw new Error(`ZSTD decompression failed: ${error instanceof Error ? error.message : String(error)}`);\n    }\n  }\n\n  /**\n   * Uncompress compressed data buffer (synchronous for in-memory mode)\n   * Handles decompression and hash verification\n   * Internal method only\n   */\n  private async unCompress(\n    compressedData: Buffer,\n    entry: ZipEntry,\n    skipHashCheck?: boolean\n  ): Promise<Buffer> {\n    // For AES entries (method 99), use the real compression method\n    const method = entry.cmpMethod === CMP_METHOD.AES_ENCRYPT && entry.realCmpMethod >= 0\n      ? entry.realCmpMethod\n      : entry.cmpMethod;\n\n    this.log(`unCompress() called for entry: ${entry.filename}, method: ${method}, data length: ${compressedData.length}`);\n    \n    if (compressedData.length === 0) {\n      return Buffer.alloc(0);\n    }\n\n    let outBuf: Buffer;\n    if (method === CMP_METHOD.STORED) {\n      outBuf = compressedData;\n    } else if (method === CMP_METHOD.DEFLATED) {\n      outBuf = this.inflate(compressedData);\n    } else if (method === CMP_METHOD.ZSTD) {\n      outBuf = await this.zstdDecompressSync(compressedData, entry);\n    } else {\n      throw new Error(`Unsupported compression method: ${method}`);\n    }\n\n    // Verify hash\n    if (!skipHashCheck) {\n      if (entry.sha256) {\n        const isValid = this.zipkit.testSHA256(entry, outBuf);\n        if (!isValid) {\n          throw new Error(Errors.INVALID_SHA256);\n        }\n      } else {\n        const isValid = this.zipkit.testCRC32(entry, outBuf);\n        if (!isValid) {\n          throw new Error(Errors.INVALID_CRC);\n        }\n      }\n    }\n\n    return outBuf;\n  }\n\n}\n\n// Default export for internal use by Zipkit only\nexport default ZipDecompress;\n", "// ======================================\n//\tZipkit.ts - Enhanced Zipkit with Dual Mode Support\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { Logger } from './components/Logger';\nimport { NEOZIPKIT_INFO } from '../types';\nimport { ZipCompress, CompressOptions } from './ZipCompress';\nimport ZipDecompress from './ZipDecompress';\nimport { sha256, crc32 } from './encryption/ZipCrypto';\nimport HashCalculator from './components/HashCalculator';\nimport { \n  LOCAL_HDR,\n  ENCRYPT_HDR_SIZE,\n  CMP_METHOD,\n  CENTRAL_END, \n  CENTRAL_DIR, \n  ZIP64_CENTRAL_END, \n  ZIP64_CENTRAL_DIR ,\n  GP_FLAG,\n  TIMESTAMP_SUBMITTED,\n  TIMESTAMP_METADATA,\n  TOKENIZED_METADATA,\n  LOCAL_FILE_HEADER,\n  CENTRAL_FILE_HEADER,\n  CENTRAL_DIRECTORY_END,\n  HDR_ID\n} from './constants/Headers';\n\n/**\n * Streaming file handle interface\n * Used for file-based ZIP operations in server environments\n */\nexport interface StreamingFileHandle {\n  read(buffer: Buffer, offset: number, length: number, position: number): Promise<number>;\n  stat(): Promise<{ size: number }>;\n  close(): Promise<void>;\n}\n\n// Re-export interfaces and constants (keep exports grouped at top)\nexport { \n  ZipEntry, \n  Errors, \n  CMP_METHOD, \n  TIMESTAMP_METADATA, \n  TIMESTAMP_SUBMITTED,\n  TOKENIZED_METADATA,\n  LOCAL_HDR,\n  ENCRYPT_HDR_SIZE,\n  CENTRAL_END, \n  CENTRAL_DIR, \n  ZIP64_CENTRAL_END, \n  ZIP64_CENTRAL_DIR,\n  GP_FLAG,\n  LOCAL_FILE_HEADER,\n  CENTRAL_FILE_HEADER,\n  CENTRAL_DIRECTORY_END,\n  HDR_ID\n};\nexport type { CompressOptions, CreateZipOptions } from './ZipCompress';\n\n/**\n * Configuration options for Zipkit instances\n * \n * Controls various aspects of ZIP file processing including memory usage,\n * chunk sizes for streaming operations, and debug logging.\n * \n * @interface ZipkitConfig\n * @property {number} [bufferSize] - Buffer size in bytes for streaming operations.\n *                                  Files larger than this size will be processed\n *                                  in chunks for memory efficiency. Default: 512KB (524288 bytes).\n * @property {boolean} [debug] - Enable debug logging for detailed diagnostic information.\n *                              When enabled, sets Logger level to 'debug'. Default: false.\n * \n * @example\n * const zip = new Zipkit({\n *   bufferSize: 512 * 1024,    // 512KB buffer\n *   debug: true\n * });\n */\nexport interface ZipkitConfig {\n  bufferSize?: number;         // For streaming mode (default: 512KB)\n  debug?: boolean;           // Enable debug logging\n}\n\n/**\n * Zipkit - Enhanced ZIP File Processing Library with Dual Mode Support\n * \n * Core ZIP file processing library supporting both buffer-based (in-memory) and\n * file-based (streaming) modes. See README.md for detailed documentation.\n * \n * @class Zipkit\n * @static {string} version - Library version string\n * @static {string} releaseDate - Library release date\n */\nexport default class Zipkit {\n  static readonly version = NEOZIPKIT_INFO.version;\n  static readonly releaseDate = NEOZIPKIT_INFO.releaseDate;\n\n  // Configuration\n  private config: ZipkitConfig;\n  \n  // In-memory mode data\n  private inBuffer: Buffer | null = null;\n  protected zipEntries: ZipEntry[] = []; // Protected: single source of truth for ZIP entry order (accessible by subclasses)\n  private centralDirSize: number = 0;\n  private centralDirOffset: number = 0;\n  \n  // Common data\n  private zipComment: string | null = null;\n  \n  // Private components (lazy-loaded)\n  private _zipkitCmp: ZipCompress | null = null;\n  private _zipkitDeCmp: ZipDecompress | null = null;\n\n  /**\n   * Creates a new Zipkit instance with optional configuration\n   * \n   * @param config - Optional configuration object (ZipkitConfig)\n   *   - bufferSize: Buffer size for streaming operations (default: 512KB)\n   *   - debug: Enable debug logging (default: false)\n   * \n   * @example\n   * const zip = new Zipkit({ bufferSize: 512 * 1024, debug: true });\n   */\n  constructor(config: ZipkitConfig = {}) {\n    this.config = {\n      bufferSize: config.bufferSize || 512 * 1024, // 512KB default (optimal for modern systems)\n      debug: config.debug || false // Default false\n    };\n\n    // Configure Logger based on debug setting\n    if (this.config.debug) {\n      Logger.setLevel('debug');\n    }\n    \n    // Note: ZipCompress and ZipDecompress are lazy-loaded when first accessed\n    // ZSTD codec is also lazily initialized on first use (module-level singleton)\n  }\n\n  /**\n   * Lazy-load ZipCompress instance\n   * @returns ZipCompress instance (created on first access)\n   */\n  private getZipCompress(): ZipCompress {\n    if (!this._zipkitCmp) {\n      this._zipkitCmp = new ZipCompress(this);\n    }\n    return this._zipkitCmp;\n  }\n\n  /**\n   * Lazy-load ZipDecompress instance\n   * @returns ZipDecompress instance (created on first access)\n   */\n  private getZipDecompress(): ZipDecompress {\n    if (!this._zipkitDeCmp) {\n      this._zipkitDeCmp = new ZipDecompress(this);\n    }\n    return this._zipkitDeCmp;\n  }\n\n  /**\n   * Get the configured buffer size for streaming operations\n   * @returns Buffer size in bytes (default: 512KB)\n   */\n  getBufferSize(): number {\n    return this.config.bufferSize || 512 * 1024; // 512KB default (optimal for modern systems)\n  }\n\n  /**\n   * Check if ZIP is loaded in buffer mode\n   * @returns true if buffer-based ZIP is loaded\n   */\n  hasInBuffer(): boolean {\n    return this.inBuffer !== null && this.inBuffer.length > 0;\n  }\n\n\n  // ============================================================================\n  // ZipCompress Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Compress data for a ZIP entry (Buffer-based only)\n   * Wrapper for ZipCompress.compressData()\n   * \n   * @param entry - ZIP entry to compress\n   * @param data - Buffer containing data to compress\n   * @param options - Compression options\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async compressData(\n    entry: ZipEntry,\n    data: Buffer,\n    options?: CompressOptions,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().compressData(entry, data, options, onOutputBuffer);\n  }\n\n  /**\n   * Compress data using deflate algorithm with chunked processing\n   * Wrapper for ZipCompress.deflateCompress()\n   * \n   * @param data - Data to compress (Buffer or chunked reader)\n   * @param options - Compression options\n   * @param bufferSize - Size of buffer to read (default: 512KB)\n   * @param entry - Optional ZIP entry for hash calculation\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async deflateCompress(\n    data: Buffer | { totalSize: number, onReadChunk: (position: number, size: number) => Buffer, onOutChunk: (chunk: Buffer) => void },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().deflateCompress(data, options, bufferSize, entry, onOutputBuffer);\n  }\n\n  /**\n   * Compress data using deflate algorithm (synchronous, small buffers only)\n   * Wrapper for ZipCompress.deflate()\n   * \n   * @param inbuf - Buffer containing data to compress\n   * @param options - Compression options\n   * @returns Buffer containing compressed data\n   */\n  deflate(inbuf: Buffer, options?: CompressOptions): Buffer {\n    return this.getZipCompress().deflate(inbuf, options);\n  }\n\n  /**\n   * Compress data using Zstandard (zstd) algorithm\n   * Wrapper for ZipCompress.zstdCompress()\n   * \n   * Note: ZSTD codec is lazily initialized on first use (module-level singleton).\n   * Initialization happens automatically when needed.\n   * \n   * @param input - Buffer to compress OR chunked reader object\n   * @param options - Compression options\n   * @param bufferSize - Size of buffer to read if using chunked reader (default: 512KB)\n   * @param entry - Optional ZIP entry for hash calculation\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async zstdCompress(\n    input: Buffer | { totalSize: number, readChunk: (position: number, size: number) => Buffer },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().zstdCompress(input, options, bufferSize, entry, onOutputBuffer);\n  }\n\n  /**\n   * Compress file data in memory and return ZIP entry information as Buffer\n   * Wrapper for ZipCompress.compressFileBuffer()\n   * \n   * @param entry - ZIP entry to compress\n   * @param fileData - File data buffer to compress\n   * @param cmpOptions - Compression options\n   * @returns Promise resolving to Buffer containing local header + compressed data\n   */\n  async compressFileBuffer(\n    entry: ZipEntry,\n    fileData: Buffer,\n    cmpOptions?: CompressOptions\n  ): Promise<Buffer> {\n    return this.getZipCompress().compressFileBuffer(entry, fileData, cmpOptions);\n  }\n\n  // ============================================================================\n  // ZipDecompress Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Extract file data (Buffer-based ZIP only)\n   * Wrapper for ZipDecompress.extract()\n   * \n   * @param entry - ZIP entry to extract\n   * @param skipHashCheck - Skip hash verification (CRC-32 or SHA-256)\n   * @returns Promise resolving to Buffer containing extracted data, or null if failed\n   * @throws Error if not a Buffer-based ZIP\n   */\n  async extract(entry: ZipEntry, skipHashCheck?: boolean): Promise<Buffer | null> {\n    return this.getZipDecompress().extract(entry, skipHashCheck);\n  }\n\n\n  // ============================================================================\n  // Static Logging Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Note: Logging for ZipCompress and ZipDecompress is controlled by their\n   * static loggingEnabled property. Set it directly:\n   *   ZipCompress.loggingEnabled = true/false;\n   *   ZipDecompress.loggingEnabled = true/false;\n   */\n\n  /**\n   * Load ZIP file from buffer (in-memory mode)\n   * \n   * **Required**: You must call this method (or the appropriate load method for your platform)\n   * before calling `getDirectory()` or any other ZIP operations. This method:\n   * 1. Resets all ZIP data\n   * 2. Stores the buffer in this.inBuffer\n   * 3. Loads EOCD and parses central directory\n   * 4. Populates this.zipEntries[] array\n   * \n   * For browser applications, use `ZipkitBrowser.loadZipBlob()` instead.\n   * For server applications with file paths, use `ZipkitServer.loadZipFile()` instead.\n   * \n   * @param inBuf - Buffer containing the complete ZIP file data\n   * @returns ZipEntry[] Array of all entries in the ZIP file\n   */\n  loadZip(inBuf: Buffer): ZipEntry[] {\n    this.resetZipData();\n    // Store buffer for backward compatibility with detection logic\n    this.inBuffer = inBuf;\n    // Load EOCD and parse central directory\n    this.loadEOCDFromBuffer(inBuf);\n    const entries = this.getDirectoryFromBuffer();\n    this.zipEntries = entries;\n    return entries;\n  }\n\n\n  /**\n   * Reset all ZIP-related data to initial state\n   * \n   * Clears all internal state including zipEntries[], inBuffer, and zipComment.\n   * \n   * Note: ZipCompress and ZipDecompress instances are not recreated.\n   * ZSTD codec is a module-level singleton and is lazily initialized on first use,\n   * so no cleanup is needed. No memory buffers are allocated until compression/decompression\n   * operations are performed.\n   */\n  private resetZipData(): void {\n    this.inBuffer = null;\n    this.zipEntries = [];\n    this.reset();\n    this.zipComment = null;\n    // Reset lazy-loaded components so they can be recreated on next access\n    this._zipkitCmp = null;\n    this._zipkitDeCmp = null;\n    // Note: ZSTD codec is module-level singleton, so no cleanup needed\n  }\n\n  /**\n   * Get central directory entries (synchronous, buffer-based only)\n   * \n   * Returns entries from zipEntries[] array which serves as unified storage.\n   * \n   * **Important**: This method does NOT load the ZIP file. You must call `loadZip()` first\n   * to populate zipEntries[]. If the ZIP is not loaded, this method returns an empty array.\n   * \n   * @param debug - Optional debug flag for logging\n   * @returns Array of ZipEntry objects, or empty array if ZIP not loaded\n   */\n  getDirectory(debug?: boolean): ZipEntry[] {\n    return this.zipEntries;\n  }\n\n\n  /**\n   * Get specific ZIP entry by filename from zipEntries[] array\n   * \n   * @param filename - The name/path of the file/directory to find\n   * @returns ZipEntry object if found, null if not found\n   */\n  getZipEntry(filename: string): ZipEntry | null {\n    try {\n      const centralDir = this.getDirectory();\n      return centralDir.find((entry: ZipEntry) => entry.filename === filename) || null;\n    } catch (error) {\n      return null;\n    }\n  }\n\n  /**\n   * Ensure buffer is available (in-memory mode)\n   */\n  public ensureBuffer(): Buffer {\n    if (!this.inBuffer) {\n      this.inBuffer = Buffer.alloc(0);\n    }\n    return this.inBuffer;\n  }\n\n  /**\n   * Parse local header (in-memory mode)\n   */\n  public parseLocalHeader(entry: ZipEntry, buffer: Buffer): Buffer {\n    const localData = buffer.subarray(entry.localHdrOffset);\n    \n    if (localData.readUInt32LE(0) !== LOCAL_HDR.SIGNATURE) {\n      throw new Error(Errors.INVALID_CEN);\n    }\n    \n    const _bitFlags = localData.readUInt16LE(LOCAL_HDR.FLAGS);\n    let _fnameLen = localData.readUInt16LE(LOCAL_HDR.FNAME_LEN);\n    let _extraLen = localData.readUInt16LE(LOCAL_HDR.EXTRA_LEN);\n    let _localSize = LOCAL_HDR.SIZE + _fnameLen + _extraLen;\n\n    const isAes = entry.aesVersion > 0 || entry.cmpMethod === CMP_METHOD.AES_ENCRYPT;\n    const isNeo = entry.neoCryptoAlgorithm > 0;\n\n    if (isAes || isNeo) {\n      // AES: compressedSize includes salt + verifier + encrypted + hmac\n      // Return the full payload; AesCrypto.decryptBuffer() handles parsing\n      const dataStart = _localSize;\n      const dataEnd = _localSize + entry.compressedSize;\n      return localData.subarray(dataStart, dataEnd);\n    }\n\n    // ZipCrypto: skip the 12-byte encryption header\n    let _encryptLen = 0;\n    if (_bitFlags & GP_FLAG.ENCRYPTED) {\n      _encryptLen = ENCRYPT_HDR_SIZE;\n    }\n\n    const dataStart = _localSize + _encryptLen;\n    const dataEnd = _localSize + entry.compressedSize;\n    return localData.subarray(dataStart, dataEnd);\n  }\n\n  /**\n   * Test CRC32 checksum\n   * Always checks CRC against entry.crc from central directory\n   * For DATA_DESC files, CRC is stored in central directory, not local header\n   */\n  public testCRC32(entry: ZipEntry, data: Buffer): boolean {\n    // Always check CRC against entry.crc from central directory\n    // For DATA_DESC files, CRC is stored in central directory, not local header\n      const _crc = crc32(data);\n    const isValid = _crc === entry.crc;\n    Logger.debug(`[DEBUG] testCRC32() comparison: calculated=${_crc}, stored=${entry.crc}, isValid=${isValid ? '\u2713' : '\u2717'}, DATA_DESC=${(entry.bitFlags & 0x8) !== 0 ? 'YES' : 'NO'}`);\n    return isValid;\n  }\n\n  /**\n   * Test SHA256 hash\n   */\n  public testSHA256(entry: ZipEntry, data: Buffer): boolean {\n    if (!entry.sha256) {\n      throw new Error(Errors.UNKNOWN_SHA256);\n    }\n    const _sha256 = sha256(data);\n    const isValid = _sha256 === entry.sha256;\n    Logger.debug(`[DEBUG] testSHA256() comparison: calculated=${_sha256}, stored=${entry.sha256}, isValid=${isValid ? '\u2713' : '\u2717'}`);\n    return isValid;\n  }\n\n  /**\n   * Get memory usage statistics\n   * \n   * @returns Object containing backend type, total memory usage in bytes, and entry count\n   */\n  getMemoryUsage(): { backend: 'buffer' | 'file' | 'none'; memoryUsage: number; entries: number } {\n    const baseMemory = this.inBuffer?.length || 0;\n    const entriesMemory = this.zipEntries.length * 1024; // Approximate memory per entry\n    \n    let backend: 'buffer' | 'file' | 'none';\n    if (this.inBuffer) {\n      backend = 'buffer';\n    } else {\n      // Zipkit is buffer-based only, so if no buffer, backend is 'none'\n      // For file-based operations, use ZipkitServer\n      backend = 'none';\n    }\n    \n    return {\n      backend,\n      memoryUsage: baseMemory + entriesMemory,\n      entries: this.zipEntries.length\n    };\n  }\n\n  /**\n   * Create a new ZIP entry and automatically add it to zipEntries[]\n   * \n   * @param filename - Entry filename\n   * @param data - Optional entry data (for CRC calculation)\n   * @param options - Optional entry options\n   * @returns Created ZipEntry instance\n   */\n  createZipEntry(filename: string, data?: Buffer, options?: any): ZipEntry {\n    const entry = new ZipEntry(filename, null, false);\n    // Set basic properties\n    if (data) {\n      entry.crc = crc32(data);\n      entry.uncompressedSize = data.length;\n      entry.compressedSize = data.length;\n    } else {\n      entry.crc = 0;\n      entry.uncompressedSize = 0;\n      entry.compressedSize = 0;\n    }\n    entry.cmpMethod = CMP_METHOD.STORED;\n    entry.bitFlags = 0;\n    // Note: lastModTime and lastModDate properties may not exist in ZipEntry\n    // entry.lastModTime = Math.floor(Date.now() / 1000);\n    // entry.lastModDate = Math.floor(Date.now() / 1000);\n    \n    // Automatically add entry to zipEntries[] (maintains order as single source of truth)\n    this.zipEntries.push(entry);\n    \n    return entry;\n  }\n\n  /**\n   * Copy entry from another ZIP (buffer-based only)\n   * For file-based ZIP operations, use ZipkitServer.copyEntry()\n   */\n  async copyEntry(sourceEntry: ZipEntry): Promise<Buffer> {\n    // For Buffer-based ZIP, we need to reconstruct the entry data\n    // This is a simplified version - in practice, you'd need to read from the original ZIP\n    if (sourceEntry.cmpData) {\n      const localHdr = sourceEntry.createLocalHdr();\n      return Buffer.concat([localHdr, sourceEntry.cmpData]);\n    }\n    \n    throw new Error('Cannot copy entry: no compressed data available');\n  }\n\n  /**\n   * Central end header getter (for compatibility)\n   * \n   * Returns a function that creates the central end header using totalEntries from zipEntries[].\n   * \n   * @returns Function that creates central end header buffer\n   */\n  get centralEndHdr(): (centralDirSize: number, centralDirOffset: number) => Buffer {\n    // Return a function that calls centralEndHdr with totalEntries from zipEntries[]\n    return (centralDirSize: number, centralDirOffset: number) => {\n      const totalEntries = this.zipEntries.length;\n      return this.centralEndHdrMethod(centralDirSize, centralDirOffset, totalEntries);\n    };\n  }\n\n  /**\n   * Get ZIP comment\n   * \n   * @returns ZIP file comment string or null\n   */\n  getZipComment(): string | null {\n    return this.zipComment;\n  }\n\n  // ============================================================================\n  // Buffer-based ZIP Loading Methods (merged from ZipLoadEntries)\n  // ============================================================================\n\n  /**\n   * Load EOCD from in-memory buffer (buffer mode)\n   */\n  private loadEOCDFromBuffer(buffer: Buffer): void {\n    const fileSize = buffer.length;\n    const searchSize = Math.min(0xFFFF + 22, fileSize);\n    const searchStart = fileSize - searchSize;\n    const scan = buffer.subarray(searchStart, searchStart + searchSize);\n\n    // Find EOCD signature\n    let eocdOffset = -1;\n    for (let i = scan.length - 22; i >= 0; i--) {\n      if (scan[i] === 0x50) {\n        if (scan.readUInt32LE(i) === CENTRAL_END.SIGNATURE) {\n          eocdOffset = searchStart + i;\n          break;\n        }\n      }\n    }\n    if (eocdOffset === -1) {\n      throw new Error(Errors.INVALID_FORMAT);\n    }\n\n    const eocdBuffer = buffer.subarray(eocdOffset, eocdOffset + 22);\n    if (eocdBuffer.readUInt32LE(0) === CENTRAL_END.SIGNATURE) {\n      this.centralDirSize = eocdBuffer.readUInt32LE(CENTRAL_END.CENTRAL_DIR_SIZE);\n      this.centralDirOffset = eocdBuffer.readUInt32LE(CENTRAL_END.CENTRAL_DIR_OFFSET);\n\n      if (this.centralDirOffset === 0xFFFFFFFF) {\n        // ZIP64: locate locator (20 bytes before EOCD) and then ZIP64 EOCD (56 bytes)\n        const locatorOffset = eocdOffset - 20;\n        const locatorBuffer = buffer.subarray(locatorOffset, locatorOffset + 20);\n        if (locatorBuffer.readUInt32LE(0) === ZIP64_CENTRAL_END.SIGNATURE) {\n          const zip64Offset = Number(locatorBuffer.readBigUInt64LE(8));\n          const zip64Buffer = buffer.subarray(zip64Offset, zip64Offset + 56);\n          this.centralDirSize = Number(zip64Buffer.readBigUInt64LE(ZIP64_CENTRAL_DIR.CENTRAL_DIR_SIZE));\n          this.centralDirOffset = Number(zip64Buffer.readBigUInt64LE(ZIP64_CENTRAL_DIR.CENTRAL_DIR_OFFSET));\n        }\n      }\n    } else {\n      throw new Error(Errors.INVALID_FORMAT);\n    }\n\n    // ZIP comment\n    const commentLength = eocdBuffer.readUInt16LE(CENTRAL_END.ZIP_COMMENT_LEN);\n    if (commentLength > 0) {\n      const commentStart = eocdOffset + 22;\n      this.zipComment = buffer.subarray(commentStart, commentStart + commentLength).toString();\n    }\n  }\n\n  /**\n   * Get directory from buffer (buffer mode only)\n   * Note: zipEntries[] in Zipkit is the single source of truth for caching.\n   * This method always parses fresh from the buffer.\n   */\n  private getDirectoryFromBuffer(): ZipEntry[] {\n    if (!this.inBuffer) {\n      return [];\n    }\n\n    const buffer = this.inBuffer;\n    const entries: ZipEntry[] = [];\n    let offset = this.centralDirOffset;\n    let remaining = this.centralDirSize;\n    const bufferSize = this.config.bufferSize || 512 * 1024;\n\n    while (remaining > 0) {\n      const currentBufferSize = Math.min(bufferSize, remaining);\n      const chunk = buffer.subarray(offset, offset + currentBufferSize);\n\n      // Parse entries from chunk\n      let chunkOffset = 0;\n      while (chunkOffset < chunk.length) {\n        if (chunk.readUInt32LE(chunkOffset) !== CENTRAL_DIR.SIGNATURE) {\n          break; // End of central directory\n        }\n\n        // Parse central directory entry\n        const entry = new ZipEntry(null, null, false);\n        const entryData = chunk.subarray(chunkOffset);\n        const remainingData = entry.readZipEntry(entryData);\n\n        entries.push(entry);\n\n        // Move to next entry\n        chunkOffset += (entryData.length - remainingData.length);\n      }\n\n      offset += currentBufferSize;\n      remaining -= currentBufferSize;\n    }\n\n    // Return entries in original order (do NOT sort by default)\n    // Central directory order should match data section order\n    // Note: zipEntries[] in Zipkit is the single source of truth for caching\n    return entries;\n  }\n\n  /**\n   * Reset internal state (private method for Zipkit to call)\n   * Clears all ZIP-related data while keeping the instance alive\n   */\n  private reset(): void {\n    this.centralDirSize = 0;\n    this.centralDirOffset = 0;\n  }\n\n  /**\n   * Create central end header\n   * Note: totalEntries must be passed as parameter since zipEntries[] in Zipkit is the cache\n   */\n  private centralEndHdrMethod(centralDirSize: number, centralDirOffset: number, totalEntries: number): Buffer {\n    const ceBuf = Buffer.alloc(CENTRAL_END.SIZE);\n    ceBuf.writeUInt32LE(CENTRAL_END.SIGNATURE, 0);\n    ceBuf.writeUInt16LE(0, 4); // Number of this disk\n    ceBuf.writeUInt16LE(0, 6); // Number of the disk with the start of the central directory\n    ceBuf.writeUInt16LE(totalEntries, 8); // Total number of entries\n    ceBuf.writeUInt16LE(totalEntries, 10); // Total number of entries on this disk\n    ceBuf.writeUInt32LE(centralDirSize, 12); // Size of central directory\n    ceBuf.writeUInt32LE(centralDirOffset, 16); // Offset of start of central directory\n    ceBuf.writeUInt16LE(0, 20); // ZIP file comment length\n    \n    return ceBuf;\n  }\n\n  /**\n   * Calculate Merkle Root of the ZIP file\n   * \n   * Excludes metadata files (META-INF) to ensure consistent calculation.\n   * Simply calls getDirectory() and returns null if empty.\n   * \n   * @returns Merkle root string or null if calculation fails\n   */\n  getMerkleRoot(): string | null {\n    // Simply get directory - no loading logic\n    let zipEntries: ZipEntry[];\n    try {\n      zipEntries = this.getDirectory();\n    } catch (error) {\n      // Catch any errors from getDirectory() - this should never happen\n      // but if it does, log it and return null\n      Logger.error(`getMerkleRoot(): Error calling getDirectory(): ${error instanceof Error ? error.message : String(error)}`);\n      Logger.error(`getMerkleRoot(): Stack trace: ${error instanceof Error ? error.stack : 'No stack trace'}`);\n      return null;\n    }\n    \n    if (!zipEntries || zipEntries.length === 0) {\n      return null;\n    }\n  \n    const hashAccumulator = new HashCalculator({ enableAccumulation: true });\n    \n    // Filter out metadata files (META-INF) to ensure consistent Merkle Root calculation\n    // Inline check to avoid conflict with ZipkitBrowser's isMetadataFile() method\n    const contentEntries = zipEntries.filter(entry => {\n      const filename = entry.filename || '';\n      return filename !== TIMESTAMP_SUBMITTED &&\n             filename !== TIMESTAMP_METADATA &&\n             filename !== TOKENIZED_METADATA;\n    });\n    \n    for (const entry of contentEntries) {\n      if (entry.sha256) {\n        // Convert hex string to Buffer\n        const hashBuffer = Buffer.from(entry.sha256, 'hex');\n        hashAccumulator.addHash(hashBuffer);\n      }\n    }\n    \n    const merkleRoot = hashAccumulator.merkleRoot();\n    if (!merkleRoot) {\n      return null;\n    }\n\n    return merkleRoot;\n  }\n\n  /**\n   * Calculate Merkle Root of the ZIP file asynchronously\n   * \n   * Excludes metadata files (META-INF) to ensure consistent calculation.\n   * Works with both buffer-based and file-based ZIPs.\n   * \n   * @returns Promise resolving to Merkle root string or null if calculation fails\n   */\n  async getMerkleRootAsync(): Promise<string | null> {\n    let zipEntries: ZipEntry[] = [];\n    \n    try {\n      // Get entries based on ZIP type\n      if (this.inBuffer) {\n        zipEntries = this.getDirectory();\n      } else {\n        // File-based: cannot get entries synchronously - return null\n        // Caller should use ZipkitServer.getMerkleRootAsync() for file-based ZIPs\n        Logger.error('getMerkleRootAsync() called on file-based ZIP. Use ZipkitServer.getMerkleRootAsync() instead.');\n        return null;\n      }\n    } catch (error) {\n      Logger.error(`Failed to get directory for merkle root calculation: ${error instanceof Error ? error.message : String(error)}`);\n      return null;\n    }\n    \n    if (!zipEntries || zipEntries.length === 0) {\n      return null;\n    }\n  \n    const hashAccumulator = new HashCalculator({ enableAccumulation: true });\n    \n    // Filter out metadata files (META-INF) to ensure consistent Merkle Root calculation\n    // Inline check to avoid conflict with ZipkitBrowser's isMetadataFile() method\n    const contentEntries = zipEntries.filter(entry => {\n      const filename = entry.filename || '';\n      return filename !== TIMESTAMP_SUBMITTED &&\n             filename !== TIMESTAMP_METADATA &&\n             filename !== TOKENIZED_METADATA;\n    });\n    \n    for (const entry of contentEntries) {\n      if (entry.sha256) {\n        // Convert hex string to Buffer\n        const hashBuffer = Buffer.from(entry.sha256, 'hex');\n        hashAccumulator.addHash(hashBuffer);\n      }\n    }\n    \n    const merkleRoot = hashAccumulator.merkleRoot();\n    if (!merkleRoot) {\n      return null;\n    }\n\n    return merkleRoot;\n  }\n\n}\n", "// ======================================\n//\tZipCopy.ts - Efficient ZIP Entry Copying (Buffer-based)\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// Efficient ZIP entry copying using ZipEntry instances directly.\n// Leverages existing offsets and sizes to copy raw bytes without\n// unnecessary parsing and reconstruction.\n// Buffer-based implementation for in-memory ZIP operations.\n\nimport ZipEntry from './ZipEntry';\nimport Zipkit from './Zipkit';\nimport { LOCAL_HDR, CENTRAL_END, GP_FLAG } from './constants/Headers';\n\n/**\n * Options for copying ZIP files\n */\nexport interface CopyOptions {\n  /** Filter function to determine which entries to copy */\n  entryFilter?: (entry: ZipEntry) => boolean;\n  /** Sort function to reorder entries before copying */\n  entrySorter?: (a: ZipEntry, b: ZipEntry) => number;\n  /** Whether to preserve the ZIP file comment (default: true) */\n  preserveComments?: boolean;\n}\n\n/**\n * Result of copying a ZIP file\n */\nexport interface CopyResult {\n  /** Information about copied entries */\n  entries: Array<{\n    filename: string;\n    localHeaderOffset: number;\n    compressedSize: number;\n  }>;\n  /** Offset to the start of the central directory */\n  centralDirOffset: number;\n  /** Total number of entries copied */\n  totalEntries: number;\n  /** Buffer containing the complete copied ZIP file */\n  zipBuffer: Buffer;\n}\n\n/**\n * Result of copying only ZIP entry data (no central directory or EOCD).\n * Use with writeCentralDirectoryAndEOCD after optionally appending more entry data\n * to build a ZIP that includes both copied and new entries.\n */\nexport interface CopyEntriesOnlyResult {\n  /** Buffer containing only entry data (local headers + compressed data); not yet a valid ZIP */\n  entryDataBuffer: Buffer;\n  /** Offset at which entry data ends; central directory should start here after any new entries are appended (equals entryDataBuffer.length) */\n  dataEndOffset: number;\n  /** Copied entries with localHdrOffset set for the destination buffer */\n  copiedEntries: ZipEntry[];\n}\n\n/**\n * Options for finalizing a ZIP (writing central directory and EOCD)\n */\nexport interface FinalizeZipOptions {\n  /** ZIP file comment (default: empty) */\n  zipComment?: string;\n  /** Offset at which the central directory will start in the final buffer (required for buffer-based finalization; e.g. entryDataBuffer.length) */\n  centralDirOffset?: number;\n}\n\n/**\n * Efficient ZIP file copying class (Buffer-based)\n *\n * Uses ZipEntry instances directly to copy entries without decompression/recompression.\n * Supports filtering and reordering entries while maintaining ZIP file validity.\n * Works entirely with buffers for in-memory operations.\n *\n * Entry data and the central directory / EOCD are separated so you can append\n * more entry data before finalizing: use copyZipEntriesOnly, append new entry\n * data to the buffer, then call writeCentralDirectoryAndEOCD with all entries\n * and concatenate to form the final ZIP buffer.\n *\n * @example Full copy (one shot)\n * ```typescript\n * const zipCopy = new ZipCopy(zipkit);\n * const result = await zipCopy.copyZipBuffer(sourceZipBuffer, {\n *   entryFilter: (entry) => !entry.filename.startsWith('.'),\n *   entrySorter: (a, b) => a.filename.localeCompare(b.filename)\n * });\n * // result.zipBuffer contains the complete copied ZIP file\n * ```\n *\n * @example Copy then append entries before finalizing\n * ```typescript\n * const { entryDataBuffer, dataEndOffset, copiedEntries } = await zipCopy.copyZipEntriesOnly(sourceZipBuffer);\n * // ... append new entry data (local header + data), collect new ZipEntry[] with localHdrOffset set ...\n * const allEntryData = Buffer.concat([entryDataBuffer, newEntryDataBuffer]);\n * const allEntries = [...copiedEntries, ...newEntries];\n * const centralAndEocd = zipCopy.writeCentralDirectoryAndEOCD(allEntries, {\n *   zipComment: '',\n *   centralDirOffset: allEntryData.length\n * });\n * const zipBuffer = Buffer.concat([allEntryData, centralAndEocd]);\n * ```\n */\nexport class ZipCopy {\n  private zipkit: Zipkit;\n\n  /**\n   * Creates a new ZipCopy instance\n   * @param zipkit - Zipkit instance to use for ZIP operations\n   */\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n  }\n\n  /**\n   * Calculate local header size by reading from buffer\n   * \n   * Reads the first 30 bytes of the local header to get the exact\n   * filename and extra field lengths, ensuring accuracy even when\n   * local header differs from central directory.\n   * \n   * @param sourceBuffer - Buffer containing the source ZIP file\n   * @param entry - ZipEntry with localHdrOffset\n   * @returns Size of the local header in bytes\n   */\n  private calculateLocalHeaderSize(sourceBuffer: Buffer, entry: ZipEntry): number {\n    // Verify offset is within buffer bounds\n    if (entry.localHdrOffset + LOCAL_HDR.SIZE > sourceBuffer.length) {\n      throw new Error(\n        `Local header offset ${entry.localHdrOffset} is beyond buffer size ${sourceBuffer.length} for entry ${entry.filename}`\n      );\n    }\n\n    // Read the fixed 30-byte local header\n    const headerBuffer = sourceBuffer.subarray(entry.localHdrOffset, entry.localHdrOffset + LOCAL_HDR.SIZE);\n\n    // Verify signature\n    if (headerBuffer.readUInt32LE(0) !== LOCAL_HDR.SIGNATURE) {\n      throw new Error(\n        `Invalid local file header signature for entry ${entry.filename} at offset ${entry.localHdrOffset}`\n      );\n    }\n\n    // Read filename and extra field lengths from the actual header\n    const filenameLength = headerBuffer.readUInt16LE(LOCAL_HDR.FNAME_LEN);\n    const extraFieldLength = headerBuffer.readUInt16LE(LOCAL_HDR.EXTRA_LEN);\n\n    // Calculate total local header size\n    return LOCAL_HDR.SIZE + filenameLength + extraFieldLength;\n  }\n\n  /**\n   * Copy entry bytes directly from source buffer\n   * \n   * Copies the local header and compressed data as a single operation.\n   * \n   * Handles various entry types:\n   * - Normal entries: [local header][filename][extra][compressed data]\n   * - Encrypted entries: compressedSize includes 12-byte encryption header\n   * - Data descriptor entries: [local header][filename][extra][data][data descriptor (16 bytes)]\n   * \n   * For data descriptor entries, the local header has compressed size = 0,\n   * but the actual size is in the central directory (entry.compressedSize).\n   * \n   * @param sourceBuffer - Buffer containing the source ZIP file\n   * @param entry - ZipEntry with source offset information\n   * @returns Buffer containing the copied entry (local header + compressed data + data descriptor if present)\n   */\n  private copyEntryBytes(\n    sourceBuffer: Buffer,\n    entry: ZipEntry\n  ): Buffer {\n    // Calculate local header size by reading from buffer\n    const localHeaderSize = this.calculateLocalHeaderSize(sourceBuffer, entry);\n    \n    // Determine total entry size\n    // For data descriptor entries, add 16 bytes for the data descriptor\n    const hasDataDescriptor = (entry.bitFlags & GP_FLAG.DATA_DESC) !== 0;\n    const totalEntrySize = localHeaderSize + entry.compressedSize + (hasDataDescriptor ? 16 : 0);\n\n    // Verify we have enough data in the buffer\n    if (entry.localHdrOffset + totalEntrySize > sourceBuffer.length) {\n      throw new Error(\n        `Entry ${entry.filename} extends beyond buffer size: ` +\n        `offset ${entry.localHdrOffset} + size ${totalEntrySize} > buffer length ${sourceBuffer.length}`\n      );\n    }\n\n    // Extract the entire entry (local header + compressed data + data descriptor if present) from source\n    const entryBuffer = sourceBuffer.subarray(entry.localHdrOffset, entry.localHdrOffset + totalEntrySize);\n\n    // Verify data descriptor signature if present\n    if (hasDataDescriptor) {\n      const dataDescOffset = localHeaderSize + entry.compressedSize;\n      const dataDescSig = entryBuffer.readUInt32LE(dataDescOffset);\n      if (dataDescSig !== 0x08074b50) { // DATA_DESCRIPTOR signature\n        throw new Error(\n          `Invalid data descriptor signature for entry ${entry.filename} ` +\n          `(expected 0x08074b50, got 0x${dataDescSig.toString(16)})`\n        );\n      }\n    }\n\n    // Return a copy of the buffer slice (so modifications don't affect source)\n    return Buffer.from(entryBuffer);\n  }\n\n  /**\n   * Clone a ZipEntry with a new local header offset\n   * \n   * Creates a new ZipEntry instance with all properties copied from the source,\n   * but with an updated localHdrOffset for the destination buffer.\n   * \n   * @param entry - Source ZipEntry to clone\n   * @param newLocalHdrOffset - New local header offset for the destination\n   * @returns New ZipEntry instance with updated offset\n   */\n  private cloneEntryWithOffset(\n    entry: ZipEntry,\n    newLocalHdrOffset: number\n  ): ZipEntry {\n    // Create a new ZipEntry with the same filename and comment\n    const cloned = new ZipEntry(entry.filename, entry.comment || null, entry.debug);\n\n    // Copy all properties\n    cloned.verMadeBy = entry.verMadeBy;\n    cloned.verExtract = entry.verExtract;\n    cloned.bitFlags = entry.bitFlags;\n    cloned.cmpMethod = entry.cmpMethod;\n    cloned.timeDateDOS = entry.timeDateDOS;\n    cloned.crc = entry.crc;\n    cloned.compressedSize = entry.compressedSize;\n    cloned.uncompressedSize = entry.uncompressedSize;\n    cloned.volNumber = entry.volNumber;\n    cloned.intFileAttr = entry.intFileAttr;\n    cloned.extFileAttr = entry.extFileAttr;\n    cloned.localHdrOffset = newLocalHdrOffset; // Update offset\n\n    // Copy extra field if present\n    if (entry.extraField) {\n      cloned.extraField = Buffer.from(entry.extraField);\n    }\n\n    // Copy metadata\n    cloned.isEncrypted = entry.isEncrypted;\n    cloned.isStrongEncrypt = entry.isStrongEncrypt;\n    cloned.isDirectory = entry.isDirectory;\n    cloned.isMetaData = entry.isMetaData;\n    cloned.isUpdated = entry.isUpdated;\n\n    // Copy platform-specific data\n    cloned.platform = entry.platform;\n    cloned.universalTime = entry.universalTime;\n    cloned.uid = entry.uid;\n    cloned.gid = entry.gid;\n    cloned.sha256 = entry.sha256;\n\n    // Copy symlink data\n    cloned.isSymlink = entry.isSymlink;\n    cloned.linkTarget = entry.linkTarget;\n\n    // Copy hardlink data\n    cloned.isHardLink = entry.isHardLink;\n    cloned.originalEntry = entry.originalEntry;\n    cloned.inode = entry.inode;\n\n    return cloned;\n  }\n\n  /**\n   * Build central directory and End of Central Directory buffer.\n   * Used internally by copyZipBuffer and by writeCentralDirectoryAndEOCD.\n   */\n  private buildCentralDirectoryAndEOCDBuffer(\n    entries: ZipEntry[],\n    zipComment: string,\n    centralDirOffset: number\n  ): Buffer {\n    const centralDirChunks: Buffer[] = [];\n    for (const entry of entries) {\n      centralDirChunks.push(entry.centralDirEntry());\n    }\n    const centralDirBuffer = Buffer.concat(centralDirChunks);\n    const centralDirSize = centralDirBuffer.length;\n\n    const commentBytes = Buffer.from(zipComment, 'utf8');\n    const commentLength = Math.min(commentBytes.length, 0xffff);\n\n    const eocdBuffer = Buffer.alloc(22 + commentLength);\n    let pos = 0;\n    eocdBuffer.writeUInt32LE(CENTRAL_END.SIGNATURE, pos);\n    pos += 4;\n    eocdBuffer.writeUInt16LE(0, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(0, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(entries.length, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(entries.length, pos);\n    pos += 2;\n    eocdBuffer.writeUInt32LE(centralDirSize, pos);\n    pos += 4;\n    eocdBuffer.writeUInt32LE(centralDirOffset, pos);\n    pos += 4;\n    eocdBuffer.writeUInt16LE(commentLength, pos);\n    pos += 2;\n    if (commentLength > 0) {\n      commentBytes.copy(eocdBuffer, pos, 0, commentLength);\n    }\n\n    return Buffer.concat([centralDirBuffer, eocdBuffer]);\n  }\n\n  /**\n   * Copy only ZIP entry data from the source buffer (no central directory or EOCD).\n   * Use when you want to append more entry data before finalizing. Then call\n   * writeCentralDirectoryAndEOCD with all entries (copied + new) and concatenate\n   * to form the final ZIP buffer.\n   *\n   * @param sourceZipBuffer - Buffer containing the source ZIP file\n   * @param options - Optional copy options (filtering, sorting)\n   * @returns Result with entryDataBuffer and copiedEntries for use when appending and finalizing\n   */\n  async copyZipEntriesOnly(\n    sourceZipBuffer: Buffer,\n    options?: CopyOptions\n  ): Promise<CopyEntriesOnlyResult> {\n    const sourceEntries = this.zipkit.loadZip(sourceZipBuffer);\n\n    let entriesToCopy = options?.entryFilter\n      ? sourceEntries.filter(options.entryFilter)\n      : sourceEntries;\n\n    if (options?.entrySorter) {\n      entriesToCopy = [...entriesToCopy].sort(options.entrySorter);\n    }\n\n    if (entriesToCopy.length === 0) {\n      throw new Error('No entries to copy after filtering');\n    }\n\n    const outputChunks: Buffer[] = [];\n    let destOffset = 0;\n    const copiedEntries: ZipEntry[] = [];\n\n    for (const sourceEntry of entriesToCopy) {\n      const newLocalHdrOffset = destOffset;\n      const entryBuffer = this.copyEntryBytes(sourceZipBuffer, sourceEntry);\n      outputChunks.push(entryBuffer);\n      destOffset += entryBuffer.length;\n      const clonedEntry = this.cloneEntryWithOffset(sourceEntry, newLocalHdrOffset);\n      copiedEntries.push(clonedEntry);\n    }\n\n    const entryDataBuffer = Buffer.concat(outputChunks);\n\n    return {\n      entryDataBuffer,\n      dataEndOffset: entryDataBuffer.length,\n      copiedEntries,\n    };\n  }\n\n  /**\n   * Build central directory and End of Central Directory buffer for the given entries.\n   * Concatenate this with entry data (e.g. from copyZipEntriesOnly + any appended entries)\n   * to form a valid ZIP buffer. When concatenating, pass centralDirOffset equal to the\n   * length of the entry data buffer that will precede this (so EOCD has the correct offset).\n   *\n   * @param entries - All entries in order (copied + any new), each with localHdrOffset set\n   * @param options - Optional finalize options (zipComment; centralDirOffset for correct EOCD when concatenating)\n   * @returns Buffer containing central directory + EOCD\n   */\n  writeCentralDirectoryAndEOCD(\n    entries: ZipEntry[],\n    options?: FinalizeZipOptions\n  ): Buffer {\n    if (entries.length === 0) {\n      throw new Error('At least one entry is required to finalize');\n    }\n\n    const zipComment = options?.zipComment ?? '';\n    const centralDirOffset = options?.centralDirOffset ?? 0;\n    const result: Buffer = this.buildCentralDirectoryAndEOCDBuffer(\n      entries,\n      zipComment,\n      centralDirOffset\n    );\n    return result;\n  }\n\n  /**\n   * Copy ZIP file entries efficiently from buffer to buffer\n   *\n   * Main method that copies entries from source ZIP buffer to destination ZIP buffer.\n   * Uses ZipEntry instances directly to avoid unnecessary parsing.\n   *\n   * @param sourceZipBuffer - Buffer containing the source ZIP file\n   * @param options - Optional copy options (filtering, sorting, etc.)\n   * @returns Copy result with entry information and the complete ZIP buffer\n   */\n  async copyZipBuffer(\n    sourceZipBuffer: Buffer,\n    options?: CopyOptions\n  ): Promise<CopyResult> {\n    const { entryDataBuffer, dataEndOffset, copiedEntries } = await this.copyZipEntriesOnly(\n      sourceZipBuffer,\n      options\n    );\n\n    const zipComment =\n      options?.preserveComments !== false && this.zipkit.getZipComment()\n        ? this.zipkit.getZipComment()!\n        : '';\n\n    const centralAndEocd = this.writeCentralDirectoryAndEOCD(copiedEntries, {\n      zipComment,\n      centralDirOffset: dataEndOffset,\n    });\n\n    const zipBuffer = Buffer.concat([entryDataBuffer, centralAndEocd]);\n\n    return {\n      entries: copiedEntries.map(entry => ({\n        filename: entry.filename,\n        localHeaderOffset: entry.localHdrOffset,\n        compressedSize: entry.compressedSize,\n      })),\n      centralDirOffset: dataEndOffset,\n      totalEntries: copiedEntries.length,\n      zipBuffer,\n    };\n  }\n}\n", "// ======================================\n//\tSupport.ts\n//  A utility module for detecting platform capabilities and features\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n\n/**\n * Platform and environment feature detection utility\n * Provides boolean flags indicating support for various features needed by NeoZip\n * \n * @namespace Support\n * @property {boolean} base64 - Always true, indicates base64 encoding support\n * @property {boolean} array - Always true, indicates Array support\n * @property {boolean} string - Always true, indicates String support\n * @property {boolean} isNode - True if running in Node.js environment\n * @property {boolean} buffer - True if Node.js Buffer is available\n * @property {boolean} uint8array - True if Uint8Array is supported\n * @property {boolean} arrayBuffer - True if both ArrayBuffer and Uint8Array are supported\n * @property {boolean} blob - True if Blob creation with ArrayBuffer is supported\n * @property {boolean} streams - True if ReadableStream and WritableStream are supported\n * @property {boolean} fileReader - True if FileReader is supported\n */\nconst Support = {\n  /** Base64 encoding support (always true) */\n  base64: true,\n  /** Array support (always true) */\n  array: true,\n  /** String support (always true) */\n  string: true,\n\n  /** \n   * Detects if code is running in Node.js environment\n   * True if process.versions.node exists, undefined in browser\n   */\n  isNode: true,\n  \n  /**\n   * Detects if Node.js Buffer is available\n   * True in Node.js, undefined in browser\n   */\n  buffer: true,\n\n  /**\n   * Detects support for Uint8Array typed array\n   * Used for binary data handling\n   */\n  uint8array: true,\n  \n  /**\n   * Detects support for both ArrayBuffer and Uint8Array\n   * Required for binary data operations\n   */\n  arrayBuffer: typeof ArrayBuffer !== \"undefined\" && typeof Uint8Array !== \"undefined\",\n\n  /**\n   * Detects support for Blob with ArrayBuffer\n   * Tests by attempting to create an empty ZIP Blob\n   * @returns {boolean} True if Blob creation succeeds\n   */\n  blob: true,\n\n  /**\n   * Detects support for Streams API\n   * Checks for ReadableStream/WritableStream in browser\n   * or 'stream' module in Node.js\n   * @returns {boolean} True if streams are supported in current environment\n   */\n  streams: true,\n  \n  /**\n   * Detects support for FileReader\n   * @returns {boolean} True if FileReader is supported\n   */\n  fileReader: false\n};\n\nexport default Support;", "// ======================================\n//\tUtil.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Utility functions\n\nimport Support from \"./Support\";\nimport Errors from \"../constants/Errors\";\nimport { TIMESTAMP_SUBMITTED, TIMESTAMP_METADATA, TOKENIZED_METADATA } from \"../constants/Headers\";\n\nexport const DATATYPE = {\n  STRING: \"string\",\n  BUFFER: \"buffer\",\n  ARRAY: \"array\",\n  ARRAYBUFFER: \"arraybuffer\",\n  U8ARRAY: \"uint8array\",\n  BLOB: \"blob\",\n  STREAM: \"stream\",\n};\n\n// Parse a 64-bit unsigned integer from a buffer\nexport function readBigUInt64LE(buffer: Buffer, index: number): number {\n  var buf = Buffer.from(buffer.subarray(index, index + 8));\n  buf.swap64();\n\n  return parseInt(`0x${buf.toString(\"hex\")}`);\n};\n\n// C-style uInt32 Multiply (discards higher bits, when JS multiply discards lower bits)\nexport const uMul = (a: number, b: number) => Math.imul(a, b) >>> 0;\n\ninterface StreamLike {\n  on: Function;\n  pause: Function;\n  resume: Function;\n}\n\nexport function isStream(obj: unknown): obj is StreamLike {\n  if (!obj || typeof obj !== 'object') return false;\n  const streamLike = obj as StreamLike;\n  return typeof streamLike.on === \"function\" &&\n         typeof streamLike.pause === \"function\" &&\n         typeof streamLike.resume === \"function\";\n}\n\n// Return the type of the input.\n// The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.\n// If the type is not supported, throw an exception.\nexport function getTypeOf(input: string|Buffer|Blob|Array<any>|ArrayBuffer|Uint8Array): string {\n  if (typeof input === \"string\") {\n    if (!Support.string)\n      throw new Error(Errors.DATATYPE_STRING_UNSUPPORTED);\n    return DATATYPE.STRING;\n  }\n  else if (Object.prototype.toString.call(input) === \"[object Array]\") {\n    if (!Support.array)\n      throw new Error(Errors.DATATYPE_ARRAY_UNSUPPORTED);\n    return DATATYPE.ARRAY;\n  }\n  else if (Buffer.isBuffer(input)) {\n    if (!Support.buffer)\n      throw new Error(Errors.DATATYPE_BUFFER_UNSUPPORTED);\n    return DATATYPE.BUFFER;\n  }  else if (input instanceof Blob) {\n    if (!Support.blob)\n      throw new Error(Errors.DATATYPE_BLOB_UNSUPPORTED);\n    return DATATYPE.BLOB;\n  } else if (input instanceof Uint8Array) {\n    if (!Support.uint8array)\n      throw new Error(Errors.DATATYPE_U8ARRAY_UNSUPPORTED);\n    return DATATYPE.U8ARRAY;\n  }\n  else if (input instanceof ArrayBuffer) {\n    if (!Support.arrayBuffer)\n      throw new Error(Errors.DATATYPE_ARRAYBUFFER_UNSUPPORTED);\n    return DATATYPE.ARRAYBUFFER;\n  } else {  // Add an else block to handle unsupported types\n    throw new Error(Errors.DATATYPE_UNSUPPORTED);\n  }\n};\n\n/**\n * Check if a filename is a metadata file\n * @param filename The filename to check\n * @returns True if the file is a metadata file (META-INF)\n */\nexport const isMetadataFile = (filename: string): boolean => {\n  return filename === TIMESTAMP_SUBMITTED || \n         filename === TIMESTAMP_METADATA || \n         filename === TOKENIZED_METADATA;\n};\n", "/**\n * Progress tracker for streaming operations\n * Provides real-time progress updates and ETA calculations\n */\nexport class ProgressTracker {\n  private startTime: number;\n  private lastUpdateTime: number;\n  private totalBytes: number;\n  private processedBytes: number;\n  private fileName: string;\n  private lastReportedPercent: number = -1;\n\n  constructor(fileName: string, totalBytes: number) {\n    this.fileName = fileName;\n    this.totalBytes = totalBytes;\n    this.processedBytes = 0;\n    this.startTime = Date.now();\n    this.lastUpdateTime = this.startTime;\n  }\n\n  /**\n   * Update progress with bytes processed\n   * @param bytesProcessed - Number of bytes processed in this update\n   */\n  update(bytesProcessed: number): void {\n    this.processedBytes += bytesProcessed;\n    this.reportProgress();\n  }\n\n  /**\n   * Set total bytes (useful when file size changes)\n   */\n  setTotalBytes(totalBytes: number): void {\n    this.totalBytes = totalBytes;\n  }\n\n  /**\n   * Report progress if enough time has passed or significant progress made\n   */\n  private reportProgress(): void {\n    const now = Date.now();\n    const percent = Math.floor((this.processedBytes / this.totalBytes) * 100);\n    \n    // Report if:\n    // 1. 1% or more progress made, OR\n    // 2. 500ms have passed since last report\n    const shouldReport = \n      percent > this.lastReportedPercent || \n      (now - this.lastUpdateTime) > 500;\n\n    if (shouldReport) {\n      this.lastReportedPercent = percent;\n      this.lastUpdateTime = now;\n      this.printProgress();\n    }\n  }\n\n  /**\n   * Print progress information\n   */\n  private printProgress(): void {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    const rate = this.processedBytes / elapsed;\n    const eta = this.totalBytes > this.processedBytes \n      ? (this.totalBytes - this.processedBytes) / rate \n      : 0;\n    const percent = Math.floor((this.processedBytes / this.totalBytes) * 100);\n\n    const formatBytes = (bytes: number): string => {\n      const units = ['B', 'KB', 'MB', 'GB'];\n      let size = bytes;\n      let unitIndex = 0;\n      \n      while (size >= 1024 && unitIndex < units.length - 1) {\n        size /= 1024;\n        unitIndex++;\n      }\n      \n      return `${size.toFixed(1)}${units[unitIndex]}`;\n    };\n\n    const formatTime = (seconds: number): string => {\n      if (seconds < 60) return `${seconds.toFixed(0)}s`;\n      if (seconds < 3600) return `${Math.floor(seconds / 60)}m ${(seconds % 60).toFixed(0)}s`;\n      return `${Math.floor(seconds / 3600)}h ${Math.floor((seconds % 3600) / 60)}m`;\n    };\n\n    process.stdout.write(\n      `\\r${this.fileName}: ${percent}% (${formatBytes(this.processedBytes)}/${formatBytes(this.totalBytes)}) ` +\n      `[${formatBytes(rate)}/s] ETA: ${formatTime(eta)}`\n    );\n  }\n\n  /**\n   * Complete progress tracking\n   */\n  complete(): void {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    const rate = this.processedBytes / elapsed;\n    \n    const formatBytes = (bytes: number): string => {\n      const units = ['B', 'KB', 'MB', 'GB'];\n      let size = bytes;\n      let unitIndex = 0;\n      \n      while (size >= 1024 && unitIndex < units.length - 1) {\n        size /= 1024;\n        unitIndex++;\n      }\n      \n      return `${size.toFixed(1)}${units[unitIndex]}`;\n    };\n\n    console.log(\n      `\\r${this.fileName}: 100% (${formatBytes(this.processedBytes)}) ` +\n      `[${formatBytes(rate)}/s] completed in ${elapsed.toFixed(1)}s`\n    );\n  }\n\n  /**\n   * Get current progress percentage\n   */\n  getProgressPercent(): number {\n    return Math.floor((this.processedBytes / this.totalBytes) * 100);\n  }\n\n  /**\n   * Get processing rate in bytes per second\n   */\n  getProcessingRate(): number {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    return this.processedBytes / elapsed;\n  }\n}\n", "/**\n * Encryption Manager for NeoZipKit\n * Manages different encryption providers and provides a unified interface\n */\n\nimport { EncryptionProvider, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionMethod } from './types';\nimport { ZipCrypto } from './ZipCrypto';\nimport { AesCrypto } from './AesCrypto';\n\nexport class EncryptionManager {\n  private providers: Map<EncryptionMethod, EncryptionProvider> = new Map();\n\n  constructor() {\n    // Register default encryption providers\n    this.registerProvider(new ZipCrypto());\n  }\n\n  /**\n   * Register a new encryption provider\n   */\n  registerProvider(provider: EncryptionProvider): void {\n    if (provider.canHandle(EncryptionMethod.ZIP_CRYPTO)) {\n      this.providers.set(EncryptionMethod.ZIP_CRYPTO, provider);\n    }\n    if (provider.canHandle(EncryptionMethod.AES_256)) {\n      this.providers.set(EncryptionMethod.AES_256, provider);\n    }\n  }\n\n  /**\n   * Get available encryption methods\n   */\n  getAvailableMethods(): EncryptionMethod[] {\n    return Array.from(this.providers.keys());\n  }\n\n  /**\n   * Get encryption provider for a specific method\n   */\n  getProvider(method: EncryptionMethod): EncryptionProvider | null {\n    return this.providers.get(method) || null;\n  }\n\n  /**\n   * Encrypt data using specified method\n   */\n  async encrypt(data: Buffer, options: EncryptionOptions): Promise<EncryptionResult> {\n    const provider = this.getProvider(options.method);\n    if (!provider) {\n      return {\n        success: false,\n        error: `No encryption provider available for method ${options.method}`\n      };\n    }\n\n    return await provider.encrypt(data, options);\n  }\n\n  /**\n   * Decrypt data using specified method\n   */\n  async decrypt(data: Buffer, options: EncryptionOptions): Promise<DecryptionResult> {\n    const provider = this.getProvider(options.method);\n    if (!provider) {\n      return {\n        success: false,\n        error: `No decryption provider available for method ${options.method}`\n      };\n    }\n\n    return await provider.decrypt(data, options);\n  }\n\n  /**\n   * Get recommended encryption method (ZIP_CRYPTO)\n   */\n  getRecommendedMethod(): EncryptionMethod {\n    return EncryptionMethod.AES_256;\n  }\n\n  /**\n   * Validate encryption options\n   */\n  validateOptions(options: EncryptionOptions): { isValid: boolean; errors: string[] } {\n    const errors: string[] = [];\n\n    if (!options.method) {\n      errors.push('Encryption method is required');\n    }\n\n    if (!options.password || options.password.length === 0) {\n      errors.push('Password is required');\n    }\n\n    if (options.password && options.password.length < 4) {\n      errors.push('Password must be at least 4 characters long');\n    }\n\n    return {\n      isValid: errors.length === 0,\n      errors: errors\n    };\n  }\n\n  /**\n   * Get encryption method info\n   */\n  getMethodInfo(method: EncryptionMethod): { name: string; keyLength: number; secure: boolean } | null {\n    const provider = this.getProvider(method);\n    if (!provider) {\n      return null;\n    }\n\n    return {\n      name: provider.getMethodName(),\n      keyLength: provider.getKeyLength(),\n      secure: method === EncryptionMethod.AES_256\n    };\n  }\n\n  /**\n   * List all available encryption methods with their details\n   */\n  listMethods(): Array<{ method: EncryptionMethod; name: string; keyLength: number; secure: boolean }> {\n    const methods: Array<{ method: EncryptionMethod; name: string; keyLength: number; secure: boolean }> = [];\n    \n    for (const [method, provider] of this.providers) {\n      methods.push({\n        method: method,\n        name: provider.getMethodName(),\n        keyLength: provider.getKeyLength(),\n        secure: method === EncryptionMethod.AES_256\n      });\n    }\n\n    return methods.sort((a, b) => {\n      // Sort by name\n      return a.name.localeCompare(b.name);\n    });\n  }\n}\n", "// Import package.json to get the version\n// import * as path from 'path';\n// import * as fs from 'fs';\n\n// Resolve package.json path - works with both normal installs and symlinks\n// Walk up from __dirname to find package.json\n// let packageJsonPath: string | null = null;\n// let currentDir = __dirname;\n\n// Walk up the directory tree to find package.json\n// while (currentDir !== path.dirname(currentDir)) {\n//   const candidate = path.join(currentDir, 'package.json');\n//   if (fs.existsSync(candidate)) {\n//     packageJsonPath = candidate;\n//     break;\n//   }\n//   currentDir = path.dirname(currentDir);\n// }\n\n// if (!packageJsonPath) {\n//   throw new Error('Cannot find package.json for neozipkit');\n// }\n\n// const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf8'));\n\n// Get current date for release date\nconst currentDate = new Date();\nconst releaseDate = `${String(currentDate.getMonth() + 1).padStart(2, '0')}-${String(currentDate.getDate()).padStart(2, '0')}-${currentDate.getFullYear()}`;\n\nexport const VERSION = {\n  number: '1.0.2', // packageJson.version\n  date: releaseDate\n}; ", "/**\n * Core Module Exports\n * Core ZIP functionality (platform-agnostic)\n */\n\n// Core ZIP classes\nimport Zipkit from './Zipkit';\nexport * from './Zipkit';\nexport * from './ZipEntry';\nexport { ZipCompress } from './ZipCompress';\nexport type { CompressOptions, CreateZipOptions } from './ZipCompress';\nexport type { DecompressionResult, DecompressionOptions } from './ZipDecompress';\nexport { ZipCopy } from './ZipCopy';\nexport type {\n  CopyOptions,\n  CopyResult,\n  CopyEntriesOnlyResult,\n  FinalizeZipOptions,\n} from './ZipCopy';\nexport default Zipkit;\n\n// Shared components\nexport { default as HashCalculator, HashCalculator as HashCalculatorClass } from './components/HashCalculator';\nexport * from './components/Util';\nexport * from './components/Support';\nexport { ProgressTracker } from './components/ProgressTracker';\n\n// Encryption functionality\nexport { EncryptionManager } from './encryption/Manager';\nexport { ZipCrypto, crc32, crc32update, sha256 } from './encryption/ZipCrypto';\nexport type { EncryptionMethod, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionProvider } from './encryption/types';\n\n// Types and constants\nexport * from '../types';\nexport * from './constants/Headers';\nexport * from './constants/Errors';\nexport * from './version';\n\n// Logger utility\nexport { Logger, configureLoggerFromEnvironment } from './components/Logger';\nexport type { LogLevel, LoggerConfig } from './components/Logger';\n\n", "// ======================================\n//\tZipkitBrowser.ts\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n\nimport Zipkit, { CompressOptions, CreateZipOptions } from '../core';\nimport ZipEntry from '../core/ZipEntry';\nimport { ZipCompress } from '../core/ZipCompress';\nimport Errors from '../core/constants/Errors';\nimport * as Headers from '../core/constants/Headers';\nimport { TOKENIZED_METADATA, TIMESTAMP_SUBMITTED, TIMESTAMP_METADATA } from '../core/constants/Headers';\nimport { sha256, crc32 } from '../core/encryption/ZipCrypto';\nimport { DATATYPE, getTypeOf } from '../core/components/Util';\nimport type { FileData } from '../types';\nimport HashCalculator from '../core/components/HashCalculator';\n\n// Re-export everything from Zipkit\nexport * from '../core';\nexport { ZipEntry, Errors, Headers, sha256, getTypeOf };\n\n// ======================================\n//\tZipkitBrowser\n// ======================================\n\nexport default class ZipkitBrowser extends Zipkit {\n  constructor() {\n    super();      // Call the parent constructor\n\n    // console.log('Zipkit.support.isNode: ', Zipkit.support.isNode);\n    // console.log('Zipkit.support.buffer: ', Zipkit.support.buffer);\n    // console.log('Zipkit.support.blob: ', Zipkit.support.blob);\n    // console.log('Zipkit.support.streams: ', Zipkit.support.streams);\n    // console.log('Zipkit.support.fileReader: ', Zipkit.support.fileReader);\n  }\n\n  // --------------------------------------\n  // Load a ZIP file from a Blob and return the ZipEntry array\n  // Always uses loadZip() to ensure proper initialization\n\n  async loadZipBlob(data: Blob): Promise<ZipEntry[] | null> {\n    if (getTypeOf(data) !== DATATYPE.BLOB) {\n      throw new Error(Errors.DATATYPE_UNSUPPORTED);\n    }\n\n    return new Promise((resolve, reject) => {\n      const reader = new window.FileReader();\n      reader.readAsArrayBuffer(data);\n\n      reader.onload = (e: ProgressEvent<FileReader>) => {\n        if (!reader.result) {\n          reject(new Error('Failed to read file'));\n          return;\n        }\n        \n        try {\n          // Convert ArrayBuffer to Buffer\n          const buffer = Buffer.from(reader.result as ArrayBuffer);\n          \n          // Always use loadZip() which:\n          // 1. Resets ZIP data\n          // 2. Stores buffer in this.inBuffer\n          // 3. Loads EOCD and parses central directory\n          // 4. Stores entries in this.zipEntries\n          // 5. Returns the entries\n          const entries = super.loadZip(buffer);\n          resolve(entries);\n        } catch (error) {\n          reject(error);\n        }\n      };\n\n      reader.onerror = () => {\n        reject(reader.error || new Error('Failed to read file'));\n      };\n    });\n  }\n\n  // --------------------------------------\n  // Create a ZipEntry for a File object\n\n  createZipFileEntry(file: FileData): ZipEntry {\n    const entry = super.createZipEntry(file.name);\n    entry.fileData = file;\n    entry.uncompressedSize = file.size;\n\n    const fileDate = new Date(file.lastModified);\n    entry.timeDateDOS = entry.setDateTime(fileDate);\n    entry.cmpMethod = Headers.CMP_METHOD.DEFLATED;\n\n    return entry;\n  }\n\n  // --------------------------------------\n  // Calculate the SHA256 hash of a File object\n\n  async hashFile(file: FileData): Promise<string> {\n    const arrayBuffer = await file.arrayBuffer();\n    const buffer = Buffer.from(arrayBuffer);\n    return sha256(buffer);\n  }\n\n  // --------------------------------------\n  // Compress the data and return the compressed data buffer\n  // Set the ZipEntry compressSize and CRC32 values\n\n  async compressDataBlob(entry: ZipEntry, data: Blob, options?: CompressOptions): Promise<Buffer> {\n    if (getTypeOf(data) !== DATATYPE.BLOB) {\n      throw new Error(Errors.DATATYPE_UNSUPPORTED);\n    }\n\n    return new Promise(async (resolve, reject) => {\n      const _compressData = async (entry: ZipEntry, data: Buffer, options?: CompressOptions): Promise<Buffer> => {\n        // Use Zipkit wrapper method\n        return await this.compressData(entry, data, options);\n      };\n\n      const reader = new window.FileReader();\n      reader.readAsArrayBuffer(data);\n\n      reader.onload = async function(this: FileReader, e: ProgressEvent<FileReader>) {\n        if (!this.result) {\n          reject(new Error('Failed to read file'));\n          return;\n        }\n        try {\n          const _inBuf = Buffer.from(this.result as ArrayBuffer);\n          const result = await _compressData(entry, _inBuf, options);\n          resolve(result);\n        } catch (error) {\n          reject(error);\n        }\n      };\n\n      reader.onerror = function(this: FileReader, e: ProgressEvent<FileReader>) {\n        reject(this.error || new Error('Failed to read file'));\n      };\n    });\n  }\n\n  // --------------------------------------\n  // Extract a Blob from a ZipEntry\n\n  async extractBlob(entry: ZipEntry, skipHashCheck?: boolean): Promise<Blob | null> {\n    try {\n      const _outBuf = await this.extract(entry, skipHashCheck);\n      if (!_outBuf) return null;\n      \n      // Convert Buffer to Uint8Array for Blob compatibility\n      const uint8Array = new Uint8Array(_outBuf);\n      return new Blob([uint8Array], { type: 'application/octet-stream' });\n    } catch (error) {\n      throw error;\n    }\n  }\n\n  // --------------------------------------\n  // Create a ZIP file in memory and return a Blob\n\n  async createZipBlob(cmpOptions?: CompressOptions, options?: CreateZipOptions): Promise<Blob | null> {\n    const _onError = options?.onError || (() => {});\n    const _onEntryDone = options?.onEntryDone || (() => {});\n\n    const zipEntries = super.getDirectory();\n    if (!zipEntries) {\n      _onError(new Error(Errors.NO_FILES));\n      return null;\n    }\n\n    let offset = 0;\n    const buffers: Buffer[] = [];\n\n    for (const entry of zipEntries) {\n      if (!entry.isUpdated) {\n        // Check for META-INF metadata files even in copy mode\n        if (entry.filename === TOKENIZED_METADATA || entry.filename === TIMESTAMP_SUBMITTED || entry.filename === TIMESTAMP_METADATA) {\n          // Force this entry to be processed with special handling instead of copied\n          entry.isUpdated = true;\n          // Don't continue here - let it fall through to special handling below\n        } else {\n          const inData = await super.copyEntry(entry);\n          entry.localHdrOffset = offset;\n          offset += inData.length;\n          buffers.push(inData);\n          _onEntryDone(entry, 'Copied');\n          continue;\n        }\n      }\n\n      if (!entry.fileData) {\n        _onError(new Error(Errors.FILE_NOT_FOUND));\n        return null;\n      }\n\n      const fileBuffer = await entry.fileData.arrayBuffer();\n      \n      // Special handling for already-compressed entries - use existing compressed data\n      if (entry.cmpData && entry.compressedSize && entry.crc) {\n        // Entry is already compressed, use the existing compressed data\n        const localHdr = entry.createLocalHdr();\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + entry.cmpData.length;\n        \n        buffers.push(localHdr);\n        buffers.push(entry.cmpData);\n        _onEntryDone(entry, 'Written (pre-compressed)');\n        continue;\n      }\n      \n      // Special handling for META-INF metadata files - store uncompressed with CRC-32\n      if (entry.filename === TOKENIZED_METADATA || entry.filename === TIMESTAMP_SUBMITTED || entry.filename === TIMESTAMP_METADATA) {\n        // For metadata files, use STORED compression (no compression)\n        const buffer = Buffer.from(fileBuffer);\n        \n        // Calculate CRC-32 for the metadata file (not SHA-256 to avoid Merkle Root interference)\n        entry.crc = crc32(buffer);\n        \n        // Set up entry for STORED compression\n        entry.cmpMethod = 0; // STORED\n        entry.compressedSize = buffer.length;\n        entry.uncompressedSize = buffer.length;\n        \n        // Do NOT set SHA-256 hash for metadata files to avoid Merkle Root calculation\n        // entry.sha256 should remain undefined for metadata files\n        \n        const localHdr = entry.createLocalHdr();\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + buffer.length;\n        \n        buffers.push(localHdr);\n        buffers.push(buffer);\n        _onEntryDone(entry, 'Stored (metadata)');\n      } else {\n        // Normal file processing with compression\n        const cmpData = await this.compressData(entry, Buffer.from(fileBuffer), cmpOptions);\n        const localHdr = entry.createLocalHdr();\n\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + cmpData.length;\n\n        buffers.push(localHdr);\n        buffers.push(cmpData);\n        _onEntryDone(entry, 'Written');\n      }\n    }\n\n    const centralDirOffset = offset;\n    for (const entry of zipEntries) {\n      const centralDirEntry = entry.centralDirEntry();\n      offset += centralDirEntry.length;\n      buffers.push(centralDirEntry);\n    }\n\n    const centralDirSize = offset - centralDirOffset;\n    const ceBuf = super.centralEndHdr(centralDirSize, centralDirOffset);\n    buffers.push(ceBuf);\n\n    const combinedBuffer = Buffer.concat(buffers);\n    // Convert Buffer to Uint8Array for Blob compatibility\n    const uint8Array = new Uint8Array(combinedBuffer);\n    return new Blob([uint8Array], { type: 'application/zip' });\n  }\n\n  /**\n   * Checks if a filename is a metadata file (META-INF) that should be excluded from Merkle Root calculation\n   * @param filename - The filename to check\n   * @returns boolean - True if the file is a metadata file\n   */\n  private isMetadataFile(filename: string): boolean {\n    return filename === TIMESTAMP_SUBMITTED ||\n           filename === TIMESTAMP_METADATA ||\n           filename === TOKENIZED_METADATA;\n  }\n\n  // --------------------------------------\n  // Helper method: Add a file to the ZIP with compression\n  // Simplifies the common workflow of creating entry + compressing\n\n  async addFile(file: FileData, options?: CompressOptions): Promise<ZipEntry> {\n    // Create entry\n    const entry = this.createZipFileEntry(file);\n    \n    // Compress the file\n    // In browser, File objects implement both FileData and Blob interfaces\n    // We need to convert FileData to Blob for compressDataBlob\n    const fileBlob = file as unknown as Blob;\n    const compressedData = await this.compressDataBlob(entry, fileBlob, options);\n    entry.cmpData = compressedData;\n    \n    return entry;\n  }\n\n  // --------------------------------------\n  // Verify a ZIP entry by attempting to extract it\n  // Returns true if the entry is valid, false otherwise\n\n  async verifyEntry(entry: ZipEntry, skipHashCheck?: boolean): Promise<boolean> {\n    try {\n      const blob = await this.extractBlob(entry, skipHashCheck);\n      return blob !== null;\n    } catch (error) {\n      console.error(`Verification failed for ${entry.filename}:`, error);\n      return false;\n    }\n  }\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,cAAc;AACtB,YAAQ,gBAAgB;AAExB,QAAI,SAAS,CAAC;AACd,QAAI,YAAY,CAAC;AACjB,QAAI,MAAM,OAAO,eAAe,cAAc,aAAa;AAE3D,QAAI,OAAO;AACX,SAAS,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,aAAO,CAAC,IAAI,KAAK,CAAC;AAClB,gBAAU,KAAK,WAAW,CAAC,CAAC,IAAI;AAAA,IAClC;AAHS;AAAO;AAOhB,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAC/B,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAE/B,aAAS,QAAS,KAAK;AACrB,UAAIA,OAAM,IAAI;AAEd,UAAIA,OAAM,IAAI,GAAG;AACf,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAIA,UAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,UAAI,aAAa,GAAI,YAAWA;AAEhC,UAAI,kBAAkB,aAAaA,OAC/B,IACA,IAAK,WAAW;AAEpB,aAAO,CAAC,UAAU,eAAe;AAAA,IACnC;AAGA,aAAS,WAAY,KAAK;AACxB,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAC5B,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK;AACzB,UAAI;AACJ,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAE5B,UAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,eAAe,CAAC;AAE7D,UAAI,UAAU;AAGd,UAAIA,OAAM,kBAAkB,IACxB,WAAW,IACX;AAEJ,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAID,MAAKC,MAAK,GAAG;AAC3B,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,KACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACrC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC;AACjC,YAAI,SAAS,IAAK,OAAO,KAAM;AAC/B,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,IAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAiB,KAAK;AAC7B,aAAO,OAAO,OAAO,KAAK,EAAI,IAC5B,OAAO,OAAO,KAAK,EAAI,IACvB,OAAO,OAAO,IAAI,EAAI,IACtB,OAAO,MAAM,EAAI;AAAA,IACrB;AAEA,aAAS,YAAa,OAAO,OAAO,KAAK;AACvC,UAAI;AACJ,UAAI,SAAS,CAAC;AACd,eAASA,KAAI,OAAOA,KAAI,KAAKA,MAAK,GAAG;AACnC,eACI,MAAMA,EAAC,KAAK,KAAM,aAClB,MAAMA,KAAI,CAAC,KAAK,IAAK,UACtB,MAAMA,KAAI,CAAC,IAAI;AAClB,eAAO,KAAK,gBAAgB,GAAG,CAAC;AAAA,MAClC;AACA,aAAO,OAAO,KAAK,EAAE;AAAA,IACvB;AAEA,aAAS,cAAe,OAAO;AAC7B,UAAI;AACJ,UAAID,OAAM,MAAM;AAChB,UAAI,aAAaA,OAAM;AACvB,UAAI,QAAQ,CAAC;AACb,UAAI,iBAAiB;AAGrB,eAASC,KAAI,GAAGC,QAAOF,OAAM,YAAYC,KAAIC,OAAMD,MAAK,gBAAgB;AACtE,cAAM,KAAK,YAAY,OAAOA,IAAIA,KAAI,iBAAkBC,QAAOA,QAAQD,KAAI,cAAe,CAAC;AAAA,MAC7F;AAGA,UAAI,eAAe,GAAG;AACpB,cAAM,MAAMD,OAAM,CAAC;AACnB,cAAM;AAAA,UACJ,OAAO,OAAO,CAAC,IACf,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACF;AAAA,MACF,WAAW,eAAe,GAAG;AAC3B,eAAO,MAAMA,OAAM,CAAC,KAAK,KAAK,MAAMA,OAAM,CAAC;AAC3C,cAAM;AAAA,UACJ,OAAO,OAAO,EAAE,IAChB,OAAQ,OAAO,IAAK,EAAI,IACxB,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,KAAK,EAAE;AAAA,IACtB;AAAA;AAAA;;;ACrJA;AAAA;AACA,YAAQ,OAAO,SAAU,QAAQ,QAAQ,MAAM,MAAM,QAAQ;AAC3D,UAAI,GAAG;AACP,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,QAAQ;AACZ,UAAI,IAAI,OAAQ,SAAS,IAAK;AAC9B,UAAI,IAAI,OAAO,KAAK;AACpB,UAAI,IAAI,OAAO,SAAS,CAAC;AAEzB,WAAK;AAEL,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAO,OAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAC;AAE3E,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAO,OAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAC;AAE3E,UAAI,MAAM,GAAG;AACX,YAAI,IAAI;AAAA,MACV,WAAW,MAAM,MAAM;AACrB,eAAO,IAAI,OAAQ,IAAI,KAAK,KAAK;AAAA,MACnC,OAAO;AACL,YAAI,IAAI,KAAK,IAAI,GAAG,IAAI;AACxB,YAAI,IAAI;AAAA,MACV;AACA,cAAQ,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI;AAAA,IAChD;AAEA,YAAQ,QAAQ,SAAU,QAAQ,OAAO,QAAQ,MAAM,MAAM,QAAQ;AACnE,UAAI,GAAG,GAAG;AACV,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,KAAM,SAAS,KAAK,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAC9D,UAAI,IAAI,OAAO,IAAK,SAAS;AAC7B,UAAI,IAAI,OAAO,IAAI;AACnB,UAAI,IAAI,QAAQ,KAAM,UAAU,KAAK,IAAI,QAAQ,IAAK,IAAI;AAE1D,cAAQ,KAAK,IAAI,KAAK;AAEtB,UAAI,MAAM,KAAK,KAAK,UAAU,UAAU;AACtC,YAAI,MAAM,KAAK,IAAI,IAAI;AACvB,YAAI;AAAA,MACN,OAAO;AACL,YAAI,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;AACzC,YAAI,SAAS,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;AACrC;AACA,eAAK;AAAA,QACP;AACA,YAAI,IAAI,SAAS,GAAG;AAClB,mBAAS,KAAK;AAAA,QAChB,OAAO;AACL,mBAAS,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK;AAAA,QACrC;AACA,YAAI,QAAQ,KAAK,GAAG;AAClB;AACA,eAAK;AAAA,QACP;AAEA,YAAI,IAAI,SAAS,MAAM;AACrB,cAAI;AACJ,cAAI;AAAA,QACN,WAAW,IAAI,SAAS,GAAG;AACzB,eAAM,QAAQ,IAAK,KAAK,KAAK,IAAI,GAAG,IAAI;AACxC,cAAI,IAAI;AAAA,QACV,OAAO;AACL,cAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI;AACrD,cAAI;AAAA,QACN;AAAA,MACF;AAEA,aAAO,QAAQ,GAAG,OAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAC;AAE/E,UAAK,KAAK,OAAQ;AAClB,cAAQ;AACR,aAAO,OAAO,GAAG,OAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAC;AAE9E,aAAO,SAAS,IAAI,CAAC,KAAK,IAAI;AAAA,IAChC;AAAA;AAAA;;;ACpFA;AAAA;AAAA;AAUA,QAAM,SAAS;AACf,QAAM,UAAU;AAChB,QAAM,sBACH,OAAO,WAAW,cAAc,OAAO,OAAO,KAAK,MAAM,aACtD,OAAO,KAAK,EAAE,4BAA4B,IAC1C;AAEN,YAAQ,SAASG;AACjB,YAAQ,aAAa;AACrB,YAAQ,oBAAoB;AAE5B,QAAM,eAAe;AACrB,YAAQ,aAAa;AAgBrB,IAAAA,QAAO,sBAAsB,kBAAkB;AAE/C,QAAI,CAACA,QAAO,uBAAuB,OAAO,YAAY,eAClD,OAAO,QAAQ,UAAU,YAAY;AACvC,cAAQ;AAAA,QACN;AAAA,MAEF;AAAA,IACF;AAEA,aAAS,oBAAqB;AAE5B,UAAI;AACF,cAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,cAAM,QAAQ,EAAE,KAAK,WAAY;AAAE,iBAAO;AAAA,QAAG,EAAE;AAC/C,eAAO,eAAe,OAAO,WAAW,SAAS;AACjD,eAAO,eAAe,KAAK,KAAK;AAChC,eAAO,IAAI,IAAI,MAAM;AAAA,MACvB,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,MAChD,YAAY;AAAA,MACZ,KAAK,WAAY;AACf,YAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAED,WAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,MAChD,YAAY;AAAA,MACZ,KAAK,WAAY;AACf,YAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAED,aAAS,aAAc,QAAQ;AAC7B,UAAI,SAAS,cAAc;AACzB,cAAM,IAAI,WAAW,gBAAgB,SAAS,gCAAgC;AAAA,MAChF;AAEA,YAAM,MAAM,IAAI,WAAW,MAAM;AACjC,aAAO,eAAe,KAAKA,QAAO,SAAS;AAC3C,aAAO;AAAA,IACT;AAYA,aAASA,QAAQ,KAAK,kBAAkB,QAAQ;AAE9C,UAAI,OAAO,QAAQ,UAAU;AAC3B,YAAI,OAAO,qBAAqB,UAAU;AACxC,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AACA,eAAO,YAAY,GAAG;AAAA,MACxB;AACA,aAAO,KAAK,KAAK,kBAAkB,MAAM;AAAA,IAC3C;AAEA,IAAAA,QAAO,WAAW;AAElB,aAAS,KAAM,OAAO,kBAAkB,QAAQ;AAC9C,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,WAAW,OAAO,gBAAgB;AAAA,MAC3C;AAEA,UAAI,YAAY,OAAO,KAAK,GAAG;AAC7B,eAAO,cAAc,KAAK;AAAA,MAC5B;AAEA,UAAI,SAAS,MAAM;AACjB,cAAM,IAAI;AAAA,UACR,oHAC0C,OAAO;AAAA,QACnD;AAAA,MACF;AAEA,UAAI,WAAW,OAAO,WAAW,KAC5B,SAAS,WAAW,MAAM,QAAQ,WAAW,GAAI;AACpD,eAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,MACxD;AAEA,UAAI,OAAO,sBAAsB,gBAC5B,WAAW,OAAO,iBAAiB,KACnC,SAAS,WAAW,MAAM,QAAQ,iBAAiB,IAAK;AAC3D,eAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,MACxD;AAEA,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,WAAW,MAAM,QAAQ;AAC/C,UAAI,WAAW,QAAQ,YAAY,OAAO;AACxC,eAAOA,QAAO,KAAK,SAAS,kBAAkB,MAAM;AAAA,MACtD;AAEA,YAAM,IAAI,WAAW,KAAK;AAC1B,UAAI,EAAG,QAAO;AAEd,UAAI,OAAO,WAAW,eAAe,OAAO,eAAe,QACvD,OAAO,MAAM,OAAO,WAAW,MAAM,YAAY;AACnD,eAAOA,QAAO,KAAK,MAAM,OAAO,WAAW,EAAE,QAAQ,GAAG,kBAAkB,MAAM;AAAA,MAClF;AAEA,YAAM,IAAI;AAAA,QACR,oHAC0C,OAAO;AAAA,MACnD;AAAA,IACF;AAUA,IAAAA,QAAO,OAAO,SAAU,OAAO,kBAAkB,QAAQ;AACvD,aAAO,KAAK,OAAO,kBAAkB,MAAM;AAAA,IAC7C;AAIA,WAAO,eAAeA,QAAO,WAAW,WAAW,SAAS;AAC5D,WAAO,eAAeA,SAAQ,UAAU;AAExC,aAAS,WAAY,MAAM;AACzB,UAAI,OAAO,SAAS,UAAU;AAC5B,cAAM,IAAI,UAAU,wCAAwC;AAAA,MAC9D,WAAW,OAAO,GAAG;AACnB,cAAM,IAAI,WAAW,gBAAgB,OAAO,gCAAgC;AAAA,MAC9E;AAAA,IACF;AAEA,aAAS,MAAO,MAAM,MAAM,UAAU;AACpC,iBAAW,IAAI;AACf,UAAI,QAAQ,GAAG;AACb,eAAO,aAAa,IAAI;AAAA,MAC1B;AACA,UAAI,SAAS,QAAW;AAItB,eAAO,OAAO,aAAa,WACvB,aAAa,IAAI,EAAE,KAAK,MAAM,QAAQ,IACtC,aAAa,IAAI,EAAE,KAAK,IAAI;AAAA,MAClC;AACA,aAAO,aAAa,IAAI;AAAA,IAC1B;AAMA,IAAAA,QAAO,QAAQ,SAAU,MAAM,MAAM,UAAU;AAC7C,aAAO,MAAM,MAAM,MAAM,QAAQ;AAAA,IACnC;AAEA,aAAS,YAAa,MAAM;AAC1B,iBAAW,IAAI;AACf,aAAO,aAAa,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC;AAAA,IACtD;AAKA,IAAAA,QAAO,cAAc,SAAU,MAAM;AACnC,aAAO,YAAY,IAAI;AAAA,IACzB;AAIA,IAAAA,QAAO,kBAAkB,SAAU,MAAM;AACvC,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,aAAS,WAAY,QAAQ,UAAU;AACrC,UAAI,OAAO,aAAa,YAAY,aAAa,IAAI;AACnD,mBAAW;AAAA,MACb;AAEA,UAAI,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChC,cAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,MACrD;AAEA,YAAM,SAAS,WAAW,QAAQ,QAAQ,IAAI;AAC9C,UAAI,MAAM,aAAa,MAAM;AAE7B,YAAM,SAAS,IAAI,MAAM,QAAQ,QAAQ;AAEzC,UAAI,WAAW,QAAQ;AAIrB,cAAM,IAAI,MAAM,GAAG,MAAM;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,OAAO;AAC7B,YAAM,SAAS,MAAM,SAAS,IAAI,IAAI,QAAQ,MAAM,MAAM,IAAI;AAC9D,YAAM,MAAM,aAAa,MAAM;AAC/B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG;AAClC,YAAI,CAAC,IAAI,MAAM,CAAC,IAAI;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,WAAW;AACjC,UAAI,WAAW,WAAW,UAAU,GAAG;AACrC,cAAM,OAAO,IAAI,WAAW,SAAS;AACrC,eAAO,gBAAgB,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAAA,MACtE;AACA,aAAO,cAAc,SAAS;AAAA,IAChC;AAEA,aAAS,gBAAiB,OAAO,YAAY,QAAQ;AACnD,UAAI,aAAa,KAAK,MAAM,aAAa,YAAY;AACnD,cAAM,IAAI,WAAW,sCAAsC;AAAA,MAC7D;AAEA,UAAI,MAAM,aAAa,cAAc,UAAU,IAAI;AACjD,cAAM,IAAI,WAAW,sCAAsC;AAAA,MAC7D;AAEA,UAAI;AACJ,UAAI,eAAe,UAAa,WAAW,QAAW;AACpD,cAAM,IAAI,WAAW,KAAK;AAAA,MAC5B,WAAW,WAAW,QAAW;AAC/B,cAAM,IAAI,WAAW,OAAO,UAAU;AAAA,MACxC,OAAO;AACL,cAAM,IAAI,WAAW,OAAO,YAAY,MAAM;AAAA,MAChD;AAGA,aAAO,eAAe,KAAKA,QAAO,SAAS;AAE3C,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,KAAK;AACxB,UAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,cAAM,MAAM,QAAQ,IAAI,MAAM,IAAI;AAClC,cAAM,MAAM,aAAa,GAAG;AAE5B,YAAI,IAAI,WAAW,GAAG;AACpB,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,KAAK,GAAG,GAAG,GAAG;AACvB,eAAO;AAAA,MACT;AAEA,UAAI,IAAI,WAAW,QAAW;AAC5B,YAAI,OAAO,IAAI,WAAW,YAAY,YAAY,IAAI,MAAM,GAAG;AAC7D,iBAAO,aAAa,CAAC;AAAA,QACvB;AACA,eAAO,cAAc,GAAG;AAAA,MAC1B;AAEA,UAAI,IAAI,SAAS,YAAY,MAAM,QAAQ,IAAI,IAAI,GAAG;AACpD,eAAO,cAAc,IAAI,IAAI;AAAA,MAC/B;AAAA,IACF;AAEA,aAAS,QAAS,QAAQ;AAGxB,UAAI,UAAU,cAAc;AAC1B,cAAM,IAAI,WAAW,4DACa,aAAa,SAAS,EAAE,IAAI,QAAQ;AAAA,MACxE;AACA,aAAO,SAAS;AAAA,IAClB;AAEA,aAAS,WAAY,QAAQ;AAC3B,UAAI,CAAC,UAAU,QAAQ;AACrB,iBAAS;AAAA,MACX;AACA,aAAOA,QAAO,MAAM,CAAC,MAAM;AAAA,IAC7B;AAEA,IAAAA,QAAO,WAAW,SAAS,SAAU,GAAG;AACtC,aAAO,KAAK,QAAQ,EAAE,cAAc,QAClC,MAAMA,QAAO;AAAA,IACjB;AAEA,IAAAA,QAAO,UAAU,SAAS,QAAS,GAAG,GAAG;AACvC,UAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,UAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,UAAI,CAACA,QAAO,SAAS,CAAC,KAAK,CAACA,QAAO,SAAS,CAAC,GAAG;AAC9C,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,EAAG,QAAO;AAEpB,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AAEV,eAAS,IAAI,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,GAAG;AAClD,YAAI,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG;AACjB,cAAI,EAAE,CAAC;AACP,cAAI,EAAE,CAAC;AACP;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,EAAG,QAAO;AAClB,UAAI,IAAI,EAAG,QAAO;AAClB,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,aAAa,SAAS,WAAY,UAAU;AACjD,cAAQ,OAAO,QAAQ,EAAE,YAAY,GAAG;AAAA,QACtC,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO;AAAA,QACT;AACE,iBAAO;AAAA,MACX;AAAA,IACF;AAEA,IAAAA,QAAO,SAAS,SAAS,OAAQ,MAAM,QAAQ;AAC7C,UAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,cAAM,IAAI,UAAU,6CAA6C;AAAA,MACnE;AAEA,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOA,QAAO,MAAM,CAAC;AAAA,MACvB;AAEA,UAAI;AACJ,UAAI,WAAW,QAAW;AACxB,iBAAS;AACT,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,oBAAU,KAAK,CAAC,EAAE;AAAA,QACpB;AAAA,MACF;AAEA,YAAM,SAASA,QAAO,YAAY,MAAM;AACxC,UAAI,MAAM;AACV,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,YAAI,MAAM,KAAK,CAAC;AAChB,YAAI,WAAW,KAAK,UAAU,GAAG;AAC/B,cAAI,MAAM,IAAI,SAAS,OAAO,QAAQ;AACpC,gBAAI,CAACA,QAAO,SAAS,GAAG,EAAG,OAAMA,QAAO,KAAK,GAAG;AAChD,gBAAI,KAAK,QAAQ,GAAG;AAAA,UACtB,OAAO;AACL,uBAAW,UAAU,IAAI;AAAA,cACvB;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,CAACA,QAAO,SAAS,GAAG,GAAG;AAChC,gBAAM,IAAI,UAAU,6CAA6C;AAAA,QACnE,OAAO;AACL,cAAI,KAAK,QAAQ,GAAG;AAAA,QACtB;AACA,eAAO,IAAI;AAAA,MACb;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,QAAQ,UAAU;AACrC,UAAIA,QAAO,SAAS,MAAM,GAAG;AAC3B,eAAO,OAAO;AAAA,MAChB;AACA,UAAI,YAAY,OAAO,MAAM,KAAK,WAAW,QAAQ,WAAW,GAAG;AACjE,eAAO,OAAO;AAAA,MAChB;AACA,UAAI,OAAO,WAAW,UAAU;AAC9B,cAAM,IAAI;AAAA,UACR,6FACmB,OAAO;AAAA,QAC5B;AAAA,MACF;AAEA,YAAM,MAAM,OAAO;AACnB,YAAM,YAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM;AAC5D,UAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AAGpC,UAAI,cAAc;AAClB,iBAAS;AACP,gBAAQ,UAAU;AAAA,UAChB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,YAAY,MAAM,EAAE;AAAA,UAC7B,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,MAAM;AAAA,UACf,KAAK;AACH,mBAAO,QAAQ;AAAA,UACjB,KAAK;AACH,mBAAO,cAAc,MAAM,EAAE;AAAA,UAC/B;AACE,gBAAI,aAAa;AACf,qBAAO,YAAY,KAAK,YAAY,MAAM,EAAE;AAAA,YAC9C;AACA,wBAAY,KAAK,UAAU,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AACA,IAAAA,QAAO,aAAa;AAEpB,aAAS,aAAc,UAAU,OAAO,KAAK;AAC3C,UAAI,cAAc;AASlB,UAAI,UAAU,UAAa,QAAQ,GAAG;AACpC,gBAAQ;AAAA,MACV;AAGA,UAAI,QAAQ,KAAK,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,UAAa,MAAM,KAAK,QAAQ;AAC1C,cAAM,KAAK;AAAA,MACb;AAEA,UAAI,OAAO,GAAG;AACZ,eAAO;AAAA,MACT;AAGA,eAAS;AACT,iBAAW;AAEX,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,SAAU,YAAW;AAE1B,aAAO,MAAM;AACX,gBAAQ,UAAU;AAAA,UAChB,KAAK;AACH,mBAAO,SAAS,MAAM,OAAO,GAAG;AAAA,UAElC,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,OAAO,GAAG;AAAA,UAEnC,KAAK;AACH,mBAAO,WAAW,MAAM,OAAO,GAAG;AAAA,UAEpC,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,UAErC,KAAK;AACH,mBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,UAErC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,aAAa,MAAM,OAAO,GAAG;AAAA,UAEtC;AACE,gBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,wBAAY,WAAW,IAAI,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAQA,IAAAA,QAAO,UAAU,YAAY;AAE7B,aAAS,KAAM,GAAG,GAAG,GAAG;AACtB,YAAM,IAAI,EAAE,CAAC;AACb,QAAE,CAAC,IAAI,EAAE,CAAC;AACV,QAAE,CAAC,IAAI;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AAAA,MACrB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AACnB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AACnB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,WAAW,SAAS,WAAY;AAC/C,YAAM,SAAS,KAAK;AACpB,UAAI,WAAW,EAAG,QAAO;AACzB,UAAI,UAAU,WAAW,EAAG,QAAO,UAAU,MAAM,GAAG,MAAM;AAC5D,aAAO,aAAa,MAAM,MAAM,SAAS;AAAA,IAC3C;AAEA,IAAAA,QAAO,UAAU,iBAAiBA,QAAO,UAAU;AAEnD,IAAAA,QAAO,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC5C,UAAI,CAACA,QAAO,SAAS,CAAC,EAAG,OAAM,IAAI,UAAU,2BAA2B;AACxE,UAAI,SAAS,EAAG,QAAO;AACvB,aAAOA,QAAO,QAAQ,MAAM,CAAC,MAAM;AAAA,IACrC;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,UAAW;AAC7C,UAAI,MAAM;AACV,YAAM,MAAM,QAAQ;AACpB,YAAM,KAAK,SAAS,OAAO,GAAG,GAAG,EAAE,QAAQ,WAAW,KAAK,EAAE,KAAK;AAClE,UAAI,KAAK,SAAS,IAAK,QAAO;AAC9B,aAAO,aAAa,MAAM;AAAA,IAC5B;AACA,QAAI,qBAAqB;AACvB,MAAAA,QAAO,UAAU,mBAAmB,IAAIA,QAAO,UAAU;AAAA,IAC3D;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,QAAQ,OAAO,KAAK,WAAW,SAAS;AACnF,UAAI,WAAW,QAAQ,UAAU,GAAG;AAClC,iBAASA,QAAO,KAAK,QAAQ,OAAO,QAAQ,OAAO,UAAU;AAAA,MAC/D;AACA,UAAI,CAACA,QAAO,SAAS,MAAM,GAAG;AAC5B,cAAM,IAAI;AAAA,UACR,mFACoB,OAAO;AAAA,QAC7B;AAAA,MACF;AAEA,UAAI,UAAU,QAAW;AACvB,gBAAQ;AAAA,MACV;AACA,UAAI,QAAQ,QAAW;AACrB,cAAM,SAAS,OAAO,SAAS;AAAA,MACjC;AACA,UAAI,cAAc,QAAW;AAC3B,oBAAY;AAAA,MACd;AACA,UAAI,YAAY,QAAW;AACzB,kBAAU,KAAK;AAAA,MACjB;AAEA,UAAI,QAAQ,KAAK,MAAM,OAAO,UAAU,YAAY,KAAK,UAAU,KAAK,QAAQ;AAC9E,cAAM,IAAI,WAAW,oBAAoB;AAAA,MAC3C;AAEA,UAAI,aAAa,WAAW,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,UAAI,aAAa,SAAS;AACxB,eAAO;AAAA,MACT;AACA,UAAI,SAAS,KAAK;AAChB,eAAO;AAAA,MACT;AAEA,iBAAW;AACX,eAAS;AACT,qBAAe;AACf,mBAAa;AAEb,UAAI,SAAS,OAAQ,QAAO;AAE5B,UAAI,IAAI,UAAU;AAClB,UAAI,IAAI,MAAM;AACd,YAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AAEzB,YAAM,WAAW,KAAK,MAAM,WAAW,OAAO;AAC9C,YAAM,aAAa,OAAO,MAAM,OAAO,GAAG;AAE1C,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,YAAI,SAAS,CAAC,MAAM,WAAW,CAAC,GAAG;AACjC,cAAI,SAAS,CAAC;AACd,cAAI,WAAW,CAAC;AAChB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,EAAG,QAAO;AAClB,UAAI,IAAI,EAAG,QAAO;AAClB,aAAO;AAAA,IACT;AAWA,aAAS,qBAAsB,QAAQ,KAAK,YAAY,UAAU,KAAK;AAErE,UAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,UAAI,OAAO,eAAe,UAAU;AAClC,mBAAW;AACX,qBAAa;AAAA,MACf,WAAW,aAAa,YAAY;AAClC,qBAAa;AAAA,MACf,WAAW,aAAa,aAAa;AACnC,qBAAa;AAAA,MACf;AACA,mBAAa,CAAC;AACd,UAAI,YAAY,UAAU,GAAG;AAE3B,qBAAa,MAAM,IAAK,OAAO,SAAS;AAAA,MAC1C;AAGA,UAAI,aAAa,EAAG,cAAa,OAAO,SAAS;AACjD,UAAI,cAAc,OAAO,QAAQ;AAC/B,YAAI,IAAK,QAAO;AAAA,YACX,cAAa,OAAO,SAAS;AAAA,MACpC,WAAW,aAAa,GAAG;AACzB,YAAI,IAAK,cAAa;AAAA,YACjB,QAAO;AAAA,MACd;AAGA,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAMA,QAAO,KAAK,KAAK,QAAQ;AAAA,MACjC;AAGA,UAAIA,QAAO,SAAS,GAAG,GAAG;AAExB,YAAI,IAAI,WAAW,GAAG;AACpB,iBAAO;AAAA,QACT;AACA,eAAO,aAAa,QAAQ,KAAK,YAAY,UAAU,GAAG;AAAA,MAC5D,WAAW,OAAO,QAAQ,UAAU;AAClC,cAAM,MAAM;AACZ,YAAI,OAAO,WAAW,UAAU,YAAY,YAAY;AACtD,cAAI,KAAK;AACP,mBAAO,WAAW,UAAU,QAAQ,KAAK,QAAQ,KAAK,UAAU;AAAA,UAClE,OAAO;AACL,mBAAO,WAAW,UAAU,YAAY,KAAK,QAAQ,KAAK,UAAU;AAAA,UACtE;AAAA,QACF;AACA,eAAO,aAAa,QAAQ,CAAC,GAAG,GAAG,YAAY,UAAU,GAAG;AAAA,MAC9D;AAEA,YAAM,IAAI,UAAU,sCAAsC;AAAA,IAC5D;AAEA,aAAS,aAAc,KAAK,KAAK,YAAY,UAAU,KAAK;AAC1D,UAAI,YAAY;AAChB,UAAI,YAAY,IAAI;AACpB,UAAI,YAAY,IAAI;AAEpB,UAAI,aAAa,QAAW;AAC1B,mBAAW,OAAO,QAAQ,EAAE,YAAY;AACxC,YAAI,aAAa,UAAU,aAAa,WACpC,aAAa,aAAa,aAAa,YAAY;AACrD,cAAI,IAAI,SAAS,KAAK,IAAI,SAAS,GAAG;AACpC,mBAAO;AAAA,UACT;AACA,sBAAY;AACZ,uBAAa;AACb,uBAAa;AACb,wBAAc;AAAA,QAChB;AAAA,MACF;AAEA,eAAS,KAAM,KAAKC,IAAG;AACrB,YAAI,cAAc,GAAG;AACnB,iBAAO,IAAIA,EAAC;AAAA,QACd,OAAO;AACL,iBAAO,IAAI,aAAaA,KAAI,SAAS;AAAA,QACvC;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,KAAK;AACP,YAAI,aAAa;AACjB,aAAK,IAAI,YAAY,IAAI,WAAW,KAAK;AACvC,cAAI,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,eAAe,KAAK,IAAI,IAAI,UAAU,GAAG;AACtE,gBAAI,eAAe,GAAI,cAAa;AACpC,gBAAI,IAAI,aAAa,MAAM,UAAW,QAAO,aAAa;AAAA,UAC5D,OAAO;AACL,gBAAI,eAAe,GAAI,MAAK,IAAI;AAChC,yBAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF,OAAO;AACL,YAAI,aAAa,YAAY,UAAW,cAAa,YAAY;AACjE,aAAK,IAAI,YAAY,KAAK,GAAG,KAAK;AAChC,cAAI,QAAQ;AACZ,mBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,gBAAI,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG;AACrC,sBAAQ;AACR;AAAA,YACF;AAAA,UACF;AACA,cAAI,MAAO,QAAO;AAAA,QACpB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAD,QAAO,UAAU,WAAW,SAAS,SAAU,KAAK,YAAY,UAAU;AACxE,aAAO,KAAK,QAAQ,KAAK,YAAY,QAAQ,MAAM;AAAA,IACrD;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,KAAK,YAAY,UAAU;AACtE,aAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,IAAI;AAAA,IACnE;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,KAAK,YAAY,UAAU;AAC9E,aAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,KAAK;AAAA,IACpE;AAEA,aAAS,SAAU,KAAK,QAAQ,QAAQ,QAAQ;AAC9C,eAAS,OAAO,MAAM,KAAK;AAC3B,YAAM,YAAY,IAAI,SAAS;AAC/B,UAAI,CAAC,QAAQ;AACX,iBAAS;AAAA,MACX,OAAO;AACL,iBAAS,OAAO,MAAM;AACtB,YAAI,SAAS,WAAW;AACtB,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,YAAM,SAAS,OAAO;AAEtB,UAAI,SAAS,SAAS,GAAG;AACvB,iBAAS,SAAS;AAAA,MACpB;AACA,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,cAAM,SAAS,SAAS,OAAO,OAAO,IAAI,GAAG,CAAC,GAAG,EAAE;AACnD,YAAI,YAAY,MAAM,EAAG,QAAO;AAChC,YAAI,SAAS,CAAC,IAAI;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,aAAO,WAAW,YAAY,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IACjF;AAEA,aAAS,WAAY,KAAK,QAAQ,QAAQ,QAAQ;AAChD,aAAO,WAAW,aAAa,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IAC7D;AAEA,aAAS,YAAa,KAAK,QAAQ,QAAQ,QAAQ;AACjD,aAAO,WAAW,cAAc,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IAC9D;AAEA,aAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,aAAO,WAAW,eAAe,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IACpF;AAEA,IAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,QAAQ,QAAQ,QAAQ,UAAU;AAEzE,UAAI,WAAW,QAAW;AACxB,mBAAW;AACX,iBAAS,KAAK;AACd,iBAAS;AAAA,MAEX,WAAW,WAAW,UAAa,OAAO,WAAW,UAAU;AAC7D,mBAAW;AACX,iBAAS,KAAK;AACd,iBAAS;AAAA,MAEX,WAAW,SAAS,MAAM,GAAG;AAC3B,iBAAS,WAAW;AACpB,YAAI,SAAS,MAAM,GAAG;AACpB,mBAAS,WAAW;AACpB,cAAI,aAAa,OAAW,YAAW;AAAA,QACzC,OAAO;AACL,qBAAW;AACX,mBAAS;AAAA,QACX;AAAA,MACF,OAAO;AACL,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,SAAS;AAChC,UAAI,WAAW,UAAa,SAAS,UAAW,UAAS;AAEzD,UAAK,OAAO,SAAS,MAAM,SAAS,KAAK,SAAS,MAAO,SAAS,KAAK,QAAQ;AAC7E,cAAM,IAAI,WAAW,wCAAwC;AAAA,MAC/D;AAEA,UAAI,CAAC,SAAU,YAAW;AAE1B,UAAI,cAAc;AAClB,iBAAS;AACP,gBAAQ,UAAU;AAAA,UAChB,KAAK;AACH,mBAAO,SAAS,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE9C,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE/C,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,WAAW,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAEhD,KAAK;AAEH,mBAAO,YAAY,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAEjD,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE/C;AACE,gBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,wBAAY,KAAK,UAAU,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,CAAC;AAAA,MACvD;AAAA,IACF;AAEA,aAAS,YAAa,KAAK,OAAO,KAAK;AACrC,UAAI,UAAU,KAAK,QAAQ,IAAI,QAAQ;AACrC,eAAO,OAAO,cAAc,GAAG;AAAA,MACjC,OAAO;AACL,eAAO,OAAO,cAAc,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,UAAW,KAAK,OAAO,KAAK;AACnC,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAC9B,YAAM,MAAM,CAAC;AAEb,UAAI,IAAI;AACR,aAAO,IAAI,KAAK;AACd,cAAM,YAAY,IAAI,CAAC;AACvB,YAAI,YAAY;AAChB,YAAI,mBAAoB,YAAY,MAChC,IACC,YAAY,MACT,IACC,YAAY,MACT,IACA;AAEZ,YAAI,IAAI,oBAAoB,KAAK;AAC/B,cAAI,YAAY,WAAW,YAAY;AAEvC,kBAAQ,kBAAkB;AAAA,YACxB,KAAK;AACH,kBAAI,YAAY,KAAM;AACpB,4BAAY;AAAA,cACd;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,mBAAK,aAAa,SAAU,KAAM;AAChC,iCAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,oBAAI,gBAAgB,KAAM;AACxB,8BAAY;AAAA,gBACd;AAAA,cACF;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,0BAAY,IAAI,IAAI,CAAC;AACrB,mBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,iCAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AACrF,oBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,8BAAY;AAAA,gBACd;AAAA,cACF;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,0BAAY,IAAI,IAAI,CAAC;AACrB,2BAAa,IAAI,IAAI,CAAC;AACtB,mBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,iCAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,oBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,8BAAY;AAAA,gBACd;AAAA,cACF;AAAA,UACJ;AAAA,QACF;AAEA,YAAI,cAAc,MAAM;AAGtB,sBAAY;AACZ,6BAAmB;AAAA,QACrB,WAAW,YAAY,OAAQ;AAE7B,uBAAa;AACb,cAAI,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC1C,sBAAY,QAAS,YAAY;AAAA,QACnC;AAEA,YAAI,KAAK,SAAS;AAClB,aAAK;AAAA,MACP;AAEA,aAAO,sBAAsB,GAAG;AAAA,IAClC;AAKA,QAAM,uBAAuB;AAE7B,aAAS,sBAAuB,YAAY;AAC1C,YAAM,MAAM,WAAW;AACvB,UAAI,OAAO,sBAAsB;AAC/B,eAAO,OAAO,aAAa,MAAM,QAAQ,UAAU;AAAA,MACrD;AAGA,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,IAAI,KAAK;AACd,eAAO,OAAO,aAAa;AAAA,UACzB;AAAA,UACA,WAAW,MAAM,GAAG,KAAK,oBAAoB;AAAA,QAC/C;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,KAAK,OAAO,KAAK;AACpC,UAAI,MAAM;AACV,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,OAAO,aAAa,IAAI,CAAC,IAAI,GAAI;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAa,KAAK,OAAO,KAAK;AACrC,UAAI,MAAM;AACV,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,SAAU,KAAK,OAAO,KAAK;AAClC,YAAM,MAAM,IAAI;AAEhB,UAAI,CAAC,SAAS,QAAQ,EAAG,SAAQ;AACjC,UAAI,CAAC,OAAO,MAAM,KAAK,MAAM,IAAK,OAAM;AAExC,UAAI,MAAM;AACV,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,oBAAoB,IAAI,CAAC,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,aAAc,KAAK,OAAO,KAAK;AACtC,YAAM,QAAQ,IAAI,MAAM,OAAO,GAAG;AAClC,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,eAAO,OAAO,aAAa,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,IAAI,GAAI;AAAA,MAC5D;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,YAAM,MAAM,KAAK;AACjB,cAAQ,CAAC,CAAC;AACV,YAAM,QAAQ,SAAY,MAAM,CAAC,CAAC;AAElC,UAAI,QAAQ,GAAG;AACb,iBAAS;AACT,YAAI,QAAQ,EAAG,SAAQ;AAAA,MACzB,WAAW,QAAQ,KAAK;AACtB,gBAAQ;AAAA,MACV;AAEA,UAAI,MAAM,GAAG;AACX,eAAO;AACP,YAAI,MAAM,EAAG,OAAM;AAAA,MACrB,WAAW,MAAM,KAAK;AACpB,cAAM;AAAA,MACR;AAEA,UAAI,MAAM,MAAO,OAAM;AAEvB,YAAM,SAAS,KAAK,SAAS,OAAO,GAAG;AAEvC,aAAO,eAAe,QAAQA,QAAO,SAAS;AAE9C,aAAO;AAAA,IACT;AAKA,aAAS,YAAa,QAAQ,KAAK,QAAQ;AACzC,UAAK,SAAS,MAAO,KAAK,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAC/E,UAAI,SAAS,MAAM,OAAQ,OAAM,IAAI,WAAW,uCAAuC;AAAA,IACzF;AAEA,IAAAA,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQE,aAAY,UAAU;AAC/E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,eAAO,KAAK,SAAS,CAAC,IAAI;AAAA,MAC5B;AAEA,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQE,aAAY,UAAU;AAC/E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,oBAAY,QAAQA,aAAY,KAAK,MAAM;AAAA,MAC7C;AAEA,UAAI,MAAM,KAAK,SAAS,EAAEA,WAAU;AACpC,UAAI,MAAM;AACV,aAAOA,cAAa,MAAM,OAAO,MAAQ;AACvC,eAAO,KAAK,SAAS,EAAEA,WAAU,IAAI;AAAA,MACvC;AAEA,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,YACjBA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQ,UAAU;AACjE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,KAAK,MAAM;AAAA,IACpB;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAQ,KAAK,MAAM,KAAK,IAAK,KAAK,SAAS,CAAC;AAAA,IAC9C;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,cAAS,KAAK,MAAM,IACf,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,MACpB,KAAK,SAAS,CAAC,IAAI;AAAA,IAC1B;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,IAAI,YACnB,KAAK,SAAS,CAAC,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,IACrB,KAAK,SAAS,CAAC;AAAA,IACnB;AAEA,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAASG,iBAAiB,QAAQ;AACtF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,KAAK,QACT,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK;AAExB,YAAM,KAAK,KAAK,EAAE,MAAM,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,OAAO,KAAK;AAEd,aAAO,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IAC9C,CAAC;AAED,IAAAH,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,KAAK,QAAQ,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,YAAM,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,KAC/B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB;AAEF,cAAQ,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IAC/C,CAAC;AAED,IAAAA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQE,aAAY,UAAU;AAC7E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,eAAO,KAAK,SAAS,CAAC,IAAI;AAAA,MAC5B;AACA,aAAO;AAEP,UAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQE,aAAY,UAAU;AAC7E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,IAAIA;AACR,UAAI,MAAM;AACV,UAAI,MAAM,KAAK,SAAS,EAAE,CAAC;AAC3B,aAAO,IAAI,MAAM,OAAO,MAAQ;AAC9B,eAAO,KAAK,SAAS,EAAE,CAAC,IAAI;AAAA,MAC9B;AACA,aAAO;AAEP,UAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,WAAW,SAAS,SAAU,QAAQ,UAAU;AAC/D,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,UAAI,EAAE,KAAK,MAAM,IAAI,KAAO,QAAQ,KAAK,MAAM;AAC/C,cAAS,MAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IACtC;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,YAAM,MAAM,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAChD,aAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,YAAM,MAAM,KAAK,SAAS,CAAC,IAAK,KAAK,MAAM,KAAK;AAChD,aAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,IAChB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK;AAAA,IACzB;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC;AAAA,IACpB;AAEA,IAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,MAAM,KAAK,SAAS,CAAC,IACzB,KAAK,SAAS,CAAC,IAAI,KAAK,IACxB,KAAK,SAAS,CAAC,IAAI,KAAK,MACvB,QAAQ;AAEX,cAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,QACP,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE;AAAA,IAC5B,CAAC;AAED,IAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,OAAO,SAAS;AAAA,MACpB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,cAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,KAAK,EAAE,MAAM,IAAI,KAAK,KAC7B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,IAAI;AAAA,IACR,CAAC;AAED,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,IAC/C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,IAChD;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,IAC/C;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,IAChD;AAEA,aAAS,SAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACpD,UAAI,CAACA,QAAO,SAAS,GAAG,EAAG,OAAM,IAAI,UAAU,6CAA6C;AAC5F,UAAI,QAAQ,OAAO,QAAQ,IAAK,OAAM,IAAI,WAAW,mCAAmC;AACxF,UAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAAA,IAC1E;AAEA,IAAAA,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQE,aAAY,UAAU;AACxF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,cAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,iBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,MACvD;AAEA,UAAI,MAAM;AACV,UAAI,IAAI;AACR,WAAK,MAAM,IAAI,QAAQ;AACvB,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,aAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,MACrC;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQE,aAAY,UAAU;AACxF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,cAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,iBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,MACvD;AAEA,UAAI,IAAIA,cAAa;AACrB,UAAI,MAAM;AACV,WAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,aAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,aAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,MACrC;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQ,UAAU;AAC1E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,CAAC;AACvD,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,aAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,iBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,UAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,UAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,aAAO;AAAA,IACT;AAEA,aAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,iBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,UAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,UAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,MAAM,IAAI;AACd,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,aAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACpF,CAAC;AAED,IAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,aAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACpF,CAAC;AAED,IAAAA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQE,aAAY,UAAU;AACtF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,cAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,iBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,MAC7D;AAEA,UAAI,IAAI;AACR,UAAI,MAAM;AACV,UAAI,MAAM;AACV,WAAK,MAAM,IAAI,QAAQ;AACvB,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,YAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,gBAAM;AAAA,QACR;AACA,aAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,MAClD;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQE,aAAY,UAAU;AACtF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,cAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,iBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,MAC7D;AAEA,UAAI,IAAIA,cAAa;AACrB,UAAI,MAAM;AACV,UAAI,MAAM;AACV,WAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,aAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,YAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,gBAAM;AAAA,QACR;AACA,aAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,MAClD;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,YAAY,SAAS,UAAW,OAAO,QAAQ,UAAU;AACxE,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,IAAK;AAC3D,UAAI,QAAQ,EAAG,SAAQ,MAAO,QAAQ;AACtC,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,UAAI,QAAQ,EAAG,SAAQ,aAAa,QAAQ;AAC5C,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,aAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACxG,CAAC;AAED,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,aAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACxG,CAAC;AAED,aAAS,aAAc,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACxD,UAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AACxE,UAAI,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAAA,IAC3D;AAEA,aAAS,WAAY,KAAK,OAAO,QAAQ,cAAc,UAAU;AAC/D,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,qBAAa,KAAK,OAAO,QAAQ,GAAG,sBAAwB,qBAAuB;AAAA,MACrF;AACA,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,aAAO,WAAW,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,IACvD;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,aAAO,WAAW,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,IACxD;AAEA,aAAS,YAAa,KAAK,OAAO,QAAQ,cAAc,UAAU;AAChE,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,qBAAa,KAAK,OAAO,QAAQ,GAAG,uBAAyB,sBAAwB;AAAA,MACvF;AACA,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,aAAO,YAAY,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,IACxD;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,aAAO,YAAY,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,IACzD;AAGA,IAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,QAAQ,aAAa,OAAO,KAAK;AACtE,UAAI,CAACA,QAAO,SAAS,MAAM,EAAG,OAAM,IAAI,UAAU,6BAA6B;AAC/E,UAAI,CAAC,MAAO,SAAQ;AACpB,UAAI,CAAC,OAAO,QAAQ,EAAG,OAAM,KAAK;AAClC,UAAI,eAAe,OAAO,OAAQ,eAAc,OAAO;AACvD,UAAI,CAAC,YAAa,eAAc;AAChC,UAAI,MAAM,KAAK,MAAM,MAAO,OAAM;AAGlC,UAAI,QAAQ,MAAO,QAAO;AAC1B,UAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AAGrD,UAAI,cAAc,GAAG;AACnB,cAAM,IAAI,WAAW,2BAA2B;AAAA,MAClD;AACA,UAAI,QAAQ,KAAK,SAAS,KAAK,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAChF,UAAI,MAAM,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAG3D,UAAI,MAAM,KAAK,OAAQ,OAAM,KAAK;AAClC,UAAI,OAAO,SAAS,cAAc,MAAM,OAAO;AAC7C,cAAM,OAAO,SAAS,cAAc;AAAA,MACtC;AAEA,YAAM,MAAM,MAAM;AAElB,UAAI,SAAS,UAAU,OAAO,WAAW,UAAU,eAAe,YAAY;AAE5E,aAAK,WAAW,aAAa,OAAO,GAAG;AAAA,MACzC,OAAO;AACL,mBAAW,UAAU,IAAI;AAAA,UACvB;AAAA,UACA,KAAK,SAAS,OAAO,GAAG;AAAA,UACxB;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAMA,IAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,KAAK,OAAO,KAAK,UAAU;AAEhE,UAAI,OAAO,QAAQ,UAAU;AAC3B,YAAI,OAAO,UAAU,UAAU;AAC7B,qBAAW;AACX,kBAAQ;AACR,gBAAM,KAAK;AAAA,QACb,WAAW,OAAO,QAAQ,UAAU;AAClC,qBAAW;AACX,gBAAM,KAAK;AAAA,QACb;AACA,YAAI,aAAa,UAAa,OAAO,aAAa,UAAU;AAC1D,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QACjD;AACA,YAAI,OAAO,aAAa,YAAY,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChE,gBAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,QACrD;AACA,YAAI,IAAI,WAAW,GAAG;AACpB,gBAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,cAAK,aAAa,UAAU,OAAO,OAC/B,aAAa,UAAU;AAEzB,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF,WAAW,OAAO,QAAQ,UAAU;AAClC,cAAM,MAAM;AAAA,MACd,WAAW,OAAO,QAAQ,WAAW;AACnC,cAAM,OAAO,GAAG;AAAA,MAClB;AAGA,UAAI,QAAQ,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,KAAK;AACzD,cAAM,IAAI,WAAW,oBAAoB;AAAA,MAC3C;AAEA,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAEA,cAAQ,UAAU;AAClB,YAAM,QAAQ,SAAY,KAAK,SAAS,QAAQ;AAEhD,UAAI,CAAC,IAAK,OAAM;AAEhB,UAAI;AACJ,UAAI,OAAO,QAAQ,UAAU;AAC3B,aAAK,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC5B,eAAK,CAAC,IAAI;AAAA,QACZ;AAAA,MACF,OAAO;AACL,cAAM,QAAQA,QAAO,SAAS,GAAG,IAC7B,MACAA,QAAO,KAAK,KAAK,QAAQ;AAC7B,cAAM,MAAM,MAAM;AAClB,YAAI,QAAQ,GAAG;AACb,gBAAM,IAAI,UAAU,gBAAgB,MAClC,mCAAmC;AAAA,QACvC;AACA,aAAK,IAAI,GAAG,IAAI,MAAM,OAAO,EAAE,GAAG;AAChC,eAAK,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG;AAAA,QACjC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAMA,QAAM,SAAS,CAAC;AAChB,aAAS,EAAG,KAAK,YAAY,MAAM;AACjC,aAAO,GAAG,IAAI,MAAM,kBAAkB,KAAK;AAAA,QACzC,cAAe;AACb,gBAAM;AAEN,iBAAO,eAAe,MAAM,WAAW;AAAA,YACrC,OAAO,WAAW,MAAM,MAAM,SAAS;AAAA,YACvC,UAAU;AAAA,YACV,cAAc;AAAA,UAChB,CAAC;AAGD,eAAK,OAAO,GAAG,KAAK,IAAI,KAAK,GAAG;AAGhC,eAAK;AAEL,iBAAO,KAAK;AAAA,QACd;AAAA,QAEA,IAAI,OAAQ;AACV,iBAAO;AAAA,QACT;AAAA,QAEA,IAAI,KAAM,OAAO;AACf,iBAAO,eAAe,MAAM,QAAQ;AAAA,YAClC,cAAc;AAAA,YACd,YAAY;AAAA,YACZ;AAAA,YACA,UAAU;AAAA,UACZ,CAAC;AAAA,QACH;AAAA,QAEA,WAAY;AACV,iBAAO,GAAG,KAAK,IAAI,KAAK,GAAG,MAAM,KAAK,OAAO;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAEA;AAAA,MAAE;AAAA,MACA,SAAU,MAAM;AACd,YAAI,MAAM;AACR,iBAAO,GAAG,IAAI;AAAA,QAChB;AAEA,eAAO;AAAA,MACT;AAAA,MAAG;AAAA,IAAU;AACf;AAAA,MAAE;AAAA,MACA,SAAU,MAAM,QAAQ;AACtB,eAAO,QAAQ,IAAI,oDAAoD,OAAO,MAAM;AAAA,MACtF;AAAA,MAAG;AAAA,IAAS;AACd;AAAA,MAAE;AAAA,MACA,SAAU,KAAK,OAAO,OAAO;AAC3B,YAAI,MAAM,iBAAiB,GAAG;AAC9B,YAAI,WAAW;AACf,YAAI,OAAO,UAAU,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACxD,qBAAW,sBAAsB,OAAO,KAAK,CAAC;AAAA,QAChD,WAAW,OAAO,UAAU,UAAU;AACpC,qBAAW,OAAO,KAAK;AACvB,cAAI,QAAQ,OAAO,CAAC,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,OAAO,EAAE,IAAI;AACzE,uBAAW,sBAAsB,QAAQ;AAAA,UAC3C;AACA,sBAAY;AAAA,QACd;AACA,eAAO,eAAe,KAAK,cAAc,QAAQ;AACjD,eAAO;AAAA,MACT;AAAA,MAAG;AAAA,IAAU;AAEf,aAAS,sBAAuB,KAAK;AACnC,UAAI,MAAM;AACV,UAAI,IAAI,IAAI;AACZ,YAAM,QAAQ,IAAI,CAAC,MAAM,MAAM,IAAI;AACnC,aAAO,KAAK,QAAQ,GAAG,KAAK,GAAG;AAC7B,cAAM,IAAI,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,MACrC;AACA,aAAO,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,IACjC;AAKA,aAAS,YAAa,KAAK,QAAQE,aAAY;AAC7C,qBAAe,QAAQ,QAAQ;AAC/B,UAAI,IAAI,MAAM,MAAM,UAAa,IAAI,SAASA,WAAU,MAAM,QAAW;AACvE,oBAAY,QAAQ,IAAI,UAAUA,cAAa,EAAE;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,WAAY,OAAO,KAAK,KAAK,KAAK,QAAQA,aAAY;AAC7D,UAAI,QAAQ,OAAO,QAAQ,KAAK;AAC9B,cAAM,IAAI,OAAO,QAAQ,WAAW,MAAM;AAC1C,YAAI;AACJ,YAAIA,cAAa,GAAG;AAClB,cAAI,QAAQ,KAAK,QAAQ,OAAO,CAAC,GAAG;AAClC,oBAAQ,OAAO,CAAC,WAAW,CAAC,QAAQA,cAAa,KAAK,CAAC,GAAG,CAAC;AAAA,UAC7D,OAAO;AACL,oBAAQ,SAAS,CAAC,QAAQA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC,iBACzCA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,UACzC;AAAA,QACF,OAAO;AACL,kBAAQ,MAAM,GAAG,GAAG,CAAC,WAAW,GAAG,GAAG,CAAC;AAAA,QACzC;AACA,cAAM,IAAI,OAAO,iBAAiB,SAAS,OAAO,KAAK;AAAA,MACzD;AACA,kBAAY,KAAK,QAAQA,WAAU;AAAA,IACrC;AAEA,aAAS,eAAgB,OAAO,MAAM;AACpC,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI,OAAO,qBAAqB,MAAM,UAAU,KAAK;AAAA,MAC7D;AAAA,IACF;AAEA,aAAS,YAAa,OAAO,QAAQ,MAAM;AACzC,UAAI,KAAK,MAAM,KAAK,MAAM,OAAO;AAC/B,uBAAe,OAAO,IAAI;AAC1B,cAAM,IAAI,OAAO,iBAAiB,QAAQ,UAAU,cAAc,KAAK;AAAA,MACzE;AAEA,UAAI,SAAS,GAAG;AACd,cAAM,IAAI,OAAO,yBAAyB;AAAA,MAC5C;AAEA,YAAM,IAAI,OAAO;AAAA,QAAiB,QAAQ;AAAA,QACR,MAAM,OAAO,IAAI,CAAC,WAAW,MAAM;AAAA,QACnC;AAAA,MAAK;AAAA,IACzC;AAKA,QAAM,oBAAoB;AAE1B,aAAS,YAAa,KAAK;AAEzB,YAAM,IAAI,MAAM,GAAG,EAAE,CAAC;AAEtB,YAAM,IAAI,KAAK,EAAE,QAAQ,mBAAmB,EAAE;AAE9C,UAAI,IAAI,SAAS,EAAG,QAAO;AAE3B,aAAO,IAAI,SAAS,MAAM,GAAG;AAC3B,cAAM,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAa,QAAQ,OAAO;AACnC,cAAQ,SAAS;AACjB,UAAI;AACJ,YAAM,SAAS,OAAO;AACtB,UAAI,gBAAgB;AACpB,YAAM,QAAQ,CAAC;AAEf,eAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,oBAAY,OAAO,WAAW,CAAC;AAG/B,YAAI,YAAY,SAAU,YAAY,OAAQ;AAE5C,cAAI,CAAC,eAAe;AAElB,gBAAI,YAAY,OAAQ;AAEtB,mBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,YACF,WAAW,IAAI,MAAM,QAAQ;AAE3B,mBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,YACF;AAGA,4BAAgB;AAEhB;AAAA,UACF;AAGA,cAAI,YAAY,OAAQ;AACtB,iBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD,4BAAgB;AAChB;AAAA,UACF;AAGA,uBAAa,gBAAgB,SAAU,KAAK,YAAY,SAAU;AAAA,QACpE,WAAW,eAAe;AAExB,eAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAAA,QACpD;AAEA,wBAAgB;AAGhB,YAAI,YAAY,KAAM;AACpB,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM,KAAK,SAAS;AAAA,QACtB,WAAW,YAAY,MAAO;AAC5B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,IAAM;AAAA,YACnB,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,WAAW,YAAY,OAAS;AAC9B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,KAAM;AAAA,YACnB,aAAa,IAAM,KAAO;AAAA,YAC1B,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,WAAW,YAAY,SAAU;AAC/B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,KAAO;AAAA,YACpB,aAAa,KAAM,KAAO;AAAA,YAC1B,aAAa,IAAM,KAAO;AAAA,YAC1B,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,MAAM,oBAAoB;AAAA,QACtC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,aAAc,KAAK;AAC1B,YAAM,YAAY,CAAC;AACnB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AAEnC,kBAAU,KAAK,IAAI,WAAW,CAAC,IAAI,GAAI;AAAA,MACzC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,eAAgB,KAAK,OAAO;AACnC,UAAI,GAAG,IAAI;AACX,YAAM,YAAY,CAAC;AACnB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,aAAK,SAAS,KAAK,EAAG;AAEtB,YAAI,IAAI,WAAW,CAAC;AACpB,aAAK,KAAK;AACV,aAAK,IAAI;AACT,kBAAU,KAAK,EAAE;AACjB,kBAAU,KAAK,EAAE;AAAA,MACnB;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,KAAK;AAC3B,aAAO,OAAO,YAAY,YAAY,GAAG,CAAC;AAAA,IAC5C;AAEA,aAAS,WAAY,KAAK,KAAK,QAAQ,QAAQ;AAC7C,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,YAAK,IAAI,UAAU,IAAI,UAAY,KAAK,IAAI,OAAS;AACrD,YAAI,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAKA,aAAS,WAAY,KAAK,MAAM;AAC9B,aAAO,eAAe,QACnB,OAAO,QAAQ,IAAI,eAAe,QAAQ,IAAI,YAAY,QAAQ,QACjE,IAAI,YAAY,SAAS,KAAK;AAAA,IACpC;AACA,aAAS,YAAa,KAAK;AAEzB,aAAO,QAAQ;AAAA,IACjB;AAIA,QAAM,uBAAuB,WAAY;AACvC,YAAM,WAAW;AACjB,YAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAM,MAAM,IAAI;AAChB,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,gBAAM,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC;AAAA,QAC3C;AAAA,MACF;AACA,aAAO;AAAA,IACT,GAAG;AAGH,aAAS,mBAAoB,IAAI;AAC/B,aAAO,OAAO,WAAW,cAAc,yBAAyB;AAAA,IAClE;AAEA,aAAS,yBAA0B;AACjC,YAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAAA;AAAA;;;ACzjEA;AAAA;AAAA;AA8BA,QAAM,UAAwB;AAI9B,QAAM,WAAwB;AAC9B,QAAM,SAAwB;AAE9B,QAAM,YAAwB;AAK9B,aAAS,KAAK,KAAK;AAAE,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAG;AAAA,IAAE;AAIhF,QAAM,eAAe;AACrB,QAAM,eAAe;AACrB,QAAM,YAAe;AAGrB,QAAM,YAAe;AACrB,QAAM,YAAe;AAQrB,QAAM,eAAgB;AAGtB,QAAM,WAAgB;AAGtB,QAAM,UAAgB,WAAW,IAAI;AAGrC,QAAM,UAAgB;AAGtB,QAAM,WAAgB;AAGtB,QAAM,YAAgB,IAAI,UAAU;AAGpC,QAAM,WAAgB;AAGtB,QAAM,WAAgB;AAQtB,QAAM,cAAc;AAGpB,QAAM,YAAc;AAGpB,QAAM,UAAc;AAGpB,QAAM,YAAc;AAGpB,QAAM,cAAc;AAIpB,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,CAAC;AAAA;AAE5E,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,CAAC;AAAA;AAEtF,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,CAAC;AAAA;AAExD,QAAM,WACJ,IAAI,WAAW,CAAC,IAAG,IAAG,IAAG,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,EAAE,CAAC;AAajE,QAAM,gBAAgB;AAGtB,QAAM,eAAgB,IAAI,OAAO,UAAU,KAAK,CAAC;AACjD,SAAK,YAAY;AAOjB,QAAM,eAAgB,IAAI,MAAM,UAAU,CAAC;AAC3C,SAAK,YAAY;AAKjB,QAAM,aAAgB,IAAI,MAAM,aAAa;AAC7C,SAAK,UAAU;AAMf,QAAM,eAAgB,IAAI,MAAM,YAAY,YAAY,CAAC;AACzD,SAAK,YAAY;AAGjB,QAAM,cAAgB,IAAI,MAAM,YAAY;AAC5C,SAAK,WAAW;AAGhB,QAAM,YAAgB,IAAI,MAAM,OAAO;AACvC,SAAK,SAAS;AAId,aAAS,eAAe,aAAa,YAAY,YAAY,OAAO,YAAY;AAE9E,WAAK,cAAe;AACpB,WAAK,aAAe;AACpB,WAAK,aAAe;AACpB,WAAK,QAAe;AACpB,WAAK,aAAe;AAGpB,WAAK,YAAe,eAAe,YAAY;AAAA,IACjD;AAGA,QAAI;AACJ,QAAI;AACJ,QAAI;AAGJ,aAAS,SAAS,UAAU,WAAW;AACrC,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,YAAY;AAAA,IACnB;AAIA,QAAM,SAAS,CAAC,SAAS;AAEvB,aAAO,OAAO,MAAM,WAAW,IAAI,IAAI,WAAW,OAAO,SAAS,EAAE;AAAA,IACtE;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM;AAG1B,QAAE,YAAY,EAAE,SAAS,IAAK,IAAK;AACnC,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AAAA,IAC3C;AAOA,QAAM,YAAY,CAAC,GAAG,OAAO,WAAW;AAEtC,UAAI,EAAE,WAAY,WAAW,QAAS;AACpC,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS,SAAU,WAAW,EAAE;AAClC,UAAE,YAAY,SAAS;AAAA,MACzB,OAAO;AACL,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,UAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAGA,QAAM,YAAY,CAAC,GAAG,GAAG,SAAS;AAEhC;AAAA,QAAU;AAAA,QAAG,KAAK,IAAI,CAAC;AAAA,QAAY,KAAK,IAAI,IAAI,CAAC;AAAA;AAAA,MAAS;AAAA,IAC5D;AAQA,QAAM,aAAa,CAAC,MAAM,QAAQ;AAEhC,UAAI,MAAM;AACV,SAAG;AACD,eAAO,OAAO;AACd,kBAAU;AACV,gBAAQ;AAAA,MACV,SAAS,EAAE,MAAM;AACjB,aAAO,QAAQ;AAAA,IACjB;AAMA,QAAM,WAAW,CAAC,MAAM;AAEtB,UAAI,EAAE,aAAa,IAAI;AACrB,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS;AACX,UAAE,WAAW;AAAA,MAEf,WAAW,EAAE,YAAY,GAAG;AAC1B,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE,SAAS;AACxC,UAAE,WAAW;AACb,UAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAaA,QAAM,aAAa,CAAC,GAAG,SAAS;AAI9B,YAAM,OAAkB,KAAK;AAC7B,YAAM,WAAkB,KAAK;AAC7B,YAAM,QAAkB,KAAK,UAAU;AACvC,YAAM,YAAkB,KAAK,UAAU;AACvC,YAAM,QAAkB,KAAK,UAAU;AACvC,YAAM,OAAkB,KAAK,UAAU;AACvC,YAAM,aAAkB,KAAK,UAAU;AACvC,UAAI;AACJ,UAAI,GAAG;AACP,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW;AAEf,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,UAAE,SAAS,IAAI,IAAI;AAAA,MACrB;AAKA,WAAK,EAAE,KAAK,EAAE,QAAQ,IAAI,IAAI,CAAC,IAAY;AAE3C,WAAK,IAAI,EAAE,WAAW,GAAG,IAAI,WAAW,KAAK;AAC3C,YAAI,EAAE,KAAK,CAAC;AACZ,eAAO,KAAK,KAAK,IAAI,IAAI,CAAC,IAAY,IAAI,CAAC,IAAY;AACvD,YAAI,OAAO,YAAY;AACrB,iBAAO;AACP;AAAA,QACF;AACA,aAAK,IAAI,IAAI,CAAC,IAAY;AAG1B,YAAI,IAAI,UAAU;AAAE;AAAA,QAAU;AAE9B,UAAE,SAAS,IAAI;AACf,gBAAQ;AACR,YAAI,KAAK,MAAM;AACb,kBAAQ,MAAM,IAAI,IAAI;AAAA,QACxB;AACA,YAAI,KAAK,IAAI,CAAC;AACd,UAAE,WAAW,KAAK,OAAO;AACzB,YAAI,WAAW;AACb,YAAE,cAAc,KAAK,MAAM,IAAI,IAAI,CAAC,IAAY;AAAA,QAClD;AAAA,MACF;AACA,UAAI,aAAa,GAAG;AAAE;AAAA,MAAQ;AAM9B,SAAG;AACD,eAAO,aAAa;AACpB,eAAO,EAAE,SAAS,IAAI,MAAM,GAAG;AAAE;AAAA,QAAQ;AACzC,UAAE,SAAS,IAAI;AACf,UAAE,SAAS,OAAO,CAAC,KAAK;AACxB,UAAE,SAAS,UAAU;AAIrB,oBAAY;AAAA,MACd,SAAS,WAAW;AAOpB,WAAK,OAAO,YAAY,SAAS,GAAG,QAAQ;AAC1C,YAAI,EAAE,SAAS,IAAI;AACnB,eAAO,MAAM,GAAG;AACd,cAAI,EAAE,KAAK,EAAE,CAAC;AACd,cAAI,IAAI,UAAU;AAAE;AAAA,UAAU;AAC9B,cAAI,KAAK,IAAI,IAAI,CAAC,MAAc,MAAM;AAEpC,cAAE,YAAY,OAAO,KAAK,IAAI,IAAI,CAAC,KAAa,KAAK,IAAI,CAAC;AAC1D,iBAAK,IAAI,IAAI,CAAC,IAAY;AAAA,UAC5B;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAWA,QAAM,YAAY,CAAC,MAAM,UAAU,aAAa;AAK9C,YAAM,YAAY,IAAI,MAAM,WAAW,CAAC;AACxC,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AAKJ,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,eAAQ,OAAO,SAAS,OAAO,CAAC,KAAM;AACtC,kBAAU,IAAI,IAAI;AAAA,MACpB;AAQA,WAAK,IAAI,GAAI,KAAK,UAAU,KAAK;AAC/B,YAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AACxB,YAAI,QAAQ,GAAG;AAAE;AAAA,QAAU;AAE3B,aAAK,IAAI,CAAC,IAAa,WAAW,UAAU,GAAG,KAAK,GAAG;AAAA,MAIzD;AAAA,IACF;AAMA,QAAM,iBAAiB,MAAM;AAE3B,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,YAAM,WAAW,IAAI,MAAM,WAAW,CAAC;AAgBvC,eAAS;AACT,WAAK,OAAO,GAAG,OAAO,eAAe,GAAG,QAAQ;AAC9C,oBAAY,IAAI,IAAI;AACpB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,uBAAa,QAAQ,IAAI;AAAA,QAC3B;AAAA,MACF;AAMA,mBAAa,SAAS,CAAC,IAAI;AAG3B,aAAO;AACP,WAAK,OAAO,GAAG,OAAO,IAAI,QAAQ;AAChC,kBAAU,IAAI,IAAI;AAClB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,qBAAW,MAAM,IAAI;AAAA,QACvB;AAAA,MACF;AAEA,eAAS;AACT,aAAO,OAAO,SAAS,QAAQ;AAC7B,kBAAU,IAAI,IAAI,QAAQ;AAC1B,aAAK,IAAI,GAAG,IAAK,KAAM,YAAY,IAAI,IAAI,GAAK,KAAK;AACnD,qBAAW,MAAM,MAAM,IAAI;AAAA,QAC7B;AAAA,MACF;AAIA,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,iBAAS,IAAI,IAAI;AAAA,MACnB;AAEA,UAAI;AACJ,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AAKA,gBAAU,cAAc,UAAU,GAAG,QAAQ;AAG7C,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC,qBAAa,IAAI,CAAC,IAAa,WAAW,GAAG,CAAC;AAAA,MAChD;AAGA,sBAAgB,IAAI,eAAe,cAAc,aAAa,WAAW,GAAG,SAAS,QAAQ;AAC7F,sBAAgB,IAAI,eAAe,cAAc,aAAa,GAAY,SAAS,QAAQ;AAC3F,uBAAiB,IAAI,eAAe,IAAI,MAAM,CAAC,GAAG,cAAc,GAAW,UAAU,WAAW;AAAA,IAGlG;AAMA,QAAM,aAAa,CAAC,MAAM;AAExB,UAAI;AAGJ,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAG;AAClE,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAG;AAClE,WAAK,IAAI,GAAG,IAAI,UAAU,KAAK;AAAE,UAAE,QAAQ,IAAI,CAAC,IAAa;AAAA,MAAG;AAEhE,QAAE,UAAU,YAAY,CAAC,IAAa;AACtC,QAAE,UAAU,EAAE,aAAa;AAC3B,QAAE,WAAW,EAAE,UAAU;AAAA,IAC3B;AAMA,QAAM,YAAY,CAAC,MACnB;AACE,UAAI,EAAE,WAAW,GAAG;AAClB,kBAAU,GAAG,EAAE,MAAM;AAAA,MACvB,WAAW,EAAE,WAAW,GAAG;AAEzB,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE;AAAA,MACjC;AACA,QAAE,SAAS;AACX,QAAE,WAAW;AAAA,IACf;AAMA,QAAM,UAAU,CAAC,MAAM,GAAG,GAAG,UAAU;AAErC,YAAM,MAAM,IAAI;AAChB,YAAM,MAAM,IAAI;AAChB,aAAQ,KAAK,GAAG,IAAa,KAAK,GAAG,KAC7B,KAAK,GAAG,MAAe,KAAK,GAAG,KAAc,MAAM,CAAC,KAAK,MAAM,CAAC;AAAA,IAC1E;AAQA,QAAM,aAAa,CAAC,GAAG,MAAM,MAAM;AAKjC,YAAM,IAAI,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,KAAK;AACb,aAAO,KAAK,EAAE,UAAU;AAEtB,YAAI,IAAI,EAAE,YACR,QAAQ,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAClD;AAAA,QACF;AAEA,YAAI,QAAQ,MAAM,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAAE;AAAA,QAAO;AAGnD,UAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AACpB,YAAI;AAGJ,cAAM;AAAA,MACR;AACA,QAAE,KAAK,CAAC,IAAI;AAAA,IACd;AASA,QAAM,iBAAiB,CAAC,GAAG,OAAO,UAAU;AAK1C,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AAEJ,UAAI,EAAE,aAAa,GAAG;AACpB,WAAG;AACD,iBAAO,EAAE,YAAY,EAAE,UAAU,IAAI,IAAI;AACzC,mBAAS,EAAE,YAAY,EAAE,UAAU,IAAI,IAAI,QAAS;AACpD,eAAK,EAAE,YAAY,EAAE,UAAU,IAAI;AACnC,cAAI,SAAS,GAAG;AACd,sBAAU,GAAG,IAAI,KAAK;AAAA,UAExB,OAAO;AAEL,mBAAO,aAAa,EAAE;AACtB,sBAAU,GAAG,OAAO,WAAW,GAAG,KAAK;AACvC,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,oBAAM,YAAY,IAAI;AACtB,wBAAU,GAAG,IAAI,KAAK;AAAA,YACxB;AACA;AACA,mBAAO,OAAO,IAAI;AAGlB,sBAAU,GAAG,MAAM,KAAK;AACxB,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,sBAAQ,UAAU,IAAI;AACtB,wBAAU,GAAG,MAAM,KAAK;AAAA,YAC1B;AAAA,UACF;AAAA,QAKF,SAAS,KAAK,EAAE;AAAA,MAClB;AAEA,gBAAU,GAAG,WAAW,KAAK;AAAA,IAC/B;AAWA,QAAM,aAAa,CAAC,GAAG,SAAS;AAI9B,YAAM,OAAW,KAAK;AACtB,YAAM,QAAW,KAAK,UAAU;AAChC,YAAM,YAAY,KAAK,UAAU;AACjC,YAAM,QAAW,KAAK,UAAU;AAChC,UAAI,GAAG;AACP,UAAI,WAAW;AACf,UAAI;AAMJ,QAAE,WAAW;AACb,QAAE,WAAW;AAEb,WAAK,IAAI,GAAG,IAAI,OAAO,KAAK;AAC1B,YAAI,KAAK,IAAI,CAAC,MAAe,GAAG;AAC9B,YAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,WAAW;AAClC,YAAE,MAAM,CAAC,IAAI;AAAA,QAEf,OAAO;AACL,eAAK,IAAI,IAAI,CAAC,IAAY;AAAA,QAC5B;AAAA,MACF;AAOA,aAAO,EAAE,WAAW,GAAG;AACrB,eAAO,EAAE,KAAK,EAAE,EAAE,QAAQ,IAAK,WAAW,IAAI,EAAE,WAAW;AAC3D,aAAK,OAAO,CAAC,IAAa;AAC1B,UAAE,MAAM,IAAI,IAAI;AAChB,UAAE;AAEF,YAAI,WAAW;AACb,YAAE,cAAc,MAAM,OAAO,IAAI,CAAC;AAAA,QACpC;AAAA,MAEF;AACA,WAAK,WAAW;AAKhB,WAAK,IAAK,EAAE,YAAY,GAAc,KAAK,GAAG,KAAK;AAAE,mBAAW,GAAG,MAAM,CAAC;AAAA,MAAG;AAK7E,aAAO;AACP,SAAG;AAGD,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA,QAAa;AACxB,UAAE;AAAA,UAAK;AAAA;AAAA,QAAa,IAAI,EAAE,KAAK,EAAE,UAAU;AAC3C;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAa;AAGjC,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA,QAAa;AAExB,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AACvB,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AAGvB,aAAK,OAAO,CAAC,IAAa,KAAK,IAAI,CAAC,IAAa,KAAK,IAAI,CAAC;AAC3D,UAAE,MAAM,IAAI,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK;AACvE,aAAK,IAAI,IAAI,CAAC,IAAY,KAAK,IAAI,IAAI,CAAC,IAAY;AAGpD,UAAE;AAAA,UAAK;AAAA;AAAA,QAAa,IAAI;AACxB;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAa;AAAA,MAEnC,SAAS,EAAE,YAAY;AAEvB,QAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,EAAE;AAAA,QAAK;AAAA;AAAA,MAAa;AAK3C,iBAAW,GAAG,IAAI;AAGlB,gBAAU,MAAM,UAAU,EAAE,QAAQ;AAAA,IACtC;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM,aAAa;AAKvC,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAEhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MACd;AACA,YAAM,WAAW,KAAK,IAAI,CAAC,IAAY;AAEvC,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEF,WAAW,QAAQ,WAAW;AAC5B,YAAE,QAAQ,SAAS,CAAC,KAAc;AAAA,QAEpC,WAAW,WAAW,GAAG;AAEvB,cAAI,WAAW,SAAS;AAAE,cAAE,QAAQ,SAAS,CAAC;AAAA,UAAc;AAC5D,YAAE,QAAQ,UAAU,CAAC;AAAA,QAEvB,WAAW,SAAS,IAAI;AACtB,YAAE,QAAQ,YAAY,CAAC;AAAA,QAEzB,OAAO;AACL,YAAE,QAAQ,cAAc,CAAC;AAAA,QAC3B;AAEA,gBAAQ;AACR,kBAAU;AAEV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAEd,WAAW,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAEd,OAAO;AACL,sBAAY;AACZ,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM,aAAa;AAKvC,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAGhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MACd;AAEA,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEF,WAAW,QAAQ,WAAW;AAC5B,aAAG;AAAE,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAAA,UAAG,SAAS,EAAE,UAAU;AAAA,QAE7D,WAAW,WAAW,GAAG;AACvB,cAAI,WAAW,SAAS;AACtB,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAC9B;AAAA,UACF;AAEA,oBAAU,GAAG,SAAS,EAAE,OAAO;AAC/B,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE3B,WAAW,SAAS,IAAI;AACtB,oBAAU,GAAG,WAAW,EAAE,OAAO;AACjC,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE3B,OAAO;AACL,oBAAU,GAAG,aAAa,EAAE,OAAO;AACnC,oBAAU,GAAG,QAAQ,IAAI,CAAC;AAAA,QAC5B;AAEA,gBAAQ;AACR,kBAAU;AACV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAEd,WAAW,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAEd,OAAO;AACL,sBAAY;AACZ,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAOA,QAAM,gBAAgB,CAAC,MAAM;AAE3B,UAAI;AAGJ,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAC3C,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAG3C,iBAAW,GAAG,EAAE,OAAO;AASvB,WAAK,cAAc,WAAW,GAAG,eAAe,GAAG,eAAe;AAChE,YAAI,EAAE,QAAQ,SAAS,WAAW,IAAI,IAAI,CAAC,MAAc,GAAG;AAC1D;AAAA,QACF;AAAA,MACF;AAEA,QAAE,WAAW,KAAK,cAAc,KAAK,IAAI,IAAI;AAI7C,aAAO;AAAA,IACT;AAQA,QAAM,iBAAiB,CAAC,GAAG,QAAQ,QAAQ,YAAY;AAIrD,UAAI;AAMJ,gBAAU,GAAG,SAAS,KAAK,CAAC;AAC5B,gBAAU,GAAG,SAAS,GAAK,CAAC;AAC5B,gBAAU,GAAG,UAAU,GAAI,CAAC;AAC5B,WAAK,OAAO,GAAG,OAAO,SAAS,QAAQ;AAErC,kBAAU,GAAG,EAAE,QAAQ,SAAS,IAAI,IAAI,IAAI,CAAC,GAAW,CAAC;AAAA,MAC3D;AAGA,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAGpC,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAAA,IAEtC;AAgBA,QAAM,mBAAmB,CAAC,MAAM;AAK9B,UAAI,aAAa;AACjB,UAAI;AAGJ,WAAK,IAAI,GAAG,KAAK,IAAI,KAAK,gBAAgB,GAAG;AAC3C,YAAK,aAAa,KAAO,EAAE,UAAU,IAAI,CAAC,MAAe,GAAI;AAC3D,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,UAAI,EAAE,UAAU,IAAI,CAAC,MAAe,KAAK,EAAE,UAAU,KAAK,CAAC,MAAe,KACtE,EAAE,UAAU,KAAK,CAAC,MAAe,GAAG;AACtC,eAAO;AAAA,MACT;AACA,WAAK,IAAI,IAAI,IAAI,UAAU,KAAK;AAC9B,YAAI,EAAE,UAAU,IAAI,CAAC,MAAe,GAAG;AACrC,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,aAAO;AAAA,IACT;AAGA,QAAI,mBAAmB;AAKvB,QAAM,WAAW,CAAC,MAClB;AAEE,UAAI,CAAC,kBAAkB;AACrB,uBAAe;AACf,2BAAmB;AAAA,MACrB;AAEA,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,UAAU,IAAI,SAAS,EAAE,SAAS,cAAc;AAElD,QAAE,SAAS;AACX,QAAE,WAAW;AAGb,iBAAW,CAAC;AAAA,IACd;AAMA,QAAM,mBAAmB,CAAC,GAAG,KAAK,YAAY,SAAS;AAMrD,gBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,gBAAU,CAAC;AACX,gBAAU,GAAG,UAAU;AACvB,gBAAU,GAAG,CAAC,UAAU;AACxB,UAAI,YAAY;AACd,UAAE,YAAY,IAAI,EAAE,OAAO,SAAS,KAAK,MAAM,UAAU,GAAG,EAAE,OAAO;AAAA,MACvE;AACA,QAAE,WAAW;AAAA,IACf;AAOA,QAAM,YAAY,CAAC,MAAM;AACvB,gBAAU,GAAG,gBAAgB,GAAG,CAAC;AACjC,gBAAU,GAAG,WAAW,YAAY;AACpC,eAAS,CAAC;AAAA,IACZ;AAOA,QAAM,kBAAkB,CAAC,GAAG,KAAK,YAAY,SAAS;AAMpD,UAAI,UAAU;AACd,UAAI,cAAc;AAGlB,UAAI,EAAE,QAAQ,GAAG;AAGf,YAAI,EAAE,KAAK,cAAc,WAAW;AAClC,YAAE,KAAK,YAAY,iBAAiB,CAAC;AAAA,QACvC;AAGA,mBAAW,GAAG,EAAE,MAAM;AAItB,mBAAW,GAAG,EAAE,MAAM;AAUtB,sBAAc,cAAc,CAAC;AAG7B,mBAAY,EAAE,UAAU,IAAI,MAAO;AACnC,sBAAe,EAAE,aAAa,IAAI,MAAO;AAMzC,YAAI,eAAe,UAAU;AAAE,qBAAW;AAAA,QAAa;AAAA,MAEzD,OAAO;AAEL,mBAAW,cAAc,aAAa;AAAA,MACxC;AAEA,UAAK,aAAa,KAAK,YAAc,QAAQ,IAAK;AAShD,yBAAiB,GAAG,KAAK,YAAY,IAAI;AAAA,MAE3C,WAAW,EAAE,aAAa,WAAW,gBAAgB,UAAU;AAE7D,kBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,uBAAe,GAAG,cAAc,YAAY;AAAA,MAE9C,OAAO;AACL,kBAAU,IAAI,aAAa,MAAM,OAAO,IAAI,IAAI,CAAC;AACjD,uBAAe,GAAG,EAAE,OAAO,WAAW,GAAG,EAAE,OAAO,WAAW,GAAG,cAAc,CAAC;AAC/E,uBAAe,GAAG,EAAE,WAAW,EAAE,SAAS;AAAA,MAC5C;AAKA,iBAAW,CAAC;AAEZ,UAAI,MAAM;AACR,kBAAU,CAAC;AAAA,MACb;AAAA,IAGF;AAMA,QAAM,YAAY,CAAC,GAAG,MAAM,OAAO;AAKjC,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI;AAC1C,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI,QAAQ;AAClD,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI;AAC1C,UAAI,SAAS,GAAG;AAEd,UAAE,UAAU,KAAK,CAAC;AAAA,MACpB,OAAO;AACL,UAAE;AAEF;AAKA,UAAE,WAAW,aAAa,EAAE,IAAI,WAAW,KAAK,CAAC;AACjD,UAAE,UAAU,OAAO,IAAI,IAAI,CAAC;AAAA,MAC9B;AAEA,aAAQ,EAAE,aAAa,EAAE;AAAA,IAC3B;AAEA,WAAO,QAAQ,WAAY;AAC3B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,kBAAmB;AAClC,WAAO,QAAQ,YAAY;AAC3B,WAAO,QAAQ,YAAY;AAAA;AAAA;;;AC1pC3B;AAAA;AAAA;AAyBA,QAAM,UAAU,CAAC,OAAO,KAAK,KAAK,QAAQ;AACxC,UAAI,KAAM,QAAQ,QAAS,GACvB,KAAO,UAAU,KAAM,QAAS,GAChC,IAAI;AAER,aAAO,QAAQ,GAAG;AAIhB,YAAI,MAAM,MAAO,MAAO;AACxB,eAAO;AAEP,WAAG;AACD,eAAM,KAAK,IAAI,KAAK,IAAI;AACxB,eAAM,KAAK,KAAK;AAAA,QAClB,SAAS,EAAE;AAEX,cAAM;AACN,cAAM;AAAA,MACR;AAEA,aAAQ,KAAM,MAAM,KAAM;AAAA,IAC5B;AAGA,WAAO,UAAU;AAAA;AAAA;;;AClDjB;AAAA;AAAA;AA0BA,QAAM,YAAY,MAAM;AACtB,UAAI,GAAG,QAAQ,CAAC;AAEhB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAI;AACJ,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,IAAI,IAAM,aAAc,MAAM,IAAO,MAAM;AAAA,QACnD;AACA,cAAM,CAAC,IAAI;AAAA,MACb;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,WAAW,IAAI,YAAY,UAAU,CAAC;AAG5C,QAAME,SAAQ,CAAC,KAAK,KAAK,KAAK,QAAQ;AACpC,YAAM,IAAI;AACV,YAAM,MAAM,MAAM;AAElB,aAAO;AAEP,eAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,cAAO,QAAQ,IAAK,GAAG,MAAM,IAAI,CAAC,KAAK,GAAI;AAAA,MAC7C;AAEA,aAAQ,MAAO;AAAA,IACjB;AAGA,WAAO,UAAUA;AAAA;AAAA;;;AC1DjB;AAAA;AAAA;AAqBA,WAAO,UAAU;AAAA,MACf,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,IACV;AAAA;AAAA;;;AC/BA;AAAA;AAAA;AAqBA,WAAO,UAAU;AAAA;AAAA,MAGf,YAAoB;AAAA,MACpB,iBAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,UAAoB;AAAA,MACpB,SAAoB;AAAA,MACpB,SAAoB;AAAA;AAAA;AAAA;AAAA,MAKpB,MAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,aAAoB;AAAA,MACpB,SAAmB;AAAA,MACnB,gBAAmB;AAAA,MACnB,cAAmB;AAAA,MACnB,aAAmB;AAAA,MACnB,aAAmB;AAAA;AAAA;AAAA,MAInB,kBAA0B;AAAA,MAC1B,cAA0B;AAAA,MAC1B,oBAA0B;AAAA,MAC1B,uBAAyB;AAAA,MAGzB,YAA0B;AAAA,MAC1B,gBAA0B;AAAA,MAC1B,OAA0B;AAAA,MAC1B,SAA0B;AAAA,MAC1B,oBAA0B;AAAA;AAAA,MAG1B,UAA0B;AAAA,MAC1B,QAA0B;AAAA;AAAA,MAE1B,WAA0B;AAAA;AAAA,MAG1B,YAA0B;AAAA;AAAA,IAE5B;AAAA;AAAA;;;ACnEA;AAAA;AAAA;AAqBA,QAAM,EAAE,UAAU,kBAAkB,iBAAiB,WAAW,UAAU,IAAI;AAC9E,QAAM,UAAU;AAChB,QAAMC,SAAU;AAChB,QAAM,MAAU;AAKhB,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MAAiB;AAAA,MAAc;AAAA,MAAU;AAAA,MACrD;AAAA,MAAM;AAAA,MAAc;AAAA,MAAgB;AAAA,MAAc;AAAA,MAClD;AAAA,MACA;AAAA,MAAY;AAAA,MAAgB;AAAA,MAAO;AAAA,MAAS;AAAA,MAC5C;AAAA,MACA;AAAA,IACF,IAAI;AAKJ,QAAM,gBAAgB;AAEtB,QAAM,YAAY;AAElB,QAAM,gBAAgB;AAGtB,QAAM,eAAgB;AAEtB,QAAM,WAAgB;AAEtB,QAAM,UAAgB,WAAW,IAAI;AAErC,QAAM,UAAgB;AAEtB,QAAM,WAAgB;AAEtB,QAAM,YAAgB,IAAI,UAAU;AAEpC,QAAM,WAAY;AAGlB,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,gBAAiB,YAAY,YAAY;AAE/C,QAAM,cAAc;AAEpB,QAAM,aAAiB;AAEvB,QAAM,aAAiB;AAEvB,QAAM,cAAiB;AACvB,QAAM,aAAiB;AACvB,QAAM,gBAAiB;AACvB,QAAM,aAAgB;AACtB,QAAM,aAAgB;AACtB,QAAM,eAAgB;AAEtB,QAAM,eAAoB;AAC1B,QAAM,gBAAoB;AAC1B,QAAM,oBAAoB;AAC1B,QAAM,iBAAoB;AAE1B,QAAM,UAAU;AAEhB,QAAM,MAAM,CAAC,MAAM,cAAc;AAC/B,WAAK,MAAM,IAAI,SAAS;AACxB,aAAO;AAAA,IACT;AAEA,QAAM,OAAO,CAAC,MAAM;AAClB,aAAS,IAAK,KAAO,IAAK,IAAI,IAAI;AAAA,IACpC;AAEA,QAAM,OAAO,CAAC,QAAQ;AACpB,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAG;AAAA,IAC3D;AAOA,QAAM,aAAa,CAAC,MAAM;AACxB,UAAI,GAAG;AACP,UAAI;AACJ,UAAI,QAAQ,EAAE;AAEd,UAAI,EAAE;AACN,UAAI;AACJ,SAAG;AACD,YAAI,EAAE,KAAK,EAAE,CAAC;AACd,UAAE,KAAK,CAAC,IAAK,KAAK,QAAQ,IAAI,QAAQ;AAAA,MACxC,SAAS,EAAE;AACX,UAAI;AAEJ,UAAI;AACJ,SAAG;AACD,YAAI,EAAE,KAAK,EAAE,CAAC;AACd,UAAE,KAAK,CAAC,IAAK,KAAK,QAAQ,IAAI,QAAQ;AAAA,MAIxC,SAAS,EAAE;AAAA,IAEb;AAGA,QAAI,OAAO,CAAC,GAAG,MAAM,UAAW,QAAQ,EAAE,aAAc,QAAQ,EAAE;AAWlE,QAAM,gBAAgB,CAAC,GAAG,QAAQ;AAChC,UAAI;AACJ,UAAI,EAAE,aAAa;AAEjB,YAAI,EAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,MAAM,YAAY,CAAC,CAAC;AAAA,MAC9D,OAAO;AAGL,cAAM,IAAI,EAAE;AAGZ,cAAM,QAAQ,EAAE,GAAG,IAAK,EAAE,MAAM,CAAC,KAAK,IAAM,EAAE,MAAM,CAAC,KAAK,KAAO,EAAE,MAAM,CAAC,KAAK;AAC/E,YAAI,EAAE,QAAU,KAAK,KAAK,OAAO,KAAK,IAAI,UAAW,KAAM,EAAE;AAAA,MAC/D;AACA,YAAM,YAAY,EAAE,KAAK,MAAM,EAAE,MAAM,IAAI,EAAE,KAAK,CAAC;AACnD,QAAE,KAAK,CAAC,IAAI;AACZ,aAAO;AAAA,IACT;AASA,QAAM,gBAAgB,CAAC,SAAS;AAC9B,YAAM,IAAI,KAAK;AAGf,UAAI,MAAM,EAAE;AACZ,UAAI,MAAM,KAAK,WAAW;AACxB,cAAM,KAAK;AAAA,MACb;AACA,UAAI,QAAQ,GAAG;AAAE;AAAA,MAAQ;AAEzB,WAAK,OAAO,IAAI,EAAE,YAAY,SAAS,EAAE,aAAa,EAAE,cAAc,GAAG,GAAG,KAAK,QAAQ;AACzF,WAAK,YAAa;AAClB,QAAE,eAAgB;AAClB,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,QAAE,WAAgB;AAClB,UAAI,EAAE,YAAY,GAAG;AACnB,UAAE,cAAc;AAAA,MAClB;AAAA,IACF;AAGA,QAAM,mBAAmB,CAAC,GAAG,SAAS;AACpC,sBAAgB,GAAI,EAAE,eAAe,IAAI,EAAE,cAAc,IAAK,EAAE,WAAW,EAAE,aAAa,IAAI;AAC9F,QAAE,cAAc,EAAE;AAClB,oBAAc,EAAE,IAAI;AAAA,IACtB;AAGA,QAAM,WAAW,CAAC,GAAG,MAAM;AACzB,QAAE,YAAY,EAAE,SAAS,IAAI;AAAA,IAC/B;AAQA,QAAM,cAAc,CAAC,GAAG,MAAM;AAI5B,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AACzC,QAAE,YAAY,EAAE,SAAS,IAAI,IAAI;AAAA,IACnC;AAUA,QAAM,WAAW,CAAC,MAAM,KAAK,OAAO,SAAS;AAE3C,UAAI,MAAM,KAAK;AAEf,UAAI,MAAM,MAAM;AAAE,cAAM;AAAA,MAAM;AAC9B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAG;AAE3B,WAAK,YAAY;AAGjB,UAAI,IAAI,KAAK,MAAM,SAAS,KAAK,SAAS,KAAK,UAAU,GAAG,GAAG,KAAK;AACpE,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,QAAQ,QAAQ,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MAClD,WAES,KAAK,MAAM,SAAS,GAAG;AAC9B,aAAK,QAAQA,OAAM,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MAChD;AAEA,WAAK,WAAW;AAChB,WAAK,YAAY;AAEjB,aAAO;AAAA,IACT;AAYA,QAAM,gBAAgB,CAAC,GAAG,cAAc;AAEtC,UAAI,eAAe,EAAE;AACrB,UAAI,OAAO,EAAE;AACb,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW,EAAE;AACjB,UAAI,aAAa,EAAE;AACnB,YAAM,QAAS,EAAE,WAAY,EAAE,SAAS,gBACpC,EAAE,YAAY,EAAE,SAAS,iBAAiB;AAE9C,YAAM,OAAO,EAAE;AAEf,YAAM,QAAQ,EAAE;AAChB,YAAM,OAAQ,EAAE;AAMhB,YAAM,SAAS,EAAE,WAAW;AAC5B,UAAI,YAAa,KAAK,OAAO,WAAW,CAAC;AACzC,UAAI,WAAa,KAAK,OAAO,QAAQ;AAQrC,UAAI,EAAE,eAAe,EAAE,YAAY;AACjC,yBAAiB;AAAA,MACnB;AAIA,UAAI,aAAa,EAAE,WAAW;AAAE,qBAAa,EAAE;AAAA,MAAW;AAI1D,SAAG;AAED,gBAAQ;AAWR,YAAI,KAAK,QAAQ,QAAQ,MAAU,YAC/B,KAAK,QAAQ,WAAW,CAAC,MAAM,aAC/B,KAAK,KAAK,MAAqB,KAAK,IAAI,KACxC,KAAK,EAAE,KAAK,MAAmB,KAAK,OAAO,CAAC,GAAG;AACjD;AAAA,QACF;AAQA,gBAAQ;AACR;AAMA,WAAG;AAAA,QAEH,SAAS,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,OAAO;AAIhB,cAAM,aAAa,SAAS;AAC5B,eAAO,SAAS;AAEhB,YAAI,MAAM,UAAU;AAClB,YAAE,cAAc;AAChB,qBAAW;AACX,cAAI,OAAO,YAAY;AACrB;AAAA,UACF;AACA,sBAAa,KAAK,OAAO,WAAW,CAAC;AACrC,qBAAa,KAAK,OAAO,QAAQ;AAAA,QACnC;AAAA,MACF,UAAU,YAAY,KAAK,YAAY,KAAK,KAAK,SAAS,EAAE,iBAAiB;AAE7E,UAAI,YAAY,EAAE,WAAW;AAC3B,eAAO;AAAA,MACT;AACA,aAAO,EAAE;AAAA,IACX;AAaA,QAAM,cAAc,CAAC,MAAM;AAEzB,YAAM,UAAU,EAAE;AAClB,UAAI,GAAG,MAAM;AAIb,SAAG;AACD,eAAO,EAAE,cAAc,EAAE,YAAY,EAAE;AAoBvC,YAAI,EAAE,YAAY,WAAW,UAAU,gBAAgB;AAErD,YAAE,OAAO,IAAI,EAAE,OAAO,SAAS,SAAS,UAAU,UAAU,IAAI,GAAG,CAAC;AACpE,YAAE,eAAe;AACjB,YAAE,YAAY;AAEd,YAAE,eAAe;AACjB,cAAI,EAAE,SAAS,EAAE,UAAU;AACzB,cAAE,SAAS,EAAE;AAAA,UACf;AACA,qBAAW,CAAC;AACZ,kBAAQ;AAAA,QACV;AACA,YAAI,EAAE,KAAK,aAAa,GAAG;AACzB;AAAA,QACF;AAcA,YAAI,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,IAAI;AAC7D,UAAE,aAAa;AAGf,YAAI,CAAC,EAAE,aAAa;AAElB,cAAI,EAAE,YAAY,EAAE,SAAS,WAAW;AACtC,kBAAM,EAAE,WAAW,EAAE;AACrB,mBAAO,EAAE,QAAQ;AACf,4BAAc,GAAG,GAAG;AACpB;AACA,gBAAE;AACF,kBAAI,EAAE,YAAY,EAAE,UAAU,WAAW;AACvC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,EAAE,YAAY,EAAE,UAAU,WAAW;AAC9C,gBAAM,EAAE,WAAW,EAAE;AACrB,YAAE,QAAQ,EAAE,OAAO,GAAG;AAGtB,YAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,MAAM,CAAC,CAAC;AAI5C,iBAAO,EAAE,QAAQ;AACf,0BAAc,GAAG,GAAG;AACpB;AACA,cAAE;AACF,gBAAI,EAAE,YAAY,EAAE,SAAS,WAAW;AACtC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MAKF,SAAS,EAAE,YAAY,iBAAiB,EAAE,KAAK,aAAa;AAAA,IAsC9D;AAiBA,QAAM,iBAAiB,CAAC,GAAG,UAAU;AAMnC,UAAI,YAAY,EAAE,mBAAmB,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,mBAAmB;AAMpF,UAAI,KAAK,MAAM,MAAM,OAAO;AAC5B,UAAI,OAAO,EAAE,KAAK;AAClB,SAAG;AAKD,cAAM;AACN,eAAQ,EAAE,WAAW,MAAO;AAC5B,YAAI,EAAE,KAAK,YAAY,MAAM;AAC3B;AAAA,QACF;AAEA,eAAO,EAAE,KAAK,YAAY;AAC1B,eAAO,EAAE,WAAW,EAAE;AACtB,YAAI,MAAM,OAAO,EAAE,KAAK,UAAU;AAChC,gBAAM,OAAO,EAAE,KAAK;AAAA,QACtB;AACA,YAAI,MAAM,MAAM;AACd,gBAAM;AAAA,QACR;AAOA,YAAI,MAAM,cAAe,QAAQ,KAAK,UAAU,YAC5B,UAAU,cACV,QAAQ,OAAO,EAAE,KAAK,WAAW;AACnD;AAAA,QACF;AAKA,eAAO,UAAU,YAAY,QAAQ,OAAO,EAAE,KAAK,WAAW,IAAI;AAClE,yBAAiB,GAAG,GAAG,GAAG,IAAI;AAG9B,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI;AAC/B,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,OAAO;AACtC,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC;AAChC,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,OAAO;AAGvC,sBAAc,EAAE,IAAI;AASpB,YAAI,MAAM;AACR,cAAI,OAAO,KAAK;AACd,mBAAO;AAAA,UACT;AAEA,YAAE,KAAK,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,aAAa,EAAE,cAAc,IAAI,GAAG,EAAE,KAAK,QAAQ;AACzF,YAAE,KAAK,YAAY;AACnB,YAAE,KAAK,aAAa;AACpB,YAAE,KAAK,aAAa;AACpB,YAAE,eAAe;AACjB,iBAAO;AAAA,QACT;AAKA,YAAI,KAAK;AACP,mBAAS,EAAE,MAAM,EAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,GAAG;AACpD,YAAE,KAAK,YAAY;AACnB,YAAE,KAAK,aAAa;AACpB,YAAE,KAAK,aAAa;AAAA,QACtB;AAAA,MACF,SAAS,SAAS;AAQlB,cAAQ,EAAE,KAAK;AACf,UAAI,MAAM;AAIR,YAAI,QAAQ,EAAE,QAAQ;AACpB,YAAE,UAAU;AAEZ,YAAE,OAAO,IAAI,EAAE,KAAK,MAAM,SAAS,EAAE,KAAK,UAAU,EAAE,QAAQ,EAAE,KAAK,OAAO,GAAG,CAAC;AAChF,YAAE,WAAW,EAAE;AACf,YAAE,SAAS,EAAE;AAAA,QACf,OACK;AACH,cAAI,EAAE,cAAc,EAAE,YAAY,MAAM;AAEtC,cAAE,YAAY,EAAE;AAEhB,cAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,GAAG,CAAC;AAClE,gBAAI,EAAE,UAAU,GAAG;AACjB,gBAAE;AAAA,YACJ;AACA,gBAAI,EAAE,SAAS,EAAE,UAAU;AACzB,gBAAE,SAAS,EAAE;AAAA,YACf;AAAA,UACF;AAEA,YAAE,OAAO,IAAI,EAAE,KAAK,MAAM,SAAS,EAAE,KAAK,UAAU,MAAM,EAAE,KAAK,OAAO,GAAG,EAAE,QAAQ;AACrF,YAAE,YAAY;AACd,YAAE,UAAU,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,QACjE;AACA,UAAE,cAAc,EAAE;AAAA,MACpB;AACA,UAAI,EAAE,aAAa,EAAE,UAAU;AAC7B,UAAE,aAAa,EAAE;AAAA,MACnB;AAGA,UAAI,MAAM;AACR,eAAO;AAAA,MACT;AAGA,UAAI,UAAU,cAAc,UAAU,YACpC,EAAE,KAAK,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa;AACvD,eAAO;AAAA,MACT;AAGA,aAAO,EAAE,cAAc,EAAE;AACzB,UAAI,EAAE,KAAK,WAAW,QAAQ,EAAE,eAAe,EAAE,QAAQ;AAEvD,UAAE,eAAe,EAAE;AACnB,UAAE,YAAY,EAAE;AAEhB,UAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,GAAG,CAAC;AAClE,YAAI,EAAE,UAAU,GAAG;AACjB,YAAE;AAAA,QACJ;AACA,gBAAQ,EAAE;AACV,YAAI,EAAE,SAAS,EAAE,UAAU;AACzB,YAAE,SAAS,EAAE;AAAA,QACf;AAAA,MACF;AACA,UAAI,OAAO,EAAE,KAAK,UAAU;AAC1B,eAAO,EAAE,KAAK;AAAA,MAChB;AACA,UAAI,MAAM;AACR,iBAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,IAAI;AAC3C,UAAE,YAAY;AACd,UAAE,UAAU,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,MACjE;AACA,UAAI,EAAE,aAAa,EAAE,UAAU;AAC7B,UAAE,aAAa,EAAE;AAAA,MACnB;AAOA,aAAQ,EAAE,WAAW,MAAO;AAE5B,aAAO,EAAE,mBAAmB,OAAO,QAAwB,QAAwB,EAAE,mBAAmB;AACxG,kBAAY,OAAO,EAAE,SAAS,EAAE,SAAS;AACzC,aAAO,EAAE,WAAW,EAAE;AACtB,UAAI,QAAQ,cACP,QAAQ,UAAU,aAAa,UAAU,cAC3C,EAAE,KAAK,aAAa,KAAK,QAAQ,MAAO;AACzC,cAAM,OAAO,OAAO,OAAO;AAC3B,eAAO,UAAU,YAAY,EAAE,KAAK,aAAa,KAC5C,QAAQ,OAAO,IAAI;AACxB,yBAAiB,GAAG,EAAE,aAAa,KAAK,IAAI;AAC5C,UAAE,eAAe;AACjB,sBAAc,EAAE,IAAI;AAAA,MACtB;AAGA,aAAO,OAAO,oBAAoB;AAAA,IACpC;AAUA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AACJ,UAAI;AAEJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AACrB;AAAA,UACF;AAAA,QACF;AAKA,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,QACzC;AAKA,YAAI,cAAc,KAAc,EAAE,WAAW,aAAe,EAAE,SAAS,eAAiB;AAKtF,YAAE,eAAe,cAAc,GAAG,SAAS;AAAA,QAE7C;AACA,YAAI,EAAE,gBAAgB,WAAW;AAK/B,mBAAS,UAAU,GAAG,EAAE,WAAW,EAAE,aAAa,EAAE,eAAe,SAAS;AAE5E,YAAE,aAAa,EAAE;AAKjB,cAAI,EAAE,gBAAgB,EAAE,kBAAuC,EAAE,aAAa,WAAW;AACvF,cAAE;AACF,eAAG;AACD,gBAAE;AACF,0BAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,YAIzC,SAAS,EAAE,EAAE,iBAAiB;AAC9B,cAAE;AAAA,UACJ,OACA;AACE,cAAE,YAAY,EAAE;AAChB,cAAE,eAAe;AACjB,gBAAI,EAAE,aAAa;AACjB,gBAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;AAE7B,gBAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAAA,YAQrD;AAAA,UACF;AAAA,QACF,OAAO;AAIL,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAE7C,YAAE;AACF,YAAE;AAAA,QACJ;AACA,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAW,EAAE,WAAY,YAAY,IAAM,EAAE,WAAW,YAAY;AACtE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAOA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AACJ,UAAI;AAEJ,UAAI;AAGJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAO;AAAA,QAClC;AAKA,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,QACzC;AAIA,UAAE,cAAc,EAAE;AAClB,UAAE,aAAa,EAAE;AACjB,UAAE,eAAe,YAAY;AAE7B,YAAI,cAAc,KAAY,EAAE,cAAc,EAAE,kBAC5C,EAAE,WAAW,aAAc,EAAE,SAAS,eAA+B;AAKvE,YAAE,eAAe,cAAc,GAAG,SAAS;AAG3C,cAAI,EAAE,gBAAgB,MAClB,EAAE,aAAa,cAAe,EAAE,iBAAiB,aAAa,EAAE,WAAW,EAAE,cAAc,OAAmB;AAKhH,cAAE,eAAe,YAAY;AAAA,UAC/B;AAAA,QACF;AAIA,YAAI,EAAE,eAAe,aAAa,EAAE,gBAAgB,EAAE,aAAa;AACjE,uBAAa,EAAE,WAAW,EAAE,YAAY;AAOxC,mBAAS,UAAU,GAAG,EAAE,WAAW,IAAI,EAAE,YAAY,EAAE,cAAc,SAAS;AAM9E,YAAE,aAAa,EAAE,cAAc;AAC/B,YAAE,eAAe;AACjB,aAAG;AACD,gBAAI,EAAE,EAAE,YAAY,YAAY;AAC9B,0BAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,YACzC;AAAA,UACF,SAAS,EAAE,EAAE,gBAAgB;AAC7B,YAAE,kBAAkB;AACpB,YAAE,eAAe,YAAY;AAC7B,YAAE;AAEF,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AACzB,gBAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,qBAAO;AAAA,YACT;AAAA,UAEF;AAAA,QAEF,WAAW,EAAE,iBAAiB;AAO5B,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEjD,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AAAA,UAE3B;AACA,YAAE;AACF,YAAE;AACF,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QACF,OAAO;AAIL,YAAE,kBAAkB;AACpB,YAAE;AACF,YAAE;AAAA,QACJ;AAAA,MACF;AAEA,UAAI,EAAE,iBAAiB;AAGrB,iBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEjD,UAAE,kBAAkB;AAAA,MACtB;AACA,QAAE,SAAS,EAAE,WAAW,YAAY,IAAI,EAAE,WAAW,YAAY;AACjE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AAEA,aAAO;AAAA,IACT;AAQA,QAAM,cAAc,CAAC,GAAG,UAAU;AAEhC,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AAEV,YAAM,OAAO,EAAE;AAEf,iBAAS;AAKP,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,CAAC;AACb,cAAI,EAAE,aAAa,aAAa,UAAU,YAAY;AACpD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAO;AAAA,QAClC;AAGA,UAAE,eAAe;AACjB,YAAI,EAAE,aAAa,aAAa,EAAE,WAAW,GAAG;AAC9C,iBAAO,EAAE,WAAW;AACpB,iBAAO,KAAK,IAAI;AAChB,cAAI,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,GAAG;AAC3E,qBAAS,EAAE,WAAW;AACtB,eAAG;AAAA,YAEH,SAAS,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,OAAO;AAChB,cAAE,eAAe,aAAa,SAAS;AACvC,gBAAI,EAAE,eAAe,EAAE,WAAW;AAChC,gBAAE,eAAe,EAAE;AAAA,YACrB;AAAA,UACF;AAAA,QAEF;AAGA,YAAI,EAAE,gBAAgB,WAAW;AAI/B,mBAAS,UAAU,GAAG,GAAG,EAAE,eAAe,SAAS;AAEnD,YAAE,aAAa,EAAE;AACjB,YAAE,YAAY,EAAE;AAChB,YAAE,eAAe;AAAA,QACnB,OAAO;AAIL,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAE7C,YAAE;AACF,YAAE;AAAA,QACJ;AACA,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAMA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AAEJ,iBAAS;AAEP,YAAI,EAAE,cAAc,GAAG;AACrB,sBAAY,CAAC;AACb,cAAI,EAAE,cAAc,GAAG;AACrB,gBAAI,UAAU,YAAY;AACxB,qBAAO;AAAA,YACT;AACA;AAAA,UACF;AAAA,QACF;AAGA,UAAE,eAAe;AAGjB,iBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAC7C,UAAE;AACF,UAAE;AACF,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,OAAO,aAAa,UAAU,aAAa,WAAW,MAAM;AAEnE,WAAK,cAAc;AACnB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,OAAO;AAAA,IACd;AAEA,QAAM,sBAAsB;AAAA;AAAA,MAE1B,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,cAAc;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,YAAY;AAAA;AAAA,MACnC,IAAI,OAAO,GAAG,GAAG,IAAI,GAAG,YAAY;AAAA;AAAA,MACpC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MAErC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,IAAI,IAAI,IAAI,YAAY;AAAA;AAAA,MACtC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,MAC3C,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,IAC7C;AAMA,QAAM,UAAU,CAAC,MAAM;AAErB,QAAE,cAAc,IAAI,EAAE;AAGtB,WAAK,EAAE,IAAI;AAIX,QAAE,iBAAiB,oBAAoB,EAAE,KAAK,EAAE;AAChD,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,mBAAmB,oBAAoB,EAAE,KAAK,EAAE;AAElD,QAAE,WAAW;AACb,QAAE,cAAc;AAChB,QAAE,YAAY;AACd,QAAE,SAAS;AACX,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,QAAE,QAAQ;AAAA,IACZ;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,cAAc;AACnB,WAAK,mBAAmB;AACxB,WAAK,cAAc;AACnB,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,aAAa;AAElB,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,SAAS;AAEd,WAAK,SAAS;AAQd,WAAK,cAAc;AAKnB,WAAK,OAAO;AAMZ,WAAK,OAAO;AAEZ,WAAK,QAAQ;AACb,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,YAAY;AAEjB,WAAK,aAAa;AAOlB,WAAK,cAAc;AAKnB,WAAK,eAAe;AACpB,WAAK,aAAa;AAClB,WAAK,kBAAkB;AACvB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AAEjB,WAAK,cAAc;AAKnB,WAAK,mBAAmB;AAMxB,WAAK,iBAAiB;AAYtB,WAAK,QAAQ;AACb,WAAK,WAAW;AAEhB,WAAK,aAAa;AAGlB,WAAK,aAAa;AAYlB,WAAK,YAAa,IAAI,YAAY,YAAY,CAAC;AAC/C,WAAK,YAAa,IAAI,aAAa,IAAI,UAAU,KAAK,CAAC;AACvD,WAAK,UAAa,IAAI,aAAa,IAAI,WAAW,KAAK,CAAC;AACxD,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,OAAO;AAEjB,WAAK,SAAW;AAChB,WAAK,SAAW;AAChB,WAAK,UAAW;AAGhB,WAAK,WAAW,IAAI,YAAY,WAAW,CAAC;AAI5C,WAAK,OAAO,IAAI,YAAY,IAAI,UAAU,CAAC;AAC3C,WAAK,KAAK,IAAI;AAEd,WAAK,WAAW;AAChB,WAAK,WAAW;AAKhB,WAAK,QAAQ,IAAI,YAAY,IAAI,UAAU,CAAC;AAC5C,WAAK,KAAK,KAAK;AAIf,WAAK,UAAU;AAEf,WAAK,cAAc;AAoBnB,WAAK,WAAW;AAChB,WAAK,UAAU;AAEf,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,UAAU;AACf,WAAK,SAAS;AAGd,WAAK,SAAS;AAId,WAAK,WAAW;AAAA,IAalB;AAMA,QAAM,oBAAoB,CAAC,SAAS;AAElC,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,YAAM,IAAI,KAAK;AACf,UAAI,CAAC,KAAK,EAAE,SAAS,QAAS,EAAE,WAAW;AAAA,MAEb,EAAE,WAAW;AAAA,MAEb,EAAE,WAAW,eACb,EAAE,WAAW,cACb,EAAE,WAAW,iBACb,EAAE,WAAW,cACb,EAAE,WAAW,cACb,EAAE,WAAW,cAAe;AACxD,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,SAAS;AAEjC,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO,IAAI,MAAM,cAAc;AAAA,MACjC;AAEA,WAAK,WAAW,KAAK,YAAY;AACjC,WAAK,YAAY;AAEjB,YAAM,IAAI,KAAK;AACf,QAAE,UAAU;AACZ,QAAE,cAAc;AAEhB,UAAI,EAAE,OAAO,GAAG;AACd,UAAE,OAAO,CAAC,EAAE;AAAA,MAEd;AACA,QAAE;AAAA,MAEA,EAAE,SAAS,IAAI;AAAA;AAAA,QAEf,EAAE,OAAO,aAAa;AAAA;AACxB,WAAK,QAAS,EAAE,SAAS,IACvB,IAEA;AACF,QAAE,aAAa;AACf,eAAS,CAAC;AACV,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,SAAS;AAE7B,YAAM,MAAM,iBAAiB,IAAI;AACjC,UAAI,QAAQ,MAAM;AAChB,gBAAQ,KAAK,KAAK;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,MAAM,SAAS;AAEvC,UAAI,kBAAkB,IAAI,KAAK,KAAK,MAAM,SAAS,GAAG;AACpD,eAAO;AAAA,MACT;AACA,WAAK,MAAM,SAAS;AACpB,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,MAAM,OAAO,QAAQ,YAAY,UAAU,UAAU,eAAe;AAExF,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,UAAI,OAAO;AAEX,UAAI,UAAU,uBAAuB;AACnC,gBAAQ;AAAA,MACV;AAEA,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAChB,WAES,aAAa,IAAI;AACxB,eAAO;AACP,sBAAc;AAAA,MAChB;AAGA,UAAI,WAAW,KAAK,WAAW,iBAAiB,WAAW,cACzD,aAAa,KAAK,aAAa,MAAM,QAAQ,KAAK,QAAQ,KAC1D,WAAW,KAAK,WAAW,WAAY,eAAe,KAAK,SAAS,GAAI;AACxE,eAAO,IAAI,MAAM,cAAc;AAAA,MACjC;AAGA,UAAI,eAAe,GAAG;AACpB,qBAAa;AAAA,MACf;AAGA,YAAM,IAAI,IAAI,aAAa;AAE3B,WAAK,QAAQ;AACb,QAAE,OAAO;AACT,QAAE,SAAS;AAEX,QAAE,OAAO;AACT,QAAE,SAAS;AACX,QAAE,SAAS;AACX,QAAE,SAAS,KAAK,EAAE;AAClB,QAAE,SAAS,EAAE,SAAS;AAEtB,QAAE,cAAc,aAAa,IAAI;AAEjC,QAAE,YAAY,WAAW;AAEzB,UAAI,CAAC,EAAE,eAAe,EAAE,YAAY,IAAI;AACtC,UAAE,YAAY;AAAA,MAChB;AACA,QAAE,YAAY,KAAK,EAAE;AACrB,QAAE,YAAY,EAAE,YAAY;AAC5B,QAAE,aAAa,CAAC,GAAG,EAAE,YAAY,YAAY,KAAK;AAElD,QAAE,SAAS,IAAI,WAAW,EAAE,SAAS,CAAC;AACtC,QAAE,OAAO,IAAI,YAAY,EAAE,SAAS;AACpC,QAAE,OAAO,IAAI,YAAY,EAAE,MAAM;AAKjC,QAAE,cAAc,KAAM,WAAW;AAyCjC,QAAE,mBAAmB,EAAE,cAAc;AACrC,QAAE,cAAc,IAAI,WAAW,EAAE,gBAAgB;AAIjD,QAAE,UAAU,EAAE;AAGd,QAAE,WAAW,EAAE,cAAc,KAAK;AAMlC,QAAE,QAAQ;AACV,QAAE,WAAW;AACb,QAAE,SAAS;AAEX,aAAO,aAAa,IAAI;AAAA,IAC1B;AAEA,QAAM,cAAc,CAAC,MAAM,UAAU;AAEnC,aAAO,aAAa,MAAM,OAAO,YAAY,WAAW,eAAe,kBAAkB;AAAA,IAC3F;AAIA,QAAM,UAAU,CAAC,MAAM,UAAU;AAE/B,UAAI,kBAAkB,IAAI,KAAK,QAAQ,WAAW,QAAQ,GAAG;AAC3D,eAAO,OAAO,IAAI,MAAM,cAAc,IAAI;AAAA,MAC5C;AAEA,YAAM,IAAI,KAAK;AAEf,UAAI,CAAC,KAAK,UACL,KAAK,aAAa,KAAK,CAAC,KAAK,SAC7B,EAAE,WAAW,gBAAgB,UAAU,UAAW;AACrD,eAAO,IAAI,MAAO,KAAK,cAAc,IAAK,cAAc,cAAc;AAAA,MACxE;AAEA,YAAM,YAAY,EAAE;AACpB,QAAE,aAAa;AAGf,UAAI,EAAE,YAAY,GAAG;AACnB,sBAAc,IAAI;AAClB,YAAI,KAAK,cAAc,GAAG;AAOxB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MAMF,WAAW,KAAK,aAAa,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS,KAC7D,UAAU,UAAU;AACpB,eAAO,IAAI,MAAM,WAAW;AAAA,MAC9B;AAGA,UAAI,EAAE,WAAW,gBAAgB,KAAK,aAAa,GAAG;AACpD,eAAO,IAAI,MAAM,WAAW;AAAA,MAC9B;AAGA,UAAI,EAAE,WAAW,cAAc,EAAE,SAAS,GAAG;AAC3C,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAE3B,YAAI,SAAU,cAAe,EAAE,SAAS,KAAM,MAAO;AACrD,YAAI,cAAc;AAElB,YAAI,EAAE,YAAY,kBAAkB,EAAE,QAAQ,GAAG;AAC/C,wBAAc;AAAA,QAChB,WAAW,EAAE,QAAQ,GAAG;AACtB,wBAAc;AAAA,QAChB,WAAW,EAAE,UAAU,GAAG;AACxB,wBAAc;AAAA,QAChB,OAAO;AACL,wBAAc;AAAA,QAChB;AACA,kBAAW,eAAe;AAC1B,YAAI,EAAE,aAAa,GAAG;AAAE,oBAAU;AAAA,QAAa;AAC/C,kBAAU,KAAM,SAAS;AAEzB,oBAAY,GAAG,MAAM;AAGrB,YAAI,EAAE,aAAa,GAAG;AACpB,sBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,sBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,QACpC;AACA,aAAK,QAAQ;AACb,UAAE,SAAS;AAGX,sBAAc,IAAI;AAClB,YAAI,EAAE,YAAY,GAAG;AACnB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,EAAE,WAAW,YAAY;AAE3B,aAAK,QAAQ;AACb,iBAAS,GAAG,EAAE;AACd,iBAAS,GAAG,GAAG;AACf,iBAAS,GAAG,CAAC;AACb,YAAI,CAAC,EAAE,QAAQ;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,mBAAS,GAAG,OAAO;AACnB,YAAE,SAAS;AAGX,wBAAc,IAAI;AAClB,cAAI,EAAE,YAAY,GAAG;AACnB,cAAE,aAAa;AACf,mBAAO;AAAA,UACT;AAAA,QACF,OACK;AACH;AAAA,YAAS;AAAA,aAAI,EAAE,OAAO,OAAO,IAAI,MACpB,EAAE,OAAO,OAAO,IAAI,MACpB,CAAC,EAAE,OAAO,QAAQ,IAAI,MACtB,CAAC,EAAE,OAAO,OAAO,IAAI,MACrB,CAAC,EAAE,OAAO,UAAU,IAAI;AAAA,UACrC;AACA,mBAAS,GAAG,EAAE,OAAO,OAAO,GAAI;AAChC,mBAAS,GAAI,EAAE,OAAO,QAAQ,IAAK,GAAI;AACvC,mBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,mBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,mBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,mBAAS,GAAG,EAAE,OAAO,KAAK,GAAI;AAC9B,cAAI,EAAE,OAAO,SAAS,EAAE,OAAO,MAAM,QAAQ;AAC3C,qBAAS,GAAG,EAAE,OAAO,MAAM,SAAS,GAAI;AACxC,qBAAS,GAAI,EAAE,OAAO,MAAM,UAAU,IAAK,GAAI;AAAA,UACjD;AACA,cAAI,EAAE,OAAO,MAAM;AACjB,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,SAAS,CAAC;AAAA,UAC5D;AACA,YAAE,UAAU;AACZ,YAAE,SAAS;AAAA,QACb;AAAA,MACF;AACA,UAAI,EAAE,WAAW,aAAa;AAC5B,YAAI,EAAE,OAAO,OAAqB;AAChC,cAAI,MAAM,EAAE;AACZ,cAAI,QAAQ,EAAE,OAAO,MAAM,SAAS,SAAU,EAAE;AAChD,iBAAO,EAAE,UAAU,OAAO,EAAE,kBAAkB;AAC5C,gBAAI,OAAO,EAAE,mBAAmB,EAAE;AAGlC,cAAE,YAAY,IAAI,EAAE,OAAO,MAAM,SAAS,EAAE,SAAS,EAAE,UAAU,IAAI,GAAG,EAAE,OAAO;AACjF,cAAE,UAAU,EAAE;AAEd,gBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,mBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,YACpE;AAEA,cAAE,WAAW;AACb,0BAAc,IAAI;AAClB,gBAAI,EAAE,YAAY,GAAG;AACnB,gBAAE,aAAa;AACf,qBAAO;AAAA,YACT;AACA,kBAAM;AACN,oBAAQ;AAAA,UACV;AAGA,cAAI,eAAe,IAAI,WAAW,EAAE,OAAO,KAAK;AAGhD,YAAE,YAAY,IAAI,aAAa,SAAS,EAAE,SAAS,EAAE,UAAU,IAAI,GAAG,EAAE,OAAO;AAC/E,YAAE,WAAW;AAEb,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAEA,YAAE,UAAU;AAAA,QACd;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAoB;AAC/B,cAAI,MAAM,EAAE;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AAEpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cACpE;AAEA,4BAAc,IAAI;AAClB,kBAAI,EAAE,YAAY,GAAG;AACnB,kBAAE,aAAa;AACf,uBAAO;AAAA,cACT;AACA,oBAAM;AAAA,YACR;AAEA,gBAAI,EAAE,UAAU,EAAE,OAAO,KAAK,QAAQ;AACpC,oBAAM,EAAE,OAAO,KAAK,WAAW,EAAE,SAAS,IAAI;AAAA,YAChD,OAAO;AACL,oBAAM;AAAA,YACR;AACA,qBAAS,GAAG,GAAG;AAAA,UACjB,SAAS,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAEA,YAAE,UAAU;AAAA,QACd;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,eAAe;AAC9B,YAAI,EAAE,OAAO,SAAuB;AAClC,cAAI,MAAM,EAAE;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AAEpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cACpE;AAEA,4BAAc,IAAI;AAClB,kBAAI,EAAE,YAAY,GAAG;AACnB,kBAAE,aAAa;AACf,uBAAO;AAAA,cACT;AACA,oBAAM;AAAA,YACR;AAEA,gBAAI,EAAE,UAAU,EAAE,OAAO,QAAQ,QAAQ;AACvC,oBAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,SAAS,IAAI;AAAA,YACnD,OAAO;AACL,oBAAM;AAAA,YACR;AACA,qBAAS,GAAG,GAAG;AAAA,UACjB,SAAS,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAAA,QAEF;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAM;AACjB,cAAI,EAAE,UAAU,IAAI,EAAE,kBAAkB;AACtC,0BAAc,IAAI;AAClB,gBAAI,EAAE,YAAY,GAAG;AACnB,gBAAE,aAAa;AACf,qBAAO;AAAA,YACT;AAAA,UACF;AACA,mBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,mBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,eAAK,QAAQ;AAAA,QACf;AACA,UAAE,SAAS;AAGX,sBAAc,IAAI;AAClB,YAAI,EAAE,YAAY,GAAG;AACnB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,UAAI,KAAK,aAAa,KAAK,EAAE,cAAc,KACxC,UAAU,cAAc,EAAE,WAAW,cAAe;AACrD,YAAI,SAAS,EAAE,UAAU,IAAI,eAAe,GAAG,KAAK,IACvC,EAAE,aAAa,iBAAiB,aAAa,GAAG,KAAK,IACrD,EAAE,aAAa,QAAQ,YAAY,GAAG,KAAK,IAC3C,oBAAoB,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK;AAEvD,YAAI,WAAW,qBAAqB,WAAW,gBAAgB;AAC7D,YAAE,SAAS;AAAA,QACb;AACA,YAAI,WAAW,gBAAgB,WAAW,mBAAmB;AAC3D,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AAAA,UAEjB;AACA,iBAAO;AAAA,QAQT;AACA,YAAI,WAAW,eAAe;AAC5B,cAAI,UAAU,iBAAiB;AAC7B,sBAAU,CAAC;AAAA,UACb,WACS,UAAU,SAAS;AAE1B,6BAAiB,GAAG,GAAG,GAAG,KAAK;AAI/B,gBAAI,UAAU,cAAc;AAE1B,mBAAK,EAAE,IAAI;AAEX,kBAAI,EAAE,cAAc,GAAG;AACrB,kBAAE,WAAW;AACb,kBAAE,cAAc;AAChB,kBAAE,SAAS;AAAA,cACb;AAAA,YACF;AAAA,UACF;AACA,wBAAc,IAAI;AAClB,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AACf,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAEA,UAAI,UAAU,UAAU;AAAE,eAAO;AAAA,MAAM;AACvC,UAAI,EAAE,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAc;AAGxC,UAAI,EAAE,SAAS,GAAG;AAChB,iBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,iBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAG,KAAK,WAAW,GAAI;AAChC,iBAAS,GAAI,KAAK,YAAY,IAAK,GAAI;AACvC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AACxC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AAAA,MAC1C,OAEA;AACE,oBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,oBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,MACpC;AAEA,oBAAc,IAAI;AAIlB,UAAI,EAAE,OAAO,GAAG;AAAE,UAAE,OAAO,CAAC,EAAE;AAAA,MAAM;AAEpC,aAAO,EAAE,YAAY,IAAI,OAAO;AAAA,IAClC;AAGA,QAAM,aAAa,CAAC,SAAS;AAE3B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,YAAM,SAAS,KAAK,MAAM;AAE1B,WAAK,QAAQ;AAEb,aAAO,WAAW,aAAa,IAAI,MAAM,YAAY,IAAI;AAAA,IAC3D;AAOA,QAAM,uBAAuB,CAAC,MAAM,eAAe;AAEjD,UAAI,aAAa,WAAW;AAE5B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,YAAM,IAAI,KAAK;AACf,YAAM,OAAO,EAAE;AAEf,UAAI,SAAS,KAAM,SAAS,KAAK,EAAE,WAAW,cAAe,EAAE,WAAW;AACxE,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,GAAG;AAEd,aAAK,QAAQ,QAAQ,KAAK,OAAO,YAAY,YAAY,CAAC;AAAA,MAC5D;AAEA,QAAE,OAAO;AAGT,UAAI,cAAc,EAAE,QAAQ;AAC1B,YAAI,SAAS,GAAG;AAEd,eAAK,EAAE,IAAI;AACX,YAAE,WAAW;AACb,YAAE,cAAc;AAChB,YAAE,SAAS;AAAA,QACb;AAGA,YAAI,UAAU,IAAI,WAAW,EAAE,MAAM;AACrC,gBAAQ,IAAI,WAAW,SAAS,aAAa,EAAE,QAAQ,UAAU,GAAG,CAAC;AACrE,qBAAa;AACb,qBAAa,EAAE;AAAA,MACjB;AAEA,YAAM,QAAQ,KAAK;AACnB,YAAM,OAAO,KAAK;AAClB,YAAM,QAAQ,KAAK;AACnB,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,kBAAY,CAAC;AACb,aAAO,EAAE,aAAa,WAAW;AAC/B,YAAI,MAAM,EAAE;AACZ,YAAI,IAAI,EAAE,aAAa,YAAY;AACnC,WAAG;AACD,wBAAc,GAAG,GAAG;AACpB;AAAA,QACF,SAAS,EAAE;AACX,UAAE,WAAW;AACb,UAAE,YAAY,YAAY;AAC1B,oBAAY,CAAC;AAAA,MACf;AACA,QAAE,YAAY,EAAE;AAChB,QAAE,cAAc,EAAE;AAClB,QAAE,SAAS,EAAE;AACb,QAAE,YAAY;AACd,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,WAAK,WAAW;AAChB,QAAE,OAAO;AACT,aAAO;AAAA,IACT;AAGA,WAAO,QAAQ,cAAc;AAC7B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,uBAAuB;AACtC,WAAO,QAAQ,cAAc;AAAA;AAAA;;;AC1gE7B;AAAA;AAAA;AAGA,QAAM,OAAO,CAAC,KAAK,QAAQ;AACzB,aAAO,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG;AAAA,IACtD;AAEA,WAAO,QAAQ,SAAS,SAAU,KAAkC;AAClE,YAAM,UAAU,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AACvD,aAAO,QAAQ,QAAQ;AACrB,cAAM,SAAS,QAAQ,MAAM;AAC7B,YAAI,CAAC,QAAQ;AAAE;AAAA,QAAU;AAEzB,YAAI,OAAO,WAAW,UAAU;AAC9B,gBAAM,IAAI,UAAU,SAAS,oBAAoB;AAAA,QACnD;AAEA,mBAAW,KAAK,QAAQ;AACtB,cAAI,KAAK,QAAQ,CAAC,GAAG;AACnB,gBAAI,CAAC,IAAI,OAAO,CAAC;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAIA,WAAO,QAAQ,gBAAgB,CAAC,WAAW;AAEzC,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,eAAO,OAAO,CAAC,EAAE;AAAA,MACnB;AAGA,YAAM,SAAS,IAAI,WAAW,GAAG;AAEjC,eAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACtD,YAAI,QAAQ,OAAO,CAAC;AACpB,eAAO,IAAI,OAAO,GAAG;AACrB,eAAO,MAAM;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/CA;AAAA;AAAA;AASA,QAAI,mBAAmB;AAEvB,QAAI;AAAE,aAAO,aAAa,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC;AAAA,IAAG,SAAS,IAAI;AAAE,yBAAmB;AAAA,IAAO;AAMnG,QAAM,WAAW,IAAI,WAAW,GAAG;AACnC,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,eAAS,CAAC,IAAK,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,IAC5F;AACA,aAAS,GAAG,IAAI,SAAS,GAAG,IAAI;AAIhC,WAAO,QAAQ,aAAa,CAAC,QAAQ;AACnC,UAAI,OAAO,gBAAgB,cAAc,YAAY,UAAU,QAAQ;AACrE,eAAO,IAAI,YAAY,EAAE,OAAO,GAAG;AAAA,MACrC;AAEA,UAAI,KAAK,GAAG,IAAI,OAAO,GAAG,UAAU,IAAI,QAAQ,UAAU;AAG1D,WAAK,QAAQ,GAAG,QAAQ,SAAS,SAAS;AACxC,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACF;AAAA,QACF;AACA,mBAAW,IAAI,MAAO,IAAI,IAAI,OAAQ,IAAI,IAAI,QAAU,IAAI;AAAA,MAC9D;AAGA,YAAM,IAAI,WAAW,OAAO;AAG5B,WAAK,IAAI,GAAG,QAAQ,GAAG,IAAI,SAAS,SAAS;AAC3C,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACF;AAAA,QACF;AACA,YAAI,IAAI,KAAM;AAEZ,cAAI,GAAG,IAAI;AAAA,QACb,WAAW,IAAI,MAAO;AAEpB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB,WAAW,IAAI,OAAS;AAEtB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB,OAAO;AAEL,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,KAAK;AAC9B,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,gBAAgB,CAAC,KAAK,QAAQ;AAIlC,UAAI,MAAM,OAAO;AACf,YAAI,IAAI,YAAY,kBAAkB;AACpC,iBAAO,OAAO,aAAa,MAAM,MAAM,IAAI,WAAW,MAAM,MAAM,IAAI,SAAS,GAAG,GAAG,CAAC;AAAA,QACxF;AAAA,MACF;AAEA,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,kBAAU,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AAIA,WAAO,QAAQ,aAAa,CAAC,KAAK,QAAQ;AACxC,YAAM,MAAM,OAAO,IAAI;AAEvB,UAAI,OAAO,gBAAgB,cAAc,YAAY,UAAU,QAAQ;AACrE,eAAO,IAAI,YAAY,EAAE,OAAO,IAAI,SAAS,GAAG,GAAG,CAAC;AAAA,MACtD;AAEA,UAAI,GAAG;AAKP,YAAM,WAAW,IAAI,MAAM,MAAM,CAAC;AAElC,WAAK,MAAM,GAAG,IAAI,GAAG,IAAI,OAAM;AAC7B,YAAI,IAAI,IAAI,GAAG;AAEf,YAAI,IAAI,KAAM;AAAE,mBAAS,KAAK,IAAI;AAAG;AAAA,QAAU;AAE/C,YAAI,QAAQ,SAAS,CAAC;AAEtB,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ,eAAK,QAAQ;AAAG;AAAA,QAAU;AAGrE,aAAK,UAAU,IAAI,KAAO,UAAU,IAAI,KAAO;AAE/C,eAAO,QAAQ,KAAK,IAAI,KAAK;AAC3B,cAAK,KAAK,IAAM,IAAI,GAAG,IAAI;AAC3B;AAAA,QACF;AAGA,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ;AAAA,QAAU;AAErD,YAAI,IAAI,OAAS;AACf,mBAAS,KAAK,IAAI;AAAA,QACpB,OAAO;AACL,eAAK;AACL,mBAAS,KAAK,IAAI,QAAW,KAAK,KAAM;AACxC,mBAAS,KAAK,IAAI,QAAU,IAAI;AAAA,QAClC;AAAA,MACF;AAEA,aAAO,cAAc,UAAU,GAAG;AAAA,IACpC;AASA,WAAO,QAAQ,aAAa,CAAC,KAAK,QAAQ;AAExC,YAAM,OAAO,IAAI;AACjB,UAAI,MAAM,IAAI,QAAQ;AAAE,cAAM,IAAI;AAAA,MAAQ;AAG1C,UAAI,MAAM,MAAM;AAChB,aAAO,OAAO,MAAM,IAAI,GAAG,IAAI,SAAU,KAAM;AAAE;AAAA,MAAO;AAIxD,UAAI,MAAM,GAAG;AAAE,eAAO;AAAA,MAAK;AAI3B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAK;AAE7B,aAAQ,MAAM,SAAS,IAAI,GAAG,CAAC,IAAI,MAAO,MAAM;AAAA,IAClD;AAAA;AAAA;;;AC7KA;AAAA;AAAA;AAqBA,aAAS,UAAU;AAEjB,WAAK,QAAQ;AACb,WAAK,UAAU;AAEf,WAAK,WAAW;AAEhB,WAAK,WAAW;AAEhB,WAAK,SAAS;AACd,WAAK,WAAW;AAEhB,WAAK,YAAY;AAEjB,WAAK,YAAY;AAEjB,WAAK,MAAM;AAEX,WAAK,QAAQ;AAEb,WAAK,YAAY;AAEjB,WAAK,QAAQ;AAAA,IACf;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC9CjB,IAAAC,mBAAA;AAAA;AAAA;AAGA,QAAM,eAAe;AACrB,QAAM,QAAe;AACrB,QAAM,UAAe;AACrB,QAAM,MAAe;AACrB,QAAM,UAAe;AAErB,QAAM,WAAW,OAAO,UAAU;AAKlC,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MAAc;AAAA,MAAc;AAAA,MACxC;AAAA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AAIJ,QAAM,iBAAiB;AAAA,MACrB,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,UAAU;AAAA,MACV,YAAY;AAAA,IACd;AA2FA,aAAS,QAAQ,SAAS;AACxB,WAAK,UAAU,MAAM,OAAO,CAAC,GAAG,gBAAgB,WAAW,CAAC,CAAC;AAE7D,UAAI,MAAM,KAAK;AAEf,UAAI,IAAI,OAAQ,IAAI,aAAa,GAAI;AACnC,YAAI,aAAa,CAAC,IAAI;AAAA,MACxB,WAES,IAAI,QAAS,IAAI,aAAa,KAAO,IAAI,aAAa,IAAK;AAClE,YAAI,cAAc;AAAA,MACpB;AAEA,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS,CAAC;AAEf,WAAK,OAAO,IAAI,QAAQ;AACxB,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAS,aAAa;AAAA,QACxB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,MACN;AAEA,UAAI,WAAW,MAAM;AACnB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC7B;AAEA,UAAI,IAAI,QAAQ;AACd,qBAAa,iBAAiB,KAAK,MAAM,IAAI,MAAM;AAAA,MACrD;AAEA,UAAI,IAAI,YAAY;AAClB,YAAI;AAEJ,YAAI,OAAO,IAAI,eAAe,UAAU;AAEtC,iBAAO,QAAQ,WAAW,IAAI,UAAU;AAAA,QAC1C,WAAW,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,iBAAO,IAAI,WAAW,IAAI,UAAU;AAAA,QACtC,OAAO;AACL,iBAAO,IAAI;AAAA,QACb;AAEA,iBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI;AAE1D,YAAI,WAAW,MAAM;AACnB,gBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,QAC7B;AAEA,aAAK,YAAY;AAAA,MACnB;AAAA,IACF;AAwBA,YAAQ,UAAU,OAAO,SAAU,MAAM,YAAY;AACnD,YAAM,OAAO,KAAK;AAClB,YAAM,YAAY,KAAK,QAAQ;AAC/B,UAAI,QAAQ;AAEZ,UAAI,KAAK,OAAO;AAAE,eAAO;AAAA,MAAO;AAEhC,UAAI,eAAe,CAAC,CAAC,WAAY,eAAc;AAAA,UAC1C,eAAc,eAAe,OAAO,WAAW;AAGpD,UAAI,OAAO,SAAS,UAAU;AAE5B,aAAK,QAAQ,QAAQ,WAAW,IAAI;AAAA,MACtC,WAAW,SAAS,KAAK,IAAI,MAAM,wBAAwB;AACzD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MAClC,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAEA,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,iBAAS;AACP,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,WAAW,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACnB;AAGA,aAAK,gBAAgB,gBAAgB,gBAAgB,iBAAiB,KAAK,aAAa,GAAG;AACzF,eAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAClD,eAAK,YAAY;AACjB;AAAA,QACF;AAEA,iBAAS,aAAa,QAAQ,MAAM,WAAW;AAG/C,YAAI,WAAW,cAAc;AAC3B,cAAI,KAAK,WAAW,GAAG;AACrB,iBAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAAA,UACpD;AACA,mBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO,WAAW;AAAA,QACpB;AAGA,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,OAAO,KAAK,MAAM;AACvB;AAAA,QACF;AAGA,YAAI,cAAc,KAAK,KAAK,WAAW,GAAG;AACxC,eAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAClD,eAAK,YAAY;AACjB;AAAA,QACF;AAEA,YAAI,KAAK,aAAa,EAAG;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAUA,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACxB;AAYA,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,MAAM;AACnB,aAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,MAC/C;AACA,WAAK,SAAS,CAAC;AACf,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACvB;AAmCA,aAAS,QAAQ,OAAO,SAAS;AAC/B,YAAM,WAAW,IAAI,QAAQ,OAAO;AAEpC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,KAAK;AAAE,cAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAAA,MAAG;AAE7D,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAC;AACtB,cAAQ,MAAM;AACd,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAWA,aAAS,KAAK,OAAO,SAAS;AAC5B,gBAAU,WAAW,CAAC;AACtB,cAAQ,OAAO;AACf,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAGA,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,OAAO;AACtB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;AClY3B;AAAA;AAAA;AAsBA,QAAM,MAAM;AACZ,QAAM,OAAO;AAqCb,WAAO,UAAU,SAAS,aAAa,MAAM,OAAO;AAClD,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,OAAO;AAGX,YAAM,QAAQ,KAAK;AAEnB,YAAM,KAAK;AACX,cAAQ,KAAK;AACb,aAAO,OAAO,KAAK,WAAW;AAC9B,aAAO,KAAK;AACZ,eAAS,KAAK;AACd,YAAM,QAAQ,QAAQ,KAAK;AAC3B,YAAM,QAAQ,KAAK,YAAY;AAE/B,aAAO,MAAM;AAEb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,iBAAW,MAAM;AACjB,aAAO,MAAM;AACb,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,eAAS,KAAK,MAAM,WAAW;AAC/B,eAAS,KAAK,MAAM,YAAY;AAMhC;AACA,WAAG;AACD,cAAI,OAAO,IAAI;AACb,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AACR,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AAAA,UACV;AAEA,iBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,uBAAS;AACP,mBAAK,SAAS;AACd,wBAAU;AACV,sBAAQ;AACR,mBAAM,SAAS,KAAM;AACrB,kBAAI,OAAO,GAAG;AAIZ,uBAAO,MAAM,IAAI,OAAO;AAAA,cAC1B,WACS,KAAK,IAAI;AAChB,sBAAM,OAAO;AACb,sBAAM;AACN,oBAAI,IAAI;AACN,sBAAI,OAAO,IAAI;AACb,4BAAQ,MAAM,KAAK,KAAK;AACxB,4BAAQ;AAAA,kBACV;AACA,yBAAO,QAAS,KAAK,MAAM;AAC3B,4BAAU;AACV,0BAAQ;AAAA,gBACV;AAEA,oBAAI,OAAO,IAAI;AACb,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AACR,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AAAA,gBACV;AACA,uBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,6BAAS;AACP,yBAAK,SAAS;AACd,8BAAU;AACV,4BAAQ;AACR,yBAAM,SAAS,KAAM;AAErB,wBAAI,KAAK,IAAI;AACX,6BAAO,OAAO;AACd,4BAAM;AACN,0BAAI,OAAO,IAAI;AACb,gCAAQ,MAAM,KAAK,KAAK;AACxB,gCAAQ;AACR,4BAAI,OAAO,IAAI;AACb,kCAAQ,MAAM,KAAK,KAAK;AACxB,kCAAQ;AAAA,wBACV;AAAA,sBACF;AACA,8BAAQ,QAAS,KAAK,MAAM;AAE5B,0BAAI,OAAO,MAAM;AACf,6BAAK,MAAM;AACX,8BAAM,OAAO;AACb,8BAAM;AAAA,sBACR;AAEA,gCAAU;AACV,8BAAQ;AAER,2BAAK,OAAO;AACZ,0BAAI,OAAO,IAAI;AACb,6BAAK,OAAO;AACZ,4BAAI,KAAK,OAAO;AACd,8BAAI,MAAM,MAAM;AACd,iCAAK,MAAM;AACX,kCAAM,OAAO;AACb,kCAAM;AAAA,0BACR;AAAA,wBAuBF;AACA,+BAAO;AACP,sCAAc;AACd,4BAAI,UAAU,GAAG;AACf,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChB;AAAA,wBACF,WACS,QAAQ,IAAI;AACnB,kCAAQ,QAAQ,QAAQ;AACxB,gCAAM;AACN,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO;AACP,gCAAI,QAAQ,KAAK;AACf,mCAAK;AACL,qCAAO;AACP,iCAAG;AACD,uCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,8BAClC,SAAS,EAAE;AACX,qCAAO,OAAO;AACd,4CAAc;AAAA,4BAChB;AAAA,0BACF;AAAA,wBACF,OACK;AACH,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChB;AAAA,wBACF;AACA,+BAAO,MAAM,GAAG;AACd,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO;AAAA,wBACT;AACA,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,YAAY,MAAM;AAAA,0BACrC;AAAA,wBACF;AAAA,sBACF,OACK;AACH,+BAAO,OAAO;AACd,2BAAG;AACD,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO;AAAA,wBACT,SAAS,MAAM;AACf,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,OAAO,MAAM;AAAA,0BAChC;AAAA,wBACF;AAAA,sBACF;AAAA,oBACF,YACU,KAAK,QAAQ,GAAG;AACxB,6BAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,+BAAS;AAAA,oBACX,OACK;AACH,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb,4BAAM;AAAA,oBACR;AAEA;AAAA,kBACF;AAAA,cACF,YACU,KAAK,QAAQ,GAAG;AACxB,uBAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,yBAAS;AAAA,cACX,WACS,KAAK,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM;AAAA,cACR,OACK;AACH,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb,sBAAM;AAAA,cACR;AAEA;AAAA,YACF;AAAA,QACF,SAAS,MAAM,QAAQ,OAAO;AAG9B,YAAM,QAAQ;AACd,aAAO;AACP,cAAQ,OAAO;AACf,eAAS,KAAK,QAAQ;AAGtB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,WAAY,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM;AAC5D,WAAK,YAAa,OAAO,MAAM,OAAO,MAAM,QAAQ,OAAO,OAAO;AAClE,YAAM,OAAO;AACb,YAAM,OAAO;AACb;AAAA,IACF;AAAA;AAAA;;;ACvVA;AAAA;AAAA;AAqBA,QAAM,UAAU;AAChB,QAAM,cAAc;AACpB,QAAM,eAAe;AAGrB,QAAM,QAAQ;AACd,QAAM,OAAO;AACb,QAAM,QAAQ;AAEd,QAAM,QAAQ,IAAI,YAAY;AAAA;AAAA,MAC5B;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACrD;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAG;AAAA,IAC/D,CAAC;AAED,QAAM,OAAO,IAAI,WAAW;AAAA;AAAA,MAC1B;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,IAC3D,CAAC;AAED,QAAM,QAAQ,IAAI,YAAY;AAAA;AAAA,MAC5B;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MACtD;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAClD;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAG;AAAA,IAChC,CAAC;AAED,QAAM,OAAO,IAAI,WAAW;AAAA;AAAA,MAC1B;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACpC;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,IACtB,CAAC;AAED,QAAM,gBAAgB,CAAC,MAAM,MAAM,YAAY,OAAO,OAAO,aAAa,MAAM,SAChF;AACE,YAAM,OAAO,KAAK;AAGlB,UAAI,MAAM;AACV,UAAI,MAAM;AACV,UAAI,MAAM,GAAG,MAAM;AACnB,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AAEX,UAAI;AACJ,YAAM,QAAQ,IAAI,YAAY,UAAU,CAAC;AACzC,YAAM,OAAO,IAAI,YAAY,UAAU,CAAC;AACxC,UAAI,QAAQ;AAEZ,UAAI,WAAW,SAAS;AAkCxB,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,cAAM,GAAG,IAAI;AAAA,MACf;AACA,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,cAAM,KAAK,aAAa,GAAG,CAAC;AAAA,MAC9B;AAGA,aAAO;AACP,WAAK,MAAM,SAAS,OAAO,GAAG,OAAO;AACnC,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAO;AAAA,MACjC;AACA,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACT;AACA,UAAI,QAAQ,GAAG;AAIb,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAMhD,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAEhD,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AACA,WAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAO;AAAA,MACjC;AACA,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACT;AAGA,aAAO;AACP,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,iBAAS;AACT,gBAAQ,MAAM,GAAG;AACjB,YAAI,OAAO,GAAG;AACZ,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UAAI,OAAO,MAAM,SAAS,SAAS,QAAQ,IAAI;AAC7C,eAAO;AAAA,MACT;AAGA,WAAK,CAAC,IAAI;AACV,WAAK,MAAM,GAAG,MAAM,SAAS,OAAO;AAClC,aAAK,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG;AAAA,MACvC;AAGA,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,YAAI,KAAK,aAAa,GAAG,MAAM,GAAG;AAChC,eAAK,KAAK,KAAK,aAAa,GAAG,CAAC,GAAG,IAAI;AAAA,QACzC;AAAA,MACF;AAoCA,UAAI,SAAS,OAAO;AAClB,eAAO,QAAQ;AACf,gBAAQ;AAAA,MAEV,WAAW,SAAS,MAAM;AACxB,eAAO;AACP,gBAAQ;AACR,gBAAQ;AAAA,MAEV,OAAO;AACL,eAAO;AACP,gBAAQ;AACR,gBAAQ;AAAA,MACV;AAGA,aAAO;AACP,YAAM;AACN,YAAM;AACN,aAAO;AACP,aAAO;AACP,aAAO;AACP,YAAM;AACN,aAAO,KAAK;AACZ,aAAO,OAAO;AAGd,UAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,eAAO;AAAA,MACT;AAGA,iBAAS;AAEP,oBAAY,MAAM;AAClB,YAAI,KAAK,GAAG,IAAI,IAAI,OAAO;AACzB,oBAAU;AACV,qBAAW,KAAK,GAAG;AAAA,QACrB,WACS,KAAK,GAAG,KAAK,OAAO;AAC3B,oBAAU,MAAM,KAAK,GAAG,IAAI,KAAK;AACjC,qBAAW,KAAK,KAAK,GAAG,IAAI,KAAK;AAAA,QACnC,OACK;AACH,oBAAU,KAAK;AACf,qBAAW;AAAA,QACb;AAGA,eAAO,KAAM,MAAM;AACnB,eAAO,KAAK;AACZ,cAAM;AACN,WAAG;AACD,kBAAQ;AACR,gBAAM,QAAQ,QAAQ,QAAQ,IAAI,IAAK,aAAa,KAAO,WAAW,KAAM,WAAU;AAAA,QACxF,SAAS,SAAS;AAGlB,eAAO,KAAM,MAAM;AACnB,eAAO,OAAO,MAAM;AAClB,mBAAS;AAAA,QACX;AACA,YAAI,SAAS,GAAG;AACd,kBAAQ,OAAO;AACf,kBAAQ;AAAA,QACV,OAAO;AACL,iBAAO;AAAA,QACT;AAGA;AACA,YAAI,EAAE,MAAM,GAAG,MAAM,GAAG;AACtB,cAAI,QAAQ,KAAK;AAAE;AAAA,UAAO;AAC1B,gBAAM,KAAK,aAAa,KAAK,GAAG,CAAC;AAAA,QACnC;AAGA,YAAI,MAAM,SAAS,OAAO,UAAU,KAAK;AAEvC,cAAI,SAAS,GAAG;AACd,mBAAO;AAAA,UACT;AAGA,kBAAQ;AAGR,iBAAO,MAAM;AACb,iBAAO,KAAK;AACZ,iBAAO,OAAO,OAAO,KAAK;AACxB,oBAAQ,MAAM,OAAO,IAAI;AACzB,gBAAI,QAAQ,GAAG;AAAE;AAAA,YAAO;AACxB;AACA,qBAAS;AAAA,UACX;AAGA,kBAAQ,KAAK;AACb,cAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,mBAAO;AAAA,UACT;AAGA,gBAAM,OAAO;AAIb,gBAAM,GAAG,IAAK,QAAQ,KAAO,QAAQ,KAAO,OAAO,cAAc;AAAA,QACnE;AAAA,MACF;AAKA,UAAI,SAAS,GAAG;AAId,cAAM,OAAO,IAAI,IAAM,MAAM,QAAS,KAAO,MAAM,KAAK;AAAA,MAC1D;AAIA,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAGA,WAAO,UAAU;AAAA;AAAA;;;ACnVjB;AAAA;AAAA;AAqBA,QAAM,UAAgB;AACtB,QAAMC,SAAgB;AACtB,QAAM,eAAgB;AACtB,QAAM,gBAAgB;AAEtB,QAAM,QAAQ;AACd,QAAM,OAAO;AACb,QAAM,QAAQ;AAKd,QAAM;AAAA,MACJ;AAAA,MAAU;AAAA,MAAS;AAAA,MACnB;AAAA,MAAM;AAAA,MAAc;AAAA,MAAa;AAAA,MAAgB;AAAA,MAAc;AAAA,MAAa;AAAA,MAC5E;AAAA,IACF,IAAI;AAOJ,QAAS,OAAO;AAChB,QAAS,QAAQ;AACjB,QAAS,OAAO;AAChB,QAAS,KAAK;AACd,QAAS,QAAQ;AACjB,QAAS,QAAQ;AACjB,QAAS,OAAO;AAChB,QAAS,UAAU;AACnB,QAAS,OAAO;AAChB,QAAS,SAAS;AAClB,QAAS,OAAO;AAChB,QAAa,OAAO;AACpB,QAAa,SAAS;AACtB,QAAa,SAAS;AACtB,QAAa,QAAQ;AACrB,QAAa,OAAO;AACpB,QAAa,QAAQ;AACrB,QAAa,UAAU;AACvB,QAAa,WAAW;AACxB,QAAiB,OAAO;AACxB,QAAiB,MAAM;AACvB,QAAiB,SAAS;AAC1B,QAAiB,OAAO;AACxB,QAAiB,UAAU;AAC3B,QAAiB,QAAQ;AACzB,QAAiB,MAAM;AACvB,QAAS,QAAQ;AACjB,QAAS,SAAS;AAClB,QAAS,OAAO;AAChB,QAAS,MAAM;AACf,QAAS,MAAM;AACf,QAAS,OAAO;AAMhB,QAAM,cAAc;AACpB,QAAM,eAAe;AAGrB,QAAM,YAAY;AAElB,QAAM,YAAY;AAGlB,QAAM,UAAU,CAAC,MAAM;AAErB,cAAW,MAAM,KAAM,QACb,MAAM,IAAK,WACX,IAAI,UAAW,OACf,IAAI,QAAS;AAAA,IACzB;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,OAAO;AAEZ,WAAK,WAAW;AAChB,WAAK,QAAQ;AAEb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AAEb,WAAK,OAAO;AAGZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,SAAS;AAGd,WAAK,OAAO;AACZ,WAAK,OAAO;AAGZ,WAAK,SAAS;AACd,WAAK,SAAS;AAGd,WAAK,QAAQ;AAGb,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,WAAW;AAGhB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,OAAO;AAEZ,WAAK,OAAO,IAAI,YAAY,GAAG;AAC/B,WAAK,OAAO,IAAI,YAAY,GAAG;AAO/B,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,MAAM;AAAA,IACb;AAGA,QAAM,oBAAoB,CAAC,SAAS;AAElC,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,YAAM,QAAQ,KAAK;AACnB,UAAI,CAAC,SAAS,MAAM,SAAS,QAC3B,MAAM,OAAO,QAAQ,MAAM,OAAO,MAAM;AACxC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,SAAS;AAEjC,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,WAAK,WAAW,KAAK,YAAY,MAAM,QAAQ;AAC/C,WAAK,MAAM;AACX,UAAI,MAAM,MAAM;AACd,aAAK,QAAQ,MAAM,OAAO;AAAA,MAC5B;AACA,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,WAAW;AACjB,YAAM,QAAQ;AACd,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,YAAM,UAAU,MAAM,SAAS,IAAI,WAAW,WAAW;AACzD,YAAM,WAAW,MAAM,UAAU,IAAI,WAAW,YAAY;AAE5D,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,SAAS;AAE7B,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,aAAO,iBAAiB,IAAI;AAAA,IAE9B;AAGA,QAAM,gBAAgB,CAAC,MAAM,eAAe;AAC1C,UAAI;AAGJ,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AAGnB,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAChB,OACK;AACH,gBAAQ,cAAc,KAAK;AAC3B,YAAI,aAAa,IAAI;AACnB,wBAAc;AAAA,QAChB;AAAA,MACF;AAGA,UAAI,eAAe,aAAa,KAAK,aAAa,KAAK;AACrD,eAAO;AAAA,MACT;AACA,UAAI,MAAM,WAAW,QAAQ,MAAM,UAAU,YAAY;AACvD,cAAM,SAAS;AAAA,MACjB;AAGA,YAAM,OAAO;AACb,YAAM,QAAQ;AACd,aAAO,aAAa,IAAI;AAAA,IAC1B;AAGA,QAAM,eAAe,CAAC,MAAM,eAAe;AAEzC,UAAI,CAAC,MAAM;AAAE,eAAO;AAAA,MAAgB;AAGpC,YAAM,QAAQ,IAAI,aAAa;AAI/B,WAAK,QAAQ;AACb,YAAM,OAAO;AACb,YAAM,SAAS;AACf,YAAM,OAAO;AACb,YAAM,MAAM,cAAc,MAAM,UAAU;AAC1C,UAAI,QAAQ,MAAM;AAChB,aAAK,QAAQ;AAAA,MACf;AACA,aAAO;AAAA,IACT;AAGA,QAAM,cAAc,CAAC,SAAS;AAE5B,aAAO,aAAa,MAAM,SAAS;AAAA,IACrC;AAaA,QAAI,SAAS;AAEb,QAAI;AAAJ,QAAY;AAGZ,QAAM,cAAc,CAAC,UAAU;AAG7B,UAAI,QAAQ;AACV,iBAAS,IAAI,WAAW,GAAG;AAC3B,kBAAU,IAAI,WAAW,EAAE;AAG3B,YAAI,MAAM;AACV,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAE3C,sBAAc,MAAO,MAAM,MAAM,GAAG,KAAK,QAAU,GAAG,MAAM,MAAM,EAAE,MAAM,EAAE,CAAC;AAG7E,cAAM;AACN,eAAO,MAAM,IAAI;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAE1C,sBAAc,OAAO,MAAM,MAAM,GAAG,IAAM,SAAS,GAAG,MAAM,MAAM,EAAE,MAAM,EAAE,CAAC;AAG7E,iBAAS;AAAA,MACX;AAEA,YAAM,UAAU;AAChB,YAAM,UAAU;AAChB,YAAM,WAAW;AACjB,YAAM,WAAW;AAAA,IACnB;AAiBA,QAAM,eAAe,CAAC,MAAM,KAAK,KAAK,SAAS;AAE7C,UAAI;AACJ,YAAM,QAAQ,KAAK;AAGnB,UAAI,MAAM,WAAW,MAAM;AACzB,cAAM,SAAS,IAAI,WAAW,KAAK,MAAM,KAAK;AAAA,MAChD;AAGA,UAAI,MAAM,UAAU,GAAG;AACrB,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,QAAQ;AACd,cAAM,QAAQ;AAAA,MAChB;AAGA,UAAI,QAAQ,MAAM,OAAO;AACvB,cAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC;AACxD,cAAM,QAAQ;AACd,cAAM,QAAQ,MAAM;AAAA,MACtB,OACK;AACH,eAAO,MAAM,QAAQ,MAAM;AAC3B,YAAI,OAAO,MAAM;AACf,iBAAO;AAAA,QACT;AAEA,cAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,MAAM,OAAO,IAAI,GAAG,MAAM,KAAK;AACzE,gBAAQ;AACR,YAAI,MAAM;AAER,gBAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,GAAG,GAAG,CAAC;AACjD,gBAAM,QAAQ;AACd,gBAAM,QAAQ,MAAM;AAAA,QACtB,OACK;AACH,gBAAM,SAAS;AACf,cAAI,MAAM,UAAU,MAAM,OAAO;AAAE,kBAAM,QAAQ;AAAA,UAAG;AACpD,cAAI,MAAM,QAAQ,MAAM,OAAO;AAAE,kBAAM,SAAS;AAAA,UAAM;AAAA,QACxD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,QAAM,UAAU,CAAC,MAAM,UAAU;AAE/B,UAAI;AACJ,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AACV,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AACX,UAAI,WAAW,SAAS;AAExB,UAAI,WAAW,SAAS;AACxB,UAAI;AACJ,UAAI;AACJ,YAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,UAAI;AAEJ,UAAI;AAEJ,YAAM;AAAA;AAAA,QACJ,IAAI,WAAW,CAAE,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAG,CAAC;AAAA;AAGrF,UAAI,kBAAkB,IAAI,KAAK,CAAC,KAAK,UAChC,CAAC,KAAK,SAAS,KAAK,aAAa,GAAI;AACxC,eAAO;AAAA,MACT;AAEA,cAAQ,KAAK;AACb,UAAI,MAAM,SAAS,MAAM;AAAE,cAAM,OAAO;AAAA,MAAQ;AAIhD,YAAM,KAAK;AACX,eAAS,KAAK;AACd,aAAO,KAAK;AACZ,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,aAAO,KAAK;AACZ,aAAO,MAAM;AACb,aAAO,MAAM;AAGb,YAAM;AACN,aAAO;AACP,YAAM;AAEN;AACA,mBAAS;AACP,kBAAQ,MAAM,MAAM;AAAA,YAClB,KAAK;AACH,kBAAI,MAAM,SAAS,GAAG;AACpB,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAK,MAAM,OAAO,KAAM,SAAS,OAAQ;AACvC,oBAAI,MAAM,UAAU,GAAG;AACrB,wBAAM,QAAQ;AAAA,gBAChB;AACA,sBAAM,QAAQ;AAEd,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAI3C,uBAAO;AACP,uBAAO;AAEP,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,kBAAI,EAAE,MAAM,OAAO;AAAA,iBACd,OAAO,QAAoB,MAAM,QAAQ,MAAM,IAAI;AACtD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,mBAAK,OAAO,QAAqB,YAAY;AAC3C,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,wBAAU;AACV,sBAAQ;AAER,qBAAO,OAAO,MAAmB;AACjC,kBAAI,MAAM,UAAU,GAAG;AACrB,sBAAM,QAAQ;AAAA,cAChB;AACA,kBAAI,MAAM,MAAM,MAAM,MAAM,OAAO;AACjC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAIA,oBAAM,OAAO,KAAK,MAAM;AAGxB,oBAAM,QAAQ;AAEd,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO,OAAO,MAAQ,SAAS;AAErC,qBAAO;AACP,qBAAO;AAEP;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,QAAQ;AACd,mBAAK,MAAM,QAAQ,SAAU,YAAY;AACvC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,QAAQ,OAAQ;AACxB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,QAAQ,IAAK;AAAA,cACnC;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,SAAU,OAAO;AAC5B,sBAAM,KAAK,KAAM,QAAQ;AAAA,cAC3B;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,SAAS;AACf,oBAAI,MAAM,MAAM;AACd,wBAAM,KAAK,YAAY;AAAA,gBACzB;AACA,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,uBAAK,CAAC,IAAI,OAAO;AACjB,uBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,wBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,gBAE7C;AAEA,uBAAO;AACP,uBAAO;AAAA,cAET,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,QAAQ;AAAA,cACrB;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,uBAAO,MAAM;AACb,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,MAAM;AACR,sBAAI,MAAM,MAAM;AACd,0BAAM,MAAM,KAAK,YAAY,MAAM;AACnC,wBAAI,CAAC,MAAM,KAAK,OAAO;AAErB,4BAAM,KAAK,QAAQ,IAAI,WAAW,MAAM,KAAK,SAAS;AAAA,oBACxD;AACA,0BAAM,KAAK,MAAM;AAAA,sBACf,MAAM;AAAA,wBACJ;AAAA;AAAA;AAAA,wBAGA,OAAO;AAAA,sBACT;AAAA;AAAA,sBAEA;AAAA,oBACF;AAAA,kBAIF;AACA,sBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,0BAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,kBACpD;AACA,0BAAQ;AACR,0BAAQ;AACR,wBAAM,UAAU;AAAA,gBAClB;AACA,oBAAI,MAAM,QAAQ;AAAE,wBAAM;AAAA,gBAAW;AAAA,cACvC;AACA,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC,uBAAO;AACP,mBAAG;AAED,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,QAAQ,OAAO,aAAa,GAAG;AAAA,kBAC5C;AAAA,gBACF,SAAS,OAAO,OAAO;AAEvB,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBACpD;AACA,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAW;AAAA,cAC9B,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC,uBAAO;AACP,mBAAG;AACD,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,WAAW,OAAO,aAAa,GAAG;AAAA,kBAC/C;AAAA,gBACF,SAAS,OAAO,OAAO;AACvB,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBACpD;AACA,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAW;AAAA,cAC9B,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,UAAU;AAAA,cACvB;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,KAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,oBAAK,MAAM,OAAO,KAAM,UAAU,MAAM,QAAQ,QAAS;AACvD,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAET;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,MAAM,SAAS,IAAK;AACxC,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,mBAAK,QAAQ,MAAM,QAAQ,QAAQ,IAAI;AAEvC,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,aAAa,GAAG;AAExB,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,uBAAO;AAAA,cACT;AACA,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,UAAU,WAAW,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAEjE,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,0BAAU,OAAO;AACjB,wBAAQ,OAAO;AAEf,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,qBAAO,OAAO,GAAG;AACf,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,OAAQ,OAAO;AAErB,wBAAU;AACV,sBAAQ;AAGR,sBAAS,OAAO,GAAkB;AAAA,gBAChC,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,8BAAY,KAAK;AAGjB,wBAAM,OAAO;AACb,sBAAI,UAAU,SAAS;AAErB,8BAAU;AACV,4BAAQ;AAER,0BAAM;AAAA,kBACR;AACA;AAAA,gBACF,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,uBAAK,MAAM;AACX,wBAAM,OAAO;AAAA,cACjB;AAEA,wBAAU;AACV,sBAAQ;AAER;AAAA,YACF,KAAK;AAEH,wBAAU,OAAO;AACjB,sBAAQ,OAAO;AAGf,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,mBAAK,OAAO,YAAc,SAAS,KAAM,QAAS;AAChD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,SAAS,OAAO;AAItB,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAE5C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM;AACb,kBAAI,MAAM;AACR,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AAEnC,uBAAO,IAAI,MAAM,SAAS,MAAM,OAAO,IAAI,GAAG,GAAG;AAEjD,wBAAQ;AACR,wBAAQ;AACR,wBAAQ;AACR,uBAAO;AACP,sBAAM,UAAU;AAChB;AAAA,cACF;AAEA,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,QAAQ,OAAO,MAAmB;AAExC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAGR,kBAAI,MAAM,OAAO,OAAO,MAAM,QAAQ,IAAI;AACxC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAGA,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO;AAE/B,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAK,OAAO;AAE1C,0BAAU;AACV,wBAAQ;AAAA,cAEV;AACA,qBAAO,MAAM,OAAO,IAAI;AACtB,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAI;AAAA,cACpC;AAKA,oBAAM,UAAU,MAAM;AACtB,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAQ;AAC7B,oBAAM,cAAc,OAAO,MAAM,MAAM,GAAG,IAAI,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAChF,oBAAM,UAAU,KAAK;AAErB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC5C,2BAAS;AACP,yBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,aAAc,MAAM;AAAE;AAAA,kBAAO;AAElC,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AACA,oBAAI,WAAW,IAAI;AAEjB,4BAAU;AACV,0BAAQ;AAER,wBAAM,KAAK,MAAM,MAAM,IAAI;AAAA,gBAC7B,OACK;AACH,sBAAI,aAAa,IAAI;AAEnB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,wBAAI,MAAM,SAAS,GAAG;AACpB,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb;AAAA,oBACF;AACA,0BAAM,MAAM,KAAK,MAAM,OAAO,CAAC;AAC/B,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEV,WACS,aAAa,IAAI;AAExB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEV,OACK;AAEH,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,MAAM,OAAO;AAEpB,8BAAU;AACV,4BAAQ;AAAA,kBAEV;AACA,sBAAI,MAAM,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO;AAChD,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACF;AACA,yBAAO,QAAQ;AACb,0BAAM,KAAK,MAAM,MAAM,IAAI;AAAA,kBAC7B;AAAA,gBACF;AAAA,cACF;AAGA,kBAAI,MAAM,SAAS,KAAK;AAAE;AAAA,cAAO;AAGjC,kBAAI,MAAM,KAAK,GAAG,MAAM,GAAG;AACzB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAKA,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAQ;AAC7B,oBAAM,cAAc,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAGvF,oBAAM,UAAU,KAAK;AAGrB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,WAAW;AAGjB,oBAAM,WAAW,MAAM;AACvB,qBAAO,EAAE,MAAM,MAAM,SAAS;AAC9B,oBAAM,cAAc,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,UAAU,GAAG,MAAM,MAAM,IAAI;AAGnG,oBAAM,WAAW,KAAK;AAGtB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAE5C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,QAAQ,KAAK,QAAQ,KAAK;AAE5B,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,6BAAa,MAAM,IAAI;AAEvB,sBAAM,KAAK;AACX,yBAAS,KAAK;AACd,uBAAO,KAAK;AACZ,uBAAO,KAAK;AACZ,wBAAQ,KAAK;AACb,uBAAO,KAAK;AACZ,uBAAO,MAAM;AACb,uBAAO,MAAM;AAGb,oBAAI,MAAM,SAAS,MAAM;AACvB,wBAAM,OAAO;AAAA,gBACf;AACA;AAAA,cACF;AACA,oBAAM,OAAO;AACb,yBAAS;AACP,uBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAI,aAAa,MAAM;AAAE;AAAA,gBAAO;AAEhC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAEV;AACA,kBAAI,YAAY,UAAU,SAAU,GAAG;AACrC,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,QAAQ,aACX,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAO;AAE9C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AAEA,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cAChB;AAEA,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,oBAAM,SAAS;AACf,kBAAI,YAAY,GAAG;AAIjB,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,UAAU,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,QAAQ,UAAU;AACxB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cACtB;AAEA,oBAAM,MAAM,MAAM;AAClB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,yBAAS;AACP,uBAAO,MAAM,SAAS,QAAS,KAAK,MAAM,YAAY,CAAE;AACxD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAK,aAAc,MAAM;AAAE;AAAA,gBAAO;AAElC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAEV;AACA,mBAAK,UAAU,SAAU,GAAG;AAC1B,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,SAAS,aACZ,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAO;AAE9C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AAEA,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cAChB;AAEA,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,SAAS;AACf,oBAAM,QAAS,UAAW;AAC1B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cACtB;AAEA,kBAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAGA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAW;AACnC,qBAAO,OAAO;AACd,kBAAI,MAAM,SAAS,MAAM;AACvB,uBAAO,MAAM,SAAS;AACtB,oBAAI,OAAO,MAAM,OAAO;AACtB,sBAAI,MAAM,MAAM;AACd,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACF;AAAA,gBAgBF;AACA,oBAAI,OAAO,MAAM,OAAO;AACtB,0BAAQ,MAAM;AACd,yBAAO,MAAM,QAAQ;AAAA,gBACvB,OACK;AACH,yBAAO,MAAM,QAAQ;AAAA,gBACvB;AACA,oBAAI,OAAO,MAAM,QAAQ;AAAE,yBAAO,MAAM;AAAA,gBAAQ;AAChD,8BAAc,MAAM;AAAA,cACtB,OACK;AACH,8BAAc;AACd,uBAAO,MAAM,MAAM;AACnB,uBAAO,MAAM;AAAA,cACf;AACA,kBAAI,OAAO,MAAM;AAAE,uBAAO;AAAA,cAAM;AAChC,sBAAQ;AACR,oBAAM,UAAU;AAChB,iBAAG;AACD,uBAAO,KAAK,IAAI,YAAY,MAAM;AAAA,cACpC,SAAS,EAAE;AACX,kBAAI,MAAM,WAAW,GAAG;AAAE,sBAAM,OAAO;AAAA,cAAK;AAC5C;AAAA,YACF,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAW;AACnC,qBAAO,KAAK,IAAI,MAAM;AACtB;AACA,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AAEA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,wBAAQ;AACR,qBAAK,aAAa;AAClB,sBAAM,SAAS;AACf,oBAAK,MAAM,OAAO,KAAM,MAAM;AAC5B,uBAAK,QAAQ,MAAM;AAAA,kBAEd,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI;AAAA,gBAEjH;AACA,uBAAO;AAEP,oBAAK,MAAM,OAAO,MAAO,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,MAAM,OAAO;AAC5E,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAGT;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAM,OAAO;AAE7B,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,oBAAK,MAAM,OAAO,KAAM,UAAU,MAAM,QAAQ,aAAa;AAC3D,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAGT;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,qBAAO;AAAA,YACT,KAAK;AAAA;AAAA,YAEL;AACE,qBAAO;AAAA,UACX;AAAA,QACF;AAYA,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,YAAM,OAAO;AACb,YAAM,OAAO;AAGb,UAAI,MAAM,SAAU,SAAS,KAAK,aAAa,MAAM,OAAO,QACvC,MAAM,OAAO,SAAS,UAAU,WAAY;AAC/D,YAAI,aAAa,MAAM,KAAK,QAAQ,KAAK,UAAU,OAAO,KAAK,SAAS,GAAG;AACzE,gBAAM,OAAO;AACb,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,YAAM,SAAS;AACf,UAAK,MAAM,OAAO,KAAM,MAAM;AAC5B,aAAK,QAAQ,MAAM;AAAA,QAChB,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI;AAAA,MACnI;AACA,WAAK,YAAY,MAAM,QAAQ,MAAM,OAAO,KAAK,MAC9B,MAAM,SAAS,OAAO,MAAM,MAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,QAAQ,MAAM;AACvE,WAAM,QAAQ,KAAK,SAAS,KAAM,UAAU,aAAa,QAAQ,MAAM;AACrE,cAAM;AAAA,MACR;AACA,aAAO;AAAA,IACT;AAGA,QAAM,aAAa,CAAC,SAAS;AAE3B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,QAAQ;AAChB,cAAM,SAAS;AAAA,MACjB;AACA,WAAK,QAAQ;AACb,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,MAAM,SAAS;AAGvC,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,WAAK,MAAM,OAAO,OAAO,GAAG;AAAE,eAAO;AAAA,MAAgB;AAGrD,YAAM,OAAO;AACb,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAGA,QAAM,uBAAuB,CAAC,MAAM,eAAe;AACjD,YAAM,aAAa,WAAW;AAE9B,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,cAAQ,KAAK;AAEb,UAAI,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM;AAC3C,eAAO;AAAA,MACT;AAGA,UAAI,MAAM,SAAS,MAAM;AACvB,iBAAS;AAET,iBAAS,QAAQ,QAAQ,YAAY,YAAY,CAAC;AAClD,YAAI,WAAW,MAAM,OAAO;AAC1B,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,aAAa,MAAM,YAAY,YAAY,UAAU;AAC3D,UAAI,KAAK;AACP,cAAM,OAAO;AACb,eAAO;AAAA,MACT;AACA,YAAM,WAAW;AAEjB,aAAO;AAAA,IACT;AAGA,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,gBAAgB;AAC/B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,cAAc;AAC7B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,uBAAuB;AACtC,WAAO,QAAQ,cAAc;AAAA;AAAA;;;AC1hD7B;AAAA;AAAA;AAqBA,aAAS,WAAW;AAElB,WAAK,OAAa;AAElB,WAAK,OAAa;AAElB,WAAK,SAAa;AAElB,WAAK,KAAa;AAElB,WAAK,QAAa;AAElB,WAAK,YAAa;AAWlB,WAAK,OAAa;AAIlB,WAAK,UAAa;AAIlB,WAAK,OAAa;AAElB,WAAK,OAAa;AAAA,IACpB;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACzDjB,IAAAC,mBAAA;AAAA;AAAA;AAGA,QAAM,eAAe;AACrB,QAAM,QAAe;AACrB,QAAM,UAAe;AACrB,QAAM,MAAe;AACrB,QAAM,UAAe;AACrB,QAAM,WAAe;AAErB,QAAM,WAAW,OAAO,UAAU;AAKlC,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MACZ;AAAA,MAAM;AAAA,MAAc;AAAA,MAAa;AAAA,MAAgB;AAAA,MAAc;AAAA,MAAa;AAAA,IAC9E,IAAI;AAIJ,QAAM,iBAAiB;AAAA,MACrB,WAAW,OAAO;AAAA,MAClB,YAAY;AAAA,MACZ,IAAI;AAAA,IACN;AA+EA,aAAS,QAAQ,SAAS;AACxB,WAAK,UAAU,MAAM,OAAO,CAAC,GAAG,gBAAgB,WAAW,CAAC,CAAC;AAE7D,YAAM,MAAM,KAAK;AAIjB,UAAI,IAAI,OAAQ,IAAI,cAAc,KAAO,IAAI,aAAa,IAAK;AAC7D,YAAI,aAAa,CAAC,IAAI;AACtB,YAAI,IAAI,eAAe,GAAG;AAAE,cAAI,aAAa;AAAA,QAAK;AAAA,MACpD;AAGA,UAAK,IAAI,cAAc,KAAO,IAAI,aAAa,MAC3C,EAAE,WAAW,QAAQ,aAAa;AACpC,YAAI,cAAc;AAAA,MACpB;AAIA,UAAK,IAAI,aAAa,MAAQ,IAAI,aAAa,IAAK;AAGlD,aAAK,IAAI,aAAa,QAAQ,GAAG;AAC/B,cAAI,cAAc;AAAA,QACpB;AAAA,MACF;AAEA,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS,CAAC;AAEf,WAAK,OAAS,IAAI,QAAQ;AAC1B,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAU,aAAa;AAAA,QACzB,KAAK;AAAA,QACL,IAAI;AAAA,MACN;AAEA,UAAI,WAAW,MAAM;AACnB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC7B;AAEA,WAAK,SAAS,IAAI,SAAS;AAE3B,mBAAa,iBAAiB,KAAK,MAAM,KAAK,MAAM;AAGpD,UAAI,IAAI,YAAY;AAElB,YAAI,OAAO,IAAI,eAAe,UAAU;AACtC,cAAI,aAAa,QAAQ,WAAW,IAAI,UAAU;AAAA,QACpD,WAAW,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,cAAI,aAAa,IAAI,WAAW,IAAI,UAAU;AAAA,QAChD;AACA,YAAI,IAAI,KAAK;AACX,mBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI,UAAU;AACpE,cAAI,WAAW,MAAM;AACnB,kBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AA2BA,YAAQ,UAAU,OAAO,SAAU,MAAM,YAAY;AACnD,YAAM,OAAO,KAAK;AAClB,YAAM,YAAY,KAAK,QAAQ;AAC/B,YAAM,aAAa,KAAK,QAAQ;AAChC,UAAI,QAAQ,aAAa;AAEzB,UAAI,KAAK,MAAO,QAAO;AAEvB,UAAI,eAAe,CAAC,CAAC,WAAY,eAAc;AAAA,UAC1C,eAAc,eAAe,OAAO,WAAW;AAGpD,UAAI,SAAS,KAAK,IAAI,MAAM,wBAAwB;AAClD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MAClC,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAEA,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,iBAAS;AACP,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,WAAW,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACnB;AAEA,iBAAS,aAAa,QAAQ,MAAM,WAAW;AAE/C,YAAI,WAAW,eAAe,YAAY;AACxC,mBAAS,aAAa,qBAAqB,MAAM,UAAU;AAE3D,cAAI,WAAW,MAAM;AACnB,qBAAS,aAAa,QAAQ,MAAM,WAAW;AAAA,UACjD,WAAW,WAAW,cAAc;AAElC,qBAAS;AAAA,UACX;AAAA,QACF;AAWA,eAAO,KAAK,WAAW,KAChB,WAAW,gBACV,KAAK,MAAM,OAAO,KAAM,KAAK,MAAM,UAAU,KAC9C,KAAK,MAAM,KAAK,OAAO,MAAM,GACpC;AACE,uBAAa,aAAa,IAAI;AAC9B,mBAAS,aAAa,QAAQ,MAAM,WAAW;AAAA,QACjD;AAEA,gBAAQ,QAAQ;AAAA,UACd,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iBAAK,MAAM,MAAM;AACjB,iBAAK,QAAQ;AACb,mBAAO;AAAA,QACX;AAIA,yBAAiB,KAAK;AAEtB,YAAI,KAAK,UAAU;AAGjB,cAAI,KAAK,cAAc,KAAK,WAAW,gBAAgB,cAAc,GAAG;AAEtE,gBAAI,KAAK,QAAQ,OAAO,UAAU;AAEhC,kBAAI,gBAAgB,QAAQ,WAAW,KAAK,QAAQ,KAAK,QAAQ;AAEjE,kBAAI,OAAO,KAAK,WAAW;AAC3B,kBAAI,UAAU,QAAQ,WAAW,KAAK,QAAQ,aAAa;AAG3D,mBAAK,WAAW;AAChB,mBAAK,YAAY,YAAY;AAC7B,kBAAI,KAAM,MAAK,OAAO,IAAI,KAAK,OAAO,SAAS,eAAe,gBAAgB,IAAI,GAAG,CAAC;AAEtF,mBAAK,OAAO,OAAO;AAAA,YAErB,OAAO;AACL,mBAAK,OAAO,KAAK,OAAO,WAAW,KAAK,WAAW,KAAK,SAAS,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAIvG,mBAAK,YAAY;AACjB,mBAAK,WAAW;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AAQA,aAAK,WAAW,QAAQ,WAAW,gBAAgB,mBAAmB,EAAG;AAGzE,YAAI,WAAW,cAAc;AAC3B,mBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,aAAa,GAAG;AASvB,cAAI,gBAAgB,UAAU;AAC5B,qBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,iBAAK,MAAM,WAAW,OAAO,cAAc,MAAM;AACjD,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACT;AACA;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAWA,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACxB;AAYA,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,MAAM;AACnB,YAAI,KAAK,QAAQ,OAAO,UAAU;AAChC,eAAK,SAAS,KAAK,OAAO,KAAK,EAAE;AAAA,QACnC,OAAO;AACL,eAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,QAC/C;AAAA,MACF;AACA,WAAK,SAAS,CAAC;AACf,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACvB;AA0CA,aAAS,QAAQ,OAAO,SAAS;AAC/B,YAAM,WAAW,IAAI,QAAQ,OAAO;AAEpC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,IAAK,OAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAExD,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAC;AACtB,cAAQ,MAAM;AACd,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAaA,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,SAAS;AACxB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;ACvc3B;AAAA;AAAA;AAGA,QAAM,EAAE,SAAS,SAAS,YAAY,KAAK,IAAI;AAE/C,QAAM,EAAE,SAAS,SAAS,YAAY,OAAO,IAAI;AAEjD,QAAM,YAAY;AAElB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,OAAO;AACtB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,SAAS;AACxB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;ACV3B,oBAAuB;;;ACDvB,IAAO,iBAAQ;AAAA;AAAA,EAEX,aAAa;AAAA,EACb,aAAa;AAAA,EACb,aAAa;AAAA;AAAA,EAGb,SAAS;AAAA,EACT,iBAAiB;AAAA,EACjB,gBAAgB;AAAA;AAAA,EAGhB,4BAA4B;AAAA;AAAA,EAG5B,mBAAmB;AAAA,EACnB,kBAAkB;AAAA;AAAA,EAGlB,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,sBAAsB;AAAA,EACtB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,oBAAoB;AAAA;AAAA,EAGpB,yBAAyB;AAAA,EACzB,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,gBAAgB;AAAA;AAAA,EAGhB,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,yBAAyB;AAAA,EACzB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,gBAAgB;AAAA;AAAA,EAGhB,mBAAmB;AAAA,EACnB,iBAAiB;AAAA,EACjB,wBAAwB;AAAA;AAAA,EAGxB,UAAU;AAAA,EAEV,6BAA6B;AAAA,EAC7B,4BAA4B;AAAA,EAC5B,6BAA6B;AAAA,EAC7B,2BAA2B;AAAA,EAC3B,8BAA8B;AAAA,EAC9B,kCAAkC;AAAA,EAClC,sBAAsB;AAAA,EAEtB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EAErB,gBAAgB;AACpB;;;ACrEO,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAC5B,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AACxC,IAAM,8BAA8B;AACpC,IAAM,kBAAkB;AAExB,IAAM,sBAAsB;AAC5B,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAG3B,IAAM,YAAY;AAAA,EACvB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,aAAa;AAAA;AAAA,EACb,OAAa;AAAA;AAAA,EACb,aAAa;AAAA;AAAA,EACb,cAAc;AAAA;AAAA,EACd,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AACd;AACO,IAAM,mBAAmB;AAGzB,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,yBAAyB;AAC/B,IAAM,qBAAqB;AAC3B,IAAM,uBAAuB;AAC7B,IAAM,eAAe,mBAAmB,yBAAyB;AAGjE,IAAM,wBAAwB;AAC9B,IAAM,8BAA8B,IAAI;AAExC,IAAM,yBAA4C,CAAC,IAAM,IAAM,IAAM,CAAI;AAGzE,IAAM,YAAY;AAAA,EACvB,WAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAGO,IAAM,cAAc;AAAA,EACzB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,OAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,cAAc;AAAA;AAAA,EACd,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,aAAa;AAAA;AAAA,EACb,UAAY;AAAA;AAAA,EACZ,eAAe;AAAA;AAAA,EACf,eAAe;AAAA;AAAA,EACf,kBAAkB;AAAA;AACpB;AAGO,IAAM,cAAc;AAAA,EACzB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,SAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,aAAgB;AAAA;AAAA,EAChB,eAAgB;AAAA;AAAA,EAChB,kBAAkB;AAAA;AAAA,EAClB,oBAAoB;AAAA;AAAA,EACpB,iBAAiB;AAAA;AACnB;AAGO,IAAM,oBAAoB;AAAA,EAC/B,WAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,YAAa;AAAA;AAAA,EACb,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,cAAc;AAAA;AAAA,EACd,aAAc;AAAA;AAAA,EACd,eAAe;AAAA;AAAA,EACf,kBAAkB;AAAA;AAAA,EAClB,oBAAoB;AAAA;AAAA,EACpB,aAAe;AAAA;AACjB;AAGO,IAAM,oBAAoB;AAAA,EAC/B,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,oBAAoB;AAAA;AAAA,EACpB,aAAa;AAAA;AACf;AAGO,IAAM,aAAa;AAAA,EACxB,QAAkB;AAAA;AAAA,EAClB,QAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,kBAAkB;AAAA;AAAA,EAClB,OAAkB;AAAA;AAAA,EAClB,MAAkB;AAAA;AAAA,EAClB,WAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,MAAkB;AAAA;AAAA,EAClB,aAAkB;AAAA;AACpB;AAGO,IAAM,UAAU;AAAA,EACrB,WAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,WAAgB;AAAA;AAAA,EAChB,kBAAkB;AAAA;AAAA,EAClB,SAAgB;AAAA;AAAA,EAChB,gBAAgB;AAAA;AAAA;AAAA,EAEhB,KAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,EAIhB,MAAgB;AAAA;AAClB;AAGO,IAAM,yBAAyB;AAAA,EACpC,IAAiB;AAAA,EACjB,MAAiB;AACnB;AAGO,IAAM,SAAS;AAAA,EACpB,OAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,WAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,aAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,UAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,UAAiB;AAAA;AACnB;AAGO,IAAM,cAAc;AAAA,EACzB,OAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AACnB;AAGO,IAAM,gBAAgB;AAAA,EAC3B,UAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,WAAiB;AAAA,EACjB,SAAiB;AACnB;;;AC5MO,IAAM,SAAN,MAAa;AAAA;AAAA;AAAA;AAAA,EAiBlB,OAAO,UAAU,QAAqC;AACpD,SAAK,SAAS,EAAE,GAAG,KAAK,QAAQ,GAAG,OAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,YAA0B;AAC/B,WAAO,EAAE,GAAG,KAAK,OAAO;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAe;AACpB,SAAK,OAAO,UAAU;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAAgB;AACrB,SAAK,OAAO,UAAU;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,OAAuB;AACrC,SAAK,OAAO,QAAQ;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAMA,OAAe,UAAU,OAA0B;AACjD,QAAI,CAAC,KAAK,OAAO,QAAS,QAAO;AAEjC,UAAM,SAAqB,CAAC,SAAS,QAAQ,QAAQ,SAAS,QAAQ;AACtE,UAAM,oBAAoB,OAAO,QAAQ,KAAK,OAAO,KAAK;AAC1D,UAAM,sBAAsB,OAAO,QAAQ,KAAK;AAEhD,WAAO,uBAAuB;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,OAAO,MAAmB;AAC/B,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,IAAI,GAAG,IAAI;AAAA,IAClC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,MAAmB;AACjC,QAAI,KAAK,UAAU,OAAO,GAAG;AAC3B,WAAK,gBAAgB,MAAM,GAAG,IAAI;AAAA,IACpC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,QAAQ,MAAmB;AAChC,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,KAAK,GAAG,IAAI;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,MAAmB;AACjC,QAAI,KAAK,UAAU,OAAO,GAAG;AAE3B,WAAK,gBAAgB,IAAI,GAAG,IAAI;AAAA,IAClC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,QAAQ,MAAmB;AAChC,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,KAAK,GAAG,IAAI;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,kBAAwB;AAC7B,YAAQ,MAAM,IAAI,SAAgB,KAAK,IAAI,GAAG,IAAI;AAClD,YAAQ,QAAQ,IAAI,SAAgB,KAAK,MAAM,GAAG,IAAI;AACtD,YAAQ,OAAO,IAAI,SAAgB,KAAK,KAAK,GAAG,IAAI;AACpD,YAAQ,QAAQ,IAAI,SAAgB,KAAK,MAAM,GAAG,IAAI;AACtD,YAAQ,OAAO,IAAI,SAAgB,KAAK,KAAK,GAAG,IAAI;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,iBAAuB;AAC5B,YAAQ,MAAM,KAAK,gBAAgB;AACnC,YAAQ,QAAQ,KAAK,gBAAgB;AACrC,YAAQ,OAAO,KAAK,gBAAgB;AACpC,YAAQ,QAAQ,KAAK,gBAAgB;AACrC,YAAQ,OAAO,KAAK,gBAAgB;AAAA,EACtC;AAEF;AApIa,OACI,SAAuB;AAAA,EACpC,SAAS;AAAA,EACT,OAAO;AACT;AAJW,OAMI,kBAAkB;AAAA,EAC/B,KAAK,QAAQ;AAAA,EACb,OAAO,QAAQ;AAAA,EACf,MAAM,QAAQ;AAAA,EACd,OAAO,QAAQ;AAAA,EACf,MAAM,QAAQ;AAChB;AA6HK,SAAS,iCAAuC;AACrD,QAAM,MAAM,OAAO,YAAY,cAAc,QAAQ,MAAM,CAAC;AAG5D,MAAI,IAAI,iBAAiB,SAAS;AAChC,WAAO,QAAQ;AAAA,EACjB,WAAW,IAAI,iBAAiB,QAAQ;AACtC,WAAO,OAAO;AACd,WAAO,SAAS,OAAO;AAAA,EACzB;AAGA,MAAI,IAAI,kBAAkB;AACxB,UAAM,QAAQ,IAAI;AAClB,QAAI,CAAC,SAAS,QAAQ,QAAQ,SAAS,QAAQ,EAAE,SAAS,KAAK,GAAG;AAChE,aAAO,SAAS,KAAK;AAAA,IACvB;AAAA,EACF;AAGA,MAAI,IAAI,aAAa,cAAc;AACjC,WAAO,SAAS,OAAO;AAAA,EACzB;AACF;AAIA,+BAA+B;;;AC5K/B,IAAM,YAAY,OAAO,WAAW,cAAc,SAAU,OAAO,WAAW,eAAe,OAAO,SAAS,OAAO,SAAS;AAE7H,IAAI,CAAC,aAAa,CAAC,UAAU,QAAQ;AACnC,QAAM,IAAI,MAAM,qDAAqD;AACvE;AAGA,SAAS,wBAAwB,QAAQ;AACvC,SAAO,IAAI,WAAW,MAAM;AAC9B;AAGA,SAAS,SAAS,MAAM;AACtB,MAAI,gBAAgB,YAAY;AAC9B,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACA,MAAI,gBAAgB,aAAa;AAC/B,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACA,SAAO,OAAO,KAAK,IAAI;AACzB;AAGA,eAAe,WAAW,WAAW;AACnC,QAAM,UAAU;AAAA,IACd,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,OAAO;AAAA,EACT;AAEA,QAAM,UAAU,QAAQ,UAAU,YAAY,CAAC,KAAK;AAEpD,SAAO;AAAA,IACL,QAAQ,SAAS,MAAM;AACrB,WAAK,QAAQ,KAAK,QAAQ,OAAO,OAAO,CAAC,KAAK,OAAO,SAAS,IAAI,CAAC,CAAC,IAAI,SAAS,IAAI;AACrF,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,eAAe,UAAU;AAC/B,YAAM,OAAO,KAAK,SAAS,OAAO,MAAM,CAAC;AACzC,YAAM,aAAa,MAAM,UAAU,OAAO,OAAO,SAAS,IAAI;AAC9D,YAAM,YAAY,wBAAwB,UAAU;AAEpD,UAAI,aAAa,OAAO;AACtB,eAAO,MAAM,KAAK,SAAS,EACxB,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EACxC,KAAK,EAAE;AAAA,MACZ;AACA,UAAI,aAAa,UAAU;AACzB,eAAO,OAAO,KAAK,SAAS,EAAE,SAAS,QAAQ;AAAA,MACjD;AACA,aAAO,OAAO,KAAK,SAAS;AAAA,IAC9B;AAAA,EACF;AACF;AAGA,SAAS,YAAY,MAAM;AACzB,QAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,YAAU,gBAAgB,KAAK;AAC/B,SAAO,OAAO,KAAK,KAAK;AAC1B;AAKA,SAAS,QAAQ,MAAM;AACrB,QAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI;AACxE,QAAM,MAAM,IAAI;AAChB,QAAM,SAAS,MAAM;AACrB,QAAM,SAAS,MAAO,MAAM,KAAK;AACjC,QAAM,WAAW,MAAM,KAAK,SAAS,IAAI,SAAS,KAAK,UAAU;AACjE,QAAM,SAAS,OAAO,MAAM,QAAQ;AACpC,MAAI,KAAK,QAAQ,CAAC;AAClB,SAAO,GAAG,IAAI;AACd,SAAO,cAAe,SAAS,eAAiB,GAAG,WAAW,CAAC;AAC/D,SAAO,cAAc,WAAW,GAAG,WAAW,CAAC;AAE/C,QAAM,IAAI,CAAC,YAAY,YAAY,YAAY,WAAY,UAAU;AACrE,QAAM,IAAI,CAAC,YAAY,YAAY,YAAY,UAAU;AACzD,QAAM,IAAI,IAAI,MAAM,EAAE;AAEtB,WAAS,MAAM,GAAG,MAAM,UAAU,OAAO,IAAI;AAC3C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAE,CAAC,IAAI,OAAO,aAAa,MAAM,IAAI,CAAC;AAAA,IACxC;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,QAAE,CAAC,KAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,KAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO;AAAA,IACnH;AACA,QAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI;AACtB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAI,GAAG;AACP,UAAI,IAAI,IAAI;AACV,YAAK,IAAI,IAAO,CAAC,IAAK;AACtB,YAAI,EAAE,CAAC;AAAA,MACT,WAAW,IAAI,IAAI;AACjB,YAAI,IAAI,IAAI;AACZ,YAAI,EAAE,CAAC;AAAA,MACT,WAAW,IAAI,IAAI;AACjB,YAAK,IAAI,IAAM,IAAI,IAAM,IAAI;AAC7B,YAAI,EAAE,CAAC;AAAA,MACT,OAAO;AACL,YAAI,IAAI,IAAI;AACZ,YAAI,EAAE,CAAC;AAAA,MACT;AACA,WAAO,KAAK,IAAM,MAAM,MAAO,IAAI,IAAI,KAAK,EAAE,CAAC,MAAM,OAAQ;AAC7D,UAAI;AAAG,UAAI;AAAG,UAAK,KAAK,KAAO,MAAM;AAAI,UAAI;AAAG,UAAI;AAAA,IACtD;AACA,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAA,EAC5H;AAEA,QAAM,MAAM,OAAO,MAAM,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,cAAc,EAAE,CAAC,GAAG,IAAI,CAAC;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,SAAS,SAAS,KAAK,MAAM;AAC3B,QAAM,WAAW;AACjB,MAAI,IAAI,OAAO,SAAS,GAAG,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;AACjE,MAAI,EAAE,SAAS,UAAU;AACvB,QAAI,QAAQ,CAAC;AAAA,EACf;AACA,MAAI,EAAE,SAAS,UAAU;AACvB,QAAI,OAAO,OAAO,CAAC,GAAG,OAAO,MAAM,WAAW,EAAE,MAAM,CAAC,CAAC;AAAA,EAC1D;AACA,QAAM,OAAO,OAAO,MAAM,UAAU,EAAI;AACxC,QAAM,OAAO,OAAO,MAAM,UAAU,EAAI;AACxC,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,SAAK,CAAC,KAAK,EAAE,CAAC;AACd,SAAK,CAAC,KAAK,EAAE,CAAC;AAAA,EAChB;AACA,QAAM,QAAQ,QAAQ,OAAO,OAAO,CAAC,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;AAC7F,SAAO,QAAQ,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK,MAAM,YAAY,QAAQ,QAAQ;AACzD,MAAI,UAAU,OAAO,YAAY,MAAM,QAAQ;AAC7C,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,OAAO;AACb,QAAM,SAAS,KAAK,KAAK,SAAS,IAAI;AACtC,QAAM,SAAS,CAAC;AAChB,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,QAAM,UAAU,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI;AAC/D,WAAS,IAAI,GAAG,KAAK,QAAQ,KAAK;AAChC,UAAM,OAAO,OAAO,KAAK,CAAE,MAAM,KAAM,KAAO,MAAM,KAAM,KAAO,MAAM,IAAK,KAAM,IAAI,GAAI,CAAC;AAC3F,QAAI,IAAI,SAAS,QAAQ,OAAO,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;AACvD,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,aAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,UAAI,SAAS,QAAQ,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,MAAM,IAAK,OAAM,CAAC,KAAK,EAAE,CAAC;AAAA,IAChD;AACA,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,OAAO,OAAO,MAAM,EAAE,SAAS,GAAG,MAAM;AACjD;AAEA,SAAS,WAAW,WAAW,KAAK;AAClC,MAAI,cAAc,QAAQ;AACxB,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AACA,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,MAAI,OAAO,OAAO,MAAM,CAAC;AACzB,SAAO;AAAA,IACL,OAAO,OAAO;AACZ,aAAO,OAAO,OAAO,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAK,CAAC,CAAC;AAChF,aAAO;AAAA,IACT;AAAA,IACA,SAAS;AACP,YAAM,MAAM,SAAS,QAAQ,IAAI;AACjC,aAAO,OAAO,MAAM,CAAC;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAGA,IAAM,WAAW,IAAI,WAAW,CAAC,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,GAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,GAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,GAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,GAAK,KAAK,IAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,IAAK,IAAK,IAAK,GAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,GAAK,KAAK,IAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,EAAI,CAAC;AACjyC,IAAM,WAAW,IAAI,WAAW,CAAC,GAAK,GAAK,GAAK,GAAK,IAAK,IAAK,IAAK,KAAK,IAAK,EAAI,CAAC;AACnF,SAAS,mBAAmB,KAAK;AAC/B,QAAM,IAAI,IAAI,WAAW,GAAG;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,IAAI,CAAC;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,IAAI,IAAI;AACd,UAAM,QAAQ,IAAI,KAAK;AACvB,UAAM,KAAK,IAAI,KAAK;AACpB,QAAI,IAAI,MAAM,GAAG;AACf,YAAM,KAAK,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,SAAU,IAAI,IAAK,CAAC;AACpD,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI;AAAI,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AAAA,IACvI,WAAW,IAAI,MAAM,GAAG;AACtB,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAA,IACrJ,OAAO;AACL,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAA,IAC7G;AAAA,EACF;AACA,SAAO;AACT;AACA,SAAS,MAAM,GAAG;AAChB,SAAU,KAAK,IAAK,OAAW,MAAM,IAAK,KAAK;AACjD;AACA,SAAS,sBAAsB,aAAa,OAAO;AACjD,QAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,MAAM,CAAC,IAAI,YAAY,CAAC;AAC5D,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AACjD,UAAMC,KAAI,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AACxD,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AAAI,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AACtE,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAEA;AACzD,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,IAAI,EAAE,IAAE,CAAC;AAAG,YAAM,IAAI,EAAE,IAAE,IAAE,CAAC;AAAG,YAAM,KAAK,EAAE,IAAE,IAAE,CAAC;AAAG,YAAM,IAAI,EAAE,IAAE,IAAE,CAAC;AAC5E,QAAE,IAAE,CAAC,IAAM,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,IAAI,KAAK;AAC1C,QAAE,IAAE,IAAE,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,MAAM,EAAE,IAAI,KAAK;AAC3C,QAAE,IAAE,IAAE,CAAC,IAAI,IAAI,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI;AAC1C,QAAE,IAAE,IAAE,CAAC,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,CAAC;AAAA,IAC5C;AACA,UAAM,KAAK,IAAI;AACf,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,KAAK,YAAY,KAAK,CAAC;AAAA,EACzD;AACA,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AACjD,QAAM,IAAI,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AACxD,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AAAI,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AACtE,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE;AACzD,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,KAAK,YAAY,MAAM,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,eAAe,WAAW,KAAK,IAAI;AAC1C,MAAI,cAAc,iBAAkB,OAAO,QAAQ,OAAO,QAAY;AACpE,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,MAAI,OAAO,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAC5E,QAAM,cAAc,mBAAmB,MAAM;AAC7C,SAAO;AAAA,IACL,iBAAiB;AACf,aAAO;AAAA,IACT;AAAA,IACA,OAAO,OAAO;AACZ,YAAM,IAAI,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAK;AAC5D,UAAI,EAAE,WAAW,IAAI;AACnB,cAAM,IAAI,MAAM,mDAAmD;AAAA,MACrE;AACA,YAAM,MAAM,sBAAsB,aAAa,CAAC;AAChD,aAAO,OAAO,KAAK,GAAG;AAAA,IACxB;AAAA,IACA,QAAQ;AACN,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AACF;;;ACtPO,IAAM,aAAN,MAAM,WAAwC;AAAA;AAAA,EAGnD,UAAU,QAAmC;AAC3C,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,eAAuB;AACrB,WAAO,WAAU;AAAA,EACnB;AAAA,EAEA,MAAM,QAAQ,MAAc,SAAuD;AACjF,QAAI;AACF,UAAI,QAAQ,+BAAwC;AAClD,eAAO;AAAA,UACL,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,OAAO,KAAK,SAAS,QAAQ,QAAQ;AAG3C,YAAM,gBAAgB,OAAO,MAAM,KAAK,MAAM;AAE9C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,OAAO,KAAK,CAAC;AACnB,cAAM,gBAAgB,KAAK,YAAY,MAAM,IAAI;AACjD,sBAAc,CAAC,IAAI;AACnB,aAAK,WAAW,MAAM,IAAI;AAAA,MAC5B;AAEA,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,QAAQ,MAAc,SAAuD;AACjF,QAAI;AACF,UAAI,QAAQ,+BAAwC;AAClD,eAAO;AAAA,UACL,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,OAAO,KAAK,SAAS,QAAQ,QAAQ;AAG3C,YAAM,gBAAgB,OAAO,MAAM,KAAK,MAAM;AAE9C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,gBAAgB,KAAK,CAAC;AAC5B,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,sBAAc,CAAC,IAAI;AACnB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAEA,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAe,iBAAyB,WAAyB;AAC/D,QAAI,gBAAgB,SAAS,IAAI;AAC/B,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAGA,QAAI,gBAAgB,EAAE,MAAM,WAAW;AACrC,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,8BAA8B,mBAA2B,OAKvD;AAEA,QAAI,kBAAkB,aAAa,CAAC,MAAM,UAAY;AACpD,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AAGA,UAAM,WAAW,kBAAkB,aAAa,CAAC;AACjD,UAAM,kBAAkB,kBAAkB,aAAa,EAAE;AACzD,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAGlD,QAAK,WAAW,QAAQ,cAAe,CAAE,MAAc,mBAAoB,MAAc,oBAAoB,IAAI;AAC/G,MAAC,MAAc,kBAAkB;AAAA,IACnC;AAGA,IAAC,MAAc,WAAW;AAG1B,QAAI;AACJ,QAAI,WAAW,QAAQ,WAAW;AAChC,YAAM,WAAY,MAAc,mBAAmB,MAAM,eAAe;AACxE,kBAAa,YAAY,IAAK;AAAA,IAChC,OAAO;AACL,YAAM,MAAM,YAAY,aAAa,IAAI,WAAW,MAAM;AAC1D,kBAAa,OAAO,KAAM;AAAA,IAC5B;AAEA,WAAO,EAAE,UAAU,iBAAiB,UAAU,UAAU;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,uBAAuB,OAAiB,UAA0B;AAChE,UAAM,SAAS,OAAO,MAAM,gBAAgB;AAG5C,UAAM,SAAS,YAAY,EAAE;AAC7B,WAAO,KAAK,QAAQ,CAAC;AAKrB,QAAI;AACJ,SAAK,MAAM,WAAW,QAAQ,eAAe,GAAG;AAC9C,YAAM,WAAW,MAAM,mBAAmB,MAAM,eAAe;AAC/D,kBAAa,YAAY,IAAK;AAAA,IAChC,OAAO;AAEL,kBAAa,MAAM,OAAO,KAAM;AAAA,IAClC;AAGA,WAAO,EAAE,IAAI;AAEb,WAAO,MAAM,sDAAsD,UAAU,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,gBAAgB,MAAM,WAAW,QAAQ,eAAe,CAAC,EAAE;AAErK,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAc,OAAiB,gBAAwB,UAA0B;AAE/E,UAAM,SAAS,KAAK,uBAAuB,OAAO,QAAQ;AAG1D,UAAM,gBAAgB,OAAO,OAAO,CAAC,QAAQ,cAAc,CAAC;AAG5D,UAAM,OAAO,KAAK,SAAS,QAAQ;AAInC,UAAM,gBAAgB,OAAO,MAAM,cAAc,MAAM;AAEvD,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,YAAM,OAAO,cAAc,CAAC;AAC5B,YAAM,gBAAgB,KAAK,YAAY,MAAM,IAAI;AACjD,oBAAc,CAAC,IAAI;AAEnB,WAAK,WAAW,MAAM,IAAI;AAAA,IAC5B;AAEA,WAAO,MAAM,iCAAiC,eAAe,MAAM,4BAA4B,gBAAgB,mBAAmB,cAAc,MAAM,cAAc;AAEpK,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,cAAc,OAAiB,QAAgB,eAAuB,UAA0B;AAE9F,UAAM,YAAY,OAAO,SAAS,MAAM,cAAc;AACtD,UAAM,oBAAoB,UAAU,SAAS,GAAG,EAAE;AAGlD,UAAM,EAAE,UAAU,UAAU,UAAU,IAAI,KAAK,8BAA8B,mBAAmB,KAAK;AAKrG,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAClD,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAClD,UAAM,YAAY,KAAK,WAAW;AAClC,UAAMC,oBAAmB;AACzB,UAAM,gBAAgB,UAAU,SAAS,WAAW,YAAYA,iBAAgB;AAGhF,UAAM,0BAA0B,OAAO,OAAO,CAAC,eAAe,aAAa,CAAC;AAK5E,UAAM,OAAO,KAAK,SAAS,QAAQ;AAEnC,aAAS,IAAI,GAAG,IAAI,wBAAwB,QAAQ,KAAK;AACvD,YAAM,gBAAgB,wBAAwB,CAAC;AAC/C,YAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,8BAAwB,CAAC,IAAI;AAC7B,WAAK,WAAW,MAAM,aAAa;AAAA,IACrC;AAIA,UAAM,kBAAkB,wBAAwB,SAAS,GAAGA,iBAAgB;AAG5E,SAAK,eAAe,iBAAiB,SAAS;AAG9C,WAAO,wBAAwB,SAASA,iBAAgB;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,OAAO,sBACL,UACA,WACA,iBACwB;AAExB,UAAM,OAAO,KAAK,SAAS,QAAQ;AAGnC,UAAMA,oBAAmB;AACzB,UAAM,eAAe,OAAO,MAAMA,iBAAgB;AAClD,QAAI,uBAAuB;AAC3B,QAAI,eAA8B;AAClC,QAAI,qBAAqB;AAIzB,WAAO,uBAAuBA,mBAAkB;AAE9C,UAAI,CAAC,gBAAgB,sBAAsB,aAAa,QAAQ;AAC9D,cAAM,SAAS,MAAM,gBAAgB,KAAK;AAE1C,YAAI,OAAO,QAAQ,CAAC,OAAO,OAAO;AAChC,gBAAM,IAAI,MAAM,qEAAqE;AAAA,QACvF;AAEA,uBAAe,OAAO;AACtB,6BAAqB;AAAA,MACvB;AAGA,YAAM,cAAcA,oBAAmB;AACvC,YAAM,cAAc,KAAK,IAAI,aAAa,aAAa,SAAS,kBAAkB;AAElF,mBAAa,KAAK,cAAc,sBAAsB,oBAAoB,qBAAqB,WAAW;AAC1G,8BAAwB;AACxB,4BAAsB;AAAA,IACxB;AAKA,aAAS,IAAI,GAAG,IAAIA,mBAAkB,KAAK;AACzC,YAAM,gBAAgB,aAAa,CAAC;AACpC,YAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa,IAAI;AAC9D,mBAAa,CAAC,IAAI;AAElB,WAAK,WAAW,MAAM,aAAa;AAAA,IACrC;AAIA,SAAK,eAAe,cAAc,SAAS;AAK3C,QAAI,gBAAgB,qBAAqB,aAAa,QAAQ;AAC5D,YAAM,mBAAmB,aAAa,SAAS;AAE/C,eAAS,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACzC,cAAM,MAAM,qBAAqB;AACjC,cAAM,gBAAgB,aAAa,GAAG;AACtC,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,qBAAa,GAAG,IAAI;AAEpB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAGA,YAAM,aAAa,SAAS,kBAAkB;AAAA,IAChD;AAKA,qBAAiB,kBAAkB,iBAAiB;AAGlD,eAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,cAAM,gBAAgB,eAAe,CAAC;AACtC,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,uBAAe,CAAC,IAAI;AAEpB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAGA,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,SAAS,UAA4B;AAC3C,UAAM,OAAO,CAAC,WAAY,WAAY,SAAU;AAEhD,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,WAAK,WAAW,MAAM,SAAS,WAAW,CAAC,CAAC;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,WAAW,MAAgB,MAAoB;AACrD,SAAK,CAAC,KAAM,KAAK,CAAC,MAAM,IAAK,WAAU,WAAW,KAAK,CAAC,IAAI,QAAQ,GAAI,OAAO;AAE/E,SAAK,CAAC,KAAM,KAAK,KAAK,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,MAAO,SAAU,IAAI,IAAK,gBAAgB;AACrF,SAAK,CAAC,KAAM,KAAK,CAAC,MAAM,IAAK,WAAU,WAAW,KAAK,CAAC,IAAK,KAAK,CAAC,MAAM,MAAO,GAAI,OAAO;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,YAAY,MAAgB,MAAsB;AACxD,UAAM,OAAO,KAAK,CAAC,IAAI;AAEvB,YAAQ,OAAQ,KAAK,KAAK,MAAO,OAAO,CAAE,MAAM,KAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,YAAY,MAAgB,eAA+B;AACjE,UAAM,OAAO,KAAK,CAAC,IAAI;AAEvB,YAAQ,gBAAiB,KAAK,KAAK,MAAO,OAAO,CAAE,MAAM,KAAM;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA,EAuDQ,MAAM,KAAa,MAAsB;AAC/C,YAAS,QAAQ,IAAK,WAAU,WAAW,MAAM,QAAQ,GAAI,OAAO;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,MAAM,KAA8B;AACzC,WAAO,UAAU,GAAG;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,YAAY,KAAa,MAAsB;AACpD,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC;AACF;AA3ea,WACa,aAAa;AAAA;AAAA;AAAA;AAD1B,WAiaK,YAAY;AAAA,EAC1B;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACtC;AA7cK,IAAM,YAAN;AAmfP,SAAS,UAAU,KAA8B;AAC/C,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,OAAO,KAAK,KAAK,MAAM;AAAA,EAC/B;AAEA,MAAI,MAAM,IAAI;AACd,MAAI,MAAM,CAAC;AACX,WAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,UAAM,UAAU,WAAW,MAAM,IAAI,KAAK,KAAK,GAAI,IAAK,QAAQ;AAAA,EAClE;AAGA,SAAO,CAAC,QAAQ;AAClB;AASA,SAAS,gBAAgB,KAAa,MAAsB;AAC1D,SAAO,UAAU,WAAW,MAAM,QAAQ,GAAI,IAAK,QAAQ;AAC7D;AAQO,SAAS,MAAM,KAA8B;AAClD,SAAO,UAAU,GAAG;AACtB;AASO,SAAS,YAAY,KAAa,MAAsB;AAC7D,SAAO,gBAAgB,KAAK,IAAI;AAClC;AAMO,SAAS,OAAO,MAAsB;AAC3C,QAAM,OAAO,WAAW,QAAQ;AAChC,SAAO,KACJ,OAAO,IAAI,EACX,OAAO,KAAK;AACjB;;;AC3hBA,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,kBAAkB;AAKxB,IAAqB,WAArB,MAAsD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqEpD,YAAY,OAAsB,SAAyB,OAAiB;AApE5E,iBAAQ;AAER,qBAAoB;AACpB;AAAA,sBAAqB;AACrB;AAAA,oBAAmB;AACnB;AAAA,qBAAoB;AACpB;AAAA,uBAAsB;AACtB;AAAA,eAAc;AACd;AAAA,0BAAyB;AACzB;AAAA,4BAA2B;AAC3B;AAAA,qBAAoB;AACpB;AAAA,uBAAsB;AACtB;AAAA,uBAAsB;AACtB;AAAA,0BAAyB;AACzB;AAAA,oBAAmB;AACnB;AAAA,sBAA4B;AAC5B;AAAA,mBAAyB;AAGzB;AAAA;AAAA,sBAA4B;AAG5B;AAAA;AAAA,mBAAyB;AAEzB;AAAA,uBAAuB;AACvB;AAAA,2BAA2B;AAC3B;AAAA,sBAA4B;AAC5B;AAAA,2BAA0B;AAC1B;AAAA,mBAA2B;AAG3B;AAAA;AAAA,sBAAqB;AACrB;AAAA,uBAAsB;AACtB;AAAA,yBAAwB;AAGxB;AAAA;AAAA,mCAAkC;AAClC,8BAA6B;AAC7B,0BAAyB;AAEzB,qBAAqB;AACrB;AAAA,uBAAuB;AACvB;AAAA,sBAAsB;AAGtB;AAAA;AAAA,oBAA0B;AAC1B;AAAA,yBAA+B;AAC/B;AAAA,eAAqB;AACrB;AAAA,eAAqB;AACrB;AAAA,kBAAwB;AAGxB;AAAA;AAAA,qBAAqB;AACrB;AAAA,sBAA4B;AAG5B;AAAA;AAAA,sBAAsB;AACtB;AAAA,yBAA+B;AAC/B;AAAA,iBAAuB;AAmBvB,mBAAU,KAAK,aAAa;AAC5B,sBAAa,KAAK,YAAY,QAAQ,KAAK,aAAa;AACxD,mBAAU,KAAK,YAAY,QAAQ,KAAK,aAAa;AACrD,mBAAU,KAAK,YAAY,QAAQ,KAAK,aAAa;AAErD,wBAAe,MAAM;AACnB,cAAQ,KAAK,UAAU;AAAA,QACrB,KAAK;AACH,iBAAQ,YAAY,UAAU,IAAK;AAAA;AAAA,QACvC,KAAK;AACH,iBAAQ,YAAY,QAAQ,IAAK;AAAA;AAAA,QACnC;AACE,iBAAQ,YAAY,QAAQ,IAAK;AAAA,MACnC;AAAA,IACF,GAAG;AAtBD,SAAK,WAAW,SAAS;AACzB,SAAK,UAAU,WAAW;AAC1B,SAAK,QAAQ,SAAS;AAGtB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,aAAa,MAAsB;AAEjC,QAAI,KAAK,SAAS,YAAY,MAAM;AAClC,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAIA,QAAI,KAAK,aAAa,CAAC,MAAM,YAAY,WAAW;AAClD,YAAM,IAAI,MAAM,eAAO,WAAW;AAAA,IACpC;AAGA,SAAK,YAAY,KAAK,aAAa,YAAY,QAAQ;AAEvD,SAAK,aAAa,KAAK,aAAa,YAAY,OAAO;AAEvD,SAAK,WAAW,KAAK,aAAa,YAAY,KAAK;AAEnD,SAAK,KAAK,WAAW,QAAQ,cAAc,GAAG;AAC5C,WAAK,cAAc;AACnB,WAAK,KAAK,WAAW,QAAQ,mBAAmB;AAC9C,aAAK,kBAAkB;AAAA,IAC3B;AAEA,SAAK,YAAY,KAAK,aAAa,YAAY,UAAU;AAEzD,SAAK,cAAc,KAAK,aAAa,YAAY,YAAY;AAG7D,SAAK,MAAM,KAAK,aAAa,YAAY,GAAG;AAE5C,SAAK,iBAAiB,KAAK,aAAa,YAAY,QAAQ;AAE5D,SAAK,mBAAmB,KAAK,aAAa,YAAY,UAAU;AAEhE,SAAK,YAAY,KAAK,aAAa,YAAY,QAAQ;AAEvD,SAAK,cAAc,KAAK,aAAa,YAAY,aAAa;AAE9D,SAAK,cAAc,KAAK,aAAa,YAAY,aAAa;AAC9D,QAAI,KAAK,cAAc,cAAc;AACnC,WAAK,cAAc;AAGrB,SAAK,iBAAiB,KAAK,aAAa,YAAY,gBAAgB;AAGpE,QAAI,WAAW,KAAK,aAAa,YAAY,SAAS;AACtD,UAAM,WAAW,KAAK,SAAS,QAAQ,YAAY,MAAM,YAAY,OAAO,QAAQ;AACpF,SAAK,WAAW;AAChB,QAAI,KAAK,SAAS,SAAS,GAAG;AAC5B,WAAK,cAAc;AAGrB,QAAI,WAAW,KAAK,aAAa,YAAY,SAAS;AACtD,QAAI,WAAW,GAAG;AAChB,WAAK,aAAa,KAAK,SAAS,YAAY,OAAO,UAAU,YAAY,OAAO,WAAW,QAAQ;AAGnG,eAAS,IAAI,GAAG,IAAI,YAAY;AAC9B,YAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,YAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAC7C,YAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,YAAI,QAAQ,OAAO,gBAAgB,QAAQ,GAAG;AAE5C,gBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,gBAAM,YAAY,MAAM,aAAa,CAAC;AAGtC,gBAAM,WAAW,OAAO,KAAK,KAAK,QAAQ;AAC1C,gBAAM,gBAAgB,MAAM,QAAQ;AAGpC,cAAI,kBAAkB,WAAW;AAC/B,kBAAM,cAAc,MAAM,SAAS,CAAC,EAAE,SAAS,MAAM;AACrD,iBAAK,WAAW;AAChB,gBAAI,KAAK,OAAO;AACd,qBAAO,IAAI,uBAAuB,KAAK,QAAQ,EAAE;AAAA,YACnD;AAAA,UACF;AAAA,QACF;AACA,aAAK,IAAI;AAAA,MACX;AAGA,eAAS,IAAI,GAAG,IAAI,YAAY;AAC9B,YAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,YAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAC7C,YAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,YAAI,QAAQ,OAAO,QAAQ;AACzB,cAAI,SAAS;AAEX,iBAAK,SAAS,MAAM,SAAS,MAAM;AAAA;AAEnC,iBAAK,SAAS,MAAM,SAAS,KAAK;AAAA,QACtC,WAAW,QAAQ,OAAO,UAAU;AAElC,cAAI,QAAQ,GAAG;AACb,kBAAM,QAAQ,MAAM,UAAU,CAAC;AAE/B,gBAAI,QAAQ,GAAM;AAChB,mBAAK,gBAAgB,MAAM,aAAa,CAAC;AAAA,YAC3C;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,SAAS;AAEjC,cAAI,QAAQ,GAAG;AACb,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,gBAAI,WAAW,KAAK,QAAQ,IAAI,SAAS;AAEvC,mBAAK,MAAM,MAAM,WAAW,GAAG,OAAO;AAGtC,kBAAI,QAAQ,IAAI,UAAU,GAAG;AAC3B,sBAAM,UAAU,MAAM,UAAU,IAAI,OAAO;AAC3C,oBAAI,WAAW,KAAK,QAAQ,IAAI,UAAU,IAAI,SAAS;AACrD,uBAAK,MAAM,MAAM,WAAW,IAAI,UAAU,GAAG,OAAO;AAAA,gBACtD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,SAAS;AAEjC,cAAI,QAAQ,GAAG;AACb,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,kBAAM,eAAe,MAAM,aAAa,CAAC;AACzC,gBAAI,eAAe,KAAK,QAAQ,IAAI,cAAc;AAChD,mBAAK,YAAY;AACjB,mBAAK,aAAa,MAAM,SAAS,GAAG,IAAI,YAAY,EAAE,SAAS,MAAM;AAAA,YACvE;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,UAAU;AAElC,cAAI,QAAQ,IAAI;AACd,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,iBAAK,QAAQ,MAAM,aAAa,CAAC;AACjC,kBAAM,iBAAiB,MAAM,aAAa,CAAC;AAC3C,gBAAI,iBAAiB,KAAK,QAAQ,IAAI,gBAAgB;AACpD,mBAAK,aAAa;AAClB,mBAAK,gBAAgB,MAAM,SAAS,GAAG,IAAI,cAAc,EAAE,SAAS,MAAM;AAAA,YAC5E;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,KAAK;AAE7B,cAAI,QAAQ,GAAG;AACb,iBAAK,aAAa,MAAM,aAAa,CAAC;AAEtC,iBAAK,cAAc,MAAM,UAAU,CAAC;AACpC,iBAAK,gBAAgB,MAAM,aAAa,CAAC;AAAA,UAC3C;AAAA,QACF,WAAW,QAAQ,OAAO,YAAY;AACpC,cAAI,QAAQ,uBAAuB;AACjC,gBACE,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,GACrC;AACA,mBAAK,0BAA0B,MAAM,UAAU,CAAC;AAChD,mBAAK,qBAAqB,MAAM,aAAa,CAAC;AAC9C,mBAAK,iBAAiB,MAAM,aAAa,CAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QACF;AAEA,aAAK,IAAI;AAAA,MACX;AAAA,IACF;AAGA,QAAI,SAAS,KAAK,aAAa,YAAY,WAAW;AACtD,QAAI,SAAS;AACX,WAAK,UAAU,KAAK,SAAS,QAAQ,YAAY,OAAO,UAAU,YAAY,OAAO,WAAW,MAAM;AAExG,QAAI,KAAK;AACP,WAAK,gBAAgB;AAGvB,QAAI,UAAU,YAAY,OAAO,WAAW,WAAW;AACvD,WAAO,KAAK,SAAS,OAAO;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,uBAAgC;AAE9B,WAAO,oBAAoB,KAAK,KAAK,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,oBAAoB,QAAgB,QAAwB;AAElE,UAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM;AAIxD,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,eAAe,OAAO,KAAK,WAAW,OAAO;AACnD,UAAM,YAAY,MAAM,YAAY;AAGpC,UAAM,iBAAiB,IAAI,eAAe;AAG1C,WAAO,cAAc,OAAO,cAAc,MAAM;AAChD,WAAO,cAAc,gBAAgB,SAAS,CAAC;AAC/C,WAAO,WAAW,GAAG,SAAS,CAAC;AAC/B,WAAO,cAAc,WAAW,SAAS,CAAC;AAC1C,mBAAe,KAAK,QAAQ,SAAS,CAAC;AAEtC,WAAO,SAAS,IAAI;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAyB;AACvB,QAAI,gBAAgB;AAGpB,UAAM,eAAe,KAAK,qBAAqB;AAE/C,QAAI,cAAc;AAEhB,YAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM,EAAE;AAC1D,sBAAgB,IAAI,iBAAiB;AAAA,IACvC;AAGA,UAAM,QAAQ,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AAC7E,QAAI,OAAO;AACT,uBAAiB;AAAA,IACnB;AAEA,UAAM,eAAe,KAAK,qBAAqB;AAC/C,QAAI,cAAc;AAChB,uBAAiB;AAAA,IACnB;AAEA,UAAM,OAAO,OAAO,MAAM,UAAU,OAAO,KAAK,SAAS,SAAS,aAAa;AAG/E,SAAK,cAAc,UAAU,WAAW,CAAC;AAEzC,UAAM,aAAa,KAAK,cAAc,WAAW,cAAc,kBAAkB;AACjF,SAAK,cAAc,YAAY,UAAU,WAAW;AAEpD,SAAK,cAAc,KAAK,aAAa,GAAG,UAAU,KAAK;AAEvD,SAAK,cAAc,KAAK,WAAW,UAAU,WAAW;AAExD,SAAK,cAAc,KAAK,gBAAgB,GAAG,UAAU,YAAY;AAEjE,SAAK,cAAc,KAAK,eAAe,IAAI,IAAI,KAAK,KAAK,UAAU,GAAG;AAEtE,SAAK,cAAc,KAAK,gBAAgB,UAAU,QAAQ;AAE1D,SAAK,cAAc,KAAK,kBAAkB,UAAU,UAAU;AAE9D,SAAK,cAAc,KAAK,SAAS,QAAQ,UAAU,SAAS;AAE5D,SAAK,cAAc,eAAe,UAAU,SAAS;AAIrD,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,WAAW,OAAO,KAAK,SAAS;AACtC,aAAS,KAAK,MAAM,UAAU,IAAI;AAElC,QAAI,cAAc,UAAU,OAAO,SAAS;AAG5C,QAAI,cAAc;AAChB,oBAAc,KAAK,oBAAoB,MAAM,WAAW;AAAA,IAC1D;AAGA,QAAI,OAAO;AACT,WAAK,cAAc,OAAO,KAAK,WAAW;AAC1C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,cAAc,KAAK,YAAY,cAAc,CAAC;AACnD,WAAK,cAAc,OAAQ,cAAc,CAAC;AAC1C,WAAK,WAAW,KAAK,aAAa,cAAc,CAAC;AACjD,WAAK,cAAc,KAAK,eAAe,cAAc,CAAC;AACtD,qBAAe;AAAA,IACjB;AAEA,QAAI,cAAc;AAChB,WAAK,cAAc,OAAO,YAAY,WAAW;AACjD,WAAK,cAAc,uBAAuB,cAAc,CAAC;AACzD,YAAM,IAAI,cAAc;AACxB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,WAAW,uBAAuB,CAAC,GAAG,IAAI,CAAC;AAAA,MAClD;AACA,WAAK,WAAW,KAAK,yBAAyB,IAAI,CAAC;AACnD,WAAK,cAAc,KAAK,oBAAoB,IAAI,CAAC;AACjD,WAAK,cAAc,KAAK,gBAAgB,IAAI,CAAC;AAC7C,WAAK,cAAc,GAAG,IAAI,CAAC;AAC3B,qBAAe;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAA0B;AAExB,UAAM,aAAa,KAAK,UAAU,OAAO,KAAK,KAAK,SAAS,MAAM,EAAE,SAAS;AAC7E,UAAM,SAAS,KAAK,gBAAgB,IAAI;AACxC,UAAM,YAAY,KAAK,OAAO,KAAK,MAAM,KAAK,IAAI;AAClD,UAAM,YAAY,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,KAAK,IAAI;AAClE,UAAM,YAAY,YAAa,UAAU,SAAS,IAAK;AAGvD,UAAM,aAAa,KAAK,aAAa,KAAK,aACvC,IAAI,IAAI,IAAI,OAAO,WAAW,KAAK,YAAY,MAAM,IAAK;AAG7D,UAAM,cAAc,KAAK,cAAc,KAAK,iBAAiB,KAAK,UAAU,OACzE,IAAI,IAAI,IAAI,IAAI,OAAO,WAAW,KAAK,eAAe,MAAM,IAAK;AAGpE,UAAM,eAAe,KAAK,qBAAqB;AAC/C,QAAI,iBAAiB;AAErB,QAAI,cAAc;AAEhB,YAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM,EAAE;AAC1D,uBAAiB,IAAI,iBAAiB;AAAA,IACxC;AAGA,UAAM,QAAQ,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AAC7E,UAAM,SAAS,QAAQ,uBAAuB;AAE9C,UAAM,eAAe,KAAK,qBAAqB;AAC/C,UAAM,SAAS,eAAe,8BAA8B;AAE5D,UAAM,WAAW,SAAS,YAAY,YAAY,aAAa,eAAe,eAAe,iBAAiB,KAAK,SAAS;AAG5H,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,WAAW,UAAU;AAG3B,UAAM,OAAO,OAAO,MAAM,YAAY,OAAO,WAAW,aAAa,QAAQ;AAG7E,SAAK,cAAc,YAAY,WAAW,CAAC;AAE3C,SAAK,cAAc,KAAK,YAAY,KAAK,cAAc,KAAK,WAAW,YAAY,QAAQ;AAE3F,UAAM,oBAAoB,KAAK,cAAc,WAAW,cAAc,kBAAkB;AACxF,SAAK,aAAa,KAAK,YAAY,oBAAoB,KAAK,WAAW,YAAY,OAAO;AAE1F,SAAK,aAAa,KAAK,aAAa,GAAG,YAAY,KAAK;AAExD,SAAK,aAAa,KAAK,WAAW,YAAY,UAAU;AAExD,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,YAAY;AAEnE,SAAK,cAAc,KAAK,eAAe,IAAI,IAAI,KAAK,KAAK,YAAY,GAAG;AAExE,SAAK,cAAc,KAAK,gBAAgB,YAAY,QAAQ;AAE5D,SAAK,cAAc,KAAK,kBAAkB,YAAY,UAAU;AAEhE,SAAK,cAAc,KAAK,SAAS,QAAQ,YAAY,SAAS;AAE9D,SAAK,cAAc,UAAU,YAAY,SAAS;AAElD,SAAK,cAAc,YAAY,YAAY,WAAW;AAEtD,SAAK,cAAc,GAAG,YAAY,QAAQ;AAE1C,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,aAAa;AAEpE,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,aAAa;AAEpE,SAAK,cAAc,KAAK,gBAAgB,YAAY,gBAAgB;AAIpE,UAAM,WAAW,OAAO,KAAK,SAAS;AACtC,aAAS,KAAK,MAAM,YAAY,IAAI;AAGpC,QAAI,gBAAgB,YAAY,OAAO;AACvC,QAAI,aAAa,KAAK,KAAK,SAAS;AAClC,YAAM,aAAa,OAAO,KAAK,KAAK,SAAS,MAAM;AACnD,iBAAW,KAAK,MAAM,aAAa;AACnC,uBAAiB;AAAA,IACnB;AAGA,QAAI,cAAc;AAGlB,QAAI,KAAK,eAAe;AACtB,WAAK,cAAc,OAAO,UAAU,WAAW;AAC/C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GAAG,cAAc,CAAC;AACjE,qBAAe;AAAA,IACjB;AAGA,QAAI,WAAW;AACb,WAAK,cAAc,OAAO,QAAQ,WAAW;AAC7C,WAAK,cAAc,UAAU,QAAQ,cAAc,CAAC;AACpD,gBAAU,KAAK,MAAM,cAAc,CAAC;AACpC,qBAAe,IAAI,UAAU;AAAA,IAC/B;AAGA,QAAI,KAAK,OAAO,KAAK,KAAK;AACxB,WAAK,cAAc,OAAO,SAAS,WAAW;AAC9C,WAAK,cAAc,IAAI,cAAc,CAAC;AACtC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,KAAK,cAAc,CAAC;AAC5C,WAAK,WAAW,GAAG,cAAc,EAAE;AACnC,WAAK,cAAc,KAAK,KAAK,cAAc,EAAE;AAC7C,qBAAe;AAAA,IACjB;AAGA,QAAI,KAAK,aAAa,KAAK,YAAY;AACrC,YAAM,YAAY,OAAO,KAAK,KAAK,YAAY,MAAM;AACrD,YAAM,UAAU,IAAI,IAAI,UAAU;AAElC,WAAK,cAAc,OAAO,SAAS,WAAW;AAC9C,WAAK,cAAc,SAAS,cAAc,CAAC;AAC3C,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,UAAU,QAAQ,cAAc,CAAC;AACpD,gBAAU,KAAK,MAAM,cAAc,CAAC;AACpC,qBAAe,IAAI;AAAA,IACrB;AAGA,QAAI,KAAK,cAAc,KAAK,iBAAiB,KAAK,UAAU,MAAM;AAChE,YAAM,cAAc,OAAO,KAAK,KAAK,eAAe,MAAM;AAC1D,YAAM,UAAU,IAAI,IAAI,IAAI,YAAY;AAExC,WAAK,cAAc,OAAO,UAAU,WAAW;AAC/C,WAAK,cAAc,SAAS,cAAc,CAAC;AAC3C,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,OAAO,cAAc,CAAC;AAC9C,WAAK,cAAc,YAAY,QAAQ,cAAc,CAAC;AACtD,kBAAY,KAAK,MAAM,cAAc,EAAE;AACvC,qBAAe,IAAI;AAAA,IACrB;AAGA,QAAI,cAAc;AAChB,oBAAc,KAAK,oBAAoB,MAAM,WAAW;AAAA,IAC1D;AAGA,QAAI,OAAO;AACT,WAAK,cAAc,OAAO,KAAK,WAAW;AAC1C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,cAAc,KAAK,YAAY,cAAc,CAAC;AACnD,WAAK,cAAc,OAAQ,cAAc,CAAC;AAC1C,WAAK,WAAW,KAAK,aAAa,cAAc,CAAC;AACjD,WAAK,cAAc,KAAK,eAAe,cAAc,CAAC;AACtD,qBAAe;AAAA,IACjB;AAEA,QAAI,cAAc;AAChB,WAAK,cAAc,OAAO,YAAY,WAAW;AACjD,WAAK,cAAc,uBAAuB,cAAc,CAAC;AACzD,YAAM,IAAI,cAAc;AACxB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,WAAW,uBAAuB,CAAC,GAAG,IAAI,CAAC;AAAA,MAClD;AACA,WAAK,WAAW,KAAK,yBAAyB,IAAI,CAAC;AACnD,WAAK,cAAc,KAAK,oBAAoB,IAAI,CAAC;AACjD,WAAK,cAAc,KAAK,gBAAgB,IAAI,CAAC;AAC7C,WAAK,cAAc,GAAG,IAAI,CAAC;AAC3B,qBAAe;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,MAAoB;AAC9B,QAAI,CAAC,KAAM,QAAO;AAMlB,UAAM,OAAO,KAAK,YAAY,IAAI;AAClC,UAAM,QAAQ,KAAK,SAAS,IAAI;AAChC,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,OAAO,KAAK,SAAS;AAC3B,UAAM,SAAS,KAAK,WAAW;AAC/B,UAAM,SAAS,KAAK,WAAW;AAG/B,UAAM,YAAa,OAAO,QAAS,KAAO,QAAQ,OAAS,IAAM,MAAM;AAGvE,UAAM,YAAa,OAAO,OAAS,MAAQ,SAAS,OAAS,IAAO,UAAU,IAAK;AAGnF,UAAM,OAAQ,YAAY,KAAM;AAEhC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,WAAgC;AAC5C,QAAI,aAAa;AACf,aAAO;AAGT,UAAM,WAAY,aAAa,KAAM;AACrC,UAAM,QAAS,YAAY,IAAK,OAAQ;AACxC,UAAM,SAAU,YAAY,IAAK,MAAQ;AACzC,UAAM,MAAM,WAAW;AAGvB,UAAM,WAAW,YAAY;AAC7B,UAAM,OAAQ,YAAY,KAAM;AAChC,UAAM,SAAU,YAAY,IAAK;AACjC,UAAM,UAAU,WAAW,OAAS;AAEpC,WAAO,IAAI,KAAK,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA4B;AAC1B,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,cAAc,KAAM,QAAO;AAE/B,WAAO,UAAU,mBAAmB,SAAS;AAAA,MAC3C,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,IACP,CAAC,EAAE,MAAM,GAAE,EAAE;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAuB;AACrB,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,cAAc,KAAM,QAAO;AAE/B,WAAO,UAAU,aAAa,EAAE,MAAM,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,wBAAgC;AAC9B,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,aAAa,KAAM,QAAO;AAE9B,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,IACP,CAAC;AAED,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV,CAAC;AAED,WAAO,GAAG,QAAQ,IAAI,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAAmC;AACjC,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,aAAa,KAAM,QAAO;AAE9B,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,MACL,UAAU;AAAA,IACZ,CAAC;AAED,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,IACZ,CAAC;AAED,WAAO,GAAG,QAAQ,IAAI,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA4B;AAC1B,YAAQ,KAAK,WAAW;AAAA,MACtB,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AACd,gBAAQ,KAAK,WAAW,GAAK;AAAA,UAC3B,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA,QACjB;AAAA,MACF,KAAK,WAAW;AAAkB,eAAO;AAAA,MACzC,KAAK,WAAW;AAAW,eAAO;AAAA,MAClC,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AACd,eAAO,KAAK,gBAAgB,IAAI,YACzB,KAAK,gBAAgB,IAAI,YACzB,KAAK,gBAAgB,IAAI,YAAY;AAAA,MAE9C;AAAS,eAAO;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAA6B;AAC3B,YAAQ,KAAK,aAAa,GAAG;AAAA,MAC3B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAS,eAAO;AAAA,MACjC,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC;AAAS,eAAO;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,8BAA8B,QAAwB;AAC5D,QAAI,SAAS,GAAG;AACd,aAAO;AAAA,IACT;AACA,YAAQ,QAAQ;AAAA,MACd,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AAAO,eAAO;AAAA,MAC9B,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AAAa,eAAO;AAAA,MACpC;AACE,eAAO,QAAQ,MAAM;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,uBAA6B;AACnC,UAAM,aAAa,KAAK,WAAW,QAAQ,eAAe;AAC1D,UAAM,UAAU,KAAK,WAAW,QAAQ,oBAAoB;AAE5D,WAAO,IAAI,+CAA+C;AAC1D,WAAO;AAAA,MAAI;AAAA,MACT,kBAAkB,SAAS,yBAAyB,MAAM;AAAA,IAAE;AAE9D,UAAM,YAAY,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AACjF,UAAM,aAAa,CAAC,aAAa,KAAK,qBAAqB;AAE3D,QAAI,WAAW;AACb,aAAO,IAAI,iDAAiD,oEAAoE;AAChI,aAAO;AAAA,QAAI;AAAA,QACT,KAAK,eAAe,IAChB,qFACA;AAAA,MAA6D;AACnE,YAAM,gBACJ,KAAK,gBAAgB,IAAI,0CACvB,KAAK,gBAAgB,IAAI,gBACzB,KAAK,gBAAgB,IAAI,gBACzB,YAAY,KAAK,WAAW;AAChC,aAAO,IAAI,iDAAiD,aAAa;AACzE,aAAO;AAAA,QAAI;AAAA,QACT,KAAK,8BAA8B,KAAK,aAAa;AAAA,MAAC;AACxD,aAAO;AAAA,QAAI;AAAA,QACT;AAAA,MAAoF;AACtF,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,gBAAgB,gBAAgB,sBAAsB,iDAAiD,kBAAkB;AAAA,MAA+C;AAC7K,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,KAAK,UAAU,GAAG,KAAK,eAAe,kBAAkB,kCAA6B,EAAE;AAAA,MAAE;AAC9F,UAAI,CAAC,QAAQ;AACX,eAAO,IAAI,iDAAiD,sDAAsD;AAAA,MACpH,OAAO;AACL,eAAO,IAAI,kDAAkD,uFAAkF;AAAA,MACjJ;AAAA,IACF,WAAW,YAAY;AACrB,aAAO,IAAI,iDAAiD,yFAAyF;AACrJ,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,KAAK,uBAAuB,MAAM,KAAK,kBAAkB,MAAM,KAAK,cAAc;AAAA,MAAE;AACzF,aAAO,IAAI,iDAAiD,KAAK,8BAA8B,KAAK,SAAS,CAAC;AAC9G,aAAO;AAAA,QAAI;AAAA,QACT,kCAAkC,gBAAgB,gBAAgB,sBAAsB,4CAA4C,kBAAkB;AAAA,MAAY;AACpK,aAAO,IAAI,iDAAiD,4CAA4C;AAAA,IAC1G,WAAW,WAAW;AACpB,UAAI,QAAQ;AACV,eAAO,IAAI,iDAAiD,4FAAuF;AAAA,MACrJ,OAAO;AACL,eAAO,IAAI,iDAAiD,yEAA+D;AAAA,MAC7H;AACA,aAAO,IAAI,iDAAiD,GAAG,KAAK,kBAAkB,CAAC,KAAK,KAAK,SAAS,GAAG;AAAA,IAC/G,OAAO;AACL,aAAO,IAAI,iDAAiD,eAAe;AAAA,IAC7E;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBAAgC;AACtC,QAAI,UAAU,KAAK,cAAc;AACjC,QAAI,YAAY,EAAG,QAAO;AAC1B,QAAI,QAAQ;AACZ,aAAU,UAAU,cAAc,WAAY,MAAM;AACpD,aAAU,UAAU,cAAc,SAAY,MAAM;AACpD,aAAU,UAAU,cAAc,SAAY,MAAM;AAEpD,aAAU,UAAU,cAAc,YAAc,MAAM;AACtD,aAAU,UAAU,cAAc,UAAY,MAAM;AACpD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAkB;AAChB,WAAO,IAAI,wCAAwC,KAAK,QAAQ;AAChE,WAAO,IAAI,iCAAiC,KAAK,cAAc;AAC/D,WAAO,IAAI,kDAAkD,KAAK,mBAAmB,CAAC;AACtF,WAAO,IAAI,kDAAkD,KAAK,SAAS;AAC3E,WAAO,IAAI,kDAAkD,KAAK,kBAAkB,CAAC;AACrF,WAAO;AAAA,MAAI;AAAA,MACT,KAAK,WAAW,QAAQ,YACtB,KAAK,WAAW,QAAQ,iBAAiB,mBAAmB,cAC5D;AAAA,IAAe;AACnB,SAAK,qBAAqB;AAC1B,WAAO,IAAI,kDAAkD,KAAK,sBAAsB,CAAC;AACzF,WAAO,IAAI,kDAAkD,KAAK,yBAAyB,CAAC;AAC5F,WAAO,IAAI,kDAAkD,KAAK,cAAc;AAChF,WAAO,IAAI,kDAAkD,KAAK,gBAAgB;AAClF,WAAO,IAAI,kDAAkD,KAAK,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AACrG,WAAO,IAAI,kDAAkD,KAAK,YAAY,UAAU,CAAC;AACzF,WAAO,IAAI,kDAAkD,KAAK,SAAS,UAAU,CAAC;AACtF,WAAO,IAAI,gDAAgD;AAC3D,WAAO,IAAI,kDAAkD,KAAK,sBAAsB,CAAC;AACzF,QAAI,KAAK,YAAY;AACnB,aAAO,IAAI,+CAA+C;AAC1D,UAAI;AACF,iBAAS,IAAI,GAAG,IAAI,KAAK,WAAW,UAAU;AAE5C,cAAI,IAAI,IAAI,KAAK,WAAW,QAAQ;AAClC,mBAAO,IAAI,+CAA+C,CAAC,EAAE;AAC7D;AAAA,UACF;AAEA,cAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,cAAI,SAAS,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC7C,cAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAG7C,cAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,WAAW,QAAQ;AACrD,mBAAO,IAAI,2CAA2C,IAAI,eAAe,CAAC,WAAW,MAAM,EAAE;AAC7F;AAAA,UACF;AAEA,cAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,cAAI;AACF,gBAAI,QAAQ,OAAO,QAAQ;AACzB,qBAAO,IAAI,WAAW,MAAM,oBAAoB,MAAM,SAAS,KAAK,CAAC,EAAE;AAAA,YACzE,WAAW,QAAQ,OAAO,UAAU;AAClC,kBAAI,QAAQ,GAAG;AACb,sBAAM,QAAQ,MAAM,UAAU,CAAC;AAC/B,sBAAM,YAAY,MAAM,aAAa,CAAC;AACtC,sBAAM,OAAO,IAAI,KAAK,YAAY,GAAI;AACtC,uBAAO,IAAI,WAAW,MAAM,2BAA2B,KAAK,UAAU,KAAK,YAAY,CAAC,EAAE;AAAA,cAC5F,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,qCAAqC,IAAI,GAAG;AAAA,cAC1E;AAAA,YACF,WAAW,QAAQ,OAAO,SAAS;AACjC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,oBAAI,IAAI,UAAU,MAAM;AACtB,yBAAO,IAAI,WAAW,MAAM,qCAAqC,OAAO,GAAG;AAAA,gBAC7E,OAAO;AACL,wBAAM,MAAM,MAAM,WAAW,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC;AACpD,sBAAI,MAAM;AACV,sBAAI,IAAI,UAAU,IAAI,MAAM;AAC1B,0BAAM,UAAU,MAAM,UAAU,IAAI,OAAO;AAC3C,wBAAI,IAAI,UAAU,IAAI,WAAW,MAAM;AACrC,4BAAM,MAAM,WAAW,IAAI,UAAU,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA,oBAC9D;AAAA,kBACF;AACA,yBAAO,IAAI,WAAW,MAAM,2BAA2B,OAAO,SAAS,GAAG,SAAS,GAAG,EAAE;AAAA,gBAC1F;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,mCAAmC,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,WAAW,QAAQ,OAAO,SAAS;AACjC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,eAAe,MAAM,aAAa,CAAC;AACzC,oBAAI,eAAe,KAAK,QAAQ,IAAI,cAAc;AAChD,wBAAM,SAAS,MAAM,SAAS,GAAG,IAAI,YAAY,EAAE,SAAS,MAAM;AAClE,yBAAO,IAAI,WAAW,MAAM,4BAA4B,OAAO,aAAa,MAAM,GAAG;AAAA,gBACvF,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,2CAA2C,YAAY,GAAG;AAAA,gBACxF;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,oCAAoC,IAAI,GAAG;AAAA,cACzE;AAAA,YACF,WAAW,QAAQ,OAAO,UAAU;AAClC,kBAAI,QAAQ,IAAI;AACd,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,QAAQ,MAAM,aAAa,CAAC;AAClC,sBAAM,iBAAiB,MAAM,aAAa,CAAC;AAC3C,oBAAI,iBAAiB,KAAK,QAAQ,IAAI,gBAAgB;AACpD,wBAAM,WAAW,MAAM,SAAS,GAAG,IAAI,cAAc,EAAE,SAAS,MAAM;AACtE,yBAAO,IAAI,WAAW,MAAM,wBAAwB,OAAO,WAAW,KAAK,eAAe,QAAQ,GAAG;AAAA,gBACvG,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,yCAAyC,cAAc,GAAG;AAAA,gBACxF;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,gCAAgC,IAAI,GAAG;AAAA,cACrE;AAAA,YACF,WAAW,QAAQ,OAAO,cAAc;AACtC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,YAAY,MAAM,aAAa,CAAC;AACtC,sBAAM,cAAc,MAAM,SAAS,CAAC,EAAE,SAAS,MAAM;AAGrD,sBAAM,WAAW,OAAO,KAAK,KAAK,QAAQ;AAC1C,sBAAM,gBAAgB,MAAM,QAAQ;AAEpC,sBAAM,WAAW,cAAc,gBAAgB,UAAU;AAEzD,uBAAO,IAAI,WAAW,MAAM,2BAA2B,OAAO,WAAW,UAAU,SAAS,EAAE,CAAC,KAAK,QAAQ,GAAG;AAC/G,uBAAO,IAAI,gCAAgC,WAAW,GAAG;AAAA,cAC3D,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,mCAAmC,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,WAAW,QAAQ,OAAO,KAAK;AAC7B,kBAAI,QAAQ,GAAG;AACb,sBAAM,gBAAgB,MAAM,aAAa,CAAC;AAC1C,sBAAM,WAAW,OAAO,aAAa,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACvD,sBAAM,WAAW,MAAM,UAAU,CAAC;AAClC,sBAAM,aAAa,MAAM,aAAa,CAAC;AACvC,sBAAM,cAAc,aAAa,IAAI,YAAY,aAAa,IAAI,YAAY,aAAa,IAAI,YAAY;AAC3G,sBAAM,UAAU,kBAAkB,IAAI,4BAA4B,kBAAkB,IAAI,oCAAoC,aAAa,aAAa;AACtJ,uBAAO,IAAI,WAAW,MAAM,iBAAiB,OAAO,aAAa,QAAQ,eAAe,WAAW,2BAA2B,UAAU,EAAE;AAAA,cAC5I,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,iCAAiC,IAAI,GAAG;AAAA,cACtE;AAAA,YACF,WAAW,QAAQ,OAAO,YAAY;AACpC,kBAAI,QAAQ,uBAAuB;AACjC,oBACE,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,GACrC;AACA,wBAAM,KAAK,MAAM,UAAU,CAAC;AAC5B,wBAAM,MAAM,MAAM,aAAa,CAAC;AAChC,wBAAM,MAAM,MAAM,aAAa,CAAC;AAChC,yBAAO,IAAI,WAAW,MAAM,4BAA4B,EAAE,eAAe,GAAG,WAAW,GAAG,EAAE;AAAA,gBAC9F,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,+BAA+B;AAAA,gBAC7D;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,iCAAiC,IAAI,GAAG;AAAA,cACtE;AAAA,YACF,WAAW,QAAQ,OAAO,OAAO;AAE/B,qBAAO,IAAI,WAAW,MAAM,+BAA+B;AAC3D,kBAAI,QAAQ,GAAG;AACb,oBAAI,SAAS;AAGb,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,mBAAmB,MAAM,gBAAgB,MAAM;AACrD,yBAAO,IAAI,mCAAmC,iBAAiB,SAAS,CAAC,QAAQ;AACjF,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,iBAAiB,MAAM,gBAAgB,MAAM;AACnD,yBAAO,IAAI,iCAAiC,eAAe,SAAS,CAAC,QAAQ;AAC7E,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,oBAAoB,MAAM,gBAAgB,MAAM;AACtD,yBAAO,IAAI,qCAAqC,kBAAkB,SAAS,CAAC,EAAE;AAC9E,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,aAAa,MAAM,aAAa,MAAM;AAC5C,yBAAO,IAAI,6BAA6B,UAAU,EAAE;AAAA,gBACtD;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,oDAAoD,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,OAAO;AAEL,oBAAM,UAAU,OAAO,IACnB,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,SAAS,KAAK,IACjD;AACJ,qBAAO,IAAI,WAAW,MAAM,2BAA2B,IAAI,SAAS,UAAU,YAAY,UAAU,QAAQ,EAAE,EAAE;AAAA,YAClH;AAAA,UACF,SAAS,OAAY;AACnB,mBAAO,IAAI,qCAAqC,MAAM,MAAM,MAAM,OAAO,EAAE;AAAA,UAC7E;AAEA,eAAK,IAAI;AAAA,QACX;AAAA,MACF,SAAS,OAAY;AACnB,eAAO,IAAI,kCAAkC,MAAM,OAAO,EAAE;AAAA,MAC9D;AAAA,IACF;AACA,WAAO,IAAI,IAAI;AAAA,EACjB;AACF;;;ACnmCO,IAAM,iBAAgC;AAAA,EAC3C,SAAS;AAAA,EACT,aAAa;AACf;;;ACPA,IAAM,2BACJ;AAGF,SAAS,cAAqB;AAC5B,QAAM,IAAI,MAAM,wBAAwB;AAC1C;AAEO,SAAS,wBAAiC;AAC/C,SAAO;AACT;AAEO,SAAS,oBAAoB,QAAwB;AAC1D,SAAO,YAAY;AACrB;AAEO,SAAS,wBAAwB,QAAwB;AAC9D,SAAO,YAAY;AACrB;AAEO,SAAS,4BAAmC;AACjD,SAAO,YAAY;AACrB;AAEA,eAAsB,SAAS,OAAe,QAAkC;AAC9E,SAAO,YAAY;AACrB;AAEA,eAAsB,WAAW,OAAgC;AAC/D,SAAO,YAAY;AACrB;AAEO,SAAS,aAAa,OAAe,QAAyB;AACnE,SAAO,YAAY;AACrB;AAEO,SAAS,eAAe,OAAuB;AACpD,SAAO,YAAY;AACrB;AAEA,eAAsB,eACpB,YACA,YACA,YACA,QACA,eACA,oBACiB;AACjB,SAAO,YAAY;AACrB;AAEA,gBAAuB,iBACrB,mBACwB;AACxB,cAAY;AACd;AAEO,IAAM,WAAW;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;;;AC9BO,IAAM,iBAAN,MAAM,gBAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2B1B,YAAY,SAGT;AA5BH;AAAA,SAAQ,aAAqB,CAAC;AAC9B,SAAQ,aAAiC;AACzC,SAAQ,YAAqB;AAG7B;AAAA,SAAQ,SAAmB,CAAC;AAC5B,SAAQ,YAAoB,OAAO,MAAM,IAAI,CAAC;AAC9C,SAAQ,qBAA8B;AAGtC;AAAA,SAAQ,eAAyB,CAAC;AAClC,SAAQ,eAA2B,CAAC;AACpC,SAAQ,gBAAmC;AAAA,MACzC,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,cAAc;AAAA,IAChB;AAYE,SAAK,YAAY,SAAS,aAAa;AACvC,SAAK,qBAAqB,SAAS,sBAAsB;AAEzD,QAAI,KAAK,WAAW;AAClB,WAAK,aAAoB,WAAW,QAAQ;AAAA,IAC9C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,OAAO,OAAqB;AAE1B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAK,aAAa,YAAY,KAAK,YAAY,MAAM,CAAC,CAAC;AAAA,IACzD;AAGA,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,OAAO,KAAK;AAAA,IAC9B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAwB;AACtB,WAAO,CAAC,KAAK,eAAe;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAgC;AAC9B,QAAI,KAAK,YAAY;AACnB,aAAO,KAAK,WAAW,OAAO,KAAK;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,aAAa,CAAC;AACnB,QAAI,KAAK,YAAY;AACnB,WAAK,aAAoB,WAAW,QAAQ;AAAA,IAC9C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,MAA6B;AACnC,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAGA,UAAM,aAAa,OAAO,SAAS,WAC/B,OAAO,KAAK,MAAM,KAAK,IACvB;AAGJ,SAAK,OAAO,KAAK,UAAU;AAC3B,SAAK,aAAa,KAAK,UAAU;AAGjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,WAAK,UAAU,CAAC,KAAK,WAAW,CAAC;AAAA,IACnC;AAGA,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAkB;AAChB,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,WAAO,KAAK,UAAU,SAAS,KAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAA4B;AAC1B,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAEA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,aAAO;AAAA,IACT;AAGA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,kBAAkB;AAAA,IACzB;AAEA,UAAM,OAAO,KAAK,aAAa,KAAK,aAAa,SAAS,CAAC;AAC3D,QAAI,QAAQ,KAAK,SAAS,GAAG;AAC3B,aAAO,KAAK,CAAC,EAAE,SAAS,KAAK;AAAA,IAC/B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAoB;AAClB,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,SAAK,SAAS,CAAC;AACf,SAAK,eAAe,CAAC;AACrB,SAAK,eAAe,CAAC;AACrB,SAAK,YAAY,OAAO,MAAM,IAAI,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,eAAe,SAAmD;AACvE,UAAM,aAAa,IAAI,gBAAe,EAAE,oBAAoB,KAAK,CAAC;AAGlE,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,YAAY;AACrB,mBAAW,QAAQ,OAAO,UAAU;AAAA,MACtC;AAAA,IACF;AAEA,WAAO,WAAW,WAAW;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,KAAK,MAAsB;AACjC,WAAc,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,aAAa,MAAc,OAAuB;AACxD,QAAI,KAAK,cAAc,aAAa,OAAO,QAAQ,MAAM,KAAK,IAAI,GAAG;AACnE,OAAC,MAAM,KAAK,IAAI,CAAC,OAAO,IAAI;AAAA,IAC9B;AACA,WAAO,KAAK,KAAK,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,OAAuB;AAC1C,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,aAAa,KAAK,aAAa;AACrC,WAAK,aAAa,KAAK,CAAC,CAAC;AAGzB,eAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,cAAM,OAAO,MAAM,CAAC;AACpB,cAAM,QAAQ,MAAM,IAAI,CAAC;AACzB,cAAM,OAAO,KAAK,aAAa,MAAM,KAAK;AAC1C,aAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,MACzC;AAGA,UAAI,MAAM,SAAS,MAAM,GAAG;AAC1B,cAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,YAAI,KAAK,cAAc,cAAc;AAEnC,gBAAM,OAAO,KAAK,aAAa,MAAM,IAAI;AACzC,eAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,QACzC,OAAO;AAEL,eAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,QACzC;AAAA,MACF;AAEA,cAAQ,KAAK,aAAa,UAAU;AAAA,IACtC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAA0B;AAChC,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,eAAe,CAAC;AACrB;AAAA,IACF;AAGA,UAAM,kBAAkB,KAAK,aAAa,IAAI,UAAQ;AACpD,UAAI,KAAK,cAAc,YAAY;AACjC,eAAO,KAAK,KAAK,IAAI;AAAA,MACvB;AACA,aAAO,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI;AAAA,IACxD,CAAC;AAED,QAAI,KAAK,cAAc,YAAY;AACjC,sBAAgB,KAAK,OAAO,OAAO;AAAA,IACrC;AAEA,SAAK,eAAe,CAAC,eAAe;AACpC,SAAK,aAAa,eAAe;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAS,MAAwB;AAC/B,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAEA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,kBAAkB;AAAA,IACzB;AAEA,QAAI,QAAQ,KAAK,aAAa,UAAU,UAAQ,KAAK,OAAO,IAAI,CAAC;AACjE,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI,MAAM,wBAAwB;AAAA,IAC1C;AAEA,WAAO,KAAK,aAAa,OAAO,CAAC,OAAO,UAAU;AAChD,UAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,YAAM,YAAY,QAAQ,MAAM,IAAI,QAAQ,IAAI,QAAQ;AACxD,UAAI,YAAY,MAAM,QAAQ;AAC5B,cAAM,KAAK,MAAM,SAAS,CAAC;AAAA,MAC7B;AAEA,cAAQ,KAAK,MAAM,QAAQ,CAAC;AAC5B,aAAO;AAAA,IACT,GAAG,CAAC,CAAa;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,OAAiB,YAAoB,MAAuB;AACjE,QAAI,eAAe;AAEnB,eAAW,gBAAgB,OAAO;AAChC,qBAAe,OAAO,QAAQ,cAAc,YAAY,KAAK,IACzD,KAAK,aAAa,cAAc,YAAY,IAC5C,KAAK,aAAa,cAAc,YAAY;AAAA,IAClD;AAEA,WAAO,aAAa,OAAO,IAAI;AAAA,EACjC;AACF;AAGA,IAAO,yBAAQ;;;AChWf,IAAM,uBAAuB,IAAI,kBAAkB;AACnD,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AASvB,IAAM,eAAN,MAAM,cAAa;AAAA,EAMjB,YAAY,QAAgB;AAC1B,SAAK,SAAS;AACd,SAAK,UAAU,OAAO,MAAM,cAAc;AAC1C,SAAK,QAAQ,CAAC,IAAI;AAClB,SAAK,YAAY,KAAK,eAAe;AACrC,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,QAAQ,MAAsB;AAC5B,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,UAAM,SAAS,OAAO,MAAM,KAAK,MAAM;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,KAAK,SAAS,gBAAgB;AAChC,sBAAa,mBAAmB,KAAK,OAAO;AAC5C,aAAK,YAAY,KAAK,eAAe;AACrC,aAAK,QAAQ;AAAA,MACf;AACA,aAAO,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,KAAK,OAAO;AAAA,IACnD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,iBAAyB;AAC/B,UAAM,SAAgB,eAAe,eAAe,KAAK,QAAQ,IAAI;AACrE,WAAO,eAAe,KAAK;AAC3B,WAAO,OAAO,OAAO,KAAK,OAAO;AAAA,EACnC;AAAA,EAEA,OAAO,mBAAmB,SAAuB;AAC/C,aAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAI,QAAQ,CAAC,MAAM,KAAK;AACtB,gBAAQ,CAAC,IAAI;AAAA,MACf,OAAO;AACL,gBAAQ,CAAC;AACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,IAAM,eAAN,MAAmB;AAAA,EAQxB,YAAY,UAAkB;AAH9B,SAAQ,aAAa;AACrB,SAAQ,WAAW;AAGjB,SAAK,OAAc,YAAY,gBAAgB;AAC/C,SAAK,OAAO,UAAU,WAAW,UAAU,KAAK,IAAI;AACpD,SAAK,MAAM,IAAI,aAAa,KAAK,KAAK,MAAM;AAC5C,SAAK,OAAc,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,EACzD;AAAA;AAAA,EAGA,SAAiB;AACf,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,SAAK,aAAa;AAClB,WAAO,OAAO,OAAO,CAAC,KAAK,MAAM,KAAK,KAAK,gBAAgB,CAAC;AAAA,EAC9D;AAAA;AAAA,EAGA,OAAO,OAAuB;AAC5B,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,QAAI,CAAC,KAAK,YAAY;AACpB,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,UAAM,SAAS,KAAK,IAAI,QAAQ,KAAK;AACrC,SAAK,KAAK,OAAO,MAAM;AACvB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,SAAiB;AACf,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,QAAI,CAAC,KAAK,YAAY;AACpB,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,SAAK,WAAW;AAChB,WAAO,KAAK,KAAK,OAAO,EAAE,SAAS,GAAG,kBAAkB;AAAA,EAC1D;AACF;AAMO,IAAM,eAAN,MAAmB;AAAA,EAYxB,YAAY,UAAkB,gBAAwB;AARtD,SAAQ,OAA2B;AACnC,SAAQ,MAA2B;AACnC,SAAQ,OAA2B;AACnC,SAAQ,YAAY,OAAO,MAAM,CAAC;AAClC,SAAQ,UAAU,OAAO,MAAM,CAAC;AAChC,SAAQ,aAAa;AACrB,SAAQ,WAAW;AAGjB,QAAI,iBAAiB,cAAc;AACjC,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AACA,SAAK,WAAW;AAChB,SAAK,YAAY,iBAAiB;AAClC,SAAK,kBAAkB,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAK,OAAuB;AAC1B,QAAI,OAAO;AACX,QAAI,CAAC,KAAK,YAAY;AACpB,WAAK,YAAY,OAAO,OAAO,CAAC,KAAK,WAAW,IAAI,CAAC;AACrD,YAAM,OAAO,mBAAmB;AAChC,UAAI,KAAK,UAAU,SAAS,MAAM;AAChC,eAAO,OAAO,MAAM,CAAC;AAAA,MACvB;AACA,YAAM,OAAO,KAAK,UAAU,SAAS,GAAG,gBAAgB;AACxD,YAAM,iBAAiB,KAAK,UAAU,SAAS,kBAAkB,IAAI;AACrE,WAAK,OAAO,UAAU,WAAW,KAAK,UAAU,IAAI;AACpD,UAAI,CAAC,KAAK,KAAK,iBAAiB,OAAO,cAAc,GAAG;AACtD,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,WAAK,MAAM,IAAI,aAAa,KAAK,KAAK,MAAM;AAC5C,WAAK,OAAc,WAAW,QAAQ,KAAK,KAAK,OAAO;AACvD,WAAK,aAAa;AAClB,aAAO,KAAK,UAAU,SAAS,IAAI;AACnC,WAAK,YAAY,OAAO,MAAM,CAAC;AAAA,IACjC;AAEA,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,QAAQ,KAAK,eAAe;AAC7D,UAAM,aAAa,KAAK,SAAS,GAAG,UAAU;AAC9C,UAAM,OAAO,KAAK,SAAS,UAAU;AACrC,QAAI,KAAK,SAAS,GAAG;AACnB,WAAK,UAAU,OAAO,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC;AAAA,IACnD;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,WAAK,UAAU;AACf,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,SAAK,KAAM,OAAO,UAAU;AAC5B,UAAM,QAAQ,KAAK,IAAK,QAAQ,UAAU;AAC1C,SAAK,mBAAmB,WAAW;AACnC,SAAK,UAAU;AACf,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAY;AACV,QAAI,KAAK,kBAAkB,GAAG;AAC5B,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,SAAK,UAAU;AACf,QAAI,CAAC,KAAK,UAAU;AAClB,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AAAA,EACF;AAAA,EAEQ,YAAkB;AACxB,QAAI,KAAK,YAAY,KAAK,kBAAkB,KAAK,CAAC,KAAK,MAAM;AAC3D;AAAA,IACF;AACA,QAAI,KAAK,QAAQ,SAAS,oBAAoB;AAC5C;AAAA,IACF;AACA,UAAM,SAAS,KAAK,QAAQ,SAAS,GAAG,kBAAkB;AAC1D,UAAM,aAAa,KAAK,KAAK,OAAO,EAAE,SAAS,GAAG,kBAAkB;AACpE,QAAI,CAAC,WAAW,OAAO,MAAM,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,SAAK,WAAW;AAAA,EAClB;AACF;AAQO,IAAM,YAAN,MAAM,WAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKrB,OAAO,WAAW,UAA2B,MAA2B;AACtE,UAAM,MAAM,OAAO,SAAS,QAAQ,IAAI,WAAW,OAAO,KAAK,QAAQ;AACvE,UAAM,eAAsB;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,QAAQ,aAAa,SAAS,GAAG,eAAe;AAAA,MAChD,SAAS,aAAa,SAAS,iBAAiB,IAAI,eAAe;AAAA,MACnE,kBAAkB,aAAa,SAAS,IAAI,eAAe;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,gBAAgB,UAAgC;AACrD,WAAO,IAAI,aAAa,QAAQ;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,gBAAgB,UAAkB,gBAAsC;AAC7E,WAAO,IAAI,aAAa,UAAU,cAAc;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,cAAc,OAAiB,gBAAwB,UAA0B;AACtF,SAAK;AACL,UAAM,MAAM,WAAU,gBAAgB,QAAQ;AAC9C,UAAM,QAAQ,CAAC,IAAI,OAAO,CAAC;AAC3B,QAAI,eAAe,SAAS,GAAG;AAC7B,YAAM,KAAK,IAAI,OAAO,cAAc,CAAC;AAAA,IACvC;AACA,UAAM,KAAK,IAAI,OAAO,CAAC;AACvB,WAAO,OAAO,OAAO,KAAK;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,cAAc,OAAiB,aAAqB,UAA0B;AACnF,SAAK;AACL,UAAM,MAAM,WAAU,gBAAgB,UAAU,YAAY,MAAM;AAClE,UAAM,MAAM,IAAI,KAAK,WAAW;AAChC,QAAI,IAAI;AACR,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,cACZ,UACA,gBACA,iBACwB;AACxB,UAAM,MAAM,WAAU,gBAAgB,UAAU,cAAc;AAC9D,qBAAiB,SAAS,iBAAiB;AACzC,YAAM,QAAQ,IAAI,KAAK,KAAK;AAC5B,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM;AAAA,MACR;AAAA,IACF;AACA,QAAI,IAAI;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,mBAAmB,YAAoB,gBAAwB,GAAW;AAC/E,UAAM,MAAM,OAAO,MAAM,oBAAoB;AAC7C,QAAI,cAAc,OAAO,KAAK,CAAC;AAC/B,QAAI,cAAc,GAAG,CAAC;AACtB,QAAI,cAAc,eAAe,CAAC;AAClC,QAAI,cAAc,OAAQ,CAAC;AAC3B,QAAI,WAAW,GAAM,CAAC;AACtB,QAAI,cAAc,YAAY,CAAC;AAC/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,mBAAmB,MAKxB;AACA,WAAO;AAAA,MACL,eAAe,KAAK,aAAa,CAAC;AAAA,MAClC,UAAU,OAAO,aAAa,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC9C,oBAAoB,KAAK,UAAU,CAAC;AAAA,MACpC,eAAe,KAAK,aAAa,CAAC;AAAA,IACpC;AAAA,EACF;AACF;;;ACvWO,IAAM,iCAAiC;AASvC,IAAM,YAAN,MAAM,WAAU;AAAA;AAAA;AAAA;AAAA,EAIrB,OAAO,eACL,YAAoB,gCACpB,QAAgB,GAChB,WAAmB,GACX;AACR,UAAM,MAAM,OAAO,MAAM,qBAAqB;AAC9C,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAI,uBAAuB,CAAC;AAAA,IACnC;AACA,QAAI,WAAW,GAAG,CAAC;AACnB,QAAI,cAAc,WAAW,CAAC;AAC9B,QAAI,cAAc,OAAO,CAAC;AAC1B,QAAI,cAAc,UAAU,CAAC;AAC7B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBACL,YAAoB,gCACpB,QAAgB,GAChB,WAAmB,GACX;AACR,UAAM,MAAM,OAAO,MAAM,2BAA2B;AACpD,QAAI,cAAc,OAAO,YAAY,CAAC;AACtC,QAAI,cAAc,uBAAuB,CAAC;AAC1C,eAAU,eAAe,WAAW,OAAO,QAAQ,EAAE,KAAK,KAAK,CAAC;AAChE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,gBAAgB,MAA6C;AAClE,QAAI,KAAK,SAAS,uBAAuB;AACvC,aAAO;AAAA,IACT;AACA,QACE,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,GACpC;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,MACL,gBAAgB,KAAK,UAAU,CAAC;AAAA,MAChC,WAAW,KAAK,aAAa,CAAC;AAAA,MAC9B,OAAO,KAAK,aAAa,CAAC;AAAA,MAC1B,UAAU,KAAK,aAAa,CAAC;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,OAAO,aAAa,MAAsC;AACxD,UAAM,IAAI,WAAU,gBAAgB,IAAI;AACxC,QAAI,CAAC,KAAK,EAAE,mBAAmB,GAAG;AAChC,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cAAc,OAAiB,gBAAwB,UAA0B;AACtF,WAAO,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cAAc,OAAiB,aAAqB,UAA0B;AACnF,WAAO,UAAU,cAAc,OAAO,aAAa,QAAQ;AAAA,EAC7D;AACF;;;AC1FA,IAAM,OAAO;AAsCN,IAAM,eAAN,MAAM,aAAY;AAAA;AAAA;AAAA;AAAA,EAUf,OAAO,MAAmB;AAChC,QAAI,aAAY,gBAAgB;AAC9B,aAAO,MAAM,iBAAiB,GAAG,IAAI;AAAA,IACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,QAAI,aAAY,gBAAgB;AAC9B,aAAO,SAAS,OAAO;AAAA,IACzB;AACA,SAAK,IAAI,yBAAyB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,aAAa,OAAiB,MAAc,SAA2B,gBAAmE;AAC9I,SAAK,IAAI,oCAAoC,MAAM,QAAQ,EAAE;AAG7D,QAAI,CAAC,MAAM,oBAAoB,MAAM,qBAAqB,GAAG;AAC3D,YAAM,mBAAmB,KAAK;AAAA,IAChC;AACA,UAAM,YAAY,KAAK;AACvB,UAAM,aAAa,SAAS,cAAc,KAAK,OAAO,cAAc;AAEpE,SAAK,IAAI,eAAe,SAAS,qBAAqB,MAAM,QAAQ,EAAE;AACtE,SAAK,IAAI,wBAAwB,EAAE,OAAO,SAAS,OAAO,SAAS,SAAS,SAAS,WAAW,CAAC;AAGjG,QAAI;AAEJ,QAAI,SAAS,UAAU,GAAG;AACxB,0BAAoB,WAAW;AAC/B,WAAK,IAAI,sCAAsC;AAAA,IACjD,WAAW,SAAS,SAAS;AAE3B,UAAI,YAAY,KAAK;AACnB,4BAAoB,WAAW;AAC/B,aAAK,IAAI,4CAA4C,SAAS,SAAS;AAAA,MACzE,OAAO;AACL,4BAAoB,WAAW;AAC/B,aAAK,IAAI,sCAAsC;AAAA,MACjD;AAAA,IACF,OAAO;AACL,0BAAoB,WAAW;AAC/B,WAAK,IAAI,6CAA6C;AAAA,IACxD;AAEA,UAAM,YAAY;AAGlB,UAAM,uBAAwB,CAAC,MAAM,OAAO,MAAM,QAAQ,KAAO,SAAS,aAAa,CAAC,MAAM;AAC9F,UAAM,iBAAiB,uBAAuB,IAAI,eAAe,EAAE,WAAW,SAAS,aAAa,CAAC,MAAM,UAAU,MAAM,CAAC,IAAI;AAGhI,QAAI,gBAAgB;AAClB,qBAAe,OAAO,IAAI;AAC1B,UAAI,CAAC,MAAM,OAAO,MAAM,QAAQ,GAAG;AACjC,cAAM,MAAM,eAAe,cAAc;AAAA,MAC3C;AACA,UAAI,SAAS,aAAa,CAAC,MAAM,QAAQ;AACvC,cAAM,SAAS,eAAe,eAAe;AAAA,MAC/C;AACA,WAAK,IAAI,yBAAyB,MAAM,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,YAAY,MAAM,UAAU,KAAK,EAAE;AAAA,IAC9G;AAGA,UAAM,MAAM,SAAS;AACrB,UAAM,eAAe,QAAQ;AAC7B,UAAM,SAAS,QAAQ;AACvB,UAAM,SAAS,SAAS,YAAY,CAAC,gBAAgB,CAAC;AACtD,QAAI,SAAS,UAAU;AACrB,YAAM,QAAQ,eAAe,cAAc,SAAS,yBAAyB;AAC7E,WAAK,IAAI,yCAAyC,MAAM,QAAQ,aAAa,KAAK,GAAG;AACrF,YAAM,YAAY,MAAM,YAAY,KAAK,QAAQ;AACjD,YAAM,cAAc;AAAA,IACtB;AAGA,QAAI;AACJ,UAAM,aAAa,sBAAsB,WAAW,OAAO,SAAS,sBAAsB,WAAW,WAAW,aAAa;AAE7H,QAAI,sBAAsB,WAAW,QAAQ;AAC3C,uBAAiB;AAAA,IACnB,OAAO;AACL,WAAK,IAAI,2BAA2B,UAAU,oCAAoC;AAClF,WAAK,IAAI,uBAAuB,UAAU,WAAW,SAAS,uBAAuB,UAAU,QAAQ;AACvG,WAAK,IAAI,6BAA6B,CAAC,MAAM,OAAO,MAAM,QAAQ,CAAC,YAAY,SAAS,SAAS,EAAE;AAEnG,UAAI,sBAAsB,WAAW,MAAM;AACzC,yBAAiB,MAAM,KAAK,aAAa,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,MAC3F,OAAO;AACL,yBAAiB,MAAM,KAAK,gBAAgB,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,MAC9F;AAAA,IACF;AAGA,QAAI,SAAS,UAAU;AACrB,UAAI,QAAQ;AACV,yBAAiB,KAAK,yBAAyB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACxF,WAAW,QAAQ;AACjB,yBAAiB,KAAK,yBAAyB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACxF,OAAO;AACL,yBAAiB,KAAK,sBAAsB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACrF;AAAA,IACF;AAEA,UAAM,iBAAiB,eAAe;AAEtC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,gBACJ,MACA,SACA,YACA,OACA,gBACiB;AACjB,SAAK,IAAI,qCAAqC,OAAO,YAAY,SAAS,iBAAiB,UAAU,YAAY,SAAS,SAAS,CAAC,EAAE;AAEtI,UAAM,sBAAsB,cAAc,KAAK,OAAO,cAAc;AACpE,UAAM,QAAQ,SAAS,SAAS;AAGhC,QAAI,OAAO,SAAS,YAAY,eAAe,QAAQ,iBAAiB,MAAM;AAE5E,YAAM,IAAI,MAAM,kDAAkD;AAAA,IACpE;AAGA,QAAI,KAAK,UAAU,qBAAqB;AACtC,aAAO,KAAK,QAAQ,MAAM,OAAO;AAAA,IACnC;AAGA,UAAM,WAAW,IAAI,KAAK,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC;AACtD,UAAM,mBAA6B,CAAC;AACpC,QAAI,iBAAiB;AACrB,QAAI,sBAAsB;AAE1B,QAAI;AAEF,eAAS,SAAS,GAAG,SAAS,KAAK,QAAQ,UAAU,qBAAqB;AACxE,cAAM,QAAQ,KAAK,MAAM,QAAQ,SAAS,mBAAmB;AAC7D,cAAM,SAAS,SAAS,uBAAuB,KAAK;AAEpD,iBAAS,KAAK,OAAO,MAAM;AAG3B,YAAI,SAAS,UAAU,SAAS,OAAO,SAAS,GAAG;AACjD,gBAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM;AACnD,2BAAiB,KAAK,eAAe;AACrC,iCAAuB,gBAAgB;AAGvC,cAAI,gBAAgB;AAClB,kBAAM,eAAe,eAAe;AAAA,UACtC;AAAA,QACF;AAEA,0BAAkB,MAAM;AAAA,MAC1B;AAGA,YAAM,QAAQ,iBAAiB,IAAI,KAAK,MAAO,sBAAsB,iBAAkB,GAAG,IAAI;AAC9F,WAAK,IAAI,yBAAyB,OAAO,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,YAAY,OAAO,UAAU,KAAK,EAAE;AAC/G,WAAK,IAAI,iCAAiC,mBAAmB,eAAe,cAAc,iBAAiB,KAAK,IAAI;AAEpH,aAAO,OAAO,OAAO,gBAAgB;AAAA,IACvC,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,+BAA+B,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC,EAAE;AAAA,IAC7F;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,OAAe,SAAmC;AACxD,SAAK,IAAI,sCAAsC,MAAM,MAAM,YAAY,SAAS,SAAS,CAAC,EAAE;AAC5F,UAAM,QAAQ,SAAS,SAAS;AAChC,UAAM,SAAS,KAAK,WAAW,OAAO,EAAE,MAAM,CAAC;AAC/C,UAAM,QAAQ,MAAM,SAAS,IAAI,KAAK,MAAO,OAAO,SAAS,MAAM,SAAU,GAAG,IAAI;AACpF,SAAK,IAAI,iCAAiC,OAAO,MAAM,eAAe,MAAM,MAAM,iBAAiB,KAAK,IAAI;AAC5G,WAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,aACJ,OACA,SACA,YACA,OACA,gBACiB;AACjB,SAAK,IAAI,kCAAkC,OAAO,YAAY,SAAS,iBAAiB,UAAU,YAAY,SAAS,SAAS,CAAC,EAAE;AAEnI,UAAM,sBAAsB,cAAc,KAAK,OAAO,cAAc;AACpE,UAAM,QAAQ,SAAS,SAAS;AAChC,UAAM,WAAW,OAAO,SAAS,KAAK;AACtC,UAAM,YAAY,WAAW,MAAM,SAAS,MAAM;AAElD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AAEA,QAAI,SAAS,UAAU,GAAG;AACxB,UAAI,UAAU;AACZ,YAAI,gBAAgB;AAClB,gBAAM,eAAe,KAAK;AAAA,QAC5B;AACA,eAAO;AAAA,MACT;AACA,YAAM,SAAmB,CAAC;AAC1B,UAAI,WAAW;AACf,aAAO,WAAW,WAAW;AAC3B,cAAM,OAAO,KAAK,IAAI,qBAAqB,YAAY,QAAQ;AAC/D,cAAM,QAAQ,MAAM,UAAU,UAAU,IAAI;AAC5C,YAAI,gBAAgB;AAClB,gBAAM,eAAe,KAAK;AAAA,QAC5B,OAAO;AACL,iBAAO,KAAK,KAAK;AAAA,QACnB;AACA,oBAAY,MAAM;AAAA,MACpB;AACA,aAAO,iBAAiB,OAAO,MAAM,CAAC,IAAI,OAAO,OAAO,MAAM;AAAA,IAChE;AAEA,UAAM,YAAY,WACd,CAAC,UAAkB,SAAiB,MAAM,SAAS,UAAU,WAAW,IAAI,IAC5E,MAAM,UAAU,KAAK,KAAK;AAE9B,UAAM,YAAsB,CAAC;AAC7B,UAAM,iBAAiB,MAAM,SAAS;AAAA,MACpC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,eAAe;AACpB,YAAI,gBAAgB;AAClB,gBAAM,eAAe,UAAU;AAAA,QACjC,OAAO;AACL,oBAAU,KAAK,UAAU;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,OAAO;AACT,YAAM,iBAAiB;AAAA,IACzB;AAEA,QAAI,gBAAgB;AAClB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,WAAO,OAAO,OAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,sBAAsB,OAAiB,gBAAwB,UAA0B;AACvF,SAAK,IAAI,6CAA6C,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEjH,UAAM,YAAY,IAAI,UAAU;AAChC,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAE7E,SAAK,IAAI,wBAAwB,eAAe,MAAM,wBAAwB,cAAc,MAAM,8BAA8B,gBAAgB,eAAe;AAE/J,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAyB,OAAiB,gBAAwB,UAA0B;AAC1F,SAAK,IAAI,gDAAgD,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEpH,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAE7E,UAAM,0BAA0B;AAChC,UAAM,qBAAqB;AAC3B,UAAM,iBAAiB;AAEvB,SAAK,IAAI,mCAAmC,eAAe,MAAM,aAAa,cAAc,MAAM,QAAQ;AAE1G,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAAyB,OAAiB,gBAAwB,UAA0B;AAC1F,SAAK,IAAI,gDAAgD,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEpH,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAG7E,UAAM,gBAAgB,MAAM;AAC5B,UAAM,YAAY,WAAW;AAC7B,UAAM,aAAa;AACnB,UAAM,cAAc;AAEpB,SAAK,IAAI,gCAAgC,eAAe,MAAM,aAAa,cAAc,MAAM,kCAAkC;AAEjI,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,mBACJ,OACA,UACA,YACiB;AACjB,SAAK,IAAI,0CAA0C,MAAM,QAAQ,WAAW,SAAS,MAAM,EAAE;AAG7F,UAAM,mBAAmB,SAAS;AAGlC,UAAM,iBAAiB,IAAI,eAAe,EAAE,WAAW,YAAY,aAAa,MAAM,CAAC;AACvF,mBAAe,OAAO,QAAQ;AAG9B,UAAM,MAAM,eAAe,cAAc;AACzC,QAAI,YAAY,WAAW;AACzB,YAAM,SAAS,eAAe,eAAe;AAC7C,WAAK,IAAI,uBAAuB,MAAM,MAAM,EAAE;AAAA,IAChD;AAGA,WAAO,MAAM,KAAK,aAAa,OAAO,UAAU,UAAU;AAAA,EAC5D;AACF;AAAA;AA/Xa,aAKI,iBAA0B;AALpC,IAAM,cAAN;;;ACrCA,IAAM,2BAA2B;AAExC,IAAM,aAAa,OAAO,KAAK,CAAC,IAAM,KAAM,IAAM,GAAI,CAAC;AA4GvD,SAAS,QAAQ,MAAsB;AACrC,QAAM,IAAI,IAAI,eAAe;AAC7B,IAAE,OAAO,IAAI;AACb,SAAO,EAAE,cAAc;AACzB;AAuGO,SAAS,8BACd,SACA,0BACA,KAC0C;AAC1C,QAAM,WAAW,6BAA6B;AAC9C,MACE,QAAQ,WAAW,WAAW,4BAC9B,QAAQ,SAAS,QAAQ,EAAE,OAAO,OAAO,MAAM,wBAAwB,CAAC,GACxE;AACA,UAAM,WAAW,QAAQ,SAAS,GAAG,QAAQ;AAC7C,QAAI,QAAQ,UAAa,QAAQ,GAAG;AAClC,UAAI,QAAQ,QAAQ,MAAO,QAAQ,GAAI;AACrC,eAAO,EAAE,UAAU,SAAS,WAAW,MAAM;AAAA,MAC/C;AAAA,IACF;AACA,WAAO,EAAE,UAAU,WAAW,KAAK;AAAA,EACrC;AACA,MAAI,QAAQ,SAAS,YAAY,WAAW,GAAG;AAE7C,UAAM,WAAW,QAAQ,SAAS,GAAG,QAAQ;AAC7C,QAAI,QAAQ,UAAa,QAAQ,KAAK,QAAQ,QAAQ,MAAO,QAAQ,GAAI;AACvE,aAAO,EAAE,UAAU,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AACA,SAAO,EAAE,UAAU,SAAS,WAAW,MAAM;AAC/C;;;ACpPA,IAAMC,QAAO;AA8Bb,IAAM,iBAAN,MAAM,eAAc;AAAA;AAAA;AAAA;AAAA,EAUV,OAAO,MAAmB;AAChC,QAAI,eAAc,gBAAgB;AAChC,aAAO,MAAM,mBAAmB,GAAG,IAAI;AAAA,IACzC;AAAA,EACF;AAAA,EAEA,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,QAAI,eAAc,gBAAgB;AAChC,aAAO,SAAS,OAAO;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,QAAQ,OAAiB,eAAiD;AAC9E,QAAI,CAAC,KAAK,OAAO,YAAY,GAAG;AAC9B,YAAM,IAAI,MAAM,iHAAiH;AAAA,IACnI;AAEA,SAAK,IAAI,+BAA+B,MAAM,QAAQ,aAAa,MAAM,SAAS,oBAAoB,aAAa,EAAE;AAErH,UAAM,SAAS,KAAK,OAAO,aAAa;AAGxC,QAAI,QAAQ,KAAK,OAAO,iBAAiB,OAAO,MAAM;AACtD,UAAM,WAAY,KAAK,QAAgB;AACvC,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,cAAc,WAAW;AACrE,UAAM,QAAQ,MAAM,qBAAqB;AAEzC,QAAK,MAAc,eAAe,UAAU;AAC1C,WAAK,IAAI,4CAA4C,MAAM,QAAQ,KAAK,SAAS,QAAQ,mCAAmC,WAAW,GAAG;AAE1I,UAAI,SAAS,OAAO;AAClB,gBAAQ,UAAU,cAAc,OAAO,OAAO,QAAQ;AAAA,MACxD,OAAO;AACL,cAAM,YAAY,IAAI,UAAU;AAChC,gBAAQ,UAAU,cAAc,OAAO,QAAQ,OAAO,QAAQ;AAAA,MAChE;AAEA,WAAK,IAAI,4DAA4D,MAAM,MAAM,EAAE;AAAA,IACrF;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AAIA,UAAM,WAAW,SAAS,MAAM,eAAe,IAAI,OAAO;AAC1D,WAAO,KAAK,WAAW,OAAO,OAAO,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAOQ,QAAQ,MAAsB;AACpC,SAAK,IAAI,yBAAyB,KAAK,MAAM,QAAQ;AACrD,UAAM,SAASA,MAAK,WAAW,IAAI;AACnC,WAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,mBAAmB,MAAc,OAAmC;AAChF,SAAK,IAAI,oCAAoC,KAAK,MAAM,QAAQ;AAEhE,QAAI;AACF,UAAI,eAAe,MAAM,SAAS,WAAW,IAAI;AACjD,UAAI,SAAS,MAAM,mBAAmB,GAAG;AACvC,cAAM,EAAE,UAAU,UAAU,IAAI;AAAA,UAC9B;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,QACR;AACA,YAAI,WAAW;AACb,eAAK;AAAA,YACH,sCAAsC,aAAa,MAAM,OAAO,SAAS,MAAM;AAAA,UACjF;AAAA,QACF;AACA,uBAAe;AAAA,MACjB;AACA,WAAK,IAAI,kCAAkC,KAAK,MAAM,aAAa,aAAa,MAAM,QAAQ;AAC9F,aAAO;AAAA,IACT,SAAS,OAAO;AACd,WAAK,IAAI,8BAA8B,KAAK,EAAE;AAC9C,YAAM,IAAI,MAAM,8BAA8B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IACxG;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc,WACZ,gBACA,OACA,eACiB;AAEjB,UAAM,SAAS,MAAM,cAAc,WAAW,eAAe,MAAM,iBAAiB,IAChF,MAAM,gBACN,MAAM;AAEV,SAAK,IAAI,kCAAkC,MAAM,QAAQ,aAAa,MAAM,kBAAkB,eAAe,MAAM,EAAE;AAErH,QAAI,eAAe,WAAW,GAAG;AAC/B,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,QAAI;AACJ,QAAI,WAAW,WAAW,QAAQ;AAChC,eAAS;AAAA,IACX,WAAW,WAAW,WAAW,UAAU;AACzC,eAAS,KAAK,QAAQ,cAAc;AAAA,IACtC,WAAW,WAAW,WAAW,MAAM;AACrC,eAAS,MAAM,KAAK,mBAAmB,gBAAgB,KAAK;AAAA,IAC9D,OAAO;AACL,YAAM,IAAI,MAAM,mCAAmC,MAAM,EAAE;AAAA,IAC7D;AAGA,QAAI,CAAC,eAAe;AAClB,UAAI,MAAM,QAAQ;AAChB,cAAM,UAAU,KAAK,OAAO,WAAW,OAAO,MAAM;AACpD,YAAI,CAAC,SAAS;AACZ,gBAAM,IAAI,MAAM,eAAO,cAAc;AAAA,QACvC;AAAA,MACF,OAAO;AACL,cAAM,UAAU,KAAK,OAAO,UAAU,OAAO,MAAM;AACnD,YAAI,CAAC,SAAS;AACZ,gBAAM,IAAI,MAAM,eAAO,WAAW;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEF;AAAA;AApKM,eAKW,iBAA0B;AAL3C,IAAM,gBAAN;AAuKA,IAAO,wBAAQ;;;ACnHf,IAAqB,SAArB,MAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8B1B,YAAY,SAAuB,CAAC,GAAG;AAtBvC;AAAA,SAAQ,WAA0B;AAClC,SAAU,aAAyB,CAAC;AACpC;AAAA,SAAQ,iBAAyB;AACjC,SAAQ,mBAA2B;AAGnC;AAAA,SAAQ,aAA4B;AAGpC;AAAA,SAAQ,aAAiC;AACzC,SAAQ,eAAqC;AAa3C,SAAK,SAAS;AAAA,MACZ,YAAY,OAAO,cAAc,MAAM;AAAA;AAAA,MACvC,OAAO,OAAO,SAAS;AAAA;AAAA,IACzB;AAGA,QAAI,KAAK,OAAO,OAAO;AACrB,aAAO,SAAS,OAAO;AAAA,IACzB;AAAA,EAIF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAA8B;AACpC,QAAI,CAAC,KAAK,YAAY;AACpB,WAAK,aAAa,IAAI,YAAY,IAAI;AAAA,IACxC;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,mBAAkC;AACxC,QAAI,CAAC,KAAK,cAAc;AACtB,WAAK,eAAe,IAAI,sBAAc,IAAI;AAAA,IAC5C;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAwB;AACtB,WAAO,KAAK,OAAO,cAAc,MAAM;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAuB;AACrB,WAAO,KAAK,aAAa,QAAQ,KAAK,SAAS,SAAS;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,MAAM,aACJ,OACA,MACA,SACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,aAAa,OAAO,MAAM,SAAS,cAAc;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,gBACJ,MACA,SACA,YACA,OACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,gBAAgB,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,EAC/F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,OAAe,SAAmC;AACxD,WAAO,KAAK,eAAe,EAAE,QAAQ,OAAO,OAAO;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,aACJ,OACA,SACA,YACA,OACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,aAAa,OAAO,SAAS,YAAY,OAAO,cAAc;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,mBACJ,OACA,UACA,YACiB;AACjB,WAAO,KAAK,eAAe,EAAE,mBAAmB,OAAO,UAAU,UAAU;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,QAAQ,OAAiB,eAAiD;AAC9E,WAAO,KAAK,iBAAiB,EAAE,QAAQ,OAAO,aAAa;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BA,QAAQ,OAA2B;AACjC,SAAK,aAAa;AAElB,SAAK,WAAW;AAEhB,SAAK,mBAAmB,KAAK;AAC7B,UAAM,UAAU,KAAK,uBAAuB;AAC5C,SAAK,aAAa;AAClB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,eAAqB;AAC3B,SAAK,WAAW;AAChB,SAAK,aAAa,CAAC;AACnB,SAAK,MAAM;AACX,SAAK,aAAa;AAElB,SAAK,aAAa;AAClB,SAAK,eAAe;AAAA,EAEtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,OAA6B;AACxC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,UAAmC;AAC7C,QAAI;AACF,YAAM,aAAa,KAAK,aAAa;AACrC,aAAO,WAAW,KAAK,CAAC,UAAoB,MAAM,aAAa,QAAQ,KAAK;AAAA,IAC9E,SAAS,OAAO;AACd,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,eAAuB;AAC5B,QAAI,CAAC,KAAK,UAAU;AAClB,WAAK,WAAW,OAAO,MAAM,CAAC;AAAA,IAChC;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,iBAAiB,OAAiB,QAAwB;AAC/D,UAAM,YAAY,OAAO,SAAS,MAAM,cAAc;AAEtD,QAAI,UAAU,aAAa,CAAC,MAAM,UAAU,WAAW;AACrD,YAAM,IAAI,MAAM,eAAO,WAAW;AAAA,IACpC;AAEA,UAAM,YAAY,UAAU,aAAa,UAAU,KAAK;AACxD,QAAI,YAAY,UAAU,aAAa,UAAU,SAAS;AAC1D,QAAI,YAAY,UAAU,aAAa,UAAU,SAAS;AAC1D,QAAI,aAAa,UAAU,OAAO,YAAY;AAE9C,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,cAAc,WAAW;AACrE,UAAM,QAAQ,MAAM,qBAAqB;AAEzC,QAAI,SAAS,OAAO;AAGlB,YAAMC,aAAY;AAClB,YAAMC,WAAU,aAAa,MAAM;AACnC,aAAO,UAAU,SAASD,YAAWC,QAAO;AAAA,IAC9C;AAGA,QAAI,cAAc;AAClB,QAAI,YAAY,QAAQ,WAAW;AACjC,oBAAc;AAAA,IAChB;AAEA,UAAM,YAAY,aAAa;AAC/B,UAAM,UAAU,aAAa,MAAM;AACnC,WAAO,UAAU,SAAS,WAAW,OAAO;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,UAAU,OAAiB,MAAuB;AAGrD,UAAM,OAAO,MAAM,IAAI;AACzB,UAAM,UAAU,SAAS,MAAM;AAC/B,WAAO,MAAM,8CAA8C,IAAI,YAAY,MAAM,GAAG,aAAa,UAAU,WAAM,QAAG,gBAAgB,MAAM,WAAW,OAAS,IAAI,QAAQ,IAAI,EAAE;AAChL,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,WAAW,OAAiB,MAAuB;AACxD,QAAI,CAAC,MAAM,QAAQ;AACjB,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AACA,UAAM,UAAU,OAAO,IAAI;AAC3B,UAAM,UAAU,YAAY,MAAM;AAClC,WAAO,MAAM,+CAA+C,OAAO,YAAY,MAAM,MAAM,aAAa,UAAU,WAAM,QAAG,EAAE;AAC7H,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAgG;AAC9F,UAAM,aAAa,KAAK,UAAU,UAAU;AAC5C,UAAM,gBAAgB,KAAK,WAAW,SAAS;AAE/C,QAAI;AACJ,QAAI,KAAK,UAAU;AACjB,gBAAU;AAAA,IACZ,OAAO;AAGL,gBAAU;AAAA,IACZ;AAEA,WAAO;AAAA,MACL;AAAA,MACA,aAAa,aAAa;AAAA,MAC1B,SAAS,KAAK,WAAW;AAAA,IAC3B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAe,UAAkB,MAAe,SAAyB;AACvE,UAAM,QAAQ,IAAI,SAAS,UAAU,MAAM,KAAK;AAEhD,QAAI,MAAM;AACR,YAAM,MAAM,MAAM,IAAI;AACtB,YAAM,mBAAmB,KAAK;AAC9B,YAAM,iBAAiB,KAAK;AAAA,IAC9B,OAAO;AACL,YAAM,MAAM;AACZ,YAAM,mBAAmB;AACzB,YAAM,iBAAiB;AAAA,IACzB;AACA,UAAM,YAAY,WAAW;AAC7B,UAAM,WAAW;AAMjB,SAAK,WAAW,KAAK,KAAK;AAE1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,aAAwC;AAGtD,QAAI,YAAY,SAAS;AACvB,YAAM,WAAW,YAAY,eAAe;AAC5C,aAAO,OAAO,OAAO,CAAC,UAAU,YAAY,OAAO,CAAC;AAAA,IACtD;AAEA,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,gBAA8E;AAEhF,WAAO,CAAC,gBAAwB,qBAA6B;AAC3D,YAAM,eAAe,KAAK,WAAW;AACrC,aAAO,KAAK,oBAAoB,gBAAgB,kBAAkB,YAAY;AAAA,IAChF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gBAA+B;AAC7B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBAAmB,QAAsB;AAC/C,UAAM,WAAW,OAAO;AACxB,UAAM,aAAa,KAAK,IAAI,QAAS,IAAI,QAAQ;AACjD,UAAM,cAAc,WAAW;AAC/B,UAAM,OAAO,OAAO,SAAS,aAAa,cAAc,UAAU;AAGlE,QAAI,aAAa;AACjB,aAAS,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK;AAC1C,UAAI,KAAK,CAAC,MAAM,IAAM;AACpB,YAAI,KAAK,aAAa,CAAC,MAAM,YAAY,WAAW;AAClD,uBAAa,cAAc;AAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,eAAe,IAAI;AACrB,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AAEA,UAAM,aAAa,OAAO,SAAS,YAAY,aAAa,EAAE;AAC9D,QAAI,WAAW,aAAa,CAAC,MAAM,YAAY,WAAW;AACxD,WAAK,iBAAiB,WAAW,aAAa,YAAY,gBAAgB;AAC1E,WAAK,mBAAmB,WAAW,aAAa,YAAY,kBAAkB;AAE9E,UAAI,KAAK,qBAAqB,YAAY;AAExC,cAAM,gBAAgB,aAAa;AACnC,cAAM,gBAAgB,OAAO,SAAS,eAAe,gBAAgB,EAAE;AACvE,YAAI,cAAc,aAAa,CAAC,MAAM,kBAAkB,WAAW;AACjE,gBAAM,cAAc,OAAO,cAAc,gBAAgB,CAAC,CAAC;AAC3D,gBAAM,cAAc,OAAO,SAAS,aAAa,cAAc,EAAE;AACjE,eAAK,iBAAiB,OAAO,YAAY,gBAAgB,kBAAkB,gBAAgB,CAAC;AAC5F,eAAK,mBAAmB,OAAO,YAAY,gBAAgB,kBAAkB,kBAAkB,CAAC;AAAA,QAClG;AAAA,MACF;AAAA,IACF,OAAO;AACL,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AAGA,UAAM,gBAAgB,WAAW,aAAa,YAAY,eAAe;AACzE,QAAI,gBAAgB,GAAG;AACrB,YAAM,eAAe,aAAa;AAClC,WAAK,aAAa,OAAO,SAAS,cAAc,eAAe,aAAa,EAAE,SAAS;AAAA,IACzF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,yBAAqC;AAC3C,QAAI,CAAC,KAAK,UAAU;AAClB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,SAAS,KAAK;AACpB,UAAM,UAAsB,CAAC;AAC7B,QAAI,SAAS,KAAK;AAClB,QAAI,YAAY,KAAK;AACrB,UAAM,aAAa,KAAK,OAAO,cAAc,MAAM;AAEnD,WAAO,YAAY,GAAG;AACpB,YAAM,oBAAoB,KAAK,IAAI,YAAY,SAAS;AACxD,YAAM,QAAQ,OAAO,SAAS,QAAQ,SAAS,iBAAiB;AAGhE,UAAI,cAAc;AAClB,aAAO,cAAc,MAAM,QAAQ;AACjC,YAAI,MAAM,aAAa,WAAW,MAAM,YAAY,WAAW;AAC7D;AAAA,QACF;AAGA,cAAM,QAAQ,IAAI,SAAS,MAAM,MAAM,KAAK;AAC5C,cAAM,YAAY,MAAM,SAAS,WAAW;AAC5C,cAAM,gBAAgB,MAAM,aAAa,SAAS;AAElD,gBAAQ,KAAK,KAAK;AAGlB,uBAAgB,UAAU,SAAS,cAAc;AAAA,MACnD;AAEA,gBAAU;AACV,mBAAa;AAAA,IACf;AAKA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,QAAc;AACpB,SAAK,iBAAiB;AACtB,SAAK,mBAAmB;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,oBAAoB,gBAAwB,kBAA0B,cAA8B;AAC1G,UAAM,QAAQ,OAAO,MAAM,YAAY,IAAI;AAC3C,UAAM,cAAc,YAAY,WAAW,CAAC;AAC5C,UAAM,cAAc,GAAG,CAAC;AACxB,UAAM,cAAc,GAAG,CAAC;AACxB,UAAM,cAAc,cAAc,CAAC;AACnC,UAAM,cAAc,cAAc,EAAE;AACpC,UAAM,cAAc,gBAAgB,EAAE;AACtC,UAAM,cAAc,kBAAkB,EAAE;AACxC,UAAM,cAAc,GAAG,EAAE;AAEzB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,gBAA+B;AAE7B,QAAI;AACJ,QAAI;AACF,mBAAa,KAAK,aAAa;AAAA,IACjC,SAAS,OAAO;AAGd,aAAO,MAAM,kDAAkD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AACvH,aAAO,MAAM,iCAAiC,iBAAiB,QAAQ,MAAM,QAAQ,gBAAgB,EAAE;AACvG,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,aAAO;AAAA,IACT;AAEA,UAAM,kBAAkB,IAAI,uBAAe,EAAE,oBAAoB,KAAK,CAAC;AAIvE,UAAM,iBAAiB,WAAW,OAAO,WAAS;AAChD,YAAM,WAAW,MAAM,YAAY;AACnC,aAAO,aAAa,uBACb,aAAa,sBACb,aAAa;AAAA,IACtB,CAAC;AAED,eAAW,SAAS,gBAAgB;AAClC,UAAI,MAAM,QAAQ;AAEhB,cAAM,aAAa,OAAO,KAAK,MAAM,QAAQ,KAAK;AAClD,wBAAgB,QAAQ,UAAU;AAAA,MACpC;AAAA,IACF;AAEA,UAAM,aAAa,gBAAgB,WAAW;AAC9C,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,qBAA6C;AACjD,QAAI,aAAyB,CAAC;AAE9B,QAAI;AAEF,UAAI,KAAK,UAAU;AACjB,qBAAa,KAAK,aAAa;AAAA,MACjC,OAAO;AAGL,eAAO,MAAM,+FAA+F;AAC5G,eAAO;AAAA,MACT;AAAA,IACF,SAAS,OAAO;AACd,aAAO,MAAM,wDAAwD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC7H,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,aAAO;AAAA,IACT;AAEA,UAAM,kBAAkB,IAAI,uBAAe,EAAE,oBAAoB,KAAK,CAAC;AAIvE,UAAM,iBAAiB,WAAW,OAAO,WAAS;AAChD,YAAM,WAAW,MAAM,YAAY;AACnC,aAAO,aAAa,uBACb,aAAa,sBACb,aAAa;AAAA,IACtB,CAAC;AAED,eAAW,SAAS,gBAAgB;AAClC,UAAI,MAAM,QAAQ;AAEhB,cAAM,aAAa,OAAO,KAAK,MAAM,QAAQ,KAAK;AAClD,wBAAgB,QAAQ,UAAU;AAAA,MACpC;AAAA,IACF;AAEA,UAAM,aAAa,gBAAgB,WAAW;AAC9C,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAEF;AA3rBqB,OACH,UAAU,eAAe;AADtB,OAEH,cAAc,eAAe;;;ACIxC,IAAM,UAAN,MAAc;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnB,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,yBAAyB,cAAsB,OAAyB;AAE9E,QAAI,MAAM,iBAAiB,UAAU,OAAO,aAAa,QAAQ;AAC/D,YAAM,IAAI;AAAA,QACR,uBAAuB,MAAM,cAAc,0BAA0B,aAAa,MAAM,cAAc,MAAM,QAAQ;AAAA,MACtH;AAAA,IACF;AAGA,UAAM,eAAe,aAAa,SAAS,MAAM,gBAAgB,MAAM,iBAAiB,UAAU,IAAI;AAGtG,QAAI,aAAa,aAAa,CAAC,MAAM,UAAU,WAAW;AACxD,YAAM,IAAI;AAAA,QACR,iDAAiD,MAAM,QAAQ,cAAc,MAAM,cAAc;AAAA,MACnG;AAAA,IACF;AAGA,UAAM,iBAAiB,aAAa,aAAa,UAAU,SAAS;AACpE,UAAM,mBAAmB,aAAa,aAAa,UAAU,SAAS;AAGtE,WAAO,UAAU,OAAO,iBAAiB;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBQ,eACN,cACA,OACQ;AAER,UAAM,kBAAkB,KAAK,yBAAyB,cAAc,KAAK;AAIzE,UAAM,qBAAqB,MAAM,WAAW,QAAQ,eAAe;AACnE,UAAM,iBAAiB,kBAAkB,MAAM,kBAAkB,oBAAoB,KAAK;AAG1F,QAAI,MAAM,iBAAiB,iBAAiB,aAAa,QAAQ;AAC/D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,QAAQ,uCACb,MAAM,cAAc,WAAW,cAAc,oBAAoB,aAAa,MAAM;AAAA,MAChG;AAAA,IACF;AAGA,UAAM,cAAc,aAAa,SAAS,MAAM,gBAAgB,MAAM,iBAAiB,cAAc;AAGrG,QAAI,mBAAmB;AACrB,YAAM,iBAAiB,kBAAkB,MAAM;AAC/C,YAAM,cAAc,YAAY,aAAa,cAAc;AAC3D,UAAI,gBAAgB,WAAY;AAC9B,cAAM,IAAI;AAAA,UACR,+CAA+C,MAAM,QAAQ,gCAC9B,YAAY,SAAS,EAAE,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAGA,WAAO,OAAO,KAAK,WAAW;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,qBACN,OACA,mBACU;AAEV,UAAM,SAAS,IAAI,SAAS,MAAM,UAAU,MAAM,WAAW,MAAM,MAAM,KAAK;AAG9E,WAAO,YAAY,MAAM;AACzB,WAAO,aAAa,MAAM;AAC1B,WAAO,WAAW,MAAM;AACxB,WAAO,YAAY,MAAM;AACzB,WAAO,cAAc,MAAM;AAC3B,WAAO,MAAM,MAAM;AACnB,WAAO,iBAAiB,MAAM;AAC9B,WAAO,mBAAmB,MAAM;AAChC,WAAO,YAAY,MAAM;AACzB,WAAO,cAAc,MAAM;AAC3B,WAAO,cAAc,MAAM;AAC3B,WAAO,iBAAiB;AAGxB,QAAI,MAAM,YAAY;AACpB,aAAO,aAAa,OAAO,KAAK,MAAM,UAAU;AAAA,IAClD;AAGA,WAAO,cAAc,MAAM;AAC3B,WAAO,kBAAkB,MAAM;AAC/B,WAAO,cAAc,MAAM;AAC3B,WAAO,aAAa,MAAM;AAC1B,WAAO,YAAY,MAAM;AAGzB,WAAO,WAAW,MAAM;AACxB,WAAO,gBAAgB,MAAM;AAC7B,WAAO,MAAM,MAAM;AACnB,WAAO,MAAM,MAAM;AACnB,WAAO,SAAS,MAAM;AAGtB,WAAO,YAAY,MAAM;AACzB,WAAO,aAAa,MAAM;AAG1B,WAAO,aAAa,MAAM;AAC1B,WAAO,gBAAgB,MAAM;AAC7B,WAAO,QAAQ,MAAM;AAErB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,mCACN,SACA,YACA,kBACQ;AACR,UAAM,mBAA6B,CAAC;AACpC,eAAW,SAAS,SAAS;AAC3B,uBAAiB,KAAK,MAAM,gBAAgB,CAAC;AAAA,IAC/C;AACA,UAAM,mBAAmB,OAAO,OAAO,gBAAgB;AACvD,UAAM,iBAAiB,iBAAiB;AAExC,UAAM,eAAe,OAAO,KAAK,YAAY,MAAM;AACnD,UAAM,gBAAgB,KAAK,IAAI,aAAa,QAAQ,KAAM;AAE1D,UAAM,aAAa,OAAO,MAAM,KAAK,aAAa;AAClD,QAAI,MAAM;AACV,eAAW,cAAc,YAAY,WAAW,GAAG;AACnD,WAAO;AACP,eAAW,cAAc,GAAG,GAAG;AAC/B,WAAO;AACP,eAAW,cAAc,GAAG,GAAG;AAC/B,WAAO;AACP,eAAW,cAAc,QAAQ,QAAQ,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,QAAQ,QAAQ,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,gBAAgB,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,kBAAkB,GAAG;AAC9C,WAAO;AACP,eAAW,cAAc,eAAe,GAAG;AAC3C,WAAO;AACP,QAAI,gBAAgB,GAAG;AACrB,mBAAa,KAAK,YAAY,KAAK,GAAG,aAAa;AAAA,IACrD;AAEA,WAAO,OAAO,OAAO,CAAC,kBAAkB,UAAU,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,mBACJ,iBACA,SACgC;AAChC,UAAM,gBAAgB,KAAK,OAAO,QAAQ,eAAe;AAEzD,QAAI,gBAAgB,SAAS,cACzB,cAAc,OAAO,QAAQ,WAAW,IACxC;AAEJ,QAAI,SAAS,aAAa;AACxB,sBAAgB,CAAC,GAAG,aAAa,EAAE,KAAK,QAAQ,WAAW;AAAA,IAC7D;AAEA,QAAI,cAAc,WAAW,GAAG;AAC9B,YAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAEA,UAAM,eAAyB,CAAC;AAChC,QAAI,aAAa;AACjB,UAAM,gBAA4B,CAAC;AAEnC,eAAW,eAAe,eAAe;AACvC,YAAM,oBAAoB;AAC1B,YAAM,cAAc,KAAK,eAAe,iBAAiB,WAAW;AACpE,mBAAa,KAAK,WAAW;AAC7B,oBAAc,YAAY;AAC1B,YAAM,cAAc,KAAK,qBAAqB,aAAa,iBAAiB;AAC5E,oBAAc,KAAK,WAAW;AAAA,IAChC;AAEA,UAAM,kBAAkB,OAAO,OAAO,YAAY;AAElD,WAAO;AAAA,MACL;AAAA,MACA,eAAe,gBAAgB;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,6BACE,SACA,SACQ;AACR,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAEA,UAAM,aAAa,SAAS,cAAc;AAC1C,UAAM,mBAAmB,SAAS,oBAAoB;AACtD,UAAM,SAAiB,KAAK;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,cACJ,iBACA,SACqB;AACrB,UAAM,EAAE,iBAAiB,eAAe,cAAc,IAAI,MAAM,KAAK;AAAA,MACnE;AAAA,MACA;AAAA,IACF;AAEA,UAAM,aACJ,SAAS,qBAAqB,SAAS,KAAK,OAAO,cAAc,IAC7D,KAAK,OAAO,cAAc,IAC1B;AAEN,UAAM,iBAAiB,KAAK,6BAA6B,eAAe;AAAA,MACtE;AAAA,MACA,kBAAkB;AAAA,IACpB,CAAC;AAED,UAAM,YAAY,OAAO,OAAO,CAAC,iBAAiB,cAAc,CAAC;AAEjE,WAAO;AAAA,MACL,SAAS,cAAc,IAAI,YAAU;AAAA,QACnC,UAAU,MAAM;AAAA,QAChB,mBAAmB,MAAM;AAAA,QACzB,gBAAgB,MAAM;AAAA,MACxB,EAAE;AAAA,MACF,kBAAkB;AAAA,MAClB,cAAc,cAAc;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACF;;;AC3ZA,IAAM,UAAU;AAAA;AAAA,EAEd,QAAQ;AAAA;AAAA,EAER,OAAO;AAAA;AAAA,EAEP,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA,EAMZ,aAAa,OAAO,gBAAgB,eAAe,OAAO,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOzE,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAAY;AACd;AAEA,IAAO,kBAAQ;;;AClER,IAAM,WAAW;AAAA,EACtB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,aAAa;AAAA,EACb,SAAS;AAAA,EACT,MAAM;AAAA,EACN,QAAQ;AACV;AAGO,SAAS,gBAAgB,QAAgB,OAAuB;AACrE,MAAI,MAAM,OAAO,KAAK,OAAO,SAAS,OAAO,QAAQ,CAAC,CAAC;AACvD,MAAI,OAAO;AAEX,SAAO,SAAS,KAAK,IAAI,SAAS,KAAK,CAAC,EAAE;AAC5C;AAGO,IAAM,OAAO,CAAC,GAAW,MAAc,KAAK,KAAK,GAAG,CAAC,MAAM;AAQ3D,SAAS,SAAS,KAAiC;AACxD,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,aAAa;AACnB,SAAO,OAAO,WAAW,OAAO,cACzB,OAAO,WAAW,UAAU,cAC5B,OAAO,WAAW,WAAW;AACtC;AAKO,SAAS,UAAU,OAAqE;AAC7F,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,2BAA2B;AACpD,WAAO,SAAS;AAAA,EAClB,WACS,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM,kBAAkB;AACnE,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,0BAA0B;AACnD,WAAO,SAAS;AAAA,EAClB,WACS,OAAO,SAAS,KAAK,GAAG;AAC/B,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,2BAA2B;AACpD,WAAO,SAAS;AAAA,EAClB,WAAY,iBAAiB,MAAM;AACjC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,yBAAyB;AAClD,WAAO,SAAS;AAAA,EAClB,WAAW,iBAAiB,YAAY;AACtC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,4BAA4B;AACrD,WAAO,SAAS;AAAA,EAClB,WACS,iBAAiB,aAAa;AACrC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,gCAAgC;AACzD,WAAO,SAAS;AAAA,EAClB,OAAO;AACL,UAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,EAC7C;AACF;AAOO,IAAM,iBAAiB,CAAC,aAA8B;AAC3D,SAAO,aAAa,uBACb,aAAa,sBACb,aAAa;AACtB;;;ACtFO,IAAM,kBAAN,MAAsB;AAAA,EAQ3B,YAAY,UAAkB,YAAoB;AAFlD,SAAQ,sBAA8B;AAGpC,SAAK,WAAW;AAChB,SAAK,aAAa;AAClB,SAAK,iBAAiB;AACtB,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,iBAAiB,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,gBAA8B;AACnC,SAAK,kBAAkB;AACvB,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,YAA0B;AACtC,SAAK,aAAa;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAuB;AAC7B,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,UAAU,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAKxE,UAAM,eACJ,UAAU,KAAK,uBACd,MAAM,KAAK,iBAAkB;AAEhC,QAAI,cAAc;AAChB,WAAK,sBAAsB;AAC3B,WAAK,iBAAiB;AACtB,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAsB;AAC5B,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,UAAM,OAAO,KAAK,iBAAiB;AACnC,UAAM,MAAM,KAAK,aAAa,KAAK,kBAC9B,KAAK,aAAa,KAAK,kBAAkB,OAC1C;AACJ,UAAM,UAAU,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAExE,UAAM,cAAc,CAAC,UAA0B;AAC7C,YAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,IAAI;AACpC,UAAI,OAAO;AACX,UAAI,YAAY;AAEhB,aAAO,QAAQ,QAAQ,YAAY,MAAM,SAAS,GAAG;AACnD,gBAAQ;AACR;AAAA,MACF;AAEA,aAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,IAC9C;AAEA,UAAM,aAAa,CAAC,YAA4B;AAC9C,UAAI,UAAU,GAAI,QAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC;AAC9C,UAAI,UAAU,KAAM,QAAO,GAAG,KAAK,MAAM,UAAU,EAAE,CAAC,MAAM,UAAU,IAAI,QAAQ,CAAC,CAAC;AACpF,aAAO,GAAG,KAAK,MAAM,UAAU,IAAI,CAAC,KAAK,KAAK,MAAO,UAAU,OAAQ,EAAE,CAAC;AAAA,IAC5E;AAEA,YAAQ,OAAO;AAAA,MACb,KAAK,KAAK,QAAQ,KAAK,OAAO,MAAM,YAAY,KAAK,cAAc,CAAC,IAAI,YAAY,KAAK,UAAU,CAAC,MAChG,YAAY,IAAI,CAAC,YAAY,WAAW,GAAG,CAAC;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAiB;AACf,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,UAAM,OAAO,KAAK,iBAAiB;AAEnC,UAAM,cAAc,CAAC,UAA0B;AAC7C,YAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,IAAI;AACpC,UAAI,OAAO;AACX,UAAI,YAAY;AAEhB,aAAO,QAAQ,QAAQ,YAAY,MAAM,SAAS,GAAG;AACnD,gBAAQ;AACR;AAAA,MACF;AAEA,aAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,IAC9C;AAEA,YAAQ;AAAA,MACN,KAAK,KAAK,QAAQ,WAAW,YAAY,KAAK,cAAc,CAAC,MACzD,YAAY,IAAI,CAAC,oBAAoB,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,qBAA6B;AAC3B,WAAO,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA,EAKA,oBAA4B;AAC1B,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AACF;;;AC5HO,IAAM,oBAAN,MAAwB;AAAA,EAG7B,cAAc;AAFd,SAAQ,YAAuD,oBAAI,IAAI;AAIrE,SAAK,iBAAiB,IAAI,UAAU,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,UAAoC;AACnD,QAAI,SAAS,4BAAqC,GAAG;AACnD,WAAK,UAAU,wBAAiC,QAAQ;AAAA,IAC1D;AACA,QAAI,SAAS,yBAAkC,GAAG;AAChD,WAAK,UAAU,qBAA8B,QAAQ;AAAA,IACvD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,sBAA0C;AACxC,WAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAAqD;AAC/D,WAAO,KAAK,UAAU,IAAI,MAAM,KAAK;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,MAAc,SAAuD;AACjF,UAAM,WAAW,KAAK,YAAY,QAAQ,MAAM;AAChD,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,+CAA+C,QAAQ,MAAM;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,QAAQ,MAAM,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,MAAc,SAAuD;AACjF,UAAM,WAAW,KAAK,YAAY,QAAQ,MAAM;AAChD,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,+CAA+C,QAAQ,MAAM;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,QAAQ,MAAM,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAyC;AACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB,SAAoE;AAClF,UAAM,SAAmB,CAAC;AAE1B,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO,KAAK,+BAA+B;AAAA,IAC7C;AAEA,QAAI,CAAC,QAAQ,YAAY,QAAQ,SAAS,WAAW,GAAG;AACtD,aAAO,KAAK,sBAAsB;AAAA,IACpC;AAEA,QAAI,QAAQ,YAAY,QAAQ,SAAS,SAAS,GAAG;AACnD,aAAO,KAAK,6CAA6C;AAAA,IAC3D;AAEA,WAAO;AAAA,MACL,SAAS,OAAO,WAAW;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,QAAuF;AACnG,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,MACL,MAAM,SAAS,cAAc;AAAA,MAC7B,WAAW,SAAS,aAAa;AAAA,MACjC,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAqG;AACnG,UAAM,UAAiG,CAAC;AAExG,eAAW,CAAC,QAAQ,QAAQ,KAAK,KAAK,WAAW;AAC/C,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM,SAAS,cAAc;AAAA,QAC7B,WAAW,SAAS,aAAa;AAAA,QACjC,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAEA,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM;AAE5B,aAAO,EAAE,KAAK,cAAc,EAAE,IAAI;AAAA,IACpC,CAAC;AAAA,EACH;AACF;;;AClHA,IAAM,cAAc,oBAAI,KAAK;AAC7B,IAAM,cAAc,GAAG,OAAO,YAAY,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,IAAI,OAAO,YAAY,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,IAAI,YAAY,YAAY,CAAC;AAElJ,IAAM,UAAU;AAAA,EACrB,QAAQ;AAAA;AAAA,EACR,MAAM;AACR;;;ACbA,IAAO,eAAQ;;;ACKf,IAAqB,gBAArB,cAA2C,aAAO;AAAA,EAChD,cAAc;AACZ,UAAM;AAAA,EAOR;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,MAAwC;AACxD,QAAI,UAAU,IAAI,MAAM,SAAS,MAAM;AACrC,YAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,IAC7C;AAEA,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,SAAS,IAAI,OAAO,WAAW;AACrC,aAAO,kBAAkB,IAAI;AAE7B,aAAO,SAAS,CAAC,MAAiC;AAChD,YAAI,CAAC,OAAO,QAAQ;AAClB,iBAAO,IAAI,MAAM,qBAAqB,CAAC;AACvC;AAAA,QACF;AAEA,YAAI;AAEF,gBAAM,SAAS,OAAO,KAAK,OAAO,MAAqB;AAQvD,gBAAM,UAAU,MAAM,QAAQ,MAAM;AACpC,kBAAQ,OAAO;AAAA,QACjB,SAAS,OAAO;AACd,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAEA,aAAO,UAAU,MAAM;AACrB,eAAO,OAAO,SAAS,IAAI,MAAM,qBAAqB,CAAC;AAAA,MACzD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKA,mBAAmB,MAA0B;AAC3C,UAAM,QAAQ,MAAM,eAAe,KAAK,IAAI;AAC5C,UAAM,WAAW;AACjB,UAAM,mBAAmB,KAAK;AAE9B,UAAM,WAAW,IAAI,KAAK,KAAK,YAAY;AAC3C,UAAM,cAAc,MAAM,YAAY,QAAQ;AAC9C,UAAM,YAAoB,WAAW;AAErC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,MAAiC;AAC9C,UAAM,cAAc,MAAM,KAAK,YAAY;AAC3C,UAAM,SAAS,OAAO,KAAK,WAAW;AACtC,WAAO,OAAO,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAAiB,OAAiB,MAAY,SAA4C;AAC9F,QAAI,UAAU,IAAI,MAAM,SAAS,MAAM;AACrC,YAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,IAC7C;AAEA,WAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC5C,YAAM,gBAAgB,OAAOC,QAAiBC,OAAcC,aAA+C;AAEzG,eAAO,MAAM,KAAK,aAAaF,QAAOC,OAAMC,QAAO;AAAA,MACrD;AAEA,YAAM,SAAS,IAAI,OAAO,WAAW;AACrC,aAAO,kBAAkB,IAAI;AAE7B,aAAO,SAAS,eAAiC,GAA8B;AAC7E,YAAI,CAAC,KAAK,QAAQ;AAChB,iBAAO,IAAI,MAAM,qBAAqB,CAAC;AACvC;AAAA,QACF;AACA,YAAI;AACF,gBAAM,SAAS,OAAO,KAAK,KAAK,MAAqB;AACrD,gBAAM,SAAS,MAAM,cAAc,OAAO,QAAQ,OAAO;AACzD,kBAAQ,MAAM;AAAA,QAChB,SAAS,OAAO;AACd,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAEA,aAAO,UAAU,SAA2B,GAA8B;AACxE,eAAO,KAAK,SAAS,IAAI,MAAM,qBAAqB,CAAC;AAAA,MACvD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKA,MAAM,YAAY,OAAiB,eAA+C;AAChF,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,QAAQ,OAAO,aAAa;AACvD,UAAI,CAAC,QAAS,QAAO;AAGrB,YAAM,aAAa,IAAI,WAAW,OAAO;AACzC,aAAO,IAAI,KAAK,CAAC,UAAU,GAAG,EAAE,MAAM,2BAA2B,CAAC;AAAA,IACpE,SAAS,OAAO;AACd,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA,EAKA,MAAM,cAAc,YAA8B,SAAkD;AAClG,UAAM,WAAW,SAAS,YAAY,MAAM;AAAA,IAAC;AAC7C,UAAM,eAAe,SAAS,gBAAgB,MAAM;AAAA,IAAC;AAErD,UAAM,aAAa,MAAM,aAAa;AACtC,QAAI,CAAC,YAAY;AACf,eAAS,IAAI,MAAM,eAAO,QAAQ,CAAC;AACnC,aAAO;AAAA,IACT;AAEA,QAAI,SAAS;AACb,UAAM,UAAoB,CAAC;AAE3B,eAAW,SAAS,YAAY;AAC9B,UAAI,CAAC,MAAM,WAAW;AAEpB,YAAI,MAAM,aAAa,sBAAsB,MAAM,aAAa,uBAAuB,MAAM,aAAa,oBAAoB;AAE5H,gBAAM,YAAY;AAAA,QAEpB,OAAO;AACL,gBAAM,SAAS,MAAM,MAAM,UAAU,KAAK;AAC1C,gBAAM,iBAAiB;AACvB,oBAAU,OAAO;AACjB,kBAAQ,KAAK,MAAM;AACnB,uBAAa,OAAO,QAAQ;AAC5B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,MAAM,UAAU;AACnB,iBAAS,IAAI,MAAM,eAAO,cAAc,CAAC;AACzC,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,MAAM,MAAM,SAAS,YAAY;AAGpD,UAAI,MAAM,WAAW,MAAM,kBAAkB,MAAM,KAAK;AAEtD,cAAM,WAAW,MAAM,eAAe;AACtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,MAAM,QAAQ;AAE1C,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,MAAM,OAAO;AAC1B,qBAAa,OAAO,0BAA0B;AAC9C;AAAA,MACF;AAGA,UAAI,MAAM,aAAa,sBAAsB,MAAM,aAAa,uBAAuB,MAAM,aAAa,oBAAoB;AAE5H,cAAM,SAAS,OAAO,KAAK,UAAU;AAGrC,cAAM,MAAM,MAAM,MAAM;AAGxB,cAAM,YAAY;AAClB,cAAM,iBAAiB,OAAO;AAC9B,cAAM,mBAAmB,OAAO;AAKhC,cAAM,WAAW,MAAM,eAAe;AACtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,OAAO;AAEnC,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,MAAM;AACnB,qBAAa,OAAO,mBAAmB;AAAA,MACzC,OAAO;AAEL,cAAM,UAAU,MAAM,KAAK,aAAa,OAAO,OAAO,KAAK,UAAU,GAAG,UAAU;AAClF,cAAM,WAAW,MAAM,eAAe;AAEtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,QAAQ;AAEpC,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,OAAO;AACpB,qBAAa,OAAO,SAAS;AAAA,MAC/B;AAAA,IACF;AAEA,UAAM,mBAAmB;AACzB,eAAW,SAAS,YAAY;AAC9B,YAAM,kBAAkB,MAAM,gBAAgB;AAC9C,gBAAU,gBAAgB;AAC1B,cAAQ,KAAK,eAAe;AAAA,IAC9B;AAEA,UAAM,iBAAiB,SAAS;AAChC,UAAM,QAAQ,MAAM,cAAc,gBAAgB,gBAAgB;AAClE,YAAQ,KAAK,KAAK;AAElB,UAAM,iBAAiB,OAAO,OAAO,OAAO;AAE5C,UAAM,aAAa,IAAI,WAAW,cAAc;AAChD,WAAO,IAAI,KAAK,CAAC,UAAU,GAAG,EAAE,MAAM,kBAAkB,CAAC;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,eAAe,UAA2B;AAChD,WAAO,aAAa,uBACb,aAAa,sBACb,aAAa;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,QAAQ,MAAgB,SAA8C;AAE1E,UAAM,QAAQ,KAAK,mBAAmB,IAAI;AAK1C,UAAM,WAAW;AACjB,UAAM,iBAAiB,MAAM,KAAK,iBAAiB,OAAO,UAAU,OAAO;AAC3E,UAAM,UAAU;AAEhB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,OAAiB,eAA2C;AAC5E,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,YAAY,OAAO,aAAa;AACxD,aAAO,SAAS;AAAA,IAClB,SAAS,OAAO;AACd,cAAQ,MAAM,2BAA2B,MAAM,QAAQ,KAAK,KAAK;AACjE,aAAO;AAAA,IACT;AAAA,EACF;AACF;;;AvBxSA,IAAI,OAAO,eAAe,aAAa;AACrC,EAAC,WAAmB,SAAS;AAC/B;AAkBO,IAAM,gBAAgB;AAAA,EAC3B,WAAW,OAAO,WAAW,eAAe,OAAO,aAAa;AAAA,EAChE,QAAQ,OAAO,YAAY,eAAe,QAAQ,YAAY,QAAQ,SAAS;AACjF;",
-  "names": ["len", "i", "len2", "Buffer", "i", "byteLength", "readBigUInt64LE", "crc32", "crc32", "require_deflate", "crc32", "require_inflate", "t", "t2", "t3", "t4", "ENCRYPT_HDR_SIZE", "pako", "dataStart", "dataEnd", "entry", "data", "options"]
+  "sources": ["../../../../node_modules/.pnpm/base64-js@1.5.1/node_modules/base64-js/index.js", "../../../../node_modules/.pnpm/ieee754@1.2.1/node_modules/ieee754/index.js", "../../../../node_modules/.pnpm/buffer@6.0.3/node_modules/buffer/index.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/trees.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/adler32.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/crc32.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/messages.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/constants.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/deflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/utils/common.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/utils/strings.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/zstream.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/deflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inffast.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inftrees.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/inflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/zlib/gzheader.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/lib/inflate.js", "../../../../node_modules/.pnpm/pako@2.2.0/node_modules/pako/index.js", "../../src/browser/index.esm.ts", "../../src/core/constants/Errors.ts", "../../src/core/constants/MetaPaths.ts", "../../src/core/constants/Headers.ts", "../../src/core/components/Logger.ts", "../../src/browser/crypto-browser-shim.js", "../../src/core/encryption/ZipCrypto.ts", "../../src/core/ZipEntry.ts", "../../src/types/index.ts", "../../src/browser/zstd-browser-shim.ts", "../../src/core/components/HashCalculator.ts", "../../src/core/encryption/AesCrypto.ts", "../../src/core/encryption/NeoCrypto.ts", "../../src/core/ZipCompress.ts", "../../src/node/LegacyZstd.ts", "../../src/core/ZipDecompress.ts", "../../src/core/merkle/MerkleRoot.ts", "../../src/core/Zipkit.ts", "../../src/core/ZipCopy.ts", "../../src/core/components/Support.ts", "../../src/core/components/Util.ts", "../../src/core/components/ProgressTracker.ts", "../../src/core/encryption/Manager.ts", "../../src/core/version.ts", "../../src/core/index.ts", "../../src/browser/ZipkitBrowser.ts"],
+  "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", "/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n", "/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\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/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH    = 3;\nconst MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES       = 30;\n/* number of distance codes */\n\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nconst MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES + 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\nconst 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\nconst _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\nconst _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst 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\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; 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  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS + 1);\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 */\nconst init_block = (s) => {\n\n  let 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.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block(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 */\nconst _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  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nmodule.exports._tr_init  = _tr_init;\nmodule.exports._tr_stored_block = _tr_stored_block;\nmodule.exports._tr_flush_block  = _tr_flush_block;\nmodule.exports._tr_tally = _tr_tally;\nmodule.exports._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\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\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\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\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\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\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = require('./trees');\nconst adler32 = require('./adler32');\nconst crc32   = require('./crc32');\nconst msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_PARTIAL_FLUSH, Z_FULL_FLUSH, Z_FINISH, Z_BLOCK,\n  Z_OK, Z_STREAM_END, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR,\n  Z_DEFAULT_COMPRESSION,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY,\n  Z_UNKNOWN,\n  Z_DEFLATED\n} = require('./constants');\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = msg[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n\n\n/* ===========================================================================\n * Insert string str in the dictionary and set match_head to the previous head\n * of the hash chain (the most recent string with same hash key). Return\n * the previous length of the hash chain.\n * IN  assertion: all calls to INSERT_STRING are made with consecutive input\n *    characters and the first MIN_MATCH bytes of str are valid (except for\n *    the last MIN_MATCH-1 bytes of the input file).\n */\nconst INSERT_STRING = (s, str) => {\n  let h;\n  if (s.legacy_hash) {\n    /* UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]); */\n    h = s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n  } else {\n    // ANZAC++ hash: reads 4 bytes, matches node.js zlib output (legacyHash\n    // restores classic zlib hash). Faster, with fewer collisions.\n    const w = s.window;\n    // Read 4 bytes little-endian. Math.imul reproduces C uint32 overflow in\n    // `(value * 66521 + 66521) >> 16` exactly.\n    const value = w[str] | (w[str + 1] << 8) | (w[str + 2] << 16) | (w[str + 3] << 24);\n    h = s.ins_h = ((Math.imul(value, 66521) + 66521) >>> 16) & s.hash_mask;\n  }\n  const hash_head = s.prev[str & s.w_mask] = s.head[h];\n  s.head[h] = str;\n  return hash_head;\n};\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(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 */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (!s.legacy_hash) {\n      /* The 4-byte hash reads one extra byte, so it needs one more available. */\n      if (s.lookahead + s.insert > MIN_MATCH) {\n        str = s.strstart - s.insert;\n        while (s.insert) {\n          INSERT_STRING(s, str);\n          str++;\n          s.insert--;\n          if (s.lookahead + s.insert <= MIN_MATCH) {\n            break;\n          }\n        }\n      }\n    } else if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        INSERT_STRING(s, str);\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH) ||\n                        flush === Z_NO_FLUSH ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH && flush !== Z_FINISH &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH) && flush !== Z_NO_FLUSH &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\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      hash_head = INSERT_STRING(s, s.strstart);\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          hash_head = INSERT_STRING(s, s.strstart);\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        if (s.legacy_hash) {\n          s.ins_h = s.window[s.strstart];\n          /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n          /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n           * matter since it will be recomputed at next deflate call.\n           */\n        }\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\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      hash_head = INSERT_STRING(s, s.strstart);\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          hash_head = INSERT_STRING(s, s.strstart);\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* 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.legacy_hash = 0; /* use classic zlib hash instead of default ANZAC++ */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR;\n  }\n  strm.state.gzhead = head;\n  return Z_OK;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy, legacyHash) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  let 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 || (windowBits === 8 && wrap !== 1)) {\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  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.legacy_hash = legacyHash ? 1 : 0;\n\n  s.hash_bits = memLevel + 7;\n  /* ANZAC++ hash needs >= 15 hash bits to span its 4 read bytes. */\n  if (!s.legacy_hash && s.hash_bits < 15) {\n    s.hash_bits = 15;\n  }\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n};\n\n\n/* ========================================================================= */\nconst deflate = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\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  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\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\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\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  const status = strm.state.status;\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 */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\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    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      INSERT_STRING(s, 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\nmodule.exports.deflateInit = deflateInit;\nmodule.exports.deflateInit2 = deflateInit2;\nmodule.exports.deflateReset = deflateReset;\nmodule.exports.deflateResetKeep = deflateResetKeep;\nmodule.exports.deflateSetHeader = deflateSetHeader;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateEnd = deflateEnd;\nmodule.exports.deflateSetDictionary = deflateSetDictionary;\nmodule.exports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n", "'use strict';\n\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nmodule.exports.assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nmodule.exports.flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n", "// String encode/decode helpers\n'use strict';\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[255] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nmodule.exports.string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nmodule.exports.buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nmodule.exports.utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n", "'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\nconst zlib_deflate = require('./zlib/deflate');\nconst utils        = require('./utils/common');\nconst strings      = require('./utils/strings');\nconst msg          = require('./zlib/messages');\nconst ZStream      = require('./zlib/zstream');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\nconst defaultOptions = {\n  level: Z_DEFAULT_COMPRESSION,\n  method: Z_DEFLATED,\n  chunkSize: 16384,\n  windowBits: 15,\n  memLevel: 8,\n  strategy: Z_DEFAULT_STRATEGY,\n  legacyHash: true\n};\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * - `legacyHash` (Boolean) - use the classic zlib hash (default), which matches\n *   canonical zlib output byte-for-byte. Set to `false` to use the faster\n *   ANZAC++ hash, which matches recent (chromium) node.js output instead.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n  this.options = utils.assign({}, defaultOptions, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new ZStream();\n  this.strm.avail_out = 0;\n\n  let status = zlib_deflate.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy,\n    opt.legacyHash\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  if (opt.header) {\n    zlib_deflate.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK) {\n      throw new Error(msg[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = zlib_deflate.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = zlib_deflate.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    this.result = utils.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n  const deflator = new Deflate(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate(input, options);\n}\n\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.constants = require('./zlib/constants');\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\nconst BAD = 16209;       /* got a data error -- remain here until reset */\nconst TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\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\nconst MAXBITS = 15;\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 199, 75\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES || 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    match = 20;\n\n  } else if (type === LENS) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS && 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] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS && 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\n\nmodule.exports = inflate_table;\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\nconst adler32       = require('./adler32');\nconst crc32         = require('./crc32');\nconst inflate_fast  = require('./inffast');\nconst inflate_table = require('./inftrees');\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH, Z_BLOCK, Z_TREES,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR,\n  Z_DEFLATED\n} = require('./constants');\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    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 */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.window = new Uint8Array(1 << state.wbits);\n  }\n\n  /* if window not in use yet, initialize */\n  if (state.wsize === 0) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR;\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          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = 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 ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(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.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END;\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 & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(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\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\n  const 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\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; }\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\n\nmodule.exports.inflateReset = inflateReset;\nmodule.exports.inflateReset2 = inflateReset2;\nmodule.exports.inflateResetKeep = inflateResetKeep;\nmodule.exports.inflateInit = inflateInit;\nmodule.exports.inflateInit2 = inflateInit2;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateEnd = inflateEnd;\nmodule.exports.inflateGetHeader = inflateGetHeader;\nmodule.exports.inflateSetDictionary = inflateSetDictionary;\nmodule.exports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n", "'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 GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nmodule.exports = GZheader;\n", "'use strict';\n\n\nconst zlib_inflate = require('./zlib/inflate');\nconst utils        = require('./utils/common');\nconst strings      = require('./utils/strings');\nconst msg          = require('./zlib/messages');\nconst ZStream      = require('./zlib/zstream');\nconst GZheader     = require('./zlib/gzheader');\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR\n} = require('./zlib/constants');\n\n/* ===========================================================================*/\n\nconst defaultOptions = {\n  chunkSize: 1024 * 64,\n  windowBits: 15,\n  to: ''\n};\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n  this.options = utils.assign({}, defaultOptions, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new ZStream();\n  this.strm.avail_out = 0;\n\n  let status  = zlib_inflate.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  this.header = new GZheader();\n\n  zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(msg[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = zlib_inflate.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = zlib_inflate.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = zlib_inflate.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Only the gzip format defines concatenated members (RFC 1952: a gzip file\n    // is \"a series of members\"). A zlib stream (RFC 1950) ends after its\n    // ADLER32, and a raw DEFLATE stream (RFC 1951) ends after its final block -\n    // neither format allows anything to follow, so bytes after the end are not\n    // ours to interpret and must be left in the input. Restart decoding only\n    // for a gzip member: `state.flags` is non-zero only once a gzip header has\n    // actually been decoded (it stays 0 for a zlib member, even when the format\n    // was auto-detected and the gzip bit of `wrap` is set). A trailing zero\n    // byte is padding, not the start of a member (no member can begin with 0).\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           (strm.state.wrap & 2) && strm.state.flags !== 0 &&\n           strm.input[strm.next_in] !== 0)\n    {\n      zlib_inflate.inflateReset(strm);\n      status = zlib_inflate.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      // Flush output if buffer is full, stream ended, or an explicit flush was\n      // requested (e.g. Z_SYNC_FLUSH) - to push out the tail, same as node's zlib.\n      if (strm.avail_out === 0 || status === Z_STREAM_END || _flush_mode > 0) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n\n          // Force a fresh output buffer on next iteration / next push, so the\n          // already emitted tail is not sent again.\n          strm.avail_out = 0;\n          strm.next_out = 0;\n        }\n      }\n    }\n\n    // A full output buffer means there may be more to produce - allocate a new\n    // one and call inflate again. The status depends on the flush mode: with\n    // Z_NO_FLUSH a full buffer is reported as Z_OK, but with Z_FINISH the same\n    // situation is reported as Z_BUF_ERROR (\"could not make progress now\",\n    // non-fatal) even though output is still pending. Both must continue; the\n    // distinction that matters is purely \"was the output buffer exhausted\".\n    if ((status === Z_OK || status === Z_BUF_ERROR) && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = zlib_inflate.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) {\n      // Input is exhausted. If the caller declared this the end of the stream\n      // (Z_FINISH) but we never saw Z_STREAM_END, the compressed data ended\n      // before its terminating marker - i.e. it is truncated/incomplete. That\n      // is an error: returning the partial output as success would be\n      // indistinguishable from a complete decode, hiding the data loss. Report\n      // it via Z_BUF_ERROR. (Reached only when the output buffer still had room\n      // - a full buffer is handled by the `continue` above - so this genuinely\n      // means \"ran out of input\", not \"ran out of output\".)\n      if (_flush_mode === Z_FINISH) {\n        status = zlib_inflate.inflateEnd(this.strm);\n        this.onEnd(status === Z_OK ? Z_BUF_ERROR : status);\n        this.ended = true;\n        return false;\n      }\n      break;\n    }\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n  const inflator = new Inflate(options);\n\n  inflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || msg[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = inflate;\nmodule.exports.constants = require('./zlib/constants');\n", "// Top level file is just a mixin of submodules & constants\n'use strict';\n\nconst { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate');\n\nconst { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate');\n\nconst constants = require('./lib/zlib/constants');\n\nmodule.exports.Deflate = Deflate;\nmodule.exports.deflate = deflate;\nmodule.exports.deflateRaw = deflateRaw;\nmodule.exports.gzip = gzip;\nmodule.exports.Inflate = Inflate;\nmodule.exports.inflate = inflate;\nmodule.exports.inflateRaw = inflateRaw;\nmodule.exports.ungzip = ungzip;\nmodule.exports.constants = constants;\n", "// =============================================================================\n// NeoZipkit - Browser ES Module Entry Point\n// =============================================================================\n// This is a clean ES module entry point for browser bundles\n// All exports are named exports for better tree-shaking support\n\n// Buffer polyfill for browser\nimport { Buffer } from 'buffer';\nif (typeof globalThis !== 'undefined') {\n  (globalThis as any).Buffer = Buffer;\n}\n\n// Core exports\nexport * from '../core';\n\n// Browser-specific class\nexport { default as ZipkitBrowser } from './ZipkitBrowser';\n\n// Re-export ZipEntry as named export for convenience\nexport { default as ZipEntry } from '../core/ZipEntry';\n\n// Re-export commonly used types and constants\nexport type { CompressOptions, CreateZipOptions } from '../core/ZipCompress';\nexport type { FileData } from '../types';\nexport * from '../core/constants/Headers';\nexport * from '../core/constants/Errors';\n\n// Platform utilities\nexport const PlatformUtils = {\n  isBrowser: typeof window !== 'undefined' && typeof document !== 'undefined',\n  isNode: typeof process !== 'undefined' && process.versions && process.versions.node,\n};\n", "// ======================================\n//\tErrors.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Error messages\n\nexport default {\n    /* Header error messages */\n    INVALID_LOC: \"Invalid LOC header (bad signature)\",\n    INVALID_CEN: \"Invalid CEN header (bad signature)\",\n    INVALID_END: \"Invalid END header (bad signature)\",\n\n    /* ZipEntry error messages*/\n    NO_DATA: \"Nothing to decompress\",\n    FILE_IN_THE_WAY: \"There is a file in the way: %s\",\n    UNKNOWN_METHOD: \"Invalid/unsupported compression method\",\n\n    /* Encryption Errors */\n    STRONG_ENCRYPT_UNSUPPORTED: \"Strong Encryption is not supported\",\n\n    /* Timestamp error messages */\n    INVALID_TIMESTAMP: \"Invalid timestamp\",\n    TIMESTAMP_FAILED: \"Failed to create the timestamp\",\n\n    /* Inflater error messages */\n    AVAIL_DATA: \"inflate::Available inflate data did not terminate\",\n    INVALID_DISTANCE: \"inflate::Invalid literal/length or distance code in fixed or dynamic block\",\n    TO_MANY_CODES: \"inflate::Dynamic block code description: too many length or distance codes\",\n    INVALID_REPEAT_LEN: \"inflate::Dynamic block code description: repeat more than specified lengths\",\n    INVALID_REPEAT_FIRST: \"inflate::Dynamic block code description: repeat lengths with no first length\",\n    INCOMPLETE_CODES: \"inflate::Dynamic block code description: code lengths codes incomplete\",\n    INVALID_DYN_DISTANCE: \"inflate::Dynamic block code description: invalid distance code lengths\",\n    INVALID_CODES_LEN: \"inflate::Dynamic block code description: invalid literal/length code lengths\",\n    INVALID_STORE_BLOCK: \"inflate::Stored block length did not match one's complement\",\n    INVALID_BLOCK_TYPE: \"inflate::Invalid block type (type == 3)\",\n\n    /* Extract error messages */\n    INVALID_CMP_DATA_LENGTH: \"Compressed data length does not match the expected length\",\n    EXTRACT_FAILED: \"Failed to extract file\",\n    INVALID_CRC: \"CRC32 checksum does not match the expected value\",\n    UNKNOWN_SHA256: \"The SHA-256 hash has not been saved\",\n    INVALID_SHA256: \"The SHA-256 hash does not match the expected value\",\n\n    /* NEO-ZIP error messages */\n    CANT_EXTRACT_FILE: \"Could not extract the file\",\n    CANT_OVERRIDE: \"Target file already exists\",\n    NO_ZIP: \"No zip file was loaded\",\n    NO_ENTRY: \"Entry doesn't exist\",\n    DIRECTORY_CONTENT_ERROR: \"A directory cannot have content\",\n    FILE_NOT_FOUND: \"File not found: %s\",\n    NOT_IMPLEMENTED: \"Not implemented\",\n    INVALID_FILENAME: \"Invalid filename\",\n    INVALID_FORMAT: \"Invalid or unsupported zip format. No END header found\",\n\n    // NeoZipKit error messages\n    NO_STREAM_SUPPORT: \"Streams are not supported in this environment\",\n    NO_BLOB_SUPPORT: \"Blobs are not supported in this environment\",\n    NO_FILE_READER_SUPPORT: \"FileReader is not supported in this environment\",\n\n    // Create Zip error messages\n    NO_FILES: \"No files added, Zip file not created\",\n\n    DATATYPE_STRING_UNSUPPORTED: \"The String type is not supported by this platform.\",\n    DATATYPE_ARRAY_UNSUPPORTED: \"The Array type is not supported by this platform.\",\n    DATATYPE_BUFFER_UNSUPPORTED: \"The Buffer type is not supported by this platform.\",\n    DATATYPE_BLOB_UNSUPPORTED: \"The Blob type is not supported by this platform.\",\n    DATATYPE_U8ARRAY_UNSUPPORTED: \"The uint8Array type is not supported by this platform.\",\n    DATATYPE_ARRAYBUFFER_UNSUPPORTED: \"The ArrayBuffer type is not supported by this platform.\",\n    DATATYPE_UNSUPPORTED: \"Unsupported input type.\",\n\n    COMPRESS_FAILED: 'Failed to compress data',\n    COMPRESSION_ERROR: 'Error occurred during compression',\n    DECOMPRESSION_ERROR: 'Error occurred during decompression',\n\n    ENCRYPT_FAILED: 'Encryption failed',\n};\n\n\n", "/**\n * NeoZip reserved META-INF paths and ASCII case-insensitive discovery.\n * Matches NEOZIP_APPNOTE.md \u00A72.3: writers emit canonical spellings; readers fold case.\n */\n\n/** Canonical writers MUST emit these spellings. */\nexport const META_TOKEN_NZIP = 'META-INF/TOKEN.NZIP';\nexport const META_TOKEN_NZIP_LEGACY = 'META-INF/NZIP.TOKEN';\nexport const META_TS_SUBMIT_NZIP = 'META-INF/TS-SUBMIT.NZIP';\nexport const META_TIMESTAMP_NZIP = 'META-INF/TIMESTAMP.NZIP';\nexport const META_TS_SUBMIT_OTS = 'META-INF/TS-SUBMIT.OTS';\nexport const META_TIMESTAMP_OTS = 'META-INF/TIMESTAMP.OTS';\nexport const META_MANIFEST_JSON = 'META-INF/manifest.json';\n\n/** @deprecated Prefer META_TS_SUBMIT_OTS \u2014 kept for existing imports. */\nexport const TIMESTAMP_SUBMITTED = META_TS_SUBMIT_OTS;\n/** @deprecated Prefer META_TIMESTAMP_OTS \u2014 kept for existing imports. */\nexport const TIMESTAMP_METADATA = META_TIMESTAMP_OTS;\n/** @deprecated Prefer META_TOKEN_NZIP \u2014 kept for existing imports (canonical TOKEN.NZIP). */\nexport const TOKENIZED_METADATA = META_TOKEN_NZIP;\n\nconst RESERVED_CANONICAL = [\n  META_TOKEN_NZIP,\n  META_TOKEN_NZIP_LEGACY,\n  META_TS_SUBMIT_NZIP,\n  META_TIMESTAMP_NZIP,\n  META_TS_SUBMIT_OTS,\n  META_TIMESTAMP_OTS,\n  META_MANIFEST_JSON,\n] as const;\n\nexport type ZipEntryLikeFilename = { filename?: string };\n\n/** ASCII case-insensitive path compare (APPNOTE \u00A72.3). */\nexport function asciiPathEqualsIgnoreCase(a: string, b: string): boolean {\n  if (a.length !== b.length) {\n    // Still allow length mismatch only via toLowerCase for UTF-8 safety on ASCII paths\n  }\n  return a.toLowerCase() === b.toLowerCase();\n}\n\n/** True when path is under META-INF/ (ASCII case-insensitive). */\nexport function isMetaInfPath(filename: string): boolean {\n  return filename.toLowerCase().startsWith('meta-inf/');\n}\n\n/** True when filename is a reserved NeoZip meta path (any casing). */\nexport function isReservedMetaPath(filename: string): boolean {\n  const lower = filename.toLowerCase();\n  return RESERVED_CANONICAL.some((c) => c.toLowerCase() === lower);\n}\n\n/**\n * True for any META-INF/** entry (integrity merkle leaves exclude these per APPNOTE \u00A76.2).\n */\nexport function isMetadataFile(filename: string): boolean {\n  return isMetaInfPath(filename);\n}\n\n/**\n * Find a reserved meta entry among ZIP directory entries.\n * Prefers an exact canonical match, then ASCII case-insensitive match.\n * When multiple preferred names are given, earlier names win.\n */\nexport function findReservedMetaEntry<T extends ZipEntryLikeFilename>(\n  entries: T[],\n  preferredCanonicalNames: string | readonly string[]\n): T | null {\n  const preferred = Array.isArray(preferredCanonicalNames)\n    ? preferredCanonicalNames\n    : [preferredCanonicalNames];\n\n  for (const name of preferred) {\n    const exact = entries.find((e) => e.filename === name);\n    if (exact) return exact;\n  }\n\n  for (const name of preferred) {\n    const folded = entries.find(\n      (e) => typeof e.filename === 'string' && asciiPathEqualsIgnoreCase(e.filename, name)\n    );\n    if (folded) return folded;\n  }\n\n  return null;\n}\n", "// ======================================\n//\tHeaders.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Zip File Format Constants\n\nexport const LOCAL_FILE_HEADER = 'PK\\x03\\x04';\nexport const CENTRAL_FILE_HEADER = 'PK\\x01\\x02';\nexport const CENTRAL_DIRECTORY_END = 'PK\\x05\\x06';\nexport const ZIP64_CENTRAL_DIRECTORY_LOCATOR = 'PK\\x06\\x07';\nexport const ZIP64_CENTRAL_DIRECTORY_END = 'PK\\x06\\x06';\nexport const DATA_DESCRIPTOR = 'PK\\x07\\x08';\n\n// Reserved META-INF paths \u2014 see constants/MetaPaths.ts and NEOZIP_APPNOTE.md \u00A72\nexport {\n  META_TOKEN_NZIP,\n  META_TOKEN_NZIP_LEGACY,\n  META_TS_SUBMIT_NZIP,\n  META_TIMESTAMP_NZIP,\n  META_TS_SUBMIT_OTS,\n  META_TIMESTAMP_OTS,\n  META_MANIFEST_JSON,\n  TIMESTAMP_SUBMITTED,\n  TIMESTAMP_METADATA,\n  TOKENIZED_METADATA,\n} from './MetaPaths';\n\n// Local file header\nexport const LOCAL_HDR = {\n  SIZE:       30,     // LOC header size in bytes\n  SIGNATURE:  0x04034b50,  // \"PK\\003\\004\"\n  VER_EXTRACT: 4,     // version needed to extract\n  FLAGS:       6,     // general purpose bit flag\n  COMPRESSION: 8,     // compression method\n  TIMEDATE_DOS: 10,   // modification time (2 bytes time, 2 bytes date)\n  CRC:        14,     // uncompressed file crc-32 value\n  CMP_SIZE:   18,     // compressed size\n  UNCMP_SIZE: 22,     // uncompressed size\n  FNAME_LEN:  26,     // filename length\n  EXTRA_LEN:  28      // extra field length\n};\nexport const ENCRYPT_HDR_SIZE = 12;\n\n// WinZip AES encryption constants\nexport const AES256_SALT_SIZE = 16;\nexport const AES256_KEY_SIZE = 32;\nexport const AES256_PWD_VERIFY_SIZE = 2;\nexport const AES_AUTH_CODE_SIZE = 10;\nexport const AES_EXTRA_FIELD_SIZE = 11;\nexport const AES_OVERHEAD = AES256_SALT_SIZE + AES256_PWD_VERIFY_SIZE + AES_AUTH_CODE_SIZE; // 28 bytes\n\n// NeoEncrypt extra field (HDR_ID.NEO_CRYPTO): id(2) + TSize(2) + payload; v1 payload = 11 bytes\nexport const NEO_CRYPTO_PAYLOAD_V1 = 11;\nexport const NEO_CRYPTO_EXTRA_FIELD_SIZE = 4 + NEO_CRYPTO_PAYLOAD_V1; // 15 bytes total per record (matches AES-style LOC extra slot)\n/** Magic bytes for NEO payload v1: ASCII `NEZ` + NUL */\nexport const NEO_CRYPTO_MAGIC_BYTES: readonly number[] = [0x4e, 0x45, 0x5a, 0x00];\n\n// Data descriptor\nexport const DATA_DESC = {\n  SIGNATURE:  0x08074b50,  // \"PK\\007\\008\"\n  SIZE:       16,     // EXT header size in bytes\n  CRC:        4,      // uncompressed file crc-32 value (offset)\n  CMP_SIZE:   8,      // compressed size (offset)\n  UNCMP_SIZE: 12      // uncompressed size\n};\n\n// The central directory file header \nexport const CENTRAL_DIR = {\n  SIZE:       46,     // Central directory header size\n  SIGNATURE:  0x02014b50,  // \"PK\\001\\002\"\n  VER_MADE:   4,      // version made by\n  VER_EXT:    6,      // version needed to extract\n  FLAGS:      8,      // encrypt, decrypt flags\n  CMP_METHOD: 10,    // compression method\n  TIMEDATE_DOS: 12,     // DOS modification time (2 bytes time, 2 bytes date)\n  CRC:        16,     // uncompressed file crc-32 value\n  CMP_SIZE:   20,     // compressed size\n  UNCMP_SIZE: 24,     // uncompressed size\n  FNAME_LEN:  28,     // filename length\n  EXTRA_LEN:  30,     // extra field length\n  COMMENT_LEN: 32,    // file comment length\n  DISK_NUM:   34,     // volume number start\n  INT_FILE_ATTR: 36,  // internal file attributes\n  EXT_FILE_ATTR: 38,  // external file attributes (host system dependent)\n  LOCAL_HDR_OFFSET: 42 // LOC header offset\n};\n\n// The Zip central directory Locator\nexport const CENTRAL_END = {\n  SIZE:       22,         // END header size\n  SIGNATURE:  0x06054b50, // \"PK\\005\\006\"\n  VOL_NUM:        4,      // number of this disk\n  VOLDIR_START:   6,      // number of the volume/disk with start of the Central Directory\n  VOL_ENTRIES:    8,      // number of entries on this volume/disk\n  TOTAL_ENTRIES:  10,     // total number of entries on this disk\n  CENTRAL_DIR_SIZE: 12,   // central directory size in bytes\n  CENTRAL_DIR_OFFSET: 16, // offset of first CEN header\n  ZIP_COMMENT_LEN: 20     // zip file comment length\n};\n\n// Zip64 Central Directory Entry\nexport const ZIP64_CENTRAL_DIR = {\n  SIGNATURE:  0x06064b50,  // zip64 signature, \"PK\\006\\006\"\n  SIZE:       56,     // zip64 record minimum size\n  LEAD:       12,     // leading bytes at the start of the record, not counted by the value stored in ZIP64SIZE\n  SIZE_FIELD:  4,     // zip64 size of the central directory record\n  VER_MADEBY: 12,     // zip64 version made by\n  VER_NEEDED: 14,     // zip64 version needed to extract\n  VOL_NUM:    16,     // zip64 number of this disk\n  VOLDIR_START: 20,  // number of the disk with the start of the record directory\n  VOL_ENTRIES:  24,  // number of entries on this disk\n  TOTAL_ENTRIES: 32,  // total number of entries\n  CENTRAL_DIR_SIZE: 40, // zip64 central directory size in bytes\n  CENTRAL_DIR_OFFSET: 48, // offset of start of central directory with respect to the starting disk number\n  EXTRA_FIELD:   56   // extensible data sector\n};\n\n// Zip64 Central directory locator\nexport const ZIP64_CENTRAL_END = {\n  SIZE:       20,         // zip64 END header size\n  SIGNATURE:  0x07064b50, // zip64 Locator signature, \"PK\\006\\007\"\n  VOL_NUM:    4,          // number of the disk with the start of the zip64\n  CENTRAL_DIR_OFFSET: 8,  // relative offset of the zip64 end of central directory\n  TOTAL_DISKS: 16         // total number of disks\n};\n\n// Compression methods\nexport const CMP_METHOD = {\n  STORED:           0,  // no compression\n  SHRUNK:           1,  // shrunk\n  REDUCED1:         2,  // reduced with compression factor 1\n  REDUCED2:         3,  // reduced with compression factor 2\n  REDUCED3:         4,  // reduced with compression factor 3\n  REDUCED4:         5,  // reduced with compression factor 4\n  IMPLODED:         6,  // imploded\n  DEFLATED:         8,  // deflated\n  ENHANCED_DEFLATE: 9,  // enhanced deflated\n  BZIP2:            12, //  compressed using BZIP2\n  LZMA:             14, // LZMA\n  IBM_TERSE:        18, // compressed using IBM TERSE\n  IBM_LZ77:         19, // IBM LZ77\n  ZSTD:             93, // Zstandard compression\n  AES_ENCRYPT:      99  // WinZIP AES encryption method\n};\n\n// General purpose bit flag\nexport const GP_FLAG = {\n  ENCRYPTED:      1,    // Bit 0: encrypted file\n  COMPRESSION1:   2,    // Bit 1, compression option\n  COMPRESSION2:   4,    // Bit 2, compression option\n  DATA_DESC:      8,    // Bit 3, data descriptor \n  ENHANCED_DEFLATE: 16, // Bit 4, enhanced deflating\n  PATCHED:        32,   // Bit 5, indicates that the file is compressed patched data.\n  STRONG_ENCRYPT: 64,   // Bit 6, strong encryption (patented)\n                        // Bits 7-10: Currently unused.\n  EFS:            2048, // Bit 11: Language encoding flag (EFS)\n                        // Bit 12: Reserved by PKWARE for enhanced compression.\n                        // Bit 13: encrypted the Central Directory (patented).\n                        // Bits 14-15: Reserved by PKWARE.\n  MASK:           4096, // mask header values\n};\n\n// 4.5 Extensible data fields\nexport const EXTENSIBLE_DATA_FIELDS = {\n  ID:              0,\n  SIZE:            2,\n};\n\n// Header IDs\nexport const HDR_ID = {\n  ZIP64:           0x0001,    // ZIP64 Extended Information Extra Field\n  AVINFO:          0x0007,    // AV Info\n  PFS:             0x0008,    // PFS Extra Field\n  OS2:             0x0009,    // OS/2 Extra Field\n  NTFS:            0x000a,    // NTFS Extra Field\n  OPENVMS:         0x000c,    // OpenVMS Extra Field\n  UNIX:            0x000d,    // Unix Extra Field\n  FORK:            0x000e,    // Fork Data Extra Field\n  PATCH:           0x000f,    // Patch Descriptor Extra Field\n  x509PKCS7:       0x0014,    // X.509 Certificate Store (PKCS#7)\n  x509CERT_IDF:    0x0015,    // X.509 Certificate ID and Fingerprint\n  x509CERT_IDC:    0x0016,    // X.509 Certificate ID and Certificate\n  STRONG_ENC:      0x0017,    // Strong Encryption Header\n  AES:             0x9901,    // WinZip AES Extra Data Field\n  RECORD_MGT:      0x0018,    // Record Management Controls\n  x509PKCS7RL:     0x0019,    // X.509 Certificate Revocation List (PKCS#7)\n  IBM1:            0x0065,    // IBM S/390 (Z390) - Attribute\n  IBM2:            0x0066,    // IBM S/390 (Z390) - Attribute\n  SHA256:          0x014E,    // NeoZip Extra Field: 32-byte SHA-256 of uncompressed payload (APPNOTE \u00A75)\n  NEO_CRYPTO:      0x024E,    // NeoEncrypt metadata (see docs/NEO_CRYPTO_FORMAT.md); LE on wire: 4E 02\n  POSZIP:          0x4690,    // POSZIP 4690\n  UNV_TIME:        0x5455,    // Universal Time (UT) (32-bit) 5 data bytes\n  UID_GID:         0x7875,    // Unix UID/GID (any size)\n  UNICODE_PATH:    0x7075,    // Info-ZIP Unicode Path Extra Field\n  SYMLINK:         0x7855,    // Unix Symbolic Link Extra Field\n  HARDLINK:        0x7865,    // Unix Hard Link Extra Field\n};\n\n// File System\nexport const FILE_SYSTEM = {\n  MSDOS:           0,   // MS-DOS and OS/2 (FAT / VFAT / FAT32 file systems)\n  AMIGA:           1,   // Amiga\n  OPENVMS:         2,   // OpenVMS\n  UNIX:            3,   // UNIX\n  VM_CMS:          4,   // VM/CMS\n  ATARI:           5,   // Atari ST\n  OS2:             6,   // OS/2 H.P.F.S.\n  MAC:             7,   // Macintosh\n  CP_M:            9,   // CP/M\n  NTFS:            10,  // Windows NTFS\n  MVS:             11,  // MVS (OS/390 - Z/OS)\n  VSE:             12,  // VSE\n  ACORN:           13,  // Acorn Risc\n  VFAT:            14,  // VFAT\n  ALTMVS:          15,  // Alternate MVS\n  BEOS:            16,  // BeOS\n  TANDEM:          17,  // Tandem\n  OS400:           18,  // OS/400\n  DARWIN:          19   // Apple OS/X (Darwin)\n};\n\n// DOS File Attributes\nexport const DOS_FILE_ATTR = {\n  READONLY:        0x01,\n  HIDDEN:          0x02,\n  SYSTEM:          0x04,\n  VOLUME:          0x08,\n  DIRECTORY:       0x10,\n  ARCHIVE:         0x20\n};\n\n", "/**\n * Global Logger Utility for NeoZipKit\n * Provides centralized console control with configurable log levels\n */\n\nexport type LogLevel = 'debug' | 'info' | 'warn' | 'error' | 'silent';\n\nexport interface LoggerConfig {\n  enabled: boolean;\n  level: LogLevel;\n}\n\n/**\n * Global Logger class for controlling console output throughout NeoZipKit\n */\nexport class Logger {\n  private static config: LoggerConfig = {\n    enabled: true,\n    level: 'info'\n  };\n\n  private static originalConsole = {\n    log: console.log,\n    error: console.error,\n    warn: console.warn,\n    debug: console.debug,\n    info: console.info\n  };\n\n  /**\n   * Configure the logger\n   */\n  static configure(config: Partial<LoggerConfig>): void {\n    this.config = { ...this.config, ...config };\n  }\n\n  /**\n   * Get current logger configuration\n   */\n  static getConfig(): LoggerConfig {\n    return { ...this.config };\n  }\n\n  /**\n   * Enable logging\n   */\n  static enable(): void {\n    this.config.enabled = true;\n  }\n\n  /**\n   * Disable all logging\n   */\n  static disable(): void {\n    this.config.enabled = false;\n  }\n\n  /**\n   * Set log level\n   */\n  static setLevel(level: LogLevel): void {\n    this.config.level = level;\n  }\n\n\n  /**\n   * Check if a log level should be output\n   */\n  private static shouldLog(level: LogLevel): boolean {\n    if (!this.config.enabled) return false;\n    \n    const levels: LogLevel[] = ['debug', 'info', 'warn', 'error', 'silent'];\n    const currentLevelIndex = levels.indexOf(this.config.level);\n    const requestedLevelIndex = levels.indexOf(level);\n    \n    return requestedLevelIndex >= currentLevelIndex;\n  }\n\n  /**\n   * Log a message\n   */\n  static log(...args: any[]): void {\n    if (this.shouldLog('info')) {\n      this.originalConsole.log(...args);\n    }\n  }\n\n  /**\n   * Log an error message\n   */\n  static error(...args: any[]): void {\n    if (this.shouldLog('error')) {\n      this.originalConsole.error(...args);\n    }\n  }\n\n  /**\n   * Log a warning message\n   */\n  static warn(...args: any[]): void {\n    if (this.shouldLog('warn')) {\n      this.originalConsole.warn(...args);\n    }\n  }\n\n  /**\n   * Log a debug message\n   */\n  static debug(...args: any[]): void {\n    if (this.shouldLog('debug')) {\n      // Use console.log for debug messages to ensure they're visible\n      this.originalConsole.log(...args);\n    }\n  }\n\n  /**\n   * Log an info message\n   */\n  static info(...args: any[]): void {\n    if (this.shouldLog('info')) {\n      this.originalConsole.info(...args);\n    }\n  }\n\n\n  /**\n   * Override console methods globally (use with caution)\n   */\n  static overrideConsole(): void {\n    console.log = (...args: any[]) => this.log(...args);\n    console.error = (...args: any[]) => this.error(...args);\n    console.warn = (...args: any[]) => this.warn(...args);\n    console.debug = (...args: any[]) => this.debug(...args);\n    console.info = (...args: any[]) => this.info(...args);\n  }\n\n  /**\n   * Restore original console methods\n   */\n  static restoreConsole(): void {\n    console.log = this.originalConsole.log;\n    console.error = this.originalConsole.error;\n    console.warn = this.originalConsole.warn;\n    console.debug = this.originalConsole.debug;\n    console.info = this.originalConsole.info;\n  }\n\n}\n\n/**\n * Environment-based configuration\n */\nexport function configureLoggerFromEnvironment(): void {\n  const env = typeof process !== 'undefined' ? process.env : {};\n  \n  // Check for NEOZIP_DEBUG environment variable\n  if (env.NEOZIP_DEBUG === 'false') {\n    Logger.disable();\n  } else if (env.NEOZIP_DEBUG === 'true') {\n    Logger.enable();\n    Logger.setLevel('debug');\n  }\n\n  // Check for NEOZIP_LOG_LEVEL\n  if (env.NEOZIP_LOG_LEVEL) {\n    const level = env.NEOZIP_LOG_LEVEL as LogLevel;\n    if (['debug', 'info', 'warn', 'error', 'silent'].includes(level)) {\n      Logger.setLevel(level);\n    }\n  }\n\n  // Check for NODE_ENV\n  if (env.NODE_ENV === 'production') {\n    Logger.setLevel('error');\n  }\n}\n\n// Auto-configure from environment on import\n// Only run in Node.js environment\nconfigureLoggerFromEnvironment();\n", "/**\n * Browser-compatible crypto shim\n * Provides Node.js crypto API using Web Crypto API + pure JS (SHA-1, PBKDF2, HMAC, AES-256-ECB).\n * Enables WinZip AES-256 encryption/decryption in the browser bundle. No extra dependencies.\n */\n\n// Use Web Crypto API for browser\nconst webCrypto = typeof crypto !== 'undefined' ? crypto : (typeof window !== 'undefined' && window.crypto ? window.crypto : null);\n\nif (!webCrypto || !webCrypto.subtle) {\n  throw new Error('Web Crypto API is not available in this environment');\n}\n\n// Convert ArrayBuffer to Buffer-like Uint8Array\nfunction arrayBufferToUint8Array(buffer) {\n  return new Uint8Array(buffer);\n}\n\n// Convert Uint8Array/ArrayBuffer to Buffer\nfunction toBuffer(data) {\n  if (data instanceof Uint8Array) {\n    return Buffer.from(data);\n  }\n  if (data instanceof ArrayBuffer) {\n    return Buffer.from(data);\n  }\n  return Buffer.from(data);\n}\n\n// Create hash using Web Crypto API\nasync function createHash(algorithm) {\n  const algoMap = {\n    'sha256': 'SHA-256',\n    'sha1': 'SHA-1',\n    'md5': 'MD5',\n  };\n\n  const webAlgo = algoMap[algorithm.toLowerCase()] || 'SHA-256';\n\n  return {\n    update: function(data) {\n      this._data = this._data ? Buffer.concat([this._data, toBuffer(data)]) : toBuffer(data);\n      return this;\n    },\n    digest: async function(encoding) {\n      const data = this._data || Buffer.alloc(0);\n      const hashBuffer = await webCrypto.subtle.digest(webAlgo, data);\n      const hashArray = arrayBufferToUint8Array(hashBuffer);\n      \n      if (encoding === 'hex') {\n        return Array.from(hashArray)\n          .map(b => b.toString(16).padStart(2, '0'))\n          .join('');\n      }\n      if (encoding === 'base64') {\n        return Buffer.from(hashArray).toString('base64');\n      }\n      return Buffer.from(hashArray);\n    }\n  };\n}\n\n// Generate random bytes using Web Crypto API\nfunction randomBytes(size) {\n  const array = new Uint8Array(size);\n  webCrypto.getRandomValues(array);\n  return Buffer.from(array);\n}\n\n// --- AES-256 support (WinZip AE-1/AE-2) via pure JS in browser (no deps) ---\n\n// Minimal SHA-1 (returns 20-byte hash), standard FIPS-180-4\nfunction sha1Raw(data) {\n  const buf = Buffer.isBuffer(data) ? Buffer.from(data) : Buffer.from(data);\n  const len = buf.length;\n  const bitLen = len * 8;\n  const padLen = 64 - ((len + 9) % 64);\n  const totalLen = len + 1 + (padLen < 0 ? padLen + 64 : padLen) + 8;\n  const padded = Buffer.alloc(totalLen);\n  buf.copy(padded, 0);\n  padded[len] = 0x80;\n  padded.writeUInt32BE((bitLen / 0x100000000) >>> 0, totalLen - 8);\n  padded.writeUInt32BE(bitLen >>> 0, totalLen - 4);\n\n  const h = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0];\n  const k = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];\n  const w = new Array(80);\n\n  for (let off = 0; off < totalLen; off += 64) {\n    for (let i = 0; i < 16; i++) {\n      w[i] = padded.readUInt32BE(off + i * 4);\n    }\n    for (let i = 16; i < 80; i++) {\n      w[i] = ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) << 1) | ((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]) >>> 31);\n    }\n    let [a, b, c, d, e] = h;\n    for (let i = 0; i < 80; i++) {\n      let f, t;\n      if (i < 20) {\n        f = (b & c) | ((~b) & d);\n        t = k[0];\n      } else if (i < 40) {\n        f = b ^ c ^ d;\n        t = k[1];\n      } else if (i < 60) {\n        f = (b & c) | (b & d) | (c & d);\n        t = k[2];\n      } else {\n        f = b ^ c ^ d;\n        t = k[3];\n      }\n      t = (((a << 5) | (a >>> 27)) + f + e + t + (w[i] >>> 0)) >>> 0;\n      e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;\n    }\n    h[0] = (h[0] + a) >>> 0; h[1] = (h[1] + b) >>> 0; h[2] = (h[2] + c) >>> 0; h[3] = (h[3] + d) >>> 0; h[4] = (h[4] + e) >>> 0;\n  }\n\n  const out = Buffer.alloc(20);\n  for (let i = 0; i < 5; i++) {\n    out.writeUInt32BE(h[i], i * 4);\n  }\n  return out;\n}\n\nfunction hmacSha1(key, data) {\n  const blockLen = 64;\n  let K = Buffer.isBuffer(key) ? Buffer.from(key) : Buffer.from(key);\n  if (K.length > blockLen) {\n    K = sha1Raw(K);\n  }\n  if (K.length < blockLen) {\n    K = Buffer.concat([K, Buffer.alloc(blockLen - K.length)]);\n  }\n  const ipad = Buffer.alloc(blockLen, 0x36);\n  const opad = Buffer.alloc(blockLen, 0x5c);\n  for (let i = 0; i < blockLen; i++) {\n    ipad[i] ^= K[i];\n    opad[i] ^= K[i];\n  }\n  const inner = sha1Raw(Buffer.concat([ipad, Buffer.isBuffer(data) ? data : Buffer.from(data)]));\n  return sha1Raw(Buffer.concat([opad, inner]));\n}\n\nfunction pbkdf2Sync(key, salt, iterations, keylen, digest) {\n  if (digest && digest.toLowerCase() !== 'sha1') {\n    throw new Error('Browser shim only supports PBKDF2 with sha1');\n  }\n  const hlen = 20;\n  const blocks = Math.ceil(keylen / hlen);\n  const result = [];\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  const saltBuf = Buffer.isBuffer(salt) ? salt : Buffer.from(salt);\n  for (let i = 1; i <= blocks; i++) {\n    const iBuf = Buffer.from([(i >>> 24) & 0xff, (i >>> 16) & 0xff, (i >>> 8) & 0xff, i & 0xff]);\n    let u = hmacSha1(keyBuf, Buffer.concat([saltBuf, iBuf]));\n    const block = Buffer.from(u);\n    for (let j = 1; j < iterations; j++) {\n      u = hmacSha1(keyBuf, u);\n      for (let k = 0; k < hlen; k++) block[k] ^= u[k];\n    }\n    result.push(block);\n  }\n  return Buffer.concat(result).subarray(0, keylen);\n}\n\nfunction createHmac(algorithm, key) {\n  if (algorithm !== 'sha1') {\n    throw new Error('Browser shim createHmac only supports sha1');\n  }\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  let data = Buffer.alloc(0);\n  return {\n    update(chunk) {\n      data = Buffer.concat([data, Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk)]);\n      return this;\n    },\n    digest() {\n      const out = hmacSha1(keyBuf, data);\n      data = Buffer.alloc(0);\n      return out;\n    },\n  };\n}\n\n// Minimal AES-256-ECB (encrypt one 16-byte block). FIPS-197.\nconst AES_SBOX = new Uint8Array([0x63,0x7c,0x77,0x7b,0xf2,0x6b,0x6f,0xc5,0x30,0x01,0x67,0x2b,0xfe,0xd7,0xab,0x76,0xca,0x82,0xc9,0x7d,0xfa,0x59,0x47,0xf0,0xad,0xd4,0xa2,0xaf,0x9c,0xa4,0x72,0xc0,0xb7,0xfd,0x93,0x26,0x36,0x3f,0xf7,0xcc,0x34,0xa5,0xe5,0xf1,0x71,0xd8,0x31,0x15,0x04,0xc7,0x23,0xc3,0x18,0x96,0x05,0x9a,0x07,0x12,0x80,0xe2,0xeb,0x27,0xb2,0x75,0x09,0x83,0x2c,0x1a,0x1b,0x6e,0x5a,0xa0,0x52,0x3b,0xd6,0xb3,0x29,0xe3,0x2f,0x84,0x53,0xd1,0x00,0xed,0x20,0xfc,0xb1,0x5b,0x6a,0xcb,0xbe,0x39,0x4a,0x4c,0x58,0xcf,0xd0,0xef,0xaa,0xfb,0x43,0x4d,0x33,0x85,0x45,0xf9,0x02,0x7f,0x50,0x3c,0x9f,0xa8,0x51,0xa3,0x40,0x8f,0x92,0x9d,0x38,0xf5,0xbc,0xb6,0xda,0x21,0x10,0xff,0xf3,0xd2,0xcd,0x0c,0x13,0xec,0x5f,0x97,0x44,0x17,0xc4,0xa7,0x7e,0x3d,0x64,0x5d,0x19,0x73,0x60,0x81,0x4f,0xdc,0x22,0x2a,0x90,0x88,0x46,0xee,0xb8,0x14,0xde,0x5e,0x0b,0xdb,0xe0,0x32,0x3a,0x0a,0x49,0x06,0x24,0x5c,0xc2,0xd3,0xac,0x62,0x91,0x95,0xe4,0x79,0xe7,0xc8,0x37,0x6d,0x8d,0xd5,0x4e,0xa9,0x6c,0x56,0xf4,0xea,0x65,0x7a,0xae,0x08,0xba,0x78,0x25,0x2e,0x1c,0xa6,0xb4,0xc6,0xe8,0xdd,0x74,0x1f,0x4b,0xbd,0x8b,0x8a,0x70,0x3e,0xb5,0x66,0x48,0x03,0xf6,0x0e,0x61,0x35,0x57,0xb9,0x86,0xc1,0x1d,0x9e,0xe1,0xf8,0x98,0x11,0x69,0xd9,0x8e,0x94,0x9b,0x1e,0x87,0xe9,0xce,0x55,0x28,0xdf,0x8c,0xa1,0x89,0x0d,0xbf,0xe6,0x42,0x68,0x41,0x99,0x2d,0x0f,0xb0,0x54,0xbb,0x16]);\nconst AES_RCON = new Uint8Array([0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1b,0x36]);\nfunction aes256KeyExpansion(key) {\n  const w = new Uint8Array(240);\n  for (let i = 0; i < 32; i++) w[i] = key[i];\n  for (let i = 8; i < 60; i++) {\n    const t = i * 4;\n    const prev = (i - 8) * 4;\n    const p = (i - 1) * 4;\n    if (i % 8 === 0) {\n      const t0 = AES_SBOX[w[p + 1]] ^ AES_RCON[(i / 8) - 1];\n      w[t] = w[prev] ^ t0; w[t+1] = w[prev+1] ^ AES_SBOX[w[p+2]]; w[t+2] = w[prev+2] ^ AES_SBOX[w[p+3]]; w[t+3] = w[prev+3] ^ AES_SBOX[w[p]];\n    } else if (i % 8 === 4) {\n      w[t] = w[prev] ^ AES_SBOX[w[p]]; w[t+1] = w[prev+1] ^ AES_SBOX[w[p+1]]; w[t+2] = w[prev+2] ^ AES_SBOX[w[p+2]]; w[t+3] = w[prev+3] ^ AES_SBOX[w[p+3]];\n    } else {\n      w[t] = w[prev] ^ w[p]; w[t+1] = w[prev+1] ^ w[p+1]; w[t+2] = w[prev+2] ^ w[p+2]; w[t+3] = w[prev+3] ^ w[p+3];\n    }\n  }\n  return w;\n}\nfunction xtime(x) {\n  return (((x << 1) & 0xff) ^ (((x >>> 7) & 1) * 0x1b));\n}\nfunction aes256EcbEncryptBlock(keySchedule, block) {\n  const s = new Uint8Array(16);\n  for (let i = 0; i < 16; i++) s[i] = block[i] ^ keySchedule[i];\n  for (let r = 1; r < 14; r++) {\n    for (let i = 0; i < 16; i++) s[i] = AES_SBOX[s[i]];\n    const t = s[1]; s[1]=s[5]; s[5]=s[9]; s[9]=s[13]; s[13]=t;\n    const t2=s[2]; s[2]=s[10]; s[10]=t2; const t3=s[6]; s[6]=s[14]; s[14]=t3;\n    const t4=s[3]; s[3]=s[15]; s[15]=s[11]; s[11]=s[7]; s[7]=t4;\n    for (let c = 0; c < 4; c++) {\n      const a = s[c*4]; const b = s[c*4+1]; const c2 = s[c*4+2]; const d = s[c*4+3];\n      s[c*4]   = xtime(a) ^ xtime(b) ^ b ^ c2 ^ d;\n      s[c*4+1] = a ^ xtime(b) ^ xtime(c2) ^ c2 ^ d;\n      s[c*4+2] = a ^ b ^ xtime(c2) ^ xtime(d) ^ d;\n      s[c*4+3] = xtime(a) ^ a ^ b ^ c2 ^ xtime(d);\n    }\n    const ro = r * 16;\n    for (let i = 0; i < 16; i++) s[i] ^= keySchedule[ro + i];\n  }\n  for (let i = 0; i < 16; i++) s[i] = AES_SBOX[s[i]];\n  const t = s[1]; s[1]=s[5]; s[5]=s[9]; s[9]=s[13]; s[13]=t;\n  const t2=s[2]; s[2]=s[10]; s[10]=t2; const t3=s[6]; s[6]=s[14]; s[14]=t3;\n  const t4=s[3]; s[3]=s[15]; s[15]=s[11]; s[11]=s[7]; s[7]=t4;\n  for (let i = 0; i < 16; i++) s[i] ^= keySchedule[224 + i];\n  return s;\n}\n\nfunction createCipheriv(algorithm, key, iv) {\n  if (algorithm !== 'aes-256-ecb' || (iv !== null && iv !== undefined)) {\n    throw new Error('Browser shim createCipheriv only supports aes-256-ecb with null iv');\n  }\n  const keyBuf = Buffer.isBuffer(key) ? key : Buffer.from(key);\n  if (keyBuf.length !== 32) throw new Error('aes-256-ecb requires 32-byte key');\n  const keySchedule = aes256KeyExpansion(keyBuf);\n  return {\n    setAutoPadding() {\n      return this;\n    },\n    update(block) {\n      const b = Buffer.isBuffer(block) ? block : Buffer.from(block);\n      if (b.length !== 16) {\n        throw new Error('Browser shim AES-ECB only supports 16-byte blocks');\n      }\n      const out = aes256EcbEncryptBlock(keySchedule, b);\n      return Buffer.from(out);\n    },\n    final() {\n      return Buffer.alloc(0);\n    },\n  };\n}\n\n// Export crypto-like object (ES module format)\nexport {\n  createHash,\n  randomBytes,\n  pbkdf2Sync,\n  createHmac,\n  createCipheriv,\n};\n\n// Also export as default for compatibility\nexport default {\n  createHash,\n  randomBytes,\n  pbkdf2Sync,\n  createHmac,\n  createCipheriv,\n};\n", "/**\n * Traditional ZIP Crypto encryption implementation\n * Compatible with standard ZIP 2.0 encryption (ZipCrypto)\n */\n\nimport { EncryptionProvider, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionMethod } from './types';\nimport ZipEntry from '../ZipEntry';\nimport { Logger } from '../components/Logger';\nimport { GP_FLAG, ENCRYPT_HDR_SIZE } from '../constants/Headers';\nimport { randomBytes } from 'crypto';\n\nexport class ZipCrypto implements EncryptionProvider {\n  private static readonly KEY_LENGTH = 3; // 24 bits for traditional ZIP crypto\n\n  canHandle(method: EncryptionMethod): boolean {\n    return method === EncryptionMethod.ZIP_CRYPTO;\n  }\n\n  getMethodName(): string {\n    return 'ZIP-Crypto';\n  }\n\n  getKeyLength(): number {\n    return ZipCrypto.KEY_LENGTH;\n  }\n\n  async encrypt(data: Buffer, options: EncryptionOptions): Promise<EncryptionResult> {\n    try {\n      if (options.method !== EncryptionMethod.ZIP_CRYPTO) {\n        return {\n          success: false,\n          error: 'ZIP-Crypto encryption method required'\n        };\n      }\n\n      // Initialize keys from password\n      const keys = this.initKeys(options.password);\n      \n      // Encrypt data using traditional ZIP crypto\n      const encryptedData = Buffer.alloc(data.length);\n      \n      for (let i = 0; i < data.length; i++) {\n        const byte = data[i];\n        const encryptedByte = this.encryptByte(keys, byte);\n        encryptedData[i] = encryptedByte;\n        this.updateKeys(keys, byte);\n      }\n\n      return {\n        success: true,\n        encryptedData: encryptedData\n      };\n    } catch (error) {\n      return {\n        success: false,\n        error: error instanceof Error ? error.message : 'Unknown encryption error'\n      };\n    }\n  }\n\n  async decrypt(data: Buffer, options: EncryptionOptions): Promise<DecryptionResult> {\n    try {\n      if (options.method !== EncryptionMethod.ZIP_CRYPTO) {\n        return {\n          success: false,\n          error: 'ZIP-Crypto decryption method required'\n        };\n      }\n\n      // Initialize keys from password\n      const keys = this.initKeys(options.password);\n      \n      // Decrypt data using traditional ZIP crypto\n      const decryptedData = Buffer.alloc(data.length);\n      \n      for (let i = 0; i < data.length; i++) {\n        const encryptedByte = data[i];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        decryptedData[i] = decryptedByte;\n        this.updateKeys(keys, decryptedByte);\n      }\n\n      return {\n        success: true,\n        decryptedData: decryptedData\n      };\n    } catch (error) {\n      return {\n        success: false,\n        error: error instanceof Error ? error.message : 'Unknown decryption error'\n      };\n    }\n  }\n\n  /**\n   * Verify password using check byte from decrypted header\n   * @param decryptedHeader - 12-byte decrypted encryption header\n   * @param checkByte - Expected check byte value\n   * @throws Error if password verification fails\n   */\n  verifyPassword(decryptedHeader: Buffer, checkByte: number): void {\n    if (decryptedHeader.length < 12) {\n      throw new Error('Decrypted header must be at least 12 bytes');\n    }\n    \n    // Verify check byte (11th byte, 0-indexed)\n    if (decryptedHeader[11] !== checkByte) {\n      throw new Error('Password verification FAILED');\n    }\n  }\n\n  /**\n   * Parse local header to extract information needed for decryption\n   * @param localHeaderBuffer - 30-byte local header buffer\n   * @param entry - ZIP entry to update with extracted information\n   * @returns Object with bitFlags, lastModTimeDate, localCrc, and checkByte\n   */\n  parseLocalHeaderForDecryption(localHeaderBuffer: Buffer, entry: ZipEntry): {\n    bitFlags: number;\n    lastModTimeDate: number;\n    localCrc: number;\n    checkByte: number;\n  } {\n    // Verify signature\n    if (localHeaderBuffer.readUInt32LE(0) !== 0x04034b50) {\n      throw new Error('Invalid local header signature');\n    }\n\n    // Read bit flags, lastModTimeDate, and CRC from local header\n    const bitFlags = localHeaderBuffer.readUInt16LE(6);\n    const lastModTimeDate = localHeaderBuffer.readUInt32LE(10);\n    const localCrc = localHeaderBuffer.readUInt32LE(14);\n\n    // Store lastModTimeDate in entry if DATA_DESC flag is set\n    if ((bitFlags & GP_FLAG.DATA_DESC) && (!(entry as any).lastModTimeDate || (entry as any).lastModTimeDate === 0)) {\n      (entry as any).lastModTimeDate = lastModTimeDate;\n    }\n\n    // Store local CRC for check byte calculation\n    (entry as any).localCrc = localCrc;\n\n    // Calculate check byte\n    let checkByte: number;\n    if (bitFlags & GP_FLAG.DATA_DESC) {\n      const timeDate = (entry as any).lastModTimeDate || entry.timeDateDOS || 0;\n      checkByte = (timeDate >> 8) & 0xff;\n    } else {\n      const crc = localCrc && localCrc !== 0 ? localCrc : entry.crc;\n      checkByte = (crc >> 24) & 0xff;\n    }\n\n    return { bitFlags, lastModTimeDate, localCrc, checkByte };\n  }\n\n  /**\n   * Create encryption header (12 bytes) for PKZIP encryption\n   * Generates 11 random bytes + 1 check byte\n   * @param entry - ZIP entry to create header for\n   * @param password - Password for encryption (used to calculate check byte)\n   * @returns 12-byte encryption header buffer\n   */\n  createEncryptionHeader(entry: ZipEntry, password: string): Buffer {\n    const header = Buffer.alloc(ENCRYPT_HDR_SIZE);\n    \n    // Generate 11 random bytes (bytes 0-10)\n    const random = randomBytes(11);\n    random.copy(header, 0);\n    \n    // Calculate check byte (byte 11)\n    // For DATA_DESC files: use lastModTimeDate >> 8\n    // For regular files: use CRC >> 24\n    let checkByte: number;\n    if ((entry.bitFlags & GP_FLAG.DATA_DESC) !== 0) {\n      const timeDate = entry.lastModTimeDate || entry.timeDateDOS || 0;\n      checkByte = (timeDate >> 8) & 0xff;\n    } else {\n      // Use CRC from entry (should be calculated before encryption)\n      checkByte = (entry.crc >> 24) & 0xff;\n    }\n    \n    // Set check byte (11th byte, 0-indexed)\n    header[11] = checkByte;\n    \n    Logger.debug(`[ZipCrypto] Created encryption header: checkByte=0x${checkByte.toString(16).padStart(2, '0')}, DATA_DESC=${(entry.bitFlags & GP_FLAG.DATA_DESC) !== 0}`);\n    \n    return header;\n  }\n\n  /**\n   * Encrypt buffer (header + compressed data) for PKZIP encryption\n   * Creates encryption header, concatenates with compressed data, and encrypts everything\n   * @param entry - ZIP entry to encrypt\n   * @param compressedData - Compressed data to encrypt\n   * @param password - Password for encryption\n   * @returns Encrypted buffer (encrypted header + encrypted compressed data)\n   */\n  encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    // Create 12-byte encryption header\n    const header = this.createEncryptionHeader(entry, password);\n    \n    // Concatenate header + compressed data\n    const dataToEncrypt = Buffer.concat([header, compressedData]);\n    \n    // Initialize encryption keys from password\n    const keys = this.initKeys(password);\n    \n    // Encrypt the entire buffer (header + compressed data) maintaining key state\n    // This ensures keys are updated correctly throughout encryption\n    const encryptedData = Buffer.alloc(dataToEncrypt.length);\n    \n    for (let i = 0; i < dataToEncrypt.length; i++) {\n      const byte = dataToEncrypt[i];\n      const encryptedByte = this.encryptByte(keys, byte);\n      encryptedData[i] = encryptedByte;\n      // Update keys after each byte - state must be maintained across the entire buffer\n      this.updateKeys(keys, byte);\n    }\n    \n    Logger.debug(`[ZipCrypto] Encrypted buffer: ${compressedData.length} bytes compressed data + ${ENCRYPT_HDR_SIZE} bytes header = ${encryptedData.length} bytes total`);\n    \n    return encryptedData;\n  }\n\n  /**\n   * Decrypt buffer-based encrypted data (for in-memory extraction)\n   * Handles local header parsing, encryption header extraction, and decryption\n   * @param entry - ZIP entry with encryption information\n   * @param buffer - Full ZIP file buffer\n   * @param encryptedData - Encrypted data without header (from parseLocalHeader)\n   * @param password - Password for decryption\n   * @returns Decrypted compressed data (without header)\n   */\n  decryptBuffer(entry: ZipEntry, buffer: Buffer, encryptedData: Buffer, password: string): Buffer {\n    // Read local header to get lastModTimeDate for DATA_DESC files (needed for check byte)\n    const localData = buffer.subarray(entry.localHdrOffset);\n    const localHeaderBuffer = localData.subarray(0, 30);\n\n    // Parse local header to extract decryption info\n    const { bitFlags, localCrc, checkByte } = this.parseLocalHeaderForDecryption(localHeaderBuffer, entry);\n\n    // Extract the 12-byte encryption header\n    // parseLocalHeader returns data WITHOUT the 12-byte encryption header\n    // We need to prepend the header before decrypting so keys are updated correctly\n    const fnameLen = localHeaderBuffer.readUInt16LE(26);\n    const extraLen = localHeaderBuffer.readUInt16LE(28);\n    const localSize = 30 + fnameLen + extraLen;\n    const ENCRYPT_HDR_SIZE = 12;\n    const encryptHeader = localData.subarray(localSize, localSize + ENCRYPT_HDR_SIZE);\n\n    // Prepend the header to the encrypted data\n    const encryptedDataWithHeader = Buffer.concat([encryptHeader, encryptedData]);\n\n    // Decrypt the full data (header + compressed data) in one pass\n    // This ensures keys are updated correctly throughout the decryption\n    // MEMORY EFFICIENCY: Decrypt in-place into encryptedDataWithHeader (no new allocation)\n    const keys = this.initKeys(password);\n\n    for (let i = 0; i < encryptedDataWithHeader.length; i++) {\n      const encryptedByte = encryptedDataWithHeader[i];\n      const decryptedByte = this.decryptByte(keys, encryptedByte);\n      encryptedDataWithHeader[i] = decryptedByte;\n      this.updateKeys(keys, decryptedByte);\n    }\n\n    // Extract the decrypted header (first 12 bytes) for password verification\n    // encryptedDataWithHeader now contains decrypted data\n    const decryptedHeader = encryptedDataWithHeader.subarray(0, ENCRYPT_HDR_SIZE);\n\n    // Verify password using check byte\n    this.verifyPassword(decryptedHeader, checkByte);\n\n    // Skip the decrypted header (first 12 bytes) and return only the decrypted compressed data\n    return encryptedDataWithHeader.subarray(ENCRYPT_HDR_SIZE);\n  }\n\n  /**\n   * Create a streaming decryptor for chunked data processing\n   * Handles 12-byte header decryption and verification, then yields decrypted chunks\n   * \n   * MEMORY EFFICIENCY: This method processes encrypted data one block at a time.\n   * - Decryption state (keys) is maintained across blocks via updateKeys()\n   * - Only the minimum 12-byte header is accumulated before password verification\n   * - Each decrypted block is yielded immediately without accumulation\n   * \n   * @param password - Password for decryption\n   * @param checkByte - Expected check byte value for password verification\n   * @param encryptedStream - Async generator of encrypted data chunks (one block at a time)\n   * @returns Async generator of decrypted data chunks (one block at a time)\n   */\n  async *createStreamDecryptor(\n    password: string,\n    checkByte: number,\n    encryptedStream: AsyncGenerator<Buffer>\n  ): AsyncGenerator<Buffer> {\n    // Initialize keys from password - state maintained across all blocks\n    const keys = this.initKeys(password);\n    \n    // Process 12-byte encryption header incrementally (minimum accumulation)\n    const ENCRYPT_HDR_SIZE = 12;\n    const headerBuffer = Buffer.alloc(ENCRYPT_HDR_SIZE);\n    let headerBytesCollected = 0;\n    let currentChunk: Buffer | null = null;\n    let currentChunkOffset = 0;\n    \n    // Read chunks incrementally until we have exactly 12 bytes for header\n    // This minimizes memory usage by only accumulating the necessary header bytes\n    while (headerBytesCollected < ENCRYPT_HDR_SIZE) {\n      // Get next chunk if current chunk is exhausted\n      if (!currentChunk || currentChunkOffset >= currentChunk.length) {\n        const result = await encryptedStream.next();\n        \n        if (result.done || !result.value) {\n          throw new Error('ZIP-Crypto: insufficient encrypted data (missing encryption header)');\n        }\n        \n        currentChunk = result.value;\n        currentChunkOffset = 0;\n      }\n      \n      // Copy bytes from current chunk to header buffer\n      const bytesNeeded = ENCRYPT_HDR_SIZE - headerBytesCollected;\n      const bytesToCopy = Math.min(bytesNeeded, currentChunk.length - currentChunkOffset);\n      \n      currentChunk.copy(headerBuffer, headerBytesCollected, currentChunkOffset, currentChunkOffset + bytesToCopy);\n      headerBytesCollected += bytesToCopy;\n      currentChunkOffset += bytesToCopy;\n    }\n    \n    // Decrypt the 12-byte encryption header byte-by-byte\n    // This maintains proper key state for subsequent decryption\n    // MEMORY EFFICIENCY: Decrypt in-place into headerBuffer (no new allocation)\n    for (let i = 0; i < ENCRYPT_HDR_SIZE; i++) {\n      const encryptedByte = headerBuffer[i];\n      const decryptedByte = this.decryptByte(keys, encryptedByte) & 0xff;\n      headerBuffer[i] = decryptedByte;\n      // Update keys after each byte - state must be maintained across blocks\n      this.updateKeys(keys, decryptedByte);\n    }\n    \n    // Verify password using check byte (11th byte of decrypted header)\n    // headerBuffer now contains decrypted header data\n    this.verifyPassword(headerBuffer, checkByte);\n    \n    // Process remaining data from the first chunk (after header) if any\n    // This ensures we decrypt and yield data immediately without accumulating\n    // MEMORY EFFICIENCY: Decrypt in-place into currentChunk buffer (no new allocation)\n    if (currentChunk && currentChunkOffset < currentChunk.length) {\n      const remainingInChunk = currentChunk.length - currentChunkOffset;\n      \n      for (let i = 0; i < remainingInChunk; i++) {\n        const pos = currentChunkOffset + i;\n        const encryptedByte = currentChunk[pos];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        currentChunk[pos] = decryptedByte;\n        // Maintain state across bytes - keys updated for next block\n        this.updateKeys(keys, decryptedByte);\n      }\n      \n      // Yield subarray of currentChunk (already decrypted in-place)\n      yield currentChunk.subarray(currentChunkOffset);\n    }\n    \n    // Process remaining chunks one at a time - decrypt and yield immediately\n    // Decryption state (keys) continues across blocks via updateKeys()\n    // MEMORY EFFICIENCY: Decrypt in-place into encryptedChunk buffer (no new allocation)\n    for await (const encryptedChunk of encryptedStream) {\n      \n      // Decrypt each byte in-place, maintaining state across bytes\n      for (let i = 0; i < encryptedChunk.length; i++) {\n        const encryptedByte = encryptedChunk[i];\n        const decryptedByte = this.decryptByte(keys, encryptedByte);\n        encryptedChunk[i] = decryptedByte;\n        // Update keys after each byte - ensures state continues correctly across blocks\n        this.updateKeys(keys, decryptedByte);\n      }\n      \n      // Yield the same buffer (now containing decrypted data) - no accumulation\n      yield encryptedChunk;\n    }\n  }\n\n  /**\n   * Initialize encryption keys from password\n   */\n  private initKeys(password: string): number[] {\n    const keys = [0x12345678, 0x23456789, 0x34567890];\n    \n    for (let i = 0; i < password.length; i++) {\n      this.updateKeys(keys, password.charCodeAt(i));\n    }\n    \n    return keys;\n  }\n\n  /**\n   * Update encryption keys with a byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private updateKeys(keys: number[], byte: number): void {\n    keys[0] = ((keys[0] >>> 8) ^ ZipCrypto.CRC_TABLE[(keys[0] ^ byte) & 0xff]) >>> 0;\n    // Use Math.imul for multiplication (matches zip.js) and 0x08088405 constant\n    keys[1] = ((Math.imul(keys[1] + (keys[0] & 0xff), 0x08088405) + 1) & 0xFFFFFFFF) >>> 0;\n    keys[2] = ((keys[2] >>> 8) ^ ZipCrypto.CRC_TABLE[(keys[2] ^ (keys[1] >>> 24)) & 0xff]) >>> 0;\n  }\n\n  /**\n   * Encrypt a single byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private encryptByte(keys: number[], byte: number): number {\n    const temp = keys[2] | 2;\n    // Use Math.imul like zip.js and mask with 0xFF\n    return (byte ^ (Math.imul(temp, (temp ^ 1)) >>> 8)) & 0xFF;\n  }\n\n  /**\n   * Decrypt a single byte\n   * Based on zip.js implementation - uses Math.imul for 32-bit integer multiplication\n   */\n  private decryptByte(keys: number[], encryptedByte: number): number {\n    const temp = keys[2] | 2;\n    // Use Math.imul like zip.js and mask with 0xFF\n    return (encryptedByte ^ (Math.imul(temp, (temp ^ 1)) >>> 8)) & 0xFF;\n  }\n\n  /**\n   * CRC32 lookup table (shared for all CRC32 operations)\n   */\n  static readonly CRC_TABLE = [\n    0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,\n    0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,\n    0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,\n    0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,\n    0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,\n    0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,\n    0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,\n    0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,\n    0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,\n    0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n    0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,\n    0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,\n    0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,\n    0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,\n    0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,\n    0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,\n    0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,\n    0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,\n    0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,\n    0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n    0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,\n    0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,\n    0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,\n    0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,\n    0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,\n    0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,\n    0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,\n    0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,\n    0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,\n    0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n    0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,\n    0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,\n    0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,\n    0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,\n    0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,\n    0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,\n    0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,\n    0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,\n    0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,\n    0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n    0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,\n    0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,\n    0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d\n  ];\n\n  /**\n   * CRC32 implementation for ZIP crypto (single byte update)\n   * Used internally for key updates during encryption/decryption\n   */\n  private crc32(crc: number, byte: number): number {\n    return ((crc >>> 8) ^ ZipCrypto.CRC_TABLE[(crc ^ byte) & 0xff]) >>> 0;\n  }\n\n  /**\n   * Static CRC32 calculation for a full buffer\n   * Delegates to exported crc32() function\n   * @param buf - Buffer or string to calculate CRC32 for\n   * @returns CRC32 checksum as unsigned 32-bit integer\n   */\n  static crc32(buf: Buffer | string): number {\n    return crc32Impl(buf);\n  }\n\n  /**\n   * Static CRC32 incremental update (single byte)\n   * Delegates to exported crc32update() function\n   * @param crc - Current CRC32 value\n   * @param byte - Byte to update with\n   * @returns Updated CRC32 value\n   */\n  static crc32update(crc: number, byte: number): number {\n    return crc32updateImpl(crc, byte);\n  }\n}\n\n/**\n * CRC32 calculation for a full buffer\n * Main public API for CRC32 calculation\n * @param buf - Buffer or string to calculate CRC32 for\n * @returns CRC32 checksum as unsigned 32-bit integer\n */\nfunction crc32Impl(buf: Buffer | string): number {\n  if (typeof buf === \"string\") {\n    buf = Buffer.from(buf, \"utf8\");\n  }\n  \n  let len = buf.length;\n  let crc = ~0;\n  for (let off = 0; off < len; ) {\n    crc = ZipCrypto.CRC_TABLE[(crc ^ buf[off++]) & 0xff] ^ (crc >>> 8);\n  }\n  \n  // Finalize: xor with ~0 and cast as uint32\n  return ~crc >>> 0;\n}\n\n/**\n * CRC32 incremental update (single byte)\n * Used for streaming CRC32 calculation\n * @param crc - Current CRC32 value\n * @param byte - Byte to update with\n * @returns Updated CRC32 value\n */\nfunction crc32updateImpl(crc: number, byte: number): number {\n  return ZipCrypto.CRC_TABLE[(crc ^ byte) & 0xff] ^ (crc >>> 8);\n}\n\n/**\n * CRC32 calculation for a full buffer\n * Main public API for CRC32 calculation\n * @param buf - Buffer or string to calculate CRC32 for\n * @returns CRC32 checksum as unsigned 32-bit integer\n */\nexport function crc32(buf: Buffer | string): number {\n  return crc32Impl(buf);\n}\n\n/**\n * CRC32 incremental update (single byte)\n * Used for streaming CRC32 calculation\n * @param crc - Current CRC32 value\n * @param byte - Byte to update with\n * @returns Updated CRC32 value\n */\nexport function crc32update(crc: number, byte: number): number {\n  return crc32updateImpl(crc, byte);\n}\n\n// Cryptographic utility functions\nimport { createHash } from 'crypto';\n\n// Return the SHA256 hash of a buffer\nexport function sha256(data: Buffer): string {\n  const hash = createHash('sha256');\n  return hash\n    .update(data)\n    .digest('hex');\n}\n\n/**\n * Options for creating a DecryptionStream\n */\nexport interface DecryptionStreamOptions {\n  password: string;\n  method: EncryptionMethod;\n  entry: ZipEntry;\n}\n\n/**\n * Streaming decryption for chunked compressed data processing\n * Encapsulated within ZipCrypto for PKZIP decryption\n */\nexport class DecryptionStream {\n  private password: string;\n  private method: EncryptionMethod;\n  private entry: ZipEntry;\n  private zipCrypto: ZipCrypto;\n\n  constructor(options: DecryptionStreamOptions) {\n    this.password = options.password;\n    this.method = options.method;\n    this.entry = options.entry;\n    this.zipCrypto = new ZipCrypto();\n  }\n\n  /**\n   * Decrypt compressed data stream chunk by chunk\n   */\n  async *decrypt(encryptedStream: AsyncGenerator<Buffer>): AsyncGenerator<Buffer> {\n    if (this.method !== EncryptionMethod.ZIP_CRYPTO) {\n      throw new Error(`Unsupported encryption method: ${this.method}`);\n    }\n\n    // Calculate check byte based on entry\n    const checkByte = this.calculateCheckByte();\n    \n    // Use ZipCrypto's streaming decryptor\n    yield* this.zipCrypto.createStreamDecryptor(this.password, checkByte, encryptedStream);\n  }\n\n  /**\n   * Calculate check byte for password verification\n   * For DATA_DESC files: lastModTimeDate >> 8\n   * For non-DATA_DESC files: CRC >> 24\n   */\n  private calculateCheckByte(): number {\n    if (this.entry.bitFlags & GP_FLAG.DATA_DESC) {\n      let lastModTimeDate = (this.entry as any).lastModTimeDate;\n      if (!lastModTimeDate || lastModTimeDate === 0) {\n        lastModTimeDate = this.entry.timeDateDOS || 0;\n      }\n      const checkByte = (lastModTimeDate >> 8) & 0xff;\n      return checkByte;\n    } else {\n      const crc = (this.entry as any).localCrc && (this.entry as any).localCrc !== 0 \n        ? (this.entry as any).localCrc \n        : this.entry.crc;\n      const checkByte = (crc >> 24) & 0xff;\n      return checkByte;\n    }\n  }\n\n  /**\n   * Prepare entry for decryption by parsing local header from file handle\n   * This extracts the information needed for check byte calculation\n   * @param fileHandle - File handle to read from\n   * @param entry - ZIP entry to update\n   * @returns Check byte value for password verification\n   */\n  static async prepareEntryForDecryption(fileHandle: any, entry: ZipEntry): Promise<number> {\n    // Read local header to get lastModTimeDate for DATA_DESC files (needed for check byte)\n    const localHeaderBuffer = Buffer.alloc(30);\n    await fileHandle.read(localHeaderBuffer, 0, 30, entry.localHdrOffset);\n\n    // Use ZipCrypto to parse the header\n    const zipCrypto = new ZipCrypto();\n    const { checkByte } = zipCrypto.parseLocalHeaderForDecryption(localHeaderBuffer, entry);\n\n    return checkByte;\n  }\n}\n", "// ======================================\n//\tZipEntry.ts\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n// Zip Directory Item class\n\nimport Errors from './constants/Errors';\nimport { \n  LOCAL_HDR, \n  CENTRAL_DIR, \n  CMP_METHOD, \n  GP_FLAG, \n  FILE_SYSTEM, \n  HDR_ID,\n  DOS_FILE_ATTR,\n  AES_EXTRA_FIELD_SIZE,\n  AES256_SALT_SIZE,\n  AES256_PWD_VERIFY_SIZE,\n  AES_AUTH_CODE_SIZE,\n  NEO_CRYPTO_EXTRA_FIELD_SIZE,\n  NEO_CRYPTO_PAYLOAD_V1,\n  NEO_CRYPTO_MAGIC_BYTES,\n } from './constants/Headers';\nimport { ZipFileEntry, FileData } from '../types';\nimport { Logger } from './components/Logger';\nimport { crc32 } from './encryption/ZipCrypto';\n\nconst VER_ENCODING = 30;\nconst VER_EXTRACT = 10;                             // Version needed to extract (1.0)\nconst VER_AES_EXTRACT = 51;                         // Version needed for AES extraction (5.1)\n\n/**\n * Class representing a single entry (file or directory) within a ZIP archive\n */\nexport default class ZipEntry implements ZipFileEntry {\n  debug = true;\n\n  verMadeBy: number = 0;        // Read Version Made By\n  verExtract: number = 0;       // Read Version Needed to Extract\n  bitFlags: number = 0;         // General purpose bit flag\n  cmpMethod: number = 0;        // Compression method\n  timeDateDOS: number = 0;      // DOS File Time(2 bytes) & Date(2 bytes) \n  crc: number = 0;              // CRC-32\n  compressedSize: number = 0;   // Compressed size\n  uncompressedSize: number = 0; // Uncompressed size\n  volNumber: number = 0;        // Disk number start\n  intFileAttr: number = 0;      // Internal file attributes\n  extFileAttr: number = 0;      // External file attributes\n  localHdrOffset: number = 0;   // Relative offset to local header from File/Disk start\n  filename: string = '';       // File name\n  extraField: Buffer | null = null; // Extra field\n  comment: string | null = null;    // Entry comment\n\n  // File Data\n  fileBuffer: Buffer | null = null; // File Data Buffer\n\n  // Zip Compressed Data\n  cmpData: Buffer | null = null;    // Compressed Data Buffer\n\n  isEncrypted: boolean = false;     // Zip Entry is encrypted\n  isStrongEncrypt: boolean = false; // Zip Entry is strong encrypted\n  encryptHdr: Buffer | null = null;        // Encrypted Header (12 bytes)\n  lastModTimeDate: number = 0;      // Data Descriptor File Time & Date\n  decrypt: Function | null = null;  // Decrypt Class Function\n\n  // WinZip AES encryption fields (from extra field 0x9901)\n  aesVersion: number = 0;          // 1=AE-1 (CRC stored), 2=AE-2 (CRC=0)\n  aesStrength: number = 0;         // 1=AES-128, 2=AES-192, 3=AES-256\n  realCmpMethod: number = -1;      // Actual compression method when cmpMethod=99\n\n  // NeoEncrypt (extra 0x024E) \u2014 encryption metadata only; cmpMethod stays standard ZIP code\n  neoCryptoPayloadVersion: number = 0;\n  neoCryptoAlgorithm: number = 0;\n  neoCryptoFlags: number = 0;\n\n  isUpdated: boolean = true;        // Entry has been updated\n  isDirectory: boolean = false;     // Entry is a directory\n  isMetaData: boolean = false;      // Entry is Zip MetaData\n\n  // Platform specific data\n  platform: string | null = null;   // Platform\n  universalTime: number | null = null; // Universal Time\n  uid: number | null = null;        // User ID\n  gid: number | null = null;        // Group ID\n  sha256: string | null = null;     // SHA-256 hash of the file (Extra Field 0x014E, bare content digest)\n\n  /**\n   * APPNOTE \u00A76.3 v1 Merkle leaf: SHA-256(0x00 \u2016 uncompressed payload).\n   * In-memory only (not written as a ZIP Extra today). Filled in the same streaming hash\n   * pass as `sha256` during create/extract \u2014 never reconstruct by re-reading payload when set.\n   */\n  merkleLeafV1: string | null = null;\n  \n  // Symbolic link data\n  isSymlink: boolean = false;       // Entry is a symbolic link\n  linkTarget: string | null = null; // Target path for symbolic links\n  \n  // Hard link data\n  isHardLink: boolean = false;      // Entry is a hard link\n  originalEntry: string | null = null; // Original entry name for hard links\n  inode: number | null = null;      // Inode number for hard links\n\n  fileData?: FileData;\n\n  /**\n   * Creates a new ZIP entry\n   * @param fname - Name of the file within the ZIP\n   * @param comment - Optional comment for this entry\n   * @param debug - Enable debug logging\n   */\n  constructor(fname: string | null, comment?: string | null, debug?: boolean) {\n    this.filename = fname || '';\n    this.comment = comment || null;\n    this.debug = debug || false;\n    \n    // Set the UTF-8 Language Encoding Flag (EFS) to indicate UTF-8 encoding for filenames\n    this.bitFlags |= GP_FLAG.EFS;\n  } \n\n  isMSDOS = this.platform === null;\n  isUnixLike = this.platform != null && this.platform !== 'win32';\n  isMacOS = this.platform != null && this.platform === 'darwin';\n  isLinux = this.platform != null && this.platform === 'linux';\n\n  VER_MADE_BY = (() => {\n    switch (this.platform) {\n      case 'darwin':\n        return (FILE_SYSTEM.DARWIN << 8) | VER_ENCODING;  // macOS/Darwin\n    case 'win32':\n      return (FILE_SYSTEM.NTFS << 8) | VER_ENCODING;    // Windows\n    default:\n      return (FILE_SYSTEM.UNIX << 8) | VER_ENCODING;    // Unix/Linux\n    }\n  })();\n\n  /**\n   * Reads ZIP entry data from a central directory buffer\n   * @param data - Buffer containing central directory entry data\n   * @returns Buffer positioned at start of next entry\n   * @throws Error if central directory entry is invalid\n   */\n  readZipEntry(data: Buffer): Buffer {\n    // Check if buffer is too small before trying to read from it\n    if (data.length < CENTRAL_DIR.SIZE) {\n      throw new Error('Zip entry data is too small or corrupt');\n    }\n\n    // Verify this is a Central Directory Header\n    // data should be 46 bytes and start with \"PK 01 02\"\n    if (data.readUInt32LE(0) !== CENTRAL_DIR.SIGNATURE) {\n      throw new Error(Errors.INVALID_CEN);\n    }\n\n    // Read Zip version made by\n    this.verMadeBy = data.readUInt16LE(CENTRAL_DIR.VER_MADE);\n    // Read Zip version needed to extract\n    this.verExtract = data.readUInt16LE(CENTRAL_DIR.VER_EXT);\n    // encrypt, decrypt flags\n    this.bitFlags = data.readUInt16LE(CENTRAL_DIR.FLAGS);\n    // Test if Zip Entry is encrypted\n    if ((this.bitFlags & GP_FLAG.ENCRYPTED) != 0) {\n      this.isEncrypted = true;\n      if ((this.bitFlags & GP_FLAG.STRONG_ENCRYPT) != 0)\n        this.isStrongEncrypt = true;  \n    }\n    // compression method\n    this.cmpMethod = data.readUInt16LE(CENTRAL_DIR.CMP_METHOD);\n    // modification time (2 bytes time, 2 bytes date)\n    this.timeDateDOS = data.readUInt32LE(CENTRAL_DIR.TIMEDATE_DOS);\n\n    // uncompressed file crc-32 value\n    this.crc = data.readUInt32LE(CENTRAL_DIR.CRC);\n    // compressed size\n    this.compressedSize = data.readUInt32LE(CENTRAL_DIR.CMP_SIZE);\n    // uncompressed size\n    this.uncompressedSize = data.readUInt32LE(CENTRAL_DIR.UNCMP_SIZE);\n    // volume number start\n    this.volNumber = data.readUInt16LE(CENTRAL_DIR.DISK_NUM);\n    // internal file attributes\n    this.intFileAttr = data.readUInt16LE(CENTRAL_DIR.INT_FILE_ATTR);\n    // external file attributes\n    this.extFileAttr = data.readUInt32LE(CENTRAL_DIR.EXT_FILE_ATTR);\n    if (this.extFileAttr & DOS_FILE_ATTR.DIRECTORY) \n      this.isDirectory = true;\n\n    // LOC header offset\n    this.localHdrOffset = data.readUInt32LE(CENTRAL_DIR.LOCAL_HDR_OFFSET);\n\n    // Filename Length - 2 bytes\n    let fnameLen = data.readUInt16LE(CENTRAL_DIR.FNAME_LEN);\n    const filename = data.toString('utf8', CENTRAL_DIR.SIZE, CENTRAL_DIR.SIZE + fnameLen);\n    this.filename = filename;\n    if (this.filename.endsWith('/'))\n      this.isDirectory = true;\n\n    // Extra Field Length - 2 bytes\n    let extraLen = data.readUInt16LE(CENTRAL_DIR.EXTRA_LEN);\n    if (extraLen > 0) {\n      this.extraField = data.subarray(CENTRAL_DIR.SIZE + fnameLen, CENTRAL_DIR.SIZE + fnameLen + extraLen);\n\n      // First pass: Check for Unicode Path to ensure correct filename before processing other fields\n      for (let i = 0; i < extraLen; ) {\n        let _id = this.extraField.readUInt16LE(i);\n        let _len = this.extraField.readUInt16LE(i + 2);\n        let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n        \n        if (_id === HDR_ID.UNICODE_PATH && _len >= 5) {\n          // Unicode Path Extra Field\n          const version = _data.readUInt8(0);\n          const nameCrc32 = _data.readUInt32LE(1);\n          \n          // Calculate CRC32 of the current filename\n          const fnameBuf = Buffer.from(this.filename);\n          const calculatedCrc = crc32(fnameBuf);\n          \n          // If CRCs match, use the UTF-8 filename from the extra field\n          if (calculatedCrc === nameCrc32) {\n            const unicodeName = _data.subarray(5).toString('utf8');\n            this.filename = unicodeName;\n            if (this.debug) {\n              Logger.log(`Using Unicode Path: ${this.filename}`);\n            }\n          }\n        }\n        i += 4 + _len;\n      }\n\n      // Second pass: Process all other extra fields\n      for (let i = 0; i < extraLen; ) {\n        let _id = this.extraField.readUInt16LE(i);\n        let _len = this.extraField.readUInt16LE(i + 2);\n        let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n        \n        if (_id === HDR_ID.SHA256) {          \n          if (_len === 64)\n            // Early versions of NeoZip used a UTF-8 encoded string\n            this.sha256 = _data.toString('utf8');\n          else\n            this.sha256 = _data.toString('hex');\n        } else if (_id === HDR_ID.UNV_TIME) {\n          // Universal Time field has a flag byte followed by a 4-byte timestamp\n          if (_len >= 5) {\n            const flags = _data.readUInt8(0);\n            // Check if modification time is present (bit 0)\n            if (flags & 0x01) {\n              this.universalTime = _data.readUInt32LE(1);\n            }\n          }\n        } else if (_id === HDR_ID.UID_GID) {\n          // Extract UID/GID if present\n          if (_len >= 5) {  // Version + UID size + UID + GID size + GID\n            const version = _data.readUInt8(0);\n            const uidSize = _data.readUInt8(1);\n            if (uidSize <= 4 && _len >= 2 + uidSize) {\n              // Read UID based on its size (1-4 bytes)\n              this.uid = _data.readUIntLE(2, uidSize);\n\n              // Check if GID is also present\n              if (_len >= 2 + uidSize + 1) {\n                const gidSize = _data.readUInt8(2 + uidSize);\n                if (gidSize <= 4 && _len >= 2 + uidSize + 1 + gidSize) {\n                  this.gid = _data.readUIntLE(2 + uidSize + 1, gidSize);\n                }\n              }\n            }\n          }\n        } else if (_id === HDR_ID.SYMLINK) {\n          // Extract symbolic link information\n          if (_len >= 3) {  // Version + Target Length + Target\n            const version = _data.readUInt8(0);\n            const targetLength = _data.readUInt16LE(1);\n            if (targetLength > 0 && _len >= 3 + targetLength) {\n              this.isSymlink = true;\n              this.linkTarget = _data.subarray(3, 3 + targetLength).toString('utf8');\n            }\n          }\n        } else if (_id === HDR_ID.HARDLINK) {\n          // Extract hard link information\n          if (_len >= 11) {  // Version + Inode + Original Length + Original\n            const version = _data.readUInt8(0);\n            this.inode = _data.readUInt32LE(1);\n            const originalLength = _data.readUInt16LE(5);\n            if (originalLength > 0 && _len >= 7 + originalLength) {\n              this.isHardLink = true;\n              this.originalEntry = _data.subarray(7, 7 + originalLength).toString('utf8');\n            }\n          }\n        } else if (_id === HDR_ID.AES) {\n          // WinZip AES extra field (0x9901)\n          if (_len >= 7) {\n            this.aesVersion = _data.readUInt16LE(0);\n            // vendorId at bytes 2-3 (\"AE\")\n            this.aesStrength = _data.readUInt8(4);\n            this.realCmpMethod = _data.readUInt16LE(5);\n          }\n        } else if (_id === HDR_ID.NEO_CRYPTO) {\n          if (_len >= NEO_CRYPTO_PAYLOAD_V1) {\n            if (\n              _data[0] === NEO_CRYPTO_MAGIC_BYTES[0] &&\n              _data[1] === NEO_CRYPTO_MAGIC_BYTES[1] &&\n              _data[2] === NEO_CRYPTO_MAGIC_BYTES[2] &&\n              _data[3] === NEO_CRYPTO_MAGIC_BYTES[3]\n            ) {\n              this.neoCryptoPayloadVersion = _data.readUInt8(4);\n              this.neoCryptoAlgorithm = _data.readUInt16LE(5);\n              this.neoCryptoFlags = _data.readUInt16LE(7);\n            }\n          }\n        }\n        // Skip Unicode Path here as we already processed it\n        i += 4 + _len;\n      }\n    }\n\n    // File Comment Length - 2 bytes\n    let comLen = data.readUInt16LE(CENTRAL_DIR.COMMENT_LEN);\n    if (comLen > 0)\n      this.comment = data.toString('utf8', CENTRAL_DIR.SIZE + fnameLen, CENTRAL_DIR.SIZE + fnameLen + comLen);\n\n    if (this.debug)\n      this.showVerboseInfo();\n\n    // Calculate the Buffer for the next entry\n    let rawSize = CENTRAL_DIR.SIZE + fnameLen + extraLen + comLen;\n    return data.subarray(rawSize);\n  }\n\n  /**\n   * Checks if the filename contains characters that require Unicode handling\n   * @returns true if the filename contains non-ASCII characters or special characters\n   */\n  needsUnicodeHandling(): boolean {\n    // Check if filename contains non-ASCII characters or special characters like apostrophes\n    return /[^\\x00-\\x7E]|['\"]/.test(this.filename);\n  }\n\n  /**\n   * Adds UTF-8 Unicode Path field to a buffer\n   * @param buffer - The buffer to write to\n   * @param offset - The offset in the buffer to start writing\n   * @returns The new offset after writing\n   */\n  private addUnicodePathField(buffer: Buffer, offset: number): number {\n    // Create a UTF-8 buffer of the filename\n    const unicodePathBuf = Buffer.from(this.filename, 'utf8');\n    \n    // Calculate CRC32 of the ASCII version of the filename\n    // Create an ASCII version by replacing non-ASCII chars with '?'\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const asciiNameBuf = Buffer.from(asciiName, 'ascii');\n    const nameCrc32 = crc32(asciiNameBuf);\n    \n    // 1 byte version + 4 bytes CRC + filename\n    const unicodePathLen = 5 + unicodePathBuf.length;\n    \n    // Write Unicode Path Extra Field (0x7075)\n    buffer.writeUInt16LE(HDR_ID.UNICODE_PATH, offset); // \"up\" header ID\n    buffer.writeUInt16LE(unicodePathLen, offset + 2);  // data length \n    buffer.writeUInt8(1, offset + 4);                  // version (1)\n    buffer.writeUInt32LE(nameCrc32, offset + 5);       // CRC-32 of standard filename\n    unicodePathBuf.copy(buffer, offset + 9);           // UTF-8 version of filename\n    \n    return offset + 4 + unicodePathLen; // 4 bytes for header + data length\n  }\n\n  /**\n   * Creates a local header for this ZIP entry\n   * @returns Buffer containing the local header data\n   */\n  createLocalHdr(): Buffer {\n    let extraFieldLen = 0;\n    \n    // Only create Unicode Path field if needed\n    const needsUnicode = this.needsUnicodeHandling();\n    \n    if (needsUnicode) {\n      // 1 byte version + 4 bytes CRC + filename + 4 bytes header\n      const unicodeNameLen = Buffer.from(this.filename, 'utf8').length;\n      extraFieldLen = 5 + unicodeNameLen + 4;\n    }\n\n    // Add AES extra field if using WinZip AES encryption\n    const isAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    if (isAes) {\n      extraFieldLen += AES_EXTRA_FIELD_SIZE;\n    }\n\n    const isNeoEncrypt = this.neoCryptoAlgorithm > 0;\n    if (isNeoEncrypt) {\n      extraFieldLen += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n    \n    const data = Buffer.alloc(LOCAL_HDR.SIZE + this.filename.length + extraFieldLen);\n    \n    // \"PK\\003\\004\"\n    data.writeUInt32LE(LOCAL_HDR.SIGNATURE, 0);\n    // version needed to extract (NeoEncrypt keeps standard ZIP method \u2014 use normal extract version)\n    const verExtract = this.cmpMethod === CMP_METHOD.AES_ENCRYPT ? VER_AES_EXTRACT : VER_EXTRACT;\n    data.writeUInt16LE(verExtract, LOCAL_HDR.VER_EXTRACT);\n    // general purpose bit flag\n    data.writeUInt16LE(this.bitFlags >>> 0, LOCAL_HDR.FLAGS);\n    // compression method\n    data.writeUInt16LE(this.cmpMethod, LOCAL_HDR.COMPRESSION);\n    // modification time (2 bytes time, 2 bytes date)\n    data.writeUInt32LE(this.timeDateDOS >>> 0, LOCAL_HDR.TIMEDATE_DOS);\n    // uncompressed file crc-32 value (AE-2 stores 0)\n    data.writeUInt32LE(this.aesVersion === 2 ? 0 : this.crc, LOCAL_HDR.CRC);\n    // compressed size\n    data.writeUInt32LE(this.compressedSize, LOCAL_HDR.CMP_SIZE);\n    // uncompressed size\n    data.writeUInt32LE(this.uncompressedSize, LOCAL_HDR.UNCMP_SIZE);\n    // filename length\n    data.writeUInt16LE(this.filename.length, LOCAL_HDR.FNAME_LEN);\n    // extra field length\n    data.writeUInt16LE(extraFieldLen, LOCAL_HDR.EXTRA_LEN);\n\n    // Write filename - use ASCII filename (replacing non-ASCII with ?)\n    // This ensures compatibility with older ZIP readers\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const fnameBuf = Buffer.from(asciiName);\n    fnameBuf.copy(data, LOCAL_HDR.SIZE);\n\n    let extraOffset = LOCAL_HDR.SIZE + fnameBuf.length;\n    \n    // Add Unicode Path Extra Field only if needed\n    if (needsUnicode) {\n      extraOffset = this.addUnicodePathField(data, extraOffset);\n    }\n\n    // Add AES extra field\n    if (isAes) {\n      data.writeUInt16LE(HDR_ID.AES, extraOffset);\n      data.writeUInt16LE(7, extraOffset + 2);\n      data.writeUInt16LE(this.aesVersion, extraOffset + 4);\n      data.writeUInt16LE(0x4541, extraOffset + 6); // \"AE\"\n      data.writeUInt8(this.aesStrength, extraOffset + 8);\n      data.writeUInt16LE(this.realCmpMethod, extraOffset + 9);\n      extraOffset += AES_EXTRA_FIELD_SIZE;\n    }\n\n    if (isNeoEncrypt) {\n      data.writeUInt16LE(HDR_ID.NEO_CRYPTO, extraOffset);\n      data.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, extraOffset + 2);\n      const p = extraOffset + 4;\n      for (let i = 0; i < 4; i++) {\n        data.writeUInt8(NEO_CRYPTO_MAGIC_BYTES[i], p + i);\n      }\n      data.writeUInt8(this.neoCryptoPayloadVersion, p + 4);\n      data.writeUInt16LE(this.neoCryptoAlgorithm, p + 5);\n      data.writeUInt16LE(this.neoCryptoFlags, p + 7);\n      data.writeUInt16LE(0, p + 9);\n      extraOffset += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n\n    return data;\n  }\n\n  /**\n   * Creates a central directory entry for this ZIP entry\n   * @returns Buffer containing the central directory entry data\n   */\n  centralDirEntry(): Buffer {\n    // Calculate the length of the extra fields\n    const commentLen = this.comment ? Buffer.from(this.comment, 'utf8').length : 0;\n    const utfLen = this.universalTime ? 9 : 0;  // 4 bytes header + 5 bytes data\n    const uidgidLen = this.uid && this.gid ? 11 + 4 : 0;  // 1 byte version + 1 byte size + 4 bytes data + 1 byte size + 4 bytes data\n    const sha256Buf = this.sha256 ? Buffer.from(this.sha256, 'hex') : null;\n    const sha256Len = sha256Buf ? (sha256Buf.length + 4) : 0;\n    \n    // Calculate symbolic link extra field length\n    const symlinkLen = this.isSymlink && this.linkTarget ? \n      (4 + 1 + 2 + Buffer.byteLength(this.linkTarget, 'utf8')) : 0; // 4 bytes header + 1 byte version + 2 bytes length + target\n    \n    // Calculate hard link extra field length\n    const hardlinkLen = this.isHardLink && this.originalEntry && this.inode !== null ? \n      (4 + 1 + 4 + 2 + Buffer.byteLength(this.originalEntry, 'utf8')) : 0; // 4 bytes header + 1 byte version + 4 bytes inode + 2 bytes length + original\n    \n    // Only add Unicode Path field if needed\n    const needsUnicode = this.needsUnicodeHandling();\n    let unicodePathLen = 0;\n    \n    if (needsUnicode) {\n      // 1 byte version + 4 bytes CRC + filename + 4 bytes header\n      const unicodeNameLen = Buffer.from(this.filename, 'utf8').length;\n      unicodePathLen = 5 + unicodeNameLen + 4;\n    }\n    \n    // Add AES extra field if using WinZip AES encryption\n    const isAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    const aesLen = isAes ? AES_EXTRA_FIELD_SIZE : 0;\n\n    const isNeoEncrypt = this.neoCryptoAlgorithm > 0;\n    const neoLen = isNeoEncrypt ? NEO_CRYPTO_EXTRA_FIELD_SIZE : 0;\n\n    const extraLen = utfLen + sha256Len + uidgidLen + symlinkLen + hardlinkLen + (needsUnicode ? unicodePathLen : 0) + aesLen + neoLen;\n\n    // Calculate actual filename length (ASCII conversion may change length)\n    const asciiName = this.filename.replace(/[^\\x00-\\x7E]/g, '?');\n    const fnameLen = asciiName.length;\n    \n    // Central directory header size (46 Bytes + filename + comment + extra fields)\n    const data = Buffer.alloc(CENTRAL_DIR.SIZE + fnameLen + commentLen + extraLen);\n    \n    // \"PK\\001\\002\"\n    data.writeUInt32LE(CENTRAL_DIR.SIGNATURE, 0);\n    // Version made by - Needs to be set for NeoZip \n    data.writeUInt16LE(this.isUpdated ? this.VER_MADE_BY : this.verMadeBy, CENTRAL_DIR.VER_MADE);\n    // Version needed to extract\n    const centralVerExtract = this.cmpMethod === CMP_METHOD.AES_ENCRYPT ? VER_AES_EXTRACT : VER_EXTRACT;\n    data.writeInt16LE(this.isUpdated ? centralVerExtract : this.verMadeBy, CENTRAL_DIR.VER_EXT);\n    // Encrypt, Decrypt Flags\n    data.writeInt16LE(this.bitFlags >>> 0, CENTRAL_DIR.FLAGS);\n    // Compression method\n    data.writeInt16LE(this.cmpMethod, CENTRAL_DIR.CMP_METHOD);\n    // Modification time (2 bytes time, 2 bytes date)\n    data.writeUInt32LE(this.timeDateDOS >>> 0, CENTRAL_DIR.TIMEDATE_DOS);\n    // Uncompressed file CRC-32 value (AE-2 stores 0)\n    data.writeUInt32LE(this.aesVersion === 2 ? 0 : this.crc, CENTRAL_DIR.CRC);\n    // Compressed Size\n    data.writeUInt32LE(this.compressedSize, CENTRAL_DIR.CMP_SIZE);\n    // Uncompressed Size\n    data.writeUInt32LE(this.uncompressedSize, CENTRAL_DIR.UNCMP_SIZE);\n    // Filename Length\n    data.writeUInt16LE(this.filename.length, CENTRAL_DIR.FNAME_LEN);\n    // Extra Field Length\n    data.writeUInt16LE(extraLen, CENTRAL_DIR.EXTRA_LEN);\n    // File Comment Length\n    data.writeUInt16LE(commentLen, CENTRAL_DIR.COMMENT_LEN);\n    // Volume Number Start\n    data.writeUInt16LE(0, CENTRAL_DIR.DISK_NUM);\n    // Internal File Attributes\n    data.writeUInt16LE(this.intFileAttr >>> 0, CENTRAL_DIR.INT_FILE_ATTR);\n    // External File Attributes\n    data.writeUInt32LE(this.extFileAttr >>> 0, CENTRAL_DIR.EXT_FILE_ATTR);\n    // Local Header Offset\n    data.writeUInt32LE(this.localHdrOffset, CENTRAL_DIR.LOCAL_HDR_OFFSET);\n\n    // Write filename - use ASCII filename (replacing non-ASCII with ?)\n    // This ensures compatibility with older ZIP readers\n    const fnameBuf = Buffer.from(asciiName);\n    fnameBuf.copy(data, CENTRAL_DIR.SIZE);\n\n    // Add file comment immediately after filename (InfoZip format)\n    let currentOffset = CENTRAL_DIR.SIZE + fnameLen;\n    if (commentLen > 0 && this.comment) {\n      const commentBuf = Buffer.from(this.comment, 'utf8');\n      commentBuf.copy(data, currentOffset);\n      currentOffset += commentLen;\n    }\n\n    // Add Extra Field data after file comment\n    let extraOffset = currentOffset;\n\n    // Add Universal Time field\n    if (this.universalTime) {\n      data.writeUInt16LE(HDR_ID.UNV_TIME, extraOffset);     // 0x5455\n      data.writeUInt16LE(5, extraOffset + 2);               // Length of data (flags + time)\n      data.writeUInt8(1, extraOffset + 4);                  // Flags: modification time present\n      data.writeUInt32LE(Math.floor(Date.now() / 1000), extraOffset + 5); // Unix timestamp\n      extraOffset += 9;\n    }\n\n    // Add SHA-256 field\n    if (sha256Buf) {\n      data.writeUInt16LE(HDR_ID.SHA256, extraOffset);       // 0x1f\n      data.writeUInt16LE(sha256Buf.length, extraOffset + 2); // Length of data\n      sha256Buf.copy(data, extraOffset + 4);\n      extraOffset += 4 + sha256Buf.length;\n    }\n\n    // Add UID/GID field\n    if (this.uid && this.gid) {\n      data.writeUInt16LE(HDR_ID.UID_GID, extraOffset);       // 0x7875\n      data.writeUInt16LE(11, extraOffset + 2);              // Length of data\n      data.writeUInt8(1, extraOffset + 4);                  // Version\n      data.writeUInt8(4, extraOffset + 5);                  // UID size\n      data.writeUInt32LE(this.uid, extraOffset + 6);        // UID\n      data.writeUInt8(4, extraOffset + 10);                 // GID size\n      data.writeUInt32LE(this.gid, extraOffset + 11);       // GID\n      extraOffset += 15;\n    }\n\n    // Add symbolic link field\n    if (this.isSymlink && this.linkTarget) {\n      const targetBuf = Buffer.from(this.linkTarget, 'utf8');\n      const dataLen = 1 + 2 + targetBuf.length; // version + length + target\n      \n      data.writeUInt16LE(HDR_ID.SYMLINK, extraOffset);       // 0x7855\n      data.writeUInt16LE(dataLen, extraOffset + 2);          // Length of data\n      data.writeUInt8(1, extraOffset + 4);                   // Version\n      data.writeUInt16LE(targetBuf.length, extraOffset + 5); // Target length\n      targetBuf.copy(data, extraOffset + 7);                 // Target path\n      extraOffset += 4 + dataLen;\n    }\n\n    // Add hard link field\n    if (this.isHardLink && this.originalEntry && this.inode !== null) {\n      const originalBuf = Buffer.from(this.originalEntry, 'utf8');\n      const dataLen = 1 + 4 + 2 + originalBuf.length; // version + inode + length + original\n      \n      data.writeUInt16LE(HDR_ID.HARDLINK, extraOffset);       // 0x7865\n      data.writeUInt16LE(dataLen, extraOffset + 2);           // Length of data\n      data.writeUInt8(1, extraOffset + 4);                    // Version\n      data.writeUInt32LE(this.inode, extraOffset + 5);        // Inode number\n      data.writeUInt16LE(originalBuf.length, extraOffset + 9); // Original entry length\n      originalBuf.copy(data, extraOffset + 11);               // Original entry path\n      extraOffset += 4 + dataLen;\n    }\n\n    // Add Unicode Path field if needed\n    if (needsUnicode) {\n      extraOffset = this.addUnicodePathField(data, extraOffset);\n    }\n\n    // Add AES extra field\n    if (isAes) {\n      data.writeUInt16LE(HDR_ID.AES, extraOffset);\n      data.writeUInt16LE(7, extraOffset + 2);\n      data.writeUInt16LE(this.aesVersion, extraOffset + 4);\n      data.writeUInt16LE(0x4541, extraOffset + 6); // \"AE\"\n      data.writeUInt8(this.aesStrength, extraOffset + 8);\n      data.writeUInt16LE(this.realCmpMethod, extraOffset + 9);\n      extraOffset += AES_EXTRA_FIELD_SIZE;\n    }\n\n    if (isNeoEncrypt) {\n      data.writeUInt16LE(HDR_ID.NEO_CRYPTO, extraOffset);\n      data.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, extraOffset + 2);\n      const p = extraOffset + 4;\n      for (let i = 0; i < 4; i++) {\n        data.writeUInt8(NEO_CRYPTO_MAGIC_BYTES[i], p + i);\n      }\n      data.writeUInt8(this.neoCryptoPayloadVersion, p + 4);\n      data.writeUInt16LE(this.neoCryptoAlgorithm, p + 5);\n      data.writeUInt16LE(this.neoCryptoFlags, p + 7);\n      data.writeUInt16LE(0, p + 9);\n      extraOffset += NEO_CRYPTO_EXTRA_FIELD_SIZE;\n    }\n\n    return data;\n  }\n\n  // ======================================\n  //\tRoutines to handle the details of the Zip Entry\n  // ======================================\n\n  /**\n   * Sets the DOS date/time for this entry\n   * @param date - Date to convert to DOS format\n   * @returns number - DOS format date/time\n   */\n  setDateTime(date: Date): number {\n    if (!date) return 0;\n    \n    // DOS date/time format:\n    // Date part (16 bits): Year (7 bits) + Month (4 bits) + Day (5 bits)\n    // Time part (16 bits): Hour (5 bits) + Minute (6 bits) + Second (5 bits, stored as seconds/2)\n    \n    const year = date.getFullYear() - 1980; // Years since 1980\n    const month = date.getMonth() + 1; // Month (1-12)\n    const day = date.getDate(); // Day (1-31)\n    const hour = date.getHours(); // Hour (0-23)\n    const minute = date.getMinutes(); // Minute (0-59)\n    const second = date.getSeconds(); // Second (0-59)\n    \n    // Pack date: year (7 bits) + month (4 bits) + day (5 bits)\n    const datePart = ((year & 0x7f) << 9) | ((month & 0x0f) << 5) | (day & 0x1f);\n    \n    // Pack time: hour (5 bits) + minute (6 bits) + second/2 (5 bits)\n    const timePart = ((hour & 0x1f) << 11) | ((minute & 0x3f) << 5) | ((second >> 1) & 0x1f);\n    \n    // Combine date and time parts\n    const time = (datePart << 16) | timePart;\n    \n    return time;\n  }\n\n  /**\n   * Converts DOS date/time to JavaScript Date\n   * @param timeStamp - DOS format date/time\n   * @returns Date object or null if timestamp is 0\n   */\n  parseDateTime(timeStamp: number): Date | null {\n    if (timeStamp == 0)\n      return null;\n    \n    // Extract date part (upper 16 bits)\n    const datePart = (timeStamp >> 16) & 0xffff;\n    const year = ((datePart >> 9) & 0x7f) + 1980;  // Year (7 bits) + 1980\n    const month = ((datePart >> 5) & 0x0f) - 1;    // Month (4 bits) - 1 for 0-based\n    const day = datePart & 0x1f;                   // Day (5 bits)\n    \n    // Extract time part (lower 16 bits)\n    const timePart = timeStamp & 0xffff;\n    const hour = (timePart >> 11) & 0x1f;          // Hour (5 bits)\n    const minute = (timePart >> 5) & 0x3f;         // Minute (6 bits)\n    const second = (timePart & 0x1f) << 1;         // Second (5 bits) * 2\n    \n    return new Date(year, month, day, hour, minute, second);\n  }\n\n  /**\n   * Formats the entry's date in local format\n   * @returns String in MM/DD/YYYY format or \"--/--/----\" if no date\n   */\n  toLocalDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate === null) return \"--/--/----\";\n\n    return _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: '2-digit',\n      day: '2-digit'\n    }).slice(0,10);\n  }\n\n  /**\n   * Formats the entry's time\n   * @returns String in HH:MM format or \"--:--\" if no time\n   */\n  toTimeString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate === null) return \"--:--\";\n\n    return _timeDate.toTimeString().slice(0, 5);\n  }\n\n  /**\n   * Formats the entry's date and time in local format\n   * @returns String like \"Jan 01, 2024 13:45:30\" or \"--/--/-- --:--\" if no date/time\n   */\n  toFormattedDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate == null) return \"--/--/-- --:--\";\n\n    const datePart = _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: 'short',\n      day: '2-digit'\n    });\n\n    const timePart = _timeDate.toLocaleTimeString('en-US', {\n      hour: '2-digit',\n      minute: '2-digit',\n      second: '2-digit',\n      hour12: false\n    });\n\n    return `${datePart} ${timePart}`;\n  }\n\n  /**\n   * Formats the entry's date and time in UTC\n   * @returns String like \"Jan 01, 2024 13:45:30 UTC\" or \"--/--/-- --:--\" if no date/time\n   */\n  toFormattedUTCDateString(): string {\n    let _timeDate = this.parseDateTime(this.timeDateDOS);\n    if (_timeDate == null) return \"--/--/-- --:--\";\n\n    const datePart = _timeDate.toLocaleDateString('en-US', {\n      year: 'numeric',\n      month: 'short',\n      day: '2-digit',\n      timeZone: 'UTC'\n    });\n\n    const timePart = _timeDate.toLocaleTimeString('en-US', {\n      hour: '2-digit',\n      minute: '2-digit',\n      second: '2-digit',\n      hour12: false,\n      timeZone: 'UTC'\n    });\n\n    return `${datePart} ${timePart} UTC`;\n  }\n\n  /**\n   * Converts compression method code to human-readable string\n   * @returns String describing the compression method\n   */\n  cmpMethodToString(): string {\n    switch (this.cmpMethod) {\n      case CMP_METHOD.STORED: return 'Stored';\n      case CMP_METHOD.SHRUNK: return 'Shrunk';\n      case CMP_METHOD.REDUCED1: return 'Reduced-1';\n      case CMP_METHOD.REDUCED2: return 'Reduced-2';\n      case CMP_METHOD.REDUCED3: return 'Reduced-3';\n      case CMP_METHOD.REDUCED4: return 'Reduced-4';\n      case CMP_METHOD.IMPLODED: return 'Imploded';\n      case CMP_METHOD.DEFLATED:\n        switch (this.bitFlags & 0x6) {\n          case 0: return 'Deflate-N';     // Deflate Normal\n          case 2: return 'Deflate-M';     // Deflate Maximum\n          case 4: return 'Deflate-F';     // Deflate Fast\n          case 6: return 'Deflate-S';     // Deflate Super Fast\n        }\n      case CMP_METHOD.ENHANCED_DEFLATE: return 'Deflate-Enh';\n      case CMP_METHOD.IBM_TERSE: return 'PKDCL-LZ77';\n      case CMP_METHOD.ZSTD: return 'Zstandard';\n      case CMP_METHOD.AES_ENCRYPT:\n        return this.aesStrength === 3 ? 'AES-256' :\n               this.aesStrength === 2 ? 'AES-192' :\n               this.aesStrength === 1 ? 'AES-128' : 'AES';\n      \n      default: return 'Unknown';\n    }\n  }\n\n  /**\n   * Converts file system code to human-readable string\n   * @returns String describing the file system\n   */\n  fileSystemToString(): string {\n    switch (this.verMadeBy >> 8) {\n      case FILE_SYSTEM.MSDOS: return 'MS-DOS';\n      case FILE_SYSTEM.AMIGA: return 'Amiga';\n      case FILE_SYSTEM.OPENVMS: return 'OpenVMS';\n      case FILE_SYSTEM.UNIX: return 'Unix';\n      case FILE_SYSTEM.VM_CMS: return 'VM/CMS';\n      case FILE_SYSTEM.ATARI: return 'Atari ST';\n      case FILE_SYSTEM.OS2: return 'OS/2 HPFS';\n      case FILE_SYSTEM.MAC: return 'Macintosh';\n      case FILE_SYSTEM.CP_M: return 'CP/M';\n      case FILE_SYSTEM.NTFS: return 'Windows NTFS';\n      case FILE_SYSTEM.MVS: return 'MVS (OS/390 - Z/OS)';\n      case FILE_SYSTEM.VSE: return 'VSE';\n      case FILE_SYSTEM.ACORN: return 'Acorn Risc';\n      case FILE_SYSTEM.ALTMVS: return 'Alternate MVS';\n      case FILE_SYSTEM.BEOS: return 'BeOS';\n      case FILE_SYSTEM.TANDEM: return 'Tandem';\n      case FILE_SYSTEM.OS400: return 'OS/400';\n      case FILE_SYSTEM.DARWIN: return 'Apple OS/X (Darwin)';\n      default: return 'Unknown';\n    }\n  }\n\n  /**\n   * Compression method name for a raw code (e.g. 0x9901 \"real\" method).\n   */\n  private compressionMethodCodeToString(method: number): string {\n    if (method < 0) {\n      return 'Not set';\n    }\n    switch (method) {\n      case CMP_METHOD.STORED: return 'Stored (0)';\n      case CMP_METHOD.DEFLATED: return 'Deflated (8)';\n      case CMP_METHOD.ZSTD: return 'Zstandard (93)';\n      case CMP_METHOD.BZIP2: return 'BZIP2 (12)';\n      case CMP_METHOD.LZMA: return 'LZMA (14)';\n      case CMP_METHOD.AES_ENCRYPT: return 'AES wrapper (99)';\n      default:\n        return `code ${method}`;\n    }\n  }\n\n  /**\n   * Prints encryption scheme details (WinZip AES vs ZipCrypto vs PKWARE strong).\n   * See docs/WINZIP_AES_FORMAT.md.\n   */\n  private logEncryptionDetails(): void {\n    const encrypted = (this.bitFlags & GP_FLAG.ENCRYPTED) !== 0;\n    const strong = (this.bitFlags & GP_FLAG.STRONG_ENCRYPT) !== 0;\n\n    Logger.log('Encryption (detailed):                       ');\n    Logger.log('  GP flags:                                  ',\n      `bit0 encrypted=${encrypted}, bit6 strong_encrypt=${strong}`);\n\n    const winZipAes = this.cmpMethod === CMP_METHOD.AES_ENCRYPT && this.aesVersion > 0;\n    const neoEncrypt = !winZipAes && this.neoCryptoAlgorithm > 0;\n\n    if (winZipAes) {\n      Logger.log('  Scheme:                                    ', 'WinZip AES (ZIP compression method 99 + extra 0x9901, vendor \"AE\")');\n      Logger.log('  AE variant:                                ',\n        this.aesVersion === 2\n          ? 'AE-2 \u2014 CRC-32 in local/CEN headers is 0; plaintext integrity from HMAC-SHA1'\n          : 'AE-1 \u2014 CRC-32 in headers is plaintext (uncompressed) CRC-32');\n      const strengthLabel =\n        this.aesStrength === 3 ? 'AES-256 (extra field strength byte 3)'\n        : this.aesStrength === 2 ? 'AES-192 (2)'\n        : this.aesStrength === 1 ? 'AES-128 (1)'\n        : `Unknown (${this.aesStrength})`;\n      Logger.log('  Key size:                                  ', strengthLabel);\n      Logger.log('  Real compression (inside ciphertext):    ',\n        this.compressionMethodCodeToString(this.realCmpMethod));\n      Logger.log('  \"Compressed size\" in headers:            ',\n        'Length of full AES file data: salt + password verifier + ciphertext + 10-byte HMAC');\n      Logger.log('  Payload layout:                            ',\n        `${AES256_SALT_SIZE} byte salt + ${AES256_PWD_VERIFY_SIZE} byte verifier + encrypted(compressed) data + ${AES_AUTH_CODE_SIZE} byte HMAC (PBKDF2-HMAC-SHA1, WinZip AES-CTR)`);\n      Logger.log('  Version needed to extract (from entry):  ',\n        `${this.verExtract}${this.verExtract === VER_AES_EXTRACT ? ' (5.1 \u2014 typical for AES)' : ''}`);\n      if (!strong) {\n        Logger.log('  Typical WinZip AES:                        ', 'bit 6 (strong) usually clear; bit 0 (encrypted) set.');\n      } else {\n        Logger.log('  Note:                                       ', 'Strong-encrypt bit set \u2014 unusual for pure WinZip AES; confirm with extra fields.');\n      }\n    } else if (neoEncrypt) {\n      Logger.log('  Scheme:                                    ', 'NeoEncrypt (GP encrypted + NEO extra 0x024E; standard ZIP compression method in header)');\n      Logger.log('  NEO payload version / algorithm / flags: ',\n        `${this.neoCryptoPayloadVersion} / ${this.neoCryptoAlgorithm} / ${this.neoCryptoFlags}`);\n      Logger.log('  Compression after decrypt:                 ', this.compressionMethodCodeToString(this.cmpMethod));\n      Logger.log('  Ciphertext layout:                         ',\n        `Same as WinZip AES-256 stream: ${AES256_SALT_SIZE} byte salt + ${AES256_PWD_VERIFY_SIZE} byte verifier + encrypted(compressed) + ${AES_AUTH_CODE_SIZE} byte HMAC`);\n      Logger.log('  CRC in headers:                            ', 'Plaintext CRC (AE-1 style) for algorithm 1');\n    } else if (encrypted) {\n      if (strong) {\n        Logger.log('  Scheme:                                    ', 'PKWARE strong encryption (GP bit 6) \u2014 not WinZip method 99; expect extras e.g. 0x0017');\n      } else {\n        Logger.log('  Scheme:                                    ', 'Encrypted (bit 0) \u2014 typically legacy ZipCrypto if method \u2260 99');\n      }\n      Logger.log('  Compression method in header:              ', `${this.cmpMethodToString()} (${this.cmpMethod})`);\n    } else {\n      Logger.log('  Scheme:                                    ', 'Not encrypted');\n    }\n  }\n\n  /**\n   * Converts MS-DOS file attributes to string representation\n   * @returns String like \"----\" where R=readonly, H=hidden, S=system, A=archive\n   */\n  private dosAttributesToString(): string {\n    let dosAttr = this.extFileAttr & 0xFFFF;\n    if (dosAttr === 0) return 'none';\n    let attrs = '';\n    attrs += (dosAttr & DOS_FILE_ATTR.READONLY) ? 'r' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.HIDDEN)   ? 'h' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.SYSTEM)   ? 's' : '-';\n    // attrs += (dosAttr & DOS_FILE_ATTR.VOLUME)   ? 'v' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.DIRECTORY)  ? 'd' : '-';\n    attrs += (dosAttr & DOS_FILE_ATTR.ARCHIVE)  ? 'a' : '-';\n    return attrs;\n  }\n\n  /**\n   * Outputs detailed information about this entry for debugging\n   * Includes compression, encryption, timestamps, and extra fields\n   */\n  showVerboseInfo() {\n    Logger.log('=== Central Directory Entry (%s) ===', this.filename);\n    Logger.log('unzip from start of archive: ', this.localHdrOffset);\n    Logger.log('File system or operating system of origin:    ', this.fileSystemToString());\n    Logger.log('Version of encoding software:                 ', this.verMadeBy);\n    Logger.log('Compression Method:                           ', this.cmpMethodToString());\n    Logger.log('File Security Status:                         ', \n      this.bitFlags & GP_FLAG.ENCRYPTED ? \n        this.bitFlags & GP_FLAG.STRONG_ENCRYPT ? 'Strong Encrypt' : 'Encrypted' :\n        'Not Encrypted');\n    this.logEncryptionDetails();\n    Logger.log('File Modified (DOS date/time)                 ', this.toFormattedDateString()); \n    Logger.log('File Modified (UTC)                           ', this.toFormattedUTCDateString());\n    Logger.log('Compressed Size:                              ', this.compressedSize);\n    Logger.log('UnCompressed Size:                            ', this.uncompressedSize);\n    Logger.log(`32-bit CRC value (hex):                        ${this.crc.toString(16).padStart(8, '0')}`);\n    Logger.log('Length of extra field:                        ', this.extraField?.length ?? 0);\n    Logger.log('Length of file comment:                       ', this.comment?.length ?? 0);\n    Logger.log('Unix File Attributes:                         ');\n    Logger.log('MS-DOS File Attributes:                       ', this.dosAttributesToString());\n    if (this.extraField) {\n      Logger.log('\\nThe Central-Directory Extra Field contains:');\n      try {\n        for (let i = 0; i < this.extraField.length; ) {\n          // Ensure we have at least 4 bytes (header ID + length)\n          if (i + 4 > this.extraField.length) {\n            Logger.log(`   Warning: Truncated extra field at offset ${i}`);\n            break;\n          }\n          \n          let _id = this.extraField.readUInt16LE(i);\n          let _idStr = _id.toString(16).padStart(4, '0');\n          let _len = this.extraField.readUInt16LE(i + 2);\n          \n          // Validate the length to ensure it doesn't exceed buffer bounds\n          if (_len < 0 || i + 4 + _len > this.extraField.length) {\n            Logger.log(`   Warning: Invalid extra field length (${_len}) at offset ${i} for ID ${_idStr}`);\n            break;\n          }\n          \n          let _data = this.extraField.subarray(i + 4, i + 4 + _len);\n          \n          try {\n            if (_id === HDR_ID.SHA256) {          \n              Logger.log(`   ID[0x${_idStr}] NeoZip-SHA256: ${_data.toString('hex')}`);\n            } else if (_id === HDR_ID.UNV_TIME) {\n              if (_len >= 5) {\n                const flags = _data.readUInt8(0);\n                const timestamp = _data.readUInt32LE(1);\n                const date = new Date(timestamp * 1000);\n                Logger.log(`   ID[0x${_idStr}] Universal Time: flags=${flags}, time=${date.toISOString()}`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Universal Time: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.UID_GID) {\n              if (_len >= 5) {\n                const version = _data.readUInt8(0);\n                const uidSize = _data.readUInt8(1);\n                if (2 + uidSize > _len) {\n                  Logger.log(`   ID[0x${_idStr}] Unix UID/GID: (invalid UID size ${uidSize})`);\n                } else {\n                  const uid = _data.readUIntLE(2, Math.min(uidSize, 4));\n                  let gid = 0;\n                  if (2 + uidSize + 1 < _len) {\n                    const gidSize = _data.readUInt8(2 + uidSize);\n                    if (2 + uidSize + 1 + gidSize <= _len) {\n                      gid = _data.readUIntLE(2 + uidSize + 1, Math.min(gidSize, 4));\n                    }\n                  }\n                  Logger.log(`   ID[0x${_idStr}] Unix UID/GID: version=${version}, uid=${uid}, gid=${gid}`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Unix UID/GID: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.SYMLINK) {\n              if (_len >= 3) {\n                const version = _data.readUInt8(0);\n                const targetLength = _data.readUInt16LE(1);\n                if (targetLength > 0 && _len >= 3 + targetLength) {\n                  const target = _data.subarray(3, 3 + targetLength).toString('utf8');\n                  Logger.log(`   ID[0x${_idStr}] Symbolic Link: version=${version}, target=\"${target}\"`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] Symbolic Link: (invalid target length ${targetLength})`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Symbolic Link: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.HARDLINK) {\n              if (_len >= 11) {\n                const version = _data.readUInt8(0);\n                const inode = _data.readUInt32LE(1);\n                const originalLength = _data.readUInt16LE(5);\n                if (originalLength > 0 && _len >= 7 + originalLength) {\n                  const original = _data.subarray(7, 7 + originalLength).toString('utf8');\n                  Logger.log(`   ID[0x${_idStr}] Hard Link: version=${version}, inode=${inode}, original=\"${original}\"`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] Hard Link: (invalid original length ${originalLength})`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Hard Link: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.UNICODE_PATH) {\n              if (_len >= 5) {\n                const version = _data.readUInt8(0);\n                const nameCrc32 = _data.readUInt32LE(1);\n                const unicodeName = _data.subarray(5).toString('utf8');\n                \n                // Calculate CRC32 of the original filename for verification\n                const fnameBuf = Buffer.from(this.filename);\n                const calculatedCrc = crc32(fnameBuf);\n                \n                const crcMatch = nameCrc32 === calculatedCrc ? 'MATCH' : 'MISMATCH';\n                \n                Logger.log(`   ID[0x${_idStr}] Unicode Path: version=${version}, CRC32=${nameCrc32.toString(16)} (${crcMatch})`);\n                Logger.log(`                      Path: \"${unicodeName}\"`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] Unicode Path: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.AES) {\n              if (_len >= 7) {\n                const vendorVersion = _data.readUInt16LE(0);\n                const vendorId = String.fromCharCode(_data[2], _data[3]);\n                const strength = _data.readUInt8(4);\n                const realMethod = _data.readUInt16LE(5);\n                const strengthStr = strength === 3 ? '256-bit' : strength === 2 ? '192-bit' : strength === 1 ? '128-bit' : 'Unknown';\n                const aeLabel = vendorVersion === 2 ? 'AE-2 (CRC=0 in headers)' : vendorVersion === 1 ? 'AE-1 (plaintext CRC in headers)' : `vendorVer=${vendorVersion}`;\n                Logger.log(`   ID[0x${_idStr}] WinZip AES: ${aeLabel}, vendor=\"${vendorId}\", strength=${strengthStr}, realCompressionMethod=${realMethod}`);\n              } else {\n                Logger.log(`   ID[0x${_idStr}] WinZip AES: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.NEO_CRYPTO) {\n              if (_len >= NEO_CRYPTO_PAYLOAD_V1) {\n                if (\n                  _data[0] === NEO_CRYPTO_MAGIC_BYTES[0] &&\n                  _data[1] === NEO_CRYPTO_MAGIC_BYTES[1] &&\n                  _data[2] === NEO_CRYPTO_MAGIC_BYTES[2] &&\n                  _data[3] === NEO_CRYPTO_MAGIC_BYTES[3]\n                ) {\n                  const pv = _data.readUInt8(4);\n                  const alg = _data.readUInt16LE(5);\n                  const flg = _data.readUInt16LE(7);\n                  Logger.log(`   ID[0x${_idStr}] NeoEncrypt: payloadVer=${pv}, algorithm=${alg}, flags=${flg}`);\n                } else {\n                  Logger.log(`   ID[0x${_idStr}] NeoEncrypt: (invalid magic)`);\n                }\n              } else {\n                Logger.log(`   ID[0x${_idStr}] NeoEncrypt: (invalid length ${_len})`);\n              }\n            } else if (_id === HDR_ID.ZIP64) {\n              // ZIP64 Extended Information (0x0001)\n              Logger.log(`   ID[0x${_idStr}] ZIP64 Extended Information:`);\n              if (_len >= 8) {\n                let offset = 0;\n                \n                // Read uncompressed size (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const uncompressedSize = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Uncompressed Size (ZIP64): ${uncompressedSize.toString()} bytes`);\n                  offset += 8;\n                }\n                \n                // Read compressed size (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const compressedSize = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Compressed Size (ZIP64): ${compressedSize.toString()} bytes`);\n                  offset += 8;\n                }\n                \n                // Read local header offset (8 bytes) if present\n                if (offset + 8 <= _len) {\n                  const localHeaderOffset = _data.readBigUInt64LE(offset);\n                  Logger.log(`     Local Header Offset (ZIP64): ${localHeaderOffset.toString()}`);\n                  offset += 8;\n                }\n                \n                // Read disk number (4 bytes) if present\n                if (offset + 4 <= _len) {\n                  const diskNumber = _data.readUInt32LE(offset);\n                  Logger.log(`     Disk Number (ZIP64): ${diskNumber}`);\n                }\n              } else {\n                Logger.log(`     ZIP64 Extended Information: (invalid length ${_len})`);\n              }\n            } else {\n              // For unknown fields, show a hex preview of the first few bytes\n              const preview = _len > 0 \n                ? _data.slice(0, Math.min(16, _len)).toString('hex')\n                : '';\n              Logger.log(`   ID[0x${_idStr}] Unknown field: length=${_len} bytes${preview ? ', data=' + preview + '...' : ''}`);\n            }\n          } catch (error: any) {\n            Logger.log(`   Error parsing extra field ID[0x${_idStr}]: ${error.message}`);\n          }\n          \n          i += 4 + _len;\n        }\n      } catch (error: any) {\n        Logger.log(`   Error parsing extra fields: ${error.message}`);\n      }\n    }\n    Logger.log('\\n');\n  }\n}\n\nexport { ZipEntry };\n", "// ============================================================================\n// NeoZipKit Version Info\n// ============================================================================\n\nexport interface NeoZipKitInfo {\n  version: string;\n  releaseDate: string;\n}\n\nexport const NEOZIPKIT_INFO: NeoZipKitInfo = {\n  version: '0.7.0',\n  releaseDate: '2026-04-06'\n};\n\n// ============================================================================\n// File Data Interfaces\n// ============================================================================\n\nexport interface FileData {\n  name: string;\n  size: number;\n  lastModified: number;\n  arrayBuffer(): Promise<ArrayBuffer>;\n}\n\nexport interface ZipFileEntry {\n  filename: string;\n  comment?: string | null;\n  fileData?: FileData;\n  fileBuffer?: Buffer | null;\n  isDirectory: boolean;\n  isMetaData: boolean;\n  isEncrypted: boolean;\n  sha256?: string | null;\n}\n\n// ============================================================================\n// Support Interface\n// ============================================================================\n\nexport interface Support {\n  base64: boolean;\n  array: boolean;\n  string: boolean;\n  isNode: boolean;\n  buffer: boolean;\n  uint8array: boolean;\n  arrayBuffer: boolean;\n  blob: boolean;\n  streams: boolean;\n  fileReader: boolean;\n}\n\n// ============================================================================\n// Archive Statistics\n// ============================================================================\n\nexport interface ArchiveStatistics {\n  fileSize: number;\n  created: Date;\n  modified: Date;\n  totalFiles: number;\n  totalFolders: number;\n  uncompressedSize: number;\n  compressedSize: number;\n  compressionRatio: number;\n  averageCompressionRatio: number;\n}\n", "/**\n * Browser stub for ZSTD \u2014 native zlib streaming is Node-only.\n * Browser builds alias `ZstdNode` to this module so the bad WASM codec is never shipped.\n */\n\nconst ZSTD_BROWSER_UNSUPPORTED =\n  'ZSTD requires Node.js with native zlib support (Node.js >= 22.15 or >= 23.8). ' +\n  'Browser builds do not include a zstd codec; use Deflate or process zstd archives in Node.';\n\nfunction unsupported(): never {\n  throw new Error(ZSTD_BROWSER_UNSUPPORTED);\n}\n\nexport function isNativeZstdAvailable(): boolean {\n  return false;\n}\n\nexport function mapCompressionLevel(_level: number): number {\n  return unsupported();\n}\n\nexport function createCompressTransform(_level?: number): never {\n  return unsupported();\n}\n\nexport function createDecompressTransform(): never {\n  return unsupported();\n}\n\nexport async function compress(_data: Buffer, _level?: number): Promise<Buffer> {\n  return unsupported();\n}\n\nexport async function decompress(_data: Buffer): Promise<Buffer> {\n  return unsupported();\n}\n\nexport function compressSync(_data: Buffer, _level?: number): Buffer {\n  return unsupported();\n}\n\nexport function decompressSync(_data: Buffer): Buffer {\n  return unsupported();\n}\n\nexport async function compressChunks(\n  _readChunk: (position: number, size: number) => Buffer,\n  _totalSize: number,\n  _chunkSize: number,\n  _level: number,\n  _onPlainChunk?: (chunk: Buffer) => void,\n  _onCompressedChunk?: (chunk: Buffer) => void | Promise<void>\n): Promise<number> {\n  return unsupported();\n}\n\nexport async function* decompressStream(\n  _compressedStream: AsyncIterable<Buffer>\n): AsyncGenerator<Buffer> {\n  unsupported();\n}\n\nexport const ZstdNode = {\n  isNativeZstdAvailable,\n  mapCompressionLevel,\n  createCompressTransform,\n  createDecompressTransform,\n  compress,\n  decompress,\n  compressSync,\n  decompressSync,\n  compressChunks,\n  decompressStream,\n};\n\nexport default ZstdNode;\n", "// ======================================\n//  HashCalculator.ts - Unified Hash Component\n//  Combines StreamHashCalculator, HashAccumulator, and MerkleTree functionality\n// ======================================\n\nimport * as crypto from 'crypto';\nimport { crc32update } from '../encryption/ZipCrypto';\n\n/**\n * Configuration options for Merkle tree construction\n */\ninterface MerkleTreeOptions {\n  hashLeaves: boolean;      // Whether to hash the leaf nodes before adding to tree\n  sortLeaves: boolean;      // Whether to sort leaf nodes for consistent trees\n  sortPairs: boolean;       // Whether to sort each pair before hashing\n  duplicateOdd: boolean;    // Whether to duplicate last leaf when odd number of leaves\n}\n\n/**\n * Unified hash calculator supporting:\n * - Incremental CRC-32 and SHA-256 calculation from raw data chunks\n * - Accumulation of pre-computed SHA-256 hashes with XOR and Merkle tree operations\n * - Merkle tree construction, proof generation, and verification\n * \n * Usage examples:\n * \n * Incremental hash calculation:\n * ```typescript\n * const calculator = new HashCalculator({ useSHA256: true });\n * calculator.update(dataChunk);\n * const crc32 = calculator.finalizeCRC32();\n * const sha256 = calculator.finalizeSHA256();\n * ```\n * \n * Hash accumulation:\n * ```typescript\n * const calculator = new HashCalculator({ enableAccumulation: true });\n * calculator.addHash(sha256Hash1);\n * calculator.addHash(sha256Hash2);\n * const xor = calculator.xorHash();\n * const merkle = calculator.merkleRoot();\n * ```\n */\nexport class HashCalculator {\n  // Incremental hash calculation state (from StreamHashCalculator)\n  private crc32State: number = ~0;\n  private sha256Hash: crypto.Hash | null = null;\n  /** Domain-separated leaf hasher (APPNOTE \u00A76.3): SHA-256(0x00 \u2016 payload). */\n  private merkleLeafHash: crypto.Hash | null = null;\n  private useSHA256: boolean = false;\n\n  // Hash accumulation state (from HashAccumulator)\n  private hashes: Buffer[] = [];\n  private xorResult: Buffer = Buffer.alloc(32, 0);\n  private enableAccumulation: boolean = false;\n\n  // Merkle tree state (from MerkleTree) \u2014 generic digest folding; archive roots use merkle/MerkleRoot.ts\n  private merkleLeaves: Buffer[] = [];\n  private merkleLayers: Buffer[][] = [];\n  private merkleOptions: MerkleTreeOptions = {\n    hashLeaves: false,\n    // Archive content roots sort by path in MerkleRoot; generic accumulator keeps insertion order.\n    sortLeaves: false,\n    sortPairs: false,\n    // match APPNOTE v0 odd-leaf rule when used as a generic Bitcoin-style tree\n    duplicateOdd: true\n  };\n\n  /**\n   * Creates a new HashCalculator instance\n   * @param options - Configuration options:\n   *   - useSHA256: Enable SHA-256 calculation for incremental mode (default: false)\n   *   - enableAccumulation: Enable hash accumulation mode (default: false)\n   */\n  constructor(options?: {\n    useSHA256?: boolean;\n    enableAccumulation?: boolean;\n  }) {\n    this.useSHA256 = options?.useSHA256 || false;\n    this.enableAccumulation = options?.enableAccumulation || false;\n\n    if (this.useSHA256) {\n      this.sha256Hash = crypto.createHash('sha256');\n      this.merkleLeafHash = crypto.createHash('sha256');\n      this.merkleLeafHash.update(Buffer.from([0x00]));\n    }\n  }\n\n  // ============================================================================\n  // Incremental Hash Calculation Methods (from StreamHashCalculator)\n  // ============================================================================\n\n  /**\n   * Update hash state with a new chunk of data\n   * Updates both CRC-32 and SHA-256 (if enabled) incrementally\n   * @param chunk - Data chunk to process\n   */\n  update(chunk: Buffer): void {\n    // Update CRC-32 incrementally using existing crc32update function\n    for (let i = 0; i < chunk.length; i++) {\n      this.crc32State = crc32update(this.crc32State, chunk[i]);\n    }\n    \n    // Update SHA-256 and v1 Merkle leaf hash incrementally\n    if (this.sha256Hash) {\n      this.sha256Hash.update(chunk);\n    }\n    if (this.merkleLeafHash) {\n      this.merkleLeafHash.update(chunk);\n    }\n  }\n\n  /**\n   * Get final CRC-32 value\n   * @returns Final CRC-32 value as unsigned 32-bit integer\n   */\n  finalizeCRC32(): number {\n    return ~this.crc32State >>> 0; // Finalize with ~0 like the existing crc32 function\n  }\n\n  /**\n   * Get final SHA-256 hash as hex string (Extra Field 0x014E \u2014 bare content digest)\n   * @returns SHA-256 hash as hex string, or null if SHA-256 not enabled\n   */\n  finalizeSHA256(): string | null {\n    if (this.sha256Hash) {\n      return this.sha256Hash.digest('hex');\n    }\n    return null;\n  }\n\n  /**\n   * Get APPNOTE \u00A76.3 v1 Merkle leaf: SHA-256(0x00 \u2016 uncompressed payload) as hex.\n   * Consumes the leaf hasher; call after or instead of finalizeSHA256 for dual streams.\n   */\n  finalizeMerkleLeafV1(): string | null {\n    if (this.merkleLeafHash) {\n      return this.merkleLeafHash.digest('hex');\n    }\n    return null;\n  }\n\n  /**\n   * Apply stream digests to a ZIP entry in one place.\n   *\n   * When SHA-256 was enabled, both Extra Field 0x014E (`sha256`) and the v1 Merkle leaf\n   * (`merkleLeafV1`) are finalized from the **same** chunk stream \u2014 no second payload pass.\n   */\n  applyToEntry(\n    entry: {\n      crc: number;\n      sha256: string | null;\n      merkleLeafV1?: string | null;\n    },\n    options: { setCrc?: boolean; setSha256?: boolean }\n  ): void {\n    if (options.setCrc) {\n      entry.crc = this.finalizeCRC32();\n    }\n    if (options.setSha256) {\n      const digest = this.finalizeSHA256();\n      const leaf = this.finalizeMerkleLeafV1();\n      if (digest) {\n        entry.sha256 = digest;\n      }\n      if (leaf) {\n        entry.merkleLeafV1 = leaf;\n      }\n    }\n  }\n\n  /**\n   * Reset the incremental hash calculation state\n   */\n  reset(): void {\n    this.crc32State = ~0;\n    if (this.useSHA256) {\n      this.sha256Hash = crypto.createHash('sha256');\n      this.merkleLeafHash = crypto.createHash('sha256');\n      this.merkleLeafHash.update(Buffer.from([0x00]));\n    }\n  }\n\n  // ============================================================================\n  // Hash Accumulation Methods (from HashAccumulator)\n  // ============================================================================\n\n  /**\n   * Adds a pre-computed SHA-256 hash to both the XOR accumulation and hash array\n   * @param hash - Hash value as hex string or Buffer (must be 32 bytes for SHA-256)\n   */\n  addHash(hash: string | Buffer): void {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    // Convert hash to Buffer if it's a string\n    const hashBuffer = typeof hash === 'string' \n      ? Buffer.from(hash, 'hex') \n      : hash;\n\n    // Add to array for Merkle tree\n    this.hashes.push(hashBuffer);\n    this.merkleLeaves.push(hashBuffer);\n\n    // XOR accumulation\n    for (let i = 0; i < 32; i++) {\n      this.xorResult[i] ^= hashBuffer[i];\n    }\n\n    // Rebuild Merkle tree when hash is added\n    this.rebuildMerkleTree();\n  }\n\n  /**\n   * Gets the accumulated XOR of all added hashes\n   * @returns Hex string of XOR result\n   */\n  xorHash(): string {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    return this.xorResult.toString('hex');\n  }\n\n  /**\n   * Creates a Merkle tree from accumulated hashes and returns the root\n   * @returns Hex string of Merkle root, or null if no hashes added\n   */\n  merkleRoot(): string | null {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    if (this.merkleLeaves.length === 0) {\n      return null;\n    }\n\n    // If Merkle tree not built yet, build it\n    if (this.merkleLayers.length === 0) {\n      this.rebuildMerkleTree();\n    }\n\n    const root = this.merkleLayers[this.merkleLayers.length - 1];\n    if (root && root.length > 0) {\n      return root[0].toString('hex');\n    }\n\n    return null;\n  }\n\n  /**\n   * Gets the number of hashes accumulated\n   * @returns Number of accumulated hashes\n   */\n  leafCount(): number {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    return this.hashes.length;\n  }\n\n  /**\n   * Clears the accumulated hashes and resets XOR buffer\n   */\n  clear(): void {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n    this.hashes = [];\n    this.merkleLeaves = [];\n    this.merkleLayers = [];\n    this.xorResult = Buffer.alloc(32, 0);\n  }\n\n  /**\n   * Combines multiple hash results into a single Merkle root\n   * Static method for combining results from multiple HashCalculator instances\n   * @param results - Array of objects containing merkleRoot properties\n   * @returns Combined Merkle root as hex string, or null if no valid roots\n   */\n  static combineResults(results: { merkleRoot?: string }[]): string | null {\n    const calculator = new HashCalculator({ enableAccumulation: true });\n    \n    // Combine all hashes\n    for (const result of results) {\n      if (result.merkleRoot) {\n        calculator.addHash(result.merkleRoot);\n      }\n    }\n\n    return calculator.merkleRoot();\n  }\n\n  // ============================================================================\n  // Merkle Tree Methods (from MerkleTree)\n  // ============================================================================\n\n  /**\n   * Computes SHA-256 hash of input data\n   * @param data - Data to hash\n   * @returns Buffer containing hash\n   */\n  private hash(data: Buffer): Buffer {\n    return crypto.createHash('sha256').update(data).digest();\n  }\n\n  /**\n   * Combines two child hashes to create parent hash\n   * @param left - Left child hash\n   * @param right - Right child hash\n   * @returns Combined hash of children\n   */\n  private combinedHash(left: Buffer, right: Buffer): Buffer {\n    if (this.merkleOptions.sortPairs && Buffer.compare(left, right) > 0) {\n      [left, right] = [right, left];\n    }\n    // Generic accumulator tree (not APPNOTE archive root \u2014 see merkle/MerkleRoot.ts)\n    return this.hash(Buffer.concat([left, right]));\n  }\n\n  /**\n   * Builds the Merkle tree by creating successive layers of hashes\n   * @param nodes - Array of nodes in current layer\n   */\n  private createHashes(nodes: Buffer[]): void {\n    while (nodes.length > 1) {\n      const layerIndex = this.merkleLayers.length;\n      this.merkleLayers.push([]);\n\n      // Process pairs of nodes\n      for (let i = 0; i < nodes.length - 1; i += 2) {\n        const left = nodes[i];\n        const right = nodes[i + 1];\n        const hash = this.combinedHash(left, right);\n        this.merkleLayers[layerIndex].push(hash);\n      }\n\n      // Handle odd number of nodes\n      if (nodes.length % 2 === 1) {\n        const last = nodes[nodes.length - 1];\n        if (this.merkleOptions.duplicateOdd) {\n          // Duplicate the last node if odd\n          const hash = this.combinedHash(last, last);\n          this.merkleLayers[layerIndex].push(hash);\n        } else {\n          // Push last node up to next layer\n          this.merkleLayers[layerIndex].push(last);\n        }\n      }\n\n      nodes = this.merkleLayers[layerIndex];\n    }\n  }\n\n  /**\n   * Rebuilds the Merkle tree from current leaves\n   */\n  private rebuildMerkleTree(): void {\n    if (this.merkleLeaves.length === 0) {\n      this.merkleLayers = [];\n      return;\n    }\n\n    // Process leaves according to options\n    const processedLeaves = this.merkleLeaves.map(leaf => {\n      if (this.merkleOptions.hashLeaves) {\n        return this.hash(leaf);\n      }\n      return Buffer.isBuffer(leaf) ? leaf : Buffer.from(leaf);\n    });\n\n    if (this.merkleOptions.sortLeaves) {\n      processedLeaves.sort(Buffer.compare);\n    }\n\n    this.merkleLayers = [processedLeaves];\n    this.createHashes(processedLeaves);\n  }\n\n  /**\n   * Generates a proof of inclusion for a leaf node\n   * @param leaf - The leaf node to generate proof for\n   * @returns Array of sibling hashes needed to reconstruct root\n   * @throws Error if leaf not found in tree or accumulation not enabled\n   */\n  getProof(leaf: Buffer): Buffer[] {\n    if (!this.enableAccumulation) {\n      throw new Error('Hash accumulation not enabled. Set enableAccumulation: true in constructor.');\n    }\n\n    if (this.merkleLayers.length === 0) {\n      this.rebuildMerkleTree();\n    }\n\n    let index = this.merkleLeaves.findIndex(item => item.equals(leaf));\n    if (index === -1) {\n      throw new Error('Leaf not found in tree');\n    }\n\n    return this.merkleLayers.reduce((proof, layer) => {\n      if (layer.length === 1) return proof;\n\n      const pairIndex = index % 2 === 0 ? index + 1 : index - 1;\n      if (pairIndex < layer.length) {\n        proof.push(layer[pairIndex]);\n      }\n\n      index = Math.floor(index / 2);\n      return proof;\n    }, [] as Buffer[]);\n  }\n\n  /**\n   * Verifies a proof of inclusion for a leaf node\n   * @param proof - Array of sibling hashes from getProof()\n   * @param targetHash - Hash of the leaf node being verified\n   * @param root - Expected root hash\n   * @returns boolean indicating if proof is valid\n   */\n  verify(proof: Buffer[], targetHash: Buffer, root: Buffer): boolean {\n    let computedHash = targetHash;\n\n    for (const proofElement of proof) {\n      computedHash = Buffer.compare(computedHash, proofElement) <= 0\n        ? this.combinedHash(computedHash, proofElement)\n        : this.combinedHash(proofElement, computedHash);\n    }\n\n    return computedHash.equals(root);\n  }\n}\n\n// Default export\nexport default HashCalculator;\n\n", "// ======================================\n//  AesCrypto.ts - WinZip AES-256 Encryption (AE-1/AE-2)\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n// Implements the WinZip AES encryption specification for ZIP files.\n// Compatible with WinZip, 7-Zip, and other tools that support the AE-1/AE-2 format.\n//\n// Spec: https://www.winzip.com/en/support/aes-encryption/\n//\n// Data layout per encrypted entry:\n//   [salt (16 bytes)] [password verifier (2 bytes)] [encrypted data] [HMAC-SHA1 (10 bytes)]\n//\n// Extra field 0x9901 (11 bytes):\n//   [header ID (2)] [data size (2)] [vendor version (2)] [vendor ID (2)] [strength (1)] [real method (2)]\n//\n// Streaming helpers (AesEncryptor / AesDecryptor) keep only a 16-byte CTR block in\n// flight so Node create/extract can chunk large AE-1/AE-2 entries.\n\nimport * as crypto from 'crypto';\nimport ZipEntry from '../ZipEntry';\nimport {\n  AES256_SALT_SIZE,\n  AES256_KEY_SIZE,\n  AES256_PWD_VERIFY_SIZE,\n  AES_AUTH_CODE_SIZE,\n  AES_EXTRA_FIELD_SIZE,\n  AES_OVERHEAD,\n  HDR_ID,\n} from '../constants/Headers';\n\nconst COMPOSITE_KEY_LENGTH = 2 * AES256_KEY_SIZE + AES256_PWD_VERIFY_SIZE; // 66 bytes\nconst PBKDF2_ITERATIONS = 1000;\nconst AES_BLOCK_SIZE = 16;\n\ninterface DerivedKeys {\n  aesKey: Buffer;\n  hmacKey: Buffer;\n  passwordVerifier: Buffer;\n}\n\n/** Little-endian AES-CTR keystream (WinZip counter starts at 1). */\nclass AesCtrEngine {\n  private readonly aesKey: Buffer;\n  private readonly counter: Buffer;\n  private keystream: Buffer;\n  private ksPos: number;\n\n  constructor(aesKey: Buffer) {\n    this.aesKey = aesKey;\n    this.counter = Buffer.alloc(AES_BLOCK_SIZE);\n    this.counter[0] = 1;\n    this.keystream = this.encryptCounter();\n    this.ksPos = 0;\n  }\n\n  process(data: Buffer): Buffer {\n    if (data.length === 0) {\n      return Buffer.alloc(0);\n    }\n    const result = Buffer.alloc(data.length);\n    for (let i = 0; i < data.length; i++) {\n      if (this.ksPos >= AES_BLOCK_SIZE) {\n        AesCtrEngine.incrementCounterLE(this.counter);\n        this.keystream = this.encryptCounter();\n        this.ksPos = 0;\n      }\n      result[i] = data[i] ^ this.keystream[this.ksPos++];\n    }\n    return result;\n  }\n\n  private encryptCounter(): Buffer {\n    const cipher = crypto.createCipheriv('aes-256-ecb', this.aesKey, null);\n    cipher.setAutoPadding(false);\n    return cipher.update(this.counter);\n  }\n\n  static incrementCounterLE(counter: Buffer): void {\n    for (let i = 0; i < AES_BLOCK_SIZE; i++) {\n      if (counter[i] === 255) {\n        counter[i] = 0;\n      } else {\n        counter[i]++;\n        break;\n      }\n    }\n  }\n}\n\n/**\n * Streaming AE-1/AE-2 encryptor for ZIP entry payloads.\n *\n * Usage: `header()` once \u2192 `update(compressedChunk)` repeatedly \u2192 `finish()` for HMAC.\n */\nexport class AesEncryptor {\n  private readonly keys: DerivedKeys;\n  private readonly salt: Buffer;\n  private readonly ctr: AesCtrEngine;\n  private readonly hmac: crypto.Hmac;\n  private headerSent = false;\n  private finished = false;\n\n  constructor(password: string) {\n    this.salt = crypto.randomBytes(AES256_SALT_SIZE);\n    this.keys = AesCrypto.deriveKeys(password, this.salt);\n    this.ctr = new AesCtrEngine(this.keys.aesKey);\n    this.hmac = crypto.createHmac('sha1', this.keys.hmacKey);\n  }\n\n  /** salt (16) + password verifier (2). Write before any ciphertext. */\n  header(): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    this.headerSent = true;\n    return Buffer.concat([this.salt, this.keys.passwordVerifier]);\n  }\n\n  /** Encrypt one compressed-data chunk; updates HMAC over ciphertext. */\n  update(plain: Buffer): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    if (!this.headerSent) {\n      throw new Error('AesEncryptor.header() must be called before update()');\n    }\n    if (plain.length === 0) {\n      return Buffer.alloc(0);\n    }\n    const cipher = this.ctr.process(plain);\n    this.hmac.update(cipher);\n    return cipher;\n  }\n\n  /** Final 10-byte authentication code. */\n  finish(): Buffer {\n    if (this.finished) {\n      throw new Error('AesEncryptor already finished');\n    }\n    if (!this.headerSent) {\n      throw new Error('AesEncryptor.header() must be called before finish()');\n    }\n    this.finished = true;\n    return this.hmac.digest().subarray(0, AES_AUTH_CODE_SIZE);\n  }\n}\n\n/**\n * Streaming AE-1/AE-2 decryptor. `compressedSize` is the full ZIP payload length\n * (salt + verifier + ciphertext + auth), as stored in the local/central header.\n */\nexport class AesDecryptor {\n  private readonly password: string;\n  private readonly cipherLen: number;\n  private remainingCipher: number;\n  private keys: DerivedKeys | null = null;\n  private ctr: AesCtrEngine | null = null;\n  private hmac: crypto.Hmac | null = null;\n  private headerBuf = Buffer.alloc(0);\n  private authBuf = Buffer.alloc(0);\n  private headerDone = false;\n  private verified = false;\n\n  constructor(password: string, compressedSize: number) {\n    if (compressedSize < AES_OVERHEAD) {\n      throw new Error('AES decryption failed: payload too short');\n    }\n    this.password = password;\n    this.cipherLen = compressedSize - AES_OVERHEAD;\n    this.remainingCipher = this.cipherLen;\n  }\n\n  /**\n   * Feed the next archive chunk. Returns decrypted compressed bytes\n   * (empty while still reading salt/verifier).\n   */\n  push(chunk: Buffer): Buffer {\n    let data = chunk;\n    if (!this.headerDone) {\n      this.headerBuf = Buffer.concat([this.headerBuf, data]);\n      const need = AES256_SALT_SIZE + AES256_PWD_VERIFY_SIZE;\n      if (this.headerBuf.length < need) {\n        return Buffer.alloc(0);\n      }\n      const salt = this.headerBuf.subarray(0, AES256_SALT_SIZE);\n      const storedVerifier = this.headerBuf.subarray(AES256_SALT_SIZE, need);\n      this.keys = AesCrypto.deriveKeys(this.password, salt);\n      if (!this.keys.passwordVerifier.equals(storedVerifier)) {\n        throw new Error('AES decryption failed: wrong password');\n      }\n      this.ctr = new AesCtrEngine(this.keys.aesKey);\n      this.hmac = crypto.createHmac('sha1', this.keys.hmacKey);\n      this.headerDone = true;\n      data = this.headerBuf.subarray(need);\n      this.headerBuf = Buffer.alloc(0);\n    }\n\n    if (data.length === 0) {\n      return Buffer.alloc(0);\n    }\n\n    const cipherTake = Math.min(data.length, this.remainingCipher);\n    const cipherPart = data.subarray(0, cipherTake);\n    const rest = data.subarray(cipherTake);\n    if (rest.length > 0) {\n      this.authBuf = Buffer.concat([this.authBuf, rest]);\n    }\n\n    if (cipherPart.length === 0) {\n      this.tryVerify();\n      return Buffer.alloc(0);\n    }\n\n    this.hmac!.update(cipherPart);\n    const plain = this.ctr!.process(cipherPart);\n    this.remainingCipher -= cipherPart.length;\n    this.tryVerify();\n    return plain;\n  }\n\n  /** Ensure ciphertext is complete and HMAC verified. */\n  end(): void {\n    if (this.remainingCipher > 0) {\n      throw new Error('AES decryption failed: truncated ciphertext');\n    }\n    this.tryVerify();\n    if (!this.verified) {\n      throw new Error('AES decryption failed: missing authentication code');\n    }\n  }\n\n  private tryVerify(): void {\n    if (this.verified || this.remainingCipher > 0 || !this.hmac) {\n      return;\n    }\n    if (this.authBuf.length < AES_AUTH_CODE_SIZE) {\n      return;\n    }\n    const stored = this.authBuf.subarray(0, AES_AUTH_CODE_SIZE);\n    const calculated = this.hmac.digest().subarray(0, AES_AUTH_CODE_SIZE);\n    if (!calculated.equals(stored)) {\n      throw new Error(\n        'AES decryption failed: authentication code mismatch (data corrupted or tampered)'\n      );\n    }\n    this.verified = true;\n  }\n}\n\n/**\n * WinZip AES-256 encryption/decryption for ZIP files.\n *\n * Uses PBKDF2-HMAC-SHA1 for key derivation, AES-256 in CTR mode with\n * a little-endian counter (WinZip convention), and HMAC-SHA1 for authentication.\n */\nexport class AesCrypto {\n  /**\n   * Derive encryption key, HMAC key, and password verification value\n   * using PBKDF2 with HMAC-SHA1.\n   */\n  static deriveKeys(password: string | Buffer, salt: Buffer): DerivedKeys {\n    const key = Buffer.isBuffer(password) ? password : Buffer.from(password);\n    const compositeKey = crypto.pbkdf2Sync(\n      key,\n      salt,\n      PBKDF2_ITERATIONS,\n      COMPOSITE_KEY_LENGTH,\n      'sha1'\n    );\n    return {\n      aesKey: compositeKey.subarray(0, AES256_KEY_SIZE),\n      hmacKey: compositeKey.subarray(AES256_KEY_SIZE, 2 * AES256_KEY_SIZE),\n      passwordVerifier: compositeKey.subarray(2 * AES256_KEY_SIZE),\n    };\n  }\n\n  /** Create a streaming AE-1/AE-2 encryptor. */\n  static createEncryptor(password: string): AesEncryptor {\n    return new AesEncryptor(password);\n  }\n\n  /**\n   * Create a streaming AE-1/AE-2 decryptor.\n   * @param compressedSize Full payload size including salt, verifier, and auth code.\n   */\n  static createDecryptor(password: string, compressedSize: number): AesDecryptor {\n    return new AesDecryptor(password, compressedSize);\n  }\n\n  /**\n   * Encrypt compressed data using WinZip AES-256.\n   *\n   * @returns Buffer: salt(16) + verifier(2) + encryptedData + hmac(10)\n   */\n  static encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    void entry;\n    const enc = AesCrypto.createEncryptor(password);\n    const parts = [enc.header()];\n    if (compressedData.length > 0) {\n      parts.push(enc.update(compressedData));\n    }\n    parts.push(enc.finish());\n    return Buffer.concat(parts);\n  }\n\n  /**\n   * Decrypt AES-256 encrypted data from a ZIP entry.\n   *\n   * @param entry - ZIP entry metadata\n   * @param fullPayload - The full payload: salt + verifier + encrypted + hmac\n   * @param password - Decryption password\n   * @returns Decrypted (compressed) data\n   */\n  static decryptBuffer(entry: ZipEntry, fullPayload: Buffer, password: string): Buffer {\n    void entry;\n    const dec = AesCrypto.createDecryptor(password, fullPayload.length);\n    const out = dec.push(fullPayload);\n    dec.end();\n    return out;\n  }\n\n  /**\n   * Decrypt an async chunk stream (Node extract path).\n   * Yields decrypted compressed chunks; verifies HMAC when the stream ends.\n   */\n  static async *decryptStream(\n    password: string,\n    compressedSize: number,\n    encryptedStream: AsyncIterable<Buffer>\n  ): AsyncGenerator<Buffer> {\n    const dec = AesCrypto.createDecryptor(password, compressedSize);\n    for await (const chunk of encryptedStream) {\n      const plain = dec.push(chunk);\n      if (plain.length > 0) {\n        yield plain;\n      }\n    }\n    dec.end();\n  }\n\n  /**\n   * Build the WinZip AES extra data field (0x9901).\n   *\n   * @param realMethod - The actual compression method (e.g. DEFLATED=8, STORED=0)\n   * @param vendorVersion - 1 for AE-1 (CRC stored), 2 for AE-2 (CRC=0)\n   * @returns 11-byte buffer containing the complete extra field\n   */\n  static buildAesExtraField(realMethod: number, vendorVersion: number = 1): Buffer {\n    const buf = Buffer.alloc(AES_EXTRA_FIELD_SIZE);\n    buf.writeUInt16LE(HDR_ID.AES, 0);\n    buf.writeUInt16LE(7, 2);\n    buf.writeUInt16LE(vendorVersion, 4);\n    buf.writeUInt16LE(0x4541, 6); // \"AE\"\n    buf.writeUInt8(0x03, 8); // AES-256\n    buf.writeUInt16LE(realMethod, 9);\n    return buf;\n  }\n\n  /**\n   * Parse the AES extra data field (0x9901) from a buffer.\n   *\n   * @param data - 7-byte data portion of the extra field (without header ID and size)\n   */\n  static parseAesExtraField(data: Buffer): {\n    vendorVersion: number;\n    vendorId: string;\n    encryptionStrength: number;\n    realCmpMethod: number;\n  } {\n    return {\n      vendorVersion: data.readUInt16LE(0),\n      vendorId: String.fromCharCode(data[2], data[3]),\n      encryptionStrength: data.readUInt8(4),\n      realCmpMethod: data.readUInt16LE(5),\n    };\n  }\n}\n", "// ======================================\n//  NeoCrypto.ts - NeoEncrypt (NEO AES-256 via extra 0x024E)\n//  Copyright (c) 2026 NeoWare, Inc. All rights reserved.\n// ======================================\n// See docs/NEO_CRYPTO_FORMAT.md. Ciphertext layout matches AesCrypto (WinZip LE CTR + HMAC).\n// NeoEncrypt uses standard ZIP compression method; only encryption metadata is in the NEO extra.\n\nimport ZipEntry from '../ZipEntry';\nimport {\n  HDR_ID,\n  NEO_CRYPTO_MAGIC_BYTES,\n  NEO_CRYPTO_PAYLOAD_V1,\n  NEO_CRYPTO_EXTRA_FIELD_SIZE,\n} from '../constants/Headers';\nimport { AesCrypto } from './AesCrypto';\n\n/** Encryption algorithm IDs inside NEO extra (payload format v1) */\nexport const NEO_CRYPTO_ALGORITHM_AES256_V1 = 1;\n\nexport interface NeoCryptoParsedPayload {\n  payloadVersion: number;\n  algorithm: number;\n  flags: number;\n  reserved: number;\n}\n\nexport class NeoCrypto {\n  /**\n   * Build 11-byte NEO crypto payload (format version 1).\n   */\n  static buildPayloadV1(\n    algorithm: number = NEO_CRYPTO_ALGORITHM_AES256_V1,\n    flags: number = 0,\n    reserved: number = 0\n  ): Buffer {\n    const buf = Buffer.alloc(NEO_CRYPTO_PAYLOAD_V1);\n    for (let i = 0; i < 4; i++) {\n      buf[i] = NEO_CRYPTO_MAGIC_BYTES[i];\n    }\n    buf.writeUInt8(1, 4);\n    buf.writeUInt16LE(algorithm, 5);\n    buf.writeUInt16LE(flags, 7);\n    buf.writeUInt16LE(reserved, 9);\n    return buf;\n  }\n\n  /**\n   * Full ZIP extra field record: HeaderID + TSize + payload (15 bytes for v1).\n   */\n  static buildExtraFieldRecordV1(\n    algorithm: number = NEO_CRYPTO_ALGORITHM_AES256_V1,\n    flags: number = 0,\n    reserved: number = 0\n  ): Buffer {\n    const buf = Buffer.alloc(NEO_CRYPTO_EXTRA_FIELD_SIZE);\n    buf.writeUInt16LE(HDR_ID.NEO_CRYPTO, 0);\n    buf.writeUInt16LE(NEO_CRYPTO_PAYLOAD_V1, 2);\n    NeoCrypto.buildPayloadV1(algorithm, flags, reserved).copy(buf, 4);\n    return buf;\n  }\n\n  /**\n   * Parse NEO payload (11 bytes after extra header id+len). Returns null if invalid.\n   */\n  static tryParsePayload(data: Buffer): NeoCryptoParsedPayload | null {\n    if (data.length < NEO_CRYPTO_PAYLOAD_V1) {\n      return null;\n    }\n    if (\n      data[0] !== NEO_CRYPTO_MAGIC_BYTES[0] ||\n      data[1] !== NEO_CRYPTO_MAGIC_BYTES[1] ||\n      data[2] !== NEO_CRYPTO_MAGIC_BYTES[2] ||\n      data[3] !== NEO_CRYPTO_MAGIC_BYTES[3]\n    ) {\n      return null;\n    }\n    return {\n      payloadVersion: data.readUInt8(4),\n      algorithm: data.readUInt16LE(5),\n      flags: data.readUInt16LE(7),\n      reserved: data.readUInt16LE(9),\n    };\n  }\n\n  static parsePayload(data: Buffer): NeoCryptoParsedPayload {\n    const p = NeoCrypto.tryParsePayload(data);\n    if (!p || p.payloadVersion !== 1) {\n      throw new Error('NeoEncrypt: invalid NEO crypto extra field');\n    }\n    return p;\n  }\n\n  /**\n   * Encrypt compressed data (algorithm 1 = same bytes as WinZip AES-256 in AesCrypto).\n   */\n  static encryptBuffer(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    return AesCrypto.encryptBuffer(entry, compressedData, password);\n  }\n\n  /**\n   * Decrypt NeoEncrypt file data (full salt+verifier+ciphertext+hmac).\n   */\n  static decryptBuffer(entry: ZipEntry, fullPayload: Buffer, password: string): Buffer {\n    return AesCrypto.decryptBuffer(entry, fullPayload, password);\n  }\n}\n", "// ======================================\n//\tZipkitCompress.ts - Compression Module\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// LOGGING INSTRUCTIONS:\n// ---------------------\n// To enable/disable logging, set loggingEnabled to true/false in the class:\n//   private static loggingEnabled: boolean = true;  // Enable logging\n//   private static loggingEnabled: boolean = false; // Disable logging\n//\n// Logging respects the global Logger level (debug, info, warn, error, silent).\n// Logger level is automatically set to 'debug' when loggingEnabled is true.\n//\n\nconst pako = require('pako');\nimport { ZstdNode } from '../node/ZstdNode';\nimport Zipkit from './Zipkit';\nimport { Logger } from './components/Logger';\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { CMP_METHOD, GP_FLAG, ENCRYPT_HDR_SIZE } from './constants/Headers';\nimport { HashCalculator } from './components/HashCalculator';\nimport { ZipCrypto } from './encryption/ZipCrypto';\nimport { AesCrypto } from './encryption/AesCrypto';\nimport { NeoCrypto, NEO_CRYPTO_ALGORITHM_AES256_V1 } from './encryption/NeoCrypto';\n\n/**\n * Options for compressing files in a ZIP archive\n */\nexport interface CompressOptions {\n  level?: number;             // Compression level (1-9, 0=store)\n  password?: string | null;   // Password for encryption\n  encryptionMethod?: 'aes256' | 'zipcrypto' | 'neo-aes256'; // default NeoEncrypt when password set; 'aes256' = WinZip AE (method 99); 'neo-aes256' = Extra Field 0x024E\n  useSHA256?: boolean;        // Whether to calculate SHA256 hash default is false\n  useZstd?: boolean;          // Use Zstandard (method 93); default false (Deflate). Node \u2265 22.15 required when true.\n  bufferSize?: number;        // Override default buffer size\n}\n\n/**\n * Callbacks for ZIP file creation process\n * Buffer-based only - no file I/O operations\n */\nexport interface CreateZipOptions {\n  onError?: (error: Error) => void;              // Called when an error occurs\n  onEntryDone?: (entry: ZipEntry, status: string) => void;  // Called when entry processing completes\n  onOutputBuffer?: (data: Buffer) => Promise<void>;       // Called to write output data\n}\n\n/**\n * Compression handler for ZIP files\n * Supports Deflate, Zstandard, and Store methods\n */\nexport class ZipCompress {\n  private zipkit: Zipkit;\n  private debug: boolean;\n\n  // Class-level logging control - set to true to enable logging\n  private static loggingEnabled: boolean = false;\n\n  /**\n   * Internal logging method - only logs if class logging is enabled\n   */\n  private log(...args: any[]): void {\n    if (ZipCompress.loggingEnabled) {\n      Logger.debug(`[ZipCompress]`, ...args);\n    }\n  }\n\n  /**\n   * Creates a new ZipCompress instance\n   * @param zipkit - Zipkit instance to use for ZIP operations\n   */\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n    // Debug disabled by default (controlled by class-level logging)\n    this.debug = false;\n    // If logging is enabled, ensure Logger level is set to debug\n    if (ZipCompress.loggingEnabled) {\n      Logger.setLevel('debug');\n    }\n    this.log(`ZipCompress initialized`);\n  }\n\n  /**\n   * Compresses data for a ZIP entry (Buffer-based only)\n   * @param entry - ZIP entry to compress\n   * @param data - Buffer containing data to compress\n   * @param options - Compression options\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Buffer containing compressed data\n   */\n  async compressData(entry: ZipEntry, data: Buffer, options?: CompressOptions, onOutputBuffer?: (data: Buffer) => Promise<void>): Promise<Buffer> {\n    this.log(`compressData() called for entry: ${entry.filename}`);\n    \n    // Set uncompressed size if not already set\n    if (!entry.uncompressedSize || entry.uncompressedSize === 0) {\n      entry.uncompressedSize = data.length;\n    }\n    const totalSize = data.length;\n    const bufferSize = options?.bufferSize || this.zipkit.getBufferSize(); // Use Zipkit's bufferSize\n    \n    this.log(`Compressing ${totalSize} bytes for entry: ${entry.filename}`);\n    this.log(`Compression options:`, { level: options?.level, useZstd: options?.useZstd, bufferSize });\n    \n    // Determine compression method\n    let compressionMethod: number;\n    \n    if (options?.level === 0) {\n      compressionMethod = CMP_METHOD.STORED;\n      this.log(`Using STORED method (no compression)`);\n    } else if (options?.useZstd) {\n      // ZSTD fallback to STORED if file too small\n      if (totalSize < 100) {\n        compressionMethod = CMP_METHOD.STORED;\n        this.log(`ZSTD fallback to STORED (file too small: ${totalSize} bytes)`);\n      } else {\n        compressionMethod = CMP_METHOD.ZSTD;\n        this.log(`Using ZSTD method (zstd compression)`);\n      }\n    } else {\n      compressionMethod = CMP_METHOD.DEFLATED;\n      this.log(`Using DEFLATED method (default compression)`);\n    }\n    \n    entry.cmpMethod = compressionMethod;\n    \n    // Initialize hash calculator\n    const needsHashCalculation = (!entry.crc || entry.crc === 0) || (options?.useSHA256 && !entry.sha256);\n    const hashCalculator = needsHashCalculation ? new HashCalculator({ useSHA256: options?.useSHA256 && !entry.sha256 || false }) : null;\n    \n    // Calculate hashes if needed\n    if (hashCalculator) {\n      hashCalculator.update(data);\n      hashCalculator.applyToEntry(entry, {\n        setCrc: !entry.crc || entry.crc === 0,\n        setSha256: !!(options?.useSHA256 && !entry.sha256),\n      });\n      this.log(`Final hashes: CRC32=0x${entry.crc.toString(16).padStart(8, '0')}, SHA256=${entry.sha256 || 'N/A'}`);\n    }\n    \n    // Encrypt if password provided\n    const enc = options?.encryptionMethod;\n    const useZipCrypto = enc === 'zipcrypto';\n    // Explicit WinZip AE only when encryptionMethod is 'aes256'. Otherwise NeoEncrypt (default).\n    const useAes = enc === 'aes256';\n    const useNeo = !!options?.password && !useZipCrypto && !useAes;\n    if (options?.password) {\n      const label = useZipCrypto ? 'ZipCrypto' : useNeo ? 'NeoEncrypt (AES-256)' : 'WinZip AES-256';\n      this.log(`Encrypting compressed data for entry: ${entry.filename} (method: ${label})`);\n      entry.bitFlags = (entry.bitFlags || 0) | GP_FLAG.ENCRYPTED;\n      entry.isEncrypted = true;\n    }\n    \n    // Compress data based on method\n    let compressedData: Buffer;\n    const methodName = compressionMethod === CMP_METHOD.ZSTD ? 'ZSTD' : compressionMethod === CMP_METHOD.DEFLATED ? 'DEFLATED' : 'STORED';\n    \n    if (compressionMethod === CMP_METHOD.STORED) {\n      compressedData = data;\n    } else {\n      this.log(`Processing sequence for ${methodName}: [HASH] -> [COMPRESS] -> [OUTPUT]`);\n      this.log(`Compressing: method=${methodName}, input=${totalSize} bytes, buffer size=${bufferSize} bytes`);\n      this.log(`Calculating hashes: CRC32=${!entry.crc || entry.crc === 0}, SHA256=${options?.useSHA256}`);\n      \n      if (compressionMethod === CMP_METHOD.ZSTD) {\n        compressedData = await this.zstdCompress(data, options, bufferSize, entry, onOutputBuffer);\n      } else {\n        compressedData = await this.deflateCompress(data, options, bufferSize, entry, onOutputBuffer);\n      }\n    }\n    \n    // Encrypt compressed data if password provided\n    if (options?.password) {\n      if (useNeo) {\n        compressedData = this.encryptCompressedDataNeo(entry, compressedData, options.password);\n      } else if (useAes) {\n        compressedData = this.encryptCompressedDataAes(entry, compressedData, options.password);\n      } else {\n        compressedData = this.encryptCompressedData(entry, compressedData, options.password);\n      }\n    }\n    \n    entry.compressedSize = compressedData.length;\n    \n    return compressedData;\n  }\n\n  /**\n   * Compress data using deflate algorithm with chunked processing\n   * @param data - Data to compress (Buffer or chunked reader)\n   * @param options - Compression options\n   * @param bufferSize - Buffer size for chunked processing\n   * @param entry - ZIP entry being compressed\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Buffer containing compressed data\n   */\n  async deflateCompress(\n    data: Buffer | { totalSize: number, onReadChunk: (position: number, size: number) => Buffer, onOutChunk: (chunk: Buffer) => void },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    this.log(`deflateCompress() called - entry: ${entry?.filename ?? 'unknown'}, bufferSize: ${bufferSize}, level: ${options?.level ?? 6}`);\n    \n    const effectiveBufferSize = bufferSize || this.zipkit.getBufferSize();\n    const level = options?.level ?? 6;\n    \n    // Handle chunked reader\n    if (typeof data === 'object' && 'totalSize' in data && 'onReadChunk' in data) {\n      // Chunked reader mode - not implemented in simplified version\n      throw new Error('Chunked reader mode not supported in ZipCompress');\n    }\n    \n    // For small data, use synchronous deflate\n    if (data.length <= effectiveBufferSize) {\n      return this.deflate(data, options);\n    }\n    \n    // For large data, use chunked deflate\n    const deflator = new pako.Deflate({ level, raw: true });\n    const compressedChunks: Buffer[] = [];\n    let totalProcessed = 0;\n    let totalCompressedSize = 0;\n    \n    try {\n      // Process data in chunks\n      for (let offset = 0; offset < data.length; offset += effectiveBufferSize) {\n        const chunk = data.slice(offset, offset + effectiveBufferSize);\n        const isLast = offset + effectiveBufferSize >= data.length;\n        \n        deflator.push(chunk, isLast);\n        \n        // Collect compressed chunks\n        if (deflator.result && deflator.result.length > 0) {\n          const compressedChunk = Buffer.from(deflator.result);\n          compressedChunks.push(compressedChunk);\n          totalCompressedSize += compressedChunk.length;\n          \n          // Stream output if callback provided\n          if (onOutputBuffer) {\n            await onOutputBuffer(compressedChunk);\n          }\n        }\n        \n        totalProcessed += chunk.length;\n      }\n      \n      // Calculate compression ratio\n      const ratio = totalProcessed > 0 ? Math.round((totalCompressedSize / totalProcessed) * 100) : 0;\n      this.log(`Final hashes: CRC32=0x${entry?.crc?.toString(16).padStart(8, '0')}, SHA256=${entry?.sha256 || 'N/A'}`);\n      this.log(`Deflate compression complete: ${totalCompressedSize} bytes from ${totalProcessed} bytes (ratio=${ratio}%)`);\n      \n      return Buffer.concat(compressedChunks);\n    } catch (e) {\n      throw new Error(`Deflate compression failed: ${e instanceof Error ? e.message : String(e)}`);\n    }\n  }\n\n  /**\n   * Compress data using deflate algorithm (synchronous, small buffers only)\n   * @param inbuf - Buffer containing data to compress\n   * @param options - Compression options\n   * @returns Buffer containing compressed data\n   */\n  deflate(inbuf: Buffer, options?: CompressOptions): Buffer {\n    this.log(`deflate() called with buffer size: ${inbuf.length}, level: ${options?.level ?? 6}`);\n    const level = options?.level ?? 6;\n    const result = pako.deflateRaw(inbuf, { level });\n    const ratio = inbuf.length > 0 ? Math.round((result.length / inbuf.length) * 100) : 0;\n    this.log(`Deflate compression complete: ${result.length} bytes from ${inbuf.length} bytes (ratio=${ratio}%)`);\n    return Buffer.from(result.buffer, result.byteOffset, result.byteLength);\n  }\n\n  /**\n   * Compress data using Zstandard via Node native zlib chunked streaming.\n   * Not available in browser builds (throws).\n   */\n  async zstdCompress(\n    input: Buffer | { totalSize: number, readChunk: (position: number, size: number) => Buffer },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    this.log(`zstdCompress() called - entry: ${entry?.filename ?? 'unknown'}, bufferSize: ${bufferSize}, level: ${options?.level ?? 6}`);\n\n    const effectiveBufferSize = bufferSize || this.zipkit.getBufferSize();\n    const level = options?.level ?? 6;\n    const isBuffer = Buffer.isBuffer(input);\n    const totalSize = isBuffer ? input.length : input.totalSize;\n\n    if (!totalSize) {\n      throw new Error('ZSTD compression: empty input buffer');\n    }\n\n    if (options?.level === 0) {\n      if (isBuffer) {\n        if (onOutputBuffer) {\n          await onOutputBuffer(input);\n        }\n        return input;\n      }\n      const chunks: Buffer[] = [];\n      let position = 0;\n      while (position < totalSize) {\n        const size = Math.min(effectiveBufferSize, totalSize - position);\n        const chunk = input.readChunk(position, size);\n        if (onOutputBuffer) {\n          await onOutputBuffer(chunk);\n        } else {\n          chunks.push(chunk);\n        }\n        position += chunk.length;\n      }\n      return onOutputBuffer ? Buffer.alloc(0) : Buffer.concat(chunks);\n    }\n\n    const readChunk = isBuffer\n      ? (position: number, size: number) => input.subarray(position, position + size)\n      : input.readChunk.bind(input);\n\n    const collected: Buffer[] = [];\n    const compressedSize = await ZstdNode.compressChunks(\n      readChunk,\n      totalSize,\n      effectiveBufferSize,\n      level,\n      undefined,\n      async (compressed) => {\n        if (onOutputBuffer) {\n          await onOutputBuffer(compressed);\n        } else {\n          collected.push(compressed);\n        }\n      }\n    );\n\n    if (entry) {\n      entry.compressedSize = compressedSize;\n    }\n\n    if (onOutputBuffer) {\n      return Buffer.alloc(0);\n    }\n    return Buffer.concat(collected);\n  }\n\n  /**\n   * Encrypt compressed data using PKZIP encryption\n   * @param entry - ZIP entry to encrypt\n   * @param compressedData - Compressed data to encrypt\n   * @param password - Password for encryption\n   * @returns Buffer containing encrypted data (includes 12-byte header)\n   */\n  encryptCompressedData(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedData() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n    \n    const zipCrypto = new ZipCrypto();\n    const encryptedData = zipCrypto.encryptBuffer(entry, compressedData, password);\n    \n    this.log(`Encryption complete: ${compressedData.length} bytes compressed -> ${encryptedData.length} bytes encrypted (includes ${ENCRYPT_HDR_SIZE}-byte header)`);\n    \n    return encryptedData;\n  }\n\n  /**\n   * NeoEncrypt: same ciphertext as WinZip AES stream; standard cmpMethod + NEO extra (0x024E).\n   */\n  encryptCompressedDataNeo(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedDataNeo() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n\n    const encryptedData = NeoCrypto.encryptBuffer(entry, compressedData, password);\n\n    entry.neoCryptoPayloadVersion = 1;\n    entry.neoCryptoAlgorithm = NEO_CRYPTO_ALGORITHM_AES256_V1;\n    entry.neoCryptoFlags = 0;\n\n    this.log(`NeoEncrypt encryption complete: ${compressedData.length} bytes -> ${encryptedData.length} bytes`);\n\n    return encryptedData;\n  }\n\n  /**\n   * Encrypt compressed data using WinZip AES-256\n   * Sets compression method to 99, stores real method in entry for the 0x9901 extra field\n   */\n  encryptCompressedDataAes(entry: ZipEntry, compressedData: Buffer, password: string): Buffer {\n    this.log(`encryptCompressedDataAes() called for entry: ${entry.filename}, compressed size: ${compressedData.length}`);\n\n    const encryptedData = AesCrypto.encryptBuffer(entry, compressedData, password);\n\n    // Store the real compression method and switch to method 99\n    entry.realCmpMethod = entry.cmpMethod;\n    entry.cmpMethod = CMP_METHOD.AES_ENCRYPT;\n    entry.aesVersion = 1; // AE-1: CRC is stored\n    entry.aesStrength = 3; // AES-256\n\n    this.log(`AES-256 encryption complete: ${compressedData.length} bytes -> ${encryptedData.length} bytes (salt+verifier+data+hmac)`);\n\n    return encryptedData;\n  }\n\n  /**\n   * Compress file data in memory and return ZIP entry information as Buffer\n   * @param entry - ZIP entry to compress\n   * @param fileData - File data buffer to compress\n   * @param cmpOptions - Compression options\n   * @returns Buffer containing local header + compressed data\n   */\n  async compressFileBuffer(\n    entry: ZipEntry,\n    fileData: Buffer,\n    cmpOptions?: CompressOptions\n  ): Promise<Buffer> {\n    this.log(`compressFileBuffer() called for entry: ${entry.filename}, size: ${fileData.length}`);\n    \n    // Set uncompressed size\n    entry.uncompressedSize = fileData.length;\n    \n    // Initialize hash calculator\n    const hashCalculator = new HashCalculator({ useSHA256: cmpOptions?.useSHA256 || false });\n    hashCalculator.update(fileData);\n    \n    // Set hashes\n    hashCalculator.applyToEntry(entry, {\n      setCrc: true,\n      setSha256: !!cmpOptions?.useSHA256,\n    });\n    if (entry.sha256) {\n      this.log(`SHA-256 calculated: ${entry.sha256}`);\n    }\n    \n    // compressData already handles encryption when password is provided\n    return await this.compressData(entry, fileData, cmpOptions);\n  }\n}\n", "/**\n * Detect legacy NeoZipKit WASM zstd (`@oneidentity/zstd-js`).\n *\n * That codec wrote valid-looking zstd frames but declared Frame_Content_Size as\n * `uncompressed_size + 18`. Standard libzstd / Node zlib decode to the real\n * payload plus 18 trailing zero bytes. CRC of the truncated payload matches\n * the ZIP entry CRC.\n *\n * Header-only checks do not require decompressing. Verified checks decompress\n * with native zlib and confirm trailing zeros + optional CRC.\n */\n\nimport { ZstdNode } from './ZstdNode';\nimport { HashCalculator } from '../core/components/HashCalculator';\n\n/** Fixed extra bytes declared/emitted by the broken WASM codec. */\nexport const LEGACY_WASM_ZSTD_PADDING = 18;\n\nconst ZSTD_MAGIC = Buffer.from([0x28, 0xb5, 0x2f, 0xfd]);\n\nexport type LegacyZstdConfidence = 'none' | 'header' | 'verified';\n\nexport interface LegacyZstdDetectResult {\n  /** True when this looks like (or verifies as) legacy WASM zstd. */\n  isLegacyWasm: boolean;\n  /** How the decision was made. */\n  confidence: LegacyZstdConfidence;\n  /** Parsed Frame_Content_Size, if present in the frame header. */\n  frameContentSize: number | null;\n  /** Expected plaintext size from the ZIP entry (or caller). */\n  expectedUncompressedSize: number;\n  /** Declared/observed padding past expected size (typically 18). */\n  paddingBytes: number;\n  /** Human-readable reason. */\n  reason: string;\n}\n\nexport interface DetectLegacyZstdOptions {\n  /**\n   * When true (default), decompress with native zlib and confirm\n   * trailing zeros (+ optional CRC) instead of trusting the header alone.\n   */\n  verify?: boolean;\n  /** ZIP CRC-32 of the original uncompressed data (strengthens verified check). */\n  crc?: number;\n}\n\n/**\n * Read Frame_Content_Size from a zstd frame header, or null if absent / unparseable.\n * @see https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md\n */\nexport function parseZstdFrameContentSize(compressed: Buffer): number | null {\n  if (!compressed || compressed.length < 6) {\n    return null;\n  }\n  if (\n    compressed[0] !== ZSTD_MAGIC[0] ||\n    compressed[1] !== ZSTD_MAGIC[1] ||\n    compressed[2] !== ZSTD_MAGIC[2] ||\n    compressed[3] !== ZSTD_MAGIC[3]\n  ) {\n    return null;\n  }\n\n  const descriptor = compressed[4];\n  const fcsFlag = (descriptor >> 6) & 0x3;\n  const singleSegment = ((descriptor >> 5) & 0x1) === 1;\n  const dictIdFlag = descriptor & 0x3;\n  const dictIdSizes = [0, 1, 2, 4];\n  let pos = 5 + dictIdSizes[dictIdFlag];\n\n  if (fcsFlag === 0) {\n    if (!singleSegment) {\n      return null;\n    }\n    if (pos >= compressed.length) {\n      return null;\n    }\n    return compressed[pos];\n  }\n\n  const fcsSizes = [0, 2, 4, 8];\n  const n = fcsSizes[fcsFlag];\n  if (pos + n > compressed.length) {\n    return null;\n  }\n\n  let fcs: number;\n  if (n === 2) {\n    fcs = compressed.readUInt16LE(pos);\n  } else if (n === 4) {\n    fcs = compressed.readUInt32LE(pos);\n  } else {\n    const lo = compressed.readUInt32LE(pos);\n    const hi = compressed.readUInt32LE(pos + 4);\n    // Content sizes that do not fit in JS safe integers are not our legacy case.\n    if (hi !== 0) {\n      return null;\n    }\n    fcs = lo;\n  }\n\n  // Spec: when FCS_Flag == 1, stored value is (size - 256).\n  if (fcsFlag === 1) {\n    fcs += 256;\n  }\n  return fcs;\n}\n\n/**\n * Fast header heuristic: FCS === expectedUncompressedSize + 18.\n */\nexport function looksLikeLegacyWasmZstd(\n  compressed: Buffer,\n  expectedUncompressedSize: number\n): boolean {\n  if (expectedUncompressedSize < 0 || !Number.isFinite(expectedUncompressedSize)) {\n    return false;\n  }\n  const fcs = parseZstdFrameContentSize(compressed);\n  if (fcs === null) {\n    return false;\n  }\n  return fcs === expectedUncompressedSize + LEGACY_WASM_ZSTD_PADDING;\n}\n\nfunction crc32Of(data: Buffer): number {\n  const h = new HashCalculator();\n  h.update(data);\n  return h.finalizeCRC32();\n}\n\n/**\n * Detect legacy WASM zstd frames for a single compressed payload.\n */\nexport async function detectLegacyWasmZstd(\n  compressed: Buffer,\n  expectedUncompressedSize: number,\n  options?: DetectLegacyZstdOptions\n): Promise<LegacyZstdDetectResult> {\n  const expected = expectedUncompressedSize >>> 0;\n  const fcs = parseZstdFrameContentSize(compressed);\n  const headerMatch =\n    fcs !== null && fcs === expected + LEGACY_WASM_ZSTD_PADDING;\n\n  const base = {\n    frameContentSize: fcs,\n    expectedUncompressedSize: expected,\n    paddingBytes: LEGACY_WASM_ZSTD_PADDING,\n  };\n\n  if (!headerMatch && options?.verify === false) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason:\n        fcs === null\n          ? 'No Frame_Content_Size in zstd header (or not a zstd frame)'\n          : `Frame_Content_Size ${fcs} does not equal expected ${expected} + ${LEGACY_WASM_ZSTD_PADDING}`,\n    };\n  }\n\n  if (options?.verify === false) {\n    return {\n      ...base,\n      isLegacyWasm: true,\n      confidence: 'header',\n      reason: `Frame_Content_Size is expected+${LEGACY_WASM_ZSTD_PADDING} (legacy WASM heuristic)`,\n    };\n  }\n\n  // Verified path (default): decompress and check padding / CRC.\n  let decoded: Buffer;\n  try {\n    decoded = await ZstdNode.decompress(compressed);\n  } catch (e) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason: `Native decompress failed: ${e instanceof Error ? e.message : String(e)}`,\n    };\n  }\n\n  const pad = decoded.length - expected;\n  const trailingZeros =\n    pad === LEGACY_WASM_ZSTD_PADDING &&\n    decoded.subarray(expected).equals(Buffer.alloc(LEGACY_WASM_ZSTD_PADDING));\n  const truncated = decoded.subarray(0, Math.min(expected, decoded.length));\n  const crcOk =\n    options?.crc === undefined ||\n    options.crc === 0 ||\n    crc32Of(truncated) === (options.crc >>> 0);\n\n  if (trailingZeros && crcOk && decoded.length === expected + LEGACY_WASM_ZSTD_PADDING) {\n    return {\n      ...base,\n      isLegacyWasm: true,\n      confidence: 'verified',\n      reason:\n        options?.crc && options.crc !== 0\n          ? `Decoded length is +${LEGACY_WASM_ZSTD_PADDING} with trailing zeros; truncated CRC matches`\n          : `Decoded length is +${LEGACY_WASM_ZSTD_PADDING} with trailing zeros`,\n    };\n  }\n\n  if (headerMatch && !trailingZeros) {\n    return {\n      ...base,\n      isLegacyWasm: false,\n      confidence: 'none',\n      reason:\n        'Header suggested legacy WASM but decoded payload did not have 18 trailing zeros',\n    };\n  }\n\n  return {\n    ...base,\n    isLegacyWasm: false,\n    confidence: 'none',\n    paddingBytes: Math.max(0, pad),\n    reason:\n      decoded.length === expected\n        ? 'Standard zstd frame (decoded size matches expected)'\n        : `Decoded size ${decoded.length} does not match legacy pattern (expected ${expected} or ${expected + LEGACY_WASM_ZSTD_PADDING})`,\n  };\n}\n\n/**\n * Truncate plaintext if it matches the legacy +18 zero padding pattern.\n * Returns the original buffer when not legacy-shaped.\n */\nexport function repairLegacyWasmZstdPlaintext(\n  decoded: Buffer,\n  expectedUncompressedSize: number,\n  crc?: number\n): { repaired: Buffer; wasLegacy: boolean } {\n  const expected = expectedUncompressedSize >>> 0;\n  if (\n    decoded.length === expected + LEGACY_WASM_ZSTD_PADDING &&\n    decoded.subarray(expected).equals(Buffer.alloc(LEGACY_WASM_ZSTD_PADDING))\n  ) {\n    const repaired = decoded.subarray(0, expected);\n    if (crc !== undefined && crc !== 0) {\n      if (crc32Of(repaired) !== (crc >>> 0)) {\n        return { repaired: decoded, wasLegacy: false };\n      }\n    }\n    return { repaired, wasLegacy: true };\n  }\n  if (decoded.length > expected && expected > 0) {\n    // Match Rust extract behavior: bound to declared uncompressed size for zstd.\n    const repaired = decoded.subarray(0, expected);\n    if (crc !== undefined && crc !== 0 && crc32Of(repaired) === (crc >>> 0)) {\n      return { repaired, wasLegacy: true };\n    }\n  }\n  return { repaired: decoded, wasLegacy: false };\n}\n\nexport const LegacyZstd = {\n  LEGACY_WASM_ZSTD_PADDING,\n  parseZstdFrameContentSize,\n  looksLikeLegacyWasmZstd,\n  detectLegacyWasmZstd,\n  repairLegacyWasmZstdPlaintext,\n};\n\nexport default LegacyZstd;\n", "// ======================================\n//\tZipDecompress.ts - Decompression Module\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// LOGGING INSTRUCTIONS:\n// ---------------------\n// To enable/disable logging, set loggingEnabled to true/false in the class:\n//   private static loggingEnabled: boolean = true;  // Enable logging\n//   private static loggingEnabled: boolean = false; // Disable logging\n//\n// Logging respects the global Logger level (debug, info, warn, error, silent).\n// Logger level is automatically set to 'debug' when loggingEnabled is true.\n//\n\nconst pako = require('pako');\nimport { ZstdNode } from '../node/ZstdNode';\nimport { repairLegacyWasmZstdPlaintext } from '../node/LegacyZstd';\nimport Zipkit from './Zipkit';\nimport { Logger } from './components/Logger';\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { CMP_METHOD } from './constants/Headers';\nimport { ZipCrypto } from './encryption/ZipCrypto';\nimport { AesCrypto } from './encryption/AesCrypto';\nimport { HashCalculator } from './components/HashCalculator';\n\nexport interface DecompressionResult {\n  success: boolean;\n  data?: Buffer;\n  error?: string;\n}\n\nexport interface DecompressionOptions {\n  method: number; // Compression method code (0=stored, 8=deflate, 93=zstd)\n  debug?: boolean; // Enable debug logging\n}\n\n/**\n * ZipDecompress - Unified Decompression Module (Internal to Zipkit)\n * Consolidates decompression functionality from ZipCompress\n * Supports deflate, zstd, and stored compression methods with chunked processing\n * \n * This class is internal to Zipkit and should not be used directly.\n * Use Zipkit methods instead.\n */\nclass ZipDecompress {\n  private zipkit: Zipkit;\n  private debug: boolean;\n\n  // Class-level logging control - set to true to enable logging\n  private static loggingEnabled: boolean = false;\n\n  /**\n   * Internal logging method - only logs if class logging is enabled\n   */\n  private log(...args: any[]): void {\n    if (ZipDecompress.loggingEnabled) {\n      Logger.debug(`[ZipDecompress]`, ...args);\n    }\n  }\n\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n    // Debug disabled by default\n    this.debug = false;\n    // If logging is enabled, ensure Logger level is set to debug\n    if (ZipDecompress.loggingEnabled) {\n      Logger.setLevel('debug');\n    }\n  }\n\n  /**\n   * Extract file data (Buffer-based ZIP only)\n   * Public method that validates buffer mode and extracts entry\n   * \n   * @param entry ZIP entry to extract\n   * @param skipHashCheck Skip hash verification (CRC-32 or SHA-256)\n   * @returns Promise resolving to extracted data as Buffer, or null if failed\n   * @throws Error if not a Buffer-based ZIP\n   */\n  async extract(entry: ZipEntry, skipHashCheck?: boolean): Promise<Buffer | null> {\n    if (!this.zipkit.hasInBuffer()) {\n      throw new Error('extract() requires Buffer-based ZIP. Use ZipkitNode.extractToFile() for file-based ZIP or call loadZip() first.');\n    }\n    \n    this.log(`extract() called for entry: ${entry.filename}, method: ${entry.cmpMethod}, skipHashCheck: ${skipHashCheck}`);\n    \n    const buffer = this.zipkit.ensureBuffer();\n    \n    // Decrypt if needed using password on zipkit instance\n    let fdata = this.zipkit.parseLocalHeader(entry, buffer);\n    const password = (this.zipkit as any)?.password;\n    const isAes = entry.aesVersion > 0 || entry.cmpMethod === CMP_METHOD.AES_ENCRYPT;\n    const isNeo = entry.neoCryptoAlgorithm > 0;\n    \n    if ((entry as any).isEncrypted && password) {\n      this.log(`Starting in-memory decryption for entry: ${entry.filename} (${isAes || isNeo ? 'AES-256 stream (WinZip or Neo)' : 'ZipCrypto'})`);\n\n      if (isAes || isNeo) {\n        fdata = AesCrypto.decryptBuffer(entry, fdata, password);\n      } else {\n        const zipCrypto = new ZipCrypto();\n        fdata = zipCrypto.decryptBuffer(entry, buffer, fdata, password);\n      }\n      \n      this.log(`Decryption successful, decrypted compressed data length: ${fdata.length}`);\n    }\n\n    if (fdata.length === 0) {\n      return null;\n    }\n\n    // For WinZip AES method 99, use realCmpMethod; NeoEncrypt already uses standard cmpMethod in header\n    // For AE-2 (aesVersion=2), skip CRC check since CRC is stored as 0\n    const skipHash = isAes && entry.aesVersion === 2 ? true : skipHashCheck;\n    return this.unCompress(fdata, entry, skipHash);\n  }\n\n\n\n  /**\n   * Inflate data using pako (internal use only)\n   */\n  private inflate(data: Buffer): Buffer {\n    this.log(`inflate() called with ${data.length} bytes`);\n    const result = pako.inflateRaw(data);\n    return Buffer.from(result.buffer, result.byteOffset, result.byteLength);\n  }\n\n\n  /**\n   * Zstd decompress via Node native zlib, repairing legacy WASM +18 padding when present.\n   */\n  private async zstdDecompressSync(data: Buffer, entry?: ZipEntry): Promise<Buffer> {\n    this.log(`zstdDecompressSync() called with ${data.length} bytes`);\n\n    try {\n      let decompressed = await ZstdNode.decompress(data);\n      if (entry && entry.uncompressedSize > 0) {\n        const { repaired, wasLegacy } = repairLegacyWasmZstdPlaintext(\n          decompressed,\n          entry.uncompressedSize,\n          entry.crc\n        );\n        if (wasLegacy) {\n          this.log(\n            `Legacy WASM zstd padding repaired: ${decompressed.length} -> ${repaired.length} bytes`\n          );\n        }\n        decompressed = repaired;\n      }\n      this.log(`ZSTD decompression successful: ${data.length} bytes -> ${decompressed.length} bytes`);\n      return decompressed;\n    } catch (error) {\n      this.log(`ZSTD decompression failed: ${error}`);\n      throw new Error(`ZSTD decompression failed: ${error instanceof Error ? error.message : String(error)}`);\n    }\n  }\n\n  /**\n   * Uncompress compressed data buffer (synchronous for in-memory mode)\n   * Handles decompression and hash verification\n   * Internal method only\n   */\n  private async unCompress(\n    compressedData: Buffer,\n    entry: ZipEntry,\n    skipHashCheck?: boolean\n  ): Promise<Buffer> {\n    // For AES entries (method 99), use the real compression method\n    const method = entry.cmpMethod === CMP_METHOD.AES_ENCRYPT && entry.realCmpMethod >= 0\n      ? entry.realCmpMethod\n      : entry.cmpMethod;\n\n    this.log(`unCompress() called for entry: ${entry.filename}, method: ${method}, data length: ${compressedData.length}`);\n    \n    if (compressedData.length === 0) {\n      return Buffer.alloc(0);\n    }\n\n    let outBuf: Buffer;\n    if (method === CMP_METHOD.STORED) {\n      outBuf = compressedData;\n    } else if (method === CMP_METHOD.DEFLATED) {\n      outBuf = this.inflate(compressedData);\n    } else if (method === CMP_METHOD.ZSTD) {\n      outBuf = await this.zstdDecompressSync(compressedData, entry);\n    } else {\n      throw new Error(`Unsupported compression method: ${method}`);\n    }\n\n    // One pass: CRC + bare SHA-256 (0x014E) + v1 Merkle leaf \u2014 no second payload read\n    const hashCalc = new HashCalculator({ useSHA256: true });\n    hashCalc.update(outBuf);\n    const calculatedCRC = hashCalc.finalizeCRC32();\n    const calculatedHash = hashCalc.finalizeSHA256();\n    const leaf = hashCalc.finalizeMerkleLeafV1();\n    if (leaf) {\n      entry.merkleLeafV1 = leaf;\n    }\n\n    if (!skipHashCheck) {\n      if (entry.sha256) {\n        if (calculatedHash !== entry.sha256) {\n          throw new Error(Errors.INVALID_SHA256);\n        }\n      } else if (calculatedCRC !== entry.crc) {\n        throw new Error(Errors.INVALID_CRC);\n      }\n    }\n\n    return outBuf;\n  }\n\n}\n\n// Default export for internal use by Zipkit only\nexport default ZipDecompress;\n", "// ======================================\n//  MerkleRoot.ts \u2014 NeoZip APPNOTE \u00A76\n//  v0 (legacy Bitcoin-style) and v1 (RFC 6962\u2013style domain separation)\n// ======================================\n\nimport * as crypto from 'crypto';\nimport { isMetaInfPath } from '../constants/MetaPaths';\n\n/** Merkle algorithms defined in NEOZIP_APPNOTE.md \u00A76. */\nexport type MerkleAlgorithm = 'v0' | 'v1';\n\nexport interface MerkleContentEntry {\n  /** Central-directory path (UTF-8 string as stored or as known to the writer). */\n  path: string;\n  /**\n   * Uncompressed payload bytes (same bytes hashed into Extra Field 0x014E).\n   * Required for **v1** leaves when `merkleLeafV1` is absent. Optional for **v0** when `contentSha256` is set.\n   */\n  content?: Buffer | Uint8Array;\n  /**\n   * Bare SHA-256 of uncompressed payload (= Extra Field 0x014E), hex or 32-byte Buffer.\n   * Used as v0 leaf; for v1 this alone is **not** a leaf (see APPNOTE \u00A76.3).\n   */\n  contentSha256?: string | Buffer;\n  /**\n   * Precomputed APPNOTE \u00A76.3 v1 leaf: SHA-256(0x00 \u2016 uncompressed_bytes), hex or 32-byte Buffer.\n   * Produced in the same streaming pass as `contentSha256` (create/extract via HashCalculator).\n   * Preferred for v1 when present \u2014 no second content read.\n   */\n  merkleLeafV1?: string | Buffer;\n}\n\nconst LEAF_DOMAIN = Buffer.from([0x00]);\nconst NODE_DOMAIN = Buffer.from([0x01]);\n\nfunction sha256(data: Buffer | Uint8Array | Buffer[]): Buffer {\n  const h = crypto.createHash('sha256');\n  if (Array.isArray(data)) {\n    for (const part of data) {\n      h.update(part);\n    }\n  } else {\n    h.update(data);\n  }\n  return h.digest();\n}\n\nfunction asBuffer(data: Buffer | Uint8Array | string, encoding?: BufferEncoding): Buffer {\n  if (typeof data === 'string') {\n    return Buffer.from(data, encoding ?? 'hex');\n  }\n  return Buffer.isBuffer(data) ? data : Buffer.from(data);\n}\n\n/**\n * Normalize a ZIP entry path for v1 leaf ordering (APPNOTE \u00A76.3):\n * POSIX separators, strip leading `./` and `/`, Unicode NFC, UTF-8 byte order when compared.\n */\nexport function normalizeMerklePath(path: string): string {\n  let p = path.replace(/\\\\/g, '/');\n  if (p.startsWith('./')) {\n    p = p.slice(2);\n  }\n  while (p.startsWith('/')) {\n    p = p.slice(1);\n  }\n  if (typeof p.normalize === 'function') {\n    p = p.normalize('NFC');\n  }\n  return p;\n}\n\n/** Sort key for path comparison (UTF-8 byte order). */\nfunction pathSortKey(path: string, algorithm: MerkleAlgorithm): Buffer {\n  const normalized = algorithm === 'v1' ? normalizeMerklePath(path) : path;\n  return Buffer.from(normalized, 'utf8');\n}\n\n/** Bare content digest (= 0x014E value). */\nexport function contentDigest(content: Buffer | Uint8Array): Buffer {\n  return sha256(asBuffer(content));\n}\n\n/**\n * v0 leaf: SHA-256(uncompressed bytes) \u2014 same as Extra Field 0x014E.\n */\nexport function leafHashV0(contentOrDigest: Buffer | Uint8Array, isDigest = false): Buffer {\n  const buf = asBuffer(contentOrDigest);\n  return isDigest ? buf : sha256(buf);\n}\n\n/**\n * v1 leaf: SHA-256(0x00 \u2016 uncompressed_bytes).\n * Must not be confused with the bare 0x014E digest (APPNOTE \u00A76.3).\n */\nexport function leafHashV1(content: Buffer | Uint8Array): Buffer {\n  return sha256([LEAF_DOMAIN, asBuffer(content)]);\n}\n\n/**\n * Parent node hashes.\n * v0: SHA-256(H_left \u2016 H_right) \u2014 order preserved, no pair sorting.\n * v1: SHA-256(0x01 \u2016 H_left \u2016 H_right).\n */\nexport function parentHash(left: Buffer, right: Buffer, algorithm: MerkleAlgorithm): Buffer {\n  if (algorithm === 'v1') {\n    return sha256([NODE_DOMAIN, left, right]);\n  }\n  return sha256([left, right]);\n}\n\n/**\n * Fold an ordered list of leaf hashes into a single root (hex lowercase).\n * Odd-count rule:\n *  - v0: duplicate last leaf (Bitcoin-style)\n *  - v1: promote last node unhashed (RFC 6962\u2013style)\n */\nexport function merkleRootFromLeaves(leaves: Buffer[], algorithm: MerkleAlgorithm): string | null {\n  if (leaves.length === 0) {\n    return null;\n  }\n\n  let level: Buffer[] = leaves.map((l) => Buffer.from(l));\n\n  while (level.length > 1) {\n    const next: Buffer[] = [];\n    for (let i = 0; i + 1 < level.length; i += 2) {\n      next.push(parentHash(level[i], level[i + 1], algorithm));\n    }\n    if (level.length % 2 === 1) {\n      const last = level[level.length - 1];\n      if (algorithm === 'v0') {\n        // Duplicate last leaf, then hash the pair\n        next.push(parentHash(last, last, algorithm));\n      } else {\n        // Promote unhashed\n        next.push(last);\n      }\n    }\n    level = next;\n  }\n\n  return level[0].toString('hex');\n}\n\nfunction resolveLeaf(\n  entry: MerkleContentEntry,\n  algorithm: MerkleAlgorithm\n): Buffer | null {\n  if (algorithm === 'v0') {\n    if (entry.contentSha256) {\n      const d = asBuffer(entry.contentSha256, typeof entry.contentSha256 === 'string' ? 'hex' : undefined);\n      if (d.length !== 32) {\n        return null;\n      }\n      return d;\n    }\n    if (entry.content) {\n      return contentDigest(entry.content);\n    }\n    return null;\n  }\n\n  // v1: prefer precomputed domain-separated leaf from the same hashing pass as 0x014E\n  if (entry.merkleLeafV1) {\n    const d = asBuffer(\n      entry.merkleLeafV1,\n      typeof entry.merkleLeafV1 === 'string' ? 'hex' : undefined\n    );\n    if (d.length !== 32) {\n      return null;\n    }\n    return d;\n  }\n  // Domain-separated hash of uncompressed payload (re-hash only if leaf not available)\n  if (entry.content) {\n    return leafHashV1(entry.content);\n  }\n  return null;\n}\n\n/**\n * Compute archive Merkle root per APPNOTE \u00A76 from content entries\n * (caller already excluded META-INF/** if desired).\n *\n * @returns lowercase hex root, or null if no usable leaves\n */\nexport function computeArchiveMerkleRoot(\n  entries: MerkleContentEntry[],\n  algorithm: MerkleAlgorithm = 'v1'\n): string | null {\n  const prepared: { key: Buffer; leaf: Buffer }[] = [];\n\n  for (const entry of entries) {\n    if (isMetaInfPath(entry.path || '')) {\n      continue;\n    }\n    const leaf = resolveLeaf(entry, algorithm);\n    if (!leaf) {\n      continue;\n    }\n    prepared.push({\n      key: pathSortKey(entry.path || '', algorithm),\n      leaf,\n    });\n  }\n\n  if (prepared.length === 0) {\n    return null;\n  }\n\n  prepared.sort((a, b) => Buffer.compare(a.key, b.key));\n  return merkleRootFromLeaves(\n    prepared.map((p) => p.leaf),\n    algorithm\n  );\n}\n\n/**\n * Build v0 root from path + bare content digests only (0x014E extras).\n * Path order: central-directory bytes as stored (no NFC / strip).\n */\nexport function computeMerkleRootV0FromDigests(\n  entries: Array<{ path: string; sha256: string | Buffer }>\n): string | null {\n  return computeArchiveMerkleRoot(\n    entries.map((e) => ({ path: e.path, contentSha256: e.sha256 })),\n    'v0'\n  );\n}\n\n/**\n * Build v1 root from path + uncompressed payloads (APPNOTE \u00A76.3).\n * Paths are normalized before sorting.\n */\nexport function computeMerkleRootV1FromContents(\n  entries: Array<{ path: string; content: Buffer | Uint8Array }>\n): string | null {\n  return computeArchiveMerkleRoot(\n    entries.map((e) => ({ path: e.path, content: e.content })),\n    'v1'\n  );\n}\n\n/**\n * Build v1 root from path + precomputed domain-separated leaves (APPNOTE \u00A76.3).\n * Prefer this after create/extract when HashCalculator produced merkleLeafV1 in one stream pass.\n */\nexport function computeMerkleRootV1FromLeaves(\n  entries: Array<{ path: string; merkleLeafV1: string | Buffer }>\n): string | null {\n  return computeArchiveMerkleRoot(\n    entries.map((e) => ({ path: e.path, merkleLeafV1: e.merkleLeafV1 })),\n    'v1'\n  );\n}\n\n/**\n * Verify a declared root (APPNOTE \u00A76.4): try v1 first (when content or leaves available),\n * then v0 digests. Returns which algorithm matched, or null on failure.\n *\n * When only bare 0x014E digests are available, only v0 can match APPNOTE correctly.\n * Pass `merkleLeafV1` or content for full v1 verification without re-hashing from scratch\n * when leaves were computed in the decompress stream.\n */\nexport function matchMerkleRoot(\n  entries: MerkleContentEntry[],\n  declaredRoot: string\n): { algorithm: MerkleAlgorithm; security: 'high' | 'legacy' } | null {\n  const expected = declaredRoot.toLowerCase().replace(/^0x/, '');\n  if (!/^[0-9a-f]{64}$/.test(expected)) {\n    return null;\n  }\n\n  const hasV1Material = entries.some(\n    (e) =>\n      !isMetaInfPath(e.path || '') &&\n      (!!e.merkleLeafV1 || !!e.content)\n  );\n  if (hasV1Material) {\n    const v1 = computeArchiveMerkleRoot(entries, 'v1');\n    if (v1 && v1 === expected) {\n      return { algorithm: 'v1', security: 'high' };\n    }\n  }\n\n  const v0 = computeArchiveMerkleRoot(entries, 'v0');\n  if (v0 && v0 === expected) {\n    return { algorithm: 'v0', security: 'legacy' };\n  }\n\n  // If v1 was not tried (no leaves/content), v0 was the only attempt.\n  if (hasV1Material) {\n    return null;\n  }\n\n  return null;\n}\n\nexport default {\n  normalizeMerklePath,\n  contentDigest,\n  leafHashV0,\n  leafHashV1,\n  parentHash,\n  merkleRootFromLeaves,\n  computeArchiveMerkleRoot,\n  computeMerkleRootV0FromDigests,\n  computeMerkleRootV1FromContents,\n  computeMerkleRootV1FromLeaves,\n  matchMerkleRoot,\n};\n", "// ======================================\n//\tZipkit.ts - Enhanced Zipkit with Dual Mode Support\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n\nimport ZipEntry from './ZipEntry';\nimport Errors from './constants/Errors';\nimport { Logger } from './components/Logger';\nimport { NEOZIPKIT_INFO } from '../types';\nimport { ZipCompress, CompressOptions } from './ZipCompress';\nimport ZipDecompress from './ZipDecompress';\nimport { sha256, crc32 } from './encryption/ZipCrypto';\nimport {\n  computeArchiveMerkleRoot,\n  computeMerkleRootV0FromDigests,\n  computeMerkleRootV1FromContents,\n  computeMerkleRootV1FromLeaves,\n  leafHashV1,\n  type MerkleAlgorithm,\n} from './merkle/MerkleRoot';\nimport { \n  LOCAL_HDR,\n  ENCRYPT_HDR_SIZE,\n  CMP_METHOD,\n  CENTRAL_END, \n  CENTRAL_DIR, \n  ZIP64_CENTRAL_END, \n  ZIP64_CENTRAL_DIR ,\n  GP_FLAG,\n  TIMESTAMP_SUBMITTED,\n  TIMESTAMP_METADATA,\n  TOKENIZED_METADATA,\n  LOCAL_FILE_HEADER,\n  CENTRAL_FILE_HEADER,\n  CENTRAL_DIRECTORY_END,\n  HDR_ID\n} from './constants/Headers';\nimport {\n  findReservedMetaEntry,\n  isMetaInfPath,\n  isReservedMetaPath,\n} from './constants/MetaPaths';\n\n/**\n * Streaming file handle interface\n * Used for file-based ZIP operations in server environments\n */\nexport interface StreamingFileHandle {\n  read(buffer: Buffer, offset: number, length: number, position: number): Promise<number>;\n  stat(): Promise<{ size: number }>;\n  close(): Promise<void>;\n}\n\n// Re-export interfaces and constants (keep exports grouped at top)\nexport { \n  ZipEntry, \n  Errors, \n  CMP_METHOD, \n  TIMESTAMP_METADATA, \n  TIMESTAMP_SUBMITTED,\n  TOKENIZED_METADATA,\n  LOCAL_HDR,\n  ENCRYPT_HDR_SIZE,\n  CENTRAL_END, \n  CENTRAL_DIR, \n  ZIP64_CENTRAL_END, \n  ZIP64_CENTRAL_DIR,\n  GP_FLAG,\n  LOCAL_FILE_HEADER,\n  CENTRAL_FILE_HEADER,\n  CENTRAL_DIRECTORY_END,\n  HDR_ID\n};\nexport type { CompressOptions, CreateZipOptions } from './ZipCompress';\n\n/**\n * Configuration options for Zipkit instances\n * \n * Controls various aspects of ZIP file processing including memory usage,\n * chunk sizes for streaming operations, and debug logging.\n * \n * @interface ZipkitConfig\n * @property {number} [bufferSize] - Buffer size in bytes for streaming operations.\n *                                  Files larger than this size will be processed\n *                                  in chunks for memory efficiency. Default: 512KB (524288 bytes).\n * @property {boolean} [debug] - Enable debug logging for detailed diagnostic information.\n *                              When enabled, sets Logger level to 'debug'. Default: false.\n * \n * @example\n * const zip = new Zipkit({\n *   bufferSize: 512 * 1024,    // 512KB buffer\n *   debug: true\n * });\n */\nexport interface ZipkitConfig {\n  bufferSize?: number;         // For streaming mode (default: 512KB)\n  debug?: boolean;           // Enable debug logging\n}\n\n/**\n * Zipkit - Enhanced ZIP File Processing Library with Dual Mode Support\n * \n * Core ZIP file processing library supporting both buffer-based (in-memory) and\n * file-based (streaming) modes. See README.md for detailed documentation.\n * \n * @class Zipkit\n * @static {string} version - Library version string\n * @static {string} releaseDate - Library release date\n */\nexport default class Zipkit {\n  static readonly version = NEOZIPKIT_INFO.version;\n  static readonly releaseDate = NEOZIPKIT_INFO.releaseDate;\n\n  // Configuration\n  private config: ZipkitConfig;\n  \n  // In-memory mode data\n  private inBuffer: Buffer | null = null;\n  protected zipEntries: ZipEntry[] = []; // Protected: single source of truth for ZIP entry order (accessible by subclasses)\n  private centralDirSize: number = 0;\n  private centralDirOffset: number = 0;\n  \n  // Common data\n  private zipComment: string | null = null;\n  \n  // Private components (lazy-loaded)\n  private _zipkitCmp: ZipCompress | null = null;\n  private _zipkitDeCmp: ZipDecompress | null = null;\n\n  /**\n   * Creates a new Zipkit instance with optional configuration\n   * \n   * @param config - Optional configuration object (ZipkitConfig)\n   *   - bufferSize: Buffer size for streaming operations (default: 512KB)\n   *   - debug: Enable debug logging (default: false)\n   * \n   * @example\n   * const zip = new Zipkit({ bufferSize: 512 * 1024, debug: true });\n   */\n  constructor(config: ZipkitConfig = {}) {\n    this.config = {\n      bufferSize: config.bufferSize || 512 * 1024, // 512KB default (optimal for modern systems)\n      debug: config.debug || false // Default false\n    };\n\n    // Configure Logger based on debug setting\n    if (this.config.debug) {\n      Logger.setLevel('debug');\n    }\n    \n    // Note: ZipCompress and ZipDecompress are lazy-loaded when first accessed\n    // ZSTD codec is also lazily initialized on first use (module-level singleton)\n  }\n\n  /**\n   * Lazy-load ZipCompress instance\n   * @returns ZipCompress instance (created on first access)\n   */\n  private getZipCompress(): ZipCompress {\n    if (!this._zipkitCmp) {\n      this._zipkitCmp = new ZipCompress(this);\n    }\n    return this._zipkitCmp;\n  }\n\n  /**\n   * Lazy-load ZipDecompress instance\n   * @returns ZipDecompress instance (created on first access)\n   */\n  private getZipDecompress(): ZipDecompress {\n    if (!this._zipkitDeCmp) {\n      this._zipkitDeCmp = new ZipDecompress(this);\n    }\n    return this._zipkitDeCmp;\n  }\n\n  /**\n   * Get the configured buffer size for streaming operations\n   * @returns Buffer size in bytes (default: 512KB)\n   */\n  getBufferSize(): number {\n    return this.config.bufferSize || 512 * 1024; // 512KB default (optimal for modern systems)\n  }\n\n  /**\n   * Check if ZIP is loaded in buffer mode\n   * @returns true if buffer-based ZIP is loaded\n   */\n  hasInBuffer(): boolean {\n    return this.inBuffer !== null && this.inBuffer.length > 0;\n  }\n\n\n  // ============================================================================\n  // ZipCompress Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Compress data for a ZIP entry (Buffer-based only)\n   * Wrapper for ZipCompress.compressData()\n   * \n   * @param entry - ZIP entry to compress\n   * @param data - Buffer containing data to compress\n   * @param options - Compression options\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async compressData(\n    entry: ZipEntry,\n    data: Buffer,\n    options?: CompressOptions,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().compressData(entry, data, options, onOutputBuffer);\n  }\n\n  /**\n   * Compress data using deflate algorithm with chunked processing\n   * Wrapper for ZipCompress.deflateCompress()\n   * \n   * @param data - Data to compress (Buffer or chunked reader)\n   * @param options - Compression options\n   * @param bufferSize - Size of buffer to read (default: 512KB)\n   * @param entry - Optional ZIP entry for hash calculation\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async deflateCompress(\n    data: Buffer | { totalSize: number, onReadChunk: (position: number, size: number) => Buffer, onOutChunk: (chunk: Buffer) => void },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().deflateCompress(data, options, bufferSize, entry, onOutputBuffer);\n  }\n\n  /**\n   * Compress data using deflate algorithm (synchronous, small buffers only)\n   * Wrapper for ZipCompress.deflate()\n   * \n   * @param inbuf - Buffer containing data to compress\n   * @param options - Compression options\n   * @returns Buffer containing compressed data\n   */\n  deflate(inbuf: Buffer, options?: CompressOptions): Buffer {\n    return this.getZipCompress().deflate(inbuf, options);\n  }\n\n  /**\n   * Compress data using Zstandard (zstd) algorithm\n   * Wrapper for ZipCompress.zstdCompress()\n   * \n   * Note: ZSTD codec is lazily initialized on first use (module-level singleton).\n   * Initialization happens automatically when needed.\n   * \n   * @param input - Buffer to compress OR chunked reader object\n   * @param options - Compression options\n   * @param bufferSize - Size of buffer to read if using chunked reader (default: 512KB)\n   * @param entry - Optional ZIP entry for hash calculation\n   * @param onOutputBuffer - Optional callback for streaming output\n   * @returns Promise resolving to Buffer containing compressed data\n   */\n  async zstdCompress(\n    input: Buffer | { totalSize: number, readChunk: (position: number, size: number) => Buffer },\n    options?: CompressOptions,\n    bufferSize?: number,\n    entry?: ZipEntry,\n    onOutputBuffer?: (data: Buffer) => Promise<void>\n  ): Promise<Buffer> {\n    return this.getZipCompress().zstdCompress(input, options, bufferSize, entry, onOutputBuffer);\n  }\n\n  /**\n   * Compress file data in memory and return ZIP entry information as Buffer\n   * Wrapper for ZipCompress.compressFileBuffer()\n   * \n   * @param entry - ZIP entry to compress\n   * @param fileData - File data buffer to compress\n   * @param cmpOptions - Compression options\n   * @returns Promise resolving to Buffer containing local header + compressed data\n   */\n  async compressFileBuffer(\n    entry: ZipEntry,\n    fileData: Buffer,\n    cmpOptions?: CompressOptions\n  ): Promise<Buffer> {\n    return this.getZipCompress().compressFileBuffer(entry, fileData, cmpOptions);\n  }\n\n  // ============================================================================\n  // ZipDecompress Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Extract file data (Buffer-based ZIP only)\n   * Wrapper for ZipDecompress.extract()\n   * \n   * @param entry - ZIP entry to extract\n   * @param skipHashCheck - Skip hash verification (CRC-32 or SHA-256)\n   * @returns Promise resolving to Buffer containing extracted data, or null if failed\n   * @throws Error if not a Buffer-based ZIP\n   */\n  async extract(entry: ZipEntry, skipHashCheck?: boolean): Promise<Buffer | null> {\n    return this.getZipDecompress().extract(entry, skipHashCheck);\n  }\n\n\n  // ============================================================================\n  // Static Logging Wrapper Methods\n  // ============================================================================\n\n  /**\n   * Note: Logging for ZipCompress and ZipDecompress is controlled by their\n   * static loggingEnabled property. Set it directly:\n   *   ZipCompress.loggingEnabled = true/false;\n   *   ZipDecompress.loggingEnabled = true/false;\n   */\n\n  /**\n   * Load ZIP file from buffer (in-memory mode)\n   * \n   * **Required**: You must call this method (or the appropriate load method for your platform)\n   * before calling `getDirectory()` or any other ZIP operations. This method:\n   * 1. Resets all ZIP data\n   * 2. Stores the buffer in this.inBuffer\n   * 3. Loads EOCD and parses central directory\n   * 4. Populates this.zipEntries[] array\n   * \n   * For browser applications, use `ZipkitBrowser.loadZipBlob()` instead.\n   * For server applications with file paths, use `ZipkitServer.loadZipFile()` instead.\n   * \n   * @param inBuf - Buffer containing the complete ZIP file data\n   * @returns ZipEntry[] Array of all entries in the ZIP file\n   */\n  loadZip(inBuf: Buffer): ZipEntry[] {\n    this.resetZipData();\n    // Store buffer for backward compatibility with detection logic\n    this.inBuffer = inBuf;\n    // Load EOCD and parse central directory\n    this.loadEOCDFromBuffer(inBuf);\n    const entries = this.getDirectoryFromBuffer();\n    this.zipEntries = entries;\n    return entries;\n  }\n\n\n  /**\n   * Reset all ZIP-related data to initial state\n   * \n   * Clears all internal state including zipEntries[], inBuffer, and zipComment.\n   * \n   * Note: ZipCompress and ZipDecompress instances are not recreated.\n   * ZSTD codec is a module-level singleton and is lazily initialized on first use,\n   * so no cleanup is needed. No memory buffers are allocated until compression/decompression\n   * operations are performed.\n   */\n  private resetZipData(): void {\n    this.inBuffer = null;\n    this.zipEntries = [];\n    this.reset();\n    this.zipComment = null;\n    // Reset lazy-loaded components so they can be recreated on next access\n    this._zipkitCmp = null;\n    this._zipkitDeCmp = null;\n    // Note: ZSTD codec is module-level singleton, so no cleanup needed\n  }\n\n  /**\n   * Get central directory entries (synchronous, buffer-based only)\n   * \n   * Returns entries from zipEntries[] array which serves as unified storage.\n   * \n   * **Important**: This method does NOT load the ZIP file. You must call `loadZip()` first\n   * to populate zipEntries[]. If the ZIP is not loaded, this method returns an empty array.\n   * \n   * @param debug - Optional debug flag for logging\n   * @returns Array of ZipEntry objects, or empty array if ZIP not loaded\n   */\n  getDirectory(debug?: boolean): ZipEntry[] {\n    return this.zipEntries;\n  }\n\n\n  /**\n   * Get specific ZIP entry by filename from zipEntries[] array.\n   * Reserved META-INF paths (APPNOTE \u00A72.3) also match ASCII case-insensitively\n   * when an exact spelling is not found.\n   *\n   * @param filename - The name/path of the file/directory to find\n   * @returns ZipEntry object if found, null if not found\n   */\n  getZipEntry(filename: string): ZipEntry | null {\n    try {\n      const centralDir = this.getDirectory();\n      const exact = centralDir.find((entry: ZipEntry) => entry.filename === filename);\n      if (exact) return exact;\n      if (isReservedMetaPath(filename)) {\n        return findReservedMetaEntry(centralDir, filename);\n      }\n      return null;\n    } catch (error) {\n      return null;\n    }\n  }\n\n  /**\n   * Ensure buffer is available (in-memory mode)\n   */\n  public ensureBuffer(): Buffer {\n    if (!this.inBuffer) {\n      this.inBuffer = Buffer.alloc(0);\n    }\n    return this.inBuffer;\n  }\n\n  /**\n   * Parse local header (in-memory mode)\n   */\n  public parseLocalHeader(entry: ZipEntry, buffer: Buffer): Buffer {\n    const localData = buffer.subarray(entry.localHdrOffset);\n    \n    if (localData.readUInt32LE(0) !== LOCAL_HDR.SIGNATURE) {\n      throw new Error(Errors.INVALID_CEN);\n    }\n    \n    const _bitFlags = localData.readUInt16LE(LOCAL_HDR.FLAGS);\n    let _fnameLen = localData.readUInt16LE(LOCAL_HDR.FNAME_LEN);\n    let _extraLen = localData.readUInt16LE(LOCAL_HDR.EXTRA_LEN);\n    let _localSize = LOCAL_HDR.SIZE + _fnameLen + _extraLen;\n\n    const isAes = entry.aesVersion > 0 || entry.cmpMethod === CMP_METHOD.AES_ENCRYPT;\n    const isNeo = entry.neoCryptoAlgorithm > 0;\n\n    if (isAes || isNeo) {\n      // AES: compressedSize includes salt + verifier + encrypted + hmac\n      // Return the full payload; AesCrypto.decryptBuffer() handles parsing\n      const dataStart = _localSize;\n      const dataEnd = _localSize + entry.compressedSize;\n      return localData.subarray(dataStart, dataEnd);\n    }\n\n    // ZipCrypto: skip the 12-byte encryption header\n    let _encryptLen = 0;\n    if (_bitFlags & GP_FLAG.ENCRYPTED) {\n      _encryptLen = ENCRYPT_HDR_SIZE;\n    }\n\n    const dataStart = _localSize + _encryptLen;\n    const dataEnd = _localSize + entry.compressedSize;\n    return localData.subarray(dataStart, dataEnd);\n  }\n\n  /**\n   * Test CRC32 checksum\n   * Always checks CRC against entry.crc from central directory\n   * For DATA_DESC files, CRC is stored in central directory, not local header\n   */\n  public testCRC32(entry: ZipEntry, data: Buffer): boolean {\n    // Always check CRC against entry.crc from central directory\n    // For DATA_DESC files, CRC is stored in central directory, not local header\n      const _crc = crc32(data);\n    const isValid = _crc === entry.crc;\n    Logger.debug(`[DEBUG] testCRC32() comparison: calculated=${_crc}, stored=${entry.crc}, isValid=${isValid ? '\u2713' : '\u2717'}, DATA_DESC=${(entry.bitFlags & 0x8) !== 0 ? 'YES' : 'NO'}`);\n    return isValid;\n  }\n\n  /**\n   * Test SHA256 hash\n   */\n  public testSHA256(entry: ZipEntry, data: Buffer): boolean {\n    if (!entry.sha256) {\n      throw new Error(Errors.UNKNOWN_SHA256);\n    }\n    const _sha256 = sha256(data);\n    const isValid = _sha256 === entry.sha256;\n    Logger.debug(`[DEBUG] testSHA256() comparison: calculated=${_sha256}, stored=${entry.sha256}, isValid=${isValid ? '\u2713' : '\u2717'}`);\n    return isValid;\n  }\n\n  /**\n   * Get memory usage statistics\n   * \n   * @returns Object containing backend type, total memory usage in bytes, and entry count\n   */\n  getMemoryUsage(): { backend: 'buffer' | 'file' | 'none'; memoryUsage: number; entries: number } {\n    const baseMemory = this.inBuffer?.length || 0;\n    const entriesMemory = this.zipEntries.length * 1024; // Approximate memory per entry\n    \n    let backend: 'buffer' | 'file' | 'none';\n    if (this.inBuffer) {\n      backend = 'buffer';\n    } else {\n      // Zipkit is buffer-based only, so if no buffer, backend is 'none'\n      // For file-based operations, use ZipkitServer\n      backend = 'none';\n    }\n    \n    return {\n      backend,\n      memoryUsage: baseMemory + entriesMemory,\n      entries: this.zipEntries.length\n    };\n  }\n\n  /**\n   * Create a new ZIP entry and automatically add it to zipEntries[]\n   * \n   * @param filename - Entry filename\n   * @param data - Optional entry data (for CRC calculation)\n   * @param options - Optional entry options\n   * @returns Created ZipEntry instance\n   */\n  createZipEntry(filename: string, data?: Buffer, options?: any): ZipEntry {\n    const entry = new ZipEntry(filename, null, false);\n    // Set basic properties\n    if (data) {\n      entry.crc = crc32(data);\n      entry.uncompressedSize = data.length;\n      entry.compressedSize = data.length;\n    } else {\n      entry.crc = 0;\n      entry.uncompressedSize = 0;\n      entry.compressedSize = 0;\n    }\n    entry.cmpMethod = CMP_METHOD.STORED;\n    entry.bitFlags = 0;\n    // Note: lastModTime and lastModDate properties may not exist in ZipEntry\n    // entry.lastModTime = Math.floor(Date.now() / 1000);\n    // entry.lastModDate = Math.floor(Date.now() / 1000);\n    \n    // Automatically add entry to zipEntries[] (maintains order as single source of truth)\n    this.zipEntries.push(entry);\n    \n    return entry;\n  }\n\n  /**\n   * Copy entry from another ZIP (buffer-based only)\n   * For file-based ZIP operations, use ZipkitServer.copyEntry()\n   */\n  async copyEntry(sourceEntry: ZipEntry): Promise<Buffer> {\n    // For Buffer-based ZIP, we need to reconstruct the entry data\n    // This is a simplified version - in practice, you'd need to read from the original ZIP\n    if (sourceEntry.cmpData) {\n      const localHdr = sourceEntry.createLocalHdr();\n      return Buffer.concat([localHdr, sourceEntry.cmpData]);\n    }\n    \n    throw new Error('Cannot copy entry: no compressed data available');\n  }\n\n  /**\n   * Central end header getter (for compatibility)\n   * \n   * Returns a function that creates the central end header using totalEntries from zipEntries[].\n   * \n   * @returns Function that creates central end header buffer\n   */\n  get centralEndHdr(): (centralDirSize: number, centralDirOffset: number) => Buffer {\n    // Return a function that calls centralEndHdr with totalEntries from zipEntries[]\n    return (centralDirSize: number, centralDirOffset: number) => {\n      const totalEntries = this.zipEntries.length;\n      return this.centralEndHdrMethod(centralDirSize, centralDirOffset, totalEntries);\n    };\n  }\n\n  /**\n   * Get ZIP comment\n   * \n   * @returns ZIP file comment string or null\n   */\n  getZipComment(): string | null {\n    return this.zipComment;\n  }\n\n  // ============================================================================\n  // Buffer-based ZIP Loading Methods (merged from ZipLoadEntries)\n  // ============================================================================\n\n  /**\n   * Load EOCD from in-memory buffer (buffer mode)\n   */\n  private loadEOCDFromBuffer(buffer: Buffer): void {\n    const fileSize = buffer.length;\n    const searchSize = Math.min(0xFFFF + 22, fileSize);\n    const searchStart = fileSize - searchSize;\n    const scan = buffer.subarray(searchStart, searchStart + searchSize);\n\n    // Find EOCD signature\n    let eocdOffset = -1;\n    for (let i = scan.length - 22; i >= 0; i--) {\n      if (scan[i] === 0x50) {\n        if (scan.readUInt32LE(i) === CENTRAL_END.SIGNATURE) {\n          eocdOffset = searchStart + i;\n          break;\n        }\n      }\n    }\n    if (eocdOffset === -1) {\n      throw new Error(Errors.INVALID_FORMAT);\n    }\n\n    const eocdBuffer = buffer.subarray(eocdOffset, eocdOffset + 22);\n    if (eocdBuffer.readUInt32LE(0) === CENTRAL_END.SIGNATURE) {\n      this.centralDirSize = eocdBuffer.readUInt32LE(CENTRAL_END.CENTRAL_DIR_SIZE);\n      this.centralDirOffset = eocdBuffer.readUInt32LE(CENTRAL_END.CENTRAL_DIR_OFFSET);\n\n      if (this.centralDirOffset === 0xFFFFFFFF) {\n        // ZIP64: locate locator (20 bytes before EOCD) and then ZIP64 EOCD (56 bytes)\n        const locatorOffset = eocdOffset - 20;\n        const locatorBuffer = buffer.subarray(locatorOffset, locatorOffset + 20);\n        if (locatorBuffer.readUInt32LE(0) === ZIP64_CENTRAL_END.SIGNATURE) {\n          const zip64Offset = Number(locatorBuffer.readBigUInt64LE(8));\n          const zip64Buffer = buffer.subarray(zip64Offset, zip64Offset + 56);\n          this.centralDirSize = Number(zip64Buffer.readBigUInt64LE(ZIP64_CENTRAL_DIR.CENTRAL_DIR_SIZE));\n          this.centralDirOffset = Number(zip64Buffer.readBigUInt64LE(ZIP64_CENTRAL_DIR.CENTRAL_DIR_OFFSET));\n        }\n      }\n    } else {\n      throw new Error(Errors.INVALID_FORMAT);\n    }\n\n    // ZIP comment\n    const commentLength = eocdBuffer.readUInt16LE(CENTRAL_END.ZIP_COMMENT_LEN);\n    if (commentLength > 0) {\n      const commentStart = eocdOffset + 22;\n      this.zipComment = buffer.subarray(commentStart, commentStart + commentLength).toString();\n    }\n  }\n\n  /**\n   * Get directory from buffer (buffer mode only)\n   * Note: zipEntries[] in Zipkit is the single source of truth for caching.\n   * This method always parses fresh from the buffer.\n   */\n  private getDirectoryFromBuffer(): ZipEntry[] {\n    if (!this.inBuffer) {\n      return [];\n    }\n\n    const buffer = this.inBuffer;\n    const entries: ZipEntry[] = [];\n    let offset = this.centralDirOffset;\n    let remaining = this.centralDirSize;\n    const bufferSize = this.config.bufferSize || 512 * 1024;\n\n    while (remaining > 0) {\n      const currentBufferSize = Math.min(bufferSize, remaining);\n      const chunk = buffer.subarray(offset, offset + currentBufferSize);\n\n      // Parse entries from chunk\n      let chunkOffset = 0;\n      while (chunkOffset < chunk.length) {\n        if (chunk.readUInt32LE(chunkOffset) !== CENTRAL_DIR.SIGNATURE) {\n          break; // End of central directory\n        }\n\n        // Parse central directory entry\n        const entry = new ZipEntry(null, null, false);\n        const entryData = chunk.subarray(chunkOffset);\n        const remainingData = entry.readZipEntry(entryData);\n\n        entries.push(entry);\n\n        // Move to next entry\n        chunkOffset += (entryData.length - remainingData.length);\n      }\n\n      offset += currentBufferSize;\n      remaining -= currentBufferSize;\n    }\n\n    // Return entries in original order (do NOT sort by default)\n    // Central directory order should match data section order\n    // Note: zipEntries[] in Zipkit is the single source of truth for caching\n    return entries;\n  }\n\n  /**\n   * Reset internal state (private method for Zipkit to call)\n   * Clears all ZIP-related data while keeping the instance alive\n   */\n  private reset(): void {\n    this.centralDirSize = 0;\n    this.centralDirOffset = 0;\n  }\n\n  /**\n   * Create central end header\n   * Note: totalEntries must be passed as parameter since zipEntries[] in Zipkit is the cache\n   */\n  private centralEndHdrMethod(centralDirSize: number, centralDirOffset: number, totalEntries: number): Buffer {\n    const ceBuf = Buffer.alloc(CENTRAL_END.SIZE);\n    ceBuf.writeUInt32LE(CENTRAL_END.SIGNATURE, 0);\n    ceBuf.writeUInt16LE(0, 4); // Number of this disk\n    ceBuf.writeUInt16LE(0, 6); // Number of the disk with the start of the central directory\n    ceBuf.writeUInt16LE(totalEntries, 8); // Total number of entries\n    ceBuf.writeUInt16LE(totalEntries, 10); // Total number of entries on this disk\n    ceBuf.writeUInt32LE(centralDirSize, 12); // Size of central directory\n    ceBuf.writeUInt32LE(centralDirOffset, 16); // Offset of start of central directory\n    ceBuf.writeUInt16LE(0, 20); // ZIP file comment length\n    \n    return ceBuf;\n  }\n\n  /**\n   * Calculate Merkle root of archive content (non-META-INF entries).\n   *\n   * Per NEOZIP_APPNOTE.md \u00A76:\n   * - Default **v1**: domain-separated leaves SHA-256(0x00 \u2016 uncompressed bytes) and\n   *   SHA-256(0x01 \u2016 left \u2016 right) parents; paths NFC-normalized before sort.\n   * - Legacy **v0**: bare 0x014E digests as leaves, duplicate-odd pairing, path as stored.\n   *\n   * When only Extra Field digests are available (typical after open), **v1 requires\n   * payload bytes**. This sync method therefore returns null for v1; use\n   * {@link getMerkleRootAsync} (extracts content) or `{ algorithm: 'v0' }`.\n   * When you already hold payloads, use {@link merkleRootFromEntries}.\n   *\n   * @param options.algorithm - `v1` (default) or legacy `v0`\n   * @returns Lowercase hex Merkle root, or null if calculation fails\n   */\n  getMerkleRoot(options?: { algorithm?: MerkleAlgorithm }): string | null {\n    const algorithm: MerkleAlgorithm = options?.algorithm ?? 'v1';\n\n    let zipEntries: ZipEntry[];\n    try {\n      zipEntries = this.getDirectory();\n    } catch (error) {\n      Logger.error(`getMerkleRoot(): Error calling getDirectory(): ${error instanceof Error ? error.message : String(error)}`);\n      Logger.error(`getMerkleRoot(): Stack trace: ${error instanceof Error ? error.stack : 'No stack trace'}`);\n      return null;\n    }\n\n    if (!zipEntries || zipEntries.length === 0) {\n      return null;\n    }\n\n    const contentEntries = zipEntries.filter((entry) => !isMetaInfPath(entry.filename || ''));\n\n    if (algorithm === 'v0') {\n      const digests = contentEntries\n        .filter((e) => e.sha256)\n        .map((e) => ({ path: e.filename || '', sha256: e.sha256 as string }));\n      return computeMerkleRootV0FromDigests(digests);\n    }\n\n    // v1: prefer leaves captured in the same create/extract hash stream (no re-hash)\n    if (\n      contentEntries.length > 0 &&\n      contentEntries.every((e) => !!e.merkleLeafV1)\n    ) {\n      return computeMerkleRootV1FromLeaves(\n        contentEntries.map((e) => ({\n          path: e.filename || '',\n          merkleLeafV1: e.merkleLeafV1 as string,\n        }))\n      );\n    }\n\n    // v1: bare digests are not leaves \u2014 need getMerkleRootAsync() or stream leaves\n    return null;\n  }\n\n  /**\n   * Calculate Merkle root (preferred for v1 / new archives).\n   *\n   * **v1 (default):** uses precomputed stream leaves when available; otherwise extracts\n   * each content entry once and folds APPNOTE \u00A76.3 root (no second content hash pass\n   * when extract captures merkleLeafV1).\n   * **v0:** uses Extra Field digests only (no extract), APPNOTE \u00A76.2.\n   *\n   * META-INF/** is excluded. File-streaming mode: use ZipkitNode override (testEntry\n   * pipeline) rather than buffering the whole archive.\n   *\n   * @param options.algorithm - `v1` (default) or legacy `v0`\n   * @returns Promise resolving to lowercase hex root, or null\n   */\n  async getMerkleRootAsync(options?: { algorithm?: MerkleAlgorithm }): Promise<string | null> {\n    const algorithm: MerkleAlgorithm = options?.algorithm ?? 'v1';\n\n    let zipEntries: ZipEntry[] = [];\n\n    try {\n      zipEntries = this.getDirectory();\n    } catch (error) {\n      Logger.error(`Failed to get directory for merkle root calculation: ${error instanceof Error ? error.message : String(error)}`);\n      return null;\n    }\n\n    if (!zipEntries || zipEntries.length === 0) {\n      return null;\n    }\n\n    const contentEntries = zipEntries.filter((entry) => !isMetaInfPath(entry.filename || ''));\n\n    if (algorithm === 'v0') {\n      const digests = contentEntries\n        .filter((e) => e.sha256)\n        .map((e) => ({ path: e.filename || '', sha256: e.sha256 as string }));\n      return computeMerkleRootV0FromDigests(digests);\n    }\n\n    // Reuse leaves already produced during write/extract (one stream hash pass)\n    if (\n      contentEntries.length > 0 &&\n      contentEntries.every((e) => !!e.merkleLeafV1)\n    ) {\n      return computeMerkleRootV1FromLeaves(\n        contentEntries.map((e) => ({\n          path: e.filename || '',\n          merkleLeafV1: e.merkleLeafV1 as string,\n        }))\n      );\n    }\n\n    // Buffer path: one decompress + dual hash inside extract (ZipDecompress)\n    if (!this.inBuffer) {\n      Logger.error(\n        'getMerkleRootAsync() called on file-based ZIP without precomputed merkle leaves. ' +\n          'Use ZipkitNode (streaming testEntry) or ensure create captured merkleLeafV1.'\n      );\n      return null;\n    }\n\n    for (const entry of contentEntries) {\n      try {\n        const data = await this.extract(entry, false);\n        if (entry.merkleLeafV1) {\n          continue;\n        }\n        // Legacy decompress without dual leaf: hash payload once, cache leaf\n        if (data === null || data.length === 0) {\n          entry.merkleLeafV1 = leafHashV1(Buffer.alloc(0)).toString('hex');\n        } else {\n          entry.merkleLeafV1 = leafHashV1(data).toString('hex');\n        }\n      } catch (error) {\n        Logger.error(\n          `getMerkleRootAsync(): failed to extract ${entry.filename}: ${error instanceof Error ? error.message : String(error)}`\n        );\n        return null;\n      }\n    }\n\n    if (!contentEntries.every((e) => !!e.merkleLeafV1)) {\n      return null;\n    }\n\n    return computeMerkleRootV1FromLeaves(\n      contentEntries.map((e) => ({\n        path: e.filename || '',\n        merkleLeafV1: e.merkleLeafV1 as string,\n      }))\n    );\n  }\n\n  /**\n   * Compute Merkle root from known digests and/or payloads (APPNOTE \u00A76).\n   * Prefer this during create when uncompressed bytes are still in hand, or when\n   * stream leaves (`merkleLeafV1`) were already produced.\n   */\n  static merkleRootFromEntries(\n    entries: Array<{ path: string; content?: Buffer; contentSha256?: string; merkleLeafV1?: string }>,\n    algorithm: MerkleAlgorithm = 'v1'\n  ): string | null {\n    return computeArchiveMerkleRoot(entries, algorithm);\n  }\n\n}\n", "// ======================================\n//\tZipCopy.ts - Efficient ZIP Entry Copying (Buffer-based)\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n//\n// Efficient ZIP entry copying using ZipEntry instances directly.\n// Leverages existing offsets and sizes to copy raw bytes without\n// unnecessary parsing and reconstruction.\n// Buffer-based implementation for in-memory ZIP operations.\n\nimport ZipEntry from './ZipEntry';\nimport Zipkit from './Zipkit';\nimport { LOCAL_HDR, CENTRAL_END, GP_FLAG } from './constants/Headers';\n\n/**\n * Options for copying ZIP files\n */\nexport interface CopyOptions {\n  /** Filter function to determine which entries to copy */\n  entryFilter?: (entry: ZipEntry) => boolean;\n  /** Sort function to reorder entries before copying */\n  entrySorter?: (a: ZipEntry, b: ZipEntry) => number;\n  /** Whether to preserve the ZIP file comment (default: true) */\n  preserveComments?: boolean;\n}\n\n/**\n * Result of copying a ZIP file\n */\nexport interface CopyResult {\n  /** Information about copied entries */\n  entries: Array<{\n    filename: string;\n    localHeaderOffset: number;\n    compressedSize: number;\n  }>;\n  /** Offset to the start of the central directory */\n  centralDirOffset: number;\n  /** Total number of entries copied */\n  totalEntries: number;\n  /** Buffer containing the complete copied ZIP file */\n  zipBuffer: Buffer;\n}\n\n/**\n * Result of copying only ZIP entry data (no central directory or EOCD).\n * Use with writeCentralDirectoryAndEOCD after optionally appending more entry data\n * to build a ZIP that includes both copied and new entries.\n */\nexport interface CopyEntriesOnlyResult {\n  /** Buffer containing only entry data (local headers + compressed data); not yet a valid ZIP */\n  entryDataBuffer: Buffer;\n  /** Offset at which entry data ends; central directory should start here after any new entries are appended (equals entryDataBuffer.length) */\n  dataEndOffset: number;\n  /** Copied entries with localHdrOffset set for the destination buffer */\n  copiedEntries: ZipEntry[];\n}\n\n/**\n * Options for finalizing a ZIP (writing central directory and EOCD)\n */\nexport interface FinalizeZipOptions {\n  /** ZIP file comment (default: empty) */\n  zipComment?: string;\n  /** Offset at which the central directory will start in the final buffer (required for buffer-based finalization; e.g. entryDataBuffer.length) */\n  centralDirOffset?: number;\n}\n\n/**\n * Efficient ZIP file copying class (Buffer-based)\n *\n * Uses ZipEntry instances directly to copy entries without decompression/recompression.\n * Supports filtering and reordering entries while maintaining ZIP file validity.\n * Works entirely with buffers for in-memory operations.\n *\n * Entry data and the central directory / EOCD are separated so you can append\n * more entry data before finalizing: use copyZipEntriesOnly, append new entry\n * data to the buffer, then call writeCentralDirectoryAndEOCD with all entries\n * and concatenate to form the final ZIP buffer.\n *\n * @example Full copy (one shot)\n * ```typescript\n * const zipCopy = new ZipCopy(zipkit);\n * const result = await zipCopy.copyZipBuffer(sourceZipBuffer, {\n *   entryFilter: (entry) => !entry.filename.startsWith('.'),\n *   entrySorter: (a, b) => a.filename.localeCompare(b.filename)\n * });\n * // result.zipBuffer contains the complete copied ZIP file\n * ```\n *\n * @example Copy then append entries before finalizing\n * ```typescript\n * const { entryDataBuffer, dataEndOffset, copiedEntries } = await zipCopy.copyZipEntriesOnly(sourceZipBuffer);\n * // ... append new entry data (local header + data), collect new ZipEntry[] with localHdrOffset set ...\n * const allEntryData = Buffer.concat([entryDataBuffer, newEntryDataBuffer]);\n * const allEntries = [...copiedEntries, ...newEntries];\n * const centralAndEocd = zipCopy.writeCentralDirectoryAndEOCD(allEntries, {\n *   zipComment: '',\n *   centralDirOffset: allEntryData.length\n * });\n * const zipBuffer = Buffer.concat([allEntryData, centralAndEocd]);\n * ```\n */\nexport class ZipCopy {\n  private zipkit: Zipkit;\n\n  /**\n   * Creates a new ZipCopy instance\n   * @param zipkit - Zipkit instance to use for ZIP operations\n   */\n  constructor(zipkit: Zipkit) {\n    this.zipkit = zipkit;\n  }\n\n  /**\n   * Calculate local header size by reading from buffer\n   * \n   * Reads the first 30 bytes of the local header to get the exact\n   * filename and extra field lengths, ensuring accuracy even when\n   * local header differs from central directory.\n   * \n   * @param sourceBuffer - Buffer containing the source ZIP file\n   * @param entry - ZipEntry with localHdrOffset\n   * @returns Size of the local header in bytes\n   */\n  private calculateLocalHeaderSize(sourceBuffer: Buffer, entry: ZipEntry): number {\n    // Verify offset is within buffer bounds\n    if (entry.localHdrOffset + LOCAL_HDR.SIZE > sourceBuffer.length) {\n      throw new Error(\n        `Local header offset ${entry.localHdrOffset} is beyond buffer size ${sourceBuffer.length} for entry ${entry.filename}`\n      );\n    }\n\n    // Read the fixed 30-byte local header\n    const headerBuffer = sourceBuffer.subarray(entry.localHdrOffset, entry.localHdrOffset + LOCAL_HDR.SIZE);\n\n    // Verify signature\n    if (headerBuffer.readUInt32LE(0) !== LOCAL_HDR.SIGNATURE) {\n      throw new Error(\n        `Invalid local file header signature for entry ${entry.filename} at offset ${entry.localHdrOffset}`\n      );\n    }\n\n    // Read filename and extra field lengths from the actual header\n    const filenameLength = headerBuffer.readUInt16LE(LOCAL_HDR.FNAME_LEN);\n    const extraFieldLength = headerBuffer.readUInt16LE(LOCAL_HDR.EXTRA_LEN);\n\n    // Calculate total local header size\n    return LOCAL_HDR.SIZE + filenameLength + extraFieldLength;\n  }\n\n  /**\n   * Copy entry bytes directly from source buffer\n   * \n   * Copies the local header and compressed data as a single operation.\n   * \n   * Handles various entry types:\n   * - Normal entries: [local header][filename][extra][compressed data]\n   * - Encrypted entries: compressedSize includes 12-byte encryption header\n   * - Data descriptor entries: [local header][filename][extra][data][data descriptor (16 bytes)]\n   * \n   * For data descriptor entries, the local header has compressed size = 0,\n   * but the actual size is in the central directory (entry.compressedSize).\n   * \n   * @param sourceBuffer - Buffer containing the source ZIP file\n   * @param entry - ZipEntry with source offset information\n   * @returns Buffer containing the copied entry (local header + compressed data + data descriptor if present)\n   */\n  private copyEntryBytes(\n    sourceBuffer: Buffer,\n    entry: ZipEntry\n  ): Buffer {\n    // Calculate local header size by reading from buffer\n    const localHeaderSize = this.calculateLocalHeaderSize(sourceBuffer, entry);\n    \n    // Determine total entry size\n    // For data descriptor entries, add 16 bytes for the data descriptor\n    const hasDataDescriptor = (entry.bitFlags & GP_FLAG.DATA_DESC) !== 0;\n    const totalEntrySize = localHeaderSize + entry.compressedSize + (hasDataDescriptor ? 16 : 0);\n\n    // Verify we have enough data in the buffer\n    if (entry.localHdrOffset + totalEntrySize > sourceBuffer.length) {\n      throw new Error(\n        `Entry ${entry.filename} extends beyond buffer size: ` +\n        `offset ${entry.localHdrOffset} + size ${totalEntrySize} > buffer length ${sourceBuffer.length}`\n      );\n    }\n\n    // Extract the entire entry (local header + compressed data + data descriptor if present) from source\n    const entryBuffer = sourceBuffer.subarray(entry.localHdrOffset, entry.localHdrOffset + totalEntrySize);\n\n    // Verify data descriptor signature if present\n    if (hasDataDescriptor) {\n      const dataDescOffset = localHeaderSize + entry.compressedSize;\n      const dataDescSig = entryBuffer.readUInt32LE(dataDescOffset);\n      if (dataDescSig !== 0x08074b50) { // DATA_DESCRIPTOR signature\n        throw new Error(\n          `Invalid data descriptor signature for entry ${entry.filename} ` +\n          `(expected 0x08074b50, got 0x${dataDescSig.toString(16)})`\n        );\n      }\n    }\n\n    // Return a copy of the buffer slice (so modifications don't affect source)\n    return Buffer.from(entryBuffer);\n  }\n\n  /**\n   * Clone a ZipEntry with a new local header offset\n   * \n   * Creates a new ZipEntry instance with all properties copied from the source,\n   * but with an updated localHdrOffset for the destination buffer.\n   * \n   * @param entry - Source ZipEntry to clone\n   * @param newLocalHdrOffset - New local header offset for the destination\n   * @returns New ZipEntry instance with updated offset\n   */\n  private cloneEntryWithOffset(\n    entry: ZipEntry,\n    newLocalHdrOffset: number\n  ): ZipEntry {\n    // Create a new ZipEntry with the same filename and comment\n    const cloned = new ZipEntry(entry.filename, entry.comment || null, entry.debug);\n\n    // Copy all properties\n    cloned.verMadeBy = entry.verMadeBy;\n    cloned.verExtract = entry.verExtract;\n    cloned.bitFlags = entry.bitFlags;\n    cloned.cmpMethod = entry.cmpMethod;\n    cloned.timeDateDOS = entry.timeDateDOS;\n    cloned.crc = entry.crc;\n    cloned.compressedSize = entry.compressedSize;\n    cloned.uncompressedSize = entry.uncompressedSize;\n    cloned.volNumber = entry.volNumber;\n    cloned.intFileAttr = entry.intFileAttr;\n    cloned.extFileAttr = entry.extFileAttr;\n    cloned.localHdrOffset = newLocalHdrOffset; // Update offset\n\n    // Copy extra field if present\n    if (entry.extraField) {\n      cloned.extraField = Buffer.from(entry.extraField);\n    }\n\n    // Copy metadata\n    cloned.isEncrypted = entry.isEncrypted;\n    cloned.isStrongEncrypt = entry.isStrongEncrypt;\n    cloned.isDirectory = entry.isDirectory;\n    cloned.isMetaData = entry.isMetaData;\n    cloned.isUpdated = entry.isUpdated;\n\n    // Copy platform-specific data\n    cloned.platform = entry.platform;\n    cloned.universalTime = entry.universalTime;\n    cloned.uid = entry.uid;\n    cloned.gid = entry.gid;\n    cloned.sha256 = entry.sha256;\n\n    // Copy symlink data\n    cloned.isSymlink = entry.isSymlink;\n    cloned.linkTarget = entry.linkTarget;\n\n    // Copy hardlink data\n    cloned.isHardLink = entry.isHardLink;\n    cloned.originalEntry = entry.originalEntry;\n    cloned.inode = entry.inode;\n\n    return cloned;\n  }\n\n  /**\n   * Build central directory and End of Central Directory buffer.\n   * Used internally by copyZipBuffer and by writeCentralDirectoryAndEOCD.\n   */\n  private buildCentralDirectoryAndEOCDBuffer(\n    entries: ZipEntry[],\n    zipComment: string,\n    centralDirOffset: number\n  ): Buffer {\n    const centralDirChunks: Buffer[] = [];\n    for (const entry of entries) {\n      centralDirChunks.push(entry.centralDirEntry());\n    }\n    const centralDirBuffer = Buffer.concat(centralDirChunks);\n    const centralDirSize = centralDirBuffer.length;\n\n    const commentBytes = Buffer.from(zipComment, 'utf8');\n    const commentLength = Math.min(commentBytes.length, 0xffff);\n\n    const eocdBuffer = Buffer.alloc(22 + commentLength);\n    let pos = 0;\n    eocdBuffer.writeUInt32LE(CENTRAL_END.SIGNATURE, pos);\n    pos += 4;\n    eocdBuffer.writeUInt16LE(0, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(0, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(entries.length, pos);\n    pos += 2;\n    eocdBuffer.writeUInt16LE(entries.length, pos);\n    pos += 2;\n    eocdBuffer.writeUInt32LE(centralDirSize, pos);\n    pos += 4;\n    eocdBuffer.writeUInt32LE(centralDirOffset, pos);\n    pos += 4;\n    eocdBuffer.writeUInt16LE(commentLength, pos);\n    pos += 2;\n    if (commentLength > 0) {\n      commentBytes.copy(eocdBuffer, pos, 0, commentLength);\n    }\n\n    return Buffer.concat([centralDirBuffer, eocdBuffer]);\n  }\n\n  /**\n   * Copy only ZIP entry data from the source buffer (no central directory or EOCD).\n   * Use when you want to append more entry data before finalizing. Then call\n   * writeCentralDirectoryAndEOCD with all entries (copied + new) and concatenate\n   * to form the final ZIP buffer.\n   *\n   * @param sourceZipBuffer - Buffer containing the source ZIP file\n   * @param options - Optional copy options (filtering, sorting)\n   * @returns Result with entryDataBuffer and copiedEntries for use when appending and finalizing\n   */\n  async copyZipEntriesOnly(\n    sourceZipBuffer: Buffer,\n    options?: CopyOptions\n  ): Promise<CopyEntriesOnlyResult> {\n    const sourceEntries = this.zipkit.loadZip(sourceZipBuffer);\n\n    let entriesToCopy = options?.entryFilter\n      ? sourceEntries.filter(options.entryFilter)\n      : sourceEntries;\n\n    if (options?.entrySorter) {\n      entriesToCopy = [...entriesToCopy].sort(options.entrySorter);\n    }\n\n    if (entriesToCopy.length === 0) {\n      throw new Error('No entries to copy after filtering');\n    }\n\n    const outputChunks: Buffer[] = [];\n    let destOffset = 0;\n    const copiedEntries: ZipEntry[] = [];\n\n    for (const sourceEntry of entriesToCopy) {\n      const newLocalHdrOffset = destOffset;\n      const entryBuffer = this.copyEntryBytes(sourceZipBuffer, sourceEntry);\n      outputChunks.push(entryBuffer);\n      destOffset += entryBuffer.length;\n      const clonedEntry = this.cloneEntryWithOffset(sourceEntry, newLocalHdrOffset);\n      copiedEntries.push(clonedEntry);\n    }\n\n    const entryDataBuffer = Buffer.concat(outputChunks);\n\n    return {\n      entryDataBuffer,\n      dataEndOffset: entryDataBuffer.length,\n      copiedEntries,\n    };\n  }\n\n  /**\n   * Build central directory and End of Central Directory buffer for the given entries.\n   * Concatenate this with entry data (e.g. from copyZipEntriesOnly + any appended entries)\n   * to form a valid ZIP buffer. When concatenating, pass centralDirOffset equal to the\n   * length of the entry data buffer that will precede this (so EOCD has the correct offset).\n   *\n   * @param entries - All entries in order (copied + any new), each with localHdrOffset set\n   * @param options - Optional finalize options (zipComment; centralDirOffset for correct EOCD when concatenating)\n   * @returns Buffer containing central directory + EOCD\n   */\n  writeCentralDirectoryAndEOCD(\n    entries: ZipEntry[],\n    options?: FinalizeZipOptions\n  ): Buffer {\n    if (entries.length === 0) {\n      throw new Error('At least one entry is required to finalize');\n    }\n\n    const zipComment = options?.zipComment ?? '';\n    const centralDirOffset = options?.centralDirOffset ?? 0;\n    const result: Buffer = this.buildCentralDirectoryAndEOCDBuffer(\n      entries,\n      zipComment,\n      centralDirOffset\n    );\n    return result;\n  }\n\n  /**\n   * Copy ZIP file entries efficiently from buffer to buffer\n   *\n   * Main method that copies entries from source ZIP buffer to destination ZIP buffer.\n   * Uses ZipEntry instances directly to avoid unnecessary parsing.\n   *\n   * @param sourceZipBuffer - Buffer containing the source ZIP file\n   * @param options - Optional copy options (filtering, sorting, etc.)\n   * @returns Copy result with entry information and the complete ZIP buffer\n   */\n  async copyZipBuffer(\n    sourceZipBuffer: Buffer,\n    options?: CopyOptions\n  ): Promise<CopyResult> {\n    const { entryDataBuffer, dataEndOffset, copiedEntries } = await this.copyZipEntriesOnly(\n      sourceZipBuffer,\n      options\n    );\n\n    const zipComment =\n      options?.preserveComments !== false && this.zipkit.getZipComment()\n        ? this.zipkit.getZipComment()!\n        : '';\n\n    const centralAndEocd = this.writeCentralDirectoryAndEOCD(copiedEntries, {\n      zipComment,\n      centralDirOffset: dataEndOffset,\n    });\n\n    const zipBuffer = Buffer.concat([entryDataBuffer, centralAndEocd]);\n\n    return {\n      entries: copiedEntries.map(entry => ({\n        filename: entry.filename,\n        localHeaderOffset: entry.localHdrOffset,\n        compressedSize: entry.compressedSize,\n      })),\n      centralDirOffset: dataEndOffset,\n      totalEntries: copiedEntries.length,\n      zipBuffer,\n    };\n  }\n}\n", "// ======================================\n//\tSupport.ts\n//  A utility module for detecting platform capabilities and features\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n\n/**\n * Platform and environment feature detection utility\n * Provides boolean flags indicating support for various features needed by NeoZip\n * \n * @namespace Support\n * @property {boolean} base64 - Always true, indicates base64 encoding support\n * @property {boolean} array - Always true, indicates Array support\n * @property {boolean} string - Always true, indicates String support\n * @property {boolean} isNode - True if running in Node.js environment\n * @property {boolean} buffer - True if Node.js Buffer is available\n * @property {boolean} uint8array - True if Uint8Array is supported\n * @property {boolean} arrayBuffer - True if both ArrayBuffer and Uint8Array are supported\n * @property {boolean} blob - True if Blob creation with ArrayBuffer is supported\n * @property {boolean} streams - True if ReadableStream and WritableStream are supported\n * @property {boolean} fileReader - True if FileReader is supported\n */\nconst Support = {\n  /** Base64 encoding support (always true) */\n  base64: true,\n  /** Array support (always true) */\n  array: true,\n  /** String support (always true) */\n  string: true,\n\n  /** \n   * Detects if code is running in Node.js environment\n   * True if process.versions.node exists, undefined in browser\n   */\n  isNode: true,\n  \n  /**\n   * Detects if Node.js Buffer is available\n   * True in Node.js, undefined in browser\n   */\n  buffer: true,\n\n  /**\n   * Detects support for Uint8Array typed array\n   * Used for binary data handling\n   */\n  uint8array: true,\n  \n  /**\n   * Detects support for both ArrayBuffer and Uint8Array\n   * Required for binary data operations\n   */\n  arrayBuffer: typeof ArrayBuffer !== \"undefined\" && typeof Uint8Array !== \"undefined\",\n\n  /**\n   * Detects support for Blob with ArrayBuffer\n   * Tests by attempting to create an empty ZIP Blob\n   * @returns {boolean} True if Blob creation succeeds\n   */\n  blob: true,\n\n  /**\n   * Detects support for Streams API\n   * Checks for ReadableStream/WritableStream in browser\n   * or 'stream' module in Node.js\n   * @returns {boolean} True if streams are supported in current environment\n   */\n  streams: true,\n  \n  /**\n   * Detects support for FileReader\n   * @returns {boolean} True if FileReader is supported\n   */\n  fileReader: false\n};\n\nexport default Support;", "// ======================================\n//\tUtil.ts\n//  Copyright (c) 2024 NeoWare, Inc. All rights reserved.\n// ======================================\n// Utility functions\n\nimport Support from \"./Support\";\nimport Errors from \"../constants/Errors\";\nimport {\n  isMetaInfPath,\n  findReservedMetaEntry,\n  isReservedMetaPath,\n  asciiPathEqualsIgnoreCase,\n} from \"../constants/MetaPaths\";\n\nexport {\n  findReservedMetaEntry,\n  isReservedMetaPath,\n  isMetaInfPath,\n  asciiPathEqualsIgnoreCase,\n} from \"../constants/MetaPaths\";\n\nexport const DATATYPE = {\n  STRING: \"string\",\n  BUFFER: \"buffer\",\n  ARRAY: \"array\",\n  ARRAYBUFFER: \"arraybuffer\",\n  U8ARRAY: \"uint8array\",\n  BLOB: \"blob\",\n  STREAM: \"stream\",\n};\n\n// Parse a 64-bit unsigned integer from a buffer\nexport function readBigUInt64LE(buffer: Buffer, index: number): number {\n  var buf = Buffer.from(buffer.subarray(index, index + 8));\n  buf.swap64();\n\n  return parseInt(`0x${buf.toString(\"hex\")}`);\n};\n\n// C-style uInt32 Multiply (discards higher bits, when JS multiply discards lower bits)\nexport const uMul = (a: number, b: number) => Math.imul(a, b) >>> 0;\n\ninterface StreamLike {\n  on: Function;\n  pause: Function;\n  resume: Function;\n}\n\nexport function isStream(obj: unknown): obj is StreamLike {\n  if (!obj || typeof obj !== 'object') return false;\n  const streamLike = obj as StreamLike;\n  return typeof streamLike.on === \"function\" &&\n         typeof streamLike.pause === \"function\" &&\n         typeof streamLike.resume === \"function\";\n}\n\n// Return the type of the input.\n// The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.\n// If the type is not supported, throw an exception.\nexport function getTypeOf(input: string|Buffer|Blob|Array<any>|ArrayBuffer|Uint8Array): string {\n  if (typeof input === \"string\") {\n    if (!Support.string)\n      throw new Error(Errors.DATATYPE_STRING_UNSUPPORTED);\n    return DATATYPE.STRING;\n  }\n  else if (Object.prototype.toString.call(input) === \"[object Array]\") {\n    if (!Support.array)\n      throw new Error(Errors.DATATYPE_ARRAY_UNSUPPORTED);\n    return DATATYPE.ARRAY;\n  }\n  else if (Buffer.isBuffer(input)) {\n    if (!Support.buffer)\n      throw new Error(Errors.DATATYPE_BUFFER_UNSUPPORTED);\n    return DATATYPE.BUFFER;\n  }  else if (input instanceof Blob) {\n    if (!Support.blob)\n      throw new Error(Errors.DATATYPE_BLOB_UNSUPPORTED);\n    return DATATYPE.BLOB;\n  } else if (input instanceof Uint8Array) {\n    if (!Support.uint8array)\n      throw new Error(Errors.DATATYPE_U8ARRAY_UNSUPPORTED);\n    return DATATYPE.U8ARRAY;\n  }\n  else if (input instanceof ArrayBuffer) {\n    if (!Support.arrayBuffer)\n      throw new Error(Errors.DATATYPE_ARRAYBUFFER_UNSUPPORTED);\n    return DATATYPE.ARRAYBUFFER;\n  } else {  // Add an else block to handle unsupported types\n    throw new Error(Errors.DATATYPE_UNSUPPORTED);\n  }\n};\n\n/**\n * Check if a filename is NeoZip metadata (any META-INF/** path).\n * Case-insensitive on the META-INF/ prefix (NEOZIP_APPNOTE.md \u00A72.3 / \u00A76.2).\n */\nexport const isMetadataFile = (filename: string): boolean => {\n  return isMetaInfPath(filename);\n};\n", "/**\n * Progress tracker for streaming operations\n * Provides real-time progress updates and ETA calculations\n */\nexport class ProgressTracker {\n  private startTime: number;\n  private lastUpdateTime: number;\n  private totalBytes: number;\n  private processedBytes: number;\n  private fileName: string;\n  private lastReportedPercent: number = -1;\n\n  constructor(fileName: string, totalBytes: number) {\n    this.fileName = fileName;\n    this.totalBytes = totalBytes;\n    this.processedBytes = 0;\n    this.startTime = Date.now();\n    this.lastUpdateTime = this.startTime;\n  }\n\n  /**\n   * Update progress with bytes processed\n   * @param bytesProcessed - Number of bytes processed in this update\n   */\n  update(bytesProcessed: number): void {\n    this.processedBytes += bytesProcessed;\n    this.reportProgress();\n  }\n\n  /**\n   * Set total bytes (useful when file size changes)\n   */\n  setTotalBytes(totalBytes: number): void {\n    this.totalBytes = totalBytes;\n  }\n\n  /**\n   * Report progress if enough time has passed or significant progress made\n   */\n  private reportProgress(): void {\n    const now = Date.now();\n    const percent = Math.floor((this.processedBytes / this.totalBytes) * 100);\n    \n    // Report if:\n    // 1. 1% or more progress made, OR\n    // 2. 500ms have passed since last report\n    const shouldReport = \n      percent > this.lastReportedPercent || \n      (now - this.lastUpdateTime) > 500;\n\n    if (shouldReport) {\n      this.lastReportedPercent = percent;\n      this.lastUpdateTime = now;\n      this.printProgress();\n    }\n  }\n\n  /**\n   * Print progress information\n   */\n  private printProgress(): void {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    const rate = this.processedBytes / elapsed;\n    const eta = this.totalBytes > this.processedBytes \n      ? (this.totalBytes - this.processedBytes) / rate \n      : 0;\n    const percent = Math.floor((this.processedBytes / this.totalBytes) * 100);\n\n    const formatBytes = (bytes: number): string => {\n      const units = ['B', 'KB', 'MB', 'GB'];\n      let size = bytes;\n      let unitIndex = 0;\n      \n      while (size >= 1024 && unitIndex < units.length - 1) {\n        size /= 1024;\n        unitIndex++;\n      }\n      \n      return `${size.toFixed(1)}${units[unitIndex]}`;\n    };\n\n    const formatTime = (seconds: number): string => {\n      if (seconds < 60) return `${seconds.toFixed(0)}s`;\n      if (seconds < 3600) return `${Math.floor(seconds / 60)}m ${(seconds % 60).toFixed(0)}s`;\n      return `${Math.floor(seconds / 3600)}h ${Math.floor((seconds % 3600) / 60)}m`;\n    };\n\n    process.stdout.write(\n      `\\r${this.fileName}: ${percent}% (${formatBytes(this.processedBytes)}/${formatBytes(this.totalBytes)}) ` +\n      `[${formatBytes(rate)}/s] ETA: ${formatTime(eta)}`\n    );\n  }\n\n  /**\n   * Complete progress tracking\n   */\n  complete(): void {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    const rate = this.processedBytes / elapsed;\n    \n    const formatBytes = (bytes: number): string => {\n      const units = ['B', 'KB', 'MB', 'GB'];\n      let size = bytes;\n      let unitIndex = 0;\n      \n      while (size >= 1024 && unitIndex < units.length - 1) {\n        size /= 1024;\n        unitIndex++;\n      }\n      \n      return `${size.toFixed(1)}${units[unitIndex]}`;\n    };\n\n    console.log(\n      `\\r${this.fileName}: 100% (${formatBytes(this.processedBytes)}) ` +\n      `[${formatBytes(rate)}/s] completed in ${elapsed.toFixed(1)}s`\n    );\n  }\n\n  /**\n   * Get current progress percentage\n   */\n  getProgressPercent(): number {\n    return Math.floor((this.processedBytes / this.totalBytes) * 100);\n  }\n\n  /**\n   * Get processing rate in bytes per second\n   */\n  getProcessingRate(): number {\n    const elapsed = (Date.now() - this.startTime) / 1000;\n    return this.processedBytes / elapsed;\n  }\n}\n", "/**\n * Encryption Manager for NeoZipKit\n * Manages different encryption providers and provides a unified interface\n */\n\nimport { EncryptionProvider, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionMethod } from './types';\nimport { ZipCrypto } from './ZipCrypto';\nimport { AesCrypto } from './AesCrypto';\n\nexport class EncryptionManager {\n  private providers: Map<EncryptionMethod, EncryptionProvider> = new Map();\n\n  constructor() {\n    // Register default encryption providers\n    this.registerProvider(new ZipCrypto());\n  }\n\n  /**\n   * Register a new encryption provider\n   */\n  registerProvider(provider: EncryptionProvider): void {\n    if (provider.canHandle(EncryptionMethod.ZIP_CRYPTO)) {\n      this.providers.set(EncryptionMethod.ZIP_CRYPTO, provider);\n    }\n    if (provider.canHandle(EncryptionMethod.AES_256)) {\n      this.providers.set(EncryptionMethod.AES_256, provider);\n    }\n  }\n\n  /**\n   * Get available encryption methods\n   */\n  getAvailableMethods(): EncryptionMethod[] {\n    return Array.from(this.providers.keys());\n  }\n\n  /**\n   * Get encryption provider for a specific method\n   */\n  getProvider(method: EncryptionMethod): EncryptionProvider | null {\n    return this.providers.get(method) || null;\n  }\n\n  /**\n   * Encrypt data using specified method\n   */\n  async encrypt(data: Buffer, options: EncryptionOptions): Promise<EncryptionResult> {\n    const provider = this.getProvider(options.method);\n    if (!provider) {\n      return {\n        success: false,\n        error: `No encryption provider available for method ${options.method}`\n      };\n    }\n\n    return await provider.encrypt(data, options);\n  }\n\n  /**\n   * Decrypt data using specified method\n   */\n  async decrypt(data: Buffer, options: EncryptionOptions): Promise<DecryptionResult> {\n    const provider = this.getProvider(options.method);\n    if (!provider) {\n      return {\n        success: false,\n        error: `No decryption provider available for method ${options.method}`\n      };\n    }\n\n    return await provider.decrypt(data, options);\n  }\n\n  /**\n   * Get recommended encryption method (ZIP_CRYPTO)\n   */\n  getRecommendedMethod(): EncryptionMethod {\n    return EncryptionMethod.AES_256;\n  }\n\n  /**\n   * Validate encryption options\n   */\n  validateOptions(options: EncryptionOptions): { isValid: boolean; errors: string[] } {\n    const errors: string[] = [];\n\n    if (!options.method) {\n      errors.push('Encryption method is required');\n    }\n\n    if (!options.password || options.password.length === 0) {\n      errors.push('Password is required');\n    }\n\n    if (options.password && options.password.length < 4) {\n      errors.push('Password must be at least 4 characters long');\n    }\n\n    return {\n      isValid: errors.length === 0,\n      errors: errors\n    };\n  }\n\n  /**\n   * Get encryption method info\n   */\n  getMethodInfo(method: EncryptionMethod): { name: string; keyLength: number; secure: boolean } | null {\n    const provider = this.getProvider(method);\n    if (!provider) {\n      return null;\n    }\n\n    return {\n      name: provider.getMethodName(),\n      keyLength: provider.getKeyLength(),\n      secure: method === EncryptionMethod.AES_256\n    };\n  }\n\n  /**\n   * List all available encryption methods with their details\n   */\n  listMethods(): Array<{ method: EncryptionMethod; name: string; keyLength: number; secure: boolean }> {\n    const methods: Array<{ method: EncryptionMethod; name: string; keyLength: number; secure: boolean }> = [];\n    \n    for (const [method, provider] of this.providers) {\n      methods.push({\n        method: method,\n        name: provider.getMethodName(),\n        keyLength: provider.getKeyLength(),\n        secure: method === EncryptionMethod.AES_256\n      });\n    }\n\n    return methods.sort((a, b) => {\n      // Sort by name\n      return a.name.localeCompare(b.name);\n    });\n  }\n}\n", "// Import package.json to get the version\n// import * as path from 'path';\n// import * as fs from 'fs';\n\n// Resolve package.json path - works with both normal installs and symlinks\n// Walk up from __dirname to find package.json\n// let packageJsonPath: string | null = null;\n// let currentDir = __dirname;\n\n// Walk up the directory tree to find package.json\n// while (currentDir !== path.dirname(currentDir)) {\n//   const candidate = path.join(currentDir, 'package.json');\n//   if (fs.existsSync(candidate)) {\n//     packageJsonPath = candidate;\n//     break;\n//   }\n//   currentDir = path.dirname(currentDir);\n// }\n\n// if (!packageJsonPath) {\n//   throw new Error('Cannot find package.json for neozipkit');\n// }\n\n// const packageJson = JSON.parse(fs.readFileSync(packageJsonPath, 'utf8'));\n\n// Get current date for release date\nconst currentDate = new Date();\nconst releaseDate = `${String(currentDate.getMonth() + 1).padStart(2, '0')}-${String(currentDate.getDate()).padStart(2, '0')}-${currentDate.getFullYear()}`;\n\nexport const VERSION = {\n  number: '1.0.5', // packageJson.version\n  date: releaseDate\n}; ", "/**\n * Core Module Exports\n * Core ZIP functionality (platform-agnostic)\n */\n\n// Core ZIP classes\nimport Zipkit from './Zipkit';\nexport * from './Zipkit';\nexport * from './ZipEntry';\nexport { ZipCompress } from './ZipCompress';\nexport type { CompressOptions, CreateZipOptions } from './ZipCompress';\nexport type { DecompressionResult, DecompressionOptions } from './ZipDecompress';\nexport { ZipCopy } from './ZipCopy';\nexport type {\n  CopyOptions,\n  CopyResult,\n  CopyEntriesOnlyResult,\n  FinalizeZipOptions,\n} from './ZipCopy';\nexport default Zipkit;\n\n// Shared components\nexport { default as HashCalculator, HashCalculator as HashCalculatorClass } from './components/HashCalculator';\nexport * from './components/Util';\nexport * from './components/Support';\nexport { ProgressTracker } from './components/ProgressTracker';\nexport * from './merkle/MerkleRoot';\n\n// Encryption functionality\nexport { EncryptionManager } from './encryption/Manager';\nexport { ZipCrypto, crc32, crc32update, sha256 } from './encryption/ZipCrypto';\nexport type { EncryptionMethod, EncryptionOptions, EncryptionResult, DecryptionResult, EncryptionProvider } from './encryption/types';\n\n// Types and constants\nexport * from '../types';\nexport * from './constants/Headers';\nexport {\n  META_TOKEN_NZIP,\n  META_TOKEN_NZIP_LEGACY,\n  META_TS_SUBMIT_NZIP,\n  META_TIMESTAMP_NZIP,\n  META_TS_SUBMIT_OTS,\n  META_TIMESTAMP_OTS,\n  META_MANIFEST_JSON,\n  asciiPathEqualsIgnoreCase,\n  isMetaInfPath,\n  isReservedMetaPath,\n  findReservedMetaEntry,\n} from './constants/MetaPaths';\nexport * from './constants/Errors';\nexport * from './version';\n\n// Logger utility\nexport { Logger, configureLoggerFromEnvironment } from './components/Logger';\nexport type { LogLevel, LoggerConfig } from './components/Logger';\n\n", "// ======================================\n//\tZipkitBrowser.ts\n//  Copyright (c) 2025 NeoWare, Inc. All rights reserved.\n// ======================================\n\nimport Zipkit, { CompressOptions, CreateZipOptions } from '../core';\nimport ZipEntry from '../core/ZipEntry';\nimport { ZipCompress } from '../core/ZipCompress';\nimport Errors from '../core/constants/Errors';\nimport * as Headers from '../core/constants/Headers';\nimport { isMetaInfPath } from '../core/constants/MetaPaths';\nimport { sha256, crc32 } from '../core/encryption/ZipCrypto';\nimport { DATATYPE, getTypeOf } from '../core/components/Util';\nimport type { FileData } from '../types';\nimport HashCalculator from '../core/components/HashCalculator';\n\n// Re-export everything from Zipkit\nexport * from '../core';\nexport { ZipEntry, Errors, Headers, sha256, getTypeOf };\n\n// ======================================\n//\tZipkitBrowser\n// ======================================\n\nexport default class ZipkitBrowser extends Zipkit {\n  constructor() {\n    super();      // Call the parent constructor\n\n    // console.log('Zipkit.support.isNode: ', Zipkit.support.isNode);\n    // console.log('Zipkit.support.buffer: ', Zipkit.support.buffer);\n    // console.log('Zipkit.support.blob: ', Zipkit.support.blob);\n    // console.log('Zipkit.support.streams: ', Zipkit.support.streams);\n    // console.log('Zipkit.support.fileReader: ', Zipkit.support.fileReader);\n  }\n\n  // --------------------------------------\n  // Load a ZIP file from a Blob and return the ZipEntry array\n  // Always uses loadZip() to ensure proper initialization\n\n  async loadZipBlob(data: Blob): Promise<ZipEntry[] | null> {\n    if (getTypeOf(data) !== DATATYPE.BLOB) {\n      throw new Error(Errors.DATATYPE_UNSUPPORTED);\n    }\n\n    return new Promise((resolve, reject) => {\n      const reader = new window.FileReader();\n      reader.readAsArrayBuffer(data);\n\n      reader.onload = (e: ProgressEvent<FileReader>) => {\n        if (!reader.result) {\n          reject(new Error('Failed to read file'));\n          return;\n        }\n        \n        try {\n          // Convert ArrayBuffer to Buffer\n          const buffer = Buffer.from(reader.result as ArrayBuffer);\n          \n          // Always use loadZip() which:\n          // 1. Resets ZIP data\n          // 2. Stores buffer in this.inBuffer\n          // 3. Loads EOCD and parses central directory\n          // 4. Stores entries in this.zipEntries\n          // 5. Returns the entries\n          const entries = super.loadZip(buffer);\n          resolve(entries);\n        } catch (error) {\n          reject(error);\n        }\n      };\n\n      reader.onerror = () => {\n        reject(reader.error || new Error('Failed to read file'));\n      };\n    });\n  }\n\n  // --------------------------------------\n  // Create a ZipEntry for a File object\n\n  createZipFileEntry(file: FileData): ZipEntry {\n    const entry = super.createZipEntry(file.name);\n    entry.fileData = file;\n    entry.uncompressedSize = file.size;\n\n    const fileDate = new Date(file.lastModified);\n    entry.timeDateDOS = entry.setDateTime(fileDate);\n    entry.cmpMethod = Headers.CMP_METHOD.DEFLATED;\n\n    return entry;\n  }\n\n  // --------------------------------------\n  // Calculate the SHA256 hash of a File object\n\n  async hashFile(file: FileData): Promise<string> {\n    const arrayBuffer = await file.arrayBuffer();\n    const buffer = Buffer.from(arrayBuffer);\n    return sha256(buffer);\n  }\n\n  // --------------------------------------\n  // Compress the data and return the compressed data buffer\n  // Set the ZipEntry compressSize and CRC32 values\n\n  async compressDataBlob(entry: ZipEntry, data: Blob, options?: CompressOptions): Promise<Buffer> {\n    if (getTypeOf(data) !== DATATYPE.BLOB) {\n      throw new Error(Errors.DATATYPE_UNSUPPORTED);\n    }\n\n    return new Promise(async (resolve, reject) => {\n      const _compressData = async (entry: ZipEntry, data: Buffer, options?: CompressOptions): Promise<Buffer> => {\n        // Use Zipkit wrapper method\n        return await this.compressData(entry, data, options);\n      };\n\n      const reader = new window.FileReader();\n      reader.readAsArrayBuffer(data);\n\n      reader.onload = async function(this: FileReader, e: ProgressEvent<FileReader>) {\n        if (!this.result) {\n          reject(new Error('Failed to read file'));\n          return;\n        }\n        try {\n          const _inBuf = Buffer.from(this.result as ArrayBuffer);\n          const result = await _compressData(entry, _inBuf, options);\n          resolve(result);\n        } catch (error) {\n          reject(error);\n        }\n      };\n\n      reader.onerror = function(this: FileReader, e: ProgressEvent<FileReader>) {\n        reject(this.error || new Error('Failed to read file'));\n      };\n    });\n  }\n\n  // --------------------------------------\n  // Extract a Blob from a ZipEntry\n\n  async extractBlob(entry: ZipEntry, skipHashCheck?: boolean): Promise<Blob | null> {\n    try {\n      const _outBuf = await this.extract(entry, skipHashCheck);\n      if (!_outBuf) return null;\n      \n      // Convert Buffer to Uint8Array for Blob compatibility\n      const uint8Array = new Uint8Array(_outBuf);\n      return new Blob([uint8Array], { type: 'application/octet-stream' });\n    } catch (error) {\n      throw error;\n    }\n  }\n\n  // --------------------------------------\n  // Create a ZIP file in memory and return a Blob\n\n  async createZipBlob(cmpOptions?: CompressOptions, options?: CreateZipOptions): Promise<Blob | null> {\n    const _onError = options?.onError || (() => {});\n    const _onEntryDone = options?.onEntryDone || (() => {});\n\n    const zipEntries = super.getDirectory();\n    if (!zipEntries) {\n      _onError(new Error(Errors.NO_FILES));\n      return null;\n    }\n\n    let offset = 0;\n    const buffers: Buffer[] = [];\n\n    for (const entry of zipEntries) {\n      if (!entry.isUpdated) {\n        // Check for META-INF metadata files even in copy mode\n        if (isMetaInfPath(entry.filename || '')) {\n          // Force this entry to be processed with special handling instead of copied\n          entry.isUpdated = true;\n          // Don't continue here - let it fall through to special handling below\n        } else {\n          const inData = await super.copyEntry(entry);\n          entry.localHdrOffset = offset;\n          offset += inData.length;\n          buffers.push(inData);\n          _onEntryDone(entry, 'Copied');\n          continue;\n        }\n      }\n\n      if (!entry.fileData) {\n        _onError(new Error(Errors.FILE_NOT_FOUND));\n        return null;\n      }\n\n      const fileBuffer = await entry.fileData.arrayBuffer();\n      \n      // Special handling for already-compressed entries - use existing compressed data\n      if (entry.cmpData && entry.compressedSize && entry.crc) {\n        // Entry is already compressed, use the existing compressed data\n        const localHdr = entry.createLocalHdr();\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + entry.cmpData.length;\n        \n        buffers.push(localHdr);\n        buffers.push(entry.cmpData);\n        _onEntryDone(entry, 'Written (pre-compressed)');\n        continue;\n      }\n      \n      // Special handling for META-INF metadata files - store uncompressed with CRC-32\n      if (isMetaInfPath(entry.filename || '')) {\n        // For metadata files, use STORED compression (no compression)\n        const buffer = Buffer.from(fileBuffer);\n        \n        // Calculate CRC-32 for the metadata file (not SHA-256 to avoid Merkle Root interference)\n        entry.crc = crc32(buffer);\n        \n        // Set up entry for STORED compression\n        entry.cmpMethod = 0; // STORED\n        entry.compressedSize = buffer.length;\n        entry.uncompressedSize = buffer.length;\n        \n        // Do NOT set SHA-256 hash for metadata files to avoid Merkle Root calculation\n        // entry.sha256 should remain undefined for metadata files\n        \n        const localHdr = entry.createLocalHdr();\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + buffer.length;\n        \n        buffers.push(localHdr);\n        buffers.push(buffer);\n        _onEntryDone(entry, 'Stored (metadata)');\n      } else {\n        // Normal file processing with compression\n        const cmpData = await this.compressData(entry, Buffer.from(fileBuffer), cmpOptions);\n        const localHdr = entry.createLocalHdr();\n\n        entry.localHdrOffset = offset;\n        offset += localHdr.length + cmpData.length;\n\n        buffers.push(localHdr);\n        buffers.push(cmpData);\n        _onEntryDone(entry, 'Written');\n      }\n    }\n\n    const centralDirOffset = offset;\n    for (const entry of zipEntries) {\n      const centralDirEntry = entry.centralDirEntry();\n      offset += centralDirEntry.length;\n      buffers.push(centralDirEntry);\n    }\n\n    const centralDirSize = offset - centralDirOffset;\n    const ceBuf = super.centralEndHdr(centralDirSize, centralDirOffset);\n    buffers.push(ceBuf);\n\n    const combinedBuffer = Buffer.concat(buffers);\n    // Convert Buffer to Uint8Array for Blob compatibility\n    const uint8Array = new Uint8Array(combinedBuffer);\n    return new Blob([uint8Array], { type: 'application/zip' });\n  }\n\n  /**\n   * Checks if a filename is a metadata file (META-INF) that should be excluded from Merkle Root calculation\n   * @param filename - The filename to check\n   * @returns boolean - True if the file is a metadata file\n   */\n  private isMetadataFile(filename: string): boolean {\n    return isMetaInfPath(filename);\n  }\n\n  // --------------------------------------\n  // Helper method: Add a file to the ZIP with compression\n  // Simplifies the common workflow of creating entry + compressing\n\n  async addFile(file: FileData, options?: CompressOptions): Promise<ZipEntry> {\n    // Create entry\n    const entry = this.createZipFileEntry(file);\n    \n    // Compress the file\n    // In browser, File objects implement both FileData and Blob interfaces\n    // We need to convert FileData to Blob for compressDataBlob\n    const fileBlob = file as unknown as Blob;\n    const compressedData = await this.compressDataBlob(entry, fileBlob, options);\n    entry.cmpData = compressedData;\n    \n    return entry;\n  }\n\n  // --------------------------------------\n  // Verify a ZIP entry by attempting to extract it\n  // Returns true if the entry is valid, false otherwise\n\n  async verifyEntry(entry: ZipEntry, skipHashCheck?: boolean): Promise<boolean> {\n    try {\n      const blob = await this.extractBlob(entry, skipHashCheck);\n      return blob !== null;\n    } catch (error) {\n      console.error(`Verification failed for ${entry.filename}:`, error);\n      return false;\n    }\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAEA,YAAQ,aAAa;AACrB,YAAQ,cAAc;AACtB,YAAQ,gBAAgB;AAExB,QAAI,SAAS,CAAC;AACd,QAAI,YAAY,CAAC;AACjB,QAAI,MAAM,OAAO,eAAe,cAAc,aAAa;AAE3D,QAAI,OAAO;AACX,SAAS,IAAI,GAAG,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE,GAAG;AAC/C,aAAO,CAAC,IAAI,KAAK,CAAC;AAClB,gBAAU,KAAK,WAAW,CAAC,CAAC,IAAI;AAAA,IAClC;AAHS;AAAO;AAOhB,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAC/B,cAAU,IAAI,WAAW,CAAC,CAAC,IAAI;AAE/B,aAAS,QAAS,KAAK;AACrB,UAAIA,OAAM,IAAI;AAEd,UAAIA,OAAM,IAAI,GAAG;AACf,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAIA,UAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,UAAI,aAAa,GAAI,YAAWA;AAEhC,UAAI,kBAAkB,aAAaA,OAC/B,IACA,IAAK,WAAW;AAEpB,aAAO,CAAC,UAAU,eAAe;AAAA,IACnC;AAGA,aAAS,WAAY,KAAK;AACxB,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAC5B,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK,UAAU,iBAAiB;AACpD,cAAS,WAAW,mBAAmB,IAAI,IAAK;AAAA,IAClD;AAEA,aAAS,YAAa,KAAK;AACzB,UAAI;AACJ,UAAI,OAAO,QAAQ,GAAG;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,kBAAkB,KAAK,CAAC;AAE5B,UAAI,MAAM,IAAI,IAAI,YAAY,KAAK,UAAU,eAAe,CAAC;AAE7D,UAAI,UAAU;AAGd,UAAIA,OAAM,kBAAkB,IACxB,WAAW,IACX;AAEJ,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAID,MAAKC,MAAK,GAAG;AAC3B,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,KACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACrC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC;AACjC,YAAI,SAAS,IAAK,OAAO,KAAM;AAC/B,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,IAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,UAAI,oBAAoB,GAAG;AACzB,cACG,UAAU,IAAI,WAAWA,EAAC,CAAC,KAAK,KAChC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK,IACpC,UAAU,IAAI,WAAWA,KAAI,CAAC,CAAC,KAAK;AACvC,YAAI,SAAS,IAAK,OAAO,IAAK;AAC9B,YAAI,SAAS,IAAI,MAAM;AAAA,MACzB;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAiB,KAAK;AAC7B,aAAO,OAAO,OAAO,KAAK,EAAI,IAC5B,OAAO,OAAO,KAAK,EAAI,IACvB,OAAO,OAAO,IAAI,EAAI,IACtB,OAAO,MAAM,EAAI;AAAA,IACrB;AAEA,aAAS,YAAa,OAAO,OAAO,KAAK;AACvC,UAAI;AACJ,UAAI,SAAS,CAAC;AACd,eAASA,KAAI,OAAOA,KAAI,KAAKA,MAAK,GAAG;AACnC,eACI,MAAMA,EAAC,KAAK,KAAM,aAClB,MAAMA,KAAI,CAAC,KAAK,IAAK,UACtB,MAAMA,KAAI,CAAC,IAAI;AAClB,eAAO,KAAK,gBAAgB,GAAG,CAAC;AAAA,MAClC;AACA,aAAO,OAAO,KAAK,EAAE;AAAA,IACvB;AAEA,aAAS,cAAe,OAAO;AAC7B,UAAI;AACJ,UAAID,OAAM,MAAM;AAChB,UAAI,aAAaA,OAAM;AACvB,UAAI,QAAQ,CAAC;AACb,UAAI,iBAAiB;AAGrB,eAASC,KAAI,GAAGC,QAAOF,OAAM,YAAYC,KAAIC,OAAMD,MAAK,gBAAgB;AACtE,cAAM,KAAK,YAAY,OAAOA,IAAIA,KAAI,iBAAkBC,QAAOA,QAAQD,KAAI,cAAe,CAAC;AAAA,MAC7F;AAGA,UAAI,eAAe,GAAG;AACpB,cAAM,MAAMD,OAAM,CAAC;AACnB,cAAM;AAAA,UACJ,OAAO,OAAO,CAAC,IACf,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACF;AAAA,MACF,WAAW,eAAe,GAAG;AAC3B,eAAO,MAAMA,OAAM,CAAC,KAAK,KAAK,MAAMA,OAAM,CAAC;AAC3C,cAAM;AAAA,UACJ,OAAO,OAAO,EAAE,IAChB,OAAQ,OAAO,IAAK,EAAI,IACxB,OAAQ,OAAO,IAAK,EAAI,IACxB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,KAAK,EAAE;AAAA,IACtB;AAAA;AAAA;;;ACrJA;AAAA;AACA,YAAQ,OAAO,SAAU,QAAQ,QAAQ,MAAM,MAAM,QAAQ;AAC3D,UAAI,GAAG;AACP,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,QAAQ;AACZ,UAAI,IAAI,OAAQ,SAAS,IAAK;AAC9B,UAAI,IAAI,OAAO,KAAK;AACpB,UAAI,IAAI,OAAO,SAAS,CAAC;AAEzB,WAAK;AAEL,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAO,OAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAC;AAE3E,UAAI,KAAM,KAAM,CAAC,SAAU;AAC3B,YAAO,CAAC;AACR,eAAS;AACT,aAAO,QAAQ,GAAG,IAAK,IAAI,MAAO,OAAO,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG;AAAA,MAAC;AAE3E,UAAI,MAAM,GAAG;AACX,YAAI,IAAI;AAAA,MACV,WAAW,MAAM,MAAM;AACrB,eAAO,IAAI,OAAQ,IAAI,KAAK,KAAK;AAAA,MACnC,OAAO;AACL,YAAI,IAAI,KAAK,IAAI,GAAG,IAAI;AACxB,YAAI,IAAI;AAAA,MACV;AACA,cAAQ,IAAI,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI;AAAA,IAChD;AAEA,YAAQ,QAAQ,SAAU,QAAQ,OAAO,QAAQ,MAAM,MAAM,QAAQ;AACnE,UAAI,GAAG,GAAG;AACV,UAAI,OAAQ,SAAS,IAAK,OAAO;AACjC,UAAI,QAAQ,KAAK,QAAQ;AACzB,UAAI,QAAQ,QAAQ;AACpB,UAAI,KAAM,SAAS,KAAK,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAC9D,UAAI,IAAI,OAAO,IAAK,SAAS;AAC7B,UAAI,IAAI,OAAO,IAAI;AACnB,UAAI,IAAI,QAAQ,KAAM,UAAU,KAAK,IAAI,QAAQ,IAAK,IAAI;AAE1D,cAAQ,KAAK,IAAI,KAAK;AAEtB,UAAI,MAAM,KAAK,KAAK,UAAU,UAAU;AACtC,YAAI,MAAM,KAAK,IAAI,IAAI;AACvB,YAAI;AAAA,MACN,OAAO;AACL,YAAI,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG;AACzC,YAAI,SAAS,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG;AACrC;AACA,eAAK;AAAA,QACP;AACA,YAAI,IAAI,SAAS,GAAG;AAClB,mBAAS,KAAK;AAAA,QAChB,OAAO;AACL,mBAAS,KAAK,KAAK,IAAI,GAAG,IAAI,KAAK;AAAA,QACrC;AACA,YAAI,QAAQ,KAAK,GAAG;AAClB;AACA,eAAK;AAAA,QACP;AAEA,YAAI,IAAI,SAAS,MAAM;AACrB,cAAI;AACJ,cAAI;AAAA,QACN,WAAW,IAAI,SAAS,GAAG;AACzB,eAAM,QAAQ,IAAK,KAAK,KAAK,IAAI,GAAG,IAAI;AACxC,cAAI,IAAI;AAAA,QACV,OAAO;AACL,cAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI;AACrD,cAAI;AAAA,QACN;AAAA,MACF;AAEA,aAAO,QAAQ,GAAG,OAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAC;AAE/E,UAAK,KAAK,OAAQ;AAClB,cAAQ;AACR,aAAO,OAAO,GAAG,OAAO,SAAS,CAAC,IAAI,IAAI,KAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,MAAC;AAE9E,aAAO,SAAS,IAAI,CAAC,KAAK,IAAI;AAAA,IAChC;AAAA;AAAA;;;ACpFA;AAAA;AAAA;AAUA,QAAM,SAAS;AACf,QAAM,UAAU;AAChB,QAAM,sBACH,OAAO,WAAW,cAAc,OAAO,OAAO,KAAK,MAAM,aACtD,OAAO,KAAK,EAAE,4BAA4B,IAC1C;AAEN,YAAQ,SAASG;AACjB,YAAQ,aAAa;AACrB,YAAQ,oBAAoB;AAE5B,QAAM,eAAe;AACrB,YAAQ,aAAa;AAgBrB,IAAAA,QAAO,sBAAsB,kBAAkB;AAE/C,QAAI,CAACA,QAAO,uBAAuB,OAAO,YAAY,eAClD,OAAO,QAAQ,UAAU,YAAY;AACvC,cAAQ;AAAA,QACN;AAAA,MAEF;AAAA,IACF;AAEA,aAAS,oBAAqB;AAE5B,UAAI;AACF,cAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,cAAM,QAAQ,EAAE,KAAK,WAAY;AAAE,iBAAO;AAAA,QAAG,EAAE;AAC/C,eAAO,eAAe,OAAO,WAAW,SAAS;AACjD,eAAO,eAAe,KAAK,KAAK;AAChC,eAAO,IAAI,IAAI,MAAM;AAAA,MACvB,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,MAChD,YAAY;AAAA,MACZ,KAAK,WAAY;AACf,YAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAED,WAAO,eAAeA,QAAO,WAAW,UAAU;AAAA,MAChD,YAAY;AAAA,MACZ,KAAK,WAAY;AACf,YAAI,CAACA,QAAO,SAAS,IAAI,EAAG,QAAO;AACnC,eAAO,KAAK;AAAA,MACd;AAAA,IACF,CAAC;AAED,aAAS,aAAc,QAAQ;AAC7B,UAAI,SAAS,cAAc;AACzB,cAAM,IAAI,WAAW,gBAAgB,SAAS,gCAAgC;AAAA,MAChF;AAEA,YAAM,MAAM,IAAI,WAAW,MAAM;AACjC,aAAO,eAAe,KAAKA,QAAO,SAAS;AAC3C,aAAO;AAAA,IACT;AAYA,aAASA,QAAQ,KAAK,kBAAkB,QAAQ;AAE9C,UAAI,OAAO,QAAQ,UAAU;AAC3B,YAAI,OAAO,qBAAqB,UAAU;AACxC,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AACA,eAAO,YAAY,GAAG;AAAA,MACxB;AACA,aAAO,KAAK,KAAK,kBAAkB,MAAM;AAAA,IAC3C;AAEA,IAAAA,QAAO,WAAW;AAElB,aAAS,KAAM,OAAO,kBAAkB,QAAQ;AAC9C,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO,WAAW,OAAO,gBAAgB;AAAA,MAC3C;AAEA,UAAI,YAAY,OAAO,KAAK,GAAG;AAC7B,eAAO,cAAc,KAAK;AAAA,MAC5B;AAEA,UAAI,SAAS,MAAM;AACjB,cAAM,IAAI;AAAA,UACR,oHAC0C,OAAO;AAAA,QACnD;AAAA,MACF;AAEA,UAAI,WAAW,OAAO,WAAW,KAC5B,SAAS,WAAW,MAAM,QAAQ,WAAW,GAAI;AACpD,eAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,MACxD;AAEA,UAAI,OAAO,sBAAsB,gBAC5B,WAAW,OAAO,iBAAiB,KACnC,SAAS,WAAW,MAAM,QAAQ,iBAAiB,IAAK;AAC3D,eAAO,gBAAgB,OAAO,kBAAkB,MAAM;AAAA,MACxD;AAEA,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,WAAW,MAAM,QAAQ;AAC/C,UAAI,WAAW,QAAQ,YAAY,OAAO;AACxC,eAAOA,QAAO,KAAK,SAAS,kBAAkB,MAAM;AAAA,MACtD;AAEA,YAAM,IAAI,WAAW,KAAK;AAC1B,UAAI,EAAG,QAAO;AAEd,UAAI,OAAO,WAAW,eAAe,OAAO,eAAe,QACvD,OAAO,MAAM,OAAO,WAAW,MAAM,YAAY;AACnD,eAAOA,QAAO,KAAK,MAAM,OAAO,WAAW,EAAE,QAAQ,GAAG,kBAAkB,MAAM;AAAA,MAClF;AAEA,YAAM,IAAI;AAAA,QACR,oHAC0C,OAAO;AAAA,MACnD;AAAA,IACF;AAUA,IAAAA,QAAO,OAAO,SAAU,OAAO,kBAAkB,QAAQ;AACvD,aAAO,KAAK,OAAO,kBAAkB,MAAM;AAAA,IAC7C;AAIA,WAAO,eAAeA,QAAO,WAAW,WAAW,SAAS;AAC5D,WAAO,eAAeA,SAAQ,UAAU;AAExC,aAAS,WAAY,MAAM;AACzB,UAAI,OAAO,SAAS,UAAU;AAC5B,cAAM,IAAI,UAAU,wCAAwC;AAAA,MAC9D,WAAW,OAAO,GAAG;AACnB,cAAM,IAAI,WAAW,gBAAgB,OAAO,gCAAgC;AAAA,MAC9E;AAAA,IACF;AAEA,aAAS,MAAO,MAAM,MAAM,UAAU;AACpC,iBAAW,IAAI;AACf,UAAI,QAAQ,GAAG;AACb,eAAO,aAAa,IAAI;AAAA,MAC1B;AACA,UAAI,SAAS,QAAW;AAItB,eAAO,OAAO,aAAa,WACvB,aAAa,IAAI,EAAE,KAAK,MAAM,QAAQ,IACtC,aAAa,IAAI,EAAE,KAAK,IAAI;AAAA,MAClC;AACA,aAAO,aAAa,IAAI;AAAA,IAC1B;AAMA,IAAAA,QAAO,QAAQ,SAAU,MAAM,MAAM,UAAU;AAC7C,aAAO,MAAM,MAAM,MAAM,QAAQ;AAAA,IACnC;AAEA,aAAS,YAAa,MAAM;AAC1B,iBAAW,IAAI;AACf,aAAO,aAAa,OAAO,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC;AAAA,IACtD;AAKA,IAAAA,QAAO,cAAc,SAAU,MAAM;AACnC,aAAO,YAAY,IAAI;AAAA,IACzB;AAIA,IAAAA,QAAO,kBAAkB,SAAU,MAAM;AACvC,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,aAAS,WAAY,QAAQ,UAAU;AACrC,UAAI,OAAO,aAAa,YAAY,aAAa,IAAI;AACnD,mBAAW;AAAA,MACb;AAEA,UAAI,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChC,cAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,MACrD;AAEA,YAAM,SAAS,WAAW,QAAQ,QAAQ,IAAI;AAC9C,UAAI,MAAM,aAAa,MAAM;AAE7B,YAAM,SAAS,IAAI,MAAM,QAAQ,QAAQ;AAEzC,UAAI,WAAW,QAAQ;AAIrB,cAAM,IAAI,MAAM,GAAG,MAAM;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,OAAO;AAC7B,YAAM,SAAS,MAAM,SAAS,IAAI,IAAI,QAAQ,MAAM,MAAM,IAAI;AAC9D,YAAM,MAAM,aAAa,MAAM;AAC/B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG;AAClC,YAAI,CAAC,IAAI,MAAM,CAAC,IAAI;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,WAAW;AACjC,UAAI,WAAW,WAAW,UAAU,GAAG;AACrC,cAAM,OAAO,IAAI,WAAW,SAAS;AACrC,eAAO,gBAAgB,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAAA,MACtE;AACA,aAAO,cAAc,SAAS;AAAA,IAChC;AAEA,aAAS,gBAAiB,OAAO,YAAY,QAAQ;AACnD,UAAI,aAAa,KAAK,MAAM,aAAa,YAAY;AACnD,cAAM,IAAI,WAAW,sCAAsC;AAAA,MAC7D;AAEA,UAAI,MAAM,aAAa,cAAc,UAAU,IAAI;AACjD,cAAM,IAAI,WAAW,sCAAsC;AAAA,MAC7D;AAEA,UAAI;AACJ,UAAI,eAAe,UAAa,WAAW,QAAW;AACpD,cAAM,IAAI,WAAW,KAAK;AAAA,MAC5B,WAAW,WAAW,QAAW;AAC/B,cAAM,IAAI,WAAW,OAAO,UAAU;AAAA,MACxC,OAAO;AACL,cAAM,IAAI,WAAW,OAAO,YAAY,MAAM;AAAA,MAChD;AAGA,aAAO,eAAe,KAAKA,QAAO,SAAS;AAE3C,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,KAAK;AACxB,UAAIA,QAAO,SAAS,GAAG,GAAG;AACxB,cAAM,MAAM,QAAQ,IAAI,MAAM,IAAI;AAClC,cAAM,MAAM,aAAa,GAAG;AAE5B,YAAI,IAAI,WAAW,GAAG;AACpB,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,KAAK,GAAG,GAAG,GAAG;AACvB,eAAO;AAAA,MACT;AAEA,UAAI,IAAI,WAAW,QAAW;AAC5B,YAAI,OAAO,IAAI,WAAW,YAAY,YAAY,IAAI,MAAM,GAAG;AAC7D,iBAAO,aAAa,CAAC;AAAA,QACvB;AACA,eAAO,cAAc,GAAG;AAAA,MAC1B;AAEA,UAAI,IAAI,SAAS,YAAY,MAAM,QAAQ,IAAI,IAAI,GAAG;AACpD,eAAO,cAAc,IAAI,IAAI;AAAA,MAC/B;AAAA,IACF;AAEA,aAAS,QAAS,QAAQ;AAGxB,UAAI,UAAU,cAAc;AAC1B,cAAM,IAAI,WAAW,4DACa,aAAa,SAAS,EAAE,IAAI,QAAQ;AAAA,MACxE;AACA,aAAO,SAAS;AAAA,IAClB;AAEA,aAAS,WAAY,QAAQ;AAC3B,UAAI,CAAC,UAAU,QAAQ;AACrB,iBAAS;AAAA,MACX;AACA,aAAOA,QAAO,MAAM,CAAC,MAAM;AAAA,IAC7B;AAEA,IAAAA,QAAO,WAAW,SAAS,SAAU,GAAG;AACtC,aAAO,KAAK,QAAQ,EAAE,cAAc,QAClC,MAAMA,QAAO;AAAA,IACjB;AAEA,IAAAA,QAAO,UAAU,SAAS,QAAS,GAAG,GAAG;AACvC,UAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,UAAI,WAAW,GAAG,UAAU,EAAG,KAAIA,QAAO,KAAK,GAAG,EAAE,QAAQ,EAAE,UAAU;AACxE,UAAI,CAACA,QAAO,SAAS,CAAC,KAAK,CAACA,QAAO,SAAS,CAAC,GAAG;AAC9C,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,EAAG,QAAO;AAEpB,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AAEV,eAAS,IAAI,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,GAAG;AAClD,YAAI,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG;AACjB,cAAI,EAAE,CAAC;AACP,cAAI,EAAE,CAAC;AACP;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,EAAG,QAAO;AAClB,UAAI,IAAI,EAAG,QAAO;AAClB,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,aAAa,SAAS,WAAY,UAAU;AACjD,cAAQ,OAAO,QAAQ,EAAE,YAAY,GAAG;AAAA,QACtC,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO;AAAA,QACT;AACE,iBAAO;AAAA,MACX;AAAA,IACF;AAEA,IAAAA,QAAO,SAAS,SAAS,OAAQ,MAAM,QAAQ;AAC7C,UAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,cAAM,IAAI,UAAU,6CAA6C;AAAA,MACnE;AAEA,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOA,QAAO,MAAM,CAAC;AAAA,MACvB;AAEA,UAAI;AACJ,UAAI,WAAW,QAAW;AACxB,iBAAS;AACT,aAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,oBAAU,KAAK,CAAC,EAAE;AAAA,QACpB;AAAA,MACF;AAEA,YAAM,SAASA,QAAO,YAAY,MAAM;AACxC,UAAI,MAAM;AACV,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,YAAI,MAAM,KAAK,CAAC;AAChB,YAAI,WAAW,KAAK,UAAU,GAAG;AAC/B,cAAI,MAAM,IAAI,SAAS,OAAO,QAAQ;AACpC,gBAAI,CAACA,QAAO,SAAS,GAAG,EAAG,OAAMA,QAAO,KAAK,GAAG;AAChD,gBAAI,KAAK,QAAQ,GAAG;AAAA,UACtB,OAAO;AACL,uBAAW,UAAU,IAAI;AAAA,cACvB;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,CAACA,QAAO,SAAS,GAAG,GAAG;AAChC,gBAAM,IAAI,UAAU,6CAA6C;AAAA,QACnE,OAAO;AACL,cAAI,KAAK,QAAQ,GAAG;AAAA,QACtB;AACA,eAAO,IAAI;AAAA,MACb;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,QAAQ,UAAU;AACrC,UAAIA,QAAO,SAAS,MAAM,GAAG;AAC3B,eAAO,OAAO;AAAA,MAChB;AACA,UAAI,YAAY,OAAO,MAAM,KAAK,WAAW,QAAQ,WAAW,GAAG;AACjE,eAAO,OAAO;AAAA,MAChB;AACA,UAAI,OAAO,WAAW,UAAU;AAC9B,cAAM,IAAI;AAAA,UACR,6FACmB,OAAO;AAAA,QAC5B;AAAA,MACF;AAEA,YAAM,MAAM,OAAO;AACnB,YAAM,YAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM;AAC5D,UAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AAGpC,UAAI,cAAc;AAClB,iBAAS;AACP,gBAAQ,UAAU;AAAA,UAChB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,YAAY,MAAM,EAAE;AAAA,UAC7B,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,MAAM;AAAA,UACf,KAAK;AACH,mBAAO,QAAQ;AAAA,UACjB,KAAK;AACH,mBAAO,cAAc,MAAM,EAAE;AAAA,UAC/B;AACE,gBAAI,aAAa;AACf,qBAAO,YAAY,KAAK,YAAY,MAAM,EAAE;AAAA,YAC9C;AACA,wBAAY,KAAK,UAAU,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AACA,IAAAA,QAAO,aAAa;AAEpB,aAAS,aAAc,UAAU,OAAO,KAAK;AAC3C,UAAI,cAAc;AASlB,UAAI,UAAU,UAAa,QAAQ,GAAG;AACpC,gBAAQ;AAAA,MACV;AAGA,UAAI,QAAQ,KAAK,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,UAAa,MAAM,KAAK,QAAQ;AAC1C,cAAM,KAAK;AAAA,MACb;AAEA,UAAI,OAAO,GAAG;AACZ,eAAO;AAAA,MACT;AAGA,eAAS;AACT,iBAAW;AAEX,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,SAAU,YAAW;AAE1B,aAAO,MAAM;AACX,gBAAQ,UAAU;AAAA,UAChB,KAAK;AACH,mBAAO,SAAS,MAAM,OAAO,GAAG;AAAA,UAElC,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,OAAO,GAAG;AAAA,UAEnC,KAAK;AACH,mBAAO,WAAW,MAAM,OAAO,GAAG;AAAA,UAEpC,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,UAErC,KAAK;AACH,mBAAO,YAAY,MAAM,OAAO,GAAG;AAAA,UAErC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,aAAa,MAAM,OAAO,GAAG;AAAA,UAEtC;AACE,gBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,wBAAY,WAAW,IAAI,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAQA,IAAAA,QAAO,UAAU,YAAY;AAE7B,aAAS,KAAM,GAAG,GAAG,GAAG;AACtB,YAAM,IAAI,EAAE,CAAC;AACb,QAAE,CAAC,IAAI,EAAE,CAAC;AACV,QAAE,CAAC,IAAI;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AAAA,MACrB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AACnB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,YAAM,MAAM,KAAK;AACjB,UAAI,MAAM,MAAM,GAAG;AACjB,cAAM,IAAI,WAAW,2CAA2C;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK,GAAG;AAC/B,aAAK,MAAM,GAAG,IAAI,CAAC;AACnB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACvB,aAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,WAAW,SAAS,WAAY;AAC/C,YAAM,SAAS,KAAK;AACpB,UAAI,WAAW,EAAG,QAAO;AACzB,UAAI,UAAU,WAAW,EAAG,QAAO,UAAU,MAAM,GAAG,MAAM;AAC5D,aAAO,aAAa,MAAM,MAAM,SAAS;AAAA,IAC3C;AAEA,IAAAA,QAAO,UAAU,iBAAiBA,QAAO,UAAU;AAEnD,IAAAA,QAAO,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC5C,UAAI,CAACA,QAAO,SAAS,CAAC,EAAG,OAAM,IAAI,UAAU,2BAA2B;AACxE,UAAI,SAAS,EAAG,QAAO;AACvB,aAAOA,QAAO,QAAQ,MAAM,CAAC,MAAM;AAAA,IACrC;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,UAAW;AAC7C,UAAI,MAAM;AACV,YAAM,MAAM,QAAQ;AACpB,YAAM,KAAK,SAAS,OAAO,GAAG,GAAG,EAAE,QAAQ,WAAW,KAAK,EAAE,KAAK;AAClE,UAAI,KAAK,SAAS,IAAK,QAAO;AAC9B,aAAO,aAAa,MAAM;AAAA,IAC5B;AACA,QAAI,qBAAqB;AACvB,MAAAA,QAAO,UAAU,mBAAmB,IAAIA,QAAO,UAAU;AAAA,IAC3D;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,QAAQ,OAAO,KAAK,WAAW,SAAS;AACnF,UAAI,WAAW,QAAQ,UAAU,GAAG;AAClC,iBAASA,QAAO,KAAK,QAAQ,OAAO,QAAQ,OAAO,UAAU;AAAA,MAC/D;AACA,UAAI,CAACA,QAAO,SAAS,MAAM,GAAG;AAC5B,cAAM,IAAI;AAAA,UACR,mFACoB,OAAO;AAAA,QAC7B;AAAA,MACF;AAEA,UAAI,UAAU,QAAW;AACvB,gBAAQ;AAAA,MACV;AACA,UAAI,QAAQ,QAAW;AACrB,cAAM,SAAS,OAAO,SAAS;AAAA,MACjC;AACA,UAAI,cAAc,QAAW;AAC3B,oBAAY;AAAA,MACd;AACA,UAAI,YAAY,QAAW;AACzB,kBAAU,KAAK;AAAA,MACjB;AAEA,UAAI,QAAQ,KAAK,MAAM,OAAO,UAAU,YAAY,KAAK,UAAU,KAAK,QAAQ;AAC9E,cAAM,IAAI,WAAW,oBAAoB;AAAA,MAC3C;AAEA,UAAI,aAAa,WAAW,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,UAAI,aAAa,SAAS;AACxB,eAAO;AAAA,MACT;AACA,UAAI,SAAS,KAAK;AAChB,eAAO;AAAA,MACT;AAEA,iBAAW;AACX,eAAS;AACT,qBAAe;AACf,mBAAa;AAEb,UAAI,SAAS,OAAQ,QAAO;AAE5B,UAAI,IAAI,UAAU;AAClB,UAAI,IAAI,MAAM;AACd,YAAM,MAAM,KAAK,IAAI,GAAG,CAAC;AAEzB,YAAM,WAAW,KAAK,MAAM,WAAW,OAAO;AAC9C,YAAM,aAAa,OAAO,MAAM,OAAO,GAAG;AAE1C,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,YAAI,SAAS,CAAC,MAAM,WAAW,CAAC,GAAG;AACjC,cAAI,SAAS,CAAC;AACd,cAAI,WAAW,CAAC;AAChB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,EAAG,QAAO;AAClB,UAAI,IAAI,EAAG,QAAO;AAClB,aAAO;AAAA,IACT;AAWA,aAAS,qBAAsB,QAAQ,KAAK,YAAY,UAAU,KAAK;AAErE,UAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,UAAI,OAAO,eAAe,UAAU;AAClC,mBAAW;AACX,qBAAa;AAAA,MACf,WAAW,aAAa,YAAY;AAClC,qBAAa;AAAA,MACf,WAAW,aAAa,aAAa;AACnC,qBAAa;AAAA,MACf;AACA,mBAAa,CAAC;AACd,UAAI,YAAY,UAAU,GAAG;AAE3B,qBAAa,MAAM,IAAK,OAAO,SAAS;AAAA,MAC1C;AAGA,UAAI,aAAa,EAAG,cAAa,OAAO,SAAS;AACjD,UAAI,cAAc,OAAO,QAAQ;AAC/B,YAAI,IAAK,QAAO;AAAA,YACX,cAAa,OAAO,SAAS;AAAA,MACpC,WAAW,aAAa,GAAG;AACzB,YAAI,IAAK,cAAa;AAAA,YACjB,QAAO;AAAA,MACd;AAGA,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAMA,QAAO,KAAK,KAAK,QAAQ;AAAA,MACjC;AAGA,UAAIA,QAAO,SAAS,GAAG,GAAG;AAExB,YAAI,IAAI,WAAW,GAAG;AACpB,iBAAO;AAAA,QACT;AACA,eAAO,aAAa,QAAQ,KAAK,YAAY,UAAU,GAAG;AAAA,MAC5D,WAAW,OAAO,QAAQ,UAAU;AAClC,cAAM,MAAM;AACZ,YAAI,OAAO,WAAW,UAAU,YAAY,YAAY;AACtD,cAAI,KAAK;AACP,mBAAO,WAAW,UAAU,QAAQ,KAAK,QAAQ,KAAK,UAAU;AAAA,UAClE,OAAO;AACL,mBAAO,WAAW,UAAU,YAAY,KAAK,QAAQ,KAAK,UAAU;AAAA,UACtE;AAAA,QACF;AACA,eAAO,aAAa,QAAQ,CAAC,GAAG,GAAG,YAAY,UAAU,GAAG;AAAA,MAC9D;AAEA,YAAM,IAAI,UAAU,sCAAsC;AAAA,IAC5D;AAEA,aAAS,aAAc,KAAK,KAAK,YAAY,UAAU,KAAK;AAC1D,UAAI,YAAY;AAChB,UAAI,YAAY,IAAI;AACpB,UAAI,YAAY,IAAI;AAEpB,UAAI,aAAa,QAAW;AAC1B,mBAAW,OAAO,QAAQ,EAAE,YAAY;AACxC,YAAI,aAAa,UAAU,aAAa,WACpC,aAAa,aAAa,aAAa,YAAY;AACrD,cAAI,IAAI,SAAS,KAAK,IAAI,SAAS,GAAG;AACpC,mBAAO;AAAA,UACT;AACA,sBAAY;AACZ,uBAAa;AACb,uBAAa;AACb,wBAAc;AAAA,QAChB;AAAA,MACF;AAEA,eAAS,KAAM,KAAKC,IAAG;AACrB,YAAI,cAAc,GAAG;AACnB,iBAAO,IAAIA,EAAC;AAAA,QACd,OAAO;AACL,iBAAO,IAAI,aAAaA,KAAI,SAAS;AAAA,QACvC;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,KAAK;AACP,YAAI,aAAa;AACjB,aAAK,IAAI,YAAY,IAAI,WAAW,KAAK;AACvC,cAAI,KAAK,KAAK,CAAC,MAAM,KAAK,KAAK,eAAe,KAAK,IAAI,IAAI,UAAU,GAAG;AACtE,gBAAI,eAAe,GAAI,cAAa;AACpC,gBAAI,IAAI,aAAa,MAAM,UAAW,QAAO,aAAa;AAAA,UAC5D,OAAO;AACL,gBAAI,eAAe,GAAI,MAAK,IAAI;AAChC,yBAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF,OAAO;AACL,YAAI,aAAa,YAAY,UAAW,cAAa,YAAY;AACjE,aAAK,IAAI,YAAY,KAAK,GAAG,KAAK;AAChC,cAAI,QAAQ;AACZ,mBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,gBAAI,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG;AACrC,sBAAQ;AACR;AAAA,YACF;AAAA,UACF;AACA,cAAI,MAAO,QAAO;AAAA,QACpB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,IAAAD,QAAO,UAAU,WAAW,SAAS,SAAU,KAAK,YAAY,UAAU;AACxE,aAAO,KAAK,QAAQ,KAAK,YAAY,QAAQ,MAAM;AAAA,IACrD;AAEA,IAAAA,QAAO,UAAU,UAAU,SAAS,QAAS,KAAK,YAAY,UAAU;AACtE,aAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,IAAI;AAAA,IACnE;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,KAAK,YAAY,UAAU;AAC9E,aAAO,qBAAqB,MAAM,KAAK,YAAY,UAAU,KAAK;AAAA,IACpE;AAEA,aAAS,SAAU,KAAK,QAAQ,QAAQ,QAAQ;AAC9C,eAAS,OAAO,MAAM,KAAK;AAC3B,YAAM,YAAY,IAAI,SAAS;AAC/B,UAAI,CAAC,QAAQ;AACX,iBAAS;AAAA,MACX,OAAO;AACL,iBAAS,OAAO,MAAM;AACtB,YAAI,SAAS,WAAW;AACtB,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,YAAM,SAAS,OAAO;AAEtB,UAAI,SAAS,SAAS,GAAG;AACvB,iBAAS,SAAS;AAAA,MACpB;AACA,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,cAAM,SAAS,SAAS,OAAO,OAAO,IAAI,GAAG,CAAC,GAAG,EAAE;AACnD,YAAI,YAAY,MAAM,EAAG,QAAO;AAChC,YAAI,SAAS,CAAC,IAAI;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,aAAO,WAAW,YAAY,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IACjF;AAEA,aAAS,WAAY,KAAK,QAAQ,QAAQ,QAAQ;AAChD,aAAO,WAAW,aAAa,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IAC7D;AAEA,aAAS,YAAa,KAAK,QAAQ,QAAQ,QAAQ;AACjD,aAAO,WAAW,cAAc,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IAC9D;AAEA,aAAS,UAAW,KAAK,QAAQ,QAAQ,QAAQ;AAC/C,aAAO,WAAW,eAAe,QAAQ,IAAI,SAAS,MAAM,GAAG,KAAK,QAAQ,MAAM;AAAA,IACpF;AAEA,IAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,QAAQ,QAAQ,QAAQ,UAAU;AAEzE,UAAI,WAAW,QAAW;AACxB,mBAAW;AACX,iBAAS,KAAK;AACd,iBAAS;AAAA,MAEX,WAAW,WAAW,UAAa,OAAO,WAAW,UAAU;AAC7D,mBAAW;AACX,iBAAS,KAAK;AACd,iBAAS;AAAA,MAEX,WAAW,SAAS,MAAM,GAAG;AAC3B,iBAAS,WAAW;AACpB,YAAI,SAAS,MAAM,GAAG;AACpB,mBAAS,WAAW;AACpB,cAAI,aAAa,OAAW,YAAW;AAAA,QACzC,OAAO;AACL,qBAAW;AACX,mBAAS;AAAA,QACX;AAAA,MACF,OAAO;AACL,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,SAAS;AAChC,UAAI,WAAW,UAAa,SAAS,UAAW,UAAS;AAEzD,UAAK,OAAO,SAAS,MAAM,SAAS,KAAK,SAAS,MAAO,SAAS,KAAK,QAAQ;AAC7E,cAAM,IAAI,WAAW,wCAAwC;AAAA,MAC/D;AAEA,UAAI,CAAC,SAAU,YAAW;AAE1B,UAAI,cAAc;AAClB,iBAAS;AACP,gBAAQ,UAAU;AAAA,UAChB,KAAK;AACH,mBAAO,SAAS,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE9C,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE/C,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,WAAW,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAEhD,KAAK;AAEH,mBAAO,YAAY,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAEjD,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,UAAU,MAAM,QAAQ,QAAQ,MAAM;AAAA,UAE/C;AACE,gBAAI,YAAa,OAAM,IAAI,UAAU,uBAAuB,QAAQ;AACpE,wBAAY,KAAK,UAAU,YAAY;AACvC,0BAAc;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,IAAAA,QAAO,UAAU,SAAS,SAAS,SAAU;AAC3C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,CAAC;AAAA,MACvD;AAAA,IACF;AAEA,aAAS,YAAa,KAAK,OAAO,KAAK;AACrC,UAAI,UAAU,KAAK,QAAQ,IAAI,QAAQ;AACrC,eAAO,OAAO,cAAc,GAAG;AAAA,MACjC,OAAO;AACL,eAAO,OAAO,cAAc,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,UAAW,KAAK,OAAO,KAAK;AACnC,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAC9B,YAAM,MAAM,CAAC;AAEb,UAAI,IAAI;AACR,aAAO,IAAI,KAAK;AACd,cAAM,YAAY,IAAI,CAAC;AACvB,YAAI,YAAY;AAChB,YAAI,mBAAoB,YAAY,MAChC,IACC,YAAY,MACT,IACC,YAAY,MACT,IACA;AAEZ,YAAI,IAAI,oBAAoB,KAAK;AAC/B,cAAI,YAAY,WAAW,YAAY;AAEvC,kBAAQ,kBAAkB;AAAA,YACxB,KAAK;AACH,kBAAI,YAAY,KAAM;AACpB,4BAAY;AAAA,cACd;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,mBAAK,aAAa,SAAU,KAAM;AAChC,iCAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,oBAAI,gBAAgB,KAAM;AACxB,8BAAY;AAAA,gBACd;AAAA,cACF;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,0BAAY,IAAI,IAAI,CAAC;AACrB,mBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,iCAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AACrF,oBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,8BAAY;AAAA,gBACd;AAAA,cACF;AACA;AAAA,YACF,KAAK;AACH,2BAAa,IAAI,IAAI,CAAC;AACtB,0BAAY,IAAI,IAAI,CAAC;AACrB,2BAAa,IAAI,IAAI,CAAC;AACtB,mBAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,iCAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,oBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,8BAAY;AAAA,gBACd;AAAA,cACF;AAAA,UACJ;AAAA,QACF;AAEA,YAAI,cAAc,MAAM;AAGtB,sBAAY;AACZ,6BAAmB;AAAA,QACrB,WAAW,YAAY,OAAQ;AAE7B,uBAAa;AACb,cAAI,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC1C,sBAAY,QAAS,YAAY;AAAA,QACnC;AAEA,YAAI,KAAK,SAAS;AAClB,aAAK;AAAA,MACP;AAEA,aAAO,sBAAsB,GAAG;AAAA,IAClC;AAKA,QAAM,uBAAuB;AAE7B,aAAS,sBAAuB,YAAY;AAC1C,YAAM,MAAM,WAAW;AACvB,UAAI,OAAO,sBAAsB;AAC/B,eAAO,OAAO,aAAa,MAAM,QAAQ,UAAU;AAAA,MACrD;AAGA,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,IAAI,KAAK;AACd,eAAO,OAAO,aAAa;AAAA,UACzB;AAAA,UACA,WAAW,MAAM,GAAG,KAAK,oBAAoB;AAAA,QAC/C;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAY,KAAK,OAAO,KAAK;AACpC,UAAI,MAAM;AACV,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,OAAO,aAAa,IAAI,CAAC,IAAI,GAAI;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAa,KAAK,OAAO,KAAK;AACrC,UAAI,MAAM;AACV,YAAM,KAAK,IAAI,IAAI,QAAQ,GAAG;AAE9B,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,SAAU,KAAK,OAAO,KAAK;AAClC,YAAM,MAAM,IAAI;AAEhB,UAAI,CAAC,SAAS,QAAQ,EAAG,SAAQ;AACjC,UAAI,CAAC,OAAO,MAAM,KAAK,MAAM,IAAK,OAAM;AAExC,UAAI,MAAM;AACV,eAAS,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,oBAAoB,IAAI,CAAC,CAAC;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,aAAc,KAAK,OAAO,KAAK;AACtC,YAAM,QAAQ,IAAI,MAAM,OAAO,GAAG;AAClC,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,eAAO,OAAO,aAAa,MAAM,CAAC,IAAK,MAAM,IAAI,CAAC,IAAI,GAAI;AAAA,MAC5D;AACA,aAAO;AAAA,IACT;AAEA,IAAAA,QAAO,UAAU,QAAQ,SAAS,MAAO,OAAO,KAAK;AACnD,YAAM,MAAM,KAAK;AACjB,cAAQ,CAAC,CAAC;AACV,YAAM,QAAQ,SAAY,MAAM,CAAC,CAAC;AAElC,UAAI,QAAQ,GAAG;AACb,iBAAS;AACT,YAAI,QAAQ,EAAG,SAAQ;AAAA,MACzB,WAAW,QAAQ,KAAK;AACtB,gBAAQ;AAAA,MACV;AAEA,UAAI,MAAM,GAAG;AACX,eAAO;AACP,YAAI,MAAM,EAAG,OAAM;AAAA,MACrB,WAAW,MAAM,KAAK;AACpB,cAAM;AAAA,MACR;AAEA,UAAI,MAAM,MAAO,OAAM;AAEvB,YAAM,SAAS,KAAK,SAAS,OAAO,GAAG;AAEvC,aAAO,eAAe,QAAQA,QAAO,SAAS;AAE9C,aAAO;AAAA,IACT;AAKA,aAAS,YAAa,QAAQ,KAAK,QAAQ;AACzC,UAAK,SAAS,MAAO,KAAK,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAC/E,UAAI,SAAS,MAAM,OAAQ,OAAM,IAAI,WAAW,uCAAuC;AAAA,IACzF;AAEA,IAAAA,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQE,aAAY,UAAU;AAC/E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,eAAO,KAAK,SAAS,CAAC,IAAI;AAAA,MAC5B;AAEA,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,QAAQE,aAAY,UAAU;AAC/E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,oBAAY,QAAQA,aAAY,KAAK,MAAM;AAAA,MAC7C;AAEA,UAAI,MAAM,KAAK,SAAS,EAAEA,WAAU;AACpC,UAAI,MAAM;AACV,aAAOA,cAAa,MAAM,OAAO,MAAQ;AACvC,eAAO,KAAK,SAAS,EAAEA,WAAU,IAAI;AAAA,MACvC;AAEA,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,YACjBA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQ,UAAU;AACjE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,KAAK,MAAM;AAAA,IACpB;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAQ,KAAK,MAAM,KAAK,IAAK,KAAK,SAAS,CAAC;AAAA,IAC9C;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,cAAS,KAAK,MAAM,IACf,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,MACpB,KAAK,SAAS,CAAC,IAAI;AAAA,IAC1B;AAEA,IAAAA,QAAO,UAAU,eACjBA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,IAAI,YACnB,KAAK,SAAS,CAAC,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,IACrB,KAAK,SAAS,CAAC;AAAA,IACnB;AAEA,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAASG,iBAAiB,QAAQ;AACtF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,KAAK,QACT,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK;AAExB,YAAM,KAAK,KAAK,EAAE,MAAM,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,OAAO,KAAK;AAEd,aAAO,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IAC9C,CAAC;AAED,IAAAH,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,QAAQ;AACtF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,KAAK,QAAQ,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,YAAM,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,KAC/B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB;AAEF,cAAQ,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AAAA,IAC/C,CAAC;AAED,IAAAA,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQE,aAAY,UAAU;AAC7E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,MAAM;AACV,UAAI,IAAI;AACR,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,eAAO,KAAK,SAAS,CAAC,IAAI;AAAA,MAC5B;AACA,aAAO;AAEP,UAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,YAAY,SAAS,UAAW,QAAQE,aAAY,UAAU;AAC7E,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,SAAU,aAAY,QAAQA,aAAY,KAAK,MAAM;AAE1D,UAAI,IAAIA;AACR,UAAI,MAAM;AACV,UAAI,MAAM,KAAK,SAAS,EAAE,CAAC;AAC3B,aAAO,IAAI,MAAM,OAAO,MAAQ;AAC9B,eAAO,KAAK,SAAS,EAAE,CAAC,IAAI;AAAA,MAC9B;AACA,aAAO;AAEP,UAAI,OAAO,IAAK,QAAO,KAAK,IAAI,GAAG,IAAIA,WAAU;AAEjD,aAAO;AAAA,IACT;AAEA,IAAAF,QAAO,UAAU,WAAW,SAAS,SAAU,QAAQ,UAAU;AAC/D,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,UAAI,EAAE,KAAK,MAAM,IAAI,KAAO,QAAQ,KAAK,MAAM;AAC/C,cAAS,MAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IACtC;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,YAAM,MAAM,KAAK,MAAM,IAAK,KAAK,SAAS,CAAC,KAAK;AAChD,aAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,YAAM,MAAM,KAAK,SAAS,CAAC,IAAK,KAAK,MAAM,KAAK;AAChD,aAAQ,MAAM,QAAU,MAAM,aAAa;AAAA,IAC7C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,IAChB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK;AAAA,IACzB;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AAEjD,aAAQ,KAAK,MAAM,KAAK,KACrB,KAAK,SAAS,CAAC,KAAK,KACpB,KAAK,SAAS,CAAC,KAAK,IACpB,KAAK,SAAS,CAAC;AAAA,IACpB;AAEA,IAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,MAAM,KAAK,SAAS,CAAC,IACzB,KAAK,SAAS,CAAC,IAAI,KAAK,IACxB,KAAK,SAAS,CAAC,IAAI,KAAK,MACvB,QAAQ;AAEX,cAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,QACP,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE;AAAA,IAC5B,CAAC;AAED,IAAAA,QAAO,UAAU,iBAAiB,mBAAmB,SAAS,eAAgB,QAAQ;AACpF,eAAS,WAAW;AACpB,qBAAe,QAAQ,QAAQ;AAC/B,YAAM,QAAQ,KAAK,MAAM;AACzB,YAAM,OAAO,KAAK,SAAS,CAAC;AAC5B,UAAI,UAAU,UAAa,SAAS,QAAW;AAC7C,oBAAY,QAAQ,KAAK,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,OAAO,SAAS;AAAA,MACpB,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,KAAK,EAAE,MAAM;AAEf,cAAQ,OAAO,GAAG,KAAK,OAAO,EAAE,KAC9B,OAAO,KAAK,EAAE,MAAM,IAAI,KAAK,KAC7B,KAAK,EAAE,MAAM,IAAI,KAAK,KACtB,KAAK,EAAE,MAAM,IAAI,KAAK,IACtB,IAAI;AAAA,IACR,CAAC;AAED,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,IAC/C;AAEA,IAAAA,QAAO,UAAU,cAAc,SAAS,YAAa,QAAQ,UAAU;AACrE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,IAChD;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI,CAAC;AAAA,IAC/C;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,QAAQ,UAAU;AACvE,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,aAAY,QAAQ,GAAG,KAAK,MAAM;AACjD,aAAO,QAAQ,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC;AAAA,IAChD;AAEA,aAAS,SAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACpD,UAAI,CAACA,QAAO,SAAS,GAAG,EAAG,OAAM,IAAI,UAAU,6CAA6C;AAC5F,UAAI,QAAQ,OAAO,QAAQ,IAAK,OAAM,IAAI,WAAW,mCAAmC;AACxF,UAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAAA,IAC1E;AAEA,IAAAA,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQE,aAAY,UAAU;AACxF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,cAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,iBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,MACvD;AAEA,UAAI,MAAM;AACV,UAAI,IAAI;AACR,WAAK,MAAM,IAAI,QAAQ;AACvB,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,aAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,MACrC;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,cACjBA,QAAO,UAAU,cAAc,SAAS,YAAa,OAAO,QAAQE,aAAY,UAAU;AACxF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,MAAAA,cAAaA,gBAAe;AAC5B,UAAI,CAAC,UAAU;AACb,cAAM,WAAW,KAAK,IAAI,GAAG,IAAIA,WAAU,IAAI;AAC/C,iBAAS,MAAM,OAAO,QAAQA,aAAY,UAAU,CAAC;AAAA,MACvD;AAEA,UAAI,IAAIA,cAAa;AACrB,UAAI,MAAM;AACV,WAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,aAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,aAAK,SAAS,CAAC,IAAK,QAAQ,MAAO;AAAA,MACrC;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,aACjBA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQ,UAAU;AAC1E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,CAAC;AACvD,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,CAAC;AACzD,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBACjBA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,CAAC;AAC7D,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,aAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,iBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,UAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,UAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,WAAK,MAAM;AACX,UAAI,QAAQ,IAAI;AAChB,aAAO;AAAA,IACT;AAEA,aAAS,eAAgB,KAAK,OAAO,QAAQ,KAAK,KAAK;AACrD,iBAAW,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC;AAE1C,UAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,UAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,SAAS,CAAC,IAAI;AAClB,WAAK,MAAM;AACX,UAAI,MAAM,IAAI;AACd,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,aAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACpF,CAAC;AAED,IAAAA,QAAO,UAAU,mBAAmB,mBAAmB,SAAS,iBAAkB,OAAO,SAAS,GAAG;AACnG,aAAO,eAAe,MAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACpF,CAAC;AAED,IAAAA,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQE,aAAY,UAAU;AACtF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,cAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,iBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,MAC7D;AAEA,UAAI,IAAI;AACR,UAAI,MAAM;AACV,UAAI,MAAM;AACV,WAAK,MAAM,IAAI,QAAQ;AACvB,aAAO,EAAE,IAAIA,gBAAe,OAAO,MAAQ;AACzC,YAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,gBAAM;AAAA,QACR;AACA,aAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,MAClD;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,aAAa,SAAS,WAAY,OAAO,QAAQE,aAAY,UAAU;AACtF,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,cAAM,QAAQ,KAAK,IAAI,GAAI,IAAIA,cAAc,CAAC;AAE9C,iBAAS,MAAM,OAAO,QAAQA,aAAY,QAAQ,GAAG,CAAC,KAAK;AAAA,MAC7D;AAEA,UAAI,IAAIA,cAAa;AACrB,UAAI,MAAM;AACV,UAAI,MAAM;AACV,WAAK,SAAS,CAAC,IAAI,QAAQ;AAC3B,aAAO,EAAE,KAAK,MAAM,OAAO,MAAQ;AACjC,YAAI,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,GAAG;AACxD,gBAAM;AAAA,QACR;AACA,aAAK,SAAS,CAAC,KAAM,QAAQ,OAAQ,KAAK,MAAM;AAAA,MAClD;AAEA,aAAO,SAASA;AAAA,IAClB;AAEA,IAAAF,QAAO,UAAU,YAAY,SAAS,UAAW,OAAO,QAAQ,UAAU;AACxE,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,KAAM,IAAK;AAC3D,UAAI,QAAQ,EAAG,SAAQ,MAAO,QAAQ;AACtC,WAAK,MAAM,IAAK,QAAQ;AACxB,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,OAAQ,MAAO;AAC/D,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,WAAK,MAAM,IAAK,QAAQ;AACxB,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,SAAU,UAAS,MAAM,OAAO,QAAQ,GAAG,YAAY,WAAW;AACvE,UAAI,QAAQ,EAAG,SAAQ,aAAa,QAAQ;AAC5C,WAAK,MAAM,IAAK,UAAU;AAC1B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,UAAU;AAC9B,WAAK,SAAS,CAAC,IAAK,QAAQ;AAC5B,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,aAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACxG,CAAC;AAED,IAAAA,QAAO,UAAU,kBAAkB,mBAAmB,SAAS,gBAAiB,OAAO,SAAS,GAAG;AACjG,aAAO,eAAe,MAAM,OAAO,QAAQ,CAAC,OAAO,oBAAoB,GAAG,OAAO,oBAAoB,CAAC;AAAA,IACxG,CAAC;AAED,aAAS,aAAc,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;AACxD,UAAI,SAAS,MAAM,IAAI,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AACxE,UAAI,SAAS,EAAG,OAAM,IAAI,WAAW,oBAAoB;AAAA,IAC3D;AAEA,aAAS,WAAY,KAAK,OAAO,QAAQ,cAAc,UAAU;AAC/D,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,qBAAa,KAAK,OAAO,QAAQ,GAAG,sBAAwB,qBAAuB;AAAA,MACrF;AACA,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,aAAO,WAAW,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,IACvD;AAEA,IAAAA,QAAO,UAAU,eAAe,SAAS,aAAc,OAAO,QAAQ,UAAU;AAC9E,aAAO,WAAW,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,IACxD;AAEA,aAAS,YAAa,KAAK,OAAO,QAAQ,cAAc,UAAU;AAChE,cAAQ,CAAC;AACT,eAAS,WAAW;AACpB,UAAI,CAAC,UAAU;AACb,qBAAa,KAAK,OAAO,QAAQ,GAAG,uBAAyB,sBAAwB;AAAA,MACvF;AACA,cAAQ,MAAM,KAAK,OAAO,QAAQ,cAAc,IAAI,CAAC;AACrD,aAAO,SAAS;AAAA,IAClB;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,aAAO,YAAY,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,IACxD;AAEA,IAAAA,QAAO,UAAU,gBAAgB,SAAS,cAAe,OAAO,QAAQ,UAAU;AAChF,aAAO,YAAY,MAAM,OAAO,QAAQ,OAAO,QAAQ;AAAA,IACzD;AAGA,IAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,QAAQ,aAAa,OAAO,KAAK;AACtE,UAAI,CAACA,QAAO,SAAS,MAAM,EAAG,OAAM,IAAI,UAAU,6BAA6B;AAC/E,UAAI,CAAC,MAAO,SAAQ;AACpB,UAAI,CAAC,OAAO,QAAQ,EAAG,OAAM,KAAK;AAClC,UAAI,eAAe,OAAO,OAAQ,eAAc,OAAO;AACvD,UAAI,CAAC,YAAa,eAAc;AAChC,UAAI,MAAM,KAAK,MAAM,MAAO,OAAM;AAGlC,UAAI,QAAQ,MAAO,QAAO;AAC1B,UAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AAGrD,UAAI,cAAc,GAAG;AACnB,cAAM,IAAI,WAAW,2BAA2B;AAAA,MAClD;AACA,UAAI,QAAQ,KAAK,SAAS,KAAK,OAAQ,OAAM,IAAI,WAAW,oBAAoB;AAChF,UAAI,MAAM,EAAG,OAAM,IAAI,WAAW,yBAAyB;AAG3D,UAAI,MAAM,KAAK,OAAQ,OAAM,KAAK;AAClC,UAAI,OAAO,SAAS,cAAc,MAAM,OAAO;AAC7C,cAAM,OAAO,SAAS,cAAc;AAAA,MACtC;AAEA,YAAM,MAAM,MAAM;AAElB,UAAI,SAAS,UAAU,OAAO,WAAW,UAAU,eAAe,YAAY;AAE5E,aAAK,WAAW,aAAa,OAAO,GAAG;AAAA,MACzC,OAAO;AACL,mBAAW,UAAU,IAAI;AAAA,UACvB;AAAA,UACA,KAAK,SAAS,OAAO,GAAG;AAAA,UACxB;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAMA,IAAAA,QAAO,UAAU,OAAO,SAAS,KAAM,KAAK,OAAO,KAAK,UAAU;AAEhE,UAAI,OAAO,QAAQ,UAAU;AAC3B,YAAI,OAAO,UAAU,UAAU;AAC7B,qBAAW;AACX,kBAAQ;AACR,gBAAM,KAAK;AAAA,QACb,WAAW,OAAO,QAAQ,UAAU;AAClC,qBAAW;AACX,gBAAM,KAAK;AAAA,QACb;AACA,YAAI,aAAa,UAAa,OAAO,aAAa,UAAU;AAC1D,gBAAM,IAAI,UAAU,2BAA2B;AAAA,QACjD;AACA,YAAI,OAAO,aAAa,YAAY,CAACA,QAAO,WAAW,QAAQ,GAAG;AAChE,gBAAM,IAAI,UAAU,uBAAuB,QAAQ;AAAA,QACrD;AACA,YAAI,IAAI,WAAW,GAAG;AACpB,gBAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,cAAK,aAAa,UAAU,OAAO,OAC/B,aAAa,UAAU;AAEzB,kBAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF,WAAW,OAAO,QAAQ,UAAU;AAClC,cAAM,MAAM;AAAA,MACd,WAAW,OAAO,QAAQ,WAAW;AACnC,cAAM,OAAO,GAAG;AAAA,MAClB;AAGA,UAAI,QAAQ,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,KAAK;AACzD,cAAM,IAAI,WAAW,oBAAoB;AAAA,MAC3C;AAEA,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAEA,cAAQ,UAAU;AAClB,YAAM,QAAQ,SAAY,KAAK,SAAS,QAAQ;AAEhD,UAAI,CAAC,IAAK,OAAM;AAEhB,UAAI;AACJ,UAAI,OAAO,QAAQ,UAAU;AAC3B,aAAK,IAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AAC5B,eAAK,CAAC,IAAI;AAAA,QACZ;AAAA,MACF,OAAO;AACL,cAAM,QAAQA,QAAO,SAAS,GAAG,IAC7B,MACAA,QAAO,KAAK,KAAK,QAAQ;AAC7B,cAAM,MAAM,MAAM;AAClB,YAAI,QAAQ,GAAG;AACb,gBAAM,IAAI,UAAU,gBAAgB,MAClC,mCAAmC;AAAA,QACvC;AACA,aAAK,IAAI,GAAG,IAAI,MAAM,OAAO,EAAE,GAAG;AAChC,eAAK,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG;AAAA,QACjC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAMA,QAAM,SAAS,CAAC;AAChB,aAAS,EAAG,KAAK,YAAY,MAAM;AACjC,aAAO,GAAG,IAAI,MAAM,kBAAkB,KAAK;AAAA,QACzC,cAAe;AACb,gBAAM;AAEN,iBAAO,eAAe,MAAM,WAAW;AAAA,YACrC,OAAO,WAAW,MAAM,MAAM,SAAS;AAAA,YACvC,UAAU;AAAA,YACV,cAAc;AAAA,UAChB,CAAC;AAGD,eAAK,OAAO,GAAG,KAAK,IAAI,KAAK,GAAG;AAGhC,eAAK;AAEL,iBAAO,KAAK;AAAA,QACd;AAAA,QAEA,IAAI,OAAQ;AACV,iBAAO;AAAA,QACT;AAAA,QAEA,IAAI,KAAM,OAAO;AACf,iBAAO,eAAe,MAAM,QAAQ;AAAA,YAClC,cAAc;AAAA,YACd,YAAY;AAAA,YACZ;AAAA,YACA,UAAU;AAAA,UACZ,CAAC;AAAA,QACH;AAAA,QAEA,WAAY;AACV,iBAAO,GAAG,KAAK,IAAI,KAAK,GAAG,MAAM,KAAK,OAAO;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAEA;AAAA,MAAE;AAAA,MACA,SAAU,MAAM;AACd,YAAI,MAAM;AACR,iBAAO,GAAG,IAAI;AAAA,QAChB;AAEA,eAAO;AAAA,MACT;AAAA,MAAG;AAAA,IAAU;AACf;AAAA,MAAE;AAAA,MACA,SAAU,MAAM,QAAQ;AACtB,eAAO,QAAQ,IAAI,oDAAoD,OAAO,MAAM;AAAA,MACtF;AAAA,MAAG;AAAA,IAAS;AACd;AAAA,MAAE;AAAA,MACA,SAAU,KAAK,OAAO,OAAO;AAC3B,YAAI,MAAM,iBAAiB,GAAG;AAC9B,YAAI,WAAW;AACf,YAAI,OAAO,UAAU,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACxD,qBAAW,sBAAsB,OAAO,KAAK,CAAC;AAAA,QAChD,WAAW,OAAO,UAAU,UAAU;AACpC,qBAAW,OAAO,KAAK;AACvB,cAAI,QAAQ,OAAO,CAAC,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,OAAO,CAAC,KAAK,OAAO,EAAE,IAAI;AACzE,uBAAW,sBAAsB,QAAQ;AAAA,UAC3C;AACA,sBAAY;AAAA,QACd;AACA,eAAO,eAAe,KAAK,cAAc,QAAQ;AACjD,eAAO;AAAA,MACT;AAAA,MAAG;AAAA,IAAU;AAEf,aAAS,sBAAuB,KAAK;AACnC,UAAI,MAAM;AACV,UAAI,IAAI,IAAI;AACZ,YAAM,QAAQ,IAAI,CAAC,MAAM,MAAM,IAAI;AACnC,aAAO,KAAK,QAAQ,GAAG,KAAK,GAAG;AAC7B,cAAM,IAAI,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,MACrC;AACA,aAAO,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG;AAAA,IACjC;AAKA,aAAS,YAAa,KAAK,QAAQE,aAAY;AAC7C,qBAAe,QAAQ,QAAQ;AAC/B,UAAI,IAAI,MAAM,MAAM,UAAa,IAAI,SAASA,WAAU,MAAM,QAAW;AACvE,oBAAY,QAAQ,IAAI,UAAUA,cAAa,EAAE;AAAA,MACnD;AAAA,IACF;AAEA,aAAS,WAAY,OAAO,KAAK,KAAK,KAAK,QAAQA,aAAY;AAC7D,UAAI,QAAQ,OAAO,QAAQ,KAAK;AAC9B,cAAM,IAAI,OAAO,QAAQ,WAAW,MAAM;AAC1C,YAAI;AACJ,YAAIA,cAAa,GAAG;AAClB,cAAI,QAAQ,KAAK,QAAQ,OAAO,CAAC,GAAG;AAClC,oBAAQ,OAAO,CAAC,WAAW,CAAC,QAAQA,cAAa,KAAK,CAAC,GAAG,CAAC;AAAA,UAC7D,OAAO;AACL,oBAAQ,SAAS,CAAC,QAAQA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC,iBACzCA,cAAa,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,UACzC;AAAA,QACF,OAAO;AACL,kBAAQ,MAAM,GAAG,GAAG,CAAC,WAAW,GAAG,GAAG,CAAC;AAAA,QACzC;AACA,cAAM,IAAI,OAAO,iBAAiB,SAAS,OAAO,KAAK;AAAA,MACzD;AACA,kBAAY,KAAK,QAAQA,WAAU;AAAA,IACrC;AAEA,aAAS,eAAgB,OAAO,MAAM;AACpC,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI,OAAO,qBAAqB,MAAM,UAAU,KAAK;AAAA,MAC7D;AAAA,IACF;AAEA,aAAS,YAAa,OAAO,QAAQ,MAAM;AACzC,UAAI,KAAK,MAAM,KAAK,MAAM,OAAO;AAC/B,uBAAe,OAAO,IAAI;AAC1B,cAAM,IAAI,OAAO,iBAAiB,QAAQ,UAAU,cAAc,KAAK;AAAA,MACzE;AAEA,UAAI,SAAS,GAAG;AACd,cAAM,IAAI,OAAO,yBAAyB;AAAA,MAC5C;AAEA,YAAM,IAAI,OAAO;AAAA,QAAiB,QAAQ;AAAA,QACR,MAAM,OAAO,IAAI,CAAC,WAAW,MAAM;AAAA,QACnC;AAAA,MAAK;AAAA,IACzC;AAKA,QAAM,oBAAoB;AAE1B,aAAS,YAAa,KAAK;AAEzB,YAAM,IAAI,MAAM,GAAG,EAAE,CAAC;AAEtB,YAAM,IAAI,KAAK,EAAE,QAAQ,mBAAmB,EAAE;AAE9C,UAAI,IAAI,SAAS,EAAG,QAAO;AAE3B,aAAO,IAAI,SAAS,MAAM,GAAG;AAC3B,cAAM,MAAM;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAa,QAAQ,OAAO;AACnC,cAAQ,SAAS;AACjB,UAAI;AACJ,YAAM,SAAS,OAAO;AACtB,UAAI,gBAAgB;AACpB,YAAM,QAAQ,CAAC;AAEf,eAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,oBAAY,OAAO,WAAW,CAAC;AAG/B,YAAI,YAAY,SAAU,YAAY,OAAQ;AAE5C,cAAI,CAAC,eAAe;AAElB,gBAAI,YAAY,OAAQ;AAEtB,mBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,YACF,WAAW,IAAI,MAAM,QAAQ;AAE3B,mBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD;AAAA,YACF;AAGA,4BAAgB;AAEhB;AAAA,UACF;AAGA,cAAI,YAAY,OAAQ;AACtB,iBAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAClD,4BAAgB;AAChB;AAAA,UACF;AAGA,uBAAa,gBAAgB,SAAU,KAAK,YAAY,SAAU;AAAA,QACpE,WAAW,eAAe;AAExB,eAAK,SAAS,KAAK,GAAI,OAAM,KAAK,KAAM,KAAM,GAAI;AAAA,QACpD;AAEA,wBAAgB;AAGhB,YAAI,YAAY,KAAM;AACpB,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM,KAAK,SAAS;AAAA,QACtB,WAAW,YAAY,MAAO;AAC5B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,IAAM;AAAA,YACnB,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,WAAW,YAAY,OAAS;AAC9B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,KAAM;AAAA,YACnB,aAAa,IAAM,KAAO;AAAA,YAC1B,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,WAAW,YAAY,SAAU;AAC/B,eAAK,SAAS,KAAK,EAAG;AACtB,gBAAM;AAAA,YACJ,aAAa,KAAO;AAAA,YACpB,aAAa,KAAM,KAAO;AAAA,YAC1B,aAAa,IAAM,KAAO;AAAA,YAC1B,YAAY,KAAO;AAAA,UACrB;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,MAAM,oBAAoB;AAAA,QACtC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,aAAc,KAAK;AAC1B,YAAM,YAAY,CAAC;AACnB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AAEnC,kBAAU,KAAK,IAAI,WAAW,CAAC,IAAI,GAAI;AAAA,MACzC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,eAAgB,KAAK,OAAO;AACnC,UAAI,GAAG,IAAI;AACX,YAAM,YAAY,CAAC;AACnB,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,aAAK,SAAS,KAAK,EAAG;AAEtB,YAAI,IAAI,WAAW,CAAC;AACpB,aAAK,KAAK;AACV,aAAK,IAAI;AACT,kBAAU,KAAK,EAAE;AACjB,kBAAU,KAAK,EAAE;AAAA,MACnB;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,cAAe,KAAK;AAC3B,aAAO,OAAO,YAAY,YAAY,GAAG,CAAC;AAAA,IAC5C;AAEA,aAAS,WAAY,KAAK,KAAK,QAAQ,QAAQ;AAC7C,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC3B,YAAK,IAAI,UAAU,IAAI,UAAY,KAAK,IAAI,OAAS;AACrD,YAAI,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AAKA,aAAS,WAAY,KAAK,MAAM;AAC9B,aAAO,eAAe,QACnB,OAAO,QAAQ,IAAI,eAAe,QAAQ,IAAI,YAAY,QAAQ,QACjE,IAAI,YAAY,SAAS,KAAK;AAAA,IACpC;AACA,aAAS,YAAa,KAAK;AAEzB,aAAO,QAAQ;AAAA,IACjB;AAIA,QAAM,uBAAuB,WAAY;AACvC,YAAM,WAAW;AACjB,YAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,eAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,cAAM,MAAM,IAAI;AAChB,iBAAS,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG;AAC3B,gBAAM,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC;AAAA,QAC3C;AAAA,MACF;AACA,aAAO;AAAA,IACT,GAAG;AAGH,aAAS,mBAAoB,IAAI;AAC/B,aAAO,OAAO,WAAW,cAAc,yBAAyB;AAAA,IAClE;AAEA,aAAS,yBAA0B;AACjC,YAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAAA;AAAA;;;ACzjEA;AAAA;AAAA;AA8BA,QAAM,UAAwB;AAI9B,QAAM,WAAwB;AAC9B,QAAM,SAAwB;AAE9B,QAAM,YAAwB;AAK9B,aAAS,KAAK,KAAK;AAAE,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAG;AAAA,IAAE;AAIhF,QAAM,eAAe;AACrB,QAAM,eAAe;AACrB,QAAM,YAAe;AAGrB,QAAM,YAAe;AACrB,QAAM,YAAe;AAQrB,QAAM,eAAgB;AAGtB,QAAM,WAAgB;AAGtB,QAAM,UAAgB,WAAW,IAAI;AAGrC,QAAM,UAAgB;AAGtB,QAAM,WAAgB;AAGtB,QAAM,YAAgB,IAAI,UAAU;AAGpC,QAAM,WAAgB;AAGtB,QAAM,WAAgB;AAQtB,QAAM,cAAc;AAGpB,QAAM,YAAc;AAGpB,QAAM,UAAc;AAGpB,QAAM,YAAc;AAGpB,QAAM,cAAc;AAIpB,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,CAAC;AAAA;AAE5E,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,CAAC;AAAA;AAEtF,QAAM;AAAA;AAAA,MACJ,IAAI,WAAW,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,CAAC;AAAA;AAExD,QAAM,WACJ,IAAI,WAAW,CAAC,IAAG,IAAG,IAAG,GAAE,GAAE,GAAE,GAAE,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,IAAG,GAAE,EAAE,CAAC;AAajE,QAAM,gBAAgB;AAGtB,QAAM,eAAgB,IAAI,OAAO,UAAU,KAAK,CAAC;AACjD,SAAK,YAAY;AAOjB,QAAM,eAAgB,IAAI,MAAM,UAAU,CAAC;AAC3C,SAAK,YAAY;AAKjB,QAAM,aAAgB,IAAI,MAAM,aAAa;AAC7C,SAAK,UAAU;AAMf,QAAM,eAAgB,IAAI,MAAM,YAAY,YAAY,CAAC;AACzD,SAAK,YAAY;AAGjB,QAAM,cAAgB,IAAI,MAAM,YAAY;AAC5C,SAAK,WAAW;AAGhB,QAAM,YAAgB,IAAI,MAAM,OAAO;AACvC,SAAK,SAAS;AAId,aAAS,eAAe,aAAa,YAAY,YAAY,OAAO,YAAY;AAE9E,WAAK,cAAe;AACpB,WAAK,aAAe;AACpB,WAAK,aAAe;AACpB,WAAK,QAAe;AACpB,WAAK,aAAe;AAGpB,WAAK,YAAe,eAAe,YAAY;AAAA,IACjD;AAGA,QAAI;AACJ,QAAI;AACJ,QAAI;AAGJ,aAAS,SAAS,UAAU,WAAW;AACrC,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,YAAY;AAAA,IACnB;AAIA,QAAM,SAAS,CAAC,SAAS;AAEvB,aAAO,OAAO,MAAM,WAAW,IAAI,IAAI,WAAW,OAAO,SAAS,EAAE;AAAA,IACtE;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM;AAG1B,QAAE,YAAY,EAAE,SAAS,IAAK,IAAK;AACnC,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AAAA,IAC3C;AAOA,QAAM,YAAY,CAAC,GAAG,OAAO,WAAW;AAEtC,UAAI,EAAE,WAAY,WAAW,QAAS;AACpC,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS,SAAU,WAAW,EAAE;AAClC,UAAE,YAAY,SAAS;AAAA,MACzB,OAAO;AACL,UAAE,UAAW,SAAS,EAAE,WAAY;AACpC,UAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAGA,QAAM,YAAY,CAAC,GAAG,GAAG,SAAS;AAEhC;AAAA,QAAU;AAAA,QAAG,KAAK,IAAI,CAAC;AAAA,QAAY,KAAK,IAAI,IAAI,CAAC;AAAA;AAAA,MAAS;AAAA,IAC5D;AAQA,QAAM,aAAa,CAAC,MAAM,QAAQ;AAEhC,UAAI,MAAM;AACV,SAAG;AACD,eAAO,OAAO;AACd,kBAAU;AACV,gBAAQ;AAAA,MACV,SAAS,EAAE,MAAM;AACjB,aAAO,QAAQ;AAAA,IACjB;AAMA,QAAM,WAAW,CAAC,MAAM;AAEtB,UAAI,EAAE,aAAa,IAAI;AACrB,kBAAU,GAAG,EAAE,MAAM;AACrB,UAAE,SAAS;AACX,UAAE,WAAW;AAAA,MAEf,WAAW,EAAE,YAAY,GAAG;AAC1B,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE,SAAS;AACxC,UAAE,WAAW;AACb,UAAE,YAAY;AAAA,MAChB;AAAA,IACF;AAaA,QAAM,aAAa,CAAC,GAAG,SAAS;AAI9B,YAAM,OAAkB,KAAK;AAC7B,YAAM,WAAkB,KAAK;AAC7B,YAAM,QAAkB,KAAK,UAAU;AACvC,YAAM,YAAkB,KAAK,UAAU;AACvC,YAAM,QAAkB,KAAK,UAAU;AACvC,YAAM,OAAkB,KAAK,UAAU;AACvC,YAAM,aAAkB,KAAK,UAAU;AACvC,UAAI;AACJ,UAAI,GAAG;AACP,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW;AAEf,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,UAAE,SAAS,IAAI,IAAI;AAAA,MACrB;AAKA,WAAK,EAAE,KAAK,EAAE,QAAQ,IAAI,IAAI,CAAC,IAAY;AAE3C,WAAK,IAAI,EAAE,WAAW,GAAG,IAAI,WAAW,KAAK;AAC3C,YAAI,EAAE,KAAK,CAAC;AACZ,eAAO,KAAK,KAAK,IAAI,IAAI,CAAC,IAAY,IAAI,CAAC,IAAY;AACvD,YAAI,OAAO,YAAY;AACrB,iBAAO;AACP;AAAA,QACF;AACA,aAAK,IAAI,IAAI,CAAC,IAAY;AAG1B,YAAI,IAAI,UAAU;AAAE;AAAA,QAAU;AAE9B,UAAE,SAAS,IAAI;AACf,gBAAQ;AACR,YAAI,KAAK,MAAM;AACb,kBAAQ,MAAM,IAAI,IAAI;AAAA,QACxB;AACA,YAAI,KAAK,IAAI,CAAC;AACd,UAAE,WAAW,KAAK,OAAO;AACzB,YAAI,WAAW;AACb,YAAE,cAAc,KAAK,MAAM,IAAI,IAAI,CAAC,IAAY;AAAA,QAClD;AAAA,MACF;AACA,UAAI,aAAa,GAAG;AAAE;AAAA,MAAQ;AAM9B,SAAG;AACD,eAAO,aAAa;AACpB,eAAO,EAAE,SAAS,IAAI,MAAM,GAAG;AAAE;AAAA,QAAQ;AACzC,UAAE,SAAS,IAAI;AACf,UAAE,SAAS,OAAO,CAAC,KAAK;AACxB,UAAE,SAAS,UAAU;AAIrB,oBAAY;AAAA,MACd,SAAS,WAAW;AAOpB,WAAK,OAAO,YAAY,SAAS,GAAG,QAAQ;AAC1C,YAAI,EAAE,SAAS,IAAI;AACnB,eAAO,MAAM,GAAG;AACd,cAAI,EAAE,KAAK,EAAE,CAAC;AACd,cAAI,IAAI,UAAU;AAAE;AAAA,UAAU;AAC9B,cAAI,KAAK,IAAI,IAAI,CAAC,MAAc,MAAM;AAEpC,cAAE,YAAY,OAAO,KAAK,IAAI,IAAI,CAAC,KAAa,KAAK,IAAI,CAAC;AAC1D,iBAAK,IAAI,IAAI,CAAC,IAAY;AAAA,UAC5B;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAWA,QAAM,YAAY,CAAC,MAAM,UAAU,aAAa;AAK9C,YAAM,YAAY,IAAI,MAAM,WAAW,CAAC;AACxC,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AAKJ,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,eAAQ,OAAO,SAAS,OAAO,CAAC,KAAM;AACtC,kBAAU,IAAI,IAAI;AAAA,MACpB;AAQA,WAAK,IAAI,GAAI,KAAK,UAAU,KAAK;AAC/B,YAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AACxB,YAAI,QAAQ,GAAG;AAAE;AAAA,QAAU;AAE3B,aAAK,IAAI,CAAC,IAAa,WAAW,UAAU,GAAG,KAAK,GAAG;AAAA,MAIzD;AAAA,IACF;AAMA,QAAM,iBAAiB,MAAM;AAE3B,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,YAAM,WAAW,IAAI,MAAM,WAAW,CAAC;AAgBvC,eAAS;AACT,WAAK,OAAO,GAAG,OAAO,eAAe,GAAG,QAAQ;AAC9C,oBAAY,IAAI,IAAI;AACpB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,uBAAa,QAAQ,IAAI;AAAA,QAC3B;AAAA,MACF;AAMA,mBAAa,SAAS,CAAC,IAAI;AAG3B,aAAO;AACP,WAAK,OAAO,GAAG,OAAO,IAAI,QAAQ;AAChC,kBAAU,IAAI,IAAI;AAClB,aAAK,IAAI,GAAG,IAAK,KAAK,YAAY,IAAI,GAAI,KAAK;AAC7C,qBAAW,MAAM,IAAI;AAAA,QACvB;AAAA,MACF;AAEA,eAAS;AACT,aAAO,OAAO,SAAS,QAAQ;AAC7B,kBAAU,IAAI,IAAI,QAAQ;AAC1B,aAAK,IAAI,GAAG,IAAK,KAAM,YAAY,IAAI,IAAI,GAAK,KAAK;AACnD,qBAAW,MAAM,MAAM,IAAI;AAAA,QAC7B;AAAA,MACF;AAIA,WAAK,OAAO,GAAG,QAAQ,UAAU,QAAQ;AACvC,iBAAS,IAAI,IAAI;AAAA,MACnB;AAEA,UAAI;AACJ,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AACA,aAAO,KAAK,KAAK;AACf,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC;AACA,iBAAS,CAAC;AAAA,MACZ;AAKA,gBAAU,cAAc,UAAU,GAAG,QAAQ;AAG7C,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,qBAAa,IAAI,IAAI,CAAC,IAAY;AAClC,qBAAa,IAAI,CAAC,IAAa,WAAW,GAAG,CAAC;AAAA,MAChD;AAGA,sBAAgB,IAAI,eAAe,cAAc,aAAa,WAAW,GAAG,SAAS,QAAQ;AAC7F,sBAAgB,IAAI,eAAe,cAAc,aAAa,GAAY,SAAS,QAAQ;AAC3F,uBAAiB,IAAI,eAAe,IAAI,MAAM,CAAC,GAAG,cAAc,GAAW,UAAU,WAAW;AAAA,IAGlG;AAMA,QAAM,aAAa,CAAC,MAAM;AAExB,UAAI;AAGJ,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAG;AAClE,WAAK,IAAI,GAAG,IAAI,SAAU,KAAK;AAAE,UAAE,UAAU,IAAI,CAAC,IAAa;AAAA,MAAG;AAClE,WAAK,IAAI,GAAG,IAAI,UAAU,KAAK;AAAE,UAAE,QAAQ,IAAI,CAAC,IAAa;AAAA,MAAG;AAEhE,QAAE,UAAU,YAAY,CAAC,IAAa;AACtC,QAAE,UAAU,EAAE,aAAa;AAC3B,QAAE,WAAW,EAAE,UAAU;AAAA,IAC3B;AAMA,QAAM,YAAY,CAAC,MACnB;AACE,UAAI,EAAE,WAAW,GAAG;AAClB,kBAAU,GAAG,EAAE,MAAM;AAAA,MACvB,WAAW,EAAE,WAAW,GAAG;AAEzB,UAAE,YAAY,EAAE,SAAS,IAAI,EAAE;AAAA,MACjC;AACA,QAAE,SAAS;AACX,QAAE,WAAW;AAAA,IACf;AAMA,QAAM,UAAU,CAAC,MAAM,GAAG,GAAG,UAAU;AAErC,YAAM,MAAM,IAAI;AAChB,YAAM,MAAM,IAAI;AAChB,aAAQ,KAAK,GAAG,IAAa,KAAK,GAAG,KAC7B,KAAK,GAAG,MAAe,KAAK,GAAG,KAAc,MAAM,CAAC,KAAK,MAAM,CAAC;AAAA,IAC1E;AAQA,QAAM,aAAa,CAAC,GAAG,MAAM,MAAM;AAKjC,YAAM,IAAI,EAAE,KAAK,CAAC;AAClB,UAAI,IAAI,KAAK;AACb,aAAO,KAAK,EAAE,UAAU;AAEtB,YAAI,IAAI,EAAE,YACR,QAAQ,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAClD;AAAA,QACF;AAEA,YAAI,QAAQ,MAAM,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG;AAAE;AAAA,QAAO;AAGnD,UAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;AACpB,YAAI;AAGJ,cAAM;AAAA,MACR;AACA,QAAE,KAAK,CAAC,IAAI;AAAA,IACd;AASA,QAAM,iBAAiB,CAAC,GAAG,OAAO,UAAU;AAK1C,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AAEJ,UAAI,EAAE,aAAa,GAAG;AACpB,WAAG;AACD,iBAAO,EAAE,YAAY,EAAE,UAAU,IAAI,IAAI;AACzC,mBAAS,EAAE,YAAY,EAAE,UAAU,IAAI,IAAI,QAAS;AACpD,eAAK,EAAE,YAAY,EAAE,UAAU,IAAI;AACnC,cAAI,SAAS,GAAG;AACd,sBAAU,GAAG,IAAI,KAAK;AAAA,UAExB,OAAO;AAEL,mBAAO,aAAa,EAAE;AACtB,sBAAU,GAAG,OAAO,WAAW,GAAG,KAAK;AACvC,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,oBAAM,YAAY,IAAI;AACtB,wBAAU,GAAG,IAAI,KAAK;AAAA,YACxB;AACA;AACA,mBAAO,OAAO,IAAI;AAGlB,sBAAU,GAAG,MAAM,KAAK;AACxB,oBAAQ,YAAY,IAAI;AACxB,gBAAI,UAAU,GAAG;AACf,sBAAQ,UAAU,IAAI;AACtB,wBAAU,GAAG,MAAM,KAAK;AAAA,YAC1B;AAAA,UACF;AAAA,QAKF,SAAS,KAAK,EAAE;AAAA,MAClB;AAEA,gBAAU,GAAG,WAAW,KAAK;AAAA,IAC/B;AAWA,QAAM,aAAa,CAAC,GAAG,SAAS;AAI9B,YAAM,OAAW,KAAK;AACtB,YAAM,QAAW,KAAK,UAAU;AAChC,YAAM,YAAY,KAAK,UAAU;AACjC,YAAM,QAAW,KAAK,UAAU;AAChC,UAAI,GAAG;AACP,UAAI,WAAW;AACf,UAAI;AAMJ,QAAE,WAAW;AACb,QAAE,WAAW;AAEb,WAAK,IAAI,GAAG,IAAI,OAAO,KAAK;AAC1B,YAAI,KAAK,IAAI,CAAC,MAAe,GAAG;AAC9B,YAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,WAAW;AAClC,YAAE,MAAM,CAAC,IAAI;AAAA,QAEf,OAAO;AACL,eAAK,IAAI,IAAI,CAAC,IAAY;AAAA,QAC5B;AAAA,MACF;AAOA,aAAO,EAAE,WAAW,GAAG;AACrB,eAAO,EAAE,KAAK,EAAE,EAAE,QAAQ,IAAK,WAAW,IAAI,EAAE,WAAW;AAC3D,aAAK,OAAO,CAAC,IAAa;AAC1B,UAAE,MAAM,IAAI,IAAI;AAChB,UAAE;AAEF,YAAI,WAAW;AACb,YAAE,cAAc,MAAM,OAAO,IAAI,CAAC;AAAA,QACpC;AAAA,MAEF;AACA,WAAK,WAAW;AAKhB,WAAK,IAAK,EAAE,YAAY,GAAc,KAAK,GAAG,KAAK;AAAE,mBAAW,GAAG,MAAM,CAAC;AAAA,MAAG;AAK7E,aAAO;AACP,SAAG;AAGD,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA,QAAa;AACxB,UAAE;AAAA,UAAK;AAAA;AAAA,QAAa,IAAI,EAAE,KAAK,EAAE,UAAU;AAC3C;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAa;AAGjC,YAAI,EAAE;AAAA,UAAK;AAAA;AAAA,QAAa;AAExB,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AACvB,UAAE,KAAK,EAAE,EAAE,QAAQ,IAAI;AAGvB,aAAK,OAAO,CAAC,IAAa,KAAK,IAAI,CAAC,IAAa,KAAK,IAAI,CAAC;AAC3D,UAAE,MAAM,IAAI,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK;AACvE,aAAK,IAAI,IAAI,CAAC,IAAY,KAAK,IAAI,IAAI,CAAC,IAAY;AAGpD,UAAE;AAAA,UAAK;AAAA;AAAA,QAAa,IAAI;AACxB;AAAA,UAAW;AAAA,UAAG;AAAA,UAAM;AAAA;AAAA,QAAa;AAAA,MAEnC,SAAS,EAAE,YAAY;AAEvB,QAAE,KAAK,EAAE,EAAE,QAAQ,IAAI,EAAE;AAAA,QAAK;AAAA;AAAA,MAAa;AAK3C,iBAAW,GAAG,IAAI;AAGlB,gBAAU,MAAM,UAAU,EAAE,QAAQ;AAAA,IACtC;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM,aAAa;AAKvC,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAEhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MACd;AACA,YAAM,WAAW,KAAK,IAAI,CAAC,IAAY;AAEvC,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEF,WAAW,QAAQ,WAAW;AAC5B,YAAE,QAAQ,SAAS,CAAC,KAAc;AAAA,QAEpC,WAAW,WAAW,GAAG;AAEvB,cAAI,WAAW,SAAS;AAAE,cAAE,QAAQ,SAAS,CAAC;AAAA,UAAc;AAC5D,YAAE,QAAQ,UAAU,CAAC;AAAA,QAEvB,WAAW,SAAS,IAAI;AACtB,YAAE,QAAQ,YAAY,CAAC;AAAA,QAEzB,OAAO;AACL,YAAE,QAAQ,cAAc,CAAC;AAAA,QAC3B;AAEA,gBAAQ;AACR,kBAAU;AAEV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAEd,WAAW,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAEd,OAAO;AACL,sBAAY;AACZ,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAOA,QAAM,YAAY,CAAC,GAAG,MAAM,aAAa;AAKvC,UAAI;AACJ,UAAI,UAAU;AACd,UAAI;AAEJ,UAAI,UAAU,KAAK,IAAI,IAAI,CAAC;AAE5B,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,YAAY;AAGhB,UAAI,YAAY,GAAG;AACjB,oBAAY;AACZ,oBAAY;AAAA,MACd;AAEA,WAAK,IAAI,GAAG,KAAK,UAAU,KAAK;AAC9B,iBAAS;AACT,kBAAU,MAAM,IAAI,KAAK,IAAI,CAAC;AAE9B,YAAI,EAAE,QAAQ,aAAa,WAAW,SAAS;AAC7C;AAAA,QAEF,WAAW,QAAQ,WAAW;AAC5B,aAAG;AAAE,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAAA,UAAG,SAAS,EAAE,UAAU;AAAA,QAE7D,WAAW,WAAW,GAAG;AACvB,cAAI,WAAW,SAAS;AACtB,sBAAU,GAAG,QAAQ,EAAE,OAAO;AAC9B;AAAA,UACF;AAEA,oBAAU,GAAG,SAAS,EAAE,OAAO;AAC/B,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE3B,WAAW,SAAS,IAAI;AACtB,oBAAU,GAAG,WAAW,EAAE,OAAO;AACjC,oBAAU,GAAG,QAAQ,GAAG,CAAC;AAAA,QAE3B,OAAO;AACL,oBAAU,GAAG,aAAa,EAAE,OAAO;AACnC,oBAAU,GAAG,QAAQ,IAAI,CAAC;AAAA,QAC5B;AAEA,gBAAQ;AACR,kBAAU;AACV,YAAI,YAAY,GAAG;AACjB,sBAAY;AACZ,sBAAY;AAAA,QAEd,WAAW,WAAW,SAAS;AAC7B,sBAAY;AACZ,sBAAY;AAAA,QAEd,OAAO;AACL,sBAAY;AACZ,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAOA,QAAM,gBAAgB,CAAC,MAAM;AAE3B,UAAI;AAGJ,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAC3C,gBAAU,GAAG,EAAE,WAAW,EAAE,OAAO,QAAQ;AAG3C,iBAAW,GAAG,EAAE,OAAO;AASvB,WAAK,cAAc,WAAW,GAAG,eAAe,GAAG,eAAe;AAChE,YAAI,EAAE,QAAQ,SAAS,WAAW,IAAI,IAAI,CAAC,MAAc,GAAG;AAC1D;AAAA,QACF;AAAA,MACF;AAEA,QAAE,WAAW,KAAK,cAAc,KAAK,IAAI,IAAI;AAI7C,aAAO;AAAA,IACT;AAQA,QAAM,iBAAiB,CAAC,GAAG,QAAQ,QAAQ,YAAY;AAIrD,UAAI;AAMJ,gBAAU,GAAG,SAAS,KAAK,CAAC;AAC5B,gBAAU,GAAG,SAAS,GAAK,CAAC;AAC5B,gBAAU,GAAG,UAAU,GAAI,CAAC;AAC5B,WAAK,OAAO,GAAG,OAAO,SAAS,QAAQ;AAErC,kBAAU,GAAG,EAAE,QAAQ,SAAS,IAAI,IAAI,IAAI,CAAC,GAAW,CAAC;AAAA,MAC3D;AAGA,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAGpC,gBAAU,GAAG,EAAE,WAAW,SAAS,CAAC;AAAA,IAEtC;AAgBA,QAAM,mBAAmB,CAAC,MAAM;AAK9B,UAAI,aAAa;AACjB,UAAI;AAGJ,WAAK,IAAI,GAAG,KAAK,IAAI,KAAK,gBAAgB,GAAG;AAC3C,YAAK,aAAa,KAAO,EAAE,UAAU,IAAI,CAAC,MAAe,GAAI;AAC3D,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,UAAI,EAAE,UAAU,IAAI,CAAC,MAAe,KAAK,EAAE,UAAU,KAAK,CAAC,MAAe,KACtE,EAAE,UAAU,KAAK,CAAC,MAAe,GAAG;AACtC,eAAO;AAAA,MACT;AACA,WAAK,IAAI,IAAI,IAAI,UAAU,KAAK;AAC9B,YAAI,EAAE,UAAU,IAAI,CAAC,MAAe,GAAG;AACrC,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,aAAO;AAAA,IACT;AAGA,QAAI,mBAAmB;AAKvB,QAAM,WAAW,CAAC,MAClB;AAEE,UAAI,CAAC,kBAAkB;AACrB,uBAAe;AACf,2BAAmB;AAAA,MACrB;AAEA,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,SAAU,IAAI,SAAS,EAAE,WAAW,aAAa;AACnD,QAAE,UAAU,IAAI,SAAS,EAAE,SAAS,cAAc;AAElD,QAAE,SAAS;AACX,QAAE,WAAW;AAGb,iBAAW,CAAC;AAAA,IACd;AAMA,QAAM,mBAAmB,CAAC,GAAG,KAAK,YAAY,SAAS;AAMrD,gBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,gBAAU,CAAC;AACX,gBAAU,GAAG,UAAU;AACvB,gBAAU,GAAG,CAAC,UAAU;AACxB,UAAI,YAAY;AACd,UAAE,YAAY,IAAI,EAAE,OAAO,SAAS,KAAK,MAAM,UAAU,GAAG,EAAE,OAAO;AAAA,MACvE;AACA,QAAE,WAAW;AAAA,IACf;AAOA,QAAM,YAAY,CAAC,MAAM;AACvB,gBAAU,GAAG,gBAAgB,GAAG,CAAC;AACjC,gBAAU,GAAG,WAAW,YAAY;AACpC,eAAS,CAAC;AAAA,IACZ;AAOA,QAAM,kBAAkB,CAAC,GAAG,KAAK,YAAY,SAAS;AAMpD,UAAI,UAAU;AACd,UAAI,cAAc;AAGlB,UAAI,EAAE,QAAQ,GAAG;AAGf,YAAI,EAAE,KAAK,cAAc,WAAW;AAClC,YAAE,KAAK,YAAY,iBAAiB,CAAC;AAAA,QACvC;AAGA,mBAAW,GAAG,EAAE,MAAM;AAItB,mBAAW,GAAG,EAAE,MAAM;AAUtB,sBAAc,cAAc,CAAC;AAG7B,mBAAY,EAAE,UAAU,IAAI,MAAO;AACnC,sBAAe,EAAE,aAAa,IAAI,MAAO;AAMzC,YAAI,eAAe,UAAU;AAAE,qBAAW;AAAA,QAAa;AAAA,MAEzD,OAAO;AAEL,mBAAW,cAAc,aAAa;AAAA,MACxC;AAEA,UAAK,aAAa,KAAK,YAAc,QAAQ,IAAK;AAShD,yBAAiB,GAAG,KAAK,YAAY,IAAI;AAAA,MAE3C,WAAW,EAAE,aAAa,WAAW,gBAAgB,UAAU;AAE7D,kBAAU,IAAI,gBAAgB,MAAM,OAAO,IAAI,IAAI,CAAC;AACpD,uBAAe,GAAG,cAAc,YAAY;AAAA,MAE9C,OAAO;AACL,kBAAU,IAAI,aAAa,MAAM,OAAO,IAAI,IAAI,CAAC;AACjD,uBAAe,GAAG,EAAE,OAAO,WAAW,GAAG,EAAE,OAAO,WAAW,GAAG,cAAc,CAAC;AAC/E,uBAAe,GAAG,EAAE,WAAW,EAAE,SAAS;AAAA,MAC5C;AAKA,iBAAW,CAAC;AAEZ,UAAI,MAAM;AACR,kBAAU,CAAC;AAAA,MACb;AAAA,IAGF;AAMA,QAAM,YAAY,CAAC,GAAG,MAAM,OAAO;AAKjC,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI;AAC1C,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI,QAAQ;AAClD,QAAE,YAAY,EAAE,UAAU,EAAE,UAAU,IAAI;AAC1C,UAAI,SAAS,GAAG;AAEd,UAAE,UAAU,KAAK,CAAC;AAAA,MACpB,OAAO;AACL,UAAE;AAEF;AAKA,UAAE,WAAW,aAAa,EAAE,IAAI,WAAW,KAAK,CAAC;AACjD,UAAE,UAAU,OAAO,IAAI,IAAI,CAAC;AAAA,MAC9B;AAEA,aAAQ,EAAE,aAAa,EAAE;AAAA,IAC3B;AAEA,WAAO,QAAQ,WAAY;AAC3B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,kBAAmB;AAClC,WAAO,QAAQ,YAAY;AAC3B,WAAO,QAAQ,YAAY;AAAA;AAAA;;;AC1pC3B;AAAA;AAAA;AAyBA,QAAM,UAAU,CAAC,OAAO,KAAK,KAAK,QAAQ;AACxC,UAAI,KAAM,QAAQ,QAAS,GACvB,KAAO,UAAU,KAAM,QAAS,GAChC,IAAI;AAER,aAAO,QAAQ,GAAG;AAIhB,YAAI,MAAM,MAAO,MAAO;AACxB,eAAO;AAEP,WAAG;AACD,eAAM,KAAK,IAAI,KAAK,IAAI;AACxB,eAAM,KAAK,KAAK;AAAA,QAClB,SAAS,EAAE;AAEX,cAAM;AACN,cAAM;AAAA,MACR;AAEA,aAAQ,KAAM,MAAM,KAAM;AAAA,IAC5B;AAGA,WAAO,UAAU;AAAA;AAAA;;;AClDjB;AAAA;AAAA;AA0BA,QAAM,YAAY,MAAM;AACtB,UAAI,GAAG,QAAQ,CAAC;AAEhB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAI;AACJ,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAM,IAAI,IAAM,aAAc,MAAM,IAAO,MAAM;AAAA,QACnD;AACA,cAAM,CAAC,IAAI;AAAA,MACb;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,WAAW,IAAI,YAAY,UAAU,CAAC;AAG5C,QAAME,SAAQ,CAAC,KAAK,KAAK,KAAK,QAAQ;AACpC,YAAM,IAAI;AACV,YAAM,MAAM,MAAM;AAElB,aAAO;AAEP,eAAS,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9B,cAAO,QAAQ,IAAK,GAAG,MAAM,IAAI,CAAC,KAAK,GAAI;AAAA,MAC7C;AAEA,aAAQ,MAAO;AAAA,IACjB;AAGA,WAAO,UAAUA;AAAA;AAAA;;;AC1DjB;AAAA;AAAA;AAqBA,WAAO,UAAU;AAAA,MACf,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,GAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,MACR,MAAQ;AAAA;AAAA,IACV;AAAA;AAAA;;;AC/BA;AAAA;AAAA;AAqBA,WAAO,UAAU;AAAA;AAAA,MAGf,YAAoB;AAAA,MACpB,iBAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,UAAoB;AAAA,MACpB,SAAoB;AAAA,MACpB,SAAoB;AAAA;AAAA;AAAA;AAAA,MAKpB,MAAoB;AAAA,MACpB,cAAoB;AAAA,MACpB,aAAoB;AAAA,MACpB,SAAmB;AAAA,MACnB,gBAAmB;AAAA,MACnB,cAAmB;AAAA,MACnB,aAAmB;AAAA,MACnB,aAAmB;AAAA;AAAA;AAAA,MAInB,kBAA0B;AAAA,MAC1B,cAA0B;AAAA,MAC1B,oBAA0B;AAAA,MAC1B,uBAAyB;AAAA,MAGzB,YAA0B;AAAA,MAC1B,gBAA0B;AAAA,MAC1B,OAA0B;AAAA,MAC1B,SAA0B;AAAA,MAC1B,oBAA0B;AAAA;AAAA,MAG1B,UAA0B;AAAA,MAC1B,QAA0B;AAAA;AAAA,MAE1B,WAA0B;AAAA;AAAA,MAG1B,YAA0B;AAAA;AAAA,IAE5B;AAAA;AAAA;;;ACnEA;AAAA;AAAA;AAqBA,QAAM,EAAE,UAAU,kBAAkB,iBAAiB,WAAW,UAAU,IAAI;AAC9E,QAAM,UAAU;AAChB,QAAMC,SAAU;AAChB,QAAM,MAAU;AAKhB,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MAAiB;AAAA,MAAc;AAAA,MAAU;AAAA,MACrD;AAAA,MAAM;AAAA,MAAc;AAAA,MAAgB;AAAA,MAAc;AAAA,MAClD;AAAA,MACA;AAAA,MAAY;AAAA,MAAgB;AAAA,MAAO;AAAA,MAAS;AAAA,MAC5C;AAAA,MACA;AAAA,IACF,IAAI;AAKJ,QAAM,gBAAgB;AAEtB,QAAM,YAAY;AAElB,QAAM,gBAAgB;AAGtB,QAAM,eAAgB;AAEtB,QAAM,WAAgB;AAEtB,QAAM,UAAgB,WAAW,IAAI;AAErC,QAAM,UAAgB;AAEtB,QAAM,WAAgB;AAEtB,QAAM,YAAgB,IAAI,UAAU;AAEpC,QAAM,WAAY;AAGlB,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,gBAAiB,YAAY,YAAY;AAE/C,QAAM,cAAc;AAEpB,QAAM,aAAiB;AAEvB,QAAM,aAAiB;AAEvB,QAAM,cAAiB;AACvB,QAAM,aAAiB;AACvB,QAAM,gBAAiB;AACvB,QAAM,aAAgB;AACtB,QAAM,aAAgB;AACtB,QAAM,eAAgB;AAEtB,QAAM,eAAoB;AAC1B,QAAM,gBAAoB;AAC1B,QAAM,oBAAoB;AAC1B,QAAM,iBAAoB;AAE1B,QAAM,UAAU;AAEhB,QAAM,MAAM,CAAC,MAAM,cAAc;AAC/B,WAAK,MAAM,IAAI,SAAS;AACxB,aAAO;AAAA,IACT;AAEA,QAAM,OAAO,CAAC,MAAM;AAClB,aAAS,IAAK,KAAO,IAAK,IAAI,IAAI;AAAA,IACpC;AAEA,QAAM,OAAO,CAAC,QAAQ;AACpB,UAAI,MAAM,IAAI;AAAQ,aAAO,EAAE,OAAO,GAAG;AAAE,YAAI,GAAG,IAAI;AAAA,MAAG;AAAA,IAC3D;AAOA,QAAM,aAAa,CAAC,MAAM;AACxB,UAAI,GAAG;AACP,UAAI;AACJ,UAAI,QAAQ,EAAE;AAEd,UAAI,EAAE;AACN,UAAI;AACJ,SAAG;AACD,YAAI,EAAE,KAAK,EAAE,CAAC;AACd,UAAE,KAAK,CAAC,IAAK,KAAK,QAAQ,IAAI,QAAQ;AAAA,MACxC,SAAS,EAAE;AACX,UAAI;AAEJ,UAAI;AACJ,SAAG;AACD,YAAI,EAAE,KAAK,EAAE,CAAC;AACd,UAAE,KAAK,CAAC,IAAK,KAAK,QAAQ,IAAI,QAAQ;AAAA,MAIxC,SAAS,EAAE;AAAA,IAEb;AAGA,QAAI,OAAO,CAAC,GAAG,MAAM,UAAW,QAAQ,EAAE,aAAc,QAAQ,EAAE;AAWlE,QAAM,gBAAgB,CAAC,GAAG,QAAQ;AAChC,UAAI;AACJ,UAAI,EAAE,aAAa;AAEjB,YAAI,EAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,MAAM,YAAY,CAAC,CAAC;AAAA,MAC9D,OAAO;AAGL,cAAM,IAAI,EAAE;AAGZ,cAAM,QAAQ,EAAE,GAAG,IAAK,EAAE,MAAM,CAAC,KAAK,IAAM,EAAE,MAAM,CAAC,KAAK,KAAO,EAAE,MAAM,CAAC,KAAK;AAC/E,YAAI,EAAE,QAAU,KAAK,KAAK,OAAO,KAAK,IAAI,UAAW,KAAM,EAAE;AAAA,MAC/D;AACA,YAAM,YAAY,EAAE,KAAK,MAAM,EAAE,MAAM,IAAI,EAAE,KAAK,CAAC;AACnD,QAAE,KAAK,CAAC,IAAI;AACZ,aAAO;AAAA,IACT;AASA,QAAM,gBAAgB,CAAC,SAAS;AAC9B,YAAM,IAAI,KAAK;AAGf,UAAI,MAAM,EAAE;AACZ,UAAI,MAAM,KAAK,WAAW;AACxB,cAAM,KAAK;AAAA,MACb;AACA,UAAI,QAAQ,GAAG;AAAE;AAAA,MAAQ;AAEzB,WAAK,OAAO,IAAI,EAAE,YAAY,SAAS,EAAE,aAAa,EAAE,cAAc,GAAG,GAAG,KAAK,QAAQ;AACzF,WAAK,YAAa;AAClB,QAAE,eAAgB;AAClB,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,QAAE,WAAgB;AAClB,UAAI,EAAE,YAAY,GAAG;AACnB,UAAE,cAAc;AAAA,MAClB;AAAA,IACF;AAGA,QAAM,mBAAmB,CAAC,GAAG,SAAS;AACpC,sBAAgB,GAAI,EAAE,eAAe,IAAI,EAAE,cAAc,IAAK,EAAE,WAAW,EAAE,aAAa,IAAI;AAC9F,QAAE,cAAc,EAAE;AAClB,oBAAc,EAAE,IAAI;AAAA,IACtB;AAGA,QAAM,WAAW,CAAC,GAAG,MAAM;AACzB,QAAE,YAAY,EAAE,SAAS,IAAI;AAAA,IAC/B;AAQA,QAAM,cAAc,CAAC,GAAG,MAAM;AAI5B,QAAE,YAAY,EAAE,SAAS,IAAK,MAAM,IAAK;AACzC,QAAE,YAAY,EAAE,SAAS,IAAI,IAAI;AAAA,IACnC;AAUA,QAAM,WAAW,CAAC,MAAM,KAAK,OAAO,SAAS;AAE3C,UAAI,MAAM,KAAK;AAEf,UAAI,MAAM,MAAM;AAAE,cAAM;AAAA,MAAM;AAC9B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAG;AAE3B,WAAK,YAAY;AAGjB,UAAI,IAAI,KAAK,MAAM,SAAS,KAAK,SAAS,KAAK,UAAU,GAAG,GAAG,KAAK;AACpE,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,QAAQ,QAAQ,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MAClD,WAES,KAAK,MAAM,SAAS,GAAG;AAC9B,aAAK,QAAQA,OAAM,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,MAChD;AAEA,WAAK,WAAW;AAChB,WAAK,YAAY;AAEjB,aAAO;AAAA,IACT;AAYA,QAAM,gBAAgB,CAAC,GAAG,cAAc;AAEtC,UAAI,eAAe,EAAE;AACrB,UAAI,OAAO,EAAE;AACb,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW,EAAE;AACjB,UAAI,aAAa,EAAE;AACnB,YAAM,QAAS,EAAE,WAAY,EAAE,SAAS,gBACpC,EAAE,YAAY,EAAE,SAAS,iBAAiB;AAE9C,YAAM,OAAO,EAAE;AAEf,YAAM,QAAQ,EAAE;AAChB,YAAM,OAAQ,EAAE;AAMhB,YAAM,SAAS,EAAE,WAAW;AAC5B,UAAI,YAAa,KAAK,OAAO,WAAW,CAAC;AACzC,UAAI,WAAa,KAAK,OAAO,QAAQ;AAQrC,UAAI,EAAE,eAAe,EAAE,YAAY;AACjC,yBAAiB;AAAA,MACnB;AAIA,UAAI,aAAa,EAAE,WAAW;AAAE,qBAAa,EAAE;AAAA,MAAW;AAI1D,SAAG;AAED,gBAAQ;AAWR,YAAI,KAAK,QAAQ,QAAQ,MAAU,YAC/B,KAAK,QAAQ,WAAW,CAAC,MAAM,aAC/B,KAAK,KAAK,MAAqB,KAAK,IAAI,KACxC,KAAK,EAAE,KAAK,MAAmB,KAAK,OAAO,CAAC,GAAG;AACjD;AAAA,QACF;AAQA,gBAAQ;AACR;AAMA,WAAG;AAAA,QAEH,SAAS,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,MAAM,KAAK,EAAE,KAAK,KAC/D,OAAO;AAIhB,cAAM,aAAa,SAAS;AAC5B,eAAO,SAAS;AAEhB,YAAI,MAAM,UAAU;AAClB,YAAE,cAAc;AAChB,qBAAW;AACX,cAAI,OAAO,YAAY;AACrB;AAAA,UACF;AACA,sBAAa,KAAK,OAAO,WAAW,CAAC;AACrC,qBAAa,KAAK,OAAO,QAAQ;AAAA,QACnC;AAAA,MACF,UAAU,YAAY,KAAK,YAAY,KAAK,KAAK,SAAS,EAAE,iBAAiB;AAE7E,UAAI,YAAY,EAAE,WAAW;AAC3B,eAAO;AAAA,MACT;AACA,aAAO,EAAE;AAAA,IACX;AAaA,QAAM,cAAc,CAAC,MAAM;AAEzB,YAAM,UAAU,EAAE;AAClB,UAAI,GAAG,MAAM;AAIb,SAAG;AACD,eAAO,EAAE,cAAc,EAAE,YAAY,EAAE;AAoBvC,YAAI,EAAE,YAAY,WAAW,UAAU,gBAAgB;AAErD,YAAE,OAAO,IAAI,EAAE,OAAO,SAAS,SAAS,UAAU,UAAU,IAAI,GAAG,CAAC;AACpE,YAAE,eAAe;AACjB,YAAE,YAAY;AAEd,YAAE,eAAe;AACjB,cAAI,EAAE,SAAS,EAAE,UAAU;AACzB,cAAE,SAAS,EAAE;AAAA,UACf;AACA,qBAAW,CAAC;AACZ,kBAAQ;AAAA,QACV;AACA,YAAI,EAAE,KAAK,aAAa,GAAG;AACzB;AAAA,QACF;AAcA,YAAI,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,IAAI;AAC7D,UAAE,aAAa;AAGf,YAAI,CAAC,EAAE,aAAa;AAElB,cAAI,EAAE,YAAY,EAAE,SAAS,WAAW;AACtC,kBAAM,EAAE,WAAW,EAAE;AACrB,mBAAO,EAAE,QAAQ;AACf,4BAAc,GAAG,GAAG;AACpB;AACA,gBAAE;AACF,kBAAI,EAAE,YAAY,EAAE,UAAU,WAAW;AACvC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,EAAE,YAAY,EAAE,UAAU,WAAW;AAC9C,gBAAM,EAAE,WAAW,EAAE;AACrB,YAAE,QAAQ,EAAE,OAAO,GAAG;AAGtB,YAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,MAAM,CAAC,CAAC;AAI5C,iBAAO,EAAE,QAAQ;AACf,0BAAc,GAAG,GAAG;AACpB;AACA,cAAE;AACF,gBAAI,EAAE,YAAY,EAAE,SAAS,WAAW;AACtC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MAKF,SAAS,EAAE,YAAY,iBAAiB,EAAE,KAAK,aAAa;AAAA,IAsC9D;AAiBA,QAAM,iBAAiB,CAAC,GAAG,UAAU;AAMnC,UAAI,YAAY,EAAE,mBAAmB,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,mBAAmB;AAMpF,UAAI,KAAK,MAAM,MAAM,OAAO;AAC5B,UAAI,OAAO,EAAE,KAAK;AAClB,SAAG;AAKD,cAAM;AACN,eAAQ,EAAE,WAAW,MAAO;AAC5B,YAAI,EAAE,KAAK,YAAY,MAAM;AAC3B;AAAA,QACF;AAEA,eAAO,EAAE,KAAK,YAAY;AAC1B,eAAO,EAAE,WAAW,EAAE;AACtB,YAAI,MAAM,OAAO,EAAE,KAAK,UAAU;AAChC,gBAAM,OAAO,EAAE,KAAK;AAAA,QACtB;AACA,YAAI,MAAM,MAAM;AACd,gBAAM;AAAA,QACR;AAOA,YAAI,MAAM,cAAe,QAAQ,KAAK,UAAU,YAC5B,UAAU,cACV,QAAQ,OAAO,EAAE,KAAK,WAAW;AACnD;AAAA,QACF;AAKA,eAAO,UAAU,YAAY,QAAQ,OAAO,EAAE,KAAK,WAAW,IAAI;AAClE,yBAAiB,GAAG,GAAG,GAAG,IAAI;AAG9B,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI;AAC/B,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,OAAO;AACtC,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC;AAChC,UAAE,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,OAAO;AAGvC,sBAAc,EAAE,IAAI;AASpB,YAAI,MAAM;AACR,cAAI,OAAO,KAAK;AACd,mBAAO;AAAA,UACT;AAEA,YAAE,KAAK,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,aAAa,EAAE,cAAc,IAAI,GAAG,EAAE,KAAK,QAAQ;AACzF,YAAE,KAAK,YAAY;AACnB,YAAE,KAAK,aAAa;AACpB,YAAE,KAAK,aAAa;AACpB,YAAE,eAAe;AACjB,iBAAO;AAAA,QACT;AAKA,YAAI,KAAK;AACP,mBAAS,EAAE,MAAM,EAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,GAAG;AACpD,YAAE,KAAK,YAAY;AACnB,YAAE,KAAK,aAAa;AACpB,YAAE,KAAK,aAAa;AAAA,QACtB;AAAA,MACF,SAAS,SAAS;AAQlB,cAAQ,EAAE,KAAK;AACf,UAAI,MAAM;AAIR,YAAI,QAAQ,EAAE,QAAQ;AACpB,YAAE,UAAU;AAEZ,YAAE,OAAO,IAAI,EAAE,KAAK,MAAM,SAAS,EAAE,KAAK,UAAU,EAAE,QAAQ,EAAE,KAAK,OAAO,GAAG,CAAC;AAChF,YAAE,WAAW,EAAE;AACf,YAAE,SAAS,EAAE;AAAA,QACf,OACK;AACH,cAAI,EAAE,cAAc,EAAE,YAAY,MAAM;AAEtC,cAAE,YAAY,EAAE;AAEhB,cAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,GAAG,CAAC;AAClE,gBAAI,EAAE,UAAU,GAAG;AACjB,gBAAE;AAAA,YACJ;AACA,gBAAI,EAAE,SAAS,EAAE,UAAU;AACzB,gBAAE,SAAS,EAAE;AAAA,YACf;AAAA,UACF;AAEA,YAAE,OAAO,IAAI,EAAE,KAAK,MAAM,SAAS,EAAE,KAAK,UAAU,MAAM,EAAE,KAAK,OAAO,GAAG,EAAE,QAAQ;AACrF,YAAE,YAAY;AACd,YAAE,UAAU,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,QACjE;AACA,UAAE,cAAc,EAAE;AAAA,MACpB;AACA,UAAI,EAAE,aAAa,EAAE,UAAU;AAC7B,UAAE,aAAa,EAAE;AAAA,MACnB;AAGA,UAAI,MAAM;AACR,eAAO;AAAA,MACT;AAGA,UAAI,UAAU,cAAc,UAAU,YACpC,EAAE,KAAK,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa;AACvD,eAAO;AAAA,MACT;AAGA,aAAO,EAAE,cAAc,EAAE;AACzB,UAAI,EAAE,KAAK,WAAW,QAAQ,EAAE,eAAe,EAAE,QAAQ;AAEvD,UAAE,eAAe,EAAE;AACnB,UAAE,YAAY,EAAE;AAEhB,UAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,GAAG,CAAC;AAClE,YAAI,EAAE,UAAU,GAAG;AACjB,YAAE;AAAA,QACJ;AACA,gBAAQ,EAAE;AACV,YAAI,EAAE,SAAS,EAAE,UAAU;AACzB,YAAE,SAAS,EAAE;AAAA,QACf;AAAA,MACF;AACA,UAAI,OAAO,EAAE,KAAK,UAAU;AAC1B,eAAO,EAAE,KAAK;AAAA,MAChB;AACA,UAAI,MAAM;AACR,iBAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,IAAI;AAC3C,UAAE,YAAY;AACd,UAAE,UAAU,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,MACjE;AACA,UAAI,EAAE,aAAa,EAAE,UAAU;AAC7B,UAAE,aAAa,EAAE;AAAA,MACnB;AAOA,aAAQ,EAAE,WAAW,MAAO;AAE5B,aAAO,EAAE,mBAAmB,OAAO,QAAwB,QAAwB,EAAE,mBAAmB;AACxG,kBAAY,OAAO,EAAE,SAAS,EAAE,SAAS;AACzC,aAAO,EAAE,WAAW,EAAE;AACtB,UAAI,QAAQ,cACP,QAAQ,UAAU,aAAa,UAAU,cAC3C,EAAE,KAAK,aAAa,KAAK,QAAQ,MAAO;AACzC,cAAM,OAAO,OAAO,OAAO;AAC3B,eAAO,UAAU,YAAY,EAAE,KAAK,aAAa,KAC5C,QAAQ,OAAO,IAAI;AACxB,yBAAiB,GAAG,EAAE,aAAa,KAAK,IAAI;AAC5C,UAAE,eAAe;AACjB,sBAAc,EAAE,IAAI;AAAA,MACtB;AAGA,aAAO,OAAO,oBAAoB;AAAA,IACpC;AAUA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AACJ,UAAI;AAEJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AACrB;AAAA,UACF;AAAA,QACF;AAKA,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,QACzC;AAKA,YAAI,cAAc,KAAc,EAAE,WAAW,aAAe,EAAE,SAAS,eAAiB;AAKtF,YAAE,eAAe,cAAc,GAAG,SAAS;AAAA,QAE7C;AACA,YAAI,EAAE,gBAAgB,WAAW;AAK/B,mBAAS,UAAU,GAAG,EAAE,WAAW,EAAE,aAAa,EAAE,eAAe,SAAS;AAE5E,YAAE,aAAa,EAAE;AAKjB,cAAI,EAAE,gBAAgB,EAAE,kBAAuC,EAAE,aAAa,WAAW;AACvF,cAAE;AACF,eAAG;AACD,gBAAE;AACF,0BAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,YAIzC,SAAS,EAAE,EAAE,iBAAiB;AAC9B,cAAE;AAAA,UACJ,OACA;AACE,cAAE,YAAY,EAAE;AAChB,cAAE,eAAe;AACjB,gBAAI,EAAE,aAAa;AACjB,gBAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;AAE7B,gBAAE,QAAQ,KAAK,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAAA,YAQrD;AAAA,UACF;AAAA,QACF,OAAO;AAIL,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAE7C,YAAE;AACF,YAAE;AAAA,QACJ;AACA,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAW,EAAE,WAAY,YAAY,IAAM,EAAE,WAAW,YAAY;AACtE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAOA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AACJ,UAAI;AAEJ,UAAI;AAGJ,iBAAS;AAMP,YAAI,EAAE,YAAY,eAAe;AAC/B,sBAAY,CAAC;AACb,cAAI,EAAE,YAAY,iBAAiB,UAAU,YAAY;AACvD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAO;AAAA,QAClC;AAKA,oBAAY;AACZ,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,QACzC;AAIA,UAAE,cAAc,EAAE;AAClB,UAAE,aAAa,EAAE;AACjB,UAAE,eAAe,YAAY;AAE7B,YAAI,cAAc,KAAY,EAAE,cAAc,EAAE,kBAC5C,EAAE,WAAW,aAAc,EAAE,SAAS,eAA+B;AAKvE,YAAE,eAAe,cAAc,GAAG,SAAS;AAG3C,cAAI,EAAE,gBAAgB,MAClB,EAAE,aAAa,cAAe,EAAE,iBAAiB,aAAa,EAAE,WAAW,EAAE,cAAc,OAAmB;AAKhH,cAAE,eAAe,YAAY;AAAA,UAC/B;AAAA,QACF;AAIA,YAAI,EAAE,eAAe,aAAa,EAAE,gBAAgB,EAAE,aAAa;AACjE,uBAAa,EAAE,WAAW,EAAE,YAAY;AAOxC,mBAAS,UAAU,GAAG,EAAE,WAAW,IAAI,EAAE,YAAY,EAAE,cAAc,SAAS;AAM9E,YAAE,aAAa,EAAE,cAAc;AAC/B,YAAE,eAAe;AACjB,aAAG;AACD,gBAAI,EAAE,EAAE,YAAY,YAAY;AAC9B,0BAAY,cAAc,GAAG,EAAE,QAAQ;AAAA,YACzC;AAAA,UACF,SAAS,EAAE,EAAE,gBAAgB;AAC7B,YAAE,kBAAkB;AACpB,YAAE,eAAe,YAAY;AAC7B,YAAE;AAEF,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AACzB,gBAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,qBAAO;AAAA,YACT;AAAA,UAEF;AAAA,QAEF,WAAW,EAAE,iBAAiB;AAO5B,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEjD,cAAI,QAAQ;AAEV,6BAAiB,GAAG,KAAK;AAAA,UAE3B;AACA,YAAE;AACF,YAAE;AACF,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QACF,OAAO;AAIL,YAAE,kBAAkB;AACpB,YAAE;AACF,YAAE;AAAA,QACJ;AAAA,MACF;AAEA,UAAI,EAAE,iBAAiB;AAGrB,iBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;AAEjD,UAAE,kBAAkB;AAAA,MACtB;AACA,QAAE,SAAS,EAAE,WAAW,YAAY,IAAI,EAAE,WAAW,YAAY;AACjE,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AAEA,aAAO;AAAA,IACT;AAQA,QAAM,cAAc,CAAC,GAAG,UAAU;AAEhC,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AAEV,YAAM,OAAO,EAAE;AAEf,iBAAS;AAKP,YAAI,EAAE,aAAa,WAAW;AAC5B,sBAAY,CAAC;AACb,cAAI,EAAE,aAAa,aAAa,UAAU,YAAY;AACpD,mBAAO;AAAA,UACT;AACA,cAAI,EAAE,cAAc,GAAG;AAAE;AAAA,UAAO;AAAA,QAClC;AAGA,UAAE,eAAe;AACjB,YAAI,EAAE,aAAa,aAAa,EAAE,WAAW,GAAG;AAC9C,iBAAO,EAAE,WAAW;AACpB,iBAAO,KAAK,IAAI;AAChB,cAAI,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,GAAG;AAC3E,qBAAS,EAAE,WAAW;AACtB,eAAG;AAAA,YAEH,SAAS,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,SAAS,KAAK,EAAE,IAAI,KAAK,SAAS,KAAK,EAAE,IAAI,KAC7C,OAAO;AAChB,cAAE,eAAe,aAAa,SAAS;AACvC,gBAAI,EAAE,eAAe,EAAE,WAAW;AAChC,gBAAE,eAAe,EAAE;AAAA,YACrB;AAAA,UACF;AAAA,QAEF;AAGA,YAAI,EAAE,gBAAgB,WAAW;AAI/B,mBAAS,UAAU,GAAG,GAAG,EAAE,eAAe,SAAS;AAEnD,YAAE,aAAa,EAAE;AACjB,YAAE,YAAY,EAAE;AAChB,YAAE,eAAe;AAAA,QACnB,OAAO;AAIL,mBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAE7C,YAAE;AACF,YAAE;AAAA,QACJ;AACA,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAMA,QAAM,eAAe,CAAC,GAAG,UAAU;AAEjC,UAAI;AAEJ,iBAAS;AAEP,YAAI,EAAE,cAAc,GAAG;AACrB,sBAAY,CAAC;AACb,cAAI,EAAE,cAAc,GAAG;AACrB,gBAAI,UAAU,YAAY;AACxB,qBAAO;AAAA,YACT;AACA;AAAA,UACF;AAAA,QACF;AAGA,UAAE,eAAe;AAGjB,iBAAS,UAAU,GAAG,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC;AAC7C,UAAE;AACF,UAAE;AACF,YAAI,QAAQ;AAEV,2BAAiB,GAAG,KAAK;AACzB,cAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,mBAAO;AAAA,UACT;AAAA,QAEF;AAAA,MACF;AACA,QAAE,SAAS;AACX,UAAI,UAAU,UAAU;AAEtB,yBAAiB,GAAG,IAAI;AACxB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AACA,UAAI,EAAE,UAAU;AAEd,yBAAiB,GAAG,KAAK;AACzB,YAAI,EAAE,KAAK,cAAc,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,OAAO,aAAa,UAAU,aAAa,WAAW,MAAM;AAEnE,WAAK,cAAc;AACnB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,OAAO;AAAA,IACd;AAEA,QAAM,sBAAsB;AAAA;AAAA,MAE1B,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,cAAc;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,YAAY;AAAA;AAAA,MACnC,IAAI,OAAO,GAAG,GAAG,IAAI,GAAG,YAAY;AAAA;AAAA,MACpC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MAErC,IAAI,OAAO,GAAG,GAAG,IAAI,IAAI,YAAY;AAAA;AAAA,MACrC,IAAI,OAAO,GAAG,IAAI,IAAI,IAAI,YAAY;AAAA;AAAA,MACtC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,GAAG,IAAI,KAAK,KAAK,YAAY;AAAA;AAAA,MACxC,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,MAC3C,IAAI,OAAO,IAAI,KAAK,KAAK,MAAM,YAAY;AAAA;AAAA,IAC7C;AAMA,QAAM,UAAU,CAAC,MAAM;AAErB,QAAE,cAAc,IAAI,EAAE;AAGtB,WAAK,EAAE,IAAI;AAIX,QAAE,iBAAiB,oBAAoB,EAAE,KAAK,EAAE;AAChD,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,aAAa,oBAAoB,EAAE,KAAK,EAAE;AAC5C,QAAE,mBAAmB,oBAAoB,EAAE,KAAK,EAAE;AAElD,QAAE,WAAW;AACb,QAAE,cAAc;AAChB,QAAE,YAAY;AACd,QAAE,SAAS;AACX,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,QAAE,QAAQ;AAAA,IACZ;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,cAAc;AACnB,WAAK,mBAAmB;AACxB,WAAK,cAAc;AACnB,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,aAAa;AAElB,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,SAAS;AAEd,WAAK,SAAS;AAQd,WAAK,cAAc;AAKnB,WAAK,OAAO;AAMZ,WAAK,OAAO;AAEZ,WAAK,QAAQ;AACb,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,YAAY;AAEjB,WAAK,aAAa;AAOlB,WAAK,cAAc;AAKnB,WAAK,eAAe;AACpB,WAAK,aAAa;AAClB,WAAK,kBAAkB;AACvB,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AAEjB,WAAK,cAAc;AAKnB,WAAK,mBAAmB;AAMxB,WAAK,iBAAiB;AAYtB,WAAK,QAAQ;AACb,WAAK,WAAW;AAEhB,WAAK,aAAa;AAGlB,WAAK,aAAa;AAYlB,WAAK,YAAa,IAAI,YAAY,YAAY,CAAC;AAC/C,WAAK,YAAa,IAAI,aAAa,IAAI,UAAU,KAAK,CAAC;AACvD,WAAK,UAAa,IAAI,aAAa,IAAI,WAAW,KAAK,CAAC;AACxD,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,OAAO;AAEjB,WAAK,SAAW;AAChB,WAAK,SAAW;AAChB,WAAK,UAAW;AAGhB,WAAK,WAAW,IAAI,YAAY,WAAW,CAAC;AAI5C,WAAK,OAAO,IAAI,YAAY,IAAI,UAAU,CAAC;AAC3C,WAAK,KAAK,IAAI;AAEd,WAAK,WAAW;AAChB,WAAK,WAAW;AAKhB,WAAK,QAAQ,IAAI,YAAY,IAAI,UAAU,CAAC;AAC5C,WAAK,KAAK,KAAK;AAIf,WAAK,UAAU;AAEf,WAAK,cAAc;AAoBnB,WAAK,WAAW;AAChB,WAAK,UAAU;AAEf,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,UAAU;AACf,WAAK,SAAS;AAGd,WAAK,SAAS;AAId,WAAK,WAAW;AAAA,IAalB;AAMA,QAAM,oBAAoB,CAAC,SAAS;AAElC,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,YAAM,IAAI,KAAK;AACf,UAAI,CAAC,KAAK,EAAE,SAAS,QAAS,EAAE,WAAW;AAAA,MAEb,EAAE,WAAW;AAAA,MAEb,EAAE,WAAW,eACb,EAAE,WAAW,cACb,EAAE,WAAW,iBACb,EAAE,WAAW,cACb,EAAE,WAAW,cACb,EAAE,WAAW,cAAe;AACxD,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,SAAS;AAEjC,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO,IAAI,MAAM,cAAc;AAAA,MACjC;AAEA,WAAK,WAAW,KAAK,YAAY;AACjC,WAAK,YAAY;AAEjB,YAAM,IAAI,KAAK;AACf,QAAE,UAAU;AACZ,QAAE,cAAc;AAEhB,UAAI,EAAE,OAAO,GAAG;AACd,UAAE,OAAO,CAAC,EAAE;AAAA,MAEd;AACA,QAAE;AAAA,MAEA,EAAE,SAAS,IAAI;AAAA;AAAA,QAEf,EAAE,OAAO,aAAa;AAAA;AACxB,WAAK,QAAS,EAAE,SAAS,IACvB,IAEA;AACF,QAAE,aAAa;AACf,eAAS,CAAC;AACV,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,SAAS;AAE7B,YAAM,MAAM,iBAAiB,IAAI;AACjC,UAAI,QAAQ,MAAM;AAChB,gBAAQ,KAAK,KAAK;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,MAAM,SAAS;AAEvC,UAAI,kBAAkB,IAAI,KAAK,KAAK,MAAM,SAAS,GAAG;AACpD,eAAO;AAAA,MACT;AACA,WAAK,MAAM,SAAS;AACpB,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,MAAM,OAAO,QAAQ,YAAY,UAAU,UAAU,eAAe;AAExF,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,UAAI,OAAO;AAEX,UAAI,UAAU,uBAAuB;AACnC,gBAAQ;AAAA,MACV;AAEA,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAChB,WAES,aAAa,IAAI;AACxB,eAAO;AACP,sBAAc;AAAA,MAChB;AAGA,UAAI,WAAW,KAAK,WAAW,iBAAiB,WAAW,cACzD,aAAa,KAAK,aAAa,MAAM,QAAQ,KAAK,QAAQ,KAC1D,WAAW,KAAK,WAAW,WAAY,eAAe,KAAK,SAAS,GAAI;AACxE,eAAO,IAAI,MAAM,cAAc;AAAA,MACjC;AAGA,UAAI,eAAe,GAAG;AACpB,qBAAa;AAAA,MACf;AAGA,YAAM,IAAI,IAAI,aAAa;AAE3B,WAAK,QAAQ;AACb,QAAE,OAAO;AACT,QAAE,SAAS;AAEX,QAAE,OAAO;AACT,QAAE,SAAS;AACX,QAAE,SAAS;AACX,QAAE,SAAS,KAAK,EAAE;AAClB,QAAE,SAAS,EAAE,SAAS;AAEtB,QAAE,cAAc,aAAa,IAAI;AAEjC,QAAE,YAAY,WAAW;AAEzB,UAAI,CAAC,EAAE,eAAe,EAAE,YAAY,IAAI;AACtC,UAAE,YAAY;AAAA,MAChB;AACA,QAAE,YAAY,KAAK,EAAE;AACrB,QAAE,YAAY,EAAE,YAAY;AAC5B,QAAE,aAAa,CAAC,GAAG,EAAE,YAAY,YAAY,KAAK;AAElD,QAAE,SAAS,IAAI,WAAW,EAAE,SAAS,CAAC;AACtC,QAAE,OAAO,IAAI,YAAY,EAAE,SAAS;AACpC,QAAE,OAAO,IAAI,YAAY,EAAE,MAAM;AAKjC,QAAE,cAAc,KAAM,WAAW;AAyCjC,QAAE,mBAAmB,EAAE,cAAc;AACrC,QAAE,cAAc,IAAI,WAAW,EAAE,gBAAgB;AAIjD,QAAE,UAAU,EAAE;AAGd,QAAE,WAAW,EAAE,cAAc,KAAK;AAMlC,QAAE,QAAQ;AACV,QAAE,WAAW;AACb,QAAE,SAAS;AAEX,aAAO,aAAa,IAAI;AAAA,IAC1B;AAEA,QAAM,cAAc,CAAC,MAAM,UAAU;AAEnC,aAAO,aAAa,MAAM,OAAO,YAAY,WAAW,eAAe,kBAAkB;AAAA,IAC3F;AAIA,QAAM,UAAU,CAAC,MAAM,UAAU;AAE/B,UAAI,kBAAkB,IAAI,KAAK,QAAQ,WAAW,QAAQ,GAAG;AAC3D,eAAO,OAAO,IAAI,MAAM,cAAc,IAAI;AAAA,MAC5C;AAEA,YAAM,IAAI,KAAK;AAEf,UAAI,CAAC,KAAK,UACL,KAAK,aAAa,KAAK,CAAC,KAAK,SAC7B,EAAE,WAAW,gBAAgB,UAAU,UAAW;AACrD,eAAO,IAAI,MAAO,KAAK,cAAc,IAAK,cAAc,cAAc;AAAA,MACxE;AAEA,YAAM,YAAY,EAAE;AACpB,QAAE,aAAa;AAGf,UAAI,EAAE,YAAY,GAAG;AACnB,sBAAc,IAAI;AAClB,YAAI,KAAK,cAAc,GAAG;AAOxB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MAMF,WAAW,KAAK,aAAa,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS,KAC7D,UAAU,UAAU;AACpB,eAAO,IAAI,MAAM,WAAW;AAAA,MAC9B;AAGA,UAAI,EAAE,WAAW,gBAAgB,KAAK,aAAa,GAAG;AACpD,eAAO,IAAI,MAAM,WAAW;AAAA,MAC9B;AAGA,UAAI,EAAE,WAAW,cAAc,EAAE,SAAS,GAAG;AAC3C,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAE3B,YAAI,SAAU,cAAe,EAAE,SAAS,KAAM,MAAO;AACrD,YAAI,cAAc;AAElB,YAAI,EAAE,YAAY,kBAAkB,EAAE,QAAQ,GAAG;AAC/C,wBAAc;AAAA,QAChB,WAAW,EAAE,QAAQ,GAAG;AACtB,wBAAc;AAAA,QAChB,WAAW,EAAE,UAAU,GAAG;AACxB,wBAAc;AAAA,QAChB,OAAO;AACL,wBAAc;AAAA,QAChB;AACA,kBAAW,eAAe;AAC1B,YAAI,EAAE,aAAa,GAAG;AAAE,oBAAU;AAAA,QAAa;AAC/C,kBAAU,KAAM,SAAS;AAEzB,oBAAY,GAAG,MAAM;AAGrB,YAAI,EAAE,aAAa,GAAG;AACpB,sBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,sBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,QACpC;AACA,aAAK,QAAQ;AACb,UAAE,SAAS;AAGX,sBAAc,IAAI;AAClB,YAAI,EAAE,YAAY,GAAG;AACnB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,EAAE,WAAW,YAAY;AAE3B,aAAK,QAAQ;AACb,iBAAS,GAAG,EAAE;AACd,iBAAS,GAAG,GAAG;AACf,iBAAS,GAAG,CAAC;AACb,YAAI,CAAC,EAAE,QAAQ;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,CAAC;AACb,mBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,mBAAS,GAAG,OAAO;AACnB,YAAE,SAAS;AAGX,wBAAc,IAAI;AAClB,cAAI,EAAE,YAAY,GAAG;AACnB,cAAE,aAAa;AACf,mBAAO;AAAA,UACT;AAAA,QACF,OACK;AACH;AAAA,YAAS;AAAA,aAAI,EAAE,OAAO,OAAO,IAAI,MACpB,EAAE,OAAO,OAAO,IAAI,MACpB,CAAC,EAAE,OAAO,QAAQ,IAAI,MACtB,CAAC,EAAE,OAAO,OAAO,IAAI,MACrB,CAAC,EAAE,OAAO,UAAU,IAAI;AAAA,UACrC;AACA,mBAAS,GAAG,EAAE,OAAO,OAAO,GAAI;AAChC,mBAAS,GAAI,EAAE,OAAO,QAAQ,IAAK,GAAI;AACvC,mBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,mBAAS,GAAI,EAAE,OAAO,QAAQ,KAAM,GAAI;AACxC,mBAAS,GAAG,EAAE,UAAU,IAAI,IACf,EAAE,YAAY,kBAAkB,EAAE,QAAQ,IAC1C,IAAI,CAAE;AACnB,mBAAS,GAAG,EAAE,OAAO,KAAK,GAAI;AAC9B,cAAI,EAAE,OAAO,SAAS,EAAE,OAAO,MAAM,QAAQ;AAC3C,qBAAS,GAAG,EAAE,OAAO,MAAM,SAAS,GAAI;AACxC,qBAAS,GAAI,EAAE,OAAO,MAAM,UAAU,IAAK,GAAI;AAAA,UACjD;AACA,cAAI,EAAE,OAAO,MAAM;AACjB,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,SAAS,CAAC;AAAA,UAC5D;AACA,YAAE,UAAU;AACZ,YAAE,SAAS;AAAA,QACb;AAAA,MACF;AACA,UAAI,EAAE,WAAW,aAAa;AAC5B,YAAI,EAAE,OAAO,OAAqB;AAChC,cAAI,MAAM,EAAE;AACZ,cAAI,QAAQ,EAAE,OAAO,MAAM,SAAS,SAAU,EAAE;AAChD,iBAAO,EAAE,UAAU,OAAO,EAAE,kBAAkB;AAC5C,gBAAI,OAAO,EAAE,mBAAmB,EAAE;AAGlC,cAAE,YAAY,IAAI,EAAE,OAAO,MAAM,SAAS,EAAE,SAAS,EAAE,UAAU,IAAI,GAAG,EAAE,OAAO;AACjF,cAAE,UAAU,EAAE;AAEd,gBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,mBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,YACpE;AAEA,cAAE,WAAW;AACb,0BAAc,IAAI;AAClB,gBAAI,EAAE,YAAY,GAAG;AACnB,gBAAE,aAAa;AACf,qBAAO;AAAA,YACT;AACA,kBAAM;AACN,oBAAQ;AAAA,UACV;AAGA,cAAI,eAAe,IAAI,WAAW,EAAE,OAAO,KAAK;AAGhD,YAAE,YAAY,IAAI,aAAa,SAAS,EAAE,SAAS,EAAE,UAAU,IAAI,GAAG,EAAE,OAAO;AAC/E,YAAE,WAAW;AAEb,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAEA,YAAE,UAAU;AAAA,QACd;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAoB;AAC/B,cAAI,MAAM,EAAE;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AAEpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cACpE;AAEA,4BAAc,IAAI;AAClB,kBAAI,EAAE,YAAY,GAAG;AACnB,kBAAE,aAAa;AACf,uBAAO;AAAA,cACT;AACA,oBAAM;AAAA,YACR;AAEA,gBAAI,EAAE,UAAU,EAAE,OAAO,KAAK,QAAQ;AACpC,oBAAM,EAAE,OAAO,KAAK,WAAW,EAAE,SAAS,IAAI;AAAA,YAChD,OAAO;AACL,oBAAM;AAAA,YACR;AACA,qBAAS,GAAG,GAAG;AAAA,UACjB,SAAS,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAEA,YAAE,UAAU;AAAA,QACd;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,eAAe;AAC9B,YAAI,EAAE,OAAO,SAAuB;AAClC,cAAI,MAAM,EAAE;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,EAAE,YAAY,EAAE,kBAAkB;AAEpC,kBAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,qBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,cACpE;AAEA,4BAAc,IAAI;AAClB,kBAAI,EAAE,YAAY,GAAG;AACnB,kBAAE,aAAa;AACf,uBAAO;AAAA,cACT;AACA,oBAAM;AAAA,YACR;AAEA,gBAAI,EAAE,UAAU,EAAE,OAAO,QAAQ,QAAQ;AACvC,oBAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,SAAS,IAAI;AAAA,YACnD,OAAO;AACL,oBAAM;AAAA,YACR;AACA,qBAAS,GAAG,GAAG;AAAA,UACjB,SAAS,QAAQ;AAEjB,cAAI,EAAE,OAAO,QAAQ,EAAE,UAAU,KAAK;AACpC,iBAAK,QAAQA,OAAM,KAAK,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,GAAG;AAAA,UACpE;AAAA,QAEF;AACA,UAAE,SAAS;AAAA,MACb;AACA,UAAI,EAAE,WAAW,YAAY;AAC3B,YAAI,EAAE,OAAO,MAAM;AACjB,cAAI,EAAE,UAAU,IAAI,EAAE,kBAAkB;AACtC,0BAAc,IAAI;AAClB,gBAAI,EAAE,YAAY,GAAG;AACnB,gBAAE,aAAa;AACf,qBAAO;AAAA,YACT;AAAA,UACF;AACA,mBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,mBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,eAAK,QAAQ;AAAA,QACf;AACA,UAAE,SAAS;AAGX,sBAAc,IAAI;AAClB,YAAI,EAAE,YAAY,GAAG;AACnB,YAAE,aAAa;AACf,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,UAAI,KAAK,aAAa,KAAK,EAAE,cAAc,KACxC,UAAU,cAAc,EAAE,WAAW,cAAe;AACrD,YAAI,SAAS,EAAE,UAAU,IAAI,eAAe,GAAG,KAAK,IACvC,EAAE,aAAa,iBAAiB,aAAa,GAAG,KAAK,IACrD,EAAE,aAAa,QAAQ,YAAY,GAAG,KAAK,IAC3C,oBAAoB,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK;AAEvD,YAAI,WAAW,qBAAqB,WAAW,gBAAgB;AAC7D,YAAE,SAAS;AAAA,QACb;AACA,YAAI,WAAW,gBAAgB,WAAW,mBAAmB;AAC3D,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AAAA,UAEjB;AACA,iBAAO;AAAA,QAQT;AACA,YAAI,WAAW,eAAe;AAC5B,cAAI,UAAU,iBAAiB;AAC7B,sBAAU,CAAC;AAAA,UACb,WACS,UAAU,SAAS;AAE1B,6BAAiB,GAAG,GAAG,GAAG,KAAK;AAI/B,gBAAI,UAAU,cAAc;AAE1B,mBAAK,EAAE,IAAI;AAEX,kBAAI,EAAE,cAAc,GAAG;AACrB,kBAAE,WAAW;AACb,kBAAE,cAAc;AAChB,kBAAE,SAAS;AAAA,cACb;AAAA,YACF;AAAA,UACF;AACA,wBAAc,IAAI;AAClB,cAAI,KAAK,cAAc,GAAG;AACxB,cAAE,aAAa;AACf,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAEA,UAAI,UAAU,UAAU;AAAE,eAAO;AAAA,MAAM;AACvC,UAAI,EAAE,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAc;AAGxC,UAAI,EAAE,SAAS,GAAG;AAChB,iBAAS,GAAG,KAAK,QAAQ,GAAI;AAC7B,iBAAS,GAAI,KAAK,SAAS,IAAK,GAAI;AACpC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAI,KAAK,SAAS,KAAM,GAAI;AACrC,iBAAS,GAAG,KAAK,WAAW,GAAI;AAChC,iBAAS,GAAI,KAAK,YAAY,IAAK,GAAI;AACvC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AACxC,iBAAS,GAAI,KAAK,YAAY,KAAM,GAAI;AAAA,MAC1C,OAEA;AACE,oBAAY,GAAG,KAAK,UAAU,EAAE;AAChC,oBAAY,GAAG,KAAK,QAAQ,KAAM;AAAA,MACpC;AAEA,oBAAc,IAAI;AAIlB,UAAI,EAAE,OAAO,GAAG;AAAE,UAAE,OAAO,CAAC,EAAE;AAAA,MAAM;AAEpC,aAAO,EAAE,YAAY,IAAI,OAAO;AAAA,IAClC;AAGA,QAAM,aAAa,CAAC,SAAS;AAE3B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,YAAM,SAAS,KAAK,MAAM;AAE1B,WAAK,QAAQ;AAEb,aAAO,WAAW,aAAa,IAAI,MAAM,YAAY,IAAI;AAAA,IAC3D;AAOA,QAAM,uBAAuB,CAAC,MAAM,eAAe;AAEjD,UAAI,aAAa,WAAW;AAE5B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,YAAM,IAAI,KAAK;AACf,YAAM,OAAO,EAAE;AAEf,UAAI,SAAS,KAAM,SAAS,KAAK,EAAE,WAAW,cAAe,EAAE,WAAW;AACxE,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,GAAG;AAEd,aAAK,QAAQ,QAAQ,KAAK,OAAO,YAAY,YAAY,CAAC;AAAA,MAC5D;AAEA,QAAE,OAAO;AAGT,UAAI,cAAc,EAAE,QAAQ;AAC1B,YAAI,SAAS,GAAG;AAEd,eAAK,EAAE,IAAI;AACX,YAAE,WAAW;AACb,YAAE,cAAc;AAChB,YAAE,SAAS;AAAA,QACb;AAGA,YAAI,UAAU,IAAI,WAAW,EAAE,MAAM;AACrC,gBAAQ,IAAI,WAAW,SAAS,aAAa,EAAE,QAAQ,UAAU,GAAG,CAAC;AACrE,qBAAa;AACb,qBAAa,EAAE;AAAA,MACjB;AAEA,YAAM,QAAQ,KAAK;AACnB,YAAM,OAAO,KAAK;AAClB,YAAM,QAAQ,KAAK;AACnB,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,kBAAY,CAAC;AACb,aAAO,EAAE,aAAa,WAAW;AAC/B,YAAI,MAAM,EAAE;AACZ,YAAI,IAAI,EAAE,aAAa,YAAY;AACnC,WAAG;AACD,wBAAc,GAAG,GAAG;AACpB;AAAA,QACF,SAAS,EAAE;AACX,UAAE,WAAW;AACb,UAAE,YAAY,YAAY;AAC1B,oBAAY,CAAC;AAAA,MACf;AACA,QAAE,YAAY,EAAE;AAChB,QAAE,cAAc,EAAE;AAClB,QAAE,SAAS,EAAE;AACb,QAAE,YAAY;AACd,QAAE,eAAe,EAAE,cAAc,YAAY;AAC7C,QAAE,kBAAkB;AACpB,WAAK,UAAU;AACf,WAAK,QAAQ;AACb,WAAK,WAAW;AAChB,QAAE,OAAO;AACT,aAAO;AAAA,IACT;AAGA,WAAO,QAAQ,cAAc;AAC7B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,uBAAuB;AACtC,WAAO,QAAQ,cAAc;AAAA;AAAA;;;AC1gE7B;AAAA;AAAA;AAGA,QAAM,OAAO,CAAC,KAAK,QAAQ;AACzB,aAAO,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG;AAAA,IACtD;AAEA,WAAO,QAAQ,SAAS,SAAU,KAAkC;AAClE,YAAM,UAAU,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AACvD,aAAO,QAAQ,QAAQ;AACrB,cAAM,SAAS,QAAQ,MAAM;AAC7B,YAAI,CAAC,QAAQ;AAAE;AAAA,QAAU;AAEzB,YAAI,OAAO,WAAW,UAAU;AAC9B,gBAAM,IAAI,UAAU,SAAS,oBAAoB;AAAA,QACnD;AAEA,mBAAW,KAAK,QAAQ;AACtB,cAAI,KAAK,QAAQ,CAAC,GAAG;AACnB,gBAAI,CAAC,IAAI,OAAO,CAAC;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAIA,WAAO,QAAQ,gBAAgB,CAAC,WAAW;AAEzC,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AAC7C,eAAO,OAAO,CAAC,EAAE;AAAA,MACnB;AAGA,YAAM,SAAS,IAAI,WAAW,GAAG;AAEjC,eAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,IAAI,GAAG,KAAK;AACtD,YAAI,QAAQ,OAAO,CAAC;AACpB,eAAO,IAAI,OAAO,GAAG;AACrB,eAAO,MAAM;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/CA;AAAA;AAAA;AASA,QAAI,mBAAmB;AAEvB,QAAI;AAAE,aAAO,aAAa,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC;AAAA,IAAG,SAAS,IAAI;AAAE,yBAAmB;AAAA,IAAO;AAMnG,QAAM,WAAW,IAAI,WAAW,GAAG;AACnC,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,eAAS,CAAC,IAAK,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,IAC5F;AACA,aAAS,GAAG,IAAI,SAAS,GAAG,IAAI;AAIhC,WAAO,QAAQ,aAAa,CAAC,QAAQ;AACnC,UAAI,OAAO,gBAAgB,cAAc,YAAY,UAAU,QAAQ;AACrE,eAAO,IAAI,YAAY,EAAE,OAAO,GAAG;AAAA,MACrC;AAEA,UAAI,KAAK,GAAG,IAAI,OAAO,GAAG,UAAU,IAAI,QAAQ,UAAU;AAG1D,WAAK,QAAQ,GAAG,QAAQ,SAAS,SAAS;AACxC,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACF;AAAA,QACF;AACA,mBAAW,IAAI,MAAO,IAAI,IAAI,OAAQ,IAAI,IAAI,QAAU,IAAI;AAAA,MAC9D;AAGA,YAAM,IAAI,WAAW,OAAO;AAG5B,WAAK,IAAI,GAAG,QAAQ,GAAG,IAAI,SAAS,SAAS;AAC3C,YAAI,IAAI,WAAW,KAAK;AACxB,aAAK,IAAI,WAAY,SAAW,QAAQ,IAAI,SAAU;AACpD,eAAK,IAAI,WAAW,QAAQ,CAAC;AAC7B,eAAK,KAAK,WAAY,OAAQ;AAC5B,gBAAI,SAAY,IAAI,SAAW,OAAO,KAAK;AAC3C;AAAA,UACF;AAAA,QACF;AACA,YAAI,IAAI,KAAM;AAEZ,cAAI,GAAG,IAAI;AAAA,QACb,WAAW,IAAI,MAAO;AAEpB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB,WAAW,IAAI,OAAS;AAEtB,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB,OAAO;AAEL,cAAI,GAAG,IAAI,MAAQ,MAAM;AACzB,cAAI,GAAG,IAAI,MAAQ,MAAM,KAAK;AAC9B,cAAI,GAAG,IAAI,MAAQ,MAAM,IAAI;AAC7B,cAAI,GAAG,IAAI,MAAQ,IAAI;AAAA,QACzB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAGA,QAAM,gBAAgB,CAAC,KAAK,QAAQ;AAIlC,UAAI,MAAM,OAAO;AACf,YAAI,IAAI,YAAY,kBAAkB;AACpC,iBAAO,OAAO,aAAa,MAAM,MAAM,IAAI,WAAW,MAAM,MAAM,IAAI,SAAS,GAAG,GAAG,CAAC;AAAA,QACxF;AAAA,MACF;AAEA,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,kBAAU,OAAO,aAAa,IAAI,CAAC,CAAC;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AAIA,WAAO,QAAQ,aAAa,CAAC,KAAK,QAAQ;AACxC,YAAM,MAAM,OAAO,IAAI;AAEvB,UAAI,OAAO,gBAAgB,cAAc,YAAY,UAAU,QAAQ;AACrE,eAAO,IAAI,YAAY,EAAE,OAAO,IAAI,SAAS,GAAG,GAAG,CAAC;AAAA,MACtD;AAEA,UAAI,GAAG;AAKP,YAAM,WAAW,IAAI,MAAM,MAAM,CAAC;AAElC,WAAK,MAAM,GAAG,IAAI,GAAG,IAAI,OAAM;AAC7B,YAAI,IAAI,IAAI,GAAG;AAEf,YAAI,IAAI,KAAM;AAAE,mBAAS,KAAK,IAAI;AAAG;AAAA,QAAU;AAE/C,YAAI,QAAQ,SAAS,CAAC;AAEtB,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ,eAAK,QAAQ;AAAG;AAAA,QAAU;AAGrE,aAAK,UAAU,IAAI,KAAO,UAAU,IAAI,KAAO;AAE/C,eAAO,QAAQ,KAAK,IAAI,KAAK;AAC3B,cAAK,KAAK,IAAM,IAAI,GAAG,IAAI;AAC3B;AAAA,QACF;AAGA,YAAI,QAAQ,GAAG;AAAE,mBAAS,KAAK,IAAI;AAAQ;AAAA,QAAU;AAErD,YAAI,IAAI,OAAS;AACf,mBAAS,KAAK,IAAI;AAAA,QACpB,OAAO;AACL,eAAK;AACL,mBAAS,KAAK,IAAI,QAAW,KAAK,KAAM;AACxC,mBAAS,KAAK,IAAI,QAAU,IAAI;AAAA,QAClC;AAAA,MACF;AAEA,aAAO,cAAc,UAAU,GAAG;AAAA,IACpC;AASA,WAAO,QAAQ,aAAa,CAAC,KAAK,QAAQ;AAExC,YAAM,OAAO,IAAI;AACjB,UAAI,MAAM,IAAI,QAAQ;AAAE,cAAM,IAAI;AAAA,MAAQ;AAG1C,UAAI,MAAM,MAAM;AAChB,aAAO,OAAO,MAAM,IAAI,GAAG,IAAI,SAAU,KAAM;AAAE;AAAA,MAAO;AAIxD,UAAI,MAAM,GAAG;AAAE,eAAO;AAAA,MAAK;AAI3B,UAAI,QAAQ,GAAG;AAAE,eAAO;AAAA,MAAK;AAE7B,aAAQ,MAAM,SAAS,IAAI,GAAG,CAAC,IAAI,MAAO,MAAM;AAAA,IAClD;AAAA;AAAA;;;AC7KA;AAAA;AAAA;AAqBA,aAAS,UAAU;AAEjB,WAAK,QAAQ;AACb,WAAK,UAAU;AAEf,WAAK,WAAW;AAEhB,WAAK,WAAW;AAEhB,WAAK,SAAS;AACd,WAAK,WAAW;AAEhB,WAAK,YAAY;AAEjB,WAAK,YAAY;AAEjB,WAAK,MAAM;AAEX,WAAK,QAAQ;AAEb,WAAK,YAAY;AAEjB,WAAK,QAAQ;AAAA,IACf;AAEA,WAAO,UAAU;AAAA;AAAA;;;AC9CjB,IAAAC,mBAAA;AAAA;AAAA;AAGA,QAAM,eAAe;AACrB,QAAM,QAAe;AACrB,QAAM,UAAe;AACrB,QAAM,MAAe;AACrB,QAAM,UAAe;AAErB,QAAM,WAAW,OAAO,UAAU;AAKlC,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MAAc;AAAA,MAAc;AAAA,MACxC;AAAA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AAIJ,QAAM,iBAAiB;AAAA,MACrB,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,UAAU;AAAA,MACV,YAAY;AAAA,IACd;AA2FA,aAAS,QAAQ,SAAS;AACxB,WAAK,UAAU,MAAM,OAAO,CAAC,GAAG,gBAAgB,WAAW,CAAC,CAAC;AAE7D,UAAI,MAAM,KAAK;AAEf,UAAI,IAAI,OAAQ,IAAI,aAAa,GAAI;AACnC,YAAI,aAAa,CAAC,IAAI;AAAA,MACxB,WAES,IAAI,QAAS,IAAI,aAAa,KAAO,IAAI,aAAa,IAAK;AAClE,YAAI,cAAc;AAAA,MACpB;AAEA,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS,CAAC;AAEf,WAAK,OAAO,IAAI,QAAQ;AACxB,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAS,aAAa;AAAA,QACxB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,MACN;AAEA,UAAI,WAAW,MAAM;AACnB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC7B;AAEA,UAAI,IAAI,QAAQ;AACd,qBAAa,iBAAiB,KAAK,MAAM,IAAI,MAAM;AAAA,MACrD;AAEA,UAAI,IAAI,YAAY;AAClB,YAAI;AAEJ,YAAI,OAAO,IAAI,eAAe,UAAU;AAEtC,iBAAO,QAAQ,WAAW,IAAI,UAAU;AAAA,QAC1C,WAAW,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,iBAAO,IAAI,WAAW,IAAI,UAAU;AAAA,QACtC,OAAO;AACL,iBAAO,IAAI;AAAA,QACb;AAEA,iBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI;AAE1D,YAAI,WAAW,MAAM;AACnB,gBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,QAC7B;AAEA,aAAK,YAAY;AAAA,MACnB;AAAA,IACF;AAwBA,YAAQ,UAAU,OAAO,SAAU,MAAM,YAAY;AACnD,YAAM,OAAO,KAAK;AAClB,YAAM,YAAY,KAAK,QAAQ;AAC/B,UAAI,QAAQ;AAEZ,UAAI,KAAK,OAAO;AAAE,eAAO;AAAA,MAAO;AAEhC,UAAI,eAAe,CAAC,CAAC,WAAY,eAAc;AAAA,UAC1C,eAAc,eAAe,OAAO,WAAW;AAGpD,UAAI,OAAO,SAAS,UAAU;AAE5B,aAAK,QAAQ,QAAQ,WAAW,IAAI;AAAA,MACtC,WAAW,SAAS,KAAK,IAAI,MAAM,wBAAwB;AACzD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MAClC,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAEA,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,iBAAS;AACP,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,WAAW,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACnB;AAGA,aAAK,gBAAgB,gBAAgB,gBAAgB,iBAAiB,KAAK,aAAa,GAAG;AACzF,eAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAClD,eAAK,YAAY;AACjB;AAAA,QACF;AAEA,iBAAS,aAAa,QAAQ,MAAM,WAAW;AAG/C,YAAI,WAAW,cAAc;AAC3B,cAAI,KAAK,WAAW,GAAG;AACrB,iBAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAAA,UACpD;AACA,mBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO,WAAW;AAAA,QACpB;AAGA,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,OAAO,KAAK,MAAM;AACvB;AAAA,QACF;AAGA,YAAI,cAAc,KAAK,KAAK,WAAW,GAAG;AACxC,eAAK,OAAO,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAClD,eAAK,YAAY;AACjB;AAAA,QACF;AAEA,YAAI,KAAK,aAAa,EAAG;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAUA,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACxB;AAYA,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,MAAM;AACnB,aAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,MAC/C;AACA,WAAK,SAAS,CAAC;AACf,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACvB;AAmCA,aAAS,QAAQ,OAAO,SAAS;AAC/B,YAAM,WAAW,IAAI,QAAQ,OAAO;AAEpC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,KAAK;AAAE,cAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAAA,MAAG;AAE7D,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAC;AACtB,cAAQ,MAAM;AACd,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAWA,aAAS,KAAK,OAAO,SAAS;AAC5B,gBAAU,WAAW,CAAC;AACtB,cAAQ,OAAO;AACf,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAGA,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,OAAO;AACtB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;AClY3B;AAAA;AAAA;AAsBA,QAAM,MAAM;AACZ,QAAM,OAAO;AAqCb,WAAO,UAAU,SAAS,aAAa,MAAM,OAAO;AAClD,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,OAAO;AAGX,YAAM,QAAQ,KAAK;AAEnB,YAAM,KAAK;AACX,cAAQ,KAAK;AACb,aAAO,OAAO,KAAK,WAAW;AAC9B,aAAO,KAAK;AACZ,eAAS,KAAK;AACd,YAAM,QAAQ,QAAQ,KAAK;AAC3B,YAAM,QAAQ,KAAK,YAAY;AAE/B,aAAO,MAAM;AAEb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,iBAAW,MAAM;AACjB,aAAO,MAAM;AACb,aAAO,MAAM;AACb,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,eAAS,KAAK,MAAM,WAAW;AAC/B,eAAS,KAAK,MAAM,YAAY;AAMhC;AACA,WAAG;AACD,cAAI,OAAO,IAAI;AACb,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AACR,oBAAQ,MAAM,KAAK,KAAK;AACxB,oBAAQ;AAAA,UACV;AAEA,iBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,uBAAS;AACP,mBAAK,SAAS;AACd,wBAAU;AACV,sBAAQ;AACR,mBAAM,SAAS,KAAM;AACrB,kBAAI,OAAO,GAAG;AAIZ,uBAAO,MAAM,IAAI,OAAO;AAAA,cAC1B,WACS,KAAK,IAAI;AAChB,sBAAM,OAAO;AACb,sBAAM;AACN,oBAAI,IAAI;AACN,sBAAI,OAAO,IAAI;AACb,4BAAQ,MAAM,KAAK,KAAK;AACxB,4BAAQ;AAAA,kBACV;AACA,yBAAO,QAAS,KAAK,MAAM;AAC3B,4BAAU;AACV,0BAAQ;AAAA,gBACV;AAEA,oBAAI,OAAO,IAAI;AACb,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AACR,0BAAQ,MAAM,KAAK,KAAK;AACxB,0BAAQ;AAAA,gBACV;AACA,uBAAO,MAAM,OAAO,KAAK;AAEzB;AACA,6BAAS;AACP,yBAAK,SAAS;AACd,8BAAU;AACV,4BAAQ;AACR,yBAAM,SAAS,KAAM;AAErB,wBAAI,KAAK,IAAI;AACX,6BAAO,OAAO;AACd,4BAAM;AACN,0BAAI,OAAO,IAAI;AACb,gCAAQ,MAAM,KAAK,KAAK;AACxB,gCAAQ;AACR,4BAAI,OAAO,IAAI;AACb,kCAAQ,MAAM,KAAK,KAAK;AACxB,kCAAQ;AAAA,wBACV;AAAA,sBACF;AACA,8BAAQ,QAAS,KAAK,MAAM;AAE5B,0BAAI,OAAO,MAAM;AACf,6BAAK,MAAM;AACX,8BAAM,OAAO;AACb,8BAAM;AAAA,sBACR;AAEA,gCAAU;AACV,8BAAQ;AAER,2BAAK,OAAO;AACZ,0BAAI,OAAO,IAAI;AACb,6BAAK,OAAO;AACZ,4BAAI,KAAK,OAAO;AACd,8BAAI,MAAM,MAAM;AACd,iCAAK,MAAM;AACX,kCAAM,OAAO;AACb,kCAAM;AAAA,0BACR;AAAA,wBAuBF;AACA,+BAAO;AACP,sCAAc;AACd,4BAAI,UAAU,GAAG;AACf,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChB;AAAA,wBACF,WACS,QAAQ,IAAI;AACnB,kCAAQ,QAAQ,QAAQ;AACxB,gCAAM;AACN,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO;AACP,gCAAI,QAAQ,KAAK;AACf,mCAAK;AACL,qCAAO;AACP,iCAAG;AACD,uCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,8BAClC,SAAS,EAAE;AACX,qCAAO,OAAO;AACd,4CAAc;AAAA,4BAChB;AAAA,0BACF;AAAA,wBACF,OACK;AACH,kCAAQ,QAAQ;AAChB,8BAAI,KAAK,KAAK;AACZ,mCAAO;AACP,+BAAG;AACD,qCAAO,MAAM,IAAI,SAAS,MAAM;AAAA,4BAClC,SAAS,EAAE;AACX,mCAAO,OAAO;AACd,0CAAc;AAAA,0BAChB;AAAA,wBACF;AACA,+BAAO,MAAM,GAAG;AACd,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,iCAAO;AAAA,wBACT;AACA,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,YAAY,MAAM;AACnC,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,YAAY,MAAM;AAAA,0BACrC;AAAA,wBACF;AAAA,sBACF,OACK;AACH,+BAAO,OAAO;AACd,2BAAG;AACD,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,iCAAO;AAAA,wBACT,SAAS,MAAM;AACf,4BAAI,KAAK;AACP,iCAAO,MAAM,IAAI,OAAO,MAAM;AAC9B,8BAAI,MAAM,GAAG;AACX,mCAAO,MAAM,IAAI,OAAO,MAAM;AAAA,0BAChC;AAAA,wBACF;AAAA,sBACF;AAAA,oBACF,YACU,KAAK,QAAQ,GAAG;AACxB,6BAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,+BAAS;AAAA,oBACX,OACK;AACH,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb,4BAAM;AAAA,oBACR;AAEA;AAAA,kBACF;AAAA,cACF,YACU,KAAK,QAAQ,GAAG;AACxB,uBAAO,OAAO,OAAO,UAAuB,QAAS,KAAK,MAAM,EAAG;AACnE,yBAAS;AAAA,cACX,WACS,KAAK,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM;AAAA,cACR,OACK;AACH,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb,sBAAM;AAAA,cACR;AAEA;AAAA,YACF;AAAA,QACF,SAAS,MAAM,QAAQ,OAAO;AAG9B,YAAM,QAAQ;AACd,aAAO;AACP,cAAQ,OAAO;AACf,eAAS,KAAK,QAAQ;AAGtB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,WAAY,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM;AAC5D,WAAK,YAAa,OAAO,MAAM,OAAO,MAAM,QAAQ,OAAO,OAAO;AAClE,YAAM,OAAO;AACb,YAAM,OAAO;AACb;AAAA,IACF;AAAA;AAAA;;;ACvVA;AAAA;AAAA;AAqBA,QAAM,UAAU;AAChB,QAAM,cAAc;AACpB,QAAM,eAAe;AAGrB,QAAM,QAAQ;AACd,QAAM,OAAO;AACb,QAAM,QAAQ;AAEd,QAAM,QAAQ,IAAI,YAAY;AAAA;AAAA,MAC5B;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACrD;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAG;AAAA,IAC/D,CAAC;AAED,QAAM,OAAO,IAAI,WAAW;AAAA;AAAA,MAC1B;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,IAC3D,CAAC;AAED,QAAM,QAAQ,IAAI,YAAY;AAAA;AAAA,MAC5B;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAG;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAK;AAAA,MACtD;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAK;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAClD;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAG;AAAA,IAChC,CAAC;AAED,QAAM,OAAO,IAAI,WAAW;AAAA;AAAA,MAC1B;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAC5D;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MACpC;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,MAAI;AAAA,IACtB,CAAC;AAED,QAAM,gBAAgB,CAAC,MAAM,MAAM,YAAY,OAAO,OAAO,aAAa,MAAM,SAChF;AACE,YAAM,OAAO,KAAK;AAGlB,UAAI,MAAM;AACV,UAAI,MAAM;AACV,UAAI,MAAM,GAAG,MAAM;AACnB,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AAEX,UAAI;AACJ,YAAM,QAAQ,IAAI,YAAY,UAAU,CAAC;AACzC,YAAM,OAAO,IAAI,YAAY,UAAU,CAAC;AACxC,UAAI,QAAQ;AAEZ,UAAI,WAAW,SAAS;AAkCxB,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,cAAM,GAAG,IAAI;AAAA,MACf;AACA,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,cAAM,KAAK,aAAa,GAAG,CAAC;AAAA,MAC9B;AAGA,aAAO;AACP,WAAK,MAAM,SAAS,OAAO,GAAG,OAAO;AACnC,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAO;AAAA,MACjC;AACA,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACT;AACA,UAAI,QAAQ,GAAG;AAIb,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAMhD,cAAM,aAAa,IAAK,KAAK,KAAO,MAAM,KAAM;AAEhD,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AACA,WAAK,MAAM,GAAG,MAAM,KAAK,OAAO;AAC9B,YAAI,MAAM,GAAG,MAAM,GAAG;AAAE;AAAA,QAAO;AAAA,MACjC;AACA,UAAI,OAAO,KAAK;AACd,eAAO;AAAA,MACT;AAGA,aAAO;AACP,WAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,iBAAS;AACT,gBAAQ,MAAM,GAAG;AACjB,YAAI,OAAO,GAAG;AACZ,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UAAI,OAAO,MAAM,SAAS,SAAS,QAAQ,IAAI;AAC7C,eAAO;AAAA,MACT;AAGA,WAAK,CAAC,IAAI;AACV,WAAK,MAAM,GAAG,MAAM,SAAS,OAAO;AAClC,aAAK,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,MAAM,GAAG;AAAA,MACvC;AAGA,WAAK,MAAM,GAAG,MAAM,OAAO,OAAO;AAChC,YAAI,KAAK,aAAa,GAAG,MAAM,GAAG;AAChC,eAAK,KAAK,KAAK,aAAa,GAAG,CAAC,GAAG,IAAI;AAAA,QACzC;AAAA,MACF;AAoCA,UAAI,SAAS,OAAO;AAClB,eAAO,QAAQ;AACf,gBAAQ;AAAA,MAEV,WAAW,SAAS,MAAM;AACxB,eAAO;AACP,gBAAQ;AACR,gBAAQ;AAAA,MAEV,OAAO;AACL,eAAO;AACP,gBAAQ;AACR,gBAAQ;AAAA,MACV;AAGA,aAAO;AACP,YAAM;AACN,YAAM;AACN,aAAO;AACP,aAAO;AACP,aAAO;AACP,YAAM;AACN,aAAO,KAAK;AACZ,aAAO,OAAO;AAGd,UAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,eAAO;AAAA,MACT;AAGA,iBAAS;AAEP,oBAAY,MAAM;AAClB,YAAI,KAAK,GAAG,IAAI,IAAI,OAAO;AACzB,oBAAU;AACV,qBAAW,KAAK,GAAG;AAAA,QACrB,WACS,KAAK,GAAG,KAAK,OAAO;AAC3B,oBAAU,MAAM,KAAK,GAAG,IAAI,KAAK;AACjC,qBAAW,KAAK,KAAK,GAAG,IAAI,KAAK;AAAA,QACnC,OACK;AACH,oBAAU,KAAK;AACf,qBAAW;AAAA,QACb;AAGA,eAAO,KAAM,MAAM;AACnB,eAAO,KAAK;AACZ,cAAM;AACN,WAAG;AACD,kBAAQ;AACR,gBAAM,QAAQ,QAAQ,QAAQ,IAAI,IAAK,aAAa,KAAO,WAAW,KAAM,WAAU;AAAA,QACxF,SAAS,SAAS;AAGlB,eAAO,KAAM,MAAM;AACnB,eAAO,OAAO,MAAM;AAClB,mBAAS;AAAA,QACX;AACA,YAAI,SAAS,GAAG;AACd,kBAAQ,OAAO;AACf,kBAAQ;AAAA,QACV,OAAO;AACL,iBAAO;AAAA,QACT;AAGA;AACA,YAAI,EAAE,MAAM,GAAG,MAAM,GAAG;AACtB,cAAI,QAAQ,KAAK;AAAE;AAAA,UAAO;AAC1B,gBAAM,KAAK,aAAa,KAAK,GAAG,CAAC;AAAA,QACnC;AAGA,YAAI,MAAM,SAAS,OAAO,UAAU,KAAK;AAEvC,cAAI,SAAS,GAAG;AACd,mBAAO;AAAA,UACT;AAGA,kBAAQ;AAGR,iBAAO,MAAM;AACb,iBAAO,KAAK;AACZ,iBAAO,OAAO,OAAO,KAAK;AACxB,oBAAQ,MAAM,OAAO,IAAI;AACzB,gBAAI,QAAQ,GAAG;AAAE;AAAA,YAAO;AACxB;AACA,qBAAS;AAAA,UACX;AAGA,kBAAQ,KAAK;AACb,cAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,cAAe;AACzC,mBAAO;AAAA,UACT;AAGA,gBAAM,OAAO;AAIb,gBAAM,GAAG,IAAK,QAAQ,KAAO,QAAQ,KAAO,OAAO,cAAc;AAAA,QACnE;AAAA,MACF;AAKA,UAAI,SAAS,GAAG;AAId,cAAM,OAAO,IAAI,IAAM,MAAM,QAAS,KAAO,MAAM,KAAK;AAAA,MAC1D;AAIA,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAGA,WAAO,UAAU;AAAA;AAAA;;;ACnVjB;AAAA;AAAA;AAqBA,QAAM,UAAgB;AACtB,QAAMC,SAAgB;AACtB,QAAM,eAAgB;AACtB,QAAM,gBAAgB;AAEtB,QAAM,QAAQ;AACd,QAAM,OAAO;AACb,QAAM,QAAQ;AAKd,QAAM;AAAA,MACJ;AAAA,MAAU;AAAA,MAAS;AAAA,MACnB;AAAA,MAAM;AAAA,MAAc;AAAA,MAAa;AAAA,MAAgB;AAAA,MAAc;AAAA,MAAa;AAAA,MAC5E;AAAA,IACF,IAAI;AAOJ,QAAS,OAAO;AAChB,QAAS,QAAQ;AACjB,QAAS,OAAO;AAChB,QAAS,KAAK;AACd,QAAS,QAAQ;AACjB,QAAS,QAAQ;AACjB,QAAS,OAAO;AAChB,QAAS,UAAU;AACnB,QAAS,OAAO;AAChB,QAAS,SAAS;AAClB,QAAS,OAAO;AAChB,QAAa,OAAO;AACpB,QAAa,SAAS;AACtB,QAAa,SAAS;AACtB,QAAa,QAAQ;AACrB,QAAa,OAAO;AACpB,QAAa,QAAQ;AACrB,QAAa,UAAU;AACvB,QAAa,WAAW;AACxB,QAAiB,OAAO;AACxB,QAAiB,MAAM;AACvB,QAAiB,SAAS;AAC1B,QAAiB,OAAO;AACxB,QAAiB,UAAU;AAC3B,QAAiB,QAAQ;AACzB,QAAiB,MAAM;AACvB,QAAS,QAAQ;AACjB,QAAS,SAAS;AAClB,QAAS,OAAO;AAChB,QAAS,MAAM;AACf,QAAS,MAAM;AACf,QAAS,OAAO;AAMhB,QAAM,cAAc;AACpB,QAAM,eAAe;AAGrB,QAAM,YAAY;AAElB,QAAM,YAAY;AAGlB,QAAM,UAAU,CAAC,MAAM;AAErB,cAAW,MAAM,KAAM,QACb,MAAM,IAAK,WACX,IAAI,UAAW,OACf,IAAI,QAAS;AAAA,IACzB;AAGA,aAAS,eAAe;AACtB,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,OAAO;AAEZ,WAAK,WAAW;AAChB,WAAK,QAAQ;AAEb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AAEb,WAAK,OAAO;AAGZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,SAAS;AAGd,WAAK,OAAO;AACZ,WAAK,OAAO;AAGZ,WAAK,SAAS;AACd,WAAK,SAAS;AAGd,WAAK,QAAQ;AAGb,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,WAAW;AAGhB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,OAAO;AAEZ,WAAK,OAAO,IAAI,YAAY,GAAG;AAC/B,WAAK,OAAO,IAAI,YAAY,GAAG;AAO/B,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,MAAM;AAAA,IACb;AAGA,QAAM,oBAAoB,CAAC,SAAS;AAElC,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AACA,YAAM,QAAQ,KAAK;AACnB,UAAI,CAAC,SAAS,MAAM,SAAS,QAC3B,MAAM,OAAO,QAAQ,MAAM,OAAO,MAAM;AACxC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,SAAS;AAEjC,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,WAAK,WAAW,KAAK,YAAY,MAAM,QAAQ;AAC/C,WAAK,MAAM;AACX,UAAI,MAAM,MAAM;AACd,aAAK,QAAQ,MAAM,OAAO;AAAA,MAC5B;AACA,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,WAAW;AACjB,YAAM,QAAQ;AACd,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,YAAM,UAAU,MAAM,SAAS,IAAI,WAAW,WAAW;AACzD,YAAM,WAAW,MAAM,UAAU,IAAI,WAAW,YAAY;AAE5D,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,aAAO;AAAA,IACT;AAGA,QAAM,eAAe,CAAC,SAAS;AAE7B,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,YAAM,QAAQ;AACd,aAAO,iBAAiB,IAAI;AAAA,IAE9B;AAGA,QAAM,gBAAgB,CAAC,MAAM,eAAe;AAC1C,UAAI;AAGJ,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AAGnB,UAAI,aAAa,GAAG;AAClB,eAAO;AACP,qBAAa,CAAC;AAAA,MAChB,OACK;AACH,gBAAQ,cAAc,KAAK;AAC3B,YAAI,aAAa,IAAI;AACnB,wBAAc;AAAA,QAChB;AAAA,MACF;AAGA,UAAI,eAAe,aAAa,KAAK,aAAa,KAAK;AACrD,eAAO;AAAA,MACT;AACA,UAAI,MAAM,WAAW,QAAQ,MAAM,UAAU,YAAY;AACvD,cAAM,SAAS;AAAA,MACjB;AAGA,YAAM,OAAO;AACb,YAAM,QAAQ;AACd,aAAO,aAAa,IAAI;AAAA,IAC1B;AAGA,QAAM,eAAe,CAAC,MAAM,eAAe;AAEzC,UAAI,CAAC,MAAM;AAAE,eAAO;AAAA,MAAgB;AAGpC,YAAM,QAAQ,IAAI,aAAa;AAI/B,WAAK,QAAQ;AACb,YAAM,OAAO;AACb,YAAM,SAAS;AACf,YAAM,OAAO;AACb,YAAM,MAAM,cAAc,MAAM,UAAU;AAC1C,UAAI,QAAQ,MAAM;AAChB,aAAK,QAAQ;AAAA,MACf;AACA,aAAO;AAAA,IACT;AAGA,QAAM,cAAc,CAAC,SAAS;AAE5B,aAAO,aAAa,MAAM,SAAS;AAAA,IACrC;AAaA,QAAI,SAAS;AAEb,QAAI;AAAJ,QAAY;AAGZ,QAAM,cAAc,CAAC,UAAU;AAG7B,UAAI,QAAQ;AACV,iBAAS,IAAI,WAAW,GAAG;AAC3B,kBAAU,IAAI,WAAW,EAAE;AAG3B,YAAI,MAAM;AACV,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAC3C,eAAO,MAAM,KAAK;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAE3C,sBAAc,MAAO,MAAM,MAAM,GAAG,KAAK,QAAU,GAAG,MAAM,MAAM,EAAE,MAAM,EAAE,CAAC;AAG7E,cAAM;AACN,eAAO,MAAM,IAAI;AAAE,gBAAM,KAAK,KAAK,IAAI;AAAA,QAAG;AAE1C,sBAAc,OAAO,MAAM,MAAM,GAAG,IAAM,SAAS,GAAG,MAAM,MAAM,EAAE,MAAM,EAAE,CAAC;AAG7E,iBAAS;AAAA,MACX;AAEA,YAAM,UAAU;AAChB,YAAM,UAAU;AAChB,YAAM,WAAW;AACjB,YAAM,WAAW;AAAA,IACnB;AAiBA,QAAM,eAAe,CAAC,MAAM,KAAK,KAAK,SAAS;AAE7C,UAAI;AACJ,YAAM,QAAQ,KAAK;AAGnB,UAAI,MAAM,WAAW,MAAM;AACzB,cAAM,SAAS,IAAI,WAAW,KAAK,MAAM,KAAK;AAAA,MAChD;AAGA,UAAI,MAAM,UAAU,GAAG;AACrB,cAAM,QAAQ,KAAK,MAAM;AACzB,cAAM,QAAQ;AACd,cAAM,QAAQ;AAAA,MAChB;AAGA,UAAI,QAAQ,MAAM,OAAO;AACvB,cAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC;AACxD,cAAM,QAAQ;AACd,cAAM,QAAQ,MAAM;AAAA,MACtB,OACK;AACH,eAAO,MAAM,QAAQ,MAAM;AAC3B,YAAI,OAAO,MAAM;AACf,iBAAO;AAAA,QACT;AAEA,cAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,MAAM,OAAO,IAAI,GAAG,MAAM,KAAK;AACzE,gBAAQ;AACR,YAAI,MAAM;AAER,gBAAM,OAAO,IAAI,IAAI,SAAS,MAAM,MAAM,GAAG,GAAG,CAAC;AACjD,gBAAM,QAAQ;AACd,gBAAM,QAAQ,MAAM;AAAA,QACtB,OACK;AACH,gBAAM,SAAS;AACf,cAAI,MAAM,UAAU,MAAM,OAAO;AAAE,kBAAM,QAAQ;AAAA,UAAG;AACpD,cAAI,MAAM,QAAQ,MAAM,OAAO;AAAE,kBAAM,SAAS;AAAA,UAAM;AAAA,QACxD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,QAAM,UAAU,CAAC,MAAM,UAAU;AAE/B,UAAI;AACJ,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM;AACV,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK;AACT,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO;AACX,UAAI,WAAW,SAAS;AAExB,UAAI,WAAW,SAAS;AACxB,UAAI;AACJ,UAAI;AACJ,YAAM,OAAO,IAAI,WAAW,CAAC;AAC7B,UAAI;AAEJ,UAAI;AAEJ,YAAM;AAAA;AAAA,QACJ,IAAI,WAAW,CAAE,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAG,CAAC;AAAA;AAGrF,UAAI,kBAAkB,IAAI,KAAK,CAAC,KAAK,UAChC,CAAC,KAAK,SAAS,KAAK,aAAa,GAAI;AACxC,eAAO;AAAA,MACT;AAEA,cAAQ,KAAK;AACb,UAAI,MAAM,SAAS,MAAM;AAAE,cAAM,OAAO;AAAA,MAAQ;AAIhD,YAAM,KAAK;AACX,eAAS,KAAK;AACd,aAAO,KAAK;AACZ,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,aAAO,KAAK;AACZ,aAAO,MAAM;AACb,aAAO,MAAM;AAGb,YAAM;AACN,aAAO;AACP,YAAM;AAEN;AACA,mBAAS;AACP,kBAAQ,MAAM,MAAM;AAAA,YAClB,KAAK;AACH,kBAAI,MAAM,SAAS,GAAG;AACpB,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAK,MAAM,OAAO,KAAM,SAAS,OAAQ;AACvC,oBAAI,MAAM,UAAU,GAAG;AACrB,wBAAM,QAAQ;AAAA,gBAChB;AACA,sBAAM,QAAQ;AAEd,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAI3C,uBAAO;AACP,uBAAO;AAEP,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,kBAAI,EAAE,MAAM,OAAO;AAAA,iBACd,OAAO,QAAoB,MAAM,QAAQ,MAAM,IAAI;AACtD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,mBAAK,OAAO,QAAqB,YAAY;AAC3C,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,wBAAU;AACV,sBAAQ;AAER,qBAAO,OAAO,MAAmB;AACjC,kBAAI,MAAM,UAAU,GAAG;AACrB,sBAAM,QAAQ;AAAA,cAChB;AACA,kBAAI,MAAM,MAAM,MAAM,MAAM,OAAO;AACjC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAIA,oBAAM,OAAO,KAAK,MAAM;AAGxB,oBAAM,QAAQ;AAEd,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO,OAAO,MAAQ,SAAS;AAErC,qBAAO;AACP,qBAAO;AAEP;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,QAAQ;AACd,mBAAK,MAAM,QAAQ,SAAU,YAAY;AACvC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,QAAQ,OAAQ;AACxB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,QAAQ,IAAK;AAAA,cACnC;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,qBAAK,CAAC,IAAK,SAAS,KAAM;AAC1B,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,SAAU,OAAO;AAC5B,sBAAM,KAAK,KAAM,QAAQ;AAAA,cAC3B;AACA,kBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,qBAAK,CAAC,IAAI,OAAO;AACjB,qBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,sBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,cAE7C;AAEA,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,SAAS;AACf,oBAAI,MAAM,MAAM;AACd,wBAAM,KAAK,YAAY;AAAA,gBACzB;AACA,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAE9C,uBAAK,CAAC,IAAI,OAAO;AACjB,uBAAK,CAAC,IAAK,SAAS,IAAK;AACzB,wBAAM,QAAQA,OAAM,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,gBAE7C;AAEA,uBAAO;AACP,uBAAO;AAAA,cAET,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,QAAQ;AAAA,cACrB;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,uBAAO,MAAM;AACb,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,MAAM;AACR,sBAAI,MAAM,MAAM;AACd,0BAAM,MAAM,KAAK,YAAY,MAAM;AACnC,wBAAI,CAAC,MAAM,KAAK,OAAO;AAErB,4BAAM,KAAK,QAAQ,IAAI,WAAW,MAAM,KAAK,SAAS;AAAA,oBACxD;AACA,0BAAM,KAAK,MAAM;AAAA,sBACf,MAAM;AAAA,wBACJ;AAAA;AAAA;AAAA,wBAGA,OAAO;AAAA,sBACT;AAAA;AAAA,sBAEA;AAAA,oBACF;AAAA,kBAIF;AACA,sBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,0BAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,kBACpD;AACA,0BAAQ;AACR,0BAAQ;AACR,wBAAM,UAAU;AAAA,gBAClB;AACA,oBAAI,MAAM,QAAQ;AAAE,wBAAM;AAAA,gBAAW;AAAA,cACvC;AACA,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC,uBAAO;AACP,mBAAG;AAED,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,QAAQ,OAAO,aAAa,GAAG;AAAA,kBAC5C;AAAA,gBACF,SAAS,OAAO,OAAO;AAEvB,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBACpD;AACA,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAW;AAAA,cAC9B,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,oBAAM,SAAS;AACf,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAQ;AACxB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC,uBAAO;AACP,mBAAG;AACD,wBAAM,MAAM,OAAO,MAAM;AAEzB,sBAAI,MAAM,QAAQ,OACb,MAAM,SAAS,OAAgC;AAClD,0BAAM,KAAK,WAAW,OAAO,aAAa,GAAG;AAAA,kBAC/C;AAAA,gBACF,SAAS,OAAO,OAAO;AACvB,oBAAK,MAAM,QAAQ,OAAY,MAAM,OAAO,GAAI;AAC9C,wBAAM,QAAQA,OAAM,MAAM,OAAO,OAAO,MAAM,IAAI;AAAA,gBACpD;AACA,wBAAQ;AACR,wBAAQ;AACR,oBAAI,KAAK;AAAE,wBAAM;AAAA,gBAAW;AAAA,cAC9B,WACS,MAAM,MAAM;AACnB,sBAAM,KAAK,UAAU;AAAA,cACvB;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,KAAQ;AAExB,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,oBAAK,MAAM,OAAO,KAAM,UAAU,MAAM,QAAQ,QAAS;AACvD,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAET;AACA,kBAAI,MAAM,MAAM;AACd,sBAAM,KAAK,OAAS,MAAM,SAAS,IAAK;AACxC,sBAAM,KAAK,OAAO;AAAA,cACpB;AACA,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,mBAAK,QAAQ,MAAM,QAAQ,QAAQ,IAAI;AAEvC,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,aAAa,GAAG;AAExB,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,uBAAO;AAAA,cACT;AACA,mBAAK,QAAQ,MAAM,QAAQ;AAC3B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,UAAU,WAAW,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAEjE,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,0BAAU,OAAO;AACjB,wBAAQ,OAAO;AAEf,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,qBAAO,OAAO,GAAG;AACf,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,OAAQ,OAAO;AAErB,wBAAU;AACV,sBAAQ;AAGR,sBAAS,OAAO,GAAkB;AAAA,gBAChC,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,8BAAY,KAAK;AAGjB,wBAAM,OAAO;AACb,sBAAI,UAAU,SAAS;AAErB,8BAAU;AACV,4BAAQ;AAER,0BAAM;AAAA,kBACR;AACA;AAAA,gBACF,KAAK;AAGH,wBAAM,OAAO;AACb;AAAA,gBACF,KAAK;AACH,uBAAK,MAAM;AACX,wBAAM,OAAO;AAAA,cACjB;AAEA,wBAAU;AACV,sBAAQ;AAER;AAAA,YACF,KAAK;AAEH,wBAAU,OAAO;AACjB,sBAAQ,OAAO;AAGf,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,mBAAK,OAAO,YAAc,SAAS,KAAM,QAAS;AAChD,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,SAAS,OAAO;AAItB,qBAAO;AACP,qBAAO;AAEP,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAE5C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM;AACb,kBAAI,MAAM;AACR,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,OAAO,MAAM;AAAE,yBAAO;AAAA,gBAAM;AAChC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AAEnC,uBAAO,IAAI,MAAM,SAAS,MAAM,OAAO,IAAI,GAAG,GAAG;AAEjD,wBAAQ;AACR,wBAAQ;AACR,wBAAQ;AACR,uBAAO;AACP,sBAAM,UAAU;AAChB;AAAA,cACF;AAEA,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AAEH,qBAAO,OAAO,IAAI;AAChB,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cACV;AAEA,oBAAM,QAAQ,OAAO,MAAmB;AAExC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAER,oBAAM,SAAS,OAAO,MAAmB;AAEzC,wBAAU;AACV,sBAAQ;AAGR,kBAAI,MAAM,OAAO,OAAO,MAAM,QAAQ,IAAI;AACxC,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAGA,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO;AAE/B,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAK,OAAO;AAE1C,0BAAU;AACV,wBAAQ;AAAA,cAEV;AACA,qBAAO,MAAM,OAAO,IAAI;AACtB,sBAAM,KAAK,MAAM,MAAM,MAAM,CAAC,IAAI;AAAA,cACpC;AAKA,oBAAM,UAAU,MAAM;AACtB,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAQ;AAC7B,oBAAM,cAAc,OAAO,MAAM,MAAM,GAAG,IAAI,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAChF,oBAAM,UAAU,KAAK;AAErB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,OAAO;AACb,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,qBAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC5C,2BAAS;AACP,yBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,aAAc,MAAM;AAAE;AAAA,kBAAO;AAElC,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AACA,oBAAI,WAAW,IAAI;AAEjB,4BAAU;AACV,0BAAQ;AAER,wBAAM,KAAK,MAAM,MAAM,IAAI;AAAA,gBAC7B,OACK;AACH,sBAAI,aAAa,IAAI;AAEnB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,wBAAI,MAAM,SAAS,GAAG;AACpB,2BAAK,MAAM;AACX,4BAAM,OAAO;AACb;AAAA,oBACF;AACA,0BAAM,MAAM,KAAK,MAAM,OAAO,CAAC;AAC/B,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEV,WACS,aAAa,IAAI;AAExB,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,KAAK,OAAO;AAEnB,8BAAU;AACV,4BAAQ;AAAA,kBAEV,OACK;AAEH,wBAAI,YAAY;AAChB,2BAAO,OAAO,GAAG;AACf,0BAAI,SAAS,GAAG;AAAE,8BAAM;AAAA,sBAAW;AACnC;AACA,8BAAQ,MAAM,MAAM,KAAK;AACzB,8BAAQ;AAAA,oBACV;AAGA,8BAAU;AACV,4BAAQ;AAER,0BAAM;AACN,2BAAO,MAAM,OAAO;AAEpB,8BAAU;AACV,4BAAQ;AAAA,kBAEV;AACA,sBAAI,MAAM,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO;AAChD,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACF;AACA,yBAAO,QAAQ;AACb,0BAAM,KAAK,MAAM,MAAM,IAAI;AAAA,kBAC7B;AAAA,gBACF;AAAA,cACF;AAGA,kBAAI,MAAM,SAAS,KAAK;AAAE;AAAA,cAAO;AAGjC,kBAAI,MAAM,KAAK,GAAG,MAAM,GAAG;AACzB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAKA,oBAAM,UAAU;AAEhB,qBAAO,EAAE,MAAM,MAAM,QAAQ;AAC7B,oBAAM,cAAc,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM,MAAM,SAAS,GAAG,MAAM,MAAM,IAAI;AAGvF,oBAAM,UAAU,KAAK;AAGrB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,WAAW;AAGjB,oBAAM,WAAW,MAAM;AACvB,qBAAO,EAAE,MAAM,MAAM,SAAS;AAC9B,oBAAM,cAAc,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,UAAU,GAAG,MAAM,MAAM,IAAI;AAGnG,oBAAM,WAAW,KAAK;AAGtB,kBAAI,KAAK;AACP,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAEA,oBAAM,OAAO;AACb,kBAAI,UAAU,SAAS;AAAE,sBAAM;AAAA,cAAW;AAAA;AAAA,YAE5C,KAAK;AACH,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,QAAQ,KAAK,QAAQ,KAAK;AAE5B,qBAAK,WAAW;AAChB,qBAAK,YAAY;AACjB,qBAAK,UAAU;AACf,qBAAK,WAAW;AAChB,sBAAM,OAAO;AACb,sBAAM,OAAO;AAEb,6BAAa,MAAM,IAAI;AAEvB,sBAAM,KAAK;AACX,yBAAS,KAAK;AACd,uBAAO,KAAK;AACZ,uBAAO,KAAK;AACZ,wBAAQ,KAAK;AACb,uBAAO,KAAK;AACZ,uBAAO,MAAM;AACb,uBAAO,MAAM;AAGb,oBAAI,MAAM,SAAS,MAAM;AACvB,wBAAM,OAAO;AAAA,gBACf;AACA;AAAA,cACF;AACA,oBAAM,OAAO;AACb,yBAAS;AACP,uBAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW,CAAE;AACtD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAI,aAAa,MAAM;AAAE;AAAA,gBAAO;AAEhC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAEV;AACA,kBAAI,YAAY,UAAU,SAAU,GAAG;AACrC,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,QAAQ,aACX,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAO;AAE9C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AAEA,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cAChB;AAEA,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,oBAAM,SAAS;AACf,kBAAI,YAAY,GAAG;AAIjB,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,UAAU,IAAI;AAEhB,sBAAM,OAAO;AACb,sBAAM,OAAO;AACb;AAAA,cACF;AACA,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,QAAQ,UAAU;AACxB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cACtB;AAEA,oBAAM,MAAM,MAAM;AAClB,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,yBAAS;AACP,uBAAO,MAAM,SAAS,QAAS,KAAK,MAAM,YAAY,CAAE;AACxD,4BAAY,SAAS;AACrB,0BAAW,SAAS,KAAM;AAC1B,2BAAW,OAAO;AAElB,oBAAK,aAAc,MAAM;AAAE;AAAA,gBAAO;AAElC,oBAAI,SAAS,GAAG;AAAE,wBAAM;AAAA,gBAAW;AACnC;AACA,wBAAQ,MAAM,MAAM,KAAK;AACzB,wBAAQ;AAAA,cAEV;AACA,mBAAK,UAAU,SAAU,GAAG;AAC1B,4BAAY;AACZ,0BAAU;AACV,2BAAW;AACX,2BAAS;AACP,yBAAO,MAAM,SAAS,aACZ,QAAS,KAAM,YAAY,WAAY,MAAoC,UAAU;AAC/F,8BAAY,SAAS;AACrB,4BAAW,SAAS,KAAM;AAC1B,6BAAW,OAAO;AAElB,sBAAK,YAAY,aAAc,MAAM;AAAE;AAAA,kBAAO;AAE9C,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBAEV;AAEA,0BAAU;AACV,wBAAQ;AAER,sBAAM,QAAQ;AAAA,cAChB;AAEA,wBAAU;AACV,sBAAQ;AAER,oBAAM,QAAQ;AACd,kBAAI,UAAU,IAAI;AAChB,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AACA,oBAAM,SAAS;AACf,oBAAM,QAAS,UAAW;AAC1B,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,OAAO;AAEf,oBAAI,MAAM;AACV,uBAAO,OAAO,GAAG;AACf,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,sBAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,0BAAU,MAAM;AAChB,wBAAQ,MAAM;AAEd,sBAAM,QAAQ,MAAM;AAAA,cACtB;AAEA,kBAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,qBAAK,MAAM;AACX,sBAAM,OAAO;AACb;AAAA,cACF;AAGA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAW;AACnC,qBAAO,OAAO;AACd,kBAAI,MAAM,SAAS,MAAM;AACvB,uBAAO,MAAM,SAAS;AACtB,oBAAI,OAAO,MAAM,OAAO;AACtB,sBAAI,MAAM,MAAM;AACd,yBAAK,MAAM;AACX,0BAAM,OAAO;AACb;AAAA,kBACF;AAAA,gBAgBF;AACA,oBAAI,OAAO,MAAM,OAAO;AACtB,0BAAQ,MAAM;AACd,yBAAO,MAAM,QAAQ;AAAA,gBACvB,OACK;AACH,yBAAO,MAAM,QAAQ;AAAA,gBACvB;AACA,oBAAI,OAAO,MAAM,QAAQ;AAAE,yBAAO,MAAM;AAAA,gBAAQ;AAChD,8BAAc,MAAM;AAAA,cACtB,OACK;AACH,8BAAc;AACd,uBAAO,MAAM,MAAM;AACnB,uBAAO,MAAM;AAAA,cACf;AACA,kBAAI,OAAO,MAAM;AAAE,uBAAO;AAAA,cAAM;AAChC,sBAAQ;AACR,oBAAM,UAAU;AAChB,iBAAG;AACD,uBAAO,KAAK,IAAI,YAAY,MAAM;AAAA,cACpC,SAAS,EAAE;AACX,kBAAI,MAAM,WAAW,GAAG;AAAE,sBAAM,OAAO;AAAA,cAAK;AAC5C;AAAA,YACF,KAAK;AACH,kBAAI,SAAS,GAAG;AAAE,sBAAM;AAAA,cAAW;AACnC,qBAAO,KAAK,IAAI,MAAM;AACtB;AACA,oBAAM,OAAO;AACb;AAAA,YACF,KAAK;AACH,kBAAI,MAAM,MAAM;AAEd,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AAEA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,wBAAQ;AACR,qBAAK,aAAa;AAClB,sBAAM,SAAS;AACf,oBAAK,MAAM,OAAO,KAAM,MAAM;AAC5B,uBAAK,QAAQ,MAAM;AAAA,kBAEd,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,MAAM,IAAI;AAAA,gBAEjH;AACA,uBAAO;AAEP,oBAAK,MAAM,OAAO,MAAO,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,MAAM,OAAO;AAC5E,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAGT;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,kBAAI,MAAM,QAAQ,MAAM,OAAO;AAE7B,uBAAO,OAAO,IAAI;AAChB,sBAAI,SAAS,GAAG;AAAE,0BAAM;AAAA,kBAAW;AACnC;AACA,0BAAQ,MAAM,MAAM,KAAK;AACzB,0BAAQ;AAAA,gBACV;AAEA,oBAAK,MAAM,OAAO,KAAM,UAAU,MAAM,QAAQ,aAAa;AAC3D,uBAAK,MAAM;AACX,wBAAM,OAAO;AACb;AAAA,gBACF;AAEA,uBAAO;AACP,uBAAO;AAAA,cAGT;AACA,oBAAM,OAAO;AAAA;AAAA,YAEf,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,oBAAM;AACN,oBAAM;AAAA,YACR,KAAK;AACH,qBAAO;AAAA,YACT,KAAK;AAAA;AAAA,YAEL;AACE,qBAAO;AAAA,UACX;AAAA,QACF;AAYA,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,YAAM,OAAO;AACb,YAAM,OAAO;AAGb,UAAI,MAAM,SAAU,SAAS,KAAK,aAAa,MAAM,OAAO,QACvC,MAAM,OAAO,SAAS,UAAU,WAAY;AAC/D,YAAI,aAAa,MAAM,KAAK,QAAQ,KAAK,UAAU,OAAO,KAAK,SAAS,GAAG;AACzE,gBAAM,OAAO;AACb,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,KAAK;AACZ,cAAQ,KAAK;AACb,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,YAAM,SAAS;AACf,UAAK,MAAM,OAAO,KAAM,MAAM;AAC5B,aAAK,QAAQ,MAAM;AAAA,QAChB,MAAM,QAAQA,OAAM,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI,IAAI,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,IAAI;AAAA,MACnI;AACA,WAAK,YAAY,MAAM,QAAQ,MAAM,OAAO,KAAK,MAC9B,MAAM,SAAS,OAAO,MAAM,MAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,QAAQ,MAAM;AACvE,WAAM,QAAQ,KAAK,SAAS,KAAM,UAAU,aAAa,QAAQ,MAAM;AACrE,cAAM;AAAA,MACR;AACA,aAAO;AAAA,IACT;AAGA,QAAM,aAAa,CAAC,SAAS;AAE3B,UAAI,kBAAkB,IAAI,GAAG;AAC3B,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,QAAQ;AAChB,cAAM,SAAS;AAAA,MACjB;AACA,WAAK,QAAQ;AACb,aAAO;AAAA,IACT;AAGA,QAAM,mBAAmB,CAAC,MAAM,SAAS;AAGvC,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,YAAM,QAAQ,KAAK;AACnB,WAAK,MAAM,OAAO,OAAO,GAAG;AAAE,eAAO;AAAA,MAAgB;AAGrD,YAAM,OAAO;AACb,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAGA,QAAM,uBAAuB,CAAC,MAAM,eAAe;AACjD,YAAM,aAAa,WAAW;AAE9B,UAAI;AACJ,UAAI;AACJ,UAAI;AAGJ,UAAI,kBAAkB,IAAI,GAAG;AAAE,eAAO;AAAA,MAAgB;AACtD,cAAQ,KAAK;AAEb,UAAI,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM;AAC3C,eAAO;AAAA,MACT;AAGA,UAAI,MAAM,SAAS,MAAM;AACvB,iBAAS;AAET,iBAAS,QAAQ,QAAQ,YAAY,YAAY,CAAC;AAClD,YAAI,WAAW,MAAM,OAAO;AAC1B,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,aAAa,MAAM,YAAY,YAAY,UAAU;AAC3D,UAAI,KAAK;AACP,cAAM,OAAO;AACb,eAAO;AAAA,MACT;AACA,YAAM,WAAW;AAEjB,aAAO;AAAA,IACT;AAGA,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,gBAAgB;AAC/B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,cAAc;AAC7B,WAAO,QAAQ,eAAe;AAC9B,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,mBAAmB;AAClC,WAAO,QAAQ,uBAAuB;AACtC,WAAO,QAAQ,cAAc;AAAA;AAAA;;;AC1hD7B;AAAA;AAAA;AAqBA,aAAS,WAAW;AAElB,WAAK,OAAa;AAElB,WAAK,OAAa;AAElB,WAAK,SAAa;AAElB,WAAK,KAAa;AAElB,WAAK,QAAa;AAElB,WAAK,YAAa;AAWlB,WAAK,OAAa;AAIlB,WAAK,UAAa;AAIlB,WAAK,OAAa;AAElB,WAAK,OAAa;AAAA,IACpB;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACzDjB,IAAAC,mBAAA;AAAA;AAAA;AAGA,QAAM,eAAe;AACrB,QAAM,QAAe;AACrB,QAAM,UAAe;AACrB,QAAM,MAAe;AACrB,QAAM,UAAe;AACrB,QAAM,WAAe;AAErB,QAAM,WAAW,OAAO,UAAU;AAKlC,QAAM;AAAA,MACJ;AAAA,MAAY;AAAA,MACZ;AAAA,MAAM;AAAA,MAAc;AAAA,MAAa;AAAA,MAAgB;AAAA,MAAc;AAAA,MAAa;AAAA,IAC9E,IAAI;AAIJ,QAAM,iBAAiB;AAAA,MACrB,WAAW,OAAO;AAAA,MAClB,YAAY;AAAA,MACZ,IAAI;AAAA,IACN;AA+EA,aAAS,QAAQ,SAAS;AACxB,WAAK,UAAU,MAAM,OAAO,CAAC,GAAG,gBAAgB,WAAW,CAAC,CAAC;AAE7D,YAAM,MAAM,KAAK;AAIjB,UAAI,IAAI,OAAQ,IAAI,cAAc,KAAO,IAAI,aAAa,IAAK;AAC7D,YAAI,aAAa,CAAC,IAAI;AACtB,YAAI,IAAI,eAAe,GAAG;AAAE,cAAI,aAAa;AAAA,QAAK;AAAA,MACpD;AAGA,UAAK,IAAI,cAAc,KAAO,IAAI,aAAa,MAC3C,EAAE,WAAW,QAAQ,aAAa;AACpC,YAAI,cAAc;AAAA,MACpB;AAIA,UAAK,IAAI,aAAa,MAAQ,IAAI,aAAa,IAAK;AAGlD,aAAK,IAAI,aAAa,QAAQ,GAAG;AAC/B,cAAI,cAAc;AAAA,QACpB;AAAA,MACF;AAEA,WAAK,MAAS;AACd,WAAK,MAAS;AACd,WAAK,QAAS;AACd,WAAK,SAAS,CAAC;AAEf,WAAK,OAAS,IAAI,QAAQ;AAC1B,WAAK,KAAK,YAAY;AAEtB,UAAI,SAAU,aAAa;AAAA,QACzB,KAAK;AAAA,QACL,IAAI;AAAA,MACN;AAEA,UAAI,WAAW,MAAM;AACnB,cAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MAC7B;AAEA,WAAK,SAAS,IAAI,SAAS;AAE3B,mBAAa,iBAAiB,KAAK,MAAM,KAAK,MAAM;AAGpD,UAAI,IAAI,YAAY;AAElB,YAAI,OAAO,IAAI,eAAe,UAAU;AACtC,cAAI,aAAa,QAAQ,WAAW,IAAI,UAAU;AAAA,QACpD,WAAW,SAAS,KAAK,IAAI,UAAU,MAAM,wBAAwB;AACnE,cAAI,aAAa,IAAI,WAAW,IAAI,UAAU;AAAA,QAChD;AACA,YAAI,IAAI,KAAK;AACX,mBAAS,aAAa,qBAAqB,KAAK,MAAM,IAAI,UAAU;AACpE,cAAI,WAAW,MAAM;AACnB,kBAAM,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AA2BA,YAAQ,UAAU,OAAO,SAAU,MAAM,YAAY;AACnD,YAAM,OAAO,KAAK;AAClB,YAAM,YAAY,KAAK,QAAQ;AAC/B,YAAM,aAAa,KAAK,QAAQ;AAChC,UAAI,QAAQ,aAAa;AAEzB,UAAI,KAAK,MAAO,QAAO;AAEvB,UAAI,eAAe,CAAC,CAAC,WAAY,eAAc;AAAA,UAC1C,eAAc,eAAe,OAAO,WAAW;AAGpD,UAAI,SAAS,KAAK,IAAI,MAAM,wBAAwB;AAClD,aAAK,QAAQ,IAAI,WAAW,IAAI;AAAA,MAClC,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAEA,WAAK,UAAU;AACf,WAAK,WAAW,KAAK,MAAM;AAE3B,iBAAS;AACP,YAAI,KAAK,cAAc,GAAG;AACxB,eAAK,SAAS,IAAI,WAAW,SAAS;AACtC,eAAK,WAAW;AAChB,eAAK,YAAY;AAAA,QACnB;AAEA,iBAAS,aAAa,QAAQ,MAAM,WAAW;AAE/C,YAAI,WAAW,eAAe,YAAY;AACxC,mBAAS,aAAa,qBAAqB,MAAM,UAAU;AAE3D,cAAI,WAAW,MAAM;AACnB,qBAAS,aAAa,QAAQ,MAAM,WAAW;AAAA,UACjD,WAAW,WAAW,cAAc;AAElC,qBAAS;AAAA,UACX;AAAA,QACF;AAWA,eAAO,KAAK,WAAW,KAChB,WAAW,gBACV,KAAK,MAAM,OAAO,KAAM,KAAK,MAAM,UAAU,KAC9C,KAAK,MAAM,KAAK,OAAO,MAAM,GACpC;AACE,uBAAa,aAAa,IAAI;AAC9B,mBAAS,aAAa,QAAQ,MAAM,WAAW;AAAA,QACjD;AAEA,gBAAQ,QAAQ;AAAA,UACd,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iBAAK,MAAM,MAAM;AACjB,iBAAK,QAAQ;AACb,mBAAO;AAAA,QACX;AAIA,yBAAiB,KAAK;AAEtB,YAAI,KAAK,UAAU;AAGjB,cAAI,KAAK,cAAc,KAAK,WAAW,gBAAgB,cAAc,GAAG;AAEtE,gBAAI,KAAK,QAAQ,OAAO,UAAU;AAEhC,kBAAI,gBAAgB,QAAQ,WAAW,KAAK,QAAQ,KAAK,QAAQ;AAEjE,kBAAI,OAAO,KAAK,WAAW;AAC3B,kBAAI,UAAU,QAAQ,WAAW,KAAK,QAAQ,aAAa;AAG3D,mBAAK,WAAW;AAChB,mBAAK,YAAY,YAAY;AAC7B,kBAAI,KAAM,MAAK,OAAO,IAAI,KAAK,OAAO,SAAS,eAAe,gBAAgB,IAAI,GAAG,CAAC;AAEtF,mBAAK,OAAO,OAAO;AAAA,YAErB,OAAO;AACL,mBAAK,OAAO,KAAK,OAAO,WAAW,KAAK,WAAW,KAAK,SAAS,KAAK,OAAO,SAAS,GAAG,KAAK,QAAQ,CAAC;AAIvG,mBAAK,YAAY;AACjB,mBAAK,WAAW;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AAQA,aAAK,WAAW,QAAQ,WAAW,gBAAgB,mBAAmB,EAAG;AAGzE,YAAI,WAAW,cAAc;AAC3B,mBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,eAAK,MAAM,MAAM;AACjB,eAAK,QAAQ;AACb,iBAAO;AAAA,QACT;AAEA,YAAI,KAAK,aAAa,GAAG;AASvB,cAAI,gBAAgB,UAAU;AAC5B,qBAAS,aAAa,WAAW,KAAK,IAAI;AAC1C,iBAAK,MAAM,WAAW,OAAO,cAAc,MAAM;AACjD,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACT;AACA;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAWA,YAAQ,UAAU,SAAS,SAAU,OAAO;AAC1C,WAAK,OAAO,KAAK,KAAK;AAAA,IACxB;AAYA,YAAQ,UAAU,QAAQ,SAAU,QAAQ;AAE1C,UAAI,WAAW,MAAM;AACnB,YAAI,KAAK,QAAQ,OAAO,UAAU;AAChC,eAAK,SAAS,KAAK,OAAO,KAAK,EAAE;AAAA,QACnC,OAAO;AACL,eAAK,SAAS,MAAM,cAAc,KAAK,MAAM;AAAA,QAC/C;AAAA,MACF;AACA,WAAK,SAAS,CAAC;AACf,WAAK,MAAM;AACX,WAAK,MAAM,KAAK,KAAK;AAAA,IACvB;AA0CA,aAAS,QAAQ,OAAO,SAAS;AAC/B,YAAM,WAAW,IAAI,QAAQ,OAAO;AAEpC,eAAS,KAAK,OAAO,IAAI;AAGzB,UAAI,SAAS,IAAK,OAAM,SAAS,OAAO,IAAI,SAAS,GAAG;AAExD,aAAO,SAAS;AAAA,IAClB;AAWA,aAAS,WAAW,OAAO,SAAS;AAClC,gBAAU,WAAW,CAAC;AACtB,cAAQ,MAAM;AACd,aAAO,QAAQ,OAAO,OAAO;AAAA,IAC/B;AAaA,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,SAAS;AACxB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;ACvc3B;AAAA;AAAA;AAGA,QAAM,EAAE,SAAS,SAAS,YAAY,KAAK,IAAI;AAE/C,QAAM,EAAE,SAAS,SAAS,YAAY,OAAO,IAAI;AAEjD,QAAM,YAAY;AAElB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,OAAO;AACtB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,UAAU;AACzB,WAAO,QAAQ,aAAa;AAC5B,WAAO,QAAQ,SAAS;AACxB,WAAO,QAAQ,YAAY;AAAA;AAAA;;;ACV3B,oBAAuB;;;ACDvB,IAAO,iBAAQ;AAAA;AAAA,EAEX,aAAa;AAAA,EACb,aAAa;AAAA,EACb,aAAa;AAAA;AAAA,EAGb,SAAS;AAAA,EACT,iBAAiB;AAAA,EACjB,gBAAgB;AAAA;AAAA,EAGhB,4BAA4B;AAAA;AAAA,EAG5B,mBAAmB;AAAA,EACnB,kBAAkB;AAAA;AAAA,EAGlB,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,sBAAsB;AAAA,EACtB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,oBAAoB;AAAA;AAAA,EAGpB,yBAAyB;AAAA,EACzB,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,gBAAgB;AAAA;AAAA,EAGhB,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,yBAAyB;AAAA,EACzB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,gBAAgB;AAAA;AAAA,EAGhB,mBAAmB;AAAA,EACnB,iBAAiB;AAAA,EACjB,wBAAwB;AAAA;AAAA,EAGxB,UAAU;AAAA,EAEV,6BAA6B;AAAA,EAC7B,4BAA4B;AAAA,EAC5B,6BAA6B;AAAA,EAC7B,2BAA2B;AAAA,EAC3B,8BAA8B;AAAA,EAC9B,kCAAkC;AAAA,EAClC,sBAAsB;AAAA,EAEtB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EAErB,gBAAgB;AACpB;;;ACrEO,IAAM,kBAAkB;AACxB,IAAM,yBAAyB;AAC/B,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;AAC5B,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAG3B,IAAM,sBAAsB;AAE5B,IAAM,qBAAqB;AAE3B,IAAM,qBAAqB;AAElC,IAAM,qBAAqB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKO,SAAS,0BAA0B,GAAW,GAAoB;AACvE,MAAI,EAAE,WAAW,EAAE,QAAQ;AAAA,EAE3B;AACA,SAAO,EAAE,YAAY,MAAM,EAAE,YAAY;AAC3C;AAGO,SAAS,cAAc,UAA2B;AACvD,SAAO,SAAS,YAAY,EAAE,WAAW,WAAW;AACtD;AAGO,SAAS,mBAAmB,UAA2B;AAC5D,QAAM,QAAQ,SAAS,YAAY;AACnC,SAAO,mBAAmB,KAAK,CAAC,MAAM,EAAE,YAAY,MAAM,KAAK;AACjE;AAcO,SAAS,sBACd,SACA,yBACU;AACV,QAAM,YAAY,MAAM,QAAQ,uBAAuB,IACnD,0BACA,CAAC,uBAAuB;AAE5B,aAAW,QAAQ,WAAW;AAC5B,UAAM,QAAQ,QAAQ,KAAK,CAAC,MAAM,EAAE,aAAa,IAAI;AACrD,QAAI,MAAO,QAAO;AAAA,EACpB;AAEA,aAAW,QAAQ,WAAW;AAC5B,UAAM,SAAS,QAAQ;AAAA,MACrB,CAAC,MAAM,OAAO,EAAE,aAAa,YAAY,0BAA0B,EAAE,UAAU,IAAI;AAAA,IACrF;AACA,QAAI,OAAQ,QAAO;AAAA,EACrB;AAEA,SAAO;AACT;;;AC/EO,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAC5B,IAAM,wBAAwB;AAC9B,IAAM,kCAAkC;AACxC,IAAM,8BAA8B;AACpC,IAAM,kBAAkB;AAiBxB,IAAM,YAAY;AAAA,EACvB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,aAAa;AAAA;AAAA,EACb,OAAa;AAAA;AAAA,EACb,aAAa;AAAA;AAAA,EACb,cAAc;AAAA;AAAA,EACd,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AACd;AACO,IAAM,mBAAmB;AAGzB,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,yBAAyB;AAC/B,IAAM,qBAAqB;AAC3B,IAAM,uBAAuB;AAC7B,IAAM,eAAe,mBAAmB,yBAAyB;AAGjE,IAAM,wBAAwB;AAC9B,IAAM,8BAA8B,IAAI;AAExC,IAAM,yBAA4C,CAAC,IAAM,IAAM,IAAM,CAAI;AAGzE,IAAM,YAAY;AAAA,EACvB,WAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AACd;AAGO,IAAM,cAAc;AAAA,EACzB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,OAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,cAAc;AAAA;AAAA,EACd,KAAY;AAAA;AAAA,EACZ,UAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,aAAa;AAAA;AAAA,EACb,UAAY;AAAA;AAAA,EACZ,eAAe;AAAA;AAAA,EACf,eAAe;AAAA;AAAA,EACf,kBAAkB;AAAA;AACpB;AAGO,IAAM,cAAc;AAAA,EACzB,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,SAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,aAAgB;AAAA;AAAA,EAChB,eAAgB;AAAA;AAAA,EAChB,kBAAkB;AAAA;AAAA,EAClB,oBAAoB;AAAA;AAAA,EACpB,iBAAiB;AAAA;AACnB;AAGO,IAAM,oBAAoB;AAAA,EAC/B,WAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,MAAY;AAAA;AAAA,EACZ,YAAa;AAAA;AAAA,EACb,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,cAAc;AAAA;AAAA,EACd,aAAc;AAAA;AAAA,EACd,eAAe;AAAA;AAAA,EACf,kBAAkB;AAAA;AAAA,EAClB,oBAAoB;AAAA;AAAA,EACpB,aAAe;AAAA;AACjB;AAGO,IAAM,oBAAoB;AAAA,EAC/B,MAAY;AAAA;AAAA,EACZ,WAAY;AAAA;AAAA,EACZ,SAAY;AAAA;AAAA,EACZ,oBAAoB;AAAA;AAAA,EACpB,aAAa;AAAA;AACf;AAGO,IAAM,aAAa;AAAA,EACxB,QAAkB;AAAA;AAAA,EAClB,QAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,kBAAkB;AAAA;AAAA,EAClB,OAAkB;AAAA;AAAA,EAClB,MAAkB;AAAA;AAAA,EAClB,WAAkB;AAAA;AAAA,EAClB,UAAkB;AAAA;AAAA,EAClB,MAAkB;AAAA;AAAA,EAClB,aAAkB;AAAA;AACpB;AAGO,IAAM,UAAU;AAAA,EACrB,WAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,cAAgB;AAAA;AAAA,EAChB,WAAgB;AAAA;AAAA,EAChB,kBAAkB;AAAA;AAAA,EAClB,SAAgB;AAAA;AAAA,EAChB,gBAAgB;AAAA;AAAA;AAAA,EAEhB,KAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,EAIhB,MAAgB;AAAA;AAClB;AAGO,IAAM,yBAAyB;AAAA,EACpC,IAAiB;AAAA,EACjB,MAAiB;AACnB;AAGO,IAAM,SAAS;AAAA,EACpB,OAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,WAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,aAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,YAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,UAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,cAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,UAAiB;AAAA;AACnB;AAGO,IAAM,cAAc;AAAA,EACzB,OAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,SAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,KAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,MAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AAAA,EACjB,OAAiB;AAAA;AAAA,EACjB,QAAiB;AAAA;AACnB;AAGO,IAAM,gBAAgB;AAAA,EAC3B,UAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,WAAiB;AAAA,EACjB,SAAiB;AACnB;;;ACtNO,IAAM,SAAN,MAAa;AAAA;AAAA;AAAA;AAAA,EAiBlB,OAAO,UAAU,QAAqC;AACpD,SAAK,SAAS,EAAE,GAAG,KAAK,QAAQ,GAAG,OAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,YAA0B;AAC/B,WAAO,EAAE,GAAG,KAAK,OAAO;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAe;AACpB,SAAK,OAAO,UAAU;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAAgB;AACrB,SAAK,OAAO,UAAU;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,OAAuB;AACrC,SAAK,OAAO,QAAQ;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAMA,OAAe,UAAU,OAA0B;AACjD,QAAI,CAAC,KAAK,OAAO,QAAS,QAAO;AAEjC,UAAM,SAAqB,CAAC,SAAS,QAAQ,QAAQ,SAAS,QAAQ;AACtE,UAAM,oBAAoB,OAAO,QAAQ,KAAK,OAAO,KAAK;AAC1D,UAAM,sBAAsB,OAAO,QAAQ,KAAK;AAEhD,WAAO,uBAAuB;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,OAAO,MAAmB;AAC/B,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,IAAI,GAAG,IAAI;AAAA,IAClC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,MAAmB;AACjC,QAAI,KAAK,UAAU,OAAO,GAAG;AAC3B,WAAK,gBAAgB,MAAM,GAAG,IAAI;AAAA,IACpC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,QAAQ,MAAmB;AAChC,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,KAAK,GAAG,IAAI;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,MAAmB;AACjC,QAAI,KAAK,UAAU,OAAO,GAAG;AAE3B,WAAK,gBAAgB,IAAI,GAAG,IAAI;AAAA,IAClC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,QAAQ,MAAmB;AAChC,QAAI,KAAK,UAAU,MAAM,GAAG;AAC1B,WAAK,gBAAgB,KAAK,GAAG,IAAI;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,kBAAwB;AAC7B,YAAQ,MAAM,IAAI,SAAgB,KAAK,IAAI,GAAG,IAAI;AAClD,YAAQ,QAAQ,IAAI,SAAgB,KAAK,MAAM,GAAG,IAAI;AACtD,YAAQ,OAAO,IAAI,SAAgB,KAAK,KAAK,GAAG,IAAI;AACpD,YAAQ,QAAQ,IAAI,SAAgB,KAAK,MAAM,GAAG,IAAI;AACtD,YAAQ,OAAO,IAAI,SAAgB,KAAK,KAAK,GAAG,IAAI;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,iBAAuB;AAC5B,YAAQ,MAAM,KAAK,gBAAgB;AACnC,YAAQ,QAAQ,KAAK,gBAAgB;AACrC,YAAQ,OAAO,KAAK,gBAAgB;AACpC,YAAQ,QAAQ,KAAK,gBAAgB;AACrC,YAAQ,OAAO,KAAK,gBAAgB;AAAA,EACtC;AAEF;AApIa,OACI,SAAuB;AAAA,EACpC,SAAS;AAAA,EACT,OAAO;AACT;AAJW,OAMI,kBAAkB;AAAA,EAC/B,KAAK,QAAQ;AAAA,EACb,OAAO,QAAQ;AAAA,EACf,MAAM,QAAQ;AAAA,EACd,OAAO,QAAQ;AAAA,EACf,MAAM,QAAQ;AAChB;AA6HK,SAAS,iCAAuC;AACrD,QAAM,MAAM,OAAO,YAAY,cAAc,QAAQ,MAAM,CAAC;AAG5D,MAAI,IAAI,iBAAiB,SAAS;AAChC,WAAO,QAAQ;AAAA,EACjB,WAAW,IAAI,iBAAiB,QAAQ;AACtC,WAAO,OAAO;AACd,WAAO,SAAS,OAAO;AAAA,EACzB;AAGA,MAAI,IAAI,kBAAkB;AACxB,UAAM,QAAQ,IAAI;AAClB,QAAI,CAAC,SAAS,QAAQ,QAAQ,SAAS,QAAQ,EAAE,SAAS,KAAK,GAAG;AAChE,aAAO,SAAS,KAAK;AAAA,IACvB;AAAA,EACF;AAGA,MAAI,IAAI,aAAa,cAAc;AACjC,WAAO,SAAS,OAAO;AAAA,EACzB;AACF;AAIA,+BAA+B;;;AC5K/B,IAAM,YAAY,OAAO,WAAW,cAAc,SAAU,OAAO,WAAW,eAAe,OAAO,SAAS,OAAO,SAAS;AAE7H,IAAI,CAAC,aAAa,CAAC,UAAU,QAAQ;AACnC,QAAM,IAAI,MAAM,qDAAqD;AACvE;AAGA,SAAS,wBAAwB,QAAQ;AACvC,SAAO,IAAI,WAAW,MAAM;AAC9B;AAGA,SAAS,SAAS,MAAM;AACtB,MAAI,gBAAgB,YAAY;AAC9B,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACA,MAAI,gBAAgB,aAAa;AAC/B,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACA,SAAO,OAAO,KAAK,IAAI;AACzB;AAGA,eAAe,WAAW,WAAW;AACnC,QAAM,UAAU;AAAA,IACd,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,OAAO;AAAA,EACT;AAEA,QAAM,UAAU,QAAQ,UAAU,YAAY,CAAC,KAAK;AAEpD,SAAO;AAAA,IACL,QAAQ,SAAS,MAAM;AACrB,WAAK,QAAQ,KAAK,QAAQ,OAAO,OAAO,CAAC,KAAK,OAAO,SAAS,IAAI,CAAC,CAAC,IAAI,SAAS,IAAI;AACrF,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,eAAe,UAAU;AAC/B,YAAM,OAAO,KAAK,SAAS,OAAO,MAAM,CAAC;AACzC,YAAM,aAAa,MAAM,UAAU,OAAO,OAAO,SAAS,IAAI;AAC9D,YAAM,YAAY,wBAAwB,UAAU;AAEpD,UAAI,aAAa,OAAO;AACtB,eAAO,MAAM,KAAK,SAAS,EACxB,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EACxC,KAAK,EAAE;AAAA,MACZ;AACA,UAAI,aAAa,UAAU;AACzB,eAAO,OAAO,KAAK,SAAS,EAAE,SAAS,QAAQ;AAAA,MACjD;AACA,aAAO,OAAO,KAAK,SAAS;AAAA,IAC9B;AAAA,EACF;AACF;AAGA,SAAS,YAAY,MAAM;AACzB,QAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,YAAU,gBAAgB,KAAK;AAC/B,SAAO,OAAO,KAAK,KAAK;AAC1B;AAKA,SAAS,QAAQ,MAAM;AACrB,QAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI;AACxE,QAAM,MAAM,IAAI;AAChB,QAAM,SAAS,MAAM;AACrB,QAAM,SAAS,MAAO,MAAM,KAAK;AACjC,QAAM,WAAW,MAAM,KAAK,SAAS,IAAI,SAAS,KAAK,UAAU;AACjE,QAAM,SAAS,OAAO,MAAM,QAAQ;AACpC,MAAI,KAAK,QAAQ,CAAC;AAClB,SAAO,GAAG,IAAI;AACd,SAAO,cAAe,SAAS,eAAiB,GAAG,WAAW,CAAC;AAC/D,SAAO,cAAc,WAAW,GAAG,WAAW,CAAC;AAE/C,QAAM,IAAI,CAAC,YAAY,YAAY,YAAY,WAAY,UAAU;AACrE,QAAM,IAAI,CAAC,YAAY,YAAY,YAAY,UAAU;AACzD,QAAM,IAAI,IAAI,MAAM,EAAE;AAEtB,WAAS,MAAM,GAAG,MAAM,UAAU,OAAO,IAAI;AAC3C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAE,CAAC,IAAI,OAAO,aAAa,MAAM,IAAI,CAAC;AAAA,IACxC;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,QAAE,CAAC,KAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,KAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO;AAAA,IACnH;AACA,QAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI;AACtB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAI,GAAG;AACP,UAAI,IAAI,IAAI;AACV,YAAK,IAAI,IAAO,CAAC,IAAK;AACtB,YAAI,EAAE,CAAC;AAAA,MACT,WAAW,IAAI,IAAI;AACjB,YAAI,IAAI,IAAI;AACZ,YAAI,EAAE,CAAC;AAAA,MACT,WAAW,IAAI,IAAI;AACjB,YAAK,IAAI,IAAM,IAAI,IAAM,IAAI;AAC7B,YAAI,EAAE,CAAC;AAAA,MACT,OAAO;AACL,YAAI,IAAI,IAAI;AACZ,YAAI,EAAE,CAAC;AAAA,MACT;AACA,WAAO,KAAK,IAAM,MAAM,MAAO,IAAI,IAAI,KAAK,EAAE,CAAC,MAAM,OAAQ;AAC7D,UAAI;AAAG,UAAI;AAAG,UAAK,KAAK,KAAO,MAAM;AAAI,UAAI;AAAG,UAAI;AAAA,IACtD;AACA,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAG,MAAE,CAAC,IAAK,EAAE,CAAC,IAAI,MAAO;AAAA,EAC5H;AAEA,QAAM,MAAM,OAAO,MAAM,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,cAAc,EAAE,CAAC,GAAG,IAAI,CAAC;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,SAAS,SAAS,KAAK,MAAM;AAC3B,QAAM,WAAW;AACjB,MAAI,IAAI,OAAO,SAAS,GAAG,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;AACjE,MAAI,EAAE,SAAS,UAAU;AACvB,QAAI,QAAQ,CAAC;AAAA,EACf;AACA,MAAI,EAAE,SAAS,UAAU;AACvB,QAAI,OAAO,OAAO,CAAC,GAAG,OAAO,MAAM,WAAW,EAAE,MAAM,CAAC,CAAC;AAAA,EAC1D;AACA,QAAM,OAAO,OAAO,MAAM,UAAU,EAAI;AACxC,QAAM,OAAO,OAAO,MAAM,UAAU,EAAI;AACxC,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,SAAK,CAAC,KAAK,EAAE,CAAC;AACd,SAAK,CAAC,KAAK,EAAE,CAAC;AAAA,EAChB;AACA,QAAM,QAAQ,QAAQ,OAAO,OAAO,CAAC,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;AAC7F,SAAO,QAAQ,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK,MAAM,YAAY,QAAQ,QAAQ;AACzD,MAAI,UAAU,OAAO,YAAY,MAAM,QAAQ;AAC7C,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,OAAO;AACb,QAAM,SAAS,KAAK,KAAK,SAAS,IAAI;AACtC,QAAM,SAAS,CAAC;AAChB,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,QAAM,UAAU,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI;AAC/D,WAAS,IAAI,GAAG,KAAK,QAAQ,KAAK;AAChC,UAAM,OAAO,OAAO,KAAK,CAAE,MAAM,KAAM,KAAO,MAAM,KAAM,KAAO,MAAM,IAAK,KAAM,IAAI,GAAI,CAAC;AAC3F,QAAI,IAAI,SAAS,QAAQ,OAAO,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;AACvD,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,aAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,UAAI,SAAS,QAAQ,CAAC;AACtB,eAAS,IAAI,GAAG,IAAI,MAAM,IAAK,OAAM,CAAC,KAAK,EAAE,CAAC;AAAA,IAChD;AACA,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,OAAO,OAAO,MAAM,EAAE,SAAS,GAAG,MAAM;AACjD;AAEA,SAAS,WAAW,WAAW,KAAK;AAClC,MAAI,cAAc,QAAQ;AACxB,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AACA,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,MAAI,OAAO,OAAO,MAAM,CAAC;AACzB,SAAO;AAAA,IACL,OAAO,OAAO;AACZ,aAAO,OAAO,OAAO,CAAC,MAAM,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAK,CAAC,CAAC;AAChF,aAAO;AAAA,IACT;AAAA,IACA,SAAS;AACP,YAAM,MAAM,SAAS,QAAQ,IAAI;AACjC,aAAO,OAAO,MAAM,CAAC;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAGA,IAAM,WAAW,IAAI,WAAW,CAAC,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,GAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,GAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,GAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,GAAK,KAAK,IAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,IAAK,KAAK,GAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,KAAK,IAAK,IAAK,IAAK,IAAK,GAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAK,KAAK,KAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,GAAK,KAAK,IAAK,IAAK,IAAK,IAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,KAAK,IAAK,IAAK,KAAK,KAAK,KAAK,KAAK,IAAK,KAAK,KAAK,IAAK,KAAK,IAAK,KAAK,IAAK,IAAK,KAAK,IAAK,KAAK,EAAI,CAAC;AACjyC,IAAM,WAAW,IAAI,WAAW,CAAC,GAAK,GAAK,GAAK,GAAK,IAAK,IAAK,IAAK,KAAK,IAAK,EAAI,CAAC;AACnF,SAAS,mBAAmB,KAAK;AAC/B,QAAM,IAAI,IAAI,WAAW,GAAG;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,IAAI,CAAC;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,IAAI,IAAI;AACd,UAAM,QAAQ,IAAI,KAAK;AACvB,UAAM,KAAK,IAAI,KAAK;AACpB,QAAI,IAAI,MAAM,GAAG;AACf,YAAM,KAAK,SAAS,EAAE,IAAI,CAAC,CAAC,IAAI,SAAU,IAAI,IAAK,CAAC;AACpD,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI;AAAI,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AAAA,IACvI,WAAW,IAAI,MAAM,GAAG;AACtB,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,SAAS,EAAE,IAAE,CAAC,CAAC;AAAA,IACrJ,OAAO;AACL,QAAE,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAG,QAAE,IAAE,CAAC,IAAI,EAAE,OAAK,CAAC,IAAI,EAAE,IAAE,CAAC;AAAA,IAC7G;AAAA,EACF;AACA,SAAO;AACT;AACA,SAAS,MAAM,GAAG;AAChB,SAAU,KAAK,IAAK,OAAW,MAAM,IAAK,KAAK;AACjD;AACA,SAAS,sBAAsB,aAAa,OAAO;AACjD,QAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,MAAM,CAAC,IAAI,YAAY,CAAC;AAC5D,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AACjD,UAAMC,KAAI,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AACxD,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AAAI,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAEA;AACtE,UAAMC,MAAG,EAAE,CAAC;AAAG,MAAE,CAAC,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAE,EAAE,EAAE;AAAG,MAAE,EAAE,IAAE,EAAE,CAAC;AAAG,MAAE,CAAC,IAAEA;AACzD,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,IAAI,EAAE,IAAE,CAAC;AAAG,YAAM,IAAI,EAAE,IAAE,IAAE,CAAC;AAAG,YAAM,KAAK,EAAE,IAAE,IAAE,CAAC;AAAG,YAAM,IAAI,EAAE,IAAE,IAAE,CAAC;AAC5E,QAAE,IAAE,CAAC,IAAM,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,IAAI,KAAK;AAC1C,QAAE,IAAE,IAAE,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,MAAM,EAAE,IAAI,KAAK;AAC3C,QAAE,IAAE,IAAE,CAAC,IAAI,IAAI,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI;AAC1C,QAAE,IAAE,IAAE,CAAC,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,CAAC;AAAA,IAC5C;AACA,UAAM,KAAK,IAAI;AACf,aAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,KAAK,YAAY,KAAK,CAAC;AAAA,EACzD;AACA,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AACjD,QAAM,IAAI,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AACxD,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AAAI,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE;AACtE,QAAM,KAAG,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE,EAAE,EAAE;AAAG,IAAE,EAAE,IAAE,EAAE,CAAC;AAAG,IAAE,CAAC,IAAE;AACzD,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,GAAE,CAAC,KAAK,YAAY,MAAM,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,eAAe,WAAW,KAAK,IAAI;AAC1C,MAAI,cAAc,iBAAkB,OAAO,QAAQ,OAAO,QAAY;AACpE,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,MAAM,OAAO,KAAK,GAAG;AAC3D,MAAI,OAAO,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAC5E,QAAM,cAAc,mBAAmB,MAAM;AAC7C,SAAO;AAAA,IACL,iBAAiB;AACf,aAAO;AAAA,IACT;AAAA,IACA,OAAO,OAAO;AACZ,YAAM,IAAI,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAK;AAC5D,UAAI,EAAE,WAAW,IAAI;AACnB,cAAM,IAAI,MAAM,mDAAmD;AAAA,MACrE;AACA,YAAM,MAAM,sBAAsB,aAAa,CAAC;AAChD,aAAO,OAAO,KAAK,GAAG;AAAA,IACxB;AAAA,IACA,QAAQ;AACN,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AACF;;;ACtPO,IAAM,aAAN,MAAM,WAAwC;AAAA;AAAA,EAGnD,UAAU,QAAmC;AAC3C,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,eAAuB;AACrB,WAAO,WAAU;AAAA,EACnB;AAAA,EAEA,MAAM,QAAQ,MAAc,SAAuD;AACjF,QAAI;AACF,UAAI,QAAQ,+BAAwC;AAClD,eAAO;AAAA,UACL,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,OAAO,KAAK,SAAS,QAAQ,QAAQ;AAG3C,YAAM,gBAAgB,OAAO,MAAM,KAAK,MAAM;AAE9C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,OAAO,KAAK,CAAC;AACnB,cAAM,gBAAgB,KAAK,YAAY,MAAM,IAAI;AACjD,sBAAc,CAAC,IAAI;AACnB,aAAK,WAAW,MAAM,IAAI;AAAA,MAC5B;AAEA,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,QAAQ,MAAc,SAAuD;AACjF,QAAI;AACF,UAAI,QAAQ,+BAAwC;AAClD,eAAO;AAAA,UACL,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AAAA,MACF;AAGA,YAAM,OAAO,KAAK,SAAS,QAAQ,QAAQ;AAG3C,YAAM,gBAAgB,OAAO,MAAM,KAAK,MAAM;AAE9C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,gBAAgB,KAAK,CAAC;AAC5B,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,sBAAc,CAAC,IAAI;AACnB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAEA,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,iBAAiB,QAAQ,MAAM,UAAU;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAe,iBAAyB,WAAyB;AAC/D,QAAI,gBAAgB,SAAS,IAAI;AAC/B,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAGA,QAAI,gBAAgB,EAAE,MAAM,WAAW;AACrC,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,8BAA8B,mBAA2B,OAKvD;AAEA,QAAI,kBAAkB,aAAa,CAAC,MAAM,UAAY;AACpD,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AAGA,UAAM,WAAW,kBAAkB,aAAa,CAAC;AACjD,UAAM,kBAAkB,kBAAkB,aAAa,EAAE;AACzD,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAGlD,QAAK,WAAW,QAAQ,cAAe,CAAE,MAAc,mBAAoB,MAAc,oBAAoB,IAAI;AAC/G,MAAC,MAAc,kBAAkB;AAAA,IACnC;AAGA,IAAC,MAAc,WAAW;AAG1B,QAAI;AACJ,QAAI,WAAW,QAAQ,WAAW;AAChC,YAAM,WAAY,MAAc,mBAAmB,MAAM,eAAe;AACxE,kBAAa,YAAY,IAAK;AAAA,IAChC,OAAO;AACL,YAAM,MAAM,YAAY,aAAa,IAAI,WAAW,MAAM;AAC1D,kBAAa,OAAO,KAAM;AAAA,IAC5B;AAEA,WAAO,EAAE,UAAU,iBAAiB,UAAU,UAAU;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,uBAAuB,OAAiB,UAA0B;AAChE,UAAM,SAAS,OAAO,MAAM,gBAAgB;AAG5C,UAAM,SAAS,YAAY,EAAE;AAC7B,WAAO,KAAK,QAAQ,CAAC;AAKrB,QAAI;AACJ,SAAK,MAAM,WAAW,QAAQ,eAAe,GAAG;AAC9C,YAAM,WAAW,MAAM,mBAAmB,MAAM,eAAe;AAC/D,kBAAa,YAAY,IAAK;AAAA,IAChC,OAAO;AAEL,kBAAa,MAAM,OAAO,KAAM;AAAA,IAClC;AAGA,WAAO,EAAE,IAAI;AAEb,WAAO,MAAM,sDAAsD,UAAU,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,gBAAgB,MAAM,WAAW,QAAQ,eAAe,CAAC,EAAE;AAErK,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAc,OAAiB,gBAAwB,UAA0B;AAE/E,UAAM,SAAS,KAAK,uBAAuB,OAAO,QAAQ;AAG1D,UAAM,gBAAgB,OAAO,OAAO,CAAC,QAAQ,cAAc,CAAC;AAG5D,UAAM,OAAO,KAAK,SAAS,QAAQ;AAInC,UAAM,gBAAgB,OAAO,MAAM,cAAc,MAAM;AAEvD,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,YAAM,OAAO,cAAc,CAAC;AAC5B,YAAM,gBAAgB,KAAK,YAAY,MAAM,IAAI;AACjD,oBAAc,CAAC,IAAI;AAEnB,WAAK,WAAW,MAAM,IAAI;AAAA,IAC5B;AAEA,WAAO,MAAM,iCAAiC,eAAe,MAAM,4BAA4B,gBAAgB,mBAAmB,cAAc,MAAM,cAAc;AAEpK,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,cAAc,OAAiB,QAAgB,eAAuB,UAA0B;AAE9F,UAAM,YAAY,OAAO,SAAS,MAAM,cAAc;AACtD,UAAM,oBAAoB,UAAU,SAAS,GAAG,EAAE;AAGlD,UAAM,EAAE,UAAU,UAAU,UAAU,IAAI,KAAK,8BAA8B,mBAAmB,KAAK;AAKrG,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAClD,UAAM,WAAW,kBAAkB,aAAa,EAAE;AAClD,UAAM,YAAY,KAAK,WAAW;AAClC,UAAMC,oBAAmB;AACzB,UAAM,gBAAgB,UAAU,SAAS,WAAW,YAAYA,iBAAgB;AAGhF,UAAM,0BAA0B,OAAO,OAAO,CAAC,eAAe,aAAa,CAAC;AAK5E,UAAM,OAAO,KAAK,SAAS,QAAQ;AAEnC,aAAS,IAAI,GAAG,IAAI,wBAAwB,QAAQ,KAAK;AACvD,YAAM,gBAAgB,wBAAwB,CAAC;AAC/C,YAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,8BAAwB,CAAC,IAAI;AAC7B,WAAK,WAAW,MAAM,aAAa;AAAA,IACrC;AAIA,UAAM,kBAAkB,wBAAwB,SAAS,GAAGA,iBAAgB;AAG5E,SAAK,eAAe,iBAAiB,SAAS;AAG9C,WAAO,wBAAwB,SAASA,iBAAgB;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,OAAO,sBACL,UACA,WACA,iBACwB;AAExB,UAAM,OAAO,KAAK,SAAS,QAAQ;AAGnC,UAAMA,oBAAmB;AACzB,UAAM,eAAe,OAAO,MAAMA,iBAAgB;AAClD,QAAI,uBAAuB;AAC3B,QAAI,eAA8B;AAClC,QAAI,qBAAqB;AAIzB,WAAO,uBAAuBA,mBAAkB;AAE9C,UAAI,CAAC,gBAAgB,sBAAsB,aAAa,QAAQ;AAC9D,cAAM,SAAS,MAAM,gBAAgB,KAAK;AAE1C,YAAI,OAAO,QAAQ,CAAC,OAAO,OAAO;AAChC,gBAAM,IAAI,MAAM,qEAAqE;AAAA,QACvF;AAEA,uBAAe,OAAO;AACtB,6BAAqB;AAAA,MACvB;AAGA,YAAM,cAAcA,oBAAmB;AACvC,YAAM,cAAc,KAAK,IAAI,aAAa,aAAa,SAAS,kBAAkB;AAElF,mBAAa,KAAK,cAAc,sBAAsB,oBAAoB,qBAAqB,WAAW;AAC1G,8BAAwB;AACxB,4BAAsB;AAAA,IACxB;AAKA,aAAS,IAAI,GAAG,IAAIA,mBAAkB,KAAK;AACzC,YAAM,gBAAgB,aAAa,CAAC;AACpC,YAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa,IAAI;AAC9D,mBAAa,CAAC,IAAI;AAElB,WAAK,WAAW,MAAM,aAAa;AAAA,IACrC;AAIA,SAAK,eAAe,cAAc,SAAS;AAK3C,QAAI,gBAAgB,qBAAqB,aAAa,QAAQ;AAC5D,YAAM,mBAAmB,aAAa,SAAS;AAE/C,eAAS,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACzC,cAAM,MAAM,qBAAqB;AACjC,cAAM,gBAAgB,aAAa,GAAG;AACtC,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,qBAAa,GAAG,IAAI;AAEpB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAGA,YAAM,aAAa,SAAS,kBAAkB;AAAA,IAChD;AAKA,qBAAiB,kBAAkB,iBAAiB;AAGlD,eAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,cAAM,gBAAgB,eAAe,CAAC;AACtC,cAAM,gBAAgB,KAAK,YAAY,MAAM,aAAa;AAC1D,uBAAe,CAAC,IAAI;AAEpB,aAAK,WAAW,MAAM,aAAa;AAAA,MACrC;AAGA,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,SAAS,UAA4B;AAC3C,UAAM,OAAO,CAAC,WAAY,WAAY,SAAU;AAEhD,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,WAAK,WAAW,MAAM,SAAS,WAAW,CAAC,CAAC;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,WAAW,MAAgB,MAAoB;AACrD,SAAK,CAAC,KAAM,KAAK,CAAC,MAAM,IAAK,WAAU,WAAW,KAAK,CAAC,IAAI,QAAQ,GAAI,OAAO;AAE/E,SAAK,CAAC,KAAM,KAAK,KAAK,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,MAAO,SAAU,IAAI,IAAK,gBAAgB;AACrF,SAAK,CAAC,KAAM,KAAK,CAAC,MAAM,IAAK,WAAU,WAAW,KAAK,CAAC,IAAK,KAAK,CAAC,MAAM,MAAO,GAAI,OAAO;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,YAAY,MAAgB,MAAsB;AACxD,UAAM,OAAO,KAAK,CAAC,IAAI;AAEvB,YAAQ,OAAQ,KAAK,KAAK,MAAO,OAAO,CAAE,MAAM,KAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,YAAY,MAAgB,eAA+B;AACjE,UAAM,OAAO,KAAK,CAAC,IAAI;AAEvB,YAAQ,gBAAiB,KAAK,KAAK,MAAO,OAAO,CAAE,MAAM,KAAM;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA,EAuDQ,MAAM,KAAa,MAAsB;AAC/C,YAAS,QAAQ,IAAK,WAAU,WAAW,MAAM,QAAQ,GAAI,OAAO;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,MAAM,KAA8B;AACzC,WAAO,UAAU,GAAG;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,YAAY,KAAa,MAAsB;AACpD,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC;AACF;AA3ea,WACa,aAAa;AAAA;AAAA;AAAA;AAD1B,WAiaK,YAAY;AAAA,EAC1B;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAC5D;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACtC;AA7cK,IAAM,YAAN;AAmfP,SAAS,UAAU,KAA8B;AAC/C,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,OAAO,KAAK,KAAK,MAAM;AAAA,EAC/B;AAEA,MAAI,MAAM,IAAI;AACd,MAAI,MAAM,CAAC;AACX,WAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,UAAM,UAAU,WAAW,MAAM,IAAI,KAAK,KAAK,GAAI,IAAK,QAAQ;AAAA,EAClE;AAGA,SAAO,CAAC,QAAQ;AAClB;AASA,SAAS,gBAAgB,KAAa,MAAsB;AAC1D,SAAO,UAAU,WAAW,MAAM,QAAQ,GAAI,IAAK,QAAQ;AAC7D;AAQO,SAAS,MAAM,KAA8B;AAClD,SAAO,UAAU,GAAG;AACtB;AASO,SAAS,YAAY,KAAa,MAAsB;AAC7D,SAAO,gBAAgB,KAAK,IAAI;AAClC;AAMO,SAAS,OAAO,MAAsB;AAC3C,QAAM,OAAO,WAAW,QAAQ;AAChC,SAAO,KACJ,OAAO,IAAI,EACX,OAAO,KAAK;AACjB;;;AC3hBA,IAAM,eAAe;AACrB,IAAM,cAAc;AACpB,IAAM,kBAAkB;AAKxB,IAAqB,WAArB,MAAsD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4EpD,YAAY,OAAsB,SAAyB,OAAiB;AA3E5E,iBAAQ;AAER,qBAAoB;AACpB;AAAA,sBAAqB;AACrB;AAAA,oBAAmB;AACnB;AAAA,qBAAoB;AACpB;AAAA,uBAAsB;AACtB;AAAA,eAAc;AACd;AAAA,0BAAyB;AACzB;AAAA,4BAA2B;AAC3B;AAAA,qBAAoB;AACpB;AAAA,uBAAsB;AACtB;AAAA,uBAAsB;AACtB;AAAA,0BAAyB;AACzB;AAAA,oBAAmB;AACnB;AAAA,sBAA4B;AAC5B;AAAA,mBAAyB;AAGzB;AAAA;AAAA,sBAA4B;AAG5B;AAAA;AAAA,mBAAyB;AAEzB;AAAA,uBAAuB;AACvB;AAAA,2BAA2B;AAC3B;AAAA,sBAA4B;AAC5B;AAAA,2BAA0B;AAC1B;AAAA,mBAA2B;AAG3B;AAAA;AAAA,sBAAqB;AACrB;AAAA,uBAAsB;AACtB;AAAA,yBAAwB;AAGxB;AAAA;AAAA,mCAAkC;AAClC,8BAA6B;AAC7B,0BAAyB;AAEzB,qBAAqB;AACrB;AAAA,uBAAuB;AACvB;AAAA,sBAAsB;AAGtB;AAAA;AAAA,oBAA0B;AAC1B;AAAA,yBAA+B;AAC/B;AAAA,eAAqB;AACrB;AAAA,eAAqB;AACrB;AAAA,kBAAwB;AAOxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,wBAA8B;AAG9B;AAAA,qBAAqB;AACrB;AAAA,sBAA4B;AAG5B;AAAA;AAAA,sBAAsB;AACtB;AAAA,yBAA+B;AAC/B;AAAA,iBAAuB;AAmBvB,mBAAU,KAAK,aAAa;AAC5B,sBAAa,KAAK,YAAY,QAAQ,KAAK,aAAa;AACxD,mBAAU,KAAK,YAAY,QAAQ,KAAK,aAAa;AACrD,mBAAU,KAAK,YAAY,QAAQ,KAAK,aAAa;AAErD,wBAAe,MAAM;AACnB,cAAQ,KAAK,UAAU;AAAA,QACrB,KAAK;AACH,iBAAQ,YAAY,UAAU,IAAK;AAAA;AAAA,QACvC,KAAK;AACH,iBAAQ,YAAY,QAAQ,IAAK;AAAA;AAAA,QACnC;AACE,iBAAQ,YAAY,QAAQ,IAAK;AAAA,MACnC;AAAA,IACF,GAAG;AAtBD,SAAK,WAAW,SAAS;AACzB,SAAK,UAAU,WAAW;AAC1B,SAAK,QAAQ,SAAS;AAGtB,SAAK,YAAY,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,aAAa,MAAsB;AAEjC,QAAI,KAAK,SAAS,YAAY,MAAM;AAClC,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAIA,QAAI,KAAK,aAAa,CAAC,MAAM,YAAY,WAAW;AAClD,YAAM,IAAI,MAAM,eAAO,WAAW;AAAA,IACpC;AAGA,SAAK,YAAY,KAAK,aAAa,YAAY,QAAQ;AAEvD,SAAK,aAAa,KAAK,aAAa,YAAY,OAAO;AAEvD,SAAK,WAAW,KAAK,aAAa,YAAY,KAAK;AAEnD,SAAK,KAAK,WAAW,QAAQ,cAAc,GAAG;AAC5C,WAAK,cAAc;AACnB,WAAK,KAAK,WAAW,QAAQ,mBAAmB;AAC9C,aAAK,kBAAkB;AAAA,IAC3B;AAEA,SAAK,YAAY,KAAK,aAAa,YAAY,UAAU;AAEzD,SAAK,cAAc,KAAK,aAAa,YAAY,YAAY;AAG7D,SAAK,MAAM,KAAK,aAAa,YAAY,GAAG;AAE5C,SAAK,iBAAiB,KAAK,aAAa,YAAY,QAAQ;AAE5D,SAAK,mBAAmB,KAAK,aAAa,YAAY,UAAU;AAEhE,SAAK,YAAY,KAAK,aAAa,YAAY,QAAQ;AAEvD,SAAK,cAAc,KAAK,aAAa,YAAY,aAAa;AAE9D,SAAK,cAAc,KAAK,aAAa,YAAY,aAAa;AAC9D,QAAI,KAAK,cAAc,cAAc;AACnC,WAAK,cAAc;AAGrB,SAAK,iBAAiB,KAAK,aAAa,YAAY,gBAAgB;AAGpE,QAAI,WAAW,KAAK,aAAa,YAAY,SAAS;AACtD,UAAM,WAAW,KAAK,SAAS,QAAQ,YAAY,MAAM,YAAY,OAAO,QAAQ;AACpF,SAAK,WAAW;AAChB,QAAI,KAAK,SAAS,SAAS,GAAG;AAC5B,WAAK,cAAc;AAGrB,QAAI,WAAW,KAAK,aAAa,YAAY,SAAS;AACtD,QAAI,WAAW,GAAG;AAChB,WAAK,aAAa,KAAK,SAAS,YAAY,OAAO,UAAU,YAAY,OAAO,WAAW,QAAQ;AAGnG,eAAS,IAAI,GAAG,IAAI,YAAY;AAC9B,YAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,YAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAC7C,YAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,YAAI,QAAQ,OAAO,gBAAgB,QAAQ,GAAG;AAE5C,gBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,gBAAM,YAAY,MAAM,aAAa,CAAC;AAGtC,gBAAM,WAAW,OAAO,KAAK,KAAK,QAAQ;AAC1C,gBAAM,gBAAgB,MAAM,QAAQ;AAGpC,cAAI,kBAAkB,WAAW;AAC/B,kBAAM,cAAc,MAAM,SAAS,CAAC,EAAE,SAAS,MAAM;AACrD,iBAAK,WAAW;AAChB,gBAAI,KAAK,OAAO;AACd,qBAAO,IAAI,uBAAuB,KAAK,QAAQ,EAAE;AAAA,YACnD;AAAA,UACF;AAAA,QACF;AACA,aAAK,IAAI;AAAA,MACX;AAGA,eAAS,IAAI,GAAG,IAAI,YAAY;AAC9B,YAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,YAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAC7C,YAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,YAAI,QAAQ,OAAO,QAAQ;AACzB,cAAI,SAAS;AAEX,iBAAK,SAAS,MAAM,SAAS,MAAM;AAAA;AAEnC,iBAAK,SAAS,MAAM,SAAS,KAAK;AAAA,QACtC,WAAW,QAAQ,OAAO,UAAU;AAElC,cAAI,QAAQ,GAAG;AACb,kBAAM,QAAQ,MAAM,UAAU,CAAC;AAE/B,gBAAI,QAAQ,GAAM;AAChB,mBAAK,gBAAgB,MAAM,aAAa,CAAC;AAAA,YAC3C;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,SAAS;AAEjC,cAAI,QAAQ,GAAG;AACb,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,gBAAI,WAAW,KAAK,QAAQ,IAAI,SAAS;AAEvC,mBAAK,MAAM,MAAM,WAAW,GAAG,OAAO;AAGtC,kBAAI,QAAQ,IAAI,UAAU,GAAG;AAC3B,sBAAM,UAAU,MAAM,UAAU,IAAI,OAAO;AAC3C,oBAAI,WAAW,KAAK,QAAQ,IAAI,UAAU,IAAI,SAAS;AACrD,uBAAK,MAAM,MAAM,WAAW,IAAI,UAAU,GAAG,OAAO;AAAA,gBACtD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,SAAS;AAEjC,cAAI,QAAQ,GAAG;AACb,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,kBAAM,eAAe,MAAM,aAAa,CAAC;AACzC,gBAAI,eAAe,KAAK,QAAQ,IAAI,cAAc;AAChD,mBAAK,YAAY;AACjB,mBAAK,aAAa,MAAM,SAAS,GAAG,IAAI,YAAY,EAAE,SAAS,MAAM;AAAA,YACvE;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,UAAU;AAElC,cAAI,QAAQ,IAAI;AACd,kBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,iBAAK,QAAQ,MAAM,aAAa,CAAC;AACjC,kBAAM,iBAAiB,MAAM,aAAa,CAAC;AAC3C,gBAAI,iBAAiB,KAAK,QAAQ,IAAI,gBAAgB;AACpD,mBAAK,aAAa;AAClB,mBAAK,gBAAgB,MAAM,SAAS,GAAG,IAAI,cAAc,EAAE,SAAS,MAAM;AAAA,YAC5E;AAAA,UACF;AAAA,QACF,WAAW,QAAQ,OAAO,KAAK;AAE7B,cAAI,QAAQ,GAAG;AACb,iBAAK,aAAa,MAAM,aAAa,CAAC;AAEtC,iBAAK,cAAc,MAAM,UAAU,CAAC;AACpC,iBAAK,gBAAgB,MAAM,aAAa,CAAC;AAAA,UAC3C;AAAA,QACF,WAAW,QAAQ,OAAO,YAAY;AACpC,cAAI,QAAQ,uBAAuB;AACjC,gBACE,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,GACrC;AACA,mBAAK,0BAA0B,MAAM,UAAU,CAAC;AAChD,mBAAK,qBAAqB,MAAM,aAAa,CAAC;AAC9C,mBAAK,iBAAiB,MAAM,aAAa,CAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QACF;AAEA,aAAK,IAAI;AAAA,MACX;AAAA,IACF;AAGA,QAAI,SAAS,KAAK,aAAa,YAAY,WAAW;AACtD,QAAI,SAAS;AACX,WAAK,UAAU,KAAK,SAAS,QAAQ,YAAY,OAAO,UAAU,YAAY,OAAO,WAAW,MAAM;AAExG,QAAI,KAAK;AACP,WAAK,gBAAgB;AAGvB,QAAI,UAAU,YAAY,OAAO,WAAW,WAAW;AACvD,WAAO,KAAK,SAAS,OAAO;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,uBAAgC;AAE9B,WAAO,oBAAoB,KAAK,KAAK,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,oBAAoB,QAAgB,QAAwB;AAElE,UAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM;AAIxD,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,eAAe,OAAO,KAAK,WAAW,OAAO;AACnD,UAAM,YAAY,MAAM,YAAY;AAGpC,UAAM,iBAAiB,IAAI,eAAe;AAG1C,WAAO,cAAc,OAAO,cAAc,MAAM;AAChD,WAAO,cAAc,gBAAgB,SAAS,CAAC;AAC/C,WAAO,WAAW,GAAG,SAAS,CAAC;AAC/B,WAAO,cAAc,WAAW,SAAS,CAAC;AAC1C,mBAAe,KAAK,QAAQ,SAAS,CAAC;AAEtC,WAAO,SAAS,IAAI;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAyB;AACvB,QAAI,gBAAgB;AAGpB,UAAM,eAAe,KAAK,qBAAqB;AAE/C,QAAI,cAAc;AAEhB,YAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM,EAAE;AAC1D,sBAAgB,IAAI,iBAAiB;AAAA,IACvC;AAGA,UAAM,QAAQ,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AAC7E,QAAI,OAAO;AACT,uBAAiB;AAAA,IACnB;AAEA,UAAM,eAAe,KAAK,qBAAqB;AAC/C,QAAI,cAAc;AAChB,uBAAiB;AAAA,IACnB;AAEA,UAAM,OAAO,OAAO,MAAM,UAAU,OAAO,KAAK,SAAS,SAAS,aAAa;AAG/E,SAAK,cAAc,UAAU,WAAW,CAAC;AAEzC,UAAM,aAAa,KAAK,cAAc,WAAW,cAAc,kBAAkB;AACjF,SAAK,cAAc,YAAY,UAAU,WAAW;AAEpD,SAAK,cAAc,KAAK,aAAa,GAAG,UAAU,KAAK;AAEvD,SAAK,cAAc,KAAK,WAAW,UAAU,WAAW;AAExD,SAAK,cAAc,KAAK,gBAAgB,GAAG,UAAU,YAAY;AAEjE,SAAK,cAAc,KAAK,eAAe,IAAI,IAAI,KAAK,KAAK,UAAU,GAAG;AAEtE,SAAK,cAAc,KAAK,gBAAgB,UAAU,QAAQ;AAE1D,SAAK,cAAc,KAAK,kBAAkB,UAAU,UAAU;AAE9D,SAAK,cAAc,KAAK,SAAS,QAAQ,UAAU,SAAS;AAE5D,SAAK,cAAc,eAAe,UAAU,SAAS;AAIrD,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,WAAW,OAAO,KAAK,SAAS;AACtC,aAAS,KAAK,MAAM,UAAU,IAAI;AAElC,QAAI,cAAc,UAAU,OAAO,SAAS;AAG5C,QAAI,cAAc;AAChB,oBAAc,KAAK,oBAAoB,MAAM,WAAW;AAAA,IAC1D;AAGA,QAAI,OAAO;AACT,WAAK,cAAc,OAAO,KAAK,WAAW;AAC1C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,cAAc,KAAK,YAAY,cAAc,CAAC;AACnD,WAAK,cAAc,OAAQ,cAAc,CAAC;AAC1C,WAAK,WAAW,KAAK,aAAa,cAAc,CAAC;AACjD,WAAK,cAAc,KAAK,eAAe,cAAc,CAAC;AACtD,qBAAe;AAAA,IACjB;AAEA,QAAI,cAAc;AAChB,WAAK,cAAc,OAAO,YAAY,WAAW;AACjD,WAAK,cAAc,uBAAuB,cAAc,CAAC;AACzD,YAAM,IAAI,cAAc;AACxB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,WAAW,uBAAuB,CAAC,GAAG,IAAI,CAAC;AAAA,MAClD;AACA,WAAK,WAAW,KAAK,yBAAyB,IAAI,CAAC;AACnD,WAAK,cAAc,KAAK,oBAAoB,IAAI,CAAC;AACjD,WAAK,cAAc,KAAK,gBAAgB,IAAI,CAAC;AAC7C,WAAK,cAAc,GAAG,IAAI,CAAC;AAC3B,qBAAe;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAA0B;AAExB,UAAM,aAAa,KAAK,UAAU,OAAO,KAAK,KAAK,SAAS,MAAM,EAAE,SAAS;AAC7E,UAAM,SAAS,KAAK,gBAAgB,IAAI;AACxC,UAAM,YAAY,KAAK,OAAO,KAAK,MAAM,KAAK,IAAI;AAClD,UAAM,YAAY,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,KAAK,IAAI;AAClE,UAAM,YAAY,YAAa,UAAU,SAAS,IAAK;AAGvD,UAAM,aAAa,KAAK,aAAa,KAAK,aACvC,IAAI,IAAI,IAAI,OAAO,WAAW,KAAK,YAAY,MAAM,IAAK;AAG7D,UAAM,cAAc,KAAK,cAAc,KAAK,iBAAiB,KAAK,UAAU,OACzE,IAAI,IAAI,IAAI,IAAI,OAAO,WAAW,KAAK,eAAe,MAAM,IAAK;AAGpE,UAAM,eAAe,KAAK,qBAAqB;AAC/C,QAAI,iBAAiB;AAErB,QAAI,cAAc;AAEhB,YAAM,iBAAiB,OAAO,KAAK,KAAK,UAAU,MAAM,EAAE;AAC1D,uBAAiB,IAAI,iBAAiB;AAAA,IACxC;AAGA,UAAM,QAAQ,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AAC7E,UAAM,SAAS,QAAQ,uBAAuB;AAE9C,UAAM,eAAe,KAAK,qBAAqB;AAC/C,UAAM,SAAS,eAAe,8BAA8B;AAE5D,UAAM,WAAW,SAAS,YAAY,YAAY,aAAa,eAAe,eAAe,iBAAiB,KAAK,SAAS;AAG5H,UAAM,YAAY,KAAK,SAAS,QAAQ,iBAAiB,GAAG;AAC5D,UAAM,WAAW,UAAU;AAG3B,UAAM,OAAO,OAAO,MAAM,YAAY,OAAO,WAAW,aAAa,QAAQ;AAG7E,SAAK,cAAc,YAAY,WAAW,CAAC;AAE3C,SAAK,cAAc,KAAK,YAAY,KAAK,cAAc,KAAK,WAAW,YAAY,QAAQ;AAE3F,UAAM,oBAAoB,KAAK,cAAc,WAAW,cAAc,kBAAkB;AACxF,SAAK,aAAa,KAAK,YAAY,oBAAoB,KAAK,WAAW,YAAY,OAAO;AAE1F,SAAK,aAAa,KAAK,aAAa,GAAG,YAAY,KAAK;AAExD,SAAK,aAAa,KAAK,WAAW,YAAY,UAAU;AAExD,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,YAAY;AAEnE,SAAK,cAAc,KAAK,eAAe,IAAI,IAAI,KAAK,KAAK,YAAY,GAAG;AAExE,SAAK,cAAc,KAAK,gBAAgB,YAAY,QAAQ;AAE5D,SAAK,cAAc,KAAK,kBAAkB,YAAY,UAAU;AAEhE,SAAK,cAAc,KAAK,SAAS,QAAQ,YAAY,SAAS;AAE9D,SAAK,cAAc,UAAU,YAAY,SAAS;AAElD,SAAK,cAAc,YAAY,YAAY,WAAW;AAEtD,SAAK,cAAc,GAAG,YAAY,QAAQ;AAE1C,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,aAAa;AAEpE,SAAK,cAAc,KAAK,gBAAgB,GAAG,YAAY,aAAa;AAEpE,SAAK,cAAc,KAAK,gBAAgB,YAAY,gBAAgB;AAIpE,UAAM,WAAW,OAAO,KAAK,SAAS;AACtC,aAAS,KAAK,MAAM,YAAY,IAAI;AAGpC,QAAI,gBAAgB,YAAY,OAAO;AACvC,QAAI,aAAa,KAAK,KAAK,SAAS;AAClC,YAAM,aAAa,OAAO,KAAK,KAAK,SAAS,MAAM;AACnD,iBAAW,KAAK,MAAM,aAAa;AACnC,uBAAiB;AAAA,IACnB;AAGA,QAAI,cAAc;AAGlB,QAAI,KAAK,eAAe;AACtB,WAAK,cAAc,OAAO,UAAU,WAAW;AAC/C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GAAG,cAAc,CAAC;AACjE,qBAAe;AAAA,IACjB;AAGA,QAAI,WAAW;AACb,WAAK,cAAc,OAAO,QAAQ,WAAW;AAC7C,WAAK,cAAc,UAAU,QAAQ,cAAc,CAAC;AACpD,gBAAU,KAAK,MAAM,cAAc,CAAC;AACpC,qBAAe,IAAI,UAAU;AAAA,IAC/B;AAGA,QAAI,KAAK,OAAO,KAAK,KAAK;AACxB,WAAK,cAAc,OAAO,SAAS,WAAW;AAC9C,WAAK,cAAc,IAAI,cAAc,CAAC;AACtC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,KAAK,cAAc,CAAC;AAC5C,WAAK,WAAW,GAAG,cAAc,EAAE;AACnC,WAAK,cAAc,KAAK,KAAK,cAAc,EAAE;AAC7C,qBAAe;AAAA,IACjB;AAGA,QAAI,KAAK,aAAa,KAAK,YAAY;AACrC,YAAM,YAAY,OAAO,KAAK,KAAK,YAAY,MAAM;AACrD,YAAM,UAAU,IAAI,IAAI,UAAU;AAElC,WAAK,cAAc,OAAO,SAAS,WAAW;AAC9C,WAAK,cAAc,SAAS,cAAc,CAAC;AAC3C,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,UAAU,QAAQ,cAAc,CAAC;AACpD,gBAAU,KAAK,MAAM,cAAc,CAAC;AACpC,qBAAe,IAAI;AAAA,IACrB;AAGA,QAAI,KAAK,cAAc,KAAK,iBAAiB,KAAK,UAAU,MAAM;AAChE,YAAM,cAAc,OAAO,KAAK,KAAK,eAAe,MAAM;AAC1D,YAAM,UAAU,IAAI,IAAI,IAAI,YAAY;AAExC,WAAK,cAAc,OAAO,UAAU,WAAW;AAC/C,WAAK,cAAc,SAAS,cAAc,CAAC;AAC3C,WAAK,WAAW,GAAG,cAAc,CAAC;AAClC,WAAK,cAAc,KAAK,OAAO,cAAc,CAAC;AAC9C,WAAK,cAAc,YAAY,QAAQ,cAAc,CAAC;AACtD,kBAAY,KAAK,MAAM,cAAc,EAAE;AACvC,qBAAe,IAAI;AAAA,IACrB;AAGA,QAAI,cAAc;AAChB,oBAAc,KAAK,oBAAoB,MAAM,WAAW;AAAA,IAC1D;AAGA,QAAI,OAAO;AACT,WAAK,cAAc,OAAO,KAAK,WAAW;AAC1C,WAAK,cAAc,GAAG,cAAc,CAAC;AACrC,WAAK,cAAc,KAAK,YAAY,cAAc,CAAC;AACnD,WAAK,cAAc,OAAQ,cAAc,CAAC;AAC1C,WAAK,WAAW,KAAK,aAAa,cAAc,CAAC;AACjD,WAAK,cAAc,KAAK,eAAe,cAAc,CAAC;AACtD,qBAAe;AAAA,IACjB;AAEA,QAAI,cAAc;AAChB,WAAK,cAAc,OAAO,YAAY,WAAW;AACjD,WAAK,cAAc,uBAAuB,cAAc,CAAC;AACzD,YAAM,IAAI,cAAc;AACxB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,WAAW,uBAAuB,CAAC,GAAG,IAAI,CAAC;AAAA,MAClD;AACA,WAAK,WAAW,KAAK,yBAAyB,IAAI,CAAC;AACnD,WAAK,cAAc,KAAK,oBAAoB,IAAI,CAAC;AACjD,WAAK,cAAc,KAAK,gBAAgB,IAAI,CAAC;AAC7C,WAAK,cAAc,GAAG,IAAI,CAAC;AAC3B,qBAAe;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,MAAoB;AAC9B,QAAI,CAAC,KAAM,QAAO;AAMlB,UAAM,OAAO,KAAK,YAAY,IAAI;AAClC,UAAM,QAAQ,KAAK,SAAS,IAAI;AAChC,UAAM,MAAM,KAAK,QAAQ;AACzB,UAAM,OAAO,KAAK,SAAS;AAC3B,UAAM,SAAS,KAAK,WAAW;AAC/B,UAAM,SAAS,KAAK,WAAW;AAG/B,UAAM,YAAa,OAAO,QAAS,KAAO,QAAQ,OAAS,IAAM,MAAM;AAGvE,UAAM,YAAa,OAAO,OAAS,MAAQ,SAAS,OAAS,IAAO,UAAU,IAAK;AAGnF,UAAM,OAAQ,YAAY,KAAM;AAEhC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,WAAgC;AAC5C,QAAI,aAAa;AACf,aAAO;AAGT,UAAM,WAAY,aAAa,KAAM;AACrC,UAAM,QAAS,YAAY,IAAK,OAAQ;AACxC,UAAM,SAAU,YAAY,IAAK,MAAQ;AACzC,UAAM,MAAM,WAAW;AAGvB,UAAM,WAAW,YAAY;AAC7B,UAAM,OAAQ,YAAY,KAAM;AAChC,UAAM,SAAU,YAAY,IAAK;AACjC,UAAM,UAAU,WAAW,OAAS;AAEpC,WAAO,IAAI,KAAK,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA4B;AAC1B,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,cAAc,KAAM,QAAO;AAE/B,WAAO,UAAU,mBAAmB,SAAS;AAAA,MAC3C,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,IACP,CAAC,EAAE,MAAM,GAAE,EAAE;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAuB;AACrB,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,cAAc,KAAM,QAAO;AAE/B,WAAO,UAAU,aAAa,EAAE,MAAM,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,wBAAgC;AAC9B,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,aAAa,KAAM,QAAO;AAE9B,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,IACP,CAAC;AAED,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV,CAAC;AAED,WAAO,GAAG,QAAQ,IAAI,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAAmC;AACjC,QAAI,YAAY,KAAK,cAAc,KAAK,WAAW;AACnD,QAAI,aAAa,KAAM,QAAO;AAE9B,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,MACL,UAAU;AAAA,IACZ,CAAC;AAED,UAAM,WAAW,UAAU,mBAAmB,SAAS;AAAA,MACrD,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,IACZ,CAAC;AAED,WAAO,GAAG,QAAQ,IAAI,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAA4B;AAC1B,YAAQ,KAAK,WAAW;AAAA,MACtB,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AACd,gBAAQ,KAAK,WAAW,GAAK;AAAA,UAC3B,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA;AAAA,UACf,KAAK;AAAG,mBAAO;AAAA,QACjB;AAAA,MACF,KAAK,WAAW;AAAkB,eAAO;AAAA,MACzC,KAAK,WAAW;AAAW,eAAO;AAAA,MAClC,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AACd,eAAO,KAAK,gBAAgB,IAAI,YACzB,KAAK,gBAAgB,IAAI,YACzB,KAAK,gBAAgB,IAAI,YAAY;AAAA,MAE9C;AAAS,eAAO;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAA6B;AAC3B,YAAQ,KAAK,aAAa,GAAG;AAAA,MAC3B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAS,eAAO;AAAA,MACjC,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAK,eAAO;AAAA,MAC7B,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAM,eAAO;AAAA,MAC9B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC,KAAK,YAAY;AAAO,eAAO;AAAA,MAC/B,KAAK,YAAY;AAAQ,eAAO;AAAA,MAChC;AAAS,eAAO;AAAA,IAClB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,8BAA8B,QAAwB;AAC5D,QAAI,SAAS,GAAG;AACd,aAAO;AAAA,IACT;AACA,YAAQ,QAAQ;AAAA,MACd,KAAK,WAAW;AAAQ,eAAO;AAAA,MAC/B,KAAK,WAAW;AAAU,eAAO;AAAA,MACjC,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AAAO,eAAO;AAAA,MAC9B,KAAK,WAAW;AAAM,eAAO;AAAA,MAC7B,KAAK,WAAW;AAAa,eAAO;AAAA,MACpC;AACE,eAAO,QAAQ,MAAM;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,uBAA6B;AACnC,UAAM,aAAa,KAAK,WAAW,QAAQ,eAAe;AAC1D,UAAM,UAAU,KAAK,WAAW,QAAQ,oBAAoB;AAE5D,WAAO,IAAI,+CAA+C;AAC1D,WAAO;AAAA,MAAI;AAAA,MACT,kBAAkB,SAAS,yBAAyB,MAAM;AAAA,IAAE;AAE9D,UAAM,YAAY,KAAK,cAAc,WAAW,eAAe,KAAK,aAAa;AACjF,UAAM,aAAa,CAAC,aAAa,KAAK,qBAAqB;AAE3D,QAAI,WAAW;AACb,aAAO,IAAI,iDAAiD,oEAAoE;AAChI,aAAO;AAAA,QAAI;AAAA,QACT,KAAK,eAAe,IAChB,qFACA;AAAA,MAA6D;AACnE,YAAM,gBACJ,KAAK,gBAAgB,IAAI,0CACvB,KAAK,gBAAgB,IAAI,gBACzB,KAAK,gBAAgB,IAAI,gBACzB,YAAY,KAAK,WAAW;AAChC,aAAO,IAAI,iDAAiD,aAAa;AACzE,aAAO;AAAA,QAAI;AAAA,QACT,KAAK,8BAA8B,KAAK,aAAa;AAAA,MAAC;AACxD,aAAO;AAAA,QAAI;AAAA,QACT;AAAA,MAAoF;AACtF,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,gBAAgB,gBAAgB,sBAAsB,iDAAiD,kBAAkB;AAAA,MAA+C;AAC7K,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,KAAK,UAAU,GAAG,KAAK,eAAe,kBAAkB,kCAA6B,EAAE;AAAA,MAAE;AAC9F,UAAI,CAAC,QAAQ;AACX,eAAO,IAAI,iDAAiD,sDAAsD;AAAA,MACpH,OAAO;AACL,eAAO,IAAI,kDAAkD,uFAAkF;AAAA,MACjJ;AAAA,IACF,WAAW,YAAY;AACrB,aAAO,IAAI,iDAAiD,yFAAyF;AACrJ,aAAO;AAAA,QAAI;AAAA,QACT,GAAG,KAAK,uBAAuB,MAAM,KAAK,kBAAkB,MAAM,KAAK,cAAc;AAAA,MAAE;AACzF,aAAO,IAAI,iDAAiD,KAAK,8BAA8B,KAAK,SAAS,CAAC;AAC9G,aAAO;AAAA,QAAI;AAAA,QACT,kCAAkC,gBAAgB,gBAAgB,sBAAsB,4CAA4C,kBAAkB;AAAA,MAAY;AACpK,aAAO,IAAI,iDAAiD,4CAA4C;AAAA,IAC1G,WAAW,WAAW;AACpB,UAAI,QAAQ;AACV,eAAO,IAAI,iDAAiD,4FAAuF;AAAA,MACrJ,OAAO;AACL,eAAO,IAAI,iDAAiD,yEAA+D;AAAA,MAC7H;AACA,aAAO,IAAI,iDAAiD,GAAG,KAAK,kBAAkB,CAAC,KAAK,KAAK,SAAS,GAAG;AAAA,IAC/G,OAAO;AACL,aAAO,IAAI,iDAAiD,eAAe;AAAA,IAC7E;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBAAgC;AACtC,QAAI,UAAU,KAAK,cAAc;AACjC,QAAI,YAAY,EAAG,QAAO;AAC1B,QAAI,QAAQ;AACZ,aAAU,UAAU,cAAc,WAAY,MAAM;AACpD,aAAU,UAAU,cAAc,SAAY,MAAM;AACpD,aAAU,UAAU,cAAc,SAAY,MAAM;AAEpD,aAAU,UAAU,cAAc,YAAc,MAAM;AACtD,aAAU,UAAU,cAAc,UAAY,MAAM;AACpD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAkB;AAChB,WAAO,IAAI,wCAAwC,KAAK,QAAQ;AAChE,WAAO,IAAI,iCAAiC,KAAK,cAAc;AAC/D,WAAO,IAAI,kDAAkD,KAAK,mBAAmB,CAAC;AACtF,WAAO,IAAI,kDAAkD,KAAK,SAAS;AAC3E,WAAO,IAAI,kDAAkD,KAAK,kBAAkB,CAAC;AACrF,WAAO;AAAA,MAAI;AAAA,MACT,KAAK,WAAW,QAAQ,YACtB,KAAK,WAAW,QAAQ,iBAAiB,mBAAmB,cAC5D;AAAA,IAAe;AACnB,SAAK,qBAAqB;AAC1B,WAAO,IAAI,kDAAkD,KAAK,sBAAsB,CAAC;AACzF,WAAO,IAAI,kDAAkD,KAAK,yBAAyB,CAAC;AAC5F,WAAO,IAAI,kDAAkD,KAAK,cAAc;AAChF,WAAO,IAAI,kDAAkD,KAAK,gBAAgB;AAClF,WAAO,IAAI,kDAAkD,KAAK,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AACrG,WAAO,IAAI,kDAAkD,KAAK,YAAY,UAAU,CAAC;AACzF,WAAO,IAAI,kDAAkD,KAAK,SAAS,UAAU,CAAC;AACtF,WAAO,IAAI,gDAAgD;AAC3D,WAAO,IAAI,kDAAkD,KAAK,sBAAsB,CAAC;AACzF,QAAI,KAAK,YAAY;AACnB,aAAO,IAAI,+CAA+C;AAC1D,UAAI;AACF,iBAAS,IAAI,GAAG,IAAI,KAAK,WAAW,UAAU;AAE5C,cAAI,IAAI,IAAI,KAAK,WAAW,QAAQ;AAClC,mBAAO,IAAI,+CAA+C,CAAC,EAAE;AAC7D;AAAA,UACF;AAEA,cAAI,MAAM,KAAK,WAAW,aAAa,CAAC;AACxC,cAAI,SAAS,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC7C,cAAI,OAAO,KAAK,WAAW,aAAa,IAAI,CAAC;AAG7C,cAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,WAAW,QAAQ;AACrD,mBAAO,IAAI,2CAA2C,IAAI,eAAe,CAAC,WAAW,MAAM,EAAE;AAC7F;AAAA,UACF;AAEA,cAAI,QAAQ,KAAK,WAAW,SAAS,IAAI,GAAG,IAAI,IAAI,IAAI;AAExD,cAAI;AACF,gBAAI,QAAQ,OAAO,QAAQ;AACzB,qBAAO,IAAI,WAAW,MAAM,oBAAoB,MAAM,SAAS,KAAK,CAAC,EAAE;AAAA,YACzE,WAAW,QAAQ,OAAO,UAAU;AAClC,kBAAI,QAAQ,GAAG;AACb,sBAAM,QAAQ,MAAM,UAAU,CAAC;AAC/B,sBAAM,YAAY,MAAM,aAAa,CAAC;AACtC,sBAAM,OAAO,IAAI,KAAK,YAAY,GAAI;AACtC,uBAAO,IAAI,WAAW,MAAM,2BAA2B,KAAK,UAAU,KAAK,YAAY,CAAC,EAAE;AAAA,cAC5F,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,qCAAqC,IAAI,GAAG;AAAA,cAC1E;AAAA,YACF,WAAW,QAAQ,OAAO,SAAS;AACjC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,oBAAI,IAAI,UAAU,MAAM;AACtB,yBAAO,IAAI,WAAW,MAAM,qCAAqC,OAAO,GAAG;AAAA,gBAC7E,OAAO;AACL,wBAAM,MAAM,MAAM,WAAW,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC;AACpD,sBAAI,MAAM;AACV,sBAAI,IAAI,UAAU,IAAI,MAAM;AAC1B,0BAAM,UAAU,MAAM,UAAU,IAAI,OAAO;AAC3C,wBAAI,IAAI,UAAU,IAAI,WAAW,MAAM;AACrC,4BAAM,MAAM,WAAW,IAAI,UAAU,GAAG,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA,oBAC9D;AAAA,kBACF;AACA,yBAAO,IAAI,WAAW,MAAM,2BAA2B,OAAO,SAAS,GAAG,SAAS,GAAG,EAAE;AAAA,gBAC1F;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,mCAAmC,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,WAAW,QAAQ,OAAO,SAAS;AACjC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,eAAe,MAAM,aAAa,CAAC;AACzC,oBAAI,eAAe,KAAK,QAAQ,IAAI,cAAc;AAChD,wBAAM,SAAS,MAAM,SAAS,GAAG,IAAI,YAAY,EAAE,SAAS,MAAM;AAClE,yBAAO,IAAI,WAAW,MAAM,4BAA4B,OAAO,aAAa,MAAM,GAAG;AAAA,gBACvF,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,2CAA2C,YAAY,GAAG;AAAA,gBACxF;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,oCAAoC,IAAI,GAAG;AAAA,cACzE;AAAA,YACF,WAAW,QAAQ,OAAO,UAAU;AAClC,kBAAI,QAAQ,IAAI;AACd,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,QAAQ,MAAM,aAAa,CAAC;AAClC,sBAAM,iBAAiB,MAAM,aAAa,CAAC;AAC3C,oBAAI,iBAAiB,KAAK,QAAQ,IAAI,gBAAgB;AACpD,wBAAM,WAAW,MAAM,SAAS,GAAG,IAAI,cAAc,EAAE,SAAS,MAAM;AACtE,yBAAO,IAAI,WAAW,MAAM,wBAAwB,OAAO,WAAW,KAAK,eAAe,QAAQ,GAAG;AAAA,gBACvG,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,yCAAyC,cAAc,GAAG;AAAA,gBACxF;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,gCAAgC,IAAI,GAAG;AAAA,cACrE;AAAA,YACF,WAAW,QAAQ,OAAO,cAAc;AACtC,kBAAI,QAAQ,GAAG;AACb,sBAAM,UAAU,MAAM,UAAU,CAAC;AACjC,sBAAM,YAAY,MAAM,aAAa,CAAC;AACtC,sBAAM,cAAc,MAAM,SAAS,CAAC,EAAE,SAAS,MAAM;AAGrD,sBAAM,WAAW,OAAO,KAAK,KAAK,QAAQ;AAC1C,sBAAM,gBAAgB,MAAM,QAAQ;AAEpC,sBAAM,WAAW,cAAc,gBAAgB,UAAU;AAEzD,uBAAO,IAAI,WAAW,MAAM,2BAA2B,OAAO,WAAW,UAAU,SAAS,EAAE,CAAC,KAAK,QAAQ,GAAG;AAC/G,uBAAO,IAAI,gCAAgC,WAAW,GAAG;AAAA,cAC3D,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,mCAAmC,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,WAAW,QAAQ,OAAO,KAAK;AAC7B,kBAAI,QAAQ,GAAG;AACb,sBAAM,gBAAgB,MAAM,aAAa,CAAC;AAC1C,sBAAM,WAAW,OAAO,aAAa,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACvD,sBAAM,WAAW,MAAM,UAAU,CAAC;AAClC,sBAAM,aAAa,MAAM,aAAa,CAAC;AACvC,sBAAM,cAAc,aAAa,IAAI,YAAY,aAAa,IAAI,YAAY,aAAa,IAAI,YAAY;AAC3G,sBAAM,UAAU,kBAAkB,IAAI,4BAA4B,kBAAkB,IAAI,oCAAoC,aAAa,aAAa;AACtJ,uBAAO,IAAI,WAAW,MAAM,iBAAiB,OAAO,aAAa,QAAQ,eAAe,WAAW,2BAA2B,UAAU,EAAE;AAAA,cAC5I,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,iCAAiC,IAAI,GAAG;AAAA,cACtE;AAAA,YACF,WAAW,QAAQ,OAAO,YAAY;AACpC,kBAAI,QAAQ,uBAAuB;AACjC,oBACE,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,KACrC,MAAM,CAAC,MAAM,uBAAuB,CAAC,GACrC;AACA,wBAAM,KAAK,MAAM,UAAU,CAAC;AAC5B,wBAAM,MAAM,MAAM,aAAa,CAAC;AAChC,wBAAM,MAAM,MAAM,aAAa,CAAC;AAChC,yBAAO,IAAI,WAAW,MAAM,4BAA4B,EAAE,eAAe,GAAG,WAAW,GAAG,EAAE;AAAA,gBAC9F,OAAO;AACL,yBAAO,IAAI,WAAW,MAAM,+BAA+B;AAAA,gBAC7D;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,WAAW,MAAM,iCAAiC,IAAI,GAAG;AAAA,cACtE;AAAA,YACF,WAAW,QAAQ,OAAO,OAAO;AAE/B,qBAAO,IAAI,WAAW,MAAM,+BAA+B;AAC3D,kBAAI,QAAQ,GAAG;AACb,oBAAI,SAAS;AAGb,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,mBAAmB,MAAM,gBAAgB,MAAM;AACrD,yBAAO,IAAI,mCAAmC,iBAAiB,SAAS,CAAC,QAAQ;AACjF,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,iBAAiB,MAAM,gBAAgB,MAAM;AACnD,yBAAO,IAAI,iCAAiC,eAAe,SAAS,CAAC,QAAQ;AAC7E,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,oBAAoB,MAAM,gBAAgB,MAAM;AACtD,yBAAO,IAAI,qCAAqC,kBAAkB,SAAS,CAAC,EAAE;AAC9E,4BAAU;AAAA,gBACZ;AAGA,oBAAI,SAAS,KAAK,MAAM;AACtB,wBAAM,aAAa,MAAM,aAAa,MAAM;AAC5C,yBAAO,IAAI,6BAA6B,UAAU,EAAE;AAAA,gBACtD;AAAA,cACF,OAAO;AACL,uBAAO,IAAI,oDAAoD,IAAI,GAAG;AAAA,cACxE;AAAA,YACF,OAAO;AAEL,oBAAM,UAAU,OAAO,IACnB,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,SAAS,KAAK,IACjD;AACJ,qBAAO,IAAI,WAAW,MAAM,2BAA2B,IAAI,SAAS,UAAU,YAAY,UAAU,QAAQ,EAAE,EAAE;AAAA,YAClH;AAAA,UACF,SAAS,OAAY;AACnB,mBAAO,IAAI,qCAAqC,MAAM,MAAM,MAAM,OAAO,EAAE;AAAA,UAC7E;AAEA,eAAK,IAAI;AAAA,QACX;AAAA,MACF,SAAS,OAAY;AACnB,eAAO,IAAI,kCAAkC,MAAM,OAAO,EAAE;AAAA,MAC9D;AAAA,IACF;AACA,WAAO,IAAI,IAAI;AAAA,EACjB;AACF;;;AC1mCO,IAAM,iBAAgC;AAAA,EAC3C,SAAS;AAAA,EACT,aAAa;AACf;;;ACPA,IAAM,2BACJ;AAGF,SAAS,cAAqB;AAC5B,QAAM,IAAI,MAAM,wBAAwB;AAC1C;AAEO,SAAS,wBAAiC;AAC/C,SAAO;AACT;AAEO,SAAS,oBAAoB,QAAwB;AAC1D,SAAO,YAAY;AACrB;AAEO,SAAS,wBAAwB,QAAwB;AAC9D,SAAO,YAAY;AACrB;AAEO,SAAS,4BAAmC;AACjD,SAAO,YAAY;AACrB;AAEA,eAAsB,SAAS,OAAe,QAAkC;AAC9E,SAAO,YAAY;AACrB;AAEA,eAAsB,WAAW,OAAgC;AAC/D,SAAO,YAAY;AACrB;AAEO,SAAS,aAAa,OAAe,QAAyB;AACnE,SAAO,YAAY;AACrB;AAEO,SAAS,eAAe,OAAuB;AACpD,SAAO,YAAY;AACrB;AAEA,eAAsB,eACpB,YACA,YACA,YACA,QACA,eACA,oBACiB;AACjB,SAAO,YAAY;AACrB;AAEA,gBAAuB,iBACrB,mBACwB;AACxB,cAAY;AACd;AAEO,IAAM,WAAW;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;;;AC9BO,IAAM,iBAAN,MAAM,gBAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA+B1B,YAAY,SAGT;AAhCH;AAAA,SAAQ,aAAqB,CAAC;AAC9B,SAAQ,aAAiC;AAEzC;AAAA,SAAQ,iBAAqC;AAC7C,SAAQ,YAAqB;AAG7B;AAAA,SAAQ,SAAmB,CAAC;AAC5B,SAAQ,YAAoB,OAAO,MAAM,IAAI,CAAC;AAC9C,SAAQ,qBAA8B;AAGtC;AAAA,SAAQ,eAAyB,CAAC;AAClC,SAAQ,eAA2B,CAAC;AACpC,SAAQ,gBAAmC;AAAA,MACzC,YAAY;AAAA;AAAA,MAEZ,YAAY;AAAA,MACZ,WAAW;AAAA;AAAA,MAEX,cAAc;AAAA,IAChB;AAYE,SAAK,YAAY,SAAS,aAAa;AACvC,SAAK,qBAAqB,SAAS,sBAAsB;AAEzD,QAAI,KAAK,WAAW;AAClB,WAAK,aAAoB,WAAW,QAAQ;AAC5C,WAAK,iBAAwB,WAAW,QAAQ;AAChD,WAAK,eAAe,OAAO,OAAO,KAAK,CAAC,CAAI,CAAC,CAAC;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,OAAO,OAAqB;AAE1B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAK,aAAa,YAAY,KAAK,YAAY,MAAM,CAAC,CAAC;AAAA,IACzD;AAGA,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,OAAO,KAAK;AAAA,IAC9B;AACA,QAAI,KAAK,gBAAgB;AACvB,WAAK,eAAe,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAwB;AACtB,WAAO,CAAC,KAAK,eAAe;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAgC;AAC9B,QAAI,KAAK,YAAY;AACnB,aAAO,KAAK,WAAW,OAAO,KAAK;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,uBAAsC;AACpC,QAAI,KAAK,gBAAgB;AACvB,aAAO,KAAK,eAAe,OAAO,KAAK;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aACE,OAKA,SACM;AACN,QAAI,QAAQ,QAAQ;AAClB,YAAM,MAAM,KAAK,cAAc;AAAA,IACjC;AACA,QAAI,QAAQ,WAAW;AACrB,YAAM,SAAS,KAAK,eAAe;AACnC,YAAM,OAAO,KAAK,qBAAqB;AACvC,UAAI,QAAQ;AACV,cAAM,SAAS;AAAA,MACjB;AACA,UAAI,MAAM;AACR,cAAM,eAAe;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,aAAa,CAAC;AACnB,QAAI,KAAK,WAAW;AAClB,WAAK,aAAoB,WAAW,QAAQ;AAC5C,WAAK,iBAAwB,WAAW,QAAQ;AAChD,WAAK,eAAe,OAAO,OAAO,KAAK,CAAC,CAAI,CAAC,CAAC;AAAA,IAChD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,MAA6B;AACnC,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAGA,UAAM,aAAa,OAAO,SAAS,WAC/B,OAAO,KAAK,MAAM,KAAK,IACvB;AAGJ,SAAK,OAAO,KAAK,UAAU;AAC3B,SAAK,aAAa,KAAK,UAAU;AAGjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,WAAK,UAAU,CAAC,KAAK,WAAW,CAAC;AAAA,IACnC;AAGA,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAkB;AAChB,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,WAAO,KAAK,UAAU,SAAS,KAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAA4B;AAC1B,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAEA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,aAAO;AAAA,IACT;AAGA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,kBAAkB;AAAA,IACzB;AAEA,UAAM,OAAO,KAAK,aAAa,KAAK,aAAa,SAAS,CAAC;AAC3D,QAAI,QAAQ,KAAK,SAAS,GAAG;AAC3B,aAAO,KAAK,CAAC,EAAE,SAAS,KAAK;AAAA,IAC/B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAoB;AAClB,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AACA,SAAK,SAAS,CAAC;AACf,SAAK,eAAe,CAAC;AACrB,SAAK,eAAe,CAAC;AACrB,SAAK,YAAY,OAAO,MAAM,IAAI,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,eAAe,SAAmD;AACvE,UAAM,aAAa,IAAI,gBAAe,EAAE,oBAAoB,KAAK,CAAC;AAGlE,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,YAAY;AACrB,mBAAW,QAAQ,OAAO,UAAU;AAAA,MACtC;AAAA,IACF;AAEA,WAAO,WAAW,WAAW;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,KAAK,MAAsB;AACjC,WAAc,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,aAAa,MAAc,OAAuB;AACxD,QAAI,KAAK,cAAc,aAAa,OAAO,QAAQ,MAAM,KAAK,IAAI,GAAG;AACnE,OAAC,MAAM,KAAK,IAAI,CAAC,OAAO,IAAI;AAAA,IAC9B;AAEA,WAAO,KAAK,KAAK,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,OAAuB;AAC1C,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,aAAa,KAAK,aAAa;AACrC,WAAK,aAAa,KAAK,CAAC,CAAC;AAGzB,eAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG;AAC5C,cAAM,OAAO,MAAM,CAAC;AACpB,cAAM,QAAQ,MAAM,IAAI,CAAC;AACzB,cAAM,OAAO,KAAK,aAAa,MAAM,KAAK;AAC1C,aAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,MACzC;AAGA,UAAI,MAAM,SAAS,MAAM,GAAG;AAC1B,cAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,YAAI,KAAK,cAAc,cAAc;AAEnC,gBAAM,OAAO,KAAK,aAAa,MAAM,IAAI;AACzC,eAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,QACzC,OAAO;AAEL,eAAK,aAAa,UAAU,EAAE,KAAK,IAAI;AAAA,QACzC;AAAA,MACF;AAEA,cAAQ,KAAK,aAAa,UAAU;AAAA,IACtC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAA0B;AAChC,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,eAAe,CAAC;AACrB;AAAA,IACF;AAGA,UAAM,kBAAkB,KAAK,aAAa,IAAI,UAAQ;AACpD,UAAI,KAAK,cAAc,YAAY;AACjC,eAAO,KAAK,KAAK,IAAI;AAAA,MACvB;AACA,aAAO,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI;AAAA,IACxD,CAAC;AAED,QAAI,KAAK,cAAc,YAAY;AACjC,sBAAgB,KAAK,OAAO,OAAO;AAAA,IACrC;AAEA,SAAK,eAAe,CAAC,eAAe;AACpC,SAAK,aAAa,eAAe;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAS,MAAwB;AAC/B,QAAI,CAAC,KAAK,oBAAoB;AAC5B,YAAM,IAAI,MAAM,6EAA6E;AAAA,IAC/F;AAEA,QAAI,KAAK,aAAa,WAAW,GAAG;AAClC,WAAK,kBAAkB;AAAA,IACzB;AAEA,QAAI,QAAQ,KAAK,aAAa,UAAU,UAAQ,KAAK,OAAO,IAAI,CAAC;AACjE,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI,MAAM,wBAAwB;AAAA,IAC1C;AAEA,WAAO,KAAK,aAAa,OAAO,CAAC,OAAO,UAAU;AAChD,UAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,YAAM,YAAY,QAAQ,MAAM,IAAI,QAAQ,IAAI,QAAQ;AACxD,UAAI,YAAY,MAAM,QAAQ;AAC5B,cAAM,KAAK,MAAM,SAAS,CAAC;AAAA,MAC7B;AAEA,cAAQ,KAAK,MAAM,QAAQ,CAAC;AAC5B,aAAO;AAAA,IACT,GAAG,CAAC,CAAa;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,OAAiB,YAAoB,MAAuB;AACjE,QAAI,eAAe;AAEnB,eAAW,gBAAgB,OAAO;AAChC,qBAAe,OAAO,QAAQ,cAAc,YAAY,KAAK,IACzD,KAAK,aAAa,cAAc,YAAY,IAC5C,KAAK,aAAa,cAAc,YAAY;AAAA,IAClD;AAEA,WAAO,aAAa,OAAO,IAAI;AAAA,EACjC;AACF;AAGA,IAAO,yBAAQ;;;ACpZf,IAAM,uBAAuB,IAAI,kBAAkB;AACnD,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AASvB,IAAM,eAAN,MAAM,cAAa;AAAA,EAMjB,YAAY,QAAgB;AAC1B,SAAK,SAAS;AACd,SAAK,UAAU,OAAO,MAAM,cAAc;AAC1C,SAAK,QAAQ,CAAC,IAAI;AAClB,SAAK,YAAY,KAAK,eAAe;AACrC,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,QAAQ,MAAsB;AAC5B,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,UAAM,SAAS,OAAO,MAAM,KAAK,MAAM;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,KAAK,SAAS,gBAAgB;AAChC,sBAAa,mBAAmB,KAAK,OAAO;AAC5C,aAAK,YAAY,KAAK,eAAe;AACrC,aAAK,QAAQ;AAAA,MACf;AACA,aAAO,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,KAAK,OAAO;AAAA,IACnD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,iBAAyB;AAC/B,UAAM,SAAgB,eAAe,eAAe,KAAK,QAAQ,IAAI;AACrE,WAAO,eAAe,KAAK;AAC3B,WAAO,OAAO,OAAO,KAAK,OAAO;AAAA,EACnC;AAAA,EAEA,OAAO,mBAAmB,SAAuB;AAC/C,aAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,UAAI,QAAQ,CAAC,MAAM,KAAK;AACtB,gBAAQ,CAAC,IAAI;AAAA,MACf,OAAO;AACL,gBAAQ,CAAC;AACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAOO,IAAM,eAAN,MAAmB;AAAA,EAQxB,YAAY,UAAkB;AAH9B,SAAQ,aAAa;AACrB,SAAQ,WAAW;AAGjB,SAAK,OAAc,YAAY,gBAAgB;AAC/C,SAAK,OAAO,UAAU,WAAW,UAAU,KAAK,IAAI;AACpD,SAAK,MAAM,IAAI,aAAa,KAAK,KAAK,MAAM;AAC5C,SAAK,OAAc,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,EACzD;AAAA;AAAA,EAGA,SAAiB;AACf,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,SAAK,aAAa;AAClB,WAAO,OAAO,OAAO,CAAC,KAAK,MAAM,KAAK,KAAK,gBAAgB,CAAC;AAAA,EAC9D;AAAA;AAAA,EAGA,OAAO,OAAuB;AAC5B,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,QAAI,CAAC,KAAK,YAAY;AACpB,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,UAAM,SAAS,KAAK,IAAI,QAAQ,KAAK;AACrC,SAAK,KAAK,OAAO,MAAM;AACvB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,SAAiB;AACf,QAAI,KAAK,UAAU;AACjB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,QAAI,CAAC,KAAK,YAAY;AACpB,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,SAAK,WAAW;AAChB,WAAO,KAAK,KAAK,OAAO,EAAE,SAAS,GAAG,kBAAkB;AAAA,EAC1D;AACF;AAMO,IAAM,eAAN,MAAmB;AAAA,EAYxB,YAAY,UAAkB,gBAAwB;AARtD,SAAQ,OAA2B;AACnC,SAAQ,MAA2B;AACnC,SAAQ,OAA2B;AACnC,SAAQ,YAAY,OAAO,MAAM,CAAC;AAClC,SAAQ,UAAU,OAAO,MAAM,CAAC;AAChC,SAAQ,aAAa;AACrB,SAAQ,WAAW;AAGjB,QAAI,iBAAiB,cAAc;AACjC,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AACA,SAAK,WAAW;AAChB,SAAK,YAAY,iBAAiB;AAClC,SAAK,kBAAkB,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAK,OAAuB;AAC1B,QAAI,OAAO;AACX,QAAI,CAAC,KAAK,YAAY;AACpB,WAAK,YAAY,OAAO,OAAO,CAAC,KAAK,WAAW,IAAI,CAAC;AACrD,YAAM,OAAO,mBAAmB;AAChC,UAAI,KAAK,UAAU,SAAS,MAAM;AAChC,eAAO,OAAO,MAAM,CAAC;AAAA,MACvB;AACA,YAAM,OAAO,KAAK,UAAU,SAAS,GAAG,gBAAgB;AACxD,YAAM,iBAAiB,KAAK,UAAU,SAAS,kBAAkB,IAAI;AACrE,WAAK,OAAO,UAAU,WAAW,KAAK,UAAU,IAAI;AACpD,UAAI,CAAC,KAAK,KAAK,iBAAiB,OAAO,cAAc,GAAG;AACtD,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,WAAK,MAAM,IAAI,aAAa,KAAK,KAAK,MAAM;AAC5C,WAAK,OAAc,WAAW,QAAQ,KAAK,KAAK,OAAO;AACvD,WAAK,aAAa;AAClB,aAAO,KAAK,UAAU,SAAS,IAAI;AACnC,WAAK,YAAY,OAAO,MAAM,CAAC;AAAA,IACjC;AAEA,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,UAAM,aAAa,KAAK,IAAI,KAAK,QAAQ,KAAK,eAAe;AAC7D,UAAM,aAAa,KAAK,SAAS,GAAG,UAAU;AAC9C,UAAM,OAAO,KAAK,SAAS,UAAU;AACrC,QAAI,KAAK,SAAS,GAAG;AACnB,WAAK,UAAU,OAAO,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC;AAAA,IACnD;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,WAAK,UAAU;AACf,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,SAAK,KAAM,OAAO,UAAU;AAC5B,UAAM,QAAQ,KAAK,IAAK,QAAQ,UAAU;AAC1C,SAAK,mBAAmB,WAAW;AACnC,SAAK,UAAU;AACf,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAY;AACV,QAAI,KAAK,kBAAkB,GAAG;AAC5B,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,SAAK,UAAU;AACf,QAAI,CAAC,KAAK,UAAU;AAClB,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AAAA,EACF;AAAA,EAEQ,YAAkB;AACxB,QAAI,KAAK,YAAY,KAAK,kBAAkB,KAAK,CAAC,KAAK,MAAM;AAC3D;AAAA,IACF;AACA,QAAI,KAAK,QAAQ,SAAS,oBAAoB;AAC5C;AAAA,IACF;AACA,UAAM,SAAS,KAAK,QAAQ,SAAS,GAAG,kBAAkB;AAC1D,UAAM,aAAa,KAAK,KAAK,OAAO,EAAE,SAAS,GAAG,kBAAkB;AACpE,QAAI,CAAC,WAAW,OAAO,MAAM,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,SAAK,WAAW;AAAA,EAClB;AACF;AAQO,IAAM,YAAN,MAAM,WAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKrB,OAAO,WAAW,UAA2B,MAA2B;AACtE,UAAM,MAAM,OAAO,SAAS,QAAQ,IAAI,WAAW,OAAO,KAAK,QAAQ;AACvE,UAAM,eAAsB;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,QAAQ,aAAa,SAAS,GAAG,eAAe;AAAA,MAChD,SAAS,aAAa,SAAS,iBAAiB,IAAI,eAAe;AAAA,MACnE,kBAAkB,aAAa,SAAS,IAAI,eAAe;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,gBAAgB,UAAgC;AACrD,WAAO,IAAI,aAAa,QAAQ;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,gBAAgB,UAAkB,gBAAsC;AAC7E,WAAO,IAAI,aAAa,UAAU,cAAc;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,cAAc,OAAiB,gBAAwB,UAA0B;AACtF,SAAK;AACL,UAAM,MAAM,WAAU,gBAAgB,QAAQ;AAC9C,UAAM,QAAQ,CAAC,IAAI,OAAO,CAAC;AAC3B,QAAI,eAAe,SAAS,GAAG;AAC7B,YAAM,KAAK,IAAI,OAAO,cAAc,CAAC;AAAA,IACvC;AACA,UAAM,KAAK,IAAI,OAAO,CAAC;AACvB,WAAO,OAAO,OAAO,KAAK;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,cAAc,OAAiB,aAAqB,UAA0B;AACnF,SAAK;AACL,UAAM,MAAM,WAAU,gBAAgB,UAAU,YAAY,MAAM;AAClE,UAAM,MAAM,IAAI,KAAK,WAAW;AAChC,QAAI,IAAI;AACR,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,cACZ,UACA,gBACA,iBACwB;AACxB,UAAM,MAAM,WAAU,gBAAgB,UAAU,cAAc;AAC9D,qBAAiB,SAAS,iBAAiB;AACzC,YAAM,QAAQ,IAAI,KAAK,KAAK;AAC5B,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM;AAAA,MACR;AAAA,IACF;AACA,QAAI,IAAI;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,mBAAmB,YAAoB,gBAAwB,GAAW;AAC/E,UAAM,MAAM,OAAO,MAAM,oBAAoB;AAC7C,QAAI,cAAc,OAAO,KAAK,CAAC;AAC/B,QAAI,cAAc,GAAG,CAAC;AACtB,QAAI,cAAc,eAAe,CAAC;AAClC,QAAI,cAAc,OAAQ,CAAC;AAC3B,QAAI,WAAW,GAAM,CAAC;AACtB,QAAI,cAAc,YAAY,CAAC;AAC/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,mBAAmB,MAKxB;AACA,WAAO;AAAA,MACL,eAAe,KAAK,aAAa,CAAC;AAAA,MAClC,UAAU,OAAO,aAAa,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC9C,oBAAoB,KAAK,UAAU,CAAC;AAAA,MACpC,eAAe,KAAK,aAAa,CAAC;AAAA,IACpC;AAAA,EACF;AACF;;;ACvWO,IAAM,iCAAiC;AASvC,IAAM,YAAN,MAAM,WAAU;AAAA;AAAA;AAAA;AAAA,EAIrB,OAAO,eACL,YAAoB,gCACpB,QAAgB,GAChB,WAAmB,GACX;AACR,UAAM,MAAM,OAAO,MAAM,qBAAqB;AAC9C,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAI,uBAAuB,CAAC;AAAA,IACnC;AACA,QAAI,WAAW,GAAG,CAAC;AACnB,QAAI,cAAc,WAAW,CAAC;AAC9B,QAAI,cAAc,OAAO,CAAC;AAC1B,QAAI,cAAc,UAAU,CAAC;AAC7B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBACL,YAAoB,gCACpB,QAAgB,GAChB,WAAmB,GACX;AACR,UAAM,MAAM,OAAO,MAAM,2BAA2B;AACpD,QAAI,cAAc,OAAO,YAAY,CAAC;AACtC,QAAI,cAAc,uBAAuB,CAAC;AAC1C,eAAU,eAAe,WAAW,OAAO,QAAQ,EAAE,KAAK,KAAK,CAAC;AAChE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,gBAAgB,MAA6C;AAClE,QAAI,KAAK,SAAS,uBAAuB;AACvC,aAAO;AAAA,IACT;AACA,QACE,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,KACpC,KAAK,CAAC,MAAM,uBAAuB,CAAC,GACpC;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,MACL,gBAAgB,KAAK,UAAU,CAAC;AAAA,MAChC,WAAW,KAAK,aAAa,CAAC;AAAA,MAC9B,OAAO,KAAK,aAAa,CAAC;AAAA,MAC1B,UAAU,KAAK,aAAa,CAAC;AAAA,IAC/B;AAAA,EACF;AAAA,EAEA,OAAO,aAAa,MAAsC;AACxD,UAAM,IAAI,WAAU,gBAAgB,IAAI;AACxC,QAAI,CAAC,KAAK,EAAE,mBAAmB,GAAG;AAChC,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cAAc,OAAiB,gBAAwB,UAA0B;AACtF,WAAO,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cAAc,OAAiB,aAAqB,UAA0B;AACnF,WAAO,UAAU,cAAc,OAAO,aAAa,QAAQ;AAAA,EAC7D;AACF;;;AC1FA,IAAM,OAAO;AAsCN,IAAM,eAAN,MAAM,aAAY;AAAA;AAAA;AAAA;AAAA,EAUf,OAAO,MAAmB;AAChC,QAAI,aAAY,gBAAgB;AAC9B,aAAO,MAAM,iBAAiB,GAAG,IAAI;AAAA,IACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,QAAI,aAAY,gBAAgB;AAC9B,aAAO,SAAS,OAAO;AAAA,IACzB;AACA,SAAK,IAAI,yBAAyB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,aAAa,OAAiB,MAAc,SAA2B,gBAAmE;AAC9I,SAAK,IAAI,oCAAoC,MAAM,QAAQ,EAAE;AAG7D,QAAI,CAAC,MAAM,oBAAoB,MAAM,qBAAqB,GAAG;AAC3D,YAAM,mBAAmB,KAAK;AAAA,IAChC;AACA,UAAM,YAAY,KAAK;AACvB,UAAM,aAAa,SAAS,cAAc,KAAK,OAAO,cAAc;AAEpE,SAAK,IAAI,eAAe,SAAS,qBAAqB,MAAM,QAAQ,EAAE;AACtE,SAAK,IAAI,wBAAwB,EAAE,OAAO,SAAS,OAAO,SAAS,SAAS,SAAS,WAAW,CAAC;AAGjG,QAAI;AAEJ,QAAI,SAAS,UAAU,GAAG;AACxB,0BAAoB,WAAW;AAC/B,WAAK,IAAI,sCAAsC;AAAA,IACjD,WAAW,SAAS,SAAS;AAE3B,UAAI,YAAY,KAAK;AACnB,4BAAoB,WAAW;AAC/B,aAAK,IAAI,4CAA4C,SAAS,SAAS;AAAA,MACzE,OAAO;AACL,4BAAoB,WAAW;AAC/B,aAAK,IAAI,sCAAsC;AAAA,MACjD;AAAA,IACF,OAAO;AACL,0BAAoB,WAAW;AAC/B,WAAK,IAAI,6CAA6C;AAAA,IACxD;AAEA,UAAM,YAAY;AAGlB,UAAM,uBAAwB,CAAC,MAAM,OAAO,MAAM,QAAQ,KAAO,SAAS,aAAa,CAAC,MAAM;AAC9F,UAAM,iBAAiB,uBAAuB,IAAI,eAAe,EAAE,WAAW,SAAS,aAAa,CAAC,MAAM,UAAU,MAAM,CAAC,IAAI;AAGhI,QAAI,gBAAgB;AAClB,qBAAe,OAAO,IAAI;AAC1B,qBAAe,aAAa,OAAO;AAAA,QACjC,QAAQ,CAAC,MAAM,OAAO,MAAM,QAAQ;AAAA,QACpC,WAAW,CAAC,EAAE,SAAS,aAAa,CAAC,MAAM;AAAA,MAC7C,CAAC;AACD,WAAK,IAAI,yBAAyB,MAAM,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,YAAY,MAAM,UAAU,KAAK,EAAE;AAAA,IAC9G;AAGA,UAAM,MAAM,SAAS;AACrB,UAAM,eAAe,QAAQ;AAE7B,UAAM,SAAS,QAAQ;AACvB,UAAM,SAAS,CAAC,CAAC,SAAS,YAAY,CAAC,gBAAgB,CAAC;AACxD,QAAI,SAAS,UAAU;AACrB,YAAM,QAAQ,eAAe,cAAc,SAAS,yBAAyB;AAC7E,WAAK,IAAI,yCAAyC,MAAM,QAAQ,aAAa,KAAK,GAAG;AACrF,YAAM,YAAY,MAAM,YAAY,KAAK,QAAQ;AACjD,YAAM,cAAc;AAAA,IACtB;AAGA,QAAI;AACJ,UAAM,aAAa,sBAAsB,WAAW,OAAO,SAAS,sBAAsB,WAAW,WAAW,aAAa;AAE7H,QAAI,sBAAsB,WAAW,QAAQ;AAC3C,uBAAiB;AAAA,IACnB,OAAO;AACL,WAAK,IAAI,2BAA2B,UAAU,oCAAoC;AAClF,WAAK,IAAI,uBAAuB,UAAU,WAAW,SAAS,uBAAuB,UAAU,QAAQ;AACvG,WAAK,IAAI,6BAA6B,CAAC,MAAM,OAAO,MAAM,QAAQ,CAAC,YAAY,SAAS,SAAS,EAAE;AAEnG,UAAI,sBAAsB,WAAW,MAAM;AACzC,yBAAiB,MAAM,KAAK,aAAa,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,MAC3F,OAAO;AACL,yBAAiB,MAAM,KAAK,gBAAgB,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,MAC9F;AAAA,IACF;AAGA,QAAI,SAAS,UAAU;AACrB,UAAI,QAAQ;AACV,yBAAiB,KAAK,yBAAyB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACxF,WAAW,QAAQ;AACjB,yBAAiB,KAAK,yBAAyB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACxF,OAAO;AACL,yBAAiB,KAAK,sBAAsB,OAAO,gBAAgB,QAAQ,QAAQ;AAAA,MACrF;AAAA,IACF;AAEA,UAAM,iBAAiB,eAAe;AAEtC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,gBACJ,MACA,SACA,YACA,OACA,gBACiB;AACjB,SAAK,IAAI,qCAAqC,OAAO,YAAY,SAAS,iBAAiB,UAAU,YAAY,SAAS,SAAS,CAAC,EAAE;AAEtI,UAAM,sBAAsB,cAAc,KAAK,OAAO,cAAc;AACpE,UAAM,QAAQ,SAAS,SAAS;AAGhC,QAAI,OAAO,SAAS,YAAY,eAAe,QAAQ,iBAAiB,MAAM;AAE5E,YAAM,IAAI,MAAM,kDAAkD;AAAA,IACpE;AAGA,QAAI,KAAK,UAAU,qBAAqB;AACtC,aAAO,KAAK,QAAQ,MAAM,OAAO;AAAA,IACnC;AAGA,UAAM,WAAW,IAAI,KAAK,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC;AACtD,UAAM,mBAA6B,CAAC;AACpC,QAAI,iBAAiB;AACrB,QAAI,sBAAsB;AAE1B,QAAI;AAEF,eAAS,SAAS,GAAG,SAAS,KAAK,QAAQ,UAAU,qBAAqB;AACxE,cAAM,QAAQ,KAAK,MAAM,QAAQ,SAAS,mBAAmB;AAC7D,cAAM,SAAS,SAAS,uBAAuB,KAAK;AAEpD,iBAAS,KAAK,OAAO,MAAM;AAG3B,YAAI,SAAS,UAAU,SAAS,OAAO,SAAS,GAAG;AACjD,gBAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM;AACnD,2BAAiB,KAAK,eAAe;AACrC,iCAAuB,gBAAgB;AAGvC,cAAI,gBAAgB;AAClB,kBAAM,eAAe,eAAe;AAAA,UACtC;AAAA,QACF;AAEA,0BAAkB,MAAM;AAAA,MAC1B;AAGA,YAAM,QAAQ,iBAAiB,IAAI,KAAK,MAAO,sBAAsB,iBAAkB,GAAG,IAAI;AAC9F,WAAK,IAAI,yBAAyB,OAAO,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,YAAY,OAAO,UAAU,KAAK,EAAE;AAC/G,WAAK,IAAI,iCAAiC,mBAAmB,eAAe,cAAc,iBAAiB,KAAK,IAAI;AAEpH,aAAO,OAAO,OAAO,gBAAgB;AAAA,IACvC,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,+BAA+B,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC,EAAE;AAAA,IAC7F;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,OAAe,SAAmC;AACxD,SAAK,IAAI,sCAAsC,MAAM,MAAM,YAAY,SAAS,SAAS,CAAC,EAAE;AAC5F,UAAM,QAAQ,SAAS,SAAS;AAChC,UAAM,SAAS,KAAK,WAAW,OAAO,EAAE,MAAM,CAAC;AAC/C,UAAM,QAAQ,MAAM,SAAS,IAAI,KAAK,MAAO,OAAO,SAAS,MAAM,SAAU,GAAG,IAAI;AACpF,SAAK,IAAI,iCAAiC,OAAO,MAAM,eAAe,MAAM,MAAM,iBAAiB,KAAK,IAAI;AAC5G,WAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,aACJ,OACA,SACA,YACA,OACA,gBACiB;AACjB,SAAK,IAAI,kCAAkC,OAAO,YAAY,SAAS,iBAAiB,UAAU,YAAY,SAAS,SAAS,CAAC,EAAE;AAEnI,UAAM,sBAAsB,cAAc,KAAK,OAAO,cAAc;AACpE,UAAM,QAAQ,SAAS,SAAS;AAChC,UAAM,WAAW,OAAO,SAAS,KAAK;AACtC,UAAM,YAAY,WAAW,MAAM,SAAS,MAAM;AAElD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AAEA,QAAI,SAAS,UAAU,GAAG;AACxB,UAAI,UAAU;AACZ,YAAI,gBAAgB;AAClB,gBAAM,eAAe,KAAK;AAAA,QAC5B;AACA,eAAO;AAAA,MACT;AACA,YAAM,SAAmB,CAAC;AAC1B,UAAI,WAAW;AACf,aAAO,WAAW,WAAW;AAC3B,cAAM,OAAO,KAAK,IAAI,qBAAqB,YAAY,QAAQ;AAC/D,cAAM,QAAQ,MAAM,UAAU,UAAU,IAAI;AAC5C,YAAI,gBAAgB;AAClB,gBAAM,eAAe,KAAK;AAAA,QAC5B,OAAO;AACL,iBAAO,KAAK,KAAK;AAAA,QACnB;AACA,oBAAY,MAAM;AAAA,MACpB;AACA,aAAO,iBAAiB,OAAO,MAAM,CAAC,IAAI,OAAO,OAAO,MAAM;AAAA,IAChE;AAEA,UAAM,YAAY,WACd,CAAC,UAAkB,SAAiB,MAAM,SAAS,UAAU,WAAW,IAAI,IAC5E,MAAM,UAAU,KAAK,KAAK;AAE9B,UAAM,YAAsB,CAAC;AAC7B,UAAM,iBAAiB,MAAM,SAAS;AAAA,MACpC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,eAAe;AACpB,YAAI,gBAAgB;AAClB,gBAAM,eAAe,UAAU;AAAA,QACjC,OAAO;AACL,oBAAU,KAAK,UAAU;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,OAAO;AACT,YAAM,iBAAiB;AAAA,IACzB;AAEA,QAAI,gBAAgB;AAClB,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AACA,WAAO,OAAO,OAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,sBAAsB,OAAiB,gBAAwB,UAA0B;AACvF,SAAK,IAAI,6CAA6C,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEjH,UAAM,YAAY,IAAI,UAAU;AAChC,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAE7E,SAAK,IAAI,wBAAwB,eAAe,MAAM,wBAAwB,cAAc,MAAM,8BAA8B,gBAAgB,eAAe;AAE/J,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAyB,OAAiB,gBAAwB,UAA0B;AAC1F,SAAK,IAAI,gDAAgD,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEpH,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAE7E,UAAM,0BAA0B;AAChC,UAAM,qBAAqB;AAC3B,UAAM,iBAAiB;AAEvB,SAAK,IAAI,mCAAmC,eAAe,MAAM,aAAa,cAAc,MAAM,QAAQ;AAE1G,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAAyB,OAAiB,gBAAwB,UAA0B;AAC1F,SAAK,IAAI,gDAAgD,MAAM,QAAQ,sBAAsB,eAAe,MAAM,EAAE;AAEpH,UAAM,gBAAgB,UAAU,cAAc,OAAO,gBAAgB,QAAQ;AAG7E,UAAM,gBAAgB,MAAM;AAC5B,UAAM,YAAY,WAAW;AAC7B,UAAM,aAAa;AACnB,UAAM,cAAc;AAEpB,SAAK,IAAI,gCAAgC,eAAe,MAAM,aAAa,cAAc,MAAM,kCAAkC;AAEjI,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,mBACJ,OACA,UACA,YACiB;AACjB,SAAK,IAAI,0CAA0C,MAAM,QAAQ,WAAW,SAAS,MAAM,EAAE;AAG7F,UAAM,mBAAmB,SAAS;AAGlC,UAAM,iBAAiB,IAAI,eAAe,EAAE,WAAW,YAAY,aAAa,MAAM,CAAC;AACvF,mBAAe,OAAO,QAAQ;AAG9B,mBAAe,aAAa,OAAO;AAAA,MACjC,QAAQ;AAAA,MACR,WAAW,CAAC,CAAC,YAAY;AAAA,IAC3B,CAAC;AACD,QAAI,MAAM,QAAQ;AAChB,WAAK,IAAI,uBAAuB,MAAM,MAAM,EAAE;AAAA,IAChD;AAGA,WAAO,MAAM,KAAK,aAAa,OAAO,UAAU,UAAU;AAAA,EAC5D;AACF;AAAA;AAhYa,aAKI,iBAA0B;AALpC,IAAM,cAAN;;;ACrCA,IAAM,2BAA2B;AAExC,IAAM,aAAa,OAAO,KAAK,CAAC,IAAM,KAAM,IAAM,GAAI,CAAC;AA4GvD,SAAS,QAAQ,MAAsB;AACrC,QAAM,IAAI,IAAI,eAAe;AAC7B,IAAE,OAAO,IAAI;AACb,SAAO,EAAE,cAAc;AACzB;AAuGO,SAAS,8BACd,SACA,0BACA,KAC0C;AAC1C,QAAM,WAAW,6BAA6B;AAC9C,MACE,QAAQ,WAAW,WAAW,4BAC9B,QAAQ,SAAS,QAAQ,EAAE,OAAO,OAAO,MAAM,wBAAwB,CAAC,GACxE;AACA,UAAM,WAAW,QAAQ,SAAS,GAAG,QAAQ;AAC7C,QAAI,QAAQ,UAAa,QAAQ,GAAG;AAClC,UAAI,QAAQ,QAAQ,MAAO,QAAQ,GAAI;AACrC,eAAO,EAAE,UAAU,SAAS,WAAW,MAAM;AAAA,MAC/C;AAAA,IACF;AACA,WAAO,EAAE,UAAU,WAAW,KAAK;AAAA,EACrC;AACA,MAAI,QAAQ,SAAS,YAAY,WAAW,GAAG;AAE7C,UAAM,WAAW,QAAQ,SAAS,GAAG,QAAQ;AAC7C,QAAI,QAAQ,UAAa,QAAQ,KAAK,QAAQ,QAAQ,MAAO,QAAQ,GAAI;AACvE,aAAO,EAAE,UAAU,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AACA,SAAO,EAAE,UAAU,SAAS,WAAW,MAAM;AAC/C;;;ACpPA,IAAMC,QAAO;AA+Bb,IAAM,iBAAN,MAAM,eAAc;AAAA;AAAA;AAAA;AAAA,EAUV,OAAO,MAAmB;AAChC,QAAI,eAAc,gBAAgB;AAChC,aAAO,MAAM,mBAAmB,GAAG,IAAI;AAAA,IACzC;AAAA,EACF;AAAA,EAEA,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAEd,SAAK,QAAQ;AAEb,QAAI,eAAc,gBAAgB;AAChC,aAAO,SAAS,OAAO;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,QAAQ,OAAiB,eAAiD;AAC9E,QAAI,CAAC,KAAK,OAAO,YAAY,GAAG;AAC9B,YAAM,IAAI,MAAM,iHAAiH;AAAA,IACnI;AAEA,SAAK,IAAI,+BAA+B,MAAM,QAAQ,aAAa,MAAM,SAAS,oBAAoB,aAAa,EAAE;AAErH,UAAM,SAAS,KAAK,OAAO,aAAa;AAGxC,QAAI,QAAQ,KAAK,OAAO,iBAAiB,OAAO,MAAM;AACtD,UAAM,WAAY,KAAK,QAAgB;AACvC,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,cAAc,WAAW;AACrE,UAAM,QAAQ,MAAM,qBAAqB;AAEzC,QAAK,MAAc,eAAe,UAAU;AAC1C,WAAK,IAAI,4CAA4C,MAAM,QAAQ,KAAK,SAAS,QAAQ,mCAAmC,WAAW,GAAG;AAE1I,UAAI,SAAS,OAAO;AAClB,gBAAQ,UAAU,cAAc,OAAO,OAAO,QAAQ;AAAA,MACxD,OAAO;AACL,cAAM,YAAY,IAAI,UAAU;AAChC,gBAAQ,UAAU,cAAc,OAAO,QAAQ,OAAO,QAAQ;AAAA,MAChE;AAEA,WAAK,IAAI,4DAA4D,MAAM,MAAM,EAAE;AAAA,IACrF;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AAIA,UAAM,WAAW,SAAS,MAAM,eAAe,IAAI,OAAO;AAC1D,WAAO,KAAK,WAAW,OAAO,OAAO,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAOQ,QAAQ,MAAsB;AACpC,SAAK,IAAI,yBAAyB,KAAK,MAAM,QAAQ;AACrD,UAAM,SAASA,MAAK,WAAW,IAAI;AACnC,WAAO,OAAO,KAAK,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,mBAAmB,MAAc,OAAmC;AAChF,SAAK,IAAI,oCAAoC,KAAK,MAAM,QAAQ;AAEhE,QAAI;AACF,UAAI,eAAe,MAAM,SAAS,WAAW,IAAI;AACjD,UAAI,SAAS,MAAM,mBAAmB,GAAG;AACvC,cAAM,EAAE,UAAU,UAAU,IAAI;AAAA,UAC9B;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,QACR;AACA,YAAI,WAAW;AACb,eAAK;AAAA,YACH,sCAAsC,aAAa,MAAM,OAAO,SAAS,MAAM;AAAA,UACjF;AAAA,QACF;AACA,uBAAe;AAAA,MACjB;AACA,WAAK,IAAI,kCAAkC,KAAK,MAAM,aAAa,aAAa,MAAM,QAAQ;AAC9F,aAAO;AAAA,IACT,SAAS,OAAO;AACd,WAAK,IAAI,8BAA8B,KAAK,EAAE;AAC9C,YAAM,IAAI,MAAM,8BAA8B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IACxG;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc,WACZ,gBACA,OACA,eACiB;AAEjB,UAAM,SAAS,MAAM,cAAc,WAAW,eAAe,MAAM,iBAAiB,IAChF,MAAM,gBACN,MAAM;AAEV,SAAK,IAAI,kCAAkC,MAAM,QAAQ,aAAa,MAAM,kBAAkB,eAAe,MAAM,EAAE;AAErH,QAAI,eAAe,WAAW,GAAG;AAC/B,aAAO,OAAO,MAAM,CAAC;AAAA,IACvB;AAEA,QAAI;AACJ,QAAI,WAAW,WAAW,QAAQ;AAChC,eAAS;AAAA,IACX,WAAW,WAAW,WAAW,UAAU;AACzC,eAAS,KAAK,QAAQ,cAAc;AAAA,IACtC,WAAW,WAAW,WAAW,MAAM;AACrC,eAAS,MAAM,KAAK,mBAAmB,gBAAgB,KAAK;AAAA,IAC9D,OAAO;AACL,YAAM,IAAI,MAAM,mCAAmC,MAAM,EAAE;AAAA,IAC7D;AAGA,UAAM,WAAW,IAAI,eAAe,EAAE,WAAW,KAAK,CAAC;AACvD,aAAS,OAAO,MAAM;AACtB,UAAM,gBAAgB,SAAS,cAAc;AAC7C,UAAM,iBAAiB,SAAS,eAAe;AAC/C,UAAM,OAAO,SAAS,qBAAqB;AAC3C,QAAI,MAAM;AACR,YAAM,eAAe;AAAA,IACvB;AAEA,QAAI,CAAC,eAAe;AAClB,UAAI,MAAM,QAAQ;AAChB,YAAI,mBAAmB,MAAM,QAAQ;AACnC,gBAAM,IAAI,MAAM,eAAO,cAAc;AAAA,QACvC;AAAA,MACF,WAAW,kBAAkB,MAAM,KAAK;AACtC,cAAM,IAAI,MAAM,eAAO,WAAW;AAAA,MACpC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEF;AAAA;AAzKM,eAKW,iBAA0B;AAL3C,IAAM,gBAAN;AA4KA,IAAO,wBAAQ;;;AC1Lf,IAAM,cAAc,OAAO,KAAK,CAAC,CAAI,CAAC;AACtC,IAAM,cAAc,OAAO,KAAK,CAAC,CAAI,CAAC;AAEtC,SAASC,QAAO,MAA8C;AAC5D,QAAM,IAAW,WAAW,QAAQ;AACpC,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAW,QAAQ,MAAM;AACvB,QAAE,OAAO,IAAI;AAAA,IACf;AAAA,EACF,OAAO;AACL,MAAE,OAAO,IAAI;AAAA,EACf;AACA,SAAO,EAAE,OAAO;AAClB;AAEA,SAAS,SAAS,MAAoC,UAAmC;AACvF,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,OAAO,KAAK,MAAM,YAAY,KAAK;AAAA,EAC5C;AACA,SAAO,OAAO,SAAS,IAAI,IAAI,OAAO,OAAO,KAAK,IAAI;AACxD;AAMO,SAAS,oBAAoB,MAAsB;AACxD,MAAI,IAAI,KAAK,QAAQ,OAAO,GAAG;AAC/B,MAAI,EAAE,WAAW,IAAI,GAAG;AACtB,QAAI,EAAE,MAAM,CAAC;AAAA,EACf;AACA,SAAO,EAAE,WAAW,GAAG,GAAG;AACxB,QAAI,EAAE,MAAM,CAAC;AAAA,EACf;AACA,MAAI,OAAO,EAAE,cAAc,YAAY;AACrC,QAAI,EAAE,UAAU,KAAK;AAAA,EACvB;AACA,SAAO;AACT;AAGA,SAAS,YAAY,MAAc,WAAoC;AACrE,QAAM,aAAa,cAAc,OAAO,oBAAoB,IAAI,IAAI;AACpE,SAAO,OAAO,KAAK,YAAY,MAAM;AACvC;AAGO,SAAS,cAAc,SAAsC;AAClE,SAAOA,QAAO,SAAS,OAAO,CAAC;AACjC;AAKO,SAAS,WAAW,iBAAsC,WAAW,OAAe;AACzF,QAAM,MAAM,SAAS,eAAe;AACpC,SAAO,WAAW,MAAMA,QAAO,GAAG;AACpC;AAMO,SAAS,WAAW,SAAsC;AAC/D,SAAOA,QAAO,CAAC,aAAa,SAAS,OAAO,CAAC,CAAC;AAChD;AAOO,SAAS,WAAW,MAAc,OAAe,WAAoC;AAC1F,MAAI,cAAc,MAAM;AACtB,WAAOA,QAAO,CAAC,aAAa,MAAM,KAAK,CAAC;AAAA,EAC1C;AACA,SAAOA,QAAO,CAAC,MAAM,KAAK,CAAC;AAC7B;AAQO,SAAS,qBAAqB,QAAkB,WAA2C;AAChG,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,QAAkB,OAAO,IAAI,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC;AAEtD,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,OAAiB,CAAC;AACxB,aAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG;AAC5C,WAAK,KAAK,WAAW,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,SAAS,CAAC;AAAA,IACzD;AACA,QAAI,MAAM,SAAS,MAAM,GAAG;AAC1B,YAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,UAAI,cAAc,MAAM;AAEtB,aAAK,KAAK,WAAW,MAAM,MAAM,SAAS,CAAC;AAAA,MAC7C,OAAO;AAEL,aAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF;AACA,YAAQ;AAAA,EACV;AAEA,SAAO,MAAM,CAAC,EAAE,SAAS,KAAK;AAChC;AAEA,SAAS,YACP,OACA,WACe;AACf,MAAI,cAAc,MAAM;AACtB,QAAI,MAAM,eAAe;AACvB,YAAM,IAAI,SAAS,MAAM,eAAe,OAAO,MAAM,kBAAkB,WAAW,QAAQ,MAAS;AACnG,UAAI,EAAE,WAAW,IAAI;AACnB,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM,SAAS;AACjB,aAAO,cAAc,MAAM,OAAO;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,cAAc;AACtB,UAAM,IAAI;AAAA,MACR,MAAM;AAAA,MACN,OAAO,MAAM,iBAAiB,WAAW,QAAQ;AAAA,IACnD;AACA,QAAI,EAAE,WAAW,IAAI;AACnB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,SAAS;AACjB,WAAO,WAAW,MAAM,OAAO;AAAA,EACjC;AACA,SAAO;AACT;AAQO,SAAS,yBACd,SACA,YAA6B,MACd;AACf,QAAM,WAA4C,CAAC;AAEnD,aAAW,SAAS,SAAS;AAC3B,QAAI,cAAc,MAAM,QAAQ,EAAE,GAAG;AACnC;AAAA,IACF;AACA,UAAM,OAAO,YAAY,OAAO,SAAS;AACzC,QAAI,CAAC,MAAM;AACT;AAAA,IACF;AACA,aAAS,KAAK;AAAA,MACZ,KAAK,YAAY,MAAM,QAAQ,IAAI,SAAS;AAAA,MAC5C;AAAA,IACF,CAAC;AAAA,EACH;AAEA,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC;AACpD,SAAO;AAAA,IACL,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IAC1B;AAAA,EACF;AACF;AAMO,SAAS,+BACd,SACe;AACf,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,EAAE,OAAO,EAAE;AAAA,IAC9D;AAAA,EACF;AACF;AAMO,SAAS,gCACd,SACe;AACf,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,EAAE,QAAQ,EAAE;AAAA,IACzD;AAAA,EACF;AACF;AAMO,SAAS,8BACd,SACe;AACf,SAAO;AAAA,IACL,QAAQ,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,EAAE,aAAa,EAAE;AAAA,IACnE;AAAA,EACF;AACF;AAUO,SAAS,gBACd,SACA,cACoE;AACpE,QAAM,WAAW,aAAa,YAAY,EAAE,QAAQ,OAAO,EAAE;AAC7D,MAAI,CAAC,iBAAiB,KAAK,QAAQ,GAAG;AACpC,WAAO;AAAA,EACT;AAEA,QAAM,gBAAgB,QAAQ;AAAA,IAC5B,CAAC,MACC,CAAC,cAAc,EAAE,QAAQ,EAAE,MAC1B,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE;AAAA,EAC7B;AACA,MAAI,eAAe;AACjB,UAAM,KAAK,yBAAyB,SAAS,IAAI;AACjD,QAAI,MAAM,OAAO,UAAU;AACzB,aAAO,EAAE,WAAW,MAAM,UAAU,OAAO;AAAA,IAC7C;AAAA,EACF;AAEA,QAAM,KAAK,yBAAyB,SAAS,IAAI;AACjD,MAAI,MAAM,OAAO,UAAU;AACzB,WAAO,EAAE,WAAW,MAAM,UAAU,SAAS;AAAA,EAC/C;AAGA,MAAI,eAAe;AACjB,WAAO;AAAA,EACT;AAEA,SAAO;AACT;;;AC5LA,IAAqB,SAArB,MAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8B1B,YAAY,SAAuB,CAAC,GAAG;AAtBvC;AAAA,SAAQ,WAA0B;AAClC,SAAU,aAAyB,CAAC;AACpC;AAAA,SAAQ,iBAAyB;AACjC,SAAQ,mBAA2B;AAGnC;AAAA,SAAQ,aAA4B;AAGpC;AAAA,SAAQ,aAAiC;AACzC,SAAQ,eAAqC;AAa3C,SAAK,SAAS;AAAA,MACZ,YAAY,OAAO,cAAc,MAAM;AAAA;AAAA,MACvC,OAAO,OAAO,SAAS;AAAA;AAAA,IACzB;AAGA,QAAI,KAAK,OAAO,OAAO;AACrB,aAAO,SAAS,OAAO;AAAA,IACzB;AAAA,EAIF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAA8B;AACpC,QAAI,CAAC,KAAK,YAAY;AACpB,WAAK,aAAa,IAAI,YAAY,IAAI;AAAA,IACxC;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,mBAAkC;AACxC,QAAI,CAAC,KAAK,cAAc;AACtB,WAAK,eAAe,IAAI,sBAAc,IAAI;AAAA,IAC5C;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAwB;AACtB,WAAO,KAAK,OAAO,cAAc,MAAM;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAuB;AACrB,WAAO,KAAK,aAAa,QAAQ,KAAK,SAAS,SAAS;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,MAAM,aACJ,OACA,MACA,SACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,aAAa,OAAO,MAAM,SAAS,cAAc;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,gBACJ,MACA,SACA,YACA,OACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,gBAAgB,MAAM,SAAS,YAAY,OAAO,cAAc;AAAA,EAC/F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,OAAe,SAAmC;AACxD,WAAO,KAAK,eAAe,EAAE,QAAQ,OAAO,OAAO;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,aACJ,OACA,SACA,YACA,OACA,gBACiB;AACjB,WAAO,KAAK,eAAe,EAAE,aAAa,OAAO,SAAS,YAAY,OAAO,cAAc;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,mBACJ,OACA,UACA,YACiB;AACjB,WAAO,KAAK,eAAe,EAAE,mBAAmB,OAAO,UAAU,UAAU;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,QAAQ,OAAiB,eAAiD;AAC9E,WAAO,KAAK,iBAAiB,EAAE,QAAQ,OAAO,aAAa;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BA,QAAQ,OAA2B;AACjC,SAAK,aAAa;AAElB,SAAK,WAAW;AAEhB,SAAK,mBAAmB,KAAK;AAC7B,UAAM,UAAU,KAAK,uBAAuB;AAC5C,SAAK,aAAa;AAClB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,eAAqB;AAC3B,SAAK,WAAW;AAChB,SAAK,aAAa,CAAC;AACnB,SAAK,MAAM;AACX,SAAK,aAAa;AAElB,SAAK,aAAa;AAClB,SAAK,eAAe;AAAA,EAEtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,OAA6B;AACxC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,UAAmC;AAC7C,QAAI;AACF,YAAM,aAAa,KAAK,aAAa;AACrC,YAAM,QAAQ,WAAW,KAAK,CAAC,UAAoB,MAAM,aAAa,QAAQ;AAC9E,UAAI,MAAO,QAAO;AAClB,UAAI,mBAAmB,QAAQ,GAAG;AAChC,eAAO,sBAAsB,YAAY,QAAQ;AAAA,MACnD;AACA,aAAO;AAAA,IACT,SAAS,OAAO;AACd,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,eAAuB;AAC5B,QAAI,CAAC,KAAK,UAAU;AAClB,WAAK,WAAW,OAAO,MAAM,CAAC;AAAA,IAChC;AACA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,iBAAiB,OAAiB,QAAwB;AAC/D,UAAM,YAAY,OAAO,SAAS,MAAM,cAAc;AAEtD,QAAI,UAAU,aAAa,CAAC,MAAM,UAAU,WAAW;AACrD,YAAM,IAAI,MAAM,eAAO,WAAW;AAAA,IACpC;AAEA,UAAM,YAAY,UAAU,aAAa,UAAU,KAAK;AACxD,QAAI,YAAY,UAAU,aAAa,UAAU,SAAS;AAC1D,QAAI,YAAY,UAAU,aAAa,UAAU,SAAS;AAC1D,QAAI,aAAa,UAAU,OAAO,YAAY;AAE9C,UAAM,QAAQ,MAAM,aAAa,KAAK,MAAM,cAAc,WAAW;AACrE,UAAM,QAAQ,MAAM,qBAAqB;AAEzC,QAAI,SAAS,OAAO;AAGlB,YAAMC,aAAY;AAClB,YAAMC,WAAU,aAAa,MAAM;AACnC,aAAO,UAAU,SAASD,YAAWC,QAAO;AAAA,IAC9C;AAGA,QAAI,cAAc;AAClB,QAAI,YAAY,QAAQ,WAAW;AACjC,oBAAc;AAAA,IAChB;AAEA,UAAM,YAAY,aAAa;AAC/B,UAAM,UAAU,aAAa,MAAM;AACnC,WAAO,UAAU,SAAS,WAAW,OAAO;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,UAAU,OAAiB,MAAuB;AAGrD,UAAM,OAAO,MAAM,IAAI;AACzB,UAAM,UAAU,SAAS,MAAM;AAC/B,WAAO,MAAM,8CAA8C,IAAI,YAAY,MAAM,GAAG,aAAa,UAAU,WAAM,QAAG,gBAAgB,MAAM,WAAW,OAAS,IAAI,QAAQ,IAAI,EAAE;AAChL,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,WAAW,OAAiB,MAAuB;AACxD,QAAI,CAAC,MAAM,QAAQ;AACjB,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AACA,UAAM,UAAU,OAAO,IAAI;AAC3B,UAAM,UAAU,YAAY,MAAM;AAClC,WAAO,MAAM,+CAA+C,OAAO,YAAY,MAAM,MAAM,aAAa,UAAU,WAAM,QAAG,EAAE;AAC7H,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAgG;AAC9F,UAAM,aAAa,KAAK,UAAU,UAAU;AAC5C,UAAM,gBAAgB,KAAK,WAAW,SAAS;AAE/C,QAAI;AACJ,QAAI,KAAK,UAAU;AACjB,gBAAU;AAAA,IACZ,OAAO;AAGL,gBAAU;AAAA,IACZ;AAEA,WAAO;AAAA,MACL;AAAA,MACA,aAAa,aAAa;AAAA,MAC1B,SAAS,KAAK,WAAW;AAAA,IAC3B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAe,UAAkB,MAAe,SAAyB;AACvE,UAAM,QAAQ,IAAI,SAAS,UAAU,MAAM,KAAK;AAEhD,QAAI,MAAM;AACR,YAAM,MAAM,MAAM,IAAI;AACtB,YAAM,mBAAmB,KAAK;AAC9B,YAAM,iBAAiB,KAAK;AAAA,IAC9B,OAAO;AACL,YAAM,MAAM;AACZ,YAAM,mBAAmB;AACzB,YAAM,iBAAiB;AAAA,IACzB;AACA,UAAM,YAAY,WAAW;AAC7B,UAAM,WAAW;AAMjB,SAAK,WAAW,KAAK,KAAK;AAE1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,aAAwC;AAGtD,QAAI,YAAY,SAAS;AACvB,YAAM,WAAW,YAAY,eAAe;AAC5C,aAAO,OAAO,OAAO,CAAC,UAAU,YAAY,OAAO,CAAC;AAAA,IACtD;AAEA,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,gBAA8E;AAEhF,WAAO,CAAC,gBAAwB,qBAA6B;AAC3D,YAAM,eAAe,KAAK,WAAW;AACrC,aAAO,KAAK,oBAAoB,gBAAgB,kBAAkB,YAAY;AAAA,IAChF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gBAA+B;AAC7B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBAAmB,QAAsB;AAC/C,UAAM,WAAW,OAAO;AACxB,UAAM,aAAa,KAAK,IAAI,QAAS,IAAI,QAAQ;AACjD,UAAM,cAAc,WAAW;AAC/B,UAAM,OAAO,OAAO,SAAS,aAAa,cAAc,UAAU;AAGlE,QAAI,aAAa;AACjB,aAAS,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK;AAC1C,UAAI,KAAK,CAAC,MAAM,IAAM;AACpB,YAAI,KAAK,aAAa,CAAC,MAAM,YAAY,WAAW;AAClD,uBAAa,cAAc;AAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,eAAe,IAAI;AACrB,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AAEA,UAAM,aAAa,OAAO,SAAS,YAAY,aAAa,EAAE;AAC9D,QAAI,WAAW,aAAa,CAAC,MAAM,YAAY,WAAW;AACxD,WAAK,iBAAiB,WAAW,aAAa,YAAY,gBAAgB;AAC1E,WAAK,mBAAmB,WAAW,aAAa,YAAY,kBAAkB;AAE9E,UAAI,KAAK,qBAAqB,YAAY;AAExC,cAAM,gBAAgB,aAAa;AACnC,cAAM,gBAAgB,OAAO,SAAS,eAAe,gBAAgB,EAAE;AACvE,YAAI,cAAc,aAAa,CAAC,MAAM,kBAAkB,WAAW;AACjE,gBAAM,cAAc,OAAO,cAAc,gBAAgB,CAAC,CAAC;AAC3D,gBAAM,cAAc,OAAO,SAAS,aAAa,cAAc,EAAE;AACjE,eAAK,iBAAiB,OAAO,YAAY,gBAAgB,kBAAkB,gBAAgB,CAAC;AAC5F,eAAK,mBAAmB,OAAO,YAAY,gBAAgB,kBAAkB,kBAAkB,CAAC;AAAA,QAClG;AAAA,MACF;AAAA,IACF,OAAO;AACL,YAAM,IAAI,MAAM,eAAO,cAAc;AAAA,IACvC;AAGA,UAAM,gBAAgB,WAAW,aAAa,YAAY,eAAe;AACzE,QAAI,gBAAgB,GAAG;AACrB,YAAM,eAAe,aAAa;AAClC,WAAK,aAAa,OAAO,SAAS,cAAc,eAAe,aAAa,EAAE,SAAS;AAAA,IACzF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,yBAAqC;AAC3C,QAAI,CAAC,KAAK,UAAU;AAClB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,SAAS,KAAK;AACpB,UAAM,UAAsB,CAAC;AAC7B,QAAI,SAAS,KAAK;AAClB,QAAI,YAAY,KAAK;AACrB,UAAM,aAAa,KAAK,OAAO,cAAc,MAAM;AAEnD,WAAO,YAAY,GAAG;AACpB,YAAM,oBAAoB,KAAK,IAAI,YAAY,SAAS;AACxD,YAAM,QAAQ,OAAO,SAAS,QAAQ,SAAS,iBAAiB;AAGhE,UAAI,cAAc;AAClB,aAAO,cAAc,MAAM,QAAQ;AACjC,YAAI,MAAM,aAAa,WAAW,MAAM,YAAY,WAAW;AAC7D;AAAA,QACF;AAGA,cAAM,QAAQ,IAAI,SAAS,MAAM,MAAM,KAAK;AAC5C,cAAM,YAAY,MAAM,SAAS,WAAW;AAC5C,cAAM,gBAAgB,MAAM,aAAa,SAAS;AAElD,gBAAQ,KAAK,KAAK;AAGlB,uBAAgB,UAAU,SAAS,cAAc;AAAA,MACnD;AAEA,gBAAU;AACV,mBAAa;AAAA,IACf;AAKA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,QAAc;AACpB,SAAK,iBAAiB;AACtB,SAAK,mBAAmB;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,oBAAoB,gBAAwB,kBAA0B,cAA8B;AAC1G,UAAM,QAAQ,OAAO,MAAM,YAAY,IAAI;AAC3C,UAAM,cAAc,YAAY,WAAW,CAAC;AAC5C,UAAM,cAAc,GAAG,CAAC;AACxB,UAAM,cAAc,GAAG,CAAC;AACxB,UAAM,cAAc,cAAc,CAAC;AACnC,UAAM,cAAc,cAAc,EAAE;AACpC,UAAM,cAAc,gBAAgB,EAAE;AACtC,UAAM,cAAc,kBAAkB,EAAE;AACxC,UAAM,cAAc,GAAG,EAAE;AAEzB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,cAAc,SAA0D;AACtE,UAAM,YAA6B,SAAS,aAAa;AAEzD,QAAI;AACJ,QAAI;AACF,mBAAa,KAAK,aAAa;AAAA,IACjC,SAAS,OAAO;AACd,aAAO,MAAM,kDAAkD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AACvH,aAAO,MAAM,iCAAiC,iBAAiB,QAAQ,MAAM,QAAQ,gBAAgB,EAAE;AACvG,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,aAAO;AAAA,IACT;AAEA,UAAM,iBAAiB,WAAW,OAAO,CAAC,UAAU,CAAC,cAAc,MAAM,YAAY,EAAE,CAAC;AAExF,QAAI,cAAc,MAAM;AACtB,YAAM,UAAU,eACb,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,IAAI,QAAQ,EAAE,OAAiB,EAAE;AACtE,aAAO,+BAA+B,OAAO;AAAA,IAC/C;AAGA,QACE,eAAe,SAAS,KACxB,eAAe,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,GAC5C;AACA,aAAO;AAAA,QACL,eAAe,IAAI,CAAC,OAAO;AAAA,UACzB,MAAM,EAAE,YAAY;AAAA,UACpB,cAAc,EAAE;AAAA,QAClB,EAAE;AAAA,MACJ;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,mBAAmB,SAAmE;AAC1F,UAAM,YAA6B,SAAS,aAAa;AAEzD,QAAI,aAAyB,CAAC;AAE9B,QAAI;AACF,mBAAa,KAAK,aAAa;AAAA,IACjC,SAAS,OAAO;AACd,aAAO,MAAM,wDAAwD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC7H,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,aAAO;AAAA,IACT;AAEA,UAAM,iBAAiB,WAAW,OAAO,CAAC,UAAU,CAAC,cAAc,MAAM,YAAY,EAAE,CAAC;AAExF,QAAI,cAAc,MAAM;AACtB,YAAM,UAAU,eACb,OAAO,CAAC,MAAM,EAAE,MAAM,EACtB,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,IAAI,QAAQ,EAAE,OAAiB,EAAE;AACtE,aAAO,+BAA+B,OAAO;AAAA,IAC/C;AAGA,QACE,eAAe,SAAS,KACxB,eAAe,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,GAC5C;AACA,aAAO;AAAA,QACL,eAAe,IAAI,CAAC,OAAO;AAAA,UACzB,MAAM,EAAE,YAAY;AAAA,UACpB,cAAc,EAAE;AAAA,QAClB,EAAE;AAAA,MACJ;AAAA,IACF;AAGA,QAAI,CAAC,KAAK,UAAU;AAClB,aAAO;AAAA,QACL;AAAA,MAEF;AACA,aAAO;AAAA,IACT;AAEA,eAAW,SAAS,gBAAgB;AAClC,UAAI;AACF,cAAM,OAAO,MAAM,KAAK,QAAQ,OAAO,KAAK;AAC5C,YAAI,MAAM,cAAc;AACtB;AAAA,QACF;AAEA,YAAI,SAAS,QAAQ,KAAK,WAAW,GAAG;AACtC,gBAAM,eAAe,WAAW,OAAO,MAAM,CAAC,CAAC,EAAE,SAAS,KAAK;AAAA,QACjE,OAAO;AACL,gBAAM,eAAe,WAAW,IAAI,EAAE,SAAS,KAAK;AAAA,QACtD;AAAA,MACF,SAAS,OAAO;AACd,eAAO;AAAA,UACL,2CAA2C,MAAM,QAAQ,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,QACtH;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,CAAC,eAAe,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,GAAG;AAClD,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,MACL,eAAe,IAAI,CAAC,OAAO;AAAA,QACzB,MAAM,EAAE,YAAY;AAAA,QACpB,cAAc,EAAE;AAAA,MAClB,EAAE;AAAA,IACJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,sBACL,SACA,YAA6B,MACd;AACf,WAAO,yBAAyB,SAAS,SAAS;AAAA,EACpD;AAEF;AAxvBqB,OACH,UAAU,eAAe;AADtB,OAEH,cAAc,eAAe;;;ACRxC,IAAM,UAAN,MAAc;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnB,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,yBAAyB,cAAsB,OAAyB;AAE9E,QAAI,MAAM,iBAAiB,UAAU,OAAO,aAAa,QAAQ;AAC/D,YAAM,IAAI;AAAA,QACR,uBAAuB,MAAM,cAAc,0BAA0B,aAAa,MAAM,cAAc,MAAM,QAAQ;AAAA,MACtH;AAAA,IACF;AAGA,UAAM,eAAe,aAAa,SAAS,MAAM,gBAAgB,MAAM,iBAAiB,UAAU,IAAI;AAGtG,QAAI,aAAa,aAAa,CAAC,MAAM,UAAU,WAAW;AACxD,YAAM,IAAI;AAAA,QACR,iDAAiD,MAAM,QAAQ,cAAc,MAAM,cAAc;AAAA,MACnG;AAAA,IACF;AAGA,UAAM,iBAAiB,aAAa,aAAa,UAAU,SAAS;AACpE,UAAM,mBAAmB,aAAa,aAAa,UAAU,SAAS;AAGtE,WAAO,UAAU,OAAO,iBAAiB;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBQ,eACN,cACA,OACQ;AAER,UAAM,kBAAkB,KAAK,yBAAyB,cAAc,KAAK;AAIzE,UAAM,qBAAqB,MAAM,WAAW,QAAQ,eAAe;AACnE,UAAM,iBAAiB,kBAAkB,MAAM,kBAAkB,oBAAoB,KAAK;AAG1F,QAAI,MAAM,iBAAiB,iBAAiB,aAAa,QAAQ;AAC/D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,QAAQ,uCACb,MAAM,cAAc,WAAW,cAAc,oBAAoB,aAAa,MAAM;AAAA,MAChG;AAAA,IACF;AAGA,UAAM,cAAc,aAAa,SAAS,MAAM,gBAAgB,MAAM,iBAAiB,cAAc;AAGrG,QAAI,mBAAmB;AACrB,YAAM,iBAAiB,kBAAkB,MAAM;AAC/C,YAAM,cAAc,YAAY,aAAa,cAAc;AAC3D,UAAI,gBAAgB,WAAY;AAC9B,cAAM,IAAI;AAAA,UACR,+CAA+C,MAAM,QAAQ,gCAC9B,YAAY,SAAS,EAAE,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAGA,WAAO,OAAO,KAAK,WAAW;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,qBACN,OACA,mBACU;AAEV,UAAM,SAAS,IAAI,SAAS,MAAM,UAAU,MAAM,WAAW,MAAM,MAAM,KAAK;AAG9E,WAAO,YAAY,MAAM;AACzB,WAAO,aAAa,MAAM;AAC1B,WAAO,WAAW,MAAM;AACxB,WAAO,YAAY,MAAM;AACzB,WAAO,cAAc,MAAM;AAC3B,WAAO,MAAM,MAAM;AACnB,WAAO,iBAAiB,MAAM;AAC9B,WAAO,mBAAmB,MAAM;AAChC,WAAO,YAAY,MAAM;AACzB,WAAO,cAAc,MAAM;AAC3B,WAAO,cAAc,MAAM;AAC3B,WAAO,iBAAiB;AAGxB,QAAI,MAAM,YAAY;AACpB,aAAO,aAAa,OAAO,KAAK,MAAM,UAAU;AAAA,IAClD;AAGA,WAAO,cAAc,MAAM;AAC3B,WAAO,kBAAkB,MAAM;AAC/B,WAAO,cAAc,MAAM;AAC3B,WAAO,aAAa,MAAM;AAC1B,WAAO,YAAY,MAAM;AAGzB,WAAO,WAAW,MAAM;AACxB,WAAO,gBAAgB,MAAM;AAC7B,WAAO,MAAM,MAAM;AACnB,WAAO,MAAM,MAAM;AACnB,WAAO,SAAS,MAAM;AAGtB,WAAO,YAAY,MAAM;AACzB,WAAO,aAAa,MAAM;AAG1B,WAAO,aAAa,MAAM;AAC1B,WAAO,gBAAgB,MAAM;AAC7B,WAAO,QAAQ,MAAM;AAErB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,mCACN,SACA,YACA,kBACQ;AACR,UAAM,mBAA6B,CAAC;AACpC,eAAW,SAAS,SAAS;AAC3B,uBAAiB,KAAK,MAAM,gBAAgB,CAAC;AAAA,IAC/C;AACA,UAAM,mBAAmB,OAAO,OAAO,gBAAgB;AACvD,UAAM,iBAAiB,iBAAiB;AAExC,UAAM,eAAe,OAAO,KAAK,YAAY,MAAM;AACnD,UAAM,gBAAgB,KAAK,IAAI,aAAa,QAAQ,KAAM;AAE1D,UAAM,aAAa,OAAO,MAAM,KAAK,aAAa;AAClD,QAAI,MAAM;AACV,eAAW,cAAc,YAAY,WAAW,GAAG;AACnD,WAAO;AACP,eAAW,cAAc,GAAG,GAAG;AAC/B,WAAO;AACP,eAAW,cAAc,GAAG,GAAG;AAC/B,WAAO;AACP,eAAW,cAAc,QAAQ,QAAQ,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,QAAQ,QAAQ,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,gBAAgB,GAAG;AAC5C,WAAO;AACP,eAAW,cAAc,kBAAkB,GAAG;AAC9C,WAAO;AACP,eAAW,cAAc,eAAe,GAAG;AAC3C,WAAO;AACP,QAAI,gBAAgB,GAAG;AACrB,mBAAa,KAAK,YAAY,KAAK,GAAG,aAAa;AAAA,IACrD;AAEA,WAAO,OAAO,OAAO,CAAC,kBAAkB,UAAU,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,mBACJ,iBACA,SACgC;AAChC,UAAM,gBAAgB,KAAK,OAAO,QAAQ,eAAe;AAEzD,QAAI,gBAAgB,SAAS,cACzB,cAAc,OAAO,QAAQ,WAAW,IACxC;AAEJ,QAAI,SAAS,aAAa;AACxB,sBAAgB,CAAC,GAAG,aAAa,EAAE,KAAK,QAAQ,WAAW;AAAA,IAC7D;AAEA,QAAI,cAAc,WAAW,GAAG;AAC9B,YAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAEA,UAAM,eAAyB,CAAC;AAChC,QAAI,aAAa;AACjB,UAAM,gBAA4B,CAAC;AAEnC,eAAW,eAAe,eAAe;AACvC,YAAM,oBAAoB;AAC1B,YAAM,cAAc,KAAK,eAAe,iBAAiB,WAAW;AACpE,mBAAa,KAAK,WAAW;AAC7B,oBAAc,YAAY;AAC1B,YAAM,cAAc,KAAK,qBAAqB,aAAa,iBAAiB;AAC5E,oBAAc,KAAK,WAAW;AAAA,IAChC;AAEA,UAAM,kBAAkB,OAAO,OAAO,YAAY;AAElD,WAAO;AAAA,MACL;AAAA,MACA,eAAe,gBAAgB;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,6BACE,SACA,SACQ;AACR,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAEA,UAAM,aAAa,SAAS,cAAc;AAC1C,UAAM,mBAAmB,SAAS,oBAAoB;AACtD,UAAM,SAAiB,KAAK;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,cACJ,iBACA,SACqB;AACrB,UAAM,EAAE,iBAAiB,eAAe,cAAc,IAAI,MAAM,KAAK;AAAA,MACnE;AAAA,MACA;AAAA,IACF;AAEA,UAAM,aACJ,SAAS,qBAAqB,SAAS,KAAK,OAAO,cAAc,IAC7D,KAAK,OAAO,cAAc,IAC1B;AAEN,UAAM,iBAAiB,KAAK,6BAA6B,eAAe;AAAA,MACtE;AAAA,MACA,kBAAkB;AAAA,IACpB,CAAC;AAED,UAAM,YAAY,OAAO,OAAO,CAAC,iBAAiB,cAAc,CAAC;AAEjE,WAAO;AAAA,MACL,SAAS,cAAc,IAAI,YAAU;AAAA,QACnC,UAAU,MAAM;AAAA,QAChB,mBAAmB,MAAM;AAAA,QACzB,gBAAgB,MAAM;AAAA,MACxB,EAAE;AAAA,MACF,kBAAkB;AAAA,MAClB,cAAc,cAAc;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACF;;;AC3ZA,IAAM,UAAU;AAAA;AAAA,EAEd,QAAQ;AAAA;AAAA,EAER,OAAO;AAAA;AAAA,EAEP,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA,EAMZ,aAAa,OAAO,gBAAgB,eAAe,OAAO,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOzE,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAAY;AACd;AAEA,IAAO,kBAAQ;;;ACtDR,IAAM,WAAW;AAAA,EACtB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,aAAa;AAAA,EACb,SAAS;AAAA,EACT,MAAM;AAAA,EACN,QAAQ;AACV;AAGO,SAAS,gBAAgB,QAAgB,OAAuB;AACrE,MAAI,MAAM,OAAO,KAAK,OAAO,SAAS,OAAO,QAAQ,CAAC,CAAC;AACvD,MAAI,OAAO;AAEX,SAAO,SAAS,KAAK,IAAI,SAAS,KAAK,CAAC,EAAE;AAC5C;AAGO,IAAM,OAAO,CAAC,GAAW,MAAc,KAAK,KAAK,GAAG,CAAC,MAAM;AAQ3D,SAAS,SAAS,KAAiC;AACxD,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,aAAa;AACnB,SAAO,OAAO,WAAW,OAAO,cACzB,OAAO,WAAW,UAAU,cAC5B,OAAO,WAAW,WAAW;AACtC;AAKO,SAAS,UAAU,OAAqE;AAC7F,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,2BAA2B;AACpD,WAAO,SAAS;AAAA,EAClB,WACS,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM,kBAAkB;AACnE,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,0BAA0B;AACnD,WAAO,SAAS;AAAA,EAClB,WACS,OAAO,SAAS,KAAK,GAAG;AAC/B,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,2BAA2B;AACpD,WAAO,SAAS;AAAA,EAClB,WAAY,iBAAiB,MAAM;AACjC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,yBAAyB;AAClD,WAAO,SAAS;AAAA,EAClB,WAAW,iBAAiB,YAAY;AACtC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,4BAA4B;AACrD,WAAO,SAAS;AAAA,EAClB,WACS,iBAAiB,aAAa;AACrC,QAAI,CAAC,gBAAQ;AACX,YAAM,IAAI,MAAM,eAAO,gCAAgC;AACzD,WAAO,SAAS;AAAA,EAClB,OAAO;AACL,UAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,EAC7C;AACF;AAMO,IAAM,iBAAiB,CAAC,aAA8B;AAC3D,SAAO,cAAc,QAAQ;AAC/B;;;AC/FO,IAAM,kBAAN,MAAsB;AAAA,EAQ3B,YAAY,UAAkB,YAAoB;AAFlD,SAAQ,sBAA8B;AAGpC,SAAK,WAAW;AAChB,SAAK,aAAa;AAClB,SAAK,iBAAiB;AACtB,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,iBAAiB,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,gBAA8B;AACnC,SAAK,kBAAkB;AACvB,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,YAA0B;AACtC,SAAK,aAAa;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAuB;AAC7B,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,UAAU,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAKxE,UAAM,eACJ,UAAU,KAAK,uBACd,MAAM,KAAK,iBAAkB;AAEhC,QAAI,cAAc;AAChB,WAAK,sBAAsB;AAC3B,WAAK,iBAAiB;AACtB,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAsB;AAC5B,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,UAAM,OAAO,KAAK,iBAAiB;AACnC,UAAM,MAAM,KAAK,aAAa,KAAK,kBAC9B,KAAK,aAAa,KAAK,kBAAkB,OAC1C;AACJ,UAAM,UAAU,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAExE,UAAM,cAAc,CAAC,UAA0B;AAC7C,YAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,IAAI;AACpC,UAAI,OAAO;AACX,UAAI,YAAY;AAEhB,aAAO,QAAQ,QAAQ,YAAY,MAAM,SAAS,GAAG;AACnD,gBAAQ;AACR;AAAA,MACF;AAEA,aAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,IAC9C;AAEA,UAAM,aAAa,CAAC,YAA4B;AAC9C,UAAI,UAAU,GAAI,QAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC;AAC9C,UAAI,UAAU,KAAM,QAAO,GAAG,KAAK,MAAM,UAAU,EAAE,CAAC,MAAM,UAAU,IAAI,QAAQ,CAAC,CAAC;AACpF,aAAO,GAAG,KAAK,MAAM,UAAU,IAAI,CAAC,KAAK,KAAK,MAAO,UAAU,OAAQ,EAAE,CAAC;AAAA,IAC5E;AAEA,YAAQ,OAAO;AAAA,MACb,KAAK,KAAK,QAAQ,KAAK,OAAO,MAAM,YAAY,KAAK,cAAc,CAAC,IAAI,YAAY,KAAK,UAAU,CAAC,MAChG,YAAY,IAAI,CAAC,YAAY,WAAW,GAAG,CAAC;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,WAAiB;AACf,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,UAAM,OAAO,KAAK,iBAAiB;AAEnC,UAAM,cAAc,CAAC,UAA0B;AAC7C,YAAM,QAAQ,CAAC,KAAK,MAAM,MAAM,IAAI;AACpC,UAAI,OAAO;AACX,UAAI,YAAY;AAEhB,aAAO,QAAQ,QAAQ,YAAY,MAAM,SAAS,GAAG;AACnD,gBAAQ;AACR;AAAA,MACF;AAEA,aAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,GAAG,MAAM,SAAS,CAAC;AAAA,IAC9C;AAEA,YAAQ;AAAA,MACN,KAAK,KAAK,QAAQ,WAAW,YAAY,KAAK,cAAc,CAAC,MACzD,YAAY,IAAI,CAAC,oBAAoB,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,qBAA6B;AAC3B,WAAO,KAAK,MAAO,KAAK,iBAAiB,KAAK,aAAc,GAAG;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA,EAKA,oBAA4B;AAC1B,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,aAAa;AAChD,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AACF;;;AC5HO,IAAM,oBAAN,MAAwB;AAAA,EAG7B,cAAc;AAFd,SAAQ,YAAuD,oBAAI,IAAI;AAIrE,SAAK,iBAAiB,IAAI,UAAU,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,UAAoC;AACnD,QAAI,SAAS,4BAAqC,GAAG;AACnD,WAAK,UAAU,wBAAiC,QAAQ;AAAA,IAC1D;AACA,QAAI,SAAS,yBAAkC,GAAG;AAChD,WAAK,UAAU,qBAA8B,QAAQ;AAAA,IACvD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,sBAA0C;AACxC,WAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAAqD;AAC/D,WAAO,KAAK,UAAU,IAAI,MAAM,KAAK;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,MAAc,SAAuD;AACjF,UAAM,WAAW,KAAK,YAAY,QAAQ,MAAM;AAChD,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,+CAA+C,QAAQ,MAAM;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,QAAQ,MAAM,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,MAAc,SAAuD;AACjF,UAAM,WAAW,KAAK,YAAY,QAAQ,MAAM;AAChD,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,SAAS;AAAA,QACT,OAAO,+CAA+C,QAAQ,MAAM;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,QAAQ,MAAM,OAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAyC;AACvC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB,SAAoE;AAClF,UAAM,SAAmB,CAAC;AAE1B,QAAI,CAAC,QAAQ,QAAQ;AACnB,aAAO,KAAK,+BAA+B;AAAA,IAC7C;AAEA,QAAI,CAAC,QAAQ,YAAY,QAAQ,SAAS,WAAW,GAAG;AACtD,aAAO,KAAK,sBAAsB;AAAA,IACpC;AAEA,QAAI,QAAQ,YAAY,QAAQ,SAAS,SAAS,GAAG;AACnD,aAAO,KAAK,6CAA6C;AAAA,IAC3D;AAEA,WAAO;AAAA,MACL,SAAS,OAAO,WAAW;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,QAAuF;AACnG,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,MACL,MAAM,SAAS,cAAc;AAAA,MAC7B,WAAW,SAAS,aAAa;AAAA,MACjC,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAqG;AACnG,UAAM,UAAiG,CAAC;AAExG,eAAW,CAAC,QAAQ,QAAQ,KAAK,KAAK,WAAW;AAC/C,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM,SAAS,cAAc;AAAA,QAC7B,WAAW,SAAS,aAAa;AAAA,QACjC,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAEA,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM;AAE5B,aAAO,EAAE,KAAK,cAAc,EAAE,IAAI;AAAA,IACpC,CAAC;AAAA,EACH;AACF;;;AClHA,IAAM,cAAc,oBAAI,KAAK;AAC7B,IAAM,cAAc,GAAG,OAAO,YAAY,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,IAAI,OAAO,YAAY,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,IAAI,YAAY,YAAY,CAAC;AAElJ,IAAM,UAAU;AAAA,EACrB,QAAQ;AAAA;AAAA,EACR,MAAM;AACR;;;ACbA,IAAO,eAAQ;;;ACKf,IAAqB,gBAArB,cAA2C,aAAO;AAAA,EAChD,cAAc;AACZ,UAAM;AAAA,EAOR;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,MAAwC;AACxD,QAAI,UAAU,IAAI,MAAM,SAAS,MAAM;AACrC,YAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,IAC7C;AAEA,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,SAAS,IAAI,OAAO,WAAW;AACrC,aAAO,kBAAkB,IAAI;AAE7B,aAAO,SAAS,CAAC,MAAiC;AAChD,YAAI,CAAC,OAAO,QAAQ;AAClB,iBAAO,IAAI,MAAM,qBAAqB,CAAC;AACvC;AAAA,QACF;AAEA,YAAI;AAEF,gBAAM,SAAS,OAAO,KAAK,OAAO,MAAqB;AAQvD,gBAAM,UAAU,MAAM,QAAQ,MAAM;AACpC,kBAAQ,OAAO;AAAA,QACjB,SAAS,OAAO;AACd,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAEA,aAAO,UAAU,MAAM;AACrB,eAAO,OAAO,SAAS,IAAI,MAAM,qBAAqB,CAAC;AAAA,MACzD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKA,mBAAmB,MAA0B;AAC3C,UAAM,QAAQ,MAAM,eAAe,KAAK,IAAI;AAC5C,UAAM,WAAW;AACjB,UAAM,mBAAmB,KAAK;AAE9B,UAAM,WAAW,IAAI,KAAK,KAAK,YAAY;AAC3C,UAAM,cAAc,MAAM,YAAY,QAAQ;AAC9C,UAAM,YAAoB,WAAW;AAErC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,MAAiC;AAC9C,UAAM,cAAc,MAAM,KAAK,YAAY;AAC3C,UAAM,SAAS,OAAO,KAAK,WAAW;AACtC,WAAO,OAAO,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAAiB,OAAiB,MAAY,SAA4C;AAC9F,QAAI,UAAU,IAAI,MAAM,SAAS,MAAM;AACrC,YAAM,IAAI,MAAM,eAAO,oBAAoB;AAAA,IAC7C;AAEA,WAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC5C,YAAM,gBAAgB,OAAOC,QAAiBC,OAAcC,aAA+C;AAEzG,eAAO,MAAM,KAAK,aAAaF,QAAOC,OAAMC,QAAO;AAAA,MACrD;AAEA,YAAM,SAAS,IAAI,OAAO,WAAW;AACrC,aAAO,kBAAkB,IAAI;AAE7B,aAAO,SAAS,eAAiC,GAA8B;AAC7E,YAAI,CAAC,KAAK,QAAQ;AAChB,iBAAO,IAAI,MAAM,qBAAqB,CAAC;AACvC;AAAA,QACF;AACA,YAAI;AACF,gBAAM,SAAS,OAAO,KAAK,KAAK,MAAqB;AACrD,gBAAM,SAAS,MAAM,cAAc,OAAO,QAAQ,OAAO;AACzD,kBAAQ,MAAM;AAAA,QAChB,SAAS,OAAO;AACd,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAEA,aAAO,UAAU,SAA2B,GAA8B;AACxE,eAAO,KAAK,SAAS,IAAI,MAAM,qBAAqB,CAAC;AAAA,MACvD;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA,EAKA,MAAM,YAAY,OAAiB,eAA+C;AAChF,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,QAAQ,OAAO,aAAa;AACvD,UAAI,CAAC,QAAS,QAAO;AAGrB,YAAM,aAAa,IAAI,WAAW,OAAO;AACzC,aAAO,IAAI,KAAK,CAAC,UAAU,GAAG,EAAE,MAAM,2BAA2B,CAAC;AAAA,IACpE,SAAS,OAAO;AACd,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA,EAKA,MAAM,cAAc,YAA8B,SAAkD;AAClG,UAAM,WAAW,SAAS,YAAY,MAAM;AAAA,IAAC;AAC7C,UAAM,eAAe,SAAS,gBAAgB,MAAM;AAAA,IAAC;AAErD,UAAM,aAAa,MAAM,aAAa;AACtC,QAAI,CAAC,YAAY;AACf,eAAS,IAAI,MAAM,eAAO,QAAQ,CAAC;AACnC,aAAO;AAAA,IACT;AAEA,QAAI,SAAS;AACb,UAAM,UAAoB,CAAC;AAE3B,eAAW,SAAS,YAAY;AAC9B,UAAI,CAAC,MAAM,WAAW;AAEpB,YAAI,cAAc,MAAM,YAAY,EAAE,GAAG;AAEvC,gBAAM,YAAY;AAAA,QAEpB,OAAO;AACL,gBAAM,SAAS,MAAM,MAAM,UAAU,KAAK;AAC1C,gBAAM,iBAAiB;AACvB,oBAAU,OAAO;AACjB,kBAAQ,KAAK,MAAM;AACnB,uBAAa,OAAO,QAAQ;AAC5B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,MAAM,UAAU;AACnB,iBAAS,IAAI,MAAM,eAAO,cAAc,CAAC;AACzC,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,MAAM,MAAM,SAAS,YAAY;AAGpD,UAAI,MAAM,WAAW,MAAM,kBAAkB,MAAM,KAAK;AAEtD,cAAM,WAAW,MAAM,eAAe;AACtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,MAAM,QAAQ;AAE1C,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,MAAM,OAAO;AAC1B,qBAAa,OAAO,0BAA0B;AAC9C;AAAA,MACF;AAGA,UAAI,cAAc,MAAM,YAAY,EAAE,GAAG;AAEvC,cAAM,SAAS,OAAO,KAAK,UAAU;AAGrC,cAAM,MAAM,MAAM,MAAM;AAGxB,cAAM,YAAY;AAClB,cAAM,iBAAiB,OAAO;AAC9B,cAAM,mBAAmB,OAAO;AAKhC,cAAM,WAAW,MAAM,eAAe;AACtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,OAAO;AAEnC,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,MAAM;AACnB,qBAAa,OAAO,mBAAmB;AAAA,MACzC,OAAO;AAEL,cAAM,UAAU,MAAM,KAAK,aAAa,OAAO,OAAO,KAAK,UAAU,GAAG,UAAU;AAClF,cAAM,WAAW,MAAM,eAAe;AAEtC,cAAM,iBAAiB;AACvB,kBAAU,SAAS,SAAS,QAAQ;AAEpC,gBAAQ,KAAK,QAAQ;AACrB,gBAAQ,KAAK,OAAO;AACpB,qBAAa,OAAO,SAAS;AAAA,MAC/B;AAAA,IACF;AAEA,UAAM,mBAAmB;AACzB,eAAW,SAAS,YAAY;AAC9B,YAAM,kBAAkB,MAAM,gBAAgB;AAC9C,gBAAU,gBAAgB;AAC1B,cAAQ,KAAK,eAAe;AAAA,IAC9B;AAEA,UAAM,iBAAiB,SAAS;AAChC,UAAM,QAAQ,MAAM,cAAc,gBAAgB,gBAAgB;AAClE,YAAQ,KAAK,KAAK;AAElB,UAAM,iBAAiB,OAAO,OAAO,OAAO;AAE5C,UAAM,aAAa,IAAI,WAAW,cAAc;AAChD,WAAO,IAAI,KAAK,CAAC,UAAU,GAAG,EAAE,MAAM,kBAAkB,CAAC;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,eAAe,UAA2B;AAChD,WAAO,cAAc,QAAQ;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,QAAQ,MAAgB,SAA8C;AAE1E,UAAM,QAAQ,KAAK,mBAAmB,IAAI;AAK1C,UAAM,WAAW;AACjB,UAAM,iBAAiB,MAAM,KAAK,iBAAiB,OAAO,UAAU,OAAO;AAC3E,UAAM,UAAU;AAEhB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,OAAiB,eAA2C;AAC5E,QAAI;AACF,YAAM,OAAO,MAAM,KAAK,YAAY,OAAO,aAAa;AACxD,aAAO,SAAS;AAAA,IAClB,SAAS,OAAO;AACd,cAAQ,MAAM,2BAA2B,MAAM,QAAQ,KAAK,KAAK;AACjE,aAAO;AAAA,IACT;AAAA,EACF;AACF;;;AzBtSA,IAAI,OAAO,eAAe,aAAa;AACrC,EAAC,WAAmB,SAAS;AAC/B;AAkBO,IAAM,gBAAgB;AAAA,EAC3B,WAAW,OAAO,WAAW,eAAe,OAAO,aAAa;AAAA,EAChE,QAAQ,OAAO,YAAY,eAAe,QAAQ,YAAY,QAAQ,SAAS;AACjF;",
+  "names": ["len", "i", "len2", "Buffer", "i", "byteLength", "readBigUInt64LE", "crc32", "crc32", "require_deflate", "crc32", "require_inflate", "t", "t2", "t3", "t4", "ENCRYPT_HDR_SIZE", "pako", "sha256", "dataStart", "dataEnd", "entry", "data", "options"]
 }