npm - @amcharts/amcharts5 - Versions diffs - 5.2.49 → 5.3.0 - Mend

@amcharts/amcharts5 5.2.49 → 5.3.0

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

Files changed (887) hide show

package/.internal/core/util/Array.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Array.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Array.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,KAAK,MAAM,QAAQ,CAAC;AAGhC;;;;;GAKG;AAEH;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CAAI,KAAmB,EAAE,KAAQ;IACvD,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,kBAAkB;QAClB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE;YACvB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,GAAG,CAAI,KAAmB,EAAE,IAA2B;IACtE,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACnB,OAAO,IAAI,CAAC;SACZ;KACD;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CAAO,KAAmB,EAAE,EAAkC;IAChF,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAC5B;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB,EAAE,EAAqC;IACjF,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChB;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAmB,EAAE,EAAqC;IACxF,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QACJ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChB;AACF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAI,KAAmB,EAAE,EAAwC;IAC5F,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrB,MAAM;SACN;KACD;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAI,KAAe,EAAE,KAAa;IAC1D,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QACpC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC5B;IAED,KAAK,CAAC,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe;IACtC,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACvC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,OAAU,EAAE,KAAa;IACnE,cAAc;IACd,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAChC,GAAG;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAI,KAAe,EAAE,OAAU,EAAE,KAAa;IACrE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACvB,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAGD;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,KAAe;IAC1D,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;AACF,CAAC;AAGD;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,OAAU;IACpD,IAAI,KAAK,GAAY,KAAK,CAAC;IAC3B,IAAI,KAAK,GAAW,CAAC,CAAC;IAEtB,SAAS;QACR,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEtC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YACjB,OAAO,KAAK,CAAC;SAEb;aAAM;YACN,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SACvB;KACD;AACF,CAAC;AAED,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,OAAU;IACzD,IAAI,KAAK,GAAW,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAE3C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;KAEZ;SAAM;QACN,OAAO,KAAK,CAAC;KACb;AACF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,OAAU,EAAE,OAAgB;IACpE,0EAA0E;IAC1E,gFAAgF;IAChF,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAEpC,2DAA2D;IAC3D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;KAC1B;IAED,IAAI,OAAO,IAAI,IAAI,EAAE;QACpB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;SAAM;QACN,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;KACrC;AACF,CAAC;AAGD;;;;;;;;GAQG;AACH,MAAM,UAAU,GAAG,CAAI,KAAe,EAAE,OAAU,EAAE,KAAc;IACjE,wCAAwC;IACxC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;IAED,8CAA8C;SACzC,IAAI,KAAK,KAAK,CAAC,EAAE;QACrB,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;KACvB;IACD,yCAAyC;SACpC;QACJ,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;KAChC;AACF,CAAC;AAGD;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,OAAU;IACrD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;QAClC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;AACF,CAAC;AAGD;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,OAAU,EAAE,KAAc;IACrE,kBAAkB;IAClB,IAAI,GAAG,GAAW,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAEzC,mBAAmB;IACnB,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE;QACf,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;KACrB;IAED,iCAAiC;IACjC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;IACD,yCAAyC;SACpC;QACJ,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;KAChC;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAmB;IAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACzB,OAAO,KAAK,CAAC;KACb;SACI;QACJ,OAAO,CAAC,KAAK,CAAC,CAAC;KACf;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CAAI,KAAmB,EAAE,OAAU;IACrD,OAAO,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB;IAC1C,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,4DAA4D;IAC5D,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,iFAAiF;QACjF,mCAAmC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KACrB;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAGD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CAAI,KAAmB,EAAE,KAAa,EAAE,GAA0B;IAA1B,oBAAA,EAAA,MAAc,KAAK,CAAC,MAAM;IACtF,IAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;IAEtC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;QACjC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC7B;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,KAAa,EAAE,KAAQ;IACtE,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,KAAa;IAC5D,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC;AAWD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAI,KAAmB,EAAE,OAA6C;IAC9F,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACzB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAI,KAAmB,EAAE,OAA6C;IACrG,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QACJ,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACzB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB,EAAE,OAA6C;IACzF,IAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAExC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACpB;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAmB,EAAE,OAA6C;IAChG,IAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE/C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACpB;AACF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,OAAO,CAAO,KAAmB,EAAE,OAAmD;IACrG,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnC,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,OAAO,KAAK,CAAC;SACb;KACD;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe;IACzC,6CAA6C;IAC7C,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,EAC9B,cAAc,EACd,WAAW,CAAC;IAEb,4CAA4C;IAC5C,OAAO,CAAC,KAAK,YAAY,EAAE;QAC1B,8BAA8B;QAC9B,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC;QACvD,YAAY,IAAI,CAAC,CAAC;QAElB,wCAAwC;QACxC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,CAAC,WAAW,CAAC,GAAG,cAAc,CAAC;KACpC;AACF,CAAC;AAcD;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAI,KAAmB,EAAE,QAA+B;IACrF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAK,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC;IAElB,OAAO,KAAK,GAAG,GAAG,EAAE;QACnB,qDAAqD;QACrD,IAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO;QACP,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,QAAQ;SACP;aAAM,IAAI,KAAK,KAAK,CAAC,EAAE;YACvB,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,OAAO;SACN;aAAM;YACN,GAAG,GAAG,KAAK,CAAC;SACZ;KACD;IAED,OAAO;QACN,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;KAClC,CAAC;AACH,CAAC;AAGD;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAI,KAAmB,EAAE,QAA+B;IAC1F,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAK,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC;IAElB,OAAO,KAAK,GAAG,GAAG,EAAE;QACnB,qDAAqD;QACrD,IAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAEjC,IAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO;QACP,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,QAAQ;SACP;aAAM,IAAI,KAAK,KAAK,CAAC,EAAE;YACvB,KAAK,GAAG,IAAI,CAAC;YACb,GAAG,GAAG,KAAK,CAAC;YAEb,OAAO;SACN;aAAM;YACN,GAAG,GAAG,KAAK,CAAC;SACZ;KACD;IAED,OAAO;QACN,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,KAAK;KACZ,CAAC;AACH,CAAC;AAGD,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,IAA2B;IACrE,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QAEJ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACpB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;KACD;AACF,CAAC","sourcesContent":["/*\n ============================================================================\n * IMPORTS\n * ============================================================================\n * @hidden\n /\nimport type { Optional } from \"./Type\";\nimport as $type from \"./Type\";\n\n\n/*\n ============================================================================\n * UTILITY FUNCTIONS\n * ============================================================================\n * @hidden\n /\n\n/\n Searches `array` for `value`.\n \n Returns -1 if not found.\n \n @param array Source array\n * @param value Value to search\n * @returns Index\n /\nexport function indexOf<A>(array: ArrayLike<A>, value: A): number {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t// TODO handle NaN\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n Calls `test` for each element in `array`.\n \n If `test` returns `true` then it immediately returns `true`.\n \n If `test` returns `false` for all of the elements in `array` then it returns `false`.\n \n @param array Source array\n * @param test Function which is called on each element\n * @returns Whether `test` returned true or not\n /\nexport function any<A>(array: ArrayLike<A>, test: (value: A) => boolean): boolean {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (test(array[i])) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n Calls `fn` function for every member of array and returns a new array out\n * of all outputs.\n \n @param array Source array\n * @param fn Callback function\n * @returns New array\n /\nexport function map<A, B>(array: ArrayLike<A>, fn: (value: A, index: number) => B): Array<B> {\n\tconst length = array.length;\n\tconst output = new Array(length);\n\n\tfor (let i = 0; i < length; ++i) {\n\t\toutput[i] = fn(array[i], i);\n\t}\n\n\treturn output;\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function each<A>(array: ArrayLike<A>, fn: (value: A, index: number) => void): void {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tfn(array[i], i);\n\t}\n}\n\n/\n Iterates through all items in array in reverse order and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function eachReverse<A>(array: ArrayLike<A>, fn: (value: A, index: number) => void): void {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\t\tfn(array[i], i);\n\t}\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n If `fn` call evaluates to `false`, further iteration is cancelled.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function eachContinue<A>(array: ArrayLike<A>, fn: (value: A, index: number) => boolean): void {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (!fn(array[i], i)) {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n/\n Shifts an item at `index` towards beginning of the array.\n \n @param array Source array\n * @param index Target element index\n /\nexport function shiftLeft<A>(array: Array<A>, index: number): void {\n\tconst length = array.length;\n\n\tfor (let i = index; i < length; ++i) {\n\t\tarray[i - index] = array[i];\n\t}\n\n\tarray.length = length - index;\n}\n\n/\n Returns the last item of the array.\n \n @param array Source array\n * @returns Last item\n /\nexport function last<A>(array: Array<A>): Optional<A> {\n\tconst length = array.length;\n\treturn length ? array[length - 1] : undefined;\n}\n\n/\n Returns the first item of the array.\n \n @param array Source array\n * @returns Last item\n /\nexport function first<A>(array: Array<A>): Optional<A> {\n\treturn array[0];\n}\n\n/\n Inserts `element` into `array` at `index`.\n \n Caps `index` to be between `0` and `array.length`\n \n @param array Source array\n * @param element Item to insert\n * @param array Index to insert item at\n /\nexport function insert<A>(array: Array<A>, element: A, index: number): void {\n\t//if (array) {\n\tindex = Math.max(0, Math.min(index, array.length));\n\tarray.splice(index, 0, element);\n\t//}\n}\n\n/\n Removes all copies of `element` from `array` (if they exist) and then\n * inserts `element` at `index`.\n \n @param array Source array\n * @param element Item\n * @param array Index to move item to\n /\nexport function setIndex<A>(array: Array<A>, element: A, index: number): void {\n\tremove(array, element);\n\tinsert(array, element, index);\n}\n\n\n/\n Pushes all of the elements from `input` into `array`.\n \n @param array Output array\n * @param input Input array\n /\nexport function pushAll<A>(array: Array<A>, input: Array<A>) {\n\tconst length = input.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tarray.push(input[i]);\n\t}\n}\n\n\n/\n Removes `element` from `array`.\n \n If there are multiple copies of `element`, they are all removed.\n \n @param array Source array\n * @param element Item to remove\n /\nexport function remove<A>(array: Array<A>, element: A): boolean {\n\tlet found: boolean = false;\n\tlet index: number = 0;\n\n\tfor (;;) {\n\t\tindex = array.indexOf(element, index);\n\n\t\tif (index === -1) {\n\t\t\treturn found;\n\n\t\t} else {\n\t\t\tfound = true;\n\t\t\tarray.splice(index, 1);\n\t\t}\n\t}\n}\n\nexport function removeFirst<A>(array: Array<A>, element: A): boolean {\n\tlet index: number = array.indexOf(element);\n\n\tif (index !== -1) {\n\t\tarray.splice(index, 1);\n\t\treturn true;\n\n\t} else {\n\t\treturn false;\n\t}\n}\n\n/\n Adds an `element` to `array`.\n \n If array already contains and item like this, it is removed before adding\n * it again.\n \n Optionally `toIndex` can be specified to add element at specific index.\n \n @param array Source array\n * @param element Item to add\n * @param array Index to move item to\n /\nexport function move<A>(array: Array<A>, element: A, toIndex?: number): void {\n\t// @todo this implementation must be the same as the List.moveValue method\n\t// @todo don't do anything if the desired index is the same as the current index\n\tlet index = indexOf(array, element);\n\n\t// @todo remove all old values rather than only the first ?\n\tif (index !== -1) {\n\t\tremoveIndex(array, index);\n\t}\n\n\tif (toIndex == null) {\n\t\tarray.push(element);\n\t} else {\n\t\tinsertIndex(array, toIndex, element);\n\t}\n}\n\n\n/\n Inserts `element` into `array` at `index`.\n \n If `index` is not provided, it will insert `element` at the end of `array`.\n \n @param array Source array\n * @param element Item to add\n * @param array Index to add item at\n /\nexport function add<A>(array: Array<A>, element: A, index?: number): void {\n\t// Append to the end if index is not set\n\tif (!$type.isNumber(index)) {\n\t\tarray.push(element);\n\t}\n\n\t// Add to the beginning of array if index is 0\n\telse if (index === 0) {\n\t\tarray.unshift(element);\n\t}\n\t// Add to indicated place if index is set\n\telse {\n\t\tarray.splice(index, 0, element);\n\t}\n}\n\n\n/\n Pushes `element` into `array` if it doesn't already exist.\n \n @param array Source array\n * @param element Item to add\n /\nexport function pushOne<A>(array: Array<A>, element: A): void {\n\tif (array.indexOf(element) === -1) {\n\t\tarray.push(element);\n\t}\n}\n\n\n/\n Removes `element` from `array` (if it exists) and then inserts `element` at\n * `index`.\n \n If `index` is not provided, it will insert `element` at the end of `array`.\n \n @param array Source array\n * @param element Item to remove\n * @param array Index to move item to\n /\nexport function replace<A>(array: Array<A>, element: A, index?: number): void {\n\t// check if exists\n\tlet ind: number = array.indexOf(element);\n\n\t// remove if exists\n\tif (ind !== -1) {\n\t\tarray.splice(ind, 1);\n\t}\n\n\t// add to end if index is not set\n\tif (!$type.isNumber(index)) {\n\t\tarray.push(element);\n\t}\n\t// add to indicated place if index is set\n\telse {\n\t\tarray.splice(index, 0, element);\n\t}\n}\n\n/\n Wraps `input` in an array, if it isn't already an array.\n \n @param input Source value\n * @return An array\n /\nexport function toArray<A>(input: Array<A> \| A): Array<A> {\n\tif (Array.isArray(input)) {\n\t\treturn input;\n\t}\n\telse {\n\t\treturn [input];\n\t}\n}\n\n/\n Returns `true` if `element` exists in `array`.\n \n @param array Source array\n * @param element Item to search for\n * @returns Item in array?\n /\nexport function has<A>(array: ArrayLike<A>, element: A): boolean {\n\treturn indexOf(array, element) !== -1;\n}\n\n/\n Returns a shallow copy of `array`.\n \n @param array Source array\n * @returns Copy of the array\n /\nexport function copy<A>(array: ArrayLike<A>): Array<A> {\n\tconst length = array.length;\n\n\t// It's faster to create the array with a pre-defined length\n\tconst output = new Array(length);\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t// Because the array has a pre-defined length, we have to assign rather than push\n\t\t// This is also faster than pushing\n\t\toutput[i] = array[i];\n\t}\n\n\treturn output;\n}\n\n\n/\n Returns a copy of `array` which contains all the elements between `start`\n * and `end`. (including `start` and excluding `end`)\n \n If `end` is not provided, it defaults to `array.length`.\n \n @param array Source array\n * @param start Start index\n * @param end End index\n * @returns Part of the array\n /\nexport function slice<A>(array: ArrayLike<A>, start: number, end: number = array.length): Array<A> {\n\tconst output = new Array(end - start);\n\n\tfor (let i = start; i < end; ++i) {\n\t\toutput[i - start] = array[i];\n\t}\n\n\treturn output;\n}\n\n/\n Inserts a value into array at specific index.\n \n @param array Source array\n * @param index Index\n * @param value Value to insert\n /\nexport function insertIndex<A>(array: Array<A>, index: number, value: A): void {\n\tarray.splice(index, 0, value);\n}\n\n/\n Removes a value from array at specific index.\n \n @param array Source array\n * @param index Index\n /\nexport function removeIndex<A>(array: Array<A>, index: number): void {\n\tarray.splice(index, 1);\n}\n\n/\n @ignore Exclude from docs\n * @todo Description\n /\nexport interface SortResult {\n\tfound: boolean;\n\tindex: number\n}\n\n/\n Searches the array using custom function and returns index of the item if\n * found.\n \n Will call `matches` function on all items of the array. If return value\n * evaluates to `true`, index is returned.\n \n Otherwise returns -1.\n \n @param array Source array\n * @param matches Search function\n * @returns Index of the item if found\n /\nexport function findIndex<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): number {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (matches(array[i], i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n This is the same as `findIndex` except it searches from right to left.\n \n @param array Source array\n * @param matches Search function\n * @returns Index of the item if found\n /\nexport function findIndexReverse<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): number {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\t\tif (matches(array[i], i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n Searches the array using custom function and returns item if found.\n \n Will call `matches` function on all items of the array. If return value\n * evaluates to `true`, index is returned.\n \n Otherwise returns `undefined`.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function find<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): A \| undefined {\n\tconst index = findIndex(array, matches);\n\n\tif (index !== -1) {\n\t\treturn array[index];\n\t}\n}\n\n/\n This is the same as `find` except it searches from right to left.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function findReverse<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): A \| undefined {\n\tconst index = findIndexReverse(array, matches);\n\n\tif (index !== -1) {\n\t\treturn array[index];\n\t}\n}\n\n/\n Searches the array using custom function and returns item if found.\n \n Will call `matches` function on all items of the array. If value\n * is not `undefined`, it returns it.\n \n Otherwise returns `undefined`.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function findMap<A, B>(array: ArrayLike<A>, matches: (value: A, index: number) => B \| undefined): B \| undefined {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tconst value = matches(array[i], i);\n\n\t\tif (value !== undefined) {\n\t\t\treturn value;\n\t\t}\n\t}\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function shuffle<A>(array: Array<A>) {\n\t// https://stackoverflow.com/a/2450976/449477\n\tlet currentIndex = array.length,\n\t\ttemporaryValue,\n\t\trandomIndex;\n\n\t// While there remain elements to shuffle...\n\twhile (0 !== currentIndex) {\n\t\t// Pick a remaining element...\n\t\trandomIndex = Math.floor(Math.random() currentIndex);\n\t\tcurrentIndex -= 1;\n\n\t\t// And swap it with the current element.\n\t\ttemporaryValue = array[currentIndex];\n\t\tarray[currentIndex] = array[randomIndex];\n\t\tarray[randomIndex] = temporaryValue;\n\t}\n}\n\n\nexport type Ordering = -1 \| 0 \| 1;\n\n/*\n @ignore Exclude from docs\n * @todo Description\n /\nexport interface SortResult {\n\tfound: boolean;\n\tindex: number\n}\n\n/\n Orders an array using specific `ordering` function and returns right-most index of\n * the `value`.\n \n @ignore Exclude from docs\n * @param array Source array\n * @param ordering An ordering function\n * @returns Result of the search\n /\nexport function getSortedIndex<A>(array: ArrayLike<A>, ordering: (left: A) => Ordering): SortResult {\n\tlet start = 0;\n\tlet end = array.length;\n\tlet found = false;\n\n\twhile (start < end) {\n\t\t// TODO is this faster/slower than using Math.floor ?\n\t\tconst pivot = (start + end) >> 1;\n\n\t\tconst order = ordering(array[pivot]);\n\n\t\t// less\n\t\tif (order < 0) {\n\t\t\tstart = pivot + 1;\n\n\t\t// equal\n\t\t} else if (order === 0) {\n\t\t\tfound = true;\n\t\t\tstart = pivot + 1;\n\n\t\t// more\n\t\t} else {\n\t\t\tend = pivot;\n\t\t}\n\t}\n\n\treturn {\n\t\tfound: found,\n\t\tindex: (found ? start - 1 : start)\n\t};\n}\n\n\n/\n Orders an array using specific `ordering` function and returns left-most index of\n * the `value`.\n \n @ignore Exclude from docs\n * @param array Source array\n * @param ordering An ordering function\n * @returns Result of the search\n */\nexport function getFirstSortedIndex<A>(array: ArrayLike<A>, ordering: (left: A) => Ordering): SortResult {\n\tlet start = 0;\n\tlet end = array.length;\n\tlet found = false;\n\n\twhile (start < end) {\n\t\t// TODO is this faster/slower than using Math.floor ?\n\t\tconst pivot = (start + end) >> 1;\n\n\t\tconst order = ordering(array[pivot]);\n\n\t\t// less\n\t\tif (order < 0) {\n\t\t\tstart = pivot + 1;\n\n\t\t// equal\n\t\t} else if (order === 0) {\n\t\t\tfound = true;\n\t\t\tend = pivot;\n\n\t\t// more\n\t\t} else {\n\t\t\tend = pivot;\n\t\t}\n\t}\n\n\treturn {\n\t\tfound: found,\n\t\tindex: start\n\t};\n}\n\n\nexport function keepIf<A>(array: Array<A>, keep: (value: A) => boolean): void {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\n\t\tif (!keep(array[i])) {\n\t\t\tarray.splice(i, 1);\n\t\t}\n\t}\n}\n"]}
1	+ {"version":3,"file":"Array.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Array.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,KAAK,MAAM,QAAQ,CAAC;AAGhC;;;;;GAKG;AAEH;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CAAI,KAAmB,EAAE,KAAQ;IACvD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,kBAAkB;QAClB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE;YACvB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,GAAG,CAAI,KAAmB,EAAE,IAA2B;IACtE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACnB,OAAO,IAAI,CAAC;SACZ;KACD;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CAAO,KAAmB,EAAE,EAAkC;IAChF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAC5B;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB,EAAE,EAAqC;IACjF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChB;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAmB,EAAE,EAAqC;IACxF,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QACJ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChB;AACF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAI,KAAmB,EAAE,EAAwC;IAC5F,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrB,MAAM;SACN;KACD;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAI,KAAe,EAAE,KAAa;IAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QACpC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC5B;IAED,KAAK,CAAC,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe;IACtC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACvC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,OAAU,EAAE,KAAa;IACnE,cAAc;IACd,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAChC,GAAG;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAI,KAAe,EAAE,OAAU,EAAE,KAAa;IACrE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACvB,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAGD;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,KAAe;IAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;KACrB;AACF,CAAC;AAGD;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,OAAU;IACpD,IAAI,KAAK,GAAY,KAAK,CAAC;IAC3B,IAAI,KAAK,GAAW,CAAC,CAAC;IAEtB,SAAS;QACR,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEtC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YACjB,OAAO,KAAK,CAAC;SAEb;aAAM;YACN,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SACvB;KACD;AACF,CAAC;AAED,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,OAAU;IACzD,IAAI,KAAK,GAAW,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAE3C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;KAEZ;SAAM;QACN,OAAO,KAAK,CAAC;KACb;AACF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,OAAU,EAAE,OAAgB;IACpE,0EAA0E;IAC1E,gFAAgF;IAChF,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAEpC,2DAA2D;IAC3D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;KAC1B;IAED,IAAI,OAAO,IAAI,IAAI,EAAE;QACpB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;SAAM;QACN,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;KACrC;AACF,CAAC;AAGD;;;;;;;;GAQG;AACH,MAAM,UAAU,GAAG,CAAI,KAAe,EAAE,OAAU,EAAE,KAAc;IACjE,wCAAwC;IACxC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;IAED,8CAA8C;SACzC,IAAI,KAAK,KAAK,CAAC,EAAE;QACrB,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;KACvB;IACD,yCAAyC;SACpC;QACJ,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;KAChC;AACF,CAAC;AAGD;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,OAAU;IACrD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;QAClC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;AACF,CAAC;AAGD;;;;;;;;;GASG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe,EAAE,OAAU,EAAE,KAAc;IACrE,kBAAkB;IAClB,IAAI,GAAG,GAAW,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAEzC,mBAAmB;IACnB,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE;QACf,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;KACrB;IAED,iCAAiC;IACjC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KACpB;IACD,yCAAyC;SACpC;QACJ,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;KAChC;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAmB;IAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACzB,OAAO,KAAK,CAAC;KACb;SACI;QACJ,OAAO,CAAC,KAAK,CAAC,CAAC;KACf;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CAAI,KAAmB,EAAE,OAAU;IACrD,OAAO,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB;IAC1C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,4DAA4D;IAC5D,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,iFAAiF;QACjF,mCAAmC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KACrB;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAGD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,KAAK,CAAI,KAAmB,EAAE,KAAa,EAAE,MAAc,KAAK,CAAC,MAAM;IACtF,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;IAEtC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;QACjC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC7B;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,KAAa,EAAE,KAAQ;IACtE,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAI,KAAe,EAAE,KAAa;IAC5D,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC;AAWD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAI,KAAmB,EAAE,OAA6C;IAC9F,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACzB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAI,KAAmB,EAAE,OAA6C;IACrG,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QACJ,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACzB,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,IAAI,CAAI,KAAmB,EAAE,OAA6C;IACzF,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAExC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACpB;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAI,KAAmB,EAAE,OAA6C;IAChG,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE/C,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;KACpB;AACF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,OAAO,CAAO,KAAmB,EAAE,OAAmD;IACrG,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnC,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,OAAO,KAAK,CAAC;SACb;KACD;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,KAAe;IACzC,6CAA6C;IAC7C,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,EAC9B,cAAc,EACd,WAAW,CAAC;IAEb,4CAA4C;IAC5C,OAAO,CAAC,KAAK,YAAY,EAAE;QAC1B,8BAA8B;QAC9B,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC;QACvD,YAAY,IAAI,CAAC,CAAC;QAElB,wCAAwC;QACxC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,CAAC,WAAW,CAAC,GAAG,cAAc,CAAC;KACpC;AACF,CAAC;AAcD;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAI,KAAmB,EAAE,QAA+B;IACrF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAK,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC;IAElB,OAAO,KAAK,GAAG,GAAG,EAAE;QACnB,qDAAqD;QACrD,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAEjC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO;QACP,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,QAAQ;SACP;aAAM,IAAI,KAAK,KAAK,CAAC,EAAE;YACvB,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,OAAO;SACN;aAAM;YACN,GAAG,GAAG,KAAK,CAAC;SACZ;KACD;IAED,OAAO;QACN,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;KAClC,CAAC;AACH,CAAC;AAGD;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAI,KAAmB,EAAE,QAA+B;IAC1F,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,GAAG,GAAK,KAAK,CAAC,MAAM,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC;IAElB,OAAO,KAAK,GAAG,GAAG,EAAE;QACnB,qDAAqD;QACrD,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAEjC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO;QACP,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAEnB,QAAQ;SACP;aAAM,IAAI,KAAK,KAAK,CAAC,EAAE;YACvB,KAAK,GAAG,IAAI,CAAC;YACb,GAAG,GAAG,KAAK,CAAC;YAEb,OAAO;SACN;aAAM;YACN,GAAG,GAAG,KAAK,CAAC;SACZ;KACD;IAED,OAAO;QACN,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,KAAK;KACZ,CAAC;AACH,CAAC;AAGD,MAAM,UAAU,MAAM,CAAI,KAAe,EAAE,IAA2B;IACrE,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAErB,OAAO,CAAC,GAAG,CAAC,EAAE;QACb,EAAE,CAAC,CAAC;QAEJ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACpB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACnB;KACD;AACF,CAAC","sourcesContent":["/*\n ============================================================================\n * IMPORTS\n * ============================================================================\n * @hidden\n /\nimport type { Optional } from \"./Type\";\nimport as $type from \"./Type\";\n\n\n/*\n ============================================================================\n * UTILITY FUNCTIONS\n * ============================================================================\n * @hidden\n /\n\n/\n Searches `array` for `value`.\n \n Returns -1 if not found.\n \n @param array Source array\n * @param value Value to search\n * @returns Index\n /\nexport function indexOf<A>(array: ArrayLike<A>, value: A): number {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t// TODO handle NaN\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n Calls `test` for each element in `array`.\n \n If `test` returns `true` then it immediately returns `true`.\n \n If `test` returns `false` for all of the elements in `array` then it returns `false`.\n \n @param array Source array\n * @param test Function which is called on each element\n * @returns Whether `test` returned true or not\n /\nexport function any<A>(array: ArrayLike<A>, test: (value: A) => boolean): boolean {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (test(array[i])) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n/\n Calls `fn` function for every member of array and returns a new array out\n * of all outputs.\n \n @param array Source array\n * @param fn Callback function\n * @returns New array\n /\nexport function map<A, B>(array: ArrayLike<A>, fn: (value: A, index: number) => B): Array<B> {\n\tconst length = array.length;\n\tconst output = new Array(length);\n\n\tfor (let i = 0; i < length; ++i) {\n\t\toutput[i] = fn(array[i], i);\n\t}\n\n\treturn output;\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function each<A>(array: ArrayLike<A>, fn: (value: A, index: number) => void): void {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tfn(array[i], i);\n\t}\n}\n\n/\n Iterates through all items in array in reverse order and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function eachReverse<A>(array: ArrayLike<A>, fn: (value: A, index: number) => void): void {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\t\tfn(array[i], i);\n\t}\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n If `fn` call evaluates to `false`, further iteration is cancelled.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function eachContinue<A>(array: ArrayLike<A>, fn: (value: A, index: number) => boolean): void {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (!fn(array[i], i)) {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\n/\n Shifts an item at `index` towards beginning of the array.\n \n @param array Source array\n * @param index Target element index\n /\nexport function shiftLeft<A>(array: Array<A>, index: number): void {\n\tconst length = array.length;\n\n\tfor (let i = index; i < length; ++i) {\n\t\tarray[i - index] = array[i];\n\t}\n\n\tarray.length = length - index;\n}\n\n/\n Returns the last item of the array.\n \n @param array Source array\n * @returns Last item\n /\nexport function last<A>(array: Array<A>): Optional<A> {\n\tconst length = array.length;\n\treturn length ? array[length - 1] : undefined;\n}\n\n/\n Returns the first item of the array.\n \n @param array Source array\n * @returns Last item\n /\nexport function first<A>(array: Array<A>): Optional<A> {\n\treturn array[0];\n}\n\n/\n Inserts `element` into `array` at `index`.\n \n Caps `index` to be between `0` and `array.length`\n \n @param array Source array\n * @param element Item to insert\n * @param array Index to insert item at\n /\nexport function insert<A>(array: Array<A>, element: A, index: number): void {\n\t//if (array) {\n\tindex = Math.max(0, Math.min(index, array.length));\n\tarray.splice(index, 0, element);\n\t//}\n}\n\n/\n Removes all copies of `element` from `array` (if they exist) and then\n * inserts `element` at `index`.\n \n @param array Source array\n * @param element Item\n * @param array Index to move item to\n /\nexport function setIndex<A>(array: Array<A>, element: A, index: number): void {\n\tremove(array, element);\n\tinsert(array, element, index);\n}\n\n\n/\n Pushes all of the elements from `input` into `array`.\n \n @param array Output array\n * @param input Input array\n /\nexport function pushAll<A>(array: Array<A>, input: Array<A>) {\n\tconst length = input.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tarray.push(input[i]);\n\t}\n}\n\n\n/\n Removes `element` from `array`.\n \n If there are multiple copies of `element`, they are all removed.\n \n @param array Source array\n * @param element Item to remove\n /\nexport function remove<A>(array: Array<A>, element: A): boolean {\n\tlet found: boolean = false;\n\tlet index: number = 0;\n\n\tfor (;;) {\n\t\tindex = array.indexOf(element, index);\n\n\t\tif (index === -1) {\n\t\t\treturn found;\n\n\t\t} else {\n\t\t\tfound = true;\n\t\t\tarray.splice(index, 1);\n\t\t}\n\t}\n}\n\nexport function removeFirst<A>(array: Array<A>, element: A): boolean {\n\tlet index: number = array.indexOf(element);\n\n\tif (index !== -1) {\n\t\tarray.splice(index, 1);\n\t\treturn true;\n\n\t} else {\n\t\treturn false;\n\t}\n}\n\n/\n Adds an `element` to `array`.\n \n If array already contains and item like this, it is removed before adding\n * it again.\n \n Optionally `toIndex` can be specified to add element at specific index.\n \n @param array Source array\n * @param element Item to add\n * @param array Index to move item to\n /\nexport function move<A>(array: Array<A>, element: A, toIndex?: number): void {\n\t// @todo this implementation must be the same as the List.moveValue method\n\t// @todo don't do anything if the desired index is the same as the current index\n\tlet index = indexOf(array, element);\n\n\t// @todo remove all old values rather than only the first ?\n\tif (index !== -1) {\n\t\tremoveIndex(array, index);\n\t}\n\n\tif (toIndex == null) {\n\t\tarray.push(element);\n\t} else {\n\t\tinsertIndex(array, toIndex, element);\n\t}\n}\n\n\n/\n Inserts `element` into `array` at `index`.\n \n If `index` is not provided, it will insert `element` at the end of `array`.\n \n @param array Source array\n * @param element Item to add\n * @param array Index to add item at\n /\nexport function add<A>(array: Array<A>, element: A, index?: number): void {\n\t// Append to the end if index is not set\n\tif (!$type.isNumber(index)) {\n\t\tarray.push(element);\n\t}\n\n\t// Add to the beginning of array if index is 0\n\telse if (index === 0) {\n\t\tarray.unshift(element);\n\t}\n\t// Add to indicated place if index is set\n\telse {\n\t\tarray.splice(index, 0, element);\n\t}\n}\n\n\n/\n Pushes `element` into `array` if it doesn't already exist.\n \n @param array Source array\n * @param element Item to add\n /\nexport function pushOne<A>(array: Array<A>, element: A): void {\n\tif (array.indexOf(element) === -1) {\n\t\tarray.push(element);\n\t}\n}\n\n\n/\n Removes `element` from `array` (if it exists) and then inserts `element` at\n * `index`.\n \n If `index` is not provided, it will insert `element` at the end of `array`.\n \n @param array Source array\n * @param element Item to remove\n * @param array Index to move item to\n /\nexport function replace<A>(array: Array<A>, element: A, index?: number): void {\n\t// check if exists\n\tlet ind: number = array.indexOf(element);\n\n\t// remove if exists\n\tif (ind !== -1) {\n\t\tarray.splice(ind, 1);\n\t}\n\n\t// add to end if index is not set\n\tif (!$type.isNumber(index)) {\n\t\tarray.push(element);\n\t}\n\t// add to indicated place if index is set\n\telse {\n\t\tarray.splice(index, 0, element);\n\t}\n}\n\n/\n Wraps `input` in an array, if it isn't already an array.\n \n @param input Source value\n * @return An array\n /\nexport function toArray<A>(input: Array<A> \| A): Array<A> {\n\tif (Array.isArray(input)) {\n\t\treturn input;\n\t}\n\telse {\n\t\treturn [input];\n\t}\n}\n\n/\n Returns `true` if `element` exists in `array`.\n \n @param array Source array\n * @param element Item to search for\n * @returns Item in array?\n /\nexport function has<A>(array: ArrayLike<A>, element: A): boolean {\n\treturn indexOf(array, element) !== -1;\n}\n\n/\n Returns a shallow copy of `array`.\n \n @param array Source array\n * @returns Copy of the array\n /\nexport function copy<A>(array: ArrayLike<A>): Array<A> {\n\tconst length = array.length;\n\n\t// It's faster to create the array with a pre-defined length\n\tconst output = new Array(length);\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t// Because the array has a pre-defined length, we have to assign rather than push\n\t\t// This is also faster than pushing\n\t\toutput[i] = array[i];\n\t}\n\n\treturn output;\n}\n\n\n/\n Returns a copy of `array` which contains all the elements between `start`\n * and `end`. (including `start` and excluding `end`)\n \n If `end` is not provided, it defaults to `array.length`.\n \n @param array Source array\n * @param start Start index\n * @param end End index\n * @returns Part of the array\n /\nexport function slice<A>(array: ArrayLike<A>, start: number, end: number = array.length): Array<A> {\n\tconst output = new Array(end - start);\n\n\tfor (let i = start; i < end; ++i) {\n\t\toutput[i - start] = array[i];\n\t}\n\n\treturn output;\n}\n\n/\n Inserts a value into array at specific index.\n \n @param array Source array\n * @param index Index\n * @param value Value to insert\n /\nexport function insertIndex<A>(array: Array<A>, index: number, value: A): void {\n\tarray.splice(index, 0, value);\n}\n\n/\n Removes a value from array at specific index.\n \n @param array Source array\n * @param index Index\n /\nexport function removeIndex<A>(array: Array<A>, index: number): void {\n\tarray.splice(index, 1);\n}\n\n/\n @ignore Exclude from docs\n * @todo Description\n /\nexport interface SortResult {\n\tfound: boolean;\n\tindex: number\n}\n\n/\n Searches the array using custom function and returns index of the item if\n * found.\n \n Will call `matches` function on all items of the array. If return value\n * evaluates to `true`, index is returned.\n \n Otherwise returns -1.\n \n @param array Source array\n * @param matches Search function\n * @returns Index of the item if found\n /\nexport function findIndex<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): number {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tif (matches(array[i], i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n This is the same as `findIndex` except it searches from right to left.\n \n @param array Source array\n * @param matches Search function\n * @returns Index of the item if found\n /\nexport function findIndexReverse<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): number {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\t\tif (matches(array[i], i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/\n Searches the array using custom function and returns item if found.\n \n Will call `matches` function on all items of the array. If return value\n * evaluates to `true`, index is returned.\n \n Otherwise returns `undefined`.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function find<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): A \| undefined {\n\tconst index = findIndex(array, matches);\n\n\tif (index !== -1) {\n\t\treturn array[index];\n\t}\n}\n\n/\n This is the same as `find` except it searches from right to left.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function findReverse<A>(array: ArrayLike<A>, matches: (value: A, index: number) => boolean): A \| undefined {\n\tconst index = findIndexReverse(array, matches);\n\n\tif (index !== -1) {\n\t\treturn array[index];\n\t}\n}\n\n/\n Searches the array using custom function and returns item if found.\n \n Will call `matches` function on all items of the array. If value\n * is not `undefined`, it returns it.\n \n Otherwise returns `undefined`.\n \n @param array Source array\n * @param matches Search function\n * @returns Item if found\n /\nexport function findMap<A, B>(array: ArrayLike<A>, matches: (value: A, index: number) => B \| undefined): B \| undefined {\n\tconst length = array.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tconst value = matches(array[i], i);\n\n\t\tif (value !== undefined) {\n\t\t\treturn value;\n\t\t}\n\t}\n}\n\n/\n Iterates through all items in array and calls `fn` function for each of\n * them.\n \n @param array Source array\n * @param fn Callback function\n /\nexport function shuffle<A>(array: Array<A>) {\n\t// https://stackoverflow.com/a/2450976/449477\n\tlet currentIndex = array.length,\n\t\ttemporaryValue,\n\t\trandomIndex;\n\n\t// While there remain elements to shuffle...\n\twhile (0 !== currentIndex) {\n\t\t// Pick a remaining element...\n\t\trandomIndex = Math.floor(Math.random() currentIndex);\n\t\tcurrentIndex -= 1;\n\n\t\t// And swap it with the current element.\n\t\ttemporaryValue = array[currentIndex];\n\t\tarray[currentIndex] = array[randomIndex];\n\t\tarray[randomIndex] = temporaryValue;\n\t}\n}\n\n\nexport type Ordering = -1 \| 0 \| 1;\n\n/*\n @ignore Exclude from docs\n * @todo Description\n /\nexport interface SortResult {\n\tfound: boolean;\n\tindex: number\n}\n\n/\n Orders an array using specific `ordering` function and returns right-most index of\n * the `value`.\n \n @ignore Exclude from docs\n * @param array Source array\n * @param ordering An ordering function\n * @returns Result of the search\n /\nexport function getSortedIndex<A>(array: ArrayLike<A>, ordering: (left: A) => Ordering): SortResult {\n\tlet start = 0;\n\tlet end = array.length;\n\tlet found = false;\n\n\twhile (start < end) {\n\t\t// TODO is this faster/slower than using Math.floor ?\n\t\tconst pivot = (start + end) >> 1;\n\n\t\tconst order = ordering(array[pivot]);\n\n\t\t// less\n\t\tif (order < 0) {\n\t\t\tstart = pivot + 1;\n\n\t\t// equal\n\t\t} else if (order === 0) {\n\t\t\tfound = true;\n\t\t\tstart = pivot + 1;\n\n\t\t// more\n\t\t} else {\n\t\t\tend = pivot;\n\t\t}\n\t}\n\n\treturn {\n\t\tfound: found,\n\t\tindex: (found ? start - 1 : start)\n\t};\n}\n\n\n/\n Orders an array using specific `ordering` function and returns left-most index of\n * the `value`.\n \n @ignore Exclude from docs\n * @param array Source array\n * @param ordering An ordering function\n * @returns Result of the search\n */\nexport function getFirstSortedIndex<A>(array: ArrayLike<A>, ordering: (left: A) => Ordering): SortResult {\n\tlet start = 0;\n\tlet end = array.length;\n\tlet found = false;\n\n\twhile (start < end) {\n\t\t// TODO is this faster/slower than using Math.floor ?\n\t\tconst pivot = (start + end) >> 1;\n\n\t\tconst order = ordering(array[pivot]);\n\n\t\t// less\n\t\tif (order < 0) {\n\t\t\tstart = pivot + 1;\n\n\t\t// equal\n\t\t} else if (order === 0) {\n\t\t\tfound = true;\n\t\t\tend = pivot;\n\n\t\t// more\n\t\t} else {\n\t\t\tend = pivot;\n\t\t}\n\t}\n\n\treturn {\n\t\tfound: found,\n\t\tindex: start\n\t};\n}\n\n\nexport function keepIf<A>(array: Array<A>, keep: (value: A) => boolean): void {\n\tlet i = array.length;\n\n\twhile (i > 0) {\n\t\t--i;\n\n\t\tif (!keep(array[i])) {\n\t\t\tarray.splice(i, 1);\n\t\t}\n\t}\n}\n"]}

package/.internal/core/util/AsyncPending.js CHANGED Viewed

@@ -9,34 +9,34 @@ import * as $array from "./Array";
 /**
  * @ignore
  */
-var pendingFrame = false;
+let pendingFrame = false;
 /**
  * @ignore
  */
-var nextQueue = [];
+const nextQueue = [];
 /**
  * @ignore
  */
-var readQueue = [];
+const readQueue = [];
 /**
  * @ignore
  */
-var writeQueue = [];
+const writeQueue = [];
 /**
  * @ignore
  */
-var idleQueue = [];
+const idleQueue = [];
 /**
  * @ignore
  */
-var fps = 1000 / 60;
+const fps = 1000 / 60;
 /**
  * [raf description]
  *
  * @ignore Exclude from docs
  * @todo Description
  */
-export var raf = (typeof requestAnimationFrame === "function"
+export const raf = (typeof requestAnimationFrame === "function"
     ? function (fn) {
         requestAnimationFrame(fn);
     }
@@ -50,17 +50,17 @@ export var raf = (typeof requestAnimationFrame === "function"
  * @todo Description
  */
 function frameLoop() {
-    var now = Date.now();
-    var length = nextQueue.length;
-    for (var i = 0; i < length; ++i) {
+    const now = Date.now();
+    const length = nextQueue.length;
+    for (let i = 0; i < length; ++i) {
         nextQueue[i](now);
     }
     $array.shiftLeft(nextQueue, length);
-    for (var i = 0; i < readQueue.length; ++i) {
+    for (let i = 0; i < readQueue.length; ++i) {
         readQueue[i](now);
     }
     readQueue.length = 0;
-    for (var i = 0; i < writeQueue.length; ++i) {
+    for (let i = 0; i < writeQueue.length; ++i) {
         writeQueue[i](now);
     }
     writeQueue.length = 0;
@@ -134,9 +134,9 @@ export function whenIdle(fn) {
  * @todo Maybe don't trigger a callback which was added while in the middle of triggering?
  */
 export function triggerIdle() {
-    var now = Date.now();
-    var length = idleQueue.length;
-    for (var i = 0; i < length; ++i) {
+    const now = Date.now();
+    const length = idleQueue.length;
+    for (let i = 0; i < length; ++i) {
         idleQueue.shift()(now);
     }
 }

package/.internal/core/util/AsyncPending.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"AsyncPending.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/AsyncPending.ts"],"names":[],"mappings":"AAAA,cAAc,CAAA,MAAM;AAEpB;;;;;GAKG;AACH,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAUlC;;GAEG;AACH,IAAI,YAAY,GAAG,KAAK,CAAC;AAEzB;;GAEG;AACH,~~IAAM~~,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,~~IAAM~~,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,~~IAAM~~,UAAU,GAAoB,EAAE,CAAC;AAEvC;;GAEG;AACH,~~IAAM~~,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,~~IAAM~~,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAEtB;;;;;GAKG;AACH,MAAM,CAAC,~~IAAM~~,GAAG,GACf,CAAC,OAAO,qBAAqB,KAAK,UAAU;IAC3C,CAAC,CAAC,UAAS,EAAc;QACxB,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,CAAC,CAAC,UAAS,EAAc;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;AAEL;;;;;GAKG;AACH,SAAS,SAAS;IACjB,~~IAAM~~,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAGvB,~~IAAM~~,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAClB;IAED,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAGpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC1C,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAClB;IAED,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAGrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC3C,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACnB;IAED,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAGtB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;QACrD,YAAY,GAAG,KAAK,CAAC;KAErB;SAAM;QACN,GAAG,CAAC,SAAS,CAAC,CAAC;KACf;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS;IACjB,IAAI,CAAC,YAAY,EAAE;QAClB,YAAY,GAAG,IAAI,CAAC;QAEpB,GAAG,CAAC,SAAS,CAAC,CAAC;KACf;AACF,CAAC;AAGD;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,EAAY;IACrC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,EAAY;IACrC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,EAAY;IACtC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAY;IACpC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW;IAC1B,~~IAAM~~,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,~~IAAM~~,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAC1B,SAAS,CAAC,KAAK,EAAG,CAAC,GAAG,CAAC,CAAC;KAC9B;AACF,CAAC","sourcesContent":["/** @ignore //* /\n\n/\n ============================================================================\n * IMPORTS\n * ============================================================================\n * @hidden\n /\nimport as $array from \"./Array\";\n\n/*\n [Listener description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nexport type Listener = (now: number) => void;\n\n/\n @ignore\n /\nlet pendingFrame = false;\n\n/\n @ignore\n /\nconst nextQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst readQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst writeQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst idleQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst fps = 1000 / 60;\n\n/\n [raf description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nexport const raf =\n\t(typeof requestAnimationFrame === \"function\"\n\t\t? function(fn: () => void): void {\n\t\t\trequestAnimationFrame(fn);\n\t\t}\n\t\t: function(fn: () => void): void {\n\t\t\tsetTimeout(fn, fps);\n\t\t});\n\n/\n [frameLoop description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nfunction frameLoop(): void {\n\tconst now = Date.now();\n\n\n\tconst length = nextQueue.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tnextQueue[i](now);\n\t}\n\n\t$array.shiftLeft(nextQueue, length);\n\n\n\tfor (let i = 0; i < readQueue.length; ++i) {\n\t\treadQueue[i](now);\n\t}\n\n\treadQueue.length = 0;\n\n\n\tfor (let i = 0; i < writeQueue.length; ++i) {\n\t\twriteQueue[i](now);\n\t}\n\n\twriteQueue.length = 0;\n\n\n\tif (nextQueue.length === 0 && readQueue.length === 0) {\n\t\tpendingFrame = false;\n\n\t} else {\n\t\traf(frameLoop);\n\t}\n}\n\n/\n [pendFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nfunction pendFrame(): void {\n\tif (!pendingFrame) {\n\t\tpendingFrame = true;\n\n\t\traf(frameLoop);\n\t}\n}\n\n\n/\n [nextFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function nextFrame(fn: Listener): void {\n\tnextQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [readFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function readFrame(fn: Listener): void {\n\treadQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [writeFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function writeFrame(fn: Listener): void {\n\twriteQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [whenIdle description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function whenIdle(fn: Listener): void {\n\tidleQueue.push(fn);\n}\n\n/\n [triggerIdle description]\n \n @ignore Exclude from docs\n * @todo Description\n * @todo Maybe don't trigger a callback which was added while in the middle of triggering?\n */\nexport function triggerIdle(): void {\n\tconst now = Date.now();\n\n\tconst length = idleQueue.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t(<any>idleQueue.shift())(now);\n\t}\n}\n"]}
1	+ {"version":3,"file":"AsyncPending.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/AsyncPending.ts"],"names":[],"mappings":"AAAA,cAAc,CAAA,MAAM;AAEpB;;;;;GAKG;AACH,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAUlC;;GAEG;AACH,IAAI,YAAY,GAAG,KAAK,CAAC;AAEzB;;GAEG;AACH,MAAM,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,MAAM,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,MAAM,UAAU,GAAoB,EAAE,CAAC;AAEvC;;GAEG;AACH,MAAM,SAAS,GAAoB,EAAE,CAAC;AAEtC;;GAEG;AACH,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAEtB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,GAAG,GACf,CAAC,OAAO,qBAAqB,KAAK,UAAU;IAC3C,CAAC,CAAC,UAAS,EAAc;QACxB,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,CAAC,CAAC,UAAS,EAAc;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;AAEL;;;;;GAKG;AACH,SAAS,SAAS;IACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAGvB,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAChC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAClB;IAED,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAGpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC1C,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KAClB;IAED,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAGrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC3C,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACnB;IAED,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAGtB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;QACrD,YAAY,GAAG,KAAK,CAAC;KAErB;SAAM;QACN,GAAG,CAAC,SAAS,CAAC,CAAC;KACf;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS;IACjB,IAAI,CAAC,YAAY,EAAE;QAClB,YAAY,GAAG,IAAI,CAAC;QAEpB,GAAG,CAAC,SAAS,CAAC,CAAC;KACf;AACF,CAAC;AAGD;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,EAAY;IACrC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,EAAY;IACrC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,EAAY;IACtC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,SAAS,EAAE,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAY;IACpC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW;IAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;QAC1B,SAAS,CAAC,KAAK,EAAG,CAAC,GAAG,CAAC,CAAC;KAC9B;AACF,CAAC","sourcesContent":["/** @ignore //* /\n\n/\n ============================================================================\n * IMPORTS\n * ============================================================================\n * @hidden\n /\nimport as $array from \"./Array\";\n\n/*\n [Listener description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nexport type Listener = (now: number) => void;\n\n/\n @ignore\n /\nlet pendingFrame = false;\n\n/\n @ignore\n /\nconst nextQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst readQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst writeQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst idleQueue: Array<Listener> = [];\n\n/\n @ignore\n /\nconst fps = 1000 / 60;\n\n/\n [raf description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nexport const raf =\n\t(typeof requestAnimationFrame === \"function\"\n\t\t? function(fn: () => void): void {\n\t\t\trequestAnimationFrame(fn);\n\t\t}\n\t\t: function(fn: () => void): void {\n\t\t\tsetTimeout(fn, fps);\n\t\t});\n\n/\n [frameLoop description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nfunction frameLoop(): void {\n\tconst now = Date.now();\n\n\n\tconst length = nextQueue.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\tnextQueue[i](now);\n\t}\n\n\t$array.shiftLeft(nextQueue, length);\n\n\n\tfor (let i = 0; i < readQueue.length; ++i) {\n\t\treadQueue[i](now);\n\t}\n\n\treadQueue.length = 0;\n\n\n\tfor (let i = 0; i < writeQueue.length; ++i) {\n\t\twriteQueue[i](now);\n\t}\n\n\twriteQueue.length = 0;\n\n\n\tif (nextQueue.length === 0 && readQueue.length === 0) {\n\t\tpendingFrame = false;\n\n\t} else {\n\t\traf(frameLoop);\n\t}\n}\n\n/\n [pendFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n /\nfunction pendFrame(): void {\n\tif (!pendingFrame) {\n\t\tpendingFrame = true;\n\n\t\traf(frameLoop);\n\t}\n}\n\n\n/\n [nextFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function nextFrame(fn: Listener): void {\n\tnextQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [readFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function readFrame(fn: Listener): void {\n\treadQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [writeFrame description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function writeFrame(fn: Listener): void {\n\twriteQueue.push(fn);\n\tpendFrame();\n}\n\n/\n [whenIdle description]\n \n @ignore Exclude from docs\n * @todo Description\n * @param fn [description]\n /\nexport function whenIdle(fn: Listener): void {\n\tidleQueue.push(fn);\n}\n\n/\n [triggerIdle description]\n \n @ignore Exclude from docs\n * @todo Description\n * @todo Maybe don't trigger a callback which was added while in the middle of triggering?\n */\nexport function triggerIdle(): void {\n\tconst now = Date.now();\n\n\tconst length = idleQueue.length;\n\n\tfor (let i = 0; i < length; ++i) {\n\t\t(<any>idleQueue.shift())(now);\n\t}\n}\n"]}

package/.internal/core/util/Benchmark.js CHANGED Viewed

@@ -3,8 +3,8 @@ import * as $array from "./Array";
 /**
  * @ignore
  */
-var Result = /** @class */ (function () {
-    function Result(duration, iterations) {
+class Result {
+    constructor(duration, iterations) {
         Object.defineProperty(this, "duration", {
             enumerable: true,
             configurable: true,
@@ -18,29 +18,23 @@ var Result = /** @class */ (function () {
             value: iterations
         });
     }
-    Object.defineProperty(Result.prototype, "ms", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function () {
-            return this.duration / this.iterations;
-        }
-    });
-    return Result;
-}());
+    ms() {
+        return this.duration / this.iterations;
+    }
+}
 /**
  * @ignore
  */
 function runTest(fn) {
-    var iterations = 0;
-    var start = Date.now();
-    var end = start + 10000;
+    let iterations = 0;
+    const start = Date.now();
+    const end = start + 10000;
     for (;;) {
         if (!fn()) {
             return;
         }
         ++iterations;
-        var now = Date.now();
+        const now = Date.now();
         if (now >= end) {
             return new Result(now - start, iterations);
         }
@@ -49,8 +43,8 @@ function runTest(fn) {
 /**
  * @ignore
  */
-var Benchmark = /** @class */ (function () {
-    function Benchmark() {
+export class Benchmark {
+    constructor() {
         Object.defineProperty(this, "tests", {
             enumerable: true,
             configurable: true,
@@ -58,41 +52,29 @@ var Benchmark = /** @class */ (function () {
             value: []
         });
     }
-    Object.defineProperty(Benchmark.prototype, "test", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function (name, fn) {
-            this.tests.push({ name: name, fn: fn });
-        }
-    });
-    Object.defineProperty(Benchmark.prototype, "run", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function () {
-            console.log("Benchmark starting...");
-            var maxLen = 0;
-            $array.each(this.tests, function (test) {
-                if (!test.fn()) {
-                    throw new Error(test.name + " failed");
-                }
-                maxLen = Math.max(maxLen, test.name.length);
-            });
-            var empty = runTest(function () { return true; }).ms();
-            $array.each(this.tests, function (test) {
-                var result = runTest(test.fn);
-                if (result) {
-                    console.log("".concat(test.name.padStart(maxLen), ":  ").concat((result.ms() - empty).toFixed(10), " ms"));
-                }
-                else {
-                    throw new Error(test.name + " failed");
-                }
-            });
-            console.log("Benchmark finished");
-        }
-    });
-    return Benchmark;
-}());
-export { Benchmark };
+    test(name, fn) {
+        this.tests.push({ name, fn });
+    }
+    run() {
+        console.log("Benchmark starting...");
+        let maxLen = 0;
+        $array.each(this.tests, (test) => {
+            if (!test.fn()) {
+                throw new Error(test.name + " failed");
+            }
+            maxLen = Math.max(maxLen, test.name.length);
+        });
+        const empty = runTest(() => true).ms();
+        $array.each(this.tests, (test) => {
+            const result = runTest(test.fn);
+            if (result) {
+                console.log(`${test.name.padStart(maxLen)}:  ${(result.ms() - empty).toFixed(10)} ms`);
+            }
+            else {
+                throw new Error(test.name + " failed");
+            }
+        });
+        console.log("Benchmark finished");
+    }
+}
 //# sourceMappingURL=Benchmark.js.map

package/.internal/core/util/Benchmark.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Benchmark.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Benchmark.ts"],"names":[],"mappings":"AAAA,cAAc,CAAA,MAAM;AAEpB,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAUlC;;GAEG;AACH;~~IACC~~,~~gBAAmB~~,QAAgB,EAAS,UAAkB;;;;;mBAA3C;;;;;;mBAAyB;;IAAqB,CAAC~~;;;;;eAElE~~;~~YACC~~,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;~~QACxC~~,CAAC~~;;IACF,aAAC~~;~~AAAD,CAAC,AAND,IAMC~~;AAED;;GAEG;AACH,SAAS,OAAO,CAAC,EAAiB;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,~~IAAM~~,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,~~IAAM~~,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC;IAE1B,SAAS;QACR,IAAI,CAAC,EAAE,EAAE,EAAE;YACV,OAAO;SACP;QAED,EAAE,UAAU,CAAC;QAEb,~~IAAM~~,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,IAAI,GAAG,IAAI,GAAG,EAAE;YACf,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,KAAK,EAAE,UAAU,CAAC,CAAC;SAC3C;KACD;AACF,CAAC;AAED;;GAEG;AACH;~~IAAA~~;QACC;;;;mBAA+B,EAAE;WAAC;IAkCnC,CAAC~~;;;;;eAhCA~~,~~UAAY~~,IAAY,EAAE,EAAiB;~~YAC1C~~,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,~~MAAA,~~EAAE,EAAE,~~IAAA,~~EAAE,CAAC,CAAC;~~QAC~~/B,CAAC~~;;;;;;eAED~~;~~YACC~~,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;~~YAErC~~,IAAI,MAAM,GAAG,CAAC,CAAC;~~YAEf~~,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,~~UAAC~~,IAAI;~~gBAC5B~~,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE;~~oBACf~~,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;~~iBACvC~~;~~gBAED~~,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;~~YAC7C~~,CAAC,CAAC,CAAC;~~YAEH~~,~~IAAM~~,KAAK,GAAG,OAAO,CAAC,~~cAAM~~,~~OAAA~~,IAAI,~~EAAJ,CAAI,~~CAAE,CAAC,EAAE,EAAE,CAAC;~~YAExC~~,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,~~UAAC~~,IAAI;~~gBAC5B~~,~~IAAM~~,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;~~gBAEhC~~,IAAI,MAAM,EAAE;~~oBACX~~,OAAO,CAAC,GAAG,CAAC,~~UAAG~~,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,~~gBAAM~~,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,~~QAAK~~,CAAC,CAAC;~~iBAEvF~~;~~qBAAM~~;~~oBACN~~,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;~~iBACvC~~;~~YACF~~,CAAC,CAAC,CAAC;~~YAEH~~,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;~~QACnC~~,CAAC~~;;IACF,gBAAC~~;~~AAAD,CAAC,AAnCD,IAmCC~~","sourcesContent":["/** @ignore //* /\n\nimport as $array from \"./Array\";\n\n/*\n @ignore\n /\ninterface Test {\n\tname: string;\n\tfn: () => boolean;\n}\n\n/\n @ignore\n /\nclass Result {\n\tconstructor(public duration: number, public iterations: number) {}\n\n\tpublic ms(): number {\n\t\treturn this.duration / this.iterations;\n\t}\n}\n\n/\n @ignore\n /\nfunction runTest(fn: () => boolean): Result \| undefined {\n\tlet iterations = 0;\n\n\tconst start = Date.now();\n\tconst end = start + 10000;\n\n\tfor (;;) {\n\t\tif (!fn()) {\n\t\t\treturn;\n\t\t}\n\n\t\t++iterations;\n\n\t\tconst now = Date.now();\n\n\t\tif (now >= end) {\n\t\t\treturn new Result(now - start, iterations);\n\t\t}\n\t}\n}\n\n/\n @ignore\n */\nexport class Benchmark {\n\tprotected tests: Array<Test> = [];\n\n\tpublic test(name: string, fn: () => boolean): void {\n\t\tthis.tests.push({ name, fn });\n\t}\n\n\tpublic run(): void {\n\t\tconsole.log(\"Benchmark starting...\");\n\n\t\tlet maxLen = 0;\n\n\t\t$array.each(this.tests, (test) => {\n\t\t\tif (!test.fn()) {\n\t\t\t\tthrow new Error(test.name + \" failed\");\n\t\t\t}\n\n\t\t\tmaxLen = Math.max(maxLen, test.name.length);\n\t\t});\n\n\t\tconst empty = runTest(() => true)!.ms();\n\n\t\t$array.each(this.tests, (test) => {\n\t\t\tconst result = runTest(test.fn);\n\n\t\t\tif (result) {\n\t\t\t\tconsole.log(`${test.name.padStart(maxLen)}: ${(result.ms() - empty).toFixed(10)} ms`);\n\n\t\t\t} else {\n\t\t\t\tthrow new Error(test.name + \" failed\");\n\t\t\t}\n\t\t});\n\n\t\tconsole.log(\"Benchmark finished\");\n\t}\n}\n"]}
1	+ {"version":3,"file":"Benchmark.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Benchmark.ts"],"names":[],"mappings":"AAAA,cAAc,CAAA,MAAM;AAEpB,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAUlC;;GAEG;AACH,MAAM,MAAM;IACX,YAAmB,QAAgB,EAAS,UAAkB;;;;;mBAA3C;;;;;;mBAAyB;;IAAqB,CAAC;IAE3D,EAAE;QACR,OAAO,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;IACxC,CAAC;CACD;AAED;;GAEG;AACH,SAAS,OAAO,CAAC,EAAiB;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC;IAE1B,SAAS;QACR,IAAI,CAAC,EAAE,EAAE,EAAE;YACV,OAAO;SACP;QAED,EAAE,UAAU,CAAC;QAEb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,IAAI,GAAG,IAAI,GAAG,EAAE;YACf,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,KAAK,EAAE,UAAU,CAAC,CAAC;SAC3C;KACD;AACF,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,SAAS;IAAtB;QACC;;;;mBAA+B,EAAE;WAAC;IAkCnC,CAAC;IAhCO,IAAI,CAAC,IAAY,EAAE,EAAiB;QAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/B,CAAC;IAEM,GAAG;QACT,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;QAErC,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;YAChC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE;gBACf,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;aACvC;YAED,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,CAAE,CAAC,EAAE,EAAE,CAAC;QAExC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;YAChC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEhC,IAAI,MAAM,EAAE;gBACX,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;aAEvF;iBAAM;gBACN,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;aACvC;QACF,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IACnC,CAAC;CACD","sourcesContent":["/** @ignore //* /\n\nimport as $array from \"./Array\";\n\n/*\n @ignore\n /\ninterface Test {\n\tname: string;\n\tfn: () => boolean;\n}\n\n/\n @ignore\n /\nclass Result {\n\tconstructor(public duration: number, public iterations: number) {}\n\n\tpublic ms(): number {\n\t\treturn this.duration / this.iterations;\n\t}\n}\n\n/\n @ignore\n /\nfunction runTest(fn: () => boolean): Result \| undefined {\n\tlet iterations = 0;\n\n\tconst start = Date.now();\n\tconst end = start + 10000;\n\n\tfor (;;) {\n\t\tif (!fn()) {\n\t\t\treturn;\n\t\t}\n\n\t\t++iterations;\n\n\t\tconst now = Date.now();\n\n\t\tif (now >= end) {\n\t\t\treturn new Result(now - start, iterations);\n\t\t}\n\t}\n}\n\n/\n @ignore\n */\nexport class Benchmark {\n\tprotected tests: Array<Test> = [];\n\n\tpublic test(name: string, fn: () => boolean): void {\n\t\tthis.tests.push({ name, fn });\n\t}\n\n\tpublic run(): void {\n\t\tconsole.log(\"Benchmark starting...\");\n\n\t\tlet maxLen = 0;\n\n\t\t$array.each(this.tests, (test) => {\n\t\t\tif (!test.fn()) {\n\t\t\t\tthrow new Error(test.name + \" failed\");\n\t\t\t}\n\n\t\t\tmaxLen = Math.max(maxLen, test.name.length);\n\t\t});\n\n\t\tconst empty = runTest(() => true)!.ms();\n\n\t\t$array.each(this.tests, (test) => {\n\t\t\tconst result = runTest(test.fn);\n\n\t\t\tif (result) {\n\t\t\t\tconsole.log(`${test.name.padStart(maxLen)}: ${(result.ms() - empty).toFixed(10)} ms`);\n\n\t\t\t} else {\n\t\t\t\tthrow new Error(test.name + \" failed\");\n\t\t\t}\n\t\t});\n\n\t\tconsole.log(\"Benchmark finished\");\n\t}\n}\n"]}

package/.internal/core/util/Children.js CHANGED Viewed

@@ -1,4 +1,3 @@
-import { __extends } from "tslib";
 import { List } from "./List";
 import * as $array from "./Array";
 /**
@@ -6,112 +5,88 @@ import * as $array from "./Array";
  *
  * @see {@link https://www.amcharts.com/docs/v5/concepts/common-elements/containers/} for more info
  */
-var Children = /** @class */ (function (_super) {
-    __extends(Children, _super);
-    function Children(container) {
-        var _this = _super.call(this) || this;
-        Object.defineProperty(_this, "_disposed", {
+export class Children extends List {
+    constructor(container) {
+        super();
+        Object.defineProperty(this, "_disposed", {
             enumerable: true,
             configurable: true,
             writable: true,
             value: false
         });
-        Object.defineProperty(_this, "_container", {
+        Object.defineProperty(this, "_container", {
             enumerable: true,
             configurable: true,
             writable: true,
             value: void 0
         });
-        Object.defineProperty(_this, "_events", {
+        Object.defineProperty(this, "_events", {
             enumerable: true,
             configurable: true,
             writable: true,
             value: void 0
         });
-        _this._container = container;
-        _this._events = _this.events.onAll(function (change) {
+        this._container = container;
+        this._events = this.events.onAll((change) => {
             if (change.type === "clear") {
-                $array.each(change.oldValues, function (x) {
-                    _this._onRemoved(x);
+                $array.each(change.oldValues, (x) => {
+                    this._onRemoved(x);
                 });
             }
             else if (change.type === "push") {
-                _this._onInserted(change.newValue);
+                this._onInserted(change.newValue);
             }
             else if (change.type === "setIndex") {
-                _this._onRemoved(change.oldValue);
-                _this._onInserted(change.newValue, change.index);
+                this._onRemoved(change.oldValue);
+                this._onInserted(change.newValue, change.index);
             }
             else if (change.type === "insertIndex") {
-                _this._onInserted(change.newValue, change.index);
+                this._onInserted(change.newValue, change.index);
             }
             else if (change.type === "removeIndex") {
-                _this._onRemoved(change.oldValue);
+                this._onRemoved(change.oldValue);
             }
             else if (change.type === "moveIndex") {
-                _this._onRemoved(change.value);
-                _this._onInserted(change.value, change.newIndex);
+                this._onRemoved(change.value);
+                this._onInserted(change.value, change.newIndex);
             }
             else {
                 throw new Error("Unknown IListEvent type");
             }
         });
-        return _this;
     }
-    Object.defineProperty(Children.prototype, "_onInserted", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function (child, index) {
-            child._setParent(this._container, true);
-            var childrenDisplay = this._container._childrenDisplay;
-            if (index === undefined) {
-                childrenDisplay.addChild(child._display);
-            }
-            else {
-                childrenDisplay.addChildAt(child._display, index);
-            }
+    _onInserted(child, index) {
+        child._setParent(this._container, true);
+        const childrenDisplay = this._container._childrenDisplay;
+        if (index === undefined) {
+            childrenDisplay.addChild(child._display);
         }
-    });
-    Object.defineProperty(Children.prototype, "_onRemoved", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function (child) {
-            this._container._childrenDisplay.removeChild(child._display);
-            this._container.markDirtyBounds();
-            this._container.markDirty();
+        else {
+            childrenDisplay.addChildAt(child._display, index);
         }
-    });
+    }
+    _onRemoved(child) {
+        this._container._childrenDisplay.removeChild(child._display);
+        this._container.markDirtyBounds();
+        this._container.markDirty();
+    }
     /**
      * Returns `true` if obejct is disposed.
      */
-    Object.defineProperty(Children.prototype, "isDisposed", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function () {
-            return this._disposed;
-        }
-    });
+    isDisposed() {
+        return this._disposed;
+    }
     /**
      * Permanently dispose this object.
      */
-    Object.defineProperty(Children.prototype, "dispose", {
-        enumerable: false,
-        configurable: true,
-        writable: true,
-        value: function () {
-            if (!this._disposed) {
-                this._disposed = true;
-                this._events.dispose();
-                $array.each(this.values, function (child) {
-                    child.dispose();
-                });
-            }
+    dispose() {
+        if (!this._disposed) {
+            this._disposed = true;
+            this._events.dispose();
+            $array.each(this.values, (child) => {
+                child.dispose();
+            });
         }
-    });
-    return Children;
-}(List));
-export { Children };
+    }
+}
 //# sourceMappingURL=Children.js.map

package/.internal/core/util/Children.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Children.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Children.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAI9B,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAElC;;;;GAIG;AACH~~;IAAgD~~,~~4BAAO~~;IAKtD,~~kBAAmB~~,SAAoB;~~QAAvC~~,~~YACC~~,~~iBAAO~~,~~SA+BP~~;~~QApCD~~;;;;mBAA6B,KAAK;WAAC;QACnC;;;;;WAA8B;QAC9B;;;;;WAA2B;QAK1B,~~KAAI~~,CAAC,UAAU,GAAG,SAAS,CAAC;QAE5B,~~KAAI~~,CAAC,OAAO,GAAG,~~KAAI~~,CAAC,MAAM,CAAC,KAAK,CAAC,~~UAAC~~,MAAM;~~YACvC~~,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;gBAC5B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,~~UAAC~~,CAAC;~~oBAC/B~~,~~KAAI~~,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,CAAC,CAAC;aAEH;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;gBAClC,~~KAAI~~,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAElC;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;gBACtC,~~KAAI~~,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACjC,~~KAAI~~,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;aAEhD;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EAAE;gBACzC,~~KAAI~~,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;aAEhD;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EAAE;gBACzC,~~KAAI~~,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAEjC;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,EAAE;gBACvC,~~KAAI~~,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC9B,~~KAAI~~,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;aAEhD;iBAAM;gBACN,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;aAC3C;QACF,CAAC,CAAC,CAAC;;IACJ,CAAC~~;;;;;eAED~~,~~UAAsB~~,KAAQ,EAAE,KAAc;~~YAC7C~~,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;~~YACxC~~,~~IAAM~~,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC;~~YACzD~~,IAAI,KAAK,KAAK,SAAS,EAAE;~~gBACxB~~,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;~~aAEzC~~;~~iBAAM~~;~~gBACN~~,eAAe,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;~~aAClD~~;~~QACF~~,CAAC~~;;;;;;eAED~~,~~UAAqB~~,KAAQ;~~YAC5B~~,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;~~YAC7D~~,IAAI,CAAC,UAAU,CAAC,eAAe,EAAE,CAAC;~~YAClC~~,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;~~QAC7B~~,CAAC;;IAED;;OAEG~~;;;;;eACH~~;~~YACC~~,OAAO,IAAI,CAAC,SAAS,CAAC;~~QACvB~~,CAAC;;IAED;;OAEG~~;;;;;eACH~~;~~YACC~~,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;~~gBACpB~~,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;~~gBAEtB~~,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;~~gBAEvB~~,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,~~UAAC~~,KAAK;~~oBAC9B~~,KAAK,CAAC,OAAO,EAAE,CAAC;~~gBACjB~~,CAAC,CAAC,CAAC;~~aACH~~;~~QACF~~,CAAC~~;;IACF,eAAC~~;~~AAAD,CAAC,AA7ED,CAAgD,IAAI,GA6EnD~~","sourcesContent":["import { List } from \"./List\";\nimport type { IDisposer } from \"./Disposer\";\nimport type { Container } from \"../render/Container\";\nimport type { Sprite } from \"../render/Sprite\";\nimport * as $array from \"./Array\";\n\n/*\n A version of [[List]] to hold children of the [[Container]].\n \n @see {@link https://www.amcharts.com/docs/v5/concepts/common-elements/containers/} for more info\n /\nexport class Children<A extends Sprite> extends List<A> implements IDisposer {\n\tprivate _disposed: boolean = false;\n\tprivate _container: Container;\n\tprivate _events: IDisposer;\n\n\tpublic constructor(container: Container) {\n\t\tsuper();\n\n\t\tthis._container = container;\n\n\t\tthis._events = this.events.onAll((change) => {\n\t\t\tif (change.type === \"clear\") {\n\t\t\t\t$array.each(change.oldValues, (x) => {\n\t\t\t\t\tthis._onRemoved(x);\n\t\t\t\t});\n\n\t\t\t} else if (change.type === \"push\") {\n\t\t\t\tthis._onInserted(change.newValue);\n\n\t\t\t} else if (change.type === \"setIndex\") {\n\t\t\t\tthis._onRemoved(change.oldValue);\n\t\t\t\tthis._onInserted(change.newValue, change.index);\n\n\t\t\t} else if (change.type === \"insertIndex\") {\n\t\t\t\tthis._onInserted(change.newValue, change.index);\n\n\t\t\t} else if (change.type === \"removeIndex\") {\n\t\t\t\tthis._onRemoved(change.oldValue);\n\n\t\t\t} else if (change.type === \"moveIndex\") {\n\t\t\t\tthis._onRemoved(change.value);\n\t\t\t\tthis._onInserted(change.value, change.newIndex);\n\n\t\t\t} else {\n\t\t\t\tthrow new Error(\"Unknown IListEvent type\");\n\t\t\t}\n\t\t});\n\t}\n\n\tprotected _onInserted(child: A, index?: number) {\n\t\tchild._setParent(this._container, true);\n\t\tconst childrenDisplay = this._container._childrenDisplay;\n\t\tif (index === undefined) {\n\t\t\tchildrenDisplay.addChild(child._display);\n\n\t\t} else {\n\t\t\tchildrenDisplay.addChildAt(child._display, index);\n\t\t}\n\t}\n\n\tprotected _onRemoved(child: A) {\n\t\tthis._container._childrenDisplay.removeChild(child._display);\n\t\tthis._container.markDirtyBounds();\n\t\tthis._container.markDirty();\n\t}\n\n\t/\n\t Returns `true` if obejct is disposed.\n\t /\n\tpublic isDisposed(): boolean {\n\t\treturn this._disposed;\n\t}\n\n\t/\n\t Permanently dispose this object.\n\t */\n\tpublic dispose() {\n\t\tif (!this._disposed) {\n\t\t\tthis._disposed = true;\n\n\t\t\tthis._events.dispose();\n\n\t\t\t$array.each(this.values, (child) => {\n\t\t\t\tchild.dispose();\n\t\t\t});\n\t\t}\n\t}\n}\n"]}
1	+ {"version":3,"file":"Children.js","sourceRoot":"","sources":["../../../../../src/.internal/core/util/Children.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAI9B,OAAO,KAAK,MAAM,MAAM,SAAS,CAAC;AAElC;;;;GAIG;AACH,MAAM,OAAO,QAA2B,SAAQ,IAAO;IAKtD,YAAmB,SAAoB;QACtC,KAAK,EAAE,CAAC;QALT;;;;mBAA6B,KAAK;WAAC;QACnC;;;;;WAA8B;QAC9B;;;;;WAA2B;QAK1B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAE5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE;YAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;gBAC5B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;oBACnC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,CAAC,CAAC;aAEH;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;gBAClC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAElC;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;gBACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;aAEhD;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EAAE;gBACzC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;aAEhD;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EAAE;gBACzC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAEjC;iBAAM,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,EAAE;gBACvC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC9B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;aAEhD;iBAAM;gBACN,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;aAC3C;QACF,CAAC,CAAC,CAAC;IACJ,CAAC;IAES,WAAW,CAAC,KAAQ,EAAE,KAAc;QAC7C,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACxC,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC;QACzD,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;SAEzC;aAAM;YACN,eAAe,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;SAClD;IACF,CAAC;IAES,UAAU,CAAC,KAAQ;QAC5B,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC7D,IAAI,CAAC,UAAU,CAAC,eAAe,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,UAAU;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED;;OAEG;IACI,OAAO;QACb,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YAEtB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;YAEvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBAClC,KAAK,CAAC,OAAO,EAAE,CAAC;YACjB,CAAC,CAAC,CAAC;SACH;IACF,CAAC;CACD","sourcesContent":["import { List } from \"./List\";\nimport type { IDisposer } from \"./Disposer\";\nimport type { Container } from \"../render/Container\";\nimport type { Sprite } from \"../render/Sprite\";\nimport * as $array from \"./Array\";\n\n/*\n A version of [[List]] to hold children of the [[Container]].\n \n @see {@link https://www.amcharts.com/docs/v5/concepts/common-elements/containers/} for more info\n /\nexport class Children<A extends Sprite> extends List<A> implements IDisposer {\n\tprivate _disposed: boolean = false;\n\tprivate _container: Container;\n\tprivate _events: IDisposer;\n\n\tpublic constructor(container: Container) {\n\t\tsuper();\n\n\t\tthis._container = container;\n\n\t\tthis._events = this.events.onAll((change) => {\n\t\t\tif (change.type === \"clear\") {\n\t\t\t\t$array.each(change.oldValues, (x) => {\n\t\t\t\t\tthis._onRemoved(x);\n\t\t\t\t});\n\n\t\t\t} else if (change.type === \"push\") {\n\t\t\t\tthis._onInserted(change.newValue);\n\n\t\t\t} else if (change.type === \"setIndex\") {\n\t\t\t\tthis._onRemoved(change.oldValue);\n\t\t\t\tthis._onInserted(change.newValue, change.index);\n\n\t\t\t} else if (change.type === \"insertIndex\") {\n\t\t\t\tthis._onInserted(change.newValue, change.index);\n\n\t\t\t} else if (change.type === \"removeIndex\") {\n\t\t\t\tthis._onRemoved(change.oldValue);\n\n\t\t\t} else if (change.type === \"moveIndex\") {\n\t\t\t\tthis._onRemoved(change.value);\n\t\t\t\tthis._onInserted(change.value, change.newIndex);\n\n\t\t\t} else {\n\t\t\t\tthrow new Error(\"Unknown IListEvent type\");\n\t\t\t}\n\t\t});\n\t}\n\n\tprotected _onInserted(child: A, index?: number) {\n\t\tchild._setParent(this._container, true);\n\t\tconst childrenDisplay = this._container._childrenDisplay;\n\t\tif (index === undefined) {\n\t\t\tchildrenDisplay.addChild(child._display);\n\n\t\t} else {\n\t\t\tchildrenDisplay.addChildAt(child._display, index);\n\t\t}\n\t}\n\n\tprotected _onRemoved(child: A) {\n\t\tthis._container._childrenDisplay.removeChild(child._display);\n\t\tthis._container.markDirtyBounds();\n\t\tthis._container.markDirty();\n\t}\n\n\t/\n\t Returns `true` if obejct is disposed.\n\t /\n\tpublic isDisposed(): boolean {\n\t\treturn this._disposed;\n\t}\n\n\t/\n\t Permanently dispose this object.\n\t */\n\tpublic dispose() {\n\t\tif (!this._disposed) {\n\t\t\tthis._disposed = true;\n\n\t\t\tthis._events.dispose();\n\n\t\t\t$array.each(this.values, (child) => {\n\t\t\t\tchild.dispose();\n\t\t\t});\n\t\t}\n\t}\n}\n"]}