From 69f8ca2d6fc03dd98774ba5a9c98d6a61dbe7600 Mon Sep 17 00:00:00 2001 From: Eden Kirin Date: Mon, 31 Jul 2023 11:44:21 +0200 Subject: [PATCH] Initial --- assets/custom-qr-sticker-example.jpeg | Bin 0 -> 71202 bytes assets/qr-code-example.jpeg | Bin 0 -> 69769 bytes index.html | 23 + lib/zpl-image/LICENSE | 21 + lib/zpl-image/README.md | 235 + lib/zpl-image/copyzpl.css | 22 + lib/zpl-image/package.json | 31 + lib/zpl-image/pako.js | 6441 +++++++++++++++++++++++++ lib/zpl-image/zpl-image.html | 333 ++ lib/zpl-image/zpl-image.js | 444 ++ sticker-print.js | 109 + 11 files changed, 7659 insertions(+) create mode 100644 assets/custom-qr-sticker-example.jpeg create mode 100644 assets/qr-code-example.jpeg create mode 100644 index.html create mode 100644 lib/zpl-image/LICENSE create mode 100644 lib/zpl-image/README.md create mode 100644 lib/zpl-image/copyzpl.css create mode 100644 lib/zpl-image/package.json create mode 100644 lib/zpl-image/pako.js create mode 100644 lib/zpl-image/zpl-image.html create mode 100644 lib/zpl-image/zpl-image.js create mode 100644 sticker-print.js diff --git a/assets/custom-qr-sticker-example.jpeg b/assets/custom-qr-sticker-example.jpeg new file mode 100644 index 0000000000000000000000000000000000000000..38ca6bb9a41dacd3aa977a6c17be2c0e41b37d42 GIT binary patch literal 71202 zcmd?R2{@GP`!{~u$(DTylcgx6?E8pp$<>uizE_6otxPX`- z508l4DY3KXq@|@{!U`(#lFDbKq$Lj@LPA4BLq|);Nl(uy$c!*XQE){KX;yzBtA__ zPI>k`^>tQu&YRq~@7@;{6_=Ejl~+`LZft69X>I%RwWqhQe*pbsaAKu)oR01mq$mCnqDPI+Tlq)CXK-Oym^&=O~%aU#7a{ z&LSXrpPE%Y{?(@j8bPTm7`EFU-ACAkq$f{c4@LVW+5ebeq5n&g{UO-DZ~+6`B=tN-{ebw72Az>U8^gu)|p$1RbzM9BUi**MN^ zNO^RS>-)U|5wh~vAMLTRF^rE_0>$TxQ;QdRIO9D8jdBWGGuwC=^xcd|G+DuQcL&L& z+Kx48Z-5O3)b?^b-|j57c5Ca5N%Pw;-ydBr&m?^$0xr>LTp0G40fypbk%f7?pWnSE z^Pwg+@o1aGA0AX1=v*`C=K|`aTeMkzS%i#=^JR?qc6zDZ(fCn=?x^Y(!CAY9UM>E7 z{R?Bf{Y0n?FZX7NpdG(GY?JYIyvlBtimU#+6q+Mde&UD!e=r<=};l zL$$;d7aLu4%8>>t6MjavmDEUlm}}kgV$r~ zLJ#DO2t7yd5L(-Jf2^0zA6Tts$c--UqH9Ne$J(_p`ejkd8g6G&=2~(-jIbx!+{zFm zB@suzr&59n2?min(Mba zAP*vhsq%JyOXzv+E+QFMoVf%2@4Zqf zs^0#zseYMy)lZOoKd~o7wgkDWSaXa}V@PEW$&IFJzY{mgoZqX zMzZ4)-MDU=u6eUHFA<@2Z-2Q1|BM4BadR9Idi|}^Bynn(E@v+B?yKy}Z6?R_f*Gg| zcGUR3>Ocv1sjgaRhXnJ(_^g~^c0IM7xj*!0HSf8~9b^ejgb&GLNR(f=vZYLC@Tq4| zq#=s$CM=bHp@aBLbSXK5u2JDlN`hH@-3Uw>k!CK%QKfUU!D#nZrEzkyRSpNd2w5pA zrS>?k@p^x-AkJfZ?K8)Krz2W)J3zrFxn@{I(9W7_?l=RP_Zq?o{V?!45lZO5>=SBV z5uu*&OomkCBgLf1#`ba6rSzj!z4K+&=H4GGpJzF;uIx5S-<%fH9)){tSlUKDx-*B- zEPEue{bNYiF2y4vXzKVi9(ywPd0vIh0`2Kmd_vy%-Wnqz;#6c~imKQ_hV%hjQp<61(b;FEq$#AyeXmO(ibUZ*Y*&aADk_tl6uKEd8 zq^W9tfVg11yAzC_IJ z^TNkPqt#GhE~CrW7~o?b<7V3{dIlx^#qBRuxB10OzPYeI)HW7mC9!Hn^lXWf$PAme z4eR?xk2?q-c`KFR*~_WWd5L@D20?*#_<7>zF~$LzAGcldm36-6F0gST-9k168>Z3y6MX?A5hkOwujFyT znQwwdSZMQ}g7CY!5Jear-tl8UUV|a*!$MglUzQSi)EU1kt*;Z*pBSER5vAHr1Tn!G z1btKs5$Y0sj2)<%(hq1+WvN3~%N;~ew3!DunxmMDzKhM72Aa#<`K+391K9lOQmL~u4urM{s^Em}> zEwy507{iE}0atOGiWngseEAQu4IUqqG+1!L|L}s#X6$(vJuMKx^dHJ*9KEyVnt$hH zvH1;l$-;7%rcjS_n|TBo>>a)%n32?ujt^x_LU~-VvLuDATwgL75(T2skA{M~xi$M| z*q1ZMPbF(cvq;{wnU=>p52;k{b&(Y+Y-b*I{!;y0zYo`n9XHLt%oH8!*Z8-77i(dG z=Sy(+?fu-HZ>hW<()koG6(Jt~0;|TG!_~~iX0keAHfUi{$bPh?=P08vl+l<2nJr0a z`uZMZZw4aUerY+O#<@}Pr`1W!Xlx0c1i6p;$>QZwZ>mDY#lFApd)w znljoaU#d~CdSwg87DG1NW^;Jwsdgke&Q;%TYC!K19X3AAXK}j*;)lPr~Z{H`sX2FAwU(x9^PaY>AK! z?_D9K_l?6#C;#C>tAu~rfakw#Kuo9830nDAb@jW_LcK+{$u1Mh>(*tah)@v%|9Efy zAPBfnrfFGW-a8YLr_o2X&a>%V>h{WKR}kzeZdW3Ivg%!O|2AEaj**laAMaGm?cUF@ z;-}mLg*IV^0hjkDx$cnBT$-SZFSmYV-%|B-;5H`Z@z1FsjmEc4O{UE)e?aXZz1gkV*Gmt^LA z$c&A*%6=DBoYS9+2LGLhUJl9{lcO3s<*g}xWETun7X>5s!oqOZ;$AOaaeDW@_PO0q zw6&9E@e#Yrp=V)SJj{waA0*fVwJ_tM^X5TztJhbpV2UDH_ea_!wMfVu6nNV*8DHQ} zIlsqcAi7lfmYCx0vzJ)f@1{SZK9jp(T(4SaIxunbrsUTs*=uUwjxJOhAFR}@%ssdF^uD8U zUb#!O`T|er2QAZd-%JMDKNSEXkp$)wIL54wN%M%uCSm$z$!9+aMQ9$86QQI2!qv*v zMpom`MtEucen_Su%ht{BP7@1#lb!&x;@$d331dUFN)Gw?uVSeMjN+S_!>?WLg5=4D zLX=Y)kv!EBev=C>cvI!%)EDj#3#OC1U)s7i++@<>S`MXTWNY^|p_SkW^a``WL?jO= z@;;iIvVHtj+a;QT^)9U|8Sh;h!Tf-iI}u*=2Gc7Xdwgj=a`?^k9))8Yf-Z z*FGCLB(!IBs;p)&Twou!_ijv2i-K;#)Sdf z)aVsoJ>QmkOb29wwM=05Qa+PzoShij%Y^=_K9slly98{0ft{a?4r^Q@odF|78(#5I z1!jI~E!0bbbaBu2XQAWHy-z=r&)r!)5xjaNRAKqM=86{TGZY&;-=5xl@dLyF_SE)7GJu1&!CG>vh;O?pV6e zVB=tV{2bSOYCkTY2%Ru&f^BUOp~6R7or8GM}!DC*t9nO z^f(VF3yP3LD3B40Di+CP1fXcr1UF9zPa{J66UZ1CCNIzv6c!ys=l}y!QrGJcRSAHa z&8IW=*xkTR-Y3Wy8e`<5HhC4+O7xkRdit-6>YWbBOb^>Ym5F`}Rv|)P#4A9_^$fXr z8rt>IB0^7AGl&r49H?N_Ygb*JCwY$%G=`ABR{844eq9aZ$sO4QqjB`AvHr*wh5(y`11TT27#=qd+6`d->CrKP7Lg-GySJ43?WQW=% zaUS2=fDu9+$O>_-SxbsLjf+2}s}x*U&8AK=U65>|{35dvfS1C4I9H9DtlGM8BckK&1(5zFkw@Pne}u+8M>+B-V(ttH zhr3Pmm*}31)hsDhdYNRP+xoGPdKvUp?dD;J+op=H+R>kW5L zn*a^S5yBAHyQl#2{+rd@$7n}aD@`IO7R~so@`kTFB^&MfuosO&OQqSBA|1bR;l7Q<-~jd@N9`aDt2cYKsi zzxdQz;`{F!jvJmFIBAXxct$UBL1v4uga{oM*C5n@a-&Nh3gq!e>*wNCu=nzA(Qn1x z_fz@MUa4@Igib|U<{Nsj?g)G)85cmPsoSw#d^x?aGLZ+{$j{Y}|7teXvLULieX2q@*&Y4Ll2R;NbYcf>D>IdX-Dx#m z75%`TU=H7TGQz1eg8VEAq2#+m-8yeC5n7&uA5fc)@h*^kQ)ZinG5DG{_*+F5ENu^P z=R8%lZ2s_5qiIl>+<#rPyjxi>%Qsd*2za4e!b#eHd0`zs34Rp$%L&nN;DgX|-PYDG zAI!pS0XHd~C)C~o%E+75dF_`I%h^}d)?lpdVF2yT)#m-}6CE4`jY<#{G(o&N0xiUS z9_N`SX#OKA3IF#*F6pdEw^;bX4Nzm&QsK~pn?_U(sWIVWNkK9(2UX^y>ccisEnJ4L zP?>dqlE%4>Ad38Q6-#vxNQ8dAuJPOkWzG|ZDiG5^ELb=hqSEq<@jGPw{+;Ws6E|Oc zo*rvua+0;55MpU)ZdB;hrWnKN16JtK`$ueQ#$*sl2!;6nc_xmk1;JJ~^9~nAs6}pH zwyM~dLAFs@g3$dIfI}85ZLB%rV#Y)G@;ni;Wn0cDGR22@kMHe)qWQcuNnfBxWqA?K z-c#nodV@&C1FER688u6yvvoKf@47uYCm4>I2u&jl@&3R`%t1;)oCV4TM-~&IUrSbJ+llnY!4K2X z_F+0Y+&cBzH76)X_HmBIrC!4~H}phb6jdMjW>_KcrsQMMClhle9r6Cy>l&PDhP9&e zYm{= z8lNznv9}9qQgu{{G-8)wkqB*VaU4czkaBR^#fE!i;4K_o#w0=*uh%a_uQa7v;b@KY zc6MQF`7s%4cj0{TT~?kW`$zswl-F)E!T*KDmjKF1?;@iSdnV`qS0LRb%!_XE$sI@)}ZT@wS0;O_&tF&AMuQ8{Y zdOz7U{8X4LmtTnlYxa)%wF30gsj7kn!s*foVA=Q4m z?$wI6k*vGZJnN$E@JS?YnrlOP4Nn2WQWsUfx5={p$68zGc2Vbu%i&TN3e>jSP$|gC zOl9|j12_>PLGEoL8`XTL3I2{i5wxHV$YeCd_1imV;T6iOdc|KAR&X$hqz;{92{Dha zxa&NJ{EJaqnnn>sacRv%qKn*lH`46AJp{t6Z4I;)3g8BzN-qt1XwI+CzGT9-QiKS? zFG6VqW?nZ!7UwF{@V0-fQ_*WqjoWd@Ypf?hZ}q8yF&Q6GFho~!{CxR1SdhznLynyT@}QY z|JkB`T|Sj}=1DyR-iV?u#^hclyfN)@jpWcV(Rg>}sQfG@d5Vf-DU`LIJ>H{MmUb-) zGUoHz`{f6eDe3;2|d>CV8$?AOz4`Oe-vekUb=UOc-bSg$OZk>1!C^;tI^JkB^!S zYr2=p-+Uf_)P;wFinOHe&xW+M$W7GC53WK#?m{ByNZi%(JD(aMsKn0x(USE4)Jw;Sepzut@HJA2kS84knW zg~u5H%WxyqKta5D4ra<`GMn*>CL)V&f}-M;q|{eK8APWUfvJ8#w*3(tH=W&Ltt9); z-2PY|z$mcTB#}mfg(H8&8ru7fRp0F30G}r4~Jx4%C3^= zOcmFvApZ?M{BuHImA^sIOp%%oduJE9dQAN8DWr-FT=@yd3x9;kI%hqGg+f^yw zuFq(XWI;D40!-~OsCtfCsJG-;K>Kh&miOtlH;@)Y?wLAPhh2NH*}nJzRek=Jn>VdX z!l@ID{H^Lr#s{z_Gx$U6WPRA>vf5Zs)T-}?vUG7nt+<#;r3`MIx+Qnd9OntYti*3m znai)H_fN+YI)}a|o?eo4HVeo}qZu@YiE+#wcV9v1P&8lZkDu*cvyP!HGH-kTUP0&` zC)q%VawOn1)j^zsK70ISzLbg!JH z%7^?I0nZC?o|?EeVLuM<+>e(jXq<9mxW0T=L+G4k>ztU!(HmMi^RSD%R0OsZV0#PK zL110`f_jCg2LvypuXTf>K~#Y=dunj5J!6Wyv-?SORG|U&&%2tCgYW)SOk9Y>hZQ&J z<-9C!7M*-rk>Rjt9&|ij8`qwLLw{yo7^t+It?m@_pgCcCn)JoC%qwifnA=1DH_yE% zaKq-IJyfwig?u+-9+Q&n95;RHlum<{jk=8L@|qN;SrGUgF94!eYr-Wt_jP9oGA9yB@@qMXr`!7Cj{@B3(9tGq|zO>&Q+c(#_> zhr0|~hBY2TwHd;#gVudsKHO%G7hPubx^BEE`$j#Sad89jXng$|9<%`w@O=@K#^D~( zHV&y4v46@l`|;&)kCax#NMFROG4v`k`e3ZK0`1>hHoP5Dqpt|63t6gz9bN#c0FVSi%@Yi zh<9ecqBF_nDrje?3~}-#E~@c?_(eBd00MvyNSU=l!0r~rYQ+}o=*3=RYzZ&DeY~?7 z1#~BDspkvSgjJTiK`OMv2@)cLqzK@%yYsE8N3o1ic$Yk9f4+F1w~i@^e#tu~*wt9$ zdM>KE<6TtNdDr2syViZ1_LgTr^8GyoBHSHd^^_` zHQV&z*qr>TXf;m7ow2b);%W)@LEdXaA4OeKtCxWGJumo!#T>>evm)HecO*>{(~RdX z%@yiyD=m$wRe$f%%J(@$)#>9)aT!|kI4V{e6)`6Dn*npW80CIUiqin1lXU(WIMYSdg8W~HuB+0Q zH6hkNU2Ltsol|yU6XyH0DmPry&FilRy<~gfM13qn?5u){)Q3D8!$ivV?sea_o~yTUc>v7|JQU z(fRuAY+O%;TNvSZiW!EtCVy_W&ns7!Lxc$VvQ7eYOj5rWW|6jt!K>qT-VQr0Z^sBW z4lD_j1Ye#}3dXE$unVJ|!kQt+=6!YCX}wRh+V8db+~-RQfAZnz%r{Z`z22hY2*U^> zWKa=12MTPSPcI^1^JPx9-{anlIj-c6EN=GQ=zOWR5TwmCOLC2XtcSx|EE23qdli5*QU^uitX=? z1Xf(dB%EVBCp_uf02)Oope^5)PXBuTv|*{IRlr1zj}Fcnwe0T`Blf1G|BRcJLy2jb zq!^a(*-e@j4_{dGcj|)m9X*U()9~YC!@MT!bswL*3YPcgXqIy>aIy)z-u2_v2GQG} zf~^DBveSIeBw2q_MY4zBQ%>tqCI;zz^k_U&JXSC)doP$$q5W3Y5)2A2 zvzBJaM>(T)S`u2&h`AUNC1yY6|Zz7`0+;Qtu#cG|0erh4gPG- zcXs(zOJl9>F0y9m9t=!sL>4o(;sbQi2UsgUgH`0|J=lbh?v(hk8!6_-eY20IWMbA* zIz^7W2r-w3T^z(szIHT$(Vwv^?iI_Q-M=IlD7z3%xn?9nHdk{j#>Wu03AoEcnN2@) z%PFqD{1-{o0R=i@uM?r>9xOEx%FQ@n1YhFn}eq{x8UioPf1E}5Mv zMGvs2h^3rcky1z9FUCkRh>%4e@)Rd7qBC~yrGdRf<>^f4_#s-HX;o+^`;;3>pHKk>g^SL1nm-`cgq*0&@x+8Eh`+l zg*Zn~mGl%_H<9uOZV{tQpQ_T;Is(yI;Vw=MH_l)6%6wKQcf@>Q*4t0@WMjgb;EPaXL_UKt@Gk>P(q!?vmWSF8k7)gdHho971EHsV2-f56haVhfGz=+Z3Zm6Vp zw_BIii=N1)KNn^tDZ?)Ri{3PCA3B|}GO9$V1(_4TB#poP@~bX?OxUZ_Up=T-)L=o~ z2tW^fHbfnkQ-H0iuYkA2;dB8*zsInIz;OuUx~N94nSQRrBmz6$%b@zQ}y0J`$nFIa9FTeM|rGU&JA=&u=WJ zAGoIS4SltGhecQVyT`gt^YgfO!ik6r!5x7PW*FdD&klKKHNNS;O{G$uz)Ce`U>@Pf zuJti(j}!-MmMQPXt%s_h=w*uVV^q{P&{;?q z{|VE#xS|F#pXjRx#)R5Z{bFP0-D?Tw;u~PTXl*sVW0SPU)*|2>MCfCQ zzM1~T@g|e8o7G7dp9@nw98GphTVtqRW4o=d#TZ!!^QL`yqq#P5>X_|0i#qBA`a0k3 zV@dZn$Fi|jQB$2{i|J=G^vbKtt4k|-Pj0N_7JHkTfJryzGA?6yxD^%_zUjv9_@>dU zQ16*kg`|#+oAIqSX%eU98$CaZ2l`ySX|I1s^5GgX9*nadD<3EIoj1WYS@Bnwek^-z zP@43*_oVktdwKaW8Zepm!g|fR#71LZ8FyOrl~nutc20$LzDaf1od@)L=r@a%F3EAZ zjkj{mwOt&Kti+16kj8C{*FblzNU{Bqam9{aU{xBq+WF_DT0L`h`A8Zj0CwHuGoV(H z6ph7Iz4A5vd~e$f6-jP}i0WCSFP5b*E?;}r3I&8n^}av{O`#qHvtYe95Mx6fE`a7= z7A{V-)?KX+&EB7uVGJkG`)YiyeBd8mQ`0;T^o#w!XZaIG~U#sFBv2qCf3wF0>L z*S^k8a+NaQliqfyWT%@e2grVE@sJ!`yMe^?@bQAgekKo;*nqQs4*}9JA^>B$Qv%1+ z!0`GoOlR;B!gemm`+`I$>O&{a5yk-gmE#(qw~%;a7^X+{*8|@Dw>_W-tRN6$;9hkV zbWGw1CsPPq8~>6=rU%D3MG+adB5~%9*s9CGfM(2tS&ydZnVT6GYo;aG&2SQph0b!x zy`7{wpPoh@1M_$@)2t+I=6G_9OMahJleY?1vAm;gi9s8K&VACVqJZLr6(b`}2{$X> zsD2_s*lTr%N`Y@s^dr|{VD43om#+$A`ngtMV09~C`Yml*?uO9%Dr7OuLtpKczea^) z(ZPt9bkxReC-Sy`Nbp;yQXnJaIkK^ab7cIbD&s#?^-I^Xf2eBs4<_?4!R5`4{<+t< z^U}0s8^QIHF-+Ro{PD3b&kTyjT-HCgZZNGUATNH7o1m=8xs>{#vNm&y2rs(%c$>WvPxCHHS@3dwXMOaH(Uynd1A}IjT#tU0~$bfef&9 z)9U|hU*+NQKJOu;rA>Qeq|TQ3++a+YG(YX3(17CYcI%yBy|P%jB%5>Q?PuTAR!+5y zQ}lH_8$%@kLMkiDE1r3mv2PD56eG%N7=-6__N2qUyj1PVV>jbXC5UtGZL>~)fsO`~ zpE>}?gjAvk8boO7EwF$mn6(2EZv-A>&}Jhl?E?Ivy?a;HSmBmP=N9o_{$=kz4Pz8N z%JeSYZdqwzyx$(JAMOAT-Q9CmNHB29KRLcfx|FfYNQ530OxFj)KjQA&`nlh-_r8-{ zDCRPs)Xpr`LX$}ci_<2E|FcJD`gOZZ+}VfztBVBdqvdiN8_*B>iF`<4uEOSqz3Kii zA2DX1svy_#vhLKE1sW7+eMGon*`*Fja*#8Igp-Gp)~}SE4@RW`fC5A$n^oj1yadQ3 zO)AX2%|nCL-05%AgX+tk3I!C!CF#g>lGV5aZ|xWp0IoOyT95H?T(#lbEMo*=5T)fkwV2VLuRfJ5gg`+o+zOtmZn!mX59e+Bqj8Qt`YO#wTC#Q_z zXM$9Ju!OVYqy+P0?_N8tm$j{2kM!H*B);jctyttXyFFy*gZFtYr_q|H*_MP)-*PV# zN?<&u`=Kt9PqYYQ8Z9v3c0ASh3YXxy#+bod(d%l>P(V&=eI35M?jM%j^c2&sRbHKVN;uxwr!WxNC38JPKT@YJezk8n>s%aE_myV1M&BcM z`!1FpJ|mTbT@fZiENZ+F;h4roFzi{ZXUO4fhjH?M?Y9H7fA&i`ckiC1@^8S#Y>tz; z<`;vK%H^z+gMG$IV~5hy6;2?k>ekP6y6%%0^aJS*?z!u;sXZ|9bmbN61m8}T<)*q{ z6_qgIW%gk)0!e))Nd7}DEI}_Eiv$hEt>fAgy{ttezD%q3kDKGkFy1A7rcA&_4S0Pl zLTL_-w7!QLv0KqrF?a)FIx??`LX2;AC@b(<9Z@ZX_=uNT1;XnHt) z@y}W#Ko~C_7l~Y;eUF@h6HZqjYw@4qJAsYO{V=R4WHj17C!ibi^(>YAbO{s?`PY7? zR|X#unn@l3mFyvQ@Kh6|nj|(SPnaY#hAI{AWK>r*Bd=Gs<+1@4O9u0~HdomIp zQLPb>Wzo)4IHWsU9Y62PV;{XSR<#z6U@0Dl94nJb4q|2-N52)GDjOmVC-+PcAzN5u z#UTu_5fAsY-q^9D1lj_VhX$|4f1xZ#;OsjokO7A^VLb4f{!U7~b&s;+6z8V1xa8iL zqoAK$N0HlCNq=VNF4tA|f$sqkCIXy8>Qq-lbekc+6ui`YXdKoFiDL$i1fNXDvmLA$ z0+6Z=B)t)~{RFcLpZUjz)Ld;m+z`x4a*+#byoL|#S=326kuN;cv3(@-x!Zvlou#1+ z0y)S-abQv8MCgxI4UESH3p=JmwZ&z1pQ$2JNd_v{0 zFUKhEl|3xKy5MdOKP1_FBY)3_lpW58&|3YY(+28vIl#0|x72NlF4f`a`jDT?v8aP1 zdnf{#Oi;ci6bMxPpZwYv-tc7#!;tje+_zG*`())yp-`obS*~lR$V2=?bn-JEnGGaO zOOWel;p_;*rhVzY+2(q3%-{rx&2pZ1^ zJ7NTO#1X#9f}pyW33;Qk{xZ8X&xFtp1~W1wXwU!zGcsLN<$aPm@!CQKU*A5ic=iH< zz9?)q>;H8G@@Swo#sog&&{Kyw;XDhEk{hT@X|i-(Z<$hh>{uYDE#^{j-GwL2BA*qy ztjS6e@CR>v?jJ)nIE}x(g;`VMSy_t>6n!(MZyzwlt2#EvJ}h*_fQ)}rpxSzxx4KrP zZ?h_n`ohqN>_=tKn$X=m7It#7*a!Em{Qk2Nv1Jkjsf5V{sWwfZmG~%zXjYxDx zPdQ{VJ|zg^V9jQ6O)jq6t&Mvz&BbNMvXbRF^XRjl1fa?Ce37PILNPKyvUANdSK5kN zj6PCvaiJ>X{_PB+0%MqBLB?zRg|eDH)bZjn_Kj1?_l81}ChTe-_6PIh6fFhzq_MKe ztJ~|R-&S1FJ$?7wGJ?BXjUvb#Gu*1m)*H<0knB^--m%~I_RyJz}T*o0ArgmJ*&e5&XO~T%1y|@So3RCJ7nQ&sT)T&*Zw?&s+#qyu_+Kk zTQ%JFKI`2HgL4QTDuGy7fgK^-929~_FkHo5GsB9t#u?m(d3R-4O~xKU-k1q zx5aGo7+dtYoq8@51-7-Nlg-zsrLrL2mOa%a-)@jAnNmEO>a+563s z4|kvDubBiJ&6q%}uQ`UcG6ac4K8myzrXH z4|#b(D!xq;EEWF5VYBO1Bw(8A2M=i)y+BYhXfS|*x%-94n4n`It8Glw?XKk^CoUqf ztaX@9K3XD_zE?&d2lWM$8fON{R9w@Z>L9hHXu&Wx%^G1|cxD2|B z3r6T*{_iI1xScXMWgcMSqLPPHByAiAKRjtYxzI8haUv4^2wL}?8fUgAXz`j8Au<~P zFy6r@#j(N%bc$sJ$}a?&&6BS%R1ILfy8pA@d%t+~RjIq#Hm3w}qH`L(B~VZRX8uBt zH!`yF1R*zP&}yvHt~M z9p67!U=D<8%J;0VOn>f{ou8)dN!vz*93ED*-K0F*NE)KTLST}h2f?8R6sZ%eND!U{ ztbjgW1pp1#ivWhKI&m_td7K&7*z$3a`-KVZ9n2U0b$;7BZ`)=*p*%C`khlxgAnB5M)xg9a!tuJBT&0^Sx5@%b<7AxH- zz7;!(Cbz2~LZRG*qPKw;OUr8d*H&-IZm{s6&n)R!$qTcs)XLzTU*VS42c}IEuvYza zj@y3fbS#N4-W5dwnxkWO0*s!F)3Yvpl<>EdGNy{2f641eUmz9PSilb2ZlIH=Q#wo_`Ukub&rj^1U` z8%C%e>nb2{FUWByo=KDLbW2IlyJlxyz9nRXei`VSY)I$Kt*i=*FMjr>>|T=e#taSh zO_H0>zU=ku+fT(kROMZkvpU)>P#7e45h*ZQaNGV#fz-y?n=~`qY-N*5)WM3w7EXNP z;yioS504W%Rj(x7DxZ=4`6A8Jx>-IQ6OMx`*@OKaN8j+h4j&K|W3}@2J zO7f(Z6|A-DP_##wnnjH4EWT_y>{X{{Uw>!IBGi~Mk8}$Tv)N=qw10C=0zXYC0 zG7gx~Oa{ah7?S?us6yH&U=-rK(gzpUe?^viAhI-Yp2?=>ItFSbLz(sQdc?n`_pgoAm&q0l zx0&0#z5Ma+T`dNc1+po|zwJhlK4xCymt&rJ^=|Q=X<5tkvf+%Qq@95mCH}i0Oq9t!J94M@%cHaB`3VV8JY{#^&;=%B@OP&^0@A!QuUYP1m>WTca zB~|fp)D4g z`eArlvfhc8mW!d%kxqaw1AK+61lxuO^`f$L2A&E@I1{4!=DpmIY|48@)mLu@M+@mh zEz}Cx_y(!iHsFVM!sjCn1Hc-9cj$claqQfu>3q4X<^2i$RzqGf6qT%;r**&Uc0l)# zm?&_jJ^T=ULs_62&dI}>Hhx+tTTP{W`k}PvsOF2CVa5B#uqeW*K4sWMMM;pfnk%!z zG@pO+rE?8!I?r4ks1ZDm8=gWjESRKfK2>xqEzysEe)IN^?|%G|`H&l-Yse}i zXW2}^ahtvL(e^q!JLbb-bb{=vL%;8>8J2Ufn_eBhL_(@#BT~;-9qarWn-RN(;ll|lL%c3d^_Br-=KK7y}UrzgxeP?kvA~hI=(i#$-T?cB3hYNHhwZ+{TIx8>2k-GMaS4c_eh02X~?N| z?0)0W2Z>zG9H*!gL(c^5nI<@norlZ1Ct4u!QgKl__5GW%^70^5KbrDdBgK^tUo9#x z$BgB%9{rY}9Op1`I)XgGy`Cp^FN?s=5e8py?15v%;VmJ`!v;81cA#wUD~xNdb%1A3 zHY#3vpg}p;wZifngTm&A(E!85>5;A_RhV~gR?pMnZ0|WF|{sQg<-6wz(Gd;{JO_B`V7wRx+mf;yYXj( ziM&^zp3p-#a4r}ha||N-)__|Hz3L$ac#0&b>0^D%ENM-`()`cTM2qqhx3xT|u0Wlz zq??QnRq0?G(jal;I5Vb=OJKaXi_4d)%EFo|uNCQ&wemQ6J*Z+k4oRUwtFS32i&hc;XZfW!3GDgJ}dC;$VLltQ`8xTqXfJaz)qcjVeQKQfSdqj zQ8*N2Jb{2Mj={l!u-^PLEA zW+uIIDnX03FXa66IzX_KS%H#Lpg9$UNcX#5hpWVtVW^@7VrCK>6)Rtde$&qifmVGB zyy)U%Yx_u6D&s!KAf^nmAmjsyrifzL&m4r;|4drHi{fA+B9-b}xrA z%g^yH`l`^Qf!T);9nUK1`#@PND!dr{j~gd))*gDb2RzH){=!-&@*&rKBGk8F=OViJ zzjP z`fmlPii;ZSO0d>PPpM>;HOB}}7QCbi^VU1I zoVIczFzQVSwY4W&wBmlNNP^HI2riKtV$GMQnk4d z6;T4WMk9Qax*yCrJ_G7K>>&VktHmG)yN^NHf=ZXMBs1+wm+s#juHtyg{Mel)`XjGS zr&))xyBbVSZ(q&V$0U4n!7Kl=ZPis$sSmzjOkPBou{U+PZt_L7ewWjpHV+TTrkZ}L zPZs%5wqmhN%u|xz{7K3^^n;R!5G`%Pb2#?e0uE3YO~5{&4Hu=U(s<0UL1aT^PRvTj zc0%oiUUTyGmqjlM=BRjL`=6s0*YN?VyxNVcm4W_dX?`h}+wAOi?^~voPuGgZVAsO8 z0Q&J=HtpZE1O$LluWRmx_-g)5M}effl*SgK%VsQae_v}A1;W#k3(C8 zHPuS?%cNbOeMDPP-K6VYPDk>chWCBz-<~ZxZTZ@3849RCRZ2EgO21& zOxo1FqzPWB%cXsHP_AZ6w(;~I)gdU>qj8`lSSavzx3WDr#TdY=WEARmGFENl0d2VI zH+?_5_{kbi%LrZRmnXM(1#T7$V2bbSE-;+7)c(vT*dsQybERvGR>}6}8}rBaG|4x) z1VW_5T~b$9kJ<8D-C#d!sHWSZ@4pDhZ2feZnB$-b2Ow%n^sDrn>stX_Hh1G&-MPfT z{@Tpdeg&~3a^f3k#`OZdP22`!Ouje4jRuVP@Xd^dU-x;Q?-Rh$&<*)KWGbPNG2u8` z`ZDx=-ujc_?TyYm=)8=F!E~+o7)5OYr7#X18|YA$(rQ+aT#|tG*bc?{+D;gPOag*bz{CfgE{`OWm;d(cBrheFoEzS-ZzxZDOg& z;15yV1V}h8W#}~+Fm_5miXBm`i}KokDQKW$t6f$5u<@uJCscIPCUuA2v~}!gicW1T zoMrLMnw!A;{2^xDt09yQWYed&BpC3tXuRI!vbY`kYVYmPL(11A@h+F(i&MOL?an{P z!(r=sf&W0JnT(vUqR6OLeDh}9{t|*9P`MT{P9;-EfotKl+c)Z+zt5i_`GjLckB;Fz zg?~Z*lqKW&WciX`$&w<={CTouy|94?Izx~F}xB>}w2>K!Jfo;xnYYej3=sH(W!`CY;V+2-GY zv#MQm+45qKXw|9d^3o(9ZE5|A>;7R~{V#&0q2fP{R{q~4x&Qdv+^49)2-iP`_7sRv z3JT0jfeEQ>MPPxkBD>l_M)s=18$uv|~3>AszK<+6wMmFy=u>uTF<64~dkdzt& zlpYjBLO=;=22@%=x-4*cMO(PQ1I>B;GwilVEMcqW%AWGU4>AmHd5*k~psxZIjlOW@1)MKD$QZXV&{y9+m z{~0LmzYmmmdsWKt>rk}o#Q=g3-Tl`H!gk-HbFqPn;QEc5bHRY)ZY!FaJRXH_O+B?A z`N6*%^d8*N-4TtIR&+n^6f)f{Db8wLoP^1Qdb+x+DcOCw7fuDy zX5o=I%z%El{55;QllUZVAt|_`Phm;1q2lOE-mC;j;6=i6V;pY!`^lDO^E-5B8P$Sn zR7>K|DOX(5WHK{IvT`VQ*Dx%G0IJB016izVnm_g1_2^<6Gjj84|(zFWw3?c~ctxBj+9PPK}n2+;abCpXHG7#wgB2+4p3 zNw#yzylD4s@uFP>XC2R66v%uZ0NOHrH^@yJ2nt#RE`mI%5k?VWieaM$vkzotzo*|t zuoFJq2$+*ngs?yx8A55e0lqO}tvge%B3&m#Tp)qF&hZxDEv@ZLr6K>C%nWFb z&)=(rPCTW%$N4b(*f<8{uQF9bw~Abg0E|`1ip0Fzjl=A%*>48Ohe!Iw%?ncBk`qpcA6r@8~WQO z@IS@S2C&Wy!VCT6pLMx!`L-Q3hE3cKwpEY%Oof~)tKC{*YUSbMSs2*pFN_@O5}Am8 zW9|2QG;^8=#744PFaAP;gS3n-D{haY|G6a(6gTwjjhjfz$y%$2IC86l`-1j-Tz^jn z6XpTOLcoQ+ZIG~aITEqnG+DkTIbQY$1bz`(2wI*2o~%O?NI(tKkd%9 zo*dE>cZ@4E=>>z}^g^4NSTC9yA}Dr}0hJp=t`O$g{{i6|2B4kkc#A=R4Ln>_e!UBO z`}-u74dYyoB*PoqB7;$!BdwM+@tbZyq-=mZdRfvdI^KF?jtzyMTJJJeyOWD|HJn++ zP_`gz5b}y+oqKX$W3yW~e%mJ7BZjruwIKaMg=isSowEE}tl zcMe@HrSkbvF~=WB-9zFSDk8nbGhO!kf4qyr6~$TS2%?S9HZ3ZdoPXUcs^&4tG(ujJ z6Lo_0$DU@Lxq>a4zK;A=uvfs*i=8aQAxERnooTL1YIyvnKR1RI1sEoJ`@wVmA5 z<9~J|X`lBy@?XC%9O{bg_$=KV6Q~jNh@+FEY4>H;QH0Po9cCAnG^-3?@!DOTxKg#r zKE1Neh+ax!!(sCC{^U^BQvJRE=~eLm7t9Fl8g*_en`tJ!fpw2v6{HW_Cf44M6gMW2 zWAHD2X~n>JX4W>A=x$-MBtwYPn9D?h4#!Gt&^Wxb%~ol6SZIR#SMLD@KG4!~r1MG%IIqXJBWmklVa%Dwhlbo&UeFhyWHpiKf zRDKFp#qL=BO-)VfYo2ek;9rI84E<9)N486gxe07ajNgZ2BB7M;^QUGqs_Q-*39-C6 z`4l1_E3p{u>tju75{}YQ_DCYH9Gm*kdr#$tB+t+4i1FCAZQR^vGPeWp#(Y;tMz_{W zY3Tlxzz`-jaXg}SK9bX3w)I|7Rv#}AYCdHTN?;cHiRcK;xOh6|UQ#N!B(fLmCrb z1*z12?#u{~&+QQm!7dmUl%Q3M3slSz!PbQ65M>sWztv$A1$ZLd%C~*D#^Tut>q)mHgxe z#=UV{`13C$i=LBRyS<#Sktc=BaDNukWokzk(bcIFZ{kD%P*VU4skLx zVIdkxq_5nFI9d_YK6kuc40>6D#0^10FHakkEQH%1e4W_A;{iO!EdfG#0P_n@&}+wO!n2zWVgFWH;TVppmgguTt+_txh;O8qr*97~z_01=iBzKi3j7Dv7Wu z2V&oJ(+fY_4XQfA>GaNamMhbpS%8OwE)Zfu%mG`B3ILifYPVr}n40_8JocNq4gPHvcO?My1g(AU;d>7E-AqPx|(G?PsPwq?f?6=N6zS$r6qqa2hU?# zApijJ*c-~iE#`@rQ#o|kuTYiRm;l?sTCrLCC6`!MRE8=h4-L)Os^Ie=`%jgYIDshYZ=Z_!db z_=L=_h+)dQYhVkeh=Oa3qya4!3r>xWt@(P&%o(>oXByD_zb9Hw)j^pWa(n=gDU#hA z2@4#EI&T)e8m1cO80^UHvM#D+VvYh_ii+3EFv>|Zw}kggENw{f@RLWCiwZv?2~`QV zBxsW3f7yJT)tB)bdbA_p1jsZb`$;;MhN%PGFrySf6u?;l-{!WK`|k&emdlm=xVdp> z>b;Y>>`@>x{(4Y94+7j8107K+oft(v>qx9A0IVP`!tjUKn`JU9PxK*Rw@!w~ zG-MOLM8)&O5n%+2gLFVTbq~C`mny?{=au}M zr-~CZ?U4Ye6|D>oylcJoRodpGLLxG#}8L_fVw7{Gy zW#M~+Fh%X?He+;U_ez~o@Eu!H`3wv_OiIBp6^mKdVEB*$@O8>!y@`WR$lozOR2I()f zMLM+!+++w)^Xr2y@tG0{(J+&mq z*-~UydYG;9o&;oJ?G(PyTy1c|_KUOM zjnI+;_4Kho6<-TMm5nt%%8HOcoPn+E;u6>zg!&xcPdMv_g{aVLs<| zF`a7VtLVFZqqAo-n9TY@7?DU_$MMl^4w^$Hp77I99XVsvQ%fFWo5yE z0tqs_1b5243hDQGYgI{@>l2yDwcjcE$uJ-pq@$$FvdOe^ea@%pkRV1vmbK6C>;)@~ ziK8%?=;9cNq$y8WCOl>cFH<+(W-G04E`~!lVUxA>ybs!}UBE@}4~P(ky{(aAjEVZ} zzCE_r{~W=!)U!EMW{(#GI~onOqRf+1Y%g@b+#lgq&2|^bJDyjBB;ABf(eOz{nuQ(P zp`G9f)>`ALc?FV6BD~9+BTlP}oP#P-l$me;zl2EdaI14l?&|EW=DQaT*k57`nV>xR zx@}Mp&Pe#F#DhOqRaG^h7@bO)*OFqw+J8LXrOW!Emi*QKDnTuJA9ckN^?p68TC2Kz z;xi-mhGPK38o!BV{TY1>d$UNqP(cD^jS2*ne=MB-x!ew#UZa(UrmF2 z(7@R@sEMBH$DEo7-AEDg`ts`fv7$`hMJ9LA$uEgq(!*CgO-sCW227r<>r!SJY$jdZ zRFiyhZ{;yf*(@*PL_cjlzQ6ZS`YUoa8(r<6zhKJb#g1;3DvC@d#$R59dpT3v+WSgw zIvO<8YfdRfp=l!N=dUWR zs916tAxNa-e6dmBY|Kim4qg-^B)U!lcN Cz8)(o{VILD0LwVVe9zn>8gpt^r8@$ zn^yJ9&9a3{^ZK8$)FlR{{i(NgXguF81?nU!xS`&#`MtW&ui5Qwp2ijBO-_dbEY;ze)OO}ztS7@rW6y~|5mwz|kKTMbYPU?!*pnKW1`|b2pFJgl5We+KhYe+oviw;BV zXxdsr?oRGRuBfrNSjX@0+o$_fjE`N9VynON4S`t;vGNI3=bnlHSsWx}$Ks)^?Y}ey^1qS7i?z;%;B4BrJ5HWz z&DQ=ybOf2J*tH8eBoW;CSuawcuO|=Wq7Nf`mPfDLw^CVvQUOyx0|d}R0Ca%(wD9i| z+0Pl!z(eR|bdcN^M1#Vk(W3460HC)u=o&zl~p zkuiv)2Kl|Y;fecdoNceKTpu(YkMQ|_`@|6(6)u-vR>+!{frT8nx>Q9&s)l0a)V{7I zqrW+I@{Nqe`ig%-+bnaF0*wecpNPWzRZExg2YQQ3iQAN;JEB*Vq+X@dJWm3;z&Loo zZEpu!3;MfpPt{(PJ$No*{H~eNwUn6h!1dpykS4#;8Ml|2i|{KO4{coYEp!u7KSvjH zwikB16C;o<(B;MiIRO;y6kMhrQ69oNn@;Xj0jU5K8(_rsFZ;$#?sKANgme5s?#pnJ zjbjI0Lv)yYRZZ}AESnvZ=HqoqA|SFN>Kuk1s|05*BR%lNya0q0yRzr{S79)=zd z_pgLzPNoAuteF;xhmSBg`+ch$cX-&_AOz5S=PExPBQzk%#2PicY5 zaOnAkVltB$Rm}Ue@%v6=_s7W@1K{hM3xbHO`&_LD> ze&M;5jH`dCPH)w%ep>d;3DB(E$-1|L)&8M?QmGDj1S>2Wbbu8#*c~(oZ0p zunVhNKg0qS0DP0EV}FoM#uS2E)7Oi)lsh#z%8w1r%a3kz4?iT{w&CfbIBcF$;#hoO z^gBXa=-)Sg>)&hs_Z2{6)R|V1r3JCIkx1*N06^79}dW)faGjT1Bk$GM0|Y5$+wYxwaDt#F!|555xV8vu?Boj zcU|=@fk++P7zIScg(XF+XAo_9RUot1-Ifwx%`Ax0=cg zP5E|%pS^nE$A(sJDJv*qIyyJYjQB!U)%9Su2|T!ROKsjzcv=VlX0`OOm~d~WZv9x9 ze!B}jv%!RuT9j=(_V!F(U0)+WdPG$^T0Z<%v~E5*RiHMtw)X`jryy8tXt&< z1x#6}Z*}J|4;bzq_6Irh#cf;cz|NI5_(0bWbm3Tg`R!;IwC)zq%ap zto`vfjP$#6l`d8Fdkm0A7HAH4l_zAt`|`Y@Ao z6pZsvI9U*AeM{}^W!blSOteksxidDQAN^4)u1$-!=5oL@@B8eO9`W}>OL=V# zPHipL)k?#iYE)IW$Bpd^&|w}nULfs= zr6?N;r2UCAp|Ik|$R*D{`R~O$oZF!SkFNYs&Reaax46?s^LZ6Rp7Y3NuP5FedA(uy zkkwi5PEAnwZjVR)L5YI?*kLcHv>EB31Ql2WE<{Xa-E>0>ma}#{&$}mvesxweB6XXV zOHT-=k>igsg^f9uW6ho#EXmvBnaxV!tR~)Jp_a!Rqisf45L2N!4Rs=dum>UHFOLN` zEY zgrkzj`6F+~m%+5u$2ou6Y0t?Z%_v8W9Hjc8CNr9ZVa|H9_ouvL?YMom=UIh1#H_~O zAXf~7&R4O{2<;)x!}wsO{y-l2&z^^r^KgU_Q3`$b@SZ5zlbx!vfTLYt)xNtJ9s7hd zf|qUODufZ6fP<1QFH)b4mTV^A2e*gGap!|il?EJ7P2P@55BsNP*!y~WZ+P)9rq>|z zSd`}?S+M39j-Hib;erJAh{lprrtfQ6#7f1wmUll_7Ofw++p-LE=F|T=5Kb^U{hYmA(?VIe* zbT`8y-u$3cqAX^0WIM+($t~gSX)H%1Y8->qMUL}gwn|6fE0pGcK=jqXsYBW7w-$Lj zM@X(`Y-Xp^K>@0iZJg!#Q@6yZZK^-_g)@Cayr;^D_;ba!bjhjO&>t1^H^Qi=#=39F zsV~mfvK=sdthFBrw?v2=DfU~F-eIqO{C?boLSZSt^R4)FloEOp=;={)wT^YGLPI*fWbn%|?k*J12$cl2CBa`dLb`vvd(md=dH)*DY3&&KJF?j#OR}QOomEhQ z;Gpf>?8y8LdMpEhJ`))?<79G-{rI`8)RIQupvC3|H-4nK_V}cHTazkD7jllFVo1B5 z+HRg>risUvR&T?<3%7#z>F|f4gNo1PCN)|taz4htqUz_GRy6J)rbDDkGVi2-Q<%7- z%rtKHGIAvE96`;0H?v4BabfOI51c(iyg5+Q;ya)vPDwW}9<)IXO@Fx?0rU zsosfHK2AuL!+2o%vpA$<;yBnp-d9K=?n_swJ#!j==(;rXl;H4w&F2w3-`VBEB<2l99-;BozT*%&4681Fp z&~!=nevz*~KPj!a)y_Uc;@48_~MuG%ooXXpKI!6=WLV|+>Dvs6{<{3&Wp;Z zk0@o@G<}{_o_?=3O`9DPn&a;kC6!)~@uItb3e&Bw@KI$>Z+kHz<6L0j5^Er;>E{Xm zTx8qJNEWTp0TqITGf0*+$=1g1KMi%4zj-Gfh@xKvlZpjXV-Vk7yvQ=-;o<+D0)6|# z;lXOw0~eBUD79!LkH~n=x=XRy2c56qCd#X9<&;QWRQj zqyN@v{DoVX%%YWBUB`J04A4mV>gwnpKazU{T*R|u;*7+720g@+vbJ>DEt73hL*?vl zIah+lDz4;8gS_99RL!MRfr^MMNt@ew%|b#mAALn{E^zVUwXcU$7d z)=Fte<2}@!sJ2v>v5_{K;)Z%xD%s42n5)u2vA3X^i{Ud5N3OMAz&Y0doYS)pzk+ZT zXC5!*4{HnIvYr1H^8$}i5Z6~utib|zPMo0iW;kD}A@X`h^32%&hsP`*Km5o7l8ui~ z7p_leuC;G-DD5`+-W|ojbEh_F{06RZj-?Y%_fS+4k^9myEb}j73DNJ1-H3a3=H)BP z5^S?|=w>>8IuJl;wY5Am+@{sg-38qK7#Ygq#`ipY+gxc8bah$OR9xR4Y=Hvar)hjB z_28kVkcvcUJe~?n_SJRi&6d)fL+Ipwi{?e0j^P&mQosyB8V?Ue`pMe15noz7&XIXb z)XAMjkdBqwoxdG7(>HHP|J!R`l;e_Z#e&#HtwKgw0$>{GW~IMLl0rJhs4_^93{C$j zwf0KAa7+njU__<)vqa?UZj?>ehp}wArRq}((Iqh*l!|0rYOFw;EyBs>y&evhlwjaF z`ucKqNr?#7*@@pO3$KL#tDM6f-pQ7;>r{abh;6CN#++=_l& zuqn=p!qAup^OF=CDO=oesTgHJ1c%{7%L_3vm9={YMT%2fG>SEpSAVy)`+(4%;=3_? zJN$aA(hvS-1orZXIN65HGL&4w**^c#)}{75;qDugzX*F5pl4b9OsYU@Yh1=PlFz^yrIaB%`n88|flYGBMq{ zvf|PXaSJ#OsW?|1owlM`&2hDrW#I^`VSXg@*iSa^@BZT)8*sEa9EAPB$9iCOgD0sC zMEa&t4rj)xfI_AzJt^LfQa;lglGV6-dtqJ2$KhQ=qI}pOZ)n|;lt?<5TpIKXyh#azTP1#Nta?~`rFF8~ZaZ}e@S?*J# z+YS@a_``0tXX?8GxS^Xq+?Kko0T>+d+{JV8aoN!uK+IH*)|`8m^GU)9sF|osp}X+5 zS;SXOEtgY`its|`+g+=x0w&S-AyX}Nv$!2o=^ctHUa%#>Vw;1>m|RPz1B)NCR9($3 zFQN=tar>MGsL*N4T3`I^u5RwNGOtI`&dc}oXkQ}Y>|(0$1}X$1nK%1@3uy!?x*xg; zoxESuh=W#>_fwQ6nKk%Wt|kn$)T%uK5TxtK?P_kcMH7_?{P_^__jCJ-zXsVOQwxw@ zuQ#E&!M_M8y^j9D*9iT75G?wDX+3&I;uoKX39VU-KZJw`6-(%7II@uHu+`>63h2M~ z5H2pj{%OYt^vnJpt8P?PtJuxXs>CGW;`Re&1g*5+l$45}gWN^XLoB3&$yHmDYN*UC zvC?u`oijGBu8V!b%uR?FVXp^DoseW=<{=R~pvq@>8gu%`w~Br*y{KpCE>epJyCyo6C%qtB>#_ z&M0E%9&On;pa^aS-L<4Hz1DdNnf}b!1tDU^m)S=4dVCWHdA1n!D;j6;qU`2P8cc(wob!+js|!_ z zyI;l0P~9Zfx!+01cm=78Duhl!+pBaVit7_~@5{Y>V*E)ingn8h)?beE3;vHNREDs$ zF+tE*nW+-{Mm*w3?zuP8TE$3 z={2(ROL9M8IEDmzor~q0?wNG^!{^{`SZx@nQ_zzuW!YPN)OkSBcT*7g}uA^0E zoaqcMcaxLV+V?v5tQU#6ZVjLwqPmN=G*;tc1+o+piCL@}D5^N#=Nn8!KBB`x9~P8( z@$bG-i2A9Wa%>(mk^XI5!dV1oY!BxThz&m9=BdRN(i*;f{*fb$>Vi z9ZS_GPn~B!45{Dxyoov0ywR}0Q74<`E!H<`#bd%mPIy>?-tu_1l{Xc2X2q6kG)!oq zGy-OV8~t6nSp8QGSE`6*=E9dtm+_uQe(%|oJ@Sa1dGsw@HilY>_|rkD5$Z54MubfH zX+wp(PMPR~uI#w;1;Q;ulY-{8sWRME<+n)PgY|)T`ukfgQw)a-P)aBz+KS^H(U~=@ zwnpWALC`Lf4(kjJFAp&@8-1=it!16z3~}OL0kOEEazxae{{2J7CbjG2(?RS=(Ws8b z;8I$i<__17M;=+z{2BwjyUD?8h@z|gs;vrVpH*^M zyAzdP@?mG7_4?C}m*qOV`!-2-a0vv5LHgtJVTN&~E9IY~1!VTG;0$mY!40VbNp*Bx^>Q;9?s_;FmRMwo2W|oKC(dO@j)>ZUjnth zC);{SPR{5R0j~iYH5LD)3~Av)mXa==a~W6QLk*_=I4%R^)Kk* zQBuiV0`U?F?4zm@QIYJK8uxpH4>q4AVAW&X5VCK6SVyNHh1jiHX^=YT7g)`nVx{V( z@f*zvea1)jd4cD(aseO-r=(~KcAzxNbO-RY3S)GYuHIx{=p%K#E=dO;)W&dKS7s>Q zWeQ6g=%UJNjkV#QTxL9dmLxTs?F5PlEfQTPu_W;ZgYbOgywUor#=l@Jtza!=F8UBYrS?p7);b3Iisz zVrl!OCspk5JnIM>C!^@=kxNy@2U{XC+;#|xr_uuKz7{nj+uU^gef18X!!Pxw5LYi2 z773KCjyJ{dv<0Xax8vR8s$2;U+k(YJc^QAaW~Z6?)bTuo`aZn zo0y(zC7i%@x415Dr%&pkrFI^a^9N+$4eYr6?!Uh>WjoysE?#F!Dc8pIUGfc+SFwH{ zH|jV69`45#m(NxFyh@H%CRROPsF`xDODUrCMpNZ}eHC*d@@6Kizu_UPiQk<_sxdyp z&@71h&19Rjj0^+4?6>R6D(J(KaHVTG7Lxm(LuZlJ54lpQ`y9?bpAGf(E$7{UA9xCI zVy7X5KlF=NbNG*PjwV}vbqT7xem&Jd%uTw!TlwRQDsswLW<^oQ8>SRfB^Hmj411-; zuYZH9wn8rJW2C@k$+;9*zS^VlBt5w@oRFms>7V{7#~2Rd%&PLL@<)lg+44%VQXN)S zhZY_7ej4!^h-d&)yE1x}_^S3jq`R)6&?CEB9we z4;QdL6<>68P2n5kadm{ww{K&M2(-_6B!EVHgsWm9*0{f4p=)F{QFa1fV_kM&4kNfV zK>0pmE+E$|-%+E{MnExn`-Nrl{rjQzDba8)M-5JEu3YE3n(D_Kq=nJ~HiVze17NT3 zjunU4R3I*^3iQ;*zZi;-nQ`IQdYYQ$2jva^ae~}R$yiKUmlZr-9uD}hPguBjQ(aF{ zK(@X%MuDeI`lwgr`d3K0sze@V#rwdk?)eDDx5n_>HWRPZDQzEg>|}|t+xW;vrXB6= zOfvRb<5dzqHAzXFA{?uku=({I_}#}c-RXJyGL}-rpsENFzl`S>#E2RzxvCnOt)!^% zh<00iQ_Q{C(9NVGVQj@ufoSNl&o8=bBv(9M_dkeiPNH}zxb+LwFx#U~KU@R5 zx*%5*wziUgWQH0zERAb7uyU5%-lKf+p7ipI*olsZC)RFa${GBFZdPnvbv3o7yh+-$ zCO2SpR9$z=m{VMsPrr|%ooBBrFO9sk1B!wkr-1)z0IB-mYd^09&W65nL?ep@_EPP$c z)fKU^cdoVpk9$cvveR%FUnid^EP(c-IT)GB+EH#`DWhiz_%X&O)P@8~_}=%u>=$wW zfbc4X0B;eH&8g!o;2t@k>|uM?K%#O0WG287vbTNy;2Ox+E?zcZ+}2tckzFGfiERrv zmc6o=YrAyYr1nd7=+c~IeBw>=a4|_b8puhCPrna0E^G>P(#C=)8ZnmUzmTf1(4W_M zA4PGLr0c{w$fxVc+oP*QfLjpmv2P>=944$sN}ZL1u1{?ox!!aobG&?2uWeWeR7XOR zA#0!<$%31B*0M@-BXB4bnx@jUix6m&zh8j=nlAb{7nLYS;qm4$J5rqEqKeFkhoo0lGHCuwVGwwAOxk=uOHAS}0E9t;V2^S=$17JpI|tvMHm~uTrEXL}y*EMb5-mwF zlXB!`6GS0emnb3lMA8*vdbE~&N-1i$D95b5jN%I4S;5z63{Sk90eL8w0ZqRU0eS)2 zMUwM6xN<3g%kS1Y6mQ*CoObtRQr4X4pDMsda*rI8@q9f`HP4M_(M_$IH&u1#+=Aq* zs>2tTl8^YD#ot_yk)SdZM8D5+BR(CTRxfW#EitjYGWFp;gzk##{Zbb6JCuJbmUmZw zN<7^%U&>)$hS4*4kc(nvk1l=qBYK_!R4*R9k0R*+MonWoadID{%8RVEuTXuIV0PhO z(Zb$95hPfR>qZ9U>rCepn^jl1joi(>hYwL3SyM2OA6t@ek>U}-zYuOgTN>lw=wSD#$2->{bJ?3C3ZO3S?4HF}2$9fCOMMF6nQJlUpL6yZ%-P}Q6PG$Yz4}bKpYr~p zkkhOdBdT&J^%iP<$~iHIzBQ}bGk8din8%%5dBdRMyiR{3NpoFY^i#c++`_eN((!&c zz8CKj8OM@TMSoW2<^{=|)K^{MBq6`cBSCpk{+U^&JeKDJ|lcXgeh3NC_oa)cdTAvEc%$*r%Bq>xdPrRruH;}}$pBN-e4P-Q~g9RFLlq7Jc^tedAg~!M6p_0OnbK2#;@p^A*Zhv*9_3e|%-AI}$ z9-nmD5((>#B_Xm|;#wik#Z88sirYn{-TeMMPT601?1o;&edz&;7mo#cc%B4>Codv_ z6kOL0J3Qnd_y@#*3w~f=@1f;aubJEz9_xnCkBn z(t3=x&zVMxXqS)P9py{dyPG)7XYuY!O1`& z#ZW08*{|fXq?g;hbx@_s4c~p}^mTuS6oRE|fT8YMAy|9e=hZI?T|$9+rphXCR$c(L zd^o?>jv{u0;d^92xBCrdz-~}aM<;FpadgQ8B&w(FJj031TxaY+Yxv;( z){n?3iPfpuAK);klWcbb>nfmLGG~gm;qjB-S{a@h-FigapqVeQre&Uod2tp>vZNBE z7u_3|e=hBoMNHi>sKhL4It~ONq+3fPokxjborK53%fJb0JaGfxWb9scjNb?S4h06F zPdL?@1hU5z^b_!Sl+s{f{&_;6s)EZEqR6(!lliAR@3d#9=|^3?bNQ?2wF_Y<>g*x1 z3)c|9!l0xJG?0`;ac#~4_)@&i+0ve}y*^1u&iGYVtHsLI=2E5e^ony@sUhdQLq*+= z?v;yT>=|aWz>zLeX$#y@9~L*wvko89_tGOdRgsIU5v@vXEEFpTc-VxcK@1*BI)TsQ z&G_kKDT^idOA5D)3tZ_gz3nH24LACILdgUjisV#`RP;UETYP<+)-yY%i(UzbrPyk7 zAj{}B6EA=HYYl0+6J>}qi?3+ig;*PYKsE+y;V)*r5s9j-u~|~4-b`*!R-kW~nKQok zl@J%=fWuT(%#C4e1%~ofgW9Xz8Vm*^5m9Xd{}t8Vfhlz0|^)$J-&bp@lsgk)YAUaI2=2-WB1^Or71Z9WCagAhbxSz z9=`xhqBvSyArdB(ylEOkR`>-1Y3~0)xqfCrB0=&GB^nNRO_+u;d)vOC=nHxp)2d~4K*4JoKXn)Q%VmtVivc(_+3+tu=bs9`(I#9yj+v2mCcv z9c2@(V~5Gw$>>-bVW80CSp&WT`0JatNSZB+(#vMmroVbm(zd>pDeAr7qouPXMbKGM zQoK+nhvceAxmv&4`ORZFeW;EKyQwyXzVx%1N!m14a3a5%T`xw9Xun&ghBt{>zmER% zr{~1ck~?gOZY;s9GFL*OUN;AyiUO^4_6pnc$<7syF}ClyKUbG0k~PG#DeAxlQz!XC z>-Jwiw{A%?`x2^JBEDfC8YmM6STBZZK1trXhA%jCDb9a8x%SynoXU=r+@54_*@mwl z4k6=^q5H1Yre``HPal(D;Kp*4egF5C6mK3y4|>X5-FF$9mAp`@7Z34o9U=is@zu(D zg|=Iok22!E>fGFkTc^7A=B(IWz@?D9Y(=6kkhJW>=lsh|tdDqyUW<4{8dGk3X{P*k zO;QxWtjeY(O^wI!p}w#kOW#oTZq73>@hb`s{VkLSnmAWPG?QC1Q0%;z{r-zN%WY1M zY^(L7XPc*q?-7Xz5ym|Q+E;Ryud#nRBrWbN7`G!U?^;y|y7o4{h|!q|*s+#-AWye~ zhSvg|sdd#gM^$Bu?KGlKK3~diXJuS~i^%PG^BT0>9J-T2X8)?_XZ$xOtcZ2T36Fo-L$mM9|<6)B9lPR*qy>|CeA3eNdK9Ux(dIZV~$zNe6IJ7^xvlmqe*98_=0OBug* zdN4SzKOnO6u#Yp)7|%PWTk{fKO1|JpZNMhXi1L&-6_A(+Rir#^$`MV#I&-xy`RhOq1ajq~Mz;#I zAm0TYEb{(y|t`>HQE7rfzgAD{^jDkrQwYne?YobQP4lzR5$h&DGU(0nLMkD-Pv!g)o5?a zb&BmXr>#p@mF>=e-aUVhT){0xj(_up&w~Dq?s&k@Wa|$I>=|HeG+Hp$$wv5_Q;JOi zrrzWvZ|PT~o`TZ#qKndX97b3E72Tjvug3*b{2y~lHnkF00w3rbh+a@JO02ka!)n2O zRE&d{p8Fd~`}8&a*`Apj@JkB2k3hc8~*MV=Gaa$_MwbpV~-E*+2m5SK!$T2~@caF{zlb9jr=ojbQpfP`g zA$(Z4ID5fVCb|vT9-uWZKPqd+8N~Gy-j`tbGM)o5ZoDHdf(o(&Wol>`$QLQW2VR~J zNB(D3@`-am(X~DoyW*ndPw_>yxA5*3Htxc{qHvcmu$&Y5)kD0n$YRPTGhe^C(X+13 zG*L&7*(~)n^R5s}{rB>%YZF(x( z7H5-(z-p|RNhWK)R!B?1omxkUNCfmq$-A_>@lS^V^M8z2=|^!G8u4fxgP*lo+aHm; zDID>QcCD_iQqC;lv$W2{HD%mlh*wlhWWq)hj*<@>Q0^C9DEEP6ljx@Z#a0A5?MuKN zpxQ3XL;T$$9A}^a?WkNabV!lLtk)n;>G!PY)o;cd_;*;S#)YDT(fb|r^=ic?*rp%g z?wwB<<@Ev>$ZCQN<@FxObJTH;)`fCPlowNH`+$ryf_P_dNiQtK=2-4tiOz*_g**S) zvy1EAfB(pcqVyh(JY8f`Ni-SM5`jmQqi2eq^|8X*eQ}Dcme^FV%tbZ|P|d2{Wk=1e zpETu3!csk#9~FoOdoVb_pTUL8+_5F~a|61`^ZM9f>)4&AVVk*mrBbo#wO`~Go};R} zn1;)~E^FT2DnPz&6u{f<6OZr_dn!_?F5`MjLy|eI<^3Z3s+(t9rG$>C@~e0Iw-O|x zJ(sJGDap%BlOxmZ&6#6m=(<#rc>|lb{Ppi*I2s=Io2B)fJ*!G3SA7y~rd&n&Q~FB0 z_3XQqezou<_FA#<37xdcXxQ0Hw%n(m#H@=4&OaONma^8NeuZEd%fe80g_94azI;A$ zz+G>%M=upUMh!Q|yPtCQ2zbYFKu3wA3N_}0GtXbfx+I1ljAUeP(CYL+u4xo-9{I_ihw3q<3adJW3a zBk3W&4^WJP_5Q>O36^p#IWRlfdGwQk_Qr#9YxQ3h;pY34tH6jmigNRHBCz%aks81H zDzwl29N2tW+A>?R#H_^B-1{j956RKvDApV+Shk%XW{*Tj$GK+b_<)X*VxKvUFH6L7 z!sT8;NfXObU|+SI7b9#H4d*nfIo3L6wyAp36859s95Q`GhkmO)NgVDe>$@t-Q`U@; zb|CXqTHQ?#p&}cWtjcwHd@hOASTC2RjGjew+3%Bn~YSVktdMRO6jl2;) zbH~Y3xpVtrJva9^45N0(mkd_(^JFr&94^0%hkcn@#t&XYc%TNyi$52#X+BdAzaoRD z_3dFnC7i-Ia)xM_Q~x&m(ItJ8y`0OfSE=vPYUe+4bC=3DTpKio@$G~0r=E?n?5E`R zhh2TPZXZENP~Ppxbj@jBHEh3Zkz~8$nd17jyR!l@Wa#xV<)nB|jHo%!VSd%C4LCxH zKBr0=D^Xwj_#HM}OE0p7&Cf+!fr$9a*^C9>)i(8iZZe@_2eNNl^)udkcQ~{z69>I+`0BG>cv7j33SK9v%bMGD1=fbo*NF7qyGRG6lYmH15HMhfXU4Vn zUgdZ0*yD_G?;Yn4$1o)MGQV$@w>|IkAd7}Fm#S%?%b|=r^MW{u_@&Yt1I41XNfBG^ z;STD1(3(1QW6=)AE34%0?<1RAOI#keH8}!V81tCZlIFq)A8>Mw#J#O$x0V?TDeO0) z&MA|wf+5P)!1loSHk38q1yhald_MWTAhKXO$SkY9Hy$)yKWLXq*&g@Z;m$b9$3;)M@-ep{8)eHIKPY zWr~)xnsQrSyInoA%B*68>fZHYN!8@B@}pgRC6crWyxec zZvJ%(+}HD~uA7bf^@Sce!_1II?;Ib6-r%gNLBf;67pnK^WCaNM#)cKexv2{mXtamqc?>729j`d#YY#6g+g9*%wJOpN0>i^)KCru6` z4|ixA<8Di|c&xDbMDs%4nw_>N{emhlP07MM&?oZyt`laGGo2qSggCf%@Nx1-{2gWr zjoL6Z5&`I`@PB3lCu6exj zp>4|i$X5TLtK&dp4a=vt@YBn2ey&}PKB=;W+|~9Ejjc4OQp{|6y20`Age+Q#mt{G~_Yf9ra zd{~k#J#ECjc(%^iO`4@!(AXzi=ly6)Wv)n_Rj7N-0DasWe19!*$87JQDt7}Vro)~+ zSE*H=8?0uj#@ecY5%7!gC}P`+nyajs=>pJxZsrr)zwPqr9N7mY2E4oPt+4K)c*C-`+#D(RZAb zA-kp*y%PG|Ydm9^mXciWc%LA+o!RTrF^RHm)R-LHFJ8JPG4I$pz;>8J^ZY^MHu(j5 z#JA8pi)q8T5-Isg#FXk{k8jT~bR!Dmin1ZD2|Z1A1I5%1d`ZU_ObqUr*j+t$0Ci=3 zgq31J7Y;d2dK-d<@4nGI_N{rzxi79voowlbP0~R%<1n zZ3>;aob=_E0hIRR$ZL0P2J}2iNjoQT#L?bjLv+CEq}}he;aeC^)l6r_gqN%C?>KS- zC^4bo@`Bo0S3QPKTfFMeooJ`5wU2|yL88A#Dd@^8@-9ST7pSSNKka}$QMiP)i@i80&YmuzX%nvAKhwW?XcgS12s8Q42Ei@h z?dU-QeOQMCfh`9RSS%O2z1KV&E~7BpMB`e@0YKhnss{eY`Zk^?1Cx7<9%4JXBsghtuT8phUeG%~>kYfF zI0RC|=Kw(m=M>1?uPpHZ@hC0$A0z$>%8YK<6rTz4MnDx{3_zB~RmWKf9#3!DMlZi! zUvq2oVYQf~IHYgJ{sz}7P$p>6$Cs88BqpxQapl}w`_9Cs>3c@gD{i!Y|1j!(i0>wa zKDcBY&IR*oUt=$bzKFPHk-{p7-(U7LI?WQ|R+5wclLm z$=T~^yMltWJzmGFa$c9-H(w@j4kK6>KUbwuZ{3DJNtJ4!t!L=q;HnQIR+TRKe{Ck8 znRRFupm&$ZL;KLB%5|O2c9^xarBmN@9Ew1|^AI+prfo!yxOLjww)ZAA_l(gqTzr=` zIWW^f3V~ybaT|KoHHfejn_FsT=g4|iE!9DYCQX8+o(Dy#O*7=O%+f_XExPHtPZibn zUJ`8@RSuQhlVs)E#YY=Ke&5Rofg_xB9LLcns|i0MzWsz`^OHwUCyIXd4S$4P8v zmf zl_*8dH-I?h0($HxB^Z~!W6}qpsab86_W51a_zYI%dir6>XD;MyaK}n_Y0kn zDZ}#?S3^Xxst`MNRc+!co_xne`pq2-Cv?U`FRrB}2?_}GhAFt{5w1Aq@JecVwlSU2 zoSMq`0o4>~>V!n!i>*6rW;?M2WFh`wcXU<1x-vvl9dsxZwVu)TogFl8<{oiwlr96c z=F;k_UQKN?bL3uDp&UC!V4O_Hr9@*kocwiKh7l& zr(5^XH9j_Olbhr#s%pAwYZjz~2eTx6bQ*5?{Qw}S^%YnV7jev>hDBLkFzfK%l$TV) zGO`<>p*u}>G*xMCcDXcXijLhz{iEv?EhmuQbd(eM)lPUu8ImFNyp8 z$x}j?IO@j_W^m$^4xJ)!3?rD)r}ooje%wj%h{b$<{BL~HiuSDy)cYb?kV417Ttg`sNyrd z86wn!g_@O$SK~06H+e$uo^L+Wt$O&zgCd?)0LWC2!t7jFaKu+{LB_`N954zHKvDQN zX&N|ss&me|RVFUYDbM87hZnkyan5?5mT!==8yngt;B;=`-E(GqVE1ZTUfdZ?>dnwJ zPJU~X8tR>{b8&0iB* zRuY<)y*)5>&EWa@q5FbW0M-#&0b){)5rQj*UxWpueQiJa@rVz@4D2 zwr0wO{n-4+Ap+C}K_rCne2N|lC0@chhhC{DGzTj(yNIzS`Sbf8@{k}vMAj-fnx^d> z^2~D!KMehxc^YunBPXBh7fFKQahQ80_8;n#hg)OMX7 zd3&GhB>wwt+)C+OcQWm=1N>6=Pl%(+9Sv3toDH)6^=%Y{|1bZR8@s#2?N!GlBOA-0-?|V755r0YKDrv|l<(cM zy&hv<=ea(A!UB8e!hApb+H{6wU;a85~H)pAsq3buz zFPAp$<3ATW4D)eq-1(iW*Y0p?%t~Y|J=>5Lre^)6+?fB?_Ukc=qSX}qTDB#P8MIrI zTc>R4_@;%HrLs@{lAll1Z}$66r9Y)Gb40%#2X%RZMOFuMU7VBnQdz&{bqOlBHmCRCBluO-`2k@ zxokI#lR@Zdh(&YgRmSy@>Dy$sH*LehQYlk010&9!mt@4gTj>+YfgDfi-jMbCZmp>N%H@^h&p=Wbx;3UlhqLv@XzkGLJj$2Y3m;TRZr08RYnO z&-Sux-rO*EiP-1gmp5N|`ZD3x#eMQ7i-uu>24benV0n*LU@?%js0ACj0sFQN+W`$S zv5027m@eyp1>4a*yYUqtx$D&P2azrM4~+8g77l#a;|6sN!Q_+QAvm+D{7`Y$TrT_1 zCw-SwXpj)WhRUj_{!v+bRi4<#0&XSZChqR3@5}F%3B;=NE6vR=HQyLu!Sar8}r zd2&ruH9+t+o>@$Tvw~ecYJ0@#PV4!OJx0wQOFG2e5})etx|Na6Tlx1#%3tZfT}0GA zkTJZTi7oEFT3}jRt!e(A@*8nDv!QLHZ7{%tN9U89bg8GpEw{q0!*R}3uHR%!?9D$3 z#A)zBj6Pfe9$#4Y7Z*$6AJ$$3T)b>qfZ#Nd7w>L};|u4h7+t0na~EuUc;K6LLL?(y z+ZS~ad|n5zVo>t^Vu$R~Up(YtS`joWv6RbsZe6|?BGVf@5_2bNF|&nY#tEFW;ChzP0ZKjeCo8R zA1}SAH1|dC7~Ux!A1ZU4JMa@?E5|%}cu3{S9=uJ@l~823a0+4WdgZfF>7wP1h72&* zam!QYw>=yOGBe#1({GPw_w|*pS1&LkZhE7XbCtxlZC%;Se0^fdrN}eLatnS08dkGR~_pSX&~$)OUvEp@#Q-GT>eb4c>!#CBQL9TNy+n!up>sLKi?oc5j+P+4}D>Nb5_ATk~ zT&>k6W_Ow2kH0Jsa+iA(d_=QIKl!2un0Ykr_n(ky6GWj?p;O1sk0i1&sjvRFjeX7M z@NG8y*DhJTc4npuJ(_y(T3{?j|L~Ekly4^_)SXJ)D4%kC+;_}m{KR+m}m~3S1-d$%*kfc zcYG}5YpF4ab2v`l#xX?zuL3Sc=R~2N{+y)j>V zu+rJS{`!5@3oJ&N+Ism0@}qVE>ixM_sviMoJY>4`i3MBz`;={#ZIv-t$~Hr?KrJ_C z6RjWP_lQb!QJ%}&g$}3VcW#RYh8Cje#+&JUGDeqDKA6sTWG0X5KIL30kDtu0z{{f> zUO_Sh;Rf5IAL+l=mDN8l_^6He@%s7t)BN`&Bh?BJeX^4yq(rCO#ib+uF< zOYa4ZpAe}s%$+eO@c;!l`&UD_!wYyeGK0S9LDAh@gWDMeb7O^uNwHe2i$uyX0<`p= zP+7Ib*xg%7cC}YIvdf`a^5y0jgedl0&lj;;ogMahnA{W}3c)a*mA*W@{kAUXb;;f8 zKIR#D`l+Z^E-JzUZCJ%K|Fj4Y7u2UcSrBvlv~v5g+524g(s2*ilOx;TrbE>+`1`dE zIz-t70Ei7Pt)xcM75g}=`cpl$8z|?6K|(Xsl)8KkGqIZHwf9|6*S5|#kJ`BO-VdzW zATnYHQBU@M8*{SpRsF`(du$#j>N=B!uEU*sD)fBD7Vk5Zx=qFNC`jp~4d>hPGBK4f zOh&s@WMoZgW%hU9pOE|e%6pjUYWp(rE7h_bcV{s!Efsmy~M%QbB- zKdugX{QjXYg1oP-$IRgK{wb|xS99aJYu+Q>k(VpW`%d;}C9Aj@WxjlE{o2S;Rh9N} z;6<#^@kC>aA5%_BYQTrIZJ{gXy|J&i<3o%xIv5JaV>a{i_mBOato1WL9!vBc0hq zOH==Sg)ac*f%d+$R+YPwXA>;!aF)c|FCvf|t3M$R8M}v}b4(Vz!&QR0)nogmGTVzG zhEmrP)wn&SpyDV?KEz29BfS$KiycFL72l7AF#cV5*64H9-~XUXNtyP>@u>3pk!^B- zUqUs<48St$-1iENss!;)_E?8WA7{(`7o;ZQ$E1En3KFP;q!#X$MIR;BatfcaU|5lg zq+1_R=J>k9^Qr$ARTqkdalaRr8K%sIFRXM1D?1)^=oSr6g6|gq_P9*&{m=$o=&U6+ z6>mfgcVY*E3Bc&$i=*Qul^hFqPG-^d=zwB`|L-va&@G(3(Ts17_{am|8hZlK6&(iK9U4apj`K9 zw$I5MwdVD$`!P<_mrXSD7FBPl-#-&-BMMSoe9=__SCF)-N8`Gt^;%a_TO5odNz`kQ zMeh>W6BFC)r4}xwf{jTqe<3sdv7Sh3r8Bl1C$=Gd@|5t3zdp3GB+LRK@!vfES#(K; zxToQ~BY<&ME$60qV-SCH#Oq}F8l$f4T(SL}EZQ{WX?*y>q->fNRKGR^v_P;+Uoa*S zh^fmlqf5RmrP~3jyUU~&{tf!SD#DcY2Pr(jUtMbQ{vDs-;*NZ~F7Yhd_j%u+H4>?mg{~)GuxdQ0NSFXrY25dxCV{%~69QcdjLLznlJjzc*gd;i zwQzZj<`1JmKx7Q7-nV6fWFx4&akQknE>t287Na|8tC*SNjZ<{?Ihi4te4LA1md*N? z_6CYJi~2|sP|q!anxG!20o`iecKjbo&bS>#uFHtuu{9B>KwdZ)7Tq7ivikS1qV|CH z#}AG1%2;-=U9=nD0}QJ`&5cT%*!+ZAnyCssMTULaTSLEBNlJeAI(SA28ITJRJGn;@ z&lp;Wuj#n!Ao)xQEp$c0Cgis`v8I?84{{(7xs2q&zjLY??0x}@@8TSc*!%#vKVc9{ zurLL?EcdQ$!0=?kpiSCRhaiWejDCxNja1H=8ohhhQWI)3Sz~mSp8wIl)|Eu~{g!^s=)B_VdA@-*@|Kn>tiPXFj=f*_J{!tKo$ zoA60xv(xr6xt-_CRxU?l5%5nJLjZSeO$3{w(w%huR_?@i4pwzk>5u4^{StMb%M@@(q2_~_}pOtd9rDDSJ$ zWPRxmo%7L}R4Kl||DKClxxdNmQn$r2E?Jnsw_rTiN%q>+n2g zMcD!kc5s&e-}dhY3cV=$sY9> z&;;}cKv5G24k^=|4;~DV@iY2pS(#6GTFC{ViQow_kYU)o3X$3K)J+lx=#R@M-Wu}) zwa)BI)ySp$_yJ;gDL8#dI?QZ!*qQbei<`J7GV*&?o5w4nR!xHTN!) zKuj-5ASSDSUd7_g(j47FhXvRBky4u!bs?VJkrnQ8R=(E|*&|(O7y_PQN$yy0(DGzC zfR6p;h1Ga1nBBj@ej65`y7IRXj9bX!t#k0iqfyMA#-`v>Yx`kSQHYXs-)vr;$PXzW zkf-}#bdL)w)q; z7ZVj_c7E;DtW?MZzC7C@;|!Mfs3v^xhdI|B4YW$by9i}|Ln&_2#l@*0WP2O#1wfh( z{ULwt(u4Yw$&*hP3Y_b|-sL3Y%GPAIuh869XU(sL@h>?VC5yvFRB#|CPB_$~$#&z; z1W(2`m&hnz48Jr_%p3Uv@~%D9Ie03An_ABL_sOeQX*Qf>RaxRzp{aZEPe2P1u-g~f za_~vI^%HwjA!=~V!{0}k^q$?WR#ou^>G(k+6NnhA%YQ-wKoP9d(5q@O0JhltdR}DM z`8vvF$?8N0!r-kS-^pje+5ys8^m<(MjqLGJvBr!rds#RkiefLQ$4#~W;s${ElP~>f~ z3kt&V?*4pYrfPQO?ajZiBlsMb`DSIw#Jewyj;zPe44 zN9H(hsj@yQXCl6rP_AbB3)Xj0`xJ_K5<#C&U>Qs6mZ9yMSRq_{cTIA|MD+b*jZ+M( zxH6N~gK(VqT+ZaE1Gu|vn+Jv06?r%i$M)nQAQ=*h5e8t%Oag5Z0a*O-7d0mF9kF!V z09YOU>Q9KB-&B`fs73bDLR`j0?9|iEO1QbCW+JsZq0;xxtxlVa$BW)s^m$d5v|s%; z6Z(oBm?VeJ2*kRd=+)=!;E5Unzw_58-cFKlybFpY>0Cq-7fCdroLBCG?NN<@mX=5) zz8>=ZC4qeDRL(sfZ1=OW9MN|b0M4X5S}$;z^p8*eD#S1Vd&&n)Q8USJ`AWW)Z9xqL zACt_6t4i7A`HY&&HJq01OdY0gblzBA{AN+LIOw(7nL#(YpH_g5@~=hos0UBesbffV zCeavFxQtHx&ZBKl!GTX~lM=Bi72GFDG)iJ*yBXQ&g|iz>wqtjuJlO|qFUH)RZ7Ae< z()1b4*bc{{xWVU&?g)A&0je-DZEeuVvOKDp+6_eKIs7 zQ2ROArg)g|B8qxlGI4Gm@2y!|_k26?o|E3I_(EQH)9eHl2x1FY=8K>$S~Db`PuP=k zzVDqOFLs>%5D+P~i6lZxeVIsOT0i(7W0FD@BfPOa8o1;A-0oaofAU{NG8;&Uds3a2 zoAtqCEZ9CT%ihBlU6DATf+XiAcjsC{gWwyQ5}-FU9QC#3A1Cs`mhyoQwkt2)^Koik znF+szB6U|xkPeKm3NcR!3fI$?w8G9+Tu)^#{Bau0fIBg(5SjJm-7gI=>hR-i;B|AH zCZUZ_XPdRYXN11%MK{}GzxN2A!NWTyP2}^^@-!%N0!`!!FFp{}*5;tw&jlIwi|EXw zlV5*Az61UxbBKQnL2w6#WQ{y*5brWvJo@tDo?jut$2?_OwHofOPR6s>o-&b4^U zd38OC|J>2uLwxY3O#}Dx*RvMvjlaH}s&VA1=m{4R+bDiAA?`MEYZqd1&E|yfp?vWd z>`hRd9mPBNdlnF+0l3)ta&2A8f=6Qi%Bwg`A781b=WgcHKxv<+e;7NlInh6?-95=0 zeWV+*7{q3xDf2N~vU;`SrB2-b_Y%dK+Jd-4w7t(Oa>o7-sO>+YxBtJtj(L1j@wA^& z0^vR$UW(t*AG_{R_$WJWl37DxOz>hKcZ`*mpZHMZ9=m3wP+3)z1QkZgXQd(bp3a+- z%YowZamD$L1%vquCi4PkE|h+`cLK1dyw-)r5=8JSXc*LI@`Cl9G#!7N@ZT;`y~@0H zLrMUa?*Fi>eR_J}F=jcEb%y*kSyFs|9(7c9akvxPv4Q4IQ+0^02JC9j1$RYG;M35a zT^u^xp8&S&0t{cjmrf1}g`8oaPvYdPmu?tA!}yBHDVa zBefZ}(QQe*5~L88i5YrQW$Nqk!{13?%Om{MKx>e*Ri(|&T9Sn)$d7)*@bpZ3#L4`G z;@UQhkKUi5#p$MgvOM!kcZZ7 zAKtot4aS_95{Wn^a>_a#{BH@^XL_16Xn9Mtch>@)&p_K<`=duPA!dyuwGK-L zzhCWJ79kp-y$-t9*9ARz5M>2*Yl)9<9!?fw<0FR%1NALL2uQSdPBihg2lB)lmwRK0 zMG-Y3DMEJKq;P*40?>s^>5X7AU?wo)Nzx6Qe~HEEDB|6-XMB`R!jH5xZ|huIDt%xS zQSH8)*qYG0DL4&ZMn=xFPVFdMhSxCFbLPsOGkeGzHTtiBNRhMQpNpao#~16-662@r zqt>A}+fn%YhD_7$Da;IO--;&3kt<33`V=w}1i9vZ~0v0V0H2P<+W6_P<8%z16>`lWHcy3rVkGQMZL+u9SdaSGbn6n?@4G09NB z<22*d{3978&hzs+Q4ou<|BlOR$-OBLG6zlZyr4136QQrsnnf4d!#076XoMH7A7~29 zn1lBA%MghhQ10__$#aB@_~f@f?7xq1?c1Yl{xgXTp|9Vec%gh_P4>q2^<@R`71HzO z=Su8;t-Q=z`W(8@cLZ&G(-NSryY9sE`%_)b7eGcz=XBAMw$8=KW5F(=EO=T$Ddvw! zOOaX~D|O^Lg$DvL9~wZqYmo-@vzm+&1kwEB@T(7p#nsVqK67)M%VhdD`gl>~QIIXr z0sgm%QzP7LiTMdx-B1Td{!_5M1izy2zsre$egmcikeeL=q!P$>tEKoOmP#PhNy-*w z(LWfrekI7J! zBQmZbE3XvhJJwG|UP&)7nR{#6TQd3WTCnyKiQ}977q6!oa){JA0Rf>yxDW1yPL%^I z0G*OXbyaN>hXI2U{`Z2j)Z=f>dq=5KI^C6IxNNZHjyot6@QA2eCN@I<+oLK5kl^hvz%l?lzdJGYBo) zWIo?xFCYhxH9QhXvK;|QHo8oLIarB0p~%%45EHcmXB@q;Qp8WbuKYt8f8%wUxiye+ zA{}ACN#tqE{I&&ji%84$n?>eZ$NKlOYtv3E({DPeni|v@4n7XM8iL(QkCSwvTgQW^ z$qK^*mH;MXyu!H&rwxC!z?E`M3TV@wb#k0!;*;4;nSFrvjE*(5M`iB-ErqGP# z&AH1PL(!24xG50HTx~++CS%RKGiH|dM`0zGrXPOetM)KUUbG1kTq`uUj!pk0Ag~h6 z0qFD(vZ(xGriKEg@I2_uv-l|zvP`V2x;_o@;NI*F7V>9jj*KefS$wRyc10Yx@E5?* z!>9?myPk%_zCIX*VPyc5N|4mT69w{#MykAZujz_ujmsbUc#(F`YFqEnxlzhY^=Hb+b>;qq11`M;R#&v-G2_dKiDDf6WnMa(?D(A(Jk55YBkm0IG z^xJ=rO2OyXX38WGfX|3OL;8kaPdohyMVMV!otMJ0D}r%( znyVw$4sDyp9MR~6rrwL&^R1p_iaBc?vzt$IIwnpLus&&Asc(s^-W|dg>)Hojy86bO z{6|A8(Z6!b9{pVh8O3=aRo|CPpwOjDv@0P9A1hO`a?+;R3V7o1bxr zW!zI)K1%OAehi|AoN0tHR(x-_!v)Rm&a3`WS?!Vyf8R`xe zepsmG_}121Jbz+DPPqudg`*GKcG{;^FyHOSPrtoBZ$6~xlr+T6n)W9tUwW#+bHBge?~IzBrNTWxv(a`$W5J2b z>^L)x5b+f?pJ_k!n3DQ@NN)TcL+(A8%JeZ>6b`EzqFQ4s9VEU>nm19Ai)I+1py{V-6-kN< zfDZ=(?ufptQ$HaaAXo6U3#EW93&TYrsn*V|DF}{i?M+oi%&73*Hs=wL2>lV-%d#C< z3Hd=Q`eRA0OCGB7Zu0t$hrGR*?exlfYv)&(m=OJCvV;VS%tC}BwmQMH(A1Hw(d(N- zv*mO$2KlU4lABBTgZe6Ul3C3YBCF#8Q82#CLS!l&Rn!_Llqh~l>iwzSUe0_7Kjig( zi69s4TE?a0w~YqJrEtc%rqarDLX89U67CF&On2K_g{CHhC-0!V&HkYr0&?eT0%s={OeB>s8FV7IyJd(vZ?OzZu*& zl``T`y-|el*8LZTH)h^6`aBV|6j)Mntysk{aOW$@o9k=LHS&|Lr@^Vxmm=$uY2~g?}+M zTmIljnH;By0G)FVNCCVj}$g+Tr5Ls<98;4Xw72-TUpGxx;S7w{lciBTh5vt&aKj};>q!53p8 z0cGwQF?63$QON&txnMEpGNYxYt;t;MhH_(5Z3_B}X~3waAd@X<5zeUkg5;9ZDzlgA zj^#`!p8u3nJ$kdWv5Wj!>j_t|_|a*h86-rFwSp4mY{i+*bEZq!^NwXc;jXT8YFlZrc${ zZ2_FKm-WbccoyDeF`gO}{3>M!7U&&nm~Wbra$w1%RE5-++W457b9j3F(Ne-?p0AJR zZtckVx$YVo(m<{;vvTV~hgZt=#eqj}wNCDZ9LeoD-i5ECLOF$TS1NE!^Fw#0Ty}(F z8$UeA@bV<_M^BB4c2=n3)Pu7h8$6E*q1O#4AYU|*LRG_-%zcE3VNQI&*}O{-ToH~m zl&JUabaMOHKQHKSUnbGRaGO!ziGyr9NZM+w%Fm@0xTVauXJFqpB#EKsI<0^#((fR; zq_22Q!h49Z6V7gSi=#lmjndD^0B7{uD1m*^p(>u%;b2-dFR6!Z?w;zUXM!9zXr$Y+ z=*{kGS~4KpJ8^I1e6o$e~{SE>B*w_MnM(WqY5YL=moZkae1`l<}a4Aec!3rnxi+L|FpJFfMEv0yu%Us*^y4 ztB}Y*_9e5zsyp=GVvnfDP!@Ev4}Qp1IH<~8V5Z$o;VH#9Juhx;weQ@G`(*cP`%V-h zSa44x_A?`@5BxG33M@?7eT}>1HrLfH=xBj@eMzDRN%so;9uVB(d8T&zN5ef5k~w<| zPSQ|XIztP&E@L!e34S)LEG}~mY_YFb>gmIYr?Az3Y!2)}nk%5KSi79^`QB^L6|N?} z;2=X6pVhlqsi_87 zCn{h^LJF~2$S%|$1QCPg>41W%YU~lZ;(blr{Pfufbfi}iy`n(tegEMTBPtA#zlx(6 z-5D$O3=rMWZi>)^yPsDP;9OUw^;vllM!ZUp6Llamru3MNc&CI=R~y&|OLtRWhf($* zXr`)16gegB7GZ2Ym`(|k%ueaj`(q`RAEIwpa~Ib%Q?cw{j_l#Et%pSrDaZGJl-}&* zWN*@hopJc>P>7FOfU`)OzQuwLO>ZGj83n<~tEu1{Fb#TdHbxv$uRq^Z7!#u@87+|h zdLeRcY=yIGn4pNYcm)gH(-IgktQr-k6;Jt zOAr5qRERUB$R|=+W$-+WY~|sRSEV|M1eg_HSd=At4zSgEY9h~GNzPsKIw<=tsaJpa zLP_-&ZHa5`qK8FG@ESpW5s$FKLT?Xmzi!=~p|X0xy1U@}@R2viw@t0P@rzDfvkA&5 zJjQs!WKmtNB{-IXA_D^Nwcq) zGxSrLR&6$Mbh*R?c}#!(CjN~=U0KU*tZfanW1tC`i7vJ$^%I{&CEnJEGKFiOj`-+y z=KcxFn<;Crja*eAKAk$a{*S{BCwkNy3@rH_-PB7uJ!ai7e6w%(n&I_$*TpYb*prK+ z4{Psjo2X_ijcxBddR(^&Azxs{LWObc>djNlTpMf_ub_bW{9K9Nj=`*V;d&=o ztGt#O);ZHN*GKTTv7HCIWu+x=qwK#^PWNY>eWosVWVpfrF(S+IaWQ<4??I>g0VdH` z0Zu1OhrV2#?~gb&O}Esak>ycFjDmdI`ERo>t@U4KeCxR`G##OeeK_~M{W*3heDlMO z%d#4cs>&_BQ_B?q6_{!n#mO=$r?RAVdf;}&50$R6To<{%FK?Yx)M(r~$wPqOv3HxF zd`LkMZ)rZYS!udJr$#d!mxQR%pebWekmg8)o}{A!D|Cm}3@&NGS((-;q5IjfB!BD7 zt+oVhH03GV^&5T}RmCchf9kyazx5jN5NArfof!f91A(=X`7cSlBLMPL5?@9#w){sz z)1vN&IAC)5WiJazBz1}xxc*v{y|#wEJedo3-n^wHs@mnZ_zWg?JfvF#KL0mn;uC)IubFt;9Z>cdwl*YSKtK+hm~dz8!ZD?|%SRaTN>fH7#sWXJ zWJ$O2!cS$>FS4#GAdzK}!aWA-O>Y8O1ujrpqa+w+tm!u}+DM=#-Oz#DW0`1?0s(hw z3rK5HFSZ=676Hp43R>|zkR7-1!bIQo7CcDTnL~8J&$;~hb4frZxWgB7Z=zzKbhT1V zWPCGSLw)$X)V|hkt;%3MhIi5K3+m1Vd-7EwHFR?^c1Aa?t=>8Fq36S#n$PIeWyzNt zQ(vYPhvdT??EMf(t~Y6SaO4u{S5n$fz0hejr2lqq=DT~sbYly;hL8+9gPa;7_6wHa zVK|;!Scw-!rt9sSeeN=HNV^CrQtm0hp$jkgCi@iKp-kPHpf8v-p3)!uvo ztDT%sx?};b|PTX)a^-oBKABspW47?Ll z3r2k1QVYvQWR62*;B|A>w$wAlq=cRrS^qEa1DqJjR)fE^C}>%|p04By}^4e?F|T8ncM?fvTm8ZH%G^1VorsWMXs za=8P>)p;3wZ~*4VfNZ+z=;RzgK#Vwjw+fbCbyY~7g(Im6O1Sg)>T%8y2by_~@vAe@ zuWqX|LlFH8i&+0j&@MF<3tP=g2L7lJ$j<9R&n_-7nc;;yMK&Z1u|qPdxF>0{fmShC zB@`&%g(u+nj>+~i`*nx{1;`G0pE07JgC+jl0zrifJ7fVI)r@*0;z{7Ao>c^n%u)^l z*iXd(zFpwZM3rS~<8^Wfx5t)nDfvi$xPP&5<~4~fxk~vP4Z%{Fx-vc@>qd9xx3Sy6 z=B9uxBly*Y+`h)**ECtO3=Wpa@`^~TeAHN6^c$w2KY@U~!z1CoPWf|lX1QY}an2IU zXGFS(1-{21F2gY}`sP@FSGhBCkr#bj8&;%yxTC%n({}~(zrzMb95v@vr0IJqFK5{f zaL`dPkga$Flh*Up36%MsPwcDOzqNxL`t;uMJ%q3F^bQ6n!FnuDt$U5G9jp~bmOX3Z z{NYLNPD7JECkh`#E@dJd0K1o1nG|e|^bCig&&dY;^4sIXWh^^sW%cUDgX@kuSJ@*!w6^Z@K0v)XtW<>Df_(Jz2C&l^RNffLSI%v&IzmNr0vAA zh2UjPs;bK?UTL+Z4tT$0gT17GoeKg5x}P=K>X{b4ORG5@!ftJUYO0{n48 zARlNKt;Z*$beyu+&)@nkeUGQg3&16BQPTRwZ+_3WT&urc{bEwmu;jZ)^7+n@M2QSl z#X)~92C`Ky_L6NEBDr$a`?0= zpbCH`clp3Vpxf|9p4(sBs&u+#Z?Srn*Q>0*!~Uyc8>;MU7JV2v7a4KP#}IKH0(laF zAHY+MIxY7g6EG~D4i;6;E8`Zs$xEH4Gbtk0u7OAY+$ta5 z!2F+3ST`;jp)XZr(tnr9zUKG`qdDam&w(OVvYowg%tpiV~EN}mPAT5qF4(y*~gn0`o}AAY!d_7cQwLg3s9-cB5~9QCx8Ti zZ%_BJxB9pOyP1+*(Wlwl&Q=#M)~Z>5b8i*j-De;}stcqJM&A@Dn(fw*qX8n$TcPN9 zdK+L2erSS|wigtcnpxfk$wSc+@kNd;XZ9PmWPfjLtVqRp7%^eR5_%=#41&1hbNy;I z_wy|s{P>@Fun5OI*gIU_%y{NwHB2r zv2I(SS1!yWeW=sqw!jI*;!|cx6AL?HM5HTHILzR^O&e-7el1Z@F^`-0Z0vvL23+)? zteFrr%r0Hxht`OAWy|}zO0T+@f{ZIMU`V3UWuX|)^a*fum_`T*<<-8NZU61Ds(G!m z596AcF0?b%GJOA&r~lQ5BjWsMjgj=}QAGwypyh07g>2Vb+Dtlb$~^)N{L4s;;Xdk+ z%#mw<>z9o4_Bh!mgm!KC2HLPmzHwxbdUnMoHuNe0ILFbtANXnK7UslT1Dh}KjHQiS zoor85jWI*;p8!m3JYEF>;&w&ay8z&^3<7xAUpJlLb`(GP67rv)8LX`VeN~Hf;p(=^ zPvcYs`UBdQjTQ|4(RKl4w@AmHC*Dr3Iri5Ai)8BMRQ}&O6~xH)nZS|yH)-=`>^}}& zh|JV~B)b2IN4`aDSgMia=>L?YuKi~&LCtvbni%aBjQ;rQ?zPfZ(Z2FDdtS2k5FK6* zM$?XFz7fK`yy`b^EutF?o^^iYvFU(NoxA~kbD?1hFq;xJ6hPcy1~M=sg=Vm}Nd;D% z681-8_4H({L(%kV!=dIEvTY5QHlWZau61WXWprCyNY#}h{k==dEvjjSP~Kw-1MK%m zk9fwlr+OpK#0h&|5mvbxotM@;G-TU?&+uSA-lep6Y2$uuJRs3vgpm+ygz1caPIU`QXM?5>wQa-oN%zW38)#du!!PVWg__L{5nc{K0=AC@bN_o<{lBH%{}11%e-8R^zjgW9b(%Z(_jIy_ zHC0NoTSrMp7_h5BjDSB%E!e%VCkBq~Gmbr7E{6jDAqrK-7B2zzgkzXqZF6%&H3@xY zd}1+#s;~DTi_VnDWE9)-)gD+SZc;Y;KNo?M*m2SjFc1+n>Fman>{qxG_9x_+av#@ByU`zh>I^k{P5oyoe zV*KtamG!^c`|@z8+xP9U)Kp@UvNH)uwz3n3da~q^7Da?gWtos{gJCS$w-7?15M`NU z-*-~UZWzm8B-=1!9gOL{^?a9}=Xrm}d%Vl>e*gLX(NUv5&F8-F>%Q;nI`5j-Y>S^}(IGR=+wriT7BA?ZTfw_}~M2K;wU>^rikydcqfk_klY z|Hb@#LyoEOki{+lI`?YF1LBRkFl0HpRkzXpTC6fy6WEzwpH#r3C2_8ne5f%2uI8=4 z*8DeWvbqChQTHM~M7(WSWOW0Vb4M)*I@8CpH+ASo^^M31X$@w=M1kXT#LLxzPgwR0 zGRlgK#}$M8(W<)6#8LoBzN#t(!#Z1Ncu+>KYa4EfXNWquR6B ztLJ!Je34~8zw77QeyLu@X{e31jk-fJl8cTDB$5T-4ga?1{bT32IFja3V3)txkD_4+ zT`oZ>%8(*gSe2N?P}w9p0a-|<$yBVVDtuJ#d|`2gS;#Z}gIXqxBM}3gEskNTiM|R_s`%E% zo^KAXY`MRh9SdS&f{vBv%e8UU@jB`RxO$m+v8edH7%}CPK8W^JI(*uOsS##+aSMPx z>uz24F54;b1Fpxre_Mw9hWf}1BqQb^K%d0Ftu0leSMv3TLdxD(j`jygQ75N`j64}` z{ArJQItKXc0sX1SK}mTdb~theKuX%V4brC~fSu7b`6~KmDtE?N4D@u?{mZ( zy@EU^f6RnOhV|N^mRUJ4K zsx0;mGW{VBWAoB;>2hhAJ>T!wla0=u2i+(cfR0tmpC<2h;rrrV$-5s40meSSUaFjN z>r}MnsTLF>f_@fh!Al9s&M=!*Jltfflz@&)aaC#*d~w^t z=)?*T)B59pV`?j23b8m{)h{Jgpr(`anYmZwv374Pk3K|e{dg_Nvjrl@0axxLHVee7 z%2>6yb?>g?kd&*@CVl24hL>0T?}VZ21=Vwtz)AU(0)CP2|F zx6%TeGn4pwL%%w?XG;8vq*RHox;C=g=Lk)@7maxXVoThHTL)6M^);mY*jp79!Ty=^ z>ki~i_%dG~{rT=0(mX|tCaT;;O;Hrzd>qdee=#1=XDnk05TYhUa0>@`rhS7`ufm7Q znuv6(pC2wmJFNZ|o>~YIr4GPYQFYh4^Rr@YK;zN@y))%Ni%ogSg7CkJWTCLXxK2tT z{lzj+njEG2lyhc-Eo=9cc7NSxO3T7@s6{Rj&IYchn-gbuU?j`?+ota}$1HZ9-zK;V ztE<~(Ed?B_qdL^W$}2{~v)dj>qw6LwT>fC+x$#UJM;U=}T7{rrn3sl63)rEfJa?I7(;QMV7=f_naPjlK53qKoM{YqIu$cpGBP5NR_v|GY)&lHFprEcE!!}Mn zI{p5kBOb}Jp%XSV*`!tG&bJ{jG&-Yt8HymErC(S&`~x!hm*!8HY$PQGMscj!Te+^y388-mNmd%3+jMsMLJG^>=R~U z54mxM;JEE}!UMe|_Gx>N$d}SP;H#P}k&@Wt`7BjEpqXV-qPUk>c1AIl$>Y-CooX7j zQ<&=IS`hpHy)sZk_HQhTqL)w$#Om6vf_uA$1g8BO1^S12e~sfhlBdfR4AKy|12emP z>=wb3y)>a$wb*z2eLh9ypfg8?to&M$LEyOYBkSz^R!8Q>P_E0g0bGr)de(%bi z+JbCh>AcVe_!^k>`a6HLJ78rRkKPK!jGqPwRPHyB-62Iosq;FNmXeOvD6wVI3mvgE z!KPTbHZg_IG*1<(nKL+`K&oNp`d6P0^o%O-1GAs+W>3t;+UkB*wC(m_(u7OT5S9gc z0lf*}n){4LzsOnc13wY`_fNhjLss$~iHJb8v-zX5N(6`P>$#hcJ>13%oKo2qJqG|t zqUM@GogA1W>Tn5~7d?sVjK0&(!##!jZ24;zr(|2vIei{LFrB-V?&)kRlZk{h)_KQ6$GGAfr426` z7+JF0L`@i*^bQu*GtRPMOd*>f53|uqSYriq76-z6T!syTgQia2IA2Uos93KfsY|Ja zM;A5KC|Rp1YHRN!S$wwSL4zF-n>7jF+5`pA7a-mSfU_xJLsu@XDDQ5jn-_<q=zv zYon&7bI@1FUo$3uK$tr+XYayG)F|b$wJiWd^eBL>Bfo3mf_K!~fJ>LWo|{{RJc*vK z3b`G^?-8eb0s0>FZg_4_-%D-!y&{ZG+(vvXb&^kU&^v3isLZ{3bPi6gqj7YqCTf%d zH#)2UXM`)h>Ebo>x_?1Xr!40Bjc@z!8jZ7gOxG%cxpp^4tnBGS5$Wmx!#Dt`A?DlR zngtd6OT6H63uV_lVm8BrS|L+Ddn-o!a{wbZZPR}aK|KIGFo5^(8w1ytrnwG)oGrl- zUP%S{4AG0j^coPkbs^^rwD(K9d@dJmOOlihkMoPoWJ69z`)z5wwW7%4ku{3T`{*5~ z36clHU)E+C_b$u6=6rZ6MS0h2ylM}f#01w0&bXx>#%bVo zva_;doYqn9Zx+6TZjKECxqZ-3`D0MprQ#*pfoK}?8zNK{zz66HI2lR#?cCg(1xh+< zhl)dpHdCjW*)@6L+||w*RH9MOqKmWB2Rv7lp{n|m!}Sr5k?;xk(AA}VD7=8#H97B? zV=?_24v@ zNM^5mU%uz|JZCHKg)J{pt${Y36?ZQRv}pim9`2>h0-`j}{Q0T;FZaMuzeteMsJg|+ z3~85Kma_36SmK3bjhpi>HI41>aYDWnwugO%b1X`It6zqjrrTA`?rLwJ$CAHs zCP{c%XzVl_o5#_<1}D}p67q*L3oE~wbIZP87Y-vM@bKUJWY%if7xD@mj!I=RH?b(g zPp=+ffVaTIHFzl){|7xTMPBRKsY-iI6bp__tt3+nR8gdovwBmViAO$?{NjA;Q^hw_ z6?3ikC(j#HmxbKs5%r7LNpEM&2|Dhp0RpxlfAS^IIZNt61ohp@ORota^eTi*^pWbK zx9=pqL!>#bhn8xLSj9Iqd{m!rZEwdGY5an2`JSe;QMpXW8cFZW<{1fJ%9BK*+v6|{ zy6Qm^A1H{>)gKV(OmwcDzvG9zaGqsjuX``pU2RA9HW{m5IUm;K9|$^zy2=O;#8rZ9JZHQ-9jG)oTf z=0IE+2zlTj7Pht&kjB0WXR+=X&E#K}Xn#6YXhi*6K-G@JfkUK4>%mZs_3l$7;HZ^k zs-Sr4{u?GExfy$J2x##G79vgZ2ZSHKnY6|aAazs7wsveSAOe7DK0nYkSK}2BqP2wr zAB5kUuI;Tur-Pzh9%6Dv9&wxHvOsNz7<8w}QiH}v0d##rNW!}6n=*HIyW8;*S8I(x z@wsvLhsL7jUGAjosZTo0?EbJ42%5$6!S0C=Yc{d8wGO<9NN~>{XsQRUmZU8x+Fh(P zM;I3OI&rOORZhn57#aR=s6cN$wH+a26{II#{ zC-Ebydb>2nC!9QcYk`FY-Wm5tky~H>fcWGv$^;72rQCxHL4S0@ww&>8WkLVkLEH6Y z^CyaminET$eZ%~^;KiWdEhH$!7SD}fg-Ahl_^t_=x!ZDb;kkn#fOv!WNxae60AA?K z^<|%4^S!x53{azjhsM4 z9%wm^+2WL6+TO5KM-f{EkCV$HUClYp4M-R7NPl&d9vgt-W271C;a6>#=1-mTz=i`a z#+ph5(netEa2PVObxaKBBQ!iXmpuAyw8#vo1X!NZwK&N%%dYkHeBwX#9m8F8%`yzYl^d?v1&!|YZhlIp3{!O zrU^;N@lC!9{)=3(lV=gnbQ^q`xBWEX=fC3@UCo5cSj1C; zX_8C)R)5$e*wid%+aN2GyQA!a;vv%s6_&wV8=l!s9f!BJCiTPL=5Odpya0GzzN?Vm z(%%|C?lIT7T+-t*{8D?%^3(ucF~L?b0iS;F1w@Y~p-e41FL(spL1`oc<-{_rvv|{R z!`=StXjSF*b;FRlWdjrygZN8qkJvmx6J>O3<%#?^ z)N@UfMZ$`Cu5NWNb@=i#kKNur45RJ6xOKI4omJnkw6^5Y`oGw0Cz5|aO9B=jj_Z99#YFrQ5Y=gasBMEXgC@e@Ed8BjR6tp(Ft^?XH35a z7IeO|sdQa!&%GEf+W+q2r>e{2oY084wi+bbfO`KGrcvA@-^LWpdm}fi)nPKBomunA z=JP}4JoO@i>3*7miMewFs+{poZ|AOUa=Oh|-c*#c=V`mZoLUp;l(swLm@cr7V~yc7 zhYt#)o`xLsuUx#j}Th^mXyi+;| z#nwKH&Z!mCzN#eHWN-jlFSjYnR<#W;^I*g(e4+P*+gq#8#{?Lb%)K9bG9zGF{YPmk z@F4i*P?n(Hgpp6-8+w~6Ow$cp+x?+vy|+5VK{bt9fhuneeP;=~`m$${L1$s@5oAPo z-9^Z(L>!JTNF%zl9!YkT!%T!XCc!cq1;uOtmMq0YB9+E}#q22PZx?iVJv)X z&YeC2QH3Zm44(yD_cw5EHAaWpuWCAbX~Yxaj2MEM8@*&`*xYPvSjQQu=G<^RjF@$PjG9_QXinr?LE{2G}Xy=yfZ zXLn?m`KoSeEEFngtqHc_s}m<+{;QZnsH>JoP{D>}{R#pW)3&_&<;^KZDi#dm0u51~ ztE+EmOg5=7YRjbIz9CNY6JADjrJ>Jb_|WNoX&WCwjve4!%|1$G+!MS!PQk`rw^n`drVV8$MIX12)=_$GStNw#Lq^%DGqdF& z7jiGJ1K!MQ9I|Jk2g^D8aFG}9cHx+0c!aNR!<-6_;M!LdL63q7!3uS+B4^}lI8BPY z&?+xtb`{LrW{$r~Y3!je~6ADHx&T|Ii}Al-;z-smqiiT}53)W5P& zF+~=b_X zf_Cp~BLdZO3<`LFI6zZ9fN3qS3&R|x$xJRWb!N^!9_7nUR$??c5Fy_FU7lewS-G_) z8@Nz?m@RH>)i$nC6+sJ@U$QI#dl=}QRRO)Tzi22%Whe~&8BTF3X6U9$v=mV#nw{nq z2MR|%#Z=!_F$vrZl56pdk0x>CjS_~<6oa#Kl8qu_gku?w83$h9;i8|f#O$D3cE1O* z-IVorFY`OGF2F*X0*z9zH*J-WL%J$bKacEDuIG;cWt3;h*a`38W>%%k71ezX_NG1e zBX1nNy6;%3vjuPg4-UUBLk$014+2$bJkq*>*W#^xUgoI{xs0}{_G&;f(}WpJK4ac$UI{9X%ZO*5(DIwqPa!qr09-Xx$_juxVARt4!OZ8Svl?|srX`59@x`m4M2WQRfJQI zAQ}sS0%BS-oxR)gM!#^enUU)`s~2+jqoCaBZ0Eib7ZRV2yz}q+^a0{E{vDp>CA5=S zQrNlv$NN=37=u;GHY^x~JG)Go^pUtLHCpu@u-H?E3ftV)grBHYbaeNk#ohQPVo2EoA!$khWB&X9^r zpYiO-4skIvH?6NIsWhM@nrHL034?6?Gf;%0@qy}%$u`AX-ZE#&N!6A+6>;0oFRX&h z^^@b`*#Q<7r?U-mE+5^s0Cme20UDjc8|x0wjvb~{tCqf7mU^dk94@6)3J@_(_&xED zSy(AJ9LbLzPTuwa^=+ zT;tQv?p)8iUx^yWDtGqO0(t`225JA?1`<6q1VyQ-4pz*E*gyZ_R>9jhVsVe&H<~lu zOXX7|Ux3)6ji|3MrvoIcUOms zB^`;-#XEQP*2JvH{EQ>@!RQhA=FekA;ybt;ejavhKMz%47C>|7D=v*w0Txsii;`{oy`;Ld$8d;P z{&L7d3n#)R*Wrn1>fsC#=l?}~X`T<(la#2F`FiXSJPNhEFU;9LA3G23a0 z7JlRlqci08%|A`7pPrw5sBxyMue!gaL~%XALYw(Fe-_8l&N0k{fKC?VksJz66le{@ ztJR8=w{1J1LlJ@(1DDrH!#^N`oBTJvHwc)HQ$0ai5g*EQrAs<_2&b|$WEGvmth~iw zk#WmD+xKf4MRBQ>(=#pp=z`$&{@|Dxp?bc6#qn=OJH3PfUlm7R#In>ppbYRN?q=8K z=;FwPO0K4tc4nbREv5(bO^i~_r>>?m5O~C9Se-ZtOlzYmi--?&;W<^b+?QVY8}HTZ zOg4lb@F>@Jme|;0n58f!xBJwtOiJlAU)6Ni5$G1${{vzpcSd;lnBZpm0oWUZOrOv8 z$VXZC6$PEH^?Ag3_`(|kZ;~w=5lnVt`??kQNU)BoilVTa_qK1%SA_XrV)8{CSVeH6 z(5Q^YFDCpxD$7K@&ZamGXBY0AWO_NEagfS) z6VN+{7(YFjm5K?#l0Cel8aMkpF@q!pKLV1gJ5=# zX|TS@=mobQkV9)Z#hq2_ntXiT%1>qJXDtH9m-fsGLVMWKGFz!`1o@s9?Gm1abj?R6 znG&f-F|4@8VLqcf-%UE?<-}aAgq1&TDd+95{nn4MA^FUW1~g>PBJD-OKd$UIOq|~c z?l&+1m96^uZcEq6OQEhXSj{|VMcClsC_^#6o4U-gj~=TKdn)UgP#nLLPsE94h3l!U z)FnB)DiPwVydmxN8ydw7Z8WwR$$Z+i^otFSk|jyzM0K~PN8oR)#7P4=RQ`6Dusi#Ye2$=*pMjq=^PtQkYNy+Bg{(R?`c^^6M4HFP(X@_bMCYD;t~Y zjYK~UzCo1GVgY?fBkSFmllofQ*qs-koQTmwMI9X1Lk{eV2&_NFB!Eu(8veEEDRU(ev8vmmbjPXmd_o&>=C26@@2n71S7 z-*Ml9FI6QdR(z_|Y=%E`Z+Q$KRBhW~bgUzTL#eTL3FI3N(HjO3GaTL^5?BKC?c4M4 z)%~>q|91z_;dU+f&(3c{O~Bo5ut8_4qh8qw$isA<*arRrfhMuI1^BVB1pzC%pAvxz zBE1Qnbv6L&X{IdEpcpc?3J}?Yi@iB+7}&L>=+|79wh~Ekr<2#QWznYI+=9;-C?Itp zAbhQynuPt#_R?L_-Z|dIF9dONDQpVy-ZgrQnSdET3+_*E0uWym{`I?0t;f8!YtI`z z(<`INbtcxJin0Q;+xGu=FP)4$f4tOkj!23v1Y%7!Kx^#;=ElP*r~Wmz(!Y-FY9!RS zlje`DBlGM|&LWtcn^b|UInFc=sjTw%m4SPTn_QlLC~(_~vAp(==fuHofl4|R8 zv|83csNzXrBn!ui=YiE^Ff%*Czx5lNzJJiOWW@5k{lrk)E0m)67H*VN!#&LeG|l+A1zmR~<$n&#&}K)LqHZW93d*C`v@XIHk2NBaOZ|4-)d z%*GVh1{nTN+W^A{ZggO`9<<4T@n2sfJgpw-2F(Jr{uK1%(&VLytS^e>&+YsnIF3g m`=okEV&TC5sTsA6WncOClK&?&JOBON|Gf_XNgMbv^gjSD&);JJ literal 0 HcmV?d00001 diff --git a/assets/qr-code-example.jpeg b/assets/qr-code-example.jpeg new file mode 100644 index 0000000000000000000000000000000000000000..f3422ac1a36d443902c1622036e8e6962ff6221d GIT binary patch literal 69769 zcmd42byyrvvp>4HFYfM6aCdiiOVHrKH3Sb592S?wog}zh@Zc=&4vPhMa{0dJJ?HnH z=ed8}d;hw<-OtqYR9DqhPfvCCeD?3+-%S9Pvb>T!00ssCfO-1?{%)}%%lX>d0su-% zEC6Hx0DuZW1Hb}+Z`9Yf0)RpJhYgVRPlNxUasEyJbB*NRwBj30`X4mYziHUFdTtn4 z0N&d%^{wE-{+G;u+S*6L|4V-P8-4p$KI+2~ISWW9Ow|IWiJ02u%rEbKq|Ey2HK1Y`sRcz6U< zBqT&+bX0V7G*mP+3?L2`1`r#FhK5Ceg^i1ckB^UzNk~M1M}&iikN5XY2n^g?8+Zg1 z1Oya33^WY9|JUhn4*(k(5DW;0gP{SyV#B~;!~E?BkiR+Q?Q!_0{5v5cAtRu`!okA; z-YzR*0RRYZcEcdTA;6+wys^Bw8Xf@=2^$%Q8i311gMx?8Eu}@vV?jVj$1Cj?LPSij zZIF~w4`E>B6Oz@@xAYDTPo8~~g!g|m{I{lmYO()E@Bh>;1JL1M-YkT}21o#u>_wDP z>2DhifZL`j5n}R#Iyy)W?Oz=dHEB!~oex%ZNJUbID9hxL?Y}9g8>rzmO7VN)ablGq zpbSTC!d(i#%(Acu-nuwM&?$Q9@%{`hRxPwbKK--_S1z7eW{aXTkTIPQ48EYoCV&R5 z6J8$*zjN_CAT0^9zbP-=VnK;sywd{GO;p!K;D$^r9r14l!!*E9Q4$X)=XB&$a^C)KR+M^boD!H14#;#O+nI zJaQrFji_n6KP&8^xk&64!|pk%oDl{c+8{~TuK-kcJXhLFOsTP7M-;()6Y3VMapI*p zA>W-H6IL1eB$lZ#F6y6ON*=_!zI19|FSBvj3^$^fGkewi66Tl6cKpz8mGE5efJz6i zXL`Onpaj0Ce@NOH#A=IlKTsnvPnzj3wptFYAUsr$kiv=nD$!I3E@y-SbX;NJ#Z9gK zgP>_QCRG+6oT6=y@S&_<{Y8tE$2o;9tI-PIDIa z9FQ)sv#8Efm@EBotZ+kBN-9wyM4MT?RkBd#3`RlAWZbmjoj5m|jq`<#McjnKasg0n1x z1>XXHm2?J(qyYH4uf*|al6-3YlXm-{&BoCv_r4p6>xLAE3BxJ{8;7#XDjF#zDm$1` z45l=V57&x#fxCITzRj76gZ?9h?JQpA7`QG0r(E)#;}qjCsLg65@<8Bd&RNre5A}6$ zjxQpLKtSAuU7FvSA~*-vXmGdxC|d-HDl7C0yeN`s{cU)S4RiF>%8HjGA}B8+TVaER zVJj^mI}-+5iRTk%LWMMD!XZUXK#h(LKY>krcJ;2I2}xh4t&;C!Qf7=idKw%N(94Ht zXqCBvOAzMa+v7F%`0Xrop|n`NtcR5XF>T&iAF*~q=uZZRtI9y%VF zsBcC;tA($klkbMll-hfrEH3GHh<1G>d90#5b%V}MXt(wLM_P(#Ow8{Nmx7*cO)BTb zlMIX!OzOPs?ydwo#z%spzkn6`zW~Y^A2t1Ny2haJ@>1PyP%fh35f3*lvxQ%$DcULT`l!)k2yKlOS{lQ8gTtkAk`79sbVlj~H!Sraym%+lX=!6tdQ01W z^Md>7N-5q7kuB>G$2Ri}c{2T?J4#e35Kk~ey^EW&3?@F|guSeVpW)V_Z&!78ixQWc zqlAi_qfWW>yvc`^kdC^4038KhvPbIxEaV@$b4)#D!27bBI4i0U$ff&ln_cxEz{HdJ-!yPbyW4)ol_WTn*ku#! z3wh~*trzn*w=Z~OKbVeqkEUG+;z_#Y1be>sy590_uvgr1HM}a?ikv6iW7|HiA%(EHodJCsB)vV-6onRh^;(0Q41D^cS0-8>;6Q z8^vlGT>CiC1Fa=)&(osY6S|2rm=|hDiSrLv&5PVo}~=8kt?2O$QV2@zYoF1Vd(Zvlk{~!IwA5#D^)ORvS|d>RkXpH z+Csg$x_i{xx}g-h74PdS=tp&}ZKhpLYRwpv{dG0b zQjowMm=6WF$E762iC}vJrX%I7QX2Mc0TwEPc-_K>!J(bu zFTiAC%2uUOtpn92$C5dNI(~7GhQ_Lp0blmXtWpR;k{e+sWCZsVe_h1KDM>1?=4CXE z7OsSxEcBReX;e;C7F$x}Nfnk1Kq&72A%L5y%>g{)SmozhNF?NX3-&yO^gq%g=u<04 z50|x9gb{)1u;HACiodKO%APl}?r5CIilI=$@rh`+*^bsZGz1ie`&VYRqU*vBGJPK9 z00;^CtGv9Dgf)_UD{dU;^JT{XjFvf6OJkP{rg#QZeK^62c|`D>OvJGgmuM~wvrPv@Tr5Q;ZP~>Jys;ffVEMjVUd`V`KNp0HHNfqlxlzff-BL7IHd@` z(ljXRtm}Ty6Eedkr)9E&g|))MxQrqs?JfgXbq7*Ry}xEx_zP%Kd6g((C@Ft&b|?&W zRMKk-Mal87hu@7VR%tq7VM&an0z|Kq@o&kvB{YkDOgHzc8R-`Gis$xHYYCHD;ZOOR z`o%hX0!vpGSeMC+YPpG##P6#!slUe}N8R{N*Pu?|l0rQ+*%D(>OCH2%6SJZTJaVrc z+v8IRjoeST3wb1eVoO;KMGdfSN<@zMKUPIl%-6Ca=<8v5(C##c1gV{Y-{%3 zHn*q^|Kui+X5Cr2P|5AH%UHTIwkay9t6C1CGTBEklxOKe-Ov%=waD7BWspZZUhYXG ze4m})1q_gkc;<^R>;EGPlK#ANx643jc*io)N9|nbY^LQ?V5vj2>k^;<)Rorbn!Jb* z($X!2>F`5Pr3kqR3{m=WDm(X*NMd}}K+WetHO+hEn*kb4)&8keZX>_~c2UF(?WWY~ z38X{!{e8P=j+WZU?!u0r#pdx?yIMR$uv4F^h$=6qVaWiGClsS6i=GlZ8c^R*bOTHs zC_{ryT;8k=a?(nB<@Dm)IQufTlOOrC;kwpw>+O737$kD}_~TQNnf`udleh46d;Qry z1Krq?TX~fOJ-&{yUAPo2{?5P(a;7Bb9S~7-e^*tALIM2qoqos3S-xWgGs&{owdb}S z!{IPJN!#9OK8@6>bX1_I7pa4`OZ-fDCvPLgRv!WMCFcCt0CV^wP=lf%%8I!B1A273 zMmiQck)&*gbw|y`@+5xZ^rK;-0y8lH_a`pnd$=|7}{+h03OM-DfNN&oHBr7Jm z^Lad2S4bs%)F}o4cMcF~9iA1=oP(!GFJ|^l9NSV zeYtWMml5?nL{V67EVI#Bj4)teCF0b$r0r7MlqfrglzgeFKE3udw!LjqBG(#eWZ@On zbKX$7vOM@PG-KtKc8?V!wX3urv3{c;B?4;^`7M9|1d{*5%iO?e(7F(vTrH( z@Zr=)f~{L3q5K|Uog5cyA~_1f0K5A^)+Oru>OJth_YTv4`Jge@hyPCHdFc0qtSGBU zNm)x3z2tI0Cl_bmw(xVQ5j6Mx7~cg|QHZ{W9^Iti2Ooh>ju^{b-_i(}MUx_PNn zxqg%rk(Sd4k-03Z?o7%*+Wfr1pKY@JfzOwjQkbvWr7v?=!K%T${z0}UChRjg4G_o_ z6O^O*thMUa~56LTQDPv09N8k?)b{$S90vuFVP7KU@^Y55M zIk-GP2;D)>oGHSUEL?qqRvcr(Ec>HG1imdj#@WkvuvGE}`}CbFEwqU0z{a<9_7X4ka5Nk+w4 zHIO|LK1r2#6uDKkC9eGttQB(9CG9~m{mhTs>c@^oknvox9=Sn(F)guTvr{Nz+6d?- z7;zSPcaTF8X&36Xux3*3SYv=eu58SblX@z^ch1g2BP;~=nN06fSEh)Q*@ zO&)52t@mN=M-T|;yVb3ET+6Y1csr@7%SG)7jd#zagD*DmgSji;Q=R6G(NYbj?NBfH z*5EecHs#?kW*$@9yAW6T$n~f-Ta%=Rmu}SNn2KD$pTSQCUzB)URe$HcVrM&)T$!M( z&Aqn<_52v~f;VqkcSdyj zJUkOD)EenS5W2Z|58;Qi=lO!&lnVCjx)g(R(sG`Z^7 zrBNvfSAjb`l~}-z=*y1K?+8NA(iQsy6+~m2@LF7an<59@9`ufAcwM1hF9bPc^;v6I z1T6Ga-(CMdvz@cW@4V_m8u-lQh^@0{;>M|R9Y%V!0yw{W4j{%Lp9~{&ygg0N$rrZ` z70kmm3M-k}KCTr}xgx6%Lx6Bvf+%caudEcyuItrOmXBDRrFDKx!5<}E9q&aumRZF(`q5fx^Y-}^}gbxYs~E%aenEIJ-Wl*zo>1I`HAJ^uont&g*6zZZXj zqwrL0`Dr_6<6c;znDOod4^+rwk{n%c_IhrrLVm~ql;Ur4$8v?`@hJypO%IrYMXfD_ zhqdhC{BD$i(!f|iIjyYGjK)9ab+yrRPluR>hXht`5Vgv)Up3{YniZCUU#u(4NG>cq@9O@yqMJ*DZ!HSdZ_aDG}pAZJwbG}@ujb8|5<;q zWx;&}-kl3>s?cPyKhVulM0rYa{+2;JG=WvQ^q~H(`B=oaAldc7gG%JZB!uS7@EMO2 zATD^UEWB|fqY;}7emBRbE!vK?)#U6;$bn~V#Uuui84 z6)jxG+h}ONqdHPnH=P=t!)tb%aVBMJ^%lbY0M0{B+w9pPJ_tV6(KjDmI`)%mt|&hm ztvrUD?P@!2%e`XuvgyRRvpq3pvXw(HIq=5p%Fi4N}J7ZDRV6&Ux|0!9Ke)xo0e$u zCx@v|yCA^OX8EmanJI-gs>S)u1^^fQ^tR05Yphlif_lfNCx0tov9673a2e(BSB+3( zIKp-nilJ8&+V?b7|XbgufD57qrC?s%DbFJ&Ka6wbu4ZN%uxq4@G zttH5JxjEIHhFN(OW?0Wafh8LrUwLyCUmQr0_=jAk79zGcU9}C>46#&h_z5%I?;jv3 zr_6->vHc+|k@Doxi_es}WscS!T6#>}h#KIqXl|Scf0^qVgFrnak_Qz3A(iKS`xlTY zkO0s(ZoTd^RJX_A?G`alp6j7jyW0E+6c1Pm#i$qq|`YPz-eDXM*E_iNX)sGggmw@ zW!4vUbMgL0gr&&NX3N}pGB|@8_PFX#e~hBacA4oH32sc|#(5TaKAH(R`%B4b2`zE7m{6r(;#{$WKG zzJ&PJ5!E0&j*l#2r#)lo6n{bhV1O2;w78;#ME(z7NL$l1f{|HAbt&84hs#p$yKS^? z&S+I1(%_X_&>uV@02#pQ`uMzqkYV&mnI)v;^pu(v-@nA9G}c*3C&3~MV+Fao0*G7- zw$?^ahFiuS2}``h6CGH58P@R}um1T{%RpN`n#;2B2XDVGP=UFsRd`I1`8E>~%3P-bW{B;%}umd+T781l3Brv&1)$U>IgZAp09B?oKV}z2}UpbrVDVGj~+^@urjgkD9dg!`~!6uOixgdl+IG1 z$a)QRb81^6$dk+lq-71wjPVxjYX~bZ?$KjGK+x=ALC$x9(f%4#bv*aJ^u3*2`<&V5 zv&0hWN`7v3D@d|%-D#p4wQ8hlD1c6Pr=5lHC_(gwaD5Higa9wa2;`zC51Opq(O}om zhAj-tB>at6#;W@lfEkJ!lNyZ334|AVyl$HrNS)(PsU?MW<<+^^nzzSm^A0QJ6fL@@nj|Lyb6lOKMk9y(7TX(#q&O#LqcvW_ zDM0HJjvk7TpUt((wb9nwE?Hq}&n%a4KlRmzf#`a;FjzM*DXM-jy9KkQgH;7$5^KoD zx7qEDELU1I<=~t!15_%p{`jP3yy_U*BcTptkN6lbq*5{J%B|e>?;PYNIHNnQ#x`N4 zeGGCv6%nd*sw8B)9C%E@lzDDbifPNWUCX<<@{5zJcOeK=GHt>)fP|KF$D%s zXVS~521&B9!nUm|+v?MSPYcrEUx3F-Gd+<1;0Eg5nm#da9}}5d)G(`^*AV`FQP4_{ zRlCXXHy^VibJ5w(iX=c)Z(%r!GC6$+!j>Ij*6gF-F|!w(tURfvv#C@EVXoEqn%g>z zS{cI0D855JBI{0}=#pqay6mj2xbBazCm3N2VphpsV~HAED?#HdzzicQ)O>TI!amlf zfA;l3sqq(OgxrxX)Di6_wMR$3k6Ht@nR8kXx{I>yax9eqOy|#0WeEz2!?v3>(OnS)H&H3X*NpH$kDz&%tYd}wH6=6^@vyoUv+HPd%OJZ1ZT_U%)z0qr8;bIGm1;~-@$G?c$Pc!3+~ce5EYTL+RGA>%yst4p zb)xG8(MVk}=mKKuyT+e+1rBIAd&qvNQ7I8b@?tcb2%0g7v&5~zVzQW2q94ImGl)r* z0hs2isD1kjKlrjh_1xh0)VJkGZ~wMcMxQIQDk9U)?38#BFT0p2-F|YT00pRdK53b$ zd_R$U=%o5j*{V%HT6+>s$;FpQ9%Dq13QqZ@}M&~o?w2*^Hy?c5af>$29_6`x#=Q`J> z&q^vQZU0O{7F=lfLX1I7sbN1j^jOfaweOJ4QKf{C@@d3`nR1n(56M5goCljdbI2>G zXlVt6A*fy^^2jiAhT*LBIkLFeoB*s}e*viq@p(-g_ogbdz9l7AmOB*oTM$1`nM0}~ zvxx6*XcAB+5&8*$05j~K^hNUE4C^-6&NwNdzFzyn#s0zeQiE>Hdu;AQ1%V-axw|xq z4{6UmW|@Mk=UmH=Wx)nLIl0oNbe8fAg|%WFHm<-2o=DfVf$-s+jTx9>q{L&25om(3 ze?oi~sQI+~f#|S#Kf&-UyKr?t6BV%s1_Fb%Og*WZ|1Ch)<1av3^Dp3K`7hw{8jhc! zqyDb;xL3=?({edkUQ-WFRq+=ClfYs$jRUC&32(P(Ca z#7$l6l%9aIrs57l^(~&zcs}kkeQ6s;#x%(?f|ZGK(hu>H z-iY20hp@D4RbmVdQZT7SzsuW%8vG)pBIEHhYAY+E04~cv1sDXe4}>Vo^!duFPRRQU zs#=$FIdraN9^LXgeuQTwxMWxSx}B4-sZfuG9~!mcK-B^2z9S1p|5os#2E|SyGFlN- z4(yA`g@m&2k(R>J#zB$Gt%7}laFz01=4}DG+LcfSLU*@XtGfm;((K29DBU&YC(Pnp^W_2~%AgM+${X+v#sK42sZD8*XbjCRZ)f z5V$LaN!sZFv0{;sPtdl&&gnT4J`4hxl#TMo5RcMjwE|ym*sKZoQmQ{hI8km>YxlR2 ztE9Mg#xs0q!-M|cK0HTeSSn6j`w=stGG!!5XE!n6#jYwKPRRDg9u)H}mz;Ip&XIpB zYa|$DCuk(-H%iOb;+^nTW^U%YI&7U>yWzD1X!qd_!0UrjnJ^1$?YJ*c39Fd3&Mhb z?C!3@N|PdDJwy-1o^HILFF$5gftrK^oH<^PbyPr*E1~ATZ0ii~Uko%cc*R`Jm5~6U zp6nAbs{o00Xl`yrzVr}hX`YS*sm_KPn&!Q|kOvfI1JB&oB=ruvyRoA?ur1|z` zR8zy%Qbn_Ttp8}5UcG>lcMnjzQX6lOEaPp}5A;vJ!9{aBA7foJn67}N&Afda=7r+5 zv8NMT1vCFRW~cxZB5;|;%X|za&GWZ0J{4KaUURL?RQ@x&(T!?_%h$&ByF7)CBK0Zt zWV29*&`l6F>NRY7K&3oa+5uISCGH&~9G|lkr|n1FVTQF~aRxcdQ^P&}Ddw4;9kK)| zpz_aJ&jFr-ifZnwD8EgqB@B`CRkDxEs0-2aFTX@ZOqwO8?u&fo?|Y1XKy?Q zx5}#z7p7YhaqMPDiX4omv_UAiNJ9j>`Ppl3e&UlMG-R2T_Zu4JpFenHfRqin4X0KZ zjFsE-jq5?KDYtgjh3$j+h4s~y(b|^seP$GtQr8*Y-Rv7(yLK(jirl*L4DV?8f(AwE zShs1HrcY*p9~#Asr@YsHW*6ACq%^SwN@#RxWiteOSFpIM(IDfsrwUC70%iLo%zrw) z=Dow1hKPMMGxi;RKp_#X)f>)JT2{jP_B2|_m`v8&AqJP@b#eSjgK!(w;$^)cZM~CJWi;Bcu-3_teT2(+Ln@AWoT}p{n|z!b zcINSAr|0!LWZXE(0n}(Anw5A1#+ z9WXSmeKo+c`Vi@rQ0E1bU}*fg+kVzRcP<5WqKYkyVKQAFn3I?G%&5R}CbMQjR}sz~ zB*mXtbcM$$iX`P(TX@8-{-kqCZzLZZJWzn#;h&G~gv`7~>oY`#hwj2z;5WHZp0DQ- ze^g^@y5x<-@+m`K!>m~-1`)PgLE1eYDP$Ke}QgRYoGK3H0r^`rJ7V7 z5+1|sGpdDU7)=AlmyQbl3V;_ps4;? z4+`gAviyCUZk^`%JQO92PUx^CazsD>u0PkJ1Dqkyghs%O#C%4g)F6kS(|nRRbv9vX zC_bxaZmr;xgfXZ?<9GepQ?g7N?^9^e0{~e20-)WHHXNK;{>w$FDONRR%>f)CwCdhW zkbcI4q5(=yMN|qE=`S?KgUN+jekk@@W1!cbUPCP9kfvpp`0l!@I&11$@|_RLn8lvj zHZkW#d|RNZ4#gC$j+P9mq2|#LnylPU^c1I16SN;l_Z9~(!pI_8-peQUws(-2=Pz$- zH8X}^w~IYT>4WZ>cuO1WVw0ra=K_1LIiC9)YRmzi39h8wB|*Jxm149OiKhVxc4%h@ zcVj1?t`fFBir%k^3&--EV^rE5+pFc>P0qSE98Q$#Gs|M*lpExNyfapCs7{wwAET^g z;w$}KMjZx^m3T_t74NZ%+3j`%y~UZ1X!fj?wS+&&;mAh9ASfq3s*(X-gn=Fdvva!y zB`i_P1m)$&^KARbN-=2&a&vTHoQ47%yCYs#5n#a1z02sl}@79}Ad^11fU$YqQlE{v?-1D@h&5ixH`2m%*)z zE-IR^oQC--){sf?$PfeoH{;)A?-1bz@+OZ8sUbrr|THaq5sscHbWswSlElFYtH-68vR4t|G?Kuhcs%i|W=L8i?fB-$+)EDEH&iYnSl6PubtlKGs{=?r6` zcA5r|x>R#p^t7j*&aw>Nwh$KeC3Of;SOaoH%yxFlb(A<%S}W_l6y7B$>DphT3%vXb zh;Me4{ngO|^A^!DC7Yd3%JLegXSq)s#RQZ%#SiK}B{~%GjyKcT=nIN60l6)3iF}8z z=9J17RqVMOHfzF5`b*#S7YpfoSEZkkj&L;T35E_Tj@pQ zSE?8M$j-{WtLs$lD`Z+qt)*F}TDtnpMG`E?+`8+J`F9EM55)5SM>tKGESRkSh0~;X zLtetezTqPOC!xFnHBsLtv2S?HHz1`O)*CVt;SFO7i-7{f1R@~7{5Mb&K#h#Ug(9Ve zOM{0`NJMPm<`n{(nT61E3+Njp{cM;fprvEv;T6=@vq?!U=w)EywiEF= z7hp_i+d_vqULq-Rs_<&wDK}G_99(Y%q3wXoL(fb1TFMZ`6%X+=f@QU&`} z2M(})PK72{V>in*RU;M+gON7oynTVhJHXihkHMgPeMW7#OjH<|4(vovGQxNy?;t0x zX1@jPBW6INyFBI=#aU?0uTzt5-n9VjkClS|Cz%^D{ICtws+_PtQ845)r|`1&{L(Zs7ts>6_Wi`9h5^8yM}78n3}R|m&UkJXoV>48!3)k7lQ6ftM~*JM%8w+~kvzAu0#hbqMP{;I$zAOD zB9eIWtW|r{S{4qB_e`~xHdSGu(Uq7;oO`OiP{He@@fRf2a6){Zh*E#K7S+M4yDtI1N#>NQ5% z(UDF$$x3uLlg;HF|BOmnJC-O)O0~I5FN8{Uh{%Ss19J&2-M6G>#zeVJmQYL;*j04S zE$1I49)A7wR3G7_>Q7B-S&Rq?+!8O_Vw~B+aqQ^*h?o|Pop8uTP^5z=a2J+mqZilo zH7ZG4UA2VsRQKZ=={_c5U$_Y4e3u3I`K1PqJ^8!(x@|#|PDz`FI|!p&hAT%F)9L9) zcoo1~ztFLFdz@f-4yqVM4z#Nxzo0mON1I)$UXQf39kU+A=lqm$Kgp5LKtKQ>D?-Zf znv!5gw|1O0g$YJ%o$~avL8hn8lynmH+AUK~Foju{np_|3Oyfq3cmtlU2Aa8$3Pya1 zD|(;OOz&WTf)zsi4%h}_W6hq}r=TD~2y)6*5-4L=>-N_Wh)e0(J%Y6C;wdk&Y7|WL zgX3RNroC9*L6qaUGV$k?2~X`0PtGZYlzn@S+^6ytjJlw6c3GvPDBbarqeR*%70jBR z* zp!wPEFW~orh1YS=NtMzqlBR9K`Kx&{)#k3(^pEDwRDF^XuzhQXDcQ5UDt+SgCxZP^ z#RIqE8bh*9fhlGYrh|Io1C$?0xQh1`Iof4hBk$zJ%glP%0jOz8aExWm6<(957Ww(XBq%eh3Z3L^!5f1YB3&P4>9={0RgVf2>%g{M2Dbt4Cfg z(6g_-gU(&I3=0}>-II0?tiky*`TIckg8bJNevRcdYdvUe zdrJenc**Wg^%gHjE~Yp;>u$)_(;K}nj(F#Vb+1yIHA{MAYa-aiBSmnMdAh>SD{DT5 z2Jw4g4^Q4`JzEWlKAjg9tT?&ZosI|%mBnAb-U*XDvrlO|HusCcDNHVVxf_j*w+I%? zi0m#5YkQ1V`<00t;xL>n5WjY^V8*?F@ZXuUZF%x27v~MyJDjB$cA?~X94x%wde3O| z9|0PSCSJuiw2~`z@rIy&X9TS`4Qz!_l1N-$+jmB}P)f8oyo<-b^ve5>01c>zHvSja z+iPI0{ii8Y$U}WOxA$vh_vN+S%fDJx{=1a~W-#TH-oN5HpsT9JBp7pl<_kE;kuT_z z&*X|Z;^BOy5MTIxO4pUZtA2+ITOLWycc_slj&6p~=TQdy#CniBKQu8X?<%DD&mk}B z@xZNlZQyhKvxPrTXJUY>7t;Bz&z5``{`S*51MyddFPxpk6T=#d9w`5+4_Vnh|8^vR ztUDItB~rF?Fs4>Sh#0Q2Caq$_4%)p6$bcB%x|CzKjw?LdC;YDMY${5dGD*rw(4bg( zt@WhzM8sWc1B)N3%5)MhNPzbAMiI-iL^uHb3E*1O=Hrn;s3Hgk80WMyzgX&^C=+$Y+09 z3HnLje0Q@kFcBQ^hxCby{atrlka)FTEN&(AKhCuqVG{i*TBlI5R(_VYRIw_5^`7f1 z+se#TrJ=={O`HVrr<1V)cAV?u)Z>xwy|P@JtriRRuMCw|Ev>d`RdrGE(t2FWQ2Lrz z(jUBThb~$z_P8#vw9=Jxzkd7brP|e3=%-AkL{)qW!HyHWy*!v%aL7}=P0W+l)s7G@ z6(fePEA1$B8_Rtfln<%hKK^f~ioQ9u`d?0!6bw%rHDTQsUEk-!hEh!Xe~d$cw@FCS z=5g@;WX5;I#x`U5q!Jlv{1;GftnDt@v-qjI$D8~gkFO*pE0iTT{{3r;R*~^i zReFz9=ELA!@lkz~6{LLed6BE{rR!5kL@2nE$qZ~E6fdu zNv+_9#OI5VtZAh0#UdF$Pg+G2O}yGRnpHQsH+Rg>hldt2w??QDBMExlf3-QhjB!Q? zg^i-K3Pj?6-&h&fNvNGs0A^CUhBv+C!%~xz!0Jm}(*L{%aF-nNF8dlni2j+!jFmR1 z-1xGip!B+gR6{k1ls8w^aMuz$JZz$|N`%fQm*D;TAk5Y$cAfWw-E-i;g`490PX*_L z&9*gq1AKq{TT|z8qUlHzvHnOC@RRSgrd@$-Xi2Xe6!Sz{0;yiJc^59e-#C_iuaBHf zk$gh5JZqW{xrArWL{sou{Pd6iCNj0s{f01e77_FUZaw*1F{ zDLrpYiDGs0KLugH$;>BL=5YgEkEhXpZyd0Le@JQ}5p6hQRI0~kFX-WQ$!PR+^5=|^ zU2-OBj{Ht|=Z=FE4akLYAaCYHq4Ljx1pEbz8a}t-;`iUQ)i&j;XWFas@MOr!7nC8h zI0Hg@SZ;Q3x+%;L%Ihd_ZF;rzGGR3K~=OrV}ZZGfsF20KN&3vWFCIUvLlUxsz!Hcoj&+Jlj!J*6<$x0;2{5| zq$#$AoUFGw&KMdM58S3>0vrDVY#WMqLqdLR1O;C#b7}r=nE+Ry&?m>a?2qs95Ym=n z>0Um!Cyp`KE$cVDp|Vip`3QV%wki*ofK*HlubqXq*EQr+nF8c|xvE6FU&F28#u}>_ z0Urb5YHR!bAD9{ENOBfG-qimEq^R#=I(FhafGrNo+i(KO3Dx=OCggtN^ce@b{srWK z${49wQ$(&ON)o=eNA5X8>($PirWG#j_)LKq-<>VYAUY514f$icSN5r@PGnBJ0z7W$ z!qBvpXsX=QWS~ZTsLuQ|w_3Y)S?RqtZUzg7`jveOis>GzKa~(>9VqR#_h7Oy{`pus z0K4kM*{$O3YnNWorTyzB%aOJy<08MEO0TBm%JKlNV)>rZ$67z4;NLlUY7?ep2mrTk z?_&F%=E$?-dbN)$F@FL2p|G=^Idc*Svx_1dVpTSLc!d!jvl$hpt&v*TIA8w)en_Ws zqKvGb-pl0Wt@xv5d`ahf`+vq|ngmB~9>YDTvAI3+aX%Pbl_{oYIJx&N1f*1Qe$_A6 zQ7A+z*)t;cOWI?ewjcX1AjUZT{`=!K2D^utOI1xJ$__j8S6jCW>~ec+e10-F6%@g9 z;=#BeYsM3y@ViTqKSk1wrl=PPvDqrxFzfJCaOZG^$4e8McE4H_mszy!-`Jeeagk4a}~DJM+-`3m~z&JQmB<X!ue0*&f+M5cP zhYL$ukaTexa?~UB=cwV4kg&0p4LX*RmhC#8)V$vL39PQs5MqvG zHLh=q-dj!f$ZK0ytQaxlV#9J*vL-7;W@^dsWx)9*r9e#2+(VZHrdVr=U~TZ;6YXW3 z9f}$`yB6AzIS#(Qyoj*Z)p&ZG-dLs8$0%n;A%BlPtFy$`u3#eoeO zTuv~xUTHJ_w&lM!$^2-mMxWEGOc5QCsq%r?l0K3fiN}SST8YXh6nQZWoJzJnUq$L? z!rb22BVy@Co)c?zE&Uh3(Eix8N;}_PF?_epc)*+Rg?h1h{_3|*f?#18`P;JEI6;po zCt1Vv5ctj-dk9JMpzoi)swge?5UhC$)fKo4tUfI_SVC1XrIap_46RsoqYxn&+L{q) z60gdgN$XmdRXo7H^ey}7QZVqlaDEh$FOw31hn)+bxbu^8Cd^wMnIcKtBlj^Z!9#D& zw}dto3oPwpe_|Khah|Ryo?F;Wu4&Qr4_nqtWL{X1brAGHwMA6)L>`4EL@>l9|eb zjV$ib4i;(#*o-YB8gy&!EjtL|{%&?tEc*25J)s=G0?V})wzjdL@Eu~ljuD5X5*iR& zNLtJ7@vxqm$L+lLPVP^;`$6gp4@2_AhZ0QLzA>BRTf-=ev5<-7sl?($o q#W?u9 zjhFgrVu=$kBkTYdV!`J%$kXey?DKwgfZaA(bR(WsZQIV75M8L2o5ScT19_bi-I@A< zFhUT&{E*OX!sVf>_adEtib?Ix(ecXer$@5uKO0&Hjh0(_ctZqkf9f0x-B`l8?eNp6 zN-;SXxRfWPHQipKgdmLNj?k=H3$_U;bH^ER1bzc#P-r1BRGmAqkqn0yI0>sBq;^`O z4h$5tPFmH-O*uP%&iV;^HCkN`#<*0P^A*ISU5K>TPO1ACdl%65lP1KxXJU;M@HP?(ZWyM1asL!p-qiQYp=ex$-6ORA05xRJTT^UN}yf zRCb%18U-7zM-goWPEMhoBs*nwov`4*E4&U^k>~G0G*rsd;=M!Dk%fw?vuB2?kEn5F zNBhaLFRiN4%~fT!j=;~o)+s@jF*QKpk3-PKGHQ!-yO0P9?l0%7HjOKCxi9l0o_xhk zx@2Csz&TRRm>gkwDZxd*f=}q283MSI#RChromAHyamkl#CjGdRk(5cr^e(LJlsIQ=rHVO6npV!KH%f<&InHtJ<~W6PJCo+|-skfrruPCbVLE z|04GBqiCe8r$);EMcG?MwH0k`qoGi&xVuvb*5d9SJZO~P4|!c9J|{@`m+wtXR+4;< zm)jA!o58zjR9)`?K6(^lSd@un5rD@$A7B-r{FckXeg>ZyyFXqfHl>-MfvOVf{PI*8 z)d3-7Ok*d9!^efE7-@~iM?18esbv@kg&r>4TY*kbpyIxE?&_t&YuQqiFHax1MetPJ zpL-d;dgrm&{TX%k|LjJYs+lf*0tJbG6i%ll{sZL7{HRay<0|J<4T;GdHQtNg zb0t|?kM&Uz5(9tcPm=FK5}R>behs&q=#2Gca}nXgcuh-5UEk}3`-=q2^01b3{U~1a z54;`8|C`B;!Q#?7^Ga-ww?D3foptL`pS0X&jn7H^ltwn(pFGLq{{eKq1`t=x3zdEu zalxE`>ui9b%?}gTNBt({v#wA~aakg_Oj=6qboqPt*+@v>|1XDS5LZe@F7f@D6y}%y zy8GW6RSzS?s+iOx-S^z`JkXue6!PiSMXBMAfIazQ&5f{$$|AfL(T#dO=L&z@aXLVW z#m-_@^9B!@UU{vmf06(dXyRiYn#vjJABl_a(KC&UPotj*>tLdmZfm^E#eE%XYI@Gq zH0+V|-fO+HJ8fBct9Zj9-RJr+VRY2xp(#pIy4N)E^ZuLcvdTdDV>Q+9%24TZ>O#De@`YBoWaUgWSwG~`M0c~UehfI~AufAZ6Syr| z%*3qVu-`&pY4h*bOdD&zt^Zk!o8aMXdpvpTDWbS20o58p+wN3K3X0?$V zY4ZE=faDE6KV|ab`^(ywr8?%aebpljub_%kM+(RQdC~v8)mj2H7~a*bgX}xXb}r1* zvEp#~%4Ax1rONVKKwu5;l70A^aCd{`MciUiQ)gxkDcl4?G)n$*P#BBaSNSE?n6qTZ~h|aChE;phNOlEqLO7^~-u+8~tZY zE%=@?(Yp#?8+DJzGLgBkRrO_{0}zyBNADY4zUE~>bVC}`4E2>RZ%V>vU_O9k!xQ!) zVdFbk;P>-5O)|l8eg8bB6lifmG!*zEM&F~4sw|uKnZ2yKFP4;-G?E{$Kt(qllxL>K z6d88YjMiH@f`><8GFlagQ9S0?tFhmNTBvzm@bT(NLLO_$v@B%?&N>o9@M_hv~cS79O=lKT#x%vjgZkK`XV$#dW}D=~VAsz$zOV>lNdY}ilm&$4)V;jsr-ps6wdO4enqYY$`1siF z5)$FknKQlJkuVy$?(sl-H~Y&5Cy#O{zIRTulllR_ejRiO!WziJJVGepP7fL%RM$FK zw$fbAvvBc#=tEIFBI_AoLSO%QC_dn+85EO4LNYfV9CZ>E6IES+mK2;S{Z1LrOP}IUS4I&Q#k(m%mQp~4Vf6LW-Xm8*49Qfu>xH(6h}=4rgLnEh z!ms}U;@-u>awANxT+7>EN?X4Q1h0*66cUn&5yXPR&_2s1!qq3A?~`R6Mx9b_6f8S7 zIFvp1R^{fTF+RJ3~n9e%Z;ek~g0{L1F2H zn1}}!)n%B~=g&SuHX`c=I@zKI6~`BpEks(WOR!izUsj6|{==k}zbmW#K@1V) z`iJRRBSCStT=cnDJUi+`-lCyMH`a#F{#WDIP+8F|0wE!;5rZyG_hX-~r(fi)Zx3IK zQqf*BUHx$9epjr?YYx**GDrEMf1XBMyJ~evWg;u53L3jG5nI0`9eh8ql_1WPsMVut zL?8c=HHa-p9d(}(DAZTAgXJ=(dz{SG*z^+fGcMejC!sIAjGbsc*^1`|2A>c`n z#$#L{&Poj$N3HANIU_+){BGp%AZnoCtx=mjGgtbH)wX!7bl27UKtsksRic3>`bKDo zx|Zz;zQ&0m?y9I9#5a6g)>qS4nb>+ORxE-i^|F@J>St37Z=IKKS$6cX=toq^l4ABl ziZ%wR=MZEksqtO=Rb?Wr;CYlKi82*5tnxcw4av!FzCJ4BUcO!?or(@SMC2esrDC+9ZrQ9SK^ zxTO>rY*B+8Zjy_@~P5l|}#Z`aO^T@kZz>k0Qvi}!yR>t z$eZv(>*V8q91?x;{cUHLi}P>N zZhp?4{jW=JSZrxtcYdmTkaNhI6ug^gKpoR1d6U!`LYK0@(Mjs>d15k6ZW-si9lkQ5 z+8+dOHjJG;SUTq{+t~hp&Uul%nP(>c$#7Q8!kdjK_eBX%1k1NacHaIA+|$X5SHHRn zS(jHc0jJSfQ%cm4!~3}Q_%jt^@Po^u8#;LALV(w@t$7La3PFO~+^tRCw)mA5H2E|Z z*s=9j^nZX5R3B+33aUWN-XiEm#yuolH>(m zpD~!OEWn?`1^>@&{Q7w-x#p#D=f__$C=LhmD&_QF0-Xcc3=MSZ*ce%^;YKjt<_&Ls zULm_9f&Q{NIeA!eBBT~#=nwpxY*(r;s>}R4PfIfi~~-7 z_3Kkf)sKK+6%VSQi-U?gW4*SFImh4VDzh*z=H_tNZZZ;>R(~)-<}^b(4I+g8@1bFhHj>0~vSW zG!_M%yoxi+V*ukZqgvz-GEr1K04^JS%ydvg}zpGPX8rliw zg8d81BZ}4j1E|lZC-(w(xfZ|q7n}SNv~ga>#v=5lb|6Y1<7>xfykm5kzwY- zt>vr^XrHH0dvc>nEhw^NM817gOvy&COik9WAjjZl^^~+!BZ9BZyzo`>WI;?wkYyZy zDI_)NL?U;A&ukv1=80TE^UqZwC&dUFqBzBXHFf|sN&DY7=S+P3JQcy!VLN@P_BRs6 zDhVJ@ud`ee9%~oNQH|d^1XRrt&W>5npYT&cHe?iA2$<(PADYzpGvE2`xn>oZYi}Bm zSLX;7|BY|vr#4N+87}w0V7EF3@*s7Zx-<&JNK}`9h!Uev#U@Xs7M0Wc zRWg7y>O3UY1;&YKf?l=GcsZ1(czy=T^z{`5#8SLvAclpUk=gsCY#|2KFjwGwhxL{N z6V)2zXQt4VB*j0+Nn}AROp8qIUG#7VPJ`t|OKurqBtiw_{NSLI{KnI%nc$PmAr)Gn zJf$Detoub=5kUN2IZ$@Koq8>@qO+_t;kyZV)C`wDOVJk31`AbP4Xy1z@UXT-GF?&7 z=|Py|2j_ATLOyTf&|jJe=)bD;()(qI>BY|TjlqAiiZSpQEl>e*KGllLd~l6P+Kjs& zW#K!VR1RERwS76aSMwH^_LDAS@seU}hpAMULM37dc**ydkMj~%3!Cs7ejK63$A1Z* zvk%@<<8tB#YEk8-OGIhC5BpMLwb|a8x%RvZmLn zkD)4_BWpo-{zUBqiT=_L0?P9t!IxALd*c51rSIYOoxFAVb+Y5^_Yyq&B8LAz08-q_ zo8!$LUz`}V;g@+kUh-zK7RytpG79Is3^I{u7R4z)d7KnOP??k4yZ?Y`CCkmD*Sa>2 z$O8;D+1<3at&JoF624Z#ErmEV8E=f8l_%2{ZJyl2Un(HPk9q z#qtbgv`DmrGB)*80o^myyA!iRCvfu>LN1v6%3X}6CqC@~YXY~T-(`{NfxZesP^H*U zrGM9ayG$6@y)C(5#wDepU27yLpuj3UTZQ-ouj~F|a&P%AS70|BXm9Ufb*;6G4Rhf6$=we$xH5@*jh|XRJV?9;e0KOalmGTni9CWKKs$$+=hnZ@B z;6HMk2yG&4kT(SwNt(g{%D~o~dgj-A+KLVq?VUNVq1yYEn2Luc!$d8XPe56q9ExDk z&Cr9F%_M)$Y0Ts9*`&7Uf8CR-c7Nnc#*U+`9~c%5Yxpd}{7jWDfqb`|N{mQcsH-5wU2y$#toG;Oa$hC(xrM>ITmiXrV`fK zFoAY@k88q9$izp_&TohK?t^ur{8hI;t^WWnk-xSVajXK+o{sE$OAG005lU4Cx9<+6C zYjs$Nx17{elyWO!rQLL83ws7R&+s8(2R3%Ksc}4aSn&jQ!B%}SJ*@OF8J5fzZSaW*ywh70<@(V<$kE~ty>ysQcmN8j^z_VPR2WaQ zF;US~HwtOs$SoU{mkyxU7M6V_ve%SW0w?ezTp2RDF`?QpC)c6lqU|l{Dd)q0r!%VfGYgPD<)A z5ue7MMsAg&y~K7H-kiH02PP%6Du6*r1y1sGi52VC<8vWUc^S23F5W7d`eL@6zEj~0#W%$HxkQI98M?3=V_|pyCw=?;RAnR zqTjO+s~?Uw_Q+IqWEn|jE7}ZGB5RDKk`oWIN=C_S$D8nyU93rR7=uW36@R-Aw~gq7 z0NlIGTjv=JHYJ0)ra;t-F|1DqNZLj<*3d2n}1STR&tw)^0R^X zW=X`IqIJ}o5T7H`iFy{G9xz(3%sWY~y!dzgB=9xN(H9m(<5|*=sf(+-RxvATfQj{A zQwR*KaCLaLz)M5jsu=GOm+gw?%Y=V20SV^fM>Izuv>`+1Z}Xd_=-*iGzKYBY_@Or5`!NZ3c>b zcmH%1a|Z*gLLNNpd=x0jp4r%ET4TZGOG7~4kd;4>QlDIuJ)(guj7%&0{?B_`nVyv? z&+)-2J{aLxng{H1IO%O%d;1Sz2#OzfKg@e1GK2DIEr!~$^yX8eHzr->Qw!2lp(h}+ z`*UGE8$@UmUMj!CDjKGe!Stl=O?rrKd-l@QeyvU&NUJ%L=c2_c4@*_tG9uC4{lN?- zg~%zZBp(Nq&UIg`gYFWS_s;2;-ApjGeq-(AD^16i;NY=i#xjJ?q+)n)CuReROKe7B zBEo&1-26D>gr1E`^^;{WL%!_Awrt9YaRsMDncqenm}pRW~wn#$8QKFhTkGU?pad85Q}JP&?OV zTI-G$9IX#sWh53f-LOPAG(|cQ3cbIBQOn?~vOKG{ z)e@4jBAnJ|MHc9^v)q3qF}xdy@eXca*_!%J%(r*Q!Ox@S0NrYVv!q;`j&5X@NDa)34Eni6PB<(@4e=8pePL({bdTLs z+Q@c69<9+%jZmK{XQbWSY%^X+siV)R$)MPD=o>S$2tnz!XFthI(?V+zlMyAZoYT`g zoS%(X{zV&sLM|t(Y%_Y@?smK4GRk@7Zf3YpO$lix)UVt2kDRg9YAze6o9lVsaQog* zEO-^pcA{M|{sZjKMxWA2{?)39^4!-C_gQ4Y{o&dpuloa;t}J_)K`@tGi;fHnlI2dW z6zSJAazCx{(yW5=UcQ3h9e$Zi(n-@SOMW8)Lt0pdJ8apdsbZ1gO21tBor9I3d~$HO`y@s}m3Ar;K7|pBGo|@3@%UtI%B$hnbJRJMYCN zvDSD>;uA!0&!T$1kYdA8^d--yM~1jGUxS9aL803eRHu0~mG{p6L(p4uOh~RYmgu-c zCCMtY3Gmkq!c}Ze4K;`7C{sR-BF!TOvX)4b6d87OJw}1piSy5{{lCcp{{T&TkJ$)K zjSx&}Jyh=fRlSK{^nnm%fdZ{20vwHE+*StX)~P?bZT7ig#YH&7QZy+>W*1`;T>AXr zxTSZvquw z4M05``JRNLWJ7}?6>$yt3qagJv>Go%ZeT8Nb~01_vy z2tCfC&{Lba$sM?Y!(&p1Ht~sGgeX2#%F&J~%Mq`)2b@N;;(3DQ&xn^5Q;9Wh<{CGx z_vB5ThSD3icvP>keyTP5CJxf>lb%i{hemkvgisXCgnS&SJ z{S2ktZ{!j-yWc+(|Kbh$2N<5G4Sc@9xC^ZtZ29Po`P_z5=>#>)bt{-fyjR7Q_W`O1 zO_}x>g7L$D?ugDaqZRjE<@haII5-&EmF5)+(wei+RuB1P^cZT@(_Kv7w6MFTs=@&6 zPBv1a9!TBY&DovLN``u92L(wX+vuC21JjHWO(7vo`4;Yb;vIcPSd9t;zdXpFk58B@ z>Xa?#&%;kx15?WAAiGP+RC-~&+J#18f$)O40zD97Wg}F+$G68f$tY_VT|w$=REhf! za2x!1>U^@GJN`sa2mfaJX~NP-qn&9DBqB*En4>39pbiYM?8GG|Wbs7jSQyYK#`Z^a zXDG>ta*A`pY|W#^{W^3U@A{G5wW_VI*vRabb|g!(4y!DeaTJO*Sa zW`ucAf7w+7CGqeri?RF;elEScmGuk5zZRG<5;=VRt+u||?>!zl_Pdkk>|~TC&$4Yw zR-?a%N)T(bgdZE#3SoosDsjCz6*`HSxRC48#c=KVKYwStp^H8ON0b)TF-uPTF}t`> zfMg|AD>cK2AHj`n!Dxq}AzFhECP{(bD=vc32y$D7jTxbvzWahwDu?MWbH*#A?4dNe zL@b-*whYV=2HMo#PQ5ie=tB`-OL?i2u6<69{Ccv)NA~%T`Ekj4Ra8z_e1%!L=;HR% zhFTMTD`s%@3?OkC5 zw8lZ?sIdLB6zL&ApeM0{f~pEnhjyBmtM5s9DD>;=1>$}llK6|Gq3^q}L&+~>zE_=BE;!({ z6G&^5FgsIroi5mpog>Jcy*Z^Up^<)|r$;liF8i|C3+bd^6MZjLo?_WZToF^hP%p25N3YB;30EJGsS@; zb)A%VUN*5|e>K(;-H>>>%e1F`)?uC9t>do7W+}4vAbQ+sbySp+`AEhSf?c0Ha>zHd zP9chzH@VUA5-18n9o$UlymGBAdr)t8@e!qj0Srt9nv4OaebO@hBiWKH&FslQX+D63 zA3D4;q8x=l?#!Tx>sWQ}`Kk9MShr1@Tv;hd&ZA3lK^^0YS*T)%Z(&=^0}9^W zirrc($sV>E@$zKw)kIDk)XxZ&&t@y{|zOiPA@l&r#zV`P*s z1?KzNBJ90VI<)gOvAcl~KjSa`%g~}MgrW3t#AhjVY+sJ@!)mLZ+0lfd-FQx`KHK~~ z>TmfZY(h_0NK9Z}wdG&p1cP=VRpU3T#z-$ihB?#kxlZC+36+hAb^lbN>XI0$36=K= z2_8kTHLr+Yl}ohh(xwYN@X^`Lt8qD+_`)G9p-#Zx!%~;TLL2*s+6Jzs&Jw!mAGrz& z=2M5JTy*+mQj2jXf~Sp1d`k(MN##rkSh8+`40_5Ri(u*it>=EJH`1I@Y%A|hQ#V4y zYQerO|I^>(jG^?h;&5uM>R3G3Pu>4pNiad(<>pHHr2?Bhrj;8lxca>jd}@3@Y+o$B z+yeEiYa_l=uU1t{i&8?Y@JBYk{S_)Pnk7Z}YWrz~cUNx@5GY1VTa#jtfkPaNGW%-8 z-+rO8bSO0kUZF#<(^^c06)S%Iz?!e@v@1@_w{8dLibN~0uh`}>`Eys)?CHM((lB3W z^maVsFv#Lv4L{mh&Cu(EQN#DlQ<=k9+i=?+SW;TdaZi77;Tx6?{0CqjUEtSFTMEVG zjdd&btCi`kG;%LH{Ri;XdDJzWY{5xuost?qBtCgB54@^0l~tfnIJqt*8{Q{gu@Iy4 z`H#82{~voR`xRsOPlS1Oh=Sf2GwN5KchZPu^P8LaSO&Ua8E}rd|2W3t^2%}HC&#l> zVylh(f=YoLZ3PKwmc~99QHXT_`DR*7FYAQ(6h&qRQL;D|Avm*5kas$?s#+6Jz5YDu zn5d=idV3n2PyGcZ3}Prz!N9eA4X1R`O#%y|91Tt^#bev|$&Cua?kv^*N@e@$qH* z4tCsDZZun)j3Zih8vPPHWIpAJBwHF&@?GFS@h%42gAY`&sKnpo`h(6tK){FVrTxXa zrd-RW*axgm;rsx#i(-#M6a?=xciW0|#S*xJ8x332;=Ls^_==>0EPz0QmsJIAs&~+t zC0c2NnRWPET_qZaO=pS&*y z*O|ZdiU6{ubzOAlZwH250tdr)(s>NQ$oNTT43HyIk0d{yAnCP<%J=q2hAJj){{Y^f zzBcx+*OZkT7AKursSSOT_z@A5qO=xjlP%`V9Nz>`mI)lQc654xU(a%#PmO0%9XcQX zJ{TihYa>xxcek%OySh+obfjDFsn&q`(Mqw2FI^aiRL$Ey3EK2+ySF5AN*@)lO?;T! zo7c65>Ap74G$h{**zPoF>Zu!X{yE@JdIwEv89+1tzVnlxEN{mN%Gu&S@HjM`xX_qm z^BV$YZ;XgB1yXIK`FqNEVVqbj|CK2}eUG9uI?qvN8EK!Fju6bmVZ~@nzk*p!c5Iu4 zc7$+O@rUY!z7aN;VhTOeo&0l_P@ld5%TNkG&U_pbic4>>bBs|I+09{Ia=Y7U_v_*^ z3J!z+h$B)~cANFDV+VwHU;%r$nX*liV=dQnT&=at@=DaeqSBAfT4}L~V|%gvlF~d? z*Ui^#EcsSUXS4{eqz4PMVS?%bnMN}BF~RB=LH__M;!TZAtV>J`w5U=sNWkNNfCDN^ z?z>h#S;EUQ)E*yN|Gl1iNXV<(tCLK+LZ&a9V#=;22b45Sv+EDF1-7kZ54S+1Rf(?T zA7lwV&?7kRo#Q)45p+C?u@N3gFQ|D~xjkNjfx*m28)8)RSt(j)#wLzr+TrqpXEAcIs-!Ju)Ns=xtg`H=S{MLoGU*g4~b?F z^~PRjpxdqJ-0D^HhpuH0lHJ4Y&bc97Saiy$)N}XcV0{}&PCVRkB>e}tq}wpbTjrbo zYkR`ll(TFNHerVisOm8x2L?xkNB)SHfK{TFCjpgNrRz0d(4dz5gn7Xw{i znejLcs;RI>om0iuSe51}Ey&Flm>vfeW`(Ioppm^Nm`RXrbcN@W_=R8Gy=A|muE}jA zT6VY?wOFQeD79w!VoIkj#mwkhil^F`lT~Cw`t5+GgxkVKK&&xIHatNr%I^kCu&MmE zMc1&^mH6$G_{*Aq$arT9o2-*{t4rI~Y{H{A+7cTH2?5S`yk%Ri)Rd&=;4lCR{I{eH zG?z)8Wr2S3Shdq_&3qx5)jSNgX!9!Hx%{ZdF-MqWh{aAzG#*cCVCM?v3BGtZc}?1P z(^IA6E+e#{DkXPMWR5WI9CF(Vb$zH9HE&l8nc>TX1IlgIWoC1$r&@13Si{= z64h=?2E>ew!DlK@oD{pzcpZbMw6;8iNMHVl4(q>qSJwyxHa3DMGH)>ua?)SzvnL>D zXC&yWHTIMSFHWFvm7+K}F)TU2r`jHw^zSgulZx4%1w%iCXo>%!+Q(Lu>~7$X_>bmQ zf>cv_dcf}_9Qk3IhkG_wAtLPswF<3ZUQ~SVtX^VAjK-iz#_3Enxr7({F_z^?tDQj* z;0V*ai8}uGzkWgdg$Ad1#CKQVce{@`Hw&(JBEw z-I+Z$^A{#Qp?qVy-b5oY6SD4R4{8F&gYXjxL--#k?$}Yjt_d;HwKy?!oag0U+$=}M z`P{mmH$rT6X#qEDg7*5)KY(&aw%o+^u{mGDFR|Ao8_u&C_FVoVG+UF)%NVIXp&dnq zKUY5>v&q%gg2{}q#_00|7sUH|p>lnS?#foqveTaM!K}q272mhN(+Ow`ny~RWYw-@ek0lDdHfmE0g&_ zmE8R>rj74+eE3@u@_W1xY@yg)IxGy3fZYbBTTx*apRNnFG(kr!sIE>i5DUw%iv$N& zgs)BdtvLHw&%{H=(| z;~!ui4SjQVh9XQfRe~}rsWvS^!n3(s@OIGuut0WEoinh! z5~ha;IajnShFexqF8GL(;$3zy)#2kTIWE^_8o7diAIHb%&>`;?L`U4gP~g~I1mgO z_W?v#VLr;uJ)fS_AI72OA8{VD`f(Y>=~CI(xV^GT`i&yrnkV7X$~ zkSsSEGp-8bWX2dJ{W^jv9lK7Z+>a@eeA=I3-6@+z=V+_t+HM!?M+DK?3P3G0&ej5I zW9|3vo*g{7eP^X_0Ww0|EZ-&glq&d|3l6Qw*}0QI#%7$nv=mN`+Yz9Il1QXai4qg) zn`I_4Zr|tiNj0y2&1=nYt?XszXX8c$cYv;sqdb#b(dh@`5(<=scHy?f4iE|T$uSMh zJ0@RCwAQ=CUupHfb2mr$I_z;Y5iiq+3;D9=DPQg{Q965AcK+qEV}?_f24$r5N>e+_ zF?@Al?I|c6O;vBnj53k?^+8WjP@BQoTI8ZQ!nP(k4A+u=O73$kaG!ugTOjAtyLa*n zaJ7-gjN?Te5aUgV-3l@8S(24_GVSm?hH6NAFSY3(qQ;z#*I7uS_j(eEh?%+HGn z^_8g$3U;rE18H-^f>1v3#b?Lii2DbSo%@c?L+5ZjfpW@qutCq#cbeH@gX%3YFJ(pe;#t{oQLH4oxZtCjQU zg$d^>45QJcJQMr0xyp#Ict8qft4EfSx~R;aURZHH!C=uPvJvQuxcnZI#9jA{A#4Gp z|9622*aDCyV%^xcD9R}=JK|*c@glo zv7naozlfYTr$@@BNX%A2R^qS?a%&?CT@AgO<6Dvxbx0~+V9=;W$PSh_*I(W7KYEgu zY^=gxhCgbmH+&%j8*gUB#25{DPUqIZ1?Q9wg4PJ2R|U}Kat5&1S9#GSVa5g4HaKnJlsDj1lB!?HhLRN9a})2TJ#B$U$Yp{1%j4s#yi;O# zK!cb4YYVCKe}IXoC!RpOC7Vp{M($TpouTD0F9+Hm*m2PVbk%`BG2SI0)0y5gS{pJq zOFTQ35i8*)&L5e|PH{uYBi+6IdIcE$Znt6Vxp1VrpSPBVn&>)quFRzTBB2>~W-Euh zj|q3WX7v~ovYYv(UC*eFB%|kzr}Y1|2|l243aC%XgKZvhp_NYBL%JlpigdoScEa_` zINT_ILK2$YW|<$$seRL2%@-8u(Q;55n~5?sxci0)kYuqhFDk8fCJEyUX{b9zoD5^d zD+IW3T}UK2sTL%|LB}_a6z)PG>(UU26u2H_EGv>E1^TEgBhvauF`r4?CeG=Rm%zEx zW5#&1WBX6l>~%q9L_3#;ew#GAJ^O(NS5e0n7KVgG65``R0#fU|*cT)dr3eHc&1zq+ zuqTlqO+VVO;^T@0CFD}V|In@7jipJbNueuX91SsIK?~_a;ii<}GR#psYtbhxKe@@^ zn$oCQ&3;LNFuOUU5>BGtYGS`;g*reKxCyUDc=>dKrZnA3Wkwuktyy#;SJ*O=}wo0|3Dq?hh! zfc(*Pms$P4wSx0Yb#<0k66~RPLI$aZLY@&p1 z`YwzSIUpU`J(kaJg;}?ebyL@*zhCZ(A(ZlS`wJSs`VyE07-11=F7b_><9B@fCpghe zCdSw&kBLG{uI*;n?Im$$E;{h{^|Xfqan0IcB-)J?!Ab|eFh`4T)$76Z}F;c-)EsOJ9pJhbcT;3h3(`#G%{#K;6tQ;=rMC9tLmAg*&OJ3kS4f z^4~(Sbo=B7qGNex=d+k_i;^_Sb3CpK5m|F(5gG;j++KZpjArPm;&v>da@wCs6I_YU zYOR&l+If!h3oXD)YUPS&_>S?)VqGH3-Kc|eWgYqPu^6v7F_ZQ59WcgQ>ibzI-`#X_#Tjx2O%DA%ZEC-|2Yd8wKaV65L^>;FpOya?Eo)%&mjT1mQ^S z@6M0)1)X6qb^USrfzB&A|L~ASGWs_zTdHJtwH@wI6VH+=$cZyh#+?N2a4^-lOVRuMHC~<0a zk6P64c1udhG@%m9i!L%2-;$ZS0J7iEKj70blir(%TU5I9g_j>hy15czrIklDld$$R z=4j9>bA^=AxejQqsVD&(P7iEVvwz-|q!d^U)6RsL-YB-|VIsGX8e>sg+coCJDav?y zuj~X=PyMoC#boa%)s4@NFh=t`<3eEJ;!M!+nQmD-todQb8sk(0&K_x|^wUWl_ud>4 z{@pNrb)1?yGBv{`Sgi9>3X@>6o z)oU_Idh&W4I(}LSnqQuL+fYQf46thTo<+HqB5w!NxWl_v0Vl>-Mk^MLO?koadbHTuMu?XW|@C z_->x??sLfAg&M_{#U!j@Nu;set&9TmY)S(&lhz}yYMZVoip(Lp&AOdJb(`9|us7|1 zl@gvKG)=6D@B>zOnoj7{wF<}2k`?i8(9};kRjQymK}+$w{EJ8D8bf?`&J3`BITOEH zVh=~B`9gpnKkYz0@;P_lCx8b~1I|<_qM3Rr~1j#5m=HMh)e>*jEiVq+$v?ss& zb&!DqNmJ2A_`+ZHiUWciKpBh<01c4snA)tDdQfGt^6CiL; z#?i}!f0ErNUQ263cez-&_w9j=j#;}%fpUP);Gf?md{t|%fL8~QgH!Z-F`YA^6>G~YG+tY zAivw!Nmuf=O(zNkO*wOyomE_qK}~q>5J;GWMiJ~7zu9_vbAO7DF|0nUDIpiy^&p<$ zfpoO0r%~#dN92Pvc@Fi9!q<)Hgj{t+)gV6=9fOWnak&K6@cOZ8^4j zFoB-RGDleL3^@`9m5d8EVP#Nt7~EKYVt{tgMHE-geecs2Pe~h-4I-2w=02}A`O{PDjP#QHP#DFxi?biJ0nDVZak$^^C)29uutxj_IY9Au6nsQ&wM>*Q}FKqzGsC1P8WY0$o1r~0D{Nn~JI z(i8{ZV&9$-Ixw-jW!IRtP>aMU$#8ex$C*k|g~u;4^G5iXT1`lPAgNDn zkbD(fHk3^UyMuHs4$&)HJ3tJR3rp6p=J=%z1>W!ib{apz)W_+0I;zt^=A3e6LvnL; z6Xj{4`mPFgeVR+45&OIOHiNEaB8r0DNn z*%KH5wVC`Ggn5q3qb;z6%%% z%rq?MZrzmMZ&Bk)#fL`)8!3_)Ri^S~i1t0h_=KWe%hdskj9Q%R#08BbHRTER{+{9o2L$Bx33xWc3GR;((QY2s9P-P-TKNRB-V8jcMI6^_mQQO{@eqZk{{ikvkOqz+ z3~sxr67?ZLZQNOOoSbEI%jOh$KkSgje8lMJ*4Pp`;VwNbuMEWp&soxrC4b( zj>*`~GF(bKFG5RCUXTym$$A;eUpPWMq$CH#hcCXjreh4{O#(6!5k zhpxXtljcxi?s2Fv7ht*xHuvQRme-an{QqI6J~N}_P+PN)>^-H|Drrs)!el5 zhw>{@El6stEk6rOdTz>KEvaq+eRw%i0hKJx)goHlNfcz2-3j@NzmVFL8sVrE`>pp16ynO(zF4QDfzvdv=720eje z0U@dg36R2|4l`(Jh|xjvmzVK}jMK(uq)XQ#Wloy6v9dP8qorS|cVJMdmO+=Z5CkSl zox6x24pa0TNp8cuu&3W|gMUf6r($8@huh#2^e90ai1qsmku%T9UB7 z>q6CZO=jhcdywRCCa)Lnzi#vo8HecjAX9U@`#?WaQF6hwUR8-STas>WvxE{y+%Z9k zwS?h?e`rgV4P8u!p&j=lFAh7<@gWPMgnEQTB{IFjnc36O<{|+jSX&X9 zJ925}CHSJ*E~FAOd;|lQ10tslwWJZxl*B<9lijty!U{x;Bo%2?aRv%F!muqK97aO7 z-<*wZE`>+5-@-(Aa0#1x!S~I`@Q~o7-~%p9%y%LyC)gI~^{2~)6(<+HT9i5i$)i;d zu<`A!ZxWS-2Ey^Y#YrrU*IQb9y1Ho0uCriNQ%2G>ttY+{(>y=U`j{>}&!dZ{KGA1IeNrIzA?vFO z<_p^nw0IIn^~v1XYwrNa`TRz!A;SxqL0HR$+yRbH+*DHq*Zs4rLNRr>v6KMqH%yU^kY z49H~S__d}{9?<7~3X>NnCO1w(JY`dk3)61@83g1_Iq)vX}NA7x8M8m`#W7>=AJ zC{89UktKtLj3hl@qJ2R5{}hm$K3(fsZ`#Xury6MiZZk(PZ8|5Pw-gWriq4r*t%9C| zK1GP0WHLheqt!gQ@b}6ux5_MxrKw~u6!W%}^*yJa$jMAaSdyb3D}yo?Hy-`)#o94< zfbe49slx*uc8>)W@y3l&E*-JO;9cV+M{~r6BclRuiDln5)`}o7!q2s>ekLq78oXJY zl!S))V@kD?)D_Fu{T|*5={Gi;gQMKW*`oMNoH^s$Y%EqZ`bPTK{Cw)By5br`-Q5!j ztP(a&_aim3Wc~*a4B;q`m}t4XyR;m15*sG7e=`ksOp~fEqK0f+5KG5d9&$3O3NS#C z`X!vtLdlx*F{F-#{s^ac**!27`o3y!F#Ci!q?S(Y1I#CzYc?9cY=;Lv>wNA?iBCvK zC>Q6D;gfVc6V8JBdRJ3b;6F*LQer688eDSY-%X1nT2P+ zJHSc`)wH5tyGbVhryC5 z=@_AUKJs%{+vj8YMzfJs$%Y_^p`Wf+{CMD8b25-l+#o*JA^oed;V!Nrr zWCSl+knZgVe9TqUo1E)K0XLunGzTQhVF6K}fU8MPkr`|6u7x>@9?a@iL zL$AoNE5|**|3hnM3-Y!2Ox_yLDOcq^ct1*W-Qm>TjjgJ=arer^u_&^PQxJT-Oe##{ zEMgVyXo*J#Z<{eH$mvOqPo2v}`%16(MukMys467y8Z;1i{*An^f8P`%Vx=}wxA$6& zrtRs4O5mNq>$OkDCw1|KL2>1&D=)jozi$bJBJ3yvdp-%oXN~2CeVQ#VeWPhcNJ*q0 znH(xu;C!$0b^dl}+w=$M7U~X~7g<|yUgHhS@)i%`C*y3m6t?4MSd4^n_l`uJWhTQc8=!=sz=TY~?*n@|J7(}w0Wk8WebYSf#vU&lJ7 ze?Uo;iHT?jXzD{htSzNME!!7Ji$3w8;A{3%w&>*jFx_>B%)(%lld)_o1TkX;<;M99 zb1o(00P+Ks@K9K}8W^{hDQp>NAUTqVa%LC{8~HTlzn5ZK=VI!gF2G}`6hXv>ZFc}o zbcX>m+^&dv7Y-t0yl7j+Xk(#v5;XQ51GLtOMu<2&5yYx4vNYf6=OA@5oqg{RAuDI$Y>#UMomkoK%fX=9hMOHN0olV`ZS#a7TcMn z;a;6rm{cQg9QKEpBT&Mrm?ZX>w!_QTUO?{aks1I2k^3W50o5zr-+y}FD#JJ}oIS5R zer&&jjCnV{cR5>*WDND&wL;&Y>Y+fKtCBV6J|uR;7b89H%hf$!|5Ms9s1| zHzjapm^xBh1zG8IZw7p-aDutb+qIL&nW=^(1Scy7zZ#m#yR&l*p_{#V+07Tr^ryzJ z3i;-~Lgh{JG$yA6+5Pttd&>D=RxRt5JXwj}goe`uJ=(Sgq|m~{q55sIod^d!3~E%$ zAO=PHmyVK(ilj@~BL}0{wlqy{@dJFzN{M{I>B1pn+awyRcO8w6)3ZQ!uU{Y6&#;N+ zoJc)fI4K1^W8Z{SR7z@EPeJ{qjJf;)weP4PdDhGcO$AGL>>tx>#lJc~35dMA;gM!> z{_)X?zb1gx#DJ2Lo0yc-q4aI8W_~zy{KhbuK2*s%CIfmrFO91=5+HYu_5VR&DbX6PIvLM~z_d?9j73r%`kK+HSLo(0r;x5IwAzNXDh7DnK2eMS9WHgy5gu) z6f)(~T*&Zf45ws>{c=Mq2M92#G2E|jX(8t*J)zb>+?nsPOaHvAkG8~Pdta0Rr?>XS z`1CwNEax~ZGOk@y!>V*P+tPS=&rSRH>++#x3N7B|U|$dn@eX}1MV{6fmS=&L>wK`3 z67?$<`=^(~dw&Kt-s1-QL(k9u{e#m^wd*aib+%69IQA~9jH6TMrT=rN*n65M6>ES3 zzCJs>J@X=T;O>7Jo(k70dM(FS`Y$x+_4RMOU3KT(Nt%4$e9UB@k8Y(^Krt8qEh)*l zjb1z=)X&vvb8i-{YBnmlhatzbl|{6X89l;OvwEuiQDi8WIIJA!y>O=(r@oSrXH)rj zap9m4GFko?Dl#&CX^(wYxNVws+FQKZ=qvPAwEWm-!+djK1}gHG)Ry_lhYVHnX!FK) zCzbA2VgY%(n8Z*sQ(^JKAPSv z@d*$7d8-0o2*=Hl@_6pPbsr?Jr;>=MpZFd0Y*kJQ8f+Fm0u<6 zzHsJl#i4|{7zhXaS!!F+O#K3c>Mit{V$w0<_(||%WHab#5Cv*~?e){us*7_z66GPI zVSe&7T>nDKr?&RcBSgBtZOO_hnAk)%(zEJ~_t6HZ7{VeSPoi)!rOrdjM2iy>FVMJ4xiI{eBrO_M>qFHGDXR`YE zDV%|=!bViqWjIx9$FBZzTtVn+qJIzhClQ~)|*@<=OyQ2KTjKRXZizM`JIKZf{}9!e3vF8qM3umfpoYUz)% z+6Yv{fAlP+hT_$aomg7BF>b0&VF7&>v$4Vj@e4seA|4E#A=aQ*x>pi~O*F=mL1c(=`xaBR19@ zMguIq##u+8yRsK59DIr{g+_xC#Af5vl=A<3zNox>m~lk~{$f_H|C+`B{>C8f-Z!6L zdN$4j%=#fEWFZ^^>rw1iP?_AK^^4LU0U_5E*RX&Z&nR*jI_yaU)$Wp4^QddJ=5+L! zD>;OX3TflOGZ`Oj8b&q^Ff#|IJX<59HteJRyPOQU*${|%ibkM;kcZ$NYB?!Vg)YnE z@_pU^EqlK>y&@<-x2Euubc=XJWE6Aa;L09}``XLW>kZQP!^PJ6vOq@lZMA=Vv!pElbdbmS#N zmnc-E|6hGn18v9o{5cFu65F%1Q99O1ls_(rivP?&U|L(k)Q9Fck`$#q_} zf`XNOI*D8a-($xoVxv@^REs=%lNob%qg(Ui>a+>l`q>yKH)nBxLpr@?Z=rIz#EBK1 zFL_;E3u{YRtvF@vc!k3$5&`Gedp2WbBM9vmDhaMe@HH0ZOF+x#l~(Zv4*L6hW+TL)|D4NL;ks4tw0UWVuyomDfv-+tI1B-r@8!e*7L}42Soxl^Y{S z8%(q{qiGnrP|_#fM`^q8FPk8>@-x5LGZ$f|dw+tN9fAS{ts{)*3F<7CJtx6jc@$ zBC5X;&D}Zv1(6h!po7S^=g0z(v>eyR9%i87_tw`jUi1rwR2#`Lq45s<_16J@Rf>%i zvc(ODUX)%#i|?ygNO#3X0FUi`kF)M-e}0yu5yjDkY8_A3bkCqER0~b)8O@jRp;LFhIi~Y+& z4P7o-Hh$-OD)p0vv7f_;0=BM&LZ8ii`EEm_L(5>*eoDqbn4rF3>QI^GhFWM+8IEyp z!{w|qx?<}yqOF~RCX0N|xyTr57DW|ITtBIes$ns>a-#1;5InmlX8iuV)7(DvPRYzvcjpJ~6;oR zcKl|}3|ihPvkRC@BKBF~4rMaj zrCbzW9Z7uvHD*XQQ!u`I5=H$i9?S)nB}vYTJv~LVq%Z)oaLE~foXW4!1j)<=qjk{| z8R13mJu6FhwkG-#7PiPBA}Q@eoZ7r_0>nH%>1MX#ekAgh^_>KlDz(twt!ZM$4*j+e zbOSnin6qE%QcFU%St&nrfr?O!;x0+dUb>5NEweX{54&Bx-G;X{Dv%x}-mksn6;(g& z9qisCO8U7lR96Wx)4Nh2i7(F-{U8v#>Kj@2$^8BKsA%?IJBGeVbE&i-cYLvwvG+D$ zdvTd&887k?o4fQs)@`Y<@%2i0FW6!Hf9xIPU^GJ^4vqNx1ze0r7l1N5{iW3;vNJo&>iM_IG34D?B%fCWYcHZD_?k^Bcv_vMt~ zti`0D!Li}zsMYyYH9R8-TY!QhlTUW&?{CIIr;5VZo>e&NVrEfcQ8@$6W5V1x(B`NG zG8lpg5{!mM944Ou?Yjy~PVog|TK#Be5H1p5s*3m#7pthwnA|W{CWbADyJ|Jd@I3O^ zVB~Aq7@3DU_M@qxeydOoGTDGs1P&H2DSEF@`|*f3px((FZ5QC^j3~DY>cG4mv?Ox- z=%awHaf1Re6JRE(e*Aj;l^-n$jUD~F7}{ieg+&hvYa;$CM%quq2tIFMJS*(b{A!^ufHA9{`D`2ZybW-wmp#i7$D>qJb#IfT)VHfDHu&N-6{Gx$E zTqGsdcDEg3az~7`Mpnt{iV(@jZb?i=P8yn3!_Bt88Wxo<+w)`<7Be+~t09_db6#Ew zfD+XxuTYc`D)s^BB1;lLX%JSWae6jzCw=3;z}^XG?TJrsLkFVr)&)3ehXO@b64V`=J^gz+e2=b{h61~!VH50w2w zgJwQ*LnjqRWdfM`C&ItIGSGI&{3^1pClC+Uv7{$fQd5*F&A05%m&Dh_(|uIk`J!My zd3RDd@MBwLwI? z=?cG%U?QwX1(h_Oy-fW2rwTQRujSK8DIwDUvZtnYhGd_9*5kwxP)$a)j{y^mACIBya5&~__9SUKQwv|$lOKXb@@7c{Q@!OydY~B!gS9~VG-l^0(BI( znou;h#KcNmXGiuN7222i^#g9EEcK0jUp9HqwkvdVCJVRfD}Uvml6&0y`?|7U4-B_J zAb4V#E1K}Rqmdgt;GAK4TXh}O0`~D#&5`^jRtU8L_-NP1bE89S zL;i=);j<~6eKOlvZOtNE)Bu()L|6iH&Ubrc#B9{E*SoihYlShp#4$#uW~svZ zN`u>$NQ`tVn8D$0hAJIx=s;t#wIB^~>iv4P50u?%3ZrM6UD_57ePu40z=cie+r)OW zQHMJ1cntjA&$b`B&qP=?7#Q%Y^mn#MoJ>^LEK&ruYZ{=O`g6J1xW+&X&+zc%2zo2I z#g?aDW!DC^Ok>9#f|O)dD?A3l!;l0yhIA^`wKXD&g3@^%EUh_DHi>xqK^^wXpD(Wv zh>(eGTIwYGYG9=4*M1u7~%|38Znbrl?5x418Je@q)8}re)FTcB_;p zD^>$n$AG_Qbl*TAA$_x$qNJo1j|`%$zu|lqa^}eNlcCR0sqaUhe{&_X%@n!syX7#j zP+D4akkNJ6$o4|@?+xS(=qDNfp6kV_?+*UVtDN}F+=q*Tz_vHr+tpkA#kmtlxXyW& zFGRz&>4tI|cM?i)U%%cXY+IgKmrBkX*E#)TgyQ5x4?Moq$CMg>hHBG-svLvdf5QuY zKJL)ne4~!V`0!|;1WqkSh^#>dEQqPMsWosEbD%sd%qi}j;+%#brau=1Sn~GsDS;d9 zD}CC0I4t<0!rh&+WHbpxm{DFVN<^x61G2w`|HJN2B~pY*``)l^OkbE zJ6Eco@S(_Dc*KJ4WikQ5b3U@oNToB!FZZ4JNB)~W)5~P4+?AL40h>?h1ZL=2L**9i{ z<^~=bgqDQDxufRckwH>;lmyt6pKC$yA*!;7Ts*6h5>7dXi;F4mcV!u#1o7uGs?q<@ zFuvs)?ZkY+B{nl8@5p;@+n%Eg+}d*&7>e3+O^02z^~|S^|FJ~KiZ7#oI5rJ3l#VF3 z4_6qoG>L-}4faQoM4?az!4YiIA;G#aZ!yf}=DrFnW%x5z#ik968wkh5g0ITV-9ytQ z{Q?h2!g4#T6iDkVaIuz!In#}NQdk~h?F?lqWURc?*_HSj!+%368VJ&eD<>i!GkLkJ zIU*aMS`f>9n^z?07$BF_jn--m1gLlFlQ@iRpk zedGJOJzq2DwDikN0h4hS}wQB;#xr|s)OIDv(*!2`|$1QZe`j4QG+Rzp*l^2{Z~jq2oIYx z0ps;fZTq54!fmuVkVaz4*P$!5ZD`f1NVcoaPPT2^r$^Wna$T8+VZS@WL8`4;WSP{h z^`W~ro=^Vw55MNfvOi3&04+Vu12=C%vJ8#?fGt>t!}Z;{-O)Ah7$du+LmH%##XMt7 zt(rLERMI*Gz$Rzc=zv(V-r}Q-9=BMC}MI z&AZAd-|O?8`0})c(iPNxppH#v=O%*2lbDUJbJ-n4U&L+Sj_|6@+}+MKSm|tfTBJz)z81S+HeAm2?X)&! z?YT<^Z96%>fogYa(xU>Qfc9$e;fI=M5q>rG4WFeYCz5=m!atv8@og8l9iIwgvd8!%2XR(>N66S&kKh-tr?#nrkJId<(RUN;-{`iMk zw|DlZQ7iM_e-%+X?#^;aBa@Ti#!sA=C5JMzOLaD61$EtoBX2Jr3G@+m?uXQqB}Yu&0X+QUImlZ|C+U0;DcLYPZ857!aAK_c zEi-8&sN6a}_aRAaPPB`iq5CL#t6+J~8*^S%Nhn7dxoQBWZY^5VdUwTw0;?-9UnETQ zC z?m38({w$8s`&H=g@Yny@ZBP;(Mf^oPhIjqli@IP*Q2_4eKsLFUg0vrbGTz2(=8N8t zv|2cLX30dRp$$n1i1cfzu$c-Qv+(O~lkIYR`(xGWOy1@6&55xkXric+gr1MTbFMlS*p%+7K8;XfzTNUH1J%D`w1SOqrDz+xM?Zj`=2~ zIb3e1bH;eMbre(udCH6EvlT^OFiwVo;4yzVq^+g@qsIS=z-T&_ zBRv^RdR4l^7=JbE!)pF1bHW@!mGAt{&)OJ3cm z8(HKB7ByUB))^w)`8>@;3VB>3A>sBxi=jzBDIAMh9`M(n~*!2pG@Zu{v;cJ+MaVAcXYbr z_&n>sjcRd}Wwr83{9g22lNYnW35s%#=sZdR;ltd^){dI=K@?V~p0#_!QMyt`_ zF!;M&iX@x?*ywi9*saUCe#FOaQC=#I%SW)`)>m}a(}lGHj|V?mbWG~rbF}BOHS8u% zxqW3=@=3%%-+K|P-WFDO^uFA-qCK%v!MIGpbe-IoxX9uhay!e+D-}k=KBa3Idv!4G zNqKU&EAb26wC#?iaZak4df2F?osKj)4FhwWWhr?WoX^quS;9kZ^R*9<^tjbsm87Ip zdEx#a8jRC2@%-o6;TNuFTv(j%I^P+>?YedoJBVwPn2+icw%<>U7Qbgk~;>#0_5Os`0=G@@rMQyf2!BwbZYVK_MF4UJs)oyHB@~EW3CuzaB~YM%d1>gPF`2LdS_=u3)S?T=*BMX zgBH9$`%dapn%_EyD0T2G|Lr`1XMl^3!U(>Ku-RwO;?kVjrrO*Csq1s=5A7WlzFf&P zQRnI8-r;B-J2x@VH0B7EPlT(AQ;ej+s@QT{NCa?Jr4nC6$myOMRq9H9lu4u?UJ9z+ zJo@qUjXldx*-!XDOifW2yLC}vcbWcZ7|rghwZrvhhxf~}57kI=jlLc#L*CHr=2K;7 z&m)^OI!#@zxHn{I3meP4ApNj$6aSsxWLH;M|4F&64cLkenc8e7P^6$69Sn>ByRjBcF zlyLC2-1;=AN{0d8v()2v)#rZs>BJ(J8)-latfsG*k{f5g3(G>|UWBa|M;C8s5F{M- zIZ8R8L5t&T4TR3FK@F6=xY}uB3`2!!t`%^~%%y+O`WR4(=B%1_8t{eNe!5t9NO2>88$(cwx}S35E#bHTdOk@wREFX7f`?z3#}zXo;O zHnB{wc`%=`W4Ld1K6(+TF;u8;-ktews~*x|S|V3!rwzL1W7hv^U3=8bJGJ?>&(vWL& zZ6dhOE?fQaf~g|EaLQtd(tZD3!?5bmXINTx*3ZqGwe}!pArt~f$-UhJdRrzw47)<% z6)lA>7!eo(AU9PhhhMV)&@3tkf1nK8I$2B1Ub%zs*nP3nXBn3M(&Cd;#Y*#&=~bTL z*8i~%ef7{0EL&&%KB}Dx1?E9GNd;9zzxTS@P|k89rY=oB^h|s=6N4!y`#>r0B1P<+ z;Ll>i)s3BA`x{e^ZF9=YUE)|M(6cr~h4bp<%P_jq>Y{wkfg7sVsHr4Zo+>L!c3TAl z`x56~q-h2?*@l`Ud!*nb%jXbIo_GaW@cb?NdvU27`t{eV*wsn?4tO9v-(vMrcx29i z*eFh3U*xLdTYXJXULYqL!8-z9`_Fg2tH*DngXov4UEtDu?V_fo$@;Om^ZMnPgTFaO zWU_-yE=%5_Cd|Kn*(9-oMJm{Xq(m$jBK#d( za$aC(_lW`i{RQO@Frd=95m%Wv&veZSm@0JbXo_;{W#`VvyRJPi%L@~IojoAz%M*CJ?c*+;lfFw;OrGOeploSmnp=}dqK+&~8NvN>FxwlLk#p!PASN+#URgQ_DKqLEc8OjP&HhM~cJfjgmU3yD9 zIp0JC&MCO5eYn~wCEzFJvsZT=I6B?wWa%E&+j+|)cD{18Ihs~>ye;JDG}5sj%cc~O zrWB1SGHQ{Dy>=r72V>Iln1$o!J|FbWX+dDKRkb-v_Jy({l>CB$=W!~undi+wc5G&Y zhk~nJRdCkgNU*;8BbpvfroyDO`OBYH{74ETnWpDsT1NkON*YJ5wzjf0aBZI~OQcyM zpBfO9W&kJCIQHJ`B&l}g#%;Qh(pcp#+XAVzDGCv{7JfWkSbx?0z;xg2I@1z{ME>-h zo|D9W(xJP_#avynL&=e`Kc+p+WN`_dIGQAjlYTb9JRQ;`DY~qy0h(5@3KpfJFSnF! zLfb}XhF`&E+%o6;hD{m}>#frF1#FyxL_)^`YCO@PONBwDoCDfV&g0&6D;uJj)5bb! z4kk9hp`0FBbx*PDI*GuPl&u(WR{>@c8F|=71*t;-7c?Tb-D}U4tJ3jsI44n*v|5ny zFYB_q1~$5az>%!_8p$W3P^YSQs3i2otPVp@O?sy4D@sa-@}d7sVJ)Kl^CSNE36xF> zvgaWVbSEvaQ7Anm@C9v8N^$*QVuWf*n4Szo2S_zoGth z9^YupW6ObuS8rPC+}&9gN>MuV4^0Tv2~PMLM95$Bl2GKr;f&#U*~1oW>QVObc6f{u zc;ejsJflki$B(EkBO>Sb{as7#*EtGo>-b7DlaIs?#ufa{vs`*`Jg2E) z>xgUgl%fI@L{rt>*z#*(BOHx^A0nVf zdokg2S;c>7arOD)h?n^0Skp2bklD;1FJ<$`w>j!7!u{H3t0iEC{8(k_$p{h!hTUVW zLt09=Fe?nbBUzuSw#y_g*dBZIQ@@m*ZLtCJS6GN;5I%pMFw_8owh)f>A zdoDBf$3N~X$oH(-2i(NEKRU3L7W#reM*00K$_r*X7Z4{Gj2zhK`k8! z#M5C+$HKIUTrkd`uTPj9hXj>sXiU!VP~V`-)kviO;F{z%2+b<07>145@i_7wHp_~d zQrz=faqmO9o`)tthjWk<20786GuFJ?eB^ z3fZZWXMpyj9fF-pI8akS?T&SS3=6+poBLq>G z`9=p1ZI?6ftPHbJ^U54Q)r)7zaiXo3;?Dr_|zO` zmD(7|Sx?8$A8XZ!jF9gsX59#xumpBtKp;5hQ)DYCS#U$phhgP&3w%-7KtXR`*FZD9 z&HjYUJo7FWy_d9W=@vcP>nYD;X(diZiW`2l-?Sm-Vs|wb_>)0gu^g`2Abrr$?r@vh zM#y_^{zANCH4()~HzFaNjl!d%irv3EVF_3tTwahb`scR6l`BoWDu=C$o1oxffGVoZ1#{=!PzN7Bsu4`+ zZ@V5ChKE~DV#hQN{wbD1IMFY_9DZ)SI%q>@hzOW)H|f2%N*2) zGQU(S%d*28a9Z_QMnWM7W=evK_Nl(4d2%TuZ+wYVwZ4(k`o!pH`$O?Kz530=WDRjW8sRYiLNA{!@Fjk+IF#Q+ z==~(9@^?ScqHQZ^5|VbFo;_Y;LnD->Hey*+wDW$Kqz<*yCjd}eeMKXrgsU7*pOe>7 zJ5YUM7YU^#k+If)6;~`DFT?)&v>IPp(T1HMHt5C4_pp0!OlkAe@$X2Vo`{%Y`&fTi zTugS`>V<}lvtrFc7#=ehGD*{OXQO12;bXBeb|n7Y8M&@HcSTNx(EW!EJ`r0My=w`| zF?8rIfnO)K&SQEV+aELACZN!BSw8vm=l!p`^rSYL}PM=J1EWg!5yp3ZvOo`g}$39T*N-NgT0;nwEn z`8Ov*yb-cd{V~0wq!p6n@Ddz+bY?WPfi`1G;~Gbx;c88L%<$O5OG%WMS%v-zAe!J4uK%~o!5j796dlgp9M(v{Q~z2v8Am_s}TmF zM80%{m_du-*Y0s73G=sjSZsg4HPbRq=<<}WlRH%+yGdhyV0@9)M{_48)69U~_`}I)$W^Oe73i zFHuw2`V4QhT0>3=c47wQaJPBi-?I;fM&E)KS)ZJYfX$bmdrXhTXt|>-i!xFb#7^|Y z^pOkH&fEZY8+Ot*X0IuEeC|Ft-*U2Y>8ORhL(Y07iuu@6RAFR5{>&usGY7`H84!3) zq{i7>a(R~9U>$MZWi6RaUJ|Ns zE~2&pZ{k5h@qi3WM<>^x9xwNAo;k(T&hw~zI3@H{83s@~kvpu_xFwAyghVN6n0|Lw zM)4h8y4#yVJh1DNR%&A%hHU$Z$MRj+r$R;3(lt#oSb;&UivrQUQ*L9 zQIz}M|8%!~O>?#MMAOJlM^V!})`yaByqM8uyL4z@ro!ewesf+>QG@HlNX9s$0 zG1N|VCxWglySx%b+iwVh^9<(5%f2t?HGFD= z5B4X0*O-w;PQgs^eQ?=nc78mrM@ch9Dg4S_VG59U9&|p7<9vuQ4>TdX$$h@^oKYi{SX7Or~v+x^6$WIDuurAuuD_F&qWHZm-g>QQ;fbrh6$wwh3U%bY(tpC6u0)Q8$g|8r)*#_h#$^vBh{j5Ci8@f^te1vgU? zoTqr6+2e8&eDzs9=c(lG%SuR}EM(o&?*TGTuw>fMM_6LQ3g-{lkJdYWNg3Ng=boDL zgeh){H1NvXU<%9@oaZ9Zv|j2gjh7j$O^Cl ze^gH#w33;bH>C4<$v-sO^z~&(AlKTFb>23}QzIUdyimBsT$WTP_j9OA6SQx5j{fTg z$6!_Z{V?W?=BC}RM!F-Z?3+FLegoZ+1A&^hHIV_za%9Rm#th2#kW_%%-A!BNCMmJ{ ziQcgvnIAo>$KTRy&1*4LY{_bhTKc7L%bBN|xdehiAoFLWv(M~VeHn9ejm2YD?{A$n zwJXXsKzm73F^*8`Ydy-=F;w@=$bifRgPPJ(|3@^=*$(=h9vjLVC>87{r#<=1u>sqs zQ%7pSe`po8A3cy!9mms3|IpeB<$UEOC2US>z92pRq3O>f&RsQLai{2zz95U{I*jN* zaNZU425U@oC7&lyS%?+KXes44)=)kPDh8f^VFaAvJbS1#kpA>1miRz~ND)3FTwd4r z(tfXDt7uzVW!_^Xjo)#N$3V*i{CspQyp5P^-)u;7wHM?=Wk<+_H>NFohH6&AOz52H z$#&;Ffxro2I2%?4KUQ+>__2KZ1I{7C!!s;NO{*|C*JC9U2BFbj=Xb}(p?0i-rhizFf z|JFz0O-E@*1*br2tYDi-_y`9d;+tSJo~F6GmbyO4!N-C43L5GGg~hj=|Iqq8*8)W_ z6-V3wT0Yj(xQ&ZOw02^Znb96@<&}moF%oP zs@i++l&zneKxP~~_~Ct!UNNM$65nTt*3GE-FEZ>gxSI;x`c+0-Sf~GEx~KnZy8ryw zbibo!MOC7-k2s=^B4@kPf}htI0j9XrwfA)Fjna&n{94u2b`M8aVVdwMPvV2Po~)gG zP)7m1uudW)b$r%^&>At}&4gB6ju2fHvf`OB&y3TX18(&F*}9a{jD^;TeFDMqQ&=dU-ZrZ5)K&lAWR%e)^?ea zQUCjMj%P(1V^y-3G_@jP(huRENL3lQ_Bs$wXWpf1$G#5`gegj zB=BchiaSbyf>^ZGFGT$O)sGZrthDlKnCgUARrctx$lh^7o$uyszQhT~p9x|;cur)jAd$ttCZP*nf z)m<72kv=C@`zKuWK~9aK*Rc?SsFvQ_=>hxcVTE4^9scZ3X*QNouPZZ$vL2k(U=KEV z8LV*eRGdj1kL&W_1m8k%Y{Vh5@RuZYS2h~uJ;eemKm`Fe!>4B22iru8cY@#1cF`vQ zHiPe5>vFLmDKVtnARe6bJ=}`(vCa*7E9v<2E{z1Wv8ne}^v>JDG!;Qsy^+;8BRuAG zk&#RnVnfs|vC3*IRt%D!*9$u$HzluCV^D|Wj>lOU$qgCLhQzk+kjn$JINp^iy)K_G zHdq@5Kv3BlgpKUA1Q-TVk`kRK;(Fp~SOVY0ndE6FNRbZ+rx%Jk;yyNF#sPuw**4H&_DGaEPXfW!MKj-Jzo}Uq*L>;nse1qO# zqvAV$^zC~hI`PlDn6Z&Va)&!EVr>a_&ZuY`v%_0|_Q=gR*31~(Fj6%ky_|D`V8MO% zB*SGHC77A)5t@t&yDtc#*rnM?7caX3c=a!9?>($)%zJ7jl95&!W|rb7e%#u_(so$$(D}QV4fpPex{u6 zV#I0YEjB(rvBL#fh#{c&%Dn>LF&7x<3j!HI410+JA`njFbK7BR>#XW+h?ED>fr!7e zC(sT(GOlkLcu`1s7HMC3)ZdxfK2^${jo*(Cg{R%rCVb*;u8OGAWVUz%k6*2w%7uCE zL}zIQ2*g&Y`b*wTiBBMc6iJ8^ur38n1@pg!zbH~_eLtRbBOSCai5?INY$i?)vAAi- zE0J-DFE@^B{<0U}D%Tk5Rzj~DrAcZJAO?LWP**8?$Z%02Jokxx-yxX^EyJFDdZ%dL zp#fX9W@L|G__TiZN-X{PlvH8(apJYS1Kbiq+5X#?=1mIYQN*OvQ5<+ zHaZLY1AT3s47)S6ygVp4tIa^^No*D748Dp>02b9ji9)v*S(C##SS%bNRRT=|+uaFq zv8e&hoOMZg?{!vJoj^S{bh0lOo1$041;Q{08Vc@y;=AK)Xn8fWrBA|OCNtQaJ+CxX z^(y77?dx3`GP?*OFiT8)WYb_$28C+eXjizdC2i)|R#9BZFPOE2>=)QYL|X(iBal{# zY;&4oZ@sLa)$i+Q-2)pNA!tCZ)0ethv53woghv+9H@620!QaIs;029ifQo*5PUW4X z^x)tj>Owg(>C+eK);*SzIJV>;XwqUP?b0X5v4S7S?F*6t1Yh9+xI&*OdBbHWbE>sl z@%MO@X83~Q!cPg1PHH+;dMz_vQU3&`#Low02vo^1~nMAayt(#WT^^E5T_yvO6llcMA z4V|hRDRY&m9F6{NsQG7q!k~g(yq!gnyU5^r^|tF>1I4y$%ky2S(M7{S^=mMK>#>NS zw_xbK4hChgjCx=M*owUd;ghdJ!AYYRy?X!kwt*6N`*q33=YAW3=taxY9kNFw&n_KL zquG+^#2j8h*WbNJFg}zc^1iB#rO4;bmU%Z_5h%zs;|f6q79@M^aP}LI6YG_pW+J6F zbfPG-S8mraHU1p8)~bY2My#?Vp^~0T$KhYwM!tDAP>NVKHSM)b`w%)bJf+EM#sHO; zi4$4l>!JJ*!}It;c0a?H=+}A%lY!Nv;lMds9P&!02LsRv6U)G+P9{FXLd7iK1tx-7C@8G+@)iGdnVFOM^L_)5Rdk~%50!ueqO z^A2rp)hdw|Ox0EJ1IL!J+>}l&Eiq=Sw3S0&O~fy;CW-VwbCEfbmz0-GwYkmR4(>PO z*_{(6{cBJZuFVJ-WUOc?e*Z)1sHA*Oo}Yk^GKs*gk6~5m=K4UOuQd@(hO3M=!poVjv!+ljk7ROX86z{H z^P4NdP7^%jpq9{1X8@S-(*Um4dTI57kP%rh2b zIKUFn7471ix%J4ViEw+t`xjL3PSUiF&@`Y$Mc6ez`uQi~ilbmS0(I=1t2vHqr5Dyt zlQR(>M|fDWtZ7WRzxUm1r6Y1>(!G6jX#qELs{Ssb1Y7hvG{OD4ko5kZ@$F>P?u43< zIpPGz*PjdX5fGFwm*Z;yCZERWfeLS0k!;Fvmw4I-u8O~)pn!*u#Xr~;xnyQJQkmcJ zKH@J)exBNCIndD+5uqnHwK|OyjsB|8_p-lWKr9AmBs_97QQdOa-PKY3B11~X*UuoN zB3OhxZ0D9Tq3I0_zy16Jhvkab66?}^Ba5>>{^w2;=K}TsvrNIkrKL8&5&%WH@@5c9 zmBo2X*Y?uJxr+RJnozUzd{)uP67nD!@Vmh~fqP|qb=0OQK|N8gd658P12LHk%x=XU~Vx!3um}>f3h;jKz2&yP+ ziW}LMq8-SrY)#kA_wNN-gx-5_W31%3AIHq3cB^QsT}r(sk^E94H|;xcF=lNW7E9f` zOgM6d^@)tV2IdR*(^7lqB@XBCL0#wdsDSm?GwTn!GG(KA{6=pg<&55+mj$u3sAhlz z>rhuCdnVS_oG*Y+3(!9Pm`@&v@CL*vI5fy_Ki1yWMi-dTo0Fon^ZU*V8wFLAS(rB* zy{W4p{bodb^#x|W^hu3zATcJR2B>)5FTzenwd{mTum63A_Q~jy&+5w9_OMTZ8No|$ zWFaN9&e%s-jE~d|_Suxf*$4@mx2e^7Xt~i*b3__rcu7HSQu@<9lT}|~{vVhL|(D5nI9Qk+yqmTBlPLWj{G3%m}XBk$p;{=j+BC4|FQVE2$cD3Bq; z*v<6*O2UooWILBPr%P?$NWtgr$ zl=leoJ|0ygZv{s#O9ogk!k8Qqfz8NZ=eJg_cn!^86H&i&xoD?K&Rg}j^Sx8We8Yq# zC;X6t%?s?ZeTpc3_|O|B9r1`4YfGW#XBA-4rq!RboTyMZ3r25M5{V#uC1x((e7?RJ zj6tG;N67H{SPenA(4$0zs1SiLfj&)&q|5NpC~NwBnghFOhZf_3&aZze>*9h~s2vho zI^qcJ&ihbeOC8#&OxA4wl=q<;s>mNQ%H^4fU#m@6bj9a_YMR*=PLrl;1)xFjVjp1^2b zkt;z@9ud&#H@dAEx_m(RiblOrj5TSr$OiHOvB|`*dj#te_;#|?_v=C{sgz;e9@VSy z8P8(IJ_T4(6IAVjXSVn*du=lb5ye^wY;;R%MW$p;pO~$pY`IuVj8KF;8yVa@^4-+^#FT`NB@K=o zwR4ouF0|ygS3uuTgKZQ!Ag_c1g_aC!uX0+Iece@kN$;geNFWX;7**M>k8{SfHfc=L ze+;0>2Zx8)I12zw4ovwJtaXVQ&mO*Dr!y3hh($&^CIDADcYH(kd+02P{5<_XA|lCK z0uP2#){j7I>+}`+8FD+X*++US0rdfhiW*02eC#>yCsC~yyGdFA=n~0tFmasO@D~&{ zz$`zv(3s_MFxr#-+!@~_7P_KYui$SnzLr#^Ja2@D{d3`zqxVa$U?Ak_H-^16bNVt`alHEwlGbJD_9HUaL2;>_ZJ78qwgOLn<3)tV% z^eqzzv`BImC_K1auAem%?-d-Mw@N5v)Y6ghN;m&a`QXqJ+xmfA;0rVVx+)e1DSNDJ zB1J!^gIbYVL2O;CjQYkZWVSf+y`CGO+0jlpGy_ndOkv}}^j$hh4gj$NX2VM`U&Jj3->+)Lcd3&s(y2TTF}*;mQWPW zMxqSfoISM@foAhx5PJ^C!h_qjs>JMNN$}LzETfa4#fs%IxoRYx3FE}wXl?7+Of;E1 ztdvFKgQ%)XXx_>;0H1c_(HL!w(SSiAJ>A2j3JIxX=mVeL)m=LR;GG?e>9mtz5d#$5 z?klwm0U&~UF#GU{^6c9FKVnx`UmvM&H}?ttr87Y=g_*^%(zWtUm{wc+ZD2cr={QJ^ z{J)MjsiP2lNa=qU_nH_l?>L(BMpU&eY7O~;O{i&zIC!;$0#C^G+%fmIJ0S2p%)DE$ zOH)TNy=jRb5vOwh$b0+DS3@Ue41MX|>CHZ%Is$K5S4w4{WTrMI>C`E5Y()k0d3g9+Lm z?yHF<_k>cgza)hEhzGbO;9(uX*+i{pTV*~U{>Og2jSqws#ASAux;6a=)?8>oSRtq&!@GV z`g8B>@2+Zfj99$RTOC{e?iDWFWyqb*QL!jQAVv_|zy75;z07BOqUJ7~dH;HN>*!a( zXP8Xi$Ja3fUXj{Pym@hU1%E*k3n;D+CyyZ_<1m3W>)nNwgyf-BvQOxSDD;6L--zEh zqt8~dvJ|kQ%OnxTp;G(9kxa#$%9R;kyAn-*U~;gB6G%p5!57!7qQk=^q65(65EaRO z>(e9db>yeW#Y%KL75dl_#nk###&IYAk=~`3J^j8tC@p(5m^`X!%=}M{l(uS);e-wtWMA&@X!C z`*RoJ8bNeOfFLvkF`!6~J5N#)@Xq-i4=_OpvZHCN?-N-fI7ddFFRqj zPNk1VlbLiDH0CrNG7qv{fBR_{4=cRkQ+d8IQWAynwKRsj&@VxHb`cno^=* z8$1z`?ZCk38#0rE2;))<5s>Y=WXv%|ak~cXPVK}uT(%yjRe+3r6Ehajz?gTFfurFg zH}VR|M2Ukc!|t8xiYqB?wPc?;iWz=g-FzZ0Kpk-^y-Ny@k0?$>RhoE!GR7@@NQhs} zft)>cjpTn{MvwZ2lS>qbQXIQ(qrjgp@|vJ;Z%(CEqM>|-sL7iq?8RW>>gJE4$r(jJ z_@h31+LXFr8(bJnL70H_ZJ2q|Ahuc|BMHc~lp2eQ%NO9ZAUV!TyT1?(W7K5am^lCS z2dgU?a^(<>W!C^7$3sdfrCfmxrZ0JX=-rm?rp|UUgKM^I`!4uJBI)L>6ufuUcaouC z&Z-mVD#jJEUwWuzQQpkOxmocXFomDAI>EBxS0a}XZO{{$^i3O*@F0aw3>;dVNb$`Q zuQuq`v}z?Nqd$lHL(LNYx7*7@99MFls&&OX#Ws#*6L-1suXrk&as6QMHtCSQ28<5Q z9lX=-4Y~qn`eWN~R2}cyrlK)w32k1HXLX&<>bpN}1vx}z>j9|cq^uWRKJSWrt+1Aa ziVvsI&oMuPgz~@MQr+Hm)1vMTOb%w~~XN;hNLD@WI{KfZc&;y9l zFihQ_x&R*X>$;jpQxMKU{8dwzv;v3lsO)Iif=2+GcU598*m7owdp7 zXx!;-0{FjpTFyTx=@wFkWp$u}|AHJdZg)g6+Z07WdwaZ;PLwJfImjG}?%nf|m6T6S z?~|$`4Id++9FH7YVAf{Sm{Ju~Lr_7K9fUjruWT2b5F@4B+5U-^N}ox)33gYdv2N&>0eDJ>didlsSuco)Q|mp0tZ zGk)(=02wvF=xVd`dsOI+aSZpw8)R(1pe^(T4JRrBjqRLLh9m#eaonI&PqcgP8a8Wom)5q6XzxU^z!<)#l zkW$q9Su5bA0CTY~^pY+5^uzu*u<Wvf~4d_nJ?rRY5r`7O(n$=zO*G|IYMB7J^-oompT&xc>ay$v zK)^>~U5lv{#Ji;}_aADMYV29&6k8#)6Dj>GE8glYV#q)x4>(@&pdLz& zUotSzv|BxL$x>P8kHfDRl`1Q|ECA6S%azx-IGQPnijE!3<0^U+C>-xp%qvr~#5=M< z{+Q`R5UE@6m{#pPw?lR(b7o?Ig5+FQq9yI#Z^=?OKHX2#KzEH;0LB9f3mSMroWf;M zgJag}YW3!`*8^%}mkiCo?7GApaurxA0{1#LP00^L*o8crf1mx(e6smHx=0(Tdz)Q% zZE)V+#Vnq@B-cb`+vxi6?x&?t;F!_cr}^%`p!si>5L`E|?YeUfJtY_ve6goiuPyGh zmh|THm#?zAiaebv1@SGgt?4PtJ(>=)Ul%n_5@nuqP$_n340=9e&&q3O25gH)UwUI4F>fU zfj%6%cW+{)EtAF5I82z{c`#8nUaRUIGY;>OAmZ)BHu+j&2E<5uT+fcd4N9CRc8m2u z)^y5<@hKbX##rU`WynP(@$uo7KA9;P02MnjL+ZC^D4#}HsG)%(hdi{wu-PlJAAuAG7nyl-1@e! zu^(0F)9S0McfhDJTLr)FZmAXlZQ{|nOCLksBD8w)ec8t z@-li{V$ATbqrKnI?VUY|zaR;*hK?+k`vny>)ZyVl4}b32Q2~O}EU7DRO)KHu4X&J+ zo8N)$AJnE2R*&p0OU)xzOjv>=A|t|*ICrW$j?HyebwUM4RTAb_&#(&WD| zn(qFZEi`W`m9bHNYqHnb--MOIy=n(4ENnnTVkS4<5rC^4^o!R-;wA*gnwdTMZ7>?+ zJhok4r)XL2%(=w$9C|aDUYP%;rH<|^>IyxMr~GPVVyQP~Xt=YF&*+h_9TI`qv_;aZ z?vKsk*|nH6orPZUCeBBOOvLmyw>rK!SeG>@{-0HRA1cl3GBf-BqZz&J7Xk+ov#nm%K z=vh!CCi~f2SmmQ1Xv0uMahVo^^SyJr$nT}wHE8zFH zE6Doe7~Ax{xT2`_nM!#Q~@VCtFbC?0~7@8P%|y}eqC0v_YrhWGY|eMF_}OW z5ZSW?Xwv=COuH#r=W_0$wp_H%N6}c!A z#@?wGj=o&T-Td3nhpz1NeFS+=g6Mug}k;6_FGmRqIO_L z=iMhijcPM-8!jojGQdb?bA6N2KWd80;rb~!I!N1kKM7TEMC;J|Cr@V1s`i}Vn`yO* zv+Q`8gQ%ZH%z@6OB?e6Jy3A0hXq-nRHmql5;M2N*fyy)i8C$BKZx)0NZE;IZD#47I zRK;P7v>PVi`GXUa-)+82+?Vb2GZgkvb-TA{`w8I8X}`7z>72-TqF6C*&@cHk_-L&T z@Cf{R02&bAn6QNat^UtgKpJ=Hf85K2pLRD=Lt#ti*8c03b`?~NNR28J0>siiDQwy= z9p6n}%hxq?xT}s=TY7V5R=T`dU6C~v9aMJGi%b6gJ(Is*_98|6eKBql8k%6s#N(l# z-OoO&^k8!1H3D$jkb=qSpb&9rSe))f-{?Qi3Yq)Q?}hmAGu&N4T~!W7RxzP8D9Jzl zycmhdy%{PoO75*QRXaJT6cnlsWqsk~=5MlPw~FyoM*5V_mDr&G3WqR0p;YLZ=Quwi z3&Tn#WGOsOQNO>Clxn0TTGPcv`H6J)1IC)XI>GYpOR(|J&Am&dp5Rb>6dG&?Y6kED z3L=FmB4yvZlO?@zszdnL)r05R%QRpQQPY?#eyk1%FiZiQ*|-rF$IAQQspL8QgksWe z1hNff3aK>#eFZcmdIL4W)xvkY7oQ8y$3iSKMI4zykrSLDrAJasWl7e2?g=$lgRF;* zP1AxUY!#JI1=pbr$@{tI&47B3i0!!kdR;|}(x)u0UlHPOa!qoh>4MLL+z;tLy7&|6 z$v)dx?KTm^H&)Vf$x$!^h4inrW$vsj5k#0-Ein1NAjX@{mxz#>RI8607Qe3y(iS|? zlKM_>07#|8eI>{ibp(Ohi&ih`JacfJj02&TV+kH-|9}39I(jDllUZkuL)y7=pROJ? z6wH6dmz1=s0-qRJCo-{u1v<`?0%UD;TVJ1Z-E~i`QaVXL;(r`-rCop9MM4ITHqP5ek{1j5&_)`>kq=I&>fvJ zA)VW028lM%5jqupZHmpToNByHs=eGbGYVY->bfvzD z+SoG{xS%*b1;1`7JbBE(JuiocVgyQh(|~OGfBtjw>)W2cAoKEXOi~kv{11Vv*{yr( z=PZgquHb)vPmxsrpT~}cQqobLiz@F*sRVM4j|d#T9VBY@*9y~W|DWF?Uw-`WQx!K~ ztf+3vYCP)-yv_oOOVmfG&fV3XWC<>~%1Taus!F{dn|-jbePeP>*swc_wB%F~IgIq# z_z+vD`c%B$)n!YXVHtyqzL=n;pjR}d)In)Ur~Y~rn*uJXWv(54WU#!l+atWCzoFoF z>ao<;h6dvxwqs6(`pzTk;_H8jqG=m0_1o#}cGxma@o*q>zx&$xqjYVW--a^k$R76~ z(jrn>LJ_{4iI8%?lp^$xeEBBnhgYl_j1flPpa+?1%(&|(6-+V<9ganxvhNK%I981X zxIbePDO<`)4!`EnU(Ibx_LVVOFGnEM{L=BAfYXswh#&ZbfKcSS^~lbR^C+)-uJX}U z`=ozK_>{|bK>B_Sp{ErAWNwXPbOzS@V2`P!{$U*GGvZ&(qJb(2_@hd0`twYYYye+9 zGl0vSzI~>^>n8OK%p7KGkr6B}y{vTk!QvC6s@Y%APkuxKlc1c2xFB%rxce}ob#7HU zfrERn^`3gfE%b{caLZ7gtox!*^tDRe`F#uSZ>1@`I+vx8@1^7%`3ON?SjKd@{whAj{v^EXb$KMTea*}WW6!o^gr>JWrY>dO zIDq_(?PZ(6dAx%;*<{dTDowFPD)_~niorQl+p6x%oVc1;LGfi1Of)<}(HAij!FZ`W zrsB)`yf9)Cz3?q3v2JnkpKC5*)(lakQ0PDPE)--!Aip|0E)a#C4_pmSF&i_uSLvo3 zJymyj#eqI}jyuARjd(}FPJ68lTkL1nQ}5jz6XMZm|L7{l7KUMMadMpAe)+Ab9X7fI zI;e_Tji?_Yt}Dr}T)dT9rO~np=I#7~cxlppP+Skk8@hAW&IJ)|+EjYPGfskCm;NOV zkqh0keRUxJLfQqCjrjnOP6~F0XJz?3>cdGNjL!y>&21o=;-Z z;&$z;1YL^4x(VD6S+Z!$!<4@r8Y&9;X=TUE#A2Mem7Le$_maXtNRkt6<-Vm7Qd+fxPy@ z#B*rLw@vWB&}69t?am!R-bIxfW=JOs?TG^LN#w3qK@_ zeI&GQklFLxD}~5Hqj@;Na$^UxP2YM9_SE-%xnK(XLgO~Zpu8u()q@aJ+F)bmBh(iDle~4 zv1!&E=FBP$a{fId&Rx~AWQK*+d1_UgFn}UIN=shmP4q6QPn2IbF(+5nx*=Duc=UJ6 zOvrL*jm6RjjW{0@M=QIe$G_Bdl;{x26#<-&IA;Z6_#kJC7G-9kz z)gyj~ffa|R@T0)xzqq_z=_Tl-*M~aWN#vKZyHEhHs619L4MfN+<`PPMIMXp15?iEU(CA!*Ln>G@I7_#UjrR0dmK^ z%ioj7409=2%Nd!i3v#uDc8m(~mI&gUg2R5?oMGLPgjSa(QCUl1bMJ0bGD8)WAfNg_ zpXQj_-kOowkVW;N{6OCJk4b*s=XnaS6F1l>@^q!xcD#EZ*%n{1`zf$n|jFqgB_z z{wP3};^kS)>j#oK6Dgv^JK@w(T69dcPP!#28Ehqul~JNm&p|1D^3Gx5C1(^MrM@K@ zfCY1I`ChK`aW>RDnO?bEwh~vR#^4jW^in|6&XA;I9pOPhigLuWUKGjs8X3w)7&bFQ z7O^o$*blSRxZJm~%z+_SbtE6FoQhK};R`m61F)zi`W z6*%#|B!@aBvtef%PbDRI#R}JziJ_bP_B2PhtwQ2|U5z$OJ-ow+$DxI)t9B#eok*ng zsPD}+y8w4fQJ$M-HPihM%U{57>jt-Io>_x%7+ClT-ThSTKx7edTVq_p#z zQVjVEA}-H9KIqzTE-T(avJ~>Vy}NE#R}lK6;Xg2<$xe+IyY@4K5*r)#j$;N^Xquko zajV4rIz+(ykdtazeh;zhcxj1PWW|;A; z=Xvg!L#2oEZJZhUd&gk198bI)bO0x`yJPt0s67M4c9630_PqLFK5SKydtJa3vfFzf zrmaLvqKpov43YoC!++LzKr-QRacLV(*=W$7I~aMHusYg?jD4gwH5F4II!J2Xa*f!u z@(-vGeH%FYYB0%m_QPvDmGIS1gm(^VDiX)!Pi3xJ#BZp3uN4&a4Jvv;rg z)4wios`{%aJ=Nob;eS3NeEM?}3t1%Ec#Jno8@Z-(%d&#;an; zw@v#nk6&aL`LQEa)>3ToqW~T0dnKjwLag_FHlaPrffIU!^C8_3^&m9rMK8u18bpfBH zcKO=ZRPlMJ-bsDi*Eg_|G1XZe4S72|*v5D=5eo>|!LQS;7ex?T2zq(D8xBaBvTCHk zrgn<a*|bB^}F(Df_EKM7`u~Z&Nc^}88*tMUmn3B zHOGyOZ=WGfPex7QT>YSUwm?{ajZK>u?GYaxAof_xC|tBRbSPC|6_rX=h5VgJQ)aYW z<{P(|a1uLrywr!?FFAQ}#ABhnqo}{hz4+08AmZCcY7b8G#+#cJM0UrD0QW8&vHWT` znEc(QP51NgFR#b-?2()i1A9MDM*gFMI4H1OEb*g7%1TOh@6Ur+``*u%iCGs?e+I=Q zL_3P?-n6h_zu%t2B@~Z?`v%@(GwL#&<+pDqMCGyA4&04>V=54p6-v3I^tQ8AU4ALs z!$(tbr;Kz|OH7iVuXm>hZIWTqcT(S5W94$8DcJNCsrcL_*;giZw68RGD8TUrXtAaG z1P*a*DZ>#0$s1(iW8b(7>)Fp?4cTv~Z=&uFdOqhr?Wm#zvw^F;kGke4(EtUnmAdGx zab-Bpc)9JlT^399$qzR4kKoLvk7O+0YGKF)@2>I-??avfM7EbZ%4Vj)WUV{(`U`uP??5|6G)M31X6?h6Dwhv(yYL!0UoQF~CW~Lc^X_ zpgYSf-A>|=kXo!?@lgFGPX5c!H;lDGPf1C6Z}7f*NKt_RhS`Dq~&#RRFEcZB=3hHgq=?RsR1z*FE9QI?=2}hSfyr^+@w)$ zMvRa6yWHPHja!8eEqh%f%CF0vp#aBXxunO&A6FBmBkYVU1?xmUjtqIan(67MpJU=r5jy>DcUp}Wf}Cf^;qYHIK}nA?e0b;GIAR*&2%^n!Mv6U3w{I>rI9I)b z-5rid8`6aGafpxzNYr3IGfbE$cdS2zOi)`dR?DN57t&F~t8a4JwZB1CM6oNSC(Rmy zhYsFLuAlk!NsrbD?#zOW584$n5&Gxn8VP?F5C(Y*6w^uD+lDfr#?3+oj8bBo4w50p zK{OH~#YGS>g%5pe1tWEViPXddR5)3EUeIA<=P!snQR@8qSjemS@vK$Nhw796ARnBN zW26Shd6aIu?#2CvrcrJ4Q?5_E0>0aRSFXrI4UrDLsUrY%|QtpNp2}tp` zv)m5|(KB?S)bhNb;6tnfW1VofkN%gT@BmJ20(6-U>(4MHONSov44?M@_vB8BTc(`4D2lFup9H+`he>-mCF2=qRS*j~b81#Su`i#Q!VZz~MQd-NkxCHn^lbw(|i*y!dzUY7fl+FO82 zWi}k3^jnK*Zqzk~)E==j2MCWr{2(~DZ)5Y5U9mvu0)$+sMgb*ai%0*4XO!EI?=(NY zNCCP_q@BYOKG1P`;ISYwq zVFB5H-7sO~1aQT-J?U@geBpX}s1-SKB8uve;&EuD`p-yB>nKbELgid1jp}cwb0%Fo z$B8|JwU%Y}CCqB-sD6{o_Ex zV;~b-Qs(e(-I3pN$H=fm{Rd_=Ynr?o)nUjH7ulWDsbS@B)<1cNp$~5$Z2nntk zi4MYH=mMqG<%pZE$5C&Yp{5q;(oG zYpI%9Gv{a`3m+E1qO$a9JVf{<=E(_m+!=AA?#NC^JL+LTIb`%d<&bg#i&~!OlU6;? ze<+NukZtQweW0t{KCVVx=$sY62LBHIjoM)Hjz4y|un}R_-G4LF;;ROJU}0U26b)d@ z|AKs9PcbX^x#GwvHwMfGPAGGRe^>JJz4&?0b#W0>Wf*5);A+l8t^o_zL5@jK#{QX1 z%ACeWgiE{G5$=v50SXv*Y@K2%&6?IJk63;piY+mR3Wm$-^McP+`8=!2-jZTtCN>ee zLn+$fQO_qukGPi7ZHY55LR3#Y?ooZ>bBlYg`{Q*i|AHV3s(T$_Ko(_HO*`0jl$Tsa zaiN$Nd{Fe=!_%PU8W?_oQx@+mtOUb$K1J%?!Ko?d!T|++uEYe^XL6v5WNC@ zJzU>8Rry>O;a?EIt>t`UaObT=J2uya2?!8OiZpKV_{vxYTI9J4#;RRf_>DB+Q?Gt8 zhKbN7cGnanz;!Oo*7uu?MAW;8)>oPQvAZO>C;VYw**kzw<}6KX6glWPXa1_Mnp|Te zobPE}UQB>fO|ObXLYy>$K1Pa0OJq-QNFbAmH?R5fdvo8lCqS)l=omI$yCiKO-nt9B z2of`4Mgg$aoJ257yWyeIJ@#3u^8Tkv!5E=fC$3q)kjlK{G=F67eDe>qX3UM&u8ypVBeTtJEBl{n|JIBBQj?u|KVdm0_-Gn?Xq zKHo+}f`jLIB z8~Q@?hM5c!#$Ql1Mq{W_a`^krL4p(yPx`3KhLUV(6&jl`h69@Tew&5bD#Zl2S1i@b zG+9{-q6}2Mmdwb%Gdq2;`Z->7>_$TTR{4T=ZjcKHUs^0&!7fg6({`riIo6W1%Zw3Fq6yPVcDjoGwL z$G4GsvKIVi z&+dRWScGbhCMss~IZ8y33*|#3Zq$qoH)}HyArTEj9z|LeoB9VACTcnAr~jUpIl3l| z6-!s<5h6-zS!8GaP&pRrFoSrr7Ra*9;F=&O8s^c&g5!yl*y8}gT^lETCfhc*>#iU1LifuP7y5kJw4 z@U|2ibGWa*7*c;xC28re(g`HuFXUE&?4u0Hqn-L~-67mR%lMq+UZ%OYIqulN>}8eY z3ke0{HEHQ$01!DaZhtWoL+XFexg_|84%UlpLn;4+34n?|_FA_q2+J|0`~_VZz9@tq z@muBr3C5b=QyS=PaUWzgE|-~Q^kh|*1I5WcIk}(FH52+OaFgy$^mVD``+xcg^cU+= z%-iyo7dvPzetp-&M2ys=wm>#W$QP%e;9T9JpYUqEsM-SBPa(ulL%XlcZgmfBA{yQ) z*Ky$E=2ZfeYWpT}=b}xCS}Z2lZfVIXw8LHO8lW`Kq}WykquO)HHo(0 z4ilyRwGrAUbh;aDbjttCU@miOEVA5sfKq}xUga%|J>s)|6yoL% zpHyRxxXakAYIxne?x8!lh~Mtfu~?(1@XwexR55qr2n~h&P~IbIvCEu`YT(^dr1mV@ z2p-)ZT=m=C=grDe@Q>|RB0z8 zef*-~Pv)W|z3()M7E|-V+{w6#k052fij1GqiWiQtXHN+Qh0_zX+%m z(5}nV=yk_c95|c)w#^-a8ABSHHg~bLFWUi0oYo0nPdoBQcGh=Y5idv<1B?%+nnr$j zQS7WV=UE@_h{_3yj~j?0I%F7uzJxeC@f!gupwl3Y671I^P14OfQ+58FbR6yT4=Z5o zFHOebDZJN%M@fpZ`mzB;{AnVix_Yq%xx;q}?-R?XL7R@T@f&$#?^+X#7mTn_5HzHX zj9%Muj^SPs>pAy+@P${8pUs*7@>I068ev3wHhbG0-U`$v`p`g%+T?Jjhb*dP1D_}! zsuu2!fBmD=F`ubkGZ|b?>NX{$$?T5}V4c=oP^qe3-8N8h#`%_&@e=PCU#)IiB4mm8 zL%R8o1-sq*7@?$y$G_C`s(XD2)uDmUW*o%;Z!4{&Q5{Qs&k64S2tmv4HLOe!C%9-v zbw6_C4(Q6@_U{}d5Sue6k1SNYny~ZwX_qc!V2mI(XWH$dj(6ew^_s=+x`4v8ss&>o zrAiR;7xc-$;#_G$l(%UOVm-%DC?6vllUs{O*@Mz=IZ{Yift!cA!LR+v>wBwi0gyY1 zqV`#!xcl}JTZ!2M8d4}05ql&%f^soCvteAe7GP#kj?l^%E(gkx$VBI%q@fQ_d`D|f zK>G^{zB&kdD97>l`qr)<|4CHTb5Iqiv0MGFW>a_biO;D|F1tp!`K>_ZVu^FnIMRNF zH(?p>6!3U5G&XOXaD@civ~{guo(3Dedu{JvcP$&X<>b= z!gp0=v*XwtKKt&w^&XhSfkPD9EyPLJtDcp;d%Rqi$4x?QOt|ZOe)cQJi$C}_N5T7!=@s9OG^hP-nT#LH30@b4i)t*J&W`0Vsm8;0ym6_u8iGWB2L1ZYul zH7&zmw(;v49Gg(V#spg>EcnnK1RqP1>A{l-72VAjA}I&c+NGgThHgYJe$Wgnl9x0z z&*FVl3b5!@o8}jrNy{24Rjk%}R^If2{s9&)vr%0HEbdJ)?5*Hpglg6NyI12plWcIm z51qqgM8lZq>4o)YS2rMQ<`m&ePV+Wr&jnRqsv5sOIysA6+9>2}gs3uwGHS77QxpWo zK#nuDaVw0TJr0o_=P*zG?H8XrU;L}$+iXnbB~YOqZ5-+(N)))$Q^zI~D$*W9Pu=yH*b-V z7Pa@$G(=QXq`tA|D6tAs zvAT&+Goo}xX6SahOF^YyEieiPc5|eBIw|n}3mVIDde$nT0TK|uCL>esJ=8xCuF9gi z7t#%CWI6E$A^pDqy#_-0C21oeK#rh}{Z)l2B|vO5;xVf?*@Yz93LvC~4@jVJMmGHp z+3xF}x(~i}acPQjHE=VEmQN~;2?{XLvj&-Sl#&vzRVW-BXmj?-)=~))SQb53-Gmh`u zbv;jCoRUK7iAD`CsbJv)s6sAHq<0l$Y%x<~nm*tU{J+46&Z0yhPjRX1X_u>=ovr&H-Ps!GL{rH6Ytkhq|6Y_My<5`UZ`Rn)M6YjH7 ze;7~6)_VQ;g!`=2U&a&ibiw0UjRX1X_TmuryA=^09*9rL(l+MtBXciAwhmof)^j?V z3K7!t497YY8(G+>U=HoH+T&S`1Np#-&lon4t87miz|Xs@5(hB6V^!baDI?c&YR(3I zJ!5~rs}Bv_9`1s&H;p;FRk;KotC8I^x9ElG8;|zRmbb6Xymit>$@KO+%^g2iUXg$d z=rALFKb!~vIKs55Cmhq(w(sxL3xVOO2f(sZ>%z3>13sOz-R|ftKtLdaxH@9yTnyM* zyvinF8Ed2w5wR|*=bu|DDq7TXr5`(~B%MCG%>qW<+L~I@Q>l>AvS?a%OqW*w0H9!! zQrDDTIhBG==ahHpRuWQ-XD40tng&yhTB2=2@X2y#@(GKwiPXMQk>TS?(67e0bK*0LKID1b1r4;DLcwt!|a{`Wco%fa<6 zD6V*&wvq~hUd-Z6F`Bmz69p6JHtS>@q>Z-QM)f=e@b7arAte2X%vbM^Fm{9dBbu$?kICYobfN&vBpfE@WAm@GbG5vo0 zLVeb1FXIXMIv}03>r!nMw!(L45*zoE{9{xlEguiJ=2*6h?+{{W{?${m$ zCM;lM(kKIrclr8+3Ii+u0G*(Iy?)$6eb#C(;|cjX>^Sw}4M2}onu~uI)ADq{<6Y7K zPDfuI1)Z&2d`#Zj(lODGDk?4}Q3m_b4iHPLQzH`FTbJuDxWt?tsz`0(g8$$h7qEBXC0s`C1M&{{R{{zL2h}DGZwB&n41nRK_L( z3I&HiL^};QrrT{Gr(hD4kAqeU>#E0H@D0|lNdS>OjmNe6A$kv<;@wK7?bJ%2R#TXo zigKoq$D^ZG6z`Kpc~g)E!7Q>|jb=0t*8%C};|9`_M)SsY`}(ms{P2;w zap9`(a1@d2xwU5lKAy3^-_?j(`sHXC*!~6VG}d7e9~o>U5fQNtspp_FeeB*$AA2IePr+ + + + + + + + Sticker Print Demo + + + + + + + + +
+

Sticker Print Demo

+
+ + + \ No newline at end of file diff --git a/lib/zpl-image/LICENSE b/lib/zpl-image/LICENSE new file mode 100644 index 0000000..b4c9136 --- /dev/null +++ b/lib/zpl-image/LICENSE @@ -0,0 +1,21 @@ +zpl-image + +Copyright 2019 Mark Warren + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. diff --git a/lib/zpl-image/README.md b/lib/zpl-image/README.md new file mode 100644 index 0000000..c4a0a7b --- /dev/null +++ b/lib/zpl-image/README.md @@ -0,0 +1,235 @@ + +# zpl-image + +A pure javascript module that converts images to either Z64-encoded or ACS-encoded GRF bitmaps for use with ZPL. +The term ACS (Alternative Compression Scheme) denotes the run-length compression algorithm described in the section +of the ZPL Reference Manual titled "Alternative Data Compression Scheme". Z64 typically gives better compression +but is not available on all printers (especially older ones). The ACS encoding should work on any printer made +since the mid 90s, maybe earlier. + +This module provides the following features: + + - Works in both node.js and modern browsers. + - Converts the image to grayscale, then applies a user-supplied blackness + threshold to decide which pixels are black. + - Optionally removes any empty/white space around the edges of the image. + - Optionally rotates the image to one of the orthogonal angles. This step + is often necessary as ZPL does not provide the ability to rotate an image + during formatting. + - Converts the monochrome image to a GRF bitmap. + - Converts the GRF bitmap to either Z64 or ACS encoding. + - For Z64, zlib in node.js or pako.js in the browser is used for compression. + +The blackness threshold is specified as an integer between 1 and 99 (think of it as a +gray percentage). Pixels darker than the gray% are converted to black. The default is 50. + +Rotation is specified as one of the values: + + - `'N'` : No rotation, the default. + - `'L'` : Left, 90 degrees counter-clockwise rotation. + - `'R'` : Right, 90 degrees clockwise rotation. + - `'I'` : Inverted, 180 degrees rotation. + - `'B'` : Same as `'L'` but named to match the ZPL notation. + +Blackness and rotation are passed via an options object. For example, to specify +a black threshold of 56% and rotation of -90 degrees, you would pass in: + +```javascript + { black:56, rotate:'L' } +``` + +Trimming of empty space around the image is enabled by default. To disable, specify +the option `notrim:true`. + +## Demo + +Included with this module is the file `zpl-image.html`. You can run it directly +from the browser using the `file://` scheme. It lets you drag and drop an image +and then interactively adjust the blackness threshold and rotation. + +When you are satisfied with the results, select either Z64 or ACS encoding and +click the clipboard icon to copy the ZPL. The ZPL will have the following format: + +``` +^FX filename.ext (WxHpx, X-Rotate, XX% Black)^FS +^GFA,grflen,grflen,rowlen,...ASCII-armored-encoding... +``` + +`^FX ... ^FS` is a ZPL comment. + +`^GF` is the ZPL command for use-once image rendering (that is, the image is not +saved to the printer for later recall by other label formats). + +The rendered image displayed on the page is the actual data decoded and then drawn +to a canvas. If you are interested in that bit of functionality, look for `z64ToCanvas` +and `acsToCanvas` in the `zpl-image.html` file. + +## Generic Browser Usage + +To use in the browser, include the following two scripts: + +```html + + +``` + +There is a version of pako.js included with this module, but it will not be updated +frequently. It is primarily intended for the demo html file but should be sufficient +for production use. + +```javascript +// Works with and elements or any element that is +// compatible with CanvasRenderingContext2D.drawImage(). +let img = document.getElementById('image'); +let res = imageToZ64(img); // Uses all defaults + +// res.length is the uncompressed GRF length. +// res.rowlen is the GRF row length. +// res.z64 is the Z64 encoded string. +let zpl = `^GFA,${res.length},${res.length},${res.rowlen},${res.z64}`; +``` + +An alternative for when you already have the pixel values in RGBA format +(either in a Uint8Array or Array of integers clamped to 0..255) is +`rgbaToZ64()`. This function is the lower-level converter used +by both node.js and `imageToZ64()`. See the node.js section for more details. + +```javascript +// `rgba` is an array of RGBA values. +// `width` is the width of the image, in pixels. +// The return value is the same as above. +let res = rgbaToZ64(rgba, width, { black:55, rotate:'I' }); +``` + +The same interfaces exist for ACS encoding, using the functions `imageToACS()` and +`rgbaToACS()`. The returned object from each function is identical to the above, with +the exception that the encoded text is in the `acs` property instead of `z64`. + +## RequireJS Browser Usage + +This is untested but the module exports are wrapped in a UMD, so in theory you +should be able to use this with RequireJS. The exports are the same as with the +generic browser usage: + +```javascript +// Use the Z64 interface +const { imageToZ64, rgbaToZ64 } = require("zpl-image"); + +// Or the ACS interface +const { imageToACS, rgbaToACS } = require("zpl-image"); +``` + +## Node.js Usage + +The exports from `require("zpl-image")` are the functions `rgbaToZ64()` and +`rgbaToACS()`. + +```javascript +// The Z64 interface +const rgbaToZ64 = require("zpl-image").rgbaToZ64; + +// The ACS interface +const rgbaToACS = require("zpl-image").rgbaToACS; + +``` + +Both methods take two or three parameters: + +``` +rgbaToZ64(rgba, width [, opts]) +rgbaToACS(rgba, width [, opts]) +``` + +`rgba` is an array-like object with length equal to `width * height * 4`. +An array-like object can be a Buffer, Uint8Array, or Array of integers +clamped to 0..255. `width` and `height` are the dimensions of the image, in pixels. +Each "quad" of the RGBA array is structured as: + +```javascript +rgba[i] // red 0..255 +rgba[i+1] // green 0..255 +rgba[i+2] // blue 0..255 +rgba[i+3] // alpha (0 == fully transparent, 255 == fully opaque) +``` + +Because of the varied nature of the node.js ecosystem, zpl-image does not include +any dependencies for image modules. You need to decide what types of images to +support and which image processing package(s) to use. Below are some simple +examples showing three different image modules: + + - [pngjs](https://www.npmjs.com/package/pngjs) + - [omggif](https://www.npmjs.com/package/omggif) + - [jpeg-js](https://www.npmjs.com/package/jpeg-js) + +All of the following examples show Z64 encoding but can be switched to ACS +by simply renaming `Z64` to `ACS`. + +## pngjs (PNG Conversion) + +[pngjs](https://www.npmjs.com/package/pngjs) + +```javascript +// Synchronous pngjs usage +const fs = require('fs'); +const PNG = require('pngjs').PNG; +const rgbaToZ64 = require('zpl-image').rgbaToZ64; + +let buf = fs.readFileSync('tux.png'); +let png = PNG.sync.read(buf); +let res = rgbaToZ64(png.data, png.width, { black:53 }); + +// res.length is the uncompressed GRF length. +// res.rowlen is the GRF row length. +// res.z64 is the Z64 encoded string. +let zpl = `^GFA,${res.length},${res.length},${res.rowlen},${res.z64}`; +``` + +```javascript +// Async pngjs usage +const fs = require('fs'); +const PNG = require('pngjs').PNG; +const rgbaToZ64 = require('zpl-image').rgbaToZ64; + +fs.createReadStream('tux.png') + .pipe(new PNG({ filterType: 4 })) + .on('parsed', function() { + // res is the same as above + let res = rgbaToZ64(this.data, this.width, { black:52, rotate:'R' }); + }); +``` + +## omggif (GIF Conversion) + +[omggif](https://www.npmjs.com/package/omggif) + +```javascript +const fs = require('fs'); +const GIF = require('omggif'); +const rgbaToZ64 = require('zpl-image').rgbaToZ64; + +let buf = fs.readFileSync('tux.gif'); +let gif = new GIF.GifReader(buf); +let rgba = Buffer.alloc(gif.width * gif.height * 4); + +// Decode only the first frame +gif.decodeAndBlitFrameRGBA(0, rgba); + +let res = rgbaToZ64(rgba, gif.width, { black:47 }); +``` + +## jpeg-js (JPEG Conversion) + +[jpeg-js](https://www.npmjs.com/package/jpeg-js) + +```javascript +const fs = require('fs'); +const JPG = require('jpeg-js'); +const rgbaToZ64 = require('zpl-image').rgbaToZ64; + +let buf = fs.readFileSync('tux.jpg'); +let jpg = JPG.decode(buf); +let res = rgbaToZ64(jpg.data, jpg.width, { black:51, rotate:'I' }); +``` + +## MIT License + diff --git a/lib/zpl-image/copyzpl.css b/lib/zpl-image/copyzpl.css new file mode 100644 index 0000000..331fdfb --- /dev/null +++ b/lib/zpl-image/copyzpl.css @@ -0,0 +1,22 @@ + +/* Keep the unwieldy data-url out of the main code */ +#copyzpl { + position: absolute; + top: -2ex; + width: 48px; + height: 48px; + border: 1px solid #aaa; + border-radius: 4px; + background-color: #fff; + background-position:50% 50%; + background-repeat: no-repeat; +} +#copyzpl:hover { + background-color: #99beff; +} +#copyzpl:active { + background-color: #4c8dff; +} +#copyzpl { + background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABwAAAAnCAYAAAAcsCj6AAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAAJcEhZcwAADsIAAA7CARUoSoAAAAT5SURBVFhHtVdLbBtVFJ1fZvwZx6k99sSf1FVKPlWaBJKS8JVAlBIQqKpEJGDXCgnBogLBPguQKoRYIbFg0xWsK5AQFUWIRSVgUVEVyI8ShygORsqniZ2xx/PhvOfx1FOHJA2TI12/9+5789679557Z8wy+wfb0zOc3iqvntW2t5+s6TVLjkW/b0+nv/nj55+WMW076/xBb2+vEgqHr3Acp2Nosyxro1+TI5Frp554pru+ykdks7l3yQGCIFjRWPwrRVG+5Hm+goMtVe38zFnmD2zbZmOx+HXSTSY7L4+++Koy/tIraiAUukJ0gUBgbmpqiqOL9wDvtDticnJS3CiVnvrw0qUXKtXK2Zquy6Io5reKy8p6YXHI1KtjhmFkOZ4Xfr31W1WWo1a5vLWCRw8Wz4EHx4aDIfkm3GiSmEFF4mbBlRZxLfpUR+agM4LB4Myz586dpA//ByhLs9nsc6VS6QNd149i2OyatkqlErEsa1/uIgiHw3cQgpozJLDa2tqmoX+jUCjMMvF4/GEo/sYEve1hiShKhXgq1c9ZFvNarVZToaSAmxheEOrC7xriHUGeaTwPVztahtH1ago/H3O6Xul3dIwoSaXM0aNvh9vj40TkaOw8Nlh3pvcEiWkymZzgJGkQMtTV1fUyvPePM81omtZDfH4VfWq2qqqfonXjhblBkKOIbouLdhJczkR7BNIAm87lLjQIB1Ld9pKB437Hr1UfMEwkkdiUJOkv3JIEntlDLKTMzUQi0UwYOyjLMw3XomXZkCx/u10qnSYKVU1dLBZXPqGzwMTEhDQ9nx/ZKm9lONt2LyeJYsBkGdswdFLmKFiLNcOR0Hx+fv4Whu6le06cGL89O/sjmM6EQqFFRpYj30FPTU50pt+iqzywcT0Iqk1DSFWhlaVJR8VJs2Z0d/edauQrDvzTE8NkMvU6WeQnegeGH28c2BJDlAyDtrbtixAEQmKEdhx4DhRFXiLt0OjoKCxfAutoGbtfQTFfyh479gjZyzaYZhJ5DzQA0q4sLw8jZxQEmj2IYJvU5tqdPrIXSqNLLAJvWmA9adRM5of2aPQGgqzBUrwFZB39yr2yy9wvinLkBtnLyUEK9DmwVL6GPg2qqqbP0xkfcbz/5KMgDTGEsHSBWOje4DBgWYgiw5AKBCIxFvLZdpO0gcGRkVHcZonc7CCC6rSUyeUoaQSB5qcD2xtDpAsd+0kaQZICMMp97XhJg+uRxk/SmLpOvhZcK1k8dLVcLp8hA5DmQrFYuEz0uVxOwheA90L7BIq4tbi4WEXXPj4w8NjC9PR1WM6g0nhL22GwtLuptMHyBQ7WtrzW/STNPbDxiWG1pIWfpGkGyGMTC5vTggbXT9KILCuQ1kVzDFOZzEWiI5XeDyEYHhk7A6Po/i2vJ5bj6G0Ii/0QAq1S2W70CTwHms7bwk9U66XNBSltd49vKXL/HwL9RKkDlvJgMe9ayQn1SuMnONZsa8QTsJAWpmtXrVp9yOn6hoqmuXviYJsNhuWvtXLpeaKAuVpnKvVFpL1jVjd0ja5ywTNwgISXi2napjcusAMfzFLNMnQbiUh0sEnXSqWu9dXV91AiA0SHdJljYjHlo/r8XYGvfZPmfZVE4nM+FlOL+H/xtGkaCpSHhrAsz4Y7Ot4kDOK6+/pGNtfW3lnb2HjANs37/8u0C1DKmJiizISDwffz+fzcv7cGZ55/jBKaAAAAAElFTkSuQmCC); +} diff --git a/lib/zpl-image/package.json b/lib/zpl-image/package.json new file mode 100644 index 0000000..f766e49 --- /dev/null +++ b/lib/zpl-image/package.json @@ -0,0 +1,31 @@ +{ + "name": "zpl-image", + "version": "0.2.0", + "description": "A pure javascript module that converts PNG, JPEG, and GIF to Z64-encoded GRF bitmaps for use with ZPL.", + "main": "zpl-image.js", + "scripts": { + "test": "echo \"Error: no test specified\" && exit 1" + }, + "repository": { + "type": "git", + "url": "git+https://github.com/metafloor/zpl-image.git" + }, + "keywords": [ + "image", + "ZPL", + "Z64", + "GRF", + "PNG", + "JPEG", + "GIF" + ], + "author": "Mark Warren", + "license": "MIT", + "bugs": { + "url": "https://github.com/metafloor/zpl-image/issues" + }, + "homepage": "https://github.com/metafloor/zpl-image", + "directories": { + "test": "tests" + } +} diff --git a/lib/zpl-image/pako.js b/lib/zpl-image/pako.js new file mode 100644 index 0000000..f3a204e --- /dev/null +++ b/lib/zpl-image/pako.js @@ -0,0 +1,6441 @@ +/* pako 1.0.0 nodeca/pako */(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.pako = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o Array + * + * Chunks of output data, if [[Deflate#onData]] not overriden. + **/ + +/** + * Deflate.result -> Uint8Array|Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param) or if you + * push a chunk with explicit flush (call [[Deflate#push]] with + * `Z_SYNC_FLUSH` param). + **/ + +/** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + +/** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + +/** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `to` (String) - if equal to 'string', then result will be "binary string" + * (each char code [0..255]) + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * var pako = require('pako') + * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * var deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ +function Deflate(options) { + if (!(this instanceof Deflate)) return new Deflate(options); + + this.options = utils.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY, + to: '' + }, options || {}); + + var opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new ZStream(); + this.strm.avail_out = 0; + + var status = zlib_deflate.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK) { + throw new Error(msg[status]); + } + + if (opt.header) { + zlib_deflate.deflateSetHeader(this.strm, opt.header); + } +} + +/** + * Deflate#push(data[, mode]) -> Boolean + * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must have + * mode Z_FINISH (or `true`). That will flush internal pending buffers and call + * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you + * can use mode Z_SYNC_FLUSH, keeping the compression context. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * We strongly recommend to use `Uint8Array` on input for best speed (output + * array format is detected automatically). Also, don't skip last param and always + * use the same type in your code (boolean or number). That will improve JS speed. + * + * For regular `Array`-s make sure all elements are [0..255]. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Deflate.prototype.push = function (data, mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var status, _mode; + + if (this.ended) { return false; } + + _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH); + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + do { + if (strm.avail_out === 0) { + strm.output = new utils.Buf8(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + status = zlib_deflate.deflate(strm, _mode); /* no bad return value */ + + if (status !== Z_STREAM_END && status !== Z_OK) { + this.onEnd(status); + this.ended = true; + return false; + } + if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) { + if (this.options.to === 'string') { + this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out))); + } else { + this.onData(utils.shrinkBuf(strm.output, strm.next_out)); + } + } + } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END); + + // Finalize on the last chunk. + if (_mode === Z_FINISH) { + status = zlib_deflate.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK; + } + + // callback interim results if Z_SYNC_FLUSH. + if (_mode === Z_SYNC_FLUSH) { + this.onEnd(Z_OK); + strm.avail_out = 0; + return true; + } + + return true; +}; + + +/** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array|Array|String): ouput data. Type of array depends + * on js engine support. When string output requested, each chunk + * will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Deflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH) + * or if an error happened. By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Deflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = utils.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * deflate(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be "binary string" + * (each char code [0..255]) + * + * ##### Example: + * + * ```javascript + * var pako = require('pako') + * , data = Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ +function deflate(input, options) { + var deflator = new Deflate(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg; } + + return deflator.result; +} + + +/** + * deflateRaw(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function deflateRaw(input, options) { + options = options || {}; + options.raw = true; + return deflate(input, options); +} + + +/** + * gzip(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ +function gzip(input, options) { + options = options || {}; + options.gzip = true; + return deflate(input, options); +} + + +exports.Deflate = Deflate; +exports.deflate = deflate; +exports.deflateRaw = deflateRaw; +exports.gzip = gzip; + +},{"./utils/common":3,"./utils/strings":4,"./zlib/deflate":8,"./zlib/messages":13,"./zlib/zstream":15}],2:[function(require,module,exports){ +'use strict'; + + +var zlib_inflate = require('./zlib/inflate'); +var utils = require('./utils/common'); +var strings = require('./utils/strings'); +var c = require('./zlib/constants'); +var msg = require('./zlib/messages'); +var ZStream = require('./zlib/zstream'); +var GZheader = require('./zlib/gzheader'); + +var toString = Object.prototype.toString; + +/** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + +/* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overriden. + **/ + +/** + * Inflate.result -> Uint8Array|Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you + * push a chunk with explicit flush (call [[Inflate#push]] with + * `Z_SYNC_FLUSH` param). + **/ + +/** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + +/** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + +/** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * var pako = require('pako') + * , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * var inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ +function Inflate(options) { + if (!(this instanceof Inflate)) return new Inflate(options); + + this.options = utils.assign({ + chunkSize: 16384, + windowBits: 0, + to: '' + }, options || {}); + + var opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new ZStream(); + this.strm.avail_out = 0; + + var status = zlib_inflate.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== c.Z_OK) { + throw new Error(msg[status]); + } + + this.header = new GZheader(); + + zlib_inflate.inflateGetHeader(this.strm, this.header); +} + +/** + * Inflate#push(data[, mode]) -> Boolean + * - data (Uint8Array|Array|ArrayBuffer|String): input data + * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. The last data block must have + * mode Z_FINISH (or `true`). That will flush internal pending buffers and call + * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you + * can use mode Z_SYNC_FLUSH, keeping the decompression context. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * We strongly recommend to use `Uint8Array` on input for best speed (output + * format is detected automatically). Also, don't skip last param and always + * use the same type in your code (boolean or number). That will improve JS speed. + * + * For regular `Array`-s make sure all elements are [0..255]. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Inflate.prototype.push = function (data, mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var status, _mode; + var next_out_utf8, tail, utf8str; + + // Flag to properly process Z_BUF_ERROR on testing inflate call + // when we check that all output data was flushed. + var allowBufError = false; + + if (this.ended) { return false; } + _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH); + + // Convert data if needed + if (typeof data === 'string') { + // Only binary strings can be decompressed on practice + strm.input = strings.binstring2buf(data); + } else if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + do { + if (strm.avail_out === 0) { + strm.output = new utils.Buf8(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */ + + if (status === c.Z_BUF_ERROR && allowBufError === true) { + status = c.Z_OK; + allowBufError = false; + } + + if (status !== c.Z_STREAM_END && status !== c.Z_OK) { + this.onEnd(status); + this.ended = true; + return false; + } + + if (strm.next_out) { + if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) { + + if (this.options.to === 'string') { + + next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + tail = strm.next_out - next_out_utf8; + utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); } + + this.onData(utf8str); + + } else { + this.onData(utils.shrinkBuf(strm.output, strm.next_out)); + } + } + } + + // When no more input data, we should check that internal inflate buffers + // are flushed. The only way to do it when avail_out = 0 - run one more + // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR. + // Here we set flag to process this error properly. + // + // NOTE. Deflate does not return error in this case and does not needs such + // logic. + if (strm.avail_in === 0 && strm.avail_out === 0) { + allowBufError = true; + } + + } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END); + + if (status === c.Z_STREAM_END) { + _mode = c.Z_FINISH; + } + + // Finalize on the last chunk. + if (_mode === c.Z_FINISH) { + status = zlib_inflate.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === c.Z_OK; + } + + // callback interim results if Z_SYNC_FLUSH. + if (_mode === c.Z_SYNC_FLUSH) { + this.onEnd(c.Z_OK); + strm.avail_out = 0; + return true; + } + + return true; +}; + + +/** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|Array|String): ouput data. Type of array depends + * on js engine support. When string output requested, each chunk + * will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Inflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH) + * or if an error happened. By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Inflate.prototype.onEnd = function (status) { + // On success - join + if (status === c.Z_OK) { + if (this.options.to === 'string') { + // Glue & convert here, until we teach pako to send + // utf8 alligned strings to onData + this.result = this.chunks.join(''); + } else { + this.result = utils.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * inflate(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * var pako = require('pako') + * , input = pako.deflate([1,2,3,4,5,6,7,8,9]) + * , output; + * + * try { + * output = pako.inflate(input); + * } catch (err) + * console.log(err); + * } + * ``` + **/ +function inflate(input, options) { + var inflator = new Inflate(options); + + inflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) { throw inflator.msg; } + + return inflator.result; +} + + +/** + * inflateRaw(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function inflateRaw(input, options) { + options = options || {}; + options.raw = true; + return inflate(input, options); +} + + +/** + * ungzip(data[, options]) -> Uint8Array|Array|String + * - data (Uint8Array|Array|String): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + +exports.Inflate = Inflate; +exports.inflate = inflate; +exports.inflateRaw = inflateRaw; +exports.ungzip = inflate; + +},{"./utils/common":3,"./utils/strings":4,"./zlib/constants":6,"./zlib/gzheader":9,"./zlib/inflate":11,"./zlib/messages":13,"./zlib/zstream":15}],3:[function(require,module,exports){ +'use strict'; + + +var TYPED_OK = (typeof Uint8Array !== 'undefined') && + (typeof Uint16Array !== 'undefined') && + (typeof Int32Array !== 'undefined'); + + +exports.assign = function (obj /*from1, from2, from3, ...*/) { + var sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + var source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (var p in source) { + if (source.hasOwnProperty(p)) { + obj[p] = source[p]; + } + } + } + + return obj; +}; + + +// reduce buffer size, avoiding mem copy +exports.shrinkBuf = function (buf, size) { + if (buf.length === size) { return buf; } + if (buf.subarray) { return buf.subarray(0, size); } + buf.length = size; + return buf; +}; + + +var fnTyped = { + arraySet: function (dest, src, src_offs, len, dest_offs) { + if (src.subarray && dest.subarray) { + dest.set(src.subarray(src_offs, src_offs + len), dest_offs); + return; + } + // Fallback to ordinary array + for (var i = 0; i < len; i++) { + dest[dest_offs + i] = src[src_offs + i]; + } + }, + // Join array of chunks to single array. + flattenChunks: function (chunks) { + var i, l, len, pos, chunk, result; + + // calculate data length + len = 0; + for (i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + result = new Uint8Array(len); + pos = 0; + for (i = 0, l = chunks.length; i < l; i++) { + chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; + } +}; + +var fnUntyped = { + arraySet: function (dest, src, src_offs, len, dest_offs) { + for (var i = 0; i < len; i++) { + dest[dest_offs + i] = src[src_offs + i]; + } + }, + // Join array of chunks to single array. + flattenChunks: function (chunks) { + return [].concat.apply([], chunks); + } +}; + + +// Enable/Disable typed arrays use, for testing +// +exports.setTyped = function (on) { + if (on) { + exports.Buf8 = Uint8Array; + exports.Buf16 = Uint16Array; + exports.Buf32 = Int32Array; + exports.assign(exports, fnTyped); + } else { + exports.Buf8 = Array; + exports.Buf16 = Array; + exports.Buf32 = Array; + exports.assign(exports, fnUntyped); + } +}; + +exports.setTyped(TYPED_OK); + +},{}],4:[function(require,module,exports){ +// String encode/decode helpers +'use strict'; + + +var utils = require('./common'); + + +// Quick check if we can use fast array to bin string conversion +// +// - apply(Array) can fail on Android 2.2 +// - apply(Uint8Array) can fail on iOS 5.1 Safary +// +var STR_APPLY_OK = true; +var STR_APPLY_UIA_OK = true; + +try { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; } +try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +var _utf8len = new utils.Buf8(256); +for (var q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); +} +_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + +// convert string to array (typed, when possible) +exports.string2buf = function (str) { + var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new utils.Buf8(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Helper (used in 2 places) +function buf2binstring(buf, len) { + // use fallback for big arrays to avoid stack overflow + if (len < 65537) { + if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) { + return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len)); + } + } + + var result = ''; + for (var i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; +} + + +// Convert byte array to binary string +exports.buf2binstring = function (buf) { + return buf2binstring(buf, buf.length); +}; + + +// Convert binary string (typed, when possible) +exports.binstring2buf = function (str) { + var buf = new utils.Buf8(str.length); + for (var i = 0, len = buf.length; i < len; i++) { + buf[i] = str.charCodeAt(i); + } + return buf; +}; + + +// convert array to string +exports.buf2string = function (buf, max) { + var i, out, c, c_len; + var len = max || buf.length; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); +}; + + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +exports.utf8border = function (buf, max) { + var pos; + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Fuckup - very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means vuffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +},{"./common":3}],5:[function(require,module,exports){ +'use strict'; + +// Note: adler32 takes 12% for level 0 and 2% for level 6. +// It doesn't worth to make additional optimizationa as in original. +// Small size is preferable. + +function adler32(adler, buf, len, pos) { + var s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; +} + + +module.exports = adler32; + +},{}],6:[function(require,module,exports){ +'use strict'; + + +module.exports = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + //Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type +}; + +},{}],7:[function(require,module,exports){ +'use strict'; + +// Note: we can't get significant speed boost here. +// So write code to minimize size - no pregenerated tables +// and array tools dependencies. + + +// Use ordinary array, since untyped makes no boost here +function makeTable() { + var c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +} + +// Create table on load. Just 255 signed longs. Not a problem. +var crcTable = makeTable(); + + +function crc32(crc, buf, len, pos) { + var t = crcTable, + end = pos + len; + + crc ^= -1; + + for (var i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + + +module.exports = crc32; + +},{}],8:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils/common'); +var trees = require('./trees'); +var adler32 = require('./adler32'); +var crc32 = require('./crc32'); +var msg = require('./messages'); + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +/* Allowed flush values; see deflate() and inflate() below for details */ +var Z_NO_FLUSH = 0; +var Z_PARTIAL_FLUSH = 1; +//var Z_SYNC_FLUSH = 2; +var Z_FULL_FLUSH = 3; +var Z_FINISH = 4; +var Z_BLOCK = 5; +//var Z_TREES = 6; + + +/* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ +var Z_OK = 0; +var Z_STREAM_END = 1; +//var Z_NEED_DICT = 2; +//var Z_ERRNO = -1; +var Z_STREAM_ERROR = -2; +var Z_DATA_ERROR = -3; +//var Z_MEM_ERROR = -4; +var Z_BUF_ERROR = -5; +//var Z_VERSION_ERROR = -6; + + +/* compression levels */ +//var Z_NO_COMPRESSION = 0; +//var Z_BEST_SPEED = 1; +//var Z_BEST_COMPRESSION = 9; +var Z_DEFAULT_COMPRESSION = -1; + + +var Z_FILTERED = 1; +var Z_HUFFMAN_ONLY = 2; +var Z_RLE = 3; +var Z_FIXED = 4; +var Z_DEFAULT_STRATEGY = 0; + +/* Possible values of the data_type field (though see inflate()) */ +//var Z_BINARY = 0; +//var Z_TEXT = 1; +//var Z_ASCII = 1; // = Z_TEXT +var Z_UNKNOWN = 2; + + +/* The deflate compression method */ +var Z_DEFLATED = 8; + +/*============================================================================*/ + + +var MAX_MEM_LEVEL = 9; +/* Maximum value for memLevel in deflateInit2 */ +var MAX_WBITS = 15; +/* 32K LZ77 window */ +var DEF_MEM_LEVEL = 8; + + +var LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ +var LITERALS = 256; +/* number of literal bytes 0..255 */ +var L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ +var D_CODES = 30; +/* number of distance codes */ +var BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ +var HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ +var MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +var MIN_MATCH = 3; +var MAX_MATCH = 258; +var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + +var PRESET_DICT = 0x20; + +var INIT_STATE = 42; +var EXTRA_STATE = 69; +var NAME_STATE = 73; +var COMMENT_STATE = 91; +var HCRC_STATE = 103; +var BUSY_STATE = 113; +var FINISH_STATE = 666; + +var BS_NEED_MORE = 1; /* block not completed, need more input or more output */ +var BS_BLOCK_DONE = 2; /* block flush performed */ +var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ +var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + +var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + +function err(strm, errorCode) { + strm.msg = msg[errorCode]; + return errorCode; +} + +function rank(f) { + return ((f) << 1) - ((f) > 4 ? 9 : 0); +} + +function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } + + +/* ========================================================================= + * Flush as much pending output as possible. All deflate() output goes + * through this function so some applications may wish to modify it + * to avoid allocating a large strm->output buffer and copying into it. + * (See also read_buf()). + */ +function flush_pending(strm) { + var s = strm.state; + + //_tr_flush_bits(s); + var len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } +} + + +function flush_block_only(s, last) { + trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); +} + + +function put_byte(s, b) { + s.pending_buf[s.pending++] = b; +} + + +/* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ +function putShortMSB(s, b) { +// put_byte(s, (Byte)(b >> 8)); +// put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; +} + + +/* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ +function read_buf(strm, buf, start, size) { + var len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + utils.arraySet(buf, strm.input, strm.next_in, len, start); + if (strm.state.wrap === 1) { + strm.adler = adler32(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; +} + + +/* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ +function longest_match(s, cur_match) { + var chain_length = s.max_chain_length; /* max hash chain length */ + var scan = s.strstart; /* current string */ + var match; /* matched string */ + var len; /* length of current match */ + var best_len = s.prev_length; /* best match length so far */ + var nice_match = s.nice_match; /* stop if match long enough */ + var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + var _win = s.window; // shortcut + + var wmask = s.w_mask; + var prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + var strend = s.strstart + MAX_MATCH; + var scan_end1 = _win[scan + best_len - 1]; + var scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; +} + + +/* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ +function fill_window(s) { + var _w_size = s.w_size; + var p, n, m, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + utils.arraySet(s.window, s.window, _w_size, _w_size, 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + + /* Slide the hash table (could be avoided with 32 bit values + at the expense of memory usage). We slide even when level == 0 + to keep the hash table consistent if we switch back to level > 0 + later. (Using level 0 permanently is not an optimal usage of + zlib, so we don't care about this pathological case.) + */ + + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = (m >= _w_size ? m - _w_size : 0); + } while (--n); + + n = _w_size; + p = n; + do { + m = s.prev[--p]; + s.prev[p] = (m >= _w_size ? m - _w_size : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask; +//#if MIN_MATCH != 3 +// Call update_hash() MIN_MATCH-3 more times +//#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask; + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ +// if (s.high_water < s.window_size) { +// var curr = s.strstart + s.lookahead; +// var init = 0; +// +// if (s.high_water < curr) { +// /* Previous high water mark below current data -- zero WIN_INIT +// * bytes or up to end of window, whichever is less. +// */ +// init = s.window_size - curr; +// if (init > WIN_INIT) +// init = WIN_INIT; +// zmemzero(s->window + curr, (unsigned)init); +// s->high_water = curr + init; +// } +// else if (s->high_water < (ulg)curr + WIN_INIT) { +// /* High water mark at or above current data, but below current data +// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up +// * to end of window, whichever is less. +// */ +// init = (ulg)curr + WIN_INIT - s->high_water; +// if (init > s->window_size - s->high_water) +// init = s->window_size - s->high_water; +// zmemzero(s->window + s->high_water, (unsigned)init); +// s->high_water += init; +// } +// } +// +// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, +// "not enough room for search"); +} + +/* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * This function does not insert new strings in the dictionary since + * uncompressible data is probably not useful. This function is used + * only for the level=0 compression option. + * NOTE: this function should be optimized to avoid extra copying from + * window to pending_buf. + */ +function deflate_stored(s, flush) { + /* Stored blocks are limited to 0xffff bytes, pending_buf is limited + * to pending_buf_size, and each stored block has a 5 byte header: + */ + var max_block_size = 0xffff; + + if (max_block_size > s.pending_buf_size - 5) { + max_block_size = s.pending_buf_size - 5; + } + + /* Copy as much as possible from input to output: */ + for (;;) { + /* Fill the window as much as possible: */ + if (s.lookahead <= 1) { + + //Assert(s->strstart < s->w_size+MAX_DIST(s) || + // s->block_start >= (long)s->w_size, "slide too late"); +// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) || +// s.block_start >= s.w_size)) { +// throw new Error("slide too late"); +// } + + fill_window(s); + if (s.lookahead === 0 && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + + if (s.lookahead === 0) { + break; + } + /* flush the current block */ + } + //Assert(s->block_start >= 0L, "block gone"); +// if (s.block_start < 0) throw new Error("block gone"); + + s.strstart += s.lookahead; + s.lookahead = 0; + + /* Emit a stored block if pending_buf will be full: */ + var max_start = s.block_start + max_block_size; + + if (s.strstart === 0 || s.strstart >= max_start) { + /* strstart == 0 is possible when wraparound on 16-bit machine */ + s.lookahead = s.strstart - max_start; + s.strstart = max_start; + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + + + } + /* Flush if we may have to slide, otherwise block_start may become + * negative and the data will be gone: + */ + if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + + if (s.strstart > s.block_start) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_NEED_MORE; +} + +/* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ +function deflate_fast(s, flush) { + var hash_head; /* head of the hash chain */ + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask; + +//#if MIN_MATCH != 3 +// Call UPDATE_HASH() MIN_MATCH-3 more times +//#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = trees._tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +} + +/* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ +function deflate_slow(s, flush) { + var hash_head; /* head of hash chain */ + var bflush; /* set if current block must be flushed */ + + var max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; +} + + +/* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ +function deflate_rle(s, flush) { + var bflush; /* set if current block must be flushed */ + var prev; /* byte at distance one to match */ + var scan, strend; /* scan goes up to strend for length of run */ + + var _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = trees._tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +} + +/* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ +function deflate_huff(s, flush) { + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = trees._tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.last_lit) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +} + +/* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ +function Config(good_length, max_lazy, nice_length, max_chain, func) { + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; +} + +var configuration_table; + +configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ +]; + + +/* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ +function lm_init(s) { + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; +} + + +function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2); + this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2); + this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new utils.Buf16(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.l_buf = 0; /* buffer index for literals or lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.last_lit = 0; /* running index in l_buf */ + + this.d_buf = 0; + /* Buffer index for distances. To simplify the code, d_buf and l_buf have + * the same number of elements. To use different lengths, an extra flag + * array would be necessary. + */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ +} + + +function deflateResetKeep(strm) { + var s; + + if (!strm || !strm.state) { + return err(strm, Z_STREAM_ERROR); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = (s.wrap ? INIT_STATE : BUSY_STATE); + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = Z_NO_FLUSH; + trees._tr_init(s); + return Z_OK; +} + + +function deflateReset(strm) { + var ret = deflateResetKeep(strm); + if (ret === Z_OK) { + lm_init(strm.state); + } + return ret; +} + + +function deflateSetHeader(strm, head) { + if (!strm || !strm.state) { return Z_STREAM_ERROR; } + if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; } + strm.state.gzhead = head; + return Z_OK; +} + + +function deflateInit2(strm, level, method, windowBits, memLevel, strategy) { + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR; + } + var wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED) { + return err(strm, Z_STREAM_ERROR); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + var s = new DeflateState(); + + strm.state = s; + s.strm = strm; + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new utils.Buf8(s.w_size * 2); + s.head = new utils.Buf16(s.hash_size); + s.prev = new utils.Buf16(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new utils.Buf8(s.pending_buf_size); + + s.d_buf = s.lit_bufsize >> 1; + s.l_buf = (1 + 2) * s.lit_bufsize; + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); +} + +function deflateInit(strm, level) { + return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY); +} + + +function deflate(strm, flush) { + var old_flush, s; + var beg, val; // for gzip header write only + + if (!strm || !strm.state || + flush > Z_BLOCK || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; + } + + s = strm.state; + + if (!strm.output || + (!strm.input && strm.avail_in !== 0) || + (s.status === FINISH_STATE && flush !== Z_FINISH)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR); + } + + s.strm = strm; /* just in case */ + old_flush = s.last_flush; + s.last_flush = flush; + + /* Write the header */ + if (s.status === INIT_STATE) { + + if (s.wrap === 2) { // GZIP header + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + else // DEFLATE header + { + var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8; + var level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + s.status = BUSY_STATE; + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + } + } + +//#ifdef GZIP + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + + while (s.gzindex < (s.gzhead.extra.length & 0xffff)) { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + break; + } + } + put_byte(s, s.gzhead.extra[s.gzindex] & 0xff); + s.gzindex++; + } + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (s.gzindex === s.gzhead.extra.length) { + s.gzindex = 0; + s.status = NAME_STATE; + } + } + else { + s.status = NAME_STATE; + } + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + //int val; + + do { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + val = 1; + break; + } + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (val === 0) { + s.gzindex = 0; + s.status = COMMENT_STATE; + } + } + else { + s.status = COMMENT_STATE; + } + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + beg = s.pending; /* start of bytes to update crc */ + //int val; + + do { + if (s.pending === s.pending_buf_size) { + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + flush_pending(strm); + beg = s.pending; + if (s.pending === s.pending_buf_size) { + val = 1; + break; + } + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + if (val === 0) { + s.status = HCRC_STATE; + } + } + else { + s.status = HCRC_STATE; + } + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + } + if (s.pending + 2 <= s.pending_buf_size) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + } + } + else { + s.status = BUSY_STATE; + } + } +//#endif + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH) { + return err(strm, Z_BUF_ERROR); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR); + } + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) { + var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) : + (s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush)); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + trees._tr_align(s); + } + else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ + + trees._tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK; + } + } + } + //Assert(strm->avail_out > 0, "bug2"); + //if (strm.avail_out <= 0) { throw new Error("bug2");} + + if (flush !== Z_FINISH) { return Z_OK; } + if (s.wrap <= 0) { return Z_STREAM_END; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK : Z_STREAM_END; +} + +function deflateEnd(strm) { + var status; + + if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { + return Z_STREAM_ERROR; + } + + status = strm.state.status; + if (status !== INIT_STATE && + status !== EXTRA_STATE && + status !== NAME_STATE && + status !== COMMENT_STATE && + status !== HCRC_STATE && + status !== BUSY_STATE && + status !== FINISH_STATE + ) { + return err(strm, Z_STREAM_ERROR); + } + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK; +} + +/* ========================================================================= + * Copy the source state to the destination state + */ +//function deflateCopy(dest, source) { +// +//} + +exports.deflateInit = deflateInit; +exports.deflateInit2 = deflateInit2; +exports.deflateReset = deflateReset; +exports.deflateResetKeep = deflateResetKeep; +exports.deflateSetHeader = deflateSetHeader; +exports.deflate = deflate; +exports.deflateEnd = deflateEnd; +exports.deflateInfo = 'pako deflate (from Nodeca project)'; + +/* Not implemented +exports.deflateBound = deflateBound; +exports.deflateCopy = deflateCopy; +exports.deflateSetDictionary = deflateSetDictionary; +exports.deflateParams = deflateParams; +exports.deflatePending = deflatePending; +exports.deflatePrime = deflatePrime; +exports.deflateTune = deflateTune; +*/ + +},{"../utils/common":3,"./adler32":5,"./crc32":7,"./messages":13,"./trees":14}],9:[function(require,module,exports){ +'use strict'; + + +function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; +} + +module.exports = GZheader; + +},{}],10:[function(require,module,exports){ +'use strict'; + +// See state defs from inflate.js +var BAD = 30; /* got a data error -- remain here until reset */ +var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ + +/* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ +module.exports = function inflate_fast(strm, start) { + var state; + var _in; /* local strm.input */ + var last; /* have enough input while in < last */ + var _out; /* local strm.output */ + var beg; /* inflate()'s initial strm.output */ + var end; /* while out < end, enough space available */ +//#ifdef INFLATE_STRICT + var dmax; /* maximum distance from zlib header */ +//#endif + var wsize; /* window size or zero if not using window */ + var whave; /* valid bytes in the window */ + var wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + var s_window; /* allocated sliding window, if wsize != 0 */ + var hold; /* local strm.hold */ + var bits; /* local strm.bits */ + var lcode; /* local strm.lencode */ + var dcode; /* local strm.distcode */ + var lmask; /* mask for first level of length codes */ + var dmask; /* mask for first level of distance codes */ + var here; /* retrieved table entry */ + var op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + var len; /* match length, unused bytes */ + var dist; /* match distance */ + var from; /* where to copy match from */ + var from_source; + + + var input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); +//#ifdef INFLATE_STRICT + dmax = state.dmax; +//#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); +//#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break top; + } +//#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break top; + } + +// (!) This block is disabled in zlib defailts, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// if (len <= op - whave) { +// do { +// output[_out++] = 0; +// } while (--len); +// continue top; +// } +// len -= op - whave; +// do { +// output[_out++] = 0; +// } while (--op > whave); +// if (op === 0) { +// from = _out - dist; +// do { +// output[_out++] = output[from++]; +// } while (--len); +// continue top; +// } +//#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; +}; + +},{}],11:[function(require,module,exports){ +'use strict'; + + +var utils = require('../utils/common'); +var adler32 = require('./adler32'); +var crc32 = require('./crc32'); +var inflate_fast = require('./inffast'); +var inflate_table = require('./inftrees'); + +var CODES = 0; +var LENS = 1; +var DISTS = 2; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +/* Allowed flush values; see deflate() and inflate() below for details */ +//var Z_NO_FLUSH = 0; +//var Z_PARTIAL_FLUSH = 1; +//var Z_SYNC_FLUSH = 2; +//var Z_FULL_FLUSH = 3; +var Z_FINISH = 4; +var Z_BLOCK = 5; +var Z_TREES = 6; + + +/* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ +var Z_OK = 0; +var Z_STREAM_END = 1; +var Z_NEED_DICT = 2; +//var Z_ERRNO = -1; +var Z_STREAM_ERROR = -2; +var Z_DATA_ERROR = -3; +var Z_MEM_ERROR = -4; +var Z_BUF_ERROR = -5; +//var Z_VERSION_ERROR = -6; + +/* The deflate compression method */ +var Z_DEFLATED = 8; + + +/* STATES ====================================================================*/ +/* ===========================================================================*/ + + +var HEAD = 1; /* i: waiting for magic header */ +var FLAGS = 2; /* i: waiting for method and flags (gzip) */ +var TIME = 3; /* i: waiting for modification time (gzip) */ +var OS = 4; /* i: waiting for extra flags and operating system (gzip) */ +var EXLEN = 5; /* i: waiting for extra length (gzip) */ +var EXTRA = 6; /* i: waiting for extra bytes (gzip) */ +var NAME = 7; /* i: waiting for end of file name (gzip) */ +var COMMENT = 8; /* i: waiting for end of comment (gzip) */ +var HCRC = 9; /* i: waiting for header crc (gzip) */ +var DICTID = 10; /* i: waiting for dictionary check value */ +var DICT = 11; /* waiting for inflateSetDictionary() call */ +var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ +var TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */ +var STORED = 14; /* i: waiting for stored size (length and complement) */ +var COPY_ = 15; /* i/o: same as COPY below, but only first time in */ +var COPY = 16; /* i/o: waiting for input or output to copy stored block */ +var TABLE = 17; /* i: waiting for dynamic block table lengths */ +var LENLENS = 18; /* i: waiting for code length code lengths */ +var CODELENS = 19; /* i: waiting for length/lit and distance code lengths */ +var LEN_ = 20; /* i: same as LEN below, but only first time in */ +var LEN = 21; /* i: waiting for length/lit/eob code */ +var LENEXT = 22; /* i: waiting for length extra bits */ +var DIST = 23; /* i: waiting for distance code */ +var DISTEXT = 24; /* i: waiting for distance extra bits */ +var MATCH = 25; /* o: waiting for output space to copy string */ +var LIT = 26; /* o: waiting for output space to write literal */ +var CHECK = 27; /* i: waiting for 32-bit check value */ +var LENGTH = 28; /* i: waiting for 32-bit length (gzip) */ +var DONE = 29; /* finished check, done -- remain here until reset */ +var BAD = 30; /* got a data error -- remain here until reset */ +var MEM = 31; /* got an inflate() memory error -- remain here until reset */ +var SYNC = 32; /* looking for synchronization bytes to restart inflate() */ + +/* ===========================================================================*/ + + + +var ENOUGH_LENS = 852; +var ENOUGH_DISTS = 592; +//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +var MAX_WBITS = 15; +/* 32K LZ77 window */ +var DEF_WBITS = MAX_WBITS; + + +function zswap32(q) { + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); +} + + +function InflateState() { + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib) */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new utils.Buf16(320); /* temporary storage for code lengths */ + this.work = new utils.Buf16(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ +} + +function inflateResetKeep(strm) { + var state; + + if (!strm || !strm.state) { return Z_STREAM_ERROR; } + state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS); + state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK; +} + +function inflateReset(strm) { + var state; + + if (!strm || !strm.state) { return Z_STREAM_ERROR; } + state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + +} + +function inflateReset2(strm, windowBits) { + var wrap; + var state; + + /* get the state */ + if (!strm || !strm.state) { return Z_STREAM_ERROR; } + state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 1; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); +} + +function inflateInit2(strm, windowBits) { + var ret; + var state; + + if (!strm) { return Z_STREAM_ERROR; } + //strm.msg = Z_NULL; /* in case we return an error */ + + state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.window = null/*Z_NULL*/; + ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK) { + strm.state = null/*Z_NULL*/; + } + return ret; +} + +function inflateInit(strm) { + return inflateInit2(strm, DEF_WBITS); +} + + +/* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ +var virgin = true; + +var lenfix, distfix; // We have no pointers in JS, so keep tables separate + +function fixedtables(state) { + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + var sym; + + lenfix = new utils.Buf32(512); + distfix = new utils.Buf32(32); + + /* literal/length table */ + sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; +} + + +/* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ +function updatewindow(strm, src, end, copy) { + var dist; + var state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new utils.Buf8(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + utils.arraySet(state.window, src, end - copy, dist, state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + utils.arraySet(state.window, src, end - copy, copy, 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; +} + +function inflate(strm, flush) { + var state; + var input, output; // input/output buffers + var next; /* next input INDEX */ + var put; /* next output INDEX */ + var have, left; /* available input and output */ + var hold; /* bit buffer */ + var bits; /* bits in bit buffer */ + var _in, _out; /* save starting available input and output */ + var copy; /* number of stored or match bytes to copy */ + var from; /* where to copy match bytes from */ + var from_source; + var here = 0; /* current decoding table entry */ + var here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //var last; /* parent table entry */ + var last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + var len; /* length to copy for repeats, bits to drop */ + var ret; /* return code */ + var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */ + var opts; + + var n; // temporary var for NEED_BITS + + var order = /* permutation of code lengths */ + [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]; + + + if (!strm || !strm.state || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + state.flags = 0; /* expect zlib header */ + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + else if (len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + state.dmax = 1 << len; + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if (state.flags & 0x0200) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if (state.flags & 0x0200) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more conveniend processing later + state.head.extra = new Array(state.head.extra_len); + } + utils.arraySet( + state.head.extra, + input, + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + copy, + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if (state.flags & 0x0200) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if (state.flags & 0x0200) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + utils.arraySet(output, input, next, copy, put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// +//#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } +//#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inflate_fast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } +//#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +//#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +// (!) This block is disabled in zlib defailts, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// Trace((stderr, "inflate.c too far\n")); +// copy -= state.whave; +// if (copy > state.length) { copy = state.length; } +// if (copy > left) { copy = left; } +// left -= copy; +// state.length -= copy; +// do { +// output[put++] = 0; +// } while (--copy); +// if (state.length === 0) { state.mode = LEN; } +// break; +//#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' insdead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if (_out) { + strm.adler = state.check = + /*UPDATE(state.check, put - _out, _out);*/ + (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR; + break inf_leave; + case MEM: + return Z_MEM_ERROR; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) { + state.mode = MEM; + return Z_MEM_ERROR; + } + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if (state.wrap && _out) { + strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) { + ret = Z_BUF_ERROR; + } + return ret; +} + +function inflateEnd(strm) { + + if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) { + return Z_STREAM_ERROR; + } + + var state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK; +} + +function inflateGetHeader(strm, head) { + var state; + + /* check state */ + if (!strm || !strm.state) { return Z_STREAM_ERROR; } + state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK; +} + + +exports.inflateReset = inflateReset; +exports.inflateReset2 = inflateReset2; +exports.inflateResetKeep = inflateResetKeep; +exports.inflateInit = inflateInit; +exports.inflateInit2 = inflateInit2; +exports.inflate = inflate; +exports.inflateEnd = inflateEnd; +exports.inflateGetHeader = inflateGetHeader; +exports.inflateInfo = 'pako inflate (from Nodeca project)'; + +/* Not implemented +exports.inflateCopy = inflateCopy; +exports.inflateGetDictionary = inflateGetDictionary; +exports.inflateMark = inflateMark; +exports.inflatePrime = inflatePrime; +exports.inflateSetDictionary = inflateSetDictionary; +exports.inflateSync = inflateSync; +exports.inflateSyncPoint = inflateSyncPoint; +exports.inflateUndermine = inflateUndermine; +*/ + +},{"../utils/common":3,"./adler32":5,"./crc32":7,"./inffast":10,"./inftrees":12}],12:[function(require,module,exports){ +'use strict'; + + +var utils = require('../utils/common'); + +var MAXBITS = 15; +var ENOUGH_LENS = 852; +var ENOUGH_DISTS = 592; +//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +var CODES = 0; +var LENS = 1; +var DISTS = 2; + +var lbase = [ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 +]; + +var lext = [ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 +]; + +var dbase = [ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 +]; + +var dext = [ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 +]; + +module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) +{ + var bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + var len = 0; /* a code's length in bits */ + var sym = 0; /* index of code symbols */ + var min = 0, max = 0; /* minimum and maximum code lengths */ + var root = 0; /* number of index bits for root table */ + var curr = 0; /* number of index bits for current table */ + var drop = 0; /* code bits to drop for sub-table */ + var left = 0; /* number of prefix codes available */ + var used = 0; /* code entries in table used */ + var huff = 0; /* Huffman code */ + var incr; /* for incrementing code, index */ + var fill; /* index for replicating entries */ + var low; /* low bits for current root entry */ + var mask; /* mask for low root bits */ + var next; /* next available space in table */ + var base = null; /* base value table to use */ + var base_index = 0; +// var shoextra; /* extra bits table to use */ + var end; /* use base and extra for symbol > end */ + var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + var extra = null; + var extra_index = 0; + + var here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES) { + base = extra = work; /* dummy value--not used */ + end = 19; + + } else if (type === LENS) { + base = lbase; + base_index -= 257; + extra = lext; + extra_index -= 257; + end = 256; + + } else { /* DISTS */ + base = dbase; + extra = dext; + end = -1; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS && used > ENOUGH_LENS) || + (type === DISTS && used > ENOUGH_DISTS)) { + return 1; + } + + var i = 0; + /* process all codes and make table entries */ + for (;;) { + i++; + /* create table entry */ + here_bits = len - drop; + if (work[sym] < end) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] > end) { + here_op = extra[extra_index + work[sym]]; + here_val = base[base_index + work[sym]]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS && used > ENOUGH_LENS) || + (type === DISTS && used > ENOUGH_DISTS)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; +}; + +},{"../utils/common":3}],13:[function(require,module,exports){ +'use strict'; + +module.exports = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ +}; + +},{}],14:[function(require,module,exports){ +'use strict'; + + +var utils = require('../utils/common'); + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +//var Z_FILTERED = 1; +//var Z_HUFFMAN_ONLY = 2; +//var Z_RLE = 3; +var Z_FIXED = 4; +//var Z_DEFAULT_STRATEGY = 0; + +/* Possible values of the data_type field (though see inflate()) */ +var Z_BINARY = 0; +var Z_TEXT = 1; +//var Z_ASCII = 1; // = Z_TEXT +var Z_UNKNOWN = 2; + +/*============================================================================*/ + + +function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } + +// From zutil.h + +var STORED_BLOCK = 0; +var STATIC_TREES = 1; +var DYN_TREES = 2; +/* The three kinds of block type */ + +var MIN_MATCH = 3; +var MAX_MATCH = 258; +/* The minimum and maximum match lengths */ + +// From deflate.h +/* =========================================================================== + * Internal compression state. + */ + +var LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ + +var LITERALS = 256; +/* number of literal bytes 0..255 */ + +var L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ + +var D_CODES = 30; +/* number of distance codes */ + +var BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ + +var HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ + +var MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +var Buf_size = 16; +/* size of bit buffer in bi_buf */ + + +/* =========================================================================== + * Constants + */ + +var MAX_BL_BITS = 7; +/* Bit length codes must not exceed MAX_BL_BITS bits */ + +var END_BLOCK = 256; +/* end of block literal code */ + +var REP_3_6 = 16; +/* repeat previous bit length 3-6 times (2 bits of repeat count) */ + +var REPZ_3_10 = 17; +/* repeat a zero length 3-10 times (3 bits of repeat count) */ + +var REPZ_11_138 = 18; +/* repeat a zero length 11-138 times (7 bits of repeat count) */ + +/* eslint-disable comma-spacing,array-bracket-spacing */ +var extra_lbits = /* extra bits for each length code */ + [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]; + +var extra_dbits = /* extra bits for each distance code */ + [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]; + +var extra_blbits = /* extra bits for each bit length code */ + [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]; + +var bl_order = + [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]; +/* eslint-enable comma-spacing,array-bracket-spacing */ + +/* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + +/* =========================================================================== + * Local data. These are initialized only once. + */ + +// We pre-fill arrays with 0 to avoid uninitialized gaps + +var DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + +// !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1 +var static_ltree = new Array((L_CODES + 2) * 2); +zero(static_ltree); +/* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + +var static_dtree = new Array(D_CODES * 2); +zero(static_dtree); +/* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + +var _dist_code = new Array(DIST_CODE_LEN); +zero(_dist_code); +/* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + +var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1); +zero(_length_code); +/* length code for each normalized match length (0 == MIN_MATCH) */ + +var base_length = new Array(LENGTH_CODES); +zero(base_length); +/* First normalized length for each code (0 = MIN_MATCH) */ + +var base_dist = new Array(D_CODES); +zero(base_dist); +/* First normalized distance for each code (0 = distance of 1) */ + + +function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; +} + + +var static_l_desc; +var static_d_desc; +var static_bl_desc; + + +function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ +} + + + +function d_code(dist) { + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; +} + + +/* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ +function put_short(s, w) { +// put_byte(s, (uch)((w) & 0xff)); +// put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; +} + + +/* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ +function send_bits(s, value, length) { + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } +} + + +function send_code(s, c, tree) { + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); +} + + +/* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ +function bi_reverse(code, len) { + var res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; +} + + +/* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ +function bi_flush(s) { + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } +} + + +/* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ +function gen_bitlen(s, desc) +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ +{ + var tree = desc.dyn_tree; + var max_code = desc.max_code; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var extra = desc.stat_desc.extra_bits; + var base = desc.stat_desc.extra_base; + var max_length = desc.stat_desc.max_length; + var h; /* heap index */ + var n, m; /* iterate over the tree elements */ + var bits; /* bit length */ + var xbits; /* extra bits */ + var f; /* frequency */ + var overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Trace((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } +} + + +/* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ +function gen_codes(tree, max_code, bl_count) +// ct_data *tree; /* the tree to decorate */ +// int max_code; /* largest code with non zero frequency */ +// ushf *bl_count; /* number of codes at each bit length */ +{ + var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */ + var code = 0; /* running code value */ + var bits; /* bit index */ + var n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS; bits++) { + next_code[bits] = code = (code + bl_count[bits - 1]) << 1; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS); + + //static_init_done = true; +} + + +/* =========================================================================== + * Initialize a new block. + */ +function init_block(s) { + var n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.last_lit = s.matches = 0; +} + + +/* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ +function bi_windup(s) +{ + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; +} + +/* =========================================================================== + * Copy a stored block, storing first the length and its + * one's complement if requested. + */ +function copy_block(s, buf, len, header) +//DeflateState *s; +//charf *buf; /* the input data */ +//unsigned len; /* its length */ +//int header; /* true if block header must be written */ +{ + bi_windup(s); /* align on byte boundary */ + + if (header) { + put_short(s, len); + put_short(s, ~len); + } +// while (len--) { +// put_byte(s, *buf++); +// } + utils.arraySet(s.pending_buf, s.window, buf, len, s.pending); + s.pending += len; +} + +/* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ +function smaller(tree, n, m, depth) { + var _n2 = n * 2; + var _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); +} + +/* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ +function pqdownheap(s, tree, k) +// deflate_state *s; +// ct_data *tree; /* the tree to restore */ +// int k; /* node to move down */ +{ + var v = s.heap[k]; + var j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; +} + + +// inlined manually +// var SMALLEST = 1; + +/* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ +function compress_block(s, ltree, dtree) +// deflate_state *s; +// const ct_data *ltree; /* literal tree */ +// const ct_data *dtree; /* distance tree */ +{ + var dist; /* distance of matched string */ + var lc; /* match length or unmatched char (if dist == 0) */ + var lx = 0; /* running index in l_buf */ + var code; /* the code to send */ + var extra; /* number of extra bits to send */ + + if (s.last_lit !== 0) { + do { + dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]); + lc = s.pending_buf[s.l_buf + lx]; + lx++; + + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ + //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, + // "pendingBuf overflow"); + + } while (lx < s.last_lit); + } + + send_code(s, END_BLOCK, ltree); +} + + +/* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ +function build_tree(s, desc) +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ +{ + var tree = desc.dyn_tree; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var elems = desc.stat_desc.elems; + var n, m; /* iterate over heap elements */ + var max_code = -1; /* largest code with non zero frequency */ + var node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); +} + + +/* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ +function scan_tree(s, tree, max_code) +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ +{ + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +} + + +/* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ +function send_tree(s, tree, max_code) +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ +{ + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +} + + +/* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ +function build_bl_tree(s) { + var max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; +} + + +/* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ +function send_all_trees(s, lcodes, dcodes, blcodes) +// deflate_state *s; +// int lcodes, dcodes, blcodes; /* number of codes for each tree */ +{ + var rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); +} + + +/* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "black list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ +function detect_data_type(s) { + /* black_mask is the bit mask of black-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + var black_mask = 0xf3ffc07f; + var n; + + /* Check for non-textual ("black-listed") bytes. */ + for (n = 0; n <= 31; n++, black_mask >>>= 1) { + if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("white-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "black-listed" or "white-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; +} + + +var static_init_done = false; + +/* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ +function _tr_init(s) +{ + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); +} + + +/* =========================================================================== + * Send a stored block + */ +function _tr_stored_block(s, buf, stored_len, last) +//DeflateState *s; +//charf *buf; /* input block */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ +{ + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + copy_block(s, buf, stored_len, true); /* with header */ +} + + +/* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ +function _tr_align(s) { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); +} + + +/* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and output the encoded block to the zip file. + */ +function _tr_flush_block(s, buf, stored_len, last) +//DeflateState *s; +//charf *buf; /* input block, or NULL if too old */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ +{ + var opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + var max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->last_lit)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); +} + +/* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ +function _tr_tally(s, dist, lc) +// deflate_state *s; +// unsigned dist; /* distance of matched string */ +// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ +{ + //var out_length, in_length, dcode; + + s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff; + s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff; + + s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff; + s.last_lit++; + + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + +// (!) This block is disabled in zlib defailts, +// don't enable it for binary compatibility + +//#ifdef TRUNCATE_BLOCK +// /* Try to guess if it is profitable to stop the current block here */ +// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) { +// /* Compute an upper bound for the compressed length */ +// out_length = s.last_lit*8; +// in_length = s.strstart - s.block_start; +// +// for (dcode = 0; dcode < D_CODES; dcode++) { +// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]); +// } +// out_length >>>= 3; +// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", +// // s->last_lit, in_length, out_length, +// // 100L - out_length*100L/in_length)); +// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) { +// return true; +// } +// } +//#endif + + return (s.last_lit === s.lit_bufsize - 1); + /* We avoid equality with lit_bufsize because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ +} + +exports._tr_init = _tr_init; +exports._tr_stored_block = _tr_stored_block; +exports._tr_flush_block = _tr_flush_block; +exports._tr_tally = _tr_tally; +exports._tr_align = _tr_align; + +},{"../utils/common":3}],15:[function(require,module,exports){ +'use strict'; + + +function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; +} + +module.exports = ZStream; + +},{}],"/":[function(require,module,exports){ +// Top level file is just a mixin of submodules & constants +'use strict'; + +var assign = require('./lib/utils/common').assign; + +var deflate = require('./lib/deflate'); +var inflate = require('./lib/inflate'); +var constants = require('./lib/zlib/constants'); + +var pako = {}; + +assign(pako, deflate, inflate, constants); + +module.exports = pako; + +},{"./lib/deflate":1,"./lib/inflate":2,"./lib/utils/common":3,"./lib/zlib/constants":6}]},{},[])("/") +}); diff --git a/lib/zpl-image/zpl-image.html b/lib/zpl-image/zpl-image.html new file mode 100644 index 0000000..db157e2 --- /dev/null +++ b/lib/zpl-image/zpl-image.html @@ -0,0 +1,333 @@ + + + + +Image to ZPL + + + + + + + +
Image to ZPL
+
+
+
Drop image here
+
+ +
Image Rotation + + + + + + +
Black Threshold + + 1..99 + +
ZPL Format + + +
+
+ + +
+ + +
+
+ + +
+ + + diff --git a/lib/zpl-image/zpl-image.js b/lib/zpl-image/zpl-image.js new file mode 100644 index 0000000..787015a --- /dev/null +++ b/lib/zpl-image/zpl-image.js @@ -0,0 +1,444 @@ + +(function (root, factory) { + if (typeof define === 'function' && define.amd) { + define([], factory); + } else if (typeof module === 'object' && module.exports) { + module.exports = factory(); + } else { + // generic browser usage + let ex = factory(); + for (let id in ex) { + root[id] = ex[id]; + } + } +}(typeof self !== 'undefined' ? self : this, function () { + +const zlib = typeof process == 'object' && typeof process.release == 'object' && + process.release.name == 'node' ? require('zlib') : null; + +const hexmap = (()=> { + let arr = Array(256); + for (let i = 0; i < 16; i++) { + arr[i] = '0' + i.toString(16); + } + for (let i = 16; i < 256; i++) { + arr[i] = i.toString(16); + } + return arr; +})(); + +// DOM-specialized version for browsers. +function imageToZ64(img, opts) { + // Draw the image to a temp canvas so we can access its RGBA data + let cvs = document.createElement('canvas'); + let ctx = cvs.getContext('2d'); + + cvs.width = +img.width || img.offsetWidth; + cvs.height = +img.height || img.offsetHeight; + ctx.imageSmoothingQuality = 'high'; // in case canvas needs to scale image + ctx.drawImage(img, 0, 0, cvs.width, cvs.height); + + let pixels = ctx.getImageData(0, 0, cvs.width, cvs.height); + return rgbaToZ64(pixels.data, pixels.width, opts); +} + +// DOM-specialized version for browsers. +function imageToACS(img, opts) { + // Draw the image to a temp canvas so we can access its RGBA data + let cvs = document.createElement('canvas'); + let ctx = cvs.getContext('2d'); + + cvs.width = +img.width || img.offsetWidth; + cvs.height = +img.height || img.offsetHeight; + ctx.imageSmoothingQuality = 'high'; // in case canvas needs to scale image + ctx.drawImage(img, 0, 0, cvs.width, cvs.height); + + let pixels = ctx.getImageData(0, 0, cvs.width, cvs.height); + return rgbaToACS(pixels.data, pixels.width, opts); +} + +// Uses zlib on node.js, pako.js in the browser. +// +// `rgba` can be a Uint8Array or Buffer, or an Array of integers between 0 and 255. +// `width` is the image width, in pixels +// `opts` is an options object: +// `black` is the blackness percent between 1..99, default 50. +// `rotate` is one of: +// 'N' no rotation (default) +// 'L' rotate 90 degrees counter-clockwise +// 'R' rotate 90 degrees clockwise +// 'I' rotate 180 degrees (inverted) +// 'B' same as 'L' +function rgbaToZ64(rgba, width, opts) { + opts = opts || {}; + width = width|0; + if (!width || width < 0) { + throw new Error('Invalid width'); + } + let height = ~~(rgba.length / width / 4); + + // Create a monochome image, cropped to remove padding. + // The return is a Uint8Array with extra properties width and height. + let mono = monochrome(rgba, width, height, +opts.black || 50, opts.notrim); + + let buf; + switch (opts.rotate) { + case 'R': buf = right(mono); break; + case 'B': + case 'L': buf = left(mono); break; + case 'I': buf = invert(mono); break; + default: buf = normal(mono); break; + } + + // Compress and base64 encode + let imgw = buf.width; + let imgh = buf.height; + let rowl = ~~((imgw + 7) / 8); + let b64; + if (zlib) { + b64 = zlib.deflateSync(buf).toString('base64'); + } else { + b64 = u8tob64(pako.deflate(buf)); + } + + // Example usage of the return value `rv`: + // '^GFA,' + rv.length + ',' + rv.length + ',' + rv.rowlen + ',' + rv.z64 + return { + length: buf.length, // uncompressed number of bytes + rowlen: rowl, // number of packed bytes per row + width: imgw, // rotated image width in pixels + height: imgh, // rotated image height in pixels + z64: ':Z64:' + b64 + ':' + crc16(b64), + }; +} + +// Implements the Alternative Data Compression Scheme as described in the ref manual. +// +// `rgba` can be a Uint8Array or Buffer, or an Array of integers between 0 and 255. +// `width` is the image width, in pixels +// `opts` is an options object: +// `black` is the blackness percent between 1..99, default 50. +// `rotate` is one of: +// 'N' no rotation (default) +// 'L' rotate 90 degrees counter-clockwise +// 'R' rotate 90 degrees clockwise +// 'I' rotate 180 degrees (inverted) +// 'B' same as 'L' +function rgbaToACS(rgba, width, opts) { + opts = opts || {}; + width = width|0; + if (!width || width < 0) { + throw new Error('Invalid width'); + } + let height = ~~(rgba.length / width / 4); + + // Create a monochome image, cropped to remove padding. + // The return is a Uint8Array with extra properties width and height. + let mono = monochrome(rgba, width, height, +opts.black || 50, opts.notrim); + + let buf; + switch (opts.rotate) { + case 'R': buf = right(mono); break; + case 'B': + case 'L': buf = left(mono); break; + case 'I': buf = invert(mono); break; + default: buf = normal(mono); break; + } + + // Encode in hex and apply the "Alternative Data Compression Scheme" + // + // G H I J K L M N O P Q R S T U V W X Y + // 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 + // + // g h i j k l m n o p q r s t u v w x y z + // 20 40 60 80 100 120 140 160 180 200 220 240 260 280 300 320 340 360 380 400 + // + let imgw = buf.width; + let imgh = buf.height; + let rowl = ~~((imgw + 7) / 8); + + let hex = ''; + for (let i = 0, l = buf.length; i < l; i++) { + hex += hexmap[buf[i]]; + } + let acs = ''; + let re = /([0-9a-fA-F])\1{2,}/g; + let match = re.exec(hex); + let offset = 0; + while (match) { + acs += hex.substring(offset, match.index); + let l = match[0].length; + while (l >= 400) { + acs += 'z'; + l -= 400; + } + if (l >= 20) { + acs += '_ghijklmnopqrstuvwxy'[((l / 20)|0)]; + l = l % 20; + } + if (l) { + acs += '_GHIJKLMNOPQRSTUVWXY'[l]; + } + acs += match[1]; + offset = re.lastIndex; + match = re.exec(hex); + } + acs += hex.substr(offset); + + // Example usage of the return value `rv`: + // '^GFA,' + rv.length + ',' + rv.length + ',' + rv.rowlen + ',' + rv.acs + return { + length: buf.length, // uncompressed number of bytes + rowlen: rowl, // number of packed bytes per row + width: imgw, // rotated image width in pixels + height: imgh, // rotated image height in pixels + acs: acs, + }; +} + +// Normal, unrotated case +function normal(mono) { + let width = mono.width; + let height = mono.height; + + let buf = new Uint8Array(~~((width + 7) / 8) * height); + let idx = 0; // index into buf + let byte = 0; // current byte of image data + let bitx = 0; // bit index + for (let i = 0, n = mono.length; i < n; i++) { + byte |= mono[i] << (7 - (bitx++ & 7)); + + if (bitx == width || !(bitx & 7)) { + buf[idx++] = byte; + byte = 0; + if (bitx == width) { + bitx = 0; + } + } + } + buf.width = width; + buf.height = height; + return buf; +} + +// Inverted 180 degrees +function invert(mono) { + let width = mono.width; + let height = mono.height; + + let buf = new Uint8Array(~~((width + 7) / 8) * height); + let idx = 0; // index into buf + let byte = 0; // current byte of image data + let bitx = 0; // bit index + for (let i = mono.length-1; i >= 0; i--) { + byte |= mono[i] << (7 - (bitx++ & 7)); + + if (bitx == width || !(bitx & 7)) { + buf[idx++] = byte; + byte = 0; + if (bitx == width) { + bitx = 0; + } + } + } + buf.width = width; + buf.height = height; + return buf; +} + +// Rotate 90 degrees counter-clockwise +function left(mono) { + let width = mono.width; + let height = mono.height; + + let buf = new Uint8Array(~~((height + 7) / 8) * width); + let idx = 0; // index into buf + let byte = 0; // current byte of image data + for (let x = width - 1; x >= 0; x--) { + let bitx = 0; // bit index + for (let y = 0; y < height; y++) { + byte |= mono[y * width + x] << (7 - (bitx++ & 7)); + + if (y == height-1 || !(bitx & 7)) { + buf[idx++] = byte; + byte = 0; + } + } + } + buf.width = height; + buf.height = width; + return buf; +} + + +// Rotate 90 degrees clockwise +function right(mono) { + let width = mono.width; + let height = mono.height; + + let buf = new Uint8Array(~~((height + 7) / 8) * width); + let idx = 0; // index into buf + let byte = 0; // current byte of image data + for (let x = 0; x < width; x++) { + let bitx = 0; // bit index + for (let y = height - 1; y >= 0; y--) { + byte |= mono[y * width + x] << (7 - (bitx++ & 7)); + + if (y == 0 || !(bitx & 7)) { + buf[idx++] = byte; + byte = 0; + } + } + } + buf.width = height; + buf.height = width; + return buf; +} + +// Convert the RGBA to monochrome, 1-bit-per-byte. Crops +// empty space around the edges of the image if !notrim. +function monochrome(rgba, width, height, black, notrim) { + // Convert black from percent to 0..255 value + black = 255 * black / 100; + + let minx, maxx, miny, maxy; + if (notrim) { + minx = miny = 0; + maxx = width-1; + maxy = height-1; + } else { + // Run through the image and determine bounding box + maxx = maxy = 0; + minx = width; + miny = height; + let x = 0, y = 0; + for (let i = 0, n = width * height * 4; i < n; i += 4) { + // Alpha blend with white. + let a = rgba[i+3] / 255; + let r = rgba[i] * .3 * a + 255 * (1 - a); + let g = rgba[i+1] * .59 * a + 255 * (1 - a); + let b = rgba[i+2] * .11 * a + 255 * (1 - a); + let gray = r + g + b; + + if (gray <= black) { + if (minx > x) minx = x; + if (miny > y) miny = y; + if (maxx < x) maxx = x; + if (maxy < y) maxy = y; + } + if (++x == width) { + x = 0; + y++; + } + } + } + + // One more time through the data, this time we create the cropped image. + let cx = maxx - minx + 1; + let cy = maxy - miny + 1; + let buf = new Uint8Array(cx * cy); + let idx = 0; + for (y = miny; y <= maxy; y++) { + let i = (y * width + minx) * 4; + for (x = minx; x <= maxx; x++) { + // Alpha blend with white. + let a = rgba[i+3] / 255; + let r = rgba[i] * .3 * a + 255 * (1 - a); + let g = rgba[i+1] * .59 * a + 255 * (1 - a); + let b = rgba[i+2] * .11 * a + 255 * (1 - a); + let gray = r + g + b; + + buf[idx++] = gray <= black ? 1 : 0; + i += 4; + } + } + + // Return the monochrome image + buf.width = cx; + buf.height = cy; + return buf; +} + +// Cannot use btoa() with Uint8Arrays. Used only by the browser. +function u8tob64(a) { + let s = ''; + let i = 0; + for (let l = a.length & 0xfffffff0; i < l; i += 16) { + s += String.fromCharCode(a[i],a[i+1],a[i+2],a[i+3],a[i+4],a[i+5], + a[i+6],a[i+7],a[i+8],a[i+9],a[i+10], + a[i+11],a[i+12],a[i+13],a[i+14],a[i+15]); + } + while (i < a.length) { + s += String.fromCharCode(a[i++]); + } + return btoa(s); +} + +// CRC16 used by zebra +const crcTable = [ + 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, + 0x60c6, 0x70e7, 0x8108, 0x9129, 0xa14a, 0xb16b, + 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef, 0x1231, 0x0210, + 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6, + 0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, + 0xf3ff, 0xe3de, 0x2462, 0x3443, 0x0420, 0x1401, + 0x64e6, 0x74c7, 0x44a4, 0x5485, 0xa56a, 0xb54b, + 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d, + 0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, + 0x5695, 0x46b4, 0xb75b, 0xa77a, 0x9719, 0x8738, + 0xf7df, 0xe7fe, 0xd79d, 0xc7bc, 0x48c4, 0x58e5, + 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823, + 0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, + 0xa90a, 0xb92b, 0x5af5, 0x4ad4, 0x7ab7, 0x6a96, + 0x1a71, 0x0a50, 0x3a33, 0x2a12, 0xdbfd, 0xcbdc, + 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a, + 0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, + 0x0c60, 0x1c41, 0xedae, 0xfd8f, 0xcdec, 0xddcd, + 0xad2a, 0xbd0b, 0x8d68, 0x9d49, 0x7e97, 0x6eb6, + 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70, + 0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, + 0x9f59, 0x8f78, 0x9188, 0x81a9, 0xb1ca, 0xa1eb, + 0xd10c, 0xc12d, 0xf14e, 0xe16f, 0x1080, 0x00a1, + 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067, + 0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, + 0xe37f, 0xf35e, 0x02b1, 0x1290, 0x22f3, 0x32d2, + 0x4235, 0x5214, 0x6277, 0x7256, 0xb5ea, 0xa5cb, + 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d, + 0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, + 0x5424, 0x4405, 0xa7db, 0xb7fa, 0x8799, 0x97b8, + 0xe75f, 0xf77e, 0xc71d, 0xd73c, 0x26d3, 0x36f2, + 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634, + 0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, + 0xb98a, 0xa9ab, 0x5844, 0x4865, 0x7806, 0x6827, + 0x18c0, 0x08e1, 0x3882, 0x28a3, 0xcb7d, 0xdb5c, + 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a, + 0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, + 0x2ab3, 0x3a92, 0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, + 0xbdaa, 0xad8b, 0x9de8, 0x8dc9, 0x7c26, 0x6c07, + 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1, + 0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, + 0x8fd9, 0x9ff8, 0x6e17, 0x7e36, 0x4e55, 0x5e74, + 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0 +]; + +function crc16(s) { + // This is not an accumlating crc routine. Normally, the acc is intialized to + // 0xffff then inverted on each call. We just start with 0. + let crc = 0; + let j, i; + + for (i = 0; i < s.length; i++) { + c = s.charCodeAt(i); + if (c > 255) { + throw new RangeError(); + } + j = (c ^ (crc >> 8)) & 0xFF; + crc = crcTable[j] ^ (crc << 8); + } + + crc = (crc & 0xffff).toString(16).toLowerCase(); + return '0000'.substr(crc.length) + crc; +} + +return zlib ? { rgbaToZ64, rgbaToACS } : { rgbaToZ64, rgbaToACS, imageToZ64, imageToACS }; +})); diff --git a/sticker-print.js b/sticker-print.js new file mode 100644 index 0000000..cbe2c9b --- /dev/null +++ b/sticker-print.js @@ -0,0 +1,109 @@ +/* + +^XA +^FX Template label 70x35mm + +^FX --------- Agenzia Entrata logo +^FO20,85^GFA,2409,2409,33,,:::::I01LF8hL0806,I07LF8hK08812,I0MFChK0140B8,I0MFChI02384045E,001MFEhI0275802058,001MFEhI0AC6I0C44,001MFEhI0BFC004246,I0NFhH01768I0189,I0NFhI064K0C9,I07MF8hG0ACCK0E7C,J0MF8gI07V01B48K0422,L07JFCgI0FV02DDL0691,L0KFCgI0FW0EBI0800141,L0KFCgI0FV04FAI08001378,K01FI07EhG0FAL0102,K018J0Eh08F2I04I019,M03FE03J0FEF80FC03EFC03FFE03F8007F8P01E2L01414,L03IFEJ01IFC3FF03FFE03FFE07F801FFCP056O056,K01KFCI03IFC7FF83IF03FFE07F801FFEP01C5L01C42,K07LFI07C3F0F87C1F8F03FFE03F800E0FP0398M0648,K0MF800781E1E01E0F078387C0078J0FP03980041I0268,J03MFE00F00E1E01E0E07818F80078003FFP02B003C0E0017A,J07NF00F00E1IFE0E07801EI07800IFP03A08K0813C,J0OF80F00E1IFE0E07803CI07801IFP0D404J0100BC,I01OFC0F00E1IFE0E078078I07803E0FP0F4M0107C,I03OFC0701E1EJ0E0780F0E00780380FP0F8008L028,I03IF800IFE0783E0F00C1E0781F0E00780381FP0F0404001I039,I07FFCI01IF03FFE0IFE3F9FC3FFE0IFC3IFCO05060300200A91,I0IF8J0IF03FFE07FFE7F9FE3FFE0IFE3IFCN0130E0100201011,I0IFK07FF80FFE03FFC3F8FC3FFE0IFC1IFCO0B1B0200201511,001FFEK03FF8038E007CV038Q031BJ020141D,001FFCK01FFCI0EgS07B2M0D73,001FF8L0FFC001EgS03B1001CI0CCA,001QFC0FFEgS03F1003210104A,003QFC0FFCgR011F3J080124A,003QFE0FF8gS05FE01J0129,003QFE07CgT01EC0400180744,003QFEgX0FCM06D4,003QFEgW04ECM0DB,003QFEP0FU038O03ECM0BA8,003BPFEP0FU03CO01F402J01E9,003BPFEP0FU03CP0FAL017E,0033PFEP0FU03CP07AM058,0013PFEP0FU03CP03CM0E4,I03FCR01F3F003IF007E3F007F801IFC007F8I04DL034C,I03FCL07FF8003IFC07IF80FE7F83FFE03IFE01FFEI06F84I08089C,I03FCL03FF8003IFE0JF81JFC3IF03IFE03IF006241CI019804,00C3FFL03FFC003IFE07IF80JFC3IF01IFC07IF80021BCI01208,00C3FF8K03FFCI0FC1F00FJ01FE38I0F803CI07C0FC02605C004BC082,01E3FFEJ03IFCI0780F00FJ01FCK07803CI0F803C0320325IF001A,01E3IFE00JFEEI0700F00FJ01FJ07FF803CI0F003C0E881804870452,1FF1PFEFF00700F00FJ01EI01IF803CI0JFE03F400509818E4,7FF8PFE7F80700F00FJ01EI03IF803CI0JFE00780318604608,7FFCPFE7F80700F00FJ01EI07IF803CI0JFE014BDI26B433,IFE3OFC7FC0700F00FJ01EI0FC07803CI0FL049DA0D81404,JF1OFCFFC0700F00FJ01EI0F007803CI0FL021C0FEF0018,JF8OF1FFC0F00F00F01E01EI0F01F803C078FC01CI081E606FF6,JFE3MFC3FFC1FC1F80IFE0IFC0JFE03IF87IFEI078DC032,7JF0LFC1IF83FE3FC07FFE1IFE07JF03IF83IFEJ013001B8,7JFE1JF81JF83FE7FC03FFC1IFE03JF01IF01IFCJ03FI0F8,1KF8J03JFE01FC3FC01FE01IFC01FE7C007F8007FEL0E,,:::::^FS + +^FX --------- QR Code +^FO300,5 +^BQN,2,5,M,7 +^FDQA, +https://www.zebra.com/content/dam/zebra_new_ia/en-us/manuals/printers/common/programming/zpl-zbi2-pm-en.pdf +^FS + +^FX --------- Company name +^CF0,30 +^FO20,15^FD +Vandelay Industries +^FS + +^FX --------- External MSID +^CFA,20 +^FO20,55^FD +ACS: EXT-MSID +^FS + +^FX --------- Machine Model +^CFA,20 +^FO20,180^FD +Model XL-123 +^FS + +^FX --------- MSID label +^CFA,20 +^FO20,210^FD +ID ADE: +^FS + +^FX --------- MSID, max 22 chars +^CFA,20 +^FO20,240^FD +1234567890123456789012 +^FS + +^XZ + +*/ + +const TEMPLATES = { + "sticker-70x35": { + name: "Sticker 70x35mm", + template: ` + ^XA + ^FX Template label 70x35mm + + ^FX --------- Agenzia Entrata logo + ^FO20,85^GFA,2409,2409,33,,:::::I01LF8hL0806,I07LF8hK08812,I0MFChK0140B8,I0MFChI02384045E,001MFEhI0275802058,001MFEhI0AC6I0C44,001MFEhI0BFC004246,I0NFhH01768I0189,I0NFhI064K0C9,I07MF8hG0ACCK0E7C,J0MF8gI07V01B48K0422,L07JFCgI0FV02DDL0691,L0KFCgI0FW0EBI0800141,L0KFCgI0FV04FAI08001378,K01FI07EhG0FAL0102,K018J0Eh08F2I04I019,M03FE03J0FEF80FC03EFC03FFE03F8007F8P01E2L01414,L03IFEJ01IFC3FF03FFE03FFE07F801FFCP056O056,K01KFCI03IFC7FF83IF03FFE07F801FFEP01C5L01C42,K07LFI07C3F0F87C1F8F03FFE03F800E0FP0398M0648,K0MF800781E1E01E0F078387C0078J0FP03980041I0268,J03MFE00F00E1E01E0E07818F80078003FFP02B003C0E0017A,J07NF00F00E1IFE0E07801EI07800IFP03A08K0813C,J0OF80F00E1IFE0E07803CI07801IFP0D404J0100BC,I01OFC0F00E1IFE0E078078I07803E0FP0F4M0107C,I03OFC0701E1EJ0E0780F0E00780380FP0F8008L028,I03IF800IFE0783E0F00C1E0781F0E00780381FP0F0404001I039,I07FFCI01IF03FFE0IFE3F9FC3FFE0IFC3IFCO05060300200A91,I0IF8J0IF03FFE07FFE7F9FE3FFE0IFE3IFCN0130E0100201011,I0IFK07FF80FFE03FFC3F8FC3FFE0IFC1IFCO0B1B0200201511,001FFEK03FF8038E007CV038Q031BJ020141D,001FFCK01FFCI0EgS07B2M0D73,001FF8L0FFC001EgS03B1001CI0CCA,001QFC0FFEgS03F1003210104A,003QFC0FFCgR011F3J080124A,003QFE0FF8gS05FE01J0129,003QFE07CgT01EC0400180744,003QFEgX0FCM06D4,003QFEgW04ECM0DB,003QFEP0FU038O03ECM0BA8,003BPFEP0FU03CO01F402J01E9,003BPFEP0FU03CP0FAL017E,0033PFEP0FU03CP07AM058,0013PFEP0FU03CP03CM0E4,I03FCR01F3F003IF007E3F007F801IFC007F8I04DL034C,I03FCL07FF8003IFC07IF80FE7F83FFE03IFE01FFEI06F84I08089C,I03FCL03FF8003IFE0JF81JFC3IF03IFE03IF006241CI019804,00C3FFL03FFC003IFE07IF80JFC3IF01IFC07IF80021BCI01208,00C3FF8K03FFCI0FC1F00FJ01FE38I0F803CI07C0FC02605C004BC082,01E3FFEJ03IFCI0780F00FJ01FCK07803CI0F803C0320325IF001A,01E3IFE00JFEEI0700F00FJ01FJ07FF803CI0F003C0E881804870452,1FF1PFEFF00700F00FJ01EI01IF803CI0JFE03F400509818E4,7FF8PFE7F80700F00FJ01EI03IF803CI0JFE00780318604608,7FFCPFE7F80700F00FJ01EI07IF803CI0JFE014BDI26B433,IFE3OFC7FC0700F00FJ01EI0FC07803CI0FL049DA0D81404,JF1OFCFFC0700F00FJ01EI0F007803CI0FL021C0FEF0018,JF8OF1FFC0F00F00F01E01EI0F01F803C078FC01CI081E606FF6,JFE3MFC3FFC1FC1F80IFE0IFC0JFE03IF87IFEI078DC032,7JF0LFC1IF83FE3FC07FFE1IFE07JF03IF83IFEJ013001B8,7JFE1JF81JF83FE7FC03FFC1IFE03JF01IF01IFCJ03FI0F8,1KF8J03JFE01FC3FC01FE01IFC01FE7C007F8007FEL0E,,:::::^FS + + ^FX --------- QR Code + ^FO300,5 + ^BQN,2,5,M,7 + ^FDQA,{qrCodeUrl}^FS + + ^FX --------- Company name + ^CF0,30 + ^FO20,15^FD{companyName}^FS + + ^FX --------- External MSID + ^CFA,20 + ^FO20,55^FDACS: {externalMasterSystemId}^FS + + ^FX --------- Machine Model + ^CFA,20 + ^FO20,180^FD{machineModel}^FS + + ^FX --------- MSID label + ^CFA,20 + ^FO20,210^FDID ADE:^FS + + ^FX --------- MSID, max 22 chars + ^CFA,20 + ^FO20,240^FD{masterSystemId}^FS + + ^XZ + `, + }, +}; + +function createInternalStickerZPL(template, content) { + return template + .replace("{qrCodeUrl}", content.qrCodeUrl) + .replace("{companyName}", content.companyName) + .replace("{machineModel}", content.machineModel) + .replace("{masterSystemId}", content.masterSystemId) + .replace("{externalMasterSystemId}", content.externalMasterSystemId); +} + +function imageToGRF() {} + +const internalTicketZPL = createInternalStickerZPL(TEMPLATES["sticker-70x35"].template, { + qrCodeUrl: "https://en.wikipedia.org/wiki/Zebra_Programming_Language", + companyName: "Vandelay Industries", + machineModel: "Model XL-123", + masterSystemId: "master-system-id", + externalMasterSystemId: "ext-msid", +}); + +console.log(internalTicketZPL);