From 47f4e478ba7f0410aa908cd5df8e7db790b752d0 Mon Sep 17 00:00:00 2001 From: maxiaoqi2020 Date: Tue, 1 Jun 2021 14:36:11 +0800 Subject: [PATCH] load google fonts locally; add third-party software notice --- .../THIRD_PARTY_OPEN_SOURCE_SOFTWARE_NOTICE | 14 + .../KFOlCnqEu92Fr1MmEU9fBBc4AMP6lQ.woff2 | Bin 0 -> 11048 bytes .../KFOlCnqEu92Fr1MmWUlfBBc4AMP6lQ.woff2 | Bin 0 -> 11048 bytes .../fonts/KFOmCnqEu92Fr1Mu4WxKKTU1Kvnz.woff2 | Bin 0 -> 4824 bytes .../fonts/KFOmCnqEu92Fr1Mu4mxKKTU1Kg.woff2 | Bin 0 -> 11032 bytes .../flUhRq6tzZclQEJ-Vdg-IuiaDsNcIhQ8tQ.woff2 | Bin 0 -> 103968 bytes .../stylesheets/fonts.googleapis.com.css | 168 +++ .../stylesheets/fonts.googleapis.com.icon.css | 23 + .../src/main/resources/webapp/disabled.html | 2 +- .../resources/webapp/dist/embedded_plan.js | 24 +- .../resources/webapp/dist/headerfooter.js | 2 +- .../resources/webapp/dist/hetuqueryeditor.js | 1260 +++++++++-------- .../src/main/resources/webapp/dist/index.js | 105 +- .../src/main/resources/webapp/dist/nodes.js | 26 +- .../main/resources/webapp/dist/overview.js | 32 +- .../src/main/resources/webapp/dist/plan.js | 24 +- .../src/main/resources/webapp/dist/query.js | 24 +- .../src/main/resources/webapp/dist/stage.js | 24 +- .../src/main/resources/webapp/dist/worker.js | 24 +- .../main/resources/webapp/embedded_plan.html | 2 +- .../src/main/resources/webapp/login.html | 2 +- .../src/main/resources/webapp/nodes.html | 5 +- .../src/main/resources/webapp/overview.html | 5 +- .../src/main/resources/webapp/plan.html | 2 +- .../src/main/resources/webapp/query.html | 2 +- .../main/resources/webapp/queryeditor.html | 4 +- .../main/resources/webapp/queryhistory.html | 2 +- .../src/main/resources/webapp/stage.html | 2 +- .../src/main/resources/webapp/worker.html | 2 +- 29 files changed, 1118 insertions(+), 662 deletions(-) create mode 100644 presto-main/src/main/resources/webapp/assets/fonts/KFOlCnqEu92Fr1MmEU9fBBc4AMP6lQ.woff2 create mode 100644 presto-main/src/main/resources/webapp/assets/fonts/KFOlCnqEu92Fr1MmWUlfBBc4AMP6lQ.woff2 create mode 100644 presto-main/src/main/resources/webapp/assets/fonts/KFOmCnqEu92Fr1Mu4WxKKTU1Kvnz.woff2 create mode 100644 presto-main/src/main/resources/webapp/assets/fonts/KFOmCnqEu92Fr1Mu4mxKKTU1Kg.woff2 create mode 100644 presto-main/src/main/resources/webapp/assets/fonts/flUhRq6tzZclQEJ-Vdg-IuiaDsNcIhQ8tQ.woff2 create mode 100644 presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.css create mode 100644 presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.icon.css diff --git a/hetu-server/THIRD_PARTY_OPEN_SOURCE_SOFTWARE_NOTICE b/hetu-server/THIRD_PARTY_OPEN_SOURCE_SOFTWARE_NOTICE index 82da0aba3..c654f33c5 100644 --- a/hetu-server/THIRD_PARTY_OPEN_SOURCE_SOFTWARE_NOTICE +++ b/hetu-server/THIRD_PARTY_OPEN_SOURCE_SOFTWARE_NOTICE @@ -672,4 +672,18 @@ Copyright notice: Copyright 2015 Ben Manes. License: Apache License 2.0 +Please see above. + + +Software: Roboto: Google’s signature family of fonts +Source: https://github.com/googlefonts/roboto + +License: Apache License V2.0 +Please see above. + + +Software: Material design icons: Google’s official icon set +Source: https://github.com/google/material-design-icons + +License: Apache License V2.0 Please see above. \ No newline at end of file diff --git a/presto-main/src/main/resources/webapp/assets/fonts/KFOlCnqEu92Fr1MmEU9fBBc4AMP6lQ.woff2 b/presto-main/src/main/resources/webapp/assets/fonts/KFOlCnqEu92Fr1MmEU9fBBc4AMP6lQ.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..e66ca5870eb6c4f2b407bee715faa5b64411c0b2 GIT binary patch literal 11048 zcmV+@E7#O_Pew8T0RR9104pc}4gdfE08}&p04mP_0RR9100000000000000000000 z0000QWE+|u9EDy6U;u+45ey3PAlf(!gbDxwHUcCAh!6xI1%m(wAREm^6K;$%Y#a~( zPPRf6rGv61_%9E*Ap`o*6bU0>I7Ku2?~hhTHPp7=0Fh}pwO;EaMB+Pv#b0nq8Nh!?HsO^o8QSM z1DPZb#O{^BA}io&S)OoJrovRngCm{RjKE1|cI|t>3XqBtcULk5(DcB9X{4l+lA?X= z3G1(*ds#jLRN)FX5WD#SEZ6V1zO)CeGEAp2#1$k_l7@D3tzD>>#8;kR^7l5)cAuZt zc=YeM(}rED=#JXV*qNI?X|djYD|z+z?@BTpXyqgMXr+*8ZX_Q`3dqMLbpc}8$6N(~ zTcGMv=DOhYNtZ5liBvQx+9qB6&8M(D?PS_J!HS5L5Q3ESxcB2{ZLLx0n$e7PsD{An zj-yp^9aiSBAAc(a6ixsRgTm?rH3)6a5D_9E5+pz*NrIrEL8M88$dCompc%@5pAZNX zuoSQy1PF)-2(SbxYB2lkXJ`q+XMYay2jTPIcwGkJOCFE|K^O)w{s|y1J~t!~n1KKS z1`0^5bq7Ql3~)e5RB#1{T_cVFX5DO!?3UA7LJ} zYylQwNm=fT6LYy1 zRNA20d+)(9CQS2917`2vS#bhYOoOvpEl9>vREnU;tLMf@euy?B^v6Wl+wS0V}Wy zYkVEbFU9}xyD*}p5^RWV&~2ax24DqQuna4(3Tv?5J%&C$wq!WqUg|QjXiFcor{J`URZJ)7}ceA=g;5;?m7Kgxf8{+gI!iE`sYJCuC@SL=@a4W z+^ERWecV#7#s0pDR9_p_;KtK%i|t5&KH*Nt;=UdiYHWGtQo&?uwsriZb-C(l@GUmo z-*#YAw$o`~2E?(0u1>7N*~D?qIXzpf#l#nk+yZ;#nKNnOm)0!OMxD9uRJ`jeUc}Sk zwIW&E1!v%d#(k6fPxY>Rm-I~coL{bCh$n*WnYgy()|1^QTFrg|ss+h(bLjN4>IbGa z-K)Clz17eHw`sGNeJngXF#+n^v?|Y0RXUC=co>HvB zX;nKbVZb^`oAy}w;Wq~;3OnFIJcuG7qJp8EWI|3cZl@XI48xLOtRxv5DJDRcA>cX#G3K4XDl2U4=2XL znQ=-NOusuu4=RNz@;juau?iJb28gKaix@NpWqkX%O_+xD!fS{(-eL8=`Lg?93C^-F zzZL74ZMMePvIqSeCS&m{e6UXBMsCh09c}`pR^SsjilUsG7>WctNS2|55j;1QX8TX6GgKEL)b8Ob_~ltpSeP0j&eu>L&;<)S*;O8t`R5| zxseaKkuS=pA3^|#6R0{7g)GPhOtE!Hk%(4tIKy{XWVX5gN*cA^Ae2bKObJ*_>tP{* zY0s0i#le4Xb4$@@KXdiL8i$$~4zWE<-I^U`V$|mta|7X@gHssuBnuY+osWB#Oj%Ka zy7mC8XJAkOsQo{DI)IkHpN|_D3$!fk>K{l60AK$g4}S>!SUd#C!A2dHMP5V6cp!EV zZN1I1!T}`%S^!!{ECRA1de<>n2{_AGxDGqP6DPwoLLh520vsR{^I7=m5v^f;aR($SI}P8d@UI0%fS6#U0;y492M6&CcTyDW&+Wm@|Y z?*uR-?;T)$a4@WKf7t(U6Cx16_%nmQ;Jm3UK^*b|pmyqX;@w7nDrjP*6G<{mJo5GG z00dafz|vyXXw&YoVKY{3`-f~97Wp8Db1vVlff8R7Us8M}aba;W@uT7=#bw3u;##ZZ z)wUx?kMjKe_wWDXA6S~W8rQY!@WhB&Yj#39%o7h^QCv`5^tffjmG7?@-^a2eqaXk1 z0~#2Az_1U$OaCAJfA{~pevvbuHXR~~^KoKD2{+<6k@)!I<6R#LkX9WKFG_cEs@w;- zOy++!Tspyk=l{|0(I-ms#+OnyN@K&IH#S<$0U0&22%rpM zC_0_96y1}#k%`)|CrtL3Jq8_s)Cff9BS!@oh97}=7}1R~jG)z*Wveawpl5Kil;2<~ zdptpV%>a472uGTd!V-$F6IlotRKxr}!}1h|S)yqP0AY^LB(^!?vXIbSCG!I90?2)dlKQ zrxAz*X18F1Iftb4R9cxuOz~)+JA> zJR~Wtb!}aGgxo9?s5Ghs3LPkOodyVphWt~xb}5}}75@BAQe|jY5yYT|aP~^4V?->w z+j3%urAMvd%fx&K%>J_G-(Zz%p3mDgA3PwsOf=v1NK4y^O*gNL&PfZP= z2$*We-lTY&)I_Qta;+0B%VWom8aEa=cURT%v}w|nW&92MpBOx&ot-P!YW#F2ZFFbR z@Spc2-B<}{>T|upqU)1AotdZIGnRIa>CKg@^I3-_y{4O`)^{GznWUcqDB@+xSDz4Z zs&u{FoRaHcoNC>GmJQ93VeQc)H(5H{-AO5pedV%INYadh>^Y5&aL48$^Dj$`mlj-& z^{1KI6;qfc6P=NNFQt5aYqC(jx;r^rWBV^d`D31(&RA1sh>&V={sw!E%oaN+YEF4C zZLHb(d#6ty+QuXb&m?9F>hrZz+SR<)q8Yo;m83Ba9n~tKxC!f|+hknfPA`1YuDlhU zQm#d~*SM6kdzZPMOx0|n<};ntCnycbf6=?w!8lqMCmN%SL5UX5NOY!F*F>fl2 z+bjzwFyzm~Gm;~Pf=XY(_k0oxr|Up>@qDsvB=>jJI5b`%$9c3WG{1$a0tV_(jYYf~ z{(2Xo`62tDM3X0zfV`r&)*)j}$WL3bxmtCiL;N*1c5U!jjH3uTvAwBEGSjM{yM(Cf zW;L!;NS&i8Q&{+m@Lfm6ryu7(Abvc{1l zU^v(@j~fbp{&L;d565jtj$3=viy_0$R=mQIo<)$GNRBJk)vO9jK~uute5C zk`eOP*rrX+)H?z50`a7GxJbrk6$tbnBV$8*HMa%y%=O6s933HFmVV+C$7;}c1{oK% zDaeEFN0q#0Q56u(v$O~H4Qldpp$a0Ld zJGcYsVd!7?hJ1DP9)-?AJ^8*zA%R8OLJPeOeUY5D(~tVs)NHi^G4HDcLn<=*w)y!h z+QnxU`!ARQ_!(!koLQezbQ<+}(m$4j_Ii&bSZE}YhONjW>xF>ny|DhgY1h;1ckj4i zIZ4x_gu-*&W$}8JQOAyISG%MUV;aXcaNl_?I9l@ELqC|vqlKIrs93>GUB7p}pmDP8*Yb7tP|8k^9`J={q-QmrqoADvc#DNib#hr5sNnV)r&7K zXLS2_bOSb_8ASN0kL^@Zx=U3npsQ$(x&z!`Vr&?CD?rW=KI7yJnb$SYqc(5tZ=w3Jo*rxU zV(Uj@g7v5@|al4b%l_)g~7oN)6#9SB|RKJ3wO5IM1;Kq(%M?}KhcBbxa*>iQjk z1_fGT8hGUS#*hPgN*=Z3lI8vV%Nl{HPUwd)GdoV3`;nlx39WdZ5#%jMv$?|*q?;gQ zBAuQt#F#RNWoe$3FFVhRCmH_sAJT6sGy;}@M**J8h3RFu)hj>ilftv`jfg9A9RQ## z^0@r>@)HIELb)9C9^>q-p$29CjmKKY4qeVRBY{c`J40-%xRP7_On|u-6Phc`AGzs} zqf2lQCiQ=5)kpC=ET0sg_4gQBOxuU%AnduT2iUj+L%Yc!ndgVp=q7ok2(`tw@BSD5 z@apf6AYADR!kwrcy3H20bRCU2rT(rH4KZy`5i%OMD5}bO`tgTXS&^tm?GCu*!;U6q zuy>qKJ)9M$OXm$ro9N!ws<6sRjB0M9>c&GXT#cKp-ufE%zUueZq(+M3eEHYsJjhB% zTU`$PZL57^J^EY2*vmHFxte$Ff)BqA?!^Y@y18EVakC-${#(y8@$i;Uwr`$(+QTzY z-9NDpuc` zc;uKAt-U@awXHsjnAp%H*wT>JjL|Z-RwL+|8yM&qS*WTRTIl~_L=(@GL!yabmFgAH zbp5I&Nux-ob!M1eJ>Hw{;85ag;7$}YxENOOoFk_7<-V|)YdM*YT3$FBMKV(jT?w%tV~kJ9VTJ0l5CkP zjgq7#tMBMWR)FcH4-pkV%xMHkTG7>xcQOYBibu23zDTCTscx&p(U@j{Z(vf&Mxp5f znbYPrr_<>W`Br(G5tdxP+lM;^^1R^e(vj#7(VZKeu^(cKHlT`_Xryd^mIm4n-$DoY z`Mv-PW{yD);QgniXNXtU)7Mfr&?D;^!jtI7$6j4{3>rth@SoLoHntQ{Qv3MN%Dda2 zrBPCQyi-AsBEy2ZP>=N|uZ%=ef_hMc@Ne%uBc>E*4+G(O<1&{o*|x&OmmKF2nvfI2 zNDhB7Pbqlu^~HmL$gPZGkLWrO^dJ@nLE;sEU;mI`_n2S@MsVoe7v9vlpK}B5(QWSM z!cIruj2vWNd;5&-V=u!sJ}lr$LRiSvlqgyb;ANP)2fDQwS`=KtDb3fvPobM*Tn|J0 zQ{(rX&$LcCcq+%uuCgqA_}6_L#VxYl`@-QD73>)tU7ensRu-Y*aMTG2e zz%CGuOI;3VaF)Cx7kQWb1U>)y4QAmnCF)*~w3DQN!{y%XH-35e{yO!o5hr}X+$Kzh+FBEI&?68qcStDjybWW7U(yjtlVm9D5mW5-^h zRz}})>cv?c)pNO?H1I6CjhYtI2=bvu9~p9Hls-8#G6U2Y?9SuPATq4NDf0mMNjtB zG0+*pyur4U?kLthV|nM)?upcqX(_+ImtWaWI6Y%M!N&c*D}ML;FYmd|vP)0N>?wMg zW(qFOhs@7!@JI$_%)&)!3pt88(@`(_(oqVX*+Z=1nFAC8md^Nr3=Mi-uJ$=cIUG-q zp2EHT#-BSP6qZc!TUx_hxc4)ZN^XU#+`Hg>*p}PI+*KnBvGTO(|O8V&9`?? zU=MEXb64c2XV=qrkoAO(rXRIMMajJ7V&0G)eP>&1RVMXj>XfCLhgdzAh3iLN{6yBx zHm80Kf?7zr^^^PKJ%FWmPIl#6gX%3meZN0|rB_bYbn1f%JT&$`=y&U`P<@FUYAQru zB}9aAXj^pQ=NTMR3;ioXE^Ue_5Mti5sBoo z(|?{~zP(!hu`;z!4j~74httA9o?O>4Otb^78EwsfWJIaQ2F{&_+_9qZ{HI;Pp&`1k zmZPwoBavR$^MVP&%kJI6FWdy<=Q(r)vtamhx{!tCun(uZI5>WT+2XBN1sXhUw>$aT zu3dsz^Ox7Omj~*}(^5o$7yFpKJ4jPq4)@e=6-ybZts0l}Z8w%<}N^@8$l< zBrteMpISf7`Q!f+tecbj)A*@Spdfk^3qx+j5OW)(R zJjLC0iZS~yx8Iz{b+|osUcl*s8`2!d?>_B&e@cm8ng3+}`<|!AA@GlJr=VC;iQr#B zv4RpINEl-szgQ>9N7$G=TmwgjX6pfGQ~$68n4XmYqD|j9iMy}^Fq~ZmOwY<5HUiG3 z5kxE-Iwz;kzG^-5Y6_I&9~V6?0`bD9;~WzFfd0#-eKowPcIsYQJM?T95iOlOT`l~~ z2@E?**|<&2qlHJPw)One*4(HL-B|7aCzDcAoUC;m%|Y`h&;Im3cuj_+@rAH3%m&+7kH=q2;Fg|J0;yh%u25VbBM zBQZ|TmwfZl&V}7?wbb6w0-cz5T9F0e)Q2E2Fc_M4#~zbDz~~Kjb#%@rCSVzW0|vw~ z@C-yyNk@-L)KgL<>QZ%d;b0xUtf8)>T66Y^tyBamsh01>fQ;YkEAd z|3Rn_#69_6ClKJnH!;ae^t)^+BZ$luFp*H(C>{_Zh1 zrakzc`uJX5=HrO4j0d2J;`zOF_Q@?08DRi+Zk{E8l+ZIge-gKgy%GN~yoeAvuO4%a zoY)J-C;qOT8SeIr>Oj?FQ}#elf>S)hQtTtTI$dTaXmhE`0nubJz9AAgFDxz{O*Hij*c3_#z!3w4$9*ou8+_k zSbhAJ$e>9Xxca!d<6K@Y^xf)Pe1W>%_5P-`WJa4J_Sfr$Hv2Y*rI*-WZHi#Y(FnLl zjUYUCQwjZdcCFj0+v@WS`tMC8$&7B9&gFZf3;nnH7l!WNTJDkoqX8cJ!w=c|(Tb(1 z8saB44Sg*8TD#{8^{M#WB#k4dG%bQGp}FWOLPa556h$SXzPbicUrCXuuc1!V2jh0T zFdwYRGCE~&GEe05=;u2}CdA%}zMMFG=g7k7e5FXwf9UdMoC}5QuzEldi1gSt*tf#n zOu1y)17kwt=DueG9dJF@N6MLY$A5jgw)Upyn~Sfnvz>Q>FY~VA2x!h;u8N%)uZ)RL z%FLmqdXx{1`q$;;XXa$(mW4d&FC*s`WaSoIBUO#}xs|79X5}g+Mui7VJtV(-Nb#TA z@}GD>{_v3OKLJO1O|Y&UmSdkwB-15}B`@q>kSmr;mn->cJ;n_w93m?sqbuK6K(}wC zr^S}$aj%_Y==1l(uV;24uskd^BGcK#DA~SO;l9kn0LRjRo+dkjv}THD3(v&r4%_@B zgOnQ=9+mEFZW(5s=+hT$S0WQ&%4Z;Q`Bb!-yH%mYExC^&5)`u(SHQlsmeJ4*)ztLV z)C|?o9F@BJoB{1c%aV@kga(lQB~VkS5)EZU~cQ^of1k3^+|THvom$Cr#2Lc za<|l0bJdm~wk$i$)j;5BEZ;R zjPwg^3~%?AjU%h;%1E_w_;$pnrj_PWFS-etx+I*oIM$R#G5{+TXBy!u`T%GKHtJN%WYUl$O{ly(hKgE?ycw>y-?Sz^efKd=dj7sD+P4GHnw` zP55vg2L2KDa80itz4fH@2 zRbM2W@7GEx$E9lMNSwW(bJPTLI319(d-zew{J>CNU?RKKJnC0?+}EI6eZRl5>fu0b z2gcnoz|`3OGPs($r2{ZAcJ%iKN+A*@m#b^+?Pupoa&~jHv-R^Bgm-morhj^2w5Pu8 zhJ&LKktKxhyMmIAJ~cm8dJy%25)6r)7T@n$9F>!&&kxbKijNP8@{SdoN&7?yr-0#Q z6?GN$f+GBtN2Lt`PXP0yv#bZRt1e03zNk5Ov%lX*^JS4HZ^x~nY)|X##{9jCCvZ{a ziNTCc++h#AwPnhztGh=`4d;Cs=eAn5G)EzU~<|Z8>Qx)jtt?T*1xG zN>f_fzCFb>#nd)t)X2=i)wBow9gJQ1{$$h;3}0H%=p#2Psy16cJtjIhd)qpM*lO(Z z%?{t+N|;@}_VJoAPa+;U!K`a(?1LTXX)>Qpo}KiFQXDJEiqX5`;`CC2Rf z8U6lEX*%t8n2~?>D)KK^G>%PgEQ-x+3=B#gX$Q>^ov$yxe(%)MGYHYs*V2?K&oIE$ z-ob-wYLoHGdU_?S2cN4V*&NZy&hwfXC?WLF8BTVGi1{A{r>BbcTyEB)rYOa9{FU(9AGLmRUsp=h!-rkz3Wvk>j%m2B(APN&_9uUGO3eRC zrV}jgIQhe?P1Hte3u}6ACB-iLjE=N%rH~F z55p-b_tdz0t-?}y!@Grof+Ijq?hD&MQF&o`9|tFI4)A-Qb&88@i4Jphlk0AYjpUk< zR3}JC5-v$esA;%kTR@)jDKIwA^;EpCN~`cmU5P@b`92o8DA(A@owSt%?grr~LwhPJ zr{rZixOmS3>sP2=yF^r8)wcTh&O+OnNF&QwR6)U9GB|q809`c}>qtdajLr4JWrZtJ z9zO{5klSRTizepoczC@7<|MRBc(|ueSh)KM=g?3ekMI!05mW@fXEz>B<~^L;2nTLA z-%;Bc-*ceZ|G$=fP`Gix6We~HwItA4Tx23lG#*YIWxftJ^;YIuk1Wr4Pf$x{i6W~-T_p#Jro~57qmxC0wjQM4r`*qS$pp2%fU0Lc954?^ zA7cHw`y5hD^N$z{9Uo1T3<>gZb<=v;^^)e}<8;}gOI{rMgFOzTr^%T3=DWe2SN(&L znv#HBVa!rHlc^tlVl+kaYJx!{)22D(rjX^BkClO@w*+;Xxe8qtxiW`CwL0ZDaXmVII7qaBpeLK?8jTi^>1TN2hLVqEz+$fA4XNxF9MrY zt1Fvx^Q)SxN-8Vc^Kz@(s(RU)DIut;p60M1bSbbs?FX-YXJwaSm)iTa-pt|tKOd6k zdiP#}TdZu+#x+acf;nPRMsj5MjgriSwj{*;9>y$$5~HM{si8@PW5KEhfCV zmYQ+B9=WFS-`m$8fwv$h+|0ez_?Wh?IzdjBV5F?5q6upCXO0e?`FeD4^T7ZeZe`wY zxgYuWK^JNnEB&<-FZS0!J345)-s!jjtcT~n027|^yO}u!lCT=b;ab5{Uj5s6b(mAj zYZh5e#5P}F`*@QjLvkfxW~(S6a`ET{f$O}HYO6naww(VL`@uA}}JVE8>k zO5)zi`#i!zERGk49ksk<>3${Q;P5oqw>G8#(tW3%gw$ z;r~D%EDF@|zo)h42DzRS%g)q_W1;Y_Dkb`>W*ay<*U(X1mSoGL40td569olzTWXMYU(AZ;_cQ}=kZnB-+D1c6-q`g#8&IWN=Z|+iDF!&)*uY>`w~cHNHhZ2LJL*rXN9RS;Ac|PiN2AP#Dy+?-<*3N`? z0F2ywy_bTmk>PiBGAC=bid2@P&(QNIe>h(cOxcC9+OjeK;LUpXtJVwUPgUz zg}mn%>q{S02PnidER5Ai%kmf zC>rR45>r|av%#aNL16;*bIJbv+V2^_gY@j*?Md95Gn4tn_N|OrwDT*r8F)gCtz&e7 zc%=W51M)(Yjl0Tu{r}Ng_{u&c0cp64GR1G;Py&~ zrYq)cKiJ%J+t(yO*}4EZxAl>r_UME8oF80{l@mH$0>=Z=6oY2CVpr*0 zo!(^(GexyWc&gTXE}ZMi$r4_*$hCa;YoF)Q53vq=<~c4tpE=#qh!llZ^b^e*#Jnh_ zorQ{VKY}JO0~3&g1fYO6_}<@6d01ksktlALDpFpZ72lR!oKAD-7I-?l!miA_;}sUI zaWCB)g4AyoNDZ}h#f8phOO~}0;^7_4X)$p~MqTSKyD#Y1TmSwlis={dOsu3jmoqhw zseZ&XrBRzLKH4Alb}{)@0iBPME=%^6AiAWO6m{Ny0~Yzpg-T;yS41S6m_$Z*U4Y9b zbM`%=ToqB-6qhn;bC&k!2!m|KTvrKe-w5)SbTl`OI{bb*gInA`#v^-gDkxd1N)7SS_d1Dn<`dsq6i}Us=X1UCA>tTc$B3kME_$s8jjXxWZbKI_slbjeIJPW~DNz zVu>j%XX@fP;W@Nbg?USOdo8l~K)ehBfWD#1nUsWh!XqA#jcGECkAD+EXv}1CLTYc2 zo+13xk7cWHA-|KaOwOG}KqaZFCW7_Ah3Od023XjZS{ zKtgQ+2LTp%Lqlp2I1Ok=B7`{~iNYy7A8qGja3t1AG>(JZw!fS#4bv1PScDLMeE1?0 zCqs(#wytHJC=48@QGYr$geUke;|Q6LX%Up@=)15{GaLR-hHAYnJF0q%%#e~j5+vu z=Lddny}ykP5n%&uL~6vS*ap2314hNhfYCKVN?K4VRA8hHqG%r$MxrRR0a$1Lwcq;E zkWjUfB|?a{f+P}&A(8_jncVr46-*9wl_M|RkEDf!J3uN^rITbYa)1rf$oHMSTQngk z%3M(e!AlQJLBE%|@6(Hr&0#^~FdoGq3=X3paU#Mb!j~$1ChvTI>igzcHXvOINNH`% zH2u;$>0{os|7}W1aDaXu-oIyjl0X8v_yFwhuC3j*<}IMRN8xk)3n&Z|!hrfen`XOT z<2A@39qOu_0$91|0@&&D?)6EF_3X^byR)++$-4$gJ|C>_{Ib@8;K0BNtQEx9BX`oV z90I6P6BG?qSX8Ofr7j7oOVO6s1^(;rmET-UJ!#@A7>wC3_BMrg0`xHR0aGeigd-5l zM2F;RDB>D9@5~3DysD~1dGqUp4dv`x~8CzW$bydbNM-GsWzfyxD z3c!(21npu1Va*pJMG8cY9Ed!55F8wcV#N@Ll|gjtgL1_W2m}gP23P?CG>8-kuoMj@ zF#8{9?+Oa%rNpv8;iA}(2vE2@AU+BdU;yKv2DHmAh>Ze%paBgA3J8LEGejc{aBx#k zcCwpJv+0`&m^D(g9Uh{wO3H^q>xufyo&4(QDQ?EgzCRa?m>YD3rxapSL?)cA)S&uyS#8a;2OoX% z*@jKu{qVn^enIFr4TC_Mq1}whdPNpODt^!)K0lJAbysH8)1Y5ot$U5w8WND%p>o@I zZ;@xKyjtcnstkQ}esm0)V>&ZeU31+HH{*4$&3WUkdGF$VYZfe8vh1TzKHIPvTdn%y zt8ekWWj`juyQ%WiJ5Xpu<;*8|=r@PZdxotu?v+<4OlGD&#O`hKO@5fBxi`tX`yyjW zFG^09IGs{l8w?TB%t=(|yZ};x7-4Hy(HYhSywv;1V0z}c7haBXc!?7_3qDICwu}U1 zcHDA6mAS4bu0b?viuWyBuxQD0{7>9ZzxELgH4s8<9cdu59Y-+BMEm@9_v3>H{hRyfUR2xL=6Yu7riL}VPF9PC5vF&5ps}MPrDN3+;vmc_}HN0#K z?cP%~mqyR-Ze#<}`%g}-I87<;lH)xzlV2)P5mW|jiIAy3GHR_31J*uoNK+&)Pj+nk z-u2$>I?~cw)p4>%hpDTr=$v2#JFk0v=___U)2E7Jirq(6MDXnRM+U_hQ zpO?6#`JuG?R9#++z^P>M4f=$C>hgT;*DOAv8=?3XU3`Z%dCW8Q9A6Bn4@A@)Q`LN_i?3myy}cm&13?Q9s5db%74A|&!?>-9b?~Ww7BF(NorUHEvG$KLel&SsiP&W z2ji;py1H_UqGpD5F889by)8R^=uvZcydP1FrjIb*Ep)TBS+0E6pz@&ijh$ZkD)iBP zpdfi={s19O3DS5sfTcl*gChAIZI^v8)aVeP&m=jtMzjqXD6+RZxNxP!9Ti?y6`il0 zO6(r>j@hgEUv*b3JLH2+Zod1)8;b4(l9Qaar|lI$+08b4kgylTK6t1j=nz6QkfjYm z2Wk37Eli-f0fYy_JmKMW%Wt6gLqr}xDFvmhi>Osc)>27GS`v~DX_w)$5U-=m z6iNaTN__ieh>b#fBgXbyzTrXqLgF*h?44_7H5$HY1|EDB1gPWN=TvJfu=b<4@-_!j z%!3w3IN8sj9ck_!IM&G_c|66gLPgLV!yHHhEdgjR@1bTM6E&zS7d-#U=twa6FMRre z)#Z$^0B|gkYkB|6qY@$^{PO4^7DPR9Vj=!&+Dg4Xq_crG0XCAj00}6b6(uxaLp%tO z07Bn$3_-H?bChhr=O)>9H|G`$8KMaA0y3`(roqin8HJaqUTC%)bVJz)<{lMMU%*)p zMhJnh74YzNqC~iLm;Cm}U;hyBenVPNpa=y;+794d69ju{V@=!1kR?anwm!DQ+7ZIU zxJhY}PT9IlN))C=`6&dZBC?|mK;=`V@DdS_6rrZ_CFTsYX*>99#vs{71P$mdZe^LTfbV^KNEVH8}qAlGuRwB z4A=m0&{0lAz=H8-g1_LxxiJ6>c@mI&6&Ds3`jw#bRTPpcfNA&txH^~_9{j+vGPOFT z-=u5qTJ*_3WXDF03vn%;$IA^I?2_1}v8!Meuu51J>~5?!mVmXw#$!+63M!I+|NZ;_ z_y?AS)v8Uu0he5N&yvqgvr*)>Ul}WpRXk`dtjPuwyT0`vuFGVa0#>vtRLLvCH2uc^ zu}4+BDYh?2?wc%`(j>e7CX^5Lx$kqYud9)h1|asecaD_zz_ZccHC#By6%W5>`22I_ zdFHtnUV0^8f!F4|@z%U|I10aic+rX!+w#R%-+Wi%2LuW~RR1KbfR=z*0{9nL_EWIx zRscy2;%9(Dc%(y*;DLsCQ5B#J^dKx6O(4)z0m!I*iU3M0wVH-wCP5ja=Lw+308GLD z7SzZQP7GZlv=`A7i7-?|x?>2bS)ujuLNSzSV`nPBkQ6`RP?!D9nM+r#lj=WzObs*} zr5hSbU;?T6sZF7UarNVnG4(`#lJ^nX6v8YRya+1VCoYCKYAJ4n;uVntg?Ap}ykyKK z9t)#0Qb?4Q=7tQJli1qm%>yqyNfTofmlkI7IME(hrY+5IpKL6WFe*>tDh&&pSDTEv z#YBu2wzee9f`HKwGSdX+5F*%E+&^&dX;}k}(fB%T&?FH}c#~D3nGyEG97g%6%2upa z0-7z3maWQyEz47kWRN1*3=@i(JS@o5ef&G3vx!X8B<}Hg;5c?72Pvkkvt~t?@#b;^ zA|^}#>;^=1fdXWup7I2F$`mu(2#euF(pZ}rJFRGVgrBF1_ItySZpQ46BFwT@sroMD zXF?0p$+-+x+_MUhi0?BqAaSHL6&VwCTGN)AUP;xINu@7ALrJU>(5gDzo9btiIBbYs`b$)Kj7z0&AQy zZFcNTN*y#DU+XFM+STs9^+|SY+2xx~#K@s4D@471zm*Fi$W5Ed{~>D>6YHR>edleX zm|x0Bh%$q0n6pZ{J74USueUNY%bb0Q$2#&OxCzrfb z*%Kr~@saFs=UK0*qZW=l_jWblE43Wf>>*ax;B)6wi|xg$0_77j)9V4i?sryHq)BIQ zDm$skR0D^DmOPS?ZI^w<$Q^in?W37+sfxlWSu&qGRfo5{cww|HPWj3?D*N_Seh`Y` z7b!&})RL8Z9AMOb#UT+D)m^A0t2K*aZ8?DJsvvKf7qyb=w#8tdBqN%aR%tc(q1*ED zjYvgp(Hul1PeixpTrpd&k1C^DP05j^4|hQvA;JyUqJ4MqNxCE1 zMnd8=m9x2+jKp%WE-e#z(P{Uv0z*tH^O}kw2ef!7P@UObLGp0P=NML5sW_39{{>kg zQd^9h)=|zz!duesQO4)u7K;XIDTOl83GPhZ5{`hHcB86QW+uYk5D^{%B)YNRcglkN zYhP?P<_apK z+=8iXC^@3bQVwr8e=_B11*FfaTRCd}-;V5RwbC1$4yH_(z}=}h@or#1m>^cab2EqC-bWa7aqYk&=h zbFlBxNXgCyGY`5v-CZ6ELZ9#4>*zv9A8@@;WsJQp+P3M7R1pK>aY{a zxQNG^srWDq<=`;v$TB88Arap6@5&hmfP#OzJ5C*(yp#2k>^(ZIR+whj>c)n=G_H_3 zVL=FUgc$V8TmF_Yb4?UTB24oTxy*)VojFuClH?dA3TY(y*(g6i-; z&gdxc2!^ywSUFJX!FS>Uz!K)nmB$^7C-C%J4tn+VeSSrYw*r5znx>gvzCkLpRN?6y zc>is80u~7+A6u>1jr8v_d;Pxy+V%%9j!QZv!qcy;WwGg-vwjzn z!!O-o7CNY7r@)skBSl1|4XkOlyx__Zwf}U)K@lcuEaJ5WG26vEnOdMj&JkXiuX5Vn z5H-4|M2AkU>OHj{e5>|B>wc5B+M%S_7Zy}a9|AN}8$Sm|P-H%o4 zJ37&5Yp?ReqPEv+<_XQ*f>9?MjjUSp?p|nBa+YbP)GqO9VInY4&&H5vw_u65!kp`>?hXvC)o@j*k)#AlT1hK@jI1)1h% zX+gDQQl)&FJBW8B?rCh_b<3)Fch=)3G#;HI9zA_1_3jj+xqW$nkJK_gq|4Ij#EXHS zE6F#f{?Sw(+m8L6$wqxH?`2-$dbgi zB$*;#O6}C*V@vJ8rZ9wkvM$`ro!me@@pyK;Bx3xDHW~Z=v<4_KG%Slv&f=Y>2cAYb$S85^<9o+)RIh;~abfma$&y z|C?@n{AGaJDXjV1@Z~Rk)K2WSvA|A7sQ)okci^!9sR*V|7jgn{I4>G=&FhIWkQc8# z{_4-5A14L`M0p3YIZ-MFnJ<>otKa^3a+MW5S6E|9j|KT^T4NL=(wi0@K&M7~k#Vu9 zqc1}WmUv!X4o>L_R7*XOJeYi0VP)mH^uk3PB{j?|ES}}{{PR&TY~R_n(q)Jr`?AcX3>@@l0w)TsR@u5eu{e2>0{C$~`J6^bXhEiNSgJ>R}j7}N@G-7SoQT0xsUQ=ZPae#!+&S-N zSLf^PY;Q*r3@}pEvh;E5E-%IU^dpcR!D(G-qRm)eYn-ZP5aJ@Lb zBG`OY%Ur-wmuf^$d(6`>PA4Sdrw(4}4;Ne(3oy(zq>k-0SK4*-`iusHKW=usSx8w( z>fKn;$M3%wk4Gv@bK(T^EQ{;m%0;q~eFLtrwWWX9>-xCcDknXPtjv*!z_W>mE}IJ#Ao{1Q52 z&p7+})hZ9tJ(HGLh~*hgSWju(newy(ljEXv+f3`z-XY^!5>nza(B614RSW z*km@)d^Jb1qvKOq0@NN|9>(Xxsk3u&WlPBF6ZHtskO23Pgh(J0n|fMn-i?~P(b(59 z7!J;IUkLPn&e-T{Uk2O7l?%qoSz$|x2@aO;7?7_qo{`Tt+R<<(ysO`*~m;icU zJF72UIslaU(@*Lx6$Vd_ZSQZgfcvB;jW!ActOvY!2#*iJLdS=O`i@nYC(d$csXxfO7ftojkR8uZ@cnz4#v_gYKPU z(w}6apRpY%xrGO{+1GLj1d6By7R|pIlNK8i7N3x^0eUW(Zb@Ex!Co5Q3*IH>pZO8i zbZm>w`7ci`I3p@HDur%OEcYwf_s@Ri-HD4k9&h$arB*&FJGg<3NOA}J&WjTl)h?dd zY6k}%?&PQaGU$IrMXlXZo2n?vP5FZsxCu?+(w#&{ZoRCgoE8zpuc&@tW z!ByX_>OCDRQR!& z&ak?$5^eTLotVR=2a2W5L1WfA$O9pXL1e=Co#6Ckq1_m%p91@qZ+}@tCdCkHP&g$d zw5m&~C*%m2@BA}=;A(Sd!d?~N1s;*u2+oPgMK$cV21Z*5N0)sP&n~zR{!$8-DUZPs8!a${UpY78NW-Erl! z#&0ZtbwYPozJB0!gTS2d#6FO(o{lXZ@W(Wa;re}?Xg*o`0SFFw0SB!r1Qjhgb9btp ztq0ZIf<~>PQ9(hPkT7!b+K8Q{_=5hPyu(Sd_1fy(59#kiVPUr2te&bzl(zEbT<%S@ zhgK{$6{vvRdjfxQZ0YoUht8PJhuo8QW=2$o=|orWT+K9C#0~k9sh(-NA%AcLkgFl^ zr^i)ZIn{F$xp5vhN_V38q#A|&!V$oHcU#)8<>JN{(n4Yj2>E{*wOQE%C@f!NTsw=A z&^lC~&=tXq>jcXOQa|U_raFUT{^Ee=xv&5uJfrW%t34PjPd&3Ev`8!LybiPIE|~BB zH^1lFKxn=s`!Dc3SNRjfZl78>fc?LT)fQBs%b3K6fM?@<2Q>Q_$T!S zN}}xmN46+ zdx<(p)zjZ-EeTyfHC%7i-L5mA?Ei4i)J*aPm*T9+z|rJJjrHK%vcyU*_jk+3)u59= z4hsurU4J-ycL05D_Uy>J5iPw|yX_7oNa}<6VXtBDce9w4I&JV483f*mLBL(D$D`L~ z=f^$9J(ljHm+STQT8A}9=Hc`c^tFMz!}p)@`S=BbJ$2i;vrE;snfhJLHUwgj<74F9 z=-WESEW`FjOG8_RJ@jR6prk%)OO5Ta^mZ%tcH{V4)5YxGe&R^wr3a0Qt2b88?Rcm> zFZ=vH?t=208*kec&%8p~#SyolP?yk<8fd}whE{^MDNjk7F{x}rb%RcnXu~wMuQ&3} z-}<(4cXs2=C1p2vPZtaK0Dt~@{5n{QM>J>Nx_vw&JFm2YQxw#6^$x4GqADm+R@oRk zb-6LVqS{JS*D;%KO$9WSl%j-wY+7Q(t%>;PD8jBsVp7D7i*eCxVEnp)N>KWowt@N0 z=Y!Zd>;P6)O;&3_D^6?hi^WYt$P(F(*?t4_4FlwC_2$l-Rj>GrnwwRN3I1VcwMUgzZ-1*{*qHVm|x zU6>t>8JL)D?l{$1d(7XPLZb(BfSr~Q!l8S5ItO;;ch@RPoakr~?`TqXZB!QTHk0hD zS9THaxpmId_FDD>Ui_eN>&`_l($&c+()IJ6;C-nv+}YPSVmi zB@#Z6T~ydqQD79X&Dk$!FLh^c5z`Lb3^i$BB$0RnlXlV)+@3<8zl-?o!TjIyxtB{l zWm|oJQ6`&hJfjiS$!l3B-Za%}Z*Jjmyr9U|*Hp*GhCqihz<2Qt_Y4Eydv0u7TU2Co z>tge6 zDB*Wr}#7q4^-U;^op&W>IY;O`tjk92aRvqIr$ zZh>(}bG1HEk*s#S(ZS0TamFE&8;>76TDx_jrJ=!}uDCk@p{Z(W+Yg~-`3Z~ikS|Gr=FYvn8j=9-!uAp4(V#>vif304g4WIP$_}c8as2XT`Mn? zZ%khfH&_MT-SNQ^7joM9g8AXAR6@4lDGm0-7m`s#IJ9|PGNyi4_~|8Ub)Wk7b(jZ* z5U$W-8+?q)y2H68z4ZyRsf+_2E_Q2lE+HpjIx{I6fnJ=$%kLlNCl{}sWHI|4b{RQ( zIMfx?3@uDQaXGG>gnu8Po#I3#nW|g4yO`G|)%iz`I@!=DRxOxWaCjsAy`;+2>W)Lk zxkp27$G@N4gkA%CXEz6muZ<2?vKDjU-ov=ajOgpg>;~`h@neEgffqY{A&P3O?`)x|)#=5G6=r2B`nrbzUS`{09w@Xul`rw3uDWs|Gy6@^ z(pSNmq6j;U`grz4ibG7je;l!Tx7XZs*B*azGy1Xs)!Sx!O|7Fxx{hYTEtJ^{!&K$uS z(|7g^V*gPAzE&00Wp4Ymxm|o%-h7w&_>f6_ zIOlIu4~~F?1T#qNmP#3rs%j8K^&0oriA&dV)4HYNx7xf-*GxGbWd9w$VZ!UtBDA`W zGjIye?LH5b-EAp9mr5F!4%ZaaJw_gXMb?|k#n`#&VQvLj7d6LoB!g#WNh^nIifbN7 z??+?#n%M0uW=!kw(YOvKBc_AE?Q{r;5o1Ox1keLOFMe5g@o44I%6aiUQoX>JaL_#` z(TAQJPjkzP^9#sGh^44C2REy!4+IW?ZpfFIyavDBtzmjEx2q!RJp$3WO@2y_Nd_;r zsbbYZVo{~g(X9}5xM!ixH+&X^RX1LiEetu=?rwTa1`iJEK=*?rCFjZC6O$=8h)r~a8d_FA&zF&O}ed*NW zr1&o*Szbo&`b)6sqwKw10qfAgoWb(JB33<^ zs<`^C`@vWk`P673x4*r7TX>1E?_+>sgt*DA5w%CNk3tJo2r8gsjdc^So$etAmxfB4 zci$B`zjSN1o}vsqUsYD3W^lLloXa&V{2|@Jq0aZ9^TLe>xWL5ft%sGKr)4}?Hvv2L zxStE=9E#!A-K!_|%3ZV18-!TfqOc>{(HN#G-uU1zc?>7t*_y5&PYBI zJcG6l36Ie}WvsRTCa8Ao>aEIl6ZNz*i%85bPl-Qutmx>;c2te=y{*;drn62OyVK$i znj32d!BCrR+f%!!-tH`DF^!GV%QnnrwI?5`>`rFoOQ zivZI{qPQ+m72Nc-uGOp1nmc-WH0eKr)mY}dIC5n8?CPpKw>tE!$$tTGK{5`*hWoES zX^(@C4lnU@hQH;T(=q~4{?@fX>nP8@)Zgo+LEN^Xj6V%9aA-p`D$;_OD z*0g9@Xsbj!WNq|7)<(BwZ8R%uqeWq$MEoCBcn1((u4gjSWns)mhlRCNAQ#BiF}8kpa=Z6L`3F5me%bTP#c_;hd|pK>4PY= zRd8dv~DT3-{Ph?-^>9HpKOn>3SMe?Rkl+-Z$ zg(5w~iyDwDl0)*+Hi=(h6{P6jfl1FUy1e!z2Bw`h0QBO`c6Glhf5Z6NrjyQKQ9VZ7 zi{l`pxAtS)r1zoTBm~rzb%HCXPm9YJOv}{U8p1U@yP3#vtp|hrQ}C0)Gi`*_H)4JQ zxMO^+gtiYpn&MJ%5u+@I>r4m@fqvF(NWjLuQWt5bFx<#?Eu%CBWcPk!J#B09t3JXn+S+)sX$%5h zh5ppbvq*eT)JC&5_px5;vo18&HiF{o@?K#m2%$j!0#+A*cY-ZzA-+VpQ&=oC(cjV$ zX+tZgp`$DxV zhzhFA_%pUz%uk>PY`_fkfC0h6nDu14hlPyT#vmo>W{sj$k=%bdIPYUuf%s}|xn;z? zwB=?tSYS9aj&Jpp2{*NwY;Q@Yl3UY^DzNU!I4!=fGF(Nna*cIvl^?8?_%g&d4I7sX z+1!N6?~ubla`y-FU_|;&)Or;po~M(xtTIP*sK4$0)(hiYY{-exR6=WD*07hPKg3BY5?{G%BTm85Xj$ zQBY0^suC_~OE6M)@uBw%d?y?3y-acc=ZIv;Br7ILZ{IF6?Rmy8dUWSBqDM%6aJa9r z3x?9zDKP!5F6_M$`#&etgpf&&>y*T||6)BCK;_=dE00gUR#3tUrzsZM$TcgOWOa5Qv}wc(4W=p$*qEejx(z zU=21xyTL7;NJ6d&{XQ$y`NYXixr}uO7L3G^)Qwsou*SKlIBBqT^gD6vViqg$#D&CZ zg@dW)x={#*=IE`(sT;?mO^zEIv!)84gn=ekFS)A8hKzl6W}lRtlj5Au{b52tOBG}} z;(-7x2Lfs*yyUGdAru;tO9E#CVn>89Uxq5m%pK8W#d23_>B1gDY%5a+6P?4C$z5f$-Zt_~r!o?SJge0@@glnH~GD$Z34~X2U zE0bl%;7Acz1X))N2(GFgVT@Yq-=5jsBY-`?2f+7$(U^~@04RVq6&D#7qcRBF9A$K4 z^fBvQ`o;<#$rZs4l#9{$2D5pYfmrCV|K^|X?|EIh@0=guXhbs}fpn%)uNDYPboYIm zy*ton_{)(dd~_mQgrxmi_>flM#_Zm?!{$X-VM;3!xXaa=?kDa(ainC02D>ngYFVOW zO;T1^UN|W5|3CL?-#xEH>3~7cPLgmFYA(Gg-Q@oQ=B0%14+{VpyH!t3S4{$7PSpTN z$W_&D!r93Q$Npaa?{s7Hn<@bM#r zg%P5n2ytV*7+*yL<=fU0vEWbk* z*J1hNeXs=!7J&UH09mzUZwn%T00b5aa7c6jLN^xB>FPP^!rW1Q;&1*F0qIr|(Gf#Q zkwp97TA$VBX*f}`4d3gB+g+#>h5>hgN8->gc%Y%c?*>&oFMVLLNZ0EyF@lu`MW{k{-t=wVX?P^C#Tj^mk?J- zCQof8sDPDrf552t&6uR5nHllX_hj$vTTcTP0L4DXh^Y1rFzOxJ4Wh`HDaQ9)1aA*W_?*D z{@8-FjK#v|GTEARMHzeKY#nlamv31~Xe6VF4o!n*L6Qy737eoIRuhzHs{vck30oDn zaQIu+p|q!rWhFE_h7>7V@h6oVlB6uG&tTVMcaEq?2{u{@#-Mf#TL&9%tyL2CjNRzK^j_Jmzimmejo!cSJ7+TE_lTYD2-h=a z^R2dom2G2^vbn{^T*L8R#iAkaWqyoOr8=p)K2jM=j@ci)L2e)9jpZcTw$Gzz(HM)M z+{rwAs`c)qbB&qcO1-izgb)A@304lE&nPTWg(D>eRH~!PHX0yjNEEv<#bH8mni*6V zf>kpm6apm($_VwWlgL;HN0uO_Nijj11&JZ#NGOombMfA)NXqxmrkMcR+l6fh1JB-p z;~o1tM6|sC4xltJ0^(LN@I0fCxw#Ex&9p4{ai6cRRd9awyCew?gk!-3NL$<=ea_MW zXu567pyMguJuRqxB6TE!{{fc1=Q!X(P6P1610_^k7`H<=s@=m_Vfo8>EfofV?$bC; zQIb-Ws=Z3ruR3D?p*!m1Cuph`X`RxvPrszg{C)fPEdYhtqon;^`MU&yL9kM*a$vf1 z)ibMPQKec9>&#tyi&l1R+BtOSq?Q#33-PH|@(EYTaLaTnam!YT$q6%(9M)WvUbP;UP)U}{$kgEN zrA^|c)<7u^doz_*?1^qV+TCB7_7t$RLNVerP^jqwmnoMsEt2 zvA1d*Z?Liau6wm^(6KCHw1Kob8{VF1x)-=l~REb5Cs#P^?zd(Ja>Ws~xLHlgr zBv(`%V_9HT(w&NG3+*xOMdAeT2qLkiBdGlYp;U49-=)fWAvH90i+_v7aT3-q*H4#^ zSI=7m;=~&0GUAelS=++~^43j2KjXGb#P3TDu56Gare?esjafpt zGuqYDB$;d9>*tXeaVX?CHc(8Qyi2bws^9_W?F+iOGgZ zxUXN(7{l`lTY`gO&`6E$n}_uR&pin&g{0N=RFCZdBDN-9Rh%zq7)*YX`lU4_o1{Gs z-EK3^YQpdOh}}B*!@LC8S>zh)>uIcMl99;&7Yb{1s~Ttv|E^vgPKAG?pf-DF=0+B- zTTM}d@k_2R!+fzdwKA8Jds!JQEVRqJHOc5 z#nI`3FZ1B$(4&b7#T&_rEsFE)odTA54*6t)F^oTcZQHSEoAhMpLqY* zTx`mekkKD1*V~fuxcK6!?$>2gafH%w!2TuFZr3Q~jEa|vL^T4AGnbHlevdCc^7F0M zLHheWAwDu7Zi;#UUfs?O>$b^MqM=H;LN4PfQjfb2QvqTEq>LFRhSVAw)Py8}rUBnU z8j99;DXw?6oo`uh6$p&j)r1}o0tyoNhMSzxc4|7Sn3p;sM4Eu2x8L70pmmEXa&F zGs-7`$t%w+zAU<)zE_ijz)Gk`4vB@c-` zD$0<+Z+WJwlhNcaEsHX{f?V^~9sTG+p*Rzl+T^zA>J!wa)AePzv<09(+|jx=QFF;V z^BnS_9<~iT_+xYM9p-934It|L9@Nv(w{O``2pTz0{Wh*+{8G$ZTG z{U;HCTU7X^Mx*3g$T)3Ivi(;h;2+w<_YrGjqs$=%8K}o+Z@Ss~(X!}#@OI7Y@a>7n z5y0Ava{o#Nq3{+X>Z0TI6H@zb z$0c3Q9fdgiRyvw_pJEuFMmn1uId@y{V%7_6vfa~kImahiKr|A?6OGC3X{zo3{g5t&vxM~10Lx8o>j% zHzc|4RAJ$`2WwN&aTDD7|K&%*x5lDlfxWqi_J@Lzm{{Uie^udNEP>b$Y*NXgnNjz2 zxwT(-nV_G9rGVtrOBr||mWGNp>U~lE^F5pyuGAjHmgEGs6K&nIkdaK_EA-zWX8gPC zImgqpHzNyUxp%AIGK!@K?hzgbW9Q;t9Hj3kYr(|^sUL5Zi?>gc;br7etm8>w)PZ_k zA=$=w4PSmB(-yui36nG67VD<={*#8Ai85*1kk;Zwl2jd#b4C$lI5zu(7tnq|RVB!J zV^9=S?u!ndAK=&|$h6~jBt+?k4eZk!T46=^F%5J>QAOMua7zh&f0C;N@|CgC)4#tz z>PCeePmIlZ9QGnPt7J@pPkOxY11+PVuH*GJhMS1*i6~M7LH;hhGc~OPs5o)V{nGJ4 zpF8J{QqAbrbX7g7g-118YvMGHI%#&Rrdzq4N1xKZ47}fv@OG7*!u7_LTPHV9Zn7&H z48)r4>cX-UvmpdXuIHw8HF^HYls(*97`eCe07zMV206RFq&z$QFJ#@*YVzj0{r~jq zywCq^RX%f~GE?CCC!eZc!c100k#?o*J51+9Q`Vs($7{K+yLMf&JAYhqw zLpXa2mFG}z(P$imKw0&e3?NYTEAU=%`#6TN7>}1XrxWXNsH!dyjtjV&3%Q7kxr9r( zjLW%#tC%tdQ0fYLb4&W&8d z^-LR+H%#}BrS0G^W@zHv$(PbDFGLuj6LzQ;X*ez<4j+1{LMn^gNZ2SV?C^RhzoaC*?HYx zZTECUbJvVYD0cL4llb$a(`v7myC0RSzcSxlg!D!D|HEQ&ItcISNQOBB)uV5&aBhnj-W;Z1nVb!Y z({Z$kmpkn?zeSvB?_0AtNVC~AW3I7@?QL5XbXm yB@90%o}isY^As(nV%uI560}-nEZV}PeH^J%n+8p~4LBo?QINzCY{<|S0001mWJ0$9 literal 0 HcmV?d00001 diff --git a/presto-main/src/main/resources/webapp/assets/fonts/KFOmCnqEu92Fr1Mu4mxKKTU1Kg.woff2 b/presto-main/src/main/resources/webapp/assets/fonts/KFOmCnqEu92Fr1Mu4mxKKTU1Kg.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..b6fdbb66b8a6c1707677e180beb3d9f3aa5007d1 GIT binary patch literal 11032 zcmV+zE9caAPew8T0RR9104o>(4gdfE08}Ud04l-&0RR9100000000000000000000 z0000QWE+`e9EDy6U;u+45ey3PT-tIAgbDxwHUcCAh!6xI1%h-3AREC&qoSNXQB3ep4~IBQgaz}T!{k!?d04of#-4%W zeAHZ?fATN>TUB-H_7lSoF(RCe6@l@@pkg9}d;h@O?fqNMSZ7o!p=d0-tQ99Kdt{w; z)`)!rXU+yY$G%e`D=ICTW|{5ff9J^L`qSiN3I{-TQ;GmG>N~faMr9`SrhzDGx1XTY zcnSe^3GN+m|2oSVSzefttN=mJ?Ohe153;?$1_f9!&DU-x?G|mqMSHJLN2O#8@cqvX zh+`qsh?H#kmn$y7ByyL|Z%ntD9t}2{>+|FpVt?!!RNI`mbze z>9*!%OQ)wX%FnVnydZl@ze?wF_!MKj+pG0@XS8C&>W<}yJ(>2vaA%YrbZ2w)Kp5dk z2EzM@A;OSDhU~)+vQM-B5FrSYhukc3l(V1xl$->qzxkN=%#GQmh=gE8BuKGqeEf7! z&jw=OVHsOp;6)i1HNY4+V1j)7T^bZV0Iq<-MVcmr0au7vu@EUzAkw5kWXgn~qC(K+ zKs0EEGU_J;0tIXVc0hmz5eoq}k);W9-UTMsAa-vonFL}Fl6?X}>@kmsU=V`=WE(ut z9=)F&40xac4F(G6xatCk3K-y`cA}I^xhb|YV{AMeug7vT>3n_9c-_VNfv(z3dT>u3 zA6G#yt0TRujtqf1vOf&XVN$Z=JY7O5kCNdmug4fw+j$x7>*=G(Daba;KODjc1`anK zLZlsZ$YDpEBujxJCCW}yrAC7$Ekwplm^;Uk6F0)U%E;mEWhnOeq@)(s>C92hDz&_&kp&AR z#$x6>Pc#vR6#c8kDONa`)*2S0^(gs2NtBM-XLULKx$PaKa5WuYv*dyDMRP?9{n- z>5^Aj)u(nU&Ks>{EpvzVud~&!;_M8}Zy;X<(d$e;7C zpUyBc@Nqd@AlVsvqRnpnk#WhL34nvb4kml#P1fV@@K*HXuFW@e{0$D;%30Z#helKW z$|vJ3JNav5zEk)9DFW;$lMDpDwChMz-|z#M+9~V#>$`JKpZwzP3?FKAme6&@H@$wh zEeOl{fP{VexhorA!kN)BN@lEV%rphXs7m1EyUb;Y4tN`tj42rler9W#8tR*z&t_yk z%xZdNO1@d$touM-=nBP_*$Kn_DA-I90u+U?F=)~b!#G9}r_(eM7%;R8G3Xv91@}6~ znmAi3#j)Ui&RiWpD|k?;Du>jp?g^tdo%GIUHh%cS35s$AvV-g(yJ5EoMUkPq9HfE{ zQN&@2b%Js^Nx8{VQ3@2HNQIrIyi_O`RVqe}?xaoyXiy%Sl%D~`IYT)ZGLaQs@PIKb zVOT-YtQp6;E<(U5LJ3?bCs)dc#yP$K8atH3c7G9+CR(Km(}3M#6-11gf-=2wf^M6E zHR~zFGxNACL_r>lUcp%{C}PbfymvJ*-un#wHIZ`q72J_05hQ|!Fu`P^sk#Vr92qD_ zlcJoUJ19^TC5m#2@nz`3ML3BF5hDDAn+RZfCK2LnawIo`CKv>k|aTkbot^tEWzu7 zKXv+y-LzZF+UicQI2OX`1dg+BF^~Y#xt7+l+Xa?7Zr#hxO*+|Mp<_$0F*h}?vplzER)QP<6N-xDE0p!sil8i4*|{=Oby#)x%x_s4=GgTU{x5HAu0 z|EnZJ#8ZPv+;hZ}EinQg{yL{e928e11yU0%0m4bpYmdQ2)DdQ4T=j7XO{Q5iGQ>wr zzyVTL05js+sELBZr|B!MX{rHACYs&v9@0!LG;#~mps~}33yL_NHVpggpZ~TIfG;$p zbz=5FK@qkW_?#QK)beO{yNM9B!%n-D+TJcg@JNk@%yBzP&eAhx!B;)ILPZvYG1pleW& z<(E9_buAAT%=b4 zb>?J}XdV4nF!-JokyA{2%QvfwXv4w-TP3N}rrnSU_pJM18@C`hPE=u1RMv`H>Y5&my)|I0QwY$c&iy>?d(n{?lXk0aMC4ZG}? z*eS86_wo`dE#>n)t0Z%iNJfAG@(;u@)vxvM*1z8W_xyr^dc8?fU63SRjLGHmT%1_? zv6OmYt*%0B9cMaLo(DW((!UHYn_|?XzYE^@RB4`h?uB^^(q&k*WZ8HwRL7Sq6vI;aSsCSr{c-N`aRqzc4Q5$%}Nq^FYsNMA;)-7iU13gdA{NCG(OE8ppwFT*GR(++s1esRT`RtsY$@) z<=H#|aG*h)&3TsU+>9d#3ruW4&y=Iu6g8DhA{y@OaGEzD8c*0TOv;iZB;H81V2cq} zHNiMcY{C{yK`dw@8f`Glj!GP5>hsQNthEwlGM;WFJJA%A-iQj$%2)kx_v$Gz4f${z z{v^O8)RRHybKI7J!n9`>ETu8C8J5-}yH&Gw)*H%i)wL(2f zl|j7=Ax=s-k(c)Bjm%3SOFZ$wh#n3xs|;Zf+)$@;x(Lu@nue<4u;#NDbk`~z+W8zn z?#sQuU&gi7%_3IkS*z8|tWxI|%FNe8EW^s!cDa-zdpO|uSReG&AT|<0;87)BD?V=e zXE;go>?leMiUn&DmUBl{7~nq8-KG?381np&Gktn+~gNR z9hi(-?6N=%zg<~F!ayEX<_l+GclYes2zv3F;Ojc7jN$f^`A`L~3Q!~Jt$8(wd+qT~ zB?^E;l99ws*cPRVEhfg7W%iK2;e{Q=RGLL2%P*pWWqEL39T4(wdsJJC<6S*@4+<10 z8R!}90p^h5XfA`+1g^Oq4yu8eYRP6n6={mw`TE7U-f4`OW&M9p{THfP{#A^>p??|a z*{z1_^*>za%d9bU{LbO`*~omU!MQ(GvBmolaR^3wes(uW3+CmLpElA)?AE>pFWOK9p;e0W;(G6N z0-pP;C3DHkBB?!xK+Q0{=Mix$ zrqE9O-gz%TMT~-dU~|?u9uh*9;ah^_()}`Wja`0D3jJX+ig0J6z4u?K-oShQw^*y2 zq7oJ1FTIUdw2HM!_)(K+9avN&Mu%dy?`6}}%v}QhPg9?X)e8N|%Z=I*r z48Moawwrz~_=rk1H;#_@WJ0c1uIF5b3Md)yhKMU*gK#K?wkVz*QlbWMs3^?q6FwZl zNASK!o3Hc@NjtHjY~7gL&?$c$8VU~n&D$wl%Ev4|4yz^}JMzIIV|ZQ@yX3hlW-IS9 zyaly*lM`KZE-p>n3wb0Nx>f!lc8nzFf}T6#uh-Vvf`e-nu=KEX_h&Q2A;JAF{vNs6 zc;KJ~SmJ3vD~4EdXU;vcZL7icq3VPNm$lD5xEf0J_WI+s#eI_EIG~*rmy+XLG9V5y z4o>1$uVbPeMCumguhya=~T1ujGF`(ys*CVx?3KScoy5hHc4(4?OBM3brE19 z4aq}~q9zfv)*MDaUu?x@#&CiiN~MQ6zmP>h6M8162_5;Q;;G@)F8w)$@TDI3BvRFIUL1{O!7RqIF4+l`8FZ#X)$rz3rGs?JWL2GU9()+zBM zaJ7EsP-an}DlaK(<3~t5;B%Tf!3dSUUzUc1MnG~XWxJQ`Htu~e4_hhMQ&k!k zRr@*?kWqvuIgmsuVt(+tPvFB^$Jvdfy5ko+w4LU9S`iyu=AUJ*kvvqr(MqStsn;tx zr869{oWco>&a4qFL5CyFAW}(T=zj~Ns0JvrO1Z=|VD$nYAF@wZW}R{JioF`!@H2JE zGImnlCpf(ezt3cmQz~pagt>(jrS1v&8wF0*qJA`9$+IFa_iDMcTk*Fq;V~vO4QK-1 zv04#MLFD27(Et3OBw{}jm6_xi1_!6XDE!y%69xi8Ig;=RcQ#L+3?WdT$@6hlpve65 z6;ZkeYva79MBFePQxaf)>eR8zi~foT#2hWc-3HaY+M|Az&(TWhzNoKjehq7D>K$hG zLXUC$%m|sRu}>bcS*dVeZW?380LvUh`#1xZLon4K>H~N5t9mrzLP1>6;8@WJvm!Tn zimi^5NC}Q{qyP}KiP`HD0`IbUvo<5b-*UWpIm2)61C>+X14Z9^u9oo#cp-1l9r{LX z&qRuQ_q6``*-z(K z1ldmqyfghHIxa`JN9r&P8%774N=C0{*xMHcp9?V4OVvxMZQPD)y!Ug_olMl3(D$7~ zRvsG{#)fz{aWurGMwR8D_OH1|G9oSYPRiM8>Ur6lSh@uR|6IOsND3?#L%P|^nA#6k z$p+G~`62Av_&s2qn!Ve)Il@gkG@TgJ{>BQF^_L>bK02fs$%K|ivOgjxBp%xNRqgdK zmkCWXdT$d|3Bs429CtWgay$fYSI+5tDCl^pyyG}uybEhz_s#@IIQ)vYq@&~x`%dy7 zbTb<=B>fCsQqi==-h3a=Dc}*`EZqc#yDWp;A$y{ooCC~+S{dB&8qmHNWU!$2c56uy zE&oGj;nce~3&&6@13Yii9y4-N=8%O$Zz;=kYWgG8D|p6!5J71YoY)Hr?2I2LLz1j( zY{=C7a9UYaHfsv?Cx-}P0HjJZh7T1>iNi*Ie}{(0tt+ysFZ?^%7PkZdaS-82Pl5)td@F$-u}@q zlhY<|yyTu;`N})<0ImJcu)wy-67zuJRvRX6qu*2iA~rF%zqllC0Ca7Pq(dtLSg*g1=my~krYEGG4_CI%8b~$`0w{9d`DMZOWy8o70p!M*xy*A1h-sf;4?|)$|%CCM2MVT{4TU@ z^K+9hhkz!kJ{q%7T@6@fVa=o2Xi&eI=9M-KSY~F;#Ah!s9Udb3ZVe|==&8{K#gGYNmpcdEzPix+nfEr;Q)Mn4UkCrHuIljC7$YDi!rVJ{ z*=N62xlajt?Om-b+&f!Fa6k32thVa-tf%M5SNG`gufD!RU{TQgn4!th$ZX?mDmabY z^?#VJ!`0H(!PUgjp1Xmd?+Fj~-4{lE3;gp?oW;J)hx!YCDymXHGeD1_~UJB_Hn%yWtld~r;jHKTzyHr*m|F}2;h>?U@z!HW4OL$as z9*nOr7vU~oU+_zQ*o`17%Qv3av|p{i)Ye|}0%-rmFr5!2$C)jXz03#ja(egBp*8~g z=S9K7p9ed{NBQ=zj);mdI|yUaqQRoULJ`s(qFClI9MVg5KK}CdgU1W2KBs(7y?U~6 z=fMhi&&EH0zRxRv-|)VqMd#skl}`16Jh|0W!I~dAAkn)y1USl2SuAi2!~!aV$&|qz zX9AQY$2E+&vXP-bu|`1b^5FHAwj+-(9DdviD#@iqrA4s!^7C3mdI=6~b6%aC(Oq|^ zhu#eAtsWbXaB`SehL<7x9Jyr7E^6=*8-3|>v9z7Q*KE5=2PwnFeCtWOa1YQ$3I2R_ zZ1`?S9zLN3aKO?Cq0yEPqX#h8^Y2po&6{Vfn|m?}?}A3ES79`VLkGq=vT@8ScmX2= z`)b0!JOrSt)q2+a#ge3q(@`#YbT@@Pv0ZMuN2?HZ$bW|_Zo)>cMq$W_+$7VTxu;!Pz-4?j=x24kZY+@$|)9T}MjrsJcVB_96# z^e}SCOV!pbII5s6tE80X5`1C!#%np&=lTT8? zi0}&uam;d)Hbt`l2Q08*sj?=;j|Y(w9pg!XAl#$ce|oouT+t6jO>JGPL4x?PU?t^E zO($S|4Ub9qdiM36Q5Ie+mq+I!pMlN#D*=Qqt74*~=+m#xwJVvnxkY(nW9C@X5&q;v z->f(;-x>D!+l@Zm3Q?9S2=%C9v*Ignb?iS_RdAH4P58G+Wh@BD{pYQT`Mpdpm=}=y z%fk0GJj>3xGC$eXG@ngvdzc{4sbls+~3QW`ga?yr1AX|gK9 zS{AluR6PV&>FupU~b$=R?ouW@S+mA zKJ5x%srH}}9P=8LuY;`QzO$j0JJl{*nT1iO#lYqZ)} z#@OX=TxF$BI)z?#XJMRaB(i^!HSCPk#!WM(Yju>gbtK|TjD!pl5{qfI-tW8)tsH_s@FlkZkuymnPrW6`Ow5 zVBg@dHiIJE)d4-;V!+)f2Ey-YZ5-$PMvqm`xvkq`_jRSoOu5cw7aFIh{)qC=0c#l9$1Jl%$aI9^m}I4(dH zzS=ZKE){XZbIf0U z`&LfRgj_5rNy#cGu8tlZtBENpO{0{Q2VJ~9=2Mf)NXt@1#mAE$jmEwljSGDkAC52< z6B;%eUE2VV?B1nNG8cRgo2Y+9KS5u2L{~FG^NMC7$MXz-3I)77*gI~qzq7$GzvDW~ zT3^;M%ex6Zu^M{ol)-6Q=v@|)+Fepbxf0>-kmGk>qxa-cuyaKSyVp)f_Dq&{1J~r@ zCVJ&AE3vVHo?A!uG&p6RsV#2aWEkqMk}Tfhu)|o)oM7y2a7M{IU1#?>rm2vXw}Cy4 z1UMU~ISnE^u>A2|G)=R|&Uarx3@X>?b!*vmJ~ll8F;+hw1TdJLCHk-;lIXWfYH>4rDjii{BU|^=CP{-}tnnKMe&&^c#*k$1qchv46J2%u4>@^i!L2V_P zjnAmp0*9y4qvVOs%&o3osHsY_t+h%*sQ3{y^wl!woN#$lYGV8a?N~V|*RaJ3lk%_KQQc9R2kq`P~jg?Q0(VlT>M`|nRrG;m1wMd z%Giu#OoT&)wxm*0O=C?;X-ajYu<#eXGCgRiup=GaMe;F_`>THT%vqIcazi1$JSo^O zAi&D3BaZKyv~m{YqkB&2cj| zy)#B?3SpIqJqS&}GPiUwh$yPY!o~BI5tACF5^U8*JlQ$3rO?7?j?Y#HGV#{y_w;D0E|EwX=@%TqWg zoE+qx5bDH2>XvW!kImicZm+#c3e_(c*(E%AACV1$ zJx866RPbjWRSFDsu~a0wT`RDqo^znhSiAZL*guyBvt?myR=2jzic3!8U|VVR%l3sO zo4}wrKYx1AxqbrUQ_o;{hozjQrdhkK|HBQ~3V(|0XunZh6m#~yR#tV4R%nS)HBsc< zY6L)A^u9 zsf{M^ujFDvv(T9z4!`88qcIDH+PlMicymd7r1p_jWJcxD&DY>AQy25^IVG2RD?;5% z+h>#C;t!N`)i-jskM)1`s$w2 zvg+q_??3h`z9>TF6HBBNgRJ*^uJYpMqULg*Z~UPk6`5=oAK~O27ugmUI}jIZY;#gq zPfk`($5U5dPF}|V6xQZRaT(5syWKU~_8hK}i^m1V&|UV2yQxU-J9=90I0&o@`5QVX zp$aGi5$D|}fwM@|&(Jvq#mMVV1uypr$QJW6a!f+yN3pzpJf|T0n4h5|1y#mkT_$-x zoY%U$1KF1Y-R}eb62>k##Mvo~9BdDJrIG9$nKU7p^c>&|?~Nr?;}`=us0cfv-`o72p>tI+UUJ8KldEKa(5+kQM(emII(-gzXW883)PdP zf-f_tv4a;9lc~v|u_j5UD$*%b$6cX}Tt;r_F2}Evg}0n;6`e~3%`UoLsUA${n5*jC zJ2Q1Xv_)OKGC?jZ+Ako`b%C+aO0;i%1*})Rkjbrwfq5rmee~jpg0`XlPM;&{fPKo! zQ5)p}3uKEw$#s#jxaTV6wHB~cKTe@w68#8J9dt4+)xO-T?%2_L+8;luK08H}amqAK zZYU|vtEC}Hw+V$uRW2yHIjcEppKvmna-43NHtxpII2@_DnwnNN4}O?DKb@}9zgXIy zL$7Rw+T2SO?ev_|R-~#5H%!YwcX!{Ur=xoSKh6B#1?EQrQv;i;o1?KlG1&U}ttClr z2uYR8UrcuqY1ZCjoSaLEO{mSwjBQB7dRKCKrsxuZ{t7!zASDos31kQ)(wZfHV| z%FK(7s3}jUH(V)IxWDk~4kj^Q!Q?2vl(nU`mWHWW!kM#hneEJOa4r~64FsBQRFpDJ zH7%evM!;`AK$qzLJ4!jqwFE$nK||W;fV2_& z0Cwk#vQn6=7%m;Y@b|*Lhsyu{n@R}6PnX?FEwB6qkO9JX01hB*|ER*@pu$om4g`2+ zXzlO+W-X$>{ePr&ykOQL0RRtX`}PY|S()|7PQZK0L_L;fC%nZucr0eSHng}4DfKYX z@&JqK06A18oPjIPz~rtr2vzBD{=Bw7EyaVU6ww37FXKs+AzBbSf`Pb22n*tmfwl)g zaR5`a$^%!S%+9oT+Pm!C_8wcW1#lqt8_3@SZjp9CIRv3d2Bh7F>m#y=vgjR&40-3m zRF6CuM^sN60KaBD48#J_AqPFN$iwX)_vZIJHc}F5_?_3yb z8vtK*4F#e24JZL~0OUi^8|T46Zt%WsUI4~tn^~jvFyI?->xOv~Ejy8p1K5cHYY|s2u(xj-L|1O1$BxFUBeNmH3@+v(g^^jpTXdFWQ|q5(u60<@O5)8 z{9rk8e?YHyHqMW-zb@ZeQ0Y6oUPNrP*Yiq;_vl_&*@zjvY`}cyY-bVhEeL7;uXE6) zPOqFHB|n^VYSa8mt`9Ck)JwEyE&%Vzx0>;Qa8@1<-fSJ;za;V?I43JfiEfgDFFrJ-#LBpZSI&^!<2_ zFVSW==Ix+PnqyqwwO?pTweMAvsUlp*fijQm?3Aua?M&}%qkp1hp^0I>W zE&Bg^f4BDS>N*3Z-ifXx!E>H}{o>Pn`1Wfu`YkepY)?^{wE}y)66wBM-Y`LU)53uk zZ~<3Pf(l3nQwVKo@Agq<>vXsT8I`xPIw5mRI=eb4V4k+8{%D>`qNkST$_|Y*?;9>| z_GIbD^;ZC;iSdG&d-`3ZpzA@JM3BQqA@X4Y6gFOn{D5x zU>G?REyFo(qCKi$`pZfz#|^ z;}!6?KP#+Fj>DeMLgX|G6^;?-E7*m_*e|R_ZvQ8>&hY3T=-w-**;BI3Xs0bNT^jC5DT>2bxyc>(Hp>CotBg~2^sqz^Xg;P~2ZogHo z>iMnod5kg5y5MRQeeG~!6I?r-((URB7xyQm}Td4zmmS2BCy^l=Uy3nShqJAEU zEp-@|sPzw&D~a1g_*Q|Y3bwE4)R)=KIDieOa9&l511vxjl)(vXK^4q_I7JpS6?H)p z^+QX7+K6RWeXMfjbiq-E;S1IqhQ?-`0~YSL|MZ^0Jeb+bub(R z*x)=gq&5O~0I3^-hif+!J^`8NaV7@cuw=w^!`Y)|WBFKP(-R_8EHZz-{6vr-PnO)} zkzgo9OiJR@D^V~nCo~-cq@bmmhl`qznm)*)+VFP57$H1Ah`=eUuSg^wOR)8jh4bgZ z-f&{Lf>YFjG(Kh1)bRtlTO)*0b@C$7+KGi0dRx8t@o}Owa>Gf(pI1XLM$LYb2_iiP S%vcFO9wQ+8HRs9_z*`5}08I)2 literal 0 HcmV?d00001 diff --git a/presto-main/src/main/resources/webapp/assets/fonts/flUhRq6tzZclQEJ-Vdg-IuiaDsNcIhQ8tQ.woff2 b/presto-main/src/main/resources/webapp/assets/fonts/flUhRq6tzZclQEJ-Vdg-IuiaDsNcIhQ8tQ.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..1b95b850991721510d3fe9b03dd438e071192af1 GIT binary patch literal 103968 zcmV(`K-0f>Pew8T0RR910hS;D4gdfE1abTT0hP!A0RR9100000000000000000000 z0000Q92*cEgO&&eU;xA_5eN#6sx*p@6AQXf00A}vBm1dIum|n1z!7*2cE; zcofPYkZlN1bak1TypmKf-5m7Pok3bx<=+UpfZn#30H`Mh?(HO z+?TuL(-uImAX-5cw{0_;fGkYOUgKm%C!?R{FlEv-r?%Oxb~X2%?GIxy`qOB298WH- zo|pODU0=4c@Nq#e5(>%5+dR){y{f9p^@1cM zA=$dM*C)GOGC(*1UXATq*B-v??gU0a^sy1^G`hsubP)`KPxwVhLVa86Az2uwV_LLm z`hmaHlXfc0&8Y#7Z}#x9x%bJB?-m>PeRdDKTEOC$;E370f8ZXiG5qi0PAfbJii;;D zc~TORuY} z3x2_DUWkcLM)VS39E-q*L@lvrkGxPml21E~jY^1kJn3g2n>r=a(-(yUbcjpTiTU56 zv!qy(6`lN!%fK5KcnB?zpaa4Vh|3$dyr1dh%QX*p3IUR)Uwl4UZ&*zxlTpoksydku zz&RHTFGxJP&G!}Ym9#pAOn=<63>k(!!(7_0;%_2{h#Yc}$06d;nl`z%kKn3bzcJ** z%c6UsfEipbM~k3tV`TmkQE~RCIwCv_K2KJp8xc z^V{dlJeh0rzB(4oqIb2Znyq=nqc%LUD2+uZKcSi7NjLvpa+lmlF1btYfGjRy-!WEj zpmNNe3pmOWP{6Tq6E~>+br-P9`89UBI=~NgEYgkEwnpu6tmy9i%@LT}{|5R69t1W> zXaQ`nr#+Oqp|pcg_X0gw63j+=0uj{72TMG7)FIkqNhkw8{CJkSmU^@ZL##1qXVvfu zqJ4)a-Ta3jW9C9GkPt`+Gw%gt1r?AS5LOuL-Z31YK$MGahWoB+1++tLLWS1Z+LlXO z+p4t{+o0ACrJJPltnC&*vE9G6H41EVLsU!6gz`In`8U(w*Va?Lf{2(VriqA%h#Ydr zOY%$U^ZwyK+HZeW=HikfiAW~~TB9c$9-{y6Y-ZMN%v856AmnL$E$RTown05^j z@d~E2;te*gA`t*O#cT%KK$>RnNjE=#ZN13+*IaRhh=@FX9M{+}IXmq-Oq&CG_MfiJ zsyGZs=5#K ze7ofB4;oMNz~D@dsO5@Lti}(MG&IR|QA9W{yXc^@6*G`*^*0EFI;Mk}Qe=K`UZ^M2 zgqyGpw%$n%5dm@~)T>z^?uS`%-yN${iikK4>0 zerfk;i@ce-34~*;Bc*9IpJ3>X5t z9N<~XERpSgzt?A_Cek5Ce5G*S(5&r9H0i8qgv+3tdKAZ8vl+t)u06uB$JAr%b`%LQN%r4J1>N4vEVA$?ut&|NmF2eQgn>X_IyiR1Q^gRdu)YNBfU< zO>5gVj;q@CFfGT3`(i-67Y`s_AV4rcNFYE;BtS|)fRsp3lo0`t4uG@|2vPo&x6W-j*HrZd!O!{{;-F8osLDkU$0WAkB6iE4l6p_P%; z&iFr%h*HXE5fRa%wWTbjw7oMc3RlhC$$MtD2}TGJiXsFPLNLY{A%qaZ>@t?shPU3; znLI*3#ivNehcWm3UzCxhg&q(QNT$9q<{#I7`v0~ZlT%G=H!*^Of-Xq4%=;?!|FP6( zn(n&nX0Oy5C3;6h1cVQKiTerN`v1=^SnhUN4J;z1D+nQNCYkAHT8jR6D};n3hpMnp z$~r8u?tPfRYTO$s<^0sEY{=4~kItI`kc5;Uwp{%-o&pim(R3(!w5 zEfE66LkYy;b$A}YzdFnkp{U!!T95p;B8NZOgQ4p2TmAJIP&)yoG zx#p6OKn5X+5>pzuDc`FY6c=b0l)!_BSX`IBKH(slL1I9QZ;tsE-)C81kKD= zMZ-o~v|~Zl6SqahK;mjWehbAE1<9$Zc9*Cko5NHP`~DFq60J!YDKYv!D>OC_+xf*5 z5u?y1kHCvSGX?7CREb(DPM^-{MruwxYu%Y_)x22<7+!xGC|CT-cu`@2KNUrTqEBO#^*6gdNS*bUj3b z&1?tc?54s|5)Q?c+PVOpGekKzxt$WCM~%8~c}CYgEe-_(>%jo* z%-^gbx{u_R-HRb=S!?5&1F~xE#!Y0$`#tFLH9bG>GFXX6-IHDIQqx(9q~=udtYlzq zmq^IOU1AP^OW}B73(cAijdcox$f3^iNI<^ML~t4SAjA(V?jI7d!o@ffJU*ZW(6)6I zp8;Rg0G)rcW&sqMMn}zv;iKWn5xo1V-bX%@A^{fxsB;Q%r>1J*mpf4Kg#B7Yttn?W zR>^iDvm$6|%uKL$uMjkIjnS&_Qdam-!AVay^bMkMz*YT+Ml9tniZE-GBYVTafvnd7 zO1aQMn~w^U5-0i18c|S+0#9izC&Y~`c-dpCHFyF(L{th%c-jpQ>=cj$IYAsI zpNH%TT^PCa?u;$etL7t_lxX?n5nN+*Yi)?3<9LEc5HPo*C@(5`W4EtvbCg$vxzU{Nc)Vco&7vf2s1myO6N>Y6s=g)+KmS%|zbgF4~Z z9}oTGH&O&5bn?!fN=A)5y+gJTC76l?qf><(p?4-8UT|(XATEWF?bqag=yF7+nonsU zu@TuM$3hRI;tb5mBO;`UkX~oZy(bIjDqgA2;FDnq6n@1v(HB-Y258Xvd^Ja?2jg=K zOLl=ZCsRYOLBHK?d}C zJ~AtdTFkDfdn(h{JsryEy%9?Do%qA{w~h4!q4X-U1>)2E&#&F%YBK%#y;MT|g`jKG-edEj(FP$pTdet+%cI)oiX zpy|iM{pg%XLj+-jS|o;M{eRFTxrB>k$wcyL;?J>>9prHaF-qz$@M{hsZtOr!b3Ts| z{gXieMAjc6gQnZ}OBX*UICWppncQ?LjdYR;H`z`(YpKH2J*v_~2 zZ(rPElR>r-H~uEwOq+8HZ|Agm{aV?!L1f0YFt>LqC^3{CSpMp+LbSpsf`?w#a!Az8 zJ!6S9QITux*pHAL3?f)bOV8qgCGejzpD7Ery{b`FfzFP)qXHh3wYo$r_jMqjymY1T zkTPEgwHR&BiV{*e8Kyic5sFFBUh#*2>)6V5IAB;9As2jBJ#}-Sb;(FlA+ZC zg=Ok0y&Hi%_$AY74by3nnY;;JPAzX-P9?8jPARWlP9d*ePA;!RnfWXh_bDB1{>zu)vYmQbt2zqhoUq zd}wzgWm|4o;%rDjH(axeNz_H&vI<|R=yWB)bwE;r-wsIf3a*&A_7&DLnIPq^8a-wK z0xVpRDz2YldFq8RQRXh!v4vBd`LPfap;d66u6$q?61>Xb|N4XD=@6Kq@ zHN1>NQkbI5phgsG>x`JPQE6nwuJrmeO6l6X^DG!}mZE@q!lq;2(Gv(n9ge6?Jr2>h zo18C3fk>M6r&*6dW!1LRIfh3uEEs$Z*#%+Cf22A_bmxYIqLgy>Noz*O-j?jE~gm!JklP>dg0c6mB?bR`&4K4+MLU4j7ugDWsp05Cmh zuuZ}(HehafpN5(wz>c5{<^G9AQi>j_HatBTUNkfROY{2G?dyB`KX>+U5<&wF2`8|Pz!GShh-jip9SK!3YHk>s zxnt_u)R}iq$pW)a86F)7Ocon%@{6+0*cJg(F;#Og$4A( zQA&-^;%QKe21a#u(I=xwW4X{oRS#D)SVCX!=8)e}%Z@yEL3$4is4`EZ3lw_QZHq_m z?ZeyD!zK3~hqBaq{CISMDyWalN9hNM`bo}33)RVz*y;>wK~Ta&Uf1m*icef7R!1PZ zC8gEqAS)6hrd}+Ff#y%-8&_}$n!_7SKsznnn$4_z~|Au zG){$BvMWgadyxRnUrEMSo4K5%%wJl#Z8~kxMBYR+xN6%AEkN+tQ`{nIM3q?{SgE_ovFO$flaqU1j`tjBbM&$6s>{Nk2h))+5{XUjg0@XtuH#V^2$MhtF8p5OZsGz$=mL%|31 za?OgyvE!aqNT;ReKaZF)H}1y=Bx6t9fCTR8G;HyfZ+!PUuvErGJ4>4KSFIfh*?9vh zV;t6?EhIjwI!MHulJlp7fa=7iRKgM;-DPw1GxhF&05i=9%i*?he+=^R9X^a-#Mk$O z3%tuuR4D|0aTo#N1viL5%vfQU7Aa>;3|Y}hVM|>Jm6|CD=s<LY(fLiTQM0bg8Y}xarBAz<+TW_BXU_lS84vHCm83v}aRfng0VKiG)DRWXOlQKn zR(0Wlx8_bp=Fa?WaE)XX6_;N8-?gMk!{ptB^?6U5XD>%o(7kq`N#pkF>DR{(^tViT zlnEev<&c8O>8U)^^rRLPES|0f7NHp>_z?CnxB3Zc?M$WJ@xJcq7%ldif9SGf%N|3T z2d>ufBV>$bOy=Tg!JU?Rw`D@}nj>XSwOd{+)^nq}jSy)hDEX}BAITC${}{*r%r zt@p@qJb|Ng7!;zORwPh^u5l1R+v!?rpySgl=Ay#ol%JGk3y$HWVKk!!vIeqc8e3Nm zru*`%{OP)WQFLyyyY|Q%8IT1>#S*ynE2SSGoWw`zJKu5Q3IKDC7%m;XvDP2AMs!ck zn%33mgf1!%BY|*duX_UKo%0|+x(DeLR5ikwH#(a4bgVT306Vk$Wny*a9`_8fG)FpXiF@t zDH-q1YMKn}R#+96v0DnXEiup1_!X=7@-l%mt^8PuUW(VwM*>@34TBX7BZP#O)wv)j zO8Kgq3~Or`R}>YYa0Lo;*Y_4xhjmY>G!$3UVMIBeX{_3vst9JX`?VDzSpw~!M8^ib zLWNr?e07Wz^oS7-cbp0%8iVd8q= z<1FDFf&h(2X`$Z|e@5qws3rS?L!bYmm@>#m{wV0(b=YAk()=sX-s*=Hly%;F!+^$$ z_yR{6jleKMK?s6+13xtV(D)F2)%73{bdppJ4!``QyQUk;u3OB$=FbAN~a!x@^MId0pZvvYP zE`)`|Wb`Jd=tlz^`LypGa%AI@h-+zP8=0H%RKc`*s?~1y?H7vH&Cs++ufojza-#op zwsj(jqt3!tOQVeBrp~Yqu}6E=*EyM|ciK(aoc&xpm%p_?Ka;;i?Pf?9&E?O9%AUBB zX=ChsTYsu}Z}A6QIs?)ogG7B=NszqFiV%)%=+JdVQ=oaJodvFyICLsLMWv+A@+=*J z!tjBt3-L9eI+Ltl+h-lKKwJf*BQq%g`zF8>1>^1X^+>u-H(1^o%4yMe9~mobxhSzi;p zQYtHt_sXZHM{7Q)^%|`J@#bjBOQy%Up(l&gmu|B}J{g752UnR(i-jU#SJc#WTBK*ABTE~M%?y^W zOz-#yr#Fx9t(Qx_x<5sswrS&Ss?EMdwyWB+?J$U0Wndg+2lD|q%!fxYAC6+48_7q` zQ975i9|K3=c-8pu`1v#@BTpGlu2bZU{VO$}4inCT#8bm&#o2jIny;AeoL`(_>C=sc zanW2NV?&h8?kZ@b6>gBiPsSyRwK?@z>pxC2b~M1ydXJG%W&0q4$eO+v-->!J%NzHq zfRiy9VK1w^ZmL(r!P&(!&OqvU6{q9v`2{Jb{VlRfzfEYpf?Lzu4R2MHk$lkPU|E=( zs)_k&bVVsx^p}oPUnvefCWO;{sf^@5d9C?VL2`P;bh1YwZ>WYe`wUrP;%vh#GbWM5 z%0KpL87fok${uu*q($wC-I*wRvw{%VOq&psE;D`rlG2;+N|Gitwubm`riA*!?3?h4 zuV+b#pImE}_q>Kn%uShZy5Uwx(myf+5;f9pmPa7-`A(JwMH^u^S#mx$l@=?OD=LEkO$wROybd+%vqVRauoa3V#8hA zbNVbLwSppkH;f+k^~&V%0=4joUq6GM5(5={V}fKUWeQ|Uq@WEu6+jjSk5f+my!25s zfY|t0o~$>0VWU`ZKyOKFGf&La$8oFIrkC*Hmf(vDquun{cMBs}oz|i<0)gK3ON*KC zbH6!Yo$FJz5jq#&)n8!Q&gMO8)!Aey$gXR8gDBdJm}w;{HF$z%$$I?z!gQgIJ^cWt z!)zI4VU{4Y(`A|x{ef?3{XzX87@qNsF%RT_&4Ncz*W^0`%(58@63+)iKXhQgsI97Uu$YGD%p&ELpQbZ>@AVT#e(*#Pl zh|tv9y_$O+kA_Ga4i@UuSGp})U({jc(hph3mGfYf?ikbWM6bITNgwR7WORQ;m$~0W zw4&ayxyIX5%y{~1i2(Rv$h&;SgiQF=;w+WP>TkEfRWm2)sQ^BE9A^k)r49q_Lf&J_ zG+auF9w2;@jL){3%ebv(GIpz4#%xu|=&ec_xm6+mZ$b$OHK~PNR^i zT1oaKuftUEHP2ANp-EiKm#y?dk6~zu)kPolS>=AEh1&ods3x9?2y6|{oR>otE-plp zpV5x7uzc$A=PDuhAM8S)Av*pjZAng23?2^CDlEOO(dwq1hN#=UX@N{UHv{YdBs3*z z?#$;X2z)82{FZs>B436Xv=`al2@OAY(AN^#kBSy=pb-8fflugw%P1nrGEArNS zFkei!YJ4}py9c9(H}Hau>(jf#?nzO=G!J_3#Th_uyBUxiR=+kNu_-)b{Y6ITff54} z|Dte=e&LpvWEQ&Bm;Ft~aq`D!PN!F{lcn1y6UD{CZo$cB-xne?cQ$5X4uDntNB1?Z ziU)#z!;{dwt_lv$eZljoe6xQdlSaA zatiOR3)F4Zaje`gzDcQa&SzMt&jIA^%Tbsptyz859g zpby!w4a}FI&{zUE!h~BgE(sXYa!poCBQYIG>O@45jIuo{+&1%`b33=poY**rcov+4 zu;^R_B+73}Yi$;kw$ZX7>zocyM>ly)Taoy5qBZcNAJhQ3U9ev8ixUsP5I>}fe7cr= z8X)3!t50(b415RsH_Cy%>ah!N$UfFJMwiD#grSI76=P{_0hZl9XR5BUrc02sb#w&N zs@!`l=I0(Y-F91_gPM2$0tF6u4`-%`yDdRaxw_gCS`Vt$6+=QTIJ(I}_AU`A;8E{- z)lzd)V{2uUug!fQB%;%LZZO}ctexrk?d}%c7y(E&jk!=L|->24MRd!b>f6qZAFbHL!?)k3u-2H!L^`S0?vD51HsMQ zb73|T24fqxl{Ng#lT8q}0{c66j1Q`u30I%G=c4Fl zr@7Ose9J%i%SA&y93wL3FCFt-t(dB5nBEzhx98hwORsxHR5thv^YUsjW!@P{)!%&t zvdai+Qe#Gt18TyZgz|eF}zi> z+6OY1o0OVQxJN#;@0o6ksz81B`;z*)oMfyh4c^mGdevU(z#VP~o9XvRa2~hYw#}64 zZu)M(Dk8=CScwuw$nQxFRd84rpk+e=uiKz*wS7a9FJJTaAe?W%Zud$OR$HShmR084 z-jM@s?I7p4+w1(oSqO${0OQX1Fs4MuMA5d}GN^%W^sqJrl#KZrXi z;UhWJ4|q+*>))o7urN?1K~DH0;uiSi=6aSEea?(nn6B=v3EH4t*2|uAz0Qv?V;z9t z07EEv41ge@p%E~VAfZOYEprBX3|Ww51;jXzOIRnOKQ8;Eo?V^(3KF4~y_)C8@rwf*t3J6>r6YkpVo0b@<*rur7xZ!@w+u!o znv6amZTOIF9E4(TG>;@_L^?at8#R|*(y~#MX}VU~?WL8w-1Nh65|+xornWv90KX4s&7yq}@;m_cej`VBqA9ml z&1HK@D1-{vx3fAudFPY&rJgd4YUu2p+FYr*4X+#UhwOpDnilO&0J_Saw+>Vtvubr` zXSs?=Q|a?c-<<4XAhhVNU>WC+;kXpDqfU#kVnNr4QOCq4pK&{U9=;5ugre;Yu%=pv zs#u5WaoZiGp?HEa+lmmy1`F&BAiYm>K@&ITZ;t-)M*?oz?z7sg#scO`d!i1r^ua_S6?vK5^j8!7Y+P za9C^}0;9wA)Tq;nqMAMwR(DsN(z518qsuqj#n6iJJ!3!r`tld&KYeD4Z4wk3YvXO2 z&9eo!3-S=cq;8FNhC{B%2_Qm8ghE&?OGJ?=c#aL!J)VZDO`O9*R-c zcn5N1_xIRiPSIZ;Q;wAJp4?(?X~enUr=h-jeYok_?mSs8&6h0(Nb;mL>!bUP(zWU> zqYxw)i&0i^kfEFPr5W(F-L6*-PwT`@I6=7RdIqfhdU6``LcpoiYSs1*FtX4XdWF%x z0+|P^EL!4Pm)UG)g?b1`e^FBO(jcQ7aZroqFq0_re&AJoe04o?* zVLsf6q#4{{r#>Dsrl+#U`J(Btk}Lwhe5dP*!({+^c}qnsl@7v>OZxyO%hz2PNGld9 zj;knE?ZX?0MUQ20y33+5qwvn(BWld*!_@J#*8N;xJzC|XIs*>*ow}LgP*~H<&(Cg| z2oI!FYG_kiQdj2W&Xo@Cuq_v~NY;d}VQPEI8rNYvsx1^)l{!O!&#pxoXmdLjaMEG; z+}pP$Rkxf}o*lZg6rZJh!lRpn-01*fEo?w(5D(q(Yk(CJ5-Rx}>rYIJOR`*M%d1bVCchBydpdNEWQ*M-%s8LR@x`ihg1fki@cUSFhha zk2bnqoRtw$46cJ1oC{fFKj#N9p<8=$Uk}WJ@H5b zLvxo_UYc6jm{Z{*wU9I-0zpZllWSY)yvoQD?}E^);vpK*W*z$ZhI*23gi~m526%)J z7^GFn+Sb<$G@L}+T7g2Kkh&Iw1Xk3dyASk%Fv3=;%Y%R{upt^w?X&N0XJ_L+a$7EX zi5GB*@CQTis7v;91%k^#*mwm7H%~|)ITfwu$nT`^o|Ut*G#5BG+-s@FBzv{*XngN=fyk|7s$xs`tr>t&4;!+#Lf zc@xvUNx$8Wtu91dgCX^2tjJr+Y-^5~BlbK&0I*{Nd-tZ1&URdc)SSNkJ z2{XL%dNsPYGX|&3=r526BK9ERhF>4=>Cp4&h;`PT=glP;B4G{Wzpwgf#H;0D8*)e}IQ-LzQOJEj~3I|F9!31XT zTp~BYSp>ot3{J3(5Z`=cn}W=XPlZ0xk<=3xiVmlaF0Aw`tEgh@nm@nFEaLm9FZtAW z!ouP*2oBG6sGy3bN=mEyRoghB1O3?79wz2i-a5QIy7|pRZ@&L|GTPb;%-JJIU=$$b z7)T0<3gjyjSUNQ`_wDSN`PwawfZ*gYISI*aMF*9g^rS(v&YMS`#G0G$VQFl3dSNw( zu9uGA*}H8|=}&gQPA)d;HH`3 z2=unC&>bWut-)KL-@geo1<+|V_7!+LM^P;9Ps_LPhK&fd4)lATOW=v+3<)&2YSt&F z7Zt z5x@{k)|0%UbwhpMa!~Iope)HfVu`6#Q4L*gmotM&rHJG<5Xg{Jj*4sT;1w)96+&lc4dQ7=pef zZ0YiLi6+`NtV1|sUU;q{qJD3-v&f4Mxd zxN-P^dEQjDnjV@j-eOdEYu=|t%@S%4{dgWzAY`j_AInkL6aki7qAa(;y_eT(u}sh` z{9TZzFUzWL4mN1ia$-{X62D7QIns=9oam_7N0b9T=9{J8)==6_#$2Z}C zeJ&^;rNqlLH(8G3UIO9tEYo8b%`szKc`2*)Aen^|;r`a+7=6t1N4DDGsN(p!>=S@m zcI}*tkv?u@zYws_xZrrs_)6m)VT9-KigD#0!8C;Txs6NR+ylO;*CLgju;~Q5zvfuN}=!eT66^0P6YNZA=r|JlpO`$6C0h?ksDo?c@DYLgSN@Ac4L%(II z@)i51;A25PleK1!?GGJoe$?r(XrXp1kjS-D%=0XGvxu$;5;J5eh!jAWz};Ev&5O?D zcmj}7|A6|4Ofj-H*7K0+QyAb}Eqd7`zDC&ML#eeA+l;oUvQMK+;v=Jwhb$dl5^n=; z=%dpdma5#-=$7Lpp{S;=xx@>{7}c$};dNID1eY`cPXRQWUEPfL9HpB6sVo5tn<;cq zodFLlouQUR=uR=7LKc5asgc746eR4SC)`4x74NQ+hF#ZL8eQ7Eap3Y&1^Z3pmSRfQ z*c%>*z%lDpvXlE`YXbl`y8RH_q~X3DHhoZN^nL;0*GC|l-Db0)7c95BqpWFW6nprp z?W6ZZOpwdY(IVWGpXs2R^}r9{9Q1qc)YO8cTmH->h;DU9xe4*)w*&Wc6EHqCp~>%C z5U4^uJ#&Uf3YiFB`JCmw370J8v_w2;899RX0!yB?@a*?w#e<{wqW?2?fz)w8_G zFH{*8(xJaD01Rl>X#?IVg5kY!IB};6*ew}@Qr_Zs7${lc1>C+&iiR2-$-pQk>_;#| zZ`0nFgTjRG&miBxT>mS^=Kjy7x>M1rF&V}nx;3;bPSScQhL;kX$9vh3)!5nGJ}Ttu z5bOQ^hx|kim-uALA^^c~gh~AU00jci!LmYRxUU)feUufw1ZHY0`Tu^S4>2jt)tty} zo6Pu=lP5-YCVV$wWK6CCa}XO0SE*W2*X4~JRkqMXeG9$rY`%}x!#kZF@~>y<{;jUh z#BT=vueU*DPE}!WMuXx(3)^`+Y@I~Vjw0upD2Q&`0Ti6klr0zID#6VQJRgL$4{Cvd_WPMcK-T+>C& zH-*A?(5Gh#8UQg~`Bn=1dWcH2Kv>~0N%I~;+Ui3FCtxgDIRP?3bK5^Z=oZE?g7s$q z1b(Qdvs-15CX91jO;jN&o{OvdbjorMj9_@4DANN&OJK|V98YTh461dA<7xjCmxt&3 z$y;Pzrq70?vlVBd?7V`MGk+J^GY;lE=fgGv8j<7Tf94#7;qvoFz{G+4Z_O-AKIoP* z@ueRbhMq*CU}}`a<>Mw+JTDz$pDe=TE3)iLO`YH^zHi5moK+B z=0X413g@xM(2(s54q%B+U}U%&M@b9(6&gxT}CbRdJ~M34;;ezRj4eJQoi=%bi6%Ak6wbA*Kn*^0IWF9Qq=(=kXJi;9Oe$q=dYpK2?v zO1nDJyC#d9zOZmLW7X1y59#?3BV~B%c#dMFbFYiL)x7pink!V^q(k}@Uw4QY^4f*K^Ww0a7fED1}qp@<%Rx3g%B3iL`y|-r@~(tAGzi6`}9*pn0sk# z=kl}Y{=*O6|I6IQNcw@uxVVZYK8ma24hsckeO|5ZB)(j(X)@<4Lxnmca;ZEH#k<5< zVO(lF;M&}n`_|oX|7?@^mzYMH@=Oh;d8Xy2Eqz7bkG_6XGUgz@Jpr-txP z7Td$D#m!m@E4+>VAa+l)m!;Un}Vnl{}NdMj2em$&D{n+&vZLES5WD@w4t z0kS1CYoY-SUhSl=gXr=qT{9BWBonfj3`fzNBf_R`rE{U&N`KMfxoZ6*XzJ*T1|vyN z*xAr6t59-a=sbNyHFwXe#Kg>705GZ%a#X(tO$|xu{uCZ8rNO+=Rc3}a+rrd}0Pm$j zIinj^2w4j_0|rgtu0aodv}K48%S<%lNrFw;At($rJ?SZMG9NnB=@Q$JBpk*Kc7FDe z2-cTS@r6M?YUUz(2Pr=}-0?f^G~2>4*)_EeWj4QWcNodIwQWYZU96-FP_ed_^d;|Q z61U?djCru2Ax9xRa6qwUz#H^32yXpyGH=%c;{wDlI#IgjxXfA*`PFoC0E`Z-dZH>#olB}v(FuH zoHu?{Rz(D>ro6-((rKybLP|Lr>!Mlo46BGlDWnzlVmjFHFsdyc7 zh&={qZG0BweJorj!#RjXxLJ5@utK>^@XfF>Bx9z7ldg5~g5Bt?yUMkgFW*{~GPsmn zGbWJ6ismH|P+gN`_U@!>I^-*r=>GI{T@qaLar#ReNnJVuj$gwb6cj11{xG9(g1kC} zjElLgPP*Dlp?Yk-6O3K*0f)2iOK^#y6nR-1F z5DhV?m>(HNJsH%AtKuacKUw8)L;715R3@b6qhSDEpSdCssvALmHtE|YKy>i~QfGWZj?0d$NiXEM5bSQ$s!#5uU)@eM}YuMX>7U`Yh zvRY;mtR>b@@hyjxHs?XPS4A9LK#58q(p#T}9{D3Q6n=o+rykHi>P{8=pw?^k9rlQK ze%gk;LA#swl`7rK7Jar+K4DKjn6?Kz=G< zGzFfNtM3;p7TXs=B-zX83=v#G$05Qzph;LZhNSSrE6Y)>5`0N&zWC^c4d z@lS4y{%~(?5TL`EwD0E00@lMG(Ov7K}9g~fq2NPMA1cuxdWXqFjz@clF2SsCCKN%{mt|rV| zKj~(aET1|>=@b6dq>;7r246VUG*Mp|Q|3^8brE>n$HTuF6JCaBSCsRG4U4&xA9zKnyjoTg*MbIaU}u5HS9nJ`&|+|ou&)X z?t=lh8o#Zup3+Ya3*vHQl-$1O_vMqu)K5c2bZ)K96rv{vCn8`b7L5;i$O{jQ zc@Fx)79J=iwA_BSHQjKE?ISRotBU;+y?{*NB)JqF(xCqs6M=U56@aSQ=;ffOdvCGd zT4!~r6Ye>uehI6Zc>q;7XK6^ngIj}-qGB>m*W%iXpbt9;^z*&^Zyu16^U8 zvAG7T7Ob|=>D_eAKez_`Up#*k#A-16rcoKO$onWKH>2ACnui<_Vbuj;VKnRf$jibc zF?5+}q^E>opD1cBI+aq{wu&5GX6Hlg5+3-db%U-jI?+9RAR7gI4SDG>6O)uA7Q%rX z%9x=&5C_zpjVcoKMXFj{Z7ix)=Q8P*>R5_=_FfRG3*PvJll2^q?w>Z5um%0hmD_Nf zZSMgRKNLH+Ij$1j$+?c9eSWtBN1A(_S9zPFNjZW7Gyn)-1Z+d%63APR((m>+4I@Wn zJfNbXXAz;Ot*MB1BowqOs!C4D5Jmm%N>7~ZIk7cI(hg1@9-FHi0$Hrx@=Bqx)Hp+ zwJ8Ye*q}S+m1XaJuH@5ilb0O_0Xrs)z@)Qbi$#;W1lSgchYxz~;ILq@X)y+@7H#*Ao&P>wA+^(!9$5u5^J_cCEiiAvZiXwHm&j`Egp!A~}ZtmDYy9mG4 zv^Famg)5wL7lm`w=~fH(ron5cS?fQ2*>D2X)h8lCXRytgjpGKIOFfG;IDyG!G0!XX zt5Y0GWZ8WwZD(bq)EVq5tgn`ruh;Ujz&It?ICH#Bs`<`chJaDm)$eMWL@QIC#;Jr2E1a6(rgI>E?z6PfU&*QLx2uv zV5!^yFF?@0wvk~h@ZcSR_nKAdubIXCw{CweV!`fElFwi~lS2YPTf-a-v%76X0Kv(E;HJPP#THCUvRsO1mx8^kbKjLQn*5xWCAvWR{NZ`$3)u0=*) z6l}hgz6Ww>Z^T6D!8>3W$egj9zcJjI>GU<8ATufs5_;Tpwj@SSc^iUpY$mp!*P$tyF6eIV< zE02A|)*=2uar4t34}vhn{2HSaG?eS@@=do*EFc(j7mT*Pkb3+U7ew&iZ{`z;(=|L}Ju;!qMA>%#jh* z{+;#B9C>s%eR*XKicUlX-#*2O6L5}dJ9Ru+F+{=$%1#s9BfoU z31wn?A0xQqS0JWxHBaEuE166|`j12&xztnZK^BxP8Ks#(^DreDCwT@H7fU^%5O>v* zF-Z#Tz9`d@RLY$$3`^$3XD-wrM0H&gwM)4A8<=#YZ#5>I*x0C0XDxROKJr9lkr%u}^&N~Ugl zXG&g_H|Db$CogGL3bWg>w$}ab-&vk6cHn*KlvS|GR@)j}FR0hlhwJloUel_{3;&-5 zty_Ve|K*yI3E3MC;Ytw;LK%-+883E(m#+373{g25G;z*Nl?kTFan1=|?(n2{K~fg> zqX+DvX_EDu??6?d^6t)otlMiyfKWDZ%yWy$juc5T8@X^ZN_G7mT1 zG@0~5W<;EZ=6~0MzYe8eS}v zV+{uedHXh0&@S|Ys^xk;1ulYgaUbNf=>$8>)cTZgxlq*}ofETcvTXY-dzt(mZl1kt z!tFEdeGbbMY?}Fq92(WFKB>omxv$htC0CVlbQ4=T-n>WU7_H9nS%qLNf8)rgUy-Ai z$;fC(o=2pn>+LRdVjTjRV(ChbL^cge4I5Y=H%-R^Zrq{BHQB$lzUU2f8c(s!oJ{-0oopRAD&LnNNNS({UgsxNSazzAX$Dq4b3D!KF2 z=M-Ox@nPwG>07_L#0ZPn!VdOu78Bee++X-(L?SB5k~(RZudUnY^{iCxx>DugF`jV1 zqJkZgP=qr9Nltola$KGDda*LquSqRySC2NgwOt*rWor3av4-p0qZ#jHW9 zt5A|06bW)Pn6T$1rj#qt4#>>eNUz2@4-?eRk%hVUfpomm;(K)d*rjcRsR zW1B^1Jj=}v%Ua1h8aH*jdbe@&#j`J`@M`bzUB5&*D#S;l)SaWboEwU{rp+DnFtk~u z7WJD-T>ITUh8GKtle`KmtFpQp>#RB+@JJ_~&HeFmXe?w|)@BKNd|i~vpokQCnoK$H z1^l>UcBAEKwZyY`7m0W7C}cy7+|2{#xSO+z8eGD`cVAg~%BVH#yfNO7<06p%*CVw- z|Bu_}oQ|V84e>%e6Hmk=#m8Yed>y_Bp0F^uA$U?41CsXdplSaMn&_v{-XIm68I}5h;!fXRc_wVRq^2R8u(ezQ@ zxLUN@u-bqFtApsy&9xltIk;kz#bh>_%(wm5!Iv}u?f>p0|Ad_Mf7t#sGDgaX;;nJd zuMQi#fY0M{*eoW4PNP85E}S_vpkJR}T{^XE)1pbE26ZhflqprBP`+F_vSdh?Dn*h6 z@qi*lvYwuaFANDu<_v_Ik}~^j(yV#QR#F(t zcHqE6fDjQ9l$f#MCPs=Z73y>uGh@z@H7CwI_zM&)NvbsIGGxh>CttA=W$H9&)TC3l zc}rGo+jHd7jYB2Fh8-s^QYut3t5T~@y#|e%&=?1$NR=)_jaqf;HE0~Ze5hHAHtj}@ z1<7v8v>CJJELgN;*{U_`Hf`CqW7nPohmIUOCB~#wnQBC&z-Y#2Vm8D}mS9$)LsyCb zQPHwNP=RvV95GVnrj`LFi*WVh1IDs z9QyTX2JYu)6DKtz+T9vgX~(Et9cl~$^`S;@&AJrPB3PioB}S|`6DCbLcWujnAabVR zY9WaMDFv`P?DFBPq?#nN|Ngb;nu2{6L!cpn@?S{RL~{RW{!F%8os@QKolzl>m6Z?*r4$st za*Grtr<%)R)T0X$7T1pmBrIoGED91<_{MiBR<(?ktZ5b7*uZvZEFz^#8nS8SUS)7r{|I-GqO4!u zR|TCTJXeUsk4hCZS-VxOaN)wdOP4s@xIyC9t?Ie+;C@f21HBatENr20@k;J&wdzd1 zBP~um_&Cr18d}hS)r*mrv7y9FnDD$>SG;+1S3J$HFAiRt81RLAD!a%+oij)BeaZj9`iOLNK%(CG#&;vWo?UazJobpaKx0$(vA=K*k^FGU|HrLe zRzIai2K|f*L;6KEx0iS0JWI`!AY+xRVyYK-@`>e*hszli>nbatuK@L#+~#ygOrr+^oAA8fBg( z>v_ijqYj9>B1(a{+e|BK+UQ_ghB1z3TrP~x1h>HefV>ShP*CX}iZ`?0tZ_tM@T)4I216?F#|E_O&42`c|+r&Is|NpM*N=tZ@JJ zKM{U*UXmrFRF+}YQwFo}L36w=aDFx!*e8|te1%-}< z7V@&lBJc_nAhtM)fq+-7P-=h5EON{mYxG!aEi2{9_0BCG`1ifv{bVn~LqGj^>aV{{ z!(s{$@QJCWowt27*!MG>PmlJ|u;RyXBmA3@xd;f_C=f;)4bB*2U>R#H9OI0GXS|6B zOfm_Hm>5cvO~!1BDcI!6!)>am#7r}dl8oVHk_cXJ)q9EX^^8 zwYlbTGT(e27FfXFLJI|2WRYM63M5(V2B~gzqb!A%$aRxq#Vo5#i4t{gwoHTNmg}^_ z3f)#(Y2GTUELm-}<$T4C9ou&8+OucRk$w9v9XN2~zyBO);e*hGG6-e0kWSkg8J*i5 zVZ&|=r^F18x%H8H9Pm0MMNpt%{_JewO$Pv?@rrO%b9Uh!NuyP$Dr& zlF3g>CNsh_S7Bt!F)mlGjj57s2(L@(z?+f{)ktSKYkSYvpqrxS_Si1v6-xCN{Cy{JTp}3t&bsvpp zM>^f%42H#-Ok1*8j$yMs!r|DB%e4fb?+byz1ujE}?gS=GhVbAq6(E47K!GZR2n8ct zIDjZoq-xb> z)TptqR;>$l>WHdW??8hF3mP?w(xeHiX3b8uXfdW$D-Lbi^lR6yZ#pz`y*pI^*QHCF zZr%L!>XmK4fK7u2aT+p2&9Gr3e;V1{Tjo-QTRh(Quc8uy?2Mp?D=n(9OCsqYlhshE z25B^)bh<447%^7C1O)M54S*>a|o2Tt|>pL74b2|0rFWFBuQ?Pb3h@K%3>`Em1 zmqct$mTC-)ODZ?@EpQcdeQ~jYgSPQk_TDB?TVUnCwF}0pCrLS6Q~^M>nCA zcSu-m`#4*74;CxHM1a^tIG51z@TSSf5k8+1lF6?*MDNAYS4?&0hfr%abwc12{v?2~ z4QBy!Mc-Jq#8A|V_GYQ^v#@VsQ&#+{lQ+tRsrY2$niYG2OhwZ1bqYrTgVx#%p2`y& zlqWLvCIA)NK1;#FpJ}S30>oZSh0j=oq5}MpJhM;KtEky9Pb8t%t;dko@Z!y1{U?4- zwXHwFt)5xr@?vr81QHmAVB|mq(3)lNPNxb45#$CD;#5t5cHF!tZo^#|b0)XVTUL$2 zCH& zTJonCK_ydB@i_awP*2@WG_KKEzH^YpQd9L(gx9Q;N$C&w%;es#dU_GC)80raail*B zAfEVobCzZS%wmJ5A8S)NpnX3Vv;+I3N+wr9Cz$#m-=$mYiGGU{?gxjZY8aoCh*%m# z@;6D35wOj)35dPJn9su~JV_zVv+7g|>CJZ6$!<83ly@xsNNk5L0=*#diE%@nSzMC> zloMOAG=%Yx*l#sq2BcBBQ0oI(!Dw%eQkErkVHbz-^u+?WL>QvY+0NTH8QBNx9%siM z_;=P|SaqjdaCv|t7p{!%No$VIC!q-Vyuld{2#Wc7TTGNjp(z?fwD6T?BPU?zh)-&O zhfKw#wC&}`Ym6E(9QeIwgYEo7>ScuWdKC%_sg_LB$uduph_hBX9vtl%WqK3JCQH{H zQ%wejc(lC^<3N|;`RBzyiKNtjFvdy-HW0<&h>3pKPNB>g2Slq{m#RsjOOy;}Cg{1) z#8}jgd^jo1mZpWmj9sv4Y#W{6M5YNsm2u?Q$=qpcgjCrDSw<4>j2eB2lrp?N9$fFn zs|hC<1}rl8^Bh{gpJ;$^`00Z+VxY+_PSU$$gL&X0f4b$Jf+g) zZ5dI>6o?=MY6e(Uz5_XJQjO5SJ1M zD&m{=Kx)}0wVSLR&eG*)&M$ij(WS*QB8#ZJ)VJEjfZ5@+K$IlttqdF;qjW~8YW5cT z5e9BHrnD{SDMI8TvTDSeM>+kZ?r@s5vFFW{NM=;pNa9XhaAXaFQ9OV=k{jWut0>3w zS3pl`UA2b+Q2sR{k)#RjD&sVnWAUTSLTKkDkB#j!dtQJ>t+fR$go14(r%*cVL4Xf+ z$!9A>1wJ5&HR%#J=)CfZel>&c>X(xwrUF@Eo z73YZ(3h5H=f?FbbLea>O+YYt@OU=MiQ~=1~mf-V`_c0D)WmusM)mtsQlBK`Qv(U^- zhxI0aRAxmLsn)46vjuXJ3|;&em;g~wz@a^nJVoU`InAWCdYmNJ@!Qyft{ZZr~U{WElsZoQMT}(+lvpBCRv$ ztY*k6Z;1qN^XwXDj3DqRRV$b?i_bCl>P zU@`l65}Pzmq%yHQjWm+CgV<)CCS7*O-664~qKFkk!$cxcUR}r%*qWkQFbK<8b_zj4 zG6V8c=s}~9!wUp*9t7bH8;lR)SV6QHrXRwqK02Wr(4jRdTHh$^@HnwY_E)!FA8#3t zAZ3FN-toO(j0A zg}cv&p`VuVp<;*?oGvla40?H7mvgtdhMu*9etUQa5}_S#!sVm4NGr2~ZAMFJ=y6dQ zDq*=L8kWND8q%x^^XZR81#UwI_{Q)akB6#M{W#-7rE)$cxW#I!6vO zS1QfVbU;hhHEFIa8xPeUN1mhSn1N5XT_OY$G#o2Pu%?mE27B((=CLoCg@ z%ZkrOm_4~+_J`I0w5_qGcn>HAD;r%HBx7YbU_3*vJOF`qnZWFu<=Y?qBurr>Krl_P z;CPHpmTdzAACeWp#5#cc4zIF~sJH{|2x!aDEMb?kj9UW~M8)T*`6A&AG_8y~8Y%i& z8nz9+L+y`O^-Yi?bIvi7j?l`*9yd6sMbsy6Y42jdL4n8M>#eB+sD(On(2js9%dMy| z))n1`F+h;nBDe3_X%{~mt6;5qf?vEjhamd=g|}tR%_fHv`+Jx~4bCrG?@8iUbR+rj zrpHqgonIGAt#bBAPxaDc^>#X+HIyB~|JK$Xldef@>gXPIHIxWyFPeV7i2vWScIP znPE{FxC);)0Teu@&bgdcs+|Em)4J_mZd>Nd_PTf*b&M zotko?kul2z%a8=fa#ZFiY0_EqN+fuCqjF_dRlP_99-R5D+%?hMiwKs1FycMwoVBRf zkuly9a3|#80U*hMb%Hc>)|rKI=$bfHjgrBld5iS_f@#U*nm73(&L>%Hs8zGU%y(A;u{ zG7Ldv>N(>31rDFBRwPw(DYyG5P`twauE~6V5BB0LcpMUBI zn?onEq7n-vPb12Iw(6^IznM*TJ!UtXqTbc5+(}mc(nViYH1bnB#?eQR40?jf%S4U% z%|bL;TX+JZ_)HHX;xJQ8S)J}|ihoW&PH4wquz95fSIt>hFT)t*=%ch!jVPCV)$RPcR*^gsHfK9m8a__{+Ud=AUH|$oa$lv#ro!C`OUKN|gY0}JM zi(3M3wq)j5htZzBIWVFe>qTB~^x6T*sqfi`nSNn@xUHQ5jh16yrT|XVbuW=V6}cxP zT7P=v?z^HdMz`dtY({95VVp5F%i){hZq zGiLTD;v90Dqm4Hkf>>xLVbM`NfZMQG+vH?nN-0gIy&=pf^3v4@UM01X%H?u)PoGY- zG&6I$ncJ8jbjODmH8lGk|282uvY|}DkW3GUYB?}R;adQ9{B%@#MnvMh6mir#Fe1EV zo!oZ|YfRZ3tGF|QN&Hx|(;AnFHsg)iH)@z5V)SWGoWj%vRCL83Y?xVvs^csdpkfElkT&Zi-@-H<&2}er*y6AvM8`XMXnyZSQRBzLiDFwpl^z zKqY3Qou3l>UN^b(Ei|@fXr)8HHsxk_n&XEe`>M?7y~0q0-Av#r|LIUjjc56othK#; zsCnqJ>_~W^*E%DZC(v}V>Ew^|@*JPdAkbw0BYliD)piDpnvb|SO}I?a=*SD0&=_Q7 zakD?$pG~4Tr$!rgAB$ea(FM8Lrt~PgD(SYF!QZM`sGudQildo6wVM^|Y@~7Gj`LpRSgWUEzeZlHS3gKhtj~OUF<^0|0!ra%C4@-=xsj&5 zHD6}V@!M{IzFl`If}Wb&G3sVf8@F#!Yps?2-6n3mnVfH5w6H}Fde~K zdr5X464x{^dnC8nHo-Sc`A1qJ77DLKfqx3PeA6uOG=u=7xN67O0~y@Uf^iKVa!R%sa1ZBhSHCby(l8 z+xC=$Z?kY0UC$O;!&s@O{(a_7ORP~P%hwm{07s43cTlXvjgt04ig z;gnTg8qgW1o(fgeJs@-Zm3z|f0u8!zgvneF`R`iBk6wD2|8crr-FC!6*@2#&A;YFw)Q$4P1TX(7@j=U#w5W$tE+5vHK2)_8F4j+$yg3z>El@286t8{wjRK(~u z=DohTYg{GyTrAmmmYFYK<`qcR_Z*7@q6!BUIg;~0CgnD5L1o9sCRTB`ZEM-YP#uxc z5K^HGHV9EM0iu9Xb+V&!&pF1F7Rd+`Z2J-nAqrppKl9k>m5=O&8B?d~gkTN`gpn5Egw2B=V||L0$_UDOB5Kw;672wW%o*CB)>Elk z13u9xRI|w#8N~2>4qa3Hq~>00h}1off>2T*j>+(ioLJGh+7A1RY94877g&tk#I^mT z2V+J%17u;rvWgkH0o&tX00yV=R91nC=RIV2ZwSV*(-X4?MoD%B*Y>XKkD*QHtL^zrYa3*u}P-y*UCifr|1^Fl% zp5oHUl!z;JXGzdX7$_T;QI0%1CNOU!wOw={@86(KVx;!uU}eWtWv->k+=9|p9H!lT z2v)^mTUFJ>6igLcbwv;YGW}$;UKEh!j8m^ajxc0jHb@D1=D4AN^;By=HBkCLk0kcC z6#8Ddb@qmI1Hw&>CxKsIY#3sc*2EgRW!IP+6)=KDjZ*>mB3MYdF%g|gbfZgTTUnRwm zb!>Oz1EUyQo~)^ES)QFZO8jqZY?EtKTYCzY)h`SNLa95&t^`{W7p$SWBu-!XRToaW zJf2g!u+1Se^ycdQ6vO6cAw)0`k*-_I6|qOy4d|+A;gXm zcR~DxxaiypCl}D`WWSQL9xM>g7+{nKa2g)V#rM7_PXJ7teg6|X9h?6Bq%9N!9T10P zE;6ae7?&AOz=$U`!i2RU!loK?h2qn7*T>-y2efYk_oOb{S)F}^5cMJ$_tLYCf46SJ znK|ir=^|u4nJ3+04LFd>0;e562I=H@G0@fGU&^11k$C84i&8R)@Fxo-u zpKY%ICx_ZkVCdQunBSUTM1y|P*5abZa_bk`&VmtZPhq@6Af=6*AKSd>r163F+R07( z)@gQTglf*_BfDEUF5r0X4HPf*`t(^mb1vRKqcfx1Ds?vuE?4f3*_fCiN$TCx%&=kf zeOd+eUHMvlMnA7itL?ICg%B-ixDR;i?X^Nd|4GY}vORDx@DTfIQeDcpgwwu)9w z>dtL@#F(#_*8pr+*V@P`O?Y{44l9pAD_!s!zmi^Gw^gm9iN|(P>o{7&zQe9wzS@`! zxpK}W2^(1fFHGc&E01`-qC1}B!v_;()R(fpl2(b|=wO~md0!f?xGj~|A-+r=8XgXnf%BynH`vTSThk){3t3Yu>|I2B z?{fPZKVR*Ine~;@cUguXGZ>W#F952xJ8r0>2fD=0dNe|sXky{_AhcsJ&Pdg(Ck8uM5_-Js+me@MZvir!tB!S;aJz z-f{x7m}2bK7YBRvvxHxVLFC+~_S%XE>@h3t;nie7kAZ^*VPp7rOUD1p#qa%njLsv! zc9}GsAt$c3J-aA7zCwWEmK8_!aKXtdlW{Ff8C`Kq$uzTLj;cz{b=)l}?kl)>s-FCA ziazGqUQ#?k2pnOzwR{UM#DM}~K)$J7X>V4X?1KHeIE{%2GV@fxABQ*bX zO+kJ96#QM;wW}3h@`in-b9#M}R?|AuigbN!FS-i3n+)OYig}@H0wY+8AXH?STg|VK zS>f1zy8MJmxih%739Rz=ROw(o1`ciZt<*5nozbV5r~Mdc^9-Q}BfdQOwQdA@&25tV zZ(!Wnsn?Z`?3ow>Yli}8Tf98C&+J)PW`gMzWcb%1SWa+20(a5g%ijC=nRAFrCPL}MOOE}|T-dI@nlC#o&d4IE}Wyrq#!w8|s z2=yz=Lc;uX3DSN7-ly&7PTYVy z0X&)8)?PgVGbR_t(>w!eyLhCo)HinEtfDg}-ps1j?Cn@XLBg!iZo;Hrlbu~;cQ0-Em7MR)}&3lg!-OI7N7wAC!pEU&oujM-^}A1NcO&^E0q^+H82MSlSNVf}l~2<=}0CQLRG z-ovf}xK0WKmjOrS%C1Tm(3m~d;4z~CUN zr!*W)OUfZt`4%;xwGh@u*nFatJ<sNxCja1V?|ALsG+ zFuO@?S%jaa0rvm}tn&+5`+PSZrXNP{uIBr0Nnk#hktHC5-BW)9J&&3z4?K;%tCIA? z3Bnn(ToqBU(ZF1f|7nUYFnD;Wv?O*H6RZI2izC5F=qH_u!KrCYG%E;6Zn2V-8Ng`Q zf!-^=z1~`!0bFXf$7BNNQ^A$}4`Z82K_y~K*@=3AJTj8k0$gSqc!P-Wo5AQ5W2gED z1Q|0|1lfHTJ{Xs_FIn?-eJaU?mXUfZ*v}-}!e;cBW?IN%E32OaN*O1o8@EquRsn!p z@)lfT%FZkA;jq?dwSY%sfbdRl0AI%J!1($0#BYQQw>!`k)L2c+7K#s|Ae2lPrUEH6 z#?UZclvXk*lxCZ%XtHve&=g`qOa}o7<(?E)L(Z@M!h`nfSk4^oVuxgj_5-Fz@Z8Sbd^+cC@1cu_f$)(A2pX7 z)?P+hQd%ex3d-36r4Uh~K)I#zekPZw0Al|R1_A~Gbb~a7Q#pnM7jR4Rb~h>~<;i7n zV!0Bu;ftPNIpU+>dq;V0x1Ncly$AKay7PS1gxuy9eJo}Aca&u|qu7U3bGX-tpXt4O zAmNN(^I=A~k55Cvc9<6equbfJiA5Y~ytVv1*Fyb$9b&5K9uhl`G5atJJ z&35hdU*(V^&P_!gu!|GitgWYW7*ZrDB!a3`l8f-xc{_wSu}1%(yNCyeMnC~o$T3ID z1G>L45eyA9qgz^9xZ5;8nu5Je6ccbYP{2bgoP$Skf=`~JGP>I33jtn^Hue z7^ZGx_6i4j#I;@4?Q@VPjf;yN&1B6}7ql8SPjGE|jPiB&%k=loPCN zF1tJ|61k`yq8^gfKn`2=AE$z^`YtNi(7!7-VPKf?*Ch=unt(>!@(J0ul*=XQHgClv z@)zZ2p-AUk+l+9|k-hYdqP{bpu6;+01n3I9rTMZCP=S6JT}3JVa4|#}Y$Bim$knJP zZoX4Chz;Hw2HYrR%aD<}ejz%Slu)yi+L{Ij^+hT8YEShc5E{U>}m1tJ+9RuB7Ae9<)BG0R*4Bn$%6aIvCioOH_Wwa$N z1~FnOCkRGn1Lg4?M$SXhc)EbFYDG-xn!1kkP}wogqFY{nM{XFOkHeRqVLjFhQeNVt zt-sToVDRaPrLY}odq-;<33RRM4Fpx|VE*h$X)S8Up=p!!7aiADPD^`Yg)E@k2T&D$ zv*KYGzBvYZI0~f;^S;eF6twK+&=d`C0K|rjK&rHyAo2}6-{{s}T)I;H`dB$S2`iUf zP1??a8=AWg74pn{yPe|~51#AVPkf;%z9V~OQgm&pT2Yi~ZMf%Fw)PnFFpd8uH+B{a zZz>?fm+J~bpJHe1x03YTshB>g$cY_(w6ZKvDcSlEVcpsxsGES-PF!ybLc(SS?D~{q zFmVdgBx4YJl?%@hPKqg?8n>G zn_pIT_?!r%LcNrwSyJPuVW*pA^si5IDG5h9jC7pTKBDHkyeRn?Ryde;%>**^@JAE`fZiuI7_kaV9d&nmFAF=F0C{^f3Q%vJgb}c~QEDs`~bP-0pbO9Ks ze3z5o59toO8DnN+8C;!P?i$@PvzYu&(h>#L{;7Dy zoDx7@@@0tMZ&Cw2;_Q+32?p&GuQi=fQQlOSPwy=&XT+>-3Ob&Ol5C2~1qs@%tDhmC zAFj0n0qA%;&mwG%#+>cRT+4$&5WVpo2Q{Eph1bYc9fGk_ZOxK}Gj`?K`K$+?i zcc=M2+mP01!a}g5FKNQp@-!ltQE*KCnHWtFe6d|1JeB$;9WtcoFL=ntB0EaCvyM$~ z0D^I}37bEvIGK;+zK&yfqSvkXe5llI6-)o*pW|-Ap9aFE;Yj7jbAdNpU3j}wfm^y~ zA!%hwhx~P5`>4_`qc@%4+~SEl;{tArl(TYusH^4PB4f%+TDQ zlll8O#NA7US3mXd4dUe>5m9+16cm4kr7I))>8HH<-~wC=se!y)TIGm`m<9VJWBE|4 zDm6~Q6~a^%9I&caI)7y!L384X-1-x^k2&eVc&fKffpX%#I<=x`wA3hWglEE=^%(;l zv)a~U#+tGnPvNA1RKoii9BD0T3g>jM|;l+Im1+w@agsqtW z5WJl!f?yV%k|<g_p&0Ne%H$w(;~pi(Hrzd5i_lo;b!r&lU>6DhrU7@1aMVVrbb>ApJwS z>mqA!-0=eB!vb^Te6`1^#qXuHlPz_9c2lNnP@r9PktIq#q&8&B9|}XW?7*1TgxI%8Z80n{nNY=uuk#eN)p_SuCdq9~q@wf=i^y&I}sBaF+-r8+%pPH=bUBrsE(EivKu*oMrIs!91c$DTBPO*-(=P;`T zDMOHtkOzdC;h0ib5z{Y%pq0Zc%$)Bl3)%uMje)2sU?{PZLo7IzK(e1Od*k^bOrLvw z=-_X@&=`L4t#JI{Kej&&E8;Wfvr|yp@x&($zV(f3KYn(lcuF2Lwo1t`VFOTmzceNf8bKsJy8>*OH zn~=PG^Ns6SaED(=s@ntNS^`}iHE*Wzr6IbZ7xu>lUDWg~E_f^82DmTweHk%NyNX<} zSot6;2rZW-sc=on3Ib&7a*xyvWO^IYx06*HfyB$q2UBD(7WpgMJ+R|y+Dw2tF)kb= z%_hx1V!0ReNhWK_Z`V`Vbj6RYJ$siNl}iFk6Y~_Q&DMZQFS}Mz{5sF?kf4Uug2rZ2 zbqEfW$uSpU#Bq`|w1hnGeJFeKx(!VD?Kuq)dCpsQ9xeIxv{(bXm2dQ~Yr##KTyF%u z4OE-uUPVf(VmiuC;0Ac!knmpOTiLatUidm@keo)g74&M-h{5#olC={K&FR%&j_3wu zT_LkcYt>Vr?Z{OC7U5SNVD1JWq^D6b>>c0nhbV z>^-F4r65XKCRN{qON=OC!T}vr6f`wTaM4gP8*!5fMH9(J1vuP90wkIV3t<`B^=-$Q z%Z z&7z&DQx8gJaXhM=dZ)0^XsO>(vSSE2t~E8T6?W$LuUBng@OHYZRV)3uh88Y@$N>h~ zrOSIr{+jNt!cfG$Pz-Xc{ORAYFLJ>Rbb+NecfkCW?C4sMelB&tH0iOUBSRM_hv~Pz zdHCR!Zybut)aVI5IsDS3-}w5$!&kp`ME4)PG&($aari_MKtXg>9785-HV$Zzn~FWe zWX8hsjk{dwn^D|juJ;fG`C6CCdM_0gLx_J=Eje9)S-{_NR|&y?+I4K#s;#^XwXKy(N9n+N=FMrufGJQ_6fp|flH4GP>k|xxcNj@g$~?@5F6@Gces&s+{)4k zI>gGxJbMcm+pnEsExsCAb<^LGf$=?_s<0V3PE7_QgkjE)Fm5ulD|T%$iKc|!3qBDa zh#d=3A*^xrdUMfd*@oACY3CN|jl%wl6QB4{$sjW&7E)tniw`QgRZm100R7dqDD>^2=49PP2Bd!a9_3h`|38DsP4?Xg4h$XYku16xfHU1HJQepFhbX%00*x?Z3 zzg%DJzyXbTD(`VYtGeiYRbRZPcj9iKHvdHJhNCl9LKgiWBMA7PQ@6ZF$RII}`D6j}oX?@xtv8q_C356NeSbK%aPT6C)-218mkU73U4c0JW(}mFM9*fBmbu#txBf zBEQ?vS>KMtmm8$-QJ#Amf~uCiNDWF!kIcIXatHuRWCEigEcg#j2KN^zGcq_9)~B;e z5L-}6_I!J+6tKD0G+8SDw^z3n&O9gkv{Pt?ZTtk&{)TdXDS!TMCD0v#*bb^m9QNJ5Ru99EHNug1xT;B7L+5`0RB@_Zxc2#+>X?xw#h8;2)x ziWEdZ`}V|OpLJL~h(8Y7faR3fybr|F)*J)}Gra*-Bo>(Uw}P)GNmPQG)=0JiU_J`d zhT

?ADutIo_X4v}x`wx2Do1G>CNZJ44z777)IJ23jn}cy6)U7Q`wZw3 zOO71aaj9QA-7nIo-UO2Og+l%)U^ymYBU|)JG9LMgnKXcKp;0~c8*Xu#2Gnf zK#HoNG9J967`=TN)5(9lZcaiW9Hx*e!k4in{GpT$T zZxGGU-1X_syK+$#VqML^slt~-2PJ0!^>6H!B}PQs$OnDwocogqU&Zywyu<#E_%hrI z{-b|3k1iYpM4mq7l@VMaSkFO|MN?#o-zPG66?z-mqi1fBv$g~UM~)W<2#3)&0)~Re z04bo-iH`Gm9+v{p=DklI!w^|$w{{IdYuiW|Qh}10K< z%Hh^?EXA*Z8+Vf!Eg~5mmkBHI-+^#G&03=7e5M7EILL(ltrWM@Hs)Azdq`h*&~U%C_QJ;=_WUUvB@hSUSG6 zRJEt2xlMbs#pBzQ7rEdUZSrP7D_bEW3$`OCHh-~xj<)UaXO*7|;7=o>ihiKwXmIKz z60btAqEVLoq@_xEX2w1+n=FcmcwKJdowYAQa%AVd02i8O`G}( z-d*~5Vb;R+@OrhqO+ue-Je%EzfW0g{eLK?hkS$#c`p~R=#LOVgko1^DGrVS(>+Kg2 zPctPi-@Ay6#&#v_v2f0gNO+PpCVisN8-H@jQaTz;-&I5ywP}o1uXZ8;BpCozM_a!6 z&H79Vs6szZ+k$Y?t;MeR2xJ&7912H=6u-`Cc|iDO>7VsKtOaMz*yXw`v+MR z84tdf%hjX0O|qT>Wm^be9F1ocq29X8d`qgXe{jCiI27cA_se(7L+EO_(fdj8rB~%Q z8w3q^ya%Z%1j`L70>BnBfu6usnu=!mH0V=j~UATk7rKoa+o4_?i2<@lgB@By1 z+8&bmPiAPSS;>~3np#k1O@O;Dzt?$8Hi*$mnob0<(~}fZzEr*hg(Qj6k5VD5UI_U+ z!__c}XUe1~+tH6_g+LS8ad`0=zek?L>-GFRPibNaP< z!<5Knm)&|@`4!(dpL(+A68fNgkxxA0x)S^4{K*eKja+ctc!C5U&MZSw@T~WUK>fsL%Gaa#4e19;N0H4Jb2wyDG4z*Nct$jzQHw0I$mB|Vl&wXo9Ke>kGacQk^9=lkYqjhAvPAv&z346#5S%_H;Vox0`TY2OfH!c*OQMSh z2o89O^X|07=a1bDj(%CKNAIE?ijWYqPnPqQUf6yG6#{3J$)|Qmrl$U;+*zgJaDi* zZGW@bVk;$9xo4U)8cfTVvl#Ek#nuqxUJ6IbVn*+DTXxv3>0P|06?C%8IL9c|!!V;} zVVX@sgGle^kH<945Q++*7`9PPD21ddrp6AjLYj$sN;OMGs+XYn(=ng&opZxem1Q6D zCuO=3B(p2y_9_7`yv}Y9aK7lIlTRwX-G{HR zi*IsU{n3S%J%3kUKr<9s9!-{pd7)V*Vt=dbErc#i0yd6!FGvO)(3Li1441p-doa)LwCIbaCB9koM3Pw-sBon41KX2E zZzb23&7)wMeklh1DpFm@FUm=QbdQ)PDQsqwCB);5BjmLrhju*+p?oMXVz&<*?#c%k z$V#zFp`cRrVI`ExM9L?lk8v_P$BD@1EX_0&SF0YL_lbe#G#GrsV5G7L)bf+g=p^nn z)TPwnHqUpkXq+-LJ7T@i3>tXCn$&MRy7|KX9*gw|f7rQ7t?}n4f3IFGF$3DvLpt&P zw(QcQrzk@xWEzbl=X|11Ak&tR6o12b%}wge8V^z|PLp25JCk7tU?8>)cRfO$#JB7c z$s=_=(HavvlCQ3kPvo!bmOoq1T^Y%IqRe=XQt}irmA=_fKEHOo(x;8=FMO4~maWTK6K;^)I1=UjS1z%W239cy(Sq$&^%S*A|fZV8Is7XN8IG(n78}CE_U*^P0RUf99vUZD zg6m_sY`K43r8DO)uM#gP+JOdFqcCvnwRrrb!P(@@X*)r>oBSJ&!_Bb~G7NGyebvA5 zNzNA}UuDU{_wV!$%KM~plT0z2tjy@`!+^WnyJtZ^U>53u+6jy;zLhTw%x}adxIwoZ zKs4*0>Ft^6yGxt}i4{$sXgh%%cqR@H7Q!~!cZ8Q zT2Rp;Y;P&E&j5t!4+txva8!{|`mB-?^Q~0!60Jfhdlb^l+Dai;q|>xRX2BKNWggcH zID0C_+)}V>-*0{9Nw98h03N6Fq^me9oKh&B2{S)KnsP~IgzL&LSv+K};Bi)w7eSSa z`455ty3&oqAO5JYChxAhME^U2i?0$&&ll2YQsB6vmCydabF!!kwrdvwZV#*( zSv>-wBNL(N-Bn0f>-u^1*ln^MsRzt-*(+Mv{mEDOJB6oTOJTB?1C^M4n;WaapDk#;$FsO&M~UH^F_i7XV2k2!fK2PT}CuRPVg9xF1XNBDyN{a+HJ z_cVcFBUm}M8<;ry+C)%vNa8#1PtoKdr9g2jNJ3~NN6!#683;Oi3S=Y_;So19e97w< z7}!75L*IOT(>OBnca?L0Fuzc~GfBv`Ij0AA+_=LOH%TDKbW_|~24~rHiW(Il?Ull` zVlnDZRGr8nLz2A0ip!R4ckkjGhZw%2I<66SO^=4A0_I$N zrDpO7$C;6m^fSa{w^zd2a_S9o-Ia?z;8d1WT$jW+drSC1k7-Z{5}`xK?^&z>WVlgM zrZ&^4qKIdaOW3nax>IULRVZS1M8F>#TB+Ex*5unT(!x1OSpioq$LZF1mAE|Jclnj7 zY#&mtI!B`PF0YWo3DL>L9wfKjfN)`~u<1 z$ke~>CC&+LeTL4NBPsp!b4wBp*&A?lFPk;LEUqyS@UG@05Ct82CffqstaS|_qcwV(@rHc39k*htPKiI@m4jZqEc!7A5E3GZ39!1Ur8(Up&kwU0 z#!{gR1`uBxX}2Y%hi;lpDV63m#$(7tX&6uL#)HaW-LKS0$(Xrkv7dobI3bda^nCqd zuK#VToAy>#w4!Qch|1B>?~?+>P%-Kp_$u-hrtnPGl|5)kdeN1HWVq2q7?dpZfMNv~g z%{+|KZs>e#*}1K)>00||PN}$MtEIY=3N(VUX(yB#a^nO*byFU4gL32@SN1pw;r8~l z5z@7n`lyc{)r<~Y%P{_1VlQj1OH%(&;yNnRacRC)nH^0bCxoDw+-{RxpMDW}zK@Yo z|4CGA?%I3Z=arZGG4$-(A2IvqxN$SCgoPVP!;pY1BLNIFqVby-OG%T3qnKIFOgEZ{ zzLJb1nK=28lM*gM`!W+4Xk<$|ejzj~^%7I1BCH=5S=ID-g0OH^_$16_L9%Ri^uwi9mu ze9u+|XA+YnR}M1^7-MCB&DkbHL&yLauH3um#|d>$j?Eby4Cg9`deI3-gS7NeZb6nT;YJ7ZI9A^+Do2L!y4MKt{;>70sekn zq)@kYuS?(dYxOAISKYw`f5%#>|0rrQ7pyq%5M`ekvp&p0KKvFll4hOfIsgCYo{TPV z45IHEk|W6wL#1>P?=T;Hgn1{6H(CI-b-vmra1PyTq%@Cc7{x^ogy0$Yw@efqLy>6M zFlC!FiIZxW>fx#o%bsvH5a1L?`~)URp>fryL2by0#8*p_czRY1040Z-qMW$Q0HsOH(cTU3s!6dx$+|CLe_B=ou-<5WvZKqyU(zE6GB3pzHGMD*_bH(w@#xd zG)!=n7%G{S-)EFsn8Ys4r>ltEi6phntR5^1)*`B_U%}}9?R^=0X8^}#6`QAlZa z0pGG5r+EInZ>09_{=$7iuWyA!=Rcny95w3AB+7;*ArG z(QKfpCIW`6RMeNLEQTI&fQ9^^a$Rmg*x?rBEyQ(oolt_C|GPqu2f=QXu3%~Z0NtMx`J zWLovZ4Yauuwry(y^-g}@ZEc()>CUiZ(TxHpcM;AM0gjySMH>({H`fwcjzbr)oQlhDh^ad@CCUV#luB6mQbkkmMH`Dgt%qlMW9)>R+XjA zhr_}d-SMAzP@&GAb?bD!C4}yJiS{V2cN{eSGx!RO)y z^YSms^>6_(mQK0deTTty?G**h8p9o%zg;4Gx_~FS=T`GxP$aWC;Y-sS`Hgn3-%OW0 z<&L#csWnv^tj}Uoj({35y3t&Nv)P_-BMgJP2rzyFKV9H~Occ-Vn&(66VH7S?r=~!Y z@mh|ICA^b&-<4_PTqtJ<0VDEz_Z8r2wi;kN{9Q;d86r8GA08YVwV+NI5Gx7W9J{DY zNB$wVro~ib3fj+j-D^wln9ND9z#5yGVSd4qKdL;l+l})uoHos-S%iuBXxtzKPN;BEi1VRZzJye1YD0awzSNfZ=JNnYbSvJ27^!Mx? zMP3s~T364Oqsx@)%SUJuuh%yeP`mko^HbWsZvpL_N?&Vpr9?ue7llE^t1B4%71Jol>+7LdN|26i4NLPFk3l`c*Ofx`tG=&y7 zrq7HU>EENKfLYKN<-7XYR<-3Tx7HvcQN=jfUPPr`cM^*7({lY(23eZueuL%PL9QrQ?i}8;13J zgWh(!euyb$m5x5xuikeo;zA~qta=v1xpi;bR?@lkbRB!Rl1z%IrB#qzvT`Sa-b|aX z#D7d=*V3ZPsw)bE%X*UH%O0y$3##T-L7=LxV6zAzk}5*!yi7S8m12rzMQDRU!BLE; zPj}w{$O3-&O;^%@gt@0XRF)@OZQ+cQaokW7W^aMmg+j2Ixa+Co*2;^j>9_DLMrrf==t5_n_fDc(i;gJ5;RrmTs!-is3 z&y?SZtMP>Yyp;7w>%@XT9$J60_}$O&@`<<{7Mei@+LeWtJYd4LnZ+r6HrhC4D^K%V zpZ#xMRI%ZP6o2$?l}R-+FQNO)lAGC8&R;(;a}gNt1PEOSQz!v#~M{BrxjMS@}w|q+`o)EBw}V z(_rYO1mAl`ZfN2(ZcI>+@4~?DDrAhf<_pkdS2#M4rS)A9#9>gZ4TmRfYc9Jbp>?17 z^?>8lru1WL0$;&P(h>GJv_4GJ=utm<5LfC+G&;E%PTuJ}YTatyZyS&C<)S2CYXM;$ zr0$1v&x4;80BL4*!fU7N`JE{h%;9Byn7HJQ5oUWaON8%U4#R$AO(49ff7Z;bYkwUb z?ToX6Z8biRFMn-0h~pKf{uo~h=#9J1Jrn8pNiqx8PSH79*rG9_$}YMYo;3?I9z_P7 zCGNV441E;ub-LMagpy^Xd};+DWnOks=A-o99B1bN%@<8}Hm6CcD9@CXX>((xByatU z+JQdYaKRtX#BfH9Ao)Rk2{5P_?4~FUS0$2{z!HLy+4$T=?^L?rM{6GPcVIGGOnFQa zeKu;2{W37}jg;&-b-!NkbPn_G%3k3yP{m-^U#9Cl*=?bdN!%vOrpN3H&)+2+x49yF zoe^pDu9xVQ5U9fUX;5trfXFh?kSC zS_1u3xTR##PNBV3A*xrP-h&9HEEr3!B}U*S5nky4CL#i&@Ea&L(Q)00IQIb35z@Vi zC+Jpp>eEAF*l7^{@rO>5g_CFH*@v+cO}(#NzZZy~Oh3F6Iq~xC&<@6)IL2hPz9IQ9 z^M0q&lKwpHVkVUkVQ(wc-S*~R=Nzrm&y zPx^<&vb;<76ur7{c3B(UrZ_$n%q)m`ELEtmZBEt0$OlEPYVyz=x02?&@urMG02IvDgOhA_ z!EpK;by}H(Qv{s6>R#l`N6j!PVbnXJ1Ixj!{WZW#N@9GopEhP-ZyDQAet`B_B>Sd`)flE0jffzajx4zH&VC)Opo{T> zu*u5!I;2xaF6q-Ppi1j%`e;t8rPt~xYCQf9S(iM7)%})9Y6DBvzl{T}ML0vlZUmx( zqk#c!f_F(EAB|r{hJgdpJ8FJV-f!x*ut_fPM!~b<{+YJ7hJ3x3W;=OiY8CyBE#Ogx zn)<|(n`OA%xnSG z(o0We!obO}Qt4gF&E0r7Wc}TsWhO}QQpg@b_E6yb+RUJV`W!%<9p5#%3(uVmkz_&( z%m^~~Fdi#ur*K{Bzl z`uLl+6%CD~XH@eBH{eNCK?SaBP*FlnCq>w;?UE)9E zQMS7vf*+RDngvxWYPh8^sW-Hl*1}BTAyV}kD>aY`+wX_WyH~W{ zpn`WS7ue(HR34O@Z&X6^kZ!Nu6_!ZykS{ywIZ`0>|0b9=dbX#i-#}VEFR*s5J=}UZ z<1QhWNf99Jw0PAQu5N7|+0BW3M$9C?Qnk`25V z?sMs)thSxgjY@25`!=vb)t0<1A#qj`zc;i!btl%t#WMWS&-_@ArK_3sTohT>nIbII zp;*|Uc#*iNb;04vD!9m?=U7;E(V6GmvYg6M&BSi(1&PA2&|Bm99nHV0;u|(|=a+8J ztST+3>dUJa%Ce_8_(wNMJ4I~C{0`?~tE;C9EjH{EXQXs#Q}S*SsX3~!2v6WBn?n&q z3kxi$rcc&dwhPaT>-9TwSS75QhaGrhOzXXvD_-2)^gGJjgS@@}ljjk!if(h$8<@}c zfS1E(vIT!~KLP9ckN(rDQ^P0IE+ zB&Dkn(hzw{yHKxB%0!*keTM>j+ZZT$6W{VIoyd4{$}%^Vu*+bCiEgjDQWm`Kr9vCN zOB$1@bj62fvC;v$FK2++ltEJ^3nb4gV1KzI)@3}(u+|=)Z|5LcE#MZczq0ewkT_>D z%IDoZ;O@~ggcrTL`N=&~$5bSKAJ;5}-ph7U_YM4bCs(nT*CU;);iQr_n$DrRx?mNT zp=#jS9@$VG6zZswPSAjJzH(JMH9b;C2$4FVJKRq=_0W;TNugFMb(6Nib5}+}L2xoY z9hGaW+UqqBGgzcY2dKxh!`PD>Eqd3lP05*2yn-ph%7G;qt9E3}cozG$DSe0@h zmy({h0;QF)*s&GD-IZXAY|N+i5E67smj9tWh4xDY)a2#DVk>6RW&KAHO#RvXhW=f=;udSA zmoy87Es`pZA6?53pjL}0o);&-8L1b_ll^qrREAfDL`q}$Su$&-Q!QITFO|IP_BWi2Ful`9(El_OLR)@8^Bmf zoi8TZhEhs#nW)slVNEKdkV+A8h-nX%oMQEyE23(kHj)i8hUz7hb2NWSokzfUkRpS! z-j&h5sUQbZ@`=&@BuuY)&cigrX`7>HKuRPJDxKrsVX9VZdyRVCujEavySC=G5&jKt z(WJLYHLApf*VjF>Pfn6wmRwYEDprDwKII{mVE^uE^f-`l28Agx}hM@r_4M{xDW@IDD#fbfw7q5zcz@ z4RaV^O|-dho@OJ^j22pEn@BQCX1}$~wT$4qzdwY3+0-VQ`?+&qI4P_?GPPyZ1%T(1 zzB)-m_vq{mkfv0F?3arekK!Dakrhe zr*IoxXqyNv&{NLA_5*MS?zO_ye})f8^j5j17~yW3oqYm%asVKrnoz+Tluv4|IPtn$ zEeMB-J3GfaB|;kt$4Xap7Yz{yEU$H-Co?NaTrK`-3xi&!}@{ zKcO64lw=yLFWPsS8}mQRkZO2i(?lRaal|3j0-;<78o-rCmhxFVLGESa zW($~P)ije7*fo_{mttQPa071MqMS0zB4{aH$Sr7A$jrhtOkfttR1`2CWf?I-=kCDD zBB%NgEH_ntR4vm2h)HR|)OYEOFml&2fCkEq)YrRu*@e5VMcf4REw6o@X*4BTI)eP3)YB zK;I_uo7Yev(S9wa)6i|VRU(2;{e-wiT*64Hi{jKa$~11gF3ZbDb!)C{%GhYenZJ^? zBG~{{5)4hK$^-6ImtBIEJ=a6QNrH5ziO~h@>-X=ywtVMq47=b&ryStVw*Wx~Ckl24 zqvFa_mr({YT`C%kjq(oE4mCXlE-hs6h&h7=HfXM$O7#*?l3pkWMj2)=eoGgW79k~; zp0?nM+f zM31~|9sjP8r5>6!CRF>E>A^P;=ksQlGgP{_cqiZ zcAk+~iIOA@6*(ga^Sd?t&pc{Hcto<*QAV8Bk-3`^v894$^~p~`*~#UheeqRN4x)RK zQTe_SZEx6gAK3X-ez9Xxqpk!O+?Wiihy+_cmkC&=2X}fOvQ`&m1PN>Ag0qo zkiocHGgJMi^qlrx+E`uZA_*uC~yo63f$Ogvp1L4Tf2KUO1FtfH1KRTta(;{ z(pG|cYG^QhCr#}jc5(qpl!^>fiS3}Kn@~4{lE&75R zM9w85aV$S_1_g`VVx!7?0IEW&6lQepQ-y?%B-S(8c(70+3GFPB;s6KV+B`pbX%nfi zDi6ZU%ZIbwzR!v<#9U9ARr&TUf_|*vUgDY)m4*@-vKU~lJm}=3P>4k`F_S&GD!-tHL@7Bf4yx#aCcS*$9}|ZXmcx(h1P2=EGO$GdUST#9u&h<`dh&-7Mmw$L^{@ak`1b{{ z;eiZ{%36+8+xgh){C}{yu=eUTJ0>=k#BQy{_1n@sUGdB)FLh;kJvOrr3W+#zLZ=@r zGP!NSh2z6P&{X&?8%p6qr=nZ=&tdg?cPf|pYxQ&T{SFg93ll>qpLe5cN` z+Rl)dJ!M;L4dXOH9&bMg8cO^+Qzd;m(AP*&mP&0D7*}|-`Orhacnm+-dORjV2k8%Y z9;IlT?%1*bB8F-%--&fi#v95ph);Sq!dE zkko=n<{B3z@7Ab4SJXJ4$p(h$`u8CdPpslBFt@loA%O?XJ6tcRYnzg(blX z_Fx$X-bf%B!kzQiAu%1$4X#4wdGk8MrHwGaP#b z7F$Yfm zQ&h5L&gX%yO#?o(OhRoQAZ=2_ra|o;XN-4QZVCAPf&(E1o2k)Ob%`YxN#~tsb0k2s z-Rgn^Ah$Xpi7x_o@Kv^qnQe{&gIKz4Q&A?jSO_cx(MRm)6whRu#kE4&^5xKH6I&$tS*%Qa#2A{x|w~tOP?In1!sZu-hc?V(aC`kN?a6N?=zO(BsEFob-td zYrk#Nq{8 z*z2&PbQ7FHSyPUvBk_WZU08vpTIA{6PHx((!9IAA!9MV_{U*6!n6d^flvkw`lJYp+ z(#HDY{OZ~?i=*r3;8y@jZCsI&+(QaGw`Lc28o^Bs&2`(eLP|z~Let&1O0=D(pd$v* z5ZfSkMn-Q2O)G5%g*YaOmRaL0W{@(v*xHBSMnTSCuC;hqNqXKP==>L_IThd2B&bC3nq`woH#L7J?wQBI3Df^(S)|5nB(1v|8?%>rc zrD$JwzSlcUJo@sTeye+w-MxKdhleNWho8Nek3@SG`9jXgB%yYOs6s+-Mp3%{a|LM6GMyoW_Do7&_7pc<6j3Wex;~rHso_3%_iw)iQwO zLMW5y1m=MF1V!7zfxw!1qY#4@5_EIdw8kMiASd1?co|GifSRV;O3wZowTE|?7*ODH0&#Y=K!h)a?4P2pjk$`6)c*MU${hn5v z1a#%25qy!R*`+KQ!W`%6OlArP!D>u2ZwKaevR`>I0Ww8Nz}U|hJV|b^sl5&2CP}ia zr*W?fabtW9ebLO9L0o4+T6`1oHuGm2!&%g#seD=Er47TESl8QT)|OaLQ=X4jPk70b z)*d?nEs-`#V02}|e9M5P#7awk+FFai_?CH6Bj|%YoN>SvMxYYZBbRD%0o?+Z=aY)3 zjFCYUYhuM+I&0}^REb8!YmA51opIYt4D7rYY-V&$kb7!8&L$&VM#^x^5T&6=q868u z!MEchBQvtnS17Mr#{5;mQgQ(tYf%_mRQdJXsMLNm9yn%HKc?Bsvyw&<8s9PLOXHX zC~GEnw{zX(wI2!)GdamR@RFe;U$c96qGlmi+{Nxm`{1%kWP`&g8t zY~N?w0r_F%Jc1_^T}jHx{>FnHBb-!2Wj#3n?#Uzl?pB-#}P%M9V)v?|@rsWsXlYn%`6 zdUunq;{sdzvnj~7V-?2jLCFZ?XZba6&^}k-J53(ARM2IyQ@g^7`JII*n6 zLm;CDO%3%e})7wAY8ehi?$7A@)3@o+;ABVjvHl zwp3oL8XA7oBZ)S007w^&Ar$YgqIp+g+q5a9^W1!8OP3BYmGu1gMfn^Jaec6P*>lp> za{Ps~Svk2hg~9x&Q;A1UIU(c^Nlx$B@j*B!I)tw8<-<^df?Mr~7E8mTfnV;=Cims_MaiE4=E144Er23WDaTPjMV0RSOJU+HSvNr0=zJ-d~rAaX0bW0D1PTNR@F6(Gj`mre;Sc_6t#C0r~CXJnU}~as&Ld%$mPbzKaGVZ-Gw=f+tkm5VjFA zq?8uTwIg$XG^B(OW~0E5_@a@7>8ORnlq0|}w!sGhWdWw0%2}LtadVh=U=hj_`A%AO z_6mun@Uqd_z7}*82L=>xD89(eONh!emhDqael#>4#0ZCg=ZhDeq=in2?=aFv14FVi z6*}oM+5pl8?ULzYU4T>@B#1&`CncnZWM(dKxU~a$adcOA2BZ0kM5kkR8vt`0OP*#5 z4m;c|x4Z@vF~NF^ojEX| z$^zIC;WY{5rU~}Um(PyiRxrSx!?0OWEe`#B=p2M`N3e-KgiN3Jf zs%{2p=(v<^-0Qj*bN6Is8K%QfJQSZ`xAMJ}gdYYn8V^i2;tnkD8OYc%4oslJx@Hj9 z%J!X3wSWXmhylbn7>isQopi>x%X+(PjPO!KDpmM|!c(#w`%Pd8!Z}ijVuN9!ub`EX zgIv=jDmy?>5UqlW(g;$jH>J)h4o!# zuzw|#M1Wq!WzQAmz>RU5TPs1ic)ZOqHVxJDgA+CbJTsEfn2wyg9NuAobN2d4z2vi%os%O8Y?7eV#u`O_d3lzZ@ zxRZEt^U2Z0vUrUuD&U*lyn3Mc@Ag8P2|1^vq=v{|KQm2eK7HNt{M04N;Bu!6k!IOx zRls(Q@ zo5-IukfqE^?i2UoUTq;kPWaKT*e6`2z4DnE5HKunKjm`!DCM_v56R3w%lWAI-PP;U z-}eEV)=Uvs(I`&jUMYhDpja_pZAwKXsoSOSx3_!IFU#A< ztr`e(rrtUHE2H8mmFqlERuWCaxQ6j8t>+a3s~&Eaa@nmk{F$1I_v=LZ#>#{N`3VL0ou!OTKeL zbk6Wb@b1;0tDXgrq7w+LMa%u8VIaeP-HD+_cT?DqEK7pv-9qWPJw9UzlG%>wbQY1Y zba$A&&lJ<6&;TUfPp5X}XWxoFFdFwG^148H2>?exxWA-m$ZwP!azNpCEvN+0Yn-G1 zoUvD!Y1G)P6aQ(Kbs+aI+$#M++_(wVIA)Togcvv)mQwt=#b{q<#%Jcvhn=YXD-<{( z5)?m3dWj*Pp-E@;2W^)N~yFZFI`$jPaS@~nP?JYh0sA!G=Hus13hJgqXQ!P?OOGpm6`GsjfgKKSwqm#2@iB5~>>1PSsN+tOvj*+?0e$wbu zbOt)9tE=qjR3}0ULSaMz8`jiFXL1*hkzAed9CMeuN7-o5yr;&OP5`7b7a{!YAz}R| znVPVu1mBB5pRHxDy3#qsrA=!&dJfQ|k}R6gom0hB2!)d!m|U!fsp1*)fwU_Q>h1jn}r<{ZoL?PlyXshY9k|^c6S~N;fmojpom!*`B z@i#8r)KD!7Dn;&cl_I$%RTf~Aj;*YS##M=XKJ~cq1oITZ+%Z@z4y?P5tl1HUF$CGD zc!%b{c!Wg^Q&_mj%LFbuNueg@hV=k+=>Q_IO&6bZ6Mz$`Cw7 z^FY@`Dd;YF>ZFa*Ew#oc9t(kx%K5Z<2V|tH;Nf(O`B{arlw(UZ=u=18kV#1}H<%$W z=9^YA&Ber4&7<7ZFa7@aw`vt|&>t(9Y#F(*Vg?yG!Q;bF3Sxsr_~VU5+6vF_Ac<}! zgT3w4R?BkT1cg@0;5rHwoi`;mnE-xSf@WP~L&o`S z8JWT+9~VAJLMK0WTREWl|GnL&0Z=sa?0+fTVZ0dt)R;m~X-tQffJ~;SiMBu?n}8_a z-P^g1sR_Sh1VMRC{IGs~OI|?9P;NiwnsVMdX9}eOuHJcFT#N=dKPl(0ue=a1T6jG| zF==BElthUhETBu80xb%nz+J+wu+$mL>0Dnnfh2&(;&_lh6feGfolzpl$*t@px!smo zgy&4-{gk+E@xW|wRf2KU!!m5;qdq|+pqNDN&3H;zgI={TKPr` z$o0X~{7vz?kigyD6Fqae(V!m=vcQr>z*;er|CBMV2*qwYB8tvBi7ON(Y7@?mx;T)M z5=h5icZ`6LnF@Jg`21Tp5b)nJzEPBu_~*gVIX8~qN?Y4P@0H#d15P52h&@40Xi=Q3 zZ$y9>ah*ZKOyTHHm!#7LK3~KXm&`b-C#i$ooiRiiqW}dLh{yxJc)QT~y>1}$98VFY zpU;V`rH+;3TBpmaak_9!08hLiiBfG2&0Rnu}=4ux7MCVw4xwX*}=w2)>yBB!R_u$*YhX$j+k)gv?V>Uf|i1r+_6d42@-Yr9wVzvs267I*I)U6Cf#kmK8x+~E+r;U5#@|f4OnpPW#VkM zERWXRo>pEwY-&1cl5l;n!qzgHv~wl8dNTvCP(n8S#y-?{G(AHuYbaPQlym&%IDJ>l zna`3tr|rUn?IcO4TZ#tA{oM>SGxY=N6U_Y%m`-2WtOSL4VolG&CITV4c=+;rK5}i< zi^3@IqbP_t@learCME}=BTdm{MIYu@FJoa~q>m3SP^OYk4vvn1*k+%2O*G}O{OxFz z0dw^BZJ-7vsHc-gft$}0=|%v@Sz$qv{$pV>!rEGFa#A*ZNn4RF1ykdCm{4~TA<5Y+ zved#&PCY6?v?X}#Y%9EjF)qu`WmdeR#W&>u!9igR{G{Y=NmeX!t6l(^a=+jl&FUn) zZ`1P+bv9YP7vMpgj7ApTD5!AOd04a1kX zRH74pzR@*xTV2nuL%O_h`O;Zh=CU7X-h%3C+{ZZjvoc7m|B{ zR$S&}*Q#7PTnTYR0-sG#LZR}9koGawmOly*Dv%;P)?VX1Kp%-fg4^TX5g@}rh;D7g zV?md_KvjOMqmtVc=21N1%%#@{^M{Y!;sNfi+E>Mc2A9XnS46I`QI{zb=F~-ff#L%) z&d}HUy}fxK#LRuA`uz{l<#heMYtSSfv)`~TZb3yKpGN0C*h-BJL&kCd%EGOo^aoSz zoVg$fuhQ>*aWA+v94N@>_a6IVOh{{ zhi(>4D*}3=k+rz}h$@f@(1$p{F@bEOW_AtyZAe*9#A_PLO~S56Tp?avLxsL>wDV_2 z05UB+WDZ%m0 zv7k!KBDD9%j}9>0;%P~aoRH2W+QF2XO@;p_Dqsd+eQ0#61d;Gxuk)Sweva3caEX@g za+kshN9_Gnlko05%_CnMr!zmd)c0;JuLaZ{BF*E$zV+D&{^AZLuhTJbJ~0<;xuu+{ zpOV?%_M^NcG_~yLDR!*RY!Al_LcG^&uP58-YL<4NnbACLVDS{9)6K6RVau zUQJM8sW7MJoQqg?fU`v2^qj1Ny2!QtF>!yqXHn_TP7jfdDaor=Wb(8PbEA;XLqSkZ z?mgLdSY%t>HW?2s>0c#UL;4(+&~0C4k>g{JP&T%xL25sUK)Nh;>dHz*Uhxpik+S`) zp_Gk-ib~(vh?I|ze15~;jRpD;%?Jx^190u&nZMqeR4sm?I;wQtkybm>d!#~$&boBb zalovs9*Tu@=HL+&7r0a9nlVrQ@U9c9qV*Trc5qjrH7dT|I0gaEZ2+q;j&^i~WM5N3 zB<8y!Bp^wt#Wr$?W+nW#sSdm6WLje`&jHkJ6{C87 z78u{w2v(gfFvc;Oi&|k$RQD;p?ZH0Ssl6plL#2saZ(@B-j`7nr?N_*hk@RZm!f6#I z{GO)RQVK%4Eyp#nBH*E4ScHox_}m>H)wzK(uJk~s2KHExZhxZLFF)Gc6w*6LZrUNc zWs(J=r79EjZ3D*<+58F;0d9S4?km1y63L-Nill68HexTqJ7w81o&yp>!zPha%U26e z9QWyGhXD7wEHY=bEWY?4uqBn5_2R{a*R~3%B#a`0O)>aY!r?ebbPRA_a)B%~bROR8 z9}?FrRuE40m$;?;K;6RiV^Ha7lNMeittLw{9`fRmR%h?zPFX>l&qRO{HR~-GmEt;2 z_)|j<6mnBJV2KK8C8~XEpd#pr$nR$$?q4Uz8&OCbcBQ(Mf%SWu?lW{fn6W|LCr#g4 z4rs+Z%%?MunIdSUTG=6P2@p@)e&zrr&%Pz+Xv+~}r^4Wl<@d;Solw5p;mQFjS;#no7}ZeoG2grxIqO{^?BUMKnj;l2a)Y``I0| zD^-{X4>geMTS?*v0~0om(xi?q6 zD7bV~yj$3il8=VWy)PGms9-d5-P+f6_usodCbITE%DN^-?xi?$s=Ut=5z311aE41z zCv;fKweNZ<3gb>`tv`w2>taVBh!pFc1!TgTIJa_hMJjNOyqM@)(#-{QJ`^yrcqGZQ zLORaZ#Ua&u9BvVfdIqvanz9osnGN(2L`D>Nx8*^b0-`K(WM;kdE9rSJ93Ii+VZhK~ zfpVwAR6cGF&?%cr{iC;3LszS;iJqzRh(mm^lM>S2=H_qTv-rnYknG?_#10^2?Il6A zGszPTvmKE=%6BF)-oCDr9-^x|LSiLF@X`+~36$$H%I&?v_?CPXIgJ_GxzX6Jbd$`b z%58ZD)uoDUq6GvPiRW&gb^o&fc9Q*lfkAV&W+V<~ws0M3&-moy0Jt3*uJ<2kf4>o) z%KbS3Sjd-z*lo1INucFy5Nq~QCw*U>AK)dk*h_XY!(dnVfo_;q z*A~3nP!O${G20;S*&?eI#=*Xa{c+{HDEL5;gjiP7-aufqQ?x!5S)b@fQiW5*4bsz# z%9*_?&I>9zZ>1T{}GK!_vts=Wiku->-J~kMDX#Ksuj`0bx>D z@#{py)CNZXTQ6Uw(RZ$9|s;PANaSMV8M3@UD`^e=LSgb9= z%Cd`E;WC1vJlBvp=WJ)+atMVG*@jWr9R;XRc_o&taH}|hLUxY7F5En4mel#;eLrF+X6~7JD1+`kk?@ZQL*ub?c3Au1zs=@bahoUDxYRJrI3ec z9swjXkkQdD<}%LMARU-9h@zlJtKXq^)K5k6QB&J9ikfC3$RtyCxCT!v%f2{G6T{kJ z5R`OK$`FTrhb4%0G=$JDkPIoXSy`3WBGj}=8m76JSeXURqtg@7PnE8!AE*rYhs6M# zkE_=^<2Umudq^Pb*R4Cgxv2V%>IFWVHi?@y2HM9l%yxz;Tu|B6tb<=kFLujJNC8NB zP#-2@Lzq*jq8rO{A%ciP=Ck+IStR9UT-Z*G5&+)h zxHxcpKs1>y`#<-;KR^r*c0p{@P`E0nEtQ+-y{$A zspq+_E}^Amsb6~Lbj4Qf27iO3lyIE)5VzA0aao#6(v0nn0zeoM!vq5k#N;|mxs4EF z%7eZy1yCZ46ReXMLLs2dBkm(GjSxhUZ=wjGg)Ybmh)2^ja-kWtkbz4sErYo4bE(`b zr=!XH*`5;l)>X^P=J}TtNm5EG;wY9w z&Yk;8g46kB6=H}T5JR9zKmtT%l&%QNoEhAY?Kfb1Hq!+NZ_S$kS99(AtM9e@@c8-3 zArmNyvUM0@1~GdJO(PHu$ppciVSz=|t6c&h1QdXkcz(`tO}} z>yN^!maXde^2XEG)XN)A!x{hp5CFItxsi)T41$}=8^bGTJY~WZXj0nIwfBkLnaX|4 zrm_+b&dD|Hn43d|xa^LK&#NXRlw~2M3o{ie<(8dI(=#+(CD<*!*kvK_J&w0*5lTv$ z{BuTVdu*ofJf1z7br%AwG0QS6i`B;bwrAUZ1*n-GcC!``sBLPXsH;nu2)P)&cX?ae zftohH`)~>Lli7JSvwAA5a;j-w>(B1$AbC<;+t)z7n0kk7j0%f>*i|hf{E}0l_3QDJ$k}JhQ8cVJnemG|laN3fpNN9S)K6Ho*q?(V4bqm-gkD9WU?Dz8KSa zUz2WaSV-+}5lL&ZQ(n<_5?R)60yqa$AH<+SXu+xA*kQDB@}&Y^;nAr9LY)<_&`|7^fl4R9 zO|0h#$1Rt-w)v!8vwBba`HH4_KrrErIvGO#rUY5l)W*W_{XA`H(w&a^js?Rz5Z98U z)RO;{V(1PIv;aLe!A0~FdrmOprN3hd{|(^JO@G+$GC=+~opL9+O5Xc0YL=EQ*g=H= zHRzuvV~DUK0a>Mkvw&C3MHrGI3tbwdP-^t4FBy_J4Otb(z z;rBc{S1ulVf#Mz`Jqs7-fDRXk3MHaKTzB5O({*P#o){%!)9|fF;RF(p`xN7x00m%P z7{Jnjt=Un&xSwyaL$A*)GtbuJ*9$I?YICqM;JejUM2#rv9FGk0kfV*C^2hmsApe(e9;;kc0xn(<2!RFt6j|tbJw*^j9a)(jlpU z1Rmrn1bD!xV5+hn`Bd|aC)aGL4-jtS4jy;>i0T6#&Jy$g5Ox>G7>?Cmxv^_m^^UX4 z5R57Q?X~znQoX6)!zVo+Dgz+6pi4*4HrE?Lj*qFzF~{h=4CcMOhKFXEp9qE1_nwsq zQ}2`NNjl3<@=gH>v0pdEQ`|KV7EVGZMw5sW@=r3@C+(awOzK2`-yebwVc@Q#g7?6| zeg<657<96ZX80LSMr$45yxyet3=OZzXm3+%NJ_Kzc6dHi9sg>M{*}XyWx?EeMa8*M z%a%pu{uEjd{bpv;v2H)^H=C=5hVfCV%)>+XD*ItZ2>7&r>Ik)wVM0chZ3v z1mXZCA6#M2j^XK%=Vt{)eN-^yF*G(dc`SkQgw&L;(fwF;RFS&A`>hjKeEHEYRx#=uEs+MuAc3V5BB4icnjg2fA!rD@df_ZZEzV&>ZkfR;Ki>VI0F0W+a%ZYr+Fr z4>%Kv_WfpoZu|Of>bN>o`s~*~mn>U2)zy@DZd4_Hb8-aoqXN{uH!|-)@1}{(=K?Pu zhu;}kKIhLTzYsgN&kER_HE+q1d7ja;`Kesc7J0<|_5;SHO1rv*W5<2ssZqk0S|Q6k zY?_1#$%Qw4SD8QE>8OinVz^sE!(%Z6nt|pC#tNgE8}ymFBU>21jXB0 zl$P%cR)Sl(SKpiPcW-R`tNK^tW5@oU=OAO76YHB3W64pkIxuc^D-yq;P~O+T3p`J> zS{wWKpYp%{0+m-(R!VMERjnChA^S<&>=ieI{#TG&UVXRPwN-+??7@PAc|aQn@7O*a z?8UzVS)A0nhL0IYZBLmJ2aci$xxp*?c23NC+B^>Lyl%MDMGO% zKYy;KUZ4!)-cdUhWNN(5a3Uust28>QsHo4{i{Goe4&V%Nxb(M@F6bh=k|Maq`Ogtr zGcdP4NlHf+jrTs8KNpEsAgOzM$BQCOpatN%GzE;v>TSN~epUo2O!)LdW+a_d01j}( zuMxz|45jDw95&Tf4P5D;7@uzZBP~58SzUc>zF#ve*REM~ik~*;{%LN0gEYaTKBzLE zJ`I8tSO$AtLXXhna;Gj>rf?muOJ5bvP9MkiEf|4lT)J860uEkRe;I)8tq|(p>Aybt zq%gX>u*LzYJMs(ga;9Q&U!NM+rbz;{GuINa(?|I85driR@x+P#{#EFevDtv>*RpL} z%c8=TmcnzxmoE<&Y&d#!!`G2Q>S(GEDHFgqPMlVX^1QHpdy87*P^WO-7SHd!_3E$? zLqb?^j@g$ivqEbN+VSP?_)STAWNSlkXr{5Guocha9S#sh{h0y0redDTlfHOqhG*zX zJ{V|3izTY&JOM=J=NLV&2htz`(c{y;y|T0EA=_q#wo2-O=Ugw(56D@5^m(P;qo1SL z3bB$rL>lMl{*q&&5F}#Wz3F?s6I1mU1(4MhR94x=m&6O&gWB#qOw-_^g!!4tgy9v# z36rOm;X8?uVx=}Rc1a%@K(nQpM=EbxF~@J_dC2oCU*ZBjLnkQvloQZH$_cv2qMy5i zVDTstfK2JQ5mRr$TIXvMUW|ttpILua9*-0s!7ka@>yAh<5`x!x^~kKcmw@$QF6^1` zcgZ+<5y_M8xe3rWEB*OCz+r-F|L=SKsn(Ros#mzAy&djL8O2k=@&CMhr5; zhaZc;tB(b1cAjdyAoT(~R8>u0(R-_7W3}KLOCd=wCHrXOvy}Qs27*EJ2G@LZ=gyV2 zLIOX3;l_s;uK86)eApGBMl@l3FYhSQW*5|Exmxn~hj2`z07Y?v(vN5I?+H6rf=s<)$EWg!8j!a3NGT!GOYKwXG}u;(u=d zFBDtq>MU4_2`uHlx_#U7GOQj1e|pVnONj3Ay(9;EU5fn4_3$#}1Mm}TnT ze@5|p;|+$Kxmn(LRewx;etAy-Qq(jZY#LqR_vPG^P@NdDhq`+cq?a}TbS~s#e8bqw z1wgAV>1HX!lE7O1jg}jFM#schaxF2M-NQiv`oz8Xne3wBTJh1PRQ9Z@o}8?y{%c&) zvXY;JnUY>yi2-^DAt(Nz-B8MbYw0O=LpNZ(GJKYcXscd*wAm)B0r^Jfj9OI82LEzK z&_ot==`gc4b>Kt#GX`jlU3lxXOgv6Vr)eM{VW)X)6$Ez(dWDqf=qFBqG(TvO2oS;P z<;-Xf!gCPgQDr*%Z-9fz2BAgg#T+4n<54d-xXTDBX?Hq-=7WY{x)5&<*GOUOmn0SH zyJj>T*B8FiIzk_bh}R*MS?|0*t;oUE$;0n92*TTP~}CeyghYt`0)632G_ zF3b;`fKfD_6H*M-!%n^^f=VPU=cclsN`3H{s1_?)l71e|NA#_fDPrdFeEPW73qRICzn)C&WfdLqn9f9HN5Q#-IbwM^ z(_LMoJ=W3IR0|i@$r>6gC%KkK4jF;`&jK$_G)C-y4{}aqr=r(hdm%uku-Rk{$hfVc z6dTXv$G1ArZbeqM22i1|x3`YtTmU2ID7jwFNwLaGaboov@y*n-_%dyow2XV)JBgBe z({m%rK!*h>h_JWxU@0Elt6F+it@urNVd1JCvw5eFpOFqq5mQ$0m5!k{Xx5E^yqS5D zZILim@;D)VT#`38ONqW%7`aW7+L*d+$Fg#|GrEp=Q4{sd7rs{V!4s-;GtX_v%*}kw zfX{jV1LB&s7e)P9CukN13je7VrBpiYSw*a4I@yH(B>`EAp=RueM>Af@VWKFy>KE#h z2ww9E^-E!35ph@oUN>6@3tdyLr!)UEZUj6bjRR-vv=*t(_ew8ku}lxdFj zjpx9fb*xfgVTtUir)tA&25lH{B;@p+kBqZ@nWN{sSs>X8t$0a|6)+UElTv9^Z-`*# z2kpps1_E#BW2m3(bH!KZ?x#G;NL=-AAEQdJCM5mkR1RflM``T$l*_H zZU`)2xM;B)v}H4Sa{2PLoY&XjNfMwEgt4^6xvlK<*y2F0AJ}|CoIhU#^XGjS_P_(q z!0cWt`FIdTiBiz1g`Z==s;_r`y{N#iGry%0V{l(r#bIz2=}b<@Il5b>p$(;FrKX6m z@-F`+cIB1m8j6C?Opu7FPX@TeKQn>bE|?8cKu}8LDlbtG!1?VT=Mb*9|b>1 z+Rn#aAfxhr4S;b3kFd_5KI{_KkGU|988(D5{B1Xd2$a$e9svv{tFEH~R|?KRnG=N- zro2cB>6qYk%jM#qkxh+ys9)RJ`NQh@p>*wu@j0O91QpK#^X~cJgGm{Qv&6}wpa>;D zYvPUWVtw+luNyl}vg}_!#S#4ajuX6hOczd6|4dXU^vgih*3Cf-H!eVddtFluD`9*b zJlzE(8z~)#%vqc1dtMA-#-u0|-U%vWu|hvu6^k>7VZy$5q8jFOdnPb`WCV`b=m=*& zMxdShAVfoWyREV}XRLk3NCTw`#K85RZpPMurH-!Jfq~k!W2vB}X93?Rd5%2T$9g2g zL4Er@hR}nFgHrj)+%1e7x@j-6;c}xJNmphXjuy5|sz$fDUZ#`7#RvR~#L! z0EN|S*9l|WE?(R_*xSAC<(EMi@K^G@xB{`%0`t;8?T)6mm+rqey5)`ZH+u5!ZCLtt z6Meoxk~TG5tx^2*aL&LlPzm**ZBQlmGIIf9xWEYwDWbv`p+6EMyO4ZA zrg}h63CM_z7zq?40aGtnQ2%CD0BeIPxlaSfdi3{Ldyih!FEX$2((7o=I(k7>J=o)3 z*uJebZ^4QXM{{~@dRb@ZL!F&v^U`WC$I-2HO9GrU9nSQUiKwKgD!UH^+qyC2G^ZjQsSAAs`)$}?Yb@CT-J{dWx;yq8R;()|x==N06upNa_e zcgl-m5C0h}&I=G!ai$#Q_tIE^lE+qVoDb>7pIRWT1B*xqoYB)vRAE4%{lV!N?fQ!G zyWF%OB!>j!Cva?1(*lIhzVUG4#WzEsu?LPrl!<9V4jSXM??ZHt#A=`h4!ft(4SUdr z@GA*wO)0^R2S9ut^uoT;y1G$II?ZHqx$5i11gI}jn)L|-iqqqex4xum1Zt}lbqWZe z7)o(&4(R}|29a;$91i#g5naceKPH?`8brf1YD;nXc6xcl>#mT( z0fSmlLR&uX69Y~h(Gc;tu0<1y;WYYCFl;OEx=iUfio|pr%dv1VhufzGTNUFpC%{nh z`r+d(T9LXY$MH8Oxo8&3to6ID*XM^yrg?*SOG7yi)OngeL>^Ka$8=hJl9`8fL#KR} zR3Qg#Ha5rkghRr`L!O$~L4}4WH-A=2Stih~E2hqkegv;|8V_6xK+YEzs+bV&KXEK{ z`Cl3Y1i0b^u_u%@u)fFJ1QyIrhSLUVc%e8+QE2bCixCs1bF}YiA4Pi;eewVxqPEA^ zUH>+F;t@JKN7%esQ$uBMedG}k7jc1+_f5p8c9;mw-l^2TYw6x!H>y0`+grA+Wq$8a zxVm%t8tp7tzIFb5VX$uAcqI+mb7f`lXhih!^9#*iohsW3js#2A-U`?YGuG|pGJ1_5 zF2p?#T@a)f;<&TPaMHAZ$#=&U3Bik81Cyq$U-x8kPzB|}JnBgYESkXF_nJDOM7-Wm zS!u2`7#{c;@{kTu5~^Hp4CD|T8B(b-UKI~Rx@Hsw=r<6-W|=)$PRXn(>QWX*h>RRE zI;WgsC^-yfSTYy@Q4YtXrcZ!*{}M*nLom>G4wJOZ7NAgvDbyFix8W!WG0-6iymqQ< z6iA8%xuQg9E)1p%QoLdZ+vC-nfCHLNDUnOKN{Kljx=mgfO+YwrXPm~gZa&=b02EFf z!FOmf-Rqz}^@YL(RmSUazi&7spf^+^TO)Bdw#7Kaci{EZXCQZiSCNv9PjM(CHG zY^-dD?c7prI_F%9(UDhSQd$=yAN|ADvdwO@W1i<}7eo+%Mm)nK48*zbatkvPCGQ46 z=?Qbb5O~z&6ABi0T2w48RY<bK1DPJ(xC0p1^mfeYRwj8CLS8S*Ai%R?Am$*0s&c`~ zy}9#+I~xD0nfr9ZVw-DR5F$mocuCc1^C~m~_Kb{jPUOgqgTaYGB-Pp)M3bIZsC+dqGL-c}r%GPYH|BPL=`U|JN6ejYA_ zSBqm7w2%+Phc%iE^I>XnI6tZnT6`uqHGyEX}wJmqii=ZOi*?kBfQ-03t%hn ze#<&z1y&-)47Qrno)*GNLVODYF^ve`wmA7+h=H3>Fw4q~KFj2@#^b8dTet180Q3fq zOGs?^JBs_e%&Ezhc*71`A8ZWJ*5v81O{OY-H>*n5d`M? zd_I3bR{#t8KcGIOfcB7woSfDJn0iyqdRcEKNXv+XbMkx9e)(~9GKj%GrVeXIiJR() z!VBu_=z1o2sQ<3Vq28k>@%I_#6`Q{+tD2XVyQB&fP-2Y=3852W{%GZ>(2_Z(%C8m1 z2ObdDu9*;t%I#k()>D|l6w5w7zA{pyl8(>(AVS0HvhllLGjhr+r8ubzz9eoCst_bN}ZJ@j5t470&@lo+T6JR_5b+%8Uc z)0oG%Nx&pHGLBuLa8lr6T-ZBr4ZHvl<&jV2JQXSL7PO<}xX@|C*UoFSFHy18z|26^J z55s^t0|FGj`KJfHp^n|WoAZiHhT4yj0(s01l-&Rvg`ocupl`N9h<*$U67!gIS+Oq1 zVhVFcD`WNQXgoSi4+%o3ggmE0V05B65E$nYT;m5+5jX+nf@xrpwiecd{`k7}btCU2 z>cGfZqzhpObudQimT~Tf<&mAl%P|&l^%!V-G*pL?fJpmPxxZIr*p0*x;Ra=*2zYp+ z7z>#S>k}W2yka{GJp1sxw?F*sASYpZRrP-FQ(J|2Wi0SC# zp|+`VcUK6VJ=u`iR+KkYzX7kN0uYH5div`ZCp8bw11o}!hi6ggA}5eyGe&@1GRtKo z84~al1C#*H+v*{Q+GA&!84{btz)npw+)Rr>LLROxdCbhBK1<^OCBhA!#yPh$qDGox$>@7len-xN zI-&`XK^oqy%7OjqBY2(AdOv^Y_uos(>+2yR1Y&Dlors;yZx$&86VMfGhXz5!5t6ZS zBoGRt^}8^_8TW&+eKaP}&`%e-Dj{PxI5MJeilQa1cRpv{-jhFs&EI^fP+{7SAb2O{ zTh|@qkEF{Fcpi-w5P*(NiBI6)T%aKxgZ zLB4N{pAwOKT0DQOtXw*jI3y)ULan-7Aw{160Ek`4B^{FDW9Rf<{T;nW|9%-!CN0yJ zS!T6|69=WlU}AcS#3IR-bW6@iuo=rp00L0LNN zF%ID`8RtHcd*maaD7pl|OiF*uR^g^7*;-jtlaE*GmUd$)9_wE!(akWAhL{8UVQzXf z8BkHv7{COk=fZwtL7)f49=zCm0YyR$=rXQ0!p3VOO4!mGEG&dC4-hyMIaffAxPACn zTtZUKld>&>X{9os5yv&MfhBCU7SXNbEz&_4)23ujgApgWWE0I6u_7>ByG1>m9oc~c z2X^#K2VO-lp4KuDwmj)B~@&JgYf<04{Zq&XK zDyRc1k=zkNT*k)H6Vi*)Dd|5?uP-q2(>@dSZ6SCR5c6Bq>#c#1`c<7e69ql7@jz%^ zr=&n^tdR*}37o~GibIp<@rZ}N6J&?*Qi2FAS@hdn`F96d%>jZ7{plwm2o_R@0x7i? znINZ;XcSLR%hh`pHPX8MmYgTtM5=nF4~pjwxz2Ijeg5tVZ5Qh5ePFEb*JXlWZJ$yd zs?OcchU&cv!Y@`l_WGS5> z-Xa#w#w59Z7Xp*u5Q)FFvL$F}f^Ta2CJq2<4?9m<>)bj{Z_WFM7}?OvSs{M|$1StN zTC|@QMK-Q~2>9&!R7v+Qz)DB>e~KOoKXm#{rQd|A8haq!zr2##;{h*?F}8_O4~>n~ z!r|bBhp-gC{<^?|`2@s&mxGlFL_$umX1`7eKDaWsX0W(s@20vKb@UnA`?Y&NC@xdq zYy0f@{79{)X^%N8nhxseKHWAZTN3@Pgj%5pjveuO5er#FO?Pb*w8MSJs8*SXfdIr79?~9u&tyBdHnR(BG1Aqw=KQ+>BAxUc zdT}fhC_)#kCSVsVmnL!2V1^+^0a}Eez=)=wc4CaC;jA%@{~3?lk|PS57{qP_G`+kZ zZk^w~2Pl9j_G+Dikp}VN!rIrB7+3|#C|D9u%Jq7Kk&X=g%K1;n_FUci&T{>%J}I15 z6VFs6McQ}2c(Btt977IA?QcF`aq*BSzW!Qw_iL|<;!trhmSTWRObvFjha*{pjlAkT zM%gxH=T8I>kfy0a9Ze=`(RC@Ab@S3Um3MAs>!$SOX%)KE5>M)x0LfC;H*MA}MIt%U z*k7902sC^vpmvD+A8`rm!PQ8}Y;!}mPA7RiWaw;*<&u@cC<4$*-5rGi9E!>HHky9h zH0^UODe9Fzi~WBqXq;JCb?8*_fh7`;(pigyy8Cnq}dm8w|nCfBr-rUDL+at8^ zKQ1FhAzJi`-;r{k_$-%5qyIi)`f3QMOH+>JIp=BdR7|Or8G+{RN65_ko*r(v#gK|40S zv0$Eu3_64Tf!tB(QtDekm;tWe@-_nYhlB6ES2{=w;XUFZ?b^sMwRa#wkuFe#qX!&g zl;`7pJEBpvN?-8t@eWD$K1c_of_FQBV~UzX6GGGzo=$6qu|Og-()#KyM3JPChoKqc zKA`aby6n777-JJ`<96_kCVB6V>E|)IT}YOhSGX_7q(?*H+nU1x~M<6WY1x{Q8U*1?BUc9OoYlxtThf`uzs>N-ffT7>)0o zO_j^E{bOJ8?DjKa*!{3r_5D`J9x@6(qtfh>4?Tp^wI8V4k4iclHM{p5ZC8JwO-Hf* zA^hYdOz=0a=u4Vcri@PhE5C3t1;c@tJmeqeMGTxuQ=#2&0c=&jREuh7fL>u+k`H|1 zz$(QQ> zBV6bN!A8NG5F8OV_QcV;^8^TN=gtIJ6(Ut!4V zKXIa>(%a+uznZ{#^Zwix=uZu^siXYufs8=H)UlwYDqM~UNY-m$G?0xHq;%~<6|u9x zbywiL2Ly~k&1RKMx0VotZ6aVUUl@goIxN0SvxL~)0w&OcJDfC5s{0+_`aC&MU0oBq zg&pu!@E6qcf)!S;iq>4vE?S{0o2D%i%i<+C2$w4Dn!2QT$r2^(u_hdh#m2=qHqoAm zLQT=iuM-o1d|~gy-$VlqE(b7ZJ-)n!`^F31f)A zAhVSZ1}Jnh2svzT5|pUgA;{N~#*aeu#nr`;zodoQEZ_3$%w)m-E@@x3iD}8IfxLdz z@FPi{36X-MCS{ag?^$UZ-{zU8H8|dMC&bI}auUeJK<;VcHIQqh=T~4uVRQ3#rnzu_ zH3mziN~)A1&=Tp7u{2Q-vm|3+ces%}Y7XRVie zIwkNv(41S)pE098b^h2JK{spo}VG>c!-XkjNjK+&Mkw`cbYqrkwaB-9IaE zXQimAE!NaoRyJfleeY_p;wzr076Qp*&1XvtNucopQoJWe$Rt7a7Rc!Raw+%ae8)Q{+F!F^Rwf(tycDE5TaUf9blTWYc7uHSp( z2yc_V#9PYZ)>d8)I(?IycwlW*@SN#6hUjQNzn)v1xwULflP+cPLfzWNrnNCSaZ%x6 z<(KbE+W2X&xiTc|e`ll%{R{CZvQ`@(S}9=T=1?)b=~)0QS{rff|%$(k7bE39gjVtPukFF{$7h@ zPrpOJ#&l)8LbF#E5+1I6Bq@lG`4!fNKT=_{kp<7r4a`!NJK$PTr#_}kQGes#ug^Ou zJVIJlt;3|`T)&>FD`cAQ!&|osSiL|pK3{bDW#MW|9IS*l8tS>K#2dC^pTL;Qo{c`z zOkrx|y|@vo(&&0n!=&0KUuS$Fk&_qxc75EW+@>ZUHp;og7uGG36@FD&)0ioz`OX(G zGJ~=in2)h(Y*fM^%5t3oMpJR1gyw1>ZSFzSF6e>~J!jms%Bar)9n-p4+|5H?&Ev&U zz=lc8G~&#e9tJZ`CsWxVL&h=;Gf82H=@|>qXy@&`O<>oqEeCu`sU=QSV(~C6V0#2| zCaLeE8p+Y-hV0Dp&aMaiZOa?yNfdk4d$o^&E-bJ(ss_GrA$iReVEL_IVo~-Eg(!CS zq%J|Cxz+^TlGn@^%MG#A8wg+F-3K9s2X^83rZCxd8Ii@x3-N?072-9#_z`K0c zm#37|vCaroXx9-O3yQgP&#Ax)fTJ%5Wg9*$?CS3VZ;IxQhp6W8+SP#3;tGqCp2pxRdKz(-gj2bJ5PT3ybfTXYP2eLG*-pST4s^_7S{;t%Ey72 ziRG!jNm^9Ny_8BPTmnPaE*Qw`UjXW!tNeGK0lp#Mf9t)`0`H@6i=8zkjR5R6kB}cS z!A;`nr}OhMtV=O22xG!Hl!4^Wuw&FQc$zwmMNi+$9 z9gD7#Rzu0svlGGWD8Q&tArQ=z{q0%zqJ^CqRrx5m;`{v7OJf5dCh^*lQnoubP;afh zT(C;t7$|7g9oz(~TAtm^LUYUhzC0G6u(>^`xT=bAKb!ENw%T$^_mk!Oj&}{X0x3TmeX1{H2n}C3_rtx(=PNciK zge_Z=$iOuJfdRm@Sj7`3s;WetT(Vb2railfB59i*rQ5@Jig_YjqVZGv z-zyEuVucq9Ckh>fs^K=V?aQ{QHq+9ZdmwAdKQEU~Ol*@!-X8Mmk#PzfZ9UFyL+_0p zQs3qLoB%;UzQ0)fw)QZSI|hKXf|3t7>eF~mI!Zg~%5IK-iU+b?s;1=dEgh^|u2p7y zlJH7kB~-W1e5pS*+|p5B>LtWE@|YbOpv$=SA%UY6GYSBJIo-P+MzWL#eGu~Ifllz& z%@j{jU7gRAb;e=|`IQ~aGBIC%>$E+a+BWS;v!rihm$2K8l}BGeFF>yjt|ypY|6}BJ z^#!#z1f>6(MXqN9P%N;^?0k9}H}^(Tv-Ziaq|LrL!Fzncb))k2Y01I`9v#2-{&YDk zywdO;>AOolBen}wENib228_eSF9&UcHenJ``D+(6=@`l9;BYGk+IwLA5~s~+Tk`O_ zqmOTe|K@{WoPX$Hp{~BCLGTxGbDnr2WeBC(VFKrU5Zk(m=L-?w5qr5c zJlE}HRqdzZoT4DO%LGbXpfv4P4pv6~{q$F3E>dzOJlv!1mAECnYLJ;Q$`C~D*Gl6(o_M)e z9&s0Dk9~LKet(hy`jNWFQg8bK0>ge+w1#zlOPs*aQ^(au!5XE`T!0N}b+Ji#o~Y~V z4p=qE-MIV+*hv=X2x>T6Q17Zx)+bMlo$3a2L90buBV1dyupp=(gCYxu&nb>+=OD=M z0-$>Z=bx@Vf!0DP)DB<<pHs&*qbSiMg55wqno+yW?w7A?si*gTY& zK$L+jv-5D{`a1LanRWG5w7|NV_28s$nbjj9YXa%_jDV<7hdRgnoz;h64d;XOrpU z!gI}Af@8Em8Arhqi+nOS^-d&C*zGFebWTXE<&x3~kR?4c4-ln{QJ`%ef#NX_47895 zPG~z=U%=D*7e-hlX;iWIrBIUtFRCXtxb0K_P)$4MiOw^{2VfWq4ug350PG$HmEI-u=;9nt?iPa%j5bas2{_A75dnhAGUO%HtRe$N3TnI2$`?z} znW6Q7VsZDgXI#PgXeuuMydr1_b0a6{H2e>At(<%x^`Pji`M3{dbNd{+)_zqHvd@qaFy=IDXNV9I=ST*@Q1l`8;)X zWn~_IAZnlC&7OmE$2oHT!GrTj5Lm9f9QjPnGm&D2D{<)0%vKfeGJ@y9XHDDhTG+(>Wcty;F07aMPa^4k^D#$xL|EysK3Cg32YAl z%^5yOD@ltMqSNx|)5lLt31$YU<_*8+sXQb7?X@q;+Hf-RMALIxRf@Le=BF&KW>M z`JbE}Xum@!&FWq&@Osw~-K=f$)56gr*kfPVUZ{^R%h|8* z@r0?CmdjT($hU`T4&TnBX&RRn1y`gb>cRboTU*5{^GZ+Ts^qmTYmA~blGe&8 z&L{L!-XeN>T3WVmYi;gfCmwmZOpjT!3>aWQ{sRId7)y_wfm{$ODn^q#7VIYR0t7}2 z)#&1I1Lt%9z;H3=9SKN6zXk20Aibh~5df8&WkFyX3v&*-HF^08ZYiyW{dR}~d&tj} z?Qi9i#$8@RZui$;i(YSkzbFPT#?zD$%&P4oxNaiEd_ILN3n|LzqTr@G?Nc{0R0J3^ z=O&#_AHUVRQGg8Sb2q0u%({_amWQm`q&#c-z8@VFG?D+zx8;|ds=S;S88Mk~P5{3l zm-U}4F3)$N&WbBjf$KJ(uv#M9PtE@q24Vf8iO+pk#yT)@*)iMSPjAt_0C+8?-f$yu z7T_KM=Xy_&cT;e54#u%X$ zD(ECnWZ4VrJf7cYyPwL9`ab^V2kvjHm=MucZ=X8)PQd3#oMY$Ck`l|*%9U&Ny#g)S z*-HcS1Ovrz1bTbcUP@*|ZUk;eN!hycxuy)_lXvEJi0{~|wlqP@L`Ahf-X=(lyBpu1 zk2%lI7DDyM$a(iILxu8iZ@MFIG0`wivgTA<0TaSif?r8F?WqH){uyRUZns~WQ|H0< z@JL_0@iuMFhmqNl>*Q-m>t>I`;Q=!u9LWu z$aunBq@-sdtE{eOGcF!aDAJTv7~-9(IKA^HsNR&NiL@oLWwG408_ox^x(;1p!< z`S2`cG3R^{uxAdc74xLQpmfH~@0;^xY@wc+jT$h(yx{dN8-0|OWUX+$xkLo!GjmurG#v4tCT4EVcfhl{6hE5`_Xprla6?;&@s>V zwz4LA^SPpxaSB<%alG4&M&ty~<=d^+(Q~y46*jvPD;+#v74k}cxozv&!Tnv%Was4d zH}sPbBq7XdiVv&Xz7DpU02(@OxyNH7V2f=8BRq8#g{|qy5p|-B<~RL&y3Q6C8VlyS zt?k}=;~{yCLAApNfv6?FLXZei7vS%sV*mPvVOG#+B>7{k`vB_R$t{d7l%8qKPyX!l z75RW>dCcb3O03)#ITh)n^M5dBonc<#&N}n!vZJ8imD47WG0mi}{qKX_Iz|k0?#$pTga2JEh4sQHuK)CbI1^pxoUGM~Sm-8LuQ zh1>tCxVKDT z&k)~(~G$$`1{mX?yZdI0ad{)PpK)pvFWQfp16c$?80Jo;t6L=FLUG z`@Fh0JsB}5`Q28np)j|DwzHM8J$l*DH|)}78a-7-+)`2urMy+~VW$%Fvi!LgtO*T( z15`6^B#$N^o)-f-x3$Yj_)S~85A+`%#})P@_qNUNml*Q!ub9L>3k3~fydWuvGjW4W zlF5@IySq!IMbL@i!Od_EWOJ^{G2CKnpjO6Ke`WxCl{pHfDa)h`mhY(2C{Xwig~rY( z<~E%6LZdV7&5Gcl*PGSgH(NnK`d5D{3G273`iuAeRYKr7o+ z2tu_y&jCd5p+xORl0+YVk~s`<*?C1qF|--ydQ0qR=Sdy}lIJC9FD3Agh;s<0<1K}s zwTh?m`$fU*0H)GEYOWrwI2zTu@fEzh(}G=ZL_bGPkxxsfh6aZx)+GDu8v2Q0A}aXc zTeo4*5H^T;Fz~^ToBZl!qU=`+I{0=!qtkgqT}_>aoAOYxMpAmHQM%$TXK{0lXQTqr z+8}J*U8l8g>N*^nx{>(ASH4*ZglFsK$=b>mEe!~fri)+l4{Wy!fe^Y5?G0$)%qGah zU+-)0j*63Qi%dKyC(>IC=~eQ;@GP8=DP%NWPzC2tEV-?S{v;|Usg93O25Zl^f#rCwJ=>#`!c@B-2e<)S6XS!`NmdjK6(g3#6N5(^<)ahzh7JGPw+Njl;CqKt@_pGr$~!3PN}1oD3Z! zoErl?fu9Um@Y8y&IQvc9H?yLa{}g;>JLfC_O-+|B71m2cZ$y=S>08Ig;{G#`ISs znvs3r$l@+R|G?y+XD%bjp|Ty_LS< z)4>&W_0KT9Z8uxJa=80@j%s{=x408l&S=q2-IV*Om0w)Q|@4Q|>e{X z06ZNTWl(6qD9Ui^on|DQ65$Z(ne<43hkTRi*v~WCW_~!{tCwr*0Z)`0x+$9GXhVu5 zUxOLM@OqvJr?R@R(9qh74LMa+&;Fl!wX?H4woGLznZ)MJVC{w_bM%sY=4jGqG}y$S-w}khl=jLx zadCTcVBDZSc$aCHx7KuP_*(ZNZaDK1Q1E8|6<+>=_n0G(@_6rfqU588-q!YP2rw!{ z5YkV^24UWT*?>F>cL#|8tCG53b%LTX#Y3LDRRlF)r`hR(E_8~)aC{dwt{g=nTs}3E zMx=d>I*rV1h?Xtc6BMo&#h;X^1HjvZJ+$j*Mm;gi>hJkZD!v4ZD385DqDMszpEZ*9 z)}pd`PQT#1uX0Cm#NM`Z@%~9&+C}m2h-WF+!EE+rCn7^tuHQ`e(GM)xX)epWxN)8q;U0NJy z{@pEr^UJ}eLY%7^_K9KtK~NPox7V@p6^lv5{0Rre;}AOx^X}&$0>Mq%d9ProhtdSz zU|Mzh(rZa38yaZyF7)R0wNl6+18!ocA#}oh+Q_|0(}g(8q9#2P*JE|d&c9ixcbAoJR6?)s~LJYtC z1e)4YHW3A(91e$5r%B$(Q3B&77ujwZJ!XQE+t-?$~$g6j9EsA1DuNk zg8-^rb3@?C>l>o;GGI2V^t%^=k_nRipTog1_82W=5rf8f61!|6dDN+d`oZqsr2$H?8r{y?_e22Dk1&9Vc$ap~HnmY^Z*^@sz-4{79@hYVMJ;P6L# z^Q8SPq3S$XdWJy`Bp8*4)vV$A>FJ?!9lEPN(#Cu7nsv2UQ#^AN;Jo}QO3$zxqB@Hr zb};5TwK8KSLn&!5@mXIUb0CN)aJt@N-Nik%(e$y&g>JcOH(nH!Is-=7U^XASHkzid zWZr2q;2!1gK)NW0ZwDb9Kyx`XOeIkI5&U0WhO8aOSMZ{+P#SD z=1{x0+8UCc&i06_*=@b3{PmBP-9aM|!VzRVmR8>bgag2mB{Y2`MD9W~egFNSLU5pI z0$j+1c^;fGZOq7b+h}@d0)$zL{H+S-4SgC1P<9SNNNHQtuh&y{s=#qf7>~ob z1=CTW*%p@L>#|OgAty;px-hxl-hCVQ?H!iLMw#xbpw#d{J#Kaf4)^`Ne#0Ub*7eFE zjlq+2L`3C&obCcEP3+_Wl!!tN@R!shk3lw66{KhaTegFk+*3c{_%K(NBCbuZ+xgbJHOMFD_?8Suerm7S+x>k4C|f-pK(R@dTb z5j&j-f(mO2x$(`%1U`c@A|dAg0en=(PD41=tvyV@gz!Hk68MwqIjNC{Ja%W?I9RuV z-Vqc+pUPs|JZ@|^2que_-*SbTY9@dz3LCr7qk zy|PWyK(3EfSTmY_Jk}G_e0blXp$)ND2ESe!0Y;cfZqrHPcfP%Y>Et9WAYuY zTDxvlAVQ4>$*sci&cD?(Mln^r)5?l3^izK5A#wfsA<^|1awDm1bQh3wcS*_ehug0S zs;b)FjJM;%nyp5BQ=Dw<|2TZ8OwIEj9T^d?4i9Q9ic38P{i9O0CdX?{s^oyMd}0)g zP`*EbzTK!8C7s))BnFcoB?{Uwm0p#e{7ORVw9b(Fe<5PFnla>5T2_=QJ9C?q#Np&2 zV!^<~7#|Z=@K{o}Zq7H@O4zXL#qh{2+Pn|~AGzDl=KgO=^1QN=uCkJO!7LuJqj4l9 zBmT{2`v-5lkMlq)v36@2*4`2@7i4?H=%Xlb$CUzzcCd69Qd zg#pYMFtB-|K{NDp#@5z}w6uvK1&9hU=KHVaQ{}l)C(=}zOy;Wp6Y4Xm{ijA~k!GDH z0J=Z`!#vM?o_`CamoCaJTU1(9=cJ_rQY*CbAd@6bIUquIoHgifsgoPAdgP{qC>WwE z1hyYYmHBCA5f;^Eb!STtD2hNFltelS-^41MFW%KeogNYLH&f&4LS}E4^~=)dyKCF-m-9Iu+EuR{Q~I=P>ne z3_x=m-qzvwgdtLaa#@2-0eNLz#W&Y01c5C1GcR`?6;L{5Rh@sw-E|e^f2NlPOqmi; zdUt134PIS?ql%21`25ET$TyyT|8PLjRBNq in4!?pfX+X9O2ruc7;Jm}xO2`XTC zngCUKATr0tvv1O5*ewjL@DILK1S77ET7Z$X%XvA6B2!=y>hFk%hp+G(2QQmc+viAwv8nYCJrQSP6YdT5#I^7 z@J9ORhGg56*;Q4U8B_P)uc>EQj9Tq;CBaY?;JKG*#xsFCmDiPpH)2YRhG(^#>gjTfvJNk7qre{aMy6LRf_A z`Uj2=^dA|p)M|?PRaqVbb8ACtN3GNF#lXLGpU6#!Pk8LL(9^=WPZO@Jn3#Rfb$X#4 z%=K`}M1&79FHf7t+5TviK$m7O$MxpI73K4*P|;iqk}g!u|M^|GFs@3~gqLS0l%sn~ zgyGn5a~IlnFINDm7!2}YpBwAdF)=aARl2X|mzHJ~6_G{ueL%JiRSbCX2c7;#i^zDvo6*TS$9TZr4mJW$wd3XEn6mOniW8d%nHF6e^Hzwfz9!*`0l%n=ahp+ zM__k{3@e1#8h?`tzPxv4ca7}5vf(On=X%{j4=Ywx?SHOe&Ly~}r}rDHt!r)l*m34e zt32H=$9{RzTK(m~K!m0SuvP%})d}%jeaib4dwbqDSO3k1(FAj5Tsty-n+7?^^2pX9_+(X!_Hl;(uKJrTxC z=}p(8i)B(M!Y|N=#*2b^Txfl~o=rJ6)208G{Z^m(yX)rF zuIj2!VgGKtt1n~=^>B&cO5G-2yf`~?QPf@-NMCty+5bH0=BjV+{BJ3EcJMDwOnWt9 zVCB5%W6qs#tEv`xm(Cuj@Eg1(2{*mLUU#o&20TWd!;K>$)|G3E-PC@yy)3r5&%aBd zRxDN+4k`WD+eH^CKxwb$8p)_+5$h#zdG2c^R>~2Yv|FvmACt>zUv;1p#AT`D@p&Op z&^PP7x-U~<0NpNOBm+`CBiSsQFHF>uv5#4Jj~fuswpK5kVP-hUuT1d@yRNDe`5i2I zE9Pv(C}<;l6L`+d(rwOFvaAghAO%Su0TP1-2?{fElD2VJTLiigz8?Mq?&=aeGTqz> z)i1ubkli=mns{pQ;_B!GA|d*Xf$3E(Eq;4Ha2|rjj~F*SNJVY}{xa5GNf0i*4B_@= z8Bx%T5HjS9usv0kOZQeMQXz#cJtM#b1~Jw~xf<;W3Q|4I^uu^0n0FTwfO#+;am2a! zamKMlzy`G+22%4EUwk57-cP^?pl}S+!hme6uZO`t9a0b~O$m$~-eVamvxh)+%Vt=& zj4Y-0_I`Qo+vA-V;u1BQ4w=_?Slwe9N&{l7(P(6>^A1gM=JBMk^_#XcdR)_I*Ki4h z%mNph6sdK)x2-%bIi;b22GY$qaCSNFH@#oCV*a+DmkNUf{9 z|IKE$lvc{LvPeWynyRmRD4eeA`(NbzfbDDN%X{wIU=_ts0ORlTUYL97>?cR@3Cq&?S#{hM;tE2nm%tmzo@4Kdd;(?bOf1jeQ!qwf=w~laaOm&yoW7=bZC!!Y9{Ek=ONCy>$&Alfp+Ozv-KQEN>d!yYjK&_cQ-V4q4HmnYhMoBmRmjiK~x=SGi+=AHl zJ6_nc`%6#+975}{ZfY|4ZQJZNwP}Y5e4ZL@nnWvRvHF4+#?)+K$w=b+xif60Pyu$M z^E>PzKv(QBSH}^Gh+}`@9eE6^1z6fCBp}M}Fc{LeV3(H`Hc4j%I#&<9NOB10uE&*pQIfYG=nb5jrCo=v9hnl~q9F>^Q=nJUMy2 z+rSb@FG%pcg@Y}=xFGzNJY*zIE-|R2VWN6Ok%ONmyK-5U>-wd!jhXBCt=hqkE>h;? zs3|!GjOk?E3hKOu`n-7ktX{32Qfp6ghAi21Uxz(dC(8(bOHhk#W`U=&8z%kwVD2j? zoEm8Q_@j^h`+sCDsq^2<+Bx9;uQ;=-b3!kKS)@RL+CLg}?%INu5l(D`Z+tja5nW{S;tu+Ci;bET;k!Xdj#Mf2Z*RhVjE9~G$5Eo3~ zw@XJGw{&NH5WMPHp51_3`PS6}i`!Pv zJ-F2hW%7}Q;k6@lMAqKN_GUq1et7LjfEHs6V?D%q$NQkiXBP&BD4sH&h(ji;Rz7z@ z_f}?q0z-Hr?d%)*X;*{eaDEjn#`}na-~< zOORj6Dq?$tG4s{RDWbiZ*YJk0?*Vc3nh9~nSMX3^5IT?paq*S0x*FS`;)dlj_}NOJ zC4z|7g^TqIwR~`R3ml(rgFzagR-x<52=1X3Z``CRhdSv-{L75oV%%5p?r^%N$$&j& z$LoIr?oc~%a;mDcITDd|ER-W%unq8Jq9t16}*y6M%};Zro@p%*W5TkftAVzBWPA(@4RnSsAw@t36HYebMvO zt^@wb?M}<_u~NUl)U%_WuhRejr?_rV%y!JCzU>(*IFq{Ku;pM?*0fUIC|h+enFo|U z>D#m^mK3d3OU}x*UO^@vx87!D{Ul|D*2yRrkbS17r|^JZ=d8YfdsyNXIR{s<96kA8 zK+}<@iX6J+oQyHW@M!*p`d|ffVcSMWy}&vvND_0a}<2X?~hdTLmHQx(9_Q9#oV#24Z_P-S!d-b3~7uDXB0g z$7s(tw`j9kREOEMbA!I!VAvO8$3=scA)OX&?OX7+x|US^$MarrfE%t;I(2qn^Vx~x zM_iF5%KX=_MyEz!eLX+;%DR-rkxRE^rj~VemZw`%E$O;Q;MMdaNNR-Yu~TRZGt~5n z!vk&#@O_HU70=IoNEHfSe2Pk^FtH&5hU{Ze#pSq;Ekp z^Gty9y_6kM{gKa?0Hb&Kr45QO*16Nw$vy2?AnwNym_F~$M&r(N4K+n(7O1^kf7I0R z_wUPFPBobyiBUV$p$k4=^hAb6T6?`brsx=yFFNo^TH0A^7vJsyn~(#|m+}VD0$U_6 zSKqc;?To;wzK9KAiOmh9!C$o?Xm@dApKeL-g)E%0f_qJL2A%12a_>}~J9&T8>!g3r z%lvyN{!DI?Yy#M&tL2SO3R9S+C~AhIMkpgbex`wA1~H_I`$KN%ig z3<``HBMLVn89T|GGk8`Sc2

w;rHvV1c(cFlquk5*RfnXA;0Dt1-%%_RBqT|MX4d z5ZoWk;v1lJug)sCfROSXP957Lw^3B~W^@No8OFPcgBsob=(p;-2UarxAZ=Yv*D$Ih zScMAqJ19iqX@i7IzS=18;5q&E1thuPE7=Fhl!?zvXD#CAT6Ec}n5OKQxa`Q-x%#5C zeLZ2!$k1lKVnxW$gz7QT$cNP8Gw%v{jH_iPqP7xLv}?w$;i^UJ(}p)zVo~h+Y`AhG zxioD+a=?`)r!8PAw9Z8mVgZQsRrF`b0GPl2mh|sJNhlVCGUl z5lvI@2JIc43zQyJp4H@N3vv?cn-Anp+S+R*oUmcR{KFF8rx)7dHyyA$U?~jC7AwpE zelUu~F(Jf%*JrZVX3d>Q5E4O5L=tCYgXUB3#!XB~B0e?wXeA&Z5Y^U{&gkNU&-ZTR zW)vmS$(Peg9VQys`z6p(}sdKa}882AP?D zQYm@mR%tqsa?6rnjjD+xn^YQnQWr#>D`ZhkrRk+j(NZvT=CXFNiT2XWi^t67*JdHT zsGqOwPOBI$3fKa_W;vYHbWgHHuk~$$5!;l3fqrdS$_-K0v3SxwUcJ|1@xn`lEqv$s z!Nk`^So-r045<$JxBmHz?K_Ozd*fP9of5g`Q(rR_bU=z>oeqrxYmNK#9&f8no)(1A zNn3fV6=Y_zRtLXakY3cczAKdO=QeuEBmMrJT2|9|C`R+zO=>`yx^*Z(=RgkYu+r3Xr5BU$RZ{)D?s5iWVm#67g0~^+qy14iLD_zA5awDd=>&pGTi&Nz( z753`{5%{J@TJ4?g1#+*Pkz*ankdO`zxU7%KL=}AznMn*2{zntf`kR+DGxCcc!z-6i zMd!Z(uX?@no9aZ%&8(`Iv@44y_V*_iPi3q$_kZ3{oK>E&kgMu!h;$_OKbPhP#(Z8^9U6nK2AW}?N9Vo$ zfU9Tka3)zxf1=N5FT&JuYa`|>_9lPNFu`A7;mHG^?3uGkChU3^{>q@)bJ<6Fk6e1T zt_z&(`uduh%7C`1ami&^QL?dljh=#jH5uZwD@?!tZ}olEj}HER_2Hb>s4qTb!88^u za24Hch{Oboe`w!S8zD_gBusriLeQa^nV}AF8Cq#(cJr8lJ!FArz%bD{Xd$FYfXP9PkYUm zsNYbENgBTwtNU2qKah?M0Q4PS>9O2IVI!oM?U|NCAzuMSZLK> zYa)DKI#4kSpt9Qn(GuY}$XFP@YDGzJ`|A1gHV{X%jsOF8c=|N7Lu_x4$8B&DLIH-+ zw2l5$01WdyL`K?L)7ufA7wukLk)K|h&J>Pwi+r-ysH_GQBuk-wRCRue5NXV0g8Cb`41TOwg6_DJJs3ZHd&ce+B_+4${h)a1(mlDw1+BGP9hCqHqCS9E z-bd`kcqgl-6GD~Q!-JXLaV$5fgB=KCHy{r!JwZM!K(HSfo{~gPMasOB%=tsl2lS%K zEO(SI(dK?R1SxleYpzikjfn##&8RAp(1VgC>+7fr^FPv!-pt>4*I(>;s(g}!3!LKzRM=OQRKuJ>~8{V8TrM!&R8pRfd>T~x*#o*tNAqxT)BPzHsHd4eDSR!qqp zar*q}m`->*^*VI*0t$eltke*wtqiN`Gx=xXgsH5wmrPpgNVFfJm# zyQ!tw^R>Z0B*YXx8a5&z)d!I|+qdC4x9nh{xW=;HVVbP?dd`ISsUCQibtXU;A1am_oul00MV8*rYEc@r~r8_mW zx>wVyMoeQ!(9s>s-svvrj*kA*<$K$iQgij!C3Q8I4`tS*zW<8n`&<94{C!kkBv*7T zKXh=@;G^pDUyYXW!tpr8+~Az9iA}wl0l5@!ICSRR2N%v|og4f4*qKAk7vE2Pf5RW< z%(D^Nqp>A_fQwyq#1`xXnuDIemKnm@!}ZJ|rLp2vRvpCLO)pCjd@gvWL9 zKX*!8q)W2zXJN;jIvG9n-Md`9&}*8bgr=nJ8zZ0mvGhd}k*ARy(X9cw`OFfuOc-Op zCJw@s>8}}SO-24VW@X*-mj7ve*sJn*-p$9Gv-(&c>@N(fS~x%JLc+8w4z>0{5JQ52 z^ZbZdqs~Apav(3oQ`SadFOdRd&nW+K!z-hE1J#Ssl~2_Wxu-tV%rGZbX)uJugaELBT^?f$+T zMbx*Q1#X=G%q-~qHcF9r-x`ZK{)*VZh*jzOpdy{Cj-YeM?R0^U7cI4GRq~|1>80 z!qj~-a+l;Es>RrZ@7eIn`*t3;F0hEzIHglT0;WG-(LT^o6rUTU5{LwBtuilJNI{Ai z0!Wa79l-=c;Oyhd1yJX;OxZR5dgiaa420NFG(G%fPyaC|9^7&ZxN22nCC}P z=MDE3umCwHL)tr~JAmzAhE6vI@!{z0H8qa&tIN{BSZCtNi&<2brrJ`Q|DI1gRBZ~z z`{my8eyLWoA*yuQvciSs>u0_$O?fXE8emT;oqMkKQ2YOG-e-(9$i4DAbD%9^P`xAy z7Me?IJS!btqQtZ}UM;9qw!E~wJu3ADwZ2=wbRIJ2&5y3O%M^sQ9N^hEZcN<}XQyUm zV^!75FY`Oc7vpO9tJeQfRPn;+CT(I+s-KP5l`*!>=(p)GbS zZ!}gz&=R6Y5+C=nN~?*H?IrRX#L7gyMxQt*l#^HpO}c$C{To0atr}pT8}W~1jr{UtBpEH6 zC@zk+nAR1|kx2~`z3l!f<=oX7<&m$?9jM6BqvuFAr1uzQWaSW%@4tUxXt@10LcdE6 z2jI3T1XwBz<4IBl`uhO|{uThu0b4WX{L&N|r1N&AuagY=!Fn03t3MFE+!tnGm|Z)l zEegog`|IV9u}QvI=Fh^ibNYq@t4Qh3KhGD>^mgu(?_cDjJuLHuPp$6AN?2JNfKb4C zh*;i2N@bsvk1{ZZIx89pVI^uID8wSWd!8_HycA(crv#EtnScZw-x8In6p>+{&ZH+r8wLEq%VcJ%Jz4)uX`r*%roH&=gGI; zt#>CImZ>i5%y|~T7|=)P#5zYQ95NpHg3aVGbU-M?hXX6;z9X(YR!UE^Co!tznWv-f zn>+XYbFxIm!G+NlOLWvwjdCydnqV)E`7rz%hI_HunvF{W430o$Bd%Ps6jXdaBG`5ofXs3cX=a%*El%2>aeWq@T!;lphoA(6@%!)DLEr)7m8n)PbNsrLDFs zod0$F#z%Ig$O2^z4UcS!lcp?8-6#v>!jl&+Qq|@U@0r;_<^35g22(TGisbb&Y3Lv=oeZV*>ys4}qF&$hZOsW_ zG^I`&DwfB`OUsm<1h@nmgd0ApL1s6kTk$% zqowhI!<&4@aDrhNPOwLwQ)$S6RA;aUiyf6DGqLG)U$ z3f6hm>2=oH6;Oi>aNU4q%{IE$cw(apM~9ez$2 zal&;%hx{JPdgL9^-Nlx5M>{!dLe0Lh`%82BNMKq{)OKv_u6ay|0FBszM?Uq@(Y(VU z%!3^NGT{JFO62uF0WcXtJa9GWokw$&uB=KO#1ZEPtm7GpO(ff zv`T#8W*8^~slzc%SFtO8MMGRvb8>~f8i2>az8ye`#>`e4z`bc*MzeH`MEP>3>$7z*;giZNNj;OkF}zY}iroVQ z;9EMXAWuejTihI>sx4R+?ht5h%VB z2nc0RC6%fsKa`DBqQI*sG=~lx!muF}yXgdILqNm{22vRl*8C_Es<$5?{1Ew2c6{s$ zp=LhB!rqXFu3C2~w{vG_?!x2cojW?`%W$|=ePs>-IOJAkDyz-r@jO|WzjqYkMTO>` z6(HOkoeN)!%;4Uc3j`c!AAdlfdvm@^{PN3AJlMbf$xsj{W(S7kl^Y(tBdLFq5DD{K z$~W9uQK1dQ3uy-!izqT2#$SqM@beLEoORv9UCYTtPy^wzi`|9~=xmA#-3K{{$}Y<{HhYre;IUXpL=Z02oO+E+BJ|$R~G%ABmm( z$2ts^6kc>DV3T~d%<3Z(!)yMBFHsl!oPrfqA+g$I6XE-Q_L?c|&P z>ZXC_<=!96av^YY5V)l^(1Y^Q4R1mhtXc{LqP>HIpFU266N2dH9;41*+W;}s(nwT{ zFK6anJf$Yz@h+uWN6FYM1I(GQ`oKGnAC>>uRFp|Y}_ zJH)}kTIr2t%VxinJs%xuUk2nQre2TZ@$J`>wvChikR{Ahe#osp;$R2&m2~z;!iQ(& zo7ehi{$XD?C=LwxOg#3G0?cfMHbTwa7O?HUgqZsx??UUqbr*iHS ztm@g6sk)C)T_W}-Z3}sHx{)Q!sqpIGh1kbVg!nr9m;>)1{$1No2PwRy6BONJsh0j2 zPNEUJj)gXQ4?ZU=~thQF8!1Nf&oFeX6~?qY`R8uwbW=23Vfa$1`P^ail%_8DHtOEQQvG6*0N0QIQ_<|S2D9L-pw zDR^xLq(h7uj^Sfwgpso8`#C6m}?5ym1Pv+AUK|Q~Q z-x=nwh9ivu%vM*=tgp<;StN_X7#le%n6*ME&EZyogRQ&snGYD>O`{}HIj1D$OyP=% zO8pG8`Zn)Ln9yeb`kP)BkWm>k41Jujm9DTuhjA>P$#IYe6$BLM$wd$aF5zz(Mx{-g zgGy(!`BI&PhLmNHWQL41pOjV*x0K^iNmQ!{3sjiFU(zxrx*IJDa!g?|m*{@dC!J{T zGhi#LGvFKyoFm>8JGT;uLB!Th@y)sKL2?-^|JzFcG$)=dS&=YDZjsA$4NdZlId^2# z-*Q;KYGf3to*Th~|ubZ1-CG(miDye5SKAHy7IgIflHW1Xmtl(JVgB zXAv%nH%dxGV5lHVVqRCghBp{a)U=1o$l79gU)v|8l0x?R(JNf;1a z{n|ciOC5fC@e-+=tvf%GhK!g`5G+#f9@*wK8?6M_6it~Jvl&&9sKJNYh)&*mx<_vb z3%S?#+q35Pxm?jgpgUhw$1angyG51?9wu|nl2!89>;Xhfl@pmnlOM?9>9Wu+9h$HU zEJHdmjWLB01{lJj!v%&K>ck;TrGq8$sx$D+LRZS1tqf%N5i~Nq_}{eG#EZ+9&*pj& zgFrAYv=tl}Rdnr8aY*Qo;&apd_PcsqaT>1dj>(ZD9&Ni=RMeXE!kZrv7v6n50SItM znLaY4uTfN_`XTbk=jp7=;OP4G>q$(mUyr4Ds$06^1@Yaf_1u)%EH3g?Re2VP%v4Kr zoOi-V#Wgn*X`8eW7*>_GW(^3Oa8Q?+pgWY1a7dSssN1nqX3lm#U0`@S zYi0(u6fMRFeK1e?Q4Blc^hhD97px$^6<#cG7AC}2JgvL3oq`mocq!)bXbm%HQNvX} zKs-9Etl&OL4FLRGcj=tvX{$lh2=%OsOqO*)ytD zw2?lWZ~Ew_PuA)1N_-f0J*(=hDfYqdU~gNSSX&E#5Gjy|#8$zIp^ZXd2Y;>JQ>iXPIkgG7|k_NXU<# z$LS5$2>pHXT5WhNQFkyQ@t`6xL2*c|hjhSOaiuHP7_o=NHV1N)zJkq@XuL|rb9;0T zJ*2DnTybBSdJ8_fKCseMRf%7=w$9EhPhOxgBaj1bq#id2tES7m;y?SS><8fc$cih#&_ z#qq!PUSGOP8bsrBYG`Ts;NX{am`JQIT2Olm9F_S`67k03JHsW#D+2V#Qb!ihkWn&p zbL-;~Gr&?e6O-P3f4N)3Iv+0}U|JA|-duWy0pS9w7!hLIh@KR@Ic#uHtgBa$)1>5f zkYejr@k$ASvNsvho&+b>j+>T5JmYUHd?t7fUY6V3d{;+LhJv?j`@sF7v6WD*>0B-W zrbtGtf|D)LQQ0Ip&C8}qA_*;61=!Y8EIla=i)9bs4s>(4*2e_p)|<6rdyWmeb#+8bYFE& zQHB2uZP|C4bKXZrzL7NzUfo@cBT5k;jlbP?A30`kj6{3Mk}ye+N7Gu z%+1{%-{A;6GGSBJ=J?3CV;N`%X!o#!C}@=YGyV@1uli&B-&$3c3fQx@+n@$=LX7%b zvEt!GeWLku&+adbdudDo0V2o7(&*BZ#D^=yZ`CoWwFd|wlCa#&V9JC*bSyQMlE|1D zMuNG6pdhu73-mU}s)Lhx&3}Qy&)m@{-3lNtw$lYxwcH{EB!8YFp z+ZqEHHh4A}P{9CqY?NWTss#z9yDL>XnDDvhNJ7F9&*uqH*Lru~{OMrO&e2`1YUyL z+N$=jOCaNJsbcK;yye;egt(tLMRm0}ILMVe|J?Iny)&WRkM#6B+8HJZg>)T9(5>{S-3GhF4=260@d}A^wZ=^h$zt#y8ASn4u)`XgbUxiJ|1vVmq^C}an>PoG!Gng>J7#6UK<66bC}z}-p#OB9`97RJjqsY( zL9x5L@Yk%JcttZTP`579^;QoG&k=?SgS~F zH~B|~xNe?Mx%{Kxj^(XZV6|8+z?uCmIjskn5B6y=xXLb$ss+!#Q`kenmj)tWW8XfMnwWOM_TM z9aXB*P%UkL1Ztqurq|R=Sq5W@laeGnXqjq4!)WZ&FJ4}k7_IbLa=O*(?i`C(dE-9i zkA7(aC#Ch>E>~$;1ZLY39TP;-DCET|{FKv$ZgDKEQAu==YN`be=!@* zy(rnB8>*i-cU8&WTL0Ln29an*t%Qi__sXo(a&}S7<`q4urwkw_nXU&4~!D@*L;KXTTP56yATP~;7-iOe5R)tFcbnkD0T19rtf-9;fvpwQ~Z$}Q5NgAiv& zq>1L$6`tKaB39B}KgbB*n65A1B#1Y^?Am&qT(k5Ux%`=$9V83kDR6*_lW18LR_GlJ zC}Vij`>WtW&VlRk&!?9gz#X;G>$qf<#P#3m{RFyhnDTR;Y&sLQy)`P-xw>2Aq@uD6 z@FIb8s7M9Zne=5xu%7}p3}=ZZ#m)XslbAKFd>hmMs@}8?s){y93vIB*uLzx+*CHac z&Hhr~*_>99S}qS>JNsX~_QI%V>Kj?i#FA|a#kuKb!$Gnl?2HK1@GP1}++2r)B^Z%l zh~dlyz9_}wHN8HT!BESIh|=!LhA6q!z6fW;K#s6!c@CWs9#6EkYwdV%Werlj{ zvahfATyHi+lt_I*+x+fsYpl9&_3A^1RCq5bdtrU~rj6i%s;P^K7q5%&nyaSPb6KYk zD~C)|CBw?$>zv0^QZlL>9f}#!I-b3Q*AuT_OqjajL?%!jShEX?6r;_Eu+nbiHgZh( z7*!Bw%lN0DIPAQ-xS;YWA&6%$ny_v}U};pq2`^$#8$CyZm;ZB@O0QQyKr}Z&L!e4I z-Fl7S^4KJN_%M?cs~+YEoTS>vuNJ`$^JiVgiBofV2qc&vR45a|gF0{ZJWtx!KFz#l zD_teA1SkhX+-_bTmm8yj{#}IIw(L}Mj|?GqX`W+FxE#D!z=k~En8(p-)H7xoxKdg* z&*)UBr>mP9!sKAR3O0DGDKDN@p`D450q)zXu69$g74Ouw8nDMNX0bz0JQcArdyj9?D<+I9roakxCENzp%q9wi6(iBG;%!Te{X4J`W+0YPI`Y62nisx zx-8lXd#bzK!I_z99gle1affWOG0JJ%HWMH|h+Bh6gFpedBVoseb4k0owK0PnJ#$p5M2#;TsCFm}&GIs$m zQ>LAiZ7;oo6i^*zi5T)MIf)T^^U~+h$@7L0M1SYbGu?XhjdgI{8;{;H^{Qf@U*+02 z4$qkS0*KN$;AbaTETtT46KA!PXmWa~Xz3UG2gHGu;>shkLqYZHlgp+jMA2MzV?`<< z5)b1j1uH`w8oQTzEEkgS>&Dlxyt?P<`iSJd$dw@>OjfC4;}5y_70dlV?V7Dmww@_n z9I#wDG5bvG?u<;_L=cblS-_F|Eh!c;^ca+5sZU@8q6A%x%jeDtkZ?!8gjoI_ZLwFH zj+2pbUq?oMogNvP{!OGTI4iRl2mlJ0z`u||<|3S=O1jh3^2+rqnq=$f+xmxET=ZqEC`D%zED|Pgh0=g2ev&$$jx{5`qA0 z^-WTaqS;wIs{GN1^Oih*!7IlugJU%qADb;rQrN4w-G#70bcdItTgP! zX{2Mui$qvtRw&49pQsBucZ&p>pIee@e_3CVI9FDE$!t#f{MlHBqF!*V${vT31yuybt5 z!wZYpIp?`>@xy>fF)pk_rd6vdgF&atQ$F2M4x#YOKKf|?^+wWiEDASz1F$_z8-rdL zJ20U*=mUr9$OC$MxR!C?rYGC@=+k{*_BxgJ;8D6?ismc1v9DRu|I8(=@x6TWl0@=7 zNYtgazF@WI&$4*NkqC_Bw#fuOvV+QKg^#NLWj>6=w6~2 zs`9MdD~FS45|KUzB1h=3!vDSt%T%&|X26?-FDs+uMd70!{zXcyL6=D zC1gb;LI@n1VzEp}uM`NuVQ7%7yM+G!Kz9+=2Po8^petD{El|NxvX1817MqcnEJUQy z%lWv7>(kTg@qjX-MDZzFjd`$`Al$vbtn3v`E5GKag2pR%*40Mr(&I*YH{Kx{1aeCL zABh`3WT6^3{G9#JD_!U9-&4~${Glbqv)i)z>QNr9AkvJi%+mEe{17o1;osOA5Dimu1 z2_wHF4|`nv42Wk2kJYT7meqb8Q*Qon42a&R4hE=gr8F>0^J@!D2Q`hDzL=mP)hQrO zwHv~yPT(w7t}GyyiS_O(oX8;LNs-+=CrOHfsU?mz#)Vc|^-22Q`xAv_yuUJo=Jw@0 z68ds#lL7DYG5H=-C?4~ueCBO8n^W`O81}qbQL)-fTytRm{HO;V6S}&nt*vNvVuAO^ zpb#4ZH*5j4AAEap86rpcW_?{os;2a2R-eAIY%~DJYtH`mTUF51=h6J#Z$~veWCcn9 zowH;>sfRJCefz(GRQH@?0|>=|Gy<;oy-!5(U3yHW#HlaEFL@eEf7XrMnD+gWfNI?b z${yhQ`To)AK3AW(@0+NlB5e5RRkuXqzIt{#OyzddOKPRr5ky`u(gBsydq{&{6C%p3 zVF8w44tbtLDZvmIf=P;`iBgeTU=wV)cU52AHw*;7IRj)giLU*UqWWqM6 zvvrwDUf68K3{Z?;PQ5GsnK`w=FP4|y^1KsFV`i&L3RLg(bEo#>t!d$g32SDnnHk2; zjW|1N3PK(dAfr|9NH}TNjT=EmWdzkJ4I29ABoHUt4PkUA@QhMpOG`|#sZiZK)NRwC z*wC*mNE$kL#SSX^!k78;DQVGEIIT``WxmZnF;ne5J3lcn-2mtDZ)fm^FdDp-?cc4m zroL$LNmgfN877&Y24}YaH?u+mG`)ly^eV08>;E0NW9HqG+rRpgu?BSaJ>5q#{$I5p zi@PWNhUKnJh{0fJadSFqSyS5kQS&&|uF_OZ^}ruOdYNgVrq%m=RsvJ#fD>gHu9>sWrzL}fVs*8T3{qZ+r>(i( z$!8GX)_k|V$Gato_U0soKLpi4ej&^GCM+Nz?3d)oFG;ya9uoiB$S<@0oT!&A{(IJw z9S>)Ous+rpBKJHibN0YrUb-haMJoQa=`2aj`xAorI=D0NFuU>P;yqEJs(^WoFK?8; z6xcZTTp)VP%cN%#Bm%!A>o%H_zYo&E|>8fh0e)%&dPa14UHH2A``UO$YFnf~o4uxQz|eUNa0 zLA;ow=`ffv3OL=3O9MRwnhvLX(B0{mz>pKm&zCAv^fj6>O00dXhA#VSF9>wKnxD(a z)0bK--Il4{a?86@mTvp8lg-i5%_kEFwcq~#kC$5(Tkk*DyECv**rrMvp9H+^*Qagc zXD6noUvAZ(@ErVDOa7fwrC;s+D`f@i=IAIztEB$i-g+#85URd(^r}lDaa}#@ z3Ip14<<&#I9maE3@U5H@ZTiubdk|94Ko^by}r4{i=3YD#KFO>Z&B*L-9?ew!`bCU1tFc z1p=4==X@Z}X1?InOlnL{mEolfR8G$J<5Wv2s)Z7QOzF>l{#cPTD(Pip8moa%Jq6ML zjzo_>?#j3cbPy`q?@xbBFJ+*yW`h!{94Uwp;0*`RGJM`yj4?Sj^nwF z#;aF6sB~0}(H?J*!Fs}$_!9@bSGZGq#B4FP_0dNKfJ@JwJv0kEL)Jk#7%OFEtDsdT zV8GDA^|>BQVGg?}7a;!8;B9b0zg6&Zt(1Lw8wFTyw`DC{yDtWKolwtsUp%17W8kcj za#L;iH+vxK>)pf%O1XTX$-ZWrEryP%DQs1@^Zxen+m3zJ0com90HbZt${^-NjcPl3 z5jNFn5Z@FTa_Wl$&u{Q7HLCPgiAO}9*DiQ1A#y>L1}er51o~6R?BR^2RMl^n{Nmu? zcIusX9^M_vzVT1S4ECdiZ{6GV>6v7lrQDS9ngu{-O*e9&e@CTuWx>46)K;=Su3WAw z&jJc5-e9Gy2A<+IL^-LE<5KB(WU3%F=ax~x0&T=O6T1tjGEM9tawwn0D_6>xGZlI4w$S`&@e>HZVMFt3n zvDBHzH9_kY!gckWMOJ7Sza*Azu>SO?Z9?~;DgC>(9Io>n94pz zawG?6F3a|Bj1;>7Q|q4!>YpAM#@Iw;9t~M z(u&v2kFm)cKgaau#Z0~7Nqu(9C%A6Wh99G%cL00F1>Dy@j6q3{8`L{m&r{3RSb(o&Hi?BuBQ--oHl^w zyyUcUzD?mOa48en62{l1ftK9O@`ok=$dTQzP43H?i_Bm*Y489ve*_rvX&}|)p}D)T z*KT$tQx-zNW#y;Itgz|@{Vib`GnIPy>2TLp7C!vHZ?$4kX`2fIJ^r~+gg_@*(G*nl z1>VQsNGE7mtroHHRvh-rdM=jKZI;UoaZRt%Sgclum#(&jfvftZWcUCV;}QR$`msPa z3c9`)9q5+!)0=P9XeN1}MWUEaEP`uIoK{FcL6{8cN7;Mw!2U1H7~x(xRU13IBbV%% z+0+S&v0ELIoMvqI&390V2)u&FWBf9Gu4xBk;prn2l69`O_ocnYA^XYE(u^)(L8=Fxy={&la93fyVX<|$yg42Yk#bTEq{-kbGFI!gFSftKY7bSxB zC~9y`|Hk5i25qaq;_^K2iBStc3Ei+0woq1KH=<2OpD%!+*B!%K$W|~PE*n9wl8Clc zwhl6!39JGHN~i@>dS4FdQv1hXW_Iaxz^QY;0R%U6-*pNMowa`0gFqTU-tHwl?b9ot ztS5vEH`69w8#w#DPB=&dTygk1qPS&O1|(bv-6`FoX0|Q3`E&DueziPAugjE?nUR%{ za#6u)gh=2amT~JX3Am?A3A7@DO!~GM*2TtH3mFEX&H;C!LmjzBWQ6(B1Ar%$@q$6x zdy8%oyrySxgW5YV+qu7LrH{>YDz0n_qLtMFp)T?!4cY~ipE4p=Wc6UcBp3qrT%)gx zZLN0u4IocahQo2m;f00kckhqVsVWzgCM@a_B=;xB9X3$B0)^GiRT^5;-&()$UEq!B z@_o(iTmUhh_JbE9!cHB~9Qc@wDCg=s>{^2+@VzLxd`0S3_;hkZl0TCJ$UB=N$W>p< zqH+M~wEYJij)VKtAcA^Z`?-hn(8uucFF${*w9Q}tlH(KcDp_>$naPT+d3%cihZ9rhnRq%R`>k*&z=%Hg@Ay_{e-E$#g$aLbSYmKh59UZ}eTp_l?0((c# z$QDPSl38Im`%p0L_M}iPkYtu(PnW-mEQ zvPfVJL{R6%JkMjB4IJ1kUb)iRDh_OJ*FgkL3CVa!l_aLI(;hhG<-DtAk#Z(8{nf$~}W}vCLX#*-GZ6la&5|O2qK8TiB zZRnt6-;~MbaQgMy_U%L$HCJL$1IRv!8X1ti=X6_sjla=CG}Yfh%C7pAYv~$6Myx{9 zu5r|86cDo%%}*Eww*ZudBap-W6!6lq{XN?=F!1r&aB8DXI6(DT&12`P({}Bi+O_Mw zgUy7U+{z@+)IEu|1AVHm(n9MGqxqrwRqOAa9af2m7Oz>oe#4Hn^X~VU6Uy2Vr z;1Npd>qGzya)s)0dPbNzE$7aup6p;y|bTk_8iwg6*N4aoCd;FP?ZK5R z`y6-PIdnCz!KSs`ma}+mgJcTH5hrLUP0rcUsEpd-)n)&1JBMj{r!~KkYjMCu=_m+J z$OQEHVc3C50|Axv1=40u?RZVyB9JUI%RWR4aP})AtASKLHXfsV^)V%xYeoA47svia zZ=ehhN6n?w>a?8zrINfv4J0!|@@J%g^`lO-9~0c_SuTVT$&i`J5w)C*%aw5&J8#xN z5{f6p1PVJ-c?12bvh! zeJ#2qw?sb+5TUylwwm=OA?YUJV2Cxk+ah(EyZfz;D~-aeib(M8bCOuQEWBLv?b|6J z^D+C^m9omrZ)?JG{$q(TE8!MHrb>Cf-mX$P zpKRR!H-e6G8tOQ$JD#1^ZQidt{}n68dqw`0>SM=WS=3IZhE$T-u@Ke;^7bNFl>Nas zilQX?U(S)h1bCCq$9(g_f(!QCVS<8)T*b2k9pmrl|uzm*Jj;>?Lmd6-ST z04HP*;b&1HY;wT~RcIiK65Ed;Z=(imng{)DIt69E0 zq?P=a-!EMY4?+laUg&_}y)P`?o+nWcW4Sp-@}gK@7X)j*x_a@~Sg+43HK3vME~UUy zz-lRuUAFqy-xWD2DYE-tPgmE(>T6D$uSqbb%i0M2=R?;15V!b>ypgh`;;1K+%GGg+ zb3G#yc6p?mQu)u7UIA(Bhf?W>u~M}7%H>gaOZXpZ!C9S+#ie zpy9+y>5w#NR?`F%V59GpESeuQ0~uF*O-h-UmcDc6mnJ-g6M{m#S^B`@H~ITgbe%Fe zX8B`VEa^VQ@8pMT258B~pZ@5XHyEIpY#FiE5`>?VOjSNlJG(U#jYDn}2ZFya|q5aYT9&Fh6ib7Sw_|&4JhPjEvT&A#UgdUXV_C-RiKEHAY*iyLfuTQ5{U4R}}cCy7}{fbw6|;L)$Y)VKIVz8T_ zI{S#XS)2n@2tB<01^9yfrO+h8YYOkKs`mKVFK$MHwik`O`NeE}yDC9XlP2gDipPZ$kG0s&Fb5Hf8>-l zNBjSjBgK@Qs_l8BImJW<4WUF;y6|RGa$`Q3^hP?M8wyVjgEuh@e!1hI}9WuH8Ss@z<%Xn@mexqc3p6{{8 zLR0f=ZKhiLNSm_^qUsY@cCK!cfT$1-2t9f@M3}pQVXXtQU=N00#V`-<{$?)hJ{nsY z86C^BP--=&@!pB&^=oEhp6Kp2@fsABrzz-tJ(#@qgNF0@ z{PU20r+5XC2qbjXiY`W-cr=3Rc5UO5grBnNOd(kZjfW9}h&n>tb0J^jPnN!INo?$r zZEv^*+C)+=4=bj*&d}|E4>HX5htRnGe`HZGU}+BNc=eidzy20&FG)|S&?h|S`RwGl zvQRQ>c`iYJ;4e;W*MIlxG5?aWvFn-&N>s*IY9gx!7_CX<9xhx~@ljATr&J&fUlmS~ z4E{k0A`z=bp9!vuA+4w1lCB&LCE;Lrc(Z2 z$S|}-fmK28&!gYK?gDRYUXnj)RU6KJWYx5P7cW`&*42rvpe%||Uqb&GyHm{~*68J+ zDBWvsb&f%U=RgjpSgxU)?uYH;4SSEvIugz)h?7V5xQI?Hlw|qC>X9F_x(XZVrMAbp}DU@7MJkN$U znGz~h6*`@GD{FWYvYq+6m#xW&j9XGXA1KrVD-QoEG#pgL-kD9=VnitlV^2(fw_M)c zA7h{^=FIq@t2pMx7{jkZQ^;-OH5FS)=@~`r3}BVb%&1W7x$M1_z)6l{?V)6a1Du}K zZUu-z9v%g0j+hiU7VmHDbHEaAD9Hyz^LjPSZ*T-ra@^r37VKaG0>TU-#wGChI1d%k z(SZHrwIbeN5cBAz%PH5x<@FN>jWo`fj|;@IAqm@$l^p{=>@!OYxwBH@ zCM=E1qS)9L2UF1SGLQn*4*MCeXsbEQ5yKk1pkC;C8dU2*+oK2|Z3H6I-dMbra)=AL zt)LXYFk*7FJ0O3Z^XN(e31*E?6d26nq9LaOkijZ*naWR+i$Im?_$5sJez+B}Yr#p7 zD}ZYMFmyo5p#iBWBV-FGoTAbdCh$<4WGluIu6zBxff zX%TP}+x7g}`2X*NcjX3ASGU&obuoCfS5op+?c9NXl@q%t&2kFA{>K3ATvCq*%q6oT zk+JABr6h-NI|6_H_qkox*V~IAot-}euk)2tzuVR(R+shl^}eMe{uYQg4@#BR zL#3Ksq1!LhYPPGk2A}Y1%boFHs_0Wz9aB4pvw<`MC3sD$kjBSHnOR*%%7|ttXzk;| zX*I8=Njr;SN0^o5Nvk@AWgu`8V!0vArk?TDO$2-oyhG#-JRB$|GICTZ9gR#qCkuG6 zYVlBnlVv#O)%{X;|0^-!ukSB0iMFDs*20SS2k9`vxT%w3ir%@jQ$Mn#)>Kt$_c?=< z{jzv*$4N9WZ=0*ew_1#(>Qs7>MVu02V`c9t=YMT3Yx*`NEk07YZDlRg&)tPA=L6oj zQLL&G!P!FQ-uDxr6)w-89{RUt)1CNe>s3PelVdd|5>Lydqyo*krSDz1K`e^l*N`8WxM+DUkp`}tkXjnQCTAX3rc4%+JLCEk zK}=m2#$l3z2J!liA+x+Vahstk;ydx7laX&>iQEwH1A%Y3KC<1r#LB%*G7ck2CYSig z-a6eEa=e%DnMdYG@$tVo9jnva$DMg5A7P1e1l^OvEdV?VA_)YIRnsFHH5XpkR~Fi5 z=I*c%l9(^ow<1H-@-=uL{`RWf$A(N2Un3)Jxq{m6sC`)ag4olcUab?^xtNFXqoftiiX5&1*^$%-%Qs1 z`>7+Klh+r4ZzJQOdmx8xUwr%L@j%ryvGT=V9+`-X-WdLMG22_9gox?4_LycphFSDR z(n|1Z%WoWV_}ZSESZ`-ZV^87lXkLGPwHCp6O67Qm5^~hnc-W~w(P7b*+;67X*(8R$ zMt%rBw0=5!yXXe-mm6AQ)Raf1!(2ib#5y;#nwl>Ux;4|AGg)fp5p_ejI^ZCmuVp|S^0rUipCu} zi4g6yp=!j!-`8YT5Hri(Oa36c#nOTSy)OO%MWdgnu5$+FkBv=*L^@lP((%hh&t1Fm z=r~OuI|gz>*b8`==`pg|iO^$ACGKY`z6iK4d{mzFs_GlnAGfq*^dn1@M0nQ?!q#P- zQoX!t&+II5i-I2Eg(RpuE{|oS*#>Y%ow)4ODG^Lew+kL#R@(lv6ol!_=N{q|AYFRv zBkS-R`ZiIkMpLI=uK}wRROQ%VtP7!Y7V6Jo;oE?_{hnTuJM~-Uoup*-xt@=fWXlK9x5}hot-4 zJa{F`4@o%v;Awn78mV`1FdC4Rp zCc0+MxPf%TflKftmN3;^ortc@gm~)I2alANWew`(lnvO2X<482Bj3LanV6h5O^SWFcLLf z8bZ{fsCd`6M?WgE7WhdWKf4eQoYZ~=8pnS1aC13f;a4y z_TkrjbUL3CkADqzwO?T`12JQa>@8JG?d#uV5Fq9fY8|ha#5!NCeUUDT@Q*n=e#v|| z7e|P)cK|q$!y}`Dv}|V6zSk2x?W-g40zdcz$;-jNZ3%v(Y|WtqU#P-2$M$+Dd50)w zH>=~!1@r&Mkzu`kiFb;WO)#T!RutH69_Ao%D?XKWO&P~;sldc9rCnc=twu)5d`$Xb z7J|V(O;4UEdM++d0R$^#_!E;bJ@oU&Zt1GP6IX$X3NU95mg1p{0m}Ya>qU-WqWk-+ z11L3bBpvgs>Vs+V}3+LNzqMSDQNYxZ$n99i=7N3jq+Q{SgJRKwRCQuNh7gJA57KWENY zoFd6nilRN4bl4xF&K%aZpU8}dolt#0Q6!TU5qjwmcE)ECPg%nXbkzSH>LZWTRYOaaK+j+2Mm*ASWN=Wt_}XPj-d{0vfug^TtMKng9j4F4 zhOlG&xpd?4cf8m+nhi^D?byrmM^UzCtafEvaBWxs?PkhKb*3NIuDMyW;DP7n+RGc( zLa?Wd-4br>9gm3_AB!YEUJO9{}%X3+0F7o{U{tR36JIu}{Vw_S=%)(}B{6Lb+t}BmAQ>77}l$od>nG zl0`8wizMQO_oUMIF4$wASLR!ie3!#8;klKfpSfm46YQim^2rgKw^va%YEH>#S8>+y$Wfyyog68ib3=<89NF6GQs z^vqZHE~=E3nbU!)N@`wM-W~fY0}4xzG%4Y)<(MPN=H5)#mEV6VAxq!-`oSfr{qdt^ z@*`z(F#d+FuKA@8Sw4Jh%_?SREm?BkGbbKQJMvK4*1fb8C|6*A|2opPfgXSB*ZIuu z(gjOY-zK5BJL9h=MQ9e;>9UlftQ`7iCQ)h5JowGVB`NEdKRp-LuhMshjcRm+C&G$W zy@G;4ITs@u0ApZ32K!zv3-DuoS(!6xkgGCo*Dkz9dOK9+luyRkVuGg&lUSe-FE+kf zhm2pBe?U3}B5l0Q-|FvPxbu-L%5Un*?yR&@BJ=ylh{|kf$vexDrYWYnH%QTi!U^Yo zUh&TRg>Td)jiFx8B%z|G!NK91-7sr@^=U z7JOVQ84J^Pwgjge_Ke(k>XnU^+5P15Ps=rLt74JPl**EWw#OgZqXF7rOrnrHNkP&L zW39+Y8)>AQ&a|BgtsMG74{y(;41cmb5vu#CZE#s>eFZLmuw9FSG_p zb>xBZx}!jFr-JQ`dtNWOr^|3a%@i^A{5N@=ay?x@z0x=yv@A5H zO-DN_FaIC|GAu$MS^px&a5oq@hZp# z(ECYBxpKP#1h@BVG{QrEY!2~bj&rkCWVO0m>3m2Kh&}cNvD6Y9F0tw&bA79G$&!fh z?*&`y#EPlzKx6LNUB`N9z4x6dj|pt@h*Mf+h|xB6!H?%5a3BatN9gD0f1{PDAT zaOKMSv&Z>Z=?Q=ulQPym32KpyO zbR*l>N#hhF*;;jdRu>rxqA(44qVii4xX=MlaE!qGzK?UsFFknK|GJO8+OcJvL2Gtv z>+EK&**ppXzqoS)S7q#)7|>Rkzia^noS76cXMtb!=WUUu|8@Chr**;RZ-1pCP15K7 zilq-^ttDickz`QI^;GrGOhL@Y#<>od?W_SkS1PZIMCXoGwr3!4TCM=vvc+q@c3-CB z{w3`W0kY5IcCftvL^V@SxqiD}QL1t}jK^#-LTn*JX^ z$$H|Wp4=9qP)^s&R6aS{E-Wbnf8Pa0cdVAmwq`{=vhA({`D7~y%I;&Nl}9Ms{t4y5 zQas%B<@)t$>9+=2-A1?ZvMxKc8>8-Y6WEIh=H7`Cmp0E!Lt$liUO&^{y&c4oXLjhL+ z`Z+~nTc`LY5%L5)t4{8g=eK2@sDCb;%o_i4JcVm9Ru-klb;bV|-a%IU33keo(XW$} zzaA|qf<*&nt1RG>W%@`)J=}Wvmr>eCNBtxbn9!u)Oa_wq(h7bHqE-ajq&PWRKACve zIvtnwu322o%Re>F#o(QgTqYv_cRNR}{getqF1c=RopRb}oL1JgwT*(zzBAtUjVDr< z{jgzf*qm6ign8;%~Ml1t^*FdF9G4g4v=4=W8I4-9l;g6 zKJmJEeQL`Vu&(GEx;47>_ni&FWr3A&UQKjp>VyTss*ZOwp+ytE>_+vpTr#&f_V|5Z zVuUCuf6$=n?NyaNbjGGNMay146J1@rw$!_%2|Qj^tN|mppL6|tc6|$$FCSG+X+npaw?g;o~DFYnm0mM(o~ zN!I)(f5p@@ZPRct-V^YzGPz8GB|6HzM4Q~1Q|~>XjZ2)naA8cvefQND$7x^r{8fns zE40sCo0z!%v{w7{1P;FNOuSw0m5Wif$nV(AUyJb^s87u3`z{+s7!un&^$ig`~V?q*XU$rZ(hxouOEZjOY#iTG_2sb}H(>$*uSA1x2htCQ~cgV;V(o(6nGF z`LtD>@Q}d6*RK~FrGCA!)aOaYnDK32Op|22g_MsL5_n9?897a&;I@M9#!x_M3Pqu4 zFS;F3s5eJGBL~_L+oi{%?Cl;5br@PqC?vg{m>_5?vU02kYa*|GFR_iFFgC6Ga_#Fk zLjnVXZ)C_5i}~wEz5AsPBO*#t;R}v^>Ia(?V+FLx{{lrwFCM=t_Y?;?cq(_5aNPNT zCO9KxgN?)1-$^U)G{+0d4jY%QNJ8mN@&87!>=nUo2a;}K)`*X}yb(kAJ@GSAhB*A! z52rX+RU=)aHE}Bt-=vr{dl~(KP}?=`F(z+T8;Sw;RBazngATOc`RtHo89THyU?M7) zM$KPJX=A-&^+vVB3w~!WT$BHfUDD=@@A$^7d>e|5#{@S`-QF%1Q8XX|Ls08|9ei^= z<~@gA4lgSSAUOx zZeQLWA`koa3VYzK`fY6euTX6=-~-FoN7U^6XG+QgBMtw5*GQ27Ki*qB0+7J3-&Cyl z{a==`S=J=PSVjj)Fl~wf9p$8^s=F3ufBbx?e`3(pN1|{wQcI&ZsR%L!0y!MFK|Ea=)K|oCeCQiGYSDSuwIUZ`t?y z@%>`*Boa>0vtWZ4007|%jm#OnQgb+tsN%gqP3xz1h#gR-jyAbzr&G~%?uJ7oXt+3f5HXIEaM5Mj2PbvNFS zP(LM67LQ14VJJ8b6zv31nDAa0 zi&@s%G7wyN){)q((VVG)Z6G;Aqcv~Xzdrm7xfqqe0Lr8%dzpiZ)1_cb)YGjo%{)2h z1-%W}CV_8KF?=7R4f_IsR!f@tS^($JY}LyM+TJ1oHii8_sE6s17*_=F8D@?=dF7Q= zM%BT$<<$Zen(}#5bHO%4Nby@G<0>}$id6FAvWl0@7%KZfiMb1mav~+{ zf1q2V5|~BdIG;vj>vt-HDnqR*zYh-YlXCPzC-rXBM7M$Z4eV!9$OE&MLun`%c_WaZ zNDk&U1VNHH`X4E%;a>?FUy}=ReZB@Pd#%MY6i4wd1}XT$vCWY;0J;eukq#Dz^oZ9; z-VIa|21ee(KUG=bW1FwClQV{H;l&-Z9~bqc+u$xlqv-;AM5K^75DXl_yy6OcYJn+w z#P2Z!$FBan$N{q`36z7+CybM2q-SVdrVqzvT>VQ~({CyIecIq(^dh{xFk0kip~;eu z#q^G3*$A31$i!VXd_-2d2QpG;;@A~ObztI2?iZ#3hQjVr0;vT92moue6svJ0fUR9i;*EfS>;BxI1Ylq9vuhhwKZ zl2~3X6877!Z6A7*(K>A+q^ME8p485s$h7qA+g|Vn+WZgxzXGfWsI)fbd_C^>pQ9$C zM;!EK+DH)%PB|adaWj%`O7V*MM8c1a>2*}j7WnGeB@(|)5bOSrHj*H}y?ae-ggwXm z%`BN9x~Jy&_9c2w{q|)jSAKiS;ZAU8`ESp${QCEl0vPlsl&o97Wn<6ERlOQnGGtmn zqkP@Em8-k;G%DA2rqd`|y;`HOglsyg-PPBT)Ax6Y1U5jY+ymsOi2zBd^#hQnuG1P4Lv$-s_7&hEIYqW{!%WDkna2O IujUPdEY#?qVE_OC literal 0 HcmV?d00001 diff --git a/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.css b/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.css new file mode 100644 index 000000000..44fdee9fd --- /dev/null +++ b/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.css @@ -0,0 +1,168 @@ +/* cyrillic-ext */ +@font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOmCnqEu92Fr1Mu72xKKTU1Kvnz.woff2) format('woff2'); + unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F; + } + /* cyrillic */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOmCnqEu92Fr1Mu5mxKKTU1Kvnz.woff2) format('woff2'); + unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116; + } + /* greek-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOmCnqEu92Fr1Mu7mxKKTU1Kvnz.woff2) format('woff2'); + unicode-range: U+1F00-1FFF; + } + /* greek */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url('../fonts/KFOmCnqEu92Fr1Mu4WxKKTU1Kvnz.woff2') format('woff2'); + unicode-range: U+0370-03FF; + } + /* vietnamese */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOmCnqEu92Fr1Mu7WxKKTU1Kvnz.woff2) format('woff2'); + unicode-range: U+0102-0103, U+0110-0111, U+0128-0129, U+0168-0169, U+01A0-01A1, U+01AF-01B0, U+1EA0-1EF9, U+20AB; + } + /* latin-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOmCnqEu92Fr1Mu7GxKKTU1Kvnz.woff2) format('woff2'); + unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF; + } + /* latin */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 400; + src: url('../fonts/KFOmCnqEu92Fr1Mu4mxKKTU1Kg.woff2') format('woff2'); + unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD; + } + /* cyrillic-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fCRc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F; + } + /* cyrillic */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fABc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116; + } + /* greek-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fCBc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+1F00-1FFF; + } + /* greek */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fBxc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0370-03FF; + } + /* vietnamese */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fCxc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0102-0103, U+0110-0111, U+0128-0129, U+0168-0169, U+01A0-01A1, U+01AF-01B0, U+1EA0-1EF9, U+20AB; + } + /* latin-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmEU9fChc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF; + } + /* latin */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 500; + src: url('../fonts/KFOlCnqEu92Fr1MmEU9fBBc4AMP6lQ.woff2') format('woff2'); + unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD; + } + /* cyrillic-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfCRc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F; + } + /* cyrillic */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfABc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116; + } + /* greek-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfCBc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+1F00-1FFF; + } + /* greek */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfBxc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0370-03FF; + } + /* vietnamese */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfCxc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0102-0103, U+0110-0111, U+0128-0129, U+0168-0169, U+01A0-01A1, U+01AF-01B0, U+1EA0-1EF9, U+20AB; + } + /* latin-ext */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url(https://fonts.gstatic.com/s/roboto/v27/KFOlCnqEu92Fr1MmWUlfChc4AMP6lbBP.woff2) format('woff2'); + unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF; + } + /* latin */ + @font-face { + font-family: 'Roboto'; + font-style: normal; + font-weight: 700; + src: url('../fonts/KFOlCnqEu92Fr1MmWUlfBBc4AMP6lQ.woff2') format('woff2'); + unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD; + } \ No newline at end of file diff --git a/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.icon.css b/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.icon.css new file mode 100644 index 000000000..654575c73 --- /dev/null +++ b/presto-main/src/main/resources/webapp/assets/stylesheets/fonts.googleapis.com.icon.css @@ -0,0 +1,23 @@ +/* fallback */ +@font-face { + font-family: 'Material Icons'; + font-style: normal; + font-weight: 400; + src: url('../fonts/flUhRq6tzZclQEJ-Vdg-IuiaDsNcIhQ8tQ.woff2') format('woff2'); + } + + .material-icons { + font-family: 'Material Icons'; + font-weight: normal; + font-style: normal; + font-size: 24px; + line-height: 1; + letter-spacing: normal; + text-transform: none; + display: inline-block; + white-space: nowrap; + word-wrap: normal; + direction: ltr; + -webkit-font-feature-settings: 'liga'; + -webkit-font-smoothing: antialiased; + } \ No newline at end of file diff --git a/presto-main/src/main/resources/webapp/disabled.html b/presto-main/src/main/resources/webapp/disabled.html index 6120ea040..e16d9e3c3 100644 --- a/presto-main/src/main/resources/webapp/disabled.html +++ b/presto-main/src/main/resources/webapp/disabled.html @@ -67,7 +67,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/dist/embedded_plan.js b/presto-main/src/main/resources/webapp/dist/embedded_plan.js index f9a5ebef1..7129b5caa 100644 --- a/presto-main/src/main/resources/webapp/dist/embedded_plan.js +++ b/presto-main/src/main/resources/webapp/dist/embedded_plan.js @@ -8103,6 +8103,17 @@ eval("var Symbol = __webpack_require__(/*! ./_Symbol */ \"./node_modules/lodash/ /***/ }), +/***/ "./node_modules/lodash/_baseTrim.js": +/*!******************************************!*\ + !*** ./node_modules/lodash/_baseTrim.js ***! + \******************************************/ +/*! no static exports found */ +/***/ (function(module, exports, __webpack_require__) { + +eval("var trimmedEndIndex = __webpack_require__(/*! ./_trimmedEndIndex */ \"./node_modules/lodash/_trimmedEndIndex.js\");\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nmodule.exports = baseTrim;\n\n\n//# sourceURL=webpack:///./node_modules/lodash/_baseTrim.js?"); + +/***/ }), + /***/ "./node_modules/lodash/_baseUnary.js": /*!*******************************************!*\ !*** ./node_modules/lodash/_baseUnary.js ***! @@ -9181,6 +9192,17 @@ eval("/** Used for built-in method references. */\nvar funcProto = Function.prot /***/ }), +/***/ "./node_modules/lodash/_trimmedEndIndex.js": +/*!*************************************************!*\ + !*** ./node_modules/lodash/_trimmedEndIndex.js ***! + \*************************************************/ +/*! no static exports found */ +/***/ (function(module, exports) { + +eval("/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nmodule.exports = trimmedEndIndex;\n\n\n//# sourceURL=webpack:///./node_modules/lodash/_trimmedEndIndex.js?"); + +/***/ }), + /***/ "./node_modules/lodash/_unicodeSize.js": /*!*********************************************!*\ !*** ./node_modules/lodash/_unicodeSize.js ***! @@ -9804,7 +9826,7 @@ eval("var toFinite = __webpack_require__(/*! ./toFinite */ \"./node_modules/loda /*! no static exports found */ /***/ (function(module, exports, __webpack_require__) { -eval("var isObject = __webpack_require__(/*! ./isObject */ \"./node_modules/lodash/isObject.js\"),\n isSymbol = __webpack_require__(/*! ./isSymbol */ \"./node_modules/lodash/isSymbol.js\");\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n\n\n//# sourceURL=webpack:///./node_modules/lodash/toNumber.js?"); +eval("var baseTrim = __webpack_require__(/*! ./_baseTrim */ \"./node_modules/lodash/_baseTrim.js\"),\n isObject = __webpack_require__(/*! ./isObject */ \"./node_modules/lodash/isObject.js\"),\n isSymbol = __webpack_require__(/*! ./isSymbol */ \"./node_modules/lodash/isSymbol.js\");\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n\n\n//# sourceURL=webpack:///./node_modules/lodash/toNumber.js?"); /***/ }), diff --git a/presto-main/src/main/resources/webapp/dist/headerfooter.js b/presto-main/src/main/resources/webapp/dist/headerfooter.js index 16fa556e9..fc5efe4a1 100644 --- a/presto-main/src/main/resources/webapp/dist/headerfooter.js +++ b/presto-main/src/main/resources/webapp/dist/headerfooter.js @@ -188,7 +188,7 @@ eval("/**\n * Copyright (c) 2014-2015, Facebook, Inc.\n * All rights reserved.\n /*! no static exports found */ /***/ (function(module, exports, __webpack_require__) { -eval("/* WEBPACK VAR INJECTION */(function(global, module) {var __WEBPACK_AMD_DEFINE_RESULT__;/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.20';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading and trailing whitespace. */\n var reTrim = /^\\s+|\\s+$/g,\n reTrimStart = /^\\s+/,\n reTrimEnd = /\\s+$/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = true && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '

fred, barney, & pebbles

'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<%- value %>');\n * compiled({ 'value': ' - + diff --git a/presto-main/src/main/resources/webapp/login.html b/presto-main/src/main/resources/webapp/login.html index 78488f209..4b5967ec1 100644 --- a/presto-main/src/main/resources/webapp/login.html +++ b/presto-main/src/main/resources/webapp/login.html @@ -154,7 +154,7 @@ } - + diff --git a/presto-main/src/main/resources/webapp/nodes.html b/presto-main/src/main/resources/webapp/nodes.html index 7bc6b329b..83f71dbaf 100644 --- a/presto-main/src/main/resources/webapp/nodes.html +++ b/presto-main/src/main/resources/webapp/nodes.html @@ -46,7 +46,7 @@ - @@ -64,8 +64,5 @@ - - - diff --git a/presto-main/src/main/resources/webapp/overview.html b/presto-main/src/main/resources/webapp/overview.html index 5135967ba..5de63e936 100644 --- a/presto-main/src/main/resources/webapp/overview.html +++ b/presto-main/src/main/resources/webapp/overview.html @@ -32,7 +32,7 @@ - @@ -50,8 +50,5 @@ - - - diff --git a/presto-main/src/main/resources/webapp/plan.html b/presto-main/src/main/resources/webapp/plan.html index 0519fcc75..f34672db9 100644 --- a/presto-main/src/main/resources/webapp/plan.html +++ b/presto-main/src/main/resources/webapp/plan.html @@ -61,7 +61,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/query.html b/presto-main/src/main/resources/webapp/query.html index dd1755c54..42132be05 100644 --- a/presto-main/src/main/resources/webapp/query.html +++ b/presto-main/src/main/resources/webapp/query.html @@ -64,7 +64,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/queryeditor.html b/presto-main/src/main/resources/webapp/queryeditor.html index 103a2084c..d74f8d805 100644 --- a/presto-main/src/main/resources/webapp/queryeditor.html +++ b/presto-main/src/main/resources/webapp/queryeditor.html @@ -32,7 +32,7 @@ - @@ -55,7 +55,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/queryhistory.html b/presto-main/src/main/resources/webapp/queryhistory.html index 421ac213d..a6ee8db32 100644 --- a/presto-main/src/main/resources/webapp/queryhistory.html +++ b/presto-main/src/main/resources/webapp/queryhistory.html @@ -51,7 +51,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/stage.html b/presto-main/src/main/resources/webapp/stage.html index d718cf9cb..69ffbd4d4 100644 --- a/presto-main/src/main/resources/webapp/stage.html +++ b/presto-main/src/main/resources/webapp/stage.html @@ -72,7 +72,7 @@ - + diff --git a/presto-main/src/main/resources/webapp/worker.html b/presto-main/src/main/resources/webapp/worker.html index 7bdd833b0..3718bd9fd 100644 --- a/presto-main/src/main/resources/webapp/worker.html +++ b/presto-main/src/main/resources/webapp/worker.html @@ -59,7 +59,7 @@ - +