From 7f3249a23770fd4da981c2ecb1126da97e9b4ca5 Mon Sep 17 00:00:00 2001 From: Mendes Date: Wed, 21 Sep 2022 14:39:59 +0200 Subject: [PATCH] New version of the algorithm that calculate the layout. It takes as paramters the replication factor and the zone redundancy, computes the largest partition size reachable with these constraints, and among the possible assignation with this partition size, it computes the one that moves the least number of partitions compared to the previous assignation. This computation uses graph algorithms defined in graph_algo.rs --- doc/optimal_layout_report/optimal_layout.pdf | Bin 395187 -> 395308 bytes doc/optimal_layout_report/optimal_layout.tex | 17 +- src/rpc/graph_algo.rs | 440 +++++++++++ src/rpc/layout.rs | 779 +++++++++++-------- src/rpc/lib.rs | 2 + src/rpc/ring.rs | 1 + src/rpc/system.rs | 5 +- src/util/bipartite.rs | 363 --------- src/util/lib.rs | 1 - 9 files changed, 918 insertions(+), 690 deletions(-) create mode 100644 src/rpc/graph_algo.rs delete mode 100644 src/util/bipartite.rs diff --git a/doc/optimal_layout_report/optimal_layout.pdf b/doc/optimal_layout_report/optimal_layout.pdf index c85803e8991820e11dbb33113385028141661b8e..0af34161977e3692da9e9975876bbaece947e311 100644 GIT binary patch delta 36336 zcmV)HK)t`Sj~J|w7_b-tf2IB#Hquxn8yPFb3JvVb2yGlG+)5=y3IcT|bP^QG%~ncf z<9{|AE#skUL5z&|=N)Ztl5#OSA%ncs;d?Pk_(#hkia!SaPG(UiGN)Yl4EC#i#-9bZ zY_-;L+2gN?^M?EF3AX0rqS^NCx!Z+R`?4Rp^5HxbdmiYAc9db_f4=CR%W>&LmGi&g zb~Up@rHQa!gFR%&*I>L$`NzS}t>If`t#CR6`_T#E9KL(rpo!fJnCie}I1Ov#55;ca zfuZH!2i^*H6j_Yc;{?VBEj*5sU_$%?her)OWEy_VtEyjqlJm?g2yygKvPsRT7&(^h-E3Gg8Wu?&0T-Q{ectR|u9l9n1GWWN2m*`uiFCUXx8!L{vpGhL7B>A* z72xPl#x z*05HB8d3?JQ6-+&nl=xj} zq_YouA;}GRc*{AbvQ(tTEF-un4*4*-9sy)3A=ugFr+ilqjGJp9C56@#1npL^2TH9} zpc4?tEOw#n0()Rnvo-G%Wj}*>a&kw)HqrrNBcM*zHiw=^2H1TYR`Cxd-pWQ2Kzj($ zAouF9tk!zcC-Q*qI*txrIn zxPw&7EXxF8stIMnjOBo#hx((SMWsvuLBSL=nSynZtu`W?GB6a`vL1n&kkG|_TZh)7 zCP04&@`o-j*)mG?P^n;YI8rr&)^Y>Lfm1WWoQpvsg#>+4uu}9yvt6rjbA2R9vuEiu ze}ipuT&O-U0_+qUHk4-`WE(Bu6Rv!o1dIg)mQ;CnDEc9MJJDF^EHH@HURAcO)jqz* zvv1e7P?gOSe4yP7+H`s)7N?1y>U2RO^@=+o5+^6%`Z|A_dM*%47=CQ4s>O+qWpkKB zoogzifmOp*XO?|dC@ra6`hbJq;Oz;Df3TJKzqTIsZjmxx$O?=d^XGzF>`t4;eO`y5 zzWlU`c*Y8=raIZL*kig4^LTFPe-?+a zoIv~@i{>J9C3xu2Z{gJ3!f8LhxWP>f$Wz5jyP}%a*g2=;<6_kIub{S>k!a1S5~lHv z<>-#pGcqn9#@=4cAWL538vwAWHm?y5FVbvUfY63+_TjDuRx+hSJq%=|abkgx^rDvdzF=Op7U zXd#>kVhLWcQ0&?t9$NeNuh>an=f%fxylI_p(u>fb5i(bEh2y`e@LJ#E5a6z zz7d82;8Z{)tuydLop(>%u8MpghR@-bQ#OOFL0D>vFnSD)c6thf4!e@)^MPAa)x>tV zD2LH}x{$IShR;kWnJryj=YNzn$o_g2&oyx9j2@!KhqD0c$}D^jpl*a5->TjxiC*QZ z8W`Aiw(t!;g4wt(oApybe`3CM;AXcx(xvk3QgYO4eruOq-QBJ*0`98{V++rKG`sMED z@IJbDEgD66sEJnnB>;OR^c`sP2oB1RPjV|PSvrz3LysSSy1x`)f0aQ9!S=T*0k;Q1 zzjDFTe&i|B9j`11Rrt=kSTKLZz&_topmFBvyUz!PLeEzKF7nVTn_YFje74^QA_U;l zu`WnDqDar%6@olIvfxL^QRz}UGY7XyoYc)YX?mSg6GisKHZCUfSRkOcv>zw)ei8|H zhpIxZX9p8fE-)XYv>R}LK9C2*UbHnE9rKR z6XDBUi+q^|uxjAY=m#8}-+-V?H=r=d41`DPatK4CZL4GiCm=Fb_O!!=$GkZd;mx`X zZ`KpLSw6glx5Vio2o_uz^nw*#G3X%b6$Xv3SqMWj%K0B6Ud(vjfh-fF0*1UJBF%If z!vAHY(kB`!MsD3P-`-dS0q`;#V^TMbQH+7u_TfW;)AWpK`8frwU*pd}I{~tn1X_*x zJN+>RA4>s-F)LIiy!YeZDCUa**Zu^rhk9R^G4ll!vw8`y3j;JUHIqR)D1Y5sS&!Vf z5q|ftXdo{d#6ycW6=NSZ8{0^LY>dR%1#&#dYE6%@-BLqRugCN2Q$a8@ZjAV+b)rY$k<(z0`R!VBZxLkc$ul|wz z(Cqfx@}cT)I7>d?{OiM?UVpu%+3c%ybxRH5CUgD2?{03HV#%i)rjyb?SKF<7f|oQY zeREa2zx};!;7MIR^uAwN^i@-LFX5-wLk~NuNt(9n-3LY9`4`2wOqlkwYisU?@vF}D z&$pYVt@`^Ln(SN)ys=wiY_TOuGU-L|m&mR)FRmrZZt6lY& zqx@Y9$`SweZC-bGW$S)zn|$q_P`dX0I7EXA!l&|K4{|n1S$Ea1s5{@I>&rdpma{a; z>tUE4*9_~^M5<5&MSqSDsH_|Lxr0rrv&b zorW=+eLvqYwBYJcEFw*QhI#z3+yiOoVOKjqMNLR(P(WG?OVrXX5gNK(-uAAg2Lx6- zYYZ?tssW{8gqIjQ|&IL|EW@335Lp4LW7hK;K115hOL^-eS;KgmQ;`Kh3t; zM7Bl+k!;-C4{;%JzT6Xx%rkhQL)3n{FWaat3^D21Szr_@#n8ioj&qL<4j^gzeCyh} zzG?GK>3$UXK7TJp3d9y`y7Nzq?E$dc5;v(ZE4N^Vv)*!C0mzBLE{*ZhBotIknN0pr z!iT^PgP{Q4?C=O@hgzBJ0pZp3zN;R+063e^#6(ImK7!42Ff?dTX-ct+B$5hHEazqr zcFH57x@AHUA>l70nrZKZHhEQBi!#n-*yS1Th&XtZwtw8WWmnetvUg3+h~RJ6RhxQ; z@4)lKP@(}&8Jkc*V+*4xp-K;(ocU@;1scDR4UYfG{jTcZb>~^LsGy@LT;rzA_xG{o zfV${px$jP(c7zi!o75`#`NnWZ6`*)V2}j>B=Q1xWqmsHo5gA85hrV>JPU-Mq3Dg48 zgb09l6Mq82HD`h-BNqT*BCu(Y-ppc8=-&{*LetLO%=@+iUymTjO!CoEIJAyvz~^y; zYoOy2+1Mf6ONFICb>N``qqhEpE1+7>zwo@S3jB57^v%vSgJ@s6cUJLykQSH8Hg7j& z=SMju9w{I+&2=VA|Y#syQD;C@)B3JRPSSMd!npS>GMfQa0#{QI2N9VFBD96q6h^IPo!&?HtIfsr;mi^DvnoQQ=VgSf>Sih?of=CDDS zL0Ao;7_McZSlJ-4NwKyNmgTc)oOFdvk=Rbvd)cqd5*DnvL>u#O3W_hpi=sqUtJV4}a($!8t93bmVDga>n*UUG>)MVvvyu5pwOj zS!WC{o1G6|A+%dp>%8|rEnnCtXRC48Qo#w!__ao1193U&0!Ck#UC~w_ofjH{U;hBC z>iuT9b}jD93V?wgb7(!~uPlRPslI|iQlipX;0Ka7r)U7A%Ey@MCvb5pc@2tFDt~zs z8`(gxz(Q6)E%}%o)aUfk_T_^Qw8~g007y_1L;VzIK`ut;oVUff;W$KFlUIBbWr%DF zP>Hu$DTz@FMt0{pj3r7R-?(5+k2|Z1GIsbiavn{b*pfD*T8hSj0U|CR)2!v%b3Mn0ka*=1=N-uw02iTPv=)1{d@SWi2=8_~c3x1M-ex1eW$rGU^+`)kYMaF1J0rQD- z%m|}186&0NVdwGM^VM5$e19|1=nN6Lbn#Iz6+Y49ur$!h6=CU|;f@D@ zhUH5LxlEohM1*8aZP^_?JEdsWI+4Rr|jWOBLnH^P}ONHGP6(527fO0yx^L`%Tw@T zSHeqEA}z~(OL#pc06F4;C^SwZ@q!zcXWcM`0MGG&oSYiygAOVaq5m0GChVc>jMiuh z5w$+=oB4Fx<-91&a@seiN?h{I^g0l*loQG6H})pyDMDRK5$Ze+%q1MCYr-*Vr912Q z|HnxGL3fA9=1)Sle19%vb3qi--Wb-a7Mg_w9aewGGiSbnNDk! znfc-SF%FU`IWdCdTvQK-Tp`RtDuG?Wq(UzeYzvbTQ%dXN3FiXVB$xsH#!$OL_mQI( z5Y)%QP~FFPzJIy{C?fVCKsGFJ!7c}Ht3*PF5%&%F`#;dz~2of@&l z3L^PyX-f+7_J0?zrncFQiW%}fV$2Wmx`GO_pu~WzZaLM2VrqPDJn!3PkN5LQ z)A=;5} zV!{gk$+y*G{&DN`SMbVR(c{zJz8}-gA}BamBnK#A%bZcL4D?^2(-gk0!QGmIrWvK- z9oDqS^`TzpbzuvO3=pYgm^=kj>|otJKD5}DS9RY-fyU-Ix&|g^qSmLUB5k5XpBgjs z=h`nhn|~h*S_kUBa}slgilu$NI!lkQKm}gT_9sw!*LVIa*K^8kGvjjGpWO4^p)PI* zGN!g_DbU}EaE+y~i4iP!QLykS45*?ZAH?2AsqH21*%T1@ypxb)Z4W&9y+m(eIekJ} zT3&+%8Kk8bI-4%Tt>ZLUaWE{{c@r^I0l`CVHGfug!#1MP7@T#~B!DMgHY`PXblDJ# z{!*zH;YTpcQRENX93p?%1_lLa>hmr7{gw}T(QiNd?66cei5EiczOgZdG(L8Mhfnua z5zCLNY@SoxM^y8;&ZSm@~fj5mqJ{^IAinzy(=6Nlp#3f$ zn9hMAbUFr(IF~KI#D}&lAhhh;L(#j2eC*(p__0zS3Unn7tR=&C-r5~C}LmB%rak>f^E&A-!!8V#_DTpm?(T@t!jL>XvOfWohwSR)p zGJIf}3=dhB%GRziN@G-^uYMLipc8@Mde&kj(hRhsXX52tf( zK*#Er&82DS`e*5Y( zGj~PhI%+wLXmP>oWb>;=FB@Bt?CvhI33@D3L~<71cC_VmE@F89Vpjx*Ab(pXhIS;V zNZw+-AjU-4#n#$QTEM1rcS=-4R5uk&UAk0yIsgAgLxAmV1E=y=JH2Z{1eSHowPl2+ zXD2lzs11qwD>2pg_EC>-vRRE)+m^m4ys6jSGLT{nc8P8auqNs3KT?dH-h6oRZ)Bz8 zF$!gFWOH|1E-zUU z9d>{C|K{=v{^zyrsBZDeqkUGlMO##5W8X7)(x`!{n2wf3*5)fWYjyel`p2iQ7#puc zLtCb>O0$B}4)K;M<232|wkhX zrND%uu~b%--MHIeS+zLB0=}`BD!sU(6n=m1c$j})=CEVC2st9b?O;dbCa_Eq3)Zi4 z=?2h+ic`%KJAhLPj{I3sFv5MVq`_<{e!lGP8fU z#tID;5b0Zi2@sS{eSwXo%dK=xBggGoVVZZlDQGlpRcCAS0ved@vt`kudED7=S9hteG!mf*T zxyy~swjmCuEY_5D9Q=(?9$>PH1s#7g83XNN3$t*#Wt(AckVlq+~n}k(T8p$ zS!XD)U!s)1U$ak^%IG#*wvBCeKbb6B(U|J{R-MLN^tw^!&EAT2G`FKy=c_}x0^wvR z;Sw54Y}{dQ2Ps)m;!fJefB^#zuO_qfT7WN33yQq48`dP2w9_+XmxOx3xHEqa#`Q=k zfC!VIv~_NWl=(7mnykLFudt+*vm*Q*qO|*L!Oy;C_OZ)87rSh0hXSi)g&X-~-)|4) zvNMMXk2wWLknnRs(&+KU%j=7OU!bm#1ziZ(wV-+-QymMnSne*~y(fzm^!>OXF$WO; zWJd1bPsJM0XuEiO@z2Q&imHEwA{;PZ&P@SpF^GO@3S5K&zw$*>!0J-|;C&b;E0eLg ziNu(j)H;^jq4De8ew(9>au&6j6Dt^0o$s>x!?OV2DHE|CbQ^(!G3FEr8lIHlJ=?CU zx@b2$)GHyPPn%-vhUTC5Tj(p-_{w{X!uGn(_M0bGe<=s|kW$}ZKN)|>0SAl^Gmm>Q z3&BR27wgRsDO3lTy>4tDs=xWAMK08Be06Va{@K2R-I-@*A9aTIxvF+WRPXW?$!-kKy9jKbUS8;21QwyUokaD|EK%eqXv7hv+A^lJgV* zmcnG5qz(eU?F17LGOm9*iFuORp})W|*r2A)sbLF1?XYdJO`;t_Rsp;zS0H6c)F2)h zX;2y)u;67~+?ZG_@8)w2P#aMjAn zabX}Z#(){JsyXcUhJMvpS1N3rIq=)Q6xM6yYvc4_R5zi8nl68oefo-%g$C1wK*3-V zR|vEK7+@i0A@teg2fj_xSgIiw^Z-$bai{^&mhSQHyK1*Tw768AL~kw=(9rr)si+Tc zw2t0lcoQ;T5>uiF_a#X{Rd}3e(T({jFiirjQS5U(gNjMgZ|v8=3_2!+-Zw)ZioXfY zkZ> z5;b1WlTf@e=HqXKhbd8iy^o@noI%ZJ_OHRfkB}gNj4#7LEmRl5jrD)$w)dd@k+AjSrCP(>X+J9ZMJpM zSJLsvPw9V2oX~#SzgaCfVWU*W%A6()nfp&66X-EPctAb%a&)i)u&i>PrQo6xK1qz_ zEK4Dk7E%rQR(q&J_{{-%(w<>2>$<9+L0BQgIA`jE0u1q7k`3CobqTeL2S%A0#0f6U znEa}(t8zUXFkC@&ucW_I^#J9`yU5RK(P?C~zw&?R=m*$w6Lepo9~|4to1a7`vF>qh-smKc1(}>!BoE&XxQf%;`6jp*p3pDYi^+Dr2@quv|G@?zUWC<- zHtwae419zJG!%rzAc2__5C(DsZlfH~3rxDHc&Z@a5mPU%2nHny<(457{0;yBp~?>m z{K$WbKth3nU_JtPbe)&Gf~QdQks(n!35h0=9)&cS!7kGIXpbGoXQvT~;uh-BqCk*xfB zku0o}(8-+~oll??KoJ-JpGaj!(d1VGn&d2?;lC@;i2Hzsc_GP6E-1~RmX|J5alU^A z<=ZBorC>+<>LeeoPG?3Kr{Z|^RWwTckHVhEXp}ljqtxRyik`1gluoWbsCs}#otYqp z6id&N;gCrPbwsC+bWf6UKlEuO51=(p?|sgD>HR~1>U4gN7kKC!Ax?KoosaurWI~Sf z^YPI>Ob09C%D;}mGyQG;xoGh!?(To|os3IsuCe$5Z=Dp6mfdxLQ0^iQzxH>p_%e9Y zC-5O1UC==1p>d7B7iF>hYhz!$n-$Vxl*_GNl1N`Q8Ho5Iu=Ve}J?&QQ=>A8cF zV8w-ol!^C#=I3xgGh|B$Eq@6`94w~8sDA~_J&6hPvKkhyI8i>dgouGa25Eo43@$lk z={N>+7Zo=LSJ}~B_l?=}$=tV@x{uY`-AEnRcG!!w>QJt_s*oGJcQw5%%ABf!j&VB4 zwanpFW{<8+O$CdJ)>cxWX*I6oS zba6#R&{}3TRsa;?;G5D3qBeyoM8X?)do@2fKUPtH#3C6u$7AAyd^K+z`B@FSf4l7LR-x}=9qNHc8CT+^u_pbMnXBiUF!HJ!<%O1mkgzJq)=PFLBJcrJ;6v!RhMMw^ z8L?@j{A65)$)k;_Q38LFd~_Q&G&gxs+kWo^9lFLMwIgmi?7|Wz_oERIxoXOvO>vi* z(0R)=H8+8tn6X^I_*R;_4Ko6=hcyo3$4}--`}#>}Ew@>*vz^AM;L|$;%8-h`&AZ}F z_{!eniUe`y4&zsaEi9|rYS--r24<^OV+UmR!?s#y#&Z_SkXL`i5;LPyiNc|mkS3mr zlZAk2Vz~A{$b zv4Lk3*whn`jGYE-#-o?pL(}FpDiTYrA`O#R3eR`ASJ4&m6j_N0^Wk+6=b zOr|_!M?8dZQ_p6xuqdoY9gn*|YkqTy*Ym+b4M;DNfuBQ~>ao;Lc7|ZsV+F&~FP02D zl8nbpdV-mH%uN3R7LzXkj09788SBI$nD7R@yuSD^I!6L{29pRbCIT`!lQ1qSf6ZD; zliM~DzR#~98&5(#}3pN4xP; zB#tbP)uG%k!^qWq0n@4$C*R;tRqaRbz_QJ5z7Vs+T+GgGwIZ6NjA)WtG6SS@qA8Fq zb!M0=l*K8UnIconh_JyAoU6p{3g&FKh~}01)r6ct@u{Wess0l7M&#q7f7wFjIg>UA zUJ2&%u-39UZ*euHW}D_f%TROO9PvTVN@`!%AN^u`>TR30+|tOhJe142CEfz-Ur=|u zDO-A~PYDJIXPDKdW67OM8S*&E(oSwp!}yKtF$#)G>Oq9Z8O@m z#90d|CF2tQ3uZf|kxYU_e}&9vubbWB+?H+K;8u%#)~xBjq(4xpRlO?PD)gRC_4R%S zd{H2ghqd#khV*Koc+v3)ol6 z6ZQ!-QL}uki706yK^KUCrRQ9rvUF2+R}*`=oQGx zktUO}O3OQqr?G0^oUb=DfV5y=PYZUI)VC`?5%aL`0~dKG3T&^>V9fiaXJ^8k3(j=M z!gYc-mKB4wCzlY4DK5GxZZcs};Y!HV} z%`Rn;Rxz&Z6A_(HEmD);_ud34DpxC_rlj_%tqvXaC_PVgf4$vO-=;br>r-1V%kB0v z4Q{G!_d-KG%~f00d*YAa1rxRi{4pU!!93w2JDim|5ChDE{2)#2w?;s4Zlj*DLZu@gS5F&29kbbbgMK?3M{KyMlp z(hZHQ&x7m9euWHVZUf*z$@D0Ox_>Qs1)fq9?pm9s;Z=kM;hV`s$>M)!_eJ z@m$i&xtP6gJVXLoxAkvcV6aE4!D^5r20$l#|7p1Hf7pO+ymbYhTPB4b^L*cUA8Lo7 zh7Aw9qL_t!am>PYvrfes0i*%ad4fQbKWCuH-R#|-_VGi#ua|#1(T>aQb#tuS&F%%Y zhsfdroQF3~E$AXWu8#=DBbM!(&NV6g>;zu){M2sD&zuid=tl$2c4z>h3v-1g24~>- zX{6pAe~vUlS`J-@vfZ3;r%pmh^&t}{hW`*cb3SZPd%uFD^GUe%2rulK*5{5kj&!ZHpXJrcD@>RztpNFh8&V0RrDb{*XH z3a|GBcPG+5yiGU{@<5Q!6)q^_uVI#mW=W=uNdyE1 ze_q8|p=iURaFFvkr|ymj0O7I)#6hP6=Yr`>Ly%%p758~g2&T3N7*}060eEq&cCqn`*-!B90+yq&>H37h zCw|`ODzspy(-_e@R!B41;KVaTFr-eq7dH5gC&lmJa*fnO2@AG2WYxG=`WvDcY%}tU zA+5F`B8+>GUiZE}2AF`81t5f{LOL>kfL#E~xqBLSP(0cl$h-Lte8G&C`@hIle>$ch ziGMn_*pbdE^a-aXJkj6Bd2XP$UQrWWz>YvFv?7q|+k1~p;30@Vn3jJp28J>QGU^Vv zy>J@ze3I8b2o@0%SQ(XAO{AaDDCsXkS!PTewC{`Cg^n}0G+#0FK2T_Z$9uiFU~=#{ zy&DJGB7_C40hi*|I$YY-1t9P3f1|32>B$5{Vf$3}bt|Gz9QHzhN5cdh@;TcTKEI2J z?JMms-zbjteVsKQ9^ufC!(_MjraNJchp-LvGM-cs+8#6s#EAk!onf0t8fjK5-7 zE_$YXf3CYien6ty<1>V7iLDmkOaF@q&E5iNcX9%3ib;!{(2RFsQQgl83kk3J{RxoF z$Aw%G1sTl~`VAgN+Fq63_s$L!dA)5=xo=YXCt1$T@6h7^uTc4*E(@)gHrnG43sm{H z^i+al;62ji=M)RH3V{FEfAD34`$dL%q~*`xd0;d`0Y`BppvFV_3T&Cxd$DAS3cK|6c9N<8R-j(iA{w zx|fPCa%dS&u=}LWVd<--zhwz+s|ZH-d`OY&Qo4(W~8G(%zyN zg^53=Q&3U#4)MoCIj-K`ZDq-yv7h*@b=e-Hi66k`+m>N_x6ggY?! zFuDVyMbKp&iCq8=gtYV=hUuIkLy|0f_385(JVaAscC)FMNX3Rei&-;L)6swKN~lNb zzw)i-jKKigXref;-xh4RE%(cC0Y>CGP&6sJB`^CVf|~`&6%U+NLLR1i{lL?M)MX6F zjGnD@q_v*Ce+vilyZU-V$L8KsU&VKOc2xWwF8BOUU7dqV-&P;};c*B!<9kzdttVUo zdbeLUY!tJ9yuA3=1#*CAqQAr?axhdd=;iL>=U;fXf|TwyCUxQ}oNQuGNge*? zlj5@q)leAED>ti_<@r?6#AY8J$dqS|*|i-3gGCz8ik|_yl3JJSGj^qYTqhpTM&;mPo;PdW1x%nz%Khib&-kPJ=l{n#2=SgO9WMNZ-a5aYx3wFpyW}5D7GJ zn%jWFr?&JT#i-k83T19&b98cLVQmU!Ze(v_lP5YC12i}@lR-Ktf9+dKbKA%fzUx=8 zYA;}UIiB|;u3S>Fx3ZN@B^6has?8o?5|ogTfR>;ndw+d;9sp**;X{^X>yV283vk_=btuhxtjm-{>Rtvh?yB=B$f6vc(x!K zF>U+@{?g8=E*|VF8dfUz{_eq!R{s8`oKscYM4fsX zej)hiY(X(cT1$|MQ-%Lvz3=7=&R9`)om~!it%1*#9i(=!zHYWvV`A$iWCTM5zRvL zh2pgMW7V|#e?Y?rD}+xOIwVF!=!tF;8k}y<(4Y{(DGkm}?U%RZ$9mzV&oBl<;HmVt z5t|JK2AI@ADnnA|FEj(f205-CdD2+jTB3J>weSy#J$%J z_(4@QK_53^3TVr|;N3B3%qg8{0v0BM(xs;%aw>4uF3_!GtAp7@Iqt$cG{YT7TpG`v z9Bf~JzWzDa%uz3tN0JdeV8np~TtD2^o0Y#U{iUmZy{npKm9sLY5s2;-j2Uo)!3=+& zwNzxVf0`~4^9}f z6g$a8n<|l1on3~3sUOPz2#|phX}F7w{*2?xf5h=YCaY?>tIDqG{A1bW)CX^h0kP^V z=wmThd)9eFX`4k;T|>TeA4O}zC87YUX|(o^ zTwPZ?n<)sZ;o34H@aVnn$y*Rk0}DL&sY-ZhYk#`y_Wo(aME@pl>U{+~fo>vD!G(p$ zf7U`_ShV_hyD4jnirf@8@h?7Pxl}A-!!2#G2SQ}mZtbd!7xngb=SaP`5;|0hffXb< zXK^}baft_0q{$HUUy+xD5?RhFh~m}o7(hw zl>7(4gY*C=i?IMZ9NOaPnQzQF=V;&oJ9^Mi*k;E zs2Sy!{?EXC?uvyNZV{|z%kU#XNL6~A?j_|-W;=G;FYkiuBogIe`oem(WHK( z2uyaK$)?@=fv()&?fP9gE9}-W7at8k|G6EL7O^kj8dW(^qBfl!Jb#%bpAqtyeEmtH ze>#3#Ap1jal8EbwNsRM*Om;f4iK}gwlp7m&C`W@_RqcBVqLrU3r4TH2#mMFoKw-WK0c$+cW*(8xrW6jM1h0q=i zg+69glzan3jTE4mw@chG1sPX>^S2S z{H#x~l;gZl=tug5CEvPssTj>KGgHQa1Q=vEf`h)>!1)Zn*K+3N{8+VEKbX z=yrcIo1M~#9#eMUGI+IO80XiAP2vzhL2=I5eIZu>h!*ok2updlaB=R zI<~$&8X1>AA!-s=enW;5HWmOzlj`Y*zKl(T+gj{*e|O8!|3P@35P&pA&ekS*0^j*6 zFEvSs^r;l-+fCs6>vFm8hq4E1U?7;7GeXfwkF`|i^7d@qf5ExA6%;YiXZyC2@zZYH z*M0o`brmS9yB_KxVl8iJXa=gd)Vj% z3_`;yw3oQd*dM{!NLoGkn^O%zKmpVAlz#$#%Ry|fvQ=s`PPhc^&?NLFc?pDPfO?e% zw!iLLNCg>yU{?o2(4wHzg&<}|>V_@fNY@Ybf4ysz5XScxm{`@}VDiY>6vfjLPVyat z#8^WP8z27>Sl0#55QyN>$IlFUK*WfPB)tqLAEM^;85l*Bect&<@}YwRo$o#M50&Tb zro7KFv0#`Y!&w@czEB5F-Y)s$>@qs<$|iu2VQcf5r}?=GA=dg#g)pJ2JU#hg~8+%Vjhxh75Q4E(4QPM2Gt8Y#GXo)vPLe!ocyc0?nc|{99mfE9u+|+%Yk>SU~m&$4rflBoc)Ez$x(8NI{ln-5pO3R?=QA zqixj)WNl9Ms7jg3q)0+B8Be*Z%p$;2P6>Rn2A`T;yvBjqrJ;o!S{?I_%|L`0>XXM$G8hgPXb?@NF~u`_=M%I`lQQOsTqOg zFgtl%$dLePFEqsQU|Qeh_9Td5b~1^9RA@YQe3f%N48Cie_e>ZVFdXeMN zXJJ?*fz%$U`63)sH1ud9m3(VX#Lo3PqvEk|AC4+?ug zQT;y{WDu1~1&BjzAD27+aWmsGmQV8Grcd%iL972c96m5Ut>gP1k1k(W!5B7sltG54 zp1L^|k0~@C?3WYKLe^`*f6>q7Bmi0RB52g-kWr7w2zh?-Cbtf;nH{?rV@D}WQdA0o zG0tx;Yg@^?FuBNu)mMUI_PkK6UQ`Zbp;*LF{0i)u(yXd%+QIp^(bW;O9jm1;R^0Ru zZ6g7u-DF96+5girk$}BIoJubV18{RC{wTp@#P0N5UTby70pekoe-9ZiN!vFV1}`-V z6E89%Z2bW_5xN8Cz5l---{#X}wGc%!XSlfA&O_+4q!3Eu8gi&-F&=RxfLi8~OCu-sEZ7W2OJQF=80Wpoe9(%UP3l>R za0KG?pc9IxjZZu@G(PddH#rCq&W(WIhai_G%=8Vu!z=yypMBRh0;EOCBgIMuGJ@bI zg-d)#+=^}Le-r1G(X-e{5)K42FfucfK{_aZ?OIEd+r|;T>sPQU7qB9Z<_%0zK1hyb zJ5`pQ(k8BoxylzV0DkU9b4++h;s{ zUtK+W@!Di7$DEaRb+um!rC4gSl{G1o%B-$-t6!3r$LqQ&yTfVy>(yU}!7pAbzDk*Y zOS!<2hAHb-8<8=UIT|Pav=}g7N-zT}aiZOyt8G`-6^?lE+Ug0R)=Z_QC;XwT%2WBD zV!csmmUK;Cwfmx>+Ob|smE=2`M7Y^%j#=gUS>AEOiAu@|m15br(zlUmQkE&z6FiU1 zU>VQGLq%pV%$Y||@Qw==Xf*V=RAoeeqXq2Mif}HV)sTc z?aYLw_nts-%TkSBrY#LnPuTxE&U>ja6QYbcr$-viBSI<^li45{e<`|R+mTRzzA3Kr zwM~<*{1Alp>rdNb(Z+;S8fIPg2qD#VrD6Cmch#r&=;RI901^Ed4)fbg~&fnWZ zc`RbG>X=FGQ*OaVX5oG3SCP>m5k?G4{Fx|bTLr_#hYQ@*7deqB=AbxJ6myXg8W?Sc z_4hSetPE_`@ff>d#kibEr7%%{e&}=%6&c}&W173WOr32D7_YNO9$IiXtx)q*+vTZe z2Qgr&7RGRKhE$|?HETA9086GWS=0;!d06F-kr{kx$<2F@=?p5;{FLbv?zX6c3B*gj zv``o}TPV9|t>z2;{bs$9S+dK!A|^wIX{o-Xam_T`mYf+^_k`{K-?%=1;C#VCsdR2! z1-~eGii5YiD|myMy?3!Na3*>}JYlV-=*~?Q7dzqRI)CpjENGfuY(iefjD}@g-qo}T zc!c@jvXGH@-&zsr*Y)YHSL~?g z{TdoRQ7?fxXguW~%Ts=&)(R=kC;U&tJq!n`dLMXKB7QBJqS_X1Sg#sq^p}-^J}o6N zZ`;~WxGll9;eL$4#`3y46|gF(I|J4To_xQjPMEI6EgCzegYY1KjBP?^S9joXKT+$h zZ2wi4ME4w;EN;s)ggW8Ew*}QoZ&19DOrde)0yT5l#MdYpF(DubM$Amen;1G~2F$>O z=%;8rGGYMWiMB3z*&kfXr1-G*_kt(ZAjn>S zdm1ri42;+n+os5W+oJVkD)E|957Rb*EbtFiQriW9%sW!zQ{8qkjQ|8Ws?Cq_m@Ivg zUOjv*`Z3p{A9pRJY!Y14S21*x!m8O9J>KIsge)KAp=ESG4t$VJ=Th!Xp_Xv--tT(p z!754*ek*Xn;C@jp1K}23Fcndq{Mfn*Ew^QNpi!nXEMpD`fCa#c4c(tWI`P3hjn68U_>(5l7B>zFPCO|tpGMa$-iI%oKBPPD>`L;ZUS>aML|Q2#yiI* zp5!O5s^_&gJe-*_|9-ce(J*>2s{T zL$E+rRMZrbN#-8N0kqzg0l`h)bfvdwVNQaGFp}Yw+;4uy z`D5N(7wBfeAzpc7MRqjD(|A`~mqY$5_n-pdcrcBga+lw9iwxPs{An_O*gBX$GR-sV zXQ!5#XOS7Oe|4CFs?8bkYfF`=#j-HBc9#qes65XGqc*w^n$+t7Pl4&79@GGuW@;cU z-HYF3585*b1Q%APtSUcVPSl91HS#)Oo0yLV_pBZ=y;IzjO5Xc9kjGt-hf+&l6cGHP z^23=zV^0rWrs;~dquNd09m24EQ=h_d10@*bZIG|je}S7>95|e)D?UaJB^@B;e$OA` zd5|&M#w|;i`2>?M)Ck9@*e_E8EJtYuVSKsoqMQ_|s zk_jx1cPbK86>dhdeEQ^oAszUdrBgcOxQNmHwd|-yCpKzwFW8LtLM6W^_#TVun%a~H zq1bj0e+ZQvn9uDcHW+56KwMjYD`S>samj`cdM}=%p+s?}4U~KO2EdOy zLCwJ?GzIuQPjXc>rW(dj;h6WQm_#YqQSX1?-5kU82~~3zAc&$YYaR?u;oYf z%ioqL7+5N*{QWUZc8-RaUGOjC}iII@Q_+0}6%fW^H7G zyu2&E2FxTEpOuiCZ2>?nw~K@vM=umncFmS~)A?zpZ-9tu(5G3nS(uan4fcoXm0oM` z32W19J$4=P58>oFeR@lTw0YM%M9WmVe^B|+Jk2vanu*aZ>xa@3Z=(De-wNh;31BZ{ z($L#(+UFt~JW}od?b)Ryuo6s;4=-=aY8#8Xq-A^zy7tl63^h(e;+zp=%qD3ms9=Jh zB-`UJH>kS`>aJ3c2C)v_=(+|4pjxrJ4s_mg-+e8?*vO2)p^XFaY;Xi+6?LgTf4+L0 zMC-?-nDyv(OqTpu1%#pCzLvrK77a2)mB5rW86BvB0l~_l@Sop$0wPst!$T?%ntQRv zGPzVNdH4;FK_2v&wxcErtlLo2fxOuUl-w2& zq;FDoSBD4I`hwC0)Rc2!!rVjJz63u1A+)pMhTbX z@7qCR!pnkh_xc2c3p@fn9*@v`Q-q6MA@aa+QNtq*XXdkhZ*d0TH`Y~q7Q z^M?!`O=bc(I0t0`yQVVgf3+mAbj+c>iFyU@#1wZ+oxH7S#@nzTEPK0$g`MvN{j4w* zc;CYKLx(X}63uOJ##1-GI&Yjy1Wh=Lfl@M#xFi8sYzQ$B6en>ll9XYWcQT>`2^2WN z=%>0z{55EyObUZ=M68+8rpg!16L#iftrwJw$|tNxm1`f2kknsv=0A7uasz zJK$wS*cF=IPwmi*&HQ&rY&|F?4`x~)Oc?yHGWvJUG)>ld!1mOv=wqG+!czeLI4fPC zho8$HrP4zgV%HFv^y=R~yrEA_b&v7Q9f`xC-e+qw1_HN-x`)iuY5+i>T9sA2e2B8l8mTYK$Ww3bY2_H3~0GWo~D5Xfhx;HZw7ovAY2j1UWW1 zGncVP1TBAS7dA{IE!{9kcXxLvoub6R3^2qD4Bg$`9TL*rB_PeAJETMq6hvB(_|S9S zbI$wz|61R-p0(zAuHAdz*S^;<(rM{(%7S1PU?mvTg_Dy zfRBeq^go6$xEMeI=mr4+)VTm^Feum=lTjY#=n02d+qgWY`OhbS#gY}kD=I3?@!K6B z>i~vBEP+sfI?%-i?C_Y;5@-+5g;_$tE}s7tf&poeSvT%mss6OR;hQ z+#!E1HUJ&4GZ^j$1_6FG4A1~NfdA}_3zHF`X9IEmQ?3iMa&ZU3!GK4BJ;V|Wb$;}4 zg@V9vz+-ZNuIdYbrXv{or}2wF4LAUQ%?7~B#rt=-zr241fH>=$9eT-Wm4j4|IP6LhOMSj|RUh2LhC2wE@7#2LEc$*%A(M zbaCc#hS>jVk^5Je$0;j9LGmyM2Qbvd8S__t3J^Hh@^S2*+<%^|9Tesc_5KT3L7*V3 zUrm5q9l74+Y#mnuzG9)>uS}=g+ACAA~5#+Ia{Neq7X8LcJ|38BNit>Ns`2QB9a|LU;EEr9;7sUi5!omB^eAg&Jot5tOYKJI}m)Y|^T4Ec4d062Mhc>YKCxLKBVk2i<&BO`ySz>kab-zgQL zmN3w-4dW9O0s!G~peH8JBa!$71p(f?kE;j*d;I1wfSU^nb9rWs?gNvTZTALHJ3BQz09ew}w!;T`$h0H4Lo%h%FCiL)*WbMwMKDTCx zIy1YSn9I{7LsP|HWg7>nF{n88WcGaSoO}!d?U36Md(;>UoLoh4wF(J;xDP0MG!9m* zjfXAnYVXwwJ;%DOnB{+r)sJ}{SUS)6#v*rt>=~L1C-oCHg6|%9^B0$M1o=}Bv}%d$ zn7)Ux{3YJTTYPcX3tsD0dVJ2k*3p2(v8={ zmg{5dM9poYxaNw~?cD(%t#caO0}s~q=te(yjHu3^sCmssxE<`U*%N&~x6FnO_3TYJ zgB-|B5mOnPn}dHO_v<=R^A)hzDWgdmbE#b~McXM+DPrkUbFvEB`J1({hRsYGcE4h= zX4md_4!UFhh#35`LsX$(@gQ4UT_BQ!UyPxG9v^qziWI&*;Yy-By)CA&K@h&J77=&P z5>|L-SpEKN;@#P?Nf9TH1XqQ%t{fh=hJ6a5ah_(vi{pQ}H*tcLrlL*#ME7E)&pX&q zeZDDS28BF$_eTO&!viW76*)G^^L{#YA(2XT+wz#Edwfl6&>p;JHtIh(@;?ZT?1GSE zkBXCf8josSxU`|{6e5vGJ=8CMaQsZe8>nkghv*wWEcUi{qXKva;;|W6^7i+aa6nt& zb3Yo-PrH8!BM!9|9P&dBN*g&wz`PEoq7+pQvI&Usn>sq1XO-aBogu>s1@%-Ssr4f) zlD?pEVvD}$VWbS*k#J|`EpQGzGu2RVD{6_!dz!I?eZ`_{#Kks;x(83lPgy@ zI$8akmNjfmVzf2po7SK1Gj(pxjxXP^(u?z3$XNuR6m$ zp{bWP$SRv9^_a~z0)MllbcDPedyd_giFc4L{NcT{b_NqkwgA$A@xVN5`h77wMWloF z05gA~sL=MZsxVq1P-K@`AqQ#Z8Lbgd(aBg_);0T=DbTu!+(8=AEROVWl65K2v*lR! zZNrS|r`8H{wD=2Ak}N^414t@+aLhY3RF7J0vA&|c4^zi4eRV!hSr6}u`qfS!xE$E) z-w=DzRhTe`!=-;pvsuw@{_sgyxSU}rR6KuI?i=cnLG8rGhuUTPdF_LbR-*=sG%uz4 zH+IzWVj5-hS@R|{D#Kq5V4!tY5oJ;9NA^qJp?V(2k_lcAJEnYZ)5+JrYC9!l8s_Qh zC?iY=Vou}S$}VpZAxxcdQGJm0U>h%D*rxknO{;@UrV^lwKvgNO(`SHiq`wt#C{2H7 z|29^ArD}%Hnox6pjf*H$Z$LPi?54$iD%qb^x*fSh{>f%Rnt=t8u<1v;?7Z>|HSsD- z988Vg6t***l~`q}-nYeDD?Zst^Zhgt`o#~H6E&NK`?#ZJ_VfPR$wIR>Swg6vzrwF{3UT zZ%E2S^^Eghq44q62`Y>g8feNJOP5QJ7q(TsqCgKM4G$Q};7g~tYXlNS-j*_AKV--V z3t-7SAP|2MU`e9t;*v!C2AH5V&zrSjcC4D+VfRRNn=tYXYmkl}$5&qD$5(%#7E2E@ zZHaGwGnb#h#?&rw;LFK8~0sp;dBy} z>6qCBKWt#g)OX&$MK5UeiE>wuf+t%NiEe5UvwX^vuoLM-uN6llek7ObI*J^hM~sT!3qfogY< z!QW@$%7GC{O0Rp$u5SCu0o*mT?xl=6G^*8g($JhyngUN-g!ign8 zo*m(PvY6(5Gxxapl}zyGx%|1fU19{{QGvF&rb;zT+z>hJ=CPaM3oJRh2n*W2j9h)9@3rkJ8 zNnSsmkf6>o=c_&z#p**@H9CH0F;p;{Y~hy=MdR40#`hH?iq1_MGcgWLmeUm{TwH6{ zQrO||Bj!$Xq_lg&nc6AShCOO_zmB(iK{IfBBEszC%j&G03^{*SQtyI=oFZZ9Y#EO1 zT$k3i_QnNp8XFhN_(^GgF}@O)m6H`uCQ7ADI(LanC)#7&qq{A*KR`!|b045?G!DU+5k2uBPgcp%lUAwsl;3pHi_9 zF2c$7nJV$aMRtGZ^S$Z^bCqEcqP^qu&rC_HuLE?R7881e`xw)i4&uFYR|GCu)z5w# zZG|{IXtv3 z;K@db&aCR-(l%Ek2GXEEP7f+dc`--12h{N>=%)+41<`+X>tG?KWcx>CHM5-*pau4P z65T5x)vXy+01?_P_fsTUFx1@`oD7Fmn7X71_}U196E{>eBH#lm)v6^Nnyu(U%v&Yo z+f(@Vg^jdf*_a^@VH%oW$X4k+fCw04ntFLp40bs?Sz77Tnp=(Ec^YkEbeGYY)Osy_ zkXhnt2`GQRCdL*#ibR;=j89g0(IjXFUs2gTsCKdrDy`+FfqyOydb)2tQLDw69PI(9 z0)6R8>-8v@m%X$6I+!umG4-bK_9bYYC4@~Z?*}XvWFApiD64*>Wf2k+#tAJ>3_qxK zK}j;9Z!U=(vbSa$odcJpSL5xcSqOp%XV^3qF$8}TaO(B-Y;MTc?cI7rJ1Nar5wGXT z#~B>uv$KZ2Qa@!MXK7Q9!&vBA)%s}=ouujbW^CBSQr^5{q2MD=cHBTiK#hoC)k|5H zLFR*`2wt@;ELLoaTEdh$$uX$3qGMd#HqZ&bFzR*f^%rK=Kg#h*wDS`Shk1z-ju)r+-5(>CZzFA(cxg%t6RH-&ceTQ%;|eUAOxO%D^v{de0g z&ABAhYrS-4ynwE`0T8^wyW|#xowUP|JS%^5YQnzUlGq(3zlP`4egVbzMmgZoIn=M| zd43W@#lf@?xOzZITlbn`s5;@pr|Cl87jku#Qv~#CpBfOGzxSTq_n)*;JCc&}5KjPz z5GIX6)d=ttp9>qmP1Q4l5#wfwQO#3+lfR0NhA`GF6g7X0 zLLQ!hBN5F0rlA~u3HXuYk+*Cc_=jXflYeceXwR-!zv??Wl($1IaD1?`Mvsw(qikfF z0GhtDiG{dzA|g#J=L@mVF<0EgRjW1Qj)cJFv?q9CJJY-#*TX5NBcIF@(F}T1PnZ-H zk@5qjTP&ZF;V%9l!j@l4AI=mOZs313A6{WVsjXIb+eH6D{e{G*F_g)9AZ8M~M#zY6 zz?vQknhJlF?2i8_BoN9H0$Pbnht0!iuS(5A4^v=#xH}T-ofQ~J5%pBVIDL3XG~piV z393D&nBC{quNXiIdS8qepI&3n_S+7$ZUrSnd^EW}D~h^X=puDE56Yo?C2W5$W{ot_ zHD~cze@7}_yd@GUd%CqYVS#Q5&!BBTT}w2i;KlWqeYOcTDjYxIZAR=A2!$pFKBw-} zl;sxgZA${trk$=9Z8mBN8l9H4W z*;AQSLfblR~~y#6mC*o|?N3h|o0%GEg*HqLf|h>u26- zj*0vEu9e}n;r{?hg+z@|JQ>3sPrJsUweEO_j*4ine+zRfxr@qY$8UV5&FCdLz)+@- zfaogGN~|WNqnv&@*7RXK+|6O*QzI$k#dUvYe&Z~WNtL9Qyl;QV?FTcy55x0zcNav2 zOkanPunxq*^~%CaNvI{NX+L7Rd9TKl<>+B`Zyf$1Wy7 zi39k>E|hH(!mn8U>{7GFSJathqf6Ixq~xhOHq}jiZ%o2KFXUX?Slly42AKd0%4%$Q z$Mf%WV|jdt_T_&)hG0D<5RI6C=Q0{H88KgpGOny@2R^M|2lH*z6~Bip!rutbpoTG0 z6%u+x%}fZC2uB}@{Ly+85>OvLQYdKWw;*=kovYyP_^eXg_M}c0<)#{A(p*>Pb<0Z> z+8O@d z`aYVcW$f+x)C^7V8OfFK$b=e7Xu@67XF>Dv)FO_pZSMK+rf_jVX$sM?+Bq6a z%El1%;HrPktDHpZ^e{(B@31*Dypc?vd6fw%mOq+Y4ZG(`ynM3t#+!BwRMmHCt=Kk; zLWJHEqmNsDu30seNYBv`oN(iGuVLF&$6Jn%xIRnc4KgTviwy~v{!|#GCTA5|K%V=R zTIVeiI>h^v3VoA+4Hio%VgaS~pkEiJ$UDx(xTSwDq1_WiGCx>+53|W`Blk%3a?td! z)YEf9w5sca%#R)CBi@*M#dzN{XXiwCU`HMkvu7n?{y{47O~Pd=t&DZ^+2-yXy)vs^CM%MIn& zoXSN0VA#ZxeLo;@CZ;2#36(8)?7F#TSDlily({eM&C=_Mk$W`Q5bfGo+?hj%0cJTz ziQcQOGqj?WMPSG=^B_EK_1#MAq$GcP0oQ?xS@SFhbHLm8TCA&Q)1`TEwmJN50mD$o zC58elDt&Ki&X|_6nIO4H$}>QIOc;gJYC&cpCeU1S+{bAr5|n}ZW@CGj|9}E{uD^p} z`wRD(&#b!6O)IB)4CPiWcDcCFp8Ac?V1B=~-)X?rOMq*|t9tuW7FgHH1KNLlpfyFN zy&~SBdva@A-(m=RK#afRIcT-f$et)(!N`@Cs4!0%tDVMzPaO$djk6oc23}hFu?f*x zGx88=m)%cSgz6HczSbdrgI3^~t~j@i7nuDXIrDumrR~(Mo+vNbu~u>^ytZZK+(gf3 zV8)dv(`(C6JxcepWL-is@)>`W5^jTG-E&S)OfR4}Pq;zPo4++df1c?d>BEMZ=2%|k)%+_JkEo9?@wyK58YX5dM-iP9IQt!SW6&!5D4h8-kZreV-1ZU z1xo6j_n&EP$cST#d}s;2KmRNxI2+9+$nt#qhImej9X%|VU7*u*L8gp&12s2pT5jRn ztCzHGT`3nBRn(m3xA-xsktvBM6Nz*srJO$H7di&&a3Ks31HNtSRi%3km?FQUI`)W# zk;|Ox@)XCVHyMA^oa|)8KO%4cvMCc+*dVG#+wxc z__jk?O+GJ?wFPKL_T(jqjlomP-$-Gfc5f5{Xc*YDlghG)WYLrKUgh3hPkKI&9Y-TxWDNka+8b4=@UPR>kOn+M)zr}~Fq zxR`H$=M*@X$Wm?!DU+)Z`-8X|Q{WIomC+bVPNj-3HSZf9CLmUvvGE#39&5>JzI0e_ zrjfr$ftip!^c!*c#Y9E(Jobfn&g%V3Jivc&$v{@;$Fu>5OzVN`8ec%L!ADl==Pwy| z{68F!-*XIV!pfa}ZV44HGsZem`RWm80l~bLViA&Nx4R}%x-a1;ZUkfmYWo(#z1R1^R@Wtl}#)E;`azJCIWUe zw#K)}GN-XQmeszmSiMJ-Smg@04Y_~U@|u}e>yZ|@ENKUbFtk>i)jmNgvHa6riN7U& zkL0I3zSCRsW~c2x*3awI;;iCQSF;v)J6Q`iUe#TD5#aR&ot{P|YgZRp=7)f93-gdR zcXMdp44s+w%!|%F8$=iHr9L^+1b!V#>g#o+T2n8SkF?g^tb03G#!7_R)N`G z;XeVGpAfN+RX?0x)VB7%|G{yOk^EHfvgg6fzG{++@!MCeupCNQ4P{0AeMIm~Y*ws< zXNh_Lssa4wZ33mxf^;m~#UGXfk|xV;?#KskdG)#MMMMnA4DJ%YXj8vFYl)1*MCKla z(N^**!Q&N{$5rYVdlluQ4_We**V2^x9Au_)a${6;z zUbOnPK>nBA-o`TQhiB3|n1Mo$hX|TKH>c%t@yg9&T^1EK$UG!47+x2w`}xA2+;E8- zxnmD+PdjDmnF9|vtFSmJA%qd9hV5?*sXPeD{8F}cpJYV)b;p{)wx)kV#juRrb9Zuu zO`C&0TtqzE@G4HMdLx={dG)$W4_q3wbL>$WW0IO;STr%^$C%p6iS}HC-*tJl0CtTj zHm43lCLrwph>MyOE!tgb5tF4(!jn1skVb$^U<{OtLI_%HyDgrOE%l$`R^s$0^fI_~ z<~tZ~-Bhp|O;k{@k7s|9E#Rl1T-FX|k*+J7_#URN%`t{`?`)dui%JzDrP3|$r*lt2 z`oP|Hcl>^VtzD_{tW7!P^41Q&-#gvl{uzX3amLo}k10EEKVT5s)z`b%ZtX0nW*BFn zz-!(yPGhy+AH;Ll^gd|aP8#JSt;~De`8a@y0jv;#)i1uHc*TD^OogT2Fy7UU^pzW1 zN(vz#W*A~;9iUwg#vtkKY>gVlz+R1NCb}b5AMvT$s#Ih(2xWeo5pee1Da{guKfj~Z zE02LR6=1!yjo6`jeWB$smauotni>A(T(XB-(~j*+YH%iQj3{>xPLv&}r{l zpHW^7E>|<)sEL17Z;mF=^{@=YJ)3%|sdGEoV6H@ux-0tRncj)dnVPdh}A^ zMMidXXn+Qo^e5J*bDoNRNwZXRRM}b<)0#i| zx`&H*c%A<$Z1qbx4x3#Gya6bHUHbCcp?A@hza+SpV0+tpAUb)>l;};{a7mc6&^*(R z7Z2)?K{6TNAcg=d$Jy~Q$)AB$6itiokI!^%RJVVzCc}36${NMCE7-RFNh z`vjk{yA2t56|Wz)!z+tefk$-YuNatLs8Rw7&tIyM8qX2Ne;1w6=+eqEGS$bg;%(yZ z>Q344o!Zg%V^5kPnMGfIZ;Yzglm&q-9nT3grSH~taDUe0z5TFUK&kI7TejbaLH$Z6 z$boBIhxx!)2k~%QAju)s zS16(J5UVxHI+MPQIRqi^LQ1^-0?&mu((ivIvK1>GbF*;xtZOq)+bQ0F$=0RL&sOD{ zxll3otGTU@h@zqdzQ$G|6L$@ETL}S5rPA6dXvE?%}EnJ!Pm(Yo|%PA z7I<5Twm{KUO>s|4$s7CWl`qi=LP%US1Dbv^p!&fli&)CSKZQSzU$u6mI$mwwsAqp0 zh4ljckVFXcsdPM*0yfN0dln9=>vtu`$dm&sF{Lf}=kKy924LMJCj}VICK6q?oqX#y zB0Bgca9g{C&EPP{(fQNU9pkGOJ2m18q8R|8s3tk^{PTvMDvqkvxu4@DSeqJ zq=A^<9(is<_2er8T5im9B_0?qy;6pzqz%gnVbsP*HB(D*EIDg0Q|`V|5-@+lPs*q# z96Q>3ilUd94L|g{cT>j?>o869^ff(d&`ga^sy9TXyFIC=UYaafV05PI)c%16NsFZ7 zU|>wmY-b9an-3^ zz&!0p!RU#_6g2sC7s~;KQBL-Yf%+aN^+U^&CXNJwkLk=lT+0L_;n*wsB_(v=~#YtMh*%{~hCk6T)?a zf#Q4CrEGBa3__Jou3v&?-d8F{+x~Qd>Rj<7Y2u~xW7qd947%b*bdpG$AO%_MK~~g? zKCb7kf!0CX6&p%b^)YVyM~G;yx^Fv(CxWO;s@~SbBT#O4ygo9`vo4gBhbeVNn`IZ9 zyAINJ_5V-=A!tm#N+f?!2yelT6W14GfQ0*_$!A0A?-XrI?6sS{S`kVsqX|Q%ujXy8 z>63>O<+G%qe%?oJ=i&NjnKNpj4m(74jQIgI zI#?hjK>*w{k}XrWOJ+ zGLu0%D3?NB1s4Gl&?--*TqWPT9t3`p&*_k$~CQFtlVc0cwm=s_~k> zvuV6~MSlVrQ51J`SbAq*my`s%JBA!-6M^A7y zZ962igeDrz721e%et%1=)Wl?X7NL+b6Ian537DpF$$4%uR3W-(ZJQJ$u`JUzXb)P` zegaWY69aR=5Z;k?Tf`%(fLSy+GPj7cIeOZu;SCrXsg2=&IlH9|_$Ia!(wT*g1A63oibKgF)R{0oh?(1KiM;6PwhGK zPCd=YIceSziKTIAO9vKI7kEb`g2X-U4OBBe@-C_7cn36}XhssRBhApD8p)TTM&5Z~ z@n(wAlQEgtseg$g#u9b5e*AH(-T!tmZrazQ|O1Hk!MAC>>n*WL-^LFX1#n7$!xrdniV6+kJxTiBAM;raHOH`Lp8Tz zd)@tv@6BemBH9pjYPG4t8r z(VCn!9oF0Knmp9#t|#ps$>3Ln%IkZP;WozSW`AiLkg%S0x;N@8R>-@Dl7N~Dwa32E zcK76>VtP+7Dnj*iD>gpfhay3*P$d7sI?>~3?T#ywEYP|}g(_0jdh?*V68u&21iJ}& z+UL{r%L~pED`L?;K3^V=r_FbVqsjEV(c3y~tLE?DeVNZMW`Ay5G#^h#7hfiav+eWg z@qgdH|DHBA9gpVc)8@yc@zIe|E-Mwr^f^!}TKeXXraC3GoWO8mOSz&lG={q5+eo`f zG=@IWm5&k_c0_$g@(DM==RO)231FZ`lmAloI5|IiI+~B0@1Fjd(ifv5B{Iq-@BXCB ze<}5SpW>jgiE!gNIzZZ^F{de0X*6-{V7B_r6k;DOM+O%}9Jqq~x1CI8Fr|DGg6x>Cm@59x?= zUZFy~-Kmn=EDf&NK5(e}zkse*tA95bNFD=F88zL5Ap*(sm}XwRYQHc~TuP%Z;l1tCuO803_$!w(Ay_ z4Xu<0b1fDb8dI0N=}%j~X=V7yDZ^!C7*eN5g75=a&x|bAPgRgk$!J zDMsNCZHFS3CIycMqMa)vU3S~#;j(5*Q&va)$#RF*pn;6)fGf4AhD`JLa#U6+>&j?b zZv|!2JiI2!YQ1h@z(sNvHD@DlbE>k_)On(Fllq7{jPYO8ETA}eYib^6D%_CCKK52)RZ;BIncg2zd z#0m({R1Hxx=%{$fV5vR1z{qxrK*9%>L@R=jwj*I`2`#?1wngBVH3mxzCrnA}P2k-n z2AeZ8C*=%*^~5ZuNY2a+?;>v~X<@K0yRdvWuCY#JXqI8dr1-j=W`AYcB69^wWSM5k zCTu-JYP{O!`+KFCYP1ta{k)D>nLyX27F{b}UMJ=*Q9hTQd7roW#Q?*5O@t#+o%X9D z?1qOzvxB%$#*e;H<9^4HZajleuW}3QLTs! zafXOrbW)&6-7!JDVt<;s#Pb-M>-DC@nut0xkQ6Wimf3cIY=A7yhb%Y)H6bs};@sakr?tw|nZ1$1}ntx{+rU;dZ398DwXB8y_ z5Mf?`vnSqAdk)Yw2tFDd>v~ckbYzWA779T!XTUyYKw`^7WkMasAFD(*Jwbc8IDVT3 zysOGS-JB&%0-G4;A%j6d4&b9QE2t-aI+ha{K9uwnE!zmK67RM5u)&wuIhlP|7`I-g z`?{vDx0C*?{(t0NV=gXDm+|&DJx%6 zEcyFsEdBfrq`71%BN?E8VA<^}v#9g;3 z%lHC&vBpxANw>gJEp9z7qqWkcy?kBwq%a{nG2#qDpnndP+F@v+LVvkyzVez`9H$m= zt1UfQTFStuDkb2^eXHHOJecE=8|_y6%jk5B3`0Wu-O+qH;Z$H-X``Hkw#)h_8TAKtyb++2Sj_RlPlh5-nGrTf~ z^yJyu;eYw($=Na9okI(cW%x6^MOSi@-yC@!)6@ueGq>8OlcS?Cp99kFexp^|5fzJ! zX@r;Cv|E6Jy=NsRy*3Ddn4ng3Nano(OYU9@94Ql2t}eZS8;}-lkq;o6O98%#J#chT zQN#qv>%~Y1#q**F2s{H+H;bBJj6fC$WfipudVggN8HZAn!1E$iQwYoL*9fg57qnOp zN|!RU&;UUX>9k0ooM-rT-WQ7wLh<8lCn|H zNq^Qu#X|Moda;m#Ge9XVf_(G{$^~taAVfDI+hT5g8EF%@dk0}M9{DiKd5#=+l$c5& z145}INf0K>qM5S@iN9~ z2L|Q^8|z*{Na|&LB}*k{tGL7IzV?!PQh!ERLj6?A966Yi(i%>*MKnAT=AlyJPp>#! zEiD=>im^OXaxQj&qKl070v)A{$u=z@N_{!bxv(h93QHJ?v#uJ_ead=YQUVK`w!4y_ z1>=|#P6vQ%P(_F{5;Bb(HkXl(jBFPNrN}vWK&S*4Tf+Ak%XBPYvgAG;cp2j)^ndVb zISnPJJHAJQ)q35+fQ4VnTFq&0#dw?!@$2ycsd!9Ct#M}JIS=K8f>U%3ATt<|frF;m zr7C4i8N!#4B3PR-4e3JiYwNcuNubhV+NP6l1-g6<_tb0mdwNs*ZBa4Vq`YR5g%osi z0?t8D;;<`sUpR2Bv{=Rza#%QaDSs;@WbLdY&ZAf|f?=&s3H;aM!V?YzSQoP-rZ^Ue z2@z{tM)=w~7Vr#5nU&037KD9Si*ZCKVJviMiSL@Sq96x5 zXd#s#w|A$>?tVYh;0PEf@J=ahLDR&m5&t(@=Rd~KjiFt3ydlZC*^l7GhGt?tfu z$BCB4DxTS-3-A->)7MN8jYt>_< zC5jbP2rmU^TsSgM0^+!c(+C-76X;=>2FSDw8;z7JNRqK(epvwuARH2~f9O7HAO|M_VK(T2 zaeO=?2l&cN}Y5yY-eW)!^lGoky=7YWP?LBL}i~wYWB^ zZ({tF%a?kSB`L``q4fdQ0ah$(BuZk6;NP<=sg1{BBFnO9BLAHlAAj3X0;_N+uMm^6 zkqlV`Lb4?s@=N|i00N)NVhf`FvJ?arJ~Sc}yx{<&BAMI)t(G12AiT$Q zPdR>kY1&-md8Q9L=DSP z&f(k_C048;eVRl4Snh)l6O&dD_1EfrA4q~2c$c^$PMtH7{cHnlg^84C?^MG zn3-{Y+uc9mOKz%Q5hV>qJs}M5PP$Y%SeJ#%T~*lyO1X0>>2FoPiWUF4n*bHwl)8z? z={jyoYt7@J!lFfZQD!bi%LoVa?L12GrtTG5NnJ|co%JFb5Px6K7awdMGZLdv>Is)l zp`6(}gUhpk!)ZxMvcpj&&O7ARAaH69xWPb$6HfnW?G)gEEON>Olhl2y;y$}r_BtDCa%XL2Z%H^ik<$r+74N)4bjEk&timi-XKbO%y za=Z}B%G}0RB62na2Y?&DAj)TOjS>QSWv2;hL2*WaA|MmH;vZ3%DoXH`+r7=l+z??f zHFG)5XI~jLY?P6V7EFcFWV>d&nAc`_VhAM8P2~D8<3cbg9Nh>`j$a6o+wWW=HG^wR z&M?g4o_`_BVWPoVKzWgXXZ5+fsWF%MO7at=f*Y1UU3htJ)W8+j8xy^Ek?@-i|E5j*dz?8dW$4gw|YyN zsDI;k+){9ifm6e9-%{X|(&0ol%4wu2B`(+;-p0Xe9!YK^;8)n_a4dv)GdY|;L5VfH z0bSltVUy3s0PlOq0FK}@vP@s<$>MDcBWD*JW;u+**(CoYfK;UnDK2)+>(tb!G2%P# z44{axjW1UX)>*h0gnVX+KU(o_hqPpQC4b2HYOM4-k2fhCM>K9Z3VlK$sh1LbGm(#M zai$+lXYTG%GL-HU@k$MQdsj+n;UApfQ~Hie(RJ^uail0Luo%TI)UYwdOarA!<=l|_ z1)j_-uwj%bKI~xgDE=V{rNZLD!)7lL?$?%248~EYWU89U@Dz)F%s`vh0XoOQSAUti z7$tocqGuC43D-I3H3-5oL;!DB$!jdJgzhA7Y%S0qC8RZY?@HoOI-J zXP~d%89yD*4yTig`T0~Xf91yb&3}hCA3yH?>B;Wn4_Z;j$>@02xcYkd2a4!_Fl=`D z2Rq2%e%fju%?|mUQu3o)?UT{PPvgn)mpSJFTP-iceLraK0eB6E@_aELolFiNogJTy z8v?&KAD{lpceGpWhcb!mpj-v>HS>4vqxNz8q-Y9kqW4 z?O}U(esX@+es0I@QG0aK9-UuK+vE02`{mokm+@IUY5&olw5RP^d)}U(joXVBe>gJb zrP_<}baMW=owl=f-p;>F$K!VXuk-e@{a5?7{nq~bdqI0=LYvjL_h;ufk@4yK5BocX zjAnq0mdVJk2H5;CWK{VYGCpaawmW}B#@#|fAzvZf3e~RAY=}^6$P_mr)9bzWuO5E@ znf!VxIaP$s@ox?JaDOUUJ4mHp`l#ehPN5#ZpREWtR zd+3y(SGXlQk3T&6+q>65Ck>#JJ9Mmn82L435S_F3YabcA2{KQ1-#mM>L&$$T*?Tfz z)wC?;D&|t6Hb4;<2PtxNa(+HN86V9bPmY%l2Ui}- z6D;>)Af67cJ{^mZ??5gd4!VDb1(4+v_suR(Pw_W(pC_}6lhL%O9Sp-P!zsJ+_o`{5v zZ1w)*-H*FZAR>Q5e#c1;ms5He2^ltPyTt#4ijxQqLG7z)*(%l>ne!JPK0NvO8dwk5 zK5IoWG6kK{dPawr|I)0dXJ2jm-Pbo1Oh#&d%QsWSzQGeXDLd z;!w9@Y#LVmr*OewC9B3N_ck)uANF5<{Pi8976z|{W>G{7v6V!wz2jt}?s5=-<;q=D~_h0-Z zHJsAA?fCR!{%tm<%Gb$^e=A_Z!rG30P6c;;U3L6 z?wI|9l7GT)IyoKpaofluzx;Xc-MeSNZNMZu#*Kf?+u$Xohrn$(^Qs)^JdUVY+G>^DCqh)WoglyF8E zcQs)?VZ!G`O2QP=gyWa4l#alw)|})9Ji_q_<%&ojzf^*MNQ7|h6KqPVh`_57jNn_Y z(gYuB9E>E~r=Eiyf(l85M+8&&CMAM<0u2x$DFPS~3V8zGbMZNjPH23NgBAEa;U0FG z@t{SfTn9%j&G!t4Bhf8IaX3^EbXF=KT|#fA>!X7{-e`pcY)Fqw=ly#JqNi;_puJgV z=Sh0MTWqs`&Cbc&*YOIU42Fa8-S}NA2=6rZFXLHCWbs0?x%ojpogw(lS0;e?2Oa(F zKqI|R))~=?I?#%@SIJ^F&xq>@2MonLJ7YeY>16S8aoHn z!O+M&-i1j<{(v~mlHDTxdlhGM_!93RStctq2+JgYO_Ohr@e)>x^E$RY#<(=D{PxQ=L$BkP>mBv00WE05C3GNwK7|S*>DtfCRq6SNttu26LD{ZRg1v7VsBf;$aON*sK%S!ZzL|>t*saEADm%23w5T z<^gt)LI#iU4}6Co@C5(vN6`Wj9Ih>J{vzC`CAd5t-kdbUpN zl6IqxQs7H?S|jhRU~n;LBfb^3Y`T-~+Y`^}>HMo+ba8cs{0pn>Wkq*;-c$XXj!X8* z^ikApUtS(l9tpc`~&&lvf)Scdr4BS$GZn`2l zSuQtKT4q>{qzA)j*flfF&=PgcUy*ysab9PZAKeZjGtCYywWg~pEI%f9Uc>Y7{JP&9 z5qAp57ud$yyJYycR^$F`*jWzx7fOd%YU))RY z?`AFYYd@YPDIUT$kLE<|V0&jyZ|0vZx!vC4Atj&k2am1)CI$7p@t#tryb)DT;%5KU;a!@Gx6k)N9uHG3&lpM25a2>b^-t@eM0H zEVjZ#|FS?W7FsbLp*J(9F!c<_cm4yl%ds+-!N>#?my-krUQ#kaG&n>>Gc_|aMKCi) zK`=x$H#IUdGej{lMng0>G&VjUJTgHvI7CG=H8V3sFf&F$Fhn&sH8L|ZL@_Z&Lo_%v zHa=YnFHB`_XLM*FH8VIMlR-Kte1>k$$d$Y2D!@7ck3koZ)KOl+<==v|{ zq6jJ|;NPm)7!yoPj2h621PYCbg(lh&Nvx&WgsoH(V{2_?YiXe|D(*QnU(TJm^WMz7 zT{E+#z|4af%&M%E3ad$yII@aVkSY?9TGBvLaQSg9+rX!UB!I;qYHS5re?wwqEs3** zPxcY4rdoZKq@H7Y377d8EM3%WIZG`ogSGwASRJV$39^o}+@vpuW#6c!jChW%B$cq< zXPRJHXyh1A^wrUo^^EAdI#o!Qbgefq62-hnT*OnyjWEa^@_K*(JNxFcATUxe{ zWXXPVfE*-;$YFAX93{s{H|ZhA$qAApz2qc0Mf%8Tpg5ox^#gyue=7|jXkSn|gP?y@ z=`4cVS*3FbW-62h5foo24I%j2s&pP7CMLM7cjoR}hVNDqThNWLhbY=`@809C@`A0=OR^l=ufL@W)VShWj^Zh`FTw2m8ut=a-5H1|JGFF*FJ# IB}Gq03QyhY^8f$< delta 36238 zcmV(=K-s^nkQlR%7_b-te`WGFY^1SDHZoR<6&l!=5!yIXxRpwZ6a?x_=p-nVo2`_} z#{X76n_l-oy?+4WKOy88SGd4j6Vx* z*=nuhvd3Q&=MDGU6Ku`LMYHYObGHkt_GLeG<->U>_B_xJ?I^>#|exNT6i2M!G!n)4v!jm$Ta+zS5?3KB=hZXfw~8aU?tQEaxxnE3u!bOn#* zU9qBHLh^z8NBuvo=$CM6X0q@N#=eh3lq(rIk)_(xLMu#`Mp`)OKEEB<3najHwrcWb zAFQ68Fj_uOdFXyDtBPCG31eqGVRA{sX)LW2=Gt=@&1Hkpe}YNdv?K&GpZerY_@#r> zFw?*E5D{dVLVxn;p(Q}N{UDt~QW_7-MVGCHkJ=k6(C}nwF=r`9HfCJW^ye-l-222P zi#@&&>| zNM|4RLXsQs@RoBY+50qM| zKqnxOS?ogD1@^$EW^3Lj%6*mN5-d|94Xc@K1qlQpXudE z=A88eZs!_LEcl}f4B|1s!UWp4Zh#0e&R=TI*2pye`^r{;G$og?OD>2vpn9y>r*a2X zdM#+If&@+f|H5V+qNNB0#6gHWjz8lA)$-=whpaD zO@RImp%g1E*$$ITwRO3JLn8V5R7ZX1iA5=K4sIX3x@R ze+Jv+xKMpy1lTDyY$(q>$TnKQCtUeF2^b3qEUEJDQ1nCicA~M+Szr*Yy{c?mt9^Wr zXWy=Ep(>jv_&~cEwCVIpEKUJ@iFBu-Ai^>zL<^;{s9F#On7Rf`iJ%jPhN zI@eT21FMFs&Mf<^P+C&C^Z^II!P^rQe_<=}e{DVN-6CbYkQEp^=FbJU*qt_w`@9ZA zefen>@r)H#O?9$gvB!uD{}pR^=0$S3HDLC?lSF9vrUnGsCfQ;;_Y|WlBTpc{odGH8 zz$>6W#pCpcGf+X`HioVSFz~>*LT&aiG=MOMYf;w+5sp$7MNO-ab@K^8=keUoe=QDU zIf3{+7R^QIO7PI3-@>W6h0}h1af6!}kf(~5c11O-v2#wx$Hl1aUqNj%Bhi{uB~0TT z%h4UHXJlMJjJ>^>L6*G6HvnK$ZC)cBUZmNy0HF=t?899RtYk`udKkz^Bz z&_Xy7#1gz>q1dwvYyuv&SNGh{l0pr;Hecd|a+MPT0{U>e~>^~R)j4a zeIpD5z^Q;pT4&&gI`5viT^0F044=a6K-~yAzE!53s_>n6v0(m+fqlNGK;z8Scb^Xog`TefT;!owHoNM4`E0)rLfXqf2B3p0c^SHAB(O-qgUtzX*1HG0Xep&*U%w|geIO4u9^ECSJLes zC&HJz7Wpy_VAa5((GNH{zX3s)Za`s@83>Qo}iJ!k9l(_!kcv& z-mE8fvwV09Z;8`G5G=Sb=mjgfV$eaHC3A7sX zclu)tK9&LuV^*k4c<;x*QOp+suKfvQzR z5x(!QXdo92;-o>u*y3`^UH6Jbxw4DkGU-ao z-#7ciu6(TeJI<01cmH|&mw)H4Xcl~xuGZ8LZZg;YyY6ny6ieRUF`bmYT!l{EK3oCJg(*)iw7+|5fMO z=eupwR{g^rP4=z^-qW4_5HHCz zH?9+Hpp~M2AQtIF5TUZwI%xGnq^FFe8I5!`oAYT`FmX!m)`DlrTNE*;D%n?cwXZ(r zD1TRja>U=h&Fk*IY~9nY$v3Wq(zWl$E*ex2mdeKi$k`-i-BrJ!?tF``FAtzw&e9~W zhi-bDGt5sDspc9ea(|o(<4Jq81%wo6(N^W|r?2*9bL`#QuBwaD)mOd$?c8ru?>@Lj zL!Zr|4;KtII6D-JNRyvn9N#VXKpI-u*$z-q6A~H}kQT!fwX{=&if*5`y{qW~fz{p` z1N4q+Kxr7^Wr$xRkR8(T5s>b_41jJB=lU^JJdZAJbEiC9b_t@Y7lBUmhuCD8w zHs6-+p~w$;F@I7Z)>zXGKP`4gz-~+2pu()&gc**y<~Re86N6PM>ZM62sF*UD{HcTw zfgJ`z0leAn5zY>^GC2UktLc4Lee?q0EF6i6lw^Dao9AGt(4f+kViQRu6`)v-8g{}? zc|=reCKM48ei_kBdndHbtJ+$WaW2D7&v-|~!K1Y0p?@vAvc{Lat8zvJzg<^t>pi{$ z&l5w51~_GGLII6UjHZMtJv4IWs~r_+{6;p||9kgb)w9=~XU(F5hN5tl+crNu#HIu4 zqLbymK7-m3PQYwZtK_FU!yQ$C;u$3zeM87)URXvYb%P=@j(m=N>1v(Qpb~#|3VH zj!R@?hj1?ymIBp*hn^X=^(R~b)q4Jg@}?^A>7nVHy{iV%K6CG^;`tygE|Xo}Zp+U1 za!x!_Kxm*B;#sU4AT%~Ox(N(J<^5vNeg5cG1b?+2e8z$gr|3Se%3tmzIIDL%{}Jf$ zbZTp=7|<7+OXYQ(#Ee<6_I#C;=uBS2Ex#ek5|<=pffO?KTF^9kK*b136Ie8eV0Vn^ zL2{C&feYi_x5z92ssyg4APyojF^kX^UQ-yg3L3qMu2-ADOchY5H&Z)R2UwgvaMW>M zx_`1$H@>&(#wza!s?x79Zyms~y!C-t?V47#Z{jddDJNp##~^O8hN7U4x;btUW)N0G zC`O$*zym6$%V*$MCi!c*&7Gn2Wj91QQ14>CA)YT?-`*Udv?&8SJPBkNQJJ}kIph`Q zpn4t-TeDGKjySyotgyAjP*h#z>;c^)IDe<5kWM^pAZM&U)>Uu4E(RHy5DWVW8e@3b z?0xtOq1~q1?pY0h;Qe-xRlZKYvGh1=LeMDz%UAfTddWdMb{2r<6!JYWNTln1ax0 z)Y*$z7Z9SDMGv#>i|Zi>VSXPSMnOOv20FKnH6zE9v49=Zh^R86ffmEz?qOr=H#^|C z&4R&7FGmcCgbKpI$Vz~DQ?(RGIJg9W@la19yQ(J!D<3KCF|vzPB(n+siJ5Uh{UzhdQo?WM zj~5q}N0Hz`>sEWqOuoOc*kA}Dz= zf`Sc#nsLB0rwuwNOw2=vQDMSvxi9F9rm&yVm%}PPoprhZ2u3*{R;5Z@3#;gDAYdsc zlK)Elawe#k7lV2QyMNx>aA2-sO;iVP)by$ z{x{3KEt!Ta2ysSLYfd$x!fi-&=5zDjw9NtUW|F4!SAX=9r^!iAK&8PV3`wU{l<)4C zOz_4~iz!bcdNGoQVfd6HG3y)CTqdMrnv2jfY40RnR>GfrSAERi?fl&(ymHqwSUTAE zW2%9eC7UcRhA3f^&+H=eK=(ywK2!Ll7I)qas%DhV@2jR+ZjSXPuM3-1W`IW}!<%!k z#SSLkV}GH=y1c6UE{Zf30_hf-9jGodm+Cg4Q#A-#dvp zOU1lSpPHw~SD*qfXZr}8-u0dT%C(#l8<=s44ewp~{#Y05fsLt6S)0-EnP`oru!zwQ z-ABQ~rzoI`Mtl%@pX4bJc<~yz@U&@r4^lfIunn!!n21AC`fE z0a|;wM8DqhF)#Yv2cI1vmA%BBqwS%wafLKKdV<3HhpLF(kE<-aQ$9pyYQQM!UUq}3h>nS>>fD1xCsUyD^v*TXvBq~%vZUOLSb;~oj)Bj$lWS^ zp*i;3royZzzy2}b)^0OwlY93&?TjMA$Uqnw{SsHz5a2SR1l~QO_-Mcg3IaQuZGWX^ zm$Oi94=XSp`Gkjnv1a~-=LpH85${$prpZp@KK=#(N;9&z^9>m|f@rPaIkfPaP z{wfpx`WG79w|Q~y?1e$tOux)w9}pt!-GfGU`=`<{PBet6#kOyjY^k+7-?sk-O;h+r|}s-(Ml159K0WdhSCS z^+Vj+X#zA!;Y9<)@dHh9CBhP^l9Vs~^*v{1co}L$t?D#Ik%wIk$>BLO=lUJaA*;=b ztiHJ+?)Sz0&C^#jU8QlVm|ERGtSINPR>?|99WyRh_v_W0s43RRYMoX2=i56bM3mQ6 z+cjB#S=}-nb!~imC#Z;C-6lM$8#|@Ay`#~GTb4vcQDEzV!vv6RJJB&$10<5W7a zcOWoM1Z?w`qCjz6;g*hj{O>l|*a!6k{_^OMHC@@2pdovmwWx^}Wv`>W%(`OjsMbL} zz*we_)dOmti|EB?OVZlKF-P{6JFM!INlId-2O1Ay9&(~bo3K?92$nwy`GPIqhGkuZL`0MxtK&vqdRgV$@ydI>@l@_EKOzfkmX%#hy5$FWh)v} zeQDJx#IwORhKN^8Xghv3xqxyq)NloZ90!;*(vwtUf&nv;*rzgB0bV#OC<_-|HHjsi z*%{ge>|Nvo5D_isfxU4+sx!KxP&FGofqMI7^U598~p5LW`FkCr*fa| z>{OSgv`JHN{cx=E-W_H#<`nX8!XFzXjUC^-yubP94cZD>(UpK*3#wN#k+CFVmG5uf zyd|qOJp67&Vh&OKqnWygKNV{TN4wSQo4?OUD5_Qx?3C~&3a}Ov(a%zUfJNx#MVu!A zi%a?S`!L|fPt_tZ{w5WWg1}=PeSg>$=%gF~MdtJh9@P~4ta<+|Ab83|tViRBUGr5K)q@0Gqiv6<_Oa8(p`1MCwmQ!XMQvL(`4wN>w52q zG;55BhG}hox5cq3+pf&B9Rwp>J@J>_9-1QagSa?N5a#g=#w7;ExwOzbt9!q46i4_I z2e29}g-JkTF6MpRD<+_1Ty+B0WoP~bvtWOkx}=692x`Y&hhq|d?J;DPAew3oN|r>8 z+JTuSO5*_5n>Xb{6!X>eTt3MM9T zg@KksLe+L5^x5ox1>YrUEY*kwy@0616lwt4(nGxabG<(tJ6x(xq91P)Fwo{!sc3*V zT1T%D-h{lD0P5Fc`jRAIDLhWJ=;wSNtPIjA_Bo}Xpr9Ex_H%%OjtQZcC=5{i#~_7- zd(Z&%HtxsA+%V#g1haAp{P$p14&tK$YA8M#qQ->BGi8H+N|}>DI+=jxlq_jMo7!u_ z=1B;zOy&3s;bBhHU+))jOCG_^7xvFV;73SM*yp?tzz>fZO?+g><__pFVG6L(0OnpC z%iTOSV)NskP8ekL3n|Bp5^F&=mp?e)v`z-MJ0Szu*gM`LMbhz z8tbj@*o5LYhscu-0(;psb@L2hg%H!4X#fR?@LZ7%*0*y7wZj9G$_#LVgBi28x~8r+ zi-6${(7lrWPSq90Q}n>kTG9E)Xy5Yq=qvoV4W=)!4-WOs5S|GMe%cW!aP}tlK0iYy zu^!@o+_KY29t$G;IG~>ofF3d#XeEGnWI9jNiXbXUD7O-!ka!>hkbbv4D)6Bd zfr0`x!Tb>5@pWnL4t|BAUx1tUDrMP;Oo2j{*%>g-vOwWLg+0o#)O~}D?mIy*l0a<`Td_Q#yZ>uok(&N3Z zFNjmcT5&%fQL>2C1SF*N_X*U_(4t_)DgDnv^f}v+e(;;uP>+kCK9L!yS5(Zhfuv`D z1SMzsn0{MqLav;!>bt9wb>P2BrC` z<$I8LyayG#wpip~XZ!T!_2%^30r@L`^5B0rb@AUcb&1EPu8S5$>D;2!6&Cf#3Nd6@ zdXWu>N-5$Z3T> z{kRYGU`bs0=P~$Ie^-1eJ3Nc~eEv`-ab?@R={UN*6N*Q9eRcrMgtFztsDHMtjhe4t-bILTVN00cJ0W{F4eXg;61ms*+I;vsEQ_YA5YAop8Hl3 zY`V};H1Q$R{1ApTW4(mIoG9rhkk9^LnSF-B*ha}WX!t`|#AY9JapZTtbUw($pl1`qbjBaBMd z>*D%~V3cPTEkGFIke$+5Ol?cki-c$Hu2s{=@S>e>h<=k$}-M{C!R=9guCo5 zu1FB)?l6B{+TOCdtM~n0U}Cmjw{}8iZ|v$#W-@1)dstyb6;x(uu>!v+Iz%D7IWO;T z{teqYj8+O|Ze(+l>nOLDj#gcayeCU zoJ3VQSU!x%;qKTZhvCC3`;gzBZZzhBS?qG9+RcR=U@$bvW`PAO?d;upCX`~%`k6J3No8j5RuPyw4_6E6?R?W-UoC{5zvqTufBpRK zZ(qETa`e5{%yR>i#}8lAh-?MNywcqOm_^XMw>R~nE=;Hl<5oX3q2SDN(T(^jjga{W zBP^_}oupAerj^9Zvfz{-jatCJwlr*)hUw8T&4TPVC~1HRqXC8~8@d5M6t)zYfCVHA z-qWCEff~(}5I_vmL1)Bdd-qH_e?1!wYL3Lt(@mWo+EcZ`M>k(q`)b*ouB4y;PA}W_ zWb|@#KA!3WyIN=&=I`=JV0j?O2-qJ|rkFC_2HNd@Q-AE|R!YaYl~OP_(u7a%xzLB> ziC(X-#QeNlo|<+?9o?v#dbcbof^eSMAUnqXy{uZ!j#P{PxipVtVi@&pf11XRSnoi> zVWyZBN&i(rJ_?@hD4ov)$i1BCNk*+@Ld_PVWze(=^lD~gxMWdkVo}a_L`|5;1PE=y zLwSdXo^jXB$9Z8*Aj*QRjK>xIfr9CJ>-`ZthYFodBLpKa2}V4d zVB{UaWV{rQ;U!C6#g7Joe{FbXw4W`cVLl`W^|n48n&q)DDF+MnO!+_q|9$1v9IRPs z0e)ad53A<5-&CE=LPzuiN=tmRJk=L|Hv*ji$alU+!#>rk z0>`A5%&Ojb9*f@9y0L_TWvZz1!G%ml)owMRCy^W-4m6L=A8B($e?Pf1X$+HI1G5AR z#&+)Pyjdl0)b42-YOXO1qPME3eck*PCrdsoIa_>_Ia}cU%g!5CCwgj*C7lXj2iguw zwa|M0)qAc=fd-7(LI@ehh#!i)(%z0^L{cx%rMPJ$qkcJF-6TH6IC$s~wWNHc#8 z9{zl)lDl?>+&lbNfAj}BwQ5$?sZPDeV{^UR0$&tJ?KBnpAh~DR1vJ#XPStT77}!U2v|nWB}%K* zH{urdMs6*VMsmf3^|?kOCt>3!m|F%h2fYG01=3_vR_S@CfARFL-nHlJ8+w7XU|&xQ zc2?B4tv(X-un$7C=|q9;^%<-=Md^Y)JAg_Z3)e+>;s$dsPJt+50B_$tBD!6SG7rkq zK2nx;2t*MKIRHbz3Nl(4f^-L!gk%Qng_eDrY+QGqCibq{gmZdagn*Ymz+u&q-tSuK z+#l-Sn)aOLe*_gl=L%{9R75|UG@>LHv}8UCra~21Vwo0WmXxBrWGhdmE&*i@Sj)SdMYxm*Bm2M0 z1PDkf6qqp0d5rHZYq@EU^?{}aQVLm_U{>pAVJujOg)Og0^>G~7F7+*&E`Y*E)jlDM z>d@@2sjn$|Sq&~QxaX3d;bQ)_jVK9d-88>Ofx#ZV2CG4iSOwp?C*pcw1H6gWm3R)B ztk5~ncWrc|eu!(>h{$UcwyBmzwXaS$N8D+U5LIK;#DVEQMNe3@-=L0u1xe?V ze~24FUfMOy&jW27M>|m5$9W5VQEv^b+DRR0SC+~nxFE*6K2InloRHapM;}E|QPe%7 zWfp5AM__jy9u6JijS8=Kgm@>?f|p~Td8hahASn5VFk65uKxP(7MAT90JS1T2=j14A z%J~QtI03P1;yHT#kdeF%%gFy z3d?DxWp6hn)3P9xUbe4_4j4AB%{dSC7@&h_~5B!B&kOe=t=hM+hw0;iwvNhu6J^I6r?KD*{&%O~AT&*Zp-@M?DqK zOk{LepHLgSsL3yjk&XNCEN;C!=ebW53#ko2rU{~yQ)%R@SY|}elyA;WSISR7R7ZRU zh`j{S95~beBSQ0cT=Kn~0Hb2kBPTTD{rT6!obZtE+Rx8_q{&OUe_|A6G%x5kxESes zReIZdJ5c2HrbXqxE$N?RhTG53;^&r&`jk+4QI&;OOj{k{hX1x7Fd-FH2bpAT-@eC6+kwD#!qxu=QRj z-78Y;=)ugNs3R7n@S(5WVdIx`EdRpOF`gge6P*d9+D5iiB;M+~RrGB6bhBgx^mJeP zQaNGx3hVcEV$&@^fk|xmqdv6v%z4J6mnEiD9fnlt&_;~`f70-&o8Oj@3C}Uf>;CQx zVA9_&AC2gn2i~H<5BoAKhfn?u?J4cD1 zdNJq0{omtue;so=Jod)TBQD&S$1qDg1G8A>_`ZGj;y*8N89o#JEk#U>Ag!M*w=aJB zna@`660|O!pWVixTNsM>A8`52>|ZbbL02A?!06yyy2k@4p9OwcNElRBpv~MfI3go3 z>iDjDK*ej#>GGQ9Djg1CPemQ^{)po98jr(-jqWhaf9qv+KGrm_-K7U|nVjy)p(n@A z`eTJgm!_vuQG7w}lB=N#N#2?3{`3PP=|H`N#5Pzp0TbBN=w9BOwK|U5F!|&(iXa0;L7T}q(e3{kH;BCkMEK2?yNgoH}DwL?jX9! z#^jLsQ>JRVNjDCSP8GAb8m%7BQ^#F;zK;~PK+cCvO{2OpT1JnM81D;b@5+r-4xAmB z#z>QRfogy^-emfgTf{x6e_;Wf8Zajdl<0&r&D56u2kC-Q%kl&v7s;axI zn#E5tWZS1;PDU*G)j^=sym*Xd-&e=HH!g%|&IWyQ3*nn}i{i+K}HmUVl(o?mf0 zeUCTzbbk|H`GqpI#Rm`J!Tpue)A{-?KHjeIixZ|8vG7$+G>_l;Zy<&9gp?U4Oe#F| zudNCcE8-N8?Vo=I-w|y3a8oakiktA+x((EH^xxgyUd^~czSwjZ?!AROcDlX0e`3>S z8D0l!{iB{c;CnxB7L{jW#*_lWB%CmyAPP1tQ|*Hc@U&_QtO-k`HXYRh0Zie>h!N_g5(Db-2t-2XE|eP%HS`@0-<@1k$9P1fg&SJf_Dt+(^#am$bE z|Ftt?VJs544`)HA;rwQfoZTmP=HUR2vaFZ$eY~4G1zxZ2nuRB}q)$tnf6$#mkC?l3 ziM@lXW>h^OQ6ST(E2MrKj+?Dl+7e8>UcC?Z>hU}C|9Eu;6X#SCYgKOI^&Z^`R5x$i zu;QWyUeRd;$D8$avjMAzW%k{@@PoyA+g9Cg!=u~acJQOO>-Y#rITQ>B)hMQ)%hHYH zV6@G4A8B|SEcB2LO$h^df6eui(Gc`=h6qC#)fo{1WYC%B@9J3)zn~PXVT3T7Il7W_ zxmm&WfjaPJQJ9Q^_Y6k#q{2i5X3E2rCtwX&cu0W+h6dbP7R{X5MBR#(P?T6B2VKk* zpS}W6(59#urT|6c<2izlv%t#$dT`<0sKp2ZF#*mOcTm5!d#gI6*G6-^1oq{q)SRdcMDcUJ<)Qne1xdwPL7DPp)%XOMto98-t zDYuerMF^Z11{MNoW}&U4dUohIHkayQ&M^b!-oujkIZkq-2aW#bpE-dh$|~{Sg=g zBeHOYCa*7Yd!4yG$Yfb9cGbMC+Hg5MLM7uQ82Dpy@M36Zo-qB^htz^tR&qq)VJcZ?wcBn= zNsJ&$eHcaVlmn1x0D=;sN0H+-YGI3+FIHkrmwD$P!w(0W_`A@(G9neirzb()OIWdza3oYe}foYk> zmH=&%#xxv`tL=In91#&oD-jS$QW@);-M(H_@#XERBu4HaCbA2~s7@vYmZj9rcUAaq zNRi>Bf1Ph4aUK2rqf4ok6tY`=&K!GtB_*#Q-1avAZINH0)LDMPKA^PmY6O~M@L6nw zNdrv!LJ6Sp=E|p+cs}1jvMIScW<|ykO?%9`FXv6%U6SRPLXvY|Omes~XOo;`Y12aq zRRJ)#O;QRLcrNGG_$1T);m55cLje9Lp%i&|f1FfQ1{^j^{dgHZDHQ`U6yyap-GIRl z_5LPECCI4n-W)EiAoU!O`G_jC=~Yp$!osm51qRFvQGMbOEqL3kG0r&d-xp4Fr4JA0 zizmm-7kFjjLQTm_G$kLSDS5Jd$`HOQ4Y{ubk;!Je4>#KR{%+UR;k+CZ9l*U}r{k(s ze=bd{Yf_c4h-3cRYiLm(-ag{T|8Juc4Mr0x&az7=w%$ z(!tj+oYB#bG70*#LsJ`N5JvVsi8!Hb07GSu85U>Y$L2B@eC`-^#0B%N7_!ucW7mS% zqvGE8J1jZ3+18X&;3j<%_O6gZX+lQ{?(M7JkAz1pa*hwb2TTkZMN{BX`}&EFe>n{0 z(@{1!Zm{t$pN-Iy?KNhy7=^c+$ZiPT{;caQSnxSL>O^~mi!QK(lMlOI5d&gXX<`Fv z9OpUYH1^s1x35k+KLrpI&hPygDUN#oC@d%5|B|7pOYhovJm%U^Pz=%Oqk@KcM9k11 znACWVT0DmRG`#lueSh2ad~#-Uf6wM=@HpcV@j8SZzZte21T`ZM-vvKzwoP>Lk1C{Z_7TfU%X#*r(QeKS6K1=BfU6Fn6Mw;tHI8aO2ZYl?W7#qc2f9#GCyd6-8-DFi1%wa z-?!mB@7R?pB}Js*r&2ycBz;tUb42Q3Z&{thqC}%SgWaPB?l!&5!`=#{rCRH}3XWaM zF^6rq88RjjcGU4?zUwv;fBnV)<;lLB2=g}r{AIpehC44=IEMYX&MTFlyHRoOCVr?8 zkR*V#F{jHOGq^Ki>|><<)sU{lIs>3djOT1(BbzB-Y3z4*i#Pzn zWSI~EIK!T%&zs_S$f}s?J9K!ynlJX<-QtEC7z<_R5Wo^Eb%p@Af3qG~^j?pWV%?@P z-0UYyhEMzZp$8Psud7H|-FC#@m%L1j!*Uee~YtEalpi<%3&7{V{7#gPEL&l0R_UI>=aqwB&)*$yxq+2OH9lJ<;2NRyY?yf^dE1RxlEH?uVP9FIk$BmxS?Na8sciFn}!*U zpL|;B1I8A(vE_*xla8-_+C1vef-~dEQ39+JLWMa1m@9=dQ}|~^P9^Jt5k3U_zf|Q$ zB5?y?|5V;ne^G-phG7S3yF}1VTOUtl?0-qqC*R#2JFc7Y){%mf;ZV;o^!p_i&KTIN z#eQuQSQ(Oi8&gy`sovf0sPC5*NvKkiw^GQ!GG_XR0!(s6)Fw?>vLfa^+XxZDiE>4@D9(+uOosUczt4lPk#+rUMjx#X7 zKDQkbxn?88l92ac(W!DHNbzq*{h;d%i$arITPh%^Y3$h8SSCQI2TozXB?huI^maPh zX~`$Hf6(e@xNYN3jj8JNzdd>-u#8|fYc4%}WuqXyL zKq5}$R+rDqY3HY2`nR5z;e2?;Z%ly8LumB~pA23xtoJ#rXS)CC@GHFd_RWjmUNA2T zHsQh&ZPGl#uuUR9iyhYJVsdB}5E^AwQKja{16~d|7fl3Iw~@?K$mu`Vz-8 z?x{RapY}X{k>}}8}ze-?&S7D#dHHj(}j8_r6n=hve=!En1;mVJ^rL%&O{4ouLDOvmy-ZwY5gQQi5-v; z68-6`(mD(?J8?0_4pJDUs2sAsG{HGBf5+m^xo}K^?Eg^`^ckUeWX_hWNh1B1V9%Tv zRfSoHl%GdeN6>a?mwvJ0=7(sT2r!>6%hJp4pYIu_r+~UA(n}@)-26a!l3)skl^zbK zdEH5Xcvy=AKI_c+1qCm42B8y0#uUOg@gnq_(EISeKVk5v!)m3b&6S|jyUkUcf2(#= zKd-0aK0h2|GYekbUa{#aobK^g*w2DP72X@<4LCWFg0v=Wj@Zu0?YTogVeG zpcqV+qM?5sL%wE}V)MCSC-Qln=6F*-n*Zr@V=)V*5bNaCR7R$PLNSTKVVLnue(~9Boo_6&naDQRhYgpKnJnLA+AtyY z=6b*RIeAszv|TkEPupLw|2j?n?6pjPH-=f0a-6A|%t&Ov6qo z(H_ptZm8M@XMFZLQvsn;Od35BepfZssrpa3y^|;tQG|O!M1SM4; z!L@se$TPhOh#u7sZaI_Mdj0VHRTqtX$=|zURhKbcwM?7rIa0_XtEA({&m*%zBQ&43 z_%l%~jtan)P6FJw7deqjW}&$-6n&8q3K*@Y{SPf7Rt{KI*D(o8mWn`sE4hyHLzzic zM1&ufsnp(Q>f%_yc$Gi#(maLRa=E;9w!Zb^A{vlt1%|6T7;f%c)?y6~NG2~KY7UA# z?efRS3a+*0=7ZO?8VzZAOY;obmW_u%6!N8w{ItbJ`9-u^ZuIxt?Ul%reKC|V9nwq* z`6JZnv>>+lk`t21@hN6M?4x2H1%Tgw0EZfI*BF~@xpzh++12`dMCT5Dp__pMuSR{^%+d9=pC>ZUoBuq&851J>{~ z`Sw5`VYwcUsI!oN4$=cZxAPx|b^wq2fkyXL|F5fKRLtgquaP1GA)pAFFCgSiEIMWyU?3p+A)1fOF#zyHWj1*=UR;T!e7|*a!5b@3 z)f1<4GQ_)<#-a71nlw|pm&qEu(p|#>u zsIFeCZoUY(jIp7Qi^Hxm3m5m#?UfOu0WaggjAf}>aV@iH^4+-}s@u9kkE6JrJRr77 zSD_K8nHfJiO9+YD^MJk(n<0)WsU7^oA|xm@@y=%;R-L&$)vY-q?Alk@{22hciK1_ZZ7H&hPM{F)RZ z!c3CGzVsi!iFJc-4=pVcfC6M^sXP3F^L5ePl;~!`AznMMA{;I7HqOM4|no|BRzPTZYcYKdbh=J^wSPqd-B)ylmN&( zuV2Q3f16od*xzUmVFdh8&_!mIHF zIzkGT{NPyBp*tT>`cSnf*zFxb8&+ytub{T5TqF@*|GaaU0(cbz1b zP4Tw&=zs1B+XwGAs?%*3K$-t|^wjH!7C(}&lrzzxt?|{%!2SsDHy6t%ROB$q7dd|D z5Kko}f_>!$1RcdzOJqD$Ex-danL7rWf6^L%9BABhTMeQ6ZS1*6W2*mgwY9|&EaPHT zT1(NNM9daK9=?8HT3#o7&%+4irFUU978sJ6Zq-*P32NWE3p$L)E(I9S*iqflwU5Pn zPhE`O4J-O8Zr9)jC<)df{w&NjgS=Ua)#Jy*b%!@muFa1DO9?w)q+P57$}tujf1Ds& z_uqkCs`5(C#Qd`IW7X_pX_d%WI%idf=yQdfmmxjRDJIN=x)XG;g72*6&IMRA0Khkz zXI!|4eQ-B7ZPnaRuiW2wI_H}2KZjuQqvyz=k4M`1q*7HA^_eb#dYYcAr__+uT;Ks6 z`M&YqLV~>3+4`<<$b=^8V&$HCe>?0POZW3`Bp^}@#zurufv!WFTosZ~smRPa3+;?P zoe+J_{Xo54OIb}(`Ew9H;>=>Caqy?i9Fxazll%n0vpXC4n=&FYsX?*%$n7R(JWOVx zZ_Xfk|E6>$EQLw3!!YMFa6ebz{V-N~YfPJ6zBbV3(eb8uef%l9T~DpPe}wGAdqj6` zgQ0((wEpvX2k}-vxg#74vl8sL2cLXIo`xP{gb+;42J{3*piO^u{o>y*xO+O~8)Z^h z!fdz&y~;Mb(~F;fO*eb^2GU^?!t*;vd4hi#GY~-3n;&2NZM8xMhY%?hyDuz(uWV=} z4=sU*$N@1vY6&=`}jf#3I$Yad>4EHAL2?C48N`GdO9}zQ*CW|U*e|5q-7{o^!|GjNo zdH;dEEhK)NU)mco+}V$Y*$gh}BxuGE%}j+J91Aj3>^iM5>V9q0*D@{3R)1&{B>a#a zVEpNvnNZ;U-nm=*?i8>>`(BJF{3*p4Bf>yXxW#e$4s=cFHO?vNu>3kk%D7NVLvKUu zS@1Re9V%3hYR01_f73@Z|Nm8K{@$I!s+$YUo?G60N{!#w^zpB(%qmLwiHh(_`xh?- zUU`*_j4x>D|3;O^32Tj0K02VqN*cI3wza1Zt56C{Dtn%lt zhhm3^VgZMTVgk2^Vgo|I4>vaoFHB`_XLM*XAUHHMm*Fu26$3dmIF}(O1uB2E1ymc_ z5-yBWq_}G+?gV%D;$A#JfFL1+;80u(6e;djDDF=2B85_1i$j5yQVJ9)^5{9|o^$T~ z|Fzy*Su4pm^Uds;+23qt1|5BFIXgESu(BHz!42f$69*`0>H+xye0%~te0==a%*+N5 zgbVmDGd8mk814aagNpx)pa6ddgAflkMG)eFr|AX-sC&8qfC2!ZusBdeoR1H{&&MbB zAEFyv9H0pDg4h8xc>wBeP_PF!vw|DU7Y=c7L_8expT7V$TXq0YOiYC9k8psTD;N&3 z1wjFtAcP~>_2EQYkPATH%@zVi`2JT4Hc3YW0w&JO>+S8$19J7?af5$5NV9VRydelj zfF9Tb4EF-t0e&|O&;q%F|Llwhn;Br>2=VySuJ2}#@CL!bfCqyM#1;(oc!=sOv7vQhi0DwHeztjB{{W}o^`bRLx*4E7x27>xRpbh|ghzl5? zt*pU=@Ii0^Kv28iM38@rhucFu$O{B<0ognd{-_)TP?pmLfF2tBt33}}I0T09;PHUC z{BDu=cbbPOD?#lP++1D3P=p8e@A?!WaIo#e*nN5byjf?cn>W<|FJKRW+S&hZ!p;-M zYY2t7dxF&z|DrsYu>Y|+fDr&8K0ZDXF+l*>9RT*Rb>#h>-oSqs2L8hd{B3^dAkZJ? z1_RhXGyx8T*n=N_u>CziUSI$M?gZ z^5GC4fEnL|_J9Ds-=Dw#Sv<(g&JF6~`w#t(`{gx}Q+%qY%=u@>fBWR+-FyK4+ya6C zZhj#kKulB=AR>Rn2MGM{EIJ^_Usdq^6RHNacLRw1S?t4<{!_5mU-!@U*KV)_{yUeJ z+kD}BKFo#};qCTM?uWYl!0d~p4WJo zsqD2mq3iIUa;c;J1gqOhZ0EAe^tb+B+M6(=I#P5ye+ArFCFxD=c49AnBzrem@S{9K{n11UKy?4x;Zq__OCfXNdAA@9EW(II#o2#tW4Cn{MzYT+R7? zsxsjB=%r+$G^L!V#tCNSfM64;>JSqD9VcWWkFr-gOwhi6>t(AGZB8_KBpqO$^UkiMG8v zc*`ND!8_#OlL5o%s?Uhp?1{SHbhOvOHirwz_cPmUw|6~z6CQT1l$OY;%+1ZAQu}{( z9jW<>IGofk$QpBLJ%5U|Q=?PGGp6Qb6|@U9>);GqSv2f^!C}v?-R~Uo#=eXmI@~6y zFs!(jtF0~&%^@toQpJ3kaMg+uwK?HQrt)!9Tyc#kYEwNr;f^h`=+wBn|8(N*>9IvI zH=iU=g@e94KCYI_D`L|;?L>{^nZkbrA!y&xF+`CZ7rMsQ@EYp3yq&4Uc-LaYs92^B5M8tGKC~-$6D1A*wbt8DbifdOqdMfkm&4+(d)F#Jr*?dfgA4vaL6WW*bNt>%Ai!=p0Tqz~=#F+KiPl1%0|ll_Y)SN}zd<{3SEa@C*A}!|dlB@ngs@CT|EZ;~{9b4kxslm6PV3T9{R*cqerAGDcbD)8szW*(Ts` zw$w1l>#?V}eVOd5YsVDR%e8neYZCO{Ghm&@nEaVT;NTwgl3@1C3fqYwzTS?;t}SYy0A7bD9O z;yHk%a)!mdRY&)!#TD->-dmkKeio?rdD3BcSL}K1#{J+kPXxP(yW?B{;_;G^Z(pUnXEa{26eA2KSV z%m%SAI;%*sXbocqq;AoDkK-wX&PidfzPIV+8(y^iAZ8in>*^>cP7GyDeLl+f!lLOL?s2>vR=;PQVuUUR8xir;})dw+$8 zB*I`&B!%L-#d|U(h+U=~wN&BJdO@0z4T*^5mUDLAn{#!ED%;1{TD`A0P9HDDtI+hm zF4h$QBwj2ZVnLsmo(NA@0x^iYs3nWl?J z3i%sgg5ElB+L0AjHNDO0lj=2L5*XPa^J1J(WnO?#kyd{^J=C)0Wpm+7ej*1;yWk0I z5x(UUf3qnBMx`rwY3Ycc?JRquZ#AB9fytr-hXu_X~(*CA!w$&+*z?Zm8=NUabVR^?48ZWT<|TUMp$6na}d6O1vxYuHS> zz@EnJhV_>O9Cr+f<9byU!n7eRgMv*q?o^-C; zd~^W!jHr7is|k&5_55IL%`8KOuPaJ>=B*;&KpT7~(S>7IiqW>}GUkRgLDkNGi<@G& zd3x^IE4-DVF#m#?YUr84Iji1T+%T2XG*Z6XJdl4@vjQ5ZarcrF>3fQ}_FXgYxb=l> z*yox2nS@ri ztDHK6fQL9bm_x4UaJ6_G7v1!(VnoTKNoy+3waNBl#R(73%9S*3RDbl$j~r>;o+y@f z>a<~>n%yts?S9YTgZhw4ZO2Jy$a`e8%iYP=%AnrdYWmjKWF4!!oWY{jZ(&t-fu|+-%@uzsuFz2o z(j@oG6h)0DAuITj>h3|cyF+MMEiWDXb6F_CzQaVV4s*&2A3&AeVNY7GPrQ zwP_|`&2=s7{4#oxtPLw18%EeFSa-}7Z1H6$3^oMUhzeCblVclVJxGoQs%PP_<5JZU zznYO6gUTqu5)w8+?u13L=CxOctnBZt1ea*v20ndOSj*XLH!p2zyJmm%LiimKpOWc2 z1lPzd2{9#m733!>I0&Fk-&j49F9aogO$`y17rNuvdl#PWvjOdvrSDVvg`%i)FWpf9 zW+G8LU-@d;23_g};XJF5CcP{ya%SA9@s{a>4Qw{uPoxaoZX%j<$!J%48LWVSu9-nQ zc!PiGjU8_CHdo5D><@nn&c&9b?pTEte82W{D4{>v0iWJi!nbOS7}a+gkek2vp56_dw9&%I$@xep03=8sOd`~Y2$P5W7&BC$6Xq10Z8IL8yI13xzz<&ZR zbA0j^okHGAMK=Z2c8c}v`VFYPWk7rVt_4mAR?+G)(SpgvqzPgedRW*9vk|NP9>Y&=|quF&Os&w?^26VbFmQYBw2Wmf}sg6CMI( z3%6TJNOzlcqrWJ#iun46F87D{wI&G6$sd=$DUAI(Iy9!u=*vuZOYJ4J&- z(|Lj`-01&P?MtZ6JRrPr(gs$DdZ__pSA)wnU>s}O(`*Q2O+5= zV@scjaW-_Hkfy==o{Ree}*){Tvo!Qhy`r zd88VQ6|4Kl6?hwiWzD?lnZ~x*A&+-~DT_k+zDc5u)V#PI^B6`Q+qGq9OJ(f?KSDxt z2{vlbdwsHeBgkp4wc8_??Vo|zj zD9lnqgSGWM!DZw((z_~ylQ^Y*NY}MaI`3<_oQyw*ydu+EuJIIUa)11_^U}%H1v@e} zOCW!rVf8zu7(6-r3spP>>wv)8b5N9_L5PW}(H5=z%FrS?ADKYAT{kd~$ z*7%YptK5sS6+LMMnvQi%%fM@kNIMOA&o(yijFBN0z?_OY2mbNwTm5*x0Fr$LpLc(5 zJ*5z>xZtO}v;iK3#?Juho_GL+0UyB2(y*%rr&BKCx31f~6uajzr(L z9)$!!3=OZIXWCn9gZx&ZKFN94 zm$>rznx`t`0h=h^q?Sk{zzct!SB-z14#z=aKZQ@zp2~kQ`IoW)Emlf=n7+3v6c(sh z&v%4*{pHN}dW4_H)g$rDS@J zp3sCBw|5Q4t|tEC%jm1qG+?Mv(Q8~tl*~?1sJgs;L;+>)7h1j7D3}oc9aY9AK}Q_6 z2;>54hoR?P*rIQ_=MxqVBf5VlNMtYB0>5Tc+{EmW8RTFX;Ap1jgzHq-hgu)QW}^$O z{o?%ZShI7YeQ;xrNjbBUvEP$Rev?EjB#UWfE%lAByQrzs7JTx^9gsTq0OQw!x6tw*YifhEVFem-h;!|;aqm{xvR6iSGj`dr?Fw;@W_A1kHrjNrm`8&0Hg3GK^n+iqrYH z(7g9#-257UWVfz9Qrq&>l2^rN{fgZ9J%N14$hd+uj=@BD7Mx|$dCD6U=yB;gk(+hI zwh|}?j5+G&>)r8K%7}j+#JKQ8kJ&pT|6J!WT&(igH`=^}T;Yd0QUQAi%X+V?W(+em z+IGQs4`!A*np{uc$MGK`FomjuVvRDQQg!)uzVn}i=h=GCuZmsog(bogs2e!yYTTQk$Y~Q25 zIW;C>`CQJ9&Up1NMd5<^#K;|n+dKM|(}Yvk4kPS0T%`tPU8fkuOY@-cW7Z*f z!t&dt)(=vg1w4NT2&?94F4o}J{W|Q+rytAm;2blAn}Ws>umz?992!G^TJE@(@~Key z80u3%eq1D#`*J~M5jMzLdpy8>JH{>py>M;wgTMh5>dZg~)8--XX~49m-gPUtbsY6Z zE$$l$;XTdkfT8>Whvz?nFP;HBE6nO$ez3W9E!|_xhB$vvWx6QgfAvmjZR?v4=M0Vu zf}PndH=4MRyi_#tq$erLQ^9Gcv*Fi70ariXjo|<fxFSSn>d!s0= zIH-lXL~BH+xyXw3vxld@oG(4niX5d|vaBPL@rjzF0@kb0n5-IyryjNG5`~(D+&A>jW`da~<3#Dr`^I zaEG=ku5QnpBR9XIkM{PFq)rnc`9+}7#O0@RK1taLrfwryZVRh0+ER_pOg>+xY>o%2 zEazXS`owNM!|ysUXqcF;97Xm>^k)416zWl< zI%I!*wLA3ZdGd9%te-3bLa^RBC*?Tv%VkUNve1NCHhkKr)bpE?vL}o=NMpZr zaFY9!!s-)cBd=p8S-V|oIi0{Y!+<|f=ry8^MgwE7u*8HSIc-yQN49?|yG>PY$i&OFU;JAKTd6 z%zLBa**>u<)qZ!;I{wj;NkV~>q7OfQECkJEpB07igy?5saE_46vfy{eCYcXTS@h=G z7_S#H6ltxM!j?!u1K;?P?O%4ey!?Lz?VQ0@QjEuKf?@6}z{OAMPH72uXTRzaph*?) zASLaSY>np{H&dgMiTcwexhfbgwo0_>BJQZSbIodEP1h@k2%X+#H3d9F)fJ>4*;9}t zH3d&Dej|6=*}YZ_reosFPA<c6?K5ca3ZQIaMwrl7C8#7sJFi!c`?jSne%6LP`*KJQ2KN4FDAH@0sTA2mc zr{I+ucArL`raVfe<&i?&oIyWXNXX;9Nj??n`Ff%!Kp-Kf9V^Nm8(|<^=<%yz_MOOH z@M{@Lu@B*Fvb^P!lyc8q-@<>+aC*j@s?KXQc>FH9m2tVUyjp$VvGqH9LUl37oJ%;IBSE>2+^m#pqx zwe)%xm6SD`ZM4EsX!NRE^QBjOfw@4xY@d(>{)adw1ze)&K5f*}mtlXYDKRr$Lb8OV zGiO;LP8d3GQ7h4ZLQi`eu)xFSeQg*g<@u4V>Y#HYH~v`pCtn*Nl2#)o?8YT^zBi_prPyR2Mq5t zjz{PE$(ES=E7H`@Qwe|OgH*4vuuyp^NN(kyg3EP`dyHw!^uLpqH zqg&)&FUtjfZ_<=H=rJYvm1rs!{Nbp{I$0rnWTo9%^GRWJPv8&>YOC<`2EW%PjB5Sa zBHs5!B2q4;*3w7J&*e6jn+$th&J;{@vUhS5HjVu$jchFzfE<7Rl)mrJ8t(kRdmI(; z`)quiL6X^nRjGbM%KZ>4nnIz=JaWulmBObay92N4ZBT|xk8HJ+lJCAK&j2q79Tt;| zH4phN#|wthA7$dp8LAx|2EPxp7%qoplvb6(gM|$WGytFCdWHKeeDj+m-{iG_6z-PV z9Me95wkS9d*5Q9m4RuHFOADFZAZvqvb*6Bhl8k>5h%?CyS~KYsns$jAZwY5tB}T7t z_?8iTIQ<0NNN`;u+aIi!*_k)Ly|FlKU|0lr+!ef?)ET(kEngBWSLSw0-$?smWh!ys zJSLMFtm2Cip=*TM&Sz1jw@?9rytW*!6pCJVgKaAY4jq3*`)|)eFu#SY$h_b05rbWc zaTrxLf4LaWTv*nNarax?9yK13<5j~&9yFR$^o!sfU=h|0MuVR1>|tgvgw=m)8x7nP zKw%mVj|EuMws8hFgjG0oSJfE%Jpx6y}tC)N}}_VsM7Zqpn20<7_& z*k4-hMX%5v?ai~Hge~mC;&>%orX`Ik-`c#l_Pl>$BOh=+J7u??wRr8mmH!Hk=gS(Z z)~c{>qR@Y5dfKK)>*sAwUVs&yX}uah`3ToCg6m18U>3pq+cDdO;UEvNtSTNg|8@6@ z|8pnC)_IQsq)7Q7^;IJM88S>e?X+r+7oCGf=x;HN5)QZarm6GL5(m}v>q*{^B&-&a zwPJrwjhMG%?+E162G;$!+GywzXq$U+QL=o+ELCnG!sJWz3k;n@z09vtZS)aR)62hi zeG)Z`9EcI(MTLqz$_>k6>UR+e+<0}_J#rgb!W_jmI)y8ikCI8*td2idvAA>9-qetW z%~2IoL8Hn0@k>oXh;C5C=jY3FwO3uKTQPs;5{~9(f*VIA?#Lk#E1wrAX&Hg9Le{fT zx1JTxudGN3r8}+qlESymc>ebOq~4?@wM8BN;R!xV}loX;YY z(|9C;`rE1x`L)7l_Vr7cXKT8HjtJ^lH=}w-eO+U|bU*r@;|_p4GDdn&=gMd{-x7bl zvod%($})5KtJwXWVTJqktxmL#gH55?Q~~22yW05uGoLAcg5ku7+#@|;dL^|%nH*yd z8`FvcIa=hEtU5x4t0jo=$`8bn+C7M*F72+rJ+L+Sz0%m#zsYN&=8#wz7Si!?e3y_I`gH^Um(zocwiq0tSQo@i)!Z$HCe0I-e;6rdb%IRD7=9^CI72D*AU?}=xw3ptAB3I`(}UTEsJJM za>!h-7*On^ajK26mNOwD}((tRmowwyq#v(H@sGhCgmd4RBo9I2ylFJP?4-IdNPgb9b_FVh9 z@Nf%Rtn<|>=5g6Py%Sb7hvBtTD-xN5N}SoXF$A(v8)!>g}~ z!D%9jn&9m12;t-nVLJ)B+dxT#Ez?R`>AX-jDfPA`;--b>o_v2`@ML7Nns>T@A+ub* ze_V(Frxmy~8F{JoH7_K_sHdf-o3_D$+`@lFm<#dxw3X(FNK%ExUbsAsxKf@2B<-GY zXzVIyE$c~6d>zDwv*<3@eU2|5=EWj5cUN2d{*GZ%HctO(zCnp(w@<)dI@G7Nj1K&5Vb$+y(zO+Wo z5mDR=btLll7@qDGd99p7HQie^^!GADbw*@*yhAzfbK#HiTyvmlIrs$_xc3?r7uyRR z)v{YVttyc&BNqdk5VkQm3tzS+HlE`b3ZqVFIE^K$z@A07(8^Qgxv=X zRdgTg_@Dc`S% z3|XIi?E-(eCQj^4X(*?E5yx%?ea~rr(dEfhTb^w4K{woxa_FM0nsobVO*bsOX^64F zXa08fnF^W^$vWf;+4o0|UmANZ_Ronv2G6EQb()YJx^$qezb8(_bE{m}-I_|xIMJMa zvR7fmdYDG!-zYA#uA~`lr5Ww@%klc8`a^XQ%cp;8k6wGwc^w8nrlX0Gub|FW-%tR= zzAtgJSXY=acN{Kzu@D|aF|QoI6Y8rgw7uqxL5BB~eerHbRAUqeCZ`c4!OfDAG268E z*oKF6gsHkn9z*|ECganUmyS+ol!jl(!RdxN2LYN!iriT9AVHN8GkeKb5n1Nk`e8qO z5_eStx)Ob-=iTmjP*G45Wf?oPc&ABatT)K%$cuz{DhxL#-#&NJWk_9G0sTmirwi`& z--{yI3vRxzx!Ws7er+)4!_!h>O36AlU&g$|X!d^qyLn4Am+=<^6Nmjr1h@T11*R4P zGc=R2Vkno*UIiC_OnGP>q%4g*dH^Yq!Va$iK#w%Pelx$U2C4}(MUeFF!)!<>R99DL z<$Y8&Xd2b%CQ}m|<3giDV{K}TZ@f`7(gbZ9tDB_ghH6qyjrEOI**4ZSS|`8dOrxFl zjnj?xDmE?>Fqa#KmT1tM#wdc~bz`)0jrWZ)!8YDC#?nQ9pmn^Bjn9nMGbuF5G|qdX z!4YaIH<3_Gk>-WQD_T4e&6J71<&&W&(%CeVkWkK+AV4uP4x1!G{X@Xx+V-%(lDifKQ#_A8 zDI_RhqqE{`Qahb3bB#&Po*{d>%8@bkG$ZHCc#!%j6V#Rttf+)EjX73T<^(-&G;6D7 zb<_@jmO@WZL$netMrX~K(-VfUp&mU!YD%j`dctIq3~3>$y0(7n#~-)agRht4rhPR! z8E>^uF3#uU^ZBf?WQT9I+Bf6b#ntp^JR_sTz~1=NWc2vrOY@te0XD{%&BrZzd`iy| z9hml)zX0+ML2G{ev1xZmB#!TJm(;m*i7lajbV(OtH-VI@>yj%dU1pH#hFScjA6WF= zIFSp)8$zIcHN806AJ3cLh`6UaO?xo@GH*V1xUHpHrxmipz38sU8X}+~mlZm%@@7d^ zk0XSv=>W3QbO1@!O~(;doO^M^gzFqJ?p_?J*|1*dHC+|C6+_5yP4^&~sYz=XRr4}` zM0QL!>CPRwW6gE$SoKi)QtQQ#>MXglUg*Ot8B!jOuJ*y$v!XoK{Q>N$ajsZ$8`5je z))q%0J${R`l_1Ew+725+#V({m*@wCh2i=MvcKQ!CznX2egI;fyJ#(tetai&i`P7`P zxmI(T5~eO%kis~>!r8lWbH%;8+qrjtuQt)go{3i69MIDqXDjy5pj#LH?roNSMX9{L z7aMBqhRo&L$~K@?Jx_IS(pNl^cMqijL%w7{F)9V9^`a7bPcbS+^=ymklz1PG1iiwM z{0G}aPoi~bu2`}l>jo35SXJB2gW5{)*Vz;7ChTdSPcN=6xn``GMRiE$K&zwu~L-# zt1za|p;FP(H-9ws6@7c941HU=HZ+HB$+wYllV}coqAMRIFzkr#9m^+t3qIeYd657H z8Z`MY1;@$7`P0#S+-`Xjv2`cN}abFGg+H52bjZCs(&--_CQnC?pL09osO z=8!(zk=(QrYGU4m+~P}<`Oo&HNqeXN-VUJxhjcrOrnlG7#sy!i9LdT_v?y8C;8fV1xI6fn2Rt zPcxK$FoHLX5Ovi$5G^W3+_r%IEgG{;$j7+N$A1*UOJByl_uGN0(6AlLh_pnX>J7*g zol@G)q_);>+iO><17>+pm4Edz1qncM&TYGHVL@o6HF(xyk)b(%b<0S9-12*vHL6zIz`)CwjKv5=frl!ZTMx)C@W*UNTr3PcAUAogwfs zH;W`%QG~P|iBd~s@e#Hy3cu_zSQ0o*z)X08z?j_&h1US$GZ zw_0qie0iN%y2SZhF!Mfd^GgDTaZN-cah>p05q`tNpxMN|*6=61uv0=!X5wQ2$29{e zU?PL?#Kz2j?R43FAjU+4Uf^TFAP;Vcy$9w4RY~xjEYOt90)lvdzmOS6tpXFg_RA1t(vH8}9Wm=|9zfxHp){m+|MOC!AxZ zIfSRuYOq*Z3DPUA$FtJbIg}^Q&W|oWP0mm79vwz_F2kSUjk;2s z{N^a~n5HJUdvdFNIypWb^FAP9_ZzL!j;L8wOe4JLrriP*{5=~n*|k9e#0<5XQ!?)j zL~{35;7FTba&_ws!hnoui+TXrTndPPO&o!vgNY(1NM0{yIvAc8LqOsgV7gh%1akzk zKq#xIMbay4$UL-~6rLBUhC*1PUlX)ST+re@s9eghLIVOlw9}%1a$=o4&njrJksMeu zEO;vfD4A2n0YUmfo)VaO2~FB0bE*-~^GT#WbG9sPN}kz(R#E_KIDNV~WspRFpje!Y zQ0D4-DMLnntQE37xv`qP$ij8Mo>|B9IwvWJdM>gaDi^A8>*YcU!2qp{2=UP)DHpOu zgOJ^XY>T_~Wu{F$?j4lLc+|tJ=Q(oTQF1DQ3<#xCtCV%Kl%84l2DoOjJ!Y)- zd#nQBBEhQPlRn0KS`pYB3wuO=bfQbue3|34g8=hFjP+e1Ncv@drAsAetE9u_zV=dk zQbkx&{Z!fu;&uxQH)OBji(t{T#P+8QruL4{4*UCY-(am)$31E4jiqQn^mnMMtNo6Af`PPWT~ zQsf#uAXP$$E$MrV<#8-vveZ5uc$woQ_3&!>7+NlOe2)jK{d$A}i@cV-TGBj<`Pdy& zhTl8~jtQkT_Dnq2p(|fdkKNc0UP1+kCve1I=nSgx|wAk#*-4`}oD=U^cg&h`wUD}EW zSv%{9{V3LqVA$$Yg8a3F@PrKkw#6)kDYgY-LdF`G8NRlT6+9zQW+k;P=NLS~`*0fj zNL-9!_fbomg93GS5&Ve$~zS<=|N)!qJ%Y*6r?BL9|!XBcGOvVzx=q{Tv;Ui7g( z<~Ws*m_gwrL{@h#@|F(TO_<)MEikKA)~e^oNE9!qkX{PSIB;Z{1mtlMyAd+aCh)^B z4^U|tb{Z*HkfdUN!}DbY7=TEqtROSd^8R4%jdVHSlCL#aYMNw(Wd^w|t_r^wWA!r* zKWIX23JDd>srUkTMlU2*w8wT&2iZ6YNVCBY%;W75*}$(h=RF@NTXR6M?eL|4MzRzo89TH-z&pT;MU6s9 zToK}XcBQoO*i2+y7E2_@m3Z5Z3Rs0rd4-&mon*+O5K=8+lV9p50uXpt7AT1M%TiEO z#L$RT@EaQ#70cudXtnLQFMFTTnuY541>-%Ad&>5^oP3}y?m9;!J@+E6n&TzG$&x4FPFWDG%3RH}t8CNXDXI zD@Q44Wkjgs0Hiy*C=6tFX6$fKN$15el#>lIJeje7+nqn*OHQib5v2@9KOqh8cDhvA zSeJ#%SyjOTt(>`(^0(?=r;2~LCqP9urEel?x=xyZGFrZ`*t2J zWK-W2UP)hC-|h7x8<1Gf2OsPnGYX?n`U!_lq3qc^gTu3c&1or0vcpy-_B-U%AaH38 zxWT}L6L$Y;?GzAzENaPsyn>T;oEW4GU03B@_?RHCHk&ImIDvbXhr$&$N;$3SJE{H=0;Z)FLVtVwTe7 z-IoF*M@vn_JcboO+1N9juEB zS2-dhE(IxHHIBk?vf*J#K8cFs+|nv+d9X--og5QIRMPP5Qv8b&@}Zf-#sTVHsD=-c zpT))DI&XaCa#HJZz~P1%4OYfMR@uc?MvkA$Y#%vah-GCS<0BE-8$tlUiC+-oGdM;G z0e1z{1hb$#Bft<)iCv42XiSwQ_$ut)=3~B*VK6sy+0Exz88v*Ak%|^Vh0|oeX1kn! z*JeawC?xhx!CpXlk$`z!hc;=K zT#+*oZ`h$YBiaCn2-6O7c8M`{T+2g_R`$EeVadGEn4D1Ui_0Py@X=mb1YYbvko;&I zDqBw6BV>u05w)0ysW{mOqLp#@%15(**vBs!Nv>Yy@T#A)tn|z2NtN@|Cj%l+D=Ehs zspDOPMUqfM=j&Wv%qTm=O9fe~m@KpG)w61G_$r6Py$Zd%s%fpP_0dFO53^3nKp_hb zqMTn#`5}U#c|}|moh+2B7b1``c|Aj*OPnt`0N^hUy3Atv#rqvgLa+BK764d(kw(?8 zq=(U-OwAHTs!#D2vt@=w_F*M$5`k2AizZd4dP|+C^LLz5aE^gp!*JhL;FQ*3M>fiC zq$w>9*c{%*!D}8#P9qRk*y(UCgnTnO>_5SXHHQIR-cMnd&&~kvd&mUN;4`XBU;4@7 zZ44uO7o27}%){O!|9JrEN*hvtTwu-X)ZC~k;xq3IpvbWKTgp#o5nhn;nI-)g#k(Cc zlI4{kA<%butS*V^(h$P(Sq}Lz`%TNKlT_vxv z#FDy`zOlE!{U|A|!FyNIPe_uq!r53X#~&TM?BzwbnKiCH9{zzc`X3CtUH;=8wvA6m*IOqXui2SADvE)9-W_@jvE5MKOdj{%4f7&?fde75cxql3g%&EvJ8A#Xp0;Q0d3%MOXEYlM8^_x!LbW!?Fk z48H|e=_E}XFIcPk?vzw*_^VQ8b;4)JbyrhS-ju7}^j>*ECqyg$3U~S3E8=|r3T5o@ zp6kVXXC*@2btMP`k40Z}iphKx{!WuWve9(T>Tdf$tEU=|<21L@pwS%BgR(R>bbu1; zFE%h{cMeQk@uNH4$!vXXb6#PhzZ{z#BF&HQ3%_o*{_0bt;GhUcM;}B&>`s=ZCi%N? z)n#bh^UPz?72DcMuqu#UJulozeRZ^DDDm;_VsX=h&Usu8=Ej zhES#5t=sY*nK37IZoEt=CgKl!r4mFo@)2ES3Z(!vj9{DE96o6PmN!2n1x^E zHm^T|5{rmbF4m9WMZ1*OjL96G#jphjtK>(DwX(i0Wb z2dMm|NgDg(VP8lomwOY(;z;}b*SROmX*a6V9c`lo%sz69Y`qdu5u`iW+5i$7r0wyL zvrtZvxRbuttW?wrLj)jmsu8AbEse}-$v_|?T238(PepaP0o%NKm###1VKWp@T9Rx?CzVoYh*|% zwK45Z+?C(@DF&J@) zJ!Hdl-wM59HMPa&rUWhks5c)W4q`{V2+r22hQ^Q}oe?1o4~lxR9noCGYqM?z5_W!E zz*{|Ry6A8Ac`KU_sujO9&o@G8%oNGg^6M^7(7w3e%L5`TogS1#z^TJ%dx~2fS@NdF zcM0{_6Ds0)7e{k#P1+r%rBa@v$%6B zomT<+n1px+Yl%t$(+7-p5u}p`SsXN%u*dlmzcgADe`-wS-kTZ*gLuw%dV#dQc7A0< zmq(mNIron2ry~IY>qeQi5w#uT8*#WFDykg20aZ>qE&jrfiNEkjB%?A_lsr?6_cL?k zo&%hjCbY@Gp?W#I8^LFjItxwH68`Nj$a%pu#?866JL0k4w+uP!MYNgyEDm?sxVu3p1h|jKBfo7Y{b(phF0?{)Z z4AxMW>S)Y-saZnd0c~=ol~8*6Z;_Fw!|`(XZ-~Tse}}>oD!&y*$y2wlTthg1^Ixoy zn310yCJRu$vqAKQ?+Td8o9f|DS?^0=?`=DiFu;6#GFfp`N{v9d)_;o1_{TH?3vhPu z{`Zta;iRH&mkOaSPN0>Ml~(}C%H>Rwsek+LLL^g<{<|73fvC^*^qtpbi|@a%`Zi>1 zF_~94^sZL_(fZAMbT6I)EFj8>RJZ`i;5Iz@T>WKx4N8mU!`rg_qb;?-P{Ct2 zSV!42z)>|f5gCBBdGWbybLMC((YvU2n+iJc^cC zY&qbC_PtHI2=w62oNDP2DA;oKG&USQMx+&%+fteHbnkPW<4tszNLnh5dGXQgESJSa z(w3iYPW3le}?&Z^$g?0sikKZygQBd0b%HMSlvVx#3Wp`TE@fII*$K}_<2Ci$#q9=0G z9OkWiY!-n(nw?`p4xzcCbtctyR9PkVdMKG;wdFWHDEXE0c;=GORXDqAU`KLDx>OcB zO{_B_vvOp%3QkuycrFnaB$wPg=u-4>19oR&$?@%_HBt4MKuRbBUKR$9fM+qF4!a^} zzBwP_v%)cHsd~zO`5;)cQ-pL%JJ;7 z6PKP<&9|cZo#~TkODSz6Krn{+iy!T&Uq8aS-Vy%lCf^z}<(Kp8aFX&K~JhQqOeY7rE zP(|vdAxEes#+1N)P~i#in$$IF2=5Bx-wp=7R4WUWiBVb@{_Sq%QDOLP5~*^MFC?I& z?bBJZU&*^w0t_BF)xmob*x?#IHi~HE3CWI?UUN_J_dTKEe0}YxzR~%(2(|(~EG(Yr z--B{mSq=9$&f8f=wCAYL^kX}mN(}jRidG3Xu)S?54Q>`!?;DUAm%Hn7+^}0cf4A?D z>!)9U^*h8X%o)nr(~osK!eFK*=~OLLDtxclxF4HP@1t7P%@H;TABE`8BC0Svy~fDM zEX)HPWKVmV8nX0KITxC;Q0P+=cFMjo$x<|PXe(R@ofMr)P@3(&9L(SF86o0eq;mgd zUK-HidT6_&N~f!eW#w!&>6g<~{;$9;=eeaMtb(dOQuZh9Yk|Eyi(t1JV0+is{Rc-a z=6Lu%$d*(sf2APj_cxCpo3!QBxoGa5=b%W_3w#sLE01A#Q0qxfS~5sHR%yQ6#R$k@ zaNo^5ySfGlFN1d!R-Mz|H59oE-K* z1;Vj(O7FZ|Cxk7CzSrlV6F+E~yKB!}EvhN`Rha0q%~o2xMw&nv$2N)n^XJWBrKYhn zlhKre$|*uM6oEjHhJv<+3<#>FEUzJ>0o7In%F1hj1=RlUiS2(t9Ri99iUR)t`9v`W zUWQM8qdBC69H_tieFJ80uw}W+fleF z<7+&%5^(Y@HFiSN@u{SNrKYCl^W(n-K7=du*-AM2<=1asVlu}9G|eoMb^4D&!3?Bi1*zrr2y+O4!2_IK=;c8Q^2$o|qM|w` HQ2KuX-eP>I diff --git a/doc/optimal_layout_report/optimal_layout.tex b/doc/optimal_layout_report/optimal_layout.tex index b2898adb..005e7b50 100644 --- a/doc/optimal_layout_report/optimal_layout.tex +++ b/doc/optimal_layout_report/optimal_layout.tex @@ -100,13 +100,12 @@ Again, we will represent an assignment $\alpha$ as a flow in a specific graph $G Given some candidate size value $s$, we describe the oriented weighted graph $G=(V,E)$ with vertex set $V$ arc set $E$. The set of vertices $V$ contains the source $\mathbf{s}$, the sink $\mathbf{t}$, vertices -$\mathbf{p, p^+, p^-}$ for every partition $p$, vertices $\mathbf{x}_{p,z}$ for every partition $p$ and zone $z$, and vertices $\mathbf{n}$ for every node $n$. +$\mathbf{p^+, p^-}$ for every partition $p$, vertices $\mathbf{x}_{p,z}$ for every partition $p$ and zone $z$, and vertices $\mathbf{n}$ for every node $n$. The set of arcs $E$ contains: \begin{itemize} - \item ($\mathbf{s}$,$\mathbf{p}$, $\rho_\mathbf{N}$) for every partition $p$; - \item ($\mathbf{p}$,$\mathbf{p}^+$, $\rho_\mathbf{Z}$) for every partition $p$; - \item ($\mathbf{p}$,$\mathbf{p}^+$, $\rho_\mathbf{N}-\rho_\mathbf{Z}$) for every partition $p$; + \item ($\mathbf{s}$,$\mathbf{p}^+$, $\rho_\mathbf{Z}$) for every partition $p$; + \item ($\mathbf{s}$,$\mathbf{p}^-$, $\rho_\mathbf{N}-\rho_\mathbf{Z}$) for every partition $p$; \item ($\mathbf{p}^+$,$\mathbf{x}_{p,z}$, 1) for every partition $p$ and zone $z$; \item ($\mathbf{p}^-$,$\mathbf{x}_{p,z}$, $\rho_\mathbf{N}-\rho_\mathbf{Z}$) for every partition $p$ and zone $z$; \item ($\mathbf{x}_{p,z}$,$\mathbf{n}$, 1) for every partition $p$, zone $z$ and node $n\in z$; @@ -119,7 +118,7 @@ In the following complexity calculations, we will use the number of vertices and An assignment $\alpha$ is realizable with partition size $s$ and the redundancy constraints $(\rho_\mathbf{N},\rho_\mathbf{Z})$ if and only if there exists a maximal flow function $f$ in $G$ with total flow $\rho_\mathbf{N}P$, such that the arcs ($\mathbf{x}_{p,z}$,$\mathbf{n}$, 1) used are exactly those for which $p$ is associated to $n$ in $\alpha$. \end{proposition} \begin{proof} - Given such flow $f$, we can reconstruct a candidate $\alpha$. In $f$, the flow passing through every $\mathbf{p}$ is $\rho_\mathbf{N}$, and since the outgoing capacity of every $\mathbf{x}_{p,z}$ is 1, every partition is associated to $\rho_\mathbf{N}$ distinct nodes. The fraction $\rho_\mathbf{Z}$ of the flow passing through every $\mathbf{p^+}$ must be spread over as many distinct zones as every arc outgoing from $\mathbf{p^+}$ has capacity 1. So the reconstructed $\alpha$ verifies the redundancy constraints. For every node $n$, the flow between $\mathbf{n}$ and $\mathbf{t}$ corresponds to the number of partitions associated to $n$. By construction of $f$, this does not exceed $\lfloor c_n/s \rfloor$. We assumed that the partition size is $s$, hence this association does not exceed the storage capacity of the nodes. + Given such flow $f$, we can reconstruct a candidate $\alpha$. In $f$, the flow passing through $\mathbf{p^+}$ and $\mathbf{p^-}$ is $\rho_\mathbf{N}$, and since the outgoing capacity of every $\mathbf{x}_{p,z}$ is 1, every partition is associated to $\rho_\mathbf{N}$ distinct nodes. The fraction $\rho_\mathbf{Z}$ of the flow passing through every $\mathbf{p^+}$ must be spread over as many distinct zones as every arc outgoing from $\mathbf{p^+}$ has capacity 1. So the reconstructed $\alpha$ verifies the redundancy constraints. For every node $n$, the flow between $\mathbf{n}$ and $\mathbf{t}$ corresponds to the number of partitions associated to $n$. By construction of $f$, this does not exceed $\lfloor c_n/s \rfloor$. We assumed that the partition size is $s$, hence this association does not exceed the storage capacity of the nodes. In the other direction, given an assignment $\alpha$, one can similarly check that the facts that $\alpha$ respects the redundancy constraints, and the storage capacities of the nodes, are necessary condition to construct a maximal flow function $f$. \end{proof} @@ -272,16 +271,16 @@ The distance $d(f,f')$ is bounded by the maximal number of differences in the as The detection of negative cycle is done with the Bellman-Ford algorithm, whose complexity should normally be $O(\#E\#V)$. In our case, it amounts to $O(P^2ZN)$. Multiplied by the complexity of the outer loop, it amounts to $O(P^3ZN)$ which is a lot when the number of partitions and nodes starts to be large. To avoid that, we adapt the Bellman-Ford algorithm. -The Bellman-Ford algorithm runs $\#V$ iterations of an outer loop, and an inner loop over $E$. The idea is to compute the shortest paths from a source vertex $v$ to all other vertices. After $k$ iterations of the outer loop, the algorithm has computed all shortest path of length at most $k$. All shortest path have length at most $\#V$, so if there is an update in the last iteration of the loop, it means that there is a negative cycle in the graph. The observation that will enable us to improve the complexity is the following: +The Bellman-Ford algorithm runs $\#V$ iterations of an outer loop, and an inner loop over $E$. The idea is to compute the shortest paths from a source vertex $v$ to all other vertices. After $k$ iterations of the outer loop, the algorithm has computed all shortest path of length at most $k$. All simple paths have length at most $\#V-1$, so if there is an update in the last iteration of the loop, it means that there is a negative cycle in the graph. The observation that will enable us to improve the complexity is the following: \begin{proposition} - In the graph $G_f$ (and $G$), all simple paths and cycles have a length at most $6N$. + In the graph $G_f$ (and $G$), all simple paths have a length at most $4N$. \end{proposition} \begin{proof} - Since $f$ is a maximal flow, there is no outgoing edge from $\mathbf{s}$ in $G_f$. One can thus check than any simple path of length 6 must contain at least to node of type $\mathbf{n}$. Hence on a cycle, at most 6 arcs separate two successive nodes of type $\mathbf{n}$. + Since $f$ is a maximal flow, there is no outgoing edge from $\mathbf{s}$ in $G_f$. One can thus check than any simple path of length 4 must contain at least two node of type $\mathbf{n}$. Hence on a path, at most 4 arcs separate two successive nodes of type $\mathbf{n}$. \end{proof} -Thus, in the absence of negative cycles, shortest paths in $G_f$ have length at most $6N$. So we can do only $6N$ iterations of the outer loop in Bellman-Ford algorithm. This makes the complexity of the detection of one set of cycle to be $O(N\#E) = O(N^2 P)$. +Thus, in the absence of negative cycles, shortest paths in $G_f$ have length at most $4N$. So we can do only $4N+1$ iterations of the outer loop in Bellman-Ford algorithm. This makes the complexity of the detection of one set of cycle to be $O(N\#E) = O(N^2 P)$. With this improvement, the complexity of the whole algorithm is, in the worst case, $O(N^2P^2)$. However, since we detect several cycles at once and we start with a flow that might be close to the previous one, the number of iterations of the outer loop might be smaller in practice. diff --git a/src/rpc/graph_algo.rs b/src/rpc/graph_algo.rs new file mode 100644 index 00000000..1a809b80 --- /dev/null +++ b/src/rpc/graph_algo.rs @@ -0,0 +1,440 @@ + +//! This module deals with graph algorithms. +//! It is used in layout.rs to build the partition to node assignation. + +use rand::prelude::SliceRandom; +use std::cmp::{max, min}; +use std::collections::VecDeque; +use std::collections::HashMap; + +//Vertex data structures used in all the graphs used in layout.rs. +//usize parameters correspond to node/zone/partitions ids. +//To understand the vertex roles below, please refer to the formal description +//of the layout computation algorithm. +#[derive(Clone,Copy,Debug, PartialEq, Eq, Hash)] +pub enum Vertex{ + Source, + Pup(usize), //The vertex p+ of partition p + Pdown(usize), //The vertex p- of partition p + PZ(usize,usize), //The vertex corresponding to x_(partition p, zone z) + N(usize), //The vertex corresponding to node n + Sink +} + + +//Edge data structure for the flow algorithm. +//The graph is stored as an adjacency list +#[derive(Clone, Copy, Debug)] +pub struct FlowEdge { + cap: u32, //flow maximal capacity of the edge + flow: i32, //flow value on the edge + dest: usize, //destination vertex id + rev: usize, //index of the reversed edge (v, self) in the edge list of vertex v +} + +//Edge data structure for the detection of negative cycles. +//The graph is stored as a list of edges (u,v). +#[derive(Clone, Copy, Debug)] +pub struct WeightedEdge { + w: i32, //weight of the edge + dest: usize, +} + +pub trait Edge: Clone + Copy {} +impl Edge for FlowEdge {} +impl Edge for WeightedEdge {} + +//Struct for the graph structure. We do encapsulation here to be able to both +//provide user friendly Vertex enum to address vertices, and to use usize indices +//and Vec instead of HashMap in the graph algorithm to optimize execution speed. +pub struct Graph{ + vertextoid : HashMap, + idtovertex : Vec, + + graph : Vec< Vec > +} + +pub type CostFunction = HashMap<(Vertex,Vertex), i32>; + +impl Graph{ + pub fn new(vertices : &[Vertex]) -> Self { + let mut map = HashMap::::new(); + for i in 0..vertices.len() { + map.insert(vertices[i] , i); + } + return Graph:: { + vertextoid : map, + idtovertex: vertices.to_vec(), + graph : vec![Vec::< E >::new(); vertices.len() ] + } + } +} + +impl Graph{ + //This function adds a directed edge to the graph with capacity c, and the + //corresponding reversed edge with capacity 0. + pub fn add_edge(&mut self, u: Vertex, v:Vertex, c: u32) -> Result<(), String>{ + if !self.vertextoid.contains_key(&u) || !self.vertextoid.contains_key(&v) { + return Err("The graph does not contain the provided vertex.".to_string()); + } + let idu = self.vertextoid[&u]; + let idv = self.vertextoid[&v]; + let rev_u = self.graph[idu].len(); + let rev_v = self.graph[idv].len(); + self.graph[idu].push( FlowEdge{cap: c , dest: idv , flow: 0, rev : rev_v} ); + self.graph[idv].push( FlowEdge{cap: 0 , dest: idu , flow: 0, rev : rev_u} ); + Ok(()) + } + + //This function returns the list of vertices that receive a positive flow from + //vertex v. + pub fn get_positive_flow_from(&self , v:Vertex) -> Result< Vec , String>{ + if !self.vertextoid.contains_key(&v) { + return Err("The graph does not contain the provided vertex.".to_string()); + } + let idv = self.vertextoid[&v]; + let mut result = Vec::::new(); + for edge in self.graph[idv].iter() { + if edge.flow > 0 { + result.push(self.idtovertex[edge.dest]); + } + } + return Ok(result); + } + + + //This function returns the value of the flow incoming to v. + pub fn get_inflow(&self , v:Vertex) -> Result< i32 , String>{ + if !self.vertextoid.contains_key(&v) { + return Err("The graph does not contain the provided vertex.".to_string()); + } + let idv = self.vertextoid[&v]; + let mut result = 0; + for edge in self.graph[idv].iter() { + result += max(0,self.graph[edge.dest][edge.rev].flow); + } + return Ok(result); + } + + //This function returns the value of the flow outgoing from v. + pub fn get_outflow(&self , v:Vertex) -> Result< i32 , String>{ + if !self.vertextoid.contains_key(&v) { + return Err("The graph does not contain the provided vertex.".to_string()); + } + let idv = self.vertextoid[&v]; + let mut result = 0; + for edge in self.graph[idv].iter() { + result += max(0,edge.flow); + } + return Ok(result); + } + + //This function computes the flow total value by computing the outgoing flow + //from the source. + pub fn get_flow_value(&mut self) -> Result { + return self.get_outflow(Vertex::Source); + } + + //This function shuffles the order of the edge lists. It keeps the ids of the + //reversed edges consistent. + fn shuffle_edges(&mut self) { + let mut rng = rand::thread_rng(); + for i in 0..self.graph.len() { + self.graph[i].shuffle(&mut rng); + //We need to update the ids of the reverse edges. + for j in 0..self.graph[i].len() { + let target_v = self.graph[i][j].dest; + let target_rev = self.graph[i][j].rev; + self.graph[target_v][target_rev].rev = j; + } + } + } + + //Computes an upper bound of the flow n the graph + pub fn flow_upper_bound(&self) -> u32{ + let idsource = self.vertextoid[&Vertex::Source]; + let mut flow_upper_bound = 0; + for edge in self.graph[idsource].iter(){ + flow_upper_bound += edge.cap; + } + return flow_upper_bound; + } + + //This function computes the maximal flow using Dinic's algorithm. It starts with + //the flow values already present in the graph. So it is possible to add some edge to + //the graph, compute a flow, add other edges, update the flow. + pub fn compute_maximal_flow(&mut self) -> Result<(), String> { + if !self.vertextoid.contains_key(&Vertex::Source) { + return Err("The graph does not contain a source.".to_string()); + } + if !self.vertextoid.contains_key(&Vertex::Sink) { + return Err("The graph does not contain a sink.".to_string()); + } + + let idsource = self.vertextoid[&Vertex::Source]; + let idsink = self.vertextoid[&Vertex::Sink]; + + let nb_vertices = self.graph.len(); + + let flow_upper_bound = self.flow_upper_bound(); + + //To ensure the dispersion of the associations generated by the + //assignation, we shuffle the neighbours of the nodes. Hence, + //the vertices do not consider their neighbours in the same order. + self.shuffle_edges(); + + //We run Dinic's max flow algorithm + loop { + //We build the level array from Dinic's algorithm. + let mut level = vec![None; nb_vertices]; + + let mut fifo = VecDeque::new(); + fifo.push_back((idsource, 0)); + while !fifo.is_empty() { + if let Some((id, lvl)) = fifo.pop_front() { + if level[id] == None { //it means id has not yet been reached + level[id] = Some(lvl); + for edge in self.graph[id].iter() { + if edge.cap as i32 - edge.flow > 0 { + fifo.push_back((edge.dest, lvl + 1)); + } + } + } + } + } + if level[idsink] == None { + //There is no residual flow + break; + } + + //Now we run DFS respecting the level array + let mut next_nbd = vec![0; nb_vertices]; + let mut lifo = VecDeque::new(); + + lifo.push_back((idsource, flow_upper_bound)); + + while let Some((id_tmp, f_tmp)) = lifo.back() { + let id = *id_tmp; + let f = *f_tmp; + if id == idsink { + //The DFS reached the sink, we can add a + //residual flow. + lifo.pop_back(); + while !lifo.is_empty() { + if let Some((id, _)) = lifo.pop_back() { + let nbd = next_nbd[id]; + self.graph[id][nbd].flow += f as i32; + let id_rev = self.graph[id][nbd].dest; + let nbd_rev = self.graph[id][nbd].rev; + self.graph[id_rev][nbd_rev].flow -= f as i32; + } + } + lifo.push_back((idsource, flow_upper_bound)); + continue; + } + //else we did not reach the sink + let nbd = next_nbd[id]; + if nbd >= self.graph[id].len() { + //There is nothing to explore from id anymore + lifo.pop_back(); + if let Some((parent, _)) = lifo.back() { + next_nbd[*parent] += 1; + } + continue; + } + //else we can try to send flow from id to its nbd + let new_flow = min(f, self.graph[id][nbd].cap - self.graph[id][nbd].flow as u32 ); + if let (Some(lvldest), Some(lvlid)) = + (level[self.graph[id][nbd].dest], level[id]){ + if lvldest <= lvlid || new_flow == 0 { + //We cannot send flow to nbd. + next_nbd[id] += 1; + continue; + } + } + //otherwise, we send flow to nbd. + lifo.push_back((self.graph[id][nbd].dest, new_flow)); + } + } + Ok(()) + } + + //This function takes a flow, and a cost function on the edges, and tries to find an + // equivalent flow with a better cost, by finding improving overflow cycles. It uses + // as subroutine the Bellman Ford algorithm run up to path_length. + // We assume that the cost of edge (u,v) is the opposite of the cost of (v,u), and only + // one needs to be present in the cost function. + pub fn optimize_flow_with_cost(&mut self , cost: &CostFunction, path_length: usize ) + -> Result<(),String>{ + + //We build the weighted graph g where we will look for negative cycle + let mut gf = self.build_cost_graph(cost)?; + let mut cycles = gf.list_negative_cycles(path_length); + while cycles.len() > 0 { + //we enumerate negative cycles + for c in cycles.iter(){ + for i in 0..c.len(){ + //We add one flow unit to the edge (u,v) of cycle c + let idu = self.vertextoid[&c[i]]; + let idv = self.vertextoid[&c[(i+1)%c.len()]]; + for j in 0..self.graph[idu].len(){ + //since idu appears at most once in the cycles, we enumerate every + //edge at most once. + let edge = self.graph[idu][j]; + if edge.dest == idv { + self.graph[idu][j].flow += 1; + self.graph[idv][edge.rev].flow -=1; + break; + } + } + } + } + + gf = self.build_cost_graph(cost)?; + cycles = gf.list_negative_cycles(path_length); + } + return Ok(()); + } + + //Construct the weighted graph G_f from the flow and the cost function + fn build_cost_graph(&self , cost: &CostFunction) -> Result,String>{ + + let mut g = Graph::::new(&self.idtovertex); + let nb_vertices = self.idtovertex.len(); + for i in 0..nb_vertices { + for edge in self.graph[i].iter() { + if edge.cap as i32 -edge.flow > 0 { + //It is possible to send overflow through this edge + let u = self.idtovertex[i]; + let v = self.idtovertex[edge.dest]; + if cost.contains_key(&(u,v)) { + g.add_edge(u,v, cost[&(u,v)])?; + } + else if cost.contains_key(&(v,u)) { + g.add_edge(u,v, -cost[&(v,u)])?; + } + else{ + g.add_edge(u,v, 0)?; + } + } + } + } + return Ok(g); + + } + + +} + +impl Graph{ + //This function adds a single directed weighted edge to the graph. + pub fn add_edge(&mut self, u: Vertex, v:Vertex, w: i32) -> Result<(), String>{ + if !self.vertextoid.contains_key(&u) || !self.vertextoid.contains_key(&v) { + return Err("The graph does not contain the provided vertex.".to_string()); + } + let idu = self.vertextoid[&u]; + let idv = self.vertextoid[&v]; + self.graph[idu].push( WeightedEdge{w: w , dest: idv} ); + Ok(()) + } + + //This function lists the negative cycles it manages to find after path_length + //iterations of the main loop of the Bellman-Ford algorithm. For the classical + //algorithm, path_length needs to be equal to the number of vertices. However, + //for particular graph structures like our case, the algorithm is still correct + //when path_length is the length of the longest possible simple path. + //See the formal description of the algorithm for more details. + fn list_negative_cycles(&self, path_length: usize) -> Vec< Vec > { + + let nb_vertices = self.graph.len(); + + //We start with every vertex at distance 0 of some imaginary extra -1 vertex. + let mut distance = vec![0 ; nb_vertices]; + //The prev vector collects for every vertex from where does the shortest path come + let mut prev = vec![None; nb_vertices]; + + for _ in 0..path_length +1 { + for id in 0..nb_vertices{ + for e in self.graph[id].iter(){ + if distance[id] + e.w < distance[e.dest] { + distance[e.dest] = distance[id] + e.w; + prev[e.dest] = Some(id); + } + } + } + } + + //If self.graph contains a negative cycle, then at this point the graph described + //by prev (which is a directed 1-forest/functional graph) + //must contain a cycle. We list the cycles of prev. + let cycles_prev = cycles_of_1_forest(&prev); + + //Remark that the cycle in prev is in the reverse order compared to the cycle + //in the graph. Thus the .rev(). + return cycles_prev.iter().map(|cycle| cycle.iter().rev().map( + |id| self.idtovertex[*id] + ).collect() ).collect(); + } + +} + + +//This function returns the list of cycles of a directed 1 forest. It does not +//check for the consistency of the input. +fn cycles_of_1_forest(forest: &[Option]) -> Vec> { + let mut cycles = Vec::>::new(); + let mut time_of_discovery = vec![None; forest.len()]; + + for t in 0..forest.len(){ + let mut id = t; + //while we are on a valid undiscovered node + while time_of_discovery[id] == None { + time_of_discovery[id] = Some(t); + if let Some(i) = forest[id] { + id = i; + } + else{ + break; + } + } + if forest[id] != None && time_of_discovery[id] == Some(t) { + //We discovered an id that we explored at this iteration t. + //It means we are on a cycle + let mut cy = vec![id; 1]; + let id2 = id; + while let Some(id2) = forest[id2] { + if id2 != id { + cy.push(id2); + } + else { + break; + } + } + cycles.push(cy); + } + } + return cycles; +} + + +//==================================================================================== +//==================================================================================== +//==================================================================================== +//==================================================================================== +//==================================================================================== +//==================================================================================== + + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_flow() { + let left_vec = vec![3; 8]; + let right_vec = vec![0, 4, 8, 4, 8]; + //There are asserts in the function that computes the flow + } + + //maybe add tests relative to the matching optilization ? +} diff --git a/src/rpc/layout.rs b/src/rpc/layout.rs index 40f97368..ff60ce98 100644 --- a/src/rpc/layout.rs +++ b/src/rpc/layout.rs @@ -1,17 +1,23 @@ -use std::cmp::min; use std::cmp::Ordering; use std::collections::HashMap; +use std::collections::HashSet; + +use hex::ToHex; use serde::{Deserialize, Serialize}; -use garage_util::bipartite::*; use garage_util::crdt::{AutoCrdt, Crdt, LwwMap}; use garage_util::data::*; -use rand::prelude::SliceRandom; +use crate::graph_algo::*; use crate::ring::*; +use std::convert::TryInto; + +//The Message type will be used to collect information on the algorithm. +type Message = Vec; + /// The layout of the cluster, i.e. the list of roles /// which are assigned to each cluster node #[derive(Clone, Debug, Serialize, Deserialize)] @@ -19,12 +25,21 @@ pub struct ClusterLayout { pub version: u64, pub replication_factor: usize, + #[serde(default="default_one")] + pub zone_redundancy: usize, + + //This attribute is only used to retain the previously computed partition size, + //to know to what extent does it change with the layout update. + #[serde(default="default_zero")] + pub partition_size: u32, + pub roles: LwwMap, /// node_id_vec: a vector of node IDs with a role assigned /// in the system (this includes gateway nodes). /// The order here is different than the vec stored by `roles`, because: - /// 1. non-gateway nodes are first so that they have lower numbers + /// 1. non-gateway nodes are first so that they have lower numbers holding + /// in u8 (the number of non-gateway nodes is at most 256). /// 2. nodes that don't have a role are excluded (but they need to /// stay in the CRDT as tombstones) pub node_id_vec: Vec, @@ -38,6 +53,15 @@ pub struct ClusterLayout { pub staging_hash: Hash, } +fn default_one() -> usize{ + return 1; +} +fn default_zero() -> u32{ + return 0; +} + +const NB_PARTITIONS : usize = 1usize << PARTITION_BITS; + #[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Debug, Serialize, Deserialize)] pub struct NodeRoleV(pub Option); @@ -66,16 +90,31 @@ impl NodeRole { None => "gateway".to_string(), } } + + pub fn tags_string(&self) -> String { + let mut tags = String::new(); + if self.tags.len() == 0 { + return tags + } + tags.push_str(&self.tags[0].clone()); + for t in 1..self.tags.len(){ + tags.push_str(","); + tags.push_str(&self.tags[t].clone()); + } + return tags; + } } impl ClusterLayout { - pub fn new(replication_factor: usize) -> Self { + pub fn new(replication_factor: usize, zone_redundancy: usize) -> Self { let empty_lwwmap = LwwMap::new(); let empty_lwwmap_hash = blake2sum(&rmp_to_vec_all_named(&empty_lwwmap).unwrap()[..]); ClusterLayout { version: 0, replication_factor, + zone_redundancy, + partition_size: 0, roles: LwwMap::new(), node_id_vec: Vec::new(), ring_assignation_data: Vec::new(), @@ -122,6 +161,44 @@ impl ClusterLayout { } } + ///Returns the uuids of the non_gateway nodes in self.node_id_vec. + pub fn useful_nodes(&self) -> Vec { + let mut result = Vec::::new(); + for uuid in self.node_id_vec.iter() { + match self.node_role(uuid) { + Some(role) if role.capacity != None => result.push(*uuid), + _ => () + } + } + return result; + } + + ///Given a node uuids, this function returns the label of its zone + pub fn get_node_zone(&self, uuid : &Uuid) -> Result { + match self.node_role(uuid) { + Some(role) => return Ok(role.zone.clone()), + _ => return Err("The Uuid does not correspond to a node present in the cluster.".to_string()) + } + } + + ///Given a node uuids, this function returns its capacity or fails if it does not have any + pub fn get_node_capacity(&self, uuid : &Uuid) -> Result { + match self.node_role(uuid) { + Some(NodeRole{capacity : Some(cap), zone: _, tags: _}) => return Ok(*cap), + _ => return Err("The Uuid does not correspond to a node present in the cluster or this node does not have a positive capacity.".to_string()) + } + } + + ///Returns the sum of capacities of non gateway nodes in the cluster + pub fn get_total_capacity(&self) -> Result { + let mut total_capacity = 0; + for uuid in self.useful_nodes().iter() { + total_capacity += self.get_node_capacity(uuid)?; + } + return Ok(total_capacity); + } + + /// Check a cluster layout for internal consistency /// returns true if consistent, false if error pub fn check(&self) -> bool { @@ -168,342 +245,412 @@ impl ClusterLayout { true } +} + +impl ClusterLayout { /// This function calculates a new partition-to-node assignation. - /// The computed assignation maximizes the capacity of a + /// The computed assignation respects the node replication factor + /// and the zone redundancy parameter It maximizes the capacity of a /// partition (assuming all partitions have the same size). /// Among such optimal assignation, it minimizes the distance to /// the former assignation (if any) to minimize the amount of - /// data to be moved. A heuristic ensures node triplets - /// dispersion (in garage_util::bipartite::optimize_matching()). - pub fn calculate_partition_assignation(&mut self) -> bool { + /// data to be moved. + pub fn calculate_partition_assignation(&mut self, replication:usize, redundancy:usize) -> Result { //The nodes might have been updated, some might have been deleted. //So we need to first update the list of nodes and retrieve the //assignation. - let old_node_assignation = self.update_nodes_and_ring(); + + //We update the node ids, since the node list might have changed with the staged + //changes in the layout. We retrieve the old_assignation reframed with the new ids + let old_assignation_opt = self.update_node_id_vec()?; + self.replication_factor = replication; + self.zone_redundancy = redundancy; + + let mut msg = Message::new(); + msg.push(format!("Computation of a new cluster layout where partitions are + replicated {} times on at least {} distinct zones.", replication, redundancy)); - let (node_zone, _) = self.get_node_zone_capacity(); + //We generate for once numerical ids for the zone, to use them as indices in the + //flow graphs. + let (id_to_zone , zone_to_id) = self.generate_zone_ids()?; - //We compute the optimal number of partition to assign to - //every node and zone. - if let Some((part_per_nod, part_per_zone)) = self.optimal_proportions() { - //We collect part_per_zone in a vec to not rely on the - //arbitrary order in which elements are iterated in - //Hashmap::iter() - let part_per_zone_vec = part_per_zone - .iter() - .map(|(x, y)| (x.clone(), *y)) - .collect::>(); - //We create an indexing of the zones - let mut zone_id = HashMap::::new(); - for (i, ppz) in part_per_zone_vec.iter().enumerate() { - zone_id.insert(ppz.0.clone(), i); - } + msg.push(format!("The cluster contains {} nodes spread over {} zones.", + self.useful_nodes().len(), id_to_zone.len())); + + //We compute the optimal partition size + let partition_size = self.compute_optimal_partition_size(&zone_to_id)?; + if old_assignation_opt != None { + msg.push(format!("Given the replication and redundancy constraint, the + optimal size of a partition is {}. In the previous layout, it used to + be {}.", partition_size, self.partition_size)); + } + else { + msg.push(format!("Given the replication and redundancy constraints, the + optimal size of a partition is {}.", partition_size)); + } + self.partition_size = partition_size; - //We compute a candidate for the new partition to zone - //assignation. - let nb_zones = part_per_zone.len(); - let nb_nodes = part_per_nod.len(); - let nb_partitions = 1 << PARTITION_BITS; - let left_cap_vec = vec![self.replication_factor as u32; nb_partitions]; - let right_cap_vec = part_per_zone_vec.iter().map(|(_, y)| *y as u32).collect(); - let mut zone_assignation = dinic_compute_matching(left_cap_vec, right_cap_vec); + //We compute a first flow/assignment that is heuristically close to the previous + //assignment + let mut gflow = self.compute_candidate_assignment( &zone_to_id, &old_assignation_opt)?; - //We create the structure for the partition-to-node assignation. - let mut node_assignation = vec![vec![None; self.replication_factor]; nb_partitions]; - //We will decrement part_per_nod to keep track of the number - //of partitions that we still have to associate. - let mut part_per_nod = part_per_nod; + if let Some(assoc) = &old_assignation_opt { + //We minimize the distance to the previous assignment. + self.minimize_rebalance_load(&mut gflow, &zone_to_id, &assoc)?; + } - //We minimize the distance to the former assignation(if any) + msg.append(&mut self.output_stat(&gflow, &old_assignation_opt, &zone_to_id,&id_to_zone)?); - //We get the id of the zones of the former assignation - //(and the id no_zone if there is no node assignated) - let no_zone = part_per_zone_vec.len(); - let old_zone_assignation: Vec> = old_node_assignation - .iter() - .map(|x| { - x.iter() - .map(|id| match *id { - Some(i) => zone_id[&node_zone[i]], - None => no_zone, - }) - .collect() - }) - .collect(); - - //We minimize the distance to the former zone assignation - zone_assignation = - optimize_matching(&old_zone_assignation, &zone_assignation, nb_zones + 1); //+1 for no_zone - - //We need to assign partitions to nodes in their zone - //We first put the nodes assignation that can stay the same - for i in 0..nb_partitions { - for j in 0..self.replication_factor { - if let Some(Some(former_node)) = old_node_assignation[i].iter().find(|x| { - if let Some(id) = x { - zone_id[&node_zone[*id]] == zone_assignation[i][j] - } else { - false - } - }) { - if part_per_nod[*former_node] > 0 { - node_assignation[i][j] = Some(*former_node); - part_per_nod[*former_node] -= 1; - } - } - } - } - - //We complete the assignation of partitions to nodes - let mut rng = rand::thread_rng(); - for i in 0..nb_partitions { - for j in 0..self.replication_factor { - if node_assignation[i][j] == None { - let possible_nodes: Vec = (0..nb_nodes) - .filter(|id| { - zone_id[&node_zone[*id]] == zone_assignation[i][j] - && part_per_nod[*id] > 0 - }) - .collect(); - assert!(!possible_nodes.is_empty()); - //We randomly pick a node - if let Some(nod) = possible_nodes.choose(&mut rng) { - node_assignation[i][j] = Some(*nod); - part_per_nod[*nod] -= 1; - } - } - } - } - - //We write the assignation in the 1D table - self.ring_assignation_data = Vec::::new(); - for ass in node_assignation { - for nod in ass { - if let Some(id) = nod { - self.ring_assignation_data.push(id as CompactNodeType); - } else { - panic!() - } - } - } - - true - } else { - false - } - } + //We update the layout structure + self.update_ring_from_flow(id_to_zone.len() , &gflow)?; + return Ok(msg); + } /// The LwwMap of node roles might have changed. This function updates the node_id_vec /// and returns the assignation given by ring, with the new indices of the nodes, and - /// None of the node is not present anymore. + /// None if the node is not present anymore. /// We work with the assumption that only this function and calculate_new_assignation /// do modify assignation_ring and node_id_vec. - fn update_nodes_and_ring(&mut self) -> Vec>> { + fn update_node_id_vec(&mut self) -> Result< Option< Vec > > ,String> { + // (1) We compute the new node list + //Non gateway nodes should be coded on 8bits, hence they must be first in the list + //We build the new node ids + let mut new_non_gateway_nodes: Vec = self.roles.items().iter() + .filter(|(_, _, v)| + match &v.0 {Some(r) if r.capacity != None => true, _=> false }) + .map(|(k, _, _)| *k).collect(); + + if new_non_gateway_nodes.len() > MAX_NODE_NUMBER { + return Err(format!("There are more than {} non-gateway nodes in the new layout. This is not allowed.", MAX_NODE_NUMBER).to_string()); + } + + let mut new_gateway_nodes: Vec = self.roles.items().iter() + .filter(|(_, _, v)| + match v {NodeRoleV(Some(r)) if r.capacity == None => true, _=> false }) + .map(|(k, _, _)| *k).collect(); + + let nb_useful_nodes = new_non_gateway_nodes.len(); + let mut new_node_id_vec = Vec::::new(); + new_node_id_vec.append(&mut new_non_gateway_nodes); + new_node_id_vec.append(&mut new_gateway_nodes); + + + // (2) We retrieve the old association + //We rewrite the old association with the new indices. We only consider partition + //to node assignations where the node is still in use. + let nb_partitions = 1usize << PARTITION_BITS; + let mut old_assignation = vec![ Vec::::new() ; nb_partitions]; + + if self.ring_assignation_data.len() == 0 { + //This is a new association + return Ok(None); + } + if self.ring_assignation_data.len() != nb_partitions * self.replication_factor { + return Err("The old assignation does not have a size corresponding to the old replication factor or the number of partitions.".to_string()); + } + + //We build a translation table between the uuid and new ids + let mut uuid_to_new_id = HashMap::::new(); + + //We add the indices of only the new non-gateway nodes that can be used in the + //association ring + for i in 0..nb_useful_nodes { + uuid_to_new_id.insert(new_node_id_vec[i], i ); + } + + let rf= self.replication_factor; + for p in 0..nb_partitions { + for old_id in &self.ring_assignation_data[p*rf..(p+1)*rf] { + let uuid = self.node_id_vec[*old_id as usize]; + if uuid_to_new_id.contains_key(&uuid) { + old_assignation[p].push(uuid_to_new_id[&uuid]); + } + } + } + + //We write the results + self.node_id_vec = new_node_id_vec; + self.ring_assignation_data = Vec::::new(); + + return Ok(Some(old_assignation)); + } + + + ///This function generates ids for the zone of the nodes appearing in + ///self.node_id_vec. + fn generate_zone_ids(&self) -> Result<(Vec, HashMap),String>{ + let mut id_to_zone = Vec::::new(); + let mut zone_to_id = HashMap::::new(); + + for uuid in self.node_id_vec.iter() { + if self.roles.get(uuid) == None { + return Err("The uuid was not found in the node roles (this should not happen, it might be a critical error).".to_string()); + } + match self.node_role(&uuid) { + Some(r) => if !zone_to_id.contains_key(&r.zone) && r.capacity != None { + zone_to_id.insert(r.zone.clone() , id_to_zone.len()); + id_to_zone.push(r.zone.clone()); + } + _ => () + } + } + return Ok((id_to_zone, zone_to_id)); + } + + ///This function computes by dichotomy the largest realizable partition size, given + ///the layout. + fn compute_optimal_partition_size(&self, zone_to_id: &HashMap) -> Result{ + let nb_partitions = 1usize << PARTITION_BITS; + let empty_set = HashSet::<(usize,usize)>::new(); + let mut g = self.generate_flow_graph(1, zone_to_id, &empty_set)?; + g.compute_maximal_flow()?; + if g.get_flow_value()? < (nb_partitions*self.replication_factor).try_into().unwrap() { + return Err("The storage capacity of he cluster is to small. It is impossible to store partitions of size 1.".to_string()); + } + + let mut s_down = 1; + let mut s_up = self.get_total_capacity()?; + while s_down +1 < s_up { + g = self.generate_flow_graph((s_down+s_up)/2, zone_to_id, &empty_set)?; + g.compute_maximal_flow()?; + if g.get_flow_value()? < (nb_partitions*self.replication_factor).try_into().unwrap() { + s_up = (s_down+s_up)/2; + } + else { + s_down = (s_down+s_up)/2; + } + } + + return Ok(s_down); + } + + fn generate_graph_vertices(nb_zones : usize, nb_nodes : usize) -> Vec { + let mut vertices = vec![Vertex::Source, Vertex::Sink]; + for p in 0..NB_PARTITIONS { + vertices.push(Vertex::Pup(p)); + vertices.push(Vertex::Pdown(p)); + for z in 0..nb_zones { + vertices.push(Vertex::PZ(p, z)); + } + } + for n in 0..nb_nodes { + vertices.push(Vertex::N(n)); + } + return vertices; + } + + fn generate_flow_graph(&self, size: u32, zone_to_id: &HashMap, exclude_assoc : &HashSet<(usize,usize)>) -> Result, String> { + let vertices = ClusterLayout::generate_graph_vertices(zone_to_id.len(), + self.useful_nodes().len()); + let mut g= Graph::::new(&vertices); + let nb_zones = zone_to_id.len(); + for p in 0..NB_PARTITIONS { + g.add_edge(Vertex::Source, Vertex::Pup(p), self.zone_redundancy as u32)?; + g.add_edge(Vertex::Source, Vertex::Pdown(p), (self.replication_factor - self.zone_redundancy) as u32)?; + for z in 0..nb_zones { + g.add_edge(Vertex::Pup(p) , Vertex::PZ(p,z) , 1)?; + g.add_edge(Vertex::Pdown(p) , Vertex::PZ(p,z) , + self.replication_factor as u32)?; + } + } + for n in 0..self.useful_nodes().len() { + let node_capacity = self.get_node_capacity(&self.node_id_vec[n])?; + let node_zone = zone_to_id[&self.get_node_zone(&self.node_id_vec[n])?]; + g.add_edge(Vertex::N(n), Vertex::Sink, node_capacity/size)?; + for p in 0..NB_PARTITIONS { + if !exclude_assoc.contains(&(p,n)) { + g.add_edge(Vertex::PZ(p, node_zone), Vertex::N(n), 1)?; + } + } + } + return Ok(g); + } + + + fn compute_candidate_assignment(&self, zone_to_id: &HashMap, + old_assoc_opt : &Option >>) -> Result, String > { + + //We list the edges that are not used in the old association + let mut exclude_edge = HashSet::<(usize,usize)>::new(); + if let Some(old_assoc) = old_assoc_opt { + let nb_nodes = self.useful_nodes().len(); + for p in 0..NB_PARTITIONS { + for n in 0..nb_nodes { + exclude_edge.insert((p,n)); + } + for n in old_assoc[p].iter() { + exclude_edge.remove(&(p,*n)); + } + } + } + + //We compute the best flow using only the edges used in the old assoc + let mut g = self.generate_flow_graph(self.partition_size, zone_to_id, &exclude_edge )?; + g.compute_maximal_flow()?; + for (p,n) in exclude_edge.iter() { + let node_zone = zone_to_id[&self.get_node_zone(&self.node_id_vec[*n])?]; + g.add_edge(Vertex::PZ(*p,node_zone), Vertex::N(*n), 1)?; + } + g.compute_maximal_flow()?; + return Ok(g); + } + + fn minimize_rebalance_load(&self, gflow: &mut Graph, zone_to_id: &HashMap, old_assoc : &Vec< Vec >) -> Result<(), String > { + let mut cost = CostFunction::new(); + for p in 0..NB_PARTITIONS { + for n in old_assoc[p].iter() { + let node_zone = zone_to_id[&self.get_node_zone(&self.node_id_vec[*n])?]; + cost.insert((Vertex::PZ(p,node_zone), Vertex::N(*n)), -1); + } + } + let nb_nodes = self.useful_nodes().len(); + let path_length = 4*nb_nodes; + gflow.optimize_flow_with_cost(&cost, path_length)?; + + return Ok(()); + } + + fn update_ring_from_flow(&mut self, nb_zones : usize, gflow: &Graph ) -> Result<(), String>{ + self.ring_assignation_data = Vec::::new(); + for p in 0..NB_PARTITIONS { + for z in 0..nb_zones { + let assoc_vertex = gflow.get_positive_flow_from(Vertex::PZ(p,z))?; + for vertex in assoc_vertex.iter() { + match vertex{ + Vertex::N(n) => self.ring_assignation_data.push((*n).try_into().unwrap()), + _ => () + } + } + } + } + + if self.ring_assignation_data.len() != NB_PARTITIONS*self.replication_factor { + return Err("Critical Error : the association ring we produced does not have the right size.".to_string()); + } + return Ok(()); + } + + + //This function returns a message summing up the partition repartition of the new + //layout. + fn output_stat(&self , gflow : &Graph, + old_assoc_opt : &Option< Vec> >, + zone_to_id: &HashMap, + id_to_zone : &Vec) -> Result{ + let mut msg = Message::new(); + let nb_partitions = 1usize << PARTITION_BITS; - let mut node_assignation = vec![vec![None; self.replication_factor]; nb_partitions]; - let rf = self.replication_factor; - let ring = &self.ring_assignation_data; + let used_cap = self.partition_size * nb_partitions as u32 * + self.replication_factor as u32; + let total_cap = self.get_total_capacity()?; + let percent_cap = 100.0*(used_cap as f32)/(total_cap as f32); + msg.push(format!("Available capacity / Total cluster capacity: {} / {} ({:.1} %)", + used_cap , total_cap , percent_cap )); + msg.push(format!("If the percentage is to low, it might be that the replication/redundancy constraints force the use of nodes/zones with small storage capacities. + You might want to rebalance the storage capacities or relax the constraints. See the detailed statistics below and look for saturated nodes/zones.")); + msg.push(format!("Recall that because of the replication, the actual available storage capacity is {} / {} = {}.", used_cap , self.replication_factor , used_cap/self.replication_factor as u32)); + + //We define and fill in the following tables + let storing_nodes = self.useful_nodes(); + let mut new_partitions = vec![0; storing_nodes.len()]; + let mut stored_partitions = vec![0; storing_nodes.len()]; - let new_node_id_vec: Vec = self.roles.items().iter().map(|(k, _, _)| *k).collect(); + let mut new_partitions_zone = vec![0; id_to_zone.len()]; + let mut stored_partitions_zone = vec![0; id_to_zone.len()]; - if ring.len() == rf * nb_partitions { - for i in 0..nb_partitions { - for j in 0..self.replication_factor { - node_assignation[i][j] = new_node_id_vec - .iter() - .position(|id| *id == self.node_id_vec[ring[i * rf + j] as usize]); - } - } - } + for p in 0..nb_partitions { + for z in 0..id_to_zone.len() { + let pz_nodes = gflow.get_positive_flow_from(Vertex::PZ(p,z))?; + if pz_nodes.len() > 0 { + stored_partitions_zone[z] += 1; + } + for vert in pz_nodes.iter() { + if let Vertex::N(n) = *vert { + stored_partitions[n] += 1; + if let Some(old_assoc) = old_assoc_opt { + if !old_assoc[p].contains(&n) { + new_partitions[n] += 1; + } + } + } + } + if let Some(old_assoc) = old_assoc_opt { + let mut old_zones_of_p = Vec::::new(); + for n in old_assoc[p].iter() { + old_zones_of_p.push( + zone_to_id[&self.get_node_zone(&self.node_id_vec[*n])?]); + } + if !old_zones_of_p.contains(&z) { + new_partitions_zone[z] += 1; + } + } + } + } + + //We display the statistics - self.node_id_vec = new_node_id_vec; - self.ring_assignation_data = vec![]; - node_assignation - } + if *old_assoc_opt != None { + let total_new_partitions : usize = new_partitions.iter().sum(); + msg.push(format!("A total of {} new copies of partitions need to be \ + transferred.", total_new_partitions)); + } + msg.push(format!("")); + msg.push(format!("Detailed statistics by zones and nodes.")); + + for z in 0..id_to_zone.len(){ + let mut nodes_of_z = Vec::::new(); + for n in 0..storing_nodes.len(){ + if self.get_node_zone(&self.node_id_vec[n])? == id_to_zone[z] { + nodes_of_z.push(n); + } + } + let replicated_partitions : usize = nodes_of_z.iter() + .map(|n| stored_partitions[*n]).sum(); + msg.push(format!("")); + + if *old_assoc_opt != None { + msg.push(format!("Zone {}: {} distinct partitions stored ({} new, \ + {} partition copies) ", id_to_zone[z], stored_partitions_zone[z], + new_partitions_zone[z], replicated_partitions)); + } + else{ + msg.push(format!("Zone {}: {} distinct partitions stored ({} partition \ + copies) ", + id_to_zone[z], stored_partitions_zone[z], replicated_partitions)); + } + + let available_cap_z : u32 = self.partition_size*replicated_partitions as u32; + let mut total_cap_z = 0; + for n in nodes_of_z.iter() { + total_cap_z += self.get_node_capacity(&self.node_id_vec[*n])?; + } + let percent_cap_z = 100.0*(available_cap_z as f32)/(total_cap_z as f32); + msg.push(format!(" Available capacity / Total capacity: {}/{} ({:.1}%).", + available_cap_z, total_cap_z, percent_cap_z)); + msg.push(format!("")); + + for n in nodes_of_z.iter() { + let available_cap_n = stored_partitions[*n] as u32 *self.partition_size; + let total_cap_n =self.get_node_capacity(&self.node_id_vec[*n])?; + let tags_n = (self.node_role(&self.node_id_vec[*n]) + .ok_or("Node not found."))?.tags_string(); + msg.push(format!(" Node {}: {} partitions ({} new) ; \ + available/total capacity: {} / {} ({:.1}%) ; tags:{}", + &self.node_id_vec[*n].to_vec().encode_hex::(), + stored_partitions[*n], + new_partitions[*n], available_cap_n, total_cap_n, + (available_cap_n as f32)/(total_cap_n as f32)*100.0 , + tags_n)); + } + } - ///This function compute the number of partition to assign to - ///every node and zone, so that every partition is replicated - ///self.replication_factor times and the capacity of a partition - ///is maximized. - fn optimal_proportions(&mut self) -> Option<(Vec, HashMap)> { - let mut zone_capacity: HashMap = HashMap::new(); - - let (node_zone, node_capacity) = self.get_node_zone_capacity(); - let nb_nodes = self.node_id_vec.len(); - - for i in 0..nb_nodes { - if zone_capacity.contains_key(&node_zone[i]) { - zone_capacity.insert( - node_zone[i].clone(), - zone_capacity[&node_zone[i]] + node_capacity[i], - ); - } else { - zone_capacity.insert(node_zone[i].clone(), node_capacity[i]); - } - } - - //Compute the optimal number of partitions per zone - let sum_capacities: u32 = zone_capacity.values().sum(); - - if sum_capacities == 0 { - println!("No storage capacity in the network."); - return None; - } - - let nb_partitions = 1 << PARTITION_BITS; - - //Initially we would like to use zones porportionally to - //their capacity. - //However, a large zone can be associated to at most - //nb_partitions to ensure replication of the date. - //So we take the min with nb_partitions: - let mut part_per_zone: HashMap = zone_capacity - .iter() - .map(|(k, v)| { - ( - k.clone(), - min( - nb_partitions, - (self.replication_factor * nb_partitions * *v as usize) - / sum_capacities as usize, - ), - ) - }) - .collect(); - - //The replication_factor-1 upper bounds the number of - //part_per_zones that are greater than nb_partitions - for _ in 1..self.replication_factor { - //The number of partitions that are not assignated to - //a zone that takes nb_partitions. - let sum_capleft: u32 = zone_capacity - .keys() - .filter(|k| part_per_zone[*k] < nb_partitions) - .map(|k| zone_capacity[k]) - .sum(); - - //The number of replication of the data that we need - //to ensure. - let repl_left = self.replication_factor - - part_per_zone - .values() - .filter(|x| **x == nb_partitions) - .count(); - if repl_left == 0 { - break; - } - - for k in zone_capacity.keys() { - if part_per_zone[k] != nb_partitions { - part_per_zone.insert( - k.to_string(), - min( - nb_partitions, - (nb_partitions * zone_capacity[k] as usize * repl_left) - / sum_capleft as usize, - ), - ); - } - } - } - - //Now we divide the zone's partition share proportionally - //between their nodes. - - let mut part_per_nod: Vec = (0..nb_nodes) - .map(|i| { - (part_per_zone[&node_zone[i]] * node_capacity[i] as usize) - / zone_capacity[&node_zone[i]] as usize - }) - .collect(); - - //We must update the part_per_zone to make it correspond to - //part_per_nod (because of integer rounding) - part_per_zone = part_per_zone.iter().map(|(k, _)| (k.clone(), 0)).collect(); - for i in 0..nb_nodes { - part_per_zone.insert( - node_zone[i].clone(), - part_per_zone[&node_zone[i]] + part_per_nod[i], - ); - } - - //Because of integer rounding, the total sum of part_per_nod - //might not be replication_factor*nb_partitions. - // We need at most to add 1 to every non maximal value of - // part_per_nod. The capacity of a partition will be bounded - // by the minimal value of - // node_capacity_vec[i]/part_per_nod[i] - // so we try to maximize this minimal value, keeping the - // part_per_zone capped - - let discrepancy: usize = - nb_partitions * self.replication_factor - part_per_nod.iter().sum::(); - - //We use a stupid O(N^2) algorithm. If the number of nodes - //is actually expected to be high, one should optimize this. - - for _ in 0..discrepancy { - if let Some(idmax) = (0..nb_nodes) - .filter(|i| part_per_zone[&node_zone[*i]] < nb_partitions) - .max_by(|i, j| { - (node_capacity[*i] * (part_per_nod[*j] + 1) as u32) - .cmp(&(node_capacity[*j] * (part_per_nod[*i] + 1) as u32)) - }) { - part_per_nod[idmax] += 1; - part_per_zone.insert( - node_zone[idmax].clone(), - part_per_zone[&node_zone[idmax]] + 1, - ); - } - } - - //We check the algorithm consistency - - let discrepancy: usize = - nb_partitions * self.replication_factor - part_per_nod.iter().sum::(); - assert!(discrepancy == 0); - assert!(if let Some(v) = part_per_zone.values().max() { - *v <= nb_partitions - } else { - false - }); - - Some((part_per_nod, part_per_zone)) - } - - //Returns vectors of zone and capacity; indexed by the same (temporary) - //indices as node_id_vec. - fn get_node_zone_capacity(&self) -> (Vec, Vec) { - let node_zone = self - .node_id_vec - .iter() - .map(|id_nod| match self.node_role(id_nod) { - Some(NodeRole { - zone, - capacity: _, - tags: _, - }) => zone.clone(), - _ => "".to_string(), - }) - .collect(); - - let node_capacity = self - .node_id_vec - .iter() - .map(|id_nod| match self.node_role(id_nod) { - Some(NodeRole { - zone: _, - capacity: Some(c), - tags: _, - }) => *c, - _ => 0, - }) - .collect(); - - (node_zone, node_capacity) - } + return Ok(msg); + } + } +//==================================================================================== + #[cfg(test)] mod tests { use super::*; diff --git a/src/rpc/lib.rs b/src/rpc/lib.rs index 392ff48f..1036a8e1 100644 --- a/src/rpc/lib.rs +++ b/src/rpc/lib.rs @@ -8,9 +8,11 @@ mod consul; mod kubernetes; pub mod layout; +pub mod graph_algo; pub mod ring; pub mod system; + mod metrics; pub mod rpc_helper; diff --git a/src/rpc/ring.rs b/src/rpc/ring.rs index 73a126a2..743a5cba 100644 --- a/src/rpc/ring.rs +++ b/src/rpc/ring.rs @@ -40,6 +40,7 @@ pub struct Ring { // Type to store compactly the id of a node in the system // Change this to u16 the day we want to have more than 256 nodes in a cluster pub type CompactNodeType = u8; +pub const MAX_NODE_NUMBER: usize = 256; // The maximum number of times an object might get replicated // This must be at least 3 because Garage supports 3-way replication diff --git a/src/rpc/system.rs b/src/rpc/system.rs index 68d94ea5..313671ca 100644 --- a/src/rpc/system.rs +++ b/src/rpc/system.rs @@ -97,6 +97,7 @@ pub struct System { kubernetes_discovery: Option, replication_factor: usize, + zone_redundancy: usize, /// The ring pub ring: watch::Receiver>, @@ -192,6 +193,7 @@ impl System { network_key: NetworkKey, background: Arc, replication_factor: usize, + zone_redundancy: usize, config: &Config, ) -> Arc { let node_key = @@ -211,7 +213,7 @@ impl System { "No valid previous cluster layout stored ({}), starting fresh.", e ); - ClusterLayout::new(replication_factor) + ClusterLayout::new(replication_factor, zone_redundancy) } }; @@ -285,6 +287,7 @@ impl System { rpc: RpcHelper::new(netapp.id.into(), fullmesh, background.clone(), ring.clone()), system_endpoint, replication_factor, + zone_redundancy, rpc_listen_addr: config.rpc_bind_addr, rpc_public_addr, bootstrap_peers: config.bootstrap_peers.clone(), diff --git a/src/util/bipartite.rs b/src/util/bipartite.rs deleted file mode 100644 index 1e1e9caa..00000000 --- a/src/util/bipartite.rs +++ /dev/null @@ -1,363 +0,0 @@ -/* - * This module deals with graph algorithm in complete bipartite - * graphs. It is used in layout.rs to build the partition to node - * assignation. - * */ - -use rand::prelude::SliceRandom; -use std::cmp::{max, min}; -use std::collections::VecDeque; - -//Graph data structure for the flow algorithm. -#[derive(Clone, Copy, Debug)] -struct EdgeFlow { - c: i32, - flow: i32, - v: usize, - rev: usize, -} - -//Graph data structure for the detection of positive cycles. -#[derive(Clone, Copy, Debug)] -struct WeightedEdge { - w: i32, - u: usize, - v: usize, -} - -/* This function takes two matchings (old_match and new_match) in a - * complete bipartite graph. It returns a matching that has the - * same degree as new_match at every vertex, and that is as close - * as possible to old_match. - * */ -pub fn optimize_matching( - old_match: &[Vec], - new_match: &[Vec], - nb_right: usize, -) -> Vec> { - let nb_left = old_match.len(); - let ed = WeightedEdge { w: -1, u: 0, v: 0 }; - let mut edge_vec = vec![ed; nb_left * nb_right]; - - //We build the complete bipartite graph structure, represented - //by the list of all edges. - for i in 0..nb_left { - for j in 0..nb_right { - edge_vec[i * nb_right + j].u = i; - edge_vec[i * nb_right + j].v = nb_left + j; - } - } - - for i in 0..edge_vec.len() { - //We add the old matchings - if old_match[edge_vec[i].u].contains(&(edge_vec[i].v - nb_left)) { - edge_vec[i].w *= -1; - } - //We add the new matchings - if new_match[edge_vec[i].u].contains(&(edge_vec[i].v - nb_left)) { - (edge_vec[i].u, edge_vec[i].v) = (edge_vec[i].v, edge_vec[i].u); - edge_vec[i].w *= -1; - } - } - //Now edge_vec is a graph where edges are oriented LR if we - //can add them to new_match, and RL otherwise. If - //adding/removing them makes the matching closer to old_match - //they have weight 1; and -1 otherwise. - - //We shuffle the edge list so that there is no bias depending in - //partitions/zone label in the triplet dispersion - let mut rng = rand::thread_rng(); - edge_vec.shuffle(&mut rng); - - //Discovering and flipping a cycle with positive weight in this - //graph will make the matching closer to old_match. - //We use Bellman Ford algorithm to discover positive cycles - while let Some(cycle) = positive_cycle(&edge_vec, nb_left, nb_right) { - for i in cycle { - //We flip the edges of the cycle. - (edge_vec[i].u, edge_vec[i].v) = (edge_vec[i].v, edge_vec[i].u); - edge_vec[i].w *= -1; - } - } - - //The optimal matching is build from the graph structure. - let mut matching = vec![Vec::::new(); nb_left]; - for e in edge_vec { - if e.u > e.v { - matching[e.v].push(e.u - nb_left); - } - } - matching -} - -//This function finds a positive cycle in a bipartite wieghted graph. -fn positive_cycle( - edge_vec: &[WeightedEdge], - nb_left: usize, - nb_right: usize, -) -> Option> { - let nb_side_min = min(nb_left, nb_right); - let nb_vertices = nb_left + nb_right; - let weight_lowerbound = -((nb_left + nb_right) as i32) - 1; - let mut accessed = vec![false; nb_left]; - - //We try to find a positive cycle accessible from the left - //vertex i. - for i in 0..nb_left { - if accessed[i] { - continue; - } - let mut weight = vec![weight_lowerbound; nb_vertices]; - let mut prev = vec![edge_vec.len(); nb_vertices]; - weight[i] = 0; - //We compute largest weighted paths from i. - //Since the graph is bipartite, any simple cycle has length - //at most 2*nb_side_min. In the general Bellman-Ford - //algorithm, the bound here is the number of vertices. Since - //the number of partitions can be much larger than the - //number of nodes, we optimize that. - for _ in 0..(2 * nb_side_min) { - for (j, e) in edge_vec.iter().enumerate() { - if weight[e.v] < weight[e.u] + e.w { - weight[e.v] = weight[e.u] + e.w; - prev[e.v] = j; - } - } - } - //We update the accessed table - for i in 0..nb_left { - if weight[i] > weight_lowerbound { - accessed[i] = true; - } - } - //We detect positive cycle - for e in edge_vec { - if weight[e.v] < weight[e.u] + e.w { - //it means e is on a path branching from a positive cycle - let mut was_seen = vec![false; nb_vertices]; - let mut curr = e.u; - //We track back with prev until we reach the cycle. - while !was_seen[curr] { - was_seen[curr] = true; - curr = edge_vec[prev[curr]].u; - } - //Now curr is on the cycle. We collect the edges ids. - let mut cycle = vec![prev[curr]]; - let mut cycle_vert = edge_vec[prev[curr]].u; - while cycle_vert != curr { - cycle.push(prev[cycle_vert]); - cycle_vert = edge_vec[prev[cycle_vert]].u; - } - - return Some(cycle); - } - } - } - - None -} - -// This function takes two arrays of capacity and computes the -// maximal matching in the complete bipartite graph such that the -// left vertex i is matched to left_cap_vec[i] right vertices, and -// the right vertex j is matched to right_cap_vec[j] left vertices. -// To do so, we use Dinic's maximum flow algorithm. -pub fn dinic_compute_matching(left_cap_vec: Vec, right_cap_vec: Vec) -> Vec> { - let mut graph = Vec::>::new(); - let ed = EdgeFlow { - c: 0, - flow: 0, - v: 0, - rev: 0, - }; - - // 0 will be the source - graph.push(vec![ed; left_cap_vec.len()]); - for (i, c) in left_cap_vec.iter().enumerate() { - graph[0][i].c = *c as i32; - graph[0][i].v = i + 2; - graph[0][i].rev = 0; - } - - //1 will be the sink - graph.push(vec![ed; right_cap_vec.len()]); - for (i, c) in right_cap_vec.iter().enumerate() { - graph[1][i].c = *c as i32; - graph[1][i].v = i + 2 + left_cap_vec.len(); - graph[1][i].rev = 0; - } - - //we add left vertices - for i in 0..left_cap_vec.len() { - graph.push(vec![ed; 1 + right_cap_vec.len()]); - graph[i + 2][0].c = 0; //directed - graph[i + 2][0].v = 0; - graph[i + 2][0].rev = i; - - for j in 0..right_cap_vec.len() { - graph[i + 2][j + 1].c = 1; - graph[i + 2][j + 1].v = 2 + left_cap_vec.len() + j; - graph[i + 2][j + 1].rev = i + 1; - } - } - - //we add right vertices - for i in 0..right_cap_vec.len() { - let lft_ln = left_cap_vec.len(); - graph.push(vec![ed; 1 + lft_ln]); - graph[i + lft_ln + 2][0].c = graph[1][i].c; - graph[i + lft_ln + 2][0].v = 1; - graph[i + lft_ln + 2][0].rev = i; - - for j in 0..left_cap_vec.len() { - graph[i + 2 + lft_ln][j + 1].c = 0; //directed - graph[i + 2 + lft_ln][j + 1].v = j + 2; - graph[i + 2 + lft_ln][j + 1].rev = i + 1; - } - } - - //To ensure the dispersion of the triplets generated by the - //assignation, we shuffle the neighbours of the nodes. Hence, - //left vertices do not consider the right ones in the same order. - let mut rng = rand::thread_rng(); - for i in 0..graph.len() { - graph[i].shuffle(&mut rng); - //We need to update the ids of the reverse edges. - for j in 0..graph[i].len() { - let target_v = graph[i][j].v; - let target_rev = graph[i][j].rev; - graph[target_v][target_rev].rev = j; - } - } - - let nb_vertices = graph.len(); - - //We run Dinic's max flow algorithm - loop { - //We build the level array from Dinic's algorithm. - let mut level = vec![-1; nb_vertices]; - - let mut fifo = VecDeque::new(); - fifo.push_back((0, 0)); - while !fifo.is_empty() { - if let Some((id, lvl)) = fifo.pop_front() { - if level[id] == -1 { - level[id] = lvl; - for e in graph[id].iter() { - if e.c - e.flow > 0 { - fifo.push_back((e.v, lvl + 1)); - } - } - } - } - } - if level[1] == -1 { - //There is no residual flow - break; - } - - //Now we run DFS respecting the level array - let mut next_nbd = vec![0; nb_vertices]; - let mut lifo = VecDeque::new(); - - let flow_upper_bound = if let Some(x) = left_cap_vec.iter().max() { - *x as i32 - } else { - panic!(); - }; - - lifo.push_back((0, flow_upper_bound)); - - while let Some((id_tmp, f_tmp)) = lifo.back() { - let id = *id_tmp; - let f = *f_tmp; - if id == 1 { - //The DFS reached the sink, we can add a - //residual flow. - lifo.pop_back(); - while !lifo.is_empty() { - if let Some((id, _)) = lifo.pop_back() { - let nbd = next_nbd[id]; - graph[id][nbd].flow += f; - let id_v = graph[id][nbd].v; - let nbd_v = graph[id][nbd].rev; - graph[id_v][nbd_v].flow -= f; - } - } - lifo.push_back((0, flow_upper_bound)); - continue; - } - //else we did not reach the sink - let nbd = next_nbd[id]; - if nbd >= graph[id].len() { - //There is nothing to explore from id anymore - lifo.pop_back(); - if let Some((parent, _)) = lifo.back() { - next_nbd[*parent] += 1; - } - continue; - } - //else we can try to send flow from id to its nbd - let new_flow = min(f, graph[id][nbd].c - graph[id][nbd].flow); - if level[graph[id][nbd].v] <= level[id] || new_flow == 0 { - //We cannot send flow to nbd. - next_nbd[id] += 1; - continue; - } - //otherwise, we send flow to nbd. - lifo.push_back((graph[id][nbd].v, new_flow)); - } - } - - //We return the association - let assoc_table = (0..left_cap_vec.len()) - .map(|id| { - graph[id + 2] - .iter() - .filter(|e| e.flow > 0) - .map(|e| e.v - 2 - left_cap_vec.len()) - .collect() - }) - .collect(); - - //consistency check - - //it is a flow - for i in 3..graph.len() { - assert!(graph[i].iter().map(|e| e.flow).sum::() == 0); - for e in graph[i].iter() { - assert!(e.flow + graph[e.v][e.rev].flow == 0); - } - } - - //it solves the matching problem - for i in 0..left_cap_vec.len() { - assert!(left_cap_vec[i] as i32 == graph[i + 2].iter().map(|e| max(0, e.flow)).sum::()); - } - for i in 0..right_cap_vec.len() { - assert!( - right_cap_vec[i] as i32 - == graph[i + 2 + left_cap_vec.len()] - .iter() - .map(|e| max(0, e.flow)) - .sum::() - ); - } - - assoc_table -} - -#[cfg(test)] -mod tests { - use super::*; - - #[test] - fn test_flow() { - let left_vec = vec![3; 8]; - let right_vec = vec![0, 4, 8, 4, 8]; - //There are asserts in the function that computes the flow - let _ = dinic_compute_matching(left_vec, right_vec); - } - - //maybe add tests relative to the matching optilization ? -} diff --git a/src/util/lib.rs b/src/util/lib.rs index 891549c3..e83fc2e6 100644 --- a/src/util/lib.rs +++ b/src/util/lib.rs @@ -4,7 +4,6 @@ extern crate tracing; pub mod background; -pub mod bipartite; pub mod config; pub mod crdt; pub mod data;