{"version":3,"sources":["jsdelivr-header.js","/npm/@mlx/clusterize@0.0.14/clusterize/index.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,CCNA,SAA2C,EAAM,GAChD,GAAsB,iBAAZ,SAA0C,iBAAX,OACxC,OAAO,QAAU,SACb,GAAqB,mBAAX,QAAyB,OAAO,IAC9C,OAAO,GAAI,OACP,CACJ,IAAI,EAAI,IACR,IAAI,IAAI,KAAK,GAAuB,iBAAZ,QAAuB,QAAU,GAAM,GAAK,EAAE,EACvE,CACA,CATD,CASmB,oBAAT,KAAuB,KAAO,MAAM,WAC9C,OAAgB,SAAU,GAEhB,IAAI,EAAmB,CAAC,EAGxB,SAAS,EAAoB,GAG5B,GAAG,EAAiB,GACnB,OAAO,EAAiB,GAAU,QAGnC,IAAI,EAAS,EAAiB,GAAY,CACzC,EAAG,EACH,GAAG,EACH,QAAS,CAAC,GAUX,OANA,EAAQ,GAAU,KAAK,EAAO,QAAS,EAAQ,EAAO,QAAS,GAG/D,EAAO,GAAI,EAGJ,EAAO,OACf,CAoCA,OAhCA,EAAoB,EAAI,EAGxB,EAAoB,EAAI,EAGxB,EAAoB,EAAI,SAAS,EAAS,EAAM,GAC3C,EAAoB,EAAE,EAAS,IAClC,OAAO,eAAe,EAAS,EAAM,CACpC,cAAc,EACd,YAAY,EACZ,IAAK,GAGR,EAGA,EAAoB,EAAI,SAAS,GAChC,IAAI,EAAS,GAAU,EAAO,WAC7B,WAAwB,OAAO,EAAgB,OAAG,EAClD,WAA8B,OAAO,CAAQ,EAE9C,OADA,EAAoB,EAAE,EAAQ,IAAK,GAC5B,CACR,EAGA,EAAoB,EAAI,SAAS,EAAQ,GAAY,OAAO,OAAO,UAAU,eAAe,KAAK,EAAQ,EAAW,EAGpH,EAAoB,EAAI,GAGjB,EAAoB,EAAoB,EAAI,EACnD,CA/DM,CAiEN,CAEJ,SAAU,EAAQ,EAAS,GAEjC,aAEA,IAAI,EAAY,MAAQ,KAAK,UAAa,SAAU,GAChD,IAAI,EAAsB,mBAAX,QAAyB,EAAE,OAAO,UAAW,EAAI,EAChE,OAAI,EAAU,EAAE,KAAK,GACd,CACH,KAAM,WAEF,OADI,GAAK,GAAK,EAAE,SAAQ,OAAI,GACrB,CAAE,MAAO,GAAK,EAAE,KAAM,MAAO,EACxC,EAER,EACA,OAAO,eAAe,EAAS,aAAc,CAAE,OAAO,IACtD,IAAI,EAAW,EAAoB,GAC/B,EAAgB,EAAoB,GACpC,EAAmB,EAAoB,GAsCvC,EAAuB,SAAU,EAAS,EAAM,EAAa,GAC7D,IAgDI,EAAK,EAAI,EAAK,EAhDd,GAAU,EACd,IACI,IAAK,IAAI,EAAY,EAAS,GAAU,EAAc,EAAU,QAAS,EAAY,KAAM,EAAc,EAAU,OAAQ,CACvH,IAAI,EAAI,EAAY,MACpB,IACI,IAAK,IAAI,EAAY,EAAS,GAAU,EAAc,EAAU,QAAS,EAAY,KAAM,EAAc,EAAU,OAAQ,CACvH,IAAI,EAAI,EAAY,MACpB,GAAI,IAAM,EAAV,CAIA,IAAI,EAAQ,EAAK,KAAK,EAAiB,GAAG,YACtC,EAAQ,EAAK,KAAK,EAAiB,GAAG,YAC1C,GAAI,EAAM,SAAW,EAAM,OAA3B,CAGA,IAAI,EAAW,EAAK,IAAI,EAAiB,GAAI,EAAiB,IAC9D,IAAK,EACD,MAAM,IAAI,MAAM,mBAEpB,IAAI,EAAQ,EAAS,GAAG,WACxB,GAAI,EAAQ,QAAQ,GAAS,EACzB,MAAQ,EAAY,IAAU,IAAI,QAC9B,EAAQ,KAAK,EAAY,GAAO,OAChC,GAAU,CATlB,CANA,CAkBJ,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAgB,EAAY,OAAS,EAAK,EAAU,SAAS,EAAG,KAAK,EAC7E,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACJ,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAgB,EAAY,OAAS,EAAK,EAAU,SAAS,EAAG,KAAK,EAC7E,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACI,GACA,EAAqB,EAAS,EAAM,EAAa,EAGzD,EACA,EAAQ,WAAa,SAAU,EAAa,EAAS,GACjD,GAAI,GAAK,EACL,MAAM,IAAI,MAAM,qDAEpB,IAAI,EAAQ,IAAI,IAOhB,GANA,OAAO,KAAK,GAAa,SAAQ,SAAU,GACvC,EAAM,IAAI,GACV,OAAO,KAAK,EAAY,IAAI,SAAQ,SAAU,GAC1C,EAAM,IAAI,EACd,GACJ,IACI,EAAI,EAAM,KACV,MAAM,IAAI,MAAM,8EAEpB,GAAI,IAAM,EAAM,KAAM,CAClB,IAAI,EAAS,GACb,IACI,IAAK,IAAI,EAAK,EAAS,EAAM,UAAW,EAAK,EAAG,QAAS,EAAG,KAAM,EAAK,EAAG,OAAQ,CAC9E,IAAI,EAAI,EAAG,MACX,EAAO,KAAK,CAAC,GACjB,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAO,EAAG,OAAS,EAAK,EAAG,SAAS,EAAG,KAAK,EACpD,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACA,OAAO,CACX,CACA,GAAU,IAAN,EAAS,CACT,IAAI,EAAU,GACd,IACI,IAAK,IAAI,EAAK,EAAS,EAAM,UAAW,EAAK,EAAG,QAAS,EAAG,KAAM,EAAK,EAAG,OAAQ,CAC1E,EAAI,EAAG,MACX,EAAQ,KAAK,EACjB,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAO,EAAG,OAAS,EAAK,EAAG,SAAS,EAAG,KAAK,EACpD,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACA,MAAO,CAAC,EACZ,CAKA,IAAI,EAAa,IAAI,EAAc,WACnC,EAAW,MAAM,GAEjB,IAAI,EAAmB,CAAC,EACxB,EAAQ,SAAQ,SAAU,GACtB,EAAiB,EAAE,YAAc,CACrC,IAyCA,IAxCA,IA6CI,EAAK,EAAI,EAAK,EA7Cd,EAAU,WAEV,IAAI,EAAK,EAAiB,cAAc,EAAa,GAEjD,EAAK,EAAS,OAAO,GAIrB,EAAmB,CAAC,EACxB,EAAG,SAAQ,SAAU,GACjB,IACI,IAAK,IAAI,EAAM,EAAS,GAAI,EAAQ,EAAI,QAAS,EAAM,KAAM,EAAQ,EAAI,OAAQ,CAC7E,IAAI,EAAM,EAAM,MAChB,EAAiB,GAAO,CAC5B,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAU,EAAM,OAAS,EAAK,EAAI,SAAS,EAAG,KAAK,EAC3D,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACA,IAAI,EAAK,CACb,IAKA,EAAG,SAAQ,SAAU,GACjB,EAAqB,EAAG,EAAY,EAAkB,EAC1D,IAEA,IApLkB,EAClB,EAmLI,EAAM,EAAG,QAAO,SAAU,GAAK,OAAO,EAAE,MAAQ,IACpD,GAAI,EAAI,QAAU,EACd,MAAO,CAAE,MAAO,GAtLF,EAyLR,EAxLV,EAAU,IACd,OAAO,KAAK,GAAO,SAAQ,SAAU,GACjC,OAAO,KAAK,EAAM,IAAI,SAAQ,SAAU,GAChC,EAAM,GAAG,GAAK,GAAW,EAAM,GAAG,GAAK,IACvC,EAAU,EAAM,GAAG,GAE3B,GACJ,IACA,OAAO,KAAK,GAAO,SAAQ,SAAU,GACjC,OAAO,KAAK,EAAM,IAAI,SAAQ,SAAU,GACpC,EAAM,GAAG,GAAK,KAAK,IAAI,EAAM,GAAG,GAAK,EAAS,EAClD,GACJ,GA6KA,IACa,CACT,IAAI,EAAU,IACd,GAAuB,iBAAZ,EACP,OAAO,EAAQ,KACvB,CAEJ,CAGO,EAED,SAAU,EAAQ,EAAS,GAEjC,aAEA,OAAO,eAAe,EAAS,aAAc,CAAE,OAAO,IACtD,EAAQ,OAAS,SAAU,GACvB,EAAQ,GAAS,CAAC,EAClB,IAAI,EAAU,CAAC,EACX,EAAa,CAAC,EACd,EAAU,CAAC,EACX,EAAS,GACT,EAAQ,GACR,EAAQ,EACR,EAAqB,SAAU,GAC/B,EAAM,KAAK,GACX,EAAQ,IAAQ,EAChB,EAAQ,GAAQ,EAChB,EAAW,GAAQ,EACnB,GAAS,EACT,EAAM,GAAM,SAAQ,SAAU,QACP,IAAf,EAAQ,IACR,EAAmB,GACnB,EAAW,GAAQ,KAAK,IAAI,EAAW,GAAI,EAAW,KAEjD,EAAQ,KACb,EAAW,GAAQ,KAAK,IAAI,EAAW,GAAO,EAAQ,IAE9D,IAEA,IAAI,EAAK,GACT,GAAI,EAAQ,KAAU,EAAW,GAAO,CACpC,IAAI,OAAU,EACd,GACI,EAAU,EAAM,MAChB,EAAQ,IAAW,EACnB,EAAG,KAAK,SACH,EAAM,OAAS,GAAK,IAAS,GACtC,EAAO,KAAK,EAChB,CACJ,EAMA,OALA,OAAO,KAAK,GAAO,SAAQ,SAAU,GAC5B,EAAQ,IACT,EAAmB,EAE3B,IACO,CACX,CAGO,EAED,SAAU,EAAQ,EAAS,GAEjC,aAEA,IAAI,EAAY,MAAQ,KAAK,UAAa,SAAU,GAChD,IAAI,EAAsB,mBAAX,QAAyB,EAAE,OAAO,UAAW,EAAI,EAChE,OAAI,EAAU,EAAE,KAAK,GACd,CACH,KAAM,WAEF,OADI,GAAK,GAAK,EAAE,SAAQ,OAAI,GACrB,CAAE,MAAO,GAAK,EAAE,KAAM,MAAO,EACxC,EAER,EACA,OAAO,eAAe,EAAS,aAAc,CAAE,OAAO,IACtD,IAAI,EAAqB,EAAoB,GACzC,EACA,SAAoB,EAAK,GACrB,KAAK,IAAM,EACX,KAAK,OAAS,EACd,KAAK,KAAO,GACZ,KAAK,SAAW,CAAC,CACrB,EAGJ,EAAQ,WAAa,EACrB,IAAI,EAA4B,WAC5B,SAAS,IACL,KAAK,KAAO,IAChB,CA4HA,OA3HA,EAAW,UAAU,MAAQ,SAAU,GACnC,IAAI,EAAQ,EAAE,QAAO,SAAU,GAAK,OAAQ,EAAE,gBAAkB,IAChE,GAAqB,IAAjB,EAAM,OACN,MAAM,IAAI,MAAM,2BAEpB,IAAI,EAAO,EAAM,GACjB,KAAK,KAAO,IAAI,EAAW,EAAK,WAAY,MAC5C,KAAK,KAAK,KAAK,KAAK,GACpB,EAAI,EAAE,QAAO,SAAU,GAAK,OAAO,EAAE,gBAAkB,IAEvD,IAAI,EAAQ,CAAC,EACb,IACI,IAAK,IAAI,EAAM,EAAS,GAAI,EAAQ,EAAI,QAAS,EAAM,KAAM,EAAQ,EAAI,OAAQ,CAC7E,IAAI,EAAI,EAAM,MACd,EAAM,EAAE,YAAc,EAC1B,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAU,EAAM,OAAS,EAAK,EAAI,SAAS,EAAG,KAAK,EAC3D,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACA,IAAI,EAAY,CAAC,EACjB,IACI,IAAK,IAAI,EAAM,EAAS,GAAI,EAAQ,EAAI,QAAS,EAAM,KAAM,EAAQ,EAAI,OAAQ,EACzE,EAAI,EAAM,OACR,mBAAqB,EAAK,YAC5B,EAAM,EAAE,kBAAkB,KAAK,EAAE,YAErC,EAAU,EAAE,YAAc,EAAU,EAAE,aAAe,GACrD,EAAU,EAAE,YAAY,KAAK,EACjC,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAU,EAAM,OAAS,EAAK,EAAI,SAAS,EAAG,KAAK,EAC3D,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CAEA,OAAO,KAAK,GAAO,SAAQ,SAAU,GACjC,EAAM,GAAK,EAAM,GAAG,QAAO,SAAU,EAAG,GAAK,OAAO,EAAM,GAAG,QAAQ,KAAO,CAAG,GACnF,IACA,IAyBI,EAAK,EAAI,EAAK,EAAI,EAAK,EAzBvB,EAAiB,EAAmB,gBAAgB,GACpD,EAAU,SAAU,GACpB,IAAI,EAAc,EAAU,GAAG,GAAG,iBAC9B,EAAW,EAAO,KAAK,GAC3B,IAAK,EACD,MAAM,IAAI,MAAM,iCAAmC,GAEvD,IAAI,EAAO,EAAS,SAAS,IAAM,IAAI,EAAW,EAAG,GACrD,EAAU,GAAG,SAAQ,SAAU,GAAK,OAAO,EAAK,KAAK,KAAK,EAAI,IAC9D,EAAS,SAAS,GAAK,CAC3B,EACI,EAAS,KACb,IACI,IAAK,IAAI,EAAmB,EAAS,GAAiB,EAAqB,EAAiB,QAAS,EAAmB,KAAM,EAAqB,EAAiB,OAAQ,CAExK,EADI,EAAI,EAAmB,MAE/B,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAuB,EAAmB,OAAS,EAAK,EAAiB,SAAS,EAAG,KAAK,EAClG,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CAEJ,EACA,EAAW,UAAU,IAAM,SAAU,EAAG,GACpC,IAAI,EAAK,KAAK,KAAK,EAAE,YACjB,EAAK,KAAK,KAAK,EAAE,YACrB,IAAK,IAAO,EACR,OAAO,KAIX,IAFA,IAAI,EAAU,CAAC,EACX,EAAQ,EACL,GACH,EAAQ,EAAM,MAAO,EACrB,EAAQ,EAAM,OAGlB,IADA,IAAI,EAAQ,EACL,GAAO,CACV,GAAI,EAAQ,EAAM,KACd,OAAO,EAAM,KAEjB,EAAQ,EAAM,MAAO,EACrB,EAAQ,EAAM,MAClB,CAEA,IADA,EAAQ,EACD,GAAO,CACV,GAAI,EAAQ,EAAM,KACd,OAAO,EAAM,KAEjB,EAAQ,EAAM,MAClB,CACA,OAAO,IACX,EACA,EAAW,UAAU,KAAO,SAAU,GAClC,IAAK,KAAK,KACN,OAAO,KAYX,IAVA,IAAI,EAAQ,CAAC,KAAK,MACd,EAAU,WACV,IAAI,EAAI,EAAM,MACd,GAAI,EAAE,MAAQ,EACV,MAAO,CAAE,MAAO,GAEpB,OAAO,KAAK,EAAE,UAAU,SAAQ,SAAU,GACtC,EAAM,KAAK,EAAE,SAAS,GAC1B,GACJ,EACO,EAAM,QAAQ,CACjB,IAAI,EAAU,IACd,GAAuB,iBAAZ,EACP,OAAO,EAAQ,KACvB,CACA,OAAO,IACX,EACO,CACX,CAhI+B,GAiI/B,EAAQ,WAAa,CAGd,EAED,SAAU,EAAQ,EAAS,GAEjC,aAEA,OAAO,eAAe,EAAS,aAAc,CAAE,OAAO,IACtD,EAAQ,gBAAkB,WACtB,SAAS,EAAsB,EAAM,EAAS,EAAM,EAAO,GACvD,EAAK,IAAQ,EAEb,IADA,IAAI,EAAY,EAAM,GACb,EAAI,EAAG,EAAI,EAAU,OAAQ,GAAK,EAAG,CAC1C,IAAI,EAAI,EAAU,GAClB,GAAI,EAAK,GACL,MAAM,IAAI,MAAM,0BAEf,EAAQ,IACT,EAAsB,EAAG,EAAS,EAAM,EAAO,EAEvD,CACA,EAAK,IAAQ,EACb,EAAQ,IAAQ,EAChB,EAAO,KAAK,EAChB,CACA,OAAO,SAAU,GACb,IAAI,EAAS,GACT,EAAU,CAAC,EACX,EAAO,CAAC,EACZ,IAAK,IAAI,KAAQ,EACR,EAAQ,IAAU,EAAK,IACxB,EAAsB,EAAM,EAAS,EAAM,EAAO,GAG1D,OAAO,EAAO,SAClB,CACH,CA5ByB,EA+BnB,EAED,SAAU,EAAQ,EAAS,GAEjC,aAEA,IAAI,EAAY,MAAQ,KAAK,UAAa,SAAU,GAChD,IAAI,EAAsB,mBAAX,QAAyB,EAAE,OAAO,UAAW,EAAI,EAChE,OAAI,EAAU,EAAE,KAAK,GACd,CACH,KAAM,WAEF,OADI,GAAK,GAAK,EAAE,SAAQ,OAAI,GACrB,CAAE,MAAO,GAAK,EAAE,KAAM,MAAO,EACxC,EAER,EACA,OAAO,eAAe,EAAS,aAAc,CAAE,OAAO,IACtD,IAAI,EAAY,SAAU,EAAG,EAAG,GAC5B,OAAQ,EAAM,IAAM,EAAM,GAAG,IAAM,EAAM,GAAG,GAAK,GAAO,EAAM,IAAM,EAAM,GAAG,IAAM,EAAM,GAAG,GAAK,CACrG,EACA,EAAQ,cAAgB,SAAU,EAAO,GACrC,IAiCI,EAAK,EAAI,EAAK,EAjCd,EAAK,CAAC,EACV,IACI,IAAK,IAAI,EAAK,EAAS,EAAM,UAAW,EAAK,EAAG,QAAS,EAAG,KAAM,EAAK,EAAG,OAAQ,CAC9E,IAAI,EAAI,EAAG,MACX,EAAG,GAAK,GACR,IACI,IAAK,IAAI,EAAK,EAAS,EAAM,UAAW,EAAK,EAAG,QAAS,EAAG,KAAM,EAAK,EAAG,OAAQ,CAC9E,IAAI,EAAI,EAAG,MACP,IAAM,IAGN,EAAU,EAAG,EAAG,IAChB,EAAG,GAAG,KAAK,GAEnB,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAO,EAAG,OAAS,EAAK,EAAG,SAAS,EAAG,KAAK,EACpD,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACJ,CACJ,CACA,MAAO,GAAS,EAAM,CAAE,MAAO,EAAS,CACxC,QACI,IACQ,IAAO,EAAG,OAAS,EAAK,EAAG,SAAS,EAAG,KAAK,EACpD,CACA,QAAU,GAAI,EAAK,MAAM,EAAI,KAAO,CACxC,CACA,OAAO,CAEX,CAGO,GAEP","file":"/npm/@mlx/clusterize@0.0.14/clusterize/index.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/@mlx/clusterize@0.0.14/clusterize/index.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse {\n\t\tvar a = factory();\n\t\tfor(var i in a) (typeof exports === 'object' ? exports : root)[i] = a[i];\n\t}\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId]) {\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// define getter function for harmony exports\n/******/ \t__webpack_require__.d = function(exports, name, getter) {\n/******/ \t\tif(!__webpack_require__.o(exports, name)) {\n/******/ \t\t\tObject.defineProperty(exports, name, {\n/******/ \t\t\t\tconfigurable: false,\n/******/ \t\t\t\tenumerable: true,\n/******/ \t\t\t\tget: getter\n/******/ \t\t\t});\n/******/ \t\t}\n/******/ \t};\n/******/\n/******/ \t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t__webpack_require__.n = function(module) {\n/******/ \t\tvar getter = module && module.__esModule ?\n/******/ \t\t\tfunction getDefault() { return module['default']; } :\n/******/ \t\t\tfunction getModuleExports() { return module; };\n/******/ \t\t__webpack_require__.d(getter, 'a', getter);\n/******/ \t\treturn getter;\n/******/ \t};\n/******/\n/******/ \t// Object.prototype.hasOwnProperty.call\n/******/ \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 0);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __values = (this && this.__values) || function (o) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\n    if (m) return m.call(o);\n    return {\n        next: function () {\n            if (o && i >= o.length) o = void 0;\n            return { value: o && o[i++], done: !o };\n        }\n    };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar tarjan_1 = __webpack_require__(1);\nvar bundle_tree_1 = __webpack_require__(2);\nvar neighbors_list_1 = __webpack_require__(4);\nvar trimGraph = function (graph) {\n    var minEdge = Infinity;\n    Object.keys(graph).forEach(function (k) {\n        Object.keys(graph[k]).forEach(function (n) {\n            if (graph[k][n] < minEdge && graph[k][n] > 0) {\n                minEdge = graph[k][n];\n            }\n        });\n    });\n    Object.keys(graph).forEach(function (k) {\n        Object.keys(graph[k]).forEach(function (n) {\n            graph[k][n] = Math.max(graph[k][n] - minEdge, 0);\n        });\n    });\n};\n// Turn into a Markov chain\nvar normalize = function (graph) {\n    Object.keys(graph).forEach(function (k) {\n        var ns = Object.keys(graph[k]);\n        var total = ns.reduce(function (a, c) { return a + graph[k][c]; }, 0);\n        ns.forEach(function (n) { return (graph[k][n] = graph[k][n] / total); });\n    });\n    // Cut pages such as:\n    // - a -> b, 50%\n    // - b -> a, 1%\n    // Then we don't want to let `a` and `b` belong to the same bundle.\n    Object.keys(graph).forEach(function (k) {\n        Object.keys(graph[k]).forEach(function (n) {\n            if (graph[k][n] < 0.05 || !graph[n] || !graph[n][k] || graph[n][k] < 0.05) {\n                graph[k][n] = 0;\n                if (graph[n] && graph[n][k]) {\n                    graph[n][k] = 0;\n                }\n            }\n        });\n    });\n};\nvar normalizeEntryPoints = function (cluster, tree, pathCluster, entryPointModule) {\n    var changed = false;\n    try {\n        for (var cluster_1 = __values(cluster), cluster_1_1 = cluster_1.next(); !cluster_1_1.done; cluster_1_1 = cluster_1.next()) {\n            var a = cluster_1_1.value;\n            try {\n                for (var cluster_2 = __values(cluster), cluster_2_1 = cluster_2.next(); !cluster_2_1.done; cluster_2_1 = cluster_2.next()) {\n                    var b = cluster_2_1.value;\n                    if (a === b) {\n                        continue;\n                    }\n                    // We can keep sibings in the same chunk\n                    var nodeA = tree.find(entryPointModule[a].modulePath);\n                    var nodeB = tree.find(entryPointModule[b].modulePath);\n                    if (nodeA.parent === nodeB.parent) {\n                        continue;\n                    }\n                    var ancestor = tree.lca(entryPointModule[a], entryPointModule[b]);\n                    if (!ancestor) {\n                        throw new Error('Cannot find LCA');\n                    }\n                    var entry = ancestor[0].modulePath;\n                    if (cluster.indexOf(entry) < 0) {\n                        while ((pathCluster[entry] || []).length) {\n                            cluster.push(pathCluster[entry].pop());\n                            changed = true;\n                        }\n                    }\n                }\n            }\n            catch (e_1_1) { e_1 = { error: e_1_1 }; }\n            finally {\n                try {\n                    if (cluster_2_1 && !cluster_2_1.done && (_a = cluster_2.return)) _a.call(cluster_2);\n                }\n                finally { if (e_1) throw e_1.error; }\n            }\n        }\n    }\n    catch (e_2_1) { e_2 = { error: e_2_1 }; }\n    finally {\n        try {\n            if (cluster_1_1 && !cluster_1_1.done && (_b = cluster_1.return)) _b.call(cluster_1);\n        }\n        finally { if (e_2) throw e_2.error; }\n    }\n    if (changed) {\n        normalizeEntryPoints(cluster, tree, pathCluster, entryPointModule);\n    }\n    var e_2, _b, e_1, _a;\n};\nexports.clusterize = function (bundleGraph, modules, n) {\n    if (n <= 0) {\n        throw new Error('The number of bundles should be a positive number');\n    }\n    var nodes = new Set();\n    Object.keys(bundleGraph).forEach(function (k) {\n        nodes.add(k);\n        Object.keys(bundleGraph[k]).forEach(function (n) {\n            nodes.add(n);\n        });\n    });\n    if (n > nodes.size) {\n        throw new Error('The number of clusters should be smaller or equal to the number of modules');\n    }\n    if (n === nodes.size) {\n        var result = [];\n        try {\n            for (var _a = __values(nodes.values()), _b = _a.next(); !_b.done; _b = _a.next()) {\n                var r = _b.value;\n                result.push([r]);\n            }\n        }\n        catch (e_3_1) { e_3 = { error: e_3_1 }; }\n        finally {\n            try {\n                if (_b && !_b.done && (_c = _a.return)) _c.call(_a);\n            }\n            finally { if (e_3) throw e_3.error; }\n        }\n        return result;\n    }\n    if (n === 1) {\n        var cluster = [];\n        try {\n            for (var _d = __values(nodes.values()), _e = _d.next(); !_e.done; _e = _d.next()) {\n                var r = _e.value;\n                cluster.push(r);\n            }\n        }\n        catch (e_4_1) { e_4 = { error: e_4_1 }; }\n        finally {\n            try {\n                if (_e && !_e.done && (_f = _d.return)) _f.call(_d);\n            }\n            finally { if (e_4) throw e_4.error; }\n        }\n        return [cluster];\n    }\n    // Build a Markov chain\n    // normalize(bundleGraph);\n    // Each node in the bundle tree is an entry point of a bundle.\n    // The node contains all the routes defined in this entry point.\n    var bundleTree = new bundle_tree_1.BundleTree();\n    bundleTree.build(modules);\n    // Path to module mapping\n    var entryPointModule = {};\n    modules.forEach(function (m) {\n        entryPointModule[m.modulePath] = m;\n    });\n    var _loop_1 = function () {\n        // Build the neighbors list in the current version of the graph.\n        var nl = neighbors_list_1.neighborsList(bundleGraph, nodes);\n        // Find the connected components.\n        var cc = tarjan_1.tarjan(nl);\n        // Each node in each connected component should point to\n        // the connected component itself.\n        // Two nodes from the same connected component should point to the same reference.\n        var bundleClusterMap = {};\n        cc.forEach(function (c) {\n            try {\n                for (var c_1 = __values(c), c_1_1 = c_1.next(); !c_1_1.done; c_1_1 = c_1.next()) {\n                    var n_1 = c_1_1.value;\n                    bundleClusterMap[n_1] = c;\n                }\n            }\n            catch (e_5_1) { e_5 = { error: e_5_1 }; }\n            finally {\n                try {\n                    if (c_1_1 && !c_1_1.done && (_a = c_1.return)) _a.call(c_1);\n                }\n                finally { if (e_5) throw e_5.error; }\n            }\n            var e_5, _a;\n        });\n        // For each connected component, we want to push all the parents of all the routes.\n        // For example, if the user wants to load `/a/b/c` from `/d`, this means\n        // that if `/a/b/c` & `/d` are in the same connected component, we should also\n        // push `/a` and `/a/b` because without them we cannot provide `/a/b/c`.\n        cc.forEach(function (c) {\n            normalizeEntryPoints(c, bundleTree, bundleClusterMap, entryPointModule);\n        });\n        // Drop all the empty connected components.\n        var res = cc.filter(function (c) { return c.length; });\n        if (res.length >= n) {\n            return { value: res };\n        }\n        // Trim the graph if we haven't found a solution yet.\n        trimGraph(bundleGraph);\n    };\n    while (true) {\n        var state_1 = _loop_1();\n        if (typeof state_1 === \"object\")\n            return state_1.value;\n    }\n    var e_3, _c, e_4, _f;\n};\n\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.tarjan = function (graph) {\n    graph = graph || {};\n    var indexes = {};\n    var lowIndexes = {};\n    var onStack = {};\n    var result = [];\n    var stack = [];\n    var index = 1;\n    var connectedComponent = function (node) {\n        stack.push(node);\n        onStack[node] = true;\n        indexes[node] = index;\n        lowIndexes[node] = index;\n        index += 1;\n        graph[node].forEach(function (n) {\n            if (indexes[n] === undefined) {\n                connectedComponent(n);\n                lowIndexes[node] = Math.min(lowIndexes[n], lowIndexes[node]);\n            }\n            else if (onStack[n]) {\n                lowIndexes[node] = Math.min(lowIndexes[node], indexes[n]);\n            }\n        });\n        // This is a \"root\" node\n        var cc = [];\n        if (indexes[node] === lowIndexes[node]) {\n            var current = void 0;\n            do {\n                current = stack.pop();\n                onStack[current] = false;\n                cc.push(current);\n            } while (stack.length > 0 && node !== current);\n            result.push(cc);\n        }\n    };\n    Object.keys(graph).forEach(function (n) {\n        if (!indexes[n]) {\n            connectedComponent(n);\n        }\n    });\n    return result;\n};\n\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __values = (this && this.__values) || function (o) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\n    if (m) return m.call(o);\n    return {\n        next: function () {\n            if (o && i >= o.length) o = void 0;\n            return { value: o && o[i++], done: !o };\n        }\n    };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar topological_sort_1 = __webpack_require__(3);\nvar BundleNode = /** @class */ (function () {\n    function BundleNode(key, parent) {\n        this.key = key;\n        this.parent = parent;\n        this.defs = [];\n        this.children = {};\n    }\n    return BundleNode;\n}());\nexports.BundleNode = BundleNode;\nvar BundleTree = /** @class */ (function () {\n    function BundleTree() {\n        this.root = null;\n    }\n    BundleTree.prototype.build = function (m) {\n        var roots = m.filter(function (c) { return !c.parentModulePath; });\n        if (roots.length !== 1) {\n            throw new Error('One root module allowed');\n        }\n        var root = roots[0];\n        this.root = new BundleNode(root.modulePath, null);\n        this.root.defs.push(root);\n        m = m.filter(function (c) { return c.parentModulePath; });\n        // Build neighbors list\n        var graph = {};\n        try {\n            for (var m_1 = __values(m), m_1_1 = m_1.next(); !m_1_1.done; m_1_1 = m_1.next()) {\n                var c = m_1_1.value;\n                graph[c.modulePath] = [];\n            }\n        }\n        catch (e_1_1) { e_1 = { error: e_1_1 }; }\n        finally {\n            try {\n                if (m_1_1 && !m_1_1.done && (_a = m_1.return)) _a.call(m_1);\n            }\n            finally { if (e_1) throw e_1.error; }\n        }\n        var moduleMap = {};\n        try {\n            for (var m_2 = __values(m), m_2_1 = m_2.next(); !m_2_1.done; m_2_1 = m_2.next()) {\n                var c = m_2_1.value;\n                if (c.parentModulePath !== root.modulePath) {\n                    graph[c.parentModulePath].push(c.modulePath);\n                }\n                moduleMap[c.modulePath] = moduleMap[c.modulePath] || [];\n                moduleMap[c.modulePath].push(c);\n            }\n        }\n        catch (e_2_1) { e_2 = { error: e_2_1 }; }\n        finally {\n            try {\n                if (m_2_1 && !m_2_1.done && (_b = m_2.return)) _b.call(m_2);\n            }\n            finally { if (e_2) throw e_2.error; }\n        }\n        // Remove duplicates\n        Object.keys(graph).forEach(function (n) {\n            graph[n] = graph[n].filter(function (e, i) { return graph[n].indexOf(e) === i; });\n        });\n        var insertionOrder = topological_sort_1.topologicalSort(graph);\n        var _loop_1 = function (c) {\n            var parentEntry = moduleMap[c][0].parentModulePath;\n            var parent_1 = this_1.find(parentEntry);\n            if (!parent_1) {\n                throw new Error(\"Cannot find parent bundle for \" + c);\n            }\n            var node = parent_1.children[c] || new BundleNode(c, parent_1);\n            moduleMap[c].forEach(function (m) { return node.defs.push(m); });\n            parent_1.children[c] = node;\n        };\n        var this_1 = this;\n        try {\n            for (var insertionOrder_1 = __values(insertionOrder), insertionOrder_1_1 = insertionOrder_1.next(); !insertionOrder_1_1.done; insertionOrder_1_1 = insertionOrder_1.next()) {\n                var c = insertionOrder_1_1.value;\n                _loop_1(c);\n            }\n        }\n        catch (e_3_1) { e_3 = { error: e_3_1 }; }\n        finally {\n            try {\n                if (insertionOrder_1_1 && !insertionOrder_1_1.done && (_c = insertionOrder_1.return)) _c.call(insertionOrder_1);\n            }\n            finally { if (e_3) throw e_3.error; }\n        }\n        var e_1, _a, e_2, _b, e_3, _c;\n    };\n    BundleTree.prototype.lca = function (a, b) {\n        var na = this.find(a.modulePath);\n        var nb = this.find(b.modulePath);\n        if (!na || !nb) {\n            return null;\n        }\n        var visited = {};\n        var nodeA = na;\n        while (nodeA) {\n            visited[nodeA.key] = true;\n            nodeA = nodeA.parent;\n        }\n        var nodeB = nb;\n        while (nodeB) {\n            if (visited[nodeB.key]) {\n                return nodeB.defs;\n            }\n            visited[nodeB.key] = true;\n            nodeB = nodeB.parent;\n        }\n        nodeA = na;\n        while (nodeA) {\n            if (visited[nodeA.key]) {\n                return nodeA.defs;\n            }\n            nodeA = nodeA.parent;\n        }\n        return null;\n    };\n    BundleTree.prototype.find = function (node) {\n        if (!this.root) {\n            return null;\n        }\n        var stack = [this.root];\n        var _loop_2 = function () {\n            var c = stack.pop();\n            if (c.key === node) {\n                return { value: c };\n            }\n            Object.keys(c.children).forEach(function (k) {\n                stack.push(c.children[k]);\n            });\n        };\n        while (stack.length) {\n            var state_1 = _loop_2();\n            if (typeof state_1 === \"object\")\n                return state_1.value;\n        }\n        return null;\n    };\n    return BundleTree;\n}());\nexports.BundleTree = BundleTree;\n\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.topologicalSort = (function () {\n    function topologicalSortHelper(node, visited, temp, graph, result) {\n        temp[node] = true;\n        var neighbors = graph[node];\n        for (var i = 0; i < neighbors.length; i += 1) {\n            var n = neighbors[i];\n            if (temp[n]) {\n                throw new Error('The graph is not a DAG');\n            }\n            if (!visited[n]) {\n                topologicalSortHelper(n, visited, temp, graph, result);\n            }\n        }\n        temp[node] = false;\n        visited[node] = true;\n        result.push(node);\n    }\n    return function (graph) {\n        var result = [];\n        var visited = {};\n        var temp = {};\n        for (var node in graph) {\n            if (!visited[node] && !temp[node]) {\n                topologicalSortHelper(node, visited, temp, graph, result);\n            }\n        }\n        return result.reverse();\n    };\n})();\n\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\nvar __values = (this && this.__values) || function (o) {\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\n    if (m) return m.call(o);\n    return {\n        next: function () {\n            if (o && i >= o.length) o = void 0;\n            return { value: o && o[i++], done: !o };\n        }\n    };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar connected = function (a, b, graph) {\n    return (graph[a] && graph[a][b] && graph[a][b] > 0) || (graph[b] && graph[b][a] && graph[b][a] > 0);\n};\nexports.neighborsList = function (graph, nodes) {\n    var nl = {};\n    try {\n        for (var _a = __values(nodes.values()), _b = _a.next(); !_b.done; _b = _a.next()) {\n            var a = _b.value;\n            nl[a] = [];\n            try {\n                for (var _c = __values(nodes.values()), _d = _c.next(); !_d.done; _d = _c.next()) {\n                    var b = _d.value;\n                    if (a === b) {\n                        continue;\n                    }\n                    if (connected(a, b, graph)) {\n                        nl[a].push(b);\n                    }\n                }\n            }\n            catch (e_1_1) { e_1 = { error: e_1_1 }; }\n            finally {\n                try {\n                    if (_d && !_d.done && (_e = _c.return)) _e.call(_c);\n                }\n                finally { if (e_1) throw e_1.error; }\n            }\n        }\n    }\n    catch (e_2_1) { e_2 = { error: e_2_1 }; }\n    finally {\n        try {\n            if (_b && !_b.done && (_f = _a.return)) _f.call(_a);\n        }\n        finally { if (e_2) throw e_2.error; }\n    }\n    return nl;\n    var e_2, _f, e_1, _e;\n};\n\n\n/***/ })\n/******/ ]);\n});"]}