ns-auth-sdk 1.14.0 → 1.14.2

package/dist/dist-DlmcyFmM.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"dist-DlmcyFmM.mjs","names":["i","qb64","libsodium","qb64","raw","libsodium","libsodium","libsodium","qb64","x","Dummy","libsodium","code","seed","clone","b","config","factory","isPlainObject","typed","name","signature","min","last","params","self","s","generic","isInteger","sign","log2","log10","cbrt","expm1","format","toFixed","toExponential","toEngineering","digits","zeros","d","_toNumberOrDefault","nearlyEqual","dependencies","name","d","typedFunction","dependencies","createTyped","typed","BigNumber","Complex","Fraction","DenseMatrix","matrix","name","P","min","max","d","n1","b","sign","digits","pow","sum","add","cosh","clone","Decimal","i","hypot","sinh","name","dependencies","BigNumber","Decimal","config","b","Complex","abs","d","t","name","dependencies","Complex","format","b","P","d","Fraction","parse","b","name","dependencies","Fraction","name","dependencies","Matrix","isInteger","format","exp","digits","BigNumber","format","formatNumber","formatBigNumber","min","max","isInteger","format","d","typeOf","b","concat","signature","name","dependencies","DenseMatrix","clone","Matrix","i","matrix","min","max","range","_resize","size","_loop","format","isInteger","_value","d","name","dependencies","typed","isIntegerNumber","BigNumber","Fraction","self","b","cbrt","isInteger","log10","log2","sign","max","nearlyEqual","typed","self","name","dependencies","typed","nearlyEqual","config","bigNearlyEqual","name","dependencies","SparseMatrix","clone","matrix","equalScalar","typed","Matrix","min","max","i","isInteger","format","_resize","d","invoke","_value","name","dependencies","number","typed","BigNumber","Fraction","clone","self","name","dependencies","typed","BigNumber","number","clone","self","Fraction","name","dependencies","typed","number","Fraction","BigNumber","clone","self","Object","name","dependencies","typed","format","Array","Matrix","DenseMatrix","SparseMatrix","name","dependencies","typed","self","name","dependencies","typed","b","clone","name","dependencies","b","typed","name","dim","concat","name","dependencies","matrix","typed","self","name","dependencies","typed","name","dependencies","b","equalScalar","typed","name","dependencies","typed","b","DenseMatrix","name","dependencies","typed","isInteger","clone","_concat","matrix","name","dependencies","typed","formatString","name","dependencies","bignumber","fraction","numeric","name","dependencies","typed","addScalar","self","typed","sum","add","numeric","config","concat","number","mask","name","signer","sign","exports","name","siginput","value","range","name","state","tag","val","siginput","signature","mod","name","libsodium","name","incept","name","state","name","name","name","range","sign","exp"],"sources":["../node_modules/@global-vlei/signify-ts/dist/ready.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/kering.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/core.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/base64.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/matter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/verfer.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/cigar.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/indexer.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/siger.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/signer.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/salter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/decrypter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/cipher.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/counter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/seqner.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/diger.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/number.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/serder.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/prefixer.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/saider.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/utils.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/encrypter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/manager.js","../node_modules/@babel/runtime/helpers/extends.js","../node_modules/mathjs/lib/esm/core/config.js","../node_modules/mathjs/lib/esm/utils/is.js","../node_modules/mathjs/lib/esm/utils/object.js","../node_modules/mathjs/lib/esm/core/function/config.js","../node_modules/mathjs/lib/esm/entry/configReadonly.js","../node_modules/typed-function/lib/umd/typed-function.js","../node_modules/mathjs/lib/esm/utils/number.js","../node_modules/mathjs/lib/esm/utils/factory.js","../node_modules/mathjs/lib/esm/utils/customs.js","../node_modules/mathjs/lib/esm/utils/map.js","../node_modules/mathjs/lib/esm/core/function/typed.js","../node_modules/decimal.js/decimal.mjs","../node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","../node_modules/complex.js/dist/complex.mjs","../node_modules/mathjs/lib/esm/type/complex/Complex.js","../node_modules/fraction.js/fraction.js","../node_modules/mathjs/lib/esm/type/fraction/Fraction.js","../node_modules/mathjs/lib/esm/type/matrix/Matrix.js","../node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../node_modules/mathjs/lib/esm/utils/string.js","../node_modules/mathjs/lib/esm/error/DimensionError.js","../node_modules/mathjs/lib/esm/error/IndexError.js","../node_modules/mathjs/lib/esm/utils/array.js","../node_modules/mathjs/lib/esm/utils/function.js","../node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","../node_modules/mathjs/lib/esm/utils/switch.js","../node_modules/mathjs/lib/esm/utils/collection.js","../node_modules/mathjs/lib/esm/function/utils/isInteger.js","../node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","../node_modules/mathjs/lib/esm/utils/complex.js","../node_modules/mathjs/lib/esm/function/relational/compareUnits.js","../node_modules/mathjs/lib/esm/function/relational/equalScalar.js","../node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","../node_modules/mathjs/lib/esm/type/number.js","../node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","../node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","../node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","../node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js","../node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js","../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js","../node_modules/mathjs/lib/esm/function/matrix/concat.js","../node_modules/mathjs/lib/esm/utils/noop.js","../node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js","../node_modules/mathjs/lib/esm/function/string/format.js","../node_modules/mathjs/lib/esm/function/utils/numeric.js","../node_modules/mathjs/lib/esm/function/arithmetic/add.js","../node_modules/mathjs/lib/esm/function/statistics/sum.js","../node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/tholder.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/eventing.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/habery.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/controller.js","../node_modules/structured-headers/dist/types.js","../node_modules/structured-headers/dist/util.js","../node_modules/structured-headers/dist/token.js","../node_modules/structured-headers/dist/serializer.js","../node_modules/structured-headers/dist/parser.js","../node_modules/structured-headers/dist/index.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/httping.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/aiding.js","../node_modules/@global-vlei/signify-ts/dist/keri/end/ending.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/authing.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/keeping.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/contacting.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/coring.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/vdring.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/credentialing.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/delegating.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/escrowing.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/bexter.js","../node_modules/@global-vlei/signify-ts/dist/keri/core/pather.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/exchanging.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/grouping.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/notifying.js","../node_modules/@global-vlei/signify-ts/dist/keri/app/clienting.js","../node_modules/@global-vlei/signify-ts/dist/exports.js","../node_modules/@global-vlei/signify-ts/dist/index.js"],"sourcesContent":["import _sodium from 'libsodium-wrappers-sumo';\nexport const ready = async () => {\n    await _sodium.ready;\n};\n","export class EmptyMaterialError {\n    constructor(err) {\n        this._err = new Error(err);\n    }\n    get err() {\n        return this._err;\n    }\n}\n","/**\n * Serialization types supported by the KERI and ACDC protocols and this Signify implementation.\n */\nexport var Serials;\n(function (Serials) {\n    Serials[\"JSON\"] = \"JSON\";\n})(Serials || (Serials = {}));\n/**\n * Protocol types supported by the KERI and ACDC protocols and this Signify implementation.\n */\nexport var Protocols;\n(function (Protocols) {\n    Protocols[\"KERI\"] = \"KERI\";\n    Protocols[\"ACDC\"] = \"ACDC\";\n})(Protocols || (Protocols = {}));\n/**\n * Represents a protocol version of the KERI, ACDC, or other protocol specified in a CESR version string.\n */\nexport class Version {\n    constructor(major = 1, minor = 0) {\n        this.major = major;\n        this.minor = minor;\n    }\n}\n/**\n * Denotes version 1.0 of a protocol.\n */\nexport const Vrsn_1_0 = new Version();\n/**\n * Types of KERI and ACDC events.\n */\nexport const Ilks = {\n    icp: 'icp',\n    rot: 'rot',\n    ixn: 'ixn',\n    dip: 'dip',\n    drt: 'drt',\n    rct: 'rct',\n    vrc: 'vrc',\n    rpy: 'rpy',\n    exn: 'exn',\n    vcp: 'vcp',\n    iss: 'iss',\n    rev: 'rev',\n    bis: 'bis',\n    brv: 'brv',\n};\n/**\n * Field labels for an inception event in V1 of the KERI protocol.\n */\nexport const IcpLabels = [\n    'v',\n    'i',\n    's',\n    't',\n    'kt',\n    'k',\n    'n',\n    'bt',\n    'b',\n    'c',\n    'a',\n];\n/**\n * Field labels for an delegated inception event in V1 of the KERI protocol.\n */\nexport const DipLabels = [\n    'v',\n    'i',\n    's',\n    't',\n    'kt',\n    'k',\n    'n',\n    'bt',\n    'b',\n    'c',\n    'a',\n    'di',\n];\n/**\n * Field labels for a rotation event in V1 of the KERI protocol.\n */\nexport const RotLabels = [\n    'v',\n    'i',\n    's',\n    't',\n    'p',\n    'kt',\n    'k',\n    'n',\n    'bt',\n    'br',\n    'ba',\n    'a',\n];\n/**\n * Field labels for an delegated rotation event in V1 of the KERI protocol.\n */\nexport const DrtLabels = [\n    'v',\n    'i',\n    's',\n    't',\n    'p',\n    'kt',\n    'k',\n    'n',\n    'bt',\n    'br',\n    'ba',\n    'a',\n];\n/**\n * Field labels for an interaction event in V1 of the KERI protocol.\n */\nexport const IxnLabels = ['v', 'i', 's', 't', 'p', 'a'];\n/**\n * Field labels for a key state notice event in V1 of the KERI protocol.\n */\nexport const KsnLabels = [\n    'v',\n    'i',\n    's',\n    't',\n    'p',\n    'd',\n    'f',\n    'dt',\n    'et',\n    'kt',\n    'k',\n    'n',\n    'bt',\n    'b',\n    'c',\n    'ee',\n    'di',\n    'r',\n];\n/**\n * Field labels for a reply event in V1 of the KERI protocol.\n */\nexport const RpyLabels = ['v', 't', 'd', 'dt', 'r', 'a'];\n/**\n * Full size of a CESR version string in bytes.\n */\nexport const VERFULLSIZE = 17;\n/**\n * Minimum number of bytes a CESR parser must sniff to receive the entire version string.\n */\nexport const MINSNIFFSIZE = 12 + VERFULLSIZE;\nexport const MINSIGSIZE = 4;\n// const version_pattern = 'KERI(?P<major>[0-9a-f])(?P<minor>[0-9a-f])\n// (?P<kind>[A-Z]{4})(?P<size>[0-9a-f]{6})'\n// const version_pattern1 = `KERI\\(\\?P<major>\\[0\\-9a\\-f\\]\\)\\(\\?P<minor>\\[0\\-9a\\-f\\]\\)\\\n// (\\?P<kind>\\[A\\-Z\\]\\{4\\}\\)\\(\\?P<size>\\[0\\-9a\\-f\\]\\{6\\}\\)_`\n/**\n * Regular expression for a version 1 CESR object version string.\n */\nexport const VEREX = '(KERI|ACDC)([0-9a-f])([0-9a-f])([A-Z]{4})([0-9a-f]{6})_';\n/**\n * Parses a serialization version string into the protocol, protocol version, serialization type, and raw size.\n * Uses regex matchers to validate and extract version string parts.\n * @param {string} versionString version string\n * @return {Object} tuple of prototol (KERI or ACDC), kind of serialization like cbor,json, or mgpk,\n *                  protocol version, and raw size of serialization\n */\nexport function deversify(versionString) {\n    let kind;\n    let size;\n    let proto;\n    const version = Vrsn_1_0;\n    // we need to identify how to match the buffers pattern ,like we do regex matching for strings\n    const re = new RegExp(VEREX);\n    // Regex pattern matching\n    const match = re.exec(versionString);\n    if (match) {\n        [proto, version.major, version.minor, kind, size] = [\n            match[1],\n            +match[2],\n            +match[3],\n            match[4],\n            match[5],\n        ];\n        if (!Object.values(Serials).includes(kind)) {\n            throw new Error(`Invalid serialization kind = ${kind}`);\n        }\n        if (!Object.values(Protocols).includes(proto)) {\n            throw new Error(`Invalid serialization kind = ${kind}`);\n        }\n        const ta = kind;\n        kind = Serials[ta];\n        const pa = proto;\n        proto = Protocols[pa];\n        return [proto, kind, version, size];\n    }\n    throw new Error(`Invalid version string = ${versionString}`);\n}\n/**\n * Returns a valid KERI serialization version string specifying the protocol,\n * protocol version, serialization type, and raw byte size of the serialization.\n *\n * Defaults to version 1.0.\n * @param ident\n * @param version\n * @param kind\n * @param size\n */\nexport function versify(ident = Protocols.KERI, version, kind = Serials.JSON, size = 0) {\n    version = version == undefined ? Vrsn_1_0 : version; // defaults to Version 1\n    const major = version.major.toString(16); // hex digits\n    const minor = version.minor.toString(16); // hex digits\n    // raw size in hex digits zero padded to 6 characters\n    const rawSize = size.toString(16).padStart(6, '0');\n    const terminationChar = '_'; // v1 termination character\n    return `${ident}${major}${minor}${kind}${rawSize}${terminationChar}`;\n}\n/**\n * Map allowing lookup of Base64URLSafe characters by index.\n */\nexport const B64ChrByIdx = new Map([\n    [0, 'A'],\n    [1, 'B'],\n    [2, 'C'],\n    [3, 'D'],\n    [4, 'E'],\n    [5, 'F'],\n    [6, 'G'],\n    [7, 'H'],\n    [8, 'I'],\n    [9, 'J'],\n    [10, 'K'],\n    [11, 'L'],\n    [12, 'M'],\n    [13, 'N'],\n    [14, 'O'],\n    [15, 'P'],\n    [16, 'Q'],\n    [17, 'R'],\n    [18, 'S'],\n    [19, 'T'],\n    [20, 'U'],\n    [21, 'V'],\n    [22, 'W'],\n    [23, 'X'],\n    [24, 'Y'],\n    [25, 'Z'],\n    [26, 'a'],\n    [27, 'b'],\n    [28, 'c'],\n    [29, 'd'],\n    [30, 'e'],\n    [31, 'f'],\n    [32, 'g'],\n    [33, 'h'],\n    [34, 'i'],\n    [35, 'j'],\n    [36, 'k'],\n    [37, 'l'],\n    [38, 'm'],\n    [39, 'n'],\n    [40, 'o'],\n    [41, 'p'],\n    [42, 'q'],\n    [43, 'r'],\n    [44, 's'],\n    [45, 't'],\n    [46, 'u'],\n    [47, 'v'],\n    [48, 'w'],\n    [49, 'x'],\n    [50, 'y'],\n    [51, 'z'],\n    [52, '0'],\n    [53, '1'],\n    [54, '2'],\n    [55, '3'],\n    [56, '4'],\n    [57, '5'],\n    [58, '6'],\n    [59, '7'],\n    [60, '8'],\n    [61, '9'],\n    [62, '-'],\n    [63, '_'],\n]);\n/**\n * Map allowing lookup of Base64URLSafe index by character.\n */\nexport const B64IdxByChr = new Map(Array.from(B64ChrByIdx, (entry) => [entry[1], entry[0]]));\n/**\n * Converts an integer to a Base64URLSafe encoded string, left padded as specified.\n * @param i integer to convert\n * @param l minimum length of Base64 digits left padded with Base64 0 == 'A' character.\n */\nexport function intToB64(i, l = 1) {\n    let out = '';\n    while (l != 0) {\n        out = B64ChrByIdx.get(i % 64) + out;\n        i = Math.floor(i / 64);\n        if (i == 0) {\n            break;\n        }\n    }\n    const x = l - out.length;\n    for (let i = 0; i < x; i++) {\n        out = 'A' + out;\n    }\n    return out;\n}\n/**\n * Converts an integer to a Base64URLSafe encoded string to a byte array, left padded as specified.\n * @param i integer to convert\n * @param l minimum length of Base64 digits left padded with Base64 0 == 'A' character.\n */\nexport function intToB64b(n, l = 1) {\n    const s = intToB64(n, l);\n    return b(s);\n}\n/**\n * Converts a Base64URLSafe encoded string to an integer.\n * @param s string to convert\n */\nexport function b64ToInt(s) {\n    if (s.length == 0) {\n        throw new Error('Empty string, conversion undefined.');\n    }\n    let i = 0;\n    const rev = s.split('').reverse();\n    rev.forEach((c, e) => {\n        i |= B64IdxByChr.get(c) << (e * 6);\n    });\n    return i;\n}\n// Built in encoder and decoder for converting to and from UTF-8 strings and Uint8Array byte arrays.\nconst encoder = new TextEncoder();\nconst decoder = new TextDecoder();\n/**\n * Converts a UTF-8 string to bytes.\n * Output is an encoded array of bytes. Assumes UTF-8 encoding.\n * @param s string to be encoded as an array of bytes\n */\nexport function b(s) {\n    return encoder.encode(s);\n}\n/**\n * Convert bytes to UTF-8 string.\n * @param u array of bytes to be converted to UTF-8 string.\n */\nexport function d(u) {\n    return decoder.decode(u);\n}\n/**\n * Concatenates two byte arrays together in a new byte array.\n * @param one first byte array to be concatenated\n * @param two second byte array to be concatenated\n */\nexport function concat(one, two) {\n    const out = new Uint8Array(one.length + two.length);\n    out.set(one);\n    out.set(two, one.length);\n    return out;\n}\n/**\n * Converts a big-endian byte array into an integer.\n *\n * @param array - A `Uint8Array` of bytes representing a big-endian integer.\n * @returns The integer represented by the byte array.\n *\n * Example:\n *   readInt(Uint8Array([0x01, 0x02, 0x03])) // returns 66051\n *\n * How it works:\n * - The function interprets the array as a big-endian number.\n * - Each byte is added to the integer after shifting the previous value left by 8 bits (multiplying by 256).\n */\nexport function readInt(array) {\n    let value = 0;\n    for (let i = 0; i < array.length; i++) {\n        value = value * 256 + array[i];\n    }\n    return value;\n}\n","import { fromByteArray, toByteArray } from 'base64-js';\nexport function encodeBase64Url(input) {\n    return fromByteArray(input)\n        .replace(/\\+/g, '-')\n        .replace(/\\//g, '_')\n        .replace(/=+/, '');\n}\nexport function decodeBase64Url(input) {\n    if (!(typeof input === 'string')) {\n        throw new TypeError('`input` must be a string.');\n    }\n    const n = input.length % 4;\n    const padded = input + '='.repeat(n > 0 ? 4 - n : n);\n    const base64String = padded.replace(/-/g, '+').replace(/_/g, '/');\n    return toByteArray(base64String);\n}\n","import { EmptyMaterialError } from \"./kering.js\";\nimport { intToB64, readInt } from \"./core.js\";\nimport { b, d } from \"./core.js\";\nimport { decodeBase64Url, encodeBase64Url } from \"./base64.js\";\nexport class Codex {\n    has(prop) {\n        const m = new Map(Array.from(Object.entries(this), (v) => [v[1], v[0]]));\n        return m.has(prop);\n    }\n}\nexport class MatterCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Ed25519_Seed = 'A'; // Ed25519 256 bit random seed for private key\n        this.Ed25519N = 'B'; // Ed25519 verification key non-transferable, basic derivation.\n        this.X25519 = 'C'; // X25519 public encryption key, converted from Ed25519 or Ed25519N.\n        this.Ed25519 = 'D'; // Ed25519 verification key basic derivation\n        this.Blake3_256 = 'E'; // Blake3 256 bit digest self-addressing derivation.\n        this.SHA3_256 = 'H'; // SHA3 256 bit digest self-addressing derivation.\n        this.SHA2_256 = 'I'; // SHA2 256 bit digest self-addressing derivation.\n        this.ECDSA_256k1_Seed = 'J'; // ECDSA secp256k1 256 bit random Seed for private key\n        this.X25519_Private = 'O'; // X25519 private decryption key converted from Ed25519\n        this.X25519_Cipher_Seed = 'P'; // X25519 124 char b64 Cipher of 44 char qb64 Seed\n        this.ECDSA_256r1_Seed = 'Q'; // ECDSA secp256r1 256 bit random Seed for private key\n        this.Salt_128 = '0A'; // 128 bit random salt or 128 bit number (see Huge)\n        this.Ed25519_Sig = '0B'; // Ed25519 signature.\n        this.ECDSA_256k1_Sig = '0C'; // ECDSA secp256k1 signature.\n        this.ECDSA_256r1_Sig = '0I'; // ECDSA secp256r1 signature.\n        this.StrB64_L0 = '4A'; // String Base64 Only Lead Size 0\n        this.StrB64_L1 = '5A'; // String Base64 Only Lead Size 1\n        this.StrB64_L2 = '6A'; // String Base64 Only Lead Size 2\n        this.ECDSA_256k1N = '1AAA'; // ECDSA secp256k1 verification key non-transferable, basic derivation.\n        this.ECDSA_256k1 = '1AAB'; // ECDSA public verification or encryption key, basic derivation\n        this.X25519_Cipher_Salt = '1AAH'; // X25519 100 char b64 Cipher of 24 char qb64 Salt\n        this.ECDSA_256r1N = '1AAI'; // ECDSA secp256r1 verification key non-transferable, basic derivation.\n        this.ECDSA_256r1 = '1AAJ'; // ECDSA secp256r1 verification or encryption key, basic derivation\n        this.StrB64_Big_L0 = '7AAA'; // String Base64 Only Big Lead Size 0\n        this.StrB64_Big_L1 = '8AAA'; // String Base64 Only Big Lead Size 1\n        this.StrB64_Big_L2 = '9AAA'; // String Base64 Only Big Lead Size 2\n    }\n}\nexport const MtrDex = new MatterCodex();\nexport class NonTransCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Ed25519N = 'B'; // Ed25519 verification key non-transferable, basic derivation.\n        this.ECDSA_256k1N = '1AAA'; // ECDSA secp256k1 verification key non-transferable, basic derivation.\n        this.Ed448N = '1AAC'; // Ed448 non-transferable prefix public signing verification key. Basic derivation.\n        this.ECDSA_256r1N = '1AAI'; // ECDSA secp256r1 verification key non-transferable, basic derivation.\n    }\n}\nexport const NonTransDex = new NonTransCodex();\nexport class DigiCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Blake3_256 = 'E'; // Blake3 256 bit digest self-addressing derivation.\n        this.Blake2b_256 = 'F'; // Blake2b 256 bit digest self-addressing derivation.\n        this.Blake2s_256 = 'G'; // Blake2s 256 bit digest self-addressing derivation.\n        this.SHA3_256 = 'H'; // SHA3 256 bit digest self-addressing derivation.\n        this.SHA2_256 = 'I'; // SHA2 256 bit digest self-addressing derivation.\n        this.Blake3_512 = '0D'; // Blake3 512 bit digest self-addressing derivation.\n        this.Blake2b_512 = '0E'; // Blake2b 512 bit digest self-addressing derivation.\n        this.SHA3_512 = '0F'; // SHA3 512 bit digest self-addressing derivation.\n        this.SHA2_512 = '0G'; // SHA2 512 bit digest self-addressing derivation.\n    }\n}\nexport const DigiDex = new DigiCodex();\nexport class NumCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Short = 'M'; // Short 2 byte b2 number\n        this.Long = '0H'; // Long 4 byte b2 number\n        this.Big = 'N'; // Big 8 byte b2 number\n        this.Huge = '0A'; // Huge 16 byte b2 number (same as Salt_128)\n    }\n}\nexport const NumDex = new NumCodex();\nexport class BexCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.StrB64_L0 = '4A'; // String Base64 Only Leader Size 0\n        this.StrB64_L1 = '5A'; // String Base64 Only Leader Size 1\n        this.StrB64_L2 = '6A'; // String Base64 Only Leader Size 2\n        this.StrB64_Big_L0 = '7AAA'; // String Base64 Only Big Leader Size 0\n        this.StrB64_Big_L1 = '8AAA'; // String Base64 Only Big Leader Size 1\n        this.StrB64_Big_L2 = '9AAA'; // String Base64 Only Big Leader Size 2\n    }\n}\nexport const BexDex = new BexCodex();\nclass SmallVarRawSizeCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Lead0 = '4'; // First Selector Character for all ls == 0 codes\n        this.Lead1 = '5'; // First Selector Character for all ls == 1 codes\n        this.Lead2 = '6'; // First Selector Character for all ls == 2 codes\n    }\n}\nexport const SmallVrzDex = new SmallVarRawSizeCodex();\nclass LargeVarRawSizeCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.Lead0_Big = '7'; // First Selector Character for all ls == 0 codes\n        this.Lead1_Big = '8'; // First Selector Character for all ls == 1 codes\n        this.Lead2_Big = '9'; // First Selector Character for all ls == 2 codes\n    }\n}\nexport const LargeVrzDex = new LargeVarRawSizeCodex();\nexport class Sizage {\n    constructor(hs, ss, fs, ls) {\n        this.hs = hs;\n        this.ss = ss;\n        this.fs = fs;\n        this.ls = ls;\n    }\n}\nexport class Matter {\n    constructor({ raw, code = MtrDex.Ed25519N, qb64b, qb64, qb2, rize, }) {\n        this._code = '';\n        this._size = -1;\n        this._raw = new Uint8Array(0);\n        let size = -1;\n        if (raw != undefined) {\n            if (code.length == 0) {\n                throw new Error('Improper initialization need either (raw and code) or qb64b or qb64 or qb2.');\n            }\n            if (SmallVrzDex.has(code[0]) || LargeVrzDex.has(code[0])) {\n                if (rize !== undefined) {\n                    if (rize < 0)\n                        throw new Error(`missing var raw size for code=${code}`);\n                }\n                else {\n                    rize = raw.length;\n                }\n                const ls = (3 - (rize % 3)) % 3; // calc actual lead (pad) size\n                size = Math.floor((rize + ls) / 3); // calculate value of size in triplets\n                if (SmallVrzDex.has(code[0])) {\n                    if (size <= 64 ** 2 - 1) {\n                        const hs = 2;\n                        const s = Object.values(SmallVrzDex)[ls];\n                        code = `${s}${code.substring(1, hs)}`;\n                    }\n                    else if (size <= 64 ** 4 - 1) {\n                        const hs = 4;\n                        const s = Object.values(LargeVrzDex)[ls];\n                        code = `${s}${'AAAA'.substring(0, hs - 2)}${code[1]}`;\n                    }\n                    else {\n                        throw new Error(`Unsupported raw size for code=${code}`);\n                    }\n                }\n                else {\n                    if (size <= 64 ** 4 - 1) {\n                        const hs = 4;\n                        const s = Object.values(LargeVrzDex)[ls];\n                        code = `${s}${code.substring(1, hs)}`;\n                    }\n                    else {\n                        throw new Error(`Unsupported raw size for code=${code}`);\n                    }\n                }\n            }\n            else {\n                const sizage = Matter.Sizes.get(code);\n                if (sizage.fs == -1) {\n                    // invalid\n                    throw new Error(`Unsupported variable size code=${code}`);\n                }\n                rize = Matter._rawSize(code);\n            }\n            raw = raw.slice(0, rize); // copy only exact size from raw stream\n            if (raw.length != rize) {\n                // forbids shorter\n                throw new Error(`Not enougth raw bytes for code=${code} expected ${rize} got ${raw.length}.`);\n            }\n            this._code = code; // hard value part of code\n            this._size = size; // soft value part of code in int\n            this._raw = raw; // crypto ops require bytes not bytearray\n        }\n        else if (qb64 !== undefined) {\n            this._exfil(qb64);\n        }\n        else if (qb64b !== undefined) {\n            const qb64 = d(qb64b);\n            this._exfil(qb64);\n        }\n        else if (qb2 !== undefined) {\n            this._bexfil(qb2);\n        }\n        else {\n            throw new EmptyMaterialError('EmptyMaterialError');\n        }\n    }\n    get code() {\n        return this._code;\n    }\n    get size() {\n        return this._size;\n    }\n    get raw() {\n        return this._raw;\n    }\n    get qb64() {\n        return this._infil();\n    }\n    get qb64b() {\n        return b(this.qb64);\n    }\n    get transferable() {\n        return !NonTransDex.has(this.code);\n    }\n    get digestive() {\n        return DigiDex.has(this.code);\n    }\n    static _rawSize(code) {\n        const sizage = this.Sizes.get(code); // get sizes\n        const cs = sizage.hs + sizage.ss; // both hard + soft code size\n        if (sizage.fs === -1) {\n            throw Error(`Non-fixed raw size code ${code}.`);\n        }\n        return Math.floor(((sizage.fs - cs) * 3) / 4) - sizage.ls;\n    }\n    static _leadSize(code) {\n        const sizage = this.Sizes.get(code);\n        return sizage.ls;\n    }\n    get both() {\n        const sizage = Matter.Sizes.get(this.code);\n        return `${this.code}${intToB64(this.size, sizage.ss)}`;\n    }\n    _infil() {\n        const code = this.code;\n        const size = this.size;\n        const raw = this.raw;\n        const ps = (3 - (raw.length % 3)) % 3; // pad size chars or lead size bytes\n        const sizage = Matter.Sizes.get(code);\n        if (sizage.fs === undefined) {\n            // Variable size code, NOT SUPPORTED\n            const cs = sizage.hs + sizage.ss;\n            if (cs % 4) {\n                throw new Error(`Whole code size not multiple of 4 for variable length material. cs=${cs}`);\n            }\n            if (size < 0 || size > 64 ** sizage.ss - 1) {\n                throw new Error(`Invalid size=${size} for code=${code}.`);\n            }\n            const both = `${code}${intToB64(size, sizage.ss)}`;\n            if (both.length % 4 !== ps - sizage.ls) {\n                throw new Error(`Invalid code=${both} for converted raw pad size=${ps}.`);\n            }\n            const bytes = new Uint8Array(sizage.ls + raw.length);\n            for (let i = 0; i < sizage.ls; i++) {\n                bytes[i] = 0;\n            }\n            for (let i = 0; i < raw.length; i++) {\n                const odx = i + ps;\n                bytes[odx] = raw[i];\n            }\n            return both + encodeBase64Url(bytes);\n        }\n        else {\n            const both = code;\n            const cs = both.length;\n            if (cs % 4 != ps - sizage.ls) {\n                // adjusted pad given lead bytes\n                throw new Error(`Invalid code=${both} for converted raw pad size=${ps}, ${raw.length}.`);\n            }\n            // prepad, convert, and replace upfront\n            // when fixed and ls != 0 then cs % 4 is zero and ps==ls\n            // otherwise  fixed and ls == 0 then cs % 4 == ps\n            const bytes = new Uint8Array(ps + raw.length);\n            for (let i = 0; i < ps; i++) {\n                bytes[i] = 0;\n            }\n            for (let i = 0; i < raw.length; i++) {\n                const odx = i + ps;\n                bytes[odx] = raw[i];\n            }\n            return both + encodeBase64Url(bytes).slice(cs % 4);\n        }\n    }\n    _exfil(qb64) {\n        if (qb64.length == 0) {\n            throw new Error('Empty Material');\n        }\n        const first = qb64[0];\n        if (!Array.from(Matter.Hards.keys()).includes(first)) {\n            throw new Error(`Unexpected code ${first}`);\n        }\n        const hs = Matter.Hards.get(first);\n        if (qb64.length < hs) {\n            throw new Error(`Shortage Error`);\n        }\n        const hard = qb64.slice(0, hs);\n        if (!Array.from(Matter.Sizes.keys()).includes(hard)) {\n            throw new Error(`Unsupported code ${hard}`);\n        }\n        const sizage = Matter.Sizes.get(hard);\n        const cs = sizage.hs + sizage.ss;\n        let size = -1;\n        if (sizage.fs == -1) {\n            // Variable size code, Not supported\n            throw new Error('Variable size codes not supported yet');\n        }\n        else {\n            size = sizage.fs;\n        }\n        if (qb64.length < sizage.fs) {\n            throw new Error(`Need ${sizage.fs - qb64.length} more chars.`);\n        }\n        qb64 = qb64.slice(0, sizage.fs);\n        const ps = cs % 4;\n        const pbs = 2 * (ps == 0 ? sizage.ls : ps);\n        let raw;\n        if (ps != 0) {\n            const base = new Array(ps + 1).join('A') + qb64.slice(cs);\n            const paw = Uint8Array.from(decodeBase64Url(base)); // decode base to leave prepadded raw\n            const pi = readInt(paw.subarray(0, ps)); // prepad as int\n            if (pi & (2 ** pbs - 1)) {\n                // masked pad bits non-zero\n                throw new Error(`Non zeroed prepad bits = {pi & (2 ** pbs - 1 ):<06b} in {qb64b[cs:cs+1]}.`);\n            }\n            raw = paw.subarray(ps); // strip off ps prepad paw bytes\n        }\n        else {\n            const base = qb64.slice(cs);\n            const paw = Uint8Array.from(decodeBase64Url(base));\n            const li = readInt(paw.subarray(0, sizage.ls));\n            if (li != 0) {\n                if (li == 1) {\n                    throw new Error(`Non zeroed lead byte = 0x{li:02x}.`);\n                }\n                else {\n                    throw new Error(`Non zeroed lead bytes = 0x{li:04x}`);\n                }\n            }\n            raw = paw.subarray(sizage.ls);\n        }\n        this._code = hard; // hard only\n        this._size = size;\n        this._raw = Uint8Array.from(raw); // ensure bytes so immutable and for crypto ops\n    }\n    _bexfil(qb2) {\n        throw new Error(`qb2 not yet supported: ${qb2}`);\n    }\n}\nMatter.Sizes = new Map(Object.entries({\n    A: new Sizage(1, 0, 44, 0),\n    B: new Sizage(1, 0, 44, 0),\n    C: new Sizage(1, 0, 44, 0),\n    D: new Sizage(1, 0, 44, 0),\n    E: new Sizage(1, 0, 44, 0),\n    F: new Sizage(1, 0, 44, 0),\n    G: new Sizage(1, 0, 44, 0),\n    H: new Sizage(1, 0, 44, 0),\n    I: new Sizage(1, 0, 44, 0),\n    J: new Sizage(1, 0, 44, 0),\n    K: new Sizage(1, 0, 76, 0),\n    L: new Sizage(1, 0, 76, 0),\n    M: new Sizage(1, 0, 4, 0),\n    N: new Sizage(1, 0, 12, 0),\n    O: new Sizage(1, 0, 44, 0),\n    P: new Sizage(1, 0, 124, 0),\n    Q: new Sizage(1, 0, 44, 0),\n    '0A': new Sizage(2, 0, 24, 0),\n    '0B': new Sizage(2, 0, 88, 0),\n    '0C': new Sizage(2, 0, 88, 0),\n    '0D': new Sizage(2, 0, 88, 0),\n    '0E': new Sizage(2, 0, 88, 0),\n    '0F': new Sizage(2, 0, 88, 0),\n    '0G': new Sizage(2, 0, 88, 0),\n    '0H': new Sizage(2, 0, 8, 0),\n    '0I': new Sizage(2, 0, 88, 0),\n    '1AAA': new Sizage(4, 0, 48, 0),\n    '1AAB': new Sizage(4, 0, 48, 0),\n    '1AAC': new Sizage(4, 0, 80, 0),\n    '1AAD': new Sizage(4, 0, 80, 0),\n    '1AAE': new Sizage(4, 0, 56, 0),\n    '1AAF': new Sizage(4, 0, 8, 0),\n    '1AAG': new Sizage(4, 0, 36, 0),\n    '1AAH': new Sizage(4, 0, 100, 0),\n    '1AAI': new Sizage(4, 0, 48, 0),\n    '1AAJ': new Sizage(4, 0, 48, 0),\n    '2AAA': new Sizage(4, 0, 8, 1),\n    '3AAA': new Sizage(4, 0, 8, 2),\n    '4A': new Sizage(2, 2, undefined, 0),\n    '5A': new Sizage(2, 2, undefined, 1),\n    '6A': new Sizage(2, 2, undefined, 2),\n    '7AAA': new Sizage(4, 4, undefined, 0),\n    '8AAA': new Sizage(4, 4, undefined, 1),\n    '9AAA': new Sizage(4, 4, undefined, 2),\n    '4B': new Sizage(2, 2, undefined, 0),\n    '5B': new Sizage(2, 2, undefined, 1),\n    '6B': new Sizage(2, 2, undefined, 2),\n    '7AAB': new Sizage(4, 4, undefined, 0),\n    '8AAB': new Sizage(4, 4, undefined, 1),\n    '9AAB': new Sizage(4, 4, undefined, 2),\n}));\nMatter.Hards = new Map([\n    ['A', 1],\n    ['B', 1],\n    ['C', 1],\n    ['D', 1],\n    ['E', 1],\n    ['F', 1],\n    ['G', 1],\n    ['H', 1],\n    ['I', 1],\n    ['J', 1],\n    ['K', 1],\n    ['L', 1],\n    ['M', 1],\n    ['N', 1],\n    ['O', 1],\n    ['P', 1],\n    ['Q', 1],\n    ['R', 1],\n    ['S', 1],\n    ['T', 1],\n    ['U', 1],\n    ['V', 1],\n    ['W', 1],\n    ['X', 1],\n    ['Y', 1],\n    ['Z', 1],\n    ['a', 1],\n    ['b', 1],\n    ['c', 1],\n    ['d', 1],\n    ['e', 1],\n    ['f', 1],\n    ['g', 1],\n    ['h', 1],\n    ['i', 1],\n    ['j', 1],\n    ['k', 1],\n    ['l', 1],\n    ['m', 1],\n    ['n', 1],\n    ['o', 1],\n    ['p', 1],\n    ['q', 1],\n    ['r', 1],\n    ['s', 1],\n    ['t', 1],\n    ['u', 1],\n    ['v', 1],\n    ['w', 1],\n    ['x', 1],\n    ['y', 1],\n    ['z', 1],\n    ['0', 2],\n    ['1', 4],\n    ['2', 4],\n    ['3', 4],\n    ['4', 2],\n    ['5', 2],\n    ['6', 2],\n    ['7', 4],\n    ['8', 4],\n    ['9', 4],\n]);\n","import libsodium from 'libsodium-wrappers-sumo';\nimport { Matter, MtrDex } from \"./matter.js\";\nimport { p256 } from '@noble/curves/p256';\nimport { b } from \"./core.js\";\nconst VERFER_CODES = new Set([\n    MtrDex.Ed25519N,\n    MtrDex.Ed25519,\n    MtrDex.ECDSA_256r1N,\n    MtrDex.ECDSA_256r1,\n]);\n/**\n * @description  Verfer :sublclass of Matter,helps to verify signature of serialization\n *  using .raw as verifier key and .code as signature cypher suite\n */\nexport class Verfer extends Matter {\n    constructor({ raw, code, qb64, qb64b, qb2 }) {\n        super({ raw, code, qb64, qb64b, qb2 });\n        if (!VERFER_CODES.has(this.code)) {\n            throw new Error(`Unsupported code = ${this.code} for verifier.`);\n        }\n    }\n    verify(sig, ser) {\n        switch (this.code) {\n            case MtrDex.Ed25519:\n            case MtrDex.Ed25519N: {\n                return libsodium.crypto_sign_verify_detached(sig, ser, this.raw);\n            }\n            case MtrDex.ECDSA_256r1:\n            case MtrDex.ECDSA_256r1N: {\n                const message = typeof ser === 'string' ? b(ser) : ser;\n                return p256.verify(sig, message, this.raw);\n            }\n            default:\n                throw new Error(`Unsupported code = ${this.code} for verifier.`);\n        }\n    }\n}\n","import { Matter } from \"./matter.js\";\nexport class Cigar extends Matter {\n    constructor({ raw, code, qb64, qb64b, qb2 }, verfer) {\n        super({ raw, code, qb64, qb64b, qb2 });\n        this._verfer = verfer;\n    }\n    get verfer() {\n        return this._verfer;\n    }\n    set verfer(verfer) {\n        this._verfer = verfer;\n    }\n}\n","import { EmptyMaterialError } from \"./kering.js\";\nimport { b, b64ToInt, d, intToB64, readInt } from \"./core.js\";\nimport { decodeBase64Url, encodeBase64Url } from \"./base64.js\";\nexport class IndexerCodex {\n    constructor() {\n        this.Ed25519_Sig = 'A'; // Ed25519 sig appears same in both lists if any.\n        this.Ed25519_Crt_Sig = 'B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Sig = 'C'; // ECDSA secp256k1 sig appears same in both lists if any.\n        this.ECDSA_256k1_Crt_Sig = 'D'; // ECDSA secp256k1 sig appears in current list.\n        this.ECDSA_256r1_Sig = 'E'; // ECDSA secp256r1 sig appears same in both lists if any.\n        this.ECDSA_256r1_Crt_Sig = 'F'; // ECDSA secp256r1 sig appears in current list.\n        this.Ed448_Sig = '0A'; // Ed448 signature appears in both lists.\n        this.Ed448_Crt_Sig = '0B'; // Ed448 signature appears in current list only.\n        this.Ed25519_Big_Sig = '2A'; // Ed25519 sig appears in both lists.\n        this.Ed25519_Big_Crt_Sig = '2B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Big_Sig = '2C'; // ECDSA secp256k1 sig appears in both lists.\n        this.ECDSA_256k1_Big_Crt_Sig = '2D'; // ECDSA secp256k1 sig appears in current list only.\n        this.ECDSA_256r1_Big_Sig = '2E'; // ECDSA secp256r1 sig appears in both lists.\n        this.ECDSA_256r1_Big_Crt_Sig = '2F'; // ECDSA secp256r1 sig appears in current list only.\n        this.Ed448_Big_Sig = '3A'; // Ed448 signature appears in both lists.\n        this.Ed448_Big_Crt_Sig = '3B'; // Ed448 signature appears in current list only.\n    }\n}\nexport const IdrDex = new IndexerCodex();\nexport class IndexedSigCodex {\n    constructor() {\n        this.Ed25519_Sig = 'A'; // Ed25519 sig appears same in both lists if any.\n        this.Ed25519_Crt_Sig = 'B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Sig = 'C'; // ECDSA secp256k1 sig appears same in both lists if any.\n        this.ECDSA_256k1_Crt_Sig = 'D'; // ECDSA secp256k1 sig appears in current list.\n        this.ECDSA_256r1_Sig = 'E'; // ECDSA secp256r1 sig appears same in both lists if any.\n        this.ECDSA_256r1_Crt_Sig = 'F'; // ECDSA secp256r1 sig appears in current list.\n        this.Ed448_Sig = '0A'; // Ed448 signature appears in both lists.\n        this.Ed448_Crt_Sig = '0B'; // Ed448 signature appears in current list only.\n        this.Ed25519_Big_Sig = '2A'; // Ed25519 sig appears in both lists.\n        this.Ed25519_Big_Crt_Sig = '2B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Big_Sig = '2C'; // ECDSA secp256k1 sig appears in both lists.\n        this.ECDSA_256k1_Big_Crt_Sig = '2D'; // ECDSA secp256k1 sig appears in current list only.\n        this.ECDSA_256r1_Big_Sig = '2E'; // ECDSA secp256r1 sig appears in both lists.\n        this.ECDSA_256r1_Big_Crt_Sig = '2F'; // ECDSA secp256r1 sig appears in current list only.\n        this.Ed448_Big_Sig = '3A'; // Ed448 signature appears in both lists.\n        this.Ed448_Big_Crt_Sig = '3B'; // Ed448 signature appears in current list only.\n    }\n    has(prop) {\n        const m = new Map(Array.from(Object.entries(this), (v) => [v[1], v[0]]));\n        return m.has(prop);\n    }\n}\nexport const IdxSigDex = new IndexedSigCodex();\nexport class IndexedCurrentSigCodex {\n    constructor() {\n        this.Ed25519_Crt_Sig = 'B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Crt_Sig = 'D'; // ECDSA secp256k1 sig appears in current list only.\n        this.ECDSA_256r1_Crt_Sig = 'F'; // ECDSA secp256r1 sig appears in current list.\n        this.Ed448_Crt_Sig = '0B'; // Ed448 signature appears in current list only.\n        this.Ed25519_Big_Crt_Sig = '2B'; // Ed25519 sig appears in current list only.\n        this.ECDSA_256k1_Big_Crt_Sig = '2D'; // ECDSA secp256k1 sig appears in current list only.\n        this.ECDSA_256r1_Big_Crt_Sig = '2F'; // ECDSA secp256r1 sig appears in current list only.\n        this.Ed448_Big_Crt_Sig = '3B'; // Ed448 signature appears in current list only.\n    }\n    has(prop) {\n        const m = new Map(Array.from(Object.entries(this), (v) => [v[1], v[0]]));\n        return m.has(prop);\n    }\n}\nexport const IdxCrtSigDex = new IndexedCurrentSigCodex();\nexport class IndexedBothSigCodex {\n    constructor() {\n        this.Ed25519_Sig = 'A'; // Ed25519 sig appears same in both lists if any.\n        this.ECDSA_256k1_Sig = 'C'; // ECDSA secp256k1 sig appears same in both lists if any.\n        this.Ed448_Sig = '0A'; // Ed448 signature appears in both lists.\n        this.Ed25519_Big_Sig = '2A'; // Ed25519 sig appears in both listsy.\n        this.ECDSA_256k1_Big_Sig = '2C'; // ECDSA secp256k1 sig appears in both lists.\n        this.Ed448_Big_Sig = '3A'; // Ed448 signature appears in both lists.\n    }\n    has(prop) {\n        const m = new Map(Array.from(Object.entries(this), (v) => [v[1], v[0]]));\n        return m.has(prop);\n    }\n}\nexport const IdxBthSigDex = new IndexedBothSigCodex();\nexport class Xizage {\n    constructor(hs, ss, os, fs, ls) {\n        this.hs = hs;\n        this.ss = ss;\n        this.os = os;\n        this.fs = fs;\n        this.ls = ls;\n    }\n}\nexport class Indexer {\n    constructor({ raw = undefined, code = IdrDex.Ed25519_Sig, index = 0, ondex = undefined, qb64b = undefined, qb64 = undefined, qb2 = undefined, }) {\n        this.Codex = IdrDex;\n        this._code = '';\n        this._index = -1;\n        this._raw = new Uint8Array(0);\n        if (raw != undefined) {\n            if (code == undefined) {\n                throw new EmptyMaterialError(`Improper initialization need either (raw and code) or qb64b or qb64 or qb2.`);\n            }\n            if (!Indexer.Sizes.has(code)) {\n                throw new Error(`Unsupported code=${code}.`);\n            }\n            const xizage = Indexer.Sizes.get(code);\n            const os = xizage.os;\n            const fs = xizage.fs;\n            const cs = xizage.hs + xizage.ss;\n            const ms = xizage.ss - xizage.os;\n            if (!Number.isInteger(index) || index < 0 || index > 64 ** ms - 1) {\n                throw new Error(`Invalid index=${index} for code=${code}.`);\n            }\n            if (ondex != undefined &&\n                xizage.os != 0 &&\n                !(ondex >= 0 && ondex <= 64 ** os - 1)) {\n                throw new Error(`Invalid ondex=${ondex} for code=${code}.`);\n            }\n            if (IdxCrtSigDex.has(code) && ondex != undefined) {\n                throw new Error(`Non None ondex=${ondex} for code=${code}.`);\n            }\n            if (IdxBthSigDex.has(code)) {\n                if (ondex == undefined) {\n                    ondex = index;\n                }\n                else {\n                    if (ondex != index && os == 0) {\n                        throw new Error(`Non matching ondex=${ondex} and index=${index} for code=${code}.`);\n                    }\n                }\n            }\n            if (fs == undefined) {\n                throw new Error('variable length unsupported');\n            }\n            // TODO: Don't support this code\n            //  if not fs:  # compute fs from index\n            //       if cs % 4:\n            //           raise InvalidCodeSizeError(f\"Whole code size not multiple of 4 for \"\n            //                                      f\"variable length material. cs={cs}.\")\n            //       if os != 0:\n            //           raise InvalidCodeSizeError(f\"Non-zero other index size for \"\n            //                                      f\"variable length material. os={os}.\")\n            //       fs = (index * 4) + cs\n            const rawsize = Math.floor(((fs - cs) * 3) / 4);\n            raw = raw.slice(0, rawsize);\n            if (raw.length != rawsize) {\n                throw new Error(`Not enougth raw bytes for code=${code} and index=${index} ,expected ${rawsize} got ${raw.length}.`);\n            }\n            this._code = code;\n            this._index = index;\n            this._ondex = ondex;\n            this._raw = raw;\n        }\n        else if (qb64b != undefined) {\n            const qb64 = d(qb64b);\n            this._exfil(qb64);\n        }\n        else if (qb64 != undefined) {\n            this._exfil(qb64);\n        }\n        else if (qb2 != undefined) {\n            this._bexfil(qb2);\n        }\n        else {\n            throw new EmptyMaterialError(`Improper initialization need either (raw and code and index) or qb64b or qb64 or qb2.`);\n        }\n    }\n    _bexfil(qb2) {\n        throw new Error(`qb2 not yet supported: ${qb2}`);\n    }\n    static _rawSize(code) {\n        const xizage = Indexer.Sizes.get(code);\n        return Math.floor(xizage.fs - ((xizage.hs + xizage.ss) * 3) / 4);\n    }\n    get code() {\n        return this._code;\n    }\n    get raw() {\n        return this._raw;\n    }\n    get index() {\n        return this._index;\n    }\n    get ondex() {\n        return this._ondex;\n    }\n    get qb64() {\n        return this._infil();\n    }\n    get qb64b() {\n        return b(this.qb64);\n    }\n    _infil() {\n        const code = this.code;\n        const index = this.index;\n        const ondex = this.ondex;\n        const raw = this.raw;\n        const ps = (3 - (raw.length % 3)) % 3;\n        const xizage = Indexer.Sizes.get(code);\n        const cs = xizage.hs + xizage.ss;\n        const ms = xizage.ss - xizage.os;\n        // TODO: don't support this code\n        //  if not fs:  # compute fs from index\n        //       if cs % 4:\n        //           raise InvalidCodeSizeError(f\"Whole code size not multiple of 4 for \"\n        //                                      f\"variable length material. cs={cs}.\")\n        //       if os != 0:\n        //           raise InvalidCodeSizeError(f\"Non-zero other index size for \"\n        //                                      f\"variable length material. os={os}.\")\n        //       fs = (index * 4) + cs\n        if (index < 0 || index > 64 ** ms - 1) {\n            throw new Error(`Invalid index=${index} for code=${code}.`);\n        }\n        if (ondex != undefined &&\n            xizage.os != 0 &&\n            !(ondex >= 0 && ondex <= 64 ** xizage.os - 1)) {\n            throw new Error(`Invalid ondex=${ondex} for os=${xizage.os} and code=${code}.`);\n        }\n        const both = `${code}${intToB64(index, ms)}${intToB64(ondex == undefined ? 0 : ondex, xizage.os)}`;\n        if (both.length != cs) {\n            throw new Error(`Mismatch code size = ${cs} with table = ${both.length}.`);\n        }\n        if (cs % 4 != ps - xizage.ls) {\n            throw new Error(`Invalid code=${both} for converted raw pad size=${ps}.`);\n        }\n        const bytes = new Uint8Array(ps + raw.length);\n        for (let i = 0; i < ps; i++) {\n            bytes[i] = 0;\n        }\n        for (let i = 0; i < raw.length; i++) {\n            const odx = i + ps;\n            bytes[odx] = raw[i];\n        }\n        const full = both + encodeBase64Url(bytes).slice(ps - xizage.ls);\n        if (full.length != xizage.fs) {\n            throw new Error(`Invalid code=${both} for raw size=${raw.length}.`);\n        }\n        return full;\n    }\n    _exfil(qb64) {\n        if (qb64.length == 0) {\n            throw new Error('Empty Material');\n        }\n        const first = qb64[0];\n        if (!Array.from(Indexer.Hards.keys()).includes(first)) {\n            throw new Error(`Unexpected code ${first}`);\n        }\n        const hs = Indexer.Hards.get(first);\n        if (qb64.length < hs) {\n            throw new Error(`Need ${hs - qb64.length} more characters.`);\n        }\n        const hard = qb64.slice(0, hs);\n        if (!Array.from(Indexer.Sizes.keys()).includes(hard)) {\n            throw new Error(`Unsupported code ${hard}`);\n        }\n        const xizage = Indexer.Sizes.get(hard);\n        const cs = xizage.hs + xizage.ss; // both hard + soft code size\n        const ms = xizage.ss - xizage.os;\n        if (qb64.length < cs) {\n            throw new Error(`Need ${cs - qb64.length} more characters.`);\n        }\n        const sindex = qb64.slice(hs, hs + ms);\n        const index = b64ToInt(sindex);\n        const sondex = qb64.slice(hs + ms, hs + ms + xizage.os);\n        let ondex;\n        if (IdxCrtSigDex.has(hard)) {\n            ondex = xizage.os != 0 ? b64ToInt(sondex) : undefined;\n            if (ondex != 0 && ondex != undefined) {\n                throw new Error(`Invalid ondex=${ondex} for code=${hard}.`);\n            }\n            else {\n                ondex = undefined;\n            }\n        }\n        else {\n            ondex = xizage.os != 0 ? b64ToInt(sondex) : index;\n        }\n        if (xizage.fs == undefined) {\n            throw new Error('variable length not supported');\n        }\n        // TODO: support variable length\n        // if not fs:  # compute fs from index which means variable length\n        //     if cs % 4:\n        //         raise ValidationError(f\"Whole code size not multiple of 4 for \"\n        //                               f\"variable length material. cs={cs}.\")\n        //     if os != 0:\n        //         raise ValidationError(f\"Non-zero other index size for \"\n        //                               f\"variable length material. os={os}.\")\n        //     fs = (index * 4) + cs\n        if (qb64.length < xizage.fs) {\n            throw new Error(`Need ${xizage.fs - qb64.length} more chars.`);\n        }\n        qb64 = qb64.slice(0, xizage.fs);\n        const ps = cs % 4;\n        const pbs = 2 * ps != 0 ? ps : xizage.ls;\n        let raw;\n        if (ps != 0) {\n            const base = new Array(ps + 1).join('A') + qb64.slice(cs);\n            const paw = decodeBase64Url(base); // decode base to leave prepadded raw\n            const pi = readInt(paw.slice(0, ps)); // prepad as int\n            if (pi & (2 ** pbs - 1)) {\n                // masked pad bits non-zero\n                throw new Error(`Non zeroed prepad bits = {pi & (2 ** pbs - 1 ):<06b} in {qb64b[cs:cs+1]}.`);\n            }\n            raw = paw.slice(ps); // strip off ps prepad paw bytes\n        }\n        else {\n            const base = qb64.slice(cs);\n            const paw = decodeBase64Url(base);\n            const li = readInt(paw.slice(0, xizage.ls));\n            if (li != 0) {\n                if (li == 1) {\n                    throw new Error(`Non zeroed lead byte = 0x{li:02x}.`);\n                }\n                else {\n                    throw new Error(`Non zeroed lead bytes = 0x{li:04x}`);\n                }\n            }\n            raw = paw.slice(xizage.ls);\n        }\n        if (raw.length != Math.floor(((qb64.length - cs) * 3) / 4)) {\n            throw new Error(`Improperly qualified material = ${qb64}`);\n        }\n        this._code = hard;\n        this._index = index;\n        this._ondex = ondex;\n        this._raw = new Uint8Array(raw); // must be bytes for crpto opts and immutable not bytearray\n    }\n}\nIndexer.Hards = new Map([\n    ['A', 1],\n    ['B', 1],\n    ['C', 1],\n    ['D', 1],\n    ['E', 1],\n    ['F', 1],\n    ['G', 1],\n    ['H', 1],\n    ['I', 1],\n    ['J', 1],\n    ['K', 1],\n    ['L', 1],\n    ['M', 1],\n    ['N', 1],\n    ['O', 1],\n    ['P', 1],\n    ['Q', 1],\n    ['R', 1],\n    ['S', 1],\n    ['T', 1],\n    ['U', 1],\n    ['V', 1],\n    ['W', 1],\n    ['X', 1],\n    ['Y', 1],\n    ['Z', 1],\n    ['a', 1],\n    ['b', 1],\n    ['c', 1],\n    ['d', 1],\n    ['e', 1],\n    ['f', 1],\n    ['g', 1],\n    ['h', 1],\n    ['i', 1],\n    ['j', 1],\n    ['k', 1],\n    ['l', 1],\n    ['m', 1],\n    ['n', 1],\n    ['o', 1],\n    ['p', 1],\n    ['q', 1],\n    ['r', 1],\n    ['s', 1],\n    ['t', 1],\n    ['u', 1],\n    ['v', 1],\n    ['w', 1],\n    ['x', 1],\n    ['y', 1],\n    ['z', 1],\n    ['0', 2],\n    ['1', 2],\n    ['2', 2],\n    ['3', 2],\n    ['4', 2],\n]);\nIndexer.Sizes = new Map(Object.entries({\n    A: new Xizage(1, 1, 0, 88, 0),\n    B: new Xizage(1, 1, 0, 88, 0),\n    C: new Xizage(1, 1, 0, 88, 0),\n    D: new Xizage(1, 1, 0, 88, 0),\n    E: new Xizage(1, 1, 0, 88, 0),\n    F: new Xizage(1, 1, 0, 88, 0),\n    '0A': new Xizage(2, 2, 1, 156, 0),\n    '0B': new Xizage(2, 2, 1, 156, 0),\n    '2A': new Xizage(2, 4, 2, 92, 0),\n    '2B': new Xizage(2, 4, 2, 92, 0),\n    '2C': new Xizage(2, 4, 2, 92, 0),\n    '2D': new Xizage(2, 4, 2, 92, 0),\n    '2E': new Xizage(2, 4, 2, 92, 0),\n    '2F': new Xizage(2, 4, 2, 92, 0),\n    '3A': new Xizage(2, 6, 3, 160, 0),\n    '3B': new Xizage(2, 6, 3, 160, 0),\n    '0z': new Xizage(2, 2, 0, undefined, 0),\n    '1z': new Xizage(2, 2, 1, 76, 1),\n    '4z': new Xizage(2, 6, 3, 80, 1),\n}));\n","import { IdxSigDex, Indexer } from \"./indexer.js\";\n/**\n   Siger is subclass of Indexer, indexed signature material,\n    Adds .verfer property which is instance of Verfer that provides\n          associated signature verifier.\n\n    See Indexer for inherited attributes and properties:\n\n    Attributes:\n\n    Properties:\n        .verfer is Verfer object instance\n\n    Methods:\n **/\nexport class Siger extends Indexer {\n    constructor({ raw, code, index, ondex, qb64, qb64b, qb2 }, verfer) {\n        super({ raw, code, index, ondex, qb64, qb64b, qb2 });\n        if (!IdxSigDex.has(this.code)) {\n            throw new Error(`Invalid code = ${this.code} for Siger.`);\n        }\n        this._verfer = verfer;\n    }\n    get verfer() {\n        return this._verfer;\n    }\n    set verfer(verfer) {\n        this._verfer = verfer;\n    }\n}\n","import { EmptyMaterialError } from \"./kering.js\";\nimport libsodium from 'libsodium-wrappers-sumo';\nimport { Matter } from \"./matter.js\";\nimport { MtrDex } from \"./matter.js\";\nimport { Verfer } from \"./verfer.js\";\nimport { Cigar } from \"./cigar.js\";\nimport { Siger } from \"./siger.js\";\nimport { IdrDex } from \"./indexer.js\";\nimport { concat } from \"./core.js\";\nexport class Signer extends Matter {\n    constructor({ raw, code = MtrDex.Ed25519_Seed, qb64, qb64b, qb2, transferable = true, }) {\n        try {\n            super({ raw, code, qb64, qb64b, qb2 });\n        }\n        catch (e) {\n            if (e instanceof EmptyMaterialError) {\n                if (code == MtrDex.Ed25519_Seed) {\n                    const raw = libsodium.randombytes_buf(libsodium.crypto_sign_SEEDBYTES);\n                    super({ raw, code, qb64, qb64b, qb2 });\n                }\n                else {\n                    throw new Error(`Unsupported signer code = ${code}.`);\n                }\n            }\n            else {\n                throw e;\n            }\n        }\n        let verfer;\n        if (this.code == MtrDex.Ed25519_Seed) {\n            this._sign = this._ed25519;\n            const keypair = libsodium.crypto_sign_seed_keypair(this.raw);\n            verfer = new Verfer({\n                raw: keypair.publicKey,\n                code: transferable ? MtrDex.Ed25519 : MtrDex.Ed25519N,\n            });\n        }\n        else {\n            throw new Error(`Unsupported signer code = ${this.code}.`);\n        }\n        this._verfer = verfer;\n    }\n    /**\n     * @description Property verfer:\n     Returns Verfer instance\n     Assumes ._verfer is correctly assigned\n     */\n    get verfer() {\n        return this._verfer;\n    }\n    sign(ser, index = null, only = false, ondex = undefined) {\n        return this._sign(ser, this.raw, this.verfer, index, only, ondex);\n    }\n    _ed25519(ser, seed, verfer, index, only = false, ondex) {\n        const sig = libsodium.crypto_sign_detached(ser, concat(seed, verfer.raw));\n        if (index == null) {\n            return new Cigar({ raw: sig, code: MtrDex.Ed25519_Sig }, verfer);\n        }\n        else {\n            let code;\n            if (only) {\n                ondex = undefined;\n                if (index <= 63) {\n                    code = IdrDex.Ed25519_Crt_Sig;\n                }\n                else {\n                    code = IdrDex.Ed25519_Big_Crt_Sig;\n                }\n            }\n            else {\n                if (ondex == undefined) {\n                    ondex = index;\n                }\n                if (ondex == index && index <= 63)\n                    // both same and small\n                    code = IdrDex.Ed25519_Sig; //  use  small both same\n                //  otherwise big or both not same so use big both\n                else\n                    code = IdrDex.Ed25519_Big_Sig; // use use big both\n            }\n            return new Siger({ raw: sig, code: code, index: index, ondex: ondex }, verfer);\n        }\n    }\n}\n","import { Signer } from \"./signer.js\";\nimport { Matter, MtrDex } from \"./matter.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\nimport libsodium from 'libsodium-wrappers-sumo';\n/**\n * Secret derivation security tier.\n */\nexport var Tier;\n(function (Tier) {\n    Tier[\"low\"] = \"low\";\n    Tier[\"med\"] = \"med\";\n    Tier[\"high\"] = \"high\";\n})(Tier || (Tier = {}));\n/**\n * Maintains a random salt for secrets (private keys).\n * Its .raw is random salt, .code as cipher suite for salt\n */\nexport class Salter extends Matter {\n    /**\n     * Creates a Salter from the provided raw salt bytes or generates a random salt if raw is not provided.\n     * Defaults to low security tier. Only supports Salt_128 salt type.\n     * @param salterArgs defines the kind of cryptographic seed to create with a variety of raw material initialization sources.\n     */\n    constructor(salterArgs) {\n        const { raw, code = MtrDex.Salt_128, tier = Tier.low, qb64, qb64b, qb2, } = salterArgs;\n        try {\n            super({ raw, code, qb64, qb64b, qb2 });\n        }\n        catch (e) {\n            if (e instanceof EmptyMaterialError) {\n                if (code == MtrDex.Salt_128) {\n                    const salt = libsodium.randombytes_buf(libsodium.crypto_pwhash_SALTBYTES);\n                    super({ raw: salt, code: code });\n                }\n                else {\n                    throw new Error('invalid code for Salter, only Salt_128 accepted');\n                }\n            }\n            else {\n                throw e;\n            }\n        }\n        if (this.code != MtrDex.Salt_128) {\n            throw new Error('invalid code for Salter, only Salt_128 accepted');\n        }\n        this._tier = tier !== null ? tier : Tier.low;\n    }\n    /**\n     * Stretches the salt to a secret key using the path, .raw, tier, and size determined by self.code.\n     *\n     * @param size number of bytes of the stretched seed\n     * @param path string of bytes prepended (prefixed) to the salt before stretching\n     * @param tier security tier for stretching\n     * @param temp boolean, True means use temporary, insecure tier; for testing only\n     * @returns stretched raw binary seed (secret) derived from path and .raw, and size using argon2d stretching algorithm.\n     * @private\n     */\n    stretch(size = 32, path = '', tier = null, temp = false) {\n        tier = tier == null ? this.tier : tier;\n        let opslimit, memlimit;\n        // Harcoded values based on keripy\n        if (temp) {\n            opslimit = 1; //libsodium.crypto_pwhash_OPSLIMIT_MIN\n            memlimit = 8192; //libsodium.crypto_pwhash_MEMLIMIT_MIN\n        }\n        else {\n            switch (tier) {\n                case Tier.low:\n                    opslimit = 2; //libsodium.crypto_pwhash_OPSLIMIT_INTERACTIVE\n                    memlimit = 67108864; //libsodium.crypto_pwhash_MEMLIMIT_INTERACTIVE\n                    break;\n                case Tier.med:\n                    opslimit = 3; //libsodium.crypto_pwhash_OPSLIMIT_MODERATE\n                    memlimit = 268435456; //libsodium.crypto_pwhash_MEMLIMIT_MODERATE\n                    break;\n                case Tier.high:\n                    opslimit = 4; //libsodium.crypto_pwhash_OPSLIMIT_SENSITIVE\n                    memlimit = 1073741824; //libsodium.crypto_pwhash_MEMLIMIT_SENSITIVE\n                    break;\n                default:\n                    throw new Error(`Unsupported security tier = ${tier}.`);\n            }\n        }\n        return libsodium.crypto_pwhash(size, path, this.raw, opslimit, memlimit, libsodium.crypto_pwhash_ALG_ARGON2ID13);\n    }\n    /**\n     * Returns Signer with the private key secret derived from code the path, the user entered passcode as a salt,\n     * and the security tier sized by the CESR cryptographic seed size indicated by the code. See the example below.\n     * The Signer's public key for its .verfer is derived from its private key, the Matter code, and the transferable boolean.\n     *\n     * The construction of the raw hash bytes used looks like this:\n     *  (      size,               password, salt                                   )\n     *  where\n     *  ( code size,                   path, Base64Decode(passcode)                 )\n     *  for example, for the initial inception signing key the following parameters are used:\n     *  (        32, \"signify:controller00\", Base64Decode(\"Athisismysecretkeyseed\") )\n     *  and for the initial rotation key pair the following parameters are used:\n     *  (        32, \"signify:controller01\", Base64Decode(\"Athisismysecretkeyseed\") )\n     *\n     * @param code derivation code indicating seed type\n     * @param transferable whether or not the key is for a transferable or non-transferable identifier.\n     * @param path string of bytes prepended (prefixed) to the salt before stretching\n     * @param tier security tier for stretching\n     * @param temp boolean, True means use temporary, insecure tier; for testing only\n     */\n    signer(code = MtrDex.Ed25519_Seed, transferable = true, path = '', tier = null, temp = false) {\n        const seed = this.stretch(Matter._rawSize(code), path, tier, temp);\n        return new Signer({\n            raw: seed, // private key\n            code: code,\n            transferable: transferable,\n        });\n    }\n    get tier() {\n        return this._tier;\n    }\n}\n","import libsodium from 'libsodium-wrappers-sumo';\nimport { Matter, MtrDex } from \"./matter.js\";\nimport { Signer } from \"./signer.js\";\nimport { Cipher } from \"./cipher.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\nimport { Salter } from \"./salter.js\";\nexport class Decrypter extends Matter {\n    constructor({ raw, code = MtrDex.X25519_Private, qb64, qb64b, qb2 }, seed = undefined) {\n        try {\n            super({ raw, code, qb64, qb64b, qb2 });\n        }\n        catch (e) {\n            if (e instanceof EmptyMaterialError) {\n                if (seed != undefined) {\n                    const signer = new Signer({ qb64b: seed });\n                    if (signer.code != MtrDex.Ed25519_Seed) {\n                        throw new Error(`Unsupported signing seed derivation code ${signer.code}`);\n                    }\n                    const sigkey = new Uint8Array(signer.raw.length + signer.verfer.raw.length);\n                    sigkey.set(signer.raw);\n                    sigkey.set(signer.verfer.raw, signer.raw.length);\n                    raw =\n                        libsodium.crypto_sign_ed25519_sk_to_curve25519(sigkey);\n                    super({ raw, code, qb64, qb64b, qb2 });\n                }\n                else {\n                    throw e;\n                }\n            }\n            else {\n                throw e;\n            }\n        }\n        if (this.code == MtrDex.X25519_Private) {\n            this._decrypt = this._x25519;\n        }\n        else {\n            throw new Error(`Unsupported decrypter code = ${this.code}.`);\n        }\n    }\n    decrypt(ser = null, cipher = null, transferable = false) {\n        if (ser == null && cipher == null) {\n            throw new EmptyMaterialError('Neither ser or cipher were provided');\n        }\n        if (ser != null) {\n            cipher = new Cipher({ qb64b: ser });\n        }\n        return this._decrypt(cipher, this.raw, transferable);\n    }\n    _x25519(cipher, prikey, transferable = false) {\n        const pubkey = libsodium.crypto_scalarmult_base(prikey);\n        const plain = libsodium.crypto_box_seal_open(cipher.raw, pubkey, prikey);\n        if (cipher.code == MtrDex.X25519_Cipher_Salt) {\n            return new Salter({ qb64b: plain });\n        }\n        else if (cipher.code == MtrDex.X25519_Cipher_Seed) {\n            return new Signer({ qb64b: plain, transferable: transferable });\n        }\n        else {\n            throw new Error(`Unsupported cipher text code == ${cipher.code}`);\n        }\n    }\n}\n","import { Matter, MtrDex } from \"./matter.js\";\nimport { Decrypter } from \"./decrypter.js\";\nexport class Cipher extends Matter {\n    constructor({ raw, code, qb64, qb64b, qb2 }) {\n        if (raw != undefined && code == undefined) {\n            if (raw.length == Matter._rawSize(MtrDex.X25519_Cipher_Salt)) {\n                code = MtrDex.X25519_Cipher_Salt;\n            }\n            else if (raw.length == Matter._rawSize(MtrDex.X25519_Cipher_Seed)) {\n                code = MtrDex.X25519_Cipher_Salt;\n            }\n        }\n        super({ raw: raw, code: code, qb64b: qb64b, qb64: qb64, qb2: qb2 });\n        if (!Array.from([\n            MtrDex.X25519_Cipher_Salt,\n            MtrDex.X25519_Cipher_Seed,\n        ]).includes(this.code)) {\n            throw new Error(`Unsupported Cipher code == ${this.code}`);\n        }\n    }\n    decrypt(prikey = undefined, seed = undefined) {\n        const decrypter = new Decrypter({ qb64b: prikey }, seed);\n        return decrypter.decrypt(this.qb64b);\n    }\n}\n","import { Codex, Sizage } from \"./matter.js\";\nimport { b, b64ToInt, d, intToB64 } from \"./core.js\";\nexport class CounterCodex extends Codex {\n    constructor() {\n        super(...arguments);\n        this.ControllerIdxSigs = '-A'; // Qualified Base64 Indexed Signature.\n        this.WitnessIdxSigs = '-B'; // Qualified Base64 Indexed Signature.\n        this.NonTransReceiptCouples = '-C'; // Composed Base64 Couple, pre+cig.\n        this.TransReceiptQuadruples = '-D'; // Composed Base64 Quadruple, pre+snu+dig+sig.\n        this.FirstSeenReplayCouples = '-E'; // Composed Base64 Couple, fnu+dts.\n        this.TransIdxSigGroups = '-F'; // Composed Base64 Group, pre+snu+dig+ControllerIdxSigs group.\n        this.SealSourceCouples = '-G'; // Composed Base64 couple, snu+dig of given delegators or issuers event\n        this.TransLastIdxSigGroups = '-H'; // Composed Base64 Group, pre+ControllerIdxSigs group.\n        this.SealSourceTriples = '-I'; // Composed Base64 triple, pre+snu+dig of anchoring source event\n        this.SadPathSig = '-J'; // Composed Base64 Group path+TransIdxSigGroup of SAID of content\n        this.SadPathSigGroup = '-K'; // Composed Base64 Group, root(path)+SaidPathCouples\n        this.PathedMaterialQuadlets = '-L'; // Composed Grouped Pathed Material Quadlet (4 char each)\n        this.AttachedMaterialQuadlets = '-V'; // Composed Grouped Attached Material Quadlet (4 char each)\n        this.BigAttachedMaterialQuadlets = '-0V'; // Composed Grouped Attached Material Quadlet (4 char each)\n        this.KERIProtocolStack = '--AAA'; // KERI ACDC Protocol Stack CESR Version\n    }\n}\nexport const CtrDex = new CounterCodex();\nexport class Counter {\n    constructor({ code, count, countB64, qb64b, qb64, qb2 }) {\n        this._code = '';\n        this._count = -1;\n        if (code != undefined) {\n            if (!Counter.Sizes.has(code)) {\n                throw new Error(`\"Unsupported code=${code}.`);\n            }\n            const sizage = Counter.Sizes.get(code);\n            const cs = sizage.hs + sizage.ss;\n            if (sizage.fs != cs || cs % 4 != 0) {\n                throw new Error(`Whole code size not full size or not multiple of 4. cs=${cs} fs=${sizage.fs}.`);\n            }\n            if (count == undefined) {\n                count = countB64 == undefined ? 1 : b64ToInt(countB64);\n            }\n            if (count < 0 || count > 64 ** sizage.ss - 1) {\n                throw new Error(`Invalid count=${count} for code=${code}.`);\n            }\n            this._code = code;\n            this._count = count;\n        }\n        else if (qb64b != undefined) {\n            const qb64 = d(qb64b);\n            this._exfil(qb64);\n        }\n        else if (qb64 != undefined) {\n            this._exfil(qb64);\n        }\n        else if (qb2 != undefined) {\n        }\n        else {\n            throw new Error(`Improper initialization need either (code and count) or qb64b or qb64 or qb2.`);\n        }\n    }\n    get code() {\n        return this._code;\n    }\n    get count() {\n        return this._count;\n    }\n    get qb64() {\n        return this._infil();\n    }\n    get qb64b() {\n        return b(this.qb64);\n    }\n    countToB64(l) {\n        if (l == undefined) {\n            const sizage = Counter.Sizes.get(this.code);\n            l = sizage.ss;\n        }\n        return intToB64(this.count, l);\n    }\n    static semVerToB64(version = '', major = 0, minor = 0, patch = 0) {\n        let parts = [major, minor, patch];\n        if (version != '') {\n            const ssplits = version.split('.');\n            const splits = ssplits.map((x) => {\n                if (x == '')\n                    return 0;\n                return parseInt(x);\n            });\n            const off = splits.length;\n            const x = 3 - off;\n            for (let i = 0; i < x; i++) {\n                splits.push(parts[i + off]);\n            }\n            parts = splits;\n        }\n        parts.forEach((p) => {\n            if (p < 0 || p > 63) {\n                throw new Error(`Out of bounds semantic version. Part=${p} is < 0 or > 63.`);\n            }\n        });\n        return parts\n            .map((p) => {\n            return intToB64(p, 1);\n        })\n            .join('');\n    }\n    _infil() {\n        const code = this.code;\n        const count = this.count;\n        const sizage = Counter.Sizes.get(code);\n        const cs = sizage.hs + sizage.ss;\n        if (sizage.fs != cs || cs % 4 != 0) {\n            throw new Error(`Whole code size not full size or not multiple of 4. cs=${cs} fs=${sizage.fs}.`);\n        }\n        if (count < 0 || count > 64 ** sizage.ss - 1) {\n            throw new Error(`Invalid count=${count} for code=${code}.`);\n        }\n        const both = `${code}${intToB64(count, sizage.ss)}`;\n        if (both.length % 4) {\n            throw new Error(`Invalid size = ${both.length} of ${both} not a multiple of 4.`);\n        }\n        return both;\n    }\n    _exfil(qb64) {\n        if (qb64.length == 0) {\n            throw new Error('Empty Material');\n        }\n        const first = qb64.slice(0, 2);\n        if (!Counter.Hards.has(first)) {\n            throw new Error(`Unexpected code ${first}`);\n        }\n        const hs = Counter.Hards.get(first);\n        if (qb64.length < hs) {\n            throw new Error(`Need ${hs - qb64.length} more characters.`);\n        }\n        const hard = qb64.slice(0, hs);\n        if (!Counter.Sizes.has(hard)) {\n            throw new Error(`Unsupported code ${hard}`);\n        }\n        const sizage = Counter.Sizes.get(hard);\n        const cs = sizage.hs + sizage.ss;\n        if (qb64.length < cs) {\n            throw new Error(`Need ${cs - qb64.length} more chars.`);\n        }\n        const scount = qb64.slice(sizage.hs, sizage.hs + sizage.ss);\n        const count = b64ToInt(scount);\n        this._code = hard;\n        this._count = count;\n    }\n}\nCounter.Sizes = new Map(Object.entries({\n    '-A': new Sizage(2, 2, 4, 0),\n    '-B': new Sizage(2, 2, 4, 0),\n    '-C': new Sizage(2, 2, 4, 0),\n    '-D': new Sizage(2, 2, 4, 0),\n    '-E': new Sizage(2, 2, 4, 0),\n    '-F': new Sizage(2, 2, 4, 0),\n    '-G': new Sizage(2, 2, 4, 0),\n    '-H': new Sizage(2, 2, 4, 0),\n    '-I': new Sizage(2, 2, 4, 0),\n    '-J': new Sizage(2, 2, 4, 0),\n    '-K': new Sizage(2, 2, 4, 0),\n    '-L': new Sizage(2, 2, 4, 0),\n    '-V': new Sizage(2, 2, 4, 0),\n    '-0V': new Sizage(3, 5, 8, 0),\n    '--AAA': new Sizage(5, 3, 8, 0),\n}));\nCounter.Hards = new Map([\n    ['-A', 2],\n    ['-B', 2],\n    ['-C', 2],\n    ['-D', 2],\n    ['-E', 2],\n    ['-F', 2],\n    ['-G', 2],\n    ['-H', 2],\n    ['-I', 2],\n    ['-J', 2],\n    ['-K', 2],\n    ['-L', 2],\n    ['-M', 2],\n    ['-N', 2],\n    ['-O', 2],\n    ['-P', 2],\n    ['-Q', 2],\n    ['-R', 2],\n    ['-S', 2],\n    ['-T', 2],\n    ['-U', 2],\n    ['-V', 2],\n    ['-W', 2],\n    ['-X', 2],\n    ['-Y', 2],\n    ['-Z', 2],\n    ['-a', 2],\n    ['-b', 2],\n    ['-c', 2],\n    ['-d', 2],\n    ['-e', 2],\n    ['-f', 2],\n    ['-g', 2],\n    ['-h', 2],\n    ['-i', 2],\n    ['-j', 2],\n    ['-k', 2],\n    ['-l', 2],\n    ['-m', 2],\n    ['-n', 2],\n    ['-o', 2],\n    ['-p', 2],\n    ['-q', 2],\n    ['-r', 2],\n    ['-s', 2],\n    ['-t', 2],\n    ['-u', 2],\n    ['-v', 2],\n    ['-w', 2],\n    ['-x', 2],\n    ['-y', 2],\n    ['-z', 2],\n    ['-0', 3],\n    ['--', 5],\n]);\n","var __rest = (this && this.__rest) || function (s, e) {\n    var t = {};\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n        t[p] = s[p];\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n                t[p[i]] = s[p[i]];\n        }\n    return t;\n};\nimport { Matter, MtrDex } from \"./matter.js\";\nimport { intToBytes, bytesToInt } from \"./utils.js\";\n/**\n * @description  Seqner: subclass of Matter, cryptographic material, for ordinal numbers\n * such as sequence numbers or first seen ordering numbers.\n * Seqner provides fully qualified format for ordinals (sequence numbers etc)\n * when provided as attached cryptographic material elements.\n */\nexport class Seqner extends Matter {\n    constructor(_a) {\n        var { raw, code = MtrDex.Salt_128, qb64, qb64b, qb2, sn, snh } = _a, kwa = __rest(_a, [\"raw\", \"code\", \"qb64\", \"qb64b\", \"qb2\", \"sn\", \"snh\"]);\n        if (!raw && !qb64b && !qb64 && !qb2) {\n            if (sn === undefined) {\n                if (snh === undefined) {\n                    sn = 0;\n                }\n                else {\n                    sn = parseInt(snh, 16);\n                }\n            }\n            raw = intToBytes(sn, Matter._rawSize(MtrDex.Salt_128));\n        }\n        super(Object.assign({ raw, code, qb64, qb64b, qb2 }, kwa));\n        if (this.code !== MtrDex.Salt_128) {\n            throw new Error(`Invalid code = ${this.code} for Seqner.`);\n        }\n    }\n    get sn() {\n        return bytesToInt(this.raw); //To check if other readUInt64 is needed\n    }\n    get snh() {\n        return this.sn.toString(16);\n    }\n}\n","import { blake3 } from '@noble/hashes/blake3';\nimport { Matter, MtrDex } from \"./matter.js\";\n/**\n * @description : Diger is subset of Matter and is used to verify the digest of serialization\n * It uses  .raw : as digest\n * .code as digest algorithm\n *\n */\nexport class Diger extends Matter {\n    // This constructor will assign digest verification function to ._verify\n    constructor({ raw, code = MtrDex.Blake3_256, qb64, qb64b, qb2 }, ser = null) {\n        try {\n            super({ raw, code, qb64, qb64b, qb2 });\n        }\n        catch (error) {\n            if (ser == null) {\n                throw error;\n            }\n            if (code === MtrDex.Blake3_256) {\n                const dig = blake3.create({ dkLen: 32 }).update(ser).digest();\n                super({ raw: dig, code: code });\n            }\n            else {\n                throw new Error(`Unsupported code = ${code} for digester.`);\n            }\n        }\n        if (code === MtrDex.Blake3_256) {\n            this._verify = this.blake3_256;\n        }\n        else {\n            throw new Error(`Unsupported code = ${code} for digester.`);\n        }\n    }\n    /**\n     *\n     * @param {Uint8Array} ser  serialization bytes\n     * @description  This method will return true if digest of bytes serialization ser matches .raw\n     * using .raw as reference digest for ._verify digest algorithm determined\n     by .code\n     */\n    verify(ser) {\n        return this._verify(ser, this.raw);\n    }\n    compare(ser, dig = null, diger = null) {\n        if (dig != null) {\n            if (dig.toString() == this.qb64) {\n                return true;\n            }\n            diger = new Diger({ qb64b: dig });\n        }\n        else if (diger != null) {\n            if (diger.qb64b == this.qb64b) {\n                return true;\n            }\n        }\n        else {\n            throw new Error('Both dig and diger may not be None.');\n        }\n        if (diger.code == this.code) {\n            return false;\n        }\n        return diger.verify(ser) && this.verify(ser);\n    }\n    blake3_256(ser, dig) {\n        const digest = blake3.create({ dkLen: 32 }).update(ser).digest();\n        return (digest.length == dig.length && digest.toString() === dig.toString());\n    }\n}\n","import { Matter, NumDex } from \"./matter.js\";\nimport { bytesToInt, intToBytes } from \"./utils.js\";\nexport class CesrNumber extends Matter {\n    constructor({ raw, code, qb64b, qb64, qb2 }, num, numh) {\n        let _num;\n        if (raw == undefined &&\n            qb64 == undefined &&\n            qb64b == undefined &&\n            qb2 == undefined) {\n            if (typeof num == 'number') {\n                _num = num;\n            }\n            else if (numh != undefined) {\n                _num = parseInt(numh, 16);\n            }\n            else {\n                _num = 0;\n            }\n        }\n        if (_num == undefined) {\n            throw new Error('Invalid whole number');\n        }\n        if (_num <= 256 ** 2 - 1) {\n            // make short version of code\n            code = NumDex.Short;\n        }\n        else if (_num <= 256 ** 4 - 1) {\n            // make long version of code\n            code = code = NumDex.Long;\n        }\n        else if (_num <= 256 ** 8 - 1) {\n            // make big version of code\n            code = code = NumDex.Big;\n        }\n        else if (_num <= 256 ** 16 - 1) {\n            // make huge version of code\n            code = code = NumDex.Huge;\n        }\n        else {\n            throw new Error(`Invalid num = ${num}, too large to encode.`);\n        }\n        raw = intToBytes(_num, Matter._rawSize(code));\n        super({ raw, code, qb64b, qb64, qb2 });\n        if (!NumDex.has(this.code)) {\n            throw new Error('Invalid code ' + code + ' for Number');\n        }\n    }\n    get num() {\n        return bytesToInt(this.raw);\n    }\n    get numh() {\n        return this.num.toString(16);\n    }\n    get positive() {\n        return this.num > 0;\n    }\n}\n","import { MtrDex } from \"./matter.js\";\nimport { deversify, Protocols, Serials, versify, Vrsn_1_0, } from \"./core.js\";\nimport { Verfer } from \"./verfer.js\";\nimport { Diger } from \"./diger.js\";\nimport { CesrNumber } from \"./number.js\";\nexport class Serder {\n    /**\n     * Creates a new Serder object from a self-addressing data dictionary.\n     * @param sad self-addressing data dictionary.\n     * @param kind serialization type to produce\n     * @param code derivation code for the prefix\n     */\n    constructor(sad, kind = Serials.JSON, code = MtrDex.Blake3_256) {\n        this._raw = '';\n        this._sad = {};\n        this._proto = Protocols.KERI;\n        this._size = 0;\n        this._version = Vrsn_1_0;\n        const [raw, proto, eKind, eSad, version] = this._exhale(sad, kind);\n        this._raw = raw;\n        this._sad = eSad;\n        this._proto = proto;\n        this._version = version;\n        this._code = code;\n        this._kind = eKind;\n        this._size = raw.length;\n    }\n    get sad() {\n        return this._sad;\n    }\n    get pre() {\n        return this._sad['i'];\n    }\n    get code() {\n        return this._code;\n    }\n    get raw() {\n        return this._raw;\n    }\n    get said() {\n        return this._sad['d'];\n    }\n    get sner() {\n        return new CesrNumber({}, this.sad['s']);\n    }\n    get sn() {\n        return this.sner.num;\n    }\n    get kind() {\n        return this._kind;\n    }\n    /**\n     * Serializes a self-addressing data dictionary from the dictionary passed in\n     * using the specified serialization type.\n     * @param sad self-addressing data dictionary.\n     * @param kind serialization type to produce\n     * @private\n     */\n    _exhale(sad, kind) {\n        return sizeify(sad, kind);\n    }\n    get proto() {\n        return this._proto;\n    }\n    get size() {\n        return this._size;\n    }\n    get version() {\n        return this._version;\n    }\n    get verfers() {\n        let keys = [];\n        if ('k' in this._sad) {\n            // establishment event\n            keys = this._sad['k'];\n        }\n        else {\n            // non-establishment event\n            keys = [];\n        }\n        // create a new Verfer for each key\n        const verfers = [];\n        for (const key of keys) {\n            verfers.push(new Verfer({ qb64: key }));\n        }\n        return verfers;\n    }\n    get digers() {\n        let keys = [];\n        if ('n' in this._sad) {\n            // establishment event\n            keys = this._sad['n'];\n        }\n        else {\n            // non-establishment event\n            keys = [];\n        }\n        // create a new Verfer for each key\n        const digers = [];\n        for (const key of keys) {\n            digers.push(new Diger({ qb64: key }));\n        }\n        return digers;\n    }\n    pretty() {\n        return JSON.stringify(this._sad, undefined, 2);\n    }\n}\nexport function dumps(sad, kind) {\n    if (kind == Serials.JSON) {\n        return JSON.stringify(sad);\n    }\n    else {\n        throw new Error('unsupported event encoding');\n    }\n}\nexport function sizeify(ked, kind) {\n    if (!('v' in ked)) {\n        throw new Error('Missing or empty version string');\n    }\n    const [proto, knd, version] = deversify(ked['v']);\n    if (version != Vrsn_1_0) {\n        throw new Error(`unsupported version ${version.toString()}`);\n    }\n    if (kind == undefined) {\n        kind = knd;\n    }\n    let raw = dumps(ked, kind);\n    const size = new TextEncoder().encode(raw).length;\n    ked['v'] = versify(proto, version, kind, size);\n    raw = dumps(ked, kind);\n    return [raw, proto, kind, ked, version];\n}\n","import { Matter, MtrDex } from \"./matter.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\nimport { Ilks } from \"./core.js\";\nimport { sizeify } from \"./serder.js\";\nimport { Verfer } from \"./verfer.js\";\nimport { blake3 } from '@noble/hashes/blake3';\nconst Dummy = '#';\nexport class Prefixer extends Matter {\n    constructor({ raw, code, qb64b, qb64, qb2 }, ked) {\n        try {\n            super({ raw, code, qb64b, qb64, qb2 });\n        }\n        catch (e) {\n            if (e instanceof EmptyMaterialError) {\n                if (ked == undefined || (code == undefined && !('i' in ked))) {\n                    throw e;\n                }\n                if (code == undefined) {\n                    super({ qb64: ked['i'], code: code });\n                    code = this.code;\n                }\n                let _derive;\n                if (code == MtrDex.Ed25519N) {\n                    _derive = Prefixer._derive_ed25519N;\n                }\n                else if (code == MtrDex.Ed25519) {\n                    _derive = Prefixer._derive_ed25519;\n                }\n                else if (code == MtrDex.Blake3_256) {\n                    _derive = Prefixer._derive_blake3_256;\n                }\n                else {\n                    throw new Error(`Unsupported code = ${code} for prefixer.`);\n                }\n                [raw, code] = _derive(ked);\n                super({ raw: raw, code: code });\n                this._derive = _derive;\n            }\n            else {\n                throw e;\n            }\n        }\n        if (this.code == MtrDex.Ed25519N) {\n            this._verify = this._verify_ed25519N;\n        }\n        else if (this.code == MtrDex.Ed25519) {\n            this._verify = this._verify_ed25519;\n        }\n        else if (this.code == MtrDex.Blake3_256) {\n            this._verify = this._verify_blake3_256;\n        }\n        else {\n            throw new Error(`Unsupported code = ${code} for prefixer.`);\n        }\n    }\n    derive(sad) {\n        if (sad['i'] != Ilks.icp) {\n            throw new Error(`Non-incepting ilk ${sad['i']} for prefix derivation`);\n        }\n        return this._derive(sad);\n    }\n    verify(sad, prefixed = false) {\n        if (sad['i'] != Ilks.icp) {\n            throw new Error(`Non-incepting ilk ${sad['i']} for prefix derivation`);\n        }\n        return this._verify(sad, this.qb64, prefixed);\n    }\n    static _derive_ed25519N(sad) {\n        let verfer;\n        const keys = sad['k'];\n        if (keys.length != 1) {\n            throw new Error(`Basic derivation needs at most 1 key got ${keys.length} keys instead`);\n        }\n        try {\n            verfer = new Verfer({ qb64: keys[0] });\n        }\n        catch (e) {\n            throw new Error(`Error extracting public key = ${e}`);\n        }\n        if (verfer.code != MtrDex.Ed25519N) {\n            throw new Error(`Mismatch derivation code = ${verfer.code}`);\n        }\n        const next = 'n' in sad ? sad['n'] : [];\n        if (verfer.code == MtrDex.Ed25519N && next.length > 0) {\n            throw new Error(`Non-empty nxt = ${next} for non-transferable code = ${verfer.code}`);\n        }\n        const backers = 'b' in sad ? sad['b'] : [];\n        if (verfer.code == MtrDex.Ed25519N && backers.length > 0) {\n            throw new Error(`Non-empty b =${backers} for non-transferable code = ${verfer.code}`);\n        }\n        const anchor = 'a' in sad ? sad['a'] : [];\n        if (verfer.code == MtrDex.Ed25519N && anchor.length > 0) {\n            throw new Error(`Non-empty a = ${verfer.code} for non-transferable code = ${verfer.code}`);\n        }\n        return [verfer.raw, verfer.code];\n    }\n    static _derive_ed25519(sad) {\n        let verfer;\n        const keys = sad['k'];\n        if (keys.length != 1) {\n            throw new Error(`Basic derivation needs at most 1 key got ${keys.length} keys instead`);\n        }\n        try {\n            verfer = new Verfer({ qb64: keys[0] });\n        }\n        catch (e) {\n            throw new Error(`Error extracting public key = ${e}`);\n        }\n        if (verfer.code in [MtrDex.Ed25519]) {\n            throw new Error(`Mismatch derivation code = ${verfer.code}`);\n        }\n        return [verfer.raw, verfer.code];\n    }\n    static _derive_blake3_256(sad) {\n        const ilk = sad['t'];\n        if (![Ilks.icp, Ilks.dip, Ilks.vcp, Ilks.dip].includes(ilk)) {\n            throw new Error(`Invalid ilk = ${ilk} to derive pre.`);\n        }\n        sad['i'] = ''.padStart(Matter.Sizes.get(MtrDex.Blake3_256).fs, Dummy);\n        sad['d'] = sad['i'];\n        const [raw] = sizeify(sad);\n        const dig = blake3.create({ dkLen: 32 }).update(raw).digest();\n        return [dig, MtrDex.Blake3_256];\n    }\n    _verify_ed25519N(sad, pre, prefixed = false) {\n        try {\n            const keys = sad['k'];\n            if (keys.length != 1) {\n                return false;\n            }\n            if (keys[0] != pre) {\n                return false;\n            }\n            if (prefixed && sad['i'] != pre) {\n                return false;\n            }\n            const next = 'n' in sad ? sad['n'] : [];\n            if (next.length > 0) {\n                // must be empty\n                return false;\n            }\n        }\n        catch (e) {\n            return false;\n        }\n        return true;\n    }\n    _verify_ed25519(sad, pre, prefixed = false) {\n        try {\n            const keys = sad['k'];\n            if (keys.length != 1) {\n                return false;\n            }\n            if (keys[0] != pre) {\n                return false;\n            }\n            if (prefixed && sad['i'] != pre) {\n                return false;\n            }\n        }\n        catch (e) {\n            return false;\n        }\n        return true;\n    }\n    _verify_blake3_256(sad, pre, prefixed = false) {\n        try {\n            const [raw] = Prefixer._derive_blake3_256(sad);\n            const crymat = new Matter({ raw: raw, code: MtrDex.Blake3_256 });\n            if (crymat.qb64 != pre) {\n                return false;\n            }\n            if (prefixed && sad['i'] != pre) {\n                return false;\n            }\n        }\n        catch (e) {\n            return false;\n        }\n        return true;\n    }\n}\n","import { DigiDex, Matter, MtrDex } from \"./matter.js\";\nimport { deversify, Serials } from \"./core.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\nimport { dumps, sizeify } from \"./serder.js\";\nimport { blake3 } from '@noble/hashes/blake3';\nconst Dummy = '#';\nexport var Ids;\n(function (Ids) {\n    Ids[\"d\"] = \"d\";\n})(Ids || (Ids = {}));\nexport class Saider extends Matter {\n    constructor({ raw, code, qb64b, qb64, qb2 }, sad, kind, label = Ids.d) {\n        try {\n            super({ raw, code, qb64b, qb64, qb2 });\n        }\n        catch (e) {\n            if (e instanceof EmptyMaterialError) {\n                if (sad == undefined || !(label in sad)) {\n                    throw e;\n                }\n                if (code == undefined) {\n                    if (sad[label] != '') {\n                        super({ qb64: sad[label], code: code });\n                        code = this.code;\n                    }\n                    else {\n                        code = MtrDex.Blake3_256;\n                    }\n                }\n                if (!DigiDex.has(code)) {\n                    throw new Error(`Unsupported digest code = ${code}`);\n                }\n                [raw] = Saider._derive(Object.assign({}, sad), code, kind, label);\n                super({ raw: raw, code: code });\n            }\n            else {\n                throw e;\n            }\n        }\n        if (!this.digestive) {\n            throw new Error(`Unsupported digest code = ${this.code}.`);\n        }\n    }\n    static _derive(sad, code, kind, label) {\n        if (!DigiDex.has(code)) {\n            throw new Error(`Unsupported digest code = ${code}.`);\n        }\n        sad = Object.assign({}, sad);\n        sad[label] = ''.padStart(Matter.Sizes.get(code).fs, Dummy);\n        if ('v' in sad) {\n            [, , kind, sad] = sizeify(sad, kind);\n        }\n        const ser = Object.assign({}, sad);\n        const cpa = Saider._serialze(ser, kind);\n        switch (code) {\n            case MtrDex.Blake3_256:\n                return [blake3.create({ dkLen: 32 }).update(cpa).digest(), sad];\n            default:\n                throw new Error(`Unsupported digest code = ${code}.`);\n        }\n    }\n    derive(sad, code, kind, label) {\n        code = code != undefined ? code : this.code;\n        return Saider._derive(sad, code, kind, label);\n    }\n    verify(sad, prefixed = false, versioned = false, kind, label = Ids.d) {\n        try {\n            const [raw, dsad] = Saider._derive(sad, this.code, kind, label);\n            const saider = new Saider({ raw: raw, code: this.code });\n            if (this.qb64 != saider.qb64) {\n                return false;\n            }\n            if ('v' in sad && versioned) {\n                if (sad['v'] != dsad['v']) {\n                    return false;\n                }\n            }\n            if (prefixed && sad[label] != this.qb64) {\n                return false;\n            }\n        }\n        catch (e) {\n            return false;\n        }\n        return true;\n    }\n    static _serialze(sad, kind) {\n        let knd = Serials.JSON;\n        if ('v' in sad) {\n            [, knd] = deversify(sad['v']);\n        }\n        if (kind == undefined) {\n            kind = knd;\n        }\n        return dumps(sad, kind);\n    }\n    static saidify(sad, code = MtrDex.Blake3_256, kind = Serials.JSON, label = Ids.d) {\n        if (!(label in sad)) {\n            throw new Error(`Missing id field labeled=${label} in sad.`);\n        }\n        let raw;\n        [raw, sad] = Saider._derive(sad, code, kind, label);\n        const saider = new Saider({ raw: raw, code: code }, undefined, kind, label);\n        sad[label] = saider.qb64;\n        return [saider, sad];\n    }\n}\n","import { Counter, CtrDex } from \"./counter.js\";\nimport { Seqner } from \"./seqner.js\";\nimport { Prefixer } from \"./prefixer.js\";\nimport { Saider } from \"./saider.js\";\nexport function pad(n, width = 3, z = 0) {\n    return (String(z).repeat(width) + String(n)).slice(String(n).length);\n}\n/**\n * @description  Returns list of depth first recursively extracted values from elements of\n    key event dict ked whose flabels are in lables list\n\n * @param {*} ked  ked is key event dict\n * @param {*} labels    labels is list of element labels in ked from which to extract values\n */\nexport function extractValues(ked, labels) {\n    let values = [];\n    for (const label of labels) {\n        values = extractElementValues(ked[label], values);\n    }\n    return values;\n}\nexport function arrayEquals(ar1, ar2) {\n    return (ar1.length === ar2.length &&\n        ar1.every((val, index) => val === ar2[index]));\n}\n/**\n * @description   Recusive depth first search that recursively extracts value(s) from element\n    and appends to values list\n    Assumes that extracted values are str\n\n * @param {*} element\n * @param {*} values\n */\nfunction extractElementValues(element, values) {\n    let data = [];\n    try {\n        if (element instanceof Array && !(typeof element == 'string')) {\n            for (const k in element)\n                extractElementValues(element[k], values);\n        }\n        else if (typeof element == 'string') {\n            values.push(element);\n        }\n        data = values;\n    }\n    catch (error) {\n        throw new Error(error);\n    }\n    return data;\n}\n/**\n * @description Returns True if obj is non-string iterable, False otherwise\n\n * @param {*} obj\n */\n// function nonStringIterable(obj) {\n//     obj instanceof (String)\n//     return  instanceof(obj, (str, bytes)) && instanceof(obj, Iterable))\n// }\nexport function nowUTC() {\n    return new Date();\n}\nexport function range(start, stop, step) {\n    if (typeof stop == 'undefined') {\n        // one param defined\n        stop = start;\n        start = 0;\n    }\n    if (typeof step == 'undefined') {\n        step = 1;\n    }\n    if ((step > 0 && start >= stop) || (step < 0 && start <= stop)) {\n        return [];\n    }\n    const result = new Array();\n    for (let i = start; step > 0 ? i < stop : i > stop; i += step) {\n        result.push(i);\n    }\n    return result;\n}\nexport function intToBytes(value, length) {\n    const byteArray = new Uint8Array(length); // Assuming a 4-byte integer (32 bits)\n    for (let index = byteArray.length - 1; index >= 0; index--) {\n        const byte = value & 0xff;\n        byteArray[index] = byte;\n        value = (value - byte) / 256;\n    }\n    return byteArray;\n}\nexport function bytesToInt(ar) {\n    let value = 0;\n    for (let i = 0; i < ar.length; i++) {\n        value = value * 256 + ar[i];\n    }\n    return value;\n}\nexport function serializeACDCAttachment(anc) {\n    const prefixer = new Prefixer({ qb64: anc.pre });\n    const seqner = new Seqner({ sn: anc.sn });\n    const saider = new Saider({ qb64: anc.sad['d'] });\n    const craw = new Uint8Array();\n    const ctr = new Counter({ code: CtrDex.SealSourceTriples, count: 1 }).qb64b;\n    const prefix = prefixer.qb64b;\n    const seq = seqner.qb64b;\n    const said = saider.qb64b;\n    const newCraw = new Uint8Array(craw.length + ctr.length + prefix.length + seq.length + said.length);\n    newCraw.set(craw);\n    newCraw.set(ctr, craw.length);\n    newCraw.set(prefix, craw.length + ctr.length);\n    newCraw.set(seq, craw.length + ctr.length + prefix.length);\n    newCraw.set(said, craw.length + ctr.length + prefix.length + seq.length);\n    return newCraw;\n}\nexport function serializeIssExnAttachment(anc) {\n    const seqner = new Seqner({ sn: anc.sn });\n    const ancSaider = new Saider({ qb64: anc.sad['d'] });\n    const coupleArray = new Uint8Array(seqner.qb64b.length + ancSaider.qb64b.length);\n    coupleArray.set(seqner.qb64b);\n    coupleArray.set(ancSaider.qb64b, seqner.qb64b.length);\n    const counter = new Counter({\n        code: CtrDex.SealSourceCouples,\n        count: 1,\n    });\n    const counterQb64b = counter.qb64b;\n    const atc = new Uint8Array(counter.qb64b.length + coupleArray.length);\n    atc.set(counterQb64b);\n    atc.set(coupleArray, counterQb64b.length);\n    if (atc.length % 4 !== 0) {\n        throw new Error(`Invalid attachments size: ${atc.length}, non-integral quadlets detected.`);\n    }\n    const pcnt = new Counter({\n        code: CtrDex.AttachedMaterialQuadlets,\n        count: Math.floor(atc.length / 4),\n    });\n    const msg = new Uint8Array(pcnt.qb64b.length + atc.length);\n    msg.set(pcnt.qb64b);\n    msg.set(atc, pcnt.qb64b.length);\n    return msg;\n}\n","import libsodium from 'libsodium-wrappers-sumo';\nimport { Matter, MtrDex } from \"./matter.js\";\nimport { Verfer } from \"./verfer.js\";\nimport { Signer } from \"./signer.js\";\nimport { Cipher } from \"./cipher.js\";\nimport { arrayEquals } from \"./utils.js\";\nexport class Encrypter extends Matter {\n    constructor({ raw, code = MtrDex.X25519, qb64, qb64b, qb2 }, verkey = null) {\n        if (raw == undefined && verkey != null) {\n            const verfer = new Verfer({ qb64b: verkey });\n            if (!Array.from([MtrDex.Ed25519N, MtrDex.Ed25519]).includes(verfer.code)) {\n                throw new Error(`Unsupported verkey derivation code = ${verfer.code}.`);\n            }\n            raw = libsodium.crypto_sign_ed25519_pk_to_curve25519(verfer.raw);\n        }\n        super({ raw, code, qb64, qb64b, qb2 });\n        if (this.code == MtrDex.X25519) {\n            this._encrypt = this._x25519;\n        }\n        else {\n            throw new Error(`Unsupported encrypter code = ${this.code}.`);\n        }\n    }\n    verifySeed(seed) {\n        const signer = new Signer({ qb64b: seed });\n        const keypair = libsodium.crypto_sign_seed_keypair(signer.raw);\n        const pubkey = libsodium.crypto_sign_ed25519_pk_to_curve25519(keypair.publicKey);\n        return arrayEquals(pubkey, this.raw);\n    }\n    encrypt(ser = null, matter = null) {\n        if (ser == null && matter == null) {\n            throw new Error('Neither ser nor matter are provided.');\n        }\n        if (ser != null) {\n            matter = new Matter({ qb64b: ser });\n        }\n        let code;\n        if (matter.code == MtrDex.Salt_128) {\n            code = MtrDex.X25519_Cipher_Salt;\n        }\n        else {\n            code = MtrDex.X25519_Cipher_Seed;\n        }\n        return this._encrypt(matter.qb64, this.raw, code);\n    }\n    _x25519(ser, pubkey, code) {\n        const raw = libsodium.crypto_box_seal(ser, pubkey);\n        return new Cipher({ raw: raw, code: code });\n    }\n}\n","import { Encrypter } from \"./encrypter.js\";\nimport { Decrypter } from \"./decrypter.js\";\nimport { Salter, Tier } from \"./salter.js\";\nimport { Signer } from \"./signer.js\";\nimport { Verfer } from \"./verfer.js\";\nimport { MtrDex } from \"./matter.js\";\nimport { Diger } from \"./diger.js\";\nimport { b } from \"./core.js\";\n/**\n * Kinds of key pair generation algorithms.\n * Salty is deterministic based on a salt and stem.\n * Randy is random.\n * Group is a multi-signature group algorithm indicating keys are retrieved from a group member which will be either Salty or Randy.\n * Extern is an external key pair algorithm indicating keys are provided by an external source such as an HSM.\n */\nexport var Algos;\n(function (Algos) {\n    Algos[\"randy\"] = \"randy\";\n    Algos[\"salty\"] = \"salty\";\n    Algos[\"group\"] = \"group\";\n    Algos[\"extern\"] = \"extern\";\n})(Algos || (Algos = {}));\n/**\n * Lot (set) of public keys as an ordered list with indexes and the time created.\n * Indexes refer to the index of the ordered sequence of keys in an establishment event (inception or rotation).\n * Assumes the same length for each set of keys across all PubLot instances used for a given identifier.\n */\nclass PubLot {\n    constructor() {\n        /**\n         * List of fully qualified, Base64 encoded public keys. Defaults to empty.\n         */\n        this.pubs = new Array();\n        /**\n         * Rotation index; index of rotation (est event) that uses this public key set.\n         * The index of the key set for an inception event is 0.\n         */\n        this.ridx = 0;\n        /**\n         * Key index; index of the starting key in the key set for this lot in sequence\n         * with reference to all public keys for the identifier.\n         * For example, if each set (PubLot.pubs) has 3 keys then ridx 2 has kidx of 2*3 = 6.\n         * Defaults to 0.\n         */\n        this.kidx = 0;\n        /**\n         * Datetime of when key set created formatted as an ISO 8601 compliant string.\n         */\n        this.dt = '';\n    }\n}\n/**\n * Prefix's public key situation (set of public keys).\n */\nclass PreSit {\n    constructor() {\n        /**\n         * Previous publot; previous public key set.\n         */\n        this.old = new PubLot();\n        /**\n         * New, current publot; current public key set.\n         */\n        this.new = new PubLot();\n        /**\n         * Next public publot\n         */\n        this.nxt = new PubLot();\n    }\n}\n/**\n * Identifier prefix parameters for creating new key pairs.\n */\nclass PrePrm {\n    constructor() {\n        /**\n         * Prefix index for this keypair sequence.\n         */\n        this.pidx = 0;\n        /**\n         * Key generation algorithm type.\n         * Defaults to Salty.\n         * Salty default uses indices and salt to create new key pairs.\n         */\n        this.algo = Algos.salty;\n        /**\n         * Used for salty algo. Defaults to empty. Unused for randy algo.\n         */\n        this.salt = '';\n        /**\n         * Default unique path prefix used by the salty algo during key generation.\n         */\n        this.stem = '';\n        /**\n         * Security tier for stretch index; used by the salty algo.\n         */\n        this.tier = '';\n    }\n}\n/**\n * An identifier prefix's public key set (list) at a given rotation index ridx.\n */\nclass PubSet {\n    constructor() {\n        /**\n         * List of fully qualified, Base64 encoded public keys.\n         */\n        this.pubs = new Array();\n    }\n}\n/**\n * Describes a path to a specific derived keypair for a given identifier\n */\nclass PubPath {\n    constructor() {\n        /**\n         * The path to a specific keypair. To generate a keypair you combine the path with the salt and tier.\n         */\n        this.path = '';\n        /**\n         * Derivation code indicating the kind of cryptographic keypair to generate. Defaults to Ed25519.\n         */\n        this.code = '';\n        /**\n         * Security tier to use to generate a keypair. Defaults to high.\n         */\n        this.tier = Tier.high;\n        /**\n         * Flag to control whether to generate a low security, temporary key. Used for speed for unit tests. Do NOT use for production identifiers.\n         */\n        this.temp = false;\n    }\n}\nclass Keys {\n    constructor(signers, paths) {\n        this._signers = signers;\n        if (paths != undefined) {\n            if (signers.length != paths.length) {\n                throw new Error('If paths are provided, they must be the same length as signers');\n            }\n        }\n        this._paths = paths;\n    }\n    get paths() {\n        return this._paths;\n    }\n    get signers() {\n        return this._signers;\n    }\n}\nexport class RandyCreator {\n    create(codes = undefined, count = 1, code = MtrDex.Ed25519_Seed, transferable = true) {\n        const signers = new Array();\n        if (codes == undefined) {\n            codes = new Array(count).fill(code);\n        }\n        codes.forEach(function (code) {\n            signers.push(new Signer({ code: code, transferable: transferable }));\n        });\n        return new Keys(signers);\n    }\n    /**\n     * Unused for random key generation.\n     */\n    get salt() {\n        return '';\n    }\n    /**\n     * Unused for random key generation.\n     */\n    get stem() {\n        return '';\n    }\n    /**\n     * Unused for random key generation.\n     */\n    get tier() {\n        return '';\n    }\n}\n/**\n * Deterministically creates a key pair based on combining a salt with a path stretch algorithm.\n * The salt is randomized if not provided.\n */\nexport class SaltyCreator {\n    constructor(salt = undefined, tier = undefined, stem = undefined) {\n        this.salter = new Salter({ qb64: salt, tier: tier });\n        this._stem = stem == undefined ? '' : stem;\n    }\n    get salt() {\n        return this.salter.qb64;\n    }\n    get stem() {\n        return this._stem;\n    }\n    get tier() {\n        return this.salter.tier;\n    }\n    create(codes = undefined, count = 1, code = MtrDex.Ed25519_Seed, transferable = true, pidx = 0, ridx = 0, kidx = 0, temp = false) {\n        const signers = new Array();\n        const paths = new Array();\n        if (codes == undefined) {\n            codes = new Array(count).fill(code);\n        }\n        codes.forEach((code, idx) => {\n            // Previous definition of path\n            // let path = this.stem + pidx.toString(16) + ridx.toString(16) + (kidx+idx).toString(16)\n            const path = this.stem == ''\n                ? pidx.toString(16)\n                : this.stem + ridx.toString(16) + (kidx + idx).toString(16);\n            signers.push(this.salter.signer(code, transferable, path, this.tier, temp));\n            paths.push(path);\n        });\n        return new Keys(signers, paths);\n    }\n}\nexport class Creatory {\n    constructor(algo = Algos.salty) {\n        switch (algo) {\n            case Algos.randy:\n                this._make = this._makeRandy;\n                break;\n            case Algos.salty:\n                this._make = this._makeSalty;\n                break;\n            default:\n                throw new Error(`unsupported algo=${algo}`);\n        }\n    }\n    make(...args) {\n        return this._make(...args);\n    }\n    _makeRandy() {\n        return new RandyCreator();\n    }\n    _makeSalty(...args) {\n        return new SaltyCreator(...args);\n    }\n}\nexport function openManager(passcode, salt) {\n    if (passcode.length < 21) {\n        throw new Error('Bran (passcode seed material) too short.');\n    }\n    const bran = MtrDex.Salt_128 + 'A' + passcode.substring(0, 21); // qb64 salt for seed\n    const signer = new Salter({ qb64: bran }).signer(MtrDex.Ed25519_Seed, false);\n    const seed = signer.qb64;\n    const aeid = signer.verfer.qb64; // lest it remove encryption\n    let algo;\n    const salter = salt != undefined ? new Salter({ qb64: salt }) : undefined;\n    if (salt != undefined) {\n        algo = Algos.salty;\n    }\n    else {\n        algo = Algos.randy;\n    }\n    return new Manager({ seed: seed, aeid: aeid, algo: algo, salter: salter });\n}\n/**\n * Manages key pair creation, retrieval, and message signing.\n */\nexport class Manager {\n    constructor(args) {\n        let { ks, seed, aeid, pidx, algo, salter, tier } = args;\n        this._ks = ks == undefined ? new Keeper() : ks;\n        this._seed = seed;\n        this._encrypter = undefined;\n        this._decrypter = undefined;\n        aeid = aeid == undefined ? undefined : aeid;\n        pidx = pidx == undefined ? 0 : pidx;\n        algo = algo == undefined ? Algos.salty : algo;\n        const salt = salter === null || salter === void 0 ? void 0 : salter.qb64;\n        tier = tier == undefined ? Tier.low : tier;\n        if (this.pidx == undefined) {\n            this.pidx = pidx;\n        }\n        if (this.algo == undefined) {\n            this.algo = algo;\n        }\n        if (this.salt == undefined) {\n            this.salt = salt;\n        }\n        if (this.tier == undefined) {\n            this.tier = tier;\n        }\n        if (this.aeid == undefined) {\n            this.updateAeid(aeid, this._seed);\n        }\n    }\n    get ks() {\n        return this._ks;\n    }\n    get encrypter() {\n        return this._encrypter;\n    }\n    get decrypter() {\n        return this._decrypter;\n    }\n    get seed() {\n        return this._seed;\n    }\n    /**\n     * qb64 auth encrypt id prefix\n     */\n    get aeid() {\n        return this.ks.getGbls('aeid');\n    }\n    get pidx() {\n        const pidx = this.ks.getGbls('pidx');\n        if (pidx != undefined) {\n            return parseInt(pidx, 16);\n        }\n        return undefined;\n    }\n    set pidx(pidx) {\n        this.ks.pinGbls('pidx', pidx.toString(16));\n    }\n    get salt() {\n        if (this._decrypter == undefined) {\n            return this._salt;\n        }\n        else {\n            const salt = this.ks.getGbls('salt');\n            return this._decrypter.decrypt(b(salt)).qb64;\n        }\n    }\n    set salt(salt) {\n        if (this._encrypter == undefined) {\n            this._salt = salt;\n        }\n        else {\n            salt = this._encrypter.encrypt(b(salt)).qb64;\n            this.ks.pinGbls('salt', salt);\n        }\n    }\n    get tier() {\n        return this.ks.getGbls('tier');\n    }\n    set tier(tier) {\n        this.ks.pinGbls('tier', tier);\n    }\n    get algo() {\n        const a = this.ks.getGbls('algo');\n        const ta = a;\n        return Algos[ta];\n    }\n    set algo(algo) {\n        this.ks.pinGbls('algo', algo);\n    }\n    updateAeid(aeid, seed) {\n        var _a;\n        if (this.aeid != undefined) {\n            const seed = b(this._seed);\n            if (this._seed == undefined || !((_a = this._encrypter) === null || _a === void 0 ? void 0 : _a.verifySeed(seed))) {\n                throw new Error(`Last seed missing or provided last seed \"\n                                       \"not associated with last aeid=${this.aeid}.`);\n            }\n        }\n        if (aeid != '' && aeid != undefined) {\n            if (aeid != this.aeid) {\n                this._encrypter = new Encrypter({}, b(aeid));\n                if (seed == undefined || !this._encrypter.verifySeed(b(seed))) {\n                    throw new Error(`Seed missing or provided seed not associated\"\n                                           \"  with provided aeid=${aeid}.`);\n                }\n            }\n        }\n        else if (this.algo == Algos.randy) {\n            // Unlike KERIpy, we don't support unencrypted secrets\n            throw new Error('Invalid Manager configuration, encryption must be used with Randy key creation.');\n        }\n        else {\n            this._encrypter = undefined;\n        }\n        const salt = this.salt;\n        if (salt != undefined) {\n            this.salt = salt;\n        }\n        if (this._decrypter != undefined) {\n            for (const [keys, data] of this.ks.prmsElements()) {\n                if (data.salt != undefined) {\n                    const salter = this._decrypter.decrypt(b(data.salt));\n                    data.salt =\n                        this._encrypter == undefined\n                            ? salter.qb64\n                            : this._encrypter.encrypt(null, salter);\n                    this.ks.pinPrms(keys, data);\n                }\n            }\n            for (const [pubKey, signer] of this.ks.prisElements(this._decrypter)) {\n                this.ks.pinPris(pubKey, signer, this._encrypter);\n            }\n        }\n        this.ks.pinGbls('aeid', aeid); // set aeid in db\n        this._seed = seed; // set .seed in memory\n        // update .decrypter\n        this._decrypter =\n            seed != undefined ? new Decrypter({}, b(seed)) : undefined;\n    }\n    incept(args) {\n        let { icodes = undefined, icount = 1, icode = MtrDex.Ed25519_Seed, ncodes = undefined, ncount = 1, ncode = MtrDex.Ed25519_Seed, dcode = MtrDex.Blake3_256, algo = undefined, salt = undefined, stem = undefined, tier = undefined, rooted = true, transferable = true, temp = false, } = args;\n        if (rooted && algo == undefined) {\n            algo = this.algo;\n        }\n        if (rooted && salt == undefined) {\n            salt = this.salt;\n        }\n        if (rooted && tier == undefined) {\n            tier = this.tier;\n        }\n        const pidx = this.pidx;\n        const ridx = 0;\n        const kidx = 0;\n        const creator = new Creatory(algo).make(salt, tier, stem);\n        if (icodes == undefined) {\n            if (icount < 0) {\n                throw new Error(`Invalid icount=${icount} must be >= 0.`);\n            }\n            icodes = new Array(icount).fill(icode);\n        }\n        const ikeys = creator.create(icodes, 0, MtrDex.Ed25519_Seed, transferable, pidx, ridx, kidx, temp);\n        const verfers = Array.from(ikeys.signers, (signer) => signer.verfer);\n        if (ncodes == undefined) {\n            if (ncount < 0) {\n                throw new Error(`Invalid ncount=${ncount} must be >= 0.`);\n            }\n            ncodes = new Array(ncount).fill(ncode);\n        }\n        const nkeys = creator.create(ncodes, 0, MtrDex.Ed25519_Seed, transferable, pidx, ridx + 1, kidx + icodes.length, temp);\n        const digers = Array.from(nkeys.signers, (signer) => new Diger({ code: dcode }, signer.verfer.qb64b));\n        const pp = new PrePrm();\n        pp.pidx = pidx;\n        pp.algo = algo;\n        pp.salt =\n            creator.salt.length == 0 || this.encrypter == undefined\n                ? ''\n                : this.encrypter.encrypt(b(creator.salt)).qb64;\n        pp.stem = creator.stem;\n        pp.tier = creator.tier;\n        const dt = new Date().toString();\n        const nw = new PubLot();\n        nw.pubs = Array.from(verfers, (verfer) => verfer.qb64);\n        nw.ridx = ridx;\n        nw.kidx = kidx;\n        nw.dt = dt;\n        const nt = new PubLot();\n        nt.pubs = Array.from(nkeys.signers, (signer) => signer.verfer.qb64);\n        nt.ridx = ridx + 1;\n        nt.kidx = kidx + icodes.length;\n        nt.dt = dt;\n        const ps = new PreSit();\n        ps.new = nw;\n        ps.nxt = nt;\n        const pre = verfers[0].qb64;\n        if (!this.ks.putPres(pre, verfers[0].qb64b)) {\n            throw new Error(`Already incepted pre=${pre}.`);\n        }\n        if (!this.ks.putPrms(pre, pp)) {\n            throw new Error(`Already incepted prm for pre=${pre}.`);\n        }\n        this.pidx = pidx + 1;\n        if (!this.ks.putSits(pre, ps)) {\n            throw new Error(`Already incepted sit for pre=${pre}.`);\n        }\n        if (this.encrypter != undefined) {\n            // Only store encrypted keys if we have an encrypter, otherwise regenerate\n            ikeys.signers.forEach((signer) => {\n                this.ks.putPris(signer.verfer.qb64, signer, this.encrypter);\n            });\n            nkeys.signers.forEach((signer) => {\n                this.ks.putPris(signer.verfer.qb64, signer, this.encrypter);\n            });\n        }\n        else if (this._encrypter == undefined &&\n            ikeys.paths != undefined &&\n            nkeys.paths != undefined) {\n            ikeys.paths.forEach((path, idx) => {\n                const signer = ikeys.signers[idx];\n                const ppt = new PubPath();\n                ppt.path = path;\n                ppt.code = icodes[idx];\n                ppt.tier = pp.tier;\n                ppt.temp = temp;\n                this.ks.putPths(signer.verfer.qb64, ppt);\n            });\n            nkeys.paths.forEach((path, idx) => {\n                const signer = nkeys.signers[idx];\n                const ppt = new PubPath();\n                ppt.path = path;\n                ppt.code = ncodes[idx];\n                ppt.tier = pp.tier;\n                ppt.temp = temp;\n                this.ks.putPths(signer.verfer.qb64, ppt);\n            });\n        }\n        else {\n            throw new Error('invalid configuration, randy keys without encryption');\n        }\n        const pubSet = new PubSet();\n        pubSet.pubs = ps.new.pubs;\n        this.ks.putPubs(riKey(pre, ridx), pubSet);\n        const nxtPubSet = new PubSet();\n        nxtPubSet.pubs = ps.nxt.pubs;\n        this.ks.putPubs(riKey(pre, ridx + 1), nxtPubSet);\n        return [verfers, digers];\n    }\n    move(old, gnu) {\n        if (old == gnu) {\n            return;\n        }\n        if (this.ks.getPres(old) == undefined) {\n            throw new Error(`Nonexistent old pre=${old}, nothing to assign.`);\n        }\n        if (this.ks.getPres(gnu) != undefined) {\n            throw new Error(`Preexistent new pre=${gnu} may not clobber.`);\n        }\n        const oldprm = this.ks.getPrms(old);\n        if (oldprm == undefined) {\n            throw new Error(`Nonexistent old prm for pre=${old}, nothing to move.`);\n        }\n        if (this.ks.getPrms(gnu) != undefined) {\n            throw new Error(`Preexistent new prm for pre=${gnu} may not clobber.`);\n        }\n        const oldsit = this.ks.getSits(old);\n        if (oldsit == undefined) {\n            throw new Error(`Nonexistent old sit for pre=${old}, nothing to move.`);\n        }\n        if (this.ks.getSits(gnu) != undefined) {\n            throw new Error(`Preexistent new sit for pre=${gnu} may not clobber.`);\n        }\n        if (!this.ks.putPrms(gnu, oldprm)) {\n            throw new Error(`Failed moving prm from old pre=${old} to new pre=${gnu}.`);\n        }\n        else {\n            this.ks.remPrms(old);\n        }\n        if (!this.ks.putSits(gnu, oldsit)) {\n            throw new Error(`Failed moving sit from old pre=${old} to new pre=${gnu}.`);\n        }\n        else {\n            this.ks.remSits(old);\n        }\n        let i = 0;\n        while (true) {\n            const pl = this.ks.getPubs(riKey(old, i));\n            if (pl == undefined) {\n                break;\n            }\n            if (!this.ks.putPubs(riKey(gnu, i), pl)) {\n                throw new Error(`Failed moving pubs at pre=${old} ri=${i} to new pre=${gnu}`);\n            }\n            i = i + 1;\n        }\n        if (!this.ks.pinPres(old, b(gnu))) {\n            throw new Error(`Failed assiging new pre=${gnu} to old pre=${old}.`);\n        }\n        if (!this.ks.putPres(gnu, b(gnu))) {\n            throw new Error(`Failed assiging new pre=${gnu}.`);\n        }\n    }\n    rotate(args) {\n        let { pre, ncodes = undefined, ncount = 1, ncode = MtrDex.Ed25519_Seed, dcode = MtrDex.Blake3_256, transferable = true, temp = false, erase = true, } = args;\n        const pp = this.ks.getPrms(pre);\n        if (pp == undefined) {\n            throw new Error(`Attempt to rotate nonexistent pre=${pre}.`);\n        }\n        const ps = this.ks.getSits(pre);\n        if (ps == undefined) {\n            throw new Error(`Attempt to rotate nonexistent pre=${pre}.`);\n        }\n        if (ps.nxt.pubs == undefined || ps.nxt.pubs.length == 0) {\n            throw new Error(`Attempt to rotate nontransferable pre=${pre}.`);\n        }\n        const old = ps.old;\n        ps.old = ps.new;\n        ps.new = ps.nxt;\n        if (this.aeid != undefined && this.decrypter == undefined) {\n            throw new Error('Unauthorized decryption attempt.  Aeid but no decrypter.');\n        }\n        const verfers = new Array();\n        ps.new.pubs.forEach((pub) => {\n            if (this.decrypter != undefined) {\n                const signer = this.ks.getPris(pub, this.decrypter);\n                if (signer == undefined) {\n                    throw new Error(`Missing prikey in db for pubkey=${pub}`);\n                }\n                verfers.push(signer.verfer);\n            }\n            else {\n                // Should we regenerate from salt here since this.decryptor is undefined\n                verfers.push(new Verfer({ qb64: pub }));\n            }\n        });\n        let salt = pp.salt;\n        if (salt != undefined && salt != '') {\n            // If you provded a Salt for an AID but don't have encryption, pitch a fit\n            if (this.decrypter == undefined) {\n                throw new Error('Invalid configuration: AID salt with no encryption');\n            }\n            salt = this.decrypter.decrypt(b(salt)).qb64;\n        }\n        else {\n            salt = this.salt;\n        }\n        const creator = new Creatory(pp.algo).make(salt, pp.tier, pp.stem);\n        if (ncodes == undefined) {\n            if (ncount < 0) {\n                throw new Error(`Invalid count=${ncount} must be >= 0`);\n            }\n            ncodes = new Array(ncount).fill(ncode);\n        }\n        const pidx = pp.pidx;\n        const ridx = ps.new.ridx + 1;\n        const kidx = ps.nxt.kidx + ps.new.pubs.length;\n        const keys = creator.create(ncodes, 0, '', transferable, pidx, ridx, kidx, temp);\n        const digers = Array.from(keys.signers, (signer) => new Diger({ code: dcode }, signer.verfer.qb64b));\n        const dt = new Date().toString();\n        ps.nxt = new PubLot();\n        ps.nxt.pubs = Array.from(keys.signers, (signer) => signer.verfer.qb64);\n        ps.nxt.ridx = ridx;\n        ps.nxt.kidx = kidx;\n        ps.nxt.dt = dt;\n        if (!this.ks.pinSits(pre, ps)) {\n            throw new Error(`Problem updating pubsit db for pre=${pre}.`);\n        }\n        if (this.encrypter != undefined) {\n            // Only store encrypted keys if we have an encrypter, otherwise regenerate\n            keys.signers.forEach((signer) => {\n                this.ks.putPris(signer.verfer.qb64, signer, this.encrypter);\n            });\n        }\n        else if (this._encrypter == undefined && keys.paths != undefined) {\n            keys.paths.forEach((path, idx) => {\n                const signer = keys.signers[idx];\n                const ppt = new PubPath();\n                ppt.path = path;\n                ppt.tier = pp.tier;\n                ppt.temp = temp;\n                this.ks.putPths(signer.verfer.qb64, ppt);\n            });\n        }\n        else {\n            throw new Error('invalid configuration, randy keys without encryption');\n        }\n        const newPs = new PubSet();\n        newPs.pubs = ps.nxt.pubs;\n        this.ks.putPubs(riKey(pre, ps.nxt.ridx), newPs);\n        if (erase) {\n            old.pubs.forEach((pub) => {\n                this.ks.remPris(pub);\n            });\n        }\n        return [verfers, digers];\n    }\n    sign(args) {\n        const { ser, pubs = undefined, verfers = undefined, indexed = true, indices = undefined, ondices = undefined, } = args;\n        const signers = new Array();\n        if (pubs == undefined && verfers == undefined) {\n            throw new Error('pubs or verfers required');\n        }\n        if (pubs != undefined) {\n            if (this.aeid != undefined && this.decrypter == undefined) {\n                throw new Error('Unauthorized decryption attempt.  Aeid but no decrypter.');\n            }\n            pubs.forEach((pub) => {\n                //If no decrypter then get SaltyState and regenerate prikey\n                if (this.decrypter != undefined) {\n                    const signer = this.ks.getPris(pub, this.decrypter);\n                    if (signer == undefined) {\n                        throw new Error(`Missing prikey in db for pubkey=${pub}`);\n                    }\n                    signers.push(signer);\n                }\n                else {\n                    const verfer = new Verfer({ qb64: pub });\n                    const ppt = this.ks.getPths(pub);\n                    if (ppt == undefined) {\n                        throw new Error(`Missing prikey in db for pubkey=${pub}`);\n                    }\n                    const salter = new Salter({ qb64: this.salt });\n                    signers.push(salter.signer(ppt.code, verfer.transferable, ppt.path, ppt.tier, ppt.temp));\n                }\n            });\n        }\n        else {\n            verfers.forEach((verfer) => {\n                if (this.decrypter != undefined) {\n                    const signer = this.ks.getPris(verfer.qb64, this.decrypter);\n                    if (signer == undefined) {\n                        throw new Error(`Missing prikey in db for pubkey=${verfer.qb64}`);\n                    }\n                    signers.push(signer);\n                }\n                else {\n                    const ppt = this.ks.getPths(verfer.qb64);\n                    if (ppt == undefined) {\n                        throw new Error(`Missing prikey in db for pubkey=${verfer.qb64}`);\n                    }\n                    const salter = new Salter({ qb64: this.salt });\n                    signers.push(salter.signer(ppt.code, verfer.transferable, ppt.path, ppt.tier, ppt.temp));\n                }\n            });\n        }\n        if (indices != undefined && indices.length != signers.length) {\n            throw new Error(`Mismatch indices length=${indices.length} and resultant signers length=${signers.length}`);\n        }\n        if (ondices != undefined && ondices.length != signers.length) {\n            throw new Error(`Mismatch ondices length=${ondices.length} and resultant signers length=${signers.length}`);\n        }\n        if (indexed) {\n            const sigers = new Array();\n            signers.forEach((signer, idx) => {\n                let i;\n                if (indices != undefined) {\n                    i = indices[idx];\n                    if (i < 0) {\n                        throw new Error(`Invalid signing index = ${i}, not whole number.`);\n                    }\n                }\n                else {\n                    i = idx;\n                }\n                let o;\n                if (ondices != undefined) {\n                    o = ondices[idx];\n                    if (o <= 0) {\n                        throw new Error(`Invalid other signing index = {o}, not None or not whole number.`);\n                    }\n                }\n                else {\n                    o = i;\n                }\n                const only = o == undefined;\n                sigers.push(signer.sign(ser, i, only, o));\n            });\n            return sigers;\n        }\n        else {\n            const cigars = new Array();\n            signers.forEach((signer) => {\n                cigars.push(signer.sign(ser));\n            });\n            return cigars;\n        }\n    }\n}\nexport function riKey(pre, ridx) {\n    return pre + '.' + ridx.toString(16).padStart(32, '0');\n}\n/**\n * Keeper sets up named sub databases for key pair storage (KS).\n * Methods provide key pair creation, storage, and data signing.\n * In-memory test implementation of Keeper key store\n */\nclass Keeper {\n    constructor() {\n        this._gbls = new Map();\n        this._pris = new Map();\n        this._pths = new Map();\n        this._pres = new Map();\n        this._prms = new Map();\n        this._sits = new Map();\n        this._pubs = new Map();\n    }\n    getGbls(key) {\n        return this._gbls.get(key);\n    }\n    pinGbls(key, val) {\n        this._gbls.set(key, val);\n    }\n    prmsElements() {\n        const out = new Array();\n        this._prms.forEach((value, key) => {\n            out.push([key, value]);\n        });\n        return out;\n    }\n    getPrms(keys) {\n        return this._prms.get(keys);\n    }\n    pinPrms(keys, data) {\n        this._prms.set(keys, data);\n    }\n    putPrms(keys, data) {\n        if (this._prms.has(keys)) {\n            return false;\n        }\n        this._prms.set(keys, data);\n        return true;\n    }\n    remPrms(keys) {\n        return this._prms.delete(keys);\n    }\n    prisElements(decrypter) {\n        const out = new Array();\n        this._pris.forEach(function (val, pubKey) {\n            const verfer = new Verfer({ qb64: pubKey });\n            const signer = decrypter.decrypt(val, null, verfer.transferable);\n            out.push([pubKey, signer]);\n        });\n        return out;\n    }\n    pinPris(pubKey, signer, encrypter) {\n        const cipher = encrypter.encrypt(null, signer);\n        this._pris.set(pubKey, cipher.qb64b);\n    }\n    putPris(pubKey, signer, encrypter) {\n        if (this._pris.has(pubKey)) {\n            return false;\n        }\n        const cipher = encrypter.encrypt(null, signer);\n        this._pris.set(pubKey, cipher.qb64b);\n        return true;\n    }\n    getPris(pubKey, decrypter) {\n        const val = this._pris.get(pubKey);\n        if (val == undefined) {\n            return undefined;\n        }\n        const verfer = new Verfer({ qb64: pubKey });\n        return decrypter.decrypt(val, null, verfer.transferable);\n    }\n    pinPths(pubKey, val) {\n        this._pths.set(pubKey, val);\n        return true;\n    }\n    putPths(pubKey, val) {\n        if (this._pths.has(pubKey)) {\n            return false;\n        }\n        this._pths.set(pubKey, val);\n        return true;\n    }\n    getPths(pubKey) {\n        return this._pths.get(pubKey);\n    }\n    remPris(pubKey) {\n        this._pris.delete(pubKey);\n    }\n    getPres(pre) {\n        return this._pres.get(pre);\n    }\n    pinPres(pre, val) {\n        this._pres.set(pre, val);\n        return true;\n    }\n    putPres(pre, val) {\n        if (this._pres.has(pre)) {\n            return false;\n        }\n        this._pres.set(pre, val);\n        return true;\n    }\n    getSits(keys) {\n        return this._sits.get(keys);\n    }\n    putSits(pre, val) {\n        if (this._sits.has(pre)) {\n            return false;\n        }\n        this._sits.set(pre, val);\n        return true;\n    }\n    pinSits(pre, val) {\n        this._sits.set(pre, val);\n        return true;\n    }\n    remSits(keys) {\n        return this._sits.delete(keys);\n    }\n    getPubs(keys) {\n        return this._pubs.get(keys);\n    }\n    putPubs(keys, data) {\n        if (this._pubs.has(keys)) {\n            return false;\n        }\n        this._pubs.set(keys, data);\n        return true;\n    }\n}\n","function _extends() {\n  return module.exports = _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports, _extends.apply(null, arguments);\n}\nmodule.exports = _extends, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  epsilon: 1e-12,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n  number: 'number',\n  // number of significant digits in BigNumbers\n  precision: 64,\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n};","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n//   instanceof cannot be used because that would not allow to pass data from\n//   one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n//   matches for \"fake\" instances like plain objects with a property `isUnit`.\n//   That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n//   for security reasons, so these functions are not exposed in the expression\n//   parser.\n\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n    return false;\n  }\n  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n    return true;\n  }\n  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n    return true;\n  }\n  return false;\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nexport function rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof x;\n  if (t === 'object') {\n    if (x === null) return 'null';\n    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name;\n    return 'Object'; // just in case\n  }\n  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber, isObject } from './is.js';\n\n/**\n * Clone an object\n *\n *     clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone(x) {\n  var type = typeof x;\n\n  // immutable primitive types\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n  if (x instanceof Date) return new Date(x.valueOf());\n  if (isBigNumber(x)) return x; // bignumbers are immutable\n\n  // object\n  if (isObject(x)) {\n    return mapObject(x, clone);\n  }\n  throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject(object, callback) {\n  var clone = {};\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n  return clone;\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n  return a;\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend(a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend');\n  }\n  for (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n        if (a[prop] && a[prop].constructor === Object) {\n          deepExtend(a[prop], b[prop]);\n        } else {\n          a[prop] = b[prop];\n        }\n      } else if (Array.isArray(b[prop])) {\n        throw new TypeError('Arrays are not supported by deepExtend');\n      } else {\n        a[prop] = b[prop];\n      }\n    }\n  }\n  return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  } else if (typeof a === 'function') {\n    return a === b;\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false;\n    }\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false;\n      }\n    }\n    return true;\n  } else {\n    return a === b;\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n  _deepFlatten(nestedObject, flattenedObject);\n  return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {\n          return null;\n        }\n      });\n      return true;\n    }\n  } catch (e) {}\n  return false;\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object         Object where to add the property\n * @param {string} prop           Property name\n * @param {Function} valueResolver Function returning the property value. Called\n *                                without arguments.\n */\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n  var _value;\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\n      }\n      return _value;\n    },\n    set: function set(value) {\n      _value = value;\n      _uninitialized = false;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n  var obj = object;\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n      obj = obj[key];\n    }\n  }\n  return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)\n * - name: string (optional)\n * - path: string    A dot separated path (optional)\n * - math: boolean   If true (false by default), the math namespace is passed\n *                   as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get(object, path) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return get(object, path.split('.'));\n    } else {\n      return object[path];\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n  return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set(object, path, value) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return set(object, path.split('.'), value);\n    } else {\n      object[path] = value;\n      return object;\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n    child = child[key];\n  }\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n  return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick(object, properties, transform) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n  return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow(object, properties) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n  return copy;\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.includes('.');\n}","import { clone, mapObject, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} epsilon\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config(options) {\n    if (options) {\n      var prev = mapObject(config, clone);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      deepExtend(config, options);\n      var curr = mapObject(config, clone);\n      var changes = mapObject(options, clone);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return mapObject(config, clone);\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n  // attach the config properties as readonly properties to the config function\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n\n/**\n * Validate an option\n * @param {Object} options         Object with options\n * @param {string} name            Name of the option to validate\n * @param {Array.<string>} values  Array with valid values for this option\n */\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !values.includes(options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';\n\n// create a read-only version of config\nexport var config = function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n  return Object.freeze(DEFAULT_CONFIG);\n};\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.typed = factory());\n})(this, (function () { 'use strict';\n\n  function ok() {\n    return true;\n  }\n  function notOk() {\n    return false;\n  }\n  function undef() {\n    return undefined;\n  }\n  const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\n  /**\n   * @typedef {{\n   *   params: Param[],\n   *   fn: function,\n   *   test: function,\n   *   implementation: function\n   * }} Signature\n   *\n   * @typedef {{\n   *   types: Type[],\n   *   hasAny: boolean,\n   *   hasConversion: boolean,\n   *   restParam: boolean\n   * }} Param\n   *\n   * @typedef {{\n   *   name: string,\n   *   typeIndex: number,\n   *   test: function,\n   *   isAny: boolean,\n   *   conversion?: ConversionDef,\n   *   conversionIndex: number,\n   * }} Type\n   *\n   * @typedef {{\n   *   from: string,\n   *   to: string,\n   *   convert: function (*) : *\n   * }} ConversionDef\n   *\n   * @typedef {{\n   *   name: string,\n   *   test: function(*) : boolean,\n   *   isAny?: boolean\n   * }} TypeDef\n   */\n\n  /**\n   * @returns {() => function}\n   */\n  function create() {\n    // data type tests\n\n    /**\n     * Returns true if the argument is a non-null \"plain\" object\n     */\n    function isPlainObject(x) {\n      return typeof x === 'object' && x !== null && x.constructor === Object;\n    }\n    const _types = [{\n      name: 'number',\n      test: function (x) {\n        return typeof x === 'number';\n      }\n    }, {\n      name: 'string',\n      test: function (x) {\n        return typeof x === 'string';\n      }\n    }, {\n      name: 'boolean',\n      test: function (x) {\n        return typeof x === 'boolean';\n      }\n    }, {\n      name: 'Function',\n      test: function (x) {\n        return typeof x === 'function';\n      }\n    }, {\n      name: 'Array',\n      test: Array.isArray\n    }, {\n      name: 'Date',\n      test: function (x) {\n        return x instanceof Date;\n      }\n    }, {\n      name: 'RegExp',\n      test: function (x) {\n        return x instanceof RegExp;\n      }\n    }, {\n      name: 'Object',\n      test: isPlainObject\n    }, {\n      name: 'null',\n      test: function (x) {\n        return x === null;\n      }\n    }, {\n      name: 'undefined',\n      test: function (x) {\n        return x === undefined;\n      }\n    }];\n    const anyType = {\n      name: 'any',\n      test: ok,\n      isAny: true\n    };\n\n    // Data structures to track the types. As these are local variables in\n    // create(), each typed universe will get its own copy, but the variables\n    // will only be accessible through the (closures of the) functions supplied\n    // as properties of the typed object, not directly.\n    // These will be initialized in clear() below\n    let typeMap; // primary store of all types\n    let typeList; // Array of just type names, for the sake of ordering\n\n    // And similar data structures for the type conversions:\n    let nConversions = 0;\n    // the actual conversions are stored on a property of the destination types\n\n    // This is a temporary object, will be replaced with a function at the end\n    let typed = {\n      createCount: 0\n    };\n\n    /**\n     * Takes a type name and returns the corresponding official type object\n     * for that type.\n     *\n     * @param {string} typeName\n     * @returns {TypeDef} type\n     */\n    function findType(typeName) {\n      const type = typeMap.get(typeName);\n      if (type) {\n        return type;\n      }\n      // Remainder is error handling\n      let message = 'Unknown type \"' + typeName + '\"';\n      const name = typeName.toLowerCase();\n      let otherName;\n      for (otherName of typeList) {\n        if (otherName.toLowerCase() === name) {\n          message += '. Did you mean \"' + otherName + '\" ?';\n          break;\n        }\n      }\n      throw new TypeError(message);\n    }\n\n    /**\n     * Adds an array `types` of type definitions to this typed instance.\n     * Each type definition should be an object with properties:\n     * 'name' - a string giving the name of the type; 'test' - function\n     * returning a boolean that tests membership in the type; and optionally\n     * 'isAny' - true only for the 'any' type.\n     *\n     * The second optional argument, `before`, gives the name of a type that\n     * these types should be added before. The new types are added in the\n     * order specified.\n     * @param {TypeDef[]} types\n     * @param {string | boolean} [beforeSpec='any'] before\n     */\n    function addTypes(types) {\n      let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n      const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n      const newTypes = [];\n      for (let i = 0; i < types.length; ++i) {\n        if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n          throw new TypeError('Object with properties {name: string, test: function} expected');\n        }\n        const typeName = types[i].name;\n        if (typeMap.has(typeName)) {\n          throw new TypeError('Duplicate type name \"' + typeName + '\"');\n        }\n        newTypes.push(typeName);\n        typeMap.set(typeName, {\n          name: typeName,\n          test: types[i].test,\n          isAny: types[i].isAny,\n          index: beforeIndex + i,\n          conversionsTo: [] // Newly added type can't have any conversions to it\n        });\n      }\n      // update the typeList\n      const affectedTypes = typeList.slice(beforeIndex);\n      typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n      // Fix the indices\n      for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n        typeMap.get(typeList[i]).index = i;\n      }\n    }\n\n    /**\n     * Removes all types and conversions from this typed instance.\n     * May cause previously constructed typed-functions to throw\n     * strange errors when they are called with types that do not\n     * match any of their signatures.\n     */\n    function clear() {\n      typeMap = new Map();\n      typeList = [];\n      nConversions = 0;\n      addTypes([anyType], false);\n    }\n\n    // initialize the types to the default list\n    clear();\n    addTypes(_types);\n\n    /**\n     * Removes all conversions, leaving the types alone.\n     */\n    function clearConversions() {\n      let typeName;\n      for (typeName of typeList) {\n        typeMap.get(typeName).conversionsTo = [];\n      }\n      nConversions = 0;\n    }\n\n    /**\n     * Find the type names that match a value.\n     * @param {*} value\n     * @return {string[]} Array of names of types for which\n     *                  the type test matches the value.\n     */\n    function findTypeNames(value) {\n      const matches = typeList.filter(name => {\n        const type = typeMap.get(name);\n        return !type.isAny && type.test(value);\n      });\n      if (matches.length) {\n        return matches;\n      }\n      return ['any'];\n    }\n\n    /**\n     * Check if an entity is a typed function created by any instance\n     * @param {any} entity\n     * @returns {boolean}\n     */\n    function isTypedFunction(entity) {\n      return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n    }\n\n    /**\n     * Find a specific signature from a (composed) typed function, for example:\n     *\n     *   typed.findSignature(fn, ['number', 'string'])\n     *   typed.findSignature(fn, 'number, string')\n     *   typed.findSignature(fn, 'number,string', {exact: true})\n     *\n     * This function findSignature will by default return the best match to\n     * the given signature, possibly employing type conversions.\n     *\n     * The (optional) third argument is a plain object giving options\n     * controlling the signature search. Currently the only implemented\n     * option is `exact`: if specified as true (default is false), only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Note that a (possibly different) type matching\n     * `any`, or one or more instances of TYPE matching `...TYPE` are\n     * considered exact matches in this regard, as no conversions are used.\n     *\n     * This function returns a \"signature\" object, as does `typed.resolve()`,\n     * which is a plain object with four keys: `params` (the array of parameters\n     * for this signature), `fn` (the originally supplied function for this\n     * signature), `test` (a generated function that determines if an argument\n     * list matches this signature, and `implementation` (the function to call\n     * on a matching argument list, that performs conversions if necessary and\n     * then calls the originally supplied function).\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature search as documented\n     * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n     *     Returns the matching signature, or throws an error when no signature\n     *     is found.\n     */\n    function findSignature(fn, signature, options) {\n      if (!isTypedFunction(fn)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      }\n\n      // Canonicalize input\n      const exact = options && options.exact;\n      const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n      const params = parseSignature(stringSignature);\n      const canonicalSignature = stringifyParams(params);\n\n      // First hope we get lucky and exactly match a signature\n      if (!exact || canonicalSignature in fn.signatures) {\n        // OK, we can check the internal signatures\n        const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n        if (match) {\n          return match;\n        }\n      }\n\n      // Oh well, we did not; so we have to go back and check the parameters\n      // one by one, in order to catch things like `any` and rest params.\n      // Note here we can assume there is at least one parameter, because\n      // the empty signature would have matched successfully above.\n      const nParams = params.length;\n      let remainingSignatures;\n      if (exact) {\n        remainingSignatures = [];\n        let name;\n        for (name in fn.signatures) {\n          remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n        }\n      } else {\n        remainingSignatures = fn._typedFunctionData.signatures;\n      }\n      for (let i = 0; i < nParams; ++i) {\n        const want = params[i];\n        const filteredSignatures = [];\n        let possibility;\n        for (possibility of remainingSignatures) {\n          const have = getParamAtIndex(possibility.params, i);\n          if (!have || want.restParam && !have.restParam) {\n            continue;\n          }\n          if (!have.hasAny) {\n            // have to check all of the wanted types are available\n            const haveTypes = paramTypeSet(have);\n            if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n              continue;\n            }\n          }\n          // OK, this looks good\n          filteredSignatures.push(possibility);\n        }\n        remainingSignatures = filteredSignatures;\n        if (remainingSignatures.length === 0) break;\n      }\n      // Return the first remaining signature that was totally matched:\n      let candidate;\n      for (candidate of remainingSignatures) {\n        if (candidate.params.length <= nParams) {\n          return candidate;\n        }\n      }\n      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n    }\n\n    /**\n     * Find the proper function to call for a specific signature from\n     * a (composed) typed function, for example:\n     *\n     *   typed.find(fn, ['number', 'string'])\n     *   typed.find(fn, 'number, string')\n     *   typed.find(fn, 'number,string', {exact: true})\n     *\n     * This function find will by default return the best match to\n     * the given signature, possibly employing type conversions (and returning\n     * a function that will perform those conversions as needed). The\n     * (optional) third argument is a plain object giving options contolling\n     * the signature search. Currently only the option `exact` is implemented,\n     * which defaults to \"false\". If `exact` is specified as true, then only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Uses of `any` and `...TYPE` are considered exact if\n     * no conversions are necessary to apply the corresponding function.\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature match as documented\n     * @return {function}\n     *     Returns the function to call for the given signature, or throws an\n     *     error if no match is found.\n     */\n    function find(fn, signature, options) {\n      return findSignature(fn, signature, options).implementation;\n    }\n\n    /**\n     * Convert a given value to another data type, specified by type name.\n     *\n     * @param {*} value\n     * @param {string} typeName\n     */\n    function convert(value, typeName) {\n      // check conversion is needed\n      const type = findType(typeName);\n      if (type.test(value)) {\n        return value;\n      }\n      const conversions = type.conversionsTo;\n      if (conversions.length === 0) {\n        throw new Error('There are no conversions to ' + typeName + ' defined.');\n      }\n      for (let i = 0; i < conversions.length; i++) {\n        const fromType = findType(conversions[i].from);\n        if (fromType.test(value)) {\n          return conversions[i].convert(value);\n        }\n      }\n      throw new Error('Cannot convert ' + value + ' to ' + typeName);\n    }\n\n    /**\n     * Stringify parameters in a normalized way\n     * @param {Param[]} params\n     * @param {string} [','] separator\n     * @return {string}\n     */\n    function stringifyParams(params) {\n      let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n      return params.map(p => p.name).join(separator);\n    }\n\n    /**\n     * Parse a parameter, like \"...number | boolean\"\n     * @param {string} param\n     * @return {Param} param\n     */\n    function parseParam(param) {\n      const restParam = param.indexOf('...') === 0;\n      const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n      const typeDefs = types.split('|').map(s => findType(s.trim()));\n      let hasAny = false;\n      let paramName = restParam ? '...' : '';\n      const exactTypes = typeDefs.map(function (type) {\n        hasAny = type.isAny || hasAny;\n        paramName += type.name + '|';\n        return {\n          name: type.name,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion: null,\n          conversionIndex: -1\n        };\n      });\n      return {\n        types: exactTypes,\n        name: paramName.slice(0, -1),\n        // remove trailing '|' from above\n        hasAny,\n        hasConversion: false,\n        restParam\n      };\n    }\n\n    /**\n     * Expands a parsed parameter with the types available from currently\n     * defined conversions.\n     * @param {Param} param\n     * @return {Param} param\n     */\n    function expandParam(param) {\n      const typeNames = param.types.map(t => t.name);\n      const matchingConversions = availableConversions(typeNames);\n      let hasAny = param.hasAny;\n      let newName = param.name;\n      const convertibleTypes = matchingConversions.map(function (conversion) {\n        const type = findType(conversion.from);\n        hasAny = type.isAny || hasAny;\n        newName += '|' + conversion.from;\n        return {\n          name: conversion.from,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion,\n          conversionIndex: conversion.index\n        };\n      });\n      return {\n        types: param.types.concat(convertibleTypes),\n        name: newName,\n        hasAny,\n        hasConversion: convertibleTypes.length > 0,\n        restParam: param.restParam\n      };\n    }\n\n    /**\n     * Return the set of type names in a parameter.\n     * Caches the result for efficiency\n     *\n     * @param {Param} param\n     * @return {Set<string>} typenames\n     */\n    function paramTypeSet(param) {\n      if (!param.typeSet) {\n        param.typeSet = new Set();\n        param.types.forEach(type => param.typeSet.add(type.name));\n      }\n      return param.typeSet;\n    }\n\n    /**\n     * Parse a signature with comma separated parameters,\n     * like \"number | boolean, ...string\"\n     *\n     * @param {string} signature\n     * @return {Param[]} params\n     */\n    function parseSignature(rawSignature) {\n      const params = [];\n      if (typeof rawSignature !== 'string') {\n        throw new TypeError('Signatures must be strings');\n      }\n      const signature = rawSignature.trim();\n      if (signature === '') {\n        return params;\n      }\n      const rawParams = signature.split(',');\n      for (let i = 0; i < rawParams.length; ++i) {\n        const parsedParam = parseParam(rawParams[i].trim());\n        if (parsedParam.restParam && i !== rawParams.length - 1) {\n          throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n        }\n        // if invalid, short-circuit (all the types may have been filtered)\n        if (parsedParam.types.length === 0) {\n          return null;\n        }\n        params.push(parsedParam);\n      }\n      return params;\n    }\n\n    /**\n     * Test whether a set of params contains a restParam\n     * @param {Param[]} params\n     * @return {boolean} Returns true when the last parameter is a restParam\n     */\n    function hasRestParam(params) {\n      const param = last(params);\n      return param ? param.restParam : false;\n    }\n\n    /**\n     * Create a type test for a single parameter, which can have one or multiple\n     * types.\n     * @param {Param} param\n     * @return {function(x: *) : boolean} Returns a test function\n     */\n    function compileTest(param) {\n      if (!param || param.types.length === 0) {\n        // nothing to do\n        return ok;\n      } else if (param.types.length === 1) {\n        return findType(param.types[0].name).test;\n      } else if (param.types.length === 2) {\n        const test0 = findType(param.types[0].name).test;\n        const test1 = findType(param.types[1].name).test;\n        return function or(x) {\n          return test0(x) || test1(x);\n        };\n      } else {\n        // param.types.length > 2\n        const tests = param.types.map(function (type) {\n          return findType(type.name).test;\n        });\n        return function or(x) {\n          for (let i = 0; i < tests.length; i++) {\n            if (tests[i](x)) {\n              return true;\n            }\n          }\n          return false;\n        };\n      }\n    }\n\n    /**\n     * Create a test for all parameters of a signature\n     * @param {Param[]} params\n     * @return {function(args: Array<*>) : boolean}\n     */\n    function compileTests(params) {\n      let tests, test0, test1;\n      if (hasRestParam(params)) {\n        // variable arguments like '...number'\n        tests = initial(params).map(compileTest);\n        const varIndex = tests.length;\n        const lastTest = compileTest(last(params));\n        const testRestParam = function (args) {\n          for (let i = varIndex; i < args.length; i++) {\n            if (!lastTest(args[i])) {\n              return false;\n            }\n          }\n          return true;\n        };\n        return function testArgs(args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n          return testRestParam(args) && args.length >= varIndex + 1;\n        };\n      } else {\n        // no variable arguments\n        if (params.length === 0) {\n          return function testArgs(args) {\n            return args.length === 0;\n          };\n        } else if (params.length === 1) {\n          test0 = compileTest(params[0]);\n          return function testArgs(args) {\n            return test0(args[0]) && args.length === 1;\n          };\n        } else if (params.length === 2) {\n          test0 = compileTest(params[0]);\n          test1 = compileTest(params[1]);\n          return function testArgs(args) {\n            return test0(args[0]) && test1(args[1]) && args.length === 2;\n          };\n        } else {\n          // arguments.length > 2\n          tests = params.map(compileTest);\n          return function testArgs(args) {\n            for (let i = 0; i < tests.length; i++) {\n              if (!tests[i](args[i])) {\n                return false;\n              }\n            }\n            return args.length === tests.length;\n          };\n        }\n      }\n    }\n\n    /**\n     * Find the parameter at a specific index of a Params list.\n     * Handles rest parameters.\n     * @param {Param[]} params\n     * @param {number} index\n     * @return {Param | null} Returns the matching parameter when found,\n     *                        null otherwise.\n     */\n    function getParamAtIndex(params, index) {\n      return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n    }\n\n    /**\n     * Get all type names of a parameter\n     * @param {Params[]} params\n     * @param {number} index\n     * @return {string[]} Returns an array with type names\n     */\n    function getTypeSetAtIndex(params, index) {\n      const param = getParamAtIndex(params, index);\n      if (!param) {\n        return new Set();\n      }\n      return paramTypeSet(param);\n    }\n\n    /**\n     * Test whether a type is an exact type or conversion\n     * @param {Type} type\n     * @return {boolean} Returns true when\n     */\n    function isExactType(type) {\n      return type.conversion === null || type.conversion === undefined;\n    }\n\n    /**\n     * Helper function for creating error messages: create an array with\n     * all available types on a specific argument index.\n     * @param {Signature[]} signatures\n     * @param {number} index\n     * @return {string[]} Returns an array with available types\n     */\n    function mergeExpectedParams(signatures, index) {\n      const typeSet = new Set();\n      signatures.forEach(signature => {\n        const paramSet = getTypeSetAtIndex(signature.params, index);\n        let name;\n        for (name of paramSet) {\n          typeSet.add(name);\n        }\n      });\n      return typeSet.has('any') ? ['any'] : Array.from(typeSet);\n    }\n\n    /**\n     * Create\n     * @param {string} name             The name of the function\n     * @param {array.<*>} args          The actual arguments passed to the function\n     * @param {Signature[]} signatures  A list with available signatures\n     * @return {TypeError} Returns a type error with additional data\n     *                     attached to it in the property `data`\n     */\n    function createError(name, args, signatures) {\n      let err, expected;\n      const _name = name || 'unnamed';\n\n      // test for wrong type at some index\n      let matchingSignatures = signatures;\n      let index;\n      for (index = 0; index < args.length; index++) {\n        const nextMatchingDefs = [];\n        matchingSignatures.forEach(signature => {\n          const param = getParamAtIndex(signature.params, index);\n          const test = compileTest(param);\n          if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n            nextMatchingDefs.push(signature);\n          }\n        });\n        if (nextMatchingDefs.length === 0) {\n          // no matching signatures anymore, throw error \"wrong type\"\n          expected = mergeExpectedParams(matchingSignatures, index);\n          if (expected.length > 0) {\n            const actualTypes = findTypeNames(args[index]);\n            err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n            err.data = {\n              category: 'wrongType',\n              fn: _name,\n              index,\n              actual: actualTypes,\n              expected\n            };\n            return err;\n          }\n        } else {\n          matchingSignatures = nextMatchingDefs;\n        }\n      }\n\n      // test for too few arguments\n      const lengths = matchingSignatures.map(function (signature) {\n        return hasRestParam(signature.params) ? Infinity : signature.params.length;\n      });\n      if (args.length < Math.min.apply(null, lengths)) {\n        expected = mergeExpectedParams(matchingSignatures, index);\n        err = new TypeError('Too few arguments in function ' + _name + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n        err.data = {\n          category: 'tooFewArgs',\n          fn: _name,\n          index: args.length,\n          expected\n        };\n        return err;\n      }\n\n      // test for too many arguments\n      const maxLength = Math.max.apply(null, lengths);\n      if (args.length > maxLength) {\n        err = new TypeError('Too many arguments in function ' + _name + ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n        err.data = {\n          category: 'tooManyArgs',\n          fn: _name,\n          index: args.length,\n          expectedLength: maxLength\n        };\n        return err;\n      }\n\n      // Generic error\n      const argTypes = [];\n      for (let i = 0; i < args.length; ++i) {\n        argTypes.push(findTypeNames(args[i]).join('|'));\n      }\n      err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n      err.data = {\n        category: 'mismatch',\n        actual: argTypes\n      };\n      return err;\n    }\n\n    /**\n     * Find the lowest index of all types of a parameter\n     * @param {Param} param\n     * @return {number} Returns the index of the lowest type in typed.types\n     */\n    function getLowestTypeIndex(param) {\n      let min = typeList.length + 1;\n      for (let i = 0; i < param.types.length; i++) {\n        min = Math.min(min, param.types[i].typeIndex);\n      }\n      return min;\n    }\n\n    /**\n     * Find the lowest index of the conversion of all types of the parameter\n     * having a conversion\n     * @param {Param} param\n     * @return {number} Returns the lowest index of the conversions of this type\n     */\n    function getLowestConversionIndex(param) {\n      let min = nConversions + 1;\n      for (let i = 0; i < param.types.length; i++) {\n        if (!isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].conversionIndex);\n        }\n      }\n      return min;\n    }\n\n    /**\n     * Compare two params. The return value is a number that is\n     * negative when param1 should be considered first, positive\n     * when param2 should be considered first, and zero when the\n     * params are indistinguishable. Primarily as a debugging aid,\n     * the value is always less than one in absolute value, and\n     * a smaller absolute value indicates a less important distinction\n     * between the parameters.\n     * @param {Param} param1\n     * @param {Param} param2\n     * @return {number} negative, positive, or zero depending on whether\n     *                  param1 should be ordered before, after, or equivalently\n     *                  to param2\n     */\n    function compareParams(param1, param2) {\n      // We compare a number of metrics on a param in turn:\n      // 1) 'any' parameters are the least preferred\n      if (param1.hasAny) {\n        if (!param2.hasAny) {\n          return 0.1;\n        }\n      } else if (param2.hasAny) {\n        return -0.1;\n      }\n\n      // 2) Prefer non-rest to rest parameters\n      if (param1.restParam) {\n        if (!param2.restParam) {\n          return 0.01;\n        }\n      } else if (param2.restParam) {\n        return -0.01;\n      }\n\n      // 3) Prefer lower type index:\n      const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n      if (typeDiff < 0) {\n        return -1e-3;\n      }\n      if (typeDiff > 0) {\n        return 0.001;\n      }\n\n      // 4) Prefer exact type match to conversions, with a strength that\n      //    grows with the conversion index\n      const conv1 = getLowestConversionIndex(param1);\n      const conv2 = getLowestConversionIndex(param2);\n      if (param1.hasConversion) {\n        if (!param2.hasConversion) {\n          return (1 + conv1) * 0.000001;\n        }\n      } else if (param2.hasConversion) {\n        return -(1 + conv2) * 0.000001;\n      }\n\n      // 5) Prefer lower conversion index\n      const convDiff = conv1 - conv2;\n      if (convDiff < 0) {\n        return -1e-7;\n      }\n      if (convDiff > 0) {\n        return 0.0000001;\n      }\n\n      // Don't have a basis for preference\n      return 0;\n    }\n\n    /**\n     * Compare two signatures. The result is a number that is negative\n     * when the first signature should be preferred to the second, positive\n     * when the second signature should be preferred, and zero in case the\n     * two signatures are essentially equivalent. Primarily as a debugging\n     * aid, a larger absolute value indicates a more \"important\" difference.\n     *\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {number} returns a negative number when signature1 must get a\n     *                  lower index than signature2, a positive number when the\n     *                  opposite holds, or zero when both are equivalent.\n     */\n    function compareSignatures(signature1, signature2) {\n      const pars1 = signature1.params;\n      const pars2 = signature2.params;\n      const last1 = last(pars1);\n      const last2 = last(pars2);\n      const hasRest1 = hasRestParam(pars1);\n      const hasRest2 = hasRestParam(pars2);\n      // We compare a number of metrics on signatures in turn:\n      // 1) An \"any rest param\" is least preferred\n      if (hasRest1 && last1.hasAny) {\n        if (!hasRest2 || !last2.hasAny) {\n          return 10000000;\n        }\n      } else if (hasRest2 && last2.hasAny) {\n        return -1e7;\n      }\n\n      // 2) Minimize the number of 'any' parameters\n      let any1 = 0;\n      let conv1 = 0;\n      let par;\n      for (par of pars1) {\n        if (par.hasAny) ++any1;\n        if (par.hasConversion) ++conv1;\n      }\n      let any2 = 0;\n      let conv2 = 0;\n      for (par of pars2) {\n        if (par.hasAny) ++any2;\n        if (par.hasConversion) ++conv2;\n      }\n      if (any1 !== any2) {\n        return (any1 - any2) * 1000000;\n      }\n\n      // 3) A conversion rest param is less preferred\n      if (hasRest1 && last1.hasConversion) {\n        if (!hasRest2 || !last2.hasConversion) {\n          return 100000;\n        }\n      } else if (hasRest2 && last2.hasConversion) {\n        return -1e5;\n      }\n\n      // 4) Minimize the number of conversions\n      if (conv1 !== conv2) {\n        return (conv1 - conv2) * 10000;\n      }\n\n      // 5) Prefer no rest param\n      if (hasRest1) {\n        if (!hasRest2) {\n          return 1000;\n        }\n      } else if (hasRest2) {\n        return -1e3;\n      }\n\n      // 6) Prefer shorter with rest param, longer without\n      const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);\n      if (lengthCriterion !== 0) {\n        return lengthCriterion;\n      }\n\n      // Signatures are identical in each of the above metrics.\n      // In particular, they are the same length.\n      // We can therefore compare the parameters one by one.\n      // First we count which signature has more preferred parameters.\n      const comparisons = [];\n      let tc = 0;\n      for (let i = 0; i < pars1.length; ++i) {\n        const thisComparison = compareParams(pars1[i], pars2[i]);\n        comparisons.push(thisComparison);\n        tc += thisComparison;\n      }\n      if (tc !== 0) {\n        return (tc < 0 ? -10 : 10) + tc;\n      }\n\n      // They have the same number of preferred parameters, so go by the\n      // earliest parameter in which we have a preference.\n      // In other words, dispatch is driven somewhat more by earlier\n      // parameters than later ones.\n      let c;\n      let bonus = 9;\n      const decrement = bonus / (comparisons.length + 1);\n      for (c of comparisons) {\n        if (c !== 0) {\n          return (c < 0 ? -bonus : bonus) + c;\n        }\n        bonus -= decrement;\n      }\n\n      // It's a tossup:\n      return 0;\n    }\n\n    /**\n     * Produce a list of all conversions from distinct types to one of\n     * the given types.\n     *\n     * @param {string[]} typeNames\n     * @return {ConversionDef[]} Returns the conversions that are available\n     *                        resulting in any given type (if any)\n     */\n    function availableConversions(typeNames) {\n      if (typeNames.length === 0) {\n        return [];\n      }\n      const types = typeNames.map(findType);\n      if (typeNames.length === 1) return types[0].conversionsTo;\n\n      // Here, for each type that occurs as the from-type of any conversion\n      // to any of the types found, we must select the conversion of\n      // lowest index from that type. So first collect the types.\n      const knownTypes = new Set(typeNames);\n      const convertibleTypes = new Set();\n      for (let i = 0; i < types.length; ++i) {\n        for (const match of types[i].conversionsTo) {\n          if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);\n        }\n      }\n\n      // Now get the lowest-index conversion for each type\n      const matches = [];\n      for (const typeName of convertibleTypes) {\n        let bestIndex = nConversions + 1;\n        let bestConversion = null;\n        for (let i = 0; i < types.length; ++i) {\n          for (const match of types[i].conversionsTo) {\n            if (match.from === typeName && match.index < bestIndex) {\n              bestIndex = match.index;\n              bestConversion = match;\n            }\n          }\n        }\n        matches.push(bestConversion);\n      }\n      return matches;\n    }\n\n    /**\n     * Preprocess arguments before calling the original function:\n     * - if needed convert the parameters\n     * - in case of rest parameters, move the rest parameters into an Array\n     * @param {Param[]} params\n     * @param {function} fn\n     * @return {function} Returns fn or a wrapped function if needed. If it\n     *                    has conversions, the function will be named to indicate\n     *                    what conversions are occurring.\n     */\n    function compileArgsPreprocessing(params, fn) {\n      let fnConvert = fn;\n\n      // TODO: can we make this wrapper function smarter/simpler?\n\n      let name = '';\n      if (params.some(p => p.hasConversion)) {\n        const restParam = hasRestParam(params);\n        const compiledConversions = params.map(compileArgConversion);\n        name = compiledConversions.map(conv => conv.name).join(';');\n        fnConvert = function convertArgs() {\n          const args = [];\n          const last = restParam ? arguments.length - 1 : arguments.length;\n          for (let i = 0; i < last; i++) {\n            args[i] = compiledConversions[i](arguments[i]);\n          }\n          if (restParam) {\n            args[last] = arguments[last].map(compiledConversions[last]);\n          }\n          return fn.apply(this, args);\n        };\n      }\n      let fnPreprocess = fnConvert;\n      if (hasRestParam(params)) {\n        const offset = params.length - 1;\n        fnPreprocess = function preprocessRestParams() {\n          return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n        };\n      }\n      if (name) Object.defineProperty(fnPreprocess, 'name', {\n        value: name\n      });\n      return fnPreprocess;\n    }\n\n    /**\n     * Compile conversion for a parameter to the right type\n     * @param {Param} param\n     * @return {function} Returns the wrapped function that will convert arguments\n     *\n     */\n    function compileArgConversion(param) {\n      let test0, test1, conversion0, conversion1;\n      const tests = [];\n      const conversions = [];\n      let name = '';\n      param.types.forEach(function (type) {\n        if (type.conversion) {\n          name += type.conversion.from + '~>' + type.conversion.to + ',';\n          tests.push(findType(type.conversion.from).test);\n          conversions.push(type.conversion.convert);\n        }\n      });\n      if (name) name = name.slice(0, -1);else name = 'pass';\n\n      // create optimized conversion functions depending on the number of conversions\n      let convertor = arg => arg;\n      switch (conversions.length) {\n        case 0:\n          break;\n        case 1:\n          test0 = tests[0];\n          conversion0 = conversions[0];\n          convertor = function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg);\n            }\n            return arg;\n          };\n          break;\n        case 2:\n          test0 = tests[0];\n          test1 = tests[1];\n          conversion0 = conversions[0];\n          conversion1 = conversions[1];\n          convertor = function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg);\n            }\n            if (test1(arg)) {\n              return conversion1(arg);\n            }\n            return arg;\n          };\n          break;\n        default:\n          convertor = function convertArg(arg) {\n            for (let i = 0; i < conversions.length; i++) {\n              if (tests[i](arg)) {\n                return conversions[i](arg);\n              }\n            }\n            return arg;\n          };\n      }\n      Object.defineProperty(convertor, 'name', {\n        value: name\n      });\n      return convertor;\n    }\n\n    /**\n     * Split params with union types in to separate params.\n     *\n     * For example:\n     *\n     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n     *     // returns:\n     *     // [\n     *     //   ['Array', 'string'],\n     *     //   ['Array', 'RegExp'],\n     *     //   ['Object', 'string'],\n     *     //   ['Object', 'RegExp']\n     *     // ]\n     *\n     * @param {Param[]} params\n     * @return {Param[]}\n     */\n    function splitParams(params) {\n      function _splitParams(params, index, paramsSoFar) {\n        if (index < params.length) {\n          const param = params[index];\n          let resultingParams = [];\n          if (param.restParam) {\n            // split the types of a rest parameter in two:\n            // one with only exact types, and one with exact types and conversions\n            const exactTypes = param.types.filter(isExactType);\n            if (exactTypes.length < param.types.length) {\n              resultingParams.push({\n                types: exactTypes,\n                name: '...' + exactTypes.map(t => t.name).join('|'),\n                hasAny: exactTypes.some(t => t.isAny),\n                hasConversion: false,\n                restParam: true\n              });\n            }\n            resultingParams.push(param);\n          } else {\n            // split all the types of a regular parameter into one type per param\n            resultingParams = param.types.map(function (type) {\n              return {\n                types: [type],\n                name: type.name,\n                hasAny: type.isAny,\n                hasConversion: type.conversion,\n                restParam: false\n              };\n            });\n          }\n\n          // recurse over the groups with types\n          return flatMap(resultingParams, function (nextParam) {\n            return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n          });\n        } else {\n          // we've reached the end of the parameters.\n          return [paramsSoFar];\n        }\n      }\n      return _splitParams(params, 0, []);\n    }\n\n    /**\n     * Test whether two param lists represent conflicting signatures\n     * @param {Param[]} params1\n     * @param {Param[]} params2\n     * @return {boolean} Returns true when the signatures conflict, false otherwise.\n     */\n    function conflicting(params1, params2) {\n      const ii = Math.max(params1.length, params2.length);\n      for (let i = 0; i < ii; i++) {\n        const typeSet1 = getTypeSetAtIndex(params1, i);\n        const typeSet2 = getTypeSetAtIndex(params2, i);\n        let overlap = false;\n        let name;\n        for (name of typeSet2) {\n          if (typeSet1.has(name)) {\n            overlap = true;\n            break;\n          }\n        }\n        if (!overlap) {\n          return false;\n        }\n      }\n      const len1 = params1.length;\n      const len2 = params2.length;\n      const restParam1 = hasRestParam(params1);\n      const restParam2 = hasRestParam(params2);\n      return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n    }\n\n    /**\n     * Helper function for `resolveReferences` that returns a copy of\n     * functionList wihe any prior resolutions cleared out, in case we are\n     * recycling signatures from a prior typed function construction.\n     *\n     * @param {Array.<function|typed-reference>} functionList\n     * @return {Array.<function|typed-reference>}\n     */\n    function clearResolutions(functionList) {\n      return functionList.map(fn => {\n        if (isReferToSelf(fn)) {\n          return referToSelf(fn.referToSelf.callback);\n        }\n        if (isReferTo(fn)) {\n          return makeReferTo(fn.referTo.references, fn.referTo.callback);\n        }\n        return fn;\n      });\n    }\n\n    /**\n     * Take a list of references, a list of functions functionList, and a\n     * signatureMap indexing signatures into functionList, and return\n     * the list of resolutions, or a false-y value if they don't all\n     * resolve in a valid way (yet).\n     *\n     * @param {string[]} references\n     * @param {Array<function|typed-reference} functionList\n     * @param {Object.<string, integer>} signatureMap\n     * @return {function[] | false} resolutions\n     */\n    function collectResolutions(references, functionList, signatureMap) {\n      const resolvedReferences = [];\n      let reference;\n      for (reference of references) {\n        let resolution = signatureMap[reference];\n        if (typeof resolution !== 'number') {\n          throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n        }\n        resolution = functionList[resolution];\n        if (typeof resolution !== 'function') {\n          return false;\n        }\n        resolvedReferences.push(resolution);\n      }\n      return resolvedReferences;\n    }\n\n    /**\n     * Resolve any references in the functionList for the typed function\n     * itself. The signatureMap tells which index in the functionList a\n     * given signature should be mapped to (for use in resolving typed.referTo)\n     * and self provides the destions of a typed.referToSelf.\n     *\n     * @param {Array<function | typed-reference-object>} functionList\n     * @param {Object.<string, function>} signatureMap\n     * @param {function} self  The typed-function itself\n     * @return {Array<function>} The list of resolved functions\n     */\n    function resolveReferences(functionList, signatureMap, self) {\n      const resolvedFunctions = clearResolutions(functionList);\n      const isResolved = new Array(resolvedFunctions.length).fill(false);\n      let leftUnresolved = true;\n      while (leftUnresolved) {\n        leftUnresolved = false;\n        let nothingResolved = true;\n        for (let i = 0; i < resolvedFunctions.length; ++i) {\n          if (isResolved[i]) continue;\n          const fn = resolvedFunctions[i];\n          if (isReferToSelf(fn)) {\n            resolvedFunctions[i] = fn.referToSelf.callback(self);\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referToSelf = fn.referToSelf;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else if (isReferTo(fn)) {\n            const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n            if (resolvedReferences) {\n              resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n              // Preserve reference in case signature is reused someday:\n              resolvedFunctions[i].referTo = fn.referTo;\n              isResolved[i] = true;\n              nothingResolved = false;\n            } else {\n              leftUnresolved = true;\n            }\n          }\n        }\n        if (nothingResolved && leftUnresolved) {\n          throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n        }\n      }\n      return resolvedFunctions;\n    }\n\n    /**\n     * Validate whether any of the function bodies contains a self-reference\n     * usage like `this(...)` or `this.signatures`. This self-referencing is\n     * deprecated since typed-function v3. It has been replaced with\n     * the functions typed.referTo and typed.referToSelf.\n     * @param {Object.<string, function>} signaturesMap\n     */\n    function validateDeprecatedThis(signaturesMap) {\n      // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n      // match occurrences like 'this(' and 'this.signatures'\n      const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n      Object.keys(signaturesMap).forEach(signature => {\n        const fn = signaturesMap[signature];\n        if (deprecatedThisRegex.test(fn.toString())) {\n          throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n        }\n      });\n    }\n\n    /**\n     * Create a typed function\n     * @param {String} name               The name for the typed function\n     * @param {Object.<string, function>} rawSignaturesMap\n     *                                    An object with one or\n     *                                    multiple signatures as key, and the\n     *                                    function corresponding to the\n     *                                    signature as value.\n     * @return {function}  Returns the created typed function.\n     */\n    function createTypedFunction(name, rawSignaturesMap) {\n      typed.createCount++;\n      if (Object.keys(rawSignaturesMap).length === 0) {\n        throw new SyntaxError('No signatures provided');\n      }\n      if (typed.warnAgainstDeprecatedThis) {\n        validateDeprecatedThis(rawSignaturesMap);\n      }\n\n      // Main processing loop for signatures\n      const parsedParams = [];\n      const originalFunctions = [];\n      const signaturesMap = {};\n      const preliminarySignatures = []; // may have duplicates from conversions\n      let signature;\n      for (signature in rawSignaturesMap) {\n        // A) Protect against polluted Object prototype:\n        if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n          continue;\n        }\n        // B) Parse the signature\n        const params = parseSignature(signature);\n        if (!params) continue;\n        // C) Check for conflicts\n        parsedParams.forEach(function (pp) {\n          if (conflicting(pp, params)) {\n            throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n          }\n        });\n        parsedParams.push(params);\n        // D) Store the provided function and add conversions\n        const functionIndex = originalFunctions.length;\n        originalFunctions.push(rawSignaturesMap[signature]);\n        const conversionParams = params.map(expandParam);\n        // E) Split the signatures and collect them up\n        let sp;\n        for (sp of splitParams(conversionParams)) {\n          const spName = stringifyParams(sp);\n          preliminarySignatures.push({\n            params: sp,\n            name: spName,\n            fn: functionIndex\n          });\n          if (sp.every(p => !p.hasConversion)) {\n            signaturesMap[spName] = functionIndex;\n          }\n        }\n      }\n      preliminarySignatures.sort(compareSignatures);\n\n      // Note the forward reference to theTypedFn\n      const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n      // Fill in the proper function for each signature\n      let s;\n      for (s in signaturesMap) {\n        if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n          signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n        }\n      }\n      const signatures = [];\n      const internalSignatureMap = new Map(); // benchmarks faster than object\n      for (s of preliminarySignatures) {\n        // Note it's only safe to eliminate duplicates like this\n        // _after_ the signature sorting step above; otherwise we might\n        // remove the wrong one.\n        if (!internalSignatureMap.has(s.name)) {\n          s.fn = resolvedFunctions[s.fn];\n          signatures.push(s);\n          internalSignatureMap.set(s.name, s);\n        }\n      }\n\n      // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n      const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n      const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n      const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n      const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n      const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n      const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n      const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n      // compile the tests\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].test = compileTests(signatures[i].params);\n      }\n      const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n      const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n      const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n      const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n      const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n      const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n      const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n      const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n      const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n      const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n      const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n      const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n      // compile the functions\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n      }\n      const fn0 = ok0 ? signatures[0].implementation : undef;\n      const fn1 = ok1 ? signatures[1].implementation : undef;\n      const fn2 = ok2 ? signatures[2].implementation : undef;\n      const fn3 = ok3 ? signatures[3].implementation : undef;\n      const fn4 = ok4 ? signatures[4].implementation : undef;\n      const fn5 = ok5 ? signatures[5].implementation : undef;\n      const len0 = ok0 ? signatures[0].params.length : -1;\n      const len1 = ok1 ? signatures[1].params.length : -1;\n      const len2 = ok2 ? signatures[2].params.length : -1;\n      const len3 = ok3 ? signatures[3].params.length : -1;\n      const len4 = ok4 ? signatures[4].params.length : -1;\n      const len5 = ok5 ? signatures[5].params.length : -1;\n\n      // simple and generic, but also slow\n      const iStart = allOk ? 6 : 0;\n      const iEnd = signatures.length;\n      // de-reference ahead for execution speed:\n      const tests = signatures.map(s => s.test);\n      const fns = signatures.map(s => s.implementation);\n      const generic = function generic() {\n\n        for (let i = iStart; i < iEnd; i++) {\n          if (tests[i](arguments)) {\n            return fns[i].apply(this, arguments);\n          }\n        }\n        return typed.onMismatch(name, arguments, signatures);\n      };\n\n      // create the typed function\n      // fast, specialized version. Falls back to the slower, generic one if needed\n      function theTypedFn(arg0, arg1) {\n\n        if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n          return fn0.apply(this, arguments);\n        }\n        if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n          return fn1.apply(this, arguments);\n        }\n        if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n          return fn2.apply(this, arguments);\n        }\n        if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n          return fn3.apply(this, arguments);\n        }\n        if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n          return fn4.apply(this, arguments);\n        }\n        if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n          return fn5.apply(this, arguments);\n        }\n        return generic.apply(this, arguments);\n      }\n\n      // attach name the typed function\n      try {\n        Object.defineProperty(theTypedFn, 'name', {\n          value: name\n        });\n      } catch (err) {\n        // old browsers do not support Object.defineProperty and some don't support setting the name property\n        // the function name is not essential for the functioning, it's mostly useful for debugging,\n        // so it's fine to have unnamed functions.\n      }\n\n      // attach signatures to the function.\n      // This property is close to the original collection of signatures\n      // used to create the typed-function, just with unions split:\n      theTypedFn.signatures = signaturesMap;\n\n      // Store internal data for functions like resolve, find, etc.\n      // Also serves as the flag that this is a typed-function\n      theTypedFn._typedFunctionData = {\n        signatures,\n        signatureMap: internalSignatureMap\n      };\n      return theTypedFn;\n    }\n\n    /**\n     * Action to take on mismatch\n     * @param {string} name      Name of function that was attempted to be called\n     * @param {Array} args       Actual arguments to the call\n     * @param {Array} signatures Known signatures of the named typed-function\n     */\n    function _onMismatch(name, args, signatures) {\n      throw createError(name, args, signatures);\n    }\n\n    /**\n     * Return all but the last items of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {Array}\n     */\n    function initial(arr) {\n      return slice(arr, 0, arr.length - 1);\n    }\n\n    /**\n     * return the last item of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {*}\n     */\n    function last(arr) {\n      return arr[arr.length - 1];\n    }\n\n    /**\n     * Slice an array or function Arguments\n     * @param {Array | Arguments | IArguments} arr\n     * @param {number} start\n     * @param {number} [end]\n     * @return {Array}\n     */\n    function slice(arr, start, end) {\n      return Array.prototype.slice.call(arr, start, end);\n    }\n\n    /**\n     * Return the first item from an array for which test(arr[i]) returns true\n     * @param {Array} arr\n     * @param {function} test\n     * @return {* | undefined} Returns the first matching item\n     *                         or undefined when there is no match\n     */\n    function findInArray(arr, test) {\n      for (let i = 0; i < arr.length; i++) {\n        if (test(arr[i])) {\n          return arr[i];\n        }\n      }\n      return undefined;\n    }\n\n    /**\n     * Flat map the result invoking a callback for every item in an array.\n     * https://gist.github.com/samgiles/762ee337dff48623e729\n     * @param {Array} arr\n     * @param {function} callback\n     * @return {Array}\n     */\n    function flatMap(arr, callback) {\n      return Array.prototype.concat.apply([], arr.map(callback));\n    }\n\n    /**\n     * Create a reference callback to one or multiple signatures\n     *\n     * Syntax:\n     *\n     *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n     *       // ...\n     *     })\n     *\n     * @returns {{referTo: {references: string[], callback}}}\n     */\n    function referTo() {\n      const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n      const callback = last(arguments);\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as last argument');\n      }\n      return makeReferTo(references, callback);\n    }\n    function makeReferTo(references, callback) {\n      return {\n        referTo: {\n          references,\n          callback\n        }\n      };\n    }\n\n    /**\n     * Create a reference callback to the typed-function itself\n     *\n     * @param {(self: function) => function} callback\n     * @returns {{referToSelf: { callback: function }}}\n     */\n    function referToSelf(callback) {\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as first argument');\n      }\n      return {\n        referToSelf: {\n          callback\n        }\n      };\n    }\n\n    /**\n     * Test whether something is a referTo object, holding a list with reference\n     * signatures and a callback.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n    function isReferTo(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n    }\n\n    /**\n     * Test whether something is a referToSelf object, holding a callback where\n     * to pass `self`.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n    function isReferToSelf(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n    }\n\n    /**\n     * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n     * an error in case (C).\n     *\n     * @param { string | undefined } nameSoFar\n     * @param { string | undefined } newName\n     * @returns { string } updated name\n     */\n    function checkName(nameSoFar, newName) {\n      if (!nameSoFar) {\n        return newName;\n      }\n      if (newName && newName !== nameSoFar) {\n        const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n        err.data = {\n          actual: newName,\n          expected: nameSoFar\n        };\n        throw err;\n      }\n      return nameSoFar;\n    }\n\n    /**\n     * Retrieve the implied name from an object with signature keys\n     * and function values, checking whether all value names match\n     *\n     * @param { {string: function} } obj\n     */\n    function getObjectName(obj) {\n      let name;\n      for (const key in obj) {\n        // Only pay attention to own properties, and only if their values\n        // are typed functions or functions with a signature property\n        if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n          name = checkName(name, obj[key].name);\n        }\n      }\n      return name;\n    }\n\n    /**\n     * Copy all of the signatures from the second argument into the first,\n     * which is modified by side effect, checking for conflicts\n     *\n     * @param {Object.<string, function|typed-reference>} dest\n     * @param {Object.<string, function|typed-reference>} source\n     */\n    function mergeSignatures(dest, source) {\n      let key;\n      for (key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          if (key in dest) {\n            if (source[key] !== dest[key]) {\n              const err = new Error('Signature \"' + key + '\" is defined twice');\n              err.data = {\n                signature: key,\n                sourceFunction: source[key],\n                destFunction: dest[key]\n              };\n              throw err;\n            }\n            // else: both signatures point to the same function, that's fine\n          }\n          dest[key] = source[key];\n        }\n      }\n    }\n    const saveTyped = typed;\n\n    /**\n     * Originally the main function was a typed function itself, but then\n     * it might not be able to generate error messages if the client\n     * replaced the type system with different names.\n     *\n     * Main entry: typed([name], functions/objects with signatures...)\n     *\n     * Assembles and returns a new typed-function from the given items\n     * that provide signatures and implementations, each of which may be\n     * * a plain object mapping (string) signatures to implementing functions,\n     * * a previously constructed typed function, or\n     * * any other single function with a string-valued property `signature`.\n      * The name of the resulting typed-function will be given by the\n     * string-valued name argument if present, or if not, by the name\n     * of any of the arguments that have one, as long as any that do are\n     * consistent with each other. If no name is specified, the name will be\n     * an empty string.\n     *\n     * @param {string} maybeName [optional]\n     * @param {(function|object)[]} signature providers\n     * @returns {typed-function}\n     */\n    typed = function (maybeName) {\n      const named = typeof maybeName === 'string';\n      const start = named ? 1 : 0;\n      let name = named ? maybeName : '';\n      const allSignatures = {};\n      for (let i = start; i < arguments.length; ++i) {\n        const item = arguments[i];\n        let theseSignatures = {};\n        let thisName;\n        if (typeof item === 'function') {\n          thisName = item.name;\n          if (typeof item.signature === 'string') {\n            // Case 1: Ordinary function with a string 'signature' property\n            theseSignatures[item.signature] = item;\n          } else if (isTypedFunction(item)) {\n            // Case 2: Existing typed function\n            theseSignatures = item.signatures;\n          }\n        } else if (isPlainObject(item)) {\n          // Case 3: Plain object, assume keys = signatures, values = functions\n          theseSignatures = item;\n          if (!named) {\n            thisName = getObjectName(item);\n          }\n        }\n        if (Object.keys(theseSignatures).length === 0) {\n          const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n          err.data = {\n            index: i,\n            argument: item\n          };\n          throw err;\n        }\n        if (!named) {\n          name = checkName(name, thisName);\n        }\n        mergeSignatures(allSignatures, theseSignatures);\n      }\n      return createTypedFunction(name || '', allSignatures);\n    };\n    typed.create = create;\n    typed.createCount = saveTyped.createCount;\n    typed.onMismatch = _onMismatch;\n    typed.throwMismatchError = _onMismatch;\n    typed.createError = createError;\n    typed.clear = clear;\n    typed.clearConversions = clearConversions;\n    typed.addTypes = addTypes;\n    typed._findType = findType; // For unit testing only\n    typed.referTo = referTo;\n    typed.referToSelf = referToSelf;\n    typed.convert = convert;\n    typed.findSignature = findSignature;\n    typed.find = find;\n    typed.isTypedFunction = isTypedFunction;\n    typed.warnAgainstDeprecatedThis = true;\n\n    /**\n     * add a type (convenience wrapper for typed.addTypes)\n     * @param {{name: string, test: function}} type\n     * @param {boolean} [beforeObjectTest=true]\n     *                          If true, the new test will be inserted before\n     *                          the test with name 'Object' (if any), since\n     *                          tests for Object match Array and classes too.\n     */\n    typed.addType = function (type, beforeObjectTest) {\n      let before = 'any';\n      if (beforeObjectTest !== false && typeMap.has('Object')) {\n        before = 'Object';\n      }\n      typed.addTypes([type], before);\n    };\n\n    /**\n     * Verify that the ConversionDef conversion has a valid format.\n     *\n     * @param {conversionDef} conversion\n     * @return {void}\n     * @throws {TypeError|SyntaxError}\n     */\n    function _validateConversion(conversion) {\n      if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n      }\n      if (conversion.to === conversion.from) {\n        throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n      }\n    }\n\n    /**\n     * Add a conversion\n     *\n     * @param {ConversionDef} conversion\n     * @param {{override: boolean}} [options]\n     * @returns {void}\n     * @throws {TypeError}\n     */\n    typed.addConversion = function (conversion) {\n      let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n        override: false\n      };\n      _validateConversion(conversion);\n      const to = findType(conversion.to);\n      const existing = to.conversionsTo.find(other => other.from === conversion.from);\n      if (existing) {\n        if (options && options.override) {\n          typed.removeConversion({\n            from: existing.from,\n            to: conversion.to,\n            convert: existing.convert\n          });\n        } else {\n          throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n        }\n      }\n      to.conversionsTo.push({\n        from: conversion.from,\n        to: to.name,\n        convert: conversion.convert,\n        index: nConversions++\n      });\n    };\n\n    /**\n     * Convenience wrapper to call addConversion on each conversion in a list.\n     *\n     * @param {ConversionDef[]} conversions\n     * @param {{override: boolean}} [options]\n     * @returns {void}\n     * @throws {TypeError}\n     */\n    typed.addConversions = function (conversions, options) {\n      conversions.forEach(conversion => typed.addConversion(conversion, options));\n    };\n\n    /**\n     * Remove the specified conversion. The format is the same as for\n     * addConversion, and the convert function must match or an error\n     * is thrown.\n     *\n     * @param {{from: string, to: string, convert: function}} conversion\n     * @returns {void}\n     * @throws {TypeError|SyntaxError|Error}\n     */\n    typed.removeConversion = function (conversion) {\n      _validateConversion(conversion);\n      const to = findType(conversion.to);\n      const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n      if (!existingConversion) {\n        throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n      }\n      if (existingConversion.convert !== conversion.convert) {\n        throw new Error('Conversion to remove does not match existing conversion');\n      }\n      const index = to.conversionsTo.indexOf(existingConversion);\n      to.conversionsTo.splice(index, 1);\n    };\n\n    /**\n     * Produce the specific signature that a typed function\n     * will execute on the given arguments. Here, a \"signature\" is an\n     * object with properties 'params', 'test', 'fn', and 'implementation'.\n     * This last property is a function that converts params as necessary\n     * and then calls 'fn'. Returns null if there is no matching signature.\n     * @param {typed-function} tf\n     * @param {any[]} argList\n     * @returns {{params: string, test: function, fn: function, implementation: function}}\n     */\n    typed.resolve = function (tf, argList) {\n      if (!isTypedFunction(tf)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      }\n      const sigs = tf._typedFunctionData.signatures;\n      for (let i = 0; i < sigs.length; ++i) {\n        if (sigs[i].test(argList)) {\n          return sigs[i];\n        }\n      }\n      return null;\n    };\n    return typed;\n  }\n  var typedFunction = create();\n\n  return typedFunction;\n\n}));\n//# sourceMappingURL=typed-function.js.map\n","import { isBigNumber, isNumber, isObject } from './is.js';\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = Math.log1p || function (x) {\n  return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport var cbrt = Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n  var negate = x < 0;\n  var result;\n  if (negate) {\n    x = -x;\n  }\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3);\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n  return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = Math.expm1 || function expm1(x) {\n  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n    suffix = \"i\".concat(size);\n  }\n  var sign = '';\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'engineering'    Always use engineering notation.\n *                                          For example '123.4e+0' and '14.0e+6'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lowerExp` and `upperExp` bounds, and\n *                                          uses exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default,\n *                                          not rounding any digits.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12.071, {notation: 'fixed'})                // '12'\n *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'\n *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'\n *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize);\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Normalize format options into an object:\n *   {\n *     notation: string,\n *     precision: number | undefined,\n *     wordSize: number | undefined\n *   }\n */\nexport function normalizeFormatOptions(options) {\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    if (isNumber(options)) {\n      precision = options;\n    } else if (isBigNumber(options)) {\n      precision = options.toNumber();\n    } else if (isObject(options)) {\n      if (options.precision !== undefined) {\n        precision = _toNumberOrThrow(options.precision, () => {\n          throw new Error('Option \"precision\" must be a number or BigNumber');\n        });\n      }\n      if (options.wordSize !== undefined) {\n        wordSize = _toNumberOrThrow(options.wordSize, () => {\n          throw new Error('Option \"wordSize\" must be a number or BigNumber');\n        });\n      }\n      if (options.notation) {\n        notation = options.notation;\n      }\n    } else {\n      throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n    }\n  }\n  return {\n    notation,\n    precision,\n    wordSize\n  };\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n  return {\n    sign,\n    coefficients,\n    exponent\n  };\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients;\n\n  // find nearest lower multiple of 3 for exponent\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n  if (isNumber(precision)) {\n    // add zeroes to give correct sig figs\n    while (precision > c.length || e - newExp + 1 > c.length) {\n      c.push(0);\n    }\n  } else {\n    // concatenate coefficients with necessary zeros\n    // add zeros if necessary (for example: 1e+8 -> 100e+6)\n    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  }\n\n  // find difference in exponents\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1;\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\n  }\n\n  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n  // otherwise concat with the rest of the coefficients\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined]  Optional number of decimals after the\n *                                        decimal point. null by default.\n */\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n\n  // append zeros if needed\n  var pp = p + (precision || 0);\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n  return rounded.sign + c.join('');\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n */\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n  var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent;\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n    // prepend zeros\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n    return rounded.sign + c.join('');\n  }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split       A value split with .splitNumber(value)\n * @param {number} precision  A positive integer\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n *              with rounded digits\n */\nexport function roundDigits(split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients;\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n      while (c[i] === 10) {\n        c.pop();\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n        i--;\n        c[i]++;\n      }\n    }\n  }\n  return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n  var arr = [];\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n  return arr;\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n *   2.34 returns 3\n *   0.0034 returns 2\n *   120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits   Number of significant digits\n */\nexport function digits(value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n}\n\n/**\n * Minimum number added to one that makes the result different than one\n */\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n\n/**\n * Compares two floating point numbers.\n * @param {number} x          First value to compare\n * @param {number} y          Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n*/\nexport function nearlyEqual(x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x === y;\n  }\n  if (x === y) {\n    return true;\n  }\n\n  // NaN\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  }\n\n  // at this point x and y should be finite\n  if (isFinite(x) && isFinite(y)) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = Math.abs(x - y);\n    if (diff <= DBL_EPSILON) {\n      return true;\n    } else {\n      // use relative error\n      return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;\n    }\n  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n  return signx ^ signy ? -x : x;\n}\nfunction _toNumberOrThrow(value, onError) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    onError();\n  }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}","import { pickShallow } from './object.js';\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n *     const name = 'log'\n *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n *       // ... create the function log here and return it\n *     }\n *\n * @param {string} name           Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create       Callback function called with an object with all dependencies\n * @param {Object} [meta]         Optional object with meta information that will be attached\n *                                to the created factory function as property `meta`.\n * @returns {function}\n */\nexport function factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n  return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true;\n      }\n    }\n    return false;\n  }\n  var sorted = [];\n  function addFactory(factory) {\n    var index = 0;\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n    sorted.splice(index, 0, factory);\n  }\n\n  // sort regular factory functions\n  factories.filter(isFactory).forEach(addFactory);\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\n  return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name   Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","import { hasOwnProperty } from './object.js';\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty(object, prop) {\n  // only allow getting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    return object[prop];\n  }\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty(object, prop, value) {\n  // only allow setting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    object[prop] = value;\n    return value;\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\nfunction getSafeProperties(object) {\n  return Object.keys(object).filter(prop => hasOwnProperty(object, prop));\n}\nfunction hasSafeProperty(object, prop) {\n  return prop in object;\n}\n\n/**\n * Test whether a property is safe to use for an object.\n * For example .toString and .constructor are not safe\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n  if (!object || typeof object !== 'object') {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (prop in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (prop in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n  return object[method];\n}\n\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\n  }\n  // UNSAFE: ghosted\n  // e.g overridden toString\n  // Note that IE10 doesn't support __proto__ and we can't do this check there.\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (method in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (method in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { hasSafeProperty };\nexport { getSafeProperties };\nexport { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { setSafeProperty, hasSafeProperty, getSafeProperty } from './customs.js';\nimport { isObject } from './is.js';\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n  constructor(object) {\n    this.wrappedObject = object;\n    this[Symbol.iterator] = this.entries;\n  }\n  keys() {\n    return Object.keys(this.wrappedObject).values();\n  }\n  get(key) {\n    return getSafeProperty(this.wrappedObject, key);\n  }\n  set(key, value) {\n    setSafeProperty(this.wrappedObject, key, value);\n    return this;\n  }\n  has(key) {\n    return hasSafeProperty(this.wrappedObject, key);\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    delete this.wrappedObject[key];\n  }\n  clear() {\n    for (var key of this.keys()) {\n      this.delete(key);\n    }\n  }\n  get size() {\n    return Object.keys(this.wrappedObject).length;\n  }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n *   const a = new Map()\n *   const b = new Map()\n *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n  /**\n   * @param {Map} a\n   * @param {Map} b\n   * @param {Set} bKeys\n   */\n  constructor(a, b, bKeys) {\n    this.a = a;\n    this.b = b;\n    this.bKeys = bKeys;\n    this[Symbol.iterator] = this.entries;\n  }\n  get(key) {\n    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n  }\n  set(key, value) {\n    if (this.bKeys.has(key)) {\n      this.b.set(key, value);\n    } else {\n      this.a.set(key, value);\n    }\n    return this;\n  }\n  has(key) {\n    return this.b.has(key) || this.a.has(key);\n  }\n  keys() {\n    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n  }\n  clear() {\n    this.a.clear();\n    this.b.clear();\n  }\n  get size() {\n    return [...this.keys()].length;\n  }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n  return {\n    next: () => {\n      var n = it.next();\n      return n.done ? n : {\n        value: callback(n.value),\n        done: false\n      };\n    }\n  };\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap() {\n  return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if (isObject(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject);\n  }\n  throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  for (var key of map.keys()) {\n    var value = map.get(key);\n    setSafeProperty(object, key, value);\n  }\n  return object;\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap(object) {\n  // We can use the fast instanceof, or a slower duck typing check.\n  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n  if (!object) {\n    return false;\n  }\n  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign(map) {\n  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    objects[_key - 1] = arguments[_key];\n  }\n  for (var args of objects) {\n    if (!args) {\n      continue;\n    }\n    if (isMap(args)) {\n      for (var key of args.keys()) {\n        map.set(key, args.get(key));\n      }\n    } else if (isObject(args)) {\n      for (var _key2 of Object.keys(args)) {\n        map.set(_key2, args[_key2]);\n      }\n    }\n  }\n  return map;\n}","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n *     math.typed(name, signatures) : function\n *     math.typed(signatures) : function\n *\n * Examples:\n *\n *     // create a typed function with multiple types per argument (type union)\n *     const fn2 = typed({\n *       'number | boolean': function (b) {\n *         return 'b is a number or boolean'\n *       },\n *       'string, number | boolean': function (a, b) {\n *         return 'a is a string, b is a number or boolean'\n *       }\n *     })\n *\n *     // create a typed function with an any type argument\n *     const log = typed({\n *       'string, any': function (event, data) {\n *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n *       }\n *     })\n *\n * @param {string} [name]                          Optional name for the typed-function\n * @param {Object<string, function>} signatures   Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRelationalNode, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport typedFunction from 'typed-function';\nimport { digits } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { isMap } from '../../utils/map.js';\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = typedFunction.create;\n  return typedFunction;\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  var typed = _createTyped2();\n\n  // define all types. The order of the types determines in which order function\n  // arguments are type-checked (so for performance it's important to put the\n  // most used types first).\n  typed.clear();\n  typed.addTypes([{\n    name: 'number',\n    test: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: isUnit\n  },\n  // The following type matches a valid variable name, i.e., an alphanumeric\n  // string starting with an alphabetic character. It is used (at least)\n  // in the definition of the derivative() function, as the argument telling\n  // what to differentiate over must (currently) be a variable.\n  {\n    name: 'identifier',\n    test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])*$/.test(s)\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'RelationalNode',\n    test: isRelationalNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Map',\n    test: isMap\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\n  ]);\n  typed.addConversions([{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      // note: conversion from number to BigNumber can fail if x has >15 digits\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.toNumber(), 0);\n    }\n  }, {\n    from: 'Fraction',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      var f = new Fraction(x);\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n      return f;\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      try {\n        return new BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      try {\n        return new Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      try {\n        return new Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }]);\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n  return typed;\n});\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","/*!\r\n *  decimal.js v10.6.0\r\n *  An arbitrary-precision Decimal type for JavaScript.\r\n *  https://github.com/MikeMcl/decimal.js\r\n *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *  MIT Licence\r\n */\r\n\r\n\r\n// -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n  // The maximum exponent magnitude.\r\n  // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\nvar EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n  // The limit on the value of `precision`, and on the value of the first argument to\r\n  // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n  // Base conversion alphabet.\r\n  NUMERALS = '0123456789abcdef',\r\n\r\n  // The natural logarithm of 10 (1025 digits).\r\n  LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n  // Pi (1025 digits).\r\n  PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n  // The initial configuration properties of the Decimal constructor.\r\n  DEFAULTS = {\r\n\r\n    // These values must be integers within the stated ranges (inclusive).\r\n    // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n    // The maximum number of significant digits of the result of a calculation or base conversion.\r\n    // E.g. `Decimal.config({ precision: 20 });`\r\n    precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n    // The rounding mode used when rounding to `precision`.\r\n    //\r\n    // ROUND_UP         0 Away from zero.\r\n    // ROUND_DOWN       1 Towards zero.\r\n    // ROUND_CEIL       2 Towards +Infinity.\r\n    // ROUND_FLOOR      3 Towards -Infinity.\r\n    // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n    // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n    // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n    // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n    // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n    //\r\n    // E.g.\r\n    // `Decimal.rounding = 4;`\r\n    // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n    rounding: 4,                           // 0 to 8\r\n\r\n    // The modulo mode used when calculating the modulus: a mod n.\r\n    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n    // The remainder (r) is calculated as: r = a - n * q.\r\n    //\r\n    // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n    // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n    // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n    // HALF_EVEN  6 The IEEE 754 remainder function.\r\n    // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n    //\r\n    // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n    // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n    // be used, but they may not give useful results.\r\n    modulo: 1,                             // 0 to 9\r\n\r\n    // The exponent value at and beneath which `toString` returns exponential notation.\r\n    // JavaScript numbers: -7\r\n    toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n    // The exponent value at and above which `toString` returns exponential notation.\r\n    // JavaScript numbers: 21\r\n    toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n    // The minimum exponent value, beneath which underflow to zero occurs.\r\n    // JavaScript numbers: -324  (5e-324)\r\n    minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n    // The maximum exponent value, above which overflow to Infinity occurs.\r\n    // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n    maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n    // Whether to use cryptographically-secure random number generation, if available.\r\n    crypto: false                          // true/false\r\n  },\r\n\r\n\r\n// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n  inexact, quadrant,\r\n  external = true,\r\n\r\n  decimalError = '[DecimalError] ',\r\n  invalidArgument = decimalError + 'Invalid argument: ',\r\n  precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n  cryptoUnavailable = decimalError + 'crypto unavailable',\r\n  tag = '[object Decimal]',\r\n\r\n  mathfloor = Math.floor,\r\n  mathpow = Math.pow,\r\n\r\n  isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n  isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n  isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n  isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n  BASE = 1e7,\r\n  LOG_BASE = 7,\r\n  MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n  LN10_PRECISION = LN10.length - 1,\r\n  PI_PRECISION = PI.length - 1,\r\n\r\n  // Decimal.prototype object\r\n  P = { toStringTag: tag };\r\n\r\n\r\n// Decimal prototype methods\r\n\r\n\r\n/*\r\n *  absoluteValue             abs\r\n *  ceil\r\n *  clampedTo                 clamp\r\n *  comparedTo                cmp\r\n *  cosine                    cos\r\n *  cubeRoot                  cbrt\r\n *  decimalPlaces             dp\r\n *  dividedBy                 div\r\n *  dividedToIntegerBy        divToInt\r\n *  equals                    eq\r\n *  floor\r\n *  greaterThan               gt\r\n *  greaterThanOrEqualTo      gte\r\n *  hyperbolicCosine          cosh\r\n *  hyperbolicSine            sinh\r\n *  hyperbolicTangent         tanh\r\n *  inverseCosine             acos\r\n *  inverseHyperbolicCosine   acosh\r\n *  inverseHyperbolicSine     asinh\r\n *  inverseHyperbolicTangent  atanh\r\n *  inverseSine               asin\r\n *  inverseTangent            atan\r\n *  isFinite\r\n *  isInteger                 isInt\r\n *  isNaN\r\n *  isNegative                isNeg\r\n *  isPositive                isPos\r\n *  isZero\r\n *  lessThan                  lt\r\n *  lessThanOrEqualTo         lte\r\n *  logarithm                 log\r\n *  [maximum]                 [max]\r\n *  [minimum]                 [min]\r\n *  minus                     sub\r\n *  modulo                    mod\r\n *  naturalExponential        exp\r\n *  naturalLogarithm          ln\r\n *  negated                   neg\r\n *  plus                      add\r\n *  precision                 sd\r\n *  round\r\n *  sine                      sin\r\n *  squareRoot                sqrt\r\n *  tangent                   tan\r\n *  times                     mul\r\n *  toBinary\r\n *  toDecimalPlaces           toDP\r\n *  toExponential\r\n *  toFixed\r\n *  toFraction\r\n *  toHexadecimal             toHex\r\n *  toNearest\r\n *  toNumber\r\n *  toOctal\r\n *  toPower                   pow\r\n *  toPrecision\r\n *  toSignificantDigits       toSD\r\n *  toString\r\n *  truncated                 trunc\r\n *  valueOf                   toJSON\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n *\r\n */\r\nP.absoluteValue = P.abs = function () {\r\n  var x = new this.constructor(this);\r\n  if (x.s < 0) x.s = 1;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n *\r\n */\r\nP.ceil = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n *\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nP.clampedTo = P.clamp = function (min, max) {\r\n  var k,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n  min = new Ctor(min);\r\n  max = new Ctor(max);\r\n  if (!min.s || !max.s) return new Ctor(NaN);\r\n  if (min.gt(max)) throw Error(invalidArgument + max);\r\n  k = x.cmp(min);\r\n  return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n};\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if the value of this Decimal is greater than the value of `y`,\r\n *  -1    if the value of this Decimal is less than the value of `y`,\r\n *   0    if they have the same value,\r\n *   NaN  if the value of either Decimal is NaN.\r\n *\r\n */\r\nP.comparedTo = P.cmp = function (y) {\r\n  var i, j, xdL, ydL,\r\n    x = this,\r\n    xd = x.d,\r\n    yd = (y = new x.constructor(y)).d,\r\n    xs = x.s,\r\n    ys = y.s;\r\n\r\n  // Either NaN or ±Infinity?\r\n  if (!xd || !yd) {\r\n    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Either zero?\r\n  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n  // Signs differ?\r\n  if (xs !== ys) return xs;\r\n\r\n  // Compare exponents.\r\n  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Compare lengths.\r\n  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * cos(0)         = 1\r\n * cos(-0)        = 1\r\n * cos(Infinity)  = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN)       = NaN\r\n *\r\n */\r\nP.cosine = P.cos = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.d) return new Ctor(NaN);\r\n\r\n  // cos(0) = cos(-0) = 1\r\n  if (!x.d[0]) return new Ctor(1);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *\r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n *  cbrt(0)  =  0\r\n *  cbrt(-0) = -0\r\n *  cbrt(1)  =  1\r\n *  cbrt(-1) = -1\r\n *  cbrt(N)  =  N\r\n *  cbrt(-I) = -I\r\n *  cbrt(I)  =  I\r\n *\r\n * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n *\r\n */\r\nP.cubeRoot = P.cbrt = function () {\r\n  var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n   // Math.cbrt underflow/overflow?\r\n   // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n  if (!s || Math.abs(s) == 1 / 0) {\r\n    n = digitsToString(x.d);\r\n    e = x.e;\r\n\r\n    // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n    if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n    s = mathpow(n, 1 / 3);\r\n\r\n    // Rarely, e may be one less than the result exponent value.\r\n    e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n    r.s = x.s;\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Halley's method.\r\n  // TODO? Compare Newton's method.\r\n  for (;;) {\r\n    t = r;\r\n    t3 = t.times(t).times(t);\r\n    t3plusx = t3.plus(x);\r\n    r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n      // , i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return the number of decimal places of the value of this Decimal.\r\n *\r\n */\r\nP.decimalPlaces = P.dp = function () {\r\n  var w,\r\n    d = this.d,\r\n    n = NaN;\r\n\r\n  if (d) {\r\n    w = d.length - 1;\r\n    n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) n--;\r\n    if (n < 0) n = 0;\r\n  }\r\n\r\n  return n;\r\n};\r\n\r\n\r\n/*\r\n *  n / 0 = I\r\n *  n / N = N\r\n *  n / I = 0\r\n *  0 / n = 0\r\n *  0 / 0 = N\r\n *  0 / N = N\r\n *  0 / I = 0\r\n *  N / n = N\r\n *  N / 0 = N\r\n *  N / N = N\r\n *  N / I = N\r\n *  I / n = I\r\n *  I / 0 = I\r\n *  I / N = N\r\n *  I / I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedBy = P.div = function (y) {\r\n  return divide(this, new this.constructor(y));\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedToIntegerBy = P.divToInt = function (y) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n  return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n *\r\n */\r\nP.equals = P.eq = function (y) {\r\n  return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n *\r\n */\r\nP.floor = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 3);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n *\r\n */\r\nP.greaterThan = P.gt = function (y) {\r\n  return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n *\r\n */\r\nP.greaterThanOrEqualTo = P.gte = function (y) {\r\n  var k = this.cmp(y);\r\n  return k == 1 || k === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n *\r\n * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n *\r\n * cosh(0)         = 1\r\n * cosh(-0)        = 1\r\n * cosh(Infinity)  = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN)       = NaN\r\n *\r\n *  x        time taken (ms)   result\r\n * 1000      9                 9.8503555700852349694e+433\r\n * 10000     25                4.4034091128314607936e+4342\r\n * 100000    171               1.4033316802130615897e+43429\r\n * 1000000   3817              1.5166076984010437725e+434294\r\n * 10000000  abandoned after 2 minute wait\r\n *\r\n * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n *\r\n */\r\nP.hyperbolicCosine = P.cosh = function () {\r\n  var k, n, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    one = new Ctor(1);\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n  if (x.isZero()) return one;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n  // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  // TODO? Estimation reused from cosine() and may not be optimal here.\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    n = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    n = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n  // Reverse argument reduction\r\n  var cosh2_x,\r\n    i = k,\r\n    d8 = new Ctor(8);\r\n  for (; i--;) {\r\n    cosh2_x = x.times(x);\r\n    x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n  }\r\n\r\n  return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n *\r\n * sinh(0)         = 0\r\n * sinh(-0)        = -0\r\n * sinh(Infinity)  = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN)       = NaN\r\n *\r\n * x        time taken (ms)\r\n * 10       2 ms\r\n * 100      5 ms\r\n * 1000     14 ms\r\n * 10000    82 ms\r\n * 100000   886 ms            1.4033316802130615897e+43429\r\n * 200000   2613 ms\r\n * 300000   5407 ms\r\n * 400000   8824 ms\r\n * 500000   13026 ms          8.7080643612718084129e+217146\r\n * 1000000  48543 ms\r\n *\r\n * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n *\r\n */\r\nP.hyperbolicSine = P.sinh = function () {\r\n  var k, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n  } else {\r\n\r\n    // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n    // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n    // 3 multiplications and 1 addition\r\n\r\n    // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n    // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n    // 4 multiplications and 2 additions\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n    // Reverse argument reduction\r\n    var sinh2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sinh2_x = x.times(x);\r\n      x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n    }\r\n  }\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * tanh(x) = sinh(x) / cosh(x)\r\n *\r\n * tanh(0)         = 0\r\n * tanh(-0)        = -0\r\n * tanh(Infinity)  = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN)       = NaN\r\n *\r\n */\r\nP.hyperbolicTangent = P.tanh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 7;\r\n  Ctor.rounding = 1;\r\n\r\n  return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [0, pi]\r\n *\r\n * acos(x) = pi/2 - asin(x)\r\n *\r\n * acos(0)       = pi/2\r\n * acos(-0)      = pi/2\r\n * acos(1)       = 0\r\n * acos(-1)      = pi\r\n * acos(1/2)     = pi/3\r\n * acos(-1/2)    = 2*pi/3\r\n * acos(|x| > 1) = NaN\r\n * acos(NaN)     = NaN\r\n *\r\n */\r\nP.inverseCosine = P.acos = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    k = x.abs().cmp(1),\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n    return k === 0\r\n      // |x| is 1\r\n      ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n      // |x| > 1 or x is NaN\r\n      : new Ctor(NaN);\r\n  }\r\n\r\n  if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n  // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  // See https://github.com/MikeMcl/decimal.js/pull/217\r\n  x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n *\r\n * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n *\r\n * acosh(x < 1)     = NaN\r\n * acosh(NaN)       = NaN\r\n * acosh(Infinity)  = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0)         = NaN\r\n * acosh(-0)        = NaN\r\n * acosh(1)         = 0\r\n * acosh(-1)        = NaN\r\n *\r\n */\r\nP.inverseHyperbolicCosine = P.acosh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n  if (!x.isFinite()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n *\r\n * asinh(NaN)       = NaN\r\n * asinh(Infinity)  = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0)         = 0\r\n * asinh(-0)        = -0\r\n *\r\n */\r\nP.inverseHyperbolicSine = P.asinh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n *\r\n * atanh(|x| > 1)   = NaN\r\n * atanh(NaN)       = NaN\r\n * atanh(Infinity)  = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0)         = 0\r\n * atanh(-0)        = -0\r\n * atanh(1)         = Infinity\r\n * atanh(-1)        = -Infinity\r\n *\r\n */\r\nP.inverseHyperbolicTangent = P.atanh = function () {\r\n  var pr, rm, wpr, xsd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  xsd = x.sd();\r\n\r\n  if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n  Ctor.precision = wpr = xsd - x.e;\r\n\r\n  x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n  Ctor.precision = pr + 4;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.ln();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(0.5);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n *\r\n * asin(0)       = 0\r\n * asin(-0)      = -0\r\n * asin(1/2)     = pi/6\r\n * asin(-1/2)    = -pi/6\r\n * asin(1)       = pi/2\r\n * asin(-1)      = -pi/2\r\n * asin(|x| > 1) = NaN\r\n * asin(NaN)     = NaN\r\n *\r\n * TODO? Compare performance of Taylor series.\r\n *\r\n */\r\nP.inverseSine = P.asin = function () {\r\n  var halfPi, k,\r\n    pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  k = x.abs().cmp(1);\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n\r\n    // |x| is 1\r\n    if (k === 0) {\r\n      halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      halfPi.s = x.s;\r\n      return halfPi;\r\n    }\r\n\r\n    // |x| > 1 or x is NaN\r\n    return new Ctor(NaN);\r\n  }\r\n\r\n  // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n *\r\n * atan(0)         = 0\r\n * atan(-0)        = -0\r\n * atan(1)         = pi/4\r\n * atan(-1)        = -pi/4\r\n * atan(Infinity)  = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN)       = NaN\r\n *\r\n */\r\nP.inverseTangent = P.atan = function () {\r\n  var i, j, k, n, px, t, r, wpr, x2,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (!x.isFinite()) {\r\n    if (!x.s) return new Ctor(NaN);\r\n    if (pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n  } else if (x.isZero()) {\r\n    return new Ctor(x);\r\n  } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n    r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n    r.s = x.s;\r\n    return r;\r\n  }\r\n\r\n  Ctor.precision = wpr = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n  // Argument reduction\r\n  // Ensure |x| < 0.42\r\n  // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n  k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n  for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n  external = false;\r\n\r\n  j = Math.ceil(wpr / LOG_BASE);\r\n  n = 1;\r\n  x2 = x.times(x);\r\n  r = new Ctor(x);\r\n  px = x;\r\n\r\n  // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n  for (; i !== -1;) {\r\n    px = px.times(x2);\r\n    t = r.minus(px.div(n += 2));\r\n\r\n    px = px.times(x2);\r\n    r = t.plus(px.div(n += 2));\r\n\r\n    if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n  }\r\n\r\n  if (k) r = r.times(2 << (k - 1));\r\n\r\n  external = true;\r\n\r\n  return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n *\r\n */\r\nP.isFinite = function () {\r\n  return !!this.d;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is an integer, otherwise return false.\r\n *\r\n */\r\nP.isInteger = P.isInt = function () {\r\n  return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is NaN, otherwise return false.\r\n *\r\n */\r\nP.isNaN = function () {\r\n  return !this.s;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is negative, otherwise return false.\r\n *\r\n */\r\nP.isNegative = P.isNeg = function () {\r\n  return this.s < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is positive, otherwise return false.\r\n *\r\n */\r\nP.isPositive = P.isPos = function () {\r\n  return this.s > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n *\r\n */\r\nP.isZero = function () {\r\n  return !!this.d && this.d[0] === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThan = P.lt = function (y) {\r\n  return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThanOrEqualTo = P.lte = function (y) {\r\n  return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/*\r\n * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * If no base is specified, return log[10](arg).\r\n *\r\n * log[base](arg) = ln(arg) / ln(base)\r\n *\r\n * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n *\r\n * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n *\r\n * log[-b](a)       = NaN\r\n * log[0](a)        = NaN\r\n * log[1](a)        = NaN\r\n * log[NaN](a)      = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0)        = -Infinity\r\n * log[b](-0)       = -Infinity\r\n * log[b](-a)       = NaN\r\n * log[b](1)        = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN)      = NaN\r\n *\r\n * [base] {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nP.logarithm = P.log = function (base) {\r\n  var isBase10, d, denominator, k, inf, num, sd, r,\r\n    arg = this,\r\n    Ctor = arg.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding,\r\n    guard = 5;\r\n\r\n  // Default base is 10.\r\n  if (base == null) {\r\n    base = new Ctor(10);\r\n    isBase10 = true;\r\n  } else {\r\n    base = new Ctor(base);\r\n    d = base.d;\r\n\r\n    // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n    if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n    isBase10 = base.eq(10);\r\n  }\r\n\r\n  d = arg.d;\r\n\r\n  // Is arg negative, non-finite, 0 or 1?\r\n  if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n    return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n  }\r\n\r\n  // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n  // integer power of 10.\r\n  if (isBase10) {\r\n    if (d.length > 1) {\r\n      inf = true;\r\n    } else {\r\n      for (k = d[0]; k % 10 === 0;) k /= 10;\r\n      inf = k !== 1;\r\n    }\r\n  }\r\n\r\n  external = false;\r\n  sd = pr + guard;\r\n  num = naturalLogarithm(arg, sd);\r\n  denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n  // The result will have 5 rounding digits.\r\n  r = divide(num, denominator, sd, 1);\r\n\r\n  // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n  // calculate 10 further digits.\r\n  //\r\n  // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n  // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n  // further digits, the last 14 are nines, round up and assume the result is exact.\r\n  // Also assume the result is exact if the last 14 are zero.\r\n  //\r\n  // Example of a result that will be incorrectly rounded:\r\n  // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n  // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n  // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n  // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n  // place is still 2.6.\r\n  if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n    do {\r\n      sd += 10;\r\n      num = naturalLogarithm(arg, sd);\r\n      denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n      r = divide(num, denominator, sd, 1);\r\n\r\n      if (!inf) {\r\n\r\n        // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n        if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n\r\n        break;\r\n      }\r\n    } while (checkRoundingDigits(r.d, k += 10, rm));\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.max = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, -1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.min = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, 1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n *  n - 0 = n\r\n *  n - N = N\r\n *  n - I = -I\r\n *  0 - n = -n\r\n *  0 - 0 = 0\r\n *  0 - N = N\r\n *  0 - I = -I\r\n *  N - n = N\r\n *  N - 0 = N\r\n *  N - N = N\r\n *  N - I = N\r\n *  I - n = I\r\n *  I - 0 = I\r\n *  I - N = N\r\n *  I - I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.minus = P.sub = function (y) {\r\n  var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return y negated if x is finite and y is ±Infinity.\r\n    else if (x.d) y.s = -y.s;\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with different signs.\r\n    // Return NaN if both are ±Infinity with the same sign.\r\n    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n  // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.plus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return y negated if x is zero and y is non-zero.\r\n    if (yd[0]) y.s = -y.s;\r\n\r\n    // Return x if y is zero and x is non-zero.\r\n    else if (xd[0]) y = new Ctor(x);\r\n\r\n    // Return zero if both are zero.\r\n    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n    else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  e = mathfloor(y.e / LOG_BASE);\r\n  xe = mathfloor(x.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  k = xe - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (k) {\r\n    xLTy = k < 0;\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      k = -k;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = xe;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Numbers with massively different exponents would result in a very high number of\r\n    // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n    if (k > i) {\r\n      k = i;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    d.reverse();\r\n    for (i = k; i--;) d.push(0);\r\n    d.reverse();\r\n\r\n  // Base 1e7 exponents equal.\r\n  } else {\r\n\r\n    // Check digits to determine which is the bigger number.\r\n\r\n    i = xd.length;\r\n    len = yd.length;\r\n    xLTy = i < len;\r\n    if (xLTy) len = i;\r\n\r\n    for (i = 0; i < len; i++) {\r\n      if (xd[i] != yd[i]) {\r\n        xLTy = xd[i] < yd[i];\r\n        break;\r\n      }\r\n    }\r\n\r\n    k = 0;\r\n  }\r\n\r\n  if (xLTy) {\r\n    d = xd;\r\n    xd = yd;\r\n    yd = d;\r\n    y.s = -y.s;\r\n  }\r\n\r\n  len = xd.length;\r\n\r\n  // Append zeros to `xd` if shorter.\r\n  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n  // Subtract yd from xd.\r\n  for (i = yd.length; i > k;) {\r\n\r\n    if (xd[--i] < yd[i]) {\r\n      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n      --xd[j];\r\n      xd[i] += BASE;\r\n    }\r\n\r\n    xd[i] -= yd[i];\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; xd[--len] === 0;) xd.pop();\r\n\r\n  // Remove leading zeros and adjust exponent accordingly.\r\n  for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n  // Zero?\r\n  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n *   n % 0 =  N\r\n *   n % N =  N\r\n *   n % I =  n\r\n *   0 % n =  0\r\n *  -0 % n = -0\r\n *   0 % 0 =  N\r\n *   0 % N =  N\r\n *   0 % I =  0\r\n *   N % n =  N\r\n *   N % 0 =  N\r\n *   N % N =  N\r\n *   N % I =  N\r\n *   I % n =  N\r\n *   I % 0 =  N\r\n *   I % N =  N\r\n *   I % I =  N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * The result depends on the modulo mode.\r\n *\r\n */\r\nP.modulo = P.mod = function (y) {\r\n  var q,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n  // Return x if y is ±Infinity or x is ±0.\r\n  if (!y.d || x.d && !x.d[0]) {\r\n    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n  }\r\n\r\n  // Prevent rounding of intermediate calculations.\r\n  external = false;\r\n\r\n  if (Ctor.modulo == 9) {\r\n\r\n    // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n    // result = x - q * y    where  0 <= result < abs(y)\r\n    q = divide(x, y.abs(), 0, 3, 1);\r\n    q.s *= y.s;\r\n  } else {\r\n    q = divide(x, y, 0, Ctor.modulo, 1);\r\n  }\r\n\r\n  q = q.times(y);\r\n\r\n  external = true;\r\n\r\n  return x.minus(q);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalExponential = P.exp = function () {\r\n  return naturalExponential(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalLogarithm = P.ln = function () {\r\n  return naturalLogarithm(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n *\r\n */\r\nP.negated = P.neg = function () {\r\n  var x = new this.constructor(this);\r\n  x.s = -x.s;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n *  n + 0 = n\r\n *  n + N = N\r\n *  n + I = I\r\n *  0 + n = n\r\n *  0 + 0 = 0\r\n *  0 + N = N\r\n *  0 + I = I\r\n *  N + n = N\r\n *  N + 0 = N\r\n *  N + N = N\r\n *  N + I = N\r\n *  I + n = I\r\n *  I + 0 = I\r\n *  I + N = N\r\n *  I + I = I\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.plus = P.add = function (y) {\r\n  var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with the same sign.\r\n    // Return NaN if both are ±Infinity with different signs.\r\n    // Return y if x is finite and y is ±Infinity.\r\n    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n   // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.minus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return x if y is zero.\r\n    // Return y if y is non-zero.\r\n    if (!yd[0]) y = new Ctor(x);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  k = mathfloor(x.e / LOG_BASE);\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  i = k - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (i) {\r\n\r\n    if (i < 0) {\r\n      d = xd;\r\n      i = -i;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = k;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n    k = Math.ceil(pr / LOG_BASE);\r\n    len = k > len ? k + 1 : len + 1;\r\n\r\n    if (i > len) {\r\n      i = len;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n    d.reverse();\r\n    for (; i--;) d.push(0);\r\n    d.reverse();\r\n  }\r\n\r\n  len = xd.length;\r\n  i = yd.length;\r\n\r\n  // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n  if (len - i < 0) {\r\n    i = len;\r\n    d = yd;\r\n    yd = xd;\r\n    xd = d;\r\n  }\r\n\r\n  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n  for (carry = 0; i;) {\r\n    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n    xd[i] %= BASE;\r\n  }\r\n\r\n  if (carry) {\r\n    xd.unshift(carry);\r\n    ++e;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n  for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return the number of significant digits of the value of this Decimal.\r\n *\r\n * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n *\r\n */\r\nP.precision = P.sd = function (z) {\r\n  var k,\r\n    x = this;\r\n\r\n  if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n  if (x.d) {\r\n    k = getPrecision(x.d);\r\n    if (z && x.e + 1 > k) k = x.e + 1;\r\n  } else {\r\n    k = NaN;\r\n  }\r\n\r\n  return k;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n *\r\n */\r\nP.round = function () {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n *\r\n * sin(0)         = 0\r\n * sin(-0)        = -0\r\n * sin(Infinity)  = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN)       = NaN\r\n *\r\n */\r\nP.sine = P.sin = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n *  sqrt(-n) =  N\r\n *  sqrt(N)  =  N\r\n *  sqrt(-I) =  N\r\n *  sqrt(I)  =  I\r\n *  sqrt(0)  =  0\r\n *  sqrt(-0) = -0\r\n *\r\n */\r\nP.squareRoot = P.sqrt = function () {\r\n  var m, n, sd, r, rep, t,\r\n    x = this,\r\n    d = x.d,\r\n    e = x.e,\r\n    s = x.s,\r\n    Ctor = x.constructor;\r\n\r\n  // Negative/NaN/Infinity/zero?\r\n  if (s !== 1 || !d || !d[0]) {\r\n    return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n  }\r\n\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = Math.sqrt(+x);\r\n\r\n  // Math.sqrt underflow/overflow?\r\n  // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n  if (s == 0 || s == 1 / 0) {\r\n    n = digitsToString(d);\r\n\r\n    if ((n.length + e) % 2 == 0) n += '0';\r\n    s = Math.sqrt(n);\r\n    e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Newton-Raphson iteration.\r\n  for (;;) {\r\n    t = r;\r\n    r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n      // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * tan(0)         = 0\r\n * tan(-0)        = -0\r\n * tan(Infinity)  = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN)       = NaN\r\n *\r\n */\r\nP.tangent = P.tan = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.sin();\r\n  x.s = 1;\r\n  x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *  n * 0 = 0\r\n *  n * N = N\r\n *  n * I = I\r\n *  0 * n = 0\r\n *  0 * 0 = 0\r\n *  0 * N = N\r\n *  0 * I = N\r\n *  N * n = N\r\n *  N * 0 = N\r\n *  N * N = N\r\n *  N * I = N\r\n *  I * n = I\r\n *  I * 0 = N\r\n *  I * N = N\r\n *  I * I = I\r\n *\r\n * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.times = P.mul = function (y) {\r\n  var carry, e, i, k, r, rL, t, xdL, ydL,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    xd = x.d,\r\n    yd = (y = new Ctor(y)).d;\r\n\r\n  y.s *= x.s;\r\n\r\n   // If either is NaN, ±Infinity or ±0...\r\n  if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n      // Return NaN if either is NaN.\r\n      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n      ? NaN\r\n\r\n      // Return ±Infinity if either is ±Infinity.\r\n      // Return ±0 if either is ±0.\r\n      : !xd || !yd ? y.s / 0 : y.s * 0);\r\n  }\r\n\r\n  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Ensure xd points to the longer array.\r\n  if (xdL < ydL) {\r\n    r = xd;\r\n    xd = yd;\r\n    yd = r;\r\n    rL = xdL;\r\n    xdL = ydL;\r\n    ydL = rL;\r\n  }\r\n\r\n  // Initialise the result array with zeros.\r\n  r = [];\r\n  rL = xdL + ydL;\r\n  for (i = rL; i--;) r.push(0);\r\n\r\n  // Multiply!\r\n  for (i = ydL; --i >= 0;) {\r\n    carry = 0;\r\n    for (k = xdL + i; k > i;) {\r\n      t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n      r[k--] = t % BASE | 0;\r\n      carry = t / BASE | 0;\r\n    }\r\n\r\n    r[k] = (r[k] + carry) % BASE | 0;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; !r[--rL];) r.pop();\r\n\r\n  if (carry) ++e;\r\n  else r.shift();\r\n\r\n  y.d = r;\r\n  y.e = getBase10Exponent(r, e);\r\n\r\n  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toBinary = function (sd, rm) {\r\n  return toStringBinary(this, 2, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n *\r\n * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n  if (dp === void 0) return x;\r\n\r\n  checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n  if (rm === void 0) rm = Ctor.rounding;\r\n  else checkInt32(rm, 0, 8);\r\n\r\n  return finalise(x, dp + x.e + 1, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toExponential = function (dp, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x, true);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), dp + 1, rm);\r\n    str = finiteToString(x, true, dp + 1);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n *\r\n * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n *\r\n */\r\nP.toFixed = function (dp, rm) {\r\n  var str, y,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n    str = finiteToString(y, false, dp + y.e + 1);\r\n  }\r\n\r\n  // To determine whether to add the minus sign look at the value before it was rounded,\r\n  // i.e. look at `x` rather than `y`.\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n *\r\n * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n *\r\n * [maxD] {number|string|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n *\r\n */\r\nP.toFraction = function (maxD) {\r\n  var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n    x = this,\r\n    xd = x.d,\r\n    Ctor = x.constructor;\r\n\r\n  if (!xd) return new Ctor(x);\r\n\r\n  n1 = d0 = new Ctor(1);\r\n  d1 = n0 = new Ctor(0);\r\n\r\n  d = new Ctor(d1);\r\n  e = d.e = getPrecision(xd) - x.e - 1;\r\n  k = e % LOG_BASE;\r\n  d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n  if (maxD == null) {\r\n\r\n    // d is 10**e, the minimum max-denominator needed.\r\n    maxD = e > 0 ? d : n1;\r\n  } else {\r\n    n = new Ctor(maxD);\r\n    if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n    maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n  }\r\n\r\n  external = false;\r\n  n = new Ctor(digitsToString(xd));\r\n  pr = Ctor.precision;\r\n  Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n  for (;;)  {\r\n    q = divide(n, d, 0, 1, 1);\r\n    d2 = d0.plus(q.times(d1));\r\n    if (d2.cmp(maxD) == 1) break;\r\n    d0 = d1;\r\n    d1 = d2;\r\n    d2 = n1;\r\n    n1 = n0.plus(q.times(d2));\r\n    n0 = d2;\r\n    d2 = d;\r\n    d = n.minus(q.times(d2));\r\n    n = d2;\r\n  }\r\n\r\n  d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n  n0 = n0.plus(d2.times(n1));\r\n  d0 = d0.plus(d2.times(d1));\r\n  n0.s = n1.s = x.s;\r\n\r\n  // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n  r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n      ? [n1, d1] : [n0, d0];\r\n\r\n  Ctor.precision = pr;\r\n  external = true;\r\n\r\n  return r;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toHexadecimal = P.toHex = function (sd, rm) {\r\n  return toStringBinary(this, 16, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n *\r\n * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n *\r\n * The return value is not affected by the value of `precision`.\r\n *\r\n * y {number|string|bigint|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toNearest = function (y, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (y == null) {\r\n\r\n    // If x is not finite, return x.\r\n    if (!x.d) return x;\r\n\r\n    y = new Ctor(1);\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    y = new Ctor(y);\r\n    if (rm === void 0) {\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    // If x is not finite, return x if y is not NaN, else NaN.\r\n    if (!x.d) return y.s ? x : y;\r\n\r\n    // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n    if (!y.d) {\r\n      if (y.s) y.s = x.s;\r\n      return y;\r\n    }\r\n  }\r\n\r\n  // If y is not zero, calculate the nearest multiple of y to x.\r\n  if (y.d[0]) {\r\n    external = false;\r\n    x = divide(x, y, 0, rm, 1).times(y);\r\n    external = true;\r\n    finalise(x);\r\n\r\n  // If y is zero, return zero with the sign of x.\r\n  } else {\r\n    y.s = x.s;\r\n    x = y;\r\n  }\r\n\r\n  return x;\r\n};\r\n\r\n\r\n/*\r\n * Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n *\r\n */\r\nP.toNumber = function () {\r\n  return +this;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toOctal = function (sd, rm) {\r\n  return toStringBinary(this, 8, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * ECMAScript compliant.\r\n *\r\n *   pow(x, NaN)                           = NaN\r\n *   pow(x, ±0)                            = 1\r\n\r\n *   pow(NaN, non-zero)                    = NaN\r\n *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n *   pow(abs(x) > 1, -Infinity)            = +0\r\n *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n *   pow(abs(x) < 1, +Infinity)            = +0\r\n *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n *   pow(+Infinity, y > 0)                 = +Infinity\r\n *   pow(+Infinity, y < 0)                 = +0\r\n *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n *   pow(-Infinity, even integer > 0)      = +Infinity\r\n *   pow(-Infinity, odd integer < 0)       = -0\r\n *   pow(-Infinity, even integer < 0)      = +0\r\n *   pow(+0, y > 0)                        = +0\r\n *   pow(+0, y < 0)                        = +Infinity\r\n *   pow(-0, odd integer > 0)              = -0\r\n *   pow(-0, even integer > 0)             = +0\r\n *   pow(-0, odd integer < 0)              = -Infinity\r\n *   pow(-0, even integer < 0)             = +Infinity\r\n *   pow(finite x < 0, finite non-integer) = NaN\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n *   x^y = exp(y*ln(x))\r\n *\r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n *\r\n * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n *\r\n * y {number|string|bigint|Decimal} The power to which to raise this Decimal.\r\n *\r\n */\r\nP.toPower = P.pow = function (y) {\r\n  var e, k, pr, r, rm, s,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    yn = +(y = new Ctor(y));\r\n\r\n  // Either ±Infinity, NaN or ±0?\r\n  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (x.eq(1)) return x;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n  // y exponent\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n    r = intPow(Ctor, x, k, pr);\r\n    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n  }\r\n\r\n  s = x.s;\r\n\r\n  // if x is negative\r\n  if (s < 0) {\r\n\r\n    // if y is not an integer\r\n    if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n    // Result is positive if x is negative and the last digit of integer y is even.\r\n    if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n    // if x.eq(-1)\r\n    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n      x.s = s;\r\n      return x;\r\n    }\r\n  }\r\n\r\n  // Estimate result exponent.\r\n  // x^y = 10^e,  where e = y * log10(x)\r\n  // log10(x) = log10(x_significand) + x_exponent\r\n  // log10(x_significand) = ln(x_significand) / ln(10)\r\n  k = mathpow(+x, yn);\r\n  e = k == 0 || !isFinite(k)\r\n    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n    : new Ctor(k + '').e;\r\n\r\n  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n  // Overflow/underflow?\r\n  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n  external = false;\r\n  Ctor.rounding = x.s = 1;\r\n\r\n  // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n  // new Decimal(2.32456).pow('2087987436534566.46411')\r\n  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n  k = Math.min(12, (e + '').length);\r\n\r\n  // r = x^y = exp(y*ln(x))\r\n  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n  if (r.d) {\r\n\r\n    // Truncate to the required precision plus five rounding digits.\r\n    r = finalise(r, pr + 5, 1);\r\n\r\n    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n    // the result.\r\n    if (checkRoundingDigits(r.d, pr, rm)) {\r\n      e = pr + 10;\r\n\r\n      // Truncate to the increased precision plus five rounding digits.\r\n      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n        r = finalise(r, pr + 1, 0);\r\n      }\r\n    }\r\n  }\r\n\r\n  r.s = s;\r\n  external = true;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toPrecision = function (sd, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), sd, rm);\r\n    str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toSignificantDigits = P.toSD = function (sd, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  }\r\n\r\n  return finalise(new Ctor(x), sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n *\r\n * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n *\r\n */\r\nP.toString = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n *\r\n */\r\nP.truncated = P.trunc = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 1);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n *\r\n */\r\nP.valueOf = P.toJSON = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() ? '-' + str : str;\r\n};\r\n\r\n\r\n// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n/*\r\n *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n *                           finiteToString, naturalExponential, naturalLogarithm\r\n *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n *  convertBase              toStringBinary, parseOther\r\n *  cos                      P.cos\r\n *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n *                           taylorSeries, atan2, parseOther\r\n *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n *                           naturalLogarithm, ceil, floor, round, trunc\r\n *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n *                           toStringBinary\r\n *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n *  getLn10                  P.logarithm, naturalLogarithm\r\n *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n *  getPrecision             P.precision, P.toFraction\r\n *  getZeroString            digitsToString, finiteToString\r\n *  intPow                   P.toPower, parseOther\r\n *  isOdd                    toLessThanHalfPi\r\n *  maxOrMin                 max, min\r\n *  naturalExponential       P.naturalExponential, P.toPower\r\n *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n *                           P.toPower, naturalExponential\r\n *  nonFiniteToString        finiteToString, toStringBinary\r\n *  parseDecimal             Decimal\r\n *  parseOther               Decimal\r\n *  sin                      P.sin\r\n *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n *  toLessThanHalfPi         P.cos, P.sin\r\n *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n *  truncate                 intPow\r\n *\r\n *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n *                           naturalLogarithm, config, parseOther, random, Decimal\r\n */\r\n\r\n\r\nfunction digitsToString(d) {\r\n  var i, k, ws,\r\n    indexOfLastWord = d.length - 1,\r\n    str = '',\r\n    w = d[0];\r\n\r\n  if (indexOfLastWord > 0) {\r\n    str += w;\r\n    for (i = 1; i < indexOfLastWord; i++) {\r\n      ws = d[i] + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n      str += ws;\r\n    }\r\n\r\n    w = d[i];\r\n    ws = w + '';\r\n    k = LOG_BASE - ws.length;\r\n    if (k) str += getZeroString(k);\r\n  } else if (w === 0) {\r\n    return '0';\r\n  }\r\n\r\n  // Remove trailing zeros of last w.\r\n  for (; w % 10 === 0;) w /= 10;\r\n\r\n  return str + w;\r\n}\r\n\r\n\r\nfunction checkInt32(i, min, max) {\r\n  if (i !== ~~i || i < min || i > max) {\r\n    throw Error(invalidArgument + i);\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n */\r\nfunction checkRoundingDigits(d, i, rm, repeating) {\r\n  var di, k, r, rd;\r\n\r\n  // Get the length of the first word of the array d.\r\n  for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n  // Is the rounding digit in the first word of d?\r\n  if (--i < 0) {\r\n    i += LOG_BASE;\r\n    di = 0;\r\n  } else {\r\n    di = Math.ceil((i + 1) / LOG_BASE);\r\n    i %= LOG_BASE;\r\n  }\r\n\r\n  // i is the index (0 - 6) of the rounding digit.\r\n  // E.g. if within the word 3487563 the first rounding digit is 5,\r\n  // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n  k = mathpow(10, LOG_BASE - i);\r\n  rd = d[di] % k | 0;\r\n\r\n  if (repeating == null) {\r\n    if (i < 3) {\r\n      if (i == 0) rd = rd / 100 | 0;\r\n      else if (i == 1) rd = rd / 10 | 0;\r\n      r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n    } else {\r\n      r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n          (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n    }\r\n  } else {\r\n    if (i < 4) {\r\n      if (i == 0) rd = rd / 1000 | 0;\r\n      else if (i == 1) rd = rd / 100 | 0;\r\n      else if (i == 2) rd = rd / 10 | 0;\r\n      r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n    } else {\r\n      r = ((repeating || rm < 4) && rd + 1 == k ||\r\n      (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n    }\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n// Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n// Eg. convertBase('255', 10, 16) returns [15, 15].\r\n// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\nfunction convertBase(str, baseIn, baseOut) {\r\n  var j,\r\n    arr = [0],\r\n    arrL,\r\n    i = 0,\r\n    strL = str.length;\r\n\r\n  for (; i < strL;) {\r\n    for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n    arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n    for (j = 0; j < arr.length; j++) {\r\n      if (arr[j] > baseOut - 1) {\r\n        if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n        arr[j + 1] += arr[j] / baseOut | 0;\r\n        arr[j] %= baseOut;\r\n      }\r\n    }\r\n  }\r\n\r\n  return arr.reverse();\r\n}\r\n\r\n\r\n/*\r\n * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction cosine(Ctor, x) {\r\n  var k, len, y;\r\n\r\n  if (x.isZero()) return x;\r\n\r\n  // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n  // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  len = x.d.length;\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    y = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    y = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  Ctor.precision += k;\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n  // Reverse argument reduction\r\n  for (var i = k; i--;) {\r\n    var cos2x = x.times(x);\r\n    x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n  }\r\n\r\n  Ctor.precision -= k;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Perform division in the specified base.\r\n */\r\nvar divide = (function () {\r\n\r\n  // Assumes non-zero x and k, and hence non-zero result.\r\n  function multiplyInteger(x, k, base) {\r\n    var temp,\r\n      carry = 0,\r\n      i = x.length;\r\n\r\n    for (x = x.slice(); i--;) {\r\n      temp = x[i] * k + carry;\r\n      x[i] = temp % base | 0;\r\n      carry = temp / base | 0;\r\n    }\r\n\r\n    if (carry) x.unshift(carry);\r\n\r\n    return x;\r\n  }\r\n\r\n  function compare(a, b, aL, bL) {\r\n    var i, r;\r\n\r\n    if (aL != bL) {\r\n      r = aL > bL ? 1 : -1;\r\n    } else {\r\n      for (i = r = 0; i < aL; i++) {\r\n        if (a[i] != b[i]) {\r\n          r = a[i] > b[i] ? 1 : -1;\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n  function subtract(a, b, aL, base) {\r\n    var i = 0;\r\n\r\n    // Subtract b from a.\r\n    for (; aL--;) {\r\n      a[aL] -= i;\r\n      i = a[aL] < b[aL] ? 1 : 0;\r\n      a[aL] = i * base + a[aL] - b[aL];\r\n    }\r\n\r\n    // Remove leading zeros.\r\n    for (; !a[0] && a.length > 1;) a.shift();\r\n  }\r\n\r\n  return function (x, y, pr, rm, dp, base) {\r\n    var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n      yL, yz,\r\n      Ctor = x.constructor,\r\n      sign = x.s == y.s ? 1 : -1,\r\n      xd = x.d,\r\n      yd = y.d;\r\n\r\n    // Either NaN, Infinity or 0?\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n        !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n        // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n    }\r\n\r\n    if (base) {\r\n      logBase = 1;\r\n      e = x.e - y.e;\r\n    } else {\r\n      base = BASE;\r\n      logBase = LOG_BASE;\r\n      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n    }\r\n\r\n    yL = yd.length;\r\n    xL = xd.length;\r\n    q = new Ctor(sign);\r\n    qd = q.d = [];\r\n\r\n    // Result exponent may be one less than e.\r\n    // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n    for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n    if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n    if (pr == null) {\r\n      sd = pr = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else if (dp) {\r\n      sd = pr + (x.e - y.e) + 1;\r\n    } else {\r\n      sd = pr;\r\n    }\r\n\r\n    if (sd < 0) {\r\n      qd.push(1);\r\n      more = true;\r\n    } else {\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / logBase + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * base + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n        more = k || i < xL;\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= base/2\r\n        k = base / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k, base);\r\n          xd = multiplyInteger(xd, k, base);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= base / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= base) k = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL, base);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n        more = rem[0] !== void 0;\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n    }\r\n\r\n    // logBase is 1 when divide is being used for base conversion.\r\n    if (logBase == 1) {\r\n      q.e = e;\r\n      inexact = more;\r\n    } else {\r\n\r\n      // To calculate q.e, first get the number of digits of qd[0].\r\n      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n      q.e = i + e * logBase - 1;\r\n\r\n      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n    }\r\n\r\n    return q;\r\n  };\r\n})();\r\n\r\n\r\n/*\r\n * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n */\r\n function finalise(x, sd, rm, isTruncated) {\r\n  var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n    Ctor = x.constructor;\r\n\r\n  // Don't round if sd is null or undefined.\r\n  out: if (sd != null) {\r\n    xd = x.d;\r\n\r\n    // Infinity/NaN.\r\n    if (!xd) return x;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd containing rd, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // digits: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n    i = sd - digits;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) {\r\n        if (isTruncated) {\r\n\r\n          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n          for (; k++ <= xdi;) xd.push(0);\r\n          w = rd = 0;\r\n          digits = 1;\r\n          i %= LOG_BASE;\r\n          j = i - LOG_BASE + 1;\r\n        } else {\r\n          break out;\r\n        }\r\n      } else {\r\n        w = k = xd[xdi];\r\n\r\n        // Get the number of digits of w.\r\n        for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n        // Get the index of rd within w.\r\n        i %= LOG_BASE;\r\n\r\n        // Get the index of rd within w, adjusted for leading zeros.\r\n        // The number of leading zeros of w is given by LOG_BASE - digits.\r\n        j = i - LOG_BASE + digits;\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      }\r\n    }\r\n\r\n    // Are there any non-zero digits after the rounding digit?\r\n    isTruncated = isTruncated || sd < 0 ||\r\n      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n    // will give 714.\r\n\r\n    roundUp = rm < 4\r\n      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n        // Check whether the digit to the left of the rounding digit is odd.\r\n        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n          rm == (x.s < 0 ? 8 : 7));\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      xd.length = 0;\r\n      if (roundUp) {\r\n\r\n        // Convert sd to decimal places.\r\n        sd -= x.e + 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = -sd || 0;\r\n      } else {\r\n\r\n        // Zero.\r\n        xd[0] = x.e = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (roundUp) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n\r\n          // i will be the length of xd[0] before k is added.\r\n          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n          j = xd[0] += k;\r\n          for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n          // if i != k the length has increased.\r\n          if (i != k) {\r\n            x.e++;\r\n            if (xd[0] == BASE) xd[0] = 1;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n  }\r\n\r\n  if (external) {\r\n\r\n    // Overflow?\r\n    if (x.e > Ctor.maxE) {\r\n\r\n      // Infinity.\r\n      x.d = null;\r\n      x.e = NaN;\r\n\r\n    // Underflow?\r\n    } else if (x.e < Ctor.minE) {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n      // Ctor.underflow = true;\r\n    } // else Ctor.underflow = false;\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\nfunction finiteToString(x, isExp, sd) {\r\n  if (!x.isFinite()) return nonFiniteToString(x);\r\n  var k,\r\n    e = x.e,\r\n    str = digitsToString(x.d),\r\n    len = str.length;\r\n\r\n  if (isExp) {\r\n    if (sd && (k = sd - len) > 0) {\r\n      str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n    } else if (len > 1) {\r\n      str = str.charAt(0) + '.' + str.slice(1);\r\n    }\r\n\r\n    str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n  } else if (e < 0) {\r\n    str = '0.' + getZeroString(-e - 1) + str;\r\n    if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n  } else if (e >= len) {\r\n    str += getZeroString(e + 1 - len);\r\n    if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n  } else {\r\n    if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n    if (sd && (k = sd - len) > 0) {\r\n      if (e + 1 === len) str += '.';\r\n      str += getZeroString(k);\r\n    }\r\n  }\r\n\r\n  return str;\r\n}\r\n\r\n\r\n// Calculate the base 10 exponent from the base 1e7 exponent.\r\nfunction getBase10Exponent(digits, e) {\r\n  var w = digits[0];\r\n\r\n  // Add the number of digits of the first word of the digits array.\r\n  for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n  return e;\r\n}\r\n\r\n\r\nfunction getLn10(Ctor, sd, pr) {\r\n  if (sd > LN10_PRECISION) {\r\n\r\n    // Reset global state in case the exception is caught.\r\n    external = true;\r\n    if (pr) Ctor.precision = pr;\r\n    throw Error(precisionLimitExceeded);\r\n  }\r\n  return finalise(new Ctor(LN10), sd, 1, true);\r\n}\r\n\r\n\r\nfunction getPi(Ctor, sd, rm) {\r\n  if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n  return finalise(new Ctor(PI), sd, rm, true);\r\n}\r\n\r\n\r\nfunction getPrecision(digits) {\r\n  var w = digits.length - 1,\r\n    len = w * LOG_BASE + 1;\r\n\r\n  w = digits[w];\r\n\r\n  // If non-zero...\r\n  if (w) {\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    for (; w % 10 == 0; w /= 10) len--;\r\n\r\n    // Add the number of digits of the first word.\r\n    for (w = digits[0]; w >= 10; w /= 10) len++;\r\n  }\r\n\r\n  return len;\r\n}\r\n\r\n\r\nfunction getZeroString(k) {\r\n  var zs = '';\r\n  for (; k--;) zs += '0';\r\n  return zs;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n *\r\n * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n *\r\n */\r\nfunction intPow(Ctor, x, n, pr) {\r\n  var isTruncated,\r\n    r = new Ctor(1),\r\n\r\n    // Max n of 9007199254740991 takes 53 loop iterations.\r\n    // Maximum digits array length; leaves [28, 34] guard digits.\r\n    k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n  external = false;\r\n\r\n  for (;;) {\r\n    if (n % 2) {\r\n      r = r.times(x);\r\n      if (truncate(r.d, k)) isTruncated = true;\r\n    }\r\n\r\n    n = mathfloor(n / 2);\r\n    if (n === 0) {\r\n\r\n      // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n      n = r.d.length - 1;\r\n      if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n      break;\r\n    }\r\n\r\n    x = x.times(x);\r\n    truncate(x.d, k);\r\n  }\r\n\r\n  external = true;\r\n\r\n  return r;\r\n}\r\n\r\n\r\nfunction isOdd(n) {\r\n  return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/*\r\n * Handle `max` (`n` is -1) and `min` (`n` is 1).\r\n */\r\nfunction maxOrMin(Ctor, args, n) {\r\n  var k, y,\r\n    x = new Ctor(args[0]),\r\n    i = 0;\r\n\r\n  for (; ++i < args.length;) {\r\n    y = new Ctor(args[i]);\r\n\r\n    // NaN?\r\n    if (!y.s) {\r\n      x = y;\r\n      break;\r\n    }\r\n\r\n    k = x.cmp(y);\r\n\r\n    if (k === n || k === 0 && x.s === n) {\r\n      x = y;\r\n    }\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n * Taylor/Maclaurin series.\r\n *\r\n * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n *\r\n * Argument reduction:\r\n *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n *   exp(x) = exp(x / 2^k)^(2^k)\r\n *\r\n * Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n *\r\n * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n *\r\n *  exp(Infinity)  = Infinity\r\n *  exp(-Infinity) = 0\r\n *  exp(NaN)       = NaN\r\n *  exp(±0)        = 1\r\n *\r\n *  exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n *  The result will always be correctly rounded.\r\n *\r\n */\r\nfunction naturalExponential(x, sd) {\r\n  var denominator, guard, j, pow, sum, t, wpr,\r\n    rep = 0,\r\n    i = 0,\r\n    k = 0,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // 0/NaN/Infinity?\r\n  if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n    return new Ctor(x.d\r\n      ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n      : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  t = new Ctor(0.03125);\r\n\r\n  // while abs(x) >= 0.1\r\n  while (x.e > -2) {\r\n\r\n    // x = x / 2^5\r\n    x = x.times(t);\r\n    k += 5;\r\n  }\r\n\r\n  // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n  // necessary to ensure the first 4 rounding digits are correct.\r\n  guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n  wpr += guard;\r\n  denominator = pow = sum = new Ctor(1);\r\n  Ctor.precision = wpr;\r\n\r\n  for (;;) {\r\n    pow = finalise(pow.times(x), wpr, 1);\r\n    denominator = denominator.times(++i);\r\n    t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      j = k;\r\n      while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n      // Check to see if the first 4 rounding digits are [49]999.\r\n      // If so, repeat the summation with a higher precision, otherwise\r\n      // e.g. with precision: 18, rounding: 1\r\n      // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n\r\n        if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += 10;\r\n          denominator = pow = t = new Ctor(1);\r\n          i = 0;\r\n          rep++;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n *  ln(-n)        = NaN\r\n *  ln(0)         = -Infinity\r\n *  ln(-0)        = -Infinity\r\n *  ln(1)         = 0\r\n *  ln(Infinity)  = Infinity\r\n *  ln(-Infinity) = NaN\r\n *  ln(NaN)       = NaN\r\n *\r\n *  ln(n) (n != 1) is non-terminating.\r\n *\r\n */\r\nfunction naturalLogarithm(y, sd) {\r\n  var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n    n = 1,\r\n    guard = 10,\r\n    x = y,\r\n    xd = x.d,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // Is x negative or Infinity, NaN, 0 or 1?\r\n  if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n    return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  Ctor.precision = wpr += guard;\r\n  c = digitsToString(xd);\r\n  c0 = c.charAt(0);\r\n\r\n  if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n    // Argument reduction.\r\n    // The series converges faster the closer the argument is to 1, so using\r\n    // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n    // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n    // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n    // later be divided by this number, then separate out the power of 10 using\r\n    // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n    // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n    //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n    // max n is 6 (gives 0.7 - 1.3)\r\n    while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n      x = x.times(y);\r\n      c = digitsToString(x.d);\r\n      c0 = c.charAt(0);\r\n      n++;\r\n    }\r\n\r\n    e = x.e;\r\n\r\n    if (c0 > 1) {\r\n      x = new Ctor('0.' + c);\r\n      e++;\r\n    } else {\r\n      x = new Ctor(c0 + '.' + c.slice(1));\r\n    }\r\n  } else {\r\n\r\n    // The argument reduction method above may result in overflow if the argument y is a massive\r\n    // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n    // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n    t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n    x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n    Ctor.precision = pr;\r\n\r\n    return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n  }\r\n\r\n  // x1 is x reduced to a value near 1.\r\n  x1 = x;\r\n\r\n  // Taylor series.\r\n  // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n  // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n  sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n  x2 = finalise(x.times(x), wpr, 1);\r\n  denominator = 3;\r\n\r\n  for (;;) {\r\n    numerator = finalise(numerator.times(x2), wpr, 1);\r\n    t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      sum = sum.times(2);\r\n\r\n      // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n      // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n      if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n      sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n      // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n      // been repeated previously) and the first 4 rounding digits 9999?\r\n      // If so, restart the summation with a higher precision, otherwise\r\n      // e.g. with precision: 12, rounding: 1\r\n      // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n        if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += guard;\r\n          t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n          x2 = finalise(x.times(x), wpr, 1);\r\n          denominator = rep = 1;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n    denominator += 2;\r\n  }\r\n}\r\n\r\n\r\n// ±Infinity, NaN.\r\nfunction nonFiniteToString(x) {\r\n  // Unsigned.\r\n  return String(x.s * x.s / 0);\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from string `str`.\r\n */\r\nfunction parseDecimal(x, str) {\r\n  var e, i, len;\r\n\r\n  // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.\r\n  // Decimal point?\r\n  if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n  // Exponential form?\r\n  if ((i = str.search(/e/i)) > 0) {\r\n\r\n    // Determine exponent.\r\n    if (e < 0) e = i;\r\n    e += +str.slice(i + 1);\r\n    str = str.substring(0, i);\r\n  } else if (e < 0) {\r\n\r\n    // Integer.\r\n    e = str.length;\r\n  }\r\n\r\n  // Determine leading zeros.\r\n  for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n  // Determine trailing zeros.\r\n  for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n  str = str.slice(i, len);\r\n\r\n  if (str) {\r\n    len -= i;\r\n    x.e = e = e - i - 1;\r\n    x.d = [];\r\n\r\n    // Transform base\r\n\r\n    // e is the base 10 exponent.\r\n    // i is where to slice str to get the first word of the digits array.\r\n    i = (e + 1) % LOG_BASE;\r\n    if (e < 0) i += LOG_BASE;\r\n\r\n    if (i < len) {\r\n      if (i) x.d.push(+str.slice(0, i));\r\n      for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n      str = str.slice(i);\r\n      i = LOG_BASE - str.length;\r\n    } else {\r\n      i -= len;\r\n    }\r\n\r\n    for (; i--;) str += '0';\r\n    x.d.push(+str);\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > x.constructor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < x.constructor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // x.constructor.underflow = true;\r\n      } // else x.constructor.underflow = false;\r\n    }\r\n  } else {\r\n\r\n    // Zero.\r\n    x.e = 0;\r\n    x.d = [0];\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n */\r\nfunction parseOther(x, str) {\r\n  var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n  if (str.indexOf('_') > -1) {\r\n    str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n    if (isDecimal.test(str)) return parseDecimal(x, str);\r\n  } else if (str === 'Infinity' || str === 'NaN') {\r\n    if (!+str) x.s = NaN;\r\n    x.e = NaN;\r\n    x.d = null;\r\n    return x;\r\n  }\r\n\r\n  if (isHex.test(str))  {\r\n    base = 16;\r\n    str = str.toLowerCase();\r\n  } else if (isBinary.test(str))  {\r\n    base = 2;\r\n  } else if (isOctal.test(str))  {\r\n    base = 8;\r\n  } else {\r\n    throw Error(invalidArgument + str);\r\n  }\r\n\r\n  // Is there a binary exponent part?\r\n  i = str.search(/p/i);\r\n\r\n  if (i > 0) {\r\n    p = +str.slice(i + 1);\r\n    str = str.substring(2, i);\r\n  } else {\r\n    str = str.slice(2);\r\n  }\r\n\r\n  // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n  // fraction part will be restored.\r\n  i = str.indexOf('.');\r\n  isFloat = i >= 0;\r\n  Ctor = x.constructor;\r\n\r\n  if (isFloat) {\r\n    str = str.replace('.', '');\r\n    len = str.length;\r\n    i = len - i;\r\n\r\n    // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n    divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n  }\r\n\r\n  xd = convertBase(str, base, BASE);\r\n  xe = xd.length - 1;\r\n\r\n  // Remove trailing zeros.\r\n  for (i = xe; xd[i] === 0; --i) xd.pop();\r\n  if (i < 0) return new Ctor(x.s * 0);\r\n  x.e = getBase10Exponent(xd, xe);\r\n  x.d = xd;\r\n  external = false;\r\n\r\n  // At what precision to perform the division to ensure exact conversion?\r\n  // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n  // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n  // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n  // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n  // Therefore using 4 * the number of digits of str will always be enough.\r\n  if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n  // Multiply by the binary exponent part if present.\r\n  if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n  external = true;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction sine(Ctor, x) {\r\n  var k,\r\n    len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n  }\r\n\r\n  // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n  // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n  // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  k = 1.4 * Math.sqrt(len);\r\n  k = k > 16 ? 16 : k | 0;\r\n\r\n  x = x.times(1 / tinyPow(5, k));\r\n  x = taylorSeries(Ctor, 2, x, x);\r\n\r\n  // Reverse argument reduction\r\n  var sin2_x,\r\n    d5 = new Ctor(5),\r\n    d16 = new Ctor(16),\r\n    d20 = new Ctor(20);\r\n  for (; k--;) {\r\n    sin2_x = x.times(x);\r\n    x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\nfunction taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n  var j, t, u, x2,\r\n    i = 1,\r\n    pr = Ctor.precision,\r\n    k = Math.ceil(pr / LOG_BASE);\r\n\r\n  external = false;\r\n  x2 = x.times(x);\r\n  u = new Ctor(y);\r\n\r\n  for (;;) {\r\n    t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n    y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    t = u.plus(y);\r\n\r\n    if (t.d[k] !== void 0) {\r\n      for (j = k; t.d[j] === u.d[j] && j--;);\r\n      if (j == -1) break;\r\n    }\r\n\r\n    j = u;\r\n    u = y;\r\n    y = t;\r\n    t = j;\r\n    i++;\r\n  }\r\n\r\n  external = true;\r\n  t.d.length = k + 1;\r\n\r\n  return t;\r\n}\r\n\r\n\r\n// Exponent e must be positive and non-zero.\r\nfunction tinyPow(b, e) {\r\n  var n = b;\r\n  while (--e) n *= b;\r\n  return n;\r\n}\r\n\r\n\r\n// Return the absolute value of `x` reduced to less than or equal to half pi.\r\nfunction toLessThanHalfPi(Ctor, x) {\r\n  var t,\r\n    isNeg = x.s < 0,\r\n    pi = getPi(Ctor, Ctor.precision, 1),\r\n    halfPi = pi.times(0.5);\r\n\r\n  x = x.abs();\r\n\r\n  if (x.lte(halfPi)) {\r\n    quadrant = isNeg ? 4 : 1;\r\n    return x;\r\n  }\r\n\r\n  t = x.divToInt(pi);\r\n\r\n  if (t.isZero()) {\r\n    quadrant = isNeg ? 3 : 2;\r\n  } else {\r\n    x = x.minus(t.times(pi));\r\n\r\n    // 0 <= x < pi\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n      return x;\r\n    }\r\n\r\n    quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n  }\r\n\r\n  return x.minus(pi).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n *\r\n * If the optional `sd` argument is present include a binary exponent suffix.\r\n */\r\nfunction toStringBinary(x, baseOut, sd, rm) {\r\n  var base, e, i, k, len, roundUp, str, xd, y,\r\n    Ctor = x.constructor,\r\n    isExp = sd !== void 0;\r\n\r\n  if (isExp) {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  } else {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  }\r\n\r\n  if (!x.isFinite()) {\r\n    str = nonFiniteToString(x);\r\n  } else {\r\n    str = finiteToString(x);\r\n    i = str.indexOf('.');\r\n\r\n    // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n    // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n    // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n    // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n    if (isExp) {\r\n      base = 2;\r\n      if (baseOut == 16) {\r\n        sd = sd * 4 - 3;\r\n      } else if (baseOut == 8) {\r\n        sd = sd * 3 - 2;\r\n      }\r\n    } else {\r\n      base = baseOut;\r\n    }\r\n\r\n    // Convert the number as an integer then divide the result by its base raised to a power such\r\n    // that the fraction part will be restored.\r\n\r\n    // Non-integer.\r\n    if (i >= 0) {\r\n      str = str.replace('.', '');\r\n      y = new Ctor(1);\r\n      y.e = str.length - i;\r\n      y.d = convertBase(finiteToString(y), 10, base);\r\n      y.e = y.d.length;\r\n    }\r\n\r\n    xd = convertBase(str, 10, base);\r\n    e = len = xd.length;\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] == 0;) xd.pop();\r\n\r\n    if (!xd[0]) {\r\n      str = isExp ? '0p+0' : '0';\r\n    } else {\r\n      if (i < 0) {\r\n        e--;\r\n      } else {\r\n        x = new Ctor(x);\r\n        x.d = xd;\r\n        x.e = e;\r\n        x = divide(x, y, sd, rm, 0, base);\r\n        xd = x.d;\r\n        e = x.e;\r\n        roundUp = inexact;\r\n      }\r\n\r\n      // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      i = xd[sd];\r\n      k = base / 2;\r\n      roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n      roundUp = rm < 4\r\n        ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n        : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n          rm === (x.s < 0 ? 8 : 7));\r\n\r\n      xd.length = sd;\r\n\r\n      if (roundUp) {\r\n\r\n        // Rounding up may mean the previous digit has to be rounded up and so on.\r\n        for (; ++xd[--sd] > base - 1;) {\r\n          xd[sd] = 0;\r\n          if (!sd) {\r\n            ++e;\r\n            xd.unshift(1);\r\n          }\r\n        }\r\n      }\r\n\r\n      // Determine trailing zeros.\r\n      for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n      // E.g. [4, 11, 15] becomes 4bf.\r\n      for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n      // Add binary exponent suffix?\r\n      if (isExp) {\r\n        if (len > 1) {\r\n          if (baseOut == 16 || baseOut == 8) {\r\n            i = baseOut == 16 ? 4 : 3;\r\n            for (--len; len % i; len++) str += '0';\r\n            xd = convertBase(str, base, baseOut);\r\n            for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n            // xd[0] will always be be 1\r\n            for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n          } else {\r\n            str = str.charAt(0) + '.' + str.slice(1);\r\n          }\r\n        }\r\n\r\n        str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n      } else if (e < 0) {\r\n        for (; ++e;) str = '0' + str;\r\n        str = '0.' + str;\r\n      } else {\r\n        if (++e > len) for (e -= len; e-- ;) str += '0';\r\n        else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n  }\r\n\r\n  return x.s < 0 ? '-' + str : str;\r\n}\r\n\r\n\r\n// Does not strip trailing zeros.\r\nfunction truncate(arr, len) {\r\n  if (arr.length > len) {\r\n    arr.length = len;\r\n    return true;\r\n  }\r\n}\r\n\r\n\r\n// Decimal methods\r\n\r\n\r\n/*\r\n *  abs\r\n *  acos\r\n *  acosh\r\n *  add\r\n *  asin\r\n *  asinh\r\n *  atan\r\n *  atanh\r\n *  atan2\r\n *  cbrt\r\n *  ceil\r\n *  clamp\r\n *  clone\r\n *  config\r\n *  cos\r\n *  cosh\r\n *  div\r\n *  exp\r\n *  floor\r\n *  hypot\r\n *  ln\r\n *  log\r\n *  log2\r\n *  log10\r\n *  max\r\n *  min\r\n *  mod\r\n *  mul\r\n *  pow\r\n *  random\r\n *  round\r\n *  set\r\n *  sign\r\n *  sin\r\n *  sinh\r\n *  sqrt\r\n *  sub\r\n *  sum\r\n *  tan\r\n *  tanh\r\n *  trunc\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction abs(x) {\r\n  return new this(x).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction acos(x) {\r\n  return new this(x).acos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction acosh(x) {\r\n  return new this(x).acosh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction add(x, y) {\r\n  return new this(x).plus(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction asin(x) {\r\n  return new this(x).asin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction asinh(x) {\r\n  return new this(x).asinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction atan(x) {\r\n  return new this(x).atan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction atanh(x) {\r\n  return new this(x).atanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n *\r\n * y {number|string|bigint|Decimal} The y-coordinate.\r\n * x {number|string|bigint|Decimal} The x-coordinate.\r\n *\r\n * atan2(±0, -0)               = ±pi\r\n * atan2(±0, +0)               = ±0\r\n * atan2(±0, -x)               = ±pi for x > 0\r\n * atan2(±0, x)                = ±0 for x > 0\r\n * atan2(-y, ±0)               = -pi/2 for y > 0\r\n * atan2(y, ±0)                = pi/2 for y > 0\r\n * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n * atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\nfunction atan2(y, x) {\r\n  y = new this(y);\r\n  x = new this(x);\r\n  var r,\r\n    pr = this.precision,\r\n    rm = this.rounding,\r\n    wpr = pr + 4;\r\n\r\n  // Either NaN\r\n  if (!y.s || !x.s) {\r\n    r = new this(NaN);\r\n\r\n  // Both ±Infinity\r\n  } else if (!y.d && !x.d) {\r\n    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n    r.s = y.s;\r\n\r\n  // x is ±Infinity or y is ±0\r\n  } else if (!x.d || y.isZero()) {\r\n    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n    r.s = y.s;\r\n\r\n  // y is ±Infinity or x is ±0\r\n  } else if (!y.d || x.isZero()) {\r\n    r = getPi(this, wpr, 1).times(0.5);\r\n    r.s = y.s;\r\n\r\n  // Both non-zero and finite\r\n  } else if (x.s < 0) {\r\n    this.precision = wpr;\r\n    this.rounding = 1;\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n    x = getPi(this, wpr, 1);\r\n    this.precision = pr;\r\n    this.rounding = rm;\r\n    r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n  } else {\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction cbrt(x) {\r\n  return new this(x).cbrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ceil(x) {\r\n  return finalise(x = new this(x), x.e + 1, 2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction clamp(x, min, max) {\r\n  return new this(x).clamp(min, max);\r\n}\r\n\r\n\r\n/*\r\n * Configure global settings for a Decimal constructor.\r\n *\r\n * `obj` is an object with one or more of the following properties,\r\n *\r\n *   precision  {number}\r\n *   rounding   {number}\r\n *   toExpNeg   {number}\r\n *   toExpPos   {number}\r\n *   maxE       {number}\r\n *   minE       {number}\r\n *   modulo     {number}\r\n *   crypto     {boolean|number}\r\n *   defaults   {true}\r\n *\r\n * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n *\r\n */\r\nfunction config(obj) {\r\n  if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n  var i, p, v,\r\n    useDefaults = obj.defaults === true,\r\n    ps = [\r\n      'precision', 1, MAX_DIGITS,\r\n      'rounding', 0, 8,\r\n      'toExpNeg', -EXP_LIMIT, 0,\r\n      'toExpPos', 0, EXP_LIMIT,\r\n      'maxE', 0, EXP_LIMIT,\r\n      'minE', -EXP_LIMIT, 0,\r\n      'modulo', 0, 9\r\n    ];\r\n\r\n  for (i = 0; i < ps.length; i += 3) {\r\n    if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n      else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n  if ((v = obj[p]) !== void 0) {\r\n    if (v === true || v === false || v === 0 || v === 1) {\r\n      if (v) {\r\n        if (typeof crypto != 'undefined' && crypto &&\r\n          (crypto.getRandomValues || crypto.randomBytes)) {\r\n          this[p] = true;\r\n        } else {\r\n          throw Error(cryptoUnavailable);\r\n        }\r\n      } else {\r\n        this[p] = false;\r\n      }\r\n    } else {\r\n      throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  return this;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cos(x) {\r\n  return new this(x).cos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cosh(x) {\r\n  return new this(x).cosh();\r\n}\r\n\r\n\r\n/*\r\n * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n *\r\n */\r\nfunction clone(obj) {\r\n  var i, p, ps;\r\n\r\n  /*\r\n   * The Decimal constructor and exported function.\r\n   * Return a new Decimal instance.\r\n   *\r\n   * v {number|string|bigint|Decimal} A numeric value.\r\n   *\r\n   */\r\n  function Decimal(v) {\r\n    var e, i, t,\r\n      x = this;\r\n\r\n    // Decimal called without new.\r\n    if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n    // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n    // which points to Object.\r\n    x.constructor = Decimal;\r\n\r\n    if (isDecimalInstance(v)) {\r\n      x.s = v.s;\r\n\r\n      if (external) {\r\n        if (!v.d || v.e > Decimal.maxE) {\r\n\r\n          // Infinity.\r\n          x.e = NaN;\r\n          x.d = null;\r\n        } else if (v.e < Decimal.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d.slice();\r\n        }\r\n      } else {\r\n        x.e = v.e;\r\n        x.d = v.d ? v.d.slice() : v.d;\r\n      }\r\n\r\n      return;\r\n    }\r\n\r\n    t = typeof v;\r\n\r\n    if (t === 'number') {\r\n      if (v === 0) {\r\n        x.s = 1 / v < 0 ? -1 : 1;\r\n        x.e = 0;\r\n        x.d = [0];\r\n        return;\r\n      }\r\n\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      // Fast path for small integers.\r\n      if (v === ~~v && v < 1e7) {\r\n        for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n        if (external) {\r\n          if (e > Decimal.maxE) {\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (e < Decimal.minE) {\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n        } else {\r\n          x.e = e;\r\n          x.d = [v];\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      // Infinity or NaN?\r\n      if (v * 0 !== 0) {\r\n        if (!v) x.s = NaN;\r\n        x.e = NaN;\r\n        x.d = null;\r\n        return;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    if (t === 'string') {\r\n      if ((i = v.charCodeAt(0)) === 45) {  // minus sign\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        if (i === 43) v = v.slice(1);  // plus sign\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    if (t === 'bigint') {\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    throw Error(invalidArgument + v);\r\n  }\r\n\r\n  Decimal.prototype = P;\r\n\r\n  Decimal.ROUND_UP = 0;\r\n  Decimal.ROUND_DOWN = 1;\r\n  Decimal.ROUND_CEIL = 2;\r\n  Decimal.ROUND_FLOOR = 3;\r\n  Decimal.ROUND_HALF_UP = 4;\r\n  Decimal.ROUND_HALF_DOWN = 5;\r\n  Decimal.ROUND_HALF_EVEN = 6;\r\n  Decimal.ROUND_HALF_CEIL = 7;\r\n  Decimal.ROUND_HALF_FLOOR = 8;\r\n  Decimal.EUCLID = 9;\r\n\r\n  Decimal.config = Decimal.set = config;\r\n  Decimal.clone = clone;\r\n  Decimal.isDecimal = isDecimalInstance;\r\n\r\n  Decimal.abs = abs;\r\n  Decimal.acos = acos;\r\n  Decimal.acosh = acosh;        // ES6\r\n  Decimal.add = add;\r\n  Decimal.asin = asin;\r\n  Decimal.asinh = asinh;        // ES6\r\n  Decimal.atan = atan;\r\n  Decimal.atanh = atanh;        // ES6\r\n  Decimal.atan2 = atan2;\r\n  Decimal.cbrt = cbrt;          // ES6\r\n  Decimal.ceil = ceil;\r\n  Decimal.clamp = clamp;\r\n  Decimal.cos = cos;\r\n  Decimal.cosh = cosh;          // ES6\r\n  Decimal.div = div;\r\n  Decimal.exp = exp;\r\n  Decimal.floor = floor;\r\n  Decimal.hypot = hypot;        // ES6\r\n  Decimal.ln = ln;\r\n  Decimal.log = log;\r\n  Decimal.log10 = log10;        // ES6\r\n  Decimal.log2 = log2;          // ES6\r\n  Decimal.max = max;\r\n  Decimal.min = min;\r\n  Decimal.mod = mod;\r\n  Decimal.mul = mul;\r\n  Decimal.pow = pow;\r\n  Decimal.random = random;\r\n  Decimal.round = round;\r\n  Decimal.sign = sign;          // ES6\r\n  Decimal.sin = sin;\r\n  Decimal.sinh = sinh;          // ES6\r\n  Decimal.sqrt = sqrt;\r\n  Decimal.sub = sub;\r\n  Decimal.sum = sum;\r\n  Decimal.tan = tan;\r\n  Decimal.tanh = tanh;          // ES6\r\n  Decimal.trunc = trunc;        // ES6\r\n\r\n  if (obj === void 0) obj = {};\r\n  if (obj) {\r\n    if (obj.defaults !== true) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n  }\r\n\r\n  Decimal.config(obj);\r\n\r\n  return Decimal;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction div(x, y) {\r\n  return new this(x).div(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The power to which to raise the base of the natural log.\r\n *\r\n */\r\nfunction exp(x) {\r\n  return new this(x).exp();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction floor(x) {\r\n  return finalise(x = new this(x), x.e + 1, 3);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction hypot() {\r\n  var i, n,\r\n    t = new this(0);\r\n\r\n  external = false;\r\n\r\n  for (i = 0; i < arguments.length;) {\r\n    n = new this(arguments[i++]);\r\n    if (!n.d) {\r\n      if (n.s) {\r\n        external = true;\r\n        return new this(1 / 0);\r\n      }\r\n      t = n;\r\n    } else if (t.d) {\r\n      t = t.plus(n.times(n));\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return t.sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n *\r\n */\r\nfunction isDecimalInstance(obj) {\r\n  return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ln(x) {\r\n  return new this(x).ln();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * log[y](x)\r\n *\r\n * x {number|string|bigint|Decimal} The argument of the logarithm.\r\n * y {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nfunction log(x, y) {\r\n  return new this(x).log(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log2(x) {\r\n  return new this(x).log(2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log10(x) {\r\n  return new this(x).log(10);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction max() {\r\n  return maxOrMin(this, arguments, -1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction min() {\r\n  return maxOrMin(this, arguments, 1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mod(x, y) {\r\n  return new this(x).mod(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mul(x, y) {\r\n  return new this(x).mul(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The base.\r\n * y {number|string|bigint|Decimal} The exponent.\r\n *\r\n */\r\nfunction pow(x, y) {\r\n  return new this(x).pow(y);\r\n}\r\n\r\n\r\n/*\r\n * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n *\r\n * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n *\r\n */\r\nfunction random(sd) {\r\n  var d, e, k, n,\r\n    i = 0,\r\n    r = new this(1),\r\n    rd = [];\r\n\r\n  if (sd === void 0) sd = this.precision;\r\n  else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n  k = Math.ceil(sd / LOG_BASE);\r\n\r\n  if (!this.crypto) {\r\n    for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n  // Browsers supporting crypto.getRandomValues.\r\n  } else if (crypto.getRandomValues) {\r\n    d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n    for (; i < k;) {\r\n      n = d[i];\r\n\r\n      // 0 <= n < 4294967296\r\n      // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n      if (n >= 4.29e9) {\r\n        d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n      } else {\r\n\r\n        // 0 <= n <= 4289999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd[i++] = n % 1e7;\r\n      }\r\n    }\r\n\r\n  // Node.js supporting crypto.randomBytes.\r\n  } else if (crypto.randomBytes) {\r\n\r\n    // buffer\r\n    d = crypto.randomBytes(k *= 4);\r\n\r\n    for (; i < k;) {\r\n\r\n      // 0 <= n < 2147483648\r\n      n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n      // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n      if (n >= 2.14e9) {\r\n        crypto.randomBytes(4).copy(d, i);\r\n      } else {\r\n\r\n        // 0 <= n <= 2139999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd.push(n % 1e7);\r\n        i += 4;\r\n      }\r\n    }\r\n\r\n    i = k / 4;\r\n  } else {\r\n    throw Error(cryptoUnavailable);\r\n  }\r\n\r\n  k = rd[--i];\r\n  sd %= LOG_BASE;\r\n\r\n  // Convert trailing digits to zeros according to sd.\r\n  if (k && sd) {\r\n    n = mathpow(10, LOG_BASE - sd);\r\n    rd[i] = (k / n | 0) * n;\r\n  }\r\n\r\n  // Remove trailing words which are zero.\r\n  for (; rd[i] === 0; i--) rd.pop();\r\n\r\n  // Zero?\r\n  if (i < 0) {\r\n    e = 0;\r\n    rd = [0];\r\n  } else {\r\n    e = -1;\r\n\r\n    // Remove leading words which are zero and adjust exponent accordingly.\r\n    for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n    // Count the digits of the first word of rd to determine leading zeros.\r\n    for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n    // Adjust the exponent for leading zeros of the first word of rd.\r\n    if (k < LOG_BASE) e -= LOG_BASE - k;\r\n  }\r\n\r\n  r.e = e;\r\n  r.d = rd;\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n *\r\n * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction round(x) {\r\n  return finalise(x = new this(x), x.e + 1, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if x > 0,\r\n *  -1    if x < 0,\r\n *   0    if x is 0,\r\n *  -0    if x is -0,\r\n *   NaN  otherwise\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sign(x) {\r\n  x = new this(x);\r\n  return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sin(x) {\r\n  return new this(x).sin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sinh(x) {\r\n  return new this(x).sinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sqrt(x) {\r\n  return new this(x).sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sub(x, y) {\r\n  return new this(x).sub(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * Only the result is rounded, not the intermediate calculations.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sum() {\r\n  var i = 0,\r\n    args = arguments,\r\n    x = new this(args[i]);\r\n\r\n  external = false;\r\n  for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n  external = true;\r\n\r\n  return finalise(x, this.precision, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tan(x) {\r\n  return new this(x).tan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tanh(x) {\r\n  return new this(x).tanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` truncated to an integer.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction trunc(x) {\r\n  return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    config\n  } = _ref;\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: Decimal.EUCLID\n  });\n  BigNumber.prototype = Object.create(BigNumber.prototype);\n\n  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n\n  /**\n   * Get a JSON representation of a BigNumber containing\n   * type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   */\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\n  };\n\n  /**\n   * Instantiate a BigNumber from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   * @return {BigNumber}\n   */\n  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\n  };\n  if (on) {\n    // listen for changed in the configuration, automatically apply changed precision\n    on('config', function (curr, prev) {\n      if (curr.precision !== prev.precision) {\n        BigNumber.config({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n  return BigNumber;\n}, {\n  isClass: true\n});","'use strict';\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * const c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n\nconst cosh = Math.cosh || function (x) {\n  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;\n};\n\nconst sinh = Math.sinh || function (x) {\n  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;\n};\n\n/**\n * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\nconst cosm1 = x => {\n  // cos(x) - 1 = − 2sin^2(x / 2)\n  const s = Math.sin(0.5 * x);\n  return -2 * s * s;\n};\n\nconst hypot = function (x, y) {\n\n  x = Math.abs(x);\n  y = Math.abs(y);\n\n  // Ensure `x` is the larger value\n  if (x < y) [x, y] = [y, x];\n\n  // If both are below the threshold, use straightforward Pythagoras\n  if (x < 1e8) return Math.sqrt(x * x + y * y);\n\n  // For larger values, scale to avoid overflow\n  y /= x;\n  return x * Math.sqrt(1 + y * y);\n};\n\nconst parser_exit = function () {\n  throw SyntaxError('Invalid Param');\n};\n\n/**\n * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n *\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction logHypot(a, b) {\n\n  const _a = Math.abs(a);\n  const _b = Math.abs(b);\n\n  if (a === 0) {\n    return Math.log(_b);\n  }\n\n  if (b === 0) {\n    return Math.log(_a);\n  }\n\n  if (_a < 3000 && _b < 3000) {\n    return Math.log(a * a + b * b) * 0.5;\n  }\n\n  /* I got 4 ideas to compute this property without overflow:\n   *\n   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n   *\n   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n   Math.log(a * a + b * b) / 2\n\n   *\n   *\n   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n   const fn = function(a, b) {\n   a = Math.abs(a);\n   b = Math.abs(b);\n   let t = Math.min(a, b);\n   a = Math.max(a, b);\n   t = t / a;\n\n   return Math.log(a) + Math.log(1 + t * t) / 2;\n   };\n\n   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n   Math.log(a / Math.cos(Math.atan2(b, a)))\n\n   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n   */\n\n  a = a * 0.5;\n  b = b * 0.5;\n\n  return 0.5 * Math.log(a * a + b * b) + Math.LN2;\n}\n\nconst P = { 're': 0, 'im': 0 };\nconst parse = function (a, b) {\n\n  const z = P;\n\n  if (a === undefined || a === null) {\n    z['re'] =\n      z['im'] = 0;\n  } else if (b !== undefined) {\n    z['re'] = a;\n    z['im'] = b;\n  } else\n    switch (typeof a) {\n\n      case 'object':\n\n        if ('im' in a && 're' in a) {\n          z['re'] = a['re'];\n          z['im'] = a['im'];\n        } else if ('abs' in a && 'arg' in a) {\n          if (!isFinite(a['abs']) && isFinite(a['arg'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['abs'] * Math.cos(a['arg']);\n          z['im'] = a['abs'] * Math.sin(a['arg']);\n        } else if ('r' in a && 'phi' in a) {\n          if (!isFinite(a['r']) && isFinite(a['phi'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['r'] * Math.cos(a['phi']);\n          z['im'] = a['r'] * Math.sin(a['phi']);\n        } else if (a.length === 2) { // Quick array check\n          z['re'] = a[0];\n          z['im'] = a[1];\n        } else {\n          parser_exit();\n        }\n        break;\n\n      case 'string':\n\n        z['im'] = /* void */\n          z['re'] = 0;\n\n        const tokens = a.replace(/_/g, '')\n          .match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n        let plus = 1;\n        let minus = 0;\n\n        if (tokens === null) {\n          parser_exit();\n        }\n\n        for (let i = 0; i < tokens.length; i++) {\n\n          const c = tokens[i];\n\n          if (c === ' ' || c === '\\t' || c === '\\n') {\n            /* void */\n          } else if (c === '+') {\n            plus++;\n          } else if (c === '-') {\n            minus++;\n          } else if (c === 'i' || c === 'I') {\n\n            if (plus + minus === 0) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n              i++;\n            } else {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n            }\n            plus = minus = 0;\n\n          } else {\n\n            if (plus + minus === 0 || isNaN(c)) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n              i++;\n            } else {\n              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n            }\n            plus = minus = 0;\n          }\n        }\n\n        // Still something on the stack\n        if (plus + minus > 0) {\n          parser_exit();\n        }\n        break;\n\n      case 'number':\n        z['im'] = 0;\n        z['re'] = a;\n        break;\n\n      default:\n        parser_exit();\n    }\n\n  if (isNaN(z['re']) || isNaN(z['im'])) {\n    // If a calculation is NaN, we treat it as NaN and don't throw\n    //parser_exit();\n  }\n\n  return z;\n};\n\n/**\n * @constructor\n * @returns {Complex}\n */\nfunction Complex(a, b) {\n\n  if (!(this instanceof Complex)) {\n    return new Complex(a, b);\n  }\n\n  const z = parse(a, b);\n\n  this['re'] = z['re'];\n  this['im'] = z['im'];\n}\n\nComplex.prototype = {\n\n  're': 0,\n  'im': 0,\n\n  /**\n   * Calculates the sign of a complex number, which is a normalized complex\n   *\n   * @returns {Complex}\n   */\n  'sign': function () {\n\n    const abs = hypot(this['re'], this['im']);\n\n    return new Complex(\n      this['re'] / abs,\n      this['im'] / abs);\n  },\n\n  /**\n   * Adds two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'add': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity + Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity + z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] + z['re'],\n      this['im'] + z['im']);\n  },\n\n  /**\n   * Subtracts two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'sub': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity - Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity - z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] - z['re'],\n      this['im'] - z['im']);\n  },\n\n  /**\n   * Multiplies two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'mul': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // Infinity * 0 = NaN\n    if (tInfin && zIsZero || zInfin && tIsZero) {\n      return Complex['NAN'];\n    }\n\n    // Infinity * z = Infinity { where z != 0 }\n    if (tInfin || zInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // Shortcut for real values\n    if (z['im'] === 0 && this['im'] === 0) {\n      return new Complex(this['re'] * z['re'], 0);\n    }\n\n    return new Complex(\n      this['re'] * z['re'] - this['im'] * z['im'],\n      this['re'] * z['im'] + this['im'] * z['re']);\n  },\n\n  /**\n   * Divides two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'div': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // 0 / 0 = NaN and Infinity / Infinity = NaN\n    if (tIsZero && zIsZero || tInfin && zInfin) {\n      return Complex['NAN'];\n    }\n\n    // Infinity / 0 = Infinity\n    if (zIsZero || tInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // 0 / Infinity = 0\n    if (tIsZero || zInfin) {\n      return Complex['ZERO'];\n    }\n\n    if (0 === z['im']) {\n      // Divisor is real\n      return new Complex(this['re'] / z['re'], this['im'] / z['re']);\n    }\n\n    if (Math.abs(z['re']) < Math.abs(z['im'])) {\n\n      const x = z['re'] / z['im'];\n      const t = z['re'] * x + z['im'];\n\n      return new Complex(\n        (this['re'] * x + this['im']) / t,\n        (this['im'] * x - this['re']) / t);\n\n    } else {\n\n      const x = z['im'] / z['re'];\n      const t = z['im'] * x + z['re'];\n\n      return new Complex(\n        (this['re'] + this['im'] * x) / t,\n        (this['im'] - this['re'] * x) / t);\n    }\n  },\n\n  /**\n   * Calculate the power of two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'pow': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    if (zIsZero) {\n      return Complex['ONE'];\n    }\n\n    // If the exponent is real\n    if (z['im'] === 0) {\n\n      if (this['im'] === 0 && this['re'] > 0) {\n\n        return new Complex(Math.pow(this['re'], z['re']), 0);\n\n      } else if (this['re'] === 0) { // If base is fully imaginary\n\n        switch ((z['re'] % 4 + 4) % 4) {\n          case 0:\n            return new Complex(Math.pow(this['im'], z['re']), 0);\n          case 1:\n            return new Complex(0, Math.pow(this['im'], z['re']));\n          case 2:\n            return new Complex(-Math.pow(this['im'], z['re']), 0);\n          case 3:\n            return new Complex(0, -Math.pow(this['im'], z['re']));\n        }\n      }\n    }\n\n    /* I couldn't find a good formula, so here is a derivation and optimization\n     *\n     * z_1^z_2 = (a + bi)^(c + di)\n     *         = exp((c + di) * log(a + bi)\n     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n     * =>...\n     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     *\n     * =>...\n     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     *\n     * =>\n     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n     *\n     */\n\n    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero\n      return Complex['ZERO'];\n    }\n\n    const arg = Math.atan2(this['im'], this['re']);\n    const loh = logHypot(this['re'], this['im']);\n\n    let re = Math.exp(z['re'] * loh - z['im'] * arg);\n    let im = z['im'] * loh + z['re'] * arg;\n    return new Complex(\n      re * Math.cos(im),\n      re * Math.sin(im));\n  },\n\n  /**\n   * Calculate the complex square root\n   *\n   * @returns {Complex}\n   */\n  'sqrt': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      // Real number case\n      if (a >= 0) {\n        return new Complex(Math.sqrt(a), 0);\n      } else {\n        return new Complex(0, Math.sqrt(-a));\n      }\n    }\n\n    const r = hypot(a, b);\n\n    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)\n    let im = Math.abs(b) / (2 * re);\n\n    if (a >= 0) {\n      return new Complex(re, b < 0 ? -im : im);\n    } else {\n      return new Complex(im, b < 0 ? -re : re);\n    }\n  },\n\n  /**\n   * Calculate the complex exponent\n   *\n   * @returns {Complex}\n   */\n  'exp': function () {\n\n    const er = Math.exp(this['re']);\n\n    if (this['im'] === 0) {\n      return new Complex(er, 0);\n    }\n    return new Complex(\n      er * Math.cos(this['im']),\n      er * Math.sin(this['im']));\n  },\n\n  /**\n   * Calculate the complex exponent and subtracts one.\n   *\n   * This may be more accurate than `Complex(x).exp().sub(1)` if\n   * `x` is small.\n   *\n   * @returns {Complex}\n   */\n  'expm1': function () {\n\n    /**\n     * exp(a + i*b) - 1\n     = exp(a) * (cos(b) + j*sin(b)) - 1\n     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n     */\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.expm1(a) * Math.cos(b) + cosm1(b),\n      Math.exp(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the natural log\n   *\n   * @returns {Complex}\n   */\n  'log': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0 && a > 0) {\n      return new Complex(Math.log(a), 0);\n    }\n\n    return new Complex(\n      logHypot(a, b),\n      Math.atan2(b, a));\n  },\n\n  /**\n   * Calculate the magnitude of the complex number\n   *\n   * @returns {number}\n   */\n  'abs': function () {\n\n    return hypot(this['re'], this['im']);\n  },\n\n  /**\n   * Calculate the angle of the complex number\n   *\n   * @returns {number}\n   */\n  'arg': function () {\n\n    return Math.atan2(this['im'], this['re']);\n  },\n\n  /**\n   * Calculate the sine of the complex number\n   *\n   * @returns {Complex}\n   */\n  'sin': function () {\n\n    // sin(z) = ( e^iz - e^-iz ) / 2i \n    //        = sin(a)cosh(b) + i cos(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.sin(a) * cosh(b),\n      Math.cos(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the cosine\n   *\n   * @returns {Complex}\n   */\n  'cos': function () {\n\n    // cos(z) = ( e^iz + e^-iz ) / 2 \n    //        = cos(a)cosh(b) - i sin(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.cos(a) * cosh(b),\n      -Math.sin(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the tangent\n   *\n   * @returns {Complex}\n   */\n  'tan': function () {\n\n    // tan(z) = sin(z) / cos(z) \n    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) + cosh(b);\n\n    return new Complex(\n      Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cotangent\n   *\n   * @returns {Complex}\n   */\n  'cot': function () {\n\n    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) - cosh(b);\n\n    return new Complex(\n      -Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the secant\n   *\n   * @returns {Complex}\n   */\n  'sec': function () {\n\n    // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.cos(a) * cosh(b) / d,\n      Math.sin(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cosecans\n   *\n   * @returns {Complex}\n   */\n  'csc': function () {\n\n    // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.sin(a) * cosh(b) / d,\n      -Math.cos(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the complex arcus sinus\n   *\n   * @returns {Complex}\n   */\n  'asin': function () {\n\n    // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(t2['im'], -t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cosinus\n   *\n   * @returns {Complex}\n   */\n  'acos': function () {\n\n    // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus tangent\n   *\n   * @returns {Complex}\n   */\n  'atan': function () {\n\n    // atan(c) = i / 2 log((i + x) / (i - x))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0) {\n\n      if (b === 1) {\n        return new Complex(0, Infinity);\n      }\n\n      if (b === -1) {\n        return new Complex(0, -Infinity);\n      }\n    }\n\n    const d = a * a + (1.0 - b) * (1.0 - b);\n\n    const t1 = new Complex(\n      (1 - b * b - a * a) / d,\n      -2 * a / d).log();\n\n    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cotangent\n   *\n   * @returns {Complex}\n   */\n  'acot': function () {\n\n    // acot(c) = i / 2 log((c - i) / (c + i))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      return new Complex(Math.atan2(1, a), 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atan()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atan();\n  },\n\n  /**\n   * Calculate the complex arcus secant\n   *\n   * @returns {Complex}\n   */\n  'asec': function () {\n\n    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acos()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acos();\n  },\n\n  /**\n   * Calculate the complex arcus cosecans\n   *\n   * @returns {Complex}\n   */\n  'acsc': function () {\n\n    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(Math.PI / 2, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asin()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asin();\n  },\n\n  /**\n   * Calculate the complex sinh\n   *\n   * @returns {Complex}\n   */\n  'sinh': function () {\n\n    // sinh(c) = (e^c - e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      sinh(a) * Math.cos(b),\n      cosh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex cosh\n   *\n   * @returns {Complex}\n   */\n  'cosh': function () {\n\n    // cosh(c) = (e^c + e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      cosh(a) * Math.cos(b),\n      sinh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex tanh\n   *\n   * @returns {Complex}\n   */\n  'tanh': function () {\n\n    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) + Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex coth\n   *\n   * @returns {Complex}\n   */\n  'coth': function () {\n\n    // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) - Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      -Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex csch\n   *\n   * @returns {Complex}\n   */\n  'csch': function () {\n\n    // csch(c) = 2 / (e^c - e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) - cosh(2 * a);\n\n    return new Complex(\n      -2 * sinh(a) * Math.cos(b) / d,\n      2 * cosh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex sech\n   *\n   * @returns {Complex}\n   */\n  'sech': function () {\n\n    // sech(c) = 2 / (e^c + e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) + cosh(2 * a);\n\n    return new Complex(\n      2 * cosh(a) * Math.cos(b) / d,\n      -2 * sinh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex asinh\n   *\n   * @returns {Complex}\n   */\n  'asinh': function () {\n\n    // asinh(z) = log(z + sqrt(z^2 + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a\n      const x = Math.abs(a);\n      const r = Math.log(x + Math.sqrt(x * x + 1));\n\n      return new Complex(a < 0 ? -r : r, 0);\n    }\n\n    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)\n    const re2 = a * a - b * b + 1;\n    const im2 = 2 * a * b;\n\n    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)\n\n    return new Complex(a + t['re'], b + t['im'])['log']();\n  },\n\n  /**\n   * Calculate the complex acosh\n   *\n   * @returns {Complex}\n   */\n  'acosh': function () {\n\n    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a is real\n      if (a > 1) {\n        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1\n        return new Complex(\n          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);\n      }\n\n      if (a < -1) {\n        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1\n        const t = Math.sqrt(a * a - 1);\n        return new Complex(Math.log(-a + t), Math.PI);\n      }\n\n      // -1 <= a <= 1 : purely imaginary\n      // acosh(a) = i * acos(a)\n      return new Complex(0, Math.acos(a));\n    }\n\n    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)\n    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)\n\n    return new Complex(\n      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],\n      b + t1['re'] * t2['im'] + t1['im'] * t2['re']\n    )['log']();\n  },\n\n  /**\n   * Calculate the complex atanh\n   *\n   * @returns {Complex}\n   */\n  'atanh': function () {\n\n    // atanh(z) = log((1 + z) / (1 - z)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      if (a === 1) {\n        // limit x -> 1^- atanh(x) = +Infinity\n        return new Complex(Infinity, 0);\n      }\n\n      if (a === -1) {\n        // limit x -> -1^+ atanh(x) = -Infinity\n        return new Complex(-Infinity, 0);\n      }\n\n      if (-1 < a && a < 1) {\n        // Purely real\n        return new Complex(\n          0.5 * Math.log((1 + a) / (1 - a)),\n          0\n        );\n      }\n\n      if (a > 1) {\n        // Our branch: Im(atanh(a)) = -π/2 for a > 1\n        const t = (a + 1) / (a - 1); // > 0\n        return new Complex(\n          0.5 * Math.log(t),\n          -Math.PI / 2\n        );\n      }\n\n      // a < -1: Im(atanh(a)) = +π/2\n      const t = (1 + a) / (1 - a); // < 0\n      return new Complex(\n        0.5 * Math.log(-t), // log((1 - a)/(1 + a))\n        Math.PI / 2\n      );\n    }\n\n    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.\n    const oneMinus = 1 - a;\n    const onePlus = 1 + a;\n    const d = oneMinus * oneMinus + b * b; // |1 - z|^2\n\n    if (d === 0) {\n      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.\n      // If we ever get here, just propagate infinities consistently:\n      return new Complex(\n        (a !== -1) ? (a / 0) : 0,\n        (b !== 0) ? (b / 0) : 0\n      );\n    }\n\n    // (1 + z) / (1 - z) with a single complex division\n    const xr = (onePlus * oneMinus - b * b) / d;\n    const xi = (b * oneMinus + onePlus * b) / d;\n\n    // 0.5 * log(xr + i xi)\n    return new Complex(\n      logHypot(xr, xi) / 2,\n      Math.atan2(xi, xr) / 2\n    );\n  },\n\n  /**\n   * Calculate the complex acoth\n   *\n   * @returns {Complex}\n   */\n  'acoth': function () {\n\n    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    // z = 0 -> acoth(0) = i * π / 2  (log((1+0)/(1-0))/2 = log(-1)/2)\n    if (a === 0 && b === 0) {\n      return new Complex(0, Math.PI / 2);\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['atanh']();\n    }\n\n    // Fallback for weird infinities/NaNs: mirror other functions' style\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0\n    )['atanh']();\n  },\n\n  /**\n   * Calculate the complex acsch\n   *\n   * @returns {Complex}\n   */\n  'acsch': function () {\n\n    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a real\n      if (a === 0) {\n        // acsch(0) -> +/- Infinity, we keep your previous behavior\n        return new Complex(Infinity, 0);\n      }\n\n      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))\n      const inv = 1 / a;\n      return new Complex(\n        Math.log(inv + Math.sqrt(inv * inv + 1)),\n        0\n      );\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1/z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['asinh']();\n    }\n\n    // Handle 0 + 0i or infinities in the same spirit as your existing code\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['asinh']();\n  },\n\n  /**\n   * Calculate the complex asech\n   *\n   * @returns {Complex}\n   */\n  'asech': function () {\n\n    // asech(z) = acosh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (this['isZero']()) {\n      // asech(0) = acosh(∞) -> ∞\n      return Complex['INFINITY'];\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['acosh']();\n    }\n\n    // Fallback for weird infinities/NaNs\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['acosh']();\n  },\n\n  /**\n   * Calculate the complex inverse 1/z\n   *\n   * @returns {Complex}\n   */\n  'inverse': function () {\n\n    // 1 / 0 = Infinity and 1 / Infinity = 0\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    if (this['isInfinite']()) {\n      return Complex['ZERO'];\n    }\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const d = a * a + b * b;\n\n    return new Complex(a / d, -b / d);\n  },\n\n  /**\n   * Returns the complex conjugate\n   *\n   * @returns {Complex}\n   */\n  'conjugate': function () {\n\n    return new Complex(this['re'], -this['im']);\n  },\n\n  /**\n   * Gets the negated complex number\n   *\n   * @returns {Complex}\n   */\n  'neg': function () {\n\n    return new Complex(-this['re'], -this['im']);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'ceil': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.ceil(this['re'] * places) / places,\n      Math.ceil(this['im'] * places) / places);\n  },\n\n  /**\n   * Floors the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'floor': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.floor(this['re'] * places) / places,\n      Math.floor(this['im'] * places) / places);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'round': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.round(this['re'] * places) / places,\n      Math.round(this['im'] * places) / places);\n  },\n\n  /**\n   * Compares two complex numbers\n   *\n   * **Note:** new Complex(Infinity).equals(Infinity) === false\n   *\n   * @returns {boolean}\n   */\n  'equals': function (a, b) {\n\n    const z = parse(a, b);\n\n    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * @returns {Complex}\n   */\n  'clone': function () {\n\n    return new Complex(this['re'], this['im']);\n  },\n\n  /**\n   * Gets a string of the actual complex number\n   *\n   * @returns {string}\n   */\n  'toString': function () {\n\n    let a = this['re'];\n    let b = this['im'];\n    let ret = \"\";\n\n    if (this['isNaN']()) {\n      return 'NaN';\n    }\n\n    if (this['isInfinite']()) {\n      return 'Infinity';\n    }\n\n    if (Math.abs(a) < Complex['EPSILON']) {\n      a = 0;\n    }\n\n    if (Math.abs(b) < Complex['EPSILON']) {\n      b = 0;\n    }\n\n    // If is real number\n    if (b === 0) {\n      return ret + a;\n    }\n\n    if (a !== 0) {\n      ret += a;\n      ret += \" \";\n      if (b < 0) {\n        b = -b;\n        ret += \"-\";\n      } else {\n        ret += \"+\";\n      }\n      ret += \" \";\n    } else if (b < 0) {\n      b = -b;\n      ret += \"-\";\n    }\n\n    if (1 !== b) { // b is the absolute imaginary part\n      ret += b;\n    }\n    return ret + \"i\";\n  },\n\n  /**\n   * Returns the actual number as a vector\n   *\n   * @returns {Array}\n   */\n  'toVector': function () {\n\n    return [this['re'], this['im']];\n  },\n\n  /**\n   * Returns the actual real value of the current object\n   *\n   * @returns {number|null}\n   */\n  'valueOf': function () {\n\n    if (this['im'] === 0) {\n      return this['re'];\n    }\n    return null;\n  },\n\n  /**\n   * Determines whether a complex number is not on the Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isNaN': function () {\n    return isNaN(this['re']) || isNaN(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the zero pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isZero': function () {\n    return this['im'] === 0 && this['re'] === 0;\n  },\n\n  /**\n   * Determines whether a complex number is not at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isFinite': function () {\n    return isFinite(this['re']) && isFinite(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isInfinite': function () {\n    return !this['isFinite']();\n  }\n};\n\nComplex['ZERO'] = new Complex(0, 0);\nComplex['ONE'] = new Complex(1, 0);\nComplex['I'] = new Complex(0, 1);\nComplex['PI'] = new Complex(Math.PI, 0);\nComplex['E'] = new Complex(Math.E, 0);\nComplex['INFINITY'] = new Complex(Infinity, Infinity);\nComplex['NAN'] = new Complex(NaN, NaN);\nComplex['EPSILON'] = 1e-15;\nexport {\n  Complex as default, Complex\n};\n","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Complex, 'name', {\n    value: 'Complex'\n  });\n  Complex.prototype.constructor = Complex;\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\n\n  /**\n   * Get a JSON representation of the complex number\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n   */\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\n  };\n\n  /*\n   * Return the value of the complex number in polar notation\n   * The angle phi will be set in the interval of [-pi, pi].\n   * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n   */\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\n  };\n\n  /**\n   * Get a string representation of the complex number,\n   * with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string} str\n   */\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options);\n\n    // round either re or im when smaller than the configured precision\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\n      }\n    }\n    if (im === 0) {\n      // real value\n      str = strRe;\n    } else if (re === 0) {\n      // purely complex value\n      if (im === 1) {\n        str = 'i';\n      } else if (im === -1) {\n        str = '-i';\n      } else {\n        str = strIm + 'i';\n      }\n    } else {\n      // complex value\n      if (im < 0) {\n        if (im === -1) {\n          str = strRe + ' - i';\n        } else {\n          str = strRe + ' - ' + strIm.substring(1) + 'i';\n        }\n      } else {\n        if (im === 1) {\n          str = strRe + ' + i';\n        } else {\n          str = strRe + ' + ' + strIm + 'i';\n        }\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Create a complex number from polar coordinates\n   *\n   * Usage:\n   *\n   *     Complex.fromPolar(r: number, phi: number) : Complex\n   *     Complex.fromPolar({r: number, phi: number}) : Complex\n   *\n   * @param {*} args...\n   * @return {Complex}\n   */\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n          if (typeof arg === 'object') {\n            return Complex(arg);\n          } else {\n            throw new TypeError('Input has to be an object with r and phi keys.');\n          }\n        }\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n          if (isNumber(r)) {\n            if (isUnit(phi) && phi.hasBase('ANGLE')) {\n              // convert unit to a number in radians\n              phi = phi.toNumber('rad');\n            }\n            if (isNumber(phi)) {\n              return new Complex({\n                r,\n                phi\n              });\n            }\n            throw new TypeError('Phi is not a number nor an angle unit.');\n          } else {\n            throw new TypeError('Radius r is not a number.');\n          }\n        }\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar');\n    }\n  };\n  Complex.prototype.valueOf = Complex.prototype.toString;\n\n  /**\n   * Create a Complex number from a JSON object\n   * @param {Object} json  A JSON Object structured as\n   *                       {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n   *                       All properties are optional, default values\n   *                       for `re` and `im` are 0.\n   * @return {Complex} Returns a new Complex number\n   */\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\n  };\n\n  /**\n   * Compare two complex numbers, `a` and `b`:\n   *\n   * - Returns 1 when the real part of `a` is larger than the real part of `b`\n   * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n   * - Returns 1 when the real parts are equal\n   *   and the imaginary part of `a` is larger than the imaginary part of `b`\n   * - Returns -1 when the real parts are equal\n   *   and the imaginary part of `a` is smaller than the imaginary part of `b`\n   * - Returns 0 when both real and imaginary parts are equal.\n   *\n   * @params {Complex} a\n   * @params {Complex} b\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n    if (a.re < b.re) {\n      return -1;\n    }\n    if (a.im > b.im) {\n      return 1;\n    }\n    if (a.im < b.im) {\n      return -1;\n    }\n    return 0;\n  };\n  return Complex;\n}, {\n  isClass: true\n});","/**\n * @license Fraction.js v4.3.0 20/08/2023\n * https://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2023, Robert Eisele (robert@raw.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <numerator>, 1 => <denominator> ]\n * [ n => <numerator>, d => <denominator> ]\n *\n * Integer form\n * - Single integer value\n *\n * Double form\n * - Single double value\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n *\n * var f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n(function(root) {\n\n  \"use strict\";\n\n  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\n  var MAX_CYCLE_LEN = 2000;\n\n  // Parsed data to avoid calling \"new\" all the time\n  var P = {\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1\n  };\n\n  function assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throw InvalidParameter();\n    }\n    return n * s;\n  }\n\n  // Creates a new Fraction internally without the need of the bulky constructor\n  function newFraction(n, d) {\n\n    if (d === 0) {\n      throw DivisionByZero();\n    }\n\n    var f = Object.create(Fraction.prototype);\n    f[\"s\"] = n < 0 ? -1 : 1;\n\n    n = n < 0 ? -n : n;\n\n    var a = gcd(n, d);\n\n    f[\"n\"] = n / a;\n    f[\"d\"] = d / a;\n    return f;\n  }\n\n  function factorize(num) {\n\n    var factors = {};\n\n    var n = num;\n    var i = 2;\n    var s = 4;\n\n    while (s <= n) {\n\n      while (n % i === 0) {\n        n/= i;\n        factors[i] = (factors[i] || 0) + 1;\n      }\n      s+= 1 + 2 * i++;\n    }\n\n    if (n !== num) {\n      if (n > 1)\n        factors[n] = (factors[n] || 0) + 1;\n    } else {\n      factors[num] = (factors[num] || 0) + 1;\n    }\n    return factors;\n  }\n\n  var parse = function(p1, p2) {\n\n    var n = 0, d = 1, s = 1;\n    var v = 0, w = 0, x = 0, y = 1, z = 1;\n\n    var A = 0, B = 1;\n    var C = 1, D = 1;\n\n    var N = 10000000;\n    var M;\n\n    if (p1 === undefined || p1 === null) {\n      /* void */\n    } else if (p2 !== undefined) {\n      n = p1;\n      d = p2;\n      s = n * d;\n\n      if (n % 1 !== 0 || d % 1 !== 0) {\n        throw NonIntegerParameter();\n      }\n\n    } else\n      switch (typeof p1) {\n\n        case \"object\":\n          {\n            if (\"d\" in p1 && \"n\" in p1) {\n              n = p1[\"n\"];\n              d = p1[\"d\"];\n              if (\"s\" in p1)\n                n*= p1[\"s\"];\n            } else if (0 in p1) {\n              n = p1[0];\n              if (1 in p1)\n                d = p1[1];\n            } else {\n              throw InvalidParameter();\n            }\n            s = n * d;\n            break;\n          }\n        case \"number\":\n          {\n            if (p1 < 0) {\n              s = p1;\n              p1 = -p1;\n            }\n\n            if (p1 % 1 === 0) {\n              n = p1;\n            } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow\n\n              if (p1 >= 1) {\n                z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));\n                p1/= z;\n              }\n\n              // Using Farey Sequences\n              // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/\n\n              while (B <= N && D <= N) {\n                M = (A + C) / (B + D);\n\n                if (p1 === M) {\n                  if (B + D <= N) {\n                    n = A + C;\n                    d = B + D;\n                  } else if (D > B) {\n                    n = C;\n                    d = D;\n                  } else {\n                    n = A;\n                    d = B;\n                  }\n                  break;\n\n                } else {\n\n                  if (p1 > M) {\n                    A+= C;\n                    B+= D;\n                  } else {\n                    C+= A;\n                    D+= B;\n                  }\n\n                  if (B > N) {\n                    n = C;\n                    d = D;\n                  } else {\n                    n = A;\n                    d = B;\n                  }\n                }\n              }\n              n*= z;\n            } else if (isNaN(p1) || isNaN(p2)) {\n              d = n = NaN;\n            }\n            break;\n          }\n        case \"string\":\n          {\n            B = p1.match(/\\d+|./g);\n\n            if (B === null)\n              throw InvalidParameter();\n\n            if (B[A] === '-') {// Check for minus sign at the beginning\n              s = -1;\n              A++;\n            } else if (B[A] === '+') {// Check for plus sign at the beginning\n              A++;\n            }\n\n            if (B.length === A + 1) { // Check if it's just a simple number \"1234\"\n              w = assign(B[A++], s);\n            } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number\n\n              if (B[A] !== '.') { // Handle 0.5 and .5\n                v = assign(B[A++], s);\n              }\n              A++;\n\n              // Check for decimal places\n              if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === \"'\" && B[A + 3] === \"'\") {\n                w = assign(B[A], s);\n                y = Math.pow(10, B[A].length);\n                A++;\n              }\n\n              // Check for repeating places\n              if (B[A] === '(' && B[A + 2] === ')' || B[A] === \"'\" && B[A + 2] === \"'\") {\n                x = assign(B[A + 1], s);\n                z = Math.pow(10, B[A + 1].length) - 1;\n                A+= 3;\n              }\n\n            } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n              w = assign(B[A], s);\n              y = assign(B[A + 2], 1);\n              A+= 3;\n            } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n              v = assign(B[A], s);\n              w = assign(B[A + 2], s);\n              y = assign(B[A + 4], 1);\n              A+= 5;\n            }\n\n            if (B.length <= A) { // Check for more tokens on the stack\n              d = y * z;\n              s = /* void */\n              n = x + d * v + z * w;\n              break;\n            }\n\n            /* Fall through on error */\n          }\n        default:\n          throw InvalidParameter();\n      }\n\n    if (d === 0) {\n      throw DivisionByZero();\n    }\n\n    P[\"s\"] = s < 0 ? -1 : 1;\n    P[\"n\"] = Math.abs(n);\n    P[\"d\"] = Math.abs(d);\n  };\n\n  function modpow(b, e, m) {\n\n    var r = 1;\n    for (; e > 0; b = (b * b) % m, e >>= 1) {\n\n      if (e & 1) {\n        r = (r * b) % m;\n      }\n    }\n    return r;\n  }\n\n\n  function cycleLen(n, d) {\n\n    for (; d % 2 === 0;\n      d/= 2) {\n    }\n\n    for (; d % 5 === 0;\n      d/= 5) {\n    }\n\n    if (d === 1) // Catch non-cyclic numbers\n      return 0;\n\n    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n    // 10^(d-1) % d == 1\n    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n    // as we want to translate the numbers to strings.\n\n    var rem = 10 % d;\n    var t = 1;\n\n    for (; rem !== 1; t++) {\n      rem = rem * 10 % d;\n\n      if (t > MAX_CYCLE_LEN)\n        return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n    }\n    return t;\n  }\n\n\n  function cycleStart(n, d, len) {\n\n    var rem1 = 1;\n    var rem2 = modpow(10, len, d);\n\n    for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n      // Solve 10^s == 10^(s+t) (mod d)\n\n      if (rem1 === rem2)\n        return t;\n\n      rem1 = rem1 * 10 % d;\n      rem2 = rem2 * 10 % d;\n    }\n    return 0;\n  }\n\n  function gcd(a, b) {\n\n    if (!a)\n      return b;\n    if (!b)\n      return a;\n\n    while (1) {\n      a%= b;\n      if (!a)\n        return b;\n      b%= a;\n      if (!b)\n        return a;\n    }\n  };\n\n  /**\n   * Module constructor\n   *\n   * @constructor\n   * @param {number|Fraction=} a\n   * @param {number=} b\n   */\n  function Fraction(a, b) {\n\n    parse(a, b);\n\n    if (this instanceof Fraction) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse variable a\n      this[\"s\"] = P[\"s\"];\n      this[\"n\"] = P[\"n\"] / a;\n      this[\"d\"] = P[\"d\"] / a;\n    } else {\n      return newFraction(P['s'] * P['n'], P['d']);\n    }\n  }\n\n  var DivisionByZero = function() { return new Error(\"Division by Zero\"); };\n  var InvalidParameter = function() { return new Error(\"Invalid argument\"); };\n  var NonIntegerParameter = function() { return new Error(\"Parameters must be integer\"); };\n\n  Fraction.prototype = {\n\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1,\n\n    /**\n     * Calculates the absolute value\n     *\n     * Ex: new Fraction(-4).abs() => 4\n     **/\n    \"abs\": function() {\n\n      return newFraction(this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Inverts the sign of the current fraction\n     *\n     * Ex: new Fraction(-4).neg() => 4\n     **/\n    \"neg\": function() {\n\n      return newFraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Adds two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n     **/\n    \"add\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Subtracts two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n     **/\n    \"sub\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Multiplies two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n     **/\n    \"mul\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n        this[\"d\"] * P[\"d\"]\n      );\n    },\n\n    /**\n     * Divides two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n     **/\n    \"div\": function(a, b) {\n\n      parse(a, b);\n      return newFraction(\n        this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n        this[\"d\"] * P[\"n\"]\n      );\n    },\n\n    /**\n     * Clones the actual object\n     *\n     * Ex: new Fraction(\"-17.(345)\").clone()\n     **/\n    \"clone\": function() {\n      return newFraction(this['s'] * this['n'], this['d']);\n    },\n\n    /**\n     * Calculates the modulo of two rational numbers - a more precise fmod\n     *\n     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n     **/\n    \"mod\": function(a, b) {\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return new Fraction(NaN);\n      }\n\n      if (a === undefined) {\n        return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        throw DivisionByZero();\n      }\n\n      /*\n       * First silly attempt, kinda slow\n       *\n       return that[\"sub\"]({\n       \"n\": num[\"n\"] * Math.floor((this.n / this.d) / (num.n / num.d)),\n       \"d\": num[\"d\"],\n       \"s\": this[\"s\"]\n       });*/\n\n      /*\n       * New attempt: a1 / b1 = a2 / b2 * q + r\n       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r\n       * => (b2 * a1 % a2 * b1) / (b1 * b2)\n       */\n      return newFraction(\n        this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n        P[\"d\"] * this[\"d\"]\n      );\n    },\n\n    /**\n     * Calculates the fractional gcd of two rational numbers\n     *\n     * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n     */\n    \"gcd\": function(a, b) {\n\n      parse(a, b);\n\n      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n      return newFraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n    },\n\n    /**\n     * Calculates the fractional lcm of two rational numbers\n     *\n     * Ex: new Fraction(5,8).lcm(3,7) => 15\n     */\n    \"lcm\": function(a, b) {\n\n      parse(a, b);\n\n      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n      if (P[\"n\"] === 0 && this[\"n\"] === 0) {\n        return newFraction(0, 1);\n      }\n      return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n    },\n\n    /**\n     * Calculates the ceil of a rational number\n     *\n     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n     **/\n    \"ceil\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.ceil(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Calculates the floor of a rational number\n     *\n     * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n     **/\n    \"floor\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.floor(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Rounds a rational numbers\n     *\n     * Ex: new Fraction('4.(3)').round() => (4 / 1)\n     **/\n    \"round\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return newFraction(Math.round(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Gets the inverse of the fraction, means numerator and denominator are exchanged\n     *\n     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n     **/\n    \"inverse\": function() {\n\n      return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some rational exponent, if possible\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(a, b) {\n\n      parse(a, b);\n\n      // Trivial case when exp is an integer\n\n      if (P['d'] === 1) {\n\n        if (P['s'] < 0) {\n          return newFraction(Math.pow(this['s'] * this[\"d\"], P['n']), Math.pow(this[\"n\"], P['n']));\n        } else {\n          return newFraction(Math.pow(this['s'] * this[\"n\"], P['n']), Math.pow(this[\"d\"], P['n']));\n        }\n      }\n\n      // Negative roots become complex\n      //     (-a/b)^(c/d) = x\n      // <=> (-1)^(c/d) * (a/b)^(c/d) = x\n      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°\n      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )\n      // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.\n      if (this['s'] < 0) return null;\n\n      // Now prime factor n and d\n      var N = factorize(this['n']);\n      var D = factorize(this['d']);\n\n      // Exponentiate and take root for n and d individually\n      var n = 1;\n      var d = 1;\n      for (var k in N) {\n        if (k === '1') continue;\n        if (k === '0') {\n          n = 0;\n          break;\n        }\n        N[k]*= P['n'];\n\n        if (N[k] % P['d'] === 0) {\n          N[k]/= P['d'];\n        } else return null;\n        n*= Math.pow(k, N[k]);\n      }\n\n      for (var k in D) {\n        if (k === '1') continue;\n        D[k]*= P['n'];\n\n        if (D[k] % P['d'] === 0) {\n          D[k]/= P['d'];\n        } else return null;\n        d*= Math.pow(k, D[k]);\n      }\n\n      if (P['s'] < 0) {\n        return newFraction(d, n);\n      }\n      return newFraction(n, d);\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"equals\": function(a, b) {\n\n      parse(a, b);\n      return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"]; // Same as compare() === 0\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"compare\": function(a, b) {\n\n      parse(a, b);\n      var t = (this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"]);\n      return (0 < t) - (t < 0);\n    },\n\n    \"simplify\": function(eps) {\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      eps = eps || 0.001;\n\n      var thisABS = this['abs']();\n      var cont = thisABS['toContinued']();\n\n      for (var i = 1; i < cont.length; i++) {\n\n        var s = newFraction(cont[i - 1], 1);\n        for (var k = i - 2; k >= 0; k--) {\n          s = s['inverse']()['add'](cont[k]);\n        }\n\n        if (Math.abs(s['sub'](thisABS).valueOf()) < eps) {\n          return s['mul'](this['s']);\n        }\n      }\n      return this;\n    },\n\n    /**\n     * Check if two rational numbers are divisible\n     *\n     * Ex: new Fraction(19.6).divisible(1.5);\n     */\n    \"divisible\": function(a, b) {\n\n      parse(a, b);\n      return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n    },\n\n    /**\n     * Returns a decimal representation of the fraction\n     *\n     * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n     **/\n    'valueOf': function() {\n\n      return this[\"s\"] * this[\"n\"] / this[\"d\"];\n    },\n\n    /**\n     * Returns a string-fraction representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toFraction(true) => \"4 1/3\"\n     **/\n    'toFraction': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str+= '-';\n      }\n\n      if (d === 1) {\n        str+= n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str+= whole;\n          str+= \" \";\n          n%= d;\n        }\n\n        str+= n;\n        str+= '/';\n        str+= d;\n      }\n      return str;\n    },\n\n    /**\n     * Returns a latex representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n     **/\n    'toLatex': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str+= '-';\n      }\n\n      if (d === 1) {\n        str+= n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str+= whole;\n          n%= d;\n        }\n\n        str+= \"\\\\frac{\";\n        str+= n;\n        str+= '}{';\n        str+= d;\n        str+= '}';\n      }\n      return str;\n    },\n\n    /**\n     * Returns an array of continued fraction elements\n     *\n     * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n     */\n    'toContinued': function() {\n\n      var t;\n      var a = this['n'];\n      var b = this['d'];\n      var res = [];\n\n      if (isNaN(a) || isNaN(b)) {\n        return res;\n      }\n\n      do {\n        res.push(Math.floor(a / b));\n        t = a % b;\n        a = b;\n        b = t;\n      } while (a !== 1);\n\n      return res;\n    },\n\n    /**\n     * Creates a string representation of a fraction with all digits\n     *\n     * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n     **/\n    'toString': function(dec) {\n\n      var N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repetation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] < 0 ? \"-\" : \"\";\n\n      str+= N / D | 0;\n\n      N%= D;\n      N*= 10;\n\n      if (N)\n        str+= \".\";\n\n      if (cycLen) {\n\n        for (var i = cycOff; i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n        str+= \"(\";\n        for (var i = cycLen; i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n        str+= \")\";\n      } else {\n        for (var i = dec; N && i--;) {\n          str+= N / D | 0;\n          N%= D;\n          N*= 10;\n        }\n      }\n      return str;\n    }\n  };\n\n  if (typeof exports === \"object\") {\n    Object.defineProperty(Fraction, \"__esModule\", { 'value': true });\n    Fraction['default'] = Fraction;\n    Fraction['Fraction'] = Fraction;\n    module['exports'] = Fraction;\n  } else {\n    root['Fraction'] = Fraction;\n  }\n\n})(this);\n","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Fraction, 'name', {\n    value: 'Fraction'\n  });\n  Fraction.prototype.constructor = Fraction;\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\n\n  /**\n   * Get a JSON representation of a Fraction containing type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n   */\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\n    };\n  };\n\n  /**\n   * Instantiate a Fraction from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n   * @return {BigNumber}\n   */\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n  return Fraction;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @return {string}           The storage format.\n   */\n  Matrix.prototype.storage = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke storage on a Matrix interface');\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @return {string}           The datatype.\n   */\n  Matrix.prototype.datatype = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke datatype on a Matrix interface');\n  };\n\n  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  Matrix.prototype.subset = function (index, replacement, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke subset on a Matrix interface');\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  Matrix.prototype.get = function (index) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke get on a Matrix interface');\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {Matrix} self\n   */\n  Matrix.prototype.set = function (index, value, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke set on a Matrix interface');\n  };\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  Matrix.prototype.resize = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke resize on a Matrix interface');\n  };\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  Matrix.prototype.reshape = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke reshape on a Matrix interface');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n  Matrix.prototype.clone = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke clone on a Matrix interface');\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n  Matrix.prototype.size = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke size on a Matrix interface');\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {Matrix} matrix\n   */\n  Matrix.prototype.map = function (callback, skipZeros) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke map on a Matrix interface');\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  Matrix.prototype.forEach = function (callback) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke forEach on a Matrix interface');\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  Matrix.prototype[Symbol.iterator] = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot iterate a Matrix interface');\n  };\n\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n  Matrix.prototype.toArray = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toArray on a Matrix interface');\n  };\n\n  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n  Matrix.prototype.valueOf = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke valueOf on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  Matrix.prototype.format = function (options) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke format on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n  Matrix.prototype.toString = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toString on a Matrix interface');\n  };\n  return Matrix;\n}, {\n  isClass: true\n});","import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n    suffix = \"i\".concat(size);\n  }\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\n  }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lower` and `upper` bounds, and uses\n *                                          exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'\n *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'\n *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  }\n  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize);\n    case 'auto':\n      {\n        // determine lower and upper bound for exponential notation.\n        // TODO: implement support for upper and lower to be BigNumbers themselves\n        var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n        var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n\n        // handle special case zero\n        if (value.isZero()) return '0';\n\n        // determine whether or not to output exponential notation\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n        if (exp >= lowerExp && exp < upperExp) {\n          // normal number notation\n          str = rounded.toFixed();\n        } else {\n          // exponential notation\n          str = toExponential(value, precision);\n        }\n\n        // remove trailing zeros after the decimal point\n        return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          var digits = arguments[2];\n          var e = arguments[4];\n          return digits !== '.' ? digits + e : e;\n        });\n      }\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n  // find difference in exponents, and calculate the value without exponent\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n  if (valueStr.includes('e')) {\n    var BigNumber = value.constructor;\n    valueStr = new BigNumber(valueStr).toFixed();\n  }\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n * @returns {string} str\n */\nexport function toExponential(value, precision) {\n  if (precision !== undefined) {\n    return value.toExponential(precision - 1); // Note the offset of one\n  } else {\n    return value.toExponential();\n  }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n *                                       decimal point. Undefined by default.\n */\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *     math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n *   syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n *   function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n *   and the result is returned.\n * - In other cases the function will loop over all object properties and\n *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n *     math.format(2/7)                // '0.2857142857142857'\n *     math.format(math.pi, 3)         // '3.14'\n *     math.format(new Complex(2, 3))  // '2 + 3i'\n *     math.format('hello')            // '\"hello\"'\n *\n * @param {*} value             Value to be stringified\n * @param {Object | number | Function} [options]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n  var result = _format(value, options);\n  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...';\n  }\n  return result;\n}\nfunction _format(value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options);\n  }\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options);\n  }\n\n  // note: we use unsafe duck-typing here to check for Fractions, this is\n  // ok here since we're only invoking toString or concatenating its values\n  if (looksLikeFraction(value)) {\n    if (!options || options.fraction !== 'decimal') {\n      // output as ratio, like '1/3'\n      return value.s * value.n + '/' + value.d;\n    } else {\n      // output as decimal, like '0.(3)'\n      return value.toString();\n    }\n  }\n  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n  if (isString(value)) {\n    return stringify(value);\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n  if (value && typeof value === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options);\n    } else if (value && value.toString(options) !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString(options);\n    } else {\n      var entries = Object.keys(value).map(key => {\n        return stringify(key) + ': ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n  return String(value);\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n  while (i < text.length) {\n    var c = text.charAt(i);\n    escaped += c in controlCharacters ? controlCharacters[c] : c;\n    i++;\n  }\n  return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @returns {string} str\n */\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n      str += formatArray(array[i], options);\n    }\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n  return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n  return x === y ? 0 : x > y ? 1 : -1;\n}","/**\n * Create a range error with the message:\n *     'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual        The actual size\n * @param {number | number[]} expected      The expected size\n * @param {string} [relation='!=']          Optional relation between actual\n *                                          and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.actual = actual;\n  this.expected = expected;\n  this.relation = relation;\n  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.index = index;\n  if (arguments.length < 3) {\n    this.min = 0;\n    this.max = min;\n  } else {\n    this.min = min;\n    this.max = max;\n  }\n  if (this.min !== undefined && this.index < this.min) {\n    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n  } else if (this.max !== undefined && this.index >= this.max) {\n    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n  } else {\n    this.message = 'Index out of range (' + this.index + ')';\n  }\n  this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @Return {Number[]} size\n */\nexport function arraySize(x) {\n  var s = [];\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n  return s;\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @param {number} dim   Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim]);\n  }\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\n      }\n      _validate(array[i], size, dimNext);\n    }\n  } else {\n    // last dimension. none of the childs may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new DimensionError(size.length + 1, size.length, '>');\n      }\n    }\n  }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new DimensionError(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} array    Array to be validated\n * @param {Index} index  Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n  var valueSize = value.isMatrix ? value._size : arraySize(value);\n  var sourceSize = index._sourceSize;\n  // checks if the source size is not null and matches the valueSize\n  sourceSize.forEach((sourceDim, i) => {\n    if (sourceDim !== null && sourceDim !== valueSize[i]) {\n      throw new DimensionError(sourceDim, valueSize[i]);\n    }\n  });\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index    Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex(index, length) {\n  if (index !== undefined) {\n    if (!isNumber(index) || !isInteger(index)) {\n      throw new TypeError('Index must be an integer (value: ' + index + ')');\n    }\n    if (index < 0 || typeof length === 'number' && index >= length) {\n      throw new IndexError(index, length);\n    }\n  }\n}\n\n/**\n * Test if and index has empty values\n * @param {number} index    Zero-based index\n */\nexport function isEmptyIndex(index) {\n  for (var i = 0; i < index._dimensions.length; ++i) {\n    var dimension = index._dimensions[i];\n    if (dimension._data && isArray(dimension._data)) {\n      if (dimension._size[0] === 0) {\n        return true;\n      }\n    } else if (dimension.isRange) {\n      if (dimension.start === dimension.end) {\n        return true;\n      }\n    } else if (isString(dimension)) {\n      if (dimension.length === 0) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array         Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled in in new entries,\n *                              zero by default. Specify for example `null`,\n *                              to clearly see entries that are not explicitly\n *                              set.\n * @return {Array} array         The resized array\n */\nexport function resize(array, size, defaultValue) {\n  // check the type of the arguments\n  if (!Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  }\n\n  // check whether size contains positive integers\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  });\n\n  // convert number to an array\n  if (isNumber(array) || isBigNumber(array)) {\n    array = [array];\n  }\n\n  // recursively resize the array\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n  _resize(array, size, 0, _defaultValue);\n  return array;\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array         Array to be resized\n * @param {number[]} size       Array with the size of each dimension\n * @param {number} dim          Current dimension\n * @param {*} [defaultValue]    Value to be filled in in new entries,\n *                              undefined by default.\n * @private\n */\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen);\n\n  // apply new length\n  array.length = newLen;\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1;\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n        array[i] = elem;\n      }\n      _resize(elem, size, dimNext, defaultValue);\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem;\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n\n    // remove dimensions of existing values\n    for (i = 0; i < minLen; i++) {\n      while (Array.isArray(array[i])) {\n        array[i] = array[i][0];\n      }\n    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\n  }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes        List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n *\n * @throws {DimensionError}       If the product of the new dimension sizes does\n *                                not equal that of the old ones\n */\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var currentLength = flatArray.length;\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes  List of sizes for each dimension. At most on wildcard.\n * @param {number} currentLength  Number of elements in the array.\n * @throws {Error}                If more than one wildcard or unable to replace it.\n * @returns {number[]}      The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n  var hasWildcard = wildCardIndex >= 0;\n  var canReplaceWildcard = currentLength % newLength === 0;\n  if (hasWildcard) {\n    if (canReplaceWildcard) {\n      processedSizes[wildCardIndex] = -currentLength / newLength;\n    } else {\n      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n    }\n  }\n  return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n */\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2;\n  // for each dimensions starting by the last one and ignoring the first one\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = [];\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    var length = tmpArray.length / size;\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2;\n  }\n  return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n  var s = size || arraySize(array);\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  }\n\n  // find the first dimension to be squeezed\n  var dims = s.length;\n  while (s[dims - 1] === 1) {\n    dims--;\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n  return array;\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n  if (dim < dims) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _squeeze(array[i], dims, next);\n    }\n  } else {\n    while (Array.isArray(array)) {\n      array = array[0];\n    }\n  }\n  return array;\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Paramter `size` will be mutated to match the new, unqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims       Desired number of dimensions of the array\n * @param {number} [outer]    Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array);\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0);\n  while (s.length < dims) {\n    s.push(1);\n  }\n  return array;\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n  return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array   A multi dimensional array\n * @return {Array}        The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n  var flat = [];\n  array.forEach(function callback(value) {\n    if (Array.isArray(value)) {\n      value.forEach(callback); // traverse through sub-arrays recursively\n    } else {\n      flat.push(value);\n    }\n  });\n  return flat;\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, callback);\n}\n\n/**\n * Filter values in a callback given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp(array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a  An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n  return b;\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a  An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n  return b;\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf   Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\n  var length = 0; // to hold length value to ensure it has consistent sizes\n\n  for (var i = 0; i < array.length; i++) {\n    var item = array[i];\n    var _isArray = Array.isArray(item);\n\n    // Saving the target matrix row size\n    if (i === 0 && _isArray) {\n      length = item.length;\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (_isArray && item.length !== length) {\n      return undefined;\n    }\n    var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n    : typeOf(item);\n    if (type === undefined) {\n      type = itemType; // first item\n    } else if (type !== itemType) {\n      return 'mixed';\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n  return type;\n}\n\n/**\n * Return the last item from an array\n * @param {array}\n * @returns {*}\n */\nexport function last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {array}\n * @returns {*}\n */\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices is not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\nfunction concatRecursive(a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length);\n    }\n    var c = [];\n    for (var i = 0; i < a.length; i++) {\n      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n    }\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns\n*/\nexport function concat() {\n  var arrays = Array.prototype.slice.call(arguments, 0, -1);\n  var concatDim = Array.prototype.slice.call(arguments, -1);\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  if (arrays.length > 1) {\n    return arrays.slice(1).reduce(function (A, B) {\n      return concatRecursive(A, B, concatDim, 0);\n    }, arrays[0]);\n  } else {\n    throw new Error('Wrong number of arguments in function concat');\n  }\n}\n\n/**\n * Receives two or more sizes and get's the broadcasted size for both.\n * @param  {...number[]} sizes Sizes to broadcast together\n * @returns\n */\nexport function broadcastSizes() {\n  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n    sizes[_key] = arguments[_key];\n  }\n  var dimensions = sizes.map(s => s.length);\n  var N = Math.max(...dimensions);\n  var sizeMax = new Array(N).fill(null);\n  // check for every size\n  for (var i = 0; i < sizes.length; i++) {\n    var size = sizes[i];\n    var dim = dimensions[i];\n    for (var j = 0; j < dim; j++) {\n      var n = N - dim + j;\n      if (size[j] > sizeMax[n]) {\n        sizeMax[n] = size[j];\n      }\n    }\n  }\n  for (var _i = 0; _i < sizes.length; _i++) {\n    checkBroadcastingRules(sizes[_i], sizeMax);\n  }\n  return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n  var N = toSize.length;\n  var dim = size.length;\n  for (var j = 0; j < dim; j++) {\n    var n = N - dim + j;\n    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n      throw new Error(\"shape missmatch: missmatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n    }\n  }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n  var Asize = arraySize(array);\n  if (deepStrictEqual(Asize, toSize)) {\n    return array;\n  }\n  checkBroadcastingRules(Asize, toSize);\n  var broadcastedSize = broadcastSizes(Asize, toSize);\n  var N = broadcastedSize.length;\n  var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n  var A = clone(array);\n  // reshape A if needed to make it ready for concat\n  if (Asize.length < N) {\n    A = reshape(A, paddedSize);\n    Asize = arraySize(A);\n  }\n\n  // stretches the array on each dimension to make it the same size as index\n  for (var dim = 0; dim < N; dim++) {\n    if (Asize[dim] < broadcastedSize[dim]) {\n      A = stretch(A, broadcastedSize[dim], dim);\n      Asize = arraySize(A);\n    }\n  }\n  return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param  {...Array | any} arrays\n * @returns\n */\nexport function broadcastArrays() {\n  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    arrays[_key2] = arguments[_key2];\n  }\n  if (arrays.length === 0) {\n    throw new Error('Insuficient number of argumnets in function broadcastArrays');\n  }\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  var sizes = arrays.map(function (array) {\n    return arraySize(array);\n  });\n  var broadcastedSize = broadcastSizes(...sizes);\n  var broadcastedArrays = [];\n  arrays.forEach(function (array) {\n    broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n  });\n  return broadcastedArrays;\n}\n\n/**\n * stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns cloned array\n */\nexport function clone(array) {\n  return _extends([], array);\n}","// function utils\n\nimport { lruQueue } from './lruQueue.js';\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn                     The function to be memoized.\n *                                          Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n *    A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n *    Maximum number of values that may be cached. Undefined indicates\n *    unlimited (default)\n * @return {function}                       Returns the memoized function\n */\nexport function memoize(fn) {\n  var {\n    hasher,\n    limit\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n      };\n    }\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    var hash = hasher(args);\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash);\n      return memoize.cache.values.get(hash);\n    }\n    var newVal = fn.apply(fn, args);\n    memoize.cache.values.set(hash, newVal);\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n    return newVal;\n  };\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nexport function memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var cached = memoize.cache[c];\n      if (isEqual(args, cached.args)) {\n        // TODO: move this cache entry to the top so recently used entries move up?\n        return cached.res;\n      }\n    }\n    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args,\n      res\n    });\n    return res;\n  };\n  memoize.cache = [];\n  return memoize;\n}\n\n/**\n * Find the maximum number of arguments expected by a typed function.\n * @param {function} fn   A typed function\n * @return {number} Returns the maximum number of expected arguments.\n *                  Returns -1 when no signatures where found on the function.\n */\nexport function maxArgumentCount(fn) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n}","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo } from '../../utils/array.js';\nimport { format } from '../../utils/string.js';\nimport { isInteger } from '../../utils/number.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix\n  } = _ref;\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   * @enum {{ value, index: number[] }}\n   */\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = clone(data._data);\n        this._size = clone(data._size);\n        this._datatype = datatype || data._datatype;\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray();\n        this._size = data.size();\n        this._datatype = datatype || data._datatype;\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      // verify the dimensions of the array\n      validate(this._data, this._size);\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data);\n      // get the dimensions of the array\n      this._size = arraySize(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      validate(this._data, this._size);\n      // data type unknown\n      this._datatype = datatype;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n    }\n  }\n  DenseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', {\n    value: 'DenseMatrix'\n  });\n  DenseMatrix.prototype.constructor = DenseMatrix;\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf DenseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()  // retrieve storage format\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The storage format.\n   */\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()   // retrieve matrix datatype\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The datatype.\n   */\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof DenseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check index\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n    var data = this._data;\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n    return data;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {DenseMatrix} self\n   */\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n    var i, ii, indexI;\n\n    // enlarge matrix when needed\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n    _fit(this, size, defaultValue);\n\n    // traverse over the dimensions\n    var data = this._data;\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\n\n  /**\n   * Get a submatrix of this matrix\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index   Zero-based index\n   * @private\n   */\n  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = index.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      }\n\n      // validate if any of the ranges in the index is out of range\n      var min = index.min();\n      var max = index.max();\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      }\n\n      // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n    }\n  }\n\n  /**\n   * Recursively get a submatrix of a multi dimensional matrix.\n   * Index is not checked for correct number or length of dimensions.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim    Current dimension\n   * @return {Array} submatrix\n   * @private\n   */\n  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        return data[i];\n      }).valueOf();\n    } else {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\n    }\n  }\n\n  /**\n   * Replace a submatrix in this matrix\n   * Indexes are zero-based.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index\n   * @param {DenseMatrix | Array | *} submatrix\n   * @param {*} defaultValue          Default value, filled in on new entries when\n   *                                  the matrix is resized.\n   * @return {DenseMatrix} matrix\n   * @private\n   */\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(sSize, iSize)) {\n        try {\n          if (sSize.length === 0) {\n            submatrix = broadcastTo([submatrix], iSize);\n          } else {\n            submatrix = broadcastTo(submatrix, iSize);\n          }\n          sSize = arraySize(submatrix);\n        } catch (_unused) {}\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // enlarge matrix when needed\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n      _fit(matrix, size, defaultValue);\n\n      // insert the sub matrix\n      var dims = iSize.length;\n      var dim = 0;\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n    return matrix;\n  }\n\n  /**\n   * Replace a submatrix of a multi dimensional matrix.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {Array} submatrix\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim\n   * @private\n   */\n  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n        data[dataIndex] = submatrix[subIndex[0]];\n      });\n    } else {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n      });\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof DenseMatrix\n   * @param {number[] || Matrix} size The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue);\n  };\n  function _resize(matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      var v = matrix._data;\n      // go deep\n      while (isArray(v)) {\n        v = v[0];\n      }\n      return v;\n    }\n    // resize matrix\n    matrix._size = size.slice(0); // copy the array\n    matrix._data = resize(matrix._data, matrix._size, defaultValue);\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n    var currentLength = m._size.reduce((length, size) => length * size);\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\n  };\n\n  /**\n   * Enlarge the matrix when it is smaller than given size.\n   * If the matrix is larger or equal sized, nothing is done.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix           The matrix to be resized\n   * @param {number[]} size\n   * @param {*} defaultValue          Default value, filled in on new entries.\n   * @private\n   */\n  function _fit(matrix, size, defaultValue) {\n    var\n    // copy the array\n    newSize = matrix._size.slice(0);\n    var changed = false;\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    }\n\n    // enlarge size when needed\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   *\n   * @return {DenseMatrix} matrix\n   */\n  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n    var args = maxArgumentCount(callback);\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i));\n        });\n      } else {\n        // invoke the callback function with the right number of arguments\n        if (args === 1) {\n          return callback(value);\n        } else if (args === 2) {\n          return callback(value, index);\n        } else {\n          // 3 or -1\n          return callback(value, index, me);\n        }\n      }\n    };\n\n    // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\n    var data = recurse(this._data, []);\n    var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        value.forEach(function (child, i) {\n          recurse(child, index.concat(i));\n        });\n      } else {\n        callback(value, index, me);\n      }\n    };\n    recurse(this._data, []);\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = function* () {\n    var recurse = function* recurse(value, index) {\n      if (isArray(value)) {\n        for (var i = 0; i < value.length; i++) {\n          yield* recurse(value[i], index.concat(i));\n        }\n      } else {\n        yield {\n          value,\n          index\n        };\n      }\n    };\n    yield* recurse(this._data, []);\n  };\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    for (var row of data) {\n      result.push(new DenseMatrix([row], this._datatype));\n    }\n    return result;\n  };\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    var _this = this;\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _loop = function _loop(i) {\n      var col = data.map(row => [row[i]]);\n      result.push(new DenseMatrix(col, _this._datatype));\n    };\n    for (var i = 0; i < s[1]; i++) {\n      _loop(i);\n    }\n    return result;\n  };\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof DenseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n  DenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'DenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof DenseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix with the diagonal values.\n   */\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // x is a matrix get diagonal from matrix\n    var data = [];\n\n    // loop rows\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [n],\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                     The matrix size.\n   * @param {number | Matrix | Array } value The values for the diagonal.\n   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]          The default value for non-diagonal\n   * @param {string} [datatype]              The datatype for the diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // discover default value if needed\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    }\n\n    // empty array\n    var data = [];\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue);\n      // fill diagonal\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof DenseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Swap rows i and j in Dense Matrix data structure.\n   *\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   * @param {Array} data     Matrix data\n   */\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n\n  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array | Matrix} data\n   * @return {Array} data\n   */\n  function preprocess(data) {\n    if (isMatrix(data)) {\n      return preprocess(data.valueOf());\n    }\n    if (isArray(data)) {\n      return data.map(preprocess);\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});","/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nexport function _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n    ret.push(tmp);\n  }\n  return ret;\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\nimport { _switch } from './switch.js';\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n *                    collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback     The callback method is invoked with one\n *                                parameter: the current element in the array\n */\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\n    }\n  }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback   The callback is called with two parameters:\n *                              value1 and value2, which contain the current\n *                              element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap(array, callback, skipZeros) {\n  if (array && typeof array.map === 'function') {\n    // TODO: replace array.map with a for loop to improve performance\n    return array.map(function (x) {\n      return deepMap(x, callback, skipZeros);\n    });\n  } else {\n    return callback(array);\n  }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n  if (dim < 0 || dim >= size.length) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new IndexError(dim, size.length);\n  }\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback));\n  } else {\n    return _reduce(mat, dim, callback);\n  }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n// TODO: document function scatter\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n\n  // vars\n  var k, k0, k1, i;\n\n  // check we need to process values (pattern matrix)\n  if (x) {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n          // function was called on current row\n          u[i] = mark;\n        } else {\n          // copy value to workspace\n          x[i] = avalues[k];\n        }\n      } else {\n        // i exists in C already\n        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);\n        // function was called on current row\n        u[i] = mark;\n      }\n    }\n  } else {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { deepMap } from '../../utils/collection.js';\nimport { isInteger as isIntegerNumber } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i'))  // throws an error\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isIntegerNumber,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n\n    BigNumber: function BigNumber(x) {\n      return x.isInt();\n    },\n    Fraction: function Fraction(x) {\n      return x.d === 1 && isFinite(x.n);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return expm1(x);\n}\nexpm1Number.signature = n1;\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  var r;\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers');\n  }\n  if (a === 0 || b === 0) {\n    return 0;\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  var t;\n  var prod = a * b;\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n  if (y) {\n    return Math.log(x) / Math.log(y);\n  }\n  return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\n  // We don't use JavaScript's % operator here as this doesn't work\n  // correctly for x < 0 and x === 0\n  // see https://en.wikipedia.org/wiki/Modulo_operation\n  return y === 0 ? x : x - y * Math.floor(x / y);\n}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var inv = root < 0;\n  if (inv) {\n    root = -root;\n  }\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n  var x = Math.pow(Math.abs(a), 1 / root);\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x;\n\n  // Very nice algorithm, but fails with nthRoot(-2, 3).\n  // Newton's method has some well-known problems at times:\n  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n  var q; // quotient\n  var r; // remainder\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var lasty = 0;\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers');\n  }\n  while (b) {\n    q = Math.floor(a / b);\n    r = a - q * b;\n    t = x;\n    x = lastx - q * x;\n    lastx = t;\n    t = y;\n    y = lasty - q * y;\n    lasty = t;\n    a = b;\n    b = r;\n  }\n  var res;\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n  return res;\n}\nxgcdNumber.signature = n2;\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n  }\n  return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","/**\n * Compares two BigNumbers.\n * @param {BigNumber} x       First value to compare\n * @param {BigNumber} y       Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n */\nexport function nearlyEqual(x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x.eq(y);\n  }\n\n  // use \"==\" operator, handles infinities\n  if (x.eq(y)) {\n    return true;\n  }\n\n  // NaN\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  }\n\n  // at this point x and y should be finite\n  if (x.isFinite() && y.isFinite()) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = x.minus(y).abs();\n    if (diff.isZero()) {\n      return true;\n    } else {\n      // use relative error\n      var max = x.constructor.max(x.abs(), y.abs());\n      return diff.lte(max.times(epsilon));\n    }\n  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}","import { nearlyEqual } from './number.js';\n\n/**\n * Test whether two complex values are equal provided a given epsilon.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x\n * @param {Complex} y\n * @param {number} epsilon\n * @returns {boolean}\n */\nexport function complexEquals(x, y, epsilon) {\n  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","import { factory } from '../../utils/factory.js';\nexport var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);\n    })\n  };\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { complexEquals } from '../../utils/complex.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return complexEquals(x, y, config.epsilon);\n    }\n  }, compareUnits);\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n  /**\n   * Sparse Matrix implementation. This type implements\n   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n   * format for two-dimensional sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values;\n      this._index = data.index;\n      this._ptr = data.ptr;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype);\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._values = [];\n      this._index = [];\n      this._ptr = [0];\n      this._size = [0, 0];\n      this._datatype = datatype;\n    }\n  }\n  function _createFromMatrix(matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? clone(source._values) : undefined;\n      matrix._index = clone(source._index);\n      matrix._ptr = clone(source._ptr);\n      matrix._size = clone(source._size);\n      matrix._datatype = datatype || source._datatype;\n    } else {\n      // build from matrix data\n      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);\n    }\n  }\n  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype;\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    var rows = data.length;\n    var columns = 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      var j = 0;\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length);\n        // loop rows\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i];\n          // check row is an array\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            }\n            // check row has column\n            if (j < row.length) {\n              // value\n              var v = row[j];\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v);\n                // index\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row);\n              // index\n              matrix._index.push(i);\n            }\n          }\n        }\n        // increment index\n        j++;\n      } while (j < columns);\n    }\n    // store number of values in ptr\n    matrix._ptr.push(matrix._index.length);\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The storage format.\n   */\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The datatype.\n   */\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Get the matrix density.\n   *\n   * Usage:\n   *     const density = matrix.density()                   // retrieve matrix density\n   *\n   * @memberof SparseMatrix\n   * @return {number}           The matrix density.\n   */\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // calculate density\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof SparseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = idx.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    }\n    // validate dimensions\n    var size = idx.size();\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    }\n\n    // vars\n    var i, ii, k, kk;\n\n    // validate if any of the ranges in the index is out of range\n    var min = idx.min();\n    var max = idx.max();\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      validateIndex(min[i], matrix._size[i]);\n      validateIndex(max[i], matrix._size[i]);\n    }\n\n    // matrix arrays\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr;\n\n    // rows & columns dimensions for result matrix\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1);\n\n    // workspace & permutation vector\n    var w = [];\n    var pv = [];\n\n    // loop rows in resulting matrix\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    });\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    });\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size,\n      datatype: matrix._datatype\n    });\n  }\n  function _setsubset(matrix, index, submatrix, defaultValue) {\n    // check index\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size();\n      // use array representation\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      // set value\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // validate dimensions, index size must be one or two dimensions\n      if (iSize.length !== 1 && iSize.length !== 2) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // insert the sub matrix\n      if (iSize.length === 1) {\n        // if the replacement index only has 1 dimension, go trough each one and set its value\n        var range = index.dimension(0);\n        range.forEach(function (dataIndex, subIndex) {\n          validateIndex(dataIndex);\n          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);\n        });\n      } else {\n        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n        var firstDimensionRange = index.dimension(0);\n        var secondDimensionRange = index.dimension(1);\n        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n          validateIndex(firstDataIndex);\n          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n            validateIndex(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // check i, j are valid\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n    return 0;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} v\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be set to zero.\n   * @return {SparseMatrix} self\n   */\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype);\n    }\n\n    // check we need to resize matrix\n    if (i > rows - 1 || j > columns - 1) {\n      // resize matrix\n      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue);\n      // update rows & columns\n      rows = this._size[0];\n      columns = this._size[1];\n    }\n\n    // check i, j are valid\n    validateIndex(i, rows);\n    validateIndex(j, columns);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      // check value != 0\n      if (!eq(v, zero)) {\n        // update value\n        this._values[k] = v;\n      } else {\n        // remove value from matrix\n        _remove(k, j, this._values, this._index, this._ptr);\n      }\n    } else {\n      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr);\n      }\n    }\n    return this;\n  };\n  function _getValueIndex(i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) {\n      return bottom;\n    }\n    // loop rows [top, bottom[\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    }\n    // we did not find row\n    return top;\n  }\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1);\n    // update pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v);\n    // update row for k\n    index.splice(k, 0, i);\n    // update column pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof SparseMatrix\n   * @param {number[] | Matrix} size  The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // check sizes\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n      }\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n  };\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype);\n    }\n\n    // should we insert the value?\n    var ins = !eq(value, zero);\n\n    // old columns and rows\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k;\n\n    // check we need to increase columns\n    if (columns > c) {\n      // loop new columns\n      for (j = c; j < columns; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._values.length;\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value);\n            // update matrix._index\n            matrix._index.push(i);\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns);\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    }\n    // update columns\n    c = columns;\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0;\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n;\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n;\n          // pointer\n          var p = 0;\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value);\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i);\n            // increment inserts\n            n++;\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0;\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d;\n        // where matrix._values start for next column\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d;\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k];\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1);\n            // remove item from matrix._index\n            matrix._index.splice(k, 1);\n            // increase deletes\n            d++;\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length;\n    }\n    // update matrix._size\n    matrix._size[0] = rows;\n    matrix._size[1] = columns;\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} sizes          The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    }\n\n    // check sizes\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = processSizesWildcard(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1];\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    }\n\n    // matrix to reshape\n    var m = copy ? this.clone() : this;\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    }\n\n    // Convert to COO format (generate a column index)\n    var colIndex = [];\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    }\n\n    // Clone the values array\n    var values = m._values.slice();\n\n    // Clone the row index array\n    var rowIndex = m._index.slice();\n\n    // Transform the (row, column) indices\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    }\n\n    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n    // sorting several arrays based on some other array.\n\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    }\n\n    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n    // This step is probably the most time-consuming\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m;\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {SparseMatrix} matrix\n   */\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // invoke callback\n    var args = maxArgumentCount(callback);\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      if (args === 1) return callback(v);\n      if (args === 2) return callback(v, [i, j]);\n      return callback(v, [i, j], me);\n    };\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on the interval\n   * [minRow..maxRow, minColumn..maxColumn].\n   */\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n    }\n\n    // invoke callback\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y);\n      // check value != 0\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v);\n        // index\n        index.push(x);\n      }\n    };\n    // loop columns\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k];\n          // check i is in range\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    }\n\n    // store number of values in ptr\n    ptr.push(values.length);\n    // return sparse matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    });\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *                              If false, the indices are guaranteed to be in order,\n   *                              if true, the indices can be unordered.\n   */\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k];\n\n          // value @ k\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          callback(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n\n  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = function* () {\n    if (!this._values) {\n      throw new Error('Cannot iterate a Pattern only matrix');\n    }\n    var columns = this._size[1];\n    for (var j = 0; j < columns; j++) {\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        yield {\n          value: this._values[k],\n          index: [i, j]\n        };\n      }\n    }\n  };\n\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n    // result\n    var a = [];\n    // vars\n    var i, j;\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    }\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k];\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n    return a;\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof SparseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // density\n    var density = this.density();\n    // rows & columns\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n';\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        // append value\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n  SparseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'SparseMatrix',\n      values: this._values,\n      index: this._index,\n      ptr: this._ptr,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof SparseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix vector with the diagonal values.\n   */\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // diagonal arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n    // initial ptr value\n    ptr[0] = 0;\n    // loop columns\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop x within [k0, k1[\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x];\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]);\n          // store row\n          index[values.length - 1] = i - kSub;\n          // exit loop\n          break;\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length);\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [n, 1]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof SparseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n   *                       where mathjs is optional\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {Array} size                       The matrix size.\n   * @param {number | Array | Matrix } value   The values for the diagonal.\n   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]            The default value for non-diagonal\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // create arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // loop items\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length);\n      // diagonal index\n      var i = j - kSuper;\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i);\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub);\n          // add value\n          values.push(v);\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length);\n    // create SparseMatrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Loop rows with data in column j.\n   *\n   * @param {number} j            Column\n   * @param {Array} values        Matrix values\n   * @param {Array} index         Matrix row indeces\n   * @param {Array} ptr           Matrix column pointers\n   * @param {Function} callback   Callback function invoked for every row in column j\n   */\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1];\n    // loop\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\n  };\n\n  /**\n   * Swap rows x and y in Sparse Matrix data structures.\n   *\n   * @param {number} x         Matrix row index 1\n   * @param {number} y         Matrix row index 2\n   * @param {number} columns   Number of columns in matrix\n   * @param {Array} values     Matrix values\n   * @param {Array} index      Matrix row indeces\n   * @param {Array} ptr        Matrix column pointers\n   */\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // find value index @ x\n      var kx = _getValueIndex(x, k0, k1, index);\n      // find value index @ x\n      var ky = _getValueIndex(y, k0, k1, index);\n      // check both rows exist in matrix\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        }\n        // next column\n        continue;\n      }\n      // check x row exist & no y row\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined;\n        // insert value @ y\n        index.splice(ky, 0, y);\n        if (values) {\n          values.splice(ky, 0, vx);\n        }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        }\n        // next column\n        continue;\n      }\n      // check y row exist & no x row\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined;\n        // insert value @ x\n        index.splice(kx, 0, x);\n        if (values) {\n          values.splice(kx, 0, vy);\n        }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n  if (nonDecimalWithRadixMatch) {\n    var radix = {\n      '0b': 2,\n      '0o': 8,\n      '0x': 16\n    }[nonDecimalWithRadixMatch[1]];\n    var integerPart = nonDecimalWithRadixMatch[2];\n    var fractionalPart = nonDecimalWithRadixMatch[3];\n    return {\n      input,\n      radix,\n      integerPart,\n      fractionalPart\n    };\n  } else {\n    return null;\n  }\n}\n\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\n  for (var i = 0; i < parts.fractionalPart.length; i++) {\n    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n    f += digitValue / Math.pow(parts.radix, i + 1);\n  }\n  var result = n + f;\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is not a valid number');\n  }\n  return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Create a number or convert a string, boolean, or unit to a number.\n   * When value is a matrix, all elements will be converted to number.\n   *\n   * Syntax:\n   *\n   *    math.number(value)\n   *    math.number(unit, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.number(2)                         // returns number 2\n   *    math.number('7.2')                     // returns number 7.2\n   *    math.number(true)                      // returns number 1\n   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n   *    math.number(math.unit('52cm'), 'm')    // returns 0.52\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted\n   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n   * @return {number | Array | Matrix} The created number\n   */\n  var number = typed('number', {\n    '': function _() {\n      return 0;\n    },\n    number: function number(x) {\n      return x;\n    },\n    string: function string(x) {\n      if (x === 'NaN') return NaN;\n      var nonDecimalNumberParts = getNonDecimalNumberParts(x);\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x includes a size suffix like 0xffffi32, so we extract\n        // the suffix and remove it from x\n        size = Number(wordSizeSuffixMatch[2]);\n        x = wordSizeSuffixMatch[1];\n      }\n      var num = Number(x);\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is not a valid number');\n      }\n      if (wordSizeSuffixMatch) {\n        // x is a signed bin, oct, or hex literal\n        // num is the value of string x if x is interpreted as unsigned\n        if (num > 2 ** size - 1) {\n          // literal is too large for size suffix\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\n        }\n      }\n      return num;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toNumber();\n    },\n    Fraction: function Fraction(x) {\n      return x.valueOf();\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    null: function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"number\",\"value\":\"2.3\"}\n  //\n  // into a number 2.3\n  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n  return number;\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber\n  } = _ref;\n  /**\n   * Create a BigNumber, which can store numbers with arbitrary precision.\n   * When a matrix is provided, all elements will be converted to BigNumber.\n   *\n   * Syntax:\n   *\n   *    math.bignumber(x)\n   *\n   * Examples:\n   *\n   *    0.1 + 0.2                                  // returns number 0.30000000000000004\n   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3\n   *\n   *\n   *    7.2e500                                    // returns number Infinity\n   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500\n   *\n   * See also:\n   *\n   *    boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value]  Value for the big number,\n   *                                                    0 by default.\n   * @returns {BigNumber} The created bignumber\n   */\n  return typed('bignumber', {\n    '': function _() {\n      return new BigNumber(0);\n    },\n    number: function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '');\n    },\n    string: function string(x) {\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        var size = wordSizeSuffixMatch[2];\n        var n = BigNumber(wordSizeSuffixMatch[1]);\n        var twoPowSize = new BigNumber(2).pow(Number(size));\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return n;\n        }\n      }\n      return new BigNumber(x);\n    },\n    BigNumber: function BigNumber(x) {\n      // we assume a BigNumber is immutable\n      return x;\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Fraction: function Fraction(x) {\n      return new BigNumber(x.n).div(x.d).times(x.s);\n    },\n    null: function _null(x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Fraction\n  } = _ref;\n  /**\n   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Unit | Array | Matrix} [args]\n   *            Arguments specifying the value, or numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function number(x) {\n      if (!isFinite(x) || isNaN(x)) {\n        throw new Error(x + ' cannot be represented as a fraction');\n      }\n      return new Fraction(x);\n    },\n    string: function string(x) {\n      return new Fraction(x);\n    },\n    'number, number': function numberNumber(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    null: function _null(x) {\n      return new Fraction(0);\n    },\n    BigNumber: function BigNumber(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a Matrix. The function creates a new `math.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Supported storage formats are 'dense' and 'sparse'.\n   *\n   * Syntax:\n   *\n   *    math.matrix()                         // creates an empty matrix using default storage format (dense).\n   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).\n   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.\n   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.\n   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.\n   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n   *\n   * Examples:\n   *\n   *    let m = math.matrix([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, sparse\n   *\n   * @param {Array | Matrix} [data]    A multi dimensional array\n   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]        Type of the values\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function _() {\n      return _create([]);\n    },\n    string: function string(format) {\n      return _create([], format);\n    },\n    'string, string': function stringString(format, datatype) {\n      return _create([], format, datatype);\n    },\n    Array: function Array(data) {\n      return _create(data);\n    },\n    Matrix: function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n\n  /**\n   * Create a new Matrix with given storage format\n   * @param {Array} data\n   * @param {string} [format]\n   * @param {string} [datatype]\n   * @returns {Matrix} Returns a new Matrix\n   * @private\n   */\n  function _create(data, format, datatype) {\n    // get storage format constructor\n    if (format === 'dense' || format === 'default' || format === undefined) {\n      return new DenseMatrix(data, datatype);\n    }\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype);\n    }\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.plus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nexport var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, b)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij..z,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n   */\n  return function matAlgo14xDs(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n    return cv;\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo13xDD';\nvar dependencies = ['typed'];\nexport var createMatAlgo13xDD = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, Bij..z)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Matrix}   b                 The DenseMatrix instance (B)\n   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n   */\n  return function matAlgo13xDD(a, b, callback) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b arrays\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // c arrays\n    var csize = [];\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // validate each one of the dimension sizes\n    for (var s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) {\n        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n      }\n      // update dimension in c\n      csize[s] = asize[s];\n    }\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i]);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n      }\n    }\n    return cv;\n  }\n});","import { checkBroadcastingRules } from '../../../utils/array.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'broadcast';\nvar dependancies = ['concat'];\nexport var createBroadcast = /* #__PURE__ */factory(name, dependancies, _ref => {\n  var {\n    concat\n  } = _ref;\n  /**\n  * Broadcasts two matrices, and return both in an array\n  * It checks if it's possible with broadcasting rules\n  *\n  * @param {Matrix}   A      First Matrix\n  * @param {Matrix}   B      Second Matrix\n  *\n  * @return {Matrix[]}      [ broadcastedA, broadcastedB ]\n  */\n  return function (A, B) {\n    var N = Math.max(A._size.length, B._size.length); // max number of dims\n    if (A._size.length === B._size.length) {\n      if (A._size.every((dim, i) => dim === B._size[i])) {\n        // If matrices have the same size return them\n        return [A, B];\n      }\n    }\n    var sizeA = _padLeft(A._size, N, 0); // pad to the left to align dimensions to the right\n    var sizeB = _padLeft(B._size, N, 0); // pad to the left to align dimensions to the right\n\n    // calculate the max dimensions\n    var sizeMax = [];\n    for (var dim = 0; dim < N; dim++) {\n      sizeMax[dim] = Math.max(sizeA[dim], sizeB[dim]);\n    }\n\n    // check if the broadcasting rules applyes for both matrices\n    checkBroadcastingRules(sizeA, sizeMax);\n    checkBroadcastingRules(sizeB, sizeMax);\n\n    // reshape A or B if needed to make them ready for concat\n    var AA = A.clone();\n    var BB = B.clone();\n    if (AA._size.length < N) {\n      AA.reshape(_padLeft(AA._size, N, 1));\n    } else if (BB._size.length < N) {\n      BB.reshape(_padLeft(BB._size, N, 1));\n    }\n\n    // stretches the matrices on each dimension to make them the same size\n    for (var _dim = 0; _dim < N; _dim++) {\n      if (AA._size[_dim] < sizeMax[_dim]) {\n        AA = _stretch(AA, sizeMax[_dim], _dim);\n      }\n      if (BB._size[_dim] < sizeMax[_dim]) {\n        BB = _stretch(BB, sizeMax[_dim], _dim);\n      }\n    }\n\n    // return the array with the two broadcasted matrices\n    return [AA, BB];\n  };\n  function _padLeft(shape, N, filler) {\n    // pads an array of dimensions with numbers to the left, unitl the number of dimensions is N\n    return [...Array(N - shape.length).fill(filler), ...shape];\n  }\n  function _stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n    // stretches a matrix up to a certain size in a certain dimension\n    return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n  }\n});","import { factory } from '../../../utils/factory.js';\nimport { extend } from '../../../utils/object.js';\nimport { createMatAlgo13xDD } from './matAlgo13xDD.js';\nimport { createMatAlgo14xDs } from './matAlgo14xDs.js';\nimport { createBroadcast } from './broadcast.js';\nvar name = 'matrixAlgorithmSuite';\nvar dependencies = ['typed', 'matrix', 'concat'];\nexport var createMatrixAlgorithmSuite = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    concat\n  } = _ref;\n  var matAlgo13xDD = createMatAlgo13xDD({\n    typed\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var broadcast = createBroadcast({\n    concat\n  });\n\n  /**\n   * Return a signatures object with the usual boilerplate of\n   * matrix algorithms, based on a plain options object with the\n   * following properties:\n   *   elop: function -- the elementwise operation to use, defaults to self\n   *   SS: function -- the algorithm to apply for two sparse matrices\n   *   DS: function -- the algorithm to apply for a dense and a sparse matrix\n   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped\n   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar\n   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped\n   *   scalar: string -- typed-function type for scalars, defaults to 'any'\n   *\n   * If Ss is not specified, no matrix-scalar signatures are generated.\n   *\n   * @param {object} options\n   * @return {Object<string, function>} signatures\n   */\n  return function matrixAlgorithmSuite(options) {\n    var elop = options.elop;\n    var SD = options.SD || options.DS;\n    var matrixSignatures;\n    if (elop) {\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),\n        'Array, Array': (x, y) => matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),\n        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),\n        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...broadcast(x, y), elop, false);\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...broadcast(x, y), elop, false);\n        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...broadcast(matrix(x), y), elop, false);\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...broadcast(y, x), elop, true);\n        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...broadcast(matrix(y), x), elop, true);\n      }\n    } else {\n      // No elop, use this\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, y), self);\n        }),\n        'Array, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf();\n        }),\n        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), y), self);\n        }),\n        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, matrix(y)), self);\n        })\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.SS(...broadcast(x, y), self, false);\n        });\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(x, y), self, false);\n        });\n        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(matrix(x), y), self, false);\n        });\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(y, x), self, true);\n        });\n        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(matrix(y), x), self, true);\n        });\n      }\n    }\n\n    // Now add the scalars\n    var scalar = options.scalar || 'any';\n    var Ds = options.Ds || options.Ss;\n    if (Ds) {\n      if (elop) {\n        matrixSignatures['DenseMatrix,' + scalar] = (x, y) => matAlgo14xDs(x, y, elop, false);\n        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);\n        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();\n        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();\n      } else {\n        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(x, y, self, false);\n        });\n        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(y, x, self, true);\n        });\n        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n        });\n        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n        });\n      }\n    }\n    var sS = options.sS !== undefined ? options.sS : options.Ss;\n    if (elop) {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);\n      }\n    } else {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return options.Ss(x, y, self, false);\n        });\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return sS(y, x, self, true);\n        });\n      }\n    }\n    // Also pull in the scalar signatures if the operator is a typed function\n    if (elop && elop.signatures) {\n      extend(matrixSignatures, elop.signatures);\n    }\n    return matrixSignatures;\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo01xDSid';\nvar dependencies = ['typed'];\nexport var createMatAlgo01xDSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  Dij          ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype || denseMatrix.getDataType();\n    // sparse matrix arrays\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // process data types\n    var dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined;\n    // callback function\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback;\n\n    // vars\n    var i, j;\n\n    // result (DenseMatrix)\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        // mark i as updated\n        w[i] = mark;\n      }\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // check row is in workspace\n        if (w[i] === mark) {\n          // c[i][j] was already calculated\n          cdata[i][j] = x[i];\n        } else {\n          // item does not exist in S\n          cdata[i][j] = adata[i][j];\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo04xSidSid';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo04xSidSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          └  B(i,j)       ; A(i,j) === 0\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo04xSidSid(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspace\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k0, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // update c\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row exists in A\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            var v = cf(xa[i], bvalues[k]);\n            // check for zero\n            if (!eq(v, zero)) {\n              // update workspace\n              xa[i] = v;\n            } else {\n              // remove mark (index will be removed later)\n              wa[i] = null;\n            }\n          }\n        } else {\n          // update c\n          cindex.push(i);\n          // update workspace\n          wb[i] = mark;\n          // check we need to process values\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i];\n            // increment pointer\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i];\n            // increment pointer\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo10xSids';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  b          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo10xSids(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = b;\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { arraySize, concat as _concat } from '../../utils/array.js';\nimport { IndexError } from '../../error/IndexError.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n  return typed(name, {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i];\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if (isMatrix(arg)) {\n          asMatrix = true;\n        }\n        if (isNumber(arg) || isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument');\n          }\n\n          // last argument contains the dimension on which to concatenate\n          prevDim = dim;\n          dim = arg.valueOf(); // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension');\n          }\n          if (dim < 0 || i > 0 && dim > prevDim) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = clone(arg).valueOf();\n          var size = arraySize(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1;\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1);\n          }\n        }\n      }\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected');\n      }\n      var res = matrices.shift();\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim);\n      }\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n});","export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","import { typeOf } from '../../../utils/is.js';\n\n/**\n * Improve error messages for statistics functions. Errors are typically\n * thrown in an internally used function like larger, causing the error\n * not to mention the function (like max) which is actually used by the user.\n *\n * @param {Error} err\n * @param {String} fnName\n * @param {*} [value]\n * @return {Error}\n */\nexport function improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n  if (String(err).includes('Unexpected type')) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\n    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);\n  }\n  if (String(err).includes('complex numbers')) {\n    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n  }\n  return err;\n}","import { format as formatString } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'format';\nvar dependencies = ['typed'];\nexport var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Format a value of any type into a string.\n   *\n   * Syntax:\n   *\n   *    math.format(value)\n   *    math.format(value, options)\n   *    math.format(value, precision)\n   *    math.format(value, callback)\n   *\n   * Where:\n   *\n   *  - `value: *`\n   *    The value to be formatted\n   *  - `options: Object`\n   *    An object with formatting options. Available options:\n   *    - `notation: string`\n   *      Number notation. Choose from:\n   *      - `'fixed'`\n   *        Always use regular number notation.\n   *        For example `'123.40'` and `'14000000'`\n   *      - `'exponential'`\n   *        Always use exponential notation.\n   *        For example `'1.234e+2'` and `'1.4e+7'`\n   *      - `'engineering'`\n   *        Always use engineering notation: always have exponential notation,\n   *        and select the exponent to be a multiple of `3`.\n   *        For example `'123.4e+0'` and `'14.0e+6'`\n   *      - `'auto'` (default)\n   *        Regular number notation for numbers having an absolute value between\n   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.\n   *        Lower bound is included, upper bound is excluded.\n   *        For example `'123.4'` and `'1.4e7'`.\n   *      - `'bin'`, `'oct'`, or `'hex'`\n   *        Format the number using binary, octal, or hexadecimal notation.\n   *        For example `'0b1101'` and `'0x10fe'`.\n   *    - `wordSize: number | BigNumber`\n   *      The word size in bits to use for formatting in binary, octal, or\n   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`\n   *      values for `notation` option. When this option is defined the value\n   *      is formatted as a signed twos complement integer of the given word\n   *      size and the size suffix is appended to the output.\n   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.\n   *      Default value is undefined.\n   *    - `precision: number | BigNumber`\n   *      Limit the number of digits of the formatted value.\n   *      For regular numbers, must be a number between `0` and `16`.\n   *      For bignumbers, the maximum depends on the configured precision,\n   *      see function `config()`.\n   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,\n   *      `precision` defines the total number of significant digits returned.\n   *      In case of notation `'fixed'`, `precision` defines the number of\n   *      significant digits after the decimal point.\n   *      `precision` is undefined by default.\n   *    - `lowerExp: number`\n   *      Exponent determining the lower boundary for formatting a value with\n   *      an exponent when `notation='auto'`. Default value is `-3`.\n   *    - `upperExp: number`\n   *      Exponent determining the upper boundary for formatting a value with\n   *      an exponent when `notation='auto'`. Default value is `5`.\n   *    - `fraction: string`. Available values: `'ratio'` (default) or `'decimal'`.\n   *      For example `format(fraction(1, 3))` will output `'1/3'` when `'ratio'`\n   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.\n   *    - `truncate: number`. Specifies the maximum allowed length of the\n   *      returned string. If it had been longer, the excess characters\n   *      are deleted and replaced with `'...'`.\n   * - `callback: function`\n   *   A custom formatting function, invoked for all numeric elements in `value`,\n   *   for example all elements of a matrix, or the real and imaginary\n   *   parts of a complex number. This callback can be used to override the\n   *   built-in numeric notation with any type of formatting. Function `callback`\n   *   is called with `value` as parameter and must return a string.\n   *\n   * When `value` is an Object:\n   *\n   * - When the object contains a property `format` being a function, this function\n   *   is invoked as `value.format(options)` and the result is returned.\n   * - When the object has its own `toString` method, this method is invoked\n   *   and the result is returned.\n   * - In other cases the function will loop over all object properties and\n   *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n   *\n   * When value is a function:\n   *\n   * - When the function has a property `syntax`, it returns this\n   *   syntax description.\n   * - In other cases, a string `'function'` is returned.\n   *\n   * Examples:\n   *\n   *    math.format(6.4)                                        // returns '6.4'\n   *    math.format(1240000)                                    // returns '1.24e+6'\n   *    math.format(1/3)                                        // returns '0.3333333333333333'\n   *    math.format(1/3, 3)                                     // returns '0.333'\n   *    math.format(21385, 2)                                   // returns '21000'\n   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'\n   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'\n   *    math.format(12400, {notation: 'engineering'})           // returns '12.4e+3'\n   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'\n   *\n   *    function formatCurrency(value) {\n   *      // return currency notation with two digits:\n   *      return '$' + value.toFixed(2)\n   *\n   *      // you could also use math.format inside the callback:\n   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})\n   *    }\n   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'\n   *\n   * See also:\n   *\n   *    print\n   *\n   * @param {*} value                               Value to be stringified\n   * @param {Object | Function | number} [options]  Formatting options\n   * @return {string} The formatted value\n   */\n  return typed(name, {\n    any: formatString,\n    'any, Object | function | number | BigNumber': formatString\n  });\n});","import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    number: _number,\n    bignumber,\n    fraction\n  } = _ref;\n  var validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  };\n\n  // Load the conversion functions for each output type\n  var validOutputTypes = {\n    number: x => _number(x),\n    BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n    Fraction: fraction ? x => fraction(x) : noFraction\n  };\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns 4\n   *    math.numeric('4', 'number')                 // returns 4\n   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4\n   *    math.numeric('4', 'Fraction')               // returns Fraction 4\n   *    math.numeric(4, 'Fraction')                 // returns Fraction 4\n   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4\n   *\n   * See also:\n   *\n   *    number, fraction, bignumber, string, format\n   *\n   * @param {string | number | BigNumber | Fraction } value\n   *              A numeric value or a string containing a numeric value\n   * @param {string} outputType\n   *              Desired numeric output type.\n   *              Available values: 'number', 'BigNumber', or 'Fraction'\n   * @return {number | BigNumber | Fraction}\n   *              Returns an instance of the numeric in the requested type\n   */\n  return function numeric(value) {\n    var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n    var check = arguments.length > 2 ? arguments[2] : undefined;\n    if (check !== undefined) {\n      throw new SyntaxError('numeric() takes one or two arguments');\n    }\n    var inputType = typeOf(value);\n    if (!(inputType in validInputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n    }\n    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n    }\n    if (outputType === inputType) {\n      return value;\n    } else {\n      return validOutputTypes[outputType](value);\n    }\n  };\n});","import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  /**\n  * Add two or more values, `x + y`.\n  * For matrices, the function is evaluated element wise.\n  *\n  * Syntax:\n  *\n  *    math.add(x, y)\n  *    math.add(x, y, z, ...)\n  *\n  * Examples:\n  *\n  *    math.add(2, 3)               // returns number 5\n  *    math.add(2, 3, 4)            // returns number 9\n  *\n  *    const a = math.complex(2, 3)\n  *    const b = math.complex(-4, 1)\n  *    math.add(a, b)               // returns Complex -2 + 4i\n  *\n  *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]\n  *\n  *    const c = math.unit('5 cm')\n  *    const d = math.unit('2.1 mm')\n  *    math.add(c, d)               // returns Unit 52.1 mm\n  *\n  *    math.add(\"2.3\", \"4\")         // returns number 6.3\n  *\n  * See also:\n  *\n  *    subtract, sum\n  *\n  * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add\n  * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n  * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n  */\n  return typed(name, {\n    'any, any': addScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  }, matrixAlgorithmSuite({\n    elop: addScalar,\n    DS: matAlgo01xDSid,\n    SS: matAlgo04xSidSid,\n    Ss: matAlgo10xSids\n  }));\n});","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n  /**\n   * Compute the sum of a matrix or a list with values.\n   * In case of a multidimensional array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.sum(a, b, c, ...)\n   *     math.sum(A)\n   *     math.sum(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.sum(2, 1, 4, 3)               // returns 10\n   *     math.sum([2, 1, 4, 3])             // returns 10\n   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, cumsum\n   *\n   * @param {... *} args  A single matrix or multiple scalar values\n   * @return {*} The sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    'Array | Matrix': _sum,\n    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\n    // sum(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function sum');\n      }\n      return _sum(args);\n    }\n  });\n\n  /**\n   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n  function _sum(array) {\n    var sum;\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n      } catch (err) {\n        throw improveErrorMessage(err, 'sum', value);\n      }\n    });\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (sum === undefined) {\n      sum = numeric(0, config.number);\n    }\n    if (typeof sum === 'string') {\n      sum = numeric(sum, config.number);\n    }\n    return sum;\n  }\n  function _nsumDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      return sum;\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum');\n    }\n  }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createUnaryPlus, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBignumber, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCos, createCot, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createTypeOf, createAcosh, createAcsch, createApply, createAsec, createBin, createCombinationsWithRep, createCosh, createCsch, createIsNaN, createIsPrime, createRandomInt, createSech, createSinh, createSparse, createSqrt, createTanh, createUnaryMinus, createAcoth, createCoth, createFraction, createIsNumeric, createMatrix, createMatrixFromFunction, createMode, createNumeric, createProd, createReshape, createSize, createSqueeze, createTranspose, createXgcd, createZeros, createAsin, createCbrt, createConcat, createCount, createCtranspose, createDiag, createDivideScalar, createDotDivide, createEqual, createFlatten, createHasNumericValue, createIdentity, createKron, createLargerEq, createLeftShift, createLsolve, createMatrixFromColumns, createNthRoot, createOnes, createQr, createResize, createRightArithShift, createRound, createSmaller, createSubtract, createTo, createUnequal, createUsolve, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCatalan, createCompare, createCompareText, createCumSum, createDeepEqual, createDiff, createDistance, createDot, createEqualText, createFloor, createGcd, createHypot, createImmutableDenseMatrixClass, createIndexClass, createLarger, createLog, createLsolveAll, createMatrixFromRows, createMin, createMod, createMultiply, createNthRoots, createOr, createPartitionSelect, createRightLogShift, createSlu, createSubset, createSum, createTrace, createUsolveAll, createZpk2tf, createCeil, createCompareNatural, createComposition, createCross, createDet, createDotMultiply, createFibonacciHeapClass, createFix, createIndex, createIntersect, createInvmod, createLcm, createLog1p, createMax, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSmallerEq, createSort, createAnd, createRange, createRow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSpaClass, createColumn, createInv, createLup, createPinv, createPow, createSetIntersect, createSetUnion, createSqrtm, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCoulomb, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createExpm, createFaraday, createFft, createGamma, createGravitationConstant, createHartreeEnergy, createIfft, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSecondRadiation, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCreateUnit, createDivide, createElectronMass, createFactorial, createFirstRadiation, createGravity, createInverseConductanceQuantum, createLusolve, createMagneticFluxQuantum, createMolarMassC12, createMultinomial, createPermutations, createPlanckMass, createPolynomialRoot, createSetSize, createSolveODE, createStirlingS2, createUnitFunction, createBellNumbers, createEigs, createFermiCoupling, createGasConstant, createKldivergence, createMean, createMolarVolume, createPlanckConstant, createQuantileSeq, createVariance, createClassicalElectronRadius, createMedian, createCorr, createFreqz, createMad, createStd, createZeta, createNorm, createRotationMatrix, createPlanckTime, createSchur, createRotate, createSylvester, createLyap } from '../factoriesAny.js';\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var _null = /* #__PURE__ */createNull({});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  BigNumber,\n  config,\n  typed\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  typed\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var lgamma = /* #__PURE__ */createLgamma({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var subtractScalar = /* #__PURE__ */createSubtractScalar({\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var apply = /* #__PURE__ */createApply({\n  isInteger,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  typed\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({\n  isZero,\n  matrix,\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  matrix,\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  concat,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  matrix,\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtractScalar,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var to = /* #__PURE__ */createTo({\n  concat,\n  matrix,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  concat,\n  matrix,\n  typed\n});\nexport var cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  deepEqual,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtractScalar,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix,\n  getMatrixDataType\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromRows = /* #__PURE__ */createMatrixFromRows({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  numeric,\n  smaller,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  add,\n  matrix,\n  typed,\n  zeros\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var zpk2tf = /* #__PURE__ */createZpk2tf({\n  Complex,\n  add,\n  multiply,\n  number,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  divideScalar,\n  isZero,\n  matrix,\n  multiply,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  concat,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  flatten,\n  isNumeric,\n  isZero,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var invmod = /* #__PURE__ */createInvmod({\n  BigNumber,\n  add,\n  config,\n  equal,\n  isInteger,\n  mod,\n  smaller,\n  typed,\n  xgcd\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  larger,\n  numeric,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var and = /* #__PURE__ */createAnd({\n  concat,\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  add,\n  config,\n  isPositive,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var pinv = /* #__PURE__ */createPinv({\n  Complex,\n  add,\n  ctranspose,\n  deepEqual,\n  divideScalar,\n  dot,\n  dotDivide,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  inv,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  map,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtractScalar\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var fft = /* #__PURE__ */createFft({\n  addScalar,\n  ceil,\n  conj,\n  divideScalar,\n  dotDivide,\n  exp,\n  i,\n  log2,\n  matrix,\n  multiplyScalar,\n  pow,\n  tau,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var polynomialRoot = /* #__PURE__ */createPolynomialRoot({\n  add,\n  cbrt,\n  divide,\n  equalScalar,\n  im,\n  isZero,\n  multiply,\n  re,\n  sqrt,\n  subtract,\n  typeOf,\n  typed,\n  unaryMinus\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var solveODE = /* #__PURE__ */createSolveODE({\n  abs,\n  add,\n  bignumber,\n  divide,\n  isNegative,\n  isPositive,\n  larger,\n  map,\n  matrix,\n  max,\n  multiply,\n  smaller,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  bignumber,\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  number,\n  pow,\n  subtractScalar,\n  typed\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  column,\n  complex,\n  config,\n  cos,\n  diag,\n  divideScalar,\n  dot,\n  equal,\n  flatten,\n  im,\n  inv,\n  larger,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  multiplyScalar,\n  number,\n  qr,\n  re,\n  reshape,\n  sin,\n  size,\n  smaller,\n  sqrt,\n  subtract,\n  typed,\n  usolve,\n  usolveAll\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  map,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  bignumber,\n  add,\n  compare,\n  divide,\n  isInteger,\n  larger,\n  multiply,\n  partitionSelect,\n  smaller,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  apply,\n  divide,\n  isNaN,\n  multiply,\n  subtract,\n  typed\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var corr = /* #__PURE__ */createCorr({\n  add,\n  divide,\n  matrix,\n  mean,\n  multiply,\n  pow,\n  sqrt,\n  subtract,\n  sum,\n  typed\n});\nexport var freqz = /* #__PURE__ */createFreqz({\n  Complex,\n  add,\n  divide,\n  matrix,\n  multiply,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var zeta = /* #__PURE__ */createZeta({\n  BigNumber,\n  Complex,\n  add,\n  config,\n  divide,\n  equal,\n  factorial,\n  gamma,\n  isNegative,\n  multiply,\n  pi,\n  pow,\n  sin,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var schur = /* #__PURE__ */createSchur({\n  identity,\n  matrix,\n  multiply,\n  norm,\n  qr,\n  subtract,\n  typed\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var sylvester = /* #__PURE__ */createSylvester({\n  abs,\n  add,\n  concat,\n  identity,\n  index,\n  lusolve,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  range,\n  schur,\n  subset,\n  subtract,\n  transpose,\n  typed\n});\nexport var lyap = /* #__PURE__ */createLyap({\n  matrix,\n  multiply,\n  sylvester,\n  transpose,\n  typed\n});","import { BexDex, Matter, NumDex } from \"./matter.js\";\nimport { CesrNumber } from \"./number.js\";\nimport { format, sum, fraction } from 'mathjs';\nexport class Tholder {\n    // private _bexter: any\n    constructor(kargs) {\n        this._weighted = false;\n        this._thold = undefined;\n        this._size = 0;\n        this._number = undefined;\n        this._satisfy = undefined;\n        if (kargs.thold !== undefined) {\n            this._processThold(kargs.thold);\n        }\n        else if (kargs.limen != undefined) {\n            this._processLimen(kargs.limen);\n        }\n        else if (kargs.sith !== undefined) {\n            this._processSith(kargs.sith);\n        }\n        else {\n            throw new Error('Missing threshold expression');\n        }\n    }\n    get weighted() {\n        return this._weighted;\n    }\n    get thold() {\n        return this._thold;\n    }\n    get size() {\n        return this._size;\n    }\n    get limen() {\n        var _a;\n        return (_a = this._number) === null || _a === void 0 ? void 0 : _a.qb64b;\n    }\n    get sith() {\n        if (this.weighted) {\n            let sith = this.thold.map((clause) => {\n                return clause.map((c) => {\n                    if (0 < Number(c) && Number(c) < 1) {\n                        return format(c, { fraction: 'ratio' });\n                    }\n                    else {\n                        return format(c, { fraction: 'decimal' });\n                    }\n                });\n            });\n            if (sith.length == 1) {\n                sith = sith[0];\n            }\n            return sith;\n        }\n        else {\n            return this.thold.toString(16);\n        }\n    }\n    get json() {\n        return JSON.stringify(this.sith);\n    }\n    get num() {\n        return this._weighted ? undefined : this._thold;\n    }\n    _processThold(thold) {\n        if (typeof thold === 'number') {\n            this._processUnweighted(thold);\n        }\n        else {\n            this._processWeighted(thold);\n        }\n    }\n    _processLimen(limen) {\n        const matter = new Matter({ qb64: limen });\n        if (NumDex.has(matter.code)) {\n            const number = new CesrNumber({\n                raw: matter.raw,\n                code: matter.code,\n            });\n            this._processUnweighted(number.num);\n        }\n        else if (BexDex.has(matter.code)) {\n            // TODO: Implement Bexter\n        }\n        else {\n            throw new Error('Invalid code for limen=' + matter.code);\n        }\n    }\n    _processSith(sith) {\n        if (typeof sith == 'number') {\n            this._processUnweighted(sith);\n        }\n        else if (typeof sith == 'string' && sith.indexOf('[') == -1) {\n            this._processUnweighted(parseInt(sith, 16));\n        }\n        else {\n            let _sith = sith;\n            if (typeof sith == 'string') {\n                _sith = JSON.parse(sith);\n            }\n            if (_sith.length == 0) {\n                throw new Error('Empty weight list');\n            }\n            const mask = _sith.map((x) => {\n                return typeof x !== 'string';\n            });\n            if (mask.length > 0 && !mask.every((x) => x)) {\n                _sith = [_sith];\n            }\n            for (const c of _sith) {\n                const mask = c.map((x) => {\n                    return typeof x === 'string';\n                });\n                if (mask.length > 0 && !mask.every((x) => x)) {\n                    throw new Error('Invalid sith, some weights in clause ' +\n                        mask +\n                        ' are non string');\n                }\n            }\n            const thold = this._processClauses(_sith);\n            this._processWeighted(thold);\n        }\n    }\n    _processClauses(sith) {\n        const thold = new Array();\n        sith.forEach((clause) => {\n            thold.push(clause.map((w) => {\n                return this.weight(w);\n            }));\n        });\n        return thold;\n    }\n    _processUnweighted(thold) {\n        if (thold < 0) {\n            throw new Error('Non-positive int threshold = {thold}.');\n        }\n        this._thold = thold;\n        this._weighted = false;\n        this._size = this._thold; // used to verify that keys list size is at least size\n        this._satisfy = this._satisfy_numeric;\n        this._number = new CesrNumber({}, thold);\n        // this._bexter = undefined\n    }\n    _processWeighted(thold) {\n        for (const clause of thold) {\n            if (Number(sum(clause)) < 1) {\n                throw new Error('Invalid sith clause: ' +\n                    thold +\n                    'all clause weight sums must be >= 1');\n            }\n        }\n        this._thold = thold;\n        this._weighted = true;\n        this._size = thold.reduce((acc, currentValue) => {\n            return acc + currentValue.length;\n        }, 0);\n        this._satisfy = this._satisfy_weighted;\n        //TODO: created Bexter if needed\n    }\n    weight(w) {\n        return fraction(w);\n    }\n    _satisfy_numeric(indices) {\n        return this.thold > 0 && indices.length >= this.thold; // at least one\n    }\n    _satisfy_weighted(indices) {\n        if (indices.length === 0) {\n            return false;\n        }\n        const indexes = new Set(indices.sort());\n        const sats = new Array(indices.length).fill(false);\n        for (const idx of indexes) {\n            sats[idx] = true;\n        }\n        let wio = 0;\n        for (const clause of this.thold) {\n            let cw = 0;\n            for (const w of clause) {\n                if (sats[wio]) {\n                    cw += Number(w);\n                }\n                wio += 1;\n            }\n            if (cw < 1) {\n                return false;\n            }\n        }\n        return true;\n    }\n    satisfy(indices) {\n        return this._satisfy(indices);\n    }\n}\n","import { b, concat, Protocols, Ilks, Serials, versify, Vrsn_1_0, } from \"./core.js\";\nimport { Tholder } from \"./tholder.js\";\nimport { CesrNumber } from \"./number.js\";\nimport { Prefixer } from \"./prefixer.js\";\nimport { Serder } from \"./serder.js\";\nimport { MtrDex, NonTransDex } from \"./matter.js\";\nimport { Saider } from \"./saider.js\";\nimport { Counter, CtrDex } from \"./counter.js\";\nimport { Seqner } from \"./seqner.js\";\nconst MaxIntThold = 2 ** 32 - 1;\nexport function rotate({ pre = undefined, keys, dig = undefined, ilk = Ilks.rot, sn = 1, isith = undefined, ndigs = undefined, nsith = undefined, wits = undefined, cuts = undefined, adds = undefined, toad = undefined, data = undefined, version = undefined, kind = undefined, intive = true, }) {\n    const vs = versify(Protocols.KERI, version, kind, 0);\n    const _ilk = ilk;\n    if (_ilk != Ilks.rot && _ilk != Ilks.drt) {\n        throw new Error(`Invalid ilk = ${ilk} for rot or drt.`);\n    }\n    const sner = new CesrNumber({}, sn);\n    if (sner.num < 1) {\n        throw new Error(`Invalid sn = 0x${sner.numh} for rot or drt.`);\n    }\n    let _isit;\n    if (isith == undefined) {\n        _isit = Math.max(1, Math.ceil(keys.length / 2));\n    }\n    else {\n        _isit = isith; // TODO this type as number does not make sense when isith is a string containing weighted thresholds\n    }\n    const tholder = new Tholder({ sith: _isit });\n    if (tholder.num != undefined && tholder.num < 1) {\n        throw new Error(`Invalid sith = ${tholder.num} less than 1.`);\n    }\n    if (tholder.size > keys.length) {\n        // TODO this error should say that the threshold has not been met\n        throw new Error(`Invalid sith = ${tholder.num} for keys = ${keys}`);\n    }\n    let _ndigs;\n    if (ndigs === undefined) {\n        _ndigs = [];\n    }\n    else {\n        _ndigs = ndigs;\n    }\n    let _nsith;\n    if (nsith === undefined) {\n        _nsith = Math.max(1, Math.ceil(_ndigs.length / 2));\n    }\n    else {\n        _nsith = nsith;\n    }\n    const ntholder = new Tholder({ sith: _nsith });\n    if (ntholder.num != undefined && ntholder.num < 1) {\n        throw new Error(`Invalid sith = ${ntholder.num} less than 1.`);\n    }\n    if (ntholder.size > _ndigs.length) {\n        // TODO this error should say that the threshold has not been met\n        throw new Error(`Signing threshold failure: ${keys.length} number of signers not equal to or greater than sith = ${tholder.size} for keys = ${keys}`);\n    }\n    let _wits;\n    if (wits === undefined) {\n        _wits = [];\n    }\n    else {\n        _wits = wits;\n    }\n    const witset = new Set(_wits);\n    if (witset.size != _wits.length) {\n        throw new Error(`Invalid wits = ${wits}, has duplicates.`);\n    }\n    let _cuts;\n    if (cuts === undefined) {\n        _cuts = [];\n    }\n    else {\n        _cuts = cuts;\n    }\n    const cutset = new Set(_cuts);\n    if (cutset.size != _cuts.length) {\n        throw new Error(`Invalid cuts = ${cuts}, has duplicates.`);\n    }\n    let _adds;\n    if (adds === undefined) {\n        _adds = [];\n    }\n    else {\n        _adds = adds;\n    }\n    const addset = new Set(_adds);\n    //non empty intersection of witset and addset\n    const witaddset = new Set([...witset].filter((x) => addset.has(x)));\n    if (witaddset.size > 0) {\n        throw new Error(`Invalid member combination among wits = ${wits}, and adds = ${adds}.`);\n    }\n    // non empty intersection of cutset and addset\n    const cutaddset = new Set([...cutset].filter((x) => addset.has(x)));\n    if (cutaddset.size > 0) {\n        throw new Error(`Invalid member combination among cuts = ${cuts}, and adds = ${adds}.`);\n    }\n    const newitsetdiff = new Set(_wits);\n    _cuts.forEach(function (v) {\n        newitsetdiff.delete(v);\n    });\n    const newitset = new Set((function* () {\n        yield* newitsetdiff;\n        yield* addset;\n    })());\n    if (newitset.size != witset.size - cutset.size + addset.size) {\n        throw new Error(`Invalid member combination among wits = ${wits}, cuts = ${cuts}, and adds = ${adds}.`);\n    }\n    let _toad;\n    if (toad === undefined) {\n        if (newitset.size == 0) {\n            _toad = 0;\n        }\n        else {\n            _toad = ample(newitset.size);\n        }\n    }\n    else {\n        _toad = toad;\n    }\n    if (newitset.size > 0) {\n        if (_toad < 1 || _toad > newitset.size) {\n            throw new Error(`Invalid toad = ${_toad} for wit = ${wits}`);\n        }\n    }\n    else {\n        if (_toad != 0) {\n            throw new Error(`Invalid toad = ${_toad} for wit = ${wits}`);\n        }\n    }\n    const _sad = {\n        v: vs,\n        t: _ilk,\n        d: '',\n        i: pre,\n        s: sner.numh,\n        p: dig,\n        kt: tholder.num &&\n            intive &&\n            tholder.num !== undefined &&\n            tholder.num <= MaxIntThold\n            ? tholder.num.toString(16)\n            : tholder.sith,\n        k: keys,\n        nt: ntholder.num &&\n            intive &&\n            ntholder.num !== undefined &&\n            ntholder.num <= MaxIntThold\n            ? ntholder.num.toString(16)\n            : ntholder.sith,\n        n: _ndigs,\n        bt: _toad && intive && _toad !== undefined && _toad <= MaxIntThold\n            ? _toad\n            : _toad.toString(16),\n        br: cuts,\n        ba: adds,\n        a: data != undefined ? data : [],\n    };\n    const [, sad] = Saider.saidify(_sad);\n    return new Serder(sad);\n}\nexport function ample(n, f, weak = true) {\n    n = Math.max(0, n); // no negatives\n    let f1;\n    if (f == undefined) {\n        f1 = Math.max(1, Math.floor(Math.max(0, n - 1) / 3)); // least floor f subject to n >= 3*f+1\n        const f2 = Math.max(1, Math.ceil(Math.max(0, n - 1) / 3)); // most Math.ceil f subject to n >= 3*f+1\n        if (weak) {\n            // try both fs to see which one has lowest m\n            return Math.min(n, Math.ceil((n + f1 + 1) / 2), Math.ceil((n + f2 + 1) / 2));\n        }\n        else {\n            return Math.min(n, Math.max(0, n - f1, Math.ceil((n + f1 + 1) / 2)));\n        }\n    }\n    else {\n        f = Math.max(0, f);\n        const m1 = Math.ceil((n + f + 1) / 2);\n        const m2 = Math.max(0, n - f);\n        if (m2 < m1 && n > 0) {\n            throw new Error(`Invalid f=${f} is too big for n=${n}.`);\n        }\n        if (weak) {\n            return Math.min(n, m1, m2);\n        }\n        else {\n            return Math.min(n, Math.max(m1, m2));\n        }\n    }\n}\nexport function incept({ keys, isith, ndigs, nsith, toad, wits, cnfg, data, version = Vrsn_1_0, kind = Serials.JSON, code, intive = false, delpre, }) {\n    const vs = versify(Protocols.KERI, version, kind, 0);\n    const ilk = delpre == undefined ? Ilks.icp : Ilks.dip;\n    const sner = new CesrNumber({}, 0);\n    if (isith == undefined) {\n        isith = Math.max(1, Math.ceil(keys.length / 2));\n    }\n    const tholder = new Tholder({ sith: isith });\n    if (tholder.num != undefined && tholder.num < 1) {\n        throw new Error(`Invalid sith = ${tholder.num} less than 1.`);\n    }\n    if (tholder.size > keys.length) {\n        throw new Error(`Invalid sith = ${tholder.num} for keys ${keys}`);\n    }\n    if (ndigs == undefined) {\n        ndigs = new Array();\n    }\n    if (nsith == undefined) {\n        nsith = Math.max(0, Math.ceil(ndigs.length / 2));\n    }\n    const ntholder = new Tholder({ sith: nsith });\n    if (ntholder.num != undefined && ntholder.num < 0) {\n        throw new Error(`Invalid nsith = ${ntholder.num} less than 0.`);\n    }\n    if (ntholder.size > keys.length) {\n        throw new Error(`Invalid nsith = ${ntholder.num} for keys ${ndigs}`);\n    }\n    wits = wits == undefined ? [] : wits;\n    if (new Set(wits).size != wits.length) {\n        throw new Error(`Invalid wits = ${wits}, has duplicates.`);\n    }\n    if (toad == undefined) {\n        if (wits.length == 0) {\n            toad = 0;\n        }\n        else {\n            toad = ample(wits.length);\n        }\n    }\n    const toader = new CesrNumber({}, toad);\n    if (wits.length > 0) {\n        if (toader.num < 1 || toader.num > wits.length) {\n            throw new Error(`Invalid toad = ${toader.num} for wits = ${wits}`);\n        }\n    }\n    else {\n        if (toader.num != 0) {\n            throw new Error(`Invalid toad = ${toader.num} for wits = ${wits}`);\n        }\n    }\n    cnfg = cnfg == undefined ? new Array() : cnfg;\n    data = data == undefined ? new Array() : data;\n    let sad = {\n        v: vs,\n        t: ilk,\n        d: '',\n        i: '',\n        s: sner.numh,\n        kt: intive && tholder.num != undefined ? tholder.num : tholder.sith,\n        k: keys,\n        nt: intive && tholder.num != undefined ? ntholder.num : ntholder.sith,\n        n: ndigs,\n        bt: intive ? toader.num : toader.numh,\n        b: wits,\n        c: cnfg,\n        a: data,\n    };\n    if (delpre != undefined) {\n        sad['di'] = delpre;\n        if (code == undefined) {\n            code = MtrDex.Blake3_256;\n        }\n    }\n    let prefixer;\n    if (delpre == undefined && code == undefined && keys.length == 1) {\n        prefixer = new Prefixer({ qb64: keys[0] });\n        if (prefixer.digestive) {\n            throw new Error(`Invalid code, digestive=${prefixer.code}, must be derived from ked.`);\n        }\n    }\n    else {\n        prefixer = new Prefixer({ code: code }, sad);\n        if (delpre != undefined) {\n            if (!prefixer.digestive) {\n                throw new Error(`Invalid derivation code = ${prefixer.code} for delegation. Must be digestive`);\n            }\n        }\n    }\n    sad['i'] = prefixer.qb64;\n    if (prefixer.digestive) {\n        sad['d'] = prefixer.qb64;\n    }\n    else {\n        [, sad] = Saider.saidify(sad);\n    }\n    return new Serder(sad);\n}\nexport function messagize(serder, sigers, seal, wigers, cigars, pipelined = false) {\n    let msg = new Uint8Array(b(serder.raw));\n    let atc = new Uint8Array();\n    if (sigers == undefined && wigers == undefined && cigars == undefined) {\n        throw new Error(`Missing attached signatures on message = ${serder.sad}.`);\n    }\n    if (sigers != undefined) {\n        if (seal != undefined) {\n            if (seal[0] == 'SealEvent') {\n                atc = concat(atc, new Counter({ code: CtrDex.TransIdxSigGroups, count: 1 })\n                    .qb64b);\n                atc = concat(atc, new TextEncoder().encode(seal[1].i));\n                atc = concat(atc, new Seqner({ sn: parseInt(seal[1].s) }).qb64b);\n                atc = concat(atc, new TextEncoder().encode(seal[1].d));\n            }\n            else if (seal[0] == 'SealLast') {\n                atc = concat(atc, new Counter({\n                    code: CtrDex.TransLastIdxSigGroups,\n                    count: 1,\n                }).qb64b);\n                atc = concat(atc, new TextEncoder().encode(seal[1].i));\n            }\n        }\n        atc = concat(atc, new Counter({\n            code: CtrDex.ControllerIdxSigs,\n            count: sigers.length,\n        }).qb64b);\n        sigers.forEach((siger) => {\n            atc = concat(atc, siger.qb64b);\n        });\n    }\n    if (wigers != undefined) {\n        atc = concat(atc, new Counter({\n            code: CtrDex.ControllerIdxSigs,\n            count: wigers.length,\n        }).qb64b);\n        wigers.forEach((wiger) => {\n            if (wiger.verfer && !(wiger.verfer.code in NonTransDex)) {\n                throw new Error(`Attempt to use tranferable prefix=${wiger.verfer.qb64} for receipt.`);\n            }\n            atc = concat(atc, wiger.qb64b);\n        });\n    }\n    if (cigars != undefined) {\n        atc = concat(atc, new Counter({\n            code: CtrDex.ControllerIdxSigs,\n            count: cigars.length,\n        }).qb64b);\n        cigars.forEach((cigar) => {\n            if (cigar.verfer && !(cigar.verfer.code in NonTransDex)) {\n                throw new Error(`Attempt to use tranferable prefix=${cigar.verfer.qb64} for receipt.`);\n            }\n            atc = concat(atc, cigar.qb64b);\n        });\n    }\n    if (pipelined) {\n        if (atc.length % 4 != 0) {\n            throw new Error(`Invalid attachments size=${atc.length}, nonintegral quadlets.`);\n        }\n        msg = concat(msg, new Counter({\n            code: CtrDex.AttachedMaterialQuadlets,\n            count: Math.floor(atc.length / 4),\n        }).qb64b);\n    }\n    msg = concat(msg, atc);\n    return msg;\n}\nexport function interact(args) {\n    let { pre, dig, sn, data, version, kind } = args;\n    const vs = versify(Protocols.KERI, version, kind, 0);\n    const ilk = Ilks.ixn;\n    const sner = new CesrNumber({}, sn);\n    if (sner.num < 1) {\n        throw new Error(`Invalid sn = 0x${sner.numh} for ixn.`);\n    }\n    data = data == undefined ? new Array() : data;\n    let sad = {\n        v: vs,\n        t: ilk,\n        d: '',\n        i: pre,\n        s: sner.numh,\n        p: dig,\n        a: data,\n    };\n    [, sad] = Saider.saidify(sad);\n    return new Serder(sad);\n}\nexport function reply(route = '', data, stamp, version, kind = Serials.JSON) {\n    const vs = versify(Protocols.KERI, version, kind, 0);\n    if (data == undefined) {\n        data = {};\n    }\n    const _sad = {\n        v: vs,\n        t: Ilks.rpy,\n        d: '',\n        dt: stamp !== null && stamp !== void 0 ? stamp : new Date().toISOString().replace('Z', '000+00:00'),\n        r: route,\n        a: data,\n    };\n    const [, sad] = Saider.saidify(_sad);\n    const saider = new Saider({ qb64: sad['d'] });\n    if (!saider.verify(sad, true, true, kind, 'd'))\n        throw new Error(`Invalid said = ${saider.qb64} for reply msg=${sad}.`);\n    return new Serder(sad);\n}\n","import { Algos, Manager } from \"../core/manager.js\";\nimport { MtrDex } from \"../core/matter.js\";\nimport { Salter } from \"../core/salter.js\";\nimport { incept } from \"../core/eventing.js\";\nexport class TraitCodex {\n    constructor() {\n        this.EstOnly = 'EO'; // Only allow establishment events\n        this.DoNotDelegate = 'DND'; // Dot not allow delegated identifiers\n        this.NoBackers = 'NB'; // Do not allow backers\n    }\n}\nexport const TraitDex = new TraitCodex();\nexport class Hab {\n    constructor(name, icp) {\n        this.name = name;\n        this.serder = icp;\n    }\n    get pre() {\n        return this.serder.sad['i'];\n    }\n}\nexport class Habery {\n    constructor({ name, passcode, seed, aeid, pidx, salt }) {\n        this._habs = new Map();\n        this._name = name;\n        if (passcode != undefined && seed == undefined) {\n            if (passcode.length < 21) {\n                throw new Error('Bran (passcode seed material) too short.');\n            }\n            const bran = MtrDex.Salt_128 + 'A' + passcode.substring(0, 21); // qb64 salt for seed\n            const signer = new Salter({ qb64: bran }).signer(MtrDex.Ed25519_Seed, false);\n            seed = signer.qb64;\n            if (aeid == undefined) {\n                aeid = signer.verfer.qb64; // lest it remove encryption\n            }\n        }\n        let algo;\n        const salter = salt != undefined ? new Salter({ qb64: salt }) : undefined;\n        if (salt != undefined) {\n            algo = Algos.salty;\n        }\n        else {\n            algo = Algos.randy;\n        }\n        this._mgr = new Manager({\n            seed: seed,\n            aeid: aeid,\n            pidx: pidx,\n            algo: algo,\n            salter: salter,\n        });\n    }\n    get mgr() {\n        return this._mgr;\n    }\n    get habs() {\n        return Array.from(this._habs.values());\n    }\n    habByName(name) {\n        return this._habs.get(name);\n    }\n    makeHab(name, { code = MtrDex.Blake3_256, transferable = true, isith = undefined, icount = 1, nsith = undefined, ncount = undefined, toad = undefined, wits = undefined, delpre = undefined, estOnly = false, DnD = false, data = undefined, }) {\n        if (nsith == undefined) {\n            nsith = isith;\n        }\n        if (ncount == undefined) {\n            ncount = icount;\n        }\n        if (!transferable) {\n            ncount = 0;\n            nsith = '0';\n            code = MtrDex.Ed25519N;\n        }\n        const [verfers, digers] = this._mgr.incept({\n            icount: icount,\n            ncount: ncount,\n            stem: this.name,\n            transferable: transferable,\n            temp: false,\n        });\n        icount = verfers.length;\n        ncount = digers != undefined ? digers.length : 0;\n        if (isith == undefined) {\n            isith = `${Math.max(1, Math.ceil(icount / 2)).toString(16)}`;\n        }\n        if (nsith == undefined) {\n            nsith = `${Math.max(1, Math.ceil(ncount / 2)).toString(16)}`;\n        }\n        const cnfg = new Array();\n        if (estOnly) {\n            cnfg.push(TraitDex.EstOnly);\n        }\n        if (DnD) {\n            cnfg.push(TraitDex.DoNotDelegate);\n        }\n        const keys = Array.from(verfers, (verfer) => verfer.qb64);\n        const ndigs = Array.from(digers, (diger) => diger.qb64);\n        const icp = incept({\n            keys,\n            isith,\n            ndigs,\n            nsith,\n            toad,\n            wits,\n            cnfg,\n            data,\n            code,\n            delpre,\n        });\n        const hab = new Hab(name, icp);\n        this._habs.set(name, hab);\n        return hab;\n    }\n    get name() {\n        return this._name;\n    }\n}\n","import { SaltyCreator } from \"../core/manager.js\";\nimport { Salter } from \"../core/salter.js\";\nimport { MtrDex } from \"../core/matter.js\";\nimport { Diger } from \"../core/diger.js\";\nimport { incept, rotate, interact } from \"../core/eventing.js\";\nimport { Serder } from \"../core/serder.js\";\nimport { Tholder } from \"../core/tholder.js\";\nimport { Ilks, b, Serials, Vrsn_1_0 } from \"../core/core.js\";\nimport { Verfer } from \"../core/verfer.js\";\nimport { Encrypter } from \"../core/encrypter.js\";\nimport { Decrypter } from \"../core/decrypter.js\";\nimport { Cipher } from \"../core/cipher.js\";\nimport { Seqner } from \"../core/seqner.js\";\nimport { CesrNumber } from \"../core/number.js\";\n/**\n * Agent is a custodial entity that can be used in conjuntion with a local Client to establish the\n * KERI \"signing at the edge\" semantic\n */\nexport class Agent {\n    constructor(agent) {\n        this.pre = '';\n        this.anchor = '';\n        this.verfer = null;\n        this.state = null;\n        this.sn = 0;\n        this.said = '';\n        this.parse(agent);\n    }\n    parse(agent) {\n        const [state, verfer] = this.event(agent);\n        this.sn = new CesrNumber({}, undefined, state['s']).num;\n        this.said = state['d'];\n        if (state['et'] !== Ilks.dip) {\n            throw new Error(`invalid inception event type ${state['et']}`);\n        }\n        this.pre = state['i'];\n        if (!state['di']) {\n            throw new Error('no anchor to controller AID');\n        }\n        this.anchor = state['di'];\n        this.verfer = verfer;\n        this.state = state;\n    }\n    event(evt) {\n        if (evt['k'].length !== 1) {\n            throw new Error(`agent inception event can only have one key`);\n        }\n        const verfer = new Verfer({ qb64: evt['k'][0] });\n        if (evt['n'].length !== 1) {\n            throw new Error(`agent inception event can only have one next key`);\n        }\n        const diger = new Diger({ qb64: evt['n'][0] });\n        const tholder = new Tholder({ sith: evt['kt'] });\n        if (tholder.num !== 1) {\n            throw new Error(`invalid threshold ${tholder.num}, must be 1`);\n        }\n        const ntholder = new Tholder({ sith: evt['nt'] });\n        if (ntholder.num !== 1) {\n            throw new Error(`invalid next threshold ${ntholder.num}, must be 1`);\n        }\n        return [evt, verfer, diger];\n    }\n}\n/**\n * Controller is responsible for managing signing keys for the client and agent.  The client\n * signing key represents the Account for the client on the agent\n */\nexport class Controller {\n    /**\n     * Creates a Signify Controller starting at key index 0 that generates keys in\n     * memory based on the provided seed, or bran, the tier, and the rotation index.\n     *\n     * The rotation index is used as follows:\n     *\n     * @param bran\n     * @param tier\n     * @param ridx\n     * @param state\n     */\n    constructor(bran, tier, ridx = 0, state = null) {\n        this.bran = MtrDex.Salt_128 + 'A' + bran.substring(0, 21); // qb64 salt for seed\n        this.stem = 'signify:controller';\n        this.tier = tier;\n        this.ridx = ridx;\n        const codes = undefined; // Defines the types of seeds that the SaltyCreator will create. Defaults to undefined.\n        const keyCount = 1; // The number of keys to create. Defaults to 1.\n        const transferable = true; // Whether the keys are transferable. Defaults to true.\n        const code = MtrDex.Ed25519_Seed; // The type  cryptographic seed to create by default when not overiddeen by \"codes\".\n        const pidx = 0; // The index of this identifier prefix of all managed identifiers created for this SignifyClient Controller. Defaults to 0.\n        const kidx = 0; // The overall starting key index for the first key this rotation set of keys. This is not a local index to this set of keys but an index in the overall set of keys for all keys in this sequence.\n        // Defaults to 0. Multiply rotation index (ridx) times key count to get the overall key index.\n        this.salter = new Salter({ qb64: this.bran, tier: this.tier });\n        const creator = new SaltyCreator(this.salter.qb64, this.tier, this.stem);\n        // Creates the first key pair used to sign the inception event.\n        // noinspection UnnecessaryLocalVariableJS\n        const initialKeyIndex = ridx; // will be zero for inception\n        this.signer = creator\n            .create(codes, keyCount, code, transferable, pidx, initialKeyIndex, kidx)\n            .signers.pop(); // assumes only one key pair is created because keyCount is 1\n        // Creates the second key pair which a digest of the public key is committed to in the inception event.\n        const nextKeyIndex = ridx + 1;\n        this.nsigner = creator\n            .create(codes, keyCount, code, transferable, pidx, nextKeyIndex, kidx)\n            .signers.pop(); // assumes only one key pair is created because keyCount is 1\n        this.keys = [this.signer.verfer.qb64];\n        this.ndigs = [\n            new Diger({ code: MtrDex.Blake3_256 }, this.nsigner.verfer.qb64b)\n                .qb64,\n        ];\n        if (state == null || state['ee']['s'] == 0) {\n            this.serder = incept({\n                keys: this.keys,\n                isith: '1',\n                nsith: '1',\n                ndigs: this.ndigs,\n                code: MtrDex.Blake3_256,\n                toad: '0',\n                wits: [],\n            });\n        }\n        else {\n            this.serder = new Serder(state['ee']);\n        }\n    }\n    approveDelegation(_agent) {\n        const seqner = new Seqner({ sn: _agent.sn });\n        const anchor = { i: _agent.pre, s: seqner.snh, d: _agent.said };\n        const sn = new CesrNumber({}, undefined, this.serder.sad['s']).num + 1;\n        this.serder = interact({\n            pre: this.serder.pre,\n            dig: this.serder.sad['d'],\n            sn: sn,\n            data: [anchor],\n            version: Vrsn_1_0,\n            kind: Serials.JSON,\n        });\n        return [this.signer.sign(this.serder.raw, 0).qb64];\n    }\n    get pre() {\n        return this.serder.pre;\n    }\n    get event() {\n        const siger = this.signer.sign(this.serder.raw, 0);\n        return [this.serder, siger];\n    }\n    get verfers() {\n        return this.signer.verfer();\n    }\n    derive(state) {\n        if (state != undefined && state['ee']['s'] === '0') {\n            return incept({\n                keys: this.keys,\n                isith: '1',\n                nsith: '1',\n                ndigs: this.ndigs,\n                code: MtrDex.Blake3_256,\n                toad: '0',\n                wits: [],\n            });\n        }\n        else {\n            return new Serder({ sad: state.controller['ee'] });\n        }\n    }\n    rotate(bran, aids) {\n        const nbran = MtrDex.Salt_128 + 'A' + bran.substring(0, 21); // qb64 salt for seed\n        const nsalter = new Salter({ qb64: nbran, tier: this.tier });\n        const nsigner = this.salter.signer(undefined, false);\n        const creator = new SaltyCreator(this.salter.qb64, this.tier, this.stem);\n        const signer = creator\n            .create(undefined, 1, MtrDex.Ed25519_Seed, true, 0, this.ridx + 1, 0, false)\n            .signers.pop();\n        const ncreator = new SaltyCreator(nsalter.qb64, this.tier, this.stem);\n        this.signer = ncreator\n            .create(undefined, 1, MtrDex.Ed25519_Seed, true, 0, this.ridx, 0, false)\n            .signers.pop();\n        this.nsigner = ncreator\n            .create(undefined, 1, MtrDex.Ed25519_Seed, true, 0, this.ridx + 1, 0, false)\n            .signers.pop();\n        this.keys = [this.signer.verfer.qb64, signer === null || signer === void 0 ? void 0 : signer.verfer.qb64];\n        this.ndigs = [new Diger({}, this.nsigner.verfer.qb64b).qb64];\n        const rot = rotate({\n            pre: this.pre,\n            keys: this.keys,\n            dig: this.serder.sad['d'],\n            isith: ['1', '0'],\n            nsith: '1',\n            ndigs: this.ndigs,\n        });\n        const sigs = [\n            signer === null || signer === void 0 ? void 0 : signer.sign(b(rot.raw), 1, false, 0).qb64,\n            this.signer.sign(rot.raw, 0).qb64,\n        ];\n        const encrypter = new Encrypter({}, b(nsigner.verfer.qb64));\n        const decrypter = new Decrypter({}, nsigner.qb64b);\n        const sxlt = encrypter.encrypt(b(this.bran)).qb64;\n        const keys = {};\n        for (const aid of aids) {\n            const pre = aid['prefix'];\n            if ('salty' in aid) {\n                const salty = aid['salty'];\n                const cipher = new Cipher({ qb64: salty['sxlt'] });\n                const dnxt = decrypter.decrypt(null, cipher).qb64;\n                // Now we have the AID salt, use it to verify against the current public keys\n                const acreator = new SaltyCreator(dnxt, salty['tier'], salty['stem']);\n                const signers = acreator.create(salty['icodes'], undefined, MtrDex.Ed25519_Seed, salty['transferable'], salty['pidx'], 0, salty['kidx'], false);\n                const _signers = [];\n                for (const signer of signers.signers) {\n                    _signers.push(signer.verfer.qb64);\n                }\n                const pubs = aid['state']['k'];\n                if (pubs.join(',') != _signers.join(',')) {\n                    throw new Error('Invalid Salty AID');\n                }\n                const asxlt = encrypter.encrypt(b(dnxt)).qb64;\n                keys[pre] = {\n                    sxlt: asxlt,\n                };\n            }\n            else if ('randy' in aid) {\n                const randy = aid['randy'];\n                const prxs = randy['prxs'];\n                const nxts = randy['nxts'];\n                const nprxs = [];\n                const signers = [];\n                for (const prx of prxs) {\n                    const cipher = new Cipher({ qb64: prx });\n                    const dsigner = decrypter.decrypt(null, cipher, true);\n                    signers.push(dsigner);\n                    nprxs.push(encrypter.encrypt(b(dsigner.qb64)).qb64);\n                }\n                const pubs = aid['state']['k'];\n                const _signers = [];\n                for (const signer of signers) {\n                    _signers.push(signer.verfer.qb64);\n                }\n                if (pubs.join(',') != _signers.join(',')) {\n                    throw new Error(`unable to rotate, validation of encrypted public keys ${pubs} failed`);\n                }\n                const nnxts = [];\n                for (const nxt of nxts) {\n                    nnxts.push(this.recrypt(nxt, decrypter, encrypter));\n                }\n                keys[pre] = {\n                    prxs: nprxs,\n                    nxts: nnxts,\n                };\n            }\n            else {\n                throw new Error('invalid aid type ');\n            }\n        }\n        const data = {\n            rot: rot.sad,\n            sigs: sigs,\n            sxlt: sxlt,\n            keys: keys,\n        };\n        return data;\n    }\n    recrypt(enc, decrypter, encrypter) {\n        const cipher = new Cipher({ qb64: enc });\n        const dnxt = decrypter.decrypt(null, cipher).qb64;\n        return encrypter.encrypt(b(dnxt)).qb64;\n    }\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ByteSequence = void 0;\nclass ByteSequence {\n    constructor(base64Value) {\n        this.base64Value = base64Value;\n    }\n    toBase64() {\n        return this.base64Value;\n    }\n}\nexports.ByteSequence = ByteSequence;\n//# sourceMappingURL=types.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isByteSequence = exports.isInnerList = exports.isValidKeyStr = exports.isValidTokenStr = exports.isAscii = void 0;\nconst asciiRe = /^[\\x20-\\x7E]*$/;\nconst tokenRe = /^[a-zA-Z*][:/!#$%&'*+\\-.^_`|~A-Za-z0-9]*$/;\nconst keyRe = /^[a-z*][*\\-_.a-z0-9]*$/;\nfunction isAscii(str) {\n    return asciiRe.test(str);\n}\nexports.isAscii = isAscii;\nfunction isValidTokenStr(str) {\n    return tokenRe.test(str);\n}\nexports.isValidTokenStr = isValidTokenStr;\nfunction isValidKeyStr(str) {\n    return keyRe.test(str);\n}\nexports.isValidKeyStr = isValidKeyStr;\nfunction isInnerList(input) {\n    return Array.isArray(input[0]);\n}\nexports.isInnerList = isInnerList;\nfunction isByteSequence(input) {\n    return typeof input === 'object' && 'base64Value' in input;\n}\nexports.isByteSequence = isByteSequence;\n//# sourceMappingURL=util.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Token = void 0;\nconst util_1 = require(\"./util\");\nclass Token {\n    constructor(value) {\n        if (!(0, util_1.isValidTokenStr)(value)) {\n            throw new TypeError('Invalid character in Token string. Tokens must start with *, A-Z and the rest of the string may only contain a-z, A-Z, 0-9, :/!#$%&\\'*+-.^_`|~');\n        }\n        this.value = value;\n    }\n    toString() {\n        return this.value;\n    }\n}\nexports.Token = Token;\n//# sourceMappingURL=token.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.serializeKey = exports.serializeParameters = exports.serializeToken = exports.serializeByteSequence = exports.serializeBoolean = exports.serializeString = exports.serializeDecimal = exports.serializeInteger = exports.serializeBareItem = exports.serializeInnerList = exports.serializeItem = exports.serializeDictionary = exports.serializeList = exports.SerializeError = void 0;\nconst types_1 = require(\"./types\");\nconst token_1 = require(\"./token\");\nconst util_1 = require(\"./util\");\nclass SerializeError extends Error {\n}\nexports.SerializeError = SerializeError;\nfunction serializeList(input) {\n    return input.map(value => {\n        if ((0, util_1.isInnerList)(value)) {\n            return serializeInnerList(value);\n        }\n        else {\n            return serializeItem(value);\n        }\n    }).join(', ');\n}\nexports.serializeList = serializeList;\nfunction serializeDictionary(input) {\n    return Array.from(input.entries()).map(([key, value]) => {\n        let out = serializeKey(key);\n        if (value[0] === true) {\n            out += serializeParameters(value[1]);\n        }\n        else {\n            out += '=';\n            if ((0, util_1.isInnerList)(value)) {\n                out += serializeInnerList(value);\n            }\n            else {\n                out += serializeItem(value);\n            }\n        }\n        return out;\n    }).join(', ');\n}\nexports.serializeDictionary = serializeDictionary;\nfunction serializeItem(input) {\n    return serializeBareItem(input[0]) + serializeParameters(input[1]);\n}\nexports.serializeItem = serializeItem;\nfunction serializeInnerList(input) {\n    return `(${input[0].map(value => serializeItem(value)).join(' ')})${serializeParameters(input[1])}`;\n}\nexports.serializeInnerList = serializeInnerList;\nfunction serializeBareItem(input) {\n    if (typeof input === 'number') {\n        if (Number.isInteger(input)) {\n            return serializeInteger(input);\n        }\n        return serializeDecimal(input);\n    }\n    if (typeof input === 'string') {\n        return serializeString(input);\n    }\n    if (input instanceof token_1.Token) {\n        return serializeToken(input);\n    }\n    if (input instanceof types_1.ByteSequence) {\n        return serializeByteSequence(input);\n    }\n    if (typeof input === 'boolean') {\n        return serializeBoolean(input);\n    }\n    throw new SerializeError(`Cannot serialize values of type ${typeof input}`);\n}\nexports.serializeBareItem = serializeBareItem;\nfunction serializeInteger(input) {\n    if (input < -999999999999999 || input > 999999999999999) {\n        throw new SerializeError('Structured headers can only encode integers in the range range of -999,999,999,999,999 to 999,999,999,999,999 inclusive');\n    }\n    return input.toString();\n}\nexports.serializeInteger = serializeInteger;\nfunction serializeDecimal(input) {\n    const out = input.toFixed(3).replace(/0+$/, '');\n    const signifantDigits = out.split('.')[0].replace('-', '').length;\n    if (signifantDigits > 12) {\n        throw new SerializeError('Fractional numbers are not allowed to have more than 12 significant digits before the decimal point');\n    }\n    return out;\n}\nexports.serializeDecimal = serializeDecimal;\nfunction serializeString(input) {\n    if (!(0, util_1.isAscii)(input)) {\n        throw new SerializeError('Only ASCII strings may be serialized');\n    }\n    return `\"${input.replace(/(\"|\\\\)/g, (v) => '\\\\' + v)}\"`;\n}\nexports.serializeString = serializeString;\nfunction serializeBoolean(input) {\n    return input ? '?1' : '?0';\n}\nexports.serializeBoolean = serializeBoolean;\nfunction serializeByteSequence(input) {\n    return `:${input.toBase64()}:`;\n}\nexports.serializeByteSequence = serializeByteSequence;\nfunction serializeToken(input) {\n    return input.toString();\n}\nexports.serializeToken = serializeToken;\nfunction serializeParameters(input) {\n    return Array.from(input).map(([key, value]) => {\n        let out = ';' + serializeKey(key);\n        if (value !== true) {\n            out += '=' + serializeBareItem(value);\n        }\n        return out;\n    }).join('');\n}\nexports.serializeParameters = serializeParameters;\nfunction serializeKey(input) {\n    if (!(0, util_1.isValidKeyStr)(input)) {\n        throw new SerializeError('Keys in dictionaries must only contain lowercase letter, numbers, _-*. and must start with a letter or *');\n    }\n    return input;\n}\nexports.serializeKey = serializeKey;\n//# sourceMappingURL=serializer.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ParseError = exports.parseItem = exports.parseList = exports.parseDictionary = void 0;\nconst types_1 = require(\"./types\");\nconst token_1 = require(\"./token\");\nconst util_1 = require(\"./util\");\nfunction parseDictionary(input) {\n    const parser = new Parser(input);\n    return parser.parseDictionary();\n}\nexports.parseDictionary = parseDictionary;\nfunction parseList(input) {\n    const parser = new Parser(input);\n    return parser.parseList();\n}\nexports.parseList = parseList;\nfunction parseItem(input) {\n    const parser = new Parser(input);\n    return parser.parseItem();\n}\nexports.parseItem = parseItem;\nclass ParseError extends Error {\n    constructor(position, message) {\n        super(`Parse error: ${message} at offset ${position}`);\n    }\n}\nexports.ParseError = ParseError;\nclass Parser {\n    constructor(input) {\n        this.input = input;\n        this.pos = 0;\n    }\n    parseDictionary() {\n        this.skipWS();\n        const dictionary = new Map();\n        while (!this.eof()) {\n            const thisKey = this.parseKey();\n            let member;\n            if (this.lookChar() === '=') {\n                this.pos++;\n                member = this.parseItemOrInnerList();\n            }\n            else {\n                member = [true, this.parseParameters()];\n            }\n            dictionary.set(thisKey, member);\n            this.skipOWS();\n            if (this.eof()) {\n                return dictionary;\n            }\n            this.expectChar(',');\n            this.pos++;\n            this.skipOWS();\n            if (this.eof()) {\n                throw new ParseError(this.pos, 'Dictionary contained a trailing comma');\n            }\n        }\n        return dictionary;\n    }\n    parseList() {\n        this.skipWS();\n        const members = [];\n        while (!this.eof()) {\n            members.push(this.parseItemOrInnerList());\n            this.skipOWS();\n            if (this.eof()) {\n                return members;\n            }\n            this.expectChar(',');\n            this.pos++;\n            this.skipOWS();\n            if (this.eof()) {\n                throw new ParseError(this.pos, 'A list may not end with a trailing comma');\n            }\n        }\n        return members;\n    }\n    parseItem(standaloneItem = true) {\n        if (standaloneItem)\n            this.skipWS();\n        const result = [\n            this.parseBareItem(),\n            this.parseParameters()\n        ];\n        if (standaloneItem)\n            this.checkTrail();\n        return result;\n    }\n    parseItemOrInnerList() {\n        if (this.lookChar() === '(') {\n            return this.parseInnerList();\n        }\n        else {\n            return this.parseItem(false);\n        }\n    }\n    parseInnerList() {\n        this.expectChar('(');\n        this.pos++;\n        const innerList = [];\n        while (!this.eof()) {\n            this.skipWS();\n            if (this.lookChar() === ')') {\n                this.pos++;\n                return [\n                    innerList,\n                    this.parseParameters()\n                ];\n            }\n            innerList.push(this.parseItem(false));\n            const nextChar = this.lookChar();\n            if (nextChar !== ' ' && nextChar !== ')') {\n                throw new ParseError(this.pos, 'Expected a whitespace or ) after every item in an inner list');\n            }\n        }\n        throw new ParseError(this.pos, 'Could not find end of inner list');\n    }\n    parseBareItem() {\n        const char = this.lookChar();\n        if (char.match(/^[-0-9]/)) {\n            return this.parseIntegerOrDecimal();\n        }\n        if (char === '\"') {\n            return this.parseString();\n        }\n        if (char.match(/^[A-Za-z*]/)) {\n            return this.parseToken();\n        }\n        if (char === ':') {\n            return this.parseByteSequence();\n        }\n        if (char === '?') {\n            return this.parseBoolean();\n        }\n        throw new ParseError(this.pos, 'Unexpected input');\n    }\n    parseParameters() {\n        const parameters = new Map();\n        while (!this.eof()) {\n            const char = this.lookChar();\n            if (char !== ';') {\n                break;\n            }\n            this.pos++;\n            this.skipWS();\n            const key = this.parseKey();\n            let value = true;\n            if (this.lookChar() === '=') {\n                this.pos++;\n                value = this.parseBareItem();\n            }\n            parameters.set(key, value);\n        }\n        return parameters;\n    }\n    parseIntegerOrDecimal() {\n        let type = 'integer';\n        let sign = 1;\n        let inputNumber = '';\n        if (this.lookChar() === '-') {\n            sign = -1;\n            this.pos++;\n        }\n        // The spec wants this check but it's unreachable code.\n        //if (this.eof()) {\n        //  throw new ParseError(this.pos, 'Empty integer');\n        //}\n        if (!isDigit(this.lookChar())) {\n            throw new ParseError(this.pos, 'Expected a digit (0-9)');\n        }\n        while (!this.eof()) {\n            const char = this.getChar();\n            if (isDigit(char)) {\n                inputNumber += char;\n            }\n            else if (type === 'integer' && char === '.') {\n                if (inputNumber.length > 12) {\n                    throw new ParseError(this.pos, 'Exceeded maximum decimal length');\n                }\n                inputNumber += '.';\n                type = 'decimal';\n            }\n            else {\n                // We need to 'prepend' the character, so it's just a rewind\n                this.pos--;\n                break;\n            }\n            if (type === 'integer' && inputNumber.length > 15) {\n                throw new ParseError(this.pos, 'Exceeded maximum integer length');\n            }\n            if (type === 'decimal' && inputNumber.length > 16) {\n                throw new ParseError(this.pos, 'Exceeded maximum decimal length');\n            }\n        }\n        if (type === 'integer') {\n            return parseInt(inputNumber, 10) * sign;\n        }\n        else {\n            if (inputNumber.endsWith('.')) {\n                throw new ParseError(this.pos, 'Decimal cannot end on a period');\n            }\n            if (inputNumber.split('.')[1].length > 3) {\n                throw new ParseError(this.pos, 'Number of digits after the decimal point cannot exceed 3');\n            }\n            return parseFloat(inputNumber) * sign;\n        }\n    }\n    parseString() {\n        let outputString = '';\n        this.expectChar('\"');\n        this.pos++;\n        while (!this.eof()) {\n            const char = this.getChar();\n            if (char === '\\\\') {\n                if (this.eof()) {\n                    throw new ParseError(this.pos, 'Unexpected end of input');\n                }\n                const nextChar = this.getChar();\n                if (nextChar !== '\\\\' && nextChar !== '\"') {\n                    throw new ParseError(this.pos, 'A backslash must be followed by another backslash or double quote');\n                }\n                outputString += nextChar;\n            }\n            else if (char === '\"') {\n                return outputString;\n            }\n            else if (!(0, util_1.isAscii)(char)) {\n                throw new Error('Strings must be in the ASCII range');\n            }\n            else {\n                outputString += char;\n            }\n        }\n        throw new ParseError(this.pos, 'Unexpected end of input');\n    }\n    parseToken() {\n        // The specification wants this check, but it's an unreachable code block.\n        // if (!/^[A-Za-z*]/.test(this.lookChar())) {\n        //  throw new ParseError(this.pos, 'A token must begin with an asterisk or letter (A-Z, a-z)');\n        //}\n        let outputString = '';\n        while (!this.eof()) {\n            const char = this.lookChar();\n            if (!/^[:/!#$%&'*+\\-.^_`|~A-Za-z0-9]$/.test(char)) {\n                return new token_1.Token(outputString);\n            }\n            outputString += this.getChar();\n        }\n        return new token_1.Token(outputString);\n    }\n    parseByteSequence() {\n        this.expectChar(':');\n        this.pos++;\n        const endPos = this.input.indexOf(':', this.pos);\n        if (endPos === -1) {\n            throw new ParseError(this.pos, 'Could not find a closing \":\" character to mark end of Byte Sequence');\n        }\n        const b64Content = this.input.substring(this.pos, endPos);\n        this.pos += b64Content.length + 1;\n        if (!/^[A-Za-z0-9+/=]*$/.test(b64Content)) {\n            throw new ParseError(this.pos, 'ByteSequence does not contain a valid base64 string');\n        }\n        return new types_1.ByteSequence(b64Content);\n    }\n    parseBoolean() {\n        this.expectChar('?');\n        this.pos++;\n        const char = this.getChar();\n        if (char === '1') {\n            return true;\n        }\n        if (char === '0') {\n            return false;\n        }\n        throw new ParseError(this.pos, 'Unexpected character. Expected a \"1\" or a \"0\"');\n    }\n    parseKey() {\n        if (!this.lookChar().match(/^[a-z*]/)) {\n            throw new ParseError(this.pos, 'A key must begin with an asterisk or letter (a-z)');\n        }\n        let outputString = '';\n        while (!this.eof()) {\n            const char = this.lookChar();\n            if (!/^[a-z0-9_\\-.*]$/.test(char)) {\n                return outputString;\n            }\n            outputString += this.getChar();\n        }\n        return outputString;\n    }\n    /**\n     * Looks at the next character without advancing the cursor.\n     */\n    lookChar() {\n        return this.input[this.pos];\n    }\n    /**\n     * Checks if the next character is 'char', and fail otherwise.\n     */\n    expectChar(char) {\n        if (this.lookChar() !== char) {\n            throw new ParseError(this.pos, `Expected ${char}`);\n        }\n    }\n    getChar() {\n        return this.input[this.pos++];\n    }\n    eof() {\n        return this.pos >= this.input.length;\n    }\n    // Advances the pointer to skip all whitespace.\n    skipOWS() {\n        while (true) {\n            const c = this.input.substr(this.pos, 1);\n            if (c === ' ' || c === '\\t') {\n                this.pos++;\n            }\n            else {\n                break;\n            }\n        }\n    }\n    // Advances the pointer to skip all spaces\n    skipWS() {\n        while (this.lookChar() === ' ') {\n            this.pos++;\n        }\n    }\n    // At the end of parsing, we need to make sure there are no bytes after the\n    // header except whitespace.\n    checkTrail() {\n        this.skipWS();\n        if (!this.eof()) {\n            throw new ParseError(this.pos, 'Unexpected characters at end of input');\n        }\n    }\n}\nexports.default = Parser;\nconst isDigitRegex = /^[0-9]$/;\nfunction isDigit(char) {\n    return isDigitRegex.test(char);\n}\n//# sourceMappingURL=parser.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Token = void 0;\n__exportStar(require(\"./serializer\"), exports);\n__exportStar(require(\"./parser\"), exports);\n__exportStar(require(\"./types\"), exports);\n__exportStar(require(\"./util\"), exports);\nvar token_1 = require(\"./token\");\nObject.defineProperty(exports, \"Token\", { enumerable: true, get: function () { return token_1.Token; } });\n//# sourceMappingURL=index.js.map","import { serializeDictionary, parseDictionary, } from 'structured-headers';\nimport { b } from \"./core.js\";\nimport { nowUTC } from \"./utils.js\";\nimport { encodeBase64Url } from \"./base64.js\";\nexport const HEADER_SIG_INPUT = normalize('Signature-Input');\nexport const HEADER_SIG_TIME = normalize('Signify-Timestamp');\nexport function normalize(header) {\n    return header.trim();\n}\n/**\n * Generates, serializes, and signs a Signature-Input HTTP header value as a structured header\n * @param signer\n * @param sigInputArgs\n */\nexport function siginput(signer, sigInputArgs) {\n    const { name, method, path, headers, fields, expires, nonce, alg, keyid, context, } = sigInputArgs;\n    const items = new Array();\n    const ifields = new Array();\n    fields.forEach((field) => {\n        if (field.startsWith('@')) {\n            switch (field) {\n                case '@method':\n                    items.push(`\"${field}\": ${method}`);\n                    ifields.push([field, new Map()]);\n                    break;\n                case '@path':\n                    items.push(`\"${field}\": ${path}`);\n                    ifields.push([field, new Map()]);\n                    break;\n            }\n        }\n        else {\n            if (!headers.has(field))\n                return;\n            ifields.push([field, new Map()]);\n            const value = normalize(headers.get(field));\n            items.push(`\"${field}\": ${value}`);\n        }\n    });\n    const nameParams = new Map();\n    const now = Math.floor(nowUTC().getTime() / 1000);\n    nameParams.set('created', now);\n    const values = [\n        `(${ifields.map((field) => field[0]).join(' ')})`,\n        `created=${now}`,\n    ];\n    if (expires != undefined) {\n        values.push(`expires=${expires}`);\n        nameParams.set('expires', expires);\n    }\n    if (nonce != undefined) {\n        values.push(`nonce=${nonce}`);\n        nameParams.set('nonce', nonce);\n    }\n    if (keyid != undefined) {\n        values.push(`keyid=${keyid}`);\n        nameParams.set('keyid', keyid);\n    }\n    if (context != undefined) {\n        values.push(`context=${context}`);\n        nameParams.set('context', context);\n    }\n    if (alg != undefined) {\n        values.push(`alg=${alg}`);\n        nameParams.set('alg', alg);\n    }\n    const sid = new Map([[name, [ifields, nameParams]]]);\n    const params = values.join(';');\n    items.push(`\"@signature-params: ${params}\"`);\n    const ser = items.join('\\n');\n    const sig = signer.sign(b(ser));\n    return [\n        new Map([\n            [HEADER_SIG_INPUT, `${serializeDictionary(sid)}`],\n        ]),\n        sig,\n    ];\n}\nexport class Unqualified {\n    constructor(raw) {\n        this._raw = raw;\n    }\n    get qb64() {\n        return encodeBase64Url(this._raw);\n    }\n    get qb64b() {\n        return b(this.qb64);\n    }\n}\nexport class Inputage {\n}\nexport function desiginput(value) {\n    const sid = parseDictionary(value);\n    const siginputs = new Array();\n    sid.forEach((value, key) => {\n        const siginput = new Inputage();\n        siginput.name = key;\n        let list;\n        let params;\n        [list, params] = value;\n        siginput.fields = list.map((item) => item[0]);\n        if (!params.has('created')) {\n            throw new Error('missing required `created` field from signature input');\n        }\n        siginput.created = params.get('created');\n        if (params.has('expires')) {\n            siginput.expires = params.get('expires');\n        }\n        if (params.has('nonce')) {\n            siginput.nonce = params.get('nonce');\n        }\n        if (params.has('alg')) {\n            siginput.alg = params.get('alg');\n        }\n        if (params.has('keyid')) {\n            siginput.keyid = params.get('keyid');\n        }\n        if (params.has('context')) {\n            siginput.context = params.get('context');\n        }\n        siginputs.push(siginput);\n    });\n    return siginputs;\n}\n/** Parse start, end and total from HTTP Content-Range header value\n * @param {string|null} header - HTTP Range header value\n * @param {string} typ - type of range, e.g. \"aids\"\n * @returns {start: number, end: number, total: number} - object with start, end and total properties\n */\nexport function parseRangeHeaders(header, typ) {\n    if (header !== null) {\n        const data = header.replace(`${typ} `, '');\n        const values = data.split('/');\n        const rng = values[0].split('-');\n        return {\n            start: parseInt(rng[0]),\n            end: parseInt(rng[1]),\n            total: parseInt(values[1]),\n        };\n    }\n    else {\n        return { start: 0, end: 0, total: 0 };\n    }\n}\n","import { Algos } from \"../core/manager.js\";\nimport { incept, interact, reply, rotate } from \"../core/eventing.js\";\nimport { b, Ilks, Serials, Vrsn_1_0 } from \"../core/core.js\";\nimport { Tholder } from \"../core/tholder.js\";\nimport { MtrDex } from \"../core/matter.js\";\nimport { parseRangeHeaders } from \"../core/httping.js\";\n/** Identifier */\nexport class Identifier {\n    /**\n     * Identifier\n     * @param {IdentifierDeps} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List managed identifiers\n     * @async\n     * @param {number} [start=0] Start index of list of notifications, defaults to 0\n     * @param {number} [end=24] End index of list of notifications, defaults to 24\n     * @returns {Promise<any>} A promise to the list of managed identifiers\n     */\n    async list(start = 0, end = 24) {\n        const extraHeaders = new Headers();\n        extraHeaders.append('Range', `aids=${start}-${end}`);\n        const path = `/identifiers`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data, extraHeaders);\n        const cr = res.headers.get('content-range');\n        const range = parseRangeHeaders(cr, 'aids');\n        const aids = await res.json();\n        return {\n            start: range.start,\n            end: range.end,\n            total: range.total,\n            aids: aids,\n        };\n    }\n    /**\n     * Get information for a managed identifier\n     * @async\n     * @param {string} name Prefix or alias of the identifier\n     * @returns {Promise<HabState>} A promise to the identifier information\n     */\n    async get(name) {\n        const path = `/identifiers/${encodeURIComponent(name)}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Update managed identifier\n     * @async\n     * @param {string} name Prefix or alias of the identifier\n     * @param {IdentifierInfo} info Information to update for the given identifier\n     * @returns {Promise<HabState>} A promise to the identifier information after updating\n     */\n    async update(name, info) {\n        const path = `/identifiers/${name}`;\n        const method = 'PUT';\n        const res = await this.client.fetch(path, method, info);\n        return await res.json();\n    }\n    /**\n     * Create a managed identifier\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @param {CreateIdentiferArgs} [kargs] Optional parameters to create the identifier\n     * @returns {EventResult} The inception result\n     */\n    async create(name, kargs = {}) {\n        var _a, _b, _c, _d, _e, _f;\n        const algo = kargs.algo == undefined ? Algos.salty : kargs.algo;\n        const transferable = (_a = kargs.transferable) !== null && _a !== void 0 ? _a : true;\n        const isith = (_b = kargs.isith) !== null && _b !== void 0 ? _b : '1';\n        let nsith = (_c = kargs.nsith) !== null && _c !== void 0 ? _c : '1';\n        let wits = (_d = kargs.wits) !== null && _d !== void 0 ? _d : [];\n        const toad = (_e = kargs.toad) !== null && _e !== void 0 ? _e : 0;\n        let dcode = (_f = kargs.dcode) !== null && _f !== void 0 ? _f : MtrDex.Blake3_256;\n        const proxy = kargs.proxy;\n        const delpre = kargs.delpre;\n        const data = kargs.data != undefined ? [kargs.data] : [];\n        const pre = kargs.pre;\n        const states = kargs.states;\n        const rstates = kargs.rstates;\n        const prxs = kargs.prxs;\n        const nxts = kargs.nxts;\n        const mhab = kargs.mhab;\n        const _keys = kargs.keys;\n        const _ndigs = kargs.ndigs;\n        const bran = kargs.bran;\n        const count = kargs.count;\n        let ncount = kargs.ncount;\n        const tier = kargs.tier;\n        const extern_type = kargs.extern_type;\n        const extern = kargs.extern;\n        if (!transferable) {\n            ncount = 0;\n            nsith = 0;\n            dcode = MtrDex.Ed25519N;\n        }\n        const xargs = {\n            transferable: transferable,\n            isith: isith,\n            nsith: nsith,\n            wits: wits,\n            toad: toad,\n            proxy: proxy,\n            delpre: delpre,\n            dcode: dcode,\n            data: data,\n            algo: algo,\n            pre: pre,\n            prxs: prxs,\n            nxts: nxts,\n            mhab: mhab,\n            states: states,\n            rstates: rstates,\n            keys: _keys,\n            ndigs: _ndigs,\n            bran: bran,\n            count: count,\n            ncount: ncount,\n            tier: tier,\n            extern_type: extern_type,\n            extern: extern,\n        };\n        const keeper = this.client.manager.new(algo, this.client.pidx, xargs);\n        const [keys, ndigs] = await keeper.incept(transferable);\n        wits = wits !== undefined ? wits : [];\n        let serder = undefined;\n        if (delpre == undefined) {\n            serder = incept({\n                keys: keys,\n                isith: isith,\n                ndigs: ndigs,\n                nsith: nsith,\n                toad: toad,\n                wits: wits,\n                cnfg: [],\n                data: data,\n                version: Vrsn_1_0,\n                kind: Serials.JSON,\n                code: dcode,\n                intive: false,\n            });\n        }\n        else {\n            serder = incept({\n                keys: keys,\n                isith: isith,\n                ndigs: ndigs,\n                nsith: nsith,\n                toad: toad,\n                wits: wits,\n                cnfg: [],\n                data: data,\n                version: Vrsn_1_0,\n                kind: Serials.JSON,\n                code: dcode,\n                intive: false,\n                delpre: delpre,\n            });\n        }\n        const sigs = await keeper.sign(b(serder.raw));\n        const jsondata = {\n            name: name,\n            icp: serder.sad,\n            sigs: sigs,\n            proxy: proxy,\n            smids: states != undefined\n                ? states.map((state) => state.i)\n                : undefined,\n            rmids: rstates != undefined\n                ? rstates.map((state) => state.i)\n                : undefined,\n        };\n        jsondata[algo] = keeper.params();\n        this.client.pidx = this.client.pidx + 1;\n        const res = await this.client.fetch('/identifiers', 'POST', jsondata);\n        return new EventResult(serder, sigs, res);\n    }\n    /**\n     * Generate an interaction event in a managed identifier\n     * @async\n     * @param {string} name Prefix or alias of the identifier\n     * @param {any} [data] Option data to be anchored in the interaction event\n     * @returns {Promise<EventResult>} A promise to the interaction event result\n     */\n    async interact(name, data) {\n        const { serder, sigs, jsondata } = await this.createInteract(name, data);\n        const res = await this.client.fetch('/identifiers/' + name + '/events', 'POST', jsondata);\n        return new EventResult(serder, sigs, res);\n    }\n    async createInteract(name, data) {\n        const hab = await this.get(name);\n        const pre = hab.prefix;\n        const state = hab.state;\n        const sn = parseInt(state.s, 16);\n        const dig = state.d;\n        data = Array.isArray(data) ? data : [data];\n        const serder = interact({\n            pre: pre,\n            sn: sn + 1,\n            data: data,\n            dig: dig,\n            version: undefined,\n            kind: undefined,\n        });\n        const keeper = this.client.manager.get(hab);\n        const sigs = await keeper.sign(b(serder.raw));\n        const jsondata = {\n            ixn: serder.sad,\n            sigs: sigs,\n        };\n        jsondata[keeper.algo] = keeper.params();\n        return { serder, sigs, jsondata };\n    }\n    /**\n     * Generate a rotation event in a managed identifier\n     * @param {string} name Name or alias of the identifier\n     * @param {RotateIdentifierArgs} [kargs] Optional parameters requiered to generate the rotation event\n     * @returns {Promise<EventResult>} A promise to the rotation event result\n     */\n    async rotate(name, kargs = {}) {\n        var _a, _b, _c, _d, _e, _f, _g;\n        const transferable = (_a = kargs.transferable) !== null && _a !== void 0 ? _a : true;\n        const ncode = (_b = kargs.ncode) !== null && _b !== void 0 ? _b : MtrDex.Ed25519_Seed;\n        const ncount = (_c = kargs.ncount) !== null && _c !== void 0 ? _c : 1;\n        const hab = await this.get(name);\n        const pre = hab.prefix;\n        const delegated = hab.state.di !== '';\n        const state = hab.state;\n        const count = state.k.length;\n        const dig = state.d;\n        const ridx = parseInt(state.s, 16) + 1;\n        const wits = state.b;\n        let isith = state.nt;\n        let nsith = (_d = kargs.nsith) !== null && _d !== void 0 ? _d : isith;\n        // if isith is None:  # compute default from newly rotated verfers above\n        if (isith == undefined)\n            isith = `${Math.max(1, Math.ceil(count / 2)).toString(16)}`;\n        // if nsith is None:  # compute default from newly rotated digers above\n        if (nsith == undefined)\n            nsith = `${Math.max(1, Math.ceil(ncount / 2)).toString(16)}`;\n        const cst = new Tholder({ sith: isith }).sith; // current signing threshold\n        const nst = new Tholder({ sith: nsith }).sith; // next signing threshold\n        // Regenerate next keys to sign rotation event\n        const keeper = this.client.manager.get(hab);\n        // Create new keys for next digests\n        const ncodes = (_e = kargs.ncodes) !== null && _e !== void 0 ? _e : new Array(ncount).fill(ncode);\n        const states = kargs.states == undefined ? [] : kargs.states;\n        const rstates = kargs.rstates == undefined ? [] : kargs.rstates;\n        const [keys, ndigs] = await keeper.rotate(ncodes, transferable, states, rstates);\n        const cuts = (_f = kargs.cuts) !== null && _f !== void 0 ? _f : [];\n        const adds = (_g = kargs.adds) !== null && _g !== void 0 ? _g : [];\n        const data = kargs.data != undefined ? [kargs.data] : [];\n        const toad = kargs.toad;\n        const ilk = delegated ? Ilks.drt : Ilks.rot;\n        const serder = rotate({\n            pre: pre,\n            ilk: ilk,\n            keys: keys,\n            dig: dig,\n            sn: ridx,\n            isith: cst,\n            nsith: nst,\n            ndigs: ndigs,\n            toad: toad,\n            wits: wits,\n            cuts: cuts,\n            adds: adds,\n            data: data,\n        });\n        const sigs = await keeper.sign(b(serder.raw));\n        const jsondata = {\n            rot: serder.sad,\n            sigs: sigs,\n            smids: states != undefined\n                ? states.map((state) => state.i)\n                : undefined,\n            rmids: rstates != undefined\n                ? rstates.map((state) => state.i)\n                : undefined,\n        };\n        jsondata[keeper.algo] = keeper.params();\n        const res = await this.client.fetch('/identifiers/' + name + '/events', 'POST', jsondata);\n        return new EventResult(serder, sigs, res);\n    }\n    /**\n     * Authorize an endpoint provider in a given role for a managed identifier\n     * @remarks\n     * Typically used to authorize the agent to be the endpoint provider for the identifier in the role of `agent`\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @param {string} role Authorized role for eid\n     * @param {string} [eid] Optional qb64 of endpoint provider to be authorized\n     * @param {string} [stamp=now] Optional date-time-stamp RFC-3339 profile of iso8601 datetime. Now is the default if not provided\n     * @returns {Promise<EventResult>} A promise to the result of the authorization\n     */\n    async addEndRole(name, role, eid, stamp) {\n        const hab = await this.get(name);\n        const pre = hab.prefix;\n        const rpy = this.makeEndRole(pre, role, eid, stamp);\n        const keeper = this.client.manager.get(hab);\n        const sigs = await keeper.sign(b(rpy.raw));\n        const jsondata = {\n            rpy: rpy.sad,\n            sigs: sigs,\n        };\n        const res = await this.client.fetch('/identifiers/' + name + '/endroles', 'POST', jsondata);\n        return new EventResult(rpy, sigs, res);\n    }\n    /**\n     * Generate an /end/role/add reply message\n     * @param {string} pre Prefix of the identifier\n     * @param {string} role Authorized role for eid\n     * @param {string} [eid] Optional qb64 of endpoint provider to be authorized\n     * @param {string} [stamp=now] Optional date-time-stamp RFC-3339 profile of iso8601 datetime. Now is the default if not provided\n     * @returns {Serder} The reply message\n     */\n    makeEndRole(pre, role, eid, stamp) {\n        const data = {\n            cid: pre,\n            role: role,\n        };\n        if (eid != undefined) {\n            data.eid = eid;\n        }\n        const route = '/end/role/add';\n        return reply(route, data, stamp, undefined, Serials.JSON);\n    }\n    /**\n     * Get the members of a group identifier\n     * @async\n     * @param {string} name - Name or alias of the identifier\n     * @returns {Promise<any>} - A promise to the list of members\n     */\n    async members(name) {\n        const res = await this.client.fetch('/identifiers/' + name + '/members', 'GET', undefined);\n        return await res.json();\n    }\n}\n/** Event Result */\nexport class EventResult {\n    constructor(serder, sigs, response) {\n        this._serder = serder;\n        this._sigs = sigs;\n        this.response = response;\n    }\n    get serder() {\n        return this._serder;\n    }\n    get sigs() {\n        return this._sigs;\n    }\n    async op() {\n        return await this.response.json();\n    }\n}\n","import { Siger } from \"../core/siger.js\";\nimport { Cigar } from \"../core/cigar.js\";\nexport const FALSY = [false, 0, '?0', 'no', 'false', 'False', 'off'];\nexport const TRUTHY = [true, 1, '?1', 'yes', 'true', 'True', 'on'];\nexport class Signage {\n    constructor(markers, indexed, signer, ordinal, digest, kind) {\n        this.markers = markers;\n        this.indexed = indexed;\n        this.signer = signer;\n        this.ordinal = ordinal;\n        this.digest = digest;\n        this.kind = kind;\n    }\n}\nexport function signature(signages) {\n    var _a;\n    const values = [];\n    for (const signage of signages) {\n        let markers;\n        let tags;\n        if (signage.markers instanceof Map) {\n            markers = Array.from(signage.markers.values());\n            tags = Array.from(signage.markers.keys());\n        }\n        else {\n            markers = signage.markers;\n            tags = [];\n        }\n        const items = new Array();\n        const indexed = (_a = signage.indexed) !== null && _a !== void 0 ? _a : markers[0] instanceof Siger;\n        if (indexed) {\n            items.push('indexed=\"?1\"');\n        }\n        else {\n            items.push('indexed=\"?0\"');\n        }\n        if (signage.signer != undefined) {\n            items.push(`signer=\"${signage.signer}\"`);\n        }\n        if (signage.ordinal != undefined) {\n            items.push(`ordinal=\"${signage.ordinal}\"`);\n        }\n        if (signage.digest != undefined) {\n            items.push(`digest=\"${signage.digest}\"`);\n        }\n        if (signage.kind != undefined) {\n            items.push(`kind=\"${signage.kind}\"`);\n        }\n        items.push(...markers.map((marker, idx) => {\n            let tag = undefined;\n            let val;\n            if (tags != undefined && tags.length > idx) {\n                tag = tags[idx];\n            }\n            if (marker instanceof Siger) {\n                if (!indexed) {\n                    throw new Error(`Indexed signature marker ${marker} when indexed False.`);\n                }\n                tag = tag !== null && tag !== void 0 ? tag : marker.index.toString();\n                val = marker.qb64;\n            }\n            else if (marker instanceof Cigar) {\n                if (indexed) {\n                    throw new Error(`Unindexed signature marker ${marker} when indexed True.`);\n                }\n                if (!marker.verfer) {\n                    throw new Error(`Indexed signature marker is missing verfer`);\n                }\n                tag = tag !== null && tag !== void 0 ? tag : marker.verfer.qb64;\n                val = marker.qb64;\n            }\n            else {\n                tag = tag !== null && tag !== void 0 ? tag : idx.toString();\n                val = marker;\n            }\n            return `${tag}=\"${val}\"`;\n        }));\n        values.push(items.join(';'));\n    }\n    return new Headers([['Signature', values.join(',')]]);\n}\nexport function designature(value) {\n    const values = value.replace(' ', '').split(',');\n    const signages = values.map((val) => {\n        const dict = new Map();\n        val.split(';').forEach((v) => {\n            const splits = v.split('=', 2);\n            dict.set(splits[0], splits[1].replaceAll('\"', ''));\n        });\n        if (!dict.has('indexed')) {\n            throw new Error('Missing indexed field in Signature header signage.');\n        }\n        const item = dict.get('indexed');\n        const indexed = !FALSY.includes(item);\n        dict.delete('indexed');\n        let signer;\n        if (dict.has('signer')) {\n            signer = dict.get('signer');\n            dict.delete('signer');\n        }\n        let ordinal;\n        if (dict.has('ordinal')) {\n            ordinal = dict.get('ordinal');\n            dict.delete('ordinal');\n        }\n        let digest;\n        if (dict.has('digest')) {\n            digest = dict.get('digest');\n            dict.delete('digest');\n        }\n        let kind;\n        if (dict.has('kind')) {\n            kind = dict.get('kind');\n            dict.delete('kind');\n        }\n        else {\n            kind = 'CESR';\n        }\n        if (kind == 'CESR') {\n            const markers = new Map();\n            for (const [key, val] of dict.entries()) {\n                if (indexed) {\n                    markers.set(key, new Siger({ qb64: val }));\n                }\n                else {\n                    markers.set(key, new Cigar({ qb64: val }));\n                }\n            }\n            return new Signage(markers, indexed, signer, ordinal, digest, kind);\n        }\n        else {\n            return new Signage(dict, indexed, signer, ordinal, digest, kind);\n        }\n    });\n    return signages;\n}\n","import { desiginput, HEADER_SIG_INPUT, HEADER_SIG_TIME, normalize, siginput, } from \"./httping.js\";\nimport { Signage, signature, designature } from \"../end/ending.js\";\nexport class Authenticater {\n    constructor(csig, verfer) {\n        this._csig = csig;\n        this._verfer = verfer;\n    }\n    verify(headers, method, path) {\n        const siginput = headers.get(HEADER_SIG_INPUT);\n        if (siginput == null) {\n            return false;\n        }\n        const signature = headers.get('Signature');\n        if (signature == null) {\n            return false;\n        }\n        let inputs = desiginput(siginput);\n        inputs = inputs.filter((input) => input.name == 'signify');\n        if (inputs.length == 0) {\n            return false;\n        }\n        inputs.forEach((input) => {\n            const items = new Array();\n            input.fields.forEach((field) => {\n                if (field.startsWith('@')) {\n                    if (field == '@method') {\n                        items.push(`\"${field}\": ${method}`);\n                    }\n                    else if (field == '@path') {\n                        items.push(`\"${field}\": ${path}`);\n                    }\n                }\n                else {\n                    if (headers.has(field)) {\n                        const value = normalize(headers.get(field));\n                        items.push(`\"${field}\": ${value}`);\n                    }\n                }\n            });\n            const values = new Array();\n            values.push(`(${input.fields.join(' ')})`);\n            values.push(`created=${input.created}`);\n            if (input.expires != undefined) {\n                values.push(`expires=${input.expires}`);\n            }\n            if (input.nonce != undefined) {\n                values.push(`nonce=${input.nonce}`);\n            }\n            if (input.keyid != undefined) {\n                values.push(`keyid=${input.keyid}`);\n            }\n            if (input.context != undefined) {\n                values.push(`context=${input.context}`);\n            }\n            if (input.alg != undefined) {\n                values.push(`alg=${input.alg}`);\n            }\n            const params = values.join(';');\n            items.push(`\"@signature-params: ${params}\"`);\n            const ser = items.join('\\n');\n            const signage = designature(signature);\n            const markers = signage[0].markers;\n            const cig = markers.get(input.name);\n            if (!cig || !this._verfer.verify(cig.raw, ser)) {\n                throw new Error(`Signature for ${input.keyid} invalid.`);\n            }\n        });\n        return true;\n    }\n    sign(headers, method, path, fields) {\n        if (fields == undefined) {\n            fields = Authenticater.DefaultFields;\n        }\n        const [header, sig] = siginput(this._csig, {\n            name: 'signify',\n            method,\n            path,\n            headers,\n            fields,\n            alg: 'ed25519',\n            keyid: this._csig.verfer.qb64,\n        });\n        header.forEach((value, key) => {\n            headers.append(key, value);\n        });\n        const markers = new Map();\n        markers.set('signify', sig);\n        const signage = new Signage(markers, false);\n        const signed = signature([signage]);\n        signed.forEach((value, key) => {\n            headers.append(key, value);\n        });\n        return headers;\n    }\n}\nAuthenticater.DefaultFields = [\n    '@method',\n    '@path',\n    'signify-resource',\n    HEADER_SIG_TIME.toLowerCase(),\n];\n","import { Algos, SaltyCreator, RandyCreator } from \"./manager.js\";\nimport { MtrDex } from \"./matter.js\";\nimport { Tier } from \"./salter.js\";\nimport { Encrypter } from \"../core/encrypter.js\";\nimport { Decrypter } from \"./decrypter.js\";\nimport { b } from \"./core.js\";\nimport { Cipher } from \"./cipher.js\";\nimport { Diger } from \"./diger.js\";\nimport { Prefixer } from \"./prefixer.js\";\n/**\n * Creates IdentifierManager instances based on the algorithm and key indexes.\n */\nexport class IdentifierManagerFactory {\n    /**\n     * Creates a factory for generating IdentifierManagers. Requires a salt to be specified.\n     * Allows external key management modules to be configured.\n     * @param salter\n     * @param externalModules\n     */\n    constructor(salter, externalModules = []) {\n        this.salter = salter;\n        this.modules = {};\n        this.salter = salter;\n        for (const mod of externalModules) {\n            this.modules[mod.type] = mod.module;\n        }\n    }\n    /**\n     *\n     * @param algo\n     * @param pidx\n     * @param kargs\n     */\n    new(algo, pidx, kargs) {\n        switch (algo) {\n            case Algos.salty:\n                return new SaltyIdentifierManager(this.salter, pidx, kargs['kidx'], kargs['tier'], kargs['transferable'], kargs['stem'], kargs['code'], kargs['count'], kargs['icodes'], kargs['ncode'], kargs['ncount'], kargs['ncodes'], kargs['dcode'], kargs['bran'], kargs['sxlt']);\n            case Algos.randy:\n                return new RandyIdentifierManager(this.salter, kargs['code'], kargs['count'], kargs['icodes'], kargs['transferable'], kargs['ncode'], kargs['ncount'], kargs['ncodes'], kargs['dcode'], kargs['prxs'], kargs['nxts']);\n            case Algos.group:\n                return new GroupIdentifierManager(this, kargs['mhab'], kargs['states'], kargs['rstates'], kargs['keys'], kargs['ndigs']);\n            case Algos.extern: {\n                const ModuleConstructor = this.modules[kargs.extern_type];\n                if (!ModuleConstructor) {\n                    throw new Error(`unsupported external module type ${kargs.extern_type}`);\n                }\n                return new ModuleConstructor(pidx, kargs);\n            }\n            default:\n                throw new Error('Unknown algo');\n        }\n    }\n    /**\n     * Generates an algorithm-specific IdentifierManager instance with correct keys based on\n     * the indexes provided by the HabState.\n     * @param aid HabState with the algorithm and key indexes\n     * @returns IdentifierManager instance\n     */\n    get(aid) {\n        const algo = aid[Algos.salty]\n            ? Algos.salty\n            : aid[Algos.randy]\n                ? Algos.randy\n                : aid[Algos.group]\n                    ? Algos.group\n                    : aid[Algos.extern]\n                        ? Algos.extern\n                        : undefined;\n        if (!algo) {\n            throw new Error('No algo specified');\n        }\n        let kargs = aid[algo];\n        if (!kargs) {\n            throw new Error('No kargs found in HabState');\n        }\n        switch (algo) {\n            case Algos.salty:\n                kargs = kargs;\n                return new SaltyIdentifierManager(this.salter, kargs.pidx, kargs.kidx, kargs.tier, kargs.transferable, kargs.stem, undefined, undefined, kargs.icodes, undefined, undefined, kargs.ncodes, kargs.dcode, undefined, kargs.sxlt);\n            case Algos.randy:\n                kargs = kargs;\n                return new RandyIdentifierManager(this.salter, undefined, undefined, undefined, new Prefixer({ qb64: aid['prefix'] }).transferable, undefined, undefined, [], undefined, kargs.prxs, kargs.nxts);\n            case Algos.group:\n                kargs = kargs;\n                return new GroupIdentifierManager(this, kargs.mhab, undefined, undefined, kargs.keys, kargs.ndigs);\n            case Algos.extern: {\n                kargs = kargs;\n                const typ = kargs.extern_type;\n                if (typ in this.modules) {\n                    const mod = new this.modules[typ](kargs.pidx, kargs);\n                    return mod;\n                }\n                else {\n                    throw new Error(`unsupported external module type ${typ}`);\n                }\n            }\n            default:\n                throw new Error('Algo not allowed yet');\n        }\n    }\n}\nexport class SaltyIdentifierManager {\n    constructor(salter, pidx, kidx = 0, tier = Tier.low, transferable = false, stem = undefined, code = MtrDex.Ed25519_Seed, count = 1, icodes = undefined, ncode = MtrDex.Ed25519_Seed, ncount = 1, ncodes = undefined, dcode = MtrDex.Blake3_256, bran = undefined, sxlt = undefined) {\n        this.algo = Algos.salty;\n        // # Salter is the entered passcode and used for enc/dec of salts for each AID\n        this.salter = salter;\n        const signer = this.salter.signer(code, transferable, undefined, tier);\n        this.aeid = signer.verfer.qb64;\n        this.encrypter = new Encrypter({}, b(this.aeid));\n        this.decrypter = new Decrypter({}, signer.qb64b);\n        this.code = code;\n        this.ncode = ncode;\n        this.tier = tier;\n        this.icodes =\n            icodes == undefined ? new Array(count).fill(code) : icodes;\n        this.ncodes =\n            ncodes == undefined\n                ? new Array(ncount).fill(ncode)\n                : ncodes;\n        this.dcode = dcode;\n        this.pidx = pidx;\n        this.kidx = kidx;\n        this.transferable = transferable;\n        this.count = count;\n        this.ncount = ncount;\n        this.stem = stem == undefined ? 'signify:aid' : stem;\n        if (bran != undefined) {\n            this.bran = MtrDex.Salt_128 + 'A' + bran.slice(0, 21);\n            this.creator = new SaltyCreator(this.bran, this.tier, this.stem);\n            this.sxlt = this.encrypter.encrypt(b(this.creator.salt)).qb64;\n        }\n        else if (sxlt == undefined) {\n            this.creator = new SaltyCreator(undefined, this.tier, this.stem);\n            this.sxlt = this.encrypter.encrypt(b(this.creator.salt)).qb64;\n        }\n        else {\n            this.sxlt = sxlt;\n            const ciph = new Cipher({ qb64: this.sxlt });\n            this.creator = new SaltyCreator(this.decrypter.decrypt(null, ciph).qb64, tier, this.stem);\n        }\n        this.signers = this.creator.create(this.icodes, this.ncount, this.ncode, this.transferable, this.pidx, 0, this.kidx, false).signers;\n    }\n    params() {\n        return {\n            sxlt: this.sxlt,\n            pidx: this.pidx,\n            kidx: this.kidx,\n            stem: this.stem,\n            tier: this.tier,\n            icodes: this.icodes,\n            ncodes: this.ncodes,\n            dcode: this.dcode,\n            transferable: this.transferable,\n        };\n    }\n    async incept(transferable) {\n        var _a;\n        this.transferable = transferable;\n        this.kidx = 0;\n        const signers = this.creator.create(this.icodes, this.count, this.code, this.transferable, this.pidx, 0, this.kidx, false);\n        const verfers = signers.signers.map((signer) => signer.verfer.qb64);\n        const nsigners = this.creator.create(this.ncodes, this.ncount, this.ncode, this.transferable, this.pidx, 0, (_a = this.icodes) === null || _a === void 0 ? void 0 : _a.length, false);\n        const digers = nsigners.signers.map((nsigner) => new Diger({ code: this.dcode }, nsigner.verfer.qb64b).qb64);\n        return [verfers, digers];\n    }\n    async rotate(ncodes, transferable) {\n        this.ncodes = ncodes;\n        this.transferable = transferable;\n        const signers = this.creator.create(this.ncodes, this.ncount, this.ncode, this.transferable, this.pidx, 0, this.kidx + this.icodes.length, false);\n        const verfers = signers.signers.map((signer) => signer.verfer.qb64);\n        this.kidx = this.kidx + this.icodes.length;\n        const nsigners = this.creator.create(this.ncodes, this.ncount, this.ncode, this.transferable, this.pidx, 0, this.kidx + this.icodes.length, false);\n        const digers = nsigners.signers.map((nsigner) => new Diger({ code: this.dcode }, nsigner.verfer.qb64b).qb64);\n        return [verfers, digers];\n    }\n    async sign(ser, indexed = true, indices = undefined, ondices = undefined) {\n        const signers = this.creator.create(this.icodes, this.ncount, this.ncode, this.transferable, this.pidx, 0, this.kidx, false);\n        if (indexed) {\n            const sigers = [];\n            let i = 0;\n            for (const [j, signer] of signers.signers.entries()) {\n                if (indices != undefined) {\n                    i = indices[j];\n                    if (typeof i != 'number' || i < 0) {\n                        throw new Error(`Invalid signing index = ${i}, not whole number.`);\n                    }\n                }\n                else {\n                    i = j;\n                }\n                let o = 0;\n                if (ondices != undefined) {\n                    o = ondices[j];\n                    if ((o == undefined ||\n                        (typeof o == 'number' &&\n                            typeof o != 'number' &&\n                            o >= 0))) {\n                        throw new Error(`Invalid ondex = ${o}, not whole number.`);\n                    }\n                }\n                else {\n                    o = i;\n                }\n                sigers.push(signer.sign(ser, i, o == undefined ? true : false, o));\n            }\n            return sigers.map((siger) => siger.qb64);\n        }\n        else {\n            const cigars = [];\n            for (const [, signer] of signers.signers.entries()) {\n                cigars.push(signer.sign(ser));\n            }\n            return cigars.map((cigar) => cigar.qb64);\n        }\n    }\n}\nexport class RandyIdentifierManager {\n    constructor(salter, code = MtrDex.Ed25519_Seed, count = 1, icodes = undefined, transferable = false, ncode = MtrDex.Ed25519_Seed, ncount = 1, ncodes, dcode = MtrDex.Blake3_256, prxs = undefined, nxts = undefined) {\n        this.algo = Algos.randy;\n        this.salter = salter;\n        this.icodes =\n            icodes == undefined ? new Array(count).fill(code) : icodes;\n        this.ncodes =\n            ncodes == undefined\n                ? new Array(ncount).fill(ncode)\n                : ncodes;\n        this.code = code;\n        this.ncode = ncode;\n        this.count = count;\n        this.ncount = ncount;\n        const signer = this.salter.signer(code, transferable);\n        this.aeid = signer.verfer.qb64;\n        this.encrypter = new Encrypter({}, b(this.aeid));\n        this.decrypter = new Decrypter({}, signer.qb64b);\n        this.nxts = nxts !== null && nxts !== void 0 ? nxts : [];\n        this.prxs = prxs !== null && prxs !== void 0 ? prxs : [];\n        this.transferable = transferable;\n        this.icodes = icodes;\n        this.ncodes = ncodes;\n        this.dcode = dcode;\n        this.creator = new RandyCreator();\n        this.signers = this.prxs.map((prx) => this.decrypter.decrypt(new Cipher({ qb64: prx }).qb64b, undefined, this.transferable));\n    }\n    params() {\n        return {\n            nxts: this.nxts,\n            prxs: this.prxs,\n            transferable: this.transferable,\n        };\n    }\n    async incept(transferable) {\n        this.transferable = transferable;\n        const signers = this.creator.create(this.icodes, this.count, this.code, this.transferable);\n        this.prxs = signers.signers.map((signer) => this.encrypter.encrypt(undefined, signer).qb64);\n        const verfers = signers.signers.map((signer) => signer.verfer.qb64);\n        const nsigners = this.creator.create(this.ncodes, this.ncount, this.ncode, this.transferable);\n        this.nxts = nsigners.signers.map((signer) => this.encrypter.encrypt(undefined, signer).qb64);\n        const digers = nsigners.signers.map((nsigner) => new Diger({ code: this.dcode }, nsigner.verfer.qb64b).qb64);\n        return [verfers, digers];\n    }\n    async rotate(ncodes, transferable) {\n        this.ncodes = ncodes;\n        this.transferable = transferable;\n        this.prxs = this.nxts;\n        const signers = this.nxts.map((nxt) => this.decrypter.decrypt(undefined, new Cipher({ qb64: nxt }), this.transferable));\n        const verfers = signers.map((signer) => signer.verfer.qb64);\n        const nsigners = this.creator.create(this.ncodes, this.ncount, this.ncode, this.transferable);\n        this.nxts = nsigners.signers.map((signer) => this.encrypter.encrypt(undefined, signer).qb64);\n        const digers = nsigners.signers.map((nsigner) => new Diger({ code: this.dcode }, nsigner.verfer.qb64b).qb64);\n        return [verfers, digers];\n    }\n    async sign(ser, indexed = true, indices = undefined, ondices = undefined) {\n        const signers = this.prxs.map((prx) => this.decrypter.decrypt(new Cipher({ qb64: prx }).qb64b, undefined, this.transferable));\n        if (indexed) {\n            const sigers = [];\n            let i = 0;\n            for (const [j, signer] of signers.entries()) {\n                if (indices != undefined) {\n                    i = indices[j];\n                    if (typeof i != 'number' || i < 0) {\n                        throw new Error(`Invalid signing index = ${i}, not whole number.`);\n                    }\n                }\n                else {\n                    i = j;\n                }\n                let o = 0;\n                if (ondices != undefined) {\n                    o = ondices[j];\n                    if ((o == undefined ||\n                        (typeof o == 'number' &&\n                            typeof o != 'number' &&\n                            o >= 0))) {\n                        throw new Error(`Invalid ondex = ${o}, not whole number.`);\n                    }\n                }\n                else {\n                    o = i;\n                }\n                sigers.push(signer.sign(ser, i, o == undefined ? true : false, o));\n            }\n            return sigers.map((siger) => siger.qb64);\n        }\n        else {\n            const cigars = [];\n            for (const [, signer] of signers.entries()) {\n                cigars.push(signer.sign(ser));\n            }\n            return cigars.map((cigar) => cigar.qb64);\n        }\n    }\n}\nexport class GroupIdentifierManager {\n    constructor(manager, mhab, states = undefined, rstates = undefined, keys = [], ndigs = []) {\n        var _a, _b;\n        this.gkeys = [];\n        this.gdigs = [];\n        this.algo = Algos.group;\n        this.manager = manager;\n        if (states != undefined) {\n            keys = states.map((state) => state['k'][0]);\n        }\n        if (rstates != undefined) {\n            ndigs = rstates.map((state) => state['n'][0]);\n        }\n        this.gkeys = (_a = states === null || states === void 0 ? void 0 : states.map((state) => state['k'][0])) !== null && _a !== void 0 ? _a : keys;\n        this.gdigs = (_b = rstates === null || rstates === void 0 ? void 0 : rstates.map((state) => state['n'][0])) !== null && _b !== void 0 ? _b : ndigs;\n        this.mhab = mhab;\n        this.signers = [];\n    }\n    async incept() {\n        return [this.gkeys, this.gdigs];\n    }\n    /**\n     * Performs a multisig rotation\n     * @param _ncodes\n     * @param _transferable\n     * @param states\n     * @param rstates key state records for the prior establishment event indicating next key digests.\n     *                You should pass in the current key\n     */\n    async rotate(_ncodes, _transferable, states, rstates) {\n        this.gkeys = states.map((state) => state['k'][0]);\n        this.gdigs = rstates.map((state) => state['n'][0]);\n        return [this.gkeys, this.gdigs];\n    }\n    async sign(ser, indexed = true) {\n        if (!this.mhab.state) {\n            throw new Error(`No state in mhab`);\n        }\n        const key = this.mhab['state']['k'][0];\n        const ndig = this.mhab['state']['n'][0];\n        const csi = this.gkeys.indexOf(key); // csi = current signing index (from current rotation event)\n        const pni = this.gdigs.indexOf(ndig); // pni = prior next index (from last establishment event)\n        const mkeeper = this.manager.get(this.mhab);\n        return await mkeeper.sign(ser, indexed, [csi], [pni]);\n    }\n    params() {\n        return {\n            mhab: this.mhab,\n            keys: this.gkeys,\n            ndigs: this.gdigs,\n        };\n    }\n}\n","/**\n * Contacts\n */\nexport class Contacts {\n    /**\n     * Contacts\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List contacts\n     * @async\n     * @param {string} [group] Optional group name to filter contacts\n     * @param {string} [filterField] Optional field name to filter contacts\n     * @param {string} [filterValue] Optional field value to filter contacts\n     * @returns {Promise<any>} A promise to the list of contacts\n     */\n    async list(group, filterField, filterValue) {\n        const params = new URLSearchParams();\n        if (group !== undefined) {\n            params.append('group', group);\n        }\n        if (filterField !== undefined && filterValue !== undefined) {\n            params.append('filter_field', filterField);\n            params.append('filter_value', filterValue);\n        }\n        const path = `/contacts` + '?' + params.toString();\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Get a contact\n     * @async\n     * @param {string} pre Prefix of the contact\n     * @returns {Promise<any>} A promise to the contact\n     */\n    async get(pre) {\n        const path = `/contacts/` + pre;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Add a contact\n     * @async\n     * @param pre Prefix of the contact\n     * @param info Information about the contact\n     * @returns A promise to the result of the addition\n     */\n    async add(pre, info) {\n        const path = `/contacts/` + pre;\n        const method = 'POST';\n        const res = await this.client.fetch(path, method, info);\n        return await res.json();\n    }\n    /**\n     * Delete a contact\n     * @async\n     * @param {string} pre Prefix of the contact\n     * @returns {Promise<void>}\n     */\n    async delete(pre) {\n        const path = `/contacts/` + pre;\n        const method = 'DELETE';\n        await this.client.fetch(path, method, undefined);\n    }\n    /**\n     * Update a contact\n     * @async\n     * @param {string} pre Prefix of the contact\n     * @param {any} info Updated information about the contact\n     * @returns {Promise<any>} A promise to the result of the update\n     */\n    async update(pre, info) {\n        const path = `/contacts/` + pre;\n        const method = 'PUT';\n        const res = await this.client.fetch(path, method, info);\n        return await res.json();\n    }\n}\n/**\n * Challenges\n */\nexport class Challenges {\n    /**\n     * Challenges\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Generate a random challenge word list based on BIP39\n     * @async\n     * @param {number} strength Integer representing the strength of the challenge. Typically 128 or 256\n     * @returns {Promise<any>} A promise to the list of random words\n     */\n    async generate(strength = 128) {\n        const path = `/challenges?strength=${strength.toString()}`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Respond to a challenge by signing a message with the list of words\n     * @async\n     * @param name Name or alias of the identifier\n     * @param recipient Prefix of the recipient of the response\n     * @param words List of words to embed in the signed response\n     * @returns A promise to the result of the response\n     */\n    async respond(name, recipient, words) {\n        const hab = await this.client.identifiers().get(name);\n        const exchanges = this.client.exchanges();\n        const resp = await exchanges.send(name, 'challenge', hab, '/challenge/response', { words: words }, {}, recipient);\n        return resp;\n    }\n    /**\n     * Ask Agent to verify a given sender signed the provided words\n     * @param source Prefix of the identifier that was challenged\n     * @param words List of challenge words to check for\n     * @returns A promise to the long running operation\n     */\n    async verify(source, words) {\n        const path = `/challenges_verify/${source}`;\n        const method = 'POST';\n        const data = {\n            words: words,\n        };\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Mark challenge response as signed and accepted\n     * @param source Prefix of the identifier that was challenged\n     * @param said qb64 AID of exn message representing the signed response\n     * @returns {Promise<Response>} A promise to the result\n     */\n    async responded(source, said) {\n        const path = `/challenges_verify/${source}`;\n        const method = 'PUT';\n        const data = {\n            said: said,\n        };\n        const res = await this.client.fetch(path, method, data);\n        return res;\n    }\n}\n","import libsodium from 'libsodium-wrappers-sumo';\nimport { Salter } from \"../core/salter.js\";\nimport { Matter, MtrDex } from \"../core/matter.js\";\nexport function randomPasscode() {\n    const raw = libsodium.randombytes_buf(16);\n    const salter = new Salter({ raw: raw });\n    // https://github.com/WebOfTrust/signify-ts/issues/242\n    return salter.qb64.substring(2, 23);\n}\nexport function randomNonce() {\n    const seed = libsodium.randombytes_buf(libsodium.crypto_sign_SEEDBYTES);\n    const seedqb64 = new Matter({ raw: seed, code: MtrDex.Ed25519_Seed });\n    return seedqb64.qb64;\n}\nexport class Oobis {\n    /**\n     * Oobis\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Get the OOBI(s) for a managed indentifier for a given role\n     * @param {string} name Name or alias of the identifier\n     * @param {string} role Authorized role\n     * @returns {Promise<any>} A promise to the OOBI(s)\n     */\n    async get(name, role = 'agent') {\n        const path = `/identifiers/${name}/oobis?role=${role}`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Resolve an OOBI\n     * @async\n     * @param {string} oobi The OOBI to be resolver\n     * @param {string} [alias] Optional name or alias to link the OOBI resolution to a contact\n     * @returns {Promise<any>} A promise to the long-running operation\n     */\n    async resolve(oobi, alias) {\n        const path = `/oobis`;\n        const data = {\n            url: oobi,\n        };\n        if (alias !== undefined) {\n            data.oobialias = alias;\n        }\n        const method = 'POST';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n}\n/**\n * Operations\n * @remarks\n * Operations represent the status and result of long running tasks performed by KERIA agent\n */\nexport class Operations {\n    /**\n     * Operations\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Get operation status\n     * @async\n     * @param {string} name Name of the operation\n     * @returns {Promise<Operation>} A promise to the status of the operation\n     */\n    async get(name) {\n        const path = `/operations/${name}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * List operations\n     * @async\n     * @param {string} type Select operations by type\n     * @returns {Promise<Operation[]>} A list of operations\n     */\n    async list(type) {\n        const params = new URLSearchParams();\n        if (type !== undefined) {\n            params.append('type', type);\n        }\n        const path = `/operations?${params.toString()}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Delete operation\n     * @async\n     * @param {string} name Name of the operation\n     */\n    async delete(name) {\n        const path = `/operations/${name}`;\n        const data = null;\n        const method = 'DELETE';\n        await this.client.fetch(path, method, data);\n    }\n    /**\n     * Poll for operation to become completed.\n     */\n    async wait(op, options = {}) {\n        var _a, _b, _c, _d, _e, _f;\n        const minSleep = (_a = options.minSleep) !== null && _a !== void 0 ? _a : 10;\n        const maxSleep = (_b = options.maxSleep) !== null && _b !== void 0 ? _b : 10000;\n        const increaseFactor = (_c = options.increaseFactor) !== null && _c !== void 0 ? _c : 50;\n        if (((_e = (_d = op.metadata) === null || _d === void 0 ? void 0 : _d.depends) === null || _e === void 0 ? void 0 : _e.done) === false) {\n            await this.wait(op.metadata.depends, options);\n        }\n        if (op.done === true) {\n            return op;\n        }\n        let retries = 0;\n        while (true) {\n            op = await this.get(op.name);\n            const delay = Math.max(minSleep, Math.min(maxSleep, 2 ** retries * increaseFactor));\n            retries++;\n            if (op.done === true) {\n                return op;\n            }\n            await new Promise((resolve) => setTimeout(resolve, delay));\n            (_f = options.signal) === null || _f === void 0 ? void 0 : _f.throwIfAborted();\n        }\n    }\n}\n/**\n * KeyEvents\n */\nexport class KeyEvents {\n    /**\n     * KeyEvents\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Retrieve key events for an identifier\n     * @async\n     * @param {string} pre Identifier prefix\n     * @returns {Promise<any>} A promise to the key events\n     */\n    async get(pre) {\n        const path = `/events?pre=${pre}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n}\n/**\n * KeyStates\n */\nexport class KeyStates {\n    /**\n     * KeyStates\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Retriene the key state for an identifier\n     * @async\n     * @param {string} pre Identifier prefix\n     * @returns {Promise<any>} A promise to the key states\n     */\n    async get(pre) {\n        const path = `/states?pre=${pre}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Retrieve the key state for a list of identifiers\n     * @async\n     * @param {Array<string>} pres List of identifier prefixes\n     * @returns {Promise<any>} A promise to the key states\n     */\n    async list(pres) {\n        const path = `/states?${pres.map((pre) => `pre=${pre}`).join('&')}`;\n        const data = null;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Query the key state of an identifier for a given sequence number or anchor\n     * @async\n     * @param {string} pre Identifier prefix\n     * @param {number} [sn] Optional sequence number\n     * @param {any} [anchor] Optional anchor\n     * @returns {Promise<any>} A promise to the long-running operation\n     */\n    async query(pre, sn, anchor) {\n        const path = `/queries`;\n        const data = {\n            pre: pre,\n        };\n        if (sn !== undefined) {\n            data.sn = sn;\n        }\n        if (anchor !== undefined) {\n            data.anchor = anchor;\n        }\n        const method = 'POST';\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n}\nexport class Config {\n    /**\n     * Config\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    async get() {\n        const path = `/config`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n}\n","import { randomNonce } from \"../app/coring.js\";\nimport { TraitDex } from \"../app/habery.js\";\nimport { Serials, Vrsn_1_0, Protocols, versify, Ilks, } from \"../core/core.js\";\nimport { ample } from \"./eventing.js\";\nimport { MtrDex } from \"./matter.js\";\nimport { Prefixer } from \"./prefixer.js\";\nimport { Serder } from \"./serder.js\";\nvar vdr;\n(function (vdr) {\n    function incept({ pre, toad, nonce = randomNonce(), baks = [], cnfg = [], version = Vrsn_1_0, kind = Serials.JSON, code = MtrDex.Blake3_256, }) {\n        const vs = versify(Protocols.KERI, version, kind, 0);\n        const isn = 0;\n        const ilk = Ilks.vcp;\n        if (cnfg.includes(TraitDex.NoBackers) && baks.length > 0) {\n            throw new Error(`${baks.length} backers specified for NB vcp, 0 allowed`);\n        }\n        if (new Set(baks).size < baks.length) {\n            throw new Error(`Invalid baks ${baks} has duplicates`);\n        }\n        let _toad;\n        if (toad === undefined) {\n            if (baks.length === 0) {\n                _toad = 0;\n            }\n            else {\n                _toad = ample(baks.length);\n            }\n        }\n        else {\n            _toad = +toad;\n        }\n        if (baks.length > 0) {\n            if (_toad < 1 || _toad > baks.length) {\n                throw new Error(`Invalid toad ${_toad} for baks in ${baks}`);\n            }\n        }\n        else {\n            if (_toad != 0) {\n                throw new Error(`Invalid toad ${_toad} for no baks`);\n            }\n        }\n        const sad = {\n            v: vs,\n            t: ilk,\n            d: '',\n            i: '',\n            ii: pre,\n            s: '' + isn,\n            c: cnfg,\n            bt: _toad.toString(16),\n            b: baks,\n            n: nonce,\n        };\n        const prefixer = new Prefixer({ code }, sad);\n        sad.i = prefixer.qb64;\n        sad.d = prefixer.qb64;\n        return new Serder(sad);\n    }\n    vdr.incept = incept;\n})(vdr || (vdr = {}));\nexport { vdr };\n","import { interact, messagize } from \"../core/eventing.js\";\nimport { vdr } from \"../core/vdring.js\";\nimport { b, d, Protocols, Ilks, Serials, versify, Vrsn_1_0, } from \"../core/core.js\";\nimport { Saider } from \"../core/saider.js\";\nimport { Serder } from \"../core/serder.js\";\nimport { Siger } from \"../core/siger.js\";\nimport { TraitDex } from \"./habery.js\";\nimport { serializeACDCAttachment, serializeIssExnAttachment, } from \"../core/utils.js\";\n/** Types of credentials */\nexport class CredentialTypes {\n}\nCredentialTypes.issued = 'issued';\nCredentialTypes.received = 'received';\n/**\n * Credentials\n */\nexport class Credentials {\n    /**\n     * Credentials\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List credentials\n     * @async\n     * @param {CredentialFilter} [kargs] Optional parameters to filter the credentials\n     * @returns {Promise<CredentialResult[]>} A promise to the list of credentials\n     */\n    async list(kargs = {}) {\n        const path = `/credentials/query`;\n        const filtr = kargs.filter === undefined ? {} : kargs.filter;\n        const sort = kargs.sort === undefined ? [] : kargs.sort;\n        const limit = kargs.limit === undefined ? 25 : kargs.limit;\n        const skip = kargs.skip === undefined ? 0 : kargs.skip;\n        const data = {\n            filter: filtr,\n            sort: sort,\n            skip: skip,\n            limit: limit,\n        };\n        const method = 'POST';\n        const res = await this.client.fetch(path, method, data, undefined);\n        return await res.json();\n    }\n    async get(said, includeCESR = false) {\n        const path = `/credentials/${said}`;\n        const method = 'GET';\n        const headers = includeCESR\n            ? new Headers({ Accept: 'application/json+cesr' })\n            : new Headers({ Accept: 'application/json' });\n        const res = await this.client.fetch(path, method, null, headers);\n        return includeCESR ? await res.text() : await res.json();\n    }\n    /**\n     * Delete a credential from the DB\n     * @async\n     * @param {string} said - SAID of the credential\n     * @returns {Promise<void>}\n     */\n    async delete(said) {\n        const path = `/credentials/${said}`;\n        const method = 'DELETE';\n        await this.client.fetch(path, method, undefined);\n    }\n    /**\n     * Get the state of a credential\n     * @async\n     * @param {string} ri - management registry identifier\n     * @param {string} said - SAID of the credential\n     * @returns {Promise<CredentialState>} A promise to the credential registry state\n     */\n    async state(ri, said) {\n        const path = `/registries/${ri}/${said}`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return res.json();\n    }\n    /**\n     * Creates a credential in the specified registry to be GRANTed with IPEX to the intended recipient\n     */\n    async issue(name, args) {\n        var _a, _b;\n        const hab = await this.client.identifiers().get(name);\n        const estOnly = hab.state.c !== undefined && hab.state.c.includes('EO');\n        if (estOnly) {\n            // TODO implement rotation event\n            throw new Error('Establishment only not implemented');\n        }\n        if (!this.client.manager) {\n            throw new Error('No manager on client');\n        }\n        const keeper = this.client.manager.get(hab);\n        const [, subject] = Saider.saidify(Object.assign(Object.assign({ d: '' }, args.a), { dt: (_a = args.a.dt) !== null && _a !== void 0 ? _a : new Date().toISOString().replace('Z', '000+00:00') }));\n        const [, acdc] = Saider.saidify({\n            v: versify(Protocols.ACDC, undefined, Serials.JSON, 0),\n            d: '',\n            u: args.u,\n            i: (_b = args.i) !== null && _b !== void 0 ? _b : hab.prefix,\n            ri: args.ri,\n            s: args.s,\n            a: subject,\n            e: args.e,\n            r: args.r,\n        });\n        const [, iss] = Saider.saidify({\n            v: versify(Protocols.KERI, undefined, Serials.JSON, 0),\n            t: Ilks.iss,\n            d: '',\n            i: acdc.d,\n            s: '0',\n            ri: args.ri,\n            dt: subject.dt,\n        });\n        const sn = parseInt(hab.state.s, 16);\n        const anc = interact({\n            pre: hab.prefix,\n            sn: sn + 1,\n            data: [\n                {\n                    i: iss.i,\n                    s: iss.s,\n                    d: iss.d,\n                },\n            ],\n            dig: hab.state.d,\n            version: undefined,\n            kind: undefined,\n        });\n        const sigs = await keeper.sign(b(anc.raw));\n        const path = `/identifiers/${hab.name}/credentials`;\n        const method = 'POST';\n        const body = {\n            acdc: acdc,\n            iss: iss,\n            ixn: anc.sad,\n            sigs,\n            [keeper.algo]: keeper.params(),\n        };\n        const res = await this.client.fetch(path, method, body);\n        const op = await res.json();\n        return {\n            acdc: new Serder(acdc),\n            iss: new Serder(iss),\n            anc,\n            op,\n        };\n    }\n    /**\n     * Revoke credential\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @param {string} said SAID of the credential\n     * @param {string} datetime date time of revocation\n     * @returns {Promise<RevokeCredentialResult>} A promise to the long-running operation\n     */\n    async revoke(name, said, datetime) {\n        const hab = await this.client.identifiers().get(name);\n        const pre = hab.prefix;\n        const vs = versify(Protocols.KERI, undefined, Serials.JSON, 0);\n        const dt = datetime !== null && datetime !== void 0 ? datetime : new Date().toISOString().replace('Z', '000+00:00');\n        const cred = await this.get(said);\n        let registryId;\n        if ('ri' in cred.sad && cred.sad.ri !== undefined) {\n            registryId = cred.sad.ri;\n        }\n        else if ('rd' in cred.sad && cred.sad.rd !== undefined) {\n            registryId = cred.sad.rd;\n        }\n        else {\n            throw new Error('Neither ri nor rd property found in credential');\n        }\n        // Create rev\n        const _rev = {\n            v: vs,\n            t: Ilks.rev,\n            d: '',\n            i: said,\n            s: '1',\n            ri: registryId,\n            p: cred.status.d,\n            dt: dt,\n        };\n        const [, rev] = Saider.saidify(_rev);\n        // create ixn\n        let ixn = {};\n        let sigs = [];\n        const state = hab.state;\n        if (state.c !== undefined && state.c.includes('EO')) {\n            var estOnly = true;\n        }\n        else {\n            var estOnly = false;\n        }\n        const sn = parseInt(state.s, 16);\n        const dig = state.d;\n        const data = [\n            {\n                i: rev.i,\n                s: rev.s,\n                d: rev.d,\n            },\n        ];\n        const keeper = this.client.manager.get(hab);\n        if (estOnly) {\n            // TODO implement rotation event\n            throw new Error('Establishment only not implemented');\n        }\n        else {\n            const serder = interact({\n                pre: pre,\n                sn: sn + 1,\n                data: data,\n                dig: dig,\n                version: undefined,\n                kind: undefined,\n            });\n            sigs = await keeper.sign(b(serder.raw));\n            ixn = serder.sad;\n        }\n        const body = {\n            rev: rev,\n            ixn: ixn,\n            sigs: sigs,\n            [keeper.algo]: keeper.params(),\n        };\n        const path = `/identifiers/${name}/credentials/${said}`;\n        const method = 'DELETE';\n        const res = await this.client.fetch(path, method, body);\n        const op = await res.json();\n        return {\n            rev: new Serder(rev),\n            anc: new Serder(ixn),\n            op,\n        };\n    }\n}\nexport class RegistryResult {\n    constructor(regser, serder, sigs, promise) {\n        this._regser = regser;\n        this._serder = serder;\n        this._sigs = sigs;\n        this.promise = promise;\n    }\n    get regser() {\n        return this._regser;\n    }\n    get serder() {\n        return this._serder;\n    }\n    get sigs() {\n        return this._sigs;\n    }\n    async op() {\n        const res = await this.promise;\n        return await res.json();\n    }\n}\n/**\n * Registries\n */\nexport class Registries {\n    /**\n     * Registries\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List registries\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @returns {Promise<Registry[]>} A promise to the list of registries\n     */\n    async list(name) {\n        const path = `/identifiers/${name}/registries`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Create a registry\n     * @async\n     * @param {CreateRegistryArgs}\n     * @returns {Promise<[any, Serder, any[], object]> } A promise to the long-running operation\n     */\n    async create({ name, registryName, noBackers = true, toad = 0, baks = [], nonce, }) {\n        const hab = await this.client.identifiers().get(name);\n        const pre = hab.prefix;\n        const cnfg = [];\n        if (noBackers) {\n            cnfg.push(TraitDex.NoBackers);\n        }\n        const state = hab.state;\n        const estOnly = state.c !== undefined && state.c.includes('EO');\n        if (estOnly) {\n            cnfg.push(TraitDex.EstOnly);\n        }\n        const regser = vdr.incept({ pre, baks, toad, nonce, cnfg });\n        if (estOnly) {\n            throw new Error('establishment only not implemented');\n        }\n        else {\n            const state = hab.state;\n            const sn = parseInt(state.s, 16);\n            const dig = state.d;\n            const data = [\n                {\n                    i: regser.pre,\n                    s: '0',\n                    d: regser.pre,\n                },\n            ];\n            const serder = interact({\n                pre: pre,\n                sn: sn + 1,\n                data: data,\n                dig: dig,\n                version: Vrsn_1_0,\n                kind: Serials.JSON,\n            });\n            const keeper = this.client.manager.get(hab);\n            const sigs = await keeper.sign(b(serder.raw));\n            const res = this.createFromEvents(hab, name, registryName, regser.sad, serder.sad, sigs);\n            return new RegistryResult(regser, serder, sigs, res);\n        }\n    }\n    createFromEvents(hab, name, registryName, vcp, ixn, sigs) {\n        const path = `/identifiers/${name}/registries`;\n        const method = 'POST';\n        const data = {\n            name: registryName,\n            vcp: vcp,\n            ixn: ixn,\n            sigs: sigs,\n        };\n        const keeper = this.client.manager.get(hab);\n        data[keeper.algo] = keeper.params();\n        return this.client.fetch(path, method, data);\n    }\n    /**\n     * Rename a registry\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @param {string} registryName Current registry name\n     * @param {string} newName New registry name\n     * @returns {Promise<Registry>} A promise to the registry record\n     */\n    async rename(name, registryName, newName) {\n        const path = `/identifiers/${name}/registries/${registryName}`;\n        const method = 'PUT';\n        const data = {\n            name: newName,\n        };\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n}\n/**\n * Schemas\n */\nexport class Schemas {\n    /**\n     * Schemas\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Get a schema\n     * @async\n     * @param {string} said SAID of the schema\n     * @returns {Promise<Schema>} A promise to the schema\n     */\n    async get(said) {\n        const path = `/schema/${said}`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * List schemas\n     * @async\n     * @returns {Promise<Schema[]>} A promise to the list of schemas\n     */\n    async list() {\n        const path = `/schema`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n}\n/**\n * Ipex\n */\nexport class Ipex {\n    /**\n     * Schemas\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Create an IPEX apply EXN message\n     */\n    async apply(args) {\n        var _a, _b;\n        const hab = await this.client.identifiers().get(args.senderName);\n        const data = {\n            m: (_a = args.message) !== null && _a !== void 0 ? _a : '',\n            s: args.schemaSaid,\n            a: (_b = args.attributes) !== null && _b !== void 0 ? _b : {},\n        };\n        return this.client\n            .exchanges()\n            .createExchangeMessage(hab, '/ipex/apply', data, {}, args.recipient, args.datetime, undefined);\n    }\n    async submitApply(name, exn, sigs) {\n        const body = {\n            exn: exn.sad,\n            sigs,\n        };\n        const response = await this.client.fetch(`/identifiers/${name}/ipex/apply`, 'POST', body);\n        return response.json();\n    }\n    /**\n     * Create an IPEX offer EXN message\n     */\n    async offer(args) {\n        var _a;\n        const hab = await this.client.identifiers().get(args.senderName);\n        const data = {\n            m: (_a = args.message) !== null && _a !== void 0 ? _a : '',\n        };\n        return this.client\n            .exchanges()\n            .createExchangeMessage(hab, '/ipex/offer', data, { acdc: [args.acdc, undefined] }, args.recipient, args.datetime, args.applySaid);\n    }\n    async submitOffer(name, exn, sigs, atc) {\n        const body = {\n            exn: exn.sad,\n            sigs,\n            atc,\n        };\n        const response = await this.client.fetch(`/identifiers/${name}/ipex/offer`, 'POST', body);\n        return response.json();\n    }\n    /**\n     * Create an IPEX agree EXN message\n     */\n    async agree(args) {\n        var _a;\n        const hab = await this.client.identifiers().get(args.senderName);\n        const data = {\n            m: (_a = args.message) !== null && _a !== void 0 ? _a : '',\n        };\n        return this.client\n            .exchanges()\n            .createExchangeMessage(hab, '/ipex/agree', data, {}, args.recipient, args.datetime, args.offerSaid);\n    }\n    async submitAgree(name, exn, sigs) {\n        const body = {\n            exn: exn.sad,\n            sigs,\n        };\n        const response = await this.client.fetch(`/identifiers/${name}/ipex/agree`, 'POST', body);\n        return response.json();\n    }\n    /**\n     * Create an IPEX grant EXN message\n     */\n    async grant(args) {\n        var _a;\n        const hab = await this.client.identifiers().get(args.senderName);\n        const data = {\n            m: (_a = args.message) !== null && _a !== void 0 ? _a : '',\n        };\n        let atc = args.ancAttachment;\n        if (atc === undefined) {\n            const keeper = this.client.manager.get(hab);\n            const sigs = await keeper.sign(b(args.anc.raw));\n            const sigers = sigs.map((sig) => new Siger({ qb64: sig }));\n            const ims = d(messagize(args.anc, sigers));\n            atc = ims.substring(args.anc.size);\n        }\n        const acdcAtc = args.acdcAttachment === undefined\n            ? d(serializeACDCAttachment(args.iss))\n            : args.acdcAttachment;\n        const issAtc = args.issAttachment === undefined\n            ? d(serializeIssExnAttachment(args.anc))\n            : args.issAttachment;\n        const embeds = {\n            acdc: [args.acdc, acdcAtc],\n            iss: [args.iss, issAtc],\n            anc: [args.anc, atc],\n        };\n        return this.client\n            .exchanges()\n            .createExchangeMessage(hab, '/ipex/grant', data, embeds, args.recipient, args.datetime, args.agreeSaid);\n    }\n    async submitGrant(name, exn, sigs, atc) {\n        const body = {\n            exn: exn.sad,\n            sigs: sigs,\n            atc: atc,\n        };\n        const response = await this.client.fetch(`/identifiers/${name}/ipex/grant`, 'POST', body);\n        return response.json();\n    }\n    /**\n     * Create an IPEX admit EXN message\n     */\n    async admit(args) {\n        const hab = await this.client.identifiers().get(args.senderName);\n        const data = {\n            m: args.message,\n        };\n        return this.client\n            .exchanges()\n            .createExchangeMessage(hab, '/ipex/admit', data, {}, args.recipient, args.datetime, args.grantSaid);\n    }\n    async submitAdmit(name, exn, sigs, atc) {\n        const body = {\n            exn: exn.sad,\n            sigs: sigs,\n            atc: atc,\n        };\n        const response = await this.client.fetch(`/identifiers/${name}/ipex/admit`, 'POST', body);\n        return response.json();\n    }\n}\n","import { EventResult } from \"./aiding.js\";\nexport class Delegations {\n    /**\n     * Delegations\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Approve the delegation via interaction event\n     * @async\n     * @param {string} name Name or alias of the identifier\n     * @param {any} [data] The anchoring interaction event\n     * @returns {Promise<EventResult>} A promise to the delegated approval result\n     */\n    async approve(name, data) {\n        const { serder, sigs, jsondata } = await this.client\n            .identifiers()\n            .createInteract(name, data);\n        const res = await this.client.fetch('/identifiers/' + name + '/delegation', 'POST', jsondata);\n        return new EventResult(serder, sigs, res);\n    }\n}\n","/**\n * Escrows\n */\nexport class Escrows {\n    /**\n     * Escrows\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List replay messages\n     * @async\n     * @param {string} [route] Optional route in the replay message\n     * @returns {Promise<any>} A promise to the list of replay messages\n     */\n    async listReply(route) {\n        const params = new URLSearchParams();\n        if (route !== undefined) {\n            params.append('route', route);\n        }\n        const path = `/escrows/rpy` + '?' + params.toString();\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n}\n","import { BexDex, Matter, MtrDex } from \"./matter.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\nimport { decodeBase64Url, encodeBase64Url } from \"./base64.js\";\nimport { concat } from \"./core.js\";\nconst B64REX = '^[A-Za-z0-9\\\\-_]*$';\nexport const Reb64 = new RegExp(B64REX);\n/*\n\n    Bexter is subclass of Matter, cryptographic material, for variable length\n    strings that only contain Base64 URL safe characters, i.e. Base64 text (bext).\n    When created using the 'bext' paramaeter, the encoded matter in qb64 format\n    in the text domain is more compact than would be the case if the string were\n    passed in as raw bytes. The text is used as is to form the value part of the\n    qb64 version not including the leader.\n\n    Due to ambiguity that arises from pre-padding bext whose length is a multiple of\n    three with one or more 'A' chars. Any bext that starts with an 'A' and whose length\n    is either a multiple of 3 or 4 may not round trip. Bext with a leading 'A'\n    whose length is a multiple of four may have the leading 'A' stripped when\n    round tripping.\n\n        Bexter(bext='ABBB').bext == 'BBB'\n        Bexter(bext='BBB').bext == 'BBB'\n        Bexter(bext='ABBB').qb64 == '4AABABBB' == Bexter(bext='BBB').qb64\n\n    To avoid this problem, only use for applications of base 64 strings that\n    never start with 'A'\n\n    Examples: base64 text strings:\n\n    bext = \"\"\n    qb64 = '4AAA'\n\n    bext = \"-\"\n    qb64 = '6AABAAA-'\n\n    bext = \"-A\"\n    qb64 = '5AABAA-A'\n\n    bext = \"-A-\"\n    qb64 = '4AABA-A-'\n\n    bext = \"-A-B\"\n    qb64 = '4AAB-A-B'\n\n\n    Example uses:\n        CESR encoded paths for nested SADs and SAIDs\n        CESR encoded fractionally weighted threshold expressions\n\n\n    Attributes:\n\n    Inherited Properties:  (See Matter)\n        .pad  is int number of pad chars given raw\n\n        .code is  str derivation code to indicate cypher suite\n        .raw is bytes crypto material only without code\n        .index is int count of attached crypto material by context (receipts)\n        .qb64 is str in Base64 fully qualified with derivation code + crypto mat\n        .qb64b is bytes in Base64 fully qualified with derivation code + crypto mat\n        .qb2  is bytes in binary with derivation code + crypto material\n        .transferable is Boolean, True when transferable derivation code False otherwise\n\n    Properties:\n        .text is the Base64 text value, .qb64 with text code and leader removed.\n\n    Hidden:\n        ._pad is method to compute  .pad property\n        ._code is str value for .code property\n        ._raw is bytes value for .raw property\n        ._index is int value for .index property\n        ._infil is method to compute fully qualified Base64 from .raw and .code\n        ._exfil is method to extract .code and .raw from fully qualified Base64\n\n    Methods:\n\n\n\n\n */\nexport class Bexter extends Matter {\n    constructor({ raw, code = MtrDex.StrB64_L0, qb64b, qb64, qb2 }, bext) {\n        if (raw === undefined &&\n            qb64b === undefined &&\n            qb64 === undefined &&\n            qb2 === undefined) {\n            if (bext === undefined)\n                throw new EmptyMaterialError('Missing bext string.');\n            const match = Reb64.exec(bext);\n            if (!match)\n                throw new Error('Invalid Base64.');\n            raw = Bexter._rawify(bext);\n        }\n        super({ raw, code, qb64b, qb64, qb2 });\n        if (!BexDex.has(this.code))\n            throw new Error(`Invalid code = ${this.code} for Bexter.`);\n    }\n    static _rawify(bext) {\n        const ts = bext.length % 4; // bext size mod 4\n        const ws = (4 - ts) % 4; // pre conv wad size in chars\n        const ls = (3 - ts) % 3; // post conv lead size in bytes\n        const wad = new Array(ws);\n        wad.fill('A');\n        const base = wad.join('') + bext; // pre pad with wad of zeros in Base64 == 'A'\n        const raw = decodeBase64Url(base); // [ls:]  // convert and remove leader\n        return Uint8Array.from(raw).subarray(ls); // raw binary equivalent of text\n    }\n    get bext() {\n        const sizage = Matter.Sizes.get(this.code);\n        const wad = Uint8Array.from(new Array(sizage === null || sizage === void 0 ? void 0 : sizage.ls).fill(0));\n        const bext = encodeBase64Url(concat(wad, this.raw));\n        let ws = 0;\n        if ((sizage === null || sizage === void 0 ? void 0 : sizage.ls) === 0 && bext !== undefined) {\n            if (bext[0] === 'A') {\n                ws = 1;\n            }\n        }\n        else {\n            ws = ((sizage === null || sizage === void 0 ? void 0 : sizage.ls) + 1) % 4;\n        }\n        return bext.substring(ws);\n    }\n}\n","import { Bexter, Reb64 } from \"./bexter.js\";\nimport { MtrDex } from \"./matter.js\";\nimport { EmptyMaterialError } from \"./kering.js\";\n/*\n    Pather is a subclass of Bexter that provides SAD Path language specific functionality\n    for variable length strings that only contain Base64 URL safe characters.  Pather allows\n    the specification of SAD Paths as a list of field components which will be converted to the\n    Base64 URL safe character representation.\n\n    Additionally, Pather provides .rawify for extracting and serializing the content targeted by\n    .path for a SAD, represented as an instance of Serder.  Pather enforces Base64 URL character\n    safety by leveraging the fact that SADs must have static field ordering.  Any field label can\n    be replaced by its field ordinal to allow for path specification and traversal for any field\n    labels that contain non-Base64 URL safe characters.\n\n\n    Examples: strings:\n        path = []\n        text = \"-\"\n        qb64 = '6AABAAA-'\n\n        path = [\"A\"]\n        text = \"-A\"\n        qb64 = '5AABAA-A'\n\n        path = [\"A\", \"B\"]\n        text = \"-A-B\"\n        qb64 = '4AAB-A-B'\n\n        path = [\"A\", 1, \"B\", 3]\n        text = \"-A-1-B-3\"\n        qb64 = '4AAC-A-1-B-3'\n\n */\nexport class Pather extends Bexter {\n    constructor({ raw, code = MtrDex.StrB64_L0, qb64b, qb64, qb2 }, bext, path) {\n        if (raw === undefined &&\n            bext === undefined &&\n            qb64b === undefined &&\n            qb64 === undefined &&\n            qb2 === undefined) {\n            if (path === undefined)\n                throw new EmptyMaterialError('Missing bext string.');\n            bext = Pather._bextify(path);\n        }\n        super({ raw, code, qb64b, qb64, qb2 }, bext);\n    }\n    // TODO: implement SAD access methods like resolve, root, strip, startswith and tail\n    get path() {\n        if (!this.bext.startsWith('-')) {\n            throw new Error('invalid SAD ptr');\n        }\n        let path = this.bext;\n        while (path.charAt(0) === '-') {\n            path = path.substring(1);\n        }\n        const apath = path.split('-');\n        if (apath[0] !== '') {\n            return apath;\n        }\n        else {\n            return [];\n        }\n    }\n    static _bextify(path) {\n        const vath = [];\n        for (const p of path) {\n            let sp = '';\n            if (typeof p === 'number') {\n                sp = p.toString();\n            }\n            else {\n                sp = p;\n            }\n            const match = Reb64.exec(sp);\n            if (!match) {\n                throw new Error(`\"Non Base64 path component = ${p}.`);\n            }\n            vath.push(sp);\n        }\n        return '-' + vath.join('-');\n    }\n}\n","import { b, d, Protocols, Ilks, Serials, versify } from \"../core/core.js\";\nimport { Serder } from \"../core/serder.js\";\nimport { nowUTC } from \"../core/utils.js\";\nimport { Pather } from \"../core/pather.js\";\nimport { Counter, CtrDex } from \"../core/counter.js\";\nimport { Saider } from \"../core/saider.js\";\n/**\n * Exchanges\n */\nexport class Exchanges {\n    /**\n     * Exchanges\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Create exn message\n     * @async\n     * @returns {Promise<any>} A promise to the list of replay messages\n     * @param sender\n     * @param route\n     * @param payload\n     * @param embeds\n     * @param recipient\n     * @param datetime\n     * @param dig\n     */\n    async createExchangeMessage(sender, route, payload, embeds, recipient, datetime, dig) {\n        const keeper = this.client.manager.get(sender);\n        const [exn, end] = exchange(route, payload, sender['prefix'], recipient, datetime, dig, undefined, embeds);\n        const sigs = await keeper.sign(b(exn.raw));\n        return [exn, sigs, d(end)];\n    }\n    /**\n     * Send exn messages to list of recipients\n     */\n    async send(name, topic, sender, route, payload, embeds, recipient) {\n        if (typeof recipient !== 'string') {\n            throw new Error('Recipient must be a string.');\n        }\n        const [exn, sigs, atc] = await this.createExchangeMessage(sender, route, payload, embeds, recipient);\n        return await this.sendFromEvents(name, topic, exn, sigs, atc);\n    }\n    /**\n     * Send exn messaget to list of recipients\n     * @async\n     * @returns {Promise<any>} A promise to the list of replay messages\n     * @param name\n     * @param topic\n     * @param exn\n     * @param sigs\n     * @param atc\n     * @param recipients\n     */\n    async sendFromEvents(name, topic, exn, sigs, atc) {\n        const path = `/identifiers/${name}/exchanges`;\n        const method = 'POST';\n        const res = await this.client.fetch(path, method, {\n            tpc: topic,\n            exn: exn.sad,\n            sigs: sigs,\n            atc: atc,\n        });\n        return await res.json();\n    }\n    /**\n     * Get exn message by said\n     * @async\n     * @returns A promise to the exn message\n     * @param said The said of the exn message\n     */\n    async get(said) {\n        const path = `/exchanges/${said}`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n}\nexport function exchange(route, payload, sender, recipient, date, dig, modifiers, embeds) {\n    const vs = versify(Protocols.KERI, undefined, Serials.JSON, 0);\n    const ilk = Ilks.exn;\n    const dt = date !== undefined\n        ? date\n        : nowUTC().toISOString().replace('Z', '000+00:00');\n    const p = dig !== undefined ? dig : '';\n    const q = modifiers !== undefined ? modifiers : {};\n    const ems = embeds != undefined ? embeds : {};\n    let e = {};\n    let end = '';\n    Object.entries(ems).forEach(([key, value]) => {\n        const serder = value[0];\n        const atc = value[1];\n        e[key] = serder.sad;\n        if (atc == undefined) {\n            return;\n        }\n        let pathed = '';\n        const pather = new Pather({}, undefined, ['e', key]);\n        pathed += pather.qb64;\n        pathed += atc;\n        const counter = new Counter({\n            code: CtrDex.PathedMaterialQuadlets,\n            count: Math.floor(pathed.length / 4),\n        });\n        end += counter.qb64;\n        end += pathed;\n    });\n    if (Object.keys(e).length > 0) {\n        e['d'] = '';\n        [, e] = Saider.saidify(e);\n    }\n    const attrs = {};\n    attrs['i'] = recipient;\n    const a = Object.assign(Object.assign({}, attrs), payload);\n    const _sad = {\n        v: vs,\n        t: ilk,\n        d: '',\n        i: sender,\n        rp: recipient,\n        p: p,\n        dt: dt,\n        r: route,\n        q: q,\n        a: a,\n        e: e,\n    };\n    const [, sad] = Saider.saidify(_sad);\n    const exn = new Serder(sad);\n    return [exn, b(end)];\n}\n","/**\n * Groups\n */\nexport class Groups {\n    /**\n     * Groups\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * Get group request messages\n     * @async\n     * @param {string} [said] SAID of exn message to load\n     * @returns {Promise<any>} A promise to the list of replay messages\n     */\n    async getRequest(said) {\n        const path = `/multisig/request/` + said;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null);\n        return await res.json();\n    }\n    /**\n     * Send multisig exn request  messages to other group members\n     * @async\n     * @param {string} [name] human readable name of group AID\n     * @param {Dict<any>} [exn] exn message to send to other members\n     * @param {string[]} [sigs] signature of the participant over the exn\n     * @param {string} [atc] additional attachments from embedded events in exn\n     * @returns {Promise<any>} A promise to the list of replay messages\n     */\n    async sendRequest(name, exn, sigs, atc) {\n        const path = `/identifiers/${name}/multisig/request`;\n        const method = 'POST';\n        const data = {\n            exn: exn,\n            sigs: sigs,\n            atc: atc,\n        };\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n    /**\n     * Join multisig group using rotation event.\n     * This can be used by participants being asked to contribute keys to a rotation event to join an existing group.\n     */\n    async join(name, rot, sigs, gid, smids, rmids) {\n        const path = `/identifiers/${name}/multisig/join`;\n        const method = 'POST';\n        const data = {\n            tpc: 'multisig',\n            rot: rot.sad,\n            sigs: sigs,\n            gid: gid,\n            smids: smids,\n            rmids: rmids,\n        };\n        const res = await this.client.fetch(path, method, data);\n        return await res.json();\n    }\n}\n","import { parseRangeHeaders } from \"../core/httping.js\";\n/**\n * Notifications\n */\nexport class Notifications {\n    /**\n     * Notifications\n     * @param {SignifyClient} client\n     */\n    constructor(client) {\n        this.client = client;\n    }\n    /**\n     * List notifications\n     * @async\n     * @param {number} [start=0] Start index of list of notifications, defaults to 0\n     * @param {number} [end=24] End index of list of notifications, defaults to 24\n     * @returns {Promise<any>} A promise to the list of notifications\n     */\n    async list(start = 0, end = 24) {\n        const extraHeaders = new Headers();\n        extraHeaders.append('Range', `notes=${start}-${end}`);\n        const path = `/notifications`;\n        const method = 'GET';\n        const res = await this.client.fetch(path, method, null, extraHeaders);\n        const cr = res.headers.get('content-range');\n        const range = parseRangeHeaders(cr, 'notes');\n        const notes = await res.json();\n        return {\n            start: range.start,\n            end: range.end,\n            total: range.total,\n            notes: notes,\n        };\n    }\n    /**\n     * Mark a notification as read\n     * @async\n     * @param {string} said SAID of the notification\n     * @returns {Promise<string>} A promise to the result of the marking\n     */\n    async mark(said) {\n        const path = `/notifications/` + said;\n        const method = 'PUT';\n        const res = await this.client.fetch(path, method, null);\n        return await res.text();\n    }\n    /**\n     * Delete a notification\n     * @async\n     * @param {string} said SAID of the notification\n     * @returns {Promise<void>}\n     */\n    async delete(said) {\n        const path = `/notifications/` + said;\n        const method = 'DELETE';\n        await this.client.fetch(path, method, undefined);\n    }\n}\n","import { Authenticater } from \"../core/authing.js\";\nimport { HEADER_SIG_TIME } from \"../core/httping.js\";\nimport { IdentifierManagerFactory } from \"../core/keeping.js\";\nimport { Tier } from \"../core/salter.js\";\nimport { Identifier } from \"./aiding.js\";\nimport { Contacts, Challenges } from \"./contacting.js\";\nimport { Agent, Controller } from \"./controller.js\";\nimport { Oobis, Operations, KeyEvents, KeyStates, Config } from \"./coring.js\";\nimport { Credentials, Ipex, Registries, Schemas } from \"./credentialing.js\";\nimport { Delegations } from \"./delegating.js\";\nimport { Escrows } from \"./escrowing.js\";\nimport { Exchanges } from \"./exchanging.js\";\nimport { Groups } from \"./grouping.js\";\nimport { Notifications } from \"./notifying.js\";\nconst DEFAULT_BOOT_URL = 'http://localhost:3903';\nclass State {\n    constructor() {\n        this.agent = null;\n        this.controller = null;\n        this.pidx = 0;\n        this.ridx = 0;\n    }\n}\n/**\n * An in-memory key manager that can connect to a KERIA Agent and use it to\n * receive messages and act as a proxy for multi-signature operations and delegation operations.\n */\nexport class SignifyClient {\n    /**\n     * SignifyClient constructor\n     * @param {string} url KERIA admin interface URL\n     * @param {string} bran Base64 21 char string that is used as base material for seed of the client AID\n     * @param {Tier} tier Security tier for generating keys of the client AID (high | mewdium | low)\n     * @param {string} bootUrl KERIA boot interface URL\n     * @param {ExternalModule[]} externalModules list of external modules to load\n     */\n    constructor(url, bran, tier = Tier.low, bootUrl = DEFAULT_BOOT_URL, externalModules = []) {\n        this._identifiers = new Identifier(this);\n        this._operations = new Operations(this);\n        this._keyEvents = new KeyEvents(this);\n        this._keyStates = new KeyStates(this);\n        this._oobis = new Oobis(this);\n        this._config = new Config(this);\n        this._delegations = new Delegations(this);\n        this._exchanges = new Exchanges(this);\n        this._groups = new Groups(this);\n        this._escrows = new Escrows(this);\n        this._credentials = new Credentials(this);\n        this._registries = new Registries(this);\n        this._ipex = new Ipex(this);\n        this._notifications = new Notifications(this);\n        this._contacts = new Contacts(this);\n        this._challenges = new Challenges(this);\n        this._schemas = new Schemas(this);\n        this.url = url;\n        if (bran.length < 21) {\n            throw Error('bran must be 21 characters');\n        }\n        this.bran = bran;\n        this.pidx = 0;\n        this.controller = new Controller(bran, tier);\n        this.authn = null;\n        this.agent = null;\n        this.manager = null;\n        this.tier = tier;\n        this.bootUrl = bootUrl;\n        this.exteralModules = externalModules;\n    }\n    get data() {\n        return [this.url, this.bran, this.pidx, this.authn];\n    }\n    /**\n     * Boot a KERIA agent\n     * @async\n     * @returns {Promise<Response>} A promise to the result of the boot\n     */\n    async boot() {\n        var _a, _b, _c, _d;\n        const [evt, sign] = (_b = (_a = this.controller) === null || _a === void 0 ? void 0 : _a.event) !== null && _b !== void 0 ? _b : [];\n        const data = {\n            icp: evt.sad,\n            sig: sign.qb64,\n            stem: (_c = this.controller) === null || _c === void 0 ? void 0 : _c.stem,\n            pidx: 1,\n            tier: (_d = this.controller) === null || _d === void 0 ? void 0 : _d.tier,\n        };\n        return await fetch(this.bootUrl + '/boot', {\n            method: 'POST',\n            body: JSON.stringify(data),\n            headers: {\n                'Content-Type': 'application/json',\n            },\n        });\n    }\n    /**\n     * Get state of the agent and the client\n     * @async\n     * @returns {Promise<Response>} A promise to the state\n     */\n    async state() {\n        var _a, _b, _c, _d, _e;\n        const caid = (_a = this.controller) === null || _a === void 0 ? void 0 : _a.pre;\n        const res = await fetch(this.url + `/agent/${caid}`);\n        if (res.status == 404) {\n            throw new Error(`agent does not exist for controller ${caid}`);\n        }\n        const data = await res.json();\n        const state = new State();\n        state.agent = (_b = data.agent) !== null && _b !== void 0 ? _b : {};\n        state.controller = (_c = data.controller) !== null && _c !== void 0 ? _c : {};\n        state.ridx = (_d = data.ridx) !== null && _d !== void 0 ? _d : 0;\n        state.pidx = (_e = data.pidx) !== null && _e !== void 0 ? _e : 0;\n        return state;\n    }\n    /**  Connect to a KERIA agent\n     * @async\n     */\n    async connect() {\n        const state = await this.state();\n        this.pidx = state.pidx;\n        //Create controller representing the local client AID\n        this.controller = new Controller(this.bran, this.tier, 0, state.controller);\n        this.controller.ridx = state.ridx !== undefined ? state.ridx : 0;\n        // Create agent representing the AID of KERIA cloud agent\n        this.agent = new Agent(state.agent);\n        if (this.agent.anchor != this.controller.pre) {\n            throw Error('commitment to controller AID missing in agent inception event');\n        }\n        if (this.controller.serder.sad.s == 0) {\n            await this.approveDelegation();\n        }\n        this.manager = new IdentifierManagerFactory(this.controller.salter, this.exteralModules);\n        this.authn = new Authenticater(this.controller.signer, this.agent.verfer);\n    }\n    /**\n     * Fetch a resource from the KERIA agent\n     * @async\n     * @param {string} path Path to the resource\n     * @param {string} method HTTP method\n     * @param {any} data Data to be sent in the body of the resource\n     * @param {Headers} [extraHeaders] Optional extra headers to be sent with the request\n     * @returns {Promise<Response>} A promise to the result of the fetch\n     */\n    async fetch(path, method, data, extraHeaders) {\n        var _a;\n        const headers = new Headers();\n        let signed_headers = new Headers();\n        const final_headers = new Headers();\n        headers.set('Signify-Resource', this.controller.pre);\n        headers.set(HEADER_SIG_TIME, new Date().toISOString().replace('Z', '000+00:00'));\n        headers.set('Content-Type', 'application/json');\n        const _body = method == 'GET' ? null : JSON.stringify(data);\n        if (this.authn) {\n            signed_headers = this.authn.sign(headers, method, path.split('?')[0]);\n        }\n        else {\n            throw new Error('client need to call connect first');\n        }\n        signed_headers.forEach((value, key) => {\n            final_headers.set(key, value);\n        });\n        if (extraHeaders !== undefined) {\n            extraHeaders.forEach((value, key) => {\n                final_headers.append(key, value);\n            });\n        }\n        const res = await fetch(this.url + path, {\n            method: method,\n            body: _body,\n            headers: final_headers,\n        });\n        if (!res.ok) {\n            const error = await res.text();\n            const message = `HTTP ${method} ${path} - ${res.status} ${res.statusText} - ${error}`;\n            throw new Error(message);\n        }\n        const isSameAgent = ((_a = this.agent) === null || _a === void 0 ? void 0 : _a.pre) === res.headers.get('signify-resource');\n        if (!isSameAgent) {\n            throw new Error('message from a different remote agent');\n        }\n        const verification = this.authn.verify(res.headers, method, path.split('?')[0]);\n        if (verification) {\n            return res;\n        }\n        else {\n            throw new Error('response verification failed');\n        }\n    }\n    /**\n     * Create a Signed Request to fetch a resource from an external URL with headers signed by an AID\n     * @async\n     * @param {string} aidName Name or alias of the AID to be used for signing\n     * @param {string} url URL of the requested resource\n     * @param {RequestInit} req Request options should include:\n     *     - method: HTTP method\n     *     - data Data to be sent in the body of the resource.\n     *              If the data is a CESR JSON string then you should also set contentType to 'application/json+cesr'\n     *              If the data is a FormData object then you should not set the contentType and the browser will set it to 'multipart/form-data'\n     *              If the data is an object then you should use JSON.stringify to convert it to a string and set the contentType to 'application/json'\n     *     - contentType Content type of the request.\n     * @returns {Promise<Request>} A promise to the created Request\n     */\n    async createSignedRequest(aidName, url, req) {\n        var _a;\n        const hab = await this.identifiers().get(aidName);\n        const keeper = this.manager.get(hab);\n        const authenticator = new Authenticater(keeper.signers[0], keeper.signers[0].verfer);\n        const headers = new Headers(req.headers);\n        headers.set('Signify-Resource', hab['prefix']);\n        headers.set(HEADER_SIG_TIME, new Date().toISOString().replace('Z', '000+00:00'));\n        const signed_headers = authenticator.sign(new Headers(headers), (_a = req.method) !== null && _a !== void 0 ? _a : 'GET', new URL(url).pathname);\n        req.headers = signed_headers;\n        return new Request(url, req);\n    }\n    /**\n     * Approve the delegation of the client AID to the KERIA agent\n     * @async\n     * @returns {Promise<Response>} A promise to the result of the approval\n     */\n    async approveDelegation() {\n        const sigs = this.controller.approveDelegation(this.agent);\n        const data = {\n            ixn: this.controller.serder.sad,\n            sigs: sigs,\n        };\n        return await fetch(this.url + '/agent/' + this.controller.pre + '?type=ixn', {\n            method: 'PUT',\n            body: JSON.stringify(data),\n            headers: {\n                'Content-Type': 'application/json',\n            },\n        });\n    }\n    /**\n     * Save old client passcode in KERIA agent\n     * @async\n     * @param {string} passcode Passcode to be saved\n     * @returns {Promise<Response>} A promise to the result of the save\n     */\n    async saveOldPasscode(passcode) {\n        var _a;\n        const caid = (_a = this.controller) === null || _a === void 0 ? void 0 : _a.pre;\n        const body = { salt: passcode };\n        return await fetch(this.url + '/salt/' + caid, {\n            method: 'PUT',\n            body: JSON.stringify(body),\n            headers: {\n                'Content-Type': 'application/json',\n            },\n        });\n    }\n    /**\n     * Delete a saved passcode from KERIA agent\n     * @async\n     * @returns {Promise<Response>} A promise to the result of the deletion\n     */\n    async deletePasscode() {\n        var _a;\n        const caid = (_a = this.controller) === null || _a === void 0 ? void 0 : _a.pre;\n        return await fetch(this.url + '/salt/' + caid, {\n            method: 'DELETE',\n            headers: {\n                'Content-Type': 'application/json',\n            },\n        });\n    }\n    /**\n     * Rotate the client AID\n     * @async\n     * @param {string} nbran Base64 21 char string that is used as base material for the new seed\n     * @param {Array<string>} aids List of managed AIDs to be rotated\n     * @returns {Promise<Response>} A promise to the result of the rotation\n     */\n    async rotate(nbran, aids) {\n        const data = this.controller.rotate(nbran, aids);\n        return await fetch(this.url + '/agent/' + this.controller.pre, {\n            method: 'PUT',\n            body: JSON.stringify(data),\n            headers: {\n                'Content-Type': 'application/json',\n            },\n        });\n    }\n    /**\n     * Get identifiers resource\n     * @returns {Identifier}\n     */\n    identifiers() {\n        return this._identifiers;\n    }\n    /**\n     * Get OOBIs resource\n     * @returns {Oobis}\n     */\n    oobis() {\n        return this._oobis;\n    }\n    /**\n     * Get operations resource\n     * @returns {Operations}\n     */\n    operations() {\n        return this._operations;\n    }\n    /**\n     * Get keyEvents resource\n     * @returns {KeyEvents}\n     */\n    keyEvents() {\n        return this._keyEvents;\n    }\n    /**\n     * Get keyStates resource\n     * @returns {KeyStates}\n     */\n    keyStates() {\n        return this._keyStates;\n    }\n    /**\n     * Get credentials resource\n     * @returns {Credentials}\n     */\n    credentials() {\n        return this._credentials;\n    }\n    /**\n     * Get IPEX resource\n     * @returns {Ipex}\n     */\n    ipex() {\n        return this._ipex;\n    }\n    /**\n     * Get registries resource\n     * @returns {Registries}\n     */\n    registries() {\n        return this._registries;\n    }\n    /**\n     * Get schemas resource\n     * @returns {Schemas}\n     */\n    schemas() {\n        return this._schemas;\n    }\n    /**\n     * Get challenges resource\n     * @returns {Challenges}\n     */\n    challenges() {\n        return this._challenges;\n    }\n    /**\n     * Get contacts resource\n     * @returns {Contacts}\n     */\n    contacts() {\n        return this._contacts;\n    }\n    /**\n     * Get notifications resource\n     * @returns {Notifications}\n     */\n    notifications() {\n        return this._notifications;\n    }\n    /**\n     * Get escrows resource\n     * @returns {Escrows}\n     */\n    escrows() {\n        return this._escrows;\n    }\n    /**\n     * Get groups resource\n     * @returns {Groups}\n     */\n    groups() {\n        return this._groups;\n    }\n    /**\n     * Get exchange resource\n     * @returns {Exchanges}\n     */\n    exchanges() {\n        return this._exchanges;\n    }\n    /**\n     * Get delegations resource\n     * @returns {Delegations}\n     */\n    delegations() {\n        return this._delegations;\n    }\n    /**\n     * Get agent config resource\n     * @returns {Config}\n     */\n    config() {\n        return this._config;\n    }\n}\n","export * from \"./ready.js\";\nexport * from \"./keri/app/habery.js\";\nexport * from \"./keri/app/controller.js\";\nexport * from \"./keri/app/aiding.js\";\nexport * from \"./keri/app/clienting.js\";\nexport * from \"./keri/app/contacting.js\";\nexport * from \"./keri/app/coring.js\";\nexport * from \"./keri/app/credentialing.js\";\nexport * from \"./keri/app/escrowing.js\";\nexport * from \"./keri/app/exchanging.js\";\nexport * from \"./keri/app/grouping.js\";\nexport * from \"./keri/app/notifying.js\";\nexport * from \"./keri/core/authing.js\";\nexport * from \"./keri/core/cigar.js\";\nexport * from \"./keri/core/cipher.js\";\nexport * from \"./keri/core/core.js\";\nexport * from \"./keri/core/counter.js\";\nexport * from \"./keri/core/decrypter.js\";\nexport * from \"./keri/core/diger.js\";\nexport * from \"./keri/core/encrypter.js\";\nexport * from \"./keri/core/eventing.js\";\nexport * from \"./keri/core/httping.js\";\nexport * from \"./keri/core/indexer.js\";\nexport * from \"./keri/core/keeping.js\";\nexport * from \"./keri/core/kering.js\";\nexport * from \"./keri/core/manager.js\";\nexport * from \"./keri/core/matter.js\";\nexport * from \"./keri/core/number.js\";\nexport * from \"./keri/core/prefixer.js\";\nexport * from \"./keri/core/saider.js\";\nexport * from \"./keri/core/salter.js\";\nexport * from \"./keri/core/seqner.js\";\nexport * from \"./keri/core/serder.js\";\nexport * from \"./keri/core/siger.js\";\nexport * from \"./keri/core/signer.js\";\nexport * from \"./keri/core/tholder.js\";\nexport * from \"./keri/core/utils.js\";\nexport * from \"./keri/core/verfer.js\";\nexport * from \"./keri/core/keyState.js\";\nexport * from \"./keri/end/ending.js\";\n","import * as exp from \"./exports.js\";\nexport * from \"./exports.js\";\nexport default exp;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106],"mappings":";;;;;;;AACA,MAAa,QAAQ,YAAY;AAC7B,OAAM,QAAQ;;;;;ACFlB,IAAa,qBAAb,MAAgC;CAC5B,YAAY,KAAK;AACb,OAAK,OAAO,IAAI,MAAM,IAAI;;CAE9B,IAAI,MAAM;AACN,SAAO,KAAK;;;;;;;;;ACFpB,IAAW;CACV,SAAU,WAAS;AAChB,WAAQ,UAAU;GACnB,YAAY,UAAU,EAAE,EAAE;;;;AAI7B,IAAW;CACV,SAAU,aAAW;AAClB,aAAU,UAAU;AACpB,aAAU,UAAU;GACrB,cAAc,YAAY,EAAE,EAAE;;;;AAIjC,IAAa,UAAb,MAAqB;CACjB,YAAY,QAAQ,GAAG,QAAQ,GAAG;AAC9B,OAAK,QAAQ;AACb,OAAK,QAAQ;;;;;;AAMrB,MAAa,WAAW,IAAI,SAAS;;;;AAIrC,MAAa,OAAO;CAChB,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACR;;;;AAID,MAAa,YAAY;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;;;;AAID,MAAa,YAAY;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;;;;AAID,MAAa,YAAY;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;;;;AAID,MAAa,YAAY;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;;;;AAID,MAAa,YAAY;CAAC;CAAK;CAAK;CAAK;CAAK;CAAK;CAAI;;;;AAIvD,MAAa,YAAY;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;;;;AAID,MAAa,YAAY;CAAC;CAAK;CAAK;CAAK;CAAM;CAAK;CAAI;;;;AAIxD,MAAa,cAAc;;;;AAI3B,MAAa,eAAe,KAAK;AACjC,MAAa,aAAa;;;;AAQ1B,MAAa,QAAQ;;;;;;;;AAQrB,SAAgB,UAAU,eAAe;CACrC,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,MAAM,UAAU;CAIhB,MAAM,QAFK,IAAI,OAAO,MAAM,CAEX,KAAK,cAAc;AACpC,KAAI,OAAO;AACP,GAAC,OAAO,QAAQ,OAAO,QAAQ,OAAO,MAAM,QAAQ;GAChD,MAAM;GACN,CAAC,MAAM;GACP,CAAC,MAAM;GACP,MAAM;GACN,MAAM;GACT;AACD,MAAI,CAAC,OAAO,OAAO,QAAQ,CAAC,SAAS,KAAK,CACtC,OAAM,IAAI,MAAM,gCAAgC,OAAO;AAE3D,MAAI,CAAC,OAAO,OAAO,UAAU,CAAC,SAAS,MAAM,CACzC,OAAM,IAAI,MAAM,gCAAgC,OAAO;AAG3D,SAAO,QADI;AAGX,UAAQ,UADG;AAEX,SAAO;GAAC;GAAO;GAAM;GAAS;GAAK;;AAEvC,OAAM,IAAI,MAAM,4BAA4B,gBAAgB;;;;;;;;;;;;AAYhE,SAAgB,QAAQ,QAAQ,UAAU,MAAM,SAAS,OAAO,QAAQ,MAAM,OAAO,GAAG;AACpF,WAAU,WAAW,SAAY,WAAW;AAM5C,QAAO,GAAG,QALI,QAAQ,MAAM,SAAS,GAAG,GAC1B,QAAQ,MAAM,SAAS,GAAG,GAIN,OAFlB,KAAK,SAAS,GAAG,CAAC,SAAS,GAAG,IAAI;;;;;AAOtD,MAAa,cAAc,IAAI,IAAI;CAC/B,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,GAAG,IAAI;CACR,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACT,CAAC,IAAI,IAAI;CACZ,CAAC;;;;AAIF,MAAa,cAAc,IAAI,IAAI,MAAM,KAAK,cAAc,UAAU,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC,CAAC;;;;;;AAM5F,SAAgB,SAAS,GAAG,IAAI,GAAG;CAC/B,IAAI,MAAM;AACV,QAAO,KAAK,GAAG;AACX,QAAM,YAAY,IAAI,IAAI,GAAG,GAAG;AAChC,MAAI,KAAK,MAAM,IAAI,GAAG;AACtB,MAAI,KAAK,EACL;;CAGR,MAAM,IAAI,IAAI,IAAI;AAClB,MAAK,IAAIA,MAAI,GAAGA,MAAI,GAAG,MACnB,OAAM,MAAM;AAEhB,QAAO;;;;;;;AAOX,SAAgB,UAAU,GAAG,IAAI,GAAG;AAEhC,QAAO,EADG,SAAS,GAAG,EAAE,CACb;;;;;;AAMf,SAAgB,SAAS,GAAG;AACxB,KAAI,EAAE,UAAU,EACZ,OAAM,IAAI,MAAM,sCAAsC;CAE1D,IAAI,IAAI;AAER,CADY,EAAE,MAAM,GAAG,CAAC,SAAS,CAC7B,SAAS,GAAG,MAAM;AAClB,OAAK,YAAY,IAAI,EAAE,IAAK,IAAI;GAClC;AACF,QAAO;;AAGX,MAAM,UAAU,IAAI,aAAa;AACjC,MAAM,UAAU,IAAI,aAAa;;;;;;AAMjC,SAAgB,EAAE,GAAG;AACjB,QAAO,QAAQ,OAAO,EAAE;;;;;;AAM5B,SAAgB,EAAE,GAAG;AACjB,QAAO,QAAQ,OAAO,EAAE;;;;;;;AAO5B,SAAgB,OAAO,KAAK,KAAK;CAC7B,MAAM,MAAM,IAAI,WAAW,IAAI,SAAS,IAAI,OAAO;AACnD,KAAI,IAAI,IAAI;AACZ,KAAI,IAAI,KAAK,IAAI,OAAO;AACxB,QAAO;;;;;;;;;;;;;;;AAeX,SAAgB,QAAQ,OAAO;CAC3B,IAAI,QAAQ;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC9B,SAAQ,QAAQ,MAAM,MAAM;AAEhC,QAAO;;;;;;AC9XX,SAAgB,gBAAgB,OAAO;AACnC,4CAAqB,MAAM,CACtB,QAAQ,OAAO,IAAI,CACnB,QAAQ,OAAO,IAAI,CACnB,QAAQ,MAAM,GAAG;;AAE1B,SAAgB,gBAAgB,OAAO;AACnC,KAAI,EAAE,OAAO,UAAU,UACnB,OAAM,IAAI,UAAU,4BAA4B;CAEpD,MAAM,IAAI,MAAM,SAAS;AAGzB,2CAFe,QAAQ,IAAI,OAAO,IAAI,IAAI,IAAI,IAAI,EAAE,EACxB,QAAQ,MAAM,IAAI,CAAC,QAAQ,MAAM,IAAI,CACjC;;;;;ACVpC,IAAa,QAAb,MAAmB;CACf,IAAI,MAAM;AAEN,SADU,IAAI,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAC/D,IAAI,KAAK;;;AAG1B,IAAa,cAAb,cAAiC,MAAM;CACnC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,eAAe;AACpB,OAAK,WAAW;AAChB,OAAK,SAAS;AACd,OAAK,UAAU;AACf,OAAK,aAAa;AAClB,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,mBAAmB;AACxB,OAAK,iBAAiB;AACtB,OAAK,qBAAqB;AAC1B,OAAK,mBAAmB;AACxB,OAAK,WAAW;AAChB,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,kBAAkB;AACvB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,eAAe;AACpB,OAAK,cAAc;AACnB,OAAK,qBAAqB;AAC1B,OAAK,eAAe;AACpB,OAAK,cAAc;AACnB,OAAK,gBAAgB;AACrB,OAAK,gBAAgB;AACrB,OAAK,gBAAgB;;;AAG7B,MAAa,SAAS,IAAI,aAAa;AACvC,IAAa,gBAAb,cAAmC,MAAM;CACrC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,WAAW;AAChB,OAAK,eAAe;AACpB,OAAK,SAAS;AACd,OAAK,eAAe;;;AAG5B,MAAa,cAAc,IAAI,eAAe;AAC9C,IAAa,YAAb,cAA+B,MAAM;CACjC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,aAAa;AAClB,OAAK,cAAc;AACnB,OAAK,cAAc;AACnB,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,aAAa;AAClB,OAAK,cAAc;AACnB,OAAK,WAAW;AAChB,OAAK,WAAW;;;AAGxB,MAAa,UAAU,IAAI,WAAW;AACtC,IAAa,WAAb,cAA8B,MAAM;CAChC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,MAAM;AACX,OAAK,OAAO;;;AAGpB,MAAa,SAAS,IAAI,UAAU;AACpC,IAAa,WAAb,cAA8B,MAAM;CAChC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,gBAAgB;AACrB,OAAK,gBAAgB;AACrB,OAAK,gBAAgB;;;AAG7B,MAAa,SAAS,IAAI,UAAU;AACpC,IAAM,uBAAN,cAAmC,MAAM;CACrC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,QAAQ;;;AAGrB,MAAa,cAAc,IAAI,sBAAsB;AACrD,IAAM,uBAAN,cAAmC,MAAM;CACrC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;;;AAGzB,MAAa,cAAc,IAAI,sBAAsB;AACrD,IAAa,SAAb,MAAoB;CAChB,YAAY,IAAI,IAAI,IAAI,IAAI;AACxB,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;;;AAGlB,IAAa,SAAb,MAAa,OAAO;CAChB,YAAY,EAAE,KAAK,OAAO,OAAO,UAAU,OAAO,MAAM,KAAK,QAAS;AAClE,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,OAAO,IAAI,WAAW,EAAE;EAC7B,IAAI,OAAO;AACX,MAAI,OAAO,QAAW;AAClB,OAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,8EAA8E;AAElG,OAAI,YAAY,IAAI,KAAK,GAAG,IAAI,YAAY,IAAI,KAAK,GAAG,EAAE;AACtD,QAAI,SAAS,QACT;SAAI,OAAO,EACP,OAAM,IAAI,MAAM,iCAAiC,OAAO;UAG5D,QAAO,IAAI;IAEf,MAAM,MAAM,IAAK,OAAO,KAAM;AAC9B,WAAO,KAAK,OAAO,OAAO,MAAM,EAAE;AAClC,QAAI,YAAY,IAAI,KAAK,GAAG,CACxB,KAAI,QAAQ,MAAM,IAAI,EAGlB,QAAO,GADG,OAAO,OAAO,YAAY,CAAC,MACvB,KAAK,UAAU,GAFlB,EAEwB;aAE9B,QAAQ,MAAM,IAAI,EAGvB,QAAO,GADG,OAAO,OAAO,YAAY,CAAC,MACvB,OAAO,UAAU,GAAG,EAAO,GAAG,KAAK;QAGjD,OAAM,IAAI,MAAM,iCAAiC,OAAO;aAIxD,QAAQ,MAAM,IAAI,EAGlB,QAAO,GADG,OAAO,OAAO,YAAY,CAAC,MACvB,KAAK,UAAU,GAFlB,EAEwB;QAGnC,OAAM,IAAI,MAAM,iCAAiC,OAAO;UAI/D;AAED,QADe,OAAO,MAAM,IAAI,KAAK,CAC1B,MAAM,GAEb,OAAM,IAAI,MAAM,kCAAkC,OAAO;AAE7D,WAAO,OAAO,SAAS,KAAK;;AAEhC,SAAM,IAAI,MAAM,GAAG,KAAK;AACxB,OAAI,IAAI,UAAU,KAEd,OAAM,IAAI,MAAM,kCAAkC,KAAK,YAAY,KAAK,OAAO,IAAI,OAAO,GAAG;AAEjG,QAAK,QAAQ;AACb,QAAK,QAAQ;AACb,QAAK,OAAO;aAEP,SAAS,OACd,MAAK,OAAO,KAAK;WAEZ,UAAU,QAAW;GAC1B,MAAMC,SAAO,EAAE,MAAM;AACrB,QAAK,OAAOA,OAAK;aAEZ,QAAQ,OACb,MAAK,QAAQ,IAAI;MAGjB,OAAM,IAAI,mBAAmB,qBAAqB;;CAG1D,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,MAAM;AACN,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK,QAAQ;;CAExB,IAAI,QAAQ;AACR,SAAO,EAAE,KAAK,KAAK;;CAEvB,IAAI,eAAe;AACf,SAAO,CAAC,YAAY,IAAI,KAAK,KAAK;;CAEtC,IAAI,YAAY;AACZ,SAAO,QAAQ,IAAI,KAAK,KAAK;;CAEjC,OAAO,SAAS,MAAM;EAClB,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK;EACnC,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,MAAI,OAAO,OAAO,GACd,OAAM,MAAM,2BAA2B,KAAK,GAAG;AAEnD,SAAO,KAAK,OAAQ,OAAO,KAAK,MAAM,IAAK,EAAE,GAAG,OAAO;;CAE3D,OAAO,UAAU,MAAM;AAEnB,SADe,KAAK,MAAM,IAAI,KAAK,CACrB;;CAElB,IAAI,OAAO;EACP,MAAM,SAAS,OAAO,MAAM,IAAI,KAAK,KAAK;AAC1C,SAAO,GAAG,KAAK,OAAO,SAAS,KAAK,MAAM,OAAO,GAAG;;CAExD,SAAS;EACL,MAAM,OAAO,KAAK;EAClB,MAAM,OAAO,KAAK;EAClB,MAAM,MAAM,KAAK;EACjB,MAAM,MAAM,IAAK,IAAI,SAAS,KAAM;EACpC,MAAM,SAAS,OAAO,MAAM,IAAI,KAAK;AACrC,MAAI,OAAO,OAAO,QAAW;GAEzB,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,OAAI,KAAK,EACL,OAAM,IAAI,MAAM,sEAAsE,KAAK;AAE/F,OAAI,OAAO,KAAK,OAAO,MAAM,OAAO,KAAK,EACrC,OAAM,IAAI,MAAM,gBAAgB,KAAK,YAAY,KAAK,GAAG;GAE7D,MAAM,OAAO,GAAG,OAAO,SAAS,MAAM,OAAO,GAAG;AAChD,OAAI,KAAK,SAAS,MAAM,KAAK,OAAO,GAChC,OAAM,IAAI,MAAM,gBAAgB,KAAK,8BAA8B,GAAG,GAAG;GAE7E,MAAM,QAAQ,IAAI,WAAW,OAAO,KAAK,IAAI,OAAO;AACpD,QAAK,IAAI,IAAI,GAAG,IAAI,OAAO,IAAI,IAC3B,OAAM,KAAK;AAEf,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;IACjC,MAAM,MAAM,IAAI;AAChB,UAAM,OAAO,IAAI;;AAErB,UAAO,OAAO,gBAAgB,MAAM;SAEnC;GACD,MAAM,OAAO;GACb,MAAM,KAAK,KAAK;AAChB,OAAI,KAAK,KAAK,KAAK,OAAO,GAEtB,OAAM,IAAI,MAAM,gBAAgB,KAAK,8BAA8B,GAAG,IAAI,IAAI,OAAO,GAAG;GAK5F,MAAM,QAAQ,IAAI,WAAW,KAAK,IAAI,OAAO;AAC7C,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACpB,OAAM,KAAK;AAEf,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;IACjC,MAAM,MAAM,IAAI;AAChB,UAAM,OAAO,IAAI;;AAErB,UAAO,OAAO,gBAAgB,MAAM,CAAC,MAAM,KAAK,EAAE;;;CAG1D,OAAO,MAAM;AACT,MAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,iBAAiB;EAErC,MAAM,QAAQ,KAAK;AACnB,MAAI,CAAC,MAAM,KAAK,OAAO,MAAM,MAAM,CAAC,CAAC,SAAS,MAAM,CAChD,OAAM,IAAI,MAAM,mBAAmB,QAAQ;EAE/C,MAAM,KAAK,OAAO,MAAM,IAAI,MAAM;AAClC,MAAI,KAAK,SAAS,GACd,OAAM,IAAI,MAAM,iBAAiB;EAErC,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;AAC9B,MAAI,CAAC,MAAM,KAAK,OAAO,MAAM,MAAM,CAAC,CAAC,SAAS,KAAK,CAC/C,OAAM,IAAI,MAAM,oBAAoB,OAAO;EAE/C,MAAM,SAAS,OAAO,MAAM,IAAI,KAAK;EACrC,MAAM,KAAK,OAAO,KAAK,OAAO;EAC9B,IAAI,OAAO;AACX,MAAI,OAAO,MAAM,GAEb,OAAM,IAAI,MAAM,wCAAwC;MAGxD,QAAO,OAAO;AAElB,MAAI,KAAK,SAAS,OAAO,GACrB,OAAM,IAAI,MAAM,QAAQ,OAAO,KAAK,KAAK,OAAO,cAAc;AAElE,SAAO,KAAK,MAAM,GAAG,OAAO,GAAG;EAC/B,MAAM,KAAK,KAAK;EAChB,MAAM,MAAM,KAAK,MAAM,IAAI,OAAO,KAAK;EACvC,IAAI;AACJ,MAAI,MAAM,GAAG;GACT,MAAM,OAAO,IAAI,MAAM,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,MAAM,GAAG;GACzD,MAAM,MAAM,WAAW,KAAK,gBAAgB,KAAK,CAAC;AAElD,OADW,QAAQ,IAAI,SAAS,GAAG,GAAG,CAAC,GAC7B,KAAK,MAAM,EAEjB,OAAM,IAAI,MAAM,4EAA4E;AAEhG,SAAM,IAAI,SAAS,GAAG;SAErB;GACD,MAAM,OAAO,KAAK,MAAM,GAAG;GAC3B,MAAM,MAAM,WAAW,KAAK,gBAAgB,KAAK,CAAC;GAClD,MAAM,KAAK,QAAQ,IAAI,SAAS,GAAG,OAAO,GAAG,CAAC;AAC9C,OAAI,MAAM,EACN,KAAI,MAAM,EACN,OAAM,IAAI,MAAM,qCAAqC;OAGrD,OAAM,IAAI,MAAM,qCAAqC;AAG7D,SAAM,IAAI,SAAS,OAAO,GAAG;;AAEjC,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,OAAO,WAAW,KAAK,IAAI;;CAEpC,QAAQ,KAAK;AACT,QAAM,IAAI,MAAM,0BAA0B,MAAM;;;AAGxD,OAAO,QAAQ,IAAI,IAAI,OAAO,QAAQ;CAClC,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CACzB,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,GAAG,IAAI,OAAO,GAAG,GAAG,KAAK,EAAE;CAC3B,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC1B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC7B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC9B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,KAAK,EAAE;CAChC,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;CAC/B,QAAQ,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC9B,QAAQ,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC9B,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACtC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACtC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACtC,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,MAAM,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACpC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACtC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACtC,QAAQ,IAAI,OAAO,GAAG,GAAG,QAAW,EAAE;CACzC,CAAC,CAAC;AACH,OAAO,QAAQ,IAAI,IAAI;CACnB,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACX,CAAC;;;;ACvcF,MAAM,eAAe,IAAI,IAAI;CACzB,OAAO;CACP,OAAO;CACP,OAAO;CACP,OAAO;CACV,CAAC;;;;;AAKF,IAAa,SAAb,cAA4B,OAAO;CAC/B,YAAY,EAAE,KAAK,MAAM,MAAM,OAAO,OAAO;AACzC,QAAM;GAAE;GAAK;GAAM;GAAM;GAAO;GAAK,CAAC;AACtC,MAAI,CAAC,aAAa,IAAI,KAAK,KAAK,CAC5B,OAAM,IAAI,MAAM,sBAAsB,KAAK,KAAK,gBAAgB;;CAGxE,OAAO,KAAK,KAAK;AACb,UAAQ,KAAK,MAAb;GACI,KAAK,OAAO;GACZ,KAAK,OAAO,SACR,QAAOC,QAAU,4BAA4B,KAAK,KAAK,KAAK,IAAI;GAEpE,KAAK,OAAO;GACZ,KAAK,OAAO,cAAc;IACtB,MAAM,UAAU,OAAO,QAAQ,WAAW,EAAE,IAAI,GAAG;AACnD,WAAO,KAAK,OAAO,KAAK,SAAS,KAAK,IAAI;;GAE9C,QACI,OAAM,IAAI,MAAM,sBAAsB,KAAK,KAAK,gBAAgB;;;;;;;AChChF,IAAa,QAAb,cAA2B,OAAO;CAC9B,YAAY,EAAE,KAAK,MAAM,MAAM,OAAO,OAAO,QAAQ;AACjD,QAAM;GAAE;GAAK;GAAM;GAAM;GAAO;GAAK,CAAC;AACtC,OAAK,UAAU;;CAEnB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,IAAI,OAAO,QAAQ;AACf,OAAK,UAAU;;;;;;ACPvB,IAAa,eAAb,MAA0B;CACtB,cAAc;AACV,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,YAAY;AACjB,OAAK,gBAAgB;AACrB,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,sBAAsB;AAC3B,OAAK,0BAA0B;AAC/B,OAAK,sBAAsB;AAC3B,OAAK,0BAA0B;AAC/B,OAAK,gBAAgB;AACrB,OAAK,oBAAoB;;;AAGjC,MAAa,SAAS,IAAI,cAAc;AACxC,IAAa,kBAAb,MAA6B;CACzB,cAAc;AACV,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,YAAY;AACjB,OAAK,gBAAgB;AACrB,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,sBAAsB;AAC3B,OAAK,0BAA0B;AAC/B,OAAK,sBAAsB;AAC3B,OAAK,0BAA0B;AAC/B,OAAK,gBAAgB;AACrB,OAAK,oBAAoB;;CAE7B,IAAI,MAAM;AAEN,SADU,IAAI,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAC/D,IAAI,KAAK;;;AAG1B,MAAa,YAAY,IAAI,iBAAiB;AAC9C,IAAa,yBAAb,MAAoC;CAChC,cAAc;AACV,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,sBAAsB;AAC3B,OAAK,gBAAgB;AACrB,OAAK,sBAAsB;AAC3B,OAAK,0BAA0B;AAC/B,OAAK,0BAA0B;AAC/B,OAAK,oBAAoB;;CAE7B,IAAI,MAAM;AAEN,SADU,IAAI,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAC/D,IAAI,KAAK;;;AAG1B,MAAa,eAAe,IAAI,wBAAwB;AACxD,IAAa,sBAAb,MAAiC;CAC7B,cAAc;AACV,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,YAAY;AACjB,OAAK,kBAAkB;AACvB,OAAK,sBAAsB;AAC3B,OAAK,gBAAgB;;CAEzB,IAAI,MAAM;AAEN,SADU,IAAI,IAAI,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAC/D,IAAI,KAAK;;;AAG1B,MAAa,eAAe,IAAI,qBAAqB;AACrD,IAAa,SAAb,MAAoB;CAChB,YAAY,IAAI,IAAI,IAAI,IAAI,IAAI;AAC5B,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAAK,KAAK;;;AAGlB,IAAa,UAAb,MAAa,QAAQ;CACjB,YAAY,EAAE,MAAM,QAAW,OAAO,OAAO,aAAa,QAAQ,GAAG,QAAQ,QAAW,QAAQ,QAAW,OAAO,QAAW,MAAM,UAAc;AAC7I,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,OAAK,OAAO,IAAI,WAAW,EAAE;AAC7B,MAAI,OAAO,QAAW;AAClB,OAAI,QAAQ,OACR,OAAM,IAAI,mBAAmB,8EAA8E;AAE/G,OAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,CACxB,OAAM,IAAI,MAAM,oBAAoB,KAAK,GAAG;GAEhD,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;GACtC,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO;GAClB,MAAM,KAAK,OAAO,KAAK,OAAO;GAC9B,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,OAAI,CAAC,OAAO,UAAU,MAAM,IAAI,QAAQ,KAAK,QAAQ,MAAM,KAAK,EAC5D,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;AAE/D,OAAI,SAAS,UACT,OAAO,MAAM,KACb,EAAE,SAAS,KAAK,SAAS,MAAM,KAAK,GACpC,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;AAE/D,OAAI,aAAa,IAAI,KAAK,IAAI,SAAS,OACnC,OAAM,IAAI,MAAM,kBAAkB,MAAM,YAAY,KAAK,GAAG;AAEhE,OAAI,aAAa,IAAI,KAAK,EACtB;QAAI,SAAS,OACT,SAAQ;aAGJ,SAAS,SAAS,MAAM,EACxB,OAAM,IAAI,MAAM,sBAAsB,MAAM,aAAa,MAAM,YAAY,KAAK,GAAG;;AAI/F,OAAI,MAAM,OACN,OAAM,IAAI,MAAM,8BAA8B;GAWlD,MAAM,UAAU,KAAK,OAAQ,KAAK,MAAM,IAAK,EAAE;AAC/C,SAAM,IAAI,MAAM,GAAG,QAAQ;AAC3B,OAAI,IAAI,UAAU,QACd,OAAM,IAAI,MAAM,kCAAkC,KAAK,aAAa,MAAM,aAAa,QAAQ,OAAO,IAAI,OAAO,GAAG;AAExH,QAAK,QAAQ;AACb,QAAK,SAAS;AACd,QAAK,SAAS;AACd,QAAK,OAAO;aAEP,SAAS,QAAW;GACzB,MAAMC,SAAO,EAAE,MAAM;AACrB,QAAK,OAAOA,OAAK;aAEZ,QAAQ,OACb,MAAK,OAAO,KAAK;WAEZ,OAAO,OACZ,MAAK,QAAQ,IAAI;MAGjB,OAAM,IAAI,mBAAmB,wFAAwF;;CAG7H,QAAQ,KAAK;AACT,QAAM,IAAI,MAAM,0BAA0B,MAAM;;CAEpD,OAAO,SAAS,MAAM;EAClB,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;AACtC,SAAO,KAAK,MAAM,OAAO,MAAO,OAAO,KAAK,OAAO,MAAM,IAAK,EAAE;;CAEpE,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,MAAM;AACN,SAAO,KAAK;;CAEhB,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK,QAAQ;;CAExB,IAAI,QAAQ;AACR,SAAO,EAAE,KAAK,KAAK;;CAEvB,SAAS;EACL,MAAM,OAAO,KAAK;EAClB,MAAM,QAAQ,KAAK;EACnB,MAAM,QAAQ,KAAK;EACnB,MAAM,MAAM,KAAK;EACjB,MAAM,MAAM,IAAK,IAAI,SAAS,KAAM;EACpC,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;EACtC,MAAM,KAAK,OAAO,KAAK,OAAO;EAC9B,MAAM,KAAK,OAAO,KAAK,OAAO;AAU9B,MAAI,QAAQ,KAAK,QAAQ,MAAM,KAAK,EAChC,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;AAE/D,MAAI,SAAS,UACT,OAAO,MAAM,KACb,EAAE,SAAS,KAAK,SAAS,MAAM,OAAO,KAAK,GAC3C,OAAM,IAAI,MAAM,iBAAiB,MAAM,UAAU,OAAO,GAAG,YAAY,KAAK,GAAG;EAEnF,MAAM,OAAO,GAAG,OAAO,SAAS,OAAO,GAAG,GAAG,SAAS,SAAS,SAAY,IAAI,OAAO,OAAO,GAAG;AAChG,MAAI,KAAK,UAAU,GACf,OAAM,IAAI,MAAM,wBAAwB,GAAG,gBAAgB,KAAK,OAAO,GAAG;AAE9E,MAAI,KAAK,KAAK,KAAK,OAAO,GACtB,OAAM,IAAI,MAAM,gBAAgB,KAAK,8BAA8B,GAAG,GAAG;EAE7E,MAAM,QAAQ,IAAI,WAAW,KAAK,IAAI,OAAO;AAC7C,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACpB,OAAM,KAAK;AAEf,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjC,MAAM,MAAM,IAAI;AAChB,SAAM,OAAO,IAAI;;EAErB,MAAM,OAAO,OAAO,gBAAgB,MAAM,CAAC,MAAM,KAAK,OAAO,GAAG;AAChE,MAAI,KAAK,UAAU,OAAO,GACtB,OAAM,IAAI,MAAM,gBAAgB,KAAK,gBAAgB,IAAI,OAAO,GAAG;AAEvE,SAAO;;CAEX,OAAO,MAAM;AACT,MAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,iBAAiB;EAErC,MAAM,QAAQ,KAAK;AACnB,MAAI,CAAC,MAAM,KAAK,QAAQ,MAAM,MAAM,CAAC,CAAC,SAAS,MAAM,CACjD,OAAM,IAAI,MAAM,mBAAmB,QAAQ;EAE/C,MAAM,KAAK,QAAQ,MAAM,IAAI,MAAM;AACnC,MAAI,KAAK,SAAS,GACd,OAAM,IAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,mBAAmB;EAEhE,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;AAC9B,MAAI,CAAC,MAAM,KAAK,QAAQ,MAAM,MAAM,CAAC,CAAC,SAAS,KAAK,CAChD,OAAM,IAAI,MAAM,oBAAoB,OAAO;EAE/C,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;EACtC,MAAM,KAAK,OAAO,KAAK,OAAO;EAC9B,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,MAAI,KAAK,SAAS,GACd,OAAM,IAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,mBAAmB;EAGhE,MAAM,QAAQ,SADC,KAAK,MAAM,IAAI,KAAK,GAAG,CACR;EAC9B,MAAM,SAAS,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG;EACvD,IAAI;AACJ,MAAI,aAAa,IAAI,KAAK,EAAE;AACxB,WAAQ,OAAO,MAAM,IAAI,SAAS,OAAO,GAAG;AAC5C,OAAI,SAAS,KAAK,SAAS,OACvB,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;OAG3D,SAAQ;QAIZ,SAAQ,OAAO,MAAM,IAAI,SAAS,OAAO,GAAG;AAEhD,MAAI,OAAO,MAAM,OACb,OAAM,IAAI,MAAM,gCAAgC;AAWpD,MAAI,KAAK,SAAS,OAAO,GACrB,OAAM,IAAI,MAAM,QAAQ,OAAO,KAAK,KAAK,OAAO,cAAc;AAElE,SAAO,KAAK,MAAM,GAAG,OAAO,GAAG;EAC/B,MAAM,KAAK,KAAK;EAChB,MAAM,MAAM,IAAI,MAAM,IAAI,KAAK,OAAO;EACtC,IAAI;AACJ,MAAI,MAAM,GAAG;GAET,MAAM,MAAM,gBADC,IAAI,MAAM,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,KAAK,MAAM,GAAG,CACxB;AAEjC,OADW,QAAQ,IAAI,MAAM,GAAG,GAAG,CAAC,GAC1B,KAAK,MAAM,EAEjB,OAAM,IAAI,MAAM,4EAA4E;AAEhG,SAAM,IAAI,MAAM,GAAG;SAElB;GAED,MAAM,MAAM,gBADC,KAAK,MAAM,GAAG,CACM;GACjC,MAAM,KAAK,QAAQ,IAAI,MAAM,GAAG,OAAO,GAAG,CAAC;AAC3C,OAAI,MAAM,EACN,KAAI,MAAM,EACN,OAAM,IAAI,MAAM,qCAAqC;OAGrD,OAAM,IAAI,MAAM,qCAAqC;AAG7D,SAAM,IAAI,MAAM,OAAO,GAAG;;AAE9B,MAAI,IAAI,UAAU,KAAK,OAAQ,KAAK,SAAS,MAAM,IAAK,EAAE,CACtD,OAAM,IAAI,MAAM,mCAAmC,OAAO;AAE9D,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,OAAK,SAAS;AACd,OAAK,OAAO,IAAI,WAAW,IAAI;;;AAGvC,QAAQ,QAAQ,IAAI,IAAI;CACpB,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACR,CAAC,KAAK,EAAE;CACX,CAAC;AACF,QAAQ,QAAQ,IAAI,IAAI,OAAO,QAAQ;CACnC,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAC7B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK,EAAE;CACjC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK,EAAE;CACjC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK,EAAE;CACjC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,KAAK,EAAE;CACjC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,QAAW,EAAE;CACvC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CAChC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE;CACnC,CAAC,CAAC;;;;;;;;;;;;;;;;;;ACvYH,IAAa,QAAb,cAA2B,QAAQ;CAC/B,YAAY,EAAE,KAAK,MAAM,OAAO,OAAO,MAAM,OAAO,OAAO,QAAQ;AAC/D,QAAM;GAAE;GAAK;GAAM;GAAO;GAAO;GAAM;GAAO;GAAK,CAAC;AACpD,MAAI,CAAC,UAAU,IAAI,KAAK,KAAK,CACzB,OAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,aAAa;AAE7D,OAAK,UAAU;;CAEnB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,IAAI,OAAO,QAAQ;AACf,OAAK,UAAU;;;;;;AClBvB,IAAa,SAAb,cAA4B,OAAO;CAC/B,YAAY,EAAE,KAAK,OAAO,OAAO,cAAc,MAAM,OAAO,KAAK,eAAe,QAAS;AACrF,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAM;IAAO;IAAK,CAAC;WAEnC,GAAG;AACN,OAAI,aAAa,mBACb,KAAI,QAAQ,OAAO,cAAc;IAC7B,MAAMC,QAAMC,QAAU,gBAAgBA,QAAU,sBAAsB;AACtE,UAAM;KAAE;KAAK;KAAM;KAAM;KAAO;KAAK,CAAC;SAGtC,OAAM,IAAI,MAAM,6BAA6B,KAAK,GAAG;OAIzD,OAAM;;EAGd,IAAI;AACJ,MAAI,KAAK,QAAQ,OAAO,cAAc;AAClC,QAAK,QAAQ,KAAK;AAElB,YAAS,IAAI,OAAO;IAChB,KAFYA,QAAU,yBAAyB,KAAK,IAAI,CAE3C;IACb,MAAM,eAAe,OAAO,UAAU,OAAO;IAChD,CAAC;QAGF,OAAM,IAAI,MAAM,6BAA6B,KAAK,KAAK,GAAG;AAE9D,OAAK,UAAU;;;;;;;CAOnB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,KAAK,KAAK,QAAQ,MAAM,OAAO,OAAO,QAAQ,QAAW;AACrD,SAAO,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,QAAQ,OAAO,MAAM,MAAM;;CAErE,SAAS,KAAK,MAAM,QAAQ,OAAO,OAAO,OAAO,OAAO;EACpD,MAAM,MAAMA,QAAU,qBAAqB,KAAK,OAAO,MAAM,OAAO,IAAI,CAAC;AACzE,MAAI,SAAS,KACT,QAAO,IAAI,MAAM;GAAE,KAAK;GAAK,MAAM,OAAO;GAAa,EAAE,OAAO;OAE/D;GACD,IAAI;AACJ,OAAI,MAAM;AACN,YAAQ;AACR,QAAI,SAAS,GACT,QAAO,OAAO;QAGd,QAAO,OAAO;UAGjB;AACD,QAAI,SAAS,OACT,SAAQ;AAEZ,QAAI,SAAS,SAAS,SAAS,GAE3B,QAAO,OAAO;QAGd,QAAO,OAAO;;AAEtB,UAAO,IAAI,MAAM;IAAE,KAAK;IAAW;IAAa;IAAc;IAAO,EAAE,OAAO;;;;;;;;;;ACzE1F,IAAW;CACV,SAAU,QAAM;AACb,QAAK,SAAS;AACd,QAAK,SAAS;AACd,QAAK,UAAU;GAChB,SAAS,OAAO,EAAE,EAAE;;;;;AAKvB,IAAa,SAAb,cAA4B,OAAO;;;;;;CAM/B,YAAY,YAAY;EACpB,MAAM,EAAE,KAAK,OAAO,OAAO,UAAU,OAAO,KAAK,KAAK,MAAM,OAAO,QAAS;AAC5E,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAM;IAAO;IAAK,CAAC;WAEnC,GAAG;AACN,OAAI,aAAa,mBACb,KAAI,QAAQ,OAAO,UAAU;IACzB,MAAM,OAAOC,QAAU,gBAAgBA,QAAU,wBAAwB;AACzE,UAAM;KAAE,KAAK;KAAY;KAAM,CAAC;SAGhC,OAAM,IAAI,MAAM,kDAAkD;OAItE,OAAM;;AAGd,MAAI,KAAK,QAAQ,OAAO,SACpB,OAAM,IAAI,MAAM,kDAAkD;AAEtE,OAAK,QAAQ,SAAS,OAAO,OAAO,KAAK;;;;;;;;;;;;CAY7C,QAAQ,OAAO,IAAI,OAAO,IAAI,OAAO,MAAM,OAAO,OAAO;AACrD,SAAO,QAAQ,OAAO,KAAK,OAAO;EAClC,IAAI,UAAU;AAEd,MAAI,MAAM;AACN,cAAW;AACX,cAAW;QAGX,SAAQ,MAAR;GACI,KAAK,KAAK;AACN,eAAW;AACX,eAAW;AACX;GACJ,KAAK,KAAK;AACN,eAAW;AACX,eAAW;AACX;GACJ,KAAK,KAAK;AACN,eAAW;AACX,eAAW;AACX;GACJ,QACI,OAAM,IAAI,MAAM,+BAA+B,KAAK,GAAG;;AAGnE,SAAOA,QAAU,cAAc,MAAM,MAAM,KAAK,KAAK,UAAU,UAAUA,QAAU,6BAA6B;;;;;;;;;;;;;;;;;;;;;;CAsBpH,OAAO,OAAO,OAAO,cAAc,eAAe,MAAM,OAAO,IAAI,OAAO,MAAM,OAAO,OAAO;AAE1F,SAAO,IAAI,OAAO;GACd,KAFS,KAAK,QAAQ,OAAO,SAAS,KAAK,EAAE,MAAM,MAAM,KAAK;GAGxD;GACQ;GACjB,CAAC;;CAEN,IAAI,OAAO;AACP,SAAO,KAAK;;;;;;AC5GpB,IAAa,YAAb,cAA+B,OAAO;CAClC,YAAY,EAAE,KAAK,OAAO,OAAO,gBAAgB,MAAM,OAAO,OAAO,OAAO,QAAW;AACnF,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAM;IAAO;IAAK,CAAC;WAEnC,GAAG;AACN,OAAI,aAAa,mBACb,KAAI,QAAQ,QAAW;IACnB,MAAM,SAAS,IAAI,OAAO,EAAE,OAAO,MAAM,CAAC;AAC1C,QAAI,OAAO,QAAQ,OAAO,aACtB,OAAM,IAAI,MAAM,4CAA4C,OAAO,OAAO;IAE9E,MAAM,SAAS,IAAI,WAAW,OAAO,IAAI,SAAS,OAAO,OAAO,IAAI,OAAO;AAC3E,WAAO,IAAI,OAAO,IAAI;AACtB,WAAO,IAAI,OAAO,OAAO,KAAK,OAAO,IAAI,OAAO;AAChD,UACIC,QAAU,qCAAqC,OAAO;AAC1D,UAAM;KAAE;KAAK;KAAM;KAAM;KAAO;KAAK,CAAC;SAGtC,OAAM;OAIV,OAAM;;AAGd,MAAI,KAAK,QAAQ,OAAO,eACpB,MAAK,WAAW,KAAK;MAGrB,OAAM,IAAI,MAAM,gCAAgC,KAAK,KAAK,GAAG;;CAGrE,QAAQ,MAAM,MAAM,SAAS,MAAM,eAAe,OAAO;AACrD,MAAI,OAAO,QAAQ,UAAU,KACzB,OAAM,IAAI,mBAAmB,sCAAsC;AAEvE,MAAI,OAAO,KACP,UAAS,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC;AAEvC,SAAO,KAAK,SAAS,QAAQ,KAAK,KAAK,aAAa;;CAExD,QAAQ,QAAQ,QAAQ,eAAe,OAAO;EAC1C,MAAM,SAASA,QAAU,uBAAuB,OAAO;EACvD,MAAM,QAAQA,QAAU,qBAAqB,OAAO,KAAK,QAAQ,OAAO;AACxE,MAAI,OAAO,QAAQ,OAAO,mBACtB,QAAO,IAAI,OAAO,EAAE,OAAO,OAAO,CAAC;WAE9B,OAAO,QAAQ,OAAO,mBAC3B,QAAO,IAAI,OAAO;GAAE,OAAO;GAAqB;GAAc,CAAC;MAG/D,OAAM,IAAI,MAAM,mCAAmC,OAAO,OAAO;;;;;;ACzD7E,IAAa,SAAb,cAA4B,OAAO;CAC/B,YAAY,EAAE,KAAK,MAAM,MAAM,OAAO,OAAO;AACzC,MAAI,OAAO,UAAa,QAAQ,QAC5B;OAAI,IAAI,UAAU,OAAO,SAAS,OAAO,mBAAmB,CACxD,QAAO,OAAO;YAET,IAAI,UAAU,OAAO,SAAS,OAAO,mBAAmB,CAC7D,QAAO,OAAO;;AAGtB,QAAM;GAAO;GAAW;GAAa;GAAa;GAAW;GAAK,CAAC;AACnE,MAAI,CAAC,MAAM,KAAK,CACZ,OAAO,oBACP,OAAO,mBACV,CAAC,CAAC,SAAS,KAAK,KAAK,CAClB,OAAM,IAAI,MAAM,8BAA8B,KAAK,OAAO;;CAGlE,QAAQ,SAAS,QAAW,OAAO,QAAW;AAE1C,SADkB,IAAI,UAAU,EAAE,OAAO,QAAQ,EAAE,KAAK,CACvC,QAAQ,KAAK,MAAM;;;;;;ACpB5C,IAAa,eAAb,cAAkC,MAAM;CACpC,cAAc;AACV,QAAM,GAAG,UAAU;AACnB,OAAK,oBAAoB;AACzB,OAAK,iBAAiB;AACtB,OAAK,yBAAyB;AAC9B,OAAK,yBAAyB;AAC9B,OAAK,yBAAyB;AAC9B,OAAK,oBAAoB;AACzB,OAAK,oBAAoB;AACzB,OAAK,wBAAwB;AAC7B,OAAK,oBAAoB;AACzB,OAAK,aAAa;AAClB,OAAK,kBAAkB;AACvB,OAAK,yBAAyB;AAC9B,OAAK,2BAA2B;AAChC,OAAK,8BAA8B;AACnC,OAAK,oBAAoB;;;AAGjC,MAAa,SAAS,IAAI,cAAc;AACxC,IAAa,UAAb,MAAa,QAAQ;CACjB,YAAY,EAAE,MAAM,OAAO,UAAU,OAAO,MAAM,OAAO;AACrD,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,MAAI,QAAQ,QAAW;AACnB,OAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,CACxB,OAAM,IAAI,MAAM,qBAAqB,KAAK,GAAG;GAEjD,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;GACtC,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,OAAI,OAAO,MAAM,MAAM,KAAK,KAAK,EAC7B,OAAM,IAAI,MAAM,0DAA0D,GAAG,MAAM,OAAO,GAAG,GAAG;AAEpG,OAAI,SAAS,OACT,SAAQ,YAAY,SAAY,IAAI,SAAS,SAAS;AAE1D,OAAI,QAAQ,KAAK,QAAQ,MAAM,OAAO,KAAK,EACvC,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;AAE/D,QAAK,QAAQ;AACb,QAAK,SAAS;aAET,SAAS,QAAW;GACzB,MAAMC,SAAO,EAAE,MAAM;AACrB,QAAK,OAAOA,OAAK;aAEZ,QAAQ,OACb,MAAK,OAAO,KAAK;WAEZ,OAAO,QAAW,OAGvB,OAAM,IAAI,MAAM,gFAAgF;;CAGxG,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK,QAAQ;;CAExB,IAAI,QAAQ;AACR,SAAO,EAAE,KAAK,KAAK;;CAEvB,WAAW,GAAG;AACV,MAAI,KAAK,OAEL,KADe,QAAQ,MAAM,IAAI,KAAK,KAAK,CAChC;AAEf,SAAO,SAAS,KAAK,OAAO,EAAE;;CAElC,OAAO,YAAY,UAAU,IAAI,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG;EAC9D,IAAI,QAAQ;GAAC;GAAO;GAAO;GAAM;AACjC,MAAI,WAAW,IAAI;GAEf,MAAM,SADU,QAAQ,MAAM,IAAI,CACX,KAAK,QAAM;AAC9B,QAAIC,OAAK,GACL,QAAO;AACX,WAAO,SAASA,IAAE;KACpB;GACF,MAAM,MAAM,OAAO;GACnB,MAAM,IAAI,IAAI;AACd,QAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,QAAO,KAAK,MAAM,IAAI,KAAK;AAE/B,WAAQ;;AAEZ,QAAM,SAAS,MAAM;AACjB,OAAI,IAAI,KAAK,IAAI,GACb,OAAM,IAAI,MAAM,wCAAwC,EAAE,kBAAkB;IAElF;AACF,SAAO,MACF,KAAK,MAAM;AACZ,UAAO,SAAS,GAAG,EAAE;IACvB,CACG,KAAK,GAAG;;CAEjB,SAAS;EACL,MAAM,OAAO,KAAK;EAClB,MAAM,QAAQ,KAAK;EACnB,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;EACtC,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,MAAI,OAAO,MAAM,MAAM,KAAK,KAAK,EAC7B,OAAM,IAAI,MAAM,0DAA0D,GAAG,MAAM,OAAO,GAAG,GAAG;AAEpG,MAAI,QAAQ,KAAK,QAAQ,MAAM,OAAO,KAAK,EACvC,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY,KAAK,GAAG;EAE/D,MAAM,OAAO,GAAG,OAAO,SAAS,OAAO,OAAO,GAAG;AACjD,MAAI,KAAK,SAAS,EACd,OAAM,IAAI,MAAM,kBAAkB,KAAK,OAAO,MAAM,KAAK,uBAAuB;AAEpF,SAAO;;CAEX,OAAO,MAAM;AACT,MAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,iBAAiB;EAErC,MAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;AAC9B,MAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,CACzB,OAAM,IAAI,MAAM,mBAAmB,QAAQ;EAE/C,MAAM,KAAK,QAAQ,MAAM,IAAI,MAAM;AACnC,MAAI,KAAK,SAAS,GACd,OAAM,IAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,mBAAmB;EAEhE,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;AAC9B,MAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,CACxB,OAAM,IAAI,MAAM,oBAAoB,OAAO;EAE/C,MAAM,SAAS,QAAQ,MAAM,IAAI,KAAK;EACtC,MAAM,KAAK,OAAO,KAAK,OAAO;AAC9B,MAAI,KAAK,SAAS,GACd,OAAM,IAAI,MAAM,QAAQ,KAAK,KAAK,OAAO,cAAc;EAG3D,MAAM,QAAQ,SADC,KAAK,MAAM,OAAO,IAAI,OAAO,KAAK,OAAO,GAAG,CAC7B;AAC9B,OAAK,QAAQ;AACb,OAAK,SAAS;;;AAGtB,QAAQ,QAAQ,IAAI,IAAI,OAAO,QAAQ;CACnC,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,MAAM,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC5B,OAAO,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAC7B,SAAS,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;CAClC,CAAC,CAAC;AACH,QAAQ,QAAQ,IAAI,IAAI;CACpB,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACT,CAAC,MAAM,EAAE;CACZ,CAAC;;;;AC5NF,IAAI,4BAAuB,UAAW,SAAU,GAAG,GAAG;CAClD,IAAI,IAAI,EAAE;AACV,MAAK,IAAI,KAAK,EAAG,KAAI,OAAO,UAAU,eAAe,KAAK,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAC9E,GAAE,KAAK,EAAE;AACb,KAAI,KAAK,QAAQ,OAAO,OAAO,0BAA0B,YACrD;OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,sBAAsB,EAAE,EAAE,IAAI,EAAE,QAAQ,IAC/D,KAAI,EAAE,QAAQ,EAAE,GAAG,GAAG,KAAK,OAAO,UAAU,qBAAqB,KAAK,GAAG,EAAE,GAAG,CAC1E,GAAE,EAAE,MAAM,EAAE,EAAE;;AAE1B,QAAO;;;;;;;;AAUX,IAAa,SAAb,cAA4B,OAAO;CAC/B,YAAY,IAAI;EACZ,IAAI,EAAE,KAAK,OAAO,OAAO,UAAU,MAAM,OAAO,KAAK,IAAI,QAAQ,IAAI,MAAM,OAAO,IAAI;GAAC;GAAO;GAAQ;GAAQ;GAAS;GAAO;GAAM;GAAM,CAAC;AAC3I,MAAI,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK;AACjC,OAAI,OAAO,OACP,KAAI,QAAQ,OACR,MAAK;OAGL,MAAK,SAAS,KAAK,GAAG;AAG9B,SAAM,WAAW,IAAI,OAAO,SAAS,OAAO,SAAS,CAAC;;AAE1D,QAAM,OAAO,OAAO;GAAE;GAAK;GAAM;GAAM;GAAO;GAAK,EAAE,IAAI,CAAC;AAC1D,MAAI,KAAK,SAAS,OAAO,SACrB,OAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,cAAc;;CAGlE,IAAI,KAAK;AACL,SAAO,WAAW,KAAK,IAAI;;CAE/B,IAAI,MAAM;AACN,SAAO,KAAK,GAAG,SAAS,GAAG;;;;;;;;;;;;AClCnC,IAAa,QAAb,MAAa,cAAc,OAAO;CAE9B,YAAY,EAAE,KAAK,OAAO,OAAO,YAAY,MAAM,OAAO,OAAO,MAAM,MAAM;AACzE,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAM;IAAO;IAAK,CAAC;WAEnC,OAAO;AACV,OAAI,OAAO,KACP,OAAM;AAEV,OAAI,SAAS,OAAO,YAAY;IAC5B,MAAM,MAAM,OAAO,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,QAAQ;AAC7D,UAAM;KAAE,KAAK;KAAW;KAAM,CAAC;SAG/B,OAAM,IAAI,MAAM,sBAAsB,KAAK,gBAAgB;;AAGnE,MAAI,SAAS,OAAO,WAChB,MAAK,UAAU,KAAK;MAGpB,OAAM,IAAI,MAAM,sBAAsB,KAAK,gBAAgB;;;;;;;;;CAUnE,OAAO,KAAK;AACR,SAAO,KAAK,QAAQ,KAAK,KAAK,IAAI;;CAEtC,QAAQ,KAAK,MAAM,MAAM,QAAQ,MAAM;AACnC,MAAI,OAAO,MAAM;AACb,OAAI,IAAI,UAAU,IAAI,KAAK,KACvB,QAAO;AAEX,WAAQ,IAAI,MAAM,EAAE,OAAO,KAAK,CAAC;aAE5B,SAAS,MACd;OAAI,MAAM,SAAS,KAAK,MACpB,QAAO;QAIX,OAAM,IAAI,MAAM,sCAAsC;AAE1D,MAAI,MAAM,QAAQ,KAAK,KACnB,QAAO;AAEX,SAAO,MAAM,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI;;CAEhD,WAAW,KAAK,KAAK;EACjB,MAAM,SAAS,OAAO,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,QAAQ;AAChE,SAAQ,OAAO,UAAU,IAAI,UAAU,OAAO,UAAU,KAAK,IAAI,UAAU;;;;;;AC/DnF,IAAa,aAAb,cAAgC,OAAO;CACnC,YAAY,EAAE,KAAK,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM;EACpD,IAAI;AACJ,MAAI,OAAO,UACP,QAAQ,UACR,SAAS,UACT,OAAO,OACP,KAAI,OAAO,OAAO,SACd,QAAO;WAEF,QAAQ,OACb,QAAO,SAAS,MAAM,GAAG;MAGzB,QAAO;AAGf,MAAI,QAAQ,OACR,OAAM,IAAI,MAAM,uBAAuB;AAE3C,MAAI,QAAQ,OAAO,IAAI,EAEnB,QAAO,OAAO;WAET,QAAQ,OAAO,IAAI,EAExB,QAAO,OAAO,OAAO;WAEhB,QAAQ,OAAO,IAAI,EAExB,QAAO,OAAO,OAAO;WAEhB,QAAQ,OAAO,KAAK,EAEzB,QAAO,OAAO,OAAO;MAGrB,OAAM,IAAI,MAAM,iBAAiB,IAAI,wBAAwB;AAEjE,QAAM,WAAW,MAAM,OAAO,SAAS,KAAK,CAAC;AAC7C,QAAM;GAAE;GAAK;GAAM;GAAO;GAAM;GAAK,CAAC;AACtC,MAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CACtB,OAAM,IAAI,MAAM,kBAAkB,OAAO,cAAc;;CAG/D,IAAI,MAAM;AACN,SAAO,WAAW,KAAK,IAAI;;CAE/B,IAAI,OAAO;AACP,SAAO,KAAK,IAAI,SAAS,GAAG;;CAEhC,IAAI,WAAW;AACX,SAAO,KAAK,MAAM;;;;;;ACjD1B,IAAa,SAAb,MAAoB;;;;;;;CAOhB,YAAY,KAAK,OAAO,QAAQ,MAAM,OAAO,OAAO,YAAY;AAC5D,OAAK,OAAO;AACZ,OAAK,OAAO,EAAE;AACd,OAAK,SAAS,UAAU;AACxB,OAAK,QAAQ;AACb,OAAK,WAAW;EAChB,MAAM,CAAC,KAAK,OAAO,OAAO,MAAM,WAAW,KAAK,QAAQ,KAAK,KAAK;AAClE,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,SAAS;AACd,OAAK,WAAW;AAChB,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,QAAQ,IAAI;;CAErB,IAAI,MAAM;AACN,SAAO,KAAK;;CAEhB,IAAI,MAAM;AACN,SAAO,KAAK,KAAK;;CAErB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,MAAM;AACN,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK,KAAK;;CAErB,IAAI,OAAO;AACP,SAAO,IAAI,WAAW,EAAE,EAAE,KAAK,IAAI,KAAK;;CAE5C,IAAI,KAAK;AACL,SAAO,KAAK,KAAK;;CAErB,IAAI,OAAO;AACP,SAAO,KAAK;;;;;;;;;CAShB,QAAQ,KAAK,MAAM;AACf,SAAO,QAAQ,KAAK,KAAK;;CAE7B,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,UAAU;AACV,SAAO,KAAK;;CAEhB,IAAI,UAAU;EACV,IAAI,OAAO,EAAE;AACb,MAAI,OAAO,KAAK,KAEZ,QAAO,KAAK,KAAK;MAIjB,QAAO,EAAE;EAGb,MAAM,UAAU,EAAE;AAClB,OAAK,MAAM,OAAO,KACd,SAAQ,KAAK,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC,CAAC;AAE3C,SAAO;;CAEX,IAAI,SAAS;EACT,IAAI,OAAO,EAAE;AACb,MAAI,OAAO,KAAK,KAEZ,QAAO,KAAK,KAAK;MAIjB,QAAO,EAAE;EAGb,MAAM,SAAS,EAAE;AACjB,OAAK,MAAM,OAAO,KACd,QAAO,KAAK,IAAI,MAAM,EAAE,MAAM,KAAK,CAAC,CAAC;AAEzC,SAAO;;CAEX,SAAS;AACL,SAAO,KAAK,UAAU,KAAK,MAAM,QAAW,EAAE;;;AAGtD,SAAgB,MAAM,KAAK,MAAM;AAC7B,KAAI,QAAQ,QAAQ,KAChB,QAAO,KAAK,UAAU,IAAI;KAG1B,OAAM,IAAI,MAAM,6BAA6B;;AAGrD,SAAgB,QAAQ,KAAK,MAAM;AAC/B,KAAI,EAAE,OAAO,KACT,OAAM,IAAI,MAAM,kCAAkC;CAEtD,MAAM,CAAC,OAAO,KAAK,WAAW,UAAU,IAAI,KAAK;AACjD,KAAI,WAAW,SACX,OAAM,IAAI,MAAM,uBAAuB,QAAQ,UAAU,GAAG;AAEhE,KAAI,QAAQ,OACR,QAAO;CAEX,IAAI,MAAM,MAAM,KAAK,KAAK;CAC1B,MAAM,OAAO,IAAI,aAAa,CAAC,OAAO,IAAI,CAAC;AAC3C,KAAI,OAAO,QAAQ,OAAO,SAAS,MAAM,KAAK;AAC9C,OAAM,MAAM,KAAK,KAAK;AACtB,QAAO;EAAC;EAAK;EAAO;EAAM;EAAK;EAAQ;;;;;AC7H3C,MAAMC,UAAQ;AACd,IAAa,WAAb,MAAa,iBAAiB,OAAO;CACjC,YAAY,EAAE,KAAK,MAAM,OAAO,MAAM,OAAO,KAAK;AAC9C,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAO;IAAM;IAAK,CAAC;WAEnC,GAAG;AACN,OAAI,aAAa,oBAAoB;AACjC,QAAI,OAAO,UAAc,QAAQ,UAAa,EAAE,OAAO,KACnD,OAAM;AAEV,QAAI,QAAQ,QAAW;AACnB,WAAM;MAAE,MAAM,IAAI;MAAY;MAAM,CAAC;AACrC,YAAO,KAAK;;IAEhB,IAAI;AACJ,QAAI,QAAQ,OAAO,SACf,WAAU,SAAS;aAEd,QAAQ,OAAO,QACpB,WAAU,SAAS;aAEd,QAAQ,OAAO,WACpB,WAAU,SAAS;QAGnB,OAAM,IAAI,MAAM,sBAAsB,KAAK,gBAAgB;AAE/D,KAAC,KAAK,QAAQ,QAAQ,IAAI;AAC1B,UAAM;KAAO;KAAW;KAAM,CAAC;AAC/B,SAAK,UAAU;SAGf,OAAM;;AAGd,MAAI,KAAK,QAAQ,OAAO,SACpB,MAAK,UAAU,KAAK;WAEf,KAAK,QAAQ,OAAO,QACzB,MAAK,UAAU,KAAK;WAEf,KAAK,QAAQ,OAAO,WACzB,MAAK,UAAU,KAAK;MAGpB,OAAM,IAAI,MAAM,sBAAsB,KAAK,gBAAgB;;CAGnE,OAAO,KAAK;AACR,MAAI,IAAI,QAAQ,KAAK,IACjB,OAAM,IAAI,MAAM,qBAAqB,IAAI,KAAK,wBAAwB;AAE1E,SAAO,KAAK,QAAQ,IAAI;;CAE5B,OAAO,KAAK,WAAW,OAAO;AAC1B,MAAI,IAAI,QAAQ,KAAK,IACjB,OAAM,IAAI,MAAM,qBAAqB,IAAI,KAAK,wBAAwB;AAE1E,SAAO,KAAK,QAAQ,KAAK,KAAK,MAAM,SAAS;;CAEjD,OAAO,iBAAiB,KAAK;EACzB,IAAI;EACJ,MAAM,OAAO,IAAI;AACjB,MAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,4CAA4C,KAAK,OAAO,eAAe;AAE3F,MAAI;AACA,YAAS,IAAI,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;WAEnC,GAAG;AACN,SAAM,IAAI,MAAM,iCAAiC,IAAI;;AAEzD,MAAI,OAAO,QAAQ,OAAO,SACtB,OAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO;EAEhE,MAAM,OAAO,OAAO,MAAM,IAAI,OAAO,EAAE;AACvC,MAAI,OAAO,QAAQ,OAAO,YAAY,KAAK,SAAS,EAChD,OAAM,IAAI,MAAM,mBAAmB,KAAK,+BAA+B,OAAO,OAAO;EAEzF,MAAM,UAAU,OAAO,MAAM,IAAI,OAAO,EAAE;AAC1C,MAAI,OAAO,QAAQ,OAAO,YAAY,QAAQ,SAAS,EACnD,OAAM,IAAI,MAAM,gBAAgB,QAAQ,+BAA+B,OAAO,OAAO;EAEzF,MAAM,SAAS,OAAO,MAAM,IAAI,OAAO,EAAE;AACzC,MAAI,OAAO,QAAQ,OAAO,YAAY,OAAO,SAAS,EAClD,OAAM,IAAI,MAAM,iBAAiB,OAAO,KAAK,+BAA+B,OAAO,OAAO;AAE9F,SAAO,CAAC,OAAO,KAAK,OAAO,KAAK;;CAEpC,OAAO,gBAAgB,KAAK;EACxB,IAAI;EACJ,MAAM,OAAO,IAAI;AACjB,MAAI,KAAK,UAAU,EACf,OAAM,IAAI,MAAM,4CAA4C,KAAK,OAAO,eAAe;AAE3F,MAAI;AACA,YAAS,IAAI,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;WAEnC,GAAG;AACN,SAAM,IAAI,MAAM,iCAAiC,IAAI;;AAEzD,MAAI,OAAO,QAAQ,CAAC,OAAO,QAAQ,CAC/B,OAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO;AAEhE,SAAO,CAAC,OAAO,KAAK,OAAO,KAAK;;CAEpC,OAAO,mBAAmB,KAAK;EAC3B,MAAM,MAAM,IAAI;AAChB,MAAI,CAAC;GAAC,KAAK;GAAK,KAAK;GAAK,KAAK;GAAK,KAAK;GAAI,CAAC,SAAS,IAAI,CACvD,OAAM,IAAI,MAAM,iBAAiB,IAAI,iBAAiB;AAE1D,MAAI,OAAO,GAAG,SAAS,OAAO,MAAM,IAAI,OAAO,WAAW,CAAC,IAAIA,QAAM;AACrE,MAAI,OAAO,IAAI;EACf,MAAM,CAAC,OAAO,QAAQ,IAAI;AAE1B,SAAO,CADK,OAAO,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,QAAQ,EAChD,OAAO,WAAW;;CAEnC,iBAAiB,KAAK,KAAK,WAAW,OAAO;AACzC,MAAI;GACA,MAAM,OAAO,IAAI;AACjB,OAAI,KAAK,UAAU,EACf,QAAO;AAEX,OAAI,KAAK,MAAM,IACX,QAAO;AAEX,OAAI,YAAY,IAAI,QAAQ,IACxB,QAAO;AAGX,QADa,OAAO,MAAM,IAAI,OAAO,EAAE,EAC9B,SAAS,EAEd,QAAO;WAGR,GAAG;AACN,UAAO;;AAEX,SAAO;;CAEX,gBAAgB,KAAK,KAAK,WAAW,OAAO;AACxC,MAAI;GACA,MAAM,OAAO,IAAI;AACjB,OAAI,KAAK,UAAU,EACf,QAAO;AAEX,OAAI,KAAK,MAAM,IACX,QAAO;AAEX,OAAI,YAAY,IAAI,QAAQ,IACxB,QAAO;WAGR,GAAG;AACN,UAAO;;AAEX,SAAO;;CAEX,mBAAmB,KAAK,KAAK,WAAW,OAAO;AAC3C,MAAI;GACA,MAAM,CAAC,OAAO,SAAS,mBAAmB,IAAI;AAE9C,OADe,IAAI,OAAO;IAAO;IAAK,MAAM,OAAO;IAAY,CAAC,CACrD,QAAQ,IACf,QAAO;AAEX,OAAI,YAAY,IAAI,QAAQ,IACxB,QAAO;WAGR,GAAG;AACN,UAAO;;AAEX,SAAO;;;;;;AC9Kf,MAAM,QAAQ;AACd,IAAW;CACV,SAAU,OAAK;AACZ,OAAI,OAAO;GACZ,QAAQ,MAAM,EAAE,EAAE;AACrB,IAAa,SAAb,MAAa,eAAe,OAAO;CAC/B,YAAY,EAAE,KAAK,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,IAAI,GAAG;AACnE,MAAI;AACA,SAAM;IAAE;IAAK;IAAM;IAAO;IAAM;IAAK,CAAC;WAEnC,GAAG;AACN,OAAI,aAAa,oBAAoB;AACjC,QAAI,OAAO,UAAa,EAAE,SAAS,KAC/B,OAAM;AAEV,QAAI,QAAQ,OACR,KAAI,IAAI,UAAU,IAAI;AAClB,WAAM;MAAE,MAAM,IAAI;MAAc;MAAM,CAAC;AACvC,YAAO,KAAK;UAGZ,QAAO,OAAO;AAGtB,QAAI,CAAC,QAAQ,IAAI,KAAK,CAClB,OAAM,IAAI,MAAM,6BAA6B,OAAO;AAExD,KAAC,OAAO,OAAO,QAAQ,OAAO,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,MAAM,MAAM;AACjE,UAAM;KAAO;KAAW;KAAM,CAAC;SAG/B,OAAM;;AAGd,MAAI,CAAC,KAAK,UACN,OAAM,IAAI,MAAM,6BAA6B,KAAK,KAAK,GAAG;;CAGlE,OAAO,QAAQ,KAAK,MAAM,MAAM,OAAO;AACnC,MAAI,CAAC,QAAQ,IAAI,KAAK,CAClB,OAAM,IAAI,MAAM,6BAA6B,KAAK,GAAG;AAEzD,QAAM,OAAO,OAAO,EAAE,EAAE,IAAI;AAC5B,MAAI,SAAS,GAAG,SAAS,OAAO,MAAM,IAAI,KAAK,CAAC,IAAI,MAAM;AAC1D,MAAI,OAAO,IACP,MAAK,MAAM,OAAO,QAAQ,KAAK,KAAK;EAExC,MAAM,MAAM,OAAO,OAAO,EAAE,EAAE,IAAI;EAClC,MAAM,MAAM,OAAO,UAAU,KAAK,KAAK;AACvC,UAAQ,MAAR;GACI,KAAK,OAAO,WACR,QAAO,CAAC,OAAO,OAAO,EAAE,OAAO,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI;GACnE,QACI,OAAM,IAAI,MAAM,6BAA6B,KAAK,GAAG;;;CAGjE,OAAO,KAAK,MAAM,MAAM,OAAO;AAC3B,SAAO,QAAQ,SAAY,OAAO,KAAK;AACvC,SAAO,OAAO,QAAQ,KAAK,MAAM,MAAM,MAAM;;CAEjD,OAAO,KAAK,WAAW,OAAO,YAAY,OAAO,MAAM,QAAQ,IAAI,GAAG;AAClE,MAAI;GACA,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,KAAK,KAAK,MAAM,MAAM,MAAM;GAC/D,MAAM,SAAS,IAAI,OAAO;IAAO;IAAK,MAAM,KAAK;IAAM,CAAC;AACxD,OAAI,KAAK,QAAQ,OAAO,KACpB,QAAO;AAEX,OAAI,OAAO,OAAO,WACd;QAAI,IAAI,QAAQ,KAAK,KACjB,QAAO;;AAGf,OAAI,YAAY,IAAI,UAAU,KAAK,KAC/B,QAAO;WAGR,GAAG;AACN,UAAO;;AAEX,SAAO;;CAEX,OAAO,UAAU,KAAK,MAAM;EACxB,IAAI,MAAM,QAAQ;AAClB,MAAI,OAAO,IACP,IAAG,OAAO,UAAU,IAAI,KAAK;AAEjC,MAAI,QAAQ,OACR,QAAO;AAEX,SAAO,MAAM,KAAK,KAAK;;CAE3B,OAAO,QAAQ,KAAK,OAAO,OAAO,YAAY,OAAO,QAAQ,MAAM,QAAQ,IAAI,GAAG;AAC9E,MAAI,EAAE,SAAS,KACX,OAAM,IAAI,MAAM,4BAA4B,MAAM,UAAU;EAEhE,IAAI;AACJ,GAAC,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,MAAM,MAAM;EACnD,MAAM,SAAS,IAAI,OAAO;GAAO;GAAW;GAAM,EAAE,QAAW,MAAM,MAAM;AAC3E,MAAI,SAAS,OAAO;AACpB,SAAO,CAAC,QAAQ,IAAI;;;;;;ACpG5B,SAAgB,IAAI,GAAG,QAAQ,GAAG,IAAI,GAAG;AACrC,SAAQ,OAAO,EAAE,CAAC,OAAO,MAAM,GAAG,OAAO,EAAE,EAAE,MAAM,OAAO,EAAE,CAAC,OAAO;;;;;;;;;AASxE,SAAgB,cAAc,KAAK,QAAQ;CACvC,IAAI,SAAS,EAAE;AACf,MAAK,MAAM,SAAS,OAChB,UAAS,qBAAqB,IAAI,QAAQ,OAAO;AAErD,QAAO;;AAEX,SAAgB,YAAY,KAAK,KAAK;AAClC,QAAQ,IAAI,WAAW,IAAI,UACvB,IAAI,OAAO,KAAK,UAAU,QAAQ,IAAI,OAAO;;;;;;;;;;AAUrD,SAAS,qBAAqB,SAAS,QAAQ;CAC3C,IAAI,OAAO,EAAE;AACb,KAAI;AACA,MAAI,mBAAmB,SAAS,EAAE,OAAO,WAAW,UAChD,MAAK,MAAM,KAAK,QACZ,sBAAqB,QAAQ,IAAI,OAAO;WAEvC,OAAO,WAAW,SACvB,QAAO,KAAK,QAAQ;AAExB,SAAO;UAEJ,OAAO;AACV,QAAM,IAAI,MAAM,MAAM;;AAE1B,QAAO;;;;;;;AAWX,SAAgB,SAAS;AACrB,wBAAO,IAAI,MAAM;;AAErB,SAAgB,MAAM,OAAO,MAAM,MAAM;AACrC,KAAI,OAAO,QAAQ,aAAa;AAE5B,SAAO;AACP,UAAQ;;AAEZ,KAAI,OAAO,QAAQ,YACf,QAAO;AAEX,KAAK,OAAO,KAAK,SAAS,QAAU,OAAO,KAAK,SAAS,KACrD,QAAO,EAAE;CAEb,MAAM,SAAS,IAAI,OAAO;AAC1B,MAAK,IAAI,IAAI,OAAO,OAAO,IAAI,IAAI,OAAO,IAAI,MAAM,KAAK,KACrD,QAAO,KAAK,EAAE;AAElB,QAAO;;AAEX,SAAgB,WAAW,OAAO,QAAQ;CACtC,MAAM,YAAY,IAAI,WAAW,OAAO;AACxC,MAAK,IAAI,QAAQ,UAAU,SAAS,GAAG,SAAS,GAAG,SAAS;EACxD,MAAM,OAAO,QAAQ;AACrB,YAAU,SAAS;AACnB,WAAS,QAAQ,QAAQ;;AAE7B,QAAO;;AAEX,SAAgB,WAAW,IAAI;CAC3B,IAAI,QAAQ;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,IAC3B,SAAQ,QAAQ,MAAM,GAAG;AAE7B,QAAO;;AAEX,SAAgB,wBAAwB,KAAK;CACzC,MAAM,WAAW,IAAI,SAAS,EAAE,MAAM,IAAI,KAAK,CAAC;CAChD,MAAM,SAAS,IAAI,OAAO,EAAE,IAAI,IAAI,IAAI,CAAC;CACzC,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,IAAI,IAAI,MAAM,CAAC;CACjD,MAAM,OAAO,IAAI,YAAY;CAC7B,MAAM,MAAM,IAAI,QAAQ;EAAE,MAAM,OAAO;EAAmB,OAAO;EAAG,CAAC,CAAC;CACtE,MAAM,SAAS,SAAS;CACxB,MAAM,MAAM,OAAO;CACnB,MAAM,OAAO,OAAO;CACpB,MAAM,UAAU,IAAI,WAAW,KAAK,SAAS,IAAI,SAAS,OAAO,SAAS,IAAI,SAAS,KAAK,OAAO;AACnG,SAAQ,IAAI,KAAK;AACjB,SAAQ,IAAI,KAAK,KAAK,OAAO;AAC7B,SAAQ,IAAI,QAAQ,KAAK,SAAS,IAAI,OAAO;AAC7C,SAAQ,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,OAAO,OAAO;AAC1D,SAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,SAAS,OAAO,SAAS,IAAI,OAAO;AACxE,QAAO;;AAEX,SAAgB,0BAA0B,KAAK;CAC3C,MAAM,SAAS,IAAI,OAAO,EAAE,IAAI,IAAI,IAAI,CAAC;CACzC,MAAM,YAAY,IAAI,OAAO,EAAE,MAAM,IAAI,IAAI,MAAM,CAAC;CACpD,MAAM,cAAc,IAAI,WAAW,OAAO,MAAM,SAAS,UAAU,MAAM,OAAO;AAChF,aAAY,IAAI,OAAO,MAAM;AAC7B,aAAY,IAAI,UAAU,OAAO,OAAO,MAAM,OAAO;CACrD,MAAM,UAAU,IAAI,QAAQ;EACxB,MAAM,OAAO;EACb,OAAO;EACV,CAAC;CACF,MAAM,eAAe,QAAQ;CAC7B,MAAM,MAAM,IAAI,WAAW,QAAQ,MAAM,SAAS,YAAY,OAAO;AACrE,KAAI,IAAI,aAAa;AACrB,KAAI,IAAI,aAAa,aAAa,OAAO;AACzC,KAAI,IAAI,SAAS,MAAM,EACnB,OAAM,IAAI,MAAM,6BAA6B,IAAI,OAAO,mCAAmC;CAE/F,MAAM,OAAO,IAAI,QAAQ;EACrB,MAAM,OAAO;EACb,OAAO,KAAK,MAAM,IAAI,SAAS,EAAE;EACpC,CAAC;CACF,MAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS,IAAI,OAAO;AAC1D,KAAI,IAAI,KAAK,MAAM;AACnB,KAAI,IAAI,KAAK,KAAK,MAAM,OAAO;AAC/B,QAAO;;;;;ACnIX,IAAa,YAAb,cAA+B,OAAO;CAClC,YAAY,EAAE,KAAK,OAAO,OAAO,QAAQ,MAAM,OAAO,OAAO,SAAS,MAAM;AACxE,MAAI,OAAO,UAAa,UAAU,MAAM;GACpC,MAAM,SAAS,IAAI,OAAO,EAAE,OAAO,QAAQ,CAAC;AAC5C,OAAI,CAAC,MAAM,KAAK,CAAC,OAAO,UAAU,OAAO,QAAQ,CAAC,CAAC,SAAS,OAAO,KAAK,CACpE,OAAM,IAAI,MAAM,wCAAwC,OAAO,KAAK,GAAG;AAE3E,SAAMC,QAAU,qCAAqC,OAAO,IAAI;;AAEpE,QAAM;GAAE;GAAK;GAAM;GAAM;GAAO;GAAK,CAAC;AACtC,MAAI,KAAK,QAAQ,OAAO,OACpB,MAAK,WAAW,KAAK;MAGrB,OAAM,IAAI,MAAM,gCAAgC,KAAK,KAAK,GAAG;;CAGrE,WAAW,MAAM;EACb,MAAM,SAAS,IAAI,OAAO,EAAE,OAAO,MAAM,CAAC;EAC1C,MAAM,UAAUA,QAAU,yBAAyB,OAAO,IAAI;AAE9D,SAAO,YADQA,QAAU,qCAAqC,QAAQ,UAAU,EACrD,KAAK,IAAI;;CAExC,QAAQ,MAAM,MAAM,SAAS,MAAM;AAC/B,MAAI,OAAO,QAAQ,UAAU,KACzB,OAAM,IAAI,MAAM,uCAAuC;AAE3D,MAAI,OAAO,KACP,UAAS,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC;EAEvC,IAAI;AACJ,MAAI,OAAO,QAAQ,OAAO,SACtB,QAAO,OAAO;MAGd,QAAO,OAAO;AAElB,SAAO,KAAK,SAAS,OAAO,MAAM,KAAK,KAAK,KAAK;;CAErD,QAAQ,KAAK,QAAQ,MAAM;AAEvB,SAAO,IAAI,OAAO;GAAE,KADRA,QAAU,gBAAgB,KAAK,OAAO;GACd;GAAM,CAAC;;;;;;;;;;;;;AChCnD,IAAW;CACV,SAAU,SAAO;AACd,SAAM,WAAW;AACjB,SAAM,WAAW;AACjB,SAAM,WAAW;AACjB,SAAM,YAAY;GACnB,UAAU,QAAQ,EAAE,EAAE;;;;;;AAMzB,IAAM,SAAN,MAAa;CACT,cAAc;;;;AAIV,OAAK,OAAO,IAAI,OAAO;;;;;AAKvB,OAAK,OAAO;;;;;;;AAOZ,OAAK,OAAO;;;;AAIZ,OAAK,KAAK;;;;;;AAMlB,IAAM,SAAN,MAAa;CACT,cAAc;;;;AAIV,OAAK,MAAM,IAAI,QAAQ;;;;AAIvB,OAAK,MAAM,IAAI,QAAQ;;;;AAIvB,OAAK,MAAM,IAAI,QAAQ;;;;;;AAM/B,IAAM,SAAN,MAAa;CACT,cAAc;;;;AAIV,OAAK,OAAO;;;;;;AAMZ,OAAK,OAAO,MAAM;;;;AAIlB,OAAK,OAAO;;;;AAIZ,OAAK,OAAO;;;;AAIZ,OAAK,OAAO;;;;;;AAMpB,IAAM,SAAN,MAAa;CACT,cAAc;;;;AAIV,OAAK,OAAO,IAAI,OAAO;;;;;;AAM/B,IAAM,UAAN,MAAc;CACV,cAAc;;;;AAIV,OAAK,OAAO;;;;AAIZ,OAAK,OAAO;;;;AAIZ,OAAK,OAAO,KAAK;;;;AAIjB,OAAK,OAAO;;;AAGpB,IAAM,OAAN,MAAW;CACP,YAAY,SAAS,OAAO;AACxB,OAAK,WAAW;AAChB,MAAI,SAAS,QACT;OAAI,QAAQ,UAAU,MAAM,OACxB,OAAM,IAAI,MAAM,iEAAiE;;AAGzF,OAAK,SAAS;;CAElB,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,UAAU;AACV,SAAO,KAAK;;;AAGpB,IAAa,eAAb,MAA0B;CACtB,OAAO,QAAQ,QAAW,QAAQ,GAAG,OAAO,OAAO,cAAc,eAAe,MAAM;EAClF,MAAM,UAAU,IAAI,OAAO;AAC3B,MAAI,SAAS,OACT,SAAQ,IAAI,MAAM,MAAM,CAAC,KAAK,KAAK;AAEvC,QAAM,QAAQ,SAAU,QAAM;AAC1B,WAAQ,KAAK,IAAI,OAAO;IAAE,MAAMC;IAAoB;IAAc,CAAC,CAAC;IACtE;AACF,SAAO,IAAI,KAAK,QAAQ;;;;;CAK5B,IAAI,OAAO;AACP,SAAO;;;;;CAKX,IAAI,OAAO;AACP,SAAO;;;;;CAKX,IAAI,OAAO;AACP,SAAO;;;;;;;AAOf,IAAa,eAAb,MAA0B;CACtB,YAAY,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW;AAC9D,OAAK,SAAS,IAAI,OAAO;GAAE,MAAM;GAAY;GAAM,CAAC;AACpD,OAAK,QAAQ,QAAQ,SAAY,KAAK;;CAE1C,IAAI,OAAO;AACP,SAAO,KAAK,OAAO;;CAEvB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK,OAAO;;CAEvB,OAAO,QAAQ,QAAW,QAAQ,GAAG,OAAO,OAAO,cAAc,eAAe,MAAM,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,OAAO;EAC9H,MAAM,UAAU,IAAI,OAAO;EAC3B,MAAM,QAAQ,IAAI,OAAO;AACzB,MAAI,SAAS,OACT,SAAQ,IAAI,MAAM,MAAM,CAAC,KAAK,KAAK;AAEvC,QAAM,SAAS,QAAM,QAAQ;GAGzB,MAAM,OAAO,KAAK,QAAQ,KACpB,KAAK,SAAS,GAAG,GACjB,KAAK,OAAO,KAAK,SAAS,GAAG,IAAI,OAAO,KAAK,SAAS,GAAG;AAC/D,WAAQ,KAAK,KAAK,OAAO,OAAOA,QAAM,cAAc,MAAM,KAAK,MAAM,KAAK,CAAC;AAC3E,SAAM,KAAK,KAAK;IAClB;AACF,SAAO,IAAI,KAAK,SAAS,MAAM;;;AAGvC,IAAa,WAAb,MAAsB;CAClB,YAAY,OAAO,MAAM,OAAO;AAC5B,UAAQ,MAAR;GACI,KAAK,MAAM;AACP,SAAK,QAAQ,KAAK;AAClB;GACJ,KAAK,MAAM;AACP,SAAK,QAAQ,KAAK;AAClB;GACJ,QACI,OAAM,IAAI,MAAM,oBAAoB,OAAO;;;CAGvD,KAAK,GAAG,MAAM;AACV,SAAO,KAAK,MAAM,GAAG,KAAK;;CAE9B,aAAa;AACT,SAAO,IAAI,cAAc;;CAE7B,WAAW,GAAG,MAAM;AAChB,SAAO,IAAI,aAAa,GAAG,KAAK;;;AAGxC,SAAgB,YAAY,UAAU,MAAM;AACxC,KAAI,SAAS,SAAS,GAClB,OAAM,IAAI,MAAM,2CAA2C;CAG/D,MAAM,SAAS,IAAI,OAAO,EAAE,MADf,OAAO,WAAW,MAAM,SAAS,UAAU,GAAG,GAAG,EACtB,CAAC,CAAC,OAAO,OAAO,cAAc,MAAM;CAC5E,MAAM,OAAO,OAAO;CACpB,MAAM,OAAO,OAAO,OAAO;CAC3B,IAAI;CACJ,MAAM,SAAS,QAAQ,SAAY,IAAI,OAAO,EAAE,MAAM,MAAM,CAAC,GAAG;AAChE,KAAI,QAAQ,OACR,QAAO,MAAM;KAGb,QAAO,MAAM;AAEjB,QAAO,IAAI,QAAQ;EAAQ;EAAY;EAAY;EAAc;EAAQ,CAAC;;;;;AAK9E,IAAa,UAAb,MAAqB;CACjB,YAAY,MAAM;EACd,IAAI,EAAE,IAAI,MAAM,MAAM,MAAM,MAAM,QAAQ,SAAS;AACnD,OAAK,MAAM,MAAM,SAAY,IAAI,QAAQ,GAAG;AAC5C,OAAK,QAAQ;AACb,OAAK,aAAa;AAClB,OAAK,aAAa;AAClB,SAAO,QAAQ,SAAY,SAAY;AACvC,SAAO,QAAQ,SAAY,IAAI;AAC/B,SAAO,QAAQ,SAAY,MAAM,QAAQ;EACzC,MAAM,OAAO,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO;AACpE,SAAO,QAAQ,SAAY,KAAK,MAAM;AACtC,MAAI,KAAK,QAAQ,OACb,MAAK,OAAO;AAEhB,MAAI,KAAK,QAAQ,OACb,MAAK,OAAO;AAEhB,MAAI,KAAK,QAAQ,OACb,MAAK,OAAO;AAEhB,MAAI,KAAK,QAAQ,OACb,MAAK,OAAO;AAEhB,MAAI,KAAK,QAAQ,OACb,MAAK,WAAW,MAAM,KAAK,MAAM;;CAGzC,IAAI,KAAK;AACL,SAAO,KAAK;;CAEhB,IAAI,YAAY;AACZ,SAAO,KAAK;;CAEhB,IAAI,YAAY;AACZ,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;;;;CAKhB,IAAI,OAAO;AACP,SAAO,KAAK,GAAG,QAAQ,OAAO;;CAElC,IAAI,OAAO;EACP,MAAM,OAAO,KAAK,GAAG,QAAQ,OAAO;AACpC,MAAI,QAAQ,OACR,QAAO,SAAS,MAAM,GAAG;;CAIjC,IAAI,KAAK,MAAM;AACX,OAAK,GAAG,QAAQ,QAAQ,KAAK,SAAS,GAAG,CAAC;;CAE9C,IAAI,OAAO;AACP,MAAI,KAAK,cAAc,OACnB,QAAO,KAAK;OAEX;GACD,MAAM,OAAO,KAAK,GAAG,QAAQ,OAAO;AACpC,UAAO,KAAK,WAAW,QAAQ,EAAE,KAAK,CAAC,CAAC;;;CAGhD,IAAI,KAAK,MAAM;AACX,MAAI,KAAK,cAAc,OACnB,MAAK,QAAQ;OAEZ;AACD,UAAO,KAAK,WAAW,QAAQ,EAAE,KAAK,CAAC,CAAC;AACxC,QAAK,GAAG,QAAQ,QAAQ,KAAK;;;CAGrC,IAAI,OAAO;AACP,SAAO,KAAK,GAAG,QAAQ,OAAO;;CAElC,IAAI,KAAK,MAAM;AACX,OAAK,GAAG,QAAQ,QAAQ,KAAK;;CAEjC,IAAI,OAAO;EAEP,MAAM,KADI,KAAK,GAAG,QAAQ,OAAO;AAEjC,SAAO,MAAM;;CAEjB,IAAI,KAAK,MAAM;AACX,OAAK,GAAG,QAAQ,QAAQ,KAAK;;CAEjC,WAAW,MAAM,MAAM;EACnB,IAAI;AACJ,MAAI,KAAK,QAAQ,QAAW;GACxB,MAAMC,SAAO,EAAE,KAAK,MAAM;AAC1B,OAAI,KAAK,SAAS,UAAa,GAAG,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,WAAWA,OAAK,EAC5G,OAAM,IAAI,MAAM;wEACwC,KAAK,KAAK,GAAG;;AAG7E,MAAI,QAAQ,MAAM,QAAQ,QACtB;OAAI,QAAQ,KAAK,MAAM;AACnB,SAAK,aAAa,IAAI,UAAU,EAAE,EAAE,EAAE,KAAK,CAAC;AAC5C,QAAI,QAAQ,UAAa,CAAC,KAAK,WAAW,WAAW,EAAE,KAAK,CAAC,CACzD,OAAM,IAAI,MAAM;mEAC+B,KAAK,GAAG;;aAI1D,KAAK,QAAQ,MAAM,MAExB,OAAM,IAAI,MAAM,kFAAkF;MAGlG,MAAK,aAAa;EAEtB,MAAM,OAAO,KAAK;AAClB,MAAI,QAAQ,OACR,MAAK,OAAO;AAEhB,MAAI,KAAK,cAAc,QAAW;AAC9B,QAAK,MAAM,CAAC,MAAM,SAAS,KAAK,GAAG,cAAc,CAC7C,KAAI,KAAK,QAAQ,QAAW;IACxB,MAAM,SAAS,KAAK,WAAW,QAAQ,EAAE,KAAK,KAAK,CAAC;AACpD,SAAK,OACD,KAAK,cAAc,SACb,OAAO,OACP,KAAK,WAAW,QAAQ,MAAM,OAAO;AAC/C,SAAK,GAAG,QAAQ,MAAM,KAAK;;AAGnC,QAAK,MAAM,CAAC,QAAQ,WAAW,KAAK,GAAG,aAAa,KAAK,WAAW,CAChE,MAAK,GAAG,QAAQ,QAAQ,QAAQ,KAAK,WAAW;;AAGxD,OAAK,GAAG,QAAQ,QAAQ,KAAK;AAC7B,OAAK,QAAQ;AAEb,OAAK,aACD,QAAQ,SAAY,IAAI,UAAU,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG;;CAEzD,OAAO,MAAM;EACT,IAAI,EAAE,SAAS,QAAW,SAAS,GAAG,QAAQ,OAAO,cAAc,SAAS,QAAW,SAAS,GAAG,QAAQ,OAAO,cAAc,QAAQ,OAAO,YAAY,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW,SAAS,MAAM,eAAe,MAAM,OAAO,UAAW;AACzR,MAAI,UAAU,QAAQ,OAClB,QAAO,KAAK;AAEhB,MAAI,UAAU,QAAQ,OAClB,QAAO,KAAK;AAEhB,MAAI,UAAU,QAAQ,OAClB,QAAO,KAAK;EAEhB,MAAM,OAAO,KAAK;EAClB,MAAM,OAAO;EACb,MAAM,OAAO;EACb,MAAM,UAAU,IAAI,SAAS,KAAK,CAAC,KAAK,MAAM,MAAM,KAAK;AACzD,MAAI,UAAU,QAAW;AACrB,OAAI,SAAS,EACT,OAAM,IAAI,MAAM,kBAAkB,OAAO,gBAAgB;AAE7D,YAAS,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM;;EAE1C,MAAM,QAAQ,QAAQ,OAAO,QAAQ,GAAG,OAAO,cAAc,cAAc,MAAM,MAAM,MAAM,KAAK;EAClG,MAAM,UAAU,MAAM,KAAK,MAAM,UAAU,WAAW,OAAO,OAAO;AACpE,MAAI,UAAU,QAAW;AACrB,OAAI,SAAS,EACT,OAAM,IAAI,MAAM,kBAAkB,OAAO,gBAAgB;AAE7D,YAAS,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM;;EAE1C,MAAM,QAAQ,QAAQ,OAAO,QAAQ,GAAG,OAAO,cAAc,cAAc,MAAM,OAAO,GAAG,OAAO,OAAO,QAAQ,KAAK;EACtH,MAAM,SAAS,MAAM,KAAK,MAAM,UAAU,WAAW,IAAI,MAAM,EAAE,MAAM,OAAO,EAAE,OAAO,OAAO,MAAM,CAAC;EACrG,MAAM,KAAK,IAAI,QAAQ;AACvB,KAAG,OAAO;AACV,KAAG,OAAO;AACV,KAAG,OACC,QAAQ,KAAK,UAAU,KAAK,KAAK,aAAa,SACxC,KACA,KAAK,UAAU,QAAQ,EAAE,QAAQ,KAAK,CAAC,CAAC;AAClD,KAAG,OAAO,QAAQ;AAClB,KAAG,OAAO,QAAQ;EAClB,MAAM,sBAAK,IAAI,MAAM,EAAC,UAAU;EAChC,MAAM,KAAK,IAAI,QAAQ;AACvB,KAAG,OAAO,MAAM,KAAK,UAAU,WAAW,OAAO,KAAK;AACtD,KAAG,OAAO;AACV,KAAG,OAAO;AACV,KAAG,KAAK;EACR,MAAM,KAAK,IAAI,QAAQ;AACvB,KAAG,OAAO,MAAM,KAAK,MAAM,UAAU,WAAW,OAAO,OAAO,KAAK;AACnE,KAAG,OAAO,OAAO;AACjB,KAAG,OAAO,OAAO,OAAO;AACxB,KAAG,KAAK;EACR,MAAM,KAAK,IAAI,QAAQ;AACvB,KAAG,MAAM;AACT,KAAG,MAAM;EACT,MAAM,MAAM,QAAQ,GAAG;AACvB,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,QAAQ,GAAG,MAAM,CACvC,OAAM,IAAI,MAAM,wBAAwB,IAAI,GAAG;AAEnD,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,GAAG,CACzB,OAAM,IAAI,MAAM,gCAAgC,IAAI,GAAG;AAE3D,OAAK,OAAO,OAAO;AACnB,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,GAAG,CACzB,OAAM,IAAI,MAAM,gCAAgC,IAAI,GAAG;AAE3D,MAAI,KAAK,aAAa,QAAW;AAE7B,SAAM,QAAQ,SAAS,WAAW;AAC9B,SAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,QAAQ,KAAK,UAAU;KAC7D;AACF,SAAM,QAAQ,SAAS,WAAW;AAC9B,SAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,QAAQ,KAAK,UAAU;KAC7D;aAEG,KAAK,cAAc,UACxB,MAAM,SAAS,UACf,MAAM,SAAS,QAAW;AAC1B,SAAM,MAAM,SAAS,MAAM,QAAQ;IAC/B,MAAM,SAAS,MAAM,QAAQ;IAC7B,MAAM,MAAM,IAAI,SAAS;AACzB,QAAI,OAAO;AACX,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO,GAAG;AACd,QAAI,OAAO;AACX,SAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,IAAI;KAC1C;AACF,SAAM,MAAM,SAAS,MAAM,QAAQ;IAC/B,MAAM,SAAS,MAAM,QAAQ;IAC7B,MAAM,MAAM,IAAI,SAAS;AACzB,QAAI,OAAO;AACX,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO,GAAG;AACd,QAAI,OAAO;AACX,SAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,IAAI;KAC1C;QAGF,OAAM,IAAI,MAAM,uDAAuD;EAE3E,MAAM,SAAS,IAAI,QAAQ;AAC3B,SAAO,OAAO,GAAG,IAAI;AACrB,OAAK,GAAG,QAAQ,MAAM,KAAK,KAAK,EAAE,OAAO;EACzC,MAAM,YAAY,IAAI,QAAQ;AAC9B,YAAU,OAAO,GAAG,IAAI;AACxB,OAAK,GAAG,QAAQ,MAAM,KAAK,OAAO,EAAE,EAAE,UAAU;AAChD,SAAO,CAAC,SAAS,OAAO;;CAE5B,KAAK,KAAK,KAAK;AACX,MAAI,OAAO,IACP;AAEJ,MAAI,KAAK,GAAG,QAAQ,IAAI,IAAI,OACxB,OAAM,IAAI,MAAM,uBAAuB,IAAI,sBAAsB;AAErE,MAAI,KAAK,GAAG,QAAQ,IAAI,IAAI,OACxB,OAAM,IAAI,MAAM,uBAAuB,IAAI,mBAAmB;EAElE,MAAM,SAAS,KAAK,GAAG,QAAQ,IAAI;AACnC,MAAI,UAAU,OACV,OAAM,IAAI,MAAM,+BAA+B,IAAI,oBAAoB;AAE3E,MAAI,KAAK,GAAG,QAAQ,IAAI,IAAI,OACxB,OAAM,IAAI,MAAM,+BAA+B,IAAI,mBAAmB;EAE1E,MAAM,SAAS,KAAK,GAAG,QAAQ,IAAI;AACnC,MAAI,UAAU,OACV,OAAM,IAAI,MAAM,+BAA+B,IAAI,oBAAoB;AAE3E,MAAI,KAAK,GAAG,QAAQ,IAAI,IAAI,OACxB,OAAM,IAAI,MAAM,+BAA+B,IAAI,mBAAmB;AAE1E,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,OAAO,CAC7B,OAAM,IAAI,MAAM,kCAAkC,IAAI,cAAc,IAAI,GAAG;MAG3E,MAAK,GAAG,QAAQ,IAAI;AAExB,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,OAAO,CAC7B,OAAM,IAAI,MAAM,kCAAkC,IAAI,cAAc,IAAI,GAAG;MAG3E,MAAK,GAAG,QAAQ,IAAI;EAExB,IAAI,IAAI;AACR,SAAO,MAAM;GACT,MAAM,KAAK,KAAK,GAAG,QAAQ,MAAM,KAAK,EAAE,CAAC;AACzC,OAAI,MAAM,OACN;AAEJ,OAAI,CAAC,KAAK,GAAG,QAAQ,MAAM,KAAK,EAAE,EAAE,GAAG,CACnC,OAAM,IAAI,MAAM,6BAA6B,IAAI,MAAM,EAAE,cAAc,MAAM;AAEjF,OAAI,IAAI;;AAEZ,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,EAAE,IAAI,CAAC,CAC7B,OAAM,IAAI,MAAM,2BAA2B,IAAI,cAAc,IAAI,GAAG;AAExE,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,EAAE,IAAI,CAAC,CAC7B,OAAM,IAAI,MAAM,2BAA2B,IAAI,GAAG;;CAG1D,OAAO,MAAM;EACT,IAAI,EAAE,KAAK,SAAS,QAAW,SAAS,GAAG,QAAQ,OAAO,cAAc,QAAQ,OAAO,YAAY,eAAe,MAAM,OAAO,OAAO,QAAQ,SAAU;EACxJ,MAAM,KAAK,KAAK,GAAG,QAAQ,IAAI;AAC/B,MAAI,MAAM,OACN,OAAM,IAAI,MAAM,qCAAqC,IAAI,GAAG;EAEhE,MAAM,KAAK,KAAK,GAAG,QAAQ,IAAI;AAC/B,MAAI,MAAM,OACN,OAAM,IAAI,MAAM,qCAAqC,IAAI,GAAG;AAEhE,MAAI,GAAG,IAAI,QAAQ,UAAa,GAAG,IAAI,KAAK,UAAU,EAClD,OAAM,IAAI,MAAM,yCAAyC,IAAI,GAAG;EAEpE,MAAM,MAAM,GAAG;AACf,KAAG,MAAM,GAAG;AACZ,KAAG,MAAM,GAAG;AACZ,MAAI,KAAK,QAAQ,UAAa,KAAK,aAAa,OAC5C,OAAM,IAAI,MAAM,2DAA2D;EAE/E,MAAM,UAAU,IAAI,OAAO;AAC3B,KAAG,IAAI,KAAK,SAAS,QAAQ;AACzB,OAAI,KAAK,aAAa,QAAW;IAC7B,MAAM,SAAS,KAAK,GAAG,QAAQ,KAAK,KAAK,UAAU;AACnD,QAAI,UAAU,OACV,OAAM,IAAI,MAAM,mCAAmC,MAAM;AAE7D,YAAQ,KAAK,OAAO,OAAO;SAI3B,SAAQ,KAAK,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC,CAAC;IAE7C;EACF,IAAI,OAAO,GAAG;AACd,MAAI,QAAQ,UAAa,QAAQ,IAAI;AAEjC,OAAI,KAAK,aAAa,OAClB,OAAM,IAAI,MAAM,qDAAqD;AAEzE,UAAO,KAAK,UAAU,QAAQ,EAAE,KAAK,CAAC,CAAC;QAGvC,QAAO,KAAK;EAEhB,MAAM,UAAU,IAAI,SAAS,GAAG,KAAK,CAAC,KAAK,MAAM,GAAG,MAAM,GAAG,KAAK;AAClE,MAAI,UAAU,QAAW;AACrB,OAAI,SAAS,EACT,OAAM,IAAI,MAAM,iBAAiB,OAAO,eAAe;AAE3D,YAAS,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM;;EAE1C,MAAM,OAAO,GAAG;EAChB,MAAM,OAAO,GAAG,IAAI,OAAO;EAC3B,MAAM,OAAO,GAAG,IAAI,OAAO,GAAG,IAAI,KAAK;EACvC,MAAM,OAAO,QAAQ,OAAO,QAAQ,GAAG,IAAI,cAAc,MAAM,MAAM,MAAM,KAAK;EAChF,MAAM,SAAS,MAAM,KAAK,KAAK,UAAU,WAAW,IAAI,MAAM,EAAE,MAAM,OAAO,EAAE,OAAO,OAAO,MAAM,CAAC;EACpG,MAAM,sBAAK,IAAI,MAAM,EAAC,UAAU;AAChC,KAAG,MAAM,IAAI,QAAQ;AACrB,KAAG,IAAI,OAAO,MAAM,KAAK,KAAK,UAAU,WAAW,OAAO,OAAO,KAAK;AACtE,KAAG,IAAI,OAAO;AACd,KAAG,IAAI,OAAO;AACd,KAAG,IAAI,KAAK;AACZ,MAAI,CAAC,KAAK,GAAG,QAAQ,KAAK,GAAG,CACzB,OAAM,IAAI,MAAM,sCAAsC,IAAI,GAAG;AAEjE,MAAI,KAAK,aAAa,OAElB,MAAK,QAAQ,SAAS,WAAW;AAC7B,QAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,QAAQ,KAAK,UAAU;IAC7D;WAEG,KAAK,cAAc,UAAa,KAAK,SAAS,OACnD,MAAK,MAAM,SAAS,MAAM,QAAQ;GAC9B,MAAM,SAAS,KAAK,QAAQ;GAC5B,MAAM,MAAM,IAAI,SAAS;AACzB,OAAI,OAAO;AACX,OAAI,OAAO,GAAG;AACd,OAAI,OAAO;AACX,QAAK,GAAG,QAAQ,OAAO,OAAO,MAAM,IAAI;IAC1C;MAGF,OAAM,IAAI,MAAM,uDAAuD;EAE3E,MAAM,QAAQ,IAAI,QAAQ;AAC1B,QAAM,OAAO,GAAG,IAAI;AACpB,OAAK,GAAG,QAAQ,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,MAAM;AAC/C,MAAI,MACA,KAAI,KAAK,SAAS,QAAQ;AACtB,QAAK,GAAG,QAAQ,IAAI;IACtB;AAEN,SAAO,CAAC,SAAS,OAAO;;CAE5B,KAAK,MAAM;EACP,MAAM,EAAE,KAAK,OAAO,QAAW,UAAU,QAAW,UAAU,MAAM,UAAU,QAAW,UAAU,WAAe;EAClH,MAAM,UAAU,IAAI,OAAO;AAC3B,MAAI,QAAQ,UAAa,WAAW,OAChC,OAAM,IAAI,MAAM,2BAA2B;AAE/C,MAAI,QAAQ,QAAW;AACnB,OAAI,KAAK,QAAQ,UAAa,KAAK,aAAa,OAC5C,OAAM,IAAI,MAAM,2DAA2D;AAE/E,QAAK,SAAS,QAAQ;AAElB,QAAI,KAAK,aAAa,QAAW;KAC7B,MAAM,SAAS,KAAK,GAAG,QAAQ,KAAK,KAAK,UAAU;AACnD,SAAI,UAAU,OACV,OAAM,IAAI,MAAM,mCAAmC,MAAM;AAE7D,aAAQ,KAAK,OAAO;WAEnB;KACD,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC;KACxC,MAAM,MAAM,KAAK,GAAG,QAAQ,IAAI;AAChC,SAAI,OAAO,OACP,OAAM,IAAI,MAAM,mCAAmC,MAAM;KAE7D,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;AAC9C,aAAQ,KAAK,OAAO,OAAO,IAAI,MAAM,OAAO,cAAc,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,CAAC;;KAE9F;QAGF,SAAQ,SAAS,WAAW;AACxB,OAAI,KAAK,aAAa,QAAW;IAC7B,MAAM,SAAS,KAAK,GAAG,QAAQ,OAAO,MAAM,KAAK,UAAU;AAC3D,QAAI,UAAU,OACV,OAAM,IAAI,MAAM,mCAAmC,OAAO,OAAO;AAErE,YAAQ,KAAK,OAAO;UAEnB;IACD,MAAM,MAAM,KAAK,GAAG,QAAQ,OAAO,KAAK;AACxC,QAAI,OAAO,OACP,OAAM,IAAI,MAAM,mCAAmC,OAAO,OAAO;IAErE,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;AAC9C,YAAQ,KAAK,OAAO,OAAO,IAAI,MAAM,OAAO,cAAc,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,CAAC;;IAE9F;AAEN,MAAI,WAAW,UAAa,QAAQ,UAAU,QAAQ,OAClD,OAAM,IAAI,MAAM,2BAA2B,QAAQ,OAAO,gCAAgC,QAAQ,SAAS;AAE/G,MAAI,WAAW,UAAa,QAAQ,UAAU,QAAQ,OAClD,OAAM,IAAI,MAAM,2BAA2B,QAAQ,OAAO,gCAAgC,QAAQ,SAAS;AAE/G,MAAI,SAAS;GACT,MAAM,SAAS,IAAI,OAAO;AAC1B,WAAQ,SAAS,QAAQ,QAAQ;IAC7B,IAAI;AACJ,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAI,IAAI,EACJ,OAAM,IAAI,MAAM,2BAA2B,EAAE,qBAAqB;UAItE,KAAI;IAER,IAAI;AACJ,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAI,KAAK,EACL,OAAM,IAAI,MAAM,mEAAmE;UAIvF,KAAI;IAER,MAAM,OAAO,KAAK;AAClB,WAAO,KAAK,OAAO,KAAK,KAAK,GAAG,MAAM,EAAE,CAAC;KAC3C;AACF,UAAO;SAEN;GACD,MAAM,SAAS,IAAI,OAAO;AAC1B,WAAQ,SAAS,WAAW;AACxB,WAAO,KAAK,OAAO,KAAK,IAAI,CAAC;KAC/B;AACF,UAAO;;;;AAInB,SAAgB,MAAM,KAAK,MAAM;AAC7B,QAAO,MAAM,MAAM,KAAK,SAAS,GAAG,CAAC,SAAS,IAAI,IAAI;;;;;;;AAO1D,IAAM,SAAN,MAAa;CACT,cAAc;AACV,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,wBAAQ,IAAI,KAAK;;CAE1B,QAAQ,KAAK;AACT,SAAO,KAAK,MAAM,IAAI,IAAI;;CAE9B,QAAQ,KAAK,KAAK;AACd,OAAK,MAAM,IAAI,KAAK,IAAI;;CAE5B,eAAe;EACX,MAAM,MAAM,IAAI,OAAO;AACvB,OAAK,MAAM,SAAS,OAAO,QAAQ;AAC/B,OAAI,KAAK,CAAC,KAAK,MAAM,CAAC;IACxB;AACF,SAAO;;CAEX,QAAQ,MAAM;AACV,SAAO,KAAK,MAAM,IAAI,KAAK;;CAE/B,QAAQ,MAAM,MAAM;AAChB,OAAK,MAAM,IAAI,MAAM,KAAK;;CAE9B,QAAQ,MAAM,MAAM;AAChB,MAAI,KAAK,MAAM,IAAI,KAAK,CACpB,QAAO;AAEX,OAAK,MAAM,IAAI,MAAM,KAAK;AAC1B,SAAO;;CAEX,QAAQ,MAAM;AACV,SAAO,KAAK,MAAM,OAAO,KAAK;;CAElC,aAAa,WAAW;EACpB,MAAM,MAAM,IAAI,OAAO;AACvB,OAAK,MAAM,QAAQ,SAAU,KAAK,QAAQ;GACtC,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,QAAQ,CAAC;GAC3C,MAAM,SAAS,UAAU,QAAQ,KAAK,MAAM,OAAO,aAAa;AAChE,OAAI,KAAK,CAAC,QAAQ,OAAO,CAAC;IAC5B;AACF,SAAO;;CAEX,QAAQ,QAAQ,QAAQ,WAAW;EAC/B,MAAM,SAAS,UAAU,QAAQ,MAAM,OAAO;AAC9C,OAAK,MAAM,IAAI,QAAQ,OAAO,MAAM;;CAExC,QAAQ,QAAQ,QAAQ,WAAW;AAC/B,MAAI,KAAK,MAAM,IAAI,OAAO,CACtB,QAAO;EAEX,MAAM,SAAS,UAAU,QAAQ,MAAM,OAAO;AAC9C,OAAK,MAAM,IAAI,QAAQ,OAAO,MAAM;AACpC,SAAO;;CAEX,QAAQ,QAAQ,WAAW;EACvB,MAAM,MAAM,KAAK,MAAM,IAAI,OAAO;AAClC,MAAI,OAAO,OACP;EAEJ,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,QAAQ,CAAC;AAC3C,SAAO,UAAU,QAAQ,KAAK,MAAM,OAAO,aAAa;;CAE5D,QAAQ,QAAQ,KAAK;AACjB,OAAK,MAAM,IAAI,QAAQ,IAAI;AAC3B,SAAO;;CAEX,QAAQ,QAAQ,KAAK;AACjB,MAAI,KAAK,MAAM,IAAI,OAAO,CACtB,QAAO;AAEX,OAAK,MAAM,IAAI,QAAQ,IAAI;AAC3B,SAAO;;CAEX,QAAQ,QAAQ;AACZ,SAAO,KAAK,MAAM,IAAI,OAAO;;CAEjC,QAAQ,QAAQ;AACZ,OAAK,MAAM,OAAO,OAAO;;CAE7B,QAAQ,KAAK;AACT,SAAO,KAAK,MAAM,IAAI,IAAI;;CAE9B,QAAQ,KAAK,KAAK;AACd,OAAK,MAAM,IAAI,KAAK,IAAI;AACxB,SAAO;;CAEX,QAAQ,KAAK,KAAK;AACd,MAAI,KAAK,MAAM,IAAI,IAAI,CACnB,QAAO;AAEX,OAAK,MAAM,IAAI,KAAK,IAAI;AACxB,SAAO;;CAEX,QAAQ,MAAM;AACV,SAAO,KAAK,MAAM,IAAI,KAAK;;CAE/B,QAAQ,KAAK,KAAK;AACd,MAAI,KAAK,MAAM,IAAI,IAAI,CACnB,QAAO;AAEX,OAAK,MAAM,IAAI,KAAK,IAAI;AACxB,SAAO;;CAEX,QAAQ,KAAK,KAAK;AACd,OAAK,MAAM,IAAI,KAAK,IAAI;AACxB,SAAO;;CAEX,QAAQ,MAAM;AACV,SAAO,KAAK,MAAM,OAAO,KAAK;;CAElC,QAAQ,MAAM;AACV,SAAO,KAAK,MAAM,IAAI,KAAK;;CAE/B,QAAQ,MAAM,MAAM;AAChB,MAAI,KAAK,MAAM,IAAI,KAAK,CACpB,QAAO;AAEX,OAAK,MAAM,IAAI,MAAM,KAAK;AAC1B,SAAO;;;;;;;CC72Bf,SAAS,WAAW;AAClB,SAAO,OAAO,UAAU,WAAW,OAAO,SAAS,OAAO,OAAO,MAAM,GAAG,SAAU,GAAG;AACrF,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;IACzC,IAAI,IAAI,UAAU;AAClB,SAAK,IAAI,KAAK,EAAG,EAAC,EAAE,EAAE,eAAe,KAAK,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE;;AAE/D,UAAO;KACN,OAAO,QAAQ,aAAa,MAAM,OAAO,QAAQ,aAAa,OAAO,SAAS,SAAS,MAAM,MAAM,UAAU;;AAElH,QAAO,UAAU,UAAU,OAAO,QAAQ,aAAa,MAAM,OAAO,QAAQ,aAAa,OAAO;;;;;ACThG,IAAW,iBAAiB;CAG1B,SAAS;CAET,QAAQ;CAER,QAAQ;CAER,WAAW;CAKX,aAAa;CAGb,YAAY;CACb;;;;ACJD,SAAgB,SAAS,GAAG;AAC1B,QAAO,OAAO,MAAM;;AAEtB,SAAgB,YAAY,GAAG;AAC7B,KAAI,CAAC,KAAK,OAAO,MAAM,YAAY,OAAO,EAAE,gBAAgB,WAC1D,QAAO;AAET,KAAI,EAAE,gBAAgB,QAAQ,OAAO,EAAE,YAAY,cAAc,YAAY,EAAE,YAAY,UAAU,gBAAgB,KACnH,QAAO;AAET,KAAI,OAAO,EAAE,YAAY,cAAc,cAAc,EAAE,YAAY,UAAU,EAAE,KAAK,KAClF,QAAO;AAET,QAAO;;AAET,SAAgB,UAAU,GAAG;AAC3B,QAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,EAAE,CAAC,cAAc,QAAQ;;AAEtF,SAAgB,WAAW,GAAG;AAC5B,QAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,EAAE,CAAC,eAAe,QAAQ;;AAEvF,SAAgB,OAAO,GAAG;AACxB,QAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEzD,SAAgB,SAAS,GAAG;AAC1B,QAAO,OAAO,MAAM;;AAEtB,IAAW,UAAU,MAAM;AAC3B,SAAgB,SAAS,GAAG;AAC1B,QAAO,KAAK,EAAE,YAAY,UAAU,aAAa,QAAQ;;;;;;;AAQ3D,SAAgB,aAAa,GAAG;AAC9B,QAAO,MAAM,QAAQ,EAAE,IAAI,SAAS,EAAE;;AAExC,SAAgB,cAAc,GAAG;AAC/B,QAAO,KAAK,EAAE,iBAAiB,EAAE,YAAY,UAAU,aAAa,QAAQ;;AAE9E,SAAgB,eAAe,GAAG;AAChC,QAAO,KAAK,EAAE,kBAAkB,EAAE,YAAY,UAAU,aAAa,QAAQ;;AAE/E,SAAgB,QAAQ,GAAG;AACzB,QAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;;AAE1D,SAAgB,QAAQ,GAAG;AACzB,QAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;;AAE1D,SAAgB,UAAU,GAAG;AAC3B,QAAO,OAAO,MAAM;;AAEtB,SAAgB,YAAY,GAAG;AAC7B,QAAO,KAAK,EAAE,YAAY,UAAU,gBAAgB,QAAQ;;AAE9D,SAAgB,OAAO,GAAG;AACxB,QAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEzD,SAAgB,WAAW,GAAG;AAC5B,QAAO,OAAO,MAAM;;AAEtB,SAAgB,OAAO,GAAG;AACxB,QAAO,aAAa;;AAEtB,SAAgB,SAAS,GAAG;AAC1B,QAAO,aAAa;;AAEtB,SAAgB,SAAS,GAAG;AAC1B,QAAO,CAAC,EAAE,KAAK,OAAO,MAAM,YAAY,EAAE,gBAAgB,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,EAAE;;AAErG,SAAgB,OAAO,GAAG;AACxB,QAAO,MAAM;;AAEf,SAAgB,YAAY,GAAG;AAC7B,QAAO,MAAM;;AAEf,SAAgB,eAAe,GAAG;AAChC,QAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEtF,SAAgB,YAAY,GAAG;AAC7B,QAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEnF,SAAgB,iBAAiB,GAAG;AAClC,QAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAExF,SAAgB,YAAY,GAAG;AAC7B,QAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEnF,SAAgB,kBAAkB,GAAG;AACnC,QAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEzF,SAAgB,eAAe,GAAG;AAChC,QAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAgBtF,SAAgB,yBAAyB,GAAG;AAC1C,QAAO,KAAK,EAAE,6BAA6B,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEhG,SAAgB,eAAe,GAAG;AAChC,QAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEtF,SAAgB,YAAY,GAAG;AAC7B,QAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEnF,SAAgB,OAAO,GAAG;AACxB,QAAO,KAAK,EAAE,WAAW,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAE9E,SAAgB,aAAa,GAAG;AAC9B,QAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEpF,SAAgB,eAAe,GAAG;AAChC,QAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEtF,SAAgB,kBAAkB,GAAG;AACnC,QAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEzF,SAAgB,YAAY,GAAG;AAC7B,QAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEnF,SAAgB,iBAAiB,GAAG;AAClC,QAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAExF,SAAgB,aAAa,GAAG;AAC9B,QAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;;AAEpF,SAAgB,QAAQ,GAAG;AACzB,QAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;;AAE1D,SAAgB,OAAO,GAAG;CACxB,IAAI,IAAI,OAAO;AACf,KAAI,MAAM,UAAU;AAClB,MAAI,MAAM,KAAM,QAAO;AACvB,MAAI,YAAY,EAAE,CAAE,QAAO;AAC3B,MAAI,EAAE,eAAe,EAAE,YAAY,KAAM,QAAO,EAAE,YAAY;AAC9D,SAAO;;AAET,QAAO;;;;;;;;;;;;;;;;ACzJT,SAAgBC,QAAM,GAAG;CACvB,IAAI,OAAO,OAAO;AAGlB,KAAI,SAAS,YAAY,SAAS,YAAY,SAAS,aAAa,MAAM,QAAQ,MAAM,OACtF,QAAO;AAIT,KAAI,OAAO,EAAE,UAAU,WACrB,QAAO,EAAE,OAAO;AAIlB,KAAI,MAAM,QAAQ,EAAE,CAClB,QAAO,EAAE,IAAI,SAAU,OAAO;AAC5B,SAAOA,QAAM,MAAM;GACnB;AAEJ,KAAI,aAAa,KAAM,QAAO,IAAI,KAAK,EAAE,SAAS,CAAC;AACnD,KAAI,YAAY,EAAE,CAAE,QAAO;AAG3B,KAAI,SAAS,EAAE,CACb,QAAO,UAAU,GAAGA,QAAM;AAE5B,OAAM,IAAI,UAAU,+CAA+C,OAAO,GAAG,IAAI,CAAC;;;;;;;;AASpF,SAAgB,UAAU,QAAQ,UAAU;CAC1C,IAAIA,UAAQ,EAAE;AACd,MAAK,IAAI,OAAO,OACd,KAAI,eAAe,QAAQ,IAAI,CAC7B,SAAM,OAAO,SAAS,OAAO,KAAK;AAGtC,QAAOA;;;;;;;;AAST,SAAgB,OAAO,GAAG,KAAG;AAC3B,MAAK,IAAI,QAAQC,IACf,KAAI,eAAeA,KAAG,KAAK,CACzB,GAAE,QAAQA,IAAE;AAGhB,QAAO;;;;;;;;;AA4CT,SAAgB,gBAAgB,GAAG,KAAG;CACpC,IAAI,MAAM,GAAG;AACb,KAAI,MAAM,QAAQ,EAAE,EAAE;AACpB,MAAI,CAAC,MAAM,QAAQA,IAAE,CACnB,QAAO;AAET,MAAI,EAAE,WAAWA,IAAE,OACjB,QAAO;AAET,OAAK,IAAI,GAAG,MAAM,EAAE,QAAQ,IAAI,KAAK,IACnC,KAAI,CAAC,gBAAgB,EAAE,IAAIA,IAAE,GAAG,CAC9B,QAAO;AAGX,SAAO;YACE,OAAO,MAAM,WACtB,QAAO,MAAMA;UACJ,aAAa,QAAQ;AAC9B,MAAI,MAAM,QAAQA,IAAE,IAAI,EAAEA,eAAa,QACrC,QAAO;AAET,OAAK,QAAQ,EAEX,KAAI,EAAE,QAAQA,QAAM,CAAC,gBAAgB,EAAE,OAAOA,IAAE,MAAM,CACpD,QAAO;AAGX,OAAK,QAAQA,IAEX,KAAI,EAAE,QAAQ,GACZ,QAAO;AAGX,SAAO;OAEP,QAAO,MAAMA;;;;;;;AA0GjB,SAAgB,eAAe,QAAQ,UAAU;AAC/C,QAAO,UAAU,OAAO,eAAe,KAAK,QAAQ,SAAS;;;;;;;;;AAoG/D,SAAgB,YAAY,QAAQ,YAAY;CAC9C,IAAI,OAAO,EAAE;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,IAAI,MAAM,WAAW;EACrB,IAAI,QAAQ,OAAO;AACnB,MAAI,UAAU,OACZ,MAAK,OAAO;;AAGhB,QAAO;;;;;AC3WT,IAAW,iBAAiB,CAAC,UAAU,QAAQ;AAC/C,IAAW,iBAAiB;CAAC;CAAU;CAAa;CAAW;;;;;ACE/D,IAAWC,WAAS,SAASA,SAAO,SAAS;AAC3C,KAAI,QACF,OAAM,IAAI,MAAM,sPAAwR;AAE1S,QAAO,OAAO,OAAO,eAAe;;4BAE7BA,UAAQ,gBAAgB;CAC/B;CACA;CACD,CAAC;;;;;ACdF,EAAC,SAAU,QAAQ,WAAS;AAC1B,SAAO,YAAY,YAAY,OAAO,WAAW,cAAc,OAAO,UAAUC,WAAS,GACzF,OAAO,WAAW,cAAc,OAAO,MAAM,OAAOA,UAAQ,IAC3D,SAAS,OAAO,eAAe,cAAc,aAAa,UAAU,MAAM,OAAO,QAAQA,WAAS;cAC3F,WAAY;AAAE;EAEtB,SAAS,KAAK;AACZ,UAAO;;EAET,SAAS,QAAQ;AACf,UAAO;;EAET,SAAS,QAAQ;EAGjB,MAAM,qBAAqB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA0C3B,SAAS,SAAS;;;;GAMhB,SAASC,gBAAc,GAAG;AACxB,WAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,EAAE,gBAAgB;;GAElE,MAAM,SAAS;IAAC;KACd,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,OAAO,MAAM;;KAEvB;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,OAAO,MAAM;;KAEvB;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,OAAO,MAAM;;KAEvB;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,OAAO,MAAM;;KAEvB;IAAE;KACD,MAAM;KACN,MAAM,MAAM;KACb;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,aAAa;;KAEvB;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,aAAa;;KAEvB;IAAE;KACD,MAAM;KACN,MAAMA;KACP;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,MAAM;;KAEhB;IAAE;KACD,MAAM;KACN,MAAM,SAAU,GAAG;AACjB,aAAO,MAAM;;KAEhB;IAAC;GACF,MAAM,UAAU;IACd,MAAM;IACN,MAAM;IACN,OAAO;IACR;GAOD,IAAI;GACJ,IAAI;GAGJ,IAAI,eAAe;GAInB,IAAIC,UAAQ,EACV,aAAa,GACd;;;;;;;;GASD,SAAS,SAAS,UAAU;IAC1B,MAAM,OAAO,QAAQ,IAAI,SAAS;AAClC,QAAI,KACF,QAAO;IAGT,IAAI,UAAU,oBAAmB,WAAW;IAC5C,MAAMC,UAAO,SAAS,aAAa;IACnC,IAAI;AACJ,SAAK,aAAa,SAChB,KAAI,UAAU,aAAa,KAAKA,SAAM;AACpC,gBAAW,sBAAqB,YAAY;AAC5C;;AAGJ,UAAM,IAAI,UAAU,QAAQ;;;;;;;;;;;;;;;GAgB9B,SAAS,SAAS,OAAO;IACvB,IAAI,aAAa,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;IACrF,MAAM,cAAc,aAAa,SAAS,WAAW,CAAC,QAAQ,SAAS;IACvE,MAAM,WAAW,EAAE;AACnB,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;AACrC,SAAI,CAAC,MAAM,MAAM,OAAO,MAAM,GAAG,SAAS,YAAY,OAAO,MAAM,GAAG,SAAS,WAC7E,OAAM,IAAI,UAAU,iEAAiE;KAEvF,MAAM,WAAW,MAAM,GAAG;AAC1B,SAAI,QAAQ,IAAI,SAAS,CACvB,OAAM,IAAI,UAAU,2BAA0B,WAAW,KAAI;AAE/D,cAAS,KAAK,SAAS;AACvB,aAAQ,IAAI,UAAU;MACpB,MAAM;MACN,MAAM,MAAM,GAAG;MACf,OAAO,MAAM,GAAG;MAChB,OAAO,cAAc;MACrB,eAAe,EAAE;MAClB,CAAC;;IAGJ,MAAM,gBAAgB,SAAS,MAAM,YAAY;AACjD,eAAW,SAAS,MAAM,GAAG,YAAY,CAAC,OAAO,SAAS,CAAC,OAAO,cAAc;AAEhF,SAAK,IAAI,IAAI,cAAc,SAAS,QAAQ,IAAI,SAAS,QAAQ,EAAE,EACjE,SAAQ,IAAI,SAAS,GAAG,CAAC,QAAQ;;;;;;;;GAUrC,SAAS,QAAQ;AACf,8BAAU,IAAI,KAAK;AACnB,eAAW,EAAE;AACb,mBAAe;AACf,aAAS,CAAC,QAAQ,EAAE,MAAM;;AAI5B,UAAO;AACP,YAAS,OAAO;;;;GAKhB,SAAS,mBAAmB;IAC1B,IAAI;AACJ,SAAK,YAAY,SACf,SAAQ,IAAI,SAAS,CAAC,gBAAgB,EAAE;AAE1C,mBAAe;;;;;;;;GASjB,SAAS,cAAc,OAAO;IAC5B,MAAM,UAAU,SAAS,QAAO,YAAQ;KACtC,MAAM,OAAO,QAAQ,IAAIA,QAAK;AAC9B,YAAO,CAAC,KAAK,SAAS,KAAK,KAAK,MAAM;MACtC;AACF,QAAI,QAAQ,OACV,QAAO;AAET,WAAO,CAAC,MAAM;;;;;;;GAQhB,SAAS,gBAAgB,QAAQ;AAC/B,WAAO,UAAU,OAAO,WAAW,cAAc,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqC3E,SAAS,cAAc,IAAI,aAAW,SAAS;AAC7C,QAAI,CAAC,gBAAgB,GAAG,CACtB,OAAM,IAAI,UAAU,mBAAmB;IAIzC,MAAM,QAAQ,WAAW,QAAQ;IAEjC,MAAM,SAAS,eADS,MAAM,QAAQC,YAAU,GAAGA,YAAU,KAAK,IAAI,GAAGA,YAC3B;IAC9C,MAAM,qBAAqB,gBAAgB,OAAO;AAGlD,QAAI,CAAC,SAAS,sBAAsB,GAAG,YAAY;KAEjD,MAAM,QAAQ,GAAG,mBAAmB,aAAa,IAAI,mBAAmB;AACxE,SAAI,MACF,QAAO;;IAQX,MAAM,UAAU,OAAO;IACvB,IAAI;AACJ,QAAI,OAAO;AACT,2BAAsB,EAAE;KACxB,IAAID;AACJ,UAAKA,WAAQ,GAAG,WACd,qBAAoB,KAAK,GAAG,mBAAmB,aAAa,IAAIA,QAAK,CAAC;UAGxE,uBAAsB,GAAG,mBAAmB;AAE9C,SAAK,IAAI,IAAI,GAAG,IAAI,SAAS,EAAE,GAAG;KAChC,MAAM,OAAO,OAAO;KACpB,MAAM,qBAAqB,EAAE;KAC7B,IAAI;AACJ,UAAK,eAAe,qBAAqB;MACvC,MAAM,OAAO,gBAAgB,YAAY,QAAQ,EAAE;AACnD,UAAI,CAAC,QAAQ,KAAK,aAAa,CAAC,KAAK,UACnC;AAEF,UAAI,CAAC,KAAK,QAAQ;OAEhB,MAAM,YAAY,aAAa,KAAK;AACpC,WAAI,KAAK,MAAM,MAAK,UAAS,CAAC,UAAU,IAAI,MAAM,KAAK,CAAC,CACtD;;AAIJ,yBAAmB,KAAK,YAAY;;AAEtC,2BAAsB;AACtB,SAAI,oBAAoB,WAAW,EAAG;;IAGxC,IAAI;AACJ,SAAK,aAAa,oBAChB,KAAI,UAAU,OAAO,UAAU,QAC7B,QAAO;AAGX,UAAM,IAAI,UAAU,sCAAsC,GAAG,QAAQ,aAAa,MAAM,gBAAgB,QAAQ,KAAK,GAAG,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6B/H,SAAS,KAAK,IAAI,aAAW,SAAS;AACpC,WAAO,cAAc,IAAIC,aAAW,QAAQ,CAAC;;;;;;;;GAS/C,SAAS,QAAQ,OAAO,UAAU;IAEhC,MAAM,OAAO,SAAS,SAAS;AAC/B,QAAI,KAAK,KAAK,MAAM,CAClB,QAAO;IAET,MAAM,cAAc,KAAK;AACzB,QAAI,YAAY,WAAW,EACzB,OAAM,IAAI,MAAM,iCAAiC,WAAW,YAAY;AAE1E,SAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,IAEtC,KADiB,SAAS,YAAY,GAAG,KAAK,CACjC,KAAK,MAAM,CACtB,QAAO,YAAY,GAAG,QAAQ,MAAM;AAGxC,UAAM,IAAI,MAAM,oBAAoB,QAAQ,SAAS,SAAS;;;;;;;;GAShE,SAAS,gBAAgB,QAAQ;IAC/B,IAAI,YAAY,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AACpF,WAAO,OAAO,KAAI,MAAK,EAAE,KAAK,CAAC,KAAK,UAAU;;;;;;;GAQhD,SAAS,WAAW,OAAO;IACzB,MAAM,YAAY,MAAM,QAAQ,MAAM,KAAK;IAE3C,MAAM,YADQ,CAAC,YAAY,QAAQ,MAAM,SAAS,IAAI,MAAM,MAAM,EAAE,GAAG,OAChD,MAAM,IAAI,CAAC,KAAI,MAAK,SAAS,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,SAAS;IACb,IAAI,YAAY,YAAY,QAAQ;AAapC,WAAO;KACL,OAbiB,SAAS,IAAI,SAAU,MAAM;AAC9C,eAAS,KAAK,SAAS;AACvB,mBAAa,KAAK,OAAO;AACzB,aAAO;OACL,MAAM,KAAK;OACX,WAAW,KAAK;OAChB,MAAM,KAAK;OACX,OAAO,KAAK;OACZ,YAAY;OACZ,iBAAiB;OAClB;OACD;KAGA,MAAM,UAAU,MAAM,GAAG,GAAG;KAE5B;KACA,eAAe;KACf;KACD;;;;;;;;GASH,SAAS,YAAY,OAAO;IAE1B,MAAM,sBAAsB,qBADV,MAAM,MAAM,KAAI,MAAK,EAAE,KAAK,CACa;IAC3D,IAAI,SAAS,MAAM;IACnB,IAAI,UAAU,MAAM;IACpB,MAAM,mBAAmB,oBAAoB,IAAI,SAAU,YAAY;KACrE,MAAM,OAAO,SAAS,WAAW,KAAK;AACtC,cAAS,KAAK,SAAS;AACvB,gBAAW,MAAM,WAAW;AAC5B,YAAO;MACL,MAAM,WAAW;MACjB,WAAW,KAAK;MAChB,MAAM,KAAK;MACX,OAAO,KAAK;MACZ;MACA,iBAAiB,WAAW;MAC7B;MACD;AACF,WAAO;KACL,OAAO,MAAM,MAAM,OAAO,iBAAiB;KAC3C,MAAM;KACN;KACA,eAAe,iBAAiB,SAAS;KACzC,WAAW,MAAM;KAClB;;;;;;;;;GAUH,SAAS,aAAa,OAAO;AAC3B,QAAI,CAAC,MAAM,SAAS;AAClB,WAAM,0BAAU,IAAI,KAAK;AACzB,WAAM,MAAM,SAAQ,SAAQ,MAAM,QAAQ,IAAI,KAAK,KAAK,CAAC;;AAE3D,WAAO,MAAM;;;;;;;;;GAUf,SAAS,eAAe,cAAc;IACpC,MAAM,SAAS,EAAE;AACjB,QAAI,OAAO,iBAAiB,SAC1B,OAAM,IAAI,UAAU,6BAA6B;IAEnD,MAAMA,cAAY,aAAa,MAAM;AACrC,QAAIA,gBAAc,GAChB,QAAO;IAET,MAAM,YAAYA,YAAU,MAAM,IAAI;AACtC,SAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,EAAE,GAAG;KACzC,MAAM,cAAc,WAAW,UAAU,GAAG,MAAM,CAAC;AACnD,SAAI,YAAY,aAAa,MAAM,UAAU,SAAS,EACpD,OAAM,IAAI,YAAY,iCAAgC,UAAU,KAAK,0CAA8C;AAGrH,SAAI,YAAY,MAAM,WAAW,EAC/B,QAAO;AAET,YAAO,KAAK,YAAY;;AAE1B,WAAO;;;;;;;GAQT,SAAS,aAAa,QAAQ;IAC5B,MAAM,QAAQ,KAAK,OAAO;AAC1B,WAAO,QAAQ,MAAM,YAAY;;;;;;;;GASnC,SAAS,YAAY,OAAO;AAC1B,QAAI,CAAC,SAAS,MAAM,MAAM,WAAW,EAEnC,QAAO;aACE,MAAM,MAAM,WAAW,EAChC,QAAO,SAAS,MAAM,MAAM,GAAG,KAAK,CAAC;aAC5B,MAAM,MAAM,WAAW,GAAG;KACnC,MAAM,QAAQ,SAAS,MAAM,MAAM,GAAG,KAAK,CAAC;KAC5C,MAAM,QAAQ,SAAS,MAAM,MAAM,GAAG,KAAK,CAAC;AAC5C,YAAO,SAAS,GAAG,GAAG;AACpB,aAAO,MAAM,EAAE,IAAI,MAAM,EAAE;;WAExB;KAEL,MAAM,QAAQ,MAAM,MAAM,IAAI,SAAU,MAAM;AAC5C,aAAO,SAAS,KAAK,KAAK,CAAC;OAC3B;AACF,YAAO,SAAS,GAAG,GAAG;AACpB,WAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,KAAI,MAAM,GAAG,EAAE,CACb,QAAO;AAGX,aAAO;;;;;;;;;GAUb,SAAS,aAAa,QAAQ;IAC5B,IAAI,OAAO,OAAO;AAClB,QAAI,aAAa,OAAO,EAAE;AAExB,aAAQ,QAAQ,OAAO,CAAC,IAAI,YAAY;KACxC,MAAM,WAAW,MAAM;KACvB,MAAM,WAAW,YAAY,KAAK,OAAO,CAAC;KAC1C,MAAM,gBAAgB,SAAU,MAAM;AACpC,WAAK,IAAI,IAAI,UAAU,IAAI,KAAK,QAAQ,IACtC,KAAI,CAAC,SAAS,KAAK,GAAG,CACpB,QAAO;AAGX,aAAO;;AAET,YAAO,SAAS,SAAS,MAAM;AAC7B,WAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,KAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CACpB,QAAO;AAGX,aAAO,cAAc,KAAK,IAAI,KAAK,UAAU,WAAW;;eAItD,OAAO,WAAW,EACpB,QAAO,SAAS,SAAS,MAAM;AAC7B,YAAO,KAAK,WAAW;;aAEhB,OAAO,WAAW,GAAG;AAC9B,aAAQ,YAAY,OAAO,GAAG;AAC9B,YAAO,SAAS,SAAS,MAAM;AAC7B,aAAO,MAAM,KAAK,GAAG,IAAI,KAAK,WAAW;;eAElC,OAAO,WAAW,GAAG;AAC9B,aAAQ,YAAY,OAAO,GAAG;AAC9B,aAAQ,YAAY,OAAO,GAAG;AAC9B,YAAO,SAAS,SAAS,MAAM;AAC7B,aAAO,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,GAAG,IAAI,KAAK,WAAW;;WAExD;AAEL,aAAQ,OAAO,IAAI,YAAY;AAC/B,YAAO,SAAS,SAAS,MAAM;AAC7B,WAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,KAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CACpB,QAAO;AAGX,aAAO,KAAK,WAAW,MAAM;;;;;;;;;;;;GAcrC,SAAS,gBAAgB,QAAQ,OAAO;AACtC,WAAO,QAAQ,OAAO,SAAS,OAAO,SAAS,aAAa,OAAO,GAAG,KAAK,OAAO,GAAG;;;;;;;;GASvF,SAAS,kBAAkB,QAAQ,OAAO;IACxC,MAAM,QAAQ,gBAAgB,QAAQ,MAAM;AAC5C,QAAI,CAAC,MACH,wBAAO,IAAI,KAAK;AAElB,WAAO,aAAa,MAAM;;;;;;;GAQ5B,SAAS,YAAY,MAAM;AACzB,WAAO,KAAK,eAAe,QAAQ,KAAK,eAAe;;;;;;;;;GAUzD,SAAS,oBAAoB,YAAY,OAAO;IAC9C,MAAM,0BAAU,IAAI,KAAK;AACzB,eAAW,SAAQ,gBAAa;KAC9B,MAAM,WAAW,kBAAkBA,YAAU,QAAQ,MAAM;KAC3D,IAAID;AACJ,UAAKA,WAAQ,SACX,SAAQ,IAAIA,QAAK;MAEnB;AACF,WAAO,QAAQ,IAAI,MAAM,GAAG,CAAC,MAAM,GAAG,MAAM,KAAK,QAAQ;;;;;;;;;;GAW3D,SAAS,YAAY,SAAM,MAAM,YAAY;IAC3C,IAAI,KAAK;IACT,MAAM,QAAQA,WAAQ;IAGtB,IAAI,qBAAqB;IACzB,IAAI;AACJ,SAAK,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;KAC5C,MAAM,mBAAmB,EAAE;AAC3B,wBAAmB,SAAQ,gBAAa;MAEtC,MAAM,OAAO,YADC,gBAAgBC,YAAU,QAAQ,MAAM,CACvB;AAC/B,WAAK,QAAQA,YAAU,OAAO,UAAU,aAAaA,YAAU,OAAO,KAAK,KAAK,KAAK,OAAO,CAC1F,kBAAiB,KAAKA,YAAU;OAElC;AACF,SAAI,iBAAiB,WAAW,GAAG;AAEjC,iBAAW,oBAAoB,oBAAoB,MAAM;AACzD,UAAI,SAAS,SAAS,GAAG;OACvB,MAAM,cAAc,cAAc,KAAK,OAAO;AAC9C,6BAAM,IAAI,UAAU,6CAA6C,QAAQ,iBAAiB,SAAS,KAAK,OAAO,GAAG,eAAe,YAAY,KAAK,MAAM,GAAG,cAAc,QAAQ,IAAI;AACrL,WAAI,OAAO;QACT,UAAU;QACV,IAAI;QACJ;QACA,QAAQ;QACR;QACD;AACD,cAAO;;WAGT,sBAAqB;;IAKzB,MAAM,UAAU,mBAAmB,IAAI,SAAU,aAAW;AAC1D,YAAO,aAAaA,YAAU,OAAO,GAAG,WAAWA,YAAU,OAAO;MACpE;AACF,QAAI,KAAK,SAAS,KAAK,IAAI,MAAM,MAAM,QAAQ,EAAE;AAC/C,gBAAW,oBAAoB,oBAAoB,MAAM;AACzD,2BAAM,IAAI,UAAU,mCAAmC,QAAQ,iBAAiB,SAAS,KAAK,OAAO,GAAG,cAAc,KAAK,SAAS,IAAI;AACxI,SAAI,OAAO;MACT,UAAU;MACV,IAAI;MACJ,OAAO,KAAK;MACZ;MACD;AACD,YAAO;;IAIT,MAAM,YAAY,KAAK,IAAI,MAAM,MAAM,QAAQ;AAC/C,QAAI,KAAK,SAAS,WAAW;AAC3B,2BAAM,IAAI,UAAU,oCAAoC,QAAQ,iBAAiB,YAAY,eAAe,KAAK,SAAS,IAAI;AAC9H,SAAI,OAAO;MACT,UAAU;MACV,IAAI;MACJ,OAAO,KAAK;MACZ,gBAAgB;MACjB;AACD,YAAO;;IAIT,MAAM,WAAW,EAAE;AACnB,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EACjC,UAAS,KAAK,cAAc,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC;AAEjD,0BAAM,IAAI,UAAU,yBAAwB,SAAS,KAAK,KAAK,GAAG,+DAA8D,QAAQ,IAAI;AAC5I,QAAI,OAAO;KACT,UAAU;KACV,QAAQ;KACT;AACD,WAAO;;;;;;;GAQT,SAAS,mBAAmB,OAAO;IACjC,IAAIC,QAAM,SAAS,SAAS;AAC5B,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,QAAQ,IACtC,SAAM,KAAK,IAAIA,OAAK,MAAM,MAAM,GAAG,UAAU;AAE/C,WAAOA;;;;;;;;GAST,SAAS,yBAAyB,OAAO;IACvC,IAAIA,QAAM,eAAe;AACzB,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,QAAQ,IACtC,KAAI,CAAC,YAAY,MAAM,MAAM,GAAG,CAC9B,SAAM,KAAK,IAAIA,OAAK,MAAM,MAAM,GAAG,gBAAgB;AAGvD,WAAOA;;;;;;;;;;;;;;;;GAiBT,SAAS,cAAc,QAAQ,QAAQ;AAGrC,QAAI,OAAO,QACT;SAAI,CAAC,OAAO,OACV,QAAO;eAEA,OAAO,OAChB,QAAO;AAIT,QAAI,OAAO,WACT;SAAI,CAAC,OAAO,UACV,QAAO;eAEA,OAAO,UAChB,QAAO;IAIT,MAAM,WAAW,mBAAmB,OAAO,GAAG,mBAAmB,OAAO;AACxE,QAAI,WAAW,EACb,QAAO;AAET,QAAI,WAAW,EACb,QAAO;IAKT,MAAM,QAAQ,yBAAyB,OAAO;IAC9C,MAAM,QAAQ,yBAAyB,OAAO;AAC9C,QAAI,OAAO,eACT;SAAI,CAAC,OAAO,cACV,SAAQ,IAAI,SAAS;eAEd,OAAO,cAChB,QAAO,EAAE,IAAI,SAAS;IAIxB,MAAM,WAAW,QAAQ;AACzB,QAAI,WAAW,EACb,QAAO;AAET,QAAI,WAAW,EACb,QAAO;AAIT,WAAO;;;;;;;;;;;;;;;GAgBT,SAAS,kBAAkB,YAAY,YAAY;IACjD,MAAM,QAAQ,WAAW;IACzB,MAAM,QAAQ,WAAW;IACzB,MAAM,QAAQ,KAAK,MAAM;IACzB,MAAM,QAAQ,KAAK,MAAM;IACzB,MAAM,WAAW,aAAa,MAAM;IACpC,MAAM,WAAW,aAAa,MAAM;AAGpC,QAAI,YAAY,MAAM,QACpB;SAAI,CAAC,YAAY,CAAC,MAAM,OACtB,QAAO;eAEA,YAAY,MAAM,OAC3B,QAAO;IAIT,IAAI,OAAO;IACX,IAAI,QAAQ;IACZ,IAAI;AACJ,SAAK,OAAO,OAAO;AACjB,SAAI,IAAI,OAAQ,GAAE;AAClB,SAAI,IAAI,cAAe,GAAE;;IAE3B,IAAI,OAAO;IACX,IAAI,QAAQ;AACZ,SAAK,OAAO,OAAO;AACjB,SAAI,IAAI,OAAQ,GAAE;AAClB,SAAI,IAAI,cAAe,GAAE;;AAE3B,QAAI,SAAS,KACX,SAAQ,OAAO,QAAQ;AAIzB,QAAI,YAAY,MAAM,eACpB;SAAI,CAAC,YAAY,CAAC,MAAM,cACtB,QAAO;eAEA,YAAY,MAAM,cAC3B,QAAO;AAIT,QAAI,UAAU,MACZ,SAAQ,QAAQ,SAAS;AAI3B,QAAI,UACF;SAAI,CAAC,SACH,QAAO;eAEA,SACT,QAAO;IAIT,MAAM,mBAAmB,MAAM,SAAS,MAAM,WAAW,WAAW,OAAO;AAC3E,QAAI,oBAAoB,EACtB,QAAO;IAOT,MAAM,cAAc,EAAE;IACtB,IAAI,KAAK;AACT,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,GAAG;KACrC,MAAM,iBAAiB,cAAc,MAAM,IAAI,MAAM,GAAG;AACxD,iBAAY,KAAK,eAAe;AAChC,WAAM;;AAER,QAAI,OAAO,EACT,SAAQ,KAAK,IAAI,MAAM,MAAM;IAO/B,IAAI;IACJ,IAAI,QAAQ;IACZ,MAAM,YAAY,SAAS,YAAY,SAAS;AAChD,SAAK,KAAK,aAAa;AACrB,SAAI,MAAM,EACR,SAAQ,IAAI,IAAI,CAAC,QAAQ,SAAS;AAEpC,cAAS;;AAIX,WAAO;;;;;;;;;;GAWT,SAAS,qBAAqB,WAAW;AACvC,QAAI,UAAU,WAAW,EACvB,QAAO,EAAE;IAEX,MAAM,QAAQ,UAAU,IAAI,SAAS;AACrC,QAAI,UAAU,WAAW,EAAG,QAAO,MAAM,GAAG;IAK5C,MAAM,aAAa,IAAI,IAAI,UAAU;IACrC,MAAM,mCAAmB,IAAI,KAAK;AAClC,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,EAClC,MAAK,MAAM,SAAS,MAAM,GAAG,cAC3B,KAAI,CAAC,WAAW,IAAI,MAAM,KAAK,CAAE,kBAAiB,IAAI,MAAM,KAAK;IAKrE,MAAM,UAAU,EAAE;AAClB,SAAK,MAAM,YAAY,kBAAkB;KACvC,IAAI,YAAY,eAAe;KAC/B,IAAI,iBAAiB;AACrB,UAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,EAAE,EAClC,MAAK,MAAM,SAAS,MAAM,GAAG,cAC3B,KAAI,MAAM,SAAS,YAAY,MAAM,QAAQ,WAAW;AACtD,kBAAY,MAAM;AAClB,uBAAiB;;AAIvB,aAAQ,KAAK,eAAe;;AAE9B,WAAO;;;;;;;;;;;;GAaT,SAAS,yBAAyB,QAAQ,IAAI;IAC5C,IAAI,YAAY;IAIhB,IAAIF,UAAO;AACX,QAAI,OAAO,MAAK,MAAK,EAAE,cAAc,EAAE;KACrC,MAAM,YAAY,aAAa,OAAO;KACtC,MAAM,sBAAsB,OAAO,IAAI,qBAAqB;AAC5D,eAAO,oBAAoB,KAAI,SAAQ,KAAK,KAAK,CAAC,KAAK,IAAI;AAC3D,iBAAY,SAAS,cAAc;MACjC,MAAM,OAAO,EAAE;MACf,MAAMG,SAAO,YAAY,UAAU,SAAS,IAAI,UAAU;AAC1D,WAAK,IAAI,IAAI,GAAG,IAAIA,QAAM,IACxB,MAAK,KAAK,oBAAoB,GAAG,UAAU,GAAG;AAEhD,UAAI,UACF,MAAKA,UAAQ,UAAUA,QAAM,IAAI,oBAAoBA,QAAM;AAE7D,aAAO,GAAG,MAAM,MAAM,KAAK;;;IAG/B,IAAI,eAAe;AACnB,QAAI,aAAa,OAAO,EAAE;KACxB,MAAM,SAAS,OAAO,SAAS;AAC/B,oBAAe,SAAS,uBAAuB;AAC7C,aAAO,UAAU,MAAM,MAAM,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,WAAW,OAAO,CAAC,CAAC,CAAC;;;AAGhG,QAAIH,QAAM,QAAO,eAAe,cAAc,QAAQ,EACpD,OAAOA,SACR,CAAC;AACF,WAAO;;;;;;;;GAST,SAAS,qBAAqB,OAAO;IACnC,IAAI,OAAO,OAAO,aAAa;IAC/B,MAAM,QAAQ,EAAE;IAChB,MAAM,cAAc,EAAE;IACtB,IAAIA,UAAO;AACX,UAAM,MAAM,QAAQ,SAAU,MAAM;AAClC,SAAI,KAAK,YAAY;AACnB,iBAAQ,KAAK,WAAW,OAAO,OAAO,KAAK,WAAW,KAAK;AAC3D,YAAM,KAAK,SAAS,KAAK,WAAW,KAAK,CAAC,KAAK;AAC/C,kBAAY,KAAK,KAAK,WAAW,QAAQ;;MAE3C;AACF,QAAIA,QAAM,WAAOA,QAAK,MAAM,GAAG,GAAG;QAAM,WAAO;IAG/C,IAAI,aAAY,QAAO;AACvB,YAAQ,YAAY,QAApB;KACE,KAAK,EACH;KACF,KAAK;AACH,cAAQ,MAAM;AACd,oBAAc,YAAY;AAC1B,kBAAY,SAAS,WAAW,KAAK;AACnC,WAAI,MAAM,IAAI,CACZ,QAAO,YAAY,IAAI;AAEzB,cAAO;;AAET;KACF,KAAK;AACH,cAAQ,MAAM;AACd,cAAQ,MAAM;AACd,oBAAc,YAAY;AAC1B,oBAAc,YAAY;AAC1B,kBAAY,SAAS,WAAW,KAAK;AACnC,WAAI,MAAM,IAAI,CACZ,QAAO,YAAY,IAAI;AAEzB,WAAI,MAAM,IAAI,CACZ,QAAO,YAAY,IAAI;AAEzB,cAAO;;AAET;KACF,QACE,aAAY,SAAS,WAAW,KAAK;AACnC,WAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,IACtC,KAAI,MAAM,GAAG,IAAI,CACf,QAAO,YAAY,GAAG,IAAI;AAG9B,aAAO;;;AAGb,WAAO,eAAe,WAAW,QAAQ,EACvC,OAAOA,SACR,CAAC;AACF,WAAO;;;;;;;;;;;;;;;;;;;GAoBT,SAAS,YAAY,QAAQ;IAC3B,SAAS,aAAa,UAAQ,OAAO,aAAa;AAChD,SAAI,QAAQI,SAAO,QAAQ;MACzB,MAAM,QAAQA,SAAO;MACrB,IAAI,kBAAkB,EAAE;AACxB,UAAI,MAAM,WAAW;OAGnB,MAAM,aAAa,MAAM,MAAM,OAAO,YAAY;AAClD,WAAI,WAAW,SAAS,MAAM,MAAM,OAClC,iBAAgB,KAAK;QACnB,OAAO;QACP,MAAM,QAAQ,WAAW,KAAI,MAAK,EAAE,KAAK,CAAC,KAAK,IAAI;QACnD,QAAQ,WAAW,MAAK,MAAK,EAAE,MAAM;QACrC,eAAe;QACf,WAAW;QACZ,CAAC;AAEJ,uBAAgB,KAAK,MAAM;YAG3B,mBAAkB,MAAM,MAAM,IAAI,SAAU,MAAM;AAChD,cAAO;QACL,OAAO,CAAC,KAAK;QACb,MAAM,KAAK;QACX,QAAQ,KAAK;QACb,eAAe,KAAK;QACpB,WAAW;QACZ;QACD;AAIJ,aAAO,QAAQ,iBAAiB,SAAU,WAAW;AACnD,cAAO,aAAaA,UAAQ,QAAQ,GAAG,YAAY,OAAO,CAAC,UAAU,CAAC,CAAC;QACvE;WAGF,QAAO,CAAC,YAAY;;AAGxB,WAAO,aAAa,QAAQ,GAAG,EAAE,CAAC;;;;;;;;GASpC,SAAS,YAAY,SAAS,SAAS;IACrC,MAAM,KAAK,KAAK,IAAI,QAAQ,QAAQ,QAAQ,OAAO;AACnD,SAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;KAC3B,MAAM,WAAW,kBAAkB,SAAS,EAAE;KAC9C,MAAM,WAAW,kBAAkB,SAAS,EAAE;KAC9C,IAAI,UAAU;KACd,IAAIJ;AACJ,UAAKA,WAAQ,SACX,KAAI,SAAS,IAAIA,QAAK,EAAE;AACtB,gBAAU;AACV;;AAGJ,SAAI,CAAC,QACH,QAAO;;IAGX,MAAM,OAAO,QAAQ;IACrB,MAAM,OAAO,QAAQ;IACrB,MAAM,aAAa,aAAa,QAAQ;IACxC,MAAM,aAAa,aAAa,QAAQ;AACxC,WAAO,aAAa,aAAa,SAAS,OAAO,QAAQ,OAAO,aAAa,QAAQ,OAAO,SAAS;;;;;;;;;;GAWvG,SAAS,iBAAiB,cAAc;AACtC,WAAO,aAAa,KAAI,OAAM;AAC5B,SAAI,cAAc,GAAG,CACnB,QAAO,YAAY,GAAG,YAAY,SAAS;AAE7C,SAAI,UAAU,GAAG,CACf,QAAO,YAAY,GAAG,QAAQ,YAAY,GAAG,QAAQ,SAAS;AAEhE,YAAO;MACP;;;;;;;;;;;;;GAcJ,SAAS,mBAAmB,YAAY,cAAc,cAAc;IAClE,MAAM,qBAAqB,EAAE;IAC7B,IAAI;AACJ,SAAK,aAAa,YAAY;KAC5B,IAAI,aAAa,aAAa;AAC9B,SAAI,OAAO,eAAe,SACxB,OAAM,IAAI,UAAU,8CAA6C,YAAY,KAAI;AAEnF,kBAAa,aAAa;AAC1B,SAAI,OAAO,eAAe,WACxB,QAAO;AAET,wBAAmB,KAAK,WAAW;;AAErC,WAAO;;;;;;;;;;;;;GAcT,SAAS,kBAAkB,cAAc,cAAc,QAAM;IAC3D,MAAM,oBAAoB,iBAAiB,aAAa;IACxD,MAAM,aAAa,IAAI,MAAM,kBAAkB,OAAO,CAAC,KAAK,MAAM;IAClE,IAAI,iBAAiB;AACrB,WAAO,gBAAgB;AACrB,sBAAiB;KACjB,IAAI,kBAAkB;AACtB,UAAK,IAAI,IAAI,GAAG,IAAI,kBAAkB,QAAQ,EAAE,GAAG;AACjD,UAAI,WAAW,GAAI;MACnB,MAAM,KAAK,kBAAkB;AAC7B,UAAI,cAAc,GAAG,EAAE;AACrB,yBAAkB,KAAK,GAAG,YAAY,SAASK,OAAK;AAEpD,yBAAkB,GAAG,cAAc,GAAG;AACtC,kBAAW,KAAK;AAChB,yBAAkB;iBACT,UAAU,GAAG,EAAE;OACxB,MAAM,qBAAqB,mBAAmB,GAAG,QAAQ,YAAY,mBAAmB,aAAa;AACrG,WAAI,oBAAoB;AACtB,0BAAkB,KAAK,GAAG,QAAQ,SAAS,MAAM,MAAM,mBAAmB;AAE1E,0BAAkB,GAAG,UAAU,GAAG;AAClC,mBAAW,KAAK;AAChB,0BAAkB;aAElB,kBAAiB;;;AAIvB,SAAI,mBAAmB,eACrB,OAAM,IAAI,YAAY,yDAAyD;;AAGnF,WAAO;;;;;;;;;GAUT,SAAS,uBAAuB,eAAe;IAI7C,MAAM,sBAAsB;AAC5B,WAAO,KAAK,cAAc,CAAC,SAAQ,gBAAa;KAC9C,MAAM,KAAK,cAAcJ;AACzB,SAAI,oBAAoB,KAAK,GAAG,UAAU,CAAC,CACzC,OAAM,IAAI,YAAY,mIAA6I;MAErK;;;;;;;;;;;;GAaJ,SAAS,oBAAoB,SAAM,kBAAkB;AACnD,YAAM;AACN,QAAI,OAAO,KAAK,iBAAiB,CAAC,WAAW,EAC3C,OAAM,IAAI,YAAY,yBAAyB;AAEjD,QAAIF,QAAM,0BACR,wBAAuB,iBAAiB;IAI1C,MAAM,eAAe,EAAE;IACvB,MAAM,oBAAoB,EAAE;IAC5B,MAAM,gBAAgB,EAAE;IACxB,MAAM,wBAAwB,EAAE;IAChC,IAAIE;AACJ,SAAKA,eAAa,kBAAkB;AAElC,SAAI,CAAC,OAAO,UAAU,eAAe,KAAK,kBAAkBA,YAAU,CACpE;KAGF,MAAM,SAAS,eAAeA,YAAU;AACxC,SAAI,CAAC,OAAQ;AAEb,kBAAa,QAAQ,SAAU,IAAI;AACjC,UAAI,YAAY,IAAI,OAAO,CACzB,OAAM,IAAI,UAAU,8BAA6B,gBAAgB,GAAG,GAAG,cAAY,gBAAgB,OAAO,GAAG,MAAK;OAEpH;AACF,kBAAa,KAAK,OAAO;KAEzB,MAAM,gBAAgB,kBAAkB;AACxC,uBAAkB,KAAK,iBAAiBA,aAAW;KACnD,MAAM,mBAAmB,OAAO,IAAI,YAAY;KAEhD,IAAI;AACJ,UAAK,MAAM,YAAY,iBAAiB,EAAE;MACxC,MAAM,SAAS,gBAAgB,GAAG;AAClC,4BAAsB,KAAK;OACzB,QAAQ;OACR,MAAM;OACN,IAAI;OACL,CAAC;AACF,UAAI,GAAG,OAAM,MAAK,CAAC,EAAE,cAAc,CACjC,eAAc,UAAU;;;AAI9B,0BAAsB,KAAK,kBAAkB;IAG7C,MAAM,oBAAoB,kBAAkB,mBAAmB,eAAe,WAAW;IAGzF,IAAI;AACJ,SAAK,KAAK,cACR,KAAI,OAAO,UAAU,eAAe,KAAK,eAAe,EAAE,CACxD,eAAc,KAAK,kBAAkB,cAAc;IAGvD,MAAM,aAAa,EAAE;IACrB,MAAM,uCAAuB,IAAI,KAAK;AACtC,SAAK,KAAK,sBAIR,KAAI,CAAC,qBAAqB,IAAI,EAAE,KAAK,EAAE;AACrC,OAAE,KAAK,kBAAkB,EAAE;AAC3B,gBAAW,KAAK,EAAE;AAClB,0BAAqB,IAAI,EAAE,MAAM,EAAE;;IAKvC,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,MAAM,WAAW,MAAM,WAAW,GAAG,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,GAAG,OAAO;IACpG,MAAM,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO;AAGjD,SAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,EAAE,EACvC,YAAW,GAAG,OAAO,aAAa,WAAW,GAAG,OAAO;IAEzD,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;IAC5D,MAAM,SAAS,MAAM,YAAY,WAAW,GAAG,OAAO,GAAG,GAAG;AAG5D,SAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,EAAE,EACvC,YAAW,GAAG,iBAAiB,yBAAyB,WAAW,GAAG,QAAQ,WAAW,GAAG,GAAG;IAEjG,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,MAAM,MAAM,WAAW,GAAG,iBAAiB;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IACjD,MAAM,OAAO,MAAM,WAAW,GAAG,OAAO,SAAS;IAGjD,MAAM,SAAS,QAAQ,IAAI;IAC3B,MAAM,OAAO,WAAW;IAExB,MAAM,QAAQ,WAAW,KAAI,QAAKK,IAAE,KAAK;IACzC,MAAM,MAAM,WAAW,KAAI,QAAKA,IAAE,eAAe;IACjD,MAAM,UAAU,SAASC,YAAU;AAEjC,UAAK,IAAI,IAAI,QAAQ,IAAI,MAAM,IAC7B,KAAI,MAAM,GAAG,UAAU,CACrB,QAAO,IAAI,GAAG,MAAM,MAAM,UAAU;AAGxC,YAAOR,QAAM,WAAWC,SAAM,WAAW,WAAW;;IAKtD,SAAS,WAAW,MAAM,MAAM;AAE9B,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,SAAI,UAAU,WAAW,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK,CAC3D,QAAO,IAAI,MAAM,MAAM,UAAU;AAEnC,YAAO,QAAQ,MAAM,MAAM,UAAU;;AAIvC,QAAI;AACF,YAAO,eAAe,YAAY,QAAQ,EACxC,OAAOA,SACR,CAAC;aACK,KAAK;AASd,eAAW,aAAa;AAIxB,eAAW,qBAAqB;KAC9B;KACA,cAAc;KACf;AACD,WAAO;;;;;;;;GAST,SAAS,YAAY,SAAM,MAAM,YAAY;AAC3C,UAAM,YAAYA,SAAM,MAAM,WAAW;;;;;;;GAQ3C,SAAS,QAAQ,KAAK;AACpB,WAAO,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE;;;;;;;GAQtC,SAAS,KAAK,KAAK;AACjB,WAAO,IAAI,IAAI,SAAS;;;;;;;;;GAU1B,SAAS,MAAM,KAAK,OAAO,KAAK;AAC9B,WAAO,MAAM,UAAU,MAAM,KAAK,KAAK,OAAO,IAAI;;;;;;;;;GAUpD,SAAS,YAAY,KAAK,MAAM;AAC9B,SAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,KAAK,IAAI,GAAG,CACd,QAAO,IAAI;;;;;;;;;GAajB,SAAS,QAAQ,KAAK,UAAU;AAC9B,WAAO,MAAM,UAAU,OAAO,MAAM,EAAE,EAAE,IAAI,IAAI,SAAS,CAAC;;;;;;;;;;;;;GAc5D,SAAS,UAAU;IACjB,MAAM,aAAa,QAAQ,UAAU,CAAC,KAAI,MAAK,gBAAgB,eAAe,EAAE,CAAC,CAAC;IAClF,MAAM,WAAW,KAAK,UAAU;AAChC,QAAI,OAAO,aAAa,WACtB,OAAM,IAAI,UAAU,8CAA8C;AAEpE,WAAO,YAAY,YAAY,SAAS;;GAE1C,SAAS,YAAY,YAAY,UAAU;AACzC,WAAO,EACL,SAAS;KACP;KACA;KACD,EACF;;;;;;;;GASH,SAAS,YAAY,UAAU;AAC7B,QAAI,OAAO,aAAa,WACtB,OAAM,IAAI,UAAU,+CAA+C;AAErE,WAAO,EACL,aAAa,EACX,UACD,EACF;;;;;;;;;GAUH,SAAS,UAAU,YAAY;AAC7B,WAAO,cAAc,OAAO,WAAW,YAAY,YAAY,MAAM,QAAQ,WAAW,QAAQ,WAAW,IAAI,OAAO,WAAW,QAAQ,aAAa;;;;;;;;;GAUxJ,SAAS,cAAc,YAAY;AACjC,WAAO,cAAc,OAAO,WAAW,gBAAgB,YAAY,OAAO,WAAW,YAAY,aAAa;;;;;;;;;;GAWhH,SAAS,UAAU,WAAW,SAAS;AACrC,QAAI,CAAC,UACH,QAAO;AAET,QAAI,WAAW,YAAY,WAAW;KACpC,MAAM,sBAAM,IAAI,MAAM,4CAA4C,YAAY,eAAe,UAAU,IAAI;AAC3G,SAAI,OAAO;MACT,QAAQ;MACR,UAAU;MACX;AACD,WAAM;;AAER,WAAO;;;;;;;;GAST,SAAS,cAAc,KAAK;IAC1B,IAAIA;AACJ,SAAK,MAAM,OAAO,IAGhB,KAAI,OAAO,UAAU,eAAe,KAAK,KAAK,IAAI,KAAK,gBAAgB,IAAI,KAAK,IAAI,OAAO,IAAI,KAAK,cAAc,UAChH,WAAO,UAAUA,SAAM,IAAI,KAAK,KAAK;AAGzC,WAAOA;;;;;;;;;GAUT,SAAS,gBAAgB,MAAM,QAAQ;IACrC,IAAI;AACJ,SAAK,OAAO,OACV,KAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,IAAI,EAAE;AACrD,SAAI,OAAO,MACT;UAAI,OAAO,SAAS,KAAK,MAAM;OAC7B,MAAM,sBAAM,IAAI,MAAM,iBAAgB,MAAM,sBAAqB;AACjE,WAAI,OAAO;QACT,WAAW;QACX,gBAAgB,OAAO;QACvB,cAAc,KAAK;QACpB;AACD,aAAM;;;AAIV,UAAK,OAAO,OAAO;;;GAIzB,MAAM,YAAYD;;;;;;;;;;;;;;;;;;;;;;;AAwBlB,aAAQ,SAAU,WAAW;IAC3B,MAAM,QAAQ,OAAO,cAAc;IACnC,MAAM,QAAQ,QAAQ,IAAI;IAC1B,IAAIC,UAAO,QAAQ,YAAY;IAC/B,MAAM,gBAAgB,EAAE;AACxB,SAAK,IAAI,IAAI,OAAO,IAAI,UAAU,QAAQ,EAAE,GAAG;KAC7C,MAAM,OAAO,UAAU;KACvB,IAAI,kBAAkB,EAAE;KACxB,IAAI;AACJ,SAAI,OAAO,SAAS,YAAY;AAC9B,iBAAW,KAAK;AAChB,UAAI,OAAO,KAAK,cAAc,SAE5B,iBAAgB,KAAK,aAAa;eACzB,gBAAgB,KAAK,CAE9B,mBAAkB,KAAK;gBAEhBF,gBAAc,KAAK,EAAE;AAE9B,wBAAkB;AAClB,UAAI,CAAC,MACH,YAAW,cAAc,KAAK;;AAGlC,SAAI,OAAO,KAAK,gBAAgB,CAAC,WAAW,GAAG;MAC7C,MAAM,sBAAM,IAAI,UAAU,kCAAoC,IAAI,6FAAkG;AACpK,UAAI,OAAO;OACT,OAAO;OACP,UAAU;OACX;AACD,YAAM;;AAER,SAAI,CAAC,MACH,WAAO,UAAUE,SAAM,SAAS;AAElC,qBAAgB,eAAe,gBAAgB;;AAEjD,WAAO,oBAAoBA,WAAQ,IAAI,cAAc;;AAEvD,WAAM,SAAS;AACf,WAAM,cAAc,UAAU;AAC9B,WAAM,aAAa;AACnB,WAAM,qBAAqB;AAC3B,WAAM,cAAc;AACpB,WAAM,QAAQ;AACd,WAAM,mBAAmB;AACzB,WAAM,WAAW;AACjB,WAAM,YAAY;AAClB,WAAM,UAAU;AAChB,WAAM,cAAc;AACpB,WAAM,UAAU;AAChB,WAAM,gBAAgB;AACtB,WAAM,OAAO;AACb,WAAM,kBAAkB;AACxB,WAAM,4BAA4B;;;;;;;;;AAUlC,WAAM,UAAU,SAAU,MAAM,kBAAkB;IAChD,IAAI,SAAS;AACb,QAAI,qBAAqB,SAAS,QAAQ,IAAI,SAAS,CACrD,UAAS;AAEX,YAAM,SAAS,CAAC,KAAK,EAAE,OAAO;;;;;;;;;GAUhC,SAAS,oBAAoB,YAAY;AACvC,QAAI,CAAC,cAAc,OAAO,WAAW,SAAS,YAAY,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,YAAY,WAC3H,OAAM,IAAI,UAAU,gFAAgF;AAEtG,QAAI,WAAW,OAAO,WAAW,KAC/B,OAAM,IAAI,YAAY,yCAAwC,WAAW,OAAO,gBAAe;;;;;;;;;;AAYnG,WAAM,gBAAgB,SAAU,YAAY;IAC1C,IAAI,UAAU,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK,EAChF,UAAU,OACX;AACD,wBAAoB,WAAW;IAC/B,MAAM,KAAK,SAAS,WAAW,GAAG;IAClC,MAAM,WAAW,GAAG,cAAc,MAAK,UAAS,MAAM,SAAS,WAAW,KAAK;AAC/E,QAAI,SACF,KAAI,WAAW,QAAQ,SACrB,SAAM,iBAAiB;KACrB,MAAM,SAAS;KACf,IAAI,WAAW;KACf,SAAS,SAAS;KACnB,CAAC;QAEF,OAAM,IAAI,MAAM,0CAAyC,WAAW,OAAO,aAAW,GAAG,OAAO,KAAI;AAGxG,OAAG,cAAc,KAAK;KACpB,MAAM,WAAW;KACjB,IAAI,GAAG;KACP,SAAS,WAAW;KACpB,OAAO;KACR,CAAC;;;;;;;;;;AAWJ,WAAM,iBAAiB,SAAU,aAAa,SAAS;AACrD,gBAAY,SAAQ,eAAcD,QAAM,cAAc,YAAY,QAAQ,CAAC;;;;;;;;;;;AAY7E,WAAM,mBAAmB,SAAU,YAAY;AAC7C,wBAAoB,WAAW;IAC/B,MAAM,KAAK,SAAS,WAAW,GAAG;IAClC,MAAM,qBAAqB,YAAY,GAAG,gBAAe,MAAK,EAAE,SAAS,WAAW,KAAK;AACzF,QAAI,CAAC,mBACH,OAAM,IAAI,MAAM,mDAAmD,WAAW,OAAO,SAAS,WAAW,GAAG;AAE9G,QAAI,mBAAmB,YAAY,WAAW,QAC5C,OAAM,IAAI,MAAM,0DAA0D;IAE5E,MAAM,QAAQ,GAAG,cAAc,QAAQ,mBAAmB;AAC1D,OAAG,cAAc,OAAO,OAAO,EAAE;;;;;;;;;;;;AAanC,WAAM,UAAU,SAAU,IAAI,SAAS;AACrC,QAAI,CAAC,gBAAgB,GAAG,CACtB,OAAM,IAAI,UAAU,mBAAmB;IAEzC,MAAM,OAAO,GAAG,mBAAmB;AACnC,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,EACjC,KAAI,KAAK,GAAG,KAAK,QAAQ,CACvB,QAAO,KAAK;AAGhB,WAAO;;AAET,UAAOA;;AAIT,SAFoB,QAAQ;IAI3B;;;;;;;;;;;;;ACr5DH,SAAgBS,YAAU,OAAO;AAC/B,KAAI,OAAO,UAAU,UACnB,QAAO;AAET,QAAO,SAAS,MAAM,GAAG,UAAU,KAAK,MAAM,MAAM,GAAG;;;;;;;AAQzD,IAAWC,SAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,KAAI,IAAI,EACN,QAAO;UACE,IAAI,EACb,QAAO;KAEP,QAAO;;;;;;;AASX,IAAWC,SAAO,KAAK,QAAQ,SAASA,OAAK,GAAG;AAC9C,QAAO,KAAK,IAAI,EAAE,GAAG,KAAK;;;;;;;AAQ5B,IAAWC,UAAQ,KAAK,SAAS,SAASA,QAAM,GAAG;AACjD,QAAO,KAAK,IAAI,EAAE,GAAG,KAAK;;;;;;;AAQ5B,IAAW,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,QAAO,KAAK,IAAI,IAAI,EAAE;;;;;;;;;;;AAYxB,IAAWC,SAAO,KAAK,QAAQ,SAASA,OAAK,GAAG;AAC9C,KAAI,MAAM,EACR,QAAO;CAET,IAAI,SAAS,IAAI;CACjB,IAAI;AACJ,KAAI,OACF,KAAI,CAAC;AAEP,KAAI,SAAS,EAAE,EAAE;AACf,WAAS,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE;AAElC,YAAU,KAAK,SAAS,UAAU,IAAI,UAAU;OAEhD,UAAS;AAEX,QAAO,SAAS,CAAC,SAAS;;;;;;;AAQ5B,IAAW,QAAQ,KAAK,SAAS,SAASC,QAAM,GAAG;AACjD,QAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;;;;;;;;;AAUjF,SAAS,mBAAmB,GAAG,MAAM,MAAM;CAMzC,IAAI,SALW;EACb,GAAG;EACH,GAAG;EACH,IAAI;EACL,CACqB;CACtB,IAAI,SAAS;AACb,KAAI,MAAM;AACR,MAAI,OAAO,EACT,OAAM,IAAI,MAAM,iCAAiC;AAEnD,MAAI,CAACL,YAAU,KAAK,CAClB,OAAM,IAAI,MAAM,0BAA0B;AAE5C,MAAI,IAAI,MAAM,OAAO,KAAK,KAAK,IAAI,EAAE,MAAM,OAAO,IAChD,OAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG,OAAO,CAAC,OAAO,OAAO,GAAG,MAAM,CAAC;AAEjG,MAAI,CAACA,YAAU,EAAE,CACf,OAAM,IAAI,MAAM,2BAA2B;AAE7C,MAAI,IAAI,EACN,KAAI,IAAI,KAAK;AAEf,WAAS,IAAI,OAAO,KAAK;;CAE3B,IAAIC,SAAO;AACX,KAAI,IAAI,GAAG;AACT,MAAI,CAAC;AACL,WAAO;;AAET,QAAO,GAAG,OAAOA,OAAK,CAAC,OAAO,OAAO,CAAC,OAAO,EAAE,SAAS,KAAK,CAAC,CAAC,OAAO,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuF/E,SAAgBK,SAAO,OAAO,SAAS;AACrC,KAAI,OAAO,YAAY,WAErB,QAAO,QAAQ,MAAM;AAIvB,KAAI,UAAU,SACZ,QAAO;UACE,UAAU,UACnB,QAAO;UACE,MAAM,MAAM,CACrB,QAAO;CAET,IAAI,EACF,UACA,WACA,aACE,uBAAuB,QAAQ;AAGnC,SAAQ,UAAR;EACE,KAAK,QACH,QAAOC,UAAQ,OAAO,UAAU;EAClC,KAAK,cACH,QAAOC,gBAAc,OAAO,UAAU;EACxC,KAAK,cACH,QAAOC,gBAAc,OAAO,UAAU;EACxC,KAAK,MACH,QAAO,mBAAmB,OAAO,GAAG,SAAS;EAC/C,KAAK,MACH,QAAO,mBAAmB,OAAO,GAAG,SAAS;EAC/C,KAAK,MACH,QAAO,mBAAmB,OAAO,IAAI,SAAS;EAChD,KAAK,OAEH,QAAO,YAAY,OAAO,WAAW,QAAQ,CAAC,QAAQ,uBAAuB,WAAY;GACvF,IAAIC,WAAS,UAAU;GACvB,IAAI,IAAI,UAAU;AAClB,UAAOA,aAAW,MAAMA,WAAS,IAAI;IACrC;EACJ,QACE,OAAM,IAAI,MAAM,wBAAuB,WAAW,+EAAwE;;;;;;;;;;;AAYhI,SAAgB,uBAAuB,SAAS;CAE9C,IAAI,WAAW;CACf,IAAI;CACJ,IAAI;AACJ,KAAI,YAAY,OACd,KAAI,SAAS,QAAQ,CACnB,aAAY;UACH,YAAY,QAAQ,CAC7B,aAAY,QAAQ,UAAU;UACrB,SAAS,QAAQ,EAAE;AAC5B,MAAI,QAAQ,cAAc,OACxB,aAAY,iBAAiB,QAAQ,iBAAiB;AACpD,SAAM,IAAI,MAAM,qDAAmD;IACnE;AAEJ,MAAI,QAAQ,aAAa,OACvB,YAAW,iBAAiB,QAAQ,gBAAgB;AAClD,SAAM,IAAI,MAAM,oDAAkD;IAClE;AAEJ,MAAI,QAAQ,SACV,YAAW,QAAQ;OAGrB,OAAM,IAAI,MAAM,qEAAqE;AAGzF,QAAO;EACL;EACA;EACA;EACD;;;;;;;;AASH,SAAgB,YAAY,OAAO;CAEjC,IAAI,QAAQ,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,kCAAkC;AAChF,KAAI,CAAC,MACH,OAAM,IAAI,YAAY,oBAAoB,MAAM;CAElD,IAAIT,SAAO,MAAM;CACjB,IAAIS,WAAS,MAAM;CACnB,IAAI,WAAW,WAAW,MAAM,MAAM,IAAI;CAC1C,IAAI,MAAMA,SAAO,QAAQ,IAAI;AAC7B,aAAY,QAAQ,KAAK,MAAM,IAAIA,SAAO,SAAS;CACnD,IAAI,eAAeA,SAAO,QAAQ,KAAK,GAAG,CACzC,QAAQ,OAAO,SAAU,SAAO;AAE/B,cAAYC,QAAM;AAClB,SAAO;GACP,CAAC,QAAQ,OAAO,GAAG,CACpB,MAAM,GAAG,CAAC,IAAI,SAAU,KAAG;AAC1B,SAAO,SAASC,IAAE;GAClB;AACF,KAAI,aAAa,WAAW,GAAG;AAC7B,eAAa,KAAK,EAAE;AACpB;;AAEF,QAAO;EACL;EACA;EACA;EACD;;;;;;;AAQH,SAAgBH,gBAAc,OAAO,WAAW;AAC9C,KAAI,MAAM,MAAM,IAAI,CAAC,SAAS,MAAM,CAClC,QAAO,OAAO,MAAM;CAGtB,IAAI,UAAU,YADF,YAAY,MAAM,EACG,UAAU;CAC3C,IAAI,IAAI,QAAQ;CAChB,IAAI,IAAI,QAAQ;CAGhB,IAAI,SAAS,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAC/D,KAAI,SAAS,UAAU,CAErB,QAAO,YAAY,EAAE,UAAU,IAAI,SAAS,IAAI,EAAE,OAChD,GAAE,KAAK,EAAE;MAEN;EAGL,IAAI,eAAe,KAAK,IAAI,IAAI,OAAO,IAAI,EAAE,SAAS;AACtD,OAAK,IAAI,IAAI,GAAG,IAAI,cAAc,IAChC,GAAE,KAAK,EAAE;;CAKb,IAAI,UAAU,KAAK,IAAI,IAAI,OAAO;CAClC,IAAI,aAAa;AAGjB,QAAO,UAAU,GAAG;AAClB;AACA;;CAKF,IAAI,WAAW,EAAE,MAAM,WAAW,CAAC,KAAK,GAAG;CAC3C,IAAI,aAAa,SAAS,UAAU,IAAI,SAAS,UAAU,SAAS,MAAM,QAAQ,GAAG,MAAM,WAAW;CACtG,IAAI,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,KAAK,GAAG,GAAG,aAAa,OAAO,KAAK,IAAI,MAAM,MAAM,OAAO,UAAU;AACtG,QAAO,QAAQ,OAAO;;;;;;;;AASxB,SAAgBF,UAAQ,OAAO,WAAW;AACxC,KAAI,MAAM,MAAM,IAAI,CAAC,SAAS,MAAM,CAClC,QAAO,OAAO,MAAM;CAEtB,IAAI,aAAa,YAAY,MAAM;CACnC,IAAI,UAAU,OAAO,cAAc,WAAW,YAAY,YAAY,WAAW,WAAW,IAAI,UAAU,GAAG;CAC7G,IAAI,IAAI,QAAQ;CAChB,IAAI,IAAI,QAAQ,WAAW;CAG3B,IAAI,KAAK,KAAK,aAAa;AAC3B,KAAI,EAAE,SAAS,GACb,KAAI,EAAE,OAAO,MAAM,KAAK,EAAE,OAAO,CAAC;AAIpC,KAAI,IAAI,GAAG;AACT,MAAI,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE;AAC3B,MAAI;;AAIN,KAAI,IAAI,EAAE,OACR,GAAE,OAAO,GAAG,GAAG,MAAM,IAAI,OAAO,IAAI;AAEtC,QAAO,QAAQ,OAAO,EAAE,KAAK,GAAG;;;;;;;;;AAUlC,SAAgBC,gBAAc,OAAO,WAAW;AAC9C,KAAI,MAAM,MAAM,IAAI,CAAC,SAAS,MAAM,CAClC,QAAO,OAAO,MAAM;CAItB,IAAI,QAAQ,YAAY,MAAM;CAC9B,IAAI,UAAU,YAAY,YAAY,OAAO,UAAU,GAAG;CAC1D,IAAI,IAAI,QAAQ;CAChB,IAAI,IAAI,QAAQ;AAGhB,KAAI,EAAE,SAAS,UACb,KAAI,EAAE,OAAO,MAAM,YAAY,EAAE,OAAO,CAAC;CAI3C,IAAI,QAAQ,EAAE,OAAO;AACrB,QAAO,QAAQ,OAAO,SAAS,EAAE,SAAS,IAAI,MAAM,EAAE,KAAK,GAAG,GAAG,MAAM,OAAO,KAAK,IAAI,MAAM,MAAM;;;;;;;;;;;;AAarG,SAAgB,YAAY,OAAO,WAAW,SAAS;AACrD,KAAI,MAAM,MAAM,IAAI,CAAC,SAAS,MAAM,CAClC,QAAO,OAAO,MAAM;CAItB,IAAI,WAAWK,qBAAmB,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,GAAG;CACzG,IAAI,WAAWA,qBAAmB,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,EAAE;CACxG,IAAI,QAAQ,YAAY,MAAM;CAC9B,IAAI,UAAU,YAAY,YAAY,OAAO,UAAU,GAAG;AAC1D,KAAI,QAAQ,WAAW,YAAY,QAAQ,YAAY,SAErD,QAAOL,gBAAc,OAAO,UAAU;MACjC;EACL,IAAI,IAAI,QAAQ;EAChB,IAAI,IAAI,QAAQ;AAGhB,MAAI,EAAE,SAAS,UACb,KAAI,EAAE,OAAO,MAAM,YAAY,EAAE,OAAO,CAAC;AAK3C,MAAI,EAAE,OAAO,MAAM,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,YAAY,YAAY,EAAE,SAAS,GAAG,CAAC;AAGzF,MAAI,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE;EACvB,IAAI,MAAM,IAAI,IAAI,IAAI;AACtB,MAAI,MAAM,EAAE,SAAS,EACnB,GAAE,OAAO,MAAM,GAAG,GAAG,IAAI;AAE3B,SAAO,QAAQ,OAAO,EAAE,KAAK,GAAG;;;;;;;;;;;AAYpC,SAAgB,YAAY,OAAO,WAAW;CAE5C,IAAI,UAAU;EACZ,MAAM,MAAM;EACZ,cAAc,MAAM;EACpB,UAAU,MAAM;EACjB;CACD,IAAI,IAAI,QAAQ;AAGhB,QAAO,aAAa,GAAG;AACrB,IAAE,QAAQ,EAAE;AACZ,UAAQ;AACR;;AAEF,KAAI,EAAE,SAAS,WAEb;MADc,EAAE,OAAO,WAAW,EAAE,SAAS,UAAU,CAC3C,MAAM,GAAG;GACnB,IAAI,IAAI,YAAY;AACpB,KAAE;AACF,UAAO,EAAE,OAAO,IAAI;AAClB,MAAE,KAAK;AACP,QAAI,MAAM,GAAG;AACX,OAAE,QAAQ,EAAE;AACZ,aAAQ;AACR;;AAEF;AACA,MAAE;;;;AAIR,QAAO;;;;;;;AAQT,SAAS,MAAM,QAAQ;CACrB,IAAI,MAAM,EAAE;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,KAAK,EAAE;AAEb,QAAO;;;;;;;;;;;;;AAcT,SAAgB,OAAO,OAAO;AAC5B,QAAO,MAAM,eAAe,CAAC,QAAQ,QAAQ,GAAG,CAC/C,QAAQ,cAAc,GAAG,CACzB;;;;;AAMH,IAAW,cAAc,OAAO,WAAW;;;;;;;;;;AAW3C,SAAgBM,cAAY,GAAG,GAAG,SAAS;AAEzC,KAAI,YAAY,QAAQ,YAAY,OAClC,QAAO,MAAM;AAEf,KAAI,MAAM,EACR,QAAO;AAIT,KAAI,MAAM,EAAE,IAAI,MAAM,EAAE,CACtB,QAAO;AAIT,KAAI,SAAS,EAAE,IAAI,SAAS,EAAE,EAAE;EAE9B,IAAI,OAAO,KAAK,IAAI,IAAI,EAAE;AAC1B,MAAI,QAAQ,YACV,QAAO;MAGP,QAAO,QAAQ,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,GAAG;;AAKxD,QAAO;;AA+DT,SAAS,iBAAiB,OAAO,SAAS;AACxC,KAAI,SAAS,MAAM,CACjB,QAAO;UACE,YAAY,MAAM,CAC3B,QAAO,MAAM,UAAU;KAEvB,UAAS;;AAGb,SAASD,qBAAmB,OAAO,cAAc;AAC/C,KAAI,SAAS,MAAM,CACjB,QAAO;UACE,YAAY,MAAM,CAC3B,QAAO,MAAM,UAAU;KAEvB,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9pBX,SAAgB,QAAQ,SAAM,iBAAc,QAAQ,MAAM;CACxD,SAAS,gBAAgB,OAAO;EAI9B,IAAI,OAAO,YAAY,OAAOE,gBAAa,IAAI,sBAAsB,CAAC;AACtE,qBAAmBC,SAAMD,iBAAc,MAAM;AAC7C,SAAO,OAAO,KAAK;;AAErB,iBAAgB,YAAY;AAC5B,iBAAgB,KAAKC;AACrB,iBAAgB,eAAeD,gBAAa,OAAO,CAAC,MAAM;AAC1D,KAAI,KACF,iBAAgB,OAAO;AAEzB,QAAO;;;;;;;;;;;AAqET,SAAgB,mBAAmB,SAAM,iBAAc,OAAO;AAG5D,KAAI,CAFaA,gBAAa,QAAO,eAAc,CAAC,qBAAqB,WAAW,CAAC,CACpF,OAAM,eAAc,MAAM,gBAAgB,OAAU,EACpC;EACf,IAAI,sBAAsBA,gBAAa,QAAO,eAAc,MAAM,gBAAgB,OAAU;AAG5F,QAAM,IAAI,MAAM,4BAA4B,OAAOC,SAAM,OAAO,GAAG,kCAAkC,OAAO,oBAAoB,KAAI,QAAK,KAAK,OAAOC,KAAG,KAAK,CAAC,CAAC,KAAK,KAAK,EAAE,IAAI,CAAC;;;AAGpL,SAAgB,qBAAqB,YAAY;AAC/C,QAAO,cAAc,WAAW,OAAO;;AAEzC,SAAgB,sBAAsB,YAAY;AAChD,QAAO,cAAc,WAAW,OAAO,MAAM,WAAW,MAAM,EAAE,GAAG;;;;;;;;;;;;;AClHrE,SAAS,gBAAgB,QAAQ,MAAM;AAErC,KAAI,cAAc,OAAO,IAAI,eAAe,QAAQ,KAAK,CACvD,QAAO,OAAO;AAEhB,KAAI,OAAO,OAAO,UAAU,cAAc,aAAa,QAAQ,KAAK,CAClE,OAAM,IAAI,MAAM,4BAA2B,OAAO,mBAAkB;AAEtE,OAAM,IAAI,MAAM,6BAA4B,OAAO,KAAI;;;;;;;;;;;AAazD,SAAS,gBAAgB,QAAQ,MAAM,OAAO;AAE5C,KAAI,cAAc,OAAO,IAAI,eAAe,QAAQ,KAAK,EAAE;AACzD,SAAO,QAAQ;AACf,SAAO;;AAET,OAAM,IAAI,MAAM,6BAA4B,OAAO,KAAI;;AAKzD,SAAS,gBAAgB,QAAQ,MAAM;AACrC,QAAO,QAAQ;;;;;;;;AASjB,SAAS,eAAe,QAAQ,MAAM;AACpC,KAAI,CAAC,UAAU,OAAO,WAAW,SAC/B,QAAO;AAIT,KAAI,eAAe,sBAAsB,KAAK,CAC5C,QAAO;AAIT,KAAI,QAAQ,OAAO,UAIjB,QAAO;AAIT,KAAI,QAAQ,SAAS,UAInB,QAAO;AAET,QAAO;;;;;;;;;AAwBT,SAAS,aAAa,QAAQ,QAAQ;AACpC,KAAI,WAAW,QAAQ,WAAW,UAAa,OAAO,OAAO,YAAY,WACvE,QAAO;AAKT,KAAI,eAAe,QAAQ,OAAO,IAAI,OAAO,kBAAkB,UAAU,OAAO,eAAe,OAAO,CACpG,QAAO;AAIT,KAAI,eAAe,mBAAmB,OAAO,CAC3C,QAAO;AAIT,KAAI,UAAU,OAAO,UAInB,QAAO;AAIT,KAAI,UAAU,SAAS,UAIrB,QAAO;AAET,QAAO;;AAET,SAAS,cAAc,QAAQ;AAC7B,QAAO,OAAO,WAAW,YAAY,UAAU,OAAO,gBAAgB;;AAExE,IAAI,uBAAuB;CACzB,QAAQ;CACR,MAAM;CACP;AACD,IAAI,oBAAoB;CACtB,UAAU;CACV,SAAS;CACT,gBAAgB;CACjB;;;;;;;;;;;;ACtID,IAAa,oBAAb,MAA+B;CAC7B,YAAY,QAAQ;AAClB,OAAK,gBAAgB;AACrB,OAAK,OAAO,YAAY,KAAK;;CAE/B,OAAO;AACL,SAAO,OAAO,KAAK,KAAK,cAAc,CAAC,QAAQ;;CAEjD,IAAI,KAAK;AACP,SAAO,gBAAgB,KAAK,eAAe,IAAI;;CAEjD,IAAI,KAAK,OAAO;AACd,kBAAgB,KAAK,eAAe,KAAK,MAAM;AAC/C,SAAO;;CAET,IAAI,KAAK;AACP,SAAO,gBAAgB,KAAK,eAAe,IAAI;;CAEjD,UAAU;AACR,SAAO,YAAY,KAAK,MAAM,GAAE,QAAO,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;;CAE9D,QAAQ,UAAU;AAChB,OAAK,IAAI,OAAO,KAAK,MAAM,CACzB,UAAS,KAAK,IAAI,IAAI,EAAE,KAAK,KAAK;;CAGtC,OAAO,KAAK;AACV,SAAO,KAAK,cAAc;;CAE5B,QAAQ;AACN,OAAK,IAAI,OAAO,KAAK,MAAM,CACzB,MAAK,OAAO,IAAI;;CAGpB,IAAI,OAAO;AACT,SAAO,OAAO,KAAK,KAAK,cAAc,CAAC;;;;;;AAsE3C,SAAS,YAAY,IAAI,UAAU;AACjC,QAAO,EACL,YAAY;EACV,IAAI,IAAI,GAAG,MAAM;AACjB,SAAO,EAAE,OAAO,IAAI;GAClB,OAAO,SAAS,EAAE,MAAM;GACxB,MAAM;GACP;IAEJ;;;;;;;;;;AAyDH,SAAgB,MAAM,QAAQ;AAG5B,KAAI,CAAC,OACH,QAAO;AAET,QAAO,kBAAkB,OAAO,kBAAkB,qBAAqB,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,SAAS,cAAc,OAAO,OAAO,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/I5M,IAAI,gBAAgB,SAAS,eAAe;AAG1C,iBAAgBC,8BAAc;AAC9B,QAAOA;;AAET,IAAIC,kBAAe;CAAC;CAAc;CAAY;CAAgB;CAAY;;;;;;AAO1E,IAAW,cAA6B,wBAAQ,SAASA,iBAAc,SAASC,cAAY,MAAM;CAChG,IAAI,EACF,wBACA,oBACA,4BACA,yBACE;CAIJ,IAAIC,UAAQ,eAAe;AAK3B,SAAM,OAAO;AACb,SAAM,SAAS;EAAC;GACd,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAKD;GACE,MAAM;GACN,OAAM,MAAK,YAAY,upfAAupf,KAAK,EAAE;GACtrf;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EAAE;GACD,MAAM;GACN,MAAM;GACP;EACA,CAAC;AACF,SAAM,eAAe;EAAC;GACpB,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACC,YACH,kBAAiB,EAAE;AAIrB,QAAI,OAAO,EAAE,GAAG,GACd,OAAM,IAAI,UAAU,yFAA8F,IAAI,wDAA6D;AAErL,WAAO,IAAIA,YAAU,EAAE;;GAE1B;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACC,UACH,gBAAe,EAAE;AAEnB,WAAO,IAAIA,UAAQ,GAAG,EAAE;;GAE3B;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACA,UACH,gBAAe,EAAE;AAEnB,WAAO,IAAIA,UAAQ,EAAE,UAAU,EAAE,EAAE;;GAEtC;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,UAAM,IAAI,UAAU,4JAAiK;;GAExL;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACA,UACH,gBAAe,EAAE;AAEnB,WAAO,IAAIA,UAAQ,EAAE,SAAS,EAAE,EAAE;;GAErC;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACC,WACH,iBAAgB,EAAE;IAEpB,IAAI,IAAI,IAAIA,WAAS,EAAE;AACvB,QAAI,EAAE,SAAS,KAAK,EAClB,OAAM,IAAI,UAAU,qGAA0G,IAAI,sDAA2D;AAE/L,WAAO;;GAEV;EAAE;GAQD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;IAC3B,IAAI,IAAI,OAAO,EAAE;AACjB,QAAI,MAAM,EAAE,CACV,OAAM,IAAI,MAAM,sBAAqB,IAAI,iBAAgB;AAE3D,WAAO;;GAEV;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACF,YACH,kBAAiB,EAAE;AAErB,QAAI;AACF,YAAO,IAAIA,YAAU,EAAE;aAChB,KAAK;AACZ,WAAM,IAAI,MAAM,sBAAqB,IAAI,kBAAiB;;;GAG/D;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACE,WACH,iBAAgB,EAAE;AAEpB,QAAI;AACF,YAAO,IAAIA,WAAS,EAAE;aACf,KAAK;AACZ,WAAM,IAAI,MAAM,sBAAqB,IAAI,iBAAgB;;;GAG9D;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACD,UACH,gBAAe,EAAE;AAEnB,QAAI;AACF,YAAO,IAAIA,UAAQ,EAAE;aACd,KAAK;AACZ,WAAM,IAAI,MAAM,sBAAqB,IAAI,gBAAe;;;GAG7D;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,WAAO,CAAC;;GAEX;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACD,YACH,kBAAiB,EAAE;AAErB,WAAO,IAAIA,YAAU,CAAC,EAAE;;GAE3B;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,QAAI,CAACE,WACH,iBAAgB,EAAE;AAEpB,WAAO,IAAIA,WAAS,CAAC,EAAE;;GAE1B;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,WAAO,OAAO,EAAE;;GAEnB;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,OAAO;AAC/B,QAAI,CAACC,cACH,gBAAe;AAEjB,WAAO,IAAIA,cAAY,MAAM;;GAEhC;EAAE;GACD,MAAM;GACN,IAAI;GACJ,SAAS,SAAS,QAAQ,UAAQ;AAChC,WAAOC,SAAO,SAAS;;GAE1B;EAAC,CAAC;AAMH,SAAM,cAAc,SAAM,MAAM,eAAe;EAC7C,IAAI,aAAaL,QAAM,YAAYM,SAAM,MAAM,WAAW;AAC1D,MAAI,CAAC,aAAa,WAAW,CAAC,SAAS,WAAW,KAAK,SAAS,IAAI,KAAK,WAAW,KAAK,aAAa,KAAK,GAAG,IAE9G,WAAW,MAAK,QAAO,CAAC,IAAI,OAAO,SAAS,IAAI,CAAC,EAAE;GACjD,IAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,SAAM,2CAA2C,GAAG,4CAA4C,OAAOA,SAAM,MAAM,CAAC;AAChK,OAAI,OAAO,WAAW;AACtB,SAAM;;AAER,QAAM;;AAOR,SAAM,cAAc,SAAM,MAAM,eAAe;EAC7C,IAAI,aAAaN,QAAM,YAAYM,SAAM,MAAM,WAAW;AAC1D,MAAI,CAAC,aAAa,WAAW,CAAC,SAAS,WAAW,KAAK,SAAS,IAAI,KAAK,WAAW,KAAK,aAAa,KAAK,GAAG,IAE9G,WAAW,MAAK,QAAO,CAAC,IAAI,OAAO,SAAS,IAAI,CAAC,EAAE;GACjD,IAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,SAAM,2CAA2C,GAAG,4CAA4C,OAAOA,SAAM,MAAM,CAAC;AAChK,OAAI,OAAO,WAAW;AACtB,SAAM;;AAER,QAAM;;AAER,QAAON;EACP;AACF,SAAS,iBAAiB,GAAG;AAC3B,OAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,mDAAmD,CAAC;;AAExG,SAAS,eAAe,GAAG;AACzB,OAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,sDAAsD,CAAC;;AAE3G,SAAS,gBAAgB;AACvB,OAAM,IAAI,MAAM,sEAAwE;;AAE1F,SAAS,gBAAgB,GAAG;AAC1B,OAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,kDAAkD,CAAC;;;;;;;;;;;;ACzYvG,IAAI,YAAY,MAId,aAAa,KAGb,WAAW,oBAGX,OAAO,sgCAGP,KAAK,sgCAIL,WAAW;CAOT,WAAW;CAiBX,UAAU;CAeV,QAAQ;CAIR,UAAU;CAIV,UAAW;CAIX,MAAM,CAAC;CAIP,MAAM;CAGN,QAAQ;CACT,EAMD,SAAS,UACT,WAAW,MAEX,eAAe,mBACf,kBAAkB,eAAe,sBACjC,yBAAyB,eAAe,4BACxC,oBAAoB,eAAe,sBACnC,MAAM,oBAEN,YAAY,KAAK,OACjB,UAAU,KAAK,KAEf,WAAW,8CACX,QAAQ,0DACR,UAAU,iDACV,YAAY,sCAEZ,OAAO,KACP,WAAW,GACX,mBAAmB,kBAEnB,iBAAiB,KAAK,SAAS,GAC/B,eAAe,GAAG,SAAS,GAG3BO,MAAI,EAAE,aAAa,KAAK;AA0E1B,IAAE,gBAAgB,IAAE,MAAM,WAAY;CACpC,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAClC,KAAI,EAAE,IAAI,EAAG,GAAE,IAAI;AACnB,QAAO,SAAS,EAAE;;AASpB,IAAE,OAAO,WAAY;AACnB,QAAO,SAAS,IAAI,KAAK,YAAY,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE;;AAY5D,IAAE,YAAY,IAAE,QAAQ,SAAU,OAAK,OAAK;CAC1C,IAAI,GACF,IAAI,MACJ,OAAO,EAAE;AACX,SAAM,IAAI,KAAKC,MAAI;AACnB,SAAM,IAAI,KAAKC,MAAI;AACnB,KAAI,CAACD,MAAI,KAAK,CAACC,MAAI,EAAG,QAAO,IAAI,KAAK,IAAI;AAC1C,KAAID,MAAI,GAAGC,MAAI,CAAE,OAAM,MAAM,kBAAkBA,MAAI;AACnD,KAAI,EAAE,IAAID,MAAI;AACd,QAAO,IAAI,IAAIA,QAAM,EAAE,IAAIC,MAAI,GAAG,IAAIA,QAAM,IAAI,KAAK,EAAE;;AAYzD,IAAE,aAAa,IAAE,MAAM,SAAU,GAAG;CAClC,IAAI,GAAG,GAAG,KAAK,KACb,IAAI,MACJ,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,EAAE,YAAY,EAAE,EAAE,GAChC,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,KAAI,CAAC,MAAM,CAAC,GACV,QAAO,CAAC,MAAM,CAAC,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI;AAIhF,KAAI,CAAC,GAAG,MAAM,CAAC,GAAG,GAAI,QAAO,GAAG,KAAK,KAAK,GAAG,KAAK,CAAC,KAAK;AAGxD,KAAI,OAAO,GAAI,QAAO;AAGtB,KAAI,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI;AAEjD,OAAM,GAAG;AACT,OAAM,GAAG;AAGT,MAAK,IAAI,GAAG,IAAI,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,EAAE,EAC9C,KAAI,GAAG,OAAO,GAAG,GAAI,QAAO,GAAG,KAAK,GAAG,KAAK,KAAK,IAAI,IAAI;AAI3D,QAAO,QAAQ,MAAM,IAAI,MAAM,MAAM,KAAK,IAAI,IAAI;;AAiBpD,IAAE,SAAS,IAAE,MAAM,WAAY;CAC7B,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,IAAI;AAG9B,KAAI,CAAC,EAAE,EAAE,GAAI,QAAO,IAAI,KAAK,EAAE;AAE/B,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG;AAC9C,MAAK,WAAW;AAEhB,KAAI,OAAO,MAAM,iBAAiB,MAAM,EAAE,CAAC;AAE3C,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,KAAK,GAAG,GAAG,IAAI,IAAI,KAAK;;AAoB7E,IAAE,WAAW,IAAE,OAAO,WAAY;CAChC,IAAI,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,SACjC,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,IAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AACnD,YAAW;AAGX,KAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,GAAG,IAAI,EAAE;AAIjC,KAAI,CAAC,KAAK,KAAK,IAAI,EAAE,IAAI,UAAO;AAC9B,MAAI,eAAe,EAAE,EAAE;AACvB,MAAI,EAAE;AAGN,MAAI,KAAK,IAAI,EAAE,SAAS,KAAK,EAAG,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM;AAChE,MAAI,QAAQ,GAAG,IAAI,EAAE;AAGrB,MAAI,WAAW,IAAI,KAAK,EAAE,IAAI,IAAI,MAAM,IAAI,IAAI,KAAK;AAErD,MAAI,KAAK,SACP,KAAI,OAAO;OACN;AACL,OAAI,EAAE,eAAe;AACrB,OAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,IAAI,GAAG,EAAE,GAAG;;AAGvC,MAAI,IAAI,KAAK,EAAE;AACf,IAAE,IAAI,EAAE;OAER,KAAI,IAAI,KAAK,EAAE,UAAU,CAAC;AAG5B,OAAM,IAAI,KAAK,aAAa;AAI5B,UAAS;AACP,MAAI;AACJ,OAAK,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE;AACxB,YAAU,GAAG,KAAK,EAAE;AACpB,MAAI,OAAO,QAAQ,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,QAAQ,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE;AAGjE,MAAI,eAAe,EAAE,EAAE,CAAC,MAAM,GAAG,GAAG,MAAM,IAAI,eAAe,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,EAAE;AAC/E,OAAI,EAAE,MAAM,KAAK,GAAG,KAAK,EAAE;AAI3B,OAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,QAAI,CAAC,KAAK;AACR,cAAS,GAAG,IAAI,GAAG,EAAE;AAErB,SAAI,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE;AAC7B,UAAI;AACJ;;;AAIJ,UAAM;AACN,UAAM;UACD;AAIL,QAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK;AAG7C,cAAS,GAAG,IAAI,GAAG,EAAE;AACrB,SAAI,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE;;AAGhC;;;;AAKN,YAAW;AAEX,QAAO,SAAS,GAAG,GAAG,KAAK,UAAU,EAAE;;AAQzC,IAAE,gBAAgB,IAAE,KAAK,WAAY;CACnC,IAAI,GACFC,MAAI,KAAK,GACT,IAAI;AAEN,KAAIA,KAAG;AACL,MAAIA,IAAE,SAAS;AACf,OAAK,IAAI,UAAU,KAAK,IAAI,SAAS,IAAI;AAGzC,MAAIA,IAAE;AACN,MAAI,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AACpC,MAAI,IAAI,EAAG,KAAI;;AAGjB,QAAO;;AAyBT,IAAE,YAAY,IAAE,MAAM,SAAU,GAAG;AACjC,QAAO,OAAO,MAAM,IAAI,KAAK,YAAY,EAAE,CAAC;;AAS9C,IAAE,qBAAqB,IAAE,WAAW,SAAU,GAAG;CAC/C,IAAI,IAAI,MACN,OAAO,EAAE;AACX,QAAO,SAAS,OAAO,GAAG,IAAI,KAAK,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,KAAK,WAAW,KAAK,SAAS;;AAQjF,IAAE,SAAS,IAAE,KAAK,SAAU,GAAG;AAC7B,QAAO,KAAK,IAAI,EAAE,KAAK;;AASzB,IAAE,QAAQ,WAAY;AACpB,QAAO,SAAS,IAAI,KAAK,YAAY,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE;;AAS5D,IAAE,cAAc,IAAE,KAAK,SAAU,GAAG;AAClC,QAAO,KAAK,IAAI,EAAE,GAAG;;AASvB,IAAE,uBAAuB,IAAE,MAAM,SAAU,GAAG;CAC5C,IAAI,IAAI,KAAK,IAAI,EAAE;AACnB,QAAO,KAAK,KAAK,MAAM;;AA6BzB,IAAE,mBAAmB,IAAE,OAAO,WAAY;CACxC,IAAI,GAAG,GAAG,IAAI,IAAI,KAChB,IAAI,MACJ,OAAO,EAAE,aACT,MAAM,IAAI,KAAK,EAAE;AAEnB,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,EAAE,IAAI,WAAQ,IAAI;AACrD,KAAI,EAAE,QAAQ,CAAE,QAAO;AAEvB,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG;AAC9C,MAAK,WAAW;AAChB,OAAM,EAAE,EAAE;AAOV,KAAI,MAAM,IAAI;AACZ,MAAI,KAAK,KAAK,MAAM,EAAE;AACtB,OAAK,IAAI,QAAQ,GAAG,EAAE,EAAE,UAAU;QAC7B;AACL,MAAI;AACJ,MAAI;;AAGN,KAAI,aAAa,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK;CAGxD,IAAI,SACF,IAAI,GACJ,KAAK,IAAI,KAAK,EAAE;AAClB,QAAO,MAAM;AACX,YAAU,EAAE,MAAM,EAAE;AACpB,MAAI,IAAI,MAAM,QAAQ,MAAM,GAAG,MAAM,QAAQ,MAAM,GAAG,CAAC,CAAC,CAAC;;AAG3D,QAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,KAAK;;AAkCnE,IAAE,iBAAiB,IAAE,OAAO,WAAY;CACtC,IAAI,GAAG,IAAI,IAAI,KACb,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,IAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAEnD,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG;AAC9C,MAAK,WAAW;AAChB,OAAM,EAAE,EAAE;AAEV,KAAI,MAAM,EACR,KAAI,aAAa,MAAM,GAAG,GAAG,GAAG,KAAK;MAChC;AAWL,MAAI,MAAM,KAAK,KAAK,IAAI;AACxB,MAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,MAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,EAAE,CAAC;AAC9B,MAAI,aAAa,MAAM,GAAG,GAAG,GAAG,KAAK;EAGrC,IAAI,SACF,KAAK,IAAI,KAAK,EAAE,EAChB,MAAM,IAAI,KAAK,GAAG,EAClB,MAAM,IAAI,KAAK,GAAG;AACpB,SAAO,MAAM;AACX,aAAU,EAAE,MAAM,EAAE;AACpB,OAAI,EAAE,MAAM,GAAG,KAAK,QAAQ,MAAM,IAAI,MAAM,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;;;AAIrE,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,SAAS,GAAG,IAAI,IAAI,KAAK;;AAoBlC,IAAE,oBAAoB,IAAE,OAAO,WAAY;CACzC,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,EAAE,EAAE;AACvC,KAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAElC,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK;AACtB,MAAK,WAAW;AAEhB,QAAO,OAAO,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,KAAK,YAAY,IAAI,KAAK,WAAW,GAAG;;AAuB5E,IAAE,gBAAgB,IAAE,OAAO,WAAY;CACrC,IAAI,IAAI,MACN,OAAO,EAAE,aACT,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAClB,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,KAAI,MAAM,GACR,QAAO,MAAM,IAET,EAAE,OAAO,GAAG,MAAM,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,EAAE,GAE7C,IAAI,KAAK,IAAI;AAGnB,KAAI,EAAE,QAAQ,CAAE,QAAO,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAI;AAIzD,MAAK,YAAY,KAAK;AACtB,MAAK,WAAW;AAGhB,KAAI,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM;AAErD,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,EAAE,MAAM,EAAE;;AAuBnB,IAAE,0BAA0B,IAAE,QAAQ,WAAY;CAChD,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,EAAE,IAAI,EAAE,CAAE,QAAO,IAAI,KAAK,EAAE,GAAG,EAAE,GAAG,IAAI,IAAI;AAChD,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,EAAE;AAErC,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG;AACxD,MAAK,WAAW;AAChB,YAAW;AAEX,KAAI,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE;AAEtC,YAAW;AACX,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,EAAE,IAAI;;AAoBf,IAAE,wBAAwB,IAAE,QAAQ,WAAY;CAC9C,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,IAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAEnD,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG;AAC5D,MAAK,WAAW;AAChB,YAAW;AAEX,KAAI,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE;AAErC,YAAW;AACX,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,EAAE,IAAI;;AAuBf,IAAE,2BAA2B,IAAE,QAAQ,WAAY;CACjD,IAAI,IAAI,IAAI,KAAK,KACf,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,IAAI;AACvC,KAAI,EAAE,KAAK,EAAG,QAAO,IAAI,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,IAAI,EAAE,QAAQ,GAAG,IAAI,IAAI;AAE7E,MAAK,KAAK;AACV,MAAK,KAAK;AACV,OAAM,EAAE,IAAI;AAEZ,KAAI,KAAK,IAAI,KAAK,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,EAAG,QAAO,SAAS,IAAI,KAAK,EAAE,EAAE,IAAI,IAAI,KAAK;AAEhF,MAAK,YAAY,MAAM,MAAM,EAAE;AAE/B,KAAI,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,MAAM,IAAI,EAAE;AAExD,MAAK,YAAY,KAAK;AACtB,MAAK,WAAW;AAEhB,KAAI,EAAE,IAAI;AAEV,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,EAAE,MAAM,GAAI;;AAyBrB,IAAE,cAAc,IAAE,OAAO,WAAY;CACnC,IAAI,QAAQ,GACV,IAAI,IACJ,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAElC,KAAI,EAAE,KAAK,CAAC,IAAI,EAAE;AAClB,MAAK,KAAK;AACV,MAAK,KAAK;AAEV,KAAI,MAAM,IAAI;AAGZ,MAAI,MAAM,GAAG;AACX,YAAS,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAI;AAC3C,UAAO,IAAI,EAAE;AACb,UAAO;;AAIT,SAAO,IAAI,KAAK,IAAI;;AAKtB,MAAK,YAAY,KAAK;AACtB,MAAK,WAAW;AAEhB,KAAI,EAAE,IAAI,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM;AAE9D,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,EAAE,MAAM,EAAE;;AAsBnB,IAAE,iBAAiB,IAAE,OAAO,WAAY;CACtC,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,IAC7B,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,KAAI,CAAC,EAAE,UAAU,EAAE;AACjB,MAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,IAAI;AAC9B,MAAI,KAAK,KAAK,cAAc;AAC1B,OAAI,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAI;AACtC,KAAE,IAAI,EAAE;AACR,UAAO;;YAEA,EAAE,QAAQ,CACnB,QAAO,IAAI,KAAK,EAAE;UACT,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,KAAK,KAAK,cAAc;AAClD,MAAI,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,IAAK;AACvC,IAAE,IAAI,EAAE;AACR,SAAO;;AAGT,MAAK,YAAY,MAAM,KAAK;AAC5B,MAAK,WAAW;AAQhB,KAAI,KAAK,IAAI,IAAI,MAAM,WAAW,IAAI,EAAE;AAExC,MAAK,IAAI,GAAG,GAAG,EAAE,EAAG,KAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;AAEhE,YAAW;AAEX,KAAI,KAAK,KAAK,MAAM,SAAS;AAC7B,KAAI;AACJ,MAAK,EAAE,MAAM,EAAE;AACf,KAAI,IAAI,KAAK,EAAE;AACf,MAAK;AAGL,QAAO,MAAM,KAAK;AAChB,OAAK,GAAG,MAAM,GAAG;AACjB,MAAI,EAAE,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;AAE3B,OAAK,GAAG,MAAM,GAAG;AACjB,MAAI,EAAE,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;AAE1B,MAAI,EAAE,EAAE,OAAO,KAAK,EAAG,MAAK,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,MAAM;;AAG1D,KAAI,EAAG,KAAI,EAAE,MAAM,KAAM,IAAI,EAAG;AAEhC,YAAW;AAEX,QAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,KAAK;;AAQnE,IAAE,WAAW,WAAY;AACvB,QAAO,CAAC,CAAC,KAAK;;AAQhB,IAAE,YAAY,IAAE,QAAQ,WAAY;AAClC,QAAO,CAAC,CAAC,KAAK,KAAK,UAAU,KAAK,IAAI,SAAS,GAAG,KAAK,EAAE,SAAS;;AAQpE,IAAE,QAAQ,WAAY;AACpB,QAAO,CAAC,KAAK;;AAQf,IAAE,aAAa,IAAE,QAAQ,WAAY;AACnC,QAAO,KAAK,IAAI;;AAQlB,IAAE,aAAa,IAAE,QAAQ,WAAY;AACnC,QAAO,KAAK,IAAI;;AAQlB,IAAE,SAAS,WAAY;AACrB,QAAO,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,OAAO;;AAQnC,IAAE,WAAW,IAAE,KAAK,SAAU,GAAG;AAC/B,QAAO,KAAK,IAAI,EAAE,GAAG;;AAQvB,IAAE,oBAAoB,IAAE,MAAM,SAAU,GAAG;AACzC,QAAO,KAAK,IAAI,EAAE,GAAG;;AAkCvB,IAAE,YAAY,IAAE,MAAM,SAAU,MAAM;CACpC,IAAI,UAAUA,KAAG,aAAa,GAAG,KAAK,KAAK,IAAI,GAC7C,MAAM,MACN,OAAO,IAAI,aACX,KAAK,KAAK,WACV,KAAK,KAAK,UACV,QAAQ;AAGV,KAAI,QAAQ,MAAM;AAChB,SAAO,IAAI,KAAK,GAAG;AACnB,aAAW;QACN;AACL,SAAO,IAAI,KAAK,KAAK;AACrB,QAAI,KAAK;AAGT,MAAI,KAAK,IAAI,KAAK,CAACA,OAAK,CAACA,IAAE,MAAM,KAAK,GAAG,EAAE,CAAE,QAAO,IAAI,KAAK,IAAI;AAEjE,aAAW,KAAK,GAAG,GAAG;;AAGxB,OAAI,IAAI;AAGR,KAAI,IAAI,IAAI,KAAK,CAACA,OAAK,CAACA,IAAE,MAAM,IAAI,GAAG,EAAE,CACvC,QAAO,IAAI,KAAKA,OAAK,CAACA,IAAE,KAAK,YAAS,IAAI,KAAK,IAAI,MAAMA,MAAI,IAAI,SAAM;AAKzE,KAAI,SACF,KAAIA,IAAE,SAAS,EACb,OAAM;MACD;AACL,OAAK,IAAIA,IAAE,IAAI,IAAI,OAAO,GAAI,MAAK;AACnC,QAAM,MAAM;;AAIhB,YAAW;AACX,MAAK,KAAK;AACV,OAAM,iBAAiB,KAAK,GAAG;AAC/B,eAAc,WAAW,QAAQ,MAAM,KAAK,GAAG,GAAG,iBAAiB,MAAM,GAAG;AAG5E,KAAI,OAAO,KAAK,aAAa,IAAI,EAAE;AAgBnC,KAAI,oBAAoB,EAAE,GAAG,IAAI,IAAI,GAAG,CAEtC,IAAG;AACD,QAAM;AACN,QAAM,iBAAiB,KAAK,GAAG;AAC/B,gBAAc,WAAW,QAAQ,MAAM,KAAK,GAAG,GAAG,iBAAiB,MAAM,GAAG;AAC5E,MAAI,OAAO,KAAK,aAAa,IAAI,EAAE;AAEnC,MAAI,CAAC,KAAK;AAGR,OAAI,CAAC,eAAe,EAAE,EAAE,CAAC,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,KAAK,eACnD,KAAI,SAAS,GAAG,KAAK,GAAG,EAAE;AAG5B;;UAEK,oBAAoB,EAAE,GAAG,KAAK,IAAI,GAAG;AAGhD,YAAW;AAEX,QAAO,SAAS,GAAG,IAAI,GAAG;;AAiD5B,IAAE,QAAQ,IAAE,MAAM,SAAU,GAAG;CAC7B,IAAIA,KAAG,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IAAI,MAAM,IAC5C,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,IAAI,KAAK,EAAE;AAGf,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI;WAG1B,EAAE,EAAG,GAAE,IAAI,CAAC,EAAE;MAKlB,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,IAAI;AAE/C,SAAO;;AAIT,KAAI,EAAE,KAAK,EAAE,GAAG;AACd,IAAE,IAAI,CAAC,EAAE;AACT,SAAO,EAAE,KAAK,EAAE;;AAGlB,MAAK,EAAE;AACP,MAAK,EAAE;AACP,MAAK,KAAK;AACV,MAAK,KAAK;AAGV,KAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI;AAGpB,MAAI,GAAG,GAAI,GAAE,IAAI,CAAC,EAAE;WAGX,GAAG,GAAI,KAAI,IAAI,KAAK,EAAE;MAI1B,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,EAAE;AAEvC,SAAO,WAAW,SAAS,GAAG,IAAI,GAAG,GAAG;;AAM1C,KAAI,UAAU,EAAE,IAAI,SAAS;AAC7B,MAAK,UAAU,EAAE,IAAI,SAAS;AAE9B,MAAK,GAAG,OAAO;AACf,KAAI,KAAK;AAGT,KAAI,GAAG;AACL,SAAO,IAAI;AAEX,MAAI,MAAM;AACR,SAAI;AACJ,OAAI,CAAC;AACL,SAAM,GAAG;SACJ;AACL,SAAI;AACJ,OAAI;AACJ,SAAM,GAAG;;AAMX,MAAI,KAAK,IAAI,KAAK,KAAK,KAAK,SAAS,EAAE,IAAI,GAAG;AAE9C,MAAI,IAAI,GAAG;AACT,OAAI;AACJ,OAAE,SAAS;;AAIb,MAAE,SAAS;AACX,OAAK,IAAI,GAAG,KAAM,KAAE,KAAK,EAAE;AAC3B,MAAE,SAAS;QAGN;AAIL,MAAI,GAAG;AACP,QAAM,GAAG;AACT,SAAO,IAAI;AACX,MAAI,KAAM,OAAM;AAEhB,OAAK,IAAI,GAAG,IAAI,KAAK,IACnB,KAAI,GAAG,MAAM,GAAG,IAAI;AAClB,UAAO,GAAG,KAAK,GAAG;AAClB;;AAIJ,MAAI;;AAGN,KAAI,MAAM;AACR,QAAI;AACJ,OAAK;AACL,OAAKA;AACL,IAAE,IAAI,CAAC,EAAE;;AAGX,OAAM,GAAG;AAIT,MAAK,IAAI,GAAG,SAAS,KAAK,IAAI,GAAG,EAAE,EAAG,IAAG,SAAS;AAGlD,MAAK,IAAI,GAAG,QAAQ,IAAI,IAAI;AAE1B,MAAI,GAAG,EAAE,KAAK,GAAG,IAAI;AACnB,QAAK,IAAI,GAAG,KAAK,GAAG,EAAE,OAAO,GAAI,IAAG,KAAK,OAAO;AAChD,KAAE,GAAG;AACL,MAAG,MAAM;;AAGX,KAAG,MAAM,GAAG;;AAId,QAAO,GAAG,EAAE,SAAS,GAAI,IAAG,KAAK;AAGjC,QAAO,GAAG,OAAO,GAAG,GAAG,OAAO,CAAE,GAAE;AAGlC,KAAI,CAAC,GAAG,GAAI,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,EAAE;AAE9C,GAAE,IAAI;AACN,GAAE,IAAI,kBAAkB,IAAI,EAAE;AAE9B,QAAO,WAAW,SAAS,GAAG,IAAI,GAAG,GAAG;;AA4B1C,IAAE,SAAS,IAAE,MAAM,SAAU,GAAG;CAC9B,IAAI,GACF,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,IAAI,KAAK,EAAE;AAGf,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,GAAI,QAAO,IAAI,KAAK,IAAI;AAGxD,KAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,GACtB,QAAO,SAAS,IAAI,KAAK,EAAE,EAAE,KAAK,WAAW,KAAK,SAAS;AAI7D,YAAW;AAEX,KAAI,KAAK,UAAU,GAAG;AAIpB,MAAI,OAAO,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,EAAE;AAC/B,IAAE,KAAK,EAAE;OAET,KAAI,OAAO,GAAG,GAAG,GAAG,KAAK,QAAQ,EAAE;AAGrC,KAAI,EAAE,MAAM,EAAE;AAEd,YAAW;AAEX,QAAO,EAAE,MAAM,EAAE;;AAUnB,IAAE,qBAAqB,IAAE,MAAM,WAAY;AACzC,QAAO,mBAAmB,KAAK;;AASjC,IAAE,mBAAmB,IAAE,KAAK,WAAY;AACtC,QAAO,iBAAiB,KAAK;;AAS/B,IAAE,UAAU,IAAE,MAAM,WAAY;CAC9B,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAClC,GAAE,IAAI,CAAC,EAAE;AACT,QAAO,SAAS,EAAE;;AAyBpB,IAAE,OAAO,IAAE,MAAM,SAAU,GAAG;CAC5B,IAAI,OAAOA,KAAG,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IACtC,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,IAAI,KAAK,EAAE;AAGf,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,MAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI;WAM1B,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,IAAI;AAEzD,SAAO;;AAIT,KAAI,EAAE,KAAK,EAAE,GAAG;AACd,IAAE,IAAI,CAAC,EAAE;AACT,SAAO,EAAE,MAAM,EAAE;;AAGnB,MAAK,EAAE;AACP,MAAK,EAAE;AACP,MAAK,KAAK;AACV,MAAK,KAAK;AAGV,KAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI;AAIpB,MAAI,CAAC,GAAG,GAAI,KAAI,IAAI,KAAK,EAAE;AAE3B,SAAO,WAAW,SAAS,GAAG,IAAI,GAAG,GAAG;;AAM1C,KAAI,UAAU,EAAE,IAAI,SAAS;AAC7B,KAAI,UAAU,EAAE,IAAI,SAAS;AAE7B,MAAK,GAAG,OAAO;AACf,KAAI,IAAI;AAGR,KAAI,GAAG;AAEL,MAAI,IAAI,GAAG;AACT,SAAI;AACJ,OAAI,CAAC;AACL,SAAM,GAAG;SACJ;AACL,SAAI;AACJ,OAAI;AACJ,SAAM,GAAG;;AAIX,MAAI,KAAK,KAAK,KAAK,SAAS;AAC5B,QAAM,IAAI,MAAM,IAAI,IAAI,MAAM;AAE9B,MAAI,IAAI,KAAK;AACX,OAAI;AACJ,OAAE,SAAS;;AAIb,MAAE,SAAS;AACX,SAAO,KAAM,KAAE,KAAK,EAAE;AACtB,MAAE,SAAS;;AAGb,OAAM,GAAG;AACT,KAAI,GAAG;AAGP,KAAI,MAAM,IAAI,GAAG;AACf,MAAI;AACJ,QAAI;AACJ,OAAK;AACL,OAAKA;;AAIP,MAAK,QAAQ,GAAG,IAAI;AAClB,WAAS,GAAG,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,SAAS,OAAO;AACnD,KAAG,MAAM;;AAGX,KAAI,OAAO;AACT,KAAG,QAAQ,MAAM;AACjB,IAAE;;AAKJ,MAAK,MAAM,GAAG,QAAQ,GAAG,EAAE,QAAQ,GAAI,IAAG,KAAK;AAE/C,GAAE,IAAI;AACN,GAAE,IAAI,kBAAkB,IAAI,EAAE;AAE9B,QAAO,WAAW,SAAS,GAAG,IAAI,GAAG,GAAG;;AAU1C,IAAE,YAAY,IAAE,KAAK,SAAU,GAAG;CAChC,IAAI,GACF,IAAI;AAEN,KAAI,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,MAAM,EAAG,OAAM,MAAM,kBAAkB,EAAE;AAErF,KAAI,EAAE,GAAG;AACP,MAAI,aAAa,EAAE,EAAE;AACrB,MAAI,KAAK,EAAE,IAAI,IAAI,EAAG,KAAI,EAAE,IAAI;OAEhC,KAAI;AAGN,QAAO;;AAST,IAAE,QAAQ,WAAY;CACpB,IAAI,IAAI,MACN,OAAO,EAAE;AAEX,QAAO,SAAS,IAAI,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,KAAK,SAAS;;AAmBtD,IAAE,OAAO,IAAE,MAAM,WAAY;CAC3B,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,IAAI;AACvC,KAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAElC,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG;AAC9C,MAAK,WAAW;AAEhB,KAAI,KAAK,MAAM,iBAAiB,MAAM,EAAE,CAAC;AAEzC,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,SAAS,WAAW,IAAI,EAAE,KAAK,GAAG,GAAG,IAAI,IAAI,KAAK;;AAgB3D,IAAE,aAAa,IAAE,OAAO,WAAY;CAClC,IAAI,GAAG,GAAG,IAAI,GAAG,KAAK,GACpB,IAAI,MACJA,MAAI,EAAE,GACN,IAAI,EAAE,GACN,IAAI,EAAE,GACN,OAAO,EAAE;AAGX,KAAI,MAAM,KAAK,CAACA,OAAK,CAACA,IAAE,GACtB,QAAO,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,CAACA,OAAKA,IAAE,MAAM,MAAMA,MAAI,IAAI,SAAM;AAGpE,YAAW;AAGX,KAAI,KAAK,KAAK,CAAC,EAAE;AAIjB,KAAI,KAAK,KAAK,KAAK,UAAO;AACxB,MAAI,eAAeA,IAAE;AAErB,OAAK,EAAE,SAAS,KAAK,KAAK,EAAG,MAAK;AAClC,MAAI,KAAK,KAAK,EAAE;AAChB,MAAI,WAAW,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,IAAI;AAE3C,MAAI,KAAK,SACP,KAAI,OAAO;OACN;AACL,OAAI,EAAE,eAAe;AACrB,OAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,IAAI,GAAG,EAAE,GAAG;;AAGvC,MAAI,IAAI,KAAK,EAAE;OAEf,KAAI,IAAI,KAAK,EAAE,UAAU,CAAC;AAG5B,OAAM,IAAI,KAAK,aAAa;AAG5B,UAAS;AACP,MAAI;AACJ,MAAI,EAAE,KAAK,OAAO,GAAG,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,MAAM,GAAI;AAG9C,MAAI,eAAe,EAAE,EAAE,CAAC,MAAM,GAAG,GAAG,MAAM,IAAI,eAAe,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,EAAE;AAC/E,OAAI,EAAE,MAAM,KAAK,GAAG,KAAK,EAAE;AAI3B,OAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,QAAI,CAAC,KAAK;AACR,cAAS,GAAG,IAAI,GAAG,EAAE;AAErB,SAAI,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE;AACpB,UAAI;AACJ;;;AAIJ,UAAM;AACN,UAAM;UACD;AAIL,QAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,KAAK;AAG7C,cAAS,GAAG,IAAI,GAAG,EAAE;AACrB,SAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE;;AAGvB;;;;AAKN,YAAW;AAEX,QAAO,SAAS,GAAG,GAAG,KAAK,UAAU,EAAE;;AAiBzC,IAAE,UAAU,IAAE,MAAM,WAAY;CAC9B,IAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,IAAI,KAAK,IAAI;AACvC,KAAI,EAAE,QAAQ,CAAE,QAAO,IAAI,KAAK,EAAE;AAElC,MAAK,KAAK;AACV,MAAK,KAAK;AACV,MAAK,YAAY,KAAK;AACtB,MAAK,WAAW;AAEhB,KAAI,EAAE,KAAK;AACX,GAAE,IAAI;AACN,KAAI,OAAO,GAAG,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,IAAI,EAAE;AAE/D,MAAK,YAAY;AACjB,MAAK,WAAW;AAEhB,QAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,KAAK,GAAG,GAAG,IAAI,IAAI,KAAK;;AAyB7E,IAAE,QAAQ,IAAE,MAAM,SAAU,GAAG;CAC7B,IAAI,OAAO,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,KACjC,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,KAAK,EAAE,EAAE;AAEzB,GAAE,KAAK,EAAE;AAGT,KAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,GAE9B,QAAO,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG,MAAM,CAAC,KAI5D,MAIA,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE;AAGrC,KAAI,UAAU,EAAE,IAAI,SAAS,GAAG,UAAU,EAAE,IAAI,SAAS;AACzD,OAAM,GAAG;AACT,OAAM,GAAG;AAGT,KAAI,MAAM,KAAK;AACb,MAAI;AACJ,OAAK;AACL,OAAK;AACL,OAAK;AACL,QAAM;AACN,QAAM;;AAIR,KAAI,EAAE;AACN,MAAK,MAAM;AACX,MAAK,IAAI,IAAI,KAAM,GAAE,KAAK,EAAE;AAG5B,MAAK,IAAI,KAAK,EAAE,KAAK,IAAI;AACvB,UAAQ;AACR,OAAK,IAAI,MAAM,GAAG,IAAI,IAAI;AACxB,OAAI,EAAE,KAAK,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK;AACnC,KAAE,OAAO,IAAI,OAAO;AACpB,WAAQ,IAAI,OAAO;;AAGrB,IAAE,MAAM,EAAE,KAAK,SAAS,OAAO;;AAIjC,QAAO,CAAC,EAAE,EAAE,KAAM,GAAE,KAAK;AAEzB,KAAI,MAAO,GAAE;KACR,GAAE,OAAO;AAEd,GAAE,IAAI;AACN,GAAE,IAAI,kBAAkB,GAAG,EAAE;AAE7B,QAAO,WAAW,SAAS,GAAG,KAAK,WAAW,KAAK,SAAS,GAAG;;AAcjE,IAAE,WAAW,SAAU,IAAI,IAAI;AAC7B,QAAO,eAAe,MAAM,GAAG,IAAI,GAAG;;AAcxC,IAAE,kBAAkB,IAAE,OAAO,SAAU,IAAI,IAAI;CAC7C,IAAI,IAAI,MACN,OAAO,EAAE;AAEX,KAAI,IAAI,KAAK,EAAE;AACf,KAAI,OAAO,KAAK,EAAG,QAAO;AAE1B,YAAW,IAAI,GAAG,WAAW;AAE7B,KAAI,OAAO,KAAK,EAAG,MAAK,KAAK;KACxB,YAAW,IAAI,GAAG,EAAE;AAEzB,QAAO,SAAS,GAAG,KAAK,EAAE,IAAI,GAAG,GAAG;;AAYtC,IAAE,gBAAgB,SAAU,IAAI,IAAI;CAClC,IAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,OAAO,KAAK,EACd,OAAM,eAAe,GAAG,KAAK;MACxB;AACL,aAAW,IAAI,GAAG,WAAW;AAE7B,MAAI,OAAO,KAAK,EAAG,MAAK,KAAK;MACxB,YAAW,IAAI,GAAG,EAAE;AAEzB,MAAI,SAAS,IAAI,KAAK,EAAE,EAAE,KAAK,GAAG,GAAG;AACrC,QAAM,eAAe,GAAG,MAAM,KAAK,EAAE;;AAGvC,QAAO,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,MAAM;;AAoBhD,IAAE,UAAU,SAAU,IAAI,IAAI;CAC5B,IAAI,KAAK,GACP,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,OAAO,KAAK,EACd,OAAM,eAAe,EAAE;MAClB;AACL,aAAW,IAAI,GAAG,WAAW;AAE7B,MAAI,OAAO,KAAK,EAAG,MAAK,KAAK;MACxB,YAAW,IAAI,GAAG,EAAE;AAEzB,MAAI,SAAS,IAAI,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,GAAG;AAC3C,QAAM,eAAe,GAAG,OAAO,KAAK,EAAE,IAAI,EAAE;;AAK9C,QAAO,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,MAAM;;AAehD,IAAE,aAAa,SAAU,MAAM;CAC7B,IAAIA,KAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAIC,MAAI,IAAI,GAAG,GACzC,IAAI,MACJ,KAAK,EAAE,GACP,OAAO,EAAE;AAEX,KAAI,CAAC,GAAI,QAAO,IAAI,KAAK,EAAE;AAE3B,QAAK,KAAK,IAAI,KAAK,EAAE;AACrB,MAAK,KAAK,IAAI,KAAK,EAAE;AAErB,OAAI,IAAI,KAAK,GAAG;AAChB,KAAI,IAAE,IAAI,aAAa,GAAG,GAAG,EAAE,IAAI;AACnC,KAAI,IAAI;AACR,KAAE,EAAE,KAAK,QAAQ,IAAI,IAAI,IAAI,WAAW,IAAI,EAAE;AAE9C,KAAI,QAAQ,KAGV,QAAO,IAAI,IAAID,MAAIC;MACd;AACL,MAAI,IAAI,KAAK,KAAK;AAClB,MAAI,CAAC,EAAE,OAAO,IAAI,EAAE,GAAGA,KAAG,CAAE,OAAM,MAAM,kBAAkB,EAAE;AAC5D,SAAO,EAAE,GAAGD,IAAE,GAAI,IAAI,IAAIA,MAAIC,OAAM;;AAGtC,YAAW;AACX,KAAI,IAAI,KAAK,eAAe,GAAG,CAAC;AAChC,MAAK,KAAK;AACV,MAAK,YAAY,IAAI,GAAG,SAAS,WAAW;AAE5C,UAAU;AACR,MAAI,OAAO,GAAGD,KAAG,GAAG,GAAG,EAAE;AACzB,OAAK,GAAG,KAAK,EAAE,MAAM,GAAG,CAAC;AACzB,MAAI,GAAG,IAAI,KAAK,IAAI,EAAG;AACvB,OAAK;AACL,OAAK;AACL,OAAKC;AACL,SAAK,GAAG,KAAK,EAAE,MAAM,GAAG,CAAC;AACzB,OAAK;AACL,OAAKD;AACL,QAAI,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;AACxB,MAAI;;AAGN,MAAK,OAAO,KAAK,MAAM,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE;AACxC,MAAK,GAAG,KAAK,GAAG,MAAMC,KAAG,CAAC;AAC1B,MAAK,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC;AAC1B,IAAG,IAAI,KAAG,IAAI,EAAE;AAGhB,KAAI,OAAOA,MAAI,IAAI,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,IAAI,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,IAC7E,CAACA,MAAI,GAAG,GAAG,CAAC,IAAI,GAAG;AAEzB,MAAK,YAAY;AACjB,YAAW;AAEX,QAAO;;AAcT,IAAE,gBAAgB,IAAE,QAAQ,SAAU,IAAI,IAAI;AAC5C,QAAO,eAAe,MAAM,IAAI,IAAI,GAAG;;AAoBzC,IAAE,YAAY,SAAU,GAAG,IAAI;CAC7B,IAAI,IAAI,MACN,OAAO,EAAE;AAEX,KAAI,IAAI,KAAK,EAAE;AAEf,KAAI,KAAK,MAAM;AAGb,MAAI,CAAC,EAAE,EAAG,QAAO;AAEjB,MAAI,IAAI,KAAK,EAAE;AACf,OAAK,KAAK;QACL;AACL,MAAI,IAAI,KAAK,EAAE;AACf,MAAI,OAAO,KAAK,EACd,MAAK,KAAK;MAEV,YAAW,IAAI,GAAG,EAAE;AAItB,MAAI,CAAC,EAAE,EAAG,QAAO,EAAE,IAAI,IAAI;AAG3B,MAAI,CAAC,EAAE,GAAG;AACR,OAAI,EAAE,EAAG,GAAE,IAAI,EAAE;AACjB,UAAO;;;AAKX,KAAI,EAAE,EAAE,IAAI;AACV,aAAW;AACX,MAAI,OAAO,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE;AACnC,aAAW;AACX,WAAS,EAAE;QAGN;AACL,IAAE,IAAI,EAAE;AACR,MAAI;;AAGN,QAAO;;AAST,IAAE,WAAW,WAAY;AACvB,QAAO,CAAC;;AAcV,IAAE,UAAU,SAAU,IAAI,IAAI;AAC5B,QAAO,eAAe,MAAM,GAAG,IAAI,GAAG;;AA+CxC,IAAE,UAAU,IAAE,MAAM,SAAU,GAAG;CAC/B,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GACnB,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE;AAGxB,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,GAAI,QAAO,IAAI,KAAK,QAAQ,CAAC,GAAG,GAAG,CAAC;AAExE,KAAI,IAAI,KAAK,EAAE;AAEf,KAAI,EAAE,GAAG,EAAE,CAAE,QAAO;AAEpB,MAAK,KAAK;AACV,MAAK,KAAK;AAEV,KAAI,EAAE,GAAG,EAAE,CAAE,QAAO,SAAS,GAAG,IAAI,GAAG;AAGvC,KAAI,UAAU,EAAE,IAAI,SAAS;AAG7B,KAAI,KAAK,EAAE,EAAE,SAAS,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,OAAO,kBAAkB;AACtE,MAAI,OAAO,MAAM,GAAG,GAAG,GAAG;AAC1B,SAAO,EAAE,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,SAAS,GAAG,IAAI,GAAG;;AAG3D,KAAI,EAAE;AAGN,KAAI,IAAI,GAAG;AAGT,MAAI,IAAI,EAAE,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,IAAI;AAG5C,OAAK,EAAE,EAAE,KAAK,MAAM,EAAG,KAAI;AAG3B,MAAI,EAAE,KAAK,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,EAAE,UAAU,GAAG;AAC9C,KAAE,IAAI;AACN,UAAO;;;AAQX,KAAI,QAAQ,CAAC,GAAG,GAAG;AACnB,KAAI,KAAK,KAAK,CAAC,SAAS,EAAE,GACtB,UAAU,MAAM,KAAK,IAAI,OAAO,eAAe,EAAE,EAAE,CAAC,GAAG,KAAK,OAAO,EAAE,IAAI,GAAG,GAC5E,IAAI,KAAK,IAAI,GAAG,CAAC;AAKrB,KAAI,IAAI,KAAK,OAAO,KAAK,IAAI,KAAK,OAAO,EAAG,QAAO,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE;AAE9E,YAAW;AACX,MAAK,WAAW,EAAE,IAAI;AAMtB,KAAI,KAAK,IAAI,KAAK,IAAI,IAAI,OAAO;AAGjC,KAAI,mBAAmB,EAAE,MAAM,iBAAiB,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG;AAGhE,KAAI,EAAE,GAAG;AAGP,MAAI,SAAS,GAAG,KAAK,GAAG,EAAE;AAI1B,MAAI,oBAAoB,EAAE,GAAG,IAAI,GAAG,EAAE;AACpC,OAAI,KAAK;AAGT,OAAI,SAAS,mBAAmB,EAAE,MAAM,iBAAiB,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE;AAGlF,OAAI,CAAC,eAAe,EAAE,EAAE,CAAC,MAAM,KAAK,GAAG,KAAK,GAAG,GAAG,KAAK,eACrD,KAAI,SAAS,GAAG,KAAK,GAAG,EAAE;;;AAKhC,GAAE,IAAI;AACN,YAAW;AACX,MAAK,WAAW;AAEhB,QAAO,SAAS,GAAG,IAAI,GAAG;;AAe5B,IAAE,cAAc,SAAU,IAAI,IAAI;CAChC,IAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,KAAI,OAAO,KAAK,EACd,OAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,SAAS;MAChE;AACL,aAAW,IAAI,GAAG,WAAW;AAE7B,MAAI,OAAO,KAAK,EAAG,MAAK,KAAK;MACxB,YAAW,IAAI,GAAG,EAAE;AAEzB,MAAI,SAAS,IAAI,KAAK,EAAE,EAAE,IAAI,GAAG;AACjC,QAAM,eAAe,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,GAAG;;AAGhE,QAAO,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,MAAM;;AAkBhD,IAAE,sBAAsB,IAAE,OAAO,SAAU,IAAI,IAAI;CACjD,IAAI,IAAI,MACN,OAAO,EAAE;AAEX,KAAI,OAAO,KAAK,GAAG;AACjB,OAAK,KAAK;AACV,OAAK,KAAK;QACL;AACL,aAAW,IAAI,GAAG,WAAW;AAE7B,MAAI,OAAO,KAAK,EAAG,MAAK,KAAK;MACxB,YAAW,IAAI,GAAG,EAAE;;AAG3B,QAAO,SAAS,IAAI,KAAK,EAAE,EAAE,IAAI,GAAG;;AAWtC,IAAE,WAAW,WAAY;CACvB,IAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,SAAS;AAEvE,QAAO,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,MAAM;;AAQhD,IAAE,YAAY,IAAE,QAAQ,WAAY;AAClC,QAAO,SAAS,IAAI,KAAK,YAAY,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE;;AAS5D,IAAE,UAAU,IAAE,SAAS,WAAY;CACjC,IAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,SAAS;AAEvE,QAAO,EAAE,OAAO,GAAG,MAAM,MAAM;;AAqDjC,SAAS,eAAe,KAAG;CACzB,IAAI,GAAG,GAAG,IACR,kBAAkBD,IAAE,SAAS,GAC7B,MAAM,IACN,IAAIA,IAAE;AAER,KAAI,kBAAkB,GAAG;AACvB,SAAO;AACP,OAAK,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACpC,QAAKA,IAAE,KAAK;AACZ,OAAI,WAAW,GAAG;AAClB,OAAI,EAAG,QAAO,cAAc,EAAE;AAC9B,UAAO;;AAGT,MAAIA,IAAE;AACN,OAAK,IAAI;AACT,MAAI,WAAW,GAAG;AAClB,MAAI,EAAG,QAAO,cAAc,EAAE;YACrB,MAAM,EACf,QAAO;AAIT,QAAO,IAAI,OAAO,GAAI,MAAK;AAE3B,QAAO,MAAM;;AAIf,SAAS,WAAW,GAAG,OAAK,OAAK;AAC/B,KAAI,MAAM,CAAC,CAAC,KAAK,IAAIF,SAAO,IAAIC,MAC9B,OAAM,MAAM,kBAAkB,EAAE;;AAUpC,SAAS,oBAAoB,KAAG,GAAG,IAAI,WAAW;CAChD,IAAI,IAAI,GAAG,GAAG;AAGd,MAAK,IAAIC,IAAE,IAAI,KAAK,IAAI,KAAK,GAAI,GAAE;AAGnC,KAAI,EAAE,IAAI,GAAG;AACX,OAAK;AACL,OAAK;QACA;AACL,OAAK,KAAK,MAAM,IAAI,KAAK,SAAS;AAClC,OAAK;;AAMP,KAAI,QAAQ,IAAI,WAAW,EAAE;AAC7B,MAAKA,IAAE,MAAM,IAAI;AAEjB,KAAI,aAAa,KACf,KAAI,IAAI,GAAG;AACT,MAAI,KAAK,EAAG,MAAK,KAAK,MAAM;WACnB,KAAK,EAAG,MAAK,KAAK,KAAK;AAChC,MAAI,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,SAAS,MAAM,OAAS,MAAM;OAE3E,MAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,OACnDA,IAAE,KAAK,KAAK,IAAI,MAAM,MAAM,QAAQ,IAAI,IAAI,EAAE,GAAG,MAC/C,MAAM,IAAI,KAAK,MAAM,OAAOA,IAAE,KAAK,KAAK,IAAI,MAAM,MAAM;UAG3D,IAAI,GAAG;AACT,MAAI,KAAK,EAAG,MAAK,KAAK,MAAO;WACpB,KAAK,EAAG,MAAK,KAAK,MAAM;WACxB,KAAK,EAAG,MAAK,KAAK,KAAK;AAChC,OAAK,aAAa,KAAK,MAAM,MAAM,QAAQ,CAAC,aAAa,KAAK,KAAK,MAAM;OAEzE,OAAM,aAAa,KAAK,MAAM,KAAK,KAAK,KACvC,CAAC,aAAa,KAAK,KAAM,KAAK,KAAK,IAAI,OACrCA,IAAE,KAAK,KAAK,IAAI,MAAO,MAAM,QAAQ,IAAI,IAAI,EAAE,GAAG;AAIzD,QAAO;;AAOT,SAAS,YAAY,KAAK,QAAQ,SAAS;CACzC,IAAI,GACF,MAAM,CAAC,EAAE,EACT,MACA,IAAI,GACJ,OAAO,IAAI;AAEb,QAAO,IAAI,OAAO;AAChB,OAAK,OAAO,IAAI,QAAQ,QAAS,KAAI,SAAS;AAC9C,MAAI,MAAM,SAAS,QAAQ,IAAI,OAAO,IAAI,CAAC;AAC3C,OAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC1B,KAAI,IAAI,KAAK,UAAU,GAAG;AACxB,OAAI,IAAI,IAAI,OAAO,KAAK,EAAG,KAAI,IAAI,KAAK;AACxC,OAAI,IAAI,MAAM,IAAI,KAAK,UAAU;AACjC,OAAI,MAAM;;;AAKhB,QAAO,IAAI,SAAS;;AAStB,SAAS,OAAO,MAAM,GAAG;CACvB,IAAI,GAAG,KAAK;AAEZ,KAAI,EAAE,QAAQ,CAAE,QAAO;AAMvB,OAAM,EAAE,EAAE;AACV,KAAI,MAAM,IAAI;AACZ,MAAI,KAAK,KAAK,MAAM,EAAE;AACtB,OAAK,IAAI,QAAQ,GAAG,EAAE,EAAE,UAAU;QAC7B;AACL,MAAI;AACJ,MAAI;;AAGN,MAAK,aAAa;AAElB,KAAI,aAAa,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,KAAK,EAAE,CAAC;AAGlD,MAAK,IAAI,IAAI,GAAG,MAAM;EACpB,IAAI,QAAQ,EAAE,MAAM,EAAE;AACtB,MAAI,MAAM,MAAM,MAAM,CAAC,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE;;AAGtD,MAAK,aAAa;AAElB,QAAO;;AAOT,IAAI,UAAU,WAAY;CAGxB,SAAS,gBAAgB,GAAG,GAAG,MAAM;EACnC,IAAI,MACF,QAAQ,GACR,IAAI,EAAE;AAER,OAAK,IAAI,EAAE,OAAO,EAAE,MAAM;AACxB,UAAO,EAAE,KAAK,IAAI;AAClB,KAAE,KAAK,OAAO,OAAO;AACrB,WAAQ,OAAO,OAAO;;AAGxB,MAAI,MAAO,GAAE,QAAQ,MAAM;AAE3B,SAAO;;CAGT,SAAS,QAAQ,GAAG,KAAG,IAAI,IAAI;EAC7B,IAAI,GAAG;AAEP,MAAI,MAAM,GACR,KAAI,KAAK,KAAK,IAAI;MAElB,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IACtB,KAAI,EAAE,MAAME,IAAE,IAAI;AAChB,OAAI,EAAE,KAAKA,IAAE,KAAK,IAAI;AACtB;;AAKN,SAAO;;CAGT,SAAS,SAAS,GAAG,KAAG,IAAI,MAAM;EAChC,IAAI,IAAI;AAGR,SAAO,OAAO;AACZ,KAAE,OAAO;AACT,OAAI,EAAE,MAAMA,IAAE,MAAM,IAAI;AACxB,KAAE,MAAM,IAAI,OAAO,EAAE,MAAMA,IAAE;;AAI/B,SAAO,CAAC,EAAE,MAAM,EAAE,SAAS,GAAI,GAAE,OAAO;;AAG1C,QAAO,SAAU,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM;EACvC,IAAI,KAAK,GAAG,GAAG,GAAG,SAAS,MAAM,MAAM,OAAO,GAAG,IAAI,KAAK,MAAM,MAAM,IAAI,GAAG,IAAI,IAAI,KACnF,IAAI,IACJ,OAAO,EAAE,aACTC,SAAO,EAAE,KAAK,EAAE,IAAI,IAAI,IACxB,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,MAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,GAE9B,QAAO,IAAI,KACT,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,MAGpD,MAAM,GAAG,MAAM,KAAK,CAAC,KAAKA,SAAO,IAAIA,SAAO,EAAE;AAGlD,MAAI,MAAM;AACR,aAAU;AACV,OAAI,EAAE,IAAI,EAAE;SACP;AACL,UAAO;AACP,aAAU;AACV,OAAI,UAAU,EAAE,IAAI,QAAQ,GAAG,UAAU,EAAE,IAAI,QAAQ;;AAGzD,OAAK,GAAG;AACR,OAAK,GAAG;AACR,MAAI,IAAI,KAAKA,OAAK;AAClB,OAAK,EAAE,IAAI,EAAE;AAIb,OAAK,IAAI,GAAG,GAAG,OAAO,GAAG,MAAM,IAAI;AAEnC,MAAI,GAAG,MAAM,GAAG,MAAM,GAAI;AAE1B,MAAI,MAAM,MAAM;AACd,QAAK,KAAK,KAAK;AACf,QAAK,KAAK;aACD,GACT,MAAK,MAAM,EAAE,IAAI,EAAE,KAAK;MAExB,MAAK;AAGP,MAAI,KAAK,GAAG;AACV,MAAG,KAAK,EAAE;AACV,UAAO;SACF;AAGL,QAAK,KAAK,UAAU,IAAI;AACxB,OAAI;AAGJ,OAAI,MAAM,GAAG;AACX,QAAI;AACJ,SAAK,GAAG;AACR;AAGA,YAAQ,IAAI,MAAM,MAAM,MAAM,KAAK;AACjC,SAAI,IAAI,QAAQ,GAAG,MAAM;AACzB,QAAG,KAAK,IAAI,KAAK;AACjB,SAAI,IAAI,KAAK;;AAGf,WAAO,KAAK,IAAI;UAGX;AAGL,QAAI,QAAQ,GAAG,KAAK,KAAK;AAEzB,QAAI,IAAI,GAAG;AACT,UAAK,gBAAgB,IAAI,GAAG,KAAK;AACjC,UAAK,gBAAgB,IAAI,GAAG,KAAK;AACjC,UAAK,GAAG;AACR,UAAK,GAAG;;AAGV,SAAK;AACL,UAAM,GAAG,MAAM,GAAG,GAAG;AACrB,WAAO,IAAI;AAGX,WAAO,OAAO,IAAK,KAAI,UAAU;AAEjC,SAAK,GAAG,OAAO;AACf,OAAG,QAAQ,EAAE;AACb,UAAM,GAAG;AAET,QAAI,GAAG,MAAM,OAAO,EAAG,GAAE;AAEzB,OAAG;AACD,SAAI;AAGJ,WAAM,QAAQ,IAAI,KAAK,IAAI,KAAK;AAGhC,SAAI,MAAM,GAAG;AAGX,aAAO,IAAI;AACX,UAAI,MAAM,KAAM,QAAO,OAAO,QAAQ,IAAI,MAAM;AAGhD,UAAI,OAAO,MAAM;AAUjB,UAAI,IAAI,GAAG;AACT,WAAI,KAAK,KAAM,KAAI,OAAO;AAG1B,cAAO,gBAAgB,IAAI,GAAG,KAAK;AACnC,eAAQ,KAAK;AACb,cAAO,IAAI;AAGX,aAAM,QAAQ,MAAM,KAAK,OAAO,KAAK;AAGrC,WAAI,OAAO,GAAG;AACZ;AAGA,iBAAS,MAAM,KAAK,QAAQ,KAAK,IAAI,OAAO,KAAK;;aAE9C;AAKL,WAAI,KAAK,EAAG,OAAM,IAAI;AACtB,cAAO,GAAG,OAAO;;AAGnB,cAAQ,KAAK;AACb,UAAI,QAAQ,KAAM,MAAK,QAAQ,EAAE;AAGjC,eAAS,KAAK,MAAM,MAAM,KAAK;AAG/B,UAAI,OAAO,IAAI;AACb,cAAO,IAAI;AAGX,aAAM,QAAQ,IAAI,KAAK,IAAI,KAAK;AAGhC,WAAI,MAAM,GAAG;AACX;AAGA,iBAAS,KAAK,KAAK,OAAO,KAAK,IAAI,MAAM,KAAK;;;AAIlD,aAAO,IAAI;gBACF,QAAQ,GAAG;AACpB;AACA,YAAM,CAAC,EAAE;;AAIX,QAAG,OAAO;AAGV,SAAI,OAAO,IAAI,GACb,KAAI,UAAU,GAAG,OAAO;UACnB;AACL,YAAM,CAAC,GAAG,IAAI;AACd,aAAO;;cAGD,OAAO,MAAM,IAAI,OAAO,KAAK,MAAM;AAE7C,WAAO,IAAI,OAAO,KAAK;;AAIzB,OAAI,CAAC,GAAG,GAAI,IAAG,OAAO;;AAIxB,MAAI,WAAW,GAAG;AAChB,KAAE,IAAI;AACN,aAAU;SACL;AAGL,QAAK,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AACzC,KAAE,IAAI,IAAI,IAAI,UAAU;AAExB,YAAS,GAAG,KAAK,KAAK,EAAE,IAAI,IAAI,IAAI,IAAI,KAAK;;AAG/C,SAAO;;IAEP;AAOH,SAAS,SAAS,GAAG,IAAI,IAAI,aAAa;CACzC,IAAIC,UAAQ,GAAG,GAAG,GAAG,IAAI,SAAS,GAAG,IAAI,KACvC,OAAO,EAAE;AAGX,KAAK,KAAI,MAAM,MAAM;AACnB,OAAK,EAAE;AAGP,MAAI,CAAC,GAAI,QAAO;AAWhB,OAAK,WAAS,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AAC9C,MAAI,KAAKA;AAGT,MAAI,IAAI,GAAG;AACT,QAAK;AACL,OAAI;AACJ,OAAI,GAAG,MAAM;AAGb,QAAK,IAAI,QAAQ,IAAIA,WAAS,IAAI,EAAE,GAAG,KAAK;SACvC;AACL,SAAM,KAAK,MAAM,IAAI,KAAK,SAAS;AACnC,OAAI,GAAG;AACP,OAAI,OAAO,EACT,KAAI,aAAa;AAGf,WAAO,OAAO,KAAM,IAAG,KAAK,EAAE;AAC9B,QAAI,KAAK;AACT,eAAS;AACT,SAAK;AACL,QAAI,IAAI,WAAW;SAEnB,OAAM;QAEH;AACL,QAAI,IAAI,GAAG;AAGX,SAAK,WAAS,GAAG,KAAK,IAAI,KAAK,GAAI;AAGnC,SAAK;AAIL,QAAI,IAAI,WAAWA;AAGnB,SAAK,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,WAAS,IAAI,EAAE,GAAG,KAAK;;;AAK5D,gBAAc,eAAe,KAAK,KAChC,GAAG,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,WAAS,IAAI,EAAE;AAMxE,YAAU,KAAK,KACV,MAAM,iBAAiB,MAAM,KAAK,OAAO,EAAE,IAAI,IAAI,IAAI,MACxD,KAAK,KAAK,MAAM,MAAM,MAAM,KAAK,eAAe,MAAM,MAGpD,IAAI,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,WAAS,EAAE,GAAG,IAAI,GAAG,MAAM,MAAM,KAAM,KACvE,OAAO,EAAE,IAAI,IAAI,IAAI;AAE3B,MAAI,KAAK,KAAK,CAAC,GAAG,IAAI;AACpB,MAAG,SAAS;AACZ,OAAI,SAAS;AAGX,UAAM,EAAE,IAAI;AAGZ,OAAG,KAAK,QAAQ,KAAK,WAAW,KAAK,YAAY,SAAS;AAC1D,MAAE,IAAI,CAAC,MAAM;SAIb,IAAG,KAAK,EAAE,IAAI;AAGhB,UAAO;;AAIT,MAAI,KAAK,GAAG;AACV,MAAG,SAAS;AACZ,OAAI;AACJ;SACK;AACL,MAAG,SAAS,MAAM;AAClB,OAAI,QAAQ,IAAI,WAAW,EAAE;AAI7B,MAAG,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAIA,WAAS,EAAE,GAAG,QAAQ,IAAI,EAAE,GAAG,KAAK,IAAI;;AAG7E,MAAI,QACF,SAGE,KAAI,OAAO,GAAG;AAGZ,QAAK,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AACzC,OAAI,GAAG,MAAM;AACb,QAAK,IAAI,GAAG,KAAK,IAAI,KAAK,GAAI;AAG9B,OAAI,KAAK,GAAG;AACV,MAAE;AACF,QAAI,GAAG,MAAM,KAAM,IAAG,KAAK;;AAG7B;SACK;AACL,MAAG,QAAQ;AACX,OAAI,GAAG,QAAQ,KAAM;AACrB,MAAG,SAAS;AACZ,OAAI;;AAMV,OAAK,IAAI,GAAG,QAAQ,GAAG,EAAE,OAAO,GAAI,IAAG,KAAK;;AAG9C,KAAI,UAGF;MAAI,EAAE,IAAI,KAAK,MAAM;AAGnB,KAAE,IAAI;AACN,KAAE,IAAI;aAGG,EAAE,IAAI,KAAK,MAAM;AAG1B,KAAE,IAAI;AACN,KAAE,IAAI,CAAC,EAAE;;;AAKb,QAAO;;AAIT,SAAS,eAAe,GAAG,OAAO,IAAI;AACpC,KAAI,CAAC,EAAE,UAAU,CAAE,QAAO,kBAAkB,EAAE;CAC9C,IAAI,GACF,IAAI,EAAE,GACN,MAAM,eAAe,EAAE,EAAE,EACzB,MAAM,IAAI;AAEZ,KAAI,OAAO;AACT,MAAI,OAAO,IAAI,KAAK,OAAO,EACzB,OAAM,IAAI,OAAO,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE,GAAG,cAAc,EAAE;WAClD,MAAM,EACf,OAAM,IAAI,OAAO,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;AAG1C,QAAM,OAAO,EAAE,IAAI,IAAI,MAAM,QAAQ,EAAE;YAC9B,IAAI,GAAG;AAChB,QAAM,OAAO,cAAc,CAAC,IAAI,EAAE,GAAG;AACrC,MAAI,OAAO,IAAI,KAAK,OAAO,EAAG,QAAO,cAAc,EAAE;YAC5C,KAAK,KAAK;AACnB,SAAO,cAAc,IAAI,IAAI,IAAI;AACjC,MAAI,OAAO,IAAI,KAAK,IAAI,KAAK,EAAG,OAAM,MAAM,MAAM,cAAc,EAAE;QAC7D;AACL,OAAK,IAAI,IAAI,KAAK,IAAK,OAAM,IAAI,MAAM,GAAG,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;AACjE,MAAI,OAAO,IAAI,KAAK,OAAO,GAAG;AAC5B,OAAI,IAAI,MAAM,IAAK,QAAO;AAC1B,UAAO,cAAc,EAAE;;;AAI3B,QAAO;;AAKT,SAAS,kBAAkB,UAAQ,GAAG;CACpC,IAAI,IAAIA,SAAO;AAGf,MAAM,KAAK,UAAU,KAAK,IAAI,KAAK,GAAI;AACvC,QAAO;;AAIT,SAAS,QAAQ,MAAM,IAAI,IAAI;AAC7B,KAAI,KAAK,gBAAgB;AAGvB,aAAW;AACX,MAAI,GAAI,MAAK,YAAY;AACzB,QAAM,MAAM,uBAAuB;;AAErC,QAAO,SAAS,IAAI,KAAK,KAAK,EAAE,IAAI,GAAG,KAAK;;AAI9C,SAAS,MAAM,MAAM,IAAI,IAAI;AAC3B,KAAI,KAAK,aAAc,OAAM,MAAM,uBAAuB;AAC1D,QAAO,SAAS,IAAI,KAAK,GAAG,EAAE,IAAI,IAAI,KAAK;;AAI7C,SAAS,aAAa,UAAQ;CAC5B,IAAI,IAAIA,SAAO,SAAS,GACtB,MAAM,IAAI,WAAW;AAEvB,KAAIA,SAAO;AAGX,KAAI,GAAG;AAGL,SAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAG7B,OAAK,IAAIA,SAAO,IAAI,KAAK,IAAI,KAAK,GAAI;;AAGxC,QAAO;;AAIT,SAAS,cAAc,GAAG;CACxB,IAAI,KAAK;AACT,QAAO,KAAM,OAAM;AACnB,QAAO;;AAWT,SAAS,OAAO,MAAM,GAAG,GAAG,IAAI;CAC9B,IAAI,aACF,IAAI,IAAI,KAAK,EAAE,EAIf,IAAI,KAAK,KAAK,KAAK,WAAW,EAAE;AAElC,YAAW;AAEX,UAAS;AACP,MAAI,IAAI,GAAG;AACT,OAAI,EAAE,MAAM,EAAE;AACd,OAAI,SAAS,EAAE,GAAG,EAAE,CAAE,eAAc;;AAGtC,MAAI,UAAU,IAAI,EAAE;AACpB,MAAI,MAAM,GAAG;AAGX,OAAI,EAAE,EAAE,SAAS;AACjB,OAAI,eAAe,EAAE,EAAE,OAAO,EAAG,GAAE,EAAE,EAAE;AACvC;;AAGF,MAAI,EAAE,MAAM,EAAE;AACd,WAAS,EAAE,GAAG,EAAE;;AAGlB,YAAW;AAEX,QAAO;;AAIT,SAAS,MAAM,GAAG;AAChB,QAAO,EAAE,EAAE,EAAE,EAAE,SAAS,KAAK;;AAO/B,SAAS,SAAS,MAAM,MAAM,GAAG;CAC/B,IAAI,GAAG,GACL,IAAI,IAAI,KAAK,KAAK,GAAG,EACrB,IAAI;AAEN,QAAO,EAAE,IAAI,KAAK,SAAS;AACzB,MAAI,IAAI,KAAK,KAAK,GAAG;AAGrB,MAAI,CAAC,EAAE,GAAG;AACR,OAAI;AACJ;;AAGF,MAAI,EAAE,IAAI,EAAE;AAEZ,MAAI,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM,EAChC,KAAI;;AAIR,QAAO;;AAmCT,SAAS,mBAAmB,GAAG,IAAI;CACjC,IAAI,aAAa,OAAO,GAAGC,OAAKC,OAAK,GAAG,KACtC,MAAM,GACN,IAAI,GACJ,IAAI,GACJ,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,GAE3B,QAAO,IAAI,KAAK,EAAE,IACd,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,WAC5B,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAM;AAGpC,KAAI,MAAM,MAAM;AACd,aAAW;AACX,QAAM;OAEN,OAAM;AAGR,KAAI,IAAI,KAAK,OAAQ;AAGrB,QAAO,EAAE,IAAI,IAAI;AAGf,MAAI,EAAE,MAAM,EAAE;AACd,OAAK;;AAKP,SAAQ,KAAK,IAAI,QAAQ,GAAG,EAAE,CAAC,GAAG,KAAK,OAAO,IAAI,IAAI;AACtD,QAAO;AACP,eAAc,QAAM,QAAM,IAAI,KAAK,EAAE;AACrC,MAAK,YAAY;AAEjB,UAAS;AACP,UAAM,SAASD,MAAI,MAAM,EAAE,EAAE,KAAK,EAAE;AACpC,gBAAc,YAAY,MAAM,EAAE,EAAE;AACpC,MAAIC,MAAI,KAAK,OAAOD,OAAK,aAAa,KAAK,EAAE,CAAC;AAE9C,MAAI,eAAe,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,KAAK,eAAeC,MAAI,EAAE,CAAC,MAAM,GAAG,IAAI,EAAE;AAC7E,OAAI;AACJ,UAAO,IAAK,SAAM,SAASA,MAAI,MAAMA,MAAI,EAAE,KAAK,EAAE;AAOlD,OAAI,MAAM,KAER,KAAI,MAAM,KAAK,oBAAoBA,MAAI,GAAG,MAAM,OAAO,IAAI,IAAI,EAAE;AAC/D,SAAK,YAAY,OAAO;AACxB,kBAAc,QAAM,IAAI,IAAI,KAAK,EAAE;AACnC,QAAI;AACJ;SAEA,QAAO,SAASA,OAAK,KAAK,YAAY,IAAI,IAAI,WAAW,KAAK;QAE3D;AACL,SAAK,YAAY;AACjB,WAAOA;;;AAIX,UAAM;;;AAoBV,SAAS,iBAAiB,GAAG,IAAI;CAC/B,IAAI,GAAG,IAAI,aAAa,GAAG,WAAW,KAAKA,OAAK,GAAG,KAAK,IAAI,IAC1D,IAAI,GACJ,QAAQ,IACR,IAAI,GACJ,KAAK,EAAE,GACP,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,KAAI,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,KAAK,GAAG,MAAM,KAAK,GAAG,UAAU,EACjE,QAAO,IAAI,KAAK,MAAM,CAAC,GAAG,KAAK,YAAS,EAAE,KAAK,IAAI,MAAM,KAAK,IAAI,EAAE;AAGtE,KAAI,MAAM,MAAM;AACd,aAAW;AACX,QAAM;OAEN,OAAM;AAGR,MAAK,YAAY,OAAO;AACxB,KAAI,eAAe,GAAG;AACtB,MAAK,EAAE,OAAO,EAAE;AAEhB,KAAI,KAAK,IAAI,IAAI,EAAE,EAAE,GAAG,iBAAQ;AAa9B,SAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,EAAE,OAAO,EAAE,GAAG,GAAG;AACtD,OAAI,EAAE,MAAM,EAAE;AACd,OAAI,eAAe,EAAE,EAAE;AACvB,QAAK,EAAE,OAAO,EAAE;AAChB;;AAGF,MAAI,EAAE;AAEN,MAAI,KAAK,GAAG;AACV,OAAI,IAAI,KAAK,OAAO,EAAE;AACtB;QAEA,KAAI,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,EAAE,CAAC;QAEhC;AAKL,MAAI,QAAQ,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG;AAC5C,MAAI,iBAAiB,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,MAAM,CAAC,KAAK,EAAE;AAC1E,OAAK,YAAY;AAEjB,SAAO,MAAM,OAAO,SAAS,GAAG,IAAI,IAAI,WAAW,KAAK,GAAG;;AAI7D,MAAK;AAKL,SAAM,YAAY,IAAI,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE;AAC3D,MAAK,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE;AACjC,eAAc;AAEd,UAAS;AACP,cAAY,SAAS,UAAU,MAAM,GAAG,EAAE,KAAK,EAAE;AACjD,MAAIA,MAAI,KAAK,OAAO,WAAW,IAAI,KAAK,YAAY,EAAE,KAAK,EAAE,CAAC;AAE9D,MAAI,eAAe,EAAE,EAAE,CAAC,MAAM,GAAG,IAAI,KAAK,eAAeA,MAAI,EAAE,CAAC,MAAM,GAAG,IAAI,EAAE;AAC7E,WAAMA,MAAI,MAAM,EAAE;AAIlB,OAAI,MAAM,EAAG,SAAMA,MAAI,KAAK,QAAQ,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC;AACrE,WAAM,OAAOA,OAAK,IAAI,KAAK,EAAE,EAAE,KAAK,EAAE;AAQtC,OAAI,MAAM,KACR,KAAI,oBAAoBA,MAAI,GAAG,MAAM,OAAO,IAAI,IAAI,EAAE;AACpD,SAAK,YAAY,OAAO;AACxB,QAAI,YAAY,IAAI,OAAO,GAAG,MAAM,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,KAAK,EAAE;AAC3D,SAAK,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE;AACjC,kBAAc,MAAM;SAEpB,QAAO,SAASA,OAAK,KAAK,YAAY,IAAI,IAAI,WAAW,KAAK;QAE3D;AACL,SAAK,YAAY;AACjB,WAAOA;;;AAIX,UAAM;AACN,iBAAe;;;AAMnB,SAAS,kBAAkB,GAAG;AAE5B,QAAO,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE;;AAO9B,SAAS,aAAa,GAAG,KAAK;CAC5B,IAAI,GAAG,GAAG;AAIV,MAAK,IAAI,IAAI,QAAQ,IAAI,IAAI,GAAI,OAAM,IAAI,QAAQ,KAAK,GAAG;AAG3D,MAAK,IAAI,IAAI,OAAO,KAAK,IAAI,GAAG;AAG9B,MAAI,IAAI,EAAG,KAAI;AACf,OAAK,CAAC,IAAI,MAAM,IAAI,EAAE;AACtB,QAAM,IAAI,UAAU,GAAG,EAAE;YAChB,IAAI,EAGb,KAAI,IAAI;AAIV,MAAK,IAAI,GAAG,IAAI,WAAW,EAAE,KAAK,IAAI;AAGtC,MAAK,MAAM,IAAI,QAAQ,IAAI,WAAW,MAAM,EAAE,KAAK,IAAI,EAAE;AACzD,OAAM,IAAI,MAAM,GAAG,IAAI;AAEvB,KAAI,KAAK;AACP,SAAO;AACP,IAAE,IAAI,IAAI,IAAI,IAAI;AAClB,IAAE,IAAI,EAAE;AAMR,OAAK,IAAI,KAAK;AACd,MAAI,IAAI,EAAG,MAAK;AAEhB,MAAI,IAAI,KAAK;AACX,OAAI,EAAG,GAAE,EAAE,KAAK,CAAC,IAAI,MAAM,GAAG,EAAE,CAAC;AACjC,QAAK,OAAO,UAAU,IAAI,KAAM,GAAE,EAAE,KAAK,CAAC,IAAI,MAAM,GAAG,KAAK,SAAS,CAAC;AACtE,SAAM,IAAI,MAAM,EAAE;AAClB,OAAI,WAAW,IAAI;QAEnB,MAAK;AAGP,SAAO,KAAM,QAAO;AACpB,IAAE,EAAE,KAAK,CAAC,IAAI;AAEd,MAAI,UAGF;OAAI,EAAE,IAAI,EAAE,YAAY,MAAM;AAG5B,MAAE,IAAI;AACN,MAAE,IAAI;cAGG,EAAE,IAAI,EAAE,YAAY,MAAM;AAGnC,MAAE,IAAI;AACN,MAAE,IAAI,CAAC,EAAE;;;QAIR;AAGL,IAAE,IAAI;AACN,IAAE,IAAI,CAAC,EAAE;;AAGX,QAAO;;AAOT,SAAS,WAAW,GAAG,KAAK;CAC1B,IAAI,MAAM,MAAM,SAAS,GAAG,SAAS,KAAK,GAAG,IAAI;AAEjD,KAAI,IAAI,QAAQ,IAAI,GAAG,IAAI;AACzB,QAAM,IAAI,QAAQ,gBAAgB,KAAK;AACvC,MAAI,UAAU,KAAK,IAAI,CAAE,QAAO,aAAa,GAAG,IAAI;YAC3C,QAAQ,cAAc,QAAQ,OAAO;AAC9C,MAAI,CAAC,CAAC,IAAK,GAAE,IAAI;AACjB,IAAE,IAAI;AACN,IAAE,IAAI;AACN,SAAO;;AAGT,KAAI,MAAM,KAAK,IAAI,EAAG;AACpB,SAAO;AACP,QAAM,IAAI,aAAa;YACd,SAAS,KAAK,IAAI,CAC3B,QAAO;UACE,QAAQ,KAAK,IAAI,CAC1B,QAAO;KAEP,OAAM,MAAM,kBAAkB,IAAI;AAIpC,KAAI,IAAI,OAAO,KAAK;AAEpB,KAAI,IAAI,GAAG;AACT,MAAI,CAAC,IAAI,MAAM,IAAI,EAAE;AACrB,QAAM,IAAI,UAAU,GAAG,EAAE;OAEzB,OAAM,IAAI,MAAM,EAAE;AAKpB,KAAI,IAAI,QAAQ,IAAI;AACpB,WAAU,KAAK;AACf,QAAO,EAAE;AAET,KAAI,SAAS;AACX,QAAM,IAAI,QAAQ,KAAK,GAAG;AAC1B,QAAM,IAAI;AACV,MAAI,MAAM;AAGV,YAAU,OAAO,MAAM,IAAI,KAAK,KAAK,EAAE,GAAG,IAAI,EAAE;;AAGlD,MAAK,YAAY,KAAK,MAAM,KAAK;AACjC,MAAK,GAAG,SAAS;AAGjB,MAAK,IAAI,IAAI,GAAG,OAAO,GAAG,EAAE,EAAG,IAAG,KAAK;AACvC,KAAI,IAAI,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,EAAE;AACnC,GAAE,IAAI,kBAAkB,IAAI,GAAG;AAC/B,GAAE,IAAI;AACN,YAAW;AAQX,KAAI,QAAS,KAAI,OAAO,GAAG,SAAS,MAAM,EAAE;AAG5C,KAAI,EAAG,KAAI,EAAE,MAAM,KAAK,IAAI,EAAE,GAAG,KAAK,QAAQ,GAAG,EAAE,GAAG,QAAQ,IAAI,GAAG,EAAE,CAAC;AACxE,YAAW;AAEX,QAAO;;AAST,SAAS,KAAK,MAAM,GAAG;CACrB,IAAI,GACF,MAAM,EAAE,EAAE;AAEZ,KAAI,MAAM,EACR,QAAO,EAAE,QAAQ,GAAG,IAAI,aAAa,MAAM,GAAG,GAAG,EAAE;AAQrD,KAAI,MAAM,KAAK,KAAK,IAAI;AACxB,KAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,KAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,EAAE,CAAC;AAC9B,KAAI,aAAa,MAAM,GAAG,GAAG,EAAE;CAG/B,IAAI,QACF,KAAK,IAAI,KAAK,EAAE,EAChB,MAAM,IAAI,KAAK,GAAG,EAClB,MAAM,IAAI,KAAK,GAAG;AACpB,QAAO,MAAM;AACX,WAAS,EAAE,MAAM,EAAE;AACnB,MAAI,EAAE,MAAM,GAAG,KAAK,OAAO,MAAM,IAAI,MAAM,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;;AAGlE,QAAO;;AAKT,SAAS,aAAa,MAAM,GAAG,GAAG,GAAG,cAAc;CACjD,IAAI,GAAG,GAAG,GAAG,IACX,IAAI,GACJ,KAAK,KAAK,WACV,IAAI,KAAK,KAAK,KAAK,SAAS;AAE9B,YAAW;AACX,MAAK,EAAE,MAAM,EAAE;AACf,KAAI,IAAI,KAAK,EAAE;AAEf,UAAS;AACP,MAAI,OAAO,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK,MAAM,IAAI,EAAE,IAAI,EAAE;AACnD,MAAI,eAAe,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE;AACzC,MAAI,OAAO,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK,MAAM,IAAI,EAAE,IAAI,EAAE;AACnD,MAAI,EAAE,KAAK,EAAE;AAEb,MAAI,EAAE,EAAE,OAAO,KAAK,GAAG;AACrB,QAAK,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,MAAM;AACjC,OAAI,KAAK,GAAI;;AAGf,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ;;AAGF,YAAW;AACX,GAAE,EAAE,SAAS,IAAI;AAEjB,QAAO;;AAKT,SAAS,QAAQ,KAAG,GAAG;CACrB,IAAI,IAAIJ;AACR,QAAO,EAAE,EAAG,MAAKA;AACjB,QAAO;;AAKT,SAAS,iBAAiB,MAAM,GAAG;CACjC,IAAI,GACF,QAAQ,EAAE,IAAI,GACd,KAAK,MAAM,MAAM,KAAK,WAAW,EAAE,EACnC,SAAS,GAAG,MAAM,GAAI;AAExB,KAAI,EAAE,KAAK;AAEX,KAAI,EAAE,IAAI,OAAO,EAAE;AACjB,aAAW,QAAQ,IAAI;AACvB,SAAO;;AAGT,KAAI,EAAE,SAAS,GAAG;AAElB,KAAI,EAAE,QAAQ,CACZ,YAAW,QAAQ,IAAI;MAClB;AACL,MAAI,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;AAGxB,MAAI,EAAE,IAAI,OAAO,EAAE;AACjB,cAAW,MAAM,EAAE,GAAI,QAAQ,IAAI,IAAM,QAAQ,IAAI;AACrD,UAAO;;AAGT,aAAW,MAAM,EAAE,GAAI,QAAQ,IAAI,IAAM,QAAQ,IAAI;;AAGvD,QAAO,EAAE,MAAM,GAAG,CAAC,KAAK;;AAS1B,SAAS,eAAe,GAAG,SAAS,IAAI,IAAI;CAC1C,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,SAAS,KAAK,IAAI,GACxC,OAAO,EAAE,aACT,QAAQ,OAAO,KAAK;AAEtB,KAAI,OAAO;AACT,aAAW,IAAI,GAAG,WAAW;AAC7B,MAAI,OAAO,KAAK,EAAG,MAAK,KAAK;MACxB,YAAW,IAAI,GAAG,EAAE;QACpB;AACL,OAAK,KAAK;AACV,OAAK,KAAK;;AAGZ,KAAI,CAAC,EAAE,UAAU,CACf,OAAM,kBAAkB,EAAE;MACrB;AACL,QAAM,eAAe,EAAE;AACvB,MAAI,IAAI,QAAQ,IAAI;AAOpB,MAAI,OAAO;AACT,UAAO;AACP,OAAI,WAAW,GACb,MAAK,KAAK,IAAI;YACL,WAAW,EACpB,MAAK,KAAK,IAAI;QAGhB,QAAO;AAOT,MAAI,KAAK,GAAG;AACV,SAAM,IAAI,QAAQ,KAAK,GAAG;AAC1B,OAAI,IAAI,KAAK,EAAE;AACf,KAAE,IAAI,IAAI,SAAS;AACnB,KAAE,IAAI,YAAY,eAAe,EAAE,EAAE,IAAI,KAAK;AAC9C,KAAE,IAAI,EAAE,EAAE;;AAGZ,OAAK,YAAY,KAAK,IAAI,KAAK;AAC/B,MAAI,MAAM,GAAG;AAGb,SAAO,GAAG,EAAE,QAAQ,GAAI,IAAG,KAAK;AAEhC,MAAI,CAAC,GAAG,GACN,OAAM,QAAQ,SAAS;OAClB;AACL,OAAI,IAAI,EACN;QACK;AACL,QAAI,IAAI,KAAK,EAAE;AACf,MAAE,IAAI;AACN,MAAE,IAAI;AACN,QAAI,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK;AACjC,SAAK,EAAE;AACP,QAAI,EAAE;AACN,cAAU;;AAIZ,OAAI,GAAG;AACP,OAAI,OAAO;AACX,aAAU,WAAW,GAAG,KAAK,OAAO,KAAK;AAEzC,aAAU,KAAK,KACV,MAAM,KAAK,KAAK,aAAa,OAAO,KAAK,QAAQ,EAAE,IAAI,IAAI,IAAI,MAChE,IAAI,KAAK,MAAM,MAAM,OAAO,KAAK,WAAW,OAAO,KAAK,GAAG,KAAK,KAAK,KACrE,QAAQ,EAAE,IAAI,IAAI,IAAI;AAE1B,MAAG,SAAS;AAEZ,OAAI,QAGF,QAAO,EAAE,GAAG,EAAE,MAAM,OAAO,IAAI;AAC7B,OAAG,MAAM;AACT,QAAI,CAAC,IAAI;AACP,OAAE;AACF,QAAG,QAAQ,EAAE;;;AAMnB,QAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,IAAI,EAAE;AAGtC,QAAK,IAAI,GAAG,MAAM,IAAI,IAAI,KAAK,IAAK,QAAO,SAAS,OAAO,GAAG,GAAG;AAGjE,OAAI,OAAO;AACT,QAAI,MAAM,EACR,KAAI,WAAW,MAAM,WAAW,GAAG;AACjC,SAAI,WAAW,KAAK,IAAI;AACxB,UAAK,EAAE,KAAK,MAAM,GAAG,MAAO,QAAO;AACnC,UAAK,YAAY,KAAK,MAAM,QAAQ;AACpC,UAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,IAAI,EAAE;AAGtC,UAAK,IAAI,GAAG,MAAM,MAAM,IAAI,KAAK,IAAK,QAAO,SAAS,OAAO,GAAG,GAAG;UAEnE,OAAM,IAAI,OAAO,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;AAI5C,UAAO,OAAO,IAAI,IAAI,MAAM,QAAQ;cAC3B,IAAI,GAAG;AAChB,WAAO,EAAE,GAAI,OAAM,MAAM;AACzB,UAAM,OAAO;cAET,EAAE,IAAI,IAAK,MAAK,KAAK,KAAK,KAAO,QAAO;YACnC,IAAI,IAAK,OAAM,IAAI,MAAM,GAAG,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;;AAIhE,SAAO,WAAW,KAAK,OAAO,WAAW,IAAI,OAAO,WAAW,IAAI,OAAO,MAAM;;AAGlF,QAAO,EAAE,IAAI,IAAI,MAAM,MAAM;;AAK/B,SAAS,SAAS,KAAK,KAAK;AAC1B,KAAI,IAAI,SAAS,KAAK;AACpB,MAAI,SAAS;AACb,SAAO;;;AA2DX,SAAS,IAAI,GAAG;AACd,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK;;AAU1B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAW3B,SAAS,MAAM,GAAG;AAChB,QAAO,IAAI,KAAK,EAAE,CAAC,OAAO;;AAY5B,SAASK,MAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK,EAAE;;AAW5B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAW3B,SAAS,MAAM,GAAG;AAChB,QAAO,IAAI,KAAK,EAAE,CAAC,OAAO;;AAW5B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAW3B,SAAS,MAAM,GAAG;AAChB,QAAO,IAAI,KAAK,EAAE,CAAC,OAAO;;AA6B5B,SAAS,MAAM,GAAG,GAAG;AACnB,KAAI,IAAI,KAAK,EAAE;AACf,KAAI,IAAI,KAAK,EAAE;CACf,IAAI,GACF,KAAK,KAAK,WACV,KAAK,KAAK,UACV,MAAM,KAAK;AAGb,KAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EACb,KAAI,IAAI,KAAK,IAAI;UAGR,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AACvB,MAAI,MAAM,MAAM,KAAK,EAAE,CAAC,MAAM,EAAE,IAAI,IAAI,MAAO,IAAK;AACpD,IAAE,IAAI,EAAE;YAGC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE;AAC7B,MAAI,EAAE,IAAI,IAAI,MAAM,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,EAAE;AAC/C,IAAE,IAAI,EAAE;YAGC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE;AAC7B,MAAI,MAAM,MAAM,KAAK,EAAE,CAAC,MAAM,GAAI;AAClC,IAAE,IAAI,EAAE;YAGC,EAAE,IAAI,GAAG;AAClB,OAAK,YAAY;AACjB,OAAK,WAAW;AAChB,MAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,EAAE,CAAC;AACnC,MAAI,MAAM,MAAM,KAAK,EAAE;AACvB,OAAK,YAAY;AACjB,OAAK,WAAW;AAChB,MAAI,EAAE,IAAI,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE;OAEpC,KAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,EAAE,CAAC;AAGrC,QAAO;;AAWT,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAU3B,SAAS,KAAK,GAAG;AACf,QAAO,SAAS,IAAI,IAAI,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE;;AAY9C,SAAS,MAAM,GAAG,OAAK,OAAK;AAC1B,QAAO,IAAI,KAAK,EAAE,CAAC,MAAMT,OAAKC,MAAI;;AAsBpC,SAAS,OAAO,KAAK;AACnB,KAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,OAAM,MAAM,eAAe,kBAAkB;CAClF,IAAI,GAAG,GAAG,GACR,cAAc,IAAI,aAAa,MAC/B,KAAK;EACH;EAAa;EAAG;EAChB;EAAY;EAAG;EACf;EAAY,CAAC;EAAW;EACxB;EAAY;EAAG;EACf;EAAQ;EAAG;EACX;EAAQ,CAAC;EAAW;EACpB;EAAU;EAAG;EACd;AAEH,MAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;AACjC,MAAI,IAAI,GAAG,IAAI,YAAa,MAAK,KAAK,SAAS;AAC/C,OAAK,IAAI,IAAI,QAAQ,KAAK,EACxB,KAAI,UAAU,EAAE,KAAK,KAAK,KAAK,GAAG,IAAI,MAAM,KAAK,GAAG,IAAI,GAAI,MAAK,KAAK;MACjE,OAAM,MAAM,kBAAkB,IAAI,OAAO,EAAE;;AAIpD,KAAI,IAAI,UAAU,YAAa,MAAK,KAAK,SAAS;AAClD,MAAK,IAAI,IAAI,QAAQ,KAAK,EACxB,KAAI,MAAM,QAAQ,MAAM,SAAS,MAAM,KAAK,MAAM,EAChD,KAAI,EACF,KAAI,OAAO,UAAU,eAAe,WACjC,OAAO,mBAAmB,OAAO,aAClC,MAAK,KAAK;KAEV,OAAM,MAAM,kBAAkB;KAGhC,MAAK,KAAK;KAGZ,OAAM,MAAM,kBAAkB,IAAI,OAAO,EAAE;AAI/C,QAAO;;AAWT,SAAS,IAAI,GAAG;AACd,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK;;AAW1B,SAASS,OAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAS3B,SAASC,QAAM,KAAK;CAClB,IAAI,GAAG,GAAG;CASV,SAASC,UAAQ,GAAG;EAClB,IAAI,GAAGC,KAAG,GACR,IAAI;AAGN,MAAI,EAAE,aAAaD,WAAU,QAAO,IAAIA,UAAQ,EAAE;AAIlD,IAAE,cAAcA;AAEhB,MAAI,kBAAkB,EAAE,EAAE;AACxB,KAAE,IAAI,EAAE;AAER,OAAI,SACF,KAAI,CAAC,EAAE,KAAK,EAAE,IAAIA,UAAQ,MAAM;AAG9B,MAAE,IAAI;AACN,MAAE,IAAI;cACG,EAAE,IAAIA,UAAQ,MAAM;AAG7B,MAAE,IAAI;AACN,MAAE,IAAI,CAAC,EAAE;UACJ;AACL,MAAE,IAAI,EAAE;AACR,MAAE,IAAI,EAAE,EAAE,OAAO;;QAEd;AACL,MAAE,IAAI,EAAE;AACR,MAAE,IAAI,EAAE,IAAI,EAAE,EAAE,OAAO,GAAG,EAAE;;AAG9B;;AAGF,MAAI,OAAO;AAEX,MAAI,MAAM,UAAU;AAClB,OAAI,MAAM,GAAG;AACX,MAAE,IAAI,IAAI,IAAI,IAAI,KAAK;AACvB,MAAE,IAAI;AACN,MAAE,IAAI,CAAC,EAAE;AACT;;AAGF,OAAI,IAAI,GAAG;AACT,QAAI,CAAC;AACL,MAAE,IAAI;SAEN,GAAE,IAAI;AAIR,OAAI,MAAM,CAAC,CAAC,KAAK,IAAI,KAAK;AACxB,SAAK,IAAI,GAAG,MAAI,GAAGC,OAAK,IAAI,OAAK,GAAI;AAErC,QAAI,SACF,KAAI,IAAID,UAAQ,MAAM;AACpB,OAAE,IAAI;AACN,OAAE,IAAI;eACG,IAAIA,UAAQ,MAAM;AAC3B,OAAE,IAAI;AACN,OAAE,IAAI,CAAC,EAAE;WACJ;AACL,OAAE,IAAI;AACN,OAAE,IAAI,CAAC,EAAE;;SAEN;AACL,OAAE,IAAI;AACN,OAAE,IAAI,CAAC,EAAE;;AAGX;;AAIF,OAAI,IAAI,MAAM,GAAG;AACf,QAAI,CAAC,EAAG,GAAE,IAAI;AACd,MAAE,IAAI;AACN,MAAE,IAAI;AACN;;AAGF,UAAO,aAAa,GAAG,EAAE,UAAU,CAAC;;AAGtC,MAAI,MAAM,UAAU;AAClB,QAAK,MAAI,EAAE,WAAW,EAAE,MAAM,IAAI;AAChC,QAAI,EAAE,MAAM,EAAE;AACd,MAAE,IAAI;UACD;AACL,QAAIC,QAAM,GAAI,KAAI,EAAE,MAAM,EAAE;AAC5B,MAAE,IAAI;;AAGR,UAAO,UAAU,KAAK,EAAE,GAAG,aAAa,GAAG,EAAE,GAAG,WAAW,GAAG,EAAE;;AAGlE,MAAI,MAAM,UAAU;AAClB,OAAI,IAAI,GAAG;AACT,QAAI,CAAC;AACL,MAAE,IAAI;SAEN,GAAE,IAAI;AAGR,UAAO,aAAa,GAAG,EAAE,UAAU,CAAC;;AAGtC,QAAM,MAAM,kBAAkB,EAAE;;AAGlC,WAAQ,YAAYd;AAEpB,WAAQ,WAAW;AACnB,WAAQ,aAAa;AACrB,WAAQ,aAAa;AACrB,WAAQ,cAAc;AACtB,WAAQ,gBAAgB;AACxB,WAAQ,kBAAkB;AAC1B,WAAQ,kBAAkB;AAC1B,WAAQ,kBAAkB;AAC1B,WAAQ,mBAAmB;AAC3B,WAAQ,SAAS;AAEjB,WAAQ,SAAS,UAAQ,MAAM;AAC/B,WAAQ,QAAQY;AAChB,WAAQ,YAAY;AAEpB,WAAQ,MAAM;AACd,WAAQ,OAAO;AACf,WAAQ,QAAQ;AAChB,WAAQ,MAAMF;AACd,WAAQ,OAAO;AACf,WAAQ,QAAQ;AAChB,WAAQ,OAAO;AACf,WAAQ,QAAQ;AAChB,WAAQ,QAAQ;AAChB,WAAQ,OAAO;AACf,WAAQ,OAAO;AACf,WAAQ,QAAQ;AAChB,WAAQ,MAAM;AACd,WAAQ,OAAOC;AACf,WAAQ,MAAM;AACd,WAAQ,MAAM;AACd,WAAQ,QAAQ;AAChB,WAAQ,QAAQI;AAChB,WAAQ,KAAK;AACb,WAAQ,MAAM;AACd,WAAQ,QAAQ;AAChB,WAAQ,OAAO;AACf,WAAQ,MAAM;AACd,WAAQ,MAAM;AACd,WAAQ,MAAM;AACd,WAAQ,MAAM;AACd,WAAQ,MAAM;AACd,WAAQ,SAAS;AACjB,WAAQ,QAAQ;AAChB,WAAQ,OAAO;AACf,WAAQ,MAAM;AACd,WAAQ,OAAOC;AACf,WAAQ,OAAO;AACf,WAAQ,MAAM;AACd,WAAQ,MAAMP;AACd,WAAQ,MAAM;AACd,WAAQ,OAAO;AACf,WAAQ,QAAQ;AAEhB,KAAI,QAAQ,KAAK,EAAG,OAAM,EAAE;AAC5B,KAAI,KACF;MAAI,IAAI,aAAa,MAAM;AACzB,QAAK;IAAC;IAAa;IAAY;IAAY;IAAY;IAAQ;IAAQ;IAAU;IAAS;AAC1F,QAAK,IAAI,GAAG,IAAI,GAAG,QAAS,KAAI,CAAC,IAAI,eAAe,IAAI,GAAG,KAAK,CAAE,KAAI,KAAK,KAAK;;;AAIpF,WAAQ,OAAO,IAAI;AAEnB,QAAOI;;AAYT,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAW3B,SAAS,IAAI,GAAG;AACd,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK;;AAU1B,SAAS,MAAM,GAAG;AAChB,QAAO,SAAS,IAAI,IAAI,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE;;AAa9C,SAASE,UAAQ;CACf,IAAI,GAAG,GACL,IAAI,IAAI,KAAK,EAAE;AAEjB,YAAW;AAEX,MAAK,IAAI,GAAG,IAAI,UAAU,SAAS;AACjC,MAAI,IAAI,KAAK,UAAU,KAAK;AAC5B,MAAI,CAAC,EAAE,GAAG;AACR,OAAI,EAAE,GAAG;AACP,eAAW;AACX,WAAO,IAAI,KAAK,SAAM;;AAExB,OAAI;aACK,EAAE,EACX,KAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;;AAI1B,YAAW;AAEX,QAAO,EAAE,MAAM;;AASjB,SAAS,kBAAkB,KAAK;AAC9B,QAAO,eAAe,WAAW,OAAO,IAAI,gBAAgB,OAAO;;AAWrE,SAAS,GAAG,GAAG;AACb,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI;;AAczB,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAW3B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAW3B,SAAS,MAAM,GAAG;AAChB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,GAAG;;AAU5B,SAAS,MAAM;AACb,QAAO,SAAS,MAAM,WAAW,GAAG;;AAUtC,SAAS,MAAM;AACb,QAAO,SAAS,MAAM,WAAW,EAAE;;AAYrC,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAY3B,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAY3B,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAY3B,SAAS,OAAO,IAAI;CAClB,IAAIZ,KAAG,GAAG,GAAG,GACX,IAAI,GACJ,IAAI,IAAI,KAAK,EAAE,EACf,KAAK,EAAE;AAET,KAAI,OAAO,KAAK,EAAG,MAAK,KAAK;KACxB,YAAW,IAAI,GAAG,WAAW;AAElC,KAAI,KAAK,KAAK,KAAK,SAAS;AAE5B,KAAI,CAAC,KAAK,OACR,QAAO,IAAI,GAAI,IAAG,OAAO,KAAK,QAAQ,GAAG,MAAM;UAGtC,OAAO,iBAAiB;AACjC,QAAI,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC;AAE9C,SAAO,IAAI,IAAI;AACb,OAAIA,IAAE;AAIN,OAAI,KAAK,MACP,KAAE,KAAK,OAAO,gBAAgB,IAAI,YAAY,EAAE,CAAC,CAAC;OAKlD,IAAG,OAAO,IAAI;;YAKT,OAAO,aAAa;AAG7B,QAAI,OAAO,YAAY,KAAK,EAAE;AAE9B,SAAO,IAAI,IAAI;AAGb,OAAIA,IAAE,MAAMA,IAAE,IAAI,MAAM,MAAMA,IAAE,IAAI,MAAM,QAAQA,IAAE,IAAI,KAAK,QAAS;AAGtE,OAAI,KAAK,MACP,QAAO,YAAY,EAAE,CAAC,KAAKA,KAAG,EAAE;QAC3B;AAIL,OAAG,KAAK,IAAI,IAAI;AAChB,SAAK;;;AAIT,MAAI,IAAI;OAER,OAAM,MAAM,kBAAkB;AAGhC,KAAI,GAAG,EAAE;AACT,OAAM;AAGN,KAAI,KAAK,IAAI;AACX,MAAI,QAAQ,IAAI,WAAW,GAAG;AAC9B,KAAG,MAAM,IAAI,IAAI,KAAK;;AAIxB,QAAO,GAAG,OAAO,GAAG,IAAK,IAAG,KAAK;AAGjC,KAAI,IAAI,GAAG;AACT,MAAI;AACJ,OAAK,CAAC,EAAE;QACH;AACL,MAAI;AAGJ,SAAO,GAAG,OAAO,GAAG,KAAK,SAAU,IAAG,OAAO;AAG7C,OAAK,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AAGzC,MAAI,IAAI,SAAU,MAAK,WAAW;;AAGpC,GAAE,IAAI;AACN,GAAE,IAAI;AAEN,QAAO;;AAYT,SAAS,MAAM,GAAG;AAChB,QAAO,SAAS,IAAI,IAAI,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,KAAK,SAAS;;AAe1D,SAAS,KAAK,GAAG;AACf,KAAI,IAAI,KAAK,EAAE;AACf,QAAO,EAAE,IAAK,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,IAAK,EAAE,KAAK;;AAWjD,SAAS,IAAI,GAAG;AACd,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK;;AAW1B,SAASa,OAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAW3B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAY3B,SAAS,IAAI,GAAG,GAAG;AACjB,QAAO,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE;;AAa3B,SAASP,QAAM;CACb,IAAI,IAAI,GACN,OAAO,WACP,IAAI,IAAI,KAAK,KAAK,GAAG;AAEvB,YAAW;AACX,QAAO,EAAE,KAAK,EAAE,IAAI,KAAK,QAAS,KAAI,EAAE,KAAK,KAAK,GAAG;AACrD,YAAW;AAEX,QAAO,SAAS,GAAG,KAAK,WAAW,KAAK,SAAS;;AAWnD,SAAS,IAAI,GAAG;AACd,QAAO,IAAI,KAAK,EAAE,CAAC,KAAK;;AAW1B,SAAS,KAAK,GAAG;AACf,QAAO,IAAI,KAAK,EAAE,CAAC,MAAM;;AAU3B,SAAS,MAAM,GAAG;AAChB,QAAO,SAAS,IAAI,IAAI,KAAK,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE;;AAI9C,IAAE,OAAO,IAAI,6BAA6B,IAAIT,IAAE;AAChD,IAAE,OAAO,eAAe;AAGxB,IAAW,UAAU,IAAE,cAAcY,QAAM,SAAS;AAGpD,OAAO,IAAI,QAAQ,KAAK;AACxB,KAAK,IAAI,QAAQ,GAAG;AAEpB,sBAAe;;;;AC/yJf,IAAIK,UAAO;AACX,IAAIC,kBAAe,CAAC,OAAO,SAAS;AACpC,IAAW,uBAAsC,wBAAQD,SAAMC,kBAAc,SAAQ;CACnF,IAAI,EACF,IACA,qBACE;CACJ,IAAIC,cAAYC,gBAAQ,MAAM;EAC5B,WAAWC,SAAO;EAClB,QAAQD,gBAAQ;EACjB,CAAC;AACF,aAAU,YAAY,OAAO,OAAOD,YAAU,UAAU;;;;AAKxD,aAAU,UAAU,OAAO;AAC3B,aAAU,UAAU,cAAc;;;;;;;AAQlC,aAAU,UAAU,SAAS,WAAY;AACvC,SAAO;GACL,QAAQ;GACR,OAAO,KAAK,UAAU;GACvB;;;;;;;;AASH,aAAU,WAAW,SAAU,MAAM;AACnC,SAAO,IAAIA,YAAU,KAAK,MAAM;;AAElC,KAAI,GAEF,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,MAAI,KAAK,cAAc,KAAK,UAC1B,aAAU,OAAO,EACf,WAAW,KAAK,WACjB,CAAC;GAEJ;AAEJ,QAAOA;GACN,EACD,SAAS,MACV,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzBF,MAAM,OAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,QAAO,KAAK,IAAI,EAAE,GAAG,OAAO,IAAI,KAAK,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,CAAC,EAAE,IAAI;;AAGrE,MAAM,OAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,QAAO,KAAK,IAAI,EAAE,GAAG,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,CAAC,EAAE,IAAI;;;;;;;;AASjE,MAAM,SAAQ,MAAK;CAEjB,MAAM,IAAI,KAAK,IAAI,KAAM,EAAE;AAC3B,QAAO,KAAK,IAAI;;AAGlB,MAAM,QAAQ,SAAU,GAAG,GAAG;AAE5B,KAAI,KAAK,IAAI,EAAE;AACf,KAAI,KAAK,IAAI,EAAE;AAGf,KAAI,IAAI,EAAG,EAAC,GAAG,KAAK,CAAC,GAAG,EAAE;AAG1B,KAAI,IAAI,IAAK,QAAO,KAAK,KAAK,IAAI,IAAI,IAAI,EAAE;AAG5C,MAAK;AACL,QAAO,IAAI,KAAK,KAAK,IAAI,IAAI,EAAE;;AAGjC,MAAM,cAAc,WAAY;AAC9B,OAAM,YAAY,gBAAgB;;;;;;;;;AAUpC,SAAS,SAAS,GAAG,KAAG;CAEtB,MAAM,KAAK,KAAK,IAAI,EAAE;CACtB,MAAM,KAAK,KAAK,IAAIG,IAAE;AAEtB,KAAI,MAAM,EACR,QAAO,KAAK,IAAI,GAAG;AAGrB,KAAIA,QAAM,EACR,QAAO,KAAK,IAAI,GAAG;AAGrB,KAAI,KAAK,OAAQ,KAAK,IACpB,QAAO,KAAK,IAAI,IAAI,IAAIA,MAAIA,IAAE,GAAG;AAmCnC,KAAI,IAAI;AACR,OAAIA,MAAI;AAER,QAAO,KAAM,KAAK,IAAI,IAAI,IAAIA,MAAIA,IAAE,GAAG,KAAK;;AAG9C,MAAM,IAAI;CAAE,MAAM;CAAG,MAAM;CAAG;AAC9B,MAAM,QAAQ,SAAU,GAAG,KAAG;CAE5B,MAAM,IAAI;AAEV,KAAI,MAAM,UAAa,MAAM,KAC3B,GAAE,QACA,EAAE,QAAQ;UACHA,QAAM,QAAW;AAC1B,IAAE,QAAQ;AACV,IAAE,QAAQA;OAEV,SAAQ,OAAO,GAAf;EAEE,KAAK;AAEH,OAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,MAAE,QAAQ,EAAE;AACZ,MAAE,QAAQ,EAAE;cACH,SAAS,KAAK,SAAS,GAAG;AACnC,QAAI,CAAC,SAAS,EAAE,OAAO,IAAI,SAAS,EAAE,OAAO,CAC3C,QAAOC,UAAQ;AAEjB,MAAE,QAAQ,EAAE,SAAS,KAAK,IAAI,EAAE,OAAO;AACvC,MAAE,QAAQ,EAAE,SAAS,KAAK,IAAI,EAAE,OAAO;cAC9B,OAAO,KAAK,SAAS,GAAG;AACjC,QAAI,CAAC,SAAS,EAAE,KAAK,IAAI,SAAS,EAAE,OAAO,CACzC,QAAOA,UAAQ;AAEjB,MAAE,QAAQ,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO;AACrC,MAAE,QAAQ,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO;cAC5B,EAAE,WAAW,GAAG;AACzB,MAAE,QAAQ,EAAE;AACZ,MAAE,QAAQ,EAAE;SAEZ,cAAa;AAEf;EAEF,KAAK;AAEH,KAAE,QACA,EAAE,QAAQ;GAEZ,MAAM,SAAS,EAAE,QAAQ,MAAM,GAAG,CAC/B,MAAM,wCAAwC;GACjD,IAAI,OAAO;GACX,IAAI,QAAQ;AAEZ,OAAI,WAAW,KACb,cAAa;AAGf,QAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;IAEtC,MAAM,IAAI,OAAO;AAEjB,QAAI,MAAM,OAAO,MAAM,OAAQ,MAAM,MAAM,YAEhC,MAAM,IACf;aACS,MAAM,IACf;aACS,MAAM,OAAO,MAAM,KAAK;AAEjC,SAAI,OAAO,UAAU,EACnB,cAAa;AAGf,SAAI,OAAO,IAAI,OAAO,OAAO,CAAC,MAAM,OAAO,IAAI,GAAG,EAAE;AAClD,QAAE,SAAS,YAAY,QAAQ,IAAI,MAAM,MAAM,OAAO,IAAI,GAAG;AAC7D;WAEA,GAAE,SAAS,YAAY,QAAQ,IAAI,MAAM,MAAM,IAAI;AAErD,YAAO,QAAQ;WAEV;AAEL,SAAI,OAAO,UAAU,KAAK,MAAM,EAAE,CAChC,cAAa;AAGf,SAAI,OAAO,IAAI,OAAO,OAAO,OAAO,IAAI,OAAO,KAAK;AAClD,QAAE,SAAS,YAAY,QAAQ,IAAI,MAAM,MAAM,EAAE;AACjD;WAEA,GAAE,SAAS,YAAY,QAAQ,IAAI,MAAM,MAAM,EAAE;AAEnD,YAAO,QAAQ;;;AAKnB,OAAI,OAAO,QAAQ,EACjB,cAAa;AAEf;EAEF,KAAK;AACH,KAAE,QAAQ;AACV,KAAE,QAAQ;AACV;EAEF,QACE,cAAa;;AAGnB,KAAI,MAAM,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,EAAE;AAKtC,QAAO;;;;;;AAOT,SAASA,UAAQ,GAAG,KAAG;AAErB,KAAI,EAAE,gBAAgBA,WACpB,QAAO,IAAIA,UAAQ,GAAGD,IAAE;CAG1B,MAAM,IAAI,MAAM,GAAGA,IAAE;AAErB,MAAK,QAAQ,EAAE;AACf,MAAK,QAAQ,EAAE;;AAGjB,UAAQ,YAAY;CAElB,MAAM;CACN,MAAM;CAON,QAAQ,WAAY;EAElB,MAAME,QAAM,MAAM,KAAK,OAAO,KAAK,MAAM;AAEzC,SAAO,IAAID,UACT,KAAK,QAAQC,OACb,KAAK,QAAQA,MAAI;;CAQrB,OAAO,SAAU,GAAG,KAAG;EAErB,MAAM,IAAI,MAAM,GAAGF,IAAE;EAErB,MAAM,SAAS,KAAK,eAAe;EACnC,MAAM,SAAS,EAAE,SAAS,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM;AAEvD,MAAI,UAAU,QAAQ;AAEpB,OAAI,UAAU,OAEZ,QAAOC,UAAQ;AAGjB,UAAOA,UAAQ;;AAGjB,SAAO,IAAIA,UACT,KAAK,QAAQ,EAAE,OACf,KAAK,QAAQ,EAAE,MAAM;;CAQzB,OAAO,SAAU,GAAG,KAAG;EAErB,MAAM,IAAI,MAAM,GAAGD,IAAE;EAErB,MAAM,SAAS,KAAK,eAAe;EACnC,MAAM,SAAS,EAAE,SAAS,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM;AAEvD,MAAI,UAAU,QAAQ;AAEpB,OAAI,UAAU,OAEZ,QAAOC,UAAQ;AAGjB,UAAOA,UAAQ;;AAGjB,SAAO,IAAIA,UACT,KAAK,QAAQ,EAAE,OACf,KAAK,QAAQ,EAAE,MAAM;;CAQzB,OAAO,SAAU,GAAG,KAAG;EAErB,MAAM,IAAI,MAAM,GAAGD,IAAE;EAErB,MAAM,SAAS,KAAK,eAAe;EACnC,MAAM,SAAS,EAAE,SAAS,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM;EACvD,MAAM,UAAU,KAAK,UAAU,KAAK,KAAK,UAAU;EACnD,MAAM,UAAU,EAAE,UAAU,KAAK,EAAE,UAAU;AAG7C,MAAI,UAAU,WAAW,UAAU,QACjC,QAAOC,UAAQ;AAIjB,MAAI,UAAU,OACZ,QAAOA,UAAQ;AAIjB,MAAI,EAAE,UAAU,KAAK,KAAK,UAAU,EAClC,QAAO,IAAIA,UAAQ,KAAK,QAAQ,EAAE,OAAO,EAAE;AAG7C,SAAO,IAAIA,UACT,KAAK,QAAQ,EAAE,QAAQ,KAAK,QAAQ,EAAE,OACtC,KAAK,QAAQ,EAAE,QAAQ,KAAK,QAAQ,EAAE,MAAM;;CAQhD,OAAO,SAAU,GAAG,KAAG;EAErB,MAAM,IAAI,MAAM,GAAGD,IAAE;EAErB,MAAM,SAAS,KAAK,eAAe;EACnC,MAAM,SAAS,EAAE,SAAS,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM;EACvD,MAAM,UAAU,KAAK,UAAU,KAAK,KAAK,UAAU;EACnD,MAAM,UAAU,EAAE,UAAU,KAAK,EAAE,UAAU;AAG7C,MAAI,WAAW,WAAW,UAAU,OAClC,QAAOC,UAAQ;AAIjB,MAAI,WAAW,OACb,QAAOA,UAAQ;AAIjB,MAAI,WAAW,OACb,QAAOA,UAAQ;AAGjB,MAAI,MAAM,EAAE,MAEV,QAAO,IAAIA,UAAQ,KAAK,QAAQ,EAAE,OAAO,KAAK,QAAQ,EAAE,MAAM;AAGhE,MAAI,KAAK,IAAI,EAAE,MAAM,GAAG,KAAK,IAAI,EAAE,MAAM,EAAE;GAEzC,MAAM,IAAI,EAAE,QAAQ,EAAE;GACtB,MAAM,IAAI,EAAE,QAAQ,IAAI,EAAE;AAE1B,UAAO,IAAIA,WACR,KAAK,QAAQ,IAAI,KAAK,SAAS,IAC/B,KAAK,QAAQ,IAAI,KAAK,SAAS,EAAE;SAE/B;GAEL,MAAM,IAAI,EAAE,QAAQ,EAAE;GACtB,MAAM,IAAI,EAAE,QAAQ,IAAI,EAAE;AAE1B,UAAO,IAAIA,WACR,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAC/B,KAAK,QAAQ,KAAK,QAAQ,KAAK,EAAE;;;CASxC,OAAO,SAAU,GAAG,KAAG;EAErB,MAAM,IAAI,MAAM,GAAGD,IAAE;EAErB,MAAM,UAAU,KAAK,UAAU,KAAK,KAAK,UAAU;AAGnD,MAFgB,EAAE,UAAU,KAAK,EAAE,UAAU,EAG3C,QAAOC,UAAQ;AAIjB,MAAI,EAAE,UAAU,GAEd;OAAI,KAAK,UAAU,KAAK,KAAK,QAAQ,EAEnC,QAAO,IAAIA,UAAQ,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,EAAE,EAAE;YAE3C,KAAK,UAAU,EAExB,UAAS,EAAE,QAAQ,IAAI,KAAK,GAA5B;IACE,KAAK,EACH,QAAO,IAAIA,UAAQ,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,EAAE,EAAE;IACtD,KAAK,EACH,QAAO,IAAIA,UAAQ,GAAG,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,CAAC;IACtD,KAAK,EACH,QAAO,IAAIA,UAAQ,CAAC,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,EAAE,EAAE;IACvD,KAAK,EACH,QAAO,IAAIA,UAAQ,GAAG,CAAC,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,CAAC;;;AAwB7D,MAAI,WAAW,EAAE,QAAQ,EACvB,QAAOA,UAAQ;EAGjB,MAAM,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM;EAC9C,MAAM,MAAM,SAAS,KAAK,OAAO,KAAK,MAAM;EAE5C,IAAI,KAAK,KAAK,IAAI,EAAE,QAAQ,MAAM,EAAE,QAAQ,IAAI;EAChD,IAAI,KAAK,EAAE,QAAQ,MAAM,EAAE,QAAQ;AACnC,SAAO,IAAIA,UACT,KAAK,KAAK,IAAI,GAAG,EACjB,KAAK,KAAK,IAAI,GAAG,CAAC;;CAQtB,QAAQ,WAAY;EAElB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;AAEf,MAAIA,QAAM,EAER,KAAI,KAAK,EACP,QAAO,IAAIC,UAAQ,KAAK,KAAK,EAAE,EAAE,EAAE;MAEnC,QAAO,IAAIA,UAAQ,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;EAIxC,MAAM,IAAI,MAAM,GAAGD,IAAE;EAErB,IAAI,KAAK,KAAK,KAAK,MAAO,IAAI,KAAK,IAAI,EAAE,EAAE;EAC3C,IAAI,KAAK,KAAK,IAAIA,IAAE,IAAI,IAAI;AAE5B,MAAI,KAAK,EACP,QAAO,IAAIC,UAAQ,IAAID,MAAI,IAAI,CAAC,KAAK,GAAG;MAExC,QAAO,IAAIC,UAAQ,IAAID,MAAI,IAAI,CAAC,KAAK,GAAG;;CAS5C,OAAO,WAAY;EAEjB,MAAM,KAAK,KAAK,IAAI,KAAK,MAAM;AAE/B,MAAI,KAAK,UAAU,EACjB,QAAO,IAAIC,UAAQ,IAAI,EAAE;AAE3B,SAAO,IAAIA,UACT,KAAK,KAAK,IAAI,KAAK,MAAM,EACzB,KAAK,KAAK,IAAI,KAAK,MAAM,CAAC;;CAW9B,SAAS,WAAY;;;;;;EAQnB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;AAEf,SAAO,IAAIC,UACT,KAAK,MAAM,EAAE,GAAG,KAAK,IAAID,IAAE,GAAG,MAAMA,IAAE,EACtC,KAAK,IAAI,EAAE,GAAG,KAAK,IAAIA,IAAE,CAAC;;CAQ9B,OAAO,WAAY;EAEjB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAIA,QAAM,KAAK,IAAI,EACjB,QAAO,IAAIC,UAAQ,KAAK,IAAI,EAAE,EAAE,EAAE;AAGpC,SAAO,IAAIA,UACT,SAAS,GAAGD,IAAE,EACd,KAAK,MAAMA,KAAG,EAAE,CAAC;;CAQrB,OAAO,WAAY;AAEjB,SAAO,MAAM,KAAK,OAAO,KAAK,MAAM;;CAQtC,OAAO,WAAY;AAEjB,SAAO,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM;;CAQ3C,OAAO,WAAY;EAKjB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,SAAO,IAAIC,UACT,KAAK,IAAI,EAAE,GAAG,KAAKD,IAAE,EACrB,KAAK,IAAI,EAAE,GAAG,KAAKA,IAAE,CAAC;;CAQ1B,OAAO,WAAY;EAKjB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,SAAO,IAAIC,UACT,KAAK,IAAI,EAAE,GAAG,KAAKD,IAAE,EACrB,CAAC,KAAK,IAAI,EAAE,GAAG,KAAKA,IAAE,CAAC;;CAQ3B,OAAO,WAAY;EAOjB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMA,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,KAAK,IAAI,EAAE,GAAG,KAAKH,IAAE;AAE/B,SAAO,IAAIC,UACT,KAAK,IAAI,EAAE,GAAGE,KACd,KAAKH,IAAE,GAAGG,IAAE;;CAQhB,OAAO,WAAY;EAIjB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMH,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,KAAK,IAAI,EAAE,GAAG,KAAKH,IAAE;AAE/B,SAAO,IAAIC,UACT,CAAC,KAAK,IAAI,EAAE,GAAGE,KACf,KAAKH,IAAE,GAAGG,IAAE;;CAQhB,OAAO,WAAY;EAIjB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;EACf,MAAMG,MAAI,KAAM,KAAK,IAAIH,IAAE,GAAG,KAAM,KAAK,IAAI,IAAI,EAAE;AAEnD,SAAO,IAAIC,UACT,KAAK,IAAI,EAAE,GAAG,KAAKD,IAAE,GAAGG,KACxB,KAAK,IAAI,EAAE,GAAG,KAAKH,IAAE,GAAGG,IAAE;;CAQ9B,OAAO,WAAY;EAIjB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;EACf,MAAMG,MAAI,KAAM,KAAK,IAAIH,IAAE,GAAG,KAAM,KAAK,IAAI,IAAI,EAAE;AAEnD,SAAO,IAAIC,UACT,KAAK,IAAI,EAAE,GAAG,KAAKD,IAAE,GAAGG,KACxB,CAAC,KAAK,IAAI,EAAE,GAAG,KAAKH,IAAE,GAAGG,IAAE;;CAQ/B,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;EAEf,MAAM,KAAK,IAAIC,UACbD,MAAIA,MAAI,IAAI,IAAI,GAChB,KAAK,IAAIA,IAAE,CAAC,SAAS;EAEvB,MAAM,KAAK,IAAIC,UACb,GAAG,QAAQD,KACX,GAAG,QAAQ,EAAE,CAAC,QAAQ;AAExB,SAAO,IAAIC,UAAQ,GAAG,OAAO,CAAC,GAAG,MAAM;;CAQzC,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;EAEf,MAAM,KAAK,IAAIC,UACbD,MAAIA,MAAI,IAAI,IAAI,GAChB,KAAK,IAAIA,IAAE,CAAC,SAAS;EAEvB,MAAM,KAAK,IAAIC,UACb,GAAG,QAAQD,KACX,GAAG,QAAQ,EAAE,CAAC,QAAQ;AAExB,SAAO,IAAIC,UAAQ,KAAK,KAAK,IAAI,GAAG,OAAO,GAAG,MAAM;;CAQtD,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;AAEf,MAAI,MAAM,GAAG;AAEX,OAAIA,QAAM,EACR,QAAO,IAAIC,UAAQ,GAAG,SAAS;AAGjC,OAAID,QAAM,GACR,QAAO,IAAIC,UAAQ,GAAG,UAAU;;EAIpC,MAAME,MAAI,IAAI,KAAK,IAAMH,QAAM,IAAMA;EAErC,MAAM,KAAK,IAAIC,WACZ,IAAID,MAAIA,MAAI,IAAI,KAAKG,KACtB,KAAK,IAAIA,IAAE,CAAC,KAAK;AAEnB,SAAO,IAAIF,UAAQ,MAAO,GAAG,OAAO,KAAM,GAAG,MAAM;;CAQrD,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;AAEf,MAAIA,QAAM,EACR,QAAO,IAAIC,UAAQ,KAAK,MAAM,GAAG,EAAE,EAAE,EAAE;EAGzC,MAAME,MAAI,IAAI,IAAIH,MAAIA;AACtB,SAAQG,QAAM,IACV,IAAIF,UACJ,IAAIE,KACJ,CAACH,MAAIG,IAAE,CAAC,MAAM,GACd,IAAIF,UACH,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EAAE,CAAC,MAAM;;CAQpC,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAI,MAAM,KAAKA,QAAM,EACnB,QAAO,IAAIC,UAAQ,GAAG,SAAS;EAGjC,MAAME,MAAI,IAAI,IAAIH,MAAIA;AACtB,SAAQG,QAAM,IACV,IAAIF,UACJ,IAAIE,KACJ,CAACH,MAAIG,IAAE,CAAC,MAAM,GACd,IAAIF,UACH,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EAAE,CAAC,MAAM;;CAQpC,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAI,MAAM,KAAKA,QAAM,EACnB,QAAO,IAAIC,UAAQ,KAAK,KAAK,GAAG,SAAS;EAG3C,MAAME,MAAI,IAAI,IAAIH,MAAIA;AACtB,SAAQG,QAAM,IACV,IAAIF,UACJ,IAAIE,KACJ,CAACH,MAAIG,IAAE,CAAC,MAAM,GACd,IAAIF,UACH,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EAAE,CAAC,MAAM;;CAQpC,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,SAAO,IAAIC,UACT,KAAK,EAAE,GAAG,KAAK,IAAID,IAAE,EACrB,KAAK,EAAE,GAAG,KAAK,IAAIA,IAAE,CAAC;;CAQ1B,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,SAAO,IAAIC,UACT,KAAK,EAAE,GAAG,KAAK,IAAID,IAAE,EACrB,KAAK,EAAE,GAAG,KAAK,IAAIA,IAAE,CAAC;;CAQ1B,QAAQ,WAAY;EAIlB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMA,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,KAAK,EAAE,GAAG,KAAK,IAAIH,IAAE;AAE/B,SAAO,IAAIC,UACT,KAAK,EAAE,GAAGE,KACV,KAAK,IAAIH,IAAE,GAAGG,IAAE;;CAQpB,QAAQ,WAAY;EAIlB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMH,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,KAAK,EAAE,GAAG,KAAK,IAAIH,IAAE;AAE/B,SAAO,IAAIC,UACT,KAAK,EAAE,GAAGE,KACV,CAAC,KAAK,IAAIH,IAAE,GAAGG,IAAE;;CAQrB,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;EACf,MAAMG,MAAI,KAAK,IAAI,IAAIH,IAAE,GAAG,KAAK,IAAI,EAAE;AAEvC,SAAO,IAAIC,UACT,KAAK,KAAK,EAAE,GAAG,KAAK,IAAID,IAAE,GAAGG,KAC7B,IAAI,KAAK,EAAE,GAAG,KAAK,IAAIH,IAAE,GAAGG,IAAE;;CAQlC,QAAQ,WAAY;EAIlB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;EACf,MAAMG,MAAI,KAAK,IAAI,IAAIH,IAAE,GAAG,KAAK,IAAI,EAAE;AAEvC,SAAO,IAAIC,UACT,IAAI,KAAK,EAAE,GAAG,KAAK,IAAID,IAAE,GAAGG,KAC5B,KAAK,KAAK,EAAE,GAAG,KAAK,IAAIH,IAAE,GAAGG,IAAE;;CAQnC,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMH,MAAI,KAAK;AAEf,MAAIA,QAAM,GAAG;AAEX,OAAI,MAAM,EACR,QAAO,IAAIC,UAAQ,GAAG,EAAE;GAI1B,MAAM,IAAI,KAAK,IAAI,EAAE;GACrB,MAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,EAAE,CAAC;AAE5C,UAAO,IAAIA,UAAQ,IAAI,IAAI,CAAC,IAAI,GAAG,EAAE;;EAOvC,MAAM,IAAI,IAAIA,UAHF,IAAI,IAAID,MAAIA,MAAI,GAChB,IAAI,IAAIA,IAEW,CAAC,SAAS;AAEzC,SAAO,IAAIC,UAAQ,IAAI,EAAE,OAAOD,MAAI,EAAE,MAAM,CAAC,QAAQ;;CAQvD,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAIA,QAAM,GAAG;AAGX,OAAI,IAAI,EAEN,QAAO,IAAIC,UACT,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EAAE,GAAG,KAAK,KAAK,IAAI,EAAE,CAAC,EAAE,EAAE;AAGzD,OAAI,IAAI,IAAI;IAEV,MAAM,IAAI,KAAK,KAAK,IAAI,IAAI,EAAE;AAC9B,WAAO,IAAIA,UAAQ,KAAK,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK,GAAG;;AAK/C,UAAO,IAAIA,UAAQ,GAAG,KAAK,KAAK,EAAE,CAAC;;EAGrC,MAAM,KAAK,IAAIA,UAAQ,IAAI,GAAGD,IAAE,CAAC,SAAS;EAC1C,MAAM,KAAK,IAAIC,UAAQ,IAAI,GAAGD,IAAE,CAAC,SAAS;AAE1C,SAAO,IAAIC,UACT,IAAI,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,OACxCD,MAAI,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,MACzC,CAAC,QAAQ;;CAQZ,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAIA,QAAM,GAAG;AAEX,OAAI,MAAM,EACR,QAAO,IAAIC,UAAQ,GAAG,EAAE;AAG1B,OAAI,MAAM,EAER,QAAO,IAAIA,UAAQ,UAAU,EAAE;AAGjC,OAAI,MAAM,GAER,QAAO,IAAIA,UAAQ,WAAW,EAAE;AAGlC,OAAI,KAAK,KAAK,IAAI,EAEhB,QAAO,IAAIA,UACT,KAAM,KAAK,KAAK,IAAI,MAAM,IAAI,GAAG,EACjC,EACD;AAGH,OAAI,IAAI,GAAG;IAET,MAAMG,OAAK,IAAI,MAAM,IAAI;AACzB,WAAO,IAAIH,UACT,KAAM,KAAK,IAAIG,IAAE,EACjB,CAAC,KAAK,KAAK,EACZ;;GAIH,MAAM,KAAK,IAAI,MAAM,IAAI;AACzB,UAAO,IAAIH,UACT,KAAM,KAAK,IAAI,CAAC,EAAE,EAClB,KAAK,KAAK,EACX;;EAIH,MAAM,WAAW,IAAI;EACrB,MAAM,UAAU,IAAI;EACpB,MAAME,MAAI,WAAW,WAAWH,MAAIA;AAEpC,MAAIG,QAAM,EAGR,QAAO,IAAIF,UACR,MAAM,KAAO,IAAI,IAAK,GACtBD,QAAM,IAAMA,MAAI,IAAK,EACvB;EAIH,MAAM,MAAM,UAAU,WAAWA,MAAIA,OAAKG;EAC1C,MAAM,MAAMH,MAAI,WAAW,UAAUA,OAAKG;AAG1C,SAAO,IAAIF,UACT,SAAS,IAAI,GAAG,GAAG,GACnB,KAAK,MAAM,IAAI,GAAG,GAAG,EACtB;;CAQH,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;AAGf,MAAI,MAAM,KAAKA,QAAM,EACnB,QAAO,IAAIC,UAAQ,GAAG,KAAK,KAAK,EAAE;EAGpC,MAAME,MAAI,IAAI,IAAIH,MAAIA;AAEtB,MAAIG,QAAM,EAER,QAAO,IAAIF,UAAQ,IAAIE,KAAG,CAACH,MAAIG,IAAE,CAAC,UAAU;AAI9C,SAAO,IAAIF,UACR,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EACtB,CAAC,UAAU;;CAQd,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAIA,QAAM,GAAG;AAGX,OAAI,MAAM,EAER,QAAO,IAAIC,UAAQ,UAAU,EAAE;GAIjC,MAAM,MAAM,IAAI;AAChB,UAAO,IAAIA,UACT,KAAK,IAAI,MAAM,KAAK,KAAK,MAAM,MAAM,EAAE,CAAC,EACxC,EACD;;EAGH,MAAME,MAAI,IAAI,IAAIH,MAAIA;AAEtB,MAAIG,QAAM,EAER,QAAO,IAAIF,UAAQ,IAAIE,KAAG,CAACH,MAAIG,IAAE,CAAC,UAAU;AAI9C,SAAO,IAAIF,UACR,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EAAE,CAAC,UAAU;;CAQtC,SAAS,WAAY;EAInB,MAAM,IAAI,KAAK;EACf,MAAMA,MAAI,KAAK;AAEf,MAAI,KAAK,WAAW,CAElB,QAAOC,UAAQ;EAGjB,MAAME,MAAI,IAAI,IAAIH,MAAIA;AAEtB,MAAIG,QAAM,EAER,QAAO,IAAIF,UAAQ,IAAIE,KAAG,CAACH,MAAIG,IAAE,CAAC,UAAU;AAI9C,SAAO,IAAIF,UACR,MAAM,IAAK,IAAI,IAAI,GACnBD,QAAM,IAAK,CAACA,MAAI,IAAI,EAAE,CAAC,UAAU;;CAQtC,WAAW,WAAY;AAGrB,MAAI,KAAK,WAAW,CAClB,QAAOC,UAAQ;AAGjB,MAAI,KAAK,eAAe,CACtB,QAAOA,UAAQ;EAGjB,MAAM,IAAI,KAAK;EACf,MAAMD,MAAI,KAAK;EAEf,MAAMG,MAAI,IAAI,IAAIH,MAAIA;AAEtB,SAAO,IAAIC,UAAQ,IAAIE,KAAG,CAACH,MAAIG,IAAE;;CAQnC,aAAa,WAAY;AAEvB,SAAO,IAAIF,UAAQ,KAAK,OAAO,CAAC,KAAK,MAAM;;CAQ7C,OAAO,WAAY;AAEjB,SAAO,IAAIA,UAAQ,CAAC,KAAK,OAAO,CAAC,KAAK,MAAM;;CAQ9C,QAAQ,SAAU,QAAQ;AAExB,WAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,SAAO,IAAIA,UACT,KAAK,KAAK,KAAK,QAAQ,OAAO,GAAG,QACjC,KAAK,KAAK,KAAK,QAAQ,OAAO,GAAG,OAAO;;CAQ5C,SAAS,SAAU,QAAQ;AAEzB,WAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,SAAO,IAAIA,UACT,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,QAClC,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,OAAO;;CAQ7C,SAAS,SAAU,QAAQ;AAEzB,WAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,SAAO,IAAIA,UACT,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,QAClC,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,OAAO;;CAU7C,UAAU,SAAU,GAAG,KAAG;EAExB,MAAM,IAAI,MAAM,GAAGD,IAAE;AAErB,SAAO,KAAK,IAAI,EAAE,QAAQ,KAAK,MAAM,IAAIC,UAAQ,cAC/C,KAAK,IAAI,EAAE,QAAQ,KAAK,MAAM,IAAIA,UAAQ;;CAQ9C,SAAS,WAAY;AAEnB,SAAO,IAAIA,UAAQ,KAAK,OAAO,KAAK,MAAM;;CAQ5C,YAAY,WAAY;EAEtB,IAAI,IAAI,KAAK;EACb,IAAID,MAAI,KAAK;EACb,IAAI,MAAM;AAEV,MAAI,KAAK,UAAU,CACjB,QAAO;AAGT,MAAI,KAAK,eAAe,CACtB,QAAO;AAGT,MAAI,KAAK,IAAI,EAAE,GAAGC,UAAQ,WACxB,KAAI;AAGN,MAAI,KAAK,IAAID,IAAE,GAAGC,UAAQ,WACxB,OAAI;AAIN,MAAID,QAAM,EACR,QAAO,MAAM;AAGf,MAAI,MAAM,GAAG;AACX,UAAO;AACP,UAAO;AACP,OAAIA,MAAI,GAAG;AACT,UAAI,CAACA;AACL,WAAO;SAEP,QAAO;AAET,UAAO;aACEA,MAAI,GAAG;AAChB,SAAI,CAACA;AACL,UAAO;;AAGT,MAAI,MAAMA,IACR,QAAOA;AAET,SAAO,MAAM;;CAQf,YAAY,WAAY;AAEtB,SAAO,CAAC,KAAK,OAAO,KAAK,MAAM;;CAQjC,WAAW,WAAY;AAErB,MAAI,KAAK,UAAU,EACjB,QAAO,KAAK;AAEd,SAAO;;CAQT,SAAS,WAAY;AACnB,SAAO,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,MAAM;;CAS/C,UAAU,WAAY;AACpB,SAAO,KAAK,UAAU,KAAK,KAAK,UAAU;;CAS5C,YAAY,WAAY;AACtB,SAAO,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM;;CASrD,cAAc,WAAY;AACxB,SAAO,CAAC,KAAK,aAAa;;CAE7B;AAED,UAAQ,UAAU,IAAIC,UAAQ,GAAG,EAAE;AACnC,UAAQ,SAAS,IAAIA,UAAQ,GAAG,EAAE;AAClC,UAAQ,OAAO,IAAIA,UAAQ,GAAG,EAAE;AAChC,UAAQ,QAAQ,IAAIA,UAAQ,KAAK,IAAI,EAAE;AACvC,UAAQ,OAAO,IAAIA,UAAQ,KAAK,GAAG,EAAE;AACrC,UAAQ,cAAc,IAAIA,UAAQ,UAAU,SAAS;AACrD,UAAQ,SAAS,IAAIA,UAAQ,KAAK,IAAI;AACtC,UAAQ,aAAa;;;;AC17CrB,IAAII,UAAO;AACX,IAAIC,kBAAe,EAAE;AACrB,IAAW,qBAAoC,wBAAQD,SAAMC,uBAAoB;;;;AAI/E,QAAO,eAAeC,WAAS,QAAQ,EACrC,OAAO,WACR,CAAC;AACF,WAAQ,UAAU,cAAcA;AAChC,WAAQ,UAAU,OAAO;AACzB,WAAQ,UAAU,YAAY;;;;;;AAO9B,WAAQ,UAAU,SAAS,WAAY;AACrC,SAAO;GACL,QAAQ;GACR,IAAI,KAAK;GACT,IAAI,KAAK;GACV;;AAQH,WAAQ,UAAU,UAAU,WAAY;AACtC,SAAO;GACL,GAAG,KAAK,KAAK;GACb,KAAK,KAAK,KAAK;GAChB;;;;;;;;;;;AAYH,WAAQ,UAAU,SAAS,SAAU,SAAS;EAC5C,IAAI,MAAM;EACV,IAAI,KAAK,KAAK;EACd,IAAI,KAAK,KAAK;EACd,IAAI,QAAQC,SAAO,KAAK,IAAI,QAAQ;EACpC,IAAI,QAAQA,SAAO,KAAK,IAAI,QAAQ;EAGpC,IAAI,YAAY,SAAS,QAAQ,GAAG,UAAU,UAAU,QAAQ,YAAY;AAC5E,MAAI,cAAc,MAAM;GACtB,IAAI,UAAU,KAAK,IAAI,IAAI,CAAC,UAAU;AACtC,OAAI,KAAK,IAAI,KAAK,GAAG,GAAG,QACtB,MAAK;AAEP,OAAI,KAAK,IAAI,KAAK,GAAG,GAAG,QACtB,MAAK;;AAGT,MAAI,OAAO,EAET,OAAM;WACG,OAAO,EAEhB,KAAI,OAAO,EACT,OAAM;WACG,OAAO,GAChB,OAAM;MAEN,OAAM,QAAQ;WAIZ,KAAK,EACP,KAAI,OAAO,GACT,OAAM,QAAQ;MAEd,OAAM,QAAQ,QAAQ,MAAM,UAAU,EAAE,GAAG;WAGzC,OAAO,EACT,OAAM,QAAQ;MAEd,OAAM,QAAQ,QAAQ,QAAQ;AAIpC,SAAO;;;;;;;;;;;;;AAcT,WAAQ,YAAY,SAAU,MAAM;AAClC,UAAQ,UAAU,QAAlB;GACE,KAAK;IAED,IAAI,MAAM,UAAU;AACpB,QAAI,OAAO,QAAQ,SACjB,QAAOD,UAAQ,IAAI;QAEnB,OAAM,IAAI,UAAU,iDAAiD;GAG3E,KAAK;IAED,IAAI,IAAI,UAAU;IAClB,IAAI,MAAM,UAAU;AACpB,QAAI,SAAS,EAAE,EAAE;AACf,SAAI,OAAO,IAAI,IAAI,IAAI,QAAQ,QAAQ,CAErC,OAAM,IAAI,SAAS,MAAM;AAE3B,SAAI,SAAS,IAAI,CACf,QAAO,IAAIA,UAAQ;MACjB;MACA;MACD,CAAC;AAEJ,WAAM,IAAI,UAAU,yCAAyC;UAE7D,OAAM,IAAI,UAAU,4BAA4B;GAGtD,QACE,OAAM,IAAI,YAAY,kDAAkD;;;AAG9E,WAAQ,UAAU,UAAUA,UAAQ,UAAU;;;;;;;;;AAU9C,WAAQ,WAAW,SAAU,MAAM;AACjC,SAAO,IAAIA,UAAQ,KAAK;;;;;;;;;;;;;;;;;AAkB1B,WAAQ,UAAU,SAAU,GAAG,KAAG;AAChC,MAAI,EAAE,KAAKE,IAAE,GACX,QAAO;AAET,MAAI,EAAE,KAAKA,IAAE,GACX,QAAO;AAET,MAAI,EAAE,KAAKA,IAAE,GACX,QAAO;AAET,MAAI,EAAE,KAAKA,IAAE,GACX,QAAO;AAET,SAAO;;AAET,QAAOF;GACN,EACD,SAAS,MACV,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1JF,EAAC,SAAS,MAAM;AAEd;EAKA,IAAI,gBAAgB;EAGpB,IAAIG,MAAI;GACN,KAAK;GACL,KAAK;GACL,KAAK;GACN;EAED,SAAS,OAAO,GAAG,GAAG;AAEpB,OAAI,MAAM,IAAI,SAAS,GAAG,GAAG,CAAC,CAC5B,OAAM,kBAAkB;AAE1B,UAAO,IAAI;;EAIb,SAAS,YAAY,GAAG,KAAG;AAEzB,OAAIC,QAAM,EACR,OAAM,gBAAgB;GAGxB,IAAI,IAAI,OAAO,OAAOC,WAAS,UAAU;AACzC,KAAE,OAAO,IAAI,IAAI,KAAK;AAEtB,OAAI,IAAI,IAAI,CAAC,IAAI;GAEjB,IAAI,IAAI,IAAI,GAAGD,IAAE;AAEjB,KAAE,OAAO,IAAI;AACb,KAAE,OAAOA,MAAI;AACb,UAAO;;EAGT,SAAS,UAAU,KAAK;GAEtB,IAAI,UAAU,EAAE;GAEhB,IAAI,IAAI;GACR,IAAI,IAAI;GACR,IAAI,IAAI;AAER,UAAO,KAAK,GAAG;AAEb,WAAO,IAAI,MAAM,GAAG;AAClB,UAAI;AACJ,aAAQ,MAAM,QAAQ,MAAM,KAAK;;AAEnC,SAAI,IAAI,IAAI;;AAGd,OAAI,MAAM,KACR;QAAI,IAAI,EACN,SAAQ,MAAM,QAAQ,MAAM,KAAK;SAEnC,SAAQ,QAAQ,QAAQ,QAAQ,KAAK;AAEvC,UAAO;;EAGT,IAAIE,UAAQ,SAAS,IAAI,IAAI;GAE3B,IAAI,IAAI,GAAGF,MAAI,GAAG,IAAI;GACtB,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;GAEpC,IAAI,IAAI,GAAG,IAAI;GACf,IAAI,IAAI,GAAG,IAAI;GAEf,IAAI,IAAI;GACR,IAAI;AAEJ,OAAI,OAAO,UAAa,OAAO,MAAM,YAE1B,OAAO,QAAW;AAC3B,QAAI;AACJ,UAAI;AACJ,QAAI,IAAIA;AAER,QAAI,IAAI,MAAM,KAAKA,MAAI,MAAM,EAC3B,OAAM,qBAAqB;SAI7B,SAAQ,OAAO,IAAf;IAEE,KAAK;AAED,SAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,UAAI,GAAG;AACP,YAAI,GAAG;AACP,UAAI,OAAO,GACT,MAAI,GAAG;gBACA,KAAK,IAAI;AAClB,UAAI,GAAG;AACP,UAAI,KAAK,GACP,OAAI,GAAG;WAET,OAAM,kBAAkB;AAE1B,SAAI,IAAIA;AACR;IAEJ,KAAK;AAED,SAAI,KAAK,GAAG;AACV,UAAI;AACJ,WAAK,CAAC;;AAGR,SAAI,KAAK,MAAM,EACb,KAAI;cACK,KAAK,GAAG;AAEjB,UAAI,MAAM,GAAG;AACX,WAAI,KAAK,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,KAAK,CAAC;AAC1D,aAAK;;AAMP,aAAO,KAAK,KAAK,KAAK,GAAG;AACvB,YAAK,IAAI,MAAM,IAAI;AAEnB,WAAI,OAAO,GAAG;AACZ,YAAI,IAAI,KAAK,GAAG;AACd,aAAI,IAAI;AACR,eAAI,IAAI;mBACC,IAAI,GAAG;AAChB,aAAI;AACJ,eAAI;eACC;AACL,aAAI;AACJ,eAAI;;AAEN;cAEK;AAEL,YAAI,KAAK,GAAG;AACV,cAAI;AACJ,cAAI;eACC;AACL,cAAI;AACJ,cAAI;;AAGN,YAAI,IAAI,GAAG;AACT,aAAI;AACJ,eAAI;eACC;AACL,aAAI;AACJ,eAAI;;;;AAIV,WAAI;gBACK,MAAM,GAAG,IAAI,MAAM,GAAG,CAC/B,OAAI,IAAI;AAEV;IAEJ,KAAK;AAED,SAAI,GAAG,MAAM,SAAS;AAEtB,SAAI,MAAM,KACR,OAAM,kBAAkB;AAE1B,SAAI,EAAE,OAAO,KAAK;AAChB,UAAI;AACJ;gBACS,EAAE,OAAO,IAClB;AAGF,SAAI,EAAE,WAAW,IAAI,EACnB,KAAI,OAAO,EAAE,MAAM,EAAE;cACZ,EAAE,IAAI,OAAO,OAAO,EAAE,OAAO,KAAK;AAE3C,UAAI,EAAE,OAAO,IACX,KAAI,OAAO,EAAE,MAAM,EAAE;AAEvB;AAGA,UAAI,IAAI,MAAM,EAAE,UAAU,EAAE,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK;AACtG,WAAI,OAAO,EAAE,IAAI,EAAE;AACnB,WAAI,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;AAC7B;;AAIF,UAAI,EAAE,OAAO,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK;AACxE,WAAI,OAAO,EAAE,IAAI,IAAI,EAAE;AACvB,WAAI,KAAK,IAAI,IAAI,EAAE,IAAI,GAAG,OAAO,GAAG;AACpC,YAAI;;gBAGG,EAAE,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK;AAC/C,UAAI,OAAO,EAAE,IAAI,EAAE;AACnB,UAAI,OAAO,EAAE,IAAI,IAAI,EAAE;AACvB,WAAI;gBACK,EAAE,IAAI,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK;AAC/C,UAAI,OAAO,EAAE,IAAI,EAAE;AACnB,UAAI,OAAO,EAAE,IAAI,IAAI,EAAE;AACvB,UAAI,OAAO,EAAE,IAAI,IAAI,EAAE;AACvB,WAAI;;AAGN,SAAI,EAAE,UAAU,GAAG;AACjB,YAAI,IAAI;AACR,UACA,IAAI,IAAIA,MAAI,IAAI,IAAI;AACpB;;IAKN,QACE,OAAM,kBAAkB;;AAG9B,OAAIA,QAAM,EACR,OAAM,gBAAgB;AAGxB,OAAE,OAAO,IAAI,IAAI,KAAK;AACtB,OAAE,OAAO,KAAK,IAAI,EAAE;AACpB,OAAE,OAAO,KAAK,IAAIA,IAAE;;EAGtB,SAAS,OAAO,KAAG,GAAG,GAAG;GAEvB,IAAI,IAAI;AACR,UAAO,IAAI,GAAG,MAAKG,MAAIA,MAAK,GAAG,MAAM,EAEnC,KAAI,IAAI,EACN,KAAK,IAAIA,MAAK;AAGlB,UAAO;;EAIT,SAAS,SAAS,GAAG,KAAG;AAEtB,UAAOH,MAAI,MAAM,GACf,OAAI;AAGN,UAAOA,MAAI,MAAM,GACf,OAAI;AAGN,OAAIA,QAAM,EACR,QAAO;GAOT,IAAI,MAAM,KAAKA;GACf,IAAI,IAAI;AAER,UAAO,QAAQ,GAAG,KAAK;AACrB,UAAM,MAAM,KAAKA;AAEjB,QAAI,IAAI,cACN,QAAO;;AAEX,UAAO;;EAIT,SAAS,WAAW,GAAG,KAAG,KAAK;GAE7B,IAAI,OAAO;GACX,IAAI,OAAO,OAAO,IAAI,KAAKA,IAAE;AAE7B,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,QAAI,SAAS,KACX,QAAO;AAET,WAAO,OAAO,KAAKA;AACnB,WAAO,OAAO,KAAKA;;AAErB,UAAO;;EAGT,SAAS,IAAI,GAAG,KAAG;AAEjB,OAAI,CAAC,EACH,QAAOG;AACT,OAAI,CAACA,IACH,QAAO;AAET,UAAO,GAAG;AACR,SAAIA;AACJ,QAAI,CAAC,EACH,QAAOA;AACT,WAAI;AACJ,QAAI,CAACA,IACH,QAAO;;;;;;;;;;EAWb,SAASF,WAAS,GAAG,KAAG;AAEtB,WAAM,GAAGE,IAAE;AAEX,OAAI,gBAAgBF,YAAU;AAC5B,QAAI,IAAIF,IAAE,MAAMA,IAAE,KAAK;AACvB,SAAK,OAAOA,IAAE;AACd,SAAK,OAAOA,IAAE,OAAO;AACrB,SAAK,OAAOA,IAAE,OAAO;SAErB,QAAO,YAAYA,IAAE,OAAOA,IAAE,MAAMA,IAAE,KAAK;;EAI/C,IAAI,iBAAiB,WAAW;AAAE,0BAAO,IAAI,MAAM,mBAAmB;;EACtE,IAAI,mBAAmB,WAAW;AAAE,0BAAO,IAAI,MAAM,mBAAmB;;EACxE,IAAI,sBAAsB,WAAW;AAAE,0BAAO,IAAI,MAAM,6BAA6B;;AAErF,aAAS,YAAY;GAEnB,KAAK;GACL,KAAK;GACL,KAAK;GAOL,OAAO,WAAW;AAEhB,WAAO,YAAY,KAAK,MAAM,KAAK,KAAK;;GAQ1C,OAAO,WAAW;AAEhB,WAAO,YAAY,CAAC,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;;GAQvD,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AACX,WAAO,YACL,KAAK,OAAO,KAAK,OAAOJ,IAAE,OAAOA,IAAE,OAAO,KAAK,OAAOA,IAAE,MACxD,KAAK,OAAOA,IAAE,KACf;;GAQH,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AACX,WAAO,YACL,KAAK,OAAO,KAAK,OAAOJ,IAAE,OAAOA,IAAE,OAAO,KAAK,OAAOA,IAAE,MACxD,KAAK,OAAOA,IAAE,KACf;;GAQH,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AACX,WAAO,YACL,KAAK,OAAOJ,IAAE,OAAO,KAAK,OAAOA,IAAE,MACnC,KAAK,OAAOA,IAAE,KACf;;GAQH,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AACX,WAAO,YACL,KAAK,OAAOJ,IAAE,OAAO,KAAK,OAAOA,IAAE,MACnC,KAAK,OAAOA,IAAE,KACf;;GAQH,SAAS,WAAW;AAClB,WAAO,YAAY,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;;GAQtD,OAAO,SAAS,GAAG,KAAG;AAEpB,QAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CACtC,QAAO,IAAIE,WAAS,IAAI;AAG1B,QAAI,MAAM,OACR,QAAO,YAAY,KAAK,OAAO,KAAK,OAAO,KAAK,MAAM,EAAE;AAG1D,YAAM,GAAGE,IAAE;AACX,QAAI,MAAMJ,IAAE,QAAQ,MAAM,KAAK,KAC7B,OAAM,gBAAgB;AAiBxB,WAAO,YACL,KAAK,QAAQA,IAAE,OAAO,KAAK,SAASA,IAAE,OAAO,KAAK,OAClDA,IAAE,OAAO,KAAK,KACf;;GAQH,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AAIX,WAAO,YAAY,IAAIJ,IAAE,MAAM,KAAK,KAAK,GAAG,IAAIA,IAAE,MAAM,KAAK,KAAK,EAAEA,IAAE,OAAO,KAAK,KAAK;;GAQzF,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGI,IAAE;AAIX,QAAIJ,IAAE,SAAS,KAAK,KAAK,SAAS,EAChC,QAAO,YAAY,GAAG,EAAE;AAE1B,WAAO,YAAYA,IAAE,OAAO,KAAK,MAAM,IAAIA,IAAE,MAAM,KAAK,KAAK,GAAG,IAAIA,IAAE,MAAM,KAAK,KAAK,CAAC;;GAQzF,QAAQ,SAAS,QAAQ;AAEvB,aAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,QAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CACtC,QAAO,IAAIE,WAAS,IAAI;AAE1B,WAAO,YAAY,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,OAAO,KAAK,KAAK,EAAE,OAAO;;GAQnF,SAAS,SAAS,QAAQ;AAExB,aAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,QAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CACtC,QAAO,IAAIA,WAAS,IAAI;AAE1B,WAAO,YAAY,KAAK,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,KAAK,KAAK,EAAE,OAAO;;GAQpF,SAAS,SAAS,QAAQ;AAExB,aAAS,KAAK,IAAI,IAAI,UAAU,EAAE;AAElC,QAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CACtC,QAAO,IAAIA,WAAS,IAAI;AAE1B,WAAO,YAAY,KAAK,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,KAAK,KAAK,EAAE,OAAO;;GAQpF,WAAW,WAAW;AAEpB,WAAO,YAAY,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;;GAQtD,OAAO,SAAS,GAAG,KAAG;AAEpB,YAAM,GAAGE,IAAE;AAIX,QAAIJ,IAAE,SAAS,EAEb,KAAIA,IAAE,OAAO,EACX,QAAO,YAAY,KAAK,IAAI,KAAK,OAAO,KAAK,MAAMA,IAAE,KAAK,EAAE,KAAK,IAAI,KAAK,MAAMA,IAAE,KAAK,CAAC;QAExF,QAAO,YAAY,KAAK,IAAI,KAAK,OAAO,KAAK,MAAMA,IAAE,KAAK,EAAE,KAAK,IAAI,KAAK,MAAMA,IAAE,KAAK,CAAC;AAU5F,QAAI,KAAK,OAAO,EAAG,QAAO;IAG1B,IAAI,IAAI,UAAU,KAAK,KAAK;IAC5B,IAAI,IAAI,UAAU,KAAK,KAAK;IAG5B,IAAI,IAAI;IACR,IAAIC,MAAI;AACR,SAAK,IAAI,KAAK,GAAG;AACf,SAAI,MAAM,IAAK;AACf,SAAI,MAAM,KAAK;AACb,UAAI;AACJ;;AAEF,OAAE,MAAKD,IAAE;AAET,SAAI,EAAE,KAAKA,IAAE,SAAS,EACpB,GAAE,MAAKA,IAAE;SACJ,QAAO;AACd,UAAI,KAAK,IAAI,GAAG,EAAE,GAAG;;AAGvB,SAAK,IAAI,KAAK,GAAG;AACf,SAAI,MAAM,IAAK;AACf,OAAE,MAAKA,IAAE;AAET,SAAI,EAAE,KAAKA,IAAE,SAAS,EACpB,GAAE,MAAKA,IAAE;SACJ,QAAO;AACd,YAAI,KAAK,IAAI,GAAG,EAAE,GAAG;;AAGvB,QAAIA,IAAE,OAAO,EACX,QAAO,YAAYC,KAAG,EAAE;AAE1B,WAAO,YAAY,GAAGA,IAAE;;GAQ1B,UAAU,SAAS,GAAG,KAAG;AAEvB,YAAM,GAAGG,IAAE;AACX,WAAO,KAAK,OAAO,KAAK,OAAOJ,IAAE,SAASA,IAAE,OAAOA,IAAE,OAAO,KAAK;;GAQnE,WAAW,SAAS,GAAG,KAAG;AAExB,YAAM,GAAGI,IAAE;IACX,IAAI,IAAK,KAAK,OAAO,KAAK,OAAOJ,IAAE,OAAOA,IAAE,OAAOA,IAAE,OAAO,KAAK;AACjE,YAAQ,IAAI,MAAM,IAAI;;GAGxB,YAAY,SAAS,KAAK;AAExB,QAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,CACtC,QAAO;AAGT,UAAM,OAAO;IAEb,IAAI,UAAU,KAAK,QAAQ;IAC3B,IAAI,OAAO,QAAQ,gBAAgB;AAEnC,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;KAEpC,IAAI,IAAI,YAAY,KAAK,IAAI,IAAI,EAAE;AACnC,UAAK,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,IAC1B,KAAI,EAAE,YAAY,CAAC,OAAO,KAAK,GAAG;AAGpC,SAAI,KAAK,IAAI,EAAE,OAAO,QAAQ,CAAC,SAAS,CAAC,GAAG,IAC1C,QAAO,EAAE,OAAO,KAAK,KAAK;;AAG9B,WAAO;;GAQT,aAAa,SAAS,GAAG,KAAG;AAE1B,YAAM,GAAGI,IAAE;AACX,WAAO,EAAE,EAAEJ,IAAE,OAAO,KAAK,SAAW,KAAK,OAAOA,IAAE,QAASA,IAAE,OAAO,KAAK;;GAQ3E,WAAW,WAAW;AAEpB,WAAO,KAAK,OAAO,KAAK,OAAO,KAAK;;GAQtC,cAAc,SAAS,cAAc;IAEnC,IAAI,OAAO,MAAM;IACjB,IAAI,IAAI,KAAK;IACb,IAAIC,MAAI,KAAK;AACb,QAAI,KAAK,OAAO,EACd,QAAM;AAGR,QAAIA,QAAM,EACR,QAAM;SACD;AAEL,SAAI,iBAAiB,QAAQ,KAAK,MAAM,IAAIA,IAAE,IAAI,GAAG;AACnD,aAAM;AACN,aAAM;AACN,WAAIA;;AAGN,YAAM;AACN,YAAM;AACN,YAAMA;;AAER,WAAO;;GAQT,WAAW,SAAS,cAAc;IAEhC,IAAI,OAAO,MAAM;IACjB,IAAI,IAAI,KAAK;IACb,IAAIA,MAAI,KAAK;AACb,QAAI,KAAK,OAAO,EACd,QAAM;AAGR,QAAIA,QAAM,EACR,QAAM;SACD;AAEL,SAAI,iBAAiB,QAAQ,KAAK,MAAM,IAAIA,IAAE,IAAI,GAAG;AACnD,aAAM;AACN,WAAIA;;AAGN,YAAM;AACN,YAAM;AACN,YAAM;AACN,YAAMA;AACN,YAAM;;AAER,WAAO;;GAQT,eAAe,WAAW;IAExB,IAAI;IACJ,IAAI,IAAI,KAAK;IACb,IAAIG,MAAI,KAAK;IACb,IAAI,MAAM,EAAE;AAEZ,QAAI,MAAM,EAAE,IAAI,MAAMA,IAAE,CACtB,QAAO;AAGT,OAAG;AACD,SAAI,KAAK,KAAK,MAAM,IAAIA,IAAE,CAAC;AAC3B,SAAI,IAAIA;AACR,SAAIA;AACJ,WAAI;aACG,MAAM;AAEf,WAAO;;GAQT,YAAY,SAAS,KAAK;IAExB,IAAI,IAAI,KAAK;IACb,IAAI,IAAI,KAAK;AAEb,QAAI,MAAM,EAAE,IAAI,MAAM,EAAE,CACtB,QAAO;AAGT,UAAM,OAAO;IAEb,IAAI,SAAS,SAAS,GAAG,EAAE;IAC3B,IAAI,SAAS,WAAW,GAAG,GAAG,OAAO;IAErC,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM;AAEhC,WAAM,IAAI,IAAI;AAEd,SAAI;AACJ,SAAI;AAEJ,QAAI,EACF,QAAM;AAER,QAAI,QAAQ;AAEV,UAAK,IAAI,IAAI,QAAQ,MAAM;AACzB,aAAM,IAAI,IAAI;AACd,WAAI;AACJ,WAAI;;AAEN,YAAM;AACN,UAAK,IAAI,IAAI,QAAQ,MAAM;AACzB,aAAM,IAAI,IAAI;AACd,WAAI;AACJ,WAAI;;AAEN,YAAM;UAEN,MAAK,IAAI,IAAI,KAAK,KAAK,MAAM;AAC3B,YAAM,IAAI,IAAI;AACd,UAAI;AACJ,UAAI;;AAGR,WAAO;;GAEV;AAED,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAO,eAAeF,YAAU,cAAc,EAAE,SAAS,MAAM,CAAC;AAChE,cAAS,aAAaA;AACtB,cAAS,cAAcA;AACvB,UAAO,aAAaA;QAEpB,MAAK,cAAcA;YAGf;;;;;;ACp3BR,IAAIG,UAAO;AACX,IAAIC,kBAAe,EAAE;AACrB,IAAW,sBAAqC,wBAAQD,SAAMC,uBAAoB;;;;AAIhF,QAAO,eAAeC,yBAAU,QAAQ,EACtC,OAAO,YACR,CAAC;AACF,yBAAS,UAAU,cAAcA;AACjC,yBAAS,UAAU,OAAO;AAC1B,yBAAS,UAAU,aAAa;;;;;;AAOhC,yBAAS,UAAU,SAAS,WAAY;AACtC,SAAO;GACL,QAAQ;GACR,GAAG,KAAK,IAAI,KAAK;GACjB,GAAG,KAAK;GACT;;;;;;;;AASH,yBAAS,WAAW,SAAU,MAAM;AAClC,SAAO,IAAIA,wBAAS,KAAK;;AAE3B,QAAOA;GACN,EACD,SAAS,MACV,CAAC;;;;ACvCF,IAAIC,UAAO;AACX,IAAIC,kBAAe,EAAE;AACrB,IAAW,oBAAmC,wBAAQD,SAAMC,uBAAoB;;;;;;;;;;;;;;;;;;;;;;;CAuB9E,SAASC,WAAS;AAChB,MAAI,EAAE,gBAAgBA,UACpB,OAAM,IAAI,YAAY,mDAAmD;;;;;AAO7E,UAAO,UAAU,OAAO;AACxB,UAAO,UAAU,WAAW;;;;;;;;;AAU5B,UAAO,UAAU,UAAU,WAAY;AAErC,QAAM,IAAI,MAAM,8CAA8C;;;;;;;;;;AAWhE,UAAO,UAAU,WAAW,WAAY;AAEtC,QAAM,IAAI,MAAM,+CAA+C;;;;;;;AAQjE,UAAO,UAAU,SAAS,SAAU,MAAM,UAAU;AAClD,QAAM,IAAI,MAAM,6CAA6C;;;;;;;;;;;;;;;AAgB/D,UAAO,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AAEpE,QAAM,IAAI,MAAM,6CAA6C;;;;;;;AAQ/D,UAAO,UAAU,MAAM,SAAU,OAAO;AAEtC,QAAM,IAAI,MAAM,0CAA0C;;;;;;;;;;;AAY5D,UAAO,UAAU,MAAM,SAAU,OAAO,OAAO,cAAc;AAE3D,QAAM,IAAI,MAAM,0CAA0C;;;;;;;;;;;;;;AAe5D,UAAO,UAAU,SAAS,SAAU,MAAM,cAAc;AAEtD,QAAM,IAAI,MAAM,6CAA6C;;;;;;;;;;;AAY/D,UAAO,UAAU,UAAU,SAAU,MAAM,cAAc;AAEvD,QAAM,IAAI,MAAM,8CAA8C;;;;;;AAOhE,UAAO,UAAU,QAAQ,WAAY;AAEnC,QAAM,IAAI,MAAM,4CAA4C;;;;;;AAO9D,UAAO,UAAU,OAAO,WAAY;AAElC,QAAM,IAAI,MAAM,2CAA2C;;;;;;;;;;;;AAa7D,UAAO,UAAU,MAAM,SAAU,UAAU,WAAW;AAEpD,QAAM,IAAI,MAAM,0CAA0C;;;;;;;;AAS5D,UAAO,UAAU,UAAU,SAAU,UAAU;AAE7C,QAAM,IAAI,MAAM,8CAA8C;;;;;;AAOhE,UAAO,UAAU,OAAO,YAAY,WAAY;AAE9C,QAAM,IAAI,MAAM,oCAAoC;;;;;;AAOtD,UAAO,UAAU,UAAU,WAAY;AAErC,QAAM,IAAI,MAAM,8CAA8C;;;;;;AAOhE,UAAO,UAAU,UAAU,WAAY;AAErC,QAAM,IAAI,MAAM,8CAA8C;;;;;;;;;;AAWhE,UAAO,UAAU,SAAS,SAAU,SAAS;AAE3C,QAAM,IAAI,MAAM,6CAA6C;;;;;;AAO/D,UAAO,UAAU,WAAW,WAAY;AAEtC,QAAM,IAAI,MAAM,+CAA+C;;AAEjE,QAAOA;GACN,EACD,SAAS,MACV,CAAC;;;;;;;;;;;ACvOF,SAAS,sBAAsB,GAAG,MAAM,MAAM;CAC5C,IAAI,gBAAgB,EAAE;CACtB,IAAI,OAAO,IAAI,cAAc,EAAE;CAC/B,IAAI,SAAS;AACb,KAAI,MAAM;AACR,MAAI,OAAO,EACT,OAAM,IAAI,MAAM,iCAAiC;AAEnD,MAAI,CAACC,YAAU,KAAK,CAClB,OAAM,IAAI,MAAM,0BAA0B;AAE5C,MAAI,EAAE,YAAY,KAAK,IAAI,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,IAAI,OAAO,EAAE,CAAC,IAAI,GAAG,CAAC,CACpF,OAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG,OAAO,CAAC,OAAO,OAAO,GAAG,MAAM,CAAC;AAEjG,MAAI,CAAC,EAAE,WAAW,CAChB,OAAM,IAAI,MAAM,2BAA2B;AAE7C,MAAI,EAAE,SAAS,EAAE,CACf,KAAI,EAAE,IAAI,KAAK,IAAI,KAAK,CAAC;AAE3B,WAAS,IAAI,OAAO,KAAK;;AAE3B,SAAQ,MAAR;EACE,KAAK,EACH,QAAO,GAAG,OAAO,EAAE,UAAU,CAAC,CAAC,OAAO,OAAO;EAC/C,KAAK,EACH,QAAO,GAAG,OAAO,EAAE,SAAS,CAAC,CAAC,OAAO,OAAO;EAC9C,KAAK,GACH,QAAO,GAAG,OAAO,EAAE,eAAe,CAAC,CAAC,OAAO,OAAO;EACpD,QACE,OAAM,IAAI,MAAM,QAAQ,OAAO,MAAM,kBAAkB,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqF9D,SAAgBC,SAAO,OAAO,SAAS;AACrC,KAAI,OAAO,YAAY,WAErB,QAAO,QAAQ,MAAM;AAIvB,KAAI,CAAC,MAAM,UAAU,CACnB,QAAO,MAAM,OAAO,GAAG,QAAQ,MAAM,GAAG,EAAE,GAAG,aAAa;CAE5D,IAAI,EACF,UACA,WACA,aACE,uBAAuB,QAAQ;AAGnC,SAAQ,UAAR;EACE,KAAK,QACH,QAAO,QAAQ,OAAO,UAAU;EAClC,KAAK,cACH,QAAO,cAAc,OAAO,UAAU;EACxC,KAAK,cACH,QAAO,cAAc,OAAO,UAAU;EACxC,KAAK,MACH,QAAO,sBAAsB,OAAO,GAAG,SAAS;EAClD,KAAK,MACH,QAAO,sBAAsB,OAAO,GAAG,SAAS;EAClD,KAAK,MACH,QAAO,sBAAsB,OAAO,IAAI,SAAS;EACnD,KAAK;GAID,IAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,GAAG;GACzG,IAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,EAAE;AAGxG,OAAI,MAAM,QAAQ,CAAE,QAAO;GAG3B,IAAI;GACJ,IAAI,UAAU,MAAM,oBAAoB,UAAU;GAClD,IAAIC,QAAM,QAAQ;AAClB,OAAIA,SAAO,YAAYA,QAAM,SAE3B,OAAM,QAAQ,SAAS;OAGvB,OAAM,cAAc,OAAO,UAAU;AAIvC,UAAO,IAAI,QAAQ,uBAAuB,WAAY;IACpD,IAAIC,WAAS,UAAU;IACvB,IAAI,IAAI,UAAU;AAClB,WAAOA,aAAW,MAAMA,WAAS,IAAI;KACrC;EAEN,QACE,OAAM,IAAI,MAAM,wBAAuB,WAAW,+EAAwE;;;;;;;;AAShI,SAAgB,cAAc,OAAO,WAAW;CAE9C,IAAI,IAAI,MAAM;CACd,IAAI,SAAS,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;CAI/D,IAAI,WADkB,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,CACvB,YAAY,UAAU;AACrD,KAAI,SAAS,SAAS,IAAI,EAAE;EAC1B,IAAIC,cAAY,MAAM;AACtB,aAAW,IAAIA,YAAU,SAAS,CAAC,SAAS;;AAE9C,QAAO,WAAW,OAAO,KAAK,IAAI,MAAM,MAAM,OAAO,UAAU;;;;;;;;;;AAWjE,SAAgB,cAAc,OAAO,WAAW;AAC9C,KAAI,cAAc,OAChB,QAAO,MAAM,cAAc,YAAY,EAAE;KAEzC,QAAO,MAAM,eAAe;;;;;;;;AAUhC,SAAgB,QAAQ,OAAO,WAAW;AACxC,QAAO,MAAM,QAAQ,UAAU;;AAEjC,SAAS,mBAAmB,OAAO,cAAc;AAC/C,KAAI,SAAS,MAAM,CACjB,QAAO;UACE,YAAY,MAAM,CAC3B,QAAO,MAAM,UAAU;KAEvB,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3LX,SAAgBC,SAAO,OAAO,SAAS;CACrC,IAAI,SAAS,QAAQ,OAAO,QAAQ;AACpC,KAAI,WAAW,OAAO,YAAY,YAAY,cAAc,WAAW,OAAO,SAAS,QAAQ,SAC7F,QAAO,OAAO,UAAU,GAAG,QAAQ,WAAW,EAAE,GAAG;AAErD,QAAO;;AAET,SAAS,QAAQ,OAAO,SAAS;AAC/B,KAAI,OAAO,UAAU,SACnB,QAAOC,SAAa,OAAO,QAAQ;AAErC,KAAI,YAAY,MAAM,CACpB,QAAOC,SAAgB,OAAO,QAAQ;AAKxC,KAAI,kBAAkB,MAAM,CAC1B,KAAI,CAAC,WAAW,QAAQ,aAAa,UAEnC,QAAO,MAAM,IAAI,MAAM,IAAI,MAAM,MAAM;KAGvC,QAAO,MAAM,UAAU;AAG3B,KAAI,MAAM,QAAQ,MAAM,CACtB,QAAO,YAAY,OAAO,QAAQ;AAEpC,KAAI,SAAS,MAAM,CACjB,QAAO,UAAU,MAAM;AAEzB,KAAI,OAAO,UAAU,WACnB,QAAO,MAAM,SAAS,OAAO,MAAM,OAAO,GAAG;AAE/C,KAAI,SAAS,OAAO,UAAU,SAC5B,KAAI,OAAO,MAAM,WAAW,WAC1B,QAAO,MAAM,OAAO,QAAQ;UACnB,SAAS,MAAM,SAAS,QAAQ,KAAK,EAAE,CAAC,UAAU,CAE3D,QAAO,MAAM,SAAS,QAAQ;KAK9B,QAAO,MAHO,OAAO,KAAK,MAAM,CAAC,KAAI,QAAO;AAC1C,SAAO,UAAU,IAAI,GAAG,OAAOF,SAAO,MAAM,MAAM,QAAQ;GAC1D,CACmB,KAAK,KAAK,GAAG;AAGtC,QAAO,OAAO,MAAM;;;;;;;;AAStB,SAAgB,UAAU,OAAO;CAC/B,IAAI,OAAO,OAAO,MAAM;CACxB,IAAI,UAAU;CACd,IAAI,IAAI;AACR,QAAO,IAAI,KAAK,QAAQ;EACtB,IAAI,IAAI,KAAK,OAAO,EAAE;AACtB,aAAW,KAAK,oBAAoB,kBAAkB,KAAK;AAC3D;;AAEF,QAAO,OAAM,UAAU;;AAEzB,IAAI,oBAAoB;CACtB,MAAK;CACL,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,KAAM;CACP;;;;;;;;;;;AAuBD,SAAS,YAAY,OAAO,SAAS;AACnC,KAAI,MAAM,QAAQ,MAAM,EAAE;EACxB,IAAI,MAAM;EACV,IAAI,MAAM,MAAM;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,OAAI,MAAM,EACR,QAAO;AAET,UAAO,YAAY,MAAM,IAAI,QAAQ;;AAEvC,SAAO;AACP,SAAO;OAEP,QAAOA,SAAO,OAAO,QAAQ;;;;;;;AASjC,SAAS,kBAAkB,OAAO;AAChC,QAAO,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY;;;;;;;;;;;;;;ACtK5I,SAAgB,eAAe,QAAQ,UAAU,UAAU;AACzD,KAAI,EAAE,gBAAgB,gBACpB,OAAM,IAAI,YAAY,mDAAmD;AAE3E,MAAK,SAAS;AACd,MAAK,WAAW;AAChB,MAAK,WAAW;AAChB,MAAK,UAAU,0BAA0B,MAAM,QAAQ,OAAO,GAAG,MAAM,OAAO,KAAK,KAAK,GAAG,MAAM,UAAU,OAAO,KAAK,YAAY,QAAQ,OAAO,MAAM,QAAQ,SAAS,GAAG,MAAM,SAAS,KAAK,KAAK,GAAG,MAAM,YAAY;AAC1N,MAAK,yBAAQ,IAAI,OAAO,EAAC;;AAE3B,eAAe,4BAAY,IAAI,YAAY;AAC3C,eAAe,UAAU,cAAc;AACvC,eAAe,UAAU,OAAO;AAChC,eAAe,UAAU,mBAAmB;;;;;;;;;;;;;;ACZ5C,SAAgB,WAAW,OAAO,OAAK,OAAK;AAC1C,KAAI,EAAE,gBAAgB,YACpB,OAAM,IAAI,YAAY,mDAAmD;AAE3E,MAAK,QAAQ;AACb,KAAI,UAAU,SAAS,GAAG;AACxB,OAAK,MAAM;AACX,OAAK,MAAMG;QACN;AACL,OAAK,MAAMA;AACX,OAAK,MAAMC;;AAEb,KAAI,KAAK,QAAQ,UAAa,KAAK,QAAQ,KAAK,IAC9C,MAAK,UAAU,yBAAyB,KAAK,QAAQ,QAAQ,KAAK,MAAM;UAC/D,KAAK,QAAQ,UAAa,KAAK,SAAS,KAAK,IACtD,MAAK,UAAU,yBAAyB,KAAK,QAAQ,SAAS,KAAK,MAAM,KAAK;KAE9E,MAAK,UAAU,yBAAyB,KAAK,QAAQ;AAEvD,MAAK,yBAAQ,IAAI,OAAO,EAAC;;AAE3B,WAAW,4BAAY,IAAI,YAAY;AACvC,WAAW,UAAU,cAAc;AACnC,WAAW,UAAU,OAAO;AAC5B,WAAW,UAAU,eAAe;;;;;;;;;;;ACnBpC,SAAgB,UAAU,GAAG;CAC3B,IAAI,IAAI,EAAE;AACV,QAAO,MAAM,QAAQ,EAAE,EAAE;AACvB,IAAE,KAAK,EAAE,OAAO;AAChB,MAAI,EAAE;;AAER,QAAO;;;;;;;;;;;AAYT,SAAS,UAAU,OAAO,MAAM,KAAK;CACnC,IAAI;CACJ,IAAI,MAAM,MAAM;AAChB,KAAI,QAAQ,KAAK,KACf,OAAM,IAAI,eAAe,KAAK,KAAK,KAAK;AAE1C,KAAI,MAAM,KAAK,SAAS,GAAG;EAEzB,IAAI,UAAU,MAAM;AACpB,OAAK,IAAI,GAAG,IAAI,KAAK,KAAK;GACxB,IAAI,QAAQ,MAAM;AAClB,OAAI,CAAC,MAAM,QAAQ,MAAM,CACvB,OAAM,IAAI,eAAe,KAAK,SAAS,GAAG,KAAK,QAAQ,IAAI;AAE7D,aAAU,MAAM,IAAI,MAAM,QAAQ;;OAIpC,MAAK,IAAI,GAAG,IAAI,KAAK,IACnB,KAAI,MAAM,QAAQ,MAAM,GAAG,CACzB,OAAM,IAAI,eAAe,KAAK,SAAS,GAAG,KAAK,QAAQ,IAAI;;;;;;;;;AAanE,SAAgB,SAAS,OAAO,MAAM;AAEpC,KADe,KAAK,WAAW,GAG7B;MAAI,MAAM,QAAQ,MAAM,CACtB,OAAM,IAAI,eAAe,MAAM,QAAQ,EAAE;OAI3C,WAAU,OAAO,MAAM,EAAE;;;;;;;;AA2B7B,SAAgB,cAAc,OAAO,QAAQ;AAC3C,KAAI,UAAU,QAAW;AACvB,MAAI,CAAC,SAAS,MAAM,IAAI,CAACC,YAAU,MAAM,CACvC,OAAM,IAAI,UAAU,sCAAsC,QAAQ,IAAI;AAExE,MAAI,QAAQ,KAAK,OAAO,WAAW,YAAY,SAAS,OACtD,OAAM,IAAI,WAAW,OAAO,OAAO;;;;;;;;;;;;;AAuCzC,SAAgB,OAAO,OAAO,MAAM,cAAc;AAEhD,KAAI,CAAC,MAAM,QAAQ,KAAK,CACtB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,KAAI,KAAK,WAAW,EAClB,OAAM,IAAI,MAAM,sCAAsC;AAIxD,MAAK,QAAQ,SAAU,OAAO;AAC5B,MAAI,CAAC,SAAS,MAAM,IAAI,CAACA,YAAU,MAAM,IAAI,QAAQ,EACnD,OAAM,IAAI,UAAU,yDAA8DC,SAAO,KAAK,GAAG,IAAI;GAEvG;AAGF,KAAI,SAAS,MAAM,IAAI,YAAY,MAAM,CACvC,SAAQ,CAAC,MAAM;AAKjB,SAAQ,OAAO,MAAM,GADD,iBAAiB,SAAY,eAAe,EAC1B;AACtC,QAAO;;;;;;;;;;;AAYT,SAAS,QAAQ,OAAO,MAAM,KAAK,cAAc;CAC/C,IAAI;CACJ,IAAI;CACJ,IAAI,SAAS,MAAM;CACnB,IAAI,SAAS,KAAK;CAClB,IAAI,SAAS,KAAK,IAAI,QAAQ,OAAO;AAGrC,OAAM,SAAS;AACf,KAAI,MAAM,KAAK,SAAS,GAAG;EAEzB,IAAI,UAAU,MAAM;AAGpB,OAAK,IAAI,GAAG,IAAI,QAAQ,KAAK;AAE3B,UAAO,MAAM;AACb,OAAI,CAAC,MAAM,QAAQ,KAAK,EAAE;AACxB,WAAO,CAAC,KAAK;AACb,UAAM,KAAK;;AAEb,WAAQ,MAAM,MAAM,SAAS,aAAa;;AAI5C,OAAK,IAAI,QAAQ,IAAI,QAAQ,KAAK;AAEhC,UAAO,EAAE;AACT,SAAM,KAAK;AAGX,WAAQ,MAAM,MAAM,SAAS,aAAa;;QAEvC;AAIL,OAAK,IAAI,GAAG,IAAI,QAAQ,IACtB,QAAO,MAAM,QAAQ,MAAM,GAAG,CAC5B,OAAM,KAAK,MAAM,GAAG;AAKxB,OAAK,IAAI,QAAQ,IAAI,QAAQ,IAC3B,OAAM,KAAK;;;;;;;;;;;;;AAejB,SAAgB,QAAQ,OAAO,OAAO;CACpC,IAAI,YAAY,QAAQ,MAAM;CAC9B,IAAI,gBAAgB,UAAU;AAC9B,KAAI,CAAC,MAAM,QAAQ,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,CAChD,OAAM,IAAI,UAAU,iBAAiB;AAEvC,KAAI,MAAM,WAAW,EACnB,OAAM,IAAI,eAAe,GAAG,eAAe,KAAK;AAElD,SAAQ,qBAAqB,OAAO,cAAc;CAClD,IAAI,YAAY,QAAQ,MAAM;AAC9B,KAAI,kBAAkB,UACpB,OAAM,IAAI,eAAe,WAAW,eAAe,KAAK;AAE1D,KAAI;AACF,SAAO,SAAS,WAAW,MAAM;UAC1B,GAAG;AACV,MAAI,aAAa,eACf,OAAM,IAAI,eAAe,WAAW,eAAe,KAAK;AAE1D,QAAM;;;;;;;;;;AAWV,SAAgB,qBAAqB,OAAO,eAAe;CACzD,IAAI,YAAY,QAAQ,MAAM;CAC9B,IAAI,iBAAiB,MAAM,OAAO;CAClC,IAAI,WAAW;CACf,IAAI,gBAAgB,MAAM,QAAQ,SAAS;AAE3C,KAD4B,MAAM,QAAQ,UAAU,gBAAgB,EAAE,IAAI,EAExE,OAAM,IAAI,MAAM,kCAAkC;CAEpD,IAAI,cAAc,iBAAiB;CACnC,IAAI,qBAAqB,gBAAgB,cAAc;AACvD,KAAI,YACF,KAAI,mBACF,gBAAe,iBAAiB,CAAC,gBAAgB;KAEjD,OAAM,IAAI,MAAM,uCAAuC,gBAAgB,wBAAwB,CAAC,UAAU;AAG9G,QAAO;;;;;;;AAQT,SAAS,QAAQ,OAAO;AACtB,QAAO,MAAM,QAAQ,MAAM,SAAS,OAAO,MAAM,EAAE;;;;;;;;;AAWrD,SAAS,SAAS,OAAO,OAAO;CAE9B,IAAI,WAAW;CACf,IAAI;AAEJ,MAAK,IAAI,YAAY,MAAM,SAAS,GAAG,YAAY,GAAG,aAAa;EACjE,IAAI,OAAO,MAAM;AACjB,cAAY,EAAE;EAGd,IAAI,SAAS,SAAS,SAAS;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,WAAU,KAAK,SAAS,MAAM,IAAI,OAAO,IAAI,KAAK,KAAK,CAAC;AAG1D,aAAW;;AAEb,QAAO;;;;;;;;;;;;;;AAmET,SAAgB,UAAU,OAAO,MAAM,OAAO,MAAM;CAClD,IAAI,IAAI,QAAQ,UAAU,MAAM;AAGhC,KAAI,MACF,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAQ,CAAC,MAAM;AACf,IAAE,QAAQ,EAAE;;AAKhB,SAAQ,WAAW,OAAO,MAAM,EAAE;AAClC,QAAO,EAAE,SAAS,KAChB,GAAE,KAAK,EAAE;AAEX,QAAO;;;;;;;;;;AAWT,SAAS,WAAW,OAAO,MAAM,KAAK;CACpC,IAAI,GAAG;AACP,KAAI,MAAM,QAAQ,MAAM,EAAE;EACxB,IAAI,OAAO,MAAM;AACjB,OAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAI,IAAI,IACrC,OAAM,KAAK,WAAW,MAAM,IAAI,MAAM,KAAK;OAG7C,MAAK,IAAIC,MAAI,KAAKA,MAAI,MAAM,MAC1B,SAAQ,CAAC,MAAM;AAGnB,QAAO;;;;;;;;AAQT,SAAgB,QAAQ,OAAO;AAC7B,KAAI,CAAC,MAAM,QAAQ,MAAM,CAEvB,QAAO;CAET,IAAI,OAAO,EAAE;AACb,OAAM,QAAQ,SAAS,SAAS,OAAO;AACrC,MAAI,MAAM,QAAQ,MAAM,CACtB,OAAM,QAAQ,SAAS;MAEvB,MAAK,KAAK,MAAM;GAElB;AACF,QAAO;;;;;;;;;;;AAoHT,SAAgB,iBAAiB,OAAO,UAAQ;CAC9C,IAAI;CACJ,IAAI,SAAS;AAEb,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,IAAI,OAAO,MAAM;EACjB,IAAI,WAAW,MAAM,QAAQ,KAAK;AAGlC,MAAI,MAAM,KAAK,SACb,UAAS,KAAK;AAIhB,MAAI,YAAY,KAAK,WAAW,OAC9B;EAEF,IAAI,WAAW,WAAW,iBAAiB,MAAMC,SAAO,GACtDA,SAAO,KAAK;AACd,MAAI,SAAS,OACX,QAAO;WACE,SAAS,SAClB,QAAO;;AAKX,QAAO;;;;;;;;;;;;AA+BT,SAAS,gBAAgB,GAAG,KAAG,WAAW,KAAK;AAC7C,KAAI,MAAM,WAAW;AAEnB,MAAI,EAAE,WAAWC,IAAE,OACjB,OAAM,IAAI,eAAe,EAAE,QAAQA,IAAE,OAAO;EAE9C,IAAI,IAAI,EAAE;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,GAAE,KAAK,gBAAgB,EAAE,IAAIA,IAAE,IAAI,WAAW,MAAM,EAAE;AAExD,SAAO;OAGP,QAAO,EAAE,OAAOA,IAAE;;;;;;;;AAUtB,SAAgBC,WAAS;CACvB,IAAI,SAAS,MAAM,UAAU,MAAM,KAAK,WAAW,GAAG,GAAG;CACzD,IAAI,YAAY,MAAM,UAAU,MAAM,KAAK,WAAW,GAAG;AACzD,KAAI,OAAO,WAAW,EACpB,QAAO,OAAO;AAEhB,KAAI,OAAO,SAAS,EAClB,QAAO,OAAO,MAAM,EAAE,CAAC,OAAO,SAAU,GAAG,GAAG;AAC5C,SAAO,gBAAgB,GAAG,GAAG,WAAW,EAAE;IACzC,OAAO,GAAG;KAEb,OAAM,IAAI,MAAM,+CAA+C;;;;;;;AASnE,SAAgB,iBAAiB;AAC/B,MAAK,IAAI,OAAO,UAAU,QAAQ,QAAQ,IAAI,MAAM,KAAK,EAAE,OAAO,GAAG,OAAO,MAAM,OAChF,OAAM,QAAQ,UAAU;CAE1B,IAAI,aAAa,MAAM,KAAI,MAAK,EAAE,OAAO;CACzC,IAAI,IAAI,KAAK,IAAI,GAAG,WAAW;CAC/B,IAAI,UAAU,IAAI,MAAM,EAAE,CAAC,KAAK,KAAK;AAErC,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,IAAI,OAAO,MAAM;EACjB,IAAI,MAAM,WAAW;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;GAC5B,IAAI,IAAI,IAAI,MAAM;AAClB,OAAI,KAAK,KAAK,QAAQ,GACpB,SAAQ,KAAK,KAAK;;;AAIxB,MAAK,IAAI,KAAK,GAAG,KAAK,MAAM,QAAQ,KAClC,wBAAuB,MAAM,KAAK,QAAQ;AAE5C,QAAO;;;;;;;AAQT,SAAgB,uBAAuB,MAAM,QAAQ;CACnD,IAAI,IAAI,OAAO;CACf,IAAI,MAAM,KAAK;AACf,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAC5B,IAAI,IAAI,IAAI,MAAM;AAClB,MAAI,KAAK,KAAK,OAAO,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,OAAO,GACzD,OAAM,IAAI,MAAM,0DAA0D,OAAO,MAAM,yCAAyC,CAAC,OAAO,KAAK,cAAc,CAAC,OAAO,KAAK,IAAI,YAAY,CAAC,OAAO,OAAO,GAAG,CAAC;;;;;;;;;AAWjN,SAAgB,YAAY,OAAO,QAAQ;CACzC,IAAI,QAAQ,UAAU,MAAM;AAC5B,KAAI,gBAAgB,OAAO,OAAO,CAChC,QAAO;AAET,wBAAuB,OAAO,OAAO;CACrC,IAAI,kBAAkB,eAAe,OAAO,OAAO;CACnD,IAAI,IAAI,gBAAgB;CACxB,IAAI,aAAa,CAAC,GAAG,MAAM,IAAI,MAAM,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,MAAM;CAC/D,IAAI,IAAI,MAAM,MAAM;AAEpB,KAAI,MAAM,SAAS,GAAG;AACpB,MAAI,QAAQ,GAAG,WAAW;AAC1B,UAAQ,UAAU,EAAE;;AAItB,MAAK,IAAI,MAAM,GAAG,MAAM,GAAG,MACzB,KAAI,MAAM,OAAO,gBAAgB,MAAM;AACrC,MAAI,QAAQ,GAAG,gBAAgB,MAAM,IAAI;AACzC,UAAQ,UAAU,EAAE;;AAGxB,QAAO;;;;;;;;;AAoCT,SAAgB,QAAQ,gBAAgB,eAAe,cAAc;AACnE,QAAOA,SAAO,GAAG,MAAM,cAAc,CAAC,KAAK,eAAe,EAAE,aAAa;;;;;;;AAQ3E,SAAgB,MAAM,OAAO;AAC3B,oCAAgB,EAAE,EAAE,MAAM;;;;;;;;;;;ACvrB5B,SAAgB,iBAAiB,IAAI;AACnC,QAAO,OAAO,KAAK,GAAG,cAAc,EAAE,CAAC,CAAC,OAAO,SAAU,MAAM,aAAW;EACxE,IAAI,SAASC,YAAU,MAAM,KAAK,IAAI,EAAE,EAAE,SAAS;AACnD,SAAO,KAAK,IAAI,MAAM,MAAM;IAC3B,GAAG;;;;;ACzFR,IAAIC,UAAO;AACX,IAAIC,kBAAe,CAAC,SAAS;AAC7B,IAAW,yBAAwC,wBAAQD,SAAMC,kBAAc,SAAQ;CACrF,IAAI,EACF,qBACE;;;;;;CAMJ,SAASC,cAAY,MAAM,UAAU;AACnC,MAAI,EAAE,gBAAgBA,eACpB,OAAM,IAAI,YAAY,mDAAmD;AAE3E,MAAI,YAAY,CAAC,SAAS,SAAS,CACjC,OAAM,IAAI,MAAM,uBAAuB,SAAS;AAElD,MAAI,SAAS,KAAK,CAEhB,KAAI,KAAK,SAAS,eAAe;AAE/B,QAAK,QAAQC,QAAM,KAAK,MAAM;AAC9B,QAAK,QAAQA,QAAM,KAAK,MAAM;AAC9B,QAAK,YAAY,YAAY,KAAK;SAC7B;AAEL,QAAK,QAAQ,KAAK,SAAS;AAC3B,QAAK,QAAQ,KAAK,MAAM;AACxB,QAAK,YAAY,YAAY,KAAK;;WAE3B,QAAQ,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,KAAK,EAAE;AAE3D,QAAK,QAAQ,KAAK;AAClB,QAAK,QAAQ,KAAK;AAElB,YAAS,KAAK,OAAO,KAAK,MAAM;AAChC,QAAK,YAAY,YAAY,KAAK;aACzB,QAAQ,KAAK,EAAE;AAExB,QAAK,QAAQ,WAAW,KAAK;AAE7B,QAAK,QAAQ,UAAU,KAAK,MAAM;AAElC,YAAS,KAAK,OAAO,KAAK,MAAM;AAEhC,QAAK,YAAY;aACR,KAET,OAAM,IAAI,UAAU,+BAA+B,OAAO,KAAK,GAAG,IAAI;OACjE;AAEL,QAAK,QAAQ,EAAE;AACf,QAAK,QAAQ,CAAC,EAAE;AAChB,QAAK,YAAY;;;AAGrB,eAAY,YAAY,IAAIC,UAAQ;;;;AAKpC,eAAY,UAAU,oBAAoB,SAAU,MAAM,UAAU;AAClE,SAAO,IAAIF,cAAY,MAAM,SAAS;;;;;AAMxC,QAAO,eAAeA,eAAa,QAAQ,EACzC,OAAO,eACR,CAAC;AACF,eAAY,UAAU,cAAcA;AACpC,eAAY,UAAU,OAAO;AAC7B,eAAY,UAAU,gBAAgB;;;;;;;;;;AAWtC,eAAY,UAAU,cAAc,WAAY;AAC9C,SAAO,iBAAiB,KAAK,OAAO,OAAO;;;;;;;;;;;AAY7C,eAAY,UAAU,UAAU,WAAY;AAC1C,SAAO;;;;;;;;;;;AAYT,eAAY,UAAU,WAAW,WAAY;AAC3C,SAAO,KAAK;;;;;;;;AASd,eAAY,UAAU,SAAS,SAAU,MAAM,UAAU;AACvD,SAAO,IAAIA,cAAY,MAAM,SAAS;;;;;;;;;;;;;;;;AAiBxC,eAAY,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AACzE,UAAQ,UAAU,QAAlB;GACE,KAAK,EACH,QAAO,KAAK,MAAM,MAAM;GAG1B,KAAK;GACL,KAAK,EACH,QAAO,KAAK,MAAM,OAAO,aAAa,aAAa;GACrD,QACE,OAAM,IAAI,YAAY,4BAA4B;;;;;;;;;AAUxD,eAAY,UAAU,MAAM,SAAU,OAAO;AAC3C,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,MAAI,MAAM,WAAW,KAAK,MAAM,OAC9B,OAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,OAAO;AAI3D,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,eAAc,MAAM,IAAI,KAAK,MAAM,GAAG;EAExC,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAI,IAAI,KAAK;GAC9C,IAAI,SAAS,MAAM;AACnB,iBAAc,QAAQ,KAAK,OAAO;AAClC,UAAO,KAAK;;AAEd,SAAO;;;;;;;;;;;;AAaT,eAAY,UAAU,MAAM,SAAU,OAAO,OAAO,cAAc;AAChE,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,MAAI,MAAM,SAAS,KAAK,MAAM,OAC5B,OAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,QAAQ,IAAI;EAEhE,IAAI,GAAG,IAAI;EAGX,IAAI,OAAO,MAAM,IAAI,SAAU,KAAG;AAChC,UAAOG,MAAI;IACX;AACF,OAAK,MAAM,MAAM,aAAa;EAG9B,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,GAAG,KAAK,MAAM,SAAS,GAAG,IAAI,IAAI,KAAK;AAC9C,YAAS,MAAM;AACf,iBAAc,QAAQ,KAAK,OAAO;AAClC,UAAO,KAAK;;AAId,WAAS,MAAM,MAAM,SAAS;AAC9B,gBAAc,QAAQ,KAAK,OAAO;AAClC,OAAK,UAAU;AACf,SAAO;;;;;;;;;CAUT,SAAS,KAAK,UAAQ,OAAO;AAC3B,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,gBAAgB;AAGtC,MADe,MAAM,UAAU,CAG7B,QAAOC,SAAO,IAAI,MAAM,KAAK,CAAC;OACzB;GAEL,IAAI,OAAO,MAAM,MAAM;AACvB,OAAI,KAAK,WAAWA,SAAO,MAAM,OAC/B,OAAM,IAAI,eAAe,KAAK,QAAQA,SAAO,MAAM,OAAO;GAI5D,IAAIC,QAAM,MAAM,KAAK;GACrB,IAAIC,QAAM,MAAM,KAAK;AACrB,QAAK,IAAI,IAAI,GAAG,KAAKF,SAAO,MAAM,QAAQ,IAAI,IAAI,KAAK;AACrD,kBAAcC,MAAI,IAAID,SAAO,MAAM,GAAG;AACtC,kBAAcE,MAAI,IAAIF,SAAO,MAAM,GAAG;;AAKxC,UAAO,IAAIJ,cAAY,cAAcI,SAAO,OAAO,OAAO,KAAK,QAAQ,EAAE,EAAEA,SAAO,UAAU;;;;;;;;;;;;;;CAehG,SAAS,cAAc,MAAM,OAAO,MAAM,KAAK;EAC7C,IAAI,OAAO,QAAQ,OAAO;EAC1B,IAAIG,UAAQ,MAAM,UAAU,IAAI;AAChC,MAAI,KACF,QAAOA,QAAM,IAAI,SAAU,GAAG;AAC5B,iBAAc,GAAG,KAAK,OAAO;AAC7B,UAAO,KAAK;IACZ,CAAC,SAAS;MAEZ,QAAOA,QAAM,IAAI,SAAU,GAAG;AAC5B,iBAAc,GAAG,KAAK,OAAO;GAC7B,IAAI,QAAQ,KAAK;AACjB,UAAO,cAAc,OAAO,OAAO,MAAM,MAAM,EAAE;IACjD,CAAC,SAAS;;;;;;;;;;;;;;CAgBhB,SAAS,KAAK,UAAQ,OAAO,WAAW,cAAc;AACpD,MAAI,CAAC,SAAS,MAAM,YAAY,KAC9B,OAAM,IAAI,UAAU,gBAAgB;EAItC,IAAI,QAAQ,MAAM,MAAM;EACxB,IAAI,WAAW,MAAM,UAAU;EAG/B,IAAI;AACJ,MAAI,SAAS,UAAU,EAAE;AACvB,WAAQ,UAAU,MAAM;AACxB,eAAY,UAAU,SAAS;QAE/B,SAAQ,UAAU,UAAU;AAE9B,MAAI,UAAU;AAIZ,OAAI,MAAM,WAAW,EACnB,OAAM,IAAI,UAAU,kBAAkB;AAExC,YAAO,IAAI,MAAM,KAAK,EAAE,WAAW,aAAa;SAC3C;AAIL,OAAI,CAAC,gBAAgB,OAAO,MAAM,CAChC,KAAI;AACF,QAAI,MAAM,WAAW,EACnB,aAAY,YAAY,CAAC,UAAU,EAAE,MAAM;QAE3C,aAAY,YAAY,WAAW,MAAM;AAE3C,YAAQ,UAAU,UAAU;YACrB,SAAS;AAIpB,OAAI,MAAM,SAASH,SAAO,MAAM,OAC9B,OAAM,IAAI,eAAe,MAAM,QAAQA,SAAO,MAAM,QAAQ,IAAI;AAElE,OAAI,MAAM,SAAS,MAAM,QAAQ;IAE/B,IAAI,IAAI;IACR,IAAI,QAAQ;AACZ,WAAO,MAAM,OAAO,KAAK,MAAM,OAAO,EACpC;AAEF,WAAO,MAAM,OAAO,GAAG;AACrB;AACA;;AAIF,gBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,MAAM;;AAI9D,OAAI,CAAC,gBAAgB,OAAO,MAAM,CAChC,OAAM,IAAI,eAAe,OAAO,OAAO,IAAI;AAO7C,QAAKA,UAHM,MAAM,KAAK,CAAC,IAAI,SAAU,KAAG;AACtC,WAAOD,MAAI;KACX,EACiB,aAAa;GAGhC,IAAI,OAAO,MAAM;AAEjB,iBAAcC,SAAO,OAAO,OAAO,WAAW,MADpC,EAC8C;;AAE1D,SAAOA;;;;;;;;;;;;CAaT,SAAS,cAAc,MAAM,OAAO,WAAW,MAAM,KAAK;EACxD,IAAI,OAAO,QAAQ,OAAO;EAC1B,IAAIG,UAAQ,MAAM,UAAU,IAAI;AAChC,MAAI,KACF,SAAM,QAAQ,SAAU,WAAW,UAAU;AAC3C,iBAAc,UAAU;AACxB,QAAK,aAAa,UAAU,SAAS;IACrC;MAEF,SAAM,QAAQ,SAAU,WAAW,UAAU;AAC3C,iBAAc,UAAU;AACxB,iBAAc,KAAK,YAAY,OAAO,UAAU,SAAS,KAAK,MAAM,MAAM,EAAE;IAC5E;;;;;;;;;;;;;;;AAiBN,eAAY,UAAU,SAAS,SAAU,MAAM,cAAc,MAAM;AAEjE,MAAI,CAAC,aAAa,KAAK,CACrB,OAAM,IAAI,UAAU,2BAA2B;EAIjD,IAAI,YAAY,KAAK,SAAS,CAAC,KAAI,UAAS;AAC1C,UAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,WAAW,IAAI,MAAM,KAAK;IAC/D;AAKF,SAAOC,UAFC,OAAO,KAAK,OAAO,GAAG,MAEZ,WAAW,aAAa;;CAE5C,SAASA,UAAQ,UAAQ,MAAM,cAAc;AAE3C,MAAI,KAAK,WAAW,GAAG;GAErB,IAAI,IAAIJ,SAAO;AAEf,UAAO,QAAQ,EAAE,CACf,KAAI,EAAE;AAER,UAAO;;AAGT,WAAO,QAAQ,KAAK,MAAM,EAAE;AAC5B,WAAO,QAAQ,OAAOA,SAAO,OAAOA,SAAO,OAAO,aAAa;AAE/D,SAAOA;;;;;;;;;;;;;;;;AAiBT,eAAY,UAAU,UAAU,SAAU,MAAM,MAAM;EACpD,IAAI,IAAI,OAAO,KAAK,OAAO,GAAG;AAC9B,IAAE,QAAQ,QAAQ,EAAE,OAAO,KAAK;AAEhC,IAAE,QAAQ,qBAAqB,MADX,EAAE,MAAM,QAAQ,QAAQ,WAAS,SAASK,OAAK,CAChB;AACnD,SAAO;;;;;;;;;;;CAYT,SAAS,KAAK,UAAQ,MAAM,cAAc;EACxC,IAEA,UAAUL,SAAO,MAAM,MAAM,EAAE;EAC/B,IAAI,UAAU;AAGd,SAAO,QAAQ,SAAS,KAAK,QAAQ;AACnC,WAAQ,KAAK,EAAE;AACf,aAAU;;AAIZ,OAAK,IAAI,IAAI,GAAG,KAAK,KAAK,QAAQ,IAAI,IAAI,IACxC,KAAI,KAAK,KAAK,QAAQ,IAAI;AACxB,WAAQ,KAAK,KAAK;AAClB,aAAU;;AAGd,MAAI,QAEF,WAAQA,UAAQ,SAAS,aAAa;;;;;;;AAS1C,eAAY,UAAU,QAAQ,WAAY;AAMxC,SALQ,IAAIJ,cAAY;GACtB,MAAMC,QAAM,KAAK,MAAM;GACvB,MAAMA,QAAM,KAAK,MAAM;GACvB,UAAU,KAAK;GAChB,CAAC;;;;;;;AASJ,eAAY,UAAU,OAAO,WAAY;AACvC,SAAO,KAAK,MAAM,MAAM,EAAE;;;;;;;;;;;;AAa5B,eAAY,UAAU,MAAM,SAAU,UAAU;EAE9C,IAAI,KAAK;EACT,IAAI,OAAO,iBAAiB,SAAS;EAqBrC,IAAI,OApBU,SAAS,QAAQ,OAAO,OAAO;AAC3C,OAAI,QAAQ,MAAM,CAChB,QAAO,MAAM,IAAI,SAAU,OAAO,GAAG;AACnC,WAAO,QAAQ,OAAO,MAAM,OAAO,EAAE,CAAC;KACtC;YAGE,SAAS,EACX,QAAO,SAAS,MAAM;YACb,SAAS,EAClB,QAAO,SAAS,OAAO,MAAM;OAG7B,QAAO,SAAS,OAAO,OAAO,GAAG;IAOpB,KAAK,OAAO,EAAE,CAAC;AAElC,SAAO,IAAID,cAAY,MADR,KAAK,cAAc,SAAY,iBAAiB,MAAM,OAAO,GAAG,OACzC;;;;;;;;;AAUxC,eAAY,UAAU,UAAU,SAAU,UAAU;EAElD,IAAI,KAAK;AAUT,GATc,SAAS,QAAQ,OAAO,OAAO;AAC3C,OAAI,QAAQ,MAAM,CAChB,OAAM,QAAQ,SAAU,OAAO,GAAG;AAChC,YAAQ,OAAO,MAAM,OAAO,EAAE,CAAC;KAC/B;OAEF,UAAS,OAAO,OAAO,GAAG;KAGtB,KAAK,OAAO,EAAE,CAAC;;;;;;AAOzB,eAAY,UAAU,OAAO,YAAY,aAAa;AAapD,SAZc,UAAU,QAAQ,OAAO,OAAO;AAC5C,OAAI,QAAQ,MAAM,CAChB,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,QAAO,QAAQ,MAAM,IAAI,MAAM,OAAO,EAAE,CAAC;OAG3C,OAAM;IACJ;IACA;IACD;IAGU,KAAK,OAAO,EAAE,CAAC;;;;;;AAOhC,eAAY,UAAU,OAAO,WAAY;EACvC,IAAI,SAAS,EAAE;AAEf,MADQ,KAAK,MAAM,CACb,WAAW,EACf,OAAM,IAAI,UAAU,6CAA6C;AAGnE,OAAK,IAAI,OADE,KAAK,MAEd,QAAO,KAAK,IAAIA,cAAY,CAAC,IAAI,EAAE,KAAK,UAAU,CAAC;AAErD,SAAO;;;;;;AAOT,eAAY,UAAU,UAAU,WAAY;EAC1C,IAAI,QAAQ;EACZ,IAAI,SAAS,EAAE;EACf,IAAI,IAAI,KAAK,MAAM;AACnB,MAAI,EAAE,WAAW,EACf,OAAM,IAAI,UAAU,6CAA6C;EAEnE,IAAI,OAAO,KAAK;EAChB,IAAI,QAAQ,SAASU,QAAM,KAAG;GAC5B,IAAI,MAAM,KAAK,KAAI,QAAO,CAAC,IAAIP,KAAG,CAAC;AACnC,UAAO,KAAK,IAAIH,cAAY,KAAK,MAAM,UAAU,CAAC;;AAEpD,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,IAAI,IACxB,OAAM,EAAE;AAEV,SAAO;;;;;;;AAQT,eAAY,UAAU,UAAU,WAAY;AAC1C,SAAOC,QAAM,KAAK,MAAM;;;;;;;AAQ1B,eAAY,UAAU,UAAU,WAAY;AAC1C,SAAO,KAAK;;;;;;;;;;;AAYd,eAAY,UAAU,SAAS,SAAU,SAAS;AAChD,SAAOU,SAAO,KAAK,OAAO,QAAQ;;;;;;;AAQpC,eAAY,UAAU,WAAW,WAAY;AAC3C,SAAOA,SAAO,KAAK,MAAM;;;;;;;AAQ3B,eAAY,UAAU,SAAS,WAAY;AACzC,SAAO;GACL,QAAQ;GACR,MAAM,KAAK;GACX,MAAM,KAAK;GACX,UAAU,KAAK;GAChB;;;;;;;;;;AAWH,eAAY,UAAU,WAAW,SAAU,GAAG;AAE5C,MAAI,GAAG;AAEL,OAAI,YAAY,EAAE,CAChB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACC,YAAU,EAAE,CAC/B,OAAM,IAAI,UAAU,4CAA4C;QAIlE,KAAI;EAEN,IAAI,SAAS,IAAI,IAAI,IAAI;EACzB,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI;EAGxB,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;EAGzB,IAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,OAAO;EAG/C,IAAI,OAAO,EAAE;AAGb,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACrB,MAAK,KAAK,KAAK,MAAM,IAAI,MAAM,IAAI;AAIrC,SAAO,IAAIZ,cAAY;GACrB;GACA,MAAM,CAAC,EAAE;GACT,UAAU,KAAK;GAChB,CAAC;;;;;;;;;;;;;;AAeJ,eAAY,WAAW,SAAU,MAAM,OAAO,GAAG,cAAc;AAC7D,MAAI,CAAC,QAAQ,KAAK,CAChB,OAAM,IAAI,UAAU,iCAAiC;AAEvD,MAAI,KAAK,WAAW,EAClB,OAAM,IAAI,MAAM,2CAA2C;AAI7D,SAAO,KAAK,IAAI,SAAU,GAAG;AAE3B,OAAI,YAAY,EAAE,CAEhB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACY,YAAU,EAAE,IAAI,IAAI,EACvC,OAAM,IAAI,MAAM,wCAAwC;AAE1D,UAAO;IACP;AAGF,MAAI,GAAG;AAEL,OAAI,YAAY,EAAE,CAChB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACA,YAAU,EAAE,CAC/B,OAAM,IAAI,UAAU,4CAA4C;QAIlE,KAAI;EAEN,IAAI,SAAS,IAAI,IAAI,IAAI;EACzB,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI;EAGxB,IAAI,OAAO,KAAK;EAChB,IAAI,UAAU,KAAK;EAGnB,IAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,OAAO;EAG/C,IAAI;AAGJ,MAAI,QAAQ,MAAM,EAAE;AAElB,OAAI,MAAM,WAAW,EAEnB,OAAM,IAAI,MAAM,6BAA6B;AAG/C,YAAS,SAASC,SAAO,GAAG;AAE1B,WAAO,MAAM;;aAEN,SAAS,MAAM,EAAE;GAE1B,IAAI,KAAK,MAAM,MAAM;AAErB,OAAI,GAAG,WAAW,KAAK,GAAG,OAAO,EAE/B,OAAM,IAAI,MAAM,wBAAwB;AAG1C,YAAS,SAASA,SAAO,GAAG;AAE1B,WAAO,MAAM,IAAI,CAAC,EAAE,CAAC;;QAIvB,UAAS,SAASA,WAAS;AAEzB,UAAO;;AAKX,MAAI,CAAC,aAEH,gBAAe,YAAY,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,EAAE,GACtD;EAIJ,IAAI,OAAO,EAAE;AAGb,MAAI,KAAK,SAAS,GAAG;AAEnB,UAAO,OAAO,MAAM,MAAM,aAAa;AAEvC,QAAK,IAAIC,MAAI,GAAGA,MAAI,GAAG,MACrB,MAAKA,MAAI,MAAMA,MAAI,UAAU,OAAOA,IAAE;;AAK1C,SAAO,IAAId,cAAY;GACrB;GACA,MAAM,CAAC,MAAM,QAAQ;GACtB,CAAC;;;;;;;;;;AAWJ,eAAY,WAAW,SAAU,MAAM;AACrC,SAAO,IAAIA,cAAY,KAAK;;;;;;;;;;;AAY9B,eAAY,UAAU,WAAW,SAAU,GAAG,GAAG;AAE/C,MAAI,CAAC,SAAS,EAAE,IAAI,CAACY,YAAU,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAACA,YAAU,EAAE,CAChE,OAAM,IAAI,MAAM,sCAAsC;AAGxD,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI,MAAM,2CAA2C;AAG7D,gBAAc,GAAG,KAAK,MAAM,GAAG;AAC/B,gBAAc,GAAG,KAAK,MAAM,GAAG;AAG/B,gBAAY,UAAU,GAAG,GAAG,KAAK,MAAM;AAEvC,SAAO;;;;;;;;;AAUT,eAAY,YAAY,SAAU,GAAG,GAAG,MAAM;EAE5C,IAAI,KAAK,KAAK;AACd,OAAK,KAAK,KAAK;AACf,OAAK,KAAK;;;;;;;;;CAUZ,SAAS,WAAW,MAAM;AACxB,MAAI,SAAS,KAAK,CAChB,QAAO,WAAW,KAAK,SAAS,CAAC;AAEnC,MAAI,QAAQ,KAAK,CACf,QAAO,KAAK,IAAI,WAAW;AAE7B,SAAO;;AAET,QAAOZ;GACN,EACD,SAAS,MACV,CAAC;;;;;;;;;;ACl7BF,SAAgB,QAAQ,KAAK;CAC3B,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,IAAI,GAAG;CACf,IAAI,GAAG;CACP,IAAI,MAAM,EAAE;AACZ,MAAK,IAAI,GAAG,IAAI,GAAG,KAAK;EACtB,IAAI,MAAM,EAAE;AACZ,OAAK,IAAI,GAAG,IAAI,GAAG,IACjB,KAAI,KAAK,IAAI,GAAG,GAAG;AAErB,MAAI,KAAK,IAAI;;AAEf,QAAO;;;;;;;;;;;ACPT,SAAgB,oBAAoB,OAAO;AACzC,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,KAAI,aAAa,MAAM,GAAG,CACxB,QAAO;AAGX,QAAO;;;;;;;;;AAUT,SAAgB,YAAY,OAAO,UAAU;AAC3C,KAAI,SAAS,MAAM,CACjB,SAAQ,MAAM,SAAS;AAEzB,MAAK,IAAI,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAI,IAAI,KAAK;EAC9C,IAAI,QAAQ,MAAM;AAClB,MAAI,MAAM,QAAQ,MAAM,CACtB,aAAY,OAAO,SAAS;MAE5B,UAAS,MAAM;;;;;;;;;;;;;;;AAiBrB,SAAgB,QAAQ,OAAO,UAAU,WAAW;AAClD,KAAI,SAAS,OAAO,MAAM,QAAQ,WAEhC,QAAO,MAAM,IAAI,SAAU,GAAG;AAC5B,SAAO,QAAQ,GAAG,UAAU,UAAU;GACtC;KAEF,QAAO,SAAS,MAAM;;;;;;;;;;;AAa1B,SAAgB,OAAO,KAAK,KAAK,UAAU;CACzC,IAAI,OAAO,MAAM,QAAQ,IAAI,GAAG,UAAU,IAAI,GAAG,IAAI,MAAM;AAC3D,KAAI,MAAM,KAAK,OAAO,KAAK,OAEzB,OAAM,IAAI,WAAW,KAAK,KAAK,OAAO;AAExC,KAAI,SAAS,IAAI,CACf,QAAO,IAAI,OAAO,QAAQ,IAAI,SAAS,EAAE,KAAK,SAAS,CAAC;KAExD,QAAO,QAAQ,KAAK,KAAK,SAAS;;;;;;;;;;AAYtC,SAAS,QAAQ,KAAK,KAAK,UAAU;CACnC,IAAI,GAAG,KAAK,KAAK;AACjB,KAAI,OAAO,EACT,KAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,EAAE;AAC1B,QAAM,IAAI;AACV,OAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC1B,OAAM,SAAS,KAAK,IAAI,GAAG;AAE7B,SAAO;QACF;AACL,SAAO,QAAQ,IAAI;AACnB,QAAM,EAAE;AACR,OAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC3B,KAAI,KAAK,QAAQ,KAAK,IAAI,MAAM,GAAG,SAAS;AAE9C,SAAO;;MAEJ;AACL,QAAM,EAAE;AACR,OAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC1B,KAAI,KAAK,QAAQ,IAAI,IAAI,MAAM,GAAG,SAAS;AAE7C,SAAO;;;;;;ACjHX,IAAIe,UAAO;AACX,IAAIC,kBAAe,CAAC,QAAQ;AAC5B,IAAW,kBAAiC,wBAAQD,SAAMC,kBAAc,SAAQ;CAC9E,IAAI,EACF,mBACE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BJ,QAAOC,QAAMF,SAAM;EACjB,QAAQG;EAGR,WAAW,SAASC,YAAU,GAAG;AAC/B,UAAO,EAAE,OAAO;;EAElB,UAAU,SAASC,WAAS,GAAG;AAC7B,UAAO,EAAE,MAAM,KAAK,SAAS,EAAE,EAAE;;EAEnC,kBAAkBH,QAAM,aAAY,YAAQ,MAAK,QAAQ,GAAGI,OAAK,CAAC;EACnE,CAAC;EACF;;;;ACjDF,IAAI,KAAK;AACT,IAAI,KAAK;AACT,SAAgB,UAAU,GAAG;AAC3B,QAAO,KAAK,IAAI,EAAE;;AAEpB,UAAU,YAAY;AACtB,SAAgB,UAAU,GAAG,KAAG;AAC9B,QAAO,IAAIC;;AAEb,UAAU,YAAY;AACtB,SAAgB,eAAe,GAAG,KAAG;AACnC,QAAO,IAAIA;;AAEb,eAAe,YAAY;AAC3B,SAAgB,eAAe,GAAG,KAAG;AACnC,QAAO,IAAIA;;AAEb,eAAe,YAAY;AAC3B,SAAgB,aAAa,GAAG,KAAG;AACjC,QAAO,IAAIA;;AAEb,aAAa,YAAY;AACzB,SAAgB,iBAAiB,GAAG;AAClC,QAAO,CAAC;;AAEV,iBAAiB,YAAY;AAC7B,SAAgB,gBAAgB,GAAG;AACjC,QAAO;;AAET,gBAAgB,YAAY;AAC5B,SAAgB,WAAW,GAAG;AAC5B,QAAOC,OAAK,EAAE;;AAEhB,WAAW,YAAY;AACvB,SAAgB,WAAW,GAAG;AAC5B,QAAO,IAAI,IAAI;;AAEjB,WAAW,YAAY;AACvB,SAAgB,UAAU,GAAG;AAC3B,QAAO,KAAK,IAAI,EAAE;;AAEpB,UAAU,YAAY;AACtB,SAAgB,YAAY,GAAG;AAC7B,QAAO,MAAM,EAAE;;AAEjB,YAAY,YAAY;;;;;;;AAQxB,SAAgB,UAAU,GAAG,KAAG;AAC9B,KAAI,CAACC,YAAU,EAAE,IAAI,CAACA,YAAUF,IAAE,CAChC,OAAM,IAAI,MAAM,qDAAqD;CAIvE,IAAI;AACJ,QAAOA,QAAM,GAAG;AACd,MAAI,IAAIA;AACR,MAAIA;AACJ,QAAI;;AAEN,QAAO,IAAI,IAAI,CAAC,IAAI;;AAEtB,UAAU,YAAY;;;;;;;AAQtB,SAAgB,UAAU,GAAG,KAAG;AAC9B,KAAI,CAACE,YAAU,EAAE,IAAI,CAACA,YAAUF,IAAE,CAChC,OAAM,IAAI,MAAM,qDAAqD;AAEvE,KAAI,MAAM,KAAKA,QAAM,EACnB,QAAO;CAKT,IAAI;CACJ,IAAI,OAAO,IAAIA;AACf,QAAOA,QAAM,GAAG;AACd,MAAIA;AACJ,QAAI,IAAI;AACR,MAAI;;AAEN,QAAO,KAAK,IAAI,OAAO,EAAE;;AAE3B,UAAU,YAAY;;;;;;AAoBtB,SAAgB,YAAY,GAAG;AAC7B,QAAOG,QAAM,EAAE;;AAEjB,YAAY,YAAY;;;;;;AAOxB,SAAgB,WAAW,GAAG;AAC5B,QAAOC,OAAK,EAAE;;AAEhB,WAAW,YAAY;;;;;;AAOvB,SAAgB,YAAY,GAAG;AAC7B,QAAO,MAAM,EAAE;;AAEjB,YAAY,YAAY;;;;;;;;AASxB,SAAgB,UAAU,GAAG,GAAG;AAI9B,QAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM,IAAI,EAAE;;AAEhD,UAAU,YAAY;AAwDtB,SAAgB,WAAW,GAAG;AAC5B,QAAOC,OAAK,EAAE;;AAEhB,WAAW,YAAY;AACvB,SAAgB,WAAW,GAAG;AAC5B,QAAO,KAAK,KAAK,EAAE;;AAErB,WAAW,YAAY;AACvB,SAAgB,aAAa,GAAG;AAC9B,QAAO,IAAI;;AAEb,aAAa,YAAY;;;;;;;;AASzB,SAAgB,WAAW,GAAG,KAAG;CAE/B,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,IAAI;CACR,IAAI,QAAQ;CACZ,IAAI,IAAI;CACR,IAAI,QAAQ;AACZ,KAAI,CAACH,YAAU,EAAE,IAAI,CAACA,YAAUF,IAAE,CAChC,OAAM,IAAI,MAAM,sDAAsD;AAExE,QAAOA,KAAG;AACR,MAAI,KAAK,MAAM,IAAIA,IAAE;AACrB,MAAI,IAAI,IAAIA;AACZ,MAAI;AACJ,MAAI,QAAQ,IAAI;AAChB,UAAQ;AACR,MAAI;AACJ,MAAI,QAAQ,IAAI;AAChB,UAAQ;AACR,MAAIA;AACJ,QAAI;;CAEN,IAAI;AACJ,KAAI,IAAI,EACN,OAAM;EAAC,CAAC;EAAG,CAAC;EAAO,CAAC;EAAM;KAE1B,OAAM;EAAC;EAAG,IAAI,QAAQ;EAAG;EAAM;AAEjC,QAAO;;AAET,WAAW,YAAY;;;;;;;AAQvB,SAAgB,UAAU,GAAG,GAAG;AAG9B,KAAI,IAAI,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,KAAK,MAAM,UACpD,QAAO;AAET,QAAO,KAAK,IAAI,GAAG,EAAE;;AAEvB,UAAU,YAAY;;;;;;AAsBtB,SAAgB,WAAW,GAAG;AAC5B,QAAO,KAAK,IAAI,EAAE;;AAEpB,WAAW,YAAY;;;;;;;;;;;;;ACrSvB,SAAgB,YAAY,GAAG,GAAG,SAAS;AAEzC,KAAI,YAAY,QAAQ,YAAY,OAClC,QAAO,EAAE,GAAG,EAAE;AAIhB,KAAI,EAAE,GAAG,EAAE,CACT,QAAO;AAIT,KAAI,EAAE,OAAO,IAAI,EAAE,OAAO,CACxB,QAAO;AAIT,KAAI,EAAE,UAAU,IAAI,EAAE,UAAU,EAAE;EAEhC,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK;AAC3B,MAAI,KAAK,QAAQ,CACf,QAAO;OACF;GAEL,IAAIM,QAAM,EAAE,YAAY,IAAI,EAAE,KAAK,EAAE,EAAE,KAAK,CAAC;AAC7C,UAAO,KAAK,IAAIA,MAAI,MAAM,QAAQ,CAAC;;;AAKvC,QAAO;;;;;;;;;;;;;AC7BT,SAAgB,cAAc,GAAG,GAAG,SAAS;AAC3C,QAAOC,cAAY,EAAE,IAAI,EAAE,IAAI,QAAQ,IAAIA,cAAY,EAAE,IAAI,EAAE,IAAI,QAAQ;;;;;ACV7E,IAAW,qBAAoC,wBAAQ,gBAAgB,CAAC,QAAQ,GAAE,SAAQ;CACxF,IAAI,EACF,mBACE;AACJ,QAAO,EACL,cAAcC,QAAM,aAAY,YAAS,GAAG,MAAM;AAChD,MAAI,CAAC,EAAE,UAAU,EAAE,CACjB,OAAM,IAAI,MAAM,2CAA2C;AAE7D,SAAOA,QAAM,KAAKC,QAAM,CAAC,EAAE,WAAW,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM;GACzE,EACH;EACD;;;;ACRF,IAAIC,UAAO;AACX,IAAIC,kBAAe,CAAC,SAAS,SAAS;AACtC,IAAW,oBAAmC,wBAAQD,SAAMC,kBAAc,SAAQ;CAChF,IAAI,EACF,gBACA,qBACE;CACJ,IAAI,eAAe,mBAAmB,EACpC,gBACD,CAAC;;;;;;;;;AAUF,QAAOC,QAAMF,SAAM;EACjB,oBAAoB,SAAS,eAAe,GAAG,GAAG;AAChD,UAAO,MAAM;;EAEf,kBAAkB,SAAS,aAAa,GAAG,GAAG;AAC5C,UAAOG,cAAY,GAAG,GAAGC,SAAO,QAAQ;;EAE1C,wBAAwB,SAAS,mBAAmB,GAAG,GAAG;AACxD,UAAO,EAAE,GAAG,EAAE,IAAIC,YAAe,GAAG,GAAGD,SAAO,QAAQ;;EAExD,sBAAsB,SAAS,iBAAiB,GAAG,GAAG;AACpD,UAAO,EAAE,OAAO,EAAE;;EAEpB,oBAAoB,SAAS,eAAe,GAAG,GAAG;AAChD,UAAO,cAAc,GAAG,GAAGA,SAAO,QAAQ;;EAE7C,EAAE,aAAa;EAChB;AACF,IAAW,0BAA0B,QAAQJ,SAAM,CAAC,SAAS,SAAS,GAAE,UAAS;CAC/E,IAAI,EACF,gBACA,qBACE;AACJ,QAAOE,QAAMF,SAAM,EACjB,kBAAkB,SAAS,aAAa,GAAG,GAAG;AAC5C,SAAOG,cAAY,GAAG,GAAGC,SAAO,QAAQ;IAE3C,CAAC;EACF;;;;AC5CF,IAAIE,UAAO;AACX,IAAIC,kBAAe;CAAC;CAAS;CAAe;CAAS;AACrD,IAAW,0BAAyC,wBAAQD,SAAMC,kBAAc,SAAQ;CACtF,IAAI,EACF,gBACA,4BACA,qBACE;;;;;;;CAOJ,SAASC,eAAa,MAAM,UAAU;AACpC,MAAI,EAAE,gBAAgBA,gBACpB,OAAM,IAAI,YAAY,mDAAmD;AAE3E,MAAI,YAAY,CAAC,SAAS,SAAS,CACjC,OAAM,IAAI,MAAM,uBAAuB,SAAS;AAElD,MAAI,SAAS,KAAK,CAEhB,mBAAkB,MAAM,MAAM,SAAS;WAC9B,QAAQ,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,KAAK,EAAE;AAEjF,QAAK,UAAU,KAAK;AACpB,QAAK,SAAS,KAAK;AACnB,QAAK,OAAO,KAAK;AACjB,QAAK,QAAQ,KAAK;AAClB,QAAK,YAAY,YAAY,KAAK;aACzB,QAAQ,KAAK,CAEtB,kBAAiB,MAAM,MAAM,SAAS;WAC7B,KAET,OAAM,IAAI,UAAU,+BAA+B,OAAO,KAAK,GAAG,IAAI;OACjE;AAEL,QAAK,UAAU,EAAE;AACjB,QAAK,SAAS,EAAE;AAChB,QAAK,OAAO,CAAC,EAAE;AACf,QAAK,QAAQ,CAAC,GAAG,EAAE;AACnB,QAAK,YAAY;;;CAGrB,SAAS,kBAAkB,UAAQ,QAAQ,UAAU;AAEnD,MAAI,OAAO,SAAS,gBAAgB;AAElC,YAAO,UAAU,OAAO,UAAUC,QAAM,OAAO,QAAQ,GAAG;AAC1D,YAAO,SAASA,QAAM,OAAO,OAAO;AACpC,YAAO,OAAOA,QAAM,OAAO,KAAK;AAChC,YAAO,QAAQA,QAAM,OAAO,MAAM;AAClC,YAAO,YAAY,YAAY,OAAO;QAGtC,kBAAiBC,UAAQ,OAAO,SAAS,EAAE,YAAY,OAAO,UAAU;;CAG5E,SAAS,iBAAiB,UAAQ,MAAM,UAAU;AAEhD,WAAO,UAAU,EAAE;AACnB,WAAO,SAAS,EAAE;AAClB,WAAO,OAAO,EAAE;AAChB,WAAO,YAAY;EAEnB,IAAI,OAAO,KAAK;EAChB,IAAI,UAAU;EAGd,IAAI,KAAKC;EAET,IAAI,OAAO;AACX,MAAI,SAAS,SAAS,EAAE;AAEtB,QAAKC,QAAM,KAAKD,eAAa,CAAC,UAAU,SAAS,CAAC,IAAIA;AAEtD,UAAOC,QAAM,QAAQ,GAAG,SAAS;;AAInC,MAAI,OAAO,GAAG;GAEZ,IAAI,IAAI;AACR,MAAG;AAED,aAAO,KAAK,KAAKF,SAAO,OAAO,OAAO;AAEtC,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;KAE7B,IAAI,MAAM,KAAK;AAEf,SAAI,QAAQ,IAAI,EAAE;AAEhB,UAAI,MAAM,KAAK,UAAU,IAAI,OAC3B,WAAU,IAAI;AAGhB,UAAI,IAAI,IAAI,QAAQ;OAElB,IAAI,IAAI,IAAI;AAEZ,WAAI,CAAC,GAAG,GAAG,KAAK,EAAE;AAEhB,iBAAO,QAAQ,KAAK,EAAE;AAEtB,iBAAO,OAAO,KAAK,EAAE;;;YAGpB;AAEL,UAAI,MAAM,KAAK,UAAU,EACvB,WAAU;AAGZ,UAAI,CAAC,GAAG,KAAK,KAAK,EAAE;AAElB,gBAAO,QAAQ,KAAK,IAAI;AAExB,gBAAO,OAAO,KAAK,EAAE;;;;AAK3B;YACO,IAAI;;AAGf,WAAO,KAAK,KAAKA,SAAO,OAAO,OAAO;AAEtC,WAAO,QAAQ,CAAC,MAAM,QAAQ;;AAEhC,gBAAa,YAAY,IAAIG,UAAQ;;;;AAKrC,gBAAa,UAAU,qBAAqB,SAAU,MAAM,UAAU;AACpE,SAAO,IAAIL,eAAa,MAAM,SAAS;;;;;AAMzC,QAAO,eAAeA,gBAAc,QAAQ,EAC1C,OAAO,gBACR,CAAC;AACF,gBAAa,UAAU,cAAcA;AACrC,gBAAa,UAAU,OAAO;AAC9B,gBAAa,UAAU,iBAAiB;;;;;;;;;;AAWxC,gBAAa,UAAU,cAAc,WAAY;AAC/C,SAAO,iBAAiB,KAAK,SAAS,OAAO;;;;;;;;;;;AAY/C,gBAAa,UAAU,UAAU,WAAY;AAC3C,SAAO;;;;;;;;;;;AAYT,gBAAa,UAAU,WAAW,WAAY;AAC5C,SAAO,KAAK;;;;;;;;AASd,gBAAa,UAAU,SAAS,SAAU,MAAM,UAAU;AACxD,SAAO,IAAIA,eAAa,MAAM,SAAS;;;;;;;;;;;AAYzC,gBAAa,UAAU,UAAU,WAAY;EAE3C,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;AAEzB,SAAO,SAAS,KAAK,YAAY,IAAI,KAAK,OAAO,UAAU,OAAO,WAAW;;;;;;;;;;;;;;;;AAiB/E,gBAAa,UAAU,SAAS,SAAU,OAAO,aAAa,cAAc;AAE1E,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,gDAAgD;AAIlE,UAAQ,UAAU,QAAlB;GACE,KAAK,EACH,QAAO,WAAW,MAAM,MAAM;GAGhC,KAAK;GACL,KAAK,EACH,QAAO,WAAW,MAAM,OAAO,aAAa,aAAa;GAC3D,QACE,OAAM,IAAI,YAAY,4BAA4B;;;CAGxD,SAAS,WAAW,UAAQ,KAAK;AAE/B,MAAI,CAAC,QAAQ,IAAI,CACf,OAAM,IAAI,UAAU,gBAAgB;AAGtC,MADe,IAAI,UAAU,CAG3B,QAAOE,SAAO,IAAI,IAAI,KAAK,CAAC;EAG9B,IAAI,OAAO,IAAI,MAAM;AACrB,MAAI,KAAK,WAAWA,SAAO,MAAM,OAC/B,OAAM,IAAI,eAAe,KAAK,QAAQA,SAAO,MAAM,OAAO;EAI5D,IAAI,GAAG,IAAI,GAAG;EAGd,IAAII,QAAM,IAAI,KAAK;EACnB,IAAIC,QAAM,IAAI,KAAK;AACnB,OAAK,IAAI,GAAG,KAAKL,SAAO,MAAM,QAAQ,IAAI,IAAI,KAAK;AACjD,iBAAcI,MAAI,IAAIJ,SAAO,MAAM,GAAG;AACtC,iBAAcK,MAAI,IAAIL,SAAO,MAAM,GAAG;;EAIxC,IAAI,UAAUA,SAAO;EACrB,IAAI,SAASA,SAAO;EACpB,IAAI,OAAOA,SAAO;EAGlB,IAAI,OAAO,IAAI,UAAU,EAAE;EAC3B,IAAI,UAAU,IAAI,UAAU,EAAE;EAG9B,IAAI,IAAI,EAAE;EACV,IAAI,KAAK,EAAE;AAGX,OAAK,QAAQ,SAAU,KAAG,GAAG;AAE3B,MAAGM,OAAK,EAAE;AAEV,KAAEA,OAAK;IACP;EAGF,IAAI,SAAS,UAAU,EAAE,GAAG;EAC5B,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;AAGZ,UAAQ,QAAQ,SAAU,GAAG;AAE3B,OAAI,KAAK,MAAM,OAAO;AAEtB,QAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AAE/C,QAAI,OAAO;AAEX,QAAI,EAAE,OAAO,MAAM;AAEjB,WAAM,KAAK,GAAG,GAAG;AAEjB,SAAI,OACF,QAAO,KAAK,QAAQ,GAAG;;;IAI7B;AAEF,MAAI,KAAK,MAAM,OAAO;AAGtB,SAAO,IAAIR,eAAa;GACtB;GACA;GACA;GACA;GACA,UAAUE,SAAO;GAClB,CAAC;;CAEJ,SAAS,WAAW,UAAQ,OAAO,WAAW,cAAc;AAE1D,MAAI,CAAC,SAAS,MAAM,YAAY,KAC9B,OAAM,IAAI,UAAU,gBAAgB;EAItC,IAAI,QAAQ,MAAM,MAAM;EACxB,IAAI,WAAW,MAAM,UAAU;EAG/B,IAAI;AACJ,MAAI,SAAS,UAAU,EAAE;AAEvB,WAAQ,UAAU,MAAM;AAExB,eAAY,UAAU,SAAS;QAG/B,SAAQ,UAAU,UAAU;AAI9B,MAAI,UAAU;AAEZ,OAAI,MAAM,WAAW,EACnB,OAAM,IAAI,UAAU,kBAAkB;AAGxC,YAAO,IAAI,MAAM,KAAK,EAAE,WAAW,aAAa;SAC3C;AAEL,OAAI,MAAM,WAAW,KAAK,MAAM,WAAW,EACzC,OAAM,IAAI,eAAe,MAAM,QAAQA,SAAO,MAAM,QAAQ,IAAI;AAIlE,OAAI,MAAM,SAAS,MAAM,QAAQ;IAE/B,IAAI,IAAI;IACR,IAAI,QAAQ;AACZ,WAAO,MAAM,OAAO,KAAK,MAAM,OAAO,EACpC;AAEF,WAAO,MAAM,OAAO,GAAG;AACrB;AACA;;AAGF,gBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,MAAM;;AAI9D,OAAI,CAAC,gBAAgB,OAAO,MAAM,CAChC,OAAM,IAAI,eAAe,OAAO,OAAO,IAAI;AAI7C,OAAI,MAAM,WAAW,EAGnB,CADY,MAAM,UAAU,EAAE,CACxB,QAAQ,SAAU,WAAW,UAAU;AAC3C,kBAAc,UAAU;AACxB,aAAO,IAAI,CAAC,WAAW,EAAE,EAAE,UAAU,SAAS,KAAK,aAAa;KAChE;QACG;IAEL,IAAI,sBAAsB,MAAM,UAAU,EAAE;IAC5C,IAAI,uBAAuB,MAAM,UAAU,EAAE;AAC7C,wBAAoB,QAAQ,SAAU,gBAAgB,eAAe;AACnE,mBAAc,eAAe;AAC7B,0BAAqB,QAAQ,SAAU,iBAAiB,gBAAgB;AACtE,oBAAc,gBAAgB;AAC9B,eAAO,IAAI,CAAC,gBAAgB,gBAAgB,EAAE,UAAU,cAAc,IAAI,eAAe,KAAK,aAAa;OAC3G;MACF;;;AAGN,SAAOA;;;;;;;;AAST,gBAAa,UAAU,MAAM,SAAU,OAAO;AAC5C,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,MAAI,MAAM,WAAW,KAAK,MAAM,OAC9B,OAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,OAAO;AAI3D,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,6CAA6C;EAI/D,IAAI,IAAI,MAAM;EACd,IAAI,IAAI,MAAM;AAGd,gBAAc,GAAG,KAAK,MAAM,GAAG;AAC/B,gBAAc,GAAG,KAAK,MAAM,GAAG;EAG/B,IAAI,IAAI,eAAe,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO;AAEtE,MAAI,IAAI,KAAK,KAAK,IAAI,MAAM,KAAK,OAAO,OAAO,EAC7C,QAAO,KAAK,QAAQ;AAEtB,SAAO;;;;;;;;;;;;AAaT,gBAAa,UAAU,MAAM,SAAU,OAAO,GAAG,cAAc;AAC7D,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,MAAI,MAAM,WAAW,KAAK,MAAM,OAC9B,OAAM,IAAI,eAAe,MAAM,QAAQ,KAAK,MAAM,OAAO;AAI3D,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,6CAA6C;EAI/D,IAAI,IAAI,MAAM;EACd,IAAI,IAAI,MAAM;EAGd,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;EAGzB,IAAI,KAAKC;EAET,IAAI,OAAO;AACX,MAAI,SAAS,KAAK,UAAU,EAAE;AAE5B,QAAKC,QAAM,KAAKD,eAAa,CAAC,KAAK,WAAW,KAAK,UAAU,CAAC,IAAIA;AAElE,UAAOC,QAAM,QAAQ,GAAG,KAAK,UAAU;;AAIzC,MAAI,IAAI,OAAO,KAAK,IAAI,UAAU,GAAG;AAEnC,aAAQ,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,GAAG,QAAQ,EAAE,aAAa;AAE5E,UAAO,KAAK,MAAM;AAClB,aAAU,KAAK,MAAM;;AAIvB,gBAAc,GAAG,KAAK;AACtB,gBAAc,GAAG,QAAQ;EAGzB,IAAI,IAAI,eAAe,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO;AAEtE,MAAI,IAAI,KAAK,KAAK,IAAI,MAAM,KAAK,OAAO,OAAO,EAE7C,KAAI,CAAC,GAAG,GAAG,KAAK,CAEd,MAAK,QAAQ,KAAK;MAGlB,SAAQ,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,KAAK;WAGjD,CAAC,GAAG,GAAG,KAAK,CAEd,SAAQ,GAAG,GAAG,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,KAAK;AAG7D,SAAO;;CAET,SAAS,eAAe,GAAG,KAAK,QAAQ,OAAO;AAE7C,MAAI,SAAS,QAAQ,EACnB,QAAO;AAGT,OAAK,IAAI,IAAI,KAAK,IAAI,QAAQ,IAE5B,KAAI,MAAM,OAAO,EACf,QAAO;AAIX,SAAO;;CAET,SAAS,QAAQ,GAAG,GAAG,QAAQ,OAAO,KAAK;AAEzC,SAAO,OAAO,GAAG,EAAE;AACnB,QAAM,OAAO,GAAG,EAAE;AAElB,OAAK,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAClC,KAAI;;CAGR,SAAS,QAAQ,GAAG,GAAG,GAAG,GAAG,QAAQ,OAAO,KAAK;AAE/C,SAAO,OAAO,GAAG,GAAG,EAAE;AAEtB,QAAM,OAAO,GAAG,GAAG,EAAE;AAErB,OAAK,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAClC,KAAI;;;;;;;;;;;;;;;;;AAmBR,gBAAa,UAAU,SAAS,SAAU,MAAM,cAAc,MAAM;AAElE,MAAI,CAAC,aAAa,KAAK,CACrB,OAAM,IAAI,UAAU,2BAA2B;EAIjD,IAAI,YAAY,KAAK,SAAS,CAAC,KAAI,UAAS;AAC1C,UAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,WAAW,IAAI,MAAM,KAAK;IAC/D;AACF,MAAI,UAAU,WAAW,EACvB,OAAM,IAAI,MAAM,2CAA2C;AAI7D,YAAU,QAAQ,SAAU,OAAO;AACjC,OAAI,CAAC,SAAS,MAAM,IAAI,CAACK,YAAU,MAAM,IAAI,QAAQ,EACnD,OAAM,IAAI,UAAU,yDAA8DC,SAAO,UAAU,GAAG,IAAI;IAE5G;AAKF,SAAOC,UAFC,OAAO,KAAK,OAAO,GAAG,MAEZ,UAAU,IAAI,UAAU,IAAI,aAAa;;CAE7D,SAASA,UAAQ,UAAQ,MAAM,SAAS,cAAc;EAEpD,IAAI,QAAQ,gBAAgB;EAG5B,IAAI,KAAKR;EAET,IAAI,OAAO;AACX,MAAI,SAASD,SAAO,UAAU,EAAE;AAE9B,QAAKE,QAAM,KAAKD,eAAa,CAACD,SAAO,WAAWA,SAAO,UAAU,CAAC,IAAIC;AAEtE,UAAOC,QAAM,QAAQ,GAAGF,SAAO,UAAU;AAEzC,WAAQE,QAAM,QAAQ,OAAOF,SAAO,UAAU;;EAIhD,IAAI,MAAM,CAAC,GAAG,OAAO,KAAK;EAG1B,IAAI,IAAIA,SAAO,MAAM;EACrB,IAAI,IAAIA,SAAO,MAAM;EACrB,IAAI,GAAG,GAAG;AAGV,MAAI,UAAU,GAAG;AAEf,QAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,aAAO,KAAK,KAAKA,SAAO,QAAQ;AAEhC,QAAI,IAEF,MAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,cAAO,QAAQ,KAAK,MAAM;AAE1B,cAAO,OAAO,KAAK,EAAE;;;AAK3B,YAAO,KAAK,WAAWA,SAAO,QAAQ;aAC7B,UAAU,GAAG;AAEtB,YAAO,KAAK,OAAO,UAAU,GAAG,IAAI,QAAQ;AAE5C,YAAO,QAAQ,OAAOA,SAAO,KAAK,UAAUA,SAAO,QAAQ,OAAO;AAClE,YAAO,OAAO,OAAOA,SAAO,KAAK,UAAUA,SAAO,OAAO,OAAO;;AAGlE,MAAI;AAGJ,MAAI,OAAO,GAET;OAAI,KAAK;IAEP,IAAI,IAAI;AAER,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,cAAO,KAAK,KAAKA,SAAO,KAAK,KAAK;AAElC,SAAIA,SAAO,KAAK,IAAI,KAAK;KAEzB,IAAI,IAAI;AAER,UAAK,IAAI,GAAG,IAAI,MAAM,KAAK,KAAK;AAE9B,eAAO,QAAQ,OAAO,IAAI,GAAG,GAAG,MAAM;AAEtC,eAAO,OAAO,OAAO,IAAI,GAAG,GAAG,EAAE;AAEjC;;;AAIJ,aAAO,KAAK,KAAKA,SAAO,QAAQ;;aAEzB,OAAO,GAAG;GAEnB,IAAIU,MAAI;AAER,QAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,aAAO,KAAK,KAAKV,SAAO,KAAK,KAAKU;IAElC,IAAI,KAAKV,SAAO,KAAK;IACrB,IAAI,KAAKA,SAAO,KAAK,IAAI,KAAKU;AAE9B,SAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AAExB,SAAIV,SAAO,OAAO;AAElB,SAAI,IAAI,OAAO,GAAG;AAEhB,eAAO,QAAQ,OAAO,GAAG,EAAE;AAE3B,eAAO,OAAO,OAAO,GAAG,EAAE;AAE1B;;;;AAKN,YAAO,KAAK,KAAKA,SAAO,QAAQ;;AAGlC,WAAO,MAAM,KAAK;AAClB,WAAO,MAAM,KAAK;AAElB,SAAOA;;;;;;;;;;;;;;;;;;AAmBT,gBAAa,UAAU,UAAU,SAAU,OAAO,MAAM;AAEtD,MAAI,CAAC,QAAQ,MAAM,CACjB,OAAM,IAAI,UAAU,iBAAiB;AAEvC,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAM,QAAQ,SAAU,OAAO;AAC7B,OAAI,CAAC,SAAS,MAAM,IAAI,CAACO,YAAU,MAAM,IAAI,SAAS,MAAM,UAAU,EACpE,OAAM,IAAI,UAAU,+DAAoEC,SAAO,MAAM,GAAG,IAAI;IAE9G;EACF,IAAI,gBAAgB,KAAK,MAAM,KAAK,KAAK,MAAM;AAC/C,UAAQ,qBAAqB,OAAO,cAAc;AAIlD,MAAI,kBAHY,MAAM,KAAK,MAAM,GAI/B,OAAM,IAAI,MAAM,sEAAsE;EAIxF,IAAI,IAAI,OAAO,KAAK,OAAO,GAAG;AAG9B,MAAI,KAAK,MAAM,OAAO,MAAM,MAAM,KAAK,MAAM,OAAO,MAAM,GACxD,QAAO;EAIT,IAAI,WAAW,EAAE;AACjB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,KAAK,QAAQ,IACjC,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,IAC7C,UAAS,KAAK,EAAE;EAKpB,IAAI,SAAS,EAAE,QAAQ,OAAO;EAG9B,IAAI,WAAW,EAAE,OAAO,OAAO;AAG/B,OAAK,IAAI,KAAK,GAAG,KAAK,EAAE,OAAO,QAAQ,MAAM;GAC3C,IAAI,KAAK,SAAS;GAClB,IAAI,KAAK,SAAS;GAClB,IAAI,OAAO,KAAK,EAAE,MAAM,KAAK;AAC7B,YAAS,MAAM,OAAO,MAAM;AAC5B,YAAS,MAAM,KAAK,MAAM,OAAO,MAAM,GAAG;;AAU5C,IAAE,QAAQ,SAAS;AACnB,IAAE,OAAO,SAAS;AAClB,IAAE,KAAK,SAAS,MAAM,KAAK;AAC3B,IAAE,QAAQ,MAAM,OAAO;AACvB,OAAK,IAAI,MAAM,GAAG,MAAM,EAAE,KAAK,QAAQ,MACrC,GAAE,KAAK,OAAO;AAKhB,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;GACtC,IAAI,MAAM,SAAS;GACnB,IAAI,KAAK,SAAS;GAClB,IAAI,IAAI,OAAO;AAEf,WADQ,eAAe,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,KAAK,IAAI,EAAE,OAAO,EACtD,KAAK,IAAI,GAAG,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK;;AAKrD,SAAO;;;;;;;AAQT,gBAAa,UAAU,QAAQ,WAAY;AAQzC,SAPQ,IAAIV,eAAa;GACvB,QAAQ,KAAK,UAAUC,QAAM,KAAK,QAAQ,GAAG;GAC7C,OAAOA,QAAM,KAAK,OAAO;GACzB,KAAKA,QAAM,KAAK,KAAK;GACrB,MAAMA,QAAM,KAAK,MAAM;GACvB,UAAU,KAAK;GAChB,CAAC;;;;;;;AASJ,gBAAa,UAAU,OAAO,WAAY;AACxC,SAAO,KAAK,MAAM,MAAM,EAAE;;;;;;;;;;;;;AAc5B,gBAAa,UAAU,MAAM,SAAU,UAAU,WAAW;AAE1D,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,6CAA6C;EAG/D,IAAI,KAAK;EAET,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;EAEzB,IAAI,OAAO,iBAAiB,SAAS;AAQrC,SAAO,KAAK,MAAM,GAAG,OAAO,GAAG,GAAG,UAAU,GAP/B,SAAS,OAAO,GAAG,GAAG,GAAG;AAEpC,OAAI,SAAS,EAAG,QAAO,SAAS,EAAE;AAClC,OAAI,SAAS,EAAG,QAAO,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC;AAC1C,UAAO,SAAS,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG;KAGuB,UAAU;;;;;;CAOnE,SAAS,KAAK,UAAQ,QAAQ,QAAQ,WAAW,WAAW,UAAU,WAAW;EAE/E,IAAI,SAAS,EAAE;EACf,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;EAGZ,IAAI,KAAKE;EAET,IAAI,OAAO;AACX,MAAI,SAASD,SAAO,UAAU,EAAE;AAE9B,QAAKE,QAAM,KAAKD,eAAa,CAACD,SAAO,WAAWA,SAAO,UAAU,CAAC,IAAIC;AAEtE,UAAOC,QAAM,QAAQ,GAAGF,SAAO,UAAU;;EAI3C,IAAI,SAAS,SAASW,SAAO,GAAG,GAAG,GAAG;AAEpC,OAAI,SAAS,GAAG,GAAG,EAAE;AAErB,OAAI,CAAC,GAAG,GAAG,KAAK,EAAE;AAEhB,WAAO,KAAK,EAAE;AAEd,UAAM,KAAK,EAAE;;;AAIjB,OAAK,IAAI,IAAI,WAAW,KAAK,WAAW,KAAK;AAE3C,OAAI,KAAK,OAAO,OAAO;GAEvB,IAAI,KAAKX,SAAO,KAAK;GACrB,IAAI,KAAKA,SAAO,KAAK,IAAI;AACzB,OAAI,UAEF,MAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5B,IAAI,IAAIA,SAAO,OAAO;AAEtB,QAAI,KAAK,UAAU,KAAK,OAEtB,QAAOA,SAAO,QAAQ,IAAI,IAAI,QAAQ,IAAI,UAAU;;QAGnD;IAEL,IAAI,UAAU,EAAE;AAChB,SAAK,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM;KAC/B,IAAI,MAAMA,SAAO,OAAO;AACxB,aAAQ,OAAOA,SAAO,QAAQ;;AAKhC,SAAK,IAAI,MAAM,QAAQ,OAAO,QAAQ,MAEpC,QADY,OAAO,UAAU,QAAQ,OAAO,GAC9B,MAAM,QAAQ,IAAI,UAAU;;;AAMhD,MAAI,KAAK,OAAO,OAAO;AAEvB,SAAO,IAAIF,eAAa;GACtB;GACA;GACA;GACA,MAAM,CAAC,SAAS,SAAS,GAAG,YAAY,YAAY,EAAE;GACvD,CAAC;;;;;;;;;;;;AAaJ,gBAAa,UAAU,UAAU,SAAU,UAAU,WAAW;AAE9D,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,iDAAiD;EAGnE,IAAI,KAAK;EAET,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;AAEzB,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAEhC,IAAI,KAAK,KAAK,KAAK;GACnB,IAAI,KAAK,KAAK,KAAK,IAAI;AACvB,OAAI,UAEF,MAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5B,IAAI,IAAI,KAAK,OAAO;AAGpB,aAAS,KAAK,QAAQ,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG;;QAElC;IAEL,IAAI,SAAS,EAAE;AACf,SAAK,IAAI,MAAM,IAAI,MAAM,IAAI,OAAO;KAClC,IAAI,MAAM,KAAK,OAAO;AACtB,YAAO,OAAO,KAAK,QAAQ;;AAK7B,SAAK,IAAI,MAAM,GAAG,MAAM,MAAM,MAE5B,UADY,OAAO,SAAS,OAAO,OAAO,GAC1B,CAAC,KAAK,EAAE,EAAE,GAAG;;;;;;;;AAUrC,gBAAa,UAAU,OAAO,YAAY,aAAa;AACrD,MAAI,CAAC,KAAK,QACR,OAAM,IAAI,MAAM,uCAAuC;EAEzD,IAAI,UAAU,KAAK,MAAM;AACzB,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAChC,IAAI,KAAK,KAAK,KAAK;GACnB,IAAI,KAAK,KAAK,KAAK,IAAI;AACvB,QAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5B,IAAI,IAAI,KAAK,OAAO;AACpB,UAAM;KACJ,OAAO,KAAK,QAAQ;KACpB,OAAO,CAAC,GAAG,EAAE;KACd;;;;;;;;;AAUP,gBAAa,UAAU,UAAU,WAAY;AAC3C,SAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,KAAK;;;;;;;AAQzE,gBAAa,UAAU,UAAU,WAAY;AAC3C,SAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,MAAM;;CAE1E,SAAS,SAAS,QAAQ,OAAO,KAAK,MAAM,MAAM;EAEhD,IAAI,OAAO,KAAK;EAChB,IAAI,UAAU,KAAK;EAEnB,IAAI,IAAI,EAAE;EAEV,IAAI,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,KAAE,KAAK,EAAE;AACT,QAAK,IAAI,GAAG,IAAI,SAAS,IACvB,GAAE,GAAG,KAAK;;AAKd,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;GAE5B,IAAI,KAAK,IAAI;GACb,IAAI,KAAK,IAAI,IAAI;AAEjB,QAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,QAAI,MAAM;AAEV,MAAE,GAAG,KAAK,SAAS,OAAOC,QAAM,OAAO,GAAG,GAAG,OAAO,KAAK;;;AAG7D,SAAO;;;;;;;;;;;AAYT,gBAAa,UAAU,SAAS,SAAU,SAAS;EAEjD,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;EAEzB,IAAI,UAAU,KAAK,SAAS;EAE5B,IAAI,MAAM,oBAAoBS,SAAO,MAAM,QAAQ,GAAG,QAAQA,SAAO,SAAS,QAAQ,GAAG,gBAAgBA,SAAO,SAAS,QAAQ,GAAG;AAEpI,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAEhC,IAAI,KAAK,KAAK,KAAK;GACnB,IAAI,KAAK,KAAK,KAAK,IAAI;AAEvB,QAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5B,IAAI,IAAI,KAAK,OAAO;AAEpB,WAAO,YAAYA,SAAO,GAAG,QAAQ,GAAG,OAAOA,SAAO,GAAG,QAAQ,GAAG,YAAY,KAAK,UAAUA,SAAO,KAAK,QAAQ,IAAI,QAAQ,GAAG;;;AAGtI,SAAO;;;;;;;AAQT,gBAAa,UAAU,WAAW,WAAY;AAC5C,SAAOA,SAAO,KAAK,SAAS,CAAC;;;;;;;AAQ/B,gBAAa,UAAU,SAAS,WAAY;AAC1C,SAAO;GACL,QAAQ;GACR,QAAQ,KAAK;GACb,OAAO,KAAK;GACZ,KAAK,KAAK;GACV,MAAM,KAAK;GACX,UAAU,KAAK;GAChB;;;;;;;;;;AAWH,gBAAa,UAAU,WAAW,SAAU,GAAG;AAE7C,MAAI,GAAG;AAEL,OAAI,YAAY,EAAE,CAChB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACD,YAAU,EAAE,CAC/B,OAAM,IAAI,UAAU,4CAA4C;QAIlE,KAAI;EAEN,IAAI,SAAS,IAAI,IAAI,IAAI;EACzB,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI;EAGxB,IAAI,OAAO,KAAK,MAAM;EACtB,IAAI,UAAU,KAAK,MAAM;EAGzB,IAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,OAAO;EAG/C,IAAI,SAAS,EAAE;EACf,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;AAEZ,MAAI,KAAK;AAET,OAAK,IAAI,IAAI,QAAQ,IAAI,WAAW,OAAO,SAAS,GAAG,KAAK;GAE1D,IAAI,KAAK,KAAK,KAAK;GACnB,IAAI,KAAK,KAAK,KAAK,IAAI;AAEvB,QAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5B,IAAI,IAAI,KAAK,OAAO;AAEpB,QAAI,MAAM,IAAI,SAAS,MAAM;AAE3B,YAAO,KAAK,KAAK,QAAQ,GAAG;AAE5B,WAAM,OAAO,SAAS,KAAK,IAAI;AAE/B;;;;AAKN,MAAI,KAAK,OAAO,OAAO;AAEvB,SAAO,IAAIT,eAAa;GACtB;GACA;GACA;GACA,MAAM,CAAC,GAAG,EAAE;GACb,CAAC;;;;;;;;;;AAWJ,gBAAa,WAAW,SAAU,MAAM;AACtC,SAAO,IAAIA,eAAa,KAAK;;;;;;;;;;;;;;AAe/B,gBAAa,WAAW,SAAU,MAAM,OAAO,GAAG,cAAc,UAAU;AACxE,MAAI,CAAC,QAAQ,KAAK,CAChB,OAAM,IAAI,UAAU,iCAAiC;AAEvD,MAAI,KAAK,WAAW,EAClB,OAAM,IAAI,MAAM,2CAA2C;AAI7D,SAAO,KAAK,IAAI,SAAU,GAAG;AAE3B,OAAI,YAAY,EAAE,CAEhB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACS,YAAU,EAAE,IAAI,IAAI,EACvC,OAAM,IAAI,MAAM,wCAAwC;AAE1D,UAAO;IACP;AAGF,MAAI,GAAG;AAEL,OAAI,YAAY,EAAE,CAChB,KAAI,EAAE,UAAU;AAGlB,OAAI,CAAC,SAAS,EAAE,IAAI,CAACA,YAAU,EAAE,CAC/B,OAAM,IAAI,UAAU,4CAA4C;QAIlE,KAAI;EAIN,IAAI,KAAKN;EAET,IAAI,OAAO;AACX,MAAI,SAAS,SAAS,EAAE;AAEtB,QAAKC,QAAM,KAAKD,eAAa,CAAC,UAAU,SAAS,CAAC,IAAIA;AAEtD,UAAOC,QAAM,QAAQ,GAAG,SAAS;;EAEnC,IAAI,SAAS,IAAI,IAAI,IAAI;EACzB,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI;EAGxB,IAAI,OAAO,KAAK;EAChB,IAAI,UAAU,KAAK;EAGnB,IAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,OAAO;EAG/C,IAAI;AAGJ,MAAI,QAAQ,MAAM,EAAE;AAElB,OAAI,MAAM,WAAW,EAEnB,OAAM,IAAI,MAAM,6BAA6B;AAG/C,YAAS,SAASU,SAAO,KAAG;AAE1B,WAAO,MAAMN;;aAEN,SAAS,MAAM,EAAE;GAE1B,IAAI,KAAK,MAAM,MAAM;AAErB,OAAI,GAAG,WAAW,KAAK,GAAG,OAAO,EAE/B,OAAM,IAAI,MAAM,wBAAwB;AAG1C,YAAS,SAASM,SAAO,KAAG;AAE1B,WAAO,MAAM,IAAI,CAACN,IAAE,CAAC;;QAIvB,UAAS,SAASM,WAAS;AAEzB,UAAO;;EAKX,IAAI,SAAS,EAAE;EACf,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;AAGZ,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,OAAI,KAAK,OAAO,OAAO;GAEvB,IAAI,IAAI,IAAI;AAEZ,OAAI,KAAK,KAAK,IAAI,GAAG;IAEnB,IAAI,IAAI,OAAO,EAAE;AAEjB,QAAI,CAAC,GAAG,GAAG,KAAK,EAAE;AAEhB,WAAM,KAAK,IAAI,KAAK;AAEpB,YAAO,KAAK,EAAE;;;;AAKpB,MAAI,KAAK,OAAO,OAAO;AAEvB,SAAO,IAAId,eAAa;GACtB;GACA;GACA;GACA,MAAM,CAAC,MAAM,QAAQ;GACtB,CAAC;;;;;;;;;;;AAYJ,gBAAa,UAAU,WAAW,SAAU,GAAG,GAAG;AAEhD,MAAI,CAAC,SAAS,EAAE,IAAI,CAACS,YAAU,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAACA,YAAU,EAAE,CAChE,OAAM,IAAI,MAAM,sCAAsC;AAGxD,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI,MAAM,2CAA2C;AAG7D,gBAAc,GAAG,KAAK,MAAM,GAAG;AAC/B,gBAAc,GAAG,KAAK,MAAM,GAAG;AAG/B,iBAAa,UAAU,GAAG,GAAG,KAAK,MAAM,IAAI,KAAK,SAAS,KAAK,QAAQ,KAAK,KAAK;AAEjF,SAAO;;;;;;;;;;;AAYT,gBAAa,cAAc,SAAU,GAAG,QAAQ,OAAO,KAAK,UAAU;EAEpE,IAAI,KAAK,IAAI;EACb,IAAI,KAAK,IAAI,IAAI;AAEjB,OAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAEvB,UAAS,MAAM,IAAI,OAAO,GAAG;;;;;;;;;;;;AAcjC,gBAAa,YAAY,SAAU,GAAG,GAAG,SAAS,QAAQ,OAAO,KAAK;AAEpE,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAEhC,IAAI,KAAK,IAAI;GACb,IAAI,KAAK,IAAI,IAAI;GAEjB,IAAI,KAAK,eAAe,GAAG,IAAI,IAAI,MAAM;GAEzC,IAAI,KAAK,eAAe,GAAG,IAAI,IAAI,MAAM;AAEzC,OAAI,KAAK,MAAM,KAAK,MAAM,MAAM,QAAQ,KAAK,MAAM,QAAQ,GAAG;AAE5D,QAAI,QAAQ;KACV,IAAI,IAAI,OAAO;AACf,YAAO,MAAM,OAAO;AACpB,YAAO,MAAM;;AAGf;;AAGF,OAAI,KAAK,MAAM,MAAM,QAAQ,MAAM,MAAM,MAAM,MAAM,QAAQ,IAAI;IAE/D,IAAI,KAAK,SAAS,OAAO,MAAM;AAE/B,UAAM,OAAO,IAAI,GAAG,EAAE;AACtB,QAAI,OACF,QAAO,OAAO,IAAI,GAAG,GAAG;AAG1B,UAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AACvC,QAAI,OACF,QAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AAG1C;;AAGF,OAAI,KAAK,MAAM,MAAM,QAAQ,MAAM,MAAM,MAAM,MAAM,QAAQ,IAAI;IAE/D,IAAI,KAAK,SAAS,OAAO,MAAM;AAE/B,UAAM,OAAO,IAAI,GAAG,EAAE;AACtB,QAAI,OACF,QAAO,OAAO,IAAI,GAAG,GAAG;AAG1B,UAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AACvC,QAAI,OACF,QAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,EAAE;;;;AAKhD,QAAOT;GACN,EACD,SAAS,MACV,CAAC;;;;AC38CF,IAAIe,UAAO;AACX,IAAIC,kBAAe,CAAC,QAAQ;;;;;;AAO5B,SAAS,yBAAyB,OAAO;CACvC,IAAI,2BAA2B,MAAM,MAAM,yCAAyC;AACpF,KAAI,yBAQF,QAAO;EACL;EACA,OATU;GACV,MAAM;GACN,MAAM;GACN,MAAM;GACP,CAAC,yBAAyB;EAMzB,aALgB,yBAAyB;EAMzC,gBALmB,yBAAyB;EAM7C;KAED,QAAO;;;;;;;AASX,SAAS,8BAA8B,OAAO;CAC5C,IAAI,IAAI,SAAS,MAAM,aAAa,MAAM,MAAM;CAChD,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,eAAe,QAAQ,KAAK;EACpD,IAAI,aAAa,SAAS,MAAM,eAAe,IAAI,MAAM,MAAM;AAC/D,OAAK,aAAa,KAAK,IAAI,MAAM,OAAO,IAAI,EAAE;;CAEhD,IAAI,SAAS,IAAI;AACjB,KAAI,MAAM,OAAO,CACf,OAAM,IAAI,YAAY,cAAa,MAAM,QAAQ,2BAA0B;AAE7E,QAAO;;AAET,IAAW,eAA8B,wBAAQD,SAAMC,kBAAc,SAAQ;CAC3E,IAAI,EACF,mBACE;;;;;;;;;;;;;;;;;;;;;;;;;;CA0BJ,IAAIC,WAASC,QAAM,UAAU;EAC3B,IAAI,SAAS,IAAI;AACf,UAAO;;EAET,QAAQ,SAASD,SAAO,GAAG;AACzB,UAAO;;EAET,QAAQ,SAAS,OAAO,GAAG;AACzB,OAAI,MAAM,MAAO,QAAO;GACxB,IAAI,wBAAwB,yBAAyB,EAAE;AACvD,OAAI,sBACF,QAAO,8BAA8B,sBAAsB;GAE7D,IAAI,OAAO;GACX,IAAI,sBAAsB,EAAE,MAAM,gCAAgC;AAClE,OAAI,qBAAqB;AAGvB,WAAO,OAAO,oBAAoB,GAAG;AACrC,QAAI,oBAAoB;;GAE1B,IAAI,MAAM,OAAO,EAAE;AACnB,OAAI,MAAM,IAAI,CACZ,OAAM,IAAI,YAAY,cAAa,IAAI,2BAA0B;AAEnE,OAAI,qBAAqB;AAGvB,QAAI,MAAM,KAAK,OAAO,EAEpB,OAAM,IAAI,YAAY,YAAY,OAAO,GAAG,qBAAqB,CAAC;AAGpE,QAAI,OAAO,MAAM,OAAO,GACtB,OAAM,MAAM,KAAK;;AAGrB,UAAO;;EAET,WAAW,SAASE,YAAU,GAAG;AAC/B,UAAO,EAAE,UAAU;;EAErB,UAAU,SAASC,WAAS,GAAG;AAC7B,UAAO,EAAE,SAAS;;EAEpB,MAAMF,QAAM,aAAY,YAAQ,MAAK;GACnC,IAAIG,UAAQ,EAAE,OAAO;AACrB,WAAM,QAAQC,OAAK,EAAE,MAAM;AAC3B,UAAOD;IACP;EACF,MAAM,SAAS,MAAM,GAAG;AACtB,UAAO;;EAET,uBAAuB,SAAS,eAAe,MAAM,eAAe;AAClE,UAAO,KAAK,SAAS,cAAc;;EAErC,kBAAkBH,QAAM,aAAY,YAAQ,MAAK,QAAQ,GAAGI,OAAK,CAAC;EACnE,CAAC;AAOF,UAAO,WAAW,SAAU,MAAM;AAChC,SAAO,WAAW,KAAK,MAAM;;AAE/B,QAAOL;EACP;;;;AChJF,IAAIM,UAAO;AACX,IAAIC,kBAAe,CAAC,SAAS,YAAY;AACzC,IAAW,kBAAiC,wBAAQD,SAAMC,kBAAc,SAAQ;CAC9E,IAAI,EACF,gBACA,2BACE;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BJ,QAAOC,QAAM,aAAa;EACxB,IAAI,SAAS,IAAI;AACf,UAAO,IAAIC,YAAU,EAAE;;EAEzB,QAAQ,SAASC,SAAO,GAAG;AAEzB,UAAO,IAAID,YAAU,IAAI,GAAG;;EAE9B,QAAQ,SAAS,OAAO,GAAG;GACzB,IAAI,sBAAsB,EAAE,MAAM,gCAAgC;AAClE,OAAI,qBAAqB;IAEvB,IAAI,OAAO,oBAAoB;IAC/B,IAAI,IAAIA,YAAU,oBAAoB,GAAG;IACzC,IAAI,aAAa,IAAIA,YAAU,EAAE,CAAC,IAAI,OAAO,KAAK,CAAC;AACnD,QAAI,EAAE,GAAG,WAAW,IAAI,EAAE,CAAC,CACzB,OAAM,IAAI,YAAY,YAAY,OAAO,GAAG,qBAAqB,CAAC;IAEpE,IAAI,mBAAmB,IAAIA,YAAU,EAAE,CAAC,IAAI,OAAO,KAAK,GAAG,EAAE;AAC7D,QAAI,EAAE,IAAI,iBAAiB,CACzB,QAAO,EAAE,IAAI,WAAW;QAExB,QAAO;;AAGX,UAAO,IAAIA,YAAU,EAAE;;EAEzB,WAAW,SAASA,YAAU,GAAG;AAE/B,UAAO;;EAET,MAAMD,QAAM,aAAY,YAAQ,MAAK;GACnC,IAAIG,UAAQ,EAAE,OAAO;AACrB,WAAM,QAAQC,OAAK,EAAE,MAAM;AAC3B,UAAOD;IACP;EACF,UAAU,SAASE,WAAS,GAAG;AAC7B,UAAO,IAAIJ,YAAU,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE;;EAE/C,MAAM,SAAS,MAAM,GAAG;AACtB,UAAO,IAAIA,YAAU,EAAE;;EAEzB,kBAAkBD,QAAM,aAAY,YAAQ,MAAK,QAAQ,GAAGI,OAAK,CAAC;EACnE,CAAC;EACF;;;;AC5EF,IAAIE,UAAO;AACX,IAAIC,kBAAe,CAAC,SAAS,WAAW;AACxC,IAAW,iBAAgC,wBAAQD,SAAMC,kBAAc,SAAQ;CAC7E,IAAI,EACF,gBACA,yBACE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCJ,QAAOC,QAAM,YAAY;EACvB,QAAQ,SAASC,SAAO,GAAG;AACzB,OAAI,CAAC,SAAS,EAAE,IAAI,MAAM,EAAE,CAC1B,OAAM,IAAI,MAAM,IAAI,uCAAuC;AAE7D,UAAO,IAAIC,WAAS,EAAE;;EAExB,QAAQ,SAAS,OAAO,GAAG;AACzB,UAAO,IAAIA,WAAS,EAAE;;EAExB,kBAAkB,SAAS,aAAa,WAAW,aAAa;AAC9D,UAAO,IAAIA,WAAS,WAAW,YAAY;;EAE7C,MAAM,SAAS,MAAM,GAAG;AACtB,UAAO,IAAIA,WAAS,EAAE;;EAExB,WAAW,SAASC,YAAU,GAAG;AAC/B,UAAO,IAAID,WAAS,EAAE,UAAU,CAAC;;EAEnC,UAAU,SAASA,WAAS,GAAG;AAC7B,UAAO;;EAET,MAAMF,QAAM,aAAY,YAAQ,MAAK;GACnC,IAAII,UAAQ,EAAE,OAAO;AACrB,WAAM,QAAQC,OAAK,EAAE,MAAM;AAC3B,UAAOD;IACP;EACF,QAAQ,SAASE,SAAO,GAAG;AACzB,UAAO,IAAIJ,WAAS,EAAE;;EAExB,kBAAkBF,QAAM,aAAY,YAAQ,MAAK,QAAQ,GAAGK,OAAK,CAAC;EACnE,CAAC;EACF;;;;AC7EF,IAAIE,UAAO;AACX,IAAIC,kBAAe;CAAC;CAAS;CAAU;CAAe;CAAe;AACrE,IAAW,eAA8B,wBAAQD,SAAMC,kBAAc,SAAQ;CAC3E,IAAI,EACF,gBACA,kBACA,4BACA,iCACE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCJ,QAAOC,QAAMF,SAAM;EACjB,IAAI,SAAS,IAAI;AACf,UAAO,QAAQ,EAAE,CAAC;;EAEpB,QAAQ,SAAS,OAAO,UAAQ;AAC9B,UAAO,QAAQ,EAAE,EAAEG,SAAO;;EAE5B,kBAAkB,SAAS,aAAa,UAAQ,UAAU;AACxD,UAAO,QAAQ,EAAE,EAAEA,UAAQ,SAAS;;EAEtC,OAAO,SAASC,QAAM,MAAM;AAC1B,UAAO,QAAQ,KAAK;;EAEtB,QAAQ,SAASC,SAAO,MAAM;AAC5B,UAAO,QAAQ,MAAM,KAAK,SAAS,CAAC;;EAEtC,0BAA0B;EAC1B,kCAAkC;EACnC,CAAC;;;;;;;;;CAUF,SAAS,QAAQ,MAAM,UAAQ,UAAU;AAEvC,MAAIF,aAAW,WAAWA,aAAW,aAAaA,aAAW,OAC3D,QAAO,IAAIG,cAAY,MAAM,SAAS;AAExC,MAAIH,aAAW,SACb,QAAO,IAAII,eAAa,MAAM,SAAS;AAEzC,QAAM,IAAI,UAAU,yBAAyB,KAAK,UAAUJ,SAAO,GAAG,IAAI;;EAE5E;;;;AC/EF,IAAIK,UAAO;AACX,IAAIC,kBAAe,CAAC,QAAQ;AAC5B,IAAW,kBAAiC,wBAAQD,SAAMC,kBAAc,SAAQ;CAC9E,IAAI,EACF,mBACE;;;;;;;;;;;;;AAaJ,QAAOC,QAAMF,SAAM;EACjB,kBAAkB;EAClB,oBAAoB,SAAS,eAAe,GAAG,GAAG;AAChD,UAAO,EAAE,IAAI,EAAE;;EAEjB,wBAAwB,SAAS,mBAAmB,GAAG,GAAG;AACxD,UAAO,EAAE,KAAK,EAAE;;EAElB,sBAAsB,SAAS,iBAAiB,GAAG,GAAG;AACpD,UAAO,EAAE,IAAI,EAAE;;EAEjB,cAAcE,QAAM,aAAY,YAAS,GAAG,MAAM;AAChD,OAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,OAClC,OAAM,IAAI,MAAM,mDAAmD;AAErE,OAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,OAClC,OAAM,IAAI,MAAM,mDAAmD;AAErE,OAAI,CAAC,EAAE,UAAU,EAAE,CAAE,OAAM,IAAI,MAAM,qBAAqB;GAC1D,IAAI,MAAM,EAAE,OAAO;AACnB,OAAI,QAAQA,QAAM,KAAKC,QAAM,CAAC,IAAI,WAAW,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,OAAO,EAAE,MAAM;AAClF,OAAI,YAAY;AAChB,UAAO;IACP;EACH,CAAC;EACF;;;;AC3CF,IAAIC,UAAO;AACX,IAAIC,kBAAe,CAAC,QAAQ;AAC5B,IAAW,qBAAoC,wBAAQD,SAAMC,kBAAc,SAAQ;CACjF,IAAI,EACF,mBACE;;;;;;;;;;;;;;;;AAgBJ,QAAO,SAAS,aAAa,GAAG,KAAG,UAAU,SAAS;EAEpD,IAAI,QAAQ,EAAE;EACd,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;EAGZ,IAAI;EAEJ,IAAI,KAAK;AAGT,MAAI,OAAO,QAAQ,UAAU;AAE3B,QAAK;AAEL,SAAIC,QAAM,QAAQC,KAAG,GAAG;AAExB,QAAKD,QAAM,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC;;EAIrC,IAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,IAAI,OAAOC,KAAG,QAAQ,GAAG,EAAE;AAGvF,SAAO,EAAE,kBAAkB;GACzB,MAAM;GACN,MAAMC,QAAM,MAAM;GAClB,UAAU;GACX,CAAC;;CAIJ,SAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI,SAAS;EAEjD,IAAI,KAAK,EAAE;AAEX,MAAI,UAAU,EAAE,SAAS,EAEvB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAErB,IAAG,KAAK,UAAU,EAAE,IAAI,GAAG,GAAG,GAAG,EAAE,GAAG,IAAI,GAAG;MAI/C,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAErB,IAAG,KAAK,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,IAAI,GAAG,IAAI,IAAI,QAAQ;AAGvE,SAAO;;EAET;;;;ACzEF,IAAIC,UAAO;AACX,IAAIC,iBAAe,CAAC,QAAQ;AAC5B,IAAW,qBAAoC,wBAAQD,SAAMC,iBAAc,SAAQ;CACjF,IAAI,EACF,mBACE;;;;;;;;;;;;;;;AAeJ,QAAO,SAAS,aAAa,GAAG,KAAG,UAAU;EAE3C,IAAI,QAAQ,EAAE;EACd,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;EAEZ,IAAI,QAAQC,IAAE;EACd,IAAI,QAAQA,IAAE;EACd,IAAI,MAAMA,IAAE;EAEZ,IAAI,QAAQ,EAAE;AAGd,MAAI,MAAM,WAAW,MAAM,OACzB,OAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,OAAO;AAItD,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAErC,OAAI,MAAM,OAAO,MAAM,GACrB,OAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,IAAI;AAG1G,SAAM,KAAK,MAAM;;EAInB,IAAI;EAEJ,IAAI,KAAK;AAGT,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAK;AAE1C,QAAK;AAEL,QAAKC,QAAM,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC;;EAIrC,IAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,IAAI,OAAO,MAAM,GAAG,EAAE;AAGlF,SAAO,EAAE,kBAAkB;GACzB,MAAM;GACN,MAAM;GACN,UAAU;GACX,CAAC;;CAIJ,SAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI;EAExC,IAAI,KAAK,EAAE;AAEX,MAAI,UAAU,EAAE,SAAS,EAEvB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAErB,IAAG,KAAK,EAAE,GAAG,IAAI,GAAG,GAAG;MAIzB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAErB,IAAG,KAAK,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,IAAI,GAAG,IAAI,GAAG,GAAG;AAGjE,SAAO;;EAET;;;;AC3FF,IAAIC,SAAO;AACX,IAAI,eAAe,CAAC,SAAS;AAC7B,IAAW,kBAAiC,wBAAQA,QAAM,eAAc,SAAQ;CAC9E,IAAI,EACF,qBACE;;;;;;;;;;AAUJ,QAAO,SAAU,GAAG,GAAG;EACrB,IAAI,IAAI,KAAK,IAAI,EAAE,MAAM,QAAQ,EAAE,MAAM,OAAO;AAChD,MAAI,EAAE,MAAM,WAAW,EAAE,MAAM,QAC7B;OAAI,EAAE,MAAM,OAAO,OAAK,MAAMC,UAAQ,EAAE,MAAM,GAAG,CAE/C,QAAO,CAAC,GAAG,EAAE;;EAGjB,IAAI,QAAQ,SAAS,EAAE,OAAO,GAAG,EAAE;EACnC,IAAI,QAAQ,SAAS,EAAE,OAAO,GAAG,EAAE;EAGnC,IAAI,UAAU,EAAE;AAChB,OAAK,IAAI,MAAM,GAAG,MAAM,GAAG,MACzB,SAAQ,OAAO,KAAK,IAAI,MAAM,MAAM,MAAM,KAAK;AAIjD,yBAAuB,OAAO,QAAQ;AACtC,yBAAuB,OAAO,QAAQ;EAGtC,IAAI,KAAK,EAAE,OAAO;EAClB,IAAI,KAAK,EAAE,OAAO;AAClB,MAAI,GAAG,MAAM,SAAS,EACpB,IAAG,QAAQ,SAAS,GAAG,OAAO,GAAG,EAAE,CAAC;WAC3B,GAAG,MAAM,SAAS,EAC3B,IAAG,QAAQ,SAAS,GAAG,OAAO,GAAG,EAAE,CAAC;AAItC,OAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,OAAI,GAAG,MAAM,QAAQ,QAAQ,MAC3B,MAAK,SAAS,IAAI,QAAQ,OAAO,KAAK;AAExC,OAAI,GAAG,MAAM,QAAQ,QAAQ,MAC3B,MAAK,SAAS,IAAI,QAAQ,OAAO,KAAK;;AAK1C,SAAO,CAAC,IAAI,GAAG;;CAEjB,SAAS,SAAS,OAAO,GAAG,QAAQ;AAElC,SAAO,CAAC,GAAG,MAAM,IAAI,MAAM,OAAO,CAAC,KAAK,OAAO,EAAE,GAAG,MAAM;;CAE5D,SAAS,SAAS,gBAAgB,eAAe,cAAc;AAE7D,SAAOC,SAAO,GAAG,MAAM,cAAc,CAAC,KAAK,eAAe,EAAE,aAAa;;EAE3E;;;;AC/DF,IAAIC,SAAO;AACX,IAAIC,iBAAe;CAAC;CAAS;CAAU;CAAS;AAChD,IAAW,6BAA4C,wBAAQD,QAAMC,iBAAc,SAAQ;CACzF,IAAI,EACF,gBACA,kBACA,qBACE;CACJ,IAAI,eAAe,mBAAmB,EACpC,gBACD,CAAC;CACF,IAAI,eAAe,mBAAmB,EACpC,gBACD,CAAC;CACF,IAAI,YAAY,gBAAgB,EAC9B,kBACD,CAAC;;;;;;;;;;;;;;;;;;AAmBF,QAAO,SAAS,qBAAqB,SAAS;EAC5C,IAAI,OAAO,QAAQ;EACnB,IAAI,KAAK,QAAQ,MAAM,QAAQ;EAC/B,IAAI;AACJ,MAAI,MAAM;AAER,sBAAmB;IACjB,6BAA6B,GAAG,MAAM,aAAa,GAAG,UAAU,GAAG,EAAE,EAAE,KAAK;IAC5E,iBAAiB,GAAG,MAAM,aAAa,GAAG,UAAUC,SAAO,EAAE,EAAEA,SAAO,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS;IAC1F,uBAAuB,GAAG,MAAM,aAAa,GAAG,UAAUA,SAAO,EAAE,EAAE,EAAE,EAAE,KAAK;IAC9E,uBAAuB,GAAG,MAAM,aAAa,GAAG,UAAU,GAAGA,SAAO,EAAE,CAAC,EAAE,KAAK;IAC/E;AAED,OAAI,QAAQ,GACV,kBAAiB,iCAAiC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,EAAE,EAAE,MAAM,MAAM;AAExG,OAAI,QAAQ,IAAI;AACd,qBAAiB,gCAAgC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,EAAE,EAAE,MAAM,MAAM;AACrG,qBAAiB,0BAA0B,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAUA,SAAO,EAAE,EAAE,EAAE,EAAE,MAAM,MAAM;;AAEzG,OAAI,IAAI;AACN,qBAAiB,gCAAgC,GAAG,MAAM,GAAG,GAAG,UAAU,GAAG,EAAE,EAAE,MAAM,KAAK;AAC5F,qBAAiB,0BAA0B,GAAG,MAAM,GAAG,GAAG,UAAUA,SAAO,EAAE,EAAE,EAAE,EAAE,MAAM,KAAK;;SAE3F;AAGL,sBAAmB;IACjB,4BAA4BC,QAAM,aAAY,YAAS,GAAG,MAAM;AAC9D,YAAO,aAAa,GAAG,UAAU,GAAG,EAAE,EAAEC,OAAK;MAC7C;IACF,gBAAgBD,QAAM,aAAY,YAAS,GAAG,MAAM;AAClD,YAAO,aAAa,GAAG,UAAUD,SAAO,EAAE,EAAEA,SAAO,EAAE,CAAC,EAAEE,OAAK,CAAC,SAAS;MACvE;IACF,sBAAsBD,QAAM,aAAY,YAAS,GAAG,MAAM;AACxD,YAAO,aAAa,GAAG,UAAUD,SAAO,EAAE,EAAE,EAAE,EAAEE,OAAK;MACrD;IACF,sBAAsBD,QAAM,aAAY,YAAS,GAAG,MAAM;AACxD,YAAO,aAAa,GAAG,UAAU,GAAGD,SAAO,EAAE,CAAC,EAAEE,OAAK;MACrD;IACH;AAED,OAAI,QAAQ,GACV,kBAAiB,gCAAgCD,QAAM,aAAY,YAAS,GAAG,MAAM;AACnF,WAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,EAAE,EAAEC,QAAM,MAAM;KAClD;AAEJ,OAAI,QAAQ,IAAI;AACd,qBAAiB,+BAA+BD,QAAM,aAAY,YAAS,GAAG,MAAM;AAClF,YAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,EAAE,EAAEC,QAAM,MAAM;MAClD;AACF,qBAAiB,yBAAyBD,QAAM,aAAY,YAAS,GAAG,MAAM;AAC5E,YAAO,QAAQ,GAAG,GAAG,UAAUD,SAAO,EAAE,EAAE,EAAE,EAAEE,QAAM,MAAM;MAC1D;;AAEJ,OAAI,IAAI;AACN,qBAAiB,+BAA+BD,QAAM,aAAY,YAAS,GAAG,MAAM;AAClF,YAAO,GAAG,GAAG,UAAU,GAAG,EAAE,EAAEC,QAAM,KAAK;MACzC;AACF,qBAAiB,yBAAyBD,QAAM,aAAY,YAAS,GAAG,MAAM;AAC5E,YAAO,GAAG,GAAG,UAAUD,SAAO,EAAE,EAAE,EAAE,EAAEE,QAAM,KAAK;MACjD;;;EAKN,IAAI,SAAS,QAAQ,UAAU;AAE/B,MADS,QAAQ,MAAM,QAAQ,GAE7B,KAAI,MAAM;AACR,oBAAiB,iBAAiB,WAAW,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,MAAM;AACrF,oBAAiB,SAAS,oBAAoB,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,KAAK;AACrF,oBAAiB,WAAW,WAAW,GAAG,MAAM,aAAaF,SAAO,EAAE,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS;AACjG,oBAAiB,SAAS,cAAc,GAAG,MAAM,aAAaA,SAAO,EAAE,EAAE,GAAG,MAAM,KAAK,CAAC,SAAS;SAC5F;AACL,oBAAiB,iBAAiB,UAAUC,QAAM,aAAY,YAAS,GAAG,MAAM;AAC9E,WAAO,aAAa,GAAG,GAAGC,QAAM,MAAM;KACtC;AACF,oBAAiB,SAAS,mBAAmBD,QAAM,aAAY,YAAS,GAAG,MAAM;AAC/E,WAAO,aAAa,GAAG,GAAGC,QAAM,KAAK;KACrC;AACF,oBAAiB,WAAW,UAAUD,QAAM,aAAY,YAAS,GAAG,MAAM;AACxE,WAAO,aAAaD,SAAO,EAAE,EAAE,GAAGE,QAAM,MAAM,CAAC,SAAS;KACxD;AACF,oBAAiB,SAAS,aAAaD,QAAM,aAAY,YAAS,GAAG,MAAM;AACzE,WAAO,aAAaD,SAAO,EAAE,EAAE,GAAGE,QAAM,KAAK,CAAC,SAAS;KACvD;;EAGN,IAAI,KAAK,QAAQ,OAAO,SAAY,QAAQ,KAAK,QAAQ;AACzD,MAAI,MAAM;AACR,OAAI,QAAQ,GACV,kBAAiB,kBAAkB,WAAW,GAAG,MAAM,QAAQ,GAAG,GAAG,GAAG,MAAM,MAAM;AAEtF,OAAI,GACF,kBAAiB,SAAS,qBAAqB,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,KAAK;SAEzE;AACL,OAAI,QAAQ,GACV,kBAAiB,kBAAkB,UAAUD,QAAM,aAAY,YAAS,GAAG,MAAM;AAC/E,WAAO,QAAQ,GAAG,GAAG,GAAGC,QAAM,MAAM;KACpC;AAEJ,OAAI,GACF,kBAAiB,SAAS,oBAAoBD,QAAM,aAAY,YAAS,GAAG,MAAM;AAChF,WAAO,GAAG,GAAG,GAAGC,QAAM,KAAK;KAC3B;;AAIN,MAAI,QAAQ,KAAK,WACf,QAAO,kBAAkB,KAAK,WAAW;AAE3C,SAAO;;EAET;;;;ACzJF,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,QAAQ;AAC5B,IAAW,uBAAsC,wBAAQD,QAAMC,iBAAc,SAAQ;CACnF,IAAI,EACF,mBACE;;;;;;;;;;;;;;;;;;;;AAoBJ,QAAO,SAAS,WAAW,aAAa,cAAc,UAAU,SAAS;EAEvE,IAAI,QAAQ,YAAY;EACxB,IAAI,QAAQ,YAAY;EACxB,IAAI,MAAM,YAAY,aAAa,YAAY,aAAa;EAE5D,IAAI,UAAU,aAAa;EAC3B,IAAI,SAAS,aAAa;EAC1B,IAAI,OAAO,aAAa;EACxB,IAAI,QAAQ,aAAa;EACzB,IAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,aAAa;AAG1H,MAAI,MAAM,WAAW,MAAM,OACzB,OAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,OAAO;AAItD,MAAI,MAAM,OAAO,MAAM,MAAM,MAAM,OAAO,MAAM,GAC9C,OAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,IAAI;AAI1G,MAAI,CAAC,QACH,OAAM,IAAI,MAAM,qEAAqE;EAIvF,IAAI,OAAO,MAAM;EACjB,IAAI,UAAU,MAAM;EAGpB,IAAI,KAAK,OAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,MAAM,MAAM;EAE3E,IAAI,KAAK,KAAKC,QAAM,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC,GAAG;EAG/C,IAAI,GAAG;EAGP,IAAI,QAAQ,EAAE;AAEd,OAAK,IAAI,GAAG,IAAI,MAAM,IACpB,OAAM,KAAK,EAAE;EAIf,IAAI,IAAI,EAAE;EAEV,IAAI,IAAI,EAAE;AAGV,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;GAE5B,IAAI,OAAO,IAAI;AAEf,QAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,QAAI,OAAO;AAEX,MAAE,KAAK,UAAU,GAAG,QAAQ,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,MAAM,GAAG,IAAI,QAAQ,GAAG;AAE1E,MAAE,KAAK;;AAGT,QAAK,IAAI,GAAG,IAAI,MAAM,IAEpB,KAAI,EAAE,OAAO,KAEX,OAAM,GAAG,KAAK,EAAE;OAGhB,OAAM,GAAG,KAAK,MAAM,GAAG;;AAM7B,SAAO,YAAY,kBAAkB;GACnC,MAAM;GACN,MAAM,CAAC,MAAM,QAAQ;GACrB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;GAClF,CAAC;;EAEJ;;;;AC7GF,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,cAAc;AAC3C,IAAW,yBAAwC,wBAAQD,QAAMC,iBAAc,SAAQ;CACrF,IAAI,EACF,gBACA,+BACE;;;;;;;;;;;;;;;;;;;AAmBJ,QAAO,SAAS,iBAAiB,GAAG,KAAG,UAAU;EAE/C,IAAI,UAAU,EAAE;EAChB,IAAI,SAAS,EAAE;EACf,IAAI,OAAO,EAAE;EACb,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,aAAa;EAE9E,IAAI,UAAUC,IAAE;EAChB,IAAI,SAASA,IAAE;EACf,IAAI,OAAOA,IAAE;EACb,IAAI,QAAQA,IAAE;EACd,IAAI,MAAMA,IAAE,aAAaA,IAAE,UAAU,SAAYA,IAAE,YAAYA,IAAE,aAAa;AAG9E,MAAI,MAAM,WAAW,MAAM,OACzB,OAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,OAAO;AAItD,MAAI,MAAM,OAAO,MAAM,MAAM,MAAM,OAAO,MAAM,GAC9C,OAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,IAAI;EAI1G,IAAI,OAAO,MAAM;EACjB,IAAI,UAAU,MAAM;EAGpB,IAAI;EAEJ,IAAI,KAAKC;EAET,IAAI,OAAO;EAEX,IAAI,KAAK;AAGT,MAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,QAAK;AAEL,QAAKC,QAAM,KAAKD,eAAa,CAAC,IAAI,GAAG,CAAC;AAEtC,UAAOC,QAAM,QAAQ,GAAG,GAAG;AAE3B,QAAKA,QAAM,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC;;EAIrC,IAAI,UAAU,WAAW,UAAU,EAAE,GAAG;EACxC,IAAI,SAAS,EAAE;EACf,IAAI,OAAO,EAAE;EAGb,IAAI,KAAK,WAAW,UAAU,EAAE,GAAG;EACnC,IAAI,KAAK,WAAW,UAAU,EAAE,GAAG;EAEnC,IAAI,KAAK,EAAE;EACX,IAAI,KAAK,EAAE;EAGX,IAAI,GAAG,GAAG,GAAG,IAAI;AAGjB,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,QAAK,KAAK,OAAO;GAEjB,IAAI,OAAO,IAAI;AAEf,QAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,QAAI,OAAO;AAEX,WAAO,KAAK,EAAE;AAEd,OAAG,KAAK;AAER,QAAI,GACF,IAAG,KAAK,QAAQ;;AAIpB,QAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,QAAI,OAAO;AAEX,QAAI,GAAG,OAAO,MAEZ;SAAI,IAAI;MAEN,IAAI,IAAI,GAAG,GAAG,IAAI,QAAQ,GAAG;AAE7B,UAAI,CAAC,GAAG,GAAG,KAAK,CAEd,IAAG,KAAK;UAGR,IAAG,KAAK;;WAGP;AAEL,YAAO,KAAK,EAAE;AAEd,QAAG,KAAK;AAER,SAAI,GACF,IAAG,KAAK,QAAQ;;;AAKtB,OAAI,MAAM,IAAI;AAEZ,QAAI,KAAK;AAET,WAAO,IAAI,OAAO,QAAQ;AAExB,SAAI,OAAO;AAEX,SAAI,GAAG,OAAO,MAAM;AAElB,cAAQ,KAAK,GAAG;AAEhB;gBACS,GAAG,OAAO,MAAM;AAEzB,cAAQ,KAAK,GAAG;AAEhB;WAGA,QAAO,OAAO,GAAG,EAAE;;;;AAM3B,OAAK,WAAW,OAAO;AAGvB,SAAO,EAAE,mBAAmB;GAC1B,QAAQ;GACR,OAAO;GACP,KAAK;GACL,MAAM,CAAC,MAAM,QAAQ;GACrB,UAAU,QAAQ,EAAE,aAAa,QAAQF,IAAE,YAAY,KAAK;GAC7D,CAAC;;EAEJ;;;;ACjLF,IAAIG,SAAO;AACX,IAAIC,iBAAe,CAAC,SAAS,cAAc;AAC3C,IAAW,uBAAsC,wBAAQD,QAAMC,iBAAc,SAAQ;CACnF,IAAI,EACF,gBACA,+BACE;;;;;;;;;;;;;;;;;;;;AAoBJ,QAAO,SAAS,eAAe,GAAG,KAAG,UAAU,SAAS;EAEtD,IAAI,UAAU,EAAE;EAChB,IAAI,SAAS,EAAE;EACf,IAAI,OAAO,EAAE;EACb,IAAI,QAAQ,EAAE;EACd,IAAI,MAAM,EAAE;AAGZ,MAAI,CAAC,QACH,OAAM,IAAI,MAAM,qEAAqE;EAIvF,IAAI,OAAO,MAAM;EACjB,IAAI,UAAU,MAAM;EAGpB,IAAI;EAEJ,IAAI,KAAK;AAGT,MAAI,OAAO,QAAQ,UAAU;AAE3B,QAAK;AAEL,SAAIC,QAAM,QAAQC,KAAG,GAAG;AAExB,QAAKD,QAAM,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC;;EAIrC,IAAI,QAAQ,EAAE;EAGd,IAAI,IAAI,EAAE;EAEV,IAAI,IAAI,EAAE;AAGV,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;GAEhC,IAAI,OAAO,IAAI;AAEf,QAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;IAE5D,IAAI,IAAI,OAAO;AAEf,MAAE,KAAK,QAAQ;AACf,MAAE,KAAK;;AAGT,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,QAAI,MAAM,EAER,OAAM,KAAK,EAAE;AAGf,QAAI,EAAE,OAAO,KAEX,OAAM,GAAG,KAAK,UAAU,GAAGC,KAAG,EAAE,GAAG,GAAG,GAAG,EAAE,IAAIA,IAAE;QAGjD,OAAM,GAAG,KAAKA;;;AAMpB,SAAO,IAAIC,cAAY;GACrB,MAAM;GACN,MAAM,CAAC,MAAM,QAAQ;GACrB,UAAU;GACX,CAAC;;EAEJ;;;;AClGF,IAAIC,SAAO;AACX,IAAIC,iBAAe;CAAC;CAAS;CAAU;CAAY;AACnD,IAAW,eAA8B,wBAAQD,QAAMC,iBAAc,SAAQ;CAC3E,IAAI,EACF,gBACA,kBACA,2BACE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BJ,QAAOC,QAAMF,QAAM;EAEjB,0CAA0C,SAAS,2BAA2B,MAAM;GAClF,IAAI;GACJ,IAAI,MAAM,KAAK;GACf,IAAI,MAAM;GACV,IAAI;GACJ,IAAI,WAAW;GACf,IAAI,WAAW,EAAE;AAEjB,QAAK,IAAI,GAAG,IAAI,KAAK,KAAK;IACxB,IAAI,MAAM,KAAK;AAGf,QAAI,SAAS,IAAI,CACf,YAAW;AAEb,QAAI,SAAS,IAAI,IAAI,YAAY,IAAI,EAAE;AACrC,SAAI,MAAM,MAAM,EACd,OAAM,IAAI,MAAM,+CAA+C;AAIjE,eAAU;AACV,WAAM,IAAI,SAAS;AAEnB,SAAI,CAACG,YAAU,IAAI,CACjB,OAAM,IAAI,UAAU,wCAAwC;AAE9D,SAAI,MAAM,KAAK,IAAI,KAAK,MAAM,QAE5B,OAAM,IAAI,WAAW,KAAK,UAAU,EAAE;WAEnC;KAEL,IAAI,IAAIC,QAAM,IAAI,CAAC,SAAS;KAC5B,IAAI,OAAO,UAAU,EAAE;AACvB,cAAS,KAAK;AACd,eAAU;AACV,WAAM,KAAK,SAAS;AAGpB,SAAI,IAAI,KAAK,QAAQ,QACnB,OAAM,IAAI,eAAe,UAAU,GAAG,MAAM,EAAE;;;AAIpD,OAAI,SAAS,WAAW,EACtB,OAAM,IAAI,YAAY,+BAA+B;GAEvD,IAAI,MAAM,SAAS,OAAO;AAC1B,UAAO,SAAS,OACd,OAAMC,SAAQ,KAAK,SAAS,OAAO,EAAE,IAAI;AAE3C,UAAO,WAAWC,SAAO,IAAI,GAAG;;EAElC,aAAa,SAAS,OAAO,MAAM;AACjC,UAAO,KAAK,KAAK,GAAG;;EAEvB,CAAC;EACF;;;;ACvGF,SAAgB,cAAc;AAC5B,OAAM,IAAI,MAAM,4CAA0C;;AAE5D,SAAgB,aAAa;AAC3B,OAAM,IAAI,MAAM,2CAAyC;;;;;;;;;;;;;;;ACQ3D,SAAgB,oBAAoB,KAAK,QAAQ,OAAO;CAEtD,IAAI;AACJ,KAAI,OAAO,IAAI,CAAC,SAAS,kBAAkB,EAAE;AAC3C,YAAU,UAAU,SAAS,IAAI,aAAa,OAAO,MAAM,GAAG,cAAc,KAAK,UAAU,MAAM,GAAG,MAAM,aAAa,IAAI,KAAK,SAAS;AACzI,yBAAO,IAAI,UAAU,sBAAsB,SAAS,kCAAkC,QAAQ;;AAEhG,KAAI,OAAO,IAAI,CAAC,SAAS,kBAAkB,EAAE;AAC3C,YAAU,UAAU,SAAS,IAAI,aAAa,OAAO,MAAM,GAAG,cAAc,KAAK,UAAU,MAAM,GAAG,MAAM;AAC1G,yBAAO,IAAI,UAAU,sBAAsB,SAAS,0DAA0D,QAAQ;;AAExH,QAAO;;;;;ACrBT,IAAIC,SAAO;AACX,IAAIC,iBAAe,CAAC,QAAQ;AAC5B,IAAW,eAA8B,wBAAQD,QAAMC,iBAAc,SAAQ;CAC3E,IAAI,EACF,mBACE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuHJ,QAAOC,QAAMF,QAAM;EACjB,KAAKG;EACL,+CAA+CA;EAChD,CAAC;EACF;;;;AC/HF,IAAIC,SAAO;AACX,IAAIC,iBAAe;CAAC;CAAU;CAAc;CAAY;AACxD,IAAW,gBAA+B,wBAAQD,QAAMC,iBAAc,SAAQ;CAC5E,IAAI,EACF,QAAQ,SACR,wBACA,yBACE;CACJ,IAAI,kBAAkB;EACpB,QAAQ;EACR,QAAQ;EACR,WAAW;EACX,UAAU;EACX;CAGD,IAAI,mBAAmB;EACrB,SAAQ,MAAK,QAAQ,EAAE;EACvB,WAAWC,eAAY,MAAKA,YAAU,EAAE,GAAG;EAC3C,UAAUC,cAAW,MAAKA,WAAS,EAAE,GAAG;EACzC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BD,QAAO,SAASC,UAAQ,OAAO;EAC7B,IAAI,aAAa,UAAU,SAAS,KAAK,UAAU,OAAO,SAAY,UAAU,KAAK;AAErF,OADY,UAAU,SAAS,IAAI,UAAU,KAAK,YACpC,OACZ,OAAM,IAAI,YAAY,uCAAuC;EAE/D,IAAI,YAAY,OAAO,MAAM;AAC7B,MAAI,EAAE,aAAa,iBACjB,OAAM,IAAI,UAAU,oBAAoB,QAAQ,gBAAe,YAAY,+BAA8B,OAAO,KAAK,gBAAgB,CAAC,KAAK,KAAK,CAAC;AAEnJ,MAAI,EAAE,cAAc,kBAClB,OAAM,IAAI,UAAU,oBAAoB,QAAQ,gBAAe,aAAa,gCAA+B,OAAO,KAAK,iBAAiB,CAAC,KAAK,KAAK,CAAC;AAEtJ,MAAI,eAAe,UACjB,QAAO;MAEP,QAAO,iBAAiB,YAAY,MAAM;;EAG9C;;;;ACnEF,IAAIC,SAAO;AACX,IAAIC,iBAAe;CAAC;CAAS;CAAU;CAAa;CAAe;CAAe;CAAgB;CAAS;AAC3G,IAAW,YAA2B,wBAAQD,QAAMC,iBAAc,SAAQ;CACxE,IAAI,EACF,gBACA,kBACA,wBACA,4BACA,4BACA,8BACA,qBACE;CACJ,IAAI,iBAAiB,qBAAqB,EACxC,gBACD,CAAC;CACF,IAAI,mBAAmB,uBAAuB;EAC5C;EACA;EACD,CAAC;CACF,IAAI,iBAAiB,qBAAqB;EACxC;EACA;EACD,CAAC;CACF,IAAI,uBAAuB,2BAA2B;EACpD;EACA;EACA;EACD,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCF,QAAOC,QAAMF,QAAM;EACjB,YAAYG;EACZ,oBAAoBD,QAAM,aAAY,YAAS,GAAG,GAAG,SAAS;GAC5D,IAAI,SAASE,OAAK,GAAG,EAAE;AACvB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,UAASA,OAAK,QAAQ,KAAK,GAAG;AAEhC,UAAO;IACP;EACH,EAAE,qBAAqB;EACtB,MAAMD;EACN,IAAI;EACJ,IAAI;EACJ,IAAI;EACL,CAAC,CAAC;EACH;;;;AC/EF,IAAI,OAAO;AACX,IAAI,eAAe;CAAC;CAAS;CAAU;CAAO;CAAU;AACxD,IAAW,YAA2B,wBAAQ,MAAM,eAAc,SAAQ;CACxE,IAAI,EACF,gBACA,kBACA,YACA,uBACE;;;;;;;;;;;;;;;;;;;;;;;;;AAyBJ,QAAOE,QAAM,MAAM;EAEjB,kBAAkB;EAElB,sCAAsC;EAEtC,OAAO,SAAS,EAAE,MAAM;AACtB,OAAI,oBAAoB,KAAK,CAC3B,OAAM,IAAI,UAAU,yCAAyC;AAE/D,UAAO,KAAK,KAAK;;EAEpB,CAAC;;;;;;;CAQF,SAAS,KAAK,OAAO;EACnB,IAAIC;AACJ,cAAY,OAAO,SAAU,OAAO;AAClC,OAAI;AACF,YAAMA,UAAQ,SAAY,QAAQC,MAAID,OAAK,MAAM;YAC1C,KAAK;AACZ,UAAM,oBAAoB,KAAK,OAAO,MAAM;;IAE9C;AAGF,MAAIA,UAAQ,OACV,SAAME,UAAQ,GAAGC,SAAO,OAAO;AAEjC,MAAI,OAAOH,UAAQ,SACjB,SAAME,UAAQF,OAAKG,SAAO,OAAO;AAEnC,SAAOH;;CAET,SAAS,SAAS,OAAO,KAAK;AAC5B,MAAI;AAEF,UADU,OAAO,OAAO,KAAKC,MAAI;WAE1B,KAAK;AACZ,SAAM,oBAAoB,KAAK,MAAM;;;EAGzC;;;;;;;;AC3EF,IAAW,YAA2B,qCAAqB,EACzD,kBACD,CAAC;AACF,IAAW,UAAyB,mCAAmB,EAAE,CAAC;AAU1D,IAAW,WAA0B,oCAAoB,EAAE,CAAC;AAgB5D,IAAW,SAAwB,kCAAkB,EAAE,CAAC;AA0BxD,IAAW,cAA6B,uCAAuB,EAC7D,QACD,CAAC;AAkBF,IAAW,QAAuB,4BAAY;CAC5C;CACA;CACA;CACA;CACD,CAAC;AA4BF,IAAW,YAA2B,gCAAgB,EACpD,OACD,CAAC;AAqBF,IAAW,YAA2B,gCAAgB;CACpD;CACA;CACD,CAAC;AAkCF,IAAW,cAA6B,kCAAkB;CACxD;CACA;CACD,CAAC;AAiBF,IAAW,SAAwB,6BAAa,EAC9C,OACD,CAAC;AAWF,IAAW,YAA2B,gCAAgB,EACpD,OACD,CAAC;AAqCF,IAAW,SAAwB,6BAAa,EAC9C,OACD,CAAC;AAgCF,IAAW,eAA8B,wCAAwB;CAC/D;CACA;CACA;CACD,CAAC;AA8FF,IAAW,WAA0B,+BAAe;CAClD;CACA;CACD,CAAC;AAIF,IAAW,SAAwB,6BAAa;CAC9C;CACA;CACA;CACA;CACD,CAAC;AAWF,IAAW,UAAyB,8BAAc;CAChD;CACA;CACA;CACD,CAAC;AAoDF,IAAWG,WAAwB,6BAAa;CAC9C;CACA;CACA;CACD,CAAC;AAsLF,IAAW,MAAqB,0BAAU;CACxC;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;AAgOF,IAAW,MAAqB,0BAAU;CACxC;CACA;CACA;CACA;CACD,CAAC;;;;AC/2BF,IAAa,UAAb,MAAqB;CAEjB,YAAY,OAAO;AACf,OAAK,YAAY;AACjB,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,UAAU;AACf,OAAK,WAAW;AAChB,MAAI,MAAM,UAAU,OAChB,MAAK,cAAc,MAAM,MAAM;WAE1B,MAAM,SAAS,OACpB,MAAK,cAAc,MAAM,MAAM;WAE1B,MAAM,SAAS,OACpB,MAAK,aAAa,MAAM,KAAK;MAG7B,OAAM,IAAI,MAAM,+BAA+B;;CAGvD,IAAI,WAAW;AACX,SAAO,KAAK;;CAEhB,IAAI,QAAQ;AACR,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,IAAI,QAAQ;EACR,IAAI;AACJ,UAAQ,KAAK,KAAK,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;;CAEvE,IAAI,OAAO;AACP,MAAI,KAAK,UAAU;GACf,IAAI,OAAO,KAAK,MAAM,KAAK,WAAW;AAClC,WAAO,OAAO,KAAK,MAAM;AACrB,SAAI,IAAI,OAAO,EAAE,IAAI,OAAO,EAAE,GAAG,EAC7B,QAAO,OAAO,GAAG,EAAE,UAAU,SAAS,CAAC;SAGvC,QAAO,OAAO,GAAG,EAAE,UAAU,WAAW,CAAC;MAE/C;KACJ;AACF,OAAI,KAAK,UAAU,EACf,QAAO,KAAK;AAEhB,UAAO;QAGP,QAAO,KAAK,MAAM,SAAS,GAAG;;CAGtC,IAAI,OAAO;AACP,SAAO,KAAK,UAAU,KAAK,KAAK;;CAEpC,IAAI,MAAM;AACN,SAAO,KAAK,YAAY,SAAY,KAAK;;CAE7C,cAAc,OAAO;AACjB,MAAI,OAAO,UAAU,SACjB,MAAK,mBAAmB,MAAM;MAG9B,MAAK,iBAAiB,MAAM;;CAGpC,cAAc,OAAO;EACjB,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,OAAO,CAAC;AAC1C,MAAI,OAAO,IAAI,OAAO,KAAK,EAAE;GACzB,MAAMC,WAAS,IAAI,WAAW;IAC1B,KAAK,OAAO;IACZ,MAAM,OAAO;IAChB,CAAC;AACF,QAAK,mBAAmBA,SAAO,IAAI;aAE9B,OAAO,IAAI,OAAO,KAAK,EAAE,OAI9B,OAAM,IAAI,MAAM,4BAA4B,OAAO,KAAK;;CAGhE,aAAa,MAAM;AACf,MAAI,OAAO,QAAQ,SACf,MAAK,mBAAmB,KAAK;WAExB,OAAO,QAAQ,YAAY,KAAK,QAAQ,IAAI,IAAI,GACrD,MAAK,mBAAmB,SAAS,MAAM,GAAG,CAAC;OAE1C;GACD,IAAI,QAAQ;AACZ,OAAI,OAAO,QAAQ,SACf,SAAQ,KAAK,MAAM,KAAK;AAE5B,OAAI,MAAM,UAAU,EAChB,OAAM,IAAI,MAAM,oBAAoB;GAExC,MAAM,OAAO,MAAM,KAAK,MAAM;AAC1B,WAAO,OAAO,MAAM;KACtB;AACF,OAAI,KAAK,SAAS,KAAK,CAAC,KAAK,OAAO,MAAM,EAAE,CACxC,SAAQ,CAAC,MAAM;AAEnB,QAAK,MAAM,KAAK,OAAO;IACnB,MAAMC,SAAO,EAAE,KAAK,MAAM;AACtB,YAAO,OAAO,MAAM;MACtB;AACF,QAAIA,OAAK,SAAS,KAAK,CAACA,OAAK,OAAO,MAAM,EAAE,CACxC,OAAM,IAAI,MAAM,0CACZA,SACA,kBAAkB;;GAG9B,MAAM,QAAQ,KAAK,gBAAgB,MAAM;AACzC,QAAK,iBAAiB,MAAM;;;CAGpC,gBAAgB,MAAM;EAClB,MAAM,QAAQ,IAAI,OAAO;AACzB,OAAK,SAAS,WAAW;AACrB,SAAM,KAAK,OAAO,KAAK,MAAM;AACzB,WAAO,KAAK,OAAO,EAAE;KACvB,CAAC;IACL;AACF,SAAO;;CAEX,mBAAmB,OAAO;AACtB,MAAI,QAAQ,EACR,OAAM,IAAI,MAAM,wCAAwC;AAE5D,OAAK,SAAS;AACd,OAAK,YAAY;AACjB,OAAK,QAAQ,KAAK;AAClB,OAAK,WAAW,KAAK;AACrB,OAAK,UAAU,IAAI,WAAW,EAAE,EAAE,MAAM;;CAG5C,iBAAiB,OAAO;AACpB,OAAK,MAAM,UAAU,MACjB,KAAI,OAAO,IAAI,OAAO,CAAC,GAAG,EACtB,OAAM,IAAI,MAAM,0BACZ,QACA,sCAAsC;AAGlD,OAAK,SAAS;AACd,OAAK,YAAY;AACjB,OAAK,QAAQ,MAAM,QAAQ,KAAK,iBAAiB;AAC7C,UAAO,MAAM,aAAa;KAC3B,EAAE;AACL,OAAK,WAAW,KAAK;;CAGzB,OAAO,GAAG;AACN,SAAO,SAAS,EAAE;;CAEtB,iBAAiB,SAAS;AACtB,SAAO,KAAK,QAAQ,KAAK,QAAQ,UAAU,KAAK;;CAEpD,kBAAkB,SAAS;AACvB,MAAI,QAAQ,WAAW,EACnB,QAAO;EAEX,MAAM,UAAU,IAAI,IAAI,QAAQ,MAAM,CAAC;EACvC,MAAM,OAAO,IAAI,MAAM,QAAQ,OAAO,CAAC,KAAK,MAAM;AAClD,OAAK,MAAM,OAAO,QACd,MAAK,OAAO;EAEhB,IAAI,MAAM;AACV,OAAK,MAAM,UAAU,KAAK,OAAO;GAC7B,IAAI,KAAK;AACT,QAAK,MAAM,KAAK,QAAQ;AACpB,QAAI,KAAK,KACL,OAAM,OAAO,EAAE;AAEnB,WAAO;;AAEX,OAAI,KAAK,EACL,QAAO;;AAGf,SAAO;;CAEX,QAAQ,SAAS;AACb,SAAO,KAAK,SAAS,QAAQ;;;;;;ACrLrC,MAAM,cAAc,KAAK,KAAK;AAC9B,SAAgB,OAAO,EAAE,MAAM,QAAW,MAAM,MAAM,QAAW,MAAM,KAAK,KAAK,KAAK,GAAG,QAAQ,QAAW,QAAQ,QAAW,QAAQ,QAAW,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW,OAAO,QAAW,UAAU,QAAW,OAAO,QAAW,SAAS,QAAS;CACjS,MAAM,KAAK,QAAQ,UAAU,MAAM,SAAS,MAAM,EAAE;CACpD,MAAM,OAAO;AACb,KAAI,QAAQ,KAAK,OAAO,QAAQ,KAAK,IACjC,OAAM,IAAI,MAAM,iBAAiB,IAAI,kBAAkB;CAE3D,MAAM,OAAO,IAAI,WAAW,EAAE,EAAE,GAAG;AACnC,KAAI,KAAK,MAAM,EACX,OAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,kBAAkB;CAElE,IAAI;AACJ,KAAI,SAAS,OACT,SAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC;KAG/C,SAAQ;CAEZ,MAAM,UAAU,IAAI,QAAQ,EAAE,MAAM,OAAO,CAAC;AAC5C,KAAI,QAAQ,OAAO,UAAa,QAAQ,MAAM,EAC1C,OAAM,IAAI,MAAM,kBAAkB,QAAQ,IAAI,eAAe;AAEjE,KAAI,QAAQ,OAAO,KAAK,OAEpB,OAAM,IAAI,MAAM,kBAAkB,QAAQ,IAAI,cAAc,OAAO;CAEvE,IAAI;AACJ,KAAI,UAAU,OACV,UAAS,EAAE;KAGX,UAAS;CAEb,IAAI;AACJ,KAAI,UAAU,OACV,UAAS,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,SAAS,EAAE,CAAC;KAGlD,UAAS;CAEb,MAAM,WAAW,IAAI,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAC9C,KAAI,SAAS,OAAO,UAAa,SAAS,MAAM,EAC5C,OAAM,IAAI,MAAM,kBAAkB,SAAS,IAAI,eAAe;AAElE,KAAI,SAAS,OAAO,OAAO,OAEvB,OAAM,IAAI,MAAM,8BAA8B,KAAK,OAAO,yDAAyD,QAAQ,KAAK,cAAc,OAAO;CAEzJ,IAAI;AACJ,KAAI,SAAS,OACT,SAAQ,EAAE;KAGV,SAAQ;CAEZ,MAAM,SAAS,IAAI,IAAI,MAAM;AAC7B,KAAI,OAAO,QAAQ,MAAM,OACrB,OAAM,IAAI,MAAM,kBAAkB,KAAK,mBAAmB;CAE9D,IAAI;AACJ,KAAI,SAAS,OACT,SAAQ,EAAE;KAGV,SAAQ;CAEZ,MAAM,SAAS,IAAI,IAAI,MAAM;AAC7B,KAAI,OAAO,QAAQ,MAAM,OACrB,OAAM,IAAI,MAAM,kBAAkB,KAAK,mBAAmB;CAE9D,IAAI;AACJ,KAAI,SAAS,OACT,SAAQ,EAAE;KAGV,SAAQ;CAEZ,MAAM,SAAS,IAAI,IAAI,MAAM;AAG7B,KADkB,IAAI,IAAI,CAAC,GAAG,OAAO,CAAC,QAAQ,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC,CACrD,OAAO,EACjB,OAAM,IAAI,MAAM,2CAA2C,KAAK,eAAe,KAAK,GAAG;AAI3F,KADkB,IAAI,IAAI,CAAC,GAAG,OAAO,CAAC,QAAQ,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC,CACrD,OAAO,EACjB,OAAM,IAAI,MAAM,2CAA2C,KAAK,eAAe,KAAK,GAAG;CAE3F,MAAM,eAAe,IAAI,IAAI,MAAM;AACnC,OAAM,QAAQ,SAAU,GAAG;AACvB,eAAa,OAAO,EAAE;GACxB;CACF,MAAM,WAAW,IAAI,KAAK,aAAa;AACnC,SAAO;AACP,SAAO;KACP,CAAC;AACL,KAAI,SAAS,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO,KACpD,OAAM,IAAI,MAAM,2CAA2C,KAAK,WAAW,KAAK,eAAe,KAAK,GAAG;CAE3G,IAAI;AACJ,KAAI,SAAS,OACT,KAAI,SAAS,QAAQ,EACjB,SAAQ;KAGR,SAAQ,MAAM,SAAS,KAAK;KAIhC,SAAQ;AAEZ,KAAI,SAAS,OAAO,GAChB;MAAI,QAAQ,KAAK,QAAQ,SAAS,KAC9B,OAAM,IAAI,MAAM,kBAAkB,MAAM,aAAa,OAAO;YAI5D,SAAS,EACT,OAAM,IAAI,MAAM,kBAAkB,MAAM,aAAa,OAAO;CAGpE,MAAM,OAAO;EACT,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG,KAAK;EACR,GAAG;EACH,IAAI,QAAQ,OACR,UACA,QAAQ,QAAQ,UAChB,QAAQ,OAAO,cACb,QAAQ,IAAI,SAAS,GAAG,GACxB,QAAQ;EACd,GAAG;EACH,IAAI,SAAS,OACT,UACA,SAAS,QAAQ,UACjB,SAAS,OAAO,cACd,SAAS,IAAI,SAAS,GAAG,GACzB,SAAS;EACf,GAAG;EACH,IAAI,SAAS,UAAU,UAAU,UAAa,SAAS,cACjD,QACA,MAAM,SAAS,GAAG;EACxB,IAAI;EACJ,IAAI;EACJ,GAAG,QAAQ,SAAY,OAAO,EAAE;EACnC;CACD,MAAM,GAAG,OAAO,OAAO,QAAQ,KAAK;AACpC,QAAO,IAAI,OAAO,IAAI;;AAE1B,SAAgB,MAAM,GAAG,GAAG,OAAO,MAAM;AACrC,KAAI,KAAK,IAAI,GAAG,EAAE;CAClB,IAAI;AACJ,KAAI,KAAK,QAAW;AAChB,OAAK,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;EACpD,MAAM,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;AACzD,MAAI,KAEA,QAAO,KAAK,IAAI,GAAG,KAAK,MAAM,IAAI,KAAK,KAAK,EAAE,EAAE,KAAK,MAAM,IAAI,KAAK,KAAK,EAAE,CAAC;MAG5E,QAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;QAGvE;AACD,MAAI,KAAK,IAAI,GAAG,EAAE;EAClB,MAAM,KAAK,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;EACrC,MAAM,KAAK,KAAK,IAAI,GAAG,IAAI,EAAE;AAC7B,MAAI,KAAK,MAAM,IAAI,EACf,OAAM,IAAI,MAAM,aAAa,EAAE,oBAAoB,EAAE,GAAG;AAE5D,MAAI,KACA,QAAO,KAAK,IAAI,GAAG,IAAI,GAAG;MAG1B,QAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC;;;AAIhD,SAAgB,OAAO,EAAE,MAAM,OAAO,OAAO,OAAO,MAAM,MAAM,MAAM,MAAM,UAAU,UAAU,OAAO,QAAQ,MAAM,MAAM,SAAS,OAAO,UAAW;CAClJ,MAAM,KAAK,QAAQ,UAAU,MAAM,SAAS,MAAM,EAAE;CACpD,MAAM,MAAM,UAAU,SAAY,KAAK,MAAM,KAAK;CAClD,MAAM,OAAO,IAAI,WAAW,EAAE,EAAE,EAAE;AAClC,KAAI,SAAS,OACT,SAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC;CAEnD,MAAM,UAAU,IAAI,QAAQ,EAAE,MAAM,OAAO,CAAC;AAC5C,KAAI,QAAQ,OAAO,UAAa,QAAQ,MAAM,EAC1C,OAAM,IAAI,MAAM,kBAAkB,QAAQ,IAAI,eAAe;AAEjE,KAAI,QAAQ,OAAO,KAAK,OACpB,OAAM,IAAI,MAAM,kBAAkB,QAAQ,IAAI,YAAY,OAAO;AAErE,KAAI,SAAS,OACT,SAAQ,IAAI,OAAO;AAEvB,KAAI,SAAS,OACT,SAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM,SAAS,EAAE,CAAC;CAEpD,MAAM,WAAW,IAAI,QAAQ,EAAE,MAAM,OAAO,CAAC;AAC7C,KAAI,SAAS,OAAO,UAAa,SAAS,MAAM,EAC5C,OAAM,IAAI,MAAM,mBAAmB,SAAS,IAAI,eAAe;AAEnE,KAAI,SAAS,OAAO,KAAK,OACrB,OAAM,IAAI,MAAM,mBAAmB,SAAS,IAAI,YAAY,QAAQ;AAExE,QAAO,QAAQ,SAAY,EAAE,GAAG;AAChC,KAAI,IAAI,IAAI,KAAK,CAAC,QAAQ,KAAK,OAC3B,OAAM,IAAI,MAAM,kBAAkB,KAAK,mBAAmB;AAE9D,KAAI,QAAQ,OACR,KAAI,KAAK,UAAU,EACf,QAAO;KAGP,QAAO,MAAM,KAAK,OAAO;CAGjC,MAAM,SAAS,IAAI,WAAW,EAAE,EAAE,KAAK;AACvC,KAAI,KAAK,SAAS,GACd;MAAI,OAAO,MAAM,KAAK,OAAO,MAAM,KAAK,OACpC,OAAM,IAAI,MAAM,kBAAkB,OAAO,IAAI,cAAc,OAAO;YAIlE,OAAO,OAAO,EACd,OAAM,IAAI,MAAM,kBAAkB,OAAO,IAAI,cAAc,OAAO;AAG1E,QAAO,QAAQ,SAAY,IAAI,OAAO,GAAG;AACzC,QAAO,QAAQ,SAAY,IAAI,OAAO,GAAG;CACzC,IAAI,MAAM;EACN,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG,KAAK;EACR,IAAI,UAAU,QAAQ,OAAO,SAAY,QAAQ,MAAM,QAAQ;EAC/D,GAAG;EACH,IAAI,UAAU,QAAQ,OAAO,SAAY,SAAS,MAAM,SAAS;EACjE,GAAG;EACH,IAAI,SAAS,OAAO,MAAM,OAAO;EACjC,GAAG;EACH,GAAG;EACH,GAAG;EACN;AACD,KAAI,UAAU,QAAW;AACrB,MAAI,QAAQ;AACZ,MAAI,QAAQ,OACR,QAAO,OAAO;;CAGtB,IAAI;AACJ,KAAI,UAAU,UAAa,QAAQ,UAAa,KAAK,UAAU,GAAG;AAC9D,aAAW,IAAI,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;AAC1C,MAAI,SAAS,UACT,OAAM,IAAI,MAAM,2BAA2B,SAAS,KAAK,6BAA6B;QAGzF;AACD,aAAW,IAAI,SAAS,EAAQ,MAAM,EAAE,IAAI;AAC5C,MAAI,UAAU,QACV;OAAI,CAAC,SAAS,UACV,OAAM,IAAI,MAAM,6BAA6B,SAAS,KAAK,oCAAoC;;;AAI3G,KAAI,OAAO,SAAS;AACpB,KAAI,SAAS,UACT,KAAI,OAAO,SAAS;KAGpB,IAAG,OAAO,OAAO,QAAQ,IAAI;AAEjC,QAAO,IAAI,OAAO,IAAI;;AAE1B,SAAgB,UAAU,QAAQ,QAAQ,MAAM,QAAQ,QAAQ,YAAY,OAAO;CAC/E,IAAI,MAAM,IAAI,WAAW,EAAE,OAAO,IAAI,CAAC;CACvC,IAAI,MAAM,IAAI,YAAY;AAC1B,KAAI,UAAU,UAAa,UAAU,UAAa,UAAU,OACxD,OAAM,IAAI,MAAM,4CAA4C,OAAO,IAAI,GAAG;AAE9E,KAAI,UAAU,QAAW;AACrB,MAAI,QAAQ,QACR;OAAI,KAAK,MAAM,aAAa;AACxB,UAAM,OAAO,KAAK,IAAI,QAAQ;KAAE,MAAM,OAAO;KAAmB,OAAO;KAAG,CAAC,CACtE,MAAM;AACX,UAAM,OAAO,KAAK,IAAI,aAAa,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC;AACtD,UAAM,OAAO,KAAK,IAAI,OAAO,EAAE,IAAI,SAAS,KAAK,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM;AAChE,UAAM,OAAO,KAAK,IAAI,aAAa,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC;cAEjD,KAAK,MAAM,YAAY;AAC5B,UAAM,OAAO,KAAK,IAAI,QAAQ;KAC1B,MAAM,OAAO;KACb,OAAO;KACV,CAAC,CAAC,MAAM;AACT,UAAM,OAAO,KAAK,IAAI,aAAa,CAAC,OAAO,KAAK,GAAG,EAAE,CAAC;;;AAG9D,QAAM,OAAO,KAAK,IAAI,QAAQ;GAC1B,MAAM,OAAO;GACb,OAAO,OAAO;GACjB,CAAC,CAAC,MAAM;AACT,SAAO,SAAS,UAAU;AACtB,SAAM,OAAO,KAAK,MAAM,MAAM;IAChC;;AAEN,KAAI,UAAU,QAAW;AACrB,QAAM,OAAO,KAAK,IAAI,QAAQ;GAC1B,MAAM,OAAO;GACb,OAAO,OAAO;GACjB,CAAC,CAAC,MAAM;AACT,SAAO,SAAS,UAAU;AACtB,OAAI,MAAM,UAAU,EAAE,MAAM,OAAO,QAAQ,aACvC,OAAM,IAAI,MAAM,qCAAqC,MAAM,OAAO,KAAK,eAAe;AAE1F,SAAM,OAAO,KAAK,MAAM,MAAM;IAChC;;AAEN,KAAI,UAAU,QAAW;AACrB,QAAM,OAAO,KAAK,IAAI,QAAQ;GAC1B,MAAM,OAAO;GACb,OAAO,OAAO;GACjB,CAAC,CAAC,MAAM;AACT,SAAO,SAAS,UAAU;AACtB,OAAI,MAAM,UAAU,EAAE,MAAM,OAAO,QAAQ,aACvC,OAAM,IAAI,MAAM,qCAAqC,MAAM,OAAO,KAAK,eAAe;AAE1F,SAAM,OAAO,KAAK,MAAM,MAAM;IAChC;;AAEN,KAAI,WAAW;AACX,MAAI,IAAI,SAAS,KAAK,EAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,OAAO,yBAAyB;AAEpF,QAAM,OAAO,KAAK,IAAI,QAAQ;GAC1B,MAAM,OAAO;GACb,OAAO,KAAK,MAAM,IAAI,SAAS,EAAE;GACpC,CAAC,CAAC,MAAM;;AAEb,OAAM,OAAO,KAAK,IAAI;AACtB,QAAO;;AAEX,SAAgB,SAAS,MAAM;CAC3B,IAAI,EAAE,KAAK,KAAK,IAAI,MAAM,SAAS,SAAS;CAC5C,MAAM,KAAK,QAAQ,UAAU,MAAM,SAAS,MAAM,EAAE;CACpD,MAAM,MAAM,KAAK;CACjB,MAAM,OAAO,IAAI,WAAW,EAAE,EAAE,GAAG;AACnC,KAAI,KAAK,MAAM,EACX,OAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,WAAW;AAE3D,QAAO,QAAQ,SAAY,IAAI,OAAO,GAAG;CACzC,IAAI,MAAM;EACN,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG,KAAK;EACR,GAAG;EACH,GAAG;EACN;AACD,IAAG,OAAO,OAAO,QAAQ,IAAI;AAC7B,QAAO,IAAI,OAAO,IAAI;;AAE1B,SAAgB,MAAM,QAAQ,IAAI,MAAM,OAAO,SAAS,OAAO,QAAQ,MAAM;CACzE,MAAM,KAAK,QAAQ,UAAU,MAAM,SAAS,MAAM,EAAE;AACpD,KAAI,QAAQ,OACR,QAAO,EAAE;CAEb,MAAM,OAAO;EACT,GAAG;EACH,GAAG,KAAK;EACR,GAAG;EACH,IAAI,UAAU,QAAQ,UAAU,KAAK,IAAI,yBAAQ,IAAI,MAAM,EAAC,aAAa,CAAC,QAAQ,KAAK,YAAY;EACnG,GAAG;EACH,GAAG;EACN;CACD,MAAM,GAAG,OAAO,OAAO,QAAQ,KAAK;CACpC,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,IAAI,MAAM,CAAC;AAC7C,KAAI,CAAC,OAAO,OAAO,KAAK,MAAM,MAAM,MAAM,IAAI,CAC1C,OAAM,IAAI,MAAM,kBAAkB,OAAO,KAAK,iBAAiB,IAAI,GAAG;AAC1E,QAAO,IAAI,OAAO,IAAI;;;;;ACpY1B,IAAa,aAAb,MAAwB;CACpB,cAAc;AACV,OAAK,UAAU;AACf,OAAK,gBAAgB;AACrB,OAAK,YAAY;;;AAGzB,MAAa,WAAW,IAAI,YAAY;AACxC,IAAa,MAAb,MAAiB;CACb,YAAY,SAAM,KAAK;AACnB,OAAK,OAAOC;AACZ,OAAK,SAAS;;CAElB,IAAI,MAAM;AACN,SAAO,KAAK,OAAO,IAAI;;;AAG/B,IAAa,SAAb,MAAoB;CAChB,YAAY,EAAE,eAAM,UAAU,MAAM,MAAM,MAAM,QAAQ;AACpD,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,QAAQA;AACb,MAAI,YAAY,UAAa,QAAQ,QAAW;AAC5C,OAAI,SAAS,SAAS,GAClB,OAAM,IAAI,MAAM,2CAA2C;GAG/D,MAAM,SAAS,IAAI,OAAO,EAAE,MADf,OAAO,WAAW,MAAM,SAAS,UAAU,GAAG,GAAG,EACtB,CAAC,CAAC,OAAO,OAAO,cAAc,MAAM;AAC5E,UAAO,OAAO;AACd,OAAI,QAAQ,OACR,QAAO,OAAO,OAAO;;EAG7B,IAAI;EACJ,MAAM,SAAS,QAAQ,SAAY,IAAI,OAAO,EAAE,MAAM,MAAM,CAAC,GAAG;AAChE,MAAI,QAAQ,OACR,QAAO,MAAM;MAGb,QAAO,MAAM;AAEjB,OAAK,OAAO,IAAI,QAAQ;GACd;GACA;GACA;GACA;GACE;GACX,CAAC;;CAEN,IAAI,MAAM;AACN,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,MAAM,KAAK,KAAK,MAAM,QAAQ,CAAC;;CAE1C,UAAU,SAAM;AACZ,SAAO,KAAK,MAAM,IAAIA,QAAK;;CAE/B,QAAQ,SAAM,EAAE,OAAO,OAAO,YAAY,eAAe,MAAM,QAAQ,QAAW,SAAS,GAAG,QAAQ,QAAW,SAAS,QAAW,OAAO,QAAW,OAAO,QAAW,SAAS,QAAW,UAAU,OAAO,MAAM,OAAO,OAAO,UAAc;AAC5O,MAAI,SAAS,OACT,SAAQ;AAEZ,MAAI,UAAU,OACV,UAAS;AAEb,MAAI,CAAC,cAAc;AACf,YAAS;AACT,WAAQ;AACR,UAAO,OAAO;;EAElB,MAAM,CAAC,SAAS,UAAU,KAAK,KAAK,OAAO;GAC/B;GACA;GACR,MAAM,KAAK;GACG;GACd,MAAM;GACT,CAAC;AACF,WAAS,QAAQ;AACjB,WAAS,UAAU,SAAY,OAAO,SAAS;AAC/C,MAAI,SAAS,OACT,SAAQ,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG;AAE9D,MAAI,SAAS,OACT,SAAQ,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG;EAE9D,MAAM,OAAO,IAAI,OAAO;AACxB,MAAI,QACA,MAAK,KAAK,SAAS,QAAQ;AAE/B,MAAI,IACA,MAAK,KAAK,SAAS,cAAc;EAErC,MAAM,OAAO,MAAM,KAAK,UAAU,WAAW,OAAO,KAAK;EACzD,MAAM,QAAQ,MAAM,KAAK,SAAS,UAAU,MAAM,KAAK;EAavD,MAAM,MAAM,IAAI,IAAIA,SAZR,OAAO;GACf;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACH,CAAC,CAC4B;AAC9B,OAAK,MAAM,IAAIA,SAAM,IAAI;AACzB,SAAO;;CAEX,IAAI,OAAO;AACP,SAAO,KAAK;;;;;;;;;;AChGpB,IAAa,QAAb,MAAmB;CACf,YAAY,OAAO;AACf,OAAK,MAAM;AACX,OAAK,SAAS;AACd,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,KAAK;AACV,OAAK,OAAO;AACZ,OAAK,MAAM,MAAM;;CAErB,MAAM,OAAO;EACT,MAAM,CAAC,OAAO,UAAU,KAAK,MAAM,MAAM;AACzC,OAAK,KAAK,IAAI,WAAW,EAAE,EAAE,QAAW,MAAM,KAAK,CAAC;AACpD,OAAK,OAAO,MAAM;AAClB,MAAI,MAAM,UAAU,KAAK,IACrB,OAAM,IAAI,MAAM,gCAAgC,MAAM,QAAQ;AAElE,OAAK,MAAM,MAAM;AACjB,MAAI,CAAC,MAAM,MACP,OAAM,IAAI,MAAM,8BAA8B;AAElD,OAAK,SAAS,MAAM;AACpB,OAAK,SAAS;AACd,OAAK,QAAQ;;CAEjB,MAAM,KAAK;AACP,MAAI,IAAI,KAAK,WAAW,EACpB,OAAM,IAAI,MAAM,8CAA8C;EAElE,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC;AAChD,MAAI,IAAI,KAAK,WAAW,EACpB,OAAM,IAAI,MAAM,mDAAmD;EAEvE,MAAM,QAAQ,IAAI,MAAM,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC;EAC9C,MAAM,UAAU,IAAI,QAAQ,EAAE,MAAM,IAAI,OAAO,CAAC;AAChD,MAAI,QAAQ,QAAQ,EAChB,OAAM,IAAI,MAAM,qBAAqB,QAAQ,IAAI,aAAa;EAElE,MAAM,WAAW,IAAI,QAAQ,EAAE,MAAM,IAAI,OAAO,CAAC;AACjD,MAAI,SAAS,QAAQ,EACjB,OAAM,IAAI,MAAM,0BAA0B,SAAS,IAAI,aAAa;AAExE,SAAO;GAAC;GAAK;GAAQ;GAAM;;;;;;;AAOnC,IAAa,aAAb,MAAwB;;;;;;;;;;;;CAYpB,YAAY,MAAM,MAAM,OAAO,GAAG,QAAQ,MAAM;AAC5C,OAAK,OAAO,OAAO,WAAW,MAAM,KAAK,UAAU,GAAG,GAAG;AACzD,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;EACZ,MAAM,QAAQ;EACd,MAAM,WAAW;EACjB,MAAM,eAAe;EACrB,MAAM,OAAO,OAAO;EACpB,MAAM,OAAO;EACb,MAAM,OAAO;AAEb,OAAK,SAAS,IAAI,OAAO;GAAE,MAAM,KAAK;GAAM,MAAM,KAAK;GAAM,CAAC;EAC9D,MAAM,UAAU,IAAI,aAAa,KAAK,OAAO,MAAM,KAAK,MAAM,KAAK,KAAK;EAGxE,MAAM,kBAAkB;AACxB,OAAK,SAAS,QACT,OAAO,OAAO,UAAU,MAAM,cAAc,MAAM,iBAAiB,KAAK,CACxE,QAAQ,KAAK;EAElB,MAAM,eAAe,OAAO;AAC5B,OAAK,UAAU,QACV,OAAO,OAAO,UAAU,MAAM,cAAc,MAAM,cAAc,KAAK,CACrE,QAAQ,KAAK;AAClB,OAAK,OAAO,CAAC,KAAK,OAAO,OAAO,KAAK;AACrC,OAAK,QAAQ,CACT,IAAI,MAAM,EAAE,MAAM,OAAO,YAAY,EAAE,KAAK,QAAQ,OAAO,MAAM,CAC5D,KACR;AACD,MAAI,SAAS,QAAQ,MAAM,MAAM,QAAQ,EACrC,MAAK,SAAS,OAAO;GACjB,MAAM,KAAK;GACX,OAAO;GACP,OAAO;GACP,OAAO,KAAK;GACZ,MAAM,OAAO;GACb,MAAM;GACN,MAAM,EAAE;GACX,CAAC;MAGF,MAAK,SAAS,IAAI,OAAO,MAAM,MAAM;;CAG7C,kBAAkB,QAAQ;EACtB,MAAM,SAAS,IAAI,OAAO,EAAE,IAAI,OAAO,IAAI,CAAC;EAC5C,MAAM,SAAS;GAAE,GAAG,OAAO;GAAK,GAAG,OAAO;GAAK,GAAG,OAAO;GAAM;EAC/D,MAAM,KAAK,IAAI,WAAW,EAAE,EAAE,QAAW,KAAK,OAAO,IAAI,KAAK,CAAC,MAAM;AACrE,OAAK,SAAS,SAAS;GACnB,KAAK,KAAK,OAAO;GACjB,KAAK,KAAK,OAAO,IAAI;GACjB;GACJ,MAAM,CAAC,OAAO;GACd,SAAS;GACT,MAAM,QAAQ;GACjB,CAAC;AACF,SAAO,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,KAAK,EAAE,CAAC,KAAK;;CAEtD,IAAI,MAAM;AACN,SAAO,KAAK,OAAO;;CAEvB,IAAI,QAAQ;EACR,MAAM,QAAQ,KAAK,OAAO,KAAK,KAAK,OAAO,KAAK,EAAE;AAClD,SAAO,CAAC,KAAK,QAAQ,MAAM;;CAE/B,IAAI,UAAU;AACV,SAAO,KAAK,OAAO,QAAQ;;CAE/B,OAAO,OAAO;AACV,MAAI,SAAS,UAAa,MAAM,MAAM,SAAS,IAC3C,QAAO,OAAO;GACV,MAAM,KAAK;GACX,OAAO;GACP,OAAO;GACP,OAAO,KAAK;GACZ,MAAM,OAAO;GACb,MAAM;GACN,MAAM,EAAE;GACX,CAAC;MAGF,QAAO,IAAI,OAAO,EAAE,KAAK,MAAM,WAAW,OAAO,CAAC;;CAG1D,OAAO,MAAM,MAAM;EAEf,MAAM,UAAU,IAAI,OAAO;GAAE,MADf,OAAO,WAAW,MAAM,KAAK,UAAU,GAAG,GAAG;GACjB,MAAM,KAAK;GAAM,CAAC;EAC5D,MAAM,UAAU,KAAK,OAAO,OAAO,QAAW,MAAM;EAEpD,MAAM,SADU,IAAI,aAAa,KAAK,OAAO,MAAM,KAAK,MAAM,KAAK,KAAK,CAEnE,OAAO,QAAW,GAAG,OAAO,cAAc,MAAM,GAAG,KAAK,OAAO,GAAG,GAAG,MAAM,CAC3E,QAAQ,KAAK;EAClB,MAAM,WAAW,IAAI,aAAa,QAAQ,MAAM,KAAK,MAAM,KAAK,KAAK;AACrE,OAAK,SAAS,SACT,OAAO,QAAW,GAAG,OAAO,cAAc,MAAM,GAAG,KAAK,MAAM,GAAG,MAAM,CACvE,QAAQ,KAAK;AAClB,OAAK,UAAU,SACV,OAAO,QAAW,GAAG,OAAO,cAAc,MAAM,GAAG,KAAK,OAAO,GAAG,GAAG,MAAM,CAC3E,QAAQ,KAAK;AAClB,OAAK,OAAO,CAAC,KAAK,OAAO,OAAO,MAAM,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,OAAO,KAAK;AACzG,OAAK,QAAQ,CAAC,IAAI,MAAM,EAAE,EAAE,KAAK,QAAQ,OAAO,MAAM,CAAC,KAAK;EAC5D,MAAM,MAAM,OAAO;GACf,KAAK,KAAK;GACV,MAAM,KAAK;GACX,KAAK,KAAK,OAAO,IAAI;GACrB,OAAO,CAAC,KAAK,IAAI;GACjB,OAAO;GACP,OAAO,KAAK;GACf,CAAC;EACF,MAAM,OAAO,CACT,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK,EAAE,IAAI,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC,MACrF,KAAK,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC,KAChC;EACD,MAAM,YAAY,IAAI,UAAU,EAAE,EAAE,EAAE,QAAQ,OAAO,KAAK,CAAC;EAC3D,MAAM,YAAY,IAAI,UAAU,EAAE,EAAE,QAAQ,MAAM;EAClD,MAAM,OAAO,UAAU,QAAQ,EAAE,KAAK,KAAK,CAAC,CAAC;EAC7C,MAAM,OAAO,EAAE;AACf,OAAK,MAAM,OAAO,MAAM;GACpB,MAAM,MAAM,IAAI;AAChB,OAAI,WAAW,KAAK;IAChB,MAAM,QAAQ,IAAI;IAClB,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,MAAM,SAAS,CAAC;IAClD,MAAM,OAAO,UAAU,QAAQ,MAAM,OAAO,CAAC;IAG7C,MAAM,UADW,IAAI,aAAa,MAAM,MAAM,SAAS,MAAM,QAAQ,CAC5C,OAAO,MAAM,WAAW,QAAW,OAAO,cAAc,MAAM,iBAAiB,MAAM,SAAS,GAAG,MAAM,SAAS,MAAM;IAC/I,MAAM,WAAW,EAAE;AACnB,SAAK,MAAMC,YAAU,QAAQ,QACzB,UAAS,KAAKA,SAAO,OAAO,KAAK;AAGrC,QADa,IAAI,SAAS,KACjB,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CACpC,OAAM,IAAI,MAAM,oBAAoB;AAGxC,SAAK,OAAO,EACR,MAFU,UAAU,QAAQ,EAAE,KAAK,CAAC,CAAC,MAGxC;cAEI,WAAW,KAAK;IACrB,MAAM,QAAQ,IAAI;IAClB,MAAM,OAAO,MAAM;IACnB,MAAM,OAAO,MAAM;IACnB,MAAM,QAAQ,EAAE;IAChB,MAAM,UAAU,EAAE;AAClB,SAAK,MAAM,OAAO,MAAM;KACpB,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC;KACxC,MAAM,UAAU,UAAU,QAAQ,MAAM,QAAQ,KAAK;AACrD,aAAQ,KAAK,QAAQ;AACrB,WAAM,KAAK,UAAU,QAAQ,EAAE,QAAQ,KAAK,CAAC,CAAC,KAAK;;IAEvD,MAAM,OAAO,IAAI,SAAS;IAC1B,MAAM,WAAW,EAAE;AACnB,SAAK,MAAMA,YAAU,QACjB,UAAS,KAAKA,SAAO,OAAO,KAAK;AAErC,QAAI,KAAK,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CACpC,OAAM,IAAI,MAAM,yDAAyD,KAAK,SAAS;IAE3F,MAAM,QAAQ,EAAE;AAChB,SAAK,MAAM,OAAO,KACd,OAAM,KAAK,KAAK,QAAQ,KAAK,WAAW,UAAU,CAAC;AAEvD,SAAK,OAAO;KACR,MAAM;KACN,MAAM;KACT;SAGD,OAAM,IAAI,MAAM,oBAAoB;;AAS5C,SANa;GACT,KAAK,IAAI;GACH;GACA;GACA;GACT;;CAGL,QAAQ,KAAK,WAAW,WAAW;EAC/B,MAAM,SAAS,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC;EACxC,MAAM,OAAO,UAAU,QAAQ,MAAM,OAAO,CAAC;AAC7C,SAAO,UAAU,QAAQ,EAAE,KAAK,CAAC,CAAC;;;;;;;ACtQ1C,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,eAAe,KAAK;CAC5B,IAAM,eAAN,MAAmB;EACf,YAAY,aAAa;AACrB,QAAK,cAAc;;EAEvB,WAAW;AACP,UAAO,KAAK;;;AAGpB,SAAQ,eAAe;;;;;;ACVvB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,iBAAiB,QAAQ,cAAc,QAAQ,gBAAgB,QAAQ,kBAAkB,QAAQ,UAAU,KAAK;CACxH,MAAM,UAAU;CAChB,MAAM,UAAU;CAChB,MAAM,QAAQ;CACd,SAAS,QAAQ,KAAK;AAClB,SAAO,QAAQ,KAAK,IAAI;;AAE5B,SAAQ,UAAU;CAClB,SAAS,gBAAgB,KAAK;AAC1B,SAAO,QAAQ,KAAK,IAAI;;AAE5B,SAAQ,kBAAkB;CAC1B,SAAS,cAAc,KAAK;AACxB,SAAO,MAAM,KAAK,IAAI;;AAE1B,SAAQ,gBAAgB;CACxB,SAAS,YAAY,OAAO;AACxB,SAAO,MAAM,QAAQ,MAAM,GAAG;;AAElC,SAAQ,cAAc;CACtB,SAAS,eAAe,OAAO;AAC3B,SAAO,OAAO,UAAU,YAAY,iBAAiB;;AAEzD,SAAQ,iBAAiB;;;;;;ACxBzB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,QAAQ,KAAK;CACrB,MAAM;CACN,IAAM,QAAN,MAAY;EACR,YAAY,OAAO;AACf,OAAI,EAAE,GAAG,OAAO,iBAAiB,MAAM,CACnC,OAAM,IAAI,UAAU,gJAAiJ;AAEzK,QAAK,QAAQ;;EAEjB,WAAW;AACP,UAAO,KAAK;;;AAGpB,SAAQ,QAAQ;;;;;;ACdhB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,eAAe,QAAQ,sBAAsB,QAAQ,iBAAiB,QAAQ,wBAAwB,QAAQ,mBAAmB,QAAQ,kBAAkB,QAAQ,mBAAmB,QAAQ,mBAAmB,QAAQ,oBAAoB,QAAQ,qBAAqB,QAAQ,gBAAgB,QAAQ,sBAAsB,QAAQ,gBAAgB,QAAQ,iBAAiB,KAAK;CAC9X,MAAM;CACN,MAAM;CACN,MAAM;CACN,IAAM,iBAAN,cAA6B,MAAM;AAEnC,SAAQ,iBAAiB;CACzB,SAAS,cAAc,OAAO;AAC1B,SAAO,MAAM,KAAI,UAAS;AACtB,QAAK,GAAG,OAAO,aAAa,MAAM,CAC9B,QAAO,mBAAmB,MAAM;OAGhC,QAAO,cAAc,MAAM;IAEjC,CAAC,KAAK,KAAK;;AAEjB,SAAQ,gBAAgB;CACxB,SAAS,oBAAoB,OAAO;AAChC,SAAO,MAAM,KAAK,MAAM,SAAS,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW;GACrD,IAAI,MAAM,aAAa,IAAI;AAC3B,OAAI,MAAM,OAAO,KACb,QAAO,oBAAoB,MAAM,GAAG;QAEnC;AACD,WAAO;AACP,SAAK,GAAG,OAAO,aAAa,MAAM,CAC9B,QAAO,mBAAmB,MAAM;QAGhC,QAAO,cAAc,MAAM;;AAGnC,UAAO;IACT,CAAC,KAAK,KAAK;;AAEjB,SAAQ,sBAAsB;CAC9B,SAAS,cAAc,OAAO;AAC1B,SAAO,kBAAkB,MAAM,GAAG,GAAG,oBAAoB,MAAM,GAAG;;AAEtE,SAAQ,gBAAgB;CACxB,SAAS,mBAAmB,OAAO;AAC/B,SAAO,IAAI,MAAM,GAAG,KAAI,UAAS,cAAc,MAAM,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,oBAAoB,MAAM,GAAG;;AAErG,SAAQ,qBAAqB;CAC7B,SAAS,kBAAkB,OAAO;AAC9B,MAAI,OAAO,UAAU,UAAU;AAC3B,OAAI,OAAO,UAAU,MAAM,CACvB,QAAO,iBAAiB,MAAM;AAElC,UAAO,iBAAiB,MAAM;;AAElC,MAAI,OAAO,UAAU,SACjB,QAAO,gBAAgB,MAAM;AAEjC,MAAI,iBAAiB,QAAQ,MACzB,QAAO,eAAe,MAAM;AAEhC,MAAI,iBAAiB,QAAQ,aACzB,QAAO,sBAAsB,MAAM;AAEvC,MAAI,OAAO,UAAU,UACjB,QAAO,iBAAiB,MAAM;AAElC,QAAM,IAAI,eAAe,mCAAmC,OAAO,QAAQ;;AAE/E,SAAQ,oBAAoB;CAC5B,SAAS,iBAAiB,OAAO;AAC7B,MAAI,QAAQ,oBAAoB,QAAQ,gBACpC,OAAM,IAAI,eAAe,0HAA0H;AAEvJ,SAAO,MAAM,UAAU;;AAE3B,SAAQ,mBAAmB;CAC3B,SAAS,iBAAiB,OAAO;EAC7B,MAAM,MAAM,MAAM,QAAQ,EAAE,CAAC,QAAQ,OAAO,GAAG;AAE/C,MADwB,IAAI,MAAM,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,CAAC,SACrC,GAClB,OAAM,IAAI,eAAe,sGAAsG;AAEnI,SAAO;;AAEX,SAAQ,mBAAmB;CAC3B,SAAS,gBAAgB,OAAO;AAC5B,MAAI,EAAE,GAAG,OAAO,SAAS,MAAM,CAC3B,OAAM,IAAI,eAAe,uCAAuC;AAEpE,SAAO,IAAI,MAAM,QAAQ,YAAY,MAAM,OAAO,EAAE,CAAC;;AAEzD,SAAQ,kBAAkB;CAC1B,SAAS,iBAAiB,OAAO;AAC7B,SAAO,QAAQ,OAAO;;AAE1B,SAAQ,mBAAmB;CAC3B,SAAS,sBAAsB,OAAO;AAClC,SAAO,IAAI,MAAM,UAAU,CAAC;;AAEhC,SAAQ,wBAAwB;CAChC,SAAS,eAAe,OAAO;AAC3B,SAAO,MAAM,UAAU;;AAE3B,SAAQ,iBAAiB;CACzB,SAAS,oBAAoB,OAAO;AAChC,SAAO,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,KAAK,WAAW;GAC3C,IAAI,MAAM,MAAM,aAAa,IAAI;AACjC,OAAI,UAAU,KACV,QAAO,MAAM,kBAAkB,MAAM;AAEzC,UAAO;IACT,CAAC,KAAK,GAAG;;AAEf,SAAQ,sBAAsB;CAC9B,SAAS,aAAa,OAAO;AACzB,MAAI,EAAE,GAAG,OAAO,eAAe,MAAM,CACjC,OAAM,IAAI,eAAe,2GAA2G;AAExI,SAAO;;AAEX,SAAQ,eAAe;;;;;;ACvHvB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,aAAa,QAAQ,YAAY,QAAQ,YAAY,QAAQ,kBAAkB,KAAK;CAC5F,MAAM;CACN,MAAM;CACN,MAAM;CACN,SAAS,gBAAgB,OAAO;AAE5B,SADe,IAAI,OAAO,MAAM,CAClB,iBAAiB;;AAEnC,SAAQ,kBAAkB;CAC1B,SAAS,UAAU,OAAO;AAEtB,SADe,IAAI,OAAO,MAAM,CAClB,WAAW;;AAE7B,SAAQ,YAAY;CACpB,SAAS,UAAU,OAAO;AAEtB,SADe,IAAI,OAAO,MAAM,CAClB,WAAW;;AAE7B,SAAQ,YAAY;CACpB,IAAM,aAAN,cAAyB,MAAM;EAC3B,YAAY,UAAU,SAAS;AAC3B,SAAM,gBAAgB,QAAQ,aAAa,WAAW;;;AAG9D,SAAQ,aAAa;CACrB,IAAM,SAAN,MAAa;EACT,YAAY,OAAO;AACf,QAAK,QAAQ;AACb,QAAK,MAAM;;EAEf,kBAAkB;AACd,QAAK,QAAQ;GACb,MAAM,6BAAa,IAAI,KAAK;AAC5B,UAAO,CAAC,KAAK,KAAK,EAAE;IAChB,MAAM,UAAU,KAAK,UAAU;IAC/B,IAAI;AACJ,QAAI,KAAK,UAAU,KAAK,KAAK;AACzB,UAAK;AACL,cAAS,KAAK,sBAAsB;UAGpC,UAAS,CAAC,MAAM,KAAK,iBAAiB,CAAC;AAE3C,eAAW,IAAI,SAAS,OAAO;AAC/B,SAAK,SAAS;AACd,QAAI,KAAK,KAAK,CACV,QAAO;AAEX,SAAK,WAAW,IAAI;AACpB,SAAK;AACL,SAAK,SAAS;AACd,QAAI,KAAK,KAAK,CACV,OAAM,IAAI,WAAW,KAAK,KAAK,wCAAwC;;AAG/E,UAAO;;EAEX,YAAY;AACR,QAAK,QAAQ;GACb,MAAM,UAAU,EAAE;AAClB,UAAO,CAAC,KAAK,KAAK,EAAE;AAChB,YAAQ,KAAK,KAAK,sBAAsB,CAAC;AACzC,SAAK,SAAS;AACd,QAAI,KAAK,KAAK,CACV,QAAO;AAEX,SAAK,WAAW,IAAI;AACpB,SAAK;AACL,SAAK,SAAS;AACd,QAAI,KAAK,KAAK,CACV,OAAM,IAAI,WAAW,KAAK,KAAK,2CAA2C;;AAGlF,UAAO;;EAEX,UAAU,iBAAiB,MAAM;AAC7B,OAAI,eACA,MAAK,QAAQ;GACjB,MAAM,SAAS,CACX,KAAK,eAAe,EACpB,KAAK,iBAAiB,CACzB;AACD,OAAI,eACA,MAAK,YAAY;AACrB,UAAO;;EAEX,uBAAuB;AACnB,OAAI,KAAK,UAAU,KAAK,IACpB,QAAO,KAAK,gBAAgB;OAG5B,QAAO,KAAK,UAAU,MAAM;;EAGpC,iBAAiB;AACb,QAAK,WAAW,IAAI;AACpB,QAAK;GACL,MAAM,YAAY,EAAE;AACpB,UAAO,CAAC,KAAK,KAAK,EAAE;AAChB,SAAK,QAAQ;AACb,QAAI,KAAK,UAAU,KAAK,KAAK;AACzB,UAAK;AACL,YAAO,CACH,WACA,KAAK,iBAAiB,CACzB;;AAEL,cAAU,KAAK,KAAK,UAAU,MAAM,CAAC;IACrC,MAAM,WAAW,KAAK,UAAU;AAChC,QAAI,aAAa,OAAO,aAAa,IACjC,OAAM,IAAI,WAAW,KAAK,KAAK,+DAA+D;;AAGtG,SAAM,IAAI,WAAW,KAAK,KAAK,mCAAmC;;EAEtE,gBAAgB;GACZ,MAAM,OAAO,KAAK,UAAU;AAC5B,OAAI,KAAK,MAAM,UAAU,CACrB,QAAO,KAAK,uBAAuB;AAEvC,OAAI,SAAS,KACT,QAAO,KAAK,aAAa;AAE7B,OAAI,KAAK,MAAM,aAAa,CACxB,QAAO,KAAK,YAAY;AAE5B,OAAI,SAAS,IACT,QAAO,KAAK,mBAAmB;AAEnC,OAAI,SAAS,IACT,QAAO,KAAK,cAAc;AAE9B,SAAM,IAAI,WAAW,KAAK,KAAK,mBAAmB;;EAEtD,kBAAkB;GACd,MAAM,6BAAa,IAAI,KAAK;AAC5B,UAAO,CAAC,KAAK,KAAK,EAAE;AAEhB,QADa,KAAK,UAAU,KACf,IACT;AAEJ,SAAK;AACL,SAAK,QAAQ;IACb,MAAM,MAAM,KAAK,UAAU;IAC3B,IAAI,QAAQ;AACZ,QAAI,KAAK,UAAU,KAAK,KAAK;AACzB,UAAK;AACL,aAAQ,KAAK,eAAe;;AAEhC,eAAW,IAAI,KAAK,MAAM;;AAE9B,UAAO;;EAEX,wBAAwB;GACpB,IAAI,OAAO;GACX,IAAIC,SAAO;GACX,IAAI,cAAc;AAClB,OAAI,KAAK,UAAU,KAAK,KAAK;AACzB,aAAO;AACP,SAAK;;AAMT,OAAI,CAAC,QAAQ,KAAK,UAAU,CAAC,CACzB,OAAM,IAAI,WAAW,KAAK,KAAK,yBAAyB;AAE5D,UAAO,CAAC,KAAK,KAAK,EAAE;IAChB,MAAM,OAAO,KAAK,SAAS;AAC3B,QAAI,QAAQ,KAAK,CACb,gBAAe;aAEV,SAAS,aAAa,SAAS,KAAK;AACzC,SAAI,YAAY,SAAS,GACrB,OAAM,IAAI,WAAW,KAAK,KAAK,kCAAkC;AAErE,oBAAe;AACf,YAAO;WAEN;AAED,UAAK;AACL;;AAEJ,QAAI,SAAS,aAAa,YAAY,SAAS,GAC3C,OAAM,IAAI,WAAW,KAAK,KAAK,kCAAkC;AAErE,QAAI,SAAS,aAAa,YAAY,SAAS,GAC3C,OAAM,IAAI,WAAW,KAAK,KAAK,kCAAkC;;AAGzE,OAAI,SAAS,UACT,QAAO,SAAS,aAAa,GAAG,GAAGA;QAElC;AACD,QAAI,YAAY,SAAS,IAAI,CACzB,OAAM,IAAI,WAAW,KAAK,KAAK,iCAAiC;AAEpE,QAAI,YAAY,MAAM,IAAI,CAAC,GAAG,SAAS,EACnC,OAAM,IAAI,WAAW,KAAK,KAAK,2DAA2D;AAE9F,WAAO,WAAW,YAAY,GAAGA;;;EAGzC,cAAc;GACV,IAAI,eAAe;AACnB,QAAK,WAAW,KAAI;AACpB,QAAK;AACL,UAAO,CAAC,KAAK,KAAK,EAAE;IAChB,MAAM,OAAO,KAAK,SAAS;AAC3B,QAAI,SAAS,MAAM;AACf,SAAI,KAAK,KAAK,CACV,OAAM,IAAI,WAAW,KAAK,KAAK,0BAA0B;KAE7D,MAAM,WAAW,KAAK,SAAS;AAC/B,SAAI,aAAa,QAAQ,aAAa,KAClC,OAAM,IAAI,WAAW,KAAK,KAAK,oEAAoE;AAEvG,qBAAgB;eAEX,SAAS,KACd,QAAO;aAEF,EAAE,GAAG,OAAO,SAAS,KAAK,CAC/B,OAAM,IAAI,MAAM,qCAAqC;QAGrD,iBAAgB;;AAGxB,SAAM,IAAI,WAAW,KAAK,KAAK,0BAA0B;;EAE7D,aAAa;GAKT,IAAI,eAAe;AACnB,UAAO,CAAC,KAAK,KAAK,EAAE;IAChB,MAAM,OAAO,KAAK,UAAU;AAC5B,QAAI,CAAC,kCAAkC,KAAK,KAAK,CAC7C,QAAO,IAAI,QAAQ,MAAM,aAAa;AAE1C,oBAAgB,KAAK,SAAS;;AAElC,UAAO,IAAI,QAAQ,MAAM,aAAa;;EAE1C,oBAAoB;AAChB,QAAK,WAAW,IAAI;AACpB,QAAK;GACL,MAAM,SAAS,KAAK,MAAM,QAAQ,KAAK,KAAK,IAAI;AAChD,OAAI,WAAW,GACX,OAAM,IAAI,WAAW,KAAK,KAAK,wEAAsE;GAEzG,MAAM,aAAa,KAAK,MAAM,UAAU,KAAK,KAAK,OAAO;AACzD,QAAK,OAAO,WAAW,SAAS;AAChC,OAAI,CAAC,oBAAoB,KAAK,WAAW,CACrC,OAAM,IAAI,WAAW,KAAK,KAAK,sDAAsD;AAEzF,UAAO,IAAI,QAAQ,aAAa,WAAW;;EAE/C,eAAe;AACX,QAAK,WAAW,IAAI;AACpB,QAAK;GACL,MAAM,OAAO,KAAK,SAAS;AAC3B,OAAI,SAAS,IACT,QAAO;AAEX,OAAI,SAAS,IACT,QAAO;AAEX,SAAM,IAAI,WAAW,KAAK,KAAK,oDAAgD;;EAEnF,WAAW;AACP,OAAI,CAAC,KAAK,UAAU,CAAC,MAAM,UAAU,CACjC,OAAM,IAAI,WAAW,KAAK,KAAK,oDAAoD;GAEvF,IAAI,eAAe;AACnB,UAAO,CAAC,KAAK,KAAK,EAAE;IAChB,MAAM,OAAO,KAAK,UAAU;AAC5B,QAAI,CAAC,kBAAkB,KAAK,KAAK,CAC7B,QAAO;AAEX,oBAAgB,KAAK,SAAS;;AAElC,UAAO;;;;;EAKX,WAAW;AACP,UAAO,KAAK,MAAM,KAAK;;;;;EAK3B,WAAW,MAAM;AACb,OAAI,KAAK,UAAU,KAAK,KACpB,OAAM,IAAI,WAAW,KAAK,KAAK,YAAY,OAAO;;EAG1D,UAAU;AACN,UAAO,KAAK,MAAM,KAAK;;EAE3B,MAAM;AACF,UAAO,KAAK,OAAO,KAAK,MAAM;;EAGlC,UAAU;AACN,UAAO,MAAM;IACT,MAAM,IAAI,KAAK,MAAM,OAAO,KAAK,KAAK,EAAE;AACxC,QAAI,MAAM,OAAO,MAAM,IACnB,MAAK;QAGL;;;EAKZ,SAAS;AACL,UAAO,KAAK,UAAU,KAAK,IACvB,MAAK;;EAKb,aAAa;AACT,QAAK,QAAQ;AACb,OAAI,CAAC,KAAK,KAAK,CACX,OAAM,IAAI,WAAW,KAAK,KAAK,wCAAwC;;;AAInF,SAAQ,UAAU;CAClB,MAAM,eAAe;CACrB,SAAS,QAAQ,MAAM;AACnB,SAAO,aAAa,KAAK,KAAK;;;;;;;CCnVlC,IAAI,qCAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,MAAI,OAAO,OAAW,MAAK;EAC3B,IAAI,OAAO,OAAO,yBAAyB,GAAG,EAAE;AAChD,MAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,cAClE,QAAO;GAAE,YAAY;GAAM,KAAK,WAAW;AAAE,WAAO,EAAE;;GAAO;AAE/D,SAAO,eAAe,GAAG,IAAI,KAAK;OAChC,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,MAAI,OAAO,OAAW,MAAK;AAC3B,IAAE,MAAM,EAAE;;CAEd,IAAI,kCAA6B,gBAAiB,SAAS,GAAG,WAAS;AACnE,OAAK,IAAI,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKC,WAAS,EAAE,CAAE,iBAAgBA,WAAS,GAAG,EAAE;;AAE7H,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM,CAAC;AAC7D,SAAQ,QAAQ,KAAK;AACrB,oCAAsC,QAAQ;AAC9C,gCAAkC,QAAQ;AAC1C,+BAAiC,QAAQ;AACzC,8BAAgC,QAAQ;CACxC,IAAI;AACJ,QAAO,eAAe,SAAS,SAAS;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,QAAQ;;EAAU,CAAC;;;;;;AClBzG,MAAa,mBAAmB,UAAU,kBAAkB;AAC5D,MAAa,kBAAkB,UAAU,oBAAoB;AAC7D,SAAgB,UAAU,QAAQ;AAC9B,QAAO,OAAO,MAAM;;;;;;;AAOxB,SAAgB,SAAS,QAAQ,cAAc;CAC3C,MAAM,EAAE,eAAM,QAAQ,MAAM,SAAS,QAAQ,SAAS,OAAO,KAAK,OAAO,YAAa;CACtF,MAAM,QAAQ,IAAI,OAAO;CACzB,MAAM,UAAU,IAAI,OAAO;AAC3B,QAAO,SAAS,UAAU;AACtB,MAAI,MAAM,WAAW,IAAI,CACrB,SAAQ,OAAR;GACI,KAAK;AACD,UAAM,KAAK,IAAI,MAAM,KAAK,SAAS;AACnC,YAAQ,KAAK,CAAC,uBAAO,IAAI,KAAK,CAAC,CAAC;AAChC;GACJ,KAAK;AACD,UAAM,KAAK,IAAI,MAAM,KAAK,OAAO;AACjC,YAAQ,KAAK,CAAC,uBAAO,IAAI,KAAK,CAAC,CAAC;AAChC;;OAGP;AACD,OAAI,CAAC,QAAQ,IAAI,MAAM,CACnB;AACJ,WAAQ,KAAK,CAAC,uBAAO,IAAI,KAAK,CAAC,CAAC;GAChC,MAAM,QAAQ,UAAU,QAAQ,IAAI,MAAM,CAAC;AAC3C,SAAM,KAAK,IAAI,MAAM,KAAK,QAAQ;;GAExC;CACF,MAAM,6BAAa,IAAI,KAAK;CAC5B,MAAM,MAAM,KAAK,MAAM,QAAQ,CAAC,SAAS,GAAG,IAAK;AACjD,YAAW,IAAI,WAAW,IAAI;CAC9B,MAAM,SAAS,CACX,IAAI,QAAQ,KAAK,UAAU,MAAM,GAAG,CAAC,KAAK,IAAI,CAAC,IAC/C,WAAW,MACd;AACD,KAAI,WAAW,QAAW;AACtB,SAAO,KAAK,WAAW,UAAU;AACjC,aAAW,IAAI,WAAW,QAAQ;;AAEtC,KAAI,SAAS,QAAW;AACpB,SAAO,KAAK,SAAS,QAAQ;AAC7B,aAAW,IAAI,SAAS,MAAM;;AAElC,KAAI,SAAS,QAAW;AACpB,SAAO,KAAK,SAAS,QAAQ;AAC7B,aAAW,IAAI,SAAS,MAAM;;AAElC,KAAI,WAAW,QAAW;AACtB,SAAO,KAAK,WAAW,UAAU;AACjC,aAAW,IAAI,WAAW,QAAQ;;AAEtC,KAAI,OAAO,QAAW;AAClB,SAAO,KAAK,OAAO,MAAM;AACzB,aAAW,IAAI,OAAO,IAAI;;CAE9B,MAAM,MAAM,IAAI,IAAI,CAAC,CAACC,SAAM,CAAC,SAAS,WAAW,CAAC,CAAC,CAAC;CACpD,MAAM,SAAS,OAAO,KAAK,IAAI;AAC/B,OAAM,KAAK,uBAAuB,OAAO,GAAG;CAC5C,MAAM,MAAM,MAAM,KAAK,KAAK;CAC5B,MAAM,MAAM,OAAO,KAAK,EAAE,IAAI,CAAC;AAC/B,QAAO,CACH,IAAI,IAAI,CACJ,CAAC,kBAAkB,wCAAuB,IAAI,GAAG,CACpD,CAAC,EACF,IACH;;AAEL,IAAa,cAAb,MAAyB;CACrB,YAAY,KAAK;AACb,OAAK,OAAO;;CAEhB,IAAI,OAAO;AACP,SAAO,gBAAgB,KAAK,KAAK;;CAErC,IAAI,QAAQ;AACR,SAAO,EAAE,KAAK,KAAK;;;AAG3B,IAAa,WAAb,MAAsB;AAEtB,SAAgB,WAAW,OAAO;CAC9B,MAAM,uCAAsB,MAAM;CAClC,MAAM,YAAY,IAAI,OAAO;AAC7B,KAAI,SAAS,SAAO,QAAQ;EACxB,MAAMC,aAAW,IAAI,UAAU;AAC/B,aAAS,OAAO;EAChB,IAAI;EACJ,IAAI;AACJ,GAAC,MAAM,UAAUC;AACjB,aAAS,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG;AAC7C,MAAI,CAAC,OAAO,IAAI,UAAU,CACtB,OAAM,IAAI,MAAM,wDAAwD;AAE5E,aAAS,UAAU,OAAO,IAAI,UAAU;AACxC,MAAI,OAAO,IAAI,UAAU,CACrB,YAAS,UAAU,OAAO,IAAI,UAAU;AAE5C,MAAI,OAAO,IAAI,QAAQ,CACnB,YAAS,QAAQ,OAAO,IAAI,QAAQ;AAExC,MAAI,OAAO,IAAI,MAAM,CACjB,YAAS,MAAM,OAAO,IAAI,MAAM;AAEpC,MAAI,OAAO,IAAI,QAAQ,CACnB,YAAS,QAAQ,OAAO,IAAI,QAAQ;AAExC,MAAI,OAAO,IAAI,UAAU,CACrB,YAAS,UAAU,OAAO,IAAI,UAAU;AAE5C,YAAU,KAAKD,WAAS;GAC1B;AACF,QAAO;;;;;;;AAOX,SAAgB,kBAAkB,QAAQ,KAAK;AAC3C,KAAI,WAAW,MAAM;EAEjB,MAAM,SADO,OAAO,QAAQ,GAAG,IAAI,IAAI,GAAG,CACtB,MAAM,IAAI;EAC9B,MAAM,MAAM,OAAO,GAAG,MAAM,IAAI;AAChC,SAAO;GACH,OAAO,SAAS,IAAI,GAAG;GACvB,KAAK,SAAS,IAAI,GAAG;GACrB,OAAO,SAAS,OAAO,GAAG;GAC7B;OAGD,QAAO;EAAE,OAAO;EAAG,KAAK;EAAG,OAAO;EAAG;;;;;;ACtI7C,IAAa,aAAb,MAAwB;;;;;CAKpB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;;CASlB,MAAM,KAAK,QAAQ,GAAG,MAAM,IAAI;EAC5B,MAAM,eAAe,IAAI,SAAS;AAClC,eAAa,OAAO,SAAS,QAAQ,MAAM,GAAG,MAAM;EAIpD,MAAM,MAAM,MAAM,KAAK,OAAO,MAHjB,gBAEE,OADF,MAE2C,aAAa;EAErE,MAAME,UAAQ,kBADH,IAAI,QAAQ,IAAI,gBAAgB,EACP,OAAO;EAC3C,MAAM,OAAO,MAAM,IAAI,MAAM;AAC7B,SAAO;GACH,OAAOA,QAAM;GACb,KAAKA,QAAM;GACX,OAAOA,QAAM;GACP;GACT;;;;;;;;CAQL,MAAM,IAAI,SAAM;EACZ,MAAM,OAAO,gBAAgB,mBAAmBC,QAAK;AAIrD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;;;;CAS3B,MAAM,OAAO,SAAM,MAAM;EACrB,MAAM,OAAO,gBAAgBA;AAG7B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;;CAS3B,MAAM,OAAO,SAAM,QAAQ,EAAE,EAAE;EAC3B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;EACxB,MAAM,OAAO,MAAM,QAAQ,SAAY,MAAM,QAAQ,MAAM;EAC3D,MAAM,gBAAgB,KAAK,MAAM,kBAAkB,QAAQ,OAAO,KAAK,IAAI,KAAK;EAChF,MAAM,SAAS,KAAK,MAAM,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK;EAClE,IAAI,SAAS,KAAK,MAAM,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK;EAChE,IAAI,QAAQ,KAAK,MAAM,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;EAChE,MAAM,QAAQ,KAAK,MAAM,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK;EAChE,IAAI,SAAS,KAAK,MAAM,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,OAAO;EACvE,MAAM,QAAQ,MAAM;EACpB,MAAM,SAAS,MAAM;EACrB,MAAM,OAAO,MAAM,QAAQ,SAAY,CAAC,MAAM,KAAK,GAAG,EAAE;EACxD,MAAM,MAAM,MAAM;EAClB,MAAM,SAAS,MAAM;EACrB,MAAM,UAAU,MAAM;EACtB,MAAM,OAAO,MAAM;EACnB,MAAM,OAAO,MAAM;EACnB,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,MAAM;EACpB,MAAM,SAAS,MAAM;EACrB,MAAM,OAAO,MAAM;EACnB,MAAM,QAAQ,MAAM;EACpB,IAAI,SAAS,MAAM;EACnB,MAAM,OAAO,MAAM;EACnB,MAAM,cAAc,MAAM;EAC1B,MAAM,SAAS,MAAM;AACrB,MAAI,CAAC,cAAc;AACf,YAAS;AACT,WAAQ;AACR,WAAQ,OAAO;;EAEnB,MAAM,QAAQ;GACI;GACP;GACA;GACD;GACA;GACC;GACC;GACD;GACD;GACA;GACD;GACC;GACA;GACA;GACE;GACC;GACT,MAAM;GACN,OAAO;GACD;GACC;GACC;GACF;GACO;GACL;GACX;EACD,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,MAAM,KAAK,OAAO,MAAM,MAAM;EACrE,MAAM,CAAC,MAAM,SAAS,MAAM,OAAO,OAAO,aAAa;AACvD,SAAO,SAAS,SAAY,OAAO,EAAE;EACrC,IAAI,SAAS;AACb,MAAI,UAAU,OACV,UAAS,OAAO;GACN;GACC;GACA;GACA;GACD;GACA;GACN,MAAM,EAAE;GACF;GACN,SAAS;GACT,MAAM,QAAQ;GACd,MAAM;GACN,QAAQ;GACX,CAAC;MAGF,UAAS,OAAO;GACN;GACC;GACA;GACA;GACD;GACA;GACN,MAAM,EAAE;GACF;GACN,SAAS;GACT,MAAM,QAAQ;GACd,MAAM;GACN,QAAQ;GACA;GACX,CAAC;EAEN,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE,OAAO,IAAI,CAAC;EAC7C,MAAM,WAAW;GACb,MAAMA;GACN,KAAK,OAAO;GACN;GACC;GACP,OAAO,UAAU,SACX,OAAO,KAAK,UAAU,MAAM,EAAE,GAC9B;GACN,OAAO,WAAW,SACZ,QAAQ,KAAK,UAAU,MAAM,EAAE,GAC/B;GACT;AACD,WAAS,QAAQ,OAAO,QAAQ;AAChC,OAAK,OAAO,OAAO,KAAK,OAAO,OAAO;EACtC,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,gBAAgB,QAAQ,SAAS;AACrE,SAAO,IAAI,YAAY,QAAQ,MAAM,IAAI;;;;;;;;;CAS7C,MAAM,SAAS,SAAM,MAAM;EACvB,MAAM,EAAE,QAAQ,MAAM,aAAa,MAAM,KAAK,eAAeA,SAAM,KAAK;AAExE,SAAO,IAAI,YAAY,QAAQ,MADnB,MAAM,KAAK,OAAO,MAAM,kBAAkBA,UAAO,WAAW,QAAQ,SAAS,CAChD;;CAE7C,MAAM,eAAe,SAAM,MAAM;EAC7B,MAAM,MAAM,MAAM,KAAK,IAAIA,QAAK;EAChC,MAAM,MAAM,IAAI;EAChB,MAAM,QAAQ,IAAI;EAClB,MAAM,KAAK,SAAS,MAAM,GAAG,GAAG;EAChC,MAAM,MAAM,MAAM;AAClB,SAAO,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC,KAAK;EAC1C,MAAM,SAAS,SAAS;GACf;GACL,IAAI,KAAK;GACH;GACD;GACL,SAAS;GACT,MAAM;GACT,CAAC;EACF,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,IAAI;EAC3C,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE,OAAO,IAAI,CAAC;EAC7C,MAAM,WAAW;GACb,KAAK,OAAO;GACN;GACT;AACD,WAAS,OAAO,QAAQ,OAAO,QAAQ;AACvC,SAAO;GAAE;GAAQ;GAAM;GAAU;;;;;;;;CAQrC,MAAM,OAAO,SAAM,QAAQ,EAAE,EAAE;EAC3B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;EAC5B,MAAM,gBAAgB,KAAK,MAAM,kBAAkB,QAAQ,OAAO,KAAK,IAAI,KAAK;EAChF,MAAM,SAAS,KAAK,MAAM,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,OAAO;EACzE,MAAM,UAAU,KAAK,MAAM,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK;EACpE,MAAM,MAAM,MAAM,KAAK,IAAIA,QAAK;EAChC,MAAM,MAAM,IAAI;EAChB,MAAM,YAAY,IAAI,MAAM,OAAO;EACnC,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,MAAM,EAAE;EACtB,MAAM,MAAM,MAAM;EAClB,MAAM,OAAO,SAAS,MAAM,GAAG,GAAG,GAAG;EACrC,MAAM,OAAO,MAAM;EACnB,IAAI,QAAQ,MAAM;EAClB,IAAI,SAAS,KAAK,MAAM,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK;AAEhE,MAAI,SAAS,OACT,SAAQ,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC,SAAS,GAAG;AAE7D,MAAI,SAAS,OACT,SAAQ,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG;EAC9D,MAAM,MAAM,IAAI,QAAQ,EAAE,MAAM,OAAO,CAAC,CAAC;EACzC,MAAM,MAAM,IAAI,QAAQ,EAAE,MAAM,OAAO,CAAC,CAAC;EAEzC,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,IAAI;EAE3C,MAAM,UAAU,KAAK,MAAM,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM;EACjG,MAAM,SAAS,MAAM,UAAU,SAAY,EAAE,GAAG,MAAM;EACtD,MAAM,UAAU,MAAM,WAAW,SAAY,EAAE,GAAG,MAAM;EACxD,MAAM,CAAC,MAAM,SAAS,MAAM,OAAO,OAAO,QAAQ,cAAc,QAAQ,QAAQ;EAChF,MAAM,QAAQ,KAAK,MAAM,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;EAClE,MAAM,QAAQ,KAAK,MAAM,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;EAClE,MAAM,OAAO,MAAM,QAAQ,SAAY,CAAC,MAAM,KAAK,GAAG,EAAE;EACxD,MAAM,OAAO,MAAM;EAEnB,MAAM,SAAS,OAAO;GACb;GACL,KAHQ,YAAY,KAAK,MAAM,KAAK;GAI9B;GACD;GACL,IAAI;GACJ,OAAO;GACP,OAAO;GACA;GACD;GACA;GACA;GACA;GACA;GACT,CAAC;EACF,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE,OAAO,IAAI,CAAC;EAC7C,MAAM,WAAW;GACb,KAAK,OAAO;GACN;GACN,OAAO,UAAU,SACX,OAAO,KAAK,YAAUC,QAAM,EAAE,GAC9B;GACN,OAAO,WAAW,SACZ,QAAQ,KAAK,YAAUA,QAAM,EAAE,GAC/B;GACT;AACD,WAAS,OAAO,QAAQ,OAAO,QAAQ;AAEvC,SAAO,IAAI,YAAY,QAAQ,MADnB,MAAM,KAAK,OAAO,MAAM,kBAAkBD,UAAO,WAAW,QAAQ,SAAS,CAChD;;;;;;;;;;;;;CAa7C,MAAM,WAAW,SAAM,MAAM,KAAK,OAAO;EACrC,MAAM,MAAM,MAAM,KAAK,IAAIA,QAAK;EAChC,MAAM,MAAM,IAAI;EAChB,MAAM,MAAM,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM;EAEnD,MAAM,OAAO,MADE,KAAK,OAAO,QAAQ,IAAI,IAAI,CACjB,KAAK,EAAE,IAAI,IAAI,CAAC;EAC1C,MAAM,WAAW;GACb,KAAK,IAAI;GACH;GACT;AAED,SAAO,IAAI,YAAY,KAAK,MADhB,MAAM,KAAK,OAAO,MAAM,kBAAkBA,UAAO,aAAa,QAAQ,SAAS,CACrD;;;;;;;;;;CAU1C,YAAY,KAAK,MAAM,KAAK,OAAO;EAC/B,MAAM,OAAO;GACT,KAAK;GACC;GACT;AACD,MAAI,OAAO,OACP,MAAK,MAAM;AAGf,SAAO,MADO,iBACM,MAAM,OAAO,QAAW,QAAQ,KAAK;;;;;;;;CAQ7D,MAAM,QAAQ,SAAM;AAEhB,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,kBAAkBA,UAAO,YAAY,OAAO,OAAU,EACzE,MAAM;;;;AAI/B,IAAa,cAAb,MAAyB;CACrB,YAAY,QAAQ,MAAM,UAAU;AAChC,OAAK,UAAU;AACf,OAAK,QAAQ;AACb,OAAK,WAAW;;CAEpB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,MAAM,KAAK;AACP,SAAO,MAAM,KAAK,SAAS,MAAM;;;;;;ACrWzC,MAAa,QAAQ;CAAC;CAAO;CAAG;CAAM;CAAM;CAAS;CAAS;CAAM;AACpE,MAAa,SAAS;CAAC;CAAM;CAAG;CAAM;CAAO;CAAQ;CAAQ;CAAK;AAClE,IAAa,UAAb,MAAqB;CACjB,YAAY,SAAS,SAAS,QAAQ,SAAS,QAAQ,MAAM;AACzD,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,SAAS;AACd,OAAK,UAAU;AACf,OAAK,SAAS;AACd,OAAK,OAAO;;;AAGpB,SAAgB,UAAU,UAAU;CAChC,IAAI;CACJ,MAAM,SAAS,EAAE;AACjB,MAAK,MAAM,WAAW,UAAU;EAC5B,IAAI;EACJ,IAAI;AACJ,MAAI,QAAQ,mBAAmB,KAAK;AAChC,aAAU,MAAM,KAAK,QAAQ,QAAQ,QAAQ,CAAC;AAC9C,UAAO,MAAM,KAAK,QAAQ,QAAQ,MAAM,CAAC;SAExC;AACD,aAAU,QAAQ;AAClB,UAAO,EAAE;;EAEb,MAAM,QAAQ,IAAI,OAAO;EACzB,MAAM,WAAW,KAAK,QAAQ,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,QAAQ,cAAc;AAC9F,MAAI,QACA,OAAM,KAAK,iBAAe;MAG1B,OAAM,KAAK,iBAAe;AAE9B,MAAI,QAAQ,UAAU,OAClB,OAAM,KAAK,WAAW,QAAQ,OAAO,GAAG;AAE5C,MAAI,QAAQ,WAAW,OACnB,OAAM,KAAK,YAAY,QAAQ,QAAQ,GAAG;AAE9C,MAAI,QAAQ,UAAU,OAClB,OAAM,KAAK,WAAW,QAAQ,OAAO,GAAG;AAE5C,MAAI,QAAQ,QAAQ,OAChB,OAAM,KAAK,SAAS,QAAQ,KAAK,GAAG;AAExC,QAAM,KAAK,GAAG,QAAQ,KAAK,QAAQ,QAAQ;GACvC,IAAIE,QAAM;GACV,IAAI;AACJ,OAAI,QAAQ,UAAa,KAAK,SAAS,IACnC,SAAM,KAAK;AAEf,OAAI,kBAAkB,OAAO;AACzB,QAAI,CAAC,QACD,OAAM,IAAI,MAAM,4BAA4B,OAAO,sBAAsB;AAE7E,YAAMA,UAAQ,QAAQA,UAAQ,KAAK,IAAIA,QAAM,OAAO,MAAM,UAAU;AACpE,UAAM,OAAO;cAER,kBAAkB,OAAO;AAC9B,QAAI,QACA,OAAM,IAAI,MAAM,8BAA8B,OAAO,qBAAqB;AAE9E,QAAI,CAAC,OAAO,OACR,OAAM,IAAI,MAAM,6CAA6C;AAEjE,YAAMA,UAAQ,QAAQA,UAAQ,KAAK,IAAIA,QAAM,OAAO,OAAO;AAC3D,UAAM,OAAO;UAEZ;AACD,YAAMA,UAAQ,QAAQA,UAAQ,KAAK,IAAIA,QAAM,IAAI,UAAU;AAC3D,UAAM;;AAEV,UAAO,GAAGA,MAAI,IAAI,IAAI;IACxB,CAAC;AACH,SAAO,KAAK,MAAM,KAAK,IAAI,CAAC;;AAEhC,QAAO,IAAI,QAAQ,CAAC,CAAC,aAAa,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;;AAEzD,SAAgB,YAAY,OAAO;AAqD/B,QApDe,MAAM,QAAQ,KAAK,GAAG,CAAC,MAAM,IAAI,CACxB,KAAK,QAAQ;EACjC,MAAM,uBAAO,IAAI,KAAK;AACtB,MAAI,MAAM,IAAI,CAAC,SAAS,MAAM;GAC1B,MAAM,SAAS,EAAE,MAAM,KAAK,EAAE;AAC9B,QAAK,IAAI,OAAO,IAAI,OAAO,GAAG,WAAW,MAAK,GAAG,CAAC;IACpD;AACF,MAAI,CAAC,KAAK,IAAI,UAAU,CACpB,OAAM,IAAI,MAAM,qDAAqD;EAEzE,MAAM,OAAO,KAAK,IAAI,UAAU;EAChC,MAAM,UAAU,CAAC,MAAM,SAAS,KAAK;AACrC,OAAK,OAAO,UAAU;EACtB,IAAI;AACJ,MAAI,KAAK,IAAI,SAAS,EAAE;AACpB,YAAS,KAAK,IAAI,SAAS;AAC3B,QAAK,OAAO,SAAS;;EAEzB,IAAI;AACJ,MAAI,KAAK,IAAI,UAAU,EAAE;AACrB,aAAU,KAAK,IAAI,UAAU;AAC7B,QAAK,OAAO,UAAU;;EAE1B,IAAI;AACJ,MAAI,KAAK,IAAI,SAAS,EAAE;AACpB,YAAS,KAAK,IAAI,SAAS;AAC3B,QAAK,OAAO,SAAS;;EAEzB,IAAI;AACJ,MAAI,KAAK,IAAI,OAAO,EAAE;AAClB,UAAO,KAAK,IAAI,OAAO;AACvB,QAAK,OAAO,OAAO;QAGnB,QAAO;AAEX,MAAI,QAAQ,QAAQ;GAChB,MAAM,0BAAU,IAAI,KAAK;AACzB,QAAK,MAAM,CAAC,KAAKC,UAAQ,KAAK,SAAS,CACnC,KAAI,QACA,SAAQ,IAAI,KAAK,IAAI,MAAM,EAAE,MAAMA,OAAK,CAAC,CAAC;OAG1C,SAAQ,IAAI,KAAK,IAAI,MAAM,EAAE,MAAMA,OAAK,CAAC,CAAC;AAGlD,UAAO,IAAI,QAAQ,SAAS,SAAS,QAAQ,SAAS,QAAQ,KAAK;QAGnE,QAAO,IAAI,QAAQ,MAAM,SAAS,QAAQ,SAAS,QAAQ,KAAK;GAEtE;;;;;ACnIN,IAAa,gBAAb,MAAa,cAAc;CACvB,YAAY,MAAM,QAAQ;AACtB,OAAK,QAAQ;AACb,OAAK,UAAU;;CAEnB,OAAO,SAAS,QAAQ,MAAM;EAC1B,MAAMC,aAAW,QAAQ,IAAI,iBAAiB;AAC9C,MAAIA,cAAY,KACZ,QAAO;EAEX,MAAMC,cAAY,QAAQ,IAAI,YAAY;AAC1C,MAAIA,eAAa,KACb,QAAO;EAEX,IAAI,SAAS,WAAWD,WAAS;AACjC,WAAS,OAAO,QAAQ,UAAU,MAAM,QAAQ,UAAU;AAC1D,MAAI,OAAO,UAAU,EACjB,QAAO;AAEX,SAAO,SAAS,UAAU;GACtB,MAAM,QAAQ,IAAI,OAAO;AACzB,SAAM,OAAO,SAAS,UAAU;AAC5B,QAAI,MAAM,WAAW,IAAI,EACrB;SAAI,SAAS,UACT,OAAM,KAAK,IAAI,MAAM,KAAK,SAAS;cAE9B,SAAS,QACd,OAAM,KAAK,IAAI,MAAM,KAAK,OAAO;eAIjC,QAAQ,IAAI,MAAM,EAAE;KACpB,MAAM,QAAQ,UAAU,QAAQ,IAAI,MAAM,CAAC;AAC3C,WAAM,KAAK,IAAI,MAAM,KAAK,QAAQ;;KAG5C;GACF,MAAM,SAAS,IAAI,OAAO;AAC1B,UAAO,KAAK,IAAI,MAAM,OAAO,KAAK,IAAI,CAAC,GAAG;AAC1C,UAAO,KAAK,WAAW,MAAM,UAAU;AACvC,OAAI,MAAM,WAAW,OACjB,QAAO,KAAK,WAAW,MAAM,UAAU;AAE3C,OAAI,MAAM,SAAS,OACf,QAAO,KAAK,SAAS,MAAM,QAAQ;AAEvC,OAAI,MAAM,SAAS,OACf,QAAO,KAAK,SAAS,MAAM,QAAQ;AAEvC,OAAI,MAAM,WAAW,OACjB,QAAO,KAAK,WAAW,MAAM,UAAU;AAE3C,OAAI,MAAM,OAAO,OACb,QAAO,KAAK,OAAO,MAAM,MAAM;GAEnC,MAAM,SAAS,OAAO,KAAK,IAAI;AAC/B,SAAM,KAAK,uBAAuB,OAAO,GAAG;GAC5C,MAAM,MAAM,MAAM,KAAK,KAAK;GAG5B,MAAM,MAFU,YAAYC,YAAU,CACd,GAAG,QACP,IAAI,MAAM,KAAK;AACnC,OAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,KAAK,IAAI,CAC1C,OAAM,IAAI,MAAM,iBAAiB,MAAM,MAAM,WAAW;IAE9D;AACF,SAAO;;CAEX,KAAK,SAAS,QAAQ,MAAM,QAAQ;AAChC,MAAI,UAAU,OACV,UAAS,cAAc;EAE3B,MAAM,CAAC,QAAQ,OAAO,SAAS,KAAK,OAAO;GACvC,MAAM;GACN;GACA;GACA;GACA;GACA,KAAK;GACL,OAAO,KAAK,MAAM,OAAO;GAC5B,CAAC;AACF,SAAO,SAAS,OAAO,QAAQ;AAC3B,WAAQ,OAAO,KAAK,MAAM;IAC5B;EACF,MAAM,0BAAU,IAAI,KAAK;AACzB,UAAQ,IAAI,WAAW,IAAI;AAG3B,EADe,UAAU,CADT,IAAI,QAAQ,SAAS,MAAM,CACT,CAAC,CAC5B,SAAS,OAAO,QAAQ;AAC3B,WAAQ,OAAO,KAAK,MAAM;IAC5B;AACF,SAAO;;;AAGf,cAAc,gBAAgB;CAC1B;CACA;CACA;CACA,gBAAgB,aAAa;CAChC;;;;;;;ACxFD,IAAa,2BAAb,MAAsC;;;;;;;CAOlC,YAAY,QAAQ,kBAAkB,EAAE,EAAE;AACtC,OAAK,SAAS;AACd,OAAK,UAAU,EAAE;AACjB,OAAK,SAAS;AACd,OAAK,MAAMC,SAAO,gBACd,MAAK,QAAQA,MAAI,QAAQA,MAAI;;;;;;;;CASrC,IAAI,MAAM,MAAM,OAAO;AACnB,UAAQ,MAAR;GACI,KAAK,MAAM,MACP,QAAO,IAAI,uBAAuB,KAAK,QAAQ,MAAM,MAAM,SAAS,MAAM,SAAS,MAAM,iBAAiB,MAAM,SAAS,MAAM,SAAS,MAAM,UAAU,MAAM,WAAW,MAAM,UAAU,MAAM,WAAW,MAAM,WAAW,MAAM,UAAU,MAAM,SAAS,MAAM,QAAQ;GAC5Q,KAAK,MAAM,MACP,QAAO,IAAI,uBAAuB,KAAK,QAAQ,MAAM,SAAS,MAAM,UAAU,MAAM,WAAW,MAAM,iBAAiB,MAAM,UAAU,MAAM,WAAW,MAAM,WAAW,MAAM,UAAU,MAAM,SAAS,MAAM,QAAQ;GACzN,KAAK,MAAM,MACP,QAAO,IAAI,uBAAuB,MAAM,MAAM,SAAS,MAAM,WAAW,MAAM,YAAY,MAAM,SAAS,MAAM,SAAS;GAC5H,KAAK,MAAM,QAAQ;IACf,MAAM,oBAAoB,KAAK,QAAQ,MAAM;AAC7C,QAAI,CAAC,kBACD,OAAM,IAAI,MAAM,oCAAoC,MAAM,cAAc;AAE5E,WAAO,IAAI,kBAAkB,MAAM,MAAM;;GAE7C,QACI,OAAM,IAAI,MAAM,eAAe;;;;;;;;;CAS3C,IAAI,KAAK;EACL,MAAM,OAAO,IAAI,MAAM,SACjB,MAAM,QACN,IAAI,MAAM,SACN,MAAM,QACN,IAAI,MAAM,SACN,MAAM,QACN,IAAI,MAAM,UACN,MAAM,SACN;AAClB,MAAI,CAAC,KACD,OAAM,IAAI,MAAM,oBAAoB;EAExC,IAAI,QAAQ,IAAI;AAChB,MAAI,CAAC,MACD,OAAM,IAAI,MAAM,6BAA6B;AAEjD,UAAQ,MAAR;GACI,KAAK,MAAM;AACP,YAAQ;AACR,WAAO,IAAI,uBAAuB,KAAK,QAAQ,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,cAAc,MAAM,MAAM,QAAW,QAAW,MAAM,QAAQ,QAAW,QAAW,MAAM,QAAQ,MAAM,OAAO,QAAW,MAAM,KAAK;GAClO,KAAK,MAAM;AACP,YAAQ;AACR,WAAO,IAAI,uBAAuB,KAAK,QAAQ,QAAW,QAAW,QAAW,IAAI,SAAS,EAAE,MAAM,IAAI,WAAW,CAAC,CAAC,cAAc,QAAW,QAAW,EAAE,EAAE,QAAW,MAAM,MAAM,MAAM,KAAK;GACpM,KAAK,MAAM;AACP,YAAQ;AACR,WAAO,IAAI,uBAAuB,MAAM,MAAM,MAAM,QAAW,QAAW,MAAM,MAAM,MAAM,MAAM;GACtG,KAAK,MAAM,QAAQ;AACf,YAAQ;IACR,MAAM,MAAM,MAAM;AAClB,QAAI,OAAO,KAAK,QAEZ,QADY,IAAI,KAAK,QAAQ,KAAK,MAAM,MAAM,MAAM;QAIpD,OAAM,IAAI,MAAM,oCAAoC,MAAM;;GAGlE,QACI,OAAM,IAAI,MAAM,uBAAuB;;;;AAIvD,IAAa,yBAAb,MAAoC;CAChC,YAAY,QAAQ,MAAM,OAAO,GAAG,OAAO,KAAK,KAAK,eAAe,OAAO,OAAO,QAAW,OAAO,OAAO,cAAc,QAAQ,GAAG,SAAS,QAAW,QAAQ,OAAO,cAAc,SAAS,GAAG,SAAS,QAAW,QAAQ,OAAO,YAAY,OAAO,QAAW,OAAO,QAAW;AAChR,OAAK,OAAO,MAAM;AAElB,OAAK,SAAS;EACd,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,cAAc,QAAW,KAAK;AACtE,OAAK,OAAO,OAAO,OAAO;AAC1B,OAAK,YAAY,IAAI,UAAU,EAAE,EAAE,EAAE,KAAK,KAAK,CAAC;AAChD,OAAK,YAAY,IAAI,UAAU,EAAE,EAAE,OAAO,MAAM;AAChD,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,SACD,UAAU,SAAY,IAAI,MAAM,MAAM,CAAC,KAAK,KAAK,GAAG;AACxD,OAAK,SACD,UAAU,SACJ,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM,GAC7B;AACV,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,eAAe;AACpB,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,OAAK,OAAO,QAAQ,SAAY,gBAAgB;AAChD,MAAI,QAAQ,QAAW;AACnB,QAAK,OAAO,OAAO,WAAW,MAAM,KAAK,MAAM,GAAG,GAAG;AACrD,QAAK,UAAU,IAAI,aAAa,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK;AAChE,QAAK,OAAO,KAAK,UAAU,QAAQ,EAAE,KAAK,QAAQ,KAAK,CAAC,CAAC;aAEpD,QAAQ,QAAW;AACxB,QAAK,UAAU,IAAI,aAAa,QAAW,KAAK,MAAM,KAAK,KAAK;AAChE,QAAK,OAAO,KAAK,UAAU,QAAQ,EAAE,KAAK,QAAQ,KAAK,CAAC,CAAC;SAExD;AACD,QAAK,OAAO;GACZ,MAAM,OAAO,IAAI,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC;AAC5C,QAAK,UAAU,IAAI,aAAa,KAAK,UAAU,QAAQ,MAAM,KAAK,CAAC,MAAM,MAAM,KAAK,KAAK;;AAE7F,OAAK,UAAU,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,KAAK,MAAM,MAAM,CAAC;;CAEhI,SAAS;AACL,SAAO;GACH,MAAM,KAAK;GACX,MAAM,KAAK;GACX,MAAM,KAAK;GACX,MAAM,KAAK;GACX,MAAM,KAAK;GACX,QAAQ,KAAK;GACb,QAAQ,KAAK;GACb,OAAO,KAAK;GACZ,cAAc,KAAK;GACtB;;CAEL,MAAM,OAAO,cAAc;EACvB,IAAI;AACJ,OAAK,eAAe;AACpB,OAAK,OAAO;AAKZ,SAAO,CAJS,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,OAAO,KAAK,MAAM,KAAK,cAAc,KAAK,MAAM,GAAG,KAAK,MAAM,MAAM,CAClG,QAAQ,KAAK,WAAW,OAAO,OAAO,KAAK,EAClD,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,cAAc,KAAK,MAAM,IAAI,KAAK,KAAK,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,QAAQ,MAAM,CAC7J,QAAQ,KAAK,YAAY,IAAI,MAAM,EAAE,MAAM,KAAK,OAAO,EAAE,QAAQ,OAAO,MAAM,CAAC,KAAK,CACpF;;CAE5B,MAAM,OAAO,QAAQ,cAAc;AAC/B,OAAK,SAAS;AACd,OAAK,eAAe;EAEpB,MAAM,UADU,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,KAAK,OAAO,KAAK,OAAO,QAAQ,MAAM,CACzH,QAAQ,KAAK,WAAW,OAAO,OAAO,KAAK;AACnE,OAAK,OAAO,KAAK,OAAO,KAAK,OAAO;AAGpC,SAAO,CAAC,SAFS,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,KAAK,OAAO,KAAK,OAAO,QAAQ,MAAM,CAC1H,QAAQ,KAAK,YAAY,IAAI,MAAM,EAAE,MAAM,KAAK,OAAO,EAAE,QAAQ,OAAO,MAAM,CAAC,KAAK,CACpF;;CAE5B,MAAM,KAAK,KAAK,UAAU,MAAM,UAAU,QAAW,UAAU,QAAW;EACtE,MAAM,UAAU,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,KAAK,MAAM,MAAM;AAC5H,MAAI,SAAS;GACT,MAAM,SAAS,EAAE;GACjB,IAAI,IAAI;AACR,QAAK,MAAM,CAAC,GAAG,WAAW,QAAQ,QAAQ,SAAS,EAAE;AACjD,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAI,OAAO,KAAK,YAAY,IAAI,EAC5B,OAAM,IAAI,MAAM,2BAA2B,EAAE,qBAAqB;UAItE,KAAI;IAER,IAAI,IAAI;AACR,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAK,KAAK,UACL,OAAO,KAAK,YACT,OAAO,KAAK,YACZ,KAAK,EACT,OAAM,IAAI,MAAM,mBAAmB,EAAE,qBAAqB;UAI9D,KAAI;AAER,WAAO,KAAK,OAAO,KAAK,KAAK,GAAG,KAAK,SAAY,OAAO,OAAO,EAAE,CAAC;;AAEtE,UAAO,OAAO,KAAK,UAAU,MAAM,KAAK;SAEvC;GACD,MAAM,SAAS,EAAE;AACjB,QAAK,MAAM,GAAG,WAAW,QAAQ,QAAQ,SAAS,CAC9C,QAAO,KAAK,OAAO,KAAK,IAAI,CAAC;AAEjC,UAAO,OAAO,KAAK,UAAU,MAAM,KAAK;;;;AAIpD,IAAa,yBAAb,MAAoC;CAChC,YAAY,QAAQ,OAAO,OAAO,cAAc,QAAQ,GAAG,SAAS,QAAW,eAAe,OAAO,QAAQ,OAAO,cAAc,SAAS,GAAG,QAAQ,QAAQ,OAAO,YAAY,OAAO,QAAW,OAAO,QAAW;AACjN,OAAK,OAAO,MAAM;AAClB,OAAK,SAAS;AACd,OAAK,SACD,UAAU,SAAY,IAAI,MAAM,MAAM,CAAC,KAAK,KAAK,GAAG;AACxD,OAAK,SACD,UAAU,SACJ,IAAI,MAAM,OAAO,CAAC,KAAK,MAAM,GAC7B;AACV,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,SAAS;EACd,MAAM,SAAS,KAAK,OAAO,OAAO,MAAM,aAAa;AACrD,OAAK,OAAO,OAAO,OAAO;AAC1B,OAAK,YAAY,IAAI,UAAU,EAAE,EAAE,EAAE,KAAK,KAAK,CAAC;AAChD,OAAK,YAAY,IAAI,UAAU,EAAE,EAAE,OAAO,MAAM;AAChD,OAAK,OAAO,SAAS,QAAQ,SAAS,KAAK,IAAI,OAAO,EAAE;AACxD,OAAK,OAAO,SAAS,QAAQ,SAAS,KAAK,IAAI,OAAO,EAAE;AACxD,OAAK,eAAe;AACpB,OAAK,SAAS;AACd,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,UAAU,IAAI,cAAc;AACjC,OAAK,UAAU,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,QAAQ,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC,CAAC,OAAO,QAAW,KAAK,aAAa,CAAC;;CAEhI,SAAS;AACL,SAAO;GACH,MAAM,KAAK;GACX,MAAM,KAAK;GACX,cAAc,KAAK;GACtB;;CAEL,MAAM,OAAO,cAAc;AACvB,OAAK,eAAe;EACpB,MAAM,UAAU,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,OAAO,KAAK,MAAM,KAAK,aAAa;AAC1F,OAAK,OAAO,QAAQ,QAAQ,KAAK,WAAW,KAAK,UAAU,QAAQ,QAAW,OAAO,CAAC,KAAK;EAC3F,MAAM,UAAU,QAAQ,QAAQ,KAAK,WAAW,OAAO,OAAO,KAAK;EACnE,MAAM,WAAW,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,aAAa;AAC7F,OAAK,OAAO,SAAS,QAAQ,KAAK,WAAW,KAAK,UAAU,QAAQ,QAAW,OAAO,CAAC,KAAK;AAE5F,SAAO,CAAC,SADO,SAAS,QAAQ,KAAK,YAAY,IAAI,MAAM,EAAE,MAAM,KAAK,OAAO,EAAE,QAAQ,OAAO,MAAM,CAAC,KAAK,CACpF;;CAE5B,MAAM,OAAO,QAAQ,cAAc;AAC/B,OAAK,SAAS;AACd,OAAK,eAAe;AACpB,OAAK,OAAO,KAAK;EAEjB,MAAM,UADU,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,QAAQ,QAAW,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC,EAAE,KAAK,aAAa,CAAC,CAC/F,KAAK,WAAW,OAAO,OAAO,KAAK;EAC3D,MAAM,WAAW,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,aAAa;AAC7F,OAAK,OAAO,SAAS,QAAQ,KAAK,WAAW,KAAK,UAAU,QAAQ,QAAW,OAAO,CAAC,KAAK;AAE5F,SAAO,CAAC,SADO,SAAS,QAAQ,KAAK,YAAY,IAAI,MAAM,EAAE,MAAM,KAAK,OAAO,EAAE,QAAQ,OAAO,MAAM,CAAC,KAAK,CACpF;;CAE5B,MAAM,KAAK,KAAK,UAAU,MAAM,UAAU,QAAW,UAAU,QAAW;EACtE,MAAM,UAAU,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,QAAQ,IAAI,OAAO,EAAE,MAAM,KAAK,CAAC,CAAC,OAAO,QAAW,KAAK,aAAa,CAAC;AAC7H,MAAI,SAAS;GACT,MAAM,SAAS,EAAE;GACjB,IAAI,IAAI;AACR,QAAK,MAAM,CAAC,GAAG,WAAW,QAAQ,SAAS,EAAE;AACzC,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAI,OAAO,KAAK,YAAY,IAAI,EAC5B,OAAM,IAAI,MAAM,2BAA2B,EAAE,qBAAqB;UAItE,KAAI;IAER,IAAI,IAAI;AACR,QAAI,WAAW,QAAW;AACtB,SAAI,QAAQ;AACZ,SAAK,KAAK,UACL,OAAO,KAAK,YACT,OAAO,KAAK,YACZ,KAAK,EACT,OAAM,IAAI,MAAM,mBAAmB,EAAE,qBAAqB;UAI9D,KAAI;AAER,WAAO,KAAK,OAAO,KAAK,KAAK,GAAG,KAAK,SAAY,OAAO,OAAO,EAAE,CAAC;;AAEtE,UAAO,OAAO,KAAK,UAAU,MAAM,KAAK;SAEvC;GACD,MAAM,SAAS,EAAE;AACjB,QAAK,MAAM,GAAG,WAAW,QAAQ,SAAS,CACtC,QAAO,KAAK,OAAO,KAAK,IAAI,CAAC;AAEjC,UAAO,OAAO,KAAK,UAAU,MAAM,KAAK;;;;AAIpD,IAAa,yBAAb,MAAoC;CAChC,YAAY,SAAS,MAAM,SAAS,QAAW,UAAU,QAAW,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE;EACvF,IAAI,IAAI;AACR,OAAK,QAAQ,EAAE;AACf,OAAK,QAAQ,EAAE;AACf,OAAK,OAAO,MAAM;AAClB,OAAK,UAAU;AACf,MAAI,UAAU,OACV,QAAO,OAAO,KAAK,UAAU,MAAM,KAAK,GAAG;AAE/C,MAAI,WAAW,OACX,SAAQ,QAAQ,KAAK,UAAU,MAAM,KAAK,GAAG;AAEjD,OAAK,SAAS,KAAK,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK,UAAU,MAAM,KAAK,GAAG,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK;AAC1I,OAAK,SAAS,KAAK,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,KAAK,UAAU,MAAM,KAAK,GAAG,MAAM,QAAQ,OAAO,KAAK,IAAI,KAAK;AAC7I,OAAK,OAAO;AACZ,OAAK,UAAU,EAAE;;CAErB,MAAM,SAAS;AACX,SAAO,CAAC,KAAK,OAAO,KAAK,MAAM;;;;;;;;;;CAUnC,MAAM,OAAO,SAAS,eAAe,QAAQ,SAAS;AAClD,OAAK,QAAQ,OAAO,KAAK,UAAU,MAAM,KAAK,GAAG;AACjD,OAAK,QAAQ,QAAQ,KAAK,UAAU,MAAM,KAAK,GAAG;AAClD,SAAO,CAAC,KAAK,OAAO,KAAK,MAAM;;CAEnC,MAAM,KAAK,KAAK,UAAU,MAAM;AAC5B,MAAI,CAAC,KAAK,KAAK,MACX,OAAM,IAAI,MAAM,mBAAmB;EAEvC,MAAM,MAAM,KAAK,KAAK,SAAS,KAAK;EACpC,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK;EACrC,MAAM,MAAM,KAAK,MAAM,QAAQ,IAAI;EACnC,MAAM,MAAM,KAAK,MAAM,QAAQ,KAAK;AAEpC,SAAO,MADS,KAAK,QAAQ,IAAI,KAAK,KAAK,CACtB,KAAK,KAAK,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC;;CAEzD,SAAS;AACL,SAAO;GACH,MAAM,KAAK;GACX,MAAM,KAAK;GACX,OAAO,KAAK;GACf;;;;;;;;;ACvWT,IAAa,WAAb,MAAsB;;;;;CAKlB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;;;CAUlB,MAAM,KAAK,OAAO,aAAa,aAAa;EACxC,MAAM,SAAS,IAAI,iBAAiB;AACpC,MAAI,UAAU,OACV,QAAO,OAAO,SAAS,MAAM;AAEjC,MAAI,gBAAgB,UAAa,gBAAgB,QAAW;AACxD,UAAO,OAAO,gBAAgB,YAAY;AAC1C,UAAO,OAAO,gBAAgB,YAAY;;EAE9C,MAAM,OAAO,eAAoB,OAAO,UAAU;AAGlD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,IAAI,KAAK;EACX,MAAM,OAAO,eAAe;AAG5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;;CAS3B,MAAM,IAAI,KAAK,MAAM;EACjB,MAAM,OAAO,eAAe;AAG5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,QACmC,KAAK,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,OAAO,KAAK;EACd,MAAM,OAAO,eAAe;AAE5B,QAAM,KAAK,OAAO,MAAM,MADT,UACuB,OAAU;;;;;;;;;CASpD,MAAM,OAAO,KAAK,MAAM;EACpB,MAAM,OAAO,eAAe;AAG5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;AAM/B,IAAa,aAAb,MAAwB;;;;;CAKpB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,SAAS,WAAW,KAAK;EAC3B,MAAM,OAAO,wBAAwB,SAAS,UAAU;AAGxD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;;;CAU3B,MAAM,QAAQ,SAAM,WAAW,OAAO;EAClC,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAIC,QAAK;AAGrD,SADa,MADK,KAAK,OAAO,WAAW,CACZ,KAAKA,SAAM,aAAa,KAAK,uBAAuB,EAAS,OAAO,EAAE,EAAE,EAAE,UAAU;;;;;;;;CASrH,MAAM,OAAO,QAAQ,OAAO;EACxB,MAAM,OAAO,sBAAsB;EACnC,MAAM,SAAS;EACf,MAAM,OAAO,EACF,OACV;AAED,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,UAAU,QAAQ,MAAM;EAC1B,MAAM,OAAO,sBAAsB;EACnC,MAAM,SAAS;EACf,MAAM,OAAO,EACH,MACT;AAED,SADY,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK;;;;;;AChJ/D,SAAgB,iBAAiB;AAI7B,QAFe,IAAI,OAAO,EAAE,KADhBC,QAAU,gBAAgB,GAAG,EACH,CAAC,CAEzB,KAAK,UAAU,GAAG,GAAG;;AAEvC,SAAgB,cAAc;AAG1B,QADiB,IAAI,OAAO;EAAE,KADjBA,QAAU,gBAAgBA,QAAU,sBAAsB;EAC9B,MAAM,OAAO;EAAc,CAAC,CACrD;;AAEpB,IAAa,QAAb,MAAmB;;;;;CAKf,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,IAAI,SAAM,OAAO,SAAS;EAC5B,MAAM,OAAO,gBAAgBC,QAAK,cAAc;AAGhD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;;CAS3B,MAAM,QAAQ,MAAM,OAAO;EACvB,MAAM,OAAO;EACb,MAAM,OAAO,EACT,KAAK,MACR;AACD,MAAI,UAAU,OACV,MAAK,YAAY;AAIrB,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,QACmC,KAAK,EACtC,MAAM;;;;;;;;AAQ/B,IAAa,aAAb,MAAwB;;;;;CAKpB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,IAAI,SAAM;EACZ,MAAM,OAAO,eAAeA;AAI5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,KAAK,MAAM;EACb,MAAM,SAAS,IAAI,iBAAiB;AACpC,MAAI,SAAS,OACT,QAAO,OAAO,QAAQ,KAAK;EAE/B,MAAM,OAAO,eAAe,OAAO,UAAU;AAI7C,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;;CAO3B,MAAM,OAAO,SAAM;EACf,MAAM,OAAO,eAAeA;AAG5B,QAAM,KAAK,OAAO,MAAM,MADT,UADF,KAE8B;;;;;CAK/C,MAAM,KAAK,IAAI,UAAU,EAAE,EAAE;EACzB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;EACxB,MAAM,YAAY,KAAK,QAAQ,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK;EAC1E,MAAM,YAAY,KAAK,QAAQ,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK;EAC1E,MAAM,kBAAkB,KAAK,QAAQ,oBAAoB,QAAQ,OAAO,KAAK,IAAI,KAAK;AACtF,QAAM,MAAM,KAAK,GAAG,cAAc,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,UAAU,MAC7H,OAAM,KAAK,KAAK,GAAG,SAAS,SAAS,QAAQ;AAEjD,MAAI,GAAG,SAAS,KACZ,QAAO;EAEX,IAAI,UAAU;AACd,SAAO,MAAM;AACT,QAAK,MAAM,KAAK,IAAI,GAAG,KAAK;GAC5B,MAAM,QAAQ,KAAK,IAAI,UAAU,KAAK,IAAI,UAAU,KAAK,UAAU,eAAe,CAAC;AACnF;AACA,OAAI,GAAG,SAAS,KACZ,QAAO;AAEX,SAAM,IAAI,SAAS,YAAY,WAAW,SAAS,MAAM,CAAC;AAC1D,IAAC,KAAK,QAAQ,YAAY,QAAQ,OAAO,KAAK,KAAa,GAAG,gBAAgB;;;;;;;AAO1F,IAAa,YAAb,MAAuB;;;;;CAKnB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,IAAI,KAAK;EACX,MAAM,OAAO,eAAe;AAI5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;AAM/B,IAAa,YAAb,MAAuB;;;;;CAKnB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,IAAI,KAAK;EACX,MAAM,OAAO,eAAe;AAI5B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,KAAK,MAAM;EACb,MAAM,OAAO,WAAW,KAAK,KAAK,QAAQ,OAAO,MAAM,CAAC,KAAK,IAAI;AAIjE,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OADF,KAE0C,EACtC,MAAM;;;;;;;;;;CAU3B,MAAM,MAAM,KAAK,IAAI,QAAQ;EACzB,MAAM,OAAO;EACb,MAAM,OAAO,EACJ,KACR;AACD,MAAI,OAAO,OACP,MAAK,KAAK;AAEd,MAAI,WAAW,OACX,MAAK,SAAS;AAIlB,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,QACmC,KAAK,EACtC,MAAM;;;AAG/B,IAAa,SAAb,MAAoB;;;;;CAKhB,YAAY,QAAQ;AAChB,OAAK,SAAS;;CAElB,MAAM,MAAM;AAIR,SAAO,OADK,MAAM,KAAK,OAAO,MAFjB,WACE,OACmC,KAAK,EACtC,MAAM;;;;;;AClO/B,IAAI;CACH,SAAU,OAAK;CACZ,SAASC,SAAO,EAAE,KAAK,MAAM,QAAQ,aAAa,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,UAAU,UAAU,OAAO,QAAQ,MAAM,OAAO,OAAO,cAAe;EAC5I,MAAM,KAAK,QAAQ,UAAU,MAAM,SAAS,MAAM,EAAE;EACpD,MAAM,MAAM;EACZ,MAAM,MAAM,KAAK;AACjB,MAAI,KAAK,SAAS,SAAS,UAAU,IAAI,KAAK,SAAS,EACnD,OAAM,IAAI,MAAM,GAAG,KAAK,OAAO,0CAA0C;AAE7E,MAAI,IAAI,IAAI,KAAK,CAAC,OAAO,KAAK,OAC1B,OAAM,IAAI,MAAM,gBAAgB,KAAK,iBAAiB;EAE1D,IAAI;AACJ,MAAI,SAAS,OACT,KAAI,KAAK,WAAW,EAChB,SAAQ;MAGR,SAAQ,MAAM,KAAK,OAAO;MAI9B,SAAQ,CAAC;AAEb,MAAI,KAAK,SAAS,GACd;OAAI,QAAQ,KAAK,QAAQ,KAAK,OAC1B,OAAM,IAAI,MAAM,gBAAgB,MAAM,eAAe,OAAO;aAI5D,SAAS,EACT,OAAM,IAAI,MAAM,gBAAgB,MAAM,cAAc;EAG5D,MAAM,MAAM;GACR,GAAG;GACH,GAAG;GACH,GAAG;GACH,GAAG;GACH,IAAI;GACJ,GAAG,KAAK;GACR,GAAG;GACH,IAAI,MAAM,SAAS,GAAG;GACtB,GAAG;GACH,GAAG;GACN;EACD,MAAM,WAAW,IAAI,SAAS,EAAE,MAAM,EAAE,IAAI;AAC5C,MAAI,IAAI,SAAS;AACjB,MAAI,IAAI,SAAS;AACjB,SAAO,IAAI,OAAO,IAAI;;AAE1B,OAAI,SAASA;GACd,QAAQ,MAAM,EAAE,EAAE;;;;;AClDrB,IAAa,kBAAb,MAA6B;AAE7B,gBAAgB,SAAS;AACzB,gBAAgB,WAAW;;;;AAI3B,IAAa,cAAb,MAAyB;;;;;CAKrB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,KAAK,QAAQ,EAAE,EAAE;EACnB,MAAM,OAAO;EACb,MAAM,QAAQ,MAAM,WAAW,SAAY,EAAE,GAAG,MAAM;EACtD,MAAM,OAAO,MAAM,SAAS,SAAY,EAAE,GAAG,MAAM;EACnD,MAAM,QAAQ,MAAM,UAAU,SAAY,KAAK,MAAM;EAErD,MAAM,OAAO;GACT,QAAQ;GACF;GACN,MAJS,MAAM,SAAS,SAAY,IAAI,MAAM;GAKvC;GACV;AAGD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,QACmC,MAAM,OAAU,EACjD,MAAM;;CAE3B,MAAM,IAAI,MAAM,cAAc,OAAO;EACjC,MAAM,OAAO,gBAAgB;EAC7B,MAAM,SAAS;EACf,MAAM,UAAU,cACV,IAAI,QAAQ,EAAE,QAAQ,yBAAyB,CAAC,GAChD,IAAI,QAAQ,EAAE,QAAQ,oBAAoB,CAAC;EACjD,MAAM,MAAM,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,MAAM,QAAQ;AAChE,SAAO,cAAc,MAAM,IAAI,MAAM,GAAG,MAAM,IAAI,MAAM;;;;;;;;CAQ5D,MAAM,OAAO,MAAM;EACf,MAAM,OAAO,gBAAgB;AAE7B,QAAM,KAAK,OAAO,MAAM,MADT,UACuB,OAAU;;;;;;;;;CASpD,MAAM,MAAM,IAAI,MAAM;EAClB,MAAM,OAAO,eAAe,GAAG,GAAG;AAGlC,UADY,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EAC5C,MAAM;;;;;CAKrB,MAAM,MAAM,SAAM,MAAM;EACpB,IAAI,IAAI;EACR,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAIC,QAAK;AAErD,MADgB,IAAI,MAAM,MAAM,UAAa,IAAI,MAAM,EAAE,SAAS,KAAK,CAGnE,OAAM,IAAI,MAAM,qCAAqC;AAEzD,MAAI,CAAC,KAAK,OAAO,QACb,OAAM,IAAI,MAAM,uBAAuB;EAE3C,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,IAAI;EAC3C,MAAM,GAAG,WAAW,OAAO,QAAQ,OAAO,OAAO,OAAO,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAK,EAAE,QAAQ,QAAQ,OAAO,KAAK,IAAI,sBAAK,IAAI,MAAM,EAAC,aAAa,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC,CAAC;EACjM,MAAM,GAAG,QAAQ,OAAO,QAAQ;GAC5B,GAAG,QAAQ,UAAU,MAAM,QAAW,QAAQ,MAAM,EAAE;GACtD,GAAG;GACH,GAAG,KAAK;GACR,IAAI,KAAK,KAAK,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI;GACtD,IAAI,KAAK;GACT,GAAG,KAAK;GACR,GAAG;GACH,GAAG,KAAK;GACR,GAAG,KAAK;GACX,CAAC;EACF,MAAM,GAAG,OAAO,OAAO,QAAQ;GAC3B,GAAG,QAAQ,UAAU,MAAM,QAAW,QAAQ,MAAM,EAAE;GACtD,GAAG,KAAK;GACR,GAAG;GACH,GAAG,KAAK;GACR,GAAG;GACH,IAAI,KAAK;GACT,IAAI,QAAQ;GACf,CAAC;EACF,MAAM,KAAK,SAAS,IAAI,MAAM,GAAG,GAAG;EACpC,MAAM,MAAM,SAAS;GACjB,KAAK,IAAI;GACT,IAAI,KAAK;GACT,MAAM,CACF;IACI,GAAG,IAAI;IACP,GAAG,IAAI;IACP,GAAG,IAAI;IACV,CACJ;GACD,KAAK,IAAI,MAAM;GACf,SAAS;GACT,MAAM;GACT,CAAC;EACF,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE,IAAI,IAAI,CAAC;EAC1C,MAAM,OAAO,gBAAgB,IAAI,KAAK;EACtC,MAAM,SAAS;EACf,MAAM,OAAO;GACH;GACD;GACL,KAAK,IAAI;GACT;IACC,OAAO,OAAO,OAAO,QAAQ;GACjC;EAED,MAAM,KAAK,OADC,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK,EAClC,MAAM;AAC3B,SAAO;GACH,MAAM,IAAI,OAAO,KAAK;GACtB,KAAK,IAAI,OAAO,IAAI;GACpB;GACA;GACH;;;;;;;;;;CAUL,MAAM,OAAO,SAAM,MAAM,UAAU;EAC/B,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAIA,QAAK;EACrD,MAAM,MAAM,IAAI;EAChB,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,QAAQ,MAAM,EAAE;EAC9D,MAAM,KAAK,aAAa,QAAQ,aAAa,KAAK,IAAI,4BAAW,IAAI,MAAM,EAAC,aAAa,CAAC,QAAQ,KAAK,YAAY;EACnH,MAAM,OAAO,MAAM,KAAK,IAAI,KAAK;EACjC,IAAI;AACJ,MAAI,QAAQ,KAAK,OAAO,KAAK,IAAI,OAAO,OACpC,cAAa,KAAK,IAAI;WAEjB,QAAQ,KAAK,OAAO,KAAK,IAAI,OAAO,OACzC,cAAa,KAAK,IAAI;MAGtB,OAAM,IAAI,MAAM,iDAAiD;EAGrE,MAAM,OAAO;GACT,GAAG;GACH,GAAG,KAAK;GACR,GAAG;GACH,GAAG;GACH,GAAG;GACH,IAAI;GACJ,GAAG,KAAK,OAAO;GACX;GACP;EACD,MAAM,GAAG,OAAO,OAAO,QAAQ,KAAK;EAEpC,IAAI,MAAM,EAAE;EACZ,IAAI,OAAO,EAAE;EACb,MAAM,QAAQ,IAAI;AAClB,MAAI,MAAM,MAAM,UAAa,MAAM,EAAE,SAAS,KAAK,EAC/C,IAAI,UAAU;OAGd,IAAI,UAAU;EAElB,MAAM,KAAK,SAAS,MAAM,GAAG,GAAG;EAChC,MAAM,MAAM,MAAM;EAClB,MAAM,OAAO,CACT;GACI,GAAG,IAAI;GACP,GAAG,IAAI;GACP,GAAG,IAAI;GACV,CACJ;EACD,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,IAAI;AAC3C,MAAI,QAEA,OAAM,IAAI,MAAM,qCAAqC;OAEpD;GACD,MAAM,SAAS,SAAS;IACf;IACL,IAAI,KAAK;IACH;IACD;IACL,SAAS;IACT,MAAM;IACT,CAAC;AACF,UAAO,MAAM,OAAO,KAAK,EAAE,OAAO,IAAI,CAAC;AACvC,SAAM,OAAO;;EAEjB,MAAM,OAAO;GACJ;GACA;GACC;IACL,OAAO,OAAO,OAAO,QAAQ;GACjC;EACD,MAAM,OAAO,gBAAgBA,QAAK,eAAe;EAGjD,MAAM,KAAK,OADC,MAAM,KAAK,OAAO,MAAM,MADrB,UACmC,KAAK,EAClC,MAAM;AAC3B,SAAO;GACH,KAAK,IAAI,OAAO,IAAI;GACpB,KAAK,IAAI,OAAO,IAAI;GACpB;GACH;;;AAGT,IAAa,iBAAb,MAA4B;CACxB,YAAY,QAAQ,QAAQ,MAAM,SAAS;AACvC,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,QAAQ;AACb,OAAK,UAAU;;CAEnB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,IAAI,SAAS;AACT,SAAO,KAAK;;CAEhB,IAAI,OAAO;AACP,SAAO,KAAK;;CAEhB,MAAM,KAAK;AAEP,SAAO,OADK,MAAM,KAAK,SACN,MAAM;;;;;;AAM/B,IAAa,aAAb,MAAwB;;;;;CAKpB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,KAAK,SAAM;EACb,MAAM,OAAO,gBAAgBA,QAAK;AAGlC,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,OAAO,EAAE,eAAM,cAAc,YAAY,MAAM,OAAO,GAAG,OAAO,EAAE,EAAE,SAAU;EAChF,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAIA,QAAK;EACrD,MAAM,MAAM,IAAI;EAChB,MAAM,OAAO,EAAE;AACf,MAAI,UACA,MAAK,KAAK,SAAS,UAAU;EAEjC,MAAM,QAAQ,IAAI;EAClB,MAAM,UAAU,MAAM,MAAM,UAAa,MAAM,EAAE,SAAS,KAAK;AAC/D,MAAI,QACA,MAAK,KAAK,SAAS,QAAQ;EAE/B,MAAM,SAAS,IAAI,OAAO;GAAE;GAAK;GAAM;GAAM;GAAO;GAAM,CAAC;AAC3D,MAAI,QACA,OAAM,IAAI,MAAM,qCAAqC;OAEpD;GACD,MAAMC,UAAQ,IAAI;GAClB,MAAM,KAAK,SAASA,QAAM,GAAG,GAAG;GAChC,MAAM,MAAMA,QAAM;GAClB,MAAM,OAAO,CACT;IACI,GAAG,OAAO;IACV,GAAG;IACH,GAAG,OAAO;IACb,CACJ;GACD,MAAM,SAAS,SAAS;IACf;IACL,IAAI,KAAK;IACH;IACD;IACL,SAAS;IACT,MAAM,QAAQ;IACjB,CAAC;GAEF,MAAM,OAAO,MADE,KAAK,OAAO,QAAQ,IAAI,IAAI,CACjB,KAAK,EAAE,OAAO,IAAI,CAAC;AAE7C,UAAO,IAAI,eAAe,QAAQ,QAAQ,MAD9B,KAAK,iBAAiB,KAAKD,SAAM,cAAc,OAAO,KAAK,OAAO,KAAK,KAAK,CACpC;;;CAG5D,iBAAiB,KAAK,SAAM,cAAc,KAAK,KAAK,MAAM;EACtD,MAAM,OAAO,gBAAgBA,QAAK;EAClC,MAAM,SAAS;EACf,MAAM,OAAO;GACT,MAAM;GACD;GACA;GACC;GACT;EACD,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,IAAI;AAC3C,OAAK,OAAO,QAAQ,OAAO,QAAQ;AACnC,SAAO,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK;;;;;;;;;;CAUhD,MAAM,OAAO,SAAM,cAAc,SAAS;EACtC,MAAM,OAAO,gBAAgBA,QAAK,cAAc;EAChD,MAAM,SAAS;EACf,MAAM,OAAO,EACT,MAAM,SACT;AAED,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK,EACtC,MAAM;;;;;;AAM/B,IAAa,UAAb,MAAqB;;;;;CAKjB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,IAAI,MAAM;EACZ,MAAM,OAAO,WAAW;AAGxB,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;CAO3B,MAAM,OAAO;AAIT,SAAO,OADK,MAAM,KAAK,OAAO,MAFjB,WACE,OACmC,KAAK,EACtC,MAAM;;;;;;AAM/B,IAAa,OAAb,MAAkB;;;;;CAKd,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;CAKlB,MAAM,MAAM,MAAM;EACd,IAAI,IAAI;EACR,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAI,KAAK,WAAW;EAChE,MAAM,OAAO;GACT,IAAI,KAAK,KAAK,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK;GACxD,GAAG,KAAK;GACR,IAAI,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;GAChE;AACD,SAAO,KAAK,OACP,WAAW,CACX,sBAAsB,KAAK,eAAe,MAAM,EAAE,EAAE,KAAK,WAAW,KAAK,UAAU,OAAU;;CAEtG,MAAM,YAAY,SAAM,KAAK,MAAM;EAC/B,MAAM,OAAO;GACT,KAAK,IAAI;GACT;GACH;AAED,UADiB,MAAM,KAAK,OAAO,MAAM,gBAAgBA,QAAK,cAAc,QAAQ,KAAK,EACzE,MAAM;;;;;CAK1B,MAAM,MAAM,MAAM;EACd,IAAI;EACJ,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAI,KAAK,WAAW;EAChE,MAAM,OAAO,EACT,IAAI,KAAK,KAAK,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAC3D;AACD,SAAO,KAAK,OACP,WAAW,CACX,sBAAsB,KAAK,eAAe,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,OAAU,EAAE,EAAE,KAAK,WAAW,KAAK,UAAU,KAAK,UAAU;;CAEzI,MAAM,YAAY,SAAM,KAAK,MAAM,KAAK;EACpC,MAAM,OAAO;GACT,KAAK,IAAI;GACT;GACA;GACH;AAED,UADiB,MAAM,KAAK,OAAO,MAAM,gBAAgBA,QAAK,cAAc,QAAQ,KAAK,EACzE,MAAM;;;;;CAK1B,MAAM,MAAM,MAAM;EACd,IAAI;EACJ,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAI,KAAK,WAAW;EAChE,MAAM,OAAO,EACT,IAAI,KAAK,KAAK,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAC3D;AACD,SAAO,KAAK,OACP,WAAW,CACX,sBAAsB,KAAK,eAAe,MAAM,EAAE,EAAE,KAAK,WAAW,KAAK,UAAU,KAAK,UAAU;;CAE3G,MAAM,YAAY,SAAM,KAAK,MAAM;EAC/B,MAAM,OAAO;GACT,KAAK,IAAI;GACT;GACH;AAED,UADiB,MAAM,KAAK,OAAO,MAAM,gBAAgBA,QAAK,cAAc,QAAQ,KAAK,EACzE,MAAM;;;;;CAK1B,MAAM,MAAM,MAAM;EACd,IAAI;EACJ,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAI,KAAK,WAAW;EAChE,MAAM,OAAO,EACT,IAAI,KAAK,KAAK,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAC3D;EACD,IAAI,MAAM,KAAK;AACf,MAAI,QAAQ,QAAW;GAGnB,MAAM,UADO,MADE,KAAK,OAAO,QAAQ,IAAI,IAAI,CACjB,KAAK,EAAE,KAAK,IAAI,IAAI,CAAC,EAC3B,KAAK,QAAQ,IAAI,MAAM,EAAE,MAAM,KAAK,CAAC,CAAC;AAE1D,SADY,EAAE,UAAU,KAAK,KAAK,OAAO,CAAC,CAChC,UAAU,KAAK,IAAI,KAAK;;EAEtC,MAAM,UAAU,KAAK,mBAAmB,SAClC,EAAE,wBAAwB,KAAK,IAAI,CAAC,GACpC,KAAK;EACX,MAAM,SAAS,KAAK,kBAAkB,SAChC,EAAE,0BAA0B,KAAK,IAAI,CAAC,GACtC,KAAK;EACX,MAAM,SAAS;GACX,MAAM,CAAC,KAAK,MAAM,QAAQ;GAC1B,KAAK,CAAC,KAAK,KAAK,OAAO;GACvB,KAAK,CAAC,KAAK,KAAK,IAAI;GACvB;AACD,SAAO,KAAK,OACP,WAAW,CACX,sBAAsB,KAAK,eAAe,MAAM,QAAQ,KAAK,WAAW,KAAK,UAAU,KAAK,UAAU;;CAE/G,MAAM,YAAY,SAAM,KAAK,MAAM,KAAK;EACpC,MAAM,OAAO;GACT,KAAK,IAAI;GACH;GACD;GACR;AAED,UADiB,MAAM,KAAK,OAAO,MAAM,gBAAgBA,QAAK,cAAc,QAAQ,KAAK,EACzE,MAAM;;;;;CAK1B,MAAM,MAAM,MAAM;EACd,MAAM,MAAM,MAAM,KAAK,OAAO,aAAa,CAAC,IAAI,KAAK,WAAW;EAChE,MAAM,OAAO,EACT,GAAG,KAAK,SACX;AACD,SAAO,KAAK,OACP,WAAW,CACX,sBAAsB,KAAK,eAAe,MAAM,EAAE,EAAE,KAAK,WAAW,KAAK,UAAU,KAAK,UAAU;;CAE3G,MAAM,YAAY,SAAM,KAAK,MAAM,KAAK;EACpC,MAAM,OAAO;GACT,KAAK,IAAI;GACH;GACD;GACR;AAED,UADiB,MAAM,KAAK,OAAO,MAAM,gBAAgBA,QAAK,cAAc,QAAQ,KAAK,EACzE,MAAM;;;;;;ACnhB9B,IAAa,cAAb,MAAyB;;;;;CAKrB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;;CASlB,MAAM,QAAQ,SAAM,MAAM;EACtB,MAAM,EAAE,QAAQ,MAAM,aAAa,MAAM,KAAK,OACzC,aAAa,CACb,eAAeE,SAAM,KAAK;AAE/B,SAAO,IAAI,YAAY,QAAQ,MADnB,MAAM,KAAK,OAAO,MAAM,kBAAkBA,UAAO,eAAe,QAAQ,SAAS,CACpD;;;;;;;;;AClBjD,IAAa,UAAb,MAAqB;;;;;CAKjB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,UAAU,OAAO;EACnB,MAAM,SAAS,IAAI,iBAAiB;AACpC,MAAI,UAAU,OACV,QAAO,OAAO,SAAS,MAAM;EAEjC,MAAM,OAAO,kBAAuB,OAAO,UAAU;AAGrD,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;ACrB/B,MAAM,SAAS;AACf,MAAa,QAAQ,IAAI,OAAO,OAAO;AA4EvC,IAAa,SAAb,MAAa,eAAe,OAAO;CAC/B,YAAY,EAAE,KAAK,OAAO,OAAO,WAAW,OAAO,MAAM,OAAO,MAAM;AAClE,MAAI,QAAQ,UACR,UAAU,UACV,SAAS,UACT,QAAQ,QAAW;AACnB,OAAI,SAAS,OACT,OAAM,IAAI,mBAAmB,uBAAuB;AAExD,OAAI,CADU,MAAM,KAAK,KAAK,CAE1B,OAAM,IAAI,MAAM,kBAAkB;AACtC,SAAM,OAAO,QAAQ,KAAK;;AAE9B,QAAM;GAAE;GAAK;GAAM;GAAO;GAAM;GAAK,CAAC;AACtC,MAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CACtB,OAAM,IAAI,MAAM,kBAAkB,KAAK,KAAK,cAAc;;CAElE,OAAO,QAAQ,MAAM;EACjB,MAAM,KAAK,KAAK,SAAS;EACzB,MAAM,MAAM,IAAI,MAAM;EACtB,MAAM,MAAM,IAAI,MAAM;EACtB,MAAM,MAAM,IAAI,MAAM,GAAG;AACzB,MAAI,KAAK,IAAI;EAEb,MAAM,MAAM,gBADC,IAAI,KAAK,GAAG,GAAG,KACK;AACjC,SAAO,WAAW,KAAK,IAAI,CAAC,SAAS,GAAG;;CAE5C,IAAI,OAAO;EACP,MAAM,SAAS,OAAO,MAAM,IAAI,KAAK,KAAK;EAE1C,MAAM,OAAO,gBAAgB,OADjB,WAAW,KAAK,IAAI,MAAM,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,EAChE,KAAK,IAAI,CAAC;EACnD,IAAI,KAAK;AACT,OAAK,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,QAAQ,KAAK,SAAS,QAC9E;OAAI,KAAK,OAAO,IACZ,MAAK;QAIT,QAAO,WAAW,QAAQ,WAAW,KAAK,IAAI,KAAK,IAAI,OAAO,MAAM,KAAK;AAE7E,SAAO,KAAK,UAAU,GAAG;;;;;;ACvFjC,IAAa,SAAb,MAAa,eAAe,OAAO;CAC/B,YAAY,EAAE,KAAK,OAAO,OAAO,WAAW,OAAO,MAAM,OAAO,MAAM,MAAM;AACxE,MAAI,QAAQ,UACR,SAAS,UACT,UAAU,UACV,SAAS,UACT,QAAQ,QAAW;AACnB,OAAI,SAAS,OACT,OAAM,IAAI,mBAAmB,uBAAuB;AACxD,UAAO,OAAO,SAAS,KAAK;;AAEhC,QAAM;GAAE;GAAK;GAAM;GAAO;GAAM;GAAK,EAAE,KAAK;;CAGhD,IAAI,OAAO;AACP,MAAI,CAAC,KAAK,KAAK,WAAW,IAAI,CAC1B,OAAM,IAAI,MAAM,kBAAkB;EAEtC,IAAI,OAAO,KAAK;AAChB,SAAO,KAAK,OAAO,EAAE,KAAK,IACtB,QAAO,KAAK,UAAU,EAAE;EAE5B,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,MAAI,MAAM,OAAO,GACb,QAAO;MAGP,QAAO,EAAE;;CAGjB,OAAO,SAAS,MAAM;EAClB,MAAM,OAAO,EAAE;AACf,OAAK,MAAM,KAAK,MAAM;GAClB,IAAI,KAAK;AACT,OAAI,OAAO,MAAM,SACb,MAAK,EAAE,UAAU;OAGjB,MAAK;AAGT,OAAI,CADU,MAAM,KAAK,GAAG,CAExB,OAAM,IAAI,MAAM,gCAAgC,EAAE,GAAG;AAEzD,QAAK,KAAK,GAAG;;AAEjB,SAAO,MAAM,KAAK,KAAK,IAAI;;;;;;;;;ACvEnC,IAAa,YAAb,MAAuB;;;;;CAKnB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;;;;;;;CAclB,MAAM,sBAAsB,QAAQ,OAAO,SAAS,QAAQ,WAAW,UAAU,KAAK;EAClF,MAAM,SAAS,KAAK,OAAO,QAAQ,IAAI,OAAO;EAC9C,MAAM,CAAC,KAAK,OAAO,SAAS,OAAO,SAAS,OAAO,WAAW,WAAW,UAAU,KAAK,QAAW,OAAO;AAE1G,SAAO;GAAC;GADK,MAAM,OAAO,KAAK,EAAE,IAAI,IAAI,CAAC;GACvB,EAAE,IAAI;GAAC;;;;;CAK9B,MAAM,KAAK,SAAM,OAAO,QAAQ,OAAO,SAAS,QAAQ,WAAW;AAC/D,MAAI,OAAO,cAAc,SACrB,OAAM,IAAI,MAAM,8BAA8B;EAElD,MAAM,CAAC,KAAK,MAAM,OAAO,MAAM,KAAK,sBAAsB,QAAQ,OAAO,SAAS,QAAQ,UAAU;AACpG,SAAO,MAAM,KAAK,eAAeC,SAAM,OAAO,KAAK,MAAM,IAAI;;;;;;;;;;;;;CAajE,MAAM,eAAe,SAAM,OAAO,KAAK,MAAM,KAAK;EAC9C,MAAM,OAAO,gBAAgBA,QAAK;AAQlC,SAAO,OANK,MAAM,KAAK,OAAO,MAAM,MADrB,QACmC;GAC9C,KAAK;GACL,KAAK,IAAI;GACH;GACD;GACR,CAAC,EACe,MAAM;;;;;;;;CAQ3B,MAAM,IAAI,MAAM;EACZ,MAAM,OAAO,cAAc;AAG3B,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;AAG/B,SAAgB,SAAS,OAAO,SAAS,QAAQ,WAAW,MAAM,KAAK,WAAW,QAAQ;CACtF,MAAM,KAAK,QAAQ,UAAU,MAAM,QAAW,QAAQ,MAAM,EAAE;CAC9D,MAAM,MAAM,KAAK;CACjB,MAAM,KAAK,SAAS,SACd,OACA,QAAQ,CAAC,aAAa,CAAC,QAAQ,KAAK,YAAY;CACtD,MAAM,IAAI,QAAQ,SAAY,MAAM;CACpC,MAAM,IAAI,cAAc,SAAY,YAAY,EAAE;CAClD,MAAM,MAAM,UAAU,SAAY,SAAS,EAAE;CAC7C,IAAI,IAAI,EAAE;CACV,IAAI,MAAM;AACV,QAAO,QAAQ,IAAI,CAAC,SAAS,CAAC,KAAK,WAAW;EAC1C,MAAM,SAAS,MAAM;EACrB,MAAM,MAAM,MAAM;AAClB,IAAE,OAAO,OAAO;AAChB,MAAI,OAAO,OACP;EAEJ,IAAI,SAAS;EACb,MAAM,SAAS,IAAI,OAAO,EAAE,EAAE,QAAW,CAAC,KAAK,IAAI,CAAC;AACpD,YAAU,OAAO;AACjB,YAAU;EACV,MAAM,UAAU,IAAI,QAAQ;GACxB,MAAM,OAAO;GACb,OAAO,KAAK,MAAM,OAAO,SAAS,EAAE;GACvC,CAAC;AACF,SAAO,QAAQ;AACf,SAAO;GACT;AACF,KAAI,OAAO,KAAK,EAAE,CAAC,SAAS,GAAG;AAC3B,IAAE,OAAO;AACT,KAAG,KAAK,OAAO,QAAQ,EAAE;;CAE7B,MAAM,QAAQ,EAAE;AAChB,OAAM,OAAO;CAEb,MAAM,OAAO;EACT,GAAG;EACH,GAAG;EACH,GAAG;EACH,GAAG;EACH,IAAI;EACD;EACC;EACJ,GAAG;EACA;EACH,GAXM,OAAO,OAAO,OAAO,OAAO,EAAE,EAAE,MAAM,EAAE,QAAQ;EAYnD;EACN;CACD,MAAM,GAAG,OAAO,OAAO,QAAQ,KAAK;AAEpC,QAAO,CADK,IAAI,OAAO,IAAI,EACd,EAAE,IAAI,CAAC;;;;;;;;AChIxB,IAAa,SAAb,MAAoB;;;;;CAKhB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;CAQlB,MAAM,WAAW,MAAM;EACnB,MAAM,OAAO,uBAAuB;AAGpC,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;;;;CAW3B,MAAM,YAAY,SAAM,KAAK,MAAM,KAAK;EACpC,MAAM,OAAO,gBAAgBC,QAAK;EAClC,MAAM,SAAS;EACf,MAAM,OAAO;GACJ;GACC;GACD;GACR;AAED,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK,EACtC,MAAM;;;;;;CAM3B,MAAM,KAAK,SAAM,KAAK,MAAM,KAAK,OAAO,OAAO;EAC3C,MAAM,OAAO,gBAAgBA,QAAK;EAClC,MAAM,SAAS;EACf,MAAM,OAAO;GACT,KAAK;GACL,KAAK,IAAI;GACH;GACD;GACE;GACA;GACV;AAED,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MAAM,QAAQ,KAAK,EACtC,MAAM;;;;;;;;;ACvD/B,IAAa,gBAAb,MAA2B;;;;;CAKvB,YAAY,QAAQ;AAChB,OAAK,SAAS;;;;;;;;;CASlB,MAAM,KAAK,QAAQ,GAAG,MAAM,IAAI;EAC5B,MAAM,eAAe,IAAI,SAAS;AAClC,eAAa,OAAO,SAAS,SAAS,MAAM,GAAG,MAAM;EAGrD,MAAM,MAAM,MAAM,KAAK,OAAO,MAFjB,kBACE,OACmC,MAAM,aAAa;EAErE,MAAMC,UAAQ,kBADH,IAAI,QAAQ,IAAI,gBAAgB,EACP,QAAQ;EAC5C,MAAM,QAAQ,MAAM,IAAI,MAAM;AAC9B,SAAO;GACH,OAAOA,QAAM;GACb,KAAKA,QAAM;GACX,OAAOA,QAAM;GACN;GACV;;;;;;;;CAQL,MAAM,KAAK,MAAM;EACb,MAAM,OAAO,oBAAoB;AAGjC,SAAO,OADK,MAAM,KAAK,OAAO,MAAM,MADrB,OACmC,KAAK,EACtC,MAAM;;;;;;;;CAQ3B,MAAM,OAAO,MAAM;EACf,MAAM,OAAO,oBAAoB;AAEjC,QAAM,KAAK,OAAO,MAAM,MADT,UACuB,OAAU;;;;;;AC1CxD,MAAM,mBAAmB;AACzB,IAAM,QAAN,MAAY;CACR,cAAc;AACV,OAAK,QAAQ;AACb,OAAK,aAAa;AAClB,OAAK,OAAO;AACZ,OAAK,OAAO;;;;;;;AAOpB,IAAa,gBAAb,MAA2B;;;;;;;;;CASvB,YAAY,KAAK,MAAM,OAAO,KAAK,KAAK,UAAU,kBAAkB,kBAAkB,EAAE,EAAE;AACtF,OAAK,eAAe,IAAI,WAAW,KAAK;AACxC,OAAK,cAAc,IAAI,WAAW,KAAK;AACvC,OAAK,aAAa,IAAI,UAAU,KAAK;AACrC,OAAK,aAAa,IAAI,UAAU,KAAK;AACrC,OAAK,SAAS,IAAI,MAAM,KAAK;AAC7B,OAAK,UAAU,IAAI,OAAO,KAAK;AAC/B,OAAK,eAAe,IAAI,YAAY,KAAK;AACzC,OAAK,aAAa,IAAI,UAAU,KAAK;AACrC,OAAK,UAAU,IAAI,OAAO,KAAK;AAC/B,OAAK,WAAW,IAAI,QAAQ,KAAK;AACjC,OAAK,eAAe,IAAI,YAAY,KAAK;AACzC,OAAK,cAAc,IAAI,WAAW,KAAK;AACvC,OAAK,QAAQ,IAAI,KAAK,KAAK;AAC3B,OAAK,iBAAiB,IAAI,cAAc,KAAK;AAC7C,OAAK,YAAY,IAAI,SAAS,KAAK;AACnC,OAAK,cAAc,IAAI,WAAW,KAAK;AACvC,OAAK,WAAW,IAAI,QAAQ,KAAK;AACjC,OAAK,MAAM;AACX,MAAI,KAAK,SAAS,GACd,OAAM,MAAM,6BAA6B;AAE7C,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,aAAa,IAAI,WAAW,MAAM,KAAK;AAC5C,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,UAAU;AACf,OAAK,OAAO;AACZ,OAAK,UAAU;AACf,OAAK,iBAAiB;;CAE1B,IAAI,OAAO;AACP,SAAO;GAAC,KAAK;GAAK,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM;;;;;;;CAOvD,MAAM,OAAO;EACT,IAAI,IAAI,IAAI,IAAI;EAChB,MAAM,CAAC,KAAKC,WAAS,MAAM,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;EACnI,MAAM,OAAO;GACT,KAAK,IAAI;GACT,KAAKA,OAAK;GACV,OAAO,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;GACrE,MAAM;GACN,OAAO,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;GACxE;AACD,SAAO,MAAM,MAAM,KAAK,UAAU,SAAS;GACvC,QAAQ;GACR,MAAM,KAAK,UAAU,KAAK;GAC1B,SAAS,EACL,gBAAgB,oBACnB;GACJ,CAAC;;;;;;;CAON,MAAM,QAAQ;EACV,IAAI,IAAI,IAAI,IAAI,IAAI;EACpB,MAAM,QAAQ,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;EAC5E,MAAM,MAAM,MAAM,MAAM,KAAK,MAAM,UAAU,OAAO;AACpD,MAAI,IAAI,UAAU,IACd,OAAM,IAAI,MAAM,uCAAuC,OAAO;EAElE,MAAM,OAAO,MAAM,IAAI,MAAM;EAC7B,MAAM,QAAQ,IAAI,OAAO;AACzB,QAAM,SAAS,KAAK,KAAK,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;AACnE,QAAM,cAAc,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,EAAE;AAC7E,QAAM,QAAQ,KAAK,KAAK,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK;AAC/D,QAAM,QAAQ,KAAK,KAAK,UAAU,QAAQ,OAAO,KAAK,IAAI,KAAK;AAC/D,SAAO;;;;;CAKX,MAAM,UAAU;EACZ,MAAM,QAAQ,MAAM,KAAK,OAAO;AAChC,OAAK,OAAO,MAAM;AAElB,OAAK,aAAa,IAAI,WAAW,KAAK,MAAM,KAAK,MAAM,GAAG,MAAM,WAAW;AAC3E,OAAK,WAAW,OAAO,MAAM,SAAS,SAAY,MAAM,OAAO;AAE/D,OAAK,QAAQ,IAAI,MAAM,MAAM,MAAM;AACnC,MAAI,KAAK,MAAM,UAAU,KAAK,WAAW,IACrC,OAAM,MAAM,gEAAgE;AAEhF,MAAI,KAAK,WAAW,OAAO,IAAI,KAAK,EAChC,OAAM,KAAK,mBAAmB;AAElC,OAAK,UAAU,IAAI,yBAAyB,KAAK,WAAW,QAAQ,KAAK,eAAe;AACxF,OAAK,QAAQ,IAAI,cAAc,KAAK,WAAW,QAAQ,KAAK,MAAM,OAAO;;;;;;;;;;;CAW7E,MAAM,MAAM,MAAM,QAAQ,MAAM,cAAc;EAC1C,IAAI;EACJ,MAAM,UAAU,IAAI,SAAS;EAC7B,IAAI,iBAAiB,IAAI,SAAS;EAClC,MAAM,gBAAgB,IAAI,SAAS;AACnC,UAAQ,IAAI,oBAAoB,KAAK,WAAW,IAAI;AACpD,UAAQ,IAAI,kCAAiB,IAAI,MAAM,EAAC,aAAa,CAAC,QAAQ,KAAK,YAAY,CAAC;AAChF,UAAQ,IAAI,gBAAgB,mBAAmB;EAC/C,MAAM,QAAQ,UAAU,QAAQ,OAAO,KAAK,UAAU,KAAK;AAC3D,MAAI,KAAK,MACL,kBAAiB,KAAK,MAAM,KAAK,SAAS,QAAQ,KAAK,MAAM,IAAI,CAAC,GAAG;MAGrE,OAAM,IAAI,MAAM,oCAAoC;AAExD,iBAAe,SAAS,OAAO,QAAQ;AACnC,iBAAc,IAAI,KAAK,MAAM;IAC/B;AACF,MAAI,iBAAiB,OACjB,cAAa,SAAS,OAAO,QAAQ;AACjC,iBAAc,OAAO,KAAK,MAAM;IAClC;EAEN,MAAM,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM;GAC7B;GACR,MAAM;GACN,SAAS;GACZ,CAAC;AACF,MAAI,CAAC,IAAI,IAAI;GACT,MAAM,QAAQ,MAAM,IAAI,MAAM;GAC9B,MAAM,UAAU,QAAQ,OAAO,GAAG,KAAK,KAAK,IAAI,OAAO,GAAG,IAAI,WAAW,KAAK;AAC9E,SAAM,IAAI,MAAM,QAAQ;;AAG5B,MAAI,IADkB,KAAK,KAAK,WAAW,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,SAAS,IAAI,QAAQ,IAAI,mBAAmB,EAEvH,OAAM,IAAI,MAAM,wCAAwC;AAG5D,MADqB,KAAK,MAAM,OAAO,IAAI,SAAS,QAAQ,KAAK,MAAM,IAAI,CAAC,GAAG,CAE3E,QAAO;MAGP,OAAM,IAAI,MAAM,+BAA+B;;;;;;;;;;;;;;;;CAiBvD,MAAM,oBAAoB,SAAS,KAAK,KAAK;EACzC,IAAI;EACJ,MAAM,MAAM,MAAM,KAAK,aAAa,CAAC,IAAI,QAAQ;EACjD,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EACpC,MAAM,gBAAgB,IAAI,cAAc,OAAO,QAAQ,IAAI,OAAO,QAAQ,GAAG,OAAO;EACpF,MAAM,UAAU,IAAI,QAAQ,IAAI,QAAQ;AACxC,UAAQ,IAAI,oBAAoB,IAAI,UAAU;AAC9C,UAAQ,IAAI,kCAAiB,IAAI,MAAM,EAAC,aAAa,CAAC,QAAQ,KAAK,YAAY,CAAC;AAEhF,MAAI,UADmB,cAAc,KAAK,IAAI,QAAQ,QAAQ,GAAG,KAAK,IAAI,YAAY,QAAQ,OAAO,KAAK,IAAI,KAAK,OAAO,IAAI,IAAI,IAAI,CAAC,SAAS;AAEhJ,SAAO,IAAI,QAAQ,KAAK,IAAI;;;;;;;CAOhC,MAAM,oBAAoB;EACtB,MAAM,OAAO,KAAK,WAAW,kBAAkB,KAAK,MAAM;EAC1D,MAAM,OAAO;GACT,KAAK,KAAK,WAAW,OAAO;GACtB;GACT;AACD,SAAO,MAAM,MAAM,KAAK,MAAM,YAAY,KAAK,WAAW,MAAM,aAAa;GACzE,QAAQ;GACR,MAAM,KAAK,UAAU,KAAK;GAC1B,SAAS,EACL,gBAAgB,oBACnB;GACJ,CAAC;;;;;;;;CAQN,MAAM,gBAAgB,UAAU;EAC5B,IAAI;EACJ,MAAM,QAAQ,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;EAC5E,MAAM,OAAO,EAAE,MAAM,UAAU;AAC/B,SAAO,MAAM,MAAM,KAAK,MAAM,WAAW,MAAM;GAC3C,QAAQ;GACR,MAAM,KAAK,UAAU,KAAK;GAC1B,SAAS,EACL,gBAAgB,oBACnB;GACJ,CAAC;;;;;;;CAON,MAAM,iBAAiB;EACnB,IAAI;EACJ,MAAM,QAAQ,KAAK,KAAK,gBAAgB,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG;AAC5E,SAAO,MAAM,MAAM,KAAK,MAAM,WAAW,MAAM;GAC3C,QAAQ;GACR,SAAS,EACL,gBAAgB,oBACnB;GACJ,CAAC;;;;;;;;;CASN,MAAM,OAAO,OAAO,MAAM;EACtB,MAAM,OAAO,KAAK,WAAW,OAAO,OAAO,KAAK;AAChD,SAAO,MAAM,MAAM,KAAK,MAAM,YAAY,KAAK,WAAW,KAAK;GAC3D,QAAQ;GACR,MAAM,KAAK,UAAU,KAAK;GAC1B,SAAS,EACL,gBAAgB,oBACnB;GACJ,CAAC;;;;;;CAMN,cAAc;AACV,SAAO,KAAK;;;;;;CAMhB,QAAQ;AACJ,SAAO,KAAK;;;;;;CAMhB,aAAa;AACT,SAAO,KAAK;;;;;;CAMhB,YAAY;AACR,SAAO,KAAK;;;;;;CAMhB,YAAY;AACR,SAAO,KAAK;;;;;;CAMhB,cAAc;AACV,SAAO,KAAK;;;;;;CAMhB,OAAO;AACH,SAAO,KAAK;;;;;;CAMhB,aAAa;AACT,SAAO,KAAK;;;;;;CAMhB,UAAU;AACN,SAAO,KAAK;;;;;;CAMhB,aAAa;AACT,SAAO,KAAK;;;;;;CAMhB,WAAW;AACP,SAAO,KAAK;;;;;;CAMhB,gBAAgB;AACZ,SAAO,KAAK;;;;;;CAMhB,UAAU;AACN,SAAO,KAAK;;;;;;CAMhB,SAAS;AACL,SAAO,KAAK;;;;;;CAMhB,YAAY;AACR,SAAO,KAAK;;;;;;CAMhB,cAAc;AACV,SAAO,KAAK;;;;;;CAMhB,SAAS;AACL,SAAO,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AE9YpB,mBAAeC"}