npm - @bonfida/spl-name-service - Versions diffs - 3.0.13 → 3.0.15 - Mend

@bonfida/spl-name-service 3.0.13 → 3.0.15

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1594) hide show

package/dist/esm/node_modules/ipaddr.js/lib/ipaddr.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"ipaddr.mjs","sources":["../../../../../node_modules/ipaddr.js/lib/ipaddr.js"],"sourcesContent":["(function (root) {\n 'use strict';\n // A list of regular expressions that match arbitrary IPv4 addresses,\n // for which a number of weird notations exist.\n // Note that an address like 0010.0xa5.1.1 is considered legal.\n const ipv4Part = '(0?\\\\d+|0x[a-f0-9]+)';\n const ipv4Regexes = {\n fourOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n threeOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n twoOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n longValue: new RegExp(`^${ipv4Part}$`, 'i')\n };\n\n // Regular Expression for checking Octal numbers\n const octalRegex = new RegExp(`^0[0-7]+$`, 'i');\n const hexRegex = new RegExp(`^0x[a-f0-9]+$`, 'i');\n\n const zoneIndex = '%[0-9a-z]{1,}';\n\n // IPv6-matching regular expressions.\n // For IPv6, the task is simpler: it is enough to match the colon-delimited\n // hexadecimal IPv6 and a transitional variant with dotted-decimal IPv4 at\n // the end.\n const ipv6Part = '(?:[0-9a-f]+::?)+';\n const ipv6Regexes = {\n zoneIndex: new RegExp(zoneIndex, 'i'),\n 'native': new RegExp(`^(::)?(${ipv6Part})?([0-9a-f]+)?(::)?(${zoneIndex})?$`, 'i'),\n deprecatedTransitional: new RegExp(`^(?:::)(${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}(${zoneIndex})?)$`, 'i'),\n transitional: new RegExp(`^((?:${ipv6Part})|(?:::)(?:${ipv6Part})?)${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}(${zoneIndex})?$`, 'i')\n };\n\n // Expand :: in an IPv6 address or address part consisting of `parts` groups.\n function expandIPv6 (string, parts) {\n // More than one '::' means invalid adddress\n if (string.indexOf('::') !== string.lastIndexOf('::')) {\n return null;\n }\n\n let colonCount = 0;\n let lastColon = -1;\n let zoneId = (string.match(ipv6Regexes.zoneIndex) || [])[0];\n let replacement, replacementCount;\n\n // Remove zone index and save it for later\n if (zoneId) {\n zoneId = zoneId.substring(1);\n string = string.replace(/%.+$/, '');\n }\n\n // How many parts do we already have?\n while ((lastColon = string.indexOf(':', lastColon + 1)) >= 0) {\n colonCount++;\n }\n\n // 0::0 is two parts more than ::\n if (string.substr(0, 2) === '::') {\n colonCount--;\n }\n\n if (string.substr(-2, 2) === '::') {\n colonCount--;\n }\n\n // The following loop would hang if colonCount > parts\n if (colonCount > parts) {\n return null;\n }\n\n // replacement = ':' + '0:' * (parts - colonCount)\n replacementCount = parts - colonCount;\n replacement = ':';\n while (replacementCount--) {\n replacement += '0:';\n }\n\n // Insert the missing zeroes\n string = string.replace('::', replacement);\n\n // Trim any garbage which may be hanging around if :: was at the edge in\n // the source strin\n if (string[0] === ':') {\n string = string.slice(1);\n }\n\n if (string[string.length - 1] === ':') {\n string = string.slice(0, -1);\n }\n\n parts = (function () {\n const ref = string.split(':');\n const results = [];\n\n for (let i = 0; i < ref.length; i++) {\n results.push(parseInt(ref[i], 16));\n }\n\n return results;\n })();\n\n return {\n parts: parts,\n zoneId: zoneId\n };\n }\n\n // A generic CIDR (Classless Inter-Domain Routing) RFC1518 range matcher.\n function matchCIDR (first, second, partSize, cidrBits) {\n if (first.length !== second.length) {\n throw new Error('ipaddr: cannot match CIDR for objects with different lengths');\n }\n\n let part = 0;\n let shift;\n\n while (cidrBits > 0) {\n shift = partSize - cidrBits;\n if (shift < 0) {\n shift = 0;\n }\n\n if (first[part] >> shift !== second[part] >> shift) {\n return false;\n }\n\n cidrBits -= partSize;\n part += 1;\n }\n\n return true;\n }\n\n function parseIntAuto (string) {\n // Hexadedimal base 16 (0x#)\n if (hexRegex.test(string)) {\n return parseInt(string, 16);\n }\n // While octal representation is discouraged by ECMAScript 3\n // and forbidden by ECMAScript 5, we silently allow it to\n // work only if the rest of the string has numbers less than 8.\n if (string[0] === '0' && !isNaN(parseInt(string[1], 10))) {\n if (octalRegex.test(string)) {\n return parseInt(string, 8);\n }\n throw new Error(`ipaddr: cannot parse ${string} as octal`);\n }\n // Always include the base 10 radix!\n return parseInt(string, 10);\n }\n\n function padPart (part, length) {\n while (part.length < length) {\n part = `0${part}`;\n }\n\n return part;\n }\n\n const ipaddr = {};\n\n // An IPv4 address (RFC791).\n ipaddr.IPv4 = (function () {\n // Constructs a new IPv4 address from an array of four octets\n // in network order (MSB first)\n // Verifies the input.\n function IPv4 (octets) {\n if (octets.length !== 4) {\n throw new Error('ipaddr: ipv4 octet count should be 4');\n }\n\n let i, octet;\n\n for (i = 0; i < octets.length; i++) {\n octet = octets[i];\n if (!((0 <= octet && octet <= 255))) {\n throw new Error('ipaddr: ipv4 octet should fit in 8 bits');\n }\n }\n\n this.octets = octets;\n }\n\n // Special IPv4 address ranges.\n // See also https://en.wikipedia.org/wiki/Reserved_IP_addresses\n IPv4.prototype.SpecialRanges = {\n unspecified: [[new IPv4([0, 0, 0, 0]), 8]],\n broadcast: [[new IPv4([255, 255, 255, 255]), 32]],\n // RFC3171\n multicast: [[new IPv4([224, 0, 0, 0]), 4]],\n // RFC3927\n linkLocal: [[new IPv4([169, 254, 0, 0]), 16]],\n // RFC5735\n loopback: [[new IPv4([127, 0, 0, 0]), 8]],\n // RFC6598\n carrierGradeNat: [[new IPv4([100, 64, 0, 0]), 10]],\n // RFC1918\n 'private': [\n [new IPv4([10, 0, 0, 0]), 8],\n [new IPv4([172, 16, 0, 0]), 12],\n [new IPv4([192, 168, 0, 0]), 16]\n ],\n // Reserved and testing-only ranges; RFCs 5735, 5737, 2544, 1700\n reserved: [\n [new IPv4([192, 0, 0, 0]), 24],\n [new IPv4([192, 0, 2, 0]), 24],\n [new IPv4([192, 88, 99, 0]), 24],\n [new IPv4([198, 18, 0, 0]), 15],\n [new IPv4([198, 51, 100, 0]), 24],\n [new IPv4([203, 0, 113, 0]), 24],\n [new IPv4([240, 0, 0, 0]), 4]\n ],\n // RFC7534, RFC7535\n as112: [\n [new IPv4([192, 175, 48, 0]), 24],\n [new IPv4([192, 31, 196, 0]), 24],\n ],\n // RFC7450\n amt: [\n [new IPv4([192, 52, 193, 0]), 24],\n ],\n };\n\n // The 'kind' method exists on both IPv4 and IPv6 classes.\n IPv4.prototype.kind = function () {\n return 'ipv4';\n };\n\n // Checks if this address matches other one within given CIDR range.\n IPv4.prototype.match = function (other, cidrRange) {\n let ref;\n if (cidrRange === undefined) {\n ref = other;\n other = ref[0];\n cidrRange = ref[1];\n }\n\n if (other.kind() !== 'ipv4') {\n throw new Error('ipaddr: cannot match ipv4 address with non-ipv4 one');\n }\n\n return matchCIDR(this.octets, other.octets, 8, cidrRange);\n };\n\n // returns a number of leading ones in IPv4 address, making sure that\n // the rest is a solid sequence of 0's (valid netmask)\n // returns either the CIDR length or null if mask is not valid\n IPv4.prototype.prefixLengthFromSubnetMask = function () {\n let cidr = 0;\n // non-zero encountered stop scanning for zeroes\n let stop = false;\n // number of zeroes in octet\n const zerotable = {\n 0: 8,\n 128: 7,\n 192: 6,\n 224: 5,\n 240: 4,\n 248: 3,\n 252: 2,\n 254: 1,\n 255: 0\n };\n let i, octet, zeros;\n\n for (i = 3; i >= 0; i -= 1) {\n octet = this.octets[i];\n if (octet in zerotable) {\n zeros = zerotable[octet];\n if (stop && zeros !== 0) {\n return null;\n }\n\n if (zeros !== 8) {\n stop = true;\n }\n\n cidr += zeros;\n } else {\n return null;\n }\n }\n\n return 32 - cidr;\n };\n\n // Checks if the address corresponds to one of the special ranges.\n IPv4.prototype.range = function () {\n return ipaddr.subnetMatch(this, this.SpecialRanges);\n };\n\n // Returns an array of byte-sized values in network order (MSB first)\n IPv4.prototype.toByteArray = function () {\n return this.octets.slice(0);\n };\n\n // Converts this IPv4 address to an IPv4-mapped IPv6 address.\n IPv4.prototype.toIPv4MappedAddress = function () {\n return ipaddr.IPv6.parse(`::ffff:${this.toString()}`);\n };\n\n // Symmetrical method strictly for aligning with the IPv6 methods.\n IPv4.prototype.toNormalizedString = function () {\n return this.toString();\n };\n\n // Returns the address in convenient, decimal-dotted format.\n IPv4.prototype.toString = function () {\n return this.octets.join('.');\n };\n\n return IPv4;\n })();\n\n // A utility function to return broadcast address given the IPv4 interface and prefix length in CIDR notation\n ipaddr.IPv4.broadcastAddressFromCIDR = function (string) {\n\n try {\n const cidr = this.parseCIDR(string);\n const ipInterfaceOctets = cidr[0].toByteArray();\n const subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n const octets = [];\n let i = 0;\n while (i < 4) {\n // Broadcast address is bitwise OR between ip interface and inverted mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) | parseInt(subnetMaskOctets[i], 10) ^ 255);\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error('ipaddr: the address does not have IPv4 CIDR format');\n }\n };\n\n // Checks if a given string is formatted like IPv4 address.\n ipaddr.IPv4.isIPv4 = function (string) {\n return this.parser(string) !== null;\n };\n\n // Checks if a given string is a valid IPv4 address.\n ipaddr.IPv4.isValid = function (string) {\n try {\n new this(this.parser(string));\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // Checks if a given string is a valid IPv4 address in CIDR notation.\n ipaddr.IPv4.isValidCIDR = function (string) {\n try {\n this.parseCIDR(string);\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // Checks if a given string is a full four-part IPv4 Address.\n ipaddr.IPv4.isValidFourPartDecimal = function (string) {\n if (ipaddr.IPv4.isValid(string) && string.match(/^(0|[1-9]\\d*)(\\.(0|[1-9]\\d*)){3}$/)) {\n return true;\n } else {\n return false;\n }\n };\n\n // A utility function to return network address given the IPv4 interface and prefix length in CIDR notation\n ipaddr.IPv4.networkAddressFromCIDR = function (string) {\n let cidr, i, ipInterfaceOctets, octets, subnetMaskOctets;\n\n try {\n cidr = this.parseCIDR(string);\n ipInterfaceOctets = cidr[0].toByteArray();\n subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n octets = [];\n i = 0;\n while (i < 4) {\n // Network address is bitwise AND between ip interface and mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) & parseInt(subnetMaskOctets[i], 10));\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error('ipaddr: the address does not have IPv4 CIDR format');\n }\n };\n\n // Tries to parse and validate a string with IPv4 address.\n // Throws an error if it fails.\n ipaddr.IPv4.parse = function (string) {\n const parts = this.parser(string);\n\n if (parts === null) {\n throw new Error('ipaddr: string is not formatted like an IPv4 Address');\n }\n\n return new this(parts);\n };\n\n // Parses the string as an IPv4 Address with CIDR Notation.\n ipaddr.IPv4.parseCIDR = function (string) {\n let match;\n\n if ((match = string.match(/^(.+)\\/(\\d+)$/))) {\n const maskLength = parseInt(match[2]);\n if (maskLength >= 0 && maskLength <= 32) {\n const parsed = [this.parse(match[1]), maskLength];\n Object.defineProperty(parsed, 'toString', {\n value: function () {\n return this.join('/');\n }\n });\n return parsed;\n }\n }\n\n throw new Error('ipaddr: string is not formatted like an IPv4 CIDR range');\n };\n\n // Classful variants (like a.b, where a is an octet, and b is a 24-bit\n // value representing last three octets; this corresponds to a class C\n // address) are omitted due to classless nature of modern Internet.\n ipaddr.IPv4.parser = function (string) {\n let match, part, value;\n\n // parseInt recognizes all that octal & hexadecimal weirdness for us\n if ((match = string.match(ipv4Regexes.fourOctet))) {\n return (function () {\n const ref = match.slice(1, 6);\n const results = [];\n\n for (let i = 0; i < ref.length; i++) {\n part = ref[i];\n results.push(parseIntAuto(part));\n }\n\n return results;\n })();\n } else if ((match = string.match(ipv4Regexes.longValue))) {\n value = parseIntAuto(match[1]);\n if (value > 0xffffffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n return ((function () {\n const results = [];\n let shift;\n\n for (shift = 0; shift <= 24; shift += 8) {\n results.push((value >> shift) & 0xff);\n }\n\n return results;\n })()).reverse();\n } else if ((match = string.match(ipv4Regexes.twoOctet))) {\n return (function () {\n const ref = match.slice(1, 4);\n const results = [];\n\n value = parseIntAuto(ref[1]);\n if (value > 0xffffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n results.push(parseIntAuto(ref[0]));\n results.push((value >> 16) & 0xff);\n results.push((value >> 8) & 0xff);\n results.push( value & 0xff);\n\n return results;\n })();\n } else if ((match = string.match(ipv4Regexes.threeOctet))) {\n return (function () {\n const ref = match.slice(1, 5);\n const results = [];\n\n value = parseIntAuto(ref[2]);\n if (value > 0xffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n results.push(parseIntAuto(ref[0]));\n results.push(parseIntAuto(ref[1]));\n results.push((value >> 8) & 0xff);\n results.push( value & 0xff);\n\n return results;\n })();\n } else {\n return null;\n }\n };\n\n // A utility function to return subnet mask in IPv4 format given the prefix length\n ipaddr.IPv4.subnetMaskFromPrefixLength = function (prefix) {\n prefix = parseInt(prefix);\n if (prefix < 0 || prefix > 32) {\n throw new Error('ipaddr: invalid IPv4 prefix length');\n }\n\n const octets = [0, 0, 0, 0];\n let j = 0;\n const filledOctetCount = Math.floor(prefix / 8);\n\n while (j < filledOctetCount) {\n octets[j] = 255;\n j++;\n }\n\n if (filledOctetCount < 4) {\n octets[filledOctetCount] = Math.pow(2, prefix % 8) - 1 << 8 - (prefix % 8);\n }\n\n return new this(octets);\n };\n\n // An IPv6 address (RFC2460)\n ipaddr.IPv6 = (function () {\n // Constructs an IPv6 address from an array of eight 16 - bit parts\n // or sixteen 8 - bit parts in network order(MSB first).\n // Throws an error if the input is invalid.\n function IPv6 (parts, zoneId) {\n let i, part;\n\n if (parts.length === 16) {\n this.parts = [];\n for (i = 0; i <= 14; i += 2) {\n this.parts.push((parts[i] << 8) | parts[i + 1]);\n }\n } else if (parts.length === 8) {\n this.parts = parts;\n } else {\n throw new Error('ipaddr: ipv6 part count should be 8 or 16');\n }\n\n for (i = 0; i < this.parts.length; i++) {\n part = this.parts[i];\n if (!((0 <= part && part <= 0xffff))) {\n throw new Error('ipaddr: ipv6 part should fit in 16 bits');\n }\n }\n\n if (zoneId) {\n this.zoneId = zoneId;\n }\n }\n\n // Special IPv6 ranges\n IPv6.prototype.SpecialRanges = {\n // RFC4291, here and after\n unspecified: [new IPv6([0, 0, 0, 0, 0, 0, 0, 0]), 128],\n linkLocal: [new IPv6([0xfe80, 0, 0, 0, 0, 0, 0, 0]), 10],\n multicast: [new IPv6([0xff00, 0, 0, 0, 0, 0, 0, 0]), 8],\n loopback: [new IPv6([0, 0, 0, 0, 0, 0, 0, 1]), 128],\n uniqueLocal: [new IPv6([0xfc00, 0, 0, 0, 0, 0, 0, 0]), 7],\n ipv4Mapped: [new IPv6([0, 0, 0, 0, 0, 0xffff, 0, 0]), 96],\n // RFC6666\n discard: [new IPv6([0x100, 0, 0, 0, 0, 0, 0, 0]), 64],\n // RFC6145\n rfc6145: [new IPv6([0, 0, 0, 0, 0xffff, 0, 0, 0]), 96],\n // RFC6052\n rfc6052: [new IPv6([0x64, 0xff9b, 0, 0, 0, 0, 0, 0]), 96],\n // RFC3056\n '6to4': [new IPv6([0x2002, 0, 0, 0, 0, 0, 0, 0]), 16],\n // RFC6052, RFC6146\n teredo: [new IPv6([0x2001, 0, 0, 0, 0, 0, 0, 0]), 32],\n // RFC5180\n benchmarking: [new IPv6([0x2001, 0x2, 0, 0, 0, 0, 0, 0]), 48],\n // RFC7450\n amt: [new IPv6([0x2001, 0x3, 0, 0, 0, 0, 0, 0]), 32],\n as112v6: [\n [new IPv6([0x2001, 0x4, 0x112, 0, 0, 0, 0, 0]), 48],\n [new IPv6([0x2620, 0x4f, 0x8000, 0, 0, 0, 0, 0]), 48],\n ],\n deprecated: [new IPv6([0x2001, 0x10, 0, 0, 0, 0, 0, 0]), 28],\n orchid2: [new IPv6([0x2001, 0x20, 0, 0, 0, 0, 0, 0]), 28],\n droneRemoteIdProtocolEntityTags: [new IPv6([0x2001, 0x30, 0, 0, 0, 0, 0, 0]), 28],\n reserved: [\n // RFC3849\n [new IPv6([0x2001, 0, 0, 0, 0, 0, 0, 0]), 23],\n // RFC2928\n [new IPv6([0x2001, 0xdb8, 0, 0, 0, 0, 0, 0]), 32],\n ],\n };\n\n // Checks if this address is an IPv4-mapped IPv6 address.\n IPv6.prototype.isIPv4MappedAddress = function () {\n return this.range() === 'ipv4Mapped';\n };\n\n // The 'kind' method exists on both IPv4 and IPv6 classes.\n IPv6.prototype.kind = function () {\n return 'ipv6';\n };\n\n // Checks if this address matches other one within given CIDR range.\n IPv6.prototype.match = function (other, cidrRange) {\n let ref;\n\n if (cidrRange === undefined) {\n ref = other;\n other = ref[0];\n cidrRange = ref[1];\n }\n\n if (other.kind() !== 'ipv6') {\n throw new Error('ipaddr: cannot match ipv6 address with non-ipv6 one');\n }\n\n return matchCIDR(this.parts, other.parts, 16, cidrRange);\n };\n\n // returns a number of leading ones in IPv6 address, making sure that\n // the rest is a solid sequence of 0's (valid netmask)\n // returns either the CIDR length or null if mask is not valid\n IPv6.prototype.prefixLengthFromSubnetMask = function () {\n let cidr = 0;\n // non-zero encountered stop scanning for zeroes\n let stop = false;\n // number of zeroes in octet\n const zerotable = {\n 0: 16,\n 32768: 15,\n 49152: 14,\n 57344: 13,\n 61440: 12,\n 63488: 11,\n 64512: 10,\n 65024: 9,\n 65280: 8,\n 65408: 7,\n 65472: 6,\n 65504: 5,\n 65520: 4,\n 65528: 3,\n 65532: 2,\n 65534: 1,\n 65535: 0\n };\n let part, zeros;\n\n for (let i = 7; i >= 0; i -= 1) {\n part = this.parts[i];\n if (part in zerotable) {\n zeros = zerotable[part];\n if (stop && zeros !== 0) {\n return null;\n }\n\n if (zeros !== 16) {\n stop = true;\n }\n\n cidr += zeros;\n } else {\n return null;\n }\n }\n\n return 128 - cidr;\n };\n\n\n // Checks if the address corresponds to one of the special ranges.\n IPv6.prototype.range = function () {\n return ipaddr.subnetMatch(this, this.SpecialRanges);\n };\n\n // Returns an array of byte-sized values in network order (MSB first)\n IPv6.prototype.toByteArray = function () {\n let part;\n const bytes = [];\n const ref = this.parts;\n for (let i = 0; i < ref.length; i++) {\n part = ref[i];\n bytes.push(part >> 8);\n bytes.push(part & 0xff);\n }\n\n return bytes;\n };\n\n // Returns the address in expanded format with all zeroes included, like\n // 2001:0db8:0008:0066:0000:0000:0000:0001\n IPv6.prototype.toFixedLengthString = function () {\n const addr = ((function () {\n const results = [];\n for (let i = 0; i < this.parts.length; i++) {\n results.push(padPart(this.parts[i].toString(16), 4));\n }\n\n return results;\n }).call(this)).join(':');\n\n let suffix = '';\n\n if (this.zoneId) {\n suffix = `%${this.zoneId}`;\n }\n\n return addr + suffix;\n };\n\n // Converts this address to IPv4 address if it is an IPv4-mapped IPv6 address.\n // Throws an error otherwise.\n IPv6.prototype.toIPv4Address = function () {\n if (!this.isIPv4MappedAddress()) {\n throw new Error('ipaddr: trying to convert a generic ipv6 address to ipv4');\n }\n\n const ref = this.parts.slice(-2);\n const high = ref[0];\n const low = ref[1];\n\n return new ipaddr.IPv4([high >> 8, high & 0xff, low >> 8, low & 0xff]);\n };\n\n // Returns the address in expanded format with all zeroes included, like\n // 2001:db8:8:66:0:0:0:1\n //\n // Deprecated: use toFixedLengthString() instead.\n IPv6.prototype.toNormalizedString = function () {\n const addr = ((function () {\n const results = [];\n\n for (let i = 0; i < this.parts.length; i++) {\n results.push(this.parts[i].toString(16));\n }\n\n return results;\n }).call(this)).join(':');\n\n let suffix = '';\n\n if (this.zoneId) {\n suffix = `%${this.zoneId}`;\n }\n\n return addr + suffix;\n };\n\n // Returns the address in compact, human-readable format like\n // 2001:db8:8:66::1\n // in line with RFC 5952 (see https://tools.ietf.org/html/rfc5952#section-4)\n IPv6.prototype.toRFC5952String = function () {\n const regex = /((^|:)(0(:|$)){2,})/g;\n const string = this.toNormalizedString();\n let bestMatchIndex = 0;\n let bestMatchLength = -1;\n let match;\n\n while ((match = regex.exec(string))) {\n if (match[0].length > bestMatchLength) {\n bestMatchIndex = match.index;\n bestMatchLength = match[0].length;\n }\n }\n\n if (bestMatchLength < 0) {\n return string;\n }\n\n return `${string.substring(0, bestMatchIndex)}::${string.substring(bestMatchIndex + bestMatchLength)}`;\n };\n\n // Returns the address in compact, human-readable format like\n // 2001:db8:8:66::1\n // Calls toRFC5952String under the hood.\n IPv6.prototype.toString = function () {\n return this.toRFC5952String();\n };\n\n return IPv6;\n\n })();\n\n // A utility function to return broadcast address given the IPv6 interface and prefix length in CIDR notation\n ipaddr.IPv6.broadcastAddressFromCIDR = function (string) {\n try {\n const cidr = this.parseCIDR(string);\n const ipInterfaceOctets = cidr[0].toByteArray();\n const subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n const octets = [];\n let i = 0;\n while (i < 16) {\n // Broadcast address is bitwise OR between ip interface and inverted mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) | parseInt(subnetMaskOctets[i], 10) ^ 255);\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${e})`);\n }\n };\n\n // Checks if a given string is formatted like IPv6 address.\n ipaddr.IPv6.isIPv6 = function (string) {\n return this.parser(string) !== null;\n };\n\n // Checks to see if string is a valid IPv6 Address\n ipaddr.IPv6.isValid = function (string) {\n\n // Since IPv6.isValid is always called first, this shortcut\n // provides a substantial performance gain.\n if (typeof string === 'string' && string.indexOf(':') === -1) {\n return false;\n }\n\n try {\n const addr = this.parser(string);\n new this(addr.parts, addr.zoneId);\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // Checks if a given string is a valid IPv6 address in CIDR notation.\n ipaddr.IPv6.isValidCIDR = function (string) {\n\n // See note in IPv6.isValid\n if (typeof string === 'string' && string.indexOf(':') === -1) {\n return false;\n }\n\n try {\n this.parseCIDR(string);\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // A utility function to return network address given the IPv6 interface and prefix length in CIDR notation\n ipaddr.IPv6.networkAddressFromCIDR = function (string) {\n let cidr, i, ipInterfaceOctets, octets, subnetMaskOctets;\n\n try {\n cidr = this.parseCIDR(string);\n ipInterfaceOctets = cidr[0].toByteArray();\n subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n octets = [];\n i = 0;\n while (i < 16) {\n // Network address is bitwise AND between ip interface and mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) & parseInt(subnetMaskOctets[i], 10));\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${e})`);\n }\n };\n\n // Tries to parse and validate a string with IPv6 address.\n // Throws an error if it fails.\n ipaddr.IPv6.parse = function (string) {\n const addr = this.parser(string);\n\n if (addr.parts === null) {\n throw new Error('ipaddr: string is not formatted like an IPv6 Address');\n }\n\n return new this(addr.parts, addr.zoneId);\n };\n\n ipaddr.IPv6.parseCIDR = function (string) {\n let maskLength, match, parsed;\n\n if ((match = string.match(/^(.+)\\/(\\d+)$/))) {\n maskLength = parseInt(match[2]);\n if (maskLength >= 0 && maskLength <= 128) {\n parsed = [this.parse(match[1]), maskLength];\n Object.defineProperty(parsed, 'toString', {\n value: function () {\n return this.join('/');\n }\n });\n return parsed;\n }\n }\n\n throw new Error('ipaddr: string is not formatted like an IPv6 CIDR range');\n };\n\n // Parse an IPv6 address.\n ipaddr.IPv6.parser = function (string) {\n let addr, i, match, octet, octets, zoneId;\n\n if ((match = string.match(ipv6Regexes.deprecatedTransitional))) {\n return this.parser(`::ffff:${match[1]}`);\n }\n if (ipv6Regexes.native.test(string)) {\n return expandIPv6(string, 8);\n }\n if ((match = string.match(ipv6Regexes.transitional))) {\n zoneId = match[6] || '';\n addr = match[1]\n if (!match[1].endsWith('::')) {\n addr = addr.slice(0, -1)\n }\n addr = expandIPv6(addr + zoneId, 6);\n if (addr.parts) {\n octets = [\n parseInt(match[2]),\n parseInt(match[3]),\n parseInt(match[4]),\n parseInt(match[5])\n ];\n for (i = 0; i < octets.length; i++) {\n octet = octets[i];\n if (!((0 <= octet && octet <= 255))) {\n return null;\n }\n }\n\n addr.parts.push(octets[0] << 8 | octets[1]);\n addr.parts.push(octets[2] << 8 | octets[3]);\n return {\n parts: addr.parts,\n zoneId: addr.zoneId\n };\n }\n }\n\n return null;\n };\n\n // A utility function to return subnet mask in IPv6 format given the prefix length\n ipaddr.IPv6.subnetMaskFromPrefixLength = function (prefix) {\n prefix = parseInt(prefix);\n if (prefix < 0 || prefix > 128) {\n throw new Error('ipaddr: invalid IPv6 prefix length');\n }\n\n const octets = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n let j = 0;\n const filledOctetCount = Math.floor(prefix / 8);\n\n while (j < filledOctetCount) {\n octets[j] = 255;\n j++;\n }\n\n if (filledOctetCount < 16) {\n octets[filledOctetCount] = Math.pow(2, prefix % 8) - 1 << 8 - (prefix % 8);\n }\n\n return new this(octets);\n };\n\n // Try to parse an array in network order (MSB first) for IPv4 and IPv6\n ipaddr.fromByteArray = function (bytes) {\n const length = bytes.length;\n\n if (length === 4) {\n return new ipaddr.IPv4(bytes);\n } else if (length === 16) {\n return new ipaddr.IPv6(bytes);\n } else {\n throw new Error('ipaddr: the binary input is neither an IPv6 nor IPv4 address');\n }\n };\n\n // Checks if the address is valid IP address\n ipaddr.isValid = function (string) {\n return ipaddr.IPv6.isValid(string) || ipaddr.IPv4.isValid(string);\n };\n\n // Checks if the address is valid IP address in CIDR notation\n ipaddr.isValidCIDR = function (string) {\n return ipaddr.IPv6.isValidCIDR(string) || ipaddr.IPv4.isValidCIDR(string);\n };\n\n\n // Attempts to parse an IP Address, first through IPv6 then IPv4.\n // Throws an error if it could not be parsed.\n ipaddr.parse = function (string) {\n if (ipaddr.IPv6.isValid(string)) {\n return ipaddr.IPv6.parse(string);\n } else if (ipaddr.IPv4.isValid(string)) {\n return ipaddr.IPv4.parse(string);\n } else {\n throw new Error('ipaddr: the address has neither IPv6 nor IPv4 format');\n }\n };\n\n // Attempt to parse CIDR notation, first through IPv6 then IPv4.\n // Throws an error if it could not be parsed.\n ipaddr.parseCIDR = function (string) {\n try {\n return ipaddr.IPv6.parseCIDR(string);\n } catch (e) {\n try {\n return ipaddr.IPv4.parseCIDR(string);\n } catch (e2) {\n throw new Error('ipaddr: the address has neither IPv6 nor IPv4 CIDR format');\n }\n }\n };\n\n // Parse an address and return plain IPv4 address if it is an IPv4-mapped address\n ipaddr.process = function (string) {\n const addr = this.parse(string);\n\n if (addr.kind() === 'ipv6' && addr.isIPv4MappedAddress()) {\n return addr.toIPv4Address();\n } else {\n return addr;\n }\n };\n\n // An utility function to ease named range matching. See examples below.\n // rangeList can contain both IPv4 and IPv6 subnet entries and will not throw errors\n // on matching IPv4 addresses to IPv6 ranges or vice versa.\n ipaddr.subnetMatch = function (address, rangeList, defaultName) {\n let i, rangeName, rangeSubnets, subnet;\n\n if (defaultName === undefined || defaultName === null) {\n defaultName = 'unicast';\n }\n\n for (rangeName in rangeList) {\n if (Object.prototype.hasOwnProperty.call(rangeList, rangeName)) {\n rangeSubnets = rangeList[rangeName];\n // ECMA5 Array.isArray isn't available everywhere\n if (rangeSubnets[0] && !(rangeSubnets[0] instanceof Array)) {\n rangeSubnets = [rangeSubnets];\n }\n\n for (i = 0; i < rangeSubnets.length; i++) {\n subnet = rangeSubnets[i];\n if (address.kind() === subnet[0].kind() && address.match.apply(address, subnet)) {\n return rangeName;\n }\n }\n }\n }\n\n return defaultName;\n };\n\n // Export for both the CommonJS and browser-like environment\n if (typeof module !== 'undefined' && module.exports) {\n module.exports = ipaddr;\n\n } else {\n root.ipaddr = ipaddr;\n }\n\n}(this));\n"],"names":["root","ipv4Part","ipv4Regexes","fourOctet","RegExp","threeOctet","twoOctet","longValue","octalRegex","hexRegex","zoneIndex","ipv6Part","ipv6Regexes","native","deprecatedTransitional","transitional","expandIPv6","string","parts","indexOf","lastIndexOf","replacement","replacementCount","colonCount","lastColon","zoneId","match","substring","replace","substr","slice","length","ref","split","results","i","push","parseInt","matchCIDR","first","second","partSize","cidrBits","Error","shift","part","parseIntAuto","test","isNaN","padPart","ipaddr","IPv4","octets","octet","this","prototype","SpecialRanges","unspecified","broadcast","multicast","linkLocal","loopback","carrierGradeNat","private","reserved","as112","amt","kind","other","cidrRange","undefined","prefixLengthFromSubnetMask","cidr","stop","zerotable","zeros","range","subnetMatch","toByteArray","toIPv4MappedAddress","IPv6","parse","toString","toNormalizedString","join","broadcastAddressFromCIDR","parseCIDR","ipInterfaceOctets","subnetMaskOctets","subnetMaskFromPrefixLength","e","isIPv4","parser","isValid","isValidCIDR","isValidFourPartDecimal","networkAddressFromCIDR","maskLength","parsed","Object","defineProperty","value","reverse","prefix","j","filledOctetCount","Math","floor","pow","uniqueLocal","ipv4Mapped","discard","rfc6145","rfc6052","teredo","benchmarking","as112v6","deprecated","orchid2","droneRemoteIdProtocolEntityTags","isIPv4MappedAddress","bytes","toFixedLengthString","addr","call","suffix","toIPv4Address","high","low","toRFC5952String","regex","bestMatchIndex","bestMatchLength","exec","index","isIPv6","endsWith","fromByteArray","e2","process","address","rangeList","defaultName","rangeName","rangeSubnets","subnet","hasOwnProperty","Array","apply","module","exports"],"mappings":"0IAAC,SAAUA,GAKP,MAAMC,EAAW,uBACXC,EAAc,CAChBC,UAAW,IAAIC,OAAO,IAAIH,OAAcA,OAAcA,OAAcA,KAAa,KACjFI,WAAY,IAAID,OAAO,IAAIH,OAAcA,OAAcA,KAAa,KACpEK,SAAU,IAAIF,OAAO,IAAIH,OAAcA,KAAa,KACpDM,UAAW,IAAIH,OAAO,IAAIH,KAAa,MAIrCO,EAAa,IAAIJ,OAAO,YAAa,KACrCK,EAAW,IAAIL,OAAO,gBAAiB,KAEvCM,EAAY,gBAMZC,EAAW,oBACXC,EAAc,CAChBF,UAAW,IAAIN,OAAOM,EAAW,KACjCG,OAAU,IAAIT,OAAO,UAAUO,wBAA+BD,OAAgB,KAC9EI,uBAAwB,IAAIV,OAAO,WAAWH,OAAcA,OAAcA,OAAcA,KAAYS,QAAiB,KACrHK,aAAc,IAAIX,OAAO,QAAQO,eAAsBA,OAAcV,OAAcA,OAAcA,OAAcA,KAAYS,OAAgB,MAI/I,SAASM,EAAYC,EAAQC,GAEzB,GAAID,EAAOE,QAAQ,QAAUF,EAAOG,YAAY,MAC5C,OAAO,KAGX,IAGIC,EAAaC,EAHbC,EAAa,EACbC,GAAc,EACdC,GAAUR,EAAOS,MAAMd,EAAYF,YAAc,IAAI,GAUzD,IANIe,IACAA,EAASA,EAAOE,UAAU,GAC1BV,EAASA,EAAOW,QAAQ,OAAQ,MAI5BJ,EAAYP,EAAOE,QAAQ,IAAKK,EAAY,KAAO,GACvDD,IAaJ,GAT4B,OAAxBN,EAAOY,OAAO,EAAG,IACjBN,IAGyB,OAAzBN,EAAOY,QAAS,EAAE,IAClBN,IAIAA,EAAaL,EACb,OAAO,KAMX,IAFAI,EAAmBJ,EAAQK,EAC3BF,EAAc,IACPC,KACHD,GAAe,KA2BnB,MAnBkB,OAJlBJ,EAASA,EAAOW,QAAQ,KAAMP,IAInB,KACPJ,EAASA,EAAOa,MAAM,IAGQ,MAA9Bb,EAAOA,EAAOc,OAAS,KACvBd,EAASA,EAAOa,MAAM,GAAG,IActB,CACHZ,MAZJA,EAAS,WACL,MAAMc,EAAMf,EAAOgB,MAAM,KACnBC,EAAU,GAEhB,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAID,OAAQI,IAC5BD,EAAQE,KAAKC,SAASL,EAAIG,GAAI,KAGlC,OAAOD,CACnB,CATiB,GAaLT,OAAQA,EAEpB,CAGI,SAASa,EAAWC,EAAOC,EAAQC,EAAUC,GACzC,GAAIH,EAAMR,SAAWS,EAAOT,OACxB,MAAM,IAAIY,MAAM,gEAGpB,IACIC,EADAC,EAAO,EAGX,KAAOH,EAAW,GAAG,CAMjB,GALAE,EAAQH,EAAWC,EACfE,EAAQ,IACRA,EAAQ,GAGRL,EAAMM,IAASD,IAAUJ,EAAOK,IAASD,EACzC,OAAO,EAGXF,GAAYD,EACZI,GAAQ,CACpB,CAEQ,OAAO,CACf,CAEI,SAASC,EAAc7B,GAEnB,GAAIR,EAASsC,KAAK9B,GACd,OAAOoB,SAASpB,EAAQ,IAK5B,GAAkB,MAAdA,EAAO,KAAe+B,MAAMX,SAASpB,EAAO,GAAI,KAAM,CAC1D,GAAIT,EAAWuC,KAAK9B,GAChB,OAAOoB,SAASpB,EAAQ,GAExB,MAAM,IAAI0B,MAAM,wBAAwB1B,aACpD,CAEQ,OAAOoB,SAASpB,EAAQ,GAChC,CAEI,SAASgC,EAASJ,EAAMd,GACpB,KAAOc,EAAKd,OAASA,GACjBc,EAAO,IAAIA,IAGf,OAAOA,CACf,CAEI,MAAMK,EAAS,CAAE,EAGjBA,EAAOC,KAAQ,WAIX,SAASA,EAAMC,GACX,GAAsB,IAAlBA,EAAOrB,OACP,MAAM,IAAIY,MAAM,wCAGpB,IAAIR,EAAGkB,EAEP,IAAKlB,EAAI,EAAGA,EAAIiB,EAAOrB,OAAQI,IAE3B,GADAkB,EAAQD,EAAOjB,KACR,GAAKkB,GAASA,GAAS,KAC1B,MAAM,IAAIV,MAAM,2CAIxBW,KAAKF,OAASA,CAC1B,CAkIQ,OA9HAD,EAAKI,UAAUC,cAAgB,CAC3BC,YAAa,CAAC,CAAC,IAAIN,EAAK,CAAC,EAAG,EAAG,EAAG,IAAK,IACvCO,UAAW,CAAC,CAAC,IAAIP,EAAK,CAAC,IAAK,IAAK,IAAK,MAAO,KAE7CQ,UAAW,CAAC,CAAC,IAAIR,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAEvCS,UAAW,CAAC,CAAC,IAAIT,EAAK,CAAC,IAAK,IAAK,EAAG,IAAK,KAEzCU,SAAU,CAAC,CAAC,IAAIV,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAEtCW,gBAAiB,CAAC,CAAC,IAAIX,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,KAE9CY,QAAW,CACP,CAAC,IAAIZ,EAAK,CAAC,GAAI,EAAG,EAAG,IAAK,GAC1B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,IAC5B,CAAC,IAAIA,EAAK,CAAC,IAAK,IAAK,EAAG,IAAK,KAGjCa,SAAU,CACN,CAAC,IAAIb,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAC3B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAC3B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,GAAI,IAAK,IAC7B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,IAC5B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,IAAK,IAAK,IAC9B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,IAAK,IAAK,IAC7B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAG/Bc,MAAO,CACH,CAAC,IAAId,EAAK,CAAC,IAAK,IAAK,GAAI,IAAK,IAC9B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,IAAK,IAAK,KAGlCe,IAAK,CACD,CAAC,IAAIf,EAAK,CAAC,IAAK,GAAI,IAAK,IAAK,MAKtCA,EAAKI,UAAUY,KAAO,WAClB,MAAO,MACV,EAGDhB,EAAKI,UAAU7B,MAAQ,SAAU0C,EAAOC,GACpC,IAAIrC,EAOJ,QANkBsC,IAAdD,IACArC,EAAMoC,EACNA,EAAQpC,EAAI,GACZqC,EAAYrC,EAAI,IAGC,SAAjBoC,EAAMD,OACN,MAAM,IAAIxB,MAAM,uDAGpB,OAAOL,EAAUgB,KAAKF,OAAQgB,EAAMhB,OAAQ,EAAGiB,EAClD,EAKDlB,EAAKI,UAAUgB,2BAA6B,WACxC,IAAIC,EAAO,EAEPC,GAAO,EAEX,MAAMC,EAAY,CACd,EAAG,EACH,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,GAET,IAAIvC,EAAGkB,EAAOsB,EAEd,IAAKxC,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAExB,GADAkB,EAAQC,KAAKF,OAAOjB,KAChBkB,KAASqB,GAYT,OAAO,KAVP,GADAC,EAAQD,EAAUrB,GACdoB,GAAkB,IAAVE,EACR,OAAO,KAGG,IAAVA,IACAF,GAAO,GAGXD,GAAQG,CAI5B,CAEY,OAAO,GAAKH,CACf,EAGDrB,EAAKI,UAAUqB,MAAQ,WACnB,OAAO1B,EAAO2B,YAAYvB,KAAMA,KAAKE,cACxC,EAGDL,EAAKI,UAAUuB,YAAc,WACzB,OAAOxB,KAAKF,OAAOtB,MAAM,EAC5B,EAGDqB,EAAKI,UAAUwB,oBAAsB,WACjC,OAAO7B,EAAO8B,KAAKC,MAAM,UAAU3B,KAAK4B,aAC3C,EAGD/B,EAAKI,UAAU4B,mBAAqB,WAChC,OAAO7B,KAAK4B,UACf,EAGD/B,EAAKI,UAAU2B,SAAW,WACtB,OAAO5B,KAAKF,OAAOgC,KAAK,IAC3B,EAEMjC,CACf,CAtJmB,GAyJfD,EAAOC,KAAKkC,yBAA2B,SAAUpE,GAE7C,IACI,MAAMuD,EAAOlB,KAAKgC,UAAUrE,GACtBsE,EAAoBf,EAAK,GAAGM,cAC5BU,EAAmBlC,KAAKmC,2BAA2BjB,EAAK,IAAIM,cAC5D1B,EAAS,GACf,IAAIjB,EAAI,EACR,KAAOA,EAAI,GAEPiB,EAAOhB,KAAKC,SAASkD,EAAkBpD,GAAI,IAA0C,IAApCE,SAASmD,EAAiBrD,GAAI,KAC/EA,IAGJ,OAAO,IAAImB,KAAKF,EACnB,CAAC,MAAOsC,GACL,MAAM,IAAI/C,MAAM,qDAC5B,CACK,EAGDO,EAAOC,KAAKwC,OAAS,SAAU1E,GAC3B,OAA+B,OAAxBqC,KAAKsC,OAAO3E,EACtB,EAGDiC,EAAOC,KAAK0C,QAAU,SAAU5E,GAC5B,IAEI,OADA,IAAIqC,KAAKA,KAAKsC,OAAO3E,KACd,CACV,CAAC,MAAOyE,GACL,OAAO,CACnB,CACK,EAGDxC,EAAOC,KAAK2C,YAAc,SAAU7E,GAChC,IAEI,OADAqC,KAAKgC,UAAUrE,IACR,CACV,CAAC,MAAOyE,GACL,OAAO,CACnB,CACK,EAGDxC,EAAOC,KAAK4C,uBAAyB,SAAU9E,GAC3C,SAAIiC,EAAOC,KAAK0C,QAAQ5E,KAAWA,EAAOS,MAAM,qCAKnD,EAGDwB,EAAOC,KAAK6C,uBAAyB,SAAU/E,GAC3C,IAAIuD,EAAMrC,EAAGoD,EAAmBnC,EAAQoC,EAExC,IAMI,IALAhB,EAAOlB,KAAKgC,UAAUrE,GACtBsE,EAAoBf,EAAK,GAAGM,cAC5BU,EAAmBlC,KAAKmC,2BAA2BjB,EAAK,IAAIM,cAC5D1B,EAAS,GACTjB,EAAI,EACGA,EAAI,GAEPiB,EAAOhB,KAAKC,SAASkD,EAAkBpD,GAAI,IAAME,SAASmD,EAAiBrD,GAAI,KAC/EA,IAGJ,OAAO,IAAImB,KAAKF,EACnB,CAAC,MAAOsC,GACL,MAAM,IAAI/C,MAAM,qDAC5B,CACK,EAIDO,EAAOC,KAAK8B,MAAQ,SAAUhE,GAC1B,MAAMC,EAAQoC,KAAKsC,OAAO3E,GAE1B,GAAc,OAAVC,EACA,MAAM,IAAIyB,MAAM,wDAGpB,OAAO,IAAIW,KAAKpC,EACnB,EAGDgC,EAAOC,KAAKmC,UAAY,SAAUrE,GAC9B,IAAIS,EAEJ,GAAKA,EAAQT,EAAOS,MAAM,iBAAmB,CACzC,MAAMuE,EAAa5D,SAASX,EAAM,IAClC,GAAIuE,GAAc,GAAKA,GAAc,GAAI,CACrC,MAAMC,EAAS,CAAC5C,KAAK2B,MAAMvD,EAAM,IAAKuE,GAMtC,OALAE,OAAOC,eAAeF,EAAQ,WAAY,CACtCG,MAAO,WACH,OAAO/C,KAAK8B,KAAK,IACzC,IAEuBc,CACvB,CACA,CAEQ,MAAM,IAAIvD,MAAM,0DACnB,EAKDO,EAAOC,KAAKyC,OAAS,SAAU3E,GAC3B,IAAIS,EAAOmB,EAAMwD,EAGjB,GAAK3E,EAAQT,EAAOS,MAAMxB,EAAYC,WAClC,OAAQ,WACJ,MAAM6B,EAAMN,EAAMI,MAAM,EAAG,GACrBI,EAAU,GAEhB,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAID,OAAQI,IAC5BU,EAAOb,EAAIG,GACXD,EAAQE,KAAKU,EAAaD,IAG9B,OAAOX,CACvB,CAVoB,GAWL,GAAKR,EAAQT,EAAOS,MAAMxB,EAAYK,WAAa,CAEtD,GADA8F,EAAQvD,EAAapB,EAAM,IACvB2E,EAAQ,YAAcA,EAAQ,EAC9B,MAAM,IAAI1D,MAAM,yCAGpB,OAAS,WACL,MAAMT,EAAU,GAChB,IAAIU,EAEJ,IAAKA,EAAQ,EAAGA,GAAS,GAAIA,GAAS,EAClCV,EAAQE,KAAMiE,GAASzD,EAAS,KAGpC,OAAOV,CACV,CATQ,GASHoE,SAClB,CAAe,OAAK5E,EAAQT,EAAOS,MAAMxB,EAAYI,WACjC,WACJ,MAAM0B,EAAMN,EAAMI,MAAM,EAAG,GACrBI,EAAU,GAGhB,GADAmE,EAAQvD,EAAad,EAAI,IACrBqE,EAAQ,UAAYA,EAAQ,EAC5B,MAAM,IAAI1D,MAAM,yCAQpB,OALAT,EAAQE,KAAKU,EAAad,EAAI,KAC9BE,EAAQE,KAAMiE,GAAS,GAAM,KAC7BnE,EAAQE,KAAMiE,GAAU,EAAK,KAC7BnE,EAAQE,KAAqB,IAAfiE,GAEPnE,CACvB,CAfoB,IAgBAR,EAAQT,EAAOS,MAAMxB,EAAYG,aACjC,WACJ,MAAM2B,EAAMN,EAAMI,MAAM,EAAG,GACrBI,EAAU,GAGhB,GADAmE,EAAQvD,EAAad,EAAI,IACrBqE,EAAQ,OAAUA,EAAQ,EAC1B,MAAM,IAAI1D,MAAM,yCAQpB,OALAT,EAAQE,KAAKU,EAAad,EAAI,KAC9BE,EAAQE,KAAKU,EAAad,EAAI,KAC9BE,EAAQE,KAAMiE,GAAS,EAAK,KAC5BnE,EAAQE,KAAoB,IAAdiE,GAEPnE,CACvB,CAfoB,GAiBD,IAEd,EAGDgB,EAAOC,KAAKsC,2BAA6B,SAAUc,GAE/C,IADAA,EAASlE,SAASkE,IACL,GAAKA,EAAS,GACvB,MAAM,IAAI5D,MAAM,sCAGpB,MAAMS,EAAS,CAAC,EAAG,EAAG,EAAG,GACzB,IAAIoD,EAAI,EACR,MAAMC,EAAmBC,KAAKC,MAAMJ,EAAS,GAE7C,KAAOC,EAAIC,GACPrD,EAAOoD,GAAK,IACZA,IAOJ,OAJIC,EAAmB,IACnBrD,EAAOqD,GAAoBC,KAAKE,IAAI,EAAGL,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAIjD,KAAKF,EACnB,EAGDF,EAAO8B,KAAQ,WAIX,SAASA,EAAM9D,EAAOO,GAClB,IAAIU,EAAGU,EAEP,GAAqB,KAAjB3B,EAAMa,OAEN,IADAuB,KAAKpC,MAAQ,GACRiB,EAAI,EAAGA,GAAK,GAAIA,GAAK,EACtBmB,KAAKpC,MAAMkB,KAAMlB,EAAMiB,IAAM,EAAKjB,EAAMiB,EAAI,QAE7C,IAAqB,IAAjBjB,EAAMa,OAGb,MAAM,IAAIY,MAAM,6CAFhBW,KAAKpC,MAAQA,CAG7B,CAEY,IAAKiB,EAAI,EAAGA,EAAImB,KAAKpC,MAAMa,OAAQI,IAE/B,GADAU,EAAOS,KAAKpC,MAAMiB,KACX,GAAKU,GAAQA,GAAQ,OACxB,MAAM,IAAIF,MAAM,2CAIpBlB,IACA6B,KAAK7B,OAASA,EAE9B,CAmOQ,OAhOAuD,EAAKzB,UAAUC,cAAgB,CAE3BC,YAAa,CAAC,IAAIuB,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KAClDpB,UAAW,CAAC,IAAIoB,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACrDrB,UAAW,CAAC,IAAIqB,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GACrDnB,SAAU,CAAC,IAAImB,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KAC/C6B,YAAa,CAAC,IAAI7B,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GACvD8B,WAAY,CAAC,IAAI9B,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,IAAK,IAEtD+B,QAAS,CAAC,IAAI/B,EAAK,CAAC,IAAO,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElDgC,QAAS,CAAC,IAAIhC,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,EAAG,IAAK,IAEnDiC,QAAS,CAAC,IAAIjC,EAAK,CAAC,IAAM,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAEtD,OAAQ,CAAC,IAAIA,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElDkC,OAAQ,CAAC,IAAIlC,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElDmC,aAAc,CAAC,IAAInC,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAE1Dd,IAAK,CAAC,IAAIc,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACjDoC,QAAS,CACL,CAAC,IAAIpC,EAAK,CAAC,KAAQ,EAAK,IAAO,EAAG,EAAG,EAAG,EAAG,IAAK,IAChD,CAAC,IAAIA,EAAK,CAAC,KAAQ,GAAM,MAAQ,EAAG,EAAG,EAAG,EAAG,IAAK,KAEtDqC,WAAY,CAAC,IAAIrC,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACzDsC,QAAS,CAAC,IAAItC,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACtDuC,gCAAiC,CAAC,IAAIvC,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAC9EhB,SAAU,CAEN,CAAC,IAAIgB,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAE1C,CAAC,IAAIA,EAAK,CAAC,KAAQ,KAAO,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,MAKtDA,EAAKzB,UAAUiE,oBAAsB,WACjC,MAAwB,eAAjBlE,KAAKsB,OACf,EAGDI,EAAKzB,UAAUY,KAAO,WAClB,MAAO,MACV,EAGDa,EAAKzB,UAAU7B,MAAQ,SAAU0C,EAAOC,GACpC,IAAIrC,EAQJ,QANkBsC,IAAdD,IACArC,EAAMoC,EACNA,EAAQpC,EAAI,GACZqC,EAAYrC,EAAI,IAGC,SAAjBoC,EAAMD,OACN,MAAM,IAAIxB,MAAM,uDAGpB,OAAOL,EAAUgB,KAAKpC,MAAOkD,EAAMlD,MAAO,GAAImD,EACjD,EAKDW,EAAKzB,UAAUgB,2BAA6B,WACxC,IAAIC,EAAO,EAEPC,GAAO,EAEX,MAAMC,EAAY,CACd,EAAG,GACH,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,GAEX,IAAI7B,EAAM8B,EAEV,IAAK,IAAIxC,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAE5B,GADAU,EAAOS,KAAKpC,MAAMiB,KACdU,KAAQ6B,GAYR,OAAO,KAVP,GADAC,EAAQD,EAAU7B,GACd4B,GAAkB,IAAVE,EACR,OAAO,KAGG,KAAVA,IACAF,GAAO,GAGXD,GAAQG,CAI5B,CAEY,OAAO,IAAMH,CAChB,EAIDQ,EAAKzB,UAAUqB,MAAQ,WACnB,OAAO1B,EAAO2B,YAAYvB,KAAMA,KAAKE,cACxC,EAGDwB,EAAKzB,UAAUuB,YAAc,WACzB,IAAIjC,EACJ,MAAM4E,EAAQ,GACRzF,EAAMsB,KAAKpC,MACjB,IAAK,IAAIiB,EAAI,EAAGA,EAAIH,EAAID,OAAQI,IAC5BU,EAAOb,EAAIG,GACXsF,EAAMrF,KAAKS,GAAQ,GACnB4E,EAAMrF,KAAY,IAAPS,GAGf,OAAO4E,CACV,EAIDzC,EAAKzB,UAAUmE,oBAAsB,WACjC,MAAMC,EAAS,WACX,MAAMzF,EAAU,GAChB,IAAK,IAAIC,EAAI,EAAGA,EAAImB,KAAKpC,MAAMa,OAAQI,IACnCD,EAAQE,KAAKa,EAAQK,KAAKpC,MAAMiB,GAAG+C,SAAS,IAAK,IAGrD,OAAOhD,CACV,EAAE0F,KAAKtE,MAAO8B,KAAK,KAEpB,IAAIyC,EAAS,GAMb,OAJIvE,KAAK7B,SACLoG,EAAS,IAAIvE,KAAK7B,UAGfkG,EAAOE,CACjB,EAID7C,EAAKzB,UAAUuE,cAAgB,WAC3B,IAAKxE,KAAKkE,sBACN,MAAM,IAAI7E,MAAM,4DAGpB,MAAMX,EAAMsB,KAAKpC,MAAMY,OAAM,GACvBiG,EAAO/F,EAAI,GACXgG,EAAMhG,EAAI,GAEhB,OAAO,IAAIkB,EAAOC,KAAK,CAAC4E,GAAQ,EAAU,IAAPA,EAAaC,GAAO,EAAS,IAANA,GAC7D,EAMDhD,EAAKzB,UAAU4B,mBAAqB,WAChC,MAAMwC,EAAS,WACX,MAAMzF,EAAU,GAEhB,IAAK,IAAIC,EAAI,EAAGA,EAAImB,KAAKpC,MAAMa,OAAQI,IACnCD,EAAQE,KAAKkB,KAAKpC,MAAMiB,GAAG+C,SAAS,KAGxC,OAAOhD,CACV,EAAE0F,KAAKtE,MAAO8B,KAAK,KAEpB,IAAIyC,EAAS,GAMb,OAJIvE,KAAK7B,SACLoG,EAAS,IAAIvE,KAAK7B,UAGfkG,EAAOE,CACjB,EAKD7C,EAAKzB,UAAU0E,gBAAkB,WAC7B,MAAMC,EAAQ,uBACRjH,EAASqC,KAAK6B,qBACpB,IAEIzD,EAFAyG,EAAiB,EACjBC,GAAoB,EAGxB,KAAQ1G,EAAQwG,EAAMG,KAAKpH,IACnBS,EAAM,GAAGK,OAASqG,IAClBD,EAAiBzG,EAAM4G,MACvBF,EAAkB1G,EAAM,GAAGK,QAInC,OAAIqG,EAAkB,EACXnH,EAGJ,GAAGA,EAAOU,UAAU,EAAGwG,OAAoBlH,EAAOU,UAAUwG,EAAiBC,IACvF,EAKDpD,EAAKzB,UAAU2B,SAAW,WACtB,OAAO5B,KAAK2E,iBACf,EAEMjD,CAEf,CAjQmB,GAoQf9B,EAAO8B,KAAKK,yBAA2B,SAAUpE,GAC7C,IACI,MAAMuD,EAAOlB,KAAKgC,UAAUrE,GACtBsE,EAAoBf,EAAK,GAAGM,cAC5BU,EAAmBlC,KAAKmC,2BAA2BjB,EAAK,IAAIM,cAC5D1B,EAAS,GACf,IAAIjB,EAAI,EACR,KAAOA,EAAI,IAEPiB,EAAOhB,KAAKC,SAASkD,EAAkBpD,GAAI,IAA0C,IAApCE,SAASmD,EAAiBrD,GAAI,KAC/EA,IAGJ,OAAO,IAAImB,KAAKF,EACnB,CAAC,MAAOsC,GACL,MAAM,IAAI/C,MAAM,uDAAuD+C,KACnF,CACK,EAGDxC,EAAO8B,KAAKuD,OAAS,SAAUtH,GAC3B,OAA+B,OAAxBqC,KAAKsC,OAAO3E,EACtB,EAGDiC,EAAO8B,KAAKa,QAAU,SAAU5E,GAI5B,GAAsB,iBAAXA,QAAuBA,EAAOE,QAAQ,KAC7C,OAAO,EAGX,IACI,MAAMwG,EAAOrE,KAAKsC,OAAO3E,GAEzB,OADA,IAAIqC,KAAKqE,EAAKzG,MAAOyG,EAAKlG,SACnB,CACV,CAAC,MAAOiE,GACL,OAAO,CACnB,CACK,EAGDxC,EAAO8B,KAAKc,YAAc,SAAU7E,GAGhC,GAAsB,iBAAXA,QAAuBA,EAAOE,QAAQ,KAC7C,OAAO,EAGX,IAEI,OADAmC,KAAKgC,UAAUrE,IACR,CACV,CAAC,MAAOyE,GACL,OAAO,CACnB,CACK,EAGDxC,EAAO8B,KAAKgB,uBAAyB,SAAU/E,GAC3C,IAAIuD,EAAMrC,EAAGoD,EAAmBnC,EAAQoC,EAExC,IAMI,IALAhB,EAAOlB,KAAKgC,UAAUrE,GACtBsE,EAAoBf,EAAK,GAAGM,cAC5BU,EAAmBlC,KAAKmC,2BAA2BjB,EAAK,IAAIM,cAC5D1B,EAAS,GACTjB,EAAI,EACGA,EAAI,IAEPiB,EAAOhB,KAAKC,SAASkD,EAAkBpD,GAAI,IAAME,SAASmD,EAAiBrD,GAAI,KAC/EA,IAGJ,OAAO,IAAImB,KAAKF,EACnB,CAAC,MAAOsC,GACL,MAAM,IAAI/C,MAAM,uDAAuD+C,KACnF,CACK,EAIDxC,EAAO8B,KAAKC,MAAQ,SAAUhE,GAC1B,MAAM0G,EAAOrE,KAAKsC,OAAO3E,GAEzB,GAAmB,OAAf0G,EAAKzG,MACL,MAAM,IAAIyB,MAAM,wDAGpB,OAAO,IAAIW,KAAKqE,EAAKzG,MAAOyG,EAAKlG,OACpC,EAEDyB,EAAO8B,KAAKM,UAAY,SAAUrE,GAC9B,IAAIgF,EAAYvE,EAAOwE,EAEvB,IAAKxE,EAAQT,EAAOS,MAAM,oBACtBuE,EAAa5D,SAASX,EAAM,IACxBuE,GAAc,GAAKA,GAAc,KAOjC,OANAC,EAAS,CAAC5C,KAAK2B,MAAMvD,EAAM,IAAKuE,GAChCE,OAAOC,eAAeF,EAAQ,WAAY,CACtCG,MAAO,WACH,OAAO/C,KAAK8B,KAAK,IACzC,IAEuBc,EAIf,MAAM,IAAIvD,MAAM,0DACnB,EAGDO,EAAO8B,KAAKY,OAAS,SAAU3E,GAC3B,IAAI0G,EAAMxF,EAAGT,EAAO2B,EAAOD,EAAQ3B,EAEnC,GAAKC,EAAQT,EAAOS,MAAMd,EAAYE,wBAClC,OAAOwC,KAAKsC,OAAO,UAAUlE,EAAM,MAEvC,GAAId,EAAYC,OAAOkC,KAAK9B,GACxB,OAAOD,EAAWC,EAAQ,GAE9B,IAAKS,EAAQT,EAAOS,MAAMd,EAAYG,iBAClCU,EAASC,EAAM,IAAM,GACrBiG,EAAOjG,EAAM,GACRA,EAAM,GAAG8G,SAAS,QACnBb,EAAOA,EAAK7F,MAAM,GAAG,IAEzB6F,EAAO3G,EAAW2G,EAAOlG,EAAQ,GAC7BkG,EAAKzG,OAAO,CAOZ,IANAkC,EAAS,CACLf,SAASX,EAAM,IACfW,SAASX,EAAM,IACfW,SAASX,EAAM,IACfW,SAASX,EAAM,KAEdS,EAAI,EAAGA,EAAIiB,EAAOrB,OAAQI,IAE3B,GADAkB,EAAQD,EAAOjB,KACR,GAAKkB,GAASA,GAAS,KAC1B,OAAO,KAMf,OAFAsE,EAAKzG,MAAMkB,KAAKgB,EAAO,IAAM,EAAIA,EAAO,IACxCuE,EAAKzG,MAAMkB,KAAKgB,EAAO,IAAM,EAAIA,EAAO,IACjC,CACHlC,MAAOyG,EAAKzG,MACZO,OAAQkG,EAAKlG,OAEjC,CAGQ,OAAO,IACV,EAGDyB,EAAO8B,KAAKS,2BAA6B,SAAUc,GAE/C,IADAA,EAASlE,SAASkE,IACL,GAAKA,EAAS,IACvB,MAAM,IAAI5D,MAAM,sCAGpB,MAAMS,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC7D,IAAIoD,EAAI,EACR,MAAMC,EAAmBC,KAAKC,MAAMJ,EAAS,GAE7C,KAAOC,EAAIC,GACPrD,EAAOoD,GAAK,IACZA,IAOJ,OAJIC,EAAmB,KACnBrD,EAAOqD,GAAoBC,KAAKE,IAAI,EAAGL,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAIjD,KAAKF,EACnB,EAGDF,EAAOuF,cAAgB,SAAUhB,GAC7B,MAAM1F,EAAS0F,EAAM1F,OAErB,GAAe,IAAXA,EACA,OAAO,IAAImB,EAAOC,KAAKsE,GACpB,GAAe,KAAX1F,EACP,OAAO,IAAImB,EAAO8B,KAAKyC,GAEvB,MAAM,IAAI9E,MAAM,+DAEvB,EAGDO,EAAO2C,QAAU,SAAU5E,GACvB,OAAOiC,EAAO8B,KAAKa,QAAQ5E,IAAWiC,EAAOC,KAAK0C,QAAQ5E,EAC7D,EAGDiC,EAAO4C,YAAc,SAAU7E,GAC3B,OAAOiC,EAAO8B,KAAKc,YAAY7E,IAAWiC,EAAOC,KAAK2C,YAAY7E,EACrE,EAKDiC,EAAO+B,MAAQ,SAAUhE,GACrB,GAAIiC,EAAO8B,KAAKa,QAAQ5E,GACpB,OAAOiC,EAAO8B,KAAKC,MAAMhE,GACtB,GAAIiC,EAAOC,KAAK0C,QAAQ5E,GAC3B,OAAOiC,EAAOC,KAAK8B,MAAMhE,GAEzB,MAAM,IAAI0B,MAAM,uDAEvB,EAIDO,EAAOoC,UAAY,SAAUrE,GACzB,IACI,OAAOiC,EAAO8B,KAAKM,UAAUrE,EAChC,CAAC,MAAOyE,GACL,IACI,OAAOxC,EAAOC,KAAKmC,UAAUrE,EAChC,CAAC,MAAOyH,GACL,MAAM,IAAI/F,MAAM,4DAChC,CACA,CACK,EAGDO,EAAOyF,QAAU,SAAU1H,GACvB,MAAM0G,EAAOrE,KAAK2B,MAAMhE,GAExB,MAAoB,SAAhB0G,EAAKxD,QAAqBwD,EAAKH,sBACxBG,EAAKG,gBAELH,CAEd,EAKDzE,EAAO2B,YAAc,SAAU+D,EAASC,EAAWC,GAC/C,IAAI3G,EAAG4G,EAAWC,EAAcC,EAMhC,IAAKF,KAJDD,UACAA,EAAc,WAGAD,EACd,GAAI1C,OAAO5C,UAAU2F,eAAetB,KAAKiB,EAAWE,GAOhD,IANAC,EAAeH,EAAUE,IAErBC,EAAa,IAAQA,EAAa,aAAcG,QAChDH,EAAe,CAACA,IAGf7G,EAAI,EAAGA,EAAI6G,EAAajH,OAAQI,IAEjC,GADA8G,EAASD,EAAa7G,GAClByG,EAAQzE,SAAW8E,EAAO,GAAG9E,QAAUyE,EAAQlH,MAAM0H,MAAMR,EAASK,GACpE,OAAOF,EAMvB,OAAOD,CACV,EAGoCO,EAAOC,QACxCD,UAAiBnG,EAGjBlD,EAAKkD,OAASA,CAGrB,CA/hCA,CA+hCCI","x_google_ignoreList":[0]}

package/dist/esm/node_modules/js-base64/base64.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import"../buffer/index.mjs";import{commonjsGlobal as r}from"../../_virtual/_commonjsHelpers.mjs";import{__module as t}from"../../_virtual/base64.mjs";import{__exports as n}from"../../_virtual/index.mjs";var e,o,u,i,f,a,c,s,d,l,p,h,A,y,b,m,g,x,B,v,C,U,F,w,S,_,j,E,D,R,z,T,Z,I,O,P,L,V,k;"undefined"!=typeof self?self:"undefined"!=typeof window&&window,t.exports=(o=e="3.7.7",u="function"==typeof n.Buffer,i="function"==typeof TextDecoder?new TextDecoder:void 0,f="function"==typeof TextEncoder?new TextEncoder:void 0,a="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",c=Array.prototype.slice.call(a),k={},c.forEach((function(r,t){return k[r]=t})),s=k,d=/^(?:[A-Za-z\d+\/]{4})?(?:[A-Za-z\d+\/]{2}(?:==)?\|[A-Za-z\d+\/]{3}=?)?$/,l=String.fromCharCode.bind(String),p="function"==typeof Uint8Array.from?Uint8Array.from.bind(Uint8Array):function(r){return new Uint8Array(Array.prototype.slice.call(r,0))},h=function(r){return r.replace(/=/g,"").replace(/[+\/]/g,(function(r){return"+"==r?"-":"_"}))},A=function(r){return r.replace(/[^A-Za-z0-9\+\/]/g,"")},y=function(r){for(var t,n,e,o,u="",i=r.length%3,f=0;f<r.length;){if((n=r.charCodeAt(f++))>255\|\|(e=r.charCodeAt(f++))>255\|\|(o=r.charCodeAt(f++))>255)throw new TypeError("invalid character found");u+=c[(t=n<<16\|e<<8\|o)>>18&63]+c[t>>12&63]+c[t>>6&63]+c[63&t]}return i?u.slice(0,i-3)+"===".substring(i):u},b="function"==typeof btoa?function(r){return btoa(r)}:u?function(r){return n.Buffer.from(r,"binary").toString("base64")}:y,m=u?function(r){return n.Buffer.from(r).toString("base64")}:function(r){for(var t=4096,n=[],e=0,o=r.length;e<o;e+=t)n.push(l.apply(null,r.subarray(e,e+t)));return b(n.join(""))},g=function(r,t){return void 0===t&&(t=!1),t?h(m(r)):m(r)},x=function(r){if(r.length<2)return(t=r.charCodeAt(0))<128?r:t<2048?l(192\|t>>>6)+l(128\|63&t):l(224\|t>>>12&15)+l(128\|t>>>6&63)+l(128\|63&t);var t=65536+1024(r.charCodeAt(0)-55296)+(r.charCodeAt(1)-56320);return l(240\|t>>>18&7)+l(128\|t>>>12&63)+l(128\|t>>>6&63)+l(128\|63&t)},B=/[\uD800-\uDBFF][\uDC00-\uDFFFF]\|[^\x00-\x7F]/g,v=function(r){return r.replace(B,x)},C=u?function(r){return n.Buffer.from(r,"utf8").toString("base64")}:f?function(r){return m(f.encode(r))}:function(r){return b(v(r))},U=function(r,t){return void 0===t&&(t=!1),t?h(C(r)):C(r)},F=function(r){return U(r,!0)},w=/[\xC0-\xDF][\x80-\xBF]\|[\xE0-\xEF][\x80-\xBF]{2}\|[\xF0-\xF7][\x80-\xBF]{3}/g,S=function(r){switch(r.length){case 4:var t=((7&r.charCodeAt(0))<<18\|(63&r.charCodeAt(1))<<12\|(63&r.charCodeAt(2))<<6\|63&r.charCodeAt(3))-65536;return l((t>>>10)+55296)+l(56320+(1023&t));case 3:return l((15&r.charCodeAt(0))<<12\|(63&r.charCodeAt(1))<<6\|63&r.charCodeAt(2));default:return l((31&r.charCodeAt(0))<<6\|63&r.charCodeAt(1))}},_=function(r){return r.replace(w,S)},j=function(r){if(r=r.replace(/\s+/g,""),!d.test(r))throw new TypeError("malformed base64.");r+="==".slice(2-(3&r.length));for(var t,n,e,o="",u=0;u<r.length;)t=s[r.charAt(u++)]<<18\|s[r.charAt(u++)]<<12\|(n=s[r.charAt(u++)])<<6\|(e=s[r.charAt(u++)]),o+=64===n?l(t>>16&255):64===e?l(t>>16&255,t>>8&255):l(t>>16&255,t>>8&255,255&t);return o},E="function"==typeof atob?function(r){return atob(A(r))}:u?function(r){return n.Buffer.from(r,"base64").toString("binary")}:j,D=u?function(r){return p(n.Buffer.from(r,"base64"))}:function(r){return p(E(r).split("").map((function(r){return r.charCodeAt(0)})))},R=function(r){return D(T(r))},z=u?function(r){return n.Buffer.from(r,"base64").toString("utf8")}:i?function(r){return i.decode(D(r))}:function(r){return _(E(r))},T=function(r){return A(r.replace(/[-_]/g,(function(r){return"-"==r?"+":"/"})))},I=function(r){return{value:r,enumerable:!1,writable:!0,configurable:!0}},O=function(){var r=function(r,t){return Object.defineProperty(String.prototype,r,I(t))};r("fromBase64",(function(){return Z(this)})),r("toBase64",(function(r){return U(this,r)})),r("toBase64URI",(function(){return U(this,!0)})),r("toBase64URL",(function(){return U(this,!0)})),r("toUint8Array",(function(){return R(this)}))},P=function(){var r=function(r,t){return Object.defineProperty(Uint8Array.prototype,r,I(t))};r("toBase64",(function(r){return g(this,r)})),r("toBase64URI",(function(){return g(this,!0)})),r("toBase64URL",(function(){return g(this,!0)}))},L=function(){O(),P()},V={version:e,VERSION:o,atob:E,atobPolyfill:j,btoa:b,btoaPolyfill:y,fromBase64:Z=function(r){return z(T(r))},toBase64:U,encode:U,encodeURI:F,encodeURL:F,utob:v,btou:_,decode:Z,isValid:function(r){if("string"!=typeof r)return!1;var t=r.replace(/\s+/g,"").replace(/={0,2}$/,"");return!/[^\s0-9a-zA-Z\+/]/.test(t)\|\|!/[^\s0-9a-zA-Z\-_]/.test(t)},fromUint8Array:g,toUint8Array:R,extendString:O,extendUint8Array:P,extendBuiltins:L,Base64:{}},Object.keys(V).forEach((function(r){return V.Base64[r]=V[r]})),V);var H=t.exports;export{H as b};
2	- //# sourceMappingURL=base64.mjs.map

package/dist/esm/node_modules/js-base64/base64.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"base64.mjs","sources":["../../../../node_modules/js-base64/base64.js"],"sourcesContent":["//\n// THIS FILE IS AUTOMATICALLY GENERATED! DO NOT EDIT BY HAND!\n//\n;\n(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined'\n ? module.exports = factory()\n : typeof define === 'function' && define.amd\n ? define(factory) :\n // cf. https://github.com/dankogai/js-base64/issues/119\n (function () {\n // existing version for noConflict()\n var _Base64 = global.Base64;\n var gBase64 = factory();\n gBase64.noConflict = function () {\n global.Base64 = _Base64;\n return gBase64;\n };\n if (global.Meteor) { // Meteor.js\n Base64 = gBase64;\n }\n global.Base64 = gBase64;\n })();\n}((typeof self !== 'undefined' ? self\n : typeof window !== 'undefined' ? window\n : typeof global !== 'undefined' ? global\n : this), function () {\n 'use strict';\n /**\n * base64.ts\n *\n * Licensed under the BSD 3-Clause License.\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * References:\n * http://en.wikipedia.org/wiki/Base64\n *\n * @author Dan Kogai (https://github.com/dankogai)\n */\n var version = '3.7.7';\n /**\n * @deprecated use lowercase `version`.\n */\n var VERSION = version;\n var _hasBuffer = typeof Buffer === 'function';\n var _TD = typeof TextDecoder === 'function' ? new TextDecoder() : undefined;\n var _TE = typeof TextEncoder === 'function' ? new TextEncoder() : undefined;\n var b64ch = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';\n var b64chs = Array.prototype.slice.call(b64ch);\n var b64tab = (function (a) {\n var tab = {};\n a.forEach(function (c, i) { return tab[c] = i; });\n return tab;\n })(b64chs);\n var b64re = /^(?:[A-Za-z\\d+\\/]{4})*?(?:[A-Za-z\\d+\\/]{2}(?:==)?|[A-Za-z\\d+\\/]{3}=?)?$/;\n var _fromCC = String.fromCharCode.bind(String);\n var _U8Afrom = typeof Uint8Array.from === 'function'\n ? Uint8Array.from.bind(Uint8Array)\n : function (it) { return new Uint8Array(Array.prototype.slice.call(it, 0)); };\n var _mkUriSafe = function (src) { return src\n .replace(/=/g, '').replace(/[+\\/]/g, function (m0) { return m0 == '+' ? '-' : '_'; }); };\n var _tidyB64 = function (s) { return s.replace(/[^A-Za-z0-9\\+\\/]/g, ''); };\n /**\n * polyfill version of `btoa`\n */\n var btoaPolyfill = function (bin) {\n // console.log('polyfilled');\n var u32, c0, c1, c2, asc = '';\n var pad = bin.length % 3;\n for (var i = 0; i < bin.length;) {\n if ((c0 = bin.charCodeAt(i++)) > 255 ||\n (c1 = bin.charCodeAt(i++)) > 255 ||\n (c2 = bin.charCodeAt(i++)) > 255)\n throw new TypeError('invalid character found');\n u32 = (c0 << 16) | (c1 << 8) | c2;\n asc += b64chs[u32 >> 18 & 63]\n + b64chs[u32 >> 12 & 63]\n + b64chs[u32 >> 6 & 63]\n + b64chs[u32 & 63];\n }\n return pad ? asc.slice(0, pad - 3) + \"===\".substring(pad) : asc;\n };\n /**\n * does what `window.btoa` of web browsers do.\n * @param {String} bin binary string\n * @returns {string} Base64-encoded string\n */\n var _btoa = typeof btoa === 'function' ? function (bin) { return btoa(bin); }\n : _hasBuffer ? function (bin) { return Buffer.from(bin, 'binary').toString('base64'); }\n : btoaPolyfill;\n var _fromUint8Array = _hasBuffer\n ? function (u8a) { return Buffer.from(u8a).toString('base64'); }\n : function (u8a) {\n // cf. https://stackoverflow.com/questions/12710001/how-to-convert-uint8-array-to-base64-encoded-string/12713326#12713326\n var maxargs = 0x1000;\n var strs = [];\n for (var i = 0, l = u8a.length; i < l; i += maxargs) {\n strs.push(_fromCC.apply(null, u8a.subarray(i, i + maxargs)));\n }\n return _btoa(strs.join(''));\n };\n /**\n * converts a Uint8Array to a Base64 string.\n * @param {boolean} [urlsafe] URL-and-filename-safe a la RFC4648 §5\n * @returns {string} Base64 string\n */\n var fromUint8Array = function (u8a, urlsafe) {\n if (urlsafe === void 0) { urlsafe = false; }\n return urlsafe ? _mkUriSafe(_fromUint8Array(u8a)) : _fromUint8Array(u8a);\n };\n // This trick is found broken https://github.com/dankogai/js-base64/issues/130\n // const utob = (src: string) => unescape(encodeURIComponent(src));\n // reverting good old fationed regexp\n var cb_utob = function (c) {\n if (c.length < 2) {\n var cc = c.charCodeAt(0);\n return cc < 0x80 ? c\n : cc < 0x800 ? (_fromCC(0xc0 | (cc >>> 6))\n + _fromCC(0x80 | (cc & 0x3f)))\n : (_fromCC(0xe0 | ((cc >>> 12) & 0x0f))\n + _fromCC(0x80 | ((cc >>> 6) & 0x3f))\n + _fromCC(0x80 | (cc & 0x3f)));\n }\n else {\n var cc = 0x10000\n + (c.charCodeAt(0) - 0xD800) * 0x400\n + (c.charCodeAt(1) - 0xDC00);\n return (_fromCC(0xf0 | ((cc >>> 18) & 0x07))\n + _fromCC(0x80 | ((cc >>> 12) & 0x3f))\n + _fromCC(0x80 | ((cc >>> 6) & 0x3f))\n + _fromCC(0x80 | (cc & 0x3f)));\n }\n };\n var re_utob = /[\\uD800-\\uDBFF][\\uDC00-\\uDFFFF]|[^\\x00-\\x7F]/g;\n /**\n * @deprecated should have been internal use only.\n * @param {string} src UTF-8 string\n * @returns {string} UTF-16 string\n */\n var utob = function (u) { return u.replace(re_utob, cb_utob); };\n //\n var _encode = _hasBuffer\n ? function (s) { return Buffer.from(s, 'utf8').toString('base64'); }\n : _TE\n ? function (s) { return _fromUint8Array(_TE.encode(s)); }\n : function (s) { return _btoa(utob(s)); };\n /**\n * converts a UTF-8-encoded string to a Base64 string.\n * @param {boolean} [urlsafe] if `true` make the result URL-safe\n * @returns {string} Base64 string\n */\n var encode = function (src, urlsafe) {\n if (urlsafe === void 0) { urlsafe = false; }\n return urlsafe\n ? _mkUriSafe(_encode(src))\n : _encode(src);\n };\n /**\n * converts a UTF-8-encoded string to URL-safe Base64 RFC4648 §5.\n * @returns {string} Base64 string\n */\n var encodeURI = function (src) { return encode(src, true); };\n // This trick is found broken https://github.com/dankogai/js-base64/issues/130\n // const btou = (src: string) => decodeURIComponent(escape(src));\n // reverting good old fationed regexp\n var re_btou = /[\\xC0-\\xDF][\\x80-\\xBF]|[\\xE0-\\xEF][\\x80-\\xBF]{2}|[\\xF0-\\xF7][\\x80-\\xBF]{3}/g;\n var cb_btou = function (cccc) {\n switch (cccc.length) {\n case 4:\n var cp = ((0x07 & cccc.charCodeAt(0)) << 18)\n | ((0x3f & cccc.charCodeAt(1)) << 12)\n | ((0x3f & cccc.charCodeAt(2)) << 6)\n | (0x3f & cccc.charCodeAt(3)), offset = cp - 0x10000;\n return (_fromCC((offset >>> 10) + 0xD800)\n + _fromCC((offset & 0x3FF) + 0xDC00));\n case 3:\n return _fromCC(((0x0f & cccc.charCodeAt(0)) << 12)\n | ((0x3f & cccc.charCodeAt(1)) << 6)\n | (0x3f & cccc.charCodeAt(2)));\n default:\n return _fromCC(((0x1f & cccc.charCodeAt(0)) << 6)\n | (0x3f & cccc.charCodeAt(1)));\n }\n };\n /**\n * @deprecated should have been internal use only.\n * @param {string} src UTF-16 string\n * @returns {string} UTF-8 string\n */\n var btou = function (b) { return b.replace(re_btou, cb_btou); };\n /**\n * polyfill version of `atob`\n */\n var atobPolyfill = function (asc) {\n // console.log('polyfilled');\n asc = asc.replace(/\\s+/g, '');\n if (!b64re.test(asc))\n throw new TypeError('malformed base64.');\n asc += '=='.slice(2 - (asc.length & 3));\n var u24, bin = '', r1, r2;\n for (var i = 0; i < asc.length;) {\n u24 = b64tab[asc.charAt(i++)] << 18\n | b64tab[asc.charAt(i++)] << 12\n | (r1 = b64tab[asc.charAt(i++)]) << 6\n | (r2 = b64tab[asc.charAt(i++)]);\n bin += r1 === 64 ? _fromCC(u24 >> 16 & 255)\n : r2 === 64 ? _fromCC(u24 >> 16 & 255, u24 >> 8 & 255)\n : _fromCC(u24 >> 16 & 255, u24 >> 8 & 255, u24 & 255);\n }\n return bin;\n };\n /**\n * does what `window.atob` of web browsers do.\n * @param {String} asc Base64-encoded string\n * @returns {string} binary string\n */\n var _atob = typeof atob === 'function' ? function (asc) { return atob(_tidyB64(asc)); }\n : _hasBuffer ? function (asc) { return Buffer.from(asc, 'base64').toString('binary'); }\n : atobPolyfill;\n //\n var _toUint8Array = _hasBuffer\n ? function (a) { return _U8Afrom(Buffer.from(a, 'base64')); }\n : function (a) { return _U8Afrom(_atob(a).split('').map(function (c) { return c.charCodeAt(0); })); };\n /**\n * converts a Base64 string to a Uint8Array.\n */\n var toUint8Array = function (a) { return _toUint8Array(_unURI(a)); };\n //\n var _decode = _hasBuffer\n ? function (a) { return Buffer.from(a, 'base64').toString('utf8'); }\n : _TD\n ? function (a) { return _TD.decode(_toUint8Array(a)); }\n : function (a) { return btou(_atob(a)); };\n var _unURI = function (a) { return _tidyB64(a.replace(/[-_]/g, function (m0) { return m0 == '-' ? '+' : '/'; })); };\n /**\n * converts a Base64 string to a UTF-8 string.\n * @param {String} src Base64 string. Both normal and URL-safe are supported\n * @returns {string} UTF-8 string\n */\n var decode = function (src) { return _decode(_unURI(src)); };\n /**\n * check if a value is a valid Base64 string\n * @param {String} src a value to check\n */\n var isValid = function (src) {\n if (typeof src !== 'string')\n return false;\n var s = src.replace(/\\s+/g, '').replace(/={0,2}$/, '');\n return !/[^\\s0-9a-zA-Z\\+/]/.test(s) || !/[^\\s0-9a-zA-Z\\-_]/.test(s);\n };\n //\n var _noEnum = function (v) {\n return {\n value: v, enumerable: false, writable: true, configurable: true\n };\n };\n /**\n * extend String.prototype with relevant methods\n */\n var extendString = function () {\n var _add = function (name, body) { return Object.defineProperty(String.prototype, name, _noEnum(body)); };\n _add('fromBase64', function () { return decode(this); });\n _add('toBase64', function (urlsafe) { return encode(this, urlsafe); });\n _add('toBase64URI', function () { return encode(this, true); });\n _add('toBase64URL', function () { return encode(this, true); });\n _add('toUint8Array', function () { return toUint8Array(this); });\n };\n /**\n * extend Uint8Array.prototype with relevant methods\n */\n var extendUint8Array = function () {\n var _add = function (name, body) { return Object.defineProperty(Uint8Array.prototype, name, _noEnum(body)); };\n _add('toBase64', function (urlsafe) { return fromUint8Array(this, urlsafe); });\n _add('toBase64URI', function () { return fromUint8Array(this, true); });\n _add('toBase64URL', function () { return fromUint8Array(this, true); });\n };\n /**\n * extend Builtin prototypes with relevant methods\n */\n var extendBuiltins = function () {\n extendString();\n extendUint8Array();\n };\n var gBase64 = {\n version: version,\n VERSION: VERSION,\n atob: _atob,\n atobPolyfill: atobPolyfill,\n btoa: _btoa,\n btoaPolyfill: btoaPolyfill,\n fromBase64: decode,\n toBase64: encode,\n encode: encode,\n encodeURI: encodeURI,\n encodeURL: encodeURI,\n utob: utob,\n btou: btou,\n decode: decode,\n isValid: isValid,\n fromUint8Array: fromUint8Array,\n toUint8Array: toUint8Array,\n extendString: extendString,\n extendUint8Array: extendUint8Array,\n extendBuiltins: extendBuiltins\n };\n //\n // export Base64 to the namespace\n //\n // ES5 is yet to have Object.assign() that may make transpilers unhappy.\n // gBase64.Base64 = Object.assign({}, gBase64);\n gBase64.Base64 = {};\n Object.keys(gBase64).forEach(function (k) { return gBase64.Base64[k] = gBase64[k]; });\n return gBase64;\n}));\n"],"names":["version","VERSION","_hasBuffer","_TD","_TE","b64ch","b64chs","b64tab","b64re","_fromCC","_U8Afrom","_mkUriSafe","_tidyB64","btoaPolyfill","_btoa","_fromUint8Array","fromUint8Array","cb_utob","re_utob","utob","_encode","encode","encodeURI","re_btou","cb_btou","btou","atobPolyfill","_atob","_toUint8Array","toUint8Array","_decode","_unURI","decode","_noEnum","extendString","extendUint8Array","extendBuiltins","gBase64","tab","self","window","Buffer","TextDecoder","undefined","TextEncoder","Array","prototype","slice","call","forEach","c","i","String","fromCharCode","bind","Uint8Array","from","it","src","replace","m0","s","bin","u32","c0","c1","c2","asc","pad","length","charCodeAt","TypeError","substring","btoa","toString","u8a","maxargs","strs","l","push","apply","subarray","join","urlsafe","cc","u","cccc","offset","b","test","u24","r1","r2","charAt","atob","a","split","map","v","value","enumerable","writable","configurable","_add","name","body","Object","defineProperty","this","fromBase64","toBase64","encodeURL","isValid","keys","k","Base64"],"mappings":"+MAuCQA,EAIAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKAC,EACAC,EACAC,EAGAC,EAEAC,EAIAC,EAsBAC,EAGAC,EAgBAC,EAOAC,EAoBAC,EAMAC,EAEAC,EAUAC,EAUAC,EAIAC,EACAC,EAuBAC,EAIAC,EAuBAC,EAIAC,EAMAC,EAEAC,EAKAC,EAMAC,EAYAC,EAQAC,EAWAC,EASAC,EAIAC,EAzOIC,EA3BO,oBAATC,KAAuBA,KACT,oBAAXC,QAAyBA,kBAmB9BvC,EAJAD,EAAU,QAKVE,EAA+B,mBAAXuC,EAAAA,OACpBtC,EAA6B,mBAAhBuC,YAA6B,IAAIA,iBAAgBC,EAC9DvC,EAA6B,mBAAhBwC,YAA6B,IAAIA,iBAAgBD,EAC9DtC,EAAQ,oEACRC,EAASuC,MAAMC,UAAUC,MAAMC,KAAK3C,GAEhCiC,EAAM,CAAE,EAGbhC,EAFG2C,SAAQ,SAAUC,EAAGC,GAAK,OAAOb,EAAIY,GAAKC,KAF5C5C,EAGO+B,EAEP9B,EAAQ,0EACRC,EAAU2C,OAAOC,aAAaC,KAAKF,QACnC1C,EAAsC,mBAApB6C,WAAWC,KAC3BD,WAAWC,KAAKF,KAAKC,YACrB,SAAUE,GAAM,OAAO,IAAIF,WAAWV,MAAMC,UAAUC,MAAMC,KAAKS,EAAI,GAAM,EAC7E9C,EAAa,SAAU+C,GAAO,OAAOA,EACpCC,QAAQ,KAAM,IAAIA,QAAQ,UAAU,SAAUC,GAAM,MAAa,KAANA,EAAY,IAAM,GAAI,GAAM,EACxFhD,EAAW,SAAUiD,GAAK,OAAOA,EAAEF,QAAQ,oBAAqB,GAAM,EAItE9C,EAAe,SAAUiD,GAIzB,IAFA,IAAIC,EAAKC,EAAIC,EAAIC,EAAIC,EAAM,GACvBC,EAAMN,EAAIO,OAAS,EACdlB,EAAI,EAAGA,EAAIW,EAAIO,QAAS,CAC7B,IAAKL,EAAKF,EAAIQ,WAAWnB,MAAQ,MAC5Bc,EAAKH,EAAIQ,WAAWnB,MAAQ,MAC5Be,EAAKJ,EAAIQ,WAAWnB,MAAQ,IAC7B,MAAM,IAAIoB,UAAU,2BAExBJ,GAAO7D,GADPyD,EAAOC,GAAM,GAAOC,GAAM,EAAKC,IACV,GAAK,IACpB5D,EAAOyD,GAAO,GAAK,IACnBzD,EAAOyD,GAAO,EAAI,IAClBzD,EAAa,GAANyD,EACzB,CACQ,OAAOK,EAAMD,EAAIpB,MAAM,EAAGqB,EAAM,GAAK,MAAMI,UAAUJ,GAAOD,CAC/D,EAMGrD,EAAwB,mBAAT2D,KAAsB,SAAUX,GAAO,OAAOW,KAAKX,EAAK,EACrE5D,EAAa,SAAU4D,GAAO,OAAOrB,EAAAA,OAAOe,KAAKM,EAAK,UAAUY,SAAS,SAAU,EAC/E7D,EACNE,EAAkBb,EAChB,SAAUyE,GAAO,OAAOlC,EAAMA,OAACe,KAAKmB,GAAKD,SAAS,SAAU,EAC5D,SAAUC,GAIR,IAFA,IAAIC,EAAU,KACVC,EAAO,GACF1B,EAAI,EAAG2B,EAAIH,EAAIN,OAAQlB,EAAI2B,EAAG3B,GAAKyB,EACxCC,EAAKE,KAAKtE,EAAQuE,MAAM,KAAML,EAAIM,SAAS9B,EAAGA,EAAIyB,KAEtD,OAAO9D,EAAM+D,EAAKK,KAAK,IAC1B,EAMDlE,EAAiB,SAAU2D,EAAKQ,GAEhC,YADgB,IAAZA,IAAsBA,GAAU,GAC7BA,EAAUxE,EAAWI,EAAgB4D,IAAQ5D,EAAgB4D,EACvE,EAIG1D,EAAU,SAAUiC,GACpB,GAAIA,EAAEmB,OAAS,EAEX,OADIe,EAAKlC,EAAEoB,WAAW,IACV,IAAOpB,EACbkC,EAAK,KAAS3E,EAAQ,IAAQ2E,IAAO,GACjC3E,EAAQ,IAAa,GAAL2E,GACf3E,EAAQ,IAAS2E,IAAO,GAAM,IAC3B3E,EAAQ,IAAS2E,IAAO,EAAK,IAC7B3E,EAAQ,IAAa,GAAL2E,GAG9B,IAAIA,EAAK,MAC0B,MAA5BlC,EAAEoB,WAAW,GAAK,QAClBpB,EAAEoB,WAAW,GAAK,OACzB,OAAQ7D,EAAQ,IAAS2E,IAAO,GAAM,GAChC3E,EAAQ,IAAS2E,IAAO,GAAM,IAC9B3E,EAAQ,IAAS2E,IAAO,EAAK,IAC7B3E,EAAQ,IAAa,GAAL2E,EAE7B,EACGlE,EAAU,gDAMVC,EAAO,SAAUkE,GAAK,OAAOA,EAAE1B,QAAQzC,EAASD,EAAW,EAE3DG,EAAUlB,EACR,SAAU2D,GAAK,OAAOpB,EAAAA,OAAOe,KAAKK,EAAG,QAAQa,SAAS,SAAU,EAChEtE,EACI,SAAUyD,GAAK,OAAO9C,EAAgBX,EAAIiB,OAAOwC,GAAI,EACrD,SAAUA,GAAK,OAAO/C,EAAMK,EAAK0C,GAAM,EAM7CxC,EAAS,SAAUqC,EAAKyB,GAExB,YADgB,IAAZA,IAAsBA,GAAU,GAC7BA,EACDxE,EAAWS,EAAQsC,IACnBtC,EAAQsC,EACjB,EAKGpC,EAAY,SAAUoC,GAAO,OAAOrC,EAAOqC,GAAK,EAAQ,EAIxDnC,EAAU,8EACVC,EAAU,SAAU8D,GACpB,OAAQA,EAAKjB,QACT,KAAK,EACD,IAGmCkB,IAHxB,EAAOD,EAAKhB,WAAW,KAAO,IACjC,GAAOgB,EAAKhB,WAAW,KAAO,IAC9B,GAAOgB,EAAKhB,WAAW,KAAO,EAC/B,GAAOgB,EAAKhB,WAAW,IAAmB,MACjD,OAAQ7D,GAAS8E,IAAW,IAAM,OAC5B9E,EAA2B,OAAT,KAAT8E,IACnB,KAAK,EACD,OAAO9E,GAAU,GAAO6E,EAAKhB,WAAW,KAAO,IACvC,GAAOgB,EAAKhB,WAAW,KAAO,EAC/B,GAAOgB,EAAKhB,WAAW,IAClC,QACI,OAAO7D,GAAU,GAAO6E,EAAKhB,WAAW,KAAO,EACxC,GAAOgB,EAAKhB,WAAW,IAEzC,EAMG7C,EAAO,SAAU+D,GAAK,OAAOA,EAAE7B,QAAQpC,EAASC,EAAW,EAI3DE,EAAe,SAAUyC,GAGzB,GADAA,EAAMA,EAAIR,QAAQ,OAAQ,KACrBnD,EAAMiF,KAAKtB,GACZ,MAAM,IAAII,UAAU,qBACxBJ,GAAO,KAAKpB,MAAM,GAAkB,EAAboB,EAAIE,SAE3B,IADA,IAAIqB,EAAeC,EAAIC,EAAd9B,EAAM,GACNX,EAAI,EAAGA,EAAIgB,EAAIE,QACpBqB,EAAMnF,EAAO4D,EAAI0B,OAAO1C,OAAS,GAC3B5C,EAAO4D,EAAI0B,OAAO1C,OAAS,IAC1BwC,EAAKpF,EAAO4D,EAAI0B,OAAO1C,QAAU,GACjCyC,EAAKrF,EAAO4D,EAAI0B,OAAO1C,OAC9BW,GAAc,KAAP6B,EAAYlF,EAAQiF,GAAO,GAAK,KAC1B,KAAPE,EAAYnF,EAAQiF,GAAO,GAAK,IAAKA,GAAO,EAAI,KAC5CjF,EAAQiF,GAAO,GAAK,IAAKA,GAAO,EAAI,IAAW,IAANA,GAEvD,OAAO5B,CACV,EAMGnC,EAAwB,mBAATmE,KAAsB,SAAU3B,GAAO,OAAO2B,KAAKlF,EAASuD,GAAM,EAC/EjE,EAAa,SAAUiE,GAAO,OAAO1B,EAAAA,OAAOe,KAAKW,EAAK,UAAUO,SAAS,SAAU,EAC/EhD,EAENE,EAAgB1B,EACd,SAAU6F,GAAK,OAAOrF,EAAS+B,EAAMA,OAACe,KAAKuC,EAAG,UAAW,EACzD,SAAUA,GAAK,OAAOrF,EAASiB,EAAMoE,GAAGC,MAAM,IAAIC,KAAI,SAAU/C,GAAK,OAAOA,EAAEoB,WAAW,EAAG,IAAO,EAIrGzC,EAAe,SAAUkE,GAAK,OAAOnE,EAAcG,EAAOgE,GAAM,EAEhEjE,EAAU5B,EACR,SAAU6F,GAAK,OAAOtD,EAAAA,OAAOe,KAAKuC,EAAG,UAAUrB,SAAS,OAAQ,EAChEvE,EACI,SAAU4F,GAAK,OAAO5F,EAAI6B,OAAOJ,EAAcmE,GAAI,EACnD,SAAUA,GAAK,OAAOtE,EAAKE,EAAMoE,GAAM,EAC7ChE,EAAS,SAAUgE,GAAK,OAAOnF,EAASmF,EAAEpC,QAAQ,SAAS,SAAUC,GAAM,MAAa,KAANA,EAAY,IAAM,GAAI,IAAO,EAkB/G3B,EAAU,SAAUiE,GACpB,MAAO,CACHC,MAAOD,EAAGE,YAAY,EAAOC,UAAU,EAAMC,cAAc,EAElE,EAIGpE,EAAe,WACf,IAAIqE,EAAO,SAAUC,EAAMC,GAAQ,OAAOC,OAAOC,eAAevD,OAAON,UAAW0D,EAAMvE,EAAQwE,GAAS,EACzGF,EAAK,cAAc,WAAc,OAAOvE,EAAO4E,SAC/CL,EAAK,YAAY,SAAUpB,GAAW,OAAO9D,EAAOuF,KAAMzB,MAC1DoB,EAAK,eAAe,WAAc,OAAOlF,EAAOuF,MAAM,MACtDL,EAAK,eAAe,WAAc,OAAOlF,EAAOuF,MAAM,MACtDL,EAAK,gBAAgB,WAAc,OAAO1E,EAAa+E,QAC1D,EAIGzE,EAAmB,WACnB,IAAIoE,EAAO,SAAUC,EAAMC,GAAQ,OAAOC,OAAOC,eAAepD,WAAWT,UAAW0D,EAAMvE,EAAQwE,GAAS,EAC7GF,EAAK,YAAY,SAAUpB,GAAW,OAAOnE,EAAe4F,KAAMzB,MAClEoB,EAAK,eAAe,WAAc,OAAOvF,EAAe4F,MAAM,MAC9DL,EAAK,eAAe,WAAc,OAAOvF,EAAe4F,MAAM,KACjE,EAIGxE,EAAiB,WACjBF,IACAC,GACH,EACGE,EAAU,CACVrC,QAASA,EACTC,QAASA,EACT6F,KAAMnE,EACND,aAAcA,EACd+C,KAAM3D,EACND,aAAcA,EACdgG,WAnDA7E,EAAS,SAAU0B,GAAO,OAAO5B,EAAQC,EAAO2B,GAAQ,EAoDxDoD,SAAUzF,EACVA,OAAQA,EACRC,UAAWA,EACXyF,UAAWzF,EACXH,KAAMA,EACNM,KAAMA,EACNO,OAAQA,EACRgF,QAtDU,SAAUtD,GACpB,GAAmB,iBAARA,EACP,OAAO,EACX,IAAIG,EAAIH,EAAIC,QAAQ,OAAQ,IAAIA,QAAQ,UAAW,IACnD,OAAQ,oBAAoB8B,KAAK5B,KAAO,oBAAoB4B,KAAK5B,EACpE,EAkDG7C,eAAgBA,EAChBa,aAAcA,EACdK,aAAcA,EACdC,iBAAkBA,EAClBC,eAAgBA,EAOpBC,OAAiB,CAAE,GACnBqE,OAAOO,KAAK5E,GAASY,SAAQ,SAAUiE,GAAK,OAAO7E,EAAQ8E,OAAOD,GAAK7E,EAAQ6E,EAAG,IAC3E7E","x_google_ignoreList":[0]}

package/dist/esm/node_modules/punycode/punycode.es6.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- const o=2147483647,t=36,n={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},e=Math.floor,r=String.fromCharCode;function s(o){throw new RangeError(n[o])}function c(o){const t=[];let n=0;const e=o.length;for(;n<e;){const r=o.charCodeAt(n++);if(r>=55296&&r<=56319&&n<e){const e=o.charCodeAt(n++);56320==(64512&e)?t.push(((1023&r)<<10)+(1023&e)+65536):(t.push(r),n--)}else t.push(r)}return t}const f=function(o,t){return o+22+75(o<26)-((0!=t)<<5)},i=function(o,n,r){let s=0;for(o=r?e(o/700):o>>1,o+=e(o/n);o>455;s+=t)o=e(o/35);return e(s+36o/(o+38))},l=function(n){const r=[],c=n.length;let f=0,l=128,u=72,a=n.lastIndexOf("-");a<0&&(a=0);for(let o=0;o<a;++o)n.charCodeAt(o)>=128&&s("not-basic"),r.push(n.charCodeAt(o));for(let p=a>0?a+1:0;p<c;){const a=f;for(let r=1,i=t;;i+=t){p>=c&&s("invalid-input");const l=(h=n.charCodeAt(p++))>=48&&h<58?h-48+26:h>=65&&h<91?h-65:h>=97&&h<123?h-97:t;l>=t&&s("invalid-input"),l>e((o-f)/r)&&s("overflow"),f+=lr;const a=i<=u?1:i>=u+26?26:i-u;if(l<a)break;const d=t-a;r>e(o/d)&&s("overflow"),r=d}const d=r.length+1;u=i(f-a,d,0==a),e(f/d)>o-l&&s("overflow"),l+=e(f/d),f%=d,r.splice(f++,0,l)}var h;return String.fromCodePoint(...r)},u=function(n){const l=[],u=(n=c(n)).length;let a=128,h=0,p=72;for(const o of n)o<128&&l.push(r(o));const d=l.length;let v=d;for(d&&l.push("-");v<u;){let c=o;for(const o of n)o>=a&&o<c&&(c=o);const u=v+1;c-a>e((o-h)/u)&&s("overflow"),h+=(c-a)*u,a=c;for(const c of n)if(c<a&&++h>o&&s("overflow"),c===a){let o=h;for(let n=t;;n+=t){const s=n<=p?1:n>=p+26?26:n-p;if(o<s)break;const c=o-s,i=t-s;l.push(r(f(s+c%i,0))),o=e(c/i)}l.push(r(f(o,0))),p=i(h,u,v===d),h=0,++v}++h,++a}return l.join("")};export{l as decode,u as encode,c as ucs2decode};
2	- //# sourceMappingURL=punycode.es6.mjs.map

package/dist/esm/node_modules/punycode/punycode.es6.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"punycode.es6.mjs","sources":["../../../../node_modules/punycode/punycode.es6.js"],"sourcesContent":["'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = callback(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n\tconst parts = domain.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tdomain = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tdomain = domain.replace(regexSeparators, '\\x2E');\n\tconst labels = domain.split('.');\n\tconst encoded = map(labels, callback).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint >= 0x30 && codePoint < 0x3A) {\n\t\treturn 26 + (codePoint - 0x30);\n\t}\n\tif (codePoint >= 0x41 && codePoint < 0x5B) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint >= 0x61 && codePoint < 0x7B) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t// 0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tconst oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\t\t\tif (digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tconst inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tconst basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue === n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.3.1',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };\nexport default punycode;\n"],"names":["maxInt","base","errors","overflow","floor","Math","stringFromCharCode","String","fromCharCode","error","type","RangeError","ucs2decode","string","output","counter","length","value","charCodeAt","extra","push","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","k","baseMinusTMin","decode","input","inputLength","i","n","bias","basic","lastIndexOf","j","index","oldi","w","codePoint","t","baseMinusT","out","splice","fromCodePoint","encode","currentValue","basicLength","handledCPCount","m","handledCPCountPlusOne","q","qMinusT","join"],"mappings":"AAGA,MAAMA,EAAS,WAGTC,EAAO,GAePC,EAAS,CACdC,SAAY,kDACZ,YAAa,iDACb,gBAAiB,iBAKZC,EAAQC,KAAKD,MACbE,EAAqBC,OAAOC,aAUlC,SAASC,EAAMC,GACd,MAAM,IAAIC,WAAWT,EAAOQ,GAC7B,CA0DA,SAASE,EAAWC,GACnB,MAAMC,EAAS,GACf,IAAIC,EAAU,EACd,MAAMC,EAASH,EAAOG,OACtB,KAAOD,EAAUC,GAAQ,CACxB,MAAMC,EAAQJ,EAAOK,WAAWH,KAChC,GAAIE,GAAS,OAAUA,GAAS,OAAUF,EAAUC,EAAQ,CAE3D,MAAMG,EAAQN,EAAOK,WAAWH,KACR,QAAX,MAARI,GACJL,EAAOM,OAAe,KAARH,IAAkB,KAAe,KAARE,GAAiB,QAIxDL,EAAOM,KAAKH,GACZF,IAEF,MACCD,EAAOM,KAAKH,EAEd,CACA,OAAOH,CACR,CAqBA,MAwBMO,EAAe,SAASC,EAAOC,GAGpC,OAAOD,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,EACzD,EAOMC,EAAQ,SAASC,EAAOC,EAAWC,GACxC,IAAIC,EAAI,EAGR,IAFAH,EAAQE,EAAYvB,EAAMqB,EA1Kd,KA0K8BA,GAAS,EACnDA,GAASrB,EAAMqB,EAAQC,GACOD,EAAQI,IAA2BD,GAAK3B,EACrEwB,EAAQrB,EAAMqB,EA3JMxB,IA6JrB,OAAOG,EAAMwB,EAAI,GAAsBH,GAASA,EAhLpC,IAiLb,EASMK,EAAS,SAASC,GAEvB,MAAMjB,EAAS,GACTkB,EAAcD,EAAMf,OAC1B,IAAIiB,EAAI,EACJC,EA5LY,IA6LZC,EA9Le,GAoMfC,EAAQL,EAAMM,YAlMD,KAmMbD,EAAQ,IACXA,EAAQ,GAGT,IAAK,IAAIE,EAAI,EAAGA,EAAIF,IAASE,EAExBP,EAAMb,WAAWoB,IAAM,KAC1B7B,EAAM,aAEPK,EAAOM,KAAKW,EAAMb,WAAWoB,IAM9B,IAAK,IAAIC,EAAQH,EAAQ,EAAIA,EAAQ,EAAI,EAAGG,EAAQP,GAAwC,CAO3F,MAAMQ,EAAOP,EACb,IAAK,IAAIQ,EAAI,EAAGb,EAAI3B,GAA0B2B,GAAK3B,EAAM,CAEpDsC,GAASP,GACZvB,EAAM,iBAGP,MAAMa,GA9FqBoB,EA8FAX,EAAMb,WAAWqB,OA7F7B,IAAQG,EAAY,GACvBA,EAAY,GAAlB,GAEJA,GAAa,IAAQA,EAAY,GAC7BA,EAAY,GAEhBA,GAAa,IAAQA,EAAY,IAC7BA,EAAY,GAEbzC,EAsFDqB,GAASrB,GACZQ,EAAM,iBAEHa,EAAQlB,GAAOJ,EAASiC,GAAKQ,IAChChC,EAAM,YAGPwB,GAAKX,EAAQmB,EACb,MAAME,EAAIf,GAAKO,EAhPL,EAgPoBP,GAAKO,EA/OzB,MA+O8CP,EAAIO,EAE5D,GAAIb,EAAQqB,EACX,MAGD,MAAMC,EAAa3C,EAAO0C,EACtBF,EAAIrC,EAAMJ,EAAS4C,IACtBnC,EAAM,YAGPgC,GAAKG,CAEN,CAEA,MAAMC,EAAM/B,EAAOE,OAAS,EAC5BmB,EAAOX,EAAMS,EAAIO,EAAMK,EAAa,GAARL,GAIxBpC,EAAM6B,EAAIY,GAAO7C,EAASkC,GAC7BzB,EAAM,YAGPyB,GAAK9B,EAAM6B,EAAIY,GACfZ,GAAKY,EAGL/B,EAAOgC,OAAOb,IAAK,EAAGC,EAEvB,CAtIoB,IAASQ,EAwI7B,OAAOnC,OAAOwC,iBAAiBjC,EAChC,EASMkC,EAAS,SAASjB,GACvB,MAAMjB,EAAS,GAMTkB,GAHND,EAAQnB,EAAWmB,IAGOf,OAG1B,IAAIkB,EA/RY,IAgSZT,EAAQ,EACRU,EAlSe,GAqSnB,IAAK,MAAMc,KAAgBlB,EACtBkB,EAAe,KAClBnC,EAAOM,KAAKd,EAAmB2C,IAIjC,MAAMC,EAAcpC,EAAOE,OAC3B,IAAImC,EAAiBD,EAWrB,IALIA,GACHpC,EAAOM,KAjTS,KAqTV+B,EAAiBnB,GAAa,CAIpC,IAAIoB,EAAIpD,EACR,IAAK,MAAMiD,KAAgBlB,EACtBkB,GAAgBf,GAAKe,EAAeG,IACvCA,EAAIH,GAMN,MAAMI,EAAwBF,EAAiB,EAC3CC,EAAIlB,EAAI9B,GAAOJ,EAASyB,GAAS4B,IACpC5C,EAAM,YAGPgB,IAAU2B,EAAIlB,GAAKmB,EACnBnB,EAAIkB,EAEJ,IAAK,MAAMH,KAAgBlB,EAI1B,GAHIkB,EAAef,KAAOT,EAAQzB,GACjCS,EAAM,YAEHwC,IAAiBf,EAAG,CAEvB,IAAIoB,EAAI7B,EACR,IAAK,IAAIG,EAAI3B,GAA0B2B,GAAK3B,EAAM,CACjD,MAAM0C,EAAIf,GAAKO,EAxVP,EAwVsBP,GAAKO,EAvV3B,MAuVgDP,EAAIO,EAC5D,GAAImB,EAAIX,EACP,MAED,MAAMY,EAAUD,EAAIX,EACdC,EAAa3C,EAAO0C,EAC1B7B,EAAOM,KACNd,EAAmBe,EAAasB,EAAIY,EAAUX,EAAY,KAE3DU,EAAIlD,EAAMmD,EAAUX,EACrB,CAEA9B,EAAOM,KAAKd,EAAmBe,EAAaiC,EAAG,KAC/CnB,EAAOX,EAAMC,EAAO4B,EAAuBF,IAAmBD,GAC9DzB,EAAQ,IACN0B,CACH,GAGC1B,IACAS,CAEH,CACA,OAAOpB,EAAO0C,KAAK,GACpB","x_google_ignoreList":[0]}

package/dist/esm/node_modules/tiny-inflate/index.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- function t(){this.table=new Uint16Array(16),this.trans=new Uint16Array(288)}function e(e,r){this.source=e,this.sourceIndex=0,this.tag=0,this.bitcount=0,this.dest=r,this.destLen=0,this.ltree=new t,this.dtree=new t}var r=new t,n=new t,o=new Uint8Array(30),a=new Uint16Array(30),s=new Uint8Array(30),u=new Uint16Array(30),c=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),i=new t,f=new Uint8Array(320);function d(t,e,r,n){var o,a;for(o=0;o<r;++o)t[o]=0;for(o=0;o<30-r;++o)t[o+r]=o/r\|0;for(a=n,o=0;o<30;++o)e[o]=a,a+=1<<t[o]}var b=new Uint16Array(16);function l(t,e,r,n){var o,a;for(o=0;o<16;++o)t.table[o]=0;for(o=0;o<n;++o)t.table[e[r+o]]++;for(t.table[0]=0,a=0,o=0;o<16;++o)b[o]=a,a+=t.table[o];for(o=0;o<n;++o)e[r+o]&&(t.trans[b[e[r+o]]++]=o)}function w(t){t.bitcount--\|\|(t.tag=t.source[t.sourceIndex++],t.bitcount=7);var e=1&t.tag;return t.tag>>>=1,e}function h(t,e,r){if(!e)return r;for(;t.bitcount<24;)t.tag\|=t.source[t.sourceIndex++]<<t.bitcount,t.bitcount+=8;var n=t.tag&65535>>>16-e;return t.tag>>>=e,t.bitcount-=e,n+r}function v(t,e){for(;t.bitcount<24;)t.tag\|=t.source[t.sourceIndex++]<<t.bitcount,t.bitcount+=8;var r=0,n=0,o=0,a=t.tag;do{n=2n+(1&a),a>>>=1,++o,r+=e.table[o],n-=e.table[o]}while(n>=0);return t.tag=a,t.bitcount-=o,e.trans[r+n]}function x(t,e,r){var n,o,a,s,u,d;for(n=h(t,5,257),o=h(t,5,1),a=h(t,4,4),s=0;s<19;++s)f[s]=0;for(s=0;s<a;++s){var b=h(t,3,0);f[c[s]]=b}for(l(i,f,0,19),u=0;u<n+o;){var w=v(t,i);switch(w){case 16:var x=f[u-1];for(d=h(t,2,3);d;--d)f[u++]=x;break;case 17:for(d=h(t,3,3);d;--d)f[u++]=0;break;case 18:for(d=h(t,7,11);d;--d)f[u++]=0;break;default:f[u++]=w}}l(e,f,0,n),l(r,f,n,o)}function g(t,e,r){for(;;){var n,c,i,f,d=v(t,e);if(256===d)return 0;if(d<256)t.dest[t.destLen++]=d;else for(n=h(t,o[d-=257],a[d]),c=v(t,r),f=i=t.destLen-h(t,s[c],u[c]);f<i+n;++f)t.dest[t.destLen++]=t.dest[f]}}function y(t){for(var e,r;t.bitcount>8;)t.sourceIndex--,t.bitcount-=8;if((e=256(e=t.source[t.sourceIndex+1])+t.source[t.sourceIndex])!==(65535&~(256*t.source[t.sourceIndex+3]+t.source[t.sourceIndex+2])))return-3;for(t.sourceIndex+=4,r=e;r;--r)t.dest[t.destLen++]=t.source[t.sourceIndex++];return t.bitcount=0,0}!function(t,e){var r;for(r=0;r<7;++r)t.table[r]=0;for(t.table[7]=24,t.table[8]=152,t.table[9]=112,r=0;r<24;++r)t.trans[r]=256+r;for(r=0;r<144;++r)t.trans[24+r]=r;for(r=0;r<8;++r)t.trans[168+r]=280+r;for(r=0;r<112;++r)t.trans[176+r]=144+r;for(r=0;r<5;++r)e.table[r]=0;for(e.table[5]=32,r=0;r<32;++r)e.trans[r]=r}(r,n),d(o,a,4,3),d(s,u,2,1),o[28]=0,a[28]=258;var I=function(t,o){var a,s,u=new e(t,o);do{switch(a=w(u),h(u,2,0)){case 0:s=y(u);break;case 1:s=g(u,r,n);break;case 2:x(u,u.ltree,u.dtree),s=g(u,u.ltree,u.dtree);break;default:s=-3}if(0!==s)throw new Error("Data error")}while(!a);return u.destLen<u.dest.length?"function"==typeof u.dest.slice?u.dest.slice(0,u.destLen):u.dest.subarray(0,u.destLen):u.dest};export{I as t};
2	- //# sourceMappingURL=index.mjs.map

package/dist/esm/node_modules/tiny-inflate/index.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.mjs","sources":["../../../../node_modules/tiny-inflate/index.js"],"sourcesContent":["var TINF_OK = 0;\nvar TINF_DATA_ERROR = -3;\n\nfunction Tree() {\n this.table = new Uint16Array(16); /* table of code length counts */\n this.trans = new Uint16Array(288); /* code -> symbol translation table */\n}\n\nfunction Data(source, dest) {\n this.source = source;\n this.sourceIndex = 0;\n this.tag = 0;\n this.bitcount = 0;\n \n this.dest = dest;\n this.destLen = 0;\n \n this.ltree = new Tree(); /* dynamic length/symbol tree */\n this.dtree = new Tree(); /* dynamic distance tree */\n}\n\n/* --------------------------------------------------- *\n * -- uninitialized global data (static structures) -- *\n * --------------------------------------------------- */\n\nvar sltree = new Tree();\nvar sdtree = new Tree();\n\n/* extra bits and base tables for length codes */\nvar length_bits = new Uint8Array(30);\nvar length_base = new Uint16Array(30);\n\n/* extra bits and base tables for distance codes */\nvar dist_bits = new Uint8Array(30);\nvar dist_base = new Uint16Array(30);\n\n/* special ordering of code length codes */\nvar clcidx = new Uint8Array([\n 16, 17, 18, 0, 8, 7, 9, 6,\n 10, 5, 11, 4, 12, 3, 13, 2,\n 14, 1, 15\n]);\n\n/* used by tinf_decode_trees, avoids allocations every call */\nvar code_tree = new Tree();\nvar lengths = new Uint8Array(288 + 32);\n\n/* ----------------------- *\n * -- utility functions -- *\n * ----------------------- */\n\n/* build extra bits and base tables */\nfunction tinf_build_bits_base(bits, base, delta, first) {\n var i, sum;\n\n /* build bits table */\n for (i = 0; i < delta; ++i) bits[i] = 0;\n for (i = 0; i < 30 - delta; ++i) bits[i + delta] = i / delta | 0;\n\n /* build base table */\n for (sum = first, i = 0; i < 30; ++i) {\n base[i] = sum;\n sum += 1 << bits[i];\n }\n}\n\n/* build the fixed huffman trees */\nfunction tinf_build_fixed_trees(lt, dt) {\n var i;\n\n /* build fixed length tree */\n for (i = 0; i < 7; ++i) lt.table[i] = 0;\n\n lt.table[7] = 24;\n lt.table[8] = 152;\n lt.table[9] = 112;\n\n for (i = 0; i < 24; ++i) lt.trans[i] = 256 + i;\n for (i = 0; i < 144; ++i) lt.trans[24 + i] = i;\n for (i = 0; i < 8; ++i) lt.trans[24 + 144 + i] = 280 + i;\n for (i = 0; i < 112; ++i) lt.trans[24 + 144 + 8 + i] = 144 + i;\n\n /* build fixed distance tree */\n for (i = 0; i < 5; ++i) dt.table[i] = 0;\n\n dt.table[5] = 32;\n\n for (i = 0; i < 32; ++i) dt.trans[i] = i;\n}\n\n/* given an array of code lengths, build a tree */\nvar offs = new Uint16Array(16);\n\nfunction tinf_build_tree(t, lengths, off, num) {\n var i, sum;\n\n /* clear code length count table */\n for (i = 0; i < 16; ++i) t.table[i] = 0;\n\n /* scan symbol lengths, and sum code length counts */\n for (i = 0; i < num; ++i) t.table[lengths[off + i]]++;\n\n t.table[0] = 0;\n\n /* compute offset table for distribution sort */\n for (sum = 0, i = 0; i < 16; ++i) {\n offs[i] = sum;\n sum += t.table[i];\n }\n\n /* create code->symbol translation table (symbols sorted by code) */\n for (i = 0; i < num; ++i) {\n if (lengths[off + i]) t.trans[offs[lengths[off + i]]++] = i;\n }\n}\n\n/* ---------------------- *\n * -- decode functions -- *\n * ---------------------- */\n\n/* get one bit from source stream */\nfunction tinf_getbit(d) {\n /* check if tag is empty */\n if (!d.bitcount--) {\n /* load next tag */\n d.tag = d.source[d.sourceIndex++];\n d.bitcount = 7;\n }\n\n /* shift bit out of tag */\n var bit = d.tag & 1;\n d.tag >>>= 1;\n\n return bit;\n}\n\n/* read a num bit value from a stream and add base */\nfunction tinf_read_bits(d, num, base) {\n if (!num)\n return base;\n\n while (d.bitcount < 24) {\n d.tag |= d.source[d.sourceIndex++] << d.bitcount;\n d.bitcount += 8;\n }\n\n var val = d.tag & (0xffff >>> (16 - num));\n d.tag >>>= num;\n d.bitcount -= num;\n return val + base;\n}\n\n/* given a data stream and a tree, decode a symbol */\nfunction tinf_decode_symbol(d, t) {\n while (d.bitcount < 24) {\n d.tag |= d.source[d.sourceIndex++] << d.bitcount;\n d.bitcount += 8;\n }\n \n var sum = 0, cur = 0, len = 0;\n var tag = d.tag;\n\n /* get more bits while code value is above sum */\n do {\n cur = 2 * cur + (tag & 1);\n tag >>>= 1;\n ++len;\n\n sum += t.table[len];\n cur -= t.table[len];\n } while (cur >= 0);\n \n d.tag = tag;\n d.bitcount -= len;\n\n return t.trans[sum + cur];\n}\n\n/* given a data stream, decode dynamic trees from it */\nfunction tinf_decode_trees(d, lt, dt) {\n var hlit, hdist, hclen;\n var i, num, length;\n\n /* get 5 bits HLIT (257-286) */\n hlit = tinf_read_bits(d, 5, 257);\n\n /* get 5 bits HDIST (1-32) */\n hdist = tinf_read_bits(d, 5, 1);\n\n /* get 4 bits HCLEN (4-19) */\n hclen = tinf_read_bits(d, 4, 4);\n\n for (i = 0; i < 19; ++i) lengths[i] = 0;\n\n /* read code lengths for code length alphabet */\n for (i = 0; i < hclen; ++i) {\n /* get 3 bits code length (0-7) */\n var clen = tinf_read_bits(d, 3, 0);\n lengths[clcidx[i]] = clen;\n }\n\n /* build code length tree */\n tinf_build_tree(code_tree, lengths, 0, 19);\n\n /* decode code lengths for the dynamic trees */\n for (num = 0; num < hlit + hdist;) {\n var sym = tinf_decode_symbol(d, code_tree);\n\n switch (sym) {\n case 16:\n /* copy previous code length 3-6 times (read 2 bits) */\n var prev = lengths[num - 1];\n for (length = tinf_read_bits(d, 2, 3); length; --length) {\n lengths[num++] = prev;\n }\n break;\n case 17:\n /* repeat code length 0 for 3-10 times (read 3 bits) */\n for (length = tinf_read_bits(d, 3, 3); length; --length) {\n lengths[num++] = 0;\n }\n break;\n case 18:\n /* repeat code length 0 for 11-138 times (read 7 bits) */\n for (length = tinf_read_bits(d, 7, 11); length; --length) {\n lengths[num++] = 0;\n }\n break;\n default:\n /* values 0-15 represent the actual code lengths */\n lengths[num++] = sym;\n break;\n }\n }\n\n /* build dynamic trees */\n tinf_build_tree(lt, lengths, 0, hlit);\n tinf_build_tree(dt, lengths, hlit, hdist);\n}\n\n/* ----------------------------- *\n * -- block inflate functions -- *\n * ----------------------------- */\n\n/* given a stream and two trees, inflate a block of data */\nfunction tinf_inflate_block_data(d, lt, dt) {\n while (1) {\n var sym = tinf_decode_symbol(d, lt);\n\n /* check for end of block */\n if (sym === 256) {\n return TINF_OK;\n }\n\n if (sym < 256) {\n d.dest[d.destLen++] = sym;\n } else {\n var length, dist, offs;\n var i;\n\n sym -= 257;\n\n /* possibly get more bits from length code */\n length = tinf_read_bits(d, length_bits[sym], length_base[sym]);\n\n dist = tinf_decode_symbol(d, dt);\n\n /* possibly get more bits from distance code */\n offs = d.destLen - tinf_read_bits(d, dist_bits[dist], dist_base[dist]);\n\n /* copy match */\n for (i = offs; i < offs + length; ++i) {\n d.dest[d.destLen++] = d.dest[i];\n }\n }\n }\n}\n\n/* inflate an uncompressed block of data */\nfunction tinf_inflate_uncompressed_block(d) {\n var length, invlength;\n var i;\n \n /* unread from bitbuffer */\n while (d.bitcount > 8) {\n d.sourceIndex--;\n d.bitcount -= 8;\n }\n\n /* get length */\n length = d.source[d.sourceIndex + 1];\n length = 256 * length + d.source[d.sourceIndex];\n\n /* get one's complement of length */\n invlength = d.source[d.sourceIndex + 3];\n invlength = 256 * invlength + d.source[d.sourceIndex + 2];\n\n /* check length */\n if (length !== (~invlength & 0x0000ffff))\n return TINF_DATA_ERROR;\n\n d.sourceIndex += 4;\n\n /* copy block */\n for (i = length; i; --i)\n d.dest[d.destLen++] = d.source[d.sourceIndex++];\n\n /* make sure we start next block on a byte boundary */\n d.bitcount = 0;\n\n return TINF_OK;\n}\n\n/* inflate stream from source to dest */\nfunction tinf_uncompress(source, dest) {\n var d = new Data(source, dest);\n var bfinal, btype, res;\n\n do {\n /* read final block flag */\n bfinal = tinf_getbit(d);\n\n /* read block type (2 bits) */\n btype = tinf_read_bits(d, 2, 0);\n\n /* decompress block */\n switch (btype) {\n case 0:\n /* decompress uncompressed block */\n res = tinf_inflate_uncompressed_block(d);\n break;\n case 1:\n /* decompress block with fixed huffman trees */\n res = tinf_inflate_block_data(d, sltree, sdtree);\n break;\n case 2:\n /* decompress block with dynamic huffman trees */\n tinf_decode_trees(d, d.ltree, d.dtree);\n res = tinf_inflate_block_data(d, d.ltree, d.dtree);\n break;\n default:\n res = TINF_DATA_ERROR;\n }\n\n if (res !== TINF_OK)\n throw new Error('Data error');\n\n } while (!bfinal);\n\n if (d.destLen < d.dest.length) {\n if (typeof d.dest.slice === 'function')\n return d.dest.slice(0, d.destLen);\n else\n return d.dest.subarray(0, d.destLen);\n }\n \n return d.dest;\n}\n\n/* -------------------- *\n * -- initialization -- *\n * -------------------- */\n\n/* build fixed huffman trees */\ntinf_build_fixed_trees(sltree, sdtree);\n\n/* build extra bits and base tables */\ntinf_build_bits_base(length_bits, length_base, 4, 3);\ntinf_build_bits_base(dist_bits, dist_base, 2, 1);\n\n/* fix a special case */\nlength_bits[28] = 0;\nlength_base[28] = 258;\n\nmodule.exports = tinf_uncompress;\n"],"names":["Tree","this","table","Uint16Array","trans","Data","source","dest","sourceIndex","tag","bitcount","destLen","ltree","dtree","sltree","sdtree","length_bits","Uint8Array","length_base","dist_bits","dist_base","clcidx","code_tree","lengths","tinf_build_bits_base","bits","base","delta","first","i","sum","offs","tinf_build_tree","t","off","num","tinf_getbit","d","bit","tinf_read_bits","val","tinf_decode_symbol","cur","len","tinf_decode_trees","lt","dt","hlit","hdist","hclen","length","clen","sym","prev","tinf_inflate_block_data","dist","tinf_inflate_uncompressed_block","tinf_build_fixed_trees","tinyInflate","bfinal","res","Error","slice","subarray"],"mappings":"AAGA,SAASA,IACPC,KAAKC,MAAQ,IAAIC,YAAY,IAC7BF,KAAKG,MAAQ,IAAID,YAAY,IAC/B,CAEA,SAASE,EAAKC,EAAQC,GACpBN,KAAKK,OAASA,EACdL,KAAKO,YAAc,EACnBP,KAAKQ,IAAM,EACXR,KAAKS,SAAW,EAEhBT,KAAKM,KAAOA,EACZN,KAAKU,QAAU,EAEfV,KAAKW,MAAQ,IAAIZ,EACjBC,KAAKY,MAAQ,IAAIb,CACnB,CAMA,IAAIc,EAAS,IAAId,EACbe,EAAS,IAAIf,EAGbgB,EAAc,IAAIC,WAAW,IAC7BC,EAAc,IAAIf,YAAY,IAG9BgB,EAAY,IAAIF,WAAW,IAC3BG,EAAY,IAAIjB,YAAY,IAG5BkB,EAAS,IAAIJ,WAAW,CAC1B,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EACxB,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACzB,GAAI,EAAG,KAILK,EAAY,IAAItB,EAChBuB,EAAU,IAAIN,WAAW,KAO7B,SAASO,EAAqBC,EAAMC,EAAMC,EAAOC,GAC/C,IAAIC,EAAGC,EAGP,IAAKD,EAAI,EAAGA,EAAIF,IAASE,EAAGJ,EAAKI,GAAK,EACtC,IAAKA,EAAI,EAAGA,EAAI,GAAKF,IAASE,EAAGJ,EAAKI,EAAIF,GAASE,EAAIF,EAAQ,EAG/D,IAAKG,EAAMF,EAAOC,EAAI,EAAGA,EAAI,KAAMA,EACjCH,EAAKG,GAAKC,EACVA,GAAO,GAAKL,EAAKI,EAErB,CA2BA,IAAIE,EAAO,IAAI5B,YAAY,IAE3B,SAAS6B,EAAgBC,EAAGV,EAASW,EAAKC,GACxC,IAAIN,EAAGC,EAGP,IAAKD,EAAI,EAAGA,EAAI,KAAMA,EAAGI,EAAE/B,MAAM2B,GAAK,EAGtC,IAAKA,EAAI,EAAGA,EAAIM,IAAON,EAAGI,EAAE/B,MAAMqB,EAAQW,EAAML,MAKhD,IAHAI,EAAE/B,MAAM,GAAK,EAGR4B,EAAM,EAAGD,EAAI,EAAGA,EAAI,KAAMA,EAC7BE,EAAKF,GAAKC,EACVA,GAAOG,EAAE/B,MAAM2B,GAIjB,IAAKA,EAAI,EAAGA,EAAIM,IAAON,EACjBN,EAAQW,EAAML,KAAII,EAAE7B,MAAM2B,EAAKR,EAAQW,EAAML,OAASA,EAE9D,CAOA,SAASO,EAAYC,GAEdA,EAAE3B,aAEL2B,EAAE5B,IAAM4B,EAAE/B,OAAO+B,EAAE7B,eACnB6B,EAAE3B,SAAW,GAIf,IAAI4B,EAAc,EAARD,EAAE5B,IAGZ,OAFA4B,EAAE5B,OAAS,EAEJ6B,CACT,CAGA,SAASC,EAAeF,EAAGF,EAAKT,GAC9B,IAAKS,EACH,OAAOT,EAET,KAAOW,EAAE3B,SAAW,IAClB2B,EAAE5B,KAAO4B,EAAE/B,OAAO+B,EAAE7B,gBAAkB6B,EAAE3B,SACxC2B,EAAE3B,UAAY,EAGhB,IAAI8B,EAAMH,EAAE5B,IAAO,QAAY,GAAK0B,EAGpC,OAFAE,EAAE5B,OAAS0B,EACXE,EAAE3B,UAAYyB,EACPK,EAAMd,CACf,CAGA,SAASe,EAAmBJ,EAAGJ,GAC7B,KAAOI,EAAE3B,SAAW,IAClB2B,EAAE5B,KAAO4B,EAAE/B,OAAO+B,EAAE7B,gBAAkB6B,EAAE3B,SACxC2B,EAAE3B,UAAY,EAGhB,IAAIoB,EAAM,EAAGY,EAAM,EAAGC,EAAM,EACxBlC,EAAM4B,EAAE5B,IAGZ,GACEiC,EAAM,EAAIA,GAAa,EAANjC,GACjBA,KAAS,IACPkC,EAEFb,GAAOG,EAAE/B,MAAMyC,GACfD,GAAOT,EAAE/B,MAAMyC,SACRD,GAAO,GAKhB,OAHAL,EAAE5B,IAAMA,EACR4B,EAAE3B,UAAYiC,EAEPV,EAAE7B,MAAM0B,EAAMY,EACvB,CAGA,SAASE,EAAkBP,EAAGQ,EAAIC,GAChC,IAAIC,EAAMC,EAAOC,EACbpB,EAAGM,EAAKe,EAWZ,IARAH,EAAOR,EAAeF,EAAG,EAAG,KAG5BW,EAAQT,EAAeF,EAAG,EAAG,GAG7BY,EAAQV,EAAeF,EAAG,EAAG,GAExBR,EAAI,EAAGA,EAAI,KAAMA,EAAGN,EAAQM,GAAK,EAGtC,IAAKA,EAAI,EAAGA,EAAIoB,IAASpB,EAAG,CAE1B,IAAIsB,EAAOZ,EAAeF,EAAG,EAAG,GAChCd,EAAQF,EAAOQ,IAAMsB,CACzB,CAME,IAHAnB,EAAgBV,EAAWC,EAAS,EAAG,IAGlCY,EAAM,EAAGA,EAAMY,EAAOC,GAAQ,CACjC,IAAII,EAAMX,EAAmBJ,EAAGf,GAEhC,OAAQ8B,GACN,KAAK,GAEH,IAAIC,EAAO9B,EAAQY,EAAM,GACzB,IAAKe,EAASX,EAAeF,EAAG,EAAG,GAAIa,IAAUA,EAC/C3B,EAAQY,KAASkB,EAEnB,MACF,KAAK,GAEH,IAAKH,EAASX,EAAeF,EAAG,EAAG,GAAIa,IAAUA,EAC/C3B,EAAQY,KAAS,EAEnB,MACF,KAAK,GAEH,IAAKe,EAASX,EAAeF,EAAG,EAAG,IAAKa,IAAUA,EAChD3B,EAAQY,KAAS,EAEnB,MACF,QAEEZ,EAAQY,KAASiB,EAGzB,CAGEpB,EAAgBa,EAAItB,EAAS,EAAGwB,GAChCf,EAAgBc,EAAIvB,EAASwB,EAAMC,EACrC,CAOA,SAASM,EAAwBjB,EAAGQ,EAAIC,GACtC,OAAU,CACR,IAUMI,EAAQK,EAAMxB,EACdF,EAXFuB,EAAMX,EAAmBJ,EAAGQ,GAGhC,GAAY,MAARO,EACF,OA3PQ,EA8PV,GAAIA,EAAM,IACRf,EAAE9B,KAAK8B,EAAE1B,WAAayC,OAgBtB,IARAF,EAASX,EAAeF,EAAGrB,EAH3BoC,GAAO,KAGsClC,EAAYkC,IAEzDG,EAAOd,EAAmBJ,EAAGS,GAMxBjB,EAHLE,EAAOM,EAAE1B,QAAU4B,EAAeF,EAAGlB,EAAUoC,GAAOnC,EAAUmC,IAGjD1B,EAAIE,EAAOmB,IAAUrB,EAClCQ,EAAE9B,KAAK8B,EAAE1B,WAAa0B,EAAE9B,KAAKsB,EAGrC,CACA,CAGA,SAAS2B,EAAgCnB,GAKvC,IAJA,IAAIa,EACArB,EAGGQ,EAAE3B,SAAW,GAClB2B,EAAE7B,cACF6B,EAAE3B,UAAY,EAYhB,IAPAwC,EAAS,KADTA,EAASb,EAAE/B,OAAO+B,EAAE7B,YAAc,IACV6B,EAAE/B,OAAO+B,EAAE7B,iBAON,QAHjB,IADA6B,EAAE/B,OAAO+B,EAAE7B,YAAc,GACP6B,EAAE/B,OAAO+B,EAAE7B,YAAc,KAIrD,OA1SkB,EA+SpB,IAHA6B,EAAE7B,aAAe,EAGZqB,EAAIqB,EAAQrB,IAAKA,EACpBQ,EAAE9B,KAAK8B,EAAE1B,WAAa0B,EAAE/B,OAAO+B,EAAE7B,eAKnC,OAFA6B,EAAE3B,SAAW,EApTD,CAuTd,EApPA,SAAgCmC,EAAIC,GAClC,IAAIjB,EAGJ,IAAKA,EAAI,EAAGA,EAAI,IAAKA,EAAGgB,EAAG3C,MAAM2B,GAAK,EAMtC,IAJAgB,EAAG3C,MAAM,GAAK,GACd2C,EAAG3C,MAAM,GAAK,IACd2C,EAAG3C,MAAM,GAAK,IAET2B,EAAI,EAAGA,EAAI,KAAMA,EAAGgB,EAAGzC,MAAMyB,GAAK,IAAMA,EAC7C,IAAKA,EAAI,EAAGA,EAAI,MAAOA,EAAGgB,EAAGzC,MAAM,GAAKyB,GAAKA,EAC7C,IAAKA,EAAI,EAAGA,EAAI,IAAKA,EAAGgB,EAAGzC,MAAM,IAAWyB,GAAK,IAAMA,EACvD,IAAKA,EAAI,EAAGA,EAAI,MAAOA,EAAGgB,EAAGzC,MAAM,IAAeyB,GAAK,IAAMA,EAG7D,IAAKA,EAAI,EAAGA,EAAI,IAAKA,EAAGiB,EAAG5C,MAAM2B,GAAK,EAItC,IAFAiB,EAAG5C,MAAM,GAAK,GAET2B,EAAI,EAAGA,EAAI,KAAMA,EAAGiB,EAAG1C,MAAMyB,GAAKA,CACzC,CAoRA4B,CAAuB3C,EAAQC,GAG/BS,EAAqBR,EAAaE,EAAa,EAAG,GAClDM,EAAqBL,EAAWC,EAAW,EAAG,GAG9CJ,EAAY,IAAM,EAClBE,EAAY,IAAM,IAElBwC,IAAAA,EA5DA,SAAyBpD,EAAQC,GAC/B,IACIoD,EAAeC,EADfvB,EAAI,IAAIhC,EAAKC,EAAQC,GAGzB,EAAG,CAQD,OANAoD,EAASvB,EAAYC,GAGbE,EAAeF,EAAG,EAAG,IAI3B,KAAK,EAEHuB,EAAMJ,EAAgCnB,GACtC,MACF,KAAK,EAEHuB,EAAMN,EAAwBjB,EAAGvB,EAAQC,GACzC,MACF,KAAK,EAEH6B,EAAkBP,EAAGA,EAAEzB,MAAOyB,EAAExB,OAChC+C,EAAMN,EAAwBjB,EAAGA,EAAEzB,MAAOyB,EAAExB,OAC5C,MACF,QACE+C,GApVc,EAuVlB,GAxVU,IAwVNA,EACF,MAAM,IAAIC,MAAM,aAEnB,QAASF,GAEV,OAAItB,EAAE1B,QAAU0B,EAAE9B,KAAK2C,OACO,mBAAjBb,EAAE9B,KAAKuD,MACTzB,EAAE9B,KAAKuD,MAAM,EAAGzB,EAAE1B,SAElB0B,EAAE9B,KAAKwD,SAAS,EAAG1B,EAAE1B,SAGzB0B,EAAE9B,IACX","x_google_ignoreList":[0]}

package/dist/esm/node_modules/unicode-trie/index.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{t}from"../tiny-inflate/index.mjs";import{s as a}from"./swap.mjs";const r=t,{swap32LE:i}=a;var e=class{constructor(t){const a="function"==typeof t.readUInt32BE&&"function"==typeof t.slice;if(a\|\|t instanceof Uint8Array){let e;if(a)this.highStart=t.readUInt32LE(0),this.errorValue=t.readUInt32LE(4),e=t.readUInt32LE(8),t=t.slice(12);else{const a=new DataView(t.buffer);this.highStart=a.getUint32(0,!0),this.errorValue=a.getUint32(4,!0),e=a.getUint32(8,!0),t=t.subarray(12)}t=r(t,new Uint8Array(e)),t=r(t,new Uint8Array(e)),i(t),this.data=new Uint32Array(t.buffer)}else({data:this.data,highStart:this.highStart,errorValue:this.errorValue}=t)}get(t){let a;return t<0\|\|t>1114111?this.errorValue:t<55296\|\|t>56319&&t<=65535?(a=(this.data[t>>5]<<2)+(31&t),this.data[a]):t<=65535?(a=(this.data[2048+(t-55296>>5)]<<2)+(31&t),this.data[a]):t<this.highStart?(a=this.data[2080+(t>>11)],a=this.data[a+(t>>5&63)],a=(a<<2)+(31&t),this.data[a]):this.data[this.data.length-4]}};export{e as u};
2	- //# sourceMappingURL=index.mjs.map

package/dist/esm/node_modules/unicode-trie/index.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.mjs","sources":["../../../../node_modules/unicode-trie/index.js"],"sourcesContent":["const inflate = require('tiny-inflate');\nconst { swap32LE } = require('./swap');\n\n// Shift size for getting the index-1 table offset.\nconst SHIFT_1 = 6 + 5;\n\n// Shift size for getting the index-2 table offset.\nconst SHIFT_2 = 5;\n\n// Difference between the two shift sizes,\n// for getting an index-1 offset from an index-2 offset. 6=11-5\nconst SHIFT_1_2 = SHIFT_1 - SHIFT_2;\n\n// Number of index-1 entries for the BMP. 32=0x20\n// This part of the index-1 table is omitted from the serialized form.\nconst OMITTED_BMP_INDEX_1_LENGTH = 0x10000 >> SHIFT_1;\n\n// Number of entries in an index-2 block. 64=0x40\nconst INDEX_2_BLOCK_LENGTH = 1 << SHIFT_1_2;\n\n// Mask for getting the lower bits for the in-index-2-block offset. */\nconst INDEX_2_MASK = INDEX_2_BLOCK_LENGTH - 1;\n\n// Shift size for shifting left the index array values.\n// Increases possible data size with 16-bit index values at the cost\n// of compactability.\n// This requires data blocks to be aligned by DATA_GRANULARITY.\nconst INDEX_SHIFT = 2;\n\n// Number of entries in a data block. 32=0x20\nconst DATA_BLOCK_LENGTH = 1 << SHIFT_2;\n\n// Mask for getting the lower bits for the in-data-block offset.\nconst DATA_MASK = DATA_BLOCK_LENGTH - 1;\n\n// The part of the index-2 table for U+D800..U+DBFF stores values for\n// lead surrogate code _units_ not code _points_.\n// Values for lead surrogate code _points_ are indexed with this portion of the table.\n// Length=32=0x20=0x400>>SHIFT_2. (There are 1024=0x400 lead surrogates.)\nconst LSCP_INDEX_2_OFFSET = 0x10000 >> SHIFT_2;\nconst LSCP_INDEX_2_LENGTH = 0x400 >> SHIFT_2;\n\n// Count the lengths of both BMP pieces. 2080=0x820\nconst INDEX_2_BMP_LENGTH = LSCP_INDEX_2_OFFSET + LSCP_INDEX_2_LENGTH;\n\n// The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820.\n// Length 32=0x20 for lead bytes C0..DF, regardless of SHIFT_2.\nconst UTF8_2B_INDEX_2_OFFSET = INDEX_2_BMP_LENGTH;\nconst UTF8_2B_INDEX_2_LENGTH = 0x800 >> 6; // U+0800 is the first code point after 2-byte UTF-8\n\n// The index-1 table, only used for supplementary code points, at offset 2112=0x840.\n// Variable length, for code points up to highStart, where the last single-value range starts.\n// Maximum length 512=0x200=0x100000>>SHIFT_1.\n// (For 0x100000 supplementary code points U+10000..U+10ffff.)\n//\n// The part of the index-2 table for supplementary code points starts\n// after this index-1 table.\n//\n// Both the index-1 table and the following part of the index-2 table\n// are omitted completely if there is only BMP data.\nconst INDEX_1_OFFSET = UTF8_2B_INDEX_2_OFFSET + UTF8_2B_INDEX_2_LENGTH;\n\n// The alignment size of a data block. Also the granularity for compaction.\nconst DATA_GRANULARITY = 1 << INDEX_SHIFT;\n\nclass UnicodeTrie {\n constructor(data) {\n const isBuffer = (typeof data.readUInt32BE === 'function') && (typeof data.slice === 'function');\n\n if (isBuffer || data instanceof Uint8Array) {\n // read binary format\n let uncompressedLength;\n if (isBuffer) {\n this.highStart = data.readUInt32LE(0);\n this.errorValue = data.readUInt32LE(4);\n uncompressedLength = data.readUInt32LE(8);\n data = data.slice(12);\n } else {\n const view = new DataView(data.buffer);\n this.highStart = view.getUint32(0, true);\n this.errorValue = view.getUint32(4, true);\n uncompressedLength = view.getUint32(8, true);\n data = data.subarray(12);\n }\n\n // double inflate the actual trie data\n data = inflate(data, new Uint8Array(uncompressedLength));\n data = inflate(data, new Uint8Array(uncompressedLength));\n\n // swap bytes from little-endian\n swap32LE(data);\n\n this.data = new Uint32Array(data.buffer);\n\n } else {\n // pre-parsed data\n ({ data: this.data, highStart: this.highStart, errorValue: this.errorValue } = data);\n }\n }\n\n get(codePoint) {\n let index;\n if ((codePoint < 0) || (codePoint > 0x10ffff)) {\n return this.errorValue;\n }\n\n if ((codePoint < 0xd800) || ((codePoint > 0xdbff) && (codePoint <= 0xffff))) {\n // Ordinary BMP code point, excluding leading surrogates.\n // BMP uses a single level lookup. BMP index starts at offset 0 in the index.\n // data is stored in the index array itself.\n index = (this.data[codePoint >> SHIFT_2] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n return this.data[index];\n }\n\n if (codePoint <= 0xffff) {\n // Lead Surrogate Code Point. A Separate index section is stored for\n // lead surrogate code units and code points.\n // The main index has the code unit data.\n // For this function, we need the code point data.\n index = (this.data[LSCP_INDEX_2_OFFSET + ((codePoint - 0xd800) >> SHIFT_2)] << INDEX_SHIFT) + (codePoint & DATA_MASK);\n return this.data[index];\n }\n\n if (codePoint < this.highStart) {\n // Supplemental code point, use two-level lookup.\n index = this.data[(INDEX_1_OFFSET - OMITTED_BMP_INDEX_1_LENGTH) + (codePoint >> SHIFT_1)];\n index = this.data[index + ((codePoint >> SHIFT_2) & INDEX_2_MASK)];\n index = (index << INDEX_SHIFT) + (codePoint & DATA_MASK);\n return this.data[index];\n }\n\n return this.data[this.data.length - DATA_GRANULARITY];\n }\n}\n\nmodule.exports = UnicodeTrie;"],"names":["inflate","require$$0","swap32LE","require$$1","unicodeTrie","constructor","data","isBuffer","readUInt32BE","slice","Uint8Array","uncompressedLength","this","highStart","readUInt32LE","errorValue","view","DataView","buffer","getUint32","subarray","Uint32Array","get","codePoint","index","DATA_BLOCK_LENGTH","INDEX_1_OFFSET","INDEX_2_BLOCK_LENGTH","length"],"mappings":"wEAAA,MAAMA,EAAUC,GACVC,SAAEA,GAAaC,EAsIrBC,IAAAA,EAtEA,MACEC,WAAAA,CAAYC,GACV,MAAMC,EAAyC,mBAAtBD,EAAKE,cAAuD,mBAAfF,EAAKG,MAE3E,GAAIF,GAAYD,aAAgBI,WAAY,CAE1C,IAAIC,EACJ,GAAIJ,EACFK,KAAKC,UAAYP,EAAKQ,aAAa,GACnCF,KAAKG,WAAaT,EAAKQ,aAAa,GACpCH,EAAqBL,EAAKQ,aAAa,GACvCR,EAAOA,EAAKG,MAAM,QACb,CACL,MAAMO,EAAO,IAAIC,SAASX,EAAKY,QAC/BN,KAAKC,UAAYG,EAAKG,UAAU,GAAG,GACnCP,KAAKG,WAAaC,EAAKG,UAAU,GAAG,GACpCR,EAAqBK,EAAKG,UAAU,GAAG,GACvCb,EAAOA,EAAKc,SAAS,GAC7B,CAGMd,EAAON,EAAQM,EAAM,IAAII,WAAWC,IACpCL,EAAON,EAAQM,EAAM,IAAII,WAAWC,IAGpCT,EAASI,GAETM,KAAKN,KAAO,IAAIe,YAAYf,EAAKY,OAEvC,OAESZ,KAAMM,KAAKN,KAAMO,UAAWD,KAAKC,UAAWE,WAAYH,KAAKG,YAAeT,EAErF,CAEEgB,GAAAA,CAAIC,GACF,IAAIC,EACJ,OAAKD,EAAY,GAAOA,EAAY,QAC3BX,KAAKG,WAGTQ,EAAY,OAAaA,EAAY,OAAYA,GAAa,OAIjEC,GAASZ,KAAKN,KAAKiB,GAvGT,IAoBI,IAMFE,GA6EgDF,GACrDX,KAAKN,KAAKkB,IAGfD,GAAa,OAKfC,GAASZ,KAAKN,KAhFQ,MAgFqBiB,EAAY,OAhH7C,KAoBI,IAMFE,GAsFmFF,GACxFX,KAAKN,KAAKkB,IAGfD,EAAYX,KAAKC,WAEnBW,EAAQZ,KAAKN,KAAMoB,MAAgDH,GAzHzD,KA0HVC,EAAQZ,KAAKN,KAAKkB,GAAUD,GAvHlB,EAcKI,KA0GfH,GAASA,GApGK,IAMFC,GA8FsBF,GAC3BX,KAAKN,KAAKkB,IAGZZ,KAAKN,KAAKM,KAAKN,KAAKsB,OApEN,EAqEzB","x_google_ignoreList":[0]}

package/dist/esm/node_modules/unicode-trie/swap.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- const r=18===new Uint8Array(new Uint32Array([305419896]).buffer)[0],t=(r,t,e)=>{let n=r[t];r[t]=r[e],r[e]=n};var e={swap32LE:e=>{r&&(r=>{const e=r.length;for(let n=0;n<e;n+=4)t(r,n,n+3),t(r,n+1,n+2)})(e)}};export{e as s};
2	- //# sourceMappingURL=swap.mjs.map

package/dist/esm/node_modules/unicode-trie/swap.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"swap.mjs","sources":["../../../../node_modules/unicode-trie/swap.js"],"sourcesContent":["const isBigEndian = (new Uint8Array(new Uint32Array([0x12345678]).buffer)[0] === 0x12);\n\nconst swap = (b, n, m) => {\n let i = b[n];\n b[n] = b[m];\n b[m] = i;\n};\n\nconst swap32 = array => {\n const len = array.length;\n for (let i = 0; i < len; i += 4) {\n swap(array, i, i + 3);\n swap(array, i + 1, i + 2);\n }\n};\n\nconst swap32LE = array => {\n if (isBigEndian) {\n swap32(array);\n }\n};\n\nmodule.exports = {\n swap32LE: swap32LE\n};\n"],"names":["isBigEndian","Uint8Array","Uint32Array","buffer","swap","b","n","m","i","swap_1","swap32LE","array","len","length","swap32"],"mappings":"AAAA,MAAMA,EAA2E,KAA5D,IAAIC,WAAW,IAAIC,YAAY,CAAC,YAAaC,QAAQ,GAEpEC,EAAOA,CAACC,EAAGC,EAAGC,KAClB,IAAIC,EAAIH,EAAEC,GACVD,EAAEC,GAAKD,EAAEE,GACTF,EAAEE,GAAKC,CAAC,EAiBV,IAAAC,EAAiB,CACfC,SAPeC,IACXX,GATSW,KACb,MAAMC,EAAMD,EAAME,OAClB,IAAK,IAAIL,EAAI,EAAGA,EAAII,EAAKJ,GAAK,EAC5BJ,EAAKO,EAAOH,EAAGA,EAAI,GACnBJ,EAAKO,EAAOH,EAAI,EAAGA,EAAI,EAC3B,EAKIM,CAAOH,EACX","x_google_ignoreList":[0]}

package/dist/esm/record/checkSolRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{ed25519 as e}from"../node_modules/@noble/curves/esm/ed25519.mjs";const o=(o,s,m)=>e.verify(s,o,m.toBytes());export{o as checkSolRecord};
2	- //# sourceMappingURL=checkSolRecord.mjs.map

package/dist/esm/record/checkSolRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"checkSolRecord.mjs","sources":["../../../src/record/checkSolRecord.ts"],"sourcesContent":[null],"names":["checkSolRecord","record","signedRecord","pubkey","ed25519","verify","toBytes"],"mappings":"wEAUa,MAAAA,EAAiB,CAC5BC,EACAC,EACAC,IAEOC,EAAQC,OAAOH,EAAcD,EAAQE,EAAOG"}

package/dist/esm/record/deserializeRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import"../node_modules/buffer/index.mjs";import{b as e}from"../node_modules/bs58/index.mjs";import{PublicKey as r}from"@solana/web3.js";import{bech32 as o}from"../node_modules/@scure/base/lib/esm/index.mjs";import{decode as t}from"../node_modules/punycode/punycode.es6.mjs";import{i}from"../node_modules/ipaddr.js/lib/ipaddr.mjs";import{RECORD_V1_SIZE as n,Record as s}from"../types/record.mjs";import{InvalidRecordDataError as f}from"../error.mjs";import{checkSolRecord as m}from"./checkSolRecord.mjs";import{__exports as c}from"../_virtual/index.mjs";const d=(d,l,u)=>{const a=null==d?void 0:d.data;if(!a)return;if(0===a.compare(c.Buffer.alloc(a.length)))return;const p=n.get(l),j=(e=>{const r=Array.from(e);return r.length-1-r.reverse().findIndex((e=>0!==e))+1})(a);if(!p){const e=a.slice(0,j).toString("utf-8");return l===s.CNAME\|\|l===s.TXT?t(e):e}if(l===s.SOL){const r=new TextEncoder,o=c.Buffer.concat([a.slice(0,32),u.toBuffer()]),t=r.encode(o.toString("hex"));if(m(t,a.slice(32,96),d.owner))return e.encode(a.slice(0,32))}if(p&&j!==p){const e=a.slice(0,j).toString("utf-8");if(l===s.Injective){const r=o.decodeToBytes(e);if("inj"===r.prefix&&20===r.bytes.length)return e}else if(l===s.BSC\|\|l===s.ETH){const r=e.slice(0,2),o=e.slice(2);if("0x"===r&&20===c.Buffer.from(o,"hex").length)return e}else if((l===s.A\|\|l===s.AAAA)&&i.isValid(e))return e;throw new f("The record data is malformed")}if(l===s.ETH\|\|l===s.BSC)return"0x"+a.slice(0,p).toString("hex");if(l===s.Injective)return o.encode("inj",o.toWords(a.slice(0,p)));if(l===s.A\|\|l===s.AAAA)return i.fromByteArray([...a.slice(0,p)]).toString();if(l===s.Background)return new r(a.slice(0,p)).toString();throw new f("The record data is malformed")};export{d as deserializeRecord};
2	- //# sourceMappingURL=deserializeRecord.mjs.map

package/dist/esm/record/deserializeRecord.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"deserializeRecord.mjs","sources":["../../../src/record/deserializeRecord.ts"],"sourcesContent":[null],"names":["deserializeRecord","registry","record","recordKey","buffer","data","compare","Buffer","alloc","length","size","RECORD_V1_SIZE","get","idx","arr","Array","from","reverse","findIndex","byte","trimNullPaddingIdx","str","slice","toString","Record","CNAME","TXT","decodePunnyCode","SOL","encoder","TextEncoder","expectedBuffer","concat","toBuffer","expected","encode","checkSolRecord","owner","bs58Encode","address","Injective","decoded","bech32","decodeToBytes","prefix","bytes","BSC","ETH","hex","A","AAAA","isValidIp","InvalidRecordDataError","toWords","ipFromByteArray","fromByteArray","Background","PublicKey"],"mappings":"yiBAeA,MAcaA,EAAoB,CAC/BC,EACAC,EACAC,KAEA,MAAMC,EAASH,aAAA,EAAAA,EAAUI,KACzB,IAAKD,EAAQ,OACb,GAAoD,IAAhDA,EAAOE,QAAQC,EAAMA,OAACC,MAAMJ,EAAOK,SAAgB,OAEvD,MAAMC,EAAOC,EAAeC,IAAIV,GAC1BW,EAxBmB,CAACT,IAC1B,MAAMU,EAAMC,MAAMC,KAAKZ,GAGvB,OADEU,EAAIL,OAAS,EAAIK,EAAIG,UAAUC,WAAWC,GAAkB,IAATA,IAChC,CAAC,EAoBVC,CAAmBhB,GAE/B,IAAKM,EAAM,CACT,MAAMW,EAAMjB,EAAOkB,MAAM,EAAGT,GAAKU,SAAS,SAC1C,OAAIrB,IAAWsB,EAAOC,OAASvB,IAAWsB,EAAOE,IACxCC,EAAgBN,GAElBA,EAIT,GAAInB,IAAWsB,EAAOI,IAAK,CACzB,MAAMC,EAAU,IAAIC,YACdC,EAAiBxB,EAAMA,OAACyB,OAAO,CACnC5B,EAAOkB,MAAM,EAAG,IAChBnB,EAAU8B,aAENC,EAAWL,EAAQM,OAAOJ,EAAeR,SAAS,QAMxD,GALca,EACZF,EACA9B,EAAOkB,MAAM,GAAI,IACjBrB,EAASoC,OAGT,OAAOC,EAAUH,OAAC/B,EAAOkB,MAAM,EAAG,KAKtC,GAAIZ,GAAQG,IAAQH,EAAM,CACxB,MAAM6B,EAAUnC,EAAOkB,MAAM,EAAGT,GAAKU,SAAS,SAC9C,GAAIrB,IAAWsB,EAAOgB,UAAW,CAC/B,MAAMC,EAAUC,EAAOC,cAAcJ,GACrC,GAAuB,QAAnBE,EAAQG,QAA6C,KAAzBH,EAAQI,MAAMpC,OAC5C,OAAO8B,OAEJ,GAAIrC,IAAWsB,EAAOsB,KAAO5C,IAAWsB,EAAOuB,IAAK,CACzD,MAAMH,EAASL,EAAQjB,MAAM,EAAG,GAC1B0B,EAAMT,EAAQjB,MAAM,GAC1B,GAAe,OAAXsB,GAAsD,KAAnCrC,SAAOS,KAAKgC,EAAK,OAAOvC,OAC7C,OAAO8B,OAEJ,IAAIrC,IAAWsB,EAAOyB,GAAK/C,IAAWsB,EAAO0B,OAC9CC,EAAAA,QAAUZ,GACZ,OAAOA,EAGX,MAAM,IAAIa,EAAuB,gCAGnC,GAAIlD,IAAWsB,EAAOuB,KAAO7C,IAAWsB,EAAOsB,IAC7C,MAAO,KAAO1C,EAAOkB,MAAM,EAAGZ,GAAMa,SAAS,OACxC,GAAIrB,IAAWsB,EAAOgB,UAC3B,OAAOE,EAAOP,OAAO,MAAOO,EAAOW,QAAQjD,EAAOkB,MAAM,EAAGZ,KACtD,GAAIR,IAAWsB,EAAOyB,GAAK/C,IAAWsB,EAAO0B,KAClD,OAAOI,EAAeC,cAAC,IAAInD,EAAOkB,MAAM,EAAGZ,KAAQa,WAC9C,GAAIrB,IAAWsB,EAAOgC,WAC3B,OAAO,IAAIC,EAAUrD,EAAOkB,MAAM,EAAGZ,IAAOa,WAE9C,MAAM,IAAI6B,EAAuB,+BAA+B"}

package/dist/esm/record/getRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{RECORD_V1_SIZE as r}from"../types/record.mjs";import{NameRegistryState as t}from"../state.mjs";import{NoRecordDataError as e}from"../error.mjs";import{getRecordKeySync as o}from"./getRecordKeySync.mjs";import{deserializeRecord as m}from"./deserializeRecord.mjs";async function i(i,s,a,c){const d=o(s,a);let{registry:n}=await t.retrieve(i,d);if(!n.data)throw new e("The record data is empty");if(c)return m(n,a,d);const f=r.get(a);return n.data=n.data.slice(0,f),n}export{i as getRecord};
2	- //# sourceMappingURL=getRecord.mjs.map

package/dist/esm/record/getRecord.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"getRecord.mjs","sources":["../../../src/record/getRecord.ts"],"sourcesContent":[null],"names":["async","getRecord","connection","domain","record","deserialize","pubkey","getRecordKeySync","registry","NameRegistryState","retrieve","data","NoRecordDataError","deserializeRecord","recordSize","RECORD_V1_SIZE","get","slice"],"mappings":"6QA+BOA,eAAeC,EACpBC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAASC,EAAiBJ,EAAQC,GACxC,IAAII,SAAEA,SAAmBC,EAAkBC,SAASR,EAAYI,GAEhE,IAAKE,EAASG,KACZ,MAAM,IAAIC,EAAkB,4BAG9B,GAAIP,EACF,OAAOQ,EAAkBL,EAAUJ,EAAQE,GAE7C,MAAMQ,EAAaC,EAAeC,IAAIZ,GAGtC,OAFAI,EAASG,KAAOH,EAASG,KAAKM,MAAM,EAAGH,GAEhCN,CACT"}

package/dist/esm/record/getRecordKeySync.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{RecordVersion as o}from"../types/record.mjs";import{getDomainKeySync as r}from"../utils/getDomainKeySync.mjs";const t=(t,e)=>{const{pubkey:m}=r(e+"."+t,o.V1);return m};export{t as getRecordKeySync};
2	- //# sourceMappingURL=getRecordKeySync.mjs.map

package/dist/esm/record/getRecordKeySync.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getRecordKeySync.mjs","sources":["../../../src/record/getRecordKeySync.ts"],"sourcesContent":[null],"names":["getRecordKeySync","domain","record","pubkey","getDomainKeySync","RecordVersion","V1"],"mappings":"2HASaA,EAAmB,CAACC,EAAgBC,KAC/C,MAAMC,OAAEA,GAAWC,EAAiBF,EAAS,IAAMD,EAAQI,EAAcC,IACzE,OAAOH,CAAM"}

package/dist/esm/record/getRecords.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{NameRegistryState as r}from"../state.mjs";import{getRecordKeySync as e}from"./getRecordKeySync.mjs";import{deserializeRecord as t}from"./deserializeRecord.mjs";async function m(m,o,i,a){const c=i.map((r=>e(o,r))),n=await r.retrieveBatch(m,c);return a?n.map(((r,m)=>{if(r)return t(r,i[m],e(o,i[m]))})):n}export{m as getRecords};
2	- //# sourceMappingURL=getRecords.mjs.map

package/dist/esm/record/getRecords.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"getRecords.mjs","sources":["../../../src/record/getRecords.ts"],"sourcesContent":[null],"names":["async","getRecords","connection","domain","records","deserialize","pubkeys","map","record","getRecordKeySync","registries","NameRegistryState","retrieveBatch","e","idx","deserializeRecord"],"mappings":"uKAsBOA,eAAeC,EACpBC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAUF,EAAQG,KAAKC,GAAWC,EAAiBN,EAAQK,KAC3DE,QAAmBC,EAAkBC,cAAcV,EAAYI,GAErE,OAAID,EACKK,EAAWH,KAAI,CAACM,EAAGC,KACxB,GAAKD,EACL,OAAOE,EACLF,EACAT,EAAQU,GACRL,EAAiBN,EAAQC,EAAQU,IAClC,IAGEJ,CACT"}

package/dist/esm/record/helpers/getArweaveRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.ARWV,!0);export{m as getArweaveRecord};
2	- //# sourceMappingURL=getArweaveRecord.mjs.map

package/dist/esm/record/helpers/getArweaveRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getArweaveRecord.mjs","sources":["../../../../src/record/helpers/getArweaveRecord.ts"],"sourcesContent":[null],"names":["getArweaveRecord","connection","domain","getRecord","Record","ARWV"],"mappings":"mGAUaA,EAAmB,CAACC,EAAwBC,IAChDC,EAAUF,EAAYC,EAAQE,EAAOC,MAAM"}

package/dist/esm/record/helpers/getBackgroundRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.Background,!0);export{m as getBackgroundRecord};
2	- //# sourceMappingURL=getBackgroundRecord.mjs.map

package/dist/esm/record/helpers/getBackgroundRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getBackgroundRecord.mjs","sources":["../../../../src/record/helpers/getBackgroundRecord.ts"],"sourcesContent":[null],"names":["getBackgroundRecord","connection","domain","getRecord","Record","Background"],"mappings":"mGAWaA,EAAsB,CAACC,EAAwBC,IACnDC,EAAUF,EAAYC,EAAQE,EAAOC,YAAY"}

package/dist/esm/record/helpers/getBackpackRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.Backpack,!0);export{m as getBackpackRecord};
2	- //# sourceMappingURL=getBackpackRecord.mjs.map

package/dist/esm/record/helpers/getBackpackRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getBackpackRecord.mjs","sources":["../../../../src/record/helpers/getBackpackRecord.ts"],"sourcesContent":[null],"names":["getBackpackRecord","connection","domain","getRecord","Record","Backpack"],"mappings":"mGAUaA,EAAoB,CAACC,EAAwBC,IACjDC,EAAUF,EAAYC,EAAQE,EAAOC,UAAU"}

package/dist/esm/record/helpers/getBscRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.BSC,!0);export{m as getBscRecord};
2	- //# sourceMappingURL=getBscRecord.mjs.map

package/dist/esm/record/helpers/getBscRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getBscRecord.mjs","sources":["../../../../src/record/helpers/getBscRecord.ts"],"sourcesContent":[null],"names":["getBscRecord","connection","domain","getRecord","Record","BSC"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC,KAAK"}

package/dist/esm/record/helpers/getBtcRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.BTC,!0);export{m as getBtcRecord};
2	- //# sourceMappingURL=getBtcRecord.mjs.map

package/dist/esm/record/helpers/getBtcRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getBtcRecord.mjs","sources":["../../../../src/record/helpers/getBtcRecord.ts"],"sourcesContent":[null],"names":["getBtcRecord","connection","domain","getRecord","Record","BTC"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC,KAAK"}

package/dist/esm/record/helpers/getDiscordRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.Discord,!0);export{m as getDiscordRecord};
2	- //# sourceMappingURL=getDiscordRecord.mjs.map

package/dist/esm/record/helpers/getDiscordRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getDiscordRecord.mjs","sources":["../../../../src/record/helpers/getDiscordRecord.ts"],"sourcesContent":[null],"names":["getDiscordRecord","connection","domain","getRecord","Record","Discord"],"mappings":"mGAUaA,EAAmB,CAACC,EAAwBC,IAChDC,EAAUF,EAAYC,EAAQE,EAAOC,SAAS"}

package/dist/esm/record/helpers/getDogeRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.DOGE,!0);export{m as getDogeRecord};
2	- //# sourceMappingURL=getDogeRecord.mjs.map

package/dist/esm/record/helpers/getDogeRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getDogeRecord.mjs","sources":["../../../../src/record/helpers/getDogeRecord.ts"],"sourcesContent":[null],"names":["getDogeRecord","connection","domain","getRecord","Record","DOGE"],"mappings":"mGAUaA,EAAgB,CAACC,EAAwBC,IAC7CC,EAAUF,EAAYC,EAAQE,EAAOC,MAAM"}

package/dist/esm/record/helpers/getEmailRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.Email,!0);export{m as getEmailRecord};
2	- //# sourceMappingURL=getEmailRecord.mjs.map

package/dist/esm/record/helpers/getEmailRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getEmailRecord.mjs","sources":["../../../../src/record/helpers/getEmailRecord.ts"],"sourcesContent":[null],"names":["getEmailRecord","connection","domain","getRecord","Record","Email"],"mappings":"mGAUaA,EAAiB,CAACC,EAAwBC,IAC9CC,EAAUF,EAAYC,EAAQE,EAAOC,OAAO"}

package/dist/esm/record/helpers/getEthRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.ETH,!0);export{m as getEthRecord};
2	- //# sourceMappingURL=getEthRecord.mjs.map

package/dist/esm/record/helpers/getEthRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getEthRecord.mjs","sources":["../../../../src/record/helpers/getEthRecord.ts"],"sourcesContent":[null],"names":["getEthRecord","connection","domain","getRecord","Record","ETH"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC,KAAK"}

package/dist/esm/record/helpers/getGithubRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const t=(t,m)=>r(t,m,o.Github,!0);export{t as getGithubRecord};
2	- //# sourceMappingURL=getGithubRecord.mjs.map

package/dist/esm/record/helpers/getGithubRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getGithubRecord.mjs","sources":["../../../../src/record/helpers/getGithubRecord.ts"],"sourcesContent":[null],"names":["getGithubRecord","connection","domain","getRecord","Record","Github"],"mappings":"mGAUaA,EAAkB,CAACC,EAAwBC,IAC/CC,EAAUF,EAAYC,EAAQE,EAAOC,QAAQ"}

package/dist/esm/record/helpers/getInjectiveRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const e=(e,t)=>r(e,t,o.Injective,!0);export{e as getInjectiveRecord};
2	- //# sourceMappingURL=getInjectiveRecord.mjs.map

package/dist/esm/record/helpers/getInjectiveRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getInjectiveRecord.mjs","sources":["../../../../src/record/helpers/getInjectiveRecord.ts"],"sourcesContent":[null],"names":["getInjectiveRecord","connection","domain","getRecord","Record","Injective"],"mappings":"mGAUaA,EAAqB,CAACC,EAAwBC,IAClDC,EAAUF,EAAYC,EAAQE,EAAOC,WAAW"}

package/dist/esm/record/helpers/getIpfsRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.IPFS,!0);export{m as getIpfsRecord};
2	- //# sourceMappingURL=getIpfsRecord.mjs.map

package/dist/esm/record/helpers/getIpfsRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getIpfsRecord.mjs","sources":["../../../../src/record/helpers/getIpfsRecord.ts"],"sourcesContent":[null],"names":["getIpfsRecord","connection","domain","getRecord","Record","IPFS"],"mappings":"mGAUaA,EAAgB,CAACC,EAAwBC,IAC7CC,EAAUF,EAAYC,EAAQE,EAAOC,MAAM"}

package/dist/esm/record/helpers/getLtcRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.LTC,!0);export{m as getLtcRecord};
2	- //# sourceMappingURL=getLtcRecord.mjs.map

package/dist/esm/record/helpers/getLtcRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getLtcRecord.mjs","sources":["../../../../src/record/helpers/getLtcRecord.ts"],"sourcesContent":[null],"names":["getLtcRecord","connection","domain","getRecord","Record","LTC"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC,KAAK"}

package/dist/esm/record/helpers/getPicRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.Pic,!0);export{m as getPicRecord};
2	- //# sourceMappingURL=getPicRecord.mjs.map

package/dist/esm/record/helpers/getPicRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getPicRecord.mjs","sources":["../../../../src/record/helpers/getPicRecord.ts"],"sourcesContent":[null],"names":["getPicRecord","connection","domain","getRecord","Record","Pic"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC,KAAK"}

package/dist/esm/record/helpers/getPointRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.POINT,!0);export{m as getPointRecord};
2	- //# sourceMappingURL=getPointRecord.mjs.map

package/dist/esm/record/helpers/getPointRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getPointRecord.mjs","sources":["../../../../src/record/helpers/getPointRecord.ts"],"sourcesContent":[null],"names":["getPointRecord","connection","domain","getRecord","Record","POINT"],"mappings":"mGAUaA,EAAiB,CAACC,EAAwBC,IAC9CC,EAAUF,EAAYC,EAAQE,EAAOC,OAAO"}

package/dist/esm/record/helpers/getRedditRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const t=(t,e)=>r(t,e,o.Reddit,!0);export{t as getRedditRecord};
2	- //# sourceMappingURL=getRedditRecord.mjs.map

package/dist/esm/record/helpers/getRedditRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getRedditRecord.mjs","sources":["../../../../src/record/helpers/getRedditRecord.ts"],"sourcesContent":[null],"names":["getRedditRecord","connection","domain","getRecord","Record","Reddit"],"mappings":"mGAUaA,EAAkB,CAACC,EAAwBC,IAC/CC,EAAUF,EAAYC,EAAQE,EAAOC,QAAQ"}

package/dist/esm/record/helpers/getShdwRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.SHDW,!0);export{m as getShdwRecord};
2	- //# sourceMappingURL=getShdwRecord.mjs.map

package/dist/esm/record/helpers/getShdwRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getShdwRecord.mjs","sources":["../../../../src/record/helpers/getShdwRecord.ts"],"sourcesContent":[null],"names":["getShdwRecord","connection","domain","getRecord","Record","SHDW"],"mappings":"mGAUaA,EAAgB,CAACC,EAAwBC,IAC7CC,EAAUF,EAAYC,EAAQE,EAAOC,MAAM"}

package/dist/esm/record/helpers/getSolRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as o}from"../../types/record.mjs";import{getRecord as r}from"../getRecord.mjs";const m=(m,t)=>r(m,t,o.SOL);export{m as getSolRecord};
2	- //# sourceMappingURL=getSolRecord.mjs.map

package/dist/esm/record/helpers/getSolRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getSolRecord.mjs","sources":["../../../../src/record/helpers/getSolRecord.ts"],"sourcesContent":[null],"names":["getSolRecord","connection","domain","getRecord","Record","SOL"],"mappings":"mGAUaA,EAAe,CAACC,EAAwBC,IAC5CC,EAAUF,EAAYC,EAAQE,EAAOC"}

package/dist/esm/record/helpers/getTelegramRecord.mjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- import{Record as r}from"../../types/record.mjs";import{getRecord as o}from"../getRecord.mjs";const e=(e,m)=>o(e,m,r.Telegram,!0);export{e as getTelegramRecord};
2	- //# sourceMappingURL=getTelegramRecord.mjs.map

package/dist/esm/record/helpers/getTelegramRecord.mjs.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"getTelegramRecord.mjs","sources":["../../../../src/record/helpers/getTelegramRecord.ts"],"sourcesContent":[null],"names":["getTelegramRecord","connection","domain","getRecord","Record","Telegram"],"mappings":"mGAUaA,EAAoB,CAACC,EAAwBC,IACjDC,EAAUF,EAAYC,EAAQE,EAAOC,UAAU"}