Ǯ5Ocb}7>/O6xΟi7'<S78r e7Ѻ T_~0|_vǝLA{aV/}wݩ Dt9 9*_;U?>\M %!wXC&G `KPc[Sh4
"w
"Q a7uj 8xR 2ǮojԚSf"@ݹAm3
cz 'J_N$a 8?(V { ꉨǚ "#&'wD@L^0P8 4)Gc.Slk\[w a~fsx|RcVhћYlr}3;rø8lG #+t7{UޟĮWl",7wK*R=w,
Kt0:h h0ǸMfY`4qx.@z3ݛ֚ɓSX?lscZK s *.˾-[A4מ./-N"c PXٰua`(ԏ%ވzb+>97xoxG^4z( V \}[ĸ>N_5Ay[)t&$`; $t|)ȓe5铑i@ eNܨ`Pj
T^xAޣ2P1'bs ܆r~owj
wJ@/+
{|Ubc椲bo\br( :b" %aB}H<^ `Bz]wyLb,62kv9jtڭp"e#RebՇ]\(sʦ[ʮ
i<3G q/$"`7$Bɇܴaj҉x1*ܩYN敖XoB\Y-B.{}ܜ }K wN[tkvZx>9-` 5O"b^Ni qlX| @1
Ɗ-p@Ȟa
tB sz@036g-sD;?а.Gw~ I*FE I 6RM^79Z 7F{9#@*1R
a
߷|l[Y6j 4 {cX~xV*ͭno"ܮ30옃L"q`4-\TmQ :[L6ޚkvqMc zqv ~r@.MmQgvtۖ9V>4FѪO^)\@\;WFJo}Xitkϴasڎ!ŭR혷owI73(up4nh>i3` TbK\b@S
s])9#MkE_(gNDl':@,u*B*Ґ, X
dJwۃN a)_Bn!@ uv" ]Y%3g: e ־,Y{QD!8_: r
uP lt m'!fwqn9E
8j Y0t}T ݉@R$eU|v !h,?c v" vgHGo%jr푫ۃvU/+ָ!
9Ęov> G%o Rt \f"6m
ptZbqWUiC{0 RG\HZ6 ¦*/F|!Jkm zϟQryǓ?=W%0\{H:^q̀Su|#SRyAٺQٲ+
n 4AV]:i8VF&kGք_|xD,_f'7 Ym#ʯGtb ?9)];ذ
8!YY9&JUg2 " ` B.;5{){'4Ik^ke. Ȩ
>{0js7`*cA=Dmp.ۂ>^8רINk
6%"xv0iկ /d<q/·{*̧]k <.|S;:Zg3?MD={:sD q^4{#$uDPɻfd_@]aG`
bކ|K ,T8@bin?=)C?k j#_#6j"A4\F<D/ ,+{[}Ő 5C|VưWI.B>+N1scz,Kj Kx1!tA )YX.
$bo+NN@xt3E dU!o=Qٌ:[ !Ȓ?k * z#.#Kd- Ac`z
/Ha .-atxM7)`u32 ^F~L!&cl0ZwTH#4tF(":8@_wx9 n7mL\=Аv,gz0=h?>[ ka?ƚ2<#6K@xU9gANl -c7x/٤=`mCT;; _AWSIbqӞ" ~ uQ |} J{QFܐ!gj% 591t2TQj$oJaJz! #:8X2D]͠V (*Un7< FC+J :Qא~5
{]gD8.6?Vj+\ YB&n VO'ucճT0و ֭i꺼C+֗qH y}`4.yDg HbT0Uء o hh.rtZy˫A^
%Hpu|;֧~{)$˙Ny]TX A Yd ~<>zEAU@z"hTE4Ċy#'Ɲ,ck-z':o l;WWq h?ÁWH;ƥxĭ䑬2<ԅb"3SByȀ5@늊7+u8EXU]$/UHͬ?jGX4,t31+WȨUqSLwrAq?v# hl/\ s}: ux]Tpcy1zC*Qq68hsx|f6t~M$r3HaL%!RQ,ЛՎ]/f|?ifC b2uy OF$h[gh. ]H*!/gւUQDbBx#8;ƻ
¹ `*+Ҵ䭂&RAhYͩu
\7
rB)
F%*6o>7ުy5GÈ-#&*,A@3A ςA/)0:@|P0&R}H {j'EgnsD!^ u2D\2` @) '@$Lư? 1Ԏ ! .Vs_[-7/!upxIBq[ %˿ >+ /]` q]'[y$껐Pd i4/JAռ(pT++>!8?u
9[!j )5% ntqt]څDNsohf{ [p8I,_gǃ 743A^R W#8aXjLAI۾v;].sNVQ0h_Ũ!Coa15Hn$@J k]tcĩ_k,itn\]OEyI,y7`Łԑ;>iy#}6,S>@#?jv:%8$ ^TT!/ 䛩ފ63 bĂjTlE aFEZD|
p3$ "A>*}]HE ͈3vA )DMѢ 5\7457) CEkRX,x,*Js7eDڞGINCiar;IMWP?LS 96GM J \]^ SBBrW>"4&(2\a2|&c6ٸ#/Y:G6 I:LztdyEM 4ȗ4?vb
9ZxYlQαFe>#%q~4.|~H0yv4>G :i5h@5;xK3 :6I|_Vmj4iDI[D3ט'@j: ]lt8!>>OO X/",5ƥ[|Ev L5O'?Y-ǃ > z:0E @" Eow# .oFϒOve a:9D ZPh4BqQCD8,$CZ|Hǖ r'Bсh+}*F0== _ӜXl ksP:E鐫=Phl;wm-GQj&4GK0Q
1S&\<ѱԊ $K89كT܈@~M-AvARuܹ? h/Ui
Cbe?U`
4-T
ߥ1'vl7ՙzjEHfK?ƐS, wN$>?V4uP6<ڇ2hK&~m6,C w* 4¥G]^IZ&BNEZ5 0W 3 u8!tcAy0!gowy[ik* e Pf #n2;oć/~}AccYj @}RHIzJJ$|wNG:3s$Hcl'UcfasЩdguWp]%.VNBg'|r) (:_߫Y/mt>oTP8 *ጡRx; :2xJ0/p!3 Ҭ}(KZdZg٫?A ( 'Rñ]RKle MA`PKm%-L'hdǸ~}G3aی5126xX* u?9mjr[-:VIs,ŌяOr@՝M0 Yh2'yXȅQ(iB`(H0ul` g✣٩བྷyŅ]5&Uŝ7\'sBYпElΈO!
P`u95.֢Ӡ )crۆ!75F>3 9NL=ݣfPoj{:,=U:HѴ2ȂEe r8Е0fF62P݀&ݤg~EH/K(Zz8YBˑ~)y2.6*3f~n0[>y-=D Vƻh*)8*7CB}wxmTN?[UpgՌ&:jTK g/w0&l
ϷD߾yjoErA2G4<@^C-5TPlN/1f YT CM 4oD#<ݰl4٨H< z% !}.M,5|_lG+0zkuۆ>)?sfEںEf4^ūHao+m+̺I$<I BjjEY8_N{
9ȯ xq(AF &}E6 bx>*꤆"' ^RR& ?ha1j8 jl8
3r ۣ ɣ.t~6 \5 {]R@cxWκդjY~IC\ɝ` IUx{Kuqzv#6))M:u76a6Kveރ, m.X
dyNpb~7* ~|eٶc fsx#
: HsMtpdl{tE$D ܶT>e([tKqutDz)\XW EB]!<
4YYA}62cXxZEC eZ *F4lD1y c!G9a Vٳd$dH6Cj& y y@ؖ!wQWI̊{VwF< '4nF*_=Mb'Ô>yUw
kD^5^uoww41OPZ>}@_EؠB#& FeNBa_zdyr ݗ0{6:
zݟُ~yY~fⓦrZg$32E3g3g嫋O4~M sV%>#Pgt7 @&D{(^dt}*Kr~J0[)( :ފ 2!ʸ\ehYCtx㞋
fn3[ُNanR1
gAN>Bd[cMyZ֛ lbny b|N68ȲG A?>]H;l]ֆ^3+c"3Ry64h "{v Ó;"^>qse$e(cXFtbة0'q . c=~^P~K-wIg*lc^bϵǏ?'ar?;U1EQq?fGdZ$`SzY*=835 y&` S+ : ؟^[vac6%dDm'*[3ah^y Fv?TB -:܂ %3c'*?HEzD(c+EchzUV$ K7-M%blW{dTi,rdP!4T(mVwyFKUiH" k#QDTS>Ki4ws@{~,W38+*`teIݍcCua܇Qzh.0])
q2 Ӈ3j5VC¸xƲ
U
4P SRэŬ'dz` ;tc/-/[+( g2El-BdF j -f(+4[3-h2Ү$
(lDY' o"X`]B&G19@,^Qdym7hB #6-C@bBQƣICC2>~w-|E JoA/G1~%,Useb<3`W5i,
aAWY"8z*a
#j 4a? y)B2_?;S8r ;Zє؈Hzby>ϒx %x='5t80s_MӒ*+a6[8bU_ đu5bz<4bW$3Da3&uk_r ̄ST~ȄK#Mcxo Z.iټnp )mh$Vd.jK̵?˦hy$>Lv؏j
= bq<q*SKnOn b7S<2c ;
=ǮV\mYL䠥p7"Y B$eF1X(e*2y,&ۧh hN>ԙg:b@M_=\n!g,~0GK
`jCEV,GuJ):"YYDK !>sR;xw8G1n0Z #B/y L4 sƭelj! .G9y]39Q(Ms0ɋBƼس#}3ɜHl>Q/.6OS @+2KB? ]\/8wV[[[Ƈ
W=TZ.迚Ix7_䠀3*ʶXpD(?(r#*qhn 9<0)/ɩ=jP% T- yڍhϒW`*ƶJS vv'fy ¤iR>J6&kްҲBk-P`\ѓ1z::niQ=(YvcPKPlQ7y'|?Gۘ?Zo[U~ O8>г ddS}U=푁ʏVNdh' wBHUPH {.s$@>~9m +z ݯ5U \Qv
v::L.@UqM?6Hڎ".~mbSm
PeT)AW1mݓBw> YrmkWk* Q Dp M^
"<z^tɆ Cx74RbO%=?`?V6W ~ Ւf)}
ӏ :V 5xj3f;28AV UCTؠT zJWO78FR? 33tD Vu~,2~!%Tq>1> sZ#A~7 RZ%FٽV gp7 `@WXs>4(&1"ևxt8}5_)c u9PIzkxV5 CT/y{H\Il{E&DgV9qI`{$ [gqͪ`ӢC yxS̷HMW!V\$s^X'ȟɝuf%:/Z YGfD Ѵu1gHl,09},3>@[`9(J0-/ VPk'|Pf,'i t\PD'Vnm95LFt/W/<G'<zl_(6X( 121AE 3$ 1?hv`.`B4f8U Q]@iRk>Gt-jnp^( fkƥ'64α/Y'l )!W0!TTuR>KNi B迏)H3q%3UCɐ
+KEv0C 05_91Qh
's V}%:Y-Y ϔ{:
kތ0
؈߫;YtϚ%9+=z
'rh%EB%V06gXveQr}(Z ]ZPLTkq%ny-Lh߯@ju]@/ܮȚ[e-Zf :y%U/[,2+^O<~#ҢT2eʞs).9g+YHݳjk3XYH8%@_lR ֯8ª#=0˖.y `F w DV_ %F&=>p϶xg0g&nGqrG\|Rϯ͐ xIdXZy *b%ObD$ ,^jRt~WEr&S]qY|FjVMǹg,,#ZϞg%˽ EKO e4rr ӽ{I8A%,R\#"5>s1rB.wT:S(m;"GqO0hnc1_neqq CU.0%:')3آc ! 6>f9¬5D~OfSk @UQQxuX: S>h/bn4>n|nGˁg+U|,bi
!5Yw
Yxk^4i#(??Ϗ_ P ogrX~0hucs-VQrNPA2In؉!t6?P 5A)8hDe?Ya h CQNݧS~}䳍vH=Ҵ7XP~:$T~\\` , H˚Sv@]2˅`1#kqTxTDŚdUUi Ǯc[ DAV&g;Tƚ5t6~X!. fJ @(PȄP"JĂ
.[. .)F.[Xn\KR* ,&R>)AETBӭm@}< 2ܳRXK(ɕlǴQu4O˞"Jj[Ru?B;=`y^kK6w)⽏]ݽMR )tՖQ8[}g!; ]d6 -R o ̩ -@wgvWkR26pDF췇]0PKRjL/<b~t2N G(I SC< gZyMbnjm_Mo1K0&J%Y:S4i~Q\QYؐy
LsK(dPG^+~aᜳ*Wc:l69 /4K?2{>d0x^w ~}1P6ҼCYhS \|EaT ,|Y*9|y)kĨ %Qd*9PUUi:
OƘfn QsV߈{vN"j2
L`|AbХT U(fclF~愱n!՟F]AOh", /(|H(ѼJpZ:%ft G 3lNC >jWrެ,Y$;n* F
\^xFlO`U&+us^}SSj͵~3<^ 9l> . ;v~+.<-Z7*<
ՇBY1
V_I .]btd'/ R~juSHP=?. c͈D'~>cЈ{ XU bG^?CLJSv:rA* nU'{
j iKe6}l:׆6y9璐b0{zYX:ФP uK eM[mniu߾x5ҝD"d=1 ̡m}/~e&Y'ݨj9j%jKZ2N$$*Q߲bt05=
71^ܷ| hNAD+pt,V0?~̼wJ_>x db #M0Z۠O+%1̃1o`?tь4(>i4 lNEukݽ :tэh KnBW}ۣ(?l= Jg. qVM!z@EYp +>
E gPvj4[2L:PE>
])}ӍK黴^-r ?*rԾ[ V:R??ӎ|U&[i0MiJsP^ &4aupU]fB WJC2`2=hDFe3[E}U#0FY,KK|չ&?JƜq&<1Z0pJ 9/#J-K_ZW]m@p =a k^ώ0` AT) | \P)ےl Qdfqay InZ6LFy^ycø@R!(vh˛Y?AO Q !w] mLl]NMDbVGrIG M7PoV4f!c.n z=qtb>WPg 1٨` חbe=(,j5]j(> lFIgІk=3 ǏX8#bOs..tc/;[ /oRqJ5&uP{L7Rlu n*4#N cL{xXYrnN+&%u
:AB^VGMp_x $3PRN}q D^t =DPtAo jny<
a;'um9Z۬7,_S@%. A-gNhճ ˀQ;"pIqhwFte&[EڌL88Ef+|w7Gì6YmW O0;*rSRAD"LF!Sm/= a'Q6+WVH l?J`7/w_Ajڗ StD6Ӯ)xM$]/3?`,OŲV~an^:/Rx%EJgYor%BmV:)cRNIM
n&T9 rlG 3< TQ uhnX{0%לvRQcF9^1jbۦ}>Bk!yQ%! M_; ;vJk }8^8·<_nZvKPfPsj!ߣG+w-|Jڪ_ UH21)GqA@ߛ1wvXK ;)c=J'@Ax#KG >%)5װÒ" #rRw`S&bC?|Vܹg:a,%E&u|"!A #x pG٨Vڧ~V3^^nO8I/S7>%(纍3oOlK( "t%Ss4"c3!, ϳQ7he⟙մu㉋ v9D,( Lj n^]9t94ҕdh% -ḃАj9 L8وt$N/9"~6s6ȀLdC4VFT=gZh+:&?=|@'xuH
qYgAXRF ۨ *vd'TJ 8/Y,:D *Рc!q,'[ o$%yt"d#8 d . Tr-Q7t֝iAl'Yzte \lD=C
kR/=&T]Bk6X?${ߊWrH [6۱dF.zd5 uَv]\iŽ[s=)_7?&9cx, LWmY]vly=6+1 ȓG<syF!
*8Jh]8_4䠢 a(5 Leauq.M
,S J?.v ]oULX+\Rm(+fXn+h^3H[ymQu魡0
_UtV={4puQ;fĭkA^vy_9HB#:' %f E1
#eXCT:7+B [BbPS(_Z>+VCxib|0 | ,Ũ, zЋr]lmJʗEU<"d bnhu~
Њ&^UE > atмʣϣ[졵zcGioTV
E';MH.)=;BtGwFI7 &y<QT )4uz 'qwډOM{ )=# Jn`,: ѻSڱt clGc'!Aԩ GA;8nczˤѭz~]1*]h:_zkU`P "KcQfjڳ_ $#Ze㵂qNgyYPd(=>I=jV< Ɉ5Krk c Σ$h| MQݍQR JCfh
`h 27: oIûA2-䰟v)hyQ7xC?@z=A$z:2܌ӝEg]v
4//Tˌ.ou t
'1O}eho (˫ߣ߶~&>d77)= 1Tt szî /^y iUxrgo/zM ~7o^iF`BT>qd \w;$>KTcι(A H~c315hwm"Q[P( |`7 Yz UFb;ZYiӊm7qt ڄaϡ8)lPcu* G,9 x QESt[&2⣃1 _o $!鮮0D̈ +V+` 1Q&s֯F 6B[# n$o)A-tׄ⭆|i_T+!%@9ZGո8I{ "ۉp2 432]m2`Ƌ#z MD0AqhKҬ C
LY(V10hם
g>K[0yKZ:J@Cl `[L'Ăr<}4@aXTnܮ 4,pxLӉh\S0 ّvƻFUj7PzλhMsaT0L{]|oeL#*c~"BǓX
l ~ޞ|FXSA=Jzv.SA}La)aԠd"LV] \&`LP4q8xr ?<:V7r>R6^ԫU0sll1>C Oa=\}ָYS EQc䊞[FK 0jW@JtA扴waYRlBc)9ir9hr# o|quxo{
_qL)|N?^D}j6 yÖ&ZȦu`
+* ޙpޥņ_TOjg
jٔIGv喇;a*>t>Mba< ME54fERڨKUL=뵬}5L'Hcua fƗf:(YRp)hH#0{0[Fs딄0U^U16r ܋Tˆ(>s87BҵihP,z
36ygvۧ|ozp(<⮋fD\_ru~>hY%ԛ2E Ec j#ѐɕ*ٍ88?I'
Kc$ Na|σN$&M ?gjӏ- ̫fEO^xeq꒑bhyҙOAڲ0&g]SJMJۜPԕ7E;Zp )"k1*YҸ _Qz0I} IԛpJszb\ab)ѡ G~OW
"VVCF A٤; &nLaH[;C*tM|X罭AJmCLb"+n VTxq48x5jWaxaV֣ji!)2}܍a
A:2AVQMӝ/A~嚅WU< =|rgK1`eoykYX\:xDU'DjՂ D'7Ĭ% ([_Z0 KV텅kv +;TU ^?A Y 5ܨHbyMg E;ѦL%]%rؑt膒JbMeʡ&}sIf W htPz䪙 x#z;k[(' lV$uh /[\H&]D% 9 W2US3TvizV i1%-_ڬoDmHD $8a4to֗12%mkQ{䰶R2l}Xu fUF=s1Jo4|CkV^$?=Hb\+W-0jqw![eMy\oPEBn`
S'<a7z1 H[~F#_MP+?Rf"[Za- yko$4]of2#wH;ѫq3G iqqm&͋mZnK
7a䁵c!Cϑo8e}Efi 7W-{% ~$;nkf/6ur1c*%+
π A>q .@z̰Zwe]:% \ƢY%"2 gvr$>Q+K.vlpc#G7aIB+G2j,$% Pnh U1xUZ}vw6>sz^dD3R2˽AIj_"OCΖ~p6jwa5 ݂`wE %GQMxi{,nJ#7dUNA ۦWQs 诌pC zWC!P'Xtoڈ7>`sJX-(F Ɍ+%vx h6ct?+霜v<Xd\ hor\
8HLX?Nܧ{ȉ
}Ǘ4/yTYkuӑ/f#TA| w9 '!;'P+Xs>v|c䢾Hu}BxF
.a+ x \Z . Hy0竲
yTm` K9[u6ٹ5ڷ=B a}wMupy9C g9kI6J?b~g½
UX-N ?G_wR]Rx$ $?yHDwON ȝ[9ͱn ^_t<0RtYU<(O;507xHa)CEBAq~B e]I3V sK𧃳^j tB$P"%` B%&/O''}(d >f?0CsE,n2ydTHN15^TKQ>Y`]mL%@ h;cH1rQ9Bjy=Ză]R8hY|
u b=Mf
o{ `?EKg͙CV#Yl S^ $R8Meno\L'q;[I$|)/FGr{Eǃ\6)>g -na}4&~37o>V^Œ>.YqhGH)d@Er{6): °2x}ՔpYT\"TZ.Y2}]Ħ JOY˚JҢdnUllyh[ʗygQ.nN6sb>wR91R]K XՍ؈\R EӏKHXl|l@ܵtNrCґ} m|9dk@Zex$C%W@DQxQ.#@!xnGM ~qx R98 ud6Wf`hî2;aP"( ,`;@nVSf aj ;U:c
=:KxRC`sH{
rDKK-W8:<5Ta-h@lŢ9ti^o)o+0B>r LȓYͦiJSdȖMBF4"[ ++3Vy7Vb
DbӋx%X︗GՌ#/Lsn 8u#Lb?N'GxnL#Qu` Wit8q-i"HUca.6b>J3!$x=p5k YG>
Ch2J [f a!͗X l,<c.CIsP
I}U@ 曏 y&z1u3ņcb6,=yC
ose FrQ /TP\=y蟽t 9/Y M ˸ElACw0>LP. (Ԇ>^$# xȳpwnL,J
kBCZ`I-GƓOPVV)_Bk(h7l_Ǥ$(?eZxD-\lNqQl$dC`[hsb
SrQ}֕XmQn^0Wݜa86Im*Bo$,Qބ5 jv>hFT[$luҡ\i s-D s&8J\\hΆ,/(()CO,g S%lr|B :D62YFr7'l^ a;l6|"`N82?UmKDlA%h 7|R v/ \ ^0O ZtnB$gCr _jx&ֲs`.&:\?°1mD7Yv;TdrHHeI際=Њa{LMCs6 ,. RuWnxV;f7d$˶T{C lxHJ_cf9|XIQ.;:rQ fxd%Q|6I4IN>N4}=ZO3Icn}=&~8feζg SSR~w$3(FAbXSU9K%^e0 H-<
ઋ);# oq'!g?co c/#hHeD 1C6葽#'K|2 0>CRޖLHo Pr\|wp
XE>K$mG
Kuq7%7d|pV]פ1NXc՞<;PTI? ;U ;[~#gk@CXXMzϱ]iE'^a `_|Pf! q8?(eM ^:'Kۣ2wE+~,C9f<bNG OikhC0> =DPfN0m)T-=fDj#Hn`5t6 @TJII@ y9tf37l @ ujix2nQH ќقc!QW
߈ `ޤd͇j Q,+u1&#FK\)1 yJ3QM]m˭=ۅ<0.蛬jX{l)+Gʽ`$d5?5.kqRˊm
G:+WA L) Xh+هT˝jzMo6PE@`Qǡ%@6s AuSTj9 W?;_n>DYhO۴|SjE
S7BH!Qژ].o-
WLx2@(9D4 *,oH0UïlŹRcڕgɖ.ӛ~-զQ)=Zp_
Og/`q=qa:">QVw
Fcr700/zwd;u ,ɗ
&`@$%ip,
S@AYi6ySz
q VzS CRb~>4`&Ŋ[Z] Y4,o<&b`DGܐ4W]̀ç<9*11[M<ë P)X BSMz7Ij zjSbC>[n0 B[]^-x\Fq]*}8? K2>3BHy]uxx}յwTMtjvJX&1O^-˛ "!ԪO.ԟ.娞J bB_+-uPHרxwCǹ*@,eWGfbBC~ξS9%b@7WI¯pĞ>:ztezՋG I |Q<Q~9 Gsy6˿W*R[*f LnGTtR/P
pבܗ)Ob.ބތ]P ea||:rVTAdޮKtp0}
`.{I*th/ [8RKV^T=EeuF [U
O 6ClDw1iGYF*)qhPd@Ia ;u>ݗ6|p5Q3]+T.Kr1ʁ h7"I eiQ?%ϘP2sm0uANQHr lVu*<ۓd H[\y^kk<rA@0bI<Z_:/ ,YF#5´xGPDsDR=ftpr0s?9 LN#J5[VI{պD)y$af^Hb|v89NXyI[G2 4CzNP-qYa ͡@E*Dթr+,#_;**rasbK_^棒.6B24^.欪ŅywD tHMI3#u"Z\UJOuGs#>LZGw ^u]E{4{Jda\JS,9d˭6eL;a$eCBKUU}q2.uhXS?DQ@h& ХrR $63Z%Ð bzD>`O ܓX bHM[̖ER' d.g1]8/9tꨊ&炰ke
4CCO\ ǔL0(jU5"X6-5e2i\qhe=[H;ӬaMPS|̵iy%Tje=Su+7L٨ 9(#Q&mnЄl8U+8I n.'{-u Vy\@Q`[zd\$bmhBW5
RZEcG"@vi## jY[. 0 t~ =5&[eQ/A # qpN<:τw?U20\
4yWr䎗 \2^'ynH`} bWUzd <"WOtj7bk\4jzN
5# ~j dQ'ٹJ >HF$11@KM(uf ]fUR $n ie0lUd4ד eۺL!ogmy9.Vjmj*,kD](W^-+*TrNLÖMϨ/nPג!o9
EKհ- K^yhАi^:1Սf|1T47]P-%ں~6a'wM\cɜ9 [%o^N沭E51bmt
.t=DEV
3љ8J_˞WkΦ.X|w|EN3$ɺS1Įۘ nthcF J%
fm̀RҖpr<dsZ 7fB
HWz] gL,Yo**tkyvK+>ek&EV-%(m]
:Kթ m] (! Z!lH9FEC/a˹}VԊY
8U
TiI)]bq.YEяpXhXct`j=="7W})G s6W*^`c>tI^<8,r2Qf;G(åTa!EE !_A$əLo?igkxZ$|9B hɁB-&]9 H #!DrxG f@͐S>ڳ=u ٛ
VzuUޢX3&%G\ XZ1wXI65â6L!?FX1=m w݉W֙79|ѹ٥zޜҎ_{v+TC
%i- &X/ƉwjI0'~B`)2?a
5Z Y *K^{
ܨ.fZl_JygFg+S *bz+ )ʳ8?܈fb6\JBˏ_Rq0T[㯘y me}, E)07Wȷ}5=X{*rB 9zZP#s_oُvoS/+$oI2h@%Vc_wx7{XS6_ 4`-䏢onPA o=0k{O[
( 3(jc{k^{yw?|No5zFˣ}UGG s!iVSp-g]ӗ
ziH}ZN%4ey>͵-uw-?Km,+Qv,*̂"̏WoR'^'rQoJ e{t&.뛾g}64yͮ_xC7̙ZgJ;5о6>2+ M lf+LDs$
='8 7Ά.C)LYgӥ }=kX^ҷY%̡gv C~~{Ryͦʫ*Xyuk ;3̱ -VELʮSݮP6XQ`D o%h
:;a9uH /+ٹ q4Vto] ]9 Ws S̆ɠ7HLG[[y m15Ή,N((Y䂷m`TZ>Pd;ڠ~\ Z2[\sUz
O퓬 G.Q6X_G?q f?6ƃ/Y?>ԑoaSTz?n0o1| *v8ϓ(>'gQbÿ%y H$ч* t?>./n-K IOqo{pi? Is7uNdN~֣ A5o?'>
@ +ydcTG;M1dt +S.T=n`$E
E:&_`Mq~8 g$0` kO'lɎ:q{?IA䃩r|?Ϗgף, LBNYPRCzB,r8̏ve7[r~N7 Xe;LS0) }+O{5S'Ș̶ ]?`!/Ū;ĉ6wWj!/An^A A v'')HBY MF.. Y@7ö ?":||5 t@GXVnވ=ܠt#CBב^e{-]"?^u7fCwtUk@f_
h؋]*n(Jy{33]oQj[ cl%YҎgP-) @X ̡deWTUǿsx7ս5V,"Kǯ>JKfC zgxFtej)hA5J5kJTνDQtlg酋(pAPy:̚>ܼJ YױW, MkPOecJ5PBѼ3Άck"Ɏ ٗg~V
i;RD K2 }SE^ntn
gD5')q?;yd={l$Je Oz%% ̳ɠG-aPJŝv:M\^?JkGV[Qurj u[^}N "Xxfo=zF}j^m wmS exVy|@`)_ Z*Z{]xi21
"ǿ= % A3N`4 VD Jq:kVlMtL^Ig&Z綯 5$c9*gebfHe$@m2Jģ Oٯ{qΒBt=ը$B|&4l0y'e*o1DuYۥm\< GY^CwP?R?PYJq[CE<ܦA;K] Kz >B Io@A"CAq"f^6-K/' -}:?^ 6CWZ H149sL'U-qr:Јg7$`$ـ]MYNݳݠ4&aP#KM8? 00S[E Ǐ ~X(Q_ Q"KAq K0 lD r1< K+ Ь~
Q6$um(s·,2Ǵ]Iޛ+._\
Ԭz74%
@brM`:M W_o{}tRX+?*r9өtO?O?̀ e@ҝok}~F*ݒ"Q+8wW|wlJ#ZoDjI~ZȪW "|W1{>R߲/QMG `,J$ d|1OD(%p
@6Ns 6"V(f^Ǵ9K~
Ki`V!`jƙ\eIGvz{}a ?&qv;xxݮe,Tq~6^Ǫt g,ZZ֯%5߄U{ @$ \]+^jVD5A?){zSԁnKx*_l5)'7j9@{xՠ:2`ZS;`nP
3 @Af~33S)ԫ~#<^83B&
NG2^W YÀ5X#^ƪ 7iMGI? E# ɏ*ɁOr,V&`7-Y=0NK 4
& /l` T?ivAH03ay'orV07a? d7d]QC I7`id a2(ʔLyP 3OG&uƳ[Wo_fnDCW7M3~wnjT `Ͷ9i2Iݯ58-m
L0`ލߍ2DǣwHrrs!+tkhjlǕ e^,:V`;ZzJ6G7>
atiyg߁V 7=hP! kf]h du 绢,QX^qTE B F{|1^..7!EɽT%zVQD%fղ/Q^"S_űcV"L O<$ׇftCh^A똊[þu\+)BIø^N?"+- $wU SUTRT`vM*9P
5uTb̤rAKp,NOQ?=MHR
k5^[\=Tn"IP/kqT<ؗhVQU Spq AVZMdWt4nlI5ǚYM>gN.X!ϼOH KQ9#GM:e%|B.̦ 4Uv1xU08\0-Z: s%r(% ˜a$
(>ŵVDZ?
ys54>,eQ1W> :x"ES! SszyXYeb H/f~
\mۀ" ?@|ђ11 KOaבt -
Q[ؼENRm8_҂'[ m.ƈ&gDbۈEro&>*wZf-9ӷ]}ӏkQUB ɬݳ>udU>P/G/$jRVnتSL ̍#\vz
<_v_'5n owtt
Ǫu [V>Jt Z`Xfh76 xT"fG٠?u.a]s[:B;V\ldud4p]UbmC2m V
W\zo
Nn\Ǥ"lRV\]܌P 4{g
5я\! K&H]`[xV#s[>s٦L9[CS$\^%L[H)7nլ|A?:StUj~}Bw
Vg r 8GAT: j3"ꏌ:H$,Z)}t143OF&t9[
`0>"#'lWjd4+C:mķ wz`~/VWW =^)?Z[O="8lHQ| ',qyW-a{E7=!.CO'Jt_ZP 4K f
bVԇvl
y& ]9Mf\k2 c؇xMTSm QzcБ ހLh
qك)<d{@23eyAۊ%RGGԺXZGN97SNE'\
n*xϯHCwfPR;P.$ybF0ȔF0&9oҍ jm /n}ȯ'H6 Q+>}ӿ>+d(iF^s( @hnuCLz;H@D $=O1i9W)msF_sG
:(e*fMӝR Q ڝ+KD@B8 ߠ
#`_}W6ewU"OR`y aAꁏX-,o vAn ? dÿbq'Ow/_?+שּׂ?z&Qq
+P &*:1B|/Dkڡ[j<H'/aJ:,p;{Qer>1_ݵB@'%U-t~] .Pr
<S1 h;NPt%4Bot-Gd#LO?$_'s jVcۦӦoc$6OfKWxّ! 67t4"Dhi%p܌xyQ~XmH ?2z9h-GG ,ӎQmʹkq!DMxkf
6wSm =L9M'Fyt& Ӫ!HmhEs[G_\^Ǎ˧8ӧiN >"=J1)3z 9Ws uqF:s^Z 9RgFܯD@\=9X^=2 xZ=E-w-tŀZfX^J[l4P*J!{h;PLI3T{oR29,3HVZݭeF v` }1+KQTɣI}N:d_r`"/L \%7S`p A;S&S4R3!nE,4/4!Ihrx1!XdV0t4v
ej'yA%o.KpS~ -\^k3*YOx T%HwZބȉE?iy=nL Th.QJ![.KGW Aoyˏq'
?=tCxQqɁ/Cvh?jV ~X.
`Htզ$:I-|= .YXN*AfFeIvy U%|O
c`\wp<.sTq ̢z
Jwsj1(8 0j @Qz x &nΎ7`n 2
N!z|S/$a rCڇ۵Qb)>Ghj{/LW(6bY$Kop-yO]_a*Xti5,bFRؚ]gݯSjb('EAWCaGࢺQE])V%E[4X=sCN~Uv 核f Lu` WFvͰ.>&XrOd0 C˩
j!\r/zK=r4 }9R*^d~,GA%`67I R\v~2@*^_(<1V$\TvfU.S9Ty}90 ePuŋ0.pY$ Z0> ̆$Oߨ/B? U![@[E.=S(&^sIS,j䥲r
//
6 EṖPeٰEKP_p紣9'ڣbqw>OmԞԣJk5aX;ǣFI h}!gU%h= *3;b 1B2iN/FܤE?"؏^Oi7z'8' ]-hX"'D0,M(INvm @ (4 L>*Pua !di/G~ @_^ݏ_ 7,x qȌ^Ńp /v<jl|ww܊<={&ڎ^o}7_4h/! R?d Ȥ3~.} 8?+ 'D08\b ҉آf[FD "DT:hwm"Q[P( |썡8x gcb;ZiZ+ `Z۽fE0}k$GqUBu+ƫ*(%h+ {x . +߸WʒznzG`yXo>jo͵F{}B\v36ŕ v^ L$T0ǣ&E>8V 88[- AȼgF!*HPAxܒap|ӃQbF-.j9X{9--/HyYxm_fg0} QFq{~zYT P4&7ɪZ1*KvFW^wKg~D}NY銓O`U*-1~hEUl2X6*ލd$Qt -=HyϦFݬ'ȭ_#& fl wm|;_]Qv{ Tm[V-yNyDNbZPe%0~zPnwZfZ5^!0BUJNuTC^SyR5 <$%kSbh5W X}Iݭ
X`sh}jNGݣ %@8kCgIA7n*% ,ة*RMCP!agT$1;zo&=ءc|u0JݾBb1Ocb
(jvv ,\$'
IpA,zzx$ s5Q0WGygHhokPYJ)ϱ1| ZTa~$ J/'@S;+)5$$23,ɰK`C l/Un2(
iW4ܜNeQ?b7|4(bCxgia[?gBOq 14yC ١W7"* 'O$1 V]mopj4˛wM]r\꾰U"_enh]>|ƪQ`Y7|2H([e8 <U$6ҹ+:veC䒚uc+
;H:fU&$!$ؚ*Xa{[cR"$k\DuR̥^BTEYFЊ@ز HBIP7
?k.6qw>DQ =A 6nH -Mt:(?S"}iK4ۗ5$J)8O$&r-dηӃa<ʕ+w2$5ɄSa>VmŠ
v)%
,HыƮѨ^T#G $iPyyBª ɮU "1
JKOSMzَXi<}K2.e8͙Gl^ Ce?V#INIMuprE8uGvJu$)[XX KUr`%V9ztJ'UcKR^{;}H-wmEC¦iA^sx/ u4ךq lx'
#
h4ҏ~<"DV xts ܡ ^%| vsM6W t?{ WtHQBT`v{.8Ua3O?&q+8~:hHK 5 tGI2OY`aPd8s}E]RDƃ'uQSdž! `6,6 h(®@vkR٧Go{b
~HA)Cf6& : |Y\m.8ZAb) +03|M%+(_< Ze5٫^` y\`U ^xIT*,6utr N
I/0BeF̎եj^/e(
|쯔!W@>kmXk 5wmBgG "+xfY1ڥ' ck37Yݴ奵K`s
ڳ/ԬtP(,cН15gi@HmedW|c`^2DmdŤ5e5R|ACN1céw 4CRd/Eঈ&hս4g ;՜/UB2Of-o3ߢz]=X#Fc;Yګn뤤 nV ski.KtMR1& ~B/lUk0JEog# 8T 24uYP5Q<ҍ Wr* k`< ^vO^g'Z%.m -NHg tR,$B07
4άhTG_ڏ˂{YC : B<x萩TvYة~#pZC=g{"Z]`znʪVX% ?~brj)~
UQtܡQ2%
zD/ }b W7JgE@N"ux@ uFL`&:WhAmv!/BTR(q4 /}@+Eeo ״
1cxn"nR%+V,|A3s+k
),ǪmzV-sY`4ƯXÎSG#K2n
a5u]LNR;0W6{Qo82V ʭdxohؖlŪgo@|jGVn|}4MgV-҅Myb^vGU{W,-psy|hRu}m&8 u~I9MM K4O݄;P lA̶ڎd(:/^;~\ g[+l̔M*'4N*P}7_ڌ{] 7w}- Eh 8CI;BJ+O]go]a6^20b8
oУ-javbL4(*xA<螡eVo^ =
y^^vk,QVc]Jd
|Fc2Sϋ=+.% % e*W3Vyhr}4EcvnTX sqѺ佷~ K.؞Nt C ]YRq y:K=(k& yYO\V 2_$̿J1:onLPA&R2aD7 z ߛ4STeHmI(8 U8tY N;cE
rrǘ/(@(H;=qߍޜ[e8J,wX[$K2?+/
Y߃3ѣ l-ҡz?*0z=R J}_
詓f"Pd q:# 'zsZD8U> {D)\uv6ZpUdg#NGR6BOI gvVDګ{K[ϥ >ub:zK,dy#`+Mx,_@407pr܊
|4 qQ,?2>PV}PrSϾY(RBR4jnQtߺƩ\`Gгfy;I&#X.y&rN$Ģƥ_}i6p.]bF1[-~ wN Ѵ^횧x ܭD!{GWrמGT}~v
nFxKi
vOV <眤P} o&ҫ6I*&3!Vs-ˇײ b?/eOsc `-
b(vr><眣,O,B
B,T^yX@\L2rf$})e >g8t)(Uth(aԋw>,a'8R2G$4(k`T,\Kķr1@KǬu 7 ЩqPZ5 ֕ $M-n9
X1̫끡 Ngyn/Q%4sbPm6Ȏ|dJL
Hփ`x../Go8)C!I)|+N8 ؐJH9AtsנV )LQjdr?cs9ئ 4yĈcc e
5D{+)O%缾25|x.N`5T֒zWY*7I]]s墠 ۀ{m.w!CJ{x7R$WQ8ˉ&[w`
/O-G0r+qLxpב`EvSMptgƛfj5l;~lOF5di۵5/m~A 6,bJӳaϼQ5-aO墏Ycnƃ*7 dkYzd'<m!NآnU[l[7{U?[AhAfQNAcTK gIWd,zoH9PyZG!➿:zhθuxYy۰YPMS`VYl7#џpaO?֭W8 9D/~ w7̪co A z91xSCy9Mq+5q]~qWub]T#O7SNPpaգ$tvn"#}eq`ZKѳ乥>ՙĨ|q$UGzӡ$ Մ#*!w ok5>@sEKj
j3V(~ fodM=ЈO+= `
lZt:X7;bXD~I55ad)J
5;|MtKm
}k5u5̲k5%/:8w]`K7ԨڭrE*!iͥFMxH #ìZE-^fAW )49=ދSM
ۛ8Zm(9[~pajh ޛ* , TĬKSes97|=%
G3 n<(% h4яъ7G }F.%ej7_?D-DžgWY- ?V T\LӜh.g.fcOu
l1G(tyE<-Cq/Z Zl>\R X |8 @USb1"B+\ÏKvt|8㏗؇nU**ynGE ? ?j?>Z{t>w ?t 7Uoy9 5o}Z} XcQ
#qgSΡGTmu/Un /d4Suܱ5U$&Aحe#1Nta-w ye ZU˩MQ l)QZ9?fԲH"κJ@G1S+Mmк1[[訋.+뭃<.JG?pKs;Fo$d8P?s7XKỤמ^Ң ?'fI F~_j>R͑L1=<юt]꽟R-}[xwxa*EW", UT/^d M]
QP!lh
.,=tO؟kˉq&U d9j"RP+4ugc-1GPA/*
Minetest
Copyright (C) 2013 sapier, sapier at gmx dot net
Copyright (C) 2016 est31, <MTest31@outlook.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/******************************************************************************/
/* Includes */
/******************************************************************************/
#include "pathfinder.h"
#include "serverenvironment.h"
#include "server.h"
#include "nodedef.h"
//#define PATHFINDER_DEBUG
//#define PATHFINDER_CALC_TIME
#ifdef PATHFINDER_DEBUG
#include <string>
#endif
#ifdef PATHFINDER_DEBUG
#include <iomanip>
#endif
#ifdef PATHFINDER_CALC_TIME
#include <sys/time.h>
#endif
/******************************************************************************/
/* Typedefs and macros */
/******************************************************************************/
#define LVL "(" << level << ")" <<
#ifdef PATHFINDER_DEBUG
#define DEBUG_OUT(a) std::cout << a
#define INFO_TARGET std::cout
#define VERBOSE_TARGET std::cout
#define ERROR_TARGET std::cout
#else
#define DEBUG_OUT(a) while(0)
#define INFO_TARGET infostream << "Pathfinder: "
#define VERBOSE_TARGET verbosestream << "Pathfinder: "
#define ERROR_TARGET warningstream << "Pathfinder: "
#endif
/******************************************************************************/
/* Class definitions */
/******************************************************************************/
/** representation of cost in specific direction */
class PathCost {
public:
/** default constructor */
PathCost() = default;
/** copy constructor */
PathCost(const PathCost &b);
/** assignment operator */
PathCost &operator= (const PathCost &b);
bool valid = false; /**< movement is possible */
int value = 0; /**< cost of movement */
int direction = 0; /**< y-direction of movement */
bool updated = false; /**< this cost has ben calculated */
};
/** representation of a mapnode to be used for pathfinding */
class PathGridnode {
public:
/** default constructor */
PathGridnode() = default;
/** copy constructor */
PathGridnode(const PathGridnode &b);
/**
* assignment operator
* @param b node to copy
*/
PathGridnode &operator= (const PathGridnode &b);
/**
* read cost in a specific direction
* @param dir direction of cost to fetch
*/
PathCost getCost(v3s16 dir);
/**
* set cost value for movement
* @param dir direction to set cost for
* @cost cost to set
*/
void setCost(v3s16 dir, const PathCost &cost);
bool valid = false; /**< node is on surface */
bool target = false; /**< node is target position */
bool source = false; /**< node is stating position */
int totalcost = -1; /**< cost to move here from starting point */
v3s16 sourcedir; /**< origin of movement for current cost */
v3s16 pos; /**< real position of node */
PathCost directions[4]; /**< cost in different directions */
/* debug values */
bool is_element = false; /**< node is element of path detected */
char type = 'u'; /**< type of node */
};
class Pathfinder;
/** Abstract class to manage the map data */
class GridNodeContainer {
public:
virtual PathGridnode &access(v3s16 p)=0;
virtual ~GridNodeContainer() = default;
protected:
Pathfinder *m_pathf;
void initNode(v3s16 ipos, PathGridnode *p_node);
};
class ArrayGridNodeContainer : public GridNodeContainer {
public:
virtual ~ArrayGridNodeContainer() = default;
ArrayGridNodeContainer(Pathfinder *pathf, v3s16 dimensions);
virtual PathGridnode &access(v3s16 p);
private:
v3s16 m_dimensions;
int m_x_stride;
int m_y_stride;
std::vector<PathGridnode> m_nodes_array;
};
class MapGridNodeContainer : public GridNodeContainer {
public:
virtual ~MapGridNodeContainer() = default;
MapGridNodeContainer(Pathfinder *pathf);
virtual PathGridnode &access(v3s16 p);
private:
std::map<v3s16, PathGridnode> m_nodes;
};
/** class doing pathfinding */
class Pathfinder {
public:
/**
* default constructor
*/
Pathfinder() = default;
~Pathfinder();
/**
* path evaluation function
* @param env environment to look for path
* @param source origin of path
* @param destination end position of path
* @param searchdistance maximum number of nodes to look in each direction
* @param max_jump maximum number of blocks a path may jump up
* @param max_drop maximum number of blocks a path may drop
* @param algo Algorithm to use for finding a path
*/
std::vector<v3s16> getPath(ServerEnvironment *env,
v3s16 source,
v3s16 destination,
unsigned int searchdistance,
unsigned int max_jump,
unsigned int max_drop,
PathAlgorithm algo);
private:
/* helper functions */
/**
* transform index pos to mappos
* @param ipos a index position
* @return map position
*/
v3s16 getRealPos(v3s16 ipos);
/**
* transform mappos to index pos
* @param pos a real pos
* @return index position
*/
v3s16 getIndexPos(v3s16 pos);
/**
* get gridnode at a specific index position
* @param ipos index position
* @return gridnode for index
*/
PathGridnode &getIndexElement(v3s16 ipos);
/**
* Get gridnode at a specific index position
* @return gridnode for index
*/
PathGridnode &getIdxElem(s16 x, s16 y, s16 z);
/**
* invert a 3d position
* @param pos 3d position
* @return pos *-1
*/
v3s16 invert(v3s16 pos);
/**
* check if a index is within current search area
* @param index position to validate
* @return true/false
*/
bool isValidIndex(v3s16 index);
/**
* translate position to float position
* @param pos integer position
* @return float position
*/
v3f tov3f(v3s16 pos);
/* algorithm functions */
/**
* calculate 2d manahttan distance to target on the xz plane
* @param pos position to calc distance
* @return integer distance
*/
int getXZManhattanDist(v3s16 pos);
/**
* get best direction based uppon heuristics
* @param directions list of unchecked directions
* @param g_pos mapnode to start from
* @return direction to check
*/
v3s16 getDirHeuristic(std::vector<v3s16> &directions, PathGridnode &g_pos);
/**
* build internal data representation of search area
* @return true/false if costmap creation was successfull
*/
bool buildCostmap();
/**
* calculate cost of movement
* @param pos real world position to start movement
* @param dir direction to move to
* @return cost information
*/
PathCost calcCost(v3s16 pos, v3s16 dir);
/**
* recursive update whole search areas total cost information
* @param ipos position to check next
* @param srcdir positionc checked last time
* @param total_cost cost of moving to ipos
* @param level current recursion depth
* @return true/false path to destination has been found
*/
bool updateAllCosts(v3s16 ipos, v3s16 srcdir, int current_cost, int level);
/**
* recursive try to find a patrh to destionation
* @param ipos position to check next
* @param srcdir positionc checked last time
* @param total_cost cost of moving to ipos
* @param level current recursion depth
* @return true/false path to destination has been found
*/
bool updateCostHeuristic(v3s16 ipos, v3s16 srcdir, int current_cost, int level);
/**
* recursive build a vector containing all nodes from source to destination
* @param path vector to add nodes to
* @param pos pos to check next
* @param level recursion depth
*/
void buildPath(std::vector<v3s16> &path, v3s16 pos, int level);
/* variables */
int m_max_index_x = 0; /**< max index of search area in x direction */
int m_max_index_y = 0; /**< max index of search area in y direction */
int m_max_index_z = 0; /**< max index of search area in z direction */
int m_searchdistance = 0; /**< max distance to search in each direction */
int m_maxdrop = 0; /**< maximum number of blocks a path may drop */
int m_maxjump = 0; /**< maximum number of blocks a path may jump */
int m_min_target_distance = 0; /**< current smalest path to target */
bool m_prefetch = true; /**< prefetch cost data */
v3s16 m_start; /**< source position */
v3s16 m_destination; /**< destination position */
core::aabbox3d<s16> m_limits; /**< position limits in real map coordinates */
/** contains all map data already collected and analyzed.
Access it via the getIndexElement/getIdxElem methods. */
friend class GridNodeContainer;
GridNodeContainer *m_nodes_container = nullptr;
ServerEnvironment *m_env = 0; /**< minetest environment pointer */
#ifdef PATHFINDER_DEBUG
/**
* print collected cost information
*/
void printCost();
/**
* print collected cost information in a specific direction
* @param dir direction to print
*/
void printCost(PathDirections dir);
/**
* print type of node as evaluated
*/
void printType();
/**
* print pathlenght for all nodes in search area
*/
void printPathLen();
/**
* print a path
* @param path path to show
*/
void printPath(std::vector<v3s16> path);
/**
* print y direction for all movements
*/
void printYdir();
/**
* print y direction for moving in a specific direction
* @param dir direction to show data
*/
void printYdir(PathDirections dir);
/**
* helper function to translate a direction to speaking text
* @param dir direction to translate
* @return textual name of direction
*/
std::string dirToName(PathDirections dir);
#endif
};
/******************************************************************************/
/* implementation */
/******************************************************************************/
std::vector<v3s16> get_path(ServerEnvironment* env,
v3s16 source,
v3s16 destination,
unsigned int searchdistance,
unsigned int max_jump,
unsigned int max_drop,
PathAlgorithm algo)
{
Pathfinder searchclass;
return searchclass.getPath(env,
source, destination,
searchdistance, max_jump, max_drop, algo);
}
/******************************************************************************/
PathCost::PathCost(const PathCost &b)
{
valid = b.valid;
direction = b.direction;
value = b.value;
updated = b.updated;
}
/******************************************************************************/
PathCost &PathCost::operator= (const PathCost &b)
{
valid = b.valid;
direction = b.direction;
value = b.value;
updated = b.updated;
return *this;
}
/******************************************************************************/
PathGridnode::PathGridnode(const PathGridnode &b)
: valid(b.valid),
target(b.target),
source(b.source),
totalcost(b.totalcost),
sourcedir(b.sourcedir),
pos(b.pos),
is_element(b.is_element),
type(b.type)
{
directions[DIR_XP] = b.directions[DIR_XP];
directions[DIR_XM] = b.directions[DIR_XM];
directions[DIR_ZP] = b.directions[DIR_ZP];
directions[DIR_ZM] = b.directions[DIR_ZM];
}
/******************************************************************************/
PathGridnode &PathGridnode::operator= (const PathGridnode &b)
{
valid = b.valid;
target = b.target;
source = b.source;
is_element = b.is_element;
totalcost = b.totalcost;
sourcedir = b.sourcedir;
pos = b.pos;
type = b.type;
directions[DIR_XP] = b.directions[DIR_XP];
directions[DIR_XM] = b.directions[DIR_XM];
directions[DIR_ZP] = b.directions[DIR_ZP];
directions[DIR_ZM] = b.directions[DIR_ZM];
return *this;
}
/******************************************************************************/
PathCost PathGridnode::getCost(v3s16 dir)
{
if (dir.X > 0) {
return directions[DIR_XP];
}
if (dir.X < 0) {
return directions[DIR_XM];
}
if (dir.Z > 0) {
return directions[DIR_ZP];
}
if (dir.Z < 0) {
return directions[DIR_ZM];
}
PathCost retval;
return retval;
}
/******************************************************************************/
void PathGridnode::setCost(v3s16 dir, const PathCost &cost)
{
if (dir.X > 0) {
directions[DIR_XP] = cost;
}
if (dir.X < 0) {
directions[DIR_XM] = cost;
}
if (dir.Z > 0) {
directions[DIR_ZP] = cost;
}
if (dir.Z < 0) {
directions[DIR_ZM] = cost;
}
}
void GridNodeContainer::initNode(v3s16 ipos, PathGridnode *p_node)
{
const NodeDefManager *ndef = m_pathf->m_env->getGameDef()->ndef();
PathGridnode &elem = *p_node;
v3s16 realpos = m_pathf->getRealPos(ipos);
MapNode current = m_pathf->m_env->getMap().getNode(realpos);
MapNode below = m_pathf->m_env->getMap().getNode(realpos + v3s16(0, -1, 0));
if ((current.param0 == CONTENT_IGNORE) ||
(below.param0 == CONTENT_IGNORE)) {
DEBUG_OUT("Pathfinder: " << PP(realpos) <<
" current or below is invalid element" << std::endl);
if (current.param0 == CONTENT_IGNORE) {
elem.type = 'i';
DEBUG_OUT(PP(ipos) << ": " << 'i' << std::endl);
}
return;
}
//don't add anything if it isn't an air node
if (ndef->get(current).walkable || !ndef->get(below).walkable) {
DEBUG_OUT("Pathfinder: " << PP(realpos)
<< " not on surface" << std::endl);
if (ndef->get(current).walkable) {
elem.type = 's';
DEBUG_OUT(PP(ipos) << ": " << 's' << std::endl);
} else {
elem.type = '-';
DEBUG_OUT(PP(ipos) << ": " << '-' << std::endl);
}
return;
}
elem.valid = true;
elem.pos = realpos;
elem.type = 'g';
DEBUG_OUT(PP(ipos) << ": " << 'a' << std::endl);
if (m_pathf->m_prefetch) {
elem.directions[DIR_XP] = m_pathf->calcCost(realpos, v3s16( 1, 0, 0));
elem.directions[DIR_XM] = m_pathf->calcCost(realpos, v3s16(-1, 0, 0));
elem.directions[DIR_ZP] = m_pathf->calcCost(realpos, v3s16( 0, 0, 1));
elem.directions[DIR_ZM] = m_pathf->calcCost(realpos, v3s16( 0, 0,-1));
}
}
ArrayGridNodeContainer::ArrayGridNodeContainer(Pathfinder *pathf, v3s16 dimensions) :
m_x_stride(dimensions.Y * dimensions.Z),
m_y_stride(dimensions.Z)
{
m_pathf = pathf;
m_nodes_array.resize(dimensions.X * dimensions.Y * dimensions.Z);
INFO_TARGET << "Pathfinder ArrayGridNodeContainer constructor." << std::endl;
for (int x = 0; x < dimensions.X; x++) {
for (int y = 0; y < dimensions.Y; y++) {
for (int z= 0; z < dimensions.Z; z++) {
v3s16 ipos(x, y, z);
initNode(ipos, &access(ipos));
}
}
}
}
PathGridnode &ArrayGridNodeContainer::access(v3s16 p)
{
return m_nodes_array[p.X * m_x_stride + p.Y * m_y_stride + p.Z];
}
MapGridNodeContainer::MapGridNodeContainer(Pathfinder *pathf)
{
m_pathf = pathf;
}
PathGridnode &MapGridNodeContainer::access(v3s16 p)
{
std::map<v3s16, PathGridnode>::iterator it = m_nodes.find(p);
if (it != m_nodes.end()) {
return it->second;
}
PathGridnode &n = m_nodes[p];
initNode(p, &n);
return n;
}
/******************************************************************************/
std::vector<v3s16> Pathfinder::getPath(ServerEnvironment *env,
v3s16 source,
v3s16 destination,
unsigned int searchdistance,
unsigned int max_jump,
unsigned int max_drop,
PathAlgorithm algo)
{
#ifdef PATHFINDER_CALC_TIME
timespec ts;
clock_gettime(CLOCK_REALTIME, &ts);
#endif
std::vector<v3s16> retval;
//check parameters
if (env == 0) {
ERROR_TARGET << "missing environment pointer" << std::endl;
return retval;
}
m_searchdistance = searchdistance;
m_env = env;
m_maxjump = max_jump;
m_maxdrop = max_drop;
m_start = source;
m_destination = destination;
m_min_target_distance = -1;
m_prefetch = true;
if (algo == PA_PLAIN_NP) {
m_prefetch = false;
}
int min_x = MYMIN(source.X, destination.X);
int max_x = MYMAX(source.X, destination.X);
int min_y = MYMIN(source.Y, destination.Y);
int max_y = MYMAX(source.Y, destination.Y);
int min_z = MYMIN(source.Z, destination.Z);
int max_z = MYMAX(source.Z, destination.Z);
m_limits.MinEdge.X = min_x - searchdistance;
m_limits.MinEdge.Y = min_y - searchdistance;
m_limits.MinEdge.Z = min_z - searchdistance;
m_limits.MaxEdge.X = max_x + searchdistance;
m_limits.MaxEdge.Y = max_y + searchdistance;
m_limits.MaxEdge.Z = max_z + searchdistance;
v3s16 diff = m_limits.MaxEdge - m_limits.MinEdge;
m_max_index_x = diff.X;
m_max_index_y = diff.Y;
m_max_index_z = diff.Z;
delete m_nodes_container;
if (diff.getLength() > 5) {
m_nodes_container = new MapGridNodeContainer(this);
} else {
m_nodes_container = new ArrayGridNodeContainer(this, diff);
}
#ifdef PATHFINDER_DEBUG
printType();
printCost();
printYdir();
#endif
//validate and mark start and end pos
v3s16 StartIndex = getIndexPos(source);
v3s16 EndIndex = getIndexPos(destination);
PathGridnode &startpos = getIndexElement(StartIndex);
PathGridnode &endpos = getIndexElement(EndIndex);
if (!startpos.valid) {
VERBOSE_TARGET << "invalid startpos" <<
"Index: " << PP(StartIndex) <<
"Realpos: " << PP(getRealPos(StartIndex)) << std::endl;
return retval;
}
if (!endpos.valid) {
VERBOSE_TARGET << "invalid stoppos" <<
"Index: " << PP(EndIndex) <<
"Realpos: " << PP(getRealPos(EndIndex)) << std::endl;
return retval;
}
endpos.target = true;
startpos.source = true;
startpos.totalcost = 0;
bool update_cost_retval = false;
switch (algo) {
case PA_DIJKSTRA:
update_cost_retval = updateAllCosts(StartIndex, v3s16(0, 0, 0), 0, 0);
break;
case PA_PLAIN_NP:
case PA_PLAIN:
update_cost_retval = updateCostHeuristic(StartIndex, v3s16(0, 0, 0), 0, 0);
break;
default:
ERROR_TARGET << "missing PathAlgorithm"<< std::endl;
break;
}
if (update_cost_retval) {
#ifdef PATHFINDER_DEBUG
std::cout << "Path to target found!" << std::endl;
printPathLen();
#endif
//find path
std::vector<v3s16> path;
buildPath(path, EndIndex, 0);
#ifdef PATHFINDER_DEBUG
std::cout << "Full index path:" << std::endl;
printPath(path);
#endif
//finalize path
std::vector<v3s16> full_path;
full_path.reserve(path.size());
for (const v3s16 &i : path) {
full_path.push_back(getIndexElement(i).pos);
}
#ifdef PATHFINDER_DEBUG
std::cout << "full path:" << std::endl;
printPath(full_path);
#endif
#ifdef PATHFINDER_CALC_TIME
timespec ts2;
clock_gettime(CLOCK_REALTIME, &ts2);
int ms = (ts2.tv_nsec - ts.tv_nsec)/(1000*1000);
int us = ((ts2.tv_nsec - ts.tv_nsec) - (ms*1000*1000))/1000;
int ns = ((ts2.tv_nsec - ts.tv_nsec) - ( (ms*1000*1000) + (us*1000)));
std::cout << "Calculating path took: " << (ts2.tv_sec - ts.tv_sec) <<
"s " << ms << "ms " << us << "us " << ns << "ns " << std::endl;
#endif
return full_path;
}
else {
#ifdef PATHFINDER_DEBUG
printPathLen();
#endif
ERROR_TARGET << "failed to update cost map"<< std::endl;
}
//return
return retval;
}
Pathfinder::~Pathfinder()
{
delete m_nodes_container;
}
/******************************************************************************/
v3s16 Pathfinder::getRealPos(v3s16 ipos)
{
return m_limits.MinEdge + ipos;
}
/******************************************************************************/
PathCost Pathfinder::calcCost(v3s16 pos, v3s16 dir)
{
const NodeDefManager *ndef = m_env->getGameDef()->ndef();
PathCost retval;
retval.updated = true;
v3s16 pos2 = pos + dir;
//check limits
if (!m_limits.isPointInside(pos2)) {
DEBUG_OUT("Pathfinder: " << PP(pos2) <<
" no cost -> out of limits" << std::endl);
return retval;
}
MapNode node_at_pos2 = m_env->getMap().getNode(pos2);
//did we get information about node?
if (node_at_pos2.param0 == CONTENT_IGNORE ) {
VERBOSE_TARGET << "Pathfinder: (1) area at pos: "
<< PP(pos2) << " not loaded";
return retval;
}
if (!ndef->get(node_at_pos2).walkable) {
MapNode node_below_pos2 =
m_env->getMap().getNode(pos2 + v3s16(0, -1, 0));
//did we get information about node?
if (node_below_pos2.param0 == CONTENT_IGNORE ) {
VERBOSE_TARGET << "Pathfinder: (2) area at pos: "
<< PP((pos2 + v3s16(0, -1, 0))) << " not loaded";
return retval;
}
if (ndef->get(node_below_pos2).walkable) {
retval.valid = true;
retval.value = 1;
retval.direction = 0;
DEBUG_OUT("Pathfinder: "<< PP(pos)
<< " cost same height found" << std::endl);
}
else {
v3s16 testpos = pos2 - v3s16(0, -1, 0);
MapNode node_at_pos = m_env->getMap().getNode(testpos);
while ((node_at_pos.param0 != CONTENT_IGNORE) &&
(!ndef->get(node_at_pos).walkable) &&
(testpos.Y > m_limits.MinEdge.Y)) {
testpos += v3s16(0, -1, 0);
node_at_pos = m_env->getMap().getNode(testpos);
}
//did we find surface?
if ((testpos.Y >= m_limits.MinEdge.Y) &&
(node_at_pos.param0 != CONTENT_IGNORE) &&
(ndef->get(node_at_pos).walkable)) {
if ((pos2.Y - testpos.Y - 1) <= m_maxdrop) {
retval.valid = true;
retval.value = 2;
//difference of y-pos +1 (target node is ABOVE solid node)
retval.direction = ((testpos.Y - pos2.Y) +1);
DEBUG_OUT("Pathfinder cost below height found" << std::endl);
}
else {
INFO_TARGET << "Pathfinder:"
" distance to surface below to big: "
<< (testpos.Y - pos2.Y) << " max: " << m_maxdrop
<< std::endl;
}
}
else {
DEBUG_OUT("Pathfinder: no surface below found" << std::endl);
}
}
}
else {
v3s16 testpos = pos2;
MapNode node_at_pos = m_env->getMap().getNode(testpos);
while ((node_at_pos.param0 != CONTENT_IGNORE) &&
(ndef->get(node_at_pos).walkable) &&
(testpos.Y < m_limits.MaxEdge.Y)) {
testpos += v3s16(0, 1, 0);
node_at_pos = m_env->getMap().getNode(testpos);
}
//did we find surface?
if ((testpos.Y <= m_limits.MaxEdge.Y) &&
(!ndef->get(node_at_pos).walkable)) {
if (testpos.Y - pos2.Y <= m_maxjump) {
retval.valid = true;
retval.value = 2;
retval.direction = (testpos.Y - pos2.Y);
DEBUG_OUT("Pathfinder cost above found" << std::endl);
}
else {
DEBUG_OUT("Pathfinder: distance to surface above to big: "
<< (testpos.Y - pos2.Y) << " max: " << m_maxjump
<< std::endl);
}
}
else {
DEBUG_OUT("Pathfinder: no surface above found" << std::endl);
}
}
return retval;
}
/******************************************************************************/
v3s16 Pathfinder::getIndexPos(v3s16 pos)
{
return pos - m_limits.MinEdge;
}
/******************************************************************************/
PathGridnode &Pathfinder::getIndexElement(v3s16 ipos)
{
return m_nodes_container->access(ipos);
}
/******************************************************************************/
inline PathGridnode &Pathfinder::getIdxElem(s16 x, s16 y, s16 z)
{
return m_nodes_container->access(v3s16(x,y,z));
}
/******************************************************************************/
bool Pathfinder::isValidIndex(v3s16 index)
{
if ( (index.X < m_max_index_x) &&
(index.Y < m_max_index_y) &&
(index.Z < m_max_index_z) &&
(index.X >= 0) &&
(index.Y >= 0) &&
(index.Z >= 0))
return true;
return false;
}
/******************************************************************************/
v3s16 Pathfinder::invert(v3s16 pos)
{
v3s16 retval = pos;
retval.X *=-1;
retval.Y *=-1;
retval.Z *=-1;
return retval;
}
/******************************************************************************/
bool Pathfinder::updateAllCosts(v3s16 ipos,
v3s16 srcdir,
int current_cost,
int level)
{
PathGridnode &g_pos = getIndexElement(ipos);
g_pos.totalcost = current_cost;
g_pos.sourcedir = srcdir;
level ++;
//check if target has been found
if (g_pos.target) {
m_min_target_distance = current_cost;
DEBUG_OUT(LVL " Pathfinder: target found!" << std::endl);
return true;
}
bool retval = false;
std::vector<v3s16> directions;
directions.emplace_back(1,0, 0);
directions.emplace_back(-1,0, 0);
directions.emplace_back(0,0, 1);
directions.emplace_back(0,0,-1);
for (v3s16 &direction : directions) {
if (direction != srcdir) {
PathCost cost = g_pos.getCost(direction);
if (cost.valid) {
direction.Y = cost.direction;
v3s16 ipos2 = ipos + direction;
if (!isValidIndex(ipos2)) {
DEBUG_OUT(LVL " Pathfinder: " << PP(ipos2) <<
" out of range, max=" << PP(m_limits.MaxEdge) << std::endl);
continue;
}
PathGridnode &g_pos2 = getIndexElement(ipos2);
if (!g_pos2.valid) {
VERBOSE_TARGET << LVL "Pathfinder: no data for new position: "
<< PP(ipos2) << std::endl;
continue;
}
assert(cost.value > 0);
int new_cost = current_cost + cost.value;
// check if there already is a smaller path
if ((m_min_target_distance > 0) &&
(m_min_target_distance < new_cost)) {
return false;
}
if ((g_pos2.totalcost < 0) ||
(g_pos2.totalcost > new_cost)) {
DEBUG_OUT(LVL "Pathfinder: updating path at: "<<
PP(ipos2) << " from: " << g_pos2.totalcost << " to "<<
new_cost << std::endl);
if (updateAllCosts(ipos2, invert(direction),
new_cost, level)) {
retval = true;
}
}
else {
DEBUG_OUT(LVL "Pathfinder:"
" already found shorter path to: "
<< PP(ipos2) << std::endl);
}
}
else {
DEBUG_OUT(LVL "Pathfinder:"
" not moving to invalid direction: "
<< PP(directions[i]) << std::endl);
}
}
}
return retval;
}
/******************************************************************************/
int Pathfinder::getXZManhattanDist(v3s16 pos)
{
int min_x = MYMIN(pos.X, m_destination.X);
int max_x = MYMAX(pos.X, m_destination.X);
int min_z = MYMIN(pos.Z, m_destination.Z);
int max_z = MYMAX(pos.Z, m_destination.Z);
return (max_x - min_x) + (max_z - min_z);
}
/******************************************************************************/
v3s16 Pathfinder::getDirHeuristic(std::vector<v3s16> &directions, PathGridnode &g_pos)
{
int minscore = -1;
v3s16 retdir = v3s16(0, 0, 0);
v3s16 srcpos = g_pos.pos;
DEBUG_OUT("Pathfinder: remaining dirs at beginning:"
<< directions.size() << std::endl);
for (v3s16 &direction : directions) {
v3s16 pos1 = v3s16(srcpos.X + direction.X, 0, srcpos.Z+ direction.Z);
int cur_manhattan = getXZManhattanDist(pos1);
PathCost cost = g_pos.getCost(direction);
if (!cost.updated) {
cost = calcCost(g_pos.pos, direction);
g_pos.setCost(direction, cost);
}
if (cost.valid) {
int score = cost.value + cur_manhattan;
if ((minscore < 0)|| (score < minscore)) {
minscore = score;
retdir = direction;
}
}
}
if (retdir != v3s16(0, 0, 0)) {
for (std::vector<v3s16>::iterator iter = directions.begin();
iter != directions.end();
++iter) {
if(*iter == retdir) {
DEBUG_OUT("Pathfinder: removing return direction" << std::endl);
directions.erase(iter);
break;
}
}
}
else {
DEBUG_OUT("Pathfinder: didn't find any valid direction clearing"
<< std::endl);
directions.clear();
}
DEBUG_OUT("Pathfinder: remaining dirs at end:" << directions.size()
<< std::endl);
return retdir;
}
/******************************************************************************/
bool Pathfinder::updateCostHeuristic( v3s16 ipos,
v3s16 srcdir,
int current_cost,
int level)
{
PathGridnode &g_pos = getIndexElement(ipos);
g_pos.totalcost = current_cost;
g_pos.sourcedir = srcdir;
level ++;
//check if target has been found
if (g_pos.target) {
m_min_target_distance = current_cost;
DEBUG_OUT(LVL " Pathfinder: target found!" << std::endl);
return true;
}
bool retval = false;
std::vector<v3s16> directions;
directions.emplace_back(1, 0, 0);
directions.emplace_back(-1, 0, 0);
directions.emplace_back(0, 0, 1);
directions.emplace_back(0, 0, -1);
v3s16 direction = getDirHeuristic(directions, g_pos);
while (direction != v3s16(0, 0, 0) && (!retval)) {
if (direction != srcdir) {
PathCost cost = g_pos.getCost(direction);
if (cost.valid) {
direction.Y = cost.direction;
v3s16 ipos2 = ipos + direction;
if (!isValidIndex(ipos2)) {
DEBUG_OUT(LVL " Pathfinder: " << PP(ipos2) <<
" out of range, max=" << PP(m_limits.MaxEdge) << std::endl);
direction = getDirHeuristic(directions, g_pos);
continue;
}
PathGridnode &g_pos2 = getIndexElement(ipos2);
if (!g_pos2.valid) {
VERBOSE_TARGET << LVL "Pathfinder: no data for new position: "
<< PP(ipos2) << std::endl;
direction = getDirHeuristic(directions, g_pos);
continue;
}
assert(cost.value > 0);
int new_cost = current_cost + cost.value;
// check if there already is a smaller path
if ((m_min_target_distance > 0) &&
(m_min_target_distance < new_cost)) {
DEBUG_OUT(LVL "Pathfinder:"
" already longer than best already found path "
<< PP(ipos2) << std::endl);
return false;
}
if ((g_pos2.totalcost < 0) ||
(g_pos2.totalcost > new_cost)) {
DEBUG_OUT(LVL "Pathfinder: updating path at: "<<
PP(ipos2) << " from: " << g_pos2.totalcost << " to "<<
new_cost << " srcdir=" <<
PP(invert(direction))<< std::endl);
if (updateCostHeuristic(ipos2, invert(direction),
new_cost, level)) {
retval = true;
}
}
else {
DEBUG_OUT(LVL "Pathfinder:"
" already found shorter path to: "
<< PP(ipos2) << std::endl);
}
}
else {
DEBUG_OUT(LVL "Pathfinder:"
" not moving to invalid direction: "
<< PP(direction) << std::endl);
}
}
else {
DEBUG_OUT(LVL "Pathfinder:"
" skipping srcdir: "
<< PP(direction) << std::endl);
}
direction = getDirHeuristic(directions, g_pos);
}
return retval;
}
/******************************************************************************/
void Pathfinder::buildPath(std::vector<v3s16> &path, v3s16 pos, int level)
{
level ++;
if (level > 700) {
ERROR_TARGET
<< LVL "Pathfinder: path is too long aborting" << std::endl;
return;
}
PathGridnode &g_pos = getIndexElement(pos);
if (!g_pos.valid) {
ERROR_TARGET
<< LVL "Pathfinder: invalid next pos detected aborting" << std::endl;
return;
}
g_pos.is_element = true;
//check if source reached
if (g_pos.source) {
path.push_back(pos);
return;
}
buildPath(path, pos + g_pos.sourcedir, level);
path.push_back(pos);
}
/******************************************************************************/
v3f Pathfinder::tov3f(v3s16 pos)
{
return v3f(BS * pos.X, BS * pos.Y, BS * pos.Z);
}
#ifdef PATHFINDER_DEBUG
/******************************************************************************/
void Pathfinder::printCost()
{
printCost(DIR_XP);
printCost(DIR_XM);
printCost(DIR_ZP);
printCost(DIR_ZM);
}
/******************************************************************************/
void Pathfinder::printYdir()
{
printYdir(DIR_XP);
printYdir(DIR_XM);
printYdir(DIR_ZP);
printYdir(DIR_ZM);
}
/******************************************************************************/
void Pathfinder::printCost(PathDirections dir)
{
std::cout << "Cost in direction: " << dirToName(dir) << std::endl;
std::cout << std::setfill('-') << std::setw(80) << "-" << std::endl;
std::cout << std::setfill(' ');
for (int y = 0; y < m_max_index_y; y++) {
std::cout << "Level: " << y << std::endl;
std::cout << std::setw(4) << " " << " ";
for (int x = 0; x < m_max_index_x; x++) {
std::cout << std::setw(4) << x;
}
std::cout << std::endl;
for (int z = 0; z < m_max_index_z; z++) {
std::cout << std::setw(4) << z <<": ";
for (int x = 0; x < m_max_index_x; x++) {
if (getIdxElem(x, y, z).directions[dir].valid)
std::cout << std::setw(4)
<< getIdxElem(x, y, z).directions[dir].value;
else
std::cout << std::setw(4) << "-";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
}
/******************************************************************************/
void Pathfinder::printYdir(PathDirections dir)
{
std::cout << "Height difference in direction: " << dirToName(dir) << std::endl;
std::cout << std::setfill('-') << std::setw(80) << "-" << std::endl;
std::cout << std::setfill(' ');
for (int y = 0; y < m_max_index_y; y++) {
std::cout << "Level: " << y << std::endl;
std::cout << std::setw(4) << " " << " ";
for (int x = 0; x < m_max_index_x; x++) {
std::cout << std::setw(4) << x;
}
std::cout << std::endl;
for (int z = 0; z < m_max_index_z; z++) {
std::cout << std::setw(4) << z <<": ";
for (int x = 0; x < m_max_index_x; x++) {
if (getIdxElem(x, y, z).directions[dir].valid)
std::cout << std::setw(4)
<< getIdxElem(x, y, z).directions[dir].direction;
else
std::cout << std::setw(4) << "-";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
}
/******************************************************************************/
void Pathfinder::printType()
{
std::cout << "Type of node:" << std::endl;
std::cout << std::setfill('-') << std::setw(80) << "-" << std::endl;
std::cout << std::setfill(' ');
for (int y = 0; y < m_max_index_y; y++) {
std::cout << "Level: " << y << std::endl;
std::cout << std::setw(3) << " " << " ";
for (int x = 0; x < m_max_index_x; x++) {
std::cout << std::setw(3) << x;
}
std::cout << std::endl;
for (int z = 0; z < m_max_index_z; z++) {
std::cout << std::setw(3) << z <<": ";
for (int x = 0; x < m_max_index_x; x++) {
char toshow = getIdxElem(x, y, z).type;
std::cout << std::setw(3) << toshow;
}
std::cout << std::endl;
}
std::cout << std::endl;
}
std::cout << std::endl;
}
/******************************************************************************/
void Pathfinder::printPathLen()
{
std::cout << "Pathlen:" << std::endl;
std::cout << std::setfill('-') << std::setw(80) << "-" << std::endl;
std::cout << std::setfill(' ');
for (int y = 0; y < m_max_index_y; y++) {
std::cout << "Level: " << y << std::endl;
std::cout << std::setw(3) << " " << " ";
for (int x = 0; x < m_max_index_x; x++) {
std::cout << std::setw(3) << x;
}
std::cout << std::endl;
for (int z = 0; z < m_max_index_z; z++) {
std::cout << std::setw(3) << z <<": ";
for (int x = 0; x < m_max_index_x; x++) {
std::cout << std::setw(3) << getIdxElem(x, y, z).totalcost;
}
std::cout << std::endl;
}
std::cout << std::endl;
}
std::cout << std::endl;
}
/******************************************************************************/
std::string Pathfinder::dirToName(PathDirections dir)
{
switch (dir) {
case DIR_XP:
return "XP";
break;
case DIR_XM:
return "XM";
break;
case DIR_ZP:
return "ZP";
break;
case DIR_ZM:
return "ZM";
break;
default:
return "UKN";
}
}
/******************************************************************************/
void Pathfinder::printPath(std::vector<v3s16> path)
{
unsigned int current = 0;
for (std::vector<v3s16>::iterator i = path.begin();
i != path.end(); ++i) {
std::cout << std::setw(3) << current << ":" << PP((*i)) << std::endl;
current++;
}
}
#endif