@nostrwatch/utils 0.2.0

package/dist/browser/node_modules/.pnpm/@scure_base@1.1.1/node_modules/@scure/base/lib/esm/index.amd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.amd.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@scure+base@1.1.1/node_modules/@scure/base/lib/esm/index.js"],"sourcesContent":["/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction chain(...args) {\n    const wrap = (a, b) => (c) => a(b(c));\n    const encode = Array.from(args)\n        .reverse()\n        .reduce((acc, i) => (acc ? wrap(acc, i.encode) : i.encode), undefined);\n    const decode = args.reduce((acc, i) => (acc ? wrap(acc, i.decode) : i.decode), undefined);\n    return { encode, decode };\n}\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\nfunction convertRadix(data, from, to) {\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            digits[i] = Math.floor(digitBase / to);\n            if (!Number.isSafeInteger(digits[i]) || digits[i] * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!digits[i])\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = (from, to) => from + (to - gcd(from, to));\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\n    }\n    let carry = 0;\n    let pos = 0;\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        carry &= 2 ** pos - 1;\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of strings');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\nfunction radix2(bits, revPadding = false) {\n    assertNumber(bits);\n    if (bits <= 0 || bits > 32)\n        throw new Error('radix2: bits should be in (0..32]');\n    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n        throw new Error('radix2: carry overflow');\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of strings');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-len);\n            for (let i = 0; i < len; i++)\n                if (newChecksum[i] !== oldChecksum[i])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\nexport const utils = { alphabet, chain, checksum, radix, radix2, join, padding };\nexport const base16 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64url = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexport const base58xmr = {\n    encode(data) {\n        let res = '';\n        for (let i = 0; i < data.length; i += 8) {\n            const block = data.subarray(i, i + 8);\n            res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], '1');\n        }\n        return res;\n    },\n    decode(str) {\n        let res = [];\n        for (let i = 0; i < str.length; i += 11) {\n            const slice = str.slice(i, i + 11);\n            const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n            const block = base58.decode(slice);\n            for (let j = 0; j < block.length - blockLen; j++) {\n                if (block[j] !== 0)\n                    throw new Error('base58xmr: wrong padding');\n            }\n            res = res.concat(Array.from(block.slice(block.length - blockLen)));\n        }\n        return Uint8Array.from(res);\n    },\n};\nexport const base58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\nconst BECH_ALPHABET = chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre) {\n    const b = pre >> 25;\n    let chk = (pre & 0x1ffffff) << 5;\n    for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n        if (((b >> i) & 1) === 1)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\nfunction bechChecksum(prefix, words, encodingConst = 1) {\n    const len = prefix.length;\n    let chk = 1;\n    for (let i = 0; i < len; i++) {\n        const c = prefix.charCodeAt(i);\n        if (c < 33 || c > 126)\n            throw new Error(`Invalid prefix (${prefix})`);\n        chk = bech32Polymod(chk) ^ (c >> 5);\n    }\n    chk = bech32Polymod(chk);\n    for (let i = 0; i < len; i++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\nfunction genBech32(encoding) {\n    const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n    const _words = radix2(5);\n    const fromWords = _words.decode;\n    const toWords = _words.encode;\n    const fromWordsUnsafe = unsafeWrapper(fromWords);\n    function encode(prefix, words, limit = 90) {\n        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        prefix = prefix.toLowerCase();\n        return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        str = lowered;\n        const sepIndex = str.lastIndexOf('1');\n        if (sepIndex === 0 || sepIndex === -1)\n            throw new Error(`Letter \"1\" must be present between prefix and data only`);\n        const prefix = str.slice(0, sepIndex);\n        const _words = str.slice(sepIndex + 1);\n        if (_words.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(_words).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!_words.endsWith(sum))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = genBech32('bech32');\nexport const bech32m = genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(', ')}`;\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!(bytes instanceof Uint8Array))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString;\nexport const stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\nexport const bytes = stringToBytes;\n"],"names":["assertNumber","n","Number","isSafeInteger","Error","chain","args","wrap","a","b","c","encode","Array","from","reverse","reduce","acc","i","undefined","decode","alphabet","digits","isArray","length","map","input","letter","index","indexOf","join","separator","to","split","padding","bits","chr","data","push","end","slice","normalize","fn","convertRadix","pos","res","forEach","d","carry","done","digit","digitBase","Math","floor","gcd","radix2carry","convertRadix2","mask","radix2","revPadding","bytes","Uint8Array","unsafeWrapper","apply","e","base16","base32","s","toUpperCase","replace","base64","base64url","genBase58","abc","radix","num","base58","XMR_BLOCK_LEN","base58xmr","block","subarray","padStart","str","blockLen","j","concat","BECH_ALPHABET","POLYMOD_GENERATORS","bech32Polymod","pre","chk","bechChecksum","prefix","words","encodingConst","len","charCodeAt","v","genBech32","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","limit","TypeError","lowered","toLowerCase","sepIndex","lastIndexOf","sum","endsWith","actualLength","decodeToBytes","decodeUnsafe","bech32","utf8","TextDecoder","TextEncoder","hex","CODERS","Object","keys"],"mappings":";oEACO,SAASA,aAAaC,GACzB,IAAKC,OAAOC,cAAcF,GACtB,MAAM,IAAIG,MAAM,kBAAkBH,IAC1C,CACA,SAASI,SAASC,GACd,MAAMC,KAAO,CAACC,EAAGC,IAAOC,GAAMF,EAAEC,EAAEC,IAKlC,MAAO,CAAEC,OAJMC,MAAMC,KAAKP,GACrBQ,UACAC,QAAO,CAACC,EAAKC,IAAOD,EAAMT,KAAKS,EAAKC,EAAEN,QAAUM,EAAEN,aAASO,GAE/CC,OADFb,EAAKS,QAAO,CAACC,EAAKC,IAAOD,EAAMT,KAAKS,EAAKC,EAAEE,QAAUF,EAAEE,aAASD,GAEnF,CACA,SAASE,SAASA,GACd,MAAO,CACHT,OAASU,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,uDACpB,OAAOiB,EAAOG,KAAKP,IAEf,GADAjB,aAAaiB,GACTA,EAAI,GAAKA,GAAKG,EAASG,OACvB,MAAM,IAAInB,MAAM,iCAAiCa,gBAAgBG,EAASG,WAC9E,OAAOH,EAASH,EAAE,GACpB,EAENE,OAASM,IACL,IAAKb,MAAMU,QAAQG,IAAWA,EAAMF,QAA8B,iBAAbE,EAAM,GACvD,MAAM,IAAIrB,MAAM,oDACpB,OAAOqB,EAAMD,KAAKE,IACd,GAAsB,iBAAXA,EACP,MAAM,IAAItB,MAAM,uCAAuCsB,KAC3D,MAAMC,EAAQP,EAASQ,QAAQF,GAC/B,IAAgB,IAAZC,EACA,MAAM,IAAIvB,MAAM,oBAAoBsB,gBAAqBN,KAC7D,OAAOO,CAAK,GACd,EAGd,CACA,SAASE,KAAKC,EAAY,IACtB,GAAyB,iBAAdA,EACP,MAAM,IAAI1B,MAAM,mCACpB,MAAO,CACHO,OAASE,IACL,IAAKD,MAAMU,QAAQT,IAAUA,EAAKU,QAA6B,iBAAZV,EAAK,GACpD,MAAM,IAAIT,MAAM,gDACpB,IAAK,IAAIa,KAAKJ,EACV,GAAiB,iBAANI,EACP,MAAM,IAAIb,MAAM,iCAAiCa,KACzD,OAAOJ,EAAKgB,KAAKC,EAAU,EAE/BX,OAASY,IACL,GAAkB,iBAAPA,EACP,MAAM,IAAI3B,MAAM,sCACpB,OAAO2B,EAAGC,MAAMF,EAAU,EAGtC,CACA,SAASG,QAAQC,EAAMC,EAAM,KAEzB,GADAnC,aAAakC,GACM,iBAARC,EACP,MAAM,IAAI/B,MAAM,gCACpB,MAAO,CACH,MAAAO,CAAOyB,GACH,IAAKxB,MAAMU,QAAQc,IAAUA,EAAKb,QAA6B,iBAAZa,EAAK,GACpD,MAAM,IAAIhC,MAAM,mDACpB,IAAK,IAAIa,KAAKmB,EACV,GAAiB,iBAANnB,EACP,MAAM,IAAIb,MAAM,oCAAoCa,KAC5D,KAAQmB,EAAKb,OAASW,EAAQ,GAC1BE,EAAKC,KAAKF,GACd,OAAOC,CACV,EACD,MAAAjB,CAAOM,GACH,IAAKb,MAAMU,QAAQG,IAAWA,EAAMF,QAA8B,iBAAbE,EAAM,GACvD,MAAM,IAAIrB,MAAM,mDACpB,IAAK,IAAIa,KAAKQ,EACV,GAAiB,iBAANR,EACP,MAAM,IAAIb,MAAM,oCAAoCa,KAC5D,IAAIqB,EAAMb,EAAMF,OAChB,GAAKe,EAAMJ,EAAQ,EACf,MAAM,IAAI9B,MAAM,6DACpB,KAAOkC,EAAM,GAAKb,EAAMa,EAAM,KAAOH,EAAKG,IACtC,MAAQA,EAAM,GAAKJ,EAAQ,GACvB,MAAM,IAAI9B,MAAM,gDAExB,OAAOqB,EAAMc,MAAM,EAAGD,EACzB,EAET,CACA,SAASE,UAAUC,GACf,GAAkB,mBAAPA,EACP,MAAM,IAAIrC,MAAM,mCACpB,MAAO,CAAEO,OAASE,GAASA,EAAMM,OAASY,GAAOU,EAAGV,GACxD,CACA,SAASW,aAAaN,EAAMvB,EAAMkB,GAC9B,GAAIlB,EAAO,EACP,MAAM,IAAIT,MAAM,4BAA4BS,iCAChD,GAAIkB,EAAK,EACL,MAAM,IAAI3B,MAAM,0BAA0B2B,iCAC9C,IAAKnB,MAAMU,QAAQc,GACf,MAAM,IAAIhC,MAAM,sCACpB,IAAKgC,EAAKb,OACN,MAAO,GACX,IAAIoB,EAAM,EACV,MAAMC,EAAM,GACNvB,EAAST,MAAMC,KAAKuB,GAM1B,IALAf,EAAOwB,SAASC,IAEZ,GADA9C,aAAa8C,GACTA,EAAI,GAAKA,GAAKjC,EACd,MAAM,IAAIT,MAAM,kBAAkB0C,IAAI,MAEjC,CACT,IAAIC,EAAQ,EACRC,GAAO,EACX,IAAK,IAAI/B,EAAI0B,EAAK1B,EAAII,EAAOE,OAAQN,IAAK,CACtC,MAAMgC,EAAQ5B,EAAOJ,GACfiC,EAAYrC,EAAOkC,EAAQE,EACjC,IAAK/C,OAAOC,cAAc+C,IACrBrC,EAAOkC,EAASlC,IAASkC,GAC1BG,EAAYD,GAAUpC,EAAOkC,EAC7B,MAAM,IAAI3C,MAAM,gCAIpB,GAFA2C,EAAQG,EAAYnB,EACpBV,EAAOJ,GAAKkC,KAAKC,MAAMF,EAAYnB,IAC9B7B,OAAOC,cAAckB,EAAOJ,KAAOI,EAAOJ,GAAKc,EAAKgB,IAAUG,EAC/D,MAAM,IAAI9C,MAAM,gCACf4C,IAEK3B,EAAOJ,GAGb+B,GAAO,EAFPL,EAAM1B,EAGtB,CAEQ,GADA2B,EAAIP,KAAKU,GACLC,EACA,KACZ,CACI,IAAK,IAAI/B,EAAI,EAAGA,EAAImB,EAAKb,OAAS,GAAiB,IAAZa,EAAKnB,GAAUA,IAClD2B,EAAIP,KAAK,GACb,OAAOO,EAAI9B,SACf,CACA,MAAMuC,IAAM,CAAC7C,EAAGC,IAAQA,EAAQ4C,IAAI5C,EAAGD,EAAIC,GAAfD,EACtB8C,YAAc,CAACzC,EAAMkB,IAAOlB,GAAQkB,EAAKsB,IAAIxC,EAAMkB,IACzD,SAASwB,cAAcnB,EAAMvB,EAAMkB,EAAIE,GACnC,IAAKrB,MAAMU,QAAQc,GACf,MAAM,IAAIhC,MAAM,uCACpB,GAAIS,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAIT,MAAM,6BAA6BS,KACjD,GAAIkB,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI3B,MAAM,2BAA2B2B,KAC/C,GAAIuB,YAAYzC,EAAMkB,GAAM,GACxB,MAAM,IAAI3B,MAAM,sCAAsCS,QAAWkB,eAAgBuB,YAAYzC,EAAMkB,MAEvG,IAAIgB,EAAQ,EACRJ,EAAM,EACV,MAAMa,EAAO,GAAKzB,EAAK,EACjBa,EAAM,GACZ,IAAK,MAAM3C,KAAKmC,EAAM,CAElB,GADApC,aAAaC,GACTA,GAAK,GAAKY,EACV,MAAM,IAAIT,MAAM,oCAAoCH,UAAUY,KAElE,GADAkC,EAASA,GAASlC,EAAQZ,EACtB0C,EAAM9B,EAAO,GACb,MAAM,IAAIT,MAAM,qCAAqCuC,UAAY9B,KAErE,IADA8B,GAAO9B,EACA8B,GAAOZ,EAAIY,GAAOZ,EACrBa,EAAIP,MAAOU,GAAUJ,EAAMZ,EAAOyB,KAAU,GAChDT,GAAS,GAAKJ,EAAM,CAC5B,CAEI,GADAI,EAASA,GAAUhB,EAAKY,EAAQa,GAC3BvB,GAAWU,GAAO9B,EACnB,MAAM,IAAIT,MAAM,kBACpB,IAAK6B,GAAWc,EACZ,MAAM,IAAI3C,MAAM,qBAAqB2C,KAGzC,OAFId,GAAWU,EAAM,GACjBC,EAAIP,KAAKU,IAAU,GAChBH,CACX,CAgBA,SAASa,OAAOvB,EAAMwB,GAAa,GAE/B,GADA1D,aAAakC,GACTA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI9B,MAAM,qCACpB,GAAIkD,YAAY,EAAGpB,GAAQ,IAAMoB,YAAYpB,EAAM,GAAK,GACpD,MAAM,IAAI9B,MAAM,0BACpB,MAAO,CACHO,OAASgD,IACL,KAAMA,aAAiBC,YACnB,MAAM,IAAIxD,MAAM,4CACpB,OAAOmD,cAAc3C,MAAMC,KAAK8C,GAAQ,EAAGzB,GAAOwB,EAAW,EAEjEvC,OAASE,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,kDACpB,OAAOwD,WAAW/C,KAAK0C,cAAclC,EAAQa,EAAM,EAAGwB,GAAY,EAG9E,CACA,SAASG,cAAcpB,GACnB,GAAkB,mBAAPA,EACP,MAAM,IAAIrC,MAAM,uCACpB,OAAO,YAAaE,GAChB,IACI,OAAOmC,EAAGqB,MAAM,KAAMxD,EAClC,CACQ,MAAOyD,GAAG,CACb,CACL,CA6BY,MAACC,EAAS3D,MAAMoD,OAAO,GAAIrC,SAAS,oBAAqBS,KAAK,KAC7DoC,EAAS5D,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCa,QAAQ,GAAIJ,KAAK,KAC7ExB,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCa,QAAQ,GAAIJ,KAAK,KAC1ExB,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCS,KAAK,IAAKW,WAAW0B,GAAMA,EAAEC,cAAcC,QAAQ,KAAM,KAAKA,QAAQ,QAAS,QAChK,MAAAC,EAAShE,MAAMoD,OAAO,GAAIrC,SAAS,oEAAqEa,QAAQ,GAAIJ,KAAK,KACzHyC,EAAYjE,MAAMoD,OAAO,GAAIrC,SAAS,oEAAqEa,QAAQ,GAAIJ,KAAK,KACnI0C,UAAaC,GAAQnE,MA9E3B,SAASoE,MAAMC,GAEX,OADA1E,aAAa0E,GACN,CACH/D,OAASgD,IACL,KAAMA,aAAiBC,YACnB,MAAM,IAAIxD,MAAM,2CACpB,OAAOsC,aAAa9B,MAAMC,KAAK8C,GAAQ,IAAQe,EAAI,EAEvDvD,OAASE,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,iDACpB,OAAOwD,WAAW/C,KAAK6B,aAAarB,EAAQqD,EAAK,KAAQ,EAGrE,CAgEiCD,CAAM,IAAKrD,SAASoD,GAAM3C,KAAK,KACnD8C,EAASJ,UAAU,8DACJA,UAAU,8DACbA,UAAU,8DACnC,MAAMK,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,IACnCC,EAAY,CACrB,MAAAlE,CAAOyB,GACH,IAAIQ,EAAM,GACV,IAAK,IAAI3B,EAAI,EAAGA,EAAImB,EAAKb,OAAQN,GAAK,EAAG,CACrC,MAAM6D,EAAQ1C,EAAK2C,SAAS9D,EAAGA,EAAI,GACnC2B,GAAO+B,EAAOhE,OAAOmE,GAAOE,SAASJ,EAAcE,EAAMvD,QAAS,IAC9E,CACQ,OAAOqB,CACV,EACD,MAAAzB,CAAO8D,GACH,IAAIrC,EAAM,GACV,IAAK,IAAI3B,EAAI,EAAGA,EAAIgE,EAAI1D,OAAQN,GAAK,GAAI,CACrC,MAAMsB,EAAQ0C,EAAI1C,MAAMtB,EAAGA,EAAI,IACzBiE,EAAWN,EAAchD,QAAQW,EAAMhB,QACvCuD,EAAQH,EAAOxD,OAAOoB,GAC5B,IAAK,IAAI4C,EAAI,EAAGA,EAAIL,EAAMvD,OAAS2D,EAAUC,IACzC,GAAiB,IAAbL,EAAMK,GACN,MAAM,IAAI/E,MAAM,4BAExBwC,EAAMA,EAAIwC,OAAOxE,MAAMC,KAAKiE,EAAMvC,MAAMuC,EAAMvD,OAAS2D,IACnE,CACQ,OAAOtB,WAAW/C,KAAK+B,EAC1B,GAGCyC,EAAgBhF,MAAMe,SAAS,oCAAqCS,KAAK,KACzEyD,EAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,WAC5E,SAASC,cAAcC,GACnB,MAAM/E,EAAI+E,GAAO,GACjB,IAAIC,GAAa,SAAND,IAAoB,EAC/B,IAAK,IAAIvE,EAAI,EAAGA,EAAIqE,EAAmB/D,OAAQN,IACpB,IAAjBR,GAAKQ,EAAK,KACZwE,GAAOH,EAAmBrE,IAElC,OAAOwE,CACX,CACA,SAASC,aAAaC,EAAQC,EAAOC,EAAgB,GACjD,MAAMC,EAAMH,EAAOpE,OACnB,IAAIkE,EAAM,EACV,IAAK,IAAIxE,EAAI,EAAGA,EAAI6E,EAAK7E,IAAK,CAC1B,MAAMP,EAAIiF,EAAOI,WAAW9E,GAC5B,GAAIP,EAAI,IAAMA,EAAI,IACd,MAAM,IAAIN,MAAM,mBAAmBuF,MACvCF,EAAMF,cAAcE,GAAQ/E,GAAK,CACzC,CACI+E,EAAMF,cAAcE,GACpB,IAAK,IAAIxE,EAAI,EAAGA,EAAI6E,EAAK7E,IACrBwE,EAAMF,cAAcE,GAA+B,GAAvBE,EAAOI,WAAW9E,GAClD,IAAK,IAAI+E,KAAKJ,EACVH,EAAMF,cAAcE,GAAOO,EAC/B,IAAK,IAAI/E,EAAI,EAAGA,EAAI,EAAGA,IACnBwE,EAAMF,cAAcE,GAExB,OADAA,GAAOI,EACAR,EAAc1E,OAAO4C,cAAc,CAACkC,EAAM,GAAK,IAAK,GAAI,GAAG,GACtE,CACA,SAASQ,UAAUC,GACf,MAAMC,EAA8B,WAAbD,EAAwB,EAAI,UAC7CE,EAAS3C,OAAO,GAChB4C,EAAYD,EAAOjF,OACnBmF,EAAUF,EAAOzF,OACjB4F,EAAkB1C,cAAcwC,GAYtC,SAASlF,OAAO8D,EAAKuB,EAAQ,IACzB,GAAmB,iBAARvB,EACP,MAAM,IAAI7E,MAAM,oDAAoD6E,GACxE,GAAIA,EAAI1D,OAAS,IAAgB,IAAViF,GAAmBvB,EAAI1D,OAASiF,EACnD,MAAM,IAAIC,UAAU,wBAAwBxB,EAAI1D,WAAW0D,oBAAsBuB,MACrF,MAAME,EAAUzB,EAAI0B,cACpB,GAAI1B,IAAQyB,GAAWzB,IAAQA,EAAId,cAC/B,MAAM,IAAI/D,MAAM,yCAEpB,MAAMwG,GADN3B,EAAMyB,GACeG,YAAY,KACjC,GAAiB,IAAbD,IAAiC,IAAfA,EAClB,MAAM,IAAIxG,MAAM,2DACpB,MAAMuF,EAASV,EAAI1C,MAAM,EAAGqE,GACtBR,EAASnB,EAAI1C,MAAMqE,EAAW,GACpC,GAAIR,EAAO7E,OAAS,EAChB,MAAM,IAAInB,MAAM,2CACpB,MAAMwF,EAAQP,EAAclE,OAAOiF,GAAQ7D,MAAM,MAC3CuE,EAAMpB,aAAaC,EAAQC,EAAOO,GACxC,IAAKC,EAAOW,SAASD,GACjB,MAAM,IAAI1G,MAAM,uBAAuB6E,gBAAkB6B,MAC7D,MAAO,CAAEnB,SAAQC,QACzB,CAMI,MAAO,CAAEjF,OAtCT,SAASA,OAAOgF,EAAQC,EAAOY,EAAQ,IACnC,GAAsB,iBAAXb,EACP,MAAM,IAAIvF,MAAM,qDAAqDuF,GACzE,IAAK/E,MAAMU,QAAQsE,IAAWA,EAAMrE,QAA8B,iBAAbqE,EAAM,GACvD,MAAM,IAAIxF,MAAM,8DAA8DwF,GAClF,MAAMoB,EAAerB,EAAOpE,OAAS,EAAIqE,EAAMrE,OAC/C,IAAc,IAAViF,GAAmBQ,EAAeR,EAClC,MAAM,IAAIC,UAAU,UAAUO,mBAA8BR,KAEhE,MAAO,GADPb,EAASA,EAAOgB,iBACItB,EAAc1E,OAAOiF,KAASF,aAAaC,EAAQC,EAAOO,IACtF,EA4BqBhF,cAAQ8F,cAJzB,SAASA,cAAchC,GACnB,MAAMU,OAAEA,EAAMC,MAAEA,GAAUzE,OAAO8D,GAAK,GACtC,MAAO,CAAEU,SAAQC,QAAOjC,MAAO0C,EAAUT,GACjD,EAC4CsB,aALnBrD,cAAc1C,QAKmBkF,YAAWE,kBAAiBD,UACtF,CACY,MAACa,EAASlB,UAAU,UACTA,UAAU,WACrB,MAACmB,EAAO,CAChBzG,OAASyB,IAAS,IAAIiF,aAAclG,OAAOiB,GAC3CjB,OAAS8D,IAAQ,IAAIqC,aAAc3G,OAAOsE,IAEjCsC,EAAMlH,MAAMoD,OAAO,GAAIrC,SAAS,oBAAqBS,KAAK,IAAKW,WAAW0B,IACnF,GAAiB,iBAANA,GAAkBA,EAAE3C,OAAS,EACpC,MAAM,IAAIkF,UAAU,2CAA2CvC,iBAAiBA,EAAE3C,UACtF,OAAO2C,EAAEyC,aAAa,KAEpBa,EAAS,CACXJ,OAAMG,MAAKvD,SAAQC,SAAQI,SAAQC,YAAWK,SAAQE,aAEQ4C,OAAOC,KAAKF,GAAQ3F,KAAK","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/@scure_base@1.1.1/node_modules/@scure/base/lib/esm/index.esm.js

@@ -0,0 +1,3 @@
+/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function assertNumber(r){if(!Number.isSafeInteger(r))throw new Error(`Wrong integer: ${r}`)}function chain(...r){const wrap=(r,e)=>o=>r(e(o));return{encode:Array.from(r).reverse().reduce(((r,e)=>r?wrap(r,e.encode):e.encode),void 0),decode:r.reduce(((r,e)=>r?wrap(r,e.decode):e.decode),void 0)}}function alphabet(r){return{encode:e=>{if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("alphabet.encode input should be an array of numbers");return e.map((e=>{if(assertNumber(e),e<0||e>=r.length)throw new Error(`Digit index outside alphabet: ${e} (alphabet: ${r.length})`);return r[e]}))},decode:e=>{if(!Array.isArray(e)||e.length&&"string"!=typeof e[0])throw new Error("alphabet.decode input should be array of strings");return e.map((e=>{if("string"!=typeof e)throw new Error(`alphabet.decode: not string element=${e}`);const o=r.indexOf(e);if(-1===o)throw new Error(`Unknown letter: "${e}". Allowed: ${r}`);return o}))}}}function join(r=""){if("string"!=typeof r)throw new Error("join separator should be string");return{encode:e=>{if(!Array.isArray(e)||e.length&&"string"!=typeof e[0])throw new Error("join.encode input should be array of strings");for(let r of e)if("string"!=typeof r)throw new Error(`join.encode: non-string input=${r}`);return e.join(r)},decode:e=>{if("string"!=typeof e)throw new Error("join.decode input should be string");return e.split(r)}}}function padding(r,e="="){if(assertNumber(r),"string"!=typeof e)throw new Error("padding chr should be string");return{encode(o){if(!Array.isArray(o)||o.length&&"string"!=typeof o[0])throw new Error("padding.encode input should be array of strings");for(let r of o)if("string"!=typeof r)throw new Error(`padding.encode: non-string input=${r}`);for(;o.length*r%8;)o.push(e);return o},decode(o){if(!Array.isArray(o)||o.length&&"string"!=typeof o[0])throw new Error("padding.encode input should be array of strings");for(let r of o)if("string"!=typeof r)throw new Error(`padding.decode: non-string input=${r}`);let n=o.length;if(n*r%8)throw new Error("Invalid padding: string should have whole number of bytes");for(;n>0&&o[n-1]===e;n--)if(!((n-1)*r%8))throw new Error("Invalid padding: string has too much padding");return o.slice(0,n)}}}function normalize(r){if("function"!=typeof r)throw new Error("normalize fn should be function");return{encode:r=>r,decode:e=>r(e)}}function convertRadix(r,e,o){if(e<2)throw new Error(`convertRadix: wrong from=${e}, base cannot be less than 2`);if(o<2)throw new Error(`convertRadix: wrong to=${o}, base cannot be less than 2`);if(!Array.isArray(r))throw new Error("convertRadix: data should be array");if(!r.length)return[];let n=0;const t=[],i=Array.from(r);for(i.forEach((r=>{if(assertNumber(r),r<0||r>=e)throw new Error(`Wrong integer: ${r}`)}));;){let r=0,a=!0;for(let t=n;t<i.length;t++){const d=i[t],c=e*r+d;if(!Number.isSafeInteger(c)||e*r/e!==r||c-d!=e*r)throw new Error("convertRadix: carry overflow");if(r=c%o,i[t]=Math.floor(c/o),!Number.isSafeInteger(i[t])||i[t]*o+r!==c)throw new Error("convertRadix: carry overflow");a&&(i[t]?a=!1:n=t)}if(t.push(r),a)break}for(let e=0;e<r.length-1&&0===r[e];e++)t.push(0);return t.reverse()}const gcd=(r,e)=>e?gcd(e,r%e):r,radix2carry=(r,e)=>r+(e-gcd(r,e));function convertRadix2(r,e,o,n){if(!Array.isArray(r))throw new Error("convertRadix2: data should be array");if(e<=0||e>32)throw new Error(`convertRadix2: wrong from=${e}`);if(o<=0||o>32)throw new Error(`convertRadix2: wrong to=${o}`);if(radix2carry(e,o)>32)throw new Error(`convertRadix2: carry overflow from=${e} to=${o} carryBits=${radix2carry(e,o)}`);let t=0,i=0;const a=2**o-1,d=[];for(const n of r){if(assertNumber(n),n>=2**e)throw new Error(`convertRadix2: invalid data word=${n} from=${e}`);if(t=t<<e|n,i+e>32)throw new Error(`convertRadix2: carry overflow pos=${i} from=${e}`);for(i+=e;i>=o;i-=o)d.push((t>>i-o&a)>>>0);t&=2**i-1}if(t=t<<o-i&a,!n&&i>=e)throw new Error("Excess padding");if(!n&&t)throw new Error(`Non-zero padding: ${t}`);return n&&i>0&&d.push(t>>>0),d}function radix2(r,e=!1){if(assertNumber(r),r<=0||r>32)throw new Error("radix2: bits should be in (0..32]");if(radix2carry(8,r)>32||radix2carry(r,8)>32)throw new Error("radix2: carry overflow");return{encode:o=>{if(!(o instanceof Uint8Array))throw new Error("radix2.encode input should be Uint8Array");return convertRadix2(Array.from(o),8,r,!e)},decode:o=>{if(!Array.isArray(o)||o.length&&"number"!=typeof o[0])throw new Error("radix2.decode input should be array of strings");return Uint8Array.from(convertRadix2(o,r,8,e))}}}function unsafeWrapper(r){if("function"!=typeof r)throw new Error("unsafeWrapper fn should be function");return function(...e){try{return r.apply(null,e)}catch(r){}}}const r=chain(radix2(4),alphabet("0123456789ABCDEF"),join("")),e=chain(radix2(5),alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"),padding(5),join(""));chain(radix2(5),alphabet("0123456789ABCDEFGHIJKLMNOPQRSTUV"),padding(5),join("")),chain(radix2(5),alphabet("0123456789ABCDEFGHJKMNPQRSTVWXYZ"),join(""),normalize((r=>r.toUpperCase().replace(/O/g,"0").replace(/[IL]/g,"1"))));const o=chain(radix2(6),alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"),padding(6),join("")),n=chain(radix2(6),alphabet("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"),padding(6),join("")),genBase58=r=>chain(function radix(r){return assertNumber(r),{encode:e=>{if(!(e instanceof Uint8Array))throw new Error("radix.encode input should be Uint8Array");return convertRadix(Array.from(e),256,r)},decode:e=>{if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("radix.decode input should be array of strings");return Uint8Array.from(convertRadix(e,r,256))}}}(58),alphabet(r),join("")),t=genBase58("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");genBase58("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"),genBase58("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz");const i=[0,2,3,5,6,7,9,10,11],a={encode(r){let e="";for(let o=0;o<r.length;o+=8){const n=r.subarray(o,o+8);e+=t.encode(n).padStart(i[n.length],"1")}return e},decode(r){let e=[];for(let o=0;o<r.length;o+=11){const n=r.slice(o,o+11),a=i.indexOf(n.length),d=t.decode(n);for(let r=0;r<d.length-a;r++)if(0!==d[r])throw new Error("base58xmr: wrong padding");e=e.concat(Array.from(d.slice(d.length-a)))}return Uint8Array.from(e)}},d=chain(alphabet("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),join("")),c=[996825010,642813549,513874426,1027748829,705979059];function bech32Polymod(r){const e=r>>25;let o=(33554431&r)<<5;for(let r=0;r<c.length;r++)1==(e>>r&1)&&(o^=c[r]);return o}function bechChecksum(r,e,o=1){const n=r.length;let t=1;for(let e=0;e<n;e++){const o=r.charCodeAt(e);if(o<33||o>126)throw new Error(`Invalid prefix (${r})`);t=bech32Polymod(t)^o>>5}t=bech32Polymod(t);for(let e=0;e<n;e++)t=bech32Polymod(t)^31&r.charCodeAt(e);for(let r of e)t=bech32Polymod(t)^r;for(let r=0;r<6;r++)t=bech32Polymod(t);return t^=o,d.encode(convertRadix2([t%2**30],30,5,!1))}function genBech32(r){const e="bech32"===r?1:734539939,o=radix2(5),n=o.decode,t=o.encode,i=unsafeWrapper(n);function decode(r,o=90){if("string"!=typeof r)throw new Error("bech32.decode input should be string, not "+typeof r);if(r.length<8||!1!==o&&r.length>o)throw new TypeError(`Wrong string length: ${r.length} (${r}). Expected (8..${o})`);const n=r.toLowerCase();if(r!==n&&r!==r.toUpperCase())throw new Error("String must be lowercase or uppercase");const t=(r=n).lastIndexOf("1");if(0===t||-1===t)throw new Error('Letter "1" must be present between prefix and data only');const i=r.slice(0,t),a=r.slice(t+1);if(a.length<6)throw new Error("Data must be at least 6 characters long");const c=d.decode(a).slice(0,-6),s=bechChecksum(i,c,e);if(!a.endsWith(s))throw new Error(`Invalid checksum in ${r}: expected "${s}"`);return{prefix:i,words:c}}return{encode:function encode(r,o,n=90){if("string"!=typeof r)throw new Error("bech32.encode prefix should be string, not "+typeof r);if(!Array.isArray(o)||o.length&&"number"!=typeof o[0])throw new Error("bech32.encode words should be array of numbers, not "+typeof o);const t=r.length+7+o.length;if(!1!==n&&t>n)throw new TypeError(`Length ${t} exceeds limit ${n}`);return`${r=r.toLowerCase()}1${d.encode(o)}${bechChecksum(r,o,e)}`},decode:decode,decodeToBytes:function decodeToBytes(r){const{prefix:e,words:o}=decode(r,!1);return{prefix:e,words:o,bytes:n(o)}},decodeUnsafe:unsafeWrapper(decode),fromWords:n,fromWordsUnsafe:i,toWords:t}}const s=genBech32("bech32");genBech32("bech32m");const f={encode:r=>(new TextDecoder).decode(r),decode:r=>(new TextEncoder).encode(r)},h=chain(radix2(4),alphabet("0123456789abcdef"),join(""),normalize((r=>{if("string"!=typeof r||r.length%2)throw new TypeError(`hex.decode: expected string, got ${typeof r} with length ${r.length}`);return r.toLowerCase()}))),l={utf8:f,hex:h,base16:r,base32:e,base64:o,base64url:n,base58:t,base58xmr:a};Object.keys(l).join(", ");export{assertNumber,r as base16,e as base32,t as base58,a as base58xmr,o as base64,n as base64url,s as bech32,h as hex,f as utf8};
+//# sourceMappingURL=index.esm.js.map

package/dist/browser/node_modules/.pnpm/@scure_base@1.1.1/node_modules/@scure/base/lib/esm/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.esm.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@scure+base@1.1.1/node_modules/@scure/base/lib/esm/index.js"],"sourcesContent":["/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction chain(...args) {\n    const wrap = (a, b) => (c) => a(b(c));\n    const encode = Array.from(args)\n        .reverse()\n        .reduce((acc, i) => (acc ? wrap(acc, i.encode) : i.encode), undefined);\n    const decode = args.reduce((acc, i) => (acc ? wrap(acc, i.decode) : i.decode), undefined);\n    return { encode, decode };\n}\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\nfunction convertRadix(data, from, to) {\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            digits[i] = Math.floor(digitBase / to);\n            if (!Number.isSafeInteger(digits[i]) || digits[i] * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!digits[i])\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = (from, to) => from + (to - gcd(from, to));\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\n    }\n    let carry = 0;\n    let pos = 0;\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        carry &= 2 ** pos - 1;\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of strings');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\nfunction radix2(bits, revPadding = false) {\n    assertNumber(bits);\n    if (bits <= 0 || bits > 32)\n        throw new Error('radix2: bits should be in (0..32]');\n    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n        throw new Error('radix2: carry overflow');\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of strings');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-len);\n            for (let i = 0; i < len; i++)\n                if (newChecksum[i] !== oldChecksum[i])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\nexport const utils = { alphabet, chain, checksum, radix, radix2, join, padding };\nexport const base16 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64url = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexport const base58xmr = {\n    encode(data) {\n        let res = '';\n        for (let i = 0; i < data.length; i += 8) {\n            const block = data.subarray(i, i + 8);\n            res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], '1');\n        }\n        return res;\n    },\n    decode(str) {\n        let res = [];\n        for (let i = 0; i < str.length; i += 11) {\n            const slice = str.slice(i, i + 11);\n            const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n            const block = base58.decode(slice);\n            for (let j = 0; j < block.length - blockLen; j++) {\n                if (block[j] !== 0)\n                    throw new Error('base58xmr: wrong padding');\n            }\n            res = res.concat(Array.from(block.slice(block.length - blockLen)));\n        }\n        return Uint8Array.from(res);\n    },\n};\nexport const base58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\nconst BECH_ALPHABET = chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre) {\n    const b = pre >> 25;\n    let chk = (pre & 0x1ffffff) << 5;\n    for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n        if (((b >> i) & 1) === 1)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\nfunction bechChecksum(prefix, words, encodingConst = 1) {\n    const len = prefix.length;\n    let chk = 1;\n    for (let i = 0; i < len; i++) {\n        const c = prefix.charCodeAt(i);\n        if (c < 33 || c > 126)\n            throw new Error(`Invalid prefix (${prefix})`);\n        chk = bech32Polymod(chk) ^ (c >> 5);\n    }\n    chk = bech32Polymod(chk);\n    for (let i = 0; i < len; i++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\nfunction genBech32(encoding) {\n    const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n    const _words = radix2(5);\n    const fromWords = _words.decode;\n    const toWords = _words.encode;\n    const fromWordsUnsafe = unsafeWrapper(fromWords);\n    function encode(prefix, words, limit = 90) {\n        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        prefix = prefix.toLowerCase();\n        return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        str = lowered;\n        const sepIndex = str.lastIndexOf('1');\n        if (sepIndex === 0 || sepIndex === -1)\n            throw new Error(`Letter \"1\" must be present between prefix and data only`);\n        const prefix = str.slice(0, sepIndex);\n        const _words = str.slice(sepIndex + 1);\n        if (_words.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(_words).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!_words.endsWith(sum))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = genBech32('bech32');\nexport const bech32m = genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(', ')}`;\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!(bytes instanceof Uint8Array))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString;\nexport const stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\nexport const bytes = stringToBytes;\n"],"names":["assertNumber","n","Number","isSafeInteger","Error","chain","args","wrap","a","b","c","encode","Array","from","reverse","reduce","acc","i","undefined","decode","alphabet","digits","isArray","length","map","input","letter","index","indexOf","join","separator","to","split","padding","bits","chr","data","push","end","slice","normalize","fn","convertRadix","pos","res","forEach","d","carry","done","digit","digitBase","Math","floor","gcd","radix2carry","convertRadix2","mask","radix2","revPadding","bytes","Uint8Array","unsafeWrapper","apply","e","base16","base32","s","toUpperCase","replace","base64","base64url","genBase58","abc","radix","num","base58","XMR_BLOCK_LEN","base58xmr","block","subarray","padStart","str","blockLen","j","concat","BECH_ALPHABET","POLYMOD_GENERATORS","bech32Polymod","pre","chk","bechChecksum","prefix","words","encodingConst","len","charCodeAt","v","genBech32","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","limit","TypeError","lowered","toLowerCase","sepIndex","lastIndexOf","sum","endsWith","actualLength","decodeToBytes","decodeUnsafe","bech32","utf8","TextDecoder","TextEncoder","hex","CODERS","Object","keys"],"mappings":";AACO,SAASA,aAAaC,GACzB,IAAKC,OAAOC,cAAcF,GACtB,MAAM,IAAIG,MAAM,kBAAkBH,IAC1C,CACA,SAASI,SAASC,GACd,MAAMC,KAAO,CAACC,EAAGC,IAAOC,GAAMF,EAAEC,EAAEC,IAKlC,MAAO,CAAEC,OAJMC,MAAMC,KAAKP,GACrBQ,UACAC,QAAO,CAACC,EAAKC,IAAOD,EAAMT,KAAKS,EAAKC,EAAEN,QAAUM,EAAEN,aAASO,GAE/CC,OADFb,EAAKS,QAAO,CAACC,EAAKC,IAAOD,EAAMT,KAAKS,EAAKC,EAAEE,QAAUF,EAAEE,aAASD,GAEnF,CACA,SAASE,SAASA,GACd,MAAO,CACHT,OAASU,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,uDACpB,OAAOiB,EAAOG,KAAKP,IAEf,GADAjB,aAAaiB,GACTA,EAAI,GAAKA,GAAKG,EAASG,OACvB,MAAM,IAAInB,MAAM,iCAAiCa,gBAAgBG,EAASG,WAC9E,OAAOH,EAASH,EAAE,GACpB,EAENE,OAASM,IACL,IAAKb,MAAMU,QAAQG,IAAWA,EAAMF,QAA8B,iBAAbE,EAAM,GACvD,MAAM,IAAIrB,MAAM,oDACpB,OAAOqB,EAAMD,KAAKE,IACd,GAAsB,iBAAXA,EACP,MAAM,IAAItB,MAAM,uCAAuCsB,KAC3D,MAAMC,EAAQP,EAASQ,QAAQF,GAC/B,IAAgB,IAAZC,EACA,MAAM,IAAIvB,MAAM,oBAAoBsB,gBAAqBN,KAC7D,OAAOO,CAAK,GACd,EAGd,CACA,SAASE,KAAKC,EAAY,IACtB,GAAyB,iBAAdA,EACP,MAAM,IAAI1B,MAAM,mCACpB,MAAO,CACHO,OAASE,IACL,IAAKD,MAAMU,QAAQT,IAAUA,EAAKU,QAA6B,iBAAZV,EAAK,GACpD,MAAM,IAAIT,MAAM,gDACpB,IAAK,IAAIa,KAAKJ,EACV,GAAiB,iBAANI,EACP,MAAM,IAAIb,MAAM,iCAAiCa,KACzD,OAAOJ,EAAKgB,KAAKC,EAAU,EAE/BX,OAASY,IACL,GAAkB,iBAAPA,EACP,MAAM,IAAI3B,MAAM,sCACpB,OAAO2B,EAAGC,MAAMF,EAAU,EAGtC,CACA,SAASG,QAAQC,EAAMC,EAAM,KAEzB,GADAnC,aAAakC,GACM,iBAARC,EACP,MAAM,IAAI/B,MAAM,gCACpB,MAAO,CACH,MAAAO,CAAOyB,GACH,IAAKxB,MAAMU,QAAQc,IAAUA,EAAKb,QAA6B,iBAAZa,EAAK,GACpD,MAAM,IAAIhC,MAAM,mDACpB,IAAK,IAAIa,KAAKmB,EACV,GAAiB,iBAANnB,EACP,MAAM,IAAIb,MAAM,oCAAoCa,KAC5D,KAAQmB,EAAKb,OAASW,EAAQ,GAC1BE,EAAKC,KAAKF,GACd,OAAOC,CACV,EACD,MAAAjB,CAAOM,GACH,IAAKb,MAAMU,QAAQG,IAAWA,EAAMF,QAA8B,iBAAbE,EAAM,GACvD,MAAM,IAAIrB,MAAM,mDACpB,IAAK,IAAIa,KAAKQ,EACV,GAAiB,iBAANR,EACP,MAAM,IAAIb,MAAM,oCAAoCa,KAC5D,IAAIqB,EAAMb,EAAMF,OAChB,GAAKe,EAAMJ,EAAQ,EACf,MAAM,IAAI9B,MAAM,6DACpB,KAAOkC,EAAM,GAAKb,EAAMa,EAAM,KAAOH,EAAKG,IACtC,MAAQA,EAAM,GAAKJ,EAAQ,GACvB,MAAM,IAAI9B,MAAM,gDAExB,OAAOqB,EAAMc,MAAM,EAAGD,EACzB,EAET,CACA,SAASE,UAAUC,GACf,GAAkB,mBAAPA,EACP,MAAM,IAAIrC,MAAM,mCACpB,MAAO,CAAEO,OAASE,GAASA,EAAMM,OAASY,GAAOU,EAAGV,GACxD,CACA,SAASW,aAAaN,EAAMvB,EAAMkB,GAC9B,GAAIlB,EAAO,EACP,MAAM,IAAIT,MAAM,4BAA4BS,iCAChD,GAAIkB,EAAK,EACL,MAAM,IAAI3B,MAAM,0BAA0B2B,iCAC9C,IAAKnB,MAAMU,QAAQc,GACf,MAAM,IAAIhC,MAAM,sCACpB,IAAKgC,EAAKb,OACN,MAAO,GACX,IAAIoB,EAAM,EACV,MAAMC,EAAM,GACNvB,EAAST,MAAMC,KAAKuB,GAM1B,IALAf,EAAOwB,SAASC,IAEZ,GADA9C,aAAa8C,GACTA,EAAI,GAAKA,GAAKjC,EACd,MAAM,IAAIT,MAAM,kBAAkB0C,IAAI,MAEjC,CACT,IAAIC,EAAQ,EACRC,GAAO,EACX,IAAK,IAAI/B,EAAI0B,EAAK1B,EAAII,EAAOE,OAAQN,IAAK,CACtC,MAAMgC,EAAQ5B,EAAOJ,GACfiC,EAAYrC,EAAOkC,EAAQE,EACjC,IAAK/C,OAAOC,cAAc+C,IACrBrC,EAAOkC,EAASlC,IAASkC,GAC1BG,EAAYD,GAAUpC,EAAOkC,EAC7B,MAAM,IAAI3C,MAAM,gCAIpB,GAFA2C,EAAQG,EAAYnB,EACpBV,EAAOJ,GAAKkC,KAAKC,MAAMF,EAAYnB,IAC9B7B,OAAOC,cAAckB,EAAOJ,KAAOI,EAAOJ,GAAKc,EAAKgB,IAAUG,EAC/D,MAAM,IAAI9C,MAAM,gCACf4C,IAEK3B,EAAOJ,GAGb+B,GAAO,EAFPL,EAAM1B,EAGtB,CAEQ,GADA2B,EAAIP,KAAKU,GACLC,EACA,KACZ,CACI,IAAK,IAAI/B,EAAI,EAAGA,EAAImB,EAAKb,OAAS,GAAiB,IAAZa,EAAKnB,GAAUA,IAClD2B,EAAIP,KAAK,GACb,OAAOO,EAAI9B,SACf,CACA,MAAMuC,IAAM,CAAC7C,EAAGC,IAAQA,EAAQ4C,IAAI5C,EAAGD,EAAIC,GAAfD,EACtB8C,YAAc,CAACzC,EAAMkB,IAAOlB,GAAQkB,EAAKsB,IAAIxC,EAAMkB,IACzD,SAASwB,cAAcnB,EAAMvB,EAAMkB,EAAIE,GACnC,IAAKrB,MAAMU,QAAQc,GACf,MAAM,IAAIhC,MAAM,uCACpB,GAAIS,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAIT,MAAM,6BAA6BS,KACjD,GAAIkB,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI3B,MAAM,2BAA2B2B,KAC/C,GAAIuB,YAAYzC,EAAMkB,GAAM,GACxB,MAAM,IAAI3B,MAAM,sCAAsCS,QAAWkB,eAAgBuB,YAAYzC,EAAMkB,MAEvG,IAAIgB,EAAQ,EACRJ,EAAM,EACV,MAAMa,EAAO,GAAKzB,EAAK,EACjBa,EAAM,GACZ,IAAK,MAAM3C,KAAKmC,EAAM,CAElB,GADApC,aAAaC,GACTA,GAAK,GAAKY,EACV,MAAM,IAAIT,MAAM,oCAAoCH,UAAUY,KAElE,GADAkC,EAASA,GAASlC,EAAQZ,EACtB0C,EAAM9B,EAAO,GACb,MAAM,IAAIT,MAAM,qCAAqCuC,UAAY9B,KAErE,IADA8B,GAAO9B,EACA8B,GAAOZ,EAAIY,GAAOZ,EACrBa,EAAIP,MAAOU,GAAUJ,EAAMZ,EAAOyB,KAAU,GAChDT,GAAS,GAAKJ,EAAM,CAC5B,CAEI,GADAI,EAASA,GAAUhB,EAAKY,EAAQa,GAC3BvB,GAAWU,GAAO9B,EACnB,MAAM,IAAIT,MAAM,kBACpB,IAAK6B,GAAWc,EACZ,MAAM,IAAI3C,MAAM,qBAAqB2C,KAGzC,OAFId,GAAWU,EAAM,GACjBC,EAAIP,KAAKU,IAAU,GAChBH,CACX,CAgBA,SAASa,OAAOvB,EAAMwB,GAAa,GAE/B,GADA1D,aAAakC,GACTA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI9B,MAAM,qCACpB,GAAIkD,YAAY,EAAGpB,GAAQ,IAAMoB,YAAYpB,EAAM,GAAK,GACpD,MAAM,IAAI9B,MAAM,0BACpB,MAAO,CACHO,OAASgD,IACL,KAAMA,aAAiBC,YACnB,MAAM,IAAIxD,MAAM,4CACpB,OAAOmD,cAAc3C,MAAMC,KAAK8C,GAAQ,EAAGzB,GAAOwB,EAAW,EAEjEvC,OAASE,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,kDACpB,OAAOwD,WAAW/C,KAAK0C,cAAclC,EAAQa,EAAM,EAAGwB,GAAY,EAG9E,CACA,SAASG,cAAcpB,GACnB,GAAkB,mBAAPA,EACP,MAAM,IAAIrC,MAAM,uCACpB,OAAO,YAAaE,GAChB,IACI,OAAOmC,EAAGqB,MAAM,KAAMxD,EAClC,CACQ,MAAOyD,GAAG,CACb,CACL,CA6BY,MAACC,EAAS3D,MAAMoD,OAAO,GAAIrC,SAAS,oBAAqBS,KAAK,KAC7DoC,EAAS5D,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCa,QAAQ,GAAIJ,KAAK,KAC7ExB,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCa,QAAQ,GAAIJ,KAAK,KAC1ExB,MAAMoD,OAAO,GAAIrC,SAAS,oCAAqCS,KAAK,IAAKW,WAAW0B,GAAMA,EAAEC,cAAcC,QAAQ,KAAM,KAAKA,QAAQ,QAAS,QACjK,MAACC,EAAShE,MAAMoD,OAAO,GAAIrC,SAAS,oEAAqEa,QAAQ,GAAIJ,KAAK,KACzHyC,EAAYjE,MAAMoD,OAAO,GAAIrC,SAAS,oEAAqEa,QAAQ,GAAIJ,KAAK,KACnI0C,UAAaC,GAAQnE,MA9E3B,SAASoE,MAAMC,GAEX,OADA1E,aAAa0E,GACN,CACH/D,OAASgD,IACL,KAAMA,aAAiBC,YACnB,MAAM,IAAIxD,MAAM,2CACpB,OAAOsC,aAAa9B,MAAMC,KAAK8C,GAAQ,IAAQe,EAAI,EAEvDvD,OAASE,IACL,IAAKT,MAAMU,QAAQD,IAAYA,EAAOE,QAA+B,iBAAdF,EAAO,GAC1D,MAAM,IAAIjB,MAAM,iDACpB,OAAOwD,WAAW/C,KAAK6B,aAAarB,EAAQqD,EAAK,KAAQ,EAGrE,CAgEiCD,CAAM,IAAKrD,SAASoD,GAAM3C,KAAK,KACnD8C,EAASJ,UAAU,8DACJA,UAAU,8DACbA,UAAU,8DACnC,MAAMK,EAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,IACnCC,EAAY,CACrB,MAAAlE,CAAOyB,GACH,IAAIQ,EAAM,GACV,IAAK,IAAI3B,EAAI,EAAGA,EAAImB,EAAKb,OAAQN,GAAK,EAAG,CACrC,MAAM6D,EAAQ1C,EAAK2C,SAAS9D,EAAGA,EAAI,GACnC2B,GAAO+B,EAAOhE,OAAOmE,GAAOE,SAASJ,EAAcE,EAAMvD,QAAS,IAC9E,CACQ,OAAOqB,CACV,EACD,MAAAzB,CAAO8D,GACH,IAAIrC,EAAM,GACV,IAAK,IAAI3B,EAAI,EAAGA,EAAIgE,EAAI1D,OAAQN,GAAK,GAAI,CACrC,MAAMsB,EAAQ0C,EAAI1C,MAAMtB,EAAGA,EAAI,IACzBiE,EAAWN,EAAchD,QAAQW,EAAMhB,QACvCuD,EAAQH,EAAOxD,OAAOoB,GAC5B,IAAK,IAAI4C,EAAI,EAAGA,EAAIL,EAAMvD,OAAS2D,EAAUC,IACzC,GAAiB,IAAbL,EAAMK,GACN,MAAM,IAAI/E,MAAM,4BAExBwC,EAAMA,EAAIwC,OAAOxE,MAAMC,KAAKiE,EAAMvC,MAAMuC,EAAMvD,OAAS2D,IACnE,CACQ,OAAOtB,WAAW/C,KAAK+B,EAC1B,GAGCyC,EAAgBhF,MAAMe,SAAS,oCAAqCS,KAAK,KACzEyD,EAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,WAC5E,SAASC,cAAcC,GACnB,MAAM/E,EAAI+E,GAAO,GACjB,IAAIC,GAAa,SAAND,IAAoB,EAC/B,IAAK,IAAIvE,EAAI,EAAGA,EAAIqE,EAAmB/D,OAAQN,IACpB,IAAjBR,GAAKQ,EAAK,KACZwE,GAAOH,EAAmBrE,IAElC,OAAOwE,CACX,CACA,SAASC,aAAaC,EAAQC,EAAOC,EAAgB,GACjD,MAAMC,EAAMH,EAAOpE,OACnB,IAAIkE,EAAM,EACV,IAAK,IAAIxE,EAAI,EAAGA,EAAI6E,EAAK7E,IAAK,CAC1B,MAAMP,EAAIiF,EAAOI,WAAW9E,GAC5B,GAAIP,EAAI,IAAMA,EAAI,IACd,MAAM,IAAIN,MAAM,mBAAmBuF,MACvCF,EAAMF,cAAcE,GAAQ/E,GAAK,CACzC,CACI+E,EAAMF,cAAcE,GACpB,IAAK,IAAIxE,EAAI,EAAGA,EAAI6E,EAAK7E,IACrBwE,EAAMF,cAAcE,GAA+B,GAAvBE,EAAOI,WAAW9E,GAClD,IAAK,IAAI+E,KAAKJ,EACVH,EAAMF,cAAcE,GAAOO,EAC/B,IAAK,IAAI/E,EAAI,EAAGA,EAAI,EAAGA,IACnBwE,EAAMF,cAAcE,GAExB,OADAA,GAAOI,EACAR,EAAc1E,OAAO4C,cAAc,CAACkC,EAAM,GAAK,IAAK,GAAI,GAAG,GACtE,CACA,SAASQ,UAAUC,GACf,MAAMC,EAA8B,WAAbD,EAAwB,EAAI,UAC7CE,EAAS3C,OAAO,GAChB4C,EAAYD,EAAOjF,OACnBmF,EAAUF,EAAOzF,OACjB4F,EAAkB1C,cAAcwC,GAYtC,SAASlF,OAAO8D,EAAKuB,EAAQ,IACzB,GAAmB,iBAARvB,EACP,MAAM,IAAI7E,MAAM,oDAAoD6E,GACxE,GAAIA,EAAI1D,OAAS,IAAgB,IAAViF,GAAmBvB,EAAI1D,OAASiF,EACnD,MAAM,IAAIC,UAAU,wBAAwBxB,EAAI1D,WAAW0D,oBAAsBuB,MACrF,MAAME,EAAUzB,EAAI0B,cACpB,GAAI1B,IAAQyB,GAAWzB,IAAQA,EAAId,cAC/B,MAAM,IAAI/D,MAAM,yCAEpB,MAAMwG,GADN3B,EAAMyB,GACeG,YAAY,KACjC,GAAiB,IAAbD,IAAiC,IAAfA,EAClB,MAAM,IAAIxG,MAAM,2DACpB,MAAMuF,EAASV,EAAI1C,MAAM,EAAGqE,GACtBR,EAASnB,EAAI1C,MAAMqE,EAAW,GACpC,GAAIR,EAAO7E,OAAS,EAChB,MAAM,IAAInB,MAAM,2CACpB,MAAMwF,EAAQP,EAAclE,OAAOiF,GAAQ7D,MAAM,MAC3CuE,EAAMpB,aAAaC,EAAQC,EAAOO,GACxC,IAAKC,EAAOW,SAASD,GACjB,MAAM,IAAI1G,MAAM,uBAAuB6E,gBAAkB6B,MAC7D,MAAO,CAAEnB,SAAQC,QACzB,CAMI,MAAO,CAAEjF,OAtCT,SAASA,OAAOgF,EAAQC,EAAOY,EAAQ,IACnC,GAAsB,iBAAXb,EACP,MAAM,IAAIvF,MAAM,qDAAqDuF,GACzE,IAAK/E,MAAMU,QAAQsE,IAAWA,EAAMrE,QAA8B,iBAAbqE,EAAM,GACvD,MAAM,IAAIxF,MAAM,8DAA8DwF,GAClF,MAAMoB,EAAerB,EAAOpE,OAAS,EAAIqE,EAAMrE,OAC/C,IAAc,IAAViF,GAAmBQ,EAAeR,EAClC,MAAM,IAAIC,UAAU,UAAUO,mBAA8BR,KAEhE,MAAO,GADPb,EAASA,EAAOgB,iBACItB,EAAc1E,OAAOiF,KAASF,aAAaC,EAAQC,EAAOO,IACtF,EA4BqBhF,cAAQ8F,cAJzB,SAASA,cAAchC,GACnB,MAAMU,OAAEA,EAAMC,MAAEA,GAAUzE,OAAO8D,GAAK,GACtC,MAAO,CAAEU,SAAQC,QAAOjC,MAAO0C,EAAUT,GACjD,EAC4CsB,aALnBrD,cAAc1C,QAKmBkF,YAAWE,kBAAiBD,UACtF,CACY,MAACa,EAASlB,UAAU,UACTA,UAAU,WACrB,MAACmB,EAAO,CAChBzG,OAASyB,IAAS,IAAIiF,aAAclG,OAAOiB,GAC3CjB,OAAS8D,IAAQ,IAAIqC,aAAc3G,OAAOsE,IAEjCsC,EAAMlH,MAAMoD,OAAO,GAAIrC,SAAS,oBAAqBS,KAAK,IAAKW,WAAW0B,IACnF,GAAiB,iBAANA,GAAkBA,EAAE3C,OAAS,EACpC,MAAM,IAAIkF,UAAU,2CAA2CvC,iBAAiBA,EAAE3C,UACtF,OAAO2C,EAAEyC,aAAa,KAEpBa,EAAS,CACXJ,OAAMG,MAAKvD,SAAQC,SAAQI,SAAQC,YAAWK,SAAQE,aAEQ4C,OAAOC,KAAKF,GAAQ3F,KAAK","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/@vitest_expect@0.34.6/node_modules/@vitest/expect/dist/index.amd.js

@@ -0,0 +1,2 @@
+define(["exports","../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/diff.amd","../../../../../@vitest_spy@0.34.6/node_modules/@vitest/spy/dist/index.amd","../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/error.amd","../../../../../chai@4.5.0/node_modules/chai/index.amd","../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/chunk-display.amd","../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/chunk-colors.amd","../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/helpers.amd"],(function(e,t,s,n,r,o,i,a){"use strict";const l=Symbol.for("matchers-object"),u=Symbol.for("$$jest-matchers-object"),h=Symbol.for("expect-global");if(!Object.prototype.hasOwnProperty.call(globalThis,l)){const e=new WeakMap,t=Object.create(null);Object.defineProperty(globalThis,l,{get:()=>e}),Object.defineProperty(globalThis,u,{configurable:!0,get:()=>({state:e.get(globalThis[h]),matchers:t})})}function getState(e){return globalThis[l].get(e)}function getMatcherUtils(){const c=()=>i.b(),e=c().green,t=c().red,s=c().inverse,n=c().bold,r=c().dim;const replaceTrailingSpaces=e=>e.replace(/\s+$/gm,(e=>"·".repeat(e.length)));return{EXPECTED_COLOR:e,RECEIVED_COLOR:t,INVERTED_COLOR:s,BOLD_WEIGHT:n,DIM_COLOR:r,matcherHint:function matcherHint(s,n="received",o="expected",i={}){const{comment:a="",isDirectExpectCall:l=!1,isNot:u=!1,promise:h="",secondArgument:f="",expectedColor:p=e,receivedColor:d=t,secondArgumentColor:y=e}=i;let m="",g="expect";return l||""===n||(m+=r(`${g}(`)+d(n),g=")"),""!==h&&(m+=r(`${g}.`)+h,g=""),u&&(m+=`${r(`${g}.`)}not`,g=""),s.includes(".")?g+=s:(m+=r(`${g}.`)+s,g=""),""===o?g+="()":(m+=r(`${g}(`)+p(o),f&&(m+=r(", ")+y(f)),g=")"),""!==a&&(g+=` // ${a}`),""!==g&&(m+=r(g)),m},printReceived:e=>t(replaceTrailingSpaces(o.s(e))),printExpected:t=>e(replaceTrailingSpaces(o.s(t)))}}function equals(e,t,s,n){return eq(e,t,[],[],s=s||[],n?hasKey:hasDefinedKey)}function isAsymmetric(e){return!!e&&"object"==typeof e&&"asymmetricMatch"in e&&isA("Function",e.asymmetricMatch)}function eq(e,t,s,n,r,o){let i=!0;const a=function asymmetricMatch(e,t){const s=isAsymmetric(e),n=isAsymmetric(t);if(!s||!n)return s?e.asymmetricMatch(t):n?t.asymmetricMatch(e):void 0}(e,t);if(void 0!==a)return a;for(let s=0;s<r.length;s++){const n=r[s](e,t);if(void 0!==n)return n}if(e instanceof Error&&t instanceof Error)return e.message===t.message;if(Object.is(e,t))return!0;if(null===e||null===t)return e===t;const l=Object.prototype.toString.call(e);if(l!==Object.prototype.toString.call(t))return!1;switch(l){case"[object Boolean]":case"[object String]":case"[object Number]":return typeof e==typeof t&&("object"!=typeof e&&"object"!=typeof t?Object.is(e,t):Object.is(e.valueOf(),t.valueOf()));case"[object Date]":{const s=+e,n=+t;return s===n||Number.isNaN(s)&&Number.isNaN(n)}case"[object RegExp]":return e.source===t.source&&e.flags===t.flags}if("object"!=typeof e||"object"!=typeof t)return!1;if(isDomNode(e)&&isDomNode(t))return e.isEqualNode(t);let u=s.length;for(;u--;){if(s[u]===e)return n[u]===t;if(n[u]===t)return!1}if(s.push(e),n.push(t),"[object Array]"===l&&e.length!==t.length)return!1;const h=keys(e,o);let f,p=h.length;if(keys(t,o).length!==p)return!1;for(;p--;)if(f=h[p],i=o(t,f)&&eq(e[f],t[f],s,n,r,o),!i)return!1;return s.pop(),n.pop(),i}function keys(e,t){const s=[];for(const n in e)t(e,n)&&s.push(n);return s.concat(Object.getOwnPropertySymbols(e).filter((t=>Object.getOwnPropertyDescriptor(e,t).enumerable)))}function hasDefinedKey(e,t){return hasKey(e,t)&&void 0!==e[t]}function hasKey(e,t){return Object.prototype.hasOwnProperty.call(e,t)}function isA(e,t){return Object.prototype.toString.apply(t)===`[object ${e}]`}function isDomNode(e){return null!==e&&"object"==typeof e&&"nodeType"in e&&"number"==typeof e.nodeType&&"nodeName"in e&&"string"==typeof e.nodeName&&"isEqualNode"in e&&"function"==typeof e.isEqualNode}const f="@@__IMMUTABLE_ORDERED__@@";function isImmutableUnorderedKeyed(e){return!(!e||!e["@@__IMMUTABLE_KEYED__@@"]||e[f])}function isImmutableUnorderedSet(e){return!(!e||!e["@@__IMMUTABLE_SET__@@"]||e[f])}const p=Symbol.iterator;function hasIterator(e){return!(null==e||!e[p])}function iterableEquality(e,t,s=[],n=[]){if("object"!=typeof e||"object"!=typeof t||Array.isArray(e)||Array.isArray(t)||!hasIterator(e)||!hasIterator(t))return;if(e.constructor!==t.constructor)return!1;let r=s.length;for(;r--;)if(s[r]===e)return n[r]===t;s.push(e),n.push(t);const iterableEqualityWithStack=(e,t)=>iterableEquality(e,t,[...s],[...n]);if(void 0!==e.size){if(e.size!==t.size)return!1;if(isA("Set",e)||isImmutableUnorderedSet(e)){let r=!0;for(const s of e)if(!t.has(s)){let e=!1;for(const n of t){!0===equals(s,n,[iterableEqualityWithStack])&&(e=!0)}if(!1===e){r=!1;break}}return s.pop(),n.pop(),r}if(isA("Map",e)||isImmutableUnorderedKeyed(e)){let r=!0;for(const s of e)if(!t.has(s[0])||!equals(s[1],t.get(s[0]),[iterableEqualityWithStack])){let e=!1;for(const n of t){let t=!1;!0===equals(s[0],n[0],[iterableEqualityWithStack])&&(t=equals(s[1],n[1],[iterableEqualityWithStack])),!0===t&&(e=!0)}if(!1===e){r=!1;break}}return s.pop(),n.pop(),r}}const o=t[p]();for(const t of e){const e=o.next();if(e.done||!equals(t,e.value,[iterableEqualityWithStack]))return!1}return!!o.next().done&&(s.pop(),n.pop(),!0)}function hasPropertyInObject(e,t){return!(!e||"object"!=typeof e||e===Object.prototype)&&(Object.prototype.hasOwnProperty.call(e,t)||hasPropertyInObject(Object.getPrototypeOf(e),t))}function isObjectWithKeys(e){return a.isObject(e)&&!(e instanceof Error)&&!Array.isArray(e)&&!(e instanceof Date)}function subsetEquality(e,t){const subsetEqualityWithContext=(e=new WeakMap)=>(t,s)=>{if(isObjectWithKeys(s))return Object.keys(s).every((n=>{if(isObjectWithKeys(s[n])){if(e.has(s[n]))return equals(t[n],s[n],[iterableEquality]);e.set(s[n],!0)}const r=null!=t&&hasPropertyInObject(t,n)&&equals(t[n],s[n],[iterableEquality,subsetEqualityWithContext(e)]);return e.delete(s[n]),r}))};return subsetEqualityWithContext()(e,t)}function typeEquality(e,t){if(null!=e&&null!=t&&e.constructor!==t.constructor)return!1}function arrayBufferEquality(e,t){let s=e,n=t;if(!(e instanceof DataView&&t instanceof DataView)){if(!(e instanceof ArrayBuffer&&t instanceof ArrayBuffer))return;try{s=new DataView(e),n=new DataView(t)}catch{return}}if(s.byteLength!==n.byteLength)return!1;for(let e=0;e<s.byteLength;e++)if(s.getUint8(e)!==n.getUint8(e))return!1;return!0}function sparseArrayEquality(e,t){if(!Array.isArray(e)||!Array.isArray(t))return;const s=Object.keys(e),n=Object.keys(t);return equals(e,t,[iterableEquality,typeEquality],!0)&&equals(s,n)}function generateToBeMessage(e,t="#{this}",s="#{exp}"){const n=`expected ${t} to be ${s} // Object.is equality`;return["toStrictEqual","toEqual"].includes(e)?`${n}\n\nIf it should pass with deep equality, replace "toBe" with "${e}"\n\nExpected: ${t}\nReceived: serializes to the same string\n`:n}class AsymmetricMatcher{constructor(e,t=!1){this.sample=e,this.inverse=t}$$typeof=Symbol.for("jest.asymmetricMatcher");getMatcherContext(e){return{...getState(e||globalThis[h]),equals:equals,isNot:this.inverse,utils:{...getMatcherUtils(),diff:t.diff,stringify:o.s,iterableEquality:iterableEquality,subsetEquality:subsetEquality}}}}class StringContaining extends AsymmetricMatcher{constructor(e,t=!1){if(!isA("String",e))throw new Error("Expected is not a string");super(e,t)}asymmetricMatch(e){const t=isA("String",e)&&e.includes(this.sample);return this.inverse?!t:t}toString(){return`String${this.inverse?"Not":""}Containing`}getExpectedType(){return"string"}}class Anything extends AsymmetricMatcher{asymmetricMatch(e){return null!=e}toString(){return"Anything"}toAsymmetricMatcher(){return"Anything"}}class ObjectContaining extends AsymmetricMatcher{constructor(e,t=!1){super(e,t)}getPrototype(e){return Object.getPrototypeOf?Object.getPrototypeOf(e):e.constructor.prototype===e?null:e.constructor.prototype}hasProperty(e,t){return!!e&&(!!Object.prototype.hasOwnProperty.call(e,t)||this.hasProperty(this.getPrototype(e),t))}asymmetricMatch(e){if("object"!=typeof this.sample)throw new TypeError(`You must provide an object to ${this.toString()}, not '${typeof this.sample}'.`);let t=!0;for(const s in this.sample)if(!this.hasProperty(e,s)||!equals(this.sample[s],e[s])){t=!1;break}return this.inverse?!t:t}toString(){return`Object${this.inverse?"Not":""}Containing`}getExpectedType(){return"object"}}class ArrayContaining extends AsymmetricMatcher{constructor(e,t=!1){super(e,t)}asymmetricMatch(e){if(!Array.isArray(this.sample))throw new TypeError(`You must provide an array to ${this.toString()}, not '${typeof this.sample}'.`);const t=0===this.sample.length||Array.isArray(e)&&this.sample.every((t=>e.some((e=>equals(t,e)))));return this.inverse?!t:t}toString(){return`Array${this.inverse?"Not":""}Containing`}getExpectedType(){return"array"}}class Any extends AsymmetricMatcher{constructor(e){if(void 0===e)throw new TypeError("any() expects to be passed a constructor function. Please pass one or use anything() to match any object.");super(e)}fnNameFor(e){if(e.name)return e.name;const t=Function.prototype.toString.call(e).match(/^(?:async)?\s*function\s*\*?\s*([\w$]+)\s*\(/);return t?t[1]:"<anonymous>"}asymmetricMatch(e){return this.sample===String?"string"==typeof e||e instanceof String:this.sample===Number?"number"==typeof e||e instanceof Number:this.sample===Function?"function"==typeof e||e instanceof Function:this.sample===Boolean?"boolean"==typeof e||e instanceof Boolean:this.sample===BigInt?"bigint"==typeof e||e instanceof BigInt:this.sample===Symbol?"symbol"==typeof e||e instanceof Symbol:this.sample===Object?"object"==typeof e:e instanceof this.sample}toString(){return"Any"}getExpectedType(){return this.sample===String?"string":this.sample===Number?"number":this.sample===Function?"function":this.sample===Object?"object":this.sample===Boolean?"boolean":this.fnNameFor(this.sample)}toAsymmetricMatcher(){return`Any<${this.fnNameFor(this.sample)}>`}}class StringMatching extends AsymmetricMatcher{constructor(e,t=!1){if(!isA("String",e)&&!isA("RegExp",e))throw new Error("Expected is not a String or a RegExp");super(new RegExp(e),t)}asymmetricMatch(e){const t=isA("String",e)&&this.sample.test(e);return this.inverse?!t:t}toString(){return`String${this.inverse?"Not":""}Matching`}getExpectedType(){return"string"}}function recordAsyncExpect(e,t){return e&&t instanceof Promise&&(t=t.finally((()=>{const s=e.promises.indexOf(t);-1!==s&&e.promises.splice(s,1)})),e.promises||(e.promises=[]),e.promises.push(t)),t}function wrapSoft(e,t){return function(...s){var r;const o=e.flag(this,"vitest-test");if(!((null==o?void 0:o.context._local)?o.context.expect.getState():getState(globalThis[h])).soft)return t.apply(this,s);if(!o)throw new Error("expect.soft() can only be used inside a test");try{return t.apply(this,s)}catch(e){o.result||(o.result={state:"fail"}),o.result.state="fail",(r=o.result).errors||(r.errors=[]),o.result.errors.push(n.processError(e))}}}class JestExtendError extends Error{constructor(e,t,s){super(e),this.actual=t,this.expected=s}}function JestExtendPlugin(e,s){return(n,i)=>{Object.entries(s).forEach((([s,a])=>{const l=wrapSoft(i,(function expectWrapper(...s){const{state:n,isNot:i,obj:l}=function getMatcherState(e,s){const n=e._obj,i=r.util.flag(e,"negate"),a=r.util.flag(e,"promise")||"",l={...getMatcherUtils(),diff:t.diff,stringify:o.s,iterableEquality:iterableEquality,subsetEquality:subsetEquality};return{state:{...getState(s),isNot:i,utils:l,promise:a,equals:equals,suppressedErrors:[]},isNot:i,obj:n}}(this,e),u=a.call(n,l,...s);if(u&&"object"==typeof u&&u instanceof Promise)return u.then((({pass:e,message:t,actual:s,expected:n})=>{if(e&&i||!e&&!i)throw new JestExtendError(t(),s,n)}));const{pass:h,message:f,actual:p,expected:d}=u;if(h&&i||!h&&!i)throw new JestExtendError(f(),p,d)}));i.addMethod(globalThis[u].matchers,s,l),i.addMethod(n.Assertion.prototype,s,l);class CustomMatcher extends AsymmetricMatcher{constructor(e=!1,...t){super(t,e)}asymmetricMatch(t){const{pass:s}=a.call(this.getMatcherContext(e),t,...this.sample);return this.inverse?!s:s}toString(){return`${this.inverse?"not.":""}${s}`}getExpectedType(){return"any"}toAsymmetricMatcher(){return`${this.toString()}<${this.sample.map(String).join(", ")}>`}}Object.defineProperty(e,s,{configurable:!0,enumerable:!0,value:(...e)=>new CustomMatcher(!1,...e),writable:!0}),Object.defineProperty(e.not,s,{configurable:!0,enumerable:!0,value:(...e)=>new CustomMatcher(!0,...e),writable:!0})}))}}e.Any=Any,e.Anything=Anything,e.ArrayContaining=ArrayContaining,e.AsymmetricMatcher=AsymmetricMatcher,e.GLOBAL_EXPECT=h,e.JEST_MATCHERS_OBJECT=u,e.JestAsymmetricMatchers=(e,t)=>{t.addMethod(e.expect,"anything",(()=>new Anything)),t.addMethod(e.expect,"any",(e=>new Any(e))),t.addMethod(e.expect,"stringContaining",(e=>new StringContaining(e))),t.addMethod(e.expect,"objectContaining",(e=>new ObjectContaining(e))),t.addMethod(e.expect,"arrayContaining",(e=>new ArrayContaining(e))),t.addMethod(e.expect,"stringMatching",(e=>new StringMatching(e))),e.expect.not={stringContaining:e=>new StringContaining(e,!0),objectContaining:e=>new ObjectContaining(e,!0),arrayContaining:e=>new ArrayContaining(e,!0),stringMatching:e=>new StringMatching(e,!0)}},e.JestChaiExpect=(e,n)=>{const{AssertionError:r}=e,c=()=>i.b();function def(t,s){const addMethod=t=>{const r=wrapSoft(n,s);n.addMethod(e.Assertion.prototype,t,r),n.addMethod(globalThis[u].matchers,t,r)};Array.isArray(t)?t.forEach((e=>addMethod(e))):addMethod(t)}["throw","throws","Throw"].forEach((t=>{n.overwriteMethod(e.Assertion.prototype,t,(e=>function(...t){const s=n.flag(this,"promise"),o=n.flag(this,"object"),i=n.flag(this,"negate");if("rejects"===s)n.flag(this,"object",(()=>{throw o}));else if("resolves"===s&&"function"!=typeof o){if(i)return;{const e=n.flag(this,"message")||"expected promise to throw an error, but it didn't";throw new r(e,{showDiff:!1},n.flag(this,"ssfi"))}}e.apply(this,t)}))})),def("withTest",(function(e){return n.flag(this,"vitest-test",e),this})),def("toEqual",(function(e){const t=n.flag(this,"object"),s=equals(t,e,[iterableEquality]);return this.assert(s,"expected #{this} to deeply equal #{exp}","expected #{this} to not deeply equal #{exp}",e,t)})),def("toStrictEqual",(function(e){const t=n.flag(this,"object"),s=equals(t,e,[iterableEquality,typeEquality,sparseArrayEquality,arrayBufferEquality],!0);return this.assert(s,"expected #{this} to strictly equal #{exp}","expected #{this} to not strictly equal #{exp}",e,t)})),def("toBe",(function(e){const t=this._obj,s=Object.is(t,e);let n="";if(!s){if(equals(t,e,[iterableEquality,typeEquality,sparseArrayEquality,arrayBufferEquality],!0))n="toStrictEqual";else{equals(t,e,[iterableEquality])&&(n="toEqual")}}return this.assert(s,generateToBeMessage(n),"expected #{this} not to be #{exp} // Object.is equality",e,t)})),def("toMatchObject",(function(e){const t=this._obj;return this.assert(equals(t,e,[iterableEquality,subsetEquality]),"expected #{this} to match object #{exp}","expected #{this} to not match object #{exp}",e,t)})),def("toMatch",(function(e){return"string"==typeof e?this.include(e):this.match(e)})),def("toContain",(function(e){return this.contain(e)})),def("toContainEqual",(function(e){const t=n.flag(this,"object"),s=Array.from(t).findIndex((t=>equals(t,e)));this.assert(-1!==s,"expected #{this} to deep equally contain #{exp}","expected #{this} to not deep equally contain #{exp}",e)})),def("toBeTruthy",(function(){const e=n.flag(this,"object");this.assert(Boolean(e),"expected #{this} to be truthy","expected #{this} to not be truthy",e,!1)})),def("toBeFalsy",(function(){const e=n.flag(this,"object");this.assert(!e,"expected #{this} to be falsy","expected #{this} to not be falsy",e,!1)})),def("toBeGreaterThan",(function(e){const t=this._obj;return a.assertTypes(t,"actual",["number","bigint"]),a.assertTypes(e,"expected",["number","bigint"]),this.assert(t>e,`expected ${t} to be greater than ${e}`,`expected ${t} to be not greater than ${e}`,t,e,!1)})),def("toBeGreaterThanOrEqual",(function(e){const t=this._obj;return a.assertTypes(t,"actual",["number","bigint"]),a.assertTypes(e,"expected",["number","bigint"]),this.assert(t>=e,`expected ${t} to be greater than or equal to ${e}`,`expected ${t} to be not greater than or equal to ${e}`,t,e,!1)})),def("toBeLessThan",(function(e){const t=this._obj;return a.assertTypes(t,"actual",["number","bigint"]),a.assertTypes(e,"expected",["number","bigint"]),this.assert(t<e,`expected ${t} to be less than ${e}`,`expected ${t} to be not less than ${e}`,t,e,!1)})),def("toBeLessThanOrEqual",(function(e){const t=this._obj;return a.assertTypes(t,"actual",["number","bigint"]),a.assertTypes(e,"expected",["number","bigint"]),this.assert(t<=e,`expected ${t} to be less than or equal to ${e}`,`expected ${t} to be not less than or equal to ${e}`,t,e,!1)})),def("toBeNaN",(function(){return this.be.NaN})),def("toBeUndefined",(function(){return this.be.undefined})),def("toBeNull",(function(){return this.be.null})),def("toBeDefined",(function(){const e=n.flag(this,"negate");return n.flag(this,"negate",!1),e?this.be.undefined:this.not.be.undefined})),def("toBeTypeOf",(function(e){const t=typeof this._obj,s=e===t;return this.assert(s,"expected #{this} to be type of #{exp}","expected #{this} not to be type of #{exp}",e,t)})),def("toBeInstanceOf",(function(e){return this.instanceOf(e)})),def("toHaveLength",(function(e){return this.have.length(e)})),def("toHaveProperty",(function(...e){Array.isArray(e[0])&&(e[0]=e[0].map((e=>String(e).replace(/([.[\]])/g,"\\$1"))).join("."));const t=this._obj,[s,r]=e,{value:o,exists:i}=Object.prototype.hasOwnProperty.call(t,s)?{value:t[s],exists:!0}:n.getPathInfo(t,s),a=i&&(1===e.length||equals(r,o)),l=1===e.length?"":` with value ${n.objDisplay(r)}`;return this.assert(a,`expected #{this} to have property "${s}"${l}`,`expected #{this} to not have property "${s}"${l}`,t)})),def("toBeCloseTo",(function(e,t=2){const s=this._obj;let n=!1,r=0,o=0;return e===Number.POSITIVE_INFINITY&&s===Number.POSITIVE_INFINITY||e===Number.NEGATIVE_INFINITY&&s===Number.NEGATIVE_INFINITY?n=!0:(r=10**-t/2,o=Math.abs(s-e),n=o<r),this.assert(n,`expected #{this} to be close to #{exp}, received difference is ${o}, but expected ${r}`,`expected #{this} to not be close to #{exp}, received difference is ${o}, but expected ${r}`,e,s,!1)}));const getSpy=e=>((e=>{if(!s.isMockFunction(e._obj))throw new TypeError(`${n.inspect(e._obj)} is not a spy or a call to a spy!`)})(e),e._obj),ordinalOf=e=>{const t=e%10,s=e%100;return 1===t&&11!==s?`${e}st`:2===t&&12!==s?`${e}nd`:3===t&&13!==s?`${e}rd`:`${e}th`},formatCalls=(e,s,n)=>(e.mock.calls&&(s+=c().gray(`\n\nReceived: \n\n${e.mock.calls.map(((s,r)=>{let i=c().bold(`  ${ordinalOf(r+1)} ${e.getMockName()} call:\n\n`);return i+=n?t.diff(n,s,{omitAnnotationLines:!0}):o.s(s).split("\n").map((e=>`    ${e}`)).join("\n"),i+="\n",i})).join("\n")}`)),s+=c().gray(`\n\nNumber of calls: ${c().bold(e.mock.calls.length)}\n`));def(["toHaveBeenCalledTimes","toBeCalledTimes"],(function(e){const t=getSpy(this),s=t.getMockName(),n=t.mock.calls.length;return this.assert(n===e,`expected "${s}" to be called #{exp} times, but got ${n} times`,`expected "${s}" to not be called #{exp} times`,e,n,!1)})),def("toHaveBeenCalledOnce",(function(){const e=getSpy(this),t=e.getMockName(),s=e.mock.calls.length;return this.assert(1===s,`expected "${t}" to be called once, but got ${s} times`,`expected "${t}" to not be called once`,1,s,!1)})),def(["toHaveBeenCalled","toBeCalled"],(function(){const e=getSpy(this),t=e.getMockName(),s=e.mock.calls.length,o=s>0,i=n.flag(this,"negate");let a=n.getMessage(this,[o,`expected "${t}" to be called at least once`,`expected "${t}" to not be called at all, but actually been called ${s} times`,!0,o]);if(o&&i&&(a=formatCalls(e,a)),o&&i||!o&&!i)throw new r(a)})),def(["toHaveBeenCalledWith","toBeCalledWith"],(function(...e){const t=getSpy(this),s=t.getMockName(),o=t.mock.calls.some((t=>equals(t,e,[iterableEquality]))),i=n.flag(this,"negate"),a=n.getMessage(this,[o,`expected "${s}" to be called with arguments: #{exp}`,`expected "${s}" to not be called with arguments: #{exp}`,e]);if(o&&i||!o&&!i)throw new r(formatCalls(t,a,e))})),def(["toHaveBeenNthCalledWith","nthCalledWith"],(function(e,...t){const s=getSpy(this),n=s.getMockName(),r=s.mock.calls[e-1];this.assert(equals(r,t,[iterableEquality]),`expected ${ordinalOf(e)} "${n}" call to have been called with #{exp}`,`expected ${ordinalOf(e)} "${n}" call to not have been called with #{exp}`,t,r)})),def(["toHaveBeenLastCalledWith","lastCalledWith"],(function(...e){const t=getSpy(this),s=t.getMockName(),n=t.mock.calls[t.mock.calls.length-1];this.assert(equals(n,e,[iterableEquality]),`expected last "${s}" call to have been called with #{exp}`,`expected last "${s}" call to not have been called with #{exp}`,e,n)})),def(["toThrow","toThrowError"],(function(e){if("string"==typeof e||void 0===e||e instanceof RegExp)return this.throws(e);const t=this._obj,s=n.flag(this,"promise"),o=n.flag(this,"negate");let i=null;if("rejects"===s)i=t;else{if("resolves"===s&&"function"!=typeof t){if(o)return;{const e=n.flag(this,"message")||"expected promise to throw an error, but it didn't";throw new r(e,{showDiff:!1},n.flag(this,"ssfi"))}}{let e=!1;try{t()}catch(t){e=!0,i=t}if(!e&&!o){const e=n.flag(this,"message")||"expected function to throw an error, but it didn't";throw new r(e,{showDiff:!1},n.flag(this,"ssfi"))}}}if("function"==typeof e){const t=e.name||e.prototype.constructor.name;return this.assert(i&&i instanceof e,`expected error to be instance of ${t}`,`expected error not to be instance of ${t}`,e,i,!1)}if(e instanceof Error)return this.assert(i&&e.message===i.message,`expected error to have message: ${e.message}`,`expected error not to have message: ${e.message}`,e.message,i&&i.message);if("object"==typeof e&&"asymmetricMatch"in e&&"function"==typeof e.asymmetricMatch){const t=e;return this.assert(i&&t.asymmetricMatch(i),"expected error to match asymmetric matcher","expected error not to match asymmetric matcher",t.toString(),i,!1)}throw new Error(`"toThrow" expects string, RegExp, function, Error instance or asymmetric matcher, got "${typeof e}"`)})),def(["toHaveReturned","toReturn"],(function(){const e=getSpy(this),t=e.getMockName(),s=e.mock.calls.length>0&&e.mock.results.some((({type:e})=>"throw"!==e));this.assert(s,`expected "${t}" to be successfully called at least once`,`expected "${t}" to not be successfully called`,s,!s,!1)})),def(["toHaveReturnedTimes","toReturnTimes"],(function(e){const t=getSpy(this),s=t.getMockName(),n=t.mock.results.reduce(((e,{type:t})=>"throw"===t?e:++e),0);this.assert(n===e,`expected "${s}" to be successfully called ${e} times`,`expected "${s}" to not be successfully called ${e} times`,`expected number of returns: ${e}`,`received number of returns: ${n}`,!1)})),def(["toHaveReturnedWith","toReturnWith"],(function(e){const s=getSpy(this),i=s.getMockName(),a=s.mock.results.some((({type:t,value:s})=>"return"===t&&equals(e,s))),l=n.flag(this,"negate"),u=n.getMessage(this,[a,`expected "${i}" to return with: #{exp} at least once`,`expected "${i}" to not return with: #{exp}`,e]);if(a&&l||!a&&!l)throw new r(((e,s,n)=>(s+=c().gray(`\n\nReceived: \n\n${e.mock.results.map(((s,r)=>{let i=c().bold(`  ${ordinalOf(r+1)} ${e.getMockName()} call return:\n\n`);return i+=n?t.diff(n,s.value,{omitAnnotationLines:!0}):o.s(s).split("\n").map((e=>`    ${e}`)).join("\n"),i+="\n",i})).join("\n")}`),s+c().gray(`\n\nNumber of calls: ${c().bold(e.mock.calls.length)}\n`)))(s,u,e))})),def(["toHaveLastReturnedWith","lastReturnedWith"],(function(e){const t=getSpy(this),s=t.getMockName(),{value:n}=t.mock.results[t.mock.results.length-1],r=equals(n,e);this.assert(r,`expected last "${s}" call to return #{exp}`,`expected last "${s}" call to not return #{exp}`,e,n)})),def(["toHaveNthReturnedWith","nthReturnedWith"],(function(t,s){const r=getSpy(this),o=r.getMockName(),i=n.flag(this,"negate"),{type:a,value:l}=r.mock.results[t-1],u=`${ordinalOf(t)} call`;i||"throw"!==a||e.assert.fail(`expected ${u} to return #{exp}, but instead it threw an error`);const h=equals(l,s);this.assert(h,`expected ${u} "${o}" call to return #{exp}`,`expected ${u} "${o}" call to not return #{exp}`,s,l)})),def("toSatisfy",(function(e,t){return this.be.satisfy(e,t)})),n.addProperty(e.Assertion.prototype,"resolves",(function __VITEST_RESOLVES__(){const t=new Error("resolves");n.flag(this,"promise","resolves"),n.flag(this,"error",t);const s=n.flag(this,"vitest-test"),o=n.flag(this,"object");if("function"!=typeof(null==o?void 0:o.then))throw new TypeError(`You must provide a Promise to expect() when using .resolves, not '${typeof o}'.`);const i=new Proxy(this,{get:(a,l,u)=>{const h=Reflect.get(a,l,u);return"function"!=typeof h?h instanceof e.Assertion?i:h:async(...e)=>{const i=o.then((t=>(n.flag(this,"object",t),h.call(this,...e))),(e=>{const s=new r(`promise rejected "${n.inspect(e)}" instead of resolving`,{showDiff:!1});throw s.stack=t.stack.replace(t.message,s.message),s}));return recordAsyncExpect(s,i)}}});return i})),n.addProperty(e.Assertion.prototype,"rejects",(function __VITEST_REJECTS__(){const t=new Error("rejects");n.flag(this,"promise","rejects"),n.flag(this,"error",t);const s=n.flag(this,"vitest-test"),o=n.flag(this,"object"),i="function"==typeof o?o():o;if("function"!=typeof(null==i?void 0:i.then))throw new TypeError(`You must provide a Promise to expect() when using .rejects, not '${typeof i}'.`);const a=new Proxy(this,{get:(o,l,u)=>{const h=Reflect.get(o,l,u);return"function"!=typeof h?h instanceof e.Assertion?a:h:async(...e)=>{const o=i.then((e=>{const s=new r(`promise resolved "${n.inspect(e)}" instead of rejecting`,{showDiff:!1});throw s.stack=t.stack.replace(t.message,s.message),s}),(t=>(n.flag(this,"object",t),h.call(this,...e))));return recordAsyncExpect(s,o)}}});return a}))},e.JestExtend=(e,t)=>{t.addMethod(e.expect,"extend",((t,s)=>{e.use(JestExtendPlugin(t,s))}))},e.MATCHERS_OBJECT=l,e.ObjectContaining=ObjectContaining,e.StringContaining=StringContaining,e.StringMatching=StringMatching,e.arrayBufferEquality=arrayBufferEquality,e.equals=equals,e.generateToBeMessage=generateToBeMessage,e.getState=getState,e.isA=isA,e.isAsymmetric=isAsymmetric,e.isImmutableUnorderedKeyed=isImmutableUnorderedKeyed,e.isImmutableUnorderedSet=isImmutableUnorderedSet,e.iterableEquality=iterableEquality,e.setState=function setState(e,t){const s=globalThis[l],n=s.get(t)||{};Object.assign(n,e),s.set(t,n)},e.sparseArrayEquality=sparseArrayEquality,e.subsetEquality=subsetEquality,e.typeEquality=typeEquality}));
+//# sourceMappingURL=index.amd.js.map

package/dist/browser/node_modules/.pnpm/@vitest_expect@0.34.6/node_modules/@vitest/expect/dist/index.amd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.amd.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@vitest+expect@0.34.6/node_modules/@vitest/expect/dist/index.js"],"sourcesContent":["import { getColors, stringify, isObject, assertTypes } from '@vitest/utils';\nexport { setupColors } from '@vitest/utils';\nimport { diff } from '@vitest/utils/diff';\nimport { isMockFunction } from '@vitest/spy';\nimport { processError } from '@vitest/utils/error';\nimport { util } from 'chai';\n\nconst MATCHERS_OBJECT = Symbol.for(\"matchers-object\");\nconst JEST_MATCHERS_OBJECT = Symbol.for(\"$$jest-matchers-object\");\nconst GLOBAL_EXPECT = Symbol.for(\"expect-global\");\n\nif (!Object.prototype.hasOwnProperty.call(globalThis, MATCHERS_OBJECT)) {\n  const globalState = /* @__PURE__ */ new WeakMap();\n  const matchers = /* @__PURE__ */ Object.create(null);\n  Object.defineProperty(globalThis, MATCHERS_OBJECT, {\n    get: () => globalState\n  });\n  Object.defineProperty(globalThis, JEST_MATCHERS_OBJECT, {\n    configurable: true,\n    get: () => ({\n      state: globalState.get(globalThis[GLOBAL_EXPECT]),\n      matchers\n    })\n  });\n}\nfunction getState(expect) {\n  return globalThis[MATCHERS_OBJECT].get(expect);\n}\nfunction setState(state, expect) {\n  const map = globalThis[MATCHERS_OBJECT];\n  const current = map.get(expect) || {};\n  Object.assign(current, state);\n  map.set(expect, current);\n}\n\nfunction getMatcherUtils() {\n  const c = () => getColors();\n  const EXPECTED_COLOR = c().green;\n  const RECEIVED_COLOR = c().red;\n  const INVERTED_COLOR = c().inverse;\n  const BOLD_WEIGHT = c().bold;\n  const DIM_COLOR = c().dim;\n  function matcherHint(matcherName, received = \"received\", expected = \"expected\", options = {}) {\n    const {\n      comment = \"\",\n      isDirectExpectCall = false,\n      // seems redundant with received === ''\n      isNot = false,\n      promise = \"\",\n      secondArgument = \"\",\n      expectedColor = EXPECTED_COLOR,\n      receivedColor = RECEIVED_COLOR,\n      secondArgumentColor = EXPECTED_COLOR\n    } = options;\n    let hint = \"\";\n    let dimString = \"expect\";\n    if (!isDirectExpectCall && received !== \"\") {\n      hint += DIM_COLOR(`${dimString}(`) + receivedColor(received);\n      dimString = \")\";\n    }\n    if (promise !== \"\") {\n      hint += DIM_COLOR(`${dimString}.`) + promise;\n      dimString = \"\";\n    }\n    if (isNot) {\n      hint += `${DIM_COLOR(`${dimString}.`)}not`;\n      dimString = \"\";\n    }\n    if (matcherName.includes(\".\")) {\n      dimString += matcherName;\n    } else {\n      hint += DIM_COLOR(`${dimString}.`) + matcherName;\n      dimString = \"\";\n    }\n    if (expected === \"\") {\n      dimString += \"()\";\n    } else {\n      hint += DIM_COLOR(`${dimString}(`) + expectedColor(expected);\n      if (secondArgument)\n        hint += DIM_COLOR(\", \") + secondArgumentColor(secondArgument);\n      dimString = \")\";\n    }\n    if (comment !== \"\")\n      dimString += ` // ${comment}`;\n    if (dimString !== \"\")\n      hint += DIM_COLOR(dimString);\n    return hint;\n  }\n  const SPACE_SYMBOL = \"\\xB7\";\n  const replaceTrailingSpaces = (text) => text.replace(/\\s+$/gm, (spaces) => SPACE_SYMBOL.repeat(spaces.length));\n  const printReceived = (object) => RECEIVED_COLOR(replaceTrailingSpaces(stringify(object)));\n  const printExpected = (value) => EXPECTED_COLOR(replaceTrailingSpaces(stringify(value)));\n  return {\n    EXPECTED_COLOR,\n    RECEIVED_COLOR,\n    INVERTED_COLOR,\n    BOLD_WEIGHT,\n    DIM_COLOR,\n    matcherHint,\n    printReceived,\n    printExpected\n  };\n}\n\nfunction equals(a, b, customTesters, strictCheck) {\n  customTesters = customTesters || [];\n  return eq(a, b, [], [], customTesters, strictCheck ? hasKey : hasDefinedKey);\n}\nconst functionToString = Function.prototype.toString;\nfunction isAsymmetric(obj) {\n  return !!obj && typeof obj === \"object\" && \"asymmetricMatch\" in obj && isA(\"Function\", obj.asymmetricMatch);\n}\nfunction hasAsymmetric(obj, seen = /* @__PURE__ */ new Set()) {\n  if (seen.has(obj))\n    return false;\n  seen.add(obj);\n  if (isAsymmetric(obj))\n    return true;\n  if (Array.isArray(obj))\n    return obj.some((i) => hasAsymmetric(i, seen));\n  if (obj instanceof Set)\n    return Array.from(obj).some((i) => hasAsymmetric(i, seen));\n  if (isObject(obj))\n    return Object.values(obj).some((v) => hasAsymmetric(v, seen));\n  return false;\n}\nfunction asymmetricMatch(a, b) {\n  const asymmetricA = isAsymmetric(a);\n  const asymmetricB = isAsymmetric(b);\n  if (asymmetricA && asymmetricB)\n    return void 0;\n  if (asymmetricA)\n    return a.asymmetricMatch(b);\n  if (asymmetricB)\n    return b.asymmetricMatch(a);\n}\nfunction eq(a, b, aStack, bStack, customTesters, hasKey2) {\n  let result = true;\n  const asymmetricResult = asymmetricMatch(a, b);\n  if (asymmetricResult !== void 0)\n    return asymmetricResult;\n  for (let i = 0; i < customTesters.length; i++) {\n    const customTesterResult = customTesters[i](a, b);\n    if (customTesterResult !== void 0)\n      return customTesterResult;\n  }\n  if (a instanceof Error && b instanceof Error)\n    return a.message === b.message;\n  if (Object.is(a, b))\n    return true;\n  if (a === null || b === null)\n    return a === b;\n  const className = Object.prototype.toString.call(a);\n  if (className !== Object.prototype.toString.call(b))\n    return false;\n  switch (className) {\n    case \"[object Boolean]\":\n    case \"[object String]\":\n    case \"[object Number]\":\n      if (typeof a !== typeof b) {\n        return false;\n      } else if (typeof a !== \"object\" && typeof b !== \"object\") {\n        return Object.is(a, b);\n      } else {\n        return Object.is(a.valueOf(), b.valueOf());\n      }\n    case \"[object Date]\": {\n      const numA = +a;\n      const numB = +b;\n      return numA === numB || Number.isNaN(numA) && Number.isNaN(numB);\n    }\n    case \"[object RegExp]\":\n      return a.source === b.source && a.flags === b.flags;\n  }\n  if (typeof a !== \"object\" || typeof b !== \"object\")\n    return false;\n  if (isDomNode(a) && isDomNode(b))\n    return a.isEqualNode(b);\n  let length = aStack.length;\n  while (length--) {\n    if (aStack[length] === a)\n      return bStack[length] === b;\n    else if (bStack[length] === b)\n      return false;\n  }\n  aStack.push(a);\n  bStack.push(b);\n  if (className === \"[object Array]\" && a.length !== b.length)\n    return false;\n  const aKeys = keys(a, hasKey2);\n  let key;\n  let size = aKeys.length;\n  if (keys(b, hasKey2).length !== size)\n    return false;\n  while (size--) {\n    key = aKeys[size];\n    result = hasKey2(b, key) && eq(a[key], b[key], aStack, bStack, customTesters, hasKey2);\n    if (!result)\n      return false;\n  }\n  aStack.pop();\n  bStack.pop();\n  return result;\n}\nfunction keys(obj, hasKey2) {\n  const keys2 = [];\n  for (const key in obj) {\n    if (hasKey2(obj, key))\n      keys2.push(key);\n  }\n  return keys2.concat(\n    Object.getOwnPropertySymbols(obj).filter(\n      (symbol) => Object.getOwnPropertyDescriptor(obj, symbol).enumerable\n    )\n  );\n}\nfunction hasDefinedKey(obj, key) {\n  return hasKey(obj, key) && obj[key] !== void 0;\n}\nfunction hasKey(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\nfunction isA(typeName, value) {\n  return Object.prototype.toString.apply(value) === `[object ${typeName}]`;\n}\nfunction isDomNode(obj) {\n  return obj !== null && typeof obj === \"object\" && \"nodeType\" in obj && typeof obj.nodeType === \"number\" && \"nodeName\" in obj && typeof obj.nodeName === \"string\" && \"isEqualNode\" in obj && typeof obj.isEqualNode === \"function\";\n}\nfunction fnNameFor(func) {\n  if (func.name)\n    return func.name;\n  const matches = functionToString.call(func).match(/^(?:async)?\\s*function\\s*\\*?\\s*([\\w$]+)\\s*\\(/);\n  return matches ? matches[1] : \"<anonymous>\";\n}\nfunction getPrototype(obj) {\n  if (Object.getPrototypeOf)\n    return Object.getPrototypeOf(obj);\n  if (obj.constructor.prototype === obj)\n    return null;\n  return obj.constructor.prototype;\n}\nfunction hasProperty(obj, property) {\n  if (!obj)\n    return false;\n  if (Object.prototype.hasOwnProperty.call(obj, property))\n    return true;\n  return hasProperty(getPrototype(obj), property);\n}\nconst IS_KEYED_SENTINEL = \"@@__IMMUTABLE_KEYED__@@\";\nconst IS_SET_SENTINEL = \"@@__IMMUTABLE_SET__@@\";\nconst IS_ORDERED_SENTINEL = \"@@__IMMUTABLE_ORDERED__@@\";\nfunction isImmutableUnorderedKeyed(maybeKeyed) {\n  return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL] && !maybeKeyed[IS_ORDERED_SENTINEL]);\n}\nfunction isImmutableUnorderedSet(maybeSet) {\n  return !!(maybeSet && maybeSet[IS_SET_SENTINEL] && !maybeSet[IS_ORDERED_SENTINEL]);\n}\nconst IteratorSymbol = Symbol.iterator;\nfunction hasIterator(object) {\n  return !!(object != null && object[IteratorSymbol]);\n}\nfunction iterableEquality(a, b, aStack = [], bStack = []) {\n  if (typeof a !== \"object\" || typeof b !== \"object\" || Array.isArray(a) || Array.isArray(b) || !hasIterator(a) || !hasIterator(b))\n    return void 0;\n  if (a.constructor !== b.constructor)\n    return false;\n  let length = aStack.length;\n  while (length--) {\n    if (aStack[length] === a)\n      return bStack[length] === b;\n  }\n  aStack.push(a);\n  bStack.push(b);\n  const iterableEqualityWithStack = (a2, b2) => iterableEquality(a2, b2, [...aStack], [...bStack]);\n  if (a.size !== void 0) {\n    if (a.size !== b.size) {\n      return false;\n    } else if (isA(\"Set\", a) || isImmutableUnorderedSet(a)) {\n      let allFound = true;\n      for (const aValue of a) {\n        if (!b.has(aValue)) {\n          let has = false;\n          for (const bValue of b) {\n            const isEqual = equals(aValue, bValue, [iterableEqualityWithStack]);\n            if (isEqual === true)\n              has = true;\n          }\n          if (has === false) {\n            allFound = false;\n            break;\n          }\n        }\n      }\n      aStack.pop();\n      bStack.pop();\n      return allFound;\n    } else if (isA(\"Map\", a) || isImmutableUnorderedKeyed(a)) {\n      let allFound = true;\n      for (const aEntry of a) {\n        if (!b.has(aEntry[0]) || !equals(aEntry[1], b.get(aEntry[0]), [iterableEqualityWithStack])) {\n          let has = false;\n          for (const bEntry of b) {\n            const matchedKey = equals(aEntry[0], bEntry[0], [\n              iterableEqualityWithStack\n            ]);\n            let matchedValue = false;\n            if (matchedKey === true) {\n              matchedValue = equals(aEntry[1], bEntry[1], [\n                iterableEqualityWithStack\n              ]);\n            }\n            if (matchedValue === true)\n              has = true;\n          }\n          if (has === false) {\n            allFound = false;\n            break;\n          }\n        }\n      }\n      aStack.pop();\n      bStack.pop();\n      return allFound;\n    }\n  }\n  const bIterator = b[IteratorSymbol]();\n  for (const aValue of a) {\n    const nextB = bIterator.next();\n    if (nextB.done || !equals(aValue, nextB.value, [iterableEqualityWithStack]))\n      return false;\n  }\n  if (!bIterator.next().done)\n    return false;\n  aStack.pop();\n  bStack.pop();\n  return true;\n}\nfunction hasPropertyInObject(object, key) {\n  const shouldTerminate = !object || typeof object !== \"object\" || object === Object.prototype;\n  if (shouldTerminate)\n    return false;\n  return Object.prototype.hasOwnProperty.call(object, key) || hasPropertyInObject(Object.getPrototypeOf(object), key);\n}\nfunction isObjectWithKeys(a) {\n  return isObject(a) && !(a instanceof Error) && !Array.isArray(a) && !(a instanceof Date);\n}\nfunction subsetEquality(object, subset) {\n  const subsetEqualityWithContext = (seenReferences = /* @__PURE__ */ new WeakMap()) => (object2, subset2) => {\n    if (!isObjectWithKeys(subset2))\n      return void 0;\n    return Object.keys(subset2).every((key) => {\n      if (isObjectWithKeys(subset2[key])) {\n        if (seenReferences.has(subset2[key]))\n          return equals(object2[key], subset2[key], [iterableEquality]);\n        seenReferences.set(subset2[key], true);\n      }\n      const result = object2 != null && hasPropertyInObject(object2, key) && equals(object2[key], subset2[key], [\n        iterableEquality,\n        subsetEqualityWithContext(seenReferences)\n      ]);\n      seenReferences.delete(subset2[key]);\n      return result;\n    });\n  };\n  return subsetEqualityWithContext()(object, subset);\n}\nfunction typeEquality(a, b) {\n  if (a == null || b == null || a.constructor === b.constructor)\n    return void 0;\n  return false;\n}\nfunction arrayBufferEquality(a, b) {\n  let dataViewA = a;\n  let dataViewB = b;\n  if (!(a instanceof DataView && b instanceof DataView)) {\n    if (!(a instanceof ArrayBuffer) || !(b instanceof ArrayBuffer))\n      return void 0;\n    try {\n      dataViewA = new DataView(a);\n      dataViewB = new DataView(b);\n    } catch {\n      return void 0;\n    }\n  }\n  if (dataViewA.byteLength !== dataViewB.byteLength)\n    return false;\n  for (let i = 0; i < dataViewA.byteLength; i++) {\n    if (dataViewA.getUint8(i) !== dataViewB.getUint8(i))\n      return false;\n  }\n  return true;\n}\nfunction sparseArrayEquality(a, b) {\n  if (!Array.isArray(a) || !Array.isArray(b))\n    return void 0;\n  const aKeys = Object.keys(a);\n  const bKeys = Object.keys(b);\n  return equals(a, b, [iterableEquality, typeEquality], true) && equals(aKeys, bKeys);\n}\nfunction generateToBeMessage(deepEqualityName, expected = \"#{this}\", actual = \"#{exp}\") {\n  const toBeMessage = `expected ${expected} to be ${actual} // Object.is equality`;\n  if ([\"toStrictEqual\", \"toEqual\"].includes(deepEqualityName))\n    return `${toBeMessage}\n\nIf it should pass with deep equality, replace \"toBe\" with \"${deepEqualityName}\"\n\nExpected: ${expected}\nReceived: serializes to the same string\n`;\n  return toBeMessage;\n}\n\nclass AsymmetricMatcher {\n  constructor(sample, inverse = false) {\n    this.sample = sample;\n    this.inverse = inverse;\n  }\n  // should have \"jest\" to be compatible with its ecosystem\n  $$typeof = Symbol.for(\"jest.asymmetricMatcher\");\n  getMatcherContext(expect) {\n    return {\n      ...getState(expect || globalThis[GLOBAL_EXPECT]),\n      equals,\n      isNot: this.inverse,\n      utils: {\n        ...getMatcherUtils(),\n        diff,\n        stringify,\n        iterableEquality,\n        subsetEquality\n      }\n    };\n  }\n}\nclass StringContaining extends AsymmetricMatcher {\n  constructor(sample, inverse = false) {\n    if (!isA(\"String\", sample))\n      throw new Error(\"Expected is not a string\");\n    super(sample, inverse);\n  }\n  asymmetricMatch(other) {\n    const result = isA(\"String\", other) && other.includes(this.sample);\n    return this.inverse ? !result : result;\n  }\n  toString() {\n    return `String${this.inverse ? \"Not\" : \"\"}Containing`;\n  }\n  getExpectedType() {\n    return \"string\";\n  }\n}\nclass Anything extends AsymmetricMatcher {\n  asymmetricMatch(other) {\n    return other != null;\n  }\n  toString() {\n    return \"Anything\";\n  }\n  toAsymmetricMatcher() {\n    return \"Anything\";\n  }\n}\nclass ObjectContaining extends AsymmetricMatcher {\n  constructor(sample, inverse = false) {\n    super(sample, inverse);\n  }\n  getPrototype(obj) {\n    if (Object.getPrototypeOf)\n      return Object.getPrototypeOf(obj);\n    if (obj.constructor.prototype === obj)\n      return null;\n    return obj.constructor.prototype;\n  }\n  hasProperty(obj, property) {\n    if (!obj)\n      return false;\n    if (Object.prototype.hasOwnProperty.call(obj, property))\n      return true;\n    return this.hasProperty(this.getPrototype(obj), property);\n  }\n  asymmetricMatch(other) {\n    if (typeof this.sample !== \"object\") {\n      throw new TypeError(\n        `You must provide an object to ${this.toString()}, not '${typeof this.sample}'.`\n      );\n    }\n    let result = true;\n    for (const property in this.sample) {\n      if (!this.hasProperty(other, property) || !equals(this.sample[property], other[property])) {\n        result = false;\n        break;\n      }\n    }\n    return this.inverse ? !result : result;\n  }\n  toString() {\n    return `Object${this.inverse ? \"Not\" : \"\"}Containing`;\n  }\n  getExpectedType() {\n    return \"object\";\n  }\n}\nclass ArrayContaining extends AsymmetricMatcher {\n  constructor(sample, inverse = false) {\n    super(sample, inverse);\n  }\n  asymmetricMatch(other) {\n    if (!Array.isArray(this.sample)) {\n      throw new TypeError(\n        `You must provide an array to ${this.toString()}, not '${typeof this.sample}'.`\n      );\n    }\n    const result = this.sample.length === 0 || Array.isArray(other) && this.sample.every(\n      (item) => other.some((another) => equals(item, another))\n    );\n    return this.inverse ? !result : result;\n  }\n  toString() {\n    return `Array${this.inverse ? \"Not\" : \"\"}Containing`;\n  }\n  getExpectedType() {\n    return \"array\";\n  }\n}\nclass Any extends AsymmetricMatcher {\n  constructor(sample) {\n    if (typeof sample === \"undefined\") {\n      throw new TypeError(\n        \"any() expects to be passed a constructor function. Please pass one or use anything() to match any object.\"\n      );\n    }\n    super(sample);\n  }\n  fnNameFor(func) {\n    if (func.name)\n      return func.name;\n    const functionToString = Function.prototype.toString;\n    const matches = functionToString.call(func).match(/^(?:async)?\\s*function\\s*\\*?\\s*([\\w$]+)\\s*\\(/);\n    return matches ? matches[1] : \"<anonymous>\";\n  }\n  asymmetricMatch(other) {\n    if (this.sample === String)\n      return typeof other == \"string\" || other instanceof String;\n    if (this.sample === Number)\n      return typeof other == \"number\" || other instanceof Number;\n    if (this.sample === Function)\n      return typeof other == \"function\" || other instanceof Function;\n    if (this.sample === Boolean)\n      return typeof other == \"boolean\" || other instanceof Boolean;\n    if (this.sample === BigInt)\n      return typeof other == \"bigint\" || other instanceof BigInt;\n    if (this.sample === Symbol)\n      return typeof other == \"symbol\" || other instanceof Symbol;\n    if (this.sample === Object)\n      return typeof other == \"object\";\n    return other instanceof this.sample;\n  }\n  toString() {\n    return \"Any\";\n  }\n  getExpectedType() {\n    if (this.sample === String)\n      return \"string\";\n    if (this.sample === Number)\n      return \"number\";\n    if (this.sample === Function)\n      return \"function\";\n    if (this.sample === Object)\n      return \"object\";\n    if (this.sample === Boolean)\n      return \"boolean\";\n    return this.fnNameFor(this.sample);\n  }\n  toAsymmetricMatcher() {\n    return `Any<${this.fnNameFor(this.sample)}>`;\n  }\n}\nclass StringMatching extends AsymmetricMatcher {\n  constructor(sample, inverse = false) {\n    if (!isA(\"String\", sample) && !isA(\"RegExp\", sample))\n      throw new Error(\"Expected is not a String or a RegExp\");\n    super(new RegExp(sample), inverse);\n  }\n  asymmetricMatch(other) {\n    const result = isA(\"String\", other) && this.sample.test(other);\n    return this.inverse ? !result : result;\n  }\n  toString() {\n    return `String${this.inverse ? \"Not\" : \"\"}Matching`;\n  }\n  getExpectedType() {\n    return \"string\";\n  }\n}\nconst JestAsymmetricMatchers = (chai, utils) => {\n  utils.addMethod(\n    chai.expect,\n    \"anything\",\n    () => new Anything()\n  );\n  utils.addMethod(\n    chai.expect,\n    \"any\",\n    (expected) => new Any(expected)\n  );\n  utils.addMethod(\n    chai.expect,\n    \"stringContaining\",\n    (expected) => new StringContaining(expected)\n  );\n  utils.addMethod(\n    chai.expect,\n    \"objectContaining\",\n    (expected) => new ObjectContaining(expected)\n  );\n  utils.addMethod(\n    chai.expect,\n    \"arrayContaining\",\n    (expected) => new ArrayContaining(expected)\n  );\n  utils.addMethod(\n    chai.expect,\n    \"stringMatching\",\n    (expected) => new StringMatching(expected)\n  );\n  chai.expect.not = {\n    stringContaining: (expected) => new StringContaining(expected, true),\n    objectContaining: (expected) => new ObjectContaining(expected, true),\n    arrayContaining: (expected) => new ArrayContaining(expected, true),\n    stringMatching: (expected) => new StringMatching(expected, true)\n  };\n};\n\nfunction recordAsyncExpect(test, promise) {\n  if (test && promise instanceof Promise) {\n    promise = promise.finally(() => {\n      const index = test.promises.indexOf(promise);\n      if (index !== -1)\n        test.promises.splice(index, 1);\n    });\n    if (!test.promises)\n      test.promises = [];\n    test.promises.push(promise);\n  }\n  return promise;\n}\nfunction wrapSoft(utils, fn) {\n  return function(...args) {\n    var _a;\n    const test = utils.flag(this, \"vitest-test\");\n    const state = (test == null ? void 0 : test.context._local) ? test.context.expect.getState() : getState(globalThis[GLOBAL_EXPECT]);\n    if (!state.soft)\n      return fn.apply(this, args);\n    if (!test)\n      throw new Error(\"expect.soft() can only be used inside a test\");\n    try {\n      return fn.apply(this, args);\n    } catch (err) {\n      test.result || (test.result = { state: \"fail\" });\n      test.result.state = \"fail\";\n      (_a = test.result).errors || (_a.errors = []);\n      test.result.errors.push(processError(err));\n    }\n  };\n}\n\nconst JestChaiExpect = (chai, utils) => {\n  const { AssertionError } = chai;\n  const c = () => getColors();\n  function def(name, fn) {\n    const addMethod = (n) => {\n      const softWrapper = wrapSoft(utils, fn);\n      utils.addMethod(chai.Assertion.prototype, n, softWrapper);\n      utils.addMethod(globalThis[JEST_MATCHERS_OBJECT].matchers, n, softWrapper);\n    };\n    if (Array.isArray(name))\n      name.forEach((n) => addMethod(n));\n    else\n      addMethod(name);\n  }\n  [\"throw\", \"throws\", \"Throw\"].forEach((m) => {\n    utils.overwriteMethod(chai.Assertion.prototype, m, (_super) => {\n      return function(...args) {\n        const promise = utils.flag(this, \"promise\");\n        const object = utils.flag(this, \"object\");\n        const isNot = utils.flag(this, \"negate\");\n        if (promise === \"rejects\") {\n          utils.flag(this, \"object\", () => {\n            throw object;\n          });\n        } else if (promise === \"resolves\" && typeof object !== \"function\") {\n          if (!isNot) {\n            const message = utils.flag(this, \"message\") || \"expected promise to throw an error, but it didn't\";\n            const error = {\n              showDiff: false\n            };\n            throw new AssertionError(message, error, utils.flag(this, \"ssfi\"));\n          } else {\n            return;\n          }\n        }\n        _super.apply(this, args);\n      };\n    });\n  });\n  def(\"withTest\", function(test) {\n    utils.flag(this, \"vitest-test\", test);\n    return this;\n  });\n  def(\"toEqual\", function(expected) {\n    const actual = utils.flag(this, \"object\");\n    const equal = equals(\n      actual,\n      expected,\n      [iterableEquality]\n    );\n    return this.assert(\n      equal,\n      \"expected #{this} to deeply equal #{exp}\",\n      \"expected #{this} to not deeply equal #{exp}\",\n      expected,\n      actual\n    );\n  });\n  def(\"toStrictEqual\", function(expected) {\n    const obj = utils.flag(this, \"object\");\n    const equal = equals(\n      obj,\n      expected,\n      [\n        iterableEquality,\n        typeEquality,\n        sparseArrayEquality,\n        arrayBufferEquality\n      ],\n      true\n    );\n    return this.assert(\n      equal,\n      \"expected #{this} to strictly equal #{exp}\",\n      \"expected #{this} to not strictly equal #{exp}\",\n      expected,\n      obj\n    );\n  });\n  def(\"toBe\", function(expected) {\n    const actual = this._obj;\n    const pass = Object.is(actual, expected);\n    let deepEqualityName = \"\";\n    if (!pass) {\n      const toStrictEqualPass = equals(\n        actual,\n        expected,\n        [\n          iterableEquality,\n          typeEquality,\n          sparseArrayEquality,\n          arrayBufferEquality\n        ],\n        true\n      );\n      if (toStrictEqualPass) {\n        deepEqualityName = \"toStrictEqual\";\n      } else {\n        const toEqualPass = equals(\n          actual,\n          expected,\n          [iterableEquality]\n        );\n        if (toEqualPass)\n          deepEqualityName = \"toEqual\";\n      }\n    }\n    return this.assert(\n      pass,\n      generateToBeMessage(deepEqualityName),\n      \"expected #{this} not to be #{exp} // Object.is equality\",\n      expected,\n      actual\n    );\n  });\n  def(\"toMatchObject\", function(expected) {\n    const actual = this._obj;\n    return this.assert(\n      equals(actual, expected, [iterableEquality, subsetEquality]),\n      \"expected #{this} to match object #{exp}\",\n      \"expected #{this} to not match object #{exp}\",\n      expected,\n      actual\n    );\n  });\n  def(\"toMatch\", function(expected) {\n    if (typeof expected === \"string\")\n      return this.include(expected);\n    else\n      return this.match(expected);\n  });\n  def(\"toContain\", function(item) {\n    return this.contain(item);\n  });\n  def(\"toContainEqual\", function(expected) {\n    const obj = utils.flag(this, \"object\");\n    const index = Array.from(obj).findIndex((item) => {\n      return equals(item, expected);\n    });\n    this.assert(\n      index !== -1,\n      \"expected #{this} to deep equally contain #{exp}\",\n      \"expected #{this} to not deep equally contain #{exp}\",\n      expected\n    );\n  });\n  def(\"toBeTruthy\", function() {\n    const obj = utils.flag(this, \"object\");\n    this.assert(\n      Boolean(obj),\n      \"expected #{this} to be truthy\",\n      \"expected #{this} to not be truthy\",\n      obj,\n      false\n    );\n  });\n  def(\"toBeFalsy\", function() {\n    const obj = utils.flag(this, \"object\");\n    this.assert(\n      !obj,\n      \"expected #{this} to be falsy\",\n      \"expected #{this} to not be falsy\",\n      obj,\n      false\n    );\n  });\n  def(\"toBeGreaterThan\", function(expected) {\n    const actual = this._obj;\n    assertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n    assertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n    return this.assert(\n      actual > expected,\n      `expected ${actual} to be greater than ${expected}`,\n      `expected ${actual} to be not greater than ${expected}`,\n      actual,\n      expected,\n      false\n    );\n  });\n  def(\"toBeGreaterThanOrEqual\", function(expected) {\n    const actual = this._obj;\n    assertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n    assertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n    return this.assert(\n      actual >= expected,\n      `expected ${actual} to be greater than or equal to ${expected}`,\n      `expected ${actual} to be not greater than or equal to ${expected}`,\n      actual,\n      expected,\n      false\n    );\n  });\n  def(\"toBeLessThan\", function(expected) {\n    const actual = this._obj;\n    assertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n    assertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n    return this.assert(\n      actual < expected,\n      `expected ${actual} to be less than ${expected}`,\n      `expected ${actual} to be not less than ${expected}`,\n      actual,\n      expected,\n      false\n    );\n  });\n  def(\"toBeLessThanOrEqual\", function(expected) {\n    const actual = this._obj;\n    assertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n    assertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n    return this.assert(\n      actual <= expected,\n      `expected ${actual} to be less than or equal to ${expected}`,\n      `expected ${actual} to be not less than or equal to ${expected}`,\n      actual,\n      expected,\n      false\n    );\n  });\n  def(\"toBeNaN\", function() {\n    return this.be.NaN;\n  });\n  def(\"toBeUndefined\", function() {\n    return this.be.undefined;\n  });\n  def(\"toBeNull\", function() {\n    return this.be.null;\n  });\n  def(\"toBeDefined\", function() {\n    const negate = utils.flag(this, \"negate\");\n    utils.flag(this, \"negate\", false);\n    if (negate)\n      return this.be.undefined;\n    return this.not.be.undefined;\n  });\n  def(\"toBeTypeOf\", function(expected) {\n    const actual = typeof this._obj;\n    const equal = expected === actual;\n    return this.assert(\n      equal,\n      \"expected #{this} to be type of #{exp}\",\n      \"expected #{this} not to be type of #{exp}\",\n      expected,\n      actual\n    );\n  });\n  def(\"toBeInstanceOf\", function(obj) {\n    return this.instanceOf(obj);\n  });\n  def(\"toHaveLength\", function(length) {\n    return this.have.length(length);\n  });\n  def(\"toHaveProperty\", function(...args) {\n    if (Array.isArray(args[0]))\n      args[0] = args[0].map((key) => String(key).replace(/([.[\\]])/g, \"\\\\$1\")).join(\".\");\n    const actual = this._obj;\n    const [propertyName, expected] = args;\n    const getValue = () => {\n      const hasOwn = Object.prototype.hasOwnProperty.call(actual, propertyName);\n      if (hasOwn)\n        return { value: actual[propertyName], exists: true };\n      return utils.getPathInfo(actual, propertyName);\n    };\n    const { value, exists } = getValue();\n    const pass = exists && (args.length === 1 || equals(expected, value));\n    const valueString = args.length === 1 ? \"\" : ` with value ${utils.objDisplay(expected)}`;\n    return this.assert(\n      pass,\n      `expected #{this} to have property \"${propertyName}\"${valueString}`,\n      `expected #{this} to not have property \"${propertyName}\"${valueString}`,\n      actual\n    );\n  });\n  def(\"toBeCloseTo\", function(received, precision = 2) {\n    const expected = this._obj;\n    let pass = false;\n    let expectedDiff = 0;\n    let receivedDiff = 0;\n    if (received === Number.POSITIVE_INFINITY && expected === Number.POSITIVE_INFINITY) {\n      pass = true;\n    } else if (received === Number.NEGATIVE_INFINITY && expected === Number.NEGATIVE_INFINITY) {\n      pass = true;\n    } else {\n      expectedDiff = 10 ** -precision / 2;\n      receivedDiff = Math.abs(expected - received);\n      pass = receivedDiff < expectedDiff;\n    }\n    return this.assert(\n      pass,\n      `expected #{this} to be close to #{exp}, received difference is ${receivedDiff}, but expected ${expectedDiff}`,\n      `expected #{this} to not be close to #{exp}, received difference is ${receivedDiff}, but expected ${expectedDiff}`,\n      received,\n      expected,\n      false\n    );\n  });\n  const assertIsMock = (assertion) => {\n    if (!isMockFunction(assertion._obj))\n      throw new TypeError(`${utils.inspect(assertion._obj)} is not a spy or a call to a spy!`);\n  };\n  const getSpy = (assertion) => {\n    assertIsMock(assertion);\n    return assertion._obj;\n  };\n  const ordinalOf = (i) => {\n    const j = i % 10;\n    const k = i % 100;\n    if (j === 1 && k !== 11)\n      return `${i}st`;\n    if (j === 2 && k !== 12)\n      return `${i}nd`;\n    if (j === 3 && k !== 13)\n      return `${i}rd`;\n    return `${i}th`;\n  };\n  const formatCalls = (spy, msg, actualCall) => {\n    if (spy.mock.calls) {\n      msg += c().gray(`\n\nReceived: \n\n${spy.mock.calls.map((callArg, i) => {\n        let methodCall = c().bold(`  ${ordinalOf(i + 1)} ${spy.getMockName()} call:\n\n`);\n        if (actualCall)\n          methodCall += diff(actualCall, callArg, { omitAnnotationLines: true });\n        else\n          methodCall += stringify(callArg).split(\"\\n\").map((line) => `    ${line}`).join(\"\\n\");\n        methodCall += \"\\n\";\n        return methodCall;\n      }).join(\"\\n\")}`);\n    }\n    msg += c().gray(`\n\nNumber of calls: ${c().bold(spy.mock.calls.length)}\n`);\n    return msg;\n  };\n  const formatReturns = (spy, msg, actualReturn) => {\n    msg += c().gray(`\n\nReceived: \n\n${spy.mock.results.map((callReturn, i) => {\n      let methodCall = c().bold(`  ${ordinalOf(i + 1)} ${spy.getMockName()} call return:\n\n`);\n      if (actualReturn)\n        methodCall += diff(actualReturn, callReturn.value, { omitAnnotationLines: true });\n      else\n        methodCall += stringify(callReturn).split(\"\\n\").map((line) => `    ${line}`).join(\"\\n\");\n      methodCall += \"\\n\";\n      return methodCall;\n    }).join(\"\\n\")}`);\n    msg += c().gray(`\n\nNumber of calls: ${c().bold(spy.mock.calls.length)}\n`);\n    return msg;\n  };\n  def([\"toHaveBeenCalledTimes\", \"toBeCalledTimes\"], function(number) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const callCount = spy.mock.calls.length;\n    return this.assert(\n      callCount === number,\n      `expected \"${spyName}\" to be called #{exp} times, but got ${callCount} times`,\n      `expected \"${spyName}\" to not be called #{exp} times`,\n      number,\n      callCount,\n      false\n    );\n  });\n  def(\"toHaveBeenCalledOnce\", function() {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const callCount = spy.mock.calls.length;\n    return this.assert(\n      callCount === 1,\n      `expected \"${spyName}\" to be called once, but got ${callCount} times`,\n      `expected \"${spyName}\" to not be called once`,\n      1,\n      callCount,\n      false\n    );\n  });\n  def([\"toHaveBeenCalled\", \"toBeCalled\"], function() {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const callCount = spy.mock.calls.length;\n    const called = callCount > 0;\n    const isNot = utils.flag(this, \"negate\");\n    let msg = utils.getMessage(\n      this,\n      [\n        called,\n        `expected \"${spyName}\" to be called at least once`,\n        `expected \"${spyName}\" to not be called at all, but actually been called ${callCount} times`,\n        true,\n        called\n      ]\n    );\n    if (called && isNot)\n      msg = formatCalls(spy, msg);\n    if (called && isNot || !called && !isNot)\n      throw new AssertionError(msg);\n  });\n  def([\"toHaveBeenCalledWith\", \"toBeCalledWith\"], function(...args) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const pass = spy.mock.calls.some((callArg) => equals(callArg, args, [iterableEquality]));\n    const isNot = utils.flag(this, \"negate\");\n    const msg = utils.getMessage(\n      this,\n      [\n        pass,\n        `expected \"${spyName}\" to be called with arguments: #{exp}`,\n        `expected \"${spyName}\" to not be called with arguments: #{exp}`,\n        args\n      ]\n    );\n    if (pass && isNot || !pass && !isNot)\n      throw new AssertionError(formatCalls(spy, msg, args));\n  });\n  def([\"toHaveBeenNthCalledWith\", \"nthCalledWith\"], function(times, ...args) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const nthCall = spy.mock.calls[times - 1];\n    this.assert(\n      equals(nthCall, args, [iterableEquality]),\n      `expected ${ordinalOf(times)} \"${spyName}\" call to have been called with #{exp}`,\n      `expected ${ordinalOf(times)} \"${spyName}\" call to not have been called with #{exp}`,\n      args,\n      nthCall\n    );\n  });\n  def([\"toHaveBeenLastCalledWith\", \"lastCalledWith\"], function(...args) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const lastCall = spy.mock.calls[spy.mock.calls.length - 1];\n    this.assert(\n      equals(lastCall, args, [iterableEquality]),\n      `expected last \"${spyName}\" call to have been called with #{exp}`,\n      `expected last \"${spyName}\" call to not have been called with #{exp}`,\n      args,\n      lastCall\n    );\n  });\n  def([\"toThrow\", \"toThrowError\"], function(expected) {\n    if (typeof expected === \"string\" || typeof expected === \"undefined\" || expected instanceof RegExp)\n      return this.throws(expected);\n    const obj = this._obj;\n    const promise = utils.flag(this, \"promise\");\n    const isNot = utils.flag(this, \"negate\");\n    let thrown = null;\n    if (promise === \"rejects\") {\n      thrown = obj;\n    } else if (promise === \"resolves\" && typeof obj !== \"function\") {\n      if (!isNot) {\n        const message = utils.flag(this, \"message\") || \"expected promise to throw an error, but it didn't\";\n        const error = {\n          showDiff: false\n        };\n        throw new AssertionError(message, error, utils.flag(this, \"ssfi\"));\n      } else {\n        return;\n      }\n    } else {\n      let isThrow = false;\n      try {\n        obj();\n      } catch (err) {\n        isThrow = true;\n        thrown = err;\n      }\n      if (!isThrow && !isNot) {\n        const message = utils.flag(this, \"message\") || \"expected function to throw an error, but it didn't\";\n        const error = {\n          showDiff: false\n        };\n        throw new AssertionError(message, error, utils.flag(this, \"ssfi\"));\n      }\n    }\n    if (typeof expected === \"function\") {\n      const name = expected.name || expected.prototype.constructor.name;\n      return this.assert(\n        thrown && thrown instanceof expected,\n        `expected error to be instance of ${name}`,\n        `expected error not to be instance of ${name}`,\n        expected,\n        thrown,\n        false\n      );\n    }\n    if (expected instanceof Error) {\n      return this.assert(\n        thrown && expected.message === thrown.message,\n        `expected error to have message: ${expected.message}`,\n        `expected error not to have message: ${expected.message}`,\n        expected.message,\n        thrown && thrown.message\n      );\n    }\n    if (typeof expected === \"object\" && \"asymmetricMatch\" in expected && typeof expected.asymmetricMatch === \"function\") {\n      const matcher = expected;\n      return this.assert(\n        thrown && matcher.asymmetricMatch(thrown),\n        \"expected error to match asymmetric matcher\",\n        \"expected error not to match asymmetric matcher\",\n        matcher.toString(),\n        thrown,\n        false\n      );\n    }\n    throw new Error(`\"toThrow\" expects string, RegExp, function, Error instance or asymmetric matcher, got \"${typeof expected}\"`);\n  });\n  def([\"toHaveReturned\", \"toReturn\"], function() {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const calledAndNotThrew = spy.mock.calls.length > 0 && spy.mock.results.some(({ type }) => type !== \"throw\");\n    this.assert(\n      calledAndNotThrew,\n      `expected \"${spyName}\" to be successfully called at least once`,\n      `expected \"${spyName}\" to not be successfully called`,\n      calledAndNotThrew,\n      !calledAndNotThrew,\n      false\n    );\n  });\n  def([\"toHaveReturnedTimes\", \"toReturnTimes\"], function(times) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const successfulReturns = spy.mock.results.reduce((success, { type }) => type === \"throw\" ? success : ++success, 0);\n    this.assert(\n      successfulReturns === times,\n      `expected \"${spyName}\" to be successfully called ${times} times`,\n      `expected \"${spyName}\" to not be successfully called ${times} times`,\n      `expected number of returns: ${times}`,\n      `received number of returns: ${successfulReturns}`,\n      false\n    );\n  });\n  def([\"toHaveReturnedWith\", \"toReturnWith\"], function(value) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const pass = spy.mock.results.some(({ type, value: result }) => type === \"return\" && equals(value, result));\n    const isNot = utils.flag(this, \"negate\");\n    const msg = utils.getMessage(\n      this,\n      [\n        pass,\n        `expected \"${spyName}\" to return with: #{exp} at least once`,\n        `expected \"${spyName}\" to not return with: #{exp}`,\n        value\n      ]\n    );\n    if (pass && isNot || !pass && !isNot)\n      throw new AssertionError(formatReturns(spy, msg, value));\n  });\n  def([\"toHaveLastReturnedWith\", \"lastReturnedWith\"], function(value) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const { value: lastResult } = spy.mock.results[spy.mock.results.length - 1];\n    const pass = equals(lastResult, value);\n    this.assert(\n      pass,\n      `expected last \"${spyName}\" call to return #{exp}`,\n      `expected last \"${spyName}\" call to not return #{exp}`,\n      value,\n      lastResult\n    );\n  });\n  def([\"toHaveNthReturnedWith\", \"nthReturnedWith\"], function(nthCall, value) {\n    const spy = getSpy(this);\n    const spyName = spy.getMockName();\n    const isNot = utils.flag(this, \"negate\");\n    const { type: callType, value: callResult } = spy.mock.results[nthCall - 1];\n    const ordinalCall = `${ordinalOf(nthCall)} call`;\n    if (!isNot && callType === \"throw\")\n      chai.assert.fail(`expected ${ordinalCall} to return #{exp}, but instead it threw an error`);\n    const nthCallReturn = equals(callResult, value);\n    this.assert(\n      nthCallReturn,\n      `expected ${ordinalCall} \"${spyName}\" call to return #{exp}`,\n      `expected ${ordinalCall} \"${spyName}\" call to not return #{exp}`,\n      value,\n      callResult\n    );\n  });\n  def(\"toSatisfy\", function(matcher, message) {\n    return this.be.satisfy(matcher, message);\n  });\n  utils.addProperty(chai.Assertion.prototype, \"resolves\", function __VITEST_RESOLVES__() {\n    const error = new Error(\"resolves\");\n    utils.flag(this, \"promise\", \"resolves\");\n    utils.flag(this, \"error\", error);\n    const test = utils.flag(this, \"vitest-test\");\n    const obj = utils.flag(this, \"object\");\n    if (typeof (obj == null ? void 0 : obj.then) !== \"function\")\n      throw new TypeError(`You must provide a Promise to expect() when using .resolves, not '${typeof obj}'.`);\n    const proxy = new Proxy(this, {\n      get: (target, key, receiver) => {\n        const result = Reflect.get(target, key, receiver);\n        if (typeof result !== \"function\")\n          return result instanceof chai.Assertion ? proxy : result;\n        return async (...args) => {\n          const promise = obj.then(\n            (value) => {\n              utils.flag(this, \"object\", value);\n              return result.call(this, ...args);\n            },\n            (err) => {\n              const _error = new AssertionError(\n                `promise rejected \"${utils.inspect(err)}\" instead of resolving`,\n                { showDiff: false }\n              );\n              _error.stack = error.stack.replace(error.message, _error.message);\n              throw _error;\n            }\n          );\n          return recordAsyncExpect(test, promise);\n        };\n      }\n    });\n    return proxy;\n  });\n  utils.addProperty(chai.Assertion.prototype, \"rejects\", function __VITEST_REJECTS__() {\n    const error = new Error(\"rejects\");\n    utils.flag(this, \"promise\", \"rejects\");\n    utils.flag(this, \"error\", error);\n    const test = utils.flag(this, \"vitest-test\");\n    const obj = utils.flag(this, \"object\");\n    const wrapper = typeof obj === \"function\" ? obj() : obj;\n    if (typeof (wrapper == null ? void 0 : wrapper.then) !== \"function\")\n      throw new TypeError(`You must provide a Promise to expect() when using .rejects, not '${typeof wrapper}'.`);\n    const proxy = new Proxy(this, {\n      get: (target, key, receiver) => {\n        const result = Reflect.get(target, key, receiver);\n        if (typeof result !== \"function\")\n          return result instanceof chai.Assertion ? proxy : result;\n        return async (...args) => {\n          const promise = wrapper.then(\n            (value) => {\n              const _error = new AssertionError(\n                `promise resolved \"${utils.inspect(value)}\" instead of rejecting`,\n                { showDiff: false }\n              );\n              _error.stack = error.stack.replace(error.message, _error.message);\n              throw _error;\n            },\n            (err) => {\n              utils.flag(this, \"object\", err);\n              return result.call(this, ...args);\n            }\n          );\n          return recordAsyncExpect(test, promise);\n        };\n      }\n    });\n    return proxy;\n  });\n};\n\nfunction getMatcherState(assertion, expect) {\n  const obj = assertion._obj;\n  const isNot = util.flag(assertion, \"negate\");\n  const promise = util.flag(assertion, \"promise\") || \"\";\n  const jestUtils = {\n    ...getMatcherUtils(),\n    diff,\n    stringify,\n    iterableEquality,\n    subsetEquality\n  };\n  const matcherState = {\n    ...getState(expect),\n    isNot,\n    utils: jestUtils,\n    promise,\n    equals,\n    // needed for built-in jest-snapshots, but we don't use it\n    suppressedErrors: []\n  };\n  return {\n    state: matcherState,\n    isNot,\n    obj\n  };\n}\nclass JestExtendError extends Error {\n  constructor(message, actual, expected) {\n    super(message);\n    this.actual = actual;\n    this.expected = expected;\n  }\n}\nfunction JestExtendPlugin(expect, matchers) {\n  return (c, utils) => {\n    Object.entries(matchers).forEach(([expectAssertionName, expectAssertion]) => {\n      function expectWrapper(...args) {\n        const { state, isNot, obj } = getMatcherState(this, expect);\n        const result = expectAssertion.call(state, obj, ...args);\n        if (result && typeof result === \"object\" && result instanceof Promise) {\n          return result.then(({ pass: pass2, message: message2, actual: actual2, expected: expected2 }) => {\n            if (pass2 && isNot || !pass2 && !isNot)\n              throw new JestExtendError(message2(), actual2, expected2);\n          });\n        }\n        const { pass, message, actual, expected } = result;\n        if (pass && isNot || !pass && !isNot)\n          throw new JestExtendError(message(), actual, expected);\n      }\n      const softWrapper = wrapSoft(utils, expectWrapper);\n      utils.addMethod(globalThis[JEST_MATCHERS_OBJECT].matchers, expectAssertionName, softWrapper);\n      utils.addMethod(c.Assertion.prototype, expectAssertionName, softWrapper);\n      class CustomMatcher extends AsymmetricMatcher {\n        constructor(inverse = false, ...sample) {\n          super(sample, inverse);\n        }\n        asymmetricMatch(other) {\n          const { pass } = expectAssertion.call(\n            this.getMatcherContext(expect),\n            other,\n            ...this.sample\n          );\n          return this.inverse ? !pass : pass;\n        }\n        toString() {\n          return `${this.inverse ? \"not.\" : \"\"}${expectAssertionName}`;\n        }\n        getExpectedType() {\n          return \"any\";\n        }\n        toAsymmetricMatcher() {\n          return `${this.toString()}<${this.sample.map(String).join(\", \")}>`;\n        }\n      }\n      Object.defineProperty(expect, expectAssertionName, {\n        configurable: true,\n        enumerable: true,\n        value: (...sample) => new CustomMatcher(false, ...sample),\n        writable: true\n      });\n      Object.defineProperty(expect.not, expectAssertionName, {\n        configurable: true,\n        enumerable: true,\n        value: (...sample) => new CustomMatcher(true, ...sample),\n        writable: true\n      });\n    });\n  };\n}\nconst JestExtend = (chai, utils) => {\n  utils.addMethod(chai.expect, \"extend\", (expect, expects) => {\n    chai.use(JestExtendPlugin(expect, expects));\n  });\n};\n\nexport { Any, Anything, ArrayContaining, AsymmetricMatcher, GLOBAL_EXPECT, JEST_MATCHERS_OBJECT, JestAsymmetricMatchers, JestChaiExpect, JestExtend, MATCHERS_OBJECT, ObjectContaining, StringContaining, StringMatching, arrayBufferEquality, equals, fnNameFor, generateToBeMessage, getState, hasAsymmetric, hasProperty, isA, isAsymmetric, isImmutableUnorderedKeyed, isImmutableUnorderedSet, iterableEquality, setState, sparseArrayEquality, subsetEquality, typeEquality };\n"],"names":["MATCHERS_OBJECT","Symbol","for","JEST_MATCHERS_OBJECT","GLOBAL_EXPECT","Object","prototype","hasOwnProperty","call","globalThis","globalState","WeakMap","matchers","create","defineProperty","get","configurable","state","getState","expect","getMatcherUtils","c","getColors","EXPECTED_COLOR","green","RECEIVED_COLOR","red","INVERTED_COLOR","inverse","BOLD_WEIGHT","bold","DIM_COLOR","dim","replaceTrailingSpaces","text","replace","spaces","repeat","length","matcherHint","matcherName","received","expected","options","comment","isDirectExpectCall","isNot","promise","secondArgument","expectedColor","receivedColor","secondArgumentColor","hint","dimString","includes","printReceived","object","stringify","s","printExpected","value","equals","a","b","customTesters","strictCheck","eq","hasKey","hasDefinedKey","isAsymmetric","obj","isA","asymmetricMatch","aStack","bStack","hasKey2","result","asymmetricResult","asymmetricA","asymmetricB","i","customTesterResult","Error","message","is","className","toString","valueOf","numA","numB","Number","isNaN","source","flags","isDomNode","isEqualNode","push","aKeys","keys","key","size","pop","keys2","concat","getOwnPropertySymbols","filter","symbol","getOwnPropertyDescriptor","enumerable","typeName","apply","nodeType","nodeName","IS_ORDERED_SENTINEL","isImmutableUnorderedKeyed","maybeKeyed","isImmutableUnorderedSet","maybeSet","IteratorSymbol","iterator","hasIterator","iterableEquality","Array","isArray","constructor","iterableEqualityWithStack","a2","b2","allFound","aValue","has","bValue","aEntry","bEntry","matchedValue","bIterator","nextB","next","done","hasPropertyInObject","getPrototypeOf","isObjectWithKeys","isObject","Date","subsetEquality","subset","subsetEqualityWithContext","seenReferences","object2","subset2","every","set","delete","typeEquality","arrayBufferEquality","dataViewA","dataViewB","DataView","ArrayBuffer","byteLength","getUint8","sparseArrayEquality","bKeys","generateToBeMessage","deepEqualityName","actual","toBeMessage","AsymmetricMatcher","sample","this","$$typeof","getMatcherContext","utils","diff","StringContaining","super","other","getExpectedType","Anything","toAsymmetricMatcher","ObjectContaining","getPrototype","hasProperty","property","TypeError","ArrayContaining","item","some","another","Any","fnNameFor","func","name","matches","Function","match","String","Boolean","BigInt","StringMatching","RegExp","test","recordAsyncExpect","Promise","finally","index","promises","indexOf","splice","wrapSoft","fn","args","_a","flag","context","_local","soft","err","errors","processError","JestExtendError","JestExtendPlugin","entries","forEach","expectAssertionName","expectAssertion","softWrapper","expectWrapper","getMatcherState","assertion","_obj","util","jestUtils","suppressedErrors","then","pass","pass2","message2","actual2","expected2","addMethod","Assertion","CustomMatcher","map","join","writable","not","chai","stringContaining","objectContaining","arrayContaining","stringMatching","AssertionError","def","n","m","overwriteMethod","_super","showDiff","equal","assert","include","contain","from","findIndex","assertTypes","be","NaN","undefined","null","negate","instanceOf","have","propertyName","exists","getPathInfo","valueString","objDisplay","precision","expectedDiff","receivedDiff","POSITIVE_INFINITY","NEGATIVE_INFINITY","Math","abs","getSpy","isMockFunction","inspect","assertIsMock","ordinalOf","j","k","formatCalls","spy","msg","actualCall","mock","calls","gray","callArg","methodCall","getMockName","omitAnnotationLines","split","line","number","spyName","callCount","called","getMessage","times","nthCall","lastCall","throws","thrown","isThrow","matcher","calledAndNotThrew","results","type","successfulReturns","reduce","success","actualReturn","callReturn","formatReturns","lastResult","callType","callResult","ordinalCall","fail","nthCallReturn","satisfy","addProperty","__VITEST_RESOLVES__","error","proxy","Proxy","target","receiver","Reflect","async","_error","stack","__VITEST_REJECTS__","wrapper","expects","use","setState","current","assign"],"mappings":"+lBAOK,MAACA,EAAkBC,OAAOC,IAAI,mBAC7BC,EAAuBF,OAAOC,IAAI,0BAClCE,EAAgBH,OAAOC,IAAI,iBAEjC,IAAKG,OAAOC,UAAUC,eAAeC,KAAKC,WAAYT,GAAkB,CACtE,MAAMU,EAA8B,IAAIC,QAClCC,EAA2BP,OAAOQ,OAAO,MAC/CR,OAAOS,eAAeL,WAAYT,EAAiB,CACjDe,IAAK,IAAML,IAEbL,OAAOS,eAAeL,WAAYN,EAAsB,CACtDa,cAAc,EACdD,IAAK,KAAO,CACVE,MAAOP,EAAYK,IAAIN,WAAWL,IAClCQ,cAGN,CACA,SAASM,SAASC,GAChB,OAAOV,WAAWT,GAAiBe,IAAII,EACzC,CAQA,SAASC,kBACP,MAAMC,EAAI,IAAMC,MACVC,EAAiBF,IAAIG,MACrBC,EAAiBJ,IAAIK,IACrBC,EAAiBN,IAAIO,QACrBC,EAAcR,IAAIS,KAClBC,EAAYV,IAAIW,IA+CtB,MACMC,sBAAyBC,GAASA,EAAKC,QAAQ,UAAWC,GAD3C,IACmEC,OAAOD,EAAOE,UAGtG,MAAO,CACLf,iBACAE,iBACAE,iBACAE,cACAE,YACAQ,YAxDF,SAASA,YAAYC,EAAaC,EAAW,WAAYC,EAAW,WAAYC,EAAU,IACxF,MAAMC,QACJA,EAAU,GAAEC,mBACZA,GAAqB,EAAKC,MAE1BA,GAAQ,EAAKC,QACbA,EAAU,GAAEC,eACZA,EAAiB,GAAEC,cACnBA,EAAgB1B,EAAc2B,cAC9BA,EAAgBzB,EAAc0B,oBAC9BA,EAAsB5B,GACpBoB,EACJ,IAAIS,EAAO,GACPC,EAAY,SA+BhB,OA9BKR,GAAmC,KAAbJ,IACzBW,GAAQrB,EAAU,GAAGsB,MAAgBH,EAAcT,GACnDY,EAAY,KAEE,KAAZN,IACFK,GAAQrB,EAAU,GAAGsB,MAAgBN,EACrCM,EAAY,IAEVP,IACFM,GAAQ,GAAGrB,EAAU,GAAGsB,WACxBA,EAAY,IAEVb,EAAYc,SAAS,KACvBD,GAAab,GAEbY,GAAQrB,EAAU,GAAGsB,MAAgBb,EACrCa,EAAY,IAEG,KAAbX,EACFW,GAAa,MAEbD,GAAQrB,EAAU,GAAGsB,MAAgBJ,EAAcP,GAC/CM,IACFI,GAAQrB,EAAU,MAAQoB,EAAoBH,IAChDK,EAAY,KAEE,KAAZT,IACFS,GAAa,OAAOT,KACJ,KAAdS,IACFD,GAAQrB,EAAUsB,IACbD,CACX,EAYIG,cATqBC,GAAW/B,EAAeQ,sBAAsBwB,EAASC,EAACF,KAU/EG,cATqBC,GAAUrC,EAAeU,sBAAsBwB,EAASC,EAACE,KAWlF,CAEA,SAASC,OAAOC,EAAGC,EAAGC,EAAeC,GAEnC,OAAOC,GAAGJ,EAAGC,EAAG,GAAI,GADpBC,EAAgBA,GAAiB,GACMC,EAAcE,OAASC,cAChE,CAEA,SAASC,aAAaC,GACpB,QAASA,GAAsB,iBAARA,GAAoB,oBAAqBA,GAAOC,IAAI,WAAYD,EAAIE,gBAC7F,CAyBA,SAASN,GAAGJ,EAAGC,EAAGU,EAAQC,EAAQV,EAAeW,GAC/C,IAAIC,GAAS,EACb,MAAMC,EAZR,SAASL,gBAAgBV,EAAGC,GAC1B,MAAMe,EAAcT,aAAaP,GAC3BiB,EAAcV,aAAaN,GACjC,IAAIe,IAAeC,EAEnB,OAAID,EACKhB,EAAEU,gBAAgBT,GACvBgB,EACKhB,EAAES,gBAAgBV,QAD3B,CAEF,CAG2BU,CAAgBV,EAAGC,GAC5C,QAAyB,IAArBc,EACF,OAAOA,EACT,IAAK,IAAIG,EAAI,EAAGA,EAAIhB,EAAc1B,OAAQ0C,IAAK,CAC7C,MAAMC,EAAqBjB,EAAcgB,GAAGlB,EAAGC,GAC/C,QAA2B,IAAvBkB,EACF,OAAOA,CACb,CACE,GAAInB,aAAaoB,OAASnB,aAAamB,MACrC,OAAOpB,EAAEqB,UAAYpB,EAAEoB,QACzB,GAAI9E,OAAO+E,GAAGtB,EAAGC,GACf,OAAO,EACT,GAAU,OAAND,GAAoB,OAANC,EAChB,OAAOD,IAAMC,EACf,MAAMsB,EAAYhF,OAAOC,UAAUgF,SAAS9E,KAAKsD,GACjD,GAAIuB,IAAchF,OAAOC,UAAUgF,SAAS9E,KAAKuD,GAC/C,OAAO,EACT,OAAQsB,GACN,IAAK,mBACL,IAAK,kBACL,IAAK,kBACH,cAAWvB,UAAaC,IAEA,iBAAND,GAA+B,iBAANC,EAClC1D,OAAO+E,GAAGtB,EAAGC,GAEb1D,OAAO+E,GAAGtB,EAAEyB,UAAWxB,EAAEwB,YAEpC,IAAK,gBAAiB,CACpB,MAAMC,GAAQ1B,EACR2B,GAAQ1B,EACd,OAAOyB,IAASC,GAAQC,OAAOC,MAAMH,IAASE,OAAOC,MAAMF,EACjE,CACI,IAAK,kBACH,OAAO3B,EAAE8B,SAAW7B,EAAE6B,QAAU9B,EAAE+B,QAAU9B,EAAE8B,MAElD,GAAiB,iBAAN/B,GAA+B,iBAANC,EAClC,OAAO,EACT,GAAI+B,UAAUhC,IAAMgC,UAAU/B,GAC5B,OAAOD,EAAEiC,YAAYhC,GACvB,IAAIzB,EAASmC,EAAOnC,OACpB,KAAOA,KAAU,CACf,GAAImC,EAAOnC,KAAYwB,EACrB,OAAOY,EAAOpC,KAAYyB,EACvB,GAAIW,EAAOpC,KAAYyB,EAC1B,OAAO,CACb,CAGE,GAFAU,EAAOuB,KAAKlC,GACZY,EAAOsB,KAAKjC,GACM,mBAAdsB,GAAkCvB,EAAExB,SAAWyB,EAAEzB,OACnD,OAAO,EACT,MAAM2D,EAAQC,KAAKpC,EAAGa,GACtB,IAAIwB,EACAC,EAAOH,EAAM3D,OACjB,GAAI4D,KAAKnC,EAAGY,GAASrC,SAAW8D,EAC9B,OAAO,EACT,KAAOA,KAGL,GAFAD,EAAMF,EAAMG,GACZxB,EAASD,EAAQZ,EAAGoC,IAAQjC,GAAGJ,EAAEqC,GAAMpC,EAAEoC,GAAM1B,EAAQC,EAAQV,EAAeW,IACzEC,EACH,OAAO,EAIX,OAFAH,EAAO4B,MACP3B,EAAO2B,MACAzB,CACT,CACA,SAASsB,KAAK5B,EAAKK,GACjB,MAAM2B,EAAQ,GACd,IAAK,MAAMH,KAAO7B,EACZK,EAAQL,EAAK6B,IACfG,EAAMN,KAAKG,GAEf,OAAOG,EAAMC,OACXlG,OAAOmG,sBAAsBlC,GAAKmC,QAC/BC,GAAWrG,OAAOsG,yBAAyBrC,EAAKoC,GAAQE,aAG/D,CACA,SAASxC,cAAcE,EAAK6B,GAC1B,OAAOhC,OAAOG,EAAK6B,SAAqB,IAAb7B,EAAI6B,EACjC,CACA,SAAShC,OAAOG,EAAK6B,GACnB,OAAO9F,OAAOC,UAAUC,eAAeC,KAAK8D,EAAK6B,EACnD,CACA,SAAS5B,IAAIsC,EAAUjD,GACrB,OAAOvD,OAAOC,UAAUgF,SAASwB,MAAMlD,KAAW,WAAWiD,IAC/D,CACA,SAASf,UAAUxB,GACjB,OAAe,OAARA,GAA+B,iBAARA,GAAoB,aAAcA,GAA+B,iBAAjBA,EAAIyC,UAAyB,aAAczC,GAA+B,iBAAjBA,EAAI0C,UAAyB,gBAAiB1C,GAAkC,mBAApBA,EAAIyB,WACzM,CAqBA,MAEMkB,EAAsB,4BAC5B,SAASC,0BAA0BC,GACjC,SAAUA,IAAcA,EAJA,4BAIkCA,EAAWF,GACvE,CACA,SAASG,wBAAwBC,GAC/B,SAAUA,IAAYA,EANA,0BAM8BA,EAASJ,GAC/D,CACA,MAAMK,EAAiBrH,OAAOsH,SAC9B,SAASC,YAAYhE,GACnB,QAAoB,MAAVA,IAAkBA,EAAO8D,GACrC,CACA,SAASG,iBAAiB3D,EAAGC,EAAGU,EAAS,GAAIC,EAAS,IACpD,GAAiB,iBAANZ,GAA+B,iBAANC,GAAkB2D,MAAMC,QAAQ7D,IAAM4D,MAAMC,QAAQ5D,KAAOyD,YAAY1D,KAAO0D,YAAYzD,GAC5H,OACF,GAAID,EAAE8D,cAAgB7D,EAAE6D,YACtB,OAAO,EACT,IAAItF,EAASmC,EAAOnC,OACpB,KAAOA,KACL,GAAImC,EAAOnC,KAAYwB,EACrB,OAAOY,EAAOpC,KAAYyB,EAE9BU,EAAOuB,KAAKlC,GACZY,EAAOsB,KAAKjC,GACZ,MAAM8D,0BAA4B,CAACC,EAAIC,IAAON,iBAAiBK,EAAIC,EAAI,IAAItD,GAAS,IAAIC,IACxF,QAAe,IAAXZ,EAAEsC,KAAiB,CACrB,GAAItC,EAAEsC,OAASrC,EAAEqC,KACf,OAAO,EACF,GAAI7B,IAAI,MAAOT,IAAMsD,wBAAwBtD,GAAI,CACtD,IAAIkE,GAAW,EACf,IAAK,MAAMC,KAAUnE,EACnB,IAAKC,EAAEmE,IAAID,GAAS,CAClB,IAAIC,GAAM,EACV,IAAK,MAAMC,KAAUpE,EAAG,EAEN,IADAF,OAAOoE,EAAQE,EAAQ,CAACN,8BAEtCK,GAAM,EACpB,CACU,IAAY,IAARA,EAAe,CACjBF,GAAW,EACX,KACZ,CACA,CAIM,OAFAvD,EAAO4B,MACP3B,EAAO2B,MACA2B,CACb,CAAW,GAAIzD,IAAI,MAAOT,IAAMoD,0BAA0BpD,GAAI,CACxD,IAAIkE,GAAW,EACf,IAAK,MAAMI,KAAUtE,EACnB,IAAKC,EAAEmE,IAAIE,EAAO,MAAQvE,OAAOuE,EAAO,GAAIrE,EAAEhD,IAAIqH,EAAO,IAAK,CAACP,4BAA6B,CAC1F,IAAIK,GAAM,EACV,IAAK,MAAMG,KAAUtE,EAAG,CAItB,IAAIuE,GAAe,GACA,IAJAzE,OAAOuE,EAAO,GAAIC,EAAO,GAAI,CAC9CR,8BAIAS,EAAezE,OAAOuE,EAAO,GAAIC,EAAO,GAAI,CAC1CR,8BAGiB,IAAjBS,IACFJ,GAAM,EACpB,CACU,IAAY,IAARA,EAAe,CACjBF,GAAW,EACX,KACZ,CACA,CAIM,OAFAvD,EAAO4B,MACP3B,EAAO2B,MACA2B,CACb,CACA,CACE,MAAMO,EAAYxE,EAAEuD,KACpB,IAAK,MAAMW,KAAUnE,EAAG,CACtB,MAAM0E,EAAQD,EAAUE,OACxB,GAAID,EAAME,OAAS7E,OAAOoE,EAAQO,EAAM5E,MAAO,CAACiE,4BAC9C,OAAO,CACb,CACE,QAAKU,EAAUE,OAAOC,OAEtBjE,EAAO4B,MACP3B,EAAO2B,OACA,EACT,CACA,SAASsC,oBAAoBnF,EAAQ2C,GAEnC,SADyB3C,GAA4B,iBAAXA,GAAuBA,IAAWnD,OAAOC,aAG5ED,OAAOC,UAAUC,eAAeC,KAAKgD,EAAQ2C,IAAQwC,oBAAoBtI,OAAOuI,eAAepF,GAAS2C,GACjH,CACA,SAAS0C,iBAAiB/E,GACxB,OAAOgF,EAAQA,SAAChF,MAAQA,aAAaoB,SAAWwC,MAAMC,QAAQ7D,MAAQA,aAAaiF,KACrF,CACA,SAASC,eAAexF,EAAQyF,GAC9B,MAAMC,0BAA4B,CAACC,EAAiC,IAAIxI,UAAc,CAACyI,EAASC,KAC9F,GAAKR,iBAAiBQ,GAEtB,OAAOhJ,OAAO6F,KAAKmD,GAASC,OAAOnD,IACjC,GAAI0C,iBAAiBQ,EAAQlD,IAAO,CAClC,GAAIgD,EAAejB,IAAImB,EAAQlD,IAC7B,OAAOtC,OAAOuF,EAAQjD,GAAMkD,EAAQlD,GAAM,CAACsB,mBAC7C0B,EAAeI,IAAIF,EAAQlD,IAAM,EACzC,CACM,MAAMvB,EAAoB,MAAXwE,GAAmBT,oBAAoBS,EAASjD,IAAQtC,OAAOuF,EAAQjD,GAAMkD,EAAQlD,GAAM,CACxGsB,iBACAyB,0BAA0BC,KAG5B,OADAA,EAAeK,OAAOH,EAAQlD,IACvBvB,CAAM,GACb,EAEJ,OAAOsE,4BAA4B1F,EAAQyF,EAC7C,CACA,SAASQ,aAAa3F,EAAGC,GACvB,GAAS,MAALD,GAAkB,MAALC,GAAaD,EAAE8D,cAAgB7D,EAAE6D,YAElD,OAAO,CACT,CACA,SAAS8B,oBAAoB5F,EAAGC,GAC9B,IAAI4F,EAAY7F,EACZ8F,EAAY7F,EAChB,KAAMD,aAAa+F,UAAY9F,aAAa8F,UAAW,CACrD,KAAM/F,aAAagG,aAAkB/F,aAAa+F,aAChD,OACF,IACEH,EAAY,IAAIE,SAAS/F,GACzB8F,EAAY,IAAIC,SAAS9F,EAC/B,CAAM,MACA,MACN,CACA,CACE,GAAI4F,EAAUI,aAAeH,EAAUG,WACrC,OAAO,EACT,IAAK,IAAI/E,EAAI,EAAGA,EAAI2E,EAAUI,WAAY/E,IACxC,GAAI2E,EAAUK,SAAShF,KAAO4E,EAAUI,SAAShF,GAC/C,OAAO,EAEX,OAAO,CACT,CACA,SAASiF,oBAAoBnG,EAAGC,GAC9B,IAAK2D,MAAMC,QAAQ7D,KAAO4D,MAAMC,QAAQ5D,GACtC,OACF,MAAMkC,EAAQ5F,OAAO6F,KAAKpC,GACpBoG,EAAQ7J,OAAO6F,KAAKnC,GAC1B,OAAOF,OAAOC,EAAGC,EAAG,CAAC0D,iBAAkBgC,eAAe,IAAS5F,OAAOoC,EAAOiE,EAC/E,CACA,SAASC,oBAAoBC,EAAkB1H,EAAW,UAAW2H,EAAS,UAC5E,MAAMC,EAAc,YAAY5H,WAAkB2H,0BAClD,MAAI,CAAC,gBAAiB,WAAW/G,SAAS8G,GACjC,GAAGE,mEAE+CF,mBAEjD1H,+CAGH4H,CACT,CAEA,MAAMC,kBACJ,WAAA3C,CAAY4C,EAAQ5I,GAAU,GAC5B6I,KAAKD,OAASA,EACdC,KAAK7I,QAAUA,CACnB,CAEE8I,SAAWzK,OAAOC,IAAI,0BACtB,iBAAAyK,CAAkBxJ,GAChB,MAAO,IACFD,SAASC,GAAUV,WAAWL,IACjCyD,cACAf,MAAO2H,KAAK7I,QACZgJ,MAAO,IACFxJ,kBACXyJ,KAAQA,EAAIA,KACZpH,UAAQA,EAASC,EACT+D,kCACAuB,+BAGR,EAEA,MAAM8B,yBAAyBP,kBAC7B,WAAA3C,CAAY4C,EAAQ5I,GAAU,GAC5B,IAAK2C,IAAI,SAAUiG,GACjB,MAAM,IAAItF,MAAM,4BAClB6F,MAAMP,EAAQ5I,EAClB,CACE,eAAA4C,CAAgBwG,GACd,MAAMpG,EAASL,IAAI,SAAUyG,IAAUA,EAAM1H,SAASmH,KAAKD,QAC3D,OAAOC,KAAK7I,SAAWgD,EAASA,CACpC,CACE,QAAAU,GACE,MAAO,SAASmF,KAAK7I,QAAU,MAAQ,cAC3C,CACE,eAAAqJ,GACE,MAAO,QACX,EAEA,MAAMC,iBAAiBX,kBACrB,eAAA/F,CAAgBwG,GACd,OAAgB,MAATA,CACX,CACE,QAAA1F,GACE,MAAO,UACX,CACE,mBAAA6F,GACE,MAAO,UACX,EAEA,MAAMC,yBAAyBb,kBAC7B,WAAA3C,CAAY4C,EAAQ5I,GAAU,GAC5BmJ,MAAMP,EAAQ5I,EAClB,CACE,YAAAyJ,CAAa/G,GACX,OAAIjE,OAAOuI,eACFvI,OAAOuI,eAAetE,GAC3BA,EAAIsD,YAAYtH,YAAcgE,EACzB,KACFA,EAAIsD,YAAYtH,SAC3B,CACE,WAAAgL,CAAYhH,EAAKiH,GACf,QAAKjH,MAEDjE,OAAOC,UAAUC,eAAeC,KAAK8D,EAAKiH,IAEvCd,KAAKa,YAAYb,KAAKY,aAAa/G,GAAMiH,GACpD,CACE,eAAA/G,CAAgBwG,GACd,GAA2B,iBAAhBP,KAAKD,OACd,MAAM,IAAIgB,UACR,iCAAiCf,KAAKnF,2BAA2BmF,KAAKD,YAG1E,IAAI5F,GAAS,EACb,IAAK,MAAM2G,KAAYd,KAAKD,OAC1B,IAAKC,KAAKa,YAAYN,EAAOO,KAAc1H,OAAO4G,KAAKD,OAAOe,GAAWP,EAAMO,IAAY,CACzF3G,GAAS,EACT,KACR,CAEI,OAAO6F,KAAK7I,SAAWgD,EAASA,CACpC,CACE,QAAAU,GACE,MAAO,SAASmF,KAAK7I,QAAU,MAAQ,cAC3C,CACE,eAAAqJ,GACE,MAAO,QACX,EAEA,MAAMQ,wBAAwBlB,kBAC5B,WAAA3C,CAAY4C,EAAQ5I,GAAU,GAC5BmJ,MAAMP,EAAQ5I,EAClB,CACE,eAAA4C,CAAgBwG,GACd,IAAKtD,MAAMC,QAAQ8C,KAAKD,QACtB,MAAM,IAAIgB,UACR,gCAAgCf,KAAKnF,2BAA2BmF,KAAKD,YAGzE,MAAM5F,EAAgC,IAAvB6F,KAAKD,OAAOlI,QAAgBoF,MAAMC,QAAQqD,IAAUP,KAAKD,OAAOlB,OAC5EoC,GAASV,EAAMW,MAAMC,GAAY/H,OAAO6H,EAAME,OAEjD,OAAOnB,KAAK7I,SAAWgD,EAASA,CACpC,CACE,QAAAU,GACE,MAAO,QAAQmF,KAAK7I,QAAU,MAAQ,cAC1C,CACE,eAAAqJ,GACE,MAAO,OACX,EAEA,MAAMY,YAAYtB,kBAChB,WAAA3C,CAAY4C,GACV,QAAsB,IAAXA,EACT,MAAM,IAAIgB,UACR,6GAGJT,MAAMP,EACV,CACE,SAAAsB,CAAUC,GACR,GAAIA,EAAKC,KACP,OAAOD,EAAKC,KACd,MACMC,EADmBC,SAAS5L,UAAUgF,SACX9E,KAAKuL,GAAMI,MAAM,gDAClD,OAAOF,EAAUA,EAAQ,GAAK,aAClC,CACE,eAAAzH,CAAgBwG,GACd,OAAIP,KAAKD,SAAW4B,OACK,iBAATpB,GAAqBA,aAAiBoB,OAClD3B,KAAKD,SAAW9E,OACK,iBAATsF,GAAqBA,aAAiBtF,OAClD+E,KAAKD,SAAW0B,SACK,mBAATlB,GAAuBA,aAAiBkB,SACpDzB,KAAKD,SAAW6B,QACK,kBAATrB,GAAsBA,aAAiBqB,QACnD5B,KAAKD,SAAW8B,OACK,iBAATtB,GAAqBA,aAAiBsB,OAClD7B,KAAKD,SAAWvK,OACK,iBAAT+K,GAAqBA,aAAiB/K,OAClDwK,KAAKD,SAAWnK,OACK,iBAAT2K,EACTA,aAAiBP,KAAKD,MACjC,CACE,QAAAlF,GACE,MAAO,KACX,CACE,eAAA2F,GACE,OAAIR,KAAKD,SAAW4B,OACX,SACL3B,KAAKD,SAAW9E,OACX,SACL+E,KAAKD,SAAW0B,SACX,WACLzB,KAAKD,SAAWnK,OACX,SACLoK,KAAKD,SAAW6B,QACX,UACF5B,KAAKqB,UAAUrB,KAAKD,OAC/B,CACE,mBAAAW,GACE,MAAO,OAAOV,KAAKqB,UAAUrB,KAAKD,UACtC,EAEA,MAAM+B,uBAAuBhC,kBAC3B,WAAA3C,CAAY4C,EAAQ5I,GAAU,GAC5B,IAAK2C,IAAI,SAAUiG,KAAYjG,IAAI,SAAUiG,GAC3C,MAAM,IAAItF,MAAM,wCAClB6F,MAAM,IAAIyB,OAAOhC,GAAS5I,EAC9B,CACE,eAAA4C,CAAgBwG,GACd,MAAMpG,EAASL,IAAI,SAAUyG,IAAUP,KAAKD,OAAOiC,KAAKzB,GACxD,OAAOP,KAAK7I,SAAWgD,EAASA,CACpC,CACE,QAAAU,GACE,MAAO,SAASmF,KAAK7I,QAAU,MAAQ,YAC3C,CACE,eAAAqJ,GACE,MAAO,QACX,EAyCA,SAASyB,kBAAkBD,EAAM1J,GAW/B,OAVI0J,GAAQ1J,aAAmB4J,UAC7B5J,EAAUA,EAAQ6J,SAAQ,KACxB,MAAMC,EAAQJ,EAAKK,SAASC,QAAQhK,IACpB,IAAZ8J,GACFJ,EAAKK,SAASE,OAAOH,EAAO,EAAE,IAE7BJ,EAAKK,WACRL,EAAKK,SAAW,IAClBL,EAAKK,SAAS9G,KAAKjD,IAEdA,CACT,CACA,SAASkK,SAASrC,EAAOsC,GACvB,OAAO,YAAYC,GACjB,IAAIC,EACJ,MAAMX,EAAO7B,EAAMyC,KAAK5C,KAAM,eAE9B,MADuB,MAARgC,OAAe,EAASA,EAAKa,QAAQC,QAAUd,EAAKa,QAAQnM,OAAOD,WAAaA,SAAST,WAAWL,KACxGoN,KACT,OAAON,EAAGpG,MAAM2D,KAAM0C,GACxB,IAAKV,EACH,MAAM,IAAIvH,MAAM,gDAClB,IACE,OAAOgI,EAAGpG,MAAM2D,KAAM0C,EACvB,CAAC,MAAOM,GACPhB,EAAK7H,SAAW6H,EAAK7H,OAAS,CAAE3D,MAAO,SACvCwL,EAAK7H,OAAO3D,MAAQ,QACnBmM,EAAKX,EAAK7H,QAAQ8I,SAAWN,EAAGM,OAAS,IAC1CjB,EAAK7H,OAAO8I,OAAO1H,KAAK2H,EAAYA,aAACF,GAC3C,CACG,CACH,CAmrBA,MAAMG,wBAAwB1I,MAC5B,WAAA0C,CAAYzC,EAASkF,EAAQ3H,GAC3BqI,MAAM5F,GACNsF,KAAKJ,OAASA,EACdI,KAAK/H,SAAWA,CACpB,EAEA,SAASmL,iBAAiB1M,EAAQP,GAChC,MAAO,CAACS,EAAGuJ,KACTvK,OAAOyN,QAAQlN,GAAUmN,SAAQ,EAAEC,EAAqBC,MActD,MAAMC,EAAcjB,SAASrC,GAb7B,SAASuD,iBAAiBhB,GACxB,MAAMlM,MAAEA,EAAK6B,MAAEA,EAAKwB,IAAEA,GArC9B,SAAS8J,gBAAgBC,EAAWlN,GAClC,MAAMmD,EAAM+J,EAAUC,KAChBxL,EAAQyL,EAAIA,KAAClB,KAAKgB,EAAW,UAC7BtL,EAAUwL,EAAAA,KAAKlB,KAAKgB,EAAW,YAAc,GAC7CG,EAAY,IACbpN,kBACPyJ,KAAIA,EAAIA,KACRpH,UAAIA,EAASC,EACT+D,kCACAuB,+BAWF,MAAO,CACL/H,MAVmB,IAChBC,SAASC,GACZ2B,QACA8H,MAAO4D,EACPzL,UACAc,cAEA4K,iBAAkB,IAIlB3L,QACAwB,MAEJ,CAYsC8J,CAAgB3D,KAAMtJ,GAC9CyD,EAASqJ,EAAgBzN,KAAKS,EAAOqD,KAAQ6I,GACnD,GAAIvI,GAA4B,iBAAXA,GAAuBA,aAAkB+H,QAC5D,OAAO/H,EAAO8J,MAAK,EAAGC,KAAMC,EAAOzJ,QAAS0J,EAAUxE,OAAQyE,EAASpM,SAAUqM,MAC/E,GAAIH,GAAS9L,IAAU8L,IAAU9L,EAC/B,MAAM,IAAI8K,gBAAgBiB,IAAYC,EAASC,EAAU,IAG/D,MAAMJ,KAAEA,EAAIxJ,QAAEA,EAAOkF,OAAEA,EAAM3H,SAAEA,GAAakC,EAC5C,GAAI+J,GAAQ7L,IAAU6L,IAAS7L,EAC7B,MAAM,IAAI8K,gBAAgBzI,IAAWkF,EAAQ3H,EACvD,IAEMkI,EAAMoE,UAAUvO,WAAWN,GAAsBS,SAAUoN,EAAqBE,GAChFtD,EAAMoE,UAAU3N,EAAE4N,UAAU3O,UAAW0N,EAAqBE,GAC5D,MAAMgB,sBAAsB3E,kBAC1B,WAAA3C,CAAYhG,GAAU,KAAU4I,GAC9BO,MAAMP,EAAQ5I,EACxB,CACQ,eAAA4C,CAAgBwG,GACd,MAAM2D,KAAEA,GAASV,EAAgBzN,KAC/BiK,KAAKE,kBAAkBxJ,GACvB6J,KACGP,KAAKD,QAEV,OAAOC,KAAK7I,SAAW+M,EAAOA,CACxC,CACQ,QAAArJ,GACE,MAAO,GAAGmF,KAAK7I,QAAU,OAAS,KAAKoM,GACjD,CACQ,eAAA/C,GACE,MAAO,KACjB,CACQ,mBAAAE,GACE,MAAO,GAAGV,KAAKnF,cAAcmF,KAAKD,OAAO2E,IAAI/C,QAAQgD,KAAK,QACpE,EAEM/O,OAAOS,eAAeK,EAAQ6M,EAAqB,CACjDhN,cAAc,EACd4F,YAAY,EACZhD,MAAO,IAAI4G,IAAW,IAAI0E,eAAc,KAAU1E,GAClD6E,UAAU,IAEZhP,OAAOS,eAAeK,EAAOmO,IAAKtB,EAAqB,CACrDhN,cAAc,EACd4F,YAAY,EACZhD,MAAO,IAAI4G,IAAW,IAAI0E,eAAc,KAAS1E,GACjD6E,UAAU,GACV,GACF,CAEN,2KAvzB+B,CAACE,EAAM3E,KACpCA,EAAMoE,UACJO,EAAKpO,OACL,YACA,IAAM,IAAI+J,WAEZN,EAAMoE,UACJO,EAAKpO,OACL,OACCuB,GAAa,IAAImJ,IAAInJ,KAExBkI,EAAMoE,UACJO,EAAKpO,OACL,oBACCuB,GAAa,IAAIoI,iBAAiBpI,KAErCkI,EAAMoE,UACJO,EAAKpO,OACL,oBACCuB,GAAa,IAAI0I,iBAAiB1I,KAErCkI,EAAMoE,UACJO,EAAKpO,OACL,mBACCuB,GAAa,IAAI+I,gBAAgB/I,KAEpCkI,EAAMoE,UACJO,EAAKpO,OACL,kBACCuB,GAAa,IAAI6J,eAAe7J,KAEnC6M,EAAKpO,OAAOmO,IAAM,CAChBE,iBAAmB9M,GAAa,IAAIoI,iBAAiBpI,GAAU,GAC/D+M,iBAAmB/M,GAAa,IAAI0I,iBAAiB1I,GAAU,GAC/DgN,gBAAkBhN,GAAa,IAAI+I,gBAAgB/I,GAAU,GAC7DiN,eAAiBjN,GAAa,IAAI6J,eAAe7J,GAAU,GAC5D,mBAoCoB,CAAC6M,EAAM3E,KAC5B,MAAMgF,eAAEA,GAAmBL,EACrBlO,EAAI,IAAMC,MAChB,SAASuO,IAAI7D,EAAMkB,GACjB,MAAM8B,UAAac,IACjB,MAAM5B,EAAcjB,SAASrC,EAAOsC,GACpCtC,EAAMoE,UAAUO,EAAKN,UAAU3O,UAAWwP,EAAG5B,GAC7CtD,EAAMoE,UAAUvO,WAAWN,GAAsBS,SAAUkP,EAAG5B,EAAY,EAExExG,MAAMC,QAAQqE,GAChBA,EAAK+B,SAAS+B,GAAMd,UAAUc,KAE9Bd,UAAUhD,EAChB,CACE,CAAC,QAAS,SAAU,SAAS+B,SAASgC,IACpCnF,EAAMoF,gBAAgBT,EAAKN,UAAU3O,UAAWyP,GAAIE,GAC3C,YAAY9C,GACjB,MAAMpK,EAAU6H,EAAMyC,KAAK5C,KAAM,WAC3BjH,EAASoH,EAAMyC,KAAK5C,KAAM,UAC1B3H,EAAQ8H,EAAMyC,KAAK5C,KAAM,UAC/B,GAAgB,YAAZ1H,EACF6H,EAAMyC,KAAK5C,KAAM,UAAU,KACzB,MAAMjH,CAAM,SAET,GAAgB,aAAZT,GAA4C,mBAAXS,EAAuB,CACjE,GAAKV,EAOH,OAPU,CACV,MAAMqC,EAAUyF,EAAMyC,KAAK5C,KAAM,YAAc,oDAI/C,MAAM,IAAImF,EAAezK,EAHX,CACZ+K,UAAU,GAE6BtF,EAAMyC,KAAK5C,KAAM,QACtE,CAGA,CACQwF,EAAOnJ,MAAM2D,KAAM0C,EACpB,GACD,IAEJ0C,IAAI,YAAY,SAASpD,GAEvB,OADA7B,EAAMyC,KAAK5C,KAAM,cAAegC,GACzBhC,IACX,IACEoF,IAAI,WAAW,SAASnN,GACtB,MAAM2H,EAASO,EAAMyC,KAAK5C,KAAM,UAC1B0F,EAAQtM,OACZwG,EACA3H,EACA,CAAC+E,mBAEH,OAAOgD,KAAK2F,OACVD,EACA,0CACA,8CACAzN,EACA2H,EAEN,IACEwF,IAAI,iBAAiB,SAASnN,GAC5B,MAAM4B,EAAMsG,EAAMyC,KAAK5C,KAAM,UACvB0F,EAAQtM,OACZS,EACA5B,EACA,CACE+E,iBACAgC,aACAQ,oBACAP,sBAEF,GAEF,OAAOe,KAAK2F,OACVD,EACA,4CACA,gDACAzN,EACA4B,EAEN,IACEuL,IAAI,QAAQ,SAASnN,GACnB,MAAM2H,EAASI,KAAK6D,KACdK,EAAOtO,OAAO+E,GAAGiF,EAAQ3H,GAC/B,IAAI0H,EAAmB,GACvB,IAAKuE,EAAM,CAYT,GAX0B9K,OACxBwG,EACA3H,EACA,CACE+E,iBACAgC,aACAQ,oBACAP,sBAEF,GAGAU,EAAmB,oBACd,CACevG,OAClBwG,EACA3H,EACA,CAAC+E,qBAGD2C,EAAmB,UAC7B,CACA,CACI,OAAOK,KAAK2F,OACVzB,EACAxE,oBAAoBC,GACpB,0DACA1H,EACA2H,EAEN,IACEwF,IAAI,iBAAiB,SAASnN,GAC5B,MAAM2H,EAASI,KAAK6D,KACpB,OAAO7D,KAAK2F,OACVvM,OAAOwG,EAAQ3H,EAAU,CAAC+E,iBAAkBuB,iBAC5C,0CACA,8CACAtG,EACA2H,EAEN,IACEwF,IAAI,WAAW,SAASnN,GACtB,MAAwB,iBAAbA,EACF+H,KAAK4F,QAAQ3N,GAEb+H,KAAK0B,MAAMzJ,EACxB,IACEmN,IAAI,aAAa,SAASnE,GACxB,OAAOjB,KAAK6F,QAAQ5E,EACxB,IACEmE,IAAI,kBAAkB,SAASnN,GAC7B,MAAM4B,EAAMsG,EAAMyC,KAAK5C,KAAM,UACvBoC,EAAQnF,MAAM6I,KAAKjM,GAAKkM,WAAW9E,GAChC7H,OAAO6H,EAAMhJ,KAEtB+H,KAAK2F,QACS,IAAZvD,EACA,kDACA,sDACAnK,EAEN,IACEmN,IAAI,cAAc,WAChB,MAAMvL,EAAMsG,EAAMyC,KAAK5C,KAAM,UAC7BA,KAAK2F,OACH/D,QAAQ/H,GACR,gCACA,oCACAA,GACA,EAEN,IACEuL,IAAI,aAAa,WACf,MAAMvL,EAAMsG,EAAMyC,KAAK5C,KAAM,UAC7BA,KAAK2F,QACF9L,EACD,+BACA,mCACAA,GACA,EAEN,IACEuL,IAAI,mBAAmB,SAASnN,GAC9B,MAAM2H,EAASI,KAAK6D,KAGpB,OAFAmC,EAAAA,YAAYpG,EAAQ,SAAU,CAAC,SAAU,WACzCoG,EAAAA,YAAY/N,EAAU,WAAY,CAAC,SAAU,WACtC+H,KAAK2F,OACV/F,EAAS3H,EACT,YAAY2H,wBAA6B3H,IACzC,YAAY2H,4BAAiC3H,IAC7C2H,EACA3H,GACA,EAEN,IACEmN,IAAI,0BAA0B,SAASnN,GACrC,MAAM2H,EAASI,KAAK6D,KAGpB,OAFAmC,EAAAA,YAAYpG,EAAQ,SAAU,CAAC,SAAU,WACzCoG,EAAAA,YAAY/N,EAAU,WAAY,CAAC,SAAU,WACtC+H,KAAK2F,OACV/F,GAAU3H,EACV,YAAY2H,oCAAyC3H,IACrD,YAAY2H,wCAA6C3H,IACzD2H,EACA3H,GACA,EAEN,IACEmN,IAAI,gBAAgB,SAASnN,GAC3B,MAAM2H,EAASI,KAAK6D,KAGpB,OAFAmC,EAAAA,YAAYpG,EAAQ,SAAU,CAAC,SAAU,WACzCoG,EAAAA,YAAY/N,EAAU,WAAY,CAAC,SAAU,WACtC+H,KAAK2F,OACV/F,EAAS3H,EACT,YAAY2H,qBAA0B3H,IACtC,YAAY2H,yBAA8B3H,IAC1C2H,EACA3H,GACA,EAEN,IACEmN,IAAI,uBAAuB,SAASnN,GAClC,MAAM2H,EAASI,KAAK6D,KAGpB,OAFAmC,EAAAA,YAAYpG,EAAQ,SAAU,CAAC,SAAU,WACzCoG,EAAAA,YAAY/N,EAAU,WAAY,CAAC,SAAU,WACtC+H,KAAK2F,OACV/F,GAAU3H,EACV,YAAY2H,iCAAsC3H,IAClD,YAAY2H,qCAA0C3H,IACtD2H,EACA3H,GACA,EAEN,IACEmN,IAAI,WAAW,WACb,OAAOpF,KAAKiG,GAAGC,GACnB,IACEd,IAAI,iBAAiB,WACnB,OAAOpF,KAAKiG,GAAGE,SACnB,IACEf,IAAI,YAAY,WACd,OAAOpF,KAAKiG,GAAGG,IACnB,IACEhB,IAAI,eAAe,WACjB,MAAMiB,EAASlG,EAAMyC,KAAK5C,KAAM,UAEhC,OADAG,EAAMyC,KAAK5C,KAAM,UAAU,GACvBqG,EACKrG,KAAKiG,GAAGE,UACVnG,KAAK6E,IAAIoB,GAAGE,SACvB,IACEf,IAAI,cAAc,SAASnN,GACzB,MAAM2H,SAAgBI,KAAK6D,KACrB6B,EAAQzN,IAAa2H,EAC3B,OAAOI,KAAK2F,OACVD,EACA,wCACA,4CACAzN,EACA2H,EAEN,IACEwF,IAAI,kBAAkB,SAASvL,GAC7B,OAAOmG,KAAKsG,WAAWzM,EAC3B,IACEuL,IAAI,gBAAgB,SAASvN,GAC3B,OAAOmI,KAAKuG,KAAK1O,OAAOA,EAC5B,IACEuN,IAAI,kBAAkB,YAAY1C,GAC5BzF,MAAMC,QAAQwF,EAAK,MACrBA,EAAK,GAAKA,EAAK,GAAGgC,KAAKhJ,GAAQiG,OAAOjG,GAAKhE,QAAQ,YAAa,UAASiN,KAAK,MAChF,MAAM/E,EAASI,KAAK6D,MACb2C,EAAcvO,GAAYyK,GAO3BvJ,MAAEA,EAAKsN,OAAEA,GALE7Q,OAAOC,UAAUC,eAAeC,KAAK6J,EAAQ4G,GAEnD,CAAErN,MAAOyG,EAAO4G,GAAeC,QAAQ,GACzCtG,EAAMuG,YAAY9G,EAAQ4G,GAG7BtC,EAAOuC,IAA2B,IAAhB/D,EAAK7K,QAAgBuB,OAAOnB,EAAUkB,IACxDwN,EAA8B,IAAhBjE,EAAK7K,OAAe,GAAK,eAAesI,EAAMyG,WAAW3O,KAC7E,OAAO+H,KAAK2F,OACVzB,EACA,sCAAsCsC,KAAgBG,IACtD,0CAA0CH,KAAgBG,IAC1D/G,EAEN,IACEwF,IAAI,eAAe,SAASpN,EAAU6O,EAAY,GAChD,MAAM5O,EAAW+H,KAAK6D,KACtB,IAAIK,GAAO,EACP4C,EAAe,EACfC,EAAe,EAUnB,OATI/O,IAAaiD,OAAO+L,mBAAqB/O,IAAagD,OAAO+L,mBAEtDhP,IAAaiD,OAAOgM,mBAAqBhP,IAAagD,OAAOgM,kBADtE/C,GAAO,GAIP4C,EAAe,KAAOD,EAAY,EAClCE,EAAeG,KAAKC,IAAIlP,EAAWD,GACnCkM,EAAO6C,EAAeD,GAEjB9G,KAAK2F,OACVzB,EACA,kEAAkE6C,mBAA8BD,IAChG,sEAAsEC,mBAA8BD,IACpG9O,EACAC,GACA,EAEN,IACE,MAIMmP,OAAUxD,IAJK,CAACA,IACpB,IAAKyD,EAAAA,eAAezD,EAAUC,MAC5B,MAAM,IAAI9C,UAAU,GAAGZ,EAAMmH,QAAQ1D,EAAUC,yCAAyC,EAG1F0D,CAAa3D,GACNA,EAAUC,MAEb2D,UAAajN,IACjB,MAAMkN,EAAIlN,EAAI,GACRmN,EAAInN,EAAI,IACd,OAAU,IAANkN,GAAiB,KAANC,EACN,GAAGnN,MACF,IAANkN,GAAiB,KAANC,EACN,GAAGnN,MACF,IAANkN,GAAiB,KAANC,EACN,GAAGnN,MACL,GAAGA,KAAK,EAEXoN,YAAc,CAACC,EAAKC,EAAKC,KACzBF,EAAIG,KAAKC,QACXH,GAAOjR,IAAIqR,KAAK,qBAIpBL,EAAIG,KAAKC,MAAMtD,KAAI,CAACwD,EAAS3N,KACvB,IAAI4N,EAAavR,IAAIS,KAAK,KAAKmQ,UAAUjN,EAAI,MAAMqN,EAAIQ,2BAQvD,OAJED,GADEL,EACY1H,EAAIA,KAAC0H,EAAYI,EAAS,CAAEG,qBAAqB,IAEjDrP,EAASC,EAACiP,GAASI,MAAM,MAAM5D,KAAK6D,GAAS,OAAOA,MAAQ5D,KAAK,MACjFwD,GAAc,KACPA,CAAU,IAChBxD,KAAK,UAEVkD,GAAOjR,IAAIqR,KAAK,wBAEDrR,IAAIS,KAAKuQ,EAAIG,KAAKC,MAAMnQ,cA0BzCuN,IAAI,CAAC,wBAAyB,oBAAoB,SAASoD,GACzD,MAAMZ,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdM,EAAYd,EAAIG,KAAKC,MAAMnQ,OACjC,OAAOmI,KAAK2F,OACV+C,IAAcF,EACd,aAAaC,yCAA+CC,UAC5D,aAAaD,mCACbD,EACAE,GACA,EAEN,IACEtD,IAAI,wBAAwB,WAC1B,MAAMwC,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdM,EAAYd,EAAIG,KAAKC,MAAMnQ,OACjC,OAAOmI,KAAK2F,OACI,IAAd+C,EACA,aAAaD,iCAAuCC,UACpD,aAAaD,2BACb,EACAC,GACA,EAEN,IACEtD,IAAI,CAAC,mBAAoB,eAAe,WACtC,MAAMwC,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdM,EAAYd,EAAIG,KAAKC,MAAMnQ,OAC3B8Q,EAASD,EAAY,EACrBrQ,EAAQ8H,EAAMyC,KAAK5C,KAAM,UAC/B,IAAI6H,EAAM1H,EAAMyI,WACd5I,KACA,CACE2I,EACA,aAAaF,gCACb,aAAaA,wDAA8DC,WAC3E,EACAC,IAKJ,GAFIA,GAAUtQ,IACZwP,EAAMF,YAAYC,EAAKC,IACrBc,GAAUtQ,IAAUsQ,IAAWtQ,EACjC,MAAM,IAAI8M,EAAe0C,EAC/B,IACEzC,IAAI,CAAC,uBAAwB,mBAAmB,YAAY1C,GAC1D,MAAMkF,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdlE,EAAO0D,EAAIG,KAAKC,MAAM9G,MAAMgH,GAAY9O,OAAO8O,EAASxF,EAAM,CAAC1F,qBAC/D3E,EAAQ8H,EAAMyC,KAAK5C,KAAM,UACzB6H,EAAM1H,EAAMyI,WAChB5I,KACA,CACEkE,EACA,aAAauE,yCACb,aAAaA,6CACb/F,IAGJ,GAAIwB,GAAQ7L,IAAU6L,IAAS7L,EAC7B,MAAM,IAAI8M,EAAewC,YAAYC,EAAKC,EAAKnF,GACrD,IACE0C,IAAI,CAAC,0BAA2B,kBAAkB,SAASyD,KAAUnG,GACnE,MAAMkF,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdU,EAAUlB,EAAIG,KAAKC,MAAMa,EAAQ,GACvC7I,KAAK2F,OACHvM,OAAO0P,EAASpG,EAAM,CAAC1F,mBACvB,YAAYwK,UAAUqB,OAAWJ,0CACjC,YAAYjB,UAAUqB,OAAWJ,8CACjC/F,EACAoG,EAEN,IACE1D,IAAI,CAAC,2BAA4B,mBAAmB,YAAY1C,GAC9D,MAAMkF,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdW,EAAWnB,EAAIG,KAAKC,MAAMJ,EAAIG,KAAKC,MAAMnQ,OAAS,GACxDmI,KAAK2F,OACHvM,OAAO2P,EAAUrG,EAAM,CAAC1F,mBACxB,kBAAkByL,0CAClB,kBAAkBA,8CAClB/F,EACAqG,EAEN,IACE3D,IAAI,CAAC,UAAW,iBAAiB,SAASnN,GACxC,GAAwB,iBAAbA,QAA6C,IAAbA,GAA4BA,aAAoB8J,OACzF,OAAO/B,KAAKgJ,OAAO/Q,GACrB,MAAM4B,EAAMmG,KAAK6D,KACXvL,EAAU6H,EAAMyC,KAAK5C,KAAM,WAC3B3H,EAAQ8H,EAAMyC,KAAK5C,KAAM,UAC/B,IAAIiJ,EAAS,KACb,GAAgB,YAAZ3Q,EACF2Q,EAASpP,MACJ,IAAgB,aAAZvB,GAAyC,mBAARuB,EAAoB,CAC9D,GAAKxB,EAOH,OAPU,CACV,MAAMqC,EAAUyF,EAAMyC,KAAK5C,KAAM,YAAc,oDAI/C,MAAM,IAAImF,EAAezK,EAHX,CACZ+K,UAAU,GAE6BtF,EAAMyC,KAAK5C,KAAM,QAClE,CAGA,CAAW,CACL,IAAIkJ,GAAU,EACd,IACErP,GACD,CAAC,MAAOmJ,GACPkG,GAAU,EACVD,EAASjG,CACjB,CACM,IAAKkG,IAAY7Q,EAAO,CACtB,MAAMqC,EAAUyF,EAAMyC,KAAK5C,KAAM,YAAc,qDAI/C,MAAM,IAAImF,EAAezK,EAHX,CACZ+K,UAAU,GAE6BtF,EAAMyC,KAAK5C,KAAM,QAClE,CACA,EACI,GAAwB,mBAAb/H,EAAyB,CAClC,MAAMsJ,EAAOtJ,EAASsJ,MAAQtJ,EAASpC,UAAUsH,YAAYoE,KAC7D,OAAOvB,KAAK2F,OACVsD,GAAUA,aAAkBhR,EAC5B,oCAAoCsJ,IACpC,wCAAwCA,IACxCtJ,EACAgR,GACA,EAER,CACI,GAAIhR,aAAoBwC,MACtB,OAAOuF,KAAK2F,OACVsD,GAAUhR,EAASyC,UAAYuO,EAAOvO,QACtC,mCAAmCzC,EAASyC,UAC5C,uCAAuCzC,EAASyC,UAChDzC,EAASyC,QACTuO,GAAUA,EAAOvO,SAGrB,GAAwB,iBAAbzC,GAAyB,oBAAqBA,GAAgD,mBAA7BA,EAAS8B,gBAAgC,CACnH,MAAMoP,EAAUlR,EAChB,OAAO+H,KAAK2F,OACVsD,GAAUE,EAAQpP,gBAAgBkP,GAClC,6CACA,iDACAE,EAAQtO,WACRoO,GACA,EAER,CACI,MAAM,IAAIxO,MAAM,iGAAiGxC,KACrH,IACEmN,IAAI,CAAC,iBAAkB,aAAa,WAClC,MAAMwC,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdgB,EAAoBxB,EAAIG,KAAKC,MAAMnQ,OAAS,GAAK+P,EAAIG,KAAKsB,QAAQnI,MAAK,EAAGoI,UAAoB,UAATA,IAC3FtJ,KAAK2F,OACHyD,EACA,aAAaX,6CACb,aAAaA,mCACbW,GACCA,GACD,EAEN,IACEhE,IAAI,CAAC,sBAAuB,kBAAkB,SAASyD,GACrD,MAAMjB,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdmB,EAAoB3B,EAAIG,KAAKsB,QAAQG,QAAO,CAACC,GAAWH,UAAoB,UAATA,EAAmBG,IAAYA,GAAS,GACjHzJ,KAAK2F,OACH4D,IAAsBV,EACtB,aAAaJ,gCAAsCI,UACnD,aAAaJ,oCAA0CI,UACvD,+BAA+BA,IAC/B,+BAA+BU,KAC/B,EAEN,IACEnE,IAAI,CAAC,qBAAsB,iBAAiB,SAASjM,GACnD,MAAMyO,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACdlE,EAAO0D,EAAIG,KAAKsB,QAAQnI,MAAK,EAAGoI,OAAMnQ,MAAOgB,KAAsB,WAATmP,GAAqBlQ,OAAOD,EAAOgB,KAC7F9B,EAAQ8H,EAAMyC,KAAK5C,KAAM,UACzB6H,EAAM1H,EAAMyI,WAChB5I,KACA,CACEkE,EACA,aAAauE,0CACb,aAAaA,gCACbtP,IAGJ,GAAI+K,GAAQ7L,IAAU6L,IAAS7L,EAC7B,MAAM,IAAI8M,EA3NQ,EAACyC,EAAKC,EAAK6B,KAC/B7B,GAAOjR,IAAIqR,KAAK,qBAIlBL,EAAIG,KAAKsB,QAAQ3E,KAAI,CAACiF,EAAYpP,KAC9B,IAAI4N,EAAavR,IAAIS,KAAK,KAAKmQ,UAAUjN,EAAI,MAAMqN,EAAIQ,kCAQvD,OAJED,GADEuB,EACYtJ,EAAIA,KAACsJ,EAAcC,EAAWxQ,MAAO,CAAEkP,qBAAqB,IAE5DrP,EAASC,EAAC0Q,GAAYrB,MAAM,MAAM5D,KAAK6D,GAAS,OAAOA,MAAQ5D,KAAK,MACpFwD,GAAc,KACPA,CAAU,IAChBxD,KAAK,SACRkD,EAAOjR,IAAIqR,KAAK,wBAEDrR,IAAIS,KAAKuQ,EAAIG,KAAKC,MAAMnQ,cAyMZ+R,CAAchC,EAAKC,EAAK1O,GACvD,IACEiM,IAAI,CAAC,yBAA0B,qBAAqB,SAASjM,GAC3D,MAAMyO,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,eACZjP,MAAO0Q,GAAejC,EAAIG,KAAKsB,QAAQzB,EAAIG,KAAKsB,QAAQxR,OAAS,GACnEqM,EAAO9K,OAAOyQ,EAAY1Q,GAChC6G,KAAK2F,OACHzB,EACA,kBAAkBuE,2BAClB,kBAAkBA,+BAClBtP,EACA0Q,EAEN,IACEzE,IAAI,CAAC,wBAAyB,oBAAoB,SAAS0D,EAAS3P,GAClE,MAAMyO,EAAMR,OAAOpH,MACbyI,EAAUb,EAAIQ,cACd/P,EAAQ8H,EAAMyC,KAAK5C,KAAM,WACvBsJ,KAAMQ,EAAU3Q,MAAO4Q,GAAenC,EAAIG,KAAKsB,QAAQP,EAAU,GACnEkB,EAAc,GAAGxC,UAAUsB,UAC5BzQ,GAAsB,UAAbyR,GACZhF,EAAKa,OAAOsE,KAAK,YAAYD,qDAC/B,MAAME,EAAgB9Q,OAAO2Q,EAAY5Q,GACzC6G,KAAK2F,OACHuE,EACA,YAAYF,MAAgBvB,2BAC5B,YAAYuB,MAAgBvB,+BAC5BtP,EACA4Q,EAEN,IACE3E,IAAI,aAAa,SAAS+D,EAASzO,GACjC,OAAOsF,KAAKiG,GAAGkE,QAAQhB,EAASzO,EACpC,IACEyF,EAAMiK,YAAYtF,EAAKN,UAAU3O,UAAW,YAAY,SAASwU,sBAC/D,MAAMC,EAAQ,IAAI7P,MAAM,YACxB0F,EAAMyC,KAAK5C,KAAM,UAAW,YAC5BG,EAAMyC,KAAK5C,KAAM,QAASsK,GAC1B,MAAMtI,EAAO7B,EAAMyC,KAAK5C,KAAM,eACxBnG,EAAMsG,EAAMyC,KAAK5C,KAAM,UAC7B,GAAiD,mBAA9B,MAAPnG,OAAc,EAASA,EAAIoK,MACrC,MAAM,IAAIlD,UAAU,4EAA4ElH,OAClG,MAAM0Q,EAAQ,IAAIC,MAAMxK,KAAM,CAC5B1J,IAAK,CAACmU,EAAQ/O,EAAKgP,KACjB,MAAMvQ,EAASwQ,QAAQrU,IAAImU,EAAQ/O,EAAKgP,GACxC,MAAsB,mBAAXvQ,EACFA,aAAkB2K,EAAKN,UAAY+F,EAAQpQ,EAC7CyQ,SAAUlI,KACf,MAAMpK,EAAUuB,EAAIoK,MACjB9K,IACCgH,EAAMyC,KAAK5C,KAAM,SAAU7G,GACpBgB,EAAOpE,KAAKiK,QAAS0C,MAE7BM,IACC,MAAM6H,EAAS,IAAI1F,EACjB,qBAAqBhF,EAAMmH,QAAQtE,2BACnC,CAAEyC,UAAU,IAGd,MADAoF,EAAOC,MAAQR,EAAMQ,MAAMpT,QAAQ4S,EAAM5P,QAASmQ,EAAOnQ,SACnDmQ,CAAM,IAGhB,OAAO5I,kBAAkBD,EAAM1J,EAAQ,CACxC,IAGL,OAAOiS,CACX,IACEpK,EAAMiK,YAAYtF,EAAKN,UAAU3O,UAAW,WAAW,SAASkV,qBAC9D,MAAMT,EAAQ,IAAI7P,MAAM,WACxB0F,EAAMyC,KAAK5C,KAAM,UAAW,WAC5BG,EAAMyC,KAAK5C,KAAM,QAASsK,GAC1B,MAAMtI,EAAO7B,EAAMyC,KAAK5C,KAAM,eACxBnG,EAAMsG,EAAMyC,KAAK5C,KAAM,UACvBgL,EAAyB,mBAARnR,EAAqBA,IAAQA,EACpD,GAAyD,mBAAlC,MAAXmR,OAAkB,EAASA,EAAQ/G,MAC7C,MAAM,IAAIlD,UAAU,2EAA2EiK,OACjG,MAAMT,EAAQ,IAAIC,MAAMxK,KAAM,CAC5B1J,IAAK,CAACmU,EAAQ/O,EAAKgP,KACjB,MAAMvQ,EAASwQ,QAAQrU,IAAImU,EAAQ/O,EAAKgP,GACxC,MAAsB,mBAAXvQ,EACFA,aAAkB2K,EAAKN,UAAY+F,EAAQpQ,EAC7CyQ,SAAUlI,KACf,MAAMpK,EAAU0S,EAAQ/G,MACrB9K,IACC,MAAM0R,EAAS,IAAI1F,EACjB,qBAAqBhF,EAAMmH,QAAQnO,2BACnC,CAAEsM,UAAU,IAGd,MADAoF,EAAOC,MAAQR,EAAMQ,MAAMpT,QAAQ4S,EAAM5P,QAASmQ,EAAOnQ,SACnDmQ,CAAM,IAEb7H,IACC7C,EAAMyC,KAAK5C,KAAM,SAAUgD,GACpB7I,EAAOpE,KAAKiK,QAAS0C,MAGhC,OAAOT,kBAAkBD,EAAM1J,EAAQ,CACxC,IAGL,OAAOiS,CACX,GAAI,eA4Fe,CAACzF,EAAM3E,KACxBA,EAAMoE,UAAUO,EAAKpO,OAAQ,UAAU,CAACA,EAAQuU,KAC9CnG,EAAKoG,IAAI9H,iBAAiB1M,EAAQuU,GAAS,GAC3C,mbAj3CJ,SAASE,SAAS3U,EAAOE,GACvB,MAAMgO,EAAM1O,WAAWT,GACjB6V,EAAU1G,EAAIpO,IAAII,IAAW,CAAE,EACrCd,OAAOyV,OAAOD,EAAS5U,GACvBkO,EAAI5F,IAAIpI,EAAQ0U,EAClB","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/@vitest_expect@0.34.6/node_modules/@vitest/expect/dist/index.esm.js

@@ -0,0 +1,2 @@
+import{diff as e}from"../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/diff.esm.js";import{isMockFunction as t}from"../../../../../@vitest_spy@0.34.6/node_modules/@vitest/spy/dist/index.esm.js";import{processError as n}from"../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/error.esm.js";import{util as s}from"../../../../../chai@4.5.0/node_modules/chai/index.esm.js";import{s as r}from"../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/chunk-display.esm.js";import{b as o}from"../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/chunk-colors.esm.js";import{isObject as i,assertTypes as a}from"../../../../../@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/helpers.esm.js";const l=Symbol.for("matchers-object"),u=Symbol.for("$$jest-matchers-object"),h=Symbol.for("expect-global");if(!Object.prototype.hasOwnProperty.call(globalThis,l)){const e=new WeakMap,t=Object.create(null);Object.defineProperty(globalThis,l,{get:()=>e}),Object.defineProperty(globalThis,u,{configurable:!0,get:()=>({state:e.get(globalThis[h]),matchers:t})})}function getState(e){return globalThis[l].get(e)}function setState(e,t){const n=globalThis[l],s=n.get(t)||{};Object.assign(s,e),n.set(t,s)}function getMatcherUtils(){const c=()=>o(),e=c().green,t=c().red,n=c().inverse,s=c().bold,i=c().dim;const replaceTrailingSpaces=e=>e.replace(/\s+$/gm,(e=>"·".repeat(e.length)));return{EXPECTED_COLOR:e,RECEIVED_COLOR:t,INVERTED_COLOR:n,BOLD_WEIGHT:s,DIM_COLOR:i,matcherHint:function matcherHint(n,s="received",r="expected",o={}){const{comment:a="",isDirectExpectCall:l=!1,isNot:u=!1,promise:h="",secondArgument:f="",expectedColor:p=e,receivedColor:d=t,secondArgumentColor:y=e}=o;let m="",g="expect";return l||""===s||(m+=i(`${g}(`)+d(s),g=")"),""!==h&&(m+=i(`${g}.`)+h,g=""),u&&(m+=`${i(`${g}.`)}not`,g=""),n.includes(".")?g+=n:(m+=i(`${g}.`)+n,g=""),""===r?g+="()":(m+=i(`${g}(`)+p(r),f&&(m+=i(", ")+y(f)),g=")"),""!==a&&(g+=` // ${a}`),""!==g&&(m+=i(g)),m},printReceived:e=>t(replaceTrailingSpaces(r(e))),printExpected:t=>e(replaceTrailingSpaces(r(t)))}}function equals(e,t,n,s){return eq(e,t,[],[],n=n||[],s?hasKey:hasDefinedKey)}function isAsymmetric(e){return!!e&&"object"==typeof e&&"asymmetricMatch"in e&&isA("Function",e.asymmetricMatch)}function eq(e,t,n,s,r,o){let i=!0;const a=function asymmetricMatch(e,t){const n=isAsymmetric(e),s=isAsymmetric(t);if(!n||!s)return n?e.asymmetricMatch(t):s?t.asymmetricMatch(e):void 0}(e,t);if(void 0!==a)return a;for(let n=0;n<r.length;n++){const s=r[n](e,t);if(void 0!==s)return s}if(e instanceof Error&&t instanceof Error)return e.message===t.message;if(Object.is(e,t))return!0;if(null===e||null===t)return e===t;const l=Object.prototype.toString.call(e);if(l!==Object.prototype.toString.call(t))return!1;switch(l){case"[object Boolean]":case"[object String]":case"[object Number]":return typeof e==typeof t&&("object"!=typeof e&&"object"!=typeof t?Object.is(e,t):Object.is(e.valueOf(),t.valueOf()));case"[object Date]":{const n=+e,s=+t;return n===s||Number.isNaN(n)&&Number.isNaN(s)}case"[object RegExp]":return e.source===t.source&&e.flags===t.flags}if("object"!=typeof e||"object"!=typeof t)return!1;if(isDomNode(e)&&isDomNode(t))return e.isEqualNode(t);let u=n.length;for(;u--;){if(n[u]===e)return s[u]===t;if(s[u]===t)return!1}if(n.push(e),s.push(t),"[object Array]"===l&&e.length!==t.length)return!1;const h=keys(e,o);let f,p=h.length;if(keys(t,o).length!==p)return!1;for(;p--;)if(f=h[p],i=o(t,f)&&eq(e[f],t[f],n,s,r,o),!i)return!1;return n.pop(),s.pop(),i}function keys(e,t){const n=[];for(const s in e)t(e,s)&&n.push(s);return n.concat(Object.getOwnPropertySymbols(e).filter((t=>Object.getOwnPropertyDescriptor(e,t).enumerable)))}function hasDefinedKey(e,t){return hasKey(e,t)&&void 0!==e[t]}function hasKey(e,t){return Object.prototype.hasOwnProperty.call(e,t)}function isA(e,t){return Object.prototype.toString.apply(t)===`[object ${e}]`}function isDomNode(e){return null!==e&&"object"==typeof e&&"nodeType"in e&&"number"==typeof e.nodeType&&"nodeName"in e&&"string"==typeof e.nodeName&&"isEqualNode"in e&&"function"==typeof e.isEqualNode}const f="@@__IMMUTABLE_ORDERED__@@";function isImmutableUnorderedKeyed(e){return!(!e||!e["@@__IMMUTABLE_KEYED__@@"]||e[f])}function isImmutableUnorderedSet(e){return!(!e||!e["@@__IMMUTABLE_SET__@@"]||e[f])}const p=Symbol.iterator;function hasIterator(e){return!(null==e||!e[p])}function iterableEquality(e,t,n=[],s=[]){if("object"!=typeof e||"object"!=typeof t||Array.isArray(e)||Array.isArray(t)||!hasIterator(e)||!hasIterator(t))return;if(e.constructor!==t.constructor)return!1;let r=n.length;for(;r--;)if(n[r]===e)return s[r]===t;n.push(e),s.push(t);const iterableEqualityWithStack=(e,t)=>iterableEquality(e,t,[...n],[...s]);if(void 0!==e.size){if(e.size!==t.size)return!1;if(isA("Set",e)||isImmutableUnorderedSet(e)){let r=!0;for(const n of e)if(!t.has(n)){let e=!1;for(const s of t){!0===equals(n,s,[iterableEqualityWithStack])&&(e=!0)}if(!1===e){r=!1;break}}return n.pop(),s.pop(),r}if(isA("Map",e)||isImmutableUnorderedKeyed(e)){let r=!0;for(const n of e)if(!t.has(n[0])||!equals(n[1],t.get(n[0]),[iterableEqualityWithStack])){let e=!1;for(const s of t){let t=!1;!0===equals(n[0],s[0],[iterableEqualityWithStack])&&(t=equals(n[1],s[1],[iterableEqualityWithStack])),!0===t&&(e=!0)}if(!1===e){r=!1;break}}return n.pop(),s.pop(),r}}const o=t[p]();for(const t of e){const e=o.next();if(e.done||!equals(t,e.value,[iterableEqualityWithStack]))return!1}return!!o.next().done&&(n.pop(),s.pop(),!0)}function hasPropertyInObject(e,t){return!(!e||"object"!=typeof e||e===Object.prototype)&&(Object.prototype.hasOwnProperty.call(e,t)||hasPropertyInObject(Object.getPrototypeOf(e),t))}function isObjectWithKeys(e){return i(e)&&!(e instanceof Error)&&!Array.isArray(e)&&!(e instanceof Date)}function subsetEquality(e,t){const subsetEqualityWithContext=(e=new WeakMap)=>(t,n)=>{if(isObjectWithKeys(n))return Object.keys(n).every((s=>{if(isObjectWithKeys(n[s])){if(e.has(n[s]))return equals(t[s],n[s],[iterableEquality]);e.set(n[s],!0)}const r=null!=t&&hasPropertyInObject(t,s)&&equals(t[s],n[s],[iterableEquality,subsetEqualityWithContext(e)]);return e.delete(n[s]),r}))};return subsetEqualityWithContext()(e,t)}function typeEquality(e,t){if(null!=e&&null!=t&&e.constructor!==t.constructor)return!1}function arrayBufferEquality(e,t){let n=e,s=t;if(!(e instanceof DataView&&t instanceof DataView)){if(!(e instanceof ArrayBuffer&&t instanceof ArrayBuffer))return;try{n=new DataView(e),s=new DataView(t)}catch{return}}if(n.byteLength!==s.byteLength)return!1;for(let e=0;e<n.byteLength;e++)if(n.getUint8(e)!==s.getUint8(e))return!1;return!0}function sparseArrayEquality(e,t){if(!Array.isArray(e)||!Array.isArray(t))return;const n=Object.keys(e),s=Object.keys(t);return equals(e,t,[iterableEquality,typeEquality],!0)&&equals(n,s)}function generateToBeMessage(e,t="#{this}",n="#{exp}"){const s=`expected ${t} to be ${n} // Object.is equality`;return["toStrictEqual","toEqual"].includes(e)?`${s}\n\nIf it should pass with deep equality, replace "toBe" with "${e}"\n\nExpected: ${t}\nReceived: serializes to the same string\n`:s}class AsymmetricMatcher{constructor(e,t=!1){this.sample=e,this.inverse=t}$$typeof=Symbol.for("jest.asymmetricMatcher");getMatcherContext(t){return{...getState(t||globalThis[h]),equals:equals,isNot:this.inverse,utils:{...getMatcherUtils(),diff:e,stringify:r,iterableEquality:iterableEquality,subsetEquality:subsetEquality}}}}class StringContaining extends AsymmetricMatcher{constructor(e,t=!1){if(!isA("String",e))throw new Error("Expected is not a string");super(e,t)}asymmetricMatch(e){const t=isA("String",e)&&e.includes(this.sample);return this.inverse?!t:t}toString(){return`String${this.inverse?"Not":""}Containing`}getExpectedType(){return"string"}}class Anything extends AsymmetricMatcher{asymmetricMatch(e){return null!=e}toString(){return"Anything"}toAsymmetricMatcher(){return"Anything"}}class ObjectContaining extends AsymmetricMatcher{constructor(e,t=!1){super(e,t)}getPrototype(e){return Object.getPrototypeOf?Object.getPrototypeOf(e):e.constructor.prototype===e?null:e.constructor.prototype}hasProperty(e,t){return!!e&&(!!Object.prototype.hasOwnProperty.call(e,t)||this.hasProperty(this.getPrototype(e),t))}asymmetricMatch(e){if("object"!=typeof this.sample)throw new TypeError(`You must provide an object to ${this.toString()}, not '${typeof this.sample}'.`);let t=!0;for(const n in this.sample)if(!this.hasProperty(e,n)||!equals(this.sample[n],e[n])){t=!1;break}return this.inverse?!t:t}toString(){return`Object${this.inverse?"Not":""}Containing`}getExpectedType(){return"object"}}class ArrayContaining extends AsymmetricMatcher{constructor(e,t=!1){super(e,t)}asymmetricMatch(e){if(!Array.isArray(this.sample))throw new TypeError(`You must provide an array to ${this.toString()}, not '${typeof this.sample}'.`);const t=0===this.sample.length||Array.isArray(e)&&this.sample.every((t=>e.some((e=>equals(t,e)))));return this.inverse?!t:t}toString(){return`Array${this.inverse?"Not":""}Containing`}getExpectedType(){return"array"}}class Any extends AsymmetricMatcher{constructor(e){if(void 0===e)throw new TypeError("any() expects to be passed a constructor function. Please pass one or use anything() to match any object.");super(e)}fnNameFor(e){if(e.name)return e.name;const t=Function.prototype.toString.call(e).match(/^(?:async)?\s*function\s*\*?\s*([\w$]+)\s*\(/);return t?t[1]:"<anonymous>"}asymmetricMatch(e){return this.sample===String?"string"==typeof e||e instanceof String:this.sample===Number?"number"==typeof e||e instanceof Number:this.sample===Function?"function"==typeof e||e instanceof Function:this.sample===Boolean?"boolean"==typeof e||e instanceof Boolean:this.sample===BigInt?"bigint"==typeof e||e instanceof BigInt:this.sample===Symbol?"symbol"==typeof e||e instanceof Symbol:this.sample===Object?"object"==typeof e:e instanceof this.sample}toString(){return"Any"}getExpectedType(){return this.sample===String?"string":this.sample===Number?"number":this.sample===Function?"function":this.sample===Object?"object":this.sample===Boolean?"boolean":this.fnNameFor(this.sample)}toAsymmetricMatcher(){return`Any<${this.fnNameFor(this.sample)}>`}}class StringMatching extends AsymmetricMatcher{constructor(e,t=!1){if(!isA("String",e)&&!isA("RegExp",e))throw new Error("Expected is not a String or a RegExp");super(new RegExp(e),t)}asymmetricMatch(e){const t=isA("String",e)&&this.sample.test(e);return this.inverse?!t:t}toString(){return`String${this.inverse?"Not":""}Matching`}getExpectedType(){return"string"}}const JestAsymmetricMatchers=(e,t)=>{t.addMethod(e.expect,"anything",(()=>new Anything)),t.addMethod(e.expect,"any",(e=>new Any(e))),t.addMethod(e.expect,"stringContaining",(e=>new StringContaining(e))),t.addMethod(e.expect,"objectContaining",(e=>new ObjectContaining(e))),t.addMethod(e.expect,"arrayContaining",(e=>new ArrayContaining(e))),t.addMethod(e.expect,"stringMatching",(e=>new StringMatching(e))),e.expect.not={stringContaining:e=>new StringContaining(e,!0),objectContaining:e=>new ObjectContaining(e,!0),arrayContaining:e=>new ArrayContaining(e,!0),stringMatching:e=>new StringMatching(e,!0)}};function recordAsyncExpect(e,t){return e&&t instanceof Promise&&(t=t.finally((()=>{const n=e.promises.indexOf(t);-1!==n&&e.promises.splice(n,1)})),e.promises||(e.promises=[]),e.promises.push(t)),t}function wrapSoft(e,t){return function(...s){var r;const o=e.flag(this,"vitest-test");if(!((null==o?void 0:o.context._local)?o.context.expect.getState():getState(globalThis[h])).soft)return t.apply(this,s);if(!o)throw new Error("expect.soft() can only be used inside a test");try{return t.apply(this,s)}catch(e){o.result||(o.result={state:"fail"}),o.result.state="fail",(r=o.result).errors||(r.errors=[]),o.result.errors.push(n(e))}}}const JestChaiExpect=(n,s)=>{const{AssertionError:i}=n,c=()=>o();function def(e,t){const addMethod=e=>{const r=wrapSoft(s,t);s.addMethod(n.Assertion.prototype,e,r),s.addMethod(globalThis[u].matchers,e,r)};Array.isArray(e)?e.forEach((e=>addMethod(e))):addMethod(e)}["throw","throws","Throw"].forEach((e=>{s.overwriteMethod(n.Assertion.prototype,e,(e=>function(...t){const n=s.flag(this,"promise"),r=s.flag(this,"object"),o=s.flag(this,"negate");if("rejects"===n)s.flag(this,"object",(()=>{throw r}));else if("resolves"===n&&"function"!=typeof r){if(o)return;{const e=s.flag(this,"message")||"expected promise to throw an error, but it didn't";throw new i(e,{showDiff:!1},s.flag(this,"ssfi"))}}e.apply(this,t)}))})),def("withTest",(function(e){return s.flag(this,"vitest-test",e),this})),def("toEqual",(function(e){const t=s.flag(this,"object"),n=equals(t,e,[iterableEquality]);return this.assert(n,"expected #{this} to deeply equal #{exp}","expected #{this} to not deeply equal #{exp}",e,t)})),def("toStrictEqual",(function(e){const t=s.flag(this,"object"),n=equals(t,e,[iterableEquality,typeEquality,sparseArrayEquality,arrayBufferEquality],!0);return this.assert(n,"expected #{this} to strictly equal #{exp}","expected #{this} to not strictly equal #{exp}",e,t)})),def("toBe",(function(e){const t=this._obj,n=Object.is(t,e);let s="";if(!n){if(equals(t,e,[iterableEquality,typeEquality,sparseArrayEquality,arrayBufferEquality],!0))s="toStrictEqual";else{equals(t,e,[iterableEquality])&&(s="toEqual")}}return this.assert(n,generateToBeMessage(s),"expected #{this} not to be #{exp} // Object.is equality",e,t)})),def("toMatchObject",(function(e){const t=this._obj;return this.assert(equals(t,e,[iterableEquality,subsetEquality]),"expected #{this} to match object #{exp}","expected #{this} to not match object #{exp}",e,t)})),def("toMatch",(function(e){return"string"==typeof e?this.include(e):this.match(e)})),def("toContain",(function(e){return this.contain(e)})),def("toContainEqual",(function(e){const t=s.flag(this,"object"),n=Array.from(t).findIndex((t=>equals(t,e)));this.assert(-1!==n,"expected #{this} to deep equally contain #{exp}","expected #{this} to not deep equally contain #{exp}",e)})),def("toBeTruthy",(function(){const e=s.flag(this,"object");this.assert(Boolean(e),"expected #{this} to be truthy","expected #{this} to not be truthy",e,!1)})),def("toBeFalsy",(function(){const e=s.flag(this,"object");this.assert(!e,"expected #{this} to be falsy","expected #{this} to not be falsy",e,!1)})),def("toBeGreaterThan",(function(e){const t=this._obj;return a(t,"actual",["number","bigint"]),a(e,"expected",["number","bigint"]),this.assert(t>e,`expected ${t} to be greater than ${e}`,`expected ${t} to be not greater than ${e}`,t,e,!1)})),def("toBeGreaterThanOrEqual",(function(e){const t=this._obj;return a(t,"actual",["number","bigint"]),a(e,"expected",["number","bigint"]),this.assert(t>=e,`expected ${t} to be greater than or equal to ${e}`,`expected ${t} to be not greater than or equal to ${e}`,t,e,!1)})),def("toBeLessThan",(function(e){const t=this._obj;return a(t,"actual",["number","bigint"]),a(e,"expected",["number","bigint"]),this.assert(t<e,`expected ${t} to be less than ${e}`,`expected ${t} to be not less than ${e}`,t,e,!1)})),def("toBeLessThanOrEqual",(function(e){const t=this._obj;return a(t,"actual",["number","bigint"]),a(e,"expected",["number","bigint"]),this.assert(t<=e,`expected ${t} to be less than or equal to ${e}`,`expected ${t} to be not less than or equal to ${e}`,t,e,!1)})),def("toBeNaN",(function(){return this.be.NaN})),def("toBeUndefined",(function(){return this.be.undefined})),def("toBeNull",(function(){return this.be.null})),def("toBeDefined",(function(){const e=s.flag(this,"negate");return s.flag(this,"negate",!1),e?this.be.undefined:this.not.be.undefined})),def("toBeTypeOf",(function(e){const t=typeof this._obj,n=e===t;return this.assert(n,"expected #{this} to be type of #{exp}","expected #{this} not to be type of #{exp}",e,t)})),def("toBeInstanceOf",(function(e){return this.instanceOf(e)})),def("toHaveLength",(function(e){return this.have.length(e)})),def("toHaveProperty",(function(...e){Array.isArray(e[0])&&(e[0]=e[0].map((e=>String(e).replace(/([.[\]])/g,"\\$1"))).join("."));const t=this._obj,[n,r]=e,{value:o,exists:i}=Object.prototype.hasOwnProperty.call(t,n)?{value:t[n],exists:!0}:s.getPathInfo(t,n),a=i&&(1===e.length||equals(r,o)),l=1===e.length?"":` with value ${s.objDisplay(r)}`;return this.assert(a,`expected #{this} to have property "${n}"${l}`,`expected #{this} to not have property "${n}"${l}`,t)})),def("toBeCloseTo",(function(e,t=2){const n=this._obj;let s=!1,r=0,o=0;return e===Number.POSITIVE_INFINITY&&n===Number.POSITIVE_INFINITY||e===Number.NEGATIVE_INFINITY&&n===Number.NEGATIVE_INFINITY?s=!0:(r=10**-t/2,o=Math.abs(n-e),s=o<r),this.assert(s,`expected #{this} to be close to #{exp}, received difference is ${o}, but expected ${r}`,`expected #{this} to not be close to #{exp}, received difference is ${o}, but expected ${r}`,e,n,!1)}));const getSpy=e=>((e=>{if(!t(e._obj))throw new TypeError(`${s.inspect(e._obj)} is not a spy or a call to a spy!`)})(e),e._obj),ordinalOf=e=>{const t=e%10,n=e%100;return 1===t&&11!==n?`${e}st`:2===t&&12!==n?`${e}nd`:3===t&&13!==n?`${e}rd`:`${e}th`},formatCalls=(t,n,s)=>(t.mock.calls&&(n+=c().gray(`\n\nReceived: \n\n${t.mock.calls.map(((n,o)=>{let i=c().bold(`  ${ordinalOf(o+1)} ${t.getMockName()} call:\n\n`);return i+=s?e(s,n,{omitAnnotationLines:!0}):r(n).split("\n").map((e=>`    ${e}`)).join("\n"),i+="\n",i})).join("\n")}`)),n+=c().gray(`\n\nNumber of calls: ${c().bold(t.mock.calls.length)}\n`));def(["toHaveBeenCalledTimes","toBeCalledTimes"],(function(e){const t=getSpy(this),n=t.getMockName(),s=t.mock.calls.length;return this.assert(s===e,`expected "${n}" to be called #{exp} times, but got ${s} times`,`expected "${n}" to not be called #{exp} times`,e,s,!1)})),def("toHaveBeenCalledOnce",(function(){const e=getSpy(this),t=e.getMockName(),n=e.mock.calls.length;return this.assert(1===n,`expected "${t}" to be called once, but got ${n} times`,`expected "${t}" to not be called once`,1,n,!1)})),def(["toHaveBeenCalled","toBeCalled"],(function(){const e=getSpy(this),t=e.getMockName(),n=e.mock.calls.length,r=n>0,o=s.flag(this,"negate");let a=s.getMessage(this,[r,`expected "${t}" to be called at least once`,`expected "${t}" to not be called at all, but actually been called ${n} times`,!0,r]);if(r&&o&&(a=formatCalls(e,a)),r&&o||!r&&!o)throw new i(a)})),def(["toHaveBeenCalledWith","toBeCalledWith"],(function(...e){const t=getSpy(this),n=t.getMockName(),r=t.mock.calls.some((t=>equals(t,e,[iterableEquality]))),o=s.flag(this,"negate"),a=s.getMessage(this,[r,`expected "${n}" to be called with arguments: #{exp}`,`expected "${n}" to not be called with arguments: #{exp}`,e]);if(r&&o||!r&&!o)throw new i(formatCalls(t,a,e))})),def(["toHaveBeenNthCalledWith","nthCalledWith"],(function(e,...t){const n=getSpy(this),s=n.getMockName(),r=n.mock.calls[e-1];this.assert(equals(r,t,[iterableEquality]),`expected ${ordinalOf(e)} "${s}" call to have been called with #{exp}`,`expected ${ordinalOf(e)} "${s}" call to not have been called with #{exp}`,t,r)})),def(["toHaveBeenLastCalledWith","lastCalledWith"],(function(...e){const t=getSpy(this),n=t.getMockName(),s=t.mock.calls[t.mock.calls.length-1];this.assert(equals(s,e,[iterableEquality]),`expected last "${n}" call to have been called with #{exp}`,`expected last "${n}" call to not have been called with #{exp}`,e,s)})),def(["toThrow","toThrowError"],(function(e){if("string"==typeof e||void 0===e||e instanceof RegExp)return this.throws(e);const t=this._obj,n=s.flag(this,"promise"),r=s.flag(this,"negate");let o=null;if("rejects"===n)o=t;else{if("resolves"===n&&"function"!=typeof t){if(r)return;{const e=s.flag(this,"message")||"expected promise to throw an error, but it didn't";throw new i(e,{showDiff:!1},s.flag(this,"ssfi"))}}{let e=!1;try{t()}catch(t){e=!0,o=t}if(!e&&!r){const e=s.flag(this,"message")||"expected function to throw an error, but it didn't";throw new i(e,{showDiff:!1},s.flag(this,"ssfi"))}}}if("function"==typeof e){const t=e.name||e.prototype.constructor.name;return this.assert(o&&o instanceof e,`expected error to be instance of ${t}`,`expected error not to be instance of ${t}`,e,o,!1)}if(e instanceof Error)return this.assert(o&&e.message===o.message,`expected error to have message: ${e.message}`,`expected error not to have message: ${e.message}`,e.message,o&&o.message);if("object"==typeof e&&"asymmetricMatch"in e&&"function"==typeof e.asymmetricMatch){const t=e;return this.assert(o&&t.asymmetricMatch(o),"expected error to match asymmetric matcher","expected error not to match asymmetric matcher",t.toString(),o,!1)}throw new Error(`"toThrow" expects string, RegExp, function, Error instance or asymmetric matcher, got "${typeof e}"`)})),def(["toHaveReturned","toReturn"],(function(){const e=getSpy(this),t=e.getMockName(),n=e.mock.calls.length>0&&e.mock.results.some((({type:e})=>"throw"!==e));this.assert(n,`expected "${t}" to be successfully called at least once`,`expected "${t}" to not be successfully called`,n,!n,!1)})),def(["toHaveReturnedTimes","toReturnTimes"],(function(e){const t=getSpy(this),n=t.getMockName(),s=t.mock.results.reduce(((e,{type:t})=>"throw"===t?e:++e),0);this.assert(s===e,`expected "${n}" to be successfully called ${e} times`,`expected "${n}" to not be successfully called ${e} times`,`expected number of returns: ${e}`,`received number of returns: ${s}`,!1)})),def(["toHaveReturnedWith","toReturnWith"],(function(t){const n=getSpy(this),o=n.getMockName(),a=n.mock.results.some((({type:e,value:n})=>"return"===e&&equals(t,n))),l=s.flag(this,"negate"),u=s.getMessage(this,[a,`expected "${o}" to return with: #{exp} at least once`,`expected "${o}" to not return with: #{exp}`,t]);if(a&&l||!a&&!l)throw new i(((t,n,s)=>(n+=c().gray(`\n\nReceived: \n\n${t.mock.results.map(((n,o)=>{let i=c().bold(`  ${ordinalOf(o+1)} ${t.getMockName()} call return:\n\n`);return i+=s?e(s,n.value,{omitAnnotationLines:!0}):r(n).split("\n").map((e=>`    ${e}`)).join("\n"),i+="\n",i})).join("\n")}`),n+c().gray(`\n\nNumber of calls: ${c().bold(t.mock.calls.length)}\n`)))(n,u,t))})),def(["toHaveLastReturnedWith","lastReturnedWith"],(function(e){const t=getSpy(this),n=t.getMockName(),{value:s}=t.mock.results[t.mock.results.length-1],r=equals(s,e);this.assert(r,`expected last "${n}" call to return #{exp}`,`expected last "${n}" call to not return #{exp}`,e,s)})),def(["toHaveNthReturnedWith","nthReturnedWith"],(function(e,t){const r=getSpy(this),o=r.getMockName(),i=s.flag(this,"negate"),{type:a,value:l}=r.mock.results[e-1],u=`${ordinalOf(e)} call`;i||"throw"!==a||n.assert.fail(`expected ${u} to return #{exp}, but instead it threw an error`);const h=equals(l,t);this.assert(h,`expected ${u} "${o}" call to return #{exp}`,`expected ${u} "${o}" call to not return #{exp}`,t,l)})),def("toSatisfy",(function(e,t){return this.be.satisfy(e,t)})),s.addProperty(n.Assertion.prototype,"resolves",(function __VITEST_RESOLVES__(){const e=new Error("resolves");s.flag(this,"promise","resolves"),s.flag(this,"error",e);const t=s.flag(this,"vitest-test"),r=s.flag(this,"object");if("function"!=typeof(null==r?void 0:r.then))throw new TypeError(`You must provide a Promise to expect() when using .resolves, not '${typeof r}'.`);const o=new Proxy(this,{get:(a,l,u)=>{const h=Reflect.get(a,l,u);return"function"!=typeof h?h instanceof n.Assertion?o:h:async(...n)=>{const o=r.then((e=>(s.flag(this,"object",e),h.call(this,...n))),(t=>{const n=new i(`promise rejected "${s.inspect(t)}" instead of resolving`,{showDiff:!1});throw n.stack=e.stack.replace(e.message,n.message),n}));return recordAsyncExpect(t,o)}}});return o})),s.addProperty(n.Assertion.prototype,"rejects",(function __VITEST_REJECTS__(){const e=new Error("rejects");s.flag(this,"promise","rejects"),s.flag(this,"error",e);const t=s.flag(this,"vitest-test"),r=s.flag(this,"object"),o="function"==typeof r?r():r;if("function"!=typeof(null==o?void 0:o.then))throw new TypeError(`You must provide a Promise to expect() when using .rejects, not '${typeof o}'.`);const a=new Proxy(this,{get:(r,l,u)=>{const h=Reflect.get(r,l,u);return"function"!=typeof h?h instanceof n.Assertion?a:h:async(...n)=>{const r=o.then((t=>{const n=new i(`promise resolved "${s.inspect(t)}" instead of rejecting`,{showDiff:!1});throw n.stack=e.stack.replace(e.message,n.message),n}),(e=>(s.flag(this,"object",e),h.call(this,...n))));return recordAsyncExpect(t,r)}}});return a}))};class JestExtendError extends Error{constructor(e,t,n){super(e),this.actual=t,this.expected=n}}function JestExtendPlugin(t,n){return(o,i)=>{Object.entries(n).forEach((([n,a])=>{const l=wrapSoft(i,(function expectWrapper(...n){const{state:o,isNot:i,obj:l}=function getMatcherState(t,n){const o=t._obj,i=s.flag(t,"negate"),a=s.flag(t,"promise")||"",l={...getMatcherUtils(),diff:e,stringify:r,iterableEquality:iterableEquality,subsetEquality:subsetEquality};return{state:{...getState(n),isNot:i,utils:l,promise:a,equals:equals,suppressedErrors:[]},isNot:i,obj:o}}(this,t),u=a.call(o,l,...n);if(u&&"object"==typeof u&&u instanceof Promise)return u.then((({pass:e,message:t,actual:n,expected:s})=>{if(e&&i||!e&&!i)throw new JestExtendError(t(),n,s)}));const{pass:h,message:f,actual:p,expected:d}=u;if(h&&i||!h&&!i)throw new JestExtendError(f(),p,d)}));i.addMethod(globalThis[u].matchers,n,l),i.addMethod(o.Assertion.prototype,n,l);class CustomMatcher extends AsymmetricMatcher{constructor(e=!1,...t){super(t,e)}asymmetricMatch(e){const{pass:n}=a.call(this.getMatcherContext(t),e,...this.sample);return this.inverse?!n:n}toString(){return`${this.inverse?"not.":""}${n}`}getExpectedType(){return"any"}toAsymmetricMatcher(){return`${this.toString()}<${this.sample.map(String).join(", ")}>`}}Object.defineProperty(t,n,{configurable:!0,enumerable:!0,value:(...e)=>new CustomMatcher(!1,...e),writable:!0}),Object.defineProperty(t.not,n,{configurable:!0,enumerable:!0,value:(...e)=>new CustomMatcher(!0,...e),writable:!0})}))}}const JestExtend=(e,t)=>{t.addMethod(e.expect,"extend",((t,n)=>{e.use(JestExtendPlugin(t,n))}))};export{Any,Anything,ArrayContaining,AsymmetricMatcher,h as GLOBAL_EXPECT,u as JEST_MATCHERS_OBJECT,JestAsymmetricMatchers,JestChaiExpect,JestExtend,l as MATCHERS_OBJECT,ObjectContaining,StringContaining,StringMatching,arrayBufferEquality,equals,generateToBeMessage,getState,isA,isAsymmetric,isImmutableUnorderedKeyed,isImmutableUnorderedSet,iterableEquality,setState,sparseArrayEquality,subsetEquality,typeEquality};
+//# sourceMappingURL=index.esm.js.map