@bonfida/spl-name-service 3.0.0 → 3.0.2

package/dist/instructions/updateInstruction.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"updateInstruction.js","sources":["../../src/instructions/updateInstruction.ts"],"sourcesContent":[null],"names":["nameProgramId","nameAccountKey","offset","input_data","nameUpdateSigner","buffers","Buffer","buffer","from","Int8Array","toBuffer","Numberu32","length","data","concat","keys","pubkey","isSigner","isWritable","TransactionInstruction","programId"],"mappings":"0KAIM,SACJA,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CACdC,EAAMC,OAAAD,OAACE,KAAKC,UAAUD,KAAK,CAAC,KAC5BN,EAAOQ,WACP,IAAIC,YAAUR,EAAWS,QAAQF,WACjCP,GAGIU,EAAOP,EAAAA,OAAAA,OAAOQ,OAAOT,GACrBU,EAAO,CACX,CACEC,OAAQf,EACRgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIC,EAAAA,uBAAuB,CAChCJ,OACAK,UAAWpB,EACXa,QAEJ"}

package/dist/instructions/updateInstruction.mjs

@@ -1,2 +0,0 @@
-import{b as r}from"../index-659366d6.js";import{TransactionInstruction as e}from"@solana/web3.js";import{N as o}from"../int-c471d033.js";import"../error-cb398950.js";function t(t,i,f,n,s){const a=[r.Buffer.from(Int8Array.from([1])),f.toBuffer(),new o(n.length).toBuffer(),n],m=r.Buffer.concat(a);return new e({keys:[{pubkey:i,isSigner:!1,isWritable:!0},{pubkey:s,isSigner:!0,isWritable:!1}],programId:t,data:m})}export{t as updateInstruction};
-//# sourceMappingURL=updateInstruction.mjs.map

package/dist/instructions/updateInstruction.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"updateInstruction.mjs","sources":["../../src/instructions/updateInstruction.ts"],"sourcesContent":[null],"names":["updateInstruction","nameProgramId","nameAccountKey","offset","input_data","nameUpdateSigner","buffers","Buffer","from","Int8Array","toBuffer","Numberu32","length","data","concat","TransactionInstruction","keys","pubkey","isSigner","isWritable","programId"],"mappings":"sKAIM,SAAUA,EACdC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CACdC,EAAMA,OAACC,KAAKC,UAAUD,KAAK,CAAC,KAC5BL,EAAOO,WACP,IAAIC,EAAUP,EAAWQ,QAAQF,WACjCN,GAGIS,EAAON,EAAAA,OAAOO,OAAOR,GAc3B,OAAO,IAAIS,EAAuB,CAChCC,KAdW,CACX,CACEC,OAAQf,EACRgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQZ,EACRa,UAAU,EACVC,YAAY,IAMdC,UAAWnB,EACXY,QAEJ"}

package/dist/int-6ed178d1.js

@@ -1,2 +0,0 @@
-"use strict";var r=require("./index-a036083f.js"),e=require("./error-2ca227a7.js");class t{constructor(r){this.value=BigInt(r)}toBuffer(){const e=r.buffer.Buffer.alloc(4);return e.writeUInt32LE(Number(this.value)),e}static fromBuffer(r){if(4!==r.length)throw new e.InvalidBufferLengthError(`Invalid buffer length: ${r.length}`);const u=BigInt(r.readUInt32LE(0));return new t(u)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}class u{constructor(r){this.value=BigInt(r)}toBuffer(){const e=r.buffer.Buffer.alloc(8);return e.writeBigUInt64LE(this.value),e}static fromBuffer(r){8!==r.length&&new e.U64OverflowError(`Invalid buffer length: ${r.length}`);const t=r.readBigUInt64LE(0);return new u(t)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}exports.Numberu32=t,exports.Numberu64=u;
-//# sourceMappingURL=int-6ed178d1.js.map

package/dist/int-6ed178d1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"int-6ed178d1.js","sources":["../src/int.ts"],"sourcesContent":[null],"names":["Numberu32","constructor","value","this","BigInt","toBuffer","a","Buffer","alloc","writeUInt32LE","Number","fromBuffer","buffer","length","InvalidBufferLengthError","readUInt32LE","toNumber","toString","String","Numberu64","writeBigUInt64LE","U64OverflowError","readBigUInt64LE"],"mappings":"yFAEaA,EAGX,WAAAC,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,OAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEG,cAAcC,OAAOP,KAAKD,QACrBI,CACR,CAKD,iBAAOK,CAAWC,GAChB,GAAsB,IAAlBA,EAAOC,OACT,MAAM,IAAIC,EAAwBA,yBAChC,0BAA0BF,EAAOC,UAIrC,MAAMX,EAAQE,OAAOQ,EAAOG,aAAa,IACzC,OAAO,IAAIf,EAAUE,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB,QAGUiB,EAGX,WAAAlB,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,OAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEc,iBAAiBjB,KAAKD,OACjBI,CACR,CAKD,iBAAOK,CAAWC,GACM,IAAlBA,EAAOC,QACT,IAAIQ,EAAAA,iBAAiB,0BAA0BT,EAAOC,UAGxD,MAAMX,EAAQU,EAAOU,gBAAgB,GACrC,OAAO,IAAIH,EAAUjB,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB"}

package/dist/int-c471d033.js

@@ -1,2 +0,0 @@
-import{b as t}from"./index-659366d6.js";import{g as r,h as e}from"./error-cb398950.js";class n{constructor(t){this.value=BigInt(t)}toBuffer(){const r=t.Buffer.alloc(4);return r.writeUInt32LE(Number(this.value)),r}static fromBuffer(t){if(4!==t.length)throw new r(`Invalid buffer length: ${t.length}`);const e=BigInt(t.readUInt32LE(0));return new n(e)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}class u{constructor(t){this.value=BigInt(t)}toBuffer(){const r=t.Buffer.alloc(8);return r.writeBigUInt64LE(this.value),r}static fromBuffer(t){8!==t.length&&new e(`Invalid buffer length: ${t.length}`);const r=t.readBigUInt64LE(0);return new u(r)}toNumber(){return Number(this.value)}toString(){return String(this.value)}}export{n as N,u as a};
-//# sourceMappingURL=int-c471d033.js.map

package/dist/int-c471d033.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"int-c471d033.js","sources":["../src/int.ts"],"sourcesContent":[null],"names":["Numberu32","constructor","value","this","BigInt","toBuffer","a","Buffer","alloc","writeUInt32LE","Number","fromBuffer","buffer","length","InvalidBufferLengthError","readUInt32LE","toNumber","toString","String","Numberu64","writeBigUInt64LE","U64OverflowError","readBigUInt64LE"],"mappings":"6FAEaA,EAGX,WAAAC,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEG,cAAcC,OAAOP,KAAKD,QACrBI,CACR,CAKD,iBAAOK,CAAWC,GAChB,GAAsB,IAAlBA,EAAOC,OACT,MAAM,IAAIC,EACR,0BAA0BF,EAAOC,UAIrC,MAAMX,EAAQE,OAAOQ,EAAOG,aAAa,IACzC,OAAO,IAAIf,EAAUE,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB,QAGUiB,EAGX,WAAAlB,CAAYC,GACVC,KAAKD,MAAQE,OAAOF,EACrB,CAKD,QAAAG,GACE,MAAMC,EAAIC,EAAAA,OAAOC,MAAM,GAEvB,OADAF,EAAEc,iBAAiBjB,KAAKD,OACjBI,CACR,CAKD,iBAAOK,CAAWC,GACM,IAAlBA,EAAOC,QACT,IAAIQ,EAAiB,0BAA0BT,EAAOC,UAGxD,MAAMX,EAAQU,EAAOU,gBAAgB,GACrC,OAAO,IAAIH,EAAUjB,EACtB,CAED,QAAAc,GACE,OAAON,OAAOP,KAAKD,MACpB,CAED,QAAAe,GACE,OAAOC,OAAOf,KAAKD,MACpB"}

package/dist/ipaddr-1ac723bd.js

@@ -1,3 +0,0 @@
-"use strict";var r=require("./_commonjsHelpers-3d4c1909.js");
-/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function t(...r){const t=r=>r,e=(r,t)=>e=>r(t(e));return{encode:r.map((r=>r.encode)).reduceRight(e,t),decode:r.map((r=>r.decode)).reduce(e,t)}}const e=(r,t)=>t?e(t,r%t):r,n=(r,t)=>r+(t-e(r,t));function o(r,t,e,o){if(!Array.isArray(r))throw new Error("convertRadix2: data should be array");if(t<=0||t>32)throw new Error(`convertRadix2: wrong from=${t}`);if(e<=0||e>32)throw new Error(`convertRadix2: wrong to=${e}`);if(n(t,e)>32)throw new Error(`convertRadix2: carry overflow from=${t} to=${e} carryBits=${n(t,e)}`);let i=0,s=0;const a=2**e-1,c=[];for(const n of r){if(n>=2**t)throw new Error(`convertRadix2: invalid data word=${n} from=${t}`);if(i=i<<t|n,s+t>32)throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);for(s+=t;s>=e;s-=e)c.push((i>>s-e&a)>>>0);i&=2**s-1}if(i=i<<e-s&a,!o&&s>=t)throw new Error("Excess padding");if(!o&&i)throw new Error(`Non-zero padding: ${i}`);return o&&s>0&&c.push(i>>>0),c}function i(r,t=!1){if(r<=0||r>32)throw new Error("radix2: bits should be in (0..32]");if(n(8,r)>32||n(r,8)>32)throw new Error("radix2: carry overflow");return{encode:e=>{if(!((n=e)instanceof Uint8Array||null!=n&&"object"==typeof n&&"Uint8Array"===n.constructor.name))throw new Error("radix2.encode input should be Uint8Array");var n;return o(Array.from(e),8,r,!t)},decode:e=>{if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("radix2.decode input should be array of numbers");return Uint8Array.from(o(e,r,8,t))}}}function s(r){if("function"!=typeof r)throw new Error("unsafeWrapper fn should be function");return function(...t){try{return r.apply(null,t)}catch(r){}}}const a=t(function(r){return{encode:t=>{if(!Array.isArray(t)||t.length&&"number"!=typeof t[0])throw new Error("alphabet.encode input should be an array of numbers");return t.map((t=>{if(t<0||t>=r.length)throw new Error(`Digit index outside alphabet: ${t} (alphabet: ${r.length})`);return r[t]}))},decode:t=>{if(!Array.isArray(t)||t.length&&"string"!=typeof t[0])throw new Error("alphabet.decode input should be array of strings");return t.map((t=>{if("string"!=typeof t)throw new Error(`alphabet.decode: not string element=${t}`);const e=r.indexOf(t);if(-1===e)throw new Error(`Unknown letter: "${t}". Allowed: ${r}`);return e}))}}}("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),function(r=""){if("string"!=typeof r)throw new Error("join separator should be string");return{encode:t=>{if(!Array.isArray(t)||t.length&&"string"!=typeof t[0])throw new Error("join.encode input should be array of strings");for(let r of t)if("string"!=typeof r)throw new Error(`join.encode: non-string input=${r}`);return t.join(r)},decode:t=>{if("string"!=typeof t)throw new Error("join.decode input should be string");return t.split(r)}}}("")),c=[996825010,642813549,513874426,1027748829,705979059];function f(r){const t=r>>25;let e=(33554431&r)<<5;for(let r=0;r<c.length;r++)1==(t>>r&1)&&(e^=c[r]);return e}function u(r,t,e=1){const n=r.length;let i=1;for(let t=0;t<n;t++){const e=r.charCodeAt(t);if(e<33||e>126)throw new Error(`Invalid prefix (${r})`);i=f(i)^e>>5}i=f(i);for(let t=0;t<n;t++)i=f(i)^31&r.charCodeAt(t);for(let r of t)i=f(i)^r;for(let r=0;r<6;r++)i=f(i);return i^=e,a.encode(o([i%2**30],30,5,!1))}function d(r){const t="bech32"===r?1:734539939,e=i(5),n=e.decode,o=e.encode,c=s(n);function f(r,e=90){if("string"!=typeof r)throw new Error("bech32.decode input should be string, not "+typeof r);if(r.length<8||!1!==e&&r.length>e)throw new TypeError(`Wrong string length: ${r.length} (${r}). Expected (8..${e})`);const n=r.toLowerCase();if(r!==n&&r!==r.toUpperCase())throw new Error("String must be lowercase or uppercase");const o=n.lastIndexOf("1");if(0===o||-1===o)throw new Error('Letter "1" must be present between prefix and data only');const i=n.slice(0,o),s=n.slice(o+1);if(s.length<6)throw new Error("Data must be at least 6 characters long");const c=a.decode(s).slice(0,-6),f=u(i,c,t);if(!s.endsWith(f))throw new Error(`Invalid checksum in ${r}: expected "${f}"`);return{prefix:i,words:c}}return{encode:function(r,e,n=90){if("string"!=typeof r)throw new Error("bech32.encode prefix should be string, not "+typeof r);if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("bech32.encode words should be array of numbers, not "+typeof e);if(0===r.length)throw new TypeError(`Invalid prefix length ${r.length}`);const o=r.length+7+e.length;if(!1!==n&&o>n)throw new TypeError(`Length ${o} exceeds limit ${n}`);const i=r.toLowerCase(),s=u(i,e,t);return`${i}1${a.encode(e)}${s}`},decode:f,decodeToBytes:function(r){const{prefix:t,words:e}=f(r,!1);return{prefix:t,words:e,bytes:n(e)}},decodeUnsafe:s(f),fromWords:n,fromWordsUnsafe:c,toWords:o}}const p=d("bech32"),h=2147483647,l=36,w={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},g=Math.floor,I=String.fromCharCode;function v(r){throw new RangeError(w[r])}const y=function(r,t){return r+22+75*(r<26)-((0!=t)<<5)},m=function(r,t,e){let n=0;for(r=e?g(r/700):r>>1,r+=g(r/t);r>455;n+=l)r=g(r/35);return g(n+36*r/(r+38))};var $,b={exports:{}};$=b,function(r){const t="(0?\\d+|0x[a-f0-9]+)",e={fourOctet:new RegExp(`^${t}\\.${t}\\.${t}\\.${t}$`,"i"),threeOctet:new RegExp(`^${t}\\.${t}\\.${t}$`,"i"),twoOctet:new RegExp(`^${t}\\.${t}$`,"i"),longValue:new RegExp(`^${t}$`,"i")},n=new RegExp("^0[0-7]+$","i"),o=new RegExp("^0x[a-f0-9]+$","i"),i="%[0-9a-z]{1,}",s="(?:[0-9a-f]+::?)+",a={zoneIndex:new RegExp(i,"i"),native:new RegExp(`^(::)?(${s})?([0-9a-f]+)?(::)?(${i})?$`,"i"),deprecatedTransitional:new RegExp(`^(?:::)(${t}\\.${t}\\.${t}\\.${t}(${i})?)$`,"i"),transitional:new RegExp(`^((?:${s})|(?:::)(?:${s})?)${t}\\.${t}\\.${t}\\.${t}(${i})?$`,"i")};function c(r,t){if(r.indexOf("::")!==r.lastIndexOf("::"))return null;let e,n,o=0,i=-1,s=(r.match(a.zoneIndex)||[])[0];for(s&&(s=s.substring(1),r=r.replace(/%.+$/,""));(i=r.indexOf(":",i+1))>=0;)o++;if("::"===r.substr(0,2)&&o--,"::"===r.substr(-2,2)&&o--,o>t)return null;for(n=t-o,e=":";n--;)e+="0:";return":"===(r=r.replace("::",e))[0]&&(r=r.slice(1)),":"===r[r.length-1]&&(r=r.slice(0,-1)),{parts:t=function(){const t=r.split(":"),e=[];for(let r=0;r<t.length;r++)e.push(parseInt(t[r],16));return e}(),zoneId:s}}function f(r,t,e,n){if(r.length!==t.length)throw new Error("ipaddr: cannot match CIDR for objects with different lengths");let o,i=0;for(;n>0;){if(o=e-n,o<0&&(o=0),r[i]>>o!=t[i]>>o)return!1;n-=e,i+=1}return!0}function u(r){if(o.test(r))return parseInt(r,16);if("0"===r[0]&&!isNaN(parseInt(r[1],10))){if(n.test(r))return parseInt(r,8);throw new Error(`ipaddr: cannot parse ${r} as octal`)}return parseInt(r,10)}function d(r,t){for(;r.length<t;)r=`0${r}`;return r}const p={};p.IPv4=function(){function r(r){if(4!==r.length)throw new Error("ipaddr: ipv4 octet count should be 4");let t,e;for(t=0;t<r.length;t++)if(e=r[t],!(0<=e&&e<=255))throw new Error("ipaddr: ipv4 octet should fit in 8 bits");this.octets=r}return r.prototype.SpecialRanges={unspecified:[[new r([0,0,0,0]),8]],broadcast:[[new r([255,255,255,255]),32]],multicast:[[new r([224,0,0,0]),4]],linkLocal:[[new r([169,254,0,0]),16]],loopback:[[new r([127,0,0,0]),8]],carrierGradeNat:[[new r([100,64,0,0]),10]],private:[[new r([10,0,0,0]),8],[new r([172,16,0,0]),12],[new r([192,168,0,0]),16]],reserved:[[new r([192,0,0,0]),24],[new r([192,0,2,0]),24],[new r([192,88,99,0]),24],[new r([198,18,0,0]),15],[new r([198,51,100,0]),24],[new r([203,0,113,0]),24],[new r([240,0,0,0]),4]],as112:[[new r([192,175,48,0]),24],[new r([192,31,196,0]),24]],amt:[[new r([192,52,193,0]),24]]},r.prototype.kind=function(){return"ipv4"},r.prototype.match=function(r,t){let e;if(void 0===t&&(e=r,r=e[0],t=e[1]),"ipv4"!==r.kind())throw new Error("ipaddr: cannot match ipv4 address with non-ipv4 one");return f(this.octets,r.octets,8,t)},r.prototype.prefixLengthFromSubnetMask=function(){let r=0,t=!1;const e={0:8,128:7,192:6,224:5,240:4,248:3,252:2,254:1,255:0};let n,o,i;for(n=3;n>=0;n-=1){if(o=this.octets[n],!(o in e))return null;if(i=e[o],t&&0!==i)return null;8!==i&&(t=!0),r+=i}return 32-r},r.prototype.range=function(){return p.subnetMatch(this,this.SpecialRanges)},r.prototype.toByteArray=function(){return this.octets.slice(0)},r.prototype.toIPv4MappedAddress=function(){return p.IPv6.parse(`::ffff:${this.toString()}`)},r.prototype.toNormalizedString=function(){return this.toString()},r.prototype.toString=function(){return this.octets.join(".")},r}(),p.IPv4.broadcastAddressFromCIDR=function(r){try{const t=this.parseCIDR(r),e=t[0].toByteArray(),n=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[];let i=0;for(;i<4;)o.push(parseInt(e[i],10)|255^parseInt(n[i],10)),i++;return new this(o)}catch(r){throw new Error("ipaddr: the address does not have IPv4 CIDR format")}},p.IPv4.isIPv4=function(r){return null!==this.parser(r)},p.IPv4.isValid=function(r){try{return new this(this.parser(r)),!0}catch(r){return!1}},p.IPv4.isValidCIDR=function(r){try{return this.parseCIDR(r),!0}catch(r){return!1}},p.IPv4.isValidFourPartDecimal=function(r){return!(!p.IPv4.isValid(r)||!r.match(/^(0|[1-9]\d*)(\.(0|[1-9]\d*)){3}$/))},p.IPv4.networkAddressFromCIDR=function(r){let t,e,n,o,i;try{for(t=this.parseCIDR(r),n=t[0].toByteArray(),i=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[],e=0;e<4;)o.push(parseInt(n[e],10)&parseInt(i[e],10)),e++;return new this(o)}catch(r){throw new Error("ipaddr: the address does not have IPv4 CIDR format")}},p.IPv4.parse=function(r){const t=this.parser(r);if(null===t)throw new Error("ipaddr: string is not formatted like an IPv4 Address");return new this(t)},p.IPv4.parseCIDR=function(r){let t;if(t=r.match(/^(.+)\/(\d+)$/)){const r=parseInt(t[2]);if(r>=0&&r<=32){const e=[this.parse(t[1]),r];return Object.defineProperty(e,"toString",{value:function(){return this.join("/")}}),e}}throw new Error("ipaddr: string is not formatted like an IPv4 CIDR range")},p.IPv4.parser=function(r){let t,n,o;if(t=r.match(e.fourOctet))return function(){const r=t.slice(1,6),e=[];for(let t=0;t<r.length;t++)n=r[t],e.push(u(n));return e}();if(t=r.match(e.longValue)){if(o=u(t[1]),o>4294967295||o<0)throw new Error("ipaddr: address outside defined range");return function(){const r=[];let t;for(t=0;t<=24;t+=8)r.push(o>>t&255);return r}().reverse()}return(t=r.match(e.twoOctet))?function(){const r=t.slice(1,4),e=[];if(o=u(r[1]),o>16777215||o<0)throw new Error("ipaddr: address outside defined range");return e.push(u(r[0])),e.push(o>>16&255),e.push(o>>8&255),e.push(255&o),e}():(t=r.match(e.threeOctet))?function(){const r=t.slice(1,5),e=[];if(o=u(r[2]),o>65535||o<0)throw new Error("ipaddr: address outside defined range");return e.push(u(r[0])),e.push(u(r[1])),e.push(o>>8&255),e.push(255&o),e}():null},p.IPv4.subnetMaskFromPrefixLength=function(r){if((r=parseInt(r))<0||r>32)throw new Error("ipaddr: invalid IPv4 prefix length");const t=[0,0,0,0];let e=0;const n=Math.floor(r/8);for(;e<n;)t[e]=255,e++;return n<4&&(t[n]=Math.pow(2,r%8)-1<<8-r%8),new this(t)},p.IPv6=function(){function r(r,t){let e,n;if(16===r.length)for(this.parts=[],e=0;e<=14;e+=2)this.parts.push(r[e]<<8|r[e+1]);else{if(8!==r.length)throw new Error("ipaddr: ipv6 part count should be 8 or 16");this.parts=r}for(e=0;e<this.parts.length;e++)if(n=this.parts[e],!(0<=n&&n<=65535))throw new Error("ipaddr: ipv6 part should fit in 16 bits");t&&(this.zoneId=t)}return r.prototype.SpecialRanges={unspecified:[new r([0,0,0,0,0,0,0,0]),128],linkLocal:[new r([65152,0,0,0,0,0,0,0]),10],multicast:[new r([65280,0,0,0,0,0,0,0]),8],loopback:[new r([0,0,0,0,0,0,0,1]),128],uniqueLocal:[new r([64512,0,0,0,0,0,0,0]),7],ipv4Mapped:[new r([0,0,0,0,0,65535,0,0]),96],discard:[new r([256,0,0,0,0,0,0,0]),64],rfc6145:[new r([0,0,0,0,65535,0,0,0]),96],rfc6052:[new r([100,65435,0,0,0,0,0,0]),96],"6to4":[new r([8194,0,0,0,0,0,0,0]),16],teredo:[new r([8193,0,0,0,0,0,0,0]),32],benchmarking:[new r([8193,2,0,0,0,0,0,0]),48],amt:[new r([8193,3,0,0,0,0,0,0]),32],as112v6:[[new r([8193,4,274,0,0,0,0,0]),48],[new r([9760,79,32768,0,0,0,0,0]),48]],deprecated:[new r([8193,16,0,0,0,0,0,0]),28],orchid2:[new r([8193,32,0,0,0,0,0,0]),28],droneRemoteIdProtocolEntityTags:[new r([8193,48,0,0,0,0,0,0]),28],reserved:[[new r([8193,0,0,0,0,0,0,0]),23],[new r([8193,3512,0,0,0,0,0,0]),32]]},r.prototype.isIPv4MappedAddress=function(){return"ipv4Mapped"===this.range()},r.prototype.kind=function(){return"ipv6"},r.prototype.match=function(r,t){let e;if(void 0===t&&(e=r,r=e[0],t=e[1]),"ipv6"!==r.kind())throw new Error("ipaddr: cannot match ipv6 address with non-ipv6 one");return f(this.parts,r.parts,16,t)},r.prototype.prefixLengthFromSubnetMask=function(){let r=0,t=!1;const e={0:16,32768:15,49152:14,57344:13,61440:12,63488:11,64512:10,65024:9,65280:8,65408:7,65472:6,65504:5,65520:4,65528:3,65532:2,65534:1,65535:0};let n,o;for(let i=7;i>=0;i-=1){if(n=this.parts[i],!(n in e))return null;if(o=e[n],t&&0!==o)return null;16!==o&&(t=!0),r+=o}return 128-r},r.prototype.range=function(){return p.subnetMatch(this,this.SpecialRanges)},r.prototype.toByteArray=function(){let r;const t=[],e=this.parts;for(let n=0;n<e.length;n++)r=e[n],t.push(r>>8),t.push(255&r);return t},r.prototype.toFixedLengthString=function(){const r=function(){const r=[];for(let t=0;t<this.parts.length;t++)r.push(d(this.parts[t].toString(16),4));return r}.call(this).join(":");let t="";return this.zoneId&&(t=`%${this.zoneId}`),r+t},r.prototype.toIPv4Address=function(){if(!this.isIPv4MappedAddress())throw new Error("ipaddr: trying to convert a generic ipv6 address to ipv4");const r=this.parts.slice(-2),t=r[0],e=r[1];return new p.IPv4([t>>8,255&t,e>>8,255&e])},r.prototype.toNormalizedString=function(){const r=function(){const r=[];for(let t=0;t<this.parts.length;t++)r.push(this.parts[t].toString(16));return r}.call(this).join(":");let t="";return this.zoneId&&(t=`%${this.zoneId}`),r+t},r.prototype.toRFC5952String=function(){const r=/((^|:)(0(:|$)){2,})/g,t=this.toNormalizedString();let e,n=0,o=-1;for(;e=r.exec(t);)e[0].length>o&&(n=e.index,o=e[0].length);return o<0?t:`${t.substring(0,n)}::${t.substring(n+o)}`},r.prototype.toString=function(){return this.toRFC5952String()},r}(),p.IPv6.broadcastAddressFromCIDR=function(r){try{const t=this.parseCIDR(r),e=t[0].toByteArray(),n=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[];let i=0;for(;i<16;)o.push(parseInt(e[i],10)|255^parseInt(n[i],10)),i++;return new this(o)}catch(r){throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${r})`)}},p.IPv6.isIPv6=function(r){return null!==this.parser(r)},p.IPv6.isValid=function(r){if("string"==typeof r&&-1===r.indexOf(":"))return!1;try{const t=this.parser(r);return new this(t.parts,t.zoneId),!0}catch(r){return!1}},p.IPv6.isValidCIDR=function(r){if("string"==typeof r&&-1===r.indexOf(":"))return!1;try{return this.parseCIDR(r),!0}catch(r){return!1}},p.IPv6.networkAddressFromCIDR=function(r){let t,e,n,o,i;try{for(t=this.parseCIDR(r),n=t[0].toByteArray(),i=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[],e=0;e<16;)o.push(parseInt(n[e],10)&parseInt(i[e],10)),e++;return new this(o)}catch(r){throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${r})`)}},p.IPv6.parse=function(r){const t=this.parser(r);if(null===t.parts)throw new Error("ipaddr: string is not formatted like an IPv6 Address");return new this(t.parts,t.zoneId)},p.IPv6.parseCIDR=function(r){let t,e,n;if((e=r.match(/^(.+)\/(\d+)$/))&&(t=parseInt(e[2]),t>=0&&t<=128))return n=[this.parse(e[1]),t],Object.defineProperty(n,"toString",{value:function(){return this.join("/")}}),n;throw new Error("ipaddr: string is not formatted like an IPv6 CIDR range")},p.IPv6.parser=function(r){let t,e,n,o,i,s;if(n=r.match(a.deprecatedTransitional))return this.parser(`::ffff:${n[1]}`);if(a.native.test(r))return c(r,8);if((n=r.match(a.transitional))&&(s=n[6]||"",t=n[1],n[1].endsWith("::")||(t=t.slice(0,-1)),t=c(t+s,6),t.parts)){for(i=[parseInt(n[2]),parseInt(n[3]),parseInt(n[4]),parseInt(n[5])],e=0;e<i.length;e++)if(o=i[e],!(0<=o&&o<=255))return null;return t.parts.push(i[0]<<8|i[1]),t.parts.push(i[2]<<8|i[3]),{parts:t.parts,zoneId:t.zoneId}}return null},p.IPv6.subnetMaskFromPrefixLength=function(r){if((r=parseInt(r))<0||r>128)throw new Error("ipaddr: invalid IPv6 prefix length");const t=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];let e=0;const n=Math.floor(r/8);for(;e<n;)t[e]=255,e++;return n<16&&(t[n]=Math.pow(2,r%8)-1<<8-r%8),new this(t)},p.fromByteArray=function(r){const t=r.length;if(4===t)return new p.IPv4(r);if(16===t)return new p.IPv6(r);throw new Error("ipaddr: the binary input is neither an IPv6 nor IPv4 address")},p.isValid=function(r){return p.IPv6.isValid(r)||p.IPv4.isValid(r)},p.isValidCIDR=function(r){return p.IPv6.isValidCIDR(r)||p.IPv4.isValidCIDR(r)},p.parse=function(r){if(p.IPv6.isValid(r))return p.IPv6.parse(r);if(p.IPv4.isValid(r))return p.IPv4.parse(r);throw new Error("ipaddr: the address has neither IPv6 nor IPv4 format")},p.parseCIDR=function(r){try{return p.IPv6.parseCIDR(r)}catch(t){try{return p.IPv4.parseCIDR(r)}catch(r){throw new Error("ipaddr: the address has neither IPv6 nor IPv4 CIDR format")}}},p.process=function(r){const t=this.parse(r);return"ipv6"===t.kind()&&t.isIPv4MappedAddress()?t.toIPv4Address():t},p.subnetMatch=function(r,t,e){let n,o,i,s;for(o in null==e&&(e="unicast"),t)if(Object.prototype.hasOwnProperty.call(t,o))for(i=t[o],!i[0]||i[0]instanceof Array||(i=[i]),n=0;n<i.length;n++)if(s=i[n],r.kind()===s[0].kind()&&r.match.apply(r,s))return o;return e},$.exports?$.exports=p:r.ipaddr=p}(r.commonjsGlobal);var E=b.exports;exports.bech32=p,exports.decode=function(r){const t=[],e=r.length;let n=0,o=128,i=72,s=r.lastIndexOf("-");s<0&&(s=0);for(let e=0;e<s;++e)r.charCodeAt(e)>=128&&v("not-basic"),t.push(r.charCodeAt(e));for(let c=s>0?s+1:0;c<e;){const s=n;for(let t=1,o=l;;o+=l){c>=e&&v("invalid-input");const s=(a=r.charCodeAt(c++))>=48&&a<58?a-48+26:a>=65&&a<91?a-65:a>=97&&a<123?a-97:l;s>=l&&v("invalid-input"),s>g((h-n)/t)&&v("overflow"),n+=s*t;const f=o<=i?1:o>=i+26?26:o-i;if(s<f)break;const u=l-f;t>g(h/u)&&v("overflow"),t*=u}const f=t.length+1;i=m(n-s,f,0==s),g(n/f)>h-o&&v("overflow"),o+=g(n/f),n%=f,t.splice(n++,0,o)}var a;return String.fromCodePoint(...t)},exports.encode=function(r){const t=[];r=function(r){const t=[];let e=0;const n=r.length;for(;e<n;){const o=r.charCodeAt(e++);if(o>=55296&&o<=56319&&e<n){const n=r.charCodeAt(e++);56320==(64512&n)?t.push(((1023&o)<<10)+(1023&n)+65536):(t.push(o),e--)}else t.push(o)}return t}(r);const e=r.length;let n=128,o=0,i=72;for(const e of r)e<128&&t.push(I(e));const s=t.length;let a=s;for(s&&t.push("-");a<e;){let e=h;for(const t of r)t>=n&&t<e&&(e=t);const c=a+1;e-n>g((h-o)/c)&&v("overflow"),o+=(e-n)*c,n=e;for(const e of r)if(e<n&&++o>h&&v("overflow"),e===n){let r=o;for(let e=l;;e+=l){const n=e<=i?1:e>=i+26?26:e-i;if(r<n)break;const o=r-n,s=l-n;t.push(I(y(n+o%s,0))),r=g(o/s)}t.push(I(y(r,0))),i=m(o,c,a===s),o=0,++a}++o,++n}return t.join("")},exports.ipaddrExports=E;
-//# sourceMappingURL=ipaddr-1ac723bd.js.map

package/dist/ipaddr-1ac723bd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ipaddr-1ac723bd.js","sources":["../node_modules/@scure/base/lib/esm/index.js","../node_modules/punycode/punycode.es6.js","../node_modules/ipaddr.js/lib/ipaddr.js"],"sourcesContent":["/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain(...args) {\n    const id = (a) => a;\n    // Wrap call in closure so JIT can inline calls\n    const wrap = (a, b) => (c) => a(b(c));\n    // Construct chain of args[-1].encode(args[-2].encode([...]))\n    const encode = args.map((x) => x.encode).reduceRight(wrap, id);\n    // Construct chain of args[0].decode(args[1].decode(...))\n    const decode = args.map((x) => x.decode).reduce(wrap, id);\n    return { encode, decode };\n}\n/**\n * Encodes integer radix representation to array of strings using alphabet and back\n * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\n/**\n * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\n */\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\n/**\n * Slow: O(n^2) time complexity\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix(data, from, to) {\n    // base 1 is impossible\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            const rounded = Math.floor(digitBase / to);\n            digits[i] = rounded;\n            if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!rounded)\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = /* @__NO_SIDE_EFFECTS__ */ (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = /*@__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));\n/**\n * Implemented with numbers, because BigInt is 5x slower\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\n    }\n    let carry = 0;\n    let pos = 0; // bitwise position in current element\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        carry &= 2 ** pos - 1; // clean carry, otherwise it will cause overflow\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!isBytes(bytes))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\n/**\n * If both bases are power of same number (like `2**8 <-> 2**64`),\n * there is a linear algorithm. For now we have implementation for power-of-two bases only.\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix2(bits, revPadding = false) {\n    assertNumber(bits);\n    if (bits <= 0 || bits > 32)\n        throw new Error('radix2: bits should be in (0..32]');\n    if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n        throw new Error('radix2: carry overflow');\n    return {\n        encode: (bytes) => {\n            if (!isBytes(bytes))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!isBytes(data))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!isBytes(data))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-len);\n            for (let i = 0; i < len; i++)\n                if (newChecksum[i] !== oldChecksum[i])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\n// prettier-ignore\nexport const utils = {\n    alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n// RFC 4648 aka RFC 3548\n// ---------------------\nexport const base16 = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = /* @__PURE__ */ chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64nopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), join(''));\nexport const base64url = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nexport const base64urlnopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), join(''));\n// base58 code\n// -----------\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = /* @__PURE__ */ genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = /* @__PURE__ */ genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = /* @__PURE__ */ genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\n// xmr ver is done in 8-byte blocks (which equals 11 chars in decoding). Last (non-full) block padded with '1' to size in XMR_BLOCK_LEN.\n// Block encoding significantly reduces quadratic complexity of base58.\n// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexport const base58xmr = {\n    encode(data) {\n        let res = '';\n        for (let i = 0; i < data.length; i += 8) {\n            const block = data.subarray(i, i + 8);\n            res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length], '1');\n        }\n        return res;\n    },\n    decode(str) {\n        let res = [];\n        for (let i = 0; i < str.length; i += 11) {\n            const slice = str.slice(i, i + 11);\n            const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n            const block = base58.decode(slice);\n            for (let j = 0; j < block.length - blockLen; j++) {\n                if (block[j] !== 0)\n                    throw new Error('base58xmr: wrong padding');\n            }\n            res = res.concat(Array.from(block.slice(block.length - blockLen)));\n        }\n        return Uint8Array.from(res);\n    },\n};\nexport const createBase58check = /* @__PURE__ */ (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\n// legacy export, bad name\nexport const base58check = createBase58check;\nconst BECH_ALPHABET = /* @__PURE__ */ chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction bech32Polymod(pre) {\n    const b = pre >> 25;\n    let chk = (pre & 0x1ffffff) << 5;\n    for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n        if (((b >> i) & 1) === 1)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction bechChecksum(prefix, words, encodingConst = 1) {\n    const len = prefix.length;\n    let chk = 1;\n    for (let i = 0; i < len; i++) {\n        const c = prefix.charCodeAt(i);\n        if (c < 33 || c > 126)\n            throw new Error(`Invalid prefix (${prefix})`);\n        chk = bech32Polymod(chk) ^ (c >> 5);\n    }\n    chk = bech32Polymod(chk);\n    for (let i = 0; i < len; i++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction genBech32(encoding) {\n    const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n    const _words = radix2(5);\n    const fromWords = _words.decode;\n    const toWords = _words.encode;\n    const fromWordsUnsafe = unsafeWrapper(fromWords);\n    function encode(prefix, words, limit = 90) {\n        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        if (prefix.length === 0)\n            throw new TypeError(`Invalid prefix length ${prefix.length}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        const lowered = prefix.toLowerCase();\n        const sum = bechChecksum(lowered, words, ENCODING_CONST);\n        return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        // don't allow mixed case\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        const sepIndex = lowered.lastIndexOf('1');\n        if (sepIndex === 0 || sepIndex === -1)\n            throw new Error(`Letter \"1\" must be present between prefix and data only`);\n        const prefix = lowered.slice(0, sepIndex);\n        const data = lowered.slice(sepIndex + 1);\n        if (data.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(data).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!data.endsWith(sum))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = /* @__PURE__ */ genBech32('bech32');\nexport const bech32m = /* @__PURE__ */ genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\n// prettier-ignore\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!isBytes(bytes))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString; // as in python, but for bytes only\nexport const stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\nexport const bytes = stringToBytes;\n//# sourceMappingURL=index.js.map","'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","(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":["chain","args","id","a","wrap","b","c","encode","map","x","reduceRight","decode","reduce","gcd","radix2carry","from","to","convertRadix2","data","padding","Array","isArray","Error","carry","pos","mask","res","n","push","radix2","bits","revPadding","bytes","Uint8Array","constructor","name","digits","length","unsafeWrapper","fn","apply","e","BECH_ALPHABET","alphabet","i","input","letter","index","indexOf","separator","join","split","POLYMOD_GENERATORS","bech32Polymod","pre","chk","bechChecksum","prefix","words","encodingConst","len","charCodeAt","v","genBech32","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","str","limit","TypeError","lowered","toLowerCase","toUpperCase","sepIndex","lastIndexOf","slice","sum","endsWith","actualLength","decodeToBytes","decodeUnsafe","bech32","maxInt","base","errors","overflow","floor","Math","stringFromCharCode","String","fromCharCode","error","type","RangeError","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","k","baseMinusTMin","root","ipv4Part","ipv4Regexes","fourOctet","RegExp","threeOctet","twoOctet","longValue","octalRegex","hexRegex","zoneIndex","ipv6Part","ipv6Regexes","native","deprecatedTransitional","transitional","expandIPv6","string","parts","replacement","replacementCount","colonCount","lastColon","zoneId","match","substring","replace","substr","ref","results","parseInt","matchCIDR","first","second","partSize","cidrBits","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","broadcastAddressFromCIDR","parseCIDR","ipInterfaceOctets","subnetMaskOctets","subnetMaskFromPrefixLength","isIPv4","parser","isValid","isValidCIDR","isValidFourPartDecimal","networkAddressFromCIDR","maskLength","parsed","Object","defineProperty","value","reverse","j","filledOctetCount","pow","uniqueLocal","ipv4Mapped","discard","rfc6145","rfc6052","teredo","benchmarking","as112v6","deprecated","orchid2","droneRemoteIdProtocolEntityTags","isIPv4MappedAddress","toFixedLengthString","addr","call","suffix","toIPv4Address","high","low","toRFC5952String","regex","bestMatchIndex","bestMatchLength","exec","isIPv6","fromByteArray","e2","process","address","rangeList","defaultName","rangeName","rangeSubnets","subnet","hasOwnProperty","module","exports","commonjsGlobal","output","inputLength","bias","basic","oldi","w","codePoint","t","baseMinusT","out","splice","fromCodePoint","counter","extra","ucs2decode","currentValue","basicLength","handledCPCount","m","handledCPCountPlusOne","q","qMinusT"],"mappings":";oEAgBA,SAASA,KAASC,GACd,MAAMC,EAAMC,GAAMA,EAEZC,EAAOA,CAACD,EAAGE,IAAOC,GAAMH,EAAEE,EAAEC,IAKlC,MAAO,CAAEC,OAHMN,EAAKO,KAAKC,GAAMA,EAAEF,SAAQG,YAAYN,EAAMF,GAG1CS,OADFV,EAAKO,KAAKC,GAAMA,EAAEE,SAAQC,OAAOR,EAAMF,GAE1D,CAsJA,MAAMW,EAAiCA,CAACV,EAAGE,IAAQA,EAAQQ,EAAIR,EAAGF,EAAIE,GAAfF,EACjDW,EAAwCA,CAACC,EAAMC,IAAOD,GAAQC,EAAKH,EAAIE,EAAMC,IAKnF,SAASC,EAAcC,EAAMH,EAAMC,EAAIG,GACnC,IAAKC,MAAMC,QAAQH,GACf,MAAM,IAAII,MAAM,uCACpB,GAAIP,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAIO,MAAO,6BAA4BP,KACjD,GAAIC,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAIM,MAAO,2BAA0BN,KAC/C,GAAIF,EAAYC,EAAMC,GAAM,GACxB,MAAM,IAAIM,MAAO,sCAAqCP,QAAWC,eAAgBF,EAAYC,EAAMC,MAEvG,IAAIO,EAAQ,EACRC,EAAM,EACV,MAAMC,EAAO,GAAKT,EAAK,EACjBU,EAAM,GACZ,IAAK,MAAMC,KAAKT,EAAM,CAElB,GAAIS,GAAK,GAAKZ,EACV,MAAM,IAAIO,MAAO,oCAAmCK,UAAUZ,KAElE,GADAQ,EAASA,GAASR,EAAQY,EACtBH,EAAMT,EAAO,GACb,MAAM,IAAIO,MAAO,qCAAoCE,UAAYT,KAErE,IADAS,GAAOT,EACAS,GAAOR,EAAIQ,GAAOR,EACrBU,EAAIE,MAAOL,GAAUC,EAAMR,EAAOS,KAAU,GAChDF,GAAS,GAAKC,EAAM,CACxB,CAEA,GADAD,EAASA,GAAUP,EAAKQ,EAAQC,GAC3BN,GAAWK,GAAOT,EACnB,MAAM,IAAIO,MAAM,kBACpB,IAAKH,GAAWI,EACZ,MAAM,IAAID,MAAO,qBAAoBC,KAGzC,OAFIJ,GAAWK,EAAM,GACjBE,EAAIE,KAAKL,IAAU,GAChBG,CACX,CAwBA,SAASG,EAAOC,EAAMC,GAAa,GAE/B,GAAID,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAIR,MAAM,qCACpB,GAAIR,EAAY,EAAGgB,GAAQ,IAAMhB,EAAYgB,EAAM,GAAK,GACpD,MAAM,IAAIR,MAAM,0BACpB,MAAO,CACHf,OAASyB,IACL,MA9OK7B,EA8OQ6B,aA7OAC,YACX,MAAL9B,GAA0B,iBAANA,GAAyC,eAAvBA,EAAE+B,YAAYC,MA6O7C,MAAM,IAAIb,MAAM,4CA/OhC,IAAiBnB,EAgPL,OAAOc,EAAcG,MAAML,KAAKiB,GAAQ,EAAGF,GAAOC,EAAW,EAEjEpB,OAASyB,IACL,IAAKhB,MAAMC,QAAQe,IAAYA,EAAOC,QAA+B,iBAAdD,EAAO,GAC1D,MAAM,IAAId,MAAM,kDACpB,OAAOW,WAAWlB,KAAKE,EAAcmB,EAAQN,EAAM,EAAGC,GAAY,EAG9E,CAIA,SAASO,EAAcC,GACnB,GAAkB,mBAAPA,EACP,MAAM,IAAIjB,MAAM,uCACpB,OAAO,YAAarB,GAChB,IACI,OAAOsC,EAAGC,MAAM,KAAMvC,EAC1B,CACA,MAAOwC,GAAK,EAEpB,CAkFA,MAAMC,EAAgC1C,EAlUtC,SAAkB2C,GACd,MAAO,CACHpC,OAAS6B,IACL,IAAKhB,MAAMC,QAAQe,IAAYA,EAAOC,QAA+B,iBAAdD,EAAO,GAC1D,MAAM,IAAId,MAAM,uDACpB,OAAOc,EAAO5B,KAAKoC,IAEf,GAAIA,EAAI,GAAKA,GAAKD,EAASN,OACvB,MAAM,IAAIf,MAAO,iCAAgCsB,gBAAgBD,EAASN,WAC9E,OAAOM,EAASC,EAAE,GACpB,EAENjC,OAASkC,IACL,IAAKzB,MAAMC,QAAQwB,IAAWA,EAAMR,QAA8B,iBAAbQ,EAAM,GACvD,MAAM,IAAIvB,MAAM,oDACpB,OAAOuB,EAAMrC,KAAKsC,IACd,GAAsB,iBAAXA,EACP,MAAM,IAAIxB,MAAO,uCAAsCwB,KAC3D,MAAMC,EAAQJ,EAASK,QAAQF,GAC/B,IAAe,IAAXC,EACA,MAAM,IAAIzB,MAAO,oBAAmBwB,gBAAqBH,KAC7D,OAAOI,CAAK,GACd,EAGd,CAyS4CJ,CAAS,oCArSrD,SAAcM,EAAY,IACtB,GAAyB,iBAAdA,EACP,MAAM,IAAI3B,MAAM,mCACpB,MAAO,CACHf,OAASQ,IACL,IAAKK,MAAMC,QAAQN,IAAUA,EAAKsB,QAA6B,iBAAZtB,EAAK,GACpD,MAAM,IAAIO,MAAM,gDACpB,IAAK,IAAIsB,KAAK7B,EACV,GAAiB,iBAAN6B,EACP,MAAM,IAAItB,MAAO,iCAAgCsB,KACzD,OAAO7B,EAAKmC,KAAKD,EAAU,EAE/BtC,OAASK,IACL,GAAkB,iBAAPA,EACP,MAAM,IAAIM,MAAM,sCACpB,OAAON,EAAGmC,MAAMF,EAAU,EAGtC,CAmR0FC,CAAK,KACzFE,EAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,WAI5E,SAASC,EAAcC,GACnB,MAAMjD,EAAIiD,GAAO,GACjB,IAAIC,GAAa,SAAND,IAAoB,EAC/B,IAAK,IAAIV,EAAI,EAAGA,EAAIQ,EAAmBf,OAAQO,IACpB,IAAjBvC,GAAKuC,EAAK,KACZW,GAAOH,EAAmBR,IAElC,OAAOW,CACX,CAIA,SAASC,EAAaC,EAAQC,EAAOC,EAAgB,GACjD,MAAMC,EAAMH,EAAOpB,OACnB,IAAIkB,EAAM,EACV,IAAK,IAAIX,EAAI,EAAGA,EAAIgB,EAAKhB,IAAK,CAC1B,MAAMtC,EAAImD,EAAOI,WAAWjB,GAC5B,GAAItC,EAAI,IAAMA,EAAI,IACd,MAAM,IAAIgB,MAAO,mBAAkBmC,MACvCF,EAAMF,EAAcE,GAAQjD,GAAK,CACrC,CACAiD,EAAMF,EAAcE,GACpB,IAAK,IAAIX,EAAI,EAAGA,EAAIgB,EAAKhB,IACrBW,EAAMF,EAAcE,GAA+B,GAAvBE,EAAOI,WAAWjB,GAClD,IAAK,IAAIkB,KAAKJ,EACVH,EAAMF,EAAcE,GAAOO,EAC/B,IAAK,IAAIlB,EAAI,EAAGA,EAAI,EAAGA,IACnBW,EAAMF,EAAcE,GAExB,OADAA,GAAOI,EACAjB,EAAcnC,OAAOU,EAAc,CAACsC,EAAM,GAAK,IAAK,GAAI,GAAG,GACtE,CAIA,SAASQ,EAAUC,GACf,MAAMC,EAA8B,WAAbD,EAAwB,EAAI,UAC7CE,EAASrC,EAAO,GAChBsC,EAAYD,EAAOvD,OACnByD,EAAUF,EAAO3D,OACjB8D,EAAkB/B,EAAc6B,GAetC,SAASxD,EAAO2D,EAAKC,EAAQ,IACzB,GAAmB,iBAARD,EACP,MAAM,IAAIhD,MAAO,oDAAmDgD,GACxE,GAAIA,EAAIjC,OAAS,IAAgB,IAAVkC,GAAmBD,EAAIjC,OAASkC,EACnD,MAAM,IAAIC,UAAW,wBAAuBF,EAAIjC,WAAWiC,oBAAsBC,MAErF,MAAME,EAAUH,EAAII,cACpB,GAAIJ,IAAQG,GAAWH,IAAQA,EAAIK,cAC/B,MAAM,IAAIrD,MAAO,yCACrB,MAAMsD,EAAWH,EAAQI,YAAY,KACrC,GAAiB,IAAbD,IAAgC,IAAdA,EAClB,MAAM,IAAItD,MAAO,2DACrB,MAAMmC,EAASgB,EAAQK,MAAM,EAAGF,GAC1B1D,EAAOuD,EAAQK,MAAMF,EAAW,GACtC,GAAI1D,EAAKmB,OAAS,EACd,MAAM,IAAIf,MAAM,2CACpB,MAAMoC,EAAQhB,EAAc/B,OAAOO,GAAM4D,MAAM,GAAI,GAC7CC,EAAMvB,EAAaC,EAAQC,EAAOO,GACxC,IAAK/C,EAAK8D,SAASD,GACf,MAAM,IAAIzD,MAAO,uBAAsBgD,gBAAkBS,MAC7D,MAAO,CAAEtB,SAAQC,QACrB,CAMA,MAAO,CAAEnD,OAzCT,SAAgBkD,EAAQC,EAAOa,EAAQ,IACnC,GAAsB,iBAAXd,EACP,MAAM,IAAInC,MAAO,qDAAoDmC,GACzE,IAAKrC,MAAMC,QAAQqC,IAAWA,EAAMrB,QAA8B,iBAAbqB,EAAM,GACvD,MAAM,IAAIpC,MAAO,8DAA6DoC,GAClF,GAAsB,IAAlBD,EAAOpB,OACP,MAAM,IAAImC,UAAW,yBAAwBf,EAAOpB,UACxD,MAAM4C,EAAexB,EAAOpB,OAAS,EAAIqB,EAAMrB,OAC/C,IAAc,IAAVkC,GAAmBU,EAAeV,EAClC,MAAM,IAAIC,UAAW,UAASS,mBAA8BV,KAChE,MAAME,EAAUhB,EAAOiB,cACjBK,EAAMvB,EAAaiB,EAASf,EAAOO,GACzC,MAAQ,GAAEQ,KAAW/B,EAAcnC,OAAOmD,KAASqB,GACvD,EA4BiBpE,SAAQuE,cAJzB,SAAuBZ,GACnB,MAAMb,OAAEA,EAAMC,MAAEA,GAAU/C,EAAO2D,GAAK,GACtC,MAAO,CAAEb,SAAQC,QAAO1B,MAAOmC,EAAUT,GAC7C,EACwCyB,aALnB7C,EAAc3B,GAKmBwD,YAAWE,kBAAiBD,UACtF,OACagB,EAAyBrB,EAAU,UCrb1CsB,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,CAqGA,MAwBME,EAAe,SAASC,EAAOC,GAGpC,OAAOD,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,EACzD,EAOMC,EAAQ,SAASC,EAAOC,EAAWC,GACxC,IAAIC,EAAI,EAGR,IAFAH,EAAQE,EAAYd,EAAMY,EA1Kd,KA0K8BA,GAAS,EACnDA,GAASZ,EAAMY,EAAQC,GACOD,EAAQI,IAA2BD,GAAKlB,EACrEe,EAAQZ,EAAMY,EA3JMf,IA6JrB,OAAOG,EAAMe,EAAI,GAAsBH,GAASA,EAhLpC,IAiLb,2BC1LC,SAAUK,GAKP,MAAMC,EAAW,uBACXC,EAAc,CAChBC,UAAW,IAAIC,OAAQ,IAAGH,OAAcA,OAAcA,OAAcA,KAAa,KACjFI,WAAY,IAAID,OAAQ,IAAGH,OAAcA,OAAcA,KAAa,KACpEK,SAAU,IAAIF,OAAQ,IAAGH,OAAcA,KAAa,KACpDM,UAAW,IAAIH,OAAQ,IAAGH,KAAa,MAIrCO,EAAa,IAAIJ,OAAQ,YAAY,KACrCK,EAAW,IAAIL,OAAQ,gBAAgB,KAEvCM,EAAY,gBAMZC,EAAW,oBACXC,EAAc,CAChBF,UAAW,IAAIN,OAAOM,EAAW,KACjCG,OAAU,IAAIT,OAAQ,UAASO,wBAA+BD,OAAgB,KAC9EI,uBAAwB,IAAIV,OAAQ,WAAUH,OAAcA,OAAcA,OAAcA,KAAYS,QAAiB,KACrHK,aAAc,IAAIX,OAAQ,QAAOO,eAAsBA,OAAcV,OAAcA,OAAcA,OAAcA,KAAYS,OAAgB,MAI/I,SAASM,EAAYC,EAAQC,GAEzB,GAAID,EAAO3E,QAAQ,QAAU2E,EAAO9C,YAAY,MAC5C,OAAO,KAGX,IAGIgD,EAAaC,EAHbC,EAAa,EACbC,GAAa,EACbC,GAAUN,EAAOO,MAAMZ,EAAYF,YAAc,IAAI,GAUzD,IANIa,IACAA,EAASA,EAAOE,UAAU,GAC1BR,EAASA,EAAOS,QAAQ,OAAQ,MAI5BJ,EAAYL,EAAO3E,QAAQ,IAAKgF,EAAY,KAAO,GACvDD,IAaJ,GAT4B,OAAxBJ,EAAOU,OAAO,EAAG,IACjBN,IAGyB,OAAzBJ,EAAOU,QAAQ,EAAG,IAClBN,IAIAA,EAAaH,EACb,OAAO,KAMX,IAFAE,EAAmBF,EAAQG,EAC3BF,EAAc,IACPC,KACHD,GAAe,KA2BnB,MAnBkB,OAJlBF,EAASA,EAAOS,QAAQ,KAAMP,IAInB,KACPF,EAASA,EAAO7C,MAAM,IAGQ,MAA9B6C,EAAOA,EAAOtF,OAAS,KACvBsF,EAASA,EAAO7C,MAAM,GAAI,IAcvB,CACH8C,MAZJA,EAAS,WACL,MAAMU,EAAMX,EAAOxE,MAAM,KACnBoF,EAAU,GAEhB,IAAK,IAAI3F,EAAI,EAAGA,EAAI0F,EAAIjG,OAAQO,IAC5B2F,EAAQ3G,KAAK4G,SAASF,EAAI1F,GAAI,KAGlC,OAAO2F,CACnB,CATiB,GAaLN,OAAQA,EAEf,CAGD,SAASQ,EAAWC,EAAOC,EAAQC,EAAUC,GACzC,GAAIH,EAAMrG,SAAWsG,EAAOtG,OACxB,MAAM,IAAIf,MAAM,gEAGpB,IACIwH,EADAC,EAAO,EAGX,KAAOF,EAAW,GAAG,CAMjB,GALAC,EAAQF,EAAWC,EACfC,EAAQ,IACRA,EAAQ,GAGRJ,EAAMK,IAASD,GAAUH,EAAOI,IAASD,EACzC,OAAO,EAGXD,GAAYD,EACZG,GAAQ,CACX,CAED,OAAO,CACV,CAED,SAASC,EAAcrB,GAEnB,GAAIR,EAAS8B,KAAKtB,GACd,OAAOa,SAASb,EAAQ,IAK5B,GAAkB,MAAdA,EAAO,KAAeuB,MAAMV,SAASb,EAAO,GAAI,KAAM,CAC1D,GAAIT,EAAW+B,KAAKtB,GAChB,OAAOa,SAASb,EAAQ,GAExB,MAAM,IAAIrG,MAAO,wBAAuBqG,aAC3C,CAED,OAAOa,SAASb,EAAQ,GAC3B,CAED,SAASwB,EAASJ,EAAM1G,GACpB,KAAO0G,EAAK1G,OAASA,GACjB0G,EAAQ,IAAGA,IAGf,OAAOA,CACV,CAED,MAAMK,EAAS,CAAA,EAGfA,EAAOC,KAAQ,WAIX,SAASA,EAAMC,GACX,GAAsB,IAAlBA,EAAOjH,OACP,MAAM,IAAIf,MAAM,wCAGpB,IAAIsB,EAAG2G,EAEP,IAAK3G,EAAI,EAAGA,EAAI0G,EAAOjH,OAAQO,IAE3B,GADA2G,EAAQD,EAAO1G,KACR,GAAK2G,GAASA,GAAS,KAC1B,MAAM,IAAIjI,MAAM,2CAIxBkI,KAAKF,OAASA,CACjB,CAkID,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,QAIXhB,EAAKI,UAAUvB,MAAQ,SAAUoC,EAAOC,GACpC,IAAIjC,EAOJ,QANkBkC,IAAdD,IACAjC,EAAMgC,EACNA,EAAQhC,EAAI,GACZiC,EAAYjC,EAAI,IAGC,SAAjBgC,EAAMD,OACN,MAAM,IAAI/I,MAAM,uDAGpB,OAAOmH,EAAUe,KAAKF,OAAQgB,EAAMhB,OAAQ,EAAGiB,IAMnDlB,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,IAAIhI,EAAG2G,EAAOsB,EAEd,IAAKjI,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAExB,GADA2G,EAAQC,KAAKF,OAAO1G,KAChB2G,KAASqB,GAYT,OAAO,KAVP,GADAC,EAAQD,EAAUrB,GACdoB,GAAkB,IAAVE,EACR,OAAO,KAGG,IAAVA,IACAF,GAAO,GAGXD,GAAQG,CAIf,CAED,OAAO,GAAKH,GAIhBrB,EAAKI,UAAUqB,MAAQ,WACnB,OAAO1B,EAAO2B,YAAYvB,KAAMA,KAAKE,gBAIzCL,EAAKI,UAAUuB,YAAc,WACzB,OAAOxB,KAAKF,OAAOxE,MAAM,IAI7BuE,EAAKI,UAAUwB,oBAAsB,WACjC,OAAO7B,EAAO8B,KAAKC,MAAO,UAAS3B,KAAK4B,eAI5C/B,EAAKI,UAAU4B,mBAAqB,WAChC,OAAO7B,KAAK4B,YAIhB/B,EAAKI,UAAU2B,SAAW,WACtB,OAAO5B,KAAKF,OAAOpG,KAAK,MAGrBmG,CACf,CAtJmB,GAyJfD,EAAOC,KAAKiC,yBAA2B,SAAU3D,GAE7C,IACI,MAAM+C,EAAOlB,KAAK+B,UAAU5D,GACtB6D,EAAoBd,EAAK,GAAGM,cAC5BS,EAAmBjC,KAAKkC,2BAA2BhB,EAAK,IAAIM,cAC5D1B,EAAS,GACf,IAAI1G,EAAI,EACR,KAAOA,EAAI,GAEP0G,EAAO1H,KAAK4G,SAASgD,EAAkB5I,GAAI,IAA0C,IAApC4F,SAASiD,EAAiB7I,GAAI,KAC/EA,IAGJ,OAAO,IAAI4G,KAAKF,EACnB,CAAC,MAAO7G,GACL,MAAM,IAAInB,MAAM,qDACnB,GAIL8H,EAAOC,KAAKsC,OAAS,SAAUhE,GAC3B,OAA+B,OAAxB6B,KAAKoC,OAAOjE,IAIvByB,EAAOC,KAAKwC,QAAU,SAAUlE,GAC5B,IAEI,OADA,IAAI6B,KAAKA,KAAKoC,OAAOjE,KACd,CACV,CAAC,MAAOlF,GACL,OAAO,CACV,GAIL2G,EAAOC,KAAKyC,YAAc,SAAUnE,GAChC,IAEI,OADA6B,KAAK+B,UAAU5D,IACR,CACV,CAAC,MAAOlF,GACL,OAAO,CACV,GAIL2G,EAAOC,KAAK0C,uBAAyB,SAAUpE,GAC3C,SAAIyB,EAAOC,KAAKwC,QAAQlE,KAAWA,EAAOO,MAAM,uCAQpDkB,EAAOC,KAAK2C,uBAAyB,SAAUrE,GAC3C,IAAI+C,EAAM9H,EAAG4I,EAAmBlC,EAAQmC,EAExC,IAMI,IALAf,EAAOlB,KAAK+B,UAAU5D,GACtB6D,EAAoBd,EAAK,GAAGM,cAC5BS,EAAmBjC,KAAKkC,2BAA2BhB,EAAK,IAAIM,cAC5D1B,EAAS,GACT1G,EAAI,EACGA,EAAI,GAEP0G,EAAO1H,KAAK4G,SAASgD,EAAkB5I,GAAI,IAAM4F,SAASiD,EAAiB7I,GAAI,KAC/EA,IAGJ,OAAO,IAAI4G,KAAKF,EACnB,CAAC,MAAO7G,GACL,MAAM,IAAInB,MAAM,qDACnB,GAKL8H,EAAOC,KAAK8B,MAAQ,SAAUxD,GAC1B,MAAMC,EAAQ4B,KAAKoC,OAAOjE,GAE1B,GAAc,OAAVC,EACA,MAAM,IAAItG,MAAM,wDAGpB,OAAO,IAAIkI,KAAK5B,IAIpBwB,EAAOC,KAAKkC,UAAY,SAAU5D,GAC9B,IAAIO,EAEJ,GAAKA,EAAQP,EAAOO,MAAM,iBAAmB,CACzC,MAAM+D,EAAazD,SAASN,EAAM,IAClC,GAAI+D,GAAc,GAAKA,GAAc,GAAI,CACrC,MAAMC,EAAS,CAAC1C,KAAK2B,MAAMjD,EAAM,IAAK+D,GAMtC,OALAE,OAAOC,eAAeF,EAAQ,WAAY,CACtCG,MAAO,WACH,OAAO7C,KAAKtG,KAAK,IACpB,IAEEgJ,CACV,CACJ,CAED,MAAM,IAAI5K,MAAM,4DAMpB8H,EAAOC,KAAKuC,OAAS,SAAUjE,GAC3B,IAAIO,EAAOa,EAAMsD,EAGjB,GAAKnE,EAAQP,EAAOO,MAAMtB,EAAYC,WAClC,OAAQ,WACJ,MAAMyB,EAAMJ,EAAMpD,MAAM,EAAG,GACrByD,EAAU,GAEhB,IAAK,IAAI3F,EAAI,EAAGA,EAAI0F,EAAIjG,OAAQO,IAC5BmG,EAAOT,EAAI1F,GACX2F,EAAQ3G,KAAKoH,EAAaD,IAG9B,OAAOR,CACvB,CAVoB,GAWL,GAAKL,EAAQP,EAAOO,MAAMtB,EAAYK,WAAa,CAEtD,GADAoF,EAAQrD,EAAad,EAAM,IACvBmE,EAAQ,YAAcA,EAAQ,EAC9B,MAAM,IAAI/K,MAAM,yCAGpB,OAAS,WACL,MAAMiH,EAAU,GAChB,IAAIO,EAEJ,IAAKA,EAAQ,EAAGA,GAAS,GAAIA,GAAS,EAClCP,EAAQ3G,KAAMyK,GAASvD,EAAS,KAGpC,OAAOP,CACvB,CATqB,GASH+D,SAClB,CAAe,OAAKpE,EAAQP,EAAOO,MAAMtB,EAAYI,WACjC,WACJ,MAAMsB,EAAMJ,EAAMpD,MAAM,EAAG,GACrByD,EAAU,GAGhB,GADA8D,EAAQrD,EAAaV,EAAI,IACrB+D,EAAQ,UAAYA,EAAQ,EAC5B,MAAM,IAAI/K,MAAM,yCAQpB,OALAiH,EAAQ3G,KAAKoH,EAAaV,EAAI,KAC9BC,EAAQ3G,KAAMyK,GAAS,GAAM,KAC7B9D,EAAQ3G,KAAMyK,GAAU,EAAK,KAC7B9D,EAAQ3G,KAAqB,IAAfyK,GAEP9D,CACvB,CAfoB,IAgBAL,EAAQP,EAAOO,MAAMtB,EAAYG,aACjC,WACJ,MAAMuB,EAAMJ,EAAMpD,MAAM,EAAG,GACrByD,EAAU,GAGhB,GADA8D,EAAQrD,EAAaV,EAAI,IACrB+D,EAAQ,OAAUA,EAAQ,EAC1B,MAAM,IAAI/K,MAAM,yCAQpB,OALAiH,EAAQ3G,KAAKoH,EAAaV,EAAI,KAC9BC,EAAQ3G,KAAKoH,EAAaV,EAAI,KAC9BC,EAAQ3G,KAAMyK,GAAS,EAAK,KAC5B9D,EAAQ3G,KAAoB,IAAdyK,GAEP9D,CACvB,CAfoB,GAiBD,MAKfa,EAAOC,KAAKqC,2BAA6B,SAAUjI,GAE/C,IADAA,EAAS+E,SAAS/E,IACL,GAAKA,EAAS,GACvB,MAAM,IAAInC,MAAM,sCAGpB,MAAMgI,EAAS,CAAC,EAAG,EAAG,EAAG,GACzB,IAAIiD,EAAI,EACR,MAAMC,EAAmB9G,KAAKD,MAAMhC,EAAS,GAE7C,KAAO8I,EAAIC,GACPlD,EAAOiD,GAAK,IACZA,IAOJ,OAJIC,EAAmB,IACnBlD,EAAOkD,GAAoB9G,KAAK+G,IAAI,EAAGhJ,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAI+F,KAAKF,IAIpBF,EAAO8B,KAAQ,WAIX,SAASA,EAAMtD,EAAOK,GAClB,IAAIrF,EAAGmG,EAEP,GAAqB,KAAjBnB,EAAMvF,OAEN,IADAmH,KAAK5B,MAAQ,GACRhF,EAAI,EAAGA,GAAK,GAAIA,GAAK,EACtB4G,KAAK5B,MAAMhG,KAAMgG,EAAMhF,IAAM,EAAKgF,EAAMhF,EAAI,QAE7C,IAAqB,IAAjBgF,EAAMvF,OAGb,MAAM,IAAIf,MAAM,6CAFhBkI,KAAK5B,MAAQA,CAGhB,CAED,IAAKhF,EAAI,EAAGA,EAAI4G,KAAK5B,MAAMvF,OAAQO,IAE/B,GADAmG,EAAOS,KAAK5B,MAAMhF,KACX,GAAKmG,GAAQA,GAAQ,OACxB,MAAM,IAAIzH,MAAM,2CAIpB2G,IACAuB,KAAKvB,OAASA,EAErB,CAmOD,OAhOAiD,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/CwB,YAAa,CAAC,IAAIxB,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GACvDyB,WAAY,CAAC,IAAIzB,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,IAAK,IAEtD0B,QAAS,CAAC,IAAI1B,EAAK,CAAC,IAAO,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElD2B,QAAS,CAAC,IAAI3B,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,EAAG,IAAK,IAEnD4B,QAAS,CAAC,IAAI5B,EAAK,CAAC,IAAM,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAEtD,OAAQ,CAAC,IAAIA,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElD6B,OAAQ,CAAC,IAAI7B,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElD8B,aAAc,CAAC,IAAI9B,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAE1Dd,IAAK,CAAC,IAAIc,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACjD+B,QAAS,CACL,CAAC,IAAI/B,EAAK,CAAC,KAAQ,EAAK,IAAO,EAAG,EAAG,EAAG,EAAG,IAAK,IAChD,CAAC,IAAIA,EAAK,CAAC,KAAQ,GAAM,MAAQ,EAAG,EAAG,EAAG,EAAG,IAAK,KAEtDgC,WAAY,CAAC,IAAIhC,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACzDiC,QAAS,CAAC,IAAIjC,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACtDkC,gCAAiC,CAAC,IAAIlC,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,UAAU4D,oBAAsB,WACjC,MAAwB,eAAjB7D,KAAKsB,SAIhBI,EAAKzB,UAAUY,KAAO,WAClB,MAAO,QAIXa,EAAKzB,UAAUvB,MAAQ,SAAUoC,EAAOC,GACpC,IAAIjC,EAQJ,QANkBkC,IAAdD,IACAjC,EAAMgC,EACNA,EAAQhC,EAAI,GACZiC,EAAYjC,EAAI,IAGC,SAAjBgC,EAAMD,OACN,MAAM,IAAI/I,MAAM,uDAGpB,OAAOmH,EAAUe,KAAK5B,MAAO0C,EAAM1C,MAAO,GAAI2C,IAMlDW,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,IAAIjI,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAE5B,GADAmG,EAAOS,KAAK5B,MAAMhF,KACdmG,KAAQ6B,GAYR,OAAO,KAVP,GADAC,EAAQD,EAAU7B,GACd4B,GAAkB,IAAVE,EACR,OAAO,KAGG,KAAVA,IACAF,GAAO,GAGXD,GAAQG,CAIf,CAED,OAAO,IAAMH,GAKjBQ,EAAKzB,UAAUqB,MAAQ,WACnB,OAAO1B,EAAO2B,YAAYvB,KAAMA,KAAKE,gBAIzCwB,EAAKzB,UAAUuB,YAAc,WACzB,IAAIjC,EACJ,MAAM/G,EAAQ,GACRsG,EAAMkB,KAAK5B,MACjB,IAAK,IAAIhF,EAAI,EAAGA,EAAI0F,EAAIjG,OAAQO,IAC5BmG,EAAOT,EAAI1F,GACXZ,EAAMJ,KAAKmH,GAAQ,GACnB/G,EAAMJ,KAAY,IAAPmH,GAGf,OAAO/G,GAKXkJ,EAAKzB,UAAU6D,oBAAsB,WACjC,MAAMC,EAAS,WACX,MAAMhF,EAAU,GAChB,IAAK,IAAI3F,EAAI,EAAGA,EAAI4G,KAAK5B,MAAMvF,OAAQO,IACnC2F,EAAQ3G,KAAKuH,EAAQK,KAAK5B,MAAMhF,GAAGwI,SAAS,IAAK,IAGrD,OAAO7C,CACV,EAAEiF,KAAKhE,MAAOtG,KAAK,KAEpB,IAAIuK,EAAS,GAMb,OAJIjE,KAAKvB,SACLwF,EAAU,IAAGjE,KAAKvB,UAGfsF,EAAOE,GAKlBvC,EAAKzB,UAAUiE,cAAgB,WAC3B,IAAKlE,KAAK6D,sBACN,MAAM,IAAI/L,MAAM,4DAGpB,MAAMgH,EAAMkB,KAAK5B,MAAM9C,OAAO,GACxB6I,EAAOrF,EAAI,GACXsF,EAAMtF,EAAI,GAEhB,OAAO,IAAIc,EAAOC,KAAK,CAACsE,GAAQ,EAAU,IAAPA,EAAaC,GAAO,EAAS,IAANA,KAO9D1C,EAAKzB,UAAU4B,mBAAqB,WAChC,MAAMkC,EAAS,WACX,MAAMhF,EAAU,GAEhB,IAAK,IAAI3F,EAAI,EAAGA,EAAI4G,KAAK5B,MAAMvF,OAAQO,IACnC2F,EAAQ3G,KAAK4H,KAAK5B,MAAMhF,GAAGwI,SAAS,KAGxC,OAAO7C,CACV,EAAEiF,KAAKhE,MAAOtG,KAAK,KAEpB,IAAIuK,EAAS,GAMb,OAJIjE,KAAKvB,SACLwF,EAAU,IAAGjE,KAAKvB,UAGfsF,EAAOE,GAMlBvC,EAAKzB,UAAUoE,gBAAkB,WAC7B,MAAMC,EAAQ,uBACRnG,EAAS6B,KAAK6B,qBACpB,IAEInD,EAFA6F,EAAiB,EACjBC,GAAmB,EAGvB,KAAQ9F,EAAQ4F,EAAMG,KAAKtG,IACnBO,EAAM,GAAG7F,OAAS2L,IAClBD,EAAiB7F,EAAMnF,MACvBiL,EAAkB9F,EAAM,GAAG7F,QAInC,OAAI2L,EAAkB,EACXrG,EAGH,GAAEA,EAAOQ,UAAU,EAAG4F,OAAoBpG,EAAOQ,UAAU4F,EAAiBC,MAMxF9C,EAAKzB,UAAU2B,SAAW,WACtB,OAAO5B,KAAKqE,mBAGT3C,CAEf,CAjQmB,GAoQf9B,EAAO8B,KAAKI,yBAA2B,SAAU3D,GAC7C,IACI,MAAM+C,EAAOlB,KAAK+B,UAAU5D,GACtB6D,EAAoBd,EAAK,GAAGM,cAC5BS,EAAmBjC,KAAKkC,2BAA2BhB,EAAK,IAAIM,cAC5D1B,EAAS,GACf,IAAI1G,EAAI,EACR,KAAOA,EAAI,IAEP0G,EAAO1H,KAAK4G,SAASgD,EAAkB5I,GAAI,IAA0C,IAApC4F,SAASiD,EAAiB7I,GAAI,KAC/EA,IAGJ,OAAO,IAAI4G,KAAKF,EACnB,CAAC,MAAO7G,GACL,MAAM,IAAInB,MAAO,uDAAsDmB,KAC1E,GAIL2G,EAAO8B,KAAKgD,OAAS,SAAUvG,GAC3B,OAA+B,OAAxB6B,KAAKoC,OAAOjE,IAIvByB,EAAO8B,KAAKW,QAAU,SAAUlE,GAI5B,GAAsB,iBAAXA,IAAgD,IAAzBA,EAAO3E,QAAQ,KAC7C,OAAO,EAGX,IACI,MAAMuK,EAAO/D,KAAKoC,OAAOjE,GAEzB,OADA,IAAI6B,KAAK+D,EAAK3F,MAAO2F,EAAKtF,SACnB,CACV,CAAC,MAAOxF,GACL,OAAO,CACV,GAIL2G,EAAO8B,KAAKY,YAAc,SAAUnE,GAGhC,GAAsB,iBAAXA,IAAgD,IAAzBA,EAAO3E,QAAQ,KAC7C,OAAO,EAGX,IAEI,OADAwG,KAAK+B,UAAU5D,IACR,CACV,CAAC,MAAOlF,GACL,OAAO,CACV,GAIL2G,EAAO8B,KAAKc,uBAAyB,SAAUrE,GAC3C,IAAI+C,EAAM9H,EAAG4I,EAAmBlC,EAAQmC,EAExC,IAMI,IALAf,EAAOlB,KAAK+B,UAAU5D,GACtB6D,EAAoBd,EAAK,GAAGM,cAC5BS,EAAmBjC,KAAKkC,2BAA2BhB,EAAK,IAAIM,cAC5D1B,EAAS,GACT1G,EAAI,EACGA,EAAI,IAEP0G,EAAO1H,KAAK4G,SAASgD,EAAkB5I,GAAI,IAAM4F,SAASiD,EAAiB7I,GAAI,KAC/EA,IAGJ,OAAO,IAAI4G,KAAKF,EACnB,CAAC,MAAO7G,GACL,MAAM,IAAInB,MAAO,uDAAsDmB,KAC1E,GAKL2G,EAAO8B,KAAKC,MAAQ,SAAUxD,GAC1B,MAAM4F,EAAO/D,KAAKoC,OAAOjE,GAEzB,GAAmB,OAAf4F,EAAK3F,MACL,MAAM,IAAItG,MAAM,wDAGpB,OAAO,IAAIkI,KAAK+D,EAAK3F,MAAO2F,EAAKtF,SAGrCmB,EAAO8B,KAAKK,UAAY,SAAU5D,GAC9B,IAAIsE,EAAY/D,EAAOgE,EAEvB,IAAKhE,EAAQP,EAAOO,MAAM,oBACtB+D,EAAazD,SAASN,EAAM,IACxB+D,GAAc,GAAKA,GAAc,KAOjC,OANAC,EAAS,CAAC1C,KAAK2B,MAAMjD,EAAM,IAAK+D,GAChCE,OAAOC,eAAeF,EAAQ,WAAY,CACtCG,MAAO,WACH,OAAO7C,KAAKtG,KAAK,IACpB,IAEEgJ,EAIf,MAAM,IAAI5K,MAAM,4DAIpB8H,EAAO8B,KAAKU,OAAS,SAAUjE,GAC3B,IAAI4F,EAAM3K,EAAGsF,EAAOqB,EAAOD,EAAQrB,EAEnC,GAAKC,EAAQP,EAAOO,MAAMZ,EAAYE,wBAClC,OAAOgC,KAAKoC,OAAQ,UAAS1D,EAAM,MAEvC,GAAIZ,EAAYC,OAAO0B,KAAKtB,GACxB,OAAOD,EAAWC,EAAQ,GAE9B,IAAKO,EAAQP,EAAOO,MAAMZ,EAAYG,iBAClCQ,EAASC,EAAM,IAAM,GACrBqF,EAAOrF,EAAM,GACRA,EAAM,GAAGlD,SAAS,QACnBuI,EAAOA,EAAKzI,MAAM,GAAI,IAE1ByI,EAAO7F,EAAW6F,EAAOtF,EAAQ,GAC7BsF,EAAK3F,OAAO,CAOZ,IANA0B,EAAS,CACLd,SAASN,EAAM,IACfM,SAASN,EAAM,IACfM,SAASN,EAAM,IACfM,SAASN,EAAM,KAEdtF,EAAI,EAAGA,EAAI0G,EAAOjH,OAAQO,IAE3B,GADA2G,EAAQD,EAAO1G,KACR,GAAK2G,GAASA,GAAS,KAC1B,OAAO,KAMf,OAFAgE,EAAK3F,MAAMhG,KAAK0H,EAAO,IAAM,EAAIA,EAAO,IACxCiE,EAAK3F,MAAMhG,KAAK0H,EAAO,IAAM,EAAIA,EAAO,IACjC,CACH1B,MAAO2F,EAAK3F,MACZK,OAAQsF,EAAKtF,OAEpB,CAGL,OAAO,MAIXmB,EAAO8B,KAAKQ,2BAA6B,SAAUjI,GAE/C,IADAA,EAAS+E,SAAS/E,IACL,GAAKA,EAAS,IACvB,MAAM,IAAInC,MAAM,sCAGpB,MAAMgI,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC7D,IAAIiD,EAAI,EACR,MAAMC,EAAmB9G,KAAKD,MAAMhC,EAAS,GAE7C,KAAO8I,EAAIC,GACPlD,EAAOiD,GAAK,IACZA,IAOJ,OAJIC,EAAmB,KACnBlD,EAAOkD,GAAoB9G,KAAK+G,IAAI,EAAGhJ,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAI+F,KAAKF,IAIpBF,EAAO+E,cAAgB,SAAUnM,GAC7B,MAAMK,EAASL,EAAMK,OAErB,GAAe,IAAXA,EACA,OAAO,IAAI+G,EAAOC,KAAKrH,GACpB,GAAe,KAAXK,EACP,OAAO,IAAI+G,EAAO8B,KAAKlJ,GAEvB,MAAM,IAAIV,MAAM,iEAKxB8H,EAAOyC,QAAU,SAAUlE,GACvB,OAAOyB,EAAO8B,KAAKW,QAAQlE,IAAWyB,EAAOC,KAAKwC,QAAQlE,IAI9DyB,EAAO0C,YAAc,SAAUnE,GAC3B,OAAOyB,EAAO8B,KAAKY,YAAYnE,IAAWyB,EAAOC,KAAKyC,YAAYnE,IAMtEyB,EAAO+B,MAAQ,SAAUxD,GACrB,GAAIyB,EAAO8B,KAAKW,QAAQlE,GACpB,OAAOyB,EAAO8B,KAAKC,MAAMxD,GACtB,GAAIyB,EAAOC,KAAKwC,QAAQlE,GAC3B,OAAOyB,EAAOC,KAAK8B,MAAMxD,GAEzB,MAAM,IAAIrG,MAAM,yDAMxB8H,EAAOmC,UAAY,SAAU5D,GACzB,IACI,OAAOyB,EAAO8B,KAAKK,UAAU5D,EAChC,CAAC,MAAOlF,GACL,IACI,OAAO2G,EAAOC,KAAKkC,UAAU5D,EAChC,CAAC,MAAOyG,GACL,MAAM,IAAI9M,MAAM,4DACnB,CACJ,GAIL8H,EAAOiF,QAAU,SAAU1G,GACvB,MAAM4F,EAAO/D,KAAK2B,MAAMxD,GAExB,MAAoB,SAAhB4F,EAAKlD,QAAqBkD,EAAKF,sBACxBE,EAAKG,gBAELH,GAOfnE,EAAO2B,YAAc,SAAUuD,EAASC,EAAWC,GAC/C,IAAI5L,EAAG6L,EAAWC,EAAcC,EAMhC,IAAKF,KAJDD,UACAA,EAAc,WAGAD,EACd,GAAIpC,OAAO1C,UAAUmF,eAAepB,KAAKe,EAAWE,GAOhD,IANAC,EAAeH,EAAUE,IAErBC,EAAa,IAAQA,EAAa,aAActN,QAChDsN,EAAe,CAACA,IAGf9L,EAAI,EAAGA,EAAI8L,EAAarM,OAAQO,IAEjC,GADA+L,EAASD,EAAa9L,GAClB0L,EAAQjE,SAAWsE,EAAO,GAAGtE,QAAUiE,EAAQpG,MAAM1F,MAAM8L,EAASK,GACpE,OAAOF,EAMvB,OAAOD,GAI0BK,EAAOC,QACxCD,EAAAC,QAAiB1F,EAGjB1C,EAAK0C,OAASA,CAGrB,CA/hCA,CA+hCCI,EAAIuF,gED51BS,SAASlM,GAEvB,MAAMmM,EAAS,GACTC,EAAcpM,EAAMR,OAC1B,IAAIO,EAAI,EACJjB,EA5LY,IA6LZuN,EA9Le,GAoMfC,EAAQtM,EAAMgC,YAlMD,KAmMbsK,EAAQ,IACXA,EAAQ,GAGT,IAAK,IAAI5C,EAAI,EAAGA,EAAI4C,IAAS5C,EAExB1J,EAAMgB,WAAW0I,IAAM,KAC1BzG,EAAM,aAEPkJ,EAAOpN,KAAKiB,EAAMgB,WAAW0I,IAM9B,IAAK,IAAIxJ,EAAQoM,EAAQ,EAAIA,EAAQ,EAAI,EAAGpM,EAAQkM,GAAwC,CAO3F,MAAMG,EAAOxM,EACb,IAAK,IAAIyM,EAAI,EAAG7I,EAAIlB,GAA0BkB,GAAKlB,EAAM,CAEpDvC,GAASkM,GACZnJ,EAAM,iBAGP,MAAMI,GA9FqBoJ,EA8FAzM,EAAMgB,WAAWd,OA7F7B,IAAQuM,EAAY,GACvBA,EAAY,GAAlB,GAEJA,GAAa,IAAQA,EAAY,GAC7BA,EAAY,GAEhBA,GAAa,IAAQA,EAAY,IAC7BA,EAAY,GAEbhK,EAsFDY,GAASZ,GACZQ,EAAM,iBAEHI,EAAQT,GAAOJ,EAASzC,GAAKyM,IAChCvJ,EAAM,YAGPlD,GAAKsD,EAAQmJ,EACb,MAAME,EAAI/I,GAAK0I,EAhPL,EAgPoB1I,GAAK0I,EA/OzB,MA+O8C1I,EAAI0I,EAE5D,GAAIhJ,EAAQqJ,EACX,MAGD,MAAMC,EAAalK,EAAOiK,EACtBF,EAAI5J,EAAMJ,EAASmK,IACtB1J,EAAM,YAGPuJ,GAAKG,CAEN,CAEA,MAAMC,EAAMT,EAAO3M,OAAS,EAC5B6M,EAAO9I,EAAMxD,EAAIwM,EAAMK,EAAa,GAARL,GAIxB3J,EAAM7C,EAAI6M,GAAOpK,EAAS1D,GAC7BmE,EAAM,YAGPnE,GAAK8D,EAAM7C,EAAI6M,GACf7M,GAAK6M,EAGLT,EAAOU,OAAO9M,IAAK,EAAGjB,EAEvB,CAtIoB,IAAS2N,EAwI7B,OAAO1J,OAAO+J,iBAAiBX,EAChC,iBASe,SAASnM,GACvB,MAAMmM,EAAS,GAGfnM,EAjMD,SAAoB8E,GACnB,MAAMqH,EAAS,GACf,IAAIY,EAAU,EACd,MAAMvN,EAASsF,EAAOtF,OACtB,KAAOuN,EAAUvN,GAAQ,CACxB,MAAMgK,EAAQ1E,EAAO9D,WAAW+L,KAChC,GAAIvD,GAAS,OAAUA,GAAS,OAAUuD,EAAUvN,EAAQ,CAE3D,MAAMwN,EAAQlI,EAAO9D,WAAW+L,KACR,QAAX,MAARC,GACJb,EAAOpN,OAAe,KAARyK,IAAkB,KAAe,KAARwD,GAAiB,QAIxDb,EAAOpN,KAAKyK,GACZuD,IAEF,MACCZ,EAAOpN,KAAKyK,EAEd,CACA,OAAO2C,CACR,CA2KSc,CAAWjN,GAGnB,MAAMoM,EAAcpM,EAAMR,OAG1B,IAAIV,EA/RY,IAgSZ0E,EAAQ,EACR6I,EAlSe,GAqSnB,IAAK,MAAMa,KAAgBlN,EACtBkN,EAAe,KAClBf,EAAOpN,KAAK+D,EAAmBoK,IAIjC,MAAMC,EAAchB,EAAO3M,OAC3B,IAAI4N,EAAiBD,EAWrB,IALIA,GACHhB,EAAOpN,KAjTS,KAqTVqO,EAAiBhB,GAAa,CAIpC,IAAIiB,EAAI7K,EACR,IAAK,MAAM0K,KAAgBlN,EACtBkN,GAAgBpO,GAAKoO,EAAeG,IACvCA,EAAIH,GAMN,MAAMI,EAAwBF,EAAiB,EAC3CC,EAAIvO,EAAI8D,GAAOJ,EAASgB,GAAS8J,IACpCrK,EAAM,YAGPO,IAAU6J,EAAIvO,GAAKwO,EACnBxO,EAAIuO,EAEJ,IAAK,MAAMH,KAAgBlN,EAI1B,GAHIkN,EAAepO,KAAO0E,EAAQhB,GACjCS,EAAM,YAEHiK,IAAiBpO,EAAG,CAEvB,IAAIyO,EAAI/J,EACR,IAAK,IAAIG,EAAIlB,GAA0BkB,GAAKlB,EAAM,CACjD,MAAMiK,EAAI/I,GAAK0I,EAxVP,EAwVsB1I,GAAK0I,EAvV3B,MAuVgD1I,EAAI0I,EAC5D,GAAIkB,EAAIb,EACP,MAED,MAAMc,EAAUD,EAAIb,EACdC,EAAalK,EAAOiK,EAC1BP,EAAOpN,KACN+D,EAAmBM,EAAasJ,EAAIc,EAAUb,EAAY,KAE3DY,EAAI3K,EAAM4K,EAAUb,EACrB,CAEAR,EAAOpN,KAAK+D,EAAmBM,EAAamK,EAAG,KAC/ClB,EAAO9I,EAAMC,EAAO8J,EAAuBF,IAAmBD,GAC9D3J,EAAQ,IACN4J,CACH,GAGC5J,IACA1E,CAEH,CACA,OAAOqN,EAAO9L,KAAK,GACpB","x_google_ignoreList":[0,1,2]}

package/dist/ipaddr-a72db8ee.js

@@ -1,4 +0,0 @@
-import{c as r}from"./_commonjsHelpers-02d3be64.js";function t(...r){const t=r=>r,e=(r,t)=>e=>r(t(e));return{encode:r.map((r=>r.encode)).reduceRight(e,t),decode:r.map((r=>r.decode)).reduce(e,t)}}const e=(r,t)=>t?e(t,r%t):r,n=(r,t)=>r+(t-e(r,t));function o(r,t,e,o){if(!Array.isArray(r))throw new Error("convertRadix2: data should be array");if(t<=0||t>32)throw new Error(`convertRadix2: wrong from=${t}`);if(e<=0||e>32)throw new Error(`convertRadix2: wrong to=${e}`);if(n(t,e)>32)throw new Error(`convertRadix2: carry overflow from=${t} to=${e} carryBits=${n(t,e)}`);let i=0,s=0;const a=2**e-1,c=[];for(const n of r){if(n>=2**t)throw new Error(`convertRadix2: invalid data word=${n} from=${t}`);if(i=i<<t|n,s+t>32)throw new Error(`convertRadix2: carry overflow pos=${s} from=${t}`);for(s+=t;s>=e;s-=e)c.push((i>>s-e&a)>>>0);i&=2**s-1}if(i=i<<e-s&a,!o&&s>=t)throw new Error("Excess padding");if(!o&&i)throw new Error(`Non-zero padding: ${i}`);return o&&s>0&&c.push(i>>>0),c}function i(r,t=!1){if(r<=0||r>32)throw new Error("radix2: bits should be in (0..32]");if(n(8,r)>32||n(r,8)>32)throw new Error("radix2: carry overflow");return{encode:e=>{if(!((n=e)instanceof Uint8Array||null!=n&&"object"==typeof n&&"Uint8Array"===n.constructor.name))throw new Error("radix2.encode input should be Uint8Array");
-/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-var n;return o(Array.from(e),8,r,!t)},decode:e=>{if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("radix2.decode input should be array of numbers");return Uint8Array.from(o(e,r,8,t))}}}function s(r){if("function"!=typeof r)throw new Error("unsafeWrapper fn should be function");return function(...t){try{return r.apply(null,t)}catch(r){}}}const a=t(function(r){return{encode:t=>{if(!Array.isArray(t)||t.length&&"number"!=typeof t[0])throw new Error("alphabet.encode input should be an array of numbers");return t.map((t=>{if(t<0||t>=r.length)throw new Error(`Digit index outside alphabet: ${t} (alphabet: ${r.length})`);return r[t]}))},decode:t=>{if(!Array.isArray(t)||t.length&&"string"!=typeof t[0])throw new Error("alphabet.decode input should be array of strings");return t.map((t=>{if("string"!=typeof t)throw new Error(`alphabet.decode: not string element=${t}`);const e=r.indexOf(t);if(-1===e)throw new Error(`Unknown letter: "${t}". Allowed: ${r}`);return e}))}}}("qpzry9x8gf2tvdw0s3jn54khce6mua7l"),function(r=""){if("string"!=typeof r)throw new Error("join separator should be string");return{encode:t=>{if(!Array.isArray(t)||t.length&&"string"!=typeof t[0])throw new Error("join.encode input should be array of strings");for(let r of t)if("string"!=typeof r)throw new Error(`join.encode: non-string input=${r}`);return t.join(r)},decode:t=>{if("string"!=typeof t)throw new Error("join.decode input should be string");return t.split(r)}}}("")),c=[996825010,642813549,513874426,1027748829,705979059];function f(r){const t=r>>25;let e=(33554431&r)<<5;for(let r=0;r<c.length;r++)1==(t>>r&1)&&(e^=c[r]);return e}function u(r,t,e=1){const n=r.length;let i=1;for(let t=0;t<n;t++){const e=r.charCodeAt(t);if(e<33||e>126)throw new Error(`Invalid prefix (${r})`);i=f(i)^e>>5}i=f(i);for(let t=0;t<n;t++)i=f(i)^31&r.charCodeAt(t);for(let r of t)i=f(i)^r;for(let r=0;r<6;r++)i=f(i);return i^=e,a.encode(o([i%2**30],30,5,!1))}function d(r){const t="bech32"===r?1:734539939,e=i(5),n=e.decode,o=e.encode,c=s(n);function f(r,e=90){if("string"!=typeof r)throw new Error("bech32.decode input should be string, not "+typeof r);if(r.length<8||!1!==e&&r.length>e)throw new TypeError(`Wrong string length: ${r.length} (${r}). Expected (8..${e})`);const n=r.toLowerCase();if(r!==n&&r!==r.toUpperCase())throw new Error("String must be lowercase or uppercase");const o=n.lastIndexOf("1");if(0===o||-1===o)throw new Error('Letter "1" must be present between prefix and data only');const i=n.slice(0,o),s=n.slice(o+1);if(s.length<6)throw new Error("Data must be at least 6 characters long");const c=a.decode(s).slice(0,-6),f=u(i,c,t);if(!s.endsWith(f))throw new Error(`Invalid checksum in ${r}: expected "${f}"`);return{prefix:i,words:c}}return{encode:function(r,e,n=90){if("string"!=typeof r)throw new Error("bech32.encode prefix should be string, not "+typeof r);if(!Array.isArray(e)||e.length&&"number"!=typeof e[0])throw new Error("bech32.encode words should be array of numbers, not "+typeof e);if(0===r.length)throw new TypeError(`Invalid prefix length ${r.length}`);const o=r.length+7+e.length;if(!1!==n&&o>n)throw new TypeError(`Length ${o} exceeds limit ${n}`);const i=r.toLowerCase(),s=u(i,e,t);return`${i}1${a.encode(e)}${s}`},decode:f,decodeToBytes:function(r){const{prefix:t,words:e}=f(r,!1);return{prefix:t,words:e,bytes:n(e)}},decodeUnsafe:s(f),fromWords:n,fromWordsUnsafe:c,toWords:o}}const p=d("bech32"),h=2147483647,l=36,w={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},g=Math.floor,I=String.fromCharCode;function v(r){throw new RangeError(w[r])}const y=function(r,t){return r+22+75*(r<26)-((0!=t)<<5)},m=function(r,t,e){let n=0;for(r=e?g(r/700):r>>1,r+=g(r/t);r>455;n+=l)r=g(r/35);return g(n+36*r/(r+38))},$=function(r){const t=[],e=r.length;let n=0,o=128,i=72,s=r.lastIndexOf("-");s<0&&(s=0);for(let e=0;e<s;++e)r.charCodeAt(e)>=128&&v("not-basic"),t.push(r.charCodeAt(e));for(let c=s>0?s+1:0;c<e;){const s=n;for(let t=1,o=l;;o+=l){c>=e&&v("invalid-input");const s=(a=r.charCodeAt(c++))>=48&&a<58?a-48+26:a>=65&&a<91?a-65:a>=97&&a<123?a-97:l;s>=l&&v("invalid-input"),s>g((h-n)/t)&&v("overflow"),n+=s*t;const f=o<=i?1:o>=i+26?26:o-i;if(s<f)break;const u=l-f;t>g(h/u)&&v("overflow"),t*=u}const f=t.length+1;i=m(n-s,f,0==s),g(n/f)>h-o&&v("overflow"),o+=g(n/f),n%=f,t.splice(n++,0,o)}var a;return String.fromCodePoint(...t)},b=function(r){const t=[];r=function(r){const t=[];let e=0;const n=r.length;for(;e<n;){const o=r.charCodeAt(e++);if(o>=55296&&o<=56319&&e<n){const n=r.charCodeAt(e++);56320==(64512&n)?t.push(((1023&o)<<10)+(1023&n)+65536):(t.push(o),e--)}else t.push(o)}return t}(r);const e=r.length;let n=128,o=0,i=72;for(const e of r)e<128&&t.push(I(e));const s=t.length;let a=s;for(s&&t.push("-");a<e;){let e=h;for(const t of r)t>=n&&t<e&&(e=t);const c=a+1;e-n>g((h-o)/c)&&v("overflow"),o+=(e-n)*c,n=e;for(const e of r)if(e<n&&++o>h&&v("overflow"),e===n){let r=o;for(let e=l;;e+=l){const n=e<=i?1:e>=i+26?26:e-i;if(r<n)break;const o=r-n,s=l-n;t.push(I(y(n+o%s,0))),r=g(o/s)}t.push(I(y(r,0))),i=m(o,c,a===s),o=0,++a}++o,++n}return t.join("")};var E,P={exports:{}};E=P,function(r){const t="(0?\\d+|0x[a-f0-9]+)",e={fourOctet:new RegExp(`^${t}\\.${t}\\.${t}\\.${t}$`,"i"),threeOctet:new RegExp(`^${t}\\.${t}\\.${t}$`,"i"),twoOctet:new RegExp(`^${t}\\.${t}$`,"i"),longValue:new RegExp(`^${t}$`,"i")},n=new RegExp("^0[0-7]+$","i"),o=new RegExp("^0x[a-f0-9]+$","i"),i="%[0-9a-z]{1,}",s="(?:[0-9a-f]+::?)+",a={zoneIndex:new RegExp(i,"i"),native:new RegExp(`^(::)?(${s})?([0-9a-f]+)?(::)?(${i})?$`,"i"),deprecatedTransitional:new RegExp(`^(?:::)(${t}\\.${t}\\.${t}\\.${t}(${i})?)$`,"i"),transitional:new RegExp(`^((?:${s})|(?:::)(?:${s})?)${t}\\.${t}\\.${t}\\.${t}(${i})?$`,"i")};function c(r,t){if(r.indexOf("::")!==r.lastIndexOf("::"))return null;let e,n,o=0,i=-1,s=(r.match(a.zoneIndex)||[])[0];for(s&&(s=s.substring(1),r=r.replace(/%.+$/,""));(i=r.indexOf(":",i+1))>=0;)o++;if("::"===r.substr(0,2)&&o--,"::"===r.substr(-2,2)&&o--,o>t)return null;for(n=t-o,e=":";n--;)e+="0:";return":"===(r=r.replace("::",e))[0]&&(r=r.slice(1)),":"===r[r.length-1]&&(r=r.slice(0,-1)),{parts:t=function(){const t=r.split(":"),e=[];for(let r=0;r<t.length;r++)e.push(parseInt(t[r],16));return e}(),zoneId:s}}function f(r,t,e,n){if(r.length!==t.length)throw new Error("ipaddr: cannot match CIDR for objects with different lengths");let o,i=0;for(;n>0;){if(o=e-n,o<0&&(o=0),r[i]>>o!=t[i]>>o)return!1;n-=e,i+=1}return!0}function u(r){if(o.test(r))return parseInt(r,16);if("0"===r[0]&&!isNaN(parseInt(r[1],10))){if(n.test(r))return parseInt(r,8);throw new Error(`ipaddr: cannot parse ${r} as octal`)}return parseInt(r,10)}function d(r,t){for(;r.length<t;)r=`0${r}`;return r}const p={};p.IPv4=function(){function r(r){if(4!==r.length)throw new Error("ipaddr: ipv4 octet count should be 4");let t,e;for(t=0;t<r.length;t++)if(e=r[t],!(0<=e&&e<=255))throw new Error("ipaddr: ipv4 octet should fit in 8 bits");this.octets=r}return r.prototype.SpecialRanges={unspecified:[[new r([0,0,0,0]),8]],broadcast:[[new r([255,255,255,255]),32]],multicast:[[new r([224,0,0,0]),4]],linkLocal:[[new r([169,254,0,0]),16]],loopback:[[new r([127,0,0,0]),8]],carrierGradeNat:[[new r([100,64,0,0]),10]],private:[[new r([10,0,0,0]),8],[new r([172,16,0,0]),12],[new r([192,168,0,0]),16]],reserved:[[new r([192,0,0,0]),24],[new r([192,0,2,0]),24],[new r([192,88,99,0]),24],[new r([198,18,0,0]),15],[new r([198,51,100,0]),24],[new r([203,0,113,0]),24],[new r([240,0,0,0]),4]],as112:[[new r([192,175,48,0]),24],[new r([192,31,196,0]),24]],amt:[[new r([192,52,193,0]),24]]},r.prototype.kind=function(){return"ipv4"},r.prototype.match=function(r,t){let e;if(void 0===t&&(e=r,r=e[0],t=e[1]),"ipv4"!==r.kind())throw new Error("ipaddr: cannot match ipv4 address with non-ipv4 one");return f(this.octets,r.octets,8,t)},r.prototype.prefixLengthFromSubnetMask=function(){let r=0,t=!1;const e={0:8,128:7,192:6,224:5,240:4,248:3,252:2,254:1,255:0};let n,o,i;for(n=3;n>=0;n-=1){if(o=this.octets[n],!(o in e))return null;if(i=e[o],t&&0!==i)return null;8!==i&&(t=!0),r+=i}return 32-r},r.prototype.range=function(){return p.subnetMatch(this,this.SpecialRanges)},r.prototype.toByteArray=function(){return this.octets.slice(0)},r.prototype.toIPv4MappedAddress=function(){return p.IPv6.parse(`::ffff:${this.toString()}`)},r.prototype.toNormalizedString=function(){return this.toString()},r.prototype.toString=function(){return this.octets.join(".")},r}(),p.IPv4.broadcastAddressFromCIDR=function(r){try{const t=this.parseCIDR(r),e=t[0].toByteArray(),n=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[];let i=0;for(;i<4;)o.push(parseInt(e[i],10)|255^parseInt(n[i],10)),i++;return new this(o)}catch(r){throw new Error("ipaddr: the address does not have IPv4 CIDR format")}},p.IPv4.isIPv4=function(r){return null!==this.parser(r)},p.IPv4.isValid=function(r){try{return new this(this.parser(r)),!0}catch(r){return!1}},p.IPv4.isValidCIDR=function(r){try{return this.parseCIDR(r),!0}catch(r){return!1}},p.IPv4.isValidFourPartDecimal=function(r){return!(!p.IPv4.isValid(r)||!r.match(/^(0|[1-9]\d*)(\.(0|[1-9]\d*)){3}$/))},p.IPv4.networkAddressFromCIDR=function(r){let t,e,n,o,i;try{for(t=this.parseCIDR(r),n=t[0].toByteArray(),i=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[],e=0;e<4;)o.push(parseInt(n[e],10)&parseInt(i[e],10)),e++;return new this(o)}catch(r){throw new Error("ipaddr: the address does not have IPv4 CIDR format")}},p.IPv4.parse=function(r){const t=this.parser(r);if(null===t)throw new Error("ipaddr: string is not formatted like an IPv4 Address");return new this(t)},p.IPv4.parseCIDR=function(r){let t;if(t=r.match(/^(.+)\/(\d+)$/)){const r=parseInt(t[2]);if(r>=0&&r<=32){const e=[this.parse(t[1]),r];return Object.defineProperty(e,"toString",{value:function(){return this.join("/")}}),e}}throw new Error("ipaddr: string is not formatted like an IPv4 CIDR range")},p.IPv4.parser=function(r){let t,n,o;if(t=r.match(e.fourOctet))return function(){const r=t.slice(1,6),e=[];for(let t=0;t<r.length;t++)n=r[t],e.push(u(n));return e}();if(t=r.match(e.longValue)){if(o=u(t[1]),o>4294967295||o<0)throw new Error("ipaddr: address outside defined range");return function(){const r=[];let t;for(t=0;t<=24;t+=8)r.push(o>>t&255);return r}().reverse()}return(t=r.match(e.twoOctet))?function(){const r=t.slice(1,4),e=[];if(o=u(r[1]),o>16777215||o<0)throw new Error("ipaddr: address outside defined range");return e.push(u(r[0])),e.push(o>>16&255),e.push(o>>8&255),e.push(255&o),e}():(t=r.match(e.threeOctet))?function(){const r=t.slice(1,5),e=[];if(o=u(r[2]),o>65535||o<0)throw new Error("ipaddr: address outside defined range");return e.push(u(r[0])),e.push(u(r[1])),e.push(o>>8&255),e.push(255&o),e}():null},p.IPv4.subnetMaskFromPrefixLength=function(r){if((r=parseInt(r))<0||r>32)throw new Error("ipaddr: invalid IPv4 prefix length");const t=[0,0,0,0];let e=0;const n=Math.floor(r/8);for(;e<n;)t[e]=255,e++;return n<4&&(t[n]=Math.pow(2,r%8)-1<<8-r%8),new this(t)},p.IPv6=function(){function r(r,t){let e,n;if(16===r.length)for(this.parts=[],e=0;e<=14;e+=2)this.parts.push(r[e]<<8|r[e+1]);else{if(8!==r.length)throw new Error("ipaddr: ipv6 part count should be 8 or 16");this.parts=r}for(e=0;e<this.parts.length;e++)if(n=this.parts[e],!(0<=n&&n<=65535))throw new Error("ipaddr: ipv6 part should fit in 16 bits");t&&(this.zoneId=t)}return r.prototype.SpecialRanges={unspecified:[new r([0,0,0,0,0,0,0,0]),128],linkLocal:[new r([65152,0,0,0,0,0,0,0]),10],multicast:[new r([65280,0,0,0,0,0,0,0]),8],loopback:[new r([0,0,0,0,0,0,0,1]),128],uniqueLocal:[new r([64512,0,0,0,0,0,0,0]),7],ipv4Mapped:[new r([0,0,0,0,0,65535,0,0]),96],discard:[new r([256,0,0,0,0,0,0,0]),64],rfc6145:[new r([0,0,0,0,65535,0,0,0]),96],rfc6052:[new r([100,65435,0,0,0,0,0,0]),96],"6to4":[new r([8194,0,0,0,0,0,0,0]),16],teredo:[new r([8193,0,0,0,0,0,0,0]),32],benchmarking:[new r([8193,2,0,0,0,0,0,0]),48],amt:[new r([8193,3,0,0,0,0,0,0]),32],as112v6:[[new r([8193,4,274,0,0,0,0,0]),48],[new r([9760,79,32768,0,0,0,0,0]),48]],deprecated:[new r([8193,16,0,0,0,0,0,0]),28],orchid2:[new r([8193,32,0,0,0,0,0,0]),28],droneRemoteIdProtocolEntityTags:[new r([8193,48,0,0,0,0,0,0]),28],reserved:[[new r([8193,0,0,0,0,0,0,0]),23],[new r([8193,3512,0,0,0,0,0,0]),32]]},r.prototype.isIPv4MappedAddress=function(){return"ipv4Mapped"===this.range()},r.prototype.kind=function(){return"ipv6"},r.prototype.match=function(r,t){let e;if(void 0===t&&(e=r,r=e[0],t=e[1]),"ipv6"!==r.kind())throw new Error("ipaddr: cannot match ipv6 address with non-ipv6 one");return f(this.parts,r.parts,16,t)},r.prototype.prefixLengthFromSubnetMask=function(){let r=0,t=!1;const e={0:16,32768:15,49152:14,57344:13,61440:12,63488:11,64512:10,65024:9,65280:8,65408:7,65472:6,65504:5,65520:4,65528:3,65532:2,65534:1,65535:0};let n,o;for(let i=7;i>=0;i-=1){if(n=this.parts[i],!(n in e))return null;if(o=e[n],t&&0!==o)return null;16!==o&&(t=!0),r+=o}return 128-r},r.prototype.range=function(){return p.subnetMatch(this,this.SpecialRanges)},r.prototype.toByteArray=function(){let r;const t=[],e=this.parts;for(let n=0;n<e.length;n++)r=e[n],t.push(r>>8),t.push(255&r);return t},r.prototype.toFixedLengthString=function(){const r=function(){const r=[];for(let t=0;t<this.parts.length;t++)r.push(d(this.parts[t].toString(16),4));return r}.call(this).join(":");let t="";return this.zoneId&&(t=`%${this.zoneId}`),r+t},r.prototype.toIPv4Address=function(){if(!this.isIPv4MappedAddress())throw new Error("ipaddr: trying to convert a generic ipv6 address to ipv4");const r=this.parts.slice(-2),t=r[0],e=r[1];return new p.IPv4([t>>8,255&t,e>>8,255&e])},r.prototype.toNormalizedString=function(){const r=function(){const r=[];for(let t=0;t<this.parts.length;t++)r.push(this.parts[t].toString(16));return r}.call(this).join(":");let t="";return this.zoneId&&(t=`%${this.zoneId}`),r+t},r.prototype.toRFC5952String=function(){const r=/((^|:)(0(:|$)){2,})/g,t=this.toNormalizedString();let e,n=0,o=-1;for(;e=r.exec(t);)e[0].length>o&&(n=e.index,o=e[0].length);return o<0?t:`${t.substring(0,n)}::${t.substring(n+o)}`},r.prototype.toString=function(){return this.toRFC5952String()},r}(),p.IPv6.broadcastAddressFromCIDR=function(r){try{const t=this.parseCIDR(r),e=t[0].toByteArray(),n=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[];let i=0;for(;i<16;)o.push(parseInt(e[i],10)|255^parseInt(n[i],10)),i++;return new this(o)}catch(r){throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${r})`)}},p.IPv6.isIPv6=function(r){return null!==this.parser(r)},p.IPv6.isValid=function(r){if("string"==typeof r&&-1===r.indexOf(":"))return!1;try{const t=this.parser(r);return new this(t.parts,t.zoneId),!0}catch(r){return!1}},p.IPv6.isValidCIDR=function(r){if("string"==typeof r&&-1===r.indexOf(":"))return!1;try{return this.parseCIDR(r),!0}catch(r){return!1}},p.IPv6.networkAddressFromCIDR=function(r){let t,e,n,o,i;try{for(t=this.parseCIDR(r),n=t[0].toByteArray(),i=this.subnetMaskFromPrefixLength(t[1]).toByteArray(),o=[],e=0;e<16;)o.push(parseInt(n[e],10)&parseInt(i[e],10)),e++;return new this(o)}catch(r){throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${r})`)}},p.IPv6.parse=function(r){const t=this.parser(r);if(null===t.parts)throw new Error("ipaddr: string is not formatted like an IPv6 Address");return new this(t.parts,t.zoneId)},p.IPv6.parseCIDR=function(r){let t,e,n;if((e=r.match(/^(.+)\/(\d+)$/))&&(t=parseInt(e[2]),t>=0&&t<=128))return n=[this.parse(e[1]),t],Object.defineProperty(n,"toString",{value:function(){return this.join("/")}}),n;throw new Error("ipaddr: string is not formatted like an IPv6 CIDR range")},p.IPv6.parser=function(r){let t,e,n,o,i,s;if(n=r.match(a.deprecatedTransitional))return this.parser(`::ffff:${n[1]}`);if(a.native.test(r))return c(r,8);if((n=r.match(a.transitional))&&(s=n[6]||"",t=n[1],n[1].endsWith("::")||(t=t.slice(0,-1)),t=c(t+s,6),t.parts)){for(i=[parseInt(n[2]),parseInt(n[3]),parseInt(n[4]),parseInt(n[5])],e=0;e<i.length;e++)if(o=i[e],!(0<=o&&o<=255))return null;return t.parts.push(i[0]<<8|i[1]),t.parts.push(i[2]<<8|i[3]),{parts:t.parts,zoneId:t.zoneId}}return null},p.IPv6.subnetMaskFromPrefixLength=function(r){if((r=parseInt(r))<0||r>128)throw new Error("ipaddr: invalid IPv6 prefix length");const t=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];let e=0;const n=Math.floor(r/8);for(;e<n;)t[e]=255,e++;return n<16&&(t[n]=Math.pow(2,r%8)-1<<8-r%8),new this(t)},p.fromByteArray=function(r){const t=r.length;if(4===t)return new p.IPv4(r);if(16===t)return new p.IPv6(r);throw new Error("ipaddr: the binary input is neither an IPv6 nor IPv4 address")},p.isValid=function(r){return p.IPv6.isValid(r)||p.IPv4.isValid(r)},p.isValidCIDR=function(r){return p.IPv6.isValidCIDR(r)||p.IPv4.isValidCIDR(r)},p.parse=function(r){if(p.IPv6.isValid(r))return p.IPv6.parse(r);if(p.IPv4.isValid(r))return p.IPv4.parse(r);throw new Error("ipaddr: the address has neither IPv6 nor IPv4 format")},p.parseCIDR=function(r){try{return p.IPv6.parseCIDR(r)}catch(t){try{return p.IPv4.parseCIDR(r)}catch(r){throw new Error("ipaddr: the address has neither IPv6 nor IPv4 CIDR format")}}},p.process=function(r){const t=this.parse(r);return"ipv6"===t.kind()&&t.isIPv4MappedAddress()?t.toIPv4Address():t},p.subnetMatch=function(r,t,e){let n,o,i,s;for(o in null==e&&(e="unicast"),t)if(Object.prototype.hasOwnProperty.call(t,o))for(i=t[o],!i[0]||i[0]instanceof Array||(i=[i]),n=0;n<i.length;n++)if(s=i[n],r.kind()===s[0].kind()&&r.match.apply(r,s))return o;return e},E.exports?E.exports=p:r.ipaddr=p}(r);var x=P.exports;export{p as b,$ as d,b as e,x as i};
-//# sourceMappingURL=ipaddr-a72db8ee.js.map