@rebasepro/server 0.14.0 → 0.14.1

package/dist/jwt-VJyXTdQQ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jwt-VJyXTdQQ.js","names":["Stream","util","Buffer","util","Buffer","Stream","util","KeyObject","createPublicKey","createSecretKey","createPrivateKey"],"sources":["../../types/src/types/storage_source.ts","../../../node_modules/.pnpm/safe-buffer@5.2.1/node_modules/safe-buffer/index.js","../../../node_modules/.pnpm/jws@4.0.1/node_modules/jws/lib/data-stream.js","../../../node_modules/.pnpm/ecdsa-sig-formatter@1.0.11/node_modules/ecdsa-sig-formatter/src/param-bytes-for-alg.js","../../../node_modules/.pnpm/ecdsa-sig-formatter@1.0.11/node_modules/ecdsa-sig-formatter/src/ecdsa-sig-formatter.js","../../../node_modules/.pnpm/buffer-equal-constant-time@1.0.1/node_modules/buffer-equal-constant-time/index.js","../../../node_modules/.pnpm/jwa@2.0.1/node_modules/jwa/index.js","../../../node_modules/.pnpm/jws@4.0.1/node_modules/jws/lib/tostring.js","../../../node_modules/.pnpm/jws@4.0.1/node_modules/jws/lib/sign-stream.js","../../../node_modules/.pnpm/jws@4.0.1/node_modules/jws/lib/verify-stream.js","../../../node_modules/.pnpm/jws@4.0.1/node_modules/jws/index.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/decode.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/JsonWebTokenError.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/NotBeforeError.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/TokenExpiredError.js","../../../node_modules/.pnpm/ms@2.1.3/node_modules/ms/index.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/timespan.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/constants.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/debug.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/re.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/parse-options.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/identifiers.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/semver.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/parse.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/valid.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/clean.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/inc.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/diff.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/major.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/minor.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/patch.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/prerelease.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rcompare.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-loose.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/compare-build.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/sort.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/rsort.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gt.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lt.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/eq.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/neq.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/gte.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/lte.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/cmp.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/coerce.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/truncate.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/internal/lrucache.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/range.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/classes/comparator.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/functions/satisfies.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/to-comparators.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/max-satisfying.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-satisfying.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/min-version.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/valid.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/outside.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/gtr.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/ltr.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/intersects.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/simplify.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/ranges/subset.js","../../../node_modules/.pnpm/semver@7.8.4/node_modules/semver/index.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/asymmetricKeyDetailsSupported.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/rsaPssKeyDetailsSupported.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/validateAsymmetricKey.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/lib/psSupported.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/verify.js","../../../node_modules/.pnpm/lodash.includes@4.3.0/node_modules/lodash.includes/index.js","../../../node_modules/.pnpm/lodash.isboolean@3.0.3/node_modules/lodash.isboolean/index.js","../../../node_modules/.pnpm/lodash.isinteger@4.0.4/node_modules/lodash.isinteger/index.js","../../../node_modules/.pnpm/lodash.isnumber@3.0.3/node_modules/lodash.isnumber/index.js","../../../node_modules/.pnpm/lodash.isplainobject@4.0.6/node_modules/lodash.isplainobject/index.js","../../../node_modules/.pnpm/lodash.isstring@4.0.1/node_modules/lodash.isstring/index.js","../../../node_modules/.pnpm/lodash.once@4.1.1/node_modules/lodash.once/index.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/sign.js","../../../node_modules/.pnpm/jsonwebtoken@9.0.3/node_modules/jsonwebtoken/index.js","../src/storage/keys.ts","../src/auth/jwt-keys.ts","../src/auth/jwt.ts"],"sourcesContent":["/**\n * Describes a named storage backend — a place files live.\n *\n * Declared once and shared front + back: the frontend uses it to decide\n * transport (HTTP proxy vs direct SDK), the backend uses the same `key`\n * to resolve a StorageController, and collection properties reference\n * a definition by its `key` via `StorageConfig.storageSource`.\n *\n * This mirrors the {@link DataSourceDefinition} pattern used for databases.\n *\n * @group Models\n */\n\n/**\n * The default storage source key, used when a property does not specify\n * a `storageSource`. Shared by the frontend and backend registries so\n * both agree on \"the default storage backend\".\n * @group Models\n */\nexport const DEFAULT_STORAGE_SOURCE_KEY = \"(default)\";\n\n/**\n * How the *frontend* reaches a storage backend.\n *\n * - `\"server\"` — through the Rebase backend REST API (`/api/storage`).\n *   The backend holds the actual `StorageController` and routes by\n *   storage-source key. This is the default and covers Local, S3, GCS,\n *   and any other server-mediated engine.\n * - `\"direct\"` — straight from the client to the external backend via\n *   its own SDK (e.g. Firebase Storage via `@firebase/storage`).\n *   The Rebase backend is **not** in the upload/download path.\n *\n * @group Models\n */\nexport type StorageSourceTransport = \"server\" | \"direct\";\n\n/**\n * Declarative definition of a storage source — a named place files live.\n *\n * Declared once and shared front and back: the frontend uses it to decide\n * transport (client HTTP proxy vs direct provider SDK), the backend uses\n * the same `key` to resolve a `StorageController`, and collection\n * properties reference a definition by its `key` via\n * `StorageConfig.storageSource`.\n *\n * @group Models\n */\nexport interface StorageSourceDefinition {\n    /**\n     * Unique identifier for this storage source. Collection properties\n     * point at it via `StorageConfig.storageSource`.\n     * Defaults to {@link DEFAULT_STORAGE_SOURCE_KEY}.\n     */\n    key: string;\n\n    /**\n     * The engine backing this storage source (e.g. `\"local\"`, `\"s3\"`,\n     * `\"gcs\"`, `\"firebase\"`, `\"azure\"`, or a custom id).\n     */\n    engine: string;\n\n    /**\n     * How the frontend reaches this storage. Defaults to `\"server\"`.\n     *\n     * When `\"direct\"`, the client uses a provider-specific SDK\n     * (e.g. `@firebase/storage`) and the backend does not proxy\n     * upload/download traffic for this source.\n     */\n    transport: StorageSourceTransport;\n\n    /** Human-readable label for the UI (e.g. \"Firebase Storage\", \"S3 Media\"). */\n    label?: string;\n}\n\n/**\n * A resolved storage source: the single source of truth that the frontend\n * router and backend registry both derive from.\n *\n * @group Models\n */\nexport interface ResolvedStorageSource {\n    /** Storage source key (routing key, shared front + back). */\n    key: string;\n    /** Engine backing the source. */\n    engine: string;\n    /** Frontend transport. */\n    transport: StorageSourceTransport;\n    /** Human-readable label. */\n    label?: string;\n}\n\n/**\n * The environment-variable suffix for a storage or data source key.\n *\n * `\"\"` for the default source — so a single-bucket project keeps configuring\n * plain `S3_BUCKET` — and `__<KEY>` for every named one, uppercased with\n * non-alphanumerics collapsed to underscores: `media-cdn` → `S3_BUCKET__MEDIA_CDN`.\n *\n * The rule derives the variable name from the declared key rather than\n * discovering keys by scanning the environment. Scanning would have to guess how\n * `S3_BUCKET__MEDIA_CDN` splits into a key; deriving cannot be ambiguous, and a\n * typo surfaces as a missing source at boot instead of a silently ignored\n * variable.\n *\n * It lives in this package, with no dependencies, because four things must agree\n * on it exactly: the CLI (validating a build), the runtime (reading its own\n * environment), the control plane (writing a tenant's Secret), and the docs. A\n * second implementation of a naming convention is a second chance to disagree.\n *\n * @group Models\n */\nexport function storageEnvSuffix(key: string, defaultKey: string = DEFAULT_STORAGE_SOURCE_KEY): string {\n    if (!key || key === defaultKey) return \"\";\n    const normalized = key\n        .replace(/[^A-Za-z0-9]+/g, \"_\")\n        .replace(/^_+|_+$/g, \"\")\n        .toUpperCase();\n    if (!normalized) {\n        throw new Error(\n            `Source key \"${key}\" cannot be turned into an environment variable name. ` +\n            \"Use a key containing at least one letter or digit.\"\n        );\n    }\n    return `__${normalized}`;\n}\n\n/**\n * Two distinct keys that collapse onto the same variable name, or `null`.\n *\n * `media-cdn` and `media_cdn` are different source keys but the same suffix, so\n * without this one of them silently reads the other's configuration. Returns the\n * offending pair rather than throwing, so each caller can raise it in its own\n * idiom — a `BundleError` at boot, a build failure in the CLI, a rejected deploy\n * in a control plane.\n *\n * @group Models\n */\nexport function findStorageSuffixCollision(\n    keys: string[],\n    defaultKey: string = DEFAULT_STORAGE_SOURCE_KEY\n): { a: string; b: string; suffix: string } | null {\n    const seen = new Map<string, string>();\n    for (const key of keys) {\n        const suffix = storageEnvSuffix(key, defaultKey);\n        const existing = seen.get(suffix);\n        if (existing !== undefined && existing !== key) {\n            return { a: existing, b: key, suffix };\n        }\n        seen.set(suffix, key);\n    }\n    return null;\n}\n\n/** The `storage` block of `rebase.json`, structurally. */\nexport type DeclaredStorageSources = Record<string, {\n    engine: string;\n    transport?: StorageSourceTransport;\n    label?: string;\n}>;\n\n/**\n * Merge the two places a project may declare storage sources into one list.\n *\n * `rebase.json` is authoritative for every field it states. Config code may add\n * sources it does not mention and fill in fields it left out, but may not\n * contradict it: the manifest is what a host reads to decide which buckets need\n * configuring, and a runtime that quietly disagreed with it would put the\n * console back to describing a topology the tenant does not have — the exact\n * failure this whole mechanism exists to end.\n *\n * Note what is *not* here: no default source is invented when both inputs are\n * empty. That decision belongs to the resolver, which knows whether declaring\n * nothing means \"one plain bucket\" (it does) or \"no storage at all\".\n *\n * @group Models\n */\nexport function normalizeStorageSources(\n    declared: DeclaredStorageSources | StorageSourceDefinition[] | undefined,\n    exported: StorageSourceDefinition[] | undefined\n): StorageSourceDefinition[] {\n    const merged = new Map<string, StorageSourceDefinition>();\n\n    // Two shapes, one meaning. `rebase.json` states sources as a record keyed by\n    // source key, which is how JSON expresses a set of named things; the bundle\n    // manifest stores the already-resolved array. Accepting both is what lets the\n    // CLI and the runtime call this with what each of them happens to hold.\n    const declaredEntries: [string, { engine: string; transport?: StorageSourceTransport; label?: string }][] =\n        Array.isArray(declared)\n            ? declared.filter(d => d?.key).map(d => [d.key, d])\n            : Object.entries(declared ?? {});\n\n    for (const [key, config] of declaredEntries) {\n        merged.set(key, {\n            key,\n            engine: config.engine,\n            transport: config.transport ?? \"server\",\n            ...(config.label !== undefined ? { label: config.label } : {})\n        });\n    }\n\n    for (const definition of exported ?? []) {\n        if (!definition?.key) continue;\n        const existing = merged.get(definition.key);\n        if (!existing) {\n            merged.set(definition.key, {\n                key: definition.key,\n                engine: definition.engine,\n                transport: definition.transport ?? \"server\",\n                ...(definition.label !== undefined ? { label: definition.label } : {})\n            });\n            continue;\n        }\n        // Fill gaps only. `rebase.json` stated these; code does not overrule it.\n        if (existing.label === undefined && definition.label !== undefined) {\n            existing.label = definition.label;\n        }\n    }\n\n    return Array.from(merged.values());\n}\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n  for (var key in src) {\n    dst[key] = src[key]\n  }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n  module.exports = buffer\n} else {\n  // Copy properties from require('buffer')\n  copyProps(buffer, exports)\n  exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n  if (typeof arg === 'number') {\n    throw new TypeError('Argument must not be a number')\n  }\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  var buf = Buffer(size)\n  if (fill !== undefined) {\n    if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n  } else {\n    buf.fill(0)\n  }\n  return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return buffer.SlowBuffer(size)\n}\n","/*global module, process*/\nvar Buffer = require('safe-buffer').Buffer;\nvar Stream = require('stream');\nvar util = require('util');\n\nfunction DataStream(data) {\n  this.buffer = null;\n  this.writable = true;\n  this.readable = true;\n\n  // No input\n  if (!data) {\n    this.buffer = Buffer.alloc(0);\n    return this;\n  }\n\n  // Stream\n  if (typeof data.pipe === 'function') {\n    this.buffer = Buffer.alloc(0);\n    data.pipe(this);\n    return this;\n  }\n\n  // Buffer or String\n  // or Object (assumedly a passworded key)\n  if (data.length || typeof data === 'object') {\n    this.buffer = data;\n    this.writable = false;\n    process.nextTick(function () {\n      this.emit('end', data);\n      this.readable = false;\n      this.emit('close');\n    }.bind(this));\n    return this;\n  }\n\n  throw new TypeError('Unexpected data type ('+ typeof data + ')');\n}\nutil.inherits(DataStream, Stream);\n\nDataStream.prototype.write = function write(data) {\n  this.buffer = Buffer.concat([this.buffer, Buffer.from(data)]);\n  this.emit('data', data);\n};\n\nDataStream.prototype.end = function end(data) {\n  if (data)\n    this.write(data);\n  this.emit('end', data);\n  this.emit('close');\n  this.writable = false;\n  this.readable = false;\n};\n\nmodule.exports = DataStream;\n","'use strict';\n\nfunction getParamSize(keySize) {\n\tvar result = ((keySize / 8) | 0) + (keySize % 8 === 0 ? 0 : 1);\n\treturn result;\n}\n\nvar paramBytesForAlg = {\n\tES256: getParamSize(256),\n\tES384: getParamSize(384),\n\tES512: getParamSize(521)\n};\n\nfunction getParamBytesForAlg(alg) {\n\tvar paramBytes = paramBytesForAlg[alg];\n\tif (paramBytes) {\n\t\treturn paramBytes;\n\t}\n\n\tthrow new Error('Unknown algorithm \"' + alg + '\"');\n}\n\nmodule.exports = getParamBytesForAlg;\n","'use strict';\n\nvar Buffer = require('safe-buffer').Buffer;\n\nvar getParamBytesForAlg = require('./param-bytes-for-alg');\n\nvar MAX_OCTET = 0x80,\n\tCLASS_UNIVERSAL = 0,\n\tPRIMITIVE_BIT = 0x20,\n\tTAG_SEQ = 0x10,\n\tTAG_INT = 0x02,\n\tENCODED_TAG_SEQ = (TAG_SEQ | PRIMITIVE_BIT) | (CLASS_UNIVERSAL << 6),\n\tENCODED_TAG_INT = TAG_INT | (CLASS_UNIVERSAL << 6);\n\nfunction base64Url(base64) {\n\treturn base64\n\t\t.replace(/=/g, '')\n\t\t.replace(/\\+/g, '-')\n\t\t.replace(/\\//g, '_');\n}\n\nfunction signatureAsBuffer(signature) {\n\tif (Buffer.isBuffer(signature)) {\n\t\treturn signature;\n\t} else if ('string' === typeof signature) {\n\t\treturn Buffer.from(signature, 'base64');\n\t}\n\n\tthrow new TypeError('ECDSA signature must be a Base64 string or a Buffer');\n}\n\nfunction derToJose(signature, alg) {\n\tsignature = signatureAsBuffer(signature);\n\tvar paramBytes = getParamBytesForAlg(alg);\n\n\t// the DER encoded param should at most be the param size, plus a padding\n\t// zero, since due to being a signed integer\n\tvar maxEncodedParamLength = paramBytes + 1;\n\n\tvar inputLength = signature.length;\n\n\tvar offset = 0;\n\tif (signature[offset++] !== ENCODED_TAG_SEQ) {\n\t\tthrow new Error('Could not find expected \"seq\"');\n\t}\n\n\tvar seqLength = signature[offset++];\n\tif (seqLength === (MAX_OCTET | 1)) {\n\t\tseqLength = signature[offset++];\n\t}\n\n\tif (inputLength - offset < seqLength) {\n\t\tthrow new Error('\"seq\" specified length of \"' + seqLength + '\", only \"' + (inputLength - offset) + '\" remaining');\n\t}\n\n\tif (signature[offset++] !== ENCODED_TAG_INT) {\n\t\tthrow new Error('Could not find expected \"int\" for \"r\"');\n\t}\n\n\tvar rLength = signature[offset++];\n\n\tif (inputLength - offset - 2 < rLength) {\n\t\tthrow new Error('\"r\" specified length of \"' + rLength + '\", only \"' + (inputLength - offset - 2) + '\" available');\n\t}\n\n\tif (maxEncodedParamLength < rLength) {\n\t\tthrow new Error('\"r\" specified length of \"' + rLength + '\", max of \"' + maxEncodedParamLength + '\" is acceptable');\n\t}\n\n\tvar rOffset = offset;\n\toffset += rLength;\n\n\tif (signature[offset++] !== ENCODED_TAG_INT) {\n\t\tthrow new Error('Could not find expected \"int\" for \"s\"');\n\t}\n\n\tvar sLength = signature[offset++];\n\n\tif (inputLength - offset !== sLength) {\n\t\tthrow new Error('\"s\" specified length of \"' + sLength + '\", expected \"' + (inputLength - offset) + '\"');\n\t}\n\n\tif (maxEncodedParamLength < sLength) {\n\t\tthrow new Error('\"s\" specified length of \"' + sLength + '\", max of \"' + maxEncodedParamLength + '\" is acceptable');\n\t}\n\n\tvar sOffset = offset;\n\toffset += sLength;\n\n\tif (offset !== inputLength) {\n\t\tthrow new Error('Expected to consume entire buffer, but \"' + (inputLength - offset) + '\" bytes remain');\n\t}\n\n\tvar rPadding = paramBytes - rLength,\n\t\tsPadding = paramBytes - sLength;\n\n\tvar dst = Buffer.allocUnsafe(rPadding + rLength + sPadding + sLength);\n\n\tfor (offset = 0; offset < rPadding; ++offset) {\n\t\tdst[offset] = 0;\n\t}\n\tsignature.copy(dst, offset, rOffset + Math.max(-rPadding, 0), rOffset + rLength);\n\n\toffset = paramBytes;\n\n\tfor (var o = offset; offset < o + sPadding; ++offset) {\n\t\tdst[offset] = 0;\n\t}\n\tsignature.copy(dst, offset, sOffset + Math.max(-sPadding, 0), sOffset + sLength);\n\n\tdst = dst.toString('base64');\n\tdst = base64Url(dst);\n\n\treturn dst;\n}\n\nfunction countPadding(buf, start, stop) {\n\tvar padding = 0;\n\twhile (start + padding < stop && buf[start + padding] === 0) {\n\t\t++padding;\n\t}\n\n\tvar needsSign = buf[start + padding] >= MAX_OCTET;\n\tif (needsSign) {\n\t\t--padding;\n\t}\n\n\treturn padding;\n}\n\nfunction joseToDer(signature, alg) {\n\tsignature = signatureAsBuffer(signature);\n\tvar paramBytes = getParamBytesForAlg(alg);\n\n\tvar signatureBytes = signature.length;\n\tif (signatureBytes !== paramBytes * 2) {\n\t\tthrow new TypeError('\"' + alg + '\" signatures must be \"' + paramBytes * 2 + '\" bytes, saw \"' + signatureBytes + '\"');\n\t}\n\n\tvar rPadding = countPadding(signature, 0, paramBytes);\n\tvar sPadding = countPadding(signature, paramBytes, signature.length);\n\tvar rLength = paramBytes - rPadding;\n\tvar sLength = paramBytes - sPadding;\n\n\tvar rsBytes = 1 + 1 + rLength + 1 + 1 + sLength;\n\n\tvar shortLength = rsBytes < MAX_OCTET;\n\n\tvar dst = Buffer.allocUnsafe((shortLength ? 2 : 3) + rsBytes);\n\n\tvar offset = 0;\n\tdst[offset++] = ENCODED_TAG_SEQ;\n\tif (shortLength) {\n\t\t// Bit 8 has value \"0\"\n\t\t// bits 7-1 give the length.\n\t\tdst[offset++] = rsBytes;\n\t} else {\n\t\t// Bit 8 of first octet has value \"1\"\n\t\t// bits 7-1 give the number of additional length octets.\n\t\tdst[offset++] = MAX_OCTET\t| 1;\n\t\t// length, base 256\n\t\tdst[offset++] = rsBytes & 0xff;\n\t}\n\tdst[offset++] = ENCODED_TAG_INT;\n\tdst[offset++] = rLength;\n\tif (rPadding < 0) {\n\t\tdst[offset++] = 0;\n\t\toffset += signature.copy(dst, offset, 0, paramBytes);\n\t} else {\n\t\toffset += signature.copy(dst, offset, rPadding, paramBytes);\n\t}\n\tdst[offset++] = ENCODED_TAG_INT;\n\tdst[offset++] = sLength;\n\tif (sPadding < 0) {\n\t\tdst[offset++] = 0;\n\t\tsignature.copy(dst, offset, paramBytes);\n\t} else {\n\t\tsignature.copy(dst, offset, paramBytes + sPadding);\n\t}\n\n\treturn dst;\n}\n\nmodule.exports = {\n\tderToJose: derToJose,\n\tjoseToDer: joseToDer\n};\n","/*jshint node:true */\n'use strict';\nvar Buffer = require('buffer').Buffer; // browserify\nvar SlowBuffer = require('buffer').SlowBuffer;\n\nmodule.exports = bufferEq;\n\nfunction bufferEq(a, b) {\n\n  // shortcutting on type is necessary for correctness\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    return false;\n  }\n\n  // buffer sizes should be well-known information, so despite this\n  // shortcutting, it doesn't leak any information about the *contents* of the\n  // buffers.\n  if (a.length !== b.length) {\n    return false;\n  }\n\n  var c = 0;\n  for (var i = 0; i < a.length; i++) {\n    /*jshint bitwise:false */\n    c |= a[i] ^ b[i]; // XOR\n  }\n  return c === 0;\n}\n\nbufferEq.install = function() {\n  Buffer.prototype.equal = SlowBuffer.prototype.equal = function equal(that) {\n    return bufferEq(this, that);\n  };\n};\n\nvar origBufEqual = Buffer.prototype.equal;\nvar origSlowBufEqual = SlowBuffer.prototype.equal;\nbufferEq.restore = function() {\n  Buffer.prototype.equal = origBufEqual;\n  SlowBuffer.prototype.equal = origSlowBufEqual;\n};\n","var Buffer = require('safe-buffer').Buffer;\nvar crypto = require('crypto');\nvar formatEcdsa = require('ecdsa-sig-formatter');\nvar util = require('util');\n\nvar MSG_INVALID_ALGORITHM = '\"%s\" is not a valid algorithm.\\n  Supported algorithms are:\\n  \"HS256\", \"HS384\", \"HS512\", \"RS256\", \"RS384\", \"RS512\", \"PS256\", \"PS384\", \"PS512\", \"ES256\", \"ES384\", \"ES512\" and \"none\".'\nvar MSG_INVALID_SECRET = 'secret must be a string or buffer';\nvar MSG_INVALID_VERIFIER_KEY = 'key must be a string or a buffer';\nvar MSG_INVALID_SIGNER_KEY = 'key must be a string, a buffer or an object';\n\nvar supportsKeyObjects = typeof crypto.createPublicKey === 'function';\nif (supportsKeyObjects) {\n  MSG_INVALID_VERIFIER_KEY += ' or a KeyObject';\n  MSG_INVALID_SECRET += 'or a KeyObject';\n}\n\nfunction checkIsPublicKey(key) {\n  if (Buffer.isBuffer(key)) {\n    return;\n  }\n\n  if (typeof key === 'string') {\n    return;\n  }\n\n  if (!supportsKeyObjects) {\n    throw typeError(MSG_INVALID_VERIFIER_KEY);\n  }\n\n  if (typeof key !== 'object') {\n    throw typeError(MSG_INVALID_VERIFIER_KEY);\n  }\n\n  if (typeof key.type !== 'string') {\n    throw typeError(MSG_INVALID_VERIFIER_KEY);\n  }\n\n  if (typeof key.asymmetricKeyType !== 'string') {\n    throw typeError(MSG_INVALID_VERIFIER_KEY);\n  }\n\n  if (typeof key.export !== 'function') {\n    throw typeError(MSG_INVALID_VERIFIER_KEY);\n  }\n};\n\nfunction checkIsPrivateKey(key) {\n  if (Buffer.isBuffer(key)) {\n    return;\n  }\n\n  if (typeof key === 'string') {\n    return;\n  }\n\n  if (typeof key === 'object') {\n    return;\n  }\n\n  throw typeError(MSG_INVALID_SIGNER_KEY);\n};\n\nfunction checkIsSecretKey(key) {\n  if (Buffer.isBuffer(key)) {\n    return;\n  }\n\n  if (typeof key === 'string') {\n    return key;\n  }\n\n  if (!supportsKeyObjects) {\n    throw typeError(MSG_INVALID_SECRET);\n  }\n\n  if (typeof key !== 'object') {\n    throw typeError(MSG_INVALID_SECRET);\n  }\n\n  if (key.type !== 'secret') {\n    throw typeError(MSG_INVALID_SECRET);\n  }\n\n  if (typeof key.export !== 'function') {\n    throw typeError(MSG_INVALID_SECRET);\n  }\n}\n\nfunction fromBase64(base64) {\n  return base64\n    .replace(/=/g, '')\n    .replace(/\\+/g, '-')\n    .replace(/\\//g, '_');\n}\n\nfunction toBase64(base64url) {\n  base64url = base64url.toString();\n\n  var padding = 4 - base64url.length % 4;\n  if (padding !== 4) {\n    for (var i = 0; i < padding; ++i) {\n      base64url += '=';\n    }\n  }\n\n  return base64url\n    .replace(/\\-/g, '+')\n    .replace(/_/g, '/');\n}\n\nfunction typeError(template) {\n  var args = [].slice.call(arguments, 1);\n  var errMsg = util.format.bind(util, template).apply(null, args);\n  return new TypeError(errMsg);\n}\n\nfunction bufferOrString(obj) {\n  return Buffer.isBuffer(obj) || typeof obj === 'string';\n}\n\nfunction normalizeInput(thing) {\n  if (!bufferOrString(thing))\n    thing = JSON.stringify(thing);\n  return thing;\n}\n\nfunction createHmacSigner(bits) {\n  return function sign(thing, secret) {\n    checkIsSecretKey(secret);\n    thing = normalizeInput(thing);\n    var hmac = crypto.createHmac('sha' + bits, secret);\n    var sig = (hmac.update(thing), hmac.digest('base64'))\n    return fromBase64(sig);\n  }\n}\n\nvar bufferEqual;\nvar timingSafeEqual = 'timingSafeEqual' in crypto ? function timingSafeEqual(a, b) {\n  if (a.byteLength !== b.byteLength) {\n    return false;\n  }\n\n  return crypto.timingSafeEqual(a, b)\n} : function timingSafeEqual(a, b) {\n  if (!bufferEqual) {\n    bufferEqual = require('buffer-equal-constant-time');\n  }\n\n  return bufferEqual(a, b)\n}\n\nfunction createHmacVerifier(bits) {\n  return function verify(thing, signature, secret) {\n    var computedSig = createHmacSigner(bits)(thing, secret);\n    return timingSafeEqual(Buffer.from(signature), Buffer.from(computedSig));\n  }\n}\n\nfunction createKeySigner(bits) {\n return function sign(thing, privateKey) {\n    checkIsPrivateKey(privateKey);\n    thing = normalizeInput(thing);\n    // Even though we are specifying \"RSA\" here, this works with ECDSA\n    // keys as well.\n    var signer = crypto.createSign('RSA-SHA' + bits);\n    var sig = (signer.update(thing), signer.sign(privateKey, 'base64'));\n    return fromBase64(sig);\n  }\n}\n\nfunction createKeyVerifier(bits) {\n  return function verify(thing, signature, publicKey) {\n    checkIsPublicKey(publicKey);\n    thing = normalizeInput(thing);\n    signature = toBase64(signature);\n    var verifier = crypto.createVerify('RSA-SHA' + bits);\n    verifier.update(thing);\n    return verifier.verify(publicKey, signature, 'base64');\n  }\n}\n\nfunction createPSSKeySigner(bits) {\n  return function sign(thing, privateKey) {\n    checkIsPrivateKey(privateKey);\n    thing = normalizeInput(thing);\n    var signer = crypto.createSign('RSA-SHA' + bits);\n    var sig = (signer.update(thing), signer.sign({\n      key: privateKey,\n      padding: crypto.constants.RSA_PKCS1_PSS_PADDING,\n      saltLength: crypto.constants.RSA_PSS_SALTLEN_DIGEST\n    }, 'base64'));\n    return fromBase64(sig);\n  }\n}\n\nfunction createPSSKeyVerifier(bits) {\n  return function verify(thing, signature, publicKey) {\n    checkIsPublicKey(publicKey);\n    thing = normalizeInput(thing);\n    signature = toBase64(signature);\n    var verifier = crypto.createVerify('RSA-SHA' + bits);\n    verifier.update(thing);\n    return verifier.verify({\n      key: publicKey,\n      padding: crypto.constants.RSA_PKCS1_PSS_PADDING,\n      saltLength: crypto.constants.RSA_PSS_SALTLEN_DIGEST\n    }, signature, 'base64');\n  }\n}\n\nfunction createECDSASigner(bits) {\n  var inner = createKeySigner(bits);\n  return function sign() {\n    var signature = inner.apply(null, arguments);\n    signature = formatEcdsa.derToJose(signature, 'ES' + bits);\n    return signature;\n  };\n}\n\nfunction createECDSAVerifer(bits) {\n  var inner = createKeyVerifier(bits);\n  return function verify(thing, signature, publicKey) {\n    signature = formatEcdsa.joseToDer(signature, 'ES' + bits).toString('base64');\n    var result = inner(thing, signature, publicKey);\n    return result;\n  };\n}\n\nfunction createNoneSigner() {\n  return function sign() {\n    return '';\n  }\n}\n\nfunction createNoneVerifier() {\n  return function verify(thing, signature) {\n    return signature === '';\n  }\n}\n\nmodule.exports = function jwa(algorithm) {\n  var signerFactories = {\n    hs: createHmacSigner,\n    rs: createKeySigner,\n    ps: createPSSKeySigner,\n    es: createECDSASigner,\n    none: createNoneSigner,\n  }\n  var verifierFactories = {\n    hs: createHmacVerifier,\n    rs: createKeyVerifier,\n    ps: createPSSKeyVerifier,\n    es: createECDSAVerifer,\n    none: createNoneVerifier,\n  }\n  var match = algorithm.match(/^(RS|PS|ES|HS)(256|384|512)$|^(none)$/);\n  if (!match)\n    throw typeError(MSG_INVALID_ALGORITHM, algorithm);\n  var algo = (match[1] || match[3]).toLowerCase();\n  var bits = match[2];\n\n  return {\n    sign: signerFactories[algo](bits),\n    verify: verifierFactories[algo](bits),\n  }\n};\n","/*global module*/\nvar Buffer = require('buffer').Buffer;\n\nmodule.exports = function toString(obj) {\n  if (typeof obj === 'string')\n    return obj;\n  if (typeof obj === 'number' || Buffer.isBuffer(obj))\n    return obj.toString();\n  return JSON.stringify(obj);\n};\n","/*global module*/\nvar Buffer = require('safe-buffer').Buffer;\nvar DataStream = require('./data-stream');\nvar jwa = require('jwa');\nvar Stream = require('stream');\nvar toString = require('./tostring');\nvar util = require('util');\n\nfunction base64url(string, encoding) {\n  return Buffer\n    .from(string, encoding)\n    .toString('base64')\n    .replace(/=/g, '')\n    .replace(/\\+/g, '-')\n    .replace(/\\//g, '_');\n}\n\nfunction jwsSecuredInput(header, payload, encoding) {\n  encoding = encoding || 'utf8';\n  var encodedHeader = base64url(toString(header), 'binary');\n  var encodedPayload = base64url(toString(payload), encoding);\n  return util.format('%s.%s', encodedHeader, encodedPayload);\n}\n\nfunction jwsSign(opts) {\n  var header = opts.header;\n  var payload = opts.payload;\n  var secretOrKey = opts.secret || opts.privateKey;\n  var encoding = opts.encoding;\n  var algo = jwa(header.alg);\n  var securedInput = jwsSecuredInput(header, payload, encoding);\n  var signature = algo.sign(securedInput, secretOrKey);\n  return util.format('%s.%s', securedInput, signature);\n}\n\nfunction SignStream(opts) {\n  var secret = opts.secret;\n  secret = secret == null ? opts.privateKey : secret;\n  secret = secret == null ? opts.key : secret;\n  if (/^hs/i.test(opts.header.alg) === true && secret == null) {\n    throw new TypeError('secret must be a string or buffer or a KeyObject')\n  }\n  var secretStream = new DataStream(secret);\n  this.readable = true;\n  this.header = opts.header;\n  this.encoding = opts.encoding;\n  this.secret = this.privateKey = this.key = secretStream;\n  this.payload = new DataStream(opts.payload);\n  this.secret.once('close', function () {\n    if (!this.payload.writable && this.readable)\n      this.sign();\n  }.bind(this));\n\n  this.payload.once('close', function () {\n    if (!this.secret.writable && this.readable)\n      this.sign();\n  }.bind(this));\n}\nutil.inherits(SignStream, Stream);\n\nSignStream.prototype.sign = function sign() {\n  try {\n    var signature = jwsSign({\n      header: this.header,\n      payload: this.payload.buffer,\n      secret: this.secret.buffer,\n      encoding: this.encoding\n    });\n    this.emit('done', signature);\n    this.emit('data', signature);\n    this.emit('end');\n    this.readable = false;\n    return signature;\n  } catch (e) {\n    this.readable = false;\n    this.emit('error', e);\n    this.emit('close');\n  }\n};\n\nSignStream.sign = jwsSign;\n\nmodule.exports = SignStream;\n","/*global module*/\nvar Buffer = require('safe-buffer').Buffer;\nvar DataStream = require('./data-stream');\nvar jwa = require('jwa');\nvar Stream = require('stream');\nvar toString = require('./tostring');\nvar util = require('util');\nvar JWS_REGEX = /^[a-zA-Z0-9\\-_]+?\\.[a-zA-Z0-9\\-_]+?\\.([a-zA-Z0-9\\-_]+)?$/;\n\nfunction isObject(thing) {\n  return Object.prototype.toString.call(thing) === '[object Object]';\n}\n\nfunction safeJsonParse(thing) {\n  if (isObject(thing))\n    return thing;\n  try { return JSON.parse(thing); }\n  catch (e) { return undefined; }\n}\n\nfunction headerFromJWS(jwsSig) {\n  var encodedHeader = jwsSig.split('.', 1)[0];\n  return safeJsonParse(Buffer.from(encodedHeader, 'base64').toString('binary'));\n}\n\nfunction securedInputFromJWS(jwsSig) {\n  return jwsSig.split('.', 2).join('.');\n}\n\nfunction signatureFromJWS(jwsSig) {\n  return jwsSig.split('.')[2];\n}\n\nfunction payloadFromJWS(jwsSig, encoding) {\n  encoding = encoding || 'utf8';\n  var payload = jwsSig.split('.')[1];\n  return Buffer.from(payload, 'base64').toString(encoding);\n}\n\nfunction isValidJws(string) {\n  return JWS_REGEX.test(string) && !!headerFromJWS(string);\n}\n\nfunction jwsVerify(jwsSig, algorithm, secretOrKey) {\n  if (!algorithm) {\n    var err = new Error(\"Missing algorithm parameter for jws.verify\");\n    err.code = \"MISSING_ALGORITHM\";\n    throw err;\n  }\n  jwsSig = toString(jwsSig);\n  var signature = signatureFromJWS(jwsSig);\n  var securedInput = securedInputFromJWS(jwsSig);\n  var algo = jwa(algorithm);\n  return algo.verify(securedInput, signature, secretOrKey);\n}\n\nfunction jwsDecode(jwsSig, opts) {\n  opts = opts || {};\n  jwsSig = toString(jwsSig);\n\n  if (!isValidJws(jwsSig))\n    return null;\n\n  var header = headerFromJWS(jwsSig);\n\n  if (!header)\n    return null;\n\n  var payload = payloadFromJWS(jwsSig);\n  if (header.typ === 'JWT' || opts.json)\n    payload = JSON.parse(payload, opts.encoding);\n\n  return {\n    header: header,\n    payload: payload,\n    signature: signatureFromJWS(jwsSig)\n  };\n}\n\nfunction VerifyStream(opts) {\n  opts = opts || {};\n  var secretOrKey = opts.secret;\n  secretOrKey = secretOrKey == null ? opts.publicKey : secretOrKey;\n  secretOrKey = secretOrKey == null ? opts.key : secretOrKey;\n  if (/^hs/i.test(opts.algorithm) === true && secretOrKey == null) {\n    throw new TypeError('secret must be a string or buffer or a KeyObject')\n  }\n  var secretStream = new DataStream(secretOrKey);\n  this.readable = true;\n  this.algorithm = opts.algorithm;\n  this.encoding = opts.encoding;\n  this.secret = this.publicKey = this.key = secretStream;\n  this.signature = new DataStream(opts.signature);\n  this.secret.once('close', function () {\n    if (!this.signature.writable && this.readable)\n      this.verify();\n  }.bind(this));\n\n  this.signature.once('close', function () {\n    if (!this.secret.writable && this.readable)\n      this.verify();\n  }.bind(this));\n}\nutil.inherits(VerifyStream, Stream);\nVerifyStream.prototype.verify = function verify() {\n  try {\n    var valid = jwsVerify(this.signature.buffer, this.algorithm, this.key.buffer);\n    var obj = jwsDecode(this.signature.buffer, this.encoding);\n    this.emit('done', valid, obj);\n    this.emit('data', valid);\n    this.emit('end');\n    this.readable = false;\n    return valid;\n  } catch (e) {\n    this.readable = false;\n    this.emit('error', e);\n    this.emit('close');\n  }\n};\n\nVerifyStream.decode = jwsDecode;\nVerifyStream.isValid = isValidJws;\nVerifyStream.verify = jwsVerify;\n\nmodule.exports = VerifyStream;\n","/*global exports*/\nvar SignStream = require('./lib/sign-stream');\nvar VerifyStream = require('./lib/verify-stream');\n\nvar ALGORITHMS = [\n  'HS256', 'HS384', 'HS512',\n  'RS256', 'RS384', 'RS512',\n  'PS256', 'PS384', 'PS512',\n  'ES256', 'ES384', 'ES512'\n];\n\nexports.ALGORITHMS = ALGORITHMS;\nexports.sign = SignStream.sign;\nexports.verify = VerifyStream.verify;\nexports.decode = VerifyStream.decode;\nexports.isValid = VerifyStream.isValid;\nexports.createSign = function createSign(opts) {\n  return new SignStream(opts);\n};\nexports.createVerify = function createVerify(opts) {\n  return new VerifyStream(opts);\n};\n","var jws = require('jws');\n\nmodule.exports = function (jwt, options) {\n  options = options || {};\n  var decoded = jws.decode(jwt, options);\n  if (!decoded) { return null; }\n  var payload = decoded.payload;\n\n  //try parse the payload\n  if(typeof payload === 'string') {\n    try {\n      var obj = JSON.parse(payload);\n      if(obj !== null && typeof obj === 'object') {\n        payload = obj;\n      }\n    } catch (e) { }\n  }\n\n  //return header if `complete` option is enabled.  header includes claims\n  //such as `kid` and `alg` used to select the key within a JWKS needed to\n  //verify the signature\n  if (options.complete === true) {\n    return {\n      header: decoded.header,\n      payload: payload,\n      signature: decoded.signature\n    };\n  }\n  return payload;\n};\n","var JsonWebTokenError = function (message, error) {\n  Error.call(this, message);\n  if(Error.captureStackTrace) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n  this.name = 'JsonWebTokenError';\n  this.message = message;\n  if (error) this.inner = error;\n};\n\nJsonWebTokenError.prototype = Object.create(Error.prototype);\nJsonWebTokenError.prototype.constructor = JsonWebTokenError;\n\nmodule.exports = JsonWebTokenError;\n","var JsonWebTokenError = require('./JsonWebTokenError');\n\nvar NotBeforeError = function (message, date) {\n  JsonWebTokenError.call(this, message);\n  this.name = 'NotBeforeError';\n  this.date = date;\n};\n\nNotBeforeError.prototype = Object.create(JsonWebTokenError.prototype);\n\nNotBeforeError.prototype.constructor = NotBeforeError;\n\nmodule.exports = NotBeforeError;","var JsonWebTokenError = require('./JsonWebTokenError');\n\nvar TokenExpiredError = function (message, expiredAt) {\n  JsonWebTokenError.call(this, message);\n  this.name = 'TokenExpiredError';\n  this.expiredAt = expiredAt;\n};\n\nTokenExpiredError.prototype = Object.create(JsonWebTokenError.prototype);\n\nTokenExpiredError.prototype.constructor = TokenExpiredError;\n\nmodule.exports = TokenExpiredError;","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function (val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isFinite(val)) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'weeks':\n    case 'week':\n    case 'w':\n      return n * w;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (msAbs >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (msAbs >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (msAbs >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return plural(ms, msAbs, d, 'day');\n  }\n  if (msAbs >= h) {\n    return plural(ms, msAbs, h, 'hour');\n  }\n  if (msAbs >= m) {\n    return plural(ms, msAbs, m, 'minute');\n  }\n  if (msAbs >= s) {\n    return plural(ms, msAbs, s, 'second');\n  }\n  return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n  var isPlural = msAbs >= n * 1.5;\n  return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","var ms = require('ms');\n\nmodule.exports = function (time, iat) {\n  var timestamp = iat || Math.floor(Date.now() / 1000);\n\n  if (typeof time === 'string') {\n    var milliseconds = ms(time);\n    if (typeof milliseconds === 'undefined') {\n      return;\n    }\n    return Math.floor(timestamp + milliseconds / 1000);\n  } else if (typeof time === 'number') {\n    return timestamp + time;\n  } else {\n    return;\n  }\n\n};","'use strict'\n\n// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n  'major',\n  'premajor',\n  'minor',\n  'preminor',\n  'patch',\n  'prepatch',\n  'prerelease',\n]\n\nmodule.exports = {\n  MAX_LENGTH,\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_SAFE_INTEGER,\n  RELEASE_TYPES,\n  SEMVER_SPEC_VERSION,\n  FLAG_INCLUDE_PRERELEASE: 0b001,\n  FLAG_LOOSE: 0b010,\n}\n","'use strict'\n\nconst debug = (\n  typeof process === 'object' &&\n  process.env &&\n  process.env.NODE_DEBUG &&\n  /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n  : () => {}\n\nmodule.exports = debug\n","'use strict'\n\nconst {\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst safeSrc = exports.safeSrc = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n  ['\\\\s', 1],\n  ['\\\\d', MAX_LENGTH],\n  [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n  for (const [token, max] of safeRegexReplacements) {\n    value = value\n      .split(`${token}*`).join(`${token}{0,${max}}`)\n      .split(`${token}+`).join(`${token}{1,${max}}`)\n  }\n  return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n  const safe = makeSafeRegex(value)\n  const index = R++\n  debug(name, index, value)\n  t[name] = index\n  src[index] = value\n  safeSrc[index] = safe\n  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n// Non-numeric identifiers include numeric identifiers but can be longer.\n// Therefore non-numeric identifiers must go first.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups.  The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifier, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:${src[t.PRERELEASE]})?${\n                     src[t.BUILD]}?` +\n                   `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:${src[t.PRERELEASELOOSE]})?${\n                          src[t.BUILD]}?` +\n                        `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n              '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n              `(?:${src[t.PRERELEASE]})?` +\n              `(?:${src[t.BUILD]})?` +\n              `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s+-\\\\s+` +\n                   `(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s+-\\\\s+` +\n                        `(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n","'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n  if (!options) {\n    return emptyOpts\n  }\n\n  if (typeof options !== 'object') {\n    return looseOption\n  }\n\n  return options\n}\nmodule.exports = parseOptions\n","'use strict'\n\nconst numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n  if (typeof a === 'number' && typeof b === 'number') {\n    return a === b ? 0 : a < b ? -1 : 1\n  }\n\n  const anum = numeric.test(a)\n  const bnum = numeric.test(b)\n\n  if (anum && bnum) {\n    a = +a\n    b = +b\n  }\n\n  return a === b ? 0\n    : (anum && !bnum) ? -1\n    : (bnum && !anum) ? 1\n    : a < b ? -1\n    : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n  compareIdentifiers,\n  rcompareIdentifiers,\n}\n","'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\n\nconst isPrereleaseIdentifier = (prerelease, identifier) => {\n  const identifiers = identifier.split('.')\n  if (identifiers.length > prerelease.length) {\n    return false\n  }\n\n  for (let i = 0; i < identifiers.length; i++) {\n    if (compareIdentifiers(prerelease[i], identifiers[i]) !== 0) {\n      return false\n    }\n  }\n\n  return true\n}\n\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    if (this.major < other.major) {\n      return -1\n    }\n    if (this.major > other.major) {\n      return 1\n    }\n    if (this.minor < other.minor) {\n      return -1\n    }\n    if (this.minor > other.minor) {\n      return 1\n    }\n    if (this.patch < other.patch) {\n      return -1\n    }\n    if (this.patch > other.patch) {\n      return 1\n    }\n    return 0\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (isPrereleaseIdentifier(this.prerelease, identifier)) {\n            const prereleaseBase = this.prerelease[identifier.split('.').length]\n            if (isNaN(prereleaseBase)) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n  try {\n    return new SemVer(version, options)\n  } catch (er) {\n    if (!throwErrors) {\n      return null\n    }\n    throw er\n  }\n}\n\nmodule.exports = parse\n","'use strict'\n\nconst parse = require('./parse')\nconst valid = (version, options) => {\n  const v = parse(version, options)\n  return v ? v.version : null\n}\nmodule.exports = valid\n","'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n","'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n  if (typeof (options) === 'string') {\n    identifierBase = identifier\n    identifier = options\n    options = undefined\n  }\n\n  try {\n    return new SemVer(\n      version instanceof SemVer ? version.version : version,\n      options\n    ).inc(release, identifier, identifierBase).version\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = inc\n","'use strict'\n\nconst parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n  const v1 = parse(version1, null, true)\n  const v2 = parse(version2, null, true)\n  const comparison = v1.compare(v2)\n\n  if (comparison === 0) {\n    return null\n  }\n\n  const v1Higher = comparison > 0\n  const highVersion = v1Higher ? v1 : v2\n  const lowVersion = v1Higher ? v2 : v1\n  const highHasPre = !!highVersion.prerelease.length\n  const lowHasPre = !!lowVersion.prerelease.length\n\n  if (lowHasPre && !highHasPre) {\n    // Going from prerelease -> no prerelease requires some special casing\n\n    // If the low version has only a major, then it will always be a major\n    // Some examples:\n    // 1.0.0-1 -> 1.0.0\n    // 1.0.0-1 -> 1.1.1\n    // 1.0.0-1 -> 2.0.0\n    if (!lowVersion.patch && !lowVersion.minor) {\n      return 'major'\n    }\n\n    // If the main part has no difference\n    if (lowVersion.compareMain(highVersion) === 0) {\n      if (lowVersion.minor && !lowVersion.patch) {\n        return 'minor'\n      }\n      return 'patch'\n    }\n  }\n\n  // add the `pre` prefix if we are going to a prerelease version\n  const prefix = highHasPre ? 'pre' : ''\n\n  if (v1.major !== v2.major) {\n    return prefix + 'major'\n  }\n\n  if (v1.minor !== v2.minor) {\n    return prefix + 'minor'\n  }\n\n  if (v1.patch !== v2.patch) {\n    return prefix + 'patch'\n  }\n\n  // high and low are prereleases\n  return 'prerelease'\n}\n\nmodule.exports = diff\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","'use strict'\n\nconst parse = require('./parse')\nconst prerelease = (version, options) => {\n  const parsed = parse(version, options)\n  return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n  new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n","'use strict'\n\nconst compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","'use strict'\n\nconst compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n  const versionA = new SemVer(a, loose)\n  const versionB = new SemVer(b, loose)\n  return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","'use strict'\n\nconst compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n","'use strict'\n\nconst compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n","'use strict'\n\nconst compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n","'use strict'\n\nconst compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n","'use strict'\n\nconst compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n","'use strict'\n\nconst compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n","'use strict'\n\nconst eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n  switch (op) {\n    case '===':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a === b\n\n    case '!==':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a !== b\n\n    case '':\n    case '=':\n    case '==':\n      return eq(a, b, loose)\n\n    case '!=':\n      return neq(a, b, loose)\n\n    case '>':\n      return gt(a, b, loose)\n\n    case '>=':\n      return gte(a, b, loose)\n\n    case '<':\n      return lt(a, b, loose)\n\n    case '<=':\n      return lte(a, b, loose)\n\n    default:\n      throw new TypeError(`Invalid operator: ${op}`)\n  }\n}\nmodule.exports = cmp\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n  if (version instanceof SemVer) {\n    return version\n  }\n\n  if (typeof version === 'number') {\n    version = String(version)\n  }\n\n  if (typeof version !== 'string') {\n    return null\n  }\n\n  options = options || {}\n\n  let match = null\n  if (!options.rtl) {\n    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n  } else {\n    // Find the right-most coercible string that does not share\n    // a terminus with a more left-ward coercible string.\n    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n    //\n    // Walk through the string checking with a /g regexp\n    // Manually set the index so as to pick up overlapping matches.\n    // Stop when we get a match that ends at the string end, since no\n    // coercible string can be more right-ward without the same terminus.\n    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n    let next\n    while ((next = coerceRtlRegex.exec(version)) &&\n        (!match || match.index + match[0].length !== version.length)\n    ) {\n      if (!match ||\n            next.index + next[0].length !== match.index + match[0].length) {\n        match = next\n      }\n      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n    }\n    // leave it in a clean state\n    coerceRtlRegex.lastIndex = -1\n  }\n\n  if (match === null) {\n    return null\n  }\n\n  const major = match[2]\n  const minor = match[3] || '0'\n  const patch = match[4] || '0'\n  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n","'use strict'\n\nconst parse = require('./parse')\nconst constants = require('../internal/constants')\nconst SemVer = require('../classes/semver')\n\nconst truncate = (version, truncation, options) => {\n  if (!constants.RELEASE_TYPES.includes(truncation)) {\n    return null\n  }\n\n  const clonedVersion = cloneInputVersion(version, options)\n  return clonedVersion && doTruncation(clonedVersion, truncation)\n}\n\nconst cloneInputVersion = (version, options) => {\n  const versionStringToParse = (\n    version instanceof SemVer ? version.version : version\n  )\n\n  return parse(versionStringToParse, options)\n}\n\nconst doTruncation = (version, truncation) => {\n  if (isPrerelease(truncation)) {\n    return version.version\n  }\n\n  version.prerelease = []\n\n  switch (truncation) {\n    case 'major':\n      version.minor = 0\n      version.patch = 0\n      break\n    case 'minor':\n      version.patch = 0\n      break\n  }\n\n  return version.format()\n}\n\nconst isPrerelease = (type) => {\n  return type.startsWith('pre')\n}\n\nmodule.exports = truncate\n","'use strict'\n\nclass LRUCache {\n  constructor () {\n    this.max = 1000\n    this.map = new Map()\n  }\n\n  get (key) {\n    const value = this.map.get(key)\n    if (value === undefined) {\n      return undefined\n    } else {\n      // Remove the key from the map and add it to the end\n      this.map.delete(key)\n      this.map.set(key, value)\n      return value\n    }\n  }\n\n  delete (key) {\n    return this.map.delete(key)\n  }\n\n  set (key, value) {\n    const deleted = this.delete(key)\n\n    if (!deleted && value !== undefined) {\n      // If cache is full, delete the least recently used item\n      if (this.map.size >= this.max) {\n        const firstKey = this.map.keys().next().value\n        this.delete(firstKey)\n      }\n\n      this.map.set(key, value)\n    }\n\n    return this\n  }\n}\n\nmodule.exports = LRUCache\n","'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // strip build metadata so it can't bleed into the version\n    range = range.replace(BUILDSTRIPRE, '')\n\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  src,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\n// unbounded global build-metadata stripper used by parseRange\nconst BUILDSTRIPRE = new RegExp(src[t.BUILD], 'g')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  comp = comp.replace(re[t.BUILD], '')\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\nconst invalidXRangeOrder = (M, m, p) => (\n  (isX(M) && !isX(m)) ||\n  (isX(m) && p && !isX(p))\n)\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    if (invalidXRangeOrder(M, m, p)) {\n      return comp\n    }\n\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n","'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n  static get ANY () {\n    return ANY\n  }\n\n  constructor (comp, options) {\n    options = parseOptions(options)\n\n    if (comp instanceof Comparator) {\n      if (comp.loose === !!options.loose) {\n        return comp\n      } else {\n        comp = comp.value\n      }\n    }\n\n    comp = comp.trim().split(/\\s+/).join(' ')\n    debug('comparator', comp, options)\n    this.options = options\n    this.loose = !!options.loose\n    this.parse(comp)\n\n    if (this.semver === ANY) {\n      this.value = ''\n    } else {\n      this.value = this.operator + this.semver.version\n    }\n\n    debug('comp', this)\n  }\n\n  parse (comp) {\n    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n    const m = comp.match(r)\n\n    if (!m) {\n      throw new TypeError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : ''\n    if (this.operator === '=') {\n      this.operator = ''\n    }\n\n    // if it literally is just '>' or '' then allow anything.\n    if (!m[2]) {\n      this.semver = ANY\n    } else {\n      this.semver = new SemVer(m[2], this.options.loose)\n    }\n  }\n\n  toString () {\n    return this.value\n  }\n\n  test (version) {\n    debug('Comparator.test', version, this.options.loose)\n\n    if (this.semver === ANY || version === ANY) {\n      return true\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver, this.options)\n  }\n\n  intersects (comp, options) {\n    if (!(comp instanceof Comparator)) {\n      throw new TypeError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return new Range(comp.value, options).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return new Range(this.value, options).test(comp.semver)\n    }\n\n    options = parseOptions(options)\n\n    // Special cases where nothing can possibly be lower\n    if (options.includePrerelease &&\n      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n      return false\n    }\n    if (!options.includePrerelease &&\n      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n      return false\n    }\n\n    // Same direction increasing (> or >=)\n    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n      return true\n    }\n    // Same direction decreasing (< or <=)\n    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // same SemVer and both sides are inclusive (<= or >=)\n    if (\n      (this.semver.version === comp.semver.version) &&\n      this.operator.includes('=') && comp.operator.includes('=')) {\n      return true\n    }\n    // opposite directions less than\n    if (cmp(this.semver, '<', comp.semver, options) &&\n      this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n      return true\n    }\n    // opposite directions greater than\n    if (cmp(this.semver, '>', comp.semver, options) &&\n      this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n      return true\n    }\n    return false\n  }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n","'use strict'\n\nconst Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n  try {\n    range = new Range(range, options)\n  } catch (er) {\n    return false\n  }\n  return range.test(version)\n}\nmodule.exports = satisfies\n","'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n","'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n","'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n","'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n","'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If LT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !c.test(gt.semver)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !c.test(lt.semver)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n","'use strict'\n\n// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst truncate = require('./functions/truncate')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n  parse,\n  valid,\n  clean,\n  inc,\n  diff,\n  major,\n  minor,\n  patch,\n  prerelease,\n  compare,\n  rcompare,\n  compareLoose,\n  compareBuild,\n  sort,\n  rsort,\n  gt,\n  lt,\n  eq,\n  neq,\n  gte,\n  lte,\n  cmp,\n  coerce,\n  truncate,\n  Comparator,\n  Range,\n  satisfies,\n  toComparators,\n  maxSatisfying,\n  minSatisfying,\n  minVersion,\n  validRange,\n  outside,\n  gtr,\n  ltr,\n  intersects,\n  simplifyRange,\n  subset,\n  SemVer,\n  re: internalRe.re,\n  src: internalRe.src,\n  tokens: internalRe.t,\n  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n  RELEASE_TYPES: constants.RELEASE_TYPES,\n  compareIdentifiers: identifiers.compareIdentifiers,\n  rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n","const semver = require('semver');\n\nmodule.exports = semver.satisfies(process.version, '>=15.7.0');\n","const semver = require('semver');\n\nmodule.exports = semver.satisfies(process.version, '>=16.9.0');\n","const ASYMMETRIC_KEY_DETAILS_SUPPORTED = require('./asymmetricKeyDetailsSupported');\nconst RSA_PSS_KEY_DETAILS_SUPPORTED = require('./rsaPssKeyDetailsSupported');\n\nconst allowedAlgorithmsForKeys = {\n  'ec': ['ES256', 'ES384', 'ES512'],\n  'rsa': ['RS256', 'PS256', 'RS384', 'PS384', 'RS512', 'PS512'],\n  'rsa-pss': ['PS256', 'PS384', 'PS512']\n};\n\nconst allowedCurves = {\n  ES256: 'prime256v1',\n  ES384: 'secp384r1',\n  ES512: 'secp521r1',\n};\n\nmodule.exports = function(algorithm, key) {\n  if (!algorithm || !key) return;\n\n  const keyType = key.asymmetricKeyType;\n  if (!keyType) return;\n\n  const allowedAlgorithms = allowedAlgorithmsForKeys[keyType];\n\n  if (!allowedAlgorithms) {\n    throw new Error(`Unknown key type \"${keyType}\".`);\n  }\n\n  if (!allowedAlgorithms.includes(algorithm)) {\n    throw new Error(`\"alg\" parameter for \"${keyType}\" key type must be one of: ${allowedAlgorithms.join(', ')}.`)\n  }\n\n  /*\n   * Ignore the next block from test coverage because it gets executed\n   * conditionally depending on the Node version. Not ignoring it would\n   * prevent us from reaching the target % of coverage for versions of\n   * Node under 15.7.0.\n   */\n  /* istanbul ignore next */\n  if (ASYMMETRIC_KEY_DETAILS_SUPPORTED) {\n    switch (keyType) {\n    case 'ec':\n      const keyCurve = key.asymmetricKeyDetails.namedCurve;\n      const allowedCurve = allowedCurves[algorithm];\n\n      if (keyCurve !== allowedCurve) {\n        throw new Error(`\"alg\" parameter \"${algorithm}\" requires curve \"${allowedCurve}\".`);\n      }\n      break;\n\n    case 'rsa-pss':\n      if (RSA_PSS_KEY_DETAILS_SUPPORTED) {\n        const length = parseInt(algorithm.slice(-3), 10);\n        const { hashAlgorithm, mgf1HashAlgorithm, saltLength } = key.asymmetricKeyDetails;\n\n        if (hashAlgorithm !== `sha${length}` || mgf1HashAlgorithm !== hashAlgorithm) {\n          throw new Error(`Invalid key for this operation, its RSA-PSS parameters do not meet the requirements of \"alg\" ${algorithm}.`);\n        }\n\n        if (saltLength !== undefined && saltLength > length >> 3) {\n          throw new Error(`Invalid key for this operation, its RSA-PSS parameter saltLength does not meet the requirements of \"alg\" ${algorithm}.`)\n        }\n      }\n      break;\n    }\n  }\n}\n","var semver = require('semver');\n\nmodule.exports = semver.satisfies(process.version, '^6.12.0 || >=8.0.0');\n","const JsonWebTokenError = require('./lib/JsonWebTokenError');\nconst NotBeforeError = require('./lib/NotBeforeError');\nconst TokenExpiredError = require('./lib/TokenExpiredError');\nconst decode = require('./decode');\nconst timespan = require('./lib/timespan');\nconst validateAsymmetricKey = require('./lib/validateAsymmetricKey');\nconst PS_SUPPORTED = require('./lib/psSupported');\nconst jws = require('jws');\nconst {KeyObject, createSecretKey, createPublicKey} = require(\"crypto\");\n\nconst PUB_KEY_ALGS = ['RS256', 'RS384', 'RS512'];\nconst EC_KEY_ALGS = ['ES256', 'ES384', 'ES512'];\nconst RSA_KEY_ALGS = ['RS256', 'RS384', 'RS512'];\nconst HS_ALGS = ['HS256', 'HS384', 'HS512'];\n\nif (PS_SUPPORTED) {\n  PUB_KEY_ALGS.splice(PUB_KEY_ALGS.length, 0, 'PS256', 'PS384', 'PS512');\n  RSA_KEY_ALGS.splice(RSA_KEY_ALGS.length, 0, 'PS256', 'PS384', 'PS512');\n}\n\nmodule.exports = function (jwtString, secretOrPublicKey, options, callback) {\n  if ((typeof options === 'function') && !callback) {\n    callback = options;\n    options = {};\n  }\n\n  if (!options) {\n    options = {};\n  }\n\n  //clone this object since we are going to mutate it.\n  options = Object.assign({}, options);\n\n  let done;\n\n  if (callback) {\n    done = callback;\n  } else {\n    done = function(err, data) {\n      if (err) throw err;\n      return data;\n    };\n  }\n\n  if (options.clockTimestamp && typeof options.clockTimestamp !== 'number') {\n    return done(new JsonWebTokenError('clockTimestamp must be a number'));\n  }\n\n  if (options.nonce !== undefined && (typeof options.nonce !== 'string' || options.nonce.trim() === '')) {\n    return done(new JsonWebTokenError('nonce must be a non-empty string'));\n  }\n\n  if (options.allowInvalidAsymmetricKeyTypes !== undefined && typeof options.allowInvalidAsymmetricKeyTypes !== 'boolean') {\n    return done(new JsonWebTokenError('allowInvalidAsymmetricKeyTypes must be a boolean'));\n  }\n\n  const clockTimestamp = options.clockTimestamp || Math.floor(Date.now() / 1000);\n\n  if (!jwtString){\n    return done(new JsonWebTokenError('jwt must be provided'));\n  }\n\n  if (typeof jwtString !== 'string') {\n    return done(new JsonWebTokenError('jwt must be a string'));\n  }\n\n  const parts = jwtString.split('.');\n\n  if (parts.length !== 3){\n    return done(new JsonWebTokenError('jwt malformed'));\n  }\n\n  let decodedToken;\n\n  try {\n    decodedToken = decode(jwtString, { complete: true });\n  } catch(err) {\n    return done(err);\n  }\n\n  if (!decodedToken) {\n    return done(new JsonWebTokenError('invalid token'));\n  }\n\n  const header = decodedToken.header;\n  let getSecret;\n\n  if(typeof secretOrPublicKey === 'function') {\n    if(!callback) {\n      return done(new JsonWebTokenError('verify must be called asynchronous if secret or public key is provided as a callback'));\n    }\n\n    getSecret = secretOrPublicKey;\n  }\n  else {\n    getSecret = function(header, secretCallback) {\n      return secretCallback(null, secretOrPublicKey);\n    };\n  }\n\n  return getSecret(header, function(err, secretOrPublicKey) {\n    if(err) {\n      return done(new JsonWebTokenError('error in secret or public key callback: ' + err.message));\n    }\n\n    const hasSignature = parts[2].trim() !== '';\n\n    if (!hasSignature && secretOrPublicKey){\n      return done(new JsonWebTokenError('jwt signature is required'));\n    }\n\n    if (hasSignature && !secretOrPublicKey) {\n      return done(new JsonWebTokenError('secret or public key must be provided'));\n    }\n\n    if (!hasSignature && !options.algorithms) {\n      return done(new JsonWebTokenError('please specify \"none\" in \"algorithms\" to verify unsigned tokens'));\n    }\n\n    if (secretOrPublicKey != null && !(secretOrPublicKey instanceof KeyObject)) {\n      try {\n        secretOrPublicKey = createPublicKey(secretOrPublicKey);\n      } catch (_) {\n        try {\n          secretOrPublicKey = createSecretKey(typeof secretOrPublicKey === 'string' ? Buffer.from(secretOrPublicKey) : secretOrPublicKey);\n        } catch (_) {\n          return done(new JsonWebTokenError('secretOrPublicKey is not valid key material'))\n        }\n      }\n    }\n\n    if (!options.algorithms) {\n      if (secretOrPublicKey.type === 'secret') {\n        options.algorithms = HS_ALGS;\n      } else if (['rsa', 'rsa-pss'].includes(secretOrPublicKey.asymmetricKeyType)) {\n        options.algorithms = RSA_KEY_ALGS\n      } else if (secretOrPublicKey.asymmetricKeyType === 'ec') {\n        options.algorithms = EC_KEY_ALGS\n      } else {\n        options.algorithms = PUB_KEY_ALGS\n      }\n    }\n\n    if (options.algorithms.indexOf(decodedToken.header.alg) === -1) {\n      return done(new JsonWebTokenError('invalid algorithm'));\n    }\n\n    if (header.alg.startsWith('HS') && secretOrPublicKey.type !== 'secret') {\n      return done(new JsonWebTokenError((`secretOrPublicKey must be a symmetric key when using ${header.alg}`)))\n    } else if (/^(?:RS|PS|ES)/.test(header.alg) && secretOrPublicKey.type !== 'public') {\n      return done(new JsonWebTokenError((`secretOrPublicKey must be an asymmetric key when using ${header.alg}`)))\n    }\n\n    if (!options.allowInvalidAsymmetricKeyTypes) {\n      try {\n        validateAsymmetricKey(header.alg, secretOrPublicKey);\n      } catch (e) {\n        return done(e);\n      }\n    }\n\n    let valid;\n\n    try {\n      valid = jws.verify(jwtString, decodedToken.header.alg, secretOrPublicKey);\n    } catch (e) {\n      return done(e);\n    }\n\n    if (!valid) {\n      return done(new JsonWebTokenError('invalid signature'));\n    }\n\n    const payload = decodedToken.payload;\n\n    if (typeof payload.nbf !== 'undefined' && !options.ignoreNotBefore) {\n      if (typeof payload.nbf !== 'number') {\n        return done(new JsonWebTokenError('invalid nbf value'));\n      }\n      if (payload.nbf > clockTimestamp + (options.clockTolerance || 0)) {\n        return done(new NotBeforeError('jwt not active', new Date(payload.nbf * 1000)));\n      }\n    }\n\n    if (typeof payload.exp !== 'undefined' && !options.ignoreExpiration) {\n      if (typeof payload.exp !== 'number') {\n        return done(new JsonWebTokenError('invalid exp value'));\n      }\n      if (clockTimestamp >= payload.exp + (options.clockTolerance || 0)) {\n        return done(new TokenExpiredError('jwt expired', new Date(payload.exp * 1000)));\n      }\n    }\n\n    if (options.audience) {\n      const audiences = Array.isArray(options.audience) ? options.audience : [options.audience];\n      const target = Array.isArray(payload.aud) ? payload.aud : [payload.aud];\n\n      const match = target.some(function (targetAudience) {\n        return audiences.some(function (audience) {\n          return audience instanceof RegExp ? audience.test(targetAudience) : audience === targetAudience;\n        });\n      });\n\n      if (!match) {\n        return done(new JsonWebTokenError('jwt audience invalid. expected: ' + audiences.join(' or ')));\n      }\n    }\n\n    if (options.issuer) {\n      const invalid_issuer =\n              (typeof options.issuer === 'string' && payload.iss !== options.issuer) ||\n              (Array.isArray(options.issuer) && options.issuer.indexOf(payload.iss) === -1);\n\n      if (invalid_issuer) {\n        return done(new JsonWebTokenError('jwt issuer invalid. expected: ' + options.issuer));\n      }\n    }\n\n    if (options.subject) {\n      if (payload.sub !== options.subject) {\n        return done(new JsonWebTokenError('jwt subject invalid. expected: ' + options.subject));\n      }\n    }\n\n    if (options.jwtid) {\n      if (payload.jti !== options.jwtid) {\n        return done(new JsonWebTokenError('jwt jwtid invalid. expected: ' + options.jwtid));\n      }\n    }\n\n    if (options.nonce) {\n      if (payload.nonce !== options.nonce) {\n        return done(new JsonWebTokenError('jwt nonce invalid. expected: ' + options.nonce));\n      }\n    }\n\n    if (options.maxAge) {\n      if (typeof payload.iat !== 'number') {\n        return done(new JsonWebTokenError('iat required when maxAge is specified'));\n      }\n\n      const maxAgeTimestamp = timespan(options.maxAge, payload.iat);\n      if (typeof maxAgeTimestamp === 'undefined') {\n        return done(new JsonWebTokenError('\"maxAge\" should be a number of seconds or string representing a timespan eg: \"1d\", \"20h\", 60'));\n      }\n      if (clockTimestamp >= maxAgeTimestamp + (options.clockTolerance || 0)) {\n        return done(new TokenExpiredError('maxAge exceeded', new Date(maxAgeTimestamp * 1000)));\n      }\n    }\n\n    if (options.complete === true) {\n      const signature = decodedToken.signature;\n\n      return done(null, {\n        header: header,\n        payload: payload,\n        signature: signature\n      });\n    }\n\n    return done(null, payload);\n  });\n};\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_SAFE_INTEGER = 9007199254740991,\n    MAX_INTEGER = 1.7976931348623157e+308,\n    NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array ? array.length : 0,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  if (value !== value) {\n    return baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object),\n    nativeMax = Math.max;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  // Safari 9 makes `arguments.length` enumerable in strict mode.\n  var result = (isArray(value) || isArguments(value))\n    ? baseTimes(value.length, String)\n    : [];\n\n  var length = result.length,\n      skipIndexes = !!length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (key == 'length' || isIndex(key, length)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  length = length == null ? MAX_SAFE_INTEGER : length;\n  return !!length &&\n    (typeof value == 'number' || reIsUint.test(value)) &&\n    (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\n/**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\nfunction includes(collection, value, fromIndex, guard) {\n  collection = isArrayLike(collection) ? collection : values(collection);\n  fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n  var length = collection.length;\n  if (fromIndex < 0) {\n    fromIndex = nativeMax(length + fromIndex, 0);\n  }\n  return isString(collection)\n    ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n    : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object ? baseValues(object, keys(object)) : [];\n}\n\nmodule.exports = includes;\n","/**\n * lodash 3.0.3 (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n * Available under MIT license <https://lodash.com/license>\n */\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\nfunction isBoolean(value) {\n  return value === true || value === false ||\n    (isObjectLike(value) && objectToString.call(value) == boolTag);\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\nmodule.exports = isBoolean;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308,\n    NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\nfunction isInteger(value) {\n  return typeof value == 'number' && value == toInteger(value);\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = isInteger;\n","/**\n * lodash 3.0.3 (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n * Available under MIT license <https://lodash.com/license>\n */\n\n/** `Object#toString` result references. */\nvar numberTag = '[object Number]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are classified\n * as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\nfunction isNumber(value) {\n  return typeof value == 'number' ||\n    (isObjectLike(value) && objectToString.call(value) == numberTag);\n}\n\nmodule.exports = isNumber;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) ||\n      objectToString.call(value) != objectTag || isHostObject(value)) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return (typeof Ctor == 'function' &&\n    Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);\n}\n\nmodule.exports = isPlainObject;\n","/**\n * lodash 4.0.1 (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n * Available under MIT license <https://lodash.com/license>\n */\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @type Function\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && objectToString.call(value) == stringTag);\n}\n\nmodule.exports = isString;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308,\n    NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\nfunction before(n, func) {\n  var result;\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  n = toInteger(n);\n  return function() {\n    if (--n > 0) {\n      result = func.apply(this, arguments);\n    }\n    if (n <= 1) {\n      func = undefined;\n    }\n    return result;\n  };\n}\n\n/**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\nfunction once(func) {\n  return before(2, func);\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = once;\n","const timespan = require('./lib/timespan');\nconst PS_SUPPORTED = require('./lib/psSupported');\nconst validateAsymmetricKey = require('./lib/validateAsymmetricKey');\nconst jws = require('jws');\nconst includes = require('lodash.includes');\nconst isBoolean = require('lodash.isboolean');\nconst isInteger = require('lodash.isinteger');\nconst isNumber = require('lodash.isnumber');\nconst isPlainObject = require('lodash.isplainobject');\nconst isString = require('lodash.isstring');\nconst once = require('lodash.once');\nconst { KeyObject, createSecretKey, createPrivateKey } = require('crypto')\n\nconst SUPPORTED_ALGS = ['RS256', 'RS384', 'RS512', 'ES256', 'ES384', 'ES512', 'HS256', 'HS384', 'HS512', 'none'];\nif (PS_SUPPORTED) {\n  SUPPORTED_ALGS.splice(3, 0, 'PS256', 'PS384', 'PS512');\n}\n\nconst sign_options_schema = {\n  expiresIn: { isValid: function(value) { return isInteger(value) || (isString(value) && value); }, message: '\"expiresIn\" should be a number of seconds or string representing a timespan' },\n  notBefore: { isValid: function(value) { return isInteger(value) || (isString(value) && value); }, message: '\"notBefore\" should be a number of seconds or string representing a timespan' },\n  audience: { isValid: function(value) { return isString(value) || Array.isArray(value); }, message: '\"audience\" must be a string or array' },\n  algorithm: { isValid: includes.bind(null, SUPPORTED_ALGS), message: '\"algorithm\" must be a valid string enum value' },\n  header: { isValid: isPlainObject, message: '\"header\" must be an object' },\n  encoding: { isValid: isString, message: '\"encoding\" must be a string' },\n  issuer: { isValid: isString, message: '\"issuer\" must be a string' },\n  subject: { isValid: isString, message: '\"subject\" must be a string' },\n  jwtid: { isValid: isString, message: '\"jwtid\" must be a string' },\n  noTimestamp: { isValid: isBoolean, message: '\"noTimestamp\" must be a boolean' },\n  keyid: { isValid: isString, message: '\"keyid\" must be a string' },\n  mutatePayload: { isValid: isBoolean, message: '\"mutatePayload\" must be a boolean' },\n  allowInsecureKeySizes: { isValid: isBoolean, message: '\"allowInsecureKeySizes\" must be a boolean'},\n  allowInvalidAsymmetricKeyTypes: { isValid: isBoolean, message: '\"allowInvalidAsymmetricKeyTypes\" must be a boolean'}\n};\n\nconst registered_claims_schema = {\n  iat: { isValid: isNumber, message: '\"iat\" should be a number of seconds' },\n  exp: { isValid: isNumber, message: '\"exp\" should be a number of seconds' },\n  nbf: { isValid: isNumber, message: '\"nbf\" should be a number of seconds' }\n};\n\nfunction validate(schema, allowUnknown, object, parameterName) {\n  if (!isPlainObject(object)) {\n    throw new Error('Expected \"' + parameterName + '\" to be a plain object.');\n  }\n  Object.keys(object)\n    .forEach(function(key) {\n      const validator = schema[key];\n      if (!validator) {\n        if (!allowUnknown) {\n          throw new Error('\"' + key + '\" is not allowed in \"' + parameterName + '\"');\n        }\n        return;\n      }\n      if (!validator.isValid(object[key])) {\n        throw new Error(validator.message);\n      }\n    });\n}\n\nfunction validateOptions(options) {\n  return validate(sign_options_schema, false, options, 'options');\n}\n\nfunction validatePayload(payload) {\n  return validate(registered_claims_schema, true, payload, 'payload');\n}\n\nconst options_to_payload = {\n  'audience': 'aud',\n  'issuer': 'iss',\n  'subject': 'sub',\n  'jwtid': 'jti'\n};\n\nconst options_for_objects = [\n  'expiresIn',\n  'notBefore',\n  'noTimestamp',\n  'audience',\n  'issuer',\n  'subject',\n  'jwtid',\n];\n\nmodule.exports = function (payload, secretOrPrivateKey, options, callback) {\n  if (typeof options === 'function') {\n    callback = options;\n    options = {};\n  } else {\n    options = options || {};\n  }\n\n  const isObjectPayload = typeof payload === 'object' &&\n                        !Buffer.isBuffer(payload);\n\n  const header = Object.assign({\n    alg: options.algorithm || 'HS256',\n    typ: isObjectPayload ? 'JWT' : undefined,\n    kid: options.keyid\n  }, options.header);\n\n  function failure(err) {\n    if (callback) {\n      return callback(err);\n    }\n    throw err;\n  }\n\n  if (!secretOrPrivateKey && options.algorithm !== 'none') {\n    return failure(new Error('secretOrPrivateKey must have a value'));\n  }\n\n  if (secretOrPrivateKey != null && !(secretOrPrivateKey instanceof KeyObject)) {\n    try {\n      secretOrPrivateKey = createPrivateKey(secretOrPrivateKey)\n    } catch (_) {\n      try {\n        secretOrPrivateKey = createSecretKey(typeof secretOrPrivateKey === 'string' ? Buffer.from(secretOrPrivateKey) : secretOrPrivateKey)\n      } catch (_) {\n        return failure(new Error('secretOrPrivateKey is not valid key material'));\n      }\n    }\n  }\n\n  if (header.alg.startsWith('HS') && secretOrPrivateKey.type !== 'secret') {\n    return failure(new Error((`secretOrPrivateKey must be a symmetric key when using ${header.alg}`)))\n  } else if (/^(?:RS|PS|ES)/.test(header.alg)) {\n    if (secretOrPrivateKey.type !== 'private') {\n      return failure(new Error((`secretOrPrivateKey must be an asymmetric key when using ${header.alg}`)))\n    }\n    if (!options.allowInsecureKeySizes &&\n      !header.alg.startsWith('ES') &&\n      secretOrPrivateKey.asymmetricKeyDetails !== undefined && //KeyObject.asymmetricKeyDetails is supported in Node 15+\n      secretOrPrivateKey.asymmetricKeyDetails.modulusLength < 2048) {\n      return failure(new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${header.alg}`));\n    }\n  }\n\n  if (typeof payload === 'undefined') {\n    return failure(new Error('payload is required'));\n  } else if (isObjectPayload) {\n    try {\n      validatePayload(payload);\n    }\n    catch (error) {\n      return failure(error);\n    }\n    if (!options.mutatePayload) {\n      payload = Object.assign({},payload);\n    }\n  } else {\n    const invalid_options = options_for_objects.filter(function (opt) {\n      return typeof options[opt] !== 'undefined';\n    });\n\n    if (invalid_options.length > 0) {\n      return failure(new Error('invalid ' + invalid_options.join(',') + ' option for ' + (typeof payload ) + ' payload'));\n    }\n  }\n\n  if (typeof payload.exp !== 'undefined' && typeof options.expiresIn !== 'undefined') {\n    return failure(new Error('Bad \"options.expiresIn\" option the payload already has an \"exp\" property.'));\n  }\n\n  if (typeof payload.nbf !== 'undefined' && typeof options.notBefore !== 'undefined') {\n    return failure(new Error('Bad \"options.notBefore\" option the payload already has an \"nbf\" property.'));\n  }\n\n  try {\n    validateOptions(options);\n  }\n  catch (error) {\n    return failure(error);\n  }\n\n  if (!options.allowInvalidAsymmetricKeyTypes) {\n    try {\n      validateAsymmetricKey(header.alg, secretOrPrivateKey);\n    } catch (error) {\n      return failure(error);\n    }\n  }\n\n  const timestamp = payload.iat || Math.floor(Date.now() / 1000);\n\n  if (options.noTimestamp) {\n    delete payload.iat;\n  } else if (isObjectPayload) {\n    payload.iat = timestamp;\n  }\n\n  if (typeof options.notBefore !== 'undefined') {\n    try {\n      payload.nbf = timespan(options.notBefore, timestamp);\n    }\n    catch (err) {\n      return failure(err);\n    }\n    if (typeof payload.nbf === 'undefined') {\n      return failure(new Error('\"notBefore\" should be a number of seconds or string representing a timespan eg: \"1d\", \"20h\", 60'));\n    }\n  }\n\n  if (typeof options.expiresIn !== 'undefined' && typeof payload === 'object') {\n    try {\n      payload.exp = timespan(options.expiresIn, timestamp);\n    }\n    catch (err) {\n      return failure(err);\n    }\n    if (typeof payload.exp === 'undefined') {\n      return failure(new Error('\"expiresIn\" should be a number of seconds or string representing a timespan eg: \"1d\", \"20h\", 60'));\n    }\n  }\n\n  Object.keys(options_to_payload).forEach(function (key) {\n    const claim = options_to_payload[key];\n    if (typeof options[key] !== 'undefined') {\n      if (typeof payload[claim] !== 'undefined') {\n        return failure(new Error('Bad \"options.' + key + '\" option. The payload already has an \"' + claim + '\" property.'));\n      }\n      payload[claim] = options[key];\n    }\n  });\n\n  const encoding = options.encoding || 'utf8';\n\n  if (typeof callback === 'function') {\n    callback = callback && once(callback);\n\n    jws.createSign({\n      header: header,\n      privateKey: secretOrPrivateKey,\n      payload: payload,\n      encoding: encoding\n    }).once('error', callback)\n      .once('done', function (signature) {\n        // TODO: Remove in favor of the modulus length check before signing once node 15+ is the minimum supported version\n        if(!options.allowInsecureKeySizes && /^(?:RS|PS)/.test(header.alg) && signature.length < 256) {\n          return callback(new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${header.alg}`))\n        }\n        callback(null, signature);\n      });\n  } else {\n    let signature = jws.sign({header: header, payload: payload, secret: secretOrPrivateKey, encoding: encoding});\n    // TODO: Remove in favor of the modulus length check before signing once node 15+ is the minimum supported version\n    if(!options.allowInsecureKeySizes && /^(?:RS|PS)/.test(header.alg) && signature.length < 256) {\n      throw new Error(`secretOrPrivateKey has a minimum key size of 2048 bits for ${header.alg}`)\n    }\n    return signature\n  }\n};\n","module.exports = {\n  decode: require('./decode'),\n  verify: require('./verify'),\n  sign: require('./sign'),\n  JsonWebTokenError: require('./lib/JsonWebTokenError'),\n  NotBeforeError: require('./lib/NotBeforeError'),\n  TokenExpiredError: require('./lib/TokenExpiredError'),\n};\n","/**\n * Canonical storage keys and bucket names.\n *\n * Storage is not under RLS, so a `storageAuthorize` hook is the whole access\n * control model — and a hook can only be correct if the key it is shown is the\n * key that is written. That is the invariant this module exists to hold: one\n * canonical string, computed once per request, handed to the hook, to the\n * controller, and to the download token alike.\n *\n * ## Why rejecting beats stripping\n *\n * The previous `sanitizeStorageKey` *stripped* `../` in a single pass. Two\n * things were wrong with that, and only one of them was the obvious one.\n *\n * The obvious one: a single pass is not a fixed point. `....//` contains `../`\n * at offset 2, so removing it leaves `../` behind — the sanitizer manufactured\n * the traversal it was there to remove. `users/alice/....//bob/x` came out as\n * `users/alice/../bob/x`, which a prefix hook reads as alice's (it starts with\n * `users/alice/`) and the filesystem reads as bob's. The hook approved one\n * object and the controller wrote another.\n *\n * The subtler one, and the reason this is a rewrite rather than a loop: even a\n * correct strip is a silent rewrite. A caller who asks to store at `a/../b` and\n * gets an object at `a/b` was not protected, they were misled — and every later\n * read, ownership row and audit line now refers to a path nobody chose. So a key\n * that means something other than what it says is refused (400), not repaired.\n *\n * Note what is NOT traversal under this rule: `....` is an ordinary directory\n * name, and `users/alice/....//bob/x` canonicalizes to\n * `users/alice/..../bob/x` — still comfortably inside alice's prefix, which is\n * exactly right. Only a real `..` segment is refused.\n */\n\nimport path from \"node:path\";\nimport { DEFAULT_STORAGE_SOURCE_KEY } from \"@rebasepro/types\";\n\n/** Longest key accepted, in UTF-16 code units. Matches the previous cap. */\nexport const MAX_STORAGE_KEY_LENGTH = 1024;\n\n/**\n * A key that cannot be canonicalized. Carries no path back to the caller\n * beyond what they sent, so it is safe to surface as a 400 message.\n */\nexport class InvalidStorageKeyError extends Error {\n    constructor(message: string) {\n        super(message);\n        this.name = \"InvalidStorageKeyError\";\n    }\n}\n\n/**\n * Canonicalize a caller-supplied storage key, or throw\n * {@link InvalidStorageKeyError}.\n *\n * Normalizations applied (safe, idempotent, and meaning-preserving):\n * - leading slashes removed — `/a/b` and `a/b` name the same object\n * - `.` segments and repeated slashes collapsed\n *\n * Refusals (the key means something other than what it says):\n * - any `..` segment, on either separator, at any depth\n * - null bytes\n * - keys longer than {@link MAX_STORAGE_KEY_LENGTH}\n *\n * A trailing slash is preserved: it is how the folder route marks a prefix.\n */\nexport function canonicalStorageKey(rawKey: string): string {\n    if (rawKey.includes(\"\\0\")) {\n        throw new InvalidStorageKeyError(\"Storage key contains a null byte.\");\n    }\n    if (rawKey.length > MAX_STORAGE_KEY_LENGTH) {\n        throw new InvalidStorageKeyError(\n            `Storage key exceeds the maximum length of ${MAX_STORAGE_KEY_LENGTH} characters.`\n        );\n    }\n\n    // Split on both separators: `path.join` treats `\\` as a separator on\n    // Windows, so `..\\` is traversal there even though POSIX reads it as a\n    // filename. Checked against the RAW key, before any normalization — the\n    // whole point is that `a/../b` is refused rather than quietly turned into\n    // `b`.\n    if (rawKey.split(/[\\\\/]/).some((segment) => segment === \"..\")) {\n        throw new InvalidStorageKeyError(\n            \"Storage key contains a '..' path segment. Keys must name an object directly.\"\n        );\n    }\n\n    const withoutLeadingSlashes = rawKey.replace(/^\\/+/, \"\");\n    if (withoutLeadingSlashes === \"\") return \"\";\n\n    // Whether the key names a *directory* rather than an object: it ends with a\n    // separator, or its last segment is the `.` that means \"this directory\".\n    //\n    // Recorded before normalizing, because `path.posix.normalize` drops the\n    // distinction in one of those two spellings and not the other: `public/.`\n    // becomes `public` while `public/./` stays `public/`. That asymmetry breaks\n    // the rule this module states — a trailing slash is preserved, because it is\n    // how the folder route marks a prefix — and it is not cosmetic on `list`,\n    // where a prefix of `public` also matches `publicity/` and hands back keys\n    // the caller never asked for.\n    const denotesDirectory = /(?:^|\\/)\\.?$/.test(withoutLeadingSlashes);\n\n    // Safe now: with no `..` segment in the input, `normalize` can only collapse\n    // `.` and duplicate slashes — it cannot climb.\n    const normalized = path.posix.normalize(withoutLeadingSlashes);\n\n    // `normalize(\".\")`, and `normalize(\"./\")` → `./`; neither names an object.\n    if (normalized === \".\" || normalized === \"./\") return \"\";\n\n    // `normalize` re-introduces a leading `./` for keys like `.//a`.\n    const key = normalized.replace(/^\\.\\//, \"\").replace(/^\\/+/, \"\");\n    if (key === \"\") return \"\";\n    return denotesDirectory && !key.endsWith(\"/\") ? `${key}/` : key;\n}\n\n/**\n * Canonicalize, or return `null` when the key is not canonicalizable.\n *\n * For callers that must fail closed without an exception — the download-token\n * middleware compares a request path against a granted path, and a key it\n * cannot canonicalize simply matches nothing.\n */\nexport function tryCanonicalStorageKey(rawKey: string): string | null {\n    try {\n        return canonicalStorageKey(rawKey);\n    } catch {\n        return null;\n    }\n}\n\n/**\n * Canonicalize the storage *source* a request names (`?storageId=`), so that\n * \"the default source\" has exactly one spelling.\n *\n * The default source can be asked for three ways — the parameter omitted, sent\n * empty, or sent as the literal `(default)` — and all three resolve to the same\n * controller. Without a single spelling, the value derived when a download\n * token is minted and the value derived when it is presented can differ for the\n * same object, which is either a spurious 403 or, if the comparison is dropped\n * to stop those, no scoping at all.\n *\n * Deliberately *not* validated against the registry: this is a naming rule, not\n * an existence check, and it must give the same answer in `auth/` (which has no\n * registry) as in the storage routes. An id that names no source still\n * canonicalizes to itself and simply matches only itself.\n */\nexport function canonicalStorageId(rawStorageId: string | undefined | null): string {\n    if (rawStorageId === undefined || rawStorageId === null) return DEFAULT_STORAGE_SOURCE_KEY;\n    const trimmed = rawStorageId.trim();\n    return trimmed === \"\" ? DEFAULT_STORAGE_SOURCE_KEY : trimmed;\n}\n\n/**\n * Longest bucket name accepted. 63 is the S3/GCS limit, and a local bucket is\n * one directory name, so the tighter of the two bounds everything.\n */\nexport const MAX_STORAGE_BUCKET_LENGTH = 63;\n\n/** A bucket name that does not name a bucket. See {@link canonicalStorageBucket}. */\nexport class InvalidStorageBucketError extends Error {\n    constructor(message: string) {\n        super(message);\n        this.name = \"InvalidStorageBucketError\";\n    }\n}\n\n/**\n * One path segment: letters, digits, `.`, `_`, `-`, first character\n * alphanumeric. Deliberately narrow — it is the intersection of what S3, GCS\n * and a filesystem directory all accept, and it makes `..`, `.tus-uploads`,\n * absolute paths and anything containing a separator unrepresentable.\n */\nconst STORAGE_BUCKET_PATTERN = /^[A-Za-z0-9][A-Za-z0-9._-]*$/;\n\n/**\n * Canonicalize a caller-supplied bucket name, or throw\n * {@link InvalidStorageBucketError}.\n *\n * The bucket is the *other* caller-controlled routing value in an upload\n * request, and it was the one nobody validated. `LocalStorageController`\n * builds `join(basePath, bucket)` and then checks containment against that\n * result, so a bucket of `../../etc` moved the boundary rather than crossing\n * it — the guard passed because the guard's reference point was the attacker's.\n * The containment check now resolves against the storage root, and this is the\n * check at the route boundary that stops the value before it gets there.\n *\n * A bucket is configuration, not user data: there is no legitimate caller that\n * needs a separator, a leading dot, or a `..` in one. So this refuses rather\n * than repairs, exactly as {@link canonicalStorageKey} does — a rewritten\n * bucket would silently store the object somewhere the caller did not ask for.\n *\n * Returns `undefined` when the caller named no bucket (absent, or an empty\n * form field), which is how every controller spells \"use my default\". An empty\n * string used to reach `getFullPath` and resolve to the storage *root* rather\n * than the `default` bucket, which is a third place a bare key did not\n * round-trip.\n */\nexport function canonicalStorageBucket(rawBucket: string | undefined | null): string | undefined {\n    if (rawBucket === undefined || rawBucket === null || rawBucket === \"\") return undefined;\n    if (rawBucket.length > MAX_STORAGE_BUCKET_LENGTH) {\n        throw new InvalidStorageBucketError(\n            `Storage bucket exceeds the maximum length of ${MAX_STORAGE_BUCKET_LENGTH} characters.`\n        );\n    }\n    if (!STORAGE_BUCKET_PATTERN.test(rawBucket)) {\n        throw new InvalidStorageBucketError(\n            \"Storage bucket must be a single name of letters, digits, '.', '_' or '-', \" +\n            \"starting with a letter or digit.\"\n        );\n    }\n    return rawBucket;\n}\n","import { createPublicKey, createPrivateKey, type KeyObject } from \"crypto\";\n\n/**\n * Asymmetric signing keys for access tokens, and the JWKS built from them.\n *\n * The symmetric secret this replaces is not going away — it still signs every\n * purpose-scoped token (download, MFA-pending, password reset), which are read\n * only by the server that minted them and are better off short. What a shared\n * secret cannot do is let *anybody else* verify a session:\n *\n *  - a gateway, an edge worker, or a second service that wants to check a token\n *    has to be handed the key that mints them, so every verifier becomes a\n *    forger;\n *  - and rotating it invalidates every token in circulation at once, which is\n *    why in practice it never gets rotated at all.\n *\n * A private key signs, the matching public key verifies, and the public half is\n * published at `/.well-known/jwks.json` for anyone to fetch. Rotation stops\n * being an outage: mint with the new key, keep the old one in the list until\n * the last token signed by it has expired, then drop it.\n *\n * **The key is chosen by `kid`, and the algorithm comes from the key — never\n * from the token.** A verifier that reads `alg` out of the header it is\n * checking will accept an `HS256` token whose \"secret\" is the RSA public key it\n * published, which is a complete authentication bypass and the best-known way\n * to get this wrong. {@link resolveVerificationKey} therefore returns the\n * algorithm alongside the key, and the caller pins it.\n */\n\n/** The algorithms a signing key may use. Both are widely supported by verifiers. */\nexport type JwtSigningAlgorithm = \"RS256\" | \"ES256\";\n\n/**\n * One asymmetric key pair, as an operator configures it.\n *\n * Only the private key is supplied: the public half is derived from it, so a\n * mismatched pair — a configuration error that produces tokens nobody can\n * verify, and which no amount of local testing catches because the signer never\n * consults the public key — cannot be expressed.\n */\nexport interface JwtSigningKeyConfig {\n    /**\n     * Names this key in the token header and in the JWKS. Any stable string;\n     * something that identifies *when* it was minted (`\"2026-08\"`) is the usual\n     * choice, because the question you ask of a `kid` later is always \"is this\n     * the old one?\".\n     */\n    kid: string;\n    /** PEM-encoded PKCS#8 or SEC1 private key. */\n    privateKey: string;\n    /**\n     * Defaults to the algorithm implied by the key type — RSA keys sign RS256,\n     * EC keys sign ES256. Worth setting only to be explicit.\n     */\n    algorithm?: JwtSigningAlgorithm;\n}\n\n/** A configured key, parsed and ready to sign or verify with. */\nexport interface ResolvedJwtKey {\n    kid: string;\n    algorithm: JwtSigningAlgorithm;\n    privateKey: KeyObject;\n    publicKey: KeyObject;\n}\n\n/** A JSON Web Key, as served by the JWKS endpoint. Public parameters only. */\nexport type PublicJwk = Record<string, unknown> & {\n    kid: string;\n    alg: JwtSigningAlgorithm;\n    use: \"sig\";\n};\n\n/**\n * The algorithm a key type implies.\n *\n * Rejecting anything else here rather than defaulting is deliberate: an Ed25519\n * key configured by someone expecting it to work would otherwise be signed with\n * `RS256` in the header and fail verification everywhere, at runtime, on tokens\n * already handed to users.\n */\nfunction algorithmForKey(key: KeyObject, kid: string): JwtSigningAlgorithm {\n    switch (key.asymmetricKeyType) {\n        case \"rsa\":\n        case \"rsa-pss\":\n            return \"RS256\";\n        case \"ec\":\n            return \"ES256\";\n        default:\n            throw new Error(\n                `JWT signing key \"${kid}\" is a ${key.asymmetricKeyType ?? \"non-asymmetric\"} key. ` +\n                \"Supported: RSA (RS256) and EC P-256 (ES256). Generate one with: \" +\n                \"openssl genpkey -algorithm EC -pkeyopt ec_paramgen_curve:P-256 -out jwt-key.pem\"\n            );\n    }\n}\n\n/**\n * An EC key of the wrong curve is the other way a key parses cleanly and then\n * fails to verify: `ES256` means P-256 specifically, and a P-384 key signs a\n * token whose header says P-256's algorithm.\n */\nfunction assertCurveMatches(publicKey: KeyObject, kid: string): void {\n    const jwk = publicKey.export({ format: \"jwk\" }) as { crv?: string };\n    if (jwk.crv && jwk.crv !== \"P-256\") {\n        throw new Error(\n            `JWT signing key \"${kid}\" uses curve ${jwk.crv}, but ES256 requires P-256. ` +\n            \"Generate one with: openssl genpkey -algorithm EC -pkeyopt ec_paramgen_curve:P-256 -out jwt-key.pem\"\n        );\n    }\n}\n\n/**\n * Parse the configured keys, deriving each public half from its private key.\n *\n * Throws on anything malformed. This runs at boot, from `configureJwt`, so a\n * key that cannot sign takes the process down at start rather than at the first\n * login — the same bargain every other credential in this file makes.\n */\nexport function resolveSigningKeys(configs: JwtSigningKeyConfig[]): ResolvedJwtKey[] {\n    const seen = new Set<string>();\n\n    return configs.map((config) => {\n        if (!config.kid) {\n            throw new Error(\"Every JWT signing key needs a `kid`; it is what the JWKS and the token header agree on.\");\n        }\n        if (seen.has(config.kid)) {\n            throw new Error(\n                `Duplicate JWT signing key id \"${config.kid}\". A \\`kid\\` selects exactly one key at ` +\n                \"verification time, so two keys sharing one is a token that verifies or does not depending on order.\"\n            );\n        }\n        seen.add(config.kid);\n\n        let privateKey: KeyObject;\n        try {\n            privateKey = createPrivateKey(config.privateKey);\n        } catch (error) {\n            throw new Error(\n                `JWT signing key \"${config.kid}\" is not a readable PEM private key: ` +\n                `${error instanceof Error ? error.message : String(error)}`\n            );\n        }\n\n        const publicKey = createPublicKey(privateKey);\n        const derived = algorithmForKey(privateKey, config.kid);\n        const algorithm = config.algorithm ?? derived;\n\n        if (algorithm !== derived) {\n            throw new Error(\n                `JWT signing key \"${config.kid}\" is declared as ${algorithm} but is a ` +\n                `${privateKey.asymmetricKeyType} key, which signs ${derived}.`\n            );\n        }\n        if (algorithm === \"ES256\") assertCurveMatches(publicKey, config.kid);\n\n        return { kid: config.kid, algorithm, privateKey, publicKey };\n    });\n}\n\n/**\n * The key a token names, or `null` if it names none we hold.\n *\n * The returned algorithm is the *key's*, and the caller must verify with that\n * one alone. See the module docblock for what happens otherwise.\n */\nexport function resolveVerificationKey(keys: ResolvedJwtKey[], kid: string | undefined): ResolvedJwtKey | null {\n    if (!kid) return null;\n    return keys.find((key) => key.kid === kid) ?? null;\n}\n\n/**\n * A PEM as an environment variable can actually carry it.\n *\n * A PEM is multi-line and environment variables are not, so every deployment\n * tool solves it differently: `.env` files and most secret managers escape the\n * newlines to `\\n`, Kubernetes and Docker secrets pass the bytes through\n * intact, and CI systems that mangle both are usually fed base64. All three\n * arrive here, and guessing wrong produces \"not a readable PEM private key\" at\n * boot with a key the operator can see is perfectly valid.\n *\n * Detection is on content, not on a flag: a PEM says so on its first line, and\n * anything that does not is tried as base64.\n */\nexport function normalizePemFromEnv(value: string): string {\n    const trimmed = value.trim();\n    if (trimmed.includes(\"-----BEGIN\")) {\n        // Literal backslash-n, not a newline — what an escaped .env value holds.\n        return trimmed.replace(/\\\\n/g, \"\\n\");\n    }\n    return Buffer.from(trimmed, \"base64\").toString(\"utf8\");\n}\n\n/**\n * The public halves, in JWKS form.\n *\n * Node exports a JWK containing only public parameters for a public\n * `KeyObject` — no `d`, no primes — so the private material cannot leak\n * through this path even if a private key were passed by mistake. The keys are\n * derived from `publicKey` regardless, and this is asserted in the tests,\n * because \"cannot\" is worth checking on the one endpoint whose entire job is to\n * be world-readable.\n */\nexport function toJwks(keys: ResolvedJwtKey[]): { keys: PublicJwk[] } {\n    return {\n        keys: keys.map((key) => ({\n            ...(key.publicKey.export({ format: \"jwk\" }) as Record<string, unknown>),\n            kid: key.kid,\n            alg: key.algorithm,\n            use: \"sig\" as const\n        }))\n    };\n}\n","import jwt from \"jsonwebtoken\";\nimport { createHash, randomBytes } from \"crypto\";\nimport { logger } from \"../utils/logger\";\n// A leaf module (node:path and `@rebasepro/types` only), so this does not close\n// an import cycle. Same reason the key canonicalizer lives there: the value a\n// token is minted with and the value a request is checked against must come\n// from one function, not from two copies of one rule.\nimport { canonicalStorageId } from \"../storage/keys\";\nimport {\n    resolveSigningKeys,\n    resolveVerificationKey,\n    toJwks,\n    type JwtSigningKeyConfig,\n    type PublicJwk,\n    type ResolvedJwtKey\n} from \"./jwt-keys\";\n\nexport interface JwtConfig {\n    secret: string;\n    accessExpiresIn?: string;\n    refreshExpiresIn?: string;\n    /**\n     * Asymmetric keys for signing **access tokens**, newest first.\n     *\n     * Optional and additive: with none configured everything below behaves\n     * exactly as it did, signing HS256 with {@link JwtConfig.secret}. With one\n     * configured, access tokens are signed by {@link JwtConfig.activeKid} (or\n     * the first entry) and carry its `kid`, and every key in the list keeps\n     * verifying — which is what makes rotation a deploy rather than a mass\n     * sign-out. Tokens minted before any key existed carry no `kid` and are\n     * still verified against the secret until they expire.\n     *\n     * The secret stays required regardless: purpose-scoped tokens (download,\n     * MFA-pending, password reset) are read only by this server, and are\n     * shorter and cheaper symmetric. See `jwt-keys.ts`.\n     */\n    signingKeys?: JwtSigningKeyConfig[];\n    /** Which key signs. Defaults to the first entry of {@link JwtConfig.signingKeys}. */\n    activeKid?: string;\n}\n\nexport interface AccessTokenPayload {\n    /**\n     * The user's id — the same spelling the domain model, the auth adapters and\n     * the RLS layer (`auth.uid()`) all use. Tokens minted before this rename\n     * carry `uid` instead, and older external IdPs may send `sub`;\n     * {@link verifyAccessToken} accepts all three and normalises to this.\n     */\n    uid: string;\n    roles: string[];\n    /** Authentication Assurance Level: aal1 = password/oauth, aal2 = MFA verified */\n    aal?: \"aal1\" | \"aal2\";\n    /**\n     * When the token was issued, in seconds since the epoch — the standard JWT\n     * `iat` claim, which `jsonwebtoken` sets on every token it signs.\n     *\n     * Carried through verification because revocation needs it: `logout`,\n     * `change-password`, `reset-password` and `DELETE /auth/sessions` all stamp\n     * a `tokensValidAfter` watermark on the user, and a token is void if it was\n     * issued before that mark. `verifyAccessToken` used to rebuild the payload\n     * from three claims and drop this one, so nothing downstream could make the\n     * comparison and the watermark was read on exactly one path — refresh.\n     */\n    iat?: number;\n    /** Email claim from the JWT, if present */\n    email?: string;\n    /** Display name claim from the JWT, if present */\n    displayName?: string;\n    /** Photo URL claim from the JWT, if present */\n    photoURL?: string;\n    /** Whether MFA has been verified for this session */\n    mfa_verified?: boolean;\n    /** Authentication Methods Reference — list of methods used (e.g. 'pwd', 'otp') */\n    amr?: string[];\n}\n\nlet jwtConfig: JwtConfig = {\n    secret: \"\",\n    accessExpiresIn: \"1h\",\n    // 400 days, sliding — see getRefreshTokenTtlMs. A 30-day default meant a\n    // user who took a summer off came back signed out, which nobody asked for\n    // and which neither of the auth services people compare us to does.\n    refreshExpiresIn: \"400d\"\n};\n\n/**\n * The parsed signing keys, and which one mints new access tokens.\n *\n * Both are module state beside `jwtConfig` for the same reason it is: every\n * signing and verifying path in the server reads them through this file, and\n * there is exactly one JWT configuration per process.\n */\nlet signingKeys: ResolvedJwtKey[] = [];\nlet activeSigningKey: ResolvedJwtKey | null = null;\n\n/**\n * Configure JWT settings - call this during initialization.\n * Validates the secret strength to prevent deployment with default/weak secrets.\n */\nexport function configureJwt(config: JwtConfig): void {\n    // Reject obviously weak/default secrets\n    const weakSecrets = new Set([\n        \"secret\",\n        \"jwt-secret\",\n        \"jwt_secret\",\n        \"your-secret\",\n        \"your-super-secret-jwt-key-change-in-production\",\n        \"super-secret-jwt-key-change-in-production\",\n        \"change-me\",\n        \"changeme\",\n        \"password\",\n        \"test\",\n        \"mysecret\",\n        \"my-secret\",\n        \"my_secret\",\n        \"example-secret\",\n        \"please-change-me\",\n        \"replace-this-with-a-real-secret\",\n        \"default-secret\",\n        \"rebase_saas_jwt_secret_must_be_long_long_long_long\",\n        \"rebase_saas_service_key_must_be_long_long_long_long\"\n    ]);\n\n    if (!config.secret || config.secret.length < 32) {\n        throw new Error(\n            \"JWT secret is too short. Must be at least 32 characters. \" +\n            \"Generate one with: node -e \\\"logger.info(require('crypto').randomBytes(48).toString('base64'))\\\"\"\n        );\n    }\n\n    if (weakSecrets.has(config.secret.toLowerCase())) {\n        throw new Error(\n            \"JWT secret is a known default/weak value. Please use a strong, randomly generated secret. \" +\n            \"Generate one with: node -e \\\"logger.info(require('crypto').randomBytes(48).toString('base64'))\\\"\"\n        );\n    }\n\n    // Resolved before `jwtConfig` is replaced, so a malformed key leaves the\n    // previous configuration standing rather than half-applying a new one.\n    const resolved = config.signingKeys ? resolveSigningKeys(config.signingKeys) : [];\n    let active: ResolvedJwtKey | null = null;\n    if (resolved.length > 0) {\n        if (config.activeKid) {\n            active = resolved.find((key) => key.kid === config.activeKid) ?? null;\n            if (!active) {\n                throw new Error(\n                    `auth.activeKid is \"${config.activeKid}\", which is not among the configured signing keys ` +\n                    `(${resolved.map((k) => `\"${k.kid}\"`).join(\", \")}). Signing with a key nobody published ` +\n                    \"produces tokens no verifier can check.\"\n                );\n            }\n        } else {\n            active = resolved[0];\n        }\n    }\n\n    jwtConfig = {\n        ...jwtConfig,\n        ...config\n    };\n    signingKeys = resolved;\n    activeSigningKey = active;\n}\n\n/**\n * The public keys, in JWKS form, for `/.well-known/jwks.json`.\n *\n * An empty `keys` array on a backend with no asymmetric keys configured is the\n * correct answer rather than a 404: it says \"this issuer publishes none\",\n * which a verifier can act on, where a 404 is indistinguishable from a\n * misconfigured URL.\n */\nexport function getJwks(): { keys: PublicJwk[] } {\n    return toJwks(signingKeys);\n}\n\n/** Is this backend signing access tokens asymmetrically? */\nexport function hasAsymmetricSigningKey(): boolean {\n    return activeSigningKey !== null;\n}\n\n/**\n * Has this server been given a JWT secret?\n *\n * False on every backend that authenticates through an adapter — Firebase,\n * Clerk, anything with its own tokens — because nothing calls\n * {@link configureJwt} there. Signing paths still throw when it is false, since\n * asking for a token from a server that cannot mint one is a mistake worth\n * hearing about. Paths whose contract is *\"tolerate the absence of auth\"* must\n * ask first: `optionalAuth` crashing a request because this backend does not do\n * JWT is a 500 on a route that had already decided anonymous was acceptable.\n */\nexport function isJwtConfigured(): boolean {\n    return Boolean(jwtConfig.secret);\n}\n\n/**\n * Generate an access token (short-lived, 1 hour by default)\n */\nexport function generateAccessToken(\n    uid: string,\n    roles: string[],\n    aal: \"aal1\" | \"aal2\" = \"aal1\",\n    customClaims?: Record<string, unknown>\n): string {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    // `aal` is written AFTER the custom claims, not before. The hook is handed a\n    // `defaultClaims` object that already contains `aal`, and the obvious hook\n    // — spread the input, add a field — echoes it straight back; one that\n    // merged a user-controlled profile object could echo back `aal: \"aal2\"`.\n    // Spreading last made the assurance level of a session something its own\n    // holder could assert, which is the one claim that must be decided here.\n    const payload: Record<string, unknown> = {\n        uid,\n        roles,\n        ...customClaims,\n        aal\n    };\n\n    // The `kid` is what lets a verifier pick the right public key out of the\n    // JWKS, and what lets the previous key keep working while tokens signed by\n    // it are still in circulation.\n    if (activeSigningKey) {\n        return jwt.sign(payload, activeSigningKey.privateKey, {\n            expiresIn: jwtConfig.accessExpiresIn as jwt.SignOptions[\"expiresIn\"],\n            algorithm: activeSigningKey.algorithm,\n            keyid: activeSigningKey.kid\n        });\n    }\n\n    return jwt.sign(payload, jwtConfig.secret, {\n        expiresIn: jwtConfig.accessExpiresIn as jwt.SignOptions[\"expiresIn\"],\n        algorithm: \"HS256\"\n    });\n}\n\n/**\n * Get the expiration time of an access token in milliseconds from now\n */\nexport function getAccessTokenExpiryMs(): number {\n    const duration = jwtConfig.accessExpiresIn || \"1h\";\n    const match = duration.match(/^(\\d+)([dhms])$/);\n\n    if (!match) {\n        // Default to 1 hour\n        return 60 * 60 * 1000;\n    }\n\n    const value = parseInt(match[1], 10);\n    const unit = match[2];\n\n    switch (unit) {\n        case \"d\": return value * 24 * 60 * 60 * 1000;\n        case \"h\": return value * 60 * 60 * 1000;\n        case \"m\": return value * 60 * 1000;\n        case \"s\": return value * 1000;\n        default: return 60 * 60 * 1000;\n    }\n}\n\n/**\n * Get the expiration timestamp for an access token\n */\nexport function getAccessTokenExpiry(): number {\n    return Date.now() + getAccessTokenExpiryMs();\n}\n\n/**\n * Verify and decode an access token.\n *\n * Every token this server issues is signed with the same secret, so what a\n * token *is* comes from its claims, not from its signature. A download token\n * ({@link generateDownloadToken}) is therefore a validly-signed string that\n * must never authenticate anybody: it is scoped to one file path and handed out\n * in URLs, which is a far weaker thing to hold than a session.\n *\n * Today it is rejected below for want of an id — but only by luck, since\n * nothing stops a future download token from carrying one. So the purpose is\n * checked explicitly: a token minted for reading a file is not a token for\n * being a user.\n */\nexport function verifyAccessToken(token: string): AccessTokenPayload | null {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    try {\n        // Which key, and therefore which algorithm, is decided here — by the\n        // `kid` and by nothing else in the token.\n        //\n        // The alternative, passing every algorithm we support and letting\n        // `jsonwebtoken` read `alg` from the header, is the canonical JWT\n        // vulnerability: an attacker takes the RSA public key we publish at\n        // `/.well-known/jwks.json`, HMACs a payload of their choosing with it,\n        // sets `alg: HS256`, and the verifier — holding that same public key as\n        // \"the secret\" — agrees. Any uid, any roles. So a token naming a key we\n        // hold is verified with that key's algorithm alone, and a token naming\n        // none never reaches the asymmetric path at all.\n        const header = jwt.decode(token, { complete: true })?.header;\n        const namedKey = resolveVerificationKey(signingKeys, header?.kid);\n\n        // `userId` is the pre-rename claim: tokens minted by an older backend\n        // are still in circulation and must keep verifying until they expire,\n        // or a deploy signs every active session out. A token with a `kid` we\n        // do not recognise falls through to the secret and fails there, which\n        // is what a retired key should do.\n        const decoded = (namedKey\n            ? jwt.verify(token, namedKey.publicKey, { algorithms: [namedKey.algorithm] })\n            : jwt.verify(token, jwtConfig.secret, { algorithms: [\"HS256\"] })\n        ) as { uid?: string; userId?: string; sub?: string; roles?: string[]; aal?: string; purpose?: string; iat?: number };\n        if (decoded.purpose) {\n            logger.error(\"[JWT] Verification failed: a purpose-scoped token is not an access token\", { purpose: decoded.purpose });\n            return null;\n        }\n        const id = decoded.uid || decoded.userId || decoded.sub;\n        if (!id) {\n            logger.error(\"[JWT] Verification failed: missing id in payload\", { detail: decoded });\n            return null;\n        }\n\n        const aal = (decoded.aal === \"aal1\" || decoded.aal === \"aal2\") ? decoded.aal : \"aal1\";\n\n        return {\n            uid: id,\n            roles: decoded.roles || [],\n            aal,\n            iat: decoded.iat\n        };\n    } catch (error) {\n        logger.error(\"[JWT] Verification failed\", { error: error, detail: token.substring(0, 15) });\n        return null;\n    }\n}\n\n/**\n * Generate a random refresh token (long-lived, 30 days by default)\n */\nexport function generateRefreshToken(): string {\n    return randomBytes(40).toString(\"hex\");\n}\n\n/**\n * Hash a refresh token for database storage (don't store raw tokens)\n */\nexport function hashRefreshToken(token: string): string {\n    return createHash(\"sha256\").update(token).digest(\"hex\");\n}\n\n/**\n * The longest a cookie can live. Chrome (since 104) and RFC 6265bis silently\n * rewrite any `Max-Age` beyond 400 days down to 400 days, so promising a\n * browser more is not a stricter policy — it is a policy that differs from\n * what is actually enforced, which is worse than knowing the ceiling.\n */\nexport const MAX_COOKIE_AGE_MS = 400 * 24 * 60 * 60 * 1000;\n\n/** Fallback when `refreshExpiresIn` is unset or unparseable. */\nconst DEFAULT_REFRESH_TTL_MS = MAX_COOKIE_AGE_MS;\n\n/**\n * How long a refresh token is valid for, in milliseconds.\n *\n * Every rotation issues a token with a fresh TTL, so this is a sliding window:\n * a user who visits at all keeps their session indefinitely, and one who\n * disappears loses it this long after their last visit. That is what both\n * Firebase and Supabase do by default, and it is the behaviour people mean\n * when they say they expect to still be signed in.\n */\nexport function getRefreshTokenTtlMs(): number {\n    const duration = jwtConfig.refreshExpiresIn;\n    const match = duration?.match(/^(\\d+)([dhms])$/);\n    if (!match) return DEFAULT_REFRESH_TTL_MS;\n\n    const value = parseInt(match[1], 10);\n    switch (match[2]) {\n        case \"d\": return value * 24 * 60 * 60 * 1000;\n        case \"h\": return value * 60 * 60 * 1000;\n        case \"m\": return value * 60 * 1000;\n        case \"s\": return value * 1000;\n        default: return DEFAULT_REFRESH_TTL_MS;\n    }\n}\n\n/**\n * Calculate refresh token expiration date\n */\nexport function getRefreshTokenExpiry(): Date {\n    return new Date(Date.now() + getRefreshTokenTtlMs());\n}\n\n/**\n * The `purpose` claim carried by a credential that stands between \"first factor\n * accepted\" and \"session issued\".\n *\n * A pre-auth token is NOT a session and must never be usable as one:\n * {@link verifyAccessToken} refuses any token carrying a `purpose`, so this\n * value cannot authenticate a request no matter which route it is presented to.\n * The only thing that reads it is the MFA challenge pair, which exchanges it —\n * plus a second factor — for a real session.\n */\nexport const MFA_PENDING_PURPOSE = \"mfa-pending\";\n\n/**\n * Mint the short-lived credential handed back with an `MFA_REQUIRED` response.\n *\n * Short-lived on purpose: it is the window in which a caller who has proven the\n * first factor may present the second, not a session to be carried around. Five\n * minutes matches the challenge TTL.\n */\nexport function generateMfaPendingToken(uid: string, expiresInSeconds = 300): string {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    return jwt.sign({ purpose: MFA_PENDING_PURPOSE,\nuid }, jwtConfig.secret, {\n        expiresIn: expiresInSeconds,\n        algorithm: \"HS256\"\n    });\n}\n\n/**\n * Verify a pre-auth token and return the user it was minted for.\n *\n * Returns `null` for anything else — including a perfectly valid *access*\n * token, which must not be interchangeable with this one in either direction.\n */\nexport function verifyMfaPendingToken(token: string): { uid: string } | null {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    try {\n        const decoded = jwt.verify(token, jwtConfig.secret, { algorithms: [\"HS256\"] }) as { purpose?: string; uid?: string };\n        if (decoded.purpose !== MFA_PENDING_PURPOSE || !decoded.uid) return null;\n        return { uid: decoded.uid };\n    } catch {\n        return null;\n    }\n}\n\nexport interface DownloadTokenPayload {\n    purpose: \"file-read\";\n    path: string;\n    /**\n     * The storage source the grant is good for, canonicalized by\n     * {@link canonicalStorageId}. Always present on a decoded payload; see\n     * {@link verifyDownloadToken} for how tokens minted before this claim\n     * existed are read.\n     */\n    storageId: string;\n}\n\n/**\n * Generate a short-lived download token scoped to a specific file path or prefix\n * *within one storage source*.\n *\n * Both halves of that scope are load-bearing. A key is only unique inside its\n * own bucket, and a project with more than one source routinely holds the same\n * key in several of them — `avatars/u1.png` in `(default)` and in `media` are\n * different objects, quite possibly with different owners. A token that names\n * only the path is therefore a grant on every source at once: authorize a read\n * on the source whose `storageAuthorize` hook says yes, then spend the token\n * against `?storageId=` pointing somewhere else.\n *\n * `storageId` is optional here only because omitting it *is* the default\n * source, which is what the overwhelming majority of deployments have. A mint\n * site that forgets to pass a named source produces a default-scoped token,\n * which fails closed at `/file/*` rather than over-granting.\n */\nexport function generateDownloadToken(\n    path: string,\n    expiresInSeconds: number = 300,\n    storageId?: string | null\n): string {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    const payload: DownloadTokenPayload = {\n        purpose: \"file-read\",\n        path,\n        storageId: canonicalStorageId(storageId)\n    };\n\n    return jwt.sign(payload, jwtConfig.secret, {\n        expiresIn: expiresInSeconds,\n        algorithm: \"HS256\"\n    });\n}\n\n/**\n * Verify and decode a download token.\n *\n * A token minted before `storageId` existed carries no such claim. It is read\n * as a grant on the **default source** rather than on all of them: that is the\n * fail-closed reading, and it is what such a token almost always was, since a\n * named source has to be asked for explicitly. The cost is bounded by the\n * five-minute TTL — for at most that long after a deploy, an in-flight token\n * for a *named* source is refused and the client re-fetches `/metadata`.\n */\nexport function verifyDownloadToken(token: string): DownloadTokenPayload | null {\n    if (!jwtConfig.secret) {\n        throw new Error(\"JWT secret not configured. Call configureJwt() first.\");\n    }\n\n    try {\n        const decoded = jwt.verify(token, jwtConfig.secret, { algorithms: [\"HS256\"] }) as Record<string, unknown> | undefined;\n        if (decoded && decoded.purpose === \"file-read\" && typeof decoded.path === \"string\") {\n            return {\n                purpose: \"file-read\",\n                path: decoded.path,\n                storageId: canonicalStorageId(\n                    typeof decoded.storageId === \"string\" ? decoded.storageId : null\n                )\n            };\n        }\n        return null;\n    } catch (error) {\n        logger.error(\"[JWT] Download token verification failed\", { error: error });\n        return null;\n    }\n}\n\n"],"x_google_ignoreList":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,6BAA6B;;;;;;;;;;;;;;;;;;;;;AA4F1C,SAAgB,iBAAiB,KAAa,aAAqB,4BAAoC;CACnG,IAAI,CAAC,OAAO,QAAQ,YAAY,OAAO;CACvC,MAAM,aAAa,IACd,QAAQ,kBAAkB,GAAG,CAAC,CAC9B,QAAQ,YAAY,EAAE,CAAC,CACvB,YAAY;CACjB,IAAI,CAAC,YACD,MAAM,IAAI,MACN,eAAe,IAAI,yGAEvB;CAEJ,OAAO,KAAK;AAChB;;;;;;;;;;;;AAaA,SAAgB,2BACZ,MACA,aAAqB,4BAC0B;CAC/C,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,OAAO,MAAM;EACpB,MAAM,SAAS,iBAAiB,KAAK,UAAU;EAC/C,MAAM,WAAW,KAAK,IAAI,MAAM;EAChC,IAAI,aAAa,KAAA,KAAa,aAAa,KACvC,OAAO;GAAE,GAAG;GAAU,GAAG;GAAK;EAAO;EAEzC,KAAK,IAAI,QAAQ,GAAG;CACxB;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;AAyBA,SAAgB,wBACZ,UACA,UACyB;CACzB,MAAM,yBAAS,IAAI,IAAqC;CAMxD,MAAM,kBACF,MAAM,QAAQ,QAAQ,IAChB,SAAS,QAAO,MAAK,GAAG,GAAG,CAAC,CAAC,KAAI,MAAK,CAAC,EAAE,KAAK,CAAC,CAAC,IAChD,OAAO,QAAQ,YAAY,CAAC,CAAC;CAEvC,KAAK,MAAM,CAAC,KAAK,WAAW,iBACxB,OAAO,IAAI,KAAK;EACZ;EACA,QAAQ,OAAO;EACf,WAAW,OAAO,aAAa;EAC/B,GAAI,OAAO,UAAU,KAAA,IAAY,EAAE,OAAO,OAAO,MAAM,IAAI,CAAC;CAChE,CAAC;CAGL,KAAK,MAAM,cAAc,YAAY,CAAC,GAAG;EACrC,IAAI,CAAC,YAAY,KAAK;EACtB,MAAM,WAAW,OAAO,IAAI,WAAW,GAAG;EAC1C,IAAI,CAAC,UAAU;GACX,OAAO,IAAI,WAAW,KAAK;IACvB,KAAK,WAAW;IAChB,QAAQ,WAAW;IACnB,WAAW,WAAW,aAAa;IACnC,GAAI,WAAW,UAAU,KAAA,IAAY,EAAE,OAAO,WAAW,MAAM,IAAI,CAAC;GACxE,CAAC;GACD;EACJ;EAEA,IAAI,SAAS,UAAU,KAAA,KAAa,WAAW,UAAU,KAAA,GACrD,SAAS,QAAQ,WAAW;CAEpC;CAEA,OAAO,MAAM,KAAK,OAAO,OAAO,CAAC;AACrC;;;;;CCzNA,IAAI,SAAA,UAAiB,QAAQ;CAC7B,IAAI,SAAS,OAAO;CAGpB,SAAS,UAAW,KAAK,KAAK;EAC5B,KAAK,IAAI,OAAO,KACd,IAAI,OAAO,IAAI;CAEnB;CACA,IAAI,OAAO,QAAQ,OAAO,SAAS,OAAO,eAAe,OAAO,iBAC9D,OAAO,UAAU;MACZ;EAEL,UAAU,QAAQ,OAAO;EACzB,QAAQ,SAAS;CACnB;CAEA,SAAS,WAAY,KAAK,kBAAkB,QAAQ;EAClD,OAAO,OAAO,KAAK,kBAAkB,MAAM;CAC7C;CAEA,WAAW,YAAY,OAAO,OAAO,OAAO,SAAS;CAGrD,UAAU,QAAQ,UAAU;CAE5B,WAAW,OAAO,SAAU,KAAK,kBAAkB,QAAQ;EACzD,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,UAAU,+BAA+B;EAErD,OAAO,OAAO,KAAK,kBAAkB,MAAM;CAC7C;CAEA,WAAW,QAAQ,SAAU,MAAM,MAAM,UAAU;EACjD,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU,2BAA2B;EAEjD,IAAI,MAAM,OAAO,IAAI;EACrB,IAAI,SAAS,KAAA,GACX,IAAI,OAAO,aAAa,UACtB,IAAI,KAAK,MAAM,QAAQ;OAEvB,IAAI,KAAK,IAAI;OAGf,IAAI,KAAK,CAAC;EAEZ,OAAO;CACT;CAEA,WAAW,cAAc,SAAU,MAAM;EACvC,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU,2BAA2B;EAEjD,OAAO,OAAO,IAAI;CACpB;CAEA,WAAW,kBAAkB,SAAU,MAAM;EAC3C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,UAAU,2BAA2B;EAEjD,OAAO,OAAO,WAAW,IAAI;CAC/B;;;;;CC/DA,IAAI,SAAA,oBAAA,CAAA,CAAgC;CACpC,IAAIA,WAAAA,UAAiB,QAAQ;CAC7B,IAAIC,SAAAA,UAAe,MAAM;CAEzB,SAAS,WAAW,MAAM;EACxB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,WAAW;EAGhB,IAAI,CAAC,MAAM;GACT,KAAK,SAAS,OAAO,MAAM,CAAC;GAC5B,OAAO;EACT;EAGA,IAAI,OAAO,KAAK,SAAS,YAAY;GACnC,KAAK,SAAS,OAAO,MAAM,CAAC;GAC5B,KAAK,KAAK,IAAI;GACd,OAAO;EACT;EAIA,IAAI,KAAK,UAAU,OAAO,SAAS,UAAU;GAC3C,KAAK,SAAS;GACd,KAAK,WAAW;GAChB,QAAQ,SAAS,WAAY;IAC3B,KAAK,KAAK,OAAO,IAAI;IACrB,KAAK,WAAW;IAChB,KAAK,KAAK,OAAO;GACnB,EAAE,KAAK,IAAI,CAAC;GACZ,OAAO;EACT;EAEA,MAAM,IAAI,UAAU,2BAA0B,OAAO,OAAO,GAAG;CACjE;CACA,OAAK,SAAS,YAAYD,QAAM;CAEhC,WAAW,UAAU,QAAQ,SAAS,MAAM,MAAM;EAChD,KAAK,SAAS,OAAO,OAAO,CAAC,KAAK,QAAQ,OAAO,KAAK,IAAI,CAAC,CAAC;EAC5D,KAAK,KAAK,QAAQ,IAAI;CACxB;CAEA,WAAW,UAAU,MAAM,SAAS,IAAI,MAAM;EAC5C,IAAI,MACF,KAAK,MAAM,IAAI;EACjB,KAAK,KAAK,OAAO,IAAI;EACrB,KAAK,KAAK,OAAO;EACjB,KAAK,WAAW;EAChB,KAAK,WAAW;CAClB;CAEA,OAAO,UAAU;;;;;CCpDjB,SAAS,aAAa,SAAS;EAE9B,QADe,UAAU,IAAK,MAAM,UAAU,MAAM,IAAI,IAAI;CAE7D;CAEA,IAAI,mBAAmB;EACtB,OAAO,aAAa,GAAG;EACvB,OAAO,aAAa,GAAG;EACvB,OAAO,aAAa,GAAG;CACxB;CAEA,SAAS,oBAAoB,KAAK;EACjC,IAAI,aAAa,iBAAiB;EAClC,IAAI,YACH,OAAO;EAGR,MAAM,IAAI,MAAM,yBAAwB,MAAM,IAAG;CAClD;CAEA,OAAO,UAAU;;;;;CCpBjB,IAAI,SAAA,oBAAA,CAAA,CAAgC;CAEpC,IAAI,sBAAA,4BAAA;CAEJ,IAAI,YAAY;KACf,kBAAkB;KAClB,gBAAgB;KAChB,UAAU;KACV,UAAU;KACV,kBAAmB,UAAU,gBAAkB,mBAAmB;KAClE,kBAAkB,UAAW,mBAAmB;CAEjD,SAAS,UAAU,QAAQ;EAC1B,OAAO,OACL,QAAQ,MAAM,EAAE,CAAC,CACjB,QAAQ,OAAO,GAAG,CAAC,CACnB,QAAQ,OAAO,GAAG;CACrB;CAEA,SAAS,kBAAkB,WAAW;EACrC,IAAI,OAAO,SAAS,SAAS,GAC5B,OAAO;OACD,IAAI,aAAa,OAAO,WAC9B,OAAO,OAAO,KAAK,WAAW,QAAQ;EAGvC,MAAM,IAAI,UAAU,qDAAqD;CAC1E;CAEA,SAAS,UAAU,WAAW,KAAK;EAClC,YAAY,kBAAkB,SAAS;EACvC,IAAI,aAAa,oBAAoB,GAAG;EAIxC,IAAI,wBAAwB,aAAa;EAEzC,IAAI,cAAc,UAAU;EAE5B,IAAI,SAAS;EACb,IAAI,UAAU,cAAc,iBAC3B,MAAM,IAAI,MAAM,iCAA+B;EAGhD,IAAI,YAAY,UAAU;EAC1B,IAAI,eAAe,YAAY,IAC9B,YAAY,UAAU;EAGvB,IAAI,cAAc,SAAS,WAC1B,MAAM,IAAI,MAAM,mCAAgC,YAAY,iBAAe,cAAc,UAAU,cAAa;EAGjH,IAAI,UAAU,cAAc,iBAC3B,MAAM,IAAI,MAAM,2CAAuC;EAGxD,IAAI,UAAU,UAAU;EAExB,IAAI,cAAc,SAAS,IAAI,SAC9B,MAAM,IAAI,MAAM,iCAA8B,UAAU,iBAAe,cAAc,SAAS,KAAK,cAAa;EAGjH,IAAI,wBAAwB,SAC3B,MAAM,IAAI,MAAM,iCAA8B,UAAU,kBAAgB,wBAAwB,kBAAiB;EAGlH,IAAI,UAAU;EACd,UAAU;EAEV,IAAI,UAAU,cAAc,iBAC3B,MAAM,IAAI,MAAM,2CAAuC;EAGxD,IAAI,UAAU,UAAU;EAExB,IAAI,cAAc,WAAW,SAC5B,MAAM,IAAI,MAAM,iCAA8B,UAAU,qBAAmB,cAAc,UAAU,IAAG;EAGvG,IAAI,wBAAwB,SAC3B,MAAM,IAAI,MAAM,iCAA8B,UAAU,kBAAgB,wBAAwB,kBAAiB;EAGlH,IAAI,UAAU;EACd,UAAU;EAEV,IAAI,WAAW,aACd,MAAM,IAAI,MAAM,+CAA8C,cAAc,UAAU,iBAAgB;EAGvG,IAAI,WAAW,aAAa,SAC3B,WAAW,aAAa;EAEzB,IAAI,MAAM,OAAO,YAAY,WAAW,UAAU,WAAW,OAAO;EAEpE,KAAK,SAAS,GAAG,SAAS,UAAU,EAAE,QACrC,IAAI,UAAU;EAEf,UAAU,KAAK,KAAK,QAAQ,UAAU,KAAK,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU,OAAO;EAE/E,SAAS;EAET,KAAK,IAAI,IAAI,QAAQ,SAAS,IAAI,UAAU,EAAE,QAC7C,IAAI,UAAU;EAEf,UAAU,KAAK,KAAK,QAAQ,UAAU,KAAK,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU,OAAO;EAE/E,MAAM,IAAI,SAAS,QAAQ;EAC3B,MAAM,UAAU,GAAG;EAEnB,OAAO;CACR;CAEA,SAAS,aAAa,KAAK,OAAO,MAAM;EACvC,IAAI,UAAU;EACd,OAAO,QAAQ,UAAU,QAAQ,IAAI,QAAQ,aAAa,GACzD,EAAE;EAIH,IADgB,IAAI,QAAQ,YAAY,WAEvC,EAAE;EAGH,OAAO;CACR;CAEA,SAAS,UAAU,WAAW,KAAK;EAClC,YAAY,kBAAkB,SAAS;EACvC,IAAI,aAAa,oBAAoB,GAAG;EAExC,IAAI,iBAAiB,UAAU;EAC/B,IAAI,mBAAmB,aAAa,GACnC,MAAM,IAAI,UAAU,OAAM,MAAM,6BAA2B,aAAa,IAAI,qBAAmB,iBAAiB,IAAG;EAGpH,IAAI,WAAW,aAAa,WAAW,GAAG,UAAU;EACpD,IAAI,WAAW,aAAa,WAAW,YAAY,UAAU,MAAM;EACnE,IAAI,UAAU,aAAa;EAC3B,IAAI,UAAU,aAAa;EAE3B,IAAI,UAAU,IAAQ,UAAU,IAAI,IAAI;EAExC,IAAI,cAAc,UAAU;EAE5B,IAAI,MAAM,OAAO,aAAa,cAAc,IAAI,KAAK,OAAO;EAE5D,IAAI,SAAS;EACb,IAAI,YAAY;EAChB,IAAI,aAGH,IAAI,YAAY;OACV;GAGN,IAAI,YAAY,YAAY;GAE5B,IAAI,YAAY,UAAU;EAC3B;EACA,IAAI,YAAY;EAChB,IAAI,YAAY;EAChB,IAAI,WAAW,GAAG;GACjB,IAAI,YAAY;GAChB,UAAU,UAAU,KAAK,KAAK,QAAQ,GAAG,UAAU;EACpD,OACC,UAAU,UAAU,KAAK,KAAK,QAAQ,UAAU,UAAU;EAE3D,IAAI,YAAY;EAChB,IAAI,YAAY;EAChB,IAAI,WAAW,GAAG;GACjB,IAAI,YAAY;GAChB,UAAU,KAAK,KAAK,QAAQ,UAAU;EACvC,OACC,UAAU,KAAK,KAAK,QAAQ,aAAa,QAAQ;EAGlD,OAAO;CACR;CAEA,OAAO,UAAU;EACL;EACA;CACZ;;;;;CCxLA,IAAIE,WAAAA,UAAiB,QAAQ,CAAC,CAAC;CAC/B,IAAI,aAAA,UAAqB,QAAQ,CAAC,CAAC;CAEnC,OAAO,UAAU;CAEjB,SAAS,SAAS,GAAG,GAAG;EAGtB,IAAI,CAACA,SAAO,SAAS,CAAC,KAAK,CAACA,SAAO,SAAS,CAAC,GAC3C,OAAO;EAMT,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO;EAGT,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAE5B,KAAK,EAAE,KAAK,EAAE;EAEhB,OAAO,MAAM;CACf;CAEA,SAAS,UAAU,WAAW;EAC5B,SAAO,UAAU,QAAQ,WAAW,UAAU,QAAQ,SAAS,MAAM,MAAM;GACzE,OAAO,SAAS,MAAM,IAAI;EAC5B;CACF;CAEA,IAAI,eAAeA,SAAO,UAAU;CACpC,IAAI,mBAAmB,WAAW,UAAU;CAC5C,SAAS,UAAU,WAAW;EAC5B,SAAO,UAAU,QAAQ;EACzB,WAAW,UAAU,QAAQ;CAC/B;;;;;CCxCA,IAAI,SAAA,oBAAA,CAAA,CAAgC;CACpC,IAAI,SAAA,UAAiB,QAAQ;CAC7B,IAAI,cAAA,4BAAA;CACJ,IAAIC,SAAAA,UAAe,MAAM;CAEzB,IAAI,wBAAwB;CAC5B,IAAI,qBAAqB;CACzB,IAAI,2BAA2B;CAC/B,IAAI,yBAAyB;CAE7B,IAAI,qBAAqB,OAAO,OAAO,oBAAoB;CAC3D,IAAI,oBAAoB;EACtB,4BAA4B;EAC5B,sBAAsB;CACxB;CAEA,SAAS,iBAAiB,KAAK;EAC7B,IAAI,OAAO,SAAS,GAAG,GACrB;EAGF,IAAI,OAAO,QAAQ,UACjB;EAGF,IAAI,CAAC,oBACH,MAAM,UAAU,wBAAwB;EAG1C,IAAI,OAAO,QAAQ,UACjB,MAAM,UAAU,wBAAwB;EAG1C,IAAI,OAAO,IAAI,SAAS,UACtB,MAAM,UAAU,wBAAwB;EAG1C,IAAI,OAAO,IAAI,sBAAsB,UACnC,MAAM,UAAU,wBAAwB;EAG1C,IAAI,OAAO,IAAI,WAAW,YACxB,MAAM,UAAU,wBAAwB;CAE5C;CAEA,SAAS,kBAAkB,KAAK;EAC9B,IAAI,OAAO,SAAS,GAAG,GACrB;EAGF,IAAI,OAAO,QAAQ,UACjB;EAGF,IAAI,OAAO,QAAQ,UACjB;EAGF,MAAM,UAAU,sBAAsB;CACxC;CAEA,SAAS,iBAAiB,KAAK;EAC7B,IAAI,OAAO,SAAS,GAAG,GACrB;EAGF,IAAI,OAAO,QAAQ,UACjB,OAAO;EAGT,IAAI,CAAC,oBACH,MAAM,UAAU,kBAAkB;EAGpC,IAAI,OAAO,QAAQ,UACjB,MAAM,UAAU,kBAAkB;EAGpC,IAAI,IAAI,SAAS,UACf,MAAM,UAAU,kBAAkB;EAGpC,IAAI,OAAO,IAAI,WAAW,YACxB,MAAM,UAAU,kBAAkB;CAEtC;CAEA,SAAS,WAAW,QAAQ;EAC1B,OAAO,OACJ,QAAQ,MAAM,EAAE,CAAC,CACjB,QAAQ,OAAO,GAAG,CAAC,CACnB,QAAQ,OAAO,GAAG;CACvB;CAEA,SAAS,SAAS,WAAW;EAC3B,YAAY,UAAU,SAAS;EAE/B,IAAI,UAAU,IAAI,UAAU,SAAS;EACrC,IAAI,YAAY,GACd,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,EAAE,GAC7B,aAAa;EAIjB,OAAO,UACJ,QAAQ,OAAO,GAAG,CAAC,CACnB,QAAQ,MAAM,GAAG;CACtB;CAEA,SAAS,UAAU,UAAU;EAC3B,IAAI,OAAO,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC;EACrC,IAAI,SAASA,OAAK,OAAO,KAAKA,QAAM,QAAQ,CAAC,CAAC,MAAM,MAAM,IAAI;EAC9D,OAAO,IAAI,UAAU,MAAM;CAC7B;CAEA,SAAS,eAAe,KAAK;EAC3B,OAAO,OAAO,SAAS,GAAG,KAAK,OAAO,QAAQ;CAChD;CAEA,SAAS,eAAe,OAAO;EAC7B,IAAI,CAAC,eAAe,KAAK,GACvB,QAAQ,KAAK,UAAU,KAAK;EAC9B,OAAO;CACT;CAEA,SAAS,iBAAiB,MAAM;EAC9B,OAAO,SAAS,KAAK,OAAO,QAAQ;GAClC,iBAAiB,MAAM;GACvB,QAAQ,eAAe,KAAK;GAC5B,IAAI,OAAO,OAAO,WAAW,QAAQ,MAAM,MAAM;GAEjD,OAAO,YADI,KAAK,OAAO,KAAK,GAAG,KAAK,OAAO,QAAQ,EAC9B;EACvB;CACF;CAEA,IAAI;CACJ,IAAI,kBAAkB,qBAAqB,SAAS,SAAS,gBAAgB,GAAG,GAAG;EACjF,IAAI,EAAE,eAAe,EAAE,YACrB,OAAO;EAGT,OAAO,OAAO,gBAAgB,GAAG,CAAC;CACpC,IAAI,SAAS,gBAAgB,GAAG,GAAG;EACjC,IAAI,CAAC,aACH,cAAA,mCAAA;EAGF,OAAO,YAAY,GAAG,CAAC;CACzB;CAEA,SAAS,mBAAmB,MAAM;EAChC,OAAO,SAAS,OAAO,OAAO,WAAW,QAAQ;GAC/C,IAAI,cAAc,iBAAiB,IAAI,CAAC,CAAC,OAAO,MAAM;GACtD,OAAO,gBAAgB,OAAO,KAAK,SAAS,GAAG,OAAO,KAAK,WAAW,CAAC;EACzE;CACF;CAEA,SAAS,gBAAgB,MAAM;EAC9B,OAAO,SAAS,KAAK,OAAO,YAAY;GACrC,kBAAkB,UAAU;GAC5B,QAAQ,eAAe,KAAK;GAG5B,IAAI,SAAS,OAAO,WAAW,YAAY,IAAI;GAE/C,OAAO,YADI,OAAO,OAAO,KAAK,GAAG,OAAO,KAAK,YAAY,QAAQ,EAC5C;EACvB;CACF;CAEA,SAAS,kBAAkB,MAAM;EAC/B,OAAO,SAAS,OAAO,OAAO,WAAW,WAAW;GAClD,iBAAiB,SAAS;GAC1B,QAAQ,eAAe,KAAK;GAC5B,YAAY,SAAS,SAAS;GAC9B,IAAI,WAAW,OAAO,aAAa,YAAY,IAAI;GACnD,SAAS,OAAO,KAAK;GACrB,OAAO,SAAS,OAAO,WAAW,WAAW,QAAQ;EACvD;CACF;CAEA,SAAS,mBAAmB,MAAM;EAChC,OAAO,SAAS,KAAK,OAAO,YAAY;GACtC,kBAAkB,UAAU;GAC5B,QAAQ,eAAe,KAAK;GAC5B,IAAI,SAAS,OAAO,WAAW,YAAY,IAAI;GAM/C,OAAO,YALI,OAAO,OAAO,KAAK,GAAG,OAAO,KAAK;IAC3C,KAAK;IACL,SAAS,OAAO,UAAU;IAC1B,YAAY,OAAO,UAAU;GAC/B,GAAG,QAAQ,EACU;EACvB;CACF;CAEA,SAAS,qBAAqB,MAAM;EAClC,OAAO,SAAS,OAAO,OAAO,WAAW,WAAW;GAClD,iBAAiB,SAAS;GAC1B,QAAQ,eAAe,KAAK;GAC5B,YAAY,SAAS,SAAS;GAC9B,IAAI,WAAW,OAAO,aAAa,YAAY,IAAI;GACnD,SAAS,OAAO,KAAK;GACrB,OAAO,SAAS,OAAO;IACrB,KAAK;IACL,SAAS,OAAO,UAAU;IAC1B,YAAY,OAAO,UAAU;GAC/B,GAAG,WAAW,QAAQ;EACxB;CACF;CAEA,SAAS,kBAAkB,MAAM;EAC/B,IAAI,QAAQ,gBAAgB,IAAI;EAChC,OAAO,SAAS,OAAO;GACrB,IAAI,YAAY,MAAM,MAAM,MAAM,SAAS;GAC3C,YAAY,YAAY,UAAU,WAAW,OAAO,IAAI;GACxD,OAAO;EACT;CACF;CAEA,SAAS,mBAAmB,MAAM;EAChC,IAAI,QAAQ,kBAAkB,IAAI;EAClC,OAAO,SAAS,OAAO,OAAO,WAAW,WAAW;GAClD,YAAY,YAAY,UAAU,WAAW,OAAO,IAAI,CAAC,CAAC,SAAS,QAAQ;GAE3E,OADa,MAAM,OAAO,WAAW,SACzB;EACd;CACF;CAEA,SAAS,mBAAmB;EAC1B,OAAO,SAAS,OAAO;GACrB,OAAO;EACT;CACF;CAEA,SAAS,qBAAqB;EAC5B,OAAO,SAAS,OAAO,OAAO,WAAW;GACvC,OAAO,cAAc;EACvB;CACF;CAEA,OAAO,UAAU,SAAS,IAAI,WAAW;EACvC,IAAI,kBAAkB;GACpB,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,MAAM;EACR;EACA,IAAI,oBAAoB;GACtB,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,MAAM;EACR;EACA,IAAI,QAAQ,UAAU,MAAM,uCAAuC;EACnE,IAAI,CAAC,OACH,MAAM,UAAU,uBAAuB,SAAS;EAClD,IAAI,QAAQ,MAAM,MAAM,MAAM,GAAA,CAAI,YAAY;EAC9C,IAAI,OAAO,MAAM;EAEjB,OAAO;GACL,MAAM,gBAAgB,KAAK,CAAC,IAAI;GAChC,QAAQ,kBAAkB,KAAK,CAAC,IAAI;EACtC;CACF;;;;;CCxQA,IAAIC,WAAAA,UAAiB,QAAQ,CAAC,CAAC;CAE/B,OAAO,UAAU,SAAS,SAAS,KAAK;EACtC,IAAI,OAAO,QAAQ,UACjB,OAAO;EACT,IAAI,OAAO,QAAQ,YAAYA,SAAO,SAAS,GAAG,GAChD,OAAO,IAAI,SAAS;EACtB,OAAO,KAAK,UAAU,GAAG;CAC3B;;;;;CCRA,IAAI,SAAA,oBAAA,CAAA,CAAgC;CACpC,IAAI,aAAA,oBAAA;CACJ,IAAI,MAAA,YAAA;CACJ,IAAIC,WAAAA,UAAiB,QAAQ;CAC7B,IAAI,WAAA,iBAAA;CACJ,IAAIC,SAAAA,UAAe,MAAM;CAEzB,SAAS,UAAU,QAAQ,UAAU;EACnC,OAAO,OACJ,KAAK,QAAQ,QAAQ,CAAC,CACtB,SAAS,QAAQ,CAAC,CAClB,QAAQ,MAAM,EAAE,CAAC,CACjB,QAAQ,OAAO,GAAG,CAAC,CACnB,QAAQ,OAAO,GAAG;CACvB;CAEA,SAAS,gBAAgB,QAAQ,SAAS,UAAU;EAClD,WAAW,YAAY;EACvB,IAAI,gBAAgB,UAAU,SAAS,MAAM,GAAG,QAAQ;EACxD,IAAI,iBAAiB,UAAU,SAAS,OAAO,GAAG,QAAQ;EAC1D,OAAOA,OAAK,OAAO,SAAS,eAAe,cAAc;CAC3D;CAEA,SAAS,QAAQ,MAAM;EACrB,IAAI,SAAS,KAAK;EAClB,IAAI,UAAU,KAAK;EACnB,IAAI,cAAc,KAAK,UAAU,KAAK;EACtC,IAAI,WAAW,KAAK;EACpB,IAAI,OAAO,IAAI,OAAO,GAAG;EACzB,IAAI,eAAe,gBAAgB,QAAQ,SAAS,QAAQ;EAC5D,IAAI,YAAY,KAAK,KAAK,cAAc,WAAW;EACnD,OAAOA,OAAK,OAAO,SAAS,cAAc,SAAS;CACrD;CAEA,SAAS,WAAW,MAAM;EACxB,IAAI,SAAS,KAAK;EAClB,SAAS,UAAU,OAAO,KAAK,aAAa;EAC5C,SAAS,UAAU,OAAO,KAAK,MAAM;EACrC,IAAI,OAAO,KAAK,KAAK,OAAO,GAAG,MAAM,QAAQ,UAAU,MACrD,MAAM,IAAI,UAAU,kDAAkD;EAExE,IAAI,eAAe,IAAI,WAAW,MAAM;EACxC,KAAK,WAAW;EAChB,KAAK,SAAS,KAAK;EACnB,KAAK,WAAW,KAAK;EACrB,KAAK,SAAS,KAAK,aAAa,KAAK,MAAM;EAC3C,KAAK,UAAU,IAAI,WAAW,KAAK,OAAO;EAC1C,KAAK,OAAO,KAAK,SAAS,WAAY;GACpC,IAAI,CAAC,KAAK,QAAQ,YAAY,KAAK,UACjC,KAAK,KAAK;EACd,EAAE,KAAK,IAAI,CAAC;EAEZ,KAAK,QAAQ,KAAK,SAAS,WAAY;GACrC,IAAI,CAAC,KAAK,OAAO,YAAY,KAAK,UAChC,KAAK,KAAK;EACd,EAAE,KAAK,IAAI,CAAC;CACd;CACA,OAAK,SAAS,YAAYD,QAAM;CAEhC,WAAW,UAAU,OAAO,SAAS,OAAO;EAC1C,IAAI;GACF,IAAI,YAAY,QAAQ;IACtB,QAAQ,KAAK;IACb,SAAS,KAAK,QAAQ;IACtB,QAAQ,KAAK,OAAO;IACpB,UAAU,KAAK;GACjB,CAAC;GACD,KAAK,KAAK,QAAQ,SAAS;GAC3B,KAAK,KAAK,QAAQ,SAAS;GAC3B,KAAK,KAAK,KAAK;GACf,KAAK,WAAW;GAChB,OAAO;EACT,SAAS,GAAG;GACV,KAAK,WAAW;GAChB,KAAK,KAAK,SAAS,CAAC;GACpB,KAAK,KAAK,OAAO;EACnB;CACF;CAEA,WAAW,OAAO;CAElB,OAAO,UAAU;;;;;CCjFjB,IAAI,SAAA,oBAAA,CAAA,CAAgC;CACpC,IAAI,aAAA,oBAAA;CACJ,IAAI,MAAA,YAAA;CACJ,IAAI,SAAA,UAAiB,QAAQ;CAC7B,IAAI,WAAA,iBAAA;CACJ,IAAI,OAAA,UAAe,MAAM;CACzB,IAAI,YAAY;CAEhB,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM;CACnD;CAEA,SAAS,cAAc,OAAO;EAC5B,IAAI,SAAS,KAAK,GAChB,OAAO;EACT,IAAI;GAAE,OAAO,KAAK,MAAM,KAAK;EAAG,SACzB,GAAG;GAAE;EAAkB;CAChC;CAEA,SAAS,cAAc,QAAQ;EAC7B,IAAI,gBAAgB,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC;EACzC,OAAO,cAAc,OAAO,KAAK,eAAe,QAAQ,CAAC,CAAC,SAAS,QAAQ,CAAC;CAC9E;CAEA,SAAS,oBAAoB,QAAQ;EACnC,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;CACtC;CAEA,SAAS,iBAAiB,QAAQ;EAChC,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC;CAC3B;CAEA,SAAS,eAAe,QAAQ,UAAU;EACxC,WAAW,YAAY;EACvB,IAAI,UAAU,OAAO,MAAM,GAAG,CAAC,CAAC;EAChC,OAAO,OAAO,KAAK,SAAS,QAAQ,CAAC,CAAC,SAAS,QAAQ;CACzD;CAEA,SAAS,WAAW,QAAQ;EAC1B,OAAO,UAAU,KAAK,MAAM,KAAK,CAAC,CAAC,cAAc,MAAM;CACzD;CAEA,SAAS,UAAU,QAAQ,WAAW,aAAa;EACjD,IAAI,CAAC,WAAW;GACd,IAAI,sBAAM,IAAI,MAAM,4CAA4C;GAChE,IAAI,OAAO;GACX,MAAM;EACR;EACA,SAAS,SAAS,MAAM;EACxB,IAAI,YAAY,iBAAiB,MAAM;EACvC,IAAI,eAAe,oBAAoB,MAAM;EAE7C,OADW,IAAI,SACL,CAAC,CAAC,OAAO,cAAc,WAAW,WAAW;CACzD;CAEA,SAAS,UAAU,QAAQ,MAAM;EAC/B,OAAO,QAAQ,CAAC;EAChB,SAAS,SAAS,MAAM;EAExB,IAAI,CAAC,WAAW,MAAM,GACpB,OAAO;EAET,IAAI,SAAS,cAAc,MAAM;EAEjC,IAAI,CAAC,QACH,OAAO;EAET,IAAI,UAAU,eAAe,MAAM;EACnC,IAAI,OAAO,QAAQ,SAAS,KAAK,MAC/B,UAAU,KAAK,MAAM,SAAS,KAAK,QAAQ;EAE7C,OAAO;GACG;GACC;GACT,WAAW,iBAAiB,MAAM;EACpC;CACF;CAEA,SAAS,aAAa,MAAM;EAC1B,OAAO,QAAQ,CAAC;EAChB,IAAI,cAAc,KAAK;EACvB,cAAc,eAAe,OAAO,KAAK,YAAY;EACrD,cAAc,eAAe,OAAO,KAAK,MAAM;EAC/C,IAAI,OAAO,KAAK,KAAK,SAAS,MAAM,QAAQ,eAAe,MACzD,MAAM,IAAI,UAAU,kDAAkD;EAExE,IAAI,eAAe,IAAI,WAAW,WAAW;EAC7C,KAAK,WAAW;EAChB,KAAK,YAAY,KAAK;EACtB,KAAK,WAAW,KAAK;EACrB,KAAK,SAAS,KAAK,YAAY,KAAK,MAAM;EAC1C,KAAK,YAAY,IAAI,WAAW,KAAK,SAAS;EAC9C,KAAK,OAAO,KAAK,SAAS,WAAY;GACpC,IAAI,CAAC,KAAK,UAAU,YAAY,KAAK,UACnC,KAAK,OAAO;EAChB,EAAE,KAAK,IAAI,CAAC;EAEZ,KAAK,UAAU,KAAK,SAAS,WAAY;GACvC,IAAI,CAAC,KAAK,OAAO,YAAY,KAAK,UAChC,KAAK,OAAO;EAChB,EAAE,KAAK,IAAI,CAAC;CACd;CACA,KAAK,SAAS,cAAc,MAAM;CAClC,aAAa,UAAU,SAAS,SAAS,SAAS;EAChD,IAAI;GACF,IAAI,QAAQ,UAAU,KAAK,UAAU,QAAQ,KAAK,WAAW,KAAK,IAAI,MAAM;GAC5E,IAAI,MAAM,UAAU,KAAK,UAAU,QAAQ,KAAK,QAAQ;GACxD,KAAK,KAAK,QAAQ,OAAO,GAAG;GAC5B,KAAK,KAAK,QAAQ,KAAK;GACvB,KAAK,KAAK,KAAK;GACf,KAAK,WAAW;GAChB,OAAO;EACT,SAAS,GAAG;GACV,KAAK,WAAW;GAChB,KAAK,KAAK,SAAS,CAAC;GACpB,KAAK,KAAK,OAAO;EACnB;CACF;CAEA,aAAa,SAAS;CACtB,aAAa,UAAU;CACvB,aAAa,SAAS;CAEtB,OAAO,UAAU;;;;;CC3HjB,IAAI,aAAA,oBAAA;CACJ,IAAI,eAAA,sBAAA;CASJ,QAAQ,aAAa;EANnB;EAAS;EAAS;EAClB;EAAS;EAAS;EAClB;EAAS;EAAS;EAClB;EAAS;EAAS;CAGC;CACrB,QAAQ,OAAO,WAAW;CAC1B,QAAQ,SAAS,aAAa;CAC9B,QAAQ,SAAS,aAAa;CAC9B,QAAQ,UAAU,aAAa;CAC/B,QAAQ,aAAa,SAAS,WAAW,MAAM;EAC7C,OAAO,IAAI,WAAW,IAAI;CAC5B;CACA,QAAQ,eAAe,SAAS,aAAa,MAAM;EACjD,OAAO,IAAI,aAAa,IAAI;CAC9B;;;;;CCrBA,IAAI,MAAA,YAAA;CAEJ,OAAO,UAAU,SAAU,KAAK,SAAS;EACvC,UAAU,WAAW,CAAC;EACtB,IAAI,UAAU,IAAI,OAAO,KAAK,OAAO;EACrC,IAAI,CAAC,SAAW,OAAO;EACvB,IAAI,UAAU,QAAQ;EAGtB,IAAG,OAAO,YAAY,UACpB,IAAI;GACF,IAAI,MAAM,KAAK,MAAM,OAAO;GAC5B,IAAG,QAAQ,QAAQ,OAAO,QAAQ,UAChC,UAAU;EAEd,SAAS,GAAG,CAAE;EAMhB,IAAI,QAAQ,aAAa,MACvB,OAAO;GACL,QAAQ,QAAQ;GACP;GACT,WAAW,QAAQ;EACrB;EAEF,OAAO;CACT;;;;;CC7BA,IAAI,oBAAoB,SAAU,SAAS,OAAO;EAChD,MAAM,KAAK,MAAM,OAAO;EACxB,IAAG,MAAM,mBACP,MAAM,kBAAkB,MAAM,KAAK,WAAW;EAEhD,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,IAAI,OAAO,KAAK,QAAQ;CAC1B;CAEA,kBAAkB,YAAY,OAAO,OAAO,MAAM,SAAS;CAC3D,kBAAkB,UAAU,cAAc;CAE1C,OAAO,UAAU;;;;;CCbjB,IAAI,oBAAA,0BAAA;CAEJ,IAAI,iBAAiB,SAAU,SAAS,MAAM;EAC5C,kBAAkB,KAAK,MAAM,OAAO;EACpC,KAAK,OAAO;EACZ,KAAK,OAAO;CACd;CAEA,eAAe,YAAY,OAAO,OAAO,kBAAkB,SAAS;CAEpE,eAAe,UAAU,cAAc;CAEvC,OAAO,UAAU;;;;;CCZjB,IAAI,oBAAA,0BAAA;CAEJ,IAAI,oBAAoB,SAAU,SAAS,WAAW;EACpD,kBAAkB,KAAK,MAAM,OAAO;EACpC,KAAK,OAAO;EACZ,KAAK,YAAY;CACnB;CAEA,kBAAkB,YAAY,OAAO,OAAO,kBAAkB,SAAS;CAEvE,kBAAkB,UAAU,cAAc;CAE1C,OAAO,UAAU;;;;;;;;CCRjB,IAAI,IAAI;CACR,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,IAAI;;;;;;;;;;;;;;CAgBZ,OAAO,UAAU,SAAU,KAAK,SAAS;EACvC,UAAU,WAAW,CAAC;EACtB,IAAI,OAAO,OAAO;EAClB,IAAI,SAAS,YAAY,IAAI,SAAS,GACpC,OAAO,MAAM,GAAG;OACX,IAAI,SAAS,YAAY,SAAS,GAAG,GAC1C,OAAO,QAAQ,OAAO,QAAQ,GAAG,IAAI,SAAS,GAAG;EAEnD,MAAM,IAAI,MACR,0DACE,KAAK,UAAU,GAAG,CACtB;CACF;;;;;;;;CAUA,SAAS,MAAM,KAAK;EAClB,MAAM,OAAO,GAAG;EAChB,IAAI,IAAI,SAAS,KACf;EAEF,IAAI,QAAQ,mIAAmI,KAC7I,GACF;EACA,IAAI,CAAC,OACH;EAEF,IAAI,IAAI,WAAW,MAAM,EAAE;EAE3B,SADY,MAAM,MAAM,KAAA,CAAM,YACnB,GAAX;GACE,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,KACH,OAAO,IAAI;GACb,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,MACH,OAAO;GACT,SACE;EACJ;CACF;;;;;;;;CAUA,SAAS,SAAS,IAAI;EACpB,IAAI,QAAQ,KAAK,IAAI,EAAE;EACvB,IAAI,SAAS,GACX,OAAO,KAAK,MAAM,KAAK,CAAC,IAAI;EAE9B,IAAI,SAAS,GACX,OAAO,KAAK,MAAM,KAAK,CAAC,IAAI;EAE9B,IAAI,SAAS,GACX,OAAO,KAAK,MAAM,KAAK,CAAC,IAAI;EAE9B,IAAI,SAAS,GACX,OAAO,KAAK,MAAM,KAAK,CAAC,IAAI;EAE9B,OAAO,KAAK;CACd;;;;;;;;CAUA,SAAS,QAAQ,IAAI;EACnB,IAAI,QAAQ,KAAK,IAAI,EAAE;EACvB,IAAI,SAAS,GACX,OAAO,OAAO,IAAI,OAAO,GAAG,KAAK;EAEnC,IAAI,SAAS,GACX,OAAO,OAAO,IAAI,OAAO,GAAG,MAAM;EAEpC,IAAI,SAAS,GACX,OAAO,OAAO,IAAI,OAAO,GAAG,QAAQ;EAEtC,IAAI,SAAS,GACX,OAAO,OAAO,IAAI,OAAO,GAAG,QAAQ;EAEtC,OAAO,KAAK;CACd;;;;CAMA,SAAS,OAAO,IAAI,OAAO,GAAG,MAAM;EAClC,IAAI,WAAW,SAAS,IAAI;EAC5B,OAAO,KAAK,MAAM,KAAK,CAAC,IAAI,MAAM,QAAQ,WAAW,MAAM;CAC7D;;;;;CCjKA,IAAI,KAAA,WAAA;CAEJ,OAAO,UAAU,SAAU,MAAM,KAAK;EACpC,IAAI,YAAY,OAAO,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;EAEnD,IAAI,OAAO,SAAS,UAAU;GAC5B,IAAI,eAAe,GAAG,IAAI;GAC1B,IAAI,OAAO,iBAAiB,aAC1B;GAEF,OAAO,KAAK,MAAM,YAAY,eAAe,GAAI;EACnD,OAAO,IAAI,OAAO,SAAS,UACzB,OAAO,YAAY;OAEnB;CAGJ;;;;;CCbA,IAAM,sBAAsB;CAE5B,IAAM,aAAa;CACnB,IAAM,mBAAmB,OAAO,oBACL;CAmB3B,OAAO,UAAU;EACf;EACA;EACA,uBAf4B,aAAa;EAgBzC;EACA;GAdA;GACA;GACA;GACA;GACA;GACA;GACA;EAQA;EACA;EACA,yBAAyB;EACzB,YAAY;CACd;;;;;CC1BA,OAAO,UAPL,OAAO,YAAY,YACnB,QAAQ,OACR,QAAQ,IAAI,cACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,KACtC,GAAG,SAAS,QAAQ,MAAM,UAAU,GAAG,IAAI,UACtC,CAAC;;;;;CCNX,IAAM,EACJ,2BACA,uBACA,eAAA,kBAAA;CAEF,IAAM,QAAA,cAAA;CACN,UAAU,OAAO,UAAU,CAAC;CAG5B,IAAM,KAAK,QAAQ,KAAK,CAAC;CACzB,IAAM,SAAS,QAAQ,SAAS,CAAC;CACjC,IAAM,MAAM,QAAQ,MAAM,CAAC;CAC3B,IAAM,UAAU,QAAQ,UAAU,CAAC;CACnC,IAAM,IAAI,QAAQ,IAAI,CAAC;CACvB,IAAI,IAAI;CAER,IAAM,mBAAmB;CAQzB,IAAM,wBAAwB;EAC5B,CAAC,OAAO,CAAC;EACT,CAAC,OAAO,UAAU;EAClB,CAAC,kBAAkB,qBAAqB;CAC1C;CAEA,IAAM,iBAAiB,UAAU;EAC/B,KAAK,MAAM,CAAC,OAAO,QAAQ,uBACzB,QAAQ,MACL,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAC7C,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE;EAEjD,OAAO;CACT;CAEA,IAAM,eAAe,MAAM,OAAO,aAAa;EAC7C,MAAM,OAAO,cAAc,KAAK;EAChC,MAAM,QAAQ;EACd,MAAM,MAAM,OAAO,KAAK;EACxB,EAAE,QAAQ;EACV,IAAI,SAAS;EACb,QAAQ,SAAS;EACjB,GAAG,SAAS,IAAI,OAAO,OAAO,WAAW,MAAM,KAAA,CAAS;EACxD,OAAO,SAAS,IAAI,OAAO,MAAM,WAAW,MAAM,KAAA,CAAS;CAC7D;CAQA,YAAY,qBAAqB,aAAa;CAC9C,YAAY,0BAA0B,MAAM;CAM5C,YAAY,wBAAwB,gBAAgB,iBAAiB,EAAE;CAKvE,YAAY,eAAe,IAAI,IAAI,EAAE,mBAAmB,OACjC,IAAI,EAAE,mBAAmB,OACzB,IAAI,EAAE,mBAAmB,EAAE;CAElD,YAAY,oBAAoB,IAAI,IAAI,EAAE,wBAAwB,OACtC,IAAI,EAAE,wBAAwB,OAC9B,IAAI,EAAE,wBAAwB,EAAE;CAO5D,YAAY,wBAAwB,MAAM,IAAI,EAAE,sBAC/C,GAAG,IAAI,EAAE,mBAAmB,EAAE;CAE/B,YAAY,6BAA6B,MAAM,IAAI,EAAE,sBACpD,GAAG,IAAI,EAAE,wBAAwB,EAAE;CAMpC,YAAY,cAAc,QAAQ,IAAI,EAAE,sBACvC,QAAQ,IAAI,EAAE,sBAAsB,KAAK;CAE1C,YAAY,mBAAmB,SAAS,IAAI,EAAE,2BAC7C,QAAQ,IAAI,EAAE,2BAA2B,KAAK;CAK/C,YAAY,mBAAmB,GAAG,iBAAiB,EAAE;CAMrD,YAAY,SAAS,UAAU,IAAI,EAAE,iBACpC,QAAQ,IAAI,EAAE,iBAAiB,KAAK;CAWrC,YAAY,aAAa,KAAK,IAAI,EAAE,eACjC,IAAI,EAAE,YAAY,GACnB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,QAAQ,IAAI,IAAI,EAAE,WAAW,EAAE;CAK3C,YAAY,cAAc,WAAW,IAAI,EAAE,oBACxC,IAAI,EAAE,iBAAiB,GACxB,IAAI,EAAE,OAAO,EAAE;CAEjB,YAAY,SAAS,IAAI,IAAI,EAAE,YAAY,EAAE;CAE7C,YAAY,QAAQ,cAAc;CAKlC,YAAY,yBAAyB,GAAG,IAAI,EAAE,wBAAwB,SAAS;CAC/E,YAAY,oBAAoB,GAAG,IAAI,EAAE,mBAAmB,SAAS;CAErE,YAAY,eAAe,YAAY,IAAI,EAAE,kBAAkB,UAClC,IAAI,EAAE,kBAAkB,UACxB,IAAI,EAAE,kBAAkB,MAC5B,IAAI,EAAE,YAAY,IACtB,IAAI,EAAE,OAAO,MACT;CAEzB,YAAY,oBAAoB,YAAY,IAAI,EAAE,uBAAuB,UACvC,IAAI,EAAE,uBAAuB,UAC7B,IAAI,EAAE,uBAAuB,MACjC,IAAI,EAAE,iBAAiB,IAC3B,IAAI,EAAE,OAAO,MACT;CAE9B,YAAY,UAAU,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,eAAe,IAAI,IAAI,EAAE,MAAM,MAAM,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,eAAe,oBACD,0BAA0B,iBACtB,0BAA0B,mBAC1B,0BAA0B,KAAK;CAC7D,YAAY,UAAU,GAAG,IAAI,EAAE,aAAa,aAAa;CACzD,YAAY,cAAc,IAAI,EAAE,eAClB,MAAM,IAAI,EAAE,YAAY,OAClB,IAAI,EAAE,OAAO,eACL;CAC5B,YAAY,aAAa,IAAI,EAAE,SAAS,IAAI;CAC5C,YAAY,iBAAiB,IAAI,EAAE,aAAa,IAAI;CAIpD,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAI3E,YAAY,aAAa,SAAS;CAElC,YAAY,aAAa,SAAS,IAAI,EAAE,WAAW,OAAO,IAAI;CAC9D,QAAQ,mBAAmB;CAE3B,YAAY,SAAS,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;CACjE,YAAY,cAAc,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,kBAAkB,EAAE;CAG3E,YAAY,mBAAmB,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,YAAY,MAAM;CAC9E,YAAY,cAAc,IAAI,IAAI,EAAE,MAAM,OAAO,IAAI,EAAE,WAAW,MAAM;CAIxE,YAAY,kBAAkB,SAAS,IAAI,EAAE,MAC5C,OAAO,IAAI,EAAE,YAAY,GAAG,IAAI,EAAE,aAAa,IAAI,IAAI;CACxD,QAAQ,wBAAwB;CAMhC,YAAY,eAAe,SAAS,IAAI,EAAE,aAAa,aAEhC,IAAI,EAAE,aAAa,OAChB;CAE1B,YAAY,oBAAoB,SAAS,IAAI,EAAE,kBAAkB,aAErC,IAAI,EAAE,kBAAkB,OACrB;CAG/B,YAAY,QAAQ,iBAAiB;CAErC,YAAY,QAAQ,2BAA2B;CAC/C,YAAY,WAAW,6BAA6B;;;;;CC3NpD,IAAM,cAAc,OAAO,OAAO,EAAE,OAAO,KAAK,CAAC;CACjD,IAAM,YAAY,OAAO,OAAO,CAAE,CAAC;CACnC,IAAM,gBAAe,YAAW;EAC9B,IAAI,CAAC,SACH,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCdjB,IAAM,UAAU;CAChB,IAAM,sBAAsB,GAAG,MAAM;EACnC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK;EAGpC,MAAM,OAAO,QAAQ,KAAK,CAAC;EAC3B,MAAM,OAAO,QAAQ,KAAK,CAAC;EAE3B,IAAI,QAAQ,MAAM;GAChB,IAAI,CAAC;GACL,IAAI,CAAC;EACP;EAEA,OAAO,MAAM,IAAI,IACZ,QAAQ,CAAC,OAAQ,KACjB,QAAQ,CAAC,OAAQ,IAClB,IAAI,IAAI,KACR;CACN;CAEA,IAAM,uBAAuB,GAAG,MAAM,mBAAmB,GAAG,CAAC;CAE7D,OAAO,UAAU;EACf;EACA;CACF;;;;;CC1BA,IAAM,QAAA,cAAA;CACN,IAAM,EAAE,YAAY,qBAAA,kBAAA;CACpB,IAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,IAAM,eAAA,sBAAA;CACN,IAAM,EAAE,uBAAA,oBAAA;CAER,IAAM,0BAA0B,YAAY,eAAe;EACzD,MAAM,cAAc,WAAW,MAAM,GAAG;EACxC,IAAI,YAAY,SAAS,WAAW,QAClC,OAAO;EAGT,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,mBAAmB,WAAW,IAAI,YAAY,EAAE,MAAM,GACxD,OAAO;EAIX,OAAO;CACT;CAuUA,OAAO,UAAU,MArUX,OAAO;EACX,YAAa,SAAS,SAAS;GAC7B,UAAU,aAAa,OAAO;GAE9B,IAAI,mBAAmB,QACrB,IAAI,QAAQ,UAAU,CAAC,CAAC,QAAQ,SAC9B,QAAQ,sBAAsB,CAAC,CAAC,QAAQ,mBACxC,OAAO;QAEP,UAAU,QAAQ;QAEf,IAAI,OAAO,YAAY,UAC5B,MAAM,IAAI,UAAU,gDAAgD,OAAO,QAAQ,GAAG;GAGxF,IAAI,QAAQ,SAAS,YACnB,MAAM,IAAI,UACR,0BAA0B,WAAW,YACvC;GAGF,MAAM,UAAU,SAAS,OAAO;GAChC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GAGvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAEnC,MAAM,IAAI,QAAQ,KAAK,CAAC,CAAC,MAAM,QAAQ,QAAQ,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK;GAEvE,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,oBAAoB,SAAS;GAGnD,KAAK,MAAM;GAGX,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAChB,KAAK,QAAQ,CAAC,EAAE;GAEhB,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAG7C,IAAI,KAAK,QAAQ,oBAAoB,KAAK,QAAQ,GAChD,MAAM,IAAI,UAAU,uBAAuB;GAI7C,IAAI,CAAC,EAAE,IACL,KAAK,aAAa,CAAC;QAEnB,KAAK,aAAa,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO;IAC5C,IAAI,WAAW,KAAK,EAAE,GAAG;KACvB,MAAM,MAAM,CAAC;KACb,IAAI,OAAO,KAAK,MAAM,kBACpB,OAAO;IAEX;IACA,OAAO;GACT,CAAC;GAGH,KAAK,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;GACvC,KAAK,OAAO;EACd;EAEA,SAAU;GACR,KAAK,UAAU,GAAG,KAAK,MAAM,GAAG,KAAK,MAAM,GAAG,KAAK;GACnD,IAAI,KAAK,WAAW,QAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG;GAE9C,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,QAAS,OAAO;GACd,MAAM,kBAAkB,KAAK,SAAS,KAAK,SAAS,KAAK;GACzD,IAAI,EAAE,iBAAiB,SAAS;IAC9B,IAAI,OAAO,UAAU,YAAY,UAAU,KAAK,SAC9C,OAAO;IAET,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GACxC;GAEA,IAAI,MAAM,YAAY,KAAK,SACzB,OAAO;GAGT,OAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,KAAK;EACzD;EAEA,YAAa,OAAO;GAClB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,IAAI,KAAK,QAAQ,MAAM,OACrB,OAAO;GAET,OAAO;EACT;EAEA,WAAY,OAAO;GACjB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAIxC,IAAI,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QAC9C,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,MAAM,WAAW,QACrD,OAAO;QACF,IAAI,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,WAAW,QACtD,OAAO;GAGT,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,WAAW;IAC1B,MAAM,IAAI,MAAM,WAAW;IAC3B,MAAM,sBAAsB,GAAG,GAAG,CAAC;IACnC,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAEA,aAAc,OAAO;GACnB,IAAI,EAAE,iBAAiB,SACrB,QAAQ,IAAI,OAAO,OAAO,KAAK,OAAO;GAGxC,IAAI,IAAI;GACR,GAAG;IACD,MAAM,IAAI,KAAK,MAAM;IACrB,MAAM,IAAI,MAAM,MAAM;IACtB,MAAM,iBAAiB,GAAG,GAAG,CAAC;IAC9B,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAC3B,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,KAAA,GACf,OAAO;SACF,IAAI,MAAM,GACf;SAEA,OAAO,mBAAmB,GAAG,CAAC;GAElC,SAAS,EAAE;EACb;EAIA,IAAK,SAAS,YAAY,gBAAgB;GACxC,IAAI,QAAQ,WAAW,KAAK,GAAG;IAC7B,IAAI,CAAC,cAAc,mBAAmB,OACpC,MAAM,IAAI,MAAM,iDAAiD;IAGnE,IAAI,YAAY;KACd,MAAM,QAAQ,IAAI,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE,WAAW;KAClG,IAAI,CAAC,SAAS,MAAM,OAAO,YACzB,MAAM,IAAI,MAAM,uBAAuB,YAAY;IAEvD;GACF;GAEA,QAAQ,SAAR;IACE,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,KAAK,WAAW,SAAS;KACzB,KAAK,QAAQ;KACb,KAAK;KACL,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KAIH,KAAK,WAAW,SAAS;KACzB,KAAK,IAAI,SAAS,YAAY,cAAc;KAC5C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IAGF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,IAAI,SAAS,YAAY,cAAc;KAE9C,KAAK,IAAI,OAAO,YAAY,cAAc;KAC1C;IACF,KAAK;KACH,IAAI,KAAK,WAAW,WAAW,GAC7B,MAAM,IAAI,MAAM,WAAW,KAAK,IAAI,qBAAqB;KAE3D,KAAK,WAAW,SAAS;KACzB;IAEF,KAAK;KAKH,IACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,GAE3B,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,GACjD,KAAK;KAEP,KAAK,QAAQ;KACb,KAAK,aAAa,CAAC;KACnB;IACF,KAAK;KAKH,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK;KAEP,KAAK,aAAa,CAAC;KACnB;IAGF,KAAK,OAAO;KACV,MAAM,OAAO,OAAO,cAAc,IAAI,IAAI;KAE1C,IAAI,KAAK,WAAW,WAAW,GAC7B,KAAK,aAAa,CAAC,IAAI;UAClB;MACL,IAAI,IAAI,KAAK,WAAW;MACxB,OAAO,EAAE,KAAK,GACZ,IAAI,OAAO,KAAK,WAAW,OAAO,UAAU;OAC1C,KAAK,WAAW,EAAE;OAClB,IAAI;MACN;MAEF,IAAI,MAAM,IAAI;OAEZ,IAAI,eAAe,KAAK,WAAW,KAAK,GAAG,KAAK,mBAAmB,OACjE,MAAM,IAAI,MAAM,uDAAuD;OAEzE,KAAK,WAAW,KAAK,IAAI;MAC3B;KACF;KACA,IAAI,YAAY;MAGd,IAAI,aAAa,CAAC,YAAY,IAAI;MAClC,IAAI,mBAAmB,OACrB,aAAa,CAAC,UAAU;MAE1B,IAAI,uBAAuB,KAAK,YAAY,UAAU,GAAG;OACvD,MAAM,iBAAiB,KAAK,WAAW,WAAW,MAAM,GAAG,CAAC,CAAC;OAC7D,IAAI,MAAM,cAAc,GACtB,KAAK,aAAa;MAEtB,OACE,KAAK,aAAa;KAEtB;KACA;IACF;IACA,SACE,MAAM,IAAI,MAAM,+BAA+B,SAAS;GAC5D;GACA,KAAK,MAAM,KAAK,OAAO;GACvB,IAAI,KAAK,MAAM,QACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG;GAErC,OAAO;EACT;CACF;;;;;CCzVA,IAAM,SAAA,iBAAA;CACN,IAAM,SAAS,SAAS,SAAS,cAAc,UAAU;EACvD,IAAI,mBAAmB,QACrB,OAAO;EAET,IAAI;GACF,OAAO,IAAI,OAAO,SAAS,OAAO;EACpC,SAAS,IAAI;GACX,IAAI,CAAC,aACH,OAAO;GAET,MAAM;EACR;CACF;CAEA,OAAO,UAAU;;;;;CCfjB,IAAM,QAAA,cAAA;CACN,IAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,SAAS,OAAO;EAChC,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,IAAM,QAAA,cAAA;CACN,IAAM,SAAS,SAAS,YAAY;EAClC,MAAM,IAAI,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,UAAU,EAAE,GAAG,OAAO;EAC7D,OAAO,IAAI,EAAE,UAAU;CACzB;CACA,OAAO,UAAU;;;;;CCLjB,IAAM,SAAA,iBAAA;CAEN,IAAM,OAAO,SAAS,SAAS,SAAS,YAAY,mBAAmB;EACrE,IAAI,OAAQ,YAAa,UAAU;GACjC,iBAAiB;GACjB,aAAa;GACb,UAAU,KAAA;EACZ;EAEA,IAAI;GACF,OAAO,IAAI,OACT,mBAAmB,SAAS,QAAQ,UAAU,SAC9C,OACF,CAAC,CAAC,IAAI,SAAS,YAAY,cAAc,CAAC,CAAC;EAC7C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CClBjB,IAAM,QAAA,cAAA;CAEN,IAAM,QAAQ,UAAU,aAAa;EACnC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;EACrC,MAAM,aAAa,GAAG,QAAQ,EAAE;EAEhC,IAAI,eAAe,GACjB,OAAO;EAGT,MAAM,WAAW,aAAa;EAC9B,MAAM,cAAc,WAAW,KAAK;EACpC,MAAM,aAAa,WAAW,KAAK;EACnC,MAAM,aAAa,CAAC,CAAC,YAAY,WAAW;EAG5C,IAAI,CAFe,CAAC,WAAW,WAAW,UAEzB,CAAC,YAAY;GAQ5B,IAAI,CAAC,WAAW,SAAS,CAAC,WAAW,OACnC,OAAO;GAIT,IAAI,WAAW,YAAY,WAAW,MAAM,GAAG;IAC7C,IAAI,WAAW,SAAS,CAAC,WAAW,OAClC,OAAO;IAET,OAAO;GACT;EACF;EAGA,MAAM,SAAS,aAAa,QAAQ;EAEpC,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAGlB,IAAI,GAAG,UAAU,GAAG,OAClB,OAAO,SAAS;EAIlB,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CCzDjB,IAAM,SAAA,iBAAA;CACN,IAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,IAAM,SAAA,iBAAA;CACN,IAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,IAAM,SAAA,iBAAA;CACN,IAAM,SAAS,GAAG,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC;CACjD,OAAO,UAAU;;;;;CCFjB,IAAM,QAAA,cAAA;CACN,IAAM,cAAc,SAAS,YAAY;EACvC,MAAM,SAAS,MAAM,SAAS,OAAO;EACrC,OAAQ,UAAU,OAAO,WAAW,SAAU,OAAO,aAAa;CACpE;CACA,OAAO,UAAU;;;;;CCLjB,IAAM,SAAA,iBAAA;CACN,IAAM,WAAW,GAAG,GAAG,UACrB,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,QAAQ,IAAI,OAAO,GAAG,KAAK,CAAC;CAEnD,OAAO,UAAU;;;;;CCJjB,IAAM,UAAA,gBAAA;CACN,IAAM,YAAY,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,gBAAgB,GAAG,MAAM,QAAQ,GAAG,GAAG,IAAI;CACjD,OAAO,UAAU;;;;;CCFjB,IAAM,SAAA,iBAAA;CACN,IAAM,gBAAgB,GAAG,GAAG,UAAU;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,MAAM,WAAW,IAAI,OAAO,GAAG,KAAK;EACpC,OAAO,SAAS,QAAQ,QAAQ,KAAK,SAAS,aAAa,QAAQ;CACrE;CACA,OAAO,UAAU;;;;;CCNjB,IAAM,eAAA,sBAAA;CACN,IAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC3E,OAAO,UAAU;;;;;CCFjB,IAAM,eAAA,sBAAA;CACN,IAAM,SAAS,MAAM,UAAU,KAAK,MAAM,GAAG,MAAM,aAAa,GAAG,GAAG,KAAK,CAAC;CAC5E,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,IAAI;CACnD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,MAAM,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACrD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,MAAM;CACtD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,IAAM,UAAA,gBAAA;CACN,IAAM,OAAO,GAAG,GAAG,UAAU,QAAQ,GAAG,GAAG,KAAK,KAAK;CACrD,OAAO,UAAU;;;;;CCFjB,IAAM,KAAA,WAAA;CACN,IAAM,MAAA,YAAA;CACN,IAAM,KAAA,WAAA;CACN,IAAM,MAAA,YAAA;CACN,IAAM,KAAA,WAAA;CACN,IAAM,MAAA,YAAA;CAEN,IAAM,OAAO,GAAG,IAAI,GAAG,UAAU;EAC/B,QAAQ,IAAR;GACE,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;IACH,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,IAAI,OAAO,MAAM,UACf,IAAI,EAAE;IAER,OAAO,MAAM;GAEf,KAAK;GACL,KAAK;GACL,KAAK,MACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,KAAK,KACH,OAAO,GAAG,GAAG,GAAG,KAAK;GAEvB,KAAK,MACH,OAAO,IAAI,GAAG,GAAG,KAAK;GAExB,SACE,MAAM,IAAI,UAAU,qBAAqB,IAAI;EACjD;CACF;CACA,OAAO,UAAU;;;;;CCnDjB,IAAM,SAAA,iBAAA;CACN,IAAM,QAAA,cAAA;CACN,IAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CAEpB,IAAM,UAAU,SAAS,YAAY;EACnC,IAAI,mBAAmB,QACrB,OAAO;EAGT,IAAI,OAAO,YAAY,UACrB,UAAU,OAAO,OAAO;EAG1B,IAAI,OAAO,YAAY,UACrB,OAAO;EAGT,UAAU,WAAW,CAAC;EAEtB,IAAI,QAAQ;EACZ,IAAI,CAAC,QAAQ,KACX,QAAQ,QAAQ,MAAM,QAAQ,oBAAoB,GAAG,EAAE,cAAc,GAAG,EAAE,OAAO;OAC5E;GAUL,MAAM,iBAAiB,QAAQ,oBAAoB,GAAG,EAAE,iBAAiB,GAAG,EAAE;GAC9E,IAAI;GACJ,QAAQ,OAAO,eAAe,KAAK,OAAO,OACrC,CAAC,SAAS,MAAM,QAAQ,MAAM,EAAE,CAAC,WAAW,QAAQ,SACvD;IACA,IAAI,CAAC,SACC,KAAK,QAAQ,KAAK,EAAE,CAAC,WAAW,MAAM,QAAQ,MAAM,EAAE,CAAC,QAC3D,QAAQ;IAEV,eAAe,YAAY,KAAK,QAAQ,KAAK,EAAE,CAAC,SAAS,KAAK,EAAE,CAAC;GACnE;GAEA,eAAe,YAAY;EAC7B;EAEA,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,MAAM;EAMpB,OAAO,MAAM,GAAG,MAAM,GALR,MAAM,MAAM,IAKK,GAJjB,MAAM,MAAM,MACP,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,KAC9D,QAAQ,qBAAqB,MAAM,KAAK,IAAI,MAAM,OAAO,MAEP,OAAO;CACzE;CACA,OAAO,UAAU;;;;;CC3DjB,IAAM,QAAA,cAAA;CACN,IAAM,YAAA,kBAAA;CACN,IAAM,SAAA,iBAAA;CAEN,IAAM,YAAY,SAAS,YAAY,YAAY;EACjD,IAAI,CAAC,UAAU,cAAc,SAAS,UAAU,GAC9C,OAAO;EAGT,MAAM,gBAAgB,kBAAkB,SAAS,OAAO;EACxD,OAAO,iBAAiB,aAAa,eAAe,UAAU;CAChE;CAEA,IAAM,qBAAqB,SAAS,YAAY;EAK9C,OAAO,MAHL,mBAAmB,SAAS,QAAQ,UAAU,SAGb,OAAO;CAC5C;CAEA,IAAM,gBAAgB,SAAS,eAAe;EAC5C,IAAI,aAAa,UAAU,GACzB,OAAO,QAAQ;EAGjB,QAAQ,aAAa,CAAC;EAEtB,QAAQ,YAAR;GACE,KAAK;IACH,QAAQ,QAAQ;IAChB,QAAQ,QAAQ;IAChB;GACF,KAAK;IACH,QAAQ,QAAQ;IAChB;EACJ;EAEA,OAAO,QAAQ,OAAO;CACxB;CAEA,IAAM,gBAAgB,SAAS;EAC7B,OAAO,KAAK,WAAW,KAAK;CAC9B;CAEA,OAAO,UAAU;;;;;CC7CjB,IAAM,WAAN,MAAe;EACb,cAAe;GACb,KAAK,MAAM;GACX,KAAK,sBAAM,IAAI,IAAI;EACrB;EAEA,IAAK,KAAK;GACR,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;GAC9B,IAAI,UAAU,KAAA,GACZ;QACK;IAEL,KAAK,IAAI,OAAO,GAAG;IACnB,KAAK,IAAI,IAAI,KAAK,KAAK;IACvB,OAAO;GACT;EACF;EAEA,OAAQ,KAAK;GACX,OAAO,KAAK,IAAI,OAAO,GAAG;EAC5B;EAEA,IAAK,KAAK,OAAO;GAGf,IAAI,CAFY,KAAK,OAAO,GAEjB,KAAK,UAAU,KAAA,GAAW;IAEnC,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK;KAC7B,MAAM,WAAW,KAAK,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;KACxC,KAAK,OAAO,QAAQ;IACtB;IAEA,KAAK,IAAI,IAAI,KAAK,KAAK;GACzB;GAEA,OAAO;EACT;CACF;CAEA,OAAO,UAAU;;;;;CCvCjB,IAAM,mBAAmB;CAuNzB,OAAO,UAAU,MApNX,MAAM;EACV,YAAa,OAAO,SAAS;GAC3B,UAAU,aAAa,OAAO;GAE9B,IAAI,iBAAiB,OACnB,IACE,MAAM,UAAU,CAAC,CAAC,QAAQ,SAC1B,MAAM,sBAAsB,CAAC,CAAC,QAAQ,mBAEtC,OAAO;QAEP,OAAO,IAAI,MAAM,MAAM,KAAK,OAAO;GAIvC,IAAI,iBAAiB,YAAY;IAE/B,KAAK,MAAM,MAAM;IACjB,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC;IACnB,KAAK,YAAY,KAAA;IACjB,OAAO;GACT;GAEA,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,oBAAoB,CAAC,CAAC,QAAQ;GAKnC,KAAK,MAAM,MAAM,KAAK,CAAC,CAAC,QAAQ,kBAAkB,GAAG;GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,CAAC,CAEX,KAAI,MAAK,KAAK,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAInC,QAAO,MAAK,EAAE,MAAM;GAEvB,IAAI,CAAC,KAAK,IAAI,QACZ,MAAM,IAAI,UAAU,yBAAyB,KAAK,KAAK;GAIzD,IAAI,KAAK,IAAI,SAAS,GAAG;IAEvB,MAAM,QAAQ,KAAK,IAAI;IACvB,KAAK,MAAM,KAAK,IAAI,QAAO,MAAK,CAAC,UAAU,EAAE,EAAE,CAAC;IAChD,IAAI,KAAK,IAAI,WAAW,GACtB,KAAK,MAAM,CAAC,KAAK;SACZ,IAAI,KAAK,IAAI,SAAS;UAEtB,MAAM,KAAK,KAAK,KACnB,IAAI,EAAE,WAAW,KAAK,MAAM,EAAE,EAAE,GAAG;MACjC,KAAK,MAAM,CAAC,CAAC;MACb;KACF;;GAGN;GAEA,KAAK,YAAY,KAAA;EACnB;EAEA,IAAI,QAAS;GACX,IAAI,KAAK,cAAc,KAAA,GAAW;IAChC,KAAK,YAAY;IACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;KACxC,IAAI,IAAI,GACN,KAAK,aAAa;KAEpB,MAAM,QAAQ,KAAK,IAAI;KACvB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;MACrC,IAAI,IAAI,GACN,KAAK,aAAa;MAEpB,KAAK,aAAa,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK;KAC7C;IACF;GACF;GACA,OAAO,KAAK;EACd;EAEA,SAAU;GACR,OAAO,KAAK;EACd;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,WAAY,OAAO;GAEjB,QAAQ,MAAM,QAAQ,cAAc,EAAE;GAOtC,MAAM,YAFH,KAAK,QAAQ,qBAAqB,4BAClC,KAAK,QAAQ,SAAS,eACE,MAAM;GACjC,MAAM,SAAS,MAAM,IAAI,OAAO;GAChC,IAAI,QACF,OAAO;GAGT,MAAM,QAAQ,KAAK,QAAQ;GAE3B,MAAM,KAAK,QAAQ,GAAG,EAAE,oBAAoB,GAAG,EAAE;GACjD,QAAQ,MAAM,QAAQ,IAAI,cAAc,KAAK,QAAQ,iBAAiB,CAAC;GACvE,MAAM,kBAAkB,KAAK;GAG7B,QAAQ,MAAM,QAAQ,GAAG,EAAE,iBAAiB,qBAAqB;GACjE,MAAM,mBAAmB,KAAK;GAG9B,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAGzB,QAAQ,MAAM,QAAQ,GAAG,EAAE,YAAY,gBAAgB;GACvD,MAAM,cAAc,KAAK;GAKzB,IAAI,YAAY,MACb,MAAM,GAAG,CAAC,CACV,KAAI,SAAQ,gBAAgB,MAAM,KAAK,OAAO,CAAC,CAAC,CAChD,KAAK,GAAG,CAAC,CACT,MAAM,KAAK,CAAC,CAEZ,KAAI,SAAQ,YAAY,MAAM,KAAK,OAAO,CAAC;GAE9C,IAAI,OAEF,YAAY,UAAU,QAAO,SAAQ;IACnC,MAAM,wBAAwB,MAAM,KAAK,OAAO;IAChD,OAAO,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,gBAAgB;GAC3C,CAAC;GAEH,MAAM,cAAc,SAAS;GAK7B,MAAM,2BAAW,IAAI,IAAI;GACzB,MAAM,cAAc,UAAU,KAAI,SAAQ,IAAI,WAAW,MAAM,KAAK,OAAO,CAAC;GAC5E,KAAK,MAAM,QAAQ,aAAa;IAC9B,IAAI,UAAU,IAAI,GAChB,OAAO,CAAC,IAAI;IAEd,SAAS,IAAI,KAAK,OAAO,IAAI;GAC/B;GACA,IAAI,SAAS,OAAO,KAAK,SAAS,IAAI,EAAE,GACtC,SAAS,OAAO,EAAE;GAGpB,MAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;GACpC,MAAM,IAAI,SAAS,MAAM;GACzB,OAAO;EACT;EAEA,WAAY,OAAO,SAAS;GAC1B,IAAI,EAAE,iBAAiB,QACrB,MAAM,IAAI,UAAU,qBAAqB;GAG3C,OAAO,KAAK,IAAI,MAAM,oBAAoB;IACxC,OACE,cAAc,iBAAiB,OAAO,KACtC,MAAM,IAAI,MAAM,qBAAqB;KACnC,OACE,cAAc,kBAAkB,OAAO,KACvC,gBAAgB,OAAO,mBAAmB;MACxC,OAAO,iBAAiB,OAAO,oBAAoB;OACjD,OAAO,eAAe,WAAW,iBAAiB,OAAO;MAC3D,CAAC;KACH,CAAC;IAEL,CAAC;GAEL,CAAC;EACH;EAGA,KAAM,SAAS;GACb,IAAI,CAAC,SACH,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KACnC,IAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,OAAO,GAC5C,OAAO;GAGX,OAAO;EACT;CACF;CAKA,IAAM,QAAQ,KAAA,iBAAA,GAAQ;CAEtB,IAAM,eAAA,sBAAA;CACN,IAAM,aAAA,mBAAA;CACN,IAAM,QAAA,cAAA;CACN,IAAM,SAAA,iBAAA;CACN,IAAM,EACJ,QAAQ,IACR,KACA,GACA,uBACA,kBACA,qBAAA,WAAA;CAEF,IAAM,EAAE,yBAAyB,eAAA,kBAAA;CAGjC,IAAM,eAAe,IAAI,OAAO,IAAI,EAAE,QAAQ,GAAG;CAEjD,IAAM,aAAY,MAAK,EAAE,UAAU;CACnC,IAAM,SAAQ,MAAK,EAAE,UAAU;CAI/B,IAAM,iBAAiB,aAAa,YAAY;EAC9C,IAAI,SAAS;EACb,MAAM,uBAAuB,YAAY,MAAM;EAC/C,IAAI,iBAAiB,qBAAqB,IAAI;EAE9C,OAAO,UAAU,qBAAqB,QAAQ;GAC5C,SAAS,qBAAqB,OAAO,oBAAoB;IACvD,OAAO,eAAe,WAAW,iBAAiB,OAAO;GAC3D,CAAC;GAED,iBAAiB,qBAAqB,IAAI;EAC5C;EAEA,OAAO;CACT;CAKA,IAAM,mBAAmB,MAAM,YAAY;EACzC,OAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,EAAE;EACnC,MAAM,QAAQ,MAAM,OAAO;EAC3B,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,SAAS,IAAI;EACnB,OAAO,cAAc,MAAM,OAAO;EAClC,MAAM,UAAU,IAAI;EACpB,OAAO,eAAe,MAAM,OAAO;EACnC,MAAM,UAAU,IAAI;EACpB,OAAO,aAAa,MAAM,OAAO;EACjC,MAAM,SAAS,IAAI;EACnB,OAAO;CACT;CAEA,IAAM,OAAM,OAAM,CAAC,MAAM,GAAG,YAAY,MAAM,OAAO,OAAO;CAE5D,IAAM,sBAAsB,GAAG,GAAG,MAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAChB,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC;CAUxB,IAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,IAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,QAAQ,CAAC,IAAI,EAAE;QACvB,IAAI,IAAI,CAAC,GAEd,MAAM,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE;QAC/B,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GACnB,OAEE,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAUA,IAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KACJ,KAAK,CAAC,CACN,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CACpC,KAAK,GAAG;CACb;CAEA,IAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,SAAS,MAAM,OAAO;EAC5B,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,cAAc,GAAG,EAAE;EAClD,MAAM,IAAI,QAAQ,oBAAoB,OAAO;EAC7C,OAAO,KAAK,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,OAAO;GACzC,MAAM,SAAS,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE;GACnC,IAAI;GAEJ,IAAI,IAAI,CAAC,GACP,MAAM;QACD,IAAI,IAAI,CAAC,GACd,MAAM,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE;QAC3B,IAAI,IAAI,CAAC,GACd,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;QAExC,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;QAEhC,IAAI,IAAI;IACb,MAAM,mBAAmB,EAAE;IAC3B,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAEtB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGnB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GACzB,IAAI,CAAC,IAAI,EAAE;GAEhB,OAAO;IACL,MAAM,OAAO;IACb,IAAI,MAAM,KACR,IAAI,MAAM,KACR,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE;SAEtB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;SAGnB,MAAM,KAAK,EAAE,GAAG,EAAE,GAAG,EACpB,IAAI,CAAC,IAAI,EAAE;GAEhB;GAEA,MAAM,gBAAgB,GAAG;GACzB,OAAO;EACT,CAAC;CACH;CAEA,IAAM,kBAAkB,MAAM,YAAY;EACxC,MAAM,kBAAkB,MAAM,OAAO;EACrC,OAAO,KACJ,MAAM,KAAK,CAAC,CACZ,KAAK,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CACrC,KAAK,GAAG;CACb;CAEA,IAAM,iBAAiB,MAAM,YAAY;EACvC,OAAO,KAAK,KAAK;EACjB,MAAM,IAAI,QAAQ,QAAQ,GAAG,EAAE,eAAe,GAAG,EAAE;EACnD,OAAO,KAAK,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,GAAG,OAAO;GACjD,MAAM,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE;GAC5C,IAAI,mBAAmB,GAAG,GAAG,CAAC,GAC5B,OAAO;GAGT,MAAM,KAAK,IAAI,CAAC;GAChB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,KAAK,MAAM,IAAI,CAAC;GACtB,MAAM,OAAO;GAEb,IAAI,SAAS,OAAO,MAClB,OAAO;GAKT,KAAK,QAAQ,oBAAoB,OAAO;GAExC,IAAI,IACF,IAAI,SAAS,OAAO,SAAS,KAE3B,MAAM;QAGN,MAAM;QAEH,IAAI,QAAQ,MAAM;IAGvB,IAAI,IACF,IAAI;IAEN,IAAI;IAEJ,IAAI,SAAS,KAAK;KAGhB,OAAO;KACP,IAAI,IAAI;MACN,IAAI,CAAC,IAAI;MACT,IAAI;MACJ,IAAI;KACN,OAAO;MACL,IAAI,CAAC,IAAI;MACT,IAAI;KACN;IACF,OAAO,IAAI,SAAS,MAAM;KAGxB,OAAO;KACP,IAAI,IACF,IAAI,CAAC,IAAI;UAET,IAAI,CAAC,IAAI;IAEb;IAEA,IAAI,SAAS,KACX,KAAK;IAGP,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI;GAChC,OAAO,IAAI,IACT,MAAM,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE;QAC5B,IAAI,IACT,MAAM,KAAK,EAAE,GAAG,EAAE,IAAI,GACrB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE;GAGnB,MAAM,iBAAiB,GAAG;GAE1B,OAAO;EACT,CAAC;CACH;CAIA,IAAM,gBAAgB,MAAM,YAAY;EACtC,MAAM,gBAAgB,MAAM,OAAO;EAEnC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,EAAE,OAAO,EAAE;CAC3B;CAEA,IAAM,eAAe,MAAM,YAAY;EACrC,MAAM,eAAe,MAAM,OAAO;EAClC,OAAO,KACJ,KAAK,CAAC,CACN,QAAQ,GAAG,QAAQ,oBAAoB,EAAE,UAAU,EAAE,OAAO,EAAE;CACnE;CAQA,IAAM,iBAAgB,WAAU,IAC9B,MAAM,IAAI,IAAI,IAAI,KAAK,IACvB,IAAI,IAAI,IAAI,IAAI,QAAQ;EACxB,IAAI,IAAI,EAAE,GACR,OAAO;OACF,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,MAAM,QAAQ,OAAO;OAC/B,IAAI,IAAI,EAAE,GACf,OAAO,KAAK,GAAG,GAAG,GAAG,IAAI,QAAQ,OAAO;OACnC,IAAI,KACT,OAAO,KAAK;OAEZ,OAAO,KAAK,OAAO,QAAQ,OAAO;EAGpC,IAAI,IAAI,EAAE,GACR,KAAK;OACA,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,CAAC,KAAK,EAAE;OACZ,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE;OAClB,IAAI,KACT,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;OACvB,IAAI,OACT,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE;OAE7B,KAAK,KAAK;EAGZ,OAAO,GAAG,KAAK,GAAG,KAAK,KAAK;CAC9B;CAEA,IAAM,WAAW,KAAK,SAAS,YAAY;EACzC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GACtB,OAAO;EAIX,IAAI,QAAQ,WAAW,UAAU,CAAC,QAAQ,mBAAmB;GAM3D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;IACnC,MAAM,IAAI,EAAE,CAAC,MAAM;IACnB,IAAI,IAAI,EAAE,CAAC,WAAW,WAAW,KAC/B;IAGF,IAAI,IAAI,EAAE,CAAC,OAAO,WAAW,SAAS,GAAG;KACvC,MAAM,UAAU,IAAI,EAAE,CAAC;KACvB,IAAI,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,SAC1B,QAAQ,UAAU,QAAQ,OAC5B,OAAO;IAEX;GACF;GAGA,OAAO;EACT;EAEA,OAAO;CACT;;;;;CC1jBA,IAAM,MAAM,OAAO,YAAY;CAqI/B,OAAO,UAAU,MAnIX,WAAW;EACf,WAAW,MAAO;GAChB,OAAO;EACT;EAEA,YAAa,MAAM,SAAS;GAC1B,UAAU,aAAa,OAAO;GAE9B,IAAI,gBAAgB,YAClB,IAAI,KAAK,UAAU,CAAC,CAAC,QAAQ,OAC3B,OAAO;QAEP,OAAO,KAAK;GAIhB,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,GAAG;GACxC,MAAM,cAAc,MAAM,OAAO;GACjC,KAAK,UAAU;GACf,KAAK,QAAQ,CAAC,CAAC,QAAQ;GACvB,KAAK,MAAM,IAAI;GAEf,IAAI,KAAK,WAAW,KAClB,KAAK,QAAQ;QAEb,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO;GAG3C,MAAM,QAAQ,IAAI;EACpB;EAEA,MAAO,MAAM;GACX,MAAM,IAAI,KAAK,QAAQ,QAAQ,GAAG,EAAE,mBAAmB,GAAG,EAAE;GAC5D,MAAM,IAAI,KAAK,MAAM,CAAC;GAEtB,IAAI,CAAC,GACH,MAAM,IAAI,UAAU,uBAAuB,MAAM;GAGnD,KAAK,WAAW,EAAE,OAAO,KAAA,IAAY,EAAE,KAAK;GAC5C,IAAI,KAAK,aAAa,KACpB,KAAK,WAAW;GAIlB,IAAI,CAAC,EAAE,IACL,KAAK,SAAS;QAEd,KAAK,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,KAAK;EAErD;EAEA,WAAY;GACV,OAAO,KAAK;EACd;EAEA,KAAM,SAAS;GACb,MAAM,mBAAmB,SAAS,KAAK,QAAQ,KAAK;GAEpD,IAAI,KAAK,WAAW,OAAO,YAAY,KACrC,OAAO;GAGT,IAAI,OAAO,YAAY,UACrB,IAAI;IACF,UAAU,IAAI,OAAO,SAAS,KAAK,OAAO;GAC5C,SAAS,IAAI;IACX,OAAO;GACT;GAGF,OAAO,IAAI,SAAS,KAAK,UAAU,KAAK,QAAQ,KAAK,OAAO;EAC9D;EAEA,WAAY,MAAM,SAAS;GACzB,IAAI,EAAE,gBAAgB,aACpB,MAAM,IAAI,UAAU,0BAA0B;GAGhD,IAAI,KAAK,aAAa,IAAI;IACxB,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,KAAK;GACvD,OAAO,IAAI,KAAK,aAAa,IAAI;IAC/B,IAAI,KAAK,UAAU,IACjB,OAAO;IAET,OAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,MAAM;GACxD;GAEA,UAAU,aAAa,OAAO;GAG9B,IAAI,QAAQ,sBACT,KAAK,UAAU,cAAc,KAAK,UAAU,aAC7C,OAAO;GAET,IAAI,CAAC,QAAQ,sBACV,KAAK,MAAM,WAAW,QAAQ,KAAK,KAAK,MAAM,WAAW,QAAQ,IAClE,OAAO;GAIT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IAAI,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC/D,OAAO;GAGT,IACG,KAAK,OAAO,YAAY,KAAK,OAAO,WACrC,KAAK,SAAS,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,GAAG,GACzD,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAGT,IAAI,IAAI,KAAK,QAAQ,KAAK,KAAK,QAAQ,OAAO,KAC5C,KAAK,SAAS,WAAW,GAAG,KAAK,KAAK,SAAS,WAAW,GAAG,GAC7D,OAAO;GAET,OAAO;EACT;CACF;CAIA,IAAM,eAAA,sBAAA;CACN,IAAM,EAAE,QAAQ,IAAI,MAAA,WAAA;CACpB,IAAM,MAAA,YAAA;CACN,IAAM,QAAA,cAAA;CACN,IAAM,SAAA,iBAAA;CACN,IAAM,QAAA,cAAA;;;;;CC5IN,IAAM,QAAA,cAAA;CACN,IAAM,aAAa,SAAS,OAAO,YAAY;EAC7C,IAAI;GACF,QAAQ,IAAI,MAAM,OAAO,OAAO;EAClC,SAAS,IAAI;GACX,OAAO;EACT;EACA,OAAO,MAAM,KAAK,OAAO;CAC3B;CACA,OAAO,UAAU;;;;;CCTjB,IAAM,QAAA,cAAA;CAGN,IAAM,iBAAiB,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,IACvB,KAAI,SAAQ,KAAK,KAAI,MAAK,EAAE,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;CAEnE,OAAO,UAAU;;;;;CCPjB,IAAM,SAAA,iBAAA;CACN,IAAM,QAAA,cAAA;CAEN,IAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;KAEnC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCxBjB,IAAM,SAAA,iBAAA;CACN,IAAM,QAAA,cAAA;CACN,IAAM,iBAAiB,UAAU,OAAO,YAAY;EAClD,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI;GACF,WAAW,IAAI,MAAM,OAAO,OAAO;EACrC,SAAS,IAAI;GACX,OAAO;EACT;EACA,SAAS,SAAS,MAAM;GACtB,IAAI,SAAS,KAAK,CAAC;QAEb,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;KAElC,MAAM;KACN,QAAQ,IAAI,OAAO,KAAK,OAAO;IACjC;;EAEJ,CAAC;EACD,OAAO;CACT;CACA,OAAO,UAAU;;;;;CCvBjB,IAAM,SAAA,iBAAA;CACN,IAAM,QAAA,cAAA;CACN,IAAM,KAAA,WAAA;CAEN,IAAM,cAAc,OAAO,UAAU;EACnC,QAAQ,IAAI,MAAM,OAAO,KAAK;EAE9B,IAAI,SAAS,IAAI,OAAO,OAAO;EAC/B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS,IAAI,OAAO,SAAS;EAC7B,IAAI,MAAM,KAAK,MAAM,GACnB,OAAO;EAGT,SAAS;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,SAAS;GACb,YAAY,SAAS,eAAe;IAElC,MAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;IACpD,QAAQ,WAAW,UAAnB;KACE,KAAK;MACH,IAAI,QAAQ,WAAW,WAAW,GAChC,QAAQ;WAER,QAAQ,WAAW,KAAK,CAAC;MAE3B,QAAQ,MAAM,QAAQ,OAAO;KAE/B,KAAK;KACL,KAAK;MACH,IAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAC/B,SAAS;MAEX;KACF,KAAK;KACL,KAAK,MAEH;;KAEF,SACE,MAAM,IAAI,MAAM,yBAAyB,WAAW,UAAU;IAClE;GACF,CAAC;GACD,IAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IACzC,SAAS;EAEb;EAEA,IAAI,UAAU,MAAM,KAAK,MAAM,GAC7B,OAAO;EAGT,OAAO;CACT;CACA,OAAO,UAAU;;;;;CC5DjB,IAAM,QAAA,cAAA;CACN,IAAM,cAAc,OAAO,YAAY;EACrC,IAAI;GAGF,OAAO,IAAI,MAAM,OAAO,OAAO,CAAC,CAAC,SAAS;EAC5C,SAAS,IAAI;GACX,OAAO;EACT;CACF;CACA,OAAO,UAAU;;;;;CCVjB,IAAM,SAAA,iBAAA;CACN,IAAM,aAAA,mBAAA;CACN,IAAM,EAAE,QAAQ;CAChB,IAAM,QAAA,cAAA;CACN,IAAM,YAAA,kBAAA;CACN,IAAM,KAAA,WAAA;CACN,IAAM,KAAA,WAAA;CACN,IAAM,MAAA,YAAA;CACN,IAAM,MAAA,YAAA;CAEN,IAAM,WAAW,SAAS,OAAO,MAAM,YAAY;EACjD,UAAU,IAAI,OAAO,SAAS,OAAO;EACrC,QAAQ,IAAI,MAAM,OAAO,OAAO;EAEhC,IAAI,MAAM,OAAO,MAAM,MAAM;EAC7B,QAAQ,MAAR;GACE,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,KAAK;IACH,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR;GACF,SACE,MAAM,IAAI,UAAU,2CAAuC;EAC/D;EAGA,IAAI,UAAU,SAAS,OAAO,OAAO,GACnC,OAAO;EAMT,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;GACzC,MAAM,cAAc,MAAM,IAAI;GAE9B,IAAI,OAAO;GACX,IAAI,MAAM;GAEV,YAAY,SAAS,eAAe;IAClC,IAAI,WAAW,WAAW,KACxB,aAAa,IAAI,WAAW,SAAS;IAEvC,OAAO,QAAQ;IACf,MAAM,OAAO;IACb,IAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAC9C,OAAO;SACF,IAAI,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GACpD,MAAM;GAEV,CAAC;GAID,IAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAC9C,OAAO;GAKT,KAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAC3B,OAAO;QACF,IAAI,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAC3D,OAAO;EAEX;EACA,OAAO;CACT;CAEA,OAAO,UAAU;;;;;CC9EjB,IAAM,UAAA,gBAAA;CACN,IAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,IAAM,UAAA,gBAAA;CAEN,IAAM,OAAO,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;CAC7E,OAAO,UAAU;;;;;CCHjB,IAAM,QAAA,cAAA;CACN,IAAM,cAAc,IAAI,IAAI,YAAY;EACtC,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,KAAK,IAAI,MAAM,IAAI,OAAO;EAC1B,OAAO,GAAG,WAAW,IAAI,OAAO;CAClC;CACA,OAAO,UAAU;;;;;CCHjB,IAAM,YAAA,kBAAA;CACN,IAAM,UAAA,gBAAA;CACN,OAAO,WAAW,UAAU,OAAO,YAAY;EAC7C,MAAM,MAAM,CAAC;EACb,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,MAAM,IAAI,SAAS,MAAM,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;EACxD,KAAK,MAAM,WAAW,GAEpB,IADiB,UAAU,SAAS,OAAO,OAChC,GAAG;GACZ,OAAO;GACP,IAAI,CAAC,OACH,QAAQ;EAEZ,OAAO;GACL,IAAI,MACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;GAExB,OAAO;GACP,QAAQ;EACV;EAEF,IAAI,OACF,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC;EAGxB,MAAM,SAAS,CAAC;EAChB,KAAK,MAAM,CAAC,KAAK,QAAQ,KACvB,IAAI,QAAQ,KACV,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,OAAO,QAAQ,EAAE,IAC3B,OAAO,KAAK,GAAG;OACV,IAAI,CAAC,KACV,OAAO,KAAK,KAAK,KAAK;OACjB,IAAI,QAAQ,EAAE,IACnB,OAAO,KAAK,KAAK,KAAK;OAEtB,OAAO,KAAK,GAAG,IAAI,KAAK,KAAK;EAGjC,MAAM,aAAa,OAAO,KAAK,MAAM;EACrC,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;EACzE,OAAO,WAAW,SAAS,SAAS,SAAS,aAAa;CAC5D;;;;;CC9CA,IAAM,QAAA,cAAA;CACN,IAAM,aAAA,mBAAA;CACN,IAAM,EAAE,QAAQ;CAChB,IAAM,YAAA,kBAAA;CACN,IAAM,UAAA,gBAAA;CAsCN,IAAM,UAAU,KAAK,KAAK,UAAU,CAAC,MAAM;EACzC,IAAI,QAAQ,KACV,OAAO;EAGT,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,MAAM,IAAI,MAAM,KAAK,OAAO;EAC5B,IAAI,aAAa;EAEjB,OAAO,KAAK,MAAM,aAAa,IAAI,KAAK;GACtC,KAAK,MAAM,aAAa,IAAI,KAAK;IAC/B,MAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;IACxD,aAAa,cAAc,UAAU;IACrC,IAAI,OACF,SAAS;GAEb;GAKA,IAAI,YACF,OAAO;EAEX;EACA,OAAO;CACT;CAEA,IAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;CACjE,IAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;CAEjD,IAAM,gBAAgB,KAAK,KAAK,YAAY;EAC1C,IAAI,QAAQ,KACV,OAAO;EAGT,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,OAAO;OACF,IAAI,QAAQ,mBACjB,MAAM;OAEN,MAAM;EAIV,IAAI,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC,WAAW,KACxC,IAAI,QAAQ,mBACV,OAAO;OAEP,MAAM;EAIV,MAAM,wBAAQ,IAAI,IAAI;EACtB,IAAI,IAAI;EACR,KAAK,MAAM,KAAK,KACd,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MACvC,KAAK,SAAS,IAAI,GAAG,OAAO;OACvB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAC9C,KAAK,QAAQ,IAAI,GAAG,OAAO;OAE3B,MAAM,IAAI,EAAE,MAAM;EAItB,IAAI,MAAM,OAAO,GACf,OAAO;EAGT,IAAI;EACJ,IAAI,MAAM,IAAI;GACZ,WAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;GAChD,IAAI,WAAW,GACb,OAAO;QACF,IAAI,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OACpE,OAAO;EAEX;EAGA,KAAK,MAAM,MAAM,OAAO;GACtB,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,IAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAC1C,OAAO;GAGT,KAAK,MAAM,KAAK,KACd,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GACnC,OAAO;GAIX,OAAO;EACT;EAEA,IAAI,QAAQ;EACZ,IAAI,UAAU;EAGd,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;EAC5C,IAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;EAE5C,IAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,OAAO,GACxD,eAAe;EAGjB,KAAK,MAAM,KAAK,KAAK;GACnB,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,WAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;GAC5D,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,SAAS,SAAS,IAAI,GAAG,OAAO;KAChC,IAAI,WAAW,KAAK,WAAW,IAC7B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,IAAI;IACN,IAAI;SACE,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAClC,eAAe;IAAA;IAGnB,IAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;KAC7C,QAAQ,QAAQ,IAAI,GAAG,OAAO;KAC9B,IAAI,UAAU,KAAK,UAAU,IAC3B,OAAO;IAEX,OAAO,IAAI,GAAG,aAAa,QAAQ,CAAC,EAAE,KAAK,GAAG,MAAM,GAClD,OAAO;GAEX;GACA,IAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAC5C,OAAO;EAEX;EAKA,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAGT,IAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GACxC,OAAO;EAMT,IAAI,gBAAgB,cAClB,OAAO;EAGT,OAAO;CACT;CAGA,IAAM,YAAY,GAAG,GAAG,YAAY;EAClC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAGA,IAAM,WAAW,GAAG,GAAG,YAAY;EACjC,IAAI,CAAC,GACH,OAAO;EAET,MAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;EAChD,OAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;CACN;CAEA,OAAO,UAAU;;;;;CCrPjB,IAAM,aAAA,WAAA;CACN,IAAM,YAAA,kBAAA;CACN,IAAM,SAAA,iBAAA;CACN,IAAM,cAAA,oBAAA;CAuCN,OAAO,UAAU;EACf,OAvCI,cAuCJ;EACA,OAvCI,gBAuCJ;EACA,OAvCI,cAuCJ;EACA,KAvCI,YAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,OAvCI,cAuCJ;EACA,YAvCI,mBAuCJ;EACA,SAvCI,gBAuCJ;EACA,UAvCI,iBAuCJ;EACA,cAvCI,sBAuCJ;EACA,cAvCI,sBAuCJ;EACA,MAvCI,aAuCJ;EACA,OAvCI,cAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,IAvCI,WAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,QAvCI,eAuCJ;EACA,UAvCI,iBAuCJ;EACA,YAvCI,mBAuCJ;EACA,OAvCI,cAuCJ;EACA,WAvCI,kBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,eAvCI,uBAuCJ;EACA,YAvCI,oBAuCJ;EACA,YAvCI,cAuCJ;EACA,SAvCI,gBAuCJ;EACA,KAvCI,YAuCJ;EACA,KAvCI,YAuCJ;EACA,YAvCI,mBAuCJ;EACA,eAvCI,iBAuCJ;EACA,QAvCI,eAuCJ;EACA;EACA,IAAI,WAAW;EACf,KAAK,WAAW;EAChB,QAAQ,WAAW;EACnB,qBAAqB,UAAU;EAC/B,eAAe,UAAU;EACzB,oBAAoB,YAAY;EAChC,qBAAqB,YAAY;CACnC;;;;;CC1FA,OAAO,UAFD,eAEW,CAAA,CAAO,UAAU,QAAQ,SAAS,UAAU;;;;;CCA7D,OAAO,UAFD,eAEW,CAAA,CAAO,UAAU,QAAQ,SAAS,UAAU;;;;;CCF7D,IAAM,mCAAA,sCAAA;CACN,IAAM,gCAAA,kCAAA;CAEN,IAAM,2BAA2B;EAC/B,MAAM;GAAC;GAAS;GAAS;EAAO;EAChC,OAAO;GAAC;GAAS;GAAS;GAAS;GAAS;GAAS;EAAO;EAC5D,WAAW;GAAC;GAAS;GAAS;EAAO;CACvC;CAEA,IAAM,gBAAgB;EACpB,OAAO;EACP,OAAO;EACP,OAAO;CACT;CAEA,OAAO,UAAU,SAAS,WAAW,KAAK;EACxC,IAAI,CAAC,aAAa,CAAC,KAAK;EAExB,MAAM,UAAU,IAAI;EACpB,IAAI,CAAC,SAAS;EAEd,MAAM,oBAAoB,yBAAyB;EAEnD,IAAI,CAAC,mBACH,MAAM,IAAI,MAAM,qBAAqB,QAAQ,GAAG;EAGlD,IAAI,CAAC,kBAAkB,SAAS,SAAS,GACvC,MAAM,IAAI,MAAM,wBAAwB,QAAQ,6BAA6B,kBAAkB,KAAK,IAAI,EAAE,EAAE;;EAU9G,IAAI,kCACF,QAAQ,SAAR;GACA,KAAK;IACH,MAAM,WAAW,IAAI,qBAAqB;IAC1C,MAAM,eAAe,cAAc;IAEnC,IAAI,aAAa,cACf,MAAM,IAAI,MAAM,oBAAoB,UAAU,oBAAoB,aAAa,GAAG;IAEpF;GAEF,KAAK;IACH,IAAI,+BAA+B;KACjC,MAAM,SAAS,SAAS,UAAU,MAAM,EAAE,GAAG,EAAE;KAC/C,MAAM,EAAE,eAAe,mBAAmB,eAAe,IAAI;KAE7D,IAAI,kBAAkB,MAAM,YAAY,sBAAsB,eAC5D,MAAM,IAAI,MAAM,gGAAgG,UAAU,EAAE;KAG9H,IAAI,eAAe,KAAA,KAAa,aAAa,UAAU,GACrD,MAAM,IAAI,MAAM,4GAA4G,UAAU,EAAE;IAE5I;IACA;EACF;CAEJ;;;;;CC/DA,OAAO,UAFH,eAEa,CAAA,CAAO,UAAU,QAAQ,SAAS,oBAAoB;;;;;CCFvE,IAAM,oBAAA,0BAAA;CACN,IAAM,iBAAA,uBAAA;CACN,IAAM,oBAAA,0BAAA;CACN,IAAM,SAAA,eAAA;CACN,IAAM,WAAA,iBAAA;CACN,IAAM,wBAAA,8BAAA;CACN,IAAM,eAAA,oBAAA;CACN,IAAM,MAAA,YAAA;CACN,IAAM,EAAC,WAAA,aAAW,iBAAA,mBAAiB,iBAAA,sBAAA,UAA2B,QAAQ;CAEtE,IAAM,eAAe;EAAC;EAAS;EAAS;CAAO;CAC/C,IAAM,cAAc;EAAC;EAAS;EAAS;CAAO;CAC9C,IAAM,eAAe;EAAC;EAAS;EAAS;CAAO;CAC/C,IAAM,UAAU;EAAC;EAAS;EAAS;CAAO;CAE1C,IAAI,cAAc;EAChB,aAAa,OAAO,aAAa,QAAQ,GAAG,SAAS,SAAS,OAAO;EACrE,aAAa,OAAO,aAAa,QAAQ,GAAG,SAAS,SAAS,OAAO;CACvE;CAEA,OAAO,UAAU,SAAU,WAAW,mBAAmB,SAAS,UAAU;EAC1E,IAAK,OAAO,YAAY,cAAe,CAAC,UAAU;GAChD,WAAW;GACX,UAAU,CAAC;EACb;EAEA,IAAI,CAAC,SACH,UAAU,CAAC;EAIb,UAAU,OAAO,OAAO,CAAC,GAAG,OAAO;EAEnC,IAAI;EAEJ,IAAI,UACF,OAAO;OAEP,OAAO,SAAS,KAAK,MAAM;GACzB,IAAI,KAAK,MAAM;GACf,OAAO;EACT;EAGF,IAAI,QAAQ,kBAAkB,OAAO,QAAQ,mBAAmB,UAC9D,OAAO,KAAK,IAAI,kBAAkB,iCAAiC,CAAC;EAGtE,IAAI,QAAQ,UAAU,KAAA,MAAc,OAAO,QAAQ,UAAU,YAAY,QAAQ,MAAM,KAAK,MAAM,KAChG,OAAO,KAAK,IAAI,kBAAkB,kCAAkC,CAAC;EAGvE,IAAI,QAAQ,mCAAmC,KAAA,KAAa,OAAO,QAAQ,mCAAmC,WAC5G,OAAO,KAAK,IAAI,kBAAkB,kDAAkD,CAAC;EAGvF,MAAM,iBAAiB,QAAQ,kBAAkB,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;EAE7E,IAAI,CAAC,WACH,OAAO,KAAK,IAAI,kBAAkB,sBAAsB,CAAC;EAG3D,IAAI,OAAO,cAAc,UACvB,OAAO,KAAK,IAAI,kBAAkB,sBAAsB,CAAC;EAG3D,MAAM,QAAQ,UAAU,MAAM,GAAG;EAEjC,IAAI,MAAM,WAAW,GACnB,OAAO,KAAK,IAAI,kBAAkB,eAAe,CAAC;EAGpD,IAAI;EAEJ,IAAI;GACF,eAAe,OAAO,WAAW,EAAE,UAAU,KAAK,CAAC;EACrD,SAAQ,KAAK;GACX,OAAO,KAAK,GAAG;EACjB;EAEA,IAAI,CAAC,cACH,OAAO,KAAK,IAAI,kBAAkB,eAAe,CAAC;EAGpD,MAAM,SAAS,aAAa;EAC5B,IAAI;EAEJ,IAAG,OAAO,sBAAsB,YAAY;GAC1C,IAAG,CAAC,UACF,OAAO,KAAK,IAAI,kBAAkB,sFAAsF,CAAC;GAG3H,YAAY;EACd,OAEE,YAAY,SAAS,QAAQ,gBAAgB;GAC3C,OAAO,eAAe,MAAM,iBAAiB;EAC/C;EAGF,OAAO,UAAU,QAAQ,SAAS,KAAK,mBAAmB;GACxD,IAAG,KACD,OAAO,KAAK,IAAI,kBAAkB,6CAA6C,IAAI,OAAO,CAAC;GAG7F,MAAM,eAAe,MAAM,EAAE,CAAC,KAAK,MAAM;GAEzC,IAAI,CAAC,gBAAgB,mBACnB,OAAO,KAAK,IAAI,kBAAkB,2BAA2B,CAAC;GAGhE,IAAI,gBAAgB,CAAC,mBACnB,OAAO,KAAK,IAAI,kBAAkB,uCAAuC,CAAC;GAG5E,IAAI,CAAC,gBAAgB,CAAC,QAAQ,YAC5B,OAAO,KAAK,IAAI,kBAAkB,qEAAiE,CAAC;GAGtG,IAAI,qBAAqB,QAAQ,EAAE,6BAA6BE,cAC9D,IAAI;IACF,oBAAoBC,kBAAgB,iBAAiB;GACvD,SAAS,GAAG;IACV,IAAI;KACF,oBAAoBC,kBAAgB,OAAO,sBAAsB,WAAW,OAAO,KAAK,iBAAiB,IAAI,iBAAiB;IAChI,SAAS,GAAG;KACV,OAAO,KAAK,IAAI,kBAAkB,6CAA6C,CAAC;IAClF;GACF;GAGF,IAAI,CAAC,QAAQ,YACX,IAAI,kBAAkB,SAAS,UAC7B,QAAQ,aAAa;QAChB,IAAI,CAAC,OAAO,SAAS,CAAC,CAAC,SAAS,kBAAkB,iBAAiB,GACxE,QAAQ,aAAa;QAChB,IAAI,kBAAkB,sBAAsB,MACjD,QAAQ,aAAa;QAErB,QAAQ,aAAa;GAIzB,IAAI,QAAQ,WAAW,QAAQ,aAAa,OAAO,GAAG,MAAM,IAC1D,OAAO,KAAK,IAAI,kBAAkB,mBAAmB,CAAC;GAGxD,IAAI,OAAO,IAAI,WAAW,IAAI,KAAK,kBAAkB,SAAS,UAC5D,OAAO,KAAK,IAAI,kBAAmB,wDAAwD,OAAO,KAAM,CAAC;QACpG,IAAI,gBAAgB,KAAK,OAAO,GAAG,KAAK,kBAAkB,SAAS,UACxE,OAAO,KAAK,IAAI,kBAAmB,0DAA0D,OAAO,KAAM,CAAC;GAG7G,IAAI,CAAC,QAAQ,gCACX,IAAI;IACF,sBAAsB,OAAO,KAAK,iBAAiB;GACrD,SAAS,GAAG;IACV,OAAO,KAAK,CAAC;GACf;GAGF,IAAI;GAEJ,IAAI;IACF,QAAQ,IAAI,OAAO,WAAW,aAAa,OAAO,KAAK,iBAAiB;GAC1E,SAAS,GAAG;IACV,OAAO,KAAK,CAAC;GACf;GAEA,IAAI,CAAC,OACH,OAAO,KAAK,IAAI,kBAAkB,mBAAmB,CAAC;GAGxD,MAAM,UAAU,aAAa;GAE7B,IAAI,OAAO,QAAQ,QAAQ,eAAe,CAAC,QAAQ,iBAAiB;IAClE,IAAI,OAAO,QAAQ,QAAQ,UACzB,OAAO,KAAK,IAAI,kBAAkB,mBAAmB,CAAC;IAExD,IAAI,QAAQ,MAAM,kBAAkB,QAAQ,kBAAkB,IAC5D,OAAO,KAAK,IAAI,eAAe,kCAAkB,IAAI,KAAK,QAAQ,MAAM,GAAI,CAAC,CAAC;GAElF;GAEA,IAAI,OAAO,QAAQ,QAAQ,eAAe,CAAC,QAAQ,kBAAkB;IACnE,IAAI,OAAO,QAAQ,QAAQ,UACzB,OAAO,KAAK,IAAI,kBAAkB,mBAAmB,CAAC;IAExD,IAAI,kBAAkB,QAAQ,OAAO,QAAQ,kBAAkB,IAC7D,OAAO,KAAK,IAAI,kBAAkB,+BAAe,IAAI,KAAK,QAAQ,MAAM,GAAI,CAAC,CAAC;GAElF;GAEA,IAAI,QAAQ,UAAU;IACpB,MAAM,YAAY,MAAM,QAAQ,QAAQ,QAAQ,IAAI,QAAQ,WAAW,CAAC,QAAQ,QAAQ;IASxF,IAAI,EARW,MAAM,QAAQ,QAAQ,GAAG,IAAI,QAAQ,MAAM,CAAC,QAAQ,GAAG,EAAA,CAEjD,KAAK,SAAU,gBAAgB;KAClD,OAAO,UAAU,KAAK,SAAU,UAAU;MACxC,OAAO,oBAAoB,SAAS,SAAS,KAAK,cAAc,IAAI,aAAa;KACnF,CAAC;IACH,CAES,GACP,OAAO,KAAK,IAAI,kBAAkB,qCAAqC,UAAU,KAAK,MAAM,CAAC,CAAC;GAElG;GAEA,IAAI,QAAQ;QAED,OAAO,QAAQ,WAAW,YAAY,QAAQ,QAAQ,QAAQ,UAC9D,MAAM,QAAQ,QAAQ,MAAM,KAAK,QAAQ,OAAO,QAAQ,QAAQ,GAAG,MAAM,IAGhF,OAAO,KAAK,IAAI,kBAAkB,mCAAmC,QAAQ,MAAM,CAAC;GAAA;GAIxF,IAAI,QAAQ;QACN,QAAQ,QAAQ,QAAQ,SAC1B,OAAO,KAAK,IAAI,kBAAkB,oCAAoC,QAAQ,OAAO,CAAC;GAAA;GAI1F,IAAI,QAAQ;QACN,QAAQ,QAAQ,QAAQ,OAC1B,OAAO,KAAK,IAAI,kBAAkB,kCAAkC,QAAQ,KAAK,CAAC;GAAA;GAItF,IAAI,QAAQ;QACN,QAAQ,UAAU,QAAQ,OAC5B,OAAO,KAAK,IAAI,kBAAkB,kCAAkC,QAAQ,KAAK,CAAC;GAAA;GAItF,IAAI,QAAQ,QAAQ;IAClB,IAAI,OAAO,QAAQ,QAAQ,UACzB,OAAO,KAAK,IAAI,kBAAkB,uCAAuC,CAAC;IAG5E,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ,GAAG;IAC5D,IAAI,OAAO,oBAAoB,aAC7B,OAAO,KAAK,IAAI,kBAAkB,oGAA8F,CAAC;IAEnI,IAAI,kBAAkB,mBAAmB,QAAQ,kBAAkB,IACjE,OAAO,KAAK,IAAI,kBAAkB,mCAAmB,IAAI,KAAK,kBAAkB,GAAI,CAAC,CAAC;GAE1F;GAEA,IAAI,QAAQ,aAAa,MAAM;IAC7B,MAAM,YAAY,aAAa;IAE/B,OAAO,KAAK,MAAM;KACR;KACC;KACE;IACb,CAAC;GACH;GAEA,OAAO,KAAK,MAAM,OAAO;EAC3B,CAAC;CACH;;;;;;;;;;;;;;CC5PA,IAAI,WAAW;KACX,mBAAmB;KACnB,cAAc;KACd,MAAM;;CAGV,IAAI,UAAU;KACV,UAAU;KACV,SAAS;KACT,YAAY;KACZ,YAAY;;CAGhB,IAAI,SAAS;;CAGb,IAAI,aAAa;;CAGjB,IAAI,aAAa;;CAGjB,IAAI,YAAY;;CAGhB,IAAI,WAAW;;CAGf,IAAI,eAAe;;;;;;;;;;CAWnB,SAAS,SAAS,OAAO,UAAU;EACjC,IAAI,QAAQ,IACR,SAAS,QAAQ,MAAM,SAAS,GAChC,SAAS,MAAM,MAAM;EAEzB,OAAO,EAAE,QAAQ,QACf,OAAO,SAAS,SAAS,MAAM,QAAQ,OAAO,KAAK;EAErD,OAAO;CACT;;;;;;;;;;;;CAaA,SAAS,cAAc,OAAO,WAAW,WAAW,WAAW;EAC7D,IAAI,SAAS,MAAM,QACf,QAAQ,aAAa,YAAY,IAAI;EAEzC,OAAQ,YAAY,UAAU,EAAE,QAAQ,QACtC,IAAI,UAAU,MAAM,QAAQ,OAAO,KAAK,GACtC,OAAO;EAGX,OAAO;CACT;;;;;;;;;;CAWA,SAAS,YAAY,OAAO,OAAO,WAAW;EAC5C,IAAI,UAAU,OACZ,OAAO,cAAc,OAAO,WAAW,SAAS;EAElD,IAAI,QAAQ,YAAY,GACpB,SAAS,MAAM;EAEnB,OAAO,EAAE,QAAQ,QACf,IAAI,MAAM,WAAW,OACnB,OAAO;EAGX,OAAO;CACT;;;;;;;;CASA,SAAS,UAAU,OAAO;EACxB,OAAO,UAAU;CACnB;;;;;;;;;;CAWA,SAAS,UAAU,GAAG,UAAU;EAC9B,IAAI,QAAQ,IACR,SAAS,MAAM,CAAC;EAEpB,OAAO,EAAE,QAAQ,GACf,OAAO,SAAS,SAAS,KAAK;EAEhC,OAAO;CACT;;;;;;;;;;;CAYA,SAAS,WAAW,QAAQ,OAAO;EACjC,OAAO,SAAS,OAAO,SAAS,KAAK;GACnC,OAAO,OAAO;EAChB,CAAC;CACH;;;;;;;;;CAUA,SAAS,QAAQ,MAAM,WAAW;EAChC,OAAO,SAAS,KAAK;GACnB,OAAO,KAAK,UAAU,GAAG,CAAC;EAC5B;CACF;;CAGA,IAAI,cAAc,OAAO;;CAGzB,IAAI,iBAAiB,YAAY;;;;;;CAOjC,IAAI,iBAAiB,YAAY;;CAGjC,IAAI,uBAAuB,YAAY;CAGvC,IAAI,aAAa,QAAQ,OAAO,MAAM,MAAM;KACxC,YAAY,KAAK;;;;;;;;;CAUrB,SAAS,cAAc,OAAO,WAAW;EAGvC,IAAI,SAAU,QAAQ,KAAK,KAAK,YAAY,KAAK,IAC7C,UAAU,MAAM,QAAQ,MAAM,IAC9B,CAAC;EAEL,IAAI,SAAS,OAAO,QAChB,cAAc,CAAC,CAAC;EAEpB,KAAK,IAAI,OAAO,OACd,KAAK,aAAa,eAAe,KAAK,OAAO,GAAG,MAC5C,EAAE,gBAAgB,OAAO,YAAY,QAAQ,KAAK,MAAM,KAC1D,OAAO,KAAK,GAAG;EAGnB,OAAO;CACT;;;;;;;;CASA,SAAS,SAAS,QAAQ;EACxB,IAAI,CAAC,YAAY,MAAM,GACrB,OAAO,WAAW,MAAM;EAE1B,IAAI,SAAS,CAAC;EACd,KAAK,IAAI,OAAO,OAAO,MAAM,GAC3B,IAAI,eAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,eAC7C,OAAO,KAAK,GAAG;EAGnB,OAAO;CACT;;;;;;;;;CAUA,SAAS,QAAQ,OAAO,QAAQ;EAC9B,SAAS,UAAU,OAAO,mBAAmB;EAC7C,OAAO,CAAC,CAAC,WACN,OAAO,SAAS,YAAY,SAAS,KAAK,KAAK,MAC/C,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQ;CAC7C;;;;;;;;CASA,SAAS,YAAY,OAAO;EAC1B,IAAI,OAAO,SAAS,MAAM;EAG1B,OAAO,WAFM,OAAO,QAAQ,cAAc,KAAK,aAAc;CAG/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgCA,SAAS,SAAS,YAAY,OAAO,WAAW,OAAO;EACrD,aAAa,YAAY,UAAU,IAAI,aAAa,OAAO,UAAU;EACrE,YAAa,aAAa,CAAC,QAAS,UAAU,SAAS,IAAI;EAE3D,IAAI,SAAS,WAAW;EACxB,IAAI,YAAY,GACd,YAAY,UAAU,SAAS,WAAW,CAAC;EAE7C,OAAO,SAAS,UAAU,IACrB,aAAa,UAAU,WAAW,QAAQ,OAAO,SAAS,IAAI,KAC9D,CAAC,CAAC,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;CAC/D;;;;;;;;;;;;;;;;;;;CAoBA,SAAS,YAAY,OAAO;EAE1B,OAAO,kBAAkB,KAAK,KAAK,eAAe,KAAK,OAAO,QAAQ,MACnE,CAAC,qBAAqB,KAAK,OAAO,QAAQ,KAAK,eAAe,KAAK,KAAK,KAAK;CAClF;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,IAAI,UAAU,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BpB,SAAS,YAAY,OAAO;EAC1B,OAAO,SAAS,QAAQ,SAAS,MAAM,MAAM,KAAK,CAAC,WAAW,KAAK;CACrE;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAAS,kBAAkB,OAAO;EAChC,OAAO,aAAa,KAAK,KAAK,YAAY,KAAK;CACjD;;;;;;;;;;;;;;;;;;CAmBA,SAAS,WAAW,OAAO;EAGzB,IAAI,MAAM,SAAS,KAAK,IAAI,eAAe,KAAK,KAAK,IAAI;EACzD,OAAO,OAAO,WAAW,OAAO;CAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAAS;CAC7C;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,OAAO;EAClB,OAAO,CAAC,CAAC,UAAU,QAAQ,YAAY,QAAQ;CACjD;;;;;;;;;;;;;;;;;;;;;;;;;CA0BA,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;;CAmBA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,CAAC,QAAQ,KAAK,KAAK,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC7E;;;;;;;;;;;;;;;;;;CAmBA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC1D;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,CAAC,OACH,OAAO,UAAU,IAAI,QAAQ;EAE/B,QAAQ,SAAS,KAAK;EACtB,IAAI,UAAU,YAAY,UAAU,WAElC,QADY,QAAQ,IAAI,KAAK,KACf;EAEhB,OAAO,UAAU,QAAQ,QAAQ;CACnC;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BA,SAAS,UAAU,OAAO;EACxB,IAAI,SAAS,SAAS,KAAK,GACvB,YAAY,SAAS;EAEzB,OAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;CACzE;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,SAAS,UAClB,OAAO;EAET,IAAI,SAAS,KAAK,GAChB,OAAO;EAET,IAAI,SAAS,KAAK,GAAG;GACnB,IAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAQ,IAAI;GACnE,QAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;EAC3C;EACA,IAAI,OAAO,SAAS,UAClB,OAAO,UAAU,IAAI,QAAQ,CAAC;EAEhC,QAAQ,MAAM,QAAQ,QAAQ,EAAE;EAChC,IAAI,WAAW,WAAW,KAAK,KAAK;EACpC,OAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;CACvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,SAAS,KAAK,QAAQ;EACpB,OAAO,YAAY,MAAM,IAAI,cAAc,MAAM,IAAI,SAAS,MAAM;CACtE;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BA,SAAS,OAAO,QAAQ;EACtB,OAAO,SAAS,WAAW,QAAQ,KAAK,MAAM,CAAC,IAAI,CAAC;CACtD;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CC9tBjB,IAAI,UAAU;;;;;CASd,IAAI,iBANc,OAAO,UAMQ;;;;;;;;;;;;;;;;;CAkBjC,SAAS,UAAU,OAAO;EACxB,OAAO,UAAU,QAAQ,UAAU,SAChC,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC1D;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CC3DjB,IAAI,WAAW;KACX,cAAc;KACd,MAAM;;CAGV,IAAI,YAAY;;CAGhB,IAAI,SAAS;;CAGb,IAAI,aAAa;;CAGjB,IAAI,aAAa;;CAGjB,IAAI,YAAY;;CAGhB,IAAI,eAAe;;;;;;CAUnB,IAAI,iBAPc,OAAO,UAOQ;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BjC,SAAS,UAAU,OAAO;EACxB,OAAO,OAAO,SAAS,YAAY,SAAS,UAAU,KAAK;CAC7D;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,OAAO;EAClB,OAAO,CAAC,CAAC,UAAU,QAAQ,YAAY,QAAQ;CACjD;;;;;;;;;;;;;;;;;;;;;;;;;CA0BA,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;;CAmBA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC1D;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,CAAC,OACH,OAAO,UAAU,IAAI,QAAQ;EAE/B,QAAQ,SAAS,KAAK;EACtB,IAAI,UAAU,YAAY,UAAU,WAElC,QADY,QAAQ,IAAI,KAAK,KACf;EAEhB,OAAO,UAAU,QAAQ,QAAQ;CACnC;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BA,SAAS,UAAU,OAAO;EACxB,IAAI,SAAS,SAAS,KAAK,GACvB,YAAY,SAAS;EAEzB,OAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;CACzE;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,SAAS,UAClB,OAAO;EAET,IAAI,SAAS,KAAK,GAChB,OAAO;EAET,IAAI,SAAS,KAAK,GAAG;GACnB,IAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAQ,IAAI;GACnE,QAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;EAC3C;EACA,IAAI,OAAO,SAAS,UAClB,OAAO,UAAU,IAAI,QAAQ,CAAC;EAEhC,QAAQ,MAAM,QAAQ,QAAQ,EAAE;EAChC,IAAI,WAAW,WAAW,KAAK,KAAK;EACpC,OAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;CACvC;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CC9PjB,IAAI,YAAY;;;;;CAShB,IAAI,iBANc,OAAO,UAMQ;;;;;;;;;;;;;;;;;;;;;;;;CAyBjC,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC1D;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CCpEjB,IAAI,YAAY;;;;;;;;CAShB,SAAS,aAAa,OAAO;EAG3B,IAAI,SAAS;EACb,IAAI,SAAS,QAAQ,OAAO,MAAM,YAAY,YAC5C,IAAI;GACF,SAAS,CAAC,EAAE,QAAQ;EACtB,SAAS,GAAG,CAAC;EAEf,OAAO;CACT;;;;;;;;;CAUA,SAAS,QAAQ,MAAM,WAAW;EAChC,OAAO,SAAS,KAAK;GACnB,OAAO,KAAK,UAAU,GAAG,CAAC;EAC5B;CACF;;CAGA,IAAI,YAAY,SAAS;KACrB,cAAc,OAAO;;CAGzB,IAAI,eAAe,UAAU;;CAG7B,IAAI,iBAAiB,YAAY;;CAGjC,IAAI,mBAAmB,aAAa,KAAK,MAAM;;;;;;CAO/C,IAAI,iBAAiB,YAAY;;CAGjC,IAAI,eAAe,QAAQ,OAAO,gBAAgB,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;CA0BxD,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8BA,SAAS,cAAc,OAAO;EAC5B,IAAI,CAAC,aAAa,KAAK,KACnB,eAAe,KAAK,KAAK,KAAK,aAAa,aAAa,KAAK,GAC/D,OAAO;EAET,IAAI,QAAQ,aAAa,KAAK;EAC9B,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,OAAO,eAAe,KAAK,OAAO,aAAa,KAAK,MAAM;EAC9D,OAAQ,OAAO,QAAQ,cACrB,gBAAgB,QAAQ,aAAa,KAAK,IAAI,KAAK;CACvD;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CChIjB,IAAI,YAAY;;;;;CAShB,IAAI,iBANc,OAAO,UAMQ;;;;;;;;;;;;;;;;;;;;;;;;CAyBjC,IAAI,UAAU,MAAM;;;;;;;;;;;;;;;;;;;;;;;;CAyBpB,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;CAkBA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,CAAC,QAAQ,KAAK,KAAK,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC7E;CAEA,OAAO,UAAU;;;;;;;;;;;;;;CCpFjB,IAAI,kBAAkB;;CAGtB,IAAI,WAAW;KACX,cAAc;KACd,MAAM;;CAGV,IAAI,YAAY;;CAGhB,IAAI,SAAS;;CAGb,IAAI,aAAa;;CAGjB,IAAI,aAAa;;CAGjB,IAAI,YAAY;;CAGhB,IAAI,eAAe;;;;;;CAUnB,IAAI,iBAPc,OAAO,UAOQ;;;;;;;;;;;;;;;;;;CAmBjC,SAAS,OAAO,GAAG,MAAM;EACvB,IAAI;EACJ,IAAI,OAAO,QAAQ,YACjB,MAAM,IAAI,UAAU,eAAe;EAErC,IAAI,UAAU,CAAC;EACf,OAAO,WAAW;GAChB,IAAI,EAAE,IAAI,GACR,SAAS,KAAK,MAAM,MAAM,SAAS;GAErC,IAAI,KAAK,GACP,OAAO,KAAA;GAET,OAAO;EACT;CACF;;;;;;;;;;;;;;;;;;;CAoBA,SAAS,KAAK,MAAM;EAClB,OAAO,OAAO,GAAG,IAAI;CACvB;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,OAAO;EAClB,OAAO,CAAC,CAAC,UAAU,QAAQ,YAAY,QAAQ;CACjD;;;;;;;;;;;;;;;;;;;;;;;;;CA0BA,SAAS,aAAa,OAAO;EAC3B,OAAO,CAAC,CAAC,SAAS,OAAO,SAAS;CACpC;;;;;;;;;;;;;;;;;;CAmBA,SAAS,SAAS,OAAO;EACvB,OAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK;CAC1D;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,CAAC,OACH,OAAO,UAAU,IAAI,QAAQ;EAE/B,QAAQ,SAAS,KAAK;EACtB,IAAI,UAAU,YAAY,UAAU,WAElC,QADY,QAAQ,IAAI,KAAK,KACf;EAEhB,OAAO,UAAU,QAAQ,QAAQ;CACnC;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4BA,SAAS,UAAU,OAAO;EACxB,IAAI,SAAS,SAAS,KAAK,GACvB,YAAY,SAAS;EAEzB,OAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;CACzE;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,SAAS,SAAS,OAAO;EACvB,IAAI,OAAO,SAAS,UAClB,OAAO;EAET,IAAI,SAAS,KAAK,GAChB,OAAO;EAET,IAAI,SAAS,KAAK,GAAG;GACnB,IAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAQ,IAAI;GACnE,QAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;EAC3C;EACA,IAAI,OAAO,SAAS,UAClB,OAAO,UAAU,IAAI,QAAQ,CAAC;EAEhC,QAAQ,MAAM,QAAQ,QAAQ,EAAE;EAChC,IAAI,WAAW,WAAW,KAAK,KAAK;EACpC,OAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;CACvC;CAEA,OAAO,UAAU;;;;;CCrSjB,IAAM,WAAA,iBAAA;CACN,IAAM,eAAA,oBAAA;CACN,IAAM,wBAAA,8BAAA;CACN,IAAM,MAAA,YAAA;CACN,IAAM,WAAA,wBAAA;CACN,IAAM,YAAA,yBAAA;CACN,IAAM,YAAA,yBAAA;CACN,IAAM,WAAA,wBAAA;CACN,IAAM,gBAAA,6BAAA;CACN,IAAM,WAAA,wBAAA;CACN,IAAM,OAAA,oBAAA;CACN,IAAM,EAAE,WAAW,iBAAiB,kBAAA,uBAAA,UAA6B,QAAQ;CAEzE,IAAM,iBAAiB;EAAC;EAAS;EAAS;EAAS;EAAS;EAAS;EAAS;EAAS;EAAS;EAAS;CAAM;CAC/G,IAAI,cACF,eAAe,OAAO,GAAG,GAAG,SAAS,SAAS,OAAO;CAGvD,IAAM,sBAAsB;EAC1B,WAAW;GAAE,SAAS,SAAS,OAAO;IAAE,OAAO,UAAU,KAAK,KAAM,SAAS,KAAK,KAAK;GAAQ;GAAG,SAAS;EAA8E;EACzL,WAAW;GAAE,SAAS,SAAS,OAAO;IAAE,OAAO,UAAU,KAAK,KAAM,SAAS,KAAK,KAAK;GAAQ;GAAG,SAAS;EAA8E;EACzL,UAAU;GAAE,SAAS,SAAS,OAAO;IAAE,OAAO,SAAS,KAAK,KAAK,MAAM,QAAQ,KAAK;GAAG;GAAG,SAAS;EAAuC;EAC1I,WAAW;GAAE,SAAS,SAAS,KAAK,MAAM,cAAc;GAAG,SAAS;EAAgD;EACpH,QAAQ;GAAE,SAAS;GAAe,SAAS;EAA6B;EACxE,UAAU;GAAE,SAAS;GAAU,SAAS;EAA8B;EACtE,QAAQ;GAAE,SAAS;GAAU,SAAS;EAA4B;EAClE,SAAS;GAAE,SAAS;GAAU,SAAS;EAA6B;EACpE,OAAO;GAAE,SAAS;GAAU,SAAS;EAA2B;EAChE,aAAa;GAAE,SAAS;GAAW,SAAS;EAAkC;EAC9E,OAAO;GAAE,SAAS;GAAU,SAAS;EAA2B;EAChE,eAAe;GAAE,SAAS;GAAW,SAAS;EAAoC;EAClF,uBAAuB;GAAE,SAAS;GAAW,SAAS;EAA2C;EACjG,gCAAgC;GAAE,SAAS;GAAW,SAAS;EAAoD;CACrH;CAEA,IAAM,2BAA2B;EAC/B,KAAK;GAAE,SAAS;GAAU,SAAS;EAAsC;EACzE,KAAK;GAAE,SAAS;GAAU,SAAS;EAAsC;EACzE,KAAK;GAAE,SAAS;GAAU,SAAS;EAAsC;CAC3E;CAEA,SAAS,SAAS,QAAQ,cAAc,QAAQ,eAAe;EAC7D,IAAI,CAAC,cAAc,MAAM,GACvB,MAAM,IAAI,MAAM,gBAAe,gBAAgB,0BAAyB;EAE1E,OAAO,KAAK,MAAM,CAAC,CAChB,QAAQ,SAAS,KAAK;GACrB,MAAM,YAAY,OAAO;GACzB,IAAI,CAAC,WAAW;IACd,IAAI,CAAC,cACH,MAAM,IAAI,MAAM,OAAM,MAAM,4BAA0B,gBAAgB,IAAG;IAE3E;GACF;GACA,IAAI,CAAC,UAAU,QAAQ,OAAO,IAAI,GAChC,MAAM,IAAI,MAAM,UAAU,OAAO;EAErC,CAAC;CACL;CAEA,SAAS,gBAAgB,SAAS;EAChC,OAAO,SAAS,qBAAqB,OAAO,SAAS,SAAS;CAChE;CAEA,SAAS,gBAAgB,SAAS;EAChC,OAAO,SAAS,0BAA0B,MAAM,SAAS,SAAS;CACpE;CAEA,IAAM,qBAAqB;EACzB,YAAY;EACZ,UAAU;EACV,WAAW;EACX,SAAS;CACX;CAEA,IAAM,sBAAsB;EAC1B;EACA;EACA;EACA;EACA;EACA;EACA;CACF;CAEA,OAAO,UAAU,SAAU,SAAS,oBAAoB,SAAS,UAAU;EACzE,IAAI,OAAO,YAAY,YAAY;GACjC,WAAW;GACX,UAAU,CAAC;EACb,OACE,UAAU,WAAW,CAAC;EAGxB,MAAM,kBAAkB,OAAO,YAAY,YACrB,CAAC,OAAO,SAAS,OAAO;EAE9C,MAAM,SAAS,OAAO,OAAO;GAC3B,KAAK,QAAQ,aAAa;GAC1B,KAAK,kBAAkB,QAAQ,KAAA;GAC/B,KAAK,QAAQ;EACf,GAAG,QAAQ,MAAM;EAEjB,SAAS,QAAQ,KAAK;GACpB,IAAI,UACF,OAAO,SAAS,GAAG;GAErB,MAAM;EACR;EAEA,IAAI,CAAC,sBAAsB,QAAQ,cAAc,QAC/C,OAAO,wBAAQ,IAAI,MAAM,sCAAsC,CAAC;EAGlE,IAAI,sBAAsB,QAAQ,EAAE,8BAA8B,YAChE,IAAI;GACF,qBAAqBC,mBAAiB,kBAAkB;EAC1D,SAAS,GAAG;GACV,IAAI;IACF,qBAAqB,gBAAgB,OAAO,uBAAuB,WAAW,OAAO,KAAK,kBAAkB,IAAI,kBAAkB;GACpI,SAAS,GAAG;IACV,OAAO,wBAAQ,IAAI,MAAM,8CAA8C,CAAC;GAC1E;EACF;EAGF,IAAI,OAAO,IAAI,WAAW,IAAI,KAAK,mBAAmB,SAAS,UAC7D,OAAO,wBAAQ,IAAI,MAAO,yDAAyD,OAAO,KAAM,CAAC;OAC5F,IAAI,gBAAgB,KAAK,OAAO,GAAG,GAAG;GAC3C,IAAI,mBAAmB,SAAS,WAC9B,OAAO,wBAAQ,IAAI,MAAO,2DAA2D,OAAO,KAAM,CAAC;GAErG,IAAI,CAAC,QAAQ,yBACX,CAAC,OAAO,IAAI,WAAW,IAAI,KAC3B,mBAAmB,yBAAyB,KAAA,KAC5C,mBAAmB,qBAAqB,gBAAgB,MACxD,OAAO,wBAAQ,IAAI,MAAM,8DAA8D,OAAO,KAAK,CAAC;EAExG;EAEA,IAAI,OAAO,YAAY,aACrB,OAAO,wBAAQ,IAAI,MAAM,qBAAqB,CAAC;OAC1C,IAAI,iBAAiB;GAC1B,IAAI;IACF,gBAAgB,OAAO;GACzB,SACO,OAAO;IACZ,OAAO,QAAQ,KAAK;GACtB;GACA,IAAI,CAAC,QAAQ,eACX,UAAU,OAAO,OAAO,CAAC,GAAE,OAAO;EAEtC,OAAO;GACL,MAAM,kBAAkB,oBAAoB,OAAO,SAAU,KAAK;IAChE,OAAO,OAAO,QAAQ,SAAS;GACjC,CAAC;GAED,IAAI,gBAAgB,SAAS,GAC3B,OAAO,wBAAQ,IAAI,MAAM,aAAa,gBAAgB,KAAK,GAAG,IAAI,iBAAkB,OAAO,UAAY,UAAU,CAAC;EAEtH;EAEA,IAAI,OAAO,QAAQ,QAAQ,eAAe,OAAO,QAAQ,cAAc,aACrE,OAAO,wBAAQ,IAAI,MAAM,+EAA2E,CAAC;EAGvG,IAAI,OAAO,QAAQ,QAAQ,eAAe,OAAO,QAAQ,cAAc,aACrE,OAAO,wBAAQ,IAAI,MAAM,+EAA2E,CAAC;EAGvG,IAAI;GACF,gBAAgB,OAAO;EACzB,SACO,OAAO;GACZ,OAAO,QAAQ,KAAK;EACtB;EAEA,IAAI,CAAC,QAAQ,gCACX,IAAI;GACF,sBAAsB,OAAO,KAAK,kBAAkB;EACtD,SAAS,OAAO;GACd,OAAO,QAAQ,KAAK;EACtB;EAGF,MAAM,YAAY,QAAQ,OAAO,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;EAE7D,IAAI,QAAQ,aACV,OAAO,QAAQ;OACV,IAAI,iBACT,QAAQ,MAAM;EAGhB,IAAI,OAAO,QAAQ,cAAc,aAAa;GAC5C,IAAI;IACF,QAAQ,MAAM,SAAS,QAAQ,WAAW,SAAS;GACrD,SACO,KAAK;IACV,OAAO,QAAQ,GAAG;GACpB;GACA,IAAI,OAAO,QAAQ,QAAQ,aACzB,OAAO,wBAAQ,IAAI,MAAM,uGAAiG,CAAC;EAE/H;EAEA,IAAI,OAAO,QAAQ,cAAc,eAAe,OAAO,YAAY,UAAU;GAC3E,IAAI;IACF,QAAQ,MAAM,SAAS,QAAQ,WAAW,SAAS;GACrD,SACO,KAAK;IACV,OAAO,QAAQ,GAAG;GACpB;GACA,IAAI,OAAO,QAAQ,QAAQ,aACzB,OAAO,wBAAQ,IAAI,MAAM,uGAAiG,CAAC;EAE/H;EAEA,OAAO,KAAK,kBAAkB,CAAC,CAAC,QAAQ,SAAU,KAAK;GACrD,MAAM,QAAQ,mBAAmB;GACjC,IAAI,OAAO,QAAQ,SAAS,aAAa;IACvC,IAAI,OAAO,QAAQ,WAAW,aAC5B,OAAO,wBAAQ,IAAI,MAAM,mBAAkB,MAAM,6CAA2C,QAAQ,cAAa,CAAC;IAEpH,QAAQ,SAAS,QAAQ;GAC3B;EACF,CAAC;EAED,MAAM,WAAW,QAAQ,YAAY;EAErC,IAAI,OAAO,aAAa,YAAY;GAClC,WAAW,YAAY,KAAK,QAAQ;GAEpC,IAAI,WAAW;IACL;IACR,YAAY;IACH;IACC;GACZ,CAAC,CAAC,CAAC,KAAK,SAAS,QAAQ,CAAC,CACvB,KAAK,QAAQ,SAAU,WAAW;IAEjC,IAAG,CAAC,QAAQ,yBAAyB,aAAa,KAAK,OAAO,GAAG,KAAK,UAAU,SAAS,KACvF,OAAO,yBAAS,IAAI,MAAM,8DAA8D,OAAO,KAAK,CAAC;IAEvG,SAAS,MAAM,SAAS;GAC1B,CAAC;EACL,OAAO;GACL,IAAI,YAAY,IAAI,KAAK;IAAS;IAAiB;IAAS,QAAQ;IAA8B;GAAQ,CAAC;GAE3G,IAAG,CAAC,QAAQ,yBAAyB,aAAa,KAAK,OAAO,GAAG,KAAK,UAAU,SAAS,KACvF,MAAM,IAAI,MAAM,8DAA8D,OAAO,KAAK;GAE5F,OAAO;EACT;CACF;;;;;CC5PA,OAAO,UAAU;EACf,QAAA,eAAA;EACA,QAAA,eAAA;EACA,MAAA,aAAA;EACA,mBAAA,0BAAA;EACA,gBAAA,uBAAA;EACA,mBAAA,0BAAA;CACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC8BA,IAAa,yBAAyB;;;;;AAMtC,IAAa,yBAAb,cAA4C,MAAM;CAC9C,YAAY,SAAiB;EACzB,MAAM,OAAO;EACb,KAAK,OAAO;CAChB;AACJ;;;;;;;;;;;;;;;;AAiBA,SAAgB,oBAAoB,QAAwB;CACxD,IAAI,OAAO,SAAS,IAAI,GACpB,MAAM,IAAI,uBAAuB,mCAAmC;CAExE,IAAI,OAAO,SAAA,MACP,MAAM,IAAI,uBACN,6CAA6C,uBAAuB,aACxE;CAQJ,IAAI,OAAO,MAAM,OAAO,CAAC,CAAC,MAAM,YAAY,YAAY,IAAI,GACxD,MAAM,IAAI,uBACN,8EACJ;CAGJ,MAAM,wBAAwB,OAAO,QAAQ,QAAQ,EAAE;CACvD,IAAI,0BAA0B,IAAI,OAAO;CAYzC,MAAM,mBAAmB,eAAe,KAAK,qBAAqB;CAIlE,MAAM,aAAa,KAAK,MAAM,UAAU,qBAAqB;CAG7D,IAAI,eAAe,OAAO,eAAe,MAAM,OAAO;CAGtD,MAAM,MAAM,WAAW,QAAQ,SAAS,EAAE,CAAC,CAAC,QAAQ,QAAQ,EAAE;CAC9D,IAAI,QAAQ,IAAI,OAAO;CACvB,OAAO,oBAAoB,CAAC,IAAI,SAAS,GAAG,IAAI,GAAG,IAAI,KAAK;AAChE;;;;;;;;AASA,SAAgB,uBAAuB,QAA+B;CAClE,IAAI;EACA,OAAO,oBAAoB,MAAM;CACrC,QAAQ;EACJ,OAAO;CACX;AACJ;;;;;;;;;;;;;;;;;AAkBA,SAAgB,mBAAmB,cAAiD;CAChF,IAAI,iBAAiB,KAAA,KAAa,iBAAiB,MAAM,OAAO;CAChE,MAAM,UAAU,aAAa,KAAK;CAClC,OAAO,YAAY,KAAK,6BAA6B;AACzD;;AASA,IAAa,4BAAb,cAA+C,MAAM;CACjD,YAAY,SAAiB;EACzB,MAAM,OAAO;EACb,KAAK,OAAO;CAChB;AACJ;;;;;;;AAQA,IAAM,yBAAyB;;;;;;;;;;;;;;;;;;;;;;;;AAyB/B,SAAgB,uBAAuB,WAA0D;CAC7F,IAAI,cAAc,KAAA,KAAa,cAAc,QAAQ,cAAc,IAAI,OAAO,KAAA;CAC9E,IAAI,UAAU,SAAA,IACV,MAAM,IAAI,0BACN,6DACJ;CAEJ,IAAI,CAAC,uBAAuB,KAAK,SAAS,GACtC,MAAM,IAAI,0BACN,4GAEJ;CAEJ,OAAO;AACX;;;;;;;;;;;AClIA,SAAS,gBAAgB,KAAgB,KAAkC;CACvE,QAAQ,IAAI,mBAAZ;EACI,KAAK;EACL,KAAK,WACD,OAAO;EACX,KAAK,MACD,OAAO;EACX,SACI,MAAM,IAAI,MACN,oBAAoB,IAAI,SAAS,IAAI,qBAAqB,iBAAiB,sJAG/E;CACR;AACJ;;;;;;AAOA,SAAS,mBAAmB,WAAsB,KAAmB;CACjE,MAAM,MAAM,UAAU,OAAO,EAAE,QAAQ,MAAM,CAAC;CAC9C,IAAI,IAAI,OAAO,IAAI,QAAQ,SACvB,MAAM,IAAI,MACN,oBAAoB,IAAI,eAAe,IAAI,IAAI,+HAEnD;AAER;;;;;;;;AASA,SAAgB,mBAAmB,SAAkD;CACjF,MAAM,uBAAO,IAAI,IAAY;CAE7B,OAAO,QAAQ,KAAK,WAAW;EAC3B,IAAI,CAAC,OAAO,KACR,MAAM,IAAI,MAAM,yFAAyF;EAE7G,IAAI,KAAK,IAAI,OAAO,GAAG,GACnB,MAAM,IAAI,MACN,iCAAiC,OAAO,IAAI,4IAEhD;EAEJ,KAAK,IAAI,OAAO,GAAG;EAEnB,IAAI;EACJ,IAAI;GACA,aAAa,iBAAiB,OAAO,UAAU;EACnD,SAAS,OAAO;GACZ,MAAM,IAAI,MACN,oBAAoB,OAAO,IAAI,uCAC5B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAC5D;EACJ;EAEA,MAAM,YAAY,gBAAgB,UAAU;EAC5C,MAAM,UAAU,gBAAgB,YAAY,OAAO,GAAG;EACtD,MAAM,YAAY,OAAO,aAAa;EAEtC,IAAI,cAAc,SACd,MAAM,IAAI,MACN,oBAAoB,OAAO,IAAI,mBAAmB,UAAU,YACzD,WAAW,kBAAkB,oBAAoB,QAAQ,EAChE;EAEJ,IAAI,cAAc,SAAS,mBAAmB,WAAW,OAAO,GAAG;EAEnE,OAAO;GAAE,KAAK,OAAO;GAAK;GAAW;GAAY;EAAU;CAC/D,CAAC;AACL;;;;;;;AAQA,SAAgB,uBAAuB,MAAwB,KAAgD;CAC3G,IAAI,CAAC,KAAK,OAAO;CACjB,OAAO,KAAK,MAAM,QAAQ,IAAI,QAAQ,GAAG,KAAK;AAClD;;;;;;;;;;;;;;AAeA,SAAgB,oBAAoB,OAAuB;CACvD,MAAM,UAAU,MAAM,KAAK;CAC3B,IAAI,QAAQ,SAAS,YAAY,GAE7B,OAAO,QAAQ,QAAQ,QAAQ,IAAI;CAEvC,OAAO,OAAO,KAAK,SAAS,QAAQ,CAAC,CAAC,SAAS,MAAM;AACzD;;;;;;;;;;;AAYA,SAAgB,OAAO,MAA+C;CAClE,OAAO,EACH,MAAM,KAAK,KAAK,SAAS;EACrB,GAAI,IAAI,UAAU,OAAO,EAAE,QAAQ,MAAM,CAAC;EAC1C,KAAK,IAAI;EACT,KAAK,IAAI;EACT,KAAK;CACT,EAAE,EACN;AACJ;;;;;;;;;;;;;;;;;;;;;;;ACvIA,IAAI,YAAuB;CACvB,QAAQ;CACR,iBAAiB;CAIjB,kBAAkB;AACtB;;;;;;;;AASA,IAAI,cAAgC,CAAC;AACrC,IAAI,mBAA0C;;;;;AAM9C,SAAgB,aAAa,QAAyB;CAElD,MAAM,8BAAc,IAAI,IAAI;EACxB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACJ,CAAC;CAED,IAAI,CAAC,OAAO,UAAU,OAAO,OAAO,SAAS,IACzC,MAAM,IAAI,MACN,2JAEJ;CAGJ,IAAI,YAAY,IAAI,OAAO,OAAO,YAAY,CAAC,GAC3C,MAAM,IAAI,MACN,4LAEJ;CAKJ,MAAM,WAAW,OAAO,cAAc,mBAAmB,OAAO,WAAW,IAAI,CAAC;CAChF,IAAI,SAAgC;CACpC,IAAI,SAAS,SAAS,GAClB,IAAI,OAAO,WAAW;EAClB,SAAS,SAAS,MAAM,QAAQ,IAAI,QAAQ,OAAO,SAAS,KAAK;EACjE,IAAI,CAAC,QACD,MAAM,IAAI,MACN,sBAAsB,OAAO,UAAU,qDACnC,SAAS,KAAK,MAAM,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,8EAErD;CAER,OACI,SAAS,SAAS;CAI1B,YAAY;EACR,GAAG;EACH,GAAG;CACP;CACA,cAAc;CACd,mBAAmB;AACvB;;;;;;;;;AAUA,SAAgB,UAAiC;CAC7C,OAAO,OAAO,WAAW;AAC7B;;AAGA,SAAgB,0BAAmC;CAC/C,OAAO,qBAAqB;AAChC;;;;;;;;;;;;AAaA,SAAgB,kBAA2B;CACvC,OAAO,QAAQ,UAAU,MAAM;AACnC;;;;AAKA,SAAgB,oBACZ,KACA,OACA,MAAuB,QACvB,cACM;CACN,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAS3E,MAAM,UAAmC;EACrC;EACA;EACA,GAAG;EACH;CACJ;CAKA,IAAI,kBACA,OAAO,oBAAA,QAAI,KAAK,SAAS,iBAAiB,YAAY;EAClD,WAAW,UAAU;EACrB,WAAW,iBAAiB;EAC5B,OAAO,iBAAiB;CAC5B,CAAC;CAGL,OAAO,oBAAA,QAAI,KAAK,SAAS,UAAU,QAAQ;EACvC,WAAW,UAAU;EACrB,WAAW;CACf,CAAC;AACL;;;;AAKA,SAAgB,yBAAiC;CAE7C,MAAM,SADW,UAAU,mBAAmB,KAAA,CACvB,MAAM,iBAAiB;CAE9C,IAAI,CAAC,OAED,OAAO,OAAU;CAGrB,MAAM,QAAQ,SAAS,MAAM,IAAI,EAAE;CAGnC,QAFa,MAAM,IAEnB;EACI,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;EACxC,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK;EACnC,KAAK,KAAK,OAAO,QAAQ,KAAK;EAC9B,KAAK,KAAK,OAAO,QAAQ;EACzB,SAAS,OAAO,OAAU;CAC9B;AACJ;;;;AAKA,SAAgB,uBAA+B;CAC3C,OAAO,KAAK,IAAI,IAAI,uBAAuB;AAC/C;;;;;;;;;;;;;;;AAgBA,SAAgB,kBAAkB,OAA0C;CACxE,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAG3E,IAAI;EAYA,MAAM,SAAS,oBAAA,QAAI,OAAO,OAAO,EAAE,UAAU,KAAK,CAAC,CAAC,EAAE;EACtD,MAAM,WAAW,uBAAuB,aAAa,QAAQ,GAAG;EAOhE,MAAM,UAAW,WACX,oBAAA,QAAI,OAAO,OAAO,SAAS,WAAW,EAAE,YAAY,CAAC,SAAS,SAAS,EAAE,CAAC,IAC1E,oBAAA,QAAI,OAAO,OAAO,UAAU,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,CAAC;EAEnE,IAAI,QAAQ,SAAS;GACjB,OAAO,MAAM,4EAA4E,EAAE,SAAS,QAAQ,QAAQ,CAAC;GACrH,OAAO;EACX;EACA,MAAM,KAAK,QAAQ,OAAO,QAAQ,UAAU,QAAQ;EACpD,IAAI,CAAC,IAAI;GACL,OAAO,MAAM,oDAAoD,EAAE,QAAQ,QAAQ,CAAC;GACpF,OAAO;EACX;EAEA,MAAM,MAAO,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,SAAU,QAAQ,MAAM;EAE/E,OAAO;GACH,KAAK;GACL,OAAO,QAAQ,SAAS,CAAC;GACzB;GACA,KAAK,QAAQ;EACjB;CACJ,SAAS,OAAO;EACZ,OAAO,MAAM,6BAA6B;GAAS;GAAO,QAAQ,MAAM,UAAU,GAAG,EAAE;EAAE,CAAC;EAC1F,OAAO;CACX;AACJ;;;;AAKA,SAAgB,uBAA+B;CAC3C,OAAO,YAAY,EAAE,CAAC,CAAC,SAAS,KAAK;AACzC;;;;AAKA,SAAgB,iBAAiB,OAAuB;CACpD,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;AAC1D;;;;;;;AAQA,IAAa,oBAAoB,MAAM,KAAK,KAAK,KAAK;;AAGtD,IAAM,yBAAyB;;;;;;;;;;AAW/B,SAAgB,uBAA+B;CAE3C,MAAM,QADW,UAAU,kBACH,MAAM,iBAAiB;CAC/C,IAAI,CAAC,OAAO,OAAO;CAEnB,MAAM,QAAQ,SAAS,MAAM,IAAI,EAAE;CACnC,QAAQ,MAAM,IAAd;EACI,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK;EACxC,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK;EACnC,KAAK,KAAK,OAAO,QAAQ,KAAK;EAC9B,KAAK,KAAK,OAAO,QAAQ;EACzB,SAAS,OAAO;CACpB;AACJ;;;;AAKA,SAAgB,wBAA8B;CAC1C,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,qBAAqB,CAAC;AACvD;;;;;;;;;;;AAYA,IAAa,sBAAsB;;;;;;;;AASnC,SAAgB,wBAAwB,KAAa,mBAAmB,KAAa;CACjF,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAG3E,OAAO,oBAAA,QAAI,KAAK;EAAE,SAAS;EAC/B;CAAI,GAAG,UAAU,QAAQ;EACjB,WAAW;EACX,WAAW;CACf,CAAC;AACL;;;;;;;AAQA,SAAgB,sBAAsB,OAAuC;CACzE,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAG3E,IAAI;EACA,MAAM,UAAU,oBAAA,QAAI,OAAO,OAAO,UAAU,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,CAAC;EAC7E,IAAI,QAAQ,YAAA,iBAAmC,CAAC,QAAQ,KAAK,OAAO;EACpE,OAAO,EAAE,KAAK,QAAQ,IAAI;CAC9B,QAAQ;EACJ,OAAO;CACX;AACJ;;;;;;;;;;;;;;;;;;AA+BA,SAAgB,sBACZ,MACA,mBAA2B,KAC3B,WACM;CACN,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAG3E,MAAM,UAAgC;EAClC,SAAS;EACT;EACA,WAAW,mBAAmB,SAAS;CAC3C;CAEA,OAAO,oBAAA,QAAI,KAAK,SAAS,UAAU,QAAQ;EACvC,WAAW;EACX,WAAW;CACf,CAAC;AACL;;;;;;;;;;;AAYA,SAAgB,oBAAoB,OAA4C;CAC5E,IAAI,CAAC,UAAU,QACX,MAAM,IAAI,MAAM,uDAAuD;CAG3E,IAAI;EACA,MAAM,UAAU,oBAAA,QAAI,OAAO,OAAO,UAAU,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,CAAC;EAC7E,IAAI,WAAW,QAAQ,YAAY,eAAe,OAAO,QAAQ,SAAS,UACtE,OAAO;GACH,SAAS;GACT,MAAM,QAAQ;GACd,WAAW,mBACP,OAAO,QAAQ,cAAc,WAAW,QAAQ,YAAY,IAChE;EACJ;EAEJ,OAAO;CACX,SAAS,OAAO;EACZ,OAAO,MAAM,4CAA4C,EAAS,MAAM,CAAC;EACzE,OAAO;CACX;AACJ"}