@sheetxl/mcp 0.8.0-beta.22 → 0.8.0-beta.24
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.
- package/assets/{BHsqPfJZrdKTbPLP.js → 2YT_wstXIH6UIigi.js} +1 -1
- package/assets/{DtvJg63vbDd6B7sD.js → 3VycPrqi6qgLOgGY.js} +6 -6
- package/assets/{DoScYrfTJOHXe-Ko.js → 6CBUVbF01Bedq0e2.js} +66 -66
- package/assets/{D-MsUF59BhikcNZt.js → 76dPHG5RYA7MUV_g.js} +3 -3
- package/assets/{DgVCjvTw9Df1DV1x.js → 7IzItpr7MkdnaAwh.js} +167 -167
- package/assets/{DevKDvFONeJ9euEq.js → 7vPlH3_rhJxmmBvG.js} +1 -1
- package/assets/{BV49J63s68Mj6lgF.js → 9GnbVPKozgrJpeLW.js} +1 -1
- package/assets/{VSbzBtGH0cA8VBsM.js → B-5mBXpY9i6-eCrZ.js} +39 -39
- package/assets/{4zyHb1mmcFfqwpjO.js → B-t1q2NS61c2B8E4.js} +1 -1
- package/assets/{BSdRn3B8QeJFflY6.js → B16G2473LTkZP6Mq.js} +157 -137
- package/assets/{DrLUi6vduqDLmQjl.js → B4uS01J0mrSJSftQ.js} +89 -89
- package/assets/{BzFIkeB_lheiTR7z.js → B6caaQsfOpFEgYQ4.js} +1 -1
- package/assets/{b-xk3WtCPBkC4E-Z.js → B7lATTNffVTrDsKE.js} +2 -2
- package/assets/{hhpAcu3tINDLk7Ov.js → B8bEJ65vQRqsfBlS.js} +5 -5
- package/assets/{ryaMyh_8KvmXVSJd.js → BAVltO4Xf7lC0Xr6.js} +1 -1
- package/assets/{3N6hsbh2WLceyO6T.js → BH7ctzMzOYVTGxzA.js} +1 -1
- package/assets/{HVwvDMZh0ZGR-hRT.js → BJqo8c5bFKjnq69G.js} +11 -11
- package/assets/{DEOkcuqKBFyRnY18.js → BJwiwzwx4Bl5L4Vq.js} +1 -1
- package/assets/{CT99WREgkKGpcDTO.js → BPNLZ07Bu_B8Yhf1.js} +1 -1
- package/assets/{CSKjFDYwiwn5XNnH.js → BWLavTnANLUerdS0.js} +2 -2
- package/assets/{Dvsld01DkmiNLjfP.js → BXWGS09xFG81nnIT.js} +1 -1
- package/assets/{C4-0s3Udk3v4ytSn.js → BaYk1vO2hP2S3_1w.js} +2 -2
- package/assets/{CHqnRMWNpLKcAWWn.js → BifwlrCmEVtjh_1U.js} +1 -1
- package/assets/{CYCqMEoWsry6_hrc.js → BjyXkr-CzV8mVx0t.js} +1 -1
- package/assets/{Ds5pLAwSN4lSbao6.js → BkHeIMSE7-LehRCs.js} +1 -1
- package/assets/{CwNKcoA7na7Ess3a.js → BkekCZ17YTtd07_C.js} +2 -2
- package/assets/{0jPw8-AyT6VbPuGO.js → BnNB_ejvNaLu6B3o.js} +1 -1
- package/assets/{BPZWfwUvFCLQInXN.js → BrJd9jVVv9SQzZol.js} +400 -400
- package/assets/{BRVEVVhj-8ZPrNyQ.js → BrYc6PLonux_gI6b.js} +223 -223
- package/assets/{Cu4VAHfmjXWfTMPu.js → BxwB3iTNSE1TgHkb.js} +1 -1
- package/assets/{DgYcOz0M0pmZf9x_.js → By1QPrSxtnRiJu0R.js} +2 -2
- package/assets/{B5VTjL9m0R-Icfaz.js → ByYJTTTUuu67hDF-.js} +4 -4
- package/assets/{CXk5vwFfosghrTKo.js → C-nA4SXN5hWHaxV6.js} +535 -535
- package/assets/{BnGNMsqG5CzUzmX7.js → C0uu0vLKQh0S508B.js} +23 -23
- package/assets/{BDq4iVyBh5lwX8pE.js → C6PNMev7cs5JLgwy.js} +1 -1
- package/assets/{C1PTfp7kVu3DqqZh.js → C9iFJ52KwQTePQ81.js} +8944 -8935
- package/assets/{xDx1vaNa2aCMs4_e.js → CCF6CwJ6cbeLRl23.js} +1 -1
- package/assets/{CAgQJrDxGEfoa7jn.js → CEk658HeLJk2cAjM.js} +3 -3
- package/assets/{Bf7Irm8Ua4s1T4xH.js → CFNtPYPfDPH-3BXK.js} +1 -1
- package/assets/{CHG9Q0uLAZdLXYVz.js → CFT_tDogP98gTbh7.js} +101 -101
- package/assets/{ze6Q8BiEw9RClBzZ.js → CFWwwr74qRKOBrg9.js} +1 -1
- package/assets/{Bi65BKwwiZYYZprq.js → CIY_RiLu1_FmRLAA.js} +1 -1
- package/assets/{D9ja7F9irHf9Iovx.js → CIw6ZC3K9x-ccacl.js} +1 -1
- package/assets/{1dUPpOVZSeeylKHv.js → CJ2hV-9ipqOEkLSG.js} +1 -1
- package/assets/{vazKaFOkHRriv7tX.js → CKD460cQOgwF6uSV.js} +1 -1
- package/assets/{zJoBN2CJdxEV7vdh.js → CM-q_J5aF6YXmjeu.js} +3 -3
- package/assets/{9AosCdy_xtdhLjN1.js → CR1aLf7CWEfPTO9a.js} +1 -1
- package/assets/{E9mta1q4VtVUusy5.js → CSXmTA6w6Pnbtqvb.js} +1 -1
- package/assets/{BI5L_Ysr8s0TQxdg.js → CT4czEKWIj1GeQN8.js} +1 -1
- package/assets/{D8dNiNpu9_L0NjGP.js → CUYQlZz5zWsUdmRy.js} +1 -1
- package/assets/{CGB4xgirbgEIN3tg.js → CbJWbjmv4bz4ppIZ.js} +356 -354
- package/assets/{Bx592y6pyOwTS2x7.js → Cf0zmfQYfJ7zM0Ya.js} +1 -1
- package/assets/{8csqJ8aGOdnKlrLl.js → Ch9w7xFxVMrvGuC_.js} +1 -1
- package/assets/{GGcMgq3ScY7Tv0PE.js → CmkgQ5-IG0BSCM3R.js} +3 -3
- package/assets/{BkqENH8xJ3_NQnD5.js → CmwNIrRssYuLN2fn.js} +422 -422
- package/assets/{sYakw2x8dcnpUlsX.js → CnI4Nli8vtWdFKvf.js} +3 -3
- package/assets/{DRd8gdwcr3EqtGkb.js → CnKX5SPVE2iuSK42.js} +1 -1
- package/assets/{BvKzhnweVF6GhjXh.js → CpvJUGg9ckuCIpIS.js} +1 -1
- package/assets/{DFQLoYLUO4TgDZPK.js → Cxzowsi6ASdZtzeI.js} +1 -1
- package/assets/{tIoHMgrZeRHWyxos.js → CzRvg04_TIbwBH5C.js} +3 -3
- package/assets/{BygXDW3XTdtR38aA.js → D-vo2bQyAmStQmD9.js} +1 -1
- package/assets/{DxNK3HVEzFdUou54.js → D6d1DKL15m52ZCuC.js} +1 -1
- package/assets/{Z5tQQ6IW5YBjblWX.js → D8k9de_hen-KqBWe.js} +1 -1
- package/assets/{91BKH9obG4IfBzhy.js → DE7G34oYbvrfXbJ7.js} +383 -378
- package/assets/{BrfsWImwRtf54LUU.js → DFVQIZ2zZyAphhCF.js} +1 -1
- package/assets/{D1tShC5iBlUoT2V2.js → DGI_8HyNF0eAv0P5.js} +1 -1
- package/assets/{C1yAmXrOu3iHV2cu.js → DGOgx3-IyO8bjF_t.js} +83 -83
- package/assets/{BXean6K6oDUxkzyd.js → DIgPlkEabQdKNUQn.js} +1 -1
- package/assets/{DmVQgN-N_HhYvakk.js → DJGYlGr2Zj7SkYqc.js} +1 -1
- package/assets/{DzGpZ2CQ1St9BF0y.js → DJfpKncnYnrr28G0.js} +1 -1
- package/assets/{CHnaSM8aMnQ2_VWW.js → DL8pez0eKo8arYPj.js} +3 -3
- package/assets/{tPa3RpqYRqCCCYf1.js → DM-yGHahbfA_uarn.js} +1 -1
- package/assets/{DHHYGjNwlLvja3dS.js → DMDTS0LH9Ke9t-3z.js} +1 -1
- package/assets/{D89TE5n8VKre9Gmp.js → DNSWaXblwhTtI3w7.js} +1 -1
- package/assets/{UgDy0WNXuV1sEnFW.js → DOSWSyKkK4eSi4PD.js} +2 -2
- package/assets/{CHpBOpoM9bCvQyn0.js → DPLTGglaPovTg9e5.js} +1 -1
- package/assets/{CpYgsvYMxV5SbRp3.js → DPYFRLJbHGlrcrJq.js} +2 -2
- package/assets/{DLbzfP7OOWhafkTq.js → DRq6lQLndj73WT35.js} +1 -1
- package/assets/{BUGEQS5WdiLcI_0X.js → DRzZ4bEyLRGVOLzV.js} +1 -1
- package/assets/{BUIjRIGTum7VuRFk.js → DUbIxDAzW1dzrtdI.js} +1 -1
- package/assets/{OfjHqYH31KqC5gVM.js → DXCTHw-ZutNIuo_2.js} +1 -1
- package/assets/{OtMeAlbq6tyW5Hnc.js → D_tdoUtUe7cApQJn.js} +4 -4
- package/assets/{DawLBAaNAAmo_P3Y.js → DaF9L7No8h8a-cqb.js} +2 -2
- package/assets/{DdDKDqtpIkzd-mXi.js → DaHD9SY75O8wDy3p.js} +2 -2
- package/assets/{CXqqaFgNeUVRGvEb.js → Daaro0HbHkKXkBP-.js} +2 -2
- package/assets/{BiC09_YKQPmlUklQ.js → DczQhB3mRSUw6GCf.js} +1 -1
- package/assets/Dfv_T_PQVL0O3lu5.js +14 -0
- package/assets/{B6pXiayrnDoDbQt1.js → Dhy6iU_09lrQnOAV.js} +47 -47
- package/assets/{Dbh-XVDw294AVLtl.js → Dk9zYXO3VoBhTdex.js} +1 -1
- package/assets/{DQIQR1t3IkC9wshP.js → DkQ4kxEKhKYQgfjK.js} +1 -1
- package/assets/{CSGN4rAf7CYnBDEa.js → Dlqk7XqKnAZ8Pcj3.js} +83 -83
- package/assets/{BaaVzb7xXROiWUhT.js → DqSBb1HmgeU7eg_i.js} +84 -84
- package/assets/{BgwCdHyXKQYFAl1M.js → Ds4TB1hn56-RK6_f.js} +1 -1
- package/assets/{VWEaItb0XvCoRiCT.js → DtVSjxL6N_7WyM8Z.js} +1 -1
- package/assets/{C9wlvcFyjQA59G-_.js → DuEtCJEnG_GnJzTX.js} +1 -1
- package/assets/{DdnALoxd3b8TLNla.js → DwNcvKM47ZHfvQM6.js} +1 -1
- package/assets/{CdtVv8YQ8PTmS4dz.js → DyiH3LlinD-38bG7.js} +1 -1
- package/assets/{hAVtdK6u2tlLI2cB.js → Jy-_0a72nn5Iv1NK.js} +1 -1
- package/assets/{Bzp3UtK_6fqEVlV8.js → KMzONx2Ps841nJHj.js} +8 -8
- package/assets/{CV729JV1mNyYCmrq.js → LM2rVDHdB0jVUFcT.js} +1 -1
- package/assets/{do_DTptu6c_xHJoZ.js → MosMza0-rXD8uHX_.js} +2 -2
- package/assets/{COVhUB0EotytQDHg.js → NAWWzA_hk4wYtsPP.js} +2 -2
- package/assets/{CufFcGwo5x95LSb7.js → P6V3JAiRpC3BWceC.js} +1 -1
- package/assets/{1U3DwsqHnOBwiGWn.js → TZnuVwhVjkOBax9F.js} +2 -2
- package/assets/{nSzQt54CIADky_tF.js → TdDTOcC1TYhk6UuR.js} +1 -1
- package/assets/{CGxhgXj5qKj_Ubcp.js → Xccc6oxtlSvJUDsC.js} +1 -1
- package/assets/{DAqaOCEQLmZRjcdR.js → a2e_g9YI3J-lUD7-.js} +1 -1
- package/assets/{D-N87jCOShDKTFDh.js → b8yACuWy67eIj_j2.js} +1 -1
- package/assets/{BlxrCp7d-SeM-2DW.js → bv3fZLUPzd14I58C.js} +631 -621
- package/assets/{CKhbbbjQ-_auMp3n.js → doqBmhonQlHp-1Ud.js} +1 -1
- package/assets/{BZxJKqVEO7B23XwE.js → fEfisM0E2fUYKIyU.js} +5 -5
- package/assets/{v5XZSqLd9ZV3kqcA.js → flby0g5gyZ9P2Wu2.js} +1 -1
- package/assets/{coTH4ab6CTEzw87b.js → g2Nu44uuSJFMzxEV.js} +2 -2
- package/assets/{Cahhn5OLNqRYy-n8.js → mZt9BTEejCJZ4YK4.js} +1 -1
- package/assets/{BnK6HEqT4rf1RoOG.js → qc7rA-Z3a4rkVQPx.js} +217 -217
- package/assets/{DsBXjYAgTUXAAWZZ.js → sJVPCrgeh0U6LbAK.js} +1 -1
- package/assets/{wWgI0JPoe_Wv0ceW.js → suLYEZBtGUhSYeB7.js} +1 -1
- package/assets/{WSiEiaP-NUEr9UaB.js → tWO-mE87mAuj1qih.js} +2 -2
- package/assets/{DdXp_iPwTOHAOvlL.js → xD41vsQY6h60lCqz.js} +1168 -1170
- package/assets/{C7zManFR1LEJXiwb.js → yz2PTfYm_8EGJPM5.js} +1 -1
- package/index.js +117 -117
- package/lib.js +1 -1
- package/licenses/dependencies.txt +12 -12
- package/package.json +4 -4
- package/screenshot-page/assets/{CFl15-2FAF9f3V7L.js → 0UZBKpOOsp7P-DkP.js} +2 -2
- package/screenshot-page/assets/{DfT1DMR1b5kiyYiV.js → B-0-chiwq4MIUQy9.js} +1 -1
- package/screenshot-page/assets/B7pXfEVkcbaMBMhc.js +1 -0
- package/screenshot-page/assets/BDRMUi2BsnBqytIq.js +2 -0
- package/screenshot-page/assets/BEjJHVSbtlsNtoq7.js +3 -0
- package/screenshot-page/assets/{BnZX0sxceYpvtg3I.js → BIuMiduMHSsTGacU.js} +2 -2
- package/screenshot-page/assets/BKwDvElKinpn1IK0.js +1 -0
- package/screenshot-page/assets/BPMQ22uISGOm3ymr.js +1 -0
- package/screenshot-page/assets/{adhmz3N2Kgq5eW66.js → BTJ1NNUzHotNDiDe.js} +2 -2
- package/screenshot-page/assets/BbT5KRhoeAKLzy54.js +2 -0
- package/screenshot-page/assets/{Dwv5Z_c2XS-hm-5y.js → BcZPWw18bdj_ZvA9.js} +1 -1
- package/screenshot-page/assets/{BEwl-ucV9Jfr0RoC.js → Bdb0azxGoCh6NBDk.js} +1 -1
- package/screenshot-page/assets/{CcOIj8c4N9KaWnD7.js → Bfq6-treWd_rRiWl.js} +1 -1
- package/screenshot-page/assets/{BGh5K-hHzy8mSVDr.js → Bg9UyX4yrB2mSdJt.js} +12 -12
- package/screenshot-page/assets/Bxq4FCQhyPbVhhaR.js +2 -0
- package/screenshot-page/assets/{zFbb8ESzwR_bE7IQ.js → CBP4y6KFPu24xhDT.js} +1 -1
- package/screenshot-page/assets/CI3Z1f4amZ9G2rPD.js +5 -0
- package/screenshot-page/assets/{COpZTXe_J1mSpeYD.js → CNB6WmYfGVZjlCKV.js} +1 -1
- package/screenshot-page/assets/{CXGgKVbVXjWzE0p6.js → CQ-33-es3XJ56pR4.js} +1 -1
- package/screenshot-page/assets/CSFFMEKyxEFaykqL.js +1 -0
- package/screenshot-page/assets/CXeJV1BW2CVemhPE.js +1 -0
- package/screenshot-page/assets/{Cmv8bpHaTWZ7Lmbt.js → C_YKEkTsGB_5gFNg.js} +2 -2
- package/screenshot-page/assets/CkxmJxdtjBIxYoMq.js +1 -0
- package/screenshot-page/assets/CtiTwHzd_ZSzd3W2.js +1 -0
- package/screenshot-page/assets/CwCu_r0BW41uLt3P.js +2 -0
- package/screenshot-page/assets/{DdusmeEPaU7CWT6e.js → Cx9eq2x1gIXGki3Q.js} +1 -1
- package/screenshot-page/assets/D43IayseD2Cy8OZo.js +4 -0
- package/screenshot-page/assets/{BftXEPOuf5Uwxpud.js → D6Ciix7JAZtdKqmj.js} +1 -1
- package/screenshot-page/assets/D6EXAYU-ZH8hjx_7.js +2 -0
- package/screenshot-page/assets/D7Yt7xmUlA6-Lq0Q.js +48 -0
- package/screenshot-page/assets/D8KyhLvfyjLZW92H.js +39 -0
- package/screenshot-page/assets/DACSL7FA_J91Z_H7.js +2 -0
- package/screenshot-page/assets/DBxAatsD6aWk7Zb6.js +586 -0
- package/screenshot-page/assets/DGkaCFHx4PsOJkFu.js +1 -0
- package/screenshot-page/assets/DM6hr-bvWV50-Oex.js +2 -0
- package/screenshot-page/assets/DOVt9zHz7FQ2KUQM.js +1 -0
- package/screenshot-page/assets/DR-og7vslxlOZd8j.js +1 -0
- package/screenshot-page/assets/DSTlKGmqncM7XHeW.js +1 -0
- package/screenshot-page/assets/Dh14XQinAphjZOKC.js +1 -0
- package/screenshot-page/assets/Dkf51CnZh2zPEGMd.js +1 -0
- package/screenshot-page/assets/{nM1r2xslndIMKlI2.js → DmDFKv_3APEWI-IY.js} +2 -2
- package/screenshot-page/assets/Dt8JxbBBr2TeDflQ.js +1 -0
- package/screenshot-page/assets/Dxi-bXNjS-CpC5Qr.js +1 -0
- package/screenshot-page/assets/{Bm9-R9keVK5Sx-8o.js → DynKB5GH-vfFMJEy.js} +1 -1
- package/screenshot-page/assets/{CZq2dMHs2MHHyyBl.js → FcTM4SB17cEX1M3X.js} +1 -1
- package/screenshot-page/assets/{B668_VaGrdcWRbkC.js → FqdZRM336KMEcsbU.js} +1 -1
- package/screenshot-page/assets/Oay0yGsGYgJDzy8r.js +1 -0
- package/screenshot-page/assets/Pt9ne0xkE2icD3Ih.js +1 -0
- package/screenshot-page/assets/QZg76Jflu3Q808W3.js +1 -0
- package/screenshot-page/assets/{BRemww1df2HKLd_k.js → WTrYzPnMQhYDILMR.js} +1 -1
- package/screenshot-page/assets/{CXUO3vYip3JPSJ7A.js → YH1wNXzhQbkuWxeS.js} +1 -1
- package/screenshot-page/assets/{CQ9C0-FcDZxrgC3T.js → a3fvt1Klg1uGE7p6.js} +7 -7
- package/screenshot-page/assets/{D8-mayyvvVE1a4JB.js → clrFU8i-0wNkmbs7.js} +1 -1
- package/screenshot-page/assets/{-cpi3yOZYn6GsYN4.js → gU2zeJaXoNh7QI_e.js} +2 -2
- package/screenshot-page/assets/r2HZG9_SMzF3__ID.js +13 -0
- package/screenshot-page/index.html +16 -16
- package/types/scripting-api.json +5747 -5744
- package/types/scripting.d.ts +27 -3
- package/assets/r-pk3RNq_HjMQFqr.js +0 -14
- package/screenshot-page/assets/0buGanYjZDNd9qAK.js +0 -39
- package/screenshot-page/assets/B2oadmu_j6WfNbZ1.js +0 -1
- package/screenshot-page/assets/BGWgIYge30MP6Xhz.js +0 -48
- package/screenshot-page/assets/BIQ7KK-buzeddVA9.js +0 -1
- package/screenshot-page/assets/BPRDGSNh0kvXRFUY.js +0 -1
- package/screenshot-page/assets/Bv2MgCMkg3EIQ6iE.js +0 -13
- package/screenshot-page/assets/BvaiwYJ5zZ0d5NRP.js +0 -1
- package/screenshot-page/assets/CAlTfQ_Gh-dURmUc.js +0 -1
- package/screenshot-page/assets/CCFxspvs5VzbYCfl.js +0 -1
- package/screenshot-page/assets/CCqTTfzZokVHIzs2.js +0 -1
- package/screenshot-page/assets/CPs_ARK8JCyz-yZg.js +0 -1
- package/screenshot-page/assets/CUeMb48Ucrm5dK5u.js +0 -1
- package/screenshot-page/assets/CjrHeIdacavAT_Ud.js +0 -3
- package/screenshot-page/assets/CqccUqSMYlwlf2ZU.js +0 -2
- package/screenshot-page/assets/CvmImq-Kbg9srxNr.js +0 -4
- package/screenshot-page/assets/D-3wYBqe4SWdE6bx.js +0 -2
- package/screenshot-page/assets/D-FWnGDbZ9BRDzPR.js +0 -1
- package/screenshot-page/assets/D717DArr-KKL0U6R.js +0 -1
- package/screenshot-page/assets/DM27mE98BNk1T18I.js +0 -1
- package/screenshot-page/assets/DN-T1DyRMKvxEJSK.js +0 -1
- package/screenshot-page/assets/DRdL1GN4SP7P8lSP.js +0 -2
- package/screenshot-page/assets/DcnhaY93LQd7kVdH.js +0 -2
- package/screenshot-page/assets/DigI6jhjHePzLgg1.js +0 -1
- package/screenshot-page/assets/DrDLCC0R2IV5VJd7.js +0 -1
- package/screenshot-page/assets/DuYb_otrRZZDq6-f.js +0 -2
- package/screenshot-page/assets/Dx0pUf3G4Oa3dGOk.js +0 -1
- package/screenshot-page/assets/JcgNMFaj_uqHSFxr.js +0 -1
- package/screenshot-page/assets/U_8_wApwfA7KmIG3.js +0 -586
- package/screenshot-page/assets/WZprjN2sb7HlraOb.js +0 -2
- package/screenshot-page/assets/qjoaeEBxfKWCHmqK.js +0 -2
- package/screenshot-page/assets/zALFdtoGJBN6m2Bn.js +0 -1
- package/screenshot-page/assets/zd1Z2E1NjFp2EWC7.js +0 -5
|
@@ -1,14 +1,14 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.
|
|
2
|
+
* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.24
|
|
3
3
|
*
|
|
4
4
|
* (C) 2026-present SheetXL Inc. & Michael T. Ford
|
|
5
5
|
* License: SheetXL EULA — https://www.sheetxl.com/eula
|
|
6
6
|
*/
|
|
7
|
-
import { r as t, t as n } from "./
|
|
8
|
-
import { S as e, Y as r, ht as o } from "./
|
|
9
|
-
import { c as u, f as i, l as s, m as l, o as a, p as f, u as c } from "./
|
|
10
|
-
import {
|
|
11
|
-
import { $ as g, A as N, B as I, C as p, D as M, E as d, F as w, G as A, H as E, I as B, J as b, K as C, L as y, M as R, N as v, O as S, P as x, R as D, S as V, T as F, U as O, V as P, W as L, X as _, Y as U, Z as k, _ as $, a as j, b as X, c as q, d as G, et as H, f as Y, g as z, h as K, i as W, j as Q, k as Z, l as J, m as tt, n as nt, nt as et, o as rt, p as ot, q as ut, r as it, s as st, t as lt, tt as at, u as ft, v as ct, w as ht, x as mt, y as gt, z as Nt } from "./
|
|
7
|
+
import { r as t, t as n } from "./BXWGS09xFG81nnIT.js";
|
|
8
|
+
import { S as e, Y as r, ht as o } from "./DMDTS0LH9Ke9t-3z.js";
|
|
9
|
+
import { c as u, f as i, l as s, m as l, o as a, p as f, u as c } from "./DRzZ4bEyLRGVOLzV.js";
|
|
10
|
+
import { io as h, pn as m } from "./C9iFJ52KwQTePQ81.js";
|
|
11
|
+
import { $ as g, A as N, B as I, C as p, D as M, E as d, F as w, G as A, H as E, I as B, J as b, K as C, L as y, M as R, N as v, O as S, P as x, R as D, S as V, T as F, U as O, V as P, W as L, X as _, Y as U, Z as k, _ as $, a as j, b as X, c as q, d as G, et as H, f as Y, g as z, h as K, i as W, j as Q, k as Z, l as J, m as tt, n as nt, nt as et, o as rt, p as ot, q as ut, r as it, s as st, t as lt, tt as at, u as ft, v as ct, w as ht, x as mt, y as gt, z as Nt } from "./DL8pez0eKo8arYPj.js";
|
|
12
12
|
var It = n((t) => {
|
|
13
13
|
var n = function(t) {
|
|
14
14
|
t.version = "1.0.2";
|
|
@@ -717,7 +717,7 @@ function An() {
|
|
|
717
717
|
return l.formatResults("Short Date"), Math.floor(l.getNow());
|
|
718
718
|
}
|
|
719
719
|
function En(t, n = 1) {
|
|
720
|
-
const e = vn[
|
|
720
|
+
const e = vn[On(n)];
|
|
721
721
|
if (!e) throw c.BuiltIn.Num;
|
|
722
722
|
return e[l.getDateParts(t).dow % 7];
|
|
723
723
|
}
|
|
@@ -732,7 +732,7 @@ function Bn(t, n = 1) {
|
|
|
732
732
|
}
|
|
733
733
|
else e = l.parseAsSerialDate(t);
|
|
734
734
|
e = Zt(e);
|
|
735
|
-
const r = null === n ? 0 :
|
|
735
|
+
const r = null === n ? 0 : On(l.parseAsNumber(n));
|
|
736
736
|
if (21 === r) return cn(e);
|
|
737
737
|
const o = Rn[r];
|
|
738
738
|
if (void 0 === o) throw c.BuiltIn.Num;
|
|
@@ -744,9 +744,10 @@ function bn(t, n, e) {
|
|
|
744
744
|
}
|
|
745
745
|
function Cn(t, n, e = 1, r) {
|
|
746
746
|
const o = Zt(nn(t, Jt)), u = Math.floor(nn(n, tn));
|
|
747
|
+
if (0 === u) return o;
|
|
747
748
|
if (c.isError(e)) throw c.BuiltIn.Num;
|
|
748
749
|
const i = Nn(e);
|
|
749
|
-
if (7 === i.length
|
|
750
|
+
if (7 === i.length) throw c.BuiltIn.Value;
|
|
750
751
|
const s = Dn(r), a = Tn(), f = l.getSerialDate(9999, 12, 31), h = u < 0 ? -1 : 1;
|
|
751
752
|
let m = Math.abs(u), g = o;
|
|
752
753
|
for (; m > 0;) {
|
|
@@ -913,31 +914,35 @@ function Dn(t) {
|
|
|
913
914
|
function Vn(t) {
|
|
914
915
|
return Math.floor(t + Fn);
|
|
915
916
|
}
|
|
916
|
-
var Fn = 1 / 4194304
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
921
|
-
|
|
917
|
+
var Fn = 1 / 4194304;
|
|
918
|
+
function On(t) {
|
|
919
|
+
return t >= 0 ? Math.floor(t + Fn) : Math.trunc(t);
|
|
920
|
+
}
|
|
921
|
+
var Pn = At({
|
|
922
|
+
BESSELI: () => kn,
|
|
923
|
+
BESSELJ: () => $n,
|
|
924
|
+
BESSELK: () => jn,
|
|
925
|
+
BESSELY: () => Xn
|
|
926
|
+
}), Ln = 2 ** 27 + 1, _n = (t) => {
|
|
922
927
|
if (c.isError(t)) throw t;
|
|
923
928
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
924
929
|
return null === t ? 0 : l.parseAsNumber(t);
|
|
925
|
-
},
|
|
930
|
+
}, Un = (t) => {
|
|
926
931
|
const n = Math.trunc(t);
|
|
927
932
|
return n < 0 || n > 1e7 ? NaN : n;
|
|
928
933
|
};
|
|
929
|
-
function
|
|
930
|
-
const e =
|
|
934
|
+
function kn(t, n) {
|
|
935
|
+
const e = _n(t), r = Un(_n(n));
|
|
931
936
|
if (Number.isNaN(r)) return NaN;
|
|
932
937
|
const o = Mt.default.besseli(Math.abs(e), r);
|
|
933
938
|
return e < 0 && r % 2 == 1 ? -o : o;
|
|
934
939
|
}
|
|
935
|
-
function kn(t, n) {
|
|
936
|
-
const e = Ln(t), r = _n(Ln(n));
|
|
937
|
-
return Number.isNaN(r) || Math.abs(e) > Pn ? NaN : Mt.default.besselj(e, r);
|
|
938
|
-
}
|
|
939
940
|
function $n(t, n) {
|
|
940
|
-
const e =
|
|
941
|
+
const e = _n(t), r = Un(_n(n));
|
|
942
|
+
return Number.isNaN(r) || Math.abs(e) > Ln ? NaN : Mt.default.besselj(e, r);
|
|
943
|
+
}
|
|
944
|
+
function jn(t, n) {
|
|
945
|
+
const e = _n(t), r = Un(_n(n));
|
|
941
946
|
if (Number.isNaN(r)) return NaN;
|
|
942
947
|
if (!(e > 0)) return Mt.default.besselk(e, r);
|
|
943
948
|
let o = Et(Mt.default.besselk(e, 0));
|
|
@@ -950,36 +955,36 @@ function $n(t, n) {
|
|
|
950
955
|
}
|
|
951
956
|
return u;
|
|
952
957
|
}
|
|
953
|
-
function
|
|
954
|
-
const e =
|
|
955
|
-
return Number.isNaN(r) || Math.abs(e) >
|
|
956
|
-
}
|
|
957
|
-
var
|
|
958
|
-
BIN2DEC: () =>
|
|
959
|
-
BIN2HEX: () =>
|
|
960
|
-
BIN2OCT: () =>
|
|
961
|
-
BITAND: () =>
|
|
962
|
-
BITLSHIFT: () =>
|
|
963
|
-
BITOR: () =>
|
|
964
|
-
BITRSHIFT: () =>
|
|
965
|
-
BITXOR: () =>
|
|
966
|
-
DEC2BIN: () =>
|
|
967
|
-
DEC2HEX: () =>
|
|
968
|
-
DEC2OCT: () =>
|
|
969
|
-
HEX2BIN: () =>
|
|
970
|
-
HEX2DEC: () =>
|
|
971
|
-
HEX2OCT: () =>
|
|
972
|
-
OCT2BIN: () =>
|
|
973
|
-
OCT2DEC: () =>
|
|
974
|
-
OCT2HEX: () =>
|
|
958
|
+
function Xn(t, n) {
|
|
959
|
+
const e = _n(t), r = Un(_n(n));
|
|
960
|
+
return Number.isNaN(r) || Math.abs(e) > Ln ? NaN : Mt.default.bessely(e, r);
|
|
961
|
+
}
|
|
962
|
+
var qn = At({
|
|
963
|
+
BIN2DEC: () => Gn,
|
|
964
|
+
BIN2HEX: () => Hn,
|
|
965
|
+
BIN2OCT: () => Yn,
|
|
966
|
+
BITAND: () => zn,
|
|
967
|
+
BITLSHIFT: () => Kn,
|
|
968
|
+
BITOR: () => Wn,
|
|
969
|
+
BITRSHIFT: () => Qn,
|
|
970
|
+
BITXOR: () => Zn,
|
|
971
|
+
DEC2BIN: () => Jn,
|
|
972
|
+
DEC2HEX: () => te,
|
|
973
|
+
DEC2OCT: () => ne,
|
|
974
|
+
HEX2BIN: () => ee,
|
|
975
|
+
HEX2DEC: () => re,
|
|
976
|
+
HEX2OCT: () => oe,
|
|
977
|
+
OCT2BIN: () => ue,
|
|
978
|
+
OCT2DEC: () => ie,
|
|
979
|
+
OCT2HEX: () => se
|
|
975
980
|
});
|
|
976
|
-
function
|
|
977
|
-
const n =
|
|
978
|
-
return 10 === n.length && "1" === n.substring(0, 1) ? parseInt(n.substring(1), 2) +
|
|
981
|
+
function Gn(t) {
|
|
982
|
+
const n = pe(t, le);
|
|
983
|
+
return 10 === n.length && "1" === n.substring(0, 1) ? parseInt(n.substring(1), 2) + ge : parseInt(n, 2);
|
|
979
984
|
}
|
|
980
|
-
function
|
|
981
|
-
n =
|
|
982
|
-
const e =
|
|
985
|
+
function Hn(t, n) {
|
|
986
|
+
n = Ne(n);
|
|
987
|
+
const e = pe(t, le);
|
|
983
988
|
if (t = parseInt(e, 2), 10 === e.length && "1" === e.substring(0, 1)) return (parseInt(e.substring(1), 2) + 0xfffffffe00).toString(16).toUpperCase();
|
|
984
989
|
const r = t.toString(16);
|
|
985
990
|
if (void 0 === n) return r.toUpperCase();
|
|
@@ -987,9 +992,9 @@ function Gn(t, n) {
|
|
|
987
992
|
if ((n = Math.trunc(n)) >= r.length) return ("0".repeat(n - r.length) + r).toUpperCase();
|
|
988
993
|
throw c.BuiltIn.Num;
|
|
989
994
|
}
|
|
990
|
-
function
|
|
991
|
-
n =
|
|
992
|
-
const e =
|
|
995
|
+
function Yn(t, n) {
|
|
996
|
+
n = Ne(n);
|
|
997
|
+
const e = pe(t, le);
|
|
993
998
|
if (t = parseInt(e, 2), 10 === e.length && "1" === e.substring(0, 1)) return (parseInt(e.substring(1), 2) + 1073741312).toString(8);
|
|
994
999
|
const r = t.toString(8);
|
|
995
1000
|
if (void 0 === n) return r.toUpperCase();
|
|
@@ -997,30 +1002,30 @@ function Hn(t, n) {
|
|
|
997
1002
|
if ((n = Math.trunc(n)) >= r.length) return "0".repeat(n - r.length) + r;
|
|
998
1003
|
throw c.BuiltIn.Num;
|
|
999
1004
|
}
|
|
1000
|
-
function Yn(t, n) {
|
|
1001
|
-
return t = Me(t), n = Me(n), we(t, n, (t, n) => t & n);
|
|
1002
|
-
}
|
|
1003
1005
|
function zn(t, n) {
|
|
1004
|
-
t =
|
|
1005
|
-
|
|
1006
|
+
return t = de(t), n = de(n), Ae(t, n, (t, n) => t & n);
|
|
1007
|
+
}
|
|
1008
|
+
function Kn(t, n) {
|
|
1009
|
+
t = de(t);
|
|
1010
|
+
const e = we(n);
|
|
1006
1011
|
if (0 === t) return 0;
|
|
1007
1012
|
if (Math.abs(e) > 53) return NaN;
|
|
1008
1013
|
if (e < 0) return Math.trunc(t / 2 ** -e);
|
|
1009
1014
|
if (e > 48) return 0;
|
|
1010
1015
|
const r = BigInt(t) << BigInt(e);
|
|
1011
|
-
return r > BigInt(
|
|
1012
|
-
}
|
|
1013
|
-
function Kn(t, n) {
|
|
1014
|
-
return t = Me(t), n = Me(n), we(t, n, (t, n) => t | n);
|
|
1016
|
+
return r > BigInt(Me) ? NaN : Number(r);
|
|
1015
1017
|
}
|
|
1016
1018
|
function Wn(t, n) {
|
|
1017
|
-
return
|
|
1019
|
+
return t = de(t), n = de(n), Ae(t, n, (t, n) => t | n);
|
|
1018
1020
|
}
|
|
1019
1021
|
function Qn(t, n) {
|
|
1020
|
-
return t =
|
|
1022
|
+
return Kn(t = de(t), -we(n));
|
|
1021
1023
|
}
|
|
1022
1024
|
function Zn(t, n) {
|
|
1023
|
-
|
|
1025
|
+
return t = de(t), n = de(n), Ae(t, n, (t, n) => t ^ n);
|
|
1026
|
+
}
|
|
1027
|
+
function Jn(t, n) {
|
|
1028
|
+
if (n = Ne(n), (t = Ie(t)) < ge || t > me) throw c.BuiltIn.Num;
|
|
1024
1029
|
if (t < 0) return "1" + "0".repeat(9 - (512 + t).toString(2).length) + (512 + t).toString(2);
|
|
1025
1030
|
const e = parseInt(t, 10).toString(2);
|
|
1026
1031
|
if (void 0 === n) return e;
|
|
@@ -1028,8 +1033,8 @@ function Zn(t, n) {
|
|
|
1028
1033
|
if (n < e.length) throw c.BuiltIn.Num;
|
|
1029
1034
|
return "0".repeat(n - e.length) + e;
|
|
1030
1035
|
}
|
|
1031
|
-
function
|
|
1032
|
-
if (n =
|
|
1036
|
+
function te(t, n) {
|
|
1037
|
+
if (n = Ne(n), (t = Ie(t)) < -549755813888 || t >= 549755813888) throw c.BuiltIn.Num;
|
|
1033
1038
|
if (t < 0) return (1099511627776 + t).toString(16).toUpperCase();
|
|
1034
1039
|
const e = parseInt(t, 10).toString(16);
|
|
1035
1040
|
if (void 0 === n) return e.toUpperCase();
|
|
@@ -1037,8 +1042,8 @@ function Jn(t, n) {
|
|
|
1037
1042
|
if (n < e.length) throw c.BuiltIn.Num;
|
|
1038
1043
|
return "0".repeat(n - e.length) + e.toUpperCase();
|
|
1039
1044
|
}
|
|
1040
|
-
function
|
|
1041
|
-
if (n =
|
|
1045
|
+
function ne(t, n) {
|
|
1046
|
+
if (n = Ne(n), (t = Ie(t)) < -536870912 || t >= 536870912) throw c.BuiltIn.Num;
|
|
1042
1047
|
if (t < 0) return (t + 1073741824).toString(8);
|
|
1043
1048
|
const e = parseInt(t, 10).toString(8);
|
|
1044
1049
|
if (void 0 === n) return e.toUpperCase();
|
|
@@ -1046,62 +1051,62 @@ function te(t, n) {
|
|
|
1046
1051
|
if (n < e.length) throw c.BuiltIn.Num;
|
|
1047
1052
|
return "0".repeat(n - e.length) + e;
|
|
1048
1053
|
}
|
|
1049
|
-
function
|
|
1050
|
-
n =
|
|
1051
|
-
const e =
|
|
1052
|
-
if (o <
|
|
1054
|
+
function ee(t, n) {
|
|
1055
|
+
n = Ne(n);
|
|
1056
|
+
const e = pe(t, fe), r = 10 === e.length && "f" === e.substring(0, 1).toLowerCase(), o = r ? parseInt(e, 16) - 1099511627776 : parseInt(e, 16);
|
|
1057
|
+
if (o < ge || o > me) return NaN;
|
|
1053
1058
|
if (r) return "1" + "0".repeat(9 - (o + 512).toString(2).length) + (o + 512).toString(2);
|
|
1054
1059
|
const u = o.toString(2);
|
|
1055
1060
|
return void 0 === n ? u : (n = Math.trunc(n)) <= 0 || n < u.length ? NaN : "0".repeat(n - u.length) + u;
|
|
1056
1061
|
}
|
|
1057
|
-
function
|
|
1058
|
-
const n = parseInt(
|
|
1062
|
+
function re(t) {
|
|
1063
|
+
const n = parseInt(pe(t, fe), 16);
|
|
1059
1064
|
return n >= 549755813888 ? n - 1099511627776 : n;
|
|
1060
1065
|
}
|
|
1061
|
-
function re(t, n) {
|
|
1062
|
-
n = ge(n);
|
|
1063
|
-
const e = ee(Ie(t, ae));
|
|
1064
|
-
if (e > fe || e < ce) throw c.BuiltIn.Num;
|
|
1065
|
-
return te(e, n);
|
|
1066
|
-
}
|
|
1067
1066
|
function oe(t, n) {
|
|
1068
|
-
n =
|
|
1069
|
-
const e =
|
|
1067
|
+
n = Ne(n);
|
|
1068
|
+
const e = re(pe(t, fe));
|
|
1069
|
+
if (e > ce || e < he) throw c.BuiltIn.Num;
|
|
1070
|
+
return ne(e, n);
|
|
1071
|
+
}
|
|
1072
|
+
function ue(t, n) {
|
|
1073
|
+
n = Ne(n);
|
|
1074
|
+
const e = pe(t, ae);
|
|
1070
1075
|
if (void 0 !== n && n > 10) throw c.BuiltIn.Num;
|
|
1071
1076
|
if (void 0 !== n && n < 0) throw c.BuiltIn.Num;
|
|
1072
1077
|
n = void 0 === n ? NaN : Math.trunc(n);
|
|
1073
|
-
const r = 10 === e.length && "7" === e.substring(0, 1), o =
|
|
1074
|
-
if (o <
|
|
1078
|
+
const r = 10 === e.length && "7" === e.substring(0, 1), o = ie(e);
|
|
1079
|
+
if (o < ge || o > me) throw c.BuiltIn.Num;
|
|
1075
1080
|
if (r) return "1" + "0".repeat(9 - (512 + o).toString(2).length) + (512 + o).toString(2);
|
|
1076
1081
|
const u = o.toString(2);
|
|
1077
1082
|
if (0 === n) return u;
|
|
1078
1083
|
if (n < u.length) throw c.BuiltIn.Num;
|
|
1079
1084
|
return "0".repeat(n - u.length) + u;
|
|
1080
1085
|
}
|
|
1081
|
-
function
|
|
1082
|
-
const n = parseInt(
|
|
1086
|
+
function ie(t) {
|
|
1087
|
+
const n = parseInt(pe(t, ae), 8);
|
|
1083
1088
|
return n >= 536870912 ? n - 1073741824 : n;
|
|
1084
1089
|
}
|
|
1085
|
-
function
|
|
1086
|
-
n =
|
|
1087
|
-
const e =
|
|
1090
|
+
function se(t, n) {
|
|
1091
|
+
n = Ne(n);
|
|
1092
|
+
const e = pe(t, ae);
|
|
1088
1093
|
if ((n = void 0 === n ? NaN : Math.trunc(n)) < 0 || n > 10) return NaN;
|
|
1089
|
-
const r =
|
|
1094
|
+
const r = ie(e), o = te(r);
|
|
1090
1095
|
return 0 === n || r < 0 ? o : n < o.length ? NaN : "0".repeat(n - o.length) + o;
|
|
1091
1096
|
}
|
|
1092
|
-
var
|
|
1097
|
+
var le = /^[01]{1,10}$/, ae = /^[0-7]{1,10}$/, fe = /^[0-9a-fA-F]{1,10}$/, ce = 536870911, he = -536870912, me = 511, ge = -512, Ne = (t) => {
|
|
1093
1098
|
if (void 0 === t) return;
|
|
1094
1099
|
if ("boolean" == typeof t) throw c.BuiltIn.Value;
|
|
1095
1100
|
const n = Math.trunc(null === t ? 0 : l.parseAsNumber(t));
|
|
1096
1101
|
if (n < 1 || n > 10) throw c.BuiltIn.Num;
|
|
1097
1102
|
return n;
|
|
1098
|
-
},
|
|
1103
|
+
}, Ie = (t) => {
|
|
1099
1104
|
if (c.isError(t)) throw t;
|
|
1100
1105
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
1101
1106
|
if (null === t) return 0;
|
|
1102
1107
|
if ("boolean" == typeof t) throw c.BuiltIn.Value;
|
|
1103
1108
|
return Math.trunc(l.parseAsNumber(t));
|
|
1104
|
-
},
|
|
1109
|
+
}, pe = (t, n) => {
|
|
1105
1110
|
if (c.isError(t)) throw t;
|
|
1106
1111
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
1107
1112
|
if (null === t) return "0";
|
|
@@ -1111,7 +1116,7 @@ var se = /^[01]{1,10}$/, le = /^[0-7]{1,10}$/, ae = /^[0-9a-fA-F]{1,10}$/, fe =
|
|
|
1111
1116
|
if ("" === e) return "0";
|
|
1112
1117
|
if (!n.test(e)) throw c.BuiltIn.Num;
|
|
1113
1118
|
return e;
|
|
1114
|
-
},
|
|
1119
|
+
}, Me = 0xffffffffffff, de = (t) => {
|
|
1115
1120
|
if (c.isError(t)) throw t;
|
|
1116
1121
|
const n = typeof t;
|
|
1117
1122
|
if ("boolean" === n) return t ? 1 : 0;
|
|
@@ -1122,46 +1127,46 @@ var se = /^[01]{1,10}$/, le = /^[0-7]{1,10}$/, ae = /^[0-9a-fA-F]{1,10}$/, fe =
|
|
|
1122
1127
|
if ("string" !== n) throw c.BuiltIn.Value;
|
|
1123
1128
|
e = l.parseAsNumber(t);
|
|
1124
1129
|
}
|
|
1125
|
-
if (e < 0 || e >
|
|
1130
|
+
if (e < 0 || e > Me || Math.floor(e) !== e) throw c.BuiltIn.Num;
|
|
1126
1131
|
return e;
|
|
1127
|
-
},
|
|
1132
|
+
}, we = (t) => {
|
|
1128
1133
|
if (c.isError(t)) throw t;
|
|
1129
1134
|
return null == t ? 0 : "boolean" == typeof t ? t ? 1 : 0 : Math.trunc(l.parseAsNumber(t));
|
|
1130
|
-
},
|
|
1131
|
-
function
|
|
1132
|
-
t = null == t ? 0 : l.parseAsNumber(t), n =
|
|
1133
|
-
const r =
|
|
1135
|
+
}, Ae = (t, n, e) => Number(e(BigInt(t), BigInt(n))), Ee = At({ CONVERT: () => Be });
|
|
1136
|
+
function Be(t, n, e) {
|
|
1137
|
+
t = null == t ? 0 : l.parseAsNumber(t), n = be(n), e = be(e);
|
|
1138
|
+
const r = De(n), o = De(e);
|
|
1134
1139
|
if (null === r || null === o || r.unit[3] !== o.unit[3]) throw c.BuiltIn.NA;
|
|
1135
1140
|
return "temperature" === r.unit[3] ? function(t, n, e) {
|
|
1136
1141
|
if (n === e) return t;
|
|
1137
|
-
const r =
|
|
1138
|
-
return r ? r(t) :
|
|
1142
|
+
const r = Re[`${n}>${e}`];
|
|
1143
|
+
return r ? r(t) : ye[e](Ce[n](t));
|
|
1139
1144
|
}(t * r.multiplier, r.unit[1], o.unit[1]) / o.multiplier : t * (r.unit[5] / o.unit[5]) * (r.multiplier / o.multiplier);
|
|
1140
1145
|
}
|
|
1141
|
-
function
|
|
1146
|
+
function be(t) {
|
|
1142
1147
|
if (c.isError(t)) throw t;
|
|
1143
1148
|
if ("boolean" == typeof t) throw c.BuiltIn.Value;
|
|
1144
1149
|
return null == t ? "" : String(t);
|
|
1145
1150
|
}
|
|
1146
|
-
var
|
|
1151
|
+
var Ce = {
|
|
1147
1152
|
C: (t) => t,
|
|
1148
1153
|
F: (t) => (t - 32) / 1.8,
|
|
1149
1154
|
K: (t) => t - 273.15,
|
|
1150
1155
|
Rank: (t) => t / 1.8 - 273.15,
|
|
1151
1156
|
Reau: (t) => t / .8
|
|
1152
|
-
},
|
|
1157
|
+
}, ye = {
|
|
1153
1158
|
C: (t) => t,
|
|
1154
1159
|
F: (t) => 1.8 * t + 32,
|
|
1155
1160
|
K: (t) => t + 273.15,
|
|
1156
1161
|
Rank: (t) => 1.8 * (t + 273.15),
|
|
1157
1162
|
Reau: (t) => .8 * t
|
|
1158
|
-
},
|
|
1163
|
+
}, Re = {
|
|
1159
1164
|
"F>Rank": (t) => t + 459.67,
|
|
1160
1165
|
"Rank>F": (t) => t - 459.67,
|
|
1161
1166
|
"K>Rank": (t) => 1.8 * t,
|
|
1162
1167
|
"Rank>K": (t) => t / 1.8,
|
|
1163
1168
|
"F>Reau": (t) => .8 * (t - 32) / 1.8
|
|
1164
|
-
},
|
|
1169
|
+
}, ve = [
|
|
1165
1170
|
[
|
|
1166
1171
|
"a.u. of energy",
|
|
1167
1172
|
"Eh",
|
|
@@ -2238,14 +2243,14 @@ var be = {
|
|
|
2238
2243
|
"none",
|
|
2239
2244
|
1
|
|
2240
2245
|
]
|
|
2241
|
-
],
|
|
2246
|
+
], Se = (() => {
|
|
2242
2247
|
const t = /* @__PURE__ */ new Map();
|
|
2243
|
-
for (const n of
|
|
2248
|
+
for (const n of ve) {
|
|
2244
2249
|
t.set(n[1], n);
|
|
2245
2250
|
for (const e of n[2] ?? []) t.set(e, n);
|
|
2246
2251
|
}
|
|
2247
2252
|
return t;
|
|
2248
|
-
})(),
|
|
2253
|
+
})(), xe = {
|
|
2249
2254
|
Y: 24,
|
|
2250
2255
|
Z: 21,
|
|
2251
2256
|
E: 18,
|
|
@@ -2267,7 +2272,7 @@ var be = {
|
|
|
2267
2272
|
a: -18,
|
|
2268
2273
|
z: -21,
|
|
2269
2274
|
y: -24
|
|
2270
|
-
},
|
|
2275
|
+
}, Te = {
|
|
2271
2276
|
Yi: 80,
|
|
2272
2277
|
Zi: 70,
|
|
2273
2278
|
Ei: 60,
|
|
@@ -2277,24 +2282,24 @@ var be = {
|
|
|
2277
2282
|
Mi: 20,
|
|
2278
2283
|
ki: 10
|
|
2279
2284
|
};
|
|
2280
|
-
function
|
|
2281
|
-
const n =
|
|
2285
|
+
function De(t) {
|
|
2286
|
+
const n = Se.get(t);
|
|
2282
2287
|
if (n) return {
|
|
2283
2288
|
unit: n,
|
|
2284
2289
|
multiplier: 1
|
|
2285
2290
|
};
|
|
2286
|
-
const e =
|
|
2291
|
+
const e = Te[t.slice(0, 2)];
|
|
2287
2292
|
if (void 0 !== e) {
|
|
2288
|
-
const n =
|
|
2293
|
+
const n = Se.get(t.slice(2));
|
|
2289
2294
|
if ("si+binary" === n?.[4]) return {
|
|
2290
2295
|
unit: n,
|
|
2291
2296
|
multiplier: 2 ** e
|
|
2292
2297
|
};
|
|
2293
2298
|
}
|
|
2294
2299
|
for (const n of [t.slice(0, 2), t.slice(0, 1)]) {
|
|
2295
|
-
const e =
|
|
2300
|
+
const e = xe[n];
|
|
2296
2301
|
if (void 0 === e) continue;
|
|
2297
|
-
const r =
|
|
2302
|
+
const r = Se.get(t.slice(n.length));
|
|
2298
2303
|
if (r && "none" !== r[4]) return {
|
|
2299
2304
|
unit: r,
|
|
2300
2305
|
multiplier: Number("1e" + e * (r[6] ?? 1))
|
|
@@ -2302,21 +2307,21 @@ function Te(t) {
|
|
|
2302
2307
|
}
|
|
2303
2308
|
return null;
|
|
2304
2309
|
}
|
|
2305
|
-
var
|
|
2306
|
-
DELTA: () =>
|
|
2307
|
-
GESTEP: () =>
|
|
2310
|
+
var Ve = At({
|
|
2311
|
+
DELTA: () => Fe,
|
|
2312
|
+
GESTEP: () => Oe
|
|
2308
2313
|
});
|
|
2309
|
-
function Ve(t, n = 0) {
|
|
2310
|
-
return n = Oe(n), (t = Oe(t)) === n ? 1 : 0;
|
|
2311
|
-
}
|
|
2312
2314
|
function Fe(t, n = 0) {
|
|
2313
|
-
return n =
|
|
2315
|
+
return n = Pe(n), (t = Pe(t)) === n ? 1 : 0;
|
|
2314
2316
|
}
|
|
2315
|
-
function Oe(t) {
|
|
2317
|
+
function Oe(t, n = 0) {
|
|
2318
|
+
return n = Pe(n), (t = Pe(t)) >= n ? 1 : 0;
|
|
2319
|
+
}
|
|
2320
|
+
function Pe(t) {
|
|
2316
2321
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2317
2322
|
return null === t ? 0 : l.parseAsNumber(t);
|
|
2318
2323
|
}
|
|
2319
|
-
var
|
|
2324
|
+
var Le = [
|
|
2320
2325
|
57.15623566586292,
|
|
2321
2326
|
-59.59796035547549,
|
|
2322
2327
|
14.136097974741746,
|
|
@@ -2332,14 +2337,14 @@ var Pe = [
|
|
|
2332
2337
|
-26190838401581408e-21,
|
|
2333
2338
|
36899182659531625e-22
|
|
2334
2339
|
];
|
|
2335
|
-
function
|
|
2340
|
+
function _e(t) {
|
|
2336
2341
|
let n = t, e = t + 5.2421875;
|
|
2337
2342
|
e = (t + .5) * Math.log(e) - e;
|
|
2338
2343
|
let r = .9999999999999971;
|
|
2339
|
-
for (let t = 0; t < 14; t++) r +=
|
|
2344
|
+
for (let t = 0; t < 14; t++) r += Le[t] / ++n;
|
|
2340
2345
|
return e + Math.log(2.5066282746310007 * r / t);
|
|
2341
2346
|
}
|
|
2342
|
-
function
|
|
2347
|
+
function Ue(t) {
|
|
2343
2348
|
const n = [
|
|
2344
2349
|
-1.716185138865495,
|
|
2345
2350
|
24.76565080557592,
|
|
@@ -2372,10 +2377,10 @@ function _e(t) {
|
|
|
2372
2377
|
else if (f > a) for (let t = 0; t < i; ++t) o *= a, a++;
|
|
2373
2378
|
return u && (o = u / o), o;
|
|
2374
2379
|
}
|
|
2375
|
-
function
|
|
2376
|
-
if (!(t <= 0 || n <= 0)) return t + n > 170 ? Math.exp(
|
|
2380
|
+
function ke(t, n) {
|
|
2381
|
+
if (!(t <= 0 || n <= 0)) return t + n > 170 ? Math.exp(Xe(t, n)) : Ue(t) * Ue(n) / Ue(t + n);
|
|
2377
2382
|
}
|
|
2378
|
-
var
|
|
2383
|
+
var $e = [
|
|
2379
2384
|
1 / 12,
|
|
2380
2385
|
-1 / 360,
|
|
2381
2386
|
1 / 1260,
|
|
@@ -2384,18 +2389,18 @@ var ke = [
|
|
|
2384
2389
|
-691 / 360360,
|
|
2385
2390
|
1 / 156
|
|
2386
2391
|
];
|
|
2387
|
-
function
|
|
2392
|
+
function je(t) {
|
|
2388
2393
|
const n = 1 / (t * t);
|
|
2389
2394
|
let e = 0;
|
|
2390
|
-
for (let t =
|
|
2395
|
+
for (let t = $e.length - 1; t >= 0; t--) e = (e + $e[t]) * n;
|
|
2391
2396
|
return e * t;
|
|
2392
2397
|
}
|
|
2393
|
-
var
|
|
2398
|
+
var Xe = (t, n) => {
|
|
2394
2399
|
const e = t < n ? t : n, r = t < n ? n : t;
|
|
2395
|
-
return r < 30 ?
|
|
2396
|
-
return n * Math.log(t) + (t + n - .5) * Math.log1p(n / t) - n +
|
|
2400
|
+
return r < 30 ? _e(t) + _e(n) - _e(t + n) : _e(e) - function(t, n) {
|
|
2401
|
+
return n * Math.log(t) + (t + n - .5) * Math.log1p(n / t) - n + je(t + n) - je(t);
|
|
2397
2402
|
}(r, e);
|
|
2398
|
-
},
|
|
2403
|
+
}, qe = [
|
|
2399
2404
|
-1.3026537197817094,
|
|
2400
2405
|
.6419697923564902,
|
|
2401
2406
|
.019476473204185836,
|
|
@@ -2425,29 +2430,29 @@ var je = (t, n) => {
|
|
|
2425
2430
|
121e-18,
|
|
2426
2431
|
-28e-18
|
|
2427
2432
|
];
|
|
2428
|
-
function
|
|
2433
|
+
function Ge(t) {
|
|
2429
2434
|
let n = 0, e = 0;
|
|
2430
2435
|
const r = 2 / (2 + t), o = 4 * r - 2;
|
|
2431
|
-
for (let t =
|
|
2436
|
+
for (let t = qe.length - 1; t > 0; t--) {
|
|
2432
2437
|
const r = n;
|
|
2433
|
-
n = o * n - e +
|
|
2438
|
+
n = o * n - e + qe[t], e = r;
|
|
2434
2439
|
}
|
|
2435
|
-
return r * Math.exp(-t * t + .5 * (
|
|
2440
|
+
return r * Math.exp(-t * t + .5 * (qe[0] + o * n) - e);
|
|
2436
2441
|
}
|
|
2437
|
-
var
|
|
2438
|
-
function
|
|
2442
|
+
var He = (t) => t >= 0 ? 1 - Ge(t) : Ge(-t) - 1, Ye = (t) => t >= 0 ? Ge(t) : 2 - Ge(-t);
|
|
2443
|
+
function ze(t) {
|
|
2439
2444
|
if (t >= 2) return -100;
|
|
2440
2445
|
if (t <= 0) return 100;
|
|
2441
2446
|
const n = t < 1 ? t : 2 - t, e = Math.sqrt(-2 * Math.log(n / 2));
|
|
2442
2447
|
let r = -.70711 * ((2.30753 + .27061 * e) / (1 + e * (.99229 + .04481 * e)) - e);
|
|
2443
2448
|
for (let t = 0; t < 2; t++) {
|
|
2444
|
-
const t =
|
|
2449
|
+
const t = Ye(r) - n;
|
|
2445
2450
|
r += t / (1.1283791670955126 * Math.exp(-r * r) - r * t);
|
|
2446
2451
|
}
|
|
2447
2452
|
return t < 1 ? r : -r;
|
|
2448
2453
|
}
|
|
2449
|
-
var
|
|
2450
|
-
function
|
|
2454
|
+
var Ke = (t, n) => Ze(t, n, !1), We = 1e8;
|
|
2455
|
+
function Qe(t) {
|
|
2451
2456
|
if (Math.abs(t) < .03) {
|
|
2452
2457
|
let n = 0;
|
|
2453
2458
|
for (let e = 14; e >= 0; e--) n = n * t + 2 * (e % 2 == 0 ? -1 : 1) / (e + 3);
|
|
@@ -2455,16 +2460,16 @@ function We(t) {
|
|
|
2455
2460
|
}
|
|
2456
2461
|
return (2 * (t - Math.log1p(t)) / (t * t) - 1) / t;
|
|
2457
2462
|
}
|
|
2458
|
-
function
|
|
2463
|
+
function Ze(t, n, e) {
|
|
2459
2464
|
if (n < 0 || t <= 0) return NaN;
|
|
2460
|
-
if (t >=
|
|
2465
|
+
if (t >= We) {
|
|
2461
2466
|
const r = function(t, n) {
|
|
2462
|
-
const e = n / t - 1, r =
|
|
2463
|
-
return .5 *
|
|
2467
|
+
const e = n / t - 1, r = Qe(e), o = r * e, u = Math.sqrt(1 + o), i = t * e * e * (1 + o) / 2;
|
|
2468
|
+
return .5 * Ye(Math.sign(e) * Math.sqrt(i)) + Math.exp(-i) / Math.sqrt(2 * Math.PI * t) * (r / (u * (u + 1)));
|
|
2464
2469
|
}(t, n);
|
|
2465
2470
|
return e ? r : 1 - r;
|
|
2466
2471
|
}
|
|
2467
|
-
const r =
|
|
2472
|
+
const r = _e(t), o = -~(8.5 * Math.log(t >= 1 ? t : 1 / t) + .4 * t + 17);
|
|
2468
2473
|
if (n < t + 1) {
|
|
2469
2474
|
let u = t, i = 1 / t, s = i;
|
|
2470
2475
|
for (let t = 1; t <= o; t++) {
|
|
@@ -2482,8 +2487,8 @@ function Qe(t, n, e) {
|
|
|
2482
2487
|
const a = l * Math.exp(-n + t * Math.log(n) - r);
|
|
2483
2488
|
return e ? a : 1 - a;
|
|
2484
2489
|
}
|
|
2485
|
-
function
|
|
2486
|
-
const e = 4 * Number.EPSILON, r = n - 1, o =
|
|
2490
|
+
function Je(t, n) {
|
|
2491
|
+
const e = 4 * Number.EPSILON, r = n - 1, o = _e(n);
|
|
2487
2492
|
let u, i = 0, s = 0;
|
|
2488
2493
|
if (t >= 1) return 1 / 0;
|
|
2489
2494
|
if (t <= 0) return 0;
|
|
@@ -2497,7 +2502,7 @@ function Ze(t, n) {
|
|
|
2497
2502
|
}
|
|
2498
2503
|
for (let l = 0; l < 100; l++) {
|
|
2499
2504
|
if (u <= 0) return 0;
|
|
2500
|
-
const l =
|
|
2505
|
+
const l = Ke(n, u) - t;
|
|
2501
2506
|
let a;
|
|
2502
2507
|
a = n > 1 ? s * Math.exp(-(u - r) + r * (Math.log(u) - i)) : Math.exp(-u + r * Math.log(u) - o);
|
|
2503
2508
|
const f = l / a;
|
|
@@ -2505,7 +2510,7 @@ function Ze(t, n) {
|
|
|
2505
2510
|
}
|
|
2506
2511
|
return u;
|
|
2507
2512
|
}
|
|
2508
|
-
function
|
|
2513
|
+
function tr(t, n, e) {
|
|
2509
2514
|
const r = Number.MIN_VALUE / Number.EPSILON, o = n + e, u = n + 1, i = n - 1;
|
|
2510
2515
|
let s = 1, l = 1 - o * t / u;
|
|
2511
2516
|
Math.abs(l) < r && (l = r), l = 1 / l;
|
|
@@ -2519,17 +2524,17 @@ function Je(t, n, e) {
|
|
|
2519
2524
|
}
|
|
2520
2525
|
return a;
|
|
2521
2526
|
}
|
|
2522
|
-
var
|
|
2523
|
-
function nr(t, n, e, r) {
|
|
2524
|
-
return t < 0 || t > 1 ? NaN : t < (e + 1) / (e + r + 2) ? er(t, n, e, r) * Je(t, e, r) / e : 1 - er(n, t, r, e) * Je(n, r, e) / r;
|
|
2525
|
-
}
|
|
2527
|
+
var nr = (t, n, e) => er(t, 1 - t, n, e);
|
|
2526
2528
|
function er(t, n, e, r) {
|
|
2529
|
+
return t < 0 || t > 1 ? NaN : t < (e + 1) / (e + r + 2) ? rr(t, n, e, r) * tr(t, e, r) / e : 1 - rr(n, t, r, e) * tr(n, r, e) / r;
|
|
2530
|
+
}
|
|
2531
|
+
function rr(t, n, e, r) {
|
|
2527
2532
|
if (0 === t || 1 === t) return 0;
|
|
2528
2533
|
const o = t < .5 ? Math.log1p(-t) : Math.log(n);
|
|
2529
|
-
return Math.exp(e * Math.log(t) + r * o -
|
|
2534
|
+
return Math.exp(e * Math.log(t) + r * o - Xe(e, r));
|
|
2530
2535
|
}
|
|
2531
|
-
function
|
|
2532
|
-
if (!Number.isFinite(
|
|
2536
|
+
function or(t, n, e) {
|
|
2537
|
+
if (!Number.isFinite(_e(n)) || !Number.isFinite(_e(e))) return NaN;
|
|
2533
2538
|
const r = 4 * Number.EPSILON, o = n - 1, u = e - 1;
|
|
2534
2539
|
let i, s;
|
|
2535
2540
|
if (t <= 0) return 0;
|
|
@@ -2545,152 +2550,152 @@ function rr(t, n, e) {
|
|
|
2545
2550
|
const u = s + Math.exp(e * o) / e;
|
|
2546
2551
|
i = t < s / u ? Math.pow(n * u * t, 1 / n) : 1 - Math.pow(e * u * (1 - t), 1 / e);
|
|
2547
2552
|
}
|
|
2548
|
-
const l = -
|
|
2553
|
+
const l = -Xe(n, e);
|
|
2549
2554
|
for (let a = 0; a < 100; a++) {
|
|
2550
2555
|
if (0 === i || 1 === i) return i;
|
|
2551
|
-
const f =
|
|
2556
|
+
const f = nr(i, n, e) - t;
|
|
2552
2557
|
s = Math.exp(o * Math.log(i) + u * Math.log1p(-i) + l);
|
|
2553
2558
|
const c = f / s;
|
|
2554
2559
|
if (i -= s = c / (1 - .5 * Math.min(1, c * (o / i - u / (1 - i)))), i <= 0 && (i = .5 * (i + s)), i >= 1 && (i = .5 * (i + s + 1)), Math.abs(s) < r * i && a > 0) break;
|
|
2555
2560
|
}
|
|
2556
2561
|
return i;
|
|
2557
2562
|
}
|
|
2558
|
-
var
|
|
2559
|
-
ERF: () =>
|
|
2560
|
-
ERFC: () =>
|
|
2561
|
-
ERFC_PRECISE: () =>
|
|
2562
|
-
ERF_PRECISE: () =>
|
|
2563
|
-
}),
|
|
2563
|
+
var ur = At({
|
|
2564
|
+
ERF: () => sr,
|
|
2565
|
+
ERFC: () => ar,
|
|
2566
|
+
ERFC_PRECISE: () => fr,
|
|
2567
|
+
ERF_PRECISE: () => lr
|
|
2568
|
+
}), ir = (t) => {
|
|
2564
2569
|
if (c.isError(t)) throw t;
|
|
2565
2570
|
return null === t ? 0 : l.parseAsNumber(t);
|
|
2566
2571
|
};
|
|
2567
|
-
function
|
|
2572
|
+
function sr(t, n) {
|
|
2568
2573
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2569
|
-
const e =
|
|
2570
|
-
return void 0 === n ?
|
|
2571
|
-
}
|
|
2572
|
-
function sr(t) {
|
|
2573
|
-
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2574
|
-
return Ge(ur(t));
|
|
2574
|
+
const e = ir(t);
|
|
2575
|
+
return void 0 === n ? He(e) : He(ir(n)) - He(e);
|
|
2575
2576
|
}
|
|
2576
2577
|
function lr(t) {
|
|
2577
2578
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2578
|
-
return He(
|
|
2579
|
+
return He(ir(t));
|
|
2579
2580
|
}
|
|
2580
2581
|
function ar(t) {
|
|
2581
2582
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2582
|
-
return
|
|
2583
|
+
return Ye(ir(t));
|
|
2584
|
+
}
|
|
2585
|
+
function fr(t) {
|
|
2586
|
+
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2587
|
+
return Ye(ir(t));
|
|
2583
2588
|
}
|
|
2584
|
-
var
|
|
2589
|
+
var cr = Math.PI, hr = 2 ** 27, mr = 134217729, gr = (t, n) => {
|
|
2585
2590
|
const e = t + n, r = e - t;
|
|
2586
2591
|
return [e, t - (e - r) + (n - r)];
|
|
2587
|
-
},
|
|
2588
|
-
const n =
|
|
2589
|
-
const e = t * n, r =
|
|
2592
|
+
}, Nr = (t) => {
|
|
2593
|
+
const n = cr / 2, e = Math.round(t / n), [r, o] = ((t, n) => {
|
|
2594
|
+
const e = t * n, r = mr * t, o = r - (r - t), u = t - o, i = mr * n, s = i - (i - n), l = n - s;
|
|
2590
2595
|
return [e, o * s - e + o * l + u * s + u * l];
|
|
2591
|
-
})(e, n), [u, i] =
|
|
2596
|
+
})(e, n), [u, i] = gr(t, -r), [s, l] = gr(u, i - o - 61257422745431e-30 * e);
|
|
2592
2597
|
return [
|
|
2593
2598
|
(e % 4 + 4) % 4,
|
|
2594
2599
|
s,
|
|
2595
2600
|
l
|
|
2596
2601
|
];
|
|
2597
|
-
},
|
|
2598
|
-
function pr(t) {
|
|
2599
|
-
const [n, e, r] = gr(t);
|
|
2600
|
-
switch (n) {
|
|
2601
|
-
case 0: return Nr(e, r);
|
|
2602
|
-
case 1: return Ir(e, r);
|
|
2603
|
-
case 2: return -Nr(e, r);
|
|
2604
|
-
default: return -Ir(e, r);
|
|
2605
|
-
}
|
|
2606
|
-
}
|
|
2602
|
+
}, Ir = (t, n) => Math.sin(t) + Math.cos(t) * n, pr = (t, n) => Math.cos(t) - Math.sin(t) * n;
|
|
2607
2603
|
function Mr(t) {
|
|
2608
|
-
const [n, e, r] =
|
|
2604
|
+
const [n, e, r] = Nr(t);
|
|
2609
2605
|
switch (n) {
|
|
2610
2606
|
case 0: return Ir(e, r);
|
|
2611
|
-
case 1: return
|
|
2607
|
+
case 1: return pr(e, r);
|
|
2612
2608
|
case 2: return -Ir(e, r);
|
|
2613
|
-
default: return
|
|
2614
|
-
}
|
|
2615
|
-
}
|
|
2616
|
-
|
|
2617
|
-
|
|
2618
|
-
|
|
2619
|
-
|
|
2620
|
-
|
|
2621
|
-
|
|
2622
|
-
|
|
2623
|
-
|
|
2624
|
-
|
|
2625
|
-
|
|
2626
|
-
|
|
2627
|
-
|
|
2628
|
-
|
|
2629
|
-
|
|
2630
|
-
|
|
2631
|
-
|
|
2632
|
-
|
|
2633
|
-
|
|
2634
|
-
|
|
2635
|
-
|
|
2636
|
-
|
|
2637
|
-
|
|
2638
|
-
|
|
2639
|
-
|
|
2640
|
-
|
|
2641
|
-
|
|
2642
|
-
|
|
2643
|
-
|
|
2644
|
-
|
|
2645
|
-
|
|
2609
|
+
default: return -pr(e, r);
|
|
2610
|
+
}
|
|
2611
|
+
}
|
|
2612
|
+
function dr(t) {
|
|
2613
|
+
const [n, e, r] = Nr(t);
|
|
2614
|
+
switch (n) {
|
|
2615
|
+
case 0: return pr(e, r);
|
|
2616
|
+
case 1: return -Ir(e, r);
|
|
2617
|
+
case 2: return -pr(e, r);
|
|
2618
|
+
default: return Ir(e, r);
|
|
2619
|
+
}
|
|
2620
|
+
}
|
|
2621
|
+
var wr = (t) => Mr(t) / dr(t), Ar = At({
|
|
2622
|
+
COMPLEX: () => Er,
|
|
2623
|
+
IMABS: () => Br,
|
|
2624
|
+
IMAGINARY: () => br,
|
|
2625
|
+
IMARGUMENT: () => Cr,
|
|
2626
|
+
IMCONJUGATE: () => vr,
|
|
2627
|
+
IMCOS: () => Xr,
|
|
2628
|
+
IMCOSH: () => qr,
|
|
2629
|
+
IMCOT: () => Gr,
|
|
2630
|
+
IMCOTH: () => Hr,
|
|
2631
|
+
IMCSC: () => Yr,
|
|
2632
|
+
IMCSCH: () => zr,
|
|
2633
|
+
IMDIV: () => Kr,
|
|
2634
|
+
IMEXP: () => Wr,
|
|
2635
|
+
IMLN: () => Qr,
|
|
2636
|
+
IMLOG: () => Zr,
|
|
2637
|
+
IMLOG10: () => Jr,
|
|
2638
|
+
IMLOG2: () => to,
|
|
2639
|
+
IMPOWER: () => no,
|
|
2640
|
+
IMPRODUCT: () => eo,
|
|
2641
|
+
IMREAL: () => ro,
|
|
2642
|
+
IMSEC: () => oo,
|
|
2643
|
+
IMSECH: () => uo,
|
|
2644
|
+
IMSIN: () => io,
|
|
2645
|
+
IMSINH: () => so,
|
|
2646
|
+
IMSQRT: () => lo,
|
|
2647
|
+
IMSUB: () => ao,
|
|
2648
|
+
IMSUM: () => fo,
|
|
2649
|
+
IMTAN: () => co,
|
|
2650
|
+
IMTANH: () => ho
|
|
2646
2651
|
});
|
|
2647
|
-
function
|
|
2652
|
+
function Er(t, n, e = "i") {
|
|
2648
2653
|
if (c.isError(e)) throw e;
|
|
2649
2654
|
if (e || (e = "i"), "i" !== e && "j" !== e) throw c.BuiltIn.Value;
|
|
2650
|
-
const r =
|
|
2655
|
+
const r = jr(t), o = jr(n);
|
|
2651
2656
|
if (0 === r && 0 === o) return l.toText(0);
|
|
2652
2657
|
if (0 === r) return 1 === o ? e : -1 === o ? "-" + e : l.toText(o) + e;
|
|
2653
2658
|
if (0 === o) return l.toText(r);
|
|
2654
2659
|
let u = o > 0 ? "+" : "";
|
|
2655
2660
|
return 1 === o ? l.toText(r) + u + e : -1 === o ? l.toText(r) + u + "-" + e : l.toText(r) + u + l.toText(o) + e;
|
|
2656
2661
|
}
|
|
2657
|
-
function Er(t) {
|
|
2658
|
-
const { real: n, im: e } = Mo(t);
|
|
2659
|
-
return Math.hypot(n, e);
|
|
2660
|
-
}
|
|
2661
2662
|
function Br(t) {
|
|
2662
|
-
|
|
2663
|
+
const { real: n, im: e } = wo(t);
|
|
2664
|
+
return Math.hypot(n, e);
|
|
2663
2665
|
}
|
|
2664
2666
|
function br(t) {
|
|
2665
|
-
|
|
2667
|
+
return wo(t).im;
|
|
2668
|
+
}
|
|
2669
|
+
function Cr(t) {
|
|
2670
|
+
const { real: n, im: e } = wo(t);
|
|
2666
2671
|
if (0 === n && 0 === e) throw c.BuiltIn.Div0;
|
|
2667
|
-
return
|
|
2672
|
+
return yr(n, e);
|
|
2668
2673
|
}
|
|
2669
|
-
var
|
|
2674
|
+
var yr = (t, n) => 0 === t && 0 === n ? 0 : 0 === t ? n > 0 ? Math.PI / 2 : -Math.PI / 2 : 0 === n ? t > 0 ? 0 : Math.PI : t > 0 ? Math.atan(n / t) : n > 0 ? Math.atan(n / t) + Math.PI : Math.atan(n / t) - Math.PI, Rr = (t, n) => {
|
|
2670
2675
|
const e = Math.log(Math.sqrt(t * t + n * n));
|
|
2671
2676
|
if (!Number.isFinite(e)) throw c.BuiltIn.Num;
|
|
2672
2677
|
return e;
|
|
2673
2678
|
};
|
|
2674
|
-
function
|
|
2675
|
-
const { real: n, im: e, unit: r } =
|
|
2676
|
-
return 0 !== e ?
|
|
2677
|
-
}
|
|
2678
|
-
var
|
|
2679
|
-
real:
|
|
2680
|
-
im: -
|
|
2681
|
-
}), Tr = (t, n) => ({
|
|
2682
|
-
real: pr(t) * vr(n),
|
|
2683
|
-
im: Mr(t) * Sr(n)
|
|
2679
|
+
function vr(t) {
|
|
2680
|
+
const { real: n, im: e, unit: r } = wo(t);
|
|
2681
|
+
return 0 !== e ? Er(n, -e, r) : l.toText(n);
|
|
2682
|
+
}
|
|
2683
|
+
var Sr = (t) => (Math.exp(t) + Math.exp(-t)) / 2, xr = (t) => (Math.exp(t) - Math.exp(-t)) / 2, Tr = (t, n) => ({
|
|
2684
|
+
real: dr(t) * Sr(n),
|
|
2685
|
+
im: -Mr(t) * xr(n)
|
|
2684
2686
|
}), Dr = (t, n) => ({
|
|
2685
|
-
real: Mr(
|
|
2686
|
-
im:
|
|
2687
|
+
real: Mr(t) * Sr(n),
|
|
2688
|
+
im: dr(t) * xr(n)
|
|
2687
2689
|
}), Vr = (t, n) => ({
|
|
2688
|
-
real:
|
|
2689
|
-
im:
|
|
2690
|
-
}), Fr = {
|
|
2690
|
+
real: dr(n) * Sr(t),
|
|
2691
|
+
im: Mr(n) * xr(t)
|
|
2692
|
+
}), Fr = (t, n) => ({
|
|
2693
|
+
real: dr(n) * xr(t),
|
|
2694
|
+
im: Mr(n) * Sr(t)
|
|
2695
|
+
}), Or = {
|
|
2691
2696
|
real: 1,
|
|
2692
2697
|
im: 0
|
|
2693
|
-
},
|
|
2698
|
+
}, Pr = (t, n) => {
|
|
2694
2699
|
if (0 === n.real && 0 === n.im) throw c.BuiltIn.Num;
|
|
2695
2700
|
if (0 === t.im && 0 === n.im) return {
|
|
2696
2701
|
real: t.real / n.real,
|
|
@@ -2709,209 +2714,209 @@ var vr = (t) => (Math.exp(t) + Math.exp(-t)) / 2, Sr = (t) => (Math.exp(t) - Mat
|
|
|
2709
2714
|
real: (t.real * n.real + t.im * n.im) / e,
|
|
2710
2715
|
im: (t.im * n.real - t.real * n.im) / e
|
|
2711
2716
|
};
|
|
2712
|
-
},
|
|
2713
|
-
if (Math.abs(t) >=
|
|
2714
|
-
},
|
|
2717
|
+
}, Lr = (t) => {
|
|
2718
|
+
if (Math.abs(t) >= hr) throw c.BuiltIn.Num;
|
|
2719
|
+
}, _r = (t, n) => {
|
|
2715
2720
|
const e = Math.tanh(n);
|
|
2716
2721
|
if (1 === Math.abs(e)) return {
|
|
2717
2722
|
real: 0,
|
|
2718
2723
|
im: e
|
|
2719
2724
|
};
|
|
2720
|
-
if (
|
|
2721
|
-
real:
|
|
2725
|
+
if (Lr(t), 0 === n) return {
|
|
2726
|
+
real: Mr(t) / dr(t),
|
|
2722
2727
|
im: 0
|
|
2723
2728
|
};
|
|
2724
|
-
const r =
|
|
2729
|
+
const r = dr(2 * t) + Math.cosh(2 * n);
|
|
2725
2730
|
if (0 === r) throw c.BuiltIn.Num;
|
|
2726
2731
|
return {
|
|
2727
|
-
real:
|
|
2732
|
+
real: Mr(2 * t) / r,
|
|
2728
2733
|
im: Math.sinh(2 * n) / r
|
|
2729
2734
|
};
|
|
2730
|
-
},
|
|
2735
|
+
}, Ur = (t, n) => {
|
|
2731
2736
|
const e = Math.tanh(n);
|
|
2732
2737
|
if (1 === Math.abs(e)) return {
|
|
2733
2738
|
real: 0,
|
|
2734
2739
|
im: -e
|
|
2735
2740
|
};
|
|
2736
2741
|
if (0 === n) {
|
|
2737
|
-
if (Math.abs(t) >=
|
|
2742
|
+
if (Math.abs(t) >= hr) return {
|
|
2738
2743
|
real: 0,
|
|
2739
2744
|
im: 0
|
|
2740
2745
|
};
|
|
2741
|
-
const n =
|
|
2746
|
+
const n = Mr(t);
|
|
2742
2747
|
if (0 === n) throw c.BuiltIn.Num;
|
|
2743
2748
|
return {
|
|
2744
|
-
real:
|
|
2749
|
+
real: dr(t) / n,
|
|
2745
2750
|
im: 0
|
|
2746
2751
|
};
|
|
2747
2752
|
}
|
|
2748
|
-
|
|
2749
|
-
const r = Math.cosh(2 * n) -
|
|
2753
|
+
Lr(t);
|
|
2754
|
+
const r = Math.cosh(2 * n) - dr(2 * t);
|
|
2750
2755
|
if (0 === r) throw c.BuiltIn.Num;
|
|
2751
2756
|
return {
|
|
2752
|
-
real:
|
|
2757
|
+
real: Mr(2 * t) / r,
|
|
2753
2758
|
im: -Math.sinh(2 * n) / r
|
|
2754
2759
|
};
|
|
2755
|
-
},
|
|
2756
|
-
if (Number.isFinite(n.real) && Number.isFinite(n.im) && Math.abs(t) >=
|
|
2760
|
+
}, kr = (t, n) => {
|
|
2761
|
+
if (Number.isFinite(n.real) && Number.isFinite(n.im) && Math.abs(t) >= hr) throw c.BuiltIn.Num;
|
|
2757
2762
|
return n;
|
|
2758
|
-
},
|
|
2763
|
+
}, $r = (t) => {
|
|
2759
2764
|
if (!Number.isFinite(t.real) || !Number.isFinite(t.im)) throw c.BuiltIn.Num;
|
|
2760
2765
|
return t;
|
|
2761
|
-
},
|
|
2766
|
+
}, jr = (t) => {
|
|
2762
2767
|
if (c.isError(t)) throw t;
|
|
2763
2768
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2764
2769
|
return null === t ? 0 : l.parseAsNumber(t);
|
|
2765
2770
|
};
|
|
2766
|
-
function jr(t) {
|
|
2767
|
-
const { real: n, im: e, unit: r } = Mo(t), o = kr(Ur(n, xr(n, e)));
|
|
2768
|
-
return Ar(o.real, o.im, r);
|
|
2769
|
-
}
|
|
2770
2771
|
function Xr(t) {
|
|
2771
|
-
const { real: n, im: e, unit: r } =
|
|
2772
|
-
return
|
|
2772
|
+
const { real: n, im: e, unit: r } = wo(t), o = $r(kr(n, Tr(n, e)));
|
|
2773
|
+
return Er(o.real, o.im, r);
|
|
2773
2774
|
}
|
|
2774
2775
|
function qr(t) {
|
|
2775
|
-
const { real: n, im: e, unit: r } =
|
|
2776
|
-
return
|
|
2776
|
+
const { real: n, im: e, unit: r } = wo(t), o = $r(kr(e, Vr(n, e)));
|
|
2777
|
+
return Er(o.real, o.im, r);
|
|
2777
2778
|
}
|
|
2778
2779
|
function Gr(t) {
|
|
2779
|
-
const { real: n, im: e, unit: r } =
|
|
2780
|
-
return
|
|
2780
|
+
const { real: n, im: e, unit: r } = wo(t), o = Ur(n, e);
|
|
2781
|
+
return Er(o.real, o.im, r);
|
|
2781
2782
|
}
|
|
2782
2783
|
function Hr(t) {
|
|
2783
|
-
const { real: n, im: e, unit: r } =
|
|
2784
|
-
return
|
|
2784
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Vr(n, e), Fr(n, e));
|
|
2785
|
+
return Er(o.real, o.im, r);
|
|
2785
2786
|
}
|
|
2786
2787
|
function Yr(t) {
|
|
2787
|
-
const { real: n, im: e, unit: r } =
|
|
2788
|
-
return
|
|
2788
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Or, kr(n, Dr(n, e)));
|
|
2789
|
+
return Er(o.real, o.im, r);
|
|
2790
|
+
}
|
|
2791
|
+
function zr(t) {
|
|
2792
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Or, kr(e, Fr(n, e)));
|
|
2793
|
+
return Er(o.real, o.im, r);
|
|
2789
2794
|
}
|
|
2790
|
-
function
|
|
2791
|
-
const e = Mo(
|
|
2795
|
+
function Kr(t, n) {
|
|
2796
|
+
const e = wo(Mo(t)), r = e.real, o = e.im, u = e.unit, i = wo(Mo(n)), s = i.real, l = i.im, a = i.unit;
|
|
2792
2797
|
if (0 === s && 0 === l || u !== a) throw c.BuiltIn.Num;
|
|
2793
|
-
const f = u, h = Math.pow(s, 2) + Math.pow(l, 2), m =
|
|
2798
|
+
const f = u, h = Math.pow(s, 2) + Math.pow(l, 2), m = $r({
|
|
2794
2799
|
real: (r * s + o * l) / h,
|
|
2795
2800
|
im: (o * s - r * l) / h
|
|
2796
2801
|
});
|
|
2797
|
-
return
|
|
2802
|
+
return Er(m.real, m.im, f);
|
|
2798
2803
|
}
|
|
2799
|
-
function
|
|
2800
|
-
const { real: n, im: e, unit: r } =
|
|
2804
|
+
function Wr(t) {
|
|
2805
|
+
const { real: n, im: e, unit: r } = wo(t);
|
|
2801
2806
|
let o = Math.exp(n);
|
|
2802
2807
|
if (!Number.isFinite(o)) {
|
|
2803
2808
|
if (0 === e) throw c.BuiltIn.Num;
|
|
2804
2809
|
o = Number.MAX_VALUE;
|
|
2805
2810
|
}
|
|
2806
|
-
const u = kr(
|
|
2807
|
-
real: o *
|
|
2808
|
-
im: o *
|
|
2811
|
+
const u = $r(kr(e, {
|
|
2812
|
+
real: o * dr(e),
|
|
2813
|
+
im: o * Mr(e)
|
|
2809
2814
|
}));
|
|
2810
|
-
return
|
|
2811
|
-
}
|
|
2812
|
-
function Wr(t) {
|
|
2813
|
-
const { real: n, im: e, unit: r } = Mo(t);
|
|
2814
|
-
return Ar(yr(n, e), Cr(n, e), r);
|
|
2815
|
+
return Er(u.real, u.im, r);
|
|
2815
2816
|
}
|
|
2816
|
-
function Qr(t
|
|
2817
|
-
const e =
|
|
2818
|
-
return
|
|
2817
|
+
function Qr(t) {
|
|
2818
|
+
const { real: n, im: e, unit: r } = wo(t);
|
|
2819
|
+
return Er(Rr(n, e), yr(n, e), r);
|
|
2819
2820
|
}
|
|
2820
|
-
function Zr(t) {
|
|
2821
|
-
const
|
|
2822
|
-
return
|
|
2821
|
+
function Zr(t, n = 10) {
|
|
2822
|
+
const e = Qr(t);
|
|
2823
|
+
return c.isError(e) ? e : n <= 0 || 1 === n ? NaN : Kr(e, Math.log(n));
|
|
2823
2824
|
}
|
|
2824
2825
|
function Jr(t) {
|
|
2825
|
-
const { real: n, im: e, unit: r } =
|
|
2826
|
-
return
|
|
2826
|
+
const { real: n, im: e, unit: r } = wo(t);
|
|
2827
|
+
return Er(Rr(n, e) / Math.LN10, yr(n, e) / Math.LN10, r);
|
|
2828
|
+
}
|
|
2829
|
+
function to(t) {
|
|
2830
|
+
const { real: n, im: e, unit: r } = wo(t);
|
|
2831
|
+
return Er(Rr(n, e) / Math.LN2, yr(n, e) / Math.LN2, r);
|
|
2827
2832
|
}
|
|
2828
|
-
function
|
|
2829
|
-
const { real: e, im: r, unit: o } = Mo(
|
|
2833
|
+
function no(t, n) {
|
|
2834
|
+
const { real: e, im: r, unit: o } = wo(Mo(t)), u = l.parseAsNumber(Mo(n) ?? 0), i = Math.sqrt(e * e + r * r);
|
|
2830
2835
|
if (0 === e && 0 === r) {
|
|
2831
|
-
if (u > 0) return
|
|
2836
|
+
if (u > 0) return Er(0, 0, o);
|
|
2832
2837
|
throw c.BuiltIn.Num;
|
|
2833
2838
|
}
|
|
2834
2839
|
const s = u * Math.log(i);
|
|
2835
2840
|
if (!Number.isFinite(s)) throw c.BuiltIn.Num;
|
|
2836
2841
|
const a = Math.pow(i, u);
|
|
2837
2842
|
if (!Number.isFinite(a)) throw c.BuiltIn.Num;
|
|
2838
|
-
const f = u *
|
|
2839
|
-
real: a *
|
|
2840
|
-
im: a *
|
|
2843
|
+
const f = u * yr(e, r), h = kr(f, {
|
|
2844
|
+
real: a * dr(f),
|
|
2845
|
+
im: a * Mr(f)
|
|
2841
2846
|
});
|
|
2842
|
-
return
|
|
2847
|
+
return Er(h.real, h.im, o);
|
|
2843
2848
|
}
|
|
2844
|
-
function
|
|
2849
|
+
function eo(t) {
|
|
2845
2850
|
const n = t.length;
|
|
2846
|
-
if (0 === n) return
|
|
2847
|
-
const e =
|
|
2848
|
-
let r =
|
|
2851
|
+
if (0 === n) return Er(0, 0, "i");
|
|
2852
|
+
const e = wo(t[0]);
|
|
2853
|
+
let r = Er(e.real, e.im, e.unit);
|
|
2849
2854
|
for (let e = 1; e < n; e++) {
|
|
2850
|
-
const n = t[e], o =
|
|
2855
|
+
const n = t[e], o = wo(r), u = wo(n), i = o.unit;
|
|
2851
2856
|
if (i !== u.unit) throw c.BuiltIn.Value;
|
|
2852
2857
|
const s = o.real, l = o.im, a = u.real, f = u.im, h = {
|
|
2853
2858
|
real: s * a - l * f,
|
|
2854
2859
|
im: s * f + l * a
|
|
2855
2860
|
};
|
|
2856
2861
|
if (!Number.isFinite(h.real) || !Number.isFinite(h.im)) throw c.BuiltIn.Value;
|
|
2857
|
-
r =
|
|
2862
|
+
r = Er(h.real, h.im, i);
|
|
2858
2863
|
}
|
|
2859
2864
|
return r;
|
|
2860
2865
|
}
|
|
2861
|
-
function eo(t) {
|
|
2862
|
-
return Mo(t).real;
|
|
2863
|
-
}
|
|
2864
2866
|
function ro(t) {
|
|
2865
|
-
|
|
2866
|
-
return Ar(o.real, o.im, r);
|
|
2867
|
+
return wo(t).real;
|
|
2867
2868
|
}
|
|
2868
2869
|
function oo(t) {
|
|
2869
|
-
const { real: n, im: e, unit: r } =
|
|
2870
|
-
return
|
|
2870
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Or, kr(n, Tr(n, e)));
|
|
2871
|
+
return Er(o.real, o.im, r);
|
|
2871
2872
|
}
|
|
2872
2873
|
function uo(t) {
|
|
2873
|
-
const { real: n, im: e, unit: r } =
|
|
2874
|
-
return
|
|
2874
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Or, kr(e, Vr(n, e)));
|
|
2875
|
+
return Er(o.real, o.im, r);
|
|
2875
2876
|
}
|
|
2876
2877
|
function io(t) {
|
|
2877
|
-
const { real: n, im: e, unit: r } =
|
|
2878
|
-
return
|
|
2878
|
+
const { real: n, im: e, unit: r } = wo(t), o = $r(kr(n, Dr(n, e)));
|
|
2879
|
+
return Er(o.real, o.im, r);
|
|
2879
2880
|
}
|
|
2880
2881
|
function so(t) {
|
|
2881
|
-
const { real: n, im: e, unit: r } =
|
|
2882
|
+
const { real: n, im: e, unit: r } = wo(t), o = $r(kr(e, Fr(n, e)));
|
|
2883
|
+
return Er(o.real, o.im, r);
|
|
2884
|
+
}
|
|
2885
|
+
function lo(t) {
|
|
2886
|
+
const { real: n, im: e, unit: r } = wo(t), o = Math.sqrt(Math.sqrt(n * n + e * e));
|
|
2882
2887
|
if (!Number.isFinite(o)) throw c.BuiltIn.Num;
|
|
2883
|
-
const u =
|
|
2884
|
-
return
|
|
2888
|
+
const u = yr(n, e) / 2;
|
|
2889
|
+
return Er(o * dr(u), o * Mr(u), r);
|
|
2885
2890
|
}
|
|
2886
|
-
function
|
|
2887
|
-
const e = Mo(
|
|
2891
|
+
function ao(t, n) {
|
|
2892
|
+
const e = wo(Mo(t)), r = e.real, o = e.im, u = e.unit, i = wo(Mo(n)), s = i.real, l = i.im;
|
|
2888
2893
|
if (u !== i.unit) throw c.BuiltIn.Num;
|
|
2889
|
-
return
|
|
2894
|
+
return Er(r - s, o - l, u);
|
|
2890
2895
|
}
|
|
2891
|
-
function
|
|
2896
|
+
function fo(t) {
|
|
2892
2897
|
let n, e = 0, r = 0;
|
|
2893
2898
|
const o = t.length;
|
|
2894
2899
|
for (let u = 0; u < o; u++) {
|
|
2895
|
-
const o = t[u], { real: i, im: s, unit: l } =
|
|
2900
|
+
const o = t[u], { real: i, im: s, unit: l } = wo(o);
|
|
2896
2901
|
if (n || (n = l), n !== l) throw c.BuiltIn.Value;
|
|
2897
2902
|
e += i, r += s;
|
|
2898
2903
|
}
|
|
2899
|
-
return
|
|
2900
|
-
}
|
|
2901
|
-
function fo(t) {
|
|
2902
|
-
const { real: n, im: e, unit: r } = Mo(t), o = Lr(n, e);
|
|
2903
|
-
return Ar(o.real, o.im, r);
|
|
2904
|
+
return Er(e, r, n);
|
|
2904
2905
|
}
|
|
2905
2906
|
function co(t) {
|
|
2906
|
-
const { real: n, im: e, unit: r } =
|
|
2907
|
-
return
|
|
2907
|
+
const { real: n, im: e, unit: r } = wo(t), o = _r(n, e);
|
|
2908
|
+
return Er(o.real, o.im, r);
|
|
2909
|
+
}
|
|
2910
|
+
function ho(t) {
|
|
2911
|
+
const { real: n, im: e, unit: r } = wo(t), o = Pr(Fr(n, e), Vr(n, e));
|
|
2912
|
+
return Er(o.real, o.im, r);
|
|
2908
2913
|
}
|
|
2909
|
-
var
|
|
2914
|
+
var mo = String.raw`[+-]?\s*[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?`, go = new RegExp(String.raw`^\s*([+-]?\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), No = new RegExp(String.raw`^\s*(${mo})\s*([+-]\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), Io = /^\s*[+-]?\s*$/, po = (t) => Io.test(t) ? Number(`${t.replace(/\s+/g, "")}1`) : Number(t.replace(/\s+/g, "")), Mo = (t) => {
|
|
2910
2915
|
if (c.isError(t)) throw t;
|
|
2911
2916
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
2912
2917
|
return t;
|
|
2913
2918
|
};
|
|
2914
|
-
function
|
|
2919
|
+
function wo(t) {
|
|
2915
2920
|
let n = 0, e = 0, r = "i";
|
|
2916
2921
|
if ("number" == typeof t) return {
|
|
2917
2922
|
real: t,
|
|
@@ -2932,23 +2937,23 @@ function Mo(t) {
|
|
|
2932
2937
|
unit: r
|
|
2933
2938
|
};
|
|
2934
2939
|
} catch (t) {}
|
|
2935
|
-
let o = t.match(
|
|
2936
|
-
if (o) return e =
|
|
2940
|
+
let o = t.match(go);
|
|
2941
|
+
if (o) return e = po(o[1]), r = o[2], {
|
|
2937
2942
|
real: n,
|
|
2938
2943
|
im: e,
|
|
2939
2944
|
unit: r
|
|
2940
2945
|
};
|
|
2941
|
-
if (o = t.match(
|
|
2946
|
+
if (o = t.match(No), o) return n = po(o[1]), e = po(o[2]), r = o[3], {
|
|
2942
2947
|
real: n,
|
|
2943
2948
|
im: e,
|
|
2944
2949
|
unit: r
|
|
2945
2950
|
};
|
|
2946
2951
|
throw c.BuiltIn.Num;
|
|
2947
2952
|
}
|
|
2948
|
-
var
|
|
2949
|
-
FXHISTORY: () =>
|
|
2950
|
-
STOCKHISTORY: () =>
|
|
2951
|
-
}),
|
|
2953
|
+
var Ao = At({
|
|
2954
|
+
FXHISTORY: () => Uo,
|
|
2955
|
+
STOCKHISTORY: () => Po
|
|
2956
|
+
}), Eo = 864e5, Bo = (t) => Math.round(Date.parse(`${t}T00:00:00Z`) / Eo) + 25569, bo = (t) => (/* @__PURE__ */ new Date((Math.floor(t) - 25569) * Eo)).toISOString().slice(0, 10), Co = [
|
|
2952
2957
|
"Date",
|
|
2953
2958
|
"Close",
|
|
2954
2959
|
"Open",
|
|
@@ -2956,12 +2961,12 @@ var wo = At({
|
|
|
2956
2961
|
"Low",
|
|
2957
2962
|
"Volume"
|
|
2958
2963
|
];
|
|
2959
|
-
function
|
|
2960
|
-
const e = t.properties.split(",").map((t) =>
|
|
2964
|
+
function yo(t, n) {
|
|
2965
|
+
const e = t.properties.split(",").map((t) => Co[Number(t)]), r = [];
|
|
2961
2966
|
2 === t.headers && r.push(e.map((n, e) => 0 === e ? t.instrument : null)), t.headers >= 1 && r.push([...e]);
|
|
2962
2967
|
const o = Array.from(n.keys()).sort();
|
|
2963
2968
|
for (const u of o) {
|
|
2964
|
-
const o =
|
|
2969
|
+
const o = Bo(u);
|
|
2965
2970
|
if (o < t.start || o > t.end) continue;
|
|
2966
2971
|
const i = n.get(u);
|
|
2967
2972
|
r.push(e.map((t) => "Date" === t ? o : i[t] ?? null));
|
|
@@ -2969,17 +2974,17 @@ function Co(t, n) {
|
|
|
2969
2974
|
if (0 === r.length) throw c.BuiltIn.NA;
|
|
2970
2975
|
return r;
|
|
2971
2976
|
}
|
|
2972
|
-
function
|
|
2977
|
+
function Ro(t) {
|
|
2973
2978
|
const n = [];
|
|
2974
2979
|
for (const e of t ?? []) {
|
|
2975
2980
|
if (null == e) continue;
|
|
2976
2981
|
const t = Number(e);
|
|
2977
|
-
if (!Number.isInteger(t) || t < 0 || t >=
|
|
2982
|
+
if (!Number.isInteger(t) || t < 0 || t >= Co.length) throw c.BuiltIn.Value;
|
|
2978
2983
|
n.push(t);
|
|
2979
2984
|
}
|
|
2980
2985
|
return n.length > 0 ? n.join(",") : "0,1";
|
|
2981
2986
|
}
|
|
2982
|
-
function
|
|
2987
|
+
function vo(t, n) {
|
|
2983
2988
|
const e = Math.floor(t), r = void 0 === n ? e : Math.floor(n);
|
|
2984
2989
|
if (e < 1 || r < e) throw c.BuiltIn.Value;
|
|
2985
2990
|
return {
|
|
@@ -2987,7 +2992,7 @@ function Ro(t, n) {
|
|
|
2987
2992
|
end: r
|
|
2988
2993
|
};
|
|
2989
2994
|
}
|
|
2990
|
-
function
|
|
2995
|
+
function So(t, n, e) {
|
|
2991
2996
|
const r = /* @__PURE__ */ new Map();
|
|
2992
2997
|
for (const n of t) {
|
|
2993
2998
|
const t = n.payload.url, e = r.get(t);
|
|
@@ -2999,7 +3004,7 @@ function vo(t, n, e) {
|
|
|
2999
3004
|
for (const t of o) t.onCancel(() => {
|
|
3000
3005
|
0 === --u && r.abort();
|
|
3001
3006
|
});
|
|
3002
|
-
|
|
3007
|
+
xo(n, t, r.signal).then((t) => {
|
|
3003
3008
|
let n;
|
|
3004
3009
|
try {
|
|
3005
3010
|
n = e(t);
|
|
@@ -3008,7 +3013,7 @@ function vo(t, n, e) {
|
|
|
3008
3013
|
return;
|
|
3009
3014
|
}
|
|
3010
3015
|
for (const t of o) try {
|
|
3011
|
-
t.resolve(
|
|
3016
|
+
t.resolve(yo(t.payload, n));
|
|
3012
3017
|
} catch (n) {
|
|
3013
3018
|
t.reject(n);
|
|
3014
3019
|
}
|
|
@@ -3017,7 +3022,7 @@ function vo(t, n, e) {
|
|
|
3017
3022
|
});
|
|
3018
3023
|
}
|
|
3019
3024
|
}
|
|
3020
|
-
async function
|
|
3025
|
+
async function xo(t, n, e) {
|
|
3021
3026
|
const r = await t.fetch(n, {
|
|
3022
3027
|
signal: e,
|
|
3023
3028
|
headers: { Accept: "application/json" }
|
|
@@ -3026,7 +3031,7 @@ async function So(t, n, e) {
|
|
|
3026
3031
|
if (!r.ok) throw new c.Value(`HTTP ${r.status}`);
|
|
3027
3032
|
return r.json();
|
|
3028
3033
|
}
|
|
3029
|
-
var
|
|
3034
|
+
var To = "https://www.alphavantage.co/query", Do = [
|
|
3030
3035
|
{
|
|
3031
3036
|
fn: "TIME_SERIES_DAILY",
|
|
3032
3037
|
key: "Time Series (Daily)"
|
|
@@ -3039,32 +3044,32 @@ var xo = "https://www.alphavantage.co/query", To = [
|
|
|
3039
3044
|
fn: "TIME_SERIES_MONTHLY",
|
|
3040
3045
|
key: "Monthly Time Series"
|
|
3041
3046
|
}
|
|
3042
|
-
],
|
|
3047
|
+
], Vo = {
|
|
3043
3048
|
Open: "1. open",
|
|
3044
3049
|
High: "2. high",
|
|
3045
3050
|
Low: "3. low",
|
|
3046
3051
|
Close: "4. close",
|
|
3047
3052
|
Volume: "5. volume"
|
|
3048
3053
|
};
|
|
3049
|
-
function
|
|
3054
|
+
function Fo() {
|
|
3050
3055
|
const t = globalThis.ALPHAVANTAGE_API_KEY;
|
|
3051
3056
|
if ("string" == typeof t && t) return t;
|
|
3052
3057
|
const n = globalThis.process?.env?.ALPHAVANTAGE_API_KEY;
|
|
3053
3058
|
return "string" == typeof n && n ? n : "demo";
|
|
3054
3059
|
}
|
|
3055
|
-
function
|
|
3056
|
-
|
|
3060
|
+
function Oo(t, n) {
|
|
3061
|
+
So(t, n, (t) => {
|
|
3057
3062
|
if (!t || "object" != typeof t) throw c.BuiltIn.Value;
|
|
3058
3063
|
if (t["Error Message"]) throw c.BuiltIn.NA;
|
|
3059
3064
|
const n = t.Information ?? t.Note;
|
|
3060
3065
|
if (n) throw new c.Value(String(n));
|
|
3061
|
-
const e =
|
|
3066
|
+
const e = Do.map((n) => t[n.key]).find((t) => t && "object" == typeof t);
|
|
3062
3067
|
if (!e) throw c.BuiltIn.NA;
|
|
3063
3068
|
const r = /* @__PURE__ */ new Map();
|
|
3064
3069
|
for (const t of Object.keys(e)) {
|
|
3065
3070
|
const n = e[t], o = {};
|
|
3066
|
-
for (const t of Object.keys(
|
|
3067
|
-
const e = n[
|
|
3071
|
+
for (const t of Object.keys(Vo)) {
|
|
3072
|
+
const e = n[Vo[t]];
|
|
3068
3073
|
o[t] = void 0 === e ? null : Number(e);
|
|
3069
3074
|
}
|
|
3070
3075
|
r.set(t, o);
|
|
@@ -3072,24 +3077,24 @@ function Fo(t, n) {
|
|
|
3072
3077
|
return r;
|
|
3073
3078
|
});
|
|
3074
3079
|
}
|
|
3075
|
-
function
|
|
3076
|
-
const { start: i, end: s } =
|
|
3080
|
+
function Po(t, n, e, r = 0, o = 1, u) {
|
|
3081
|
+
const { start: i, end: s } = vo(n, e), a = t.trim().toUpperCase();
|
|
3077
3082
|
if (!a) throw c.BuiltIn.Value;
|
|
3078
|
-
const f =
|
|
3083
|
+
const f = Do[Math.trunc(r)];
|
|
3079
3084
|
if (!f) throw c.BuiltIn.Value;
|
|
3080
3085
|
const h = {
|
|
3081
|
-
url: `${
|
|
3086
|
+
url: `${To}?function=${f.fn}&symbol=${encodeURIComponent(a)}&outputsize=full&apikey=${encodeURIComponent(Fo())}`,
|
|
3082
3087
|
headers: Math.trunc(o),
|
|
3083
|
-
properties:
|
|
3088
|
+
properties: Ro(u),
|
|
3084
3089
|
start: i,
|
|
3085
3090
|
end: s,
|
|
3086
3091
|
instrument: a
|
|
3087
3092
|
};
|
|
3088
|
-
return l.defer(
|
|
3093
|
+
return l.defer(Oo, h), [[c.BuiltIn.Busy]];
|
|
3089
3094
|
}
|
|
3090
|
-
var
|
|
3091
|
-
function
|
|
3092
|
-
|
|
3095
|
+
var Lo = "https://api.frankfurter.dev/v1";
|
|
3096
|
+
function _o(t, n) {
|
|
3097
|
+
So(t, n, (t) => {
|
|
3093
3098
|
const n = t?.rates;
|
|
3094
3099
|
if (!n || "object" != typeof n) throw c.BuiltIn.NA;
|
|
3095
3100
|
const e = /* @__PURE__ */ new Map();
|
|
@@ -3100,49 +3105,49 @@ function Lo(t, n) {
|
|
|
3100
3105
|
return e;
|
|
3101
3106
|
});
|
|
3102
3107
|
}
|
|
3103
|
-
function
|
|
3104
|
-
const { start: u, end: i } =
|
|
3108
|
+
function Uo(t, n, e, r, o = 1) {
|
|
3109
|
+
const { start: u, end: i } = vo(e, r), s = t.trim().toUpperCase(), a = n.trim().toUpperCase();
|
|
3105
3110
|
if (!/^[A-Z]{3}$/.test(s) || !/^[A-Z]{3}$/.test(a)) throw c.BuiltIn.Value;
|
|
3106
3111
|
const f = {
|
|
3107
|
-
url: `${
|
|
3112
|
+
url: `${Lo}/${bo(u)}..${bo(i)}?from=${s}&to=${a}`,
|
|
3108
3113
|
headers: Math.trunc(o),
|
|
3109
3114
|
properties: "0,1",
|
|
3110
3115
|
start: u,
|
|
3111
3116
|
end: i,
|
|
3112
3117
|
instrument: `${s}/${a}`
|
|
3113
3118
|
};
|
|
3114
|
-
return l.defer(
|
|
3119
|
+
return l.defer(_o, f), [[c.BuiltIn.Busy]];
|
|
3115
3120
|
}
|
|
3116
|
-
var
|
|
3121
|
+
var ko = (t, n, e = 0) => {
|
|
3117
3122
|
const r = (t) => c.isError(t) ? t : n(t);
|
|
3118
3123
|
return l.getArgs().getKindAt(e) === u.Reference ? r(t.getValueAt(0, 0)) : l.createRange(t.getRowCount(), t.getColumnCount(), (n, e) => r(t.getValueAt(e.rowIndex, e.colIndex)));
|
|
3119
|
-
},
|
|
3120
|
-
CELL: () =>
|
|
3121
|
-
ERROR_TYPE: () =>
|
|
3122
|
-
INFO: () =>
|
|
3123
|
-
ISBLANK: () =>
|
|
3124
|
-
ISDATE: () =>
|
|
3125
|
-
ISEMAIL: () =>
|
|
3126
|
-
ISERR: () =>
|
|
3127
|
-
ISERROR: () =>
|
|
3128
|
-
ISEVEN: () =>
|
|
3129
|
-
ISFORMULA: () =>
|
|
3130
|
-
ISLOGICAL: () =>
|
|
3131
|
-
ISNA: () =>
|
|
3132
|
-
ISNONTEXT: () =>
|
|
3133
|
-
ISNUMBER: () =>
|
|
3134
|
-
ISODD: () =>
|
|
3135
|
-
ISOMITTED: () =>
|
|
3136
|
-
ISREF: () =>
|
|
3137
|
-
ISTEXT: () =>
|
|
3138
|
-
ISURL: () =>
|
|
3139
|
-
N: () =>
|
|
3140
|
-
NA: () =>
|
|
3141
|
-
SHEET: () =>
|
|
3142
|
-
SHEETS: () =>
|
|
3143
|
-
TYPE: () =>
|
|
3124
|
+
}, $o = At({
|
|
3125
|
+
CELL: () => jo,
|
|
3126
|
+
ERROR_TYPE: () => Xo,
|
|
3127
|
+
INFO: () => qo,
|
|
3128
|
+
ISBLANK: () => Go,
|
|
3129
|
+
ISDATE: () => Ho,
|
|
3130
|
+
ISEMAIL: () => Yo,
|
|
3131
|
+
ISERR: () => zo,
|
|
3132
|
+
ISERROR: () => Ko,
|
|
3133
|
+
ISEVEN: () => Wo,
|
|
3134
|
+
ISFORMULA: () => Qo,
|
|
3135
|
+
ISLOGICAL: () => Zo,
|
|
3136
|
+
ISNA: () => Jo,
|
|
3137
|
+
ISNONTEXT: () => tu,
|
|
3138
|
+
ISNUMBER: () => eu,
|
|
3139
|
+
ISODD: () => ru,
|
|
3140
|
+
ISOMITTED: () => uu,
|
|
3141
|
+
ISREF: () => su,
|
|
3142
|
+
ISTEXT: () => lu,
|
|
3143
|
+
ISURL: () => iu,
|
|
3144
|
+
N: () => au,
|
|
3145
|
+
NA: () => cu,
|
|
3146
|
+
SHEET: () => mu,
|
|
3147
|
+
SHEETS: () => gu,
|
|
3148
|
+
TYPE: () => Iu
|
|
3144
3149
|
});
|
|
3145
|
-
function
|
|
3150
|
+
function jo(t, n) {
|
|
3146
3151
|
let e = null;
|
|
3147
3152
|
switch (n || (n = l.getReference()), t) {
|
|
3148
3153
|
case "address":
|
|
@@ -3172,10 +3177,10 @@ function $o(t, n) {
|
|
|
3172
3177
|
}
|
|
3173
3178
|
return e;
|
|
3174
3179
|
}
|
|
3175
|
-
function
|
|
3180
|
+
function Xo(t) {
|
|
3176
3181
|
return c.isError(t) ? t.getCode() : c.BuiltIn.NA;
|
|
3177
3182
|
}
|
|
3178
|
-
function
|
|
3183
|
+
function qo(t) {
|
|
3179
3184
|
if ("directory" === t) {
|
|
3180
3185
|
try {
|
|
3181
3186
|
return l.getRuntime().getLocation();
|
|
@@ -3192,10 +3197,10 @@ function Xo(t) {
|
|
|
3192
3197
|
if ("user" === t) return l.getRuntime().getUser() || (l.formatResults("@[Red]"), "Unidentified");
|
|
3193
3198
|
throw c.BuiltIn.Value;
|
|
3194
3199
|
}
|
|
3195
|
-
function
|
|
3200
|
+
function Go(t) {
|
|
3196
3201
|
return null === t;
|
|
3197
3202
|
}
|
|
3198
|
-
function
|
|
3203
|
+
function Ho(t) {
|
|
3199
3204
|
if ("string" != typeof t) return !1;
|
|
3200
3205
|
try {
|
|
3201
3206
|
return l.parseAsSerialDate(t), !0;
|
|
@@ -3203,50 +3208,50 @@ function Go(t) {
|
|
|
3203
3208
|
return !1;
|
|
3204
3209
|
}
|
|
3205
3210
|
}
|
|
3206
|
-
function Ho(t) {
|
|
3207
|
-
return "string" == typeof t && (t.length > 7 && "mailto:" === t.substring(0, 7).toLowerCase() ? !/\s/.test(t) : /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(t));
|
|
3208
|
-
}
|
|
3209
3211
|
function Yo(t) {
|
|
3210
|
-
return
|
|
3212
|
+
return "string" == typeof t && (t.length > 7 && "mailto:" === t.substring(0, 7).toLowerCase() ? !/\s/.test(t) : /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(t));
|
|
3211
3213
|
}
|
|
3212
3214
|
function zo(t) {
|
|
3213
|
-
return c.isError(t);
|
|
3215
|
+
return c.isError(t) && !(t instanceof c.NA);
|
|
3214
3216
|
}
|
|
3215
3217
|
function Ko(t) {
|
|
3216
|
-
return
|
|
3218
|
+
return c.isError(t);
|
|
3217
3219
|
}
|
|
3218
3220
|
function Wo(t) {
|
|
3219
|
-
|
|
3220
|
-
return l.createRange(t.getRowCount(), t.getColumnCount(), (t, r) => null !== l.getFormulaAt(n.rowStart + r.rowIndex, n.colStart + r.colIndex, e));
|
|
3221
|
+
return ou(t);
|
|
3221
3222
|
}
|
|
3222
3223
|
function Qo(t) {
|
|
3223
|
-
|
|
3224
|
+
const n = (t = hu(t)).getCoords(), e = n.scope ?? void 0;
|
|
3225
|
+
return l.createRange(t.getRowCount(), t.getColumnCount(), (t, r) => null !== l.getFormulaAt(n.rowStart + r.rowIndex, n.colStart + r.colIndex, e));
|
|
3224
3226
|
}
|
|
3225
3227
|
function Zo(t) {
|
|
3226
|
-
return
|
|
3228
|
+
return "boolean" == typeof t;
|
|
3227
3229
|
}
|
|
3228
3230
|
function Jo(t) {
|
|
3229
|
-
return
|
|
3231
|
+
return t instanceof c.NA;
|
|
3230
3232
|
}
|
|
3231
3233
|
function tu(t) {
|
|
3232
|
-
return
|
|
3234
|
+
return !nu(t);
|
|
3233
3235
|
}
|
|
3234
3236
|
function nu(t) {
|
|
3235
|
-
return "
|
|
3237
|
+
return "string" == typeof t || !0 === t?.isIRichData && "string" == typeof t.toPrimitive?.();
|
|
3236
3238
|
}
|
|
3237
3239
|
function eu(t) {
|
|
3238
|
-
|
|
3239
|
-
return c.isError(n) ? n : !n;
|
|
3240
|
+
return "number" == typeof t;
|
|
3240
3241
|
}
|
|
3241
3242
|
function ru(t) {
|
|
3243
|
+
const n = ou(t);
|
|
3244
|
+
return c.isError(n) ? n : !n;
|
|
3245
|
+
}
|
|
3246
|
+
function ou(t) {
|
|
3242
3247
|
if ("boolean" == typeof t) return c.BuiltIn.Value;
|
|
3243
3248
|
const n = null == t ? 0 : l.parseAsNumber(t);
|
|
3244
3249
|
return Math.trunc(yt(n)) % 2 == 0;
|
|
3245
3250
|
}
|
|
3246
|
-
function
|
|
3251
|
+
function uu(t) {
|
|
3247
3252
|
return l.getArgs().getKindAt(0) === u.Omitted;
|
|
3248
3253
|
}
|
|
3249
|
-
function
|
|
3254
|
+
function iu(t) {
|
|
3250
3255
|
if ("string" != typeof t) return !1;
|
|
3251
3256
|
try {
|
|
3252
3257
|
const n = new URL(t);
|
|
@@ -3254,28 +3259,28 @@ function uu(t) {
|
|
|
3254
3259
|
} catch {
|
|
3255
3260
|
return !1;
|
|
3256
3261
|
}
|
|
3257
|
-
return
|
|
3262
|
+
return pu.test(t);
|
|
3258
3263
|
}
|
|
3259
|
-
function
|
|
3264
|
+
function su(t) {
|
|
3260
3265
|
if (!t || 0 === t.length) return !1;
|
|
3261
3266
|
for (let n = 0; n < t.length; n++) if (!t[n]?.isIReferenceRange) return !1;
|
|
3262
3267
|
return !0;
|
|
3263
3268
|
}
|
|
3264
|
-
function su(t) {
|
|
3265
|
-
return tu(t);
|
|
3266
|
-
}
|
|
3267
3269
|
function lu(t) {
|
|
3270
|
+
return nu(t);
|
|
3271
|
+
}
|
|
3272
|
+
function au(t) {
|
|
3268
3273
|
if (l.getArgs().getKindAt(0) === u.Lambda) return c.BuiltIn.Value;
|
|
3269
3274
|
const n = !0 === t?.isIRange ? t : null;
|
|
3270
|
-
return n ?
|
|
3275
|
+
return n ? ko(n, fu) : fu(t);
|
|
3271
3276
|
}
|
|
3272
|
-
var
|
|
3273
|
-
function
|
|
3277
|
+
var fu = (t) => "number" == typeof t ? t : "boolean" == typeof t ? Number(t) : 0;
|
|
3278
|
+
function cu() {
|
|
3274
3279
|
return c.BuiltIn.NA;
|
|
3275
3280
|
}
|
|
3276
|
-
var
|
|
3277
|
-
function
|
|
3278
|
-
if (void 0 === (t = void 0 === t ? void 0 :
|
|
3281
|
+
var hu = (t) => Array.isArray(t) ? t[0] : t;
|
|
3282
|
+
function mu(t) {
|
|
3283
|
+
if (void 0 === (t = void 0 === t ? void 0 : hu(t))) {
|
|
3279
3284
|
const t = l.getSheetIndex();
|
|
3280
3285
|
return t >= 0 ? t + 1 : c.BuiltIn.NA;
|
|
3281
3286
|
}
|
|
@@ -3288,15 +3293,15 @@ function hu(t) {
|
|
|
3288
3293
|
const e = l.getSheetIndex(n);
|
|
3289
3294
|
return e >= 0 ? e + 1 : c.BuiltIn.NA;
|
|
3290
3295
|
}
|
|
3291
|
-
function
|
|
3296
|
+
function gu(t) {
|
|
3292
3297
|
if (void 0 === t) return l.getSheetCount();
|
|
3293
3298
|
if (Array.isArray(t) && t.isSheetSpan) {
|
|
3294
3299
|
const n = t[0];
|
|
3295
3300
|
return l.getSheetIndex(n) >= 0 ? t.length : c.BuiltIn.NA;
|
|
3296
3301
|
}
|
|
3297
|
-
return (t =
|
|
3302
|
+
return (t = hu(t)).isIReferenceRange ? 1 : c.BuiltIn.NA;
|
|
3298
3303
|
}
|
|
3299
|
-
var
|
|
3304
|
+
var Nu = {
|
|
3300
3305
|
[u.Number]: 1,
|
|
3301
3306
|
[u.Null]: 1,
|
|
3302
3307
|
[u.String]: 2,
|
|
@@ -3306,11 +3311,11 @@ var gu = {
|
|
|
3306
3311
|
[u.RichData]: 128,
|
|
3307
3312
|
[u.Lambda]: 128
|
|
3308
3313
|
};
|
|
3309
|
-
function
|
|
3310
|
-
if (c.isError(t)) return
|
|
3314
|
+
function Iu(t) {
|
|
3315
|
+
if (c.isError(t)) return Nu[u.Error];
|
|
3311
3316
|
let n = l.getArgs().getKindAt(0);
|
|
3312
3317
|
if (n === u.Reference) {
|
|
3313
|
-
if (t.getColumnCount() > 1 || t.getRowCount() > 1) return
|
|
3318
|
+
if (t.getColumnCount() > 1 || t.getRowCount() > 1) return Nu[u.Array];
|
|
3314
3319
|
n = function(t) {
|
|
3315
3320
|
if (null === t) return u.Null;
|
|
3316
3321
|
if (c.isError(t)) return u.Error;
|
|
@@ -3329,23 +3334,23 @@ function Nu(t) {
|
|
|
3329
3334
|
return u.Number;
|
|
3330
3335
|
}(t.getValueAt(0, 0));
|
|
3331
3336
|
}
|
|
3332
|
-
return
|
|
3337
|
+
return Nu[n] ?? 1;
|
|
3333
3338
|
}
|
|
3334
|
-
var
|
|
3335
|
-
DATESTRING: () =>
|
|
3336
|
-
NUMBERSTRING: () =>
|
|
3339
|
+
var pu = /* @__PURE__ */ new RegExp("^([a-zA-Z]+:\\/\\/)?((([a-z\\d]([a-z\\d-]*[a-z\\d])*)\\.)+[a-z]{2,}|((\\d{1,3}\\.){3}\\d{1,3}))(\\:\\d+)?(\\/[-a-z\\d%_.~+]*)*(\\?[;&a-z\\d%_.~+=-]*)?(\\#[-a-z\\d_]*)?$", "i"), Mu = At({
|
|
3340
|
+
DATESTRING: () => du,
|
|
3341
|
+
NUMBERSTRING: () => wu
|
|
3337
3342
|
});
|
|
3338
|
-
function
|
|
3343
|
+
function du(t) {
|
|
3339
3344
|
return c.BuiltIn.NA;
|
|
3340
3345
|
}
|
|
3341
|
-
function
|
|
3346
|
+
function wu(t, n) {
|
|
3342
3347
|
return c.BuiltIn.NA;
|
|
3343
3348
|
}
|
|
3344
|
-
var
|
|
3345
|
-
function
|
|
3349
|
+
var Au = At({ PHONETIC: () => Eu });
|
|
3350
|
+
function Eu(t) {
|
|
3346
3351
|
return c.BuiltIn.NA;
|
|
3347
3352
|
}
|
|
3348
|
-
function
|
|
3353
|
+
function Bu(t, n, e, r, o) {
|
|
3349
3354
|
let u = null;
|
|
3350
3355
|
e && (u = l.getResizedReference(e.getCoords(), t.getRowCount(), t.getColumnCount()));
|
|
3351
3356
|
const i = l.createCriteria(n), s = i(null);
|
|
@@ -3373,35 +3378,35 @@ function Eu(t, n, e, r, o) {
|
|
|
3373
3378
|
return r;
|
|
3374
3379
|
}(r, t, n)) } : void 0);
|
|
3375
3380
|
}
|
|
3376
|
-
var
|
|
3377
|
-
AND: () =>
|
|
3378
|
-
BYCOL: () =>
|
|
3379
|
-
BYROW: () =>
|
|
3380
|
-
FALSE: () =>
|
|
3381
|
-
FLATTEN: () =>
|
|
3382
|
-
IF: () =>
|
|
3383
|
-
IFERROR: () =>
|
|
3384
|
-
IFNA: () =>
|
|
3385
|
-
IFS: () =>
|
|
3386
|
-
LAMBDA: () =>
|
|
3387
|
-
LET: () =>
|
|
3388
|
-
MAKEARRAY: () =>
|
|
3389
|
-
MAP: () =>
|
|
3390
|
-
NOT: () =>
|
|
3391
|
-
OR: () =>
|
|
3392
|
-
REDUCE: () =>
|
|
3393
|
-
REDUCEIF: () =>
|
|
3394
|
-
SCAN: () =>
|
|
3395
|
-
SWITCH: () =>
|
|
3396
|
-
TRUE: () =>
|
|
3397
|
-
XOR: () =>
|
|
3398
|
-
}),
|
|
3399
|
-
function
|
|
3381
|
+
var bu = (t, n) => (t ?? 0) + n, Cu = (t, n) => t, yu = At({
|
|
3382
|
+
AND: () => vu,
|
|
3383
|
+
BYCOL: () => Su,
|
|
3384
|
+
BYROW: () => xu,
|
|
3385
|
+
FALSE: () => Tu,
|
|
3386
|
+
FLATTEN: () => Du,
|
|
3387
|
+
IF: () => Vu,
|
|
3388
|
+
IFERROR: () => Fu,
|
|
3389
|
+
IFNA: () => Ou,
|
|
3390
|
+
IFS: () => Pu,
|
|
3391
|
+
LAMBDA: () => Lu,
|
|
3392
|
+
LET: () => _u,
|
|
3393
|
+
MAKEARRAY: () => Uu,
|
|
3394
|
+
MAP: () => ku,
|
|
3395
|
+
NOT: () => $u,
|
|
3396
|
+
OR: () => ju,
|
|
3397
|
+
REDUCE: () => Xu,
|
|
3398
|
+
REDUCEIF: () => qu,
|
|
3399
|
+
SCAN: () => Gu,
|
|
3400
|
+
SWITCH: () => Hu,
|
|
3401
|
+
TRUE: () => Yu,
|
|
3402
|
+
XOR: () => zu
|
|
3403
|
+
}), Ru = (t) => "number" == typeof t ? Et(t) : t;
|
|
3404
|
+
function vu(t) {
|
|
3400
3405
|
let n = !1, e = !1;
|
|
3401
3406
|
for (const r of t) for (const t of r.values()) n = !0, t || (e = !0);
|
|
3402
3407
|
return n ? !e : c.BuiltIn.Value;
|
|
3403
3408
|
}
|
|
3404
|
-
function
|
|
3409
|
+
function Su(t, n) {
|
|
3405
3410
|
if (!n) return c.BuiltIn.Calc;
|
|
3406
3411
|
const e = t.getColumnCount(), r = new Array(e);
|
|
3407
3412
|
for (let o = 0; o < e; o++) r[o] = n(t.slice({
|
|
@@ -3410,7 +3415,7 @@ function vu(t, n) {
|
|
|
3410
3415
|
}));
|
|
3411
3416
|
return l.createRange(1, e, [r]);
|
|
3412
3417
|
}
|
|
3413
|
-
function
|
|
3418
|
+
function xu(t, n) {
|
|
3414
3419
|
if (!n) return c.BuiltIn.Calc;
|
|
3415
3420
|
const e = t.getRowCount(), r = new Array(e);
|
|
3416
3421
|
for (let o = 0; o < e; o++) r[o] = [n(t.slice({
|
|
@@ -3419,33 +3424,33 @@ function Su(t, n) {
|
|
|
3419
3424
|
}))];
|
|
3420
3425
|
return l.createRange(e, 1, r);
|
|
3421
3426
|
}
|
|
3422
|
-
function
|
|
3427
|
+
function Tu() {
|
|
3423
3428
|
return !1;
|
|
3424
3429
|
}
|
|
3425
|
-
function
|
|
3430
|
+
function Du(t) {
|
|
3426
3431
|
return t.map((t) => t.flatten()).reduce((t, n) => t.concat(n));
|
|
3427
3432
|
}
|
|
3428
|
-
function
|
|
3433
|
+
function Vu(t, n, e) {
|
|
3429
3434
|
return t ? n : e;
|
|
3430
3435
|
}
|
|
3431
|
-
function
|
|
3436
|
+
function Fu(t, n) {
|
|
3432
3437
|
return c.isError(t) ? n : t;
|
|
3433
3438
|
}
|
|
3434
|
-
function
|
|
3439
|
+
function Ou(t, n) {
|
|
3435
3440
|
return c.BuiltIn.NA.equals(t) ? n : t;
|
|
3436
3441
|
}
|
|
3437
|
-
function
|
|
3442
|
+
function Pu(t) {
|
|
3438
3443
|
for (const [n, e] of t) {
|
|
3439
3444
|
if (c.isError(n)) return n;
|
|
3440
3445
|
if (n) return e;
|
|
3441
3446
|
}
|
|
3442
3447
|
return c.BuiltIn.NA;
|
|
3443
3448
|
}
|
|
3444
|
-
function
|
|
3449
|
+
function Lu(t) {
|
|
3445
3450
|
return c.BuiltIn.Calc;
|
|
3446
3451
|
}
|
|
3447
|
-
function
|
|
3448
|
-
function
|
|
3452
|
+
function _u(t, n, e, ...r) {}
|
|
3453
|
+
function Uu(t, n, e) {
|
|
3449
3454
|
if (t !== Math.trunc(t) || n !== Math.trunc(n) || t < 1 || n < 1) return c.BuiltIn.Value;
|
|
3450
3455
|
const r = l.getEntireCoords();
|
|
3451
3456
|
if (t > r.rowEnd + 1 || n > r.colEnd + 1) return c.BuiltIn.Value;
|
|
@@ -3457,7 +3462,7 @@ function _u(t, n, e) {
|
|
|
3457
3462
|
}
|
|
3458
3463
|
return l.createRange(t, n, o);
|
|
3459
3464
|
}
|
|
3460
|
-
function
|
|
3465
|
+
function ku(t, n) {
|
|
3461
3466
|
const e = n.length, r = e > 0 ? n[e - 1] : null;
|
|
3462
3467
|
if ("function" != typeof r) return c.BuiltIn.Value;
|
|
3463
3468
|
const o = [t];
|
|
@@ -3490,15 +3495,15 @@ function Uu(t, n) {
|
|
|
3490
3495
|
}
|
|
3491
3496
|
return l.createRange(i, a, g);
|
|
3492
3497
|
}
|
|
3493
|
-
function
|
|
3498
|
+
function $u(t) {
|
|
3494
3499
|
return !t;
|
|
3495
3500
|
}
|
|
3496
|
-
function
|
|
3501
|
+
function ju(t) {
|
|
3497
3502
|
let n = !1, e = !1;
|
|
3498
3503
|
for (const r of t) for (const t of r.values()) n = !0, t && (e = !0);
|
|
3499
3504
|
return n ? e : c.BuiltIn.Value;
|
|
3500
3505
|
}
|
|
3501
|
-
function
|
|
3506
|
+
function Xu(t, n, e) {
|
|
3502
3507
|
if (Array.isArray(t)) return c.BuiltIn.Value;
|
|
3503
3508
|
let r = t, o = void 0 !== t;
|
|
3504
3509
|
const u = !0 === n.isIReferenceRange, i = n.entries({
|
|
@@ -3520,10 +3525,10 @@ function ju(t, n, e) {
|
|
|
3520
3525
|
}
|
|
3521
3526
|
return r;
|
|
3522
3527
|
}
|
|
3523
|
-
function
|
|
3524
|
-
return
|
|
3528
|
+
function qu(t, n, e, r) {
|
|
3529
|
+
return Bu(t, n, e, r, null);
|
|
3525
3530
|
}
|
|
3526
|
-
function
|
|
3531
|
+
function Gu(t, n, e) {
|
|
3527
3532
|
const r = n.getRowCount(), o = n.getColumnCount();
|
|
3528
3533
|
if (Array.isArray(t)) return l.createRange(r, o, () => c.BuiltIn.Value);
|
|
3529
3534
|
const u = !0 === n.isIReferenceRange;
|
|
@@ -3544,70 +3549,70 @@ function qu(t, n, e) {
|
|
|
3544
3549
|
}
|
|
3545
3550
|
return l.createRange(r, o, a);
|
|
3546
3551
|
}
|
|
3547
|
-
function
|
|
3548
|
-
const r =
|
|
3552
|
+
function Hu(t, n, e) {
|
|
3553
|
+
const r = Ru(t ?? 0);
|
|
3549
3554
|
for (const [t, e] of n) {
|
|
3550
3555
|
if (c.isError(t)) return t;
|
|
3551
|
-
if (0 === l.compare(r,
|
|
3556
|
+
if (0 === l.compare(r, Ru(t ?? 0))) return e ?? 0;
|
|
3552
3557
|
}
|
|
3553
3558
|
return void 0 !== e ? e : c.BuiltIn.NA;
|
|
3554
3559
|
}
|
|
3555
|
-
function
|
|
3560
|
+
function Yu() {
|
|
3556
3561
|
return !0;
|
|
3557
3562
|
}
|
|
3558
|
-
function
|
|
3563
|
+
function zu(t) {
|
|
3559
3564
|
let n = !1, e = 0;
|
|
3560
3565
|
for (const r of t) for (const t of r.values()) n = !0, t && e++;
|
|
3561
3566
|
return n ? e % 2 == 1 : c.BuiltIn.Value;
|
|
3562
3567
|
}
|
|
3563
|
-
var
|
|
3568
|
+
var Ku = Object.freeze({ includeEmpty: !0 }), Wu = Object.freeze({ axis: f.Axis.Column }), Qu = Object.freeze({ axis: f.Axis.Row }), Zu = (Object.freeze({
|
|
3564
3569
|
type: i.Number,
|
|
3565
3570
|
axis: f.Axis.Column
|
|
3566
3571
|
}), At({
|
|
3567
|
-
ADDRESS: () =>
|
|
3568
|
-
AREAS: () =>
|
|
3569
|
-
ARRAYFORMULA: () =>
|
|
3570
|
-
ARRAY_CONSTRAIN: () =>
|
|
3571
|
-
CHOOSE: () =>
|
|
3572
|
-
CHOOSECOLS: () =>
|
|
3573
|
-
CHOOSEROWS: () =>
|
|
3574
|
-
COLUMN: () =>
|
|
3575
|
-
COLUMNS: () =>
|
|
3576
|
-
DROP: () =>
|
|
3577
|
-
EXPAND: () =>
|
|
3578
|
-
FIELDVALUE: () =>
|
|
3579
|
-
FILTER: () =>
|
|
3580
|
-
FORMULATEXT: () =>
|
|
3581
|
-
GETPIVOTDATA: () =>
|
|
3582
|
-
HLOOKUP: () =>
|
|
3583
|
-
HSTACK: () =>
|
|
3584
|
-
HYPERLINK: () =>
|
|
3585
|
-
IMAGE: () =>
|
|
3586
|
-
INDEX: () =>
|
|
3587
|
-
INDIRECT: () =>
|
|
3588
|
-
LOOKUP: () =>
|
|
3589
|
-
MATCH: () =>
|
|
3590
|
-
OFFSET: () =>
|
|
3591
|
-
ROW: () =>
|
|
3592
|
-
ROWS: () =>
|
|
3593
|
-
RTD: () =>
|
|
3594
|
-
SORT: () =>
|
|
3595
|
-
SORTBY: () =>
|
|
3596
|
-
TAKE: () =>
|
|
3597
|
-
TOCOL: () =>
|
|
3598
|
-
TOROW: () =>
|
|
3599
|
-
TRANSPOSE: () =>
|
|
3600
|
-
TRIMRANGE: () =>
|
|
3601
|
-
UNIQUE: () =>
|
|
3602
|
-
VLOOKUP: () =>
|
|
3603
|
-
VSTACK: () =>
|
|
3604
|
-
WRAPCOLS: () =>
|
|
3605
|
-
WRAPROWS: () =>
|
|
3606
|
-
XLOOKUP: () =>
|
|
3607
|
-
XMATCH: () =>
|
|
3572
|
+
ADDRESS: () => Ju,
|
|
3573
|
+
AREAS: () => ti,
|
|
3574
|
+
ARRAYFORMULA: () => ei,
|
|
3575
|
+
ARRAY_CONSTRAIN: () => ni,
|
|
3576
|
+
CHOOSE: () => ri,
|
|
3577
|
+
CHOOSECOLS: () => oi,
|
|
3578
|
+
CHOOSEROWS: () => ui,
|
|
3579
|
+
COLUMN: () => ii,
|
|
3580
|
+
COLUMNS: () => si,
|
|
3581
|
+
DROP: () => li,
|
|
3582
|
+
EXPAND: () => fi,
|
|
3583
|
+
FIELDVALUE: () => ci,
|
|
3584
|
+
FILTER: () => gi,
|
|
3585
|
+
FORMULATEXT: () => Ii,
|
|
3586
|
+
GETPIVOTDATA: () => pi,
|
|
3587
|
+
HLOOKUP: () => wi,
|
|
3588
|
+
HSTACK: () => Ei,
|
|
3589
|
+
HYPERLINK: () => Bi,
|
|
3590
|
+
IMAGE: () => Ci,
|
|
3591
|
+
INDEX: () => yi,
|
|
3592
|
+
INDIRECT: () => Ri,
|
|
3593
|
+
LOOKUP: () => vi,
|
|
3594
|
+
MATCH: () => Si,
|
|
3595
|
+
OFFSET: () => xi,
|
|
3596
|
+
ROW: () => Ti,
|
|
3597
|
+
ROWS: () => Di,
|
|
3598
|
+
RTD: () => Vi,
|
|
3599
|
+
SORT: () => Fi,
|
|
3600
|
+
SORTBY: () => _i,
|
|
3601
|
+
TAKE: () => Ui,
|
|
3602
|
+
TOCOL: () => $i,
|
|
3603
|
+
TOROW: () => ji,
|
|
3604
|
+
TRANSPOSE: () => Xi,
|
|
3605
|
+
TRIMRANGE: () => qi,
|
|
3606
|
+
UNIQUE: () => Hi,
|
|
3607
|
+
VLOOKUP: () => Yi,
|
|
3608
|
+
VSTACK: () => zi,
|
|
3609
|
+
WRAPCOLS: () => Wi,
|
|
3610
|
+
WRAPROWS: () => Qi,
|
|
3611
|
+
XLOOKUP: () => Zi,
|
|
3612
|
+
XMATCH: () => Ji
|
|
3608
3613
|
}));
|
|
3609
|
-
function
|
|
3610
|
-
const u =
|
|
3614
|
+
function Ju(t, n, e = 1, r = !0, o = void 0) {
|
|
3615
|
+
const u = rs(t), i = rs(n), s = rs(e), a = l.getEntireCoords();
|
|
3611
3616
|
if (s < 1 || s > 4) throw c.BuiltIn.Value;
|
|
3612
3617
|
const f = !r && (2 === s || 4 === s);
|
|
3613
3618
|
if (r || 3 !== s && 4 !== s ? u < 1 || u > a.rowEnd + 1 : Math.abs(u) > a.rowEnd) throw c.BuiltIn.Value;
|
|
@@ -3621,10 +3626,10 @@ function Zu(t, n, e = 1, r = !0, o = void 0) {
|
|
|
3621
3626
|
}, m = l.getAddress(h, !r);
|
|
3622
3627
|
return "" === o ? "!" + m : m;
|
|
3623
3628
|
}
|
|
3624
|
-
function
|
|
3629
|
+
function ti(t) {
|
|
3625
3630
|
return t.length;
|
|
3626
3631
|
}
|
|
3627
|
-
function
|
|
3632
|
+
function ni(t, n, e) {
|
|
3628
3633
|
return n < 0 || e < 0 ? c.BuiltIn.Num : (n = Math.trunc(n), e = Math.trunc(e), n < 1 || e < 1 ? c.BuiltIn.Ref : t.slice({
|
|
3629
3634
|
rowStart: 0,
|
|
3630
3635
|
colStart: 0,
|
|
@@ -3632,17 +3637,17 @@ function ti(t, n, e) {
|
|
|
3632
3637
|
colEnd: Math.min(e, t.getColumnCount()) - 1
|
|
3633
3638
|
}));
|
|
3634
3639
|
}
|
|
3635
|
-
function
|
|
3640
|
+
function ei(t) {
|
|
3636
3641
|
return t;
|
|
3637
3642
|
}
|
|
3638
|
-
function
|
|
3643
|
+
function ri(t, n) {
|
|
3639
3644
|
const e = n.length;
|
|
3640
3645
|
if (e < 1 || e > 254) throw c.BuiltIn.Value;
|
|
3641
3646
|
const r = Math.trunc(t);
|
|
3642
3647
|
if (r < 1 || r > e) throw c.BuiltIn.Value;
|
|
3643
3648
|
return n[r - 1];
|
|
3644
3649
|
}
|
|
3645
|
-
function
|
|
3650
|
+
function oi(t, n) {
|
|
3646
3651
|
if (t.length > 1) return c.BuiltIn.Ref;
|
|
3647
3652
|
const e = t[0], r = e.getColumnCount(), o = n.map((t) => {
|
|
3648
3653
|
const n = Math.trunc(t);
|
|
@@ -3653,7 +3658,7 @@ function ri(t, n) {
|
|
|
3653
3658
|
});
|
|
3654
3659
|
return e.take(o, f.Axis.Column);
|
|
3655
3660
|
}
|
|
3656
|
-
function
|
|
3661
|
+
function ui(t, n) {
|
|
3657
3662
|
if (t.length > 1) return c.BuiltIn.Ref;
|
|
3658
3663
|
const e = t[0], r = e.getRowCount(), o = n.map((t) => {
|
|
3659
3664
|
const n = Math.trunc(t);
|
|
@@ -3664,17 +3669,17 @@ function oi(t, n) {
|
|
|
3664
3669
|
});
|
|
3665
3670
|
return e.take(o, f.Axis.Row);
|
|
3666
3671
|
}
|
|
3667
|
-
function
|
|
3672
|
+
function ii(t) {
|
|
3668
3673
|
if (!t || 0 === t.length) return l.getColumn() + 1;
|
|
3669
3674
|
if (t.length > 1) return c.BuiltIn.Ref;
|
|
3670
3675
|
const n = [], e = t[0].getCoords(), r = e.colStart, o = e.colEnd;
|
|
3671
3676
|
for (let t = r; t <= o; t++) n.push(t + 1);
|
|
3672
3677
|
return n;
|
|
3673
3678
|
}
|
|
3674
|
-
function
|
|
3679
|
+
function si(t) {
|
|
3675
3680
|
return t.length > 1 ? c.BuiltIn.Ref : t[0].getColumnCount();
|
|
3676
3681
|
}
|
|
3677
|
-
function
|
|
3682
|
+
function li(t, n, e) {
|
|
3678
3683
|
const r = t.getRowCount(), o = t.getColumnCount();
|
|
3679
3684
|
if (e = Math.trunc(e ?? 0), n = Math.trunc(n), Math.abs(n) >= r || Math.abs(e) >= o) return c.BuiltIn.Calc;
|
|
3680
3685
|
const u = n >= 0 ? n : 0, i = n >= 0 ? r - 1 : r + n - 1, s = e >= 0 ? e : 0, l = e >= 0 ? o - 1 : o + e - 1;
|
|
@@ -3685,17 +3690,17 @@ function si(t, n, e) {
|
|
|
3685
3690
|
colEnd: l
|
|
3686
3691
|
});
|
|
3687
3692
|
}
|
|
3688
|
-
var
|
|
3689
|
-
function
|
|
3690
|
-
const o =
|
|
3693
|
+
var ai = (t) => !0 === t?.isIRange ? t : l.createRange(1, 1, t);
|
|
3694
|
+
function fi(t, n, e, r = c.BuiltIn.NA) {
|
|
3695
|
+
const o = ai(t), u = o.getRowCount(), i = o.getColumnCount(), s = void 0 === n ? u : Math.trunc(n), a = void 0 === e ? i : Math.trunc(e);
|
|
3691
3696
|
if (s > 2147483647 || a > 2147483647) return c.BuiltIn.Value;
|
|
3692
3697
|
if (s < u || a < i) return c.BuiltIn.Value;
|
|
3693
3698
|
const f = l.getEntireCoords(), h = f.rowEnd - f.rowStart + 1;
|
|
3694
3699
|
return s > h || a > h ? c.BuiltIn.Num : o.resize(s, a, r);
|
|
3695
3700
|
}
|
|
3696
|
-
function
|
|
3701
|
+
function ci(t, n) {
|
|
3697
3702
|
if (!0 !== t?.isIRichData || c.isError(t)) return c.BuiltIn.Field;
|
|
3698
|
-
const e =
|
|
3703
|
+
const e = hi(t.getKind(), n);
|
|
3699
3704
|
if (!e) return c.BuiltIn.Field;
|
|
3700
3705
|
if ((t.getPropertyMeta ? t.getPropertyMeta(e.name) : e.meta)?.excludeFrom?.dotNotation) return c.BuiltIn.Field;
|
|
3701
3706
|
const r = t.getProperty(e.name), o = !0 === r?.isIRichData ? r.toArray?.() : null;
|
|
@@ -3703,19 +3708,19 @@ function fi(t, n) {
|
|
|
3703
3708
|
const u = o.length, i = u > 0 ? o[0].length : 0;
|
|
3704
3709
|
return 0 === u || 0 === i ? c.BuiltIn.Field : 1 === u && 1 === i ? o[0][0] : l.createRange(u, i, o);
|
|
3705
3710
|
}
|
|
3706
|
-
var
|
|
3711
|
+
var hi = (t, n) => {
|
|
3707
3712
|
const e = t.getProperty(n);
|
|
3708
3713
|
if (e) return e;
|
|
3709
3714
|
const r = n.toUpperCase(), o = t.getProperties();
|
|
3710
3715
|
for (let t = 0; t < o.length; t++) if (o[t].name.toUpperCase() === r) return o[t];
|
|
3711
3716
|
return null;
|
|
3712
|
-
},
|
|
3713
|
-
function
|
|
3717
|
+
}, mi = Object.freeze({ type: null });
|
|
3718
|
+
function gi(t, n, e) {
|
|
3714
3719
|
if (t.length > 1 || n.length > 1) return c.BuiltIn.Ref;
|
|
3715
3720
|
const r = t[0], o = n[0];
|
|
3716
|
-
return
|
|
3721
|
+
return Ni(r, o, e);
|
|
3717
3722
|
}
|
|
3718
|
-
var
|
|
3723
|
+
var Ni = (t, n, e) => {
|
|
3719
3724
|
const r = t.getRowCount(), o = t.getColumnCount(), u = n.getRowCount(), i = n.getColumnCount(), s = 1 === i, l = 1 === u;
|
|
3720
3725
|
if (s && u !== r) throw c.BuiltIn.Value;
|
|
3721
3726
|
if (l && i !== o) throw c.BuiltIn.Value;
|
|
@@ -3724,7 +3729,7 @@ var gi = (t, n, e) => {
|
|
|
3724
3729
|
const m = t.filter((t, e) => {
|
|
3725
3730
|
const r = s ? e.rowIndex : e.colIndex;
|
|
3726
3731
|
if (r !== a) {
|
|
3727
|
-
const t = s ? n.getValueAt(r, 0,
|
|
3732
|
+
const t = s ? n.getValueAt(r, 0, mi) : n.getValueAt(0, r, mi);
|
|
3728
3733
|
if (c.isError(t)) throw t;
|
|
3729
3734
|
let e = t;
|
|
3730
3735
|
if ("string" == typeof e) {
|
|
@@ -3746,7 +3751,7 @@ var gi = (t, n, e) => {
|
|
|
3746
3751
|
}
|
|
3747
3752
|
return m;
|
|
3748
3753
|
};
|
|
3749
|
-
function
|
|
3754
|
+
function Ii(t) {
|
|
3750
3755
|
if (t.length > 1) {
|
|
3751
3756
|
const n = t[0];
|
|
3752
3757
|
return l.createRange(n.getRowCount(), n.getColumnCount(), () => c.BuiltIn.NA);
|
|
@@ -3757,21 +3762,21 @@ function Ni(t) {
|
|
|
3757
3762
|
return null === o ? c.BuiltIn.NA : "=" + o;
|
|
3758
3763
|
});
|
|
3759
3764
|
}
|
|
3760
|
-
function
|
|
3765
|
+
function pi(t, n, e) {
|
|
3761
3766
|
const r = 1 === n.length ? n[0] : null, o = r ? l.getPivotAt(r) : null;
|
|
3762
3767
|
if (!o) return c.BuiltIn.Ref;
|
|
3763
3768
|
if (!1 === o.isComputed?.()) {
|
|
3764
3769
|
const t = l.getValueAt(l.getRow(), l.getColumn());
|
|
3765
3770
|
return null != t ? t : c.BuiltIn.Ref;
|
|
3766
3771
|
}
|
|
3767
|
-
const u =
|
|
3772
|
+
const u = Mi(o, String(t ?? ""));
|
|
3768
3773
|
if (-1 === u) return c.BuiltIn.Ref;
|
|
3769
3774
|
const i = /* @__PURE__ */ new Map(), s = o.getFields();
|
|
3770
3775
|
for (const [t, n] of e ?? []) {
|
|
3771
3776
|
if (void 0 === n) return c.BuiltIn.Ref;
|
|
3772
3777
|
const e = String(t ?? "").toLowerCase(), r = s.findIndex((t) => t.name.toLowerCase() === e);
|
|
3773
3778
|
if (-1 === r) return c.BuiltIn.Ref;
|
|
3774
|
-
const o =
|
|
3779
|
+
const o = di(s[r].items, n);
|
|
3775
3780
|
if (-1 === o) return c.BuiltIn.Ref;
|
|
3776
3781
|
const u = i.get(r);
|
|
3777
3782
|
if (void 0 !== u && u !== o) return c.BuiltIn.Ref;
|
|
@@ -3779,24 +3784,24 @@ function Ii(t, n, e) {
|
|
|
3779
3784
|
}
|
|
3780
3785
|
return o.getValue(u, i) ?? c.BuiltIn.Ref;
|
|
3781
3786
|
}
|
|
3782
|
-
var
|
|
3787
|
+
var Mi = (t, n) => {
|
|
3783
3788
|
const e = n.toLowerCase(), r = t.getDataFields(), o = r.findIndex((t) => t.name.toLowerCase() === e);
|
|
3784
3789
|
return -1 !== o ? o : r.findIndex((t) => t.sourceName.toLowerCase() === e);
|
|
3785
|
-
},
|
|
3790
|
+
}, di = (t, n) => {
|
|
3786
3791
|
if ("string" == typeof n) {
|
|
3787
3792
|
const e = n.toLowerCase();
|
|
3788
3793
|
return t.findIndex((t) => (t.name ?? t.text).toLowerCase() === e);
|
|
3789
3794
|
}
|
|
3790
3795
|
return "number" == typeof n || "boolean" == typeof n ? t.findIndex((t) => t.value === n) : -1;
|
|
3791
3796
|
};
|
|
3792
|
-
function
|
|
3797
|
+
function wi(t, n, e, r = !0) {
|
|
3793
3798
|
if (c.isError(t)) return t;
|
|
3794
3799
|
if (n.length > 1) return c.BuiltIn.NA;
|
|
3795
3800
|
const o = n[0];
|
|
3796
|
-
if (
|
|
3797
|
-
const u =
|
|
3801
|
+
if (es()) return c.BuiltIn.NA;
|
|
3802
|
+
const u = rs(e);
|
|
3798
3803
|
if (u < 1) return c.BuiltIn.Value;
|
|
3799
|
-
const i = u > o.getRowCount(), s = (t) => i ? c.BuiltIn.Ref : o.getValueAt(u - 1, t) ?? null, l = typeof t, a =
|
|
3804
|
+
const i = u > o.getRowCount(), s = (t) => i ? c.BuiltIn.Ref : o.getValueAt(u - 1, t) ?? null, l = typeof t, a = os(t);
|
|
3800
3805
|
if (r) {
|
|
3801
3806
|
let n = null, e = -1, r = !0, u = !1;
|
|
3802
3807
|
const i = o.entries({
|
|
@@ -3812,18 +3817,18 @@ function di(t, n, e, r = !0) {
|
|
|
3812
3817
|
a = i.next();
|
|
3813
3818
|
continue;
|
|
3814
3819
|
}
|
|
3815
|
-
const m =
|
|
3820
|
+
const m = ns(o, t);
|
|
3816
3821
|
if (r) {
|
|
3817
3822
|
n = o, e = h, r = !1, m > 0 && (u = !0), a = i.next();
|
|
3818
3823
|
continue;
|
|
3819
3824
|
}
|
|
3820
|
-
const g =
|
|
3825
|
+
const g = ns(n, t);
|
|
3821
3826
|
if (m > 0 && (u = !0), g > 0 && m > 0) return c.BuiltIn.NA;
|
|
3822
3827
|
if (u && 0 === g && m < 0) return s(e);
|
|
3823
3828
|
if (null != n && m > 0 && g <= 0) return s(e);
|
|
3824
3829
|
n = o, e = h, a = i.next();
|
|
3825
3830
|
}
|
|
3826
|
-
return r ||
|
|
3831
|
+
return r || ns(n, t) > 0 ? c.BuiltIn.NA : s(e);
|
|
3827
3832
|
}
|
|
3828
3833
|
if (!a) {
|
|
3829
3834
|
const n = o.slice({
|
|
@@ -3845,7 +3850,7 @@ function di(t, n, e, r = !0) {
|
|
|
3845
3850
|
}
|
|
3846
3851
|
return c.BuiltIn.NA;
|
|
3847
3852
|
}
|
|
3848
|
-
var
|
|
3853
|
+
var Ai = (t, n) => {
|
|
3849
3854
|
const e = l.getEntireCoords(), r = e.rowEnd - e.rowStart + 1, o = n === f.Axis.Column;
|
|
3850
3855
|
let u = 0;
|
|
3851
3856
|
const i = t.length;
|
|
@@ -3855,10 +3860,10 @@ var wi = (t, n) => {
|
|
|
3855
3860
|
}
|
|
3856
3861
|
return u > r ? c.BuiltIn.Num : t.reduce((t, e) => t.concat(e, n));
|
|
3857
3862
|
};
|
|
3858
|
-
function
|
|
3859
|
-
return
|
|
3863
|
+
function Ei(t) {
|
|
3864
|
+
return Ai(t, f.Axis.Column);
|
|
3860
3865
|
}
|
|
3861
|
-
function
|
|
3866
|
+
function Bi(t, n) {
|
|
3862
3867
|
const e = l.getArgs();
|
|
3863
3868
|
let r = n;
|
|
3864
3869
|
return e.getLength() < 2 ? r = void 0 : null != r && e.getKindAt(1) !== u.Omitted || (r = 0), l.createRichData("hyperlink", {
|
|
@@ -3866,7 +3871,7 @@ function Ei(t, n) {
|
|
|
3866
3871
|
friendly: r
|
|
3867
3872
|
});
|
|
3868
3873
|
}
|
|
3869
|
-
function
|
|
3874
|
+
function bi(t, n) {
|
|
3870
3875
|
const e = /* @__PURE__ */ new Map();
|
|
3871
3876
|
for (const n of t) {
|
|
3872
3877
|
const t = n.payload.source, r = e.get(t);
|
|
@@ -3902,7 +3907,7 @@ function Bi(t, n) {
|
|
|
3902
3907
|
for (const t of r) t.reject(n);
|
|
3903
3908
|
});
|
|
3904
3909
|
}
|
|
3905
|
-
function
|
|
3910
|
+
function Ci(t, n = void 0, e = 0, r = void 0, o = void 0) {
|
|
3906
3911
|
if (!t) return c.BuiltIn.Value;
|
|
3907
3912
|
const u = Math.trunc(e);
|
|
3908
3913
|
if (u < 0 || u > 3) return c.BuiltIn.Value;
|
|
@@ -3912,12 +3917,12 @@ function bi(t, n = void 0, e = 0, r = void 0, o = void 0) {
|
|
|
3912
3917
|
if (void 0 !== r && r < 1 || void 0 !== o && o < 1) return c.BuiltIn.Value;
|
|
3913
3918
|
void 0 !== r && (i.height = r), void 0 !== o && (i.width = o);
|
|
3914
3919
|
} else if (void 0 !== r || void 0 !== o) return c.BuiltIn.Value;
|
|
3915
|
-
return l.defer(
|
|
3920
|
+
return l.defer(bi, i) ?? c.BuiltIn.Busy;
|
|
3916
3921
|
}
|
|
3917
|
-
function
|
|
3922
|
+
function yi(t, n, e = void 0, r = 1) {
|
|
3918
3923
|
if (n ??= 0, n < 0 || void 0 !== e && e < 0 || r < 1) return c.BuiltIn.Value;
|
|
3919
3924
|
let o = bt(n), u = void 0 === e ? 0 : bt(e);
|
|
3920
|
-
const i =
|
|
3925
|
+
const i = rs(r);
|
|
3921
3926
|
if (i > t.length) return c.BuiltIn.Ref;
|
|
3922
3927
|
const s = t[i - 1];
|
|
3923
3928
|
if (0 === s.size && !s.isIReferenceRange) return o <= 1 && u <= 1 ? 0 : c.BuiltIn.Ref;
|
|
@@ -3945,10 +3950,10 @@ function Ci(t, n, e = void 0, r = 1) {
|
|
|
3945
3950
|
colEnd: N
|
|
3946
3951
|
});
|
|
3947
3952
|
}
|
|
3948
|
-
function
|
|
3953
|
+
function Ri(t, n = !0) {
|
|
3949
3954
|
return l.getReference(t, !n);
|
|
3950
3955
|
}
|
|
3951
|
-
function
|
|
3956
|
+
function vi(t, n, e) {
|
|
3952
3957
|
if (c.isError(t)) return t;
|
|
3953
3958
|
if (n.length > 1) return c.BuiltIn.NA;
|
|
3954
3959
|
const r = n[0];
|
|
@@ -3956,15 +3961,15 @@ function Ri(t, n, e) {
|
|
|
3956
3961
|
const o = r.getRowCount(), u = r.getColumnCount(), i = o > 1 && u > 1;
|
|
3957
3962
|
if (i && !e) {
|
|
3958
3963
|
if (u > o) {
|
|
3959
|
-
const n =
|
|
3964
|
+
const n = cs(t, r, !0);
|
|
3960
3965
|
return -1 === n ? c.BuiltIn.NA : r.getValueAt(o - 1, n) ?? null;
|
|
3961
3966
|
}
|
|
3962
3967
|
{
|
|
3963
|
-
const n =
|
|
3968
|
+
const n = cs(t, r, !1);
|
|
3964
3969
|
return -1 === n ? c.BuiltIn.NA : r.getValueAt(n, u - 1) ?? null;
|
|
3965
3970
|
}
|
|
3966
3971
|
}
|
|
3967
|
-
const s = i ? u > o : 1 === o, a =
|
|
3972
|
+
const s = i ? u > o : 1 === o, a = cs(t, r, s);
|
|
3968
3973
|
return -1 === a ? c.BuiltIn.NA : e ? function(t, n, e) {
|
|
3969
3974
|
const r = t.getRowCount(), o = t.getColumnCount();
|
|
3970
3975
|
if (r > 1 && o > 1) return c.BuiltIn.NA;
|
|
@@ -3976,14 +3981,14 @@ function Ri(t, n, e) {
|
|
|
3976
3981
|
return n >= (u ? r : o) ? c.BuiltIn.NA : (u ? t.getValueAt(n, 0) : t.getValueAt(0, n)) ?? 0;
|
|
3977
3982
|
}(e, a, s ? u : o) : (s ? r.getValueAt(0, a) : r.getValueAt(a, 0)) ?? 0;
|
|
3978
3983
|
}
|
|
3979
|
-
function
|
|
3980
|
-
if (n.length > 1 ||
|
|
3984
|
+
function Si(t, n, e = 1) {
|
|
3985
|
+
if (n.length > 1 || es()) return c.BuiltIn.NA;
|
|
3981
3986
|
const r = 0 === e ? 0 : e > 0 ? -1 : 1, o = 0 === e ? 1 : e > 0 ? 2 : -2;
|
|
3982
|
-
return
|
|
3987
|
+
return ts(t, n[0], r, o, 0 === e, !0);
|
|
3983
3988
|
}
|
|
3984
|
-
function
|
|
3989
|
+
function xi(t, n, e, r, o) {
|
|
3985
3990
|
n = Math.trunc(n), e = Math.trunc(e);
|
|
3986
|
-
const u = t.getCoords(), [i, s] =
|
|
3991
|
+
const u = t.getCoords(), [i, s] = hs(u.rowStart + n, r ?? t.getRowCount()), [a, f] = hs(u.colStart + e, o ?? t.getColumnCount());
|
|
3987
3992
|
return l.getReference({
|
|
3988
3993
|
rowStart: i,
|
|
3989
3994
|
colStart: a,
|
|
@@ -3992,28 +3997,28 @@ function Si(t, n, e, r, o) {
|
|
|
3992
3997
|
scope: u.scope
|
|
3993
3998
|
});
|
|
3994
3999
|
}
|
|
3995
|
-
function
|
|
4000
|
+
function Ti(t) {
|
|
3996
4001
|
if (!t || 0 === t.length) return l.getRow() + 1;
|
|
3997
4002
|
if (t.length > 1) return c.BuiltIn.Ref;
|
|
3998
4003
|
const n = [], e = t[0].getCoords(), r = e.rowStart, o = e.rowEnd;
|
|
3999
4004
|
for (let t = r; t <= o; t++) n.push([t + 1]);
|
|
4000
4005
|
return n;
|
|
4001
4006
|
}
|
|
4002
|
-
function
|
|
4007
|
+
function Di(t) {
|
|
4003
4008
|
return t.length > 1 ? c.BuiltIn.Ref : t[0].getRowCount();
|
|
4004
4009
|
}
|
|
4005
|
-
function
|
|
4010
|
+
function Vi(t, n, e) {
|
|
4006
4011
|
return c.BuiltIn.NA;
|
|
4007
4012
|
}
|
|
4008
|
-
function
|
|
4009
|
-
const o =
|
|
4013
|
+
function Fi(t, n, e, r = !1) {
|
|
4014
|
+
const o = ai(t), u = o.getRowCount(), i = o.getColumnCount(), s = r ? f.Axis.Column : f.Axis.Row, l = r ? u : i, a = function(t, n) {
|
|
4010
4015
|
if (t.length > n) throw c.BuiltIn.Value;
|
|
4011
4016
|
return t.map((t) => {
|
|
4012
4017
|
const e = Math.trunc(yt(t));
|
|
4013
4018
|
if (!(e >= 1 && e <= n)) throw c.BuiltIn.Value;
|
|
4014
4019
|
return e - 1;
|
|
4015
4020
|
});
|
|
4016
|
-
}(
|
|
4021
|
+
}(Pi(n), l), h = Li(Pi(e), a.length), m = a.map((t) => r ? o.slice({
|
|
4017
4022
|
rowStart: t,
|
|
4018
4023
|
rowEnd: t
|
|
4019
4024
|
}) : o.slice({
|
|
@@ -4022,18 +4027,18 @@ function Vi(t, n, e, r = !1) {
|
|
|
4022
4027
|
})), g = o.argsort(m, h, s);
|
|
4023
4028
|
return o.take(g, s).resize(u, i);
|
|
4024
4029
|
}
|
|
4025
|
-
var
|
|
4030
|
+
var Oi = Object.freeze({
|
|
4026
4031
|
includeEmpty: !0,
|
|
4027
4032
|
onError: "value"
|
|
4028
4033
|
});
|
|
4029
|
-
function
|
|
4034
|
+
function Pi(t) {
|
|
4030
4035
|
if (!t) return [1];
|
|
4031
4036
|
if (t.getRowCount() > 1 && t.getColumnCount() > 1) throw c.BuiltIn.Value;
|
|
4032
4037
|
if (t.isIReferenceRange && 1 === t.getRowCount() && 1 === t.getColumnCount()) {
|
|
4033
4038
|
const n = t.getValueAt(0, 0);
|
|
4034
4039
|
if (c.isError(n)) throw n;
|
|
4035
4040
|
}
|
|
4036
|
-
return t.getValuesFlat(
|
|
4041
|
+
return t.getValuesFlat(Oi).map((t) => {
|
|
4037
4042
|
if ("number" == typeof t) return t;
|
|
4038
4043
|
if (null === t) return 0;
|
|
4039
4044
|
if ("boolean" == typeof t) return t ? 1 : 0;
|
|
@@ -4041,7 +4046,7 @@ function Oi(t) {
|
|
|
4041
4046
|
throw c.BuiltIn.Value;
|
|
4042
4047
|
});
|
|
4043
4048
|
}
|
|
4044
|
-
function
|
|
4049
|
+
function Li(t, n) {
|
|
4045
4050
|
if (1 !== t.length && t.length !== n) throw c.BuiltIn.Value;
|
|
4046
4051
|
const e = t.map((t) => {
|
|
4047
4052
|
const n = Math.floor(t);
|
|
@@ -4050,8 +4055,8 @@ function Pi(t, n) {
|
|
|
4050
4055
|
});
|
|
4051
4056
|
return e.length === n ? e : new Array(n).fill(e[0]);
|
|
4052
4057
|
}
|
|
4053
|
-
function
|
|
4054
|
-
const e =
|
|
4058
|
+
function _i(t, n) {
|
|
4059
|
+
const e = ai(t), r = n.map(([t]) => t), o = Li(n.map(([, t]) => t ?? 1), r.length), u = e.getRowCount(), i = e.getColumnCount();
|
|
4055
4060
|
if (1 === u && 1 === i) {
|
|
4056
4061
|
const t = e.getValueAt(0, 0);
|
|
4057
4062
|
if (c.isError(t)) return t;
|
|
@@ -4078,7 +4083,7 @@ function Li(t, n) {
|
|
|
4078
4083
|
const l = e.argsort(r, o, s);
|
|
4079
4084
|
return e.take(l, s).resize(u, i);
|
|
4080
4085
|
}
|
|
4081
|
-
function
|
|
4086
|
+
function Ui(t, n, e) {
|
|
4082
4087
|
const r = void 0 === n ? void 0 : Math.trunc(n), o = void 0 === e ? void 0 : Math.trunc(e);
|
|
4083
4088
|
if (0 === r || 0 === o) return c.BuiltIn.Calc;
|
|
4084
4089
|
const u = t.getRowCount(), i = t.getColumnCount(), s = void 0 === r || r >= 0 ? 0 : Math.max(0, u + r), l = void 0 === r ? u : r >= 0 ? Math.min(r, u) : u, a = void 0 === o || o >= 0 ? 0 : Math.max(0, i + o), f = void 0 === o ? i : o >= 0 ? Math.min(o, i) : i;
|
|
@@ -4089,10 +4094,10 @@ function _i(t, n, e) {
|
|
|
4089
4094
|
colEnd: f - 1
|
|
4090
4095
|
});
|
|
4091
4096
|
}
|
|
4092
|
-
var
|
|
4097
|
+
var ki = (t, n, e, r) => {
|
|
4093
4098
|
const o = Math.trunc(n);
|
|
4094
4099
|
if (!(o >= 0 && o <= 3)) return c.BuiltIn.Value;
|
|
4095
|
-
const u = r === f.Axis.Column, i = e ?
|
|
4100
|
+
const u = r === f.Axis.Column, i = e ? Wu : Qu, s = [], l = t.length;
|
|
4096
4101
|
for (let n = 0; n < l; n++) {
|
|
4097
4102
|
const r = t[n], u = r.getColumnCount(), l = r.getRowCount(), a = new Array(u * l).fill(null), f = r.entries(i);
|
|
4098
4103
|
let c = f.next();
|
|
@@ -4100,24 +4105,24 @@ var Ui = (t, n, e, r) => {
|
|
|
4100
4105
|
const { value: t, coords: n } = c.value;
|
|
4101
4106
|
c = f.next(), a[e ? n.colIndex * l + n.rowIndex : n.rowIndex * u + n.colIndex] = t;
|
|
4102
4107
|
}
|
|
4103
|
-
for (let t = 0; t < a.length; t++)
|
|
4108
|
+
for (let t = 0; t < a.length; t++) fs(a[t], o) || s.push(a[t]);
|
|
4104
4109
|
}
|
|
4105
4110
|
if (0 === s.length) return c.BuiltIn.Calc;
|
|
4106
4111
|
const a = t[0].empty().sparseBuilder(r);
|
|
4107
4112
|
for (let t = 0; t < s.length; t++) u ? a.pushAt(t, 0, s[t]) : a.pushAt(0, t, s[t]);
|
|
4108
4113
|
return a.build().resize(u ? s.length : 1, u ? 1 : s.length);
|
|
4109
4114
|
};
|
|
4110
|
-
function ki(t, n = 0, e = !1) {
|
|
4111
|
-
return Ui(t, n, e, f.Axis.Column);
|
|
4112
|
-
}
|
|
4113
4115
|
function $i(t, n = 0, e = !1) {
|
|
4114
|
-
return
|
|
4116
|
+
return ki(t, n, e, f.Axis.Column);
|
|
4117
|
+
}
|
|
4118
|
+
function ji(t, n = 0, e = !1) {
|
|
4119
|
+
return ki(t, n, e, f.Axis.Row);
|
|
4115
4120
|
}
|
|
4116
|
-
function
|
|
4121
|
+
function Xi(t) {
|
|
4117
4122
|
return t.transpose();
|
|
4118
4123
|
}
|
|
4119
|
-
function
|
|
4120
|
-
if (!
|
|
4124
|
+
function qi(t, n = 3, e = 3) {
|
|
4125
|
+
if (!Gi(n) || !Gi(e)) return c.BuiltIn.Value;
|
|
4121
4126
|
const r = t.getRowCount(), o = t.getColumnCount();
|
|
4122
4127
|
if (0 === r || 0 === o) return c.BuiltIn.Calc;
|
|
4123
4128
|
let u = 0, i = r - 1, s = 0, a = o - 1;
|
|
@@ -4154,20 +4159,20 @@ function Xi(t, n = 3, e = 3) {
|
|
|
4154
4159
|
colEnd: a
|
|
4155
4160
|
});
|
|
4156
4161
|
}
|
|
4157
|
-
var
|
|
4158
|
-
function
|
|
4159
|
-
const r =
|
|
4162
|
+
var Gi = (t) => Number.isInteger(t) && t >= 0 && t <= 3;
|
|
4163
|
+
function Hi(t, n = !1, e = !1) {
|
|
4164
|
+
const r = ai(t), o = n ? f.Axis.Column : f.Axis.Row, u = r.uniqueIndices(o, e);
|
|
4160
4165
|
if (0 === u.length) throw c.BuiltIn.Calc;
|
|
4161
4166
|
return r.take(u, o);
|
|
4162
4167
|
}
|
|
4163
|
-
function
|
|
4168
|
+
function Yi(t, n, e, r = !0) {
|
|
4164
4169
|
if (c.isError(t)) return t;
|
|
4165
4170
|
if (n.length > 1) return c.BuiltIn.NA;
|
|
4166
4171
|
const o = n[0];
|
|
4167
|
-
if (
|
|
4168
|
-
const u =
|
|
4172
|
+
if (es()) return c.BuiltIn.NA;
|
|
4173
|
+
const u = rs(e);
|
|
4169
4174
|
if (u < 1) return c.BuiltIn.Value;
|
|
4170
|
-
const i = u > o.getColumnCount(), s = (t) => i ? c.BuiltIn.Ref : o.getValueAt(t, u - 1) ?? null, l = typeof t, a =
|
|
4175
|
+
const i = u > o.getColumnCount(), s = (t) => i ? c.BuiltIn.Ref : o.getValueAt(t, u - 1) ?? null, l = typeof t, a = os(t);
|
|
4171
4176
|
if (r) {
|
|
4172
4177
|
let n = null, e = -1, r = !0, u = !1;
|
|
4173
4178
|
const i = o.entries({
|
|
@@ -4183,18 +4188,18 @@ function Hi(t, n, e, r = !0) {
|
|
|
4183
4188
|
a = i.next();
|
|
4184
4189
|
continue;
|
|
4185
4190
|
}
|
|
4186
|
-
const m =
|
|
4191
|
+
const m = ns(o, t);
|
|
4187
4192
|
if (r) {
|
|
4188
4193
|
n = o, e = h, r = !1, m > 0 && (u = !0), a = i.next();
|
|
4189
4194
|
continue;
|
|
4190
4195
|
}
|
|
4191
|
-
const g =
|
|
4196
|
+
const g = ns(n, t);
|
|
4192
4197
|
if (m > 0 && (u = !0), g > 0 && m > 0) return c.BuiltIn.NA;
|
|
4193
4198
|
if (u && 0 === g && m < 0) return s(e);
|
|
4194
4199
|
if (null != n && m > 0 && g <= 0) return s(e);
|
|
4195
4200
|
n = o, e = h, a = i.next();
|
|
4196
4201
|
}
|
|
4197
|
-
return r ||
|
|
4202
|
+
return r || ns(n, t) > 0 ? c.BuiltIn.NA : s(e);
|
|
4198
4203
|
}
|
|
4199
4204
|
if (!a) {
|
|
4200
4205
|
const n = o.slice({
|
|
@@ -4216,11 +4221,11 @@ function Hi(t, n, e, r = !0) {
|
|
|
4216
4221
|
}
|
|
4217
4222
|
return c.BuiltIn.NA;
|
|
4218
4223
|
}
|
|
4219
|
-
function
|
|
4220
|
-
return
|
|
4224
|
+
function zi(t) {
|
|
4225
|
+
return Ai(t, f.Axis.Row);
|
|
4221
4226
|
}
|
|
4222
|
-
var
|
|
4223
|
-
const o =
|
|
4227
|
+
var Ki = (t, n, e, r) => {
|
|
4228
|
+
const o = ai(t), { rows: u, columns: i } = o.getShape();
|
|
4224
4229
|
if (u > 1 && i > 1) return c.BuiltIn.Value;
|
|
4225
4230
|
const s = Math.trunc(n);
|
|
4226
4231
|
if (!(s >= 1 && s <= 2147483647)) return c.BuiltIn.Num;
|
|
@@ -4235,13 +4240,13 @@ var zi = (t, n, e, r) => {
|
|
|
4235
4240
|
for (let t = l; t < m * a; t++) h ? g.pushAt(Math.floor(t / a), t % a, e) : g.pushAt(t % a, Math.floor(t / a), e);
|
|
4236
4241
|
return g.build();
|
|
4237
4242
|
};
|
|
4238
|
-
function Ki(t, n, e = c.BuiltIn.NA) {
|
|
4239
|
-
return zi(t, n, e, f.Axis.Column);
|
|
4240
|
-
}
|
|
4241
4243
|
function Wi(t, n, e = c.BuiltIn.NA) {
|
|
4242
|
-
return
|
|
4244
|
+
return Ki(t, n, e, f.Axis.Column);
|
|
4243
4245
|
}
|
|
4244
|
-
function Qi(t, n, e
|
|
4246
|
+
function Qi(t, n, e = c.BuiltIn.NA) {
|
|
4247
|
+
return Ki(t, n, e, f.Axis.Row);
|
|
4248
|
+
}
|
|
4249
|
+
function Zi(t, n, e, r = c.BuiltIn.NA, o = 0, u = 1) {
|
|
4245
4250
|
if (![
|
|
4246
4251
|
0,
|
|
4247
4252
|
-1,
|
|
@@ -4263,13 +4268,13 @@ function Qi(t, n, e, r = c.BuiltIn.NA, o = 0, u = 1) {
|
|
|
4263
4268
|
if (1 === s.getRowCount()) f = !1;
|
|
4264
4269
|
else if (1 !== s.getColumnCount()) throw c.BuiltIn.Value;
|
|
4265
4270
|
}
|
|
4266
|
-
if (null == t) a =
|
|
4271
|
+
if (null == t) a = ss(i, o, u);
|
|
4267
4272
|
else if (0 !== o && 2 !== o || 1 !== u && -1 !== u) {
|
|
4268
|
-
const n = i.getValuesFlat(
|
|
4273
|
+
const n = i.getValuesFlat(Ku), e = [], r = [];
|
|
4269
4274
|
for (let t = 0; t < n.length; t++) null !== n[t] && void 0 !== n[t] && (e.push(n[t]), r.push(t));
|
|
4270
|
-
const s =
|
|
4275
|
+
const s = as(t, e, o, u);
|
|
4271
4276
|
a = -1 === s ? -1 : r[s];
|
|
4272
|
-
} else a =
|
|
4277
|
+
} else a = ls(i, t, -1 === u, os(t, 2 === o));
|
|
4273
4278
|
if (-1 === a) return r;
|
|
4274
4279
|
if (a < (f ? s.getColumnCount() : s.getRowCount())) {
|
|
4275
4280
|
if (!0 === s.isIReferenceRange) {
|
|
@@ -4298,10 +4303,10 @@ function Qi(t, n, e, r = c.BuiltIn.NA, o = 0, u = 1) {
|
|
|
4298
4303
|
}
|
|
4299
4304
|
return s.getValueAt(f ? 0 : a, f ? a : 0);
|
|
4300
4305
|
}
|
|
4301
|
-
function
|
|
4302
|
-
return n.length > 1 ? c.BuiltIn.NA :
|
|
4306
|
+
function Ji(t, n, e = 0, r = 1) {
|
|
4307
|
+
return n.length > 1 ? c.BuiltIn.NA : ts(t, n[0], e, r, 2 === e);
|
|
4303
4308
|
}
|
|
4304
|
-
function
|
|
4309
|
+
function ts(t, n, e, r, o, u = !1) {
|
|
4305
4310
|
if (![
|
|
4306
4311
|
0,
|
|
4307
4312
|
-1,
|
|
@@ -4318,16 +4323,16 @@ function Ji(t, n, e, r, o, u = !1) {
|
|
|
4318
4323
|
if (n.getColumnCount() > 1 && n.getRowCount() > 1) throw c.BuiltIn.Value;
|
|
4319
4324
|
if (null == t) {
|
|
4320
4325
|
if (u) return c.BuiltIn.NA;
|
|
4321
|
-
const t =
|
|
4326
|
+
const t = ss(n, e, r);
|
|
4322
4327
|
return -1 === t ? c.BuiltIn.NA : t + 1;
|
|
4323
4328
|
}
|
|
4324
4329
|
if (!(0 !== e && 2 !== e || 1 !== r && -1 !== r)) {
|
|
4325
|
-
const e =
|
|
4330
|
+
const e = ls(n, t, -1 === r, o ? os(t, !0) : null);
|
|
4326
4331
|
return -1 === e ? c.BuiltIn.NA : e + 1;
|
|
4327
4332
|
}
|
|
4328
|
-
const i = n.getValuesFlat(
|
|
4333
|
+
const i = n.getValuesFlat(Ku), s = [], l = [];
|
|
4329
4334
|
for (let t = 0; t < i.length; t++) null !== i[t] && void 0 !== i[t] && (s.push(i[t]), l.push(t));
|
|
4330
|
-
const a = !u || 2 !== r && -2 !== r ?
|
|
4335
|
+
const a = !u || 2 !== r && -2 !== r ? as(t, s, e, r, o) : function(t, n, e) {
|
|
4331
4336
|
const r = (e) => typeof t[e] == typeof n;
|
|
4332
4337
|
let o = 0, u = t.length - 1, i = -1;
|
|
4333
4338
|
for (; o <= u;) {
|
|
@@ -4340,9 +4345,9 @@ function Ji(t, n, e, r, o, u = !1) {
|
|
|
4340
4345
|
if (l < o) break;
|
|
4341
4346
|
}
|
|
4342
4347
|
}
|
|
4343
|
-
const a =
|
|
4348
|
+
const a = ns(t[l], n);
|
|
4344
4349
|
if (0 === a) {
|
|
4345
|
-
for (; l + 1 < t.length && r(l + 1) && 0 ===
|
|
4350
|
+
for (; l + 1 < t.length && r(l + 1) && 0 === ns(t[l + 1], n);) l++;
|
|
4346
4351
|
return l;
|
|
4347
4352
|
}
|
|
4348
4353
|
(e ? a < 0 : a > 0) ? (i = l, o = Math.max(s, l) + 1) : u = Math.min(s, l) - 1;
|
|
@@ -4351,32 +4356,32 @@ function Ji(t, n, e, r, o, u = !1) {
|
|
|
4351
4356
|
}(s, t, 2 === r);
|
|
4352
4357
|
return -1 === a ? c.BuiltIn.NA : l[a] + 1;
|
|
4353
4358
|
}
|
|
4354
|
-
function
|
|
4359
|
+
function ns(t, n) {
|
|
4355
4360
|
return "number" == typeof t && "number" == typeof n ? t < n ? -1 : t > n ? 1 : 0 : l.compare(t, n);
|
|
4356
4361
|
}
|
|
4357
|
-
function
|
|
4362
|
+
function es() {
|
|
4358
4363
|
const t = l.getArgs().getKindAt(1);
|
|
4359
4364
|
return t !== u.Reference && t !== u.Array;
|
|
4360
4365
|
}
|
|
4361
|
-
function
|
|
4366
|
+
function rs(t) {
|
|
4362
4367
|
return Number.isFinite(t) ? Math.trunc(0 === t ? 0 : Number(t.toPrecision(15))) : t;
|
|
4363
4368
|
}
|
|
4364
|
-
function
|
|
4369
|
+
function os(t, n = !1) {
|
|
4365
4370
|
return "string" != typeof t ? null : (n ? /[*?~]/.test(t) : s.isWildCard(t)) ? s.toRegex(t, "i", !0) : null;
|
|
4366
4371
|
}
|
|
4367
|
-
function
|
|
4372
|
+
function us(t, n, e, r) {
|
|
4368
4373
|
let o = 0, u = t.length - 1, i = -1, s = -1;
|
|
4369
4374
|
for (; o <= u;) {
|
|
4370
|
-
const e = o + u >>> 1, l = null === n ?
|
|
4375
|
+
const e = o + u >>> 1, l = null === n ? is(t[e]) : ns(t[e], n);
|
|
4371
4376
|
0 === l ? (i = e, r ? u = e - 1 : o = e + 1) : (r ? l < 0 : l > 0) ? (s = e, o = e + 1) : u = e - 1;
|
|
4372
4377
|
}
|
|
4373
4378
|
return -1 !== i ? i : 0 === e || 2 === e ? -1 : (r ? -1 === e : 1 === e) ? s : s + 1 < t.length ? s + 1 : -1;
|
|
4374
4379
|
}
|
|
4375
|
-
function
|
|
4380
|
+
function is(t) {
|
|
4376
4381
|
return null == t ? 0 : -1;
|
|
4377
4382
|
}
|
|
4378
|
-
function
|
|
4379
|
-
if (2 === e || -2 === e) return
|
|
4383
|
+
function ss(t, n, e) {
|
|
4384
|
+
if (2 === e || -2 === e) return us(t.getValuesFlat(Ku), null, n, 2 === e);
|
|
4380
4385
|
const r = -1 === e, o = 1 === t.getRowCount(), u = t.entries({
|
|
4381
4386
|
axis: o ? f.Axis.Row : f.Axis.Column,
|
|
4382
4387
|
includeEmpty: !0,
|
|
@@ -4386,11 +4391,11 @@ function is(t, n, e) {
|
|
|
4386
4391
|
for (; !l.done;) {
|
|
4387
4392
|
const { value: t, coords: e } = l.value, r = o ? e.colIndex : e.rowIndex;
|
|
4388
4393
|
if (null == t) return r;
|
|
4389
|
-
-1 === n && (-1 === i ||
|
|
4394
|
+
-1 === n && (-1 === i || ns(t, s) > 0) && (i = r, s = t), l = u.next();
|
|
4390
4395
|
}
|
|
4391
4396
|
return i;
|
|
4392
4397
|
}
|
|
4393
|
-
function
|
|
4398
|
+
function ls(t, n, e, r) {
|
|
4394
4399
|
if (null === r) return t.indexOf(n, { reverse: e });
|
|
4395
4400
|
const o = 1 === t.getRowCount(), u = t.entries({
|
|
4396
4401
|
axis: o ? f.Axis.Row : f.Axis.Column,
|
|
@@ -4400,14 +4405,14 @@ function ss(t, n, e, r) {
|
|
|
4400
4405
|
let i = u.next();
|
|
4401
4406
|
for (; !i.done;) {
|
|
4402
4407
|
const { value: t, coords: e } = i.value;
|
|
4403
|
-
if (null != t && (r ? "string" == typeof t && r.test(t) : 0 ===
|
|
4408
|
+
if (null != t && (r ? "string" == typeof t && r.test(t) : 0 === ns(t, n))) return o ? e.colIndex : e.rowIndex;
|
|
4404
4409
|
i = u.next();
|
|
4405
4410
|
}
|
|
4406
4411
|
return -1;
|
|
4407
4412
|
}
|
|
4408
|
-
function
|
|
4409
|
-
const u = o ?
|
|
4410
|
-
if (2 === r || -2 === r) return
|
|
4413
|
+
function as(t, n, e, r, o = 2 === e) {
|
|
4414
|
+
const u = o ? os(t, !0) : null;
|
|
4415
|
+
if (2 === r || -2 === r) return us(n, t, e, 2 === r);
|
|
4411
4416
|
const i = -1 === r ? -1 : 1, s = -1 === r ? n.length - 1 : 0, l = -1 === r ? -1 : n.length;
|
|
4412
4417
|
if (0 === e || 2 === e) {
|
|
4413
4418
|
for (let e = s; e !== l; e += i) {
|
|
@@ -4415,7 +4420,7 @@ function ls(t, n, e, r, o = 2 === e) {
|
|
|
4415
4420
|
if (null != r) {
|
|
4416
4421
|
if (u) {
|
|
4417
4422
|
if ("string" == typeof r && u.test(r)) return e;
|
|
4418
|
-
} else if (0 ===
|
|
4423
|
+
} else if (0 === ns(r, t)) return e;
|
|
4419
4424
|
}
|
|
4420
4425
|
}
|
|
4421
4426
|
return -1;
|
|
@@ -4424,16 +4429,16 @@ function ls(t, n, e, r, o = 2 === e) {
|
|
|
4424
4429
|
for (let r = s; r !== l; r += i) {
|
|
4425
4430
|
const o = n[r];
|
|
4426
4431
|
if (null == o) continue;
|
|
4427
|
-
const u =
|
|
4432
|
+
const u = ns(o, t);
|
|
4428
4433
|
if (0 === u) return r;
|
|
4429
|
-
-1 === e ? u < 0 && (-1 === a ||
|
|
4434
|
+
-1 === e ? u < 0 && (-1 === a || ns(o, f) > 0) && (a = r, f = o) : u > 0 && (-1 === a || ns(o, f) < 0) && (a = r, f = o);
|
|
4430
4435
|
}
|
|
4431
4436
|
return a;
|
|
4432
4437
|
}
|
|
4433
|
-
function
|
|
4438
|
+
function fs(t, n) {
|
|
4434
4439
|
return 0 !== n && ((1 === n || 3 === n) && null === t || !(2 !== n && 3 !== n || !c.isError(t)));
|
|
4435
4440
|
}
|
|
4436
|
-
function
|
|
4441
|
+
function cs(t, n, e) {
|
|
4437
4442
|
const r = typeof t;
|
|
4438
4443
|
let o = -1, u = null, i = !1;
|
|
4439
4444
|
const s = e ? f.Axis.Row : f.Axis.Column, l = n.entries({
|
|
@@ -4456,20 +4461,20 @@ function fs(t, n, e) {
|
|
|
4456
4461
|
a = l.next();
|
|
4457
4462
|
continue;
|
|
4458
4463
|
}
|
|
4459
|
-
const h =
|
|
4464
|
+
const h = ns(n, t);
|
|
4460
4465
|
if (h > 0 && (i = !0), h <= 0) {
|
|
4461
|
-
const e = null !== u && 0 ===
|
|
4466
|
+
const e = null !== u && 0 === ns(u, t);
|
|
4462
4467
|
i && e || (o = f, u = n);
|
|
4463
4468
|
}
|
|
4464
4469
|
a = l.next();
|
|
4465
4470
|
}
|
|
4466
4471
|
return o;
|
|
4467
4472
|
}
|
|
4468
|
-
var
|
|
4473
|
+
var hs = (t, n) => {
|
|
4469
4474
|
if (0 === n) throw c.BuiltIn.Ref;
|
|
4470
4475
|
const e = Math.trunc(n), r = n > 0 ? t : t + e + 1, o = n > 0 ? t + e - 1 : t;
|
|
4471
4476
|
return r > o ? [o, r] : [r, o];
|
|
4472
|
-
},
|
|
4477
|
+
}, ms = (t) => {
|
|
4473
4478
|
const n = t.length, e = t.map((t) => [...t]), r = Array.from({ length: n }, (t, n) => n);
|
|
4474
4479
|
let o = 1;
|
|
4475
4480
|
for (let t = 0; t < n; t++) {
|
|
@@ -4494,7 +4499,7 @@ var cs = (t, n) => {
|
|
|
4494
4499
|
singular: !1
|
|
4495
4500
|
};
|
|
4496
4501
|
};
|
|
4497
|
-
function
|
|
4502
|
+
function gs(t, n, e, r, o, u) {
|
|
4498
4503
|
const i = n.map((t) => t[0]), s = i[0].getColumnCount(), l = i[0].getRowCount();
|
|
4499
4504
|
for (let t = 1; t < i.length; t++) if (i[t].getColumnCount() !== s || i[t].getRowCount() !== l) throw c.BuiltIn.Value;
|
|
4500
4505
|
if (r && (r.getColumnCount() !== s || r.getRowCount() !== l)) throw c.BuiltIn.Value;
|
|
@@ -4514,98 +4519,98 @@ function ms(t, n, e, r, o, u) {
|
|
|
4514
4519
|
}, null, h && u ? { emptyFold: u } : void 0);
|
|
4515
4520
|
return null !== I ? I : o;
|
|
4516
4521
|
}
|
|
4517
|
-
function
|
|
4522
|
+
function Ns(t) {
|
|
4518
4523
|
return (n, e) => c.isError(n) ? n : c.isError(e) ? e : t(n, e);
|
|
4519
4524
|
}
|
|
4520
|
-
function
|
|
4525
|
+
function Is(t) {
|
|
4521
4526
|
const n = t.getCode();
|
|
4522
4527
|
return n === c.Code.Null || n === c.Code.GettingData ? c.BuiltIn.Num : t;
|
|
4523
4528
|
}
|
|
4524
|
-
function
|
|
4529
|
+
function ps(t) {
|
|
4525
4530
|
const n = t.firstError();
|
|
4526
|
-
return 1 === t.size && t.isIReferenceRange ? n :
|
|
4531
|
+
return 1 === t.size && t.isIReferenceRange ? n : Is(n);
|
|
4527
4532
|
}
|
|
4528
|
-
var
|
|
4533
|
+
var Ms = (t) => {
|
|
4529
4534
|
let n = 1;
|
|
4530
4535
|
for (let e = t; e >= 2; e--) n *= e;
|
|
4531
4536
|
return n;
|
|
4532
|
-
},
|
|
4537
|
+
}, ds = (t, n) => {
|
|
4533
4538
|
const e = Math.min(n, t - n);
|
|
4534
4539
|
let r = 1;
|
|
4535
4540
|
for (let n = 1; n <= e; n++) if (r = r / n * (t - e + n), !Number.isFinite(r)) return NaN;
|
|
4536
4541
|
return r;
|
|
4537
|
-
},
|
|
4538
|
-
ABS: () =>
|
|
4539
|
-
AGGREGATE: () =>
|
|
4540
|
-
ARABIC: () =>
|
|
4541
|
-
BASE: () =>
|
|
4542
|
-
CEILING: () =>
|
|
4543
|
-
CEILING_MATH: () =>
|
|
4544
|
-
CEILING_PRECISE: () =>
|
|
4545
|
-
COMBIN: () =>
|
|
4546
|
-
COMBINA: () =>
|
|
4547
|
-
DECIMAL: () =>
|
|
4548
|
-
DEGREES: () =>
|
|
4549
|
-
ECMA_CEILING: () =>
|
|
4550
|
-
EVEN: () =>
|
|
4551
|
-
EXP: () =>
|
|
4552
|
-
FACT: () =>
|
|
4553
|
-
FACTDOUBLE: () =>
|
|
4554
|
-
FLOOR: () =>
|
|
4555
|
-
FLOOR_MATH: () =>
|
|
4556
|
-
FLOOR_PRECISE: () =>
|
|
4557
|
-
GCD: () =>
|
|
4558
|
-
INT: () =>
|
|
4559
|
-
ISO_CEILING: () =>
|
|
4560
|
-
LCM: () =>
|
|
4561
|
-
LN: () =>
|
|
4562
|
-
LOG: () =>
|
|
4563
|
-
LOG10: () =>
|
|
4564
|
-
MDETERM: () =>
|
|
4565
|
-
MINVERSE: () =>
|
|
4566
|
-
MMULT: () =>
|
|
4567
|
-
MOD: () =>
|
|
4568
|
-
MROUND: () =>
|
|
4569
|
-
MULTINOMIAL: () =>
|
|
4570
|
-
MUNIT: () =>
|
|
4571
|
-
ODD: () =>
|
|
4572
|
-
PERCENTOF: () =>
|
|
4573
|
-
PI: () =>
|
|
4574
|
-
POWER: () =>
|
|
4575
|
-
PRODUCT: () =>
|
|
4576
|
-
QUOTIENT: () =>
|
|
4577
|
-
RADIANS: () =>
|
|
4578
|
-
RAND: () =>
|
|
4579
|
-
RANDARRAY: () =>
|
|
4580
|
-
RANDBETWEEN: () =>
|
|
4581
|
-
ROMAN: () =>
|
|
4582
|
-
ROUND: () =>
|
|
4583
|
-
ROUNDDOWN: () =>
|
|
4584
|
-
ROUNDUP: () =>
|
|
4585
|
-
SEQUENCE: () =>
|
|
4586
|
-
SERIESSUM: () =>
|
|
4587
|
-
SIGN: () =>
|
|
4588
|
-
SQRT: () =>
|
|
4589
|
-
SQRTPI: () =>
|
|
4590
|
-
SUBTOTAL: () =>
|
|
4591
|
-
SUM: () =>
|
|
4592
|
-
SUMIF: () =>
|
|
4593
|
-
SUMIFS: () =>
|
|
4594
|
-
SUMPRODUCT: () =>
|
|
4595
|
-
SUMSQ: () =>
|
|
4596
|
-
SUMX2MY2: () =>
|
|
4597
|
-
SUMX2PY2: () =>
|
|
4598
|
-
SUMXMY2: () =>
|
|
4599
|
-
TRUNC: () =>
|
|
4542
|
+
}, ws = At({
|
|
4543
|
+
ABS: () => As,
|
|
4544
|
+
AGGREGATE: () => Bs,
|
|
4545
|
+
ARABIC: () => bs,
|
|
4546
|
+
BASE: () => Cs,
|
|
4547
|
+
CEILING: () => ys,
|
|
4548
|
+
CEILING_MATH: () => Rs,
|
|
4549
|
+
CEILING_PRECISE: () => vs,
|
|
4550
|
+
COMBIN: () => xs,
|
|
4551
|
+
COMBINA: () => Ts,
|
|
4552
|
+
DECIMAL: () => Ds,
|
|
4553
|
+
DEGREES: () => Vs,
|
|
4554
|
+
ECMA_CEILING: () => Ss,
|
|
4555
|
+
EVEN: () => Fs,
|
|
4556
|
+
EXP: () => Os,
|
|
4557
|
+
FACT: () => Ps,
|
|
4558
|
+
FACTDOUBLE: () => Ls,
|
|
4559
|
+
FLOOR: () => _s,
|
|
4560
|
+
FLOOR_MATH: () => Us,
|
|
4561
|
+
FLOOR_PRECISE: () => ks,
|
|
4562
|
+
GCD: () => $s,
|
|
4563
|
+
INT: () => js,
|
|
4564
|
+
ISO_CEILING: () => Xs,
|
|
4565
|
+
LCM: () => qs,
|
|
4566
|
+
LN: () => Gs,
|
|
4567
|
+
LOG: () => Hs,
|
|
4568
|
+
LOG10: () => Ys,
|
|
4569
|
+
MDETERM: () => Ks,
|
|
4570
|
+
MINVERSE: () => Ws,
|
|
4571
|
+
MMULT: () => Qs,
|
|
4572
|
+
MOD: () => Zs,
|
|
4573
|
+
MROUND: () => nl,
|
|
4574
|
+
MULTINOMIAL: () => el,
|
|
4575
|
+
MUNIT: () => rl,
|
|
4576
|
+
ODD: () => ol,
|
|
4577
|
+
PERCENTOF: () => ul,
|
|
4578
|
+
PI: () => il,
|
|
4579
|
+
POWER: () => ll,
|
|
4580
|
+
PRODUCT: () => al,
|
|
4581
|
+
QUOTIENT: () => fl,
|
|
4582
|
+
RADIANS: () => cl,
|
|
4583
|
+
RAND: () => hl,
|
|
4584
|
+
RANDARRAY: () => ml,
|
|
4585
|
+
RANDBETWEEN: () => gl,
|
|
4586
|
+
ROMAN: () => Nl,
|
|
4587
|
+
ROUND: () => Il,
|
|
4588
|
+
ROUNDDOWN: () => pl,
|
|
4589
|
+
ROUNDUP: () => Ml,
|
|
4590
|
+
SEQUENCE: () => wl,
|
|
4591
|
+
SERIESSUM: () => Al,
|
|
4592
|
+
SIGN: () => Bl,
|
|
4593
|
+
SQRT: () => bl,
|
|
4594
|
+
SQRTPI: () => Cl,
|
|
4595
|
+
SUBTOTAL: () => yl,
|
|
4596
|
+
SUM: () => Rl,
|
|
4597
|
+
SUMIF: () => vl,
|
|
4598
|
+
SUMIFS: () => Sl,
|
|
4599
|
+
SUMPRODUCT: () => xl,
|
|
4600
|
+
SUMSQ: () => Tl,
|
|
4601
|
+
SUMX2MY2: () => Dl,
|
|
4602
|
+
SUMX2PY2: () => Vl,
|
|
4603
|
+
SUMXMY2: () => Fl,
|
|
4604
|
+
TRUNC: () => Ol
|
|
4600
4605
|
});
|
|
4601
|
-
function
|
|
4606
|
+
function As(t) {
|
|
4602
4607
|
return Math.abs(t);
|
|
4603
4608
|
}
|
|
4604
|
-
var
|
|
4609
|
+
var Es = (t, n, e) => {
|
|
4605
4610
|
const r = t.length;
|
|
4606
4611
|
return 0 === r || n < 1 || n > r ? c.BuiltIn.Num : t[Math.trunc(e ? r - n : n - 1)];
|
|
4607
4612
|
};
|
|
4608
|
-
function
|
|
4613
|
+
function Bs(t, n, e, ...r) {
|
|
4609
4614
|
const o = l.getArgs().getAreaCountAt(2) > 1;
|
|
4610
4615
|
e = l.flattenAreas(e);
|
|
4611
4616
|
const u = Math.trunc(t), i = Math.trunc(n);
|
|
@@ -4682,8 +4687,8 @@ function Es(t, n, e, ...r) {
|
|
|
4682
4687
|
}).next();
|
|
4683
4688
|
return t.done || t.value[1] < 2 ? c.BuiltIn.NA : t.value[0];
|
|
4684
4689
|
}
|
|
4685
|
-
case 14: return
|
|
4686
|
-
case 15: return
|
|
4690
|
+
case 14: return Es(w().getValues(), g, !0);
|
|
4691
|
+
case 15: return Es(w().getValues(), g, !1);
|
|
4687
4692
|
case 16: return w().getPercentile(g) ?? c.BuiltIn.Num;
|
|
4688
4693
|
case 17: return w().getPercentile(Math.trunc(g) / 4) ?? c.BuiltIn.Num;
|
|
4689
4694
|
case 18: return w().getPercentile(g, !0) ?? c.BuiltIn.Num;
|
|
@@ -4691,24 +4696,24 @@ function Es(t, n, e, ...r) {
|
|
|
4691
4696
|
default: return c.BuiltIn.Value;
|
|
4692
4697
|
}
|
|
4693
4698
|
}
|
|
4694
|
-
function
|
|
4695
|
-
if (t.length >
|
|
4699
|
+
function bs(t) {
|
|
4700
|
+
if (t.length > Xl) throw new c.Value("Roman numeral too long in ARABIC evaluation.");
|
|
4696
4701
|
const n = t.replace(/^[ \t\n\r]+|[ \t\n\r]+$/g, ""), e = n.startsWith("-"), r = e ? n.slice(1) : n;
|
|
4697
4702
|
if (e && "" === r) throw c.BuiltIn.Num;
|
|
4698
4703
|
let o = 0, u = 0;
|
|
4699
4704
|
for (let t = r.length - 1; t >= 0; t--) {
|
|
4700
|
-
const n =
|
|
4705
|
+
const n = jl[r[t].toUpperCase()];
|
|
4701
4706
|
if (void 0 === n) throw new c.Value("Invalid roman numeral in ARABIC evaluation.");
|
|
4702
4707
|
n < u ? o -= n : (o += n, u = n);
|
|
4703
4708
|
}
|
|
4704
4709
|
return e ? -o : o;
|
|
4705
4710
|
}
|
|
4706
|
-
function
|
|
4711
|
+
function Cs(t, n, e = 1) {
|
|
4707
4712
|
if (t < 0 || e < 0) return NaN;
|
|
4708
4713
|
const r = Math.trunc(t), o = Math.trunc(n), u = Math.trunc(e);
|
|
4709
|
-
return r >= 2 ** 53 || o < 2 || o > 36 || u >
|
|
4714
|
+
return r >= 2 ** 53 || o < 2 || o > 36 || u > Xl ? NaN : (0 === r ? "" : r.toString(o).toUpperCase()).padStart(u, "0");
|
|
4710
4715
|
}
|
|
4711
|
-
function
|
|
4716
|
+
function ys(t, n) {
|
|
4712
4717
|
if (0 === n) return 0;
|
|
4713
4718
|
if (0 === Et(n)) throw c.BuiltIn.Div0;
|
|
4714
4719
|
if (t > 0 && n < 0) return NaN;
|
|
@@ -4717,33 +4722,33 @@ function Cs(t, n) {
|
|
|
4717
4722
|
const o = Math.floor(r);
|
|
4718
4723
|
return t < 0 ? n < 0 ? -e * (o + 1) : -e * o : (o + 1) * e;
|
|
4719
4724
|
}
|
|
4720
|
-
function
|
|
4725
|
+
function Rs(t, n, e = 0) {
|
|
4721
4726
|
if (0 === (n = Math.abs(n ?? 1))) return 0;
|
|
4722
|
-
const r =
|
|
4727
|
+
const r = ys(t, n);
|
|
4723
4728
|
return t >= 0 || !e || r === t ? r : r - n;
|
|
4724
4729
|
}
|
|
4725
|
-
function
|
|
4726
|
-
return 0 === n ? 0 :
|
|
4727
|
-
}
|
|
4728
|
-
function vs(t, n) {
|
|
4729
|
-
return Cs(t, n);
|
|
4730
|
+
function vs(t, n = 1) {
|
|
4731
|
+
return 0 === n ? 0 : ys(t, Math.abs(n));
|
|
4730
4732
|
}
|
|
4731
4733
|
function Ss(t, n) {
|
|
4734
|
+
return ys(t, n);
|
|
4735
|
+
}
|
|
4736
|
+
function xs(t, n) {
|
|
4732
4737
|
if (t < 0 || n < 0) return NaN;
|
|
4733
4738
|
const e = Math.trunc(t), r = Math.trunc(n);
|
|
4734
|
-
return e > 2147483646 || e < r ? NaN :
|
|
4739
|
+
return e > 2147483646 || e < r ? NaN : ds(e, r);
|
|
4735
4740
|
}
|
|
4736
|
-
function
|
|
4741
|
+
function Ts(t, n) {
|
|
4737
4742
|
const e = Math.trunc(t), r = Math.trunc(n);
|
|
4738
4743
|
if (0 === r && (0 === e || 1 === e)) return 1;
|
|
4739
4744
|
if (t < 0 || n < 0) return NaN;
|
|
4740
4745
|
const o = e + r - 1;
|
|
4741
|
-
return o > 2147483646 || o < r ? NaN :
|
|
4746
|
+
return o > 2147483646 || o < r ? NaN : ds(o, r);
|
|
4742
4747
|
}
|
|
4743
|
-
function
|
|
4748
|
+
function Ds(t, n) {
|
|
4744
4749
|
const e = Math.trunc(n);
|
|
4745
4750
|
if (e < 2 || e > 36) return NaN;
|
|
4746
|
-
if (t.length >
|
|
4751
|
+
if (t.length > Xl) throw c.BuiltIn.Value;
|
|
4747
4752
|
let r = t.replace(/^[ \t]+/, "");
|
|
4748
4753
|
if (16 === e) {
|
|
4749
4754
|
const t = r.search(/[xX]/);
|
|
@@ -4757,29 +4762,29 @@ function Ts(t, n) {
|
|
|
4757
4762
|
}
|
|
4758
4763
|
return o;
|
|
4759
4764
|
}
|
|
4760
|
-
function
|
|
4765
|
+
function Vs(t) {
|
|
4761
4766
|
return t * (180 / Math.PI);
|
|
4762
4767
|
}
|
|
4763
|
-
function
|
|
4768
|
+
function Fs(t) {
|
|
4764
4769
|
let n = Math.ceil(Math.abs(t));
|
|
4765
4770
|
return n = 1 & n ? n + 1 : n, t < 0 ? -n : n;
|
|
4766
4771
|
}
|
|
4767
|
-
function
|
|
4772
|
+
function Os(t) {
|
|
4768
4773
|
return Math.exp(t);
|
|
4769
4774
|
}
|
|
4770
|
-
function
|
|
4775
|
+
function Ps(t) {
|
|
4771
4776
|
if (t < 0) return NaN;
|
|
4772
4777
|
const n = Math.trunc(yt(t));
|
|
4773
|
-
return n > 170 ? NaN :
|
|
4778
|
+
return n > 170 ? NaN : Ms(n);
|
|
4774
4779
|
}
|
|
4775
|
-
function
|
|
4776
|
-
const n =
|
|
4780
|
+
function Ls(t) {
|
|
4781
|
+
const n = tl(t);
|
|
4777
4782
|
if (n < -1) return NaN;
|
|
4778
4783
|
let e = 1;
|
|
4779
4784
|
for (let t = Math.trunc(n); t > 1; t -= 2) if (e *= t, !Number.isFinite(e)) return NaN;
|
|
4780
4785
|
return e;
|
|
4781
4786
|
}
|
|
4782
|
-
function
|
|
4787
|
+
function _s(t, n) {
|
|
4783
4788
|
if (0 === t) return 0;
|
|
4784
4789
|
if (0 === n) throw c.BuiltIn.Div0;
|
|
4785
4790
|
if (0 === Et(n)) throw c.BuiltIn.Div0;
|
|
@@ -4789,88 +4794,88 @@ function Ls(t, n) {
|
|
|
4789
4794
|
const o = Math.floor(r);
|
|
4790
4795
|
return t < 0 ? n < 0 ? -e * o : -e * (o + 1) : o * e;
|
|
4791
4796
|
}
|
|
4792
|
-
function
|
|
4797
|
+
function Us(t, n = t > 0 ? 1 : -1, e = 0) {
|
|
4793
4798
|
if (0 === n) return 0;
|
|
4794
|
-
const r = Math.abs(n), o =
|
|
4799
|
+
const r = Math.abs(n), o = _s(t, r);
|
|
4795
4800
|
return t >= 0 || !e || o === t ? o : o + r;
|
|
4796
4801
|
}
|
|
4797
|
-
function
|
|
4798
|
-
return 0 === n ? 0 :
|
|
4802
|
+
function ks(t, n = 1) {
|
|
4803
|
+
return 0 === n ? 0 : _s(t, Math.abs(n));
|
|
4799
4804
|
}
|
|
4800
|
-
function
|
|
4801
|
-
|
|
4805
|
+
function $s(t) {
|
|
4806
|
+
Hl(t);
|
|
4802
4807
|
let n, e = t[0];
|
|
4803
|
-
if (e < 0 || e >
|
|
4808
|
+
if (e < 0 || e > Ql) return NaN;
|
|
4804
4809
|
e = Math.abs(Math.trunc(e));
|
|
4805
4810
|
const r = t.length;
|
|
4806
4811
|
for (let o = 1; o < r; o++) {
|
|
4807
|
-
if (n = t[o], n < 0 || n >
|
|
4812
|
+
if (n = t[o], n < 0 || n > Ql) return NaN;
|
|
4808
4813
|
for (n = Math.abs(Math.trunc(n)); e && n;) e > n ? e %= n : n %= e;
|
|
4809
4814
|
e += n;
|
|
4810
4815
|
}
|
|
4811
4816
|
return e;
|
|
4812
4817
|
}
|
|
4813
|
-
function
|
|
4818
|
+
function js(t) {
|
|
4814
4819
|
const n = Math.round(t);
|
|
4815
4820
|
return yt(t) === yt(n) ? n : Math.floor(t);
|
|
4816
4821
|
}
|
|
4817
|
-
function
|
|
4818
|
-
return
|
|
4822
|
+
function Xs(t, n = 1) {
|
|
4823
|
+
return vs(t, n);
|
|
4819
4824
|
}
|
|
4820
|
-
function
|
|
4821
|
-
|
|
4825
|
+
function qs(t) {
|
|
4826
|
+
Hl(t);
|
|
4822
4827
|
let n, e, r, o = t[0];
|
|
4823
|
-
if (o < 0 || o >
|
|
4828
|
+
if (o < 0 || o > Ql) return NaN;
|
|
4824
4829
|
o = Math.abs(Math.trunc(o));
|
|
4825
4830
|
const u = t.length;
|
|
4826
4831
|
for (let i = 1; i < u; i++) {
|
|
4827
4832
|
const u = t[i];
|
|
4828
|
-
if (u < 0 || u >
|
|
4833
|
+
if (u < 0 || u > Ql) return NaN;
|
|
4829
4834
|
if (n = Math.abs(Math.trunc(u)), 0 !== o && 0 !== n) {
|
|
4830
4835
|
for (e = o, r = n; e && r;) e > r ? e %= r : r %= e;
|
|
4831
|
-
if (o = o / (e + r) * n, o >
|
|
4836
|
+
if (o = o / (e + r) * n, o > Ql) return NaN;
|
|
4832
4837
|
} else o = 0;
|
|
4833
4838
|
}
|
|
4834
4839
|
return o;
|
|
4835
4840
|
}
|
|
4836
|
-
function
|
|
4841
|
+
function Gs(t) {
|
|
4837
4842
|
return t <= 0 ? NaN : Math.log(t);
|
|
4838
4843
|
}
|
|
4839
|
-
function
|
|
4844
|
+
function Hs(t, n) {
|
|
4840
4845
|
if (t <= 0) return NaN;
|
|
4841
4846
|
if (void 0 === n) return Math.log10(t);
|
|
4842
4847
|
if (1 === n) throw c.BuiltIn.Div0;
|
|
4843
4848
|
return n <= 0 ? NaN : Math.log(t) / Math.log(n);
|
|
4844
4849
|
}
|
|
4845
|
-
function
|
|
4850
|
+
function Ys(t) {
|
|
4846
4851
|
return t <= 0 ? NaN : Math.log10(t);
|
|
4847
4852
|
}
|
|
4848
|
-
var
|
|
4853
|
+
var zs = (t) => {
|
|
4849
4854
|
const n = t.getValues();
|
|
4850
4855
|
for (const t of n) for (const n of t) if ("number" != typeof n) return c.isError(n) ? n : c.BuiltIn.Value;
|
|
4851
4856
|
return n;
|
|
4852
4857
|
};
|
|
4853
|
-
function
|
|
4858
|
+
function Ks(t) {
|
|
4854
4859
|
if (t.hasError()) return t.firstError();
|
|
4855
4860
|
const { rows: n, columns: e } = t.getShape();
|
|
4856
4861
|
if (n !== e) return c.BuiltIn.Value;
|
|
4857
|
-
const r =
|
|
4862
|
+
const r = zs(t);
|
|
4858
4863
|
return Array.isArray(r) ? ((t) => {
|
|
4859
|
-
const { lu: n, sign: e, singular: r } =
|
|
4864
|
+
const { lu: n, sign: e, singular: r } = ms(t);
|
|
4860
4865
|
if (r) return 0;
|
|
4861
4866
|
let o = e;
|
|
4862
4867
|
for (let t = 0; t < n.length; t++) o = Et(o * n[t][t]);
|
|
4863
4868
|
return Number.isFinite(o) ? o : NaN;
|
|
4864
4869
|
})(r) : r;
|
|
4865
4870
|
}
|
|
4866
|
-
function
|
|
4871
|
+
function Ws(t) {
|
|
4867
4872
|
if (t.hasError()) return t.firstError();
|
|
4868
4873
|
const { rows: n, columns: e } = t.getShape();
|
|
4869
4874
|
if (n !== e) return c.BuiltIn.Value;
|
|
4870
|
-
const r =
|
|
4875
|
+
const r = zs(t);
|
|
4871
4876
|
if (!Array.isArray(r)) return r;
|
|
4872
4877
|
const o = ((t) => {
|
|
4873
|
-
const n = t.length, { lu: e, perm: r, singular: o } =
|
|
4878
|
+
const n = t.length, { lu: e, perm: r, singular: o } = ms(t);
|
|
4874
4879
|
if (o) return null;
|
|
4875
4880
|
const u = Array.from({ length: n }, () => new Array(n).fill(0));
|
|
4876
4881
|
for (let t = 0; t < n; t++) {
|
|
@@ -4890,10 +4895,10 @@ function Ks(t) {
|
|
|
4890
4895
|
})(r);
|
|
4891
4896
|
return null === o ? c.BuiltIn.Num : o;
|
|
4892
4897
|
}
|
|
4893
|
-
function
|
|
4894
|
-
const e =
|
|
4898
|
+
function Qs(t, n) {
|
|
4899
|
+
const e = zs(t);
|
|
4895
4900
|
if (!Array.isArray(e)) return e;
|
|
4896
|
-
const r =
|
|
4901
|
+
const r = zs(n);
|
|
4897
4902
|
if (!Array.isArray(r)) return r;
|
|
4898
4903
|
const { rows: o, columns: u } = t.getShape(), { rows: i, columns: s } = n.getShape();
|
|
4899
4904
|
if (u !== i) return c.BuiltIn.Value;
|
|
@@ -4909,23 +4914,23 @@ function Ws(t, n) {
|
|
|
4909
4914
|
}
|
|
4910
4915
|
return l;
|
|
4911
4916
|
}
|
|
4912
|
-
function
|
|
4917
|
+
function Zs(t, n) {
|
|
4913
4918
|
if (0 === Et(n)) throw c.BuiltIn.Div0;
|
|
4914
4919
|
if (0 !== t && 0 === Et(t)) return NaN;
|
|
4915
|
-
if (Math.abs(t / n) >
|
|
4920
|
+
if (Math.abs(t / n) > Js) return NaN;
|
|
4916
4921
|
let e = t % n;
|
|
4917
4922
|
return 0 !== e && e < 0 != n < 0 && (e += n), e === n ? 0 : e;
|
|
4918
4923
|
}
|
|
4919
|
-
var
|
|
4920
|
-
function
|
|
4924
|
+
var Js = 1099511627776;
|
|
4925
|
+
function tl(t) {
|
|
4921
4926
|
if (void 0 === t) throw c.BuiltIn.NA;
|
|
4922
4927
|
if (null === t) return 0;
|
|
4923
4928
|
if ("boolean" == typeof t) throw c.BuiltIn.Value;
|
|
4924
4929
|
if (c.isError(t)) throw t;
|
|
4925
4930
|
return l.parseAsNumber(t);
|
|
4926
4931
|
}
|
|
4927
|
-
function
|
|
4928
|
-
const e =
|
|
4932
|
+
function nl(t, n) {
|
|
4933
|
+
const e = tl(t), r = tl(n);
|
|
4929
4934
|
if (0 === r) return 0;
|
|
4930
4935
|
if (e > 0 && r < 0 || e < 0 && r > 0) return NaN;
|
|
4931
4936
|
const o = e / r;
|
|
@@ -4933,8 +4938,8 @@ function tl(t, n) {
|
|
|
4933
4938
|
const u = Math.floor(o);
|
|
4934
4939
|
return (o - u >= .499999999999995 ? u + 1 : u) * r;
|
|
4935
4940
|
}
|
|
4936
|
-
function
|
|
4937
|
-
|
|
4941
|
+
function el(t) {
|
|
4942
|
+
Hl(t);
|
|
4938
4943
|
const n = [];
|
|
4939
4944
|
let e = 0;
|
|
4940
4945
|
const r = t.length;
|
|
@@ -4946,10 +4951,10 @@ function nl(t) {
|
|
|
4946
4951
|
}
|
|
4947
4952
|
if (e > 170) return NaN;
|
|
4948
4953
|
let o = 1;
|
|
4949
|
-
for (let t = 0; t < n.length; t++) o *=
|
|
4950
|
-
return
|
|
4954
|
+
for (let t = 0; t < n.length; t++) o *= Ms(n[t]);
|
|
4955
|
+
return Ms(e) / o;
|
|
4951
4956
|
}
|
|
4952
|
-
function
|
|
4957
|
+
function rl(t) {
|
|
4953
4958
|
const n = Math.trunc(t);
|
|
4954
4959
|
if (n <= 0) return c.BuiltIn.Value;
|
|
4955
4960
|
const e = l.getEntireCoords();
|
|
@@ -4958,12 +4963,12 @@ function el(t) {
|
|
|
4958
4963
|
for (let t = 0; t < n; t++) r.pushAt(t, t, 1);
|
|
4959
4964
|
return r.build();
|
|
4960
4965
|
}
|
|
4961
|
-
function
|
|
4966
|
+
function ol(t) {
|
|
4962
4967
|
if (0 === t) return 1;
|
|
4963
4968
|
let n = Math.ceil(Math.abs(t));
|
|
4964
4969
|
return n = 1 & n ? n : n + 1, t > 0 ? n : -n;
|
|
4965
4970
|
}
|
|
4966
|
-
function
|
|
4971
|
+
function ul(t, n) {
|
|
4967
4972
|
t = l.flattenAreas(t), n = l.flattenAreas(n);
|
|
4968
4973
|
const e = l.getArgs(), r = [t, n];
|
|
4969
4974
|
for (let t = 0; t < 2; t++) if (r[t].hasError()) {
|
|
@@ -4974,41 +4979,41 @@ function ol(t, n) {
|
|
|
4974
4979
|
if (0 === Et(u)) throw c.BuiltIn.Div0;
|
|
4975
4980
|
return Et(o / u);
|
|
4976
4981
|
}
|
|
4977
|
-
function
|
|
4982
|
+
function il() {
|
|
4978
4983
|
return Math.PI;
|
|
4979
4984
|
}
|
|
4980
|
-
var
|
|
4981
|
-
function
|
|
4985
|
+
var sl = 4294967294;
|
|
4986
|
+
function ll(t, n) {
|
|
4982
4987
|
if (0 === t) {
|
|
4983
4988
|
if (n < 0) throw c.BuiltIn.Div0;
|
|
4984
4989
|
if (0 === n) return NaN;
|
|
4985
4990
|
}
|
|
4986
4991
|
return t < 0 ? function(t, n) {
|
|
4987
|
-
if (Number.isInteger(n) && Math.abs(n) <=
|
|
4992
|
+
if (Number.isInteger(n) && Math.abs(n) <= sl) return t ** n;
|
|
4988
4993
|
const e = Number((1 / n).toPrecision(15));
|
|
4989
4994
|
return Number.isInteger(e) && 1 === Math.abs(e % 2) ? -((-t) ** n) : NaN;
|
|
4990
4995
|
}(t, n) : t ** n;
|
|
4991
4996
|
}
|
|
4992
|
-
function
|
|
4997
|
+
function al(t) {
|
|
4993
4998
|
let n = 0, e = !1;
|
|
4994
4999
|
for (const r of t) for (const t of r.values()) n = e ? Et(n * t) : t, e = !0;
|
|
4995
5000
|
return e ? n : 0;
|
|
4996
5001
|
}
|
|
4997
|
-
function
|
|
4998
|
-
const e =
|
|
5002
|
+
function fl(t, n) {
|
|
5003
|
+
const e = tl(t), r = tl(n);
|
|
4999
5004
|
if (0 === r) throw c.BuiltIn.Div0;
|
|
5000
5005
|
return Math.trunc(e / r);
|
|
5001
5006
|
}
|
|
5002
|
-
function
|
|
5007
|
+
function cl(t) {
|
|
5003
5008
|
return t * (Math.PI / 180);
|
|
5004
5009
|
}
|
|
5005
|
-
function
|
|
5010
|
+
function hl() {
|
|
5006
5011
|
return l.getRandom();
|
|
5007
5012
|
}
|
|
5008
|
-
function
|
|
5009
|
-
const u =
|
|
5013
|
+
function ml(t = 1, n = 1, e = 0, r = 1, o = !1) {
|
|
5014
|
+
const u = dl(t);
|
|
5010
5015
|
if ("number" != typeof u) return u;
|
|
5011
|
-
const i =
|
|
5016
|
+
const i = dl(n);
|
|
5012
5017
|
if ("number" != typeof i) return i;
|
|
5013
5018
|
const s = !0 === o;
|
|
5014
5019
|
return e > r ? c.BuiltIn.Value : !s || e === Math.trunc(e) && r === Math.trunc(r) ? l.createRange(u, i, () => {
|
|
@@ -5017,39 +5022,39 @@ function hl(t = 1, n = 1, e = 0, r = 1, o = !1) {
|
|
|
5017
5022
|
return t > r ? r : t;
|
|
5018
5023
|
}) : c.BuiltIn.Value;
|
|
5019
5024
|
}
|
|
5020
|
-
function
|
|
5021
|
-
const e =
|
|
5025
|
+
function gl(t, n) {
|
|
5026
|
+
const e = tl(n), r = tl(t);
|
|
5022
5027
|
if (r > e) return NaN;
|
|
5023
5028
|
const o = Math.ceil(Et(r)), u = Math.ceil(Et(e));
|
|
5024
5029
|
return o + Math.floor(l.getRandom() * (u - o + 1));
|
|
5025
5030
|
}
|
|
5026
|
-
function
|
|
5031
|
+
function Nl(t, n = 0) {
|
|
5027
5032
|
const e = "boolean" == typeof n ? n ? 0 : 4 : Math.trunc(null === n ? 0 : l.parseAsNumber(n));
|
|
5028
5033
|
if ((t = Math.trunc(t)) < 0 || t > 3999) return c.BuiltIn.Value;
|
|
5029
5034
|
if (e < 0 || e > 4) return c.BuiltIn.Value;
|
|
5030
5035
|
if (0 === t) return "";
|
|
5031
5036
|
let r = t, o = "";
|
|
5032
|
-
for (let t = 0; t <=
|
|
5037
|
+
for (let t = 0; t <= $l / 2; t++) {
|
|
5033
5038
|
let n = 2 * t;
|
|
5034
|
-
const u = Math.floor(r /
|
|
5039
|
+
const u = Math.floor(r / kl[n]);
|
|
5035
5040
|
if (u % 5 == 4) {
|
|
5036
5041
|
let t = 4 === u ? n - 1 : n - 2, i = 0;
|
|
5037
|
-
for (; i < e && n <
|
|
5038
|
-
o +=
|
|
5042
|
+
for (; i < e && n < $l;) i++, kl[t] - kl[n + 1] <= r ? n++ : i = e;
|
|
5043
|
+
o += Ul[n] + Ul[t], r = r + kl[n] - kl[t];
|
|
5039
5044
|
} else {
|
|
5040
|
-
u > 4 && (o +=
|
|
5041
|
-
let t = Math.floor(r /
|
|
5042
|
-
for (r -= t *
|
|
5045
|
+
u > 4 && (o += Ul[n - 1], r -= kl[n - 1]);
|
|
5046
|
+
let t = Math.floor(r / kl[n]);
|
|
5047
|
+
for (r -= t * kl[n]; t > 0; t--) o += Ul[n];
|
|
5043
5048
|
}
|
|
5044
5049
|
}
|
|
5045
5050
|
return o;
|
|
5046
5051
|
}
|
|
5047
|
-
function
|
|
5052
|
+
function Il(t, n) {
|
|
5048
5053
|
const e = bt(n);
|
|
5049
|
-
if (e >=
|
|
5054
|
+
if (e >= Ll) return 0;
|
|
5050
5055
|
const r = t > 0 ? 1 : -1, o = Math.abs(t);
|
|
5051
5056
|
if (0 === e) return r * Math.round(yt(o));
|
|
5052
|
-
const u =
|
|
5057
|
+
const u = _l(e);
|
|
5053
5058
|
if (void 0 === u) return e > 0 ? t : 0;
|
|
5054
5059
|
if (e > 0) {
|
|
5055
5060
|
const n = yt(yt(o) * u);
|
|
@@ -5057,10 +5062,10 @@ function Nl(t, n) {
|
|
|
5057
5062
|
}
|
|
5058
5063
|
return r * Math.round(yt(o / u)) * u;
|
|
5059
5064
|
}
|
|
5060
|
-
function
|
|
5061
|
-
const e =
|
|
5065
|
+
function pl(t, n) {
|
|
5066
|
+
const e = Pl(n), r = t > 0 ? 1 : -1, o = Math.abs(t);
|
|
5062
5067
|
if (0 === e) return r * Math.floor(yt(o));
|
|
5063
|
-
const u =
|
|
5068
|
+
const u = _l(e);
|
|
5064
5069
|
if (void 0 === u) return e > 0 ? t : 0;
|
|
5065
5070
|
if (e > 0) {
|
|
5066
5071
|
const n = yt(yt(o) * u);
|
|
@@ -5068,22 +5073,22 @@ function Il(t, n) {
|
|
|
5068
5073
|
}
|
|
5069
5074
|
return r * Math.floor(yt(o / u)) * u;
|
|
5070
5075
|
}
|
|
5071
|
-
function
|
|
5072
|
-
const e =
|
|
5076
|
+
function Ml(t, n) {
|
|
5077
|
+
const e = Pl(n), r = pl(t, e);
|
|
5073
5078
|
if (r === yt(t)) return r;
|
|
5074
5079
|
const o = r + Math.sign(t) * Math.pow(10, -e);
|
|
5075
5080
|
return Number.isFinite(o) ? o : NaN;
|
|
5076
5081
|
}
|
|
5077
|
-
var
|
|
5082
|
+
var dl = (t) => {
|
|
5078
5083
|
if (t <= -1.1920928955078125e-7) return c.BuiltIn.Value;
|
|
5079
5084
|
const n = Math.trunc(yt(t));
|
|
5080
5085
|
return n <= 0 ? c.BuiltIn.Calc : n > l.getEntireCoords().rowEnd + 1 ? c.BuiltIn.Value : n;
|
|
5081
5086
|
};
|
|
5082
|
-
function
|
|
5087
|
+
function wl(t, n = 1, e = 1, r = 1) {
|
|
5083
5088
|
t ??= 1;
|
|
5084
|
-
const o =
|
|
5089
|
+
const o = dl(t);
|
|
5085
5090
|
if ("number" != typeof o) return o;
|
|
5086
|
-
const u =
|
|
5091
|
+
const u = dl(n);
|
|
5087
5092
|
if ("number" != typeof u) return u;
|
|
5088
5093
|
let i = e;
|
|
5089
5094
|
return l.createRange(o, u, () => {
|
|
@@ -5091,43 +5096,43 @@ function dl(t, n = 1, e = 1, r = 1) {
|
|
|
5091
5096
|
return i += r, t;
|
|
5092
5097
|
});
|
|
5093
5098
|
}
|
|
5094
|
-
function
|
|
5095
|
-
const o =
|
|
5099
|
+
function Al(t, n, e, r) {
|
|
5100
|
+
const o = tl(t), u = tl(n), i = tl(e);
|
|
5096
5101
|
if (void 0 === r) throw c.BuiltIn.NA;
|
|
5097
5102
|
if (c.isError(r)) throw r;
|
|
5098
5103
|
const s = l.getArgs().getRawAt(3), a = s, f = !0 === a?.isIRange, h = f && 1 === a.size && !0 === a.isIReferenceRange;
|
|
5099
5104
|
if (!f || h) {
|
|
5100
5105
|
const t = f ? a.getValueAt(0, 0) ?? null : s;
|
|
5101
|
-
return (null === t ? 0 : l.parseAsNumber(t)) *
|
|
5106
|
+
return (null === t ? 0 : l.parseAsNumber(t)) * El(o, u);
|
|
5102
5107
|
}
|
|
5103
5108
|
let m = 0, g = 0;
|
|
5104
|
-
for (const t of r.values(
|
|
5109
|
+
for (const t of r.values(Wl)) if (null !== t) {
|
|
5105
5110
|
if (c.isError(t)) throw t;
|
|
5106
5111
|
if ("number" != typeof t) throw c.BuiltIn.Value;
|
|
5107
|
-
m += t *
|
|
5112
|
+
m += t * El(o, u + g * i), g++;
|
|
5108
5113
|
}
|
|
5109
5114
|
return m;
|
|
5110
5115
|
}
|
|
5111
|
-
var
|
|
5116
|
+
var El = (t, n) => {
|
|
5112
5117
|
if (0 === t && n <= 0) throw c.BuiltIn.Num;
|
|
5113
5118
|
const e = Math.pow(t, n);
|
|
5114
5119
|
if (Number.isNaN(e)) return 0;
|
|
5115
5120
|
if (!Number.isFinite(e)) throw c.BuiltIn.Num;
|
|
5116
5121
|
return e;
|
|
5117
5122
|
};
|
|
5118
|
-
function
|
|
5123
|
+
function Bl(t) {
|
|
5119
5124
|
const n = Et(t);
|
|
5120
5125
|
return n > 0 ? 1 : 0 === n ? 0 : -1;
|
|
5121
5126
|
}
|
|
5122
|
-
function
|
|
5127
|
+
function bl(t) {
|
|
5123
5128
|
return Math.sqrt(t);
|
|
5124
5129
|
}
|
|
5125
|
-
function
|
|
5126
|
-
const n =
|
|
5130
|
+
function Cl(t) {
|
|
5131
|
+
const n = tl(t);
|
|
5127
5132
|
return n < 0 ? NaN : Math.sqrt(n * Math.PI);
|
|
5128
5133
|
}
|
|
5129
|
-
function
|
|
5130
|
-
const e = Math.trunc(t), r = e >= 101, o = r ? e - 100 : e, u = r ? void 0 :
|
|
5134
|
+
function yl(t, n) {
|
|
5135
|
+
const e = Math.trunc(t), r = e >= 101, o = r ? e - 100 : e, u = r ? void 0 : Kl;
|
|
5131
5136
|
let i = n.map((t) => l.filterHidden(t, u)).map((t) => l.filterTotals(t));
|
|
5132
5137
|
if (2 !== o && 3 !== o) {
|
|
5133
5138
|
for (const t of i) if (t.hasError()) return t.firstError();
|
|
@@ -5165,7 +5170,7 @@ function Cl(t, n) {
|
|
|
5165
5170
|
default: return c.BuiltIn.Value;
|
|
5166
5171
|
}
|
|
5167
5172
|
}
|
|
5168
|
-
function
|
|
5173
|
+
function Rl(t) {
|
|
5169
5174
|
let n = 0, e = null;
|
|
5170
5175
|
for (const r of t) {
|
|
5171
5176
|
const t = r.getStats(), o = t.getAggregates();
|
|
@@ -5173,13 +5178,13 @@ function yl(t) {
|
|
|
5173
5178
|
}
|
|
5174
5179
|
return e ? e.getSnappedSum(n) : n;
|
|
5175
5180
|
}
|
|
5176
|
-
function
|
|
5177
|
-
return
|
|
5181
|
+
function vl(t, n, e) {
|
|
5182
|
+
return Bu(t, n, e, Ns((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Cu);
|
|
5178
5183
|
}
|
|
5179
|
-
function
|
|
5180
|
-
return
|
|
5184
|
+
function Sl(t, n) {
|
|
5185
|
+
return gs(l, n, Ns((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, 0, Cu);
|
|
5181
5186
|
}
|
|
5182
|
-
function
|
|
5187
|
+
function xl(t) {
|
|
5183
5188
|
const n = l.getArgs().getRepeatingArgsAt(0);
|
|
5184
5189
|
for (let t = 0, e = n.getLength(); t < e; t++) {
|
|
5185
5190
|
const e = n.getRawAt(t);
|
|
@@ -5200,26 +5205,26 @@ function Sl(t) {
|
|
|
5200
5205
|
for (const n of e.values()) "number" == typeof n && (t += n);
|
|
5201
5206
|
return t;
|
|
5202
5207
|
}
|
|
5203
|
-
return
|
|
5208
|
+
return Gl(e, r, ql);
|
|
5204
5209
|
}
|
|
5205
|
-
function
|
|
5210
|
+
function Tl(t) {
|
|
5206
5211
|
let n = 0;
|
|
5207
5212
|
for (const e of t) for (const t of e.values()) n += Et(t ** 2);
|
|
5208
5213
|
return n;
|
|
5209
5214
|
}
|
|
5210
|
-
function Tl(t, n) {
|
|
5211
|
-
return Yl(t, n, (t, n) => Et(t ** 2) - Et(n ** 2));
|
|
5212
|
-
}
|
|
5213
5215
|
function Dl(t, n) {
|
|
5214
|
-
return
|
|
5216
|
+
return zl(t, n, (t, n) => Et(t ** 2) - Et(n ** 2));
|
|
5215
5217
|
}
|
|
5216
5218
|
function Vl(t, n) {
|
|
5217
|
-
return
|
|
5219
|
+
return zl(t, n, (t, n) => Et(t ** 2) + Et(n ** 2));
|
|
5218
5220
|
}
|
|
5219
|
-
function Fl(t, n
|
|
5220
|
-
|
|
5221
|
+
function Fl(t, n) {
|
|
5222
|
+
return zl(t, n, (t, n) => Et((t - n) ** 2));
|
|
5223
|
+
}
|
|
5224
|
+
function Ol(t, n = 0) {
|
|
5225
|
+
const e = Pl(n);
|
|
5221
5226
|
if (0 === e) return Math.trunc(yt(t));
|
|
5222
|
-
const r =
|
|
5227
|
+
const r = _l(e);
|
|
5223
5228
|
if (void 0 === r) return e > 0 ? t : 0;
|
|
5224
5229
|
if (e > 0) {
|
|
5225
5230
|
const n = yt(yt(t) * r);
|
|
@@ -5227,10 +5232,10 @@ function Fl(t, n = 0) {
|
|
|
5227
5232
|
}
|
|
5228
5233
|
return Math.trunc(yt(t / r)) * r;
|
|
5229
5234
|
}
|
|
5230
|
-
var
|
|
5235
|
+
var Pl = (t) => Math.trunc(t), Ll = 2147483646, _l = (t) => {
|
|
5231
5236
|
const n = Math.pow(10, Math.abs(t));
|
|
5232
5237
|
return Number.isFinite(n) ? n : void 0;
|
|
5233
|
-
},
|
|
5238
|
+
}, Ul = [
|
|
5234
5239
|
"M",
|
|
5235
5240
|
"D",
|
|
5236
5241
|
"C",
|
|
@@ -5238,7 +5243,7 @@ var Ol = (t) => Math.trunc(t), Pl = 2147483646, Ll = (t) => {
|
|
|
5238
5243
|
"X",
|
|
5239
5244
|
"V",
|
|
5240
5245
|
"I"
|
|
5241
|
-
],
|
|
5246
|
+
], kl = [
|
|
5242
5247
|
1e3,
|
|
5243
5248
|
500,
|
|
5244
5249
|
100,
|
|
@@ -5246,246 +5251,246 @@ var Ol = (t) => Math.trunc(t), Pl = 2147483646, Ll = (t) => {
|
|
|
5246
5251
|
10,
|
|
5247
5252
|
5,
|
|
5248
5253
|
1
|
|
5249
|
-
],
|
|
5254
|
+
], $l = kl.length - 1, jl = Object.fromEntries(Ul.map((t, n) => [t, kl[n]])), Xl = 255, ql = (t) => {
|
|
5250
5255
|
let n = t[0];
|
|
5251
5256
|
const e = t.length;
|
|
5252
5257
|
for (let r = 1; r < e; r++) n = Et(n * t[r]);
|
|
5253
5258
|
return n;
|
|
5254
|
-
},
|
|
5259
|
+
}, Gl = (t, n, e) => t.alignReduce(n, (t, n) => {
|
|
5255
5260
|
const r = n.length;
|
|
5256
5261
|
for (let e = 0; e < r; e++) if ("number" != typeof n[e]) return t;
|
|
5257
5262
|
return t + e(n);
|
|
5258
|
-
}, 0),
|
|
5263
|
+
}, 0), Hl = (t) => {
|
|
5259
5264
|
if (l.getArgs().getRepeatingArgsAt(0).getKindAt(0) === u.Omitted) throw c.BuiltIn.NA;
|
|
5260
5265
|
if (0 === t.length) throw c.BuiltIn.Value;
|
|
5261
|
-
},
|
|
5266
|
+
}, Yl = (t, n) => {
|
|
5262
5267
|
if (1 !== t.getRowCount() || 1 !== t.getColumnCount()) return;
|
|
5263
5268
|
if (l.getArgs().getKindAt(n) === u.Array) return;
|
|
5264
5269
|
const e = t.getValueAt(0, 0);
|
|
5265
5270
|
if (null === e) throw c.BuiltIn.Value;
|
|
5266
5271
|
if (c.isError(e)) throw e;
|
|
5267
|
-
},
|
|
5268
|
-
|
|
5272
|
+
}, zl = (t, n, e) => {
|
|
5273
|
+
Yl(t, 0), Yl(n, 1);
|
|
5269
5274
|
const r = t.getRowCount(), o = t.getColumnCount();
|
|
5270
5275
|
if (r * o !== n.getRowCount() * n.getColumnCount()) throw c.BuiltIn.NA;
|
|
5271
5276
|
r === n.getRowCount() && o === n.getColumnCount() || (n = n.reshape(r, o));
|
|
5272
|
-
for (const n of t.values(
|
|
5273
|
-
for (const t of n.values(
|
|
5277
|
+
for (const n of t.values(Wl)) if (c.isError(n)) throw Is(n);
|
|
5278
|
+
for (const t of n.values(Wl)) if (c.isError(t)) throw Is(t);
|
|
5274
5279
|
let u = 0;
|
|
5275
5280
|
const i = t.alignReduce([n], (t, n) => "number" != typeof n[0] || "number" != typeof n[1] ? t : (u++, t + e(n[0], n[1])), 0);
|
|
5276
5281
|
if (0 === u) throw c.BuiltIn.Div0;
|
|
5277
5282
|
return i;
|
|
5278
|
-
},
|
|
5279
|
-
ACOS: () =>
|
|
5280
|
-
ACOSH: () =>
|
|
5281
|
-
ACOT: () =>
|
|
5282
|
-
ACOTH: () =>
|
|
5283
|
-
ASIN: () =>
|
|
5284
|
-
ASINH: () =>
|
|
5285
|
-
ATAN: () =>
|
|
5286
|
-
ATAN2: () =>
|
|
5287
|
-
ATANH: () =>
|
|
5288
|
-
COS: () =>
|
|
5289
|
-
COSH: () =>
|
|
5290
|
-
COT: () =>
|
|
5291
|
-
COTH: () =>
|
|
5292
|
-
CSC: () =>
|
|
5293
|
-
CSCH: () =>
|
|
5294
|
-
SEC: () =>
|
|
5295
|
-
SECH: () =>
|
|
5296
|
-
SIN: () =>
|
|
5297
|
-
SINH: () =>
|
|
5298
|
-
TAN: () =>
|
|
5299
|
-
TANH: () =>
|
|
5283
|
+
}, Kl = { onlyWhileFiltered: !0 }, Wl = { axis: f.Axis.Row }, Ql = 9007199254740992, Zl = At({
|
|
5284
|
+
ACOS: () => Jl,
|
|
5285
|
+
ACOSH: () => ta,
|
|
5286
|
+
ACOT: () => na,
|
|
5287
|
+
ACOTH: () => ea,
|
|
5288
|
+
ASIN: () => ra,
|
|
5289
|
+
ASINH: () => oa,
|
|
5290
|
+
ATAN: () => ua,
|
|
5291
|
+
ATAN2: () => ia,
|
|
5292
|
+
ATANH: () => sa,
|
|
5293
|
+
COS: () => la,
|
|
5294
|
+
COSH: () => aa,
|
|
5295
|
+
COT: () => fa,
|
|
5296
|
+
COTH: () => ca,
|
|
5297
|
+
CSC: () => ha,
|
|
5298
|
+
CSCH: () => ma,
|
|
5299
|
+
SEC: () => ga,
|
|
5300
|
+
SECH: () => Na,
|
|
5301
|
+
SIN: () => Ia,
|
|
5302
|
+
SINH: () => pa,
|
|
5303
|
+
TAN: () => Ma,
|
|
5304
|
+
TANH: () => da
|
|
5300
5305
|
});
|
|
5301
|
-
function
|
|
5306
|
+
function Jl(t) {
|
|
5302
5307
|
return t > 1 || t < -1 ? NaN : Math.PI / 2 - Math.asin(t);
|
|
5303
5308
|
}
|
|
5304
|
-
function
|
|
5309
|
+
function ta(t) {
|
|
5305
5310
|
return t < 1 ? NaN : Math.log(t + Math.sqrt(t * t - 1));
|
|
5306
5311
|
}
|
|
5307
|
-
function
|
|
5312
|
+
function na(t) {
|
|
5308
5313
|
const n = Math.atan(Et(1 / t));
|
|
5309
5314
|
return t < 0 ? Math.PI + n : n;
|
|
5310
5315
|
}
|
|
5311
|
-
function
|
|
5316
|
+
function ea(t) {
|
|
5312
5317
|
return Math.abs(t) <= 1 ? NaN : Math.abs(t) <= 2 ? Math.log((t + 1) / (t - 1)) / 2 : Ct(Et(1 / t));
|
|
5313
5318
|
}
|
|
5314
|
-
function
|
|
5319
|
+
function ra(t) {
|
|
5315
5320
|
return t > 1 || t < -1 ? NaN : Math.asin(t);
|
|
5316
5321
|
}
|
|
5317
|
-
function
|
|
5322
|
+
function oa(t) {
|
|
5318
5323
|
const n = Math.abs(t), e = Math.log(n + Math.sqrt(n * n + 1));
|
|
5319
5324
|
return t < 0 ? -e : e;
|
|
5320
5325
|
}
|
|
5321
|
-
function
|
|
5326
|
+
function ua(t) {
|
|
5322
5327
|
return Math.atan(t);
|
|
5323
5328
|
}
|
|
5324
|
-
function
|
|
5329
|
+
function ia(t, n) {
|
|
5325
5330
|
if (0 === n && 0 === t) throw c.BuiltIn.Div0;
|
|
5326
5331
|
const e = n / t;
|
|
5327
5332
|
if (0 !== t && !Number.isFinite(e)) return NaN;
|
|
5328
5333
|
const r = Math.atan(e);
|
|
5329
5334
|
return t >= 0 ? r : n >= 0 ? r + Math.PI : r - Math.PI;
|
|
5330
5335
|
}
|
|
5331
|
-
function ia(t) {
|
|
5332
|
-
return Math.abs(t) >= 1 ? NaN : Ct(t);
|
|
5333
|
-
}
|
|
5334
5336
|
function sa(t) {
|
|
5335
|
-
return Math.abs(t) >=
|
|
5337
|
+
return Math.abs(t) >= 1 ? NaN : Ct(t);
|
|
5336
5338
|
}
|
|
5337
5339
|
function la(t) {
|
|
5338
|
-
return
|
|
5340
|
+
return Math.abs(t) >= hr ? NaN : dr(t);
|
|
5339
5341
|
}
|
|
5340
5342
|
function aa(t) {
|
|
5341
|
-
|
|
5342
|
-
if (0 === t) throw c.BuiltIn.Div0;
|
|
5343
|
-
return 1 / dr(t);
|
|
5343
|
+
return Number.isFinite(Math.exp(Math.abs(t))) ? Math.cosh(t) : NaN;
|
|
5344
5344
|
}
|
|
5345
5345
|
function fa(t) {
|
|
5346
|
+
if (Math.abs(t) >= hr) return NaN;
|
|
5346
5347
|
if (0 === t) throw c.BuiltIn.Div0;
|
|
5347
|
-
return
|
|
5348
|
+
return 1 / wr(t);
|
|
5348
5349
|
}
|
|
5349
5350
|
function ca(t) {
|
|
5350
|
-
if (Math.abs(t) >= cr) return NaN;
|
|
5351
5351
|
if (0 === t) throw c.BuiltIn.Div0;
|
|
5352
|
-
return 1 /
|
|
5352
|
+
return Et(1 / Math.tanh(t));
|
|
5353
5353
|
}
|
|
5354
5354
|
function ha(t) {
|
|
5355
|
+
if (Math.abs(t) >= hr) return NaN;
|
|
5355
5356
|
if (0 === t) throw c.BuiltIn.Div0;
|
|
5356
|
-
return
|
|
5357
|
+
return 1 / Mr(t);
|
|
5357
5358
|
}
|
|
5358
5359
|
function ma(t) {
|
|
5359
|
-
|
|
5360
|
+
if (0 === t) throw c.BuiltIn.Div0;
|
|
5361
|
+
return Et(1 / Math.sinh(t));
|
|
5360
5362
|
}
|
|
5361
5363
|
function ga(t) {
|
|
5362
|
-
return
|
|
5364
|
+
return Math.abs(t) >= hr ? NaN : 1 / dr(t);
|
|
5363
5365
|
}
|
|
5364
5366
|
function Na(t) {
|
|
5365
|
-
return
|
|
5367
|
+
return Et(1 / Math.cosh(t));
|
|
5366
5368
|
}
|
|
5367
5369
|
function Ia(t) {
|
|
5368
|
-
return
|
|
5370
|
+
return Math.abs(t) >= hr ? NaN : Mr(t);
|
|
5369
5371
|
}
|
|
5370
5372
|
function pa(t) {
|
|
5371
|
-
return Math.abs(t)
|
|
5373
|
+
return Number.isFinite(Math.exp(Math.abs(t))) ? Math.sinh(t) : NaN;
|
|
5372
5374
|
}
|
|
5373
5375
|
function Ma(t) {
|
|
5374
|
-
return Math.
|
|
5376
|
+
return Math.abs(t) >= hr ? NaN : wr(t);
|
|
5375
5377
|
}
|
|
5376
|
-
|
|
5377
|
-
|
|
5378
|
-
DIVIDE: () => Ea,
|
|
5379
|
-
EQ: () => Ba,
|
|
5380
|
-
GT: () => ba,
|
|
5381
|
-
GTE: () => Ca,
|
|
5382
|
-
ISBETWEEN: () => Oa,
|
|
5383
|
-
LT: () => ya,
|
|
5384
|
-
LTE: () => Ra,
|
|
5385
|
-
MINUS: () => va,
|
|
5386
|
-
MULTIPLY: () => Sa,
|
|
5387
|
-
NE: () => xa,
|
|
5388
|
-
POW: () => Ta,
|
|
5389
|
-
UMINUS: () => Da,
|
|
5390
|
-
UNARY_PERCENT: () => Va,
|
|
5391
|
-
UPLUS: () => Fa
|
|
5392
|
-
}), wa = (t) => t > -22250738585072014e-324 && t < 22250738585072014e-324 ? 0 : t;
|
|
5393
|
-
function Aa(t, n) {
|
|
5394
|
-
return t + n;
|
|
5378
|
+
function da(t) {
|
|
5379
|
+
return Math.tanh(t);
|
|
5395
5380
|
}
|
|
5381
|
+
var wa = At({
|
|
5382
|
+
ADD: () => Ea,
|
|
5383
|
+
DIVIDE: () => Ba,
|
|
5384
|
+
EQ: () => ba,
|
|
5385
|
+
GT: () => Ca,
|
|
5386
|
+
GTE: () => ya,
|
|
5387
|
+
ISBETWEEN: () => Pa,
|
|
5388
|
+
LT: () => Ra,
|
|
5389
|
+
LTE: () => va,
|
|
5390
|
+
MINUS: () => Sa,
|
|
5391
|
+
MULTIPLY: () => xa,
|
|
5392
|
+
NE: () => Ta,
|
|
5393
|
+
POW: () => Da,
|
|
5394
|
+
UMINUS: () => Va,
|
|
5395
|
+
UNARY_PERCENT: () => Fa,
|
|
5396
|
+
UPLUS: () => Oa
|
|
5397
|
+
}), Aa = (t) => t > -22250738585072014e-324 && t < 22250738585072014e-324 ? 0 : t;
|
|
5396
5398
|
function Ea(t, n) {
|
|
5397
|
-
|
|
5398
|
-
return wa(t / n);
|
|
5399
|
+
return t + n;
|
|
5399
5400
|
}
|
|
5400
5401
|
function Ba(t, n) {
|
|
5401
|
-
|
|
5402
|
+
if (0 === Aa(n)) throw c.BuiltIn.Div0;
|
|
5403
|
+
return Aa(t / n);
|
|
5402
5404
|
}
|
|
5403
5405
|
function ba(t, n) {
|
|
5404
|
-
return l.compare(t, n)
|
|
5406
|
+
return 0 === l.compare(t, n);
|
|
5405
5407
|
}
|
|
5406
5408
|
function Ca(t, n) {
|
|
5407
|
-
return l.compare(t, n)
|
|
5409
|
+
return l.compare(t, n) > 0;
|
|
5408
5410
|
}
|
|
5409
5411
|
function ya(t, n) {
|
|
5410
|
-
return l.compare(t, n)
|
|
5412
|
+
return l.compare(t, n) >= 0;
|
|
5411
5413
|
}
|
|
5412
5414
|
function Ra(t, n) {
|
|
5413
|
-
return l.compare(t, n)
|
|
5415
|
+
return l.compare(t, n) < 0;
|
|
5414
5416
|
}
|
|
5415
5417
|
function va(t, n) {
|
|
5416
|
-
return t
|
|
5418
|
+
return l.compare(t, n) <= 0;
|
|
5417
5419
|
}
|
|
5418
5420
|
function Sa(t, n) {
|
|
5419
|
-
return
|
|
5421
|
+
return t - n;
|
|
5420
5422
|
}
|
|
5421
5423
|
function xa(t, n) {
|
|
5422
|
-
return
|
|
5424
|
+
return Aa(t * n);
|
|
5423
5425
|
}
|
|
5424
5426
|
function Ta(t, n) {
|
|
5427
|
+
return 0 !== l.compare(t, n);
|
|
5428
|
+
}
|
|
5429
|
+
function Da(t, n) {
|
|
5425
5430
|
if (0 === t) {
|
|
5426
5431
|
if (n < 0) throw c.BuiltIn.Div0;
|
|
5427
5432
|
if (0 === n) return NaN;
|
|
5428
5433
|
}
|
|
5429
5434
|
if (t < 0) {
|
|
5430
|
-
if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return
|
|
5435
|
+
if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return Aa(t ** n);
|
|
5431
5436
|
const e = Number((1 / n).toPrecision(15));
|
|
5432
|
-
return Number.isInteger(e) && 1 === Math.abs(e % 2) ?
|
|
5437
|
+
return Number.isInteger(e) && 1 === Math.abs(e % 2) ? Aa(-((-t) ** n)) : NaN;
|
|
5433
5438
|
}
|
|
5434
|
-
return
|
|
5435
|
-
}
|
|
5436
|
-
function Da(t) {
|
|
5437
|
-
return -1 * t;
|
|
5439
|
+
return Aa(t ** n);
|
|
5438
5440
|
}
|
|
5439
5441
|
function Va(t) {
|
|
5440
|
-
return
|
|
5442
|
+
return -1 * t;
|
|
5441
5443
|
}
|
|
5442
5444
|
function Fa(t) {
|
|
5445
|
+
return Ba(t, 100);
|
|
5446
|
+
}
|
|
5447
|
+
function Oa(t) {
|
|
5443
5448
|
return t;
|
|
5444
5449
|
}
|
|
5445
|
-
function
|
|
5450
|
+
function Pa(t, n, e, r = !0, o = !0) {
|
|
5446
5451
|
return (r ? t >= n : t > n) && (o ? t <= e : t < e);
|
|
5447
5452
|
}
|
|
5448
|
-
var
|
|
5449
|
-
const u =
|
|
5453
|
+
var La = (t) => !!t.isIReferenceRange, _a = (t) => Object.freeze({ coerce: (n, e, r, o) => {
|
|
5454
|
+
const u = La(o);
|
|
5450
5455
|
if (e === i.String) return u ? 0 : t;
|
|
5451
5456
|
if (e === i.Boolean) return u ? n ? 1 : 0 : null;
|
|
5452
5457
|
if (c.isError(n)) throw n;
|
|
5453
5458
|
return null;
|
|
5454
|
-
} }),
|
|
5459
|
+
} }), Ua = _a(null), ka = _a(0), $a = (t, n) => {
|
|
5455
5460
|
if ("number" == typeof t) return t;
|
|
5456
5461
|
if ("boolean" == typeof t) return n ? t ? 1 : 0 : null;
|
|
5457
5462
|
if ("string" == typeof t) return n ? 0 : null;
|
|
5458
5463
|
if (c.isError(t)) throw t;
|
|
5459
5464
|
return null;
|
|
5460
|
-
},
|
|
5461
|
-
AVEDEV: () =>
|
|
5462
|
-
AVERAGE: () =>
|
|
5463
|
-
AVERAGEA: () =>
|
|
5464
|
-
AVERAGEIF: () =>
|
|
5465
|
-
AVERAGEIFS: () =>
|
|
5466
|
-
AVERAGE_WEIGHTED: () =>
|
|
5467
|
-
COUNT: () =>
|
|
5468
|
-
COUNTA: () =>
|
|
5469
|
-
COUNTBLANK: () =>
|
|
5470
|
-
COUNTIF: () =>
|
|
5471
|
-
COUNTIFS: () =>
|
|
5472
|
-
COUNTUNIQUE: () =>
|
|
5473
|
-
COUNTUNIQUEIFS: () =>
|
|
5474
|
-
LARGE: () =>
|
|
5475
|
-
MAX: () =>
|
|
5476
|
-
MAXA: () =>
|
|
5477
|
-
MAXIF: () =>
|
|
5478
|
-
MAXIFS: () =>
|
|
5479
|
-
MEDIAN: () =>
|
|
5480
|
-
MIN: () =>
|
|
5481
|
-
MINA: () =>
|
|
5482
|
-
MINIF: () =>
|
|
5483
|
-
MINIFS: () =>
|
|
5484
|
-
PERMUT: () =>
|
|
5485
|
-
PERMUTATIONA: () =>
|
|
5486
|
-
SMALL: () =>
|
|
5465
|
+
}, ja = At({
|
|
5466
|
+
AVEDEV: () => Xa,
|
|
5467
|
+
AVERAGE: () => qa,
|
|
5468
|
+
AVERAGEA: () => Ga,
|
|
5469
|
+
AVERAGEIF: () => Ha,
|
|
5470
|
+
AVERAGEIFS: () => Ya,
|
|
5471
|
+
AVERAGE_WEIGHTED: () => za,
|
|
5472
|
+
COUNT: () => Ka,
|
|
5473
|
+
COUNTA: () => Wa,
|
|
5474
|
+
COUNTBLANK: () => Qa,
|
|
5475
|
+
COUNTIF: () => Za,
|
|
5476
|
+
COUNTIFS: () => Ja,
|
|
5477
|
+
COUNTUNIQUE: () => tf,
|
|
5478
|
+
COUNTUNIQUEIFS: () => nf,
|
|
5479
|
+
LARGE: () => ef,
|
|
5480
|
+
MAX: () => rf,
|
|
5481
|
+
MAXA: () => of,
|
|
5482
|
+
MAXIF: () => uf,
|
|
5483
|
+
MAXIFS: () => sf,
|
|
5484
|
+
MEDIAN: () => lf,
|
|
5485
|
+
MIN: () => af,
|
|
5486
|
+
MINA: () => ff,
|
|
5487
|
+
MINIF: () => cf,
|
|
5488
|
+
MINIFS: () => hf,
|
|
5489
|
+
PERMUT: () => mf,
|
|
5490
|
+
PERMUTATIONA: () => gf,
|
|
5491
|
+
SMALL: () => Nf
|
|
5487
5492
|
});
|
|
5488
|
-
function
|
|
5493
|
+
function Xa(t) {
|
|
5489
5494
|
let n = 0;
|
|
5490
5495
|
const e = [];
|
|
5491
5496
|
for (const r of t) for (const t of r.values()) n += t, e.push(t);
|
|
@@ -5496,21 +5501,21 @@ function ja(t) {
|
|
|
5496
5501
|
for (let t = 0; t < r; t++) n += Math.abs(e[t] - o);
|
|
5497
5502
|
return n / r;
|
|
5498
5503
|
}
|
|
5499
|
-
function Xa(t) {
|
|
5500
|
-
return pf(t);
|
|
5501
|
-
}
|
|
5502
5504
|
function qa(t) {
|
|
5503
|
-
return
|
|
5505
|
+
return Mf(t);
|
|
5504
5506
|
}
|
|
5505
|
-
function Ga(t
|
|
5506
|
-
|
|
5507
|
+
function Ga(t) {
|
|
5508
|
+
return Mf(t, ka);
|
|
5509
|
+
}
|
|
5510
|
+
function Ha(t, n, e) {
|
|
5511
|
+
const r = Bu(t, n, e, (t, n) => "number" != typeof n ? t : t + 1, Cu), o = Bu(t, n, e, Ns((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Cu);
|
|
5507
5512
|
return c.isError(o) ? o : r ? o / r : c.BuiltIn.Div0;
|
|
5508
5513
|
}
|
|
5509
|
-
function
|
|
5510
|
-
const e =
|
|
5514
|
+
function Ya(t, n) {
|
|
5515
|
+
const e = gs(l, n, Ns((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, null, Cu), r = gs(l, n, (t, n) => "number" != typeof n ? t : null === t ? 1 : t + 1, t, 0, Cu);
|
|
5511
5516
|
return c.isError(e) ? e : 0 === r || null === r ? c.BuiltIn.Div0 : e / r;
|
|
5512
5517
|
}
|
|
5513
|
-
function
|
|
5518
|
+
function za(t) {
|
|
5514
5519
|
let n = 0, e = 0;
|
|
5515
5520
|
const r = t.length;
|
|
5516
5521
|
for (let o = 0; o < r; o++) {
|
|
@@ -5526,12 +5531,12 @@ function Ya(t) {
|
|
|
5526
5531
|
if (0 === e) throw c.BuiltIn.Div0;
|
|
5527
5532
|
return n / e;
|
|
5528
5533
|
}
|
|
5529
|
-
function
|
|
5534
|
+
function Ka(t) {
|
|
5530
5535
|
let n = 0;
|
|
5531
5536
|
for (const e of t) c.isError(e) || (n += e.getStats().getAggregates().numericalCount ?? 0);
|
|
5532
5537
|
return n;
|
|
5533
5538
|
}
|
|
5534
|
-
function
|
|
5539
|
+
function Wa(t) {
|
|
5535
5540
|
const n = l.getArgs().getRepeatingArgsAt(0);
|
|
5536
5541
|
let e = 0;
|
|
5537
5542
|
for (let r = 0; r < t.length; r++) {
|
|
@@ -5540,28 +5545,28 @@ function Ka(t) {
|
|
|
5540
5545
|
}
|
|
5541
5546
|
return e;
|
|
5542
5547
|
}
|
|
5543
|
-
function
|
|
5548
|
+
function Qa(t) {
|
|
5544
5549
|
if (l.getArgs().getAreaCountAt(0) > 1) return c.BuiltIn.Value;
|
|
5545
5550
|
let n = 0;
|
|
5546
5551
|
for (const { value: e } of t.entries({ includeEmpty: !1 })) "" !== e && n++;
|
|
5547
5552
|
return t.getColumnCount() * t.getRowCount() - n;
|
|
5548
5553
|
}
|
|
5549
|
-
function
|
|
5550
|
-
return
|
|
5551
|
-
}
|
|
5552
|
-
function Za(t) {
|
|
5553
|
-
return ms(l, t, (t) => null === t ? 1 : t + 1, void 0, 0, Bu);
|
|
5554
|
+
function Za(t, n) {
|
|
5555
|
+
return Bu(t, n, void 0, (t) => null === t ? 1 : t + 1, bu);
|
|
5554
5556
|
}
|
|
5555
5557
|
function Ja(t) {
|
|
5558
|
+
return gs(l, t, (t) => null === t ? 1 : t + 1, void 0, 0, bu);
|
|
5559
|
+
}
|
|
5560
|
+
function tf(t) {
|
|
5556
5561
|
const n = /* @__PURE__ */ new Set(), e = t.length;
|
|
5557
5562
|
for (let r = 0; r < e; r++) {
|
|
5558
5563
|
const e = t[r];
|
|
5559
|
-
if (c.isError(e)) n.add(
|
|
5560
|
-
else for (const t of e.values()) n.add(
|
|
5564
|
+
if (c.isError(e)) n.add(If(e));
|
|
5565
|
+
else for (const t of e.values()) n.add(If(t));
|
|
5561
5566
|
}
|
|
5562
5567
|
return n.size;
|
|
5563
5568
|
}
|
|
5564
|
-
function
|
|
5569
|
+
function nf(t, n) {
|
|
5565
5570
|
const e = t.getRowCount(), r = t.getColumnCount(), o = n.length, u = new Array(o), i = new Array(o);
|
|
5566
5571
|
for (let t = 0; t < o; t++) {
|
|
5567
5572
|
const o = n[t][0];
|
|
@@ -5573,26 +5578,26 @@ function tf(t, n) {
|
|
|
5573
5578
|
const e = n[0];
|
|
5574
5579
|
if (null === e) return t;
|
|
5575
5580
|
for (let e = 0; e < o; e++) if (!i[e](n[e + 1])) return t;
|
|
5576
|
-
return s.add(
|
|
5581
|
+
return s.add(If(e)), t;
|
|
5577
5582
|
}, null), s.size;
|
|
5578
5583
|
}
|
|
5579
|
-
function
|
|
5584
|
+
function ef(t, n) {
|
|
5580
5585
|
const e = l.flattenAreas(t).getStats().getSortedNumbers().getLarge(n);
|
|
5581
5586
|
return null === e ? NaN : e;
|
|
5582
5587
|
}
|
|
5583
|
-
function ef(t) {
|
|
5584
|
-
return If(t, !0);
|
|
5585
|
-
}
|
|
5586
5588
|
function rf(t) {
|
|
5587
|
-
return
|
|
5589
|
+
return pf(t, !0);
|
|
5588
5590
|
}
|
|
5589
|
-
function of(t
|
|
5590
|
-
return
|
|
5591
|
+
function of(t) {
|
|
5592
|
+
return pf(t, !0, Ua);
|
|
5591
5593
|
}
|
|
5592
|
-
function uf(t, n) {
|
|
5593
|
-
return
|
|
5594
|
+
function uf(t, n, e) {
|
|
5595
|
+
return Bu(t, n, e, Ns((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.max(t, n)), Cu);
|
|
5594
5596
|
}
|
|
5595
|
-
function sf(t) {
|
|
5597
|
+
function sf(t, n) {
|
|
5598
|
+
return gs(l, n, Ns((t, n) => "number" != typeof n ? t : null === t ? n : Math.max(t, n)), t, 0, Cu);
|
|
5599
|
+
}
|
|
5600
|
+
function lf(t) {
|
|
5596
5601
|
const n = [];
|
|
5597
5602
|
for (const e of t) for (const t of e.values()) n.push(t);
|
|
5598
5603
|
if (0 === n.length) return NaN;
|
|
@@ -5604,37 +5609,37 @@ function sf(t) {
|
|
|
5604
5609
|
}
|
|
5605
5610
|
return n[Math.floor(e / 2)];
|
|
5606
5611
|
}
|
|
5607
|
-
function lf(t) {
|
|
5608
|
-
return If(t, !1);
|
|
5609
|
-
}
|
|
5610
5612
|
function af(t) {
|
|
5611
|
-
return
|
|
5613
|
+
return pf(t, !1);
|
|
5612
5614
|
}
|
|
5613
|
-
function ff(t
|
|
5614
|
-
return
|
|
5615
|
+
function ff(t) {
|
|
5616
|
+
return pf(t, !1, Ua);
|
|
5615
5617
|
}
|
|
5616
|
-
function cf(t, n) {
|
|
5617
|
-
return
|
|
5618
|
+
function cf(t, n, e) {
|
|
5619
|
+
return Bu(t, n, e, Ns((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.min(t, n)), Cu);
|
|
5618
5620
|
}
|
|
5619
5621
|
function hf(t, n) {
|
|
5622
|
+
return gs(l, n, Ns((t, n) => "number" != typeof n ? t : null === t ? n : Math.min(t, n)), t, 0, Cu);
|
|
5623
|
+
}
|
|
5624
|
+
function mf(t, n) {
|
|
5620
5625
|
if (t = Math.trunc(t), n = Math.trunc(n), t < 0 || n < 0 || n > t) return NaN;
|
|
5621
5626
|
if (t > 2147483646) return NaN;
|
|
5622
5627
|
let e = 1;
|
|
5623
5628
|
for (let r = t; r > t - n; r--) if (e *= r, !Number.isFinite(e)) return NaN;
|
|
5624
5629
|
return e;
|
|
5625
5630
|
}
|
|
5626
|
-
function
|
|
5631
|
+
function gf(t, n) {
|
|
5627
5632
|
return t = Math.trunc(t), n = Math.trunc(n), t < 0 || n < 0 || t > 2147483646 || n > 2147483646 ? NaN : Math.pow(t, n);
|
|
5628
5633
|
}
|
|
5629
|
-
function
|
|
5634
|
+
function Nf(t, n) {
|
|
5630
5635
|
const e = (t = l.flattenAreas(t)).getStats().getSortedNumbers().getSmall(n);
|
|
5631
5636
|
return null === e ? NaN : e;
|
|
5632
5637
|
}
|
|
5633
|
-
var
|
|
5638
|
+
var If = (t) => {
|
|
5634
5639
|
if (null === t) return "\0";
|
|
5635
5640
|
const n = typeof t;
|
|
5636
5641
|
return "number" === n ? "" + t.toString() : "string" === n ? "" + t : "boolean" === n ? "" + (t ? "1" : "0") : c.isError(t) ? "" + t.getCode() : "" + String(t);
|
|
5637
|
-
},
|
|
5642
|
+
}, pf = (t, n, e) => {
|
|
5638
5643
|
let r = 0, o = !1;
|
|
5639
5644
|
for (const u of t) {
|
|
5640
5645
|
const t = u.getStats(e).getAggregates();
|
|
@@ -5643,7 +5648,7 @@ var Nf = (t) => {
|
|
|
5643
5648
|
r = o ? n ? Math.max(r, i) : Math.min(r, i) : i, o = !0;
|
|
5644
5649
|
}
|
|
5645
5650
|
return o ? r : 0;
|
|
5646
|
-
},
|
|
5651
|
+
}, Mf = (t, n) => {
|
|
5647
5652
|
let e = 0, r = 0, o = null;
|
|
5648
5653
|
for (const u of t) {
|
|
5649
5654
|
const t = u.getStats(n), i = t.getAggregates();
|
|
@@ -5651,54 +5656,46 @@ var Nf = (t) => {
|
|
|
5651
5656
|
}
|
|
5652
5657
|
if (0 === r) throw c.BuiltIn.Div0;
|
|
5653
5658
|
return (o ? o.getSnappedSum(e) : e) / r;
|
|
5654
|
-
},
|
|
5655
|
-
var
|
|
5656
|
-
function
|
|
5659
|
+
}, df = (t, n, e) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(e) - Math.pow(t - n, 2) / (2 * e * e)), wf = (t, n, e) => .5 * Ye(-(t - n) / Math.sqrt(2 * e * e)), Af = (t, n, e) => -1.4142135623730951 * e * ze(2 * t) + n;
|
|
5660
|
+
var Ef = (t, n) => 2 * Je(t, .5 * n);
|
|
5661
|
+
function Bf(t, n, e) {
|
|
5657
5662
|
if (t < 0) return 0;
|
|
5658
5663
|
const r = n * t + e;
|
|
5659
|
-
return
|
|
5664
|
+
return er(n * t / r, e / r, n / 2, e / 2);
|
|
5660
5665
|
}
|
|
5661
|
-
var
|
|
5662
|
-
function
|
|
5666
|
+
var bf = (t, n, e) => e / (n * (1 / or(t, n / 2, e / 2) - 1));
|
|
5667
|
+
function Cf(t, n) {
|
|
5663
5668
|
if (!Number.isFinite(t * t)) return NaN;
|
|
5664
|
-
const e = .5 *
|
|
5669
|
+
const e = .5 * yf(t, n);
|
|
5665
5670
|
return t > 0 ? e : 1 - e;
|
|
5666
5671
|
}
|
|
5667
|
-
function
|
|
5672
|
+
function yf(t, n) {
|
|
5668
5673
|
const e = n + t * t;
|
|
5669
|
-
return
|
|
5674
|
+
return er(n / e, t * t / e, n / 2, .5);
|
|
5670
5675
|
}
|
|
5671
|
-
function
|
|
5672
|
-
let e =
|
|
5676
|
+
function Rf(t, n) {
|
|
5677
|
+
let e = or(2 * Math.min(t, 1 - t), .5 * n, .5);
|
|
5673
5678
|
return e = Math.sqrt(n * (1 - e) / e), t > .5 ? e : -e;
|
|
5674
5679
|
}
|
|
5675
|
-
var
|
|
5676
|
-
function
|
|
5680
|
+
var vf = 1e5;
|
|
5681
|
+
function Sf(t, n) {
|
|
5677
5682
|
if (n < 0 || t % 1 != 0 || t < 0) return 0;
|
|
5678
|
-
const e = t <= 170 ? Math.pow(n, t) * Math.exp(-n) /
|
|
5679
|
-
return Number.isFinite(e) ? e : 0 === n ? 0 === t ? 1 : 0 : Math.exp(t * Math.log(n) - n -
|
|
5683
|
+
const e = t <= 170 ? Math.pow(n, t) * Math.exp(-n) / Ms(t) : 1 / 0;
|
|
5684
|
+
return Number.isFinite(e) ? e : 0 === n ? 0 === t ? 1 : 0 : Math.exp(t * Math.log(n) - n - _e(t + 1));
|
|
5680
5685
|
}
|
|
5681
|
-
var
|
|
5686
|
+
var xf = (t, n, e) => {
|
|
5682
5687
|
if (0 === e || 1 === e) return n * e === t ? 1 : 0;
|
|
5683
|
-
const r =
|
|
5684
|
-
return Number.isFinite(r) ? r : Math.exp(
|
|
5688
|
+
const r = ds(n, t) * Math.pow(e, t) * Math.pow(1 - e, n - t);
|
|
5689
|
+
return Number.isFinite(r) ? r : Math.exp(_e(n + 1) - _e(t + 1) - _e(n - t + 1) + t * Math.log(e) + (n - t) * Math.log(1 - e));
|
|
5685
5690
|
};
|
|
5686
|
-
function xf(t, n, e) {
|
|
5687
|
-
let r;
|
|
5688
|
-
const o = 1e-10;
|
|
5689
|
-
if (t < 0) return 0;
|
|
5690
|
-
if (t >= n) return 1;
|
|
5691
|
-
if (e < 0 || e > 1 || n <= 0) return NaN;
|
|
5692
|
-
const u = e, i = (t = Math.floor(t)) + 1, s = n - t, l = i + s, a = Math.exp(Le(l) - Le(s) - Le(i) + i * Math.log(u) + s * Math.log(1 - u));
|
|
5693
|
-
return r = u < (i + 1) / (l + 2) ? a * Df(u, i, s, o) : 1 - a * Df(1 - u, s, i, o), Math.round(1 / o * (1 - r)) / (1 / o);
|
|
5694
|
-
}
|
|
5695
5691
|
function Tf(t, n, e) {
|
|
5696
|
-
return t
|
|
5692
|
+
return t < 0 ? 0 : t >= n ? 1 : e < 0 || e > 1 || n <= 0 ? NaN : 0 === e ? 1 : 1 === e ? 0 : er(1 - e, e, n - (t = Math.floor(t)), t + 1);
|
|
5697
5693
|
}
|
|
5698
|
-
function Df(t, n, e
|
|
5699
|
-
|
|
5700
|
-
|
|
5701
|
-
|
|
5694
|
+
function Df(t, n, e) {
|
|
5695
|
+
if (t !== t >>> 0) return 0;
|
|
5696
|
+
if (t < 0) return 0;
|
|
5697
|
+
const r = ds(t + n - 1, n - 1) * Math.pow(1 - e, t) * Math.pow(e, n);
|
|
5698
|
+
return Number.isFinite(r) ? r : Math.exp(_e(t + n) - _e(t + 1) - _e(n) + t * Math.log1p(-e) + n * Math.log(e));
|
|
5702
5699
|
}
|
|
5703
5700
|
var Vf = At({
|
|
5704
5701
|
BETADIST: () => jf,
|
|
@@ -5834,28 +5831,28 @@ var Vf = At({
|
|
|
5834
5831
|
}, Uf = 2 ** -22, kf = (t, n, e) => {
|
|
5835
5832
|
let r = 0, o = Math.floor(t);
|
|
5836
5833
|
for (; r < o;) {
|
|
5837
|
-
const u = r + Math.floor((o - r) / 2), i =
|
|
5834
|
+
const u = r + Math.floor((o - r) / 2), i = Tf(u, t, n) > e, s = i ? r : u + 1, l = i ? u : o;
|
|
5838
5835
|
if (s === r && l === o) break;
|
|
5839
5836
|
r = s, o = l;
|
|
5840
5837
|
}
|
|
5841
|
-
return
|
|
5838
|
+
return Tf(r, t, n) > e ? r : NaN;
|
|
5842
5839
|
};
|
|
5843
5840
|
function $f(t, n, e, r, o = 0, u = 1) {
|
|
5844
|
-
return n <= 0 || e <= 0 || t < o || t > u || o === u ? NaN : (t = (t - o) / (u - o), r ? ((t, n, e) => t > 1 || t < 0 ? t > 1 ? 1 : 0 :
|
|
5845
|
-
return t > 1 || t < 0 ? 0 : 1 === n && 1 === e ? 1 : n < 512 && e < 512 ? Math.pow(t, n - 1) * Math.pow(1 - t, e - 1) /
|
|
5841
|
+
return n <= 0 || e <= 0 || t < o || t > u || o === u ? NaN : (t = (t - o) / (u - o), r ? ((t, n, e) => t > 1 || t < 0 ? t > 1 ? 1 : 0 : nr(t, n, e))(t, n, e) : function(t, n, e) {
|
|
5842
|
+
return t > 1 || t < 0 ? 0 : 1 === n && 1 === e ? 1 : n < 512 && e < 512 ? Math.pow(t, n - 1) * Math.pow(1 - t, e - 1) / ke(n, e) : Math.exp((n - 1) * Math.log(t) + (e - 1) * Math.log(1 - t) - Xe(n, e));
|
|
5846
5843
|
}(t, n, e) / (u - o));
|
|
5847
5844
|
}
|
|
5848
5845
|
function jf(t, n, e, r = 0, o = 1) {
|
|
5849
5846
|
return $f(t, n, e, !0, r, o);
|
|
5850
5847
|
}
|
|
5851
5848
|
function Xf(t, n, e, r = 0, o = 1) {
|
|
5852
|
-
return n <= 0 || e <= 0 || t <= 0 || t >= 1 || r >= o ? NaN : ((t, n, e) =>
|
|
5849
|
+
return n <= 0 || e <= 0 || t <= 0 || t >= 1 || r >= o ? NaN : ((t, n, e) => or(t, n, e))(t, n, e) * (o - r) + r;
|
|
5853
5850
|
}
|
|
5854
5851
|
function qf(t, n, e, r = 0, o = 1) {
|
|
5855
5852
|
return Xf(t, n, e, r, o);
|
|
5856
5853
|
}
|
|
5857
5854
|
function Gf(t, n, e, r) {
|
|
5858
|
-
return t = Math.trunc(t), (n = Math.trunc(n)) < 0 || e < 0 || e > 1 || t < 0 || t > n || n > 2147483646 ? NaN : r ?
|
|
5855
|
+
return t = Math.trunc(t), (n = Math.trunc(n)) < 0 || e < 0 || e > 1 || t < 0 || t > n || n > 2147483646 ? NaN : r ? Tf(t, n, e) : xf(t, n, e);
|
|
5859
5856
|
}
|
|
5860
5857
|
function Hf(t, n, e, r) {
|
|
5861
5858
|
return Gf(t, n, e, r);
|
|
@@ -5863,9 +5860,9 @@ function Hf(t, n, e, r) {
|
|
|
5863
5860
|
function Yf(t, n, e, r = e) {
|
|
5864
5861
|
if (t = Math.trunc(t), e = Math.trunc(e), r = Math.trunc(r), t < 0 || n < 0 || n > 1 || e < 0 || e > t || r < e || r > t) return NaN;
|
|
5865
5862
|
if (t > 2147483646) return NaN;
|
|
5866
|
-
if (r - e > zf) return
|
|
5863
|
+
if (r - e > zf) return Tf(r, t, n) - (e > 0 ? Tf(e - 1, t, n) : 0);
|
|
5867
5864
|
let o = 0;
|
|
5868
|
-
for (let u = e; u <= r; u++) o +=
|
|
5865
|
+
for (let u = e; u <= r; u++) o += xf(u, t, n);
|
|
5869
5866
|
return o;
|
|
5870
5867
|
}
|
|
5871
5868
|
var zf = 1e5;
|
|
@@ -5874,9 +5871,9 @@ function Kf(t, n, e) {
|
|
|
5874
5871
|
}
|
|
5875
5872
|
function Wf(t, n, e) {
|
|
5876
5873
|
return n = Math.trunc(n), t < 0 || n < 1 || n > Ff ? NaN : e ? function(t, n) {
|
|
5877
|
-
return t < 0 ? 0 :
|
|
5874
|
+
return t < 0 ? 0 : Ke(n / 2, t / 2);
|
|
5878
5875
|
}(t, n) : function(t, n) {
|
|
5879
|
-
return t < 0 ? 0 : 0 === t && 2 === n ? .5 : Math.exp((n / 2 - 1) * Math.log(t) - t / 2 - n / 2 * Math.log(2) -
|
|
5876
|
+
return t < 0 ? 0 : 0 === t && 2 === n ? .5 : Math.exp((n / 2 - 1) * Math.log(t) - t / 2 - n / 2 * Math.log(2) - _e(n / 2));
|
|
5880
5877
|
}(t, n);
|
|
5881
5878
|
}
|
|
5882
5879
|
function Qf(t, n) {
|
|
@@ -5884,25 +5881,25 @@ function Qf(t, n) {
|
|
|
5884
5881
|
}
|
|
5885
5882
|
function Zf(t, n) {
|
|
5886
5883
|
return n = Math.trunc(n), t < 0 || n < 1 || n > Ff ? NaN : function(t, n) {
|
|
5887
|
-
return t < 0 ? 1 : ((t, n) =>
|
|
5884
|
+
return t < 0 ? 1 : ((t, n) => Ze(t, n, !0))(n / 2, t / 2);
|
|
5888
5885
|
}(t, n);
|
|
5889
5886
|
}
|
|
5890
5887
|
function Jf(t, n) {
|
|
5891
|
-
return n = Math.trunc(n), t < 0 || t >= 1 || n < 1 || n > Ff ? NaN :
|
|
5888
|
+
return n = Math.trunc(n), t < 0 || t >= 1 || n < 1 || n > Ff ? NaN : Ef(t, n);
|
|
5892
5889
|
}
|
|
5893
5890
|
function tc(t, n) {
|
|
5894
5891
|
return nc(t, n);
|
|
5895
5892
|
}
|
|
5896
5893
|
function nc(t, n) {
|
|
5897
|
-
return n = Math.trunc(n), t <= 0 || t > 1 || n < 1 || n > Ff ? NaN :
|
|
5894
|
+
return n = Math.trunc(n), t <= 0 || t > 1 || n < 1 || n > Ff ? NaN : Ef(1 - t, n);
|
|
5898
5895
|
}
|
|
5899
5896
|
function ec(t, n) {
|
|
5900
5897
|
const e = rm(t) ?? rm(n);
|
|
5901
5898
|
if (e) return e;
|
|
5902
5899
|
const r = t.getRowCount(), o = t.getColumnCount();
|
|
5903
5900
|
if (r * o !== n.getRowCount() * n.getColumnCount()) throw c.BuiltIn.NA;
|
|
5904
|
-
if (t.hasError()) return
|
|
5905
|
-
if (n.hasError()) return
|
|
5901
|
+
if (t.hasError()) return ps(t);
|
|
5902
|
+
if (n.hasError()) return ps(n);
|
|
5906
5903
|
if (1 === r && 1 === o) throw c.BuiltIn.NA;
|
|
5907
5904
|
let u;
|
|
5908
5905
|
n.getRowCount() === r && n.getColumnCount() === o || (n = n.reshape(r, o)), u = 1 === r ? o - 1 : 1 === o ? r - 1 : (r - 1) * (o - 1);
|
|
@@ -5921,7 +5918,7 @@ function rc(t, n) {
|
|
|
5921
5918
|
}
|
|
5922
5919
|
function oc(t, n, e) {
|
|
5923
5920
|
return e = Math.trunc(e), t <= 0 || t >= 1 || n <= 0 || e < 1 || 1 - t / 2 == 1 ? NaN : function(t, n, e) {
|
|
5924
|
-
return 1 + Math.abs(
|
|
5921
|
+
return 1 + Math.abs(Af(t / 2, 0, 1) * n / Math.sqrt(e)) - 1;
|
|
5925
5922
|
}(t, n, e);
|
|
5926
5923
|
}
|
|
5927
5924
|
function uc(t, n, e) {
|
|
@@ -5931,7 +5928,7 @@ function ic(t, n, e) {
|
|
|
5931
5928
|
if (e = Math.trunc(e), t <= 0 || t >= 1 || n <= 0 || e < 1) return NaN;
|
|
5932
5929
|
if (1 === e) throw c.BuiltIn.Div0;
|
|
5933
5930
|
return e - 1 > Ff || t / 2 < Of ? NaN : function(t, n, e) {
|
|
5934
|
-
return 1 + Math.abs(
|
|
5931
|
+
return 1 + Math.abs(Rf(t / 2, e - 1) * n / Math.sqrt(e)) - 1;
|
|
5935
5932
|
}(t, n, e);
|
|
5936
5933
|
}
|
|
5937
5934
|
function sc(t, n) {
|
|
@@ -5969,8 +5966,8 @@ function gc(t, n, e) {
|
|
|
5969
5966
|
return mc(t, n, e);
|
|
5970
5967
|
}
|
|
5971
5968
|
function Nc(t, n, e, r) {
|
|
5972
|
-
return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN : r ?
|
|
5973
|
-
return t < 0 ? 0 : 0 === t && n < 2 ? 1 / 0 : 0 === t && 2 === n ? 1 : n < 512 && e < 512 ? 1 /
|
|
5969
|
+
return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN : r ? Bf(t, n, e) : function(t, n, e) {
|
|
5970
|
+
return t < 0 ? 0 : 0 === t && n < 2 ? 1 / 0 : 0 === t && 2 === n ? 1 : n < 512 && e < 512 ? 1 / ke(n / 2, e / 2) * Math.pow(n / e, n / 2) * Math.pow(t, n / 2 - 1) * Math.pow(1 + n / e * t, -(n + e) / 2) : Math.exp(n / 2 * Math.log(n / e) + (n / 2 - 1) * Math.log(t) - (n + e) / 2 * Math.log(1 + n / e * t) - Xe(n / 2, e / 2));
|
|
5974
5971
|
}(t, n, e));
|
|
5975
5972
|
}
|
|
5976
5973
|
function Ic(t, n, e) {
|
|
@@ -5980,23 +5977,23 @@ function pc(t, n, e) {
|
|
|
5980
5977
|
return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN : function(t, n, e) {
|
|
5981
5978
|
if (t < 0) return 1;
|
|
5982
5979
|
const r = n * t + e;
|
|
5983
|
-
return
|
|
5980
|
+
return er(e / r, n * t / r, e / 2, n / 2);
|
|
5984
5981
|
}(t, n, e));
|
|
5985
5982
|
}
|
|
5986
5983
|
function Mc(t, n, e) {
|
|
5987
|
-
return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN :
|
|
5984
|
+
return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN : bf(t, n, e));
|
|
5988
5985
|
}
|
|
5989
5986
|
function dc(t, n, e) {
|
|
5990
5987
|
return wc(t, n, e);
|
|
5991
5988
|
}
|
|
5992
5989
|
function wc(t, n, e) {
|
|
5993
|
-
return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN :
|
|
5990
|
+
return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Ff || e > Ff ? NaN : bf(1 - t, n, e));
|
|
5994
5991
|
}
|
|
5995
5992
|
function Ac(t, n) {
|
|
5996
5993
|
const e = rm(t) ?? rm(n);
|
|
5997
5994
|
if (e) return e;
|
|
5998
|
-
if (t.hasError()) return
|
|
5999
|
-
if (n.hasError()) return
|
|
5995
|
+
if (t.hasError()) return ps(t);
|
|
5996
|
+
if (n.hasError()) return ps(n);
|
|
6000
5997
|
const r = [], o = [];
|
|
6001
5998
|
for (const [e, u] of [[t, r], [n, o]]) e.forEach((t) => {
|
|
6002
5999
|
"number" == typeof t && u.push(t);
|
|
@@ -6012,7 +6009,7 @@ function Ac(t, n) {
|
|
|
6012
6009
|
for (let t = 0; t < o.length; t++) l += (i - o[t]) ** 2;
|
|
6013
6010
|
if (l /= o.length - 1, s = Et(s), l = Et(l), 0 === s || 0 === l) return c.BuiltIn.Div0;
|
|
6014
6011
|
if (!Number.isFinite(s) || !Number.isFinite(l)) return c.BuiltIn.Num;
|
|
6015
|
-
const a =
|
|
6012
|
+
const a = Bf(s / l, r.length - 1, o.length - 1);
|
|
6016
6013
|
return 2 * Math.min(a, 1 - a);
|
|
6017
6014
|
}
|
|
6018
6015
|
function Ec(t, n) {
|
|
@@ -6061,36 +6058,36 @@ function Rc(t, n) {
|
|
|
6061
6058
|
return u[e.length][0] = s, u;
|
|
6062
6059
|
}
|
|
6063
6060
|
function vc(t) {
|
|
6064
|
-
return 0 === t || t < 0 && t === Math.trunc(t) ? NaN :
|
|
6061
|
+
return 0 === t || t < 0 && t === Math.trunc(t) ? NaN : Ue(t);
|
|
6065
6062
|
}
|
|
6066
6063
|
function Sc(t, n, e, r) {
|
|
6067
|
-
return t < 0 || n <= 0 || e <= 0 ? NaN : Number.isFinite(
|
|
6068
|
-
return t < 0 ? 0 :
|
|
6064
|
+
return t < 0 || n <= 0 || e <= 0 ? NaN : Number.isFinite(_e(n)) && Number.isFinite(t / e * 2) ? r ? function(t, n, e) {
|
|
6065
|
+
return t < 0 ? 0 : Ke(n, t / e);
|
|
6069
6066
|
}(t, n, e) : function(t, n, e) {
|
|
6070
6067
|
return t < 0 ? 0 : 0 === t && 1 === n ? 1 / e : n >= 30 ? Math.exp(function(t, n) {
|
|
6071
6068
|
const e = n / t - 1;
|
|
6072
|
-
return -t * e * e * (1 +
|
|
6073
|
-
}(n, t / e)) / e : Math.exp((n - 1) * Math.log(t) - t / e -
|
|
6069
|
+
return -t * e * e * (1 + Qe(e) * e) / 2 - Math.log1p(e) - .5 * Math.log(t) - .5 * Math.log(2 * Math.PI) - je(t);
|
|
6070
|
+
}(n, t / e)) / e : Math.exp((n - 1) * Math.log(t) - t / e - _e(n) - n * Math.log(e));
|
|
6074
6071
|
}(t, n, e) : NaN;
|
|
6075
6072
|
}
|
|
6076
6073
|
function xc(t, n, e, r) {
|
|
6077
6074
|
return Sc(t, n, e, r);
|
|
6078
6075
|
}
|
|
6079
6076
|
function Tc(t, n, e) {
|
|
6080
|
-
return t < 0 || t >= 1 || n <= 0 || e <= 0 ? NaN : (r = e,
|
|
6077
|
+
return t < 0 || t >= 1 || n <= 0 || e <= 0 ? NaN : (r = e, Je(t, n) * r);
|
|
6081
6078
|
var r;
|
|
6082
6079
|
}
|
|
6083
6080
|
function Dc(t, n, e) {
|
|
6084
6081
|
return Tc(t, n, e);
|
|
6085
6082
|
}
|
|
6086
6083
|
function Vc(t) {
|
|
6087
|
-
return t <= 0 ? NaN :
|
|
6084
|
+
return t <= 0 ? NaN : _e(t);
|
|
6088
6085
|
}
|
|
6089
6086
|
function Fc(t) {
|
|
6090
|
-
return t <= 0 ? NaN :
|
|
6087
|
+
return t <= 0 ? NaN : _e(t);
|
|
6091
6088
|
}
|
|
6092
6089
|
function Oc(t) {
|
|
6093
|
-
return
|
|
6090
|
+
return wf(t, 0, 1) - .5;
|
|
6094
6091
|
}
|
|
6095
6092
|
function Pc(t) {
|
|
6096
6093
|
const n = [];
|
|
@@ -6117,10 +6114,10 @@ function _c(t, n, e, r, o) {
|
|
|
6117
6114
|
const u = (t) => {
|
|
6118
6115
|
if (t > n || t > e) return 0;
|
|
6119
6116
|
if (n - t > r - e) return 0;
|
|
6120
|
-
const o =
|
|
6117
|
+
const o = xs(e, t) * xs(r - e, n - t) / xs(r, n);
|
|
6121
6118
|
if (Number.isFinite(o)) return o;
|
|
6122
6119
|
if (r > 2147483646) return NaN;
|
|
6123
|
-
const u = (t, n) =>
|
|
6120
|
+
const u = (t, n) => _e(t + 1) - _e(n + 1) - _e(t - n + 1);
|
|
6124
6121
|
return Math.exp(u(e, t) + u(r - e, n - t) - u(r, n));
|
|
6125
6122
|
};
|
|
6126
6123
|
if (!o) return u(t);
|
|
@@ -6156,7 +6153,7 @@ function $c(t) {
|
|
|
6156
6153
|
}
|
|
6157
6154
|
function jc(t, n, e, r) {
|
|
6158
6155
|
return t <= 0 || e <= 0 ? NaN : r ? function(t, n, e) {
|
|
6159
|
-
return t < 0 ? 0 : .5 *
|
|
6156
|
+
return t < 0 ? 0 : .5 * Ye(-(Math.log(t) - n) / Math.sqrt(2 * e * e));
|
|
6160
6157
|
}(t, n, e) : function(t, n, e) {
|
|
6161
6158
|
return t <= 0 ? 0 : Math.exp(-Math.log(t) - .5 * Math.log(2 * Math.PI) - Math.log(e) - Math.pow(Math.log(t) - n, 2) / (2 * e * e));
|
|
6162
6159
|
}(t, n, e);
|
|
@@ -6165,7 +6162,7 @@ function Xc(t, n, e) {
|
|
|
6165
6162
|
return jc(t, n, e, !0);
|
|
6166
6163
|
}
|
|
6167
6164
|
function qc(t, n, e) {
|
|
6168
|
-
return t <= 0 || t >= 1 || e <= 0 ? NaN : (r = t, o = n, u = e, Math.exp(-1.4142135623730951 * u *
|
|
6165
|
+
return t <= 0 || t >= 1 || e <= 0 ? NaN : (r = t, o = n, u = e, Math.exp(-1.4142135623730951 * u * ze(2 * r) + o));
|
|
6169
6166
|
var r, o, u;
|
|
6170
6167
|
}
|
|
6171
6168
|
function Gc(t, n, e) {
|
|
@@ -6186,7 +6183,7 @@ function Yc(t) {
|
|
|
6186
6183
|
return Wc(t);
|
|
6187
6184
|
}
|
|
6188
6185
|
var zc = (t) => {
|
|
6189
|
-
for (const n of t) if (1 === n.size &&
|
|
6186
|
+
for (const n of t) if (1 === n.size && La(n) && n.entries({ includeEmpty: !1 }).next().done) throw c.BuiltIn.Value;
|
|
6190
6187
|
};
|
|
6191
6188
|
function Kc(t) {
|
|
6192
6189
|
const n = Hc();
|
|
@@ -6245,42 +6242,42 @@ function Qc(t, n, e, r) {
|
|
|
6245
6242
|
return t < 0 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), e <= 0 || e >= 1 || n < 1 ? NaN : r ? function(t, n, e) {
|
|
6246
6243
|
if (t < 0) return 0;
|
|
6247
6244
|
let r = 0, o = !1;
|
|
6248
|
-
const u = Math.min(t,
|
|
6245
|
+
const u = Math.min(t, vf);
|
|
6249
6246
|
for (let i = 0; i <= u; i++) {
|
|
6250
|
-
const u =
|
|
6251
|
-
if (!Number.isFinite(u)) return
|
|
6247
|
+
const u = Df(i, n, e);
|
|
6248
|
+
if (!Number.isFinite(u)) return nr(e, n, Math.floor(t) + 1);
|
|
6252
6249
|
if (0 === u && o) return r;
|
|
6253
6250
|
0 !== u && (o = !0), r += u;
|
|
6254
6251
|
}
|
|
6255
|
-
return o && t <=
|
|
6256
|
-
}(t, n, e) :
|
|
6252
|
+
return o && t <= vf ? r : nr(e, n, Math.floor(t) + 1);
|
|
6253
|
+
}(t, n, e) : Df(t, n, e));
|
|
6257
6254
|
}
|
|
6258
6255
|
function Zc(t, n, e) {
|
|
6259
6256
|
return Qc(t, n, e, !1);
|
|
6260
6257
|
}
|
|
6261
6258
|
function Jc(t, n, e, r) {
|
|
6262
6259
|
if (e <= 0) return NaN;
|
|
6263
|
-
if (r) return
|
|
6260
|
+
if (r) return wf(t, n, e);
|
|
6264
6261
|
const o = (t - n) / e;
|
|
6265
|
-
return Number.isFinite(o * o) ?
|
|
6262
|
+
return Number.isFinite(o * o) ? df(t, n, e) : NaN;
|
|
6266
6263
|
}
|
|
6267
6264
|
function th(t, n, e, r) {
|
|
6268
6265
|
return Jc(t, n, e, r);
|
|
6269
6266
|
}
|
|
6270
6267
|
function nh(t, n, e) {
|
|
6271
|
-
return t <= 0 || t >= 1 || e <= 0 ? NaN :
|
|
6268
|
+
return t <= 0 || t >= 1 || e <= 0 ? NaN : Af(t, n, e);
|
|
6272
6269
|
}
|
|
6273
6270
|
function eh(t, n, e) {
|
|
6274
6271
|
return nh(t, n, e);
|
|
6275
6272
|
}
|
|
6276
6273
|
function rh(t, n) {
|
|
6277
|
-
return n ?
|
|
6274
|
+
return n ? wf(t, 0, 1) : Number.isFinite(t * t) ? df(t, 0, 1) : NaN;
|
|
6278
6275
|
}
|
|
6279
6276
|
function oh(t) {
|
|
6280
6277
|
return rh(t, !0);
|
|
6281
6278
|
}
|
|
6282
6279
|
function uh(t) {
|
|
6283
|
-
return t <= 0 || t >= 1 ? NaN :
|
|
6280
|
+
return t <= 0 || t >= 1 ? NaN : Af(t, 0, 1);
|
|
6284
6281
|
}
|
|
6285
6282
|
function ih(t) {
|
|
6286
6283
|
return uh(t);
|
|
@@ -6316,19 +6313,19 @@ function gh(t) {
|
|
|
6316
6313
|
return Number.isFinite(t * t) ? Math.exp(-.5 * t * t) / em : NaN;
|
|
6317
6314
|
}
|
|
6318
6315
|
function Nh(t, n, e) {
|
|
6319
|
-
return t < 0 || n < 0 ? NaN : (t = Math.trunc(t), Number.isFinite(
|
|
6316
|
+
return t < 0 || n < 0 ? NaN : (t = Math.trunc(t), Number.isFinite(_e(t + 1)) ? e ? function(t, n) {
|
|
6320
6317
|
if (t < 0) return 0;
|
|
6321
6318
|
if (t <= 170) {
|
|
6322
6319
|
const e = [];
|
|
6323
|
-
for (let r = 0; r <= t; r++) e.push(
|
|
6320
|
+
for (let r = 0; r <= t; r++) e.push(Sf(r, n));
|
|
6324
6321
|
if (e.every(Number.isFinite)) {
|
|
6325
6322
|
let t = 0;
|
|
6326
6323
|
for (let n = e.length - 1; n >= 0; n--) t += e[n];
|
|
6327
6324
|
return t;
|
|
6328
6325
|
}
|
|
6329
6326
|
}
|
|
6330
|
-
return 1 -
|
|
6331
|
-
}(t, n) :
|
|
6327
|
+
return 1 - Ke(Math.floor(t) + 1, n);
|
|
6328
|
+
}(t, n) : Sf(t, n) : NaN);
|
|
6332
6329
|
}
|
|
6333
6330
|
function Ih(t, n, e) {
|
|
6334
6331
|
return !e && t >= 0 && t < 1 && n < 0 ? Math.exp(-n) : Nh(t, n, e);
|
|
@@ -6337,8 +6334,8 @@ function ph(t, n, e, r) {
|
|
|
6337
6334
|
zc([t, n]);
|
|
6338
6335
|
const o = t.flatten(), u = n.flatten();
|
|
6339
6336
|
if (o.getRowCount() !== u.getRowCount()) return c.BuiltIn.NA;
|
|
6340
|
-
if (t.hasError()) return
|
|
6341
|
-
if (n.hasError()) return
|
|
6337
|
+
if (t.hasError()) return ps(t);
|
|
6338
|
+
if (n.hasError()) return ps(n);
|
|
6342
6339
|
const i = r ?? e;
|
|
6343
6340
|
let s = 0, l = 0;
|
|
6344
6341
|
for (const [[t, n]] of o.alignValues([u])) "number" == typeof t && "number" == typeof n && (s += n, t >= e && t <= i && (l += n));
|
|
@@ -6468,31 +6465,31 @@ function Oh(t, n) {
|
|
|
6468
6465
|
function Ph(t, n, e) {
|
|
6469
6466
|
return (n = Math.trunc(n)) < 1 || n > Ff ? NaN : e ? 0 === t ? .5 : function(t, n) {
|
|
6470
6467
|
if (!Number.isFinite(t * t)) return NaN;
|
|
6471
|
-
const e = .5 *
|
|
6468
|
+
const e = .5 * yf(t, n);
|
|
6472
6469
|
return t > 0 ? 1 - e : e;
|
|
6473
|
-
}(t, n) : function(t, n) {
|
|
6474
|
-
return n = n > 1e100 ? 1e100 : n, 1 / (Math.sqrt(n) *
|
|
6475
|
-
}(t, n);
|
|
6470
|
+
}(t, n) : Number.isFinite(t * t) ? function(t, n) {
|
|
6471
|
+
return n = n > 1e100 ? 1e100 : n, 1 / (Math.sqrt(n) * ke(.5, n / 2)) * Math.pow(1 + t * t / n, -(n + 1) / 2);
|
|
6472
|
+
}(t, n) : NaN;
|
|
6476
6473
|
}
|
|
6477
6474
|
function Lh(t, n, e) {
|
|
6478
6475
|
return t < 0 || 1 !== (e = Math.floor(e + Uf)) && 2 !== e ? NaN : 1 === e ? Uh(t, n) : _h(t, n);
|
|
6479
6476
|
}
|
|
6480
6477
|
function _h(t, n) {
|
|
6481
|
-
return (n = Math.trunc(n)) < 1 || t < 0 || n > Ff ? NaN : 2 *
|
|
6478
|
+
return (n = Math.trunc(n)) < 1 || t < 0 || n > Ff ? NaN : 2 * Cf(t, n);
|
|
6482
6479
|
}
|
|
6483
6480
|
function Uh(t, n) {
|
|
6484
|
-
return (n = Math.trunc(n)) < 1 || n > Ff ? NaN : 0 === t ? .5 :
|
|
6481
|
+
return (n = Math.trunc(n)) < 1 || n > Ff ? NaN : 0 === t ? .5 : Cf(t, n);
|
|
6485
6482
|
}
|
|
6486
6483
|
function kh(t, n) {
|
|
6487
6484
|
if (0 === t && 1 === Math.trunc(n)) throw c.BuiltIn.Div0;
|
|
6488
|
-
return t <= 0 || t >= 1 || n < 1 || (n = Math.trunc(n)) > Ff ? NaN : 1 === n ? Math.tan(Math.PI * (t - .5)) :
|
|
6485
|
+
return t <= 0 || t >= 1 || n < 1 || (n = Math.trunc(n)) > Ff ? NaN : 1 === n ? Math.tan(Math.PI * (t - .5)) : Rf(t, n);
|
|
6489
6486
|
}
|
|
6490
6487
|
function $h(t, n) {
|
|
6491
6488
|
return jh(t, n);
|
|
6492
6489
|
}
|
|
6493
6490
|
function jh(t, n) {
|
|
6494
6491
|
if (0 === t && 1 === Math.trunc(n)) throw c.BuiltIn.Div0;
|
|
6495
|
-
return t <= 0 || n < 1 || (n = Math.trunc(n)) > Ff ? NaN : 1 === n ? Math.tan(Math.PI * (.5 - t / 2)) : -
|
|
6492
|
+
return t <= 0 || n < 1 || (n = Math.trunc(n)) > Ff ? NaN : 1 === n ? Math.tan(Math.PI * (.5 - t / 2)) : -Rf(t / 2, n);
|
|
6496
6493
|
}
|
|
6497
6494
|
function Xh(t, n) {
|
|
6498
6495
|
if ((t = l.flattenAreas(t)).hasError()) return t.firstError();
|
|
@@ -6517,7 +6514,7 @@ function Xh(t, n) {
|
|
|
6517
6514
|
var qh = { axis: f.Axis.Row };
|
|
6518
6515
|
function Gh(t) {
|
|
6519
6516
|
let n = 0, e = 0;
|
|
6520
|
-
const r =
|
|
6517
|
+
const r = qa(t);
|
|
6521
6518
|
for (const o of t) for (const t of o.values()) n += Math.pow(t - r, 2), e++;
|
|
6522
6519
|
const o = n / e;
|
|
6523
6520
|
return isNaN(o) ? NaN : o;
|
|
@@ -6527,7 +6524,7 @@ function Hh(t) {
|
|
|
6527
6524
|
}
|
|
6528
6525
|
function Yh(t) {
|
|
6529
6526
|
let n = 0, e = 0;
|
|
6530
|
-
const r =
|
|
6527
|
+
const r = qa(t);
|
|
6531
6528
|
for (const o of t) for (const t of o.values({
|
|
6532
6529
|
type: i.Number,
|
|
6533
6530
|
onError: "value"
|
|
@@ -6542,9 +6539,9 @@ var Kh = (t) => {
|
|
|
6542
6539
|
const n = [];
|
|
6543
6540
|
let e = 0;
|
|
6544
6541
|
for (const r of t) {
|
|
6545
|
-
const t =
|
|
6542
|
+
const t = La(r);
|
|
6546
6543
|
for (const o of r.values({ type: null })) {
|
|
6547
|
-
const r =
|
|
6544
|
+
const r = $a(o, t);
|
|
6548
6545
|
null !== r && (n.push(r), e += r);
|
|
6549
6546
|
}
|
|
6550
6547
|
}
|
|
@@ -6605,7 +6602,7 @@ function tm(t, n, e) {
|
|
|
6605
6602
|
function nm(t, n, e) {
|
|
6606
6603
|
return tm(t, n, e);
|
|
6607
6604
|
}
|
|
6608
|
-
var em = 2.5066282746310002, rm = (t) => 1 === t.size &&
|
|
6605
|
+
var em = 2.5066282746310002, rm = (t) => 1 === t.size && La(t) ? t.hasError() ? t.firstError() : t.entries({ includeEmpty: !1 }).next().done ? c.BuiltIn.Value : null : null;
|
|
6609
6606
|
function om(t, n) {
|
|
6610
6607
|
const e = rm(t) ?? rm(n);
|
|
6611
6608
|
if (e) return e;
|
|
@@ -6615,8 +6612,8 @@ function om(t, n) {
|
|
|
6615
6612
|
const u = [], i = [];
|
|
6616
6613
|
for (const [e] of t.alignValues([n])) {
|
|
6617
6614
|
const t = e[0], n = e[1];
|
|
6618
|
-
if (c.isError(t)) return
|
|
6619
|
-
if (c.isError(n)) return
|
|
6615
|
+
if (c.isError(t)) return Is(t);
|
|
6616
|
+
if (c.isError(n)) return Is(n);
|
|
6620
6617
|
"number" == typeof t && "number" == typeof n && (i.push(t), u.push(n));
|
|
6621
6618
|
}
|
|
6622
6619
|
const s = i.length;
|
|
@@ -6998,11 +6995,12 @@ function og(t, n, e, r) {
|
|
|
6998
6995
|
}
|
|
6999
6996
|
function ug(t) {
|
|
7000
6997
|
const n = !0 === t?.isIRange ? t : null;
|
|
7001
|
-
return n ?
|
|
6998
|
+
return n ? ko(n, ig) : ig(t);
|
|
7002
6999
|
}
|
|
7003
7000
|
var ig = (t) => "string" == typeof t ? t : "";
|
|
7004
7001
|
function sg(t, n) {
|
|
7005
|
-
if (null === t && (t = 0), "" === n) return "";
|
|
7002
|
+
if (null === t && (t = 0), "" === n) return "number" == typeof t && t < 0 ? "-" : "";
|
|
7003
|
+
if (n.length > 255) return c.BuiltIn.Value;
|
|
7006
7004
|
if ("string" == typeof t && "" !== t.trim()) try {
|
|
7007
7005
|
t = l.parseAsNumber(t.trim());
|
|
7008
7006
|
} catch (t) {}
|
|
@@ -7325,7 +7323,7 @@ async function sN(t, n, e) {
|
|
|
7325
7323
|
throw c.isError(t, c.Code.Blocked) ? new c.Value(t.message) : c.BuiltIn.Value;
|
|
7326
7324
|
}
|
|
7327
7325
|
}
|
|
7328
|
-
var lN = () => import("./
|
|
7326
|
+
var lN = () => import("./CKD460cQOgwF6uSV.js"), aN = () => import("./BnNB_ejvNaLu6B3o.js"), fN = () => import("./DyiH3LlinD-38bG7.js"), cN = () => import("./CFWwwr74qRKOBrg9.js"), hN = () => import("./B6caaQsfOpFEgYQ4.js"), mN = () => import("./DJfpKncnYnrr28G0.js"), gN = () => import("./b8yACuWy67eIj_j2.js"), NN = () => import("./9GnbVPKozgrJpeLW.js"), IN = () => import("./B-t1q2NS61c2B8E4.js"), pN = () => import("./DRq6lQLndj73WT35.js"), MN = () => import("./sJVPCrgeh0U6LbAK.js"), dN = () => import("./LM2rVDHdB0jVUFcT.js"), wN = () => import("./Ds4TB1hn56-RK6_f.js"), AN = () => import("./P6V3JAiRpC3BWceC.js"), EN = () => import("./D-vo2bQyAmStQmD9.js"), BN = () => import("./DIgPlkEabQdKNUQn.js"), bN = () => import("./DXCTHw-ZutNIuo_2.js"), CN = () => import("./suLYEZBtGUhSYeB7.js"), yN = () => import("./CFNtPYPfDPH-3BXK.js"), RN = () => import("./DwNcvKM47ZHfvQM6.js"), vN = () => import("./DJGYlGr2Zj7SkYqc.js"), SN = () => import("./BkHeIMSE7-LehRCs.js"), xN = () => import("./DGI_8HyNF0eAv0P5.js"), TN = () => import("./Cf0zmfQYfJ7zM0Ya.js"), DN = () => import("./DM-yGHahbfA_uarn.js"), VN = Object.defineProperty, FN = (t, n) => {
|
|
7329
7327
|
let e = {};
|
|
7330
7328
|
for (var r in t) VN(e, r, {
|
|
7331
7329
|
get: t[r],
|
|
@@ -10153,7 +10151,7 @@ function iw(t, n, e = 0) {
|
|
|
10153
10151
|
const o = tw(n, 1 === r);
|
|
10154
10152
|
return c.isError(o) ? o : o.regex.test(t);
|
|
10155
10153
|
}
|
|
10156
|
-
var sw = () => import("./
|
|
10154
|
+
var sw = () => import("./doqBmhonQlHp-1Ud.js"), lw = () => import("./2YT_wstXIH6UIigi.js"), aw = () => import("./BxwB3iTNSE1TgHkb.js"), fw = () => import("./DFVQIZ2zZyAphhCF.js"), cw = () => import("./DPLTGglaPovTg9e5.js"), hw = () => import("./Xccc6oxtlSvJUDsC.js"), mw = () => import("./CUYQlZz5zWsUdmRy.js"), gw = () => import("./D8k9de_hen-KqBWe.js"), Nw = () => import("./BjyXkr-CzV8mVx0t.js"), Iw = () => import("./yz2PTfYm_8EGJPM5.js"), pw = () => import("./Cxzowsi6ASdZtzeI.js"), Mw = () => import("./Jy-_0a72nn5Iv1NK.js"), dw = () => import("./CR1aLf7CWEfPTO9a.js"), ww = () => import("./BJwiwzwx4Bl5L4Vq.js"), Aw = () => import("./C6PNMev7cs5JLgwy.js"), Ew = () => import("./BifwlrCmEVtjh_1U.js"), Bw = () => import("./D6d1DKL15m52ZCuC.js"), bw = () => import("./DczQhB3mRSUw6GCf.js"), Cw = () => import("./BPNLZ07Bu_B8Yhf1.js"), yw = () => import("./Ch9w7xFxVMrvGuC_.js"), Rw = () => import("./CnKX5SPVE2iuSK42.js"), vw = [
|
|
10157
10155
|
{
|
|
10158
10156
|
pkg: "@sheetxl/formulas",
|
|
10159
10157
|
id: "@sheetxl/formulas",
|
|
@@ -10198,7 +10196,7 @@ function Fw() {
|
|
|
10198
10196
|
}
|
|
10199
10197
|
function Ow(t, n) {
|
|
10200
10198
|
Dw || (Dw = !0, Tw(e.getActive()), e.addChangeListener((t) => Tw(t)));
|
|
10201
|
-
const r = ((t, n, e) => (e || (e = /* @__PURE__ */ new Map()), n(e, t, Rt, O, lN, "Database"), n(e, t, Ht, C, aN, "Date & Time", D), n(e, t,
|
|
10199
|
+
const r = ((t, n, e) => (e || (e = /* @__PURE__ */ new Map()), n(e, t, Rt, O, lN, "Database"), n(e, t, Ht, C, aN, "Date & Time", D), n(e, t, Pn, ut, fN, "Engineering"), n(e, t, qn, x, cN, "Engineering"), n(e, t, Ee, U, hN, "Engineering"), n(e, t, Ve, E, mN, "Engineering"), n(e, t, ur, b, gN, "Engineering"), n(e, t, Ar, w, NN, "Engineering"), n(e, t, Ao, A, IN, "Financial"), n(e, t, $o, I, pN, "Information", P), n(e, t, Mu, L, MN, "Japanese"), n(e, t, Au, d, dN, "Japanese"), n(e, t, yu, v, wN, "Logical"), n(e, t, Zu, M, AN, "Lookup & Reference", Nt), n(e, t, ws, y, EN, "Math & Trig", R), n(e, t, Zl, Z, BN, "Math & Trig"), n(e, t, wa, p, bN, "Operators"), n(e, t, Vf, Q, CN, "Statistical"), n(e, t, ja, N, yN, "Statistical"), n(e, t, um, _, RN, "Testing"), n(e, t, Em, B, vN, "Text"), n(e, t, $g, ht, SN, "Thai"), n(e, t, Xg, k, xN, "Web"), n(e, t, Zg, S, TN, "Web"), n(e, t, rN, F, DN, "Web"), e))(t, Pw);
|
|
10202
10200
|
if (((t, n, e) => {
|
|
10203
10201
|
e || (e = /* @__PURE__ */ new Map()), n(e, t, ON, tt, sw, "Cube"), n(e, t, MI, J, lw, "Financial"), n(e, t, VI, ct, aw, "Financial"), n(e, t, PI, $, fw, "Financial", gt), n(e, t, JI, j, cw, "Financial"), n(e, t, up, X, hw, "Financial"), n(e, t, Sp, Y, mw, "Financial"), n(e, t, Pp, ot, gw, "Financial"), n(e, t, kp, G, Nw, "Financial"), n(e, t, Hp, z, Iw, "Financial"), n(e, t, iM, K, pw, "Financial"), n(e, t, hM, mt, Mw, "Financial"), n(e, t, pM, rt, dw, "Financial"), n(e, t, CM, V, ww, "Financial"), n(e, t, SM, nt, Aw, "Financial"), n(e, t, QM, W, Ew, "Lookup & Reference"), n(e, t, ed, st, Bw, "Lookup & Reference"), n(e, t, ud, q, bw, "Statistical"), n(e, t, xd, ft, Cw, "Statistical"), n(e, t, Ld, it, yw, "Statistical"), n(e, t, ew, lt, Rw, "Text");
|
|
10204
10202
|
})(t, Pw, r), Pw(r, t, at(t), H.declarations, et, "SheetXL"), n) for (const e of n) e(t, Pw, r);
|