max-priority-queue-typed 2.5.0 → 2.5.2

package/dist/esm-legacy/index.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/data-structures/base/iterable-element-base.ts","../../src/common/error.ts","../../src/common/index.ts","../../src/data-structures/heap/heap.ts","../../src/data-structures/priority-queue/priority-queue.ts","../../src/data-structures/priority-queue/max-priority-queue.ts"],"names":["DFSOperation"],"mappings":";;;;;;AAaO,IAAe,oBAAA,GAAf,MAAe,oBAAA,CAAiD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAU3D,YAAY,OAAA,EAA4C;AAclE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,aAAA,CAAA,IAAA,EAAU,cAAA,CAAA;AAbR,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,MAAM,EAAE,aAAY,GAAI,OAAA;AACxB,MAAA,IAAI,OAAO,WAAA,KAAgB,UAAA,EAAY,IAAA,CAAK,YAAA,GAAe,WAAA;AAAA,WAAA,IAClD,WAAA,EAAa,MAAM,IAAI,SAAA,CAAU,qCAAqC,CAAA;AAAA,IACjF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,IAAI,WAAA,GAAkD;AACpD,IAAA,OAAO,IAAA,CAAK,YAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,EAAE,MAAA,CAAO,QAAQ,CAAA,CAAA,GAAK,IAAA,EAAsC;AAC1D,IAAA,OAAO,IAAA,CAAK,YAAA,CAAa,GAAG,IAAI,CAAA;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,CAAC,MAAA,GAA8B;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,MAAM,IAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,KAAA,CAAM,WAA2C,OAAA,EAA4B;AAC3E,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,CAAC,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,KAAA;AAAA,MAC9C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,CAAC,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,KAAA;AAAA,MACrD;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,IAAA,CAAK,WAA2C,OAAA,EAA4B;AAC1E,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MAC7C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAA,CAAQ,YAAyC,OAAA,EAAyB;AACxE,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,UAAA,CAAW,IAAA,EAAM,SAAS,IAAI,CAAA;AAAA,MAChC,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,UAAA;AACX,QAAA,EAAA,CAAG,IAAA,CAAK,OAAA,EAAS,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,CAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAwBA,IAAA,CAAK,WAA2C,OAAA,EAAkC;AAChF,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MAC7C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAI,OAAA,EAAqB;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,IAAA,EAAM,IAAI,GAAA,KAAQ,SAAS,OAAO,IAAA;AACpD,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BA,MAAA,CAAU,YAA4C,YAAA,EAAqB;AACzE,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,QAAQ,CAAA,EAAE;AACnC,IAAA,IAAI,GAAA;AAEJ,IAAA,IAAI,SAAA,CAAU,UAAU,CAAA,EAAG;AACzB,MAAA,GAAA,GAAM,YAAA;AAAA,IACR,CAAA,MAAO;AACL,MAAA,MAAM,KAAA,GAAQ,KAAK,IAAA,EAAK;AACxB,MAAA,IAAI,KAAA,CAAM,IAAA,EAAM,MAAM,IAAI,UAAU,iDAAiD,CAAA;AACrF,MAAA,GAAA,GAAM,KAAA,CAAM,KAAA;AACZ,MAAA,KAAA,GAAQ,CAAA;AAAA,IACV;AAEA,IAAA,KAAA,MAAW,SAAS,IAAA,EAAgC;AAClD,MAAA,GAAA,GAAM,UAAA,CAAW,GAAA,EAAK,KAAA,EAAO,KAAA,EAAA,EAAS,IAAI,CAAA;AAAA,IAC5C;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAA,GAAgB;AACd,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,KAAA,GAAc;AACZ,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,CAAA;AAAA,EAC7B;AAkFF,CAAA;AAlVuE,MAAA,CAAA,oBAAA,EAAA,qBAAA,CAAA;AAAhE,IAAe,mBAAA,GAAf,oBAAA;;;ACTA,IAAM,GAAA,GAAM;AAAA;AAAA,EAEjB,iCAAiB,MAAA,CAAA,CAAC,KAAA,EAAe,GAAA,EAAa,GAAA,EAAa,QACzD,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,MAAA,EAAS,KAAK,qBAAqB,GAAG,CAAA,EAAA,EAAK,GAAG,CAAA,EAAA,CAAA,EADvD,iBAAA,CAAA;AAAA,EAGjB,YAAA,0BAAe,GAAA,KACb,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,yBAAA,CAAA,EADZ,cAAA,CAAA;AAAA;AAAA,EAId,eAAA,kBAAiB,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KAChC,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADlB,iBAAA,CAAA;AAAA,EAGjB,kBAAA,0BAAqB,GAAA,KACnB,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,+DAAA,CAAA,EADN,oBAAA,CAAA;AAAA,EAGpB,UAAA,kBAAY,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KAC3B,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADvB,YAAA,CAAA;AAAA,EAGZ,YAAA,kBAAc,MAAA,CAAA,CAAC,IAAA,EAAc,GAAA,KAC3B,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,IAAI,CAAA,oBAAA,CAAA,EADnB,cAAA,CAAA;AAAA,EAGd,YAAA,0BAAe,GAAA,KACb,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,wCAAA,CAAA,EADZ,cAAA,CAAA;AAAA,EAGd,UAAA,0BAAa,GAAA,KACX,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,uBAAA,CAAA,EADd,YAAA,CAAA;AAAA,EAGZ,WAAA,0BAAc,GAAA,KACZ,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,iBAAA,CAAA,EADb,aAAA,CAAA;AAAA,EAGb,WAAA,0BAAc,GAAA,KACZ,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,gDAAA,CAAA,EADb,aAAA,CAAA;AAAA,EAGb,kBAAA,kBAAoB,MAAA,CAAA,CAAC,QAAA,EAAkB,GAAA,EAAa,QAClD,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,qBAAA,EAAwB,QAAQ,CAAA,MAAA,EAAS,GAAG,CAAA,CAAA,CAAA,EADlD,oBAAA,CAAA;AAAA;AAAA,EAIpB,gBAAA,kBAAkB,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KACjC,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADjB,kBAAA,CAAA;AAAA;AAAA,EAIlB,uBAAA,kBAAyB,MAAA,CAAA,CAAC,EAAA,KACxB,CAAA,0CAAA,EAA6C,EAAE,CAAA,CAAA,CAAA,EADxB,yBAAA,CAAA;AAAA,EAGzB,cAAA,+BACE,kDAAA,EADc,gBAAA,CAAA;AAAA,EAGhB,eAAA,+BACE,uCAAA,EADe,iBAAA,CAAA;AAAA,EAGjB,oBAAA,+BACE,gDAAA,EADoB,sBAAA,CAAA;AAAA,EAGtB,iBAAA,0BAAoB,QAAA,EAAkB,GAAA,KACpC,+BAA+B,QAAQ,CAAA,UAAA,EAAa,GAAG,CAAA,CAAA,CAAA,EADtC,mBAAA;AAErB;;;ACzDO,IAAK,YAAA,qBAAAA,aAAAA,KAAL;AACL,EAAAA,aAAAA,CAAAA,aAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AACA,EAAAA,aAAAA,CAAAA,aAAAA,CAAA,aAAU,CAAA,CAAA,GAAV,SAAA;AAFU,EAAA,OAAAA,aAAAA;AAAA,CAAA,EAAA,YAAA,IAAA,EAAA;AAKL,IAAM,MAAA,GAAN,MAAM,MAAA,CAAS;AAAA,EACpB,YACS,GAAA,EACA,IAAA,EACA,UAAA,GAAsB,IAAA,EACtB,cAAuB,IAAA,EAC9B;AAJO,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AACA,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AACA,IAAA,IAAA,CAAA,WAAA,GAAA,WAAA;AAAA,EAIT;AAAA;AAAA,EAGA,SAAA,CAAU,KAAQ,UAAA,EAA6C;AAC7D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,GAAa,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA,IAAK,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA,GAAI,CAAA;AAChG,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,WAAA,GAAc,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA,IAAK,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA;AACpG,IAAA,OAAO,QAAA,IAAY,SAAA;AAAA,EACrB;AACF,CAAA;AAjBsB,MAAA,CAAA,MAAA,EAAA,OAAA,CAAA;AAAf,IAAM,KAAA,GAAN;;;AC8IA,IAAM,KAAA,GAAN,MAAM,KAAA,SAA+B,mBAAA,CAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWpE,WAAA,CAAY,QAAA,GAA4B,EAAC,EAAG,OAAA,EAA6B;AACvE,IAAA,KAAA,CAAM,OAAO,CAAA;AAXf,IAAA,aAAA,CAAA,IAAA,EAAU,WAAmC,MAAA,CAAO,EAAA,CAAA;AAqBpD,IAAA,aAAA,CAAA,IAAA,EAAU,aAAiB,EAAC,CAAA;AAmpB5B,IAAA,aAAA,CAAA,IAAA,EAAmB,qBAAA,kBAAqC,MAAA,CAAA,CAAC,CAAA,EAAM,CAAA,KAAiB;AAC9E,MAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AAClD,QAAA,MAAM,IAAI,SAAA,CAAU,GAAA,CAAI,kBAAA,CAAmB,MAAM,CAAC,CAAA;AAAA,MACpD;AACA,MAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,MAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,MAAA,OAAO,CAAA;AAAA,IACT,CAAA,EAPwD,qBAAA,CAAA,CAAA;AASxD,IAAA,aAAA,CAAA,IAAA,EAAmB,eAA6B,IAAA,CAAK,mBAAA,CAAA;AApqBnD,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,MAAM,EAAE,YAAW,GAAI,OAAA;AACvB,MAAA,IAAI,UAAA,OAAiB,WAAA,GAAc,UAAA;AAAA,IACrC;AAEA,IAAA,IAAA,CAAK,QAAQ,QAA2B,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,QAAA,GAAgB;AAClB,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4BA,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,KAAK,QAAA,CAAS,MAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,IAAA,GAAsB;AA3N5B,IAAA,IAAA,EAAA;AA4NI,IAAA,OAAA,CAAO,UAAK,QAAA,CAAS,IAAA,CAAK,IAAA,GAAO,CAAC,MAA3B,IAAA,GAAA,EAAA,GAAgC,MAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,OAAO,IAAA,CAEL,QAAA,EACA,OAAA,EACG;AACH,IAAA,OAAO,IAAI,IAAA,CAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAO,OAAA,CAA4B,QAAA,EAAwB,OAAA,EAA4C;AACrG,IAAA,OAAO,IAAI,KAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmCA,IAAI,OAAA,EAAqB;AACvB,IAAA,IAAA,CAAK,SAAA,CAAU,KAAK,OAAO,CAAA;AAC3B,IAAA,OAAO,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,QAAQ,QAAA,EAAsC;AAC5C,IAAA,MAAM,QAAmB,EAAC;AAC1B,IAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,MAAA,IAAI,KAAK,WAAA,EAAa;AACpB,QAAA,MAAM,KAAK,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,WAAA,CAAY,EAAO,CAAC,CAAA;AAC7C,QAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,MACf,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,EAAO,CAAA;AAC3B,QAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,MACf;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4CA,IAAA,GAAsB;AACpB,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAChC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,EAAI;AAC/B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,MAAA,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,GAAI,IAAA;AACnB,MAAA,IAAA,CAAK,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8EA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,SAAS,CAAC,CAAA;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,IAAA,KAAS,CAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,YAAY,EAAC;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAAA,EAAkC;AACvC,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA;AACpC,IAAA,OAAO,KAAK,GAAA,EAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBS,IAAI,OAAA,EAAqB;AAChC,IAAA,KAAA,MAAW,EAAA,IAAM,KAAK,QAAA,EAAU,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA,EAAG,OAAO,IAAA;AACtE,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,OAAO,OAAA,EAAqB;AAC1B,IAAA,IAAI,KAAA,GAAQ,EAAA;AACZ,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,IAAI,KAAK,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAC,CAAA,EAAG,OAAO,CAAA,EAAG;AAC3C,QAAA,KAAA,GAAQ,CAAA;AACR,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,KAAA,GAAQ,GAAG,OAAO,KAAA;AACtB,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAA,MAAA,IAAW,KAAA,KAAU,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AAC7C,MAAA,IAAA,CAAK,SAAS,GAAA,EAAI;AAAA,IACpB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,SAAS,MAAA,CAAO,KAAA,EAAO,GAAG,IAAA,CAAK,QAAA,CAAS,KAAM,CAAA;AACnD,MAAA,IAAA,CAAK,UAAU,KAAK,CAAA;AACpB,MAAA,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,SAAA,EAAwE;AAC/E,IAAA,IAAI,GAAA,GAAM,EAAA;AACV,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,IAAI,UAAU,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,EAAG;AACxC,QAAA,GAAA,GAAM,CAAA;AACN,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,GAAA,GAAM,GAAG,OAAO,KAAA;AACpB,IAAA,IAAI,QAAQ,CAAA,EAAG;AACb,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAA,MAAA,IAAW,GAAA,KAAQ,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AAC3C,MAAA,IAAA,CAAK,SAAS,GAAA,EAAI;AAAA,IACpB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,SAAS,MAAA,CAAO,GAAA,EAAK,GAAG,IAAA,CAAK,QAAA,CAAS,KAAM,CAAA;AACjD,MAAA,IAAA,CAAK,UAAU,GAAG,CAAA;AAClB,MAAA,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IAC/C;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,MAAA,EAAuC;AACjD,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,GAAA,CAAI,QAAyB,KAAA,EAAY;AACvC,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,MAAM,IAAA,2BAAQ,KAAA,KAAkB;AAC9B,MAAA,MAAM,IAAA,GAAO,CAAA,GAAI,KAAA,GAAQ,CAAA,EACvB,QAAQ,IAAA,GAAO,CAAA;AACjB,MAAA,IAAI,KAAA,GAAQ,KAAK,IAAA,EAAM;AACrB,QAAA,IAAI,UAAU,IAAA,EAAM;AAClB,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAChC,UAAA,IAAA,CAAK,KAAK,CAAA;AAAA,QACZ,CAAA,MAAA,IAAW,UAAU,KAAA,EAAO;AAC1B,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAChC,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,IAAA,CAAK,KAAK,CAAA;AAAA,QACZ,CAAA,MAAA,IAAW,UAAU,MAAA,EAAQ;AAC3B,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,IAAA,CAAK,KAAK,CAAA;AACV,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAAA,QAClC;AAAA,MACF;AAAA,IACF,CAAA,EAlBa,MAAA,CAAA;AAmBb,IAAA,IAAA,CAAK,CAAC,CAAA;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,GAAiB;AACf,IAAA,MAAM,UAAqB,EAAC;AAC5B,IAAA,KAAA,IAAS,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,GAAO,CAAC,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AACvD,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,SAAA,CAAU,CAAA,EAAG,KAAK,QAAA,CAAS,MAAA,IAAU,CAAC,CAAC,CAAA;AAAA,IAC3D;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,IAAA,GAAY;AACV,IAAA,MAAM,UAAe,EAAC;AACtB,IAAA,MAAM,MAAA,GAAS,KAAK,eAAA,EAAgB;AACpC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAC3C,IAAA,OAAO,CAAC,MAAA,CAAO,OAAA,EAAQ,EAAG;AACxB,MAAA,MAAM,GAAA,GAAM,OAAO,IAAA,EAAK;AACxB,MAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA;AAAA,IACzC;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,KAAA,GAAc;AACZ,IAAA,MAAM,IAAA,GAAO,KAAK,eAAA,EAAgB;AAClC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,IAAA,CAAK,IAAI,CAAC,CAAA;AACzC,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,MAAA,CAAO,UAA0C,OAAA,EAAyB;AACxE,IAAA,MAAM,GAAA,GAAM,KAAK,eAAA,EAAgB;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,EAAG;AACzF,QAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,MACX,CAAA,MAAO;AACL,QAAA,CAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA0BA,GAAA,CACE,QAAA,EACA,OAAA,EACA,OAAA,EACc;AACd,IAAA,MAAM,EAAE,UAAA,EAAY,WAAA,EAAa,GAAG,IAAA,EAAK,GAAI,4BAAW,EAAC;AACzD,IAAA,IAAI,CAAC,YAAY,MAAM,IAAI,UAAU,GAAA,CAAI,kBAAA,CAAmB,UAAU,CAAC,CAAA;AACvE,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,WAAA,CAAoB,EAAC,EAAG,EAAE,GAAG,IAAA,EAAM,UAAA,EAAY,WAAA,EAAa,CAAA;AAC7E,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,KAAK,IAAI,CAAA;AAC9F,MAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IACX;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAA,CAAQ,UAAoC,OAAA,EAAyB;AACnE,IAAA,MAAM,GAAA,GAAM,KAAK,eAAA,EAAgB;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,KAAK,IAAI,CAAA;AAC9F,MAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IACX;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,IAAI,UAAA,GAAa;AACf,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA,EAEA,CAAW,YAAA,GAAoC;AAC7C,IAAA,KAAA,MAAW,OAAA,IAAW,IAAA,CAAK,QAAA,EAAU,MAAM,OAAA;AAAA,EAC7C;AAAA,EAEU,UAAU,KAAA,EAAwB;AAC1C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA;AACnC,IAAA,OAAO,QAAQ,CAAA,EAAG;AAChB,MAAA,MAAM,MAAA,GAAU,QAAQ,CAAA,IAAM,CAAA;AAC9B,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AACvC,MAAA,IAAI,IAAA,CAAK,UAAA,CAAW,UAAA,EAAY,OAAO,KAAK,CAAA,EAAG;AAC/C,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,UAAA;AACvB,MAAA,KAAA,GAAQ,MAAA;AAAA,IACV;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEU,SAAA,CAAU,OAAe,UAAA,EAA6B;AAC9D,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA;AACnC,IAAA,OAAO,QAAQ,UAAA,EAAY;AACzB,MAAA,IAAI,IAAA,GAAQ,SAAS,CAAA,GAAK,CAAA;AAC1B,MAAA,MAAM,QAAQ,IAAA,GAAO,CAAA;AACrB,MAAA,IAAI,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA;AAChC,MAAA,IAAI,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,MAAA,IAAU,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,GAAI,CAAA,EAAG;AACtF,QAAA,IAAA,GAAO,KAAA;AACP,QAAA,OAAA,GAAU,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,MAC/B;AACA,MAAA,IAAI,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,OAAO,KAAK,CAAA,EAAG;AAC5C,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,MAAA,KAAA,GAAQ,IAAA;AAAA,IACV;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASU,gBAAgB,OAAA,EAAmC;AAC3D,IAAA,MAAM,OAAO,IAAA,CAAK,WAAA;AAIlB,IAAA,OAAO,IAAI,IAAA,CAAK,EAAC,EAAG,EAAE,UAAA,EAAY,IAAA,CAAK,UAAA,EAAY,WAAA,EAAa,KAAK,WAAA,EAAa,GAAI,OAAA,IAAA,IAAA,GAAA,OAAA,GAAW,IAAK,CAAA;AAAA,EACxG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYU,WAAA,CACR,QAAA,GAAwC,EAAC,EACzC,OAAA,EACc;AACd,IAAA,MAAM,OAAO,IAAA,CAAK,WAAA;AAIlB,IAAA,OAAO,IAAI,IAAA,CAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWU,WAAmB,OAAA,EAA6C;AACxE,IAAA,OAAO,IAAA,CAAK,WAAA,CAAoB,EAAC,EAAG,OAAO,CAAA;AAAA,EAC7C;AACF,CAAA;AAjxBsE,MAAA,CAAA,KAAA,EAAA,MAAA,CAAA;AAA/D,IAAM,IAAA,GAAN;AAwxBA,IAAM,kBAAA,GAAN,MAAM,kBAAA,CAAqB;AAAA,EAShC,WAAA,CAAY,OAAA,EAAY,MAAA,GAAS,CAAA,EAAG;AARpC,IAAA,aAAA,CAAA,IAAA,EAAA,SAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,MAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AAGE,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AAAA,EAChB;AACF,CAAA;AAdkC,MAAA,CAAA,kBAAA,EAAA,mBAAA,CAAA;AAA3B,IAAM,iBAAA,GAAN;AAsBA,IAAM,cAAA,GAAN,MAAM,cAAA,CAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ5B,YAAY,UAAA,EAA4B;AAMxC,IAAA,aAAA,CAAA,IAAA,EAAU,OAAA,CAAA;AAYV,IAAA,aAAA,CAAA,IAAA,EAAU,OAAA,EAAQ,CAAA,CAAA;AAKlB,IAAA,aAAA,CAAA,IAAA,EAAU,MAAA,CAAA;AAYV,IAAA,aAAA,CAAA,IAAA,EAAmB,aAAA,CAAA;AAlCjB,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,IAAA,CAAK,WAAA,GAAc,cAAc,IAAA,CAAK,kBAAA;AACtC,IAAA,IAAI,OAAO,IAAA,CAAK,UAAA,KAAe,UAAA,EAAY,MAAM,IAAI,SAAA,CAAU,GAAA,CAAI,YAAA,CAAa,YAAA,EAAc,eAAe,CAAC,CAAA;AAAA,EAChH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,IAAA,GAAyC;AAC3C,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAGA,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,GAAA,GAAwC;AAC1C,IAAA,OAAO,IAAA,CAAK,IAAA;AAAA,EACd;AAAA,EAIA,IAAI,UAAA,GAA4B;AAC9B,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,MAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,MAAA;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AAAA,EACf;AAAA,EAEA,IAAI,OAAA,EAAqB;AACvB,IAAA,IAAA,CAAK,KAAK,OAAO,CAAA;AACjB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,KAAK,OAAA,EAAkB;AACrB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,cAAc,IAAI,CAAA;AACvB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,IAAK,CAAA,OAAQ,IAAA,GAAO,IAAA;AACnF,IAAA,IAAA,CAAK,KAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,MAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,kBAAkB,IAAA,EAAqD;AACrE,IAAA,MAAM,WAAmC,EAAC;AAC1C,IAAA,IAAI,CAAC,MAAM,OAAO,QAAA;AAClB,IAAA,IAAI,IAAA,GAAyC,IAAA;AAC7C,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,OAAO,IAAA,EAAM;AACX,MAAA,IAAI,IAAA,KAAS,QAAQ,OAAA,EAAS;AAAA,WAAA,IACrB,IAAA,KAAS,MAAM,OAAA,GAAU,IAAA;AAClC,MAAA,QAAA,CAAS,KAAK,IAAK,CAAA;AACnB,MAAA,IAAA,GAAO,IAAA,CAAM,KAAA;AAAA,IACf;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAA,CAAe,QAA8B,IAAA,EAAkC;AAC7E,IAAA,IAAI,CAAC,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,KAAA,GAAQ,IAAA;AAAA,SAC7B;AACH,MAAA,IAAA,CAAK,KAAA,GAAQ,OAAO,KAAA,CAAM,KAAA;AAC1B,MAAA,IAAA,CAAK,OAAO,MAAA,CAAO,KAAA;AACnB,MAAA,MAAA,CAAO,KAAA,CAAM,MAAO,IAAA,GAAO,IAAA;AAC3B,MAAA,MAAA,CAAO,MAAM,KAAA,GAAQ,IAAA;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,IAAA,GAAsB;AACpB,IAAA,OAAO,KAAK,GAAA,EAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,GAAqB;AACnB,IAAA,IAAI,IAAA,CAAK,KAAA,KAAU,CAAA,EAAG,OAAO,MAAA;AAC7B,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA;AACf,IAAA,IAAI,EAAE,KAAA,EAAO;AACX,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,iBAAA,CAAkB,CAAA,CAAE,KAAK,CAAA;AAC/C,MAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,QAAA,IAAA,CAAK,cAAc,IAAI,CAAA;AACvB,QAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,IAAA,CAAK,eAAe,CAAC,CAAA;AACrB,IAAA,IAAI,CAAA,KAAM,EAAE,KAAA,EAAO;AACjB,MAAA,IAAA,CAAK,IAAA,GAAO,MAAA;AACZ,MAAA,IAAA,CAAK,KAAA,GAAQ,MAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,OAAO,CAAA,CAAE,KAAA;AACd,MAAA,IAAA,CAAK,YAAA,EAAa;AAAA,IACpB;AACA,IAAA,IAAA,CAAK,KAAA,EAAA;AACL,IAAA,OAAO,CAAA,CAAE,OAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAAA,EAAqC;AACzC,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC5B,IAAA,IAAI,IAAA,CAAK,IAAA,IAAQ,WAAA,CAAY,IAAA,EAAM;AACjC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,EACpB,SAAA,GAAY,WAAA,CAAY,IAAA;AAC1B,MAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,KAAA,EAC7B,aAAA,GAAgB,SAAA,CAAU,IAAA;AAC5B,MAAA,QAAA,CAAS,KAAA,GAAQ,SAAA;AACjB,MAAA,SAAA,CAAU,IAAA,GAAO,QAAA;AACjB,MAAA,aAAA,CAAc,IAAA,GAAO,aAAA;AACrB,MAAA,aAAA,CAAc,KAAA,GAAQ,aAAA;AAAA,IACxB,CAAA,MAAA,IAAW,CAAC,IAAA,CAAK,IAAA,IAAQ,YAAY,IAAA,EAAM;AACzC,MAAA,IAAA,CAAK,QAAQ,WAAA,CAAY,IAAA;AAAA,IAC3B;AACA,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,IAAQ,WAAA,CAAY,OAAO,IAAA,CAAK,UAAA,CAAW,WAAA,CAAY,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,GAAA,CAAI,OAAO,IAAI,CAAA,EAAI;AACpG,MAAA,IAAA,CAAK,OAAO,WAAA,CAAY,GAAA;AAAA,IAC1B;AACA,IAAA,IAAA,CAAK,SAAS,WAAA,CAAY,IAAA;AAC1B,IAAA,WAAA,CAAY,KAAA,EAAM;AAAA,EACpB;AAAA,EAEA,WAAW,OAAA,EAAkC;AAC3C,IAAA,OAAO,IAAI,kBAAqB,OAAO,CAAA;AAAA,EACzC;AAAA,EAEA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,KAAA,KAAU,CAAA;AAAA,EACxB;AAAA,EAEU,kBAAA,CAAmB,GAAM,CAAA,EAAc;AAC/C,IAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,IAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEU,cAAc,IAAA,EAAkC;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,SACxB;AACH,MAAA,IAAA,CAAK,KAAA,GAAQ,KAAK,IAAA,CAAK,KAAA;AACvB,MAAA,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AACjB,MAAA,IAAA,CAAK,IAAA,CAAK,MAAO,IAAA,GAAO,IAAA;AACxB,MAAA,IAAA,CAAK,KAAK,KAAA,GAAQ,IAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEU,eAAe,IAAA,EAAkC;AACzD,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,IAAA,EAAM,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AAC1C,IAAA,IAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AACtC,IAAA,IAAI,IAAA,CAAK,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,OAAO,IAAA,CAAK,IAAA;AAAA,EACzC;AAAA,EAEU,KAAA,CAAM,GAAyB,CAAA,EAA+B;AACtE,IAAA,IAAA,CAAK,eAAe,CAAC,CAAA;AACrB,IAAA,CAAA,CAAE,IAAA,GAAO,CAAA;AACT,IAAA,CAAA,CAAE,KAAA,GAAQ,CAAA;AACV,IAAA,IAAA,CAAK,cAAA,CAAe,GAAG,CAAC,CAAA;AACxB,IAAA,CAAA,CAAE,MAAA,EAAA;AACF,IAAA,CAAA,CAAE,MAAA,GAAS,CAAA;AAAA,EACb;AAAA,EAEU,YAAA,GAAqB;AAC7B,IAAA,MAAM,CAAA,GAA0C,IAAI,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AACpE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAI,CAAA;AACjD,IAAA,IAAI,CAAA,EACF,GACA,CAAA,EACA,CAAA;AAEF,IAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,MAAA,CAAA,GAAI,IAAA;AACJ,MAAA,CAAA,GAAI,CAAA,CAAE,MAAA;AACN,MAAA,OAAO,CAAA,CAAE,CAAC,CAAA,EAAG;AACX,QAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AACP,QAAA,IAAI,KAAK,UAAA,CAAW,CAAA,CAAE,SAAS,CAAA,CAAE,OAAO,IAAI,CAAA,EAAG;AAC7C,UAAA,CAAA,GAAI,CAAA;AACJ,UAAA,CAAA,GAAI,CAAA;AACJ,UAAA,CAAA,GAAI,CAAA;AAAA,QACN;AACA,QAAA,IAAA,CAAK,KAAA,CAAM,GAAG,CAAC,CAAA;AACf,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,MAAA;AACP,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA;AAAA,IACT;AAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,MAAA,IAAI,CAAA,CAAE,CAAC,CAAA,KAAM,CAAC,KAAK,GAAA,IAAO,IAAA,CAAK,WAAW,CAAA,CAAE,CAAC,EAAG,OAAA,EAAS,IAAA,CAAK,IAAI,OAAO,CAAA,IAAK,IAAI,IAAA,CAAK,IAAA,GAAO,EAAE,CAAC,CAAA;AAAA,IACnG;AAAA,EACF;AACF,CAAA;AAxP8B,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA;AAAvB,IAAM,aAAA,GAAN;;;ACz3BA,IAAM,cAAA,GAAN,MAAM,cAAA,SAAwC,IAAA,CAAW;AAAA,EAC9D,WAAA,CAAY,QAAA,GAAsC,EAAC,EAAG,OAAA,EAAsC;AAC1F,IAAA,KAAA,CAAM,UAAU,OAAO,CAAA;AAAA,EACzB;AACF,CAAA;AAJgE,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA;AAAzD,IAAM,aAAA,GAAN;;;ACEA,IAAM,iBAAA,GAAN,MAAM,iBAAA,SAA2C,aAAA,CAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ1E,WAAA,CAAY,QAAA,GAAsC,EAAC,EAAG,OAAA,EAAsC;AAC1F,IAAA,KAAA,CAAM,QAAA,EAAU;AAAA,MACd,UAAA,kBAAY,MAAA,CAAA,CAAC,CAAA,EAAM,CAAA,KAAiB;AAClC,QAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AAClD,UAAA,MAAM,IAAI,SAAA,CAAU,GAAA,CAAI,kBAAA,CAAmB,kBAAkB,CAAC,CAAA;AAAA,QAChE;AACA,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,QAAA,OAAO,CAAA;AAAA,MACT,CAAA,EAPY,YAAA,CAAA;AAAA,MAQZ,GAAG;AAAA,KACJ,CAAA;AAAA,EACH;AACF,CAAA;AArB4E,MAAA,CAAA,iBAAA,EAAA,kBAAA,CAAA;AAArE,IAAM,gBAAA,GAAN","file":"index.mjs","sourcesContent":["import type { ElementCallback, IterableElementBaseOptions, ReduceElementCallback } from '../../types';\n\n/**\n * Base class that makes a data structure iterable and provides common\n * element-wise utilities (e.g., map/filter/reduce/find).\n *\n * @template E The public element type yielded by the structure.\n * @template R The underlying \"raw\" element type used internally or by converters.\n *\n * @remarks\n * This class implements the JavaScript iteration protocol (via `Symbol.iterator`)\n * and offers array-like helpers with predictable time/space complexity.\n */\nexport abstract class IterableElementBase<E, R> implements Iterable<E> {\n  /**\n   * Create a new iterable base.\n   *\n   * @param options Optional behavior overrides. When provided, a `toElementFn`\n   * is used to convert a raw element (`R`) into a public element (`E`).\n   *\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  protected constructor(options?: IterableElementBaseOptions<E, R>) {\n    if (options) {\n      const { toElementFn } = options;\n      if (typeof toElementFn === 'function') this._toElementFn = toElementFn;\n      else if (toElementFn) throw new TypeError('toElementFn must be a function type');\n    }\n  }\n\n  /**\n   * The converter used to transform a raw element (`R`) into a public element (`E`).\n   *\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  protected _toElementFn?: (rawElement: R) => E;\n\n  /**\n   * Exposes the current `toElementFn`, if configured.\n   *\n   * @returns The converter function or `undefined` when not set.\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  get toElementFn(): ((rawElement: R) => E) | undefined {\n    return this._toElementFn;\n  }\n\n  /**\n   * Returns an iterator over the structure's elements.\n   *\n   * @param args Optional iterator arguments forwarded to the internal iterator.\n   * @returns An `IterableIterator<E>` that yields the elements in traversal order.\n   *\n   * @remarks\n   * Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.\n   */\n  *[Symbol.iterator](...args: unknown[]): IterableIterator<E> {\n    yield* this._getIterator(...args);\n  }\n\n  /**\n   * Returns an iterator over the values (alias of the default iterator).\n   *\n   * @returns An `IterableIterator<E>` over all elements.\n   * @remarks\n   * Creating the iterator is O(1); full iteration is Time O(n), Space O(1).\n   */\n  *values(): IterableIterator<E> {\n    for (const item of this) yield item;\n  }\n\n  /**\n   * Tests whether all elements satisfy the predicate.\n   *\n   * @template TReturn\n   * @param predicate Function invoked for each element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns `true` if every element passes; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).\n   */\n  every(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): boolean {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (!predicate(item, index++, this)) return false;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (!fn.call(thisArg, item, index++, this)) return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Tests whether at least one element satisfies the predicate.\n   *\n   * @param predicate Function invoked for each element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns `true` if any element passes; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early on first success. Space O(1).\n   */\n  some(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): boolean {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (predicate(item, index++, this)) return true;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (fn.call(thisArg, item, index++, this)) return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Invokes a callback for each element in iteration order.\n   *\n   * @param callbackfn Function invoked per element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns `void`.\n   *\n   * @remarks\n   * Time O(n), Space O(1).\n   */\n  forEach(callbackfn: ElementCallback<E, R, void>, thisArg?: unknown): void {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        callbackfn(item, index++, this);\n      } else {\n        const fn = callbackfn as (this: unknown, v: E, i: number, self: this) => void;\n        fn.call(thisArg, item, index++, this);\n      }\n    }\n  }\n\n  /**\n   * Finds the first element that satisfies the predicate and returns it.\n   *\n   * @overload\n   * Finds the first element of type `S` (a subtype of `E`) that satisfies the predicate and returns it.\n   * @template S\n   * @param predicate Type-guard predicate: `(value, index, self) => value is S`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns The matched element typed as `S`, or `undefined` if not found.\n   *\n   * @overload\n   * @param predicate Boolean predicate: `(value, index, self) => boolean`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns The first matching element as `E`, or `undefined` if not found.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early on the first match. Space O(1).\n   */\n  find<S extends E>(predicate: ElementCallback<E, R, S>, thisArg?: unknown): S | undefined;\n  find(predicate: ElementCallback<E, R, unknown>, thisArg?: unknown): E | undefined;\n\n  // Implementation signature\n  find(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): E | undefined {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (predicate(item, index++, this)) return item;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (fn.call(thisArg, item, index++, this)) return item;\n      }\n    }\n    return;\n  }\n\n  /**\n   * Checks whether a strictly-equal element exists in the structure.\n   *\n   * @param element The element to test with `===` equality.\n   * @returns `true` if an equal element is found; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case. Space O(1).\n   */\n  has(element: E): boolean {\n    for (const ele of this) if (ele === element) return true;\n    return false;\n  }\n\n  reduce(callbackfn: ReduceElementCallback<E, R>): E;\n  reduce(callbackfn: ReduceElementCallback<E, R>, initialValue: E): E;\n  reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue: U): U;\n\n  /**\n   * Reduces all elements to a single accumulated value.\n   *\n   * @overload\n   * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`. The first element is used as the initial accumulator.\n   * @returns The final accumulated value typed as `E`.\n   *\n   * @overload\n   * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`.\n   * @param initialValue The initial accumulator value of type `E`.\n   * @returns The final accumulated value typed as `E`.\n   *\n   * @overload\n   * @template U The accumulator type when it differs from `E`.\n   * @param callbackfn Reducer of signature `(acc: U, value, index, self) => U`.\n   * @param initialValue The initial accumulator value of type `U`.\n   * @returns The final accumulated value typed as `U`.\n   *\n   * @remarks\n   * Time O(n), Space O(1). Throws if called on an empty structure without `initialValue`.\n   */\n  reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue?: U): U {\n    let index = 0;\n    const iter = this[Symbol.iterator]();\n    let acc: U;\n\n    if (arguments.length >= 2) {\n      acc = initialValue as U;\n    } else {\n      const first = iter.next();\n      if (first.done) throw new TypeError('Reduce of empty structure with no initial value');\n      acc = first.value as unknown as U;\n      index = 1;\n    }\n\n    for (const value of iter as unknown as Iterable<E>) {\n      acc = callbackfn(acc, value, index++, this);\n    }\n    return acc;\n  }\n\n  /**\n   * Materializes the elements into a new array.\n   *\n   * @returns A shallow array copy of the iteration order.\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  toArray(): E[] {\n    return [...this];\n  }\n\n  /**\n   * Returns a representation of the structure suitable for quick visualization.\n   * Defaults to an array of elements; subclasses may override to provide richer visuals.\n   *\n   * @returns A visual representation (array by default).\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  toVisual(): E[] {\n    return [...this];\n  }\n\n  /**\n   * Prints `toVisual()` to the console. Intended for quick debugging.\n   *\n   * @returns `void`.\n   * @remarks\n   * Time O(n) due to materialization, Space O(n) for the intermediate representation.\n   */\n  print(): void {\n    console.log(this.toVisual());\n  }\n\n  /**\n   * Indicates whether the structure currently contains no elements.\n   *\n   * @returns `true` if empty; otherwise `false`.\n   * @remarks\n   * Expected Time O(1), Space O(1) for most implementations.\n   */\n  abstract isEmpty(): boolean;\n\n  /**\n   * Removes all elements from the structure.\n   *\n   * @returns `void`.\n   * @remarks\n   * Expected Time O(1) or O(n) depending on the implementation; Space O(1).\n   */\n  abstract clear(): void;\n\n  /**\n   * Creates a structural copy with the same element values and configuration.\n   *\n   * @returns A clone of the current instance (same concrete type).\n   * @remarks\n   * Expected Time O(n) to copy elements; Space O(n).\n   */\n  abstract clone(): this;\n\n  /**\n   * Maps each element to a new element and returns a new iterable structure.\n   *\n   * @template EM The mapped element type.\n   * @template RM The mapped raw element type used internally by the target structure.\n   * @param callback Function with signature `(value, index, self) => mapped`.\n   * @param options Optional options for the returned structure, including its `toElementFn`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns A new `IterableElementBase<EM, RM>` containing mapped elements.\n   *\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  abstract map<EM, RM>(\n    callback: ElementCallback<E, R, EM>,\n    options?: IterableElementBaseOptions<EM, RM>,\n    thisArg?: unknown\n  ): IterableElementBase<EM, RM>;\n\n  /**\n   * Maps each element to the same element type and returns the same concrete structure type.\n   *\n   * @param callback Function with signature `(value, index, self) => mappedValue`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns A new instance of the same concrete type with mapped elements.\n   *\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  abstract mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;\n\n  /**\n   * Filters elements using the provided predicate and returns the same concrete structure type.\n   *\n   * @param predicate Function with signature `(value, index, self) => boolean`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns A new instance of the same concrete type containing only elements that pass the predicate.\n   *\n   * @remarks\n   * Time O(n), Space O(k) where `k` is the number of kept elements.\n   */\n  abstract filter(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): this;\n\n  /**\n   * Internal iterator factory used by the default iterator.\n   *\n   * @param args Optional iterator arguments.\n   * @returns An iterator over elements.\n   *\n   * @remarks\n   * Implementations should yield in O(1) per element with O(1) extra space when possible.\n   */\n  protected abstract _getIterator(...args: unknown[]): IterableIterator<E>;\n}\n","/**\n * Centralized error message templates.\n * Keep using native Error/TypeError/RangeError — this only standardizes messages.\n */\nexport const ERR = {\n  // Range / index\n  indexOutOfRange: (index: number, min: number, max: number, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Index ${index} is out of range [${min}, ${max}].`,\n\n  invalidIndex: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Index must be an integer.`,\n\n  // Type / argument\n  invalidArgument: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  comparatorRequired: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Comparator is required for non-number/non-string/non-Date keys.`,\n\n  invalidKey: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  notAFunction: (name: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${name} must be a function.`,\n\n  invalidEntry: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Each entry must be a [key, value] tuple.`,\n\n  invalidNaN: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}NaN is not a valid key.`,\n\n  invalidDate: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Invalid Date key.`,\n\n  reduceEmpty: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Reduce of empty structure with no initial value.`,\n\n  callbackReturnType: (expected: string, got: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Callback must return ${expected}; got ${got}.`,\n\n  // State / operation\n  invalidOperation: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  // Matrix\n  matrixDimensionMismatch: (op: string) =>\n    `Matrix: Dimensions must be compatible for ${op}.`,\n\n  matrixSingular: () =>\n    'Matrix: Singular matrix, inverse does not exist.',\n\n  matrixNotSquare: () =>\n    'Matrix: Must be square for inversion.',\n\n  matrixNotRectangular: () =>\n    'Matrix: Must be rectangular for transposition.',\n\n  matrixRowMismatch: (expected: number, got: number) =>\n    `Matrix: Expected row length ${expected}, but got ${got}.`\n} as const;\n","export { ERR } from './error';\n\nexport enum DFSOperation {\n  VISIT = 0,\n  PROCESS = 1\n}\n\nexport class Range<K> {\n  constructor(\n    public low: K,\n    public high: K,\n    public includeLow: boolean = true,\n    public includeHigh: boolean = true\n  ) {\n    // if (!(isComparable(low) && isComparable(high))) throw new RangeError('low or high is not comparable');\n    // if (low > high) throw new RangeError('low must be less than or equal to high');\n  }\n\n  // Determine whether a key is within the range\n  isInRange(key: K, comparator: (a: K, b: K) => number): boolean {\n    const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;\n    const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;\n    return lowCheck && highCheck;\n  }\n}\n","/**\n * data-structure-typed\n *\n * @author Pablo Zeng\n * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>\n * @license MIT License\n */\n\nimport type { Comparator, DFSOrderPattern, ElementCallback, HeapOptions } from '../../types';\nimport { IterableElementBase } from '../base';\nimport { ERR } from '../../common';\n\n/**\n * Binary heap with pluggable comparator; supports fast insertion and removal of the top element.\n * @remarks Time O(1), Space O(1)\n * @template E\n * @template R\n * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.\n * 2. Heap Properties: Each node in a heap follows a specific order property, which varies depending on the type of heap:\n * Max Heap: The value of each parent node is greater than or equal to the value of its children.\n * Min Heap: The value of each parent node is less than or equal to the value of its children.\n * 3. Root Node Access: In a heap, the largest element (in a max heap) or the smallest element (in a min heap) is always at the root of the tree.\n * 4. Efficient Insertion and Deletion: Due to its structure, a heap allows for insertion and deletion operations in logarithmic time (O(log n)).\n * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.\n * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.\n * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.\n * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prime's minimum-spanning tree algorithm, which use heaps to improve performance.\n * @example\n * // Use Heap to solve top k problems\n *  function topKElements(arr: number[], k: number): number[] {\n *       const heap = new Heap<number>([], { comparator: (a, b) => b - a }); // Max heap\n *       arr.forEach(num => {\n *         heap.add(num);\n *         if (heap.size > k) heap.poll(); // Keep the heap size at K\n *       });\n *       return heap.toArray();\n *     }\n *\n *     const numbers = [10, 30, 20, 5, 15, 25];\n *     console.log(topKElements(numbers, 3)); // [15, 10, 5];\n * @example\n * // Use Heap to dynamically maintain the median\n *  class MedianFinder {\n *       private low: MaxHeap<number>; // Max heap, stores the smaller half\n *       private high: MinHeap<number>; // Min heap, stores the larger half\n *\n *       constructor() {\n *         this.low = new MaxHeap<number>([]);\n *         this.high = new MinHeap<number>([]);\n *       }\n *\n *       addNum(num: number): void {\n *         if (this.low.isEmpty() || num <= this.low.peek()!) this.low.add(num);\n *         else this.high.add(num);\n *\n *         // Balance heaps\n *         if (this.low.size > this.high.size + 1) this.high.add(this.low.poll()!);\n *         else if (this.high.size > this.low.size) this.low.add(this.high.poll()!);\n *       }\n *\n *       findMedian(): number {\n *         if (this.low.size === this.high.size) return (this.low.peek()! + this.high.peek()!) / 2;\n *         return this.low.peek()!;\n *       }\n *     }\n *\n *     const medianFinder = new MedianFinder();\n *     medianFinder.addNum(10);\n *     console.log(medianFinder.findMedian()); // 10;\n *     medianFinder.addNum(20);\n *     console.log(medianFinder.findMedian()); // 15;\n *     medianFinder.addNum(30);\n *     console.log(medianFinder.findMedian()); // 20;\n *     medianFinder.addNum(40);\n *     console.log(medianFinder.findMedian()); // 25;\n *     medianFinder.addNum(50);\n *     console.log(medianFinder.findMedian()); // 30;\n * @example\n * // Use Heap for load balancing\n *  function loadBalance(requests: number[], servers: number): number[] {\n *       const serverHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // min heap\n *       const serverLoads = new Array(servers).fill(0);\n *\n *       for (let i = 0; i < servers; i++) {\n *         serverHeap.add({ id: i, load: 0 });\n *       }\n *\n *       requests.forEach(req => {\n *         const server = serverHeap.poll()!;\n *         serverLoads[server.id] += req;\n *         server.load += req;\n *         serverHeap.add(server); // The server after updating the load is re-entered into the heap\n *       });\n *\n *       return serverLoads;\n *     }\n *\n *     const requests = [5, 2, 8, 3, 7];\n *     console.log(loadBalance(requests, 3)); // [12, 8, 5];\n * @example\n * // Use Heap to schedule tasks\n *  type Task = [string, number];\n *\n *     function scheduleTasks(tasks: Task[], machines: number): Map<number, Task[]> {\n *       const machineHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // Min heap\n *       const allocation = new Map<number, Task[]>();\n *\n *       // Initialize the load on each machine\n *       for (let i = 0; i < machines; i++) {\n *         machineHeap.add({ id: i, load: 0 });\n *         allocation.set(i, []);\n *       }\n *\n *       // Assign tasks\n *       tasks.forEach(([task, load]) => {\n *         const machine = machineHeap.poll()!;\n *         allocation.get(machine.id)!.push([task, load]);\n *         machine.load += load;\n *         machineHeap.add(machine); // The machine after updating the load is re-entered into the heap\n *       });\n *\n *       return allocation;\n *     }\n *\n *     const tasks: Task[] = [\n *       ['Task1', 3],\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task4', 5],\n *       ['Task5', 4]\n *     ];\n *     const expectedMap = new Map<number, Task[]>();\n *     expectedMap.set(0, [\n *       ['Task1', 3],\n *       ['Task4', 5]\n *     ]);\n *     expectedMap.set(1, [\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task5', 4]\n *     ]);\n *     console.log(scheduleTasks(tasks, 2)); // expectedMap;\n * @example\n * // Get all elements as array\n *  const heap = new Heap<number>([5, 1, 3, 2, 4]);\n *     const arr = heap.toArray();\n *     console.log(arr.length); // 5;\n *     console.log(arr.sort()); // [1, 2, 3, 4, 5];\n */\nexport class Heap<E = any, R = any> extends IterableElementBase<E, R> {\n  protected _equals: (a: E, b: E) => boolean = Object.is;\n\n  /**\n   * Create a Heap and optionally bulk-insert elements.\n   * @remarks Time O(N), Space O(N)\n   * @param [elements] - Iterable of elements (or raw values if toElementFn is set).\n   * @param [options] - Options such as comparator and toElementFn.\n   * @returns New Heap instance.\n   */\n\n  constructor(elements: Iterable<E | R> = [], options?: HeapOptions<E, R>) {\n    super(options);\n\n    if (options) {\n      const { comparator } = options;\n      if (comparator) this._comparator = comparator;\n    }\n\n    this.addMany(elements as Iterable<E | R>);\n  }\n\n  protected _elements: E[] = [];\n\n  /**\n   * Get the backing array of the heap.\n   * @remarks Time O(1), Space O(1)\n   * @returns Internal elements array.\n   */\n\n  get elements(): E[] {\n    return this._elements;\n  }\n\n  /**\n   * Get the number of elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns Heap size.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Track heap capacity\n *  const heap = new Heap<number>();\n *     console.log(heap.size); // 0;\n *     heap.add(10);\n *     heap.add(20);\n *     console.log(heap.size); // 2;\n *     heap.poll();\n *     console.log(heap.size); // 1;\n   */\n\n  get size(): number {\n    return this.elements.length;\n  }\n\n  /**\n   * Get the last leaf element.\n   * @remarks Time O(1), Space O(1)\n   * @returns Last element or undefined.\n   */\n\n  get leaf(): E | undefined {\n    return this.elements[this.size - 1] ?? undefined;\n  }\n\n  /**\n   * Create a heap of the same class from an iterable.\n   * @remarks Time O(N), Space O(N)\n   * @template T\n   * @template R\n   * @template S\n   * @param [elements] - Iterable of elements or raw records.\n   * @param [options] - Heap options including comparator.\n   * @returns A new heap instance of this class.\n   */\n\n  static from<T, R = any, S extends Heap<T, R> = Heap<T, R>>(\n    this: new (elements?: Iterable<T | R>, options?: HeapOptions<T, R>) => S,\n    elements?: Iterable<T | R>,\n    options?: HeapOptions<T, R>\n  ): S {\n    return new this(elements, options);\n  }\n\n  /**\n   * Build a Heap from an iterable in linear time given a comparator.\n   * @remarks Time O(N), Space O(N)\n   * @template EE\n   * @template RR\n   * @param elements - Iterable of elements.\n   * @param options - Heap options including comparator.\n   * @returns A new Heap built from elements.\n   */\n\n  static heapify<EE = any, RR = any>(elements: Iterable<EE>, options: HeapOptions<EE, RR>): Heap<EE, RR> {\n    return new Heap<EE, RR>(elements, options);\n  }\n\n  /**\n   * Insert an element.\n   * @remarks Time O(1) amortized, Space O(1)\n   * @param element - Element to insert.\n   * @returns True.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // basic Heap creation and add operation\n *  // Create a min heap (default)\n *     const minHeap = new Heap([5, 3, 7, 1, 9, 2]);\n *\n *     // Verify size\n *     console.log(minHeap.size); // 6;\n *\n *     // Add new element\n *     minHeap.add(4);\n *     console.log(minHeap.size); // 7;\n *\n *     // Min heap property: smallest element at root\n *     const min = minHeap.peek();\n *     console.log(min); // 1;\n   */\n\n  add(element: E): boolean {\n    this._elements.push(element);\n    return this._bubbleUp(this.elements.length - 1);\n  }\n\n  /**\n   * Insert many elements from an iterable.\n   * @remarks Time O(N log N), Space O(1)\n   * @param elements - Iterable of elements or raw values.\n   * @returns Array of per-element success flags.\n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Add multiple elements\n *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });\n *     heap.addMany([5, 3, 7, 1]);\n *     console.log(heap.peek()); // 1;\n *     console.log(heap.size); // 4;\n   */\n\n  addMany(elements: Iterable<E | R>): boolean[] {\n    const flags: boolean[] = [];\n    for (const el of elements) {\n      if (this.toElementFn) {\n        const ok = this.add(this.toElementFn(el as R));\n        flags.push(ok);\n      } else {\n        const ok = this.add(el as E);\n        flags.push(ok);\n      }\n    }\n    return flags;\n  }\n\n  /**\n   * Remove and return the top element.\n   * @remarks Time O(log N), Space O(1)\n   * @returns Top element or undefined.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Heap with custom comparator (MaxHeap behavior)\n *  interface Task {\n *       id: number;\n *       priority: number;\n *       name: string;\n *     }\n *\n *     // Custom comparator for max heap behavior (higher priority first)\n *     const tasks: Task[] = [\n *       { id: 1, priority: 5, name: 'Email' },\n *       { id: 2, priority: 3, name: 'Chat' },\n *       { id: 3, priority: 8, name: 'Alert' }\n *     ];\n *\n *     const maxHeap = new Heap(tasks, {\n *       comparator: (a: Task, b: Task) => b.priority - a.priority\n *     });\n *\n *     console.log(maxHeap.size); // 3;\n *\n *     // Peek returns highest priority task\n *     const topTask = maxHeap.peek();\n *     console.log(topTask?.priority); // 8;\n *     console.log(topTask?.name); // 'Alert';\n   */\n\n  poll(): E | undefined {\n    if (this.elements.length === 0) return;\n    const value = this.elements[0];\n    const last = this.elements.pop()!;\n    if (this.elements.length) {\n      this.elements[0] = last;\n      this._sinkDown(0, this.elements.length >> 1);\n    }\n    return value;\n  }\n\n  /**\n   * Get the current top element without removing it.\n   * @remarks Time O(1), Space O(1)\n   * @returns Top element or undefined.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Heap for event processing with priority\n *  interface Event {\n *       id: number;\n *       type: 'critical' | 'warning' | 'info';\n *       timestamp: number;\n *       message: string;\n *     }\n *\n *     // Custom priority: critical > warning > info\n *     const priorityMap = { critical: 3, warning: 2, info: 1 };\n *\n *     const eventHeap = new Heap<Event>([], {\n *       comparator: (a: Event, b: Event) => {\n *         const priorityA = priorityMap[a.type];\n *         const priorityB = priorityMap[b.type];\n *         return priorityB - priorityA; // Higher priority first\n *       }\n *     });\n *\n *     // Add events in random order\n *     eventHeap.add({ id: 1, type: 'info', timestamp: 100, message: 'User logged in' });\n *     eventHeap.add({ id: 2, type: 'critical', timestamp: 101, message: 'Server down' });\n *     eventHeap.add({ id: 3, type: 'warning', timestamp: 102, message: 'High memory' });\n *     eventHeap.add({ id: 4, type: 'info', timestamp: 103, message: 'Cache cleared' });\n *     eventHeap.add({ id: 5, type: 'critical', timestamp: 104, message: 'Database error' });\n *\n *     console.log(eventHeap.size); // 5;\n *\n *     // Process events by priority (critical first)\n *     const processedOrder: Event[] = [];\n *     while (eventHeap.size > 0) {\n *       const event = eventHeap.poll();\n *       if (event) {\n *         processedOrder.push(event);\n *       }\n *     }\n *\n *     // Verify critical events came first\n *     console.log(processedOrder[0].type); // 'critical';\n *     console.log(processedOrder[1].type); // 'critical';\n *     console.log(processedOrder[2].type); // 'warning';\n *     console.log(processedOrder[3].type); // 'info';\n *     console.log(processedOrder[4].type); // 'info';\n *\n *     // Verify O(log n) operations\n *     const newHeap = new Heap<number>([5, 3, 7, 1]);\n *\n *     // Add - O(log n)\n *     newHeap.add(2);\n *     console.log(newHeap.size); // 5;\n *\n *     // Poll - O(log n)\n *     const removed = newHeap.poll();\n *     console.log(removed); // 1;\n *\n *     // Peek - O(1)\n *     const top = newHeap.peek();\n *     console.log(top); // 2;\n   */\n\n  peek(): E | undefined {\n    return this.elements[0];\n  }\n\n  /**\n   * Check whether the heap is empty.\n   * @remarks Time O(1), Space O(1)\n   * @returns True if size is 0.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Check if heap is empty\n *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });\n *     console.log(heap.isEmpty()); // true;\n *     heap.add(1);\n *     console.log(heap.isEmpty()); // false;\n   */\n\n  isEmpty(): boolean {\n    return this.size === 0;\n  }\n\n  /**\n   * Remove all elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns void\n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Remove all elements\n *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });\n *     heap.clear();\n *     console.log(heap.isEmpty()); // true;\n   */\n\n  clear(): void {\n    this._elements = [];\n  }\n\n  /**\n   * Replace the backing array and rebuild the heap.\n   * @remarks Time O(N), Space O(N)\n   * @param elements - Iterable used to refill the heap.\n   * @returns Array of per-node results from fixing steps.\n   */\n\n  refill(elements: Iterable<E>): boolean[] {\n    this._elements = Array.from(elements);\n    return this.fix();\n  }\n\n  /**\n   * Check if an equal element exists in the heap.\n   * @remarks Time O(N), Space O(1)\n   * @param element - Element to search for.\n   * @returns True if found.\n   \n   \n    * @example\n * // Check element existence\n *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });\n *     console.log(heap.has(1)); // true;\n *     console.log(heap.has(99)); // false;\n   */\n\n  override has(element: E): boolean {\n    for (const el of this.elements) if (this._equals(el, element)) return true;\n    return false;\n  }\n\n  /**\n   * Delete one occurrence of an element.\n   * @remarks Time O(N), Space O(1)\n   * @param element - Element to delete.\n   * @returns True if an element was removed.\n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Remove specific element\n *  const heap = new Heap<number>([3, 1, 4, 1, 5], { comparator: (a, b) => a - b });\n *     heap.delete(4);\n *     console.log(heap.toArray().includes(4)); // false;\n   */\n\n  delete(element: E): boolean {\n    let index = -1;\n    for (let i = 0; i < this.elements.length; i++) {\n      if (this._equals(this.elements[i], element)) {\n        index = i;\n        break;\n      }\n    }\n    if (index < 0) return false;\n    if (index === 0) {\n      this.poll();\n    } else if (index === this.elements.length - 1) {\n      this.elements.pop();\n    } else {\n      this.elements.splice(index, 1, this.elements.pop()!);\n      this._bubbleUp(index);\n      this._sinkDown(index, this.elements.length >> 1);\n    }\n    return true;\n  }\n\n  /**\n   * Delete the first element that matches a predicate.\n   * @remarks Time O(N), Space O(1)\n   * @param predicate - Function (element, index, heap) → boolean.\n   * @returns True if an element was removed.\n   */\n\n  deleteBy(predicate: (element: E, index: number, heap: this) => boolean): boolean {\n    let idx = -1;\n    for (let i = 0; i < this.elements.length; i++) {\n      if (predicate(this.elements[i], i, this)) {\n        idx = i;\n        break;\n      }\n    }\n    if (idx < 0) return false;\n    if (idx === 0) {\n      this.poll();\n    } else if (idx === this.elements.length - 1) {\n      this.elements.pop();\n    } else {\n      this.elements.splice(idx, 1, this.elements.pop()!);\n      this._bubbleUp(idx);\n      this._sinkDown(idx, this.elements.length >> 1);\n    }\n    return true;\n  }\n\n  /**\n   * Set the equality comparator used by has/delete operations.\n   * @remarks Time O(1), Space O(1)\n   * @param equals - Equality predicate (a, b) → boolean.\n   * @returns This heap.\n   */\n\n  setEquality(equals: (a: E, b: E) => boolean): this {\n    this._equals = equals;\n    return this;\n  }\n\n  /**\n   * Traverse the binary heap as a complete binary tree and collect elements.\n   * @remarks Time O(N), Space O(H)\n   * @param [order] - Traversal order: 'PRE' | 'IN' | 'POST'.\n   * @returns Array of visited elements.\n   \n   \n    * @example\n * // Depth-first traversal\n *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });\n *     const result = heap.dfs('IN');\n *     console.log(result.length); // 3;\n   */\n\n  dfs(order: DFSOrderPattern = 'PRE'): E[] {\n    const result: E[] = [];\n    const _dfs = (index: number) => {\n      const left = 2 * index + 1,\n        right = left + 1;\n      if (index < this.size) {\n        if (order === 'IN') {\n          _dfs(left);\n          result.push(this.elements[index]);\n          _dfs(right);\n        } else if (order === 'PRE') {\n          result.push(this.elements[index]);\n          _dfs(left);\n          _dfs(right);\n        } else if (order === 'POST') {\n          _dfs(left);\n          _dfs(right);\n          result.push(this.elements[index]);\n        }\n      }\n    };\n    _dfs(0);\n    return result;\n  }\n\n  /**\n   * Restore heap order bottom-up (heapify in-place).\n   * @remarks Time O(N), Space O(1)\n   * @returns Array of per-node results from fixing steps.\n   */\n\n  fix(): boolean[] {\n    const results: boolean[] = [];\n    for (let i = Math.floor(this.size / 2) - 1; i >= 0; i--) {\n      results.push(this._sinkDown(i, this.elements.length >> 1));\n    }\n    return results;\n  }\n\n  /**\n   * Return all elements in ascending order by repeatedly polling.\n   * @remarks Time O(N log N), Space O(N)\n   * @returns Sorted array of elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Sort elements using heap\n *  const heap = new Heap<number>([5, 1, 3, 2, 4]);\n *     const sorted = heap.sort();\n *     console.log(sorted); // [1, 2, 3, 4, 5];\n   */\n\n  sort(): E[] {\n    const visited: E[] = [];\n    const cloned = this._createInstance();\n    for (const x of this.elements) cloned.add(x);\n    while (!cloned.isEmpty()) {\n      const top = cloned.poll();\n      if (top !== undefined) visited.push(top);\n    }\n    return visited;\n  }\n\n  /**\n   * Deep clone this heap.\n   * @remarks Time O(N), Space O(N)\n   * @returns A new heap with the same elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Create independent copy\n *  const heap = new Heap<number>([3, 1, 4], { comparator: (a, b) => a - b });\n *     const copy = heap.clone();\n *     copy.poll();\n *     console.log(heap.size); // 3;\n *     console.log(copy.size); // 2;\n   */\n\n  clone(): this {\n    const next = this._createInstance();\n    for (const x of this.elements) next.add(x);\n    return next;\n  }\n\n  /**\n   * Filter elements into a new heap of the same class.\n   * @remarks Time O(N log N), Space O(N)\n   * @param callback - Predicate (element, index, heap) → boolean to keep element.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with the kept elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Filter elements\n *  const heap = new Heap<number>([1, 2, 3, 4, 5], { comparator: (a, b) => a - b });\n *     const evens = heap.filter(x => x % 2 === 0);\n *     console.log(evens.size); // 2;\n   */\n\n  filter(callback: ElementCallback<E, R, boolean>, thisArg?: unknown): this {\n    const out = this._createInstance();\n    let i = 0;\n    for (const x of this) {\n      if (thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this)) {\n        out.add(x);\n      } else {\n        i++;\n      }\n    }\n    return out;\n  }\n\n  /**\n   * Map elements into a new heap of possibly different element type.\n   * @remarks Time O(N log N), Space O(N)\n   * @template EM\n   * @template RM\n   * @param callback - Mapping function (element, index, heap) → newElement.\n   * @param options - Options for the output heap, including comparator for EM.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with mapped elements.\n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Transform elements\n *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });\n *     const doubled = heap.map(x => x * 2, { comparator: (a, b) => a - b });\n *     console.log(doubled.peek()); // 2;\n   */\n\n  map<EM, RM>(\n    callback: ElementCallback<E, R, EM>,\n    options: HeapOptions<EM, RM> & { comparator: Comparator<EM> },\n    thisArg?: unknown\n  ): Heap<EM, RM> {\n    const { comparator, toElementFn, ...rest } = options ?? {};\n    if (!comparator) throw new TypeError(ERR.comparatorRequired('Heap.map'));\n    const out = this._createLike<EM, RM>([], { ...rest, comparator, toElementFn });\n    let i = 0;\n    for (const x of this) {\n      const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);\n      out.add(v);\n    }\n    return out;\n  }\n\n  /**\n   * Map elements into a new heap of the same element type.\n   * @remarks Time O(N log N), Space O(N)\n   * @param callback - Mapping function (element, index, heap) → element.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with mapped elements.\n   */\n\n  mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this {\n    const out = this._createInstance();\n    let i = 0;\n    for (const x of this) {\n      const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);\n      out.add(v);\n    }\n    return out;\n  }\n\n  protected readonly _DEFAULT_COMPARATOR: Comparator<E> = (a: E, b: E): number => {\n    if (typeof a === 'object' || typeof b === 'object') {\n      throw new TypeError(ERR.comparatorRequired('Heap'));\n    }\n    if (a > b) return 1;\n    if (a < b) return -1;\n    return 0;\n  };\n\n  protected readonly _comparator: Comparator<E> = this._DEFAULT_COMPARATOR;\n\n  /**\n   * Get the comparator used to order elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns Comparator function.\n   */\n\n  get comparator() {\n    return this._comparator;\n  }\n\n  protected *_getIterator(): IterableIterator<E> {\n    for (const element of this.elements) yield element;\n  }\n\n  protected _bubbleUp(index: number): boolean {\n    const element = this.elements[index];\n    while (index > 0) {\n      const parent = (index - 1) >> 1;\n      const parentItem = this.elements[parent];\n      if (this.comparator(parentItem, element) <= 0) break;\n      this.elements[index] = parentItem;\n      index = parent;\n    }\n    this.elements[index] = element;\n    return true;\n  }\n\n  protected _sinkDown(index: number, halfLength: number): boolean {\n    const element = this.elements[index];\n    while (index < halfLength) {\n      let left = (index << 1) | 1;\n      const right = left + 1;\n      let minItem = this.elements[left];\n      if (right < this.elements.length && this.comparator(minItem, this.elements[right]) > 0) {\n        left = right;\n        minItem = this.elements[right];\n      }\n      if (this.comparator(minItem, element) >= 0) break;\n      this.elements[index] = minItem;\n      index = left;\n    }\n    this.elements[index] = element;\n    return true;\n  }\n\n  /**\n   * (Protected) Create an empty instance of the same concrete class.\n   * @remarks Time O(1), Space O(1)\n   * @param [options] - Options to override comparator or toElementFn.\n   * @returns A like-kind empty heap instance.\n   */\n\n  protected _createInstance(options?: HeapOptions<E, R>): this {\n    const Ctor = this.constructor as new (\n      elements?: Iterable<E> | Iterable<R>,\n      options?: HeapOptions<E, R>\n    ) => this;\n    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...(options ?? {}) });\n  }\n\n  /**\n   * (Protected) Create a like-kind instance seeded by elements.\n   * @remarks Time O(N log N), Space O(N)\n   * @template EM\n   * @template RM\n   * @param [elements] - Iterable of elements or raw values to seed.\n   * @param [options] - Options forwarded to the constructor.\n   * @returns A like-kind heap instance.\n   */\n\n  protected _createLike<EM, RM>(\n    elements: Iterable<EM> | Iterable<RM> = [],\n    options?: HeapOptions<EM, RM>\n  ): Heap<EM, RM> {\n    const Ctor = this.constructor as new (\n      elements?: Iterable<EM> | Iterable<RM>,\n      options?: HeapOptions<EM, RM>\n    ) => Heap<EM, RM>;\n    return new Ctor(elements, options);\n  }\n\n  /**\n   * (Protected) Spawn an empty like-kind heap instance.\n   * @remarks Time O(1), Space O(1)\n   * @template EM\n   * @template RM\n   * @param [options] - Options forwarded to the constructor.\n   * @returns An empty like-kind heap instance.\n   */\n\n  protected _spawnLike<EM, RM>(options?: HeapOptions<EM, RM>): Heap<EM, RM> {\n    return this._createLike<EM, RM>([], options);\n  }\n}\n\n/**\n * Node container used by FibonacciHeap.\n * @remarks Time O(1), Space O(1)\n * @template E\n */\nexport class FibonacciHeapNode<E> {\n  element: E;\n  degree: number;\n  left?: FibonacciHeapNode<E>;\n  right?: FibonacciHeapNode<E>;\n  child?: FibonacciHeapNode<E>;\n  parent?: FibonacciHeapNode<E>;\n  marked: boolean;\n\n  constructor(element: E, degree = 0) {\n    this.element = element;\n    this.degree = degree;\n    this.marked = false;\n  }\n}\n\n/**\n * Fibonacci heap (min-heap) optimized for fast merges and amortized operations.\n * @remarks Time O(1), Space O(1)\n * @template E\n * @example examples will be generated by unit test\n */\nexport class FibonacciHeap<E> {\n  /**\n   * Create a FibonacciHeap.\n   * @remarks Time O(1), Space O(1)\n   * @param [comparator] - Comparator to order elements (min-heap by default).\n   * @returns New FibonacciHeap instance.\n   */\n\n  constructor(comparator?: Comparator<E>) {\n    this.clear();\n    this._comparator = comparator || this._defaultComparator;\n    if (typeof this.comparator !== 'function') throw new TypeError(ERR.notAFunction('comparator', 'FibonacciHeap'));\n  }\n\n  protected _root?: FibonacciHeapNode<E>;\n\n  /**\n   * Get the circular root list head.\n   * @remarks Time O(1), Space O(1)\n   * @returns Root node or undefined.\n   */\n\n  get root(): FibonacciHeapNode<E> | undefined {\n    return this._root;\n  }\n\n  protected _size = 0;\n  get size(): number {\n    return this._size;\n  }\n\n  protected _min?: FibonacciHeapNode<E>;\n\n  /**\n   * Get the current minimum node.\n   * @remarks Time O(1), Space O(1)\n   * @returns Min node or undefined.\n   */\n\n  get min(): FibonacciHeapNode<E> | undefined {\n    return this._min;\n  }\n\n  protected readonly _comparator: Comparator<E>;\n\n  get comparator(): Comparator<E> {\n    return this._comparator;\n  }\n\n  clear(): void {\n    this._root = undefined;\n    this._min = undefined;\n    this._size = 0;\n  }\n\n  add(element: E): boolean {\n    this.push(element);\n    return true;\n  }\n\n  /**\n   * Push an element into the root list.\n   * @remarks Time O(1) amortized, Space O(1)\n   * @param element - Element to insert.\n   * @returns This heap.\n   */\n\n  push(element: E): this {\n    const node = this.createNode(element);\n    node.left = node;\n    node.right = node;\n    this.mergeWithRoot(node);\n    if (!this.min || this.comparator(node.element, this.min.element) <= 0) this._min = node;\n    this._size++;\n    return this;\n  }\n\n  peek(): E | undefined {\n    return this.min ? this.min.element : undefined;\n  }\n\n  /**\n   * Collect nodes from a circular doubly linked list starting at head.\n   * @remarks Time O(K), Space O(K)\n   * @param [head] - Start node of the circular list.\n   * @returns Array of nodes from the list.\n   */\n\n  consumeLinkedList(head?: FibonacciHeapNode<E>): FibonacciHeapNode<E>[] {\n    const elements: FibonacciHeapNode<E>[] = [];\n    if (!head) return elements;\n    let node: FibonacciHeapNode<E> | undefined = head;\n    let started = false;\n    while (true) {\n      if (node === head && started) break;\n      else if (node === head) started = true;\n      elements.push(node!);\n      node = node!.right;\n    }\n    return elements;\n  }\n\n  /**\n   * Insert a node into a parent's child list (circular).\n   * @remarks Time O(1), Space O(1)\n   * @param parent - Parent node.\n   * @param node - Child node to insert.\n   * @returns void\n   */\n\n  mergeWithChild(parent: FibonacciHeapNode<E>, node: FibonacciHeapNode<E>): void {\n    if (!parent.child) parent.child = node;\n    else {\n      node.right = parent.child.right;\n      node.left = parent.child;\n      parent.child.right!.left = node;\n      parent.child.right = node;\n    }\n  }\n\n  poll(): E | undefined {\n    return this.pop();\n  }\n\n  /**\n   * Remove and return the minimum element, consolidating the root list.\n   * @remarks Time O(log N) amortized, Space O(1)\n   * @returns Minimum element or undefined.\n   */\n\n  pop(): E | undefined {\n    if (this._size === 0) return undefined;\n    const z = this.min!;\n    if (z.child) {\n      const elements = this.consumeLinkedList(z.child);\n      for (const node of elements) {\n        this.mergeWithRoot(node);\n        node.parent = undefined;\n      }\n    }\n    this.removeFromRoot(z);\n    if (z === z.right) {\n      this._min = undefined;\n      this._root = undefined;\n    } else {\n      this._min = z.right;\n      this._consolidate();\n    }\n    this._size--;\n    return z.element;\n  }\n\n  /**\n   * Meld another heap into this heap.\n   * @remarks Time O(1), Space O(1)\n   * @param heapToMerge - Another FibonacciHeap to meld into this one.\n   * @returns void\n   */\n\n  merge(heapToMerge: FibonacciHeap<E>): void {\n    if (heapToMerge.size === 0) return;\n    if (this.root && heapToMerge.root) {\n      const thisRoot = this.root,\n        otherRoot = heapToMerge.root;\n      const thisRootRight = thisRoot.right!,\n        otherRootLeft = otherRoot.left!;\n      thisRoot.right = otherRoot;\n      otherRoot.left = thisRoot;\n      thisRootRight.left = otherRootLeft;\n      otherRootLeft.right = thisRootRight;\n    } else if (!this.root && heapToMerge.root) {\n      this._root = heapToMerge.root;\n    }\n    if (!this.min || (heapToMerge.min && this.comparator(heapToMerge.min.element, this.min.element) < 0)) {\n      this._min = heapToMerge.min;\n    }\n    this._size += heapToMerge.size;\n    heapToMerge.clear();\n  }\n\n  createNode(element: E): FibonacciHeapNode<E> {\n    return new FibonacciHeapNode<E>(element);\n  }\n\n  isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  protected _defaultComparator(a: E, b: E): number {\n    if (a < b) return -1;\n    if (a > b) return 1;\n    return 0;\n  }\n\n  protected mergeWithRoot(node: FibonacciHeapNode<E>): void {\n    if (!this.root) this._root = node;\n    else {\n      node.right = this.root.right;\n      node.left = this.root;\n      this.root.right!.left = node;\n      this.root.right = node;\n    }\n  }\n\n  protected removeFromRoot(node: FibonacciHeapNode<E>): void {\n    if (this.root === node) this._root = node.right;\n    if (node.left) node.left.right = node.right;\n    if (node.right) node.right.left = node.left;\n  }\n\n  protected _link(y: FibonacciHeapNode<E>, x: FibonacciHeapNode<E>): void {\n    this.removeFromRoot(y);\n    y.left = y;\n    y.right = y;\n    this.mergeWithChild(x, y);\n    x.degree++;\n    y.parent = x;\n  }\n\n  protected _consolidate(): void {\n    const A: (FibonacciHeapNode<E> | undefined)[] = new Array(this._size);\n    const elements = this.consumeLinkedList(this.root);\n    let x: FibonacciHeapNode<E> | undefined,\n      y: FibonacciHeapNode<E> | undefined,\n      d: number,\n      t: FibonacciHeapNode<E> | undefined;\n\n    for (const node of elements) {\n      x = node;\n      d = x.degree;\n      while (A[d]) {\n        y = A[d] as FibonacciHeapNode<E>;\n        if (this.comparator(x.element, y.element) > 0) {\n          t = x;\n          x = y;\n          y = t;\n        }\n        this._link(y, x);\n        A[d] = undefined;\n        d++;\n      }\n      A[d] = x;\n    }\n\n    for (let i = 0; i < A.length; i++) {\n      if (A[i] && (!this.min || this.comparator(A[i]!.element, this.min.element) <= 0)) this._min = A[i]!;\n    }\n  }\n}\n","/**\n * data-structure-typed\n *\n * @author Kirk Qi\n * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>\n * @license MIT License\n */\n\nimport type { PriorityQueueOptions } from '../../types';\nimport { Heap } from '../heap';\n\n/**\n * @example\n * // Hospital emergency room triage\n *  interface Patient {\n *       name: string;\n *       severity: number; // 1 = critical, 5 = minor\n *     }\n *\n *     const er = new PriorityQueue<Patient>([], {\n *       comparator: (a, b) => a.severity - b.severity\n *     });\n *\n *     er.add({ name: 'Flu symptoms', severity: 4 });\n *     er.add({ name: 'Heart attack', severity: 1 });\n *     er.add({ name: 'Broken arm', severity: 3 });\n *     er.add({ name: 'Stroke', severity: 1 });\n *\n *     // Most critical patients first\n *     console.log(er.poll()?.severity); // 1;\n *     console.log(er.poll()?.severity); // 1;\n *     console.log(er.poll()?.severity); // 3;\n *     console.log(er.poll()?.severity); // 4;\n * @example\n * // Task scheduler with deadlines\n *  interface Task {\n *       name: string;\n *       deadline: number; // hours until due\n *     }\n *\n *     const scheduler = new PriorityQueue<Task>([], {\n *       comparator: (a, b) => a.deadline - b.deadline\n *     });\n *\n *     scheduler.add({ name: 'Report', deadline: 24 });\n *     scheduler.add({ name: 'Email', deadline: 2 });\n *     scheduler.add({ name: 'Meeting prep', deadline: 4 });\n *     scheduler.add({ name: 'Code review', deadline: 8 });\n *\n *     // Process most urgent first\n *     console.log(scheduler.peek()?.name); // 'Email';\n *     console.log(scheduler.size); // 4;\n *\n *     const order = [];\n *     while (scheduler.size > 0) {\n *       order.push(scheduler.poll()!.name);\n *     }\n *     console.log(order); // ['Email', 'Meeting prep', 'Code review', 'Report'];\n * @example\n * // Bandwidth allocation with priorities\n *  const bandwidth = new PriorityQueue<[number, string]>([], {\n *       comparator: (a, b) => a[0] - b[0]\n *     });\n *\n *     bandwidth.add([1, 'Video call']);     // highest priority\n *     bandwidth.add([3, 'File download']);\n *     bandwidth.add([2, 'Web browsing']);\n *     bandwidth.add([1, 'Voice call']);\n *\n *     // Allocate bandwidth to highest priority first\n *     console.log(bandwidth.poll()?.[1]); // 'Video call';\n *     console.log(bandwidth.poll()?.[1]); // 'Voice call';\n *     console.log(bandwidth.size); // 2;\n */\nexport class PriorityQueue<E = any, R = any> extends Heap<E, R> {\n  constructor(elements: Iterable<E> | Iterable<R> = [], options?: PriorityQueueOptions<E, R>) {\n    super(elements, options);\n  }\n}\n","/**\n * data-structure-typed\n *\n * @author Kirk Qi\n * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>\n * @license MIT License\n */\nimport type { PriorityQueueOptions } from '../../types';\nimport { PriorityQueue } from './priority-queue';\nimport { ERR } from '../../common';\n\n/**\n * Max-oriented priority queue (max-heap) built on {@link PriorityQueue}.\n * The default comparator orders primitive values in descending order. If you store objects,\n * you must provide a custom comparator via {@link PriorityQueueOptions}.\n * @template E Element type stored in the queue.\n * @template R Extra record/metadata associated with each element.\n * @example\n * // Job scheduling by priority\n *  const jobs = new MaxPriorityQueue<number>();\n *\n *     jobs.add(3); // low priority\n *     jobs.add(7); // high priority\n *     jobs.add(5); // medium priority\n *     jobs.add(10); // critical\n *\n *     // Highest priority job first\n *     console.log(jobs.poll()); // 10;\n *     console.log(jobs.poll()); // 7;\n *     console.log(jobs.poll()); // 5;\n *     console.log(jobs.poll()); // 3;\n * @example\n * // Auction system with highest bid tracking\n *  interface Bid {\n *       bidder: string;\n *       amount: number;\n *     }\n *\n *     const auction = new MaxPriorityQueue<Bid>([], {\n *       comparator: (a, b) => b.amount - a.amount\n *     });\n *\n *     auction.add({ bidder: 'Alice', amount: 100 });\n *     auction.add({ bidder: 'Bob', amount: 250 });\n *     auction.add({ bidder: 'Charlie', amount: 175 });\n *\n *     // Current highest bid\n *     console.log(auction.peek()?.bidder); // 'Bob';\n *     console.log(auction.peek()?.amount); // 250;\n *\n *     // Process winning bid\n *     const winner = auction.poll()!;\n *     console.log(winner.bidder); // 'Bob';\n *     console.log(auction.peek()?.bidder); // 'Charlie';\n * @example\n * // CPU process scheduling\n *  const cpuQueue = new MaxPriorityQueue<[number, string]>([], {\n *       comparator: (a, b) => b[0] - a[0]\n *     });\n *\n *     cpuQueue.add([5, 'System process']);\n *     cpuQueue.add([1, 'Background task']);\n *     cpuQueue.add([8, 'User interaction']);\n *     cpuQueue.add([3, 'Network sync']);\n *\n *     const order = [];\n *     while (cpuQueue.size > 0) {\n *       order.push(cpuQueue.poll()![1]);\n *     }\n *     console.log(order); // [\n *  //      'User interaction',\n *  //      'System process',\n *  //      'Network sync',\n *  //      'Background task'\n *  //    ];\n */\nexport class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {\n  /**\n   * Creates a max-priority queue.\n   * @param elements Optional initial elements to insert.\n   * @param options Optional configuration (e.g., `comparator`, `toElementFn`).\n   * @throws {TypeError} Thrown when using the default comparator with object elements (provide a custom comparator).\n   * @remarks Complexity — Time: O(n log n) when inserting n elements incrementally; Space: O(n).\n   */\n  constructor(elements: Iterable<E> | Iterable<R> = [], options?: PriorityQueueOptions<E, R>) {\n    super(elements, {\n      comparator: (a: E, b: E): number => {\n        if (typeof a === 'object' || typeof b === 'object') {\n          throw new TypeError(ERR.comparatorRequired('MaxPriorityQueue'));\n        }\n        if (a < b) return 1;\n        if (a > b) return -1;\n        return 0;\n      },\n      ...options\n    });\n  }\n}\n"]}
+{"version":3,"sources":["../../src/common/error.ts","../../src/common/index.ts","../../src/data-structures/base/iterable-element-base.ts","../../src/data-structures/heap/heap.ts","../../src/data-structures/priority-queue/priority-queue.ts","../../src/data-structures/priority-queue/max-priority-queue.ts"],"names":["DFSOperation"],"mappings":";;;;;;AAOO,SAAS,KAAA,CACd,YACA,OAAA,EACO;AACP,EAAA,MAAM,IAAI,WAAW,OAAO,CAAA;AAC9B;AALgB,MAAA,CAAA,KAAA,EAAA,OAAA,CAAA;AAWT,IAAM,GAAA,GAAM;AAAA;AAAA,EAEjB,iCAAiB,MAAA,CAAA,CAAC,KAAA,EAAe,GAAA,EAAa,GAAA,EAAa,QACzD,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,MAAA,EAAS,KAAK,qBAAqB,GAAG,CAAA,EAAA,EAAK,GAAG,CAAA,EAAA,CAAA,EADvD,iBAAA,CAAA;AAAA,EAGjB,YAAA,0BAAe,GAAA,KACb,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,yBAAA,CAAA,EADZ,cAAA,CAAA;AAAA;AAAA,EAId,eAAA,kBAAiB,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KAChC,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADlB,iBAAA,CAAA;AAAA,EAGjB,kBAAA,0BAAqB,GAAA,KACnB,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,+DAAA,CAAA,EADN,oBAAA,CAAA;AAAA,EAGpB,UAAA,kBAAY,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KAC3B,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADvB,YAAA,CAAA;AAAA,EAGZ,YAAA,kBAAc,MAAA,CAAA,CAAC,IAAA,EAAc,GAAA,KAC3B,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,IAAI,CAAA,oBAAA,CAAA,EADnB,cAAA,CAAA;AAAA,EAGd,YAAA,0BAAe,GAAA,KACb,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,wCAAA,CAAA,EADZ,cAAA,CAAA;AAAA,EAGd,UAAA,0BAAa,GAAA,KACX,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,uBAAA,CAAA,EADd,YAAA,CAAA;AAAA,EAGZ,WAAA,0BAAc,GAAA,KACZ,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,iBAAA,CAAA,EADb,aAAA,CAAA;AAAA,EAGb,WAAA,0BAAc,GAAA,KACZ,CAAA,EAAG,MAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,gDAAA,CAAA,EADb,aAAA,CAAA;AAAA,EAGb,kBAAA,kBAAoB,MAAA,CAAA,CAAC,QAAA,EAAkB,GAAA,EAAa,QAClD,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,qBAAA,EAAwB,QAAQ,CAAA,MAAA,EAAS,GAAG,CAAA,CAAA,CAAA,EADlD,oBAAA,CAAA;AAAA;AAAA,EAIpB,gBAAA,kBAAkB,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KACjC,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,CAAA,EADjB,kBAAA,CAAA;AAAA;AAAA,EAIlB,uBAAA,kBAAyB,MAAA,CAAA,CAAC,EAAA,KACxB,CAAA,0CAAA,EAA6C,EAAE,CAAA,CAAA,CAAA,EADxB,yBAAA,CAAA;AAAA,EAGzB,cAAA,+BACE,kDAAA,EADc,gBAAA,CAAA;AAAA,EAGhB,eAAA,+BACE,uCAAA,EADe,iBAAA,CAAA;AAAA,EAGjB,oBAAA,+BACE,gDAAA,EADoB,sBAAA,CAAA;AAAA,EAGtB,iBAAA,0BAAoB,QAAA,EAAkB,GAAA,KACpC,+BAA+B,QAAQ,CAAA,UAAA,EAAa,GAAG,CAAA,CAAA,CAAA,EADtC,mBAAA,CAAA;AAAA;AAAA,EAInB,wBAAA,kBAA0B,MAAA,CAAA,CAAC,MAAA,EAAgB,GAAA,KACzC,CAAA,EAAG,GAAA,GAAM,GAAA,GAAM,IAAA,GAAO,EAAE,CAAA,EAAG,MAAM,CAAA,uCAAA,CAAA,EADT,0BAAA;AAE5B;;;AC3EO,IAAK,YAAA,qBAAAA,aAAAA,KAAL;AACL,EAAAA,aAAAA,CAAAA,aAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AACA,EAAAA,aAAAA,CAAAA,aAAAA,CAAA,aAAU,CAAA,CAAA,GAAV,SAAA;AAFU,EAAA,OAAAA,aAAAA;AAAA,CAAA,EAAA,YAAA,IAAA,EAAA;AAKL,IAAM,MAAA,GAAN,MAAM,MAAA,CAAS;AAAA,EACpB,YACS,GAAA,EACA,IAAA,EACA,UAAA,GAAsB,IAAA,EACtB,cAAuB,IAAA,EAC9B;AAJO,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AACA,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AACA,IAAA,IAAA,CAAA,UAAA,GAAA,UAAA;AACA,IAAA,IAAA,CAAA,WAAA,GAAA,WAAA;AAAA,EAIT;AAAA;AAAA,EAGA,SAAA,CAAU,KAAQ,UAAA,EAA6C;AAC7D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,GAAa,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA,IAAK,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,GAAG,CAAA,GAAI,CAAA;AAChG,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,WAAA,GAAc,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA,IAAK,CAAA,GAAI,UAAA,CAAW,GAAA,EAAK,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA;AACpG,IAAA,OAAO,QAAA,IAAY,SAAA;AAAA,EACrB;AACF,CAAA;AAjBsB,MAAA,CAAA,MAAA,EAAA,OAAA,CAAA;AAAf,IAAM,KAAA,GAAN;;;ACOA,IAAe,oBAAA,GAAf,MAAe,oBAAA,CAAiD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAU3D,YAAY,OAAA,EAA4C;AAclE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,aAAA,CAAA,IAAA,EAAU,cAAA,CAAA;AAbR,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,MAAM,EAAE,aAAY,GAAI,OAAA;AACxB,MAAA,IAAI,OAAO,WAAA,KAAgB,UAAA,EAAY,IAAA,CAAK,YAAA,GAAe,WAAA;AAAA,WAAA,IAClD,WAAA,EAAa,KAAA,CAAM,SAAA,EAAW,qCAAqC,CAAA;AAAA,IAC9E;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,IAAI,WAAA,GAAkD;AACpD,IAAA,OAAO,IAAA,CAAK,YAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,EAAE,MAAA,CAAO,QAAQ,CAAA,CAAA,GAAK,IAAA,EAAsC;AAC1D,IAAA,OAAO,IAAA,CAAK,YAAA,CAAa,GAAG,IAAI,CAAA;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,CAAC,MAAA,GAA8B;AAC7B,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,MAAM,IAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,KAAA,CAAM,WAA2C,OAAA,EAA4B;AAC3E,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,CAAC,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,KAAA;AAAA,MAC9C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,CAAC,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,KAAA;AAAA,MACrD;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,IAAA,CAAK,WAA2C,OAAA,EAA4B;AAC1E,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MAC7C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAA,CAAQ,YAAyC,OAAA,EAAyB;AACxE,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,UAAA,CAAW,IAAA,EAAM,SAAS,IAAI,CAAA;AAAA,MAChC,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,UAAA;AACX,QAAA,EAAA,CAAG,IAAA,CAAK,OAAA,EAAS,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,CAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAwBA,IAAA,CAAK,WAA2C,OAAA,EAAkC;AAChF,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,IAAI,SAAA,CAAU,IAAA,EAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MAC7C,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,SAAA;AACX,QAAA,IAAI,GAAG,IAAA,CAAK,OAAA,EAAS,MAAM,KAAA,EAAA,EAAS,IAAI,GAAG,OAAO,IAAA;AAAA,MACpD;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAI,OAAA,EAAqB;AACvB,IAAA,KAAA,MAAW,GAAA,IAAO,IAAA,EAAM,IAAI,GAAA,KAAQ,SAAS,OAAO,IAAA;AACpD,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BA,MAAA,CAAU,YAA4C,YAAA,EAAqB;AACzE,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,QAAQ,CAAA,EAAE;AACnC,IAAA,IAAI,GAAA;AAEJ,IAAA,IAAI,SAAA,CAAU,UAAU,CAAA,EAAG;AACzB,MAAA,GAAA,GAAM,YAAA;AAAA,IACR,CAAA,MAAO;AACL,MAAA,MAAM,KAAA,GAAQ,KAAK,IAAA,EAAK;AACxB,MAAA,IAAI,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,SAAA,EAAW,iDAAiD,CAAA;AAClF,MAAA,GAAA,GAAM,KAAA,CAAM,KAAA;AACZ,MAAA,KAAA,GAAQ,CAAA;AAAA,IACV;AAEA,IAAA,KAAA,MAAW,SAAS,IAAA,EAAgC;AAClD,MAAA,GAAA,GAAM,UAAA,CAAW,GAAA,EAAK,KAAA,EAAO,KAAA,EAAA,EAAS,IAAI,CAAA;AAAA,IAC5C;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAA,GAAe;AACb,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAA,GAAgB;AACd,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,KAAA,GAAc;AACZ,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,CAAA;AAAA,EAC7B;AAkFF,CAAA;AAlVuE,MAAA,CAAA,oBAAA,EAAA,qBAAA,CAAA;AAAhE,IAAe,mBAAA,GAAf,oBAAA;;;ACuIA,IAAM,KAAA,GAAN,MAAM,KAAA,SAA+B,mBAAA,CAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWpE,WAAA,CAAY,QAAA,GAA4B,EAAC,EAAG,OAAA,EAA6B;AACvE,IAAA,KAAA,CAAM,OAAO,CAAA;AAXf,IAAA,aAAA,CAAA,IAAA,EAAU,WAAmC,MAAA,CAAO,EAAA,CAAA;AAqBpD,IAAA,aAAA,CAAA,IAAA,EAAU,aAAiB,EAAC,CAAA;AAm+B5B,IAAA,aAAA,CAAA,IAAA,EAAmB,qBAAA,kBAAqC,MAAA,CAAA,CAAC,CAAA,EAAM,CAAA,KAAiB;AAC9E,MAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AAClD,QAAA,KAAA,CAAM,SAAA,EAAW,GAAA,CAAI,kBAAA,CAAmB,MAAM,CAAC,CAAA;AAAA,MACjD;AACA,MAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,MAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,MAAA,OAAO,CAAA;AAAA,IACT,CAAA,EAPwD,qBAAA,CAAA,CAAA;AASxD,IAAA,aAAA,CAAA,IAAA,EAAmB,eAA6B,IAAA,CAAK,mBAAA,CAAA;AAp/BnD,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,MAAM,EAAE,YAAW,GAAI,OAAA;AACvB,MAAA,IAAI,UAAA,OAAiB,WAAA,GAAc,UAAA;AAAA,IACrC;AAEA,IAAA,IAAA,CAAK,QAAQ,QAA2B,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,QAAA,GAAgB;AAClB,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoDA,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,KAAK,QAAA,CAAS,MAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,IAAA,GAAsB;AAnP5B,IAAA,IAAA,EAAA;AAoPI,IAAA,OAAA,CAAO,UAAK,QAAA,CAAS,IAAA,CAAK,IAAA,GAAO,CAAC,MAA3B,IAAA,GAAA,EAAA,GAAgC,MAAA;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,OAAO,IAAA,CAEL,QAAA,EACA,OAAA,EACG;AACH,IAAA,OAAO,IAAI,IAAA,CAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAO,OAAA,CAA4B,QAAA,EAAwB,OAAA,EAA4C;AACrG,IAAA,OAAO,IAAI,KAAA,CAAa,QAAA,EAAU,OAAO,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2DA,IAAI,OAAA,EAAqB;AACvB,IAAA,IAAA,CAAK,SAAA,CAAU,KAAK,OAAO,CAAA;AAC3B,IAAA,OAAO,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA+CA,QAAQ,QAAA,EAAsC;AAC5C,IAAA,MAAM,QAAmB,EAAC;AAC1B,IAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,MAAA,IAAI,KAAK,WAAA,EAAa;AACpB,QAAA,MAAM,KAAK,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,WAAA,CAAY,EAAO,CAAC,CAAA;AAC7C,QAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,MACf,CAAA,MAAO;AACL,QAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,EAAO,CAAA;AAC3B,QAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAAA,MACf;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoEA,IAAA,GAAsB;AACpB,IAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAChC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,EAAI;AAC/B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,MAAA,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,GAAI,IAAA;AACnB,MAAA,IAAA,CAAK,SAAA,CAAU,CAAA,EAAG,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsGA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,SAAS,CAAC,CAAA;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA+CA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,IAAA,KAAS,CAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8CA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,YAAY,EAAC;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAAA,EAAkC;AACvC,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA;AACpC,IAAA,OAAO,KAAK,GAAA,EAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwCS,IAAI,OAAA,EAAqB;AAChC,IAAA,KAAA,MAAW,EAAA,IAAM,KAAK,QAAA,EAAU,IAAI,KAAK,OAAA,CAAQ,EAAA,EAAI,OAAO,CAAA,EAAG,OAAO,IAAA;AACtE,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8CA,OAAO,OAAA,EAAqB;AAC1B,IAAA,IAAI,KAAA,GAAQ,EAAA;AACZ,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,IAAI,KAAK,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAC,CAAA,EAAG,OAAO,CAAA,EAAG;AAC3C,QAAA,KAAA,GAAQ,CAAA;AACR,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,KAAA,GAAQ,GAAG,OAAO,KAAA;AACtB,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAA,MAAA,IAAW,KAAA,KAAU,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AAC7C,MAAA,IAAA,CAAK,SAAS,GAAA,EAAI;AAAA,IACpB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,SAAS,MAAA,CAAO,KAAA,EAAO,GAAG,IAAA,CAAK,QAAA,CAAS,KAAM,CAAA;AACnD,MAAA,IAAA,CAAK,UAAU,KAAK,CAAA;AACpB,MAAA,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,SAAA,EAAwE;AAC/E,IAAA,IAAI,GAAA,GAAM,EAAA;AACV,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,IAAI,UAAU,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA,EAAG;AACxC,QAAA,GAAA,GAAM,CAAA;AACN,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,GAAA,GAAM,GAAG,OAAO,KAAA;AACpB,IAAA,IAAI,QAAQ,CAAA,EAAG;AACb,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAA,MAAA,IAAW,GAAA,KAAQ,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA,EAAG;AAC3C,MAAA,IAAA,CAAK,SAAS,GAAA,EAAI;AAAA,IACpB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,SAAS,MAAA,CAAO,GAAA,EAAK,GAAG,IAAA,CAAK,QAAA,CAAS,KAAM,CAAA;AACjD,MAAA,IAAA,CAAK,UAAU,GAAG,CAAA;AAClB,MAAA,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,IAAA,CAAK,QAAA,CAAS,UAAU,CAAC,CAAA;AAAA,IAC/C;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,MAAA,EAAuC;AACjD,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AACf,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwCA,GAAA,CAAI,QAAyB,KAAA,EAAY;AACvC,IAAA,MAAM,SAAc,EAAC;AACrB,IAAA,MAAM,IAAA,2BAAQ,KAAA,KAAkB;AAC9B,MAAA,MAAM,IAAA,GAAO,CAAA,GAAI,KAAA,GAAQ,CAAA,EACvB,QAAQ,IAAA,GAAO,CAAA;AACjB,MAAA,IAAI,KAAA,GAAQ,KAAK,IAAA,EAAM;AACrB,QAAA,IAAI,UAAU,IAAA,EAAM;AAClB,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAChC,UAAA,IAAA,CAAK,KAAK,CAAA;AAAA,QACZ,CAAA,MAAA,IAAW,UAAU,KAAA,EAAO;AAC1B,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAChC,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,IAAA,CAAK,KAAK,CAAA;AAAA,QACZ,CAAA,MAAA,IAAW,UAAU,MAAA,EAAQ;AAC3B,UAAA,IAAA,CAAK,IAAI,CAAA;AACT,UAAA,IAAA,CAAK,KAAK,CAAA;AACV,UAAA,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA;AAAA,QAClC;AAAA,MACF;AAAA,IACF,CAAA,EAlBa,MAAA,CAAA;AAmBb,IAAA,IAAA,CAAK,CAAC,CAAA;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,GAAiB;AACf,IAAA,MAAM,UAAqB,EAAC;AAC5B,IAAA,KAAA,IAAS,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,IAAA,GAAO,CAAC,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AACvD,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,SAAA,CAAU,CAAA,EAAG,KAAK,QAAA,CAAS,MAAA,IAAU,CAAC,CAAC,CAAA;AAAA,IAC3D;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgDA,IAAA,GAAY;AACV,IAAA,MAAM,UAAe,EAAC;AACtB,IAAA,MAAM,MAAA,GAAS,KAAK,eAAA,EAAgB;AACpC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,MAAA,CAAO,IAAI,CAAC,CAAA;AAC3C,IAAA,OAAO,CAAC,MAAA,CAAO,OAAA,EAAQ,EAAG;AACxB,MAAA,MAAM,GAAA,GAAM,OAAO,IAAA,EAAK;AACxB,MAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA;AAAA,IACzC;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgDA,KAAA,GAAc;AACZ,IAAA,MAAM,IAAA,GAAO,KAAK,eAAA,EAAgB;AAClC,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,EAAU,IAAA,CAAK,IAAI,CAAC,CAAA;AACzC,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgDA,MAAA,CAAO,UAA0C,OAAA,EAAyB;AACxE,IAAA,MAAM,GAAA,GAAM,KAAK,eAAA,EAAgB;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,EAAG;AACzF,QAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,MACX,CAAA,MAAO;AACL,QAAA,CAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkDA,GAAA,CACE,QAAA,EACA,OAAA,EACA,OAAA,EACc;AACd,IAAA,MAAM,EAAE,UAAA,EAAY,WAAA,EAAa,GAAG,IAAA,EAAK,GAAI,4BAAW,EAAC;AACzD,IAAA,IAAI,CAAC,UAAA,EAAY,KAAA,CAAM,WAAW,GAAA,CAAI,kBAAA,CAAmB,UAAU,CAAC,CAAA;AACpE,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,WAAA,CAAoB,EAAC,EAAG,EAAE,GAAG,IAAA,EAAM,UAAA,EAAY,WAAA,EAAa,CAAA;AAC7E,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,KAAK,IAAI,CAAA;AAC9F,MAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IACX;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAA,CAAQ,UAAoC,OAAA,EAAyB;AACnE,IAAA,MAAM,GAAA,GAAM,KAAK,eAAA,EAAgB;AACjC,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,OAAA,KAAY,MAAA,GAAY,QAAA,CAAS,CAAA,EAAG,CAAA,EAAA,EAAK,IAAI,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,KAAK,IAAI,CAAA;AAC9F,MAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IACX;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,IAAI,UAAA,GAAa;AACf,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA,EAEA,CAAW,YAAA,GAAoC;AAC7C,IAAA,KAAA,MAAW,OAAA,IAAW,IAAA,CAAK,QAAA,EAAU,MAAM,OAAA;AAAA,EAC7C;AAAA,EAEU,UAAU,KAAA,EAAwB;AAC1C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA;AACnC,IAAA,OAAO,QAAQ,CAAA,EAAG;AAChB,MAAA,MAAM,MAAA,GAAU,QAAQ,CAAA,IAAM,CAAA;AAC9B,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AACvC,MAAA,IAAI,IAAA,CAAK,UAAA,CAAW,UAAA,EAAY,OAAO,KAAK,CAAA,EAAG;AAC/C,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,UAAA;AACvB,MAAA,KAAA,GAAQ,MAAA;AAAA,IACV;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEU,SAAA,CAAU,OAAe,UAAA,EAA6B;AAC9D,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA;AACnC,IAAA,OAAO,QAAQ,UAAA,EAAY;AACzB,MAAA,IAAI,IAAA,GAAQ,SAAS,CAAA,GAAK,CAAA;AAC1B,MAAA,MAAM,QAAQ,IAAA,GAAO,CAAA;AACrB,MAAA,IAAI,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA;AAChC,MAAA,IAAI,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,MAAA,IAAU,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,IAAA,CAAK,QAAA,CAAS,KAAK,CAAC,CAAA,GAAI,CAAA,EAAG;AACtF,QAAA,IAAA,GAAO,KAAA;AACP,QAAA,OAAA,GAAU,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,MAC/B;AACA,MAAA,IAAI,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,OAAO,KAAK,CAAA,EAAG;AAC5C,MAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,MAAA,KAAA,GAAQ,IAAA;AAAA,IACV;AACA,IAAA,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,GAAI,OAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASU,gBAAgB,OAAA,EAAmC;AAC3D,IAAA,MAAM,OAAO,IAAA,CAAK,WAAA;AAIlB,IAAA,OAAO,IAAI,IAAA,CAAK,EAAC,EAAG,EAAE,UAAA,EAAY,IAAA,CAAK,UAAA,EAAY,WAAA,EAAa,KAAK,WAAA,EAAa,GAAI,OAAA,IAAA,IAAA,GAAA,OAAA,GAAW,IAAK,CAAA;AAAA,EACxG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYU,WAAA,CACR,QAAA,GAAwC,EAAC,EACzC,OAAA,EACc;AACd,IAAA,MAAM,OAAO,IAAA,CAAK,WAAA;AAIlB,IAAA,OAAO,IAAI,IAAA,CAAK,QAAA,EAAU,OAAO,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWU,WAAmB,OAAA,EAA6C;AACxE,IAAA,OAAO,IAAA,CAAK,WAAA,CAAoB,EAAC,EAAG,OAAO,CAAA;AAAA,EAC7C;AACF,CAAA;AAjmCsE,MAAA,CAAA,KAAA,EAAA,MAAA,CAAA;AAA/D,IAAM,IAAA,GAAN;AAwmCA,IAAM,kBAAA,GAAN,MAAM,kBAAA,CAAqB;AAAA,EAShC,WAAA,CAAY,OAAA,EAAY,MAAA,GAAS,CAAA,EAAG;AARpC,IAAA,aAAA,CAAA,IAAA,EAAA,SAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,MAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AACA,IAAA,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA;AAGE,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AAAA,EAChB;AACF,CAAA;AAdkC,MAAA,CAAA,kBAAA,EAAA,mBAAA,CAAA;AAA3B,IAAM,iBAAA,GAAN;AAsBA,IAAM,cAAA,GAAN,MAAM,cAAA,CAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ5B,YAAY,UAAA,EAA4B;AAMxC,IAAA,aAAA,CAAA,IAAA,EAAU,OAAA,CAAA;AAYV,IAAA,aAAA,CAAA,IAAA,EAAU,OAAA,EAAQ,CAAA,CAAA;AAKlB,IAAA,aAAA,CAAA,IAAA,EAAU,MAAA,CAAA;AAYV,IAAA,aAAA,CAAA,IAAA,EAAmB,aAAA,CAAA;AAlCjB,IAAA,IAAA,CAAK,KAAA,EAAM;AACX,IAAA,IAAA,CAAK,WAAA,GAAc,cAAc,IAAA,CAAK,kBAAA;AACtC,IAAA,IAAI,OAAO,IAAA,CAAK,UAAA,KAAe,UAAA,EAAY,KAAA,CAAM,WAAW,GAAA,CAAI,YAAA,CAAa,YAAA,EAAc,eAAe,CAAC,CAAA;AAAA,EAC7G;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,IAAA,GAAyC;AAC3C,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAGA,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,GAAA,GAAwC;AAC1C,IAAA,OAAO,IAAA,CAAK,IAAA;AAAA,EACd;AAAA,EAIA,IAAI,UAAA,GAA4B;AAC9B,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACd;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,MAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,MAAA;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AAAA,EACf;AAAA,EAEA,IAAI,OAAA,EAAqB;AACvB,IAAA,IAAA,CAAK,KAAK,OAAO,CAAA;AACjB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,KAAK,OAAA,EAAkB;AACrB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,cAAc,IAAI,CAAA;AACvB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,IAAK,CAAA,OAAQ,IAAA,GAAO,IAAA;AACnF,IAAA,IAAA,CAAK,KAAA,EAAA;AACL,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,IAAA,GAAsB;AACpB,IAAA,OAAO,IAAA,CAAK,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,MAAA;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,kBAAkB,IAAA,EAAqD;AACrE,IAAA,MAAM,WAAmC,EAAC;AAC1C,IAAA,IAAI,CAAC,MAAM,OAAO,QAAA;AAClB,IAAA,IAAI,IAAA,GAAyC,IAAA;AAC7C,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,OAAO,IAAA,EAAM;AACX,MAAA,IAAI,IAAA,KAAS,QAAQ,OAAA,EAAS;AAAA,WAAA,IACrB,IAAA,KAAS,MAAM,OAAA,GAAU,IAAA;AAClC,MAAA,QAAA,CAAS,KAAK,IAAK,CAAA;AACnB,MAAA,IAAA,GAAO,IAAA,CAAM,KAAA;AAAA,IACf;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAA,CAAe,QAA8B,IAAA,EAAkC;AAC7E,IAAA,IAAI,CAAC,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,KAAA,GAAQ,IAAA;AAAA,SAC7B;AACH,MAAA,IAAA,CAAK,KAAA,GAAQ,OAAO,KAAA,CAAM,KAAA;AAC1B,MAAA,IAAA,CAAK,OAAO,MAAA,CAAO,KAAA;AACnB,MAAA,MAAA,CAAO,KAAA,CAAM,MAAO,IAAA,GAAO,IAAA;AAC3B,MAAA,MAAA,CAAO,MAAM,KAAA,GAAQ,IAAA;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,IAAA,GAAsB;AACpB,IAAA,OAAO,KAAK,GAAA,EAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,GAAA,GAAqB;AACnB,IAAA,IAAI,IAAA,CAAK,KAAA,KAAU,CAAA,EAAG,OAAO,MAAA;AAC7B,IAAA,MAAM,IAAI,IAAA,CAAK,GAAA;AACf,IAAA,IAAI,EAAE,KAAA,EAAO;AACX,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,iBAAA,CAAkB,CAAA,CAAE,KAAK,CAAA;AAC/C,MAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,QAAA,IAAA,CAAK,cAAc,IAAI,CAAA;AACvB,QAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,IAAA,CAAK,eAAe,CAAC,CAAA;AACrB,IAAA,IAAI,CAAA,KAAM,EAAE,KAAA,EAAO;AACjB,MAAA,IAAA,CAAK,IAAA,GAAO,MAAA;AACZ,MAAA,IAAA,CAAK,KAAA,GAAQ,MAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,OAAO,CAAA,CAAE,KAAA;AACd,MAAA,IAAA,CAAK,YAAA,EAAa;AAAA,IACpB;AACA,IAAA,IAAA,CAAK,KAAA,EAAA;AACL,IAAA,OAAO,CAAA,CAAE,OAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAAA,EAAqC;AACzC,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC5B,IAAA,IAAI,IAAA,CAAK,IAAA,IAAQ,WAAA,CAAY,IAAA,EAAM;AACjC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,EACpB,SAAA,GAAY,WAAA,CAAY,IAAA;AAC1B,MAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,KAAA,EAC7B,aAAA,GAAgB,SAAA,CAAU,IAAA;AAC5B,MAAA,QAAA,CAAS,KAAA,GAAQ,SAAA;AACjB,MAAA,SAAA,CAAU,IAAA,GAAO,QAAA;AACjB,MAAA,aAAA,CAAc,IAAA,GAAO,aAAA;AACrB,MAAA,aAAA,CAAc,KAAA,GAAQ,aAAA;AAAA,IACxB,CAAA,MAAA,IAAW,CAAC,IAAA,CAAK,IAAA,IAAQ,YAAY,IAAA,EAAM;AACzC,MAAA,IAAA,CAAK,QAAQ,WAAA,CAAY,IAAA;AAAA,IAC3B;AACA,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,IAAQ,WAAA,CAAY,OAAO,IAAA,CAAK,UAAA,CAAW,WAAA,CAAY,GAAA,CAAI,OAAA,EAAS,IAAA,CAAK,GAAA,CAAI,OAAO,IAAI,CAAA,EAAI;AACpG,MAAA,IAAA,CAAK,OAAO,WAAA,CAAY,GAAA;AAAA,IAC1B;AACA,IAAA,IAAA,CAAK,SAAS,WAAA,CAAY,IAAA;AAC1B,IAAA,WAAA,CAAY,KAAA,EAAM;AAAA,EACpB;AAAA,EAEA,WAAW,OAAA,EAAkC;AAC3C,IAAA,OAAO,IAAI,kBAAqB,OAAO,CAAA;AAAA,EACzC;AAAA,EAEA,OAAA,GAAmB;AACjB,IAAA,OAAO,KAAK,KAAA,KAAU,CAAA;AAAA,EACxB;AAAA,EAEU,kBAAA,CAAmB,GAAM,CAAA,EAAc;AAC/C,IAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,IAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEU,cAAc,IAAA,EAAkC;AACxD,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,KAAA,GAAQ,IAAA;AAAA,SACxB;AACH,MAAA,IAAA,CAAK,KAAA,GAAQ,KAAK,IAAA,CAAK,KAAA;AACvB,MAAA,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AACjB,MAAA,IAAA,CAAK,IAAA,CAAK,MAAO,IAAA,GAAO,IAAA;AACxB,MAAA,IAAA,CAAK,KAAK,KAAA,GAAQ,IAAA;AAAA,IACpB;AAAA,EACF;AAAA,EAEU,eAAe,IAAA,EAAkC;AACzD,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,IAAA,EAAM,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AAC1C,IAAA,IAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AACtC,IAAA,IAAI,IAAA,CAAK,KAAA,EAAO,IAAA,CAAK,KAAA,CAAM,OAAO,IAAA,CAAK,IAAA;AAAA,EACzC;AAAA,EAEU,KAAA,CAAM,GAAyB,CAAA,EAA+B;AACtE,IAAA,IAAA,CAAK,eAAe,CAAC,CAAA;AACrB,IAAA,CAAA,CAAE,IAAA,GAAO,CAAA;AACT,IAAA,CAAA,CAAE,KAAA,GAAQ,CAAA;AACV,IAAA,IAAA,CAAK,cAAA,CAAe,GAAG,CAAC,CAAA;AACxB,IAAA,CAAA,CAAE,MAAA,EAAA;AACF,IAAA,CAAA,CAAE,MAAA,GAAS,CAAA;AAAA,EACb;AAAA,EAEU,YAAA,GAAqB;AAC7B,IAAA,MAAM,CAAA,GAA0C,IAAI,KAAA,CAAM,IAAA,CAAK,KAAK,CAAA;AACpE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,IAAI,CAAA;AACjD,IAAA,IAAI,CAAA,EACF,GACA,CAAA,EACA,CAAA;AAEF,IAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,MAAA,CAAA,GAAI,IAAA;AACJ,MAAA,CAAA,GAAI,CAAA,CAAE,MAAA;AACN,MAAA,OAAO,CAAA,CAAE,CAAC,CAAA,EAAG;AACX,QAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AACP,QAAA,IAAI,KAAK,UAAA,CAAW,CAAA,CAAE,SAAS,CAAA,CAAE,OAAO,IAAI,CAAA,EAAG;AAC7C,UAAA,CAAA,GAAI,CAAA;AACJ,UAAA,CAAA,GAAI,CAAA;AACJ,UAAA,CAAA,GAAI,CAAA;AAAA,QACN;AACA,QAAA,IAAA,CAAK,KAAA,CAAM,GAAG,CAAC,CAAA;AACf,QAAA,CAAA,CAAE,CAAC,CAAA,GAAI,MAAA;AACP,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA;AAAA,IACT;AAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,MAAA,IAAI,CAAA,CAAE,CAAC,CAAA,KAAM,CAAC,KAAK,GAAA,IAAO,IAAA,CAAK,WAAW,CAAA,CAAE,CAAC,EAAG,OAAA,EAAS,IAAA,CAAK,IAAI,OAAO,CAAA,IAAK,IAAI,IAAA,CAAK,IAAA,GAAO,EAAE,CAAC,CAAA;AAAA,IACnG;AAAA,EACF;AACF,CAAA;AAxP8B,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA;AAAvB,IAAM,aAAA,GAAN;;;ACzsCA,IAAM,cAAA,GAAN,MAAM,cAAA,SAAwC,IAAA,CAAW;AAAA,EAC9D,WAAA,CAAY,QAAA,GAAsC,EAAC,EAAG,OAAA,EAAsC;AAC1F,IAAA,KAAA,CAAM,UAAU,OAAO,CAAA;AAAA,EACzB;AACF,CAAA;AAJgE,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA;AAAzD,IAAM,aAAA,GAAN;;;ACEA,IAAM,iBAAA,GAAN,MAAM,iBAAA,SAA2C,aAAA,CAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ1E,WAAA,CAAY,QAAA,GAAsC,EAAC,EAAG,OAAA,EAAsC;AAC1F,IAAA,KAAA,CAAM,QAAA,EAAU;AAAA,MACd,UAAA,kBAAY,MAAA,CAAA,CAAC,CAAA,EAAM,CAAA,KAAiB;AAClC,QAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AAClD,UAAA,KAAA,CAAM,SAAA,EAAW,GAAA,CAAI,kBAAA,CAAmB,kBAAkB,CAAC,CAAA;AAAA,QAC7D;AACA,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,CAAA;AAClB,QAAA,IAAI,CAAA,GAAI,GAAG,OAAO,EAAA;AAClB,QAAA,OAAO,CAAA;AAAA,MACT,CAAA,EAPY,YAAA,CAAA;AAAA,MAQZ,GAAG;AAAA,KACJ,CAAA;AAAA,EACH;AACF,CAAA;AArB4E,MAAA,CAAA,iBAAA,EAAA,kBAAA,CAAA;AAArE,IAAM,gBAAA,GAAN","file":"index.mjs","sourcesContent":["/**\n * Centralized error dispatch.\n * All library errors go through this function for consistent messaging and easy grep.\n * @remarks Always throws — data structure errors are never recoverable.\n * @param ErrorClass - The error constructor (Error, TypeError, RangeError, etc.)\n * @param message - The error message.\n */\nexport function raise(\n  ErrorClass: new (msg: string) => Error,\n  message: string\n): never {\n  throw new ErrorClass(message);\n}\n\n/**\n * Centralized error message templates.\n * Keep using native Error/TypeError/RangeError — this only standardizes messages.\n */\nexport const ERR = {\n  // Range / index\n  indexOutOfRange: (index: number, min: number, max: number, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Index ${index} is out of range [${min}, ${max}].`,\n\n  invalidIndex: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Index must be an integer.`,\n\n  // Type / argument\n  invalidArgument: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  comparatorRequired: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Comparator is required for non-number/non-string/non-Date keys.`,\n\n  invalidKey: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  notAFunction: (name: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${name} must be a function.`,\n\n  invalidEntry: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Each entry must be a [key, value] tuple.`,\n\n  invalidNaN: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}NaN is not a valid key.`,\n\n  invalidDate: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Invalid Date key.`,\n\n  reduceEmpty: (ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Reduce of empty structure with no initial value.`,\n\n  callbackReturnType: (expected: string, got: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}Callback must return ${expected}; got ${got}.`,\n\n  // State / operation\n  invalidOperation: (reason: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${reason}`,\n\n  // Matrix\n  matrixDimensionMismatch: (op: string) =>\n    `Matrix: Dimensions must be compatible for ${op}.`,\n\n  matrixSingular: () =>\n    'Matrix: Singular matrix, inverse does not exist.',\n\n  matrixNotSquare: () =>\n    'Matrix: Must be square for inversion.',\n\n  matrixNotRectangular: () =>\n    'Matrix: Must be rectangular for transposition.',\n\n  matrixRowMismatch: (expected: number, got: number) =>\n    `Matrix: Expected row length ${expected}, but got ${got}.`,\n\n  // Order statistic\n  orderStatisticNotEnabled: (method: string, ctx?: string) =>\n    `${ctx ? ctx + ': ' : ''}${method}() requires enableOrderStatistic: true.`\n} as const;\n","export { ERR, raise } from './error';\n\nexport enum DFSOperation {\n  VISIT = 0,\n  PROCESS = 1\n}\n\nexport class Range<K> {\n  constructor(\n    public low: K,\n    public high: K,\n    public includeLow: boolean = true,\n    public includeHigh: boolean = true\n  ) {\n    // if (!(isComparable(low) && isComparable(high))) throw new RangeError('low or high is not comparable');\n    // if (low > high) throw new RangeError('low must be less than or equal to high');\n  }\n\n  // Determine whether a key is within the range\n  isInRange(key: K, comparator: (a: K, b: K) => number): boolean {\n    const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;\n    const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;\n    return lowCheck && highCheck;\n  }\n}\n","import type { ElementCallback, IterableElementBaseOptions, ReduceElementCallback } from '../../types';\nimport { raise } from '../../common';\n\n/**\n * Base class that makes a data structure iterable and provides common\n * element-wise utilities (e.g., map/filter/reduce/find).\n *\n * @template E The public element type yielded by the structure.\n * @template R The underlying \"raw\" element type used internally or by converters.\n *\n * @remarks\n * This class implements the JavaScript iteration protocol (via `Symbol.iterator`)\n * and offers array-like helpers with predictable time/space complexity.\n */\nexport abstract class IterableElementBase<E, R> implements Iterable<E> {\n  /**\n   * Create a new iterable base.\n   *\n   * @param options Optional behavior overrides. When provided, a `toElementFn`\n   * is used to convert a raw element (`R`) into a public element (`E`).\n   *\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  protected constructor(options?: IterableElementBaseOptions<E, R>) {\n    if (options) {\n      const { toElementFn } = options;\n      if (typeof toElementFn === 'function') this._toElementFn = toElementFn;\n      else if (toElementFn) raise(TypeError, 'toElementFn must be a function type');\n    }\n  }\n\n  /**\n   * The converter used to transform a raw element (`R`) into a public element (`E`).\n   *\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  protected _toElementFn?: (rawElement: R) => E;\n\n  /**\n   * Exposes the current `toElementFn`, if configured.\n   *\n   * @returns The converter function or `undefined` when not set.\n   * @remarks\n   * Time O(1), Space O(1).\n   */\n  get toElementFn(): ((rawElement: R) => E) | undefined {\n    return this._toElementFn;\n  }\n\n  /**\n   * Returns an iterator over the structure's elements.\n   *\n   * @param args Optional iterator arguments forwarded to the internal iterator.\n   * @returns An `IterableIterator<E>` that yields the elements in traversal order.\n   *\n   * @remarks\n   * Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.\n   */\n  *[Symbol.iterator](...args: unknown[]): IterableIterator<E> {\n    yield* this._getIterator(...args);\n  }\n\n  /**\n   * Returns an iterator over the values (alias of the default iterator).\n   *\n   * @returns An `IterableIterator<E>` over all elements.\n   * @remarks\n   * Creating the iterator is O(1); full iteration is Time O(n), Space O(1).\n   */\n  *values(): IterableIterator<E> {\n    for (const item of this) yield item;\n  }\n\n  /**\n   * Tests whether all elements satisfy the predicate.\n   *\n   * @template TReturn\n   * @param predicate Function invoked for each element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns `true` if every element passes; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).\n   */\n  every(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): boolean {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (!predicate(item, index++, this)) return false;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (!fn.call(thisArg, item, index++, this)) return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Tests whether at least one element satisfies the predicate.\n   *\n   * @param predicate Function invoked for each element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns `true` if any element passes; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early on first success. Space O(1).\n   */\n  some(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): boolean {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (predicate(item, index++, this)) return true;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (fn.call(thisArg, item, index++, this)) return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Invokes a callback for each element in iteration order.\n   *\n   * @param callbackfn Function invoked per element with signature `(value, index, self)`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns `void`.\n   *\n   * @remarks\n   * Time O(n), Space O(1).\n   */\n  forEach(callbackfn: ElementCallback<E, R, void>, thisArg?: unknown): void {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        callbackfn(item, index++, this);\n      } else {\n        const fn = callbackfn as (this: unknown, v: E, i: number, self: this) => void;\n        fn.call(thisArg, item, index++, this);\n      }\n    }\n  }\n\n  /**\n   * Finds the first element that satisfies the predicate and returns it.\n   *\n   * @overload\n   * Finds the first element of type `S` (a subtype of `E`) that satisfies the predicate and returns it.\n   * @template S\n   * @param predicate Type-guard predicate: `(value, index, self) => value is S`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns The matched element typed as `S`, or `undefined` if not found.\n   *\n   * @overload\n   * @param predicate Boolean predicate: `(value, index, self) => boolean`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns The first matching element as `E`, or `undefined` if not found.\n   *\n   * @remarks\n   * Time O(n) in the worst case; may exit early on the first match. Space O(1).\n   */\n  find<S extends E>(predicate: ElementCallback<E, R, S>, thisArg?: unknown): S | undefined;\n  find(predicate: ElementCallback<E, R, unknown>, thisArg?: unknown): E | undefined;\n\n  // Implementation signature\n  find(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): E | undefined {\n    let index = 0;\n    for (const item of this) {\n      if (thisArg === undefined) {\n        if (predicate(item, index++, this)) return item;\n      } else {\n        const fn = predicate as (this: unknown, v: E, i: number, self: this) => boolean;\n        if (fn.call(thisArg, item, index++, this)) return item;\n      }\n    }\n    return;\n  }\n\n  /**\n   * Checks whether a strictly-equal element exists in the structure.\n   *\n   * @param element The element to test with `===` equality.\n   * @returns `true` if an equal element is found; otherwise `false`.\n   *\n   * @remarks\n   * Time O(n) in the worst case. Space O(1).\n   */\n  has(element: E): boolean {\n    for (const ele of this) if (ele === element) return true;\n    return false;\n  }\n\n  reduce(callbackfn: ReduceElementCallback<E, R>): E;\n  reduce(callbackfn: ReduceElementCallback<E, R>, initialValue: E): E;\n  reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue: U): U;\n\n  /**\n   * Reduces all elements to a single accumulated value.\n   *\n   * @overload\n   * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`. The first element is used as the initial accumulator.\n   * @returns The final accumulated value typed as `E`.\n   *\n   * @overload\n   * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`.\n   * @param initialValue The initial accumulator value of type `E`.\n   * @returns The final accumulated value typed as `E`.\n   *\n   * @overload\n   * @template U The accumulator type when it differs from `E`.\n   * @param callbackfn Reducer of signature `(acc: U, value, index, self) => U`.\n   * @param initialValue The initial accumulator value of type `U`.\n   * @returns The final accumulated value typed as `U`.\n   *\n   * @remarks\n   * Time O(n), Space O(1). Throws if called on an empty structure without `initialValue`.\n   */\n  reduce<U>(callbackfn: ReduceElementCallback<E, R, U>, initialValue?: U): U {\n    let index = 0;\n    const iter = this[Symbol.iterator]();\n    let acc: U;\n\n    if (arguments.length >= 2) {\n      acc = initialValue as U;\n    } else {\n      const first = iter.next();\n      if (first.done) raise(TypeError, 'Reduce of empty structure with no initial value');\n      acc = first.value as unknown as U;\n      index = 1;\n    }\n\n    for (const value of iter as unknown as Iterable<E>) {\n      acc = callbackfn(acc, value, index++, this);\n    }\n    return acc;\n  }\n\n  /**\n   * Materializes the elements into a new array.\n   *\n   * @returns A shallow array copy of the iteration order.\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  toArray(): E[] {\n    return [...this];\n  }\n\n  /**\n   * Returns a representation of the structure suitable for quick visualization.\n   * Defaults to an array of elements; subclasses may override to provide richer visuals.\n   *\n   * @returns A visual representation (array by default).\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  toVisual(): E[] {\n    return [...this];\n  }\n\n  /**\n   * Prints `toVisual()` to the console. Intended for quick debugging.\n   *\n   * @returns `void`.\n   * @remarks\n   * Time O(n) due to materialization, Space O(n) for the intermediate representation.\n   */\n  print(): void {\n    console.log(this.toVisual());\n  }\n\n  /**\n   * Indicates whether the structure currently contains no elements.\n   *\n   * @returns `true` if empty; otherwise `false`.\n   * @remarks\n   * Expected Time O(1), Space O(1) for most implementations.\n   */\n  abstract isEmpty(): boolean;\n\n  /**\n   * Removes all elements from the structure.\n   *\n   * @returns `void`.\n   * @remarks\n   * Expected Time O(1) or O(n) depending on the implementation; Space O(1).\n   */\n  abstract clear(): void;\n\n  /**\n   * Creates a structural copy with the same element values and configuration.\n   *\n   * @returns A clone of the current instance (same concrete type).\n   * @remarks\n   * Expected Time O(n) to copy elements; Space O(n).\n   */\n  abstract clone(): this;\n\n  /**\n   * Maps each element to a new element and returns a new iterable structure.\n   *\n   * @template EM The mapped element type.\n   * @template RM The mapped raw element type used internally by the target structure.\n   * @param callback Function with signature `(value, index, self) => mapped`.\n   * @param options Optional options for the returned structure, including its `toElementFn`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns A new `IterableElementBase<EM, RM>` containing mapped elements.\n   *\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  abstract map<EM, RM>(\n    callback: ElementCallback<E, R, EM>,\n    options?: IterableElementBaseOptions<EM, RM>,\n    thisArg?: unknown\n  ): IterableElementBase<EM, RM>;\n\n  /**\n   * Maps each element to the same element type and returns the same concrete structure type.\n   *\n   * @param callback Function with signature `(value, index, self) => mappedValue`.\n   * @param thisArg Optional `this` binding for the callback.\n   * @returns A new instance of the same concrete type with mapped elements.\n   *\n   * @remarks\n   * Time O(n), Space O(n).\n   */\n  abstract mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;\n\n  /**\n   * Filters elements using the provided predicate and returns the same concrete structure type.\n   *\n   * @param predicate Function with signature `(value, index, self) => boolean`.\n   * @param thisArg Optional `this` binding for the predicate.\n   * @returns A new instance of the same concrete type containing only elements that pass the predicate.\n   *\n   * @remarks\n   * Time O(n), Space O(k) where `k` is the number of kept elements.\n   */\n  abstract filter(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): this;\n\n  /**\n   * Internal iterator factory used by the default iterator.\n   *\n   * @param args Optional iterator arguments.\n   * @returns An iterator over elements.\n   *\n   * @remarks\n   * Implementations should yield in O(1) per element with O(1) extra space when possible.\n   */\n  protected abstract _getIterator(...args: unknown[]): IterableIterator<E>;\n}\n","/**\n * data-structure-typed\n *\n * @author Pablo Zeng\n * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>\n * @license MIT License\n */\n\nimport type { Comparator, DFSOrderPattern, ElementCallback, HeapOptions } from '../../types';\nimport { IterableElementBase } from '../base';\nimport { ERR, raise } from '../../common';\n\n/**\n * Binary heap with pluggable comparator; supports fast insertion and removal of the top element.\n * @remarks Time O(1), Space O(1)\n * @template E\n * @template R\n * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.\n * 2. Heap Properties: Each node in a heap follows a specific order property, which varies depending on the type of heap:\n * Max Heap: The value of each parent node is greater than or equal to the value of its children.\n * Min Heap: The value of each parent node is less than or equal to the value of its children.\n * 3. Root Node Access: In a heap, the largest element (in a max heap) or the smallest element (in a min heap) is always at the root of the tree.\n * 4. Efficient Insertion and Deletion: Due to its structure, a heap allows for insertion and deletion operations in logarithmic time (O(log n)).\n * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.\n * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.\n * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.\n * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prime's minimum-spanning tree algorithm, which use heaps to improve performance.\n * @example\n * // Use Heap to solve top k problems\n *  function topKElements(arr: number[], k: number): number[] {\n *       const heap = new Heap<number>([], { comparator: (a, b) => b - a }); // Max heap\n *       arr.forEach(num => {\n *         heap.add(num);\n *         if (heap.size > k) heap.poll(); // Keep the heap size at K\n *       });\n *       return heap.toArray();\n *     }\n *\n *     const numbers = [10, 30, 20, 5, 15, 25];\n *     console.log(topKElements(numbers, 3)); // [15, 10, 5];\n * @example\n * // Use Heap to dynamically maintain the median\n *  class MedianFinder {\n *       private low: MaxHeap<number>; // Max heap, stores the smaller half\n *       private high: MinHeap<number>; // Min heap, stores the larger half\n *\n *       constructor() {\n *         this.low = new MaxHeap<number>([]);\n *         this.high = new MinHeap<number>([]);\n *       }\n *\n *       addNum(num: number): void {\n *         if (this.low.isEmpty() || num <= this.low.peek()!) this.low.add(num);\n *         else this.high.add(num);\n *\n *         // Balance heaps\n *         if (this.low.size > this.high.size + 1) this.high.add(this.low.poll()!);\n *         else if (this.high.size > this.low.size) this.low.add(this.high.poll()!);\n *       }\n *\n *       findMedian(): number {\n *         if (this.low.size === this.high.size) return (this.low.peek()! + this.high.peek()!) / 2;\n *         return this.low.peek()!;\n *       }\n *     }\n *\n *     const medianFinder = new MedianFinder();\n *     medianFinder.addNum(10);\n *     console.log(medianFinder.findMedian()); // 10;\n *     medianFinder.addNum(20);\n *     console.log(medianFinder.findMedian()); // 15;\n *     medianFinder.addNum(30);\n *     console.log(medianFinder.findMedian()); // 20;\n *     medianFinder.addNum(40);\n *     console.log(medianFinder.findMedian()); // 25;\n *     medianFinder.addNum(50);\n *     console.log(medianFinder.findMedian()); // 30;\n * @example\n * // Use Heap for load balancing\n *  function loadBalance(requests: number[], servers: number): number[] {\n *       const serverHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // min heap\n *       const serverLoads = new Array(servers).fill(0);\n *\n *       for (let i = 0; i < servers; i++) {\n *         serverHeap.add({ id: i, load: 0 });\n *       }\n *\n *       requests.forEach(req => {\n *         const server = serverHeap.poll()!;\n *         serverLoads[server.id] += req;\n *         server.load += req;\n *         serverHeap.add(server); // The server after updating the load is re-entered into the heap\n *       });\n *\n *       return serverLoads;\n *     }\n *\n *     const requests = [5, 2, 8, 3, 7];\n *     console.log(loadBalance(requests, 3)); // [12, 8, 5];\n * @example\n * // Use Heap to schedule tasks\n *  type Task = [string, number];\n *\n *     function scheduleTasks(tasks: Task[], machines: number): Map<number, Task[]> {\n *       const machineHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // Min heap\n *       const allocation = new Map<number, Task[]>();\n *\n *       // Initialize the load on each machine\n *       for (let i = 0; i < machines; i++) {\n *         machineHeap.add({ id: i, load: 0 });\n *         allocation.set(i, []);\n *       }\n *\n *       // Assign tasks\n *       tasks.forEach(([task, load]) => {\n *         const machine = machineHeap.poll()!;\n *         allocation.get(machine.id)!.push([task, load]);\n *         machine.load += load;\n *         machineHeap.add(machine); // The machine after updating the load is re-entered into the heap\n *       });\n *\n *       return allocation;\n *     }\n *\n *     const tasks: Task[] = [\n *       ['Task1', 3],\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task4', 5],\n *       ['Task5', 4]\n *     ];\n *     const expectedMap = new Map<number, Task[]>();\n *     expectedMap.set(0, [\n *       ['Task1', 3],\n *       ['Task4', 5]\n *     ]);\n *     expectedMap.set(1, [\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task5', 4]\n *     ]);\n *     console.log(scheduleTasks(tasks, 2)); // expectedMap;\n * @example\n * // Get all elements as array\n *  const heap = new Heap<number>([5, 1, 3, 2, 4]);\n *     const arr = heap.toArray();\n *     console.log(arr.length); // 5;\n *     console.log(arr.sort()); // [1, 2, 3, 4, 5];\n */\nexport class Heap<E = any, R = any> extends IterableElementBase<E, R> {\n  protected _equals: (a: E, b: E) => boolean = Object.is;\n\n  /**\n   * Create a Heap and optionally bulk-insert elements.\n   * @remarks Time O(N), Space O(N)\n   * @param [elements] - Iterable of elements (or raw values if toElementFn is set).\n   * @param [options] - Options such as comparator and toElementFn.\n   * @returns New Heap instance.\n   */\n\n  constructor(elements: Iterable<E | R> = [], options?: HeapOptions<E, R>) {\n    super(options);\n\n    if (options) {\n      const { comparator } = options;\n      if (comparator) this._comparator = comparator;\n    }\n\n    this.addMany(elements as Iterable<E | R>);\n  }\n\n  protected _elements: E[] = [];\n\n  /**\n   * Get the backing array of the heap.\n   * @remarks Time O(1), Space O(1)\n   * @returns Internal elements array.\n   */\n\n  get elements(): E[] {\n    return this._elements;\n  }\n\n  /**\n   * Get the number of elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns Heap size.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Track heap capacity\n *  const heap = new Heap<number>();\n *     console.log(heap.size); // 0;\n *     heap.add(10);\n *     heap.add(20);\n *     console.log(heap.size); // 2;\n *     heap.poll();\n *     console.log(heap.size); // 1;\n   */\n\n  get size(): number {\n    return this.elements.length;\n  }\n\n  /**\n   * Get the last leaf element.\n   * @remarks Time O(1), Space O(1)\n   * @returns Last element or undefined.\n   */\n\n  get leaf(): E | undefined {\n    return this.elements[this.size - 1] ?? undefined;\n  }\n\n  /**\n   * Create a heap of the same class from an iterable.\n   * @remarks Time O(N), Space O(N)\n   * @template T\n   * @template R\n   * @template S\n   * @param [elements] - Iterable of elements or raw records.\n   * @param [options] - Heap options including comparator.\n   * @returns A new heap instance of this class.\n   */\n\n  static from<T, R = any, S extends Heap<T, R> = Heap<T, R>>(\n    this: new (elements?: Iterable<T | R>, options?: HeapOptions<T, R>) => S,\n    elements?: Iterable<T | R>,\n    options?: HeapOptions<T, R>\n  ): S {\n    return new this(elements, options);\n  }\n\n  /**\n   * Build a Heap from an iterable in linear time given a comparator.\n   * @remarks Time O(N), Space O(N)\n   * @template EE\n   * @template RR\n   * @param elements - Iterable of elements.\n   * @param options - Heap options including comparator.\n   * @returns A new Heap built from elements.\n   */\n\n  static heapify<EE = any, RR = any>(elements: Iterable<EE>, options: HeapOptions<EE, RR>): Heap<EE, RR> {\n    return new Heap<EE, RR>(elements, options);\n  }\n\n  /**\n   * Insert an element.\n   * @remarks Time O(1) amortized, Space O(1)\n   * @param element - Element to insert.\n   * @returns True.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // basic Heap creation and add operation\n *  // Create a min heap (default)\n *     const minHeap = new Heap([5, 3, 7, 1, 9, 2]);\n *\n *     // Verify size\n *     console.log(minHeap.size); // 6;\n *\n *     // Add new element\n *     minHeap.add(4);\n *     console.log(minHeap.size); // 7;\n *\n *     // Min heap property: smallest element at root\n *     const min = minHeap.peek();\n *     console.log(min); // 1;\n   */\n\n  add(element: E): boolean {\n    this._elements.push(element);\n    return this._bubbleUp(this.elements.length - 1);\n  }\n\n  /**\n   * Insert many elements from an iterable.\n   * @remarks Time O(N log N), Space O(1)\n   * @param elements - Iterable of elements or raw values.\n   * @returns Array of per-element success flags.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Add multiple elements\n *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });\n *     heap.addMany([5, 3, 7, 1]);\n *     console.log(heap.peek()); // 1;\n *     console.log(heap.size); // 4;\n   */\n\n  addMany(elements: Iterable<E | R>): boolean[] {\n    const flags: boolean[] = [];\n    for (const el of elements) {\n      if (this.toElementFn) {\n        const ok = this.add(this.toElementFn(el as R));\n        flags.push(ok);\n      } else {\n        const ok = this.add(el as E);\n        flags.push(ok);\n      }\n    }\n    return flags;\n  }\n\n  /**\n   * Remove and return the top element.\n   * @remarks Time O(log N), Space O(1)\n   * @returns Top element or undefined.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Heap with custom comparator (MaxHeap behavior)\n *  interface Task {\n *       id: number;\n *       priority: number;\n *       name: string;\n *     }\n *\n *     // Custom comparator for max heap behavior (higher priority first)\n *     const tasks: Task[] = [\n *       { id: 1, priority: 5, name: 'Email' },\n *       { id: 2, priority: 3, name: 'Chat' },\n *       { id: 3, priority: 8, name: 'Alert' }\n *     ];\n *\n *     const maxHeap = new Heap(tasks, {\n *       comparator: (a: Task, b: Task) => b.priority - a.priority\n *     });\n *\n *     console.log(maxHeap.size); // 3;\n *\n *     // Peek returns highest priority task\n *     const topTask = maxHeap.peek();\n *     console.log(topTask?.priority); // 8;\n *     console.log(topTask?.name); // 'Alert';\n   */\n\n  poll(): E | undefined {\n    if (this.elements.length === 0) return;\n    const value = this.elements[0];\n    const last = this.elements.pop()!;\n    if (this.elements.length) {\n      this.elements[0] = last;\n      this._sinkDown(0, this.elements.length >> 1);\n    }\n    return value;\n  }\n\n  /**\n   * Get the current top element without removing it.\n   * @remarks Time O(1), Space O(1)\n   * @returns Top element or undefined.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Heap for event processing with priority\n *  interface Event {\n *       id: number;\n *       type: 'critical' | 'warning' | 'info';\n *       timestamp: number;\n *       message: string;\n *     }\n *\n *     // Custom priority: critical > warning > info\n *     const priorityMap = { critical: 3, warning: 2, info: 1 };\n *\n *     const eventHeap = new Heap<Event>([], {\n *       comparator: (a: Event, b: Event) => {\n *         const priorityA = priorityMap[a.type];\n *         const priorityB = priorityMap[b.type];\n *         return priorityB - priorityA; // Higher priority first\n *       }\n *     });\n *\n *     // Add events in random order\n *     eventHeap.add({ id: 1, type: 'info', timestamp: 100, message: 'User logged in' });\n *     eventHeap.add({ id: 2, type: 'critical', timestamp: 101, message: 'Server down' });\n *     eventHeap.add({ id: 3, type: 'warning', timestamp: 102, message: 'High memory' });\n *     eventHeap.add({ id: 4, type: 'info', timestamp: 103, message: 'Cache cleared' });\n *     eventHeap.add({ id: 5, type: 'critical', timestamp: 104, message: 'Database error' });\n *\n *     console.log(eventHeap.size); // 5;\n *\n *     // Process events by priority (critical first)\n *     const processedOrder: Event[] = [];\n *     while (eventHeap.size > 0) {\n *       const event = eventHeap.poll();\n *       if (event) {\n *         processedOrder.push(event);\n *       }\n *     }\n *\n *     // Verify critical events came first\n *     console.log(processedOrder[0].type); // 'critical';\n *     console.log(processedOrder[1].type); // 'critical';\n *     console.log(processedOrder[2].type); // 'warning';\n *     console.log(processedOrder[3].type); // 'info';\n *     console.log(processedOrder[4].type); // 'info';\n *\n *     // Verify O(log n) operations\n *     const newHeap = new Heap<number>([5, 3, 7, 1]);\n *\n *     // Add - O(log n)\n *     newHeap.add(2);\n *     console.log(newHeap.size); // 5;\n *\n *     // Poll - O(log n)\n *     const removed = newHeap.poll();\n *     console.log(removed); // 1;\n *\n *     // Peek - O(1)\n *     const top = newHeap.peek();\n *     console.log(top); // 2;\n   */\n\n  peek(): E | undefined {\n    return this.elements[0];\n  }\n\n  /**\n   * Check whether the heap is empty.\n   * @remarks Time O(1), Space O(1)\n   * @returns True if size is 0.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Check if heap is empty\n *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });\n *     console.log(heap.isEmpty()); // true;\n *     heap.add(1);\n *     console.log(heap.isEmpty()); // false;\n   */\n\n  isEmpty(): boolean {\n    return this.size === 0;\n  }\n\n  /**\n   * Remove all elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns void\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Remove all elements\n *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });\n *     heap.clear();\n *     console.log(heap.isEmpty()); // true;\n   */\n\n  clear(): void {\n    this._elements = [];\n  }\n\n  /**\n   * Replace the backing array and rebuild the heap.\n   * @remarks Time O(N), Space O(N)\n   * @param elements - Iterable used to refill the heap.\n   * @returns Array of per-node results from fixing steps.\n   */\n\n  refill(elements: Iterable<E>): boolean[] {\n    this._elements = Array.from(elements);\n    return this.fix();\n  }\n\n  /**\n   * Check if an equal element exists in the heap.\n   * @remarks Time O(N), Space O(1)\n   * @param element - Element to search for.\n   * @returns True if found.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Check element existence\n *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });\n *     console.log(heap.has(1)); // true;\n *     console.log(heap.has(99)); // false;\n   */\n\n  override has(element: E): boolean {\n    for (const el of this.elements) if (this._equals(el, element)) return true;\n    return false;\n  }\n\n  /**\n   * Delete one occurrence of an element.\n   * @remarks Time O(N), Space O(1)\n   * @param element - Element to delete.\n   * @returns True if an element was removed.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Remove specific element\n *  const heap = new Heap<number>([3, 1, 4, 1, 5], { comparator: (a, b) => a - b });\n *     heap.delete(4);\n *     console.log(heap.toArray().includes(4)); // false;\n   */\n\n  delete(element: E): boolean {\n    let index = -1;\n    for (let i = 0; i < this.elements.length; i++) {\n      if (this._equals(this.elements[i], element)) {\n        index = i;\n        break;\n      }\n    }\n    if (index < 0) return false;\n    if (index === 0) {\n      this.poll();\n    } else if (index === this.elements.length - 1) {\n      this.elements.pop();\n    } else {\n      this.elements.splice(index, 1, this.elements.pop()!);\n      this._bubbleUp(index);\n      this._sinkDown(index, this.elements.length >> 1);\n    }\n    return true;\n  }\n\n  /**\n   * Delete the first element that matches a predicate.\n   * @remarks Time O(N), Space O(1)\n   * @param predicate - Function (element, index, heap) → boolean.\n   * @returns True if an element was removed.\n   */\n\n  deleteBy(predicate: (element: E, index: number, heap: this) => boolean): boolean {\n    let idx = -1;\n    for (let i = 0; i < this.elements.length; i++) {\n      if (predicate(this.elements[i], i, this)) {\n        idx = i;\n        break;\n      }\n    }\n    if (idx < 0) return false;\n    if (idx === 0) {\n      this.poll();\n    } else if (idx === this.elements.length - 1) {\n      this.elements.pop();\n    } else {\n      this.elements.splice(idx, 1, this.elements.pop()!);\n      this._bubbleUp(idx);\n      this._sinkDown(idx, this.elements.length >> 1);\n    }\n    return true;\n  }\n\n  /**\n   * Set the equality comparator used by has/delete operations.\n   * @remarks Time O(1), Space O(1)\n   * @param equals - Equality predicate (a, b) → boolean.\n   * @returns This heap.\n   */\n\n  setEquality(equals: (a: E, b: E) => boolean): this {\n    this._equals = equals;\n    return this;\n  }\n\n  /**\n   * Traverse the binary heap as a complete binary tree and collect elements.\n   * @remarks Time O(N), Space O(H)\n   * @param [order] - Traversal order: 'PRE' | 'IN' | 'POST'.\n   * @returns Array of visited elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Depth-first traversal\n *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });\n *     const result = heap.dfs('IN');\n *     console.log(result.length); // 3;\n   */\n\n  dfs(order: DFSOrderPattern = 'PRE'): E[] {\n    const result: E[] = [];\n    const _dfs = (index: number) => {\n      const left = 2 * index + 1,\n        right = left + 1;\n      if (index < this.size) {\n        if (order === 'IN') {\n          _dfs(left);\n          result.push(this.elements[index]);\n          _dfs(right);\n        } else if (order === 'PRE') {\n          result.push(this.elements[index]);\n          _dfs(left);\n          _dfs(right);\n        } else if (order === 'POST') {\n          _dfs(left);\n          _dfs(right);\n          result.push(this.elements[index]);\n        }\n      }\n    };\n    _dfs(0);\n    return result;\n  }\n\n  /**\n   * Restore heap order bottom-up (heapify in-place).\n   * @remarks Time O(N), Space O(1)\n   * @returns Array of per-node results from fixing steps.\n   */\n\n  fix(): boolean[] {\n    const results: boolean[] = [];\n    for (let i = Math.floor(this.size / 2) - 1; i >= 0; i--) {\n      results.push(this._sinkDown(i, this.elements.length >> 1));\n    }\n    return results;\n  }\n\n  /**\n   * Return all elements in ascending order by repeatedly polling.\n   * @remarks Time O(N log N), Space O(N)\n   * @returns Sorted array of elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Sort elements using heap\n *  const heap = new Heap<number>([5, 1, 3, 2, 4]);\n *     const sorted = heap.sort();\n *     console.log(sorted); // [1, 2, 3, 4, 5];\n   */\n\n  sort(): E[] {\n    const visited: E[] = [];\n    const cloned = this._createInstance();\n    for (const x of this.elements) cloned.add(x);\n    while (!cloned.isEmpty()) {\n      const top = cloned.poll();\n      if (top !== undefined) visited.push(top);\n    }\n    return visited;\n  }\n\n  /**\n   * Deep clone this heap.\n   * @remarks Time O(N), Space O(N)\n   * @returns A new heap with the same elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Create independent copy\n *  const heap = new Heap<number>([3, 1, 4], { comparator: (a, b) => a - b });\n *     const copy = heap.clone();\n *     copy.poll();\n *     console.log(heap.size); // 3;\n *     console.log(copy.size); // 2;\n   */\n\n  clone(): this {\n    const next = this._createInstance();\n    for (const x of this.elements) next.add(x);\n    return next;\n  }\n\n  /**\n   * Filter elements into a new heap of the same class.\n   * @remarks Time O(N log N), Space O(N)\n   * @param callback - Predicate (element, index, heap) → boolean to keep element.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with the kept elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Filter elements\n *  const heap = new Heap<number>([1, 2, 3, 4, 5], { comparator: (a, b) => a - b });\n *     const evens = heap.filter(x => x % 2 === 0);\n *     console.log(evens.size); // 2;\n   */\n\n  filter(callback: ElementCallback<E, R, boolean>, thisArg?: unknown): this {\n    const out = this._createInstance();\n    let i = 0;\n    for (const x of this) {\n      if (thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this)) {\n        out.add(x);\n      } else {\n        i++;\n      }\n    }\n    return out;\n  }\n\n  /**\n   * Map elements into a new heap of possibly different element type.\n   * @remarks Time O(N log N), Space O(N)\n   * @template EM\n   * @template RM\n   * @param callback - Mapping function (element, index, heap) → newElement.\n   * @param options - Options for the output heap, including comparator for EM.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with mapped elements.\n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n   \n    * @example\n * // Transform elements\n *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });\n *     const doubled = heap.map(x => x * 2, { comparator: (a, b) => a - b });\n *     console.log(doubled.peek()); // 2;\n   */\n\n  map<EM, RM>(\n    callback: ElementCallback<E, R, EM>,\n    options: HeapOptions<EM, RM> & { comparator: Comparator<EM> },\n    thisArg?: unknown\n  ): Heap<EM, RM> {\n    const { comparator, toElementFn, ...rest } = options ?? {};\n    if (!comparator) raise(TypeError, ERR.comparatorRequired('Heap.map'));\n    const out = this._createLike<EM, RM>([], { ...rest, comparator, toElementFn });\n    let i = 0;\n    for (const x of this) {\n      const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);\n      out.add(v);\n    }\n    return out;\n  }\n\n  /**\n   * Map elements into a new heap of the same element type.\n   * @remarks Time O(N log N), Space O(N)\n   * @param callback - Mapping function (element, index, heap) → element.\n   * @param [thisArg] - Value for `this` inside the callback.\n   * @returns A new heap with mapped elements.\n   */\n\n  mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this {\n    const out = this._createInstance();\n    let i = 0;\n    for (const x of this) {\n      const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);\n      out.add(v);\n    }\n    return out;\n  }\n\n  protected readonly _DEFAULT_COMPARATOR: Comparator<E> = (a: E, b: E): number => {\n    if (typeof a === 'object' || typeof b === 'object') {\n      raise(TypeError, ERR.comparatorRequired('Heap'));\n    }\n    if (a > b) return 1;\n    if (a < b) return -1;\n    return 0;\n  };\n\n  protected readonly _comparator: Comparator<E> = this._DEFAULT_COMPARATOR;\n\n  /**\n   * Get the comparator used to order elements.\n   * @remarks Time O(1), Space O(1)\n   * @returns Comparator function.\n   */\n\n  get comparator() {\n    return this._comparator;\n  }\n\n  protected *_getIterator(): IterableIterator<E> {\n    for (const element of this.elements) yield element;\n  }\n\n  protected _bubbleUp(index: number): boolean {\n    const element = this.elements[index];\n    while (index > 0) {\n      const parent = (index - 1) >> 1;\n      const parentItem = this.elements[parent];\n      if (this.comparator(parentItem, element) <= 0) break;\n      this.elements[index] = parentItem;\n      index = parent;\n    }\n    this.elements[index] = element;\n    return true;\n  }\n\n  protected _sinkDown(index: number, halfLength: number): boolean {\n    const element = this.elements[index];\n    while (index < halfLength) {\n      let left = (index << 1) | 1;\n      const right = left + 1;\n      let minItem = this.elements[left];\n      if (right < this.elements.length && this.comparator(minItem, this.elements[right]) > 0) {\n        left = right;\n        minItem = this.elements[right];\n      }\n      if (this.comparator(minItem, element) >= 0) break;\n      this.elements[index] = minItem;\n      index = left;\n    }\n    this.elements[index] = element;\n    return true;\n  }\n\n  /**\n   * (Protected) Create an empty instance of the same concrete class.\n   * @remarks Time O(1), Space O(1)\n   * @param [options] - Options to override comparator or toElementFn.\n   * @returns A like-kind empty heap instance.\n   */\n\n  protected _createInstance(options?: HeapOptions<E, R>): this {\n    const Ctor = this.constructor as new (\n      elements?: Iterable<E> | Iterable<R>,\n      options?: HeapOptions<E, R>\n    ) => this;\n    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...(options ?? {}) });\n  }\n\n  /**\n   * (Protected) Create a like-kind instance seeded by elements.\n   * @remarks Time O(N log N), Space O(N)\n   * @template EM\n   * @template RM\n   * @param [elements] - Iterable of elements or raw values to seed.\n   * @param [options] - Options forwarded to the constructor.\n   * @returns A like-kind heap instance.\n   */\n\n  protected _createLike<EM, RM>(\n    elements: Iterable<EM> | Iterable<RM> = [],\n    options?: HeapOptions<EM, RM>\n  ): Heap<EM, RM> {\n    const Ctor = this.constructor as new (\n      elements?: Iterable<EM> | Iterable<RM>,\n      options?: HeapOptions<EM, RM>\n    ) => Heap<EM, RM>;\n    return new Ctor(elements, options);\n  }\n\n  /**\n   * (Protected) Spawn an empty like-kind heap instance.\n   * @remarks Time O(1), Space O(1)\n   * @template EM\n   * @template RM\n   * @param [options] - Options forwarded to the constructor.\n   * @returns An empty like-kind heap instance.\n   */\n\n  protected _spawnLike<EM, RM>(options?: HeapOptions<EM, RM>): Heap<EM, RM> {\n    return this._createLike<EM, RM>([], options);\n  }\n}\n\n/**\n * Node container used by FibonacciHeap.\n * @remarks Time O(1), Space O(1)\n * @template E\n */\nexport class FibonacciHeapNode<E> {\n  element: E;\n  degree: number;\n  left?: FibonacciHeapNode<E>;\n  right?: FibonacciHeapNode<E>;\n  child?: FibonacciHeapNode<E>;\n  parent?: FibonacciHeapNode<E>;\n  marked: boolean;\n\n  constructor(element: E, degree = 0) {\n    this.element = element;\n    this.degree = degree;\n    this.marked = false;\n  }\n}\n\n/**\n * Fibonacci heap (min-heap) optimized for fast merges and amortized operations.\n * @remarks Time O(1), Space O(1)\n * @template E\n * @example examples will be generated by unit test\n */\nexport class FibonacciHeap<E> {\n  /**\n   * Create a FibonacciHeap.\n   * @remarks Time O(1), Space O(1)\n   * @param [comparator] - Comparator to order elements (min-heap by default).\n   * @returns New FibonacciHeap instance.\n   */\n\n  constructor(comparator?: Comparator<E>) {\n    this.clear();\n    this._comparator = comparator || this._defaultComparator;\n    if (typeof this.comparator !== 'function') raise(TypeError, ERR.notAFunction('comparator', 'FibonacciHeap'));\n  }\n\n  protected _root?: FibonacciHeapNode<E>;\n\n  /**\n   * Get the circular root list head.\n   * @remarks Time O(1), Space O(1)\n   * @returns Root node or undefined.\n   */\n\n  get root(): FibonacciHeapNode<E> | undefined {\n    return this._root;\n  }\n\n  protected _size = 0;\n  get size(): number {\n    return this._size;\n  }\n\n  protected _min?: FibonacciHeapNode<E>;\n\n  /**\n   * Get the current minimum node.\n   * @remarks Time O(1), Space O(1)\n   * @returns Min node or undefined.\n   */\n\n  get min(): FibonacciHeapNode<E> | undefined {\n    return this._min;\n  }\n\n  protected readonly _comparator: Comparator<E>;\n\n  get comparator(): Comparator<E> {\n    return this._comparator;\n  }\n\n  clear(): void {\n    this._root = undefined;\n    this._min = undefined;\n    this._size = 0;\n  }\n\n  add(element: E): boolean {\n    this.push(element);\n    return true;\n  }\n\n  /**\n   * Push an element into the root list.\n   * @remarks Time O(1) amortized, Space O(1)\n   * @param element - Element to insert.\n   * @returns This heap.\n   */\n\n  push(element: E): this {\n    const node = this.createNode(element);\n    node.left = node;\n    node.right = node;\n    this.mergeWithRoot(node);\n    if (!this.min || this.comparator(node.element, this.min.element) <= 0) this._min = node;\n    this._size++;\n    return this;\n  }\n\n  peek(): E | undefined {\n    return this.min ? this.min.element : undefined;\n  }\n\n  /**\n   * Collect nodes from a circular doubly linked list starting at head.\n   * @remarks Time O(K), Space O(K)\n   * @param [head] - Start node of the circular list.\n   * @returns Array of nodes from the list.\n   */\n\n  consumeLinkedList(head?: FibonacciHeapNode<E>): FibonacciHeapNode<E>[] {\n    const elements: FibonacciHeapNode<E>[] = [];\n    if (!head) return elements;\n    let node: FibonacciHeapNode<E> | undefined = head;\n    let started = false;\n    while (true) {\n      if (node === head && started) break;\n      else if (node === head) started = true;\n      elements.push(node!);\n      node = node!.right;\n    }\n    return elements;\n  }\n\n  /**\n   * Insert a node into a parent's child list (circular).\n   * @remarks Time O(1), Space O(1)\n   * @param parent - Parent node.\n   * @param node - Child node to insert.\n   * @returns void\n   */\n\n  mergeWithChild(parent: FibonacciHeapNode<E>, node: FibonacciHeapNode<E>): void {\n    if (!parent.child) parent.child = node;\n    else {\n      node.right = parent.child.right;\n      node.left = parent.child;\n      parent.child.right!.left = node;\n      parent.child.right = node;\n    }\n  }\n\n  poll(): E | undefined {\n    return this.pop();\n  }\n\n  /**\n   * Remove and return the minimum element, consolidating the root list.\n   * @remarks Time O(log N) amortized, Space O(1)\n   * @returns Minimum element or undefined.\n   */\n\n  pop(): E | undefined {\n    if (this._size === 0) return undefined;\n    const z = this.min!;\n    if (z.child) {\n      const elements = this.consumeLinkedList(z.child);\n      for (const node of elements) {\n        this.mergeWithRoot(node);\n        node.parent = undefined;\n      }\n    }\n    this.removeFromRoot(z);\n    if (z === z.right) {\n      this._min = undefined;\n      this._root = undefined;\n    } else {\n      this._min = z.right;\n      this._consolidate();\n    }\n    this._size--;\n    return z.element;\n  }\n\n  /**\n   * Meld another heap into this heap.\n   * @remarks Time O(1), Space O(1)\n   * @param heapToMerge - Another FibonacciHeap to meld into this one.\n   * @returns void\n   */\n\n  merge(heapToMerge: FibonacciHeap<E>): void {\n    if (heapToMerge.size === 0) return;\n    if (this.root && heapToMerge.root) {\n      const thisRoot = this.root,\n        otherRoot = heapToMerge.root;\n      const thisRootRight = thisRoot.right!,\n        otherRootLeft = otherRoot.left!;\n      thisRoot.right = otherRoot;\n      otherRoot.left = thisRoot;\n      thisRootRight.left = otherRootLeft;\n      otherRootLeft.right = thisRootRight;\n    } else if (!this.root && heapToMerge.root) {\n      this._root = heapToMerge.root;\n    }\n    if (!this.min || (heapToMerge.min && this.comparator(heapToMerge.min.element, this.min.element) < 0)) {\n      this._min = heapToMerge.min;\n    }\n    this._size += heapToMerge.size;\n    heapToMerge.clear();\n  }\n\n  createNode(element: E): FibonacciHeapNode<E> {\n    return new FibonacciHeapNode<E>(element);\n  }\n\n  isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  protected _defaultComparator(a: E, b: E): number {\n    if (a < b) return -1;\n    if (a > b) return 1;\n    return 0;\n  }\n\n  protected mergeWithRoot(node: FibonacciHeapNode<E>): void {\n    if (!this.root) this._root = node;\n    else {\n      node.right = this.root.right;\n      node.left = this.root;\n      this.root.right!.left = node;\n      this.root.right = node;\n    }\n  }\n\n  protected removeFromRoot(node: FibonacciHeapNode<E>): void {\n    if (this.root === node) this._root = node.right;\n    if (node.left) node.left.right = node.right;\n    if (node.right) node.right.left = node.left;\n  }\n\n  protected _link(y: FibonacciHeapNode<E>, x: FibonacciHeapNode<E>): void {\n    this.removeFromRoot(y);\n    y.left = y;\n    y.right = y;\n    this.mergeWithChild(x, y);\n    x.degree++;\n    y.parent = x;\n  }\n\n  protected _consolidate(): void {\n    const A: (FibonacciHeapNode<E> | undefined)[] = new Array(this._size);\n    const elements = this.consumeLinkedList(this.root);\n    let x: FibonacciHeapNode<E> | undefined,\n      y: FibonacciHeapNode<E> | undefined,\n      d: number,\n      t: FibonacciHeapNode<E> | undefined;\n\n    for (const node of elements) {\n      x = node;\n      d = x.degree;\n      while (A[d]) {\n        y = A[d] as FibonacciHeapNode<E>;\n        if (this.comparator(x.element, y.element) > 0) {\n          t = x;\n          x = y;\n          y = t;\n        }\n        this._link(y, x);\n        A[d] = undefined;\n        d++;\n      }\n      A[d] = x;\n    }\n\n    for (let i = 0; i < A.length; i++) {\n      if (A[i] && (!this.min || this.comparator(A[i]!.element, this.min.element) <= 0)) this._min = A[i]!;\n    }\n  }\n}\n","/**\n * data-structure-typed\n *\n * @author Kirk Qi\n * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>\n * @license MIT License\n */\n\nimport type { PriorityQueueOptions } from '../../types';\nimport { Heap } from '../heap';\n\n/**\n * @example\n * // Hospital emergency room triage\n *  interface Patient {\n *       name: string;\n *       severity: number; // 1 = critical, 5 = minor\n *     }\n *\n *     const er = new PriorityQueue<Patient>([], {\n *       comparator: (a, b) => a.severity - b.severity\n *     });\n *\n *     er.add({ name: 'Flu symptoms', severity: 4 });\n *     er.add({ name: 'Heart attack', severity: 1 });\n *     er.add({ name: 'Broken arm', severity: 3 });\n *     er.add({ name: 'Stroke', severity: 1 });\n *\n *     // Most critical patients first\n *     console.log(er.poll()?.severity); // 1;\n *     console.log(er.poll()?.severity); // 1;\n *     console.log(er.poll()?.severity); // 3;\n *     console.log(er.poll()?.severity); // 4;\n * @example\n * // Task scheduler with deadlines\n *  interface Task {\n *       name: string;\n *       deadline: number; // hours until due\n *     }\n *\n *     const scheduler = new PriorityQueue<Task>([], {\n *       comparator: (a, b) => a.deadline - b.deadline\n *     });\n *\n *     scheduler.add({ name: 'Report', deadline: 24 });\n *     scheduler.add({ name: 'Email', deadline: 2 });\n *     scheduler.add({ name: 'Meeting prep', deadline: 4 });\n *     scheduler.add({ name: 'Code review', deadline: 8 });\n *\n *     // Process most urgent first\n *     console.log(scheduler.peek()?.name); // 'Email';\n *     console.log(scheduler.size); // 4;\n *\n *     const order = [];\n *     while (scheduler.size > 0) {\n *       order.push(scheduler.poll()!.name);\n *     }\n *     console.log(order); // ['Email', 'Meeting prep', 'Code review', 'Report'];\n * @example\n * // Bandwidth allocation with priorities\n *  const bandwidth = new PriorityQueue<[number, string]>([], {\n *       comparator: (a, b) => a[0] - b[0]\n *     });\n *\n *     bandwidth.add([1, 'Video call']);     // highest priority\n *     bandwidth.add([3, 'File download']);\n *     bandwidth.add([2, 'Web browsing']);\n *     bandwidth.add([1, 'Voice call']);\n *\n *     // Allocate bandwidth to highest priority first\n *     console.log(bandwidth.poll()?.[1]); // 'Video call';\n *     console.log(bandwidth.poll()?.[1]); // 'Voice call';\n *     console.log(bandwidth.size); // 2;\n */\nexport class PriorityQueue<E = any, R = any> extends Heap<E, R> {\n  constructor(elements: Iterable<E> | Iterable<R> = [], options?: PriorityQueueOptions<E, R>) {\n    super(elements, options);\n  }\n}\n","/**\n * data-structure-typed\n *\n * @author Kirk Qi\n * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>\n * @license MIT License\n */\nimport type { PriorityQueueOptions } from '../../types';\nimport { PriorityQueue } from './priority-queue';\nimport { ERR, raise } from '../../common';\n\n/**\n * Max-oriented priority queue (max-heap) built on {@link PriorityQueue}.\n * The default comparator orders primitive values in descending order. If you store objects,\n * you must provide a custom comparator via {@link PriorityQueueOptions}.\n * @template E Element type stored in the queue.\n * @template R Extra record/metadata associated with each element.\n * @example\n * // Job scheduling by priority\n *  const jobs = new MaxPriorityQueue<number>();\n *\n *     jobs.add(3); // low priority\n *     jobs.add(7); // high priority\n *     jobs.add(5); // medium priority\n *     jobs.add(10); // critical\n *\n *     // Highest priority job first\n *     console.log(jobs.poll()); // 10;\n *     console.log(jobs.poll()); // 7;\n *     console.log(jobs.poll()); // 5;\n *     console.log(jobs.poll()); // 3;\n * @example\n * // Auction system with highest bid tracking\n *  interface Bid {\n *       bidder: string;\n *       amount: number;\n *     }\n *\n *     const auction = new MaxPriorityQueue<Bid>([], {\n *       comparator: (a, b) => b.amount - a.amount\n *     });\n *\n *     auction.add({ bidder: 'Alice', amount: 100 });\n *     auction.add({ bidder: 'Bob', amount: 250 });\n *     auction.add({ bidder: 'Charlie', amount: 175 });\n *\n *     // Current highest bid\n *     console.log(auction.peek()?.bidder); // 'Bob';\n *     console.log(auction.peek()?.amount); // 250;\n *\n *     // Process winning bid\n *     const winner = auction.poll()!;\n *     console.log(winner.bidder); // 'Bob';\n *     console.log(auction.peek()?.bidder); // 'Charlie';\n * @example\n * // CPU process scheduling\n *  const cpuQueue = new MaxPriorityQueue<[number, string]>([], {\n *       comparator: (a, b) => b[0] - a[0]\n *     });\n *\n *     cpuQueue.add([5, 'System process']);\n *     cpuQueue.add([1, 'Background task']);\n *     cpuQueue.add([8, 'User interaction']);\n *     cpuQueue.add([3, 'Network sync']);\n *\n *     const order = [];\n *     while (cpuQueue.size > 0) {\n *       order.push(cpuQueue.poll()![1]);\n *     }\n *     console.log(order); // [\n *  //      'User interaction',\n *  //      'System process',\n *  //      'Network sync',\n *  //      'Background task'\n *  //    ];\n */\nexport class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {\n  /**\n   * Creates a max-priority queue.\n   * @param elements Optional initial elements to insert.\n   * @param options Optional configuration (e.g., `comparator`, `toElementFn`).\n   * @throws {TypeError} Thrown when using the default comparator with object elements (provide a custom comparator).\n   * @remarks Complexity — Time: O(n log n) when inserting n elements incrementally; Space: O(n).\n   */\n  constructor(elements: Iterable<E> | Iterable<R> = [], options?: PriorityQueueOptions<E, R>) {\n    super(elements, {\n      comparator: (a: E, b: E): number => {\n        if (typeof a === 'object' || typeof b === 'object') {\n          raise(TypeError, ERR.comparatorRequired('MaxPriorityQueue'));\n        }\n        if (a < b) return 1;\n        if (a > b) return -1;\n        return 0;\n      },\n      ...options\n    });\n  }\n}\n"]}

package/dist/types/common/error.d.ts

@@ -1,3 +1,11 @@
+/**
+ * Centralized error dispatch.
+ * All library errors go through this function for consistent messaging and easy grep.
+ * @remarks Always throws — data structure errors are never recoverable.
+ * @param ErrorClass - The error constructor (Error, TypeError, RangeError, etc.)
+ * @param message - The error message.
+ */
+export declare function raise(ErrorClass: new (msg: string) => Error, message: string): never;
 /**
  * Centralized error message templates.
  * Keep using native Error/TypeError/RangeError — this only standardizes messages.
@@ -20,4 +28,5 @@ export declare const ERR: {
     readonly matrixNotSquare: () => string;
     readonly matrixNotRectangular: () => string;
     readonly matrixRowMismatch: (expected: number, got: number) => string;
+    readonly orderStatisticNotEnabled: (method: string, ctx?: string) => string;
 };

package/dist/types/common/index.d.ts

@@ -1,4 +1,4 @@
-export { ERR } from './error';
+export { ERR, raise } from './error';
 export declare enum DFSOperation {
     VISIT = 0,
     PROCESS = 1

package/dist/types/data-structures/base/index.d.ts

@@ -1,2 +1,3 @@
 export * from './iterable-entry-base';
 export * from './iterable-element-base';
+export * from './linear-base';

package/dist/types/data-structures/base/iterable-entry-base.d.ts

@@ -17,7 +17,7 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * @returns Iterator of `[K, V]`.
      * @remarks Time O(n) to iterate, Space O(1)
      */
-    [Symbol.iterator](...args: any[]): IterableIterator<[K, V]>;
+    [Symbol.iterator](...args: unknown[]): IterableIterator<[K, V]>;
     /**
      * Iterate over `[key, value]` pairs (may yield `undefined` values).
      * @returns Iterator of `[K, V | undefined]`.
@@ -43,7 +43,7 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * @returns `true` if all pass; otherwise `false`.
      * @remarks Time O(n), Space O(1)
      */
-    every(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
+    every(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): boolean;
     /**
      * Test whether any entry satisfies the predicate.
      * @param predicate - `(key, value, index, self) => boolean`.
@@ -51,14 +51,14 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * @returns `true` if any passes; otherwise `false`.
      * @remarks Time O(n), Space O(1)
      */
-    some(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
+    some(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): boolean;
     /**
      * Visit each entry, left-to-right.
      * @param callbackfn - `(key, value, index, self) => void`.
      * @param thisArg - Optional `this` for callback.
      * @remarks Time O(n), Space O(1)
      */
-    forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: any): void;
+    forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: unknown): void;
     /**
      * Find the first entry that matches a predicate.
      * @param callbackfn - `(key, value, index, self) => boolean`.
@@ -66,7 +66,7 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * @returns Matching `[key, value]` or `undefined`.
      * @remarks Time O(n), Space O(1)
      */
-    find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: any): [K, V] | undefined;
+    find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: unknown): [K, V] | undefined;
     /**
      * Whether the given key exists.
      * @param key - Key to test.
@@ -134,17 +134,17 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * Map entries using an implementation-specific strategy.
      * @remarks Time O(n), Space O(n)
      */
-    abstract map(...args: any[]): any;
+    abstract map(...args: unknown[]): unknown;
     /**
      * Filter entries and return the same-species structure.
      * @returns A new instance of the same concrete class (`this` type).
      * @remarks Time O(n), Space O(n)
      */
-    abstract filter(...args: any[]): this;
+    abstract filter(...args: unknown[]): this;
     /**
      * Underlying iterator for the default iteration protocol.
      * @returns Iterator of `[K, V]`.
      * @remarks Time O(n), Space O(1)
      */
-    protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
+    protected abstract _getIterator(...args: unknown[]): IterableIterator<[K, V]>;
 }

package/dist/types/data-structures/base/linear-base.d.ts

@@ -89,7 +89,7 @@ export declare abstract class LinearBase<E, R = any, NODE extends LinkedListNode
      * @returns Index or `-1`.
      * @remarks Time O(n), Space O(1)
      */
-    findIndex(predicate: ElementCallback<E, R, boolean>, thisArg?: any): number;
+    findIndex(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): number;
     /**
      * Concatenate elements and/or containers.
      * @param items - Elements or other containers.
@@ -228,7 +228,7 @@ export declare abstract class LinearBase<E, R = any, NODE extends LinkedListNode
      * @returns Iterator of elements from tail to head.
      * @remarks Time O(n), Space O(1)
      */
-    protected abstract _getReverseIterator(...args: any[]): IterableIterator<E>;
+    protected abstract _getReverseIterator(...args: unknown[]): IterableIterator<E>;
 }
 /**
  * Linked-list specialized linear container.
@@ -324,7 +324,7 @@ export declare abstract class LinearLinkedBase<E, R = any, NODE extends LinkedLi
      * @returns Iterator over nodes.
      * @remarks Time O(n), Space O(1)
      */
-    protected abstract _getNodeIterator(...args: any[]): IterableIterator<NODE>;
+    protected abstract _getNodeIterator(...args: unknown[]): IterableIterator<NODE>;
     /**
      * Get previous node of a given node.
      * @param node - Current node.