npm - @fleet-sdk/common - Versions diffs - 0.3.4 → 0.6.4 - Mend

@fleet-sdk/common 0.3.4 → 0.6.4

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

Files changed (8) hide show

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/utils/assertions.ts","../src/utils/array.ts","../src/utils/bigInt.ts","../src/utils/utxo.ts","../src/utils/object.ts","../src/utils/bytes.ts","../src/types/common.ts","../src/models/collection.ts","../src/error.ts"],"names":["min","max","tokenId","Network","AddressType"],"mappings":";AAeO,SAAS,OAAO,WAAoB,OAAmD;AAC5F,MAAI;AAAW;AAEf,MAAI,MAAyB;AAC7B,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AACH,YAAM,IAAI,MAAM,KAAK;AACrB;AAAA,IACF,KAAK;AACH,YAAM,IAAI,MAAM,MAAM,CAAC;AACvB;AAAA,IACF;AACE,YAAM;AAAA,EACV;AAEA,QAAM;AACR;AAEO,SAAS,aAAgB,KAAQ,UAAyC;AAC/E,QAAM,OAAO,OAAO;AAEpB,MAAI,SAAS,UAAU;AACrB,UAAM,IAAI,MAAM,+BAA+B,QAAQ,WAAW,IAAI,IAAI;AAAA,EAC5E;AACF;AAEA,IAAM,WAAW,CAAC,UAAmB,OAAO,UAAU,SAAS,KAAK,KAAK;AACzE,SAAS,YAAY,OAAwB;AAC3C,MAAI,UAAU;AAAM,WAAO;AAC3B,QAAM,OAAO,OAAO;AAEpB,SAAO,SAAS,YAAY,SAAS,aAAa,SAAS,KAAK,EAAE,MAAM,GAAG,EAAE,IAAI;AACnF;AAEO,SAAS,iBAAoB,KAAQ,UAAsC;AAChF,QAAM,YAAY,eAAe;AAEjC,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,4BAA4B,SAAS,IAAI,WAAW,YAAY,GAAG,CAAC,IAAI;AAAA,EAC1F;AACF;AAEO,SAAS,QAAW,QAA0D;AACnF,MAAI,CAAC;AAAQ,WAAO;AAEpB,SAAO,MAAM,QAAQ,MAAM,IAAI,OAAO,WAAW,IAAI,OAAO,KAAK,MAAM,EAAE,WAAW;AACtF;AAEO,SAAS,KAAQ,QAA2C;AACjE,SAAO,CAAC,QAAQ,MAAM;AACxB;AAEO,SAAS,SAAY,OAAoC;AAC9D,SAAO,CAAC,CAAC;AACX;AAEO,SAAS,QAAW,OAA+B;AACxD,SAAO,CAAC;AACV;AAEO,SAAS,YAAY,GAA4B;AACtD,SAAO,MAAM,UAAa,MAAM,QAAQ,OAAO,MAAM,CAAC;AACxD;AAEO,SAAS,UAAa,GAA0B;AACrD,SAAO,CAAC,YAAY,CAAC;AACvB;AAEO,SAAS,OAAO,GAAY,KAA2B;AAC5D,SAAO,OAAO,UAAU,eAAe,KAAK,GAAG,GAAG;AACpD;;;ACzEO,SAAS,MAAS,OAAyD;AAChF,MAAI,CAAC;AAAO,WAAO;AACnB,SAAO,MAAM,SAAS,GAAG,cAAc;AAEvC,SAAO,MAAM,CAAC;AAChB;AASO,SAAS,KAAQ,OAAgD;AACtE,MAAI,CAAC;AAAO,WAAO;AACnB,SAAO,MAAM,SAAS,GAAG,cAAc;AAEvC,SAAO,GAAG,OAAO,EAAE;AACrB;AASO,SAAS,GAAM,OAAiC,OAA8B;AACnF,QAAM,MAAM,OAAO;AACnB,MAAI,CAAC;AAAK,WAAO;AAEjB,MAAI,QAAQ,GAAG;AACb,aAAS;AAAA,EACX;AAEA,SAAO,MAAM,KAAK;AACpB;AAKO,SAAS,cAAiB,OAAqB;AACpD,SAAO,MAAM,KAAK,CAAC,MAAM,UAAU;AACjC,WAAO,MAAM,QAAQ,IAAI,MAAM;AAAA,EACjC,CAAC;AACH;AAKO,SAAS,gBAAmB,OAAY,UAAsC;AACnF,SAAO,MAAM,KAAK,CAAC,MAAM,UAAU;AACjC,WAAO,MAAM,UAAU,CAAC,MAAM,SAAS,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM;AAAA,EACpE,CAAC;AACH;AAeO,SAAS,MAAS,OAAY,MAAqB;AACxD,MAAI,MAAM,UAAU,MAAM;AACxB,WAAO,CAAC,KAAK;AAAA,EACf;AAEA,QAAM,SAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AAC3C,WAAO,KAAK,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC;AAAA,EACtC;AAEA,SAAO;AACT;AAgBO,SAAS,QACd,OACA,UACA,QAA0B,OACrB;AACL,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAM,MAAS;AACrC,QAAI,SAAS,CAAC,IAAI,SAAS,CAAC,GAAG;AAC7B,aAAO,UAAU,QAAQ,IAAI;AAAA,IAC/B,WAAW,SAAS,CAAC,IAAI,SAAS,CAAC,GAAG;AACpC,aAAO,UAAU,QAAQ,KAAK;AAAA,IAChC,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;AAkBO,SAAS,SAAY,QAAsB,QAA+B;AAC/E,MAAI,WAAW,QAAQ;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,OAAO,QAAQ;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,GAAG;AAC3B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAkBO,SAAS,WACd,QACA,QACA,UACS;AACT,MAAI,WAAW,QAAQ;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,OAAO,QAAQ;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,SAAS,OAAO,CAAC,CAAC,MAAM,SAAS,OAAO,CAAC,CAAC,GAAG;AAC/C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAiBO,SAAS,WAAc,OAAqB,QAA+B;AAChF,MAAI,UAAU,QAAQ;AACpB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,MAAM,QAAQ;AAChC,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,MAAM,MAAM,CAAC,GAAG;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAiBO,SAAS,SAAY,OAAqB,QAA+B;AAC9E,MAAI,UAAU,QAAQ;AACpB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,MAAM,QAAQ;AAChC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,MAAM,SAAS,OAAO;AAErC,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,QAAI,OAAO,CAAC,MAAM,MAAM,IAAI,MAAM,GAAG;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAcO,SAAS,KAAQ,OAA2B;AACjD,MAAI,QAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC;AAClC;AAgBO,SAAS,OACd,OACA,UACA,YAAwC,cAC9B;AACV,MAAI,QAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AAEA,SAAO,MAAM;AAAA,IACX,MACG,OAAO,CAAC,KAAK,MAAM;AAClB,YAAM,MAAM,SAAS,CAAC;AAEtB,UAAI,cAAc,gBAAgB,IAAI,IAAI,GAAG,GAAG;AAC9C,eAAO;AAAA,MACT;AAEA,aAAO,IAAI,IAAI,KAAK,CAAC;AAAA,IACvB,GAAG,oBAAI,IAAI,CAAC,EACX,OAAO;AAAA,EACZ;AACF;AAaO,SAAS,QAAQ,OAAoC;AAC1D,SAAO,MAAM,QAAQ,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,OAAO,CAAC,IAAI;AACzE;;;AC1UO,IAAM,MAAM,OAAO,CAAC;AACpB,IAAM,MAAM,OAAO,CAAC;AACpB,IAAM,MAAM,OAAO,CAAC;AACpB,IAAM,OAAO,OAAO,EAAE;AACtB,IAAM,OAAO,OAAO,EAAE;AACtB,IAAM,QAAQ,OAAO,GAAG;AACxB,IAAM,QAAQ,OAAO,GAAG;AAMxB,SAAS,aAAa,QAA4B;AACvD,SAAO,OAAO,WAAW,WAAW,SAAS,OAAO,MAAM;AAC5D;AAyBO,SAAS,aAAa,YAAoB,SAA2C;AAC1F,MAAI,CAAC,YAAY;AACf,WAAO;AAAA,EACT;AAEA,YAAU,OAAO,WAAW,WAAW,EAAE,UAAU,QAAQ,IAAI;AAC/D,MAAI,YAAY,OAAO,GAAG;AACxB,cAAU,CAAC;AAAA,EACb;AAEA,UAAQ,WAAW,QAAQ,YAAY;AACvC,UAAQ,cAAc,QAAQ,eAAe;AAE7C,QAAM,YAAY,WAAW,MAAM,QAAQ,WAAW;AACtD,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AAEA,MAAI,CAAC,SAAS,OAAO,IAAI;AACzB,YAAU,oBAAoB,OAAO;AACrC,QAAM,WAAW,QAAQ,WAAW,GAAG,IAAI,MAAM;AAEjD,MAAI,CAAC,SAAS;AACZ,cAAU,IAAI,OAAO,QAAQ,QAAQ;AAAA,EACvC,WAAW,QAAQ,SAAS,QAAQ,UAAU;AAC5C,cAAU,QAAQ,OAAO,QAAQ,UAAU,GAAG;AAAA,EAChD;AAEA,SAAO,OAAO,WAAW,gBAAgB,UAAU,OAAO,CAAC;AAC7D;AAMA,SAAS,gBAAgB,OAAuB;AAC9C,SAAO,MAAM,QAAQ,OAAO,EAAE;AAChC;AA6BO,SAAS,WAAW,OAAe,SAA8C;AACtF,UAAQ,aAAa,KAAK;AAC1B,MAAI,CAAC,SAAS;AACZ,WAAO,MAAM,SAAS;AAAA,EACxB;AAEA,YAAU,OAAO,WAAW,WAAW,EAAE,UAAU,QAAQ,IAAI;AAC/D,UAAQ,WAAW,QAAQ,YAAY;AACvC,UAAQ,cAAc,QAAQ,eAAe;AAE7C,QAAM,MAAM,QAAQ,OAAO,QAAQ,QAAQ;AAC3C,QAAM,UAAU,QAAQ;AACxB,QAAM,UAAU,QAAQ,UAAU;AAElC,SAAO,uBAAuB,QAAQ,SAAS,EAAE,GAAG,QAAQ,SAAS,EAAE,GAAG,OAAO;AACnF;AAgBO,SAAS,QAAQ,OAAe,YAAoB,YAAY,IAAI;AACzE,SAAQ,QAAQ,aAAc,OAAO;AACvC;AAEA,SAAS,uBACP,SACA,SACA,SACQ;AACR,QAAM,cAAc,kBAAkB,SAAS,QAAQ,YAAY;AACnE,QAAM,cAAc,oBAAoB,QAAQ,SAAS,QAAQ,UAAU,GAAG,CAAC;AAE/E,MAAI,aAAa;AACf,WAAO,GAAG,WAAW,GAAG,QAAQ,WAAW,GAAG,WAAW;AAAA,EAC3D,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,SAAS,kBAAkB,OAAe,MAAuB;AAC/D,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,QAAQ,yBAAyB,IAAI;AACpD;AAEA,SAAS,oBAAoB,OAAuB;AAClD,MAAI,CAAC,MAAM,SAAS,GAAG,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,QAAQ,UAAU,EAAE;AACnC;AAEA,SAAS,oBAAoB,OAAuB;AAClD,MAAI,CAAC,MAAM,WAAW,GAAG,GAAG;AAC1B,WAAO;AAAA,EACT;AAEA,SAAO,MAAM,QAAQ,UAAU,EAAE;AACnC;AAqBO,SAAS,MACd,YACA,UACA,WACQ;AACR,MAAI,MAAM;AACV,MAAI,QAAQ,UAAU,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,YAAY;AAC7B,QAAI,YAAY,SAAS,KAAK,UAAU,IAAI,GAAG;AAC7C,aAAO,SAAS,IAAI;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,OAAkC,SAAiB;AACjE,MAAIA,OAAM,MAAM,OAAO;AAEvB,aAAW,OAAO,SAAS;AACzB,QAAI,MAAMA,MAAK;AACb,MAAAA,OAAM;AAAA,IACR;AAAA,EACF;AAEA,SAAOA;AACT;AAMO,SAAS,OAAkC,SAAiB;AACjE,MAAIC,OAAM,MAAM,OAAO;AAEvB,aAAW,OAAO,SAAS;AACzB,QAAI,MAAMA,MAAK;AACb,MAAAA,OAAM;AAAA,IACR;AAAA,EACF;AAEA,SAAOA;AACT;;;ACxPA,IAAM,oBAAoB;AAoBnB,SAAS,QAAQ,OAA+B,SAAwC;AAC7F,QAAM,WAA0C,CAAC;AAEjD,aAAW,OAAO,OAAO;AACvB,QAAI,YAAY,OAAO,KAAK,YAAY,mBAAmB;AACzD,eAAS,iBAAiB,KAAK,SAAS,iBAAiB,KAAK,OAAO,aAAa,IAAI,KAAK;AAAA,IAC7F;AAEA,QAAI,YAAY,mBAAmB;AACjC,iBAAW,SAAS,IAAI,QAAQ;AAC9B,YAAI,UAAU,OAAO,KAAK,YAAY,MAAM,SAAS;AACnD;AAAA,QACF;AAEA,iBAAS,MAAM,OAAO,KAAK,SAAS,MAAM,OAAO,KAAK,OAAO,aAAa,MAAM,MAAM;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,UAAU,OAAO,GAAG;AACtB,WAAO,SAAS,OAAO,KAAK;AAAA,EAC9B;AAEA,SAAO;AAAA,IACL,UAAU,SAAS,iBAAiB,KAAK;AAAA,IACzC,QAAQ,OAAO,KAAK,QAAQ,EACzB,OAAO,CAAC,MAAM,MAAM,iBAAiB,EACrC,IAAI,CAACC,cAAa,EAAE,SAAAA,UAAS,QAAQ,SAASA,QAAO,EAAE,EAAE;AAAA,EAC9D;AACF;AAgBO,SAAS,SACd,SACA,YACY;AACZ,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAU,QAAQ,OAAO;AAAA,EAC3B;AAEA,MAAI,MAAM,QAAQ,UAAU,GAAG;AAC7B,iBAAa,QAAQ,UAAU;AAAA,EACjC;AAEA,QAAM,SAAgC,CAAC;AACvC,QAAM,WAAW,QAAQ,WAAW,WAAW;AAE/C,aAAW,SAAS,QAAQ,QAAQ;AAClC,UAAM,UACJ,MAAM,UAAU,WAAW,OAAO,KAAK,CAAC,MAAM,EAAE,YAAY,MAAM,OAAO,GAAG,UAAU;AAExF,QAAI,YAAY,KAAK;AACnB,aAAO,KAAK,EAAE,SAAS,MAAM,SAAS,QAAQ,QAAQ,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,OAAO;AAC5B;AAEA,IAAM,mCAAmC;AACzC,IAAM,mCAAmC;AAgBlC,SAAS,0BAA0B,WAA2C;AACnF,MAAI,YAAY;AAChB,WAAS,IAAI,kCAAkC,KAAK,kCAAkC,KAAK;AACzF,UAAM,MAAM,IAAI,CAAC;AACjB,QAAI,UAAU,GAAG,GAAG;AAClB,UAAI,MAAM,kCAAkC;AAC1C,oBAAY;AACZ;AAAA,MACF;AAEA,UAAI,IAAI,YAAY,GAAG;AACrB,eAAO;AAAA,MACT;AAEA,kBAAY;AAAA,IACd;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,WAA6B,OAAiB,cAAmC;AAC/F,MAAI,QAAQ,YAAY,KAAK,QAAQ,KAAK,GAAG;AAC3C,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,IAAI,KAAAD,KAAI,IAAI;AACpB,MAAI,WAAW;AAEf,MAAI,IAAI;AACN,eAAW,MAAM,OAAO,EAAE;AAC1B,QAAI,QAAQ,QAAQ,GAAG;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,CAACA,MAAK;AACR,WAAO;AAAA,EACT;AAEA,MAAI,UAAUA,KAAI,wBAAwB,GAAG;AAC3C,UAAM,WAAW,qBAAqB,UAAUA,KAAI,wBAAwB;AAC5E,eAAW,SAAS;AAAA,MAClB,CAAC,SAAS,QAAQ,KAAK,MAAM,KAAK,KAAK,OAAO,MAAM,CAAC,UAAU,SAAS,IAAI,MAAM,OAAO,CAAC;AAAA,IAC5F;AAAA,EACF;AAEA,MAAI,UAAUA,KAAI,KAAK,KAAK,SAAS,SAASA,KAAI,OAAO;AACvD,eAAW,SAAS,MAAM,GAAGA,KAAI,KAAK;AAAA,EACxC;AAEA,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAcA,MAA0B;AACpE,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,IAAI,GAAG,IAAI,MAAM,UAAU,SAAS,OAAOA,MAAK,KAAK;AAC5D,QAAI,QAAQ,MAAM,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,OAAO,SAASA,MAAK;AAC5D;AAAA,IACF;AAEA,eAAW,SAAS,MAAM,CAAC,EAAE,QAAQ;AACnC,eAAS,IAAI,MAAM,OAAO;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAyCO,SAAS,iBACd,KACoC;AACpC,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,aAAa,IAAI,KAAK;AAAA,IAC7B,QAAQ,IAAI,OAAO,IAAI,CAAC,WAAW;AAAA,MACjC,SAAS,MAAM;AAAA,MACf,QAAQ,aAAa,MAAM,MAAM;AAAA,IACnC,EAAE;AAAA,EACJ;AACF;;;AClOO,SAAS,eAAe,OAAgC;AAC7D,QAAM,SAAkC,CAAC;AACzC,aAAW,OAAO,OAAO;AACvB,UAAM,MAAM,MAAM,GAAG;AACrB,QAAI,CAAC,YAAY,GAAG,GAAG;AACrB,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAeO,SAAS,eACd,SACA,UACO;AACP,SAAO,QAAQ,OAAO,IAAK,WAAqB,EAAE,GAAG,UAAU,GAAG,QAAQ;AAC5E;;;ACzCO,SAAS,eAAe,QAAkC;AAC/D,QAAM,IAAI,IAAI,WAAW,OAAO,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC,CAAC;AAErE,MAAI,MAAM;AACV,aAAW,SAAS,QAAQ;AAC1B,qBAAiB,OAAO,UAAU;AAElC,MAAE,IAAI,OAAO,GAAG;AAChB,WAAO,MAAM;AAAA,EACf;AAEA,SAAO;AACT;AAEO,SAAS,MAAM,OAAgB;AACpC,MAAI,CAAC,SAAS,MAAM,SAAS;AAAG,WAAO;AAEvC,MAAI,CAAC,MAAM,WAAW,IAAI,GAAG;AAC3B,YAAQ,OAAO;AAAA,EACjB;AAEA,SAAO,CAAC,MAAM,OAAO,KAAK,CAAC;AAC7B;AAOO,SAAS,WAAW,KAAqB;AAC9C,SAAO,IAAI,SAAS;AACtB;;;ACnBO,IAAK,UAAL,kBAAKE,aAAL;AACL,EAAAA,kBAAA,aAAU,KAAV;AACA,EAAAA,kBAAA,aAAU,MAAV;AAFU,SAAAA;AAAA,GAAA;AAKL,IAAK,cAAL,kBAAKC,iBAAL;AACL,EAAAA,0BAAA,UAAO,KAAP;AACA,EAAAA,0BAAA,UAAO,KAAP;AACA,EAAAA,0BAAA,SAAM,KAAN;AAHU,SAAAA;AAAA,GAAA;AAML,IAAM,sBAAsB;AAAA,EACjC,eAAe;AAAA,EACf,qBAAqB;AACvB;;;ACRO,IAAe,aAAf,MAAwF;AAAA,EAC1E;AAAA,EAEnB,cAAc;AACZ,SAAK,SAAS,CAAC;AAAA,EACjB;AAAA,EAEU,oBAAoB,OAAwB;AACpD,WAAO,QAAQ,KAAK,SAAS,KAAK,OAAO;AAAA,EAC3C;AAAA,EAEA,CAAC,OAAO,QAAQ,IAA4B;AAC1C,QAAI,UAAU;AAEd,WAAO;AAAA,MACL,MAAM,MAAM;AACV,eAAO;AAAA,UACL,MAAM,WAAW,KAAK;AAAA,UACtB,OAAO,KAAK,OAAO,SAAS;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,SAAiB;AAC1B,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,UAAmB;AAC5B,WAAO,KAAK,WAAW;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,GAAG,OAA6B;AACrC,QAAI,KAAK,oBAAoB,KAAK,GAAG;AACnC,YAAM,IAAI,WAAW,UAAU,KAAK,oBAAoB;AAAA,IAC1D;AAEA,WAAO,KAAK,OAAO,KAAK;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,IAAI,OAAgC,SAAwC;AACjF,WAAO,KAAK,cAAc,OAAO,OAAO;AAAA,EAC1C;AAAA,EAWU,QAAQ,MAAmC,SAAwC;AAC3F,QAAI,UAAU,OAAO,KAAK,UAAU,QAAQ,KAAK,GAAG;AAClD,UAAI,QAAQ,UAAU,KAAK,QAAQ;AACjC,aAAK,OAAO,KAAK,KAAK,KAAK,IAAI,CAAC;AAEhC,eAAO,KAAK;AAAA,MACd;AAEA,UAAI,KAAK,oBAAoB,QAAQ,KAAK,GAAG;AAC3C,cAAM,IAAI,WAAW,UAAU,QAAQ,KAAK,oBAAoB;AAAA,MAClE;AAEA,WAAK,OAAO,OAAO,QAAQ,OAAO,GAAG,KAAK,KAAK,IAAI,CAAC;AAEpD,aAAO,KAAK;AAAA,IACd;AAEA,SAAK,OAAO,KAAK,KAAK,KAAK,IAAI,CAAC;AAEhC,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEU,cAAc,OAAgC,SAAwC;AAC9F,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,UAAU,OAAO,KAAK,UAAU,QAAQ,KAAK,GAAG;AAClD,gBAAQ,MAAM,QAAQ;AAAA,MACxB;AAEA,iBAAW,QAAQ,OAAO;AACxB,aAAK,QAAQ,MAAM,OAAO;AAAA,MAC5B;AAAA,IACF,OAAO;AACL,WAAK,QAAQ,OAAO,OAAO;AAAA,IAC7B;AAEA,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,UAA0B;AAC/B,WAAO,CAAC,GAAG,KAAK,MAAM;AAAA,EACxB;AAAA,EAEO,OACL,YAMA,cACG;AACH,WAAO,KAAK,OAAO,OAAO,YAAY,YAAY;AAAA,EACpD;AACF;;;AClJO,IAAM,aAAN,cAAyB,MAAM;AAAA,EACpC,YAAY,SAAkB,SAAwB;AACpD,UAAM,SAAS,OAAO;AAEtB,WAAO,eAAe,MAAM,WAAW,SAAS;AAChD,SAAK,OAAO,WAAW;AAAA,EACzB;AACF;AAEO,IAAM,oBAAN,cAAgC,WAAW;AAAA,EAChD,YAAY,SAAkB;AAC5B,UAAM,OAAO;AAAA,EACf;AACF;AAEO,IAAM,0BAAN,cAAsC,WAAW;AAAA,EACtD,YAAY,SAAkB,SAAwB;AACpD,UAAM,SAAS,OAAO;AAAA,EACxB;AACF","sourcesContent":["export type AssertErrorMessageInput = string \| Error \| (() => string);\n\n// eslint-disable-next-line @typescript-eslint/ban-types\ntype Constructable = Function;\n\ntype JSPrimitiveTypes =\n \| \"string\"\n \| \"number\"\n \| \"bigint\"\n \| \"boolean\"\n \| \"symbol\"\n \| \"undefined\"\n \| \"object\"\n \| \"function\";\n\nexport function assert(condition: boolean, error: AssertErrorMessageInput): asserts condition {\n if (condition) return;\n\n let err: Error \| undefined = undefined;\n switch (typeof error) {\n case \"string\":\n err = new Error(error);\n break;\n case \"function\":\n err = new Error(error());\n break;\n default:\n err = error;\n }\n\n throw err;\n}\n\nexport function assertTypeOf<T>(obj: T, expected: JSPrimitiveTypes): asserts obj {\n const type = typeof obj;\n\n if (type !== expected) {\n throw new Error(`Expected an object of type '${expected}', got '${type}'.`);\n }\n}\n\nconst toString = (value: unknown) => Object.prototype.toString.call(value);\nfunction getTypeName(value: unknown): string {\n if (value === null) return \"null\";\n const type = typeof value;\n\n return type === \"object\" \|\| type === \"function\" ? toString(value).slice(8, -1) : type;\n}\n\nexport function assertInstanceOf<T>(obj: T, expected: Constructable): asserts obj {\n const condition = obj instanceof expected;\n\n if (!condition) {\n throw new Error(`Expected an instance of '${expected.name}', got '${getTypeName(obj)}'.`);\n }\n}\n\nexport function isEmpty<T>(target: T \| null \| undefined): target is undefined \| null {\n if (!target) return true;\n\n return Array.isArray(target) ? target.length === 0 : Object.keys(target).length === 0;\n}\n\nexport function some<T>(target: T \| null \| undefined): target is T {\n return !isEmpty(target);\n}\n\nexport function isTruthy<T>(value?: T): value is NonNullable<T> {\n return !!value;\n}\n\nexport function isFalsy<T>(value?: T): value is undefined {\n return !value;\n}\n\nexport function isUndefined(v: unknown): v is undefined {\n return v === undefined \|\| v === null \|\| Number.isNaN(v);\n}\n\nexport function isDefined<T>(v: T \| undefined): v is T {\n return !isUndefined(v);\n}\n\nexport function hasKey(o: unknown, key: PropertyKey): boolean {\n return Object.prototype.hasOwnProperty.call(o, key);\n}\n","import { SortingDirection, SortingSelector } from \"../types\";\nimport { assert, isEmpty } from \"./assertions\";\n\ntype ObjectSelector<T> = (item: T) => T[keyof T];\n\n/*\n Returns the first element of an array.\n * @param array\n * @throws an error if the array is empty.\n /\nexport function first(array: undefined): undefined;\nexport function first<T>(array: ArrayLike<T>): T;\nexport function first<T>(array: ArrayLike<T> \| undefined): T \| number \| undefined {\n if (!array) return undefined;\n assert(array.length > 0, \"Empty array.\");\n\n return array[0];\n}\n\n/\n Returns the last element of an array.\n * @param array\n * @throws an error if the array is empty.\n /\nexport function last(array: undefined): undefined;\nexport function last<T>(array: ArrayLike<T>): T;\nexport function last<T>(array: ArrayLike<T> \| undefined): T \| undefined {\n if (!array) return undefined;\n assert(array.length > 0, \"Empty array.\");\n\n return at(array, -1);\n}\n\n/\n Returns the element at the specified index. Negative indices are counted from the end of the array.\n * @param array\n * @param index\n /\nexport function at(array: undefined, index: number): undefined;\nexport function at<T>(array: ArrayLike<T>, index: number): T;\nexport function at<T>(array: ArrayLike<T> \| undefined, index: number): T \| undefined {\n const len = array?.length;\n if (!len) return undefined;\n\n if (index < 0) {\n index += len;\n }\n\n return array[index];\n}\n\n/\n Check for duplicate elements using the equality operator\n /\nexport function hasDuplicates<T>(array: T[]): boolean {\n return array.some((item, index) => {\n return array.indexOf(item) !== index;\n });\n}\n\n/\n Check for duplicate keys in complex elements\n /\nexport function hasDuplicatesBy<T>(array: T[], selector: ObjectSelector<T>): boolean {\n return array.some((item, index) => {\n return array.findIndex((x) => selector(x) === selector(item)) !== index;\n });\n}\n\n/\n Turns an array into chunks of the specified size\n * @param array\n * @param size\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const chunks = chunk(array, 2);\n * console.log(chunks);\n * // [[1, 2], [3, 4], [5]]\n * ```\n /\nexport function chunk<T>(array: T[], size: number): T[][] {\n if (array.length <= size) {\n return [array];\n }\n\n const chunks: T[][] = [];\n for (let i = 0; i < array.length; i += size) {\n chunks.push(array.slice(i, i + size));\n }\n\n return chunks;\n}\n\n/\n Sorts an array of objects by the specified property\n * @param array\n * @param iteratee\n * @param order\n \n @example\n * ```\n * const array = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const sorted = orderBy(array, (item) => item.age, \"desc\");\n * console.log(sorted);\n * // [{ name: \"Jane\", age: 30 }, { name: \"John\", age: 25 }]\n * ```\n /\nexport function orderBy<T>(\n array: T[],\n iteratee: SortingSelector<T>,\n order: SortingDirection = \"asc\"\n): T[] {\n return [...array].sort((a: T, b: T) => {\n if (iteratee(a) > iteratee(b)) {\n return order === \"asc\" ? 1 : -1;\n } else if (iteratee(a) < iteratee(b)) {\n return order === \"asc\" ? -1 : 1;\n } else {\n return 0;\n }\n });\n}\n\n/\n Checks if arrays are equal\n * @param array1\n * @param array2\n \n @example\n * ```\n * const array1 = [1, 2, 3];\n * const array2 = [1, 2, 3];\n * const array3 = [1, 2, 4];\n * const array4 = [1, 2, 3, 4];\n * areEqual(array1, array2); // true\n * areEqual(array1, array3); // false\n * areEqual(array1, array4); // false\n * ```\n /\nexport function areEqual<T>(array1: ArrayLike<T>, array2: ArrayLike<T>): boolean {\n if (array1 === array2) {\n return true;\n }\n\n if (array1.length != array2.length) {\n return false;\n }\n\n for (let i = 0; i < array1.length; i++) {\n if (array1[i] !== array2[i]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if arrays are equal by the specified property\n * @param array1\n * @param array2\n * @param selector\n \n @example\n * ```\n * const array1 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const array2 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const array3 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 31 }];\n \n areEqualBy(array1, array2, (item) => item.age); // true\n * areEqualBy(array1, array3, (item) => item.age); // false\n * ```\n /\nexport function areEqualBy<T>(\n array1: ArrayLike<T>,\n array2: ArrayLike<T>,\n selector: ObjectSelector<T>\n): boolean {\n if (array1 === array2) {\n return true;\n }\n\n if (array1.length != array2.length) {\n return false;\n }\n\n for (let i = 0; i < array1.length; i++) {\n if (selector(array1[i]) !== selector(array2[i])) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if the array starts with the specified target\n * @param array\n * @param target\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const target1 = [1, 2];\n * const target2 = [1, 3];\n \n startsWith(array, target1); // true\n * startsWith(array, target2); // false\n * ```\n /\nexport function startsWith<T>(array: ArrayLike<T>, target: ArrayLike<T>): boolean {\n if (array === target) {\n return true;\n }\n\n if (target.length > array.length) {\n return false;\n }\n\n for (let i = 0; i < target.length; i++) {\n if (target[i] !== array[i]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if the array ends with the specified target\n * @param array\n * @param target\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const target1 = [4, 5];\n * const target2 = [3, 5];\n \n endsWith(array, target1); // true\n * endsWith(array, target2); // false\n * ```\n /\nexport function endsWith<T>(array: ArrayLike<T>, target: ArrayLike<T>): boolean {\n if (array === target) {\n return true;\n }\n\n if (target.length > array.length) {\n return false;\n }\n\n const offset = array.length - target.length;\n\n for (let i = target.length - 1; i >= 0; i--) {\n if (target[i] !== array[i + offset]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Makes an array unique by removing duplicate elements\n * @param array\n \n @example\n * ```\n * const array = [1, 2, 3, 3, 4, 5, 5];\n * const unique = uniq(array);\n * console.log(unique);\n * // [1, 2, 3, 4, 5]\n * ```\n /\nexport function uniq<T>(array: Array<T>): Array<T> {\n if (isEmpty(array)) {\n return array;\n }\n\n return Array.from(new Set(array));\n}\n\n/\n Makes an array unique by removing duplicate elements using the specified property\n * @param array\n * @param selector\n * @param selection\n \n @example\n * ```\n * const array = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }, { name: \"John\", age: 30 }];\n * const unique = uniqBy(array, (item) => item.name);\n * console.log(unique);\n * // [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }]\n * ```\n /\nexport function uniqBy<T>(\n array: Array<T>,\n selector: ObjectSelector<T>,\n selection: \"keep-first\" \| \"keep-last\" = \"keep-first\"\n): Array<T> {\n if (isEmpty(array)) {\n return array;\n }\n\n return Array.from(\n array\n .reduce((map, e) => {\n const key = selector(e);\n\n if (selection === \"keep-first\" && map.has(key)) {\n return map;\n }\n\n return map.set(key, e);\n }, new Map())\n .values()\n );\n}\n\n/\n Returns the depth of an array\n * @param array\n \n @example\n * ```\n * const array = [1, 2, 3, [4, 5, [6, 7]]];\n * const depth = depthOf(array);\n * console.log(depth);\n * // 3\n /\nexport function depthOf(array: unknown \| unknown[]): number {\n return Array.isArray(array) ? 1 + Math.max(0, ...array.map(depthOf)) : 0;\n}\n","import { Amount } from \"../types\";\nimport { first } from \"./array\";\nimport { isEmpty, isUndefined } from \"./assertions\";\n\ntype NumberLike = string \| number \| bigint \| boolean;\n\nexport const _0n = BigInt(0);\nexport const _1n = BigInt(1);\nexport const _7n = BigInt(7);\nexport const _10n = BigInt(10);\nexport const _63n = BigInt(63);\nexport const _127n = BigInt(127);\nexport const _128n = BigInt(128);\n\n/\n Ensure that the given value is a bigint\n * @param number\n /\nexport function ensureBigInt(number: NumberLike): bigint {\n return typeof number === \"bigint\" ? number : BigInt(number);\n}\n\ntype ParsingOptions = {\n /\n Number of decimals.\n /\n decimals?: number;\n\n /\n Thousand mark char.\n * Default: `.`\n /\n decimalMark?: string;\n};\n\n/\n Parse a decimal string into a bigint with options\n * @param decimalStr\n * @param options\n \n @example\n * undecimalize(\"129.8379183\", { decimals: 9 }) // 129837918300n\n * undecimalize(\"1\", { decimals: 2 }) // 100n\n * undecimalize(\"1\", 2) // 100n\n /\nexport function undecimalize(decimalStr: string, options?: ParsingOptions \| number): bigint {\n if (!decimalStr) {\n return _0n;\n }\n\n options = typeof options == \"number\" ? { decimals: options } : options;\n if (isUndefined(options)) {\n options = {};\n }\n\n options.decimals = options.decimals \|\| 0;\n options.decimalMark = options.decimalMark \|\| \".\";\n\n const fragments = decimalStr.split(options.decimalMark);\n if (fragments.length > 2) {\n throw new Error(\"Invalid numeric string.\");\n }\n\n let [integer, decimal] = fragments;\n integer = _removeLeadingZeros(integer);\n const negative = integer.startsWith(\"-\") ? \"-\" : \"\";\n\n if (!decimal) {\n decimal = \"0\".repeat(options.decimals);\n } else if (decimal.length < options.decimals) {\n decimal = decimal.padEnd(options.decimals, \"0\");\n }\n\n return BigInt(negative + _stripNonDigits(integer + decimal));\n}\n\n/\n Strip all non-digits from a string\n * @param value\n /\nfunction _stripNonDigits(value: string): string {\n return value.replace(/\\D/g, \"\");\n}\n\ntype FormattingOptions = {\n /\n Number of decimals.\n /\n decimals: number;\n\n /\n Thousand mark char.\n /\n thousandMark?: string;\n\n /\n Decimal mark char.\n * Default: `.`\n /\n decimalMark?: string;\n};\n\n/\n Format a bigint into a decimal string with options\n * @param value\n * @param options\n \n @example\n * decimalize(129837918300n, { decimals: 9 }) // \"129.8379183\"\n * decimalize(100n, { decimals: 2 }) // \"1\"\n /\nexport function decimalize(value: Amount, options?: FormattingOptions \| number): string {\n value = ensureBigInt(value);\n if (!options) {\n return value.toString();\n }\n\n options = typeof options == \"number\" ? { decimals: options } : options;\n options.decimals = options.decimals \|\| 0;\n options.decimalMark = options.decimalMark \|\| \".\";\n\n const pow = _10n * BigInt(options.decimals);\n const integer = value / pow;\n const decimal = value - integer * pow;\n\n return _buildFormattedDecimal(integer.toString(10), decimal.toString(10), options);\n}\n\n/*\n Format a bigint percentage into a decimal string with options\n * @param value\n * @param percentage\n * @param precision\n \n @example\n * ```\n * percent(3498n, 1n) // 34n(1%)\n * percent(3498n, 2n) // 69n(2%)\n * percent(3498n, 10n) // 349n(10%)\n * ```\n \n /\nexport function percent(value: bigint, percentage: bigint, precision = 2n) {\n return (value * percentage) / 10n precision;\n}\n\nfunction _buildFormattedDecimal(\n integer: string,\n decimal: string,\n options: FormattingOptions\n): string {\n const integerPart = _addThousandMarks(integer, options.thousandMark);\n const decimalPart = _stripTrailingZeros(decimal.padStart(options.decimals, \"0\"));\n\n if (decimalPart) {\n return `${integerPart}${options.decimalMark}${decimalPart}`;\n } else {\n return integerPart;\n }\n}\n\nfunction _addThousandMarks(value: string, mark?: string): string {\n if (!mark) {\n return value;\n }\n\n return value.replace(/\\B(?=(\\d{3})+(?!\\d))/g, mark);\n}\n\nfunction _stripTrailingZeros(value: string): string {\n if (!value.endsWith(\"0\")) {\n return value;\n }\n\n return value.replace(/\\.?0+$/, \"\");\n}\n\nfunction _removeLeadingZeros(value: string): string {\n if (!value.startsWith(\"0\")) {\n return value;\n }\n\n return value.replace(/^0+\\.?/, \"\");\n}\n\n/\n * Sum a collection of numbers by a given iteratee\n * @param collection\n * @param iteratee\n * @param condition\n \n @example\n * ```\n * const values = [\n * { key: 1, value: 100n },\n * { key: 2, value: 200n },\n * { key: 3, value: 300n },\n * { key: 4, value: 400n },\n * ];\n \n sumBy(values, x => x.value) // 1000n\n * sumBy(values, x => x.value, x => x.key < 0) // 0n\n * sumBy(values, x => x.value, x => x.key % 2 === 0) // 600n\n /\nexport function sumBy<T>(\n collection: readonly T[],\n iteratee: (value: T) => bigint,\n condition?: (value: T) => boolean\n): bigint {\n let acc = _0n;\n if (isEmpty(collection)) {\n return acc;\n }\n\n for (const item of collection) {\n if (isUndefined(condition) \|\| condition(item)) {\n acc += iteratee(item);\n }\n }\n\n return acc;\n}\n\n/\n Get the minimum value from a collection of numbers\n * @param numbers\n /\nexport function min<T extends bigint \| number>(...numbers: T[]): T {\n let min = first(numbers);\n\n for (const num of numbers) {\n if (num < min) {\n min = num;\n }\n }\n\n return min;\n}\n\n/\n Get the maximum value from a collection of numbers\n * @param numbers\n /\nexport function max<T extends bigint \| number>(...numbers: T[]): T {\n let max = first(numbers);\n\n for (const num of numbers) {\n if (num > max) {\n max = num;\n }\n }\n\n return max;\n}\n","import { Amount, Box, BoxCandidate, NonMandatoryRegisters, TokenAmount, TokenId } from \"../types\";\nimport { isDefined, isEmpty, isUndefined } from \"./assertions\";\nimport { ensureBigInt } from \"./bigInt\";\nimport { _0n } from \"./bigInt\";\n\nconst NANOERGS_TOKEN_ID = \"nanoErgs\";\n\n/\n Calculates the sum of all nanoErgs and tokens in the given boxes.\n * @param boxes\n \n @example\n * ```\n * const boxes = [\n * { value: \"10\", assets: [{ tokenId: \"test\", amount: \"20\" }] },\n * { value: 20n, assets: [{ tokenId: \"test\", amount: 30n }] }\n * ];\n \n const sum = utxoSum(boxes);\n * console.log(sum);\n * // { nanoErgs: 30n, tokens: [{ tokenId: \"test\", amount: 50n }] }\n * ```\n /\nexport function utxoSum(boxes: MinimalBoxAmountsArray): BoxSummary;\nexport function utxoSum(boxes: MinimalBoxAmountsArray, tokenId: TokenId): bigint;\nexport function utxoSum(boxes: MinimalBoxAmountsArray, tokenId?: TokenId): BoxSummary \| bigint {\n const balances: { [tokenId: string]: bigint } = {};\n\n for (const box of boxes) {\n if (isUndefined(tokenId) \|\| tokenId === NANOERGS_TOKEN_ID) {\n balances[NANOERGS_TOKEN_ID] = (balances[NANOERGS_TOKEN_ID] \|\| _0n) + ensureBigInt(box.value);\n }\n\n if (tokenId !== NANOERGS_TOKEN_ID) {\n for (const token of box.assets) {\n if (isDefined(tokenId) && tokenId !== token.tokenId) {\n continue;\n }\n\n balances[token.tokenId] = (balances[token.tokenId] \|\| _0n) + ensureBigInt(token.amount);\n }\n }\n }\n\n if (isDefined(tokenId)) {\n return balances[tokenId] \|\| _0n;\n }\n\n return {\n nanoErgs: balances[NANOERGS_TOKEN_ID] \|\| _0n,\n tokens: Object.keys(balances)\n .filter((x) => x !== NANOERGS_TOKEN_ID)\n .map((tokenId) => ({ tokenId, amount: balances[tokenId] }))\n };\n}\n\n/\n Calculates the difference between two utxos or utxo sets.\n * @param minuend\n * @param subtrahend\n \n @example\n * ```\n * const minuend = [{ nanoErgs: 30n, tokens: [{ tokenId: \"test\", amount: 50n }] }];\n * const subtrahend = [{ nanoErgs: 10n, tokens: [{ tokenId: \"test\", amount: 20n }] }];\n * const diff = utxoDiff(minuend, subtrahend);\n * console.log(diff);\n * // { nanoErgs: 20n, tokens: [{ tokenId: \"test\", amount: 30n }] }\n * ```\n /\nexport function utxoDiff(\n minuend: BoxSummary \| Box<Amount>[],\n subtrahend: BoxSummary \| Box<Amount>[]\n): BoxSummary {\n if (Array.isArray(minuend)) {\n minuend = utxoSum(minuend);\n }\n\n if (Array.isArray(subtrahend)) {\n subtrahend = utxoSum(subtrahend);\n }\n\n const tokens: TokenAmount<bigint>[] = [];\n const nanoErgs = minuend.nanoErgs - subtrahend.nanoErgs;\n\n for (const token of minuend.tokens) {\n const balance =\n token.amount - (subtrahend.tokens.find((t) => t.tokenId === token.tokenId)?.amount \|\| _0n);\n\n if (balance !== _0n) {\n tokens.push({ tokenId: token.tokenId, amount: balance });\n }\n }\n\n return { nanoErgs, tokens };\n}\n\nconst MIN_NON_MANDATORY_REGISTER_INDEX = 4;\nconst MAX_NON_MANDATORY_REGISTER_INDEX = 9;\n\n/\n Checks if the given registers are densely packed.\n * @param registers\n \n @example\n * ```\n * const registers = {\n * R4: \"deadbeef\",\n * R6: \"cafe\",\n * };\n * const result = areRegistersDenselyPacked(registers);\n * console.log(result);\n * // false\n /\nexport function areRegistersDenselyPacked(registers: NonMandatoryRegisters): boolean {\n let lastIndex = 0;\n for (let i = MIN_NON_MANDATORY_REGISTER_INDEX; i <= MAX_NON_MANDATORY_REGISTER_INDEX; i++) {\n const key = `R${i}` as keyof NonMandatoryRegisters;\n if (registers[key]) {\n if (i === MIN_NON_MANDATORY_REGISTER_INDEX) {\n lastIndex = i;\n continue;\n }\n\n if (i - lastIndex > 1) {\n return false;\n }\n\n lastIndex = i;\n }\n }\n\n return true;\n}\n\n/\n Filters the given utxos by the given filter parameters.\n * @param utxos\n * @param filterParams\n /\nexport function utxoFilter<T extends Amount>(utxos: Box<T>[], filterParams: UTxOFilterParams<T>) {\n if (isEmpty(filterParams) \|\| isEmpty(utxos)) {\n return utxos;\n }\n\n const { by, max } = filterParams;\n let filtered = utxos;\n\n if (by) {\n filtered = utxos.filter(by);\n if (isEmpty(filtered)) {\n return filtered;\n }\n }\n\n if (!max) {\n return filtered;\n }\n\n if (isDefined(max.aggregatedDistinctTokens)) {\n const tokenIds = _getDistinctTokenIds(filtered, max.aggregatedDistinctTokens);\n filtered = filtered.filter(\n (utxo) => isEmpty(utxo.assets) \|\| utxo.assets.every((token) => tokenIds.has(token.tokenId))\n );\n }\n\n if (isDefined(max.count) && filtered.length > max.count) {\n filtered = filtered.slice(0, max.count);\n }\n\n return filtered;\n}\n\nfunction _getDistinctTokenIds(utxos: Box[], max: number): Set<string> {\n const tokenIds = new Set<string>();\n\n for (let i = 0; i < utxos.length && tokenIds.size < max; i++) {\n if (isEmpty(utxos[i].assets) \|\| utxos[i].assets.length > max) {\n continue;\n }\n\n for (const token of utxos[i].assets) {\n tokenIds.add(token.tokenId);\n }\n }\n\n return tokenIds;\n}\n\n/\n Parameters for filtering unspent transaction outputs (UTxOs).\n /\nexport type UTxOFilterParams<T extends Amount> = {\n /\n A function that returns a boolean indicating whether a given UTxO should be included in the filtered results.\n /\n by?: (utxo: Box<T>) => boolean;\n /\n An object specifying the maximum number of UTxOs and distinct tokens to include in the filtered results.\n /\n max?: {\n /\n The maximum number of UTxOs to include in the filtered results.\n /\n count?: number;\n /\n The maximum number of distinct tokens to include in the filtered results.\n /\n aggregatedDistinctTokens?: number;\n };\n};\n\nexport type BoxSummary = {\n nanoErgs: bigint;\n tokens: TokenAmount<bigint>[];\n};\n\nexport type MinimalBoxAmountsArray = readonly {\n value: Amount;\n assets: TokenAmount<Amount>[];\n}[];\n\n/\n Ensures that the value and asset amounts of a given box are represented as BigInts.\n * @returns A new box object with BigInt representation for the value and asset amounts.\n /\nexport function ensureUTxOBigInt(box: Box<Amount>): Box<bigint>;\nexport function ensureUTxOBigInt(candidate: BoxCandidate<Amount>): BoxCandidate<bigint>;\nexport function ensureUTxOBigInt(\n box: Box<Amount> \| BoxCandidate<Amount>\n): BoxCandidate<bigint> \| Box<bigint> {\n return {\n ...box,\n value: ensureBigInt(box.value),\n assets: box.assets.map((token) => ({\n tokenId: token.tokenId,\n amount: ensureBigInt(token.amount)\n }))\n };\n}\n","import { isEmpty, isUndefined } from \"./assertions\";\n\n/\n Remove undefined values from an object\n * @param value\n \n @example\n * ```\n * const obj = { a: 1, b: undefined };\n * const result = clearUndefined(obj);\n * console.log(result); // { a: 1 }\n * ```\n /\nexport function clearUndefined(value: Record<string, unknown>) {\n const result: Record<string, unknown> = {};\n for (const key in value) {\n const val = value[key];\n if (!isUndefined(val)) {\n result[key] = val;\n }\n }\n\n return result;\n}\n\n/\n Ensure that the options object has all the default values\n * @param options\n * @param defaults\n \n @example\n * ```\n * const options = { a: 1 };\n * const defaults = { a: 2, b: 3 };\n * const result = ensureDefaults(options, defaults);\n * console.log(result); // { a: 1, b: 3 }\n * ```\n /\nexport function ensureDefaults<T extends object, R extends object>(\n options: T \| undefined,\n defaults: R\n): R & T {\n return isEmpty(options) ? (defaults as R & T) : { ...defaults, ...options };\n}\n","import { assertInstanceOf } from \".\";\n\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n\n let pad = 0;\n for (const bytes of arrays) {\n assertInstanceOf(bytes, Uint8Array);\n\n r.set(bytes, pad);\n pad += bytes.length;\n }\n\n return r;\n}\n\nexport function isHex(value?: string) {\n if (!value \|\| value.length % 2) return false;\n\n if (!value.startsWith(\"0x\")) {\n value = \"0x\" + value;\n }\n\n return !isNaN(Number(value));\n}\n\n/\n Get hex string size in bytes\n * @param hex\n * @returns the byte size if the hex string\n /\nexport function byteSizeOf(hex: string): number {\n return hex.length / 2;\n}\n","export type HexString = string;\nexport type ErgoTreeHex = string;\nexport type Base58String = string;\nexport type Amount = string \| bigint;\n\nexport type OneOrMore<T> = T \| T[];\n\nexport type SortingSelector<T> = (item: T) => string \| number \| bigint;\nexport type SortingDirection = \"asc\" \| \"desc\";\n\nexport type FilterPredicate<T> = (item: T) => boolean;\n\nexport type BuildOutputType = \"default\" \| \"EIP-12\";\n\nexport enum Network {\n Mainnet = 0x00,\n Testnet = 0x10\n}\n\nexport enum AddressType {\n P2PK = 1,\n P2SH = 2,\n P2S = 3\n}\n\nexport const ergoTreeHeaderFlags = {\n sizeInclusion: 0x08,\n constantSegregation: 0x10\n} as const;\n\nexport type ErgoTreeHeaderFlag = (typeof ergoTreeHeaderFlags)[keyof typeof ergoTreeHeaderFlags];\n","import { OneOrMore } from \"../types\";\nimport { isDefined } from \"../utils\";\n\nexport type CollectionAddOptions = { index?: number };\n\n/\n Collection abstract model\n \n @example\n * Define a new collection class with internal type `number` and external type `string`\n * ```\n * class TestCollection extends Collection<number, string> {\n * protected _map(item: string \| number): number {\n * return Number(item);\n * }\n * // Some other methods\n * }\n * ```\n \n /\nexport abstract class Collection<InternalType, ExternalType> implements Iterable<InternalType> {\n protected readonly _items: InternalType[];\n\n constructor() {\n this._items = [];\n }\n\n protected _isIndexOutOfBounds(index: number): boolean {\n return index < 0 \|\| index >= this._items.length;\n }\n\n [Symbol.iterator](): Iterator<InternalType> {\n let counter = 0;\n\n return {\n next: () => {\n return {\n done: counter >= this.length,\n value: this._items[counter++]\n };\n }\n };\n }\n\n /*\n Number of items in the collection\n /\n public get length(): number {\n return this._items.length;\n }\n\n /\n True if the collection is empty\n /\n public get isEmpty(): boolean {\n return this.length === 0;\n }\n\n /\n Get item at index\n * @param index\n * @throws RangeError if index is out of bounds\n /\n public at(index: number): InternalType {\n if (this._isIndexOutOfBounds(index)) {\n throw new RangeError(`Index '${index}' is out of range.`);\n }\n\n return this._items[index];\n }\n\n /\n Add item to the collection\n * @param items\n * @param options\n * @returns The new length of the collection\n /\n public add(items: OneOrMore<ExternalType>, options?: CollectionAddOptions): number {\n return this._addOneOrMore(items, options);\n }\n\n abstract remove(item: unknown): number;\n\n /\n Map external type to internal type\n * @param item\n * @protected\n /\n protected abstract _map(item: ExternalType \| InternalType): InternalType;\n\n protected _addOne(item: InternalType \| ExternalType, options?: CollectionAddOptions): number {\n if (isDefined(options) && isDefined(options.index)) {\n if (options.index === this.length) {\n this._items.push(this._map(item));\n\n return this.length;\n }\n\n if (this._isIndexOutOfBounds(options.index)) {\n throw new RangeError(`Index '${options.index}' is out of range.`);\n }\n\n this._items.splice(options.index, 0, this._map(item));\n\n return this.length;\n }\n\n this._items.push(this._map(item));\n\n return this._items.length;\n }\n\n protected _addOneOrMore(items: OneOrMore<ExternalType>, options?: CollectionAddOptions): number {\n if (Array.isArray(items)) {\n if (isDefined(options) && isDefined(options.index)) {\n items = items.reverse();\n }\n\n for (const item of items) {\n this._addOne(item, options);\n }\n } else {\n this._addOne(items, options);\n }\n\n return this.length;\n }\n\n /\n Get the collection as an array\n */\n public toArray(): InternalType[] {\n return [...this._items];\n }\n\n public reduce<U>(\n callbackFn: (\n accumulator: U,\n currentValue: InternalType,\n currentIndex: number,\n array: InternalType[]\n ) => U,\n initialValue: U\n ): U {\n return this._items.reduce(callbackFn, initialValue);\n }\n}\n","export class FleetError extends Error {\n constructor(message?: string, options?: ErrorOptions) {\n super(message, options);\n\n Object.setPrototypeOf(this, new.target.prototype);\n this.name = new.target.name;\n }\n}\n\nexport class NotSupportedError extends FleetError {\n constructor(message?: string) {\n super(message);\n }\n}\n\nexport class BlockchainProviderError extends FleetError {\n constructor(message?: string, options?: ErrorOptions) {\n super(message, options);\n }\n}\n"]}
1	+ {"version":3,"sources":["../src/utils/assertions.ts","../src/utils/array.ts","../src/utils/bigInt.ts","../src/utils/utxo.ts","../src/utils/object.ts","../src/utils/bytes.ts","../src/types/enums.ts","../src/models/collection.ts","../src/error.ts"],"names":["min","max","tokenId","Network","AddressType"],"mappings":";;;AAeO,SAAS,MAAA,CAAO,WAAoB,KAAwC,EAAA;AACjF,EAAA,IAAI,SAAW,EAAA,OAAA;AAEf,EAAA,IAAI,GAAyB,GAAA,KAAA,CAAA,CAAA;AAC7B,EAAA,QAAQ,OAAO,KAAO;AAAA,IACpB,KAAK,QAAA;AACH,MAAM,GAAA,GAAA,IAAI,MAAM,KAAK,CAAA,CAAA;AACrB,MAAA,MAAA;AAAA,IACF,KAAK,UAAA;AACH,MAAM,GAAA,GAAA,IAAI,KAAM,CAAA,KAAA,EAAO,CAAA,CAAA;AACvB,MAAA,MAAA;AAAA,IACF;AACE,MAAM,GAAA,GAAA,KAAA,CAAA;AAAA,GACV;AAEA,EAAM,MAAA,GAAA,CAAA;AACR,CAAA;AAEO,SAAS,YAAA,CAAgB,KAAQ,QAAoC,EAAA;AAC1E,EAAA,MAAM,OAAO,OAAO,GAAA,CAAA;AAEpB,EAAA,IAAI,SAAS,QAAU,EAAA;AACrB,IAAA,MAAM,IAAI,KAAM,CAAA,CAAA,4BAAA,EAA+B,QAAQ,CAAA,QAAA,EAAW,IAAI,CAAI,EAAA,CAAA,CAAA,CAAA;AAAA,GAC5E;AACF,CAAA;AAEA,SAAS,YAAY,KAAwB,EAAA;AAC3C,EAAI,IAAA,KAAA,KAAU,MAAa,OAAA,MAAA,CAAA;AAC3B,EAAA,MAAM,OAAO,OAAO,KAAA,CAAA;AAEpB,EAAA,OAAO,IAAS,KAAA,QAAA,IAAY,IAAS,KAAA,UAAA,GACjC,MAAO,CAAA,SAAA,CAAU,QAAS,CAAA,IAAA,CAAK,KAAK,CAAA,CAAE,KAAM,CAAA,CAAA,EAAG,EAAE,CACjD,GAAA,IAAA,CAAA;AACN,CAAA;AAEO,SAAS,gBAAA,CAAoB,KAAQ,QAAsC,EAAA;AAChF,EAAA,MAAM,YAAY,GAAe,YAAA,QAAA,CAAA;AAEjC,EAAA,IAAI,CAAC,SAAW,EAAA;AACd,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,4BAA4B,QAAS,CAAA,IAAI,CAAW,QAAA,EAAA,WAAA,CAAY,GAAG,CAAC,CAAA,EAAA,CAAA;AAAA,KACtE,CAAA;AAAA,GACF;AACF,CAAA;AAEO,SAAS,QAAW,MAA0D,EAAA;AACnF,EAAI,IAAA,CAAC,QAAe,OAAA,IAAA,CAAA;AAEpB,EAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,MAAM,CAAI,GAAA,MAAA,CAAO,MAAW,KAAA,CAAA,GAAI,MAAO,CAAA,IAAA,CAAK,MAAM,CAAA,CAAE,MAAW,KAAA,CAAA,CAAA;AACtF,CAAA;AAEO,SAAS,KAAQ,MAA2C,EAAA;AACjE,EAAO,OAAA,CAAC,QAAQ,MAAM,CAAA,CAAA;AACxB,CAAA;AAEO,SAAS,SAAY,KAAoC,EAAA;AAC9D,EAAA,OAAO,CAAC,CAAC,KAAA,CAAA;AACX,CAAA;AAEO,SAAS,QAAW,KAA+B,EAAA;AACxD,EAAA,OAAO,CAAC,KAAA,CAAA;AACV,CAAA;AAEO,SAAS,YAAY,CAA4B,EAAA;AACtD,EAAA,OAAO,MAAM,KAAa,CAAA,IAAA,CAAA,KAAM,IAAQ,IAAA,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AACxD,CAAA;AAEO,SAAS,UAAa,CAA0B,EAAA;AACrD,EAAO,OAAA,CAAC,YAAY,CAAC,CAAA,CAAA;AACvB,CAAA;AAEO,SAAS,MAAA,CAAO,GAAY,GAA2B,EAAA;AAC5D,EAAA,OAAO,MAAO,CAAA,SAAA,CAAU,cAAe,CAAA,IAAA,CAAK,GAAG,GAAG,CAAA,CAAA;AACpD,CAAA;;;AC5EO,SAAS,MAAS,KAAyD,EAAA;AAChF,EAAI,IAAA,CAAC,OAAc,OAAA,KAAA,CAAA,CAAA;AACnB,EAAO,MAAA,CAAA,KAAA,CAAM,MAAS,GAAA,CAAA,EAAG,cAAc,CAAA,CAAA;AAEvC,EAAA,OAAO,MAAM,CAAC,CAAA,CAAA;AAChB,CAAA;AASO,SAAS,KAAQ,KAAgD,EAAA;AACtE,EAAI,IAAA,CAAC,OAAc,OAAA,KAAA,CAAA,CAAA;AACnB,EAAO,MAAA,CAAA,KAAA,CAAM,MAAS,GAAA,CAAA,EAAG,cAAc,CAAA,CAAA;AAEvC,EAAO,OAAA,EAAA,CAAG,OAAO,CAAE,CAAA,CAAA,CAAA;AACrB,CAAA;AASO,SAAS,EAAA,CAAM,OAAiC,KAA8B,EAAA;AACnF,EAAA,MAAM,MAAM,KAAO,EAAA,MAAA,CAAA;AACnB,EAAI,IAAA,CAAC,KAAY,OAAA,KAAA,CAAA,CAAA;AAEjB,EAAA,IAAI,QAAQ,CAAG,EAAA;AACb,IAAS,KAAA,IAAA,GAAA,CAAA;AAAA,GACX;AAEA,EAAA,OAAO,MAAM,KAAK,CAAA,CAAA;AACpB,CAAA;AAKO,SAAS,cAAiB,KAAqB,EAAA;AACpD,EAAA,OAAO,KAAM,CAAA,IAAA,CAAK,CAAC,IAAA,EAAM,KAAU,KAAA;AACjC,IAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,IAAI,CAAM,KAAA,KAAA,CAAA;AAAA,GAChC,CAAA,CAAA;AACH,CAAA;AAKO,SAAS,eAAA,CAAmB,OAAY,QAAsC,EAAA;AACnF,EAAA,OAAO,KAAM,CAAA,IAAA,CAAK,CAAC,IAAA,EAAM,KAAU,KAAA;AACjC,IAAO,OAAA,KAAA,CAAM,SAAU,CAAA,CAAC,CAAM,KAAA,QAAA,CAAS,CAAC,CAAM,KAAA,QAAA,CAAS,IAAI,CAAC,CAAM,KAAA,KAAA,CAAA;AAAA,GACnE,CAAA,CAAA;AACH,CAAA;AAeO,SAAS,KAAA,CAAS,OAAY,IAAqB,EAAA;AACxD,EAAI,IAAA,KAAA,CAAM,UAAU,IAAM,EAAA;AACxB,IAAA,OAAO,CAAC,KAAK,CAAA,CAAA;AAAA,GACf;AAEA,EAAA,MAAM,SAAgB,EAAC,CAAA;AACvB,EAAA,KAAA,IAAS,IAAI,CAAG,EAAA,CAAA,GAAI,KAAM,CAAA,MAAA,EAAQ,KAAK,IAAM,EAAA;AAC3C,IAAA,MAAA,CAAO,KAAK,KAAM,CAAA,KAAA,CAAM,CAAG,EAAA,CAAA,GAAI,IAAI,CAAC,CAAA,CAAA;AAAA,GACtC;AAEA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAgBO,SAAS,OACd,CAAA,KAAA,EACA,QACA,EAAA,KAAA,GAA0B,KACrB,EAAA;AACL,EAAA,OAAO,CAAC,GAAG,KAAK,EAAE,IAAK,CAAA,CAAC,GAAM,CAAS,KAAA;AACrC,IAAI,IAAA,QAAA,CAAS,CAAC,CAAI,GAAA,QAAA,CAAS,CAAC,CAAG,EAAA,OAAO,KAAU,KAAA,KAAA,GAAQ,CAAI,GAAA,CAAA,CAAA,CAAA;AAC5D,IAAI,IAAA,QAAA,CAAS,CAAC,CAAI,GAAA,QAAA,CAAS,CAAC,CAAG,EAAA,OAAO,KAAU,KAAA,KAAA,GAAQ,CAAK,CAAA,GAAA,CAAA,CAAA;AAC7D,IAAO,OAAA,CAAA,CAAA;AAAA,GACR,CAAA,CAAA;AACH,CAAA;AAkBO,SAAS,QAAA,CAAY,QAAsB,MAA+B,EAAA;AAC/E,EAAA,IAAI,WAAW,MAAQ,EAAA;AACrB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,MAAA,CAAO,MAAW,KAAA,MAAA,CAAO,MAAQ,EAAA;AACnC,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,CAAO,QAAQ,CAAK,EAAA,EAAA;AACtC,IAAA,IAAI,MAAO,CAAA,CAAC,CAAM,KAAA,MAAA,CAAO,CAAC,CAAG,EAAA;AAC3B,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT,CAAA;AAkBO,SAAS,UAAA,CACd,MACA,EAAA,MAAA,EACA,QACS,EAAA;AACT,EAAA,IAAI,WAAW,MAAQ,EAAA;AACrB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,MAAA,CAAO,MAAW,KAAA,MAAA,CAAO,MAAQ,EAAA;AACnC,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,CAAO,QAAQ,CAAK,EAAA,EAAA;AACtC,IAAI,IAAA,QAAA,CAAS,OAAO,CAAC,CAAC,MAAM,QAAS,CAAA,MAAA,CAAO,CAAC,CAAC,CAAG,EAAA;AAC/C,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT,CAAA;AAiBO,SAAS,UAAA,CAAc,OAAqB,MAA+B,EAAA;AAChF,EAAA,IAAI,UAAU,MAAQ,EAAA;AACpB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,MAAA,CAAO,MAAS,GAAA,KAAA,CAAM,MAAQ,EAAA;AAChC,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,CAAO,QAAQ,CAAK,EAAA,EAAA;AACtC,IAAA,IAAI,MAAO,CAAA,CAAC,CAAM,KAAA,KAAA,CAAM,CAAC,CAAG,EAAA;AAC1B,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT,CAAA;AAiBO,SAAS,QAAA,CAAY,OAAqB,MAA+B,EAAA;AAC9E,EAAA,IAAI,UAAU,MAAQ,EAAA;AACpB,IAAO,OAAA,IAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,MAAA,CAAO,MAAS,GAAA,KAAA,CAAM,MAAQ,EAAA;AAChC,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAM,MAAA,MAAA,GAAS,KAAM,CAAA,MAAA,GAAS,MAAO,CAAA,MAAA,CAAA;AAErC,EAAA,KAAA,IAAS,IAAI,MAAO,CAAA,MAAA,GAAS,CAAG,EAAA,CAAA,IAAK,GAAG,CAAK,EAAA,EAAA;AAC3C,IAAA,IAAI,OAAO,CAAC,CAAA,KAAM,KAAM,CAAA,CAAA,GAAI,MAAM,CAAG,EAAA;AACnC,MAAO,OAAA,KAAA,CAAA;AAAA,KACT;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT,CAAA;AAcO,SAAS,KAAQ,KAA2B,EAAA;AACjD,EAAI,IAAA,OAAA,CAAQ,KAAK,CAAG,EAAA;AAClB,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,OAAO,KAAM,CAAA,IAAA,CAAK,IAAI,GAAA,CAAI,KAAK,CAAC,CAAA,CAAA;AAClC,CAAA;AAgBO,SAAS,MACd,CAAA,KAAA,EACA,QACA,EAAA,SAAA,GAAwC,YAC9B,EAAA;AACV,EAAI,IAAA,OAAA,CAAQ,KAAK,CAAG,EAAA;AAClB,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,OAAO,KAAM,CAAA,IAAA;AAAA,IACX,KACG,CAAA,MAAA,CAAO,CAAC,GAAA,EAAK,CAAM,KAAA;AAClB,MAAM,MAAA,GAAA,GAAM,SAAS,CAAC,CAAA,CAAA;AAEtB,MAAA,IAAI,SAAc,KAAA,YAAA,IAAgB,GAAI,CAAA,GAAA,CAAI,GAAG,CAAG,EAAA;AAC9C,QAAO,OAAA,GAAA,CAAA;AAAA,OACT;AAEA,MAAO,OAAA,GAAA,CAAI,GAAI,CAAA,GAAA,EAAK,CAAC,CAAA,CAAA;AAAA,KACpB,kBAAA,IAAI,GAAI,EAAC,EACX,MAAO,EAAA;AAAA,GACZ,CAAA;AACF,CAAA;AAaO,SAAS,QAAQ,KAAoC,EAAA;AAC1D,EAAA,OAAO,KAAM,CAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,CAAI,GAAA,IAAA,CAAK,GAAI,CAAA,CAAA,EAAG,GAAG,KAAA,CAAM,GAAI,CAAA,OAAO,CAAC,CAAI,GAAA,CAAA,CAAA;AACzE,CAAA;;;ACtUa,IAAA,GAAA,GAAM,OAAO,CAAC,EAAA;AACd,IAAA,GAAA,GAAM,OAAO,CAAC,EAAA;AACd,IAAA,GAAA,GAAM,OAAO,CAAC,EAAA;AACd,IAAA,IAAA,GAAO,OAAO,EAAE,EAAA;AAChB,IAAA,IAAA,GAAO,OAAO,EAAE,EAAA;AAChB,IAAA,KAAA,GAAQ,OAAO,GAAG,EAAA;AAClB,IAAA,KAAA,GAAQ,OAAO,GAAG,EAAA;AAMxB,SAAS,aAAa,MAA4B,EAAA;AACvD,EAAA,OAAO,OAAO,MAAA,KAAW,QAAW,GAAA,MAAA,GAAS,OAAO,MAAM,CAAA,CAAA;AAC5D,CAAA;AAyBO,SAAS,YAAA,CAAa,OAAe,OAA2C,EAAA;AACrF,EAAI,IAAA,CAAC,OAAc,OAAA,GAAA,CAAA;AAEnB,EAAA,OAAA,GAAU,OAAO,OAAY,KAAA,QAAA,GAAW,EAAE,QAAA,EAAU,SAAY,GAAA,OAAA,CAAA;AAChE,EAAI,IAAA,WAAA,CAAY,OAAO,CAAG,EAAA;AACxB,IAAA,OAAA,GAAU,EAAC,CAAA;AAAA,GACb;AAEA,EAAQ,OAAA,CAAA,QAAA,GAAW,QAAQ,QAAY,IAAA,CAAA,CAAA;AACvC,EAAQ,OAAA,CAAA,WAAA,GAAc,QAAQ,WAAe,IAAA,GAAA,CAAA;AAE7C,EAAA,MAAM,SAAY,GAAA,KAAA,CAAM,KAAM,CAAA,OAAA,CAAQ,WAAW,CAAA,CAAA;AACjD,EAAI,IAAA,SAAA,CAAU,SAAS,CAAG,EAAA;AACxB,IAAM,MAAA,IAAI,MAAM,yBAAyB,CAAA,CAAA;AAAA,GAC3C;AAEA,EAAI,IAAA,CAAC,OAAS,EAAA,OAAO,CAAI,GAAA,SAAA,CAAA;AACzB,EAAA,OAAA,GAAU,mBAAmB,OAAO,CAAA,CAAA;AACpC,EAAA,MAAM,QAAW,GAAA,OAAA,CAAQ,UAAW,CAAA,GAAG,IAAI,GAAM,GAAA,EAAA,CAAA;AAEjD,EAAA,IAAI,CAAC,OAAS,EAAA;AACZ,IAAU,OAAA,GAAA,GAAA,CAAI,MAAO,CAAA,OAAA,CAAQ,QAAQ,CAAA,CAAA;AAAA,GAC5B,MAAA,IAAA,OAAA,CAAQ,MAAS,GAAA,OAAA,CAAQ,QAAU,EAAA;AAC5C,IAAA,OAAA,GAAU,OAAQ,CAAA,MAAA,CAAO,OAAQ,CAAA,QAAA,EAAU,GAAG,CAAA,CAAA;AAAA,GAChD;AAEA,EAAA,OAAO,MAAO,CAAA,QAAA,GAAW,eAAgB,CAAA,OAAA,GAAU,OAAO,CAAC,CAAA,CAAA;AAC7D,CAAA;AAMA,SAAS,gBAAgB,KAAuB,EAAA;AAC9C,EAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,KAAA,EAAO,EAAE,CAAA,CAAA;AAChC,CAAA;AA6BO,SAAS,UAAA,CAAW,OAAe,OAA8C,EAAA;AACtF,EAAA,KAAA,GAAQ,aAAa,KAAK,CAAA,CAAA;AAC1B,EAAA,IAAI,CAAC,OAAS,EAAA;AACZ,IAAA,OAAO,MAAM,QAAS,EAAA,CAAA;AAAA,GACxB;AAEA,EAAA,OAAA,GAAU,OAAO,OAAY,KAAA,QAAA,GAAW,EAAE,QAAA,EAAU,SAAY,GAAA,OAAA,CAAA;AAChE,EAAQ,OAAA,CAAA,QAAA,GAAW,QAAQ,QAAY,IAAA,CAAA,CAAA;AACvC,EAAQ,OAAA,CAAA,WAAA,GAAc,QAAQ,WAAe,IAAA,GAAA,CAAA;AAE7C,EAAA,MAAM,GAAM,GAAA,IAAA,IAAQ,MAAO,CAAA,OAAA,CAAQ,QAAQ,CAAA,CAAA;AAC3C,EAAA,MAAM,UAAU,KAAQ,GAAA,GAAA,CAAA;AACxB,EAAM,MAAA,OAAA,GAAU,QAAQ,OAAU,GAAA,GAAA,CAAA;AAElC,EAAO,OAAA,qBAAA,CAAsB,QAAQ,QAAS,CAAA,EAAE,GAAG,OAAQ,CAAA,QAAA,CAAS,EAAE,CAAA,EAAG,OAAO,CAAA,CAAA;AAClF,CAAA;AAgBO,SAAS,OAAQ,CAAA,KAAA,EAAe,UAAoB,EAAA,SAAA,GAAY,EAAI,EAAA;AACzE,EAAQ,OAAA,KAAA,GAAQ,aAAc,GAAO,IAAA,SAAA,CAAA;AACvC,CAAA;AAEA,SAAS,qBAAA,CACP,OACA,EAAA,OAAA,EACA,OACQ,EAAA;AACR,EAAA,MAAM,GAAM,GAAA,gBAAA,CAAiB,OAAS,EAAA,OAAA,CAAQ,YAAY,CAAA,CAAA;AAC1D,EAAA,MAAM,MAAM,kBAAmB,CAAA,OAAA,CAAQ,SAAS,OAAQ,CAAA,QAAA,EAAU,GAAG,CAAC,CAAA,CAAA;AACtE,EAAI,IAAA,GAAA,SAAY,CAAG,EAAA,GAAG,GAAG,OAAQ,CAAA,WAAW,GAAG,GAAG,CAAA,CAAA,CAAA;AAClD,EAAO,OAAA,GAAA,CAAA;AACT,CAAA;AAEA,SAAS,gBAAA,CAAiB,OAAe,IAAuB,EAAA;AAC9D,EAAA,IAAI,CAAC,IAAM,EAAA;AACT,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,uBAAA,EAAyB,IAAI,CAAA,CAAA;AACpD,CAAA;AAEA,SAAS,mBAAmB,KAAuB,EAAA;AACjD,EAAA,IAAI,CAAC,KAAA,CAAM,QAAS,CAAA,GAAG,CAAG,EAAA;AACxB,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,QAAA,EAAU,EAAE,CAAA,CAAA;AACnC,CAAA;AAEA,SAAS,mBAAmB,KAAuB,EAAA;AACjD,EAAA,IAAI,CAAC,KAAA,CAAM,UAAW,CAAA,GAAG,CAAG,EAAA;AAC1B,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAO,OAAA,KAAA,CAAM,OAAQ,CAAA,QAAA,EAAU,EAAE,CAAA,CAAA;AACnC,CAAA;AAqBO,SAAS,KAAA,CACd,UACA,EAAA,QAAA,EACA,SACQ,EAAA;AACR,EAAA,IAAI,GAAM,GAAA,GAAA,CAAA;AACV,EAAI,IAAA,OAAA,CAAQ,UAAU,CAAG,EAAA;AACvB,IAAO,OAAA,GAAA,CAAA;AAAA,GACT;AAEA,EAAA,KAAA,MAAW,QAAQ,UAAY,EAAA;AAC7B,IAAA,IAAI,WAAY,CAAA,SAAS,CAAK,IAAA,SAAA,CAAU,IAAI,CAAG,EAAA;AAC7C,MAAA,GAAA,IAAO,SAAS,IAAI,CAAA,CAAA;AAAA,KACtB;AAAA,GACF;AAEA,EAAO,OAAA,GAAA,CAAA;AACT,CAAA;AAMO,SAAS,OAAkC,OAAiB,EAAA;AACjE,EAAIA,IAAAA,IAAAA,GAAM,MAAM,OAAO,CAAA,CAAA;AAEvB,EAAA,KAAA,MAAW,OAAO,OAAS,EAAA;AACzB,IAAA,IAAI,MAAMA,IAAK,EAAA;AACb,MAAAA,IAAM,GAAA,GAAA,CAAA;AAAA,KACR;AAAA,GACF;AAEA,EAAOA,OAAAA,IAAAA,CAAAA;AACT,CAAA;AAMO,SAAS,OAAkC,OAAiB,EAAA;AACjE,EAAIC,IAAAA,IAAAA,GAAM,MAAM,OAAO,CAAA,CAAA;AAEvB,EAAA,KAAA,MAAW,OAAO,OAAS,EAAA;AACzB,IAAA,IAAI,MAAMA,IAAK,EAAA;AACb,MAAAA,IAAM,GAAA,GAAA,CAAA;AAAA,KACR;AAAA,GACF;AAEA,EAAOA,OAAAA,IAAAA,CAAAA;AACT,CAAA;;;AC3OA,IAAM,iBAAoB,GAAA,UAAA,CAAA;AAoBnB,SAAS,OAAA,CAAQ,OAA8B,OAAmB,EAAA;AACvE,EAAA,MAAM,WAA0C,EAAC,CAAA;AAEjD,EAAA,KAAA,MAAW,OAAO,KAAO,EAAA;AACvB,IAAA,IAAI,WAAY,CAAA,OAAO,CAAK,IAAA,OAAA,KAAY,iBAAmB,EAAA;AACzD,MAAS,QAAA,CAAA,iBAAiB,KACvB,QAAS,CAAA,iBAAiB,KAAK,GAAO,IAAA,YAAA,CAAa,IAAI,KAAK,CAAA,CAAA;AAAA,KACjE;AAEA,IAAA,IAAI,YAAY,iBAAmB,EAAA;AACjC,MAAW,KAAA,MAAA,KAAA,IAAS,IAAI,MAAQ,EAAA;AAC9B,QAAA,IAAI,SAAU,CAAA,OAAO,CAAK,IAAA,OAAA,KAAY,MAAM,OAAS,EAAA;AACnD,UAAA,SAAA;AAAA,SACF;AAEA,QAAS,QAAA,CAAA,KAAA,CAAM,OAAO,CAAA,GAAA,CACnB,QAAS,CAAA,KAAA,CAAM,OAAO,CAAK,IAAA,GAAA,IAAO,YAAa,CAAA,KAAA,CAAM,MAAM,CAAA,CAAA;AAAA,OAChE;AAAA,KACF;AAAA,GACF;AAEA,EAAI,IAAA,SAAA,CAAU,OAAO,CAAG,EAAA;AACtB,IAAO,OAAA,QAAA,CAAS,OAAO,CAAK,IAAA,GAAA,CAAA;AAAA,GAC9B;AAEA,EAAO,OAAA;AAAA,IACL,QAAA,EAAU,QAAS,CAAA,iBAAiB,CAAK,IAAA,GAAA;AAAA,IACzC,MAAA,EAAQ,OAAO,IAAK,CAAA,QAAQ,EACzB,MAAO,CAAA,CAAC,MAAM,CAAM,KAAA,iBAAiB,EACrC,GAAI,CAAA,CAACC,cAAa,EAAE,OAAA,EAAAA,UAAS,MAAQ,EAAA,QAAA,CAASA,QAAO,CAAA,EAAI,CAAA,CAAA;AAAA,GAC9D,CAAA;AACF,CAAA;AAgBO,SAAS,QACd,CAAA,OAAA,EACA,UACA,EAAA,8BAAA,GAAiC,KACrB,EAAA;AACZ,EAAA,IAAI,MAAM,OAAQ,CAAA,OAAO,CAAG,EAAA,OAAA,GAAU,QAAQ,OAAO,CAAA,CAAA;AACrD,EAAA,IAAI,MAAM,OAAQ,CAAA,UAAU,CAAG,EAAA,UAAA,GAAa,QAAQ,UAAU,CAAA,CAAA;AAE9D,EAAA,MAAM,SAAgC,EAAC,CAAA;AACvC,EAAM,MAAA,QAAA,GAAW,OAAQ,CAAA,QAAA,GAAW,UAAW,CAAA,QAAA,CAAA;AAC/C,EAAA,MAAM,gBAAmB,GAAA,IAAI,GAAI,CAAA,UAAA,CAAW,OAAO,GAAI,CAAA,CAAC,CAAM,KAAA,CAAC,CAAE,CAAA,OAAA,EAAS,CAAE,CAAA,MAAM,CAAC,CAAC,CAAA,CAAA;AAEpF,EAAW,KAAA,MAAA,KAAA,IAAS,QAAQ,MAAQ,EAAA;AAClC,IAAA,MAAM,gBAAmB,GAAA,gBAAA,CAAiB,GAAI,CAAA,KAAA,CAAM,OAAO,CAAK,IAAA,GAAA,CAAA;AAChE,IAAM,MAAA,OAAA,GAAU,KAAM,CAAA,MAAA,IAAU,gBAAoB,IAAA,GAAA,CAAA,CAAA;AAEpD,IAAA,IAAI,YAAY,GAAK,EAAA;AACnB,MAAA,MAAA,CAAO,KAAK,EAAE,OAAA,EAAS,MAAM,OAAS,EAAA,MAAA,EAAQ,SAAS,CAAA,CAAA;AAAA,KACzD;AAEA,IAAA,IAAI,mBAAmB,GAAK,EAAA;AAC1B,MAAiB,gBAAA,CAAA,MAAA,CAAO,MAAM,OAAO,CAAA,CAAA;AAAA,KACvC;AAAA,GACF;AAEA,EAAA,IAAI,CAAC,8BAAA,IAAkC,gBAAiB,CAAA,IAAA,GAAO,CAAG,EAAA;AAChE,IAAA,KAAA,MAAW,CAAC,OAAA,EAAS,MAAM,CAAA,IAAK,gBAAkB,EAAA;AAChD,MAAA,MAAA,CAAO,KAAK,EAAE,OAAA,EAAS,MAAQ,EAAA,CAAC,QAAQ,CAAA,CAAA;AAAA,KAC1C;AAAA,GACF;AAEA,EAAO,OAAA,EAAE,UAAU,MAAO,EAAA,CAAA;AAC5B,CAAA;AAEA,IAAM,gCAAmC,GAAA,CAAA,CAAA;AACzC,IAAM,gCAAmC,GAAA,CAAA,CAAA;AAgBlC,SAAS,0BAA0B,SAA2C,EAAA;AACnF,EAAA,IAAI,SAAY,GAAA,CAAA,CAAA;AAChB,EAAA,KAAA,IACM,CAAI,GAAA,gCAAA,EACR,CAAK,IAAA,gCAAA,EACL,CACA,EAAA,EAAA;AACA,IAAM,MAAA,GAAA,GAAM,IAAI,CAAC,CAAA,CAAA,CAAA;AACjB,IAAI,IAAA,SAAA,CAAU,GAAG,CAAG,EAAA;AAClB,MAAA,IAAI,MAAM,gCAAkC,EAAA;AAC1C,QAAY,SAAA,GAAA,CAAA,CAAA;AACZ,QAAA,SAAA;AAAA,OACF;AAEA,MAAI,IAAA,CAAA,GAAI,YAAY,CAAG,EAAA;AACrB,QAAO,OAAA,KAAA,CAAA;AAAA,OACT;AAEA,MAAY,SAAA,GAAA,CAAA,CAAA;AAAA,KACd;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT,CAAA;AAOO,SAAS,UAAA,CACd,OACA,YACA,EAAA;AACA,EAAA,IAAI,OAAQ,CAAA,YAAY,CAAK,IAAA,OAAA,CAAQ,KAAK,CAAG,EAAA;AAC3C,IAAO,OAAA,KAAA,CAAA;AAAA,GACT;AAEA,EAAA,MAAM,EAAE,EAAA,EAAI,GAAAD,EAAAA,IAAAA,EAAQ,GAAA,YAAA,CAAA;AACpB,EAAA,IAAI,QAAW,GAAA,KAAA,CAAA;AAEf,EAAA,IAAI,EAAI,EAAA;AACN,IAAW,QAAA,GAAA,KAAA,CAAM,OAAO,EAAE,CAAA,CAAA;AAC1B,IAAI,IAAA,OAAA,CAAQ,QAAQ,CAAG,EAAA;AACrB,MAAO,OAAA,QAAA,CAAA;AAAA,KACT;AAAA,GACF;AAEA,EAAA,IAAI,CAACA,IAAK,EAAA;AACR,IAAO,OAAA,QAAA,CAAA;AAAA,GACT;AAEA,EAAI,IAAA,SAAA,CAAUA,IAAI,CAAA,wBAAwB,CAAG,EAAA;AAC3C,IAAA,MAAM,QAAW,GAAA,oBAAA,CAAqB,QAAUA,EAAAA,IAAAA,CAAI,wBAAwB,CAAA,CAAA;AAC5E,IAAA,QAAA,GAAW,QAAS,CAAA,MAAA;AAAA,MAClB,CAAC,IAAA,KACC,OAAQ,CAAA,IAAA,CAAK,MAAM,CAAK,IAAA,IAAA,CAAK,MAAO,CAAA,KAAA,CAAM,CAAC,KAAU,KAAA,QAAA,CAAS,GAAI,CAAA,KAAA,CAAM,OAAO,CAAC,CAAA;AAAA,KACpF,CAAA;AAAA,GACF;AAEA,EAAA,IAAI,UAAUA,IAAI,CAAA,KAAK,KAAK,QAAS,CAAA,MAAA,GAASA,KAAI,KAAO,EAAA;AACvD,IAAA,QAAA,GAAW,QAAS,CAAA,KAAA,CAAM,CAAGA,EAAAA,IAAAA,CAAI,KAAK,CAAA,CAAA;AAAA,GACxC;AAEA,EAAO,OAAA,QAAA,CAAA;AACT,CAAA;AAEA,SAAS,oBAAA,CAAqB,OAAcA,IAA0B,EAAA;AACpE,EAAM,MAAA,QAAA,uBAAe,GAAY,EAAA,CAAA;AAEjC,EAAS,KAAA,IAAA,CAAA,GAAI,GAAG,CAAI,GAAA,KAAA,CAAM,UAAU,QAAS,CAAA,IAAA,GAAOA,MAAK,CAAK,EAAA,EAAA;AAC5D,IAAI,IAAA,OAAA,CAAQ,KAAM,CAAA,CAAC,CAAE,CAAA,MAAM,CAAK,IAAA,KAAA,CAAM,CAAC,CAAA,CAAE,MAAO,CAAA,MAAA,GAASA,IAAK,EAAA;AAC5D,MAAA,SAAA;AAAA,KACF;AAEA,IAAA,KAAA,MAAW,KAAS,IAAA,KAAA,CAAM,CAAC,CAAA,CAAE,MAAQ,EAAA;AACnC,MAAS,QAAA,CAAA,GAAA,CAAI,MAAM,OAAO,CAAA,CAAA;AAAA,KAC5B;AAAA,GACF;AAEA,EAAO,OAAA,QAAA,CAAA;AACT,CAAA;AAyCO,SAAS,iBACd,GACoC,EAAA;AACpC,EAAO,OAAA;AAAA,IACL,GAAG,GAAA;AAAA,IACH,KAAA,EAAO,YAAa,CAAA,GAAA,CAAI,KAAK,CAAA;AAAA,IAC7B,MAAQ,EAAA,GAAA,CAAI,MAAO,CAAA,GAAA,CAAI,CAAC,KAAW,MAAA;AAAA,MACjC,SAAS,KAAM,CAAA,OAAA;AAAA,MACf,MAAA,EAAQ,YAAa,CAAA,KAAA,CAAM,MAAM,CAAA;AAAA,KACjC,CAAA,CAAA;AAAA,GACJ,CAAA;AACF,CAAA;;;AC1PO,SAAS,eAAe,KAAgC,EAAA;AAC7D,EAAA,MAAM,SAAkC,EAAC,CAAA;AACzC,EAAA,KAAA,MAAW,OAAO,KAAO,EAAA;AACvB,IAAM,MAAA,GAAA,GAAM,MAAM,GAAG,CAAA,CAAA;AACrB,IAAI,IAAA,CAAC,WAAY,CAAA,GAAG,CAAG,EAAA;AACrB,MAAA,MAAA,CAAO,GAAG,CAAI,GAAA,GAAA,CAAA;AAAA,KAChB;AAAA,GACF;AAEA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAiBO,SAAS,cAAA,CACd,OACA,EAAA,QAAA,EACA,OACO,EAAA;AACP,EAAI,IAAA,OAAA,CAAQ,OAAO,CAAA,EAAU,OAAA,QAAA,CAAA;AAC7B,EAAA,IAAI,SAAS,iBAAmB,EAAA,OAAO,EAAE,GAAG,QAAA,EAAU,GAAG,OAAQ,EAAA,CAAA;AAEjE,EAAA,MAAM,MAAS,GAAA,EAAE,GAAG,QAAA,EAAU,GAAG,OAAQ,EAAA,CAAA;AACzC,EAAA,KAAA,MAAW,OAAO,MAAQ,EAAA;AACxB,IAAA,MAAA,CAAO,GAAG,CAAI,GAAA,OAAA,CAAQ,GAAc,CAAA,IAAK,SAAS,GAAc,CAAA,CAAA;AAAA,GAClE;AAEA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;;;ACpDO,SAAS,eAAe,MAAkC,EAAA;AAC/D,EAAA,MAAM,CAAI,GAAA,IAAI,UAAW,CAAA,MAAA,CAAO,MAAO,CAAA,CAAC,GAAK,EAAA,CAAA,KAAM,GAAM,GAAA,CAAA,CAAE,MAAQ,EAAA,CAAC,CAAC,CAAA,CAAA;AAErE,EAAA,IAAI,GAAM,GAAA,CAAA,CAAA;AACV,EAAA,KAAA,MAAW,SAAS,MAAQ,EAAA;AAC1B,IAAA,gBAAA,CAAiB,OAAO,UAAU,CAAA,CAAA;AAElC,IAAE,CAAA,CAAA,GAAA,CAAI,OAAO,GAAG,CAAA,CAAA;AAChB,IAAA,GAAA,IAAO,KAAM,CAAA,MAAA,CAAA;AAAA,GACf;AAEA,EAAO,OAAA,CAAA,CAAA;AACT,CAAA;AAEO,SAAS,MAAM,KAAgB,EAAA;AACpC,EAAA,IAAI,CAAC,KAAA,IAAS,KAAM,CAAA,MAAA,GAAS,GAAU,OAAA,KAAA,CAAA;AACvC,EAAA,OAAO,CAAC,MAAA,CAAO,KAAM,CAAA,MAAA,CAAO,KAAM,CAAA,UAAA,CAAW,IAAI,CAAA,GAAI,KAAQ,GAAA,CAAA,EAAA,EAAK,KAAK,CAAA,CAAE,CAAC,CAAA,CAAA;AAC5E,CAAA;AAOO,SAAS,WAAW,GAAqB,EAAA;AAC9C,EAAA,OAAO,IAAI,MAAS,GAAA,CAAA,CAAA;AACtB,CAAA;;;AC1BY,IAAA,OAAA,qBAAAE,QAAL,KAAA;AACL,EAAAA,QAAAA,CAAAA,QAAAA,CAAA,aAAU,CAAV,CAAA,GAAA,SAAA,CAAA;AACA,EAAAA,QAAAA,CAAAA,QAAAA,CAAA,aAAU,EAAV,CAAA,GAAA,SAAA,CAAA;AAFU,EAAAA,OAAAA,QAAAA,CAAAA;AAAA,CAAA,EAAA,OAAA,IAAA,EAAA,EAAA;AAKA,IAAA,WAAA,qBAAAC,YAAL,KAAA;AACL,EAAAA,YAAAA,CAAAA,YAAAA,CAAA,UAAO,CAAP,CAAA,GAAA,MAAA,CAAA;AACA,EAAAA,YAAAA,CAAAA,YAAAA,CAAA,UAAO,CAAP,CAAA,GAAA,MAAA,CAAA;AACA,EAAAA,YAAAA,CAAAA,YAAAA,CAAA,SAAM,CAAN,CAAA,GAAA,KAAA,CAAA;AACA,EAAAA,YAAAA,CAAAA,YAAAA,CAAA,SAAM,CAAN,CAAA,GAAA,KAAA,CAAA;AAJU,EAAAA,OAAAA,YAAAA,CAAAA;AAAA,CAAA,EAAA,WAAA,IAAA,EAAA,EAAA;AAOL,IAAM,mBAAsB,GAAA;AAAA,EACjC,aAAe,EAAA,CAAA;AAAA,EACf,mBAAqB,EAAA,EAAA;AACvB,EAAA;;;ACGO,IAAe,aAAf,MAEP;AAAA,EACqB,MAAA,CAAA;AAAA,EAEnB,WAAc,GAAA;AACZ,IAAA,IAAA,CAAK,SAAS,EAAC,CAAA;AAAA,GACjB;AAAA,EAEU,oBAAoB,KAAwB,EAAA;AACpD,IAAA,OAAO,KAAQ,GAAA,CAAA,IAAK,KAAS,IAAA,IAAA,CAAK,MAAO,CAAA,MAAA,CAAA;AAAA,GAC3C;AAAA,EAEA,CAAC,MAAO,CAAA,QAAQ,CAA4B,GAAA;AAC1C,IAAA,IAAI,OAAU,GAAA,CAAA,CAAA;AAEd,IAAO,OAAA;AAAA,MACL,MAAM,MAAM;AACV,QAAO,OAAA;AAAA,UACL,IAAA,EAAM,WAAW,IAAK,CAAA,MAAA;AAAA,UACtB,KAAA,EAAO,IAAK,CAAA,MAAA,CAAO,OAAS,EAAA,CAAA;AAAA,SAC9B,CAAA;AAAA,OACF;AAAA,KACF,CAAA;AAAA,GACF;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,MAAiB,GAAA;AAC1B,IAAA,OAAO,KAAK,MAAO,CAAA,MAAA,CAAA;AAAA,GACrB;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,OAAmB,GAAA;AAC5B,IAAA,OAAO,KAAK,MAAW,KAAA,CAAA,CAAA;AAAA,GACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,GAAG,KAA6B,EAAA;AACrC,IAAI,IAAA,IAAA,CAAK,mBAAoB,CAAA,KAAK,CAAG,EAAA;AACnC,MAAA,MAAM,IAAI,UAAA,CAAW,CAAU,OAAA,EAAA,KAAK,CAAoB,kBAAA,CAAA,CAAA,CAAA;AAAA,KAC1D;AAEA,IAAO,OAAA,IAAA,CAAK,OAAO,KAAK,CAAA,CAAA;AAAA,GAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,GAAA,CAAI,OAAgC,OAAwC,EAAA;AACjF,IAAO,OAAA,IAAA,CAAK,aAAc,CAAA,KAAA,EAAO,OAAO,CAAA,CAAA;AAAA,GAC1C;AAAA,EAWU,OAAA,CACR,MACA,OACQ,EAAA;AACR,IAAA,IAAI,UAAU,OAAO,CAAA,IAAK,SAAU,CAAA,OAAA,CAAQ,KAAK,CAAG,EAAA;AAClD,MAAI,IAAA,OAAA,CAAQ,KAAU,KAAA,IAAA,CAAK,MAAQ,EAAA;AACjC,QAAA,IAAA,CAAK,MAAO,CAAA,IAAA,CAAK,IAAK,CAAA,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAEhC,QAAA,OAAO,IAAK,CAAA,MAAA,CAAA;AAAA,OACd;AAEA,MAAA,IAAI,IAAK,CAAA,mBAAA,CAAoB,OAAQ,CAAA,KAAK,CAAG,EAAA;AAC3C,QAAA,MAAM,IAAI,UAAA,CAAW,CAAU,OAAA,EAAA,OAAA,CAAQ,KAAK,CAAoB,kBAAA,CAAA,CAAA,CAAA;AAAA,OAClE;AAEA,MAAK,IAAA,CAAA,MAAA,CAAO,OAAO,OAAQ,CAAA,KAAA,EAAO,GAAG,IAAK,CAAA,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAEpD,MAAA,OAAO,IAAK,CAAA,MAAA,CAAA;AAAA,KACd;AAEA,IAAA,IAAA,CAAK,MAAO,CAAA,IAAA,CAAK,IAAK,CAAA,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA;AAEhC,IAAA,OAAO,KAAK,MAAO,CAAA,MAAA,CAAA;AAAA,GACrB;AAAA,EAEU,aAAA,CACR,OACA,OACQ,EAAA;AACR,IAAI,IAAA,KAAA,CAAM,OAAQ,CAAA,KAAK,CAAG,EAAA;AACxB,MAAA,IAAI,UAAU,OAAO,CAAA,IAAK,SAAU,CAAA,OAAA,CAAQ,KAAK,CAAG,EAAA;AAClD,QAAA,KAAA,GAAQ,MAAM,OAAQ,EAAA,CAAA;AAAA,OACxB;AAEA,MAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,QAAK,IAAA,CAAA,OAAA,CAAQ,MAAM,OAAO,CAAA,CAAA;AAAA,OAC5B;AAAA,KACK,MAAA;AACL,MAAK,IAAA,CAAA,OAAA,CAAQ,OAAO,OAAO,CAAA,CAAA;AAAA,KAC7B;AAEA,IAAA,OAAO,IAAK,CAAA,MAAA,CAAA;AAAA,GACd;AAAA;AAAA;AAAA;AAAA,EAKO,OAA0B,GAAA;AAC/B,IAAO,OAAA,CAAC,GAAG,IAAA,CAAK,MAAM,CAAA,CAAA;AAAA,GACxB;AAAA,EAEO,MAAA,CACL,YAMA,YACG,EAAA;AACH,IAAA,OAAO,IAAK,CAAA,MAAA,CAAO,MAAO,CAAA,UAAA,EAAY,YAAY,CAAA,CAAA;AAAA,GACpD;AACF,EAAA;;;AC1Ja,IAAA,UAAA,GAAN,cAAyB,KAAM,CAAA;AAAA,EACpC,WAAA,CAAY,SAAkB,OAAwB,EAAA;AACpD,IAAA,KAAA,CAAM,SAAS,OAAO,CAAA,CAAA;AAEtB,IAAO,MAAA,CAAA,cAAA,CAAe,IAAM,EAAA,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA,CAAA;AAChD,IAAA,IAAA,CAAK,OAAO,GAAW,CAAA,MAAA,CAAA,IAAA,CAAA;AAAA,GACzB;AACF,EAAA;AAEa,IAAA,iBAAA,GAAN,cAAgC,UAAW,CAAA;AAAC,EAAA;AAEtC,IAAA,uBAAA,GAAN,cAAsC,UAAW,CAAA;AAAC","file":"index.js","sourcesContent":["export type ErrorMessage = string \| Error \| (() => string);\n\n// biome-ignore lint/complexity/noBannedTypes: <explanation>\ntype Constructable = Function;\n\ntype JSPrimitive =\n \| \"string\"\n \| \"number\"\n \| \"bigint\"\n \| \"boolean\"\n \| \"symbol\"\n \| \"undefined\"\n \| \"object\"\n \| \"function\";\n\nexport function assert(condition: boolean, error: ErrorMessage): asserts condition {\n if (condition) return;\n\n let err: Error \| undefined = undefined;\n switch (typeof error) {\n case \"string\":\n err = new Error(error);\n break;\n case \"function\":\n err = new Error(error());\n break;\n default:\n err = error;\n }\n\n throw err;\n}\n\nexport function assertTypeOf<T>(obj: T, expected: JSPrimitive): asserts obj {\n const type = typeof obj;\n\n if (type !== expected) {\n throw new Error(`Expected an object of type '${expected}', got '${type}'.`);\n }\n}\n\nfunction getTypeName(value: unknown): string {\n if (value === null) return \"null\";\n const type = typeof value;\n\n return type === \"object\" \|\| type === \"function\"\n ? Object.prototype.toString.call(value).slice(8, -1)\n : type;\n}\n\nexport function assertInstanceOf<T>(obj: T, expected: Constructable): asserts obj {\n const condition = obj instanceof expected;\n\n if (!condition) {\n throw new Error(\n `Expected an instance of '${expected.name}', got '${getTypeName(obj)}'.`\n );\n }\n}\n\nexport function isEmpty<T>(target: T \| null \| undefined): target is undefined \| null {\n if (!target) return true;\n\n return Array.isArray(target) ? target.length === 0 : Object.keys(target).length === 0;\n}\n\nexport function some<T>(target: T \| null \| undefined): target is T {\n return !isEmpty(target);\n}\n\nexport function isTruthy<T>(value?: T): value is NonNullable<T> {\n return !!value;\n}\n\nexport function isFalsy<T>(value?: T): value is undefined {\n return !value;\n}\n\nexport function isUndefined(v: unknown): v is undefined {\n return v === undefined \|\| v === null \|\| Number.isNaN(v);\n}\n\nexport function isDefined<T>(v: T \| undefined): v is T {\n return !isUndefined(v);\n}\n\nexport function hasKey(o: unknown, key: PropertyKey): boolean {\n return Object.prototype.hasOwnProperty.call(o, key);\n}\n","import type { SortingDirection, SortingSelector } from \"../types\";\nimport { assert, isEmpty } from \"./assertions\";\n\ntype ObjectSelector<T> = (item: T) => T[keyof T];\n\n/*\n Returns the first element of an array.\n * @param array\n * @throws an error if the array is empty.\n /\nexport function first(array: undefined): undefined;\nexport function first<T>(array: ArrayLike<T>): T;\nexport function first<T>(array: ArrayLike<T> \| undefined): T \| number \| undefined {\n if (!array) return undefined;\n assert(array.length > 0, \"Empty array.\");\n\n return array[0];\n}\n\n/\n Returns the last element of an array.\n * @param array\n * @throws an error if the array is empty.\n /\nexport function last(array: undefined): undefined;\nexport function last<T>(array: ArrayLike<T>): T;\nexport function last<T>(array: ArrayLike<T> \| undefined): T \| undefined {\n if (!array) return undefined;\n assert(array.length > 0, \"Empty array.\");\n\n return at(array, -1);\n}\n\n/\n Returns the element at the specified index. Negative indices are counted from the end of the array.\n * @param array\n * @param index\n /\nexport function at(array: undefined, index: number): undefined;\nexport function at<T>(array: ArrayLike<T>, index: number): T;\nexport function at<T>(array: ArrayLike<T> \| undefined, index: number): T \| undefined {\n const len = array?.length;\n if (!len) return undefined;\n\n if (index < 0) {\n index += len;\n }\n\n return array[index];\n}\n\n/\n Check for duplicate elements using the equality operator\n /\nexport function hasDuplicates<T>(array: T[]): boolean {\n return array.some((item, index) => {\n return array.indexOf(item) !== index;\n });\n}\n\n/\n Check for duplicate keys in complex elements\n /\nexport function hasDuplicatesBy<T>(array: T[], selector: ObjectSelector<T>): boolean {\n return array.some((item, index) => {\n return array.findIndex((x) => selector(x) === selector(item)) !== index;\n });\n}\n\n/\n Turns an array into chunks of the specified size\n * @param array\n * @param size\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const chunks = chunk(array, 2);\n * console.log(chunks);\n * // [[1, 2], [3, 4], [5]]\n * ```\n /\nexport function chunk<T>(array: T[], size: number): T[][] {\n if (array.length <= size) {\n return [array];\n }\n\n const chunks: T[][] = [];\n for (let i = 0; i < array.length; i += size) {\n chunks.push(array.slice(i, i + size));\n }\n\n return chunks;\n}\n\n/\n Sorts an array of objects by the specified property\n * @param array\n * @param iteratee\n * @param order\n \n @example\n * ```\n * const array = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const sorted = orderBy(array, (item) => item.age, \"desc\");\n * console.log(sorted);\n * // [{ name: \"Jane\", age: 30 }, { name: \"John\", age: 25 }]\n * ```\n /\nexport function orderBy<T>(\n array: T[],\n iteratee: SortingSelector<T>,\n order: SortingDirection = \"asc\"\n): T[] {\n return [...array].sort((a: T, b: T) => {\n if (iteratee(a) > iteratee(b)) return order === \"asc\" ? 1 : -1;\n if (iteratee(a) < iteratee(b)) return order === \"asc\" ? -1 : 1;\n return 0;\n });\n}\n\n/\n Checks if arrays are equal\n * @param array1\n * @param array2\n \n @example\n * ```\n * const array1 = [1, 2, 3];\n * const array2 = [1, 2, 3];\n * const array3 = [1, 2, 4];\n * const array4 = [1, 2, 3, 4];\n * areEqual(array1, array2); // true\n * areEqual(array1, array3); // false\n * areEqual(array1, array4); // false\n * ```\n /\nexport function areEqual<T>(array1: ArrayLike<T>, array2: ArrayLike<T>): boolean {\n if (array1 === array2) {\n return true;\n }\n\n if (array1.length !== array2.length) {\n return false;\n }\n\n for (let i = 0; i < array1.length; i++) {\n if (array1[i] !== array2[i]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if arrays are equal by the specified property\n * @param array1\n * @param array2\n * @param selector\n \n @example\n * ```\n * const array1 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const array2 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }];\n * const array3 = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 31 }];\n \n areEqualBy(array1, array2, (item) => item.age); // true\n * areEqualBy(array1, array3, (item) => item.age); // false\n * ```\n /\nexport function areEqualBy<T>(\n array1: ArrayLike<T>,\n array2: ArrayLike<T>,\n selector: ObjectSelector<T>\n): boolean {\n if (array1 === array2) {\n return true;\n }\n\n if (array1.length !== array2.length) {\n return false;\n }\n\n for (let i = 0; i < array1.length; i++) {\n if (selector(array1[i]) !== selector(array2[i])) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if the array starts with the specified target\n * @param array\n * @param target\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const target1 = [1, 2];\n * const target2 = [1, 3];\n \n startsWith(array, target1); // true\n * startsWith(array, target2); // false\n * ```\n /\nexport function startsWith<T>(array: ArrayLike<T>, target: ArrayLike<T>): boolean {\n if (array === target) {\n return true;\n }\n\n if (target.length > array.length) {\n return false;\n }\n\n for (let i = 0; i < target.length; i++) {\n if (target[i] !== array[i]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Checks if the array ends with the specified target\n * @param array\n * @param target\n \n @example\n * ```\n * const array = [1, 2, 3, 4, 5];\n * const target1 = [4, 5];\n * const target2 = [3, 5];\n \n endsWith(array, target1); // true\n * endsWith(array, target2); // false\n * ```\n /\nexport function endsWith<T>(array: ArrayLike<T>, target: ArrayLike<T>): boolean {\n if (array === target) {\n return true;\n }\n\n if (target.length > array.length) {\n return false;\n }\n\n const offset = array.length - target.length;\n\n for (let i = target.length - 1; i >= 0; i--) {\n if (target[i] !== array[i + offset]) {\n return false;\n }\n }\n\n return true;\n}\n\n/\n Makes an array unique by removing duplicate elements\n * @param array\n \n @example\n * ```\n * const array = [1, 2, 3, 3, 4, 5, 5];\n * const unique = uniq(array);\n * console.log(unique);\n * // [1, 2, 3, 4, 5]\n * ```\n /\nexport function uniq<T>(array: Array<T>): Array<T> {\n if (isEmpty(array)) {\n return array;\n }\n\n return Array.from(new Set(array));\n}\n\n/\n Makes an array unique by removing duplicate elements using the specified property\n * @param array\n * @param selector\n * @param selection\n \n @example\n * ```\n * const array = [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }, { name: \"John\", age: 30 }];\n * const unique = uniqBy(array, (item) => item.name);\n * console.log(unique);\n * // [{ name: \"John\", age: 25 }, { name: \"Jane\", age: 30 }]\n * ```\n /\nexport function uniqBy<T>(\n array: Array<T>,\n selector: ObjectSelector<T>,\n selection: \"keep-first\" \| \"keep-last\" = \"keep-first\"\n): Array<T> {\n if (isEmpty(array)) {\n return array;\n }\n\n return Array.from(\n array\n .reduce((map, e) => {\n const key = selector(e);\n\n if (selection === \"keep-first\" && map.has(key)) {\n return map;\n }\n\n return map.set(key, e);\n }, new Map())\n .values()\n );\n}\n\n/\n Returns the depth of an array\n * @param array\n \n @example\n * ```\n * const array = [1, 2, 3, [4, 5, [6, 7]]];\n * const depth = depthOf(array);\n * console.log(depth);\n * // 3\n /\nexport function depthOf(array: unknown \| unknown[]): number {\n return Array.isArray(array) ? 1 + Math.max(0, ...array.map(depthOf)) : 0;\n}\n","import type { Amount } from \"../types\";\nimport { first } from \"./array\";\nimport { isEmpty, isUndefined } from \"./assertions\";\n\ntype NumberLike = string \| number \| bigint \| boolean;\n\nexport const _0n = BigInt(0);\nexport const _1n = BigInt(1);\nexport const _7n = BigInt(7);\nexport const _10n = BigInt(10);\nexport const _63n = BigInt(63);\nexport const _127n = BigInt(127);\nexport const _128n = BigInt(128);\n\n/\n Ensure that the given value is a bigint\n * @param number\n /\nexport function ensureBigInt(number: NumberLike): bigint {\n return typeof number === \"bigint\" ? number : BigInt(number);\n}\n\ntype ParsingOptions = {\n /\n Number of decimals.\n /\n decimals?: number;\n\n /\n Thousand mark char.\n * Default: `.`\n /\n decimalMark?: string;\n};\n\n/\n Parse a decimal string into a bigint with options\n * @param input\n * @param options\n \n @example\n * undecimalize(\"129.8379183\", { decimals: 9 }) // 129837918300n\n * undecimalize(\"1\", { decimals: 2 }) // 100n\n * undecimalize(\"1\", 2) // 100n\n /\nexport function undecimalize(input: string, options?: ParsingOptions \| number): bigint {\n if (!input) return _0n;\n\n options = typeof options === \"number\" ? { decimals: options } : options;\n if (isUndefined(options)) {\n options = {};\n }\n\n options.decimals = options.decimals \|\| 0;\n options.decimalMark = options.decimalMark \|\| \".\";\n\n const fragments = input.split(options.decimalMark);\n if (fragments.length > 2) {\n throw new Error(\"Invalid numeric string.\");\n }\n\n let [integer, decimal] = fragments;\n integer = removeLeadingZeros(integer);\n const negative = integer.startsWith(\"-\") ? \"-\" : \"\";\n\n if (!decimal) {\n decimal = \"0\".repeat(options.decimals);\n } else if (decimal.length < options.decimals) {\n decimal = decimal.padEnd(options.decimals, \"0\");\n }\n\n return BigInt(negative + _stripNonDigits(integer + decimal));\n}\n\n/\n Strip all non-digits from a string\n * @param value\n /\nfunction _stripNonDigits(value: string): string {\n return value.replace(/\\D/g, \"\");\n}\n\ntype FormattingOptions = {\n /\n Number of decimals.\n /\n decimals: number;\n\n /\n Thousand mark char.\n /\n thousandMark?: string;\n\n /\n Decimal mark char.\n * Default: `.`\n /\n decimalMark?: string;\n};\n\n/\n Format a bigint into a decimal string with options\n * @param value\n * @param options\n \n @example\n * decimalize(129837918300n, { decimals: 9 }) // \"129.8379183\"\n * decimalize(100n, { decimals: 2 }) // \"1\"\n /\nexport function decimalize(value: Amount, options?: FormattingOptions \| number): string {\n value = ensureBigInt(value);\n if (!options) {\n return value.toString();\n }\n\n options = typeof options === \"number\" ? { decimals: options } : options;\n options.decimals = options.decimals \|\| 0;\n options.decimalMark = options.decimalMark \|\| \".\";\n\n const pow = _10n * BigInt(options.decimals);\n const integer = value / pow;\n const decimal = value - integer * pow;\n\n return buildFormattedDecimal(integer.toString(10), decimal.toString(10), options);\n}\n\n/*\n Format a bigint percentage into a decimal string with options\n * @param value\n * @param percentage\n * @param precision\n \n @example\n * ```\n * percent(3498n, 1n) // 34n(1%)\n * percent(3498n, 2n) // 69n(2%)\n * percent(3498n, 10n) // 349n(10%)\n * ```\n \n /\nexport function percent(value: bigint, percentage: bigint, precision = 2n) {\n return (value * percentage) / 10n precision;\n}\n\nfunction buildFormattedDecimal(\n integer: string,\n decimal: string,\n options: FormattingOptions\n): string {\n const int = addThousandMarks(integer, options.thousandMark);\n const dec = stripTrailingZeros(decimal.padStart(options.decimals, \"0\"));\n if (dec) return `${int}${options.decimalMark}${dec}`;\n return int;\n}\n\nfunction addThousandMarks(value: string, mark?: string): string {\n if (!mark) {\n return value;\n }\n\n return value.replace(/\\B(?=(\\d{3})+(?!\\d))/g, mark);\n}\n\nfunction stripTrailingZeros(value: string): string {\n if (!value.endsWith(\"0\")) {\n return value;\n }\n\n return value.replace(/\\.?0+$/, \"\");\n}\n\nfunction removeLeadingZeros(value: string): string {\n if (!value.startsWith(\"0\")) {\n return value;\n }\n\n return value.replace(/^0+\\.?/, \"\");\n}\n\n/\n * Sum a collection of numbers by a given iteratee\n * @param collection\n * @param iteratee\n * @param condition\n \n @example\n * ```\n * const values = [\n * { key: 1, value: 100n },\n * { key: 2, value: 200n },\n * { key: 3, value: 300n },\n * { key: 4, value: 400n },\n * ];\n \n sumBy(values, x => x.value) // 1000n\n * sumBy(values, x => x.value, x => x.key < 0) // 0n\n * sumBy(values, x => x.value, x => x.key % 2 === 0) // 600n\n /\nexport function sumBy<T>(\n collection: readonly T[],\n iteratee: (value: T) => bigint,\n condition?: (value: T) => boolean\n): bigint {\n let acc = _0n;\n if (isEmpty(collection)) {\n return acc;\n }\n\n for (const item of collection) {\n if (isUndefined(condition) \|\| condition(item)) {\n acc += iteratee(item);\n }\n }\n\n return acc;\n}\n\n/\n Get the minimum value from a collection of numbers\n * @param numbers\n /\nexport function min<T extends bigint \| number>(...numbers: T[]): T {\n let min = first(numbers);\n\n for (const num of numbers) {\n if (num < min) {\n min = num;\n }\n }\n\n return min;\n}\n\n/\n Get the maximum value from a collection of numbers\n * @param numbers\n /\nexport function max<T extends bigint \| number>(...numbers: T[]): T {\n let max = first(numbers);\n\n for (const num of numbers) {\n if (num > max) {\n max = num;\n }\n }\n\n return max;\n}\n","import type {\n Amount,\n Box,\n BoxCandidate,\n NonMandatoryRegisters,\n TokenAmount,\n TokenId\n} from \"../types\";\nimport { isDefined, isEmpty, isUndefined } from \"./assertions\";\nimport { ensureBigInt } from \"./bigInt\";\nimport { _0n } from \"./bigInt\";\n\nconst NANOERGS_TOKEN_ID = \"nanoErgs\";\n\n/\n Calculates the sum of all nanoErgs and tokens in the given boxes.\n * @param boxes\n \n @example\n * ```\n * const boxes = [\n * { value: \"10\", assets: [{ tokenId: \"test\", amount: \"20\" }] },\n * { value: 20n, assets: [{ tokenId: \"test\", amount: 30n }] }\n * ];\n \n const sum = utxoSum(boxes);\n * console.log(sum);\n * // { nanoErgs: 30n, tokens: [{ tokenId: \"test\", amount: 50n }] }\n * ```\n /\nexport function utxoSum(boxes: readonly BoxAmounts[]): BoxSummary;\nexport function utxoSum(boxes: readonly BoxAmounts[], tokenId: TokenId): bigint;\nexport function utxoSum(boxes: readonly BoxAmounts[], tokenId?: TokenId) {\n const balances: { [tokenId: string]: bigint } = {};\n\n for (const box of boxes) {\n if (isUndefined(tokenId) \|\| tokenId === NANOERGS_TOKEN_ID) {\n balances[NANOERGS_TOKEN_ID] =\n (balances[NANOERGS_TOKEN_ID] \|\| _0n) + ensureBigInt(box.value);\n }\n\n if (tokenId !== NANOERGS_TOKEN_ID) {\n for (const token of box.assets) {\n if (isDefined(tokenId) && tokenId !== token.tokenId) {\n continue;\n }\n\n balances[token.tokenId] =\n (balances[token.tokenId] \|\| _0n) + ensureBigInt(token.amount);\n }\n }\n }\n\n if (isDefined(tokenId)) {\n return balances[tokenId] \|\| _0n;\n }\n\n return {\n nanoErgs: balances[NANOERGS_TOKEN_ID] \|\| _0n,\n tokens: Object.keys(balances)\n .filter((x) => x !== NANOERGS_TOKEN_ID)\n .map((tokenId) => ({ tokenId, amount: balances[tokenId] }))\n };\n}\n\n/\n Calculates the difference between two utxos or utxo sets.\n * @param minuend\n * @param subtrahend\n \n @example\n * ```\n * const minuend = [{ nanoErgs: 30n, tokens: [{ tokenId: \"test\", amount: 50n }] }];\n * const subtrahend = [{ nanoErgs: 10n, tokens: [{ tokenId: \"test\", amount: 20n }] }];\n * const diff = utxoDiff(minuend, subtrahend);\n * console.log(diff);\n * // { nanoErgs: 20n, tokens: [{ tokenId: \"test\", amount: 30n }] }\n * ```\n /\nexport function utxoDiff(\n minuend: BoxSummary \| Box<Amount>[],\n subtrahend: BoxSummary \| Box<Amount>[],\n ignoreSubtrahendLeftoverTokens = false\n): BoxSummary {\n if (Array.isArray(minuend)) minuend = utxoSum(minuend);\n if (Array.isArray(subtrahend)) subtrahend = utxoSum(subtrahend);\n\n const tokens: TokenAmount<bigint>[] = [];\n const nanoErgs = minuend.nanoErgs - subtrahend.nanoErgs;\n const subtrahendTokens = new Map(subtrahend.tokens.map((t) => [t.tokenId, t.amount]));\n\n for (const token of minuend.tokens) {\n const subtrahendAmount = subtrahendTokens.get(token.tokenId) \|\| _0n;\n const balance = token.amount - (subtrahendAmount \|\| _0n);\n\n if (balance !== _0n) {\n tokens.push({ tokenId: token.tokenId, amount: balance });\n }\n\n if (subtrahendAmount > _0n) {\n subtrahendTokens.delete(token.tokenId);\n }\n }\n\n if (!ignoreSubtrahendLeftoverTokens && subtrahendTokens.size > 0) {\n for (const [tokenId, amount] of subtrahendTokens) {\n tokens.push({ tokenId, amount: -amount });\n }\n }\n\n return { nanoErgs, tokens };\n}\n\nconst MIN_NON_MANDATORY_REGISTER_INDEX = 4;\nconst MAX_NON_MANDATORY_REGISTER_INDEX = 9;\n\n/\n Checks if the given registers are densely packed.\n * @param registers\n \n @example\n * ```\n * const registers = {\n * R4: \"deadbeef\",\n * R6: \"cafe\",\n * };\n * const result = areRegistersDenselyPacked(registers);\n * console.log(result);\n * // false\n /\nexport function areRegistersDenselyPacked(registers: NonMandatoryRegisters): boolean {\n let lastIndex = 0;\n for (\n let i = MIN_NON_MANDATORY_REGISTER_INDEX;\n i <= MAX_NON_MANDATORY_REGISTER_INDEX;\n i++\n ) {\n const key = `R${i}` as keyof NonMandatoryRegisters;\n if (registers[key]) {\n if (i === MIN_NON_MANDATORY_REGISTER_INDEX) {\n lastIndex = i;\n continue;\n }\n\n if (i - lastIndex > 1) {\n return false;\n }\n\n lastIndex = i;\n }\n }\n\n return true;\n}\n\n/\n Filters the given utxos by the given filter parameters.\n * @param utxos\n * @param filterParams\n /\nexport function utxoFilter<T extends Amount>(\n utxos: Box<T>[],\n filterParams: UTxOFilterParams<T>\n) {\n if (isEmpty(filterParams) \|\| isEmpty(utxos)) {\n return utxos;\n }\n\n const { by, max } = filterParams;\n let filtered = utxos;\n\n if (by) {\n filtered = utxos.filter(by);\n if (isEmpty(filtered)) {\n return filtered;\n }\n }\n\n if (!max) {\n return filtered;\n }\n\n if (isDefined(max.aggregatedDistinctTokens)) {\n const tokenIds = _getDistinctTokenIds(filtered, max.aggregatedDistinctTokens);\n filtered = filtered.filter(\n (utxo) =>\n isEmpty(utxo.assets) \|\| utxo.assets.every((token) => tokenIds.has(token.tokenId))\n );\n }\n\n if (isDefined(max.count) && filtered.length > max.count) {\n filtered = filtered.slice(0, max.count);\n }\n\n return filtered;\n}\n\nfunction _getDistinctTokenIds(utxos: Box[], max: number): Set<string> {\n const tokenIds = new Set<string>();\n\n for (let i = 0; i < utxos.length && tokenIds.size < max; i++) {\n if (isEmpty(utxos[i].assets) \|\| utxos[i].assets.length > max) {\n continue;\n }\n\n for (const token of utxos[i].assets) {\n tokenIds.add(token.tokenId);\n }\n }\n\n return tokenIds;\n}\n\n/\n Parameters for filtering unspent transaction outputs (UTxOs).\n /\nexport type UTxOFilterParams<T extends Amount> = {\n /\n A function that returns a boolean indicating whether a given UTxO should be included in the filtered results.\n /\n by?: (utxo: Box<T>) => boolean;\n /\n An object specifying the maximum number of UTxOs and distinct tokens to include in the filtered results.\n /\n max?: {\n /\n The maximum number of UTxOs to include in the filtered results.\n /\n count?: number;\n /\n The maximum number of distinct tokens to include in the filtered results.\n /\n aggregatedDistinctTokens?: number;\n };\n};\n\nexport type BoxSummary = {\n nanoErgs: bigint;\n tokens: TokenAmount<bigint>[];\n};\n\nexport type BoxAmounts = {\n value: Amount;\n assets: TokenAmount<Amount>[];\n};\n\n/\n Ensures that the value and asset amounts of a given box are represented as BigInts.\n * @returns A new box object with BigInt representation for the value and asset amounts.\n /\nexport function ensureUTxOBigInt(box: Box<Amount>): Box<bigint>;\nexport function ensureUTxOBigInt(candidate: BoxCandidate<Amount>): BoxCandidate<bigint>;\nexport function ensureUTxOBigInt(\n box: Box<Amount> \| BoxCandidate<Amount>\n): BoxCandidate<bigint> \| Box<bigint> {\n return {\n ...box,\n value: ensureBigInt(box.value),\n assets: box.assets.map((token) => ({\n tokenId: token.tokenId,\n amount: ensureBigInt(token.amount)\n }))\n };\n}\n","import { isEmpty, isUndefined } from \"./assertions\";\n\n/\n Remove undefined values from an object\n * @param value\n \n @example\n * ```\n * const obj = { a: 1, b: undefined };\n * const result = clearUndefined(obj);\n * console.log(result); // { a: 1 }\n * ```\n /\nexport function clearUndefined(value: Record<string, unknown>) {\n const result: Record<string, unknown> = {};\n for (const key in value) {\n const val = value[key];\n if (!isUndefined(val)) {\n result[key] = val;\n }\n }\n\n return result;\n}\n\nexport type EnsureDefaultsOptions = { keepUndefinedKeys: boolean };\n\n/\n Ensure that the options object has all the default values\n * @param partial\n * @param defaults\n \n @example\n * ```\n * const options = { a: 1 };\n * const defaults = { a: 2, b: 3 };\n * const result = ensureDefaults(options, defaults);\n * console.log(result); // { a: 1, b: 3 }\n * ```\n /\nexport function ensureDefaults<T extends object, R extends object>(\n partial: T \| undefined,\n defaults: R,\n options?: EnsureDefaultsOptions\n): R & T {\n if (isEmpty(partial)) return defaults as R & T;\n if (options?.keepUndefinedKeys) return { ...defaults, ...partial };\n\n const merged = { ...defaults, ...partial } as Record<string, unknown>;\n for (const key in merged) {\n merged[key] = partial[key as keyof T] ?? defaults[key as keyof R];\n }\n\n return merged as R & T;\n}\n","import { assertInstanceOf } from \".\";\n\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n\n let pad = 0;\n for (const bytes of arrays) {\n assertInstanceOf(bytes, Uint8Array);\n\n r.set(bytes, pad);\n pad += bytes.length;\n }\n\n return r;\n}\n\nexport function isHex(value?: string) {\n if (!value \|\| value.length % 2) return false;\n return !Number.isNaN(Number(value.startsWith(\"0x\") ? value : `0x${value}`));\n}\n\n/\n Get hex string size in bytes\n * @param hex\n * @returns the byte size if the hex string\n /\nexport function byteSizeOf(hex: string): number {\n return hex.length / 2;\n}\n","export type EnumConst<T extends object> = T[keyof T];\n\nexport enum Network {\n Mainnet = 0x00,\n Testnet = 0x10\n}\n\nexport enum AddressType {\n P2PK = 1,\n P2SH = 2,\n P2S = 3,\n ADH = 4\n}\n\nexport const ergoTreeHeaderFlags = {\n sizeInclusion: 0x08,\n constantSegregation: 0x10\n} as const;\n\nexport type ErgoTreeHeaderFlag = EnumConst<typeof ergoTreeHeaderFlags>;\n","import type { OneOrMore } from \"../types\";\nimport { isDefined } from \"../utils\";\n\nexport type CollectionAddOptions = { index?: number };\n\n/\n Collection abstract model\n \n @example\n * Define a new collection class with internal type `number` and external type `string`\n * ```\n * class TestCollection extends Collection<number, string> {\n * protected _map(item: string \| number): number {\n * return Number(item);\n * }\n * // Some other methods\n * }\n * ```\n \n /\nexport abstract class Collection<InternalType, ExternalType>\n implements Iterable<InternalType>\n{\n protected readonly _items: InternalType[];\n\n constructor() {\n this._items = [];\n }\n\n protected _isIndexOutOfBounds(index: number): boolean {\n return index < 0 \|\| index >= this._items.length;\n }\n\n [Symbol.iterator](): Iterator<InternalType> {\n let counter = 0;\n\n return {\n next: () => {\n return {\n done: counter >= this.length,\n value: this._items[counter++]\n };\n }\n };\n }\n\n /*\n Number of items in the collection\n /\n public get length(): number {\n return this._items.length;\n }\n\n /\n True if the collection is empty\n /\n public get isEmpty(): boolean {\n return this.length === 0;\n }\n\n /\n Get item at index\n * @param index\n * @throws RangeError if index is out of bounds\n /\n public at(index: number): InternalType {\n if (this._isIndexOutOfBounds(index)) {\n throw new RangeError(`Index '${index}' is out of range.`);\n }\n\n return this._items[index];\n }\n\n /\n Add item to the collection\n * @param items\n * @param options\n * @returns The new length of the collection\n /\n public add(items: OneOrMore<ExternalType>, options?: CollectionAddOptions): number {\n return this._addOneOrMore(items, options);\n }\n\n abstract remove(item: unknown): number;\n\n /\n Map external type to internal type\n * @param item\n * @protected\n /\n protected abstract _map(item: ExternalType \| InternalType): InternalType;\n\n protected _addOne(\n item: InternalType \| ExternalType,\n options?: CollectionAddOptions\n ): number {\n if (isDefined(options) && isDefined(options.index)) {\n if (options.index === this.length) {\n this._items.push(this._map(item));\n\n return this.length;\n }\n\n if (this._isIndexOutOfBounds(options.index)) {\n throw new RangeError(`Index '${options.index}' is out of range.`);\n }\n\n this._items.splice(options.index, 0, this._map(item));\n\n return this.length;\n }\n\n this._items.push(this._map(item));\n\n return this._items.length;\n }\n\n protected _addOneOrMore(\n items: OneOrMore<ExternalType>,\n options?: CollectionAddOptions\n ): number {\n if (Array.isArray(items)) {\n if (isDefined(options) && isDefined(options.index)) {\n items = items.reverse();\n }\n\n for (const item of items) {\n this._addOne(item, options);\n }\n } else {\n this._addOne(items, options);\n }\n\n return this.length;\n }\n\n /\n Get the collection as an array\n */\n public toArray(): InternalType[] {\n return [...this._items];\n }\n\n public reduce<U>(\n callbackFn: (\n accumulator: U,\n currentValue: InternalType,\n currentIndex: number,\n array: InternalType[]\n ) => U,\n initialValue: U\n ): U {\n return this._items.reduce(callbackFn, initialValue);\n }\n}\n","export class FleetError extends Error {\n constructor(message?: string, options?: ErrorOptions) {\n super(message, options);\n\n Object.setPrototypeOf(this, new.target.prototype);\n this.name = new.target.name;\n }\n}\n\nexport class NotSupportedError extends FleetError {}\n\nexport class BlockchainProviderError extends FleetError {}\n"]}

package/dist/index.mjs CHANGED Viewed

@@ -1,7 +1,6 @@
 // src/utils/assertions.ts
 function assert(condition, error) {
-  if (condition)
-    return;
+  if (condition) return;
   let err = void 0;
   switch (typeof error) {
     case "string":
@@ -21,22 +20,21 @@ function assertTypeOf(obj, expected) {
     throw new Error(`Expected an object of type '${expected}', got '${type}'.`);
   }
 }
-var toString = (value) => Object.prototype.toString.call(value);
 function getTypeName(value) {
-  if (value === null)
-    return "null";
+  if (value === null) return "null";
   const type = typeof value;
-  return type === "object" || type === "function" ? toString(value).slice(8, -1) : type;
+  return type === "object" || type === "function" ? Object.prototype.toString.call(value).slice(8, -1) : type;
 }
 function assertInstanceOf(obj, expected) {
   const condition = obj instanceof expected;
   if (!condition) {
-    throw new Error(`Expected an instance of '${expected.name}', got '${getTypeName(obj)}'.`);
+    throw new Error(
+      `Expected an instance of '${expected.name}', got '${getTypeName(obj)}'.`
+    );
   }
 }
 function isEmpty(target) {
-  if (!target)
-    return true;
+  if (!target) return true;
   return Array.isArray(target) ? target.length === 0 : Object.keys(target).length === 0;
 }
 function some(target) {
@@ -60,21 +58,18 @@ function hasKey(o, key) {
 // src/utils/array.ts
 function first(array) {
-  if (!array)
-    return void 0;
+  if (!array) return void 0;
   assert(array.length > 0, "Empty array.");
   return array[0];
 }
 function last(array) {
-  if (!array)
-    return void 0;
+  if (!array) return void 0;
   assert(array.length > 0, "Empty array.");
   return at(array, -1);
 }
 function at(array, index) {
   const len = array?.length;
-  if (!len)
-    return void 0;
+  if (!len) return void 0;
   if (index < 0) {
     index += len;
   }
@@ -102,20 +97,16 @@ function chunk(array, size) {
 }
 function orderBy(array, iteratee, order = "asc") {
   return [...array].sort((a, b) => {
-    if (iteratee(a) > iteratee(b)) {
-      return order === "asc" ? 1 : -1;
-    } else if (iteratee(a) < iteratee(b)) {
-      return order === "asc" ? -1 : 1;
-    } else {
-      return 0;
-    }
+    if (iteratee(a) > iteratee(b)) return order === "asc" ? 1 : -1;
+    if (iteratee(a) < iteratee(b)) return order === "asc" ? -1 : 1;
+    return 0;
   });
 }
 function areEqual(array1, array2) {
   if (array1 === array2) {
     return true;
   }
-  if (array1.length != array2.length) {
+  if (array1.length !== array2.length) {
     return false;
   }
   for (let i = 0; i < array1.length; i++) {
@@ -129,7 +120,7 @@ function areEqualBy(array1, array2, selector) {
   if (array1 === array2) {
     return true;
   }
-  if (array1.length != array2.length) {
+  if (array1.length !== array2.length) {
     return false;
   }
   for (let i = 0; i < array1.length; i++) {
@@ -203,22 +194,20 @@ var _128n = BigInt(128);
 function ensureBigInt(number) {
   return typeof number === "bigint" ? number : BigInt(number);
 }
-function undecimalize(decimalStr, options) {
-  if (!decimalStr) {
-    return _0n;
-  }
-  options = typeof options == "number" ? { decimals: options } : options;
+function undecimalize(input, options) {
+  if (!input) return _0n;
+  options = typeof options === "number" ? { decimals: options } : options;
   if (isUndefined(options)) {
     options = {};
   }
   options.decimals = options.decimals || 0;
   options.decimalMark = options.decimalMark || ".";
-  const fragments = decimalStr.split(options.decimalMark);
+  const fragments = input.split(options.decimalMark);
   if (fragments.length > 2) {
     throw new Error("Invalid numeric string.");
   }
   let [integer, decimal] = fragments;
-  integer = _removeLeadingZeros(integer);
+  integer = removeLeadingZeros(integer);
   const negative = integer.startsWith("-") ? "-" : "";
   if (!decimal) {
     decimal = "0".repeat(options.decimals);
@@ -235,39 +224,36 @@ function decimalize(value, options) {
   if (!options) {
     return value.toString();
   }
-  options = typeof options == "number" ? { decimals: options } : options;
+  options = typeof options === "number" ? { decimals: options } : options;
   options.decimals = options.decimals || 0;
   options.decimalMark = options.decimalMark || ".";
   const pow = _10n ** BigInt(options.decimals);
   const integer = value / pow;
   const decimal = value - integer * pow;
-  return _buildFormattedDecimal(integer.toString(10), decimal.toString(10), options);
+  return buildFormattedDecimal(integer.toString(10), decimal.toString(10), options);
 }
 function percent(value, percentage, precision = 2n) {
   return value * percentage / 10n ** precision;
 }
-function _buildFormattedDecimal(integer, decimal, options) {
-  const integerPart = _addThousandMarks(integer, options.thousandMark);
-  const decimalPart = _stripTrailingZeros(decimal.padStart(options.decimals, "0"));
-  if (decimalPart) {
-    return `${integerPart}${options.decimalMark}${decimalPart}`;
-  } else {
-    return integerPart;
-  }
+function buildFormattedDecimal(integer, decimal, options) {
+  const int = addThousandMarks(integer, options.thousandMark);
+  const dec = stripTrailingZeros(decimal.padStart(options.decimals, "0"));
+  if (dec) return `${int}${options.decimalMark}${dec}`;
+  return int;
 }
-function _addThousandMarks(value, mark) {
+function addThousandMarks(value, mark) {
   if (!mark) {
     return value;
   }
   return value.replace(/\B(?=(\d{3})+(?!\d))/g, mark);
 }
-function _stripTrailingZeros(value) {
+function stripTrailingZeros(value) {
   if (!value.endsWith("0")) {
     return value;
   }
   return value.replace(/\.?0+$/, "");
 }
-function _removeLeadingZeros(value) {
+function removeLeadingZeros(value) {
   if (!value.startsWith("0")) {
     return value;
   }
@@ -329,20 +315,26 @@ function utxoSum(boxes, tokenId) {
     tokens: Object.keys(balances).filter((x) => x !== NANOERGS_TOKEN_ID).map((tokenId2) => ({ tokenId: tokenId2, amount: balances[tokenId2] }))
   };
 }
-function utxoDiff(minuend, subtrahend) {
-  if (Array.isArray(minuend)) {
-    minuend = utxoSum(minuend);
-  }
-  if (Array.isArray(subtrahend)) {
-    subtrahend = utxoSum(subtrahend);
-  }
+function utxoDiff(minuend, subtrahend, ignoreSubtrahendLeftoverTokens = false) {
+  if (Array.isArray(minuend)) minuend = utxoSum(minuend);
+  if (Array.isArray(subtrahend)) subtrahend = utxoSum(subtrahend);
   const tokens = [];
   const nanoErgs = minuend.nanoErgs - subtrahend.nanoErgs;
+  const subtrahendTokens = new Map(subtrahend.tokens.map((t) => [t.tokenId, t.amount]));
   for (const token of minuend.tokens) {
-    const balance = token.amount - (subtrahend.tokens.find((t) => t.tokenId === token.tokenId)?.amount || _0n);
+    const subtrahendAmount = subtrahendTokens.get(token.tokenId) || _0n;
+    const balance = token.amount - (subtrahendAmount || _0n);
     if (balance !== _0n) {
       tokens.push({ tokenId: token.tokenId, amount: balance });
     }
+    if (subtrahendAmount > _0n) {
+      subtrahendTokens.delete(token.tokenId);
+    }
+  }
+  if (!ignoreSubtrahendLeftoverTokens && subtrahendTokens.size > 0) {
+    for (const [tokenId, amount] of subtrahendTokens) {
+      tokens.push({ tokenId, amount: -amount });
+    }
   }
   return { nanoErgs, tokens };
 }
@@ -425,8 +417,14 @@ function clearUndefined(value) {
   }
   return result;
 }
-function ensureDefaults(options, defaults) {
-  return isEmpty(options) ? defaults : { ...defaults, ...options };
+function ensureDefaults(partial, defaults, options) {
+  if (isEmpty(partial)) return defaults;
+  if (options?.keepUndefinedKeys) return { ...defaults, ...partial };
+  const merged = { ...defaults, ...partial };
+  for (const key in merged) {
+    merged[key] = partial[key] ?? defaults[key];
+  }
+  return merged;
 }
 // src/utils/bytes.ts
@@ -441,18 +439,14 @@ function concatBytes(...arrays) {
   return r;
 }
 function isHex(value) {
-  if (!value || value.length % 2)
-    return false;
-  if (!value.startsWith("0x")) {
-    value = "0x" + value;
-  }
-  return !isNaN(Number(value));
+  if (!value || value.length % 2) return false;
+  return !Number.isNaN(Number(value.startsWith("0x") ? value : `0x${value}`));
 }
 function byteSizeOf(hex) {
   return hex.length / 2;
 }
-// src/types/common.ts
+// src/types/enums.ts
 var Network = /* @__PURE__ */ ((Network2) => {
   Network2[Network2["Mainnet"] = 0] = "Mainnet";
   Network2[Network2["Testnet"] = 16] = "Testnet";
@@ -462,6 +456,7 @@ var AddressType = /* @__PURE__ */ ((AddressType2) => {
   AddressType2[AddressType2["P2PK"] = 1] = "P2PK";
   AddressType2[AddressType2["P2SH"] = 2] = "P2SH";
   AddressType2[AddressType2["P2S"] = 3] = "P2S";
+  AddressType2[AddressType2["ADH"] = 4] = "ADH";
   return AddressType2;
 })(AddressType || {});
 var ergoTreeHeaderFlags = {
@@ -569,16 +564,10 @@ var FleetError = class extends Error {
   }
 };
 var NotSupportedError = class extends FleetError {
-  constructor(message) {
-    super(message);
-  }
 };
 var BlockchainProviderError = class extends FleetError {
-  constructor(message, options) {
-    super(message, options);
-  }
 };
 export { AddressType, BlockchainProviderError, Collection, FleetError, Network, NotSupportedError, _0n, _10n, _127n, _128n, _1n, _63n, _7n, areEqual, areEqualBy, areRegistersDenselyPacked, assert, assertInstanceOf, assertTypeOf, at, byteSizeOf, chunk, clearUndefined, concatBytes, decimalize, depthOf, endsWith, ensureBigInt, ensureDefaults, ensureUTxOBigInt, ergoTreeHeaderFlags, first, hasDuplicates, hasDuplicatesBy, hasKey, isDefined, isEmpty, isFalsy, isHex, isTruthy, isUndefined, last, max, min, orderBy, percent, some, startsWith, sumBy, undecimalize, uniq, uniqBy, utxoDiff, utxoFilter, utxoSum };
-//# sourceMappingURL=out.js.map
+//# sourceMappingURL=index.mjs.map
 //# sourceMappingURL=index.mjs.map