@develia/commons 0.4.24 → 0.4.26

package/dist/web/collections/from.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"from.js","sourceRoot":"","sources":["../../../src/collections/from.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,YAAY,EAAE,OAAO,EAAC,MAAM,iBAAiB,CAAC;AACtD,OAAO,YAAY,MAAM,sBAAsB,CAAC;AAChD,OAAO,KAAK,MAAM,aAAa,CAAC;AAGhC;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,IAAI,CAAI,MAA2C;IACvE,IAAI,MAAM,IAAI,IAAI;QACd,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACvC,IAAI,OAAO,MAAM,KAAK,UAAU;QAC5B,OAAO,IAAI,CAAC,EAAE,CAAI,MAAM,CAAC,CAAC;IAC9B,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAI,MAAM,CAAC,CAAC;IACpC,CAAC;SAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,IAAI;IAEb;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,GAAQ;QACzB,OAAO,IAAI,IAAI,CAAyB;YACpC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;IACP,CAAC;IAKD,YAAsB,EAAyB;QAC3C,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,EAAE,CAAI,QAA+B;QAC/C,OAAO,IAAI,IAAI,CAAI,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACI,OAAO;QACV,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,QAAQ,CAAI,QAAqB;QAC3C,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,IAAI,CAAC;YACf,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAI,MAA2B;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,CAAC;IAGD;;;;OAIG;IACI,GAAG,CAAC,SAAuB;QAC9B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,SAAwB;QAC/B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,SAAwB;QAEjC,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,MAAM,EAAE,CAAC;YACb,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,SAAuB;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClB,MAAM,IAAI,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAQ;QACpB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAGD;;;;OAIG;IACI,KAAK,CAAC,SAAwB;QAEjC,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,6CAA6C;YAC7C,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,SAAwB;QAElC,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,IAAI,MAAM,GAAa,IAAI,CAAC;QAE5B,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClB,IAAI,KAAK,EAAE,CAAC;wBACR,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;oBAChE,CAAC;oBACD,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM,GAAG,IAAI,CAAC;gBAClB,CAAC;YACL,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,6CAA6C;YAC7C,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,KAAK,EAAE,CAAC;oBACR,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;gBAChE,CAAC;gBACD,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM,GAAG,IAAI,CAAC;YAClB,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAAO;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,OAAO,CAAC;YAClB,CAAC;YACD,MAAM,IAAI,CAAC;QACf,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,IAAO;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,MAAM,IAAI,CAAC;YACX,KAAK,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,OAAO,CAAC;YAClB,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,EAAE,CAAC,KAAa;QACnB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,GAAG,EAAE,KAAK,KAAK,EAAE,CAAC;gBAClB,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,SAAwB;QAGhC,IAAI,IAAI,GAAkB,SAAS,CAAC;QAEpC,IAAI,SAAS;YACT,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,IAAI,GAAG,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;aACA,CAAC;YACF,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,GAAG,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,OAAO,CAAI,MAAqC;QACnD,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;gBAC7B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;oBAC7B,MAAM,OAAO,CAAC;gBAClB,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAA;IACN,CAAC;IAED;;;OAGG;IACI,OAAO;QACV,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,IAAI,GAAkB,IAAI,CAAC;gBAC/B,KAAK,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;oBACvB,MAAM,OAAO,CAAA;gBACjB,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,MAAiC;QACxC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,IAAI,MAAM;YACN,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;;YAED,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,KAAK,IAAI,IAAc,CAAC;YAC5B,CAAC;QACL,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,MAAiC;QACxC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,IAAI,MAAM;YACN,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtB,KAAK,EAAE,CAAC;YACZ,CAAC;;YAED,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,KAAK,IAAI,IAAc,CAAC;gBACxB,KAAK,EAAE,CAAC;YACZ,CAAC;QACL,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,MAAgC;QACvC,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;QACpC,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,MAAgC;QACvC,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;QACpC,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,MAAgC;QACzC,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpB,IAAI,OAAsB,CAAC;QAC3B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;gBACd,GAAG,GAAG,KAAK,CAAC;gBACZ,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,MAAgC;QACzC,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,IAAI,OAAsB,CAAC;QAC3B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;gBACd,GAAG,GAAG,KAAK,CAAC;gBACZ,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,OAAO,CAAI,MAA2B,EAAE,QAAe,KAAK,CAAC,SAAS;QACzE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QACrC,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,CAAC,CAAC,CAAC;QACP,CAAC;aAAM,IAAI,KAAK,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzB,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,CAAC,CAAC,CAAC;QACP,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACI,OAAO,CAAO,WAAmC,EAAE,gBAAyC;QAE/F,gBAAgB,GAAG,CAAC,gBAAgB,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;QAChF,MAAM,IAAI,GAAG,IAAI,CAAC;QAElB,OAAO,IAAI,CAAC,EAAE,CAAoB,QAAQ,CAAC;YACvC,MAAM,MAAM,GAAuB,EAAE,CAAC;YACtC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;gBAC9B,IAAI,KAAK,GAAG,KAAK,CAAC;gBAClB,KAAK,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;oBACnC,IAAI,gBAAgB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAClC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACjB,KAAK,GAAG,IAAI,CAAC;wBACb,MAAM;oBACV,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACL,CAAC;YACD,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,QAAQ,CAAU,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS;QAEjB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;oBACd,MAAM,IAAI,CAAC;gBACf,CAAC;qBAAM,CAAC;oBACJ,OAAO;gBACX,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS;QAEjB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,CAAC,KAAK,EAAE,CAAC;gBACnB,CAAC;YACL,CAAC;YACD,KAAK,CAAC,CAAC,MAAM,CAAC;QAClB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACI,OAAO,CAAC,MAAmB;QAC9B,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,OAAO;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CAAI,WAAuD,EAAE,aAAkC;QAC1G,MAAM,MAAM,GAAwC,EAAE,CAAC;QAEvD,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAe,WAAmC,EAAE,aAAuC;QACnG,MAAM,GAAG,GAAG,IAAI,GAAG,EAAY,CAAC;QAEhC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAClC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAGD;;;;OAIG;IACI,WAAW,CAAC,IAAY;QAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,IAAiC;QAClD,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;gBAC1B,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,WAAiC;QAE7C,IAAI,WAAW,IAAI,IAAI;YACnB,WAAW,GAAG,YAAY,CAAC;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YAEvB,MAAM,QAAQ,GAAG,EAAE,CAAC;YAEpB,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;oBAC1D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACpB,MAAM,IAAI,CAAC;gBACf,CAAC;YACL,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,IAAO,EAAE,KAAa;QAEhC,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;oBACd,MAAM,IAAI,CAAC;oBACX,QAAQ,GAAG,IAAI,CAAC;gBACpB,CAAC;gBACD,MAAM,YAAY,CAAC;gBACnB,CAAC,EAAE,CAAC;YACR,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACZ,MAAM,IAAI,CAAC;YACf,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACT,MAAM,IAAI,CAAC;gBACf,CAAC;gBACD,CAAC,EAAE,CAAC;YACR,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAGD;;;;OAIG;IACI,KAAK,CAAC,KAAkB;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,QAAQ,CAAC;YACvB,KAAK,CAAC,CAAC,IAAI,CAAC;YACZ,KAAK,CAAC,CAAC,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;;OAQG;IACI,SAAS,CAAY,KAAmB,EAAE,eAAoC,EAAE,gBAAsC,EAAE,cAAkD;QAE7K,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAK,GAAG,EAAE;YACpB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAS,CAAC;YACpC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACrB,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;iBACV,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;iBACrD,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC;QAC3F,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;;OAQG;IACI,QAAQ,CAAU,KAAkB,EAAE,eAAoC,EAAE,gBAAqC,EAAE,cAA4D;QAElL,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,GAAG,EAAE;YACnB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAQ,CAAC;YACnC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACrB,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrG,CAAC,CAAC,CAAC;IACP,CAAC;IAGD;;;;;;;;OAQG;IACI,aAAa,CAAU,KAAkB,EAAE,eAAoC,EAAE,gBAAqC,EAAE,cAAwD;QAEnL,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,GAAG,EAAE;YACnB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAe,CAAC;YAC3C,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACrB,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBAC7B,CAAC;gBACD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5G,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;;OAQG;IACI,cAAc,CAAU,KAAkB,EAAE,eAAoC,EAAE,gBAAqC,EAAE,cAAwD;QAEpL,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,GAAG,EAAE;YACnB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe,CAAC;YAC1C,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;gBAClC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBAC5B,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,UAAU,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAC7G,CAAC,CAAC,CAAC;IACP,CAAC;IAGD;;;;;;;;OAQG;IACI,SAAS,CAAU,KAAkB,EAAE,eAAoC,EAAE,gBAAqC,EAAE,cAA4D;QAEnL,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC,EAAE,CAAI,GAAG,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAC;YAClC,KAAK,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACpB,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/C,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACtG,CAAC,CAAC,CAAC;IACP,CAAC;CAEJ;AAED;;;GAGG;AACH,MAAM,OAAO,QAAkB,SAAQ,IAAO;IAI1C;;OAEG;IACH,IAAW,GAAG;QACV,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,YAAmB,GAAS,EAAE,MAAgB;QAC1C,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IACpB,CAAC;CACJ","sourcesContent":["import type {Consumer, EqualityComparer, UnaryFunction, Predicate, Supplier} from \"../types.js\";\nimport {shallowEqual, toPairs} from \"../utilities.js\";\nimport KeyValuePair from \"../key-value-pair.js\";\nimport Order from \"../order.js\";\n\n\n/**\n * Creates a new From instance from an Iterable or a Supplier of an Iterable.\n * @template T - The type of elements in the source.\n * @param {Iterable<T> | Supplier<Iterable<T>>} source - The source data.\n * @returns {From<T> | From<KeyValuePair<any, any>>} A new From instance.\n * @throws {Error} If source is null or invalid.\n */\nexport default function from<T>(source: Iterable<T> | Supplier<Iterable<T>>): From<T> | From<KeyValuePair<any, any>> {\n    if (source == null)\n        throw new Error(\"Source is null.\");\n    if (typeof source === 'function')\n        return From.fn<T>(source);\n    if (typeof source[Symbol.iterator] === 'function') {\n        return From.iterable<T>(source);\n    } else if (typeof source === 'object') {\n        return From.object(source);\n    }\n\n    throw new Error(\"Invalid source.\");\n}\n\n/**\n * A LINQ-like wrapper for iterables that provides various transformation and query methods.\n * @template T - The type of elements in the sequence.\n */\nexport class From<T> implements Iterable<T> {\n\n    /**\n     * Creates a From instance from an object's entries.\n     * @param {any} obj - The object to convert to pairs.\n     * @returns {From<KeyValuePair<any, any>>} A From instance of key-value pairs.\n     */\n    public static object(obj: any): From<KeyValuePair<any, any>> {\n        return new From<KeyValuePair<any, any>>(function () {\n            return toPairs(obj);\n        });\n    }\n\n\n    private readonly _fn: Supplier<Iterable<T>>\n\n    protected constructor(fn: Supplier<Iterable<T>>) {\n        this._fn = fn;\n    }\n\n    /**\n     * Creates a From instance from a supplier function.\n     * @template T\n     * @param {Supplier<Iterable<T>>} callable - A function that returns an Iterable.\n     * @returns {From<T>} A new From instance.\n     */\n    public static fn<T>(callable: Supplier<Iterable<T>>): From<T> {\n        return new From<T>(callable);\n    }\n\n    /**\n     * Collects all elements into an array and returns a new From instance from it.\n     * Useful for freezing the sequence and preventing multiple iterations over a generator.\n     * @returns {From<T>} A new From instance with cached data.\n     */\n    public collect(): From<T> {\n        const cache = Array.from(this);\n        return From.iterable(cache);\n    }\n\n    /**\n     * Creates a From instance from an Iterable.\n     * @template T\n     * @param {Iterable<T>} iterable - The source iterable.\n     * @returns {From<T>} A new From instance.\n     */\n    public static iterable<T>(iterable: Iterable<T>): From<T> {\n        return From.fn<T>(function* () {\n            for (const item of iterable) {\n                yield item;\n            }\n        });\n    }\n\n    /**\n     * Maps each element of the sequence into a new form.\n     * @template R\n     * @param {UnaryFunction<T, R>} mapper - A transformation function.\n     * @returns {From<R>} A new From instance with the mapped elements.\n     */\n    public map<R>(mapper: UnaryFunction<T, R>): From<R> {\n        const self = this;\n        return From.fn<R>(function* () {\n            for (let item of self) {\n                yield mapper(item);\n            }\n        });\n    }\n\n    * [Symbol.iterator](): Iterator<T> {\n        yield* this._fn();\n    }\n\n\n    /**\n     * Checks if all elements in the sequence satisfy the given predicate.\n     * @param {Predicate<T>} predicate - A function to test each element.\n     * @returns {boolean} True if all elements satisfy the predicate.\n     */\n    public all(predicate: Predicate<T>): boolean {\n        for (let item of this._fn()) {\n            if (!predicate(item)) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    /**\n     * Checks if any element in the sequence satisfies the given predicate.\n     * If no predicate is provided, checks if the sequence is not empty.\n     * @param {Predicate<T>} [predicate] - A function to test each element.\n     * @returns {boolean} True if any element satisfies the predicate.\n     */\n    public any(predicate?: Predicate<T>): boolean {\n        for (let item of this) {\n            if (predicate == null || predicate(item)) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    /**\n     * Gets the number of elements in the sequence.\n     * @returns {number} The count of elements.\n     */\n    public get length(): number {\n        return this.count();\n    }\n\n    /**\n     * Counts the number of elements that satisfy the given predicate.\n     * If no predicate is provided, counts all elements.\n     * @param {Predicate<T>} [predicate] - A function to test each element.\n     * @returns {number} The count of elements.\n     */\n    public count(predicate?: Predicate<T>): number {\n\n        let output = 0;\n\n        for (let item of this) {\n            if (predicate == null || predicate(item)) {\n                output++;\n            }\n        }\n\n        return output;\n    }\n\n    /**\n     * Filters the sequence based on a predicate.\n     * @param {Predicate<T>} predicate - A function to test each element.\n     * @returns {From<T>} A new From instance with the filtered elements.\n     */\n    public filter(predicate: Predicate<T>): From<T> {\n        const self = this;\n        return From.fn<T>(function* () {\n            for (let item of self) {\n                if (predicate(item)) {\n                    yield item;\n                }\n            }\n        });\n    }\n\n    /**\n     * Checks if the sequence contains a specific value.\n     * @param {T} value - The value to search for.\n     * @returns {boolean} True if the value is found.\n     */\n    public contains(value: T): boolean {\n        for (let item of this) {\n            if (item === value) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n\n    /**\n     * Returns the first element of the sequence that satisfies a condition.\n     * @param {Predicate<T>} [predicate] - Optional condition.\n     * @returns {T | undefined} The first element or undefined.\n     */\n    public first(predicate?: Predicate<T>): T | undefined {\n\n        if (predicate) {\n            for (let item of this) {\n                if (predicate(item)) {\n                    return item;\n                }\n            }\n        } else {\n            // noinspection LoopStatementThatDoesntLoopJS\n            for (let item of this) {\n                return item;\n            }\n        }\n\n        return undefined;\n    }\n\n    /**\n     * Returns the only element of the sequence that satisfies a condition, or throws if more than one exists.\n     * @param {Predicate<T>} [predicate] - Optional condition.\n     * @returns {T | null} The single element or null if not found.\n     * @throws {Error} If more than one element is found.\n     */\n    public single(predicate?: Predicate<T>): T | null {\n\n        let found = false;\n        let output: T | null = null;\n\n        if (predicate) {\n            for (let item of this) {\n                if (predicate(item)) {\n                    if (found) {\n                        throw new Error(\"Sequence contains more than one element.\");\n                    }\n                    found = true;\n                    output = item;\n                }\n            }\n        } else {\n            // noinspection LoopStatementThatDoesntLoopJS\n            for (let item of this) {\n                if (found) {\n                    throw new Error(\"Sequence contains more than one element.\");\n                }\n                found = true;\n                output = item;\n            }\n        }\n\n        return output;\n    }\n\n    /**\n     * Appends an item to the end of the sequence.\n     * @param {T} item - The item to append.\n     * @returns {From<T>} A new From instance.\n     */\n    public append(item: T): From<T> {\n        const self = this;\n        return From.fn<T>(function* () {\n            for (let element of self) {\n                yield element;\n            }\n            yield item;\n        });\n    }\n\n    /**\n     * Prepends an item to the beginning of the sequence.\n     * @param {T} item - The item to prepend.\n     * @returns {From<T>} A new From instance.\n     */\n    public prepend(item: T): From<T> {\n        const self = this;\n        return From.fn<T>(function* () {\n            yield item;\n            for (let element of self) {\n                yield element;\n            }\n        });\n    }\n\n    /**\n     * Gets the element at a specific index.\n     * @param {number} index - The zero-based index.\n     * @returns {T | undefined} The element at the index or undefined.\n     */\n    public at(index: number): T | undefined {\n        let idx = 0;\n        for (let item of this) {\n            if (idx++ === index) {\n                return item;\n            }\n        }\n        return undefined;\n    }\n\n    /**\n     * Returns the last element of the sequence that satisfies a condition.\n     * @param {Predicate<T>} [predicate] - Optional condition.\n     * @returns {T | undefined} The last element or undefined.\n     */\n    public last(predicate?: Predicate<T>): T | undefined {\n\n\n        let last: T | undefined = undefined;\n\n        if (predicate)\n            for (let item of this) {\n                if (!predicate || predicate(item)) {\n                    last = item;\n                }\n            }\n        else {\n            for (let item of this) {\n                last = item;\n            }\n        }\n        return last;\n    }\n\n    /**\n     * Projects each element of a sequence to an Iterable and flattens the resulting sequences into one sequence.\n     * @template R\n     * @param {UnaryFunction<T, Iterable<R>>} mapper - A transformation function.\n     * @returns {From<R>} A new From instance.\n     */\n    public mapMany<R>(mapper: UnaryFunction<T, Iterable<R>>): From<R> {\n        const self = this;\n        return From.fn(function* () {\n            for (const item of self) {\n                const subitems = mapper(item)\n                for (const subitem of subitems) {\n                    yield subitem;\n                }\n            }\n        })\n    }\n\n    /**\n     * Flattens a sequence of iterables.\n     * @returns {From<any>} A new From instance.\n     */\n    public flatten(): From<any> {\n        const self = this;\n        return From.fn<T>(function* () {\n            for (let item of self) {\n                let temp = <Iterable<any>>item;\n                for (let subitem of temp) {\n                    yield subitem\n                }\n            }\n        });\n    }\n\n    /**\n     * Calculates the sum of the elements in the sequence.\n     * @param {UnaryFunction<T, number>} [mapper] - Optional projection function.\n     * @returns {number} The sum.\n     */\n    public sum(mapper?: UnaryFunction<T, number>): number {\n        let total = 0;\n\n        if (mapper)\n            for (let item of this) {\n                total += mapper(item);\n            }\n        else\n            for (let item of this) {\n                total += item as number;\n            }\n        return total;\n    }\n\n    /**\n     * Calculates the average of the elements in the sequence.\n     * @param {UnaryFunction<T, number>} [mapper] - Optional projection function.\n     * @returns {number} The average.\n     */\n    public avg(mapper?: UnaryFunction<T, number>): number {\n        let total = 0;\n        let count = 0;\n\n        if (mapper)\n            for (let item of this) {\n                total += mapper(item);\n                count++;\n            }\n        else\n            for (let item of this) {\n                total += item as number;\n                count++;\n            }\n        return count > 0 ? total / count : 0;\n    }\n\n    /**\n     * Returns the maximum value in the sequence.\n     * @param {UnaryFunction<T, number>} mapper - Projection function.\n     * @returns {number} The maximum value.\n     */\n    public max(mapper: UnaryFunction<T, number>): number {\n        let max = -Infinity;\n        for (let item of this) {\n            let value = mapper(item);\n            max = value > max ? value : max;\n        }\n        return max;\n    }\n\n    /**\n     * Returns the minimum value in the sequence.\n     * @param {UnaryFunction<T, number>} mapper - Projection function.\n     * @returns {number} The minimum value.\n     */\n    public min(mapper: UnaryFunction<T, number>): number {\n        let min = Infinity;\n        for (let item of this) {\n            let value = mapper(item);\n            min = value < min ? value : min;\n        }\n        return min;\n    }\n\n    /**\n     * Returns the element with the maximum value.\n     * @param {UnaryFunction<T, number>} mapper - Projection function.\n     * @returns {T | undefined} The element with the maximum value.\n     */\n    public maxBy(mapper: UnaryFunction<T, number>): T | undefined {\n        let max = -Infinity;\n        let maxItem: T | undefined;\n        for (let item of this) {\n            let value = mapper(item);\n            if (value > max) {\n                max = value;\n                maxItem = item;\n            }\n        }\n        return maxItem;\n    }\n\n    /**\n     * Returns the element with the minimum value.\n     * @param {UnaryFunction<T, number>} mapper - Projection function.\n     * @returns {T | undefined} The element with the minimum value.\n     */\n    public minBy(mapper: UnaryFunction<T, number>): T | undefined {\n        let min = Infinity;\n        let minItem: T | undefined;\n        for (let item of this) {\n            let value = mapper(item);\n            if (value < min) {\n                min = value;\n                minItem = item;\n            }\n        }\n        return minItem;\n    }\n\n    /**\n     * Sorts the elements of the sequence.\n     * @template R\n     * @param {UnaryFunction<T, R>} mapper - Projection function for the key to sort by.\n     * @param {Order} [order] - Ascending or Descending.\n     * @returns {From<T>} A new From instance.\n     */\n    public orderBy<R>(mapper: UnaryFunction<T, R>, order: Order = Order.Ascending): From<T> {\n        const array = Array.from(this._fn());\n        if (order == Order.Ascending) {\n            array.sort((a, b) => {\n                const aValue = mapper(a);\n                const bValue = mapper(b);\n                return aValue > bValue ? 1 : bValue > aValue ? -1 : 0;\n            });\n        } else if (order == Order.Descending) {\n            array.sort((a, b) => {\n                const aValue = mapper(a);\n                const bValue = mapper(b);\n                return aValue > bValue ? 1 : bValue < aValue ? -1 : 0;\n            });\n        } else {\n            throw new Error(\"invalid order argument\");\n        }\n\n        return From.iterable(array);\n    }\n\n    /**\n     * Groups the elements of the sequence.\n     * @template TKey\n     * @param {UnaryFunction<T, TKey>} keySelector - Function to extract the key for each element.\n     * @param {EqualityComparer<TKey>} [equalityComparer] - Optional comparer for keys.\n     * @returns {From<Grouping<TKey, T>>} A new From instance.\n     */\n    public groupBy<TKey>(keySelector: UnaryFunction<T, TKey>, equalityComparer?: EqualityComparer<TKey>): From<Grouping<TKey, T>> {\n\n        equalityComparer = (equalityComparer == null ? shallowEqual : equalityComparer);\n        const self = this;\n\n        return From.fn<Grouping<TKey, T>>(function* () {\n            const groups: Array<[TKey, T[]]> = [];\n            for (let item of self) {\n                const key = keySelector(item);\n                let found = false;\n                for (let [entryKey, group] of groups) {\n                    if (equalityComparer(key, entryKey)) {\n                        group.push(item);\n                        found = true;\n                        break;\n                    }\n                }\n                if (!found) {\n                    groups.push([key, [item]]);\n                }\n            }\n            yield* groups.map(([key, values]) => new Grouping<TKey, T>(key, values));\n        });\n    }\n\n    /**\n     * Returns a specified number of contiguous elements from the start of the sequence.\n     * @param {number} n - The number of elements to return.\n     * @returns {From<T>} A new From instance.\n     */\n    public head(n: number): From<T> {\n\n        const self = this;\n        return From.fn<T>(function* () {\n            let count = 0;\n            for (let item of self) {\n                if (count++ < n) {\n                    yield item;\n                } else {\n                    return;\n                }\n            }\n        });\n    }\n\n    /**\n     * Returns a specified number of contiguous elements from the end of the sequence.\n     * @param {number} n - The number of elements to return.\n     * @returns {From<T>} A new From instance.\n     */\n    public tail(n: number): From<T> {\n\n        const self = this;\n        return From.fn<T>(function* () {\n            let buffer = [];\n            for (let item of self) {\n                buffer.push(item);\n                if (buffer.length > n) {\n                    buffer.shift();\n                }\n            }\n            yield* buffer;\n        });\n    }\n\n    /**\n     * Performs the specified action on each element of the sequence.\n     * @param {Consumer<T>} action - The action to perform.\n     */\n    public forEach(action: Consumer<T>): void {\n        for (let item of this) {\n            action(item);\n        }\n    }\n\n    /**\n     * Converts the sequence to an array.\n     * @returns {T[]} The array.\n     */\n    public toArray(): T[] {\n        return Array.from(this);\n    }\n\n    /**\n     * Converts the sequence to a record.\n     * @template R\n     * @param {UnaryFunction<T, string | symbol | number>} keySelector - Key selector.\n     * @param {UnaryFunction<T, R>} valueSelector - Value selector.\n     * @returns {Record<string | symbol | number, R>} The record.\n     */\n    public toRecord<R>(keySelector: UnaryFunction<T, string | symbol | number>, valueSelector: UnaryFunction<T, R>): Record<string | symbol | number, R> {\n        const output: Record<string | symbol | number, R> = {};\n\n        for (let item of this) {\n            output[keySelector(item)] = valueSelector(item);\n        }\n        return output;\n    }\n\n    /**\n     * Converts the sequence to a Map.\n     * @template RKey, RValue\n     * @param {UnaryFunction<T, RKey>} keySelector - Key selector.\n     * @param {UnaryFunction<T, RValue>} valueSelector - Value selector.\n     * @returns {Map<RKey, RValue>} The map.\n     */\n    public toMap<RKey, RValue>(keySelector: UnaryFunction<T, RKey>, valueSelector: UnaryFunction<T, RValue>): Map<RKey, RValue> {\n        const map = new Map<any, any>();\n\n        for (let item of this) {\n            const key = keySelector(item);\n            const value = valueSelector(item);\n            map.set(key, value);\n        }\n\n        return map;\n    }\n\n\n    /**\n     * Returns elements that are instances of a specific primitive type.\n     * @param {string} type - The type string (e.g., 'string', 'number').\n     * @returns {From<T>} A new From instance.\n     */\n    public instancesOf(type: string): From<T> {\n        return this.filter(item => typeof item === type);\n    }\n\n    /**\n     * Checks if all elements are instances of a specific class.\n     * @param {new (...args: any[]) => any} type - The class constructor.\n     * @returns {boolean} True if all elements are instances of the type.\n     */\n    public allInstanceOf(type: new (...args: any[]) => any): boolean {\n        for (let item of this) {\n            if (!(item instanceof type)) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    /**\n     * Returns distinct elements from the sequence.\n     * @param {EqualityComparer<T>} [eq_comparer] - Optional equality comparer.\n     * @returns {From<T>} A new From instance.\n     */\n    public distinct(eq_comparer?: EqualityComparer<T>): From<T> {\n\n        if (eq_comparer == null)\n            eq_comparer = shallowEqual;\n\n        const self = this;\n        return From.fn<T>(function* () {\n\n            const included = [];\n\n            for (let item of self) {\n                if (!From.iterable(included).any(x => eq_comparer(x, item))) {\n                    included.push(item);\n                    yield item;\n                }\n            }\n        });\n    }\n\n    /**\n     * Inserts an item at a specific index.\n     * @param {T} item - The item to insert.\n     * @param {number} index - The zero-based index.\n     * @returns {From<T>} A new From instance.\n     */\n    public insert(item: T, index: number): From<T> {\n\n        const self = this;\n        return From.fn<T>(function* () {\n            let i = 0;\n            let inserted = false;\n            for (let existingItem of self) {\n                if (i === index) {\n                    yield item;\n                    inserted = true;\n                }\n                yield existingItem;\n                i++;\n            }\n            if (!inserted) {\n                yield item;\n            }\n        });\n    }\n\n    /**\n     * Bypasses a specified number of elements in a sequence and then returns the remaining elements.\n     * @param {number} n - The number of elements to skip.\n     * @returns {From<T>} A new From instance.\n     */\n    public skip(n: number): From<T> {\n        const self = this;\n        return From.fn<T>(function* () {\n            let i = 0;\n            for (let item of self) {\n                if (i >= n) {\n                    yield item;\n                }\n                i++;\n            }\n        });\n    }\n\n\n    /**\n     * Concatenates two sequences.\n     * @param {Iterable<T>} other - The other sequence.\n     * @returns {From<T>} A new From instance.\n     */\n    public union(other: Iterable<T>): From<T> {\n        const self = this;\n        return From.fn<T>(function* () {\n            yield* self;\n            yield* other;\n        });\n    }\n\n    /**\n     * Correlates the elements of two sequences based on matching keys.\n     * @template T2, R, R2\n     * @param {Iterable<T2>} other - The other sequence.\n     * @param {UnaryFunction<T, R>} thisKeySelector - Key selector for this sequence.\n     * @param {UnaryFunction<T2, R>} otherKeySelector - Key selector for the other sequence.\n     * @param {(thisItem: T, otherItem: T2) => R2} resultSelector - Function to create a result element from two matching elements.\n     * @returns {From<R2>} A new From instance.\n     */\n    public innerJoin<T2, R, R2>(other: Iterable<T2>, thisKeySelector: UnaryFunction<T, R>, otherKeySelector: UnaryFunction<T2, R>, resultSelector: (thisItem: T, otherItem: T2) => R2): From<R2> {\n\n        const self = this;\n        return From.fn<R2>(() => {\n            const otherByKey = new Map<R, T2>();\n            for (let item of other) {\n                otherByKey.set(otherKeySelector(item), item);\n            }\n            return Array.from(self)\n                        .filter(item => otherByKey.has(thisKeySelector(item)))\n                        .map(item => resultSelector(item, otherByKey.get(thisKeySelector(item))!));\n        });\n    }\n\n    /**\n     * Performs a left join on two sequences.\n     * @template U, K, R\n     * @param {Iterable<U>} other - The other sequence.\n     * @param {UnaryFunction<T, K>} thisKeySelector - Key selector for this sequence.\n     * @param {UnaryFunction<U, K>} otherKeySelector - Key selector for the other sequence.\n     * @param {(thisItem: T, otherItem: U | undefined) => R} resultSelector - Function to create a result element.\n     * @returns {From<R>} A new From instance.\n     */\n    public leftJoin<U, K, R>(other: Iterable<U>, thisKeySelector: UnaryFunction<T, K>, otherKeySelector: UnaryFunction<U, K>, resultSelector: (thisItem: T, otherItem: U | undefined) => R): From<R> {\n\n        const self = this;\n        return From.fn<R>(() => {\n            const otherByKey = new Map<K, U>();\n            for (let item of other) {\n                otherByKey.set(otherKeySelector(item), item);\n            }\n            return Array.from(self).map(item => resultSelector(item, otherByKey.get(thisKeySelector(item))));\n        });\n    }\n\n\n    /**\n     * Performs a left group join on two sequences.\n     * @template U, K, R\n     * @param {Iterable<U>} other - The other sequence.\n     * @param {UnaryFunction<T, K>} thisKeySelector - Key selector for this sequence.\n     * @param {UnaryFunction<U, K>} otherKeySelector - Key selector for the other sequence.\n     * @param {(thisItem: T, otherItems: Array<U>) => R} resultSelector - Function to create a result element.\n     * @returns {From<R>} A new From instance.\n     */\n    public leftGroupJoin<U, K, R>(other: Iterable<U>, thisKeySelector: UnaryFunction<T, K>, otherKeySelector: UnaryFunction<U, K>, resultSelector: (thisItem: T, otherItems: Array<U>) => R): From<R> {\n\n        const self = this;\n        return From.fn<R>(() => {\n            const otherByKeys = new Map<K, Array<U>>();\n            for (let item of other) {\n                const key = otherKeySelector(item);\n                if (!otherByKeys.has(key)) {\n                    otherByKeys.set(key, []);\n                }\n                otherByKeys.get(key)!.push(item);\n            }\n            return Array.from(self).map(item => resultSelector(item, otherByKeys.get(thisKeySelector(item)) || []));\n        });\n    }\n\n    /**\n     * Performs a right group join on two sequences.\n     * @template U, K, R\n     * @param {Iterable<U>} other - The other sequence.\n     * @param {UnaryFunction<T, K>} thisKeySelector - Key selector for this sequence.\n     * @param {UnaryFunction<U, K>} otherKeySelector - Key selector for the other sequence.\n     * @param {(thisItems: Array<T>, otherItem: U) => R} resultSelector - Function to create a result element.\n     * @returns {From<R>} A new From instance.\n     */\n    public rightGroupJoin<U, K, R>(other: Iterable<U>, thisKeySelector: UnaryFunction<T, K>, otherKeySelector: UnaryFunction<U, K>, resultSelector: (thisItems: Array<T>, otherItem: U) => R): From<R> {\n\n        const self = this;\n        return From.fn<R>(() => {\n            const thisByKeys = new Map<K, Array<T>>();\n            for (let item of self) {\n                const key = thisKeySelector(item);\n                if (!thisByKeys.has(key)) {\n                    thisByKeys.set(key, []);\n                }\n                thisByKeys.get(key)!.push(item);\n            }\n            return Array.from(other).map(item => resultSelector(thisByKeys.get(otherKeySelector(item)) || [], item));\n        });\n    }\n\n\n    /**\n     * Performs a right join on two sequences.\n     * @template U, K, R\n     * @param {Iterable<U>} other - The other sequence.\n     * @param {UnaryFunction<T, K>} thisKeySelector - Key selector for this sequence.\n     * @param {UnaryFunction<U, K>} otherKeySelector - Key selector for the other sequence.\n     * @param {(thisItem: T | undefined, otherItem: U) => R} resultSelector - Function to create a result element.\n     * @returns {From<R>} A new From instance.\n     */\n    public rightJoin<U, K, R>(other: Iterable<U>, thisKeySelector: UnaryFunction<T, K>, otherKeySelector: UnaryFunction<U, K>, resultSelector: (thisItem: T | undefined, otherItem: U) => R): From<R> {\n\n        const self = this;\n        return From.fn<R>(() => {\n            const thisByKey = new Map<K, T>();\n            for (let item of self) {\n                thisByKey.set(thisKeySelector(item), item);\n            }\n            return Array.from(other).map(item => resultSelector(thisByKey.get(otherKeySelector(item)), item));\n        });\n    }\n\n}\n\n/**\n * Represents a group of elements that have a common key.\n * @template TKey, T\n */\nexport class Grouping<TKey, T> extends From<T> {\n\n    private readonly _key: TKey;\n\n    /**\n     * Gets the key of the group.\n     */\n    public get key(): TKey {\n        return this._key;\n    }\n\n    /**\n     * @param {TKey} key - The group key.\n     * @param {Array<T>} values - The values in the group.\n     */\n    public constructor(key: TKey, values: Array<T>) {\n        super(() => values);\n        this._key = key;\n    }\n}"]}

package/dist/web/collections/index.js

@@ -1,5 +0,0 @@
-export { default as DefaultWeakMap } from './default-weak-map.js';
-export { default as DefaultMap } from './default-map.js';
-export { default as CacheDictionary } from './cache-dictionary.js';
-export { default as from } from './from.js';
-//# sourceMappingURL=index.js.map

package/dist/web/collections/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,OAAO,IAAI,cAAc,EAAC,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAC,OAAO,IAAI,UAAU,EAAC,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAC,OAAO,IAAI,eAAe,EAAC,MAAM,uBAAuB,CAAC;AACjE,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC","sourcesContent":["export {default as DefaultWeakMap} from './default-weak-map.js';\nexport {default as DefaultMap} from './default-map.js';\nexport {default as CacheDictionary} from './cache-dictionary.js';\nexport {default as from} from './from.js';"]}

package/dist/web/debouncer.js

@@ -1,118 +0,0 @@
-var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
-    if (kind === "m") throw new TypeError("Private method is not writable");
-    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
-    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
-    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
-};
-var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
-    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
-    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
-    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
-};
-var _Debouncer_instances, _Debouncer_controller, _Debouncer_delayMs, _Debouncer_onSchedule, _Debouncer_onStart, _Debouncer_onSuccess, _Debouncer_onCancel, _Debouncer_onError, _Debouncer_onIdle, _Debouncer_run, _Debouncer_becomeIdle;
-import { delay } from "./utilities.js";
-import { noop } from "./functions.js";
-/**
- * Keeps at most one live task.
- * Scheduling a new task cancels the previous one, whether it was still
- * waiting or already running.
- *
- * @example
- * ```ts
- * const debouncer = new Debouncer({delayMs: 1500});
- *
- * debouncer.schedule(async (signal) => {
- *     const reply = await callAI(messages, {signal});
- *     if (signal.aborted) return;
- *     await sendReply(reply);
- * });
- * ```
- */
-class Debouncer {
-    constructor(options) {
-        _Debouncer_instances.add(this);
-        _Debouncer_controller.set(this, void 0);
-        _Debouncer_delayMs.set(this, void 0);
-        _Debouncer_onSchedule.set(this, void 0);
-        _Debouncer_onStart.set(this, void 0);
-        _Debouncer_onSuccess.set(this, void 0);
-        _Debouncer_onCancel.set(this, void 0);
-        _Debouncer_onError.set(this, void 0);
-        _Debouncer_onIdle.set(this, void 0);
-        assertValidDelay(options.delayMs);
-        __classPrivateFieldSet(this, _Debouncer_delayMs, options.delayMs, "f");
-        __classPrivateFieldSet(this, _Debouncer_onSchedule, options.onSchedule ?? noop, "f");
-        __classPrivateFieldSet(this, _Debouncer_onStart, options.onStart ?? noop, "f");
-        __classPrivateFieldSet(this, _Debouncer_onSuccess, options.onSuccess ?? noop, "f");
-        __classPrivateFieldSet(this, _Debouncer_onCancel, options.onCancel ?? noop, "f");
-        __classPrivateFieldSet(this, _Debouncer_onError, options.onError ?? console.error, "f");
-        __classPrivateFieldSet(this, _Debouncer_onIdle, options.onIdle ?? noop, "f");
-    }
-    /** Whether a task is waiting or running. */
-    get isPending() {
-        return __classPrivateFieldGet(this, _Debouncer_controller, "f") !== undefined;
-    }
-    /**
-     * Schedule `task`, cancelling any previous task.
-     *
-     * @param task - The task to run once the delay elapses.
-     * @param delayMs - Wait for this task only. Defaults to the configured `delayMs`.
-     */
-    schedule(task, delayMs = __classPrivateFieldGet(this, _Debouncer_delayMs, "f")) {
-        assertValidDelay(delayMs);
-        if (__classPrivateFieldGet(this, _Debouncer_controller, "f") !== undefined) {
-            __classPrivateFieldGet(this, _Debouncer_controller, "f").abort();
-            __classPrivateFieldGet(this, _Debouncer_onCancel, "f").call(this);
-        }
-        const controller = new AbortController();
-        __classPrivateFieldSet(this, _Debouncer_controller, controller, "f");
-        __classPrivateFieldGet(this, _Debouncer_onSchedule, "f").call(this);
-        void __classPrivateFieldGet(this, _Debouncer_instances, "m", _Debouncer_run).call(this, task, delayMs, controller);
-    }
-    /** Cancel the current task, if any. */
-    cancel() {
-        if (__classPrivateFieldGet(this, _Debouncer_controller, "f") === undefined) {
-            return;
-        }
-        __classPrivateFieldGet(this, _Debouncer_controller, "f").abort();
-        __classPrivateFieldGet(this, _Debouncer_onCancel, "f").call(this);
-        __classPrivateFieldGet(this, _Debouncer_instances, "m", _Debouncer_becomeIdle).call(this);
-    }
-}
-_Debouncer_controller = new WeakMap(), _Debouncer_delayMs = new WeakMap(), _Debouncer_onSchedule = new WeakMap(), _Debouncer_onStart = new WeakMap(), _Debouncer_onSuccess = new WeakMap(), _Debouncer_onCancel = new WeakMap(), _Debouncer_onError = new WeakMap(), _Debouncer_onIdle = new WeakMap(), _Debouncer_instances = new WeakSet(), _Debouncer_run = async function _Debouncer_run(task, delayMs, controller) {
-    const signal = controller.signal;
-    try {
-        await delay(delayMs, signal);
-        __classPrivateFieldGet(this, _Debouncer_onStart, "f").call(this);
-        await task(signal);
-        if (!signal.aborted) {
-            __classPrivateFieldGet(this, _Debouncer_onSuccess, "f").call(this);
-        }
-    }
-    catch (error) {
-        if (!signal.aborted) {
-            __classPrivateFieldGet(this, _Debouncer_onError, "f").call(this, error);
-        }
-    }
-    finally {
-        // A replaced or cancelled task must not touch the current state.
-        if (__classPrivateFieldGet(this, _Debouncer_controller, "f") === controller) {
-            __classPrivateFieldGet(this, _Debouncer_instances, "m", _Debouncer_becomeIdle).call(this);
-        }
-    }
-}, _Debouncer_becomeIdle = function _Debouncer_becomeIdle() {
-    __classPrivateFieldSet(this, _Debouncer_controller, undefined, "f");
-    __classPrivateFieldGet(this, _Debouncer_onIdle, "f").call(this);
-};
-export default Debouncer;
-/**
- * Throw a `RangeError` unless `delayMs` is a finite number >= 0.
- *
- * @internal Shared with `KeyedDebouncer`; not part of the public API.
- */
-export function assertValidDelay(delayMs) {
-    if (!Number.isFinite(delayMs) || delayMs < 0) {
-        throw new RangeError(`delayMs must be a number >= 0 (received: ${delayMs})`);
-    }
-}
-//# sourceMappingURL=debouncer.js.map

package/dist/web/debouncer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"debouncer.js","sourceRoot":"","sources":["../../src/debouncer.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,gBAAgB,CAAC;AACrC,OAAO,EAAC,IAAI,EAAC,MAAM,gBAAgB,CAAC;AA0BpC;;;;;;;;;;;;;;;GAeG;AACH,MAAqB,SAAS;IAU1B,YAAY,OAAyB;;QATrC,wCAAyC;QAChC,qCAAiB;QACjB,wCAAwB;QACxB,qCAAqB;QACrB,uCAAuB;QACvB,sCAAsB;QACtB,qCAAmC;QACnC,oCAAoB;QAGzB,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,uBAAA,IAAI,sBAAY,OAAO,CAAC,OAAO,MAAA,CAAC;QAChC,uBAAA,IAAI,yBAAe,OAAO,CAAC,UAAU,IAAI,IAAI,MAAA,CAAC;QAC9C,uBAAA,IAAI,sBAAY,OAAO,CAAC,OAAO,IAAI,IAAI,MAAA,CAAC;QACxC,uBAAA,IAAI,wBAAc,OAAO,CAAC,SAAS,IAAI,IAAI,MAAA,CAAC;QAC5C,uBAAA,IAAI,uBAAa,OAAO,CAAC,QAAQ,IAAI,IAAI,MAAA,CAAC;QAC1C,uBAAA,IAAI,sBAAY,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,KAAK,MAAA,CAAC;QACjD,uBAAA,IAAI,qBAAW,OAAO,CAAC,MAAM,IAAI,IAAI,MAAA,CAAC;IAC1C,CAAC;IAED,4CAA4C;IAC5C,IAAI,SAAS;QACT,OAAO,uBAAA,IAAI,6BAAY,KAAK,SAAS,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,IAAmB,EAAE,UAAkB,uBAAA,IAAI,0BAAS;QACzD,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,uBAAA,IAAI,6BAAY,KAAK,SAAS,EAAE,CAAC;YACjC,uBAAA,IAAI,6BAAY,CAAC,KAAK,EAAE,CAAC;YACzB,uBAAA,IAAI,2BAAU,MAAd,IAAI,CAAY,CAAC;QACrB,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,uBAAA,IAAI,yBAAe,UAAU,MAAA,CAAC;QAC9B,uBAAA,IAAI,6BAAY,MAAhB,IAAI,CAAc,CAAC;QACnB,KAAK,uBAAA,IAAI,4CAAK,MAAT,IAAI,EAAM,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IAC9C,CAAC;IAED,uCAAuC;IACvC,MAAM;QACF,IAAI,uBAAA,IAAI,6BAAY,KAAK,SAAS,EAAE,CAAC;YACjC,OAAO;QACX,CAAC;QACD,uBAAA,IAAI,6BAAY,CAAC,KAAK,EAAE,CAAC;QACzB,uBAAA,IAAI,2BAAU,MAAd,IAAI,CAAY,CAAC;QACjB,uBAAA,IAAI,mDAAY,MAAhB,IAAI,CAAc,CAAC;IACvB,CAAC;CA2BJ;+VAzBG,KAAK,yBAAM,IAAmB,EAAE,OAAe,EAAE,UAA2B;IACxE,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;IACjC,IAAI,CAAC;QACD,MAAM,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC7B,uBAAA,IAAI,0BAAS,MAAb,IAAI,CAAW,CAAC;QAChB,MAAM,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YAClB,uBAAA,IAAI,4BAAW,MAAf,IAAI,CAAa,CAAC;QACtB,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YAClB,uBAAA,IAAI,0BAAS,MAAb,IAAI,EAAU,KAAK,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;YAAS,CAAC;QACP,iEAAiE;QACjE,IAAI,uBAAA,IAAI,6BAAY,KAAK,UAAU,EAAE,CAAC;YAClC,uBAAA,IAAI,mDAAY,MAAhB,IAAI,CAAc,CAAC;QACvB,CAAC;IACL,CAAC;AACL,CAAC;IAGG,uBAAA,IAAI,yBAAe,SAAS,MAAA,CAAC;IAC7B,uBAAA,IAAI,yBAAQ,MAAZ,IAAI,CAAU,CAAC;AACnB,CAAC;eA/EgB,SAAS;AAkF9B;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC5C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAAC,4CAA4C,OAAO,GAAG,CAAC,CAAC;IACjF,CAAC;AACL,CAAC","sourcesContent":["import {delay} from \"./utilities.js\";\nimport {noop} from \"./functions.js\";\n\n/**\n * Cancellable task. It must honour `signal`: pass it to fetch/SDKs and check\n * `signal.aborted` before producing irreversible side effects.\n */\nexport type DebouncedTask = (signal: AbortSignal) => Promise<void>;\n\n/** Options accepted by {@link Debouncer}. */\nexport interface DebouncerOptions {\n    /** Default wait, in milliseconds, before a task is executed. */\n    delayMs: number;\n    /** Called every time a task is scheduled, after any previous task has been cancelled. */\n    onSchedule?: () => void;\n    /** Called when the wait elapses and the task is about to run. */\n    onStart?: () => void;\n    /** Called when a task completes without throwing and without being cancelled. */\n    onSuccess?: () => void;\n    /** Called when a live task is cancelled, either by {@link Debouncer.cancel} or by being replaced. */\n    onCancel?: () => void;\n    /** Receives task errors. Cancellations never reach this callback. Defaults to `console.error`. */\n    onError?: (error: unknown) => void;\n    /** Called every time the debouncer goes from busy to idle. */\n    onIdle?: () => void;\n}\n\n/**\n * Keeps at most one live task.\n * Scheduling a new task cancels the previous one, whether it was still\n * waiting or already running.\n *\n * @example\n * ```ts\n * const debouncer = new Debouncer({delayMs: 1500});\n *\n * debouncer.schedule(async (signal) => {\n *     const reply = await callAI(messages, {signal});\n *     if (signal.aborted) return;\n *     await sendReply(reply);\n * });\n * ```\n */\nexport default class Debouncer {\n    #controller: AbortController | undefined;\n    readonly #delayMs: number;\n    readonly #onSchedule: () => void;\n    readonly #onStart: () => void;\n    readonly #onSuccess: () => void;\n    readonly #onCancel: () => void;\n    readonly #onError: (error: unknown) => void;\n    readonly #onIdle: () => void;\n\n    constructor(options: DebouncerOptions) {\n        assertValidDelay(options.delayMs);\n        this.#delayMs = options.delayMs;\n        this.#onSchedule = options.onSchedule ?? noop;\n        this.#onStart = options.onStart ?? noop;\n        this.#onSuccess = options.onSuccess ?? noop;\n        this.#onCancel = options.onCancel ?? noop;\n        this.#onError = options.onError ?? console.error;\n        this.#onIdle = options.onIdle ?? noop;\n    }\n\n    /** Whether a task is waiting or running. */\n    get isPending(): boolean {\n        return this.#controller !== undefined;\n    }\n\n    /**\n     * Schedule `task`, cancelling any previous task.\n     *\n     * @param task - The task to run once the delay elapses.\n     * @param delayMs - Wait for this task only. Defaults to the configured `delayMs`.\n     */\n    schedule(task: DebouncedTask, delayMs: number = this.#delayMs): void {\n        assertValidDelay(delayMs);\n        if (this.#controller !== undefined) {\n            this.#controller.abort();\n            this.#onCancel();\n        }\n\n        const controller = new AbortController();\n        this.#controller = controller;\n        this.#onSchedule();\n        void this.#run(task, delayMs, controller);\n    }\n\n    /** Cancel the current task, if any. */\n    cancel(): void {\n        if (this.#controller === undefined) {\n            return;\n        }\n        this.#controller.abort();\n        this.#onCancel();\n        this.#becomeIdle();\n    }\n\n    async #run(task: DebouncedTask, delayMs: number, controller: AbortController): Promise<void> {\n        const signal = controller.signal;\n        try {\n            await delay(delayMs, signal);\n            this.#onStart();\n            await task(signal);\n            if (!signal.aborted) {\n                this.#onSuccess();\n            }\n        } catch (error) {\n            if (!signal.aborted) {\n                this.#onError(error);\n            }\n        } finally {\n            // A replaced or cancelled task must not touch the current state.\n            if (this.#controller === controller) {\n                this.#becomeIdle();\n            }\n        }\n    }\n\n    #becomeIdle(): void {\n        this.#controller = undefined;\n        this.#onIdle();\n    }\n}\n\n/**\n * Throw a `RangeError` unless `delayMs` is a finite number >= 0.\n *\n * @internal Shared with `KeyedDebouncer`; not part of the public API.\n */\nexport function assertValidDelay(delayMs: number): void {\n    if (!Number.isFinite(delayMs) || delayMs < 0) {\n        throw new RangeError(`delayMs must be a number >= 0 (received: ${delayMs})`);\n    }\n}\n"]}

package/dist/web/draft.js

@@ -1,222 +0,0 @@
-const DRAFT_MATERIALIZE = Symbol("draft.materialize");
-function isDraftValue(value) {
-    return value !== null &&
-        typeof value === "object" &&
-        typeof value[DRAFT_MATERIALIZE] === "function";
-}
-function materializeDraftValue(value) {
-    if (isDraftValue(value))
-        return value[DRAFT_MATERIALIZE]();
-    if (value === null || typeof value !== "object")
-        return value;
-    const objectValue = value;
-    if (objectValue instanceof Date)
-        return new Date(objectValue);
-    if (objectValue instanceof RegExp)
-        return new RegExp(objectValue);
-    if (objectValue instanceof Map) {
-        const copy = new Map();
-        for (const [k, v] of objectValue) {
-            copy.set(materializeDraftValue(k), materializeDraftValue(v));
-        }
-        return copy;
-    }
-    if (objectValue instanceof Set) {
-        const copy = new Set();
-        for (const v of objectValue) {
-            copy.add(materializeDraftValue(v));
-        }
-        return copy;
-    }
-    const copy = Array.isArray(objectValue)
-        ? []
-        : Object.create(Object.getPrototypeOf(objectValue));
-    for (const key of Reflect.ownKeys(objectValue)) {
-        copy[key] = materializeDraftValue(objectValue[key]);
-    }
-    return copy;
-}
-// ─────────────────────────────────────────────
-// deepDraft (internal)
-// ─────────────────────────────────────────────
-/**
- * Recursively wrap a value so that nested objects/arrays become child drafts
- * linked to a parent. Primitives, `Date`, `RegExp`, `Map` and `Set` instances
- * are cloned but not wrapped.
- *
- * @param value - The value to process.
- * @param parentLink - Optional link to a parent draft for change propagation.
- * @returns A drafted value (or a plain clone for non-wrappable types).
- */
-function deepDraft(value, parentLink) {
-    if (value === null || typeof value !== "object")
-        return value;
-    if (value instanceof Date)
-        return new Date(value);
-    if (value instanceof RegExp)
-        return new RegExp(value);
-    if (value instanceof Map) {
-        const copy = new Map();
-        for (const [k, v] of value) {
-            copy.set(deepDraft(k), deepDraft(v));
-        }
-        return copy;
-    }
-    if (value instanceof Set) {
-        const copy = new Set();
-        for (const v of value) {
-            copy.add(deepDraft(v));
-        }
-        return copy;
-    }
-    return draft(value, parentLink);
-}
-/**
- * Create a draft proxy over `original`. The proxy exposes the same properties
- * as the original (with nested objects wrapped as child drafts) plus the
- * control methods `commit`, `rollback`, `isModified`, `modifiedProps` and
- * `setModified`.
- *
- * Mutations on the draft do not affect the original until `commit()` is called.
- * Nested mutations bubble up: modifying a deep property marks every ancestor
- * draft as modified at the corresponding key.
- *
- * @template T - The shape of the wrapped object.
- * @param original - The object to wrap. It will only be mutated on `commit()`.
- * @param parentLink - Internal link used when this draft is a child of another.
- *                     Do not pass manually.
- * @returns A draft proxy over a deep copy of `original`.
- */
-export default function draft(original, parentLink) {
-    const copy = Array.isArray(original)
-        ? []
-        : Object.create(Object.getPrototypeOf(original));
-    const touched = new Set();
-    const notifyParent = (modified) => {
-        if (parentLink) {
-            parentLink.parent.setModified(parentLink.keyInParent, modified);
-        }
-    };
-    /**
-     * Apply commit for a single key: delegate to the child draft if present,
-     * otherwise copy the value into `original`.
-     */
-    const applyCommit = (key) => {
-        const val = copy[key];
-        if (isDraftValue(val)) {
-            val.commit();
-            original[key] = materializeDraftValue(val);
-            return;
-        }
-        if (key in copy) {
-            original[key] = copy[key];
-        }
-        else {
-            delete original[key];
-        }
-    };
-    /**
-     * Apply rollback for a single key: delegate to the child draft if present,
-     * otherwise restore the value from `original`.
-     */
-    const applyRollback = (key) => {
-        if (key in original) {
-            copy[key] = deepDraft(original[key], {
-                parent: methods,
-                keyInParent: key,
-            });
-        }
-        else {
-            delete copy[key];
-        }
-    };
-    const methods = {
-        commit(key) {
-            if (key === undefined) {
-                for (const k of touched)
-                    applyCommit(k);
-                touched.clear();
-                notifyParent(false);
-                return;
-            }
-            if (!touched.has(key))
-                return false;
-            applyCommit(key);
-            touched.delete(key);
-            if (touched.size === 0)
-                notifyParent(false);
-            return true;
-        },
-        rollback(key) {
-            if (key === undefined) {
-                for (const k of touched)
-                    applyRollback(k);
-                touched.clear();
-                notifyParent(false);
-                return;
-            }
-            if (!touched.has(key))
-                return false;
-            applyRollback(key);
-            touched.delete(key);
-            if (touched.size === 0)
-                notifyParent(false);
-            return true;
-        },
-        isModified(key) {
-            return key === undefined ? touched.size > 0 : touched.has(key);
-        },
-        modifiedProps() {
-            return [...touched];
-        },
-        setModified(key, modified = true) {
-            if (modified) {
-                touched.add(key);
-                notifyParent(true);
-            }
-            else {
-                touched.delete(key);
-                if (touched.size === 0)
-                    notifyParent(false);
-            }
-        },
-    };
-    const isMethodKey = (prop) => typeof prop === "string" && prop in methods;
-    // Populate `copy` with child drafts linked to this draft.
-    for (const key of Reflect.ownKeys(original)) {
-        copy[key] = deepDraft(original[key], {
-            parent: methods,
-            keyInParent: key,
-        });
-    }
-    return new Proxy(copy, {
-        get(target, prop, receiver) {
-            if (prop === DRAFT_MATERIALIZE)
-                return () => materializeDraftValue(target);
-            if (isMethodKey(prop))
-                return methods[prop];
-            return Reflect.get(target, prop, receiver);
-        },
-        set(target, prop, value, receiver) {
-            if (isMethodKey(prop)) {
-                throw new Error(`"${String(prop)}" is a reserved draft property`);
-            }
-            const wrapped = deepDraft(value, {
-                parent: methods,
-                keyInParent: prop,
-            });
-            touched.add(prop);
-            notifyParent(true);
-            return Reflect.set(target, prop, wrapped, receiver);
-        },
-        deleteProperty(target, prop) {
-            if (isMethodKey(prop)) {
-                throw new Error(`"${String(prop)}" is a reserved draft property`);
-            }
-            touched.add(prop);
-            notifyParent(true);
-            return Reflect.deleteProperty(target, prop);
-        },
-    });
-}
-//# sourceMappingURL=draft.js.map

package/dist/web/draft.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"draft.js","sourceRoot":"","sources":["../../src/draft.ts"],"names":[],"mappings":"AAuEA,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;AAMtD,SAAS,YAAY,CAAC,KAAU;IAC5B,OAAO,KAAK,KAAK,IAAI;QACjB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,CAAC,iBAAiB,CAAC,KAAK,UAAU,CAAC;AACvD,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAU;IACrC,IAAI,YAAY,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;IAC3D,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE9D,MAAM,WAAW,GAAG,KAAY,CAAC;IACjC,IAAI,WAAW,YAAY,IAAI;QAAE,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9D,IAAI,WAAW,YAAY,MAAM;QAAE,OAAO,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC;IAElE,IAAI,WAAW,YAAY,GAAG,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,WAAW,YAAY,GAAG,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,IAAI,GAAQ,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;QACxC,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;IAExD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,GAAG,CAAC,GAAG,qBAAqB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,gDAAgD;AAChD,uBAAuB;AACvB,gDAAgD;AAEhD;;;;;;;;GAQG;AACH,SAAS,SAAS,CAAC,KAAU,EAAE,UAAuB;IAClD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,YAAY,MAAM;QAAE,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;IAEtD,IAAI,KAAK,YAAY,GAAG,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,IAAI,KAAK,YAAY,GAAG,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,OAAO,UAAU,KAAK,CACzB,QAAW,EACX,UAAuB;IAEvB,MAAM,IAAI,GAAQ,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QACrC,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;IAErD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAe,CAAC;IAEvC,MAAM,YAAY,GAAG,CAAC,QAAiB,EAAQ,EAAE;QAC7C,IAAI,UAAU,EAAE,CAAC;YACb,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACpE,CAAC;IACL,CAAC,CAAC;IAEF;;;OAGG;IACH,MAAM,WAAW,GAAG,CAAC,GAAgB,EAAQ,EAAE;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,MAAM,EAAE,CAAC;YACZ,QAAgB,CAAC,GAAG,CAAC,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;YACpD,OAAO;QACX,CAAC;QACD,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YACb,QAAgB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACJ,OAAQ,QAAgB,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;IACL,CAAC,CAAC;IACF;;;OAGG;IACH,MAAM,aAAa,GAAG,CAAC,GAAgB,EAAQ,EAAE;QAC7C,IAAI,GAAG,IAAI,QAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAE,QAAgB,CAAC,GAAG,CAAC,EAAE;gBAC1C,MAAM,EAAE,OAAO;gBACf,WAAW,EAAE,GAAG;aACnB,CAAC,CAAC;QACP,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,OAAO,GAAoB;QAC7B,MAAM,CAAC,GAAG;YACN,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,WAAW,CAAC,CAAC,CAAC,CAAC;gBACxC,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,YAAY,CAAC,KAAK,CAAC,CAAC;gBACpB,OAAO;YACX,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YACpC,WAAW,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;gBAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,QAAQ,CAAC,GAAG;YACR,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC1C,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,YAAY,CAAC,KAAK,CAAC,CAAC;gBACpB,OAAO;YACX,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YACpC,aAAa,CAAC,GAAG,CAAC,CAAC;YACnB,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;gBAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,UAAU,CAAC,GAAG;YACV,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnE,CAAC;QAED,aAAa;YACT,OAAO,CAAC,GAAG,OAAO,CAAgB,CAAC;QACvC,CAAC;QAED,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;YAC5B,IAAI,QAAQ,EAAE,CAAC;gBACX,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACJ,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;oBAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;KACJ,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,IAAiB,EAAiC,EAAE,CACrE,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,IAAI,OAAO,CAAC;IAEhD,0DAA0D;IAC1D,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1C,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAE,QAAgB,CAAC,GAAG,CAAC,EAAE;YAC1C,MAAM,EAAE,OAAO;YACf,WAAW,EAAE,GAAG;SACnB,CAAC,CAAC;IACP,CAAC;IAED,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE;QACnB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;YACtB,IAAI,IAAI,KAAK,iBAAiB;gBAAE,OAAO,GAAG,EAAE,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;YAC3E,IAAI,WAAW,CAAC,IAAI,CAAC;gBAAE,OAAQ,OAAe,CAAC,IAAI,CAAC,CAAC;YACrD,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;QAED,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ;YAC7B,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;YACtE,CAAC;YACD,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAE;gBAC7B,MAAM,EAAE,OAAO;gBACf,WAAW,EAAE,IAAI;aACpB,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,YAAY,CAAC,IAAI,CAAC,CAAC;YACnB,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACxD,CAAC;QAED,cAAc,CAAC,MAAM,EAAE,IAAI;YACvB,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;YACtE,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,YAAY,CAAC,IAAI,CAAC,CAAC;YACnB,OAAO,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChD,CAAC;KACJ,CAAa,CAAC;AACnB,CAAC","sourcesContent":["/**\n * Methods injected into a draft proxy in addition to the original object's properties.\n *\n * @template T - The shape of the wrapped object.\n */\ntype DraftMethods<T> = {\n    /**\n     * Apply pending changes to the original object.\n     *\n     * @param key - Optional property key. If provided, commits only that property.\n     *              If omitted, commits every modified property recursively.\n     * @returns `true` when a single-property commit was applied,\n     *          `false` when the property was not modified,\n     *          `void` when committing the whole draft.\n     */\n    commit(key?: keyof T): boolean | void;\n\n    /**\n     * Discard pending changes, restoring values from the original object.\n     *\n     * @param key - Optional property key. If provided, rolls back only that property.\n     *              If omitted, rolls back every modified property recursively.\n     * @returns `true` when a single-property rollback was applied,\n     *          `false` when the property was not modified,\n     *          `void` when rolling back the whole draft.\n     */\n    rollback(key?: keyof T): boolean | void;\n\n    /**\n     * Check whether the draft (or a specific property) has pending changes.\n     *\n     * @param key - Optional property key. If omitted, checks the whole draft.\n     * @returns `true` if there are pending changes.\n     */\n    isModified(key?: keyof T): boolean;\n\n    /**\n     * Get the list of property keys with pending changes at this draft level.\n     *\n     * @returns Array of modified property keys (does not recurse into children).\n     */\n    modifiedProps(): (keyof T)[];\n\n    /**\n     * Manually mark (or unmark) a property as modified.\n     * Primarily used by child drafts to notify their parent, but also\n     * available for advanced manual control.\n     *\n     * @param key - Property key to flag.\n     * @param modified - `true` to mark as modified (default), `false` to clear.\n     */\n    setModified(key: keyof T, modified?: boolean): void;\n};\n\n/**\n * A draft proxy: the original object's properties plus draft control methods.\n *\n * @template T - The shape of the wrapped object.\n */\nexport type Draft<T extends object> = T & DraftMethods<T>;\n\n/**\n * Link from a child draft to its parent, used to propagate modification status.\n */\ntype ParentLink = {\n    /** Parent draft methods reference (we only need `setModified`). */\n    parent: { setModified(key: PropertyKey, modified?: boolean): void };\n    /** Key under which this draft is stored in the parent. */\n    keyInParent: PropertyKey;\n};\n\nconst DRAFT_MATERIALIZE = Symbol(\"draft.materialize\");\n\ntype InternalDraft = Draft<any> & {\n    [DRAFT_MATERIALIZE]: () => any;\n};\n\nfunction isDraftValue(value: any): value is InternalDraft {\n    return value !== null &&\n        typeof value === \"object\" &&\n        typeof value[DRAFT_MATERIALIZE] === \"function\";\n}\n\nfunction materializeDraftValue(value: any): any {\n    if (isDraftValue(value)) return value[DRAFT_MATERIALIZE]();\n    if (value === null || typeof value !== \"object\") return value;\n\n    const objectValue = value as any;\n    if (objectValue instanceof Date) return new Date(objectValue);\n    if (objectValue instanceof RegExp) return new RegExp(objectValue);\n\n    if (objectValue instanceof Map) {\n        const copy = new Map();\n        for (const [k, v] of objectValue) {\n            copy.set(materializeDraftValue(k), materializeDraftValue(v));\n        }\n        return copy;\n    }\n\n    if (objectValue instanceof Set) {\n        const copy = new Set();\n        for (const v of objectValue) {\n            copy.add(materializeDraftValue(v));\n        }\n        return copy;\n    }\n\n    const copy: any = Array.isArray(objectValue)\n        ? []\n        : Object.create(Object.getPrototypeOf(objectValue));\n\n    for (const key of Reflect.ownKeys(objectValue)) {\n        copy[key] = materializeDraftValue(objectValue[key]);\n    }\n\n    return copy;\n}\n\n// ─────────────────────────────────────────────\n// deepDraft (internal)\n// ─────────────────────────────────────────────\n\n/**\n * Recursively wrap a value so that nested objects/arrays become child drafts\n * linked to a parent. Primitives, `Date`, `RegExp`, `Map` and `Set` instances\n * are cloned but not wrapped.\n *\n * @param value - The value to process.\n * @param parentLink - Optional link to a parent draft for change propagation.\n * @returns A drafted value (or a plain clone for non-wrappable types).\n */\nfunction deepDraft(value: any, parentLink?: ParentLink): any {\n    if (value === null || typeof value !== \"object\") return value;\n    if (value instanceof Date) return new Date(value);\n    if (value instanceof RegExp) return new RegExp(value);\n\n    if (value instanceof Map) {\n        const copy = new Map();\n        for (const [k, v] of value) {\n            copy.set(deepDraft(k), deepDraft(v));\n        }\n        return copy;\n    }\n    if (value instanceof Set) {\n        const copy = new Set();\n        for (const v of value) {\n            copy.add(deepDraft(v));\n        }\n        return copy;\n    }\n\n    return draft(value, parentLink);\n}\n\n/**\n * Create a draft proxy over `original`. The proxy exposes the same properties\n * as the original (with nested objects wrapped as child drafts) plus the\n * control methods `commit`, `rollback`, `isModified`, `modifiedProps` and\n * `setModified`.\n *\n * Mutations on the draft do not affect the original until `commit()` is called.\n * Nested mutations bubble up: modifying a deep property marks every ancestor\n * draft as modified at the corresponding key.\n *\n * @template T - The shape of the wrapped object.\n * @param original - The object to wrap. It will only be mutated on `commit()`.\n * @param parentLink - Internal link used when this draft is a child of another.\n *                     Do not pass manually.\n * @returns A draft proxy over a deep copy of `original`.\n */\nexport default function draft<T extends object>(\n    original: T,\n    parentLink?: ParentLink\n): Draft<T> {\n    const copy: any = Array.isArray(original)\n        ? []\n        : Object.create(Object.getPrototypeOf(original));\n\n    const touched = new Set<PropertyKey>();\n\n    const notifyParent = (modified: boolean): void => {\n        if (parentLink) {\n            parentLink.parent.setModified(parentLink.keyInParent, modified);\n        }\n    };\n\n    /**\n     * Apply commit for a single key: delegate to the child draft if present,\n     * otherwise copy the value into `original`.\n     */\n    const applyCommit = (key: PropertyKey): void => {\n        const val = copy[key];\n        if (isDraftValue(val)) {\n            val.commit();\n            (original as any)[key] = materializeDraftValue(val);\n            return;\n        }\n        if (key in copy) {\n            (original as any)[key] = copy[key];\n        } else {\n            delete (original as any)[key];\n        }\n    };\n    /**\n     * Apply rollback for a single key: delegate to the child draft if present,\n     * otherwise restore the value from `original`.\n     */\n    const applyRollback = (key: PropertyKey): void => {\n        if (key in original) {\n            copy[key] = deepDraft((original as any)[key], {\n                parent: methods,\n                keyInParent: key,\n            });\n        } else {\n            delete copy[key];\n        }\n    };\n\n    const methods: DraftMethods<T> = {\n        commit(key) {\n            if (key === undefined) {\n                for (const k of touched) applyCommit(k);\n                touched.clear();\n                notifyParent(false);\n                return;\n            }\n            if (!touched.has(key)) return false;\n            applyCommit(key);\n            touched.delete(key);\n            if (touched.size === 0) notifyParent(false);\n            return true;\n        },\n\n        rollback(key) {\n            if (key === undefined) {\n                for (const k of touched) applyRollback(k);\n                touched.clear();\n                notifyParent(false);\n                return;\n            }\n            if (!touched.has(key)) return false;\n            applyRollback(key);\n            touched.delete(key);\n            if (touched.size === 0) notifyParent(false);\n            return true;\n        },\n\n        isModified(key) {\n            return key === undefined ? touched.size > 0 : touched.has(key);\n        },\n\n        modifiedProps() {\n            return [...touched] as (keyof T)[];\n        },\n\n        setModified(key, modified = true) {\n            if (modified) {\n                touched.add(key);\n                notifyParent(true);\n            } else {\n                touched.delete(key);\n                if (touched.size === 0) notifyParent(false);\n            }\n        },\n    };\n\n    const isMethodKey = (prop: PropertyKey): prop is keyof DraftMethods<T> =>\n        typeof prop === \"string\" && prop in methods;\n\n    // Populate `copy` with child drafts linked to this draft.\n    for (const key of Reflect.ownKeys(original)) {\n        copy[key] = deepDraft((original as any)[key], {\n            parent: methods,\n            keyInParent: key,\n        });\n    }\n\n    return new Proxy(copy, {\n        get(target, prop, receiver) {\n            if (prop === DRAFT_MATERIALIZE) return () => materializeDraftValue(target);\n            if (isMethodKey(prop)) return (methods as any)[prop];\n            return Reflect.get(target, prop, receiver);\n        },\n\n        set(target, prop, value, receiver) {\n            if (isMethodKey(prop)) {\n                throw new Error(`\"${String(prop)}\" is a reserved draft property`);\n            }\n            const wrapped = deepDraft(value, {\n                parent: methods,\n                keyInParent: prop,\n            });\n            touched.add(prop);\n            notifyParent(true);\n            return Reflect.set(target, prop, wrapped, receiver);\n        },\n\n        deleteProperty(target, prop) {\n            if (isMethodKey(prop)) {\n                throw new Error(`\"${String(prop)}\" is a reserved draft property`);\n            }\n            touched.add(prop);\n            notifyParent(true);\n            return Reflect.deleteProperty(target, prop);\n        },\n    }) as Draft<T>;\n}"]}

package/dist/web/event-bus.js

@@ -1,66 +0,0 @@
-// event.ts
-export class Event {
-    constructor() {
-        this.timestamp = new Date();
-    }
-    toString() {
-        return `${this.constructor.name}(${this.timestamp.toISOString()})`;
-    }
-}
-export class EventBus {
-    constructor() {
-        this._handlers = new Map();
-    }
-    static get shared() {
-        return this._instance ?? (this._instance = new EventBus());
-    }
-    on(type, handler) {
-        if (!this._handlers.has(type)) {
-            this._handlers.set(type, []);
-        }
-        this._handlers.get(type).push({
-            original: handler,
-            wrapped: (event) => handler(event),
-        });
-    }
-    off(type, handler) {
-        const handlers = this._handlers.get(type);
-        if (!handlers)
-            return;
-        let index = handlers.findIndex((h) => h.original === handler);
-        if (index !== -1) {
-            handlers.splice(index, 1);
-        }
-    }
-    emit(event) {
-        const handlers = this._handlers.get(event.constructor);
-        if (!handlers)
-            return;
-        for (const handler of [...handlers]) {
-            try {
-                handler.wrapped(event);
-            }
-            catch (e) {
-                console.error(`[EventBus] Error en handler de ${event.constructor.name}:`, e);
-            }
-        }
-    }
-    once(type, handler) {
-        const wrapper = (event) => {
-            this.off(type, wrapper);
-            handler(event);
-        };
-        this.on(type, wrapper);
-    }
-    clear(type) {
-        this._handlers.delete(type);
-    }
-    clearAll() {
-        this._handlers.clear();
-    }
-    hasListeners(type) {
-        return (this._handlers.get(type)?.length ?? 0) > 0;
-    }
-}
-EventBus._instance = null;
-//# sourceMappingURL=event-bus.js.map

package/dist/web/event-bus.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"event-bus.js","sourceRoot":"","sources":["../../src/event-bus.ts"],"names":[],"mappings":"AAAA,WAAW;AAEX,MAAM,OAAgB,KAAK;IAGvB;QACI,IAAI,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;IAChC,CAAC;IAED,QAAQ;QACJ,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,GAAG,CAAC;IACvE,CAAC;CACJ;AAUD,MAAM,OAAO,QAAQ;IAArB;QAOY,cAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;IAsD9D,CAAC;IA1DG,MAAM,KAAK,MAAM;QACb,OAAO,IAAI,CAAC,SAAS,KAAd,IAAI,CAAC,SAAS,GAAK,IAAI,QAAQ,EAAE,EAAC;IAC7C,CAAC;IAID,EAAE,CAAkB,IAAmB,EAAE,OAAmB;QACxD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC;YAC3B,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,CAAC,KAAY,EAAE,EAAE,CAAC,OAAO,CAAC,KAAU,CAAC;SACjD,CAAC,CAAC;IACP,CAAC;IAED,GAAG,CAAkB,IAAmB,EAAE,OAAmB;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;QAC9D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,IAAI,CAAkB,KAAQ;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QACvD,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC;gBACD,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACT,OAAO,CAAC,KAAK,CAAC,kCAAkC,KAAK,CAAC,WAAW,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;YAClF,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,CAAkB,IAAmB,EAAE,OAAmB;QAC1D,MAAM,OAAO,GAAe,CAAC,KAAQ,EAAE,EAAE;YACrC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACxB,OAAO,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC,CAAC;QACF,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,CAAkB,IAAmB;QACtC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,QAAQ;QACJ,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED,YAAY,CAAkB,IAAmB;QAC7C,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACvD,CAAC;;AA3Dc,kBAAS,GAAoB,IAAI,AAAxB,CAAyB","sourcesContent":["// event.ts\n\nexport abstract class Event {\n    readonly timestamp: Date;\n\n    protected constructor() {\n        this.timestamp = new Date();\n    }\n\n    toString(): string {\n        return `${this.constructor.name}(${this.timestamp.toISOString()})`;\n    }\n}\n\ntype EventClass<T extends Event> = new (...args: any[]) => T;\ntype Handler<T extends Event> = (event: T) => void;\n\ninterface HandlerWrapper {\n    original: Function;\n    wrapped: (event: Event) => void;\n}\n\nexport class EventBus {\n    private static _instance: EventBus | null = null;\n\n    static get shared(): EventBus {\n        return this._instance ??= new EventBus();\n    }\n\n    private _handlers = new Map<Function, HandlerWrapper[]>();\n\n    on<T extends Event>(type: EventClass<T>, handler: Handler<T>): void {\n        if (!this._handlers.has(type)) {\n            this._handlers.set(type, []);\n        }\n        this._handlers.get(type)!.push({\n            original: handler,\n            wrapped: (event: Event) => handler(event as T),\n        });\n    }\n\n    off<T extends Event>(type: EventClass<T>, handler: Handler<T>): void {\n        const handlers = this._handlers.get(type);\n        if (!handlers) return;\n\n        let index = handlers.findIndex((h) => h.original === handler);\n        if (index !== -1) {\n            handlers.splice(index, 1);\n        }\n    }\n\n    emit<T extends Event>(event: T): void {\n        const handlers = this._handlers.get(event.constructor);\n        if (!handlers) return;\n\n        for (const handler of [...handlers]) {\n            try {\n                handler.wrapped(event);\n            } catch (e) {\n                console.error(`[EventBus] Error en handler de ${event.constructor.name}:`, e);\n            }\n        }\n    }\n\n    once<T extends Event>(type: EventClass<T>, handler: Handler<T>): void {\n        const wrapper: Handler<T> = (event: T) => {\n            this.off(type, wrapper);\n            handler(event);\n        };\n        this.on(type, wrapper);\n    }\n\n    clear<T extends Event>(type: EventClass<T>): void {\n        this._handlers.delete(type);\n    }\n\n    clearAll(): void {\n        this._handlers.clear();\n    }\n\n    hasListeners<T extends Event>(type: EventClass<T>): boolean {\n        return (this._handlers.get(type)?.length ?? 0) > 0;\n    }\n}"]}